From cb8a91067d40ed64793aa88ad3ffefadbe665ce2 Mon Sep 17 00:00:00 2001 From: Daniel Lee Date: Fri, 20 Dec 2013 15:57:05 -0500 Subject: [PATCH] adding artifacts (manual + api doc) to the repository for v2.1.0 --- doc/api/html/_eigen_8dox.html | 115 + doc/api/html/_eigen_8hpp.html | 134 + doc/api/html/_eigen_8hpp_source.html | 115 + doc/api/html/_eigen___num_traits_8hpp.html | 232 + .../html/_eigen___num_traits_8hpp_source.html | 289 + doc/api/html/accumulator_8hpp.html | 130 + doc/api/html/accumulator_8hpp_source.html | 146 + doc/api/html/adapt__dense__e__nuts_8hpp.html | 129 + .../adapt__dense__e__nuts_8hpp_source.html | 171 + .../adapt__dense__e__static__hmc_8hpp.html | 129 + ...pt__dense__e__static__hmc_8hpp_source.html | 174 + doc/api/html/adapt__diag__e__nuts_8hpp.html | 129 + .../adapt__diag__e__nuts_8hpp_source.html | 171 + .../adapt__diag__e__static__hmc_8hpp.html | 129 + ...apt__diag__e__static__hmc_8hpp_source.html | 174 + doc/api/html/adapt__unit__e__nuts_8hpp.html | 129 + .../adapt__unit__e__nuts_8hpp_source.html | 157 + .../adapt__unit__e__static__hmc_8hpp.html | 129 + ...apt__unit__e__static__hmc_8hpp_source.html | 160 + doc/api/html/add_8hpp.html | 146 + doc/api/html/add_8hpp_source.html | 157 + .../agrad_2fwd_2functions_2_phi_8hpp.html | 132 + ...rad_2fwd_2functions_2_phi_8hpp_source.html | 131 + .../html/agrad_2fwd_2functions_2abs_8hpp.html | 131 + ...grad_2fwd_2functions_2abs_8hpp_source.html | 135 + ..._2functions_2bessel__first__kind_8hpp.html | 131 + ...ions_2bessel__first__kind_8hpp_source.html | 132 + ...2functions_2bessel__second__kind_8hpp.html | 131 + ...ons_2bessel__second__kind_8hpp_source.html | 132 + ...wd_2functions_2binary__log__loss_8hpp.html | 131 + ...ctions_2binary__log__loss_8hpp_source.html | 132 + ...ions_2binomial__coefficient__log_8hpp.html | 138 + ...inomial__coefficient__log_8hpp_source.html | 197 + .../agrad_2fwd_2functions_2digamma_8hpp.html | 132 + ..._2fwd_2functions_2digamma_8hpp_source.html | 130 + .../agrad_2fwd_2functions_2exp2_8hpp.html | 132 + ...rad_2fwd_2functions_2exp2_8hpp_source.html | 130 + .../html/agrad_2fwd_2functions_2exp_8hpp.html | 130 + ...grad_2fwd_2functions_2exp_8hpp_source.html | 128 + ...d_2functions_2falling__factorial_8hpp.html | 138 + ...tions_2falling__factorial_8hpp_source.html | 154 + .../agrad_2fwd_2functions_2fdim_8hpp.html | 137 + ...rad_2fwd_2functions_2fdim_8hpp_source.html | 157 + .../html/agrad_2fwd_2functions_2fma_8hpp.html | 163 + ...grad_2fwd_2functions_2fma_8hpp_source.html | 190 + .../agrad_2fwd_2functions_2gamma__p_8hpp.html | 138 + ...2fwd_2functions_2gamma__p_8hpp_source.html | 209 + .../agrad_2fwd_2functions_2gamma__q_8hpp.html | 137 + ...2fwd_2functions_2gamma__q_8hpp_source.html | 208 + .../html/agrad_2fwd_2functions_2inv_8hpp.html | 131 + ...grad_2fwd_2functions_2inv_8hpp_source.html | 128 + ...ad_2fwd_2functions_2inv__cloglog_8hpp.html | 131 + ..._2functions_2inv__cloglog_8hpp_source.html | 129 + ...grad_2fwd_2functions_2inv__logit_8hpp.html | 131 + ...wd_2functions_2inv__logit_8hpp_source.html | 131 + ...agrad_2fwd_2functions_2inv__sqrt_8hpp.html | 131 + ...fwd_2functions_2inv__sqrt_8hpp_source.html | 129 + ...rad_2fwd_2functions_2inv__square_8hpp.html | 131 + ...d_2functions_2inv__square_8hpp_source.html | 129 + .../agrad_2fwd_2functions_2lbeta_8hpp.html | 138 + ...ad_2fwd_2functions_2lbeta_8hpp_source.html | 153 + .../agrad_2fwd_2functions_2lgamma_8hpp.html | 131 + ...d_2fwd_2functions_2lgamma_8hpp_source.html | 129 + .../agrad_2fwd_2functions_2lmgamma_8hpp.html | 134 + ..._2fwd_2functions_2lmgamma_8hpp_source.html | 135 + .../agrad_2fwd_2functions_2log1m_8hpp.html | 132 + ...ad_2fwd_2functions_2log1m_8hpp_source.html | 133 + ...grad_2fwd_2functions_2log1m__exp_8hpp.html | 133 + ...wd_2functions_2log1m__exp_8hpp_source.html | 135 + ...wd_2functions_2log1m__inv__logit_8hpp.html | 131 + ...ctions_2log1m__inv__logit_8hpp_source.html | 130 + .../agrad_2fwd_2functions_2log1p_8hpp.html | 132 + ...ad_2fwd_2functions_2log1p_8hpp_source.html | 133 + ...grad_2fwd_2functions_2log1p__exp_8hpp.html | 131 + ...wd_2functions_2log1p__exp_8hpp_source.html | 129 + .../agrad_2fwd_2functions_2log2_8hpp.html | 132 + ...rad_2fwd_2functions_2log2_8hpp_source.html | 135 + .../html/agrad_2fwd_2functions_2log_8hpp.html | 131 + ...grad_2fwd_2functions_2log_8hpp_source.html | 132 + ..._2fwd_2functions_2log__diff__exp_8hpp.html | 138 + ...functions_2log__diff__exp_8hpp_source.html | 154 + ...nctions_2log__falling__factorial_8hpp.html | 138 + ..._2log__falling__factorial_8hpp_source.html | 151 + ...2fwd_2functions_2log__inv__logit_8hpp.html | 131 + ...unctions_2log__inv__logit_8hpp_source.html | 130 + ...unctions_2log__rising__factorial_8hpp.html | 138 + ...s_2log__rising__factorial_8hpp_source.html | 155 + ...d_2fwd_2functions_2log__sum__exp_8hpp.html | 140 + ...2functions_2log__sum__exp_8hpp_source.html | 170 + .../agrad_2fwd_2functions_2logit_8hpp.html | 133 + ...ad_2fwd_2functions_2logit_8hpp_source.html | 135 + ...s_2modified__bessel__first__kind_8hpp.html | 131 + ...fied__bessel__first__kind_8hpp_source.html | 132 + ..._2modified__bessel__second__kind_8hpp.html | 131 + ...ied__bessel__second__kind_8hpp_source.html | 132 + ...d_2fwd_2functions_2multiply__log_8hpp.html | 137 + ...2functions_2multiply__log_8hpp_source.html | 150 + .../agrad_2fwd_2functions_2owens__t_8hpp.html | 138 + ...2fwd_2functions_2owens__t_8hpp_source.html | 175 + ...wd_2functions_2rising__factorial_8hpp.html | 138 + ...ctions_2rising__factorial_8hpp_source.html | 157 + .../agrad_2fwd_2functions_2square_8hpp.html | 131 + ...d_2fwd_2functions_2square_8hpp_source.html | 129 + doc/api/html/agrad_2fwd_2functions_8hpp.html | 180 + .../agrad_2fwd_2functions_8hpp_source.html | 183 + ...d_2matrix_2columns__dot__product_8hpp.html | 141 + ...ix_2columns__dot__product_8hpp_source.html | 169 + ...2fwd_2matrix_2columns__dot__self_8hpp.html | 134 + ...atrix_2columns__dot__self_8hpp_source.html | 133 + .../agrad_2fwd_2matrix_2crossprod_8hpp.html | 134 + ...d_2fwd_2matrix_2crossprod_8hpp_source.html | 132 + .../agrad_2fwd_2matrix_2determinant_8hpp.html | 137 + ...2fwd_2matrix_2determinant_8hpp_source.html | 153 + .../html/agrad_2fwd_2matrix_2divide_8hpp.html | 152 + ...grad_2fwd_2matrix_2divide_8hpp_source.html | 182 + ...agrad_2fwd_2matrix_2dot__product_8hpp.html | 169 + ...fwd_2matrix_2dot__product_8hpp_source.html | 287 + .../agrad_2fwd_2matrix_2dot__self_8hpp.html | 134 + ...d_2fwd_2matrix_2dot__self_8hpp_source.html | 129 + .../agrad_2fwd_2matrix_2inverse_8hpp.html | 138 + ...rad_2fwd_2matrix_2inverse_8hpp_source.html | 151 + ...d_2fwd_2matrix_2log__determinant_8hpp.html | 136 + ...2matrix_2log__determinant_8hpp_source.html | 133 + ...agrad_2fwd_2matrix_2log__softmax_8hpp.html | 134 + ...fwd_2matrix_2log__softmax_8hpp_source.html | 166 + ...grad_2fwd_2matrix_2log__sum__exp_8hpp.html | 132 + ...wd_2matrix_2log__sum__exp_8hpp_source.html | 142 + ...grad_2fwd_2matrix_2mdivide__left_8hpp.html | 147 + ...wd_2matrix_2mdivide__left_8hpp_source.html | 231 + ...2matrix_2mdivide__left__tri__low_8hpp.html | 144 + ..._2mdivide__left__tri__low_8hpp_source.html | 243 + ...rad_2fwd_2matrix_2mdivide__right_8hpp.html | 143 + ...d_2matrix_2mdivide__right_8hpp_source.html | 228 + ...matrix_2mdivide__right__tri__low_8hpp.html | 144 + ...2mdivide__right__tri__low_8hpp_source.html | 240 + .../agrad_2fwd_2matrix_2multiply_8hpp.html | 171 + ...ad_2fwd_2matrix_2multiply_8hpp_source.html | 268 + ...ply__lower__tri__self__transpose_8hpp.html | 134 + ...wer__tri__self__transpose_8hpp_source.html | 140 + ...2fwd_2matrix_2rows__dot__product_8hpp.html | 141 + ...atrix_2rows__dot__product_8hpp_source.html | 171 + ...ad_2fwd_2matrix_2rows__dot__self_8hpp.html | 134 + ..._2matrix_2rows__dot__self_8hpp_source.html | 133 + .../agrad_2fwd_2matrix_2softmax_8hpp.html | 132 + ...rad_2fwd_2matrix_2softmax_8hpp_source.html | 165 + .../html/agrad_2fwd_2matrix_2sort_8hpp.html | 143 + .../agrad_2fwd_2matrix_2sort_8hpp_source.html | 156 + .../html/agrad_2fwd_2matrix_2sum_8hpp.html | 131 + .../agrad_2fwd_2matrix_2sum_8hpp_source.html | 133 + .../agrad_2fwd_2matrix_2tcrossprod_8hpp.html | 134 + ..._2fwd_2matrix_2tcrossprod_8hpp_source.html | 132 + .../agrad_2fwd_2matrix_2typedefs_8hpp.html | 179 + ...ad_2fwd_2matrix_2typedefs_8hpp_source.html | 173 + doc/api/html/agrad_2fwd_2matrix_8hpp.html | 134 + .../html/agrad_2fwd_2matrix_8hpp_source.html | 137 + ..._2univariate_2continuous_2normal_8hpp.html | 142 + ...riate_2continuous_2normal_8hpp_source.html | 163 + ...ng_2matrix_2check__pos__definite_8hpp.html | 132 + ...rix_2check__pos__definite_8hpp_source.html | 138 + ...ad_2rev_2error__handling_2matrix_8hpp.html | 110 + ..._2error__handling_2matrix_8hpp_source.html | 113 + .../agrad_2rev_2error__handling_8hpp.html | 109 + ...rad_2rev_2error__handling_8hpp_source.html | 111 + .../agrad_2rev_2functions_2_phi_8hpp.html | 131 + ...rad_2rev_2functions_2_phi_8hpp_source.html | 138 + ...ad_2rev_2functions_2_phi__approx_8hpp.html | 131 + ..._2functions_2_phi__approx_8hpp_source.html | 131 + .../html/agrad_2rev_2functions_2abs_8hpp.html | 129 + ...grad_2rev_2functions_2abs_8hpp_source.html | 122 + .../agrad_2rev_2functions_2as__bool_8hpp.html | 129 + ...2rev_2functions_2as__bool_8hpp_source.html | 122 + ..._2functions_2bessel__first__kind_8hpp.html | 133 + ...ions_2bessel__first__kind_8hpp_source.html | 141 + ...2functions_2bessel__second__kind_8hpp.html | 133 + ...ons_2bessel__second__kind_8hpp_source.html | 141 + ...ev_2functions_2binary__log__loss_8hpp.html | 133 + ...ctions_2binary__log__loss_8hpp_source.html | 151 + .../agrad_2rev_2functions_2digamma_8hpp.html | 132 + ..._2rev_2functions_2digamma_8hpp_source.html | 138 + .../agrad_2rev_2functions_2exp2_8hpp.html | 132 + ...rad_2rev_2functions_2exp2_8hpp_source.html | 137 + .../html/agrad_2rev_2functions_2exp_8hpp.html | 131 + ...grad_2rev_2functions_2exp_8hpp_source.html | 136 + ...v_2functions_2falling__factorial_8hpp.html | 137 + ...tions_2falling__factorial_8hpp_source.html | 171 + .../agrad_2rev_2functions_2fdim_8hpp.html | 137 + ...rad_2rev_2functions_2fdim_8hpp_source.html | 176 + .../html/agrad_2rev_2functions_2fma_8hpp.html | 154 + ...grad_2rev_2functions_2fma_8hpp_source.html | 229 + .../agrad_2rev_2functions_2gamma__p_8hpp.html | 139 + ...2rev_2functions_2gamma__p_8hpp_source.html | 215 + .../agrad_2rev_2functions_2gamma__q_8hpp.html | 140 + ...2rev_2functions_2gamma__q_8hpp_source.html | 185 + .../agrad_2rev_2functions_2ibeta_8hpp.html | 139 + ...ad_2rev_2functions_2ibeta_8hpp_source.html | 315 + .../agrad_2rev_2functions_2if__else_8hpp.html | 135 + ...2rev_2functions_2if__else_8hpp_source.html | 134 + .../html/agrad_2rev_2functions_2inv_8hpp.html | 131 + ...grad_2rev_2functions_2inv_8hpp_source.html | 137 + ...ad_2rev_2functions_2inv__cloglog_8hpp.html | 131 + ..._2functions_2inv__cloglog_8hpp_source.html | 136 + ...grad_2rev_2functions_2inv__logit_8hpp.html | 131 + ...ev_2functions_2inv__logit_8hpp_source.html | 136 + ...agrad_2rev_2functions_2inv__sqrt_8hpp.html | 131 + ...rev_2functions_2inv__sqrt_8hpp_source.html | 137 + ...rad_2rev_2functions_2inv__square_8hpp.html | 131 + ...v_2functions_2inv__square_8hpp_source.html | 137 + ...ev_2functions_2is__uninitialized_8hpp.html | 132 + ...ctions_2is__uninitialized_8hpp_source.html | 126 + .../agrad_2rev_2functions_2lgamma_8hpp.html | 134 + ...d_2rev_2functions_2lgamma_8hpp_source.html | 140 + .../agrad_2rev_2functions_2lmgamma_8hpp.html | 133 + ..._2rev_2functions_2lmgamma_8hpp_source.html | 142 + .../agrad_2rev_2functions_2log1m_8hpp.html | 131 + ...ad_2rev_2functions_2log1m_8hpp_source.html | 136 + ...grad_2rev_2functions_2log1m__exp_8hpp.html | 133 + ...ev_2functions_2log1m__exp_8hpp_source.html | 140 + .../agrad_2rev_2functions_2log1p_8hpp.html | 133 + ...ad_2rev_2functions_2log1p_8hpp_source.html | 138 + ...grad_2rev_2functions_2log1p__exp_8hpp.html | 132 + ...ev_2functions_2log1p__exp_8hpp_source.html | 138 + .../agrad_2rev_2functions_2log2_8hpp.html | 132 + ...rad_2rev_2functions_2log2_8hpp_source.html | 137 + .../html/agrad_2rev_2functions_2log_8hpp.html | 131 + ...grad_2rev_2functions_2log_8hpp_source.html | 136 + ..._2rev_2functions_2log__diff__exp_8hpp.html | 144 + ...functions_2log__diff__exp_8hpp_source.html | 174 + ...nctions_2log__falling__factorial_8hpp.html | 137 + ..._2log__falling__factorial_8hpp_source.html | 171 + ...unctions_2log__rising__factorial_8hpp.html | 137 + ...s_2log__rising__factorial_8hpp_source.html | 172 + ...d_2rev_2functions_2log__sum__exp_8hpp.html | 146 + ...2functions_2log__sum__exp_8hpp_source.html | 203 + ...s_2modified__bessel__first__kind_8hpp.html | 130 + ...fied__bessel__first__kind_8hpp_source.html | 138 + ..._2modified__bessel__second__kind_8hpp.html | 130 + ...ied__bessel__second__kind_8hpp_source.html | 138 + ...d_2rev_2functions_2multiply__log_8hpp.html | 141 + ...2functions_2multiply__log_8hpp_source.html | 175 + .../agrad_2rev_2functions_2owens__t_8hpp.html | 140 + ...2rev_2functions_2owens__t_8hpp_source.html | 173 + ...ev_2functions_2rising__factorial_8hpp.html | 137 + ...ctions_2rising__factorial_8hpp_source.html | 171 + .../agrad_2rev_2functions_2square_8hpp.html | 130 + ...d_2rev_2functions_2square_8hpp_source.html | 135 + .../agrad_2rev_2functions_2step_8hpp.html | 129 + ...rad_2rev_2functions_2step_8hpp_source.html | 122 + ...agrad_2rev_2functions_2value__of_8hpp.html | 129 + ...rev_2functions_2value__of_8hpp_source.html | 122 + doc/api/html/agrad_2rev_2functions_8hpp.html | 182 + .../agrad_2rev_2functions_8hpp_source.html | 185 + .../agrad_2rev_2matrix_2crossprod_8hpp.html | 130 + ...d_2rev_2matrix_2crossprod_8hpp_source.html | 124 + .../agrad_2rev_2matrix_2determinant_8hpp.html | 201 + ...2rev_2matrix_2determinant_8hpp_source.html | 182 + .../html/agrad_2rev_2matrix_2divide_8hpp.html | 144 + ...grad_2rev_2matrix_2divide_8hpp_source.html | 141 + ...agrad_2rev_2matrix_2dot__product_8hpp.html | 221 + ...rev_2matrix_2dot__product_8hpp_source.html | 368 + .../agrad_2rev_2matrix_2dot__self_8hpp.html | 176 + ...d_2rev_2matrix_2dot__self_8hpp_source.html | 192 + .../html/agrad_2rev_2matrix_2ldlt_8hpp.html | 411 + .../agrad_2rev_2matrix_2ldlt_8hpp_source.html | 636 + ...d_2rev_2matrix_2log__determinant_8hpp.html | 201 + ...2matrix_2log__determinant_8hpp_source.html | 184 + ...v_2matrix_2log__determinant__spd_8hpp.html | 208 + ...ix_2log__determinant__spd_8hpp_source.html | 231 + ...agrad_2rev_2matrix_2log__softmax_8hpp.html | 201 + ...rev_2matrix_2log__softmax_8hpp_source.html | 221 + ...grad_2rev_2matrix_2log__sum__exp_8hpp.html | 139 + ...ev_2matrix_2log__sum__exp_8hpp_source.html | 167 + ...grad_2rev_2matrix_2mdivide__left_8hpp.html | 248 + ...ev_2matrix_2mdivide__left_8hpp_source.html | 439 + ...2rev_2matrix_2mdivide__left__spd_8hpp.html | 254 + ...atrix_2mdivide__left__spd_8hpp_source.html | 419 + ...2rev_2matrix_2mdivide__left__tri_8hpp.html | 248 + ...atrix_2mdivide__left__tri_8hpp_source.html | 469 + .../agrad_2rev_2matrix_2multiply_8hpp.html | 172 + ...ad_2rev_2matrix_2multiply_8hpp_source.html | 202 + ...ply__lower__tri__self__transpose_8hpp.html | 139 + ...wer__tri__self__transpose_8hpp_source.html | 160 + .../agrad_2rev_2matrix_2quad__form_8hpp.html | 233 + ..._2rev_2matrix_2quad__form_8hpp_source.html | 297 + doc/api/html/agrad_2rev_2matrix_2sd_8hpp.html | 139 + .../agrad_2rev_2matrix_2sd_8hpp_source.html | 188 + .../agrad_2rev_2matrix_2softmax_8hpp.html | 198 + ...rad_2rev_2matrix_2softmax_8hpp_source.html | 191 + .../html/agrad_2rev_2matrix_2sort_8hpp.html | 148 + .../agrad_2rev_2matrix_2sort_8hpp_source.html | 148 + ...grad_2rev_2matrix_2squared__dist_8hpp.html | 194 + ...ev_2matrix_2squared__dist_8hpp_source.html | 228 + .../agrad_2rev_2matrix_2stan__print_8hpp.html | 129 + ...2rev_2matrix_2stan__print_8hpp_source.html | 123 + .../html/agrad_2rev_2matrix_2sum_8hpp.html | 172 + .../agrad_2rev_2matrix_2sum_8hpp_source.html | 177 + .../agrad_2rev_2matrix_2tcrossprod_8hpp.html | 140 + ..._2rev_2matrix_2tcrossprod_8hpp_source.html | 161 + ..._2matrix_2trace__gen__quad__form_8hpp.html | 201 + ...x_2trace__gen__quad__form_8hpp_source.html | 234 + ..._2rev_2matrix_2trace__quad__form_8hpp.html | 185 + ...matrix_2trace__quad__form_8hpp_source.html | 219 + .../agrad_2rev_2matrix_2typedefs_8hpp.html | 139 + ...ad_2rev_2matrix_2typedefs_8hpp_source.html | 132 + .../agrad_2rev_2matrix_2value__of_8hpp.html | 136 + ...d_2rev_2matrix_2value__of_8hpp_source.html | 133 + .../agrad_2rev_2matrix_2variance_8hpp.html | 138 + ...ad_2rev_2matrix_2variance_8hpp_source.html | 176 + doc/api/html/agrad_2rev_2matrix_8hpp.html | 143 + .../html/agrad_2rev_2matrix_8hpp_source.html | 147 + doc/api/html/agrad_8hpp.html | 109 + doc/api/html/agrad_8hpp_source.html | 119 + doc/api/html/agrad__thread__safe_8hpp.html | 473 + .../html/agrad__thread__safe_8hpp_source.html | 1156 + doc/api/html/annotated.html | 496 + doc/api/html/arg__adapt_8hpp.html | 136 + doc/api/html/arg__adapt_8hpp_source.html | 153 + doc/api/html/arg__adapt__delta_8hpp.html | 128 + .../html/arg__adapt__delta_8hpp_source.html | 141 + doc/api/html/arg__adapt__engaged_8hpp.html | 128 + .../html/arg__adapt__engaged_8hpp_source.html | 139 + doc/api/html/arg__adapt__gamma_8hpp.html | 128 + .../html/arg__adapt__gamma_8hpp_source.html | 142 + .../html/arg__adapt__init__buffer_8hpp.html | 128 + .../arg__adapt__init__buffer_8hpp_source.html | 136 + doc/api/html/arg__adapt__kappa_8hpp.html | 128 + .../html/arg__adapt__kappa_8hpp_source.html | 142 + doc/api/html/arg__adapt__t0_8hpp.html | 128 + doc/api/html/arg__adapt__t0_8hpp_source.html | 142 + .../html/arg__adapt__term__buffer_8hpp.html | 128 + .../arg__adapt__term__buffer_8hpp_source.html | 136 + doc/api/html/arg__adapt__window_8hpp.html | 128 + .../html/arg__adapt__window_8hpp_source.html | 136 + doc/api/html/arg__bfgs_8hpp.html | 130 + doc/api/html/arg__bfgs_8hpp_source.html | 145 + doc/api/html/arg__data_8hpp.html | 129 + doc/api/html/arg__data_8hpp_source.html | 138 + doc/api/html/arg__data__file_8hpp.html | 128 + doc/api/html/arg__data__file_8hpp_source.html | 138 + doc/api/html/arg__dense__e_8hpp.html | 128 + doc/api/html/arg__dense__e_8hpp_source.html | 135 + doc/api/html/arg__diag__e_8hpp.html | 128 + doc/api/html/arg__diag__e_8hpp_source.html | 135 + doc/api/html/arg__diagnose_8hpp.html | 129 + doc/api/html/arg__diagnose_8hpp_source.html | 139 + doc/api/html/arg__diagnostic__file_8hpp.html | 128 + .../arg__diagnostic__file_8hpp_source.html | 138 + doc/api/html/arg__engine_8hpp.html | 130 + doc/api/html/arg__engine_8hpp_source.html | 144 + doc/api/html/arg__fail_8hpp.html | 128 + doc/api/html/arg__fail_8hpp_source.html | 135 + doc/api/html/arg__hmc_8hpp.html | 132 + doc/api/html/arg__hmc_8hpp_source.html | 145 + doc/api/html/arg__id_8hpp.html | 128 + doc/api/html/arg__id_8hpp_source.html | 142 + doc/api/html/arg__init_8hpp.html | 128 + doc/api/html/arg__init_8hpp_source.html | 140 + doc/api/html/arg__init__alpha_8hpp.html | 128 + .../html/arg__init__alpha_8hpp_source.html | 141 + doc/api/html/arg__int__time_8hpp.html | 128 + doc/api/html/arg__int__time_8hpp_source.html | 142 + doc/api/html/arg__iter_8hpp.html | 128 + doc/api/html/arg__iter_8hpp_source.html | 142 + doc/api/html/arg__max__depth_8hpp.html | 128 + doc/api/html/arg__max__depth_8hpp_source.html | 142 + doc/api/html/arg__method_8hpp.html | 131 + doc/api/html/arg__method_8hpp_source.html | 146 + doc/api/html/arg__metric_8hpp.html | 131 + doc/api/html/arg__metric_8hpp_source.html | 146 + doc/api/html/arg__nesterov_8hpp.html | 129 + doc/api/html/arg__nesterov_8hpp_source.html | 139 + doc/api/html/arg__newton_8hpp.html | 128 + doc/api/html/arg__newton_8hpp_source.html | 135 + doc/api/html/arg__num__samples_8hpp.html | 128 + .../html/arg__num__samples_8hpp_source.html | 142 + doc/api/html/arg__num__warmup_8hpp.html | 128 + .../html/arg__num__warmup_8hpp_source.html | 142 + doc/api/html/arg__nuts_8hpp.html | 129 + doc/api/html/arg__nuts_8hpp_source.html | 139 + doc/api/html/arg__optimize_8hpp.html | 131 + doc/api/html/arg__optimize_8hpp_source.html | 143 + doc/api/html/arg__optimize__algo_8hpp.html | 131 + .../html/arg__optimize__algo_8hpp_source.html | 146 + doc/api/html/arg__output_8hpp.html | 131 + doc/api/html/arg__output_8hpp_source.html | 143 + doc/api/html/arg__output__file_8hpp.html | 128 + .../html/arg__output__file_8hpp_source.html | 138 + doc/api/html/arg__random_8hpp.html | 129 + doc/api/html/arg__random_8hpp_source.html | 139 + doc/api/html/arg__refresh_8hpp.html | 128 + doc/api/html/arg__refresh_8hpp_source.html | 142 + doc/api/html/arg__rwm_8hpp.html | 128 + doc/api/html/arg__rwm_8hpp_source.html | 135 + doc/api/html/arg__sample_8hpp.html | 134 + doc/api/html/arg__sample_8hpp_source.html | 149 + doc/api/html/arg__sample__algo_8hpp.html | 130 + .../html/arg__sample__algo_8hpp_source.html | 143 + doc/api/html/arg__save__iterations_8hpp.html | 128 + .../arg__save__iterations_8hpp_source.html | 139 + doc/api/html/arg__save__warmup_8hpp.html | 128 + .../html/arg__save__warmup_8hpp_source.html | 139 + doc/api/html/arg__seed_8hpp.html | 128 + doc/api/html/arg__seed_8hpp_source.html | 139 + doc/api/html/arg__static_8hpp.html | 129 + doc/api/html/arg__static_8hpp_source.html | 139 + doc/api/html/arg__stepsize_8hpp.html | 128 + doc/api/html/arg__stepsize_8hpp_source.html | 141 + doc/api/html/arg__stepsize__jitter_8hpp.html | 128 + .../arg__stepsize__jitter_8hpp_source.html | 141 + doc/api/html/arg__test_8hpp.html | 129 + doc/api/html/arg__test_8hpp_source.html | 142 + doc/api/html/arg__test__grad__eps_8hpp.html | 128 + .../arg__test__grad__eps_8hpp_source.html | 141 + doc/api/html/arg__test__grad__err_8hpp.html | 128 + .../arg__test__grad__err_8hpp_source.html | 141 + doc/api/html/arg__test__gradient_8hpp.html | 130 + .../html/arg__test__gradient_8hpp_source.html | 140 + doc/api/html/arg__thin_8hpp.html | 128 + doc/api/html/arg__thin_8hpp_source.html | 142 + doc/api/html/arg__tolerance_8hpp.html | 128 + doc/api/html/arg__tolerance_8hpp_source.html | 141 + doc/api/html/arg__unit__e_8hpp.html | 128 + doc/api/html/arg__unit__e_8hpp_source.html | 135 + doc/api/html/argument_8hpp.html | 131 + doc/api/html/argument_8hpp_source.html | 193 + doc/api/html/argument__parser_8hpp.html | 134 + .../html/argument__parser_8hpp_source.html | 345 + doc/api/html/argument__probe_8hpp.html | 131 + doc/api/html/argument__probe_8hpp_source.html | 147 + doc/api/html/array__builder_8hpp.html | 130 + doc/api/html/array__builder_8hpp_source.html | 135 + doc/api/html/assign_8hpp.html | 152 + doc/api/html/assign_8hpp_source.html | 181 + doc/api/html/ast_8hpp.html | 296 + doc/api/html/ast_8hpp_source.html | 847 + doc/api/html/ast__def_8cpp.html | 183 + doc/api/html/ast__def_8cpp_source.html | 1160 + doc/api/html/autocorrelation_8hpp.html | 138 + doc/api/html/autocorrelation_8hpp_source.html | 203 + doc/api/html/autocovariance_8hpp.html | 135 + doc/api/html/autocovariance_8hpp_source.html | 143 + doc/api/html/autodiff_8hpp.html | 165 + doc/api/html/autodiff_8hpp_source.html | 389 + doc/api/html/base__adaptation_8hpp.html | 127 + .../html/base__adaptation_8hpp_source.html | 127 + doc/api/html/base__adapter_8hpp.html | 127 + doc/api/html/base__adapter_8hpp_source.html | 136 + doc/api/html/base__hamiltonian_8hpp.html | 133 + .../html/base__hamiltonian_8hpp_source.html | 195 + doc/api/html/base__hmc_8hpp.html | 134 + doc/api/html/base__hmc_8hpp_source.html | 259 + doc/api/html/base__integrator_8hpp.html | 128 + .../html/base__integrator_8hpp_source.html | 137 + doc/api/html/base__leapfrog_8hpp.html | 130 + doc/api/html/base__leapfrog_8hpp_source.html | 229 + doc/api/html/base__mcmc_8hpp.html | 130 + doc/api/html/base__mcmc_8hpp_source.html | 161 + doc/api/html/base__nuts_8hpp.html | 134 + doc/api/html/base__nuts_8hpp_source.html | 368 + doc/api/html/base__static__hmc_8hpp.html | 131 + .../html/base__static__hmc_8hpp_source.html | 230 + doc/api/html/bc_s.png | Bin 0 -> 676 bytes doc/api/html/bdwn.png | Bin 0 -> 147 bytes doc/api/html/bernoulli_8hpp.html | 160 + doc/api/html/bernoulli_8hpp_source.html | 539 + doc/api/html/beta_8hpp.html | 162 + doc/api/html/beta_8hpp_source.html | 743 + doc/api/html/beta__binomial_8hpp.html | 160 + doc/api/html/beta__binomial_8hpp_source.html | 708 + doc/api/html/bfgs_8hpp.html | 145 + doc/api/html/bfgs_8hpp_source.html | 706 + doc/api/html/binomial_8hpp.html | 163 + doc/api/html/binomial_8hpp_source.html | 631 + doc/api/html/block_8hpp.html | 133 + doc/api/html/block_8hpp_source.html | 136 + doc/api/html/boost_8dox.html | 115 + doc/api/html/boost__fpclassify_8hpp.html | 147 + .../html/boost__fpclassify_8hpp_source.html | 151 + doc/api/html/calculate__chain_8hpp.html | 128 + .../html/calculate__chain_8hpp_source.html | 120 + doc/api/html/categorical_8hpp.html | 152 + doc/api/html/categorical_8hpp_source.html | 272 + doc/api/html/categorical__argument_8hpp.html | 129 + .../categorical__argument_8hpp_source.html | 268 + doc/api/html/categorical__logit_8hpp.html | 149 + .../html/categorical__logit_8hpp_source.html | 210 + doc/api/html/cauchy_8hpp.html | 159 + doc/api/html/cauchy_8hpp_source.html | 508 + doc/api/html/chainable_8hpp.html | 140 + doc/api/html/chainable_8hpp_source.html | 165 + doc/api/html/chains_8hpp.html | 154 + doc/api/html/chains_8hpp_source.html | 702 + doc/api/html/check__bounded_8hpp.html | 133 + doc/api/html/check__bounded_8hpp_source.html | 197 + .../html/check__cholesky__factor_8hpp.html | 143 + .../check__cholesky__factor_8hpp_source.html | 167 + .../html/check__consistent__size_8hpp.html | 130 + .../check__consistent__size_8hpp_source.html | 135 + .../html/check__consistent__sizes_8hpp.html | 137 + .../check__consistent__sizes_8hpp_source.html | 168 + doc/api/html/check__corr__matrix_8hpp.html | 139 + .../html/check__corr__matrix_8hpp_source.html | 163 + doc/api/html/check__cov__matrix_8hpp.html | 145 + .../html/check__cov__matrix_8hpp_source.html | 177 + doc/api/html/check__finite_8hpp.html | 134 + doc/api/html/check__finite_8hpp_source.html | 171 + doc/api/html/check__greater_8hpp.html | 133 + doc/api/html/check__greater_8hpp_source.html | 182 + .../html/check__greater__or__equal_8hpp.html | 133 + ...check__greater__or__equal_8hpp_source.html | 182 + doc/api/html/check__less_8hpp.html | 133 + doc/api/html/check__less_8hpp_source.html | 181 + doc/api/html/check__less__or__equal_8hpp.html | 133 + .../check__less__or__equal_8hpp_source.html | 176 + .../html/check__lower__triangular_8hpp.html | 136 + .../check__lower__triangular_8hpp_source.html | 150 + doc/api/html/check__nonnegative_8hpp.html | 133 + .../html/check__nonnegative_8hpp_source.html | 170 + doc/api/html/check__not__nan_8hpp.html | 134 + doc/api/html/check__not__nan_8hpp_source.html | 170 + doc/api/html/check__ordered_8hpp.html | 135 + doc/api/html/check__ordered_8hpp_source.html | 153 + .../html/check__pos__semidefinite_8hpp.html | 136 + .../check__pos__semidefinite_8hpp_source.html | 157 + doc/api/html/check__positive_8hpp.html | 135 + doc/api/html/check__positive_8hpp_source.html | 172 + .../html/check__positive__ordered_8hpp.html | 135 + .../check__positive__ordered_8hpp_source.html | 162 + doc/api/html/check__range_8hpp.html | 129 + doc/api/html/check__range_8hpp_source.html | 148 + doc/api/html/check__simplex_8hpp.html | 136 + doc/api/html/check__simplex_8hpp_source.html | 169 + doc/api/html/check__size__match_8hpp.html | 134 + .../html/check__size__match_8hpp_source.html | 153 + doc/api/html/check__spsd__matrix_8hpp.html | 138 + .../html/check__spsd__matrix_8hpp_source.html | 149 + doc/api/html/check__square_8hpp.html | 138 + doc/api/html/check__square_8hpp_source.html | 144 + doc/api/html/check__symmetric_8hpp.html | 137 + .../html/check__symmetric_8hpp_source.html | 159 + doc/api/html/check__unit__vector_8hpp.html | 136 + .../html/check__unit__vector_8hpp_source.html | 156 + doc/api/html/chi__square_8hpp.html | 156 + doc/api/html/chi__square_8hpp_source.html | 570 + doc/api/html/cholesky__decompose_8hpp.html | 132 + .../html/cholesky__decompose_8hpp_source.html | 128 + doc/api/html/chunk__alloc_8hpp.html | 155 + doc/api/html/chunk__alloc_8hpp_source.html | 181 + doc/api/html/class_l_d_l_t__factor.html | 116 + doc/api/html/classes.html | 213 + ...ssstan_1_1_double_vector_view-members.html | 114 + .../classstan_1_1_double_vector_view.html | 199 + ...view_3_01true_00_01false_01_4-members.html | 114 + ..._vector_view_3_01true_00_01false_01_4.html | 185 + ..._view_3_01true_00_01true_01_4-members.html | 114 + ...e_vector_view_3_01true_00_01true_01_4.html | 185 + .../classstan_1_1_vector_view-members.html | 118 + doc/api/html/classstan_1_1_vector_view.html | 319 + ...00_01throw__if__accessed_01_4-members.html | 118 + ...__array_00_01throw__if__accessed_01_4.html | 309 + ...le_00_01false_00_01false_01_4-members.html | 114 + ...t_01double_00_01false_00_01false_01_4.html | 185 + ...assstan_1_1agrad_1_1chainable-members.html | 119 + .../html/classstan_1_1agrad_1_1chainable.html | 399 + .../html/classstan_1_1agrad_1_1chainable.png | Bin 0 -> 12320 bytes ..._1_1agrad_1_1chainable__alloc-members.html | 114 + ...lassstan_1_1agrad_1_1chainable__alloc.html | 184 + ...tan_1_1agrad_1_1op__ddv__vari-members.html | 131 + .../classstan_1_1agrad_1_1op__ddv__vari.html | 312 + .../classstan_1_1agrad_1_1op__ddv__vari.png | Bin 0 -> 1326 bytes ...stan_1_1agrad_1_1op__dv__vari-members.html | 130 + .../classstan_1_1agrad_1_1op__dv__vari.html | 282 + .../classstan_1_1agrad_1_1op__dv__vari.png | Bin 0 -> 1314 bytes ...tan_1_1agrad_1_1op__dvd__vari-members.html | 131 + .../classstan_1_1agrad_1_1op__dvd__vari.html | 312 + .../classstan_1_1agrad_1_1op__dvd__vari.png | Bin 0 -> 1331 bytes ...tan_1_1agrad_1_1op__dvv__vari-members.html | 131 + .../classstan_1_1agrad_1_1op__dvv__vari.html | 312 + .../classstan_1_1agrad_1_1op__dvv__vari.png | Bin 0 -> 1326 bytes ..._1_1agrad_1_1op__matrix__vari-members.html | 132 + ...lassstan_1_1agrad_1_1op__matrix__vari.html | 333 + ...classstan_1_1agrad_1_1op__matrix__vari.png | Bin 0 -> 985 bytes ...sstan_1_1agrad_1_1op__v__vari-members.html | 129 + .../classstan_1_1agrad_1_1op__v__vari.html | 252 + .../classstan_1_1agrad_1_1op__v__vari.png | Bin 0 -> 1293 bytes ...stan_1_1agrad_1_1op__vd__vari-members.html | 130 + .../classstan_1_1agrad_1_1op__vd__vari.html | 282 + .../classstan_1_1agrad_1_1op__vd__vari.png | Bin 0 -> 1315 bytes ...tan_1_1agrad_1_1op__vdd__vari-members.html | 131 + .../classstan_1_1agrad_1_1op__vdd__vari.html | 312 + .../classstan_1_1agrad_1_1op__vdd__vari.png | Bin 0 -> 1331 bytes ...tan_1_1agrad_1_1op__vdv__vari-members.html | 131 + .../classstan_1_1agrad_1_1op__vdv__vari.html | 312 + .../classstan_1_1agrad_1_1op__vdv__vari.png | Bin 0 -> 1333 bytes ..._1_1agrad_1_1op__vector__vari-members.html | 132 + ...lassstan_1_1agrad_1_1op__vector__vari.html | 330 + ...classstan_1_1agrad_1_1op__vector__vari.png | Bin 0 -> 979 bytes ...stan_1_1agrad_1_1op__vv__vari-members.html | 130 + .../classstan_1_1agrad_1_1op__vv__vari.html | 282 + .../classstan_1_1agrad_1_1op__vv__vari.png | Bin 0 -> 1309 bytes ...tan_1_1agrad_1_1op__vvd__vari-members.html | 131 + .../classstan_1_1agrad_1_1op__vvd__vari.html | 312 + .../classstan_1_1agrad_1_1op__vvd__vari.png | Bin 0 -> 1328 bytes ...tan_1_1agrad_1_1op__vvv__vari-members.html | 131 + .../classstan_1_1agrad_1_1op__vvv__vari.html | 312 + .../classstan_1_1agrad_1_1op__vvv__vari.png | Bin 0 -> 1316 bytes ...an_1_1agrad_1_1partials__vari-members.html | 128 + .../classstan_1_1agrad_1_1partials__vari.html | 264 + .../classstan_1_1agrad_1_1partials__vari.png | Bin 0 -> 972 bytes ..._1_1agrad_1_1precomp__v__vari-members.html | 116 + ...lassstan_1_1agrad_1_1precomp__v__vari.html | 234 + ...rad_1_1stored__gradient__vari-members.html | 131 + ...an_1_1agrad_1_1stored__gradient__vari.html | 357 + ...tan_1_1agrad_1_1stored__gradient__vari.png | Bin 0 -> 1049 bytes .../classstan_1_1agrad_1_1var-members.html | 170 + doc/api/html/classstan_1_1agrad_1_1var.html | 2247 ++ .../classstan_1_1agrad_1_1vari-members.html | 129 + doc/api/html/classstan_1_1agrad_1_1vari.html | 660 + doc/api/html/classstan_1_1agrad_1_1vari.png | Bin 0 -> 12307 bytes ...classstan_1_1gm_1_1arg__adapt-members.html | 133 + .../html/classstan_1_1gm_1_1arg__adapt.html | 201 + .../html/classstan_1_1gm_1_1arg__adapt.png | Bin 0 -> 1020 bytes ...an_1_1gm_1_1arg__adapt__delta-members.html | 147 + .../classstan_1_1gm_1_1arg__adapt__delta.html | 255 + .../classstan_1_1gm_1_1arg__adapt__delta.png | Bin 0 -> 1508 bytes ..._1_1gm_1_1arg__adapt__engaged-members.html | 146 + ...lassstan_1_1gm_1_1arg__adapt__engaged.html | 226 + ...classstan_1_1gm_1_1arg__adapt__engaged.png | Bin 0 -> 1500 bytes ...an_1_1gm_1_1arg__adapt__gamma-members.html | 147 + .../classstan_1_1gm_1_1arg__adapt__gamma.html | 255 + .../classstan_1_1gm_1_1arg__adapt__gamma.png | Bin 0 -> 1527 bytes ...m_1_1arg__adapt__init__buffer-members.html | 146 + ...tan_1_1gm_1_1arg__adapt__init__buffer.html | 226 + ...stan_1_1gm_1_1arg__adapt__init__buffer.png | Bin 0 -> 1667 bytes ...an_1_1gm_1_1arg__adapt__kappa-members.html | 147 + .../classstan_1_1gm_1_1arg__adapt__kappa.html | 255 + .../classstan_1_1gm_1_1arg__adapt__kappa.png | Bin 0 -> 1518 bytes ...sstan_1_1gm_1_1arg__adapt__t0-members.html | 147 + .../classstan_1_1gm_1_1arg__adapt__t0.html | 255 + .../classstan_1_1gm_1_1arg__adapt__t0.png | Bin 0 -> 1488 bytes ...m_1_1arg__adapt__term__buffer-members.html | 146 + ...tan_1_1gm_1_1arg__adapt__term__buffer.html | 226 + ...stan_1_1gm_1_1arg__adapt__term__buffer.png | Bin 0 -> 1676 bytes ...n_1_1gm_1_1arg__adapt__window-members.html | 146 + ...classstan_1_1gm_1_1arg__adapt__window.html | 226 + .../classstan_1_1gm_1_1arg__adapt__window.png | Bin 0 -> 1635 bytes .../classstan_1_1gm_1_1arg__bfgs-members.html | 133 + .../html/classstan_1_1gm_1_1arg__bfgs.html | 201 + doc/api/html/classstan_1_1gm_1_1arg__bfgs.png | Bin 0 -> 1015 bytes .../classstan_1_1gm_1_1arg__data-members.html | 133 + .../html/classstan_1_1gm_1_1arg__data.html | 201 + doc/api/html/classstan_1_1gm_1_1arg__data.png | Bin 0 -> 1001 bytes ...stan_1_1gm_1_1arg__data__file-members.html | 146 + .../classstan_1_1gm_1_1arg__data__file.html | 226 + .../classstan_1_1gm_1_1arg__data__file.png | Bin 0 -> 1429 bytes ...ssstan_1_1gm_1_1arg__dense__e-members.html | 133 + .../classstan_1_1gm_1_1arg__dense__e.html | 201 + .../html/classstan_1_1gm_1_1arg__dense__e.png | Bin 0 -> 1001 bytes ...assstan_1_1gm_1_1arg__diag__e-members.html | 133 + .../html/classstan_1_1gm_1_1arg__diag__e.html | 201 + .../html/classstan_1_1gm_1_1arg__diag__e.png | Bin 0 -> 996 bytes ...ssstan_1_1gm_1_1arg__diagnose-members.html | 133 + .../classstan_1_1gm_1_1arg__diagnose.html | 201 + .../html/classstan_1_1gm_1_1arg__diagnose.png | Bin 0 -> 1040 bytes ..._1gm_1_1arg__diagnostic__file-members.html | 146 + ...ssstan_1_1gm_1_1arg__diagnostic__file.html | 226 + ...assstan_1_1gm_1_1arg__diagnostic__file.png | Bin 0 -> 1468 bytes ...lassstan_1_1gm_1_1arg__engine-members.html | 143 + .../html/classstan_1_1gm_1_1arg__engine.html | 205 + .../html/classstan_1_1gm_1_1arg__engine.png | Bin 0 -> 1298 bytes .../classstan_1_1gm_1_1arg__fail-members.html | 133 + .../html/classstan_1_1gm_1_1arg__fail.html | 201 + doc/api/html/classstan_1_1gm_1_1arg__fail.png | Bin 0 -> 974 bytes .../classstan_1_1gm_1_1arg__hmc-members.html | 133 + doc/api/html/classstan_1_1gm_1_1arg__hmc.html | 201 + doc/api/html/classstan_1_1gm_1_1arg__hmc.png | Bin 0 -> 993 bytes .../classstan_1_1gm_1_1arg__id-members.html | 147 + doc/api/html/classstan_1_1gm_1_1arg__id.html | 255 + doc/api/html/classstan_1_1gm_1_1arg__id.png | Bin 0 -> 1397 bytes .../classstan_1_1gm_1_1arg__init-members.html | 146 + .../html/classstan_1_1gm_1_1arg__init.html | 226 + doc/api/html/classstan_1_1gm_1_1arg__init.png | Bin 0 -> 1390 bytes ...tan_1_1gm_1_1arg__init__alpha-members.html | 147 + .../classstan_1_1gm_1_1arg__init__alpha.html | 255 + .../classstan_1_1gm_1_1arg__init__alpha.png | Bin 0 -> 1507 bytes ...sstan_1_1gm_1_1arg__int__time-members.html | 147 + .../classstan_1_1gm_1_1arg__int__time.html | 255 + .../classstan_1_1gm_1_1arg__int__time.png | Bin 0 -> 1482 bytes .../classstan_1_1gm_1_1arg__iter-members.html | 147 + .../html/classstan_1_1gm_1_1arg__iter.html | 255 + doc/api/html/classstan_1_1gm_1_1arg__iter.png | Bin 0 -> 1418 bytes ...stan_1_1gm_1_1arg__max__depth-members.html | 147 + .../classstan_1_1gm_1_1arg__max__depth.html | 255 + .../classstan_1_1gm_1_1arg__max__depth.png | Bin 0 -> 1458 bytes ...lassstan_1_1gm_1_1arg__method-members.html | 143 + .../html/classstan_1_1gm_1_1arg__method.html | 205 + .../html/classstan_1_1gm_1_1arg__method.png | Bin 0 -> 1291 bytes ...lassstan_1_1gm_1_1arg__metric-members.html | 143 + .../html/classstan_1_1gm_1_1arg__metric.html | 205 + .../html/classstan_1_1gm_1_1arg__metric.png | Bin 0 -> 1293 bytes ...ssstan_1_1gm_1_1arg__nesterov-members.html | 133 + .../classstan_1_1gm_1_1arg__nesterov.html | 201 + .../html/classstan_1_1gm_1_1arg__nesterov.png | Bin 0 -> 1030 bytes ...lassstan_1_1gm_1_1arg__newton-members.html | 133 + .../html/classstan_1_1gm_1_1arg__newton.html | 201 + .../html/classstan_1_1gm_1_1arg__newton.png | Bin 0 -> 1015 bytes ...an_1_1gm_1_1arg__num__samples-members.html | 147 + .../classstan_1_1gm_1_1arg__num__samples.html | 255 + .../classstan_1_1gm_1_1arg__num__samples.png | Bin 0 -> 1460 bytes ...tan_1_1gm_1_1arg__num__warmup-members.html | 147 + .../classstan_1_1gm_1_1arg__num__warmup.html | 255 + .../classstan_1_1gm_1_1arg__num__warmup.png | Bin 0 -> 1453 bytes .../classstan_1_1gm_1_1arg__nuts-members.html | 133 + .../html/classstan_1_1gm_1_1arg__nuts.html | 201 + doc/api/html/classstan_1_1gm_1_1arg__nuts.png | Bin 0 -> 1000 bytes ...ssstan_1_1gm_1_1arg__optimize-members.html | 133 + .../classstan_1_1gm_1_1arg__optimize.html | 201 + .../html/classstan_1_1gm_1_1arg__optimize.png | Bin 0 -> 1025 bytes ..._1_1gm_1_1arg__optimize__algo-members.html | 143 + ...lassstan_1_1gm_1_1arg__optimize__algo.html | 205 + ...classstan_1_1gm_1_1arg__optimize__algo.png | Bin 0 -> 1342 bytes ...lassstan_1_1gm_1_1arg__output-members.html | 133 + .../html/classstan_1_1gm_1_1arg__output.html | 201 + .../html/classstan_1_1gm_1_1arg__output.png | Bin 0 -> 1014 bytes ...an_1_1gm_1_1arg__output__file-members.html | 146 + .../classstan_1_1gm_1_1arg__output__file.html | 226 + .../classstan_1_1gm_1_1arg__output__file.png | Bin 0 -> 1427 bytes ...lassstan_1_1gm_1_1arg__random-members.html | 133 + .../html/classstan_1_1gm_1_1arg__random.html | 201 + .../html/classstan_1_1gm_1_1arg__random.png | Bin 0 -> 1012 bytes ...assstan_1_1gm_1_1arg__refresh-members.html | 147 + .../html/classstan_1_1gm_1_1arg__refresh.html | 255 + .../html/classstan_1_1gm_1_1arg__refresh.png | Bin 0 -> 1448 bytes .../classstan_1_1gm_1_1arg__rwm-members.html | 133 + doc/api/html/classstan_1_1gm_1_1arg__rwm.html | 201 + doc/api/html/classstan_1_1gm_1_1arg__rwm.png | Bin 0 -> 994 bytes ...lassstan_1_1gm_1_1arg__sample-members.html | 133 + .../html/classstan_1_1gm_1_1arg__sample.html | 201 + .../html/classstan_1_1gm_1_1arg__sample.png | Bin 0 -> 1018 bytes ...an_1_1gm_1_1arg__sample__algo-members.html | 143 + .../classstan_1_1gm_1_1arg__sample__algo.html | 205 + .../classstan_1_1gm_1_1arg__sample__algo.png | Bin 0 -> 1323 bytes ..._1gm_1_1arg__save__iterations-members.html | 146 + ...ssstan_1_1gm_1_1arg__save__iterations.html | 226 + ...assstan_1_1gm_1_1arg__save__iterations.png | Bin 0 -> 1507 bytes ...an_1_1gm_1_1arg__save__warmup-members.html | 146 + .../classstan_1_1gm_1_1arg__save__warmup.html | 226 + .../classstan_1_1gm_1_1arg__save__warmup.png | Bin 0 -> 1479 bytes .../classstan_1_1gm_1_1arg__seed-members.html | 146 + .../html/classstan_1_1gm_1_1arg__seed.html | 226 + doc/api/html/classstan_1_1gm_1_1arg__seed.png | Bin 0 -> 1562 bytes ...lassstan_1_1gm_1_1arg__static-members.html | 133 + .../html/classstan_1_1gm_1_1arg__static.html | 201 + .../html/classstan_1_1gm_1_1arg__static.png | Bin 0 -> 1002 bytes ...ssstan_1_1gm_1_1arg__stepsize-members.html | 147 + .../classstan_1_1gm_1_1arg__stepsize.html | 255 + .../html/classstan_1_1gm_1_1arg__stepsize.png | Bin 0 -> 1481 bytes ..._1gm_1_1arg__stepsize__jitter-members.html | 147 + ...ssstan_1_1gm_1_1arg__stepsize__jitter.html | 255 + ...assstan_1_1gm_1_1arg__stepsize__jitter.png | Bin 0 -> 1527 bytes .../classstan_1_1gm_1_1arg__test-members.html | 143 + .../html/classstan_1_1gm_1_1arg__test.html | 205 + doc/api/html/classstan_1_1gm_1_1arg__test.png | Bin 0 -> 1282 bytes ...1_1gm_1_1arg__test__grad__eps-members.html | 147 + ...assstan_1_1gm_1_1arg__test__grad__eps.html | 255 + ...lassstan_1_1gm_1_1arg__test__grad__eps.png | Bin 0 -> 1523 bytes ...1_1gm_1_1arg__test__grad__err-members.html | 147 + ...assstan_1_1gm_1_1arg__test__grad__err.html | 255 + ...lassstan_1_1gm_1_1arg__test__grad__err.png | Bin 0 -> 1519 bytes ..._1_1gm_1_1arg__test__gradient-members.html | 133 + ...lassstan_1_1gm_1_1arg__test__gradient.html | 201 + ...classstan_1_1gm_1_1arg__test__gradient.png | Bin 0 -> 1069 bytes .../classstan_1_1gm_1_1arg__thin-members.html | 147 + .../html/classstan_1_1gm_1_1arg__thin.html | 255 + doc/api/html/classstan_1_1gm_1_1arg__thin.png | Bin 0 -> 1411 bytes ...sstan_1_1gm_1_1arg__tolerance-members.html | 147 + .../classstan_1_1gm_1_1arg__tolerance.html | 278 + .../classstan_1_1gm_1_1arg__tolerance.png | Bin 0 -> 1490 bytes ...assstan_1_1gm_1_1arg__unit__e-members.html | 133 + .../html/classstan_1_1gm_1_1arg__unit__e.html | 201 + .../html/classstan_1_1gm_1_1arg__unit__e.png | Bin 0 -> 996 bytes .../classstan_1_1gm_1_1argument-members.html | 129 + doc/api/html/classstan_1_1gm_1_1argument.html | 727 + doc/api/html/classstan_1_1gm_1_1argument.png | Bin 0 -> 13313 bytes ...tan_1_1gm_1_1argument__parser-members.html | 122 + .../classstan_1_1gm_1_1argument__parser.html | 450 + ...stan_1_1gm_1_1argument__probe-members.html | 115 + .../classstan_1_1gm_1_1argument__probe.html | 211 + ..._1gm_1_1categorical__argument-members.html | 132 + ...ssstan_1_1gm_1_1categorical__argument.html | 521 + ...assstan_1_1gm_1_1categorical__argument.png | Bin 0 -> 6971 bytes ...1_1gm_1_1function__signatures-members.html | 130 + ...assstan_1_1gm_1_1function__signatures.html | 786 + ...sstan_1_1gm_1_1list__argument-members.html | 142 + .../classstan_1_1gm_1_1list__argument.html | 722 + .../classstan_1_1gm_1_1list__argument.png | Bin 0 -> 3141 bytes ..._1_1gm_1_1singleton__argument-members.html | 145 + ...lassstan_1_1gm_1_1singleton__argument.html | 758 + ...classstan_1_1gm_1_1singleton__argument.png | Bin 0 -> 14438 bytes ...n_1_1gm_1_1unvalued__argument-members.html | 132 + ...classstan_1_1gm_1_1unvalued__argument.html | 400 + .../classstan_1_1gm_1_1unvalued__argument.png | Bin 0 -> 1959 bytes ...tan_1_1gm_1_1valued__argument-members.html | 134 + .../classstan_1_1gm_1_1valued__argument.html | 437 + .../classstan_1_1gm_1_1valued__argument.png | Bin 0 -> 20770 bytes .../classstan_1_1io_1_1cmd__line-members.html | 120 + .../html/classstan_1_1io_1_1cmd__line.html | 478 + ...lassstan_1_1io_1_1csv__writer-members.html | 121 + .../html/classstan_1_1io_1_1csv__writer.html | 457 + .../html/classstan_1_1io_1_1dump-members.html | 133 + doc/api/html/classstan_1_1io_1_1dump.html | 565 + doc/api/html/classstan_1_1io_1_1dump.png | Bin 0 -> 531 bytes ...assstan_1_1io_1_1dump__reader-members.html | 121 + .../html/classstan_1_1io_1_1dump__reader.html | 428 + ...assstan_1_1io_1_1dump__writer-members.html | 119 + .../html/classstan_1_1io_1_1dump__writer.html | 466 + ...assstan_1_1io_1_1mcmc__writer-members.html | 121 + .../html/classstan_1_1io_1_1mcmc__writer.html | 524 + .../classstan_1_1io_1_1reader-members.html | 213 + doc/api/html/classstan_1_1io_1_1reader.html | 4761 ++++ ...an_1_1io_1_1stan__csv__reader-members.html | 119 + .../classstan_1_1io_1_1stan__csv__reader.html | 377 + ...assstan_1_1io_1_1var__context-members.html | 131 + .../html/classstan_1_1io_1_1var__context.html | 987 + .../html/classstan_1_1io_1_1var__context.png | Bin 0 -> 534 bytes .../classstan_1_1io_1_1writer-members.html | 148 + doc/api/html/classstan_1_1io_1_1writer.html | 1616 ++ ...01double_00_01_r_00_01_c_01_4-members.html | 125 + ...actor_3_01double_00_01_r_00_01_c_01_4.html | 495 + ...d_1_1var_00_01_r_00_01_c_01_4-members.html | 121 + ..._1_1agrad_1_1var_00_01_r_00_01_c_01_4.html | 387 + ...ssstan_1_1math_1_1accumulator-members.html | 116 + .../classstan_1_1math_1_1accumulator.html | 274 + ...lassstan_1_1math_1_1seq__view-members.html | 115 + .../html/classstan_1_1math_1_1seq__view.html | 218 + ...1_eigen_1_1_dynamic_01_4_01_4-members.html | 115 + ...011_00_01_eigen_1_1_dynamic_01_4_01_4.html | 218 + ..._1_1_dynamic_00_011_01_4_01_4-members.html | 115 + ...01_eigen_1_1_dynamic_00_011_01_4_01_4.html | 218 + ...mic_00_01_eigen_1_1_dynamic_01_4_01_4.html | 218 + ..._00_085212abef8028c93e19b6c8ba8c0204d.html | 115 + ...td_1_1vector_3_01_s_01_4_01_4-members.html | 115 + ...t_00_01std_1_1vector_3_01_s_01_4_01_4.html | 218 + ...td_1_1vector_3_01_t_01_4_01_4-members.html | 115 + ...t_00_01std_1_1vector_3_01_t_01_4_01_4.html | 218 + ...1vector_3_01_t_01_4_01_4_01_4-members.html | 115 + ...01std_1_1vector_3_01_t_01_4_01_4_01_4.html | 218 + ...d_1_1vector_3_01int_01_4_01_4-members.html | 115 + ..._00_01std_1_1vector_3_01int_01_4_01_4.html | 212 + ...mcmc_1_1adapt__dense__e__nuts-members.html | 170 + ...stan_1_1mcmc_1_1adapt__dense__e__nuts.html | 402 + ...sstan_1_1mcmc_1_1adapt__dense__e__nuts.png | Bin 0 -> 4606 bytes ...1adapt__dense__e__static__hmc-members.html | 168 + ...1mcmc_1_1adapt__dense__e__static__hmc.html | 381 + ..._1mcmc_1_1adapt__dense__e__static__hmc.png | Bin 0 -> 5169 bytes ...1mcmc_1_1adapt__diag__e__nuts-members.html | 170 + ...sstan_1_1mcmc_1_1adapt__diag__e__nuts.html | 402 + ...ssstan_1_1mcmc_1_1adapt__diag__e__nuts.png | Bin 0 -> 4595 bytes ..._1adapt__diag__e__static__hmc-members.html | 168 + ..._1mcmc_1_1adapt__diag__e__static__hmc.html | 381 + ...1_1mcmc_1_1adapt__diag__e__static__hmc.png | Bin 0 -> 4868 bytes ...1mcmc_1_1adapt__unit__e__nuts-members.html | 167 + ...sstan_1_1mcmc_1_1adapt__unit__e__nuts.html | 396 + ...ssstan_1_1mcmc_1_1adapt__unit__e__nuts.png | Bin 0 -> 4491 bytes ..._1adapt__unit__e__static__hmc-members.html | 165 + ..._1mcmc_1_1adapt__unit__e__static__hmc.html | 375 + ...1_1mcmc_1_1adapt__unit__e__static__hmc.png | Bin 0 -> 4541 bytes ...n_1_1mcmc_1_1base__adaptation-members.html | 113 + ...classstan_1_1mcmc_1_1base__adaptation.html | 166 + .../classstan_1_1mcmc_1_1base__adaptation.png | Bin 0 -> 1722 bytes ...stan_1_1mcmc_1_1base__adapter-members.html | 117 + .../classstan_1_1mcmc_1_1base__adapter.html | 282 + .../classstan_1_1mcmc_1_1base__adapter.png | Bin 0 -> 4106 bytes ..._1_1mcmc_1_1base__hamiltonian-members.html | 128 + ...lassstan_1_1mcmc_1_1base__hamiltonian.html | 639 + ...lassstan_1_1mcmc_1_1base__hmc-members.html | 144 + .../html/classstan_1_1mcmc_1_1base__hmc.html | 801 + .../html/classstan_1_1mcmc_1_1base__hmc.png | Bin 0 -> 2033 bytes ...n_1_1mcmc_1_1base__integrator-members.html | 115 + ...classstan_1_1mcmc_1_1base__integrator.html | 246 + .../classstan_1_1mcmc_1_1base__integrator.png | Bin 0 -> 1221 bytes ...tan_1_1mcmc_1_1base__leapfrog-members.html | 120 + .../classstan_1_1mcmc_1_1base__leapfrog.html | 410 + .../classstan_1_1mcmc_1_1base__leapfrog.png | Bin 0 -> 1220 bytes ...assstan_1_1mcmc_1_1base__mcmc-members.html | 126 + .../html/classstan_1_1mcmc_1_1base__mcmc.html | 563 + .../html/classstan_1_1mcmc_1_1base__mcmc.png | Bin 0 -> 10185 bytes ...assstan_1_1mcmc_1_1base__nuts-members.html | 156 + .../html/classstan_1_1mcmc_1_1base__nuts.html | 733 + .../html/classstan_1_1mcmc_1_1base__nuts.png | Bin 0 -> 1380 bytes ..._1_1mcmc_1_1base__static__hmc-members.html | 154 + ...lassstan_1_1mcmc_1_1base__static__hmc.html | 726 + ...classstan_1_1mcmc_1_1base__static__hmc.png | Bin 0 -> 1453 bytes .../classstan_1_1mcmc_1_1chains-members.html | 174 + doc/api/html/classstan_1_1mcmc_1_1chains.html | 2390 ++ ..._1_1mcmc_1_1covar__adaptation-members.html | 129 + ...lassstan_1_1mcmc_1_1covar__adaptation.html | 261 + ...classstan_1_1mcmc_1_1covar__adaptation.png | Bin 0 -> 1083 bytes ...n_1_1mcmc_1_1dense__e__metric-members.html | 130 + ...classstan_1_1mcmc_1_1dense__e__metric.html | 465 + .../classstan_1_1mcmc_1_1dense__e__metric.png | Bin 0 -> 1197 bytes ...tan_1_1mcmc_1_1dense__e__nuts-members.html | 157 + .../classstan_1_1mcmc_1_1dense__e__nuts.html | 330 + .../classstan_1_1mcmc_1_1dense__e__nuts.png | Bin 0 -> 3170 bytes ...an_1_1mcmc_1_1dense__e__point-members.html | 127 + .../classstan_1_1mcmc_1_1dense__e__point.html | 272 + .../classstan_1_1mcmc_1_1dense__e__point.png | Bin 0 -> 632 bytes ...mcmc_1_1dense__e__static__hmc-members.html | 155 + ...stan_1_1mcmc_1_1dense__e__static__hmc.html | 262 + ...sstan_1_1mcmc_1_1dense__e__static__hmc.png | Bin 0 -> 3626 bytes ...an_1_1mcmc_1_1diag__e__metric-members.html | 130 + .../classstan_1_1mcmc_1_1diag__e__metric.html | 465 + .../classstan_1_1mcmc_1_1diag__e__metric.png | Bin 0 -> 1200 bytes ...stan_1_1mcmc_1_1diag__e__nuts-members.html | 157 + .../classstan_1_1mcmc_1_1diag__e__nuts.html | 330 + .../classstan_1_1mcmc_1_1diag__e__nuts.png | Bin 0 -> 3177 bytes ...tan_1_1mcmc_1_1diag__e__point-members.html | 127 + .../classstan_1_1mcmc_1_1diag__e__point.html | 272 + .../classstan_1_1mcmc_1_1diag__e__point.png | Bin 0 -> 626 bytes ...1mcmc_1_1diag__e__static__hmc-members.html | 155 + ...sstan_1_1mcmc_1_1diag__e__static__hmc.html | 262 + ...ssstan_1_1mcmc_1_1diag__e__static__hmc.png | Bin 0 -> 3332 bytes ...tan_1_1mcmc_1_1expl__leapfrog-members.html | 121 + .../classstan_1_1mcmc_1_1expl__leapfrog.html | 329 + .../classstan_1_1mcmc_1_1expl__leapfrog.png | Bin 0 -> 1215 bytes ...lassstan_1_1mcmc_1_1ps__point-members.html | 124 + .../html/classstan_1_1mcmc_1_1ps__point.html | 472 + .../html/classstan_1_1mcmc_1_1ps__point.png | Bin 0 -> 1105 bytes .../classstan_1_1mcmc_1_1sample-members.html | 122 + doc/api/html/classstan_1_1mcmc_1_1sample.html | 417 + ...1mcmc_1_1stepsize__adaptation-members.html | 134 + ...sstan_1_1mcmc_1_1stepsize__adaptation.html | 729 + ...ssstan_1_1mcmc_1_1stepsize__adaptation.png | Bin 0 -> 732 bytes ..._1_1mcmc_1_1stepsize__adapter-members.html | 120 + ...lassstan_1_1mcmc_1_1stepsize__adapter.html | 232 + ...classstan_1_1mcmc_1_1stepsize__adapter.png | Bin 0 -> 2039 bytes ...c_1_1stepsize__covar__adapter-members.html | 123 + ...n_1_1mcmc_1_1stepsize__covar__adapter.html | 340 + ...an_1_1mcmc_1_1stepsize__covar__adapter.png | Bin 0 -> 2090 bytes ...cmc_1_1stepsize__var__adapter-members.html | 123 + ...tan_1_1mcmc_1_1stepsize__var__adapter.html | 340 + ...stan_1_1mcmc_1_1stepsize__var__adapter.png | Bin 0 -> 2089 bytes ...an_1_1mcmc_1_1unit__e__metric-members.html | 130 + .../classstan_1_1mcmc_1_1unit__e__metric.html | 465 + .../classstan_1_1mcmc_1_1unit__e__metric.png | Bin 0 -> 1179 bytes ...stan_1_1mcmc_1_1unit__e__nuts-members.html | 157 + .../classstan_1_1mcmc_1_1unit__e__nuts.html | 330 + .../classstan_1_1mcmc_1_1unit__e__nuts.png | Bin 0 -> 3114 bytes ...tan_1_1mcmc_1_1unit__e__point-members.html | 125 + .../classstan_1_1mcmc_1_1unit__e__point.html | 194 + .../classstan_1_1mcmc_1_1unit__e__point.png | Bin 0 -> 610 bytes ...1mcmc_1_1unit__e__static__hmc-members.html | 155 + ...sstan_1_1mcmc_1_1unit__e__static__hmc.html | 262 + ...ssstan_1_1mcmc_1_1unit__e__static__hmc.png | Bin 0 -> 3323 bytes ...an_1_1mcmc_1_1var__adaptation-members.html | 129 + .../classstan_1_1mcmc_1_1var__adaptation.html | 261 + .../classstan_1_1mcmc_1_1var__adaptation.png | Bin 0 -> 1077 bytes ...1mcmc_1_1windowed__adaptation-members.html | 126 + ...sstan_1_1mcmc_1_1windowed__adaptation.html | 528 + ...ssstan_1_1mcmc_1_1windowed__adaptation.png | Bin 0 -> 1445 bytes ...tan_1_1memory_1_1chunk__alloc-members.html | 117 + .../classstan_1_1memory_1_1chunk__alloc.html | 299 + ...tan_1_1memory_1_1stack__alloc-members.html | 117 + .../classstan_1_1memory_1_1stack__alloc.html | 309 + ...ssstan_1_1model_1_1prob__grad-members.html | 120 + .../classstan_1_1model_1_1prob__grad.html | 360 + ...ation_1_1_b_f_g_s_line_search-members.html | 156 + ...1optimization_1_1_b_f_g_s_line_search.html | 462 + ..._1optimization_1_1_b_f_g_s_line_search.png | Bin 0 -> 1152 bytes ...ization_1_1_b_f_g_s_minimizer-members.html | 148 + ...1_1optimization_1_1_b_f_g_s_minimizer.html | 1132 + ...ptimization_1_1_model_adaptor-members.html | 117 + ...tan_1_1optimization_1_1_model_adaptor.html | 330 + ...ization_1_1_nesterov_gradient-members.html | 118 + ...1_1optimization_1_1_nesterov_gradient.html | 334 + ..._1_1welford__covar__estimator-members.html | 121 + ..._1_1prob_1_1welford__covar__estimator.html | 369 + ...ob_1_1welford__var__estimator-members.html | 121 + ...an_1_1prob_1_1welford__var__estimator.html | 369 + doc/api/html/closed.png | Bin 0 -> 132 bytes doc/api/html/cmd__line_8hpp.html | 153 + doc/api/html/cmd__line_8hpp_source.html | 278 + doc/api/html/col_8hpp.html | 132 + doc/api/html/col_8hpp_source.html | 128 + doc/api/html/cols_8hpp.html | 129 + doc/api/html/cols_8hpp_source.html | 125 + doc/api/html/command_8hpp.html | 188 + doc/api/html/command_8hpp_source.html | 1087 + doc/api/html/common__adaptors__def_8hpp.html | 111 + .../common__adaptors__def_8hpp_source.html | 120 + doc/api/html/common__type_8hpp.html | 134 + doc/api/html/common__type_8hpp_source.html | 138 + doc/api/html/compiler_8hpp.html | 133 + doc/api/html/compiler_8hpp_source.html | 141 + doc/api/html/constraint__tolerance_8hpp.html | 128 + .../constraint__tolerance_8hpp_source.html | 118 + doc/api/html/covar__adaptation_8hpp.html | 131 + .../html/covar__adaptation_8hpp_source.html | 163 + doc/api/html/csv__writer_8hpp.html | 132 + doc/api/html/csv__writer_8hpp_source.html | 197 + doc/api/html/cumulative__sum_8hpp.html | 135 + doc/api/html/cumulative__sum_8hpp_source.html | 142 + doc/api/html/ddv__vari_8hpp.html | 128 + doc/api/html/ddv__vari_8hpp_source.html | 132 + doc/api/html/dense__e__metric_8hpp.html | 133 + .../html/dense__e__metric_8hpp_source.html | 174 + doc/api/html/dense__e__nuts_8hpp.html | 131 + doc/api/html/dense__e__nuts_8hpp_source.html | 151 + doc/api/html/dense__e__point_8hpp.html | 128 + doc/api/html/dense__e__point_8hpp_source.html | 151 + doc/api/html/dense__e__static__hmc_8hpp.html | 131 + .../dense__e__static__hmc_8hpp_source.html | 145 + doc/api/html/diag__e__metric_8hpp.html | 131 + doc/api/html/diag__e__metric_8hpp_source.html | 167 + doc/api/html/diag__e__nuts_8hpp.html | 131 + doc/api/html/diag__e__nuts_8hpp_source.html | 151 + doc/api/html/diag__e__point_8hpp.html | 128 + doc/api/html/diag__e__point_8hpp_source.html | 149 + doc/api/html/diag__e__static__hmc_8hpp.html | 131 + .../diag__e__static__hmc_8hpp_source.html | 145 + doc/api/html/diag__matrix_8hpp.html | 131 + doc/api/html/diag__matrix_8hpp_source.html | 125 + doc/api/html/diag__post__multiply_8hpp.html | 133 + .../diag__post__multiply_8hpp_source.html | 136 + doc/api/html/diag__pre__multiply_8hpp.html | 133 + .../html/diag__pre__multiply_8hpp_source.html | 136 + doc/api/html/diagonal_8hpp.html | 131 + doc/api/html/diagonal_8hpp_source.html | 125 + doc/api/html/dims_8hpp.html | 139 + doc/api/html/dims_8hpp_source.html | 149 + .../dir_0c7ba03e05d7755a93c72a387515f18e.html | 133 + .../dir_0f7468ba3d646c35c5f1677a20123edb.html | 118 + .../dir_139cce78ba5d92491da28703870a60b5.html | 107 + .../dir_182af125d00bd279bb48de10042b58c3.html | 127 + .../dir_1ff9d265245893e221d5111ecd1383dc.html | 229 + .../dir_2199d12d39bf553599a4a7fa2d24fe67.html | 107 + .../dir_22b468d2bc5e21cba3741edb912cd36a.html | 137 + .../dir_29b20cd43524c7f0fc77aef3c7e38f50.html | 126 + .../dir_2e546bda41fe40b59dc00b79d00b50ce.html | 107 + .../dir_2fa10d765296c30bb35aa6c0b0bc0528.html | 116 + .../dir_3995d5884456238d20884a417bb53c63.html | 136 + .../dir_3b4610d017c705a4887f638ce7fbc838.html | 116 + .../dir_3bf5ecbbc2acdb8067d845784c2d4c37.html | 129 + .../dir_4169038f84fc0e1ed68b4a7c11130da4.html | 119 + .../dir_44cbf1ed18699f3d3b4fc628a26fcd8e.html | 112 + .../dir_4ff6d94cb2a0a21decf9fe1d17e36a84.html | 128 + .../dir_50f5c6d2b5c0f0cf0dce53a8e04f8433.html | 143 + .../dir_52470340ee5541bea78123d62b747bfc.html | 171 + .../dir_52c3c3fe3bff0ba6815d4f34971ed7d3.html | 124 + .../dir_54e1f17c1ac5ea0adfc355c0b89ee8b2.html | 155 + .../dir_5a90b97b153f6d877d3f3fe75b024a65.html | 109 + .../dir_68c25edf9c6d341fdd24c7ac7d0f552b.html | 113 + .../dir_6b822de55cde49ee6f3a9b01e44fb566.html | 247 + .../dir_7edb90b8895d3ae5eaffb58e5bac252e.html | 116 + .../dir_7f504516231d3fe329ee42a0c6d09a23.html | 119 + .../dir_8bbd805b34b7b8cc78ee869a600898c2.html | 111 + .../dir_8c3552022fc3ada5c17e804a5e09b39f.html | 107 + .../dir_918f1495a74b4bbbcceda6da05869dad.html | 123 + .../dir_99762ae463b7309a47de4b14a14d0e0f.html | 309 + .../dir_99fdd75913c28d151522a8b8afede414.html | 138 + .../dir_9c4b002ce8795bbd5dbe2cf3421fe13a.html | 107 + .../dir_adda0d2b1be4bc1eb47d3b2cf56797af.html | 147 + .../dir_ae30097f91ecf0dffad078cd8b901d6c.html | 111 + .../dir_b1c6471129ce395961fd25e68f861508.html | 150 + .../dir_b5faa64c567d6f189426dea685de5e0f.html | 107 + .../dir_bfdd916fd7a3310c7c8c32c9dbb4c5dd.html | 151 + .../dir_d06f81619dd9bcc28d70dd2c97937727.html | 237 + .../dir_e5fd7b97e7c167e7281b34e17696a6e4.html | 111 + .../dir_e65b8371bb074abd719c6e80ee5d6469.html | 121 + .../dir_e7242831226ee912bf5f374de664968d.html | 134 + .../dir_e9c236c76d69ff67463df99eaf9c4820.html | 119 + .../dir_f2ec37f115c79ba754de20300359aed5.html | 148 + .../dir_f3e98ab768ca388ef4baecb6d973adcf.html | 111 + .../dir_f77850045c6d72da1ced64bfc8354271.html | 251 + .../dir_fb5291ba38e4a736e77d8ba78c86369a.html | 126 + doc/api/html/dirichlet_8hpp.html | 147 + doc/api/html/dirichlet_8hpp_source.html | 189 + doc/api/html/distributions_8hpp.html | 111 + doc/api/html/distributions_8hpp_source.html | 114 + doc/api/html/dom__err_8hpp.html | 131 + doc/api/html/dom__err_8hpp_source.html | 153 + doc/api/html/dom__err__vec_8hpp.html | 132 + doc/api/html/dom__err__vec_8hpp_source.html | 147 + doc/api/html/dot_8hpp.html | 129 + doc/api/html/dot_8hpp_source.html | 129 + doc/api/html/double__exponential_8hpp.html | 160 + .../html/double__exponential_8hpp_source.html | 522 + doc/api/html/doxygen.css | 1172 + doc/api/html/doxygen.png | Bin 0 -> 3779 bytes doc/api/html/dump_8hpp.html | 144 + doc/api/html/dump_8hpp_source.html | 832 + doc/api/html/dv__vari_8hpp.html | 128 + doc/api/html/dv__vari_8hpp_source.html | 130 + doc/api/html/dvd__vari_8hpp.html | 128 + doc/api/html/dvd__vari_8hpp_source.html | 132 + doc/api/html/dvv__vari_8hpp.html | 128 + doc/api/html/dvv__vari_8hpp_source.html | 132 + doc/api/html/dynsections.js | 78 + doc/api/html/eigenvalues__sym_8hpp.html | 133 + .../html/eigenvalues__sym_8hpp_source.html | 130 + doc/api/html/eigenvectors__sym_8hpp.html | 132 + .../html/eigenvectors__sym_8hpp_source.html | 130 + doc/api/html/elt__divide_8hpp.html | 134 + doc/api/html/elt__divide_8hpp_source.html | 132 + doc/api/html/elt__multiply_8hpp.html | 134 + doc/api/html/elt__multiply_8hpp_source.html | 132 + doc/api/html/error__codes_8hpp.html | 127 + doc/api/html/error__codes_8hpp_source.html | 128 + doc/api/html/error__handling_8dox.html | 103 + doc/api/html/exp__mod__normal_8hpp.html | 160 + .../html/exp__mod__normal_8hpp_source.html | 635 + doc/api/html/expl__leapfrog_8hpp.html | 129 + doc/api/html/expl__leapfrog_8hpp_source.html | 145 + doc/api/html/exponential_8hpp.html | 158 + doc/api/html/exponential_8hpp_source.html | 378 + doc/api/html/expression__grammar_8hpp.html | 138 + .../html/expression__grammar_8hpp_source.html | 180 + .../html/expression__grammar__def_8hpp.html | 196 + .../expression__grammar__def_8hpp_source.html | 364 + .../html/expression__grammar__inst_8cpp.html | 123 + ...expression__grammar__inst_8cpp_source.html | 115 + doc/api/html/files.html | 856 + doc/api/html/fill_8hpp.html | 139 + doc/api/html/fill_8hpp_source.html | 138 + doc/api/html/form_0.png | Bin 0 -> 601 bytes doc/api/html/form_1.png | Bin 0 -> 416 bytes doc/api/html/form_10.png | Bin 0 -> 585 bytes doc/api/html/form_100.png | Bin 0 -> 842 bytes doc/api/html/form_101.png | Bin 0 -> 452 bytes doc/api/html/form_102.png | Bin 0 -> 641 bytes doc/api/html/form_103.png | Bin 0 -> 211 bytes doc/api/html/form_104.png | Bin 0 -> 294 bytes doc/api/html/form_105.png | Bin 0 -> 355 bytes doc/api/html/form_106.png | Bin 0 -> 336 bytes doc/api/html/form_107.png | Bin 0 -> 353 bytes doc/api/html/form_108.png | Bin 0 -> 436 bytes doc/api/html/form_109.png | Bin 0 -> 462 bytes doc/api/html/form_11.png | Bin 0 -> 582 bytes doc/api/html/form_110.png | Bin 0 -> 798 bytes doc/api/html/form_111.png | Bin 0 -> 918 bytes doc/api/html/form_112.png | Bin 0 -> 355 bytes doc/api/html/form_113.png | Bin 0 -> 441 bytes doc/api/html/form_114.png | Bin 0 -> 694 bytes doc/api/html/form_115.png | Bin 0 -> 1513 bytes doc/api/html/form_116.png | Bin 0 -> 792 bytes doc/api/html/form_117.png | Bin 0 -> 1002 bytes doc/api/html/form_118.png | Bin 0 -> 309 bytes doc/api/html/form_119.png | Bin 0 -> 310 bytes doc/api/html/form_12.png | Bin 0 -> 571 bytes doc/api/html/form_120.png | Bin 0 -> 797 bytes doc/api/html/form_121.png | Bin 0 -> 1337 bytes doc/api/html/form_122.png | Bin 0 -> 363 bytes doc/api/html/form_123.png | Bin 0 -> 226 bytes doc/api/html/form_124.png | Bin 0 -> 215 bytes doc/api/html/form_125.png | Bin 0 -> 1233 bytes doc/api/html/form_126.png | Bin 0 -> 287 bytes doc/api/html/form_127.png | Bin 0 -> 1579 bytes doc/api/html/form_128.png | Bin 0 -> 581 bytes doc/api/html/form_129.png | Bin 0 -> 1792 bytes doc/api/html/form_13.png | Bin 0 -> 578 bytes doc/api/html/form_130.png | Bin 0 -> 414 bytes doc/api/html/form_131.png | Bin 0 -> 884 bytes doc/api/html/form_132.png | Bin 0 -> 420 bytes doc/api/html/form_133.png | Bin 0 -> 1042 bytes doc/api/html/form_134.png | Bin 0 -> 605 bytes doc/api/html/form_135.png | Bin 0 -> 224 bytes doc/api/html/form_136.png | Bin 0 -> 234 bytes doc/api/html/form_137.png | Bin 0 -> 426 bytes doc/api/html/form_138.png | Bin 0 -> 5512 bytes doc/api/html/form_139.png | Bin 0 -> 323 bytes doc/api/html/form_14.png | Bin 0 -> 627 bytes doc/api/html/form_140.png | Bin 0 -> 1752 bytes doc/api/html/form_141.png | Bin 0 -> 2047 bytes doc/api/html/form_142.png | Bin 0 -> 8351 bytes doc/api/html/form_143.png | Bin 0 -> 8155 bytes doc/api/html/form_144.png | Bin 0 -> 751 bytes doc/api/html/form_145.png | Bin 0 -> 4210 bytes doc/api/html/form_146.png | Bin 0 -> 1940 bytes doc/api/html/form_147.png | Bin 0 -> 2456 bytes doc/api/html/form_148.png | Bin 0 -> 4112 bytes doc/api/html/form_149.png | Bin 0 -> 4327 bytes doc/api/html/form_15.png | Bin 0 -> 742 bytes doc/api/html/form_150.png | Bin 0 -> 989 bytes doc/api/html/form_151.png | Bin 0 -> 5210 bytes doc/api/html/form_152.png | Bin 0 -> 6080 bytes doc/api/html/form_153.png | Bin 0 -> 3957 bytes doc/api/html/form_154.png | Bin 0 -> 604 bytes doc/api/html/form_155.png | Bin 0 -> 1102 bytes doc/api/html/form_156.png | Bin 0 -> 227 bytes doc/api/html/form_157.png | Bin 0 -> 661 bytes doc/api/html/form_158.png | Bin 0 -> 694 bytes doc/api/html/form_159.png | Bin 0 -> 660 bytes doc/api/html/form_16.png | Bin 0 -> 642 bytes doc/api/html/form_160.png | Bin 0 -> 236 bytes doc/api/html/form_161.png | Bin 0 -> 1398 bytes doc/api/html/form_162.png | Bin 0 -> 777 bytes doc/api/html/form_163.png | Bin 0 -> 948 bytes doc/api/html/form_164.png | Bin 0 -> 1151 bytes doc/api/html/form_165.png | Bin 0 -> 1260 bytes doc/api/html/form_166.png | Bin 0 -> 1482 bytes doc/api/html/form_167.png | Bin 0 -> 873 bytes doc/api/html/form_168.png | Bin 0 -> 986 bytes doc/api/html/form_169.png | Bin 0 -> 781 bytes doc/api/html/form_17.png | Bin 0 -> 632 bytes doc/api/html/form_170.png | Bin 0 -> 1078 bytes doc/api/html/form_171.png | Bin 0 -> 1108 bytes doc/api/html/form_172.png | Bin 0 -> 860 bytes doc/api/html/form_173.png | Bin 0 -> 1066 bytes doc/api/html/form_174.png | Bin 0 -> 1042 bytes doc/api/html/form_175.png | Bin 0 -> 1016 bytes doc/api/html/form_176.png | Bin 0 -> 568 bytes doc/api/html/form_177.png | Bin 0 -> 324 bytes doc/api/html/form_178.png | Bin 0 -> 388 bytes doc/api/html/form_18.png | Bin 0 -> 534 bytes doc/api/html/form_19.png | Bin 0 -> 734 bytes doc/api/html/form_2.png | Bin 0 -> 589 bytes doc/api/html/form_20.png | Bin 0 -> 576 bytes doc/api/html/form_21.png | Bin 0 -> 794 bytes doc/api/html/form_22.png | Bin 0 -> 874 bytes doc/api/html/form_23.png | Bin 0 -> 772 bytes doc/api/html/form_24.png | Bin 0 -> 863 bytes doc/api/html/form_25.png | Bin 0 -> 603 bytes doc/api/html/form_26.png | Bin 0 -> 590 bytes doc/api/html/form_27.png | Bin 0 -> 628 bytes doc/api/html/form_28.png | Bin 0 -> 716 bytes doc/api/html/form_29.png | Bin 0 -> 717 bytes doc/api/html/form_3.png | Bin 0 -> 587 bytes doc/api/html/form_30.png | Bin 0 -> 687 bytes doc/api/html/form_31.png | Bin 0 -> 795 bytes doc/api/html/form_32.png | Bin 0 -> 775 bytes doc/api/html/form_33.png | Bin 0 -> 743 bytes doc/api/html/form_34.png | Bin 0 -> 778 bytes doc/api/html/form_35.png | Bin 0 -> 655 bytes doc/api/html/form_36.png | Bin 0 -> 654 bytes doc/api/html/form_37.png | Bin 0 -> 698 bytes doc/api/html/form_38.png | Bin 0 -> 622 bytes doc/api/html/form_39.png | Bin 0 -> 419 bytes doc/api/html/form_4.png | Bin 0 -> 539 bytes doc/api/html/form_40.png | Bin 0 -> 306 bytes doc/api/html/form_41.png | Bin 0 -> 302 bytes doc/api/html/form_42.png | Bin 0 -> 279 bytes doc/api/html/form_43.png | Bin 0 -> 454 bytes doc/api/html/form_44.png | Bin 0 -> 452 bytes doc/api/html/form_45.png | Bin 0 -> 299 bytes doc/api/html/form_46.png | Bin 0 -> 726 bytes doc/api/html/form_47.png | Bin 0 -> 828 bytes doc/api/html/form_48.png | Bin 0 -> 723 bytes doc/api/html/form_49.png | Bin 0 -> 809 bytes doc/api/html/form_5.png | Bin 0 -> 574 bytes doc/api/html/form_50.png | Bin 0 -> 737 bytes doc/api/html/form_51.png | Bin 0 -> 752 bytes doc/api/html/form_52.png | Bin 0 -> 732 bytes doc/api/html/form_53.png | Bin 0 -> 243 bytes doc/api/html/form_54.png | Bin 0 -> 855 bytes doc/api/html/form_55.png | Bin 0 -> 891 bytes doc/api/html/form_56.png | Bin 0 -> 623 bytes doc/api/html/form_57.png | Bin 0 -> 941 bytes doc/api/html/form_58.png | Bin 0 -> 997 bytes doc/api/html/form_59.png | Bin 0 -> 691 bytes doc/api/html/form_6.png | Bin 0 -> 574 bytes doc/api/html/form_60.png | Bin 0 -> 847 bytes doc/api/html/form_61.png | Bin 0 -> 777 bytes doc/api/html/form_62.png | Bin 0 -> 317 bytes doc/api/html/form_63.png | Bin 0 -> 769 bytes doc/api/html/form_64.png | Bin 0 -> 335 bytes doc/api/html/form_65.png | Bin 0 -> 764 bytes doc/api/html/form_66.png | Bin 0 -> 817 bytes doc/api/html/form_67.png | Bin 0 -> 758 bytes doc/api/html/form_68.png | Bin 0 -> 310 bytes doc/api/html/form_69.png | Bin 0 -> 804 bytes doc/api/html/form_7.png | Bin 0 -> 582 bytes doc/api/html/form_70.png | Bin 0 -> 322 bytes doc/api/html/form_71.png | Bin 0 -> 752 bytes doc/api/html/form_72.png | Bin 0 -> 288 bytes doc/api/html/form_73.png | Bin 0 -> 733 bytes doc/api/html/form_74.png | Bin 0 -> 363 bytes doc/api/html/form_75.png | Bin 0 -> 669 bytes doc/api/html/form_76.png | Bin 0 -> 671 bytes doc/api/html/form_77.png | Bin 0 -> 635 bytes doc/api/html/form_78.png | Bin 0 -> 666 bytes doc/api/html/form_79.png | Bin 0 -> 675 bytes doc/api/html/form_8.png | Bin 0 -> 547 bytes doc/api/html/form_80.png | Bin 0 -> 626 bytes doc/api/html/form_81.png | Bin 0 -> 626 bytes doc/api/html/form_82.png | Bin 0 -> 626 bytes doc/api/html/form_83.png | Bin 0 -> 656 bytes doc/api/html/form_84.png | Bin 0 -> 632 bytes doc/api/html/form_85.png | Bin 0 -> 650 bytes doc/api/html/form_86.png | Bin 0 -> 622 bytes doc/api/html/form_87.png | Bin 0 -> 867 bytes doc/api/html/form_88.png | Bin 0 -> 925 bytes doc/api/html/form_89.png | Bin 0 -> 801 bytes doc/api/html/form_9.png | Bin 0 -> 578 bytes doc/api/html/form_90.png | Bin 0 -> 887 bytes doc/api/html/form_91.png | Bin 0 -> 1070 bytes doc/api/html/form_92.png | Bin 0 -> 1155 bytes doc/api/html/form_93.png | Bin 0 -> 757 bytes doc/api/html/form_94.png | Bin 0 -> 708 bytes doc/api/html/form_95.png | Bin 0 -> 740 bytes doc/api/html/form_96.png | Bin 0 -> 677 bytes doc/api/html/form_97.png | Bin 0 -> 1419 bytes doc/api/html/form_98.png | Bin 0 -> 655 bytes doc/api/html/form_99.png | Bin 0 -> 529 bytes doc/api/html/formula.repository | 179 + doc/api/html/ftv2blank.png | Bin 0 -> 86 bytes doc/api/html/ftv2cl.png | Bin 0 -> 453 bytes doc/api/html/ftv2doc.png | Bin 0 -> 746 bytes doc/api/html/ftv2folderclosed.png | Bin 0 -> 616 bytes doc/api/html/ftv2folderopen.png | Bin 0 -> 597 bytes doc/api/html/ftv2lastnode.png | Bin 0 -> 86 bytes doc/api/html/ftv2link.png | Bin 0 -> 746 bytes doc/api/html/ftv2mlastnode.png | Bin 0 -> 246 bytes doc/api/html/ftv2mnode.png | Bin 0 -> 246 bytes doc/api/html/ftv2mo.png | Bin 0 -> 403 bytes doc/api/html/ftv2node.png | Bin 0 -> 86 bytes doc/api/html/ftv2ns.png | Bin 0 -> 388 bytes doc/api/html/ftv2plastnode.png | Bin 0 -> 229 bytes doc/api/html/ftv2pnode.png | Bin 0 -> 229 bytes doc/api/html/ftv2splitbar.png | Bin 0 -> 314 bytes doc/api/html/ftv2vertline.png | Bin 0 -> 86 bytes doc/api/html/functions.html | 392 + doc/api/html/functions_0x61.html | 472 + doc/api/html/functions_0x62.html | 224 + doc/api/html/functions_0x63.html | 338 + doc/api/html/functions_0x64.html | 353 + doc/api/html/functions_0x65.html | 233 + doc/api/html/functions_0x66.html | 185 + doc/api/html/functions_0x67.html | 344 + doc/api/html/functions_0x68.html | 204 + doc/api/html/functions_0x69.html | 362 + doc/api/html/functions_0x6b.html | 156 + doc/api/html/functions_0x6c.html | 208 + doc/api/html/functions_0x6d.html | 275 + doc/api/html/functions_0x6e.html | 256 + doc/api/html/functions_0x6f.html | 494 + doc/api/html/functions_0x70.html | 348 + doc/api/html/functions_0x71.html | 158 + doc/api/html/functions_0x72.html | 305 + doc/api/html/functions_0x73.html | 488 + doc/api/html/functions_0x74.html | 280 + doc/api/html/functions_0x75.html | 191 + doc/api/html/functions_0x76.html | 360 + doc/api/html/functions_0x77.html | 227 + doc/api/html/functions_0x78.html | 148 + doc/api/html/functions_0x7a.html | 148 + doc/api/html/functions_0x7e.html | 232 + doc/api/html/functions_2dist_8hpp.html | 130 + doc/api/html/functions_2dist_8hpp_source.html | 131 + doc/api/html/functions_2max_8hpp.html | 127 + doc/api/html/functions_2max_8hpp_source.html | 121 + doc/api/html/functions_2min_8hpp.html | 127 + doc/api/html/functions_2min_8hpp_source.html | 121 + doc/api/html/functions_eval.html | 249 + doc/api/html/functions_func.html | 156 + doc/api/html/functions_func_0x61.html | 421 + doc/api/html/functions_func_0x62.html | 199 + doc/api/html/functions_func_0x63.html | 290 + doc/api/html/functions_func_0x64.html | 264 + doc/api/html/functions_func_0x65.html | 187 + doc/api/html/functions_func_0x66.html | 172 + doc/api/html/functions_func_0x67.html | 334 + doc/api/html/functions_func_0x68.html | 165 + doc/api/html/functions_func_0x69.html | 277 + doc/api/html/functions_func_0x6b.html | 147 + doc/api/html/functions_func_0x6c.html | 176 + doc/api/html/functions_func_0x6d.html | 206 + doc/api/html/functions_func_0x6e.html | 209 + doc/api/html/functions_func_0x6f.html | 462 + doc/api/html/functions_func_0x70.html | 308 + doc/api/html/functions_func_0x71.html | 154 + doc/api/html/functions_func_0x72.html | 233 + doc/api/html/functions_func_0x73.html | 402 + doc/api/html/functions_func_0x74.html | 182 + doc/api/html/functions_func_0x75.html | 184 + doc/api/html/functions_func_0x76.html | 264 + doc/api/html/functions_func_0x77.html | 219 + doc/api/html/functions_func_0x7a.html | 147 + doc/api/html/functions_func_0x7e.html | 231 + doc/api/html/functions_rela.html | 120 + doc/api/html/functions_type.html | 317 + doc/api/html/functions_vars.html | 378 + doc/api/html/functions_vars_0x61.html | 193 + doc/api/html/functions_vars_0x62.html | 167 + doc/api/html/functions_vars_0x63.html | 187 + doc/api/html/functions_vars_0x64.html | 230 + doc/api/html/functions_vars_0x65.html | 185 + doc/api/html/functions_vars_0x66.html | 155 + doc/api/html/functions_vars_0x67.html | 152 + doc/api/html/functions_vars_0x68.html | 175 + doc/api/html/functions_vars_0x69.html | 217 + doc/api/html/functions_vars_0x6b.html | 151 + doc/api/html/functions_vars_0x6c.html | 164 + doc/api/html/functions_vars_0x6d.html | 195 + doc/api/html/functions_vars_0x6e.html | 182 + doc/api/html/functions_vars_0x6f.html | 157 + doc/api/html/functions_vars_0x70.html | 179 + doc/api/html/functions_vars_0x71.html | 146 + doc/api/html/functions_vars_0x72.html | 181 + doc/api/html/functions_vars_0x73.html | 214 + doc/api/html/functions_vars_0x74.html | 191 + doc/api/html/functions_vars_0x75.html | 146 + doc/api/html/functions_vars_0x76.html | 204 + doc/api/html/functions_vars_0x77.html | 152 + doc/api/html/functions_vars_0x78.html | 146 + doc/api/html/fvar_8hpp.html | 127 + doc/api/html/fvar_8hpp_source.html | 235 + doc/api/html/fwd_2functions_2acos_8hpp.html | 131 + .../fwd_2functions_2acos_8hpp_source.html | 131 + doc/api/html/fwd_2functions_2acosh_8hpp.html | 133 + .../fwd_2functions_2acosh_8hpp_source.html | 137 + doc/api/html/fwd_2functions_2asin_8hpp.html | 131 + .../fwd_2functions_2asin_8hpp_source.html | 130 + doc/api/html/fwd_2functions_2asinh_8hpp.html | 132 + .../fwd_2functions_2asinh_8hpp_source.html | 131 + doc/api/html/fwd_2functions_2atan2_8hpp.html | 137 + .../fwd_2functions_2atan2_8hpp_source.html | 151 + doc/api/html/fwd_2functions_2atan_8hpp.html | 131 + .../fwd_2functions_2atan_8hpp_source.html | 129 + doc/api/html/fwd_2functions_2atanh_8hpp.html | 132 + .../fwd_2functions_2atanh_8hpp_source.html | 130 + doc/api/html/fwd_2functions_2cbrt_8hpp.html | 132 + .../fwd_2functions_2cbrt_8hpp_source.html | 131 + doc/api/html/fwd_2functions_2ceil_8hpp.html | 130 + .../fwd_2functions_2ceil_8hpp_source.html | 127 + doc/api/html/fwd_2functions_2cos_8hpp.html | 130 + .../html/fwd_2functions_2cos_8hpp_source.html | 128 + doc/api/html/fwd_2functions_2cosh_8hpp.html | 130 + .../fwd_2functions_2cosh_8hpp_source.html | 128 + doc/api/html/fwd_2functions_2erf_8hpp.html | 133 + .../html/fwd_2functions_2erf_8hpp_source.html | 134 + doc/api/html/fwd_2functions_2erfc_8hpp.html | 133 + .../fwd_2functions_2erfc_8hpp_source.html | 134 + doc/api/html/fwd_2functions_2expm1_8hpp.html | 131 + .../fwd_2functions_2expm1_8hpp_source.html | 129 + doc/api/html/fwd_2functions_2fabs_8hpp.html | 131 + .../fwd_2functions_2fabs_8hpp_source.html | 135 + doc/api/html/fwd_2functions_2floor_8hpp.html | 130 + .../fwd_2functions_2floor_8hpp_source.html | 127 + doc/api/html/fwd_2functions_2fmax_8hpp.html | 137 + .../fwd_2functions_2fmax_8hpp_source.html | 162 + doc/api/html/fwd_2functions_2fmin_8hpp.html | 137 + .../fwd_2functions_2fmin_8hpp_source.html | 162 + doc/api/html/fwd_2functions_2fmod_8hpp.html | 136 + .../fwd_2functions_2fmod_8hpp_source.html | 146 + doc/api/html/fwd_2functions_2hypot_8hpp.html | 138 + .../fwd_2functions_2hypot_8hpp_source.html | 154 + doc/api/html/fwd_2functions_2log10_8hpp.html | 131 + .../fwd_2functions_2log10_8hpp_source.html | 133 + doc/api/html/fwd_2functions_2pow_8hpp.html | 139 + .../html/fwd_2functions_2pow_8hpp_source.html | 172 + doc/api/html/fwd_2functions_2round_8hpp.html | 131 + .../fwd_2functions_2round_8hpp_source.html | 129 + doc/api/html/fwd_2functions_2sin_8hpp.html | 130 + .../html/fwd_2functions_2sin_8hpp_source.html | 129 + doc/api/html/fwd_2functions_2sinh_8hpp.html | 130 + .../fwd_2functions_2sinh_8hpp_source.html | 129 + doc/api/html/fwd_2functions_2sqrt_8hpp.html | 131 + .../fwd_2functions_2sqrt_8hpp_source.html | 129 + doc/api/html/fwd_2functions_2tan_8hpp.html | 130 + .../html/fwd_2functions_2tan_8hpp_source.html | 128 + doc/api/html/fwd_2functions_2tanh_8hpp.html | 130 + .../fwd_2functions_2tanh_8hpp_source.html | 128 + doc/api/html/fwd_2functions_2tgamma_8hpp.html | 131 + .../fwd_2functions_2tgamma_8hpp_source.html | 130 + doc/api/html/fwd_2functions_2trunc_8hpp.html | 131 + .../fwd_2functions_2trunc_8hpp_source.html | 129 + doc/api/html/fwd_2numeric__limits_8hpp.html | 126 + .../fwd_2numeric__limits_8hpp_source.html | 164 + ...d_2operators_2operator__addition_8hpp.html | 136 + ...ators_2operator__addition_8hpp_source.html | 140 + ...d_2operators_2operator__division_8hpp.html | 136 + ...ators_2operator__division_8hpp_source.html | 144 + .../fwd_2operators_2operator__equal_8hpp.html | 136 + ...perators_2operator__equal_8hpp_source.html | 140 + ...erators_2operator__greater__than_8hpp.html | 136 + ..._2operator__greater__than_8hpp_source.html | 140 + ...erator__greater__than__or__equal_8hpp.html | 136 + ..._greater__than__or__equal_8hpp_source.html | 140 + ...2operators_2operator__less__than_8hpp.html | 136 + ...ors_2operator__less__than_8hpp_source.html | 137 + ...2operator__less__than__or__equal_8hpp.html | 136 + ...or__less__than__or__equal_8hpp_source.html | 140 + ...rators_2operator__multiplication_8hpp.html | 136 + ...2operator__multiplication_8hpp_source.html | 141 + ...2operators_2operator__not__equal_8hpp.html | 136 + ...ors_2operator__not__equal_8hpp_source.html | 140 + ...operators_2operator__subtraction_8hpp.html | 136 + ...rs_2operator__subtraction_8hpp_source.html | 140 + doc/api/html/fwd_2operators_8hpp.html | 120 + doc/api/html/fwd_2operators_8hpp_source.html | 123 + doc/api/html/fwd_8hpp.html | 113 + doc/api/html/fwd_8hpp_source.html | 117 + doc/api/html/gamma_8hpp.html | 161 + doc/api/html/gamma_8hpp_source.html | 637 + doc/api/html/gaussian__dlm__obs_8hpp.html | 174 + .../html/gaussian__dlm__obs_8hpp_source.html | 548 + doc/api/html/generator_8hpp.html | 327 + doc/api/html/generator_8hpp_source.html | 4105 +++ doc/api/html/get__base1_8hpp.html | 177 + doc/api/html/get__base1_8hpp_source.html | 274 + doc/api/html/get__base1__lhs_8hpp.html | 177 + doc/api/html/get__base1__lhs_8hpp_source.html | 276 + doc/api/html/globals.html | 443 + doc/api/html/globals_defs.html | 127 + doc/api/html/globals_func.html | 164 + doc/api/html/globals_vars.html | 356 + doc/api/html/gm_8hpp.html | 111 + doc/api/html/gm_8hpp_source.html | 114 + doc/api/html/grad_8hpp.html | 130 + doc/api/html/grad_8hpp_source.html | 133 + doc/api/html/gumbel_8hpp.html | 157 + doc/api/html/gumbel_8hpp_source.html | 440 + doc/api/html/head_8hpp.html | 144 + doc/api/html/head_8hpp_source.html | 156 + doc/api/html/hessian_8hpp.html | 132 + doc/api/html/hessian_8hpp_source.html | 151 + doc/api/html/hierarchy.html | 534 + doc/api/html/hypergeometric_8hpp.html | 143 + doc/api/html/hypergeometric_8hpp_source.html | 240 + doc/api/html/index.html | 104 + doc/api/html/initialize_8hpp.html | 143 + doc/api/html/initialize_8hpp_source.html | 145 + doc/api/html/initialize__variable_8hpp.html | 139 + .../initialize__variable_8hpp_source.html | 137 + doc/api/html/int__step_8hpp.html | 129 + doc/api/html/int__step_8hpp_source.html | 120 + doc/api/html/internal_8hpp.html | 123 + doc/api/html/internal_8hpp_source.html | 126 + doc/api/html/internal__math_8hpp.html | 141 + doc/api/html/internal__math_8hpp_source.html | 314 + doc/api/html/inv__chi__square_8hpp.html | 155 + .../html/inv__chi__square_8hpp_source.html | 563 + doc/api/html/inv__gamma_8hpp.html | 161 + doc/api/html/inv__gamma_8hpp_source.html | 653 + doc/api/html/inv__wishart_8hpp.html | 147 + doc/api/html/inv__wishart_8hpp_source.html | 242 + doc/api/html/inverse__softmax_8hpp.html | 132 + .../html/inverse__softmax_8hpp_source.html | 130 + doc/api/html/inverse__spd_8hpp.html | 133 + doc/api/html/inverse__spd_8hpp_source.html | 134 + doc/api/html/io_2util_8hpp.html | 130 + doc/api/html/io_2util_8hpp_source.html | 140 + doc/api/html/io_8hpp.html | 115 + doc/api/html/io_8hpp_source.html | 118 + doc/api/html/iterator__typedefs_8hpp.html | 139 + .../html/iterator__typedefs_8hpp_source.html | 122 + doc/api/html/jacobian_8hpp.html | 130 + doc/api/html/jacobian_8hpp_source.html | 134 + doc/api/html/jquery.js | 8 + doc/api/html/list__argument_8hpp.html | 130 + doc/api/html/list__argument_8hpp_source.html | 300 + doc/api/html/lkj__corr_8hpp.html | 156 + doc/api/html/lkj__corr_8hpp_source.html | 291 + doc/api/html/lkj__cov_8hpp.html | 153 + doc/api/html/lkj__cov_8hpp_source.html | 252 + doc/api/html/logical__and_8hpp.html | 129 + doc/api/html/logical__and_8hpp_source.html | 123 + doc/api/html/logical__eq_8hpp.html | 129 + doc/api/html/logical__eq_8hpp_source.html | 123 + doc/api/html/logical__gt_8hpp.html | 129 + doc/api/html/logical__gt_8hpp_source.html | 123 + doc/api/html/logical__gte_8hpp.html | 129 + doc/api/html/logical__gte_8hpp_source.html | 123 + doc/api/html/logical__lt_8hpp.html | 129 + doc/api/html/logical__lt_8hpp_source.html | 124 + doc/api/html/logical__lte_8hpp.html | 129 + doc/api/html/logical__lte_8hpp_source.html | 123 + doc/api/html/logical__negation_8hpp.html | 129 + .../html/logical__negation_8hpp_source.html | 123 + doc/api/html/logical__neq_8hpp.html | 129 + doc/api/html/logical__neq_8hpp_source.html | 122 + doc/api/html/logical__or_8hpp.html | 129 + doc/api/html/logical__or_8hpp_source.html | 123 + doc/api/html/logistic_8hpp.html | 157 + doc/api/html/logistic_8hpp_source.html | 546 + doc/api/html/lognormal_8hpp.html | 158 + doc/api/html/lognormal_8hpp_source.html | 519 + doc/api/html/mainpage_8dox.html | 103 + doc/api/html/math_2constants_8hpp.html | 192 + doc/api/html/math_2constants_8hpp_source.html | 186 + ...ng_2matrix_2check__pos__definite_8hpp.html | 136 + ...rix_2check__pos__definite_8hpp_source.html | 159 + doc/api/html/math_2error__handling_8hpp.html | 130 + .../math_2error__handling_8hpp_source.html | 136 + doc/api/html/math_2functions_2_phi_8hpp.html | 133 + .../math_2functions_2_phi_8hpp_source.html | 136 + .../math_2functions_2_phi__approx_8hpp.html | 132 + ..._2functions_2_phi__approx_8hpp_source.html | 126 + doc/api/html/math_2functions_2abs_8hpp.html | 129 + .../math_2functions_2abs_8hpp_source.html | 124 + .../html/math_2functions_2as__bool_8hpp.html | 133 + ...math_2functions_2as__bool_8hpp_source.html | 128 + ..._2functions_2bessel__first__kind_8hpp.html | 129 + ...ions_2bessel__first__kind_8hpp_source.html | 125 + ...2functions_2bessel__second__kind_8hpp.html | 129 + ...ons_2bessel__second__kind_8hpp_source.html | 125 + ...th_2functions_2binary__log__loss_8hpp.html | 131 + ...ctions_2binary__log__loss_8hpp_source.html | 126 + ...ions_2binomial__coefficient__log_8hpp.html | 132 + ...inomial__coefficient__log_8hpp_source.html | 136 + .../html/math_2functions_2digamma_8hpp.html | 128 + .../math_2functions_2digamma_8hpp_source.html | 124 + .../html/math_2functions_2dot__self_8hpp.html | 129 + ...ath_2functions_2dot__self_8hpp_source.html | 128 + doc/api/html/math_2functions_2exp2_8hpp.html | 131 + .../math_2functions_2exp2_8hpp_source.html | 126 + ...h_2functions_2falling__factorial_8hpp.html | 130 + ...tions_2falling__factorial_8hpp_source.html | 125 + doc/api/html/math_2functions_2fdim_8hpp.html | 131 + .../math_2functions_2fdim_8hpp_source.html | 123 + doc/api/html/math_2functions_2fma_8hpp.html | 131 + .../math_2functions_2fma_8hpp_source.html | 124 + .../html/math_2functions_2gamma__p_8hpp.html | 128 + ...math_2functions_2gamma__p_8hpp_source.html | 125 + .../html/math_2functions_2gamma__q_8hpp.html | 128 + ...math_2functions_2gamma__q_8hpp_source.html | 125 + doc/api/html/math_2functions_2ibeta_8hpp.html | 129 + .../math_2functions_2ibeta_8hpp_source.html | 125 + .../html/math_2functions_2if__else_8hpp.html | 131 + ...math_2functions_2if__else_8hpp_source.html | 125 + doc/api/html/math_2functions_2inv_8hpp.html | 130 + .../math_2functions_2inv_8hpp_source.html | 126 + .../math_2functions_2inv__cloglog_8hpp.html | 131 + ..._2functions_2inv__cloglog_8hpp_source.html | 126 + .../math_2functions_2inv__logit_8hpp.html | 131 + ...th_2functions_2inv__logit_8hpp_source.html | 127 + .../html/math_2functions_2inv__sqrt_8hpp.html | 130 + ...ath_2functions_2inv__sqrt_8hpp_source.html | 128 + .../math_2functions_2inv__square_8hpp.html | 130 + ...h_2functions_2inv__square_8hpp_source.html | 125 + ...th_2functions_2is__uninitialized_8hpp.html | 129 + ...ctions_2is__uninitialized_8hpp_source.html | 122 + doc/api/html/math_2functions_2lbeta_8hpp.html | 132 + .../math_2functions_2lbeta_8hpp_source.html | 130 + .../html/math_2functions_2lgamma_8hpp.html | 128 + .../math_2functions_2lgamma_8hpp_source.html | 125 + .../html/math_2functions_2lmgamma_8hpp.html | 133 + .../math_2functions_2lmgamma_8hpp_source.html | 133 + doc/api/html/math_2functions_2log1m_8hpp.html | 132 + .../math_2functions_2log1m_8hpp_source.html | 126 + .../math_2functions_2log1m__exp_8hpp.html | 135 + ...th_2functions_2log1m__exp_8hpp_source.html | 134 + ...th_2functions_2log1m__inv__logit_8hpp.html | 131 + ...ctions_2log1m__inv__logit_8hpp_source.html | 128 + doc/api/html/math_2functions_2log1p_8hpp.html | 132 + .../math_2functions_2log1p_8hpp_source.html | 135 + .../math_2functions_2log1p__exp_8hpp.html | 132 + ...th_2functions_2log1p__exp_8hpp_source.html | 130 + doc/api/html/math_2functions_2log2_8hpp.html | 136 + .../math_2functions_2log2_8hpp_source.html | 133 + .../math_2functions_2log__diff__exp_8hpp.html | 134 + ...functions_2log__diff__exp_8hpp_source.html | 130 + ...nctions_2log__falling__factorial_8hpp.html | 130 + ..._2log__falling__factorial_8hpp_source.html | 126 + ...math_2functions_2log__inv__logit_8hpp.html | 131 + ...unctions_2log__inv__logit_8hpp_source.html | 128 + ...unctions_2log__rising__factorial_8hpp.html | 130 + ...s_2log__rising__factorial_8hpp_source.html | 126 + .../math_2functions_2log__sum__exp_8hpp.html | 138 + ...2functions_2log__sum__exp_8hpp_source.html | 150 + doc/api/html/math_2functions_2logit_8hpp.html | 131 + .../math_2functions_2logit_8hpp_source.html | 126 + ...s_2modified__bessel__first__kind_8hpp.html | 129 + ...fied__bessel__first__kind_8hpp_source.html | 125 + ..._2modified__bessel__second__kind_8hpp.html | 129 + ...ied__bessel__second__kind_8hpp_source.html | 125 + .../math_2functions_2multiply__log_8hpp.html | 131 + ...2functions_2multiply__log_8hpp_source.html | 128 + .../html/math_2functions_2owens__t_8hpp.html | 132 + ...math_2functions_2owens__t_8hpp_source.html | 126 + ...th_2functions_2rising__factorial_8hpp.html | 130 + ...ctions_2rising__factorial_8hpp_source.html | 125 + .../html/math_2functions_2square_8hpp.html | 129 + .../math_2functions_2square_8hpp_source.html | 122 + doc/api/html/math_2functions_2step_8hpp.html | 129 + .../math_2functions_2step_8hpp_source.html | 122 + doc/api/html/math_2functions_2sum_8hpp.html | 129 + .../math_2functions_2sum_8hpp_source.html | 127 + .../html/math_2functions_2value__of_8hpp.html | 133 + ...ath_2functions_2value__of_8hpp_source.html | 127 + doc/api/html/math_2functions_8hpp.html | 175 + doc/api/html/math_2functions_8hpp_source.html | 178 + ...h_2matrix_2columns__dot__product_8hpp.html | 132 + ...ix_2columns__dot__product_8hpp_source.html | 132 + ...math_2matrix_2columns__dot__self_8hpp.html | 130 + ...atrix_2columns__dot__self_8hpp_source.html | 124 + .../html/math_2matrix_2crossprod_8hpp.html | 130 + .../math_2matrix_2crossprod_8hpp_source.html | 124 + .../html/math_2matrix_2determinant_8hpp.html | 131 + ...math_2matrix_2determinant_8hpp_source.html | 125 + doc/api/html/math_2matrix_2divide_8hpp.html | 135 + .../math_2matrix_2divide_8hpp_source.html | 129 + .../html/math_2matrix_2dot__product_8hpp.html | 139 + ...ath_2matrix_2dot__product_8hpp_source.html | 142 + .../html/math_2matrix_2dot__self_8hpp.html | 131 + .../math_2matrix_2dot__self_8hpp_source.html | 125 + doc/api/html/math_2matrix_2exp_8hpp.html | 130 + .../html/math_2matrix_2exp_8hpp_source.html | 123 + doc/api/html/math_2matrix_2inverse_8hpp.html | 132 + .../math_2matrix_2inverse_8hpp_source.html | 127 + doc/api/html/math_2matrix_2ldlt_8hpp.html | 159 + .../html/math_2matrix_2ldlt_8hpp_source.html | 245 + doc/api/html/math_2matrix_2log_8hpp.html | 130 + .../html/math_2matrix_2log_8hpp_source.html | 124 + .../math_2matrix_2log__determinant_8hpp.html | 131 + ...2matrix_2log__determinant_8hpp_source.html | 125 + ...h_2matrix_2log__determinant__spd_8hpp.html | 132 + ...ix_2log__determinant__spd_8hpp_source.html | 133 + .../html/math_2matrix_2log__softmax_8hpp.html | 136 + ...ath_2matrix_2log__softmax_8hpp_source.html | 145 + .../math_2matrix_2log__sum__exp_8hpp.html | 134 + ...th_2matrix_2log__sum__exp_8hpp_source.html | 143 + .../math_2matrix_2mdivide__left_8hpp.html | 136 + ...th_2matrix_2mdivide__left_8hpp_source.html | 136 + ...math_2matrix_2mdivide__left__spd_8hpp.html | 136 + ...atrix_2mdivide__left__spd_8hpp_source.html | 136 + ...math_2matrix_2mdivide__left__tri_8hpp.html | 140 + ...atrix_2mdivide__left__tri_8hpp_source.html | 149 + ...2matrix_2mdivide__left__tri__low_8hpp.html | 136 + ..._2mdivide__left__tri__low_8hpp_source.html | 149 + .../math_2matrix_2mdivide__right_8hpp.html | 137 + ...h_2matrix_2mdivide__right_8hpp_source.html | 142 + ...matrix_2mdivide__right__tri__low_8hpp.html | 135 + ...2mdivide__right__tri__low_8hpp_source.html | 133 + doc/api/html/math_2matrix_2multiply_8hpp.html | 152 + .../math_2matrix_2multiply_8hpp_source.html | 160 + ...ply__lower__tri__self__transpose_8hpp.html | 129 + ...wer__tri__self__transpose_8hpp_source.html | 133 + .../html/math_2matrix_2quad__form_8hpp.html | 144 + .../math_2matrix_2quad__form_8hpp_source.html | 166 + ...math_2matrix_2rows__dot__product_8hpp.html | 132 + ...atrix_2rows__dot__product_8hpp_source.html | 132 + .../math_2matrix_2rows__dot__self_8hpp.html | 130 + ..._2matrix_2rows__dot__self_8hpp_source.html | 124 + doc/api/html/math_2matrix_2sd_8hpp.html | 140 + .../html/math_2matrix_2sd_8hpp_source.html | 141 + doc/api/html/math_2matrix_2softmax_8hpp.html | 133 + .../math_2matrix_2softmax_8hpp_source.html | 137 + doc/api/html/math_2matrix_2sort_8hpp.html | 145 + .../html/math_2matrix_2sort_8hpp_source.html | 145 + .../math_2matrix_2squared__dist_8hpp.html | 132 + ...th_2matrix_2squared__dist_8hpp_source.html | 131 + .../html/math_2matrix_2stan__print_8hpp.html | 142 + ...math_2matrix_2stan__print_8hpp_source.html | 166 + doc/api/html/math_2matrix_2sum_8hpp.html | 135 + .../html/math_2matrix_2sum_8hpp_source.html | 133 + .../html/math_2matrix_2tcrossprod_8hpp.html | 130 + .../math_2matrix_2tcrossprod_8hpp_source.html | 132 + ..._2matrix_2trace__gen__quad__form_8hpp.html | 134 + ...x_2trace__gen__quad__form_8hpp_source.html | 135 + .../math_2matrix_2trace__quad__form_8hpp.html | 134 + ...matrix_2trace__quad__form_8hpp_source.html | 132 + doc/api/html/math_2matrix_2typedefs_8hpp.html | 142 + .../math_2matrix_2typedefs_8hpp_source.html | 134 + doc/api/html/math_2matrix_2variance_8hpp.html | 139 + .../math_2matrix_2variance_8hpp_source.html | 156 + doc/api/html/math_2matrix_8hpp.html | 209 + doc/api/html/math_2matrix_8hpp_source.html | 213 + doc/api/html/math_8hpp.html | 115 + doc/api/html/math_8hpp_source.html | 118 + doc/api/html/matrix_2dist_8hpp.html | 134 + doc/api/html/matrix_2dist_8hpp_source.html | 128 + doc/api/html/matrix_2max_8hpp.html | 139 + doc/api/html/matrix_2max_8hpp_source.html | 148 + doc/api/html/matrix_2min_8hpp.html | 139 + doc/api/html/matrix_2min_8hpp_source.html | 148 + .../html/matrix__error__handling_8hpp.html | 125 + .../matrix__error__handling_8hpp_source.html | 128 + doc/api/html/matrix__normal_8hpp.html | 148 + doc/api/html/matrix__normal_8hpp_source.html | 244 + doc/api/html/matrix__vari_8hpp.html | 130 + doc/api/html/matrix__vari_8hpp_source.html | 142 + doc/api/html/mcmc_8hpp.html | 123 + doc/api/html/mcmc_8hpp_source.html | 128 + doc/api/html/mcmc__writer_8hpp.html | 134 + doc/api/html/mcmc__writer_8hpp_source.html | 281 + doc/api/html/mdivide__right__spd_8hpp.html | 137 + .../html/mdivide__right__spd_8hpp_source.html | 134 + doc/api/html/mdivide__right__tri_8hpp.html | 138 + .../html/mdivide__right__tri_8hpp_source.html | 144 + doc/api/html/mean_8hpp.html | 139 + doc/api/html/mean_8hpp_source.html | 140 + doc/api/html/memory_8hpp.html | 110 + doc/api/html/memory_8hpp_source.html | 114 + doc/api/html/meta_2traits_8hpp.html | 235 + doc/api/html/meta_2traits_8hpp_source.html | 482 + doc/api/html/meta_8hpp.html | 110 + doc/api/html/meta_8hpp_source.html | 113 + doc/api/html/minus_8hpp.html | 129 + doc/api/html/minus_8hpp_source.html | 122 + doc/api/html/model_2util_8hpp.html | 160 + doc/api/html/model_2util_8hpp_source.html | 358 + doc/api/html/model_8hpp.html | 111 + doc/api/html/model_8hpp_source.html | 114 + doc/api/html/model__header_8hpp.html | 135 + doc/api/html/model__header_8hpp_source.html | 144 + doc/api/html/multi__gp_8hpp.html | 151 + doc/api/html/multi__gp_8hpp_source.html | 233 + doc/api/html/multi__normal_8hpp.html | 166 + doc/api/html/multi__normal_8hpp_source.html | 360 + .../html/multi__normal__cholesky_8hpp.html | 163 + .../multi__normal__cholesky_8hpp_source.html | 318 + doc/api/html/multi__normal__prec_8hpp.html | 162 + .../html/multi__normal__prec_8hpp_source.html | 327 + doc/api/html/multi__student__t_8hpp.html | 149 + .../html/multi__student__t_8hpp_source.html | 275 + doc/api/html/multinomial_8hpp.html | 146 + doc/api/html/multinomial_8hpp_source.html | 204 + .../html/multivariate_2continuous_8hpp.html | 121 + .../multivariate_2continuous_8hpp_source.html | 124 + doc/api/html/multivariate_2discrete_8hpp.html | 112 + .../multivariate_2discrete_8hpp_source.html | 114 + doc/api/html/multivariate_8hpp.html | 111 + doc/api/html/multivariate_8hpp_source.html | 114 + doc/api/html/namespace_eigen.html | 124 + doc/api/html/namespace_eigen_1_1internal.html | 134 + doc/api/html/namespaceboost.html | 117 + doc/api/html/namespaceboost_1_1math.html | 330 + doc/api/html/namespacemembers.html | 202 + doc/api/html/namespacemembers_0x62.html | 240 + doc/api/html/namespacemembers_0x63.html | 343 + doc/api/html/namespacemembers_0x64.html | 228 + doc/api/html/namespacemembers_0x65.html | 223 + doc/api/html/namespacemembers_0x66.html | 191 + doc/api/html/namespacemembers_0x67.html | 375 + doc/api/html/namespacemembers_0x68.html | 173 + doc/api/html/namespacemembers_0x69.html | 300 + doc/api/html/namespacemembers_0x6a.html | 140 + doc/api/html/namespacemembers_0x6c.html | 343 + doc/api/html/namespacemembers_0x6d.html | 286 + doc/api/html/namespacemembers_0x6e.html | 191 + doc/api/html/namespacemembers_0x6f.html | 195 + doc/api/html/namespacemembers_0x70.html | 253 + doc/api/html/namespacemembers_0x71.html | 147 + doc/api/html/namespacemembers_0x72.html | 242 + doc/api/html/namespacemembers_0x73.html | 303 + doc/api/html/namespacemembers_0x74.html | 208 + doc/api/html/namespacemembers_0x75.html | 173 + doc/api/html/namespacemembers_0x76.html | 255 + doc/api/html/namespacemembers_0x77.html | 173 + doc/api/html/namespacemembers_func.html | 181 + doc/api/html/namespacemembers_func_0x62.html | 226 + doc/api/html/namespacemembers_func_0x63.html | 338 + doc/api/html/namespacemembers_func_0x64.html | 218 + doc/api/html/namespacemembers_func_0x65.html | 208 + doc/api/html/namespacemembers_func_0x66.html | 185 + doc/api/html/namespacemembers_func_0x67.html | 375 + doc/api/html/namespacemembers_func_0x68.html | 173 + doc/api/html/namespacemembers_func_0x69.html | 282 + doc/api/html/namespacemembers_func_0x6a.html | 140 + doc/api/html/namespacemembers_func_0x6c.html | 324 + doc/api/html/namespacemembers_func_0x6d.html | 251 + doc/api/html/namespacemembers_func_0x6e.html | 176 + doc/api/html/namespacemembers_func_0x6f.html | 195 + doc/api/html/namespacemembers_func_0x70.html | 244 + doc/api/html/namespacemembers_func_0x71.html | 147 + doc/api/html/namespacemembers_func_0x72.html | 216 + doc/api/html/namespacemembers_func_0x73.html | 277 + doc/api/html/namespacemembers_func_0x74.html | 197 + doc/api/html/namespacemembers_func_0x75.html | 167 + doc/api/html/namespacemembers_func_0x76.html | 199 + doc/api/html/namespacemembers_func_0x77.html | 173 + doc/api/html/namespacemembers_type.html | 249 + doc/api/html/namespacemembers_vars.html | 385 + doc/api/html/namespaces.html | 124 + doc/api/html/namespacestan.html | 615 + doc/api/html/namespacestan_1_1agrad.html | 21482 ++++++++++++++++ doc/api/html/namespacestan_1_1gm.html | 4657 ++++ doc/api/html/namespacestan_1_1io.html | 413 + doc/api/html/namespacestan_1_1math.html | 17498 +++++++++++++ .../namespacestan_1_1math_1_1policies.html | 179 + ...acestan_1_1math_1_1policies_1_1detail.html | 335 + doc/api/html/namespacestan_1_1mcmc.html | 197 + doc/api/html/namespacestan_1_1memory.html | 179 + doc/api/html/namespacestan_1_1model.html | 635 + .../html/namespacestan_1_1optimization.html | 255 + doc/api/html/namespacestan_1_1prob.html | 13569 ++++++++++ doc/api/html/namespacestd.html | 202 + doc/api/html/nav_f.png | Bin 0 -> 153 bytes doc/api/html/nav_g.png | Bin 0 -> 95 bytes doc/api/html/nav_h.png | Bin 0 -> 98 bytes doc/api/html/neg__binomial_8hpp.html | 163 + doc/api/html/neg__binomial_8hpp_source.html | 714 + doc/api/html/nesterov__gradient_8hpp.html | 128 + .../html/nesterov__gradient_8hpp_source.html | 258 + doc/api/html/newton_8hpp.html | 141 + doc/api/html/newton_8hpp_source.html | 193 + doc/api/html/open.png | Bin 0 -> 123 bytes .../html/operator__divide__equal_8hpp.html | 123 + .../operator__divide__equal_8hpp_source.html | 131 + doc/api/html/operator__minus__equal_8hpp.html | 123 + .../operator__minus__equal_8hpp_source.html | 131 + .../html/operator__multiply__equal_8hpp.html | 123 + ...operator__multiply__equal_8hpp_source.html | 131 + doc/api/html/operator__plus__equal_8hpp.html | 123 + .../operator__plus__equal_8hpp_source.html | 131 + .../html/operator__unary__decrement_8hpp.html | 133 + ...perator__unary__decrement_8hpp_source.html | 142 + .../html/operator__unary__increment_8hpp.html | 133 + ...perator__unary__increment_8hpp_source.html | 142 + doc/api/html/operator__unary__minus_8hpp.html | 130 + .../operator__unary__minus_8hpp_source.html | 126 + .../html/operator__unary__negative_8hpp.html | 130 + ...operator__unary__negative_8hpp_source.html | 135 + doc/api/html/operator__unary__not_8hpp.html | 129 + .../operator__unary__not_8hpp_source.html | 122 + doc/api/html/operator__unary__plus_8hpp.html | 129 + .../operator__unary__plus_8hpp_source.html | 122 + doc/api/html/ordered__logistic_8hpp.html | 151 + .../html/ordered__logistic_8hpp_source.html | 264 + doc/api/html/pages.html | 102 + doc/api/html/pareto_8hpp.html | 158 + doc/api/html/pareto_8hpp_source.html | 556 + doc/api/html/parser_8hpp.html | 165 + doc/api/html/parser_8hpp_source.html | 282 + doc/api/html/partials__vari_8hpp.html | 133 + doc/api/html/partials__vari_8hpp_source.html | 250 + doc/api/html/poisson_8hpp.html | 161 + doc/api/html/poisson_8hpp_source.html | 531 + doc/api/html/policy_page.html | 98 + doc/api/html/precomp__v__vari_8hpp.html | 129 + .../html/precomp__v__vari_8hpp_source.html | 133 + doc/api/html/print_8cpp.html | 164 + doc/api/html/print_8cpp_source.html | 419 + doc/api/html/print_8hpp.html | 502 + doc/api/html/print_8hpp_source.html | 314 + doc/api/html/print__stack_8hpp.html | 131 + doc/api/html/print__stack_8hpp_source.html | 130 + doc/api/html/prob_2constants_8hpp.html | 122 + doc/api/html/prob_2constants_8hpp_source.html | 149 + ..._2univariate_2continuous_2normal_8hpp.html | 162 + ...riate_2continuous_2normal_8hpp_source.html | 472 + doc/api/html/prob_2traits_8hpp.html | 130 + doc/api/html/prob_2traits_8hpp_source.html | 149 + doc/api/html/prob_8hpp.html | 115 + doc/api/html/prob_8hpp_source.html | 117 + doc/api/html/prob__grad_8hpp.html | 131 + doc/api/html/prob__grad_8hpp_source.html | 158 + doc/api/html/prod_8hpp.html | 135 + doc/api/html/prod_8hpp_source.html | 134 + doc/api/html/program__grammar_8hpp.html | 136 + .../html/program__grammar_8hpp_source.html | 191 + doc/api/html/program__grammar__def_8hpp.html | 180 + .../program__grammar__def_8hpp_source.html | 290 + doc/api/html/program__grammar__inst_8cpp.html | 123 + .../program__grammar__inst_8cpp_source.html | 115 + doc/api/html/promote__common_8hpp.html | 130 + doc/api/html/promote__common_8hpp_source.html | 130 + doc/api/html/promoter_8hpp.html | 139 + doc/api/html/promoter_8hpp_source.html | 200 + doc/api/html/ps__point_8hpp.html | 132 + doc/api/html/ps__point_8hpp_source.html | 205 + doc/api/html/raise__domain__error_8hpp.html | 149 + .../raise__domain__error_8hpp_source.html | 179 + doc/api/html/rank_8hpp.html | 136 + doc/api/html/rank_8hpp_source.html | 145 + doc/api/html/rayleigh_8hpp.html | 151 + doc/api/html/rayleigh_8hpp_source.html | 447 + doc/api/html/reader_8hpp.html | 130 + doc/api/html/reader_8hpp_source.html | 726 + doc/api/html/rep__array_8hpp.html | 137 + doc/api/html/rep__array_8hpp_source.html | 150 + doc/api/html/rep__matrix_8hpp.html | 142 + doc/api/html/rep__matrix_8hpp_source.html | 150 + doc/api/html/rep__row__vector_8hpp.html | 133 + .../html/rep__row__vector_8hpp_source.html | 131 + doc/api/html/rep__vector_8hpp.html | 133 + doc/api/html/rep__vector_8hpp_source.html | 133 + doc/api/html/resize_8hpp.html | 131 + doc/api/html/resize_8hpp_source.html | 167 + doc/api/html/rev_2functions_2acos_8hpp.html | 131 + .../rev_2functions_2acos_8hpp_source.html | 136 + doc/api/html/rev_2functions_2acosh_8hpp.html | 136 + .../rev_2functions_2acosh_8hpp_source.html | 144 + doc/api/html/rev_2functions_2asin_8hpp.html | 131 + .../rev_2functions_2asin_8hpp_source.html | 136 + doc/api/html/rev_2functions_2asinh_8hpp.html | 136 + .../rev_2functions_2asinh_8hpp_source.html | 143 + doc/api/html/rev_2functions_2atan2_8hpp.html | 139 + .../rev_2functions_2atan2_8hpp_source.html | 170 + doc/api/html/rev_2functions_2atan_8hpp.html | 131 + .../rev_2functions_2atan_8hpp_source.html | 136 + doc/api/html/rev_2functions_2atanh_8hpp.html | 132 + .../rev_2functions_2atanh_8hpp_source.html | 141 + doc/api/html/rev_2functions_2cbrt_8hpp.html | 131 + .../rev_2functions_2cbrt_8hpp_source.html | 136 + doc/api/html/rev_2functions_2ceil_8hpp.html | 131 + .../rev_2functions_2ceil_8hpp_source.html | 133 + doc/api/html/rev_2functions_2cos_8hpp.html | 131 + .../html/rev_2functions_2cos_8hpp_source.html | 136 + doc/api/html/rev_2functions_2cosh_8hpp.html | 131 + .../rev_2functions_2cosh_8hpp_source.html | 136 + doc/api/html/rev_2functions_2erf_8hpp.html | 133 + .../html/rev_2functions_2erf_8hpp_source.html | 138 + doc/api/html/rev_2functions_2erfc_8hpp.html | 133 + .../rev_2functions_2erfc_8hpp_source.html | 138 + doc/api/html/rev_2functions_2expm1_8hpp.html | 132 + .../rev_2functions_2expm1_8hpp_source.html | 137 + doc/api/html/rev_2functions_2fabs_8hpp.html | 133 + .../rev_2functions_2fabs_8hpp_source.html | 136 + doc/api/html/rev_2functions_2floor_8hpp.html | 131 + .../rev_2functions_2floor_8hpp_source.html | 133 + doc/api/html/rev_2functions_2fmax_8hpp.html | 135 + .../rev_2functions_2fmax_8hpp_source.html | 133 + doc/api/html/rev_2functions_2fmin_8hpp.html | 135 + .../rev_2functions_2fmin_8hpp_source.html | 133 + doc/api/html/rev_2functions_2fmod_8hpp.html | 139 + .../rev_2functions_2fmod_8hpp_source.html | 168 + doc/api/html/rev_2functions_2hypot_8hpp.html | 139 + .../rev_2functions_2hypot_8hpp_source.html | 162 + doc/api/html/rev_2functions_2log10_8hpp.html | 155 + .../rev_2functions_2log10_8hpp_source.html | 139 + doc/api/html/rev_2functions_2pow_8hpp.html | 141 + .../html/rev_2functions_2pow_8hpp_source.html | 178 + doc/api/html/rev_2functions_2round_8hpp.html | 131 + .../rev_2functions_2round_8hpp_source.html | 134 + doc/api/html/rev_2functions_2sin_8hpp.html | 131 + .../html/rev_2functions_2sin_8hpp_source.html | 136 + doc/api/html/rev_2functions_2sinh_8hpp.html | 131 + .../rev_2functions_2sinh_8hpp_source.html | 136 + doc/api/html/rev_2functions_2sqrt_8hpp.html | 131 + .../rev_2functions_2sqrt_8hpp_source.html | 136 + doc/api/html/rev_2functions_2tan_8hpp.html | 131 + .../html/rev_2functions_2tan_8hpp_source.html | 136 + doc/api/html/rev_2functions_2tanh_8hpp.html | 131 + .../rev_2functions_2tanh_8hpp_source.html | 137 + doc/api/html/rev_2functions_2tgamma_8hpp.html | 131 + .../rev_2functions_2tgamma_8hpp_source.html | 136 + doc/api/html/rev_2functions_2trunc_8hpp.html | 131 + .../rev_2functions_2trunc_8hpp_source.html | 134 + doc/api/html/rev_2numeric__limits_8hpp.html | 137 + .../rev_2numeric__limits_8hpp_source.html | 163 + ...v_2operators_2operator__addition_8hpp.html | 137 + ...ators_2operator__addition_8hpp_source.html | 159 + ...v_2operators_2operator__division_8hpp.html | 138 + ...ators_2operator__division_8hpp_source.html | 169 + .../rev_2operators_2operator__equal_8hpp.html | 135 + ...perators_2operator__equal_8hpp_source.html | 130 + ...erators_2operator__greater__than_8hpp.html | 135 + ..._2operator__greater__than_8hpp_source.html | 130 + ...erator__greater__than__or__equal_8hpp.html | 135 + ..._greater__than__or__equal_8hpp_source.html | 130 + ...2operators_2operator__less__than_8hpp.html | 135 + ...ors_2operator__less__than_8hpp_source.html | 130 + ...2operator__less__than__or__equal_8hpp.html | 135 + ...or__less__than__or__equal_8hpp_source.html | 130 + ...rators_2operator__multiplication_8hpp.html | 137 + ...2operator__multiplication_8hpp_source.html | 159 + ...2operators_2operator__not__equal_8hpp.html | 135 + ...ors_2operator__not__equal_8hpp_source.html | 130 + ...operators_2operator__subtraction_8hpp.html | 138 + ...rs_2operator__subtraction_8hpp_source.html | 168 + doc/api/html/rev_2operators_8hpp.html | 128 + doc/api/html/rev_2operators_8hpp_source.html | 131 + doc/api/html/rev_8hpp.html | 120 + doc/api/html/rev_8hpp_source.html | 124 + doc/api/html/row_8hpp.html | 132 + doc/api/html/row_8hpp_source.html | 128 + doc/api/html/rows_8hpp.html | 129 + doc/api/html/rows_8hpp_source.html | 125 + doc/api/html/sample_8hpp.html | 130 + doc/api/html/sample_8hpp_source.html | 180 + doc/api/html/scaled__add_8hpp.html | 129 + doc/api/html/scaled__add_8hpp_source.html | 128 + .../html/scaled__inv__chi__square_8hpp.html | 162 + .../scaled__inv__chi__square_8hpp_source.html | 670 + doc/api/html/search/all_5f.html | 25 + doc/api/html/search/all_5f.js | 98 + doc/api/html/search/all_61.html | 25 + doc/api/html/search/all_61.js | 293 + doc/api/html/search/all_62.html | 25 + doc/api/html/search/all_62.js | 125 + doc/api/html/search/all_63.html | 25 + doc/api/html/search/all_63.js | 213 + doc/api/html/search/all_64.html | 25 + doc/api/html/search/all_64.js | 159 + doc/api/html/search/all_65.html | 25 + doc/api/html/search/all_65.js | 100 + doc/api/html/search/all_66.html | 25 + doc/api/html/search/all_66.js | 59 + doc/api/html/search/all_67.html | 25 + doc/api/html/search/all_67.js | 158 + doc/api/html/search/all_68.html | 25 + doc/api/html/search/all_68.js | 38 + doc/api/html/search/all_69.html | 25 + doc/api/html/search/all_69.js | 171 + doc/api/html/search/all_6a.html | 25 + doc/api/html/search/all_6a.js | 5 + doc/api/html/search/all_6b.html | 25 + doc/api/html/search/all_6b.js | 5 + doc/api/html/search/all_6c.html | 25 + doc/api/html/search/all_6c.js | 163 + doc/api/html/search/all_6d.html | 25 + doc/api/html/search/all_6d.js | 148 + doc/api/html/search/all_6e.html | 25 + doc/api/html/search/all_6e.js | 67 + doc/api/html/search/all_6f.html | 25 + doc/api/html/search/all_6f.js | 105 + doc/api/html/search/all_70.html | 25 + doc/api/html/search/all_70.js | 137 + doc/api/html/search/all_71.html | 25 + doc/api/html/search/all_71.js | 11 + doc/api/html/search/all_72.html | 25 + doc/api/html/search/all_72.js | 135 + doc/api/html/search/all_73.html | 25 + doc/api/html/search/all_73.js | 271 + doc/api/html/search/all_74.html | 25 + doc/api/html/search/all_74.js | 84 + doc/api/html/search/all_75.html | 25 + doc/api/html/search/all_75.js | 48 + doc/api/html/search/all_76.html | 25 + doc/api/html/search/all_76.js | 170 + doc/api/html/search/all_77.html | 25 + doc/api/html/search/all_77.js | 60 + doc/api/html/search/all_78.html | 25 + doc/api/html/search/all_78.js | 4 + doc/api/html/search/all_7a.html | 25 + doc/api/html/search/all_7a.js | 4 + doc/api/html/search/all_7e.html | 25 + doc/api/html/search/all_7e.js | 32 + doc/api/html/search/classes_61.html | 25 + doc/api/html/search/classes_61.js | 77 + doc/api/html/search/classes_62.html | 25 + doc/api/html/search/classes_62.js | 37 + doc/api/html/search/classes_63.html | 25 + doc/api/html/search/classes_63.js | 22 + doc/api/html/search/classes_64.html | 25 + doc/api/html/search/classes_64.js | 23 + doc/api/html/search/classes_65.html | 25 + doc/api/html/search/classes_65.js | 17 + doc/api/html/search/classes_66.html | 25 + doc/api/html/search/classes_66.js | 7 + doc/api/html/search/classes_67.html | 25 + doc/api/html/search/classes_67.js | 9 + doc/api/html/search/classes_69.html | 25 + doc/api/html/search/classes_69.js | 29 + doc/api/html/search/classes_6c.html | 25 + doc/api/html/search/classes_6c.js | 10 + doc/api/html/search/classes_6d.html | 25 + doc/api/html/search/classes_6d.js | 8 + doc/api/html/search/classes_6e.html | 25 + doc/api/html/search/classes_6e.js | 12 + doc/api/html/search/classes_6f.html | 25 + doc/api/html/search/classes_6f.js | 18 + doc/api/html/search/classes_70.html | 25 + doc/api/html/search/classes_70.js | 22 + doc/api/html/search/classes_72.html | 25 + doc/api/html/search/classes_72.js | 39 + doc/api/html/search/classes_73.html | 25 + doc/api/html/search/classes_73.js | 57 + doc/api/html/search/classes_74.html | 25 + doc/api/html/search/classes_74.js | 12 + doc/api/html/search/classes_75.html | 25 + doc/api/html/search/classes_75.js | 12 + doc/api/html/search/classes_76.html | 25 + doc/api/html/search/classes_76.js | 35 + doc/api/html/search/classes_77.html | 25 + doc/api/html/search/classes_77.js | 16 + doc/api/html/search/close.png | Bin 0 -> 273 bytes doc/api/html/search/defines_5f.html | 25 + doc/api/html/search/defines_5f.js | 5 + doc/api/html/search/defines_64.html | 25 + doc/api/html/search/defines_64.js | 4 + doc/api/html/search/defines_65.html | 25 + doc/api/html/search/defines_65.js | 4 + doc/api/html/search/defines_6c.html | 25 + doc/api/html/search/defines_6c.js | 4 + doc/api/html/search/defines_75.html | 25 + doc/api/html/search/defines_75.js | 4 + doc/api/html/search/enumvalues_61.html | 25 + doc/api/html/search/enumvalues_61.js | 4 + doc/api/html/search/enumvalues_63.html | 25 + doc/api/html/search/enumvalues_63.js | 4 + doc/api/html/search/enumvalues_64.html | 25 + doc/api/html/search/enumvalues_64.js | 4 + doc/api/html/search/enumvalues_68.html | 25 + doc/api/html/search/enumvalues_68.js | 4 + doc/api/html/search/enumvalues_69.html | 25 + doc/api/html/search/enumvalues_69.js | 6 + doc/api/html/search/enumvalues_6c.html | 25 + doc/api/html/search/enumvalues_6c.js | 4 + doc/api/html/search/enumvalues_6d.html | 25 + doc/api/html/search/enumvalues_6d.js | 4 + doc/api/html/search/enumvalues_6e.html | 25 + doc/api/html/search/enumvalues_6e.js | 4 + doc/api/html/search/enumvalues_6f.html | 25 + doc/api/html/search/enumvalues_6f.js | 4 + doc/api/html/search/enumvalues_72.html | 25 + doc/api/html/search/enumvalues_72.js | 5 + doc/api/html/search/enumvalues_73.html | 25 + doc/api/html/search/enumvalues_73.js | 4 + doc/api/html/search/enumvalues_75.html | 25 + doc/api/html/search/enumvalues_75.js | 4 + doc/api/html/search/enumvalues_76.html | 25 + doc/api/html/search/enumvalues_76.js | 4 + doc/api/html/search/files_61.html | 25 + doc/api/html/search/files_61.js | 96 + doc/api/html/search/files_62.html | 25 + doc/api/html/search/files_62.js | 31 + doc/api/html/search/files_63.html | 25 + doc/api/html/search/files_63.js | 70 + doc/api/html/search/files_64.html | 25 + doc/api/html/search/files_64.js | 47 + doc/api/html/search/files_65.html | 25 + doc/api/html/search/files_65.js | 32 + doc/api/html/search/files_66.html | 25 + doc/api/html/search/files_66.js | 28 + doc/api/html/search/files_67.html | 25 + doc/api/html/search/files_67.js | 17 + doc/api/html/search/files_68.html | 25 + doc/api/html/search/files_68.js | 8 + doc/api/html/search/files_69.html | 25 + doc/api/html/search/files_69.js | 38 + doc/api/html/search/files_6a.html | 25 + doc/api/html/search/files_6a.js | 4 + doc/api/html/search/files_6c.html | 25 + doc/api/html/search/files_6c.js | 76 + doc/api/html/search/files_6d.html | 25 + doc/api/html/search/files_6d.js | 61 + doc/api/html/search/files_6e.html | 25 + doc/api/html/search/files_6e.js | 10 + doc/api/html/search/files_6f.html | 25 + doc/api/html/search/files_6f.js | 39 + doc/api/html/search/files_70.html | 25 + doc/api/html/search/files_70.js | 27 + doc/api/html/search/files_71.html | 25 + doc/api/html/search/files_71.js | 5 + doc/api/html/search/files_72.html | 25 + doc/api/html/search/files_72.js | 24 + doc/api/html/search/files_73.html | 25 + doc/api/html/search/files_73.js | 61 + doc/api/html/search/files_74.html | 25 + doc/api/html/search/files_74.js | 34 + doc/api/html/search/files_75.html | 25 + doc/api/html/search/files_75.js | 12 + doc/api/html/search/files_76.html | 25 + doc/api/html/search/files_76.js | 44 + doc/api/html/search/files_77.html | 25 + doc/api/html/search/files_77.js | 12 + doc/api/html/search/functions_5f.html | 25 + doc/api/html/search/functions_5f.js | 7 + doc/api/html/search/functions_61.html | 25 + doc/api/html/search/functions_61.js | 102 + doc/api/html/search/functions_62.html | 25 + doc/api/html/search/functions_62.js | 51 + doc/api/html/search/functions_63.html | 25 + doc/api/html/search/functions_63.js | 112 + doc/api/html/search/functions_64.html | 25 + doc/api/html/search/functions_64.js | 61 + doc/api/html/search/functions_65.html | 25 + doc/api/html/search/functions_65.js | 39 + doc/api/html/search/functions_66.html | 25 + doc/api/html/search/functions_66.js | 24 + doc/api/html/search/functions_67.html | 25 + doc/api/html/search/functions_67.js | 135 + doc/api/html/search/functions_68.html | 25 + doc/api/html/search/functions_68.js | 22 + doc/api/html/search/functions_69.html | 25 + doc/api/html/search/functions_69.js | 81 + doc/api/html/search/functions_6a.html | 25 + doc/api/html/search/functions_6a.js | 4 + doc/api/html/search/functions_6b.html | 25 + doc/api/html/search/functions_6b.js | 4 + doc/api/html/search/functions_6c.html | 25 + doc/api/html/search/functions_6c.js | 67 + doc/api/html/search/functions_6d.html | 25 + doc/api/html/search/functions_6d.js | 54 + doc/api/html/search/functions_6e.html | 25 + doc/api/html/search/functions_6e.js | 34 + doc/api/html/search/functions_6f.html | 25 + doc/api/html/search/functions_6f.js | 49 + doc/api/html/search/functions_70.html | 25 + doc/api/html/search/functions_70.js | 78 + doc/api/html/search/functions_71.html | 25 + doc/api/html/search/functions_71.js | 8 + doc/api/html/search/functions_72.html | 25 + doc/api/html/search/functions_72.js | 51 + doc/api/html/search/functions_73.html | 25 + doc/api/html/search/functions_73.js | 116 + doc/api/html/search/functions_74.html | 25 + doc/api/html/search/functions_74.js | 28 + doc/api/html/search/functions_75.html | 25 + doc/api/html/search/functions_75.js | 25 + doc/api/html/search/functions_76.html | 25 + doc/api/html/search/functions_76.js | 59 + doc/api/html/search/functions_77.html | 25 + doc/api/html/search/functions_77.js | 36 + doc/api/html/search/functions_7a.html | 25 + doc/api/html/search/functions_7a.js | 4 + doc/api/html/search/functions_7e.html | 25 + doc/api/html/search/functions_7e.js | 32 + doc/api/html/search/mag_sel.png | Bin 0 -> 563 bytes doc/api/html/search/namespaces_62.html | 25 + doc/api/html/search/namespaces_62.js | 5 + doc/api/html/search/namespaces_65.html | 25 + doc/api/html/search/namespaces_65.js | 5 + doc/api/html/search/namespaces_73.html | 25 + doc/api/html/search/namespaces_73.js | 16 + doc/api/html/search/nomatches.html | 12 + doc/api/html/search/pages_65.html | 25 + doc/api/html/search/pages_65.js | 4 + doc/api/html/search/related_6f.html | 25 + doc/api/html/search/related_6f.js | 4 + doc/api/html/search/related_76.html | 25 + doc/api/html/search/related_76.js | 4 + doc/api/html/search/search.css | 238 + doc/api/html/search/search.js | 815 + doc/api/html/search/search_l.png | Bin 0 -> 604 bytes doc/api/html/search/search_m.png | Bin 0 -> 158 bytes doc/api/html/search/search_r.png | Bin 0 -> 612 bytes doc/api/html/search/typedefs_61.html | 25 + doc/api/html/search/typedefs_61.js | 4 + doc/api/html/search/typedefs_62.html | 25 + doc/api/html/search/typedefs_62.js | 6 + doc/api/html/search/typedefs_65.html | 25 + doc/api/html/search/typedefs_65.js | 4 + doc/api/html/search/typedefs_66.html | 25 + doc/api/html/search/typedefs_66.js | 5 + doc/api/html/search/typedefs_68.html | 25 + doc/api/html/search/typedefs_68.js | 4 + doc/api/html/search/typedefs_69.html | 25 + doc/api/html/search/typedefs_69.js | 5 + doc/api/html/search/typedefs_6c.html | 25 + doc/api/html/search/typedefs_6c.js | 4 + doc/api/html/search/typedefs_6d.html | 25 + doc/api/html/search/typedefs_6d.js | 13 + doc/api/html/search/typedefs_6e.html | 25 + doc/api/html/search/typedefs_6e.js | 5 + doc/api/html/search/typedefs_70.html | 25 + doc/api/html/search/typedefs_70.js | 5 + doc/api/html/search/typedefs_72.html | 25 + doc/api/html/search/typedefs_72.js | 17 + doc/api/html/search/typedefs_73.html | 25 + doc/api/html/search/typedefs_73.js | 8 + doc/api/html/search/typedefs_74.html | 25 + doc/api/html/search/typedefs_74.js | 4 + doc/api/html/search/typedefs_75.html | 25 + doc/api/html/search/typedefs_75.js | 4 + doc/api/html/search/typedefs_76.html | 25 + doc/api/html/search/typedefs_76.js | 13 + doc/api/html/search/variables_5f.html | 25 + doc/api/html/search/variables_5f.js | 92 + doc/api/html/search/variables_61.html | 25 + doc/api/html/search/variables_61.js | 26 + doc/api/html/search/variables_62.html | 25 + doc/api/html/search/variables_62.js | 10 + doc/api/html/search/variables_63.html | 25 + doc/api/html/search/variables_63.js | 17 + doc/api/html/search/variables_64.html | 25 + doc/api/html/search/variables_64.js | 36 + doc/api/html/search/variables_65.html | 25 + doc/api/html/search/variables_65.js | 19 + doc/api/html/search/variables_66.html | 25 + doc/api/html/search/variables_66.js | 7 + doc/api/html/search/variables_67.html | 25 + doc/api/html/search/variables_67.js | 6 + doc/api/html/search/variables_68.html | 25 + doc/api/html/search/variables_68.js | 12 + doc/api/html/search/variables_69.html | 25 + doc/api/html/search/variables_69.js | 28 + doc/api/html/search/variables_6b.html | 25 + doc/api/html/search/variables_6b.js | 4 + doc/api/html/search/variables_6c.html | 25 + doc/api/html/search/variables_6c.js | 17 + doc/api/html/search/variables_6d.html | 25 + doc/api/html/search/variables_6d.js | 24 + doc/api/html/search/variables_6e.html | 25 + doc/api/html/search/variables_6e.js | 19 + doc/api/html/search/variables_6f.html | 25 + doc/api/html/search/variables_6f.js | 7 + doc/api/html/search/variables_70.html | 25 + doc/api/html/search/variables_70.js | 17 + doc/api/html/search/variables_71.html | 25 + doc/api/html/search/variables_71.js | 4 + doc/api/html/search/variables_72.html | 25 + doc/api/html/search/variables_72.js | 15 + doc/api/html/search/variables_73.html | 25 + doc/api/html/search/variables_73.js | 32 + doc/api/html/search/variables_74.html | 25 + doc/api/html/search/variables_74.js | 20 + doc/api/html/search/variables_75.html | 25 + doc/api/html/search/variables_75.js | 5 + doc/api/html/search/variables_76.html | 25 + doc/api/html/search/variables_76.js | 33 + doc/api/html/search/variables_77.html | 25 + doc/api/html/search/variables_77.js | 6 + doc/api/html/search/variables_78.html | 25 + doc/api/html/search/variables_78.js | 4 + doc/api/html/segment_8hpp.html | 141 + doc/api/html/segment_8hpp_source.html | 158 + doc/api/html/seq__view_8hpp.html | 155 + doc/api/html/seq__view_8hpp_source.html | 302 + doc/api/html/singleton__argument_8hpp.html | 159 + .../html/singleton__argument_8hpp_source.html | 281 + doc/api/html/singular__values_8hpp.html | 131 + .../html/singular__values_8hpp_source.html | 125 + doc/api/html/size_8hpp.html | 129 + doc/api/html/size_8hpp_source.html | 124 + doc/api/html/skew__normal_8hpp.html | 158 + doc/api/html/skew__normal_8hpp_source.html | 562 + doc/api/html/stack__alloc_8hpp.html | 187 + doc/api/html/stack__alloc_8hpp_source.html | 238 + doc/api/html/stan_8dox.html | 142 + doc/api/html/stan__csv__reader_8hpp.html | 143 + .../html/stan__csv__reader_8hpp_source.html | 453 + doc/api/html/stanc_8cpp.html | 158 + doc/api/html/stanc_8cpp_source.html | 115 + doc/api/html/stanc__helper_8hpp.html | 239 + doc/api/html/stanc__helper_8hpp_source.html | 284 + doc/api/html/stanlogo-main.png | Bin 0 -> 7353 bytes doc/api/html/statement__2__grammar_8hpp.html | 137 + .../statement__2__grammar_8hpp_source.html | 169 + .../html/statement__2__grammar__def_8hpp.html | 178 + ...tatement__2__grammar__def_8hpp_source.html | 252 + .../statement__2__grammar__inst_8cpp.html | 123 + ...atement__2__grammar__inst_8cpp_source.html | 115 + doc/api/html/statement__grammar_8hpp.html | 136 + .../html/statement__grammar_8hpp_source.html | 264 + .../html/statement__grammar__def_8hpp.html | 408 + .../statement__grammar__def_8hpp_source.html | 729 + .../html/statement__grammar__inst_8cpp.html | 123 + .../statement__grammar__inst_8cpp_source.html | 115 + doc/api/html/std_8dox.html | 112 + doc/api/html/stepsize__adaptation_8hpp.html | 129 + .../stepsize__adaptation_8hpp_source.html | 185 + doc/api/html/stepsize__adapter_8hpp.html | 129 + .../html/stepsize__adapter_8hpp_source.html | 138 + .../html/stepsize__covar__adapter_8hpp.html | 130 + .../stepsize__covar__adapter_8hpp_source.html | 157 + doc/api/html/stepsize__var__adapter_8hpp.html | 130 + .../stepsize__var__adapter_8hpp_source.html | 158 + doc/api/html/stored__gradient__vari_8hpp.html | 129 + .../stored__gradient__vari_8hpp_source.html | 146 + ...3_01stan_1_1agrad_1_1var_01_4-members.html | 127 + ..._traits_3_01stan_1_1agrad_1_1var_01_4.html | 371 + ...1_1va753d9f8f3d54fbedc22d657246672d94.html | 116 + ...1_1va9b485de9571b6e46d7a64aff43a6d9d3.html | 289 + ...1_1va16fe21f36cb92096f2fc63d419437421.html | 117 + ...1_1va3d1bc254c18abbf59c1006f7e7cbcbac.html | 117 + ...1_1va44da5f98e1caea9523bacbd5bdc025fe.html | 301 + ...1_1vacd54cabc78c49ca719650381b68b105e.html | 297 + ...0_01stan_1_1agrad_1_1var_01_4-members.html | 113 + ...double_00_01stan_1_1agrad_1_1var_01_4.html | 148 + ...agrad_1_1var_00_01double_01_4-members.html | 113 + ...stan_1_1agrad_1_1var_00_01double_01_4.html | 148 + ...1agrad_1_1var_00_01false_01_4-members.html | 113 + ...1stan_1_1agrad_1_1var_00_01false_01_4.html | 159 + .../html/structdot__product__store__type.html | 116 + doc/api/html/structexpression__grammar.html | 116 + ...rad_1_1_operands_and_partials-members.html | 124 + ...an_1_1agrad_1_1_operands_and_partials.html | 442 + .../structstan_1_1agrad_1_1fvar-members.html | 131 + doc/api/html/structstan_1_1agrad_1_1fvar.html | 715 + .../structstan_1_1contains__fvar-members.html | 113 + .../html/structstan_1_1contains__fvar.html | 157 + ...1gm_1_1add__conditional__body-members.html | 113 + ...tstan_1_1gm_1_1add__conditional__body.html | 169 + ...__conditional__body_1_1result-members.html | 113 + ...m_1_1add__conditional__body_1_1result.html | 146 + ..._1add__conditional__condition-members.html | 113 + ..._1_1gm_1_1add__conditional__condition.html | 175 + ...ditional__condition_1_1result-members.html | 113 + ...add__conditional__condition_1_1result.html | 146 + ...1gm_1_1add__expression__dimss-members.html | 113 + ...tstan_1_1gm_1_1add__expression__dimss.html | 181 + ...__expression__dimss_1_1result-members.html | 113 + ...m_1_1add__expression__dimss_1_1result.html | 146 + ..._1gm_1_1add__loop__identifier-members.html | 113 + ...ctstan_1_1gm_1_1add__loop__identifier.html | 181 + ...d__loop__identifier_1_1result-members.html | 113 + ...gm_1_1add__loop__identifier_1_1result.html | 146 + ...tan_1_1gm_1_1add__while__body-members.html | 113 + .../structstan_1_1gm_1_1add__while__body.html | 169 + ...1_1add__while__body_1_1result-members.html | 113 + ...n_1_1gm_1_1add__while__body_1_1result.html | 146 + ..._1gm_1_1add__while__condition-members.html | 113 + ...ctstan_1_1gm_1_1add__while__condition.html | 175 + ...d__while__condition_1_1result-members.html | 113 + ...gm_1_1add__while__condition_1_1result.html | 146 + ...tstan_1_1gm_1_1addition__expr-members.html | 113 + .../structstan_1_1gm_1_1addition__expr.html | 175 + ...m_1_1addition__expr_1_1result-members.html | 113 + ...tan_1_1gm_1_1addition__expr_1_1result.html | 146 + ...tstan_1_1gm_1_1array__literal-members.html | 117 + .../structstan_1_1gm_1_1array__literal.html | 223 + ...tructstan_1_1gm_1_1assignment-members.html | 117 + .../html/structstan_1_1gm_1_1assignment.html | 228 + ...stan_1_1gm_1_1base__var__decl-members.html | 118 + .../structstan_1_1gm_1_1base__var__decl.html | 274 + .../structstan_1_1gm_1_1base__var__decl.png | Bin 0 -> 6084 bytes ...tructstan_1_1gm_1_1binary__op-members.html | 118 + .../html/structstan_1_1gm_1_1binary__op.html | 250 + ...tan_1_1gm_1_1binary__op__expr-members.html | 113 + .../structstan_1_1gm_1_1binary__op__expr.html | 187 + ...1_1binary__op__expr_1_1result-members.html | 113 + ...n_1_1gm_1_1binary__op__expr_1_1result.html | 146 + ..._1cholesky__factor__var__decl-members.html | 122 + ..._1_1gm_1_1cholesky__factor__var__decl.html | 247 + ...n_1_1gm_1_1cholesky__factor__var__decl.png | Bin 0 -> 792 bytes ...1gm_1_1conditional__statement-members.html | 116 + ...tstan_1_1gm_1_1conditional__statement.html | 212 + ...trained__param__names__visgen-members.html | 130 + ..._1_1constrained__param__names__visgen.html | 583 + ...m_1_1constrained__param__names__visgen.png | Bin 0 -> 781 bytes ...gm_1_1contains__nonparam__var-members.html | 123 + ...stan_1_1gm_1_1contains__nonparam__var.html | 356 + ...tstan_1_1gm_1_1contains__nonparam__var.png | Bin 0 -> 737 bytes ...ctstan_1_1gm_1_1contains__var-members.html | 123 + .../structstan_1_1gm_1_1contains__var.html | 356 + .../structstan_1_1gm_1_1contains__var.png | Bin 0 -> 675 bytes ...gm_1_1corr__matrix__var__decl-members.html | 121 + ...stan_1_1gm_1_1corr__matrix__var__decl.html | 225 + ...tstan_1_1gm_1_1corr__matrix__var__decl.png | Bin 0 -> 745 bytes ...1gm_1_1cov__matrix__var__decl-members.html | 121 + ...tstan_1_1gm_1_1cov__matrix__var__decl.html | 225 + ...ctstan_1_1gm_1_1cov__matrix__var__decl.png | Bin 0 -> 747 bytes ...uctstan_1_1gm_1_1distribution-members.html | 114 + .../structstan_1_1gm_1_1distribution.html | 157 + ...tstan_1_1gm_1_1division__expr-members.html | 113 + .../structstan_1_1gm_1_1division__expr.html | 175 + ...m_1_1division__expr_1_1result-members.html | 113 + ...tan_1_1gm_1_1division__expr_1_1result.html | 146 + ...stan_1_1gm_1_1double__literal-members.html | 117 + .../structstan_1_1gm_1_1double__literal.html | 223 + ...an_1_1gm_1_1double__var__decl-members.html | 121 + ...structstan_1_1gm_1_1double__var__decl.html | 225 + .../structstan_1_1gm_1_1double__var__decl.png | Bin 0 -> 693 bytes ..._1_1dump__member__var__visgen-members.html | 131 + ...an_1_1gm_1_1dump__member__var__visgen.html | 576 + ...tan_1_1gm_1_1dump__member__var__visgen.png | Bin 0 -> 744 bytes ..._1_1gm_1_1elt__division__expr-members.html | 113 + ...ructstan_1_1gm_1_1elt__division__expr.html | 175 + ...elt__division__expr_1_1result-members.html | 113 + ..._1gm_1_1elt__division__expr_1_1result.html | 146 + ..._1_1elt__multiplication__expr-members.html | 113 + ...an_1_1gm_1_1elt__multiplication__expr.html | 175 + ...ultiplication__expr_1_1result-members.html | 113 + ..._1elt__multiplication__expr_1_1result.html | 146 + ...uctstan_1_1gm_1_1error__codes-members.html | 118 + .../structstan_1_1gm_1_1error__codes.html | 166 + ...tructstan_1_1gm_1_1expr__type-members.html | 125 + .../html/structstan_1_1gm_1_1expr__type.html | 387 + ...tructstan_1_1gm_1_1expression-members.html | 131 + .../html/structstan_1_1gm_1_1expression.html | 525 + ..._1_1expression__as__statement-members.html | 113 + ...an_1_1gm_1_1expression__as__statement.html | 175 + ...sion__as__statement_1_1result-members.html | 113 + ..._1expression__as__statement_1_1result.html | 146 + ..._1_1gm_1_1expression__grammar-members.html | 121 + ...ructstan_1_1gm_1_1expression__grammar.html | 334 + ...tructstan_1_1gm_1_1expression__grammar.png | Bin 0 -> 1419 bytes ..._1gm_1_1expression__type__vis-members.html | 121 + ...ctstan_1_1gm_1_1expression__type__vis.html | 314 + ...uctstan_1_1gm_1_1expression__type__vis.png | Bin 0 -> 818 bytes ...n_1_1gm_1_1expression__visgen-members.html | 128 + ...tructstan_1_1gm_1_1expression__visgen.html | 511 + ...structstan_1_1gm_1_1expression__visgen.png | Bin 0 -> 692 bytes ...tstan_1_1gm_1_1for__statement-members.html | 117 + .../structstan_1_1gm_1_1for__statement.html | 234 + .../html/structstan_1_1gm_1_1fun-members.html | 118 + doc/api/html/structstan_1_1gm_1_1fun.html | 248 + ...1generate__init__vars__visgen-members.html | 130 + ...1_1gm_1_1generate__init__vars__visgen.html | 570 + ..._1_1gm_1_1generate__init__vars__visgen.png | Bin 0 -> 763 bytes ...1gm_1_1generate__init__visgen-members.html | 139 + ...tstan_1_1gm_1_1generate__init__visgen.html | 965 + ...ctstan_1_1gm_1_1generate__init__visgen.png | Bin 0 -> 714 bytes ...local__var__init__nan__visgen-members.html | 133 + ...nerate__local__var__init__nan__visgen.html | 645 + ...enerate__local__var__init__nan__visgen.png | Bin 0 -> 846 bytes ...crement__log__prob__statement-members.html | 115 + ...gm_1_1increment__log__prob__statement.html | 186 + ...structstan_1_1gm_1_1index__op-members.html | 118 + .../html/structstan_1_1gm_1_1index__op.html | 249 + ...m_1_1init__local__var__visgen-members.html | 133 + ...tan_1_1gm_1_1init__local__var__visgen.html | 701 + ...stan_1_1gm_1_1init__local__var__visgen.png | Bin 0 -> 711 bytes ...uctstan_1_1gm_1_1int__literal-members.html | 118 + .../structstan_1_1gm_1_1int__literal.html | 243 + ...tstan_1_1gm_1_1int__var__decl-members.html | 121 + .../structstan_1_1gm_1_1int__var__decl.html | 225 + .../structstan_1_1gm_1_1int__var__decl.png | Bin 0 -> 670 bytes ...ructstan_1_1gm_1_1is__nil__op-members.html | 121 + .../html/structstan_1_1gm_1_1is__nil__op.html | 314 + .../html/structstan_1_1gm_1_1is__nil__op.png | Bin 0 -> 639 bytes ...1_1gm_1_1left__division__expr-members.html | 113 + ...uctstan_1_1gm_1_1left__division__expr.html | 175 + ...eft__division__expr_1_1result-members.html | 113 + ...1gm_1_1left__division__expr_1_1result.html | 146 + ...m_1_1local__var__decl__visgen-members.html | 135 + ...tan_1_1gm_1_1local__var__decl__visgen.html | 758 + ...stan_1_1gm_1_1local__var__decl__visgen.png | Bin 0 -> 711 bytes ..._1gm_1_1logical__negate__expr-members.html | 113 + ...ctstan_1_1gm_1_1logical__negate__expr.html | 169 + ...gical__negate__expr_1_1result-members.html | 113 + ...gm_1_1logical__negate__expr_1_1result.html | 146 + ...an_1_1gm_1_1matrix__var__decl-members.html | 123 + ...structstan_1_1gm_1_1matrix__var__decl.html | 269 + .../structstan_1_1gm_1_1matrix__var__decl.png | Bin 0 -> 698 bytes ..._1_1member__var__decl__visgen-members.html | 131 + ...an_1_1gm_1_1member__var__decl__visgen.html | 614 + ...tan_1_1gm_1_1member__var__decl__visgen.png | Bin 0 -> 747 bytes ...1_1gm_1_1multiplication__expr-members.html | 113 + ...uctstan_1_1gm_1_1multiplication__expr.html | 175 + ...ultiplication__expr_1_1result-members.html | 113 + ...1gm_1_1multiplication__expr_1_1result.html | 146 + ...structstan_1_1gm_1_1name__vis-members.html | 126 + .../html/structstan_1_1gm_1_1name__vis.html | 414 + .../html/structstan_1_1gm_1_1name__vis.png | Bin 0 -> 731 bytes ...uctstan_1_1gm_1_1negate__expr-members.html | 113 + .../structstan_1_1gm_1_1negate__expr.html | 169 + ...1gm_1_1negate__expr_1_1result-members.html | 113 + ...tstan_1_1gm_1_1negate__expr_1_1result.html | 146 + doc/api/html/structstan_1_1gm_1_1nil.html | 121 + ...structstan_1_1gm_1_1no__op__statement.html | 117 + ...n_1_1gm_1_1ordered__var__decl-members.html | 121 + ...tructstan_1_1gm_1_1ordered__var__decl.html | 225 + ...structstan_1_1gm_1_1ordered__var__decl.png | Bin 0 -> 719 bytes ...1positive__ordered__var__decl-members.html | 121 + ...1_1gm_1_1positive__ordered__var__decl.html | 225 + ..._1_1gm_1_1positive__ordered__var__decl.png | Bin 0 -> 794 bytes ...tan_1_1gm_1_1print__statement-members.html | 115 + .../structstan_1_1gm_1_1print__statement.html | 186 + ...structstan_1_1gm_1_1printable-members.html | 119 + .../html/structstan_1_1gm_1_1printable.html | 271 + ...an_1_1gm_1_1printable__visgen-members.html | 118 + ...structstan_1_1gm_1_1printable__visgen.html | 231 + .../structstan_1_1gm_1_1printable__visgen.png | Bin 0 -> 661 bytes .../structstan_1_1gm_1_1program-members.html | 120 + doc/api/html/structstan_1_1gm_1_1program.html | 306 + ...tan_1_1gm_1_1program__grammar-members.html | 126 + .../structstan_1_1gm_1_1program__grammar.html | 422 + .../structstan_1_1gm_1_1program__grammar.png | Bin 0 -> 1216 bytes .../structstan_1_1gm_1_1range-members.html | 118 + doc/api/html/structstan_1_1gm_1_1range.html | 251 + ...m_1_1remove__loop__identifier-members.html | 113 + ...tan_1_1gm_1_1remove__loop__identifier.html | 169 + ...e__loop__identifier_1_1result-members.html | 113 + ...1_1remove__loop__identifier_1_1result.html | 146 + ...1gm_1_1row__vector__var__decl-members.html | 122 + ...tstan_1_1gm_1_1row__vector__var__decl.html | 247 + ...ctstan_1_1gm_1_1row__vector__var__decl.png | Bin 0 -> 735 bytes .../structstan_1_1gm_1_1sample-members.html | 118 + doc/api/html/structstan_1_1gm_1_1sample.html | 248 + ...tstan_1_1gm_1_1set__fun__type-members.html | 113 + .../structstan_1_1gm_1_1set__fun__type.html | 169 + ...stan_1_1gm_1_1set__fun__type2-members.html | 113 + .../structstan_1_1gm_1_1set__fun__type2.html | 169 + ..._1_1set__fun__type2_1_1result-members.html | 113 + ...an_1_1gm_1_1set__fun__type2_1_1result.html | 146 + ...m_1_1set__fun__type_1_1result-members.html | 113 + ...tan_1_1gm_1_1set__fun__type_1_1result.html | 146 + ..._1gm_1_1set__fun__type__named-members.html | 113 + ...ctstan_1_1gm_1_1set__fun__type__named.html | 181 + ...t__fun__type__named_1_1result-members.html | 113 + ...gm_1_1set__fun__type__named_1_1result.html | 146 + ...1_1set__param__ranges__visgen-members.html | 133 + ...n_1_1gm_1_1set__param__ranges__visgen.html | 677 + ...an_1_1gm_1_1set__param__ranges__visgen.png | Bin 0 -> 766 bytes ...tstan_1_1gm_1_1set__var__type-members.html | 113 + .../structstan_1_1gm_1_1set__var__type.html | 181 + ...m_1_1set__var__type_1_1result-members.html | 113 + ...tan_1_1gm_1_1set__var__type_1_1result.html | 146 + ...n_1_1gm_1_1simplex__var__decl-members.html | 121 + ...tructstan_1_1gm_1_1simplex__var__decl.html | 225 + ...structstan_1_1gm_1_1simplex__var__decl.png | Bin 0 -> 716 bytes ...structstan_1_1gm_1_1statement-members.html | 127 + .../html/structstan_1_1gm_1_1statement.html | 449 + ..._1gm_1_1statement__2__grammar-members.html | 119 + ...ctstan_1_1gm_1_1statement__2__grammar.html | 295 + ...uctstan_1_1gm_1_1statement__2__grammar.png | Bin 0 -> 1468 bytes ...n_1_1gm_1_1statement__grammar-members.html | 138 + ...tructstan_1_1gm_1_1statement__grammar.html | 679 + ...structstan_1_1gm_1_1statement__grammar.png | Bin 0 -> 1445 bytes ...an_1_1gm_1_1statement__visgen-members.html | 130 + ...structstan_1_1gm_1_1statement__visgen.html | 558 + .../structstan_1_1gm_1_1statement__visgen.png | Bin 0 -> 675 bytes ...tructstan_1_1gm_1_1statements-members.html | 116 + .../html/structstan_1_1gm_1_1statements.html | 212 + ...an_1_1gm_1_1subtraction__expr-members.html | 113 + ...structstan_1_1gm_1_1subtraction__expr.html | 175 + ..._1subtraction__expr_1_1result-members.html | 113 + ..._1_1gm_1_1subtraction__expr_1_1result.html | 146 + ...ctstan_1_1gm_1_1term__grammar-members.html | 127 + .../structstan_1_1gm_1_1term__grammar.html | 459 + .../structstan_1_1gm_1_1term__grammar.png | Bin 0 -> 1363 bytes ...stan_1_1gm_1_1transpose__expr-members.html | 113 + .../structstan_1_1gm_1_1transpose__expr.html | 169 + ..._1_1transpose__expr_1_1result-members.html | 113 + ...an_1_1gm_1_1transpose__expr_1_1result.html | 146 + ...tructstan_1_1gm_1_1type__name-members.html | 113 + .../html/structstan_1_1gm_1_1type__name.html | 157 + ...m_1_1type__name_3_01bool_01_4-members.html | 113 + ...tan_1_1gm_1_1type__name_3_01bool_01_4.html | 155 + ...1_1type__name_3_01double_01_4-members.html | 113 + ...n_1_1gm_1_1type__name_3_01double_01_4.html | 155 + ...gm_1_1type__name_3_01int_01_4-members.html | 113 + ...stan_1_1gm_1_1type__name_3_01int_01_4.html | 155 + ...__name_3_01std_1_1string_01_4-members.html | 113 + ..._1_1type__name_3_01std_1_1string_01_4.html | 155 + ..._name_3_01unsigned_01int_01_4-members.html | 113 + ...1_1type__name_3_01unsigned_01int_01_4.html | 155 + ...structstan_1_1gm_1_1unary__op-members.html | 116 + .../html/structstan_1_1gm_1_1unary__op.html | 209 + ...trained__param__names__visgen-members.html | 130 + ..._1unconstrained__param__names__visgen.html | 583 + ...1_1unconstrained__param__names__visgen.png | Bin 0 -> 872 bytes ...gm_1_1unit__vector__var__decl-members.html | 121 + ...stan_1_1gm_1_1unit__vector__var__decl.html | 225 + ...tstan_1_1gm_1_1unit__vector__var__decl.png | Bin 0 -> 742 bytes ...stan_1_1gm_1_1unscope__locals-members.html | 113 + .../structstan_1_1gm_1_1unscope__locals.html | 169 + ..._1_1unscope__locals_1_1result-members.html | 113 + ...an_1_1gm_1_1unscope__locals_1_1result.html | 146 + ...gm_1_1validate__allow__sample-members.html | 113 + ...stan_1_1gm_1_1validate__allow__sample.html | 169 + ...date__allow__sample_1_1result-members.html | 113 + ..._1_1validate__allow__sample_1_1result.html | 146 + ...1_1gm_1_1validate__assignment-members.html | 113 + ...uctstan_1_1gm_1_1validate__assignment.html | 181 + ...alidate__assignment_1_1result-members.html | 113 + ...1gm_1_1validate__assignment_1_1result.html | 146 + ...1_1gm_1_1validate__expr__type-members.html | 113 + ...uctstan_1_1gm_1_1validate__expr__type.html | 169 + ..._1gm_1_1validate__expr__type2-members.html | 113 + ...ctstan_1_1gm_1_1validate__expr__type2.html | 169 + ...lidate__expr__type2_1_1result-members.html | 113 + ...gm_1_1validate__expr__type2_1_1result.html | 146 + ...alidate__expr__type_1_1result-members.html | 113 + ...1gm_1_1validate__expr__type_1_1result.html | 146 + ...1_1gm_1_1validate__int__expr2-members.html | 113 + ...uctstan_1_1gm_1_1validate__int__expr2.html | 169 + ...alidate__int__expr2_1_1result-members.html | 113 + ...1gm_1_1validate__int__expr2_1_1result.html | 146 + ...1_1gm_1_1validate__int__expr3-members.html | 113 + ...uctstan_1_1gm_1_1validate__int__expr3.html | 169 + ...alidate__int__expr3_1_1result-members.html | 113 + ...1gm_1_1validate__int__expr3_1_1result.html | 146 + ...tan_1_1gm_1_1validate__sample-members.html | 115 + .../structstan_1_1gm_1_1validate__sample.html | 251 + ...1_1validate__sample_1_1result-members.html | 113 + ...n_1_1gm_1_1validate__sample_1_1result.html | 146 + ...__transformed__params__visgen-members.html | 131 + ...validate__transformed__params__visgen.html | 614 + ...1validate__transformed__params__visgen.png | Bin 0 -> 919 bytes ..._1validate__var__decl__visgen-members.html | 135 + ..._1_1gm_1_1validate__var__decl__visgen.html | 736 + ...n_1_1gm_1_1validate__var__decl__visgen.png | Bin 0 -> 760 bytes ...structstan_1_1gm_1_1var__decl-members.html | 130 + .../html/structstan_1_1gm_1_1var__decl.html | 513 + ..._1_1gm_1_1var__decls__grammar-members.html | 138 + ...ructstan_1_1gm_1_1var__decls__grammar.html | 677 + ...tructstan_1_1gm_1_1var__decls__grammar.png | Bin 0 -> 1786 bytes ..._1gm_1_1var__resizing__visgen-members.html | 129 + ...ctstan_1_1gm_1_1var__resizing__visgen.html | 539 + ...uctstan_1_1gm_1_1var__resizing__visgen.png | Bin 0 -> 712 bytes ...var__size__validating__visgen-members.html | 130 + ..._1gm_1_1var__size__validating__visgen.html | 570 + ...1_1gm_1_1var__size__validating__visgen.png | Bin 0 -> 777 bytes .../structstan_1_1gm_1_1variable-members.html | 117 + .../html/structstan_1_1gm_1_1variable.html | 233 + ...tstan_1_1gm_1_1variable__dims-members.html | 116 + .../structstan_1_1gm_1_1variable__dims.html | 212 + ...ctstan_1_1gm_1_1variable__map-members.html | 121 + .../structstan_1_1gm_1_1variable__map.html | 325 + ...an_1_1gm_1_1vector__var__decl-members.html | 122 + ...structstan_1_1gm_1_1vector__var__decl.html | 247 + .../structstan_1_1gm_1_1vector__var__decl.png | Bin 0 -> 691 bytes .../structstan_1_1gm_1_1visgen-members.html | 115 + doc/api/html/structstan_1_1gm_1_1visgen.html | 231 + doc/api/html/structstan_1_1gm_1_1visgen.png | Bin 0 -> 15238 bytes ...tan_1_1gm_1_1while__statement-members.html | 116 + .../structstan_1_1gm_1_1while__statement.html | 212 + ..._1_1gm_1_1whitespace__grammar-members.html | 114 + ...ructstan_1_1gm_1_1whitespace__grammar.html | 181 + ...tructstan_1_1gm_1_1whitespace__grammar.png | Bin 0 -> 873 bytes ...1_1write__array__vars__visgen-members.html | 130 + ...n_1_1gm_1_1write__array__vars__visgen.html | 583 + ...an_1_1gm_1_1write__array__vars__visgen.png | Bin 0 -> 754 bytes ...1_1gm_1_1write__array__visgen-members.html | 131 + ...uctstan_1_1gm_1_1write__array__visgen.html | 648 + ...ructstan_1_1gm_1_1write__array__visgen.png | Bin 0 -> 710 bytes ...1_1write__csv__header__visgen-members.html | 130 + ...n_1_1gm_1_1write__csv__header__visgen.html | 583 + ...an_1_1gm_1_1write__csv__header__visgen.png | Bin 0 -> 763 bytes ...m_1_1write__csv__vars__visgen-members.html | 130 + ...tan_1_1gm_1_1write__csv__vars__visgen.html | 577 + ...stan_1_1gm_1_1write__csv__vars__visgen.png | Bin 0 -> 732 bytes ...n_1_1gm_1_1write__csv__visgen-members.html | 131 + ...tructstan_1_1gm_1_1write__csv__visgen.html | 648 + ...structstan_1_1gm_1_1write__csv__visgen.png | Bin 0 -> 679 bytes ..._1_1gm_1_1write__dims__visgen-members.html | 130 + ...ructstan_1_1gm_1_1write__dims__visgen.html | 577 + ...tructstan_1_1gm_1_1write__dims__visgen.png | Bin 0 -> 689 bytes ..._1write__param__names__visgen-members.html | 130 + ..._1_1gm_1_1write__param__names__visgen.html | 567 + ...n_1_1gm_1_1write__param__names__visgen.png | Bin 0 -> 775 bytes ...structstan_1_1io_1_1stan__csv-members.html | 117 + .../html/structstan_1_1io_1_1stan__csv.html | 206 + ..._1io_1_1stan__csv__adaptation-members.html | 115 + ...ctstan_1_1io_1_1stan__csv__adaptation.html | 189 + ..._1_1io_1_1stan__csv__metadata-members.html | 129 + ...ructstan_1_1io_1_1stan__csv__metadata.html | 413 + ...an_1_1io_1_1stan__csv__timing-members.html | 115 + ...structstan_1_1io_1_1stan__csv__timing.html | 189 + .../structstan_1_1is__constant-members.html | 113 + doc/api/html/structstan_1_1is__constant.html | 168 + ...tstan_1_1is__constant__struct-members.html | 113 + .../structstan_1_1is__constant__struct.html | 157 + ...en_1_1_block_3_01_t_01_4_01_4-members.html | 113 + ...3_01_eigen_1_1_block_3_01_t_01_4_01_4.html | 153 + ...1_t_00_01_r_00_01_c_01_4_01_4-members.html | 113 + ...trix_3_01_t_00_01_r_00_01_c_01_4_01_4.html | 153 + ...td_1_1vector_3_01_t_01_4_01_4-members.html | 113 + ...ct_3_01std_1_1vector_3_01_t_01_4_01_4.html | 153 + .../html/structstan_1_1is__fvar-members.html | 113 + doc/api/html/structstan_1_1is__fvar.html | 153 + ...grad_1_1fvar_3_01_t_01_4_01_4-members.html | 113 + ...tan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html | 153 + .../html/structstan_1_1is__var-members.html | 113 + doc/api/html/structstan_1_1is__var.html | 153 + ...3_01stan_1_1agrad_1_1var_01_4-members.html | 113 + ...is__var_3_01stan_1_1agrad_1_1var_01_4.html | 151 + ...an_1_1is__var__or__arithmetic-members.html | 113 + ...structstan_1_1is__var__or__arithmetic.html | 153 + .../structstan_1_1is__vector-members.html | 114 + doc/api/html/structstan_1_1is__vector.html | 172 + ...1_eigen_1_1_dynamic_01_4_01_4-members.html | 114 + ...011_00_01_eigen_1_1_dynamic_01_4_01_4.html | 172 + ..._1_1_dynamic_00_011_01_4_01_4-members.html | 114 + ...01_eigen_1_1_dynamic_00_011_01_4_01_4.html | 172 + ...s__vector_3_01const_01_t_01_4-members.html | 114 + ...tan_1_1is__vector_3_01const_01_t_01_4.html | 172 + ...td_1_1vector_3_01_t_01_4_01_4-members.html | 114 + ...or_3_01std_1_1vector_3_01_t_01_4_01_4.html | 172 + ...tructstan_1_1is__vector__like-members.html | 113 + .../html/structstan_1_1is__vector__like.html | 153 + ...1_eigen_1_1_dynamic_01_4_01_4-members.html | 113 + ...mic_00_01_eigen_1_1_dynamic_01_4_01_4.html | 153 + ...vector__like_3_01_t_01_5_01_4-members.html | 113 + ..._1_1is__vector__like_3_01_t_01_5_01_4.html | 153 + ...tor__like_3_01const_01_t_01_4-members.html | 113 + ...1is__vector__like_3_01const_01_t_01_4.html | 153 + ...tan_1_1math_1_1array__builder-members.html | 116 + .../structstan_1_1math_1_1array__builder.html | 247 + ...tstan_1_1math_1_1common__type-members.html | 113 + .../structstan_1_1math_1_1common__type.html | 148 + ..._eige106a86f1021708b40db478c4e2fef0a7.html | 113 + ..._eiged8accfa00e73f240c58ad02ac582ba93.html | 148 + ...d_1_1vector_3_01_t2_01_4_01_4-members.html | 113 + ..._00_01std_1_1vector_3_01_t2_01_4_01_4.html | 147 + ...uctstan_1_1math_1_1pass__type-members.html | 113 + .../structstan_1_1math_1_1pass__type.html | 146 + ...1_1pass__type_3_01double_01_4-members.html | 113 + ...1_1math_1_1pass__type_3_01double_01_4.html | 144 + ...th_1_1pass__type_3_01int_01_4-members.html | 113 + ...an_1_1math_1_1pass__type_3_01int_01_4.html | 144 + ...tructstan_1_1math_1_1promoter-members.html | 114 + .../html/structstan_1_1math_1_1promoter.html | 198 + ...n_1_142b48fda94601374e41a81325f3f7b84.html | 198 + ...n_1_19fcbf4e7bc8e106173bfa338a15054ff.html | 114 + ...n_1_12d7fadf0560f1f2f3abc5388b7666f9c.html | 198 + ...n_1_1ab38afe2feaa91a91579e3639d1f03b0.html | 114 + ...1promoter_3_01_t_00_01_t_01_4-members.html | 114 + ...1math_1_1promoter_3_01_t_00_01_t_01_4.html | 198 + ...td_1_1vector_3_01_t_01_4_01_4-members.html | 114 + ...4_00_01std_1_1vector_3_01_t_01_4_01_4.html | 198 + ...td_1_1vector_3_01_t_01_4_01_4-members.html | 114 + ...4_00_01std_1_1vector_3_01_t_01_4_01_4.html | 198 + ...ctstan_1_1math_1_1store__type-members.html | 113 + .../structstan_1_1math_1_1store__type.html | 146 + ..._1store__type_3_01double_01_4-members.html | 113 + ..._1math_1_1store__type_3_01double_01_4.html | 144 + ...h_1_1store__type_3_01int_01_4-members.html | 113 + ...n_1_1math_1_1store__type_3_01int_01_4.html | 144 + ...uctstan_1_1mcmc_1_1nuts__util-members.html | 118 + .../structstan_1_1mcmc_1_1nuts__util.html | 221 + ...minimizer_1_1_b_f_g_s_options-members.html | 122 + ...b_f_g_s_minimizer_1_1_b_f_g_s_options.html | 324 + ...n_1_1prob_1_1include__summand-members.html | 113 + ...tructstan_1_1prob_1_1include__summand.html | 169 + .../structstan_1_1return__type-members.html | 113 + doc/api/html/structstan_1_1return__type.html | 160 + .../structstan_1_1scalar__type-members.html | 113 + doc/api/html/structstan_1_1scalar__type.html | 159 + ...1_eigen_1_1_dynamic_01_4_01_4-members.html | 113 + ...mic_00_01_eigen_1_1_dynamic_01_4_01_4.html | 146 + ...scalar__type_3_01_t_01_5_01_4-members.html | 113 + ...stan_1_1scalar__type_3_01_t_01_5_01_4.html | 146 + ...tructstan_1_1size__of__helper-members.html | 113 + .../html/structstan_1_1size__of__helper.html | 158 + ..._helper_3_01_t_00_01true_01_4-members.html | 113 + ...ize__of__helper_3_01_t_00_01true_01_4.html | 158 + doc/api/html/structstatement__grammar.html | 116 + ...grad_1_1fvar_3_01_t_01_4_01_4-members.html | 142 + ...tan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html | 943 + ...3_01stan_1_1agrad_1_1var_01_4-members.html | 142 + ..._limits_3_01stan_1_1agrad_1_1var_01_4.html | 882 + doc/api/html/structterm__grammar.html | 116 + doc/api/html/student__t_8hpp.html | 160 + doc/api/html/student__t_8hpp_source.html | 865 + doc/api/html/sub_8hpp.html | 129 + doc/api/html/sub_8hpp_source.html | 127 + doc/api/html/sub__col_8hpp.html | 133 + doc/api/html/sub__col_8hpp_source.html | 133 + doc/api/html/sub__row_8hpp.html | 133 + doc/api/html/sub__row_8hpp_source.html | 133 + doc/api/html/subtract_8hpp.html | 144 + doc/api/html/subtract_8hpp_source.html | 157 + doc/api/html/sync_off.png | Bin 0 -> 853 bytes doc/api/html/sync_on.png | Bin 0 -> 845 bytes doc/api/html/tab_a.png | Bin 0 -> 142 bytes doc/api/html/tab_b.png | Bin 0 -> 170 bytes doc/api/html/tab_h.png | Bin 0 -> 177 bytes doc/api/html/tab_s.png | Bin 0 -> 184 bytes doc/api/html/tabs.css | 60 + doc/api/html/tail_8hpp.html | 143 + doc/api/html/tail_8hpp_source.html | 156 + doc/api/html/term__grammar_8hpp.html | 138 + doc/api/html/term__grammar_8hpp_source.html | 219 + doc/api/html/term__grammar__def_8hpp.html | 378 + .../html/term__grammar__def_8hpp_source.html | 672 + doc/api/html/term__grammar__inst_8cpp.html | 123 + .../html/term__grammar__inst_8cpp_source.html | 115 + doc/api/html/to__fvar_8hpp.html | 170 + doc/api/html/to__fvar_8hpp_source.html | 252 + doc/api/html/to__var_8hpp.html | 154 + doc/api/html/to__var_8hpp_source.html | 157 + doc/api/html/to__vector_8hpp.html | 130 + doc/api/html/to__vector_8hpp_source.html | 125 + doc/api/html/trace_8hpp.html | 130 + doc/api/html/trace_8hpp_source.html | 123 + doc/api/html/transform_8hpp.html | 403 + doc/api/html/transform_8hpp_source.html | 1073 + doc/api/html/transpose_8hpp.html | 129 + doc/api/html/transpose_8hpp_source.html | 125 + doc/api/html/trigamma_8hpp.html | 129 + doc/api/html/trigamma_8hpp_source.html | 182 + doc/api/html/uniform_8hpp.html | 158 + doc/api/html/uniform_8hpp_source.html | 473 + doc/api/html/unit__e__metric_8hpp.html | 131 + doc/api/html/unit__e__metric_8hpp_source.html | 167 + doc/api/html/unit__e__nuts_8hpp.html | 131 + doc/api/html/unit__e__nuts_8hpp_source.html | 149 + doc/api/html/unit__e__point_8hpp.html | 128 + doc/api/html/unit__e__point_8hpp_source.html | 132 + doc/api/html/unit__e__static__hmc_8hpp.html | 131 + .../unit__e__static__hmc_8hpp_source.html | 144 + doc/api/html/univariate_2continuous_8hpp.html | 130 + .../univariate_2continuous_8hpp_source.html | 134 + doc/api/html/univariate_2discrete_8hpp.html | 116 + .../univariate_2discrete_8hpp_source.html | 119 + doc/api/html/univariate_8hpp.html | 111 + doc/api/html/univariate_8hpp_source.html | 114 + doc/api/html/unvalued__argument_8hpp.html | 130 + .../html/unvalued__argument_8hpp_source.html | 167 + doc/api/html/v__vari_8hpp.html | 128 + doc/api/html/v__vari_8hpp_source.html | 128 + .../html/validate__column__index_8hpp.html | 131 + .../validate__column__index_8hpp_source.html | 132 + doc/api/html/validate__greater_8hpp.html | 130 + .../html/validate__greater_8hpp_source.html | 133 + .../validate__greater__or__equal_8hpp.html | 130 + ...idate__greater__or__equal_8hpp_source.html | 133 + doc/api/html/validate__less_8hpp.html | 130 + doc/api/html/validate__less_8hpp_source.html | 133 + .../html/validate__less__or__equal_8hpp.html | 130 + ...validate__less__or__equal_8hpp_source.html | 133 + .../html/validate__matching__dims_8hpp.html | 131 + .../validate__matching__dims_8hpp_source.html | 134 + .../html/validate__matching__sizes_8hpp.html | 144 + ...validate__matching__sizes_8hpp_source.html | 194 + .../html/validate__multiplicable_8hpp.html | 131 + .../validate__multiplicable_8hpp_source.html | 134 + .../validate__non__negative__index_8hpp.html | 129 + ...ate__non__negative__index_8hpp_source.html | 134 + .../validate__non__negative__rep_8hpp.html | 131 + ...idate__non__negative__rep_8hpp_source.html | 131 + .../html/validate__nonzero__size_8hpp.html | 130 + .../validate__nonzero__size_8hpp_source.html | 128 + doc/api/html/validate__row__index_8hpp.html | 132 + .../validate__row__index_8hpp_source.html | 133 + doc/api/html/validate__square_8hpp.html | 131 + .../html/validate__square_8hpp_source.html | 132 + .../validate__std__vector__index_8hpp.html | 131 + ...idate__std__vector__index_8hpp_source.html | 133 + doc/api/html/validate__symmetric_8hpp.html | 132 + .../html/validate__symmetric_8hpp_source.html | 140 + doc/api/html/validate__vector_8hpp.html | 131 + .../html/validate__vector_8hpp_source.html | 131 + doc/api/html/valued__argument_8hpp.html | 128 + .../html/valued__argument_8hpp_source.html | 161 + doc/api/html/var_8hpp.html | 139 + doc/api/html/var_8hpp_source.html | 253 + doc/api/html/var__adaptation_8hpp.html | 131 + doc/api/html/var__adaptation_8hpp_source.html | 163 + doc/api/html/var__context_8hpp.html | 132 + doc/api/html/var__context_8hpp_source.html | 294 + doc/api/html/var__decls__grammar_8hpp.html | 134 + .../html/var__decls__grammar_8hpp_source.html | 259 + .../html/var__decls__grammar__def_8hpp.html | 161 + .../var__decls__grammar__def_8hpp_source.html | 1017 + .../html/var__decls__grammar__inst_8cpp.html | 123 + ...var__decls__grammar__inst_8cpp_source.html | 115 + doc/api/html/var__stack_8cpp.html | 155 + doc/api/html/var__stack_8cpp_source.html | 126 + doc/api/html/var__stack_8hpp.html | 140 + doc/api/html/var__stack_8hpp_source.html | 151 + doc/api/html/vari_8hpp.html | 131 + doc/api/html/vari_8hpp_source.html | 166 + doc/api/html/vd__vari_8hpp.html | 128 + doc/api/html/vd__vari_8hpp_source.html | 130 + doc/api/html/vdd__vari_8hpp.html | 128 + doc/api/html/vdd__vari_8hpp_source.html | 132 + doc/api/html/vdv__vari_8hpp.html | 128 + doc/api/html/vdv__vari_8hpp_source.html | 132 + doc/api/html/vector__vari_8hpp.html | 130 + doc/api/html/vector__vari_8hpp_source.html | 140 + doc/api/html/version_8hpp.html | 132 + doc/api/html/version_8hpp_source.html | 123 + doc/api/html/von__mises_8hpp.html | 139 + doc/api/html/von__mises_8hpp_source.html | 232 + doc/api/html/vv__vari_8hpp.html | 128 + doc/api/html/vv__vari_8hpp_source.html | 130 + doc/api/html/vvd__vari_8hpp.html | 128 + doc/api/html/vvd__vari_8hpp_source.html | 132 + doc/api/html/vvv__vari_8hpp.html | 128 + doc/api/html/vvv__vari_8hpp_source.html | 132 + doc/api/html/weibull_8hpp.html | 157 + doc/api/html/weibull_8hpp_source.html | 474 + .../html/welford__covar__estimator_8hpp.html | 129 + ...welford__covar__estimator_8hpp_source.html | 165 + .../html/welford__var__estimator_8hpp.html | 129 + .../welford__var__estimator_8hpp_source.html | 165 + doc/api/html/whitespace__grammar_8hpp.html | 128 + .../html/whitespace__grammar_8hpp_source.html | 133 + .../html/whitespace__grammar__def_8hpp.html | 123 + .../whitespace__grammar__def_8hpp_source.html | 142 + .../html/whitespace__grammar__inst_8cpp.html | 123 + ...whitespace__grammar__inst_8cpp_source.html | 115 + doc/api/html/windowed__adaptation_8hpp.html | 130 + .../windowed__adaptation_8hpp_source.html | 234 + doc/api/html/wishart_8hpp.html | 153 + doc/api/html/wishart_8hpp_source.html | 256 + doc/api/html/writer_8hpp.html | 130 + doc/api/html/writer_8hpp_source.html | 332 + doc/stan-reference-2.1.0.pdf | Bin 0 -> 1319059 bytes 3046 files changed, 509082 insertions(+) create mode 100644 doc/api/html/_eigen_8dox.html create mode 100644 doc/api/html/_eigen_8hpp.html create mode 100644 doc/api/html/_eigen_8hpp_source.html create mode 100644 doc/api/html/_eigen___num_traits_8hpp.html create mode 100644 doc/api/html/_eigen___num_traits_8hpp_source.html create mode 100644 doc/api/html/accumulator_8hpp.html create mode 100644 doc/api/html/accumulator_8hpp_source.html create mode 100644 doc/api/html/adapt__dense__e__nuts_8hpp.html create mode 100644 doc/api/html/adapt__dense__e__nuts_8hpp_source.html create mode 100644 doc/api/html/adapt__dense__e__static__hmc_8hpp.html create mode 100644 doc/api/html/adapt__dense__e__static__hmc_8hpp_source.html create mode 100644 doc/api/html/adapt__diag__e__nuts_8hpp.html create mode 100644 doc/api/html/adapt__diag__e__nuts_8hpp_source.html create mode 100644 doc/api/html/adapt__diag__e__static__hmc_8hpp.html create mode 100644 doc/api/html/adapt__diag__e__static__hmc_8hpp_source.html create mode 100644 doc/api/html/adapt__unit__e__nuts_8hpp.html create mode 100644 doc/api/html/adapt__unit__e__nuts_8hpp_source.html create mode 100644 doc/api/html/adapt__unit__e__static__hmc_8hpp.html create mode 100644 doc/api/html/adapt__unit__e__static__hmc_8hpp_source.html create mode 100644 doc/api/html/add_8hpp.html create mode 100644 doc/api/html/add_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2_phi_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2_phi_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2abs_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2abs_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2bessel__first__kind_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2bessel__first__kind_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2bessel__second__kind_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2bessel__second__kind_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2binary__log__loss_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2binary__log__loss_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2binomial__coefficient__log_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2binomial__coefficient__log_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2digamma_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2digamma_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2exp2_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2exp2_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2exp_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2exp_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2falling__factorial_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2falling__factorial_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2fdim_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2fdim_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2fma_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2fma_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2gamma__p_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2gamma__p_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2gamma__q_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2gamma__q_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2inv_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2inv_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2inv__cloglog_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2inv__cloglog_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2inv__logit_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2inv__logit_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2inv__sqrt_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2inv__sqrt_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2inv__square_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2inv__square_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2lbeta_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2lbeta_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2lgamma_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2lgamma_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2lmgamma_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2lmgamma_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2log1m_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2log1m_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2log1m__exp_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2log1m__exp_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2log1m__inv__logit_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2log1m__inv__logit_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2log1p_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2log1p_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2log1p__exp_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2log1p__exp_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2log2_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2log2_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2log_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2log_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2log__diff__exp_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2log__diff__exp_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2log__falling__factorial_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2log__falling__factorial_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2log__inv__logit_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2log__inv__logit_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2log__rising__factorial_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2log__rising__factorial_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2log__sum__exp_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2log__sum__exp_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2logit_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2logit_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2modified__bessel__first__kind_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2modified__bessel__first__kind_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2modified__bessel__second__kind_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2modified__bessel__second__kind_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2multiply__log_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2multiply__log_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2owens__t_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2owens__t_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2rising__factorial_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2rising__factorial_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2square_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_2square_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2functions_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2functions_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2columns__dot__product_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2columns__dot__product_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2columns__dot__self_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2columns__dot__self_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2crossprod_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2crossprod_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2determinant_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2determinant_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2divide_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2divide_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2dot__product_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2dot__product_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2dot__self_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2dot__self_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2inverse_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2inverse_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2log__determinant_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2log__determinant_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2log__softmax_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2log__softmax_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2log__sum__exp_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2log__sum__exp_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2mdivide__left_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2mdivide__left_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2mdivide__left__tri__low_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2mdivide__left__tri__low_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2mdivide__right_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2mdivide__right_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2mdivide__right__tri__low_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2mdivide__right__tri__low_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2multiply_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2multiply_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2multiply__lower__tri__self__transpose_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2multiply__lower__tri__self__transpose_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2rows__dot__product_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2rows__dot__product_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2rows__dot__self_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2rows__dot__self_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2softmax_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2softmax_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2sort_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2sort_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2sum_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2sum_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2tcrossprod_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2tcrossprod_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2typedefs_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_2typedefs_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2matrix_8hpp_source.html create mode 100644 doc/api/html/agrad_2fwd_2prob_2univariate_2continuous_2normal_8hpp.html create mode 100644 doc/api/html/agrad_2fwd_2prob_2univariate_2continuous_2normal_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2error__handling_2matrix_2check__pos__definite_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2error__handling_2matrix_2check__pos__definite_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2error__handling_2matrix_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2error__handling_2matrix_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2error__handling_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2error__handling_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2_phi_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2_phi_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2_phi__approx_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2_phi__approx_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2abs_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2abs_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2as__bool_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2as__bool_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2bessel__first__kind_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2bessel__first__kind_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2bessel__second__kind_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2bessel__second__kind_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2binary__log__loss_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2binary__log__loss_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2digamma_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2digamma_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2exp2_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2exp2_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2exp_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2exp_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2falling__factorial_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2falling__factorial_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2fdim_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2fdim_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2fma_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2fma_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2gamma__p_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2gamma__p_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2gamma__q_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2gamma__q_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2ibeta_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2ibeta_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2if__else_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2if__else_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2inv_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2inv_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2inv__cloglog_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2inv__cloglog_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2inv__logit_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2inv__logit_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2inv__sqrt_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2inv__sqrt_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2inv__square_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2inv__square_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2is__uninitialized_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2is__uninitialized_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2lgamma_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2lgamma_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2lmgamma_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2lmgamma_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2log1m_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2log1m_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2log1m__exp_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2log1m__exp_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2log1p_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2log1p_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2log1p__exp_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2log1p__exp_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2log2_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2log2_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2log_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2log_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2log__diff__exp_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2log__diff__exp_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2log__falling__factorial_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2log__falling__factorial_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2log__rising__factorial_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2log__rising__factorial_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2log__sum__exp_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2log__sum__exp_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2modified__bessel__first__kind_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2modified__bessel__first__kind_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2modified__bessel__second__kind_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2modified__bessel__second__kind_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2multiply__log_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2multiply__log_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2owens__t_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2owens__t_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2rising__factorial_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2rising__factorial_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2square_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2square_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2step_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2step_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_2value__of_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_2value__of_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2functions_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2functions_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2crossprod_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2crossprod_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2determinant_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2determinant_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2divide_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2divide_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2dot__product_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2dot__product_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2dot__self_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2dot__self_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2ldlt_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2ldlt_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2log__determinant_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2log__determinant_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2log__determinant__spd_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2log__determinant__spd_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2log__softmax_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2log__softmax_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2log__sum__exp_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2log__sum__exp_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2mdivide__left_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2mdivide__left_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2mdivide__left__spd_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2mdivide__left__spd_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2mdivide__left__tri_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2mdivide__left__tri_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2multiply_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2multiply_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2multiply__lower__tri__self__transpose_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2multiply__lower__tri__self__transpose_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2quad__form_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2quad__form_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2sd_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2sd_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2softmax_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2softmax_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2sort_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2sort_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2squared__dist_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2squared__dist_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2stan__print_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2stan__print_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2sum_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2sum_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2tcrossprod_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2tcrossprod_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2trace__gen__quad__form_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2trace__gen__quad__form_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2trace__quad__form_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2trace__quad__form_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2typedefs_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2typedefs_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2value__of_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2value__of_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2variance_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2matrix_2variance_8hpp_source.html create mode 100644 doc/api/html/agrad_2rev_2matrix_8hpp.html create mode 100644 doc/api/html/agrad_2rev_2matrix_8hpp_source.html create mode 100644 doc/api/html/agrad_8hpp.html create mode 100644 doc/api/html/agrad_8hpp_source.html create mode 100644 doc/api/html/agrad__thread__safe_8hpp.html create mode 100644 doc/api/html/agrad__thread__safe_8hpp_source.html create mode 100644 doc/api/html/annotated.html create mode 100644 doc/api/html/arg__adapt_8hpp.html create mode 100644 doc/api/html/arg__adapt_8hpp_source.html create mode 100644 doc/api/html/arg__adapt__delta_8hpp.html create mode 100644 doc/api/html/arg__adapt__delta_8hpp_source.html create mode 100644 doc/api/html/arg__adapt__engaged_8hpp.html create mode 100644 doc/api/html/arg__adapt__engaged_8hpp_source.html create mode 100644 doc/api/html/arg__adapt__gamma_8hpp.html create mode 100644 doc/api/html/arg__adapt__gamma_8hpp_source.html create mode 100644 doc/api/html/arg__adapt__init__buffer_8hpp.html create mode 100644 doc/api/html/arg__adapt__init__buffer_8hpp_source.html create mode 100644 doc/api/html/arg__adapt__kappa_8hpp.html create mode 100644 doc/api/html/arg__adapt__kappa_8hpp_source.html create mode 100644 doc/api/html/arg__adapt__t0_8hpp.html create mode 100644 doc/api/html/arg__adapt__t0_8hpp_source.html create mode 100644 doc/api/html/arg__adapt__term__buffer_8hpp.html create mode 100644 doc/api/html/arg__adapt__term__buffer_8hpp_source.html create mode 100644 doc/api/html/arg__adapt__window_8hpp.html create mode 100644 doc/api/html/arg__adapt__window_8hpp_source.html create mode 100644 doc/api/html/arg__bfgs_8hpp.html create mode 100644 doc/api/html/arg__bfgs_8hpp_source.html create mode 100644 doc/api/html/arg__data_8hpp.html create mode 100644 doc/api/html/arg__data_8hpp_source.html create mode 100644 doc/api/html/arg__data__file_8hpp.html create mode 100644 doc/api/html/arg__data__file_8hpp_source.html create mode 100644 doc/api/html/arg__dense__e_8hpp.html create mode 100644 doc/api/html/arg__dense__e_8hpp_source.html create mode 100644 doc/api/html/arg__diag__e_8hpp.html create mode 100644 doc/api/html/arg__diag__e_8hpp_source.html create mode 100644 doc/api/html/arg__diagnose_8hpp.html create mode 100644 doc/api/html/arg__diagnose_8hpp_source.html create mode 100644 doc/api/html/arg__diagnostic__file_8hpp.html create mode 100644 doc/api/html/arg__diagnostic__file_8hpp_source.html create mode 100644 doc/api/html/arg__engine_8hpp.html create mode 100644 doc/api/html/arg__engine_8hpp_source.html create mode 100644 doc/api/html/arg__fail_8hpp.html create mode 100644 doc/api/html/arg__fail_8hpp_source.html create mode 100644 doc/api/html/arg__hmc_8hpp.html create mode 100644 doc/api/html/arg__hmc_8hpp_source.html create mode 100644 doc/api/html/arg__id_8hpp.html create mode 100644 doc/api/html/arg__id_8hpp_source.html create mode 100644 doc/api/html/arg__init_8hpp.html create mode 100644 doc/api/html/arg__init_8hpp_source.html create mode 100644 doc/api/html/arg__init__alpha_8hpp.html create mode 100644 doc/api/html/arg__init__alpha_8hpp_source.html create mode 100644 doc/api/html/arg__int__time_8hpp.html create mode 100644 doc/api/html/arg__int__time_8hpp_source.html create mode 100644 doc/api/html/arg__iter_8hpp.html create mode 100644 doc/api/html/arg__iter_8hpp_source.html create mode 100644 doc/api/html/arg__max__depth_8hpp.html create mode 100644 doc/api/html/arg__max__depth_8hpp_source.html create mode 100644 doc/api/html/arg__method_8hpp.html create mode 100644 doc/api/html/arg__method_8hpp_source.html create mode 100644 doc/api/html/arg__metric_8hpp.html create mode 100644 doc/api/html/arg__metric_8hpp_source.html create mode 100644 doc/api/html/arg__nesterov_8hpp.html create mode 100644 doc/api/html/arg__nesterov_8hpp_source.html create mode 100644 doc/api/html/arg__newton_8hpp.html create mode 100644 doc/api/html/arg__newton_8hpp_source.html create mode 100644 doc/api/html/arg__num__samples_8hpp.html create mode 100644 doc/api/html/arg__num__samples_8hpp_source.html create mode 100644 doc/api/html/arg__num__warmup_8hpp.html create mode 100644 doc/api/html/arg__num__warmup_8hpp_source.html create mode 100644 doc/api/html/arg__nuts_8hpp.html create mode 100644 doc/api/html/arg__nuts_8hpp_source.html create mode 100644 doc/api/html/arg__optimize_8hpp.html create mode 100644 doc/api/html/arg__optimize_8hpp_source.html create mode 100644 doc/api/html/arg__optimize__algo_8hpp.html create mode 100644 doc/api/html/arg__optimize__algo_8hpp_source.html create mode 100644 doc/api/html/arg__output_8hpp.html create mode 100644 doc/api/html/arg__output_8hpp_source.html create mode 100644 doc/api/html/arg__output__file_8hpp.html create mode 100644 doc/api/html/arg__output__file_8hpp_source.html create mode 100644 doc/api/html/arg__random_8hpp.html create mode 100644 doc/api/html/arg__random_8hpp_source.html create mode 100644 doc/api/html/arg__refresh_8hpp.html create mode 100644 doc/api/html/arg__refresh_8hpp_source.html create mode 100644 doc/api/html/arg__rwm_8hpp.html create mode 100644 doc/api/html/arg__rwm_8hpp_source.html create mode 100644 doc/api/html/arg__sample_8hpp.html create mode 100644 doc/api/html/arg__sample_8hpp_source.html create mode 100644 doc/api/html/arg__sample__algo_8hpp.html create mode 100644 doc/api/html/arg__sample__algo_8hpp_source.html create mode 100644 doc/api/html/arg__save__iterations_8hpp.html create mode 100644 doc/api/html/arg__save__iterations_8hpp_source.html create mode 100644 doc/api/html/arg__save__warmup_8hpp.html create mode 100644 doc/api/html/arg__save__warmup_8hpp_source.html create mode 100644 doc/api/html/arg__seed_8hpp.html create mode 100644 doc/api/html/arg__seed_8hpp_source.html create mode 100644 doc/api/html/arg__static_8hpp.html create mode 100644 doc/api/html/arg__static_8hpp_source.html create mode 100644 doc/api/html/arg__stepsize_8hpp.html create mode 100644 doc/api/html/arg__stepsize_8hpp_source.html create mode 100644 doc/api/html/arg__stepsize__jitter_8hpp.html create mode 100644 doc/api/html/arg__stepsize__jitter_8hpp_source.html create mode 100644 doc/api/html/arg__test_8hpp.html create mode 100644 doc/api/html/arg__test_8hpp_source.html create mode 100644 doc/api/html/arg__test__grad__eps_8hpp.html create mode 100644 doc/api/html/arg__test__grad__eps_8hpp_source.html create mode 100644 doc/api/html/arg__test__grad__err_8hpp.html create mode 100644 doc/api/html/arg__test__grad__err_8hpp_source.html create mode 100644 doc/api/html/arg__test__gradient_8hpp.html create mode 100644 doc/api/html/arg__test__gradient_8hpp_source.html create mode 100644 doc/api/html/arg__thin_8hpp.html create mode 100644 doc/api/html/arg__thin_8hpp_source.html create mode 100644 doc/api/html/arg__tolerance_8hpp.html create mode 100644 doc/api/html/arg__tolerance_8hpp_source.html create mode 100644 doc/api/html/arg__unit__e_8hpp.html create mode 100644 doc/api/html/arg__unit__e_8hpp_source.html create mode 100644 doc/api/html/argument_8hpp.html create mode 100644 doc/api/html/argument_8hpp_source.html create mode 100644 doc/api/html/argument__parser_8hpp.html create mode 100644 doc/api/html/argument__parser_8hpp_source.html create mode 100644 doc/api/html/argument__probe_8hpp.html create mode 100644 doc/api/html/argument__probe_8hpp_source.html create mode 100644 doc/api/html/array__builder_8hpp.html create mode 100644 doc/api/html/array__builder_8hpp_source.html create mode 100644 doc/api/html/assign_8hpp.html create mode 100644 doc/api/html/assign_8hpp_source.html create mode 100644 doc/api/html/ast_8hpp.html create mode 100644 doc/api/html/ast_8hpp_source.html create mode 100644 doc/api/html/ast__def_8cpp.html create mode 100644 doc/api/html/ast__def_8cpp_source.html create mode 100644 doc/api/html/autocorrelation_8hpp.html create mode 100644 doc/api/html/autocorrelation_8hpp_source.html create mode 100644 doc/api/html/autocovariance_8hpp.html create mode 100644 doc/api/html/autocovariance_8hpp_source.html create mode 100644 doc/api/html/autodiff_8hpp.html create mode 100644 doc/api/html/autodiff_8hpp_source.html create mode 100644 doc/api/html/base__adaptation_8hpp.html create mode 100644 doc/api/html/base__adaptation_8hpp_source.html create mode 100644 doc/api/html/base__adapter_8hpp.html create mode 100644 doc/api/html/base__adapter_8hpp_source.html create mode 100644 doc/api/html/base__hamiltonian_8hpp.html create mode 100644 doc/api/html/base__hamiltonian_8hpp_source.html create mode 100644 doc/api/html/base__hmc_8hpp.html create mode 100644 doc/api/html/base__hmc_8hpp_source.html create mode 100644 doc/api/html/base__integrator_8hpp.html create mode 100644 doc/api/html/base__integrator_8hpp_source.html create mode 100644 doc/api/html/base__leapfrog_8hpp.html create mode 100644 doc/api/html/base__leapfrog_8hpp_source.html create mode 100644 doc/api/html/base__mcmc_8hpp.html create mode 100644 doc/api/html/base__mcmc_8hpp_source.html create mode 100644 doc/api/html/base__nuts_8hpp.html create mode 100644 doc/api/html/base__nuts_8hpp_source.html create mode 100644 doc/api/html/base__static__hmc_8hpp.html create mode 100644 doc/api/html/base__static__hmc_8hpp_source.html create mode 100644 doc/api/html/bc_s.png create mode 100644 doc/api/html/bdwn.png create mode 100644 doc/api/html/bernoulli_8hpp.html create mode 100644 doc/api/html/bernoulli_8hpp_source.html create mode 100644 doc/api/html/beta_8hpp.html create mode 100644 doc/api/html/beta_8hpp_source.html create mode 100644 doc/api/html/beta__binomial_8hpp.html create mode 100644 doc/api/html/beta__binomial_8hpp_source.html create mode 100644 doc/api/html/bfgs_8hpp.html create mode 100644 doc/api/html/bfgs_8hpp_source.html create mode 100644 doc/api/html/binomial_8hpp.html create mode 100644 doc/api/html/binomial_8hpp_source.html create mode 100644 doc/api/html/block_8hpp.html create mode 100644 doc/api/html/block_8hpp_source.html create mode 100644 doc/api/html/boost_8dox.html create mode 100644 doc/api/html/boost__fpclassify_8hpp.html create mode 100644 doc/api/html/boost__fpclassify_8hpp_source.html create mode 100644 doc/api/html/calculate__chain_8hpp.html create mode 100644 doc/api/html/calculate__chain_8hpp_source.html create mode 100644 doc/api/html/categorical_8hpp.html create mode 100644 doc/api/html/categorical_8hpp_source.html create mode 100644 doc/api/html/categorical__argument_8hpp.html create mode 100644 doc/api/html/categorical__argument_8hpp_source.html create mode 100644 doc/api/html/categorical__logit_8hpp.html create mode 100644 doc/api/html/categorical__logit_8hpp_source.html create mode 100644 doc/api/html/cauchy_8hpp.html create mode 100644 doc/api/html/cauchy_8hpp_source.html create mode 100644 doc/api/html/chainable_8hpp.html create mode 100644 doc/api/html/chainable_8hpp_source.html create mode 100644 doc/api/html/chains_8hpp.html create mode 100644 doc/api/html/chains_8hpp_source.html create mode 100644 doc/api/html/check__bounded_8hpp.html create mode 100644 doc/api/html/check__bounded_8hpp_source.html create mode 100644 doc/api/html/check__cholesky__factor_8hpp.html create mode 100644 doc/api/html/check__cholesky__factor_8hpp_source.html create mode 100644 doc/api/html/check__consistent__size_8hpp.html create mode 100644 doc/api/html/check__consistent__size_8hpp_source.html create mode 100644 doc/api/html/check__consistent__sizes_8hpp.html create mode 100644 doc/api/html/check__consistent__sizes_8hpp_source.html create mode 100644 doc/api/html/check__corr__matrix_8hpp.html create mode 100644 doc/api/html/check__corr__matrix_8hpp_source.html create mode 100644 doc/api/html/check__cov__matrix_8hpp.html create mode 100644 doc/api/html/check__cov__matrix_8hpp_source.html create mode 100644 doc/api/html/check__finite_8hpp.html create mode 100644 doc/api/html/check__finite_8hpp_source.html create mode 100644 doc/api/html/check__greater_8hpp.html create mode 100644 doc/api/html/check__greater_8hpp_source.html create mode 100644 doc/api/html/check__greater__or__equal_8hpp.html create mode 100644 doc/api/html/check__greater__or__equal_8hpp_source.html create mode 100644 doc/api/html/check__less_8hpp.html create mode 100644 doc/api/html/check__less_8hpp_source.html create mode 100644 doc/api/html/check__less__or__equal_8hpp.html create mode 100644 doc/api/html/check__less__or__equal_8hpp_source.html create mode 100644 doc/api/html/check__lower__triangular_8hpp.html create mode 100644 doc/api/html/check__lower__triangular_8hpp_source.html create mode 100644 doc/api/html/check__nonnegative_8hpp.html create mode 100644 doc/api/html/check__nonnegative_8hpp_source.html create mode 100644 doc/api/html/check__not__nan_8hpp.html create mode 100644 doc/api/html/check__not__nan_8hpp_source.html create mode 100644 doc/api/html/check__ordered_8hpp.html create mode 100644 doc/api/html/check__ordered_8hpp_source.html create mode 100644 doc/api/html/check__pos__semidefinite_8hpp.html create mode 100644 doc/api/html/check__pos__semidefinite_8hpp_source.html create mode 100644 doc/api/html/check__positive_8hpp.html create mode 100644 doc/api/html/check__positive_8hpp_source.html create mode 100644 doc/api/html/check__positive__ordered_8hpp.html create mode 100644 doc/api/html/check__positive__ordered_8hpp_source.html create mode 100644 doc/api/html/check__range_8hpp.html create mode 100644 doc/api/html/check__range_8hpp_source.html create mode 100644 doc/api/html/check__simplex_8hpp.html create mode 100644 doc/api/html/check__simplex_8hpp_source.html create mode 100644 doc/api/html/check__size__match_8hpp.html create mode 100644 doc/api/html/check__size__match_8hpp_source.html create mode 100644 doc/api/html/check__spsd__matrix_8hpp.html create mode 100644 doc/api/html/check__spsd__matrix_8hpp_source.html create mode 100644 doc/api/html/check__square_8hpp.html create mode 100644 doc/api/html/check__square_8hpp_source.html create mode 100644 doc/api/html/check__symmetric_8hpp.html create mode 100644 doc/api/html/check__symmetric_8hpp_source.html create mode 100644 doc/api/html/check__unit__vector_8hpp.html create mode 100644 doc/api/html/check__unit__vector_8hpp_source.html create mode 100644 doc/api/html/chi__square_8hpp.html create mode 100644 doc/api/html/chi__square_8hpp_source.html create mode 100644 doc/api/html/cholesky__decompose_8hpp.html create mode 100644 doc/api/html/cholesky__decompose_8hpp_source.html create mode 100644 doc/api/html/chunk__alloc_8hpp.html create mode 100644 doc/api/html/chunk__alloc_8hpp_source.html create mode 100644 doc/api/html/class_l_d_l_t__factor.html create mode 100644 doc/api/html/classes.html create mode 100644 doc/api/html/classstan_1_1_double_vector_view-members.html create mode 100644 doc/api/html/classstan_1_1_double_vector_view.html create mode 100644 doc/api/html/classstan_1_1_double_vector_view_3_01true_00_01false_01_4-members.html create mode 100644 doc/api/html/classstan_1_1_double_vector_view_3_01true_00_01false_01_4.html create mode 100644 doc/api/html/classstan_1_1_double_vector_view_3_01true_00_01true_01_4-members.html create mode 100644 doc/api/html/classstan_1_1_double_vector_view_3_01true_00_01true_01_4.html create mode 100644 doc/api/html/classstan_1_1_vector_view-members.html create mode 100644 doc/api/html/classstan_1_1_vector_view.html create mode 100644 doc/api/html/classstan_1_1_vector_view_3_01const_01_t_00_01is__array_00_01throw__if__accessed_01_4-members.html create mode 100644 doc/api/html/classstan_1_1_vector_view_3_01const_01_t_00_01is__array_00_01throw__if__accessed_01_4.html create mode 100644 doc/api/html/classstan_1_1_vector_view_3_01const_01double_00_01false_00_01false_01_4-members.html create mode 100644 doc/api/html/classstan_1_1_vector_view_3_01const_01double_00_01false_00_01false_01_4.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1chainable-members.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1chainable.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1chainable.png create mode 100644 doc/api/html/classstan_1_1agrad_1_1chainable__alloc-members.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1chainable__alloc.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__ddv__vari-members.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__ddv__vari.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__ddv__vari.png create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__dv__vari-members.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__dv__vari.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__dv__vari.png create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__dvd__vari-members.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__dvd__vari.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__dvd__vari.png create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__dvv__vari-members.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__dvv__vari.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__dvv__vari.png create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__matrix__vari-members.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__matrix__vari.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__matrix__vari.png create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__v__vari-members.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__v__vari.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__v__vari.png create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__vd__vari-members.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__vd__vari.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__vd__vari.png create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__vdd__vari-members.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__vdd__vari.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__vdd__vari.png create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__vdv__vari-members.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__vdv__vari.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__vdv__vari.png create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__vector__vari-members.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__vector__vari.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__vector__vari.png create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__vv__vari-members.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__vv__vari.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__vv__vari.png create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__vvd__vari-members.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__vvd__vari.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__vvd__vari.png create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__vvv__vari-members.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__vvv__vari.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1op__vvv__vari.png create mode 100644 doc/api/html/classstan_1_1agrad_1_1partials__vari-members.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1partials__vari.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1partials__vari.png create mode 100644 doc/api/html/classstan_1_1agrad_1_1precomp__v__vari-members.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1precomp__v__vari.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1stored__gradient__vari-members.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1stored__gradient__vari.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1stored__gradient__vari.png create mode 100644 doc/api/html/classstan_1_1agrad_1_1var-members.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1var.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1vari-members.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1vari.html create mode 100644 doc/api/html/classstan_1_1agrad_1_1vari.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__adapt-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__adapt.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__adapt.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__adapt__delta-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__adapt__delta.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__adapt__delta.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__adapt__engaged-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__adapt__engaged.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__adapt__engaged.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__adapt__gamma-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__adapt__gamma.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__adapt__gamma.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__adapt__init__buffer-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__adapt__init__buffer.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__adapt__init__buffer.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__adapt__kappa-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__adapt__kappa.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__adapt__kappa.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__adapt__t0-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__adapt__t0.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__adapt__t0.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__adapt__term__buffer-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__adapt__term__buffer.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__adapt__term__buffer.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__adapt__window-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__adapt__window.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__adapt__window.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__bfgs-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__bfgs.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__bfgs.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__data-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__data.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__data.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__data__file-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__data__file.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__data__file.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__dense__e-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__dense__e.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__dense__e.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__diag__e-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__diag__e.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__diag__e.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__diagnose-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__diagnose.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__diagnose.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__diagnostic__file-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__diagnostic__file.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__diagnostic__file.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__engine-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__engine.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__engine.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__fail-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__fail.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__fail.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__hmc-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__hmc.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__hmc.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__id-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__id.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__id.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__init-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__init.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__init.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__init__alpha-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__init__alpha.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__init__alpha.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__int__time-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__int__time.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__int__time.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__iter-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__iter.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__iter.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__max__depth-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__max__depth.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__max__depth.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__method-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__method.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__method.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__metric-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__metric.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__metric.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__nesterov-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__nesterov.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__nesterov.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__newton-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__newton.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__newton.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__num__samples-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__num__samples.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__num__samples.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__num__warmup-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__num__warmup.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__num__warmup.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__nuts-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__nuts.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__nuts.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__optimize-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__optimize.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__optimize.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__optimize__algo-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__optimize__algo.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__optimize__algo.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__output-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__output.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__output.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__output__file-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__output__file.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__output__file.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__random-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__random.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__random.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__refresh-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__refresh.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__refresh.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__rwm-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__rwm.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__rwm.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__sample-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__sample.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__sample.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__sample__algo-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__sample__algo.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__sample__algo.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__save__iterations-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__save__iterations.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__save__iterations.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__save__warmup-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__save__warmup.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__save__warmup.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__seed-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__seed.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__seed.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__static-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__static.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__static.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__stepsize-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__stepsize.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__stepsize.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__stepsize__jitter-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__stepsize__jitter.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__stepsize__jitter.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__test-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__test.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__test.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__test__grad__eps-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__test__grad__eps.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__test__grad__eps.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__test__grad__err-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__test__grad__err.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__test__grad__err.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__test__gradient-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__test__gradient.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__test__gradient.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__thin-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__thin.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__thin.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__tolerance-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__tolerance.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__tolerance.png create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__unit__e-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__unit__e.html create mode 100644 doc/api/html/classstan_1_1gm_1_1arg__unit__e.png create mode 100644 doc/api/html/classstan_1_1gm_1_1argument-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1argument.html create mode 100644 doc/api/html/classstan_1_1gm_1_1argument.png create mode 100644 doc/api/html/classstan_1_1gm_1_1argument__parser-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1argument__parser.html create mode 100644 doc/api/html/classstan_1_1gm_1_1argument__probe-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1argument__probe.html create mode 100644 doc/api/html/classstan_1_1gm_1_1categorical__argument-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1categorical__argument.html create mode 100644 doc/api/html/classstan_1_1gm_1_1categorical__argument.png create mode 100644 doc/api/html/classstan_1_1gm_1_1function__signatures-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1function__signatures.html create mode 100644 doc/api/html/classstan_1_1gm_1_1list__argument-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1list__argument.html create mode 100644 doc/api/html/classstan_1_1gm_1_1list__argument.png create mode 100644 doc/api/html/classstan_1_1gm_1_1singleton__argument-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1singleton__argument.html create mode 100644 doc/api/html/classstan_1_1gm_1_1singleton__argument.png create mode 100644 doc/api/html/classstan_1_1gm_1_1unvalued__argument-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1unvalued__argument.html create mode 100644 doc/api/html/classstan_1_1gm_1_1unvalued__argument.png create mode 100644 doc/api/html/classstan_1_1gm_1_1valued__argument-members.html create mode 100644 doc/api/html/classstan_1_1gm_1_1valued__argument.html create mode 100644 doc/api/html/classstan_1_1gm_1_1valued__argument.png create mode 100644 doc/api/html/classstan_1_1io_1_1cmd__line-members.html create mode 100644 doc/api/html/classstan_1_1io_1_1cmd__line.html create mode 100644 doc/api/html/classstan_1_1io_1_1csv__writer-members.html create mode 100644 doc/api/html/classstan_1_1io_1_1csv__writer.html create mode 100644 doc/api/html/classstan_1_1io_1_1dump-members.html create mode 100644 doc/api/html/classstan_1_1io_1_1dump.html create mode 100644 doc/api/html/classstan_1_1io_1_1dump.png create mode 100644 doc/api/html/classstan_1_1io_1_1dump__reader-members.html create mode 100644 doc/api/html/classstan_1_1io_1_1dump__reader.html create mode 100644 doc/api/html/classstan_1_1io_1_1dump__writer-members.html create mode 100644 doc/api/html/classstan_1_1io_1_1dump__writer.html create mode 100644 doc/api/html/classstan_1_1io_1_1mcmc__writer-members.html create mode 100644 doc/api/html/classstan_1_1io_1_1mcmc__writer.html create mode 100644 doc/api/html/classstan_1_1io_1_1reader-members.html create mode 100644 doc/api/html/classstan_1_1io_1_1reader.html create mode 100644 doc/api/html/classstan_1_1io_1_1stan__csv__reader-members.html create mode 100644 doc/api/html/classstan_1_1io_1_1stan__csv__reader.html create mode 100644 doc/api/html/classstan_1_1io_1_1var__context-members.html create mode 100644 doc/api/html/classstan_1_1io_1_1var__context.html create mode 100644 doc/api/html/classstan_1_1io_1_1var__context.png create mode 100644 doc/api/html/classstan_1_1io_1_1writer-members.html create mode 100644 doc/api/html/classstan_1_1io_1_1writer.html create mode 100644 doc/api/html/classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4-members.html create mode 100644 doc/api/html/classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4.html create mode 100644 doc/api/html/classstan_1_1math_1_1_l_d_l_t__factor_3_01stan_1_1agrad_1_1var_00_01_r_00_01_c_01_4-members.html create mode 100644 doc/api/html/classstan_1_1math_1_1_l_d_l_t__factor_3_01stan_1_1agrad_1_1var_00_01_r_00_01_c_01_4.html create mode 100644 doc/api/html/classstan_1_1math_1_1accumulator-members.html create mode 100644 doc/api/html/classstan_1_1math_1_1accumulator.html create mode 100644 doc/api/html/classstan_1_1math_1_1seq__view-members.html create mode 100644 doc/api/html/classstan_1_1math_1_1seq__view.html create mode 100644 doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_011_00_01_eigen_1_1_dynamic_01_4_01_4-members.html create mode 100644 doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_011_00_01_eigen_1_1_dynamic_01_4_01_4.html create mode 100644 doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_01_eigen_1_1_dynamic_00_011_01_4_01_4-members.html create mode 100644 doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_01_eigen_1_1_dynamic_00_011_01_4_01_4.html create mode 100644 doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4.html create mode 100644 doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_01_eigen_1_1_dynamic_00_085212abef8028c93e19b6c8ba8c0204d.html create mode 100644 doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01_s_01_4_01_4-members.html create mode 100644 doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01_s_01_4_01_4.html create mode 100644 doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01_t_01_4_01_4-members.html create mode 100644 doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01_t_01_4_01_4.html create mode 100644 doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01std_1_1vector_3_01_t_01_4_01_4_01_4-members.html create mode 100644 doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01std_1_1vector_3_01_t_01_4_01_4_01_4.html create mode 100644 doc/api/html/classstan_1_1math_1_1seq__view_3_01double_00_01std_1_1vector_3_01int_01_4_01_4-members.html create mode 100644 doc/api/html/classstan_1_1math_1_1seq__view_3_01double_00_01std_1_1vector_3_01int_01_4_01_4.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1adapt__dense__e__nuts-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1adapt__dense__e__nuts.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1adapt__dense__e__nuts.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1adapt__dense__e__static__hmc-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1adapt__dense__e__static__hmc.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1adapt__dense__e__static__hmc.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1adapt__diag__e__nuts-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1adapt__diag__e__nuts.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1adapt__diag__e__nuts.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1adapt__diag__e__static__hmc-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1adapt__diag__e__static__hmc.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1adapt__diag__e__static__hmc.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1adapt__unit__e__nuts-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1adapt__unit__e__nuts.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1adapt__unit__e__nuts.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1adapt__unit__e__static__hmc-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1adapt__unit__e__static__hmc.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1adapt__unit__e__static__hmc.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1base__adaptation-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1base__adaptation.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1base__adaptation.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1base__adapter-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1base__adapter.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1base__adapter.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1base__hamiltonian-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1base__hamiltonian.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1base__hmc-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1base__hmc.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1base__hmc.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1base__integrator-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1base__integrator.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1base__integrator.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1base__leapfrog-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1base__leapfrog.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1base__leapfrog.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1base__mcmc-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1base__mcmc.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1base__mcmc.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1base__nuts-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1base__nuts.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1base__nuts.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1base__static__hmc-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1base__static__hmc.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1base__static__hmc.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1chains-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1chains.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1covar__adaptation-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1covar__adaptation.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1covar__adaptation.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1dense__e__metric-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1dense__e__metric.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1dense__e__metric.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1dense__e__nuts-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1dense__e__nuts.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1dense__e__nuts.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1dense__e__point-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1dense__e__point.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1dense__e__point.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1dense__e__static__hmc-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1dense__e__static__hmc.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1dense__e__static__hmc.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1diag__e__metric-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1diag__e__metric.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1diag__e__metric.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1diag__e__nuts-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1diag__e__nuts.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1diag__e__nuts.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1diag__e__point-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1diag__e__point.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1diag__e__point.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1diag__e__static__hmc-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1diag__e__static__hmc.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1diag__e__static__hmc.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1expl__leapfrog-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1expl__leapfrog.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1expl__leapfrog.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1ps__point-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1ps__point.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1ps__point.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1sample-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1sample.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1stepsize__adaptation-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1stepsize__adaptation.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1stepsize__adaptation.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1stepsize__adapter-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1stepsize__adapter.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1stepsize__adapter.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1stepsize__covar__adapter-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1stepsize__covar__adapter.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1stepsize__covar__adapter.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1stepsize__var__adapter-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1stepsize__var__adapter.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1stepsize__var__adapter.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1unit__e__metric-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1unit__e__metric.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1unit__e__metric.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1unit__e__nuts-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1unit__e__nuts.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1unit__e__nuts.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1unit__e__point-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1unit__e__point.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1unit__e__point.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1unit__e__static__hmc-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1unit__e__static__hmc.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1unit__e__static__hmc.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1var__adaptation-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1var__adaptation.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1var__adaptation.png create mode 100644 doc/api/html/classstan_1_1mcmc_1_1windowed__adaptation-members.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1windowed__adaptation.html create mode 100644 doc/api/html/classstan_1_1mcmc_1_1windowed__adaptation.png create mode 100644 doc/api/html/classstan_1_1memory_1_1chunk__alloc-members.html create mode 100644 doc/api/html/classstan_1_1memory_1_1chunk__alloc.html create mode 100644 doc/api/html/classstan_1_1memory_1_1stack__alloc-members.html create mode 100644 doc/api/html/classstan_1_1memory_1_1stack__alloc.html create mode 100644 doc/api/html/classstan_1_1model_1_1prob__grad-members.html create mode 100644 doc/api/html/classstan_1_1model_1_1prob__grad.html create mode 100644 doc/api/html/classstan_1_1optimization_1_1_b_f_g_s_line_search-members.html create mode 100644 doc/api/html/classstan_1_1optimization_1_1_b_f_g_s_line_search.html create mode 100644 doc/api/html/classstan_1_1optimization_1_1_b_f_g_s_line_search.png create mode 100644 doc/api/html/classstan_1_1optimization_1_1_b_f_g_s_minimizer-members.html create mode 100644 doc/api/html/classstan_1_1optimization_1_1_b_f_g_s_minimizer.html create mode 100644 doc/api/html/classstan_1_1optimization_1_1_model_adaptor-members.html create mode 100644 doc/api/html/classstan_1_1optimization_1_1_model_adaptor.html create mode 100644 doc/api/html/classstan_1_1optimization_1_1_nesterov_gradient-members.html create mode 100644 doc/api/html/classstan_1_1optimization_1_1_nesterov_gradient.html create mode 100644 doc/api/html/classstan_1_1prob_1_1welford__covar__estimator-members.html create mode 100644 doc/api/html/classstan_1_1prob_1_1welford__covar__estimator.html create mode 100644 doc/api/html/classstan_1_1prob_1_1welford__var__estimator-members.html create mode 100644 doc/api/html/classstan_1_1prob_1_1welford__var__estimator.html create mode 100644 doc/api/html/closed.png create mode 100644 doc/api/html/cmd__line_8hpp.html create mode 100644 doc/api/html/cmd__line_8hpp_source.html create mode 100644 doc/api/html/col_8hpp.html create mode 100644 doc/api/html/col_8hpp_source.html create mode 100644 doc/api/html/cols_8hpp.html create mode 100644 doc/api/html/cols_8hpp_source.html create mode 100644 doc/api/html/command_8hpp.html create mode 100644 doc/api/html/command_8hpp_source.html create mode 100644 doc/api/html/common__adaptors__def_8hpp.html create mode 100644 doc/api/html/common__adaptors__def_8hpp_source.html create mode 100644 doc/api/html/common__type_8hpp.html create mode 100644 doc/api/html/common__type_8hpp_source.html create mode 100644 doc/api/html/compiler_8hpp.html create mode 100644 doc/api/html/compiler_8hpp_source.html create mode 100644 doc/api/html/constraint__tolerance_8hpp.html create mode 100644 doc/api/html/constraint__tolerance_8hpp_source.html create mode 100644 doc/api/html/covar__adaptation_8hpp.html create mode 100644 doc/api/html/covar__adaptation_8hpp_source.html create mode 100644 doc/api/html/csv__writer_8hpp.html create mode 100644 doc/api/html/csv__writer_8hpp_source.html create mode 100644 doc/api/html/cumulative__sum_8hpp.html create mode 100644 doc/api/html/cumulative__sum_8hpp_source.html create mode 100644 doc/api/html/ddv__vari_8hpp.html create mode 100644 doc/api/html/ddv__vari_8hpp_source.html create mode 100644 doc/api/html/dense__e__metric_8hpp.html create mode 100644 doc/api/html/dense__e__metric_8hpp_source.html create mode 100644 doc/api/html/dense__e__nuts_8hpp.html create mode 100644 doc/api/html/dense__e__nuts_8hpp_source.html create mode 100644 doc/api/html/dense__e__point_8hpp.html create mode 100644 doc/api/html/dense__e__point_8hpp_source.html create mode 100644 doc/api/html/dense__e__static__hmc_8hpp.html create mode 100644 doc/api/html/dense__e__static__hmc_8hpp_source.html create mode 100644 doc/api/html/diag__e__metric_8hpp.html create mode 100644 doc/api/html/diag__e__metric_8hpp_source.html create mode 100644 doc/api/html/diag__e__nuts_8hpp.html create mode 100644 doc/api/html/diag__e__nuts_8hpp_source.html create mode 100644 doc/api/html/diag__e__point_8hpp.html create mode 100644 doc/api/html/diag__e__point_8hpp_source.html create mode 100644 doc/api/html/diag__e__static__hmc_8hpp.html create mode 100644 doc/api/html/diag__e__static__hmc_8hpp_source.html create mode 100644 doc/api/html/diag__matrix_8hpp.html create mode 100644 doc/api/html/diag__matrix_8hpp_source.html create mode 100644 doc/api/html/diag__post__multiply_8hpp.html create mode 100644 doc/api/html/diag__post__multiply_8hpp_source.html create mode 100644 doc/api/html/diag__pre__multiply_8hpp.html create mode 100644 doc/api/html/diag__pre__multiply_8hpp_source.html create mode 100644 doc/api/html/diagonal_8hpp.html create mode 100644 doc/api/html/diagonal_8hpp_source.html create mode 100644 doc/api/html/dims_8hpp.html create mode 100644 doc/api/html/dims_8hpp_source.html create mode 100644 doc/api/html/dir_0c7ba03e05d7755a93c72a387515f18e.html create mode 100644 doc/api/html/dir_0f7468ba3d646c35c5f1677a20123edb.html create mode 100644 doc/api/html/dir_139cce78ba5d92491da28703870a60b5.html create mode 100644 doc/api/html/dir_182af125d00bd279bb48de10042b58c3.html create mode 100644 doc/api/html/dir_1ff9d265245893e221d5111ecd1383dc.html create mode 100644 doc/api/html/dir_2199d12d39bf553599a4a7fa2d24fe67.html create mode 100644 doc/api/html/dir_22b468d2bc5e21cba3741edb912cd36a.html create mode 100644 doc/api/html/dir_29b20cd43524c7f0fc77aef3c7e38f50.html create mode 100644 doc/api/html/dir_2e546bda41fe40b59dc00b79d00b50ce.html create mode 100644 doc/api/html/dir_2fa10d765296c30bb35aa6c0b0bc0528.html create mode 100644 doc/api/html/dir_3995d5884456238d20884a417bb53c63.html create mode 100644 doc/api/html/dir_3b4610d017c705a4887f638ce7fbc838.html create mode 100644 doc/api/html/dir_3bf5ecbbc2acdb8067d845784c2d4c37.html create mode 100644 doc/api/html/dir_4169038f84fc0e1ed68b4a7c11130da4.html create mode 100644 doc/api/html/dir_44cbf1ed18699f3d3b4fc628a26fcd8e.html create mode 100644 doc/api/html/dir_4ff6d94cb2a0a21decf9fe1d17e36a84.html create mode 100644 doc/api/html/dir_50f5c6d2b5c0f0cf0dce53a8e04f8433.html create mode 100644 doc/api/html/dir_52470340ee5541bea78123d62b747bfc.html create mode 100644 doc/api/html/dir_52c3c3fe3bff0ba6815d4f34971ed7d3.html create mode 100644 doc/api/html/dir_54e1f17c1ac5ea0adfc355c0b89ee8b2.html create mode 100644 doc/api/html/dir_5a90b97b153f6d877d3f3fe75b024a65.html create mode 100644 doc/api/html/dir_68c25edf9c6d341fdd24c7ac7d0f552b.html create mode 100644 doc/api/html/dir_6b822de55cde49ee6f3a9b01e44fb566.html create mode 100644 doc/api/html/dir_7edb90b8895d3ae5eaffb58e5bac252e.html create mode 100644 doc/api/html/dir_7f504516231d3fe329ee42a0c6d09a23.html create mode 100644 doc/api/html/dir_8bbd805b34b7b8cc78ee869a600898c2.html create mode 100644 doc/api/html/dir_8c3552022fc3ada5c17e804a5e09b39f.html create mode 100644 doc/api/html/dir_918f1495a74b4bbbcceda6da05869dad.html create mode 100644 doc/api/html/dir_99762ae463b7309a47de4b14a14d0e0f.html create mode 100644 doc/api/html/dir_99fdd75913c28d151522a8b8afede414.html create mode 100644 doc/api/html/dir_9c4b002ce8795bbd5dbe2cf3421fe13a.html create mode 100644 doc/api/html/dir_adda0d2b1be4bc1eb47d3b2cf56797af.html create mode 100644 doc/api/html/dir_ae30097f91ecf0dffad078cd8b901d6c.html create mode 100644 doc/api/html/dir_b1c6471129ce395961fd25e68f861508.html create mode 100644 doc/api/html/dir_b5faa64c567d6f189426dea685de5e0f.html create mode 100644 doc/api/html/dir_bfdd916fd7a3310c7c8c32c9dbb4c5dd.html create mode 100644 doc/api/html/dir_d06f81619dd9bcc28d70dd2c97937727.html create mode 100644 doc/api/html/dir_e5fd7b97e7c167e7281b34e17696a6e4.html create mode 100644 doc/api/html/dir_e65b8371bb074abd719c6e80ee5d6469.html create mode 100644 doc/api/html/dir_e7242831226ee912bf5f374de664968d.html create mode 100644 doc/api/html/dir_e9c236c76d69ff67463df99eaf9c4820.html create mode 100644 doc/api/html/dir_f2ec37f115c79ba754de20300359aed5.html create mode 100644 doc/api/html/dir_f3e98ab768ca388ef4baecb6d973adcf.html create mode 100644 doc/api/html/dir_f77850045c6d72da1ced64bfc8354271.html create mode 100644 doc/api/html/dir_fb5291ba38e4a736e77d8ba78c86369a.html create mode 100644 doc/api/html/dirichlet_8hpp.html create mode 100644 doc/api/html/dirichlet_8hpp_source.html create mode 100644 doc/api/html/distributions_8hpp.html create mode 100644 doc/api/html/distributions_8hpp_source.html create mode 100644 doc/api/html/dom__err_8hpp.html create mode 100644 doc/api/html/dom__err_8hpp_source.html create mode 100644 doc/api/html/dom__err__vec_8hpp.html create mode 100644 doc/api/html/dom__err__vec_8hpp_source.html create mode 100644 doc/api/html/dot_8hpp.html create mode 100644 doc/api/html/dot_8hpp_source.html create mode 100644 doc/api/html/double__exponential_8hpp.html create mode 100644 doc/api/html/double__exponential_8hpp_source.html create mode 100644 doc/api/html/doxygen.css create mode 100644 doc/api/html/doxygen.png create mode 100644 doc/api/html/dump_8hpp.html create mode 100644 doc/api/html/dump_8hpp_source.html create mode 100644 doc/api/html/dv__vari_8hpp.html create mode 100644 doc/api/html/dv__vari_8hpp_source.html create mode 100644 doc/api/html/dvd__vari_8hpp.html create mode 100644 doc/api/html/dvd__vari_8hpp_source.html create mode 100644 doc/api/html/dvv__vari_8hpp.html create mode 100644 doc/api/html/dvv__vari_8hpp_source.html create mode 100644 doc/api/html/dynsections.js create mode 100644 doc/api/html/eigenvalues__sym_8hpp.html create mode 100644 doc/api/html/eigenvalues__sym_8hpp_source.html create mode 100644 doc/api/html/eigenvectors__sym_8hpp.html create mode 100644 doc/api/html/eigenvectors__sym_8hpp_source.html create mode 100644 doc/api/html/elt__divide_8hpp.html create mode 100644 doc/api/html/elt__divide_8hpp_source.html create mode 100644 doc/api/html/elt__multiply_8hpp.html create mode 100644 doc/api/html/elt__multiply_8hpp_source.html create mode 100644 doc/api/html/error__codes_8hpp.html create mode 100644 doc/api/html/error__codes_8hpp_source.html create mode 100644 doc/api/html/error__handling_8dox.html create mode 100644 doc/api/html/exp__mod__normal_8hpp.html create mode 100644 doc/api/html/exp__mod__normal_8hpp_source.html create mode 100644 doc/api/html/expl__leapfrog_8hpp.html create mode 100644 doc/api/html/expl__leapfrog_8hpp_source.html create mode 100644 doc/api/html/exponential_8hpp.html create mode 100644 doc/api/html/exponential_8hpp_source.html create mode 100644 doc/api/html/expression__grammar_8hpp.html create mode 100644 doc/api/html/expression__grammar_8hpp_source.html create mode 100644 doc/api/html/expression__grammar__def_8hpp.html create mode 100644 doc/api/html/expression__grammar__def_8hpp_source.html create mode 100644 doc/api/html/expression__grammar__inst_8cpp.html create mode 100644 doc/api/html/expression__grammar__inst_8cpp_source.html create mode 100644 doc/api/html/files.html create mode 100644 doc/api/html/fill_8hpp.html create mode 100644 doc/api/html/fill_8hpp_source.html create mode 100644 doc/api/html/form_0.png create mode 100644 doc/api/html/form_1.png create mode 100644 doc/api/html/form_10.png create mode 100644 doc/api/html/form_100.png create mode 100644 doc/api/html/form_101.png create mode 100644 doc/api/html/form_102.png create mode 100644 doc/api/html/form_103.png create mode 100644 doc/api/html/form_104.png create mode 100644 doc/api/html/form_105.png create mode 100644 doc/api/html/form_106.png create mode 100644 doc/api/html/form_107.png create mode 100644 doc/api/html/form_108.png create mode 100644 doc/api/html/form_109.png create mode 100644 doc/api/html/form_11.png create mode 100644 doc/api/html/form_110.png create mode 100644 doc/api/html/form_111.png create mode 100644 doc/api/html/form_112.png create mode 100644 doc/api/html/form_113.png create mode 100644 doc/api/html/form_114.png create mode 100644 doc/api/html/form_115.png create mode 100644 doc/api/html/form_116.png create mode 100644 doc/api/html/form_117.png create mode 100644 doc/api/html/form_118.png create mode 100644 doc/api/html/form_119.png create mode 100644 doc/api/html/form_12.png create mode 100644 doc/api/html/form_120.png create mode 100644 doc/api/html/form_121.png create mode 100644 doc/api/html/form_122.png create mode 100644 doc/api/html/form_123.png create mode 100644 doc/api/html/form_124.png create mode 100644 doc/api/html/form_125.png create mode 100644 doc/api/html/form_126.png create mode 100644 doc/api/html/form_127.png create mode 100644 doc/api/html/form_128.png create mode 100644 doc/api/html/form_129.png create mode 100644 doc/api/html/form_13.png create mode 100644 doc/api/html/form_130.png create mode 100644 doc/api/html/form_131.png create mode 100644 doc/api/html/form_132.png create mode 100644 doc/api/html/form_133.png create mode 100644 doc/api/html/form_134.png create mode 100644 doc/api/html/form_135.png create mode 100644 doc/api/html/form_136.png create mode 100644 doc/api/html/form_137.png create mode 100644 doc/api/html/form_138.png create mode 100644 doc/api/html/form_139.png create mode 100644 doc/api/html/form_14.png create mode 100644 doc/api/html/form_140.png create mode 100644 doc/api/html/form_141.png create mode 100644 doc/api/html/form_142.png create mode 100644 doc/api/html/form_143.png create mode 100644 doc/api/html/form_144.png create mode 100644 doc/api/html/form_145.png create mode 100644 doc/api/html/form_146.png create mode 100644 doc/api/html/form_147.png create mode 100644 doc/api/html/form_148.png create mode 100644 doc/api/html/form_149.png create mode 100644 doc/api/html/form_15.png create mode 100644 doc/api/html/form_150.png create mode 100644 doc/api/html/form_151.png create mode 100644 doc/api/html/form_152.png create mode 100644 doc/api/html/form_153.png create mode 100644 doc/api/html/form_154.png create mode 100644 doc/api/html/form_155.png create mode 100644 doc/api/html/form_156.png create mode 100644 doc/api/html/form_157.png create mode 100644 doc/api/html/form_158.png create mode 100644 doc/api/html/form_159.png create mode 100644 doc/api/html/form_16.png create mode 100644 doc/api/html/form_160.png create mode 100644 doc/api/html/form_161.png create mode 100644 doc/api/html/form_162.png create mode 100644 doc/api/html/form_163.png create mode 100644 doc/api/html/form_164.png create mode 100644 doc/api/html/form_165.png create mode 100644 doc/api/html/form_166.png create mode 100644 doc/api/html/form_167.png create mode 100644 doc/api/html/form_168.png create mode 100644 doc/api/html/form_169.png create mode 100644 doc/api/html/form_17.png create mode 100644 doc/api/html/form_170.png create mode 100644 doc/api/html/form_171.png create mode 100644 doc/api/html/form_172.png create mode 100644 doc/api/html/form_173.png create mode 100644 doc/api/html/form_174.png create mode 100644 doc/api/html/form_175.png create mode 100644 doc/api/html/form_176.png create mode 100644 doc/api/html/form_177.png create mode 100644 doc/api/html/form_178.png create mode 100644 doc/api/html/form_18.png create mode 100644 doc/api/html/form_19.png create mode 100644 doc/api/html/form_2.png create mode 100644 doc/api/html/form_20.png create mode 100644 doc/api/html/form_21.png create mode 100644 doc/api/html/form_22.png create mode 100644 doc/api/html/form_23.png create mode 100644 doc/api/html/form_24.png create mode 100644 doc/api/html/form_25.png create mode 100644 doc/api/html/form_26.png create mode 100644 doc/api/html/form_27.png create mode 100644 doc/api/html/form_28.png create mode 100644 doc/api/html/form_29.png create mode 100644 doc/api/html/form_3.png create mode 100644 doc/api/html/form_30.png create mode 100644 doc/api/html/form_31.png create mode 100644 doc/api/html/form_32.png create mode 100644 doc/api/html/form_33.png create mode 100644 doc/api/html/form_34.png create mode 100644 doc/api/html/form_35.png create mode 100644 doc/api/html/form_36.png create mode 100644 doc/api/html/form_37.png create mode 100644 doc/api/html/form_38.png create mode 100644 doc/api/html/form_39.png create mode 100644 doc/api/html/form_4.png create mode 100644 doc/api/html/form_40.png create mode 100644 doc/api/html/form_41.png create mode 100644 doc/api/html/form_42.png create mode 100644 doc/api/html/form_43.png create mode 100644 doc/api/html/form_44.png create mode 100644 doc/api/html/form_45.png create mode 100644 doc/api/html/form_46.png create mode 100644 doc/api/html/form_47.png create mode 100644 doc/api/html/form_48.png create mode 100644 doc/api/html/form_49.png create mode 100644 doc/api/html/form_5.png create mode 100644 doc/api/html/form_50.png create mode 100644 doc/api/html/form_51.png create mode 100644 doc/api/html/form_52.png create mode 100644 doc/api/html/form_53.png create mode 100644 doc/api/html/form_54.png create mode 100644 doc/api/html/form_55.png create mode 100644 doc/api/html/form_56.png create mode 100644 doc/api/html/form_57.png create mode 100644 doc/api/html/form_58.png create mode 100644 doc/api/html/form_59.png create mode 100644 doc/api/html/form_6.png create mode 100644 doc/api/html/form_60.png create mode 100644 doc/api/html/form_61.png create mode 100644 doc/api/html/form_62.png create mode 100644 doc/api/html/form_63.png create mode 100644 doc/api/html/form_64.png create mode 100644 doc/api/html/form_65.png create mode 100644 doc/api/html/form_66.png create mode 100644 doc/api/html/form_67.png create mode 100644 doc/api/html/form_68.png create mode 100644 doc/api/html/form_69.png create mode 100644 doc/api/html/form_7.png create mode 100644 doc/api/html/form_70.png create mode 100644 doc/api/html/form_71.png create mode 100644 doc/api/html/form_72.png create mode 100644 doc/api/html/form_73.png create mode 100644 doc/api/html/form_74.png create mode 100644 doc/api/html/form_75.png create mode 100644 doc/api/html/form_76.png create mode 100644 doc/api/html/form_77.png create mode 100644 doc/api/html/form_78.png create mode 100644 doc/api/html/form_79.png create mode 100644 doc/api/html/form_8.png create mode 100644 doc/api/html/form_80.png create mode 100644 doc/api/html/form_81.png create mode 100644 doc/api/html/form_82.png create mode 100644 doc/api/html/form_83.png create mode 100644 doc/api/html/form_84.png create mode 100644 doc/api/html/form_85.png create mode 100644 doc/api/html/form_86.png create mode 100644 doc/api/html/form_87.png create mode 100644 doc/api/html/form_88.png create mode 100644 doc/api/html/form_89.png create mode 100644 doc/api/html/form_9.png create mode 100644 doc/api/html/form_90.png create mode 100644 doc/api/html/form_91.png create mode 100644 doc/api/html/form_92.png create mode 100644 doc/api/html/form_93.png create mode 100644 doc/api/html/form_94.png create mode 100644 doc/api/html/form_95.png create mode 100644 doc/api/html/form_96.png create mode 100644 doc/api/html/form_97.png create mode 100644 doc/api/html/form_98.png create mode 100644 doc/api/html/form_99.png create mode 100644 doc/api/html/formula.repository create mode 100644 doc/api/html/ftv2blank.png create mode 100644 doc/api/html/ftv2cl.png create mode 100644 doc/api/html/ftv2doc.png create mode 100644 doc/api/html/ftv2folderclosed.png create mode 100644 doc/api/html/ftv2folderopen.png create mode 100644 doc/api/html/ftv2lastnode.png create mode 100644 doc/api/html/ftv2link.png create mode 100644 doc/api/html/ftv2mlastnode.png create mode 100644 doc/api/html/ftv2mnode.png create mode 100644 doc/api/html/ftv2mo.png create mode 100644 doc/api/html/ftv2node.png create mode 100644 doc/api/html/ftv2ns.png create mode 100644 doc/api/html/ftv2plastnode.png create mode 100644 doc/api/html/ftv2pnode.png create mode 100644 doc/api/html/ftv2splitbar.png create mode 100644 doc/api/html/ftv2vertline.png create mode 100644 doc/api/html/functions.html create mode 100644 doc/api/html/functions_0x61.html create mode 100644 doc/api/html/functions_0x62.html create mode 100644 doc/api/html/functions_0x63.html create mode 100644 doc/api/html/functions_0x64.html create mode 100644 doc/api/html/functions_0x65.html create mode 100644 doc/api/html/functions_0x66.html create mode 100644 doc/api/html/functions_0x67.html create mode 100644 doc/api/html/functions_0x68.html create mode 100644 doc/api/html/functions_0x69.html create mode 100644 doc/api/html/functions_0x6b.html create mode 100644 doc/api/html/functions_0x6c.html create mode 100644 doc/api/html/functions_0x6d.html create mode 100644 doc/api/html/functions_0x6e.html create mode 100644 doc/api/html/functions_0x6f.html create mode 100644 doc/api/html/functions_0x70.html create mode 100644 doc/api/html/functions_0x71.html create mode 100644 doc/api/html/functions_0x72.html create mode 100644 doc/api/html/functions_0x73.html create mode 100644 doc/api/html/functions_0x74.html create mode 100644 doc/api/html/functions_0x75.html create mode 100644 doc/api/html/functions_0x76.html create mode 100644 doc/api/html/functions_0x77.html create mode 100644 doc/api/html/functions_0x78.html create mode 100644 doc/api/html/functions_0x7a.html create mode 100644 doc/api/html/functions_0x7e.html create mode 100644 doc/api/html/functions_2dist_8hpp.html create mode 100644 doc/api/html/functions_2dist_8hpp_source.html create mode 100644 doc/api/html/functions_2max_8hpp.html create mode 100644 doc/api/html/functions_2max_8hpp_source.html create mode 100644 doc/api/html/functions_2min_8hpp.html create mode 100644 doc/api/html/functions_2min_8hpp_source.html create mode 100644 doc/api/html/functions_eval.html create mode 100644 doc/api/html/functions_func.html create mode 100644 doc/api/html/functions_func_0x61.html create mode 100644 doc/api/html/functions_func_0x62.html create mode 100644 doc/api/html/functions_func_0x63.html create mode 100644 doc/api/html/functions_func_0x64.html create mode 100644 doc/api/html/functions_func_0x65.html create mode 100644 doc/api/html/functions_func_0x66.html create mode 100644 doc/api/html/functions_func_0x67.html create mode 100644 doc/api/html/functions_func_0x68.html create mode 100644 doc/api/html/functions_func_0x69.html create mode 100644 doc/api/html/functions_func_0x6b.html create mode 100644 doc/api/html/functions_func_0x6c.html create mode 100644 doc/api/html/functions_func_0x6d.html create mode 100644 doc/api/html/functions_func_0x6e.html create mode 100644 doc/api/html/functions_func_0x6f.html create mode 100644 doc/api/html/functions_func_0x70.html create mode 100644 doc/api/html/functions_func_0x71.html create mode 100644 doc/api/html/functions_func_0x72.html create mode 100644 doc/api/html/functions_func_0x73.html create mode 100644 doc/api/html/functions_func_0x74.html create mode 100644 doc/api/html/functions_func_0x75.html create mode 100644 doc/api/html/functions_func_0x76.html create mode 100644 doc/api/html/functions_func_0x77.html create mode 100644 doc/api/html/functions_func_0x7a.html create mode 100644 doc/api/html/functions_func_0x7e.html create mode 100644 doc/api/html/functions_rela.html create mode 100644 doc/api/html/functions_type.html create mode 100644 doc/api/html/functions_vars.html create mode 100644 doc/api/html/functions_vars_0x61.html create mode 100644 doc/api/html/functions_vars_0x62.html create mode 100644 doc/api/html/functions_vars_0x63.html create mode 100644 doc/api/html/functions_vars_0x64.html create mode 100644 doc/api/html/functions_vars_0x65.html create mode 100644 doc/api/html/functions_vars_0x66.html create mode 100644 doc/api/html/functions_vars_0x67.html create mode 100644 doc/api/html/functions_vars_0x68.html create mode 100644 doc/api/html/functions_vars_0x69.html create mode 100644 doc/api/html/functions_vars_0x6b.html create mode 100644 doc/api/html/functions_vars_0x6c.html create mode 100644 doc/api/html/functions_vars_0x6d.html create mode 100644 doc/api/html/functions_vars_0x6e.html create mode 100644 doc/api/html/functions_vars_0x6f.html create mode 100644 doc/api/html/functions_vars_0x70.html create mode 100644 doc/api/html/functions_vars_0x71.html create mode 100644 doc/api/html/functions_vars_0x72.html create mode 100644 doc/api/html/functions_vars_0x73.html create mode 100644 doc/api/html/functions_vars_0x74.html create mode 100644 doc/api/html/functions_vars_0x75.html create mode 100644 doc/api/html/functions_vars_0x76.html create mode 100644 doc/api/html/functions_vars_0x77.html create mode 100644 doc/api/html/functions_vars_0x78.html create mode 100644 doc/api/html/fvar_8hpp.html create mode 100644 doc/api/html/fvar_8hpp_source.html create mode 100644 doc/api/html/fwd_2functions_2acos_8hpp.html create mode 100644 doc/api/html/fwd_2functions_2acos_8hpp_source.html create mode 100644 doc/api/html/fwd_2functions_2acosh_8hpp.html create mode 100644 doc/api/html/fwd_2functions_2acosh_8hpp_source.html create mode 100644 doc/api/html/fwd_2functions_2asin_8hpp.html create mode 100644 doc/api/html/fwd_2functions_2asin_8hpp_source.html create mode 100644 doc/api/html/fwd_2functions_2asinh_8hpp.html create mode 100644 doc/api/html/fwd_2functions_2asinh_8hpp_source.html create mode 100644 doc/api/html/fwd_2functions_2atan2_8hpp.html create mode 100644 doc/api/html/fwd_2functions_2atan2_8hpp_source.html create mode 100644 doc/api/html/fwd_2functions_2atan_8hpp.html create mode 100644 doc/api/html/fwd_2functions_2atan_8hpp_source.html create mode 100644 doc/api/html/fwd_2functions_2atanh_8hpp.html create mode 100644 doc/api/html/fwd_2functions_2atanh_8hpp_source.html create mode 100644 doc/api/html/fwd_2functions_2cbrt_8hpp.html create mode 100644 doc/api/html/fwd_2functions_2cbrt_8hpp_source.html create mode 100644 doc/api/html/fwd_2functions_2ceil_8hpp.html create mode 100644 doc/api/html/fwd_2functions_2ceil_8hpp_source.html create mode 100644 doc/api/html/fwd_2functions_2cos_8hpp.html create mode 100644 doc/api/html/fwd_2functions_2cos_8hpp_source.html create mode 100644 doc/api/html/fwd_2functions_2cosh_8hpp.html create mode 100644 doc/api/html/fwd_2functions_2cosh_8hpp_source.html create mode 100644 doc/api/html/fwd_2functions_2erf_8hpp.html create mode 100644 doc/api/html/fwd_2functions_2erf_8hpp_source.html create mode 100644 doc/api/html/fwd_2functions_2erfc_8hpp.html create mode 100644 doc/api/html/fwd_2functions_2erfc_8hpp_source.html create mode 100644 doc/api/html/fwd_2functions_2expm1_8hpp.html create mode 100644 doc/api/html/fwd_2functions_2expm1_8hpp_source.html create mode 100644 doc/api/html/fwd_2functions_2fabs_8hpp.html create mode 100644 doc/api/html/fwd_2functions_2fabs_8hpp_source.html create mode 100644 doc/api/html/fwd_2functions_2floor_8hpp.html create mode 100644 doc/api/html/fwd_2functions_2floor_8hpp_source.html create mode 100644 doc/api/html/fwd_2functions_2fmax_8hpp.html create mode 100644 doc/api/html/fwd_2functions_2fmax_8hpp_source.html create mode 100644 doc/api/html/fwd_2functions_2fmin_8hpp.html create mode 100644 doc/api/html/fwd_2functions_2fmin_8hpp_source.html create mode 100644 doc/api/html/fwd_2functions_2fmod_8hpp.html create mode 100644 doc/api/html/fwd_2functions_2fmod_8hpp_source.html create mode 100644 doc/api/html/fwd_2functions_2hypot_8hpp.html create mode 100644 doc/api/html/fwd_2functions_2hypot_8hpp_source.html create mode 100644 doc/api/html/fwd_2functions_2log10_8hpp.html create mode 100644 doc/api/html/fwd_2functions_2log10_8hpp_source.html create mode 100644 doc/api/html/fwd_2functions_2pow_8hpp.html create mode 100644 doc/api/html/fwd_2functions_2pow_8hpp_source.html create mode 100644 doc/api/html/fwd_2functions_2round_8hpp.html create mode 100644 doc/api/html/fwd_2functions_2round_8hpp_source.html create mode 100644 doc/api/html/fwd_2functions_2sin_8hpp.html create mode 100644 doc/api/html/fwd_2functions_2sin_8hpp_source.html create mode 100644 doc/api/html/fwd_2functions_2sinh_8hpp.html create mode 100644 doc/api/html/fwd_2functions_2sinh_8hpp_source.html create mode 100644 doc/api/html/fwd_2functions_2sqrt_8hpp.html create mode 100644 doc/api/html/fwd_2functions_2sqrt_8hpp_source.html create mode 100644 doc/api/html/fwd_2functions_2tan_8hpp.html create mode 100644 doc/api/html/fwd_2functions_2tan_8hpp_source.html create mode 100644 doc/api/html/fwd_2functions_2tanh_8hpp.html create mode 100644 doc/api/html/fwd_2functions_2tanh_8hpp_source.html create mode 100644 doc/api/html/fwd_2functions_2tgamma_8hpp.html create mode 100644 doc/api/html/fwd_2functions_2tgamma_8hpp_source.html create mode 100644 doc/api/html/fwd_2functions_2trunc_8hpp.html create mode 100644 doc/api/html/fwd_2functions_2trunc_8hpp_source.html create mode 100644 doc/api/html/fwd_2numeric__limits_8hpp.html create mode 100644 doc/api/html/fwd_2numeric__limits_8hpp_source.html create mode 100644 doc/api/html/fwd_2operators_2operator__addition_8hpp.html create mode 100644 doc/api/html/fwd_2operators_2operator__addition_8hpp_source.html create mode 100644 doc/api/html/fwd_2operators_2operator__division_8hpp.html create mode 100644 doc/api/html/fwd_2operators_2operator__division_8hpp_source.html create mode 100644 doc/api/html/fwd_2operators_2operator__equal_8hpp.html create mode 100644 doc/api/html/fwd_2operators_2operator__equal_8hpp_source.html create mode 100644 doc/api/html/fwd_2operators_2operator__greater__than_8hpp.html create mode 100644 doc/api/html/fwd_2operators_2operator__greater__than_8hpp_source.html create mode 100644 doc/api/html/fwd_2operators_2operator__greater__than__or__equal_8hpp.html create mode 100644 doc/api/html/fwd_2operators_2operator__greater__than__or__equal_8hpp_source.html create mode 100644 doc/api/html/fwd_2operators_2operator__less__than_8hpp.html create mode 100644 doc/api/html/fwd_2operators_2operator__less__than_8hpp_source.html create mode 100644 doc/api/html/fwd_2operators_2operator__less__than__or__equal_8hpp.html create mode 100644 doc/api/html/fwd_2operators_2operator__less__than__or__equal_8hpp_source.html create mode 100644 doc/api/html/fwd_2operators_2operator__multiplication_8hpp.html create mode 100644 doc/api/html/fwd_2operators_2operator__multiplication_8hpp_source.html create mode 100644 doc/api/html/fwd_2operators_2operator__not__equal_8hpp.html create mode 100644 doc/api/html/fwd_2operators_2operator__not__equal_8hpp_source.html create mode 100644 doc/api/html/fwd_2operators_2operator__subtraction_8hpp.html create mode 100644 doc/api/html/fwd_2operators_2operator__subtraction_8hpp_source.html create mode 100644 doc/api/html/fwd_2operators_8hpp.html create mode 100644 doc/api/html/fwd_2operators_8hpp_source.html create mode 100644 doc/api/html/fwd_8hpp.html create mode 100644 doc/api/html/fwd_8hpp_source.html create mode 100644 doc/api/html/gamma_8hpp.html create mode 100644 doc/api/html/gamma_8hpp_source.html create mode 100644 doc/api/html/gaussian__dlm__obs_8hpp.html create mode 100644 doc/api/html/gaussian__dlm__obs_8hpp_source.html create mode 100644 doc/api/html/generator_8hpp.html create mode 100644 doc/api/html/generator_8hpp_source.html create mode 100644 doc/api/html/get__base1_8hpp.html create mode 100644 doc/api/html/get__base1_8hpp_source.html create mode 100644 doc/api/html/get__base1__lhs_8hpp.html create mode 100644 doc/api/html/get__base1__lhs_8hpp_source.html create mode 100644 doc/api/html/globals.html create mode 100644 doc/api/html/globals_defs.html create mode 100644 doc/api/html/globals_func.html create mode 100644 doc/api/html/globals_vars.html create mode 100644 doc/api/html/gm_8hpp.html create mode 100644 doc/api/html/gm_8hpp_source.html create mode 100644 doc/api/html/grad_8hpp.html create mode 100644 doc/api/html/grad_8hpp_source.html create mode 100644 doc/api/html/gumbel_8hpp.html create mode 100644 doc/api/html/gumbel_8hpp_source.html create mode 100644 doc/api/html/head_8hpp.html create mode 100644 doc/api/html/head_8hpp_source.html create mode 100644 doc/api/html/hessian_8hpp.html create mode 100644 doc/api/html/hessian_8hpp_source.html create mode 100644 doc/api/html/hierarchy.html create mode 100644 doc/api/html/hypergeometric_8hpp.html create mode 100644 doc/api/html/hypergeometric_8hpp_source.html create mode 100644 doc/api/html/index.html create mode 100644 doc/api/html/initialize_8hpp.html create mode 100644 doc/api/html/initialize_8hpp_source.html create mode 100644 doc/api/html/initialize__variable_8hpp.html create mode 100644 doc/api/html/initialize__variable_8hpp_source.html create mode 100644 doc/api/html/int__step_8hpp.html create mode 100644 doc/api/html/int__step_8hpp_source.html create mode 100644 doc/api/html/internal_8hpp.html create mode 100644 doc/api/html/internal_8hpp_source.html create mode 100644 doc/api/html/internal__math_8hpp.html create mode 100644 doc/api/html/internal__math_8hpp_source.html create mode 100644 doc/api/html/inv__chi__square_8hpp.html create mode 100644 doc/api/html/inv__chi__square_8hpp_source.html create mode 100644 doc/api/html/inv__gamma_8hpp.html create mode 100644 doc/api/html/inv__gamma_8hpp_source.html create mode 100644 doc/api/html/inv__wishart_8hpp.html create mode 100644 doc/api/html/inv__wishart_8hpp_source.html create mode 100644 doc/api/html/inverse__softmax_8hpp.html create mode 100644 doc/api/html/inverse__softmax_8hpp_source.html create mode 100644 doc/api/html/inverse__spd_8hpp.html create mode 100644 doc/api/html/inverse__spd_8hpp_source.html create mode 100644 doc/api/html/io_2util_8hpp.html create mode 100644 doc/api/html/io_2util_8hpp_source.html create mode 100644 doc/api/html/io_8hpp.html create mode 100644 doc/api/html/io_8hpp_source.html create mode 100644 doc/api/html/iterator__typedefs_8hpp.html create mode 100644 doc/api/html/iterator__typedefs_8hpp_source.html create mode 100644 doc/api/html/jacobian_8hpp.html create mode 100644 doc/api/html/jacobian_8hpp_source.html create mode 100644 doc/api/html/jquery.js create mode 100644 doc/api/html/list__argument_8hpp.html create mode 100644 doc/api/html/list__argument_8hpp_source.html create mode 100644 doc/api/html/lkj__corr_8hpp.html create mode 100644 doc/api/html/lkj__corr_8hpp_source.html create mode 100644 doc/api/html/lkj__cov_8hpp.html create mode 100644 doc/api/html/lkj__cov_8hpp_source.html create mode 100644 doc/api/html/logical__and_8hpp.html create mode 100644 doc/api/html/logical__and_8hpp_source.html create mode 100644 doc/api/html/logical__eq_8hpp.html create mode 100644 doc/api/html/logical__eq_8hpp_source.html create mode 100644 doc/api/html/logical__gt_8hpp.html create mode 100644 doc/api/html/logical__gt_8hpp_source.html create mode 100644 doc/api/html/logical__gte_8hpp.html create mode 100644 doc/api/html/logical__gte_8hpp_source.html create mode 100644 doc/api/html/logical__lt_8hpp.html create mode 100644 doc/api/html/logical__lt_8hpp_source.html create mode 100644 doc/api/html/logical__lte_8hpp.html create mode 100644 doc/api/html/logical__lte_8hpp_source.html create mode 100644 doc/api/html/logical__negation_8hpp.html create mode 100644 doc/api/html/logical__negation_8hpp_source.html create mode 100644 doc/api/html/logical__neq_8hpp.html create mode 100644 doc/api/html/logical__neq_8hpp_source.html create mode 100644 doc/api/html/logical__or_8hpp.html create mode 100644 doc/api/html/logical__or_8hpp_source.html create mode 100644 doc/api/html/logistic_8hpp.html create mode 100644 doc/api/html/logistic_8hpp_source.html create mode 100644 doc/api/html/lognormal_8hpp.html create mode 100644 doc/api/html/lognormal_8hpp_source.html create mode 100644 doc/api/html/mainpage_8dox.html create mode 100644 doc/api/html/math_2constants_8hpp.html create mode 100644 doc/api/html/math_2constants_8hpp_source.html create mode 100644 doc/api/html/math_2error__handling_2matrix_2check__pos__definite_8hpp.html create mode 100644 doc/api/html/math_2error__handling_2matrix_2check__pos__definite_8hpp_source.html create mode 100644 doc/api/html/math_2error__handling_8hpp.html create mode 100644 doc/api/html/math_2error__handling_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2_phi_8hpp.html create mode 100644 doc/api/html/math_2functions_2_phi_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2_phi__approx_8hpp.html create mode 100644 doc/api/html/math_2functions_2_phi__approx_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2abs_8hpp.html create mode 100644 doc/api/html/math_2functions_2abs_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2as__bool_8hpp.html create mode 100644 doc/api/html/math_2functions_2as__bool_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2bessel__first__kind_8hpp.html create mode 100644 doc/api/html/math_2functions_2bessel__first__kind_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2bessel__second__kind_8hpp.html create mode 100644 doc/api/html/math_2functions_2bessel__second__kind_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2binary__log__loss_8hpp.html create mode 100644 doc/api/html/math_2functions_2binary__log__loss_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2binomial__coefficient__log_8hpp.html create mode 100644 doc/api/html/math_2functions_2binomial__coefficient__log_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2digamma_8hpp.html create mode 100644 doc/api/html/math_2functions_2digamma_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2dot__self_8hpp.html create mode 100644 doc/api/html/math_2functions_2dot__self_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2exp2_8hpp.html create mode 100644 doc/api/html/math_2functions_2exp2_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2falling__factorial_8hpp.html create mode 100644 doc/api/html/math_2functions_2falling__factorial_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2fdim_8hpp.html create mode 100644 doc/api/html/math_2functions_2fdim_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2fma_8hpp.html create mode 100644 doc/api/html/math_2functions_2fma_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2gamma__p_8hpp.html create mode 100644 doc/api/html/math_2functions_2gamma__p_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2gamma__q_8hpp.html create mode 100644 doc/api/html/math_2functions_2gamma__q_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2ibeta_8hpp.html create mode 100644 doc/api/html/math_2functions_2ibeta_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2if__else_8hpp.html create mode 100644 doc/api/html/math_2functions_2if__else_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2inv_8hpp.html create mode 100644 doc/api/html/math_2functions_2inv_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2inv__cloglog_8hpp.html create mode 100644 doc/api/html/math_2functions_2inv__cloglog_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2inv__logit_8hpp.html create mode 100644 doc/api/html/math_2functions_2inv__logit_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2inv__sqrt_8hpp.html create mode 100644 doc/api/html/math_2functions_2inv__sqrt_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2inv__square_8hpp.html create mode 100644 doc/api/html/math_2functions_2inv__square_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2is__uninitialized_8hpp.html create mode 100644 doc/api/html/math_2functions_2is__uninitialized_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2lbeta_8hpp.html create mode 100644 doc/api/html/math_2functions_2lbeta_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2lgamma_8hpp.html create mode 100644 doc/api/html/math_2functions_2lgamma_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2lmgamma_8hpp.html create mode 100644 doc/api/html/math_2functions_2lmgamma_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2log1m_8hpp.html create mode 100644 doc/api/html/math_2functions_2log1m_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2log1m__exp_8hpp.html create mode 100644 doc/api/html/math_2functions_2log1m__exp_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2log1m__inv__logit_8hpp.html create mode 100644 doc/api/html/math_2functions_2log1m__inv__logit_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2log1p_8hpp.html create mode 100644 doc/api/html/math_2functions_2log1p_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2log1p__exp_8hpp.html create mode 100644 doc/api/html/math_2functions_2log1p__exp_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2log2_8hpp.html create mode 100644 doc/api/html/math_2functions_2log2_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2log__diff__exp_8hpp.html create mode 100644 doc/api/html/math_2functions_2log__diff__exp_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2log__falling__factorial_8hpp.html create mode 100644 doc/api/html/math_2functions_2log__falling__factorial_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2log__inv__logit_8hpp.html create mode 100644 doc/api/html/math_2functions_2log__inv__logit_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2log__rising__factorial_8hpp.html create mode 100644 doc/api/html/math_2functions_2log__rising__factorial_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2log__sum__exp_8hpp.html create mode 100644 doc/api/html/math_2functions_2log__sum__exp_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2logit_8hpp.html create mode 100644 doc/api/html/math_2functions_2logit_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2modified__bessel__first__kind_8hpp.html create mode 100644 doc/api/html/math_2functions_2modified__bessel__first__kind_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2modified__bessel__second__kind_8hpp.html create mode 100644 doc/api/html/math_2functions_2modified__bessel__second__kind_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2multiply__log_8hpp.html create mode 100644 doc/api/html/math_2functions_2multiply__log_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2owens__t_8hpp.html create mode 100644 doc/api/html/math_2functions_2owens__t_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2rising__factorial_8hpp.html create mode 100644 doc/api/html/math_2functions_2rising__factorial_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2square_8hpp.html create mode 100644 doc/api/html/math_2functions_2square_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2step_8hpp.html create mode 100644 doc/api/html/math_2functions_2step_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2sum_8hpp.html create mode 100644 doc/api/html/math_2functions_2sum_8hpp_source.html create mode 100644 doc/api/html/math_2functions_2value__of_8hpp.html create mode 100644 doc/api/html/math_2functions_2value__of_8hpp_source.html create mode 100644 doc/api/html/math_2functions_8hpp.html create mode 100644 doc/api/html/math_2functions_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2columns__dot__product_8hpp.html create mode 100644 doc/api/html/math_2matrix_2columns__dot__product_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2columns__dot__self_8hpp.html create mode 100644 doc/api/html/math_2matrix_2columns__dot__self_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2crossprod_8hpp.html create mode 100644 doc/api/html/math_2matrix_2crossprod_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2determinant_8hpp.html create mode 100644 doc/api/html/math_2matrix_2determinant_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2divide_8hpp.html create mode 100644 doc/api/html/math_2matrix_2divide_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2dot__product_8hpp.html create mode 100644 doc/api/html/math_2matrix_2dot__product_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2dot__self_8hpp.html create mode 100644 doc/api/html/math_2matrix_2dot__self_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2exp_8hpp.html create mode 100644 doc/api/html/math_2matrix_2exp_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2inverse_8hpp.html create mode 100644 doc/api/html/math_2matrix_2inverse_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2ldlt_8hpp.html create mode 100644 doc/api/html/math_2matrix_2ldlt_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2log_8hpp.html create mode 100644 doc/api/html/math_2matrix_2log_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2log__determinant_8hpp.html create mode 100644 doc/api/html/math_2matrix_2log__determinant_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2log__determinant__spd_8hpp.html create mode 100644 doc/api/html/math_2matrix_2log__determinant__spd_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2log__softmax_8hpp.html create mode 100644 doc/api/html/math_2matrix_2log__softmax_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2log__sum__exp_8hpp.html create mode 100644 doc/api/html/math_2matrix_2log__sum__exp_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2mdivide__left_8hpp.html create mode 100644 doc/api/html/math_2matrix_2mdivide__left_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2mdivide__left__spd_8hpp.html create mode 100644 doc/api/html/math_2matrix_2mdivide__left__spd_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2mdivide__left__tri_8hpp.html create mode 100644 doc/api/html/math_2matrix_2mdivide__left__tri_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2mdivide__left__tri__low_8hpp.html create mode 100644 doc/api/html/math_2matrix_2mdivide__left__tri__low_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2mdivide__right_8hpp.html create mode 100644 doc/api/html/math_2matrix_2mdivide__right_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2mdivide__right__tri__low_8hpp.html create mode 100644 doc/api/html/math_2matrix_2mdivide__right__tri__low_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2multiply_8hpp.html create mode 100644 doc/api/html/math_2matrix_2multiply_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2multiply__lower__tri__self__transpose_8hpp.html create mode 100644 doc/api/html/math_2matrix_2multiply__lower__tri__self__transpose_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2quad__form_8hpp.html create mode 100644 doc/api/html/math_2matrix_2quad__form_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2rows__dot__product_8hpp.html create mode 100644 doc/api/html/math_2matrix_2rows__dot__product_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2rows__dot__self_8hpp.html create mode 100644 doc/api/html/math_2matrix_2rows__dot__self_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2sd_8hpp.html create mode 100644 doc/api/html/math_2matrix_2sd_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2softmax_8hpp.html create mode 100644 doc/api/html/math_2matrix_2softmax_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2sort_8hpp.html create mode 100644 doc/api/html/math_2matrix_2sort_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2squared__dist_8hpp.html create mode 100644 doc/api/html/math_2matrix_2squared__dist_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2stan__print_8hpp.html create mode 100644 doc/api/html/math_2matrix_2stan__print_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2sum_8hpp.html create mode 100644 doc/api/html/math_2matrix_2sum_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2tcrossprod_8hpp.html create mode 100644 doc/api/html/math_2matrix_2tcrossprod_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2trace__gen__quad__form_8hpp.html create mode 100644 doc/api/html/math_2matrix_2trace__gen__quad__form_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2trace__quad__form_8hpp.html create mode 100644 doc/api/html/math_2matrix_2trace__quad__form_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2typedefs_8hpp.html create mode 100644 doc/api/html/math_2matrix_2typedefs_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_2variance_8hpp.html create mode 100644 doc/api/html/math_2matrix_2variance_8hpp_source.html create mode 100644 doc/api/html/math_2matrix_8hpp.html create mode 100644 doc/api/html/math_2matrix_8hpp_source.html create mode 100644 doc/api/html/math_8hpp.html create mode 100644 doc/api/html/math_8hpp_source.html create mode 100644 doc/api/html/matrix_2dist_8hpp.html create mode 100644 doc/api/html/matrix_2dist_8hpp_source.html create mode 100644 doc/api/html/matrix_2max_8hpp.html create mode 100644 doc/api/html/matrix_2max_8hpp_source.html create mode 100644 doc/api/html/matrix_2min_8hpp.html create mode 100644 doc/api/html/matrix_2min_8hpp_source.html create mode 100644 doc/api/html/matrix__error__handling_8hpp.html create mode 100644 doc/api/html/matrix__error__handling_8hpp_source.html create mode 100644 doc/api/html/matrix__normal_8hpp.html create mode 100644 doc/api/html/matrix__normal_8hpp_source.html create mode 100644 doc/api/html/matrix__vari_8hpp.html create mode 100644 doc/api/html/matrix__vari_8hpp_source.html create mode 100644 doc/api/html/mcmc_8hpp.html create mode 100644 doc/api/html/mcmc_8hpp_source.html create mode 100644 doc/api/html/mcmc__writer_8hpp.html create mode 100644 doc/api/html/mcmc__writer_8hpp_source.html create mode 100644 doc/api/html/mdivide__right__spd_8hpp.html create mode 100644 doc/api/html/mdivide__right__spd_8hpp_source.html create mode 100644 doc/api/html/mdivide__right__tri_8hpp.html create mode 100644 doc/api/html/mdivide__right__tri_8hpp_source.html create mode 100644 doc/api/html/mean_8hpp.html create mode 100644 doc/api/html/mean_8hpp_source.html create mode 100644 doc/api/html/memory_8hpp.html create mode 100644 doc/api/html/memory_8hpp_source.html create mode 100644 doc/api/html/meta_2traits_8hpp.html create mode 100644 doc/api/html/meta_2traits_8hpp_source.html create mode 100644 doc/api/html/meta_8hpp.html create mode 100644 doc/api/html/meta_8hpp_source.html create mode 100644 doc/api/html/minus_8hpp.html create mode 100644 doc/api/html/minus_8hpp_source.html create mode 100644 doc/api/html/model_2util_8hpp.html create mode 100644 doc/api/html/model_2util_8hpp_source.html create mode 100644 doc/api/html/model_8hpp.html create mode 100644 doc/api/html/model_8hpp_source.html create mode 100644 doc/api/html/model__header_8hpp.html create mode 100644 doc/api/html/model__header_8hpp_source.html create mode 100644 doc/api/html/multi__gp_8hpp.html create mode 100644 doc/api/html/multi__gp_8hpp_source.html create mode 100644 doc/api/html/multi__normal_8hpp.html create mode 100644 doc/api/html/multi__normal_8hpp_source.html create mode 100644 doc/api/html/multi__normal__cholesky_8hpp.html create mode 100644 doc/api/html/multi__normal__cholesky_8hpp_source.html create mode 100644 doc/api/html/multi__normal__prec_8hpp.html create mode 100644 doc/api/html/multi__normal__prec_8hpp_source.html create mode 100644 doc/api/html/multi__student__t_8hpp.html create mode 100644 doc/api/html/multi__student__t_8hpp_source.html create mode 100644 doc/api/html/multinomial_8hpp.html create mode 100644 doc/api/html/multinomial_8hpp_source.html create mode 100644 doc/api/html/multivariate_2continuous_8hpp.html create mode 100644 doc/api/html/multivariate_2continuous_8hpp_source.html create mode 100644 doc/api/html/multivariate_2discrete_8hpp.html create mode 100644 doc/api/html/multivariate_2discrete_8hpp_source.html create mode 100644 doc/api/html/multivariate_8hpp.html create mode 100644 doc/api/html/multivariate_8hpp_source.html create mode 100644 doc/api/html/namespace_eigen.html create mode 100644 doc/api/html/namespace_eigen_1_1internal.html create mode 100644 doc/api/html/namespaceboost.html create mode 100644 doc/api/html/namespaceboost_1_1math.html create mode 100644 doc/api/html/namespacemembers.html create mode 100644 doc/api/html/namespacemembers_0x62.html create mode 100644 doc/api/html/namespacemembers_0x63.html create mode 100644 doc/api/html/namespacemembers_0x64.html create mode 100644 doc/api/html/namespacemembers_0x65.html create mode 100644 doc/api/html/namespacemembers_0x66.html create mode 100644 doc/api/html/namespacemembers_0x67.html create mode 100644 doc/api/html/namespacemembers_0x68.html create mode 100644 doc/api/html/namespacemembers_0x69.html create mode 100644 doc/api/html/namespacemembers_0x6a.html create mode 100644 doc/api/html/namespacemembers_0x6c.html create mode 100644 doc/api/html/namespacemembers_0x6d.html create mode 100644 doc/api/html/namespacemembers_0x6e.html create mode 100644 doc/api/html/namespacemembers_0x6f.html create mode 100644 doc/api/html/namespacemembers_0x70.html create mode 100644 doc/api/html/namespacemembers_0x71.html create mode 100644 doc/api/html/namespacemembers_0x72.html create mode 100644 doc/api/html/namespacemembers_0x73.html create mode 100644 doc/api/html/namespacemembers_0x74.html create mode 100644 doc/api/html/namespacemembers_0x75.html create mode 100644 doc/api/html/namespacemembers_0x76.html create mode 100644 doc/api/html/namespacemembers_0x77.html create mode 100644 doc/api/html/namespacemembers_func.html create mode 100644 doc/api/html/namespacemembers_func_0x62.html create mode 100644 doc/api/html/namespacemembers_func_0x63.html create mode 100644 doc/api/html/namespacemembers_func_0x64.html create mode 100644 doc/api/html/namespacemembers_func_0x65.html create mode 100644 doc/api/html/namespacemembers_func_0x66.html create mode 100644 doc/api/html/namespacemembers_func_0x67.html create mode 100644 doc/api/html/namespacemembers_func_0x68.html create mode 100644 doc/api/html/namespacemembers_func_0x69.html create mode 100644 doc/api/html/namespacemembers_func_0x6a.html create mode 100644 doc/api/html/namespacemembers_func_0x6c.html create mode 100644 doc/api/html/namespacemembers_func_0x6d.html create mode 100644 doc/api/html/namespacemembers_func_0x6e.html create mode 100644 doc/api/html/namespacemembers_func_0x6f.html create mode 100644 doc/api/html/namespacemembers_func_0x70.html create mode 100644 doc/api/html/namespacemembers_func_0x71.html create mode 100644 doc/api/html/namespacemembers_func_0x72.html create mode 100644 doc/api/html/namespacemembers_func_0x73.html create mode 100644 doc/api/html/namespacemembers_func_0x74.html create mode 100644 doc/api/html/namespacemembers_func_0x75.html create mode 100644 doc/api/html/namespacemembers_func_0x76.html create mode 100644 doc/api/html/namespacemembers_func_0x77.html create mode 100644 doc/api/html/namespacemembers_type.html create mode 100644 doc/api/html/namespacemembers_vars.html create mode 100644 doc/api/html/namespaces.html create mode 100644 doc/api/html/namespacestan.html create mode 100644 doc/api/html/namespacestan_1_1agrad.html create mode 100644 doc/api/html/namespacestan_1_1gm.html create mode 100644 doc/api/html/namespacestan_1_1io.html create mode 100644 doc/api/html/namespacestan_1_1math.html create mode 100644 doc/api/html/namespacestan_1_1math_1_1policies.html create mode 100644 doc/api/html/namespacestan_1_1math_1_1policies_1_1detail.html create mode 100644 doc/api/html/namespacestan_1_1mcmc.html create mode 100644 doc/api/html/namespacestan_1_1memory.html create mode 100644 doc/api/html/namespacestan_1_1model.html create mode 100644 doc/api/html/namespacestan_1_1optimization.html create mode 100644 doc/api/html/namespacestan_1_1prob.html create mode 100644 doc/api/html/namespacestd.html create mode 100644 doc/api/html/nav_f.png create mode 100644 doc/api/html/nav_g.png create mode 100644 doc/api/html/nav_h.png create mode 100644 doc/api/html/neg__binomial_8hpp.html create mode 100644 doc/api/html/neg__binomial_8hpp_source.html create mode 100644 doc/api/html/nesterov__gradient_8hpp.html create mode 100644 doc/api/html/nesterov__gradient_8hpp_source.html create mode 100644 doc/api/html/newton_8hpp.html create mode 100644 doc/api/html/newton_8hpp_source.html create mode 100644 doc/api/html/open.png create mode 100644 doc/api/html/operator__divide__equal_8hpp.html create mode 100644 doc/api/html/operator__divide__equal_8hpp_source.html create mode 100644 doc/api/html/operator__minus__equal_8hpp.html create mode 100644 doc/api/html/operator__minus__equal_8hpp_source.html create mode 100644 doc/api/html/operator__multiply__equal_8hpp.html create mode 100644 doc/api/html/operator__multiply__equal_8hpp_source.html create mode 100644 doc/api/html/operator__plus__equal_8hpp.html create mode 100644 doc/api/html/operator__plus__equal_8hpp_source.html create mode 100644 doc/api/html/operator__unary__decrement_8hpp.html create mode 100644 doc/api/html/operator__unary__decrement_8hpp_source.html create mode 100644 doc/api/html/operator__unary__increment_8hpp.html create mode 100644 doc/api/html/operator__unary__increment_8hpp_source.html create mode 100644 doc/api/html/operator__unary__minus_8hpp.html create mode 100644 doc/api/html/operator__unary__minus_8hpp_source.html create mode 100644 doc/api/html/operator__unary__negative_8hpp.html create mode 100644 doc/api/html/operator__unary__negative_8hpp_source.html create mode 100644 doc/api/html/operator__unary__not_8hpp.html create mode 100644 doc/api/html/operator__unary__not_8hpp_source.html create mode 100644 doc/api/html/operator__unary__plus_8hpp.html create mode 100644 doc/api/html/operator__unary__plus_8hpp_source.html create mode 100644 doc/api/html/ordered__logistic_8hpp.html create mode 100644 doc/api/html/ordered__logistic_8hpp_source.html create mode 100644 doc/api/html/pages.html create mode 100644 doc/api/html/pareto_8hpp.html create mode 100644 doc/api/html/pareto_8hpp_source.html create mode 100644 doc/api/html/parser_8hpp.html create mode 100644 doc/api/html/parser_8hpp_source.html create mode 100644 doc/api/html/partials__vari_8hpp.html create mode 100644 doc/api/html/partials__vari_8hpp_source.html create mode 100644 doc/api/html/poisson_8hpp.html create mode 100644 doc/api/html/poisson_8hpp_source.html create mode 100644 doc/api/html/policy_page.html create mode 100644 doc/api/html/precomp__v__vari_8hpp.html create mode 100644 doc/api/html/precomp__v__vari_8hpp_source.html create mode 100644 doc/api/html/print_8cpp.html create mode 100644 doc/api/html/print_8cpp_source.html create mode 100644 doc/api/html/print_8hpp.html create mode 100644 doc/api/html/print_8hpp_source.html create mode 100644 doc/api/html/print__stack_8hpp.html create mode 100644 doc/api/html/print__stack_8hpp_source.html create mode 100644 doc/api/html/prob_2constants_8hpp.html create mode 100644 doc/api/html/prob_2constants_8hpp_source.html create mode 100644 doc/api/html/prob_2distributions_2univariate_2continuous_2normal_8hpp.html create mode 100644 doc/api/html/prob_2distributions_2univariate_2continuous_2normal_8hpp_source.html create mode 100644 doc/api/html/prob_2traits_8hpp.html create mode 100644 doc/api/html/prob_2traits_8hpp_source.html create mode 100644 doc/api/html/prob_8hpp.html create mode 100644 doc/api/html/prob_8hpp_source.html create mode 100644 doc/api/html/prob__grad_8hpp.html create mode 100644 doc/api/html/prob__grad_8hpp_source.html create mode 100644 doc/api/html/prod_8hpp.html create mode 100644 doc/api/html/prod_8hpp_source.html create mode 100644 doc/api/html/program__grammar_8hpp.html create mode 100644 doc/api/html/program__grammar_8hpp_source.html create mode 100644 doc/api/html/program__grammar__def_8hpp.html create mode 100644 doc/api/html/program__grammar__def_8hpp_source.html create mode 100644 doc/api/html/program__grammar__inst_8cpp.html create mode 100644 doc/api/html/program__grammar__inst_8cpp_source.html create mode 100644 doc/api/html/promote__common_8hpp.html create mode 100644 doc/api/html/promote__common_8hpp_source.html create mode 100644 doc/api/html/promoter_8hpp.html create mode 100644 doc/api/html/promoter_8hpp_source.html create mode 100644 doc/api/html/ps__point_8hpp.html create mode 100644 doc/api/html/ps__point_8hpp_source.html create mode 100644 doc/api/html/raise__domain__error_8hpp.html create mode 100644 doc/api/html/raise__domain__error_8hpp_source.html create mode 100644 doc/api/html/rank_8hpp.html create mode 100644 doc/api/html/rank_8hpp_source.html create mode 100644 doc/api/html/rayleigh_8hpp.html create mode 100644 doc/api/html/rayleigh_8hpp_source.html create mode 100644 doc/api/html/reader_8hpp.html create mode 100644 doc/api/html/reader_8hpp_source.html create mode 100644 doc/api/html/rep__array_8hpp.html create mode 100644 doc/api/html/rep__array_8hpp_source.html create mode 100644 doc/api/html/rep__matrix_8hpp.html create mode 100644 doc/api/html/rep__matrix_8hpp_source.html create mode 100644 doc/api/html/rep__row__vector_8hpp.html create mode 100644 doc/api/html/rep__row__vector_8hpp_source.html create mode 100644 doc/api/html/rep__vector_8hpp.html create mode 100644 doc/api/html/rep__vector_8hpp_source.html create mode 100644 doc/api/html/resize_8hpp.html create mode 100644 doc/api/html/resize_8hpp_source.html create mode 100644 doc/api/html/rev_2functions_2acos_8hpp.html create mode 100644 doc/api/html/rev_2functions_2acos_8hpp_source.html create mode 100644 doc/api/html/rev_2functions_2acosh_8hpp.html create mode 100644 doc/api/html/rev_2functions_2acosh_8hpp_source.html create mode 100644 doc/api/html/rev_2functions_2asin_8hpp.html create mode 100644 doc/api/html/rev_2functions_2asin_8hpp_source.html create mode 100644 doc/api/html/rev_2functions_2asinh_8hpp.html create mode 100644 doc/api/html/rev_2functions_2asinh_8hpp_source.html create mode 100644 doc/api/html/rev_2functions_2atan2_8hpp.html create mode 100644 doc/api/html/rev_2functions_2atan2_8hpp_source.html create mode 100644 doc/api/html/rev_2functions_2atan_8hpp.html create mode 100644 doc/api/html/rev_2functions_2atan_8hpp_source.html create mode 100644 doc/api/html/rev_2functions_2atanh_8hpp.html create mode 100644 doc/api/html/rev_2functions_2atanh_8hpp_source.html create mode 100644 doc/api/html/rev_2functions_2cbrt_8hpp.html create mode 100644 doc/api/html/rev_2functions_2cbrt_8hpp_source.html create mode 100644 doc/api/html/rev_2functions_2ceil_8hpp.html create mode 100644 doc/api/html/rev_2functions_2ceil_8hpp_source.html create mode 100644 doc/api/html/rev_2functions_2cos_8hpp.html create mode 100644 doc/api/html/rev_2functions_2cos_8hpp_source.html create mode 100644 doc/api/html/rev_2functions_2cosh_8hpp.html create mode 100644 doc/api/html/rev_2functions_2cosh_8hpp_source.html create mode 100644 doc/api/html/rev_2functions_2erf_8hpp.html create mode 100644 doc/api/html/rev_2functions_2erf_8hpp_source.html create mode 100644 doc/api/html/rev_2functions_2erfc_8hpp.html create mode 100644 doc/api/html/rev_2functions_2erfc_8hpp_source.html create mode 100644 doc/api/html/rev_2functions_2expm1_8hpp.html create mode 100644 doc/api/html/rev_2functions_2expm1_8hpp_source.html create mode 100644 doc/api/html/rev_2functions_2fabs_8hpp.html create mode 100644 doc/api/html/rev_2functions_2fabs_8hpp_source.html create mode 100644 doc/api/html/rev_2functions_2floor_8hpp.html create mode 100644 doc/api/html/rev_2functions_2floor_8hpp_source.html create mode 100644 doc/api/html/rev_2functions_2fmax_8hpp.html create mode 100644 doc/api/html/rev_2functions_2fmax_8hpp_source.html create mode 100644 doc/api/html/rev_2functions_2fmin_8hpp.html create mode 100644 doc/api/html/rev_2functions_2fmin_8hpp_source.html create mode 100644 doc/api/html/rev_2functions_2fmod_8hpp.html create mode 100644 doc/api/html/rev_2functions_2fmod_8hpp_source.html create mode 100644 doc/api/html/rev_2functions_2hypot_8hpp.html create mode 100644 doc/api/html/rev_2functions_2hypot_8hpp_source.html create mode 100644 doc/api/html/rev_2functions_2log10_8hpp.html create mode 100644 doc/api/html/rev_2functions_2log10_8hpp_source.html create mode 100644 doc/api/html/rev_2functions_2pow_8hpp.html create mode 100644 doc/api/html/rev_2functions_2pow_8hpp_source.html create mode 100644 doc/api/html/rev_2functions_2round_8hpp.html create mode 100644 doc/api/html/rev_2functions_2round_8hpp_source.html create mode 100644 doc/api/html/rev_2functions_2sin_8hpp.html create mode 100644 doc/api/html/rev_2functions_2sin_8hpp_source.html create mode 100644 doc/api/html/rev_2functions_2sinh_8hpp.html create mode 100644 doc/api/html/rev_2functions_2sinh_8hpp_source.html create mode 100644 doc/api/html/rev_2functions_2sqrt_8hpp.html create mode 100644 doc/api/html/rev_2functions_2sqrt_8hpp_source.html create mode 100644 doc/api/html/rev_2functions_2tan_8hpp.html create mode 100644 doc/api/html/rev_2functions_2tan_8hpp_source.html create mode 100644 doc/api/html/rev_2functions_2tanh_8hpp.html create mode 100644 doc/api/html/rev_2functions_2tanh_8hpp_source.html create mode 100644 doc/api/html/rev_2functions_2tgamma_8hpp.html create mode 100644 doc/api/html/rev_2functions_2tgamma_8hpp_source.html create mode 100644 doc/api/html/rev_2functions_2trunc_8hpp.html create mode 100644 doc/api/html/rev_2functions_2trunc_8hpp_source.html create mode 100644 doc/api/html/rev_2numeric__limits_8hpp.html create mode 100644 doc/api/html/rev_2numeric__limits_8hpp_source.html create mode 100644 doc/api/html/rev_2operators_2operator__addition_8hpp.html create mode 100644 doc/api/html/rev_2operators_2operator__addition_8hpp_source.html create mode 100644 doc/api/html/rev_2operators_2operator__division_8hpp.html create mode 100644 doc/api/html/rev_2operators_2operator__division_8hpp_source.html create mode 100644 doc/api/html/rev_2operators_2operator__equal_8hpp.html create mode 100644 doc/api/html/rev_2operators_2operator__equal_8hpp_source.html create mode 100644 doc/api/html/rev_2operators_2operator__greater__than_8hpp.html create mode 100644 doc/api/html/rev_2operators_2operator__greater__than_8hpp_source.html create mode 100644 doc/api/html/rev_2operators_2operator__greater__than__or__equal_8hpp.html create mode 100644 doc/api/html/rev_2operators_2operator__greater__than__or__equal_8hpp_source.html create mode 100644 doc/api/html/rev_2operators_2operator__less__than_8hpp.html create mode 100644 doc/api/html/rev_2operators_2operator__less__than_8hpp_source.html create mode 100644 doc/api/html/rev_2operators_2operator__less__than__or__equal_8hpp.html create mode 100644 doc/api/html/rev_2operators_2operator__less__than__or__equal_8hpp_source.html create mode 100644 doc/api/html/rev_2operators_2operator__multiplication_8hpp.html create mode 100644 doc/api/html/rev_2operators_2operator__multiplication_8hpp_source.html create mode 100644 doc/api/html/rev_2operators_2operator__not__equal_8hpp.html create mode 100644 doc/api/html/rev_2operators_2operator__not__equal_8hpp_source.html create mode 100644 doc/api/html/rev_2operators_2operator__subtraction_8hpp.html create mode 100644 doc/api/html/rev_2operators_2operator__subtraction_8hpp_source.html create mode 100644 doc/api/html/rev_2operators_8hpp.html create mode 100644 doc/api/html/rev_2operators_8hpp_source.html create mode 100644 doc/api/html/rev_8hpp.html create mode 100644 doc/api/html/rev_8hpp_source.html create mode 100644 doc/api/html/row_8hpp.html create mode 100644 doc/api/html/row_8hpp_source.html create mode 100644 doc/api/html/rows_8hpp.html create mode 100644 doc/api/html/rows_8hpp_source.html create mode 100644 doc/api/html/sample_8hpp.html create mode 100644 doc/api/html/sample_8hpp_source.html create mode 100644 doc/api/html/scaled__add_8hpp.html create mode 100644 doc/api/html/scaled__add_8hpp_source.html create mode 100644 doc/api/html/scaled__inv__chi__square_8hpp.html create mode 100644 doc/api/html/scaled__inv__chi__square_8hpp_source.html create mode 100644 doc/api/html/search/all_5f.html create mode 100644 doc/api/html/search/all_5f.js create mode 100644 doc/api/html/search/all_61.html create mode 100644 doc/api/html/search/all_61.js create mode 100644 doc/api/html/search/all_62.html create mode 100644 doc/api/html/search/all_62.js create mode 100644 doc/api/html/search/all_63.html create mode 100644 doc/api/html/search/all_63.js create mode 100644 doc/api/html/search/all_64.html create mode 100644 doc/api/html/search/all_64.js create mode 100644 doc/api/html/search/all_65.html create mode 100644 doc/api/html/search/all_65.js create mode 100644 doc/api/html/search/all_66.html create mode 100644 doc/api/html/search/all_66.js create mode 100644 doc/api/html/search/all_67.html create mode 100644 doc/api/html/search/all_67.js create mode 100644 doc/api/html/search/all_68.html create mode 100644 doc/api/html/search/all_68.js create mode 100644 doc/api/html/search/all_69.html create mode 100644 doc/api/html/search/all_69.js create mode 100644 doc/api/html/search/all_6a.html create mode 100644 doc/api/html/search/all_6a.js create mode 100644 doc/api/html/search/all_6b.html create mode 100644 doc/api/html/search/all_6b.js create mode 100644 doc/api/html/search/all_6c.html create mode 100644 doc/api/html/search/all_6c.js create mode 100644 doc/api/html/search/all_6d.html create mode 100644 doc/api/html/search/all_6d.js create mode 100644 doc/api/html/search/all_6e.html create mode 100644 doc/api/html/search/all_6e.js create mode 100644 doc/api/html/search/all_6f.html create mode 100644 doc/api/html/search/all_6f.js create mode 100644 doc/api/html/search/all_70.html create mode 100644 doc/api/html/search/all_70.js create mode 100644 doc/api/html/search/all_71.html create mode 100644 doc/api/html/search/all_71.js create mode 100644 doc/api/html/search/all_72.html create mode 100644 doc/api/html/search/all_72.js create mode 100644 doc/api/html/search/all_73.html create mode 100644 doc/api/html/search/all_73.js create mode 100644 doc/api/html/search/all_74.html create mode 100644 doc/api/html/search/all_74.js create mode 100644 doc/api/html/search/all_75.html create mode 100644 doc/api/html/search/all_75.js create mode 100644 doc/api/html/search/all_76.html create mode 100644 doc/api/html/search/all_76.js create mode 100644 doc/api/html/search/all_77.html create mode 100644 doc/api/html/search/all_77.js create mode 100644 doc/api/html/search/all_78.html create mode 100644 doc/api/html/search/all_78.js create mode 100644 doc/api/html/search/all_7a.html create mode 100644 doc/api/html/search/all_7a.js create mode 100644 doc/api/html/search/all_7e.html create mode 100644 doc/api/html/search/all_7e.js create mode 100644 doc/api/html/search/classes_61.html create mode 100644 doc/api/html/search/classes_61.js create mode 100644 doc/api/html/search/classes_62.html create mode 100644 doc/api/html/search/classes_62.js create mode 100644 doc/api/html/search/classes_63.html create mode 100644 doc/api/html/search/classes_63.js create mode 100644 doc/api/html/search/classes_64.html create mode 100644 doc/api/html/search/classes_64.js create mode 100644 doc/api/html/search/classes_65.html create mode 100644 doc/api/html/search/classes_65.js create mode 100644 doc/api/html/search/classes_66.html create mode 100644 doc/api/html/search/classes_66.js create mode 100644 doc/api/html/search/classes_67.html create mode 100644 doc/api/html/search/classes_67.js create mode 100644 doc/api/html/search/classes_69.html create mode 100644 doc/api/html/search/classes_69.js create mode 100644 doc/api/html/search/classes_6c.html create mode 100644 doc/api/html/search/classes_6c.js create mode 100644 doc/api/html/search/classes_6d.html create mode 100644 doc/api/html/search/classes_6d.js create mode 100644 doc/api/html/search/classes_6e.html create mode 100644 doc/api/html/search/classes_6e.js create mode 100644 doc/api/html/search/classes_6f.html create mode 100644 doc/api/html/search/classes_6f.js create mode 100644 doc/api/html/search/classes_70.html create mode 100644 doc/api/html/search/classes_70.js create mode 100644 doc/api/html/search/classes_72.html create mode 100644 doc/api/html/search/classes_72.js create mode 100644 doc/api/html/search/classes_73.html create mode 100644 doc/api/html/search/classes_73.js create mode 100644 doc/api/html/search/classes_74.html create mode 100644 doc/api/html/search/classes_74.js create mode 100644 doc/api/html/search/classes_75.html create mode 100644 doc/api/html/search/classes_75.js create mode 100644 doc/api/html/search/classes_76.html create mode 100644 doc/api/html/search/classes_76.js create mode 100644 doc/api/html/search/classes_77.html create mode 100644 doc/api/html/search/classes_77.js create mode 100644 doc/api/html/search/close.png create mode 100644 doc/api/html/search/defines_5f.html create mode 100644 doc/api/html/search/defines_5f.js create mode 100644 doc/api/html/search/defines_64.html create mode 100644 doc/api/html/search/defines_64.js create mode 100644 doc/api/html/search/defines_65.html create mode 100644 doc/api/html/search/defines_65.js create mode 100644 doc/api/html/search/defines_6c.html create mode 100644 doc/api/html/search/defines_6c.js create mode 100644 doc/api/html/search/defines_75.html create mode 100644 doc/api/html/search/defines_75.js create mode 100644 doc/api/html/search/enumvalues_61.html create mode 100644 doc/api/html/search/enumvalues_61.js create mode 100644 doc/api/html/search/enumvalues_63.html create mode 100644 doc/api/html/search/enumvalues_63.js create mode 100644 doc/api/html/search/enumvalues_64.html create mode 100644 doc/api/html/search/enumvalues_64.js create mode 100644 doc/api/html/search/enumvalues_68.html create mode 100644 doc/api/html/search/enumvalues_68.js create mode 100644 doc/api/html/search/enumvalues_69.html create mode 100644 doc/api/html/search/enumvalues_69.js create mode 100644 doc/api/html/search/enumvalues_6c.html create mode 100644 doc/api/html/search/enumvalues_6c.js create mode 100644 doc/api/html/search/enumvalues_6d.html create mode 100644 doc/api/html/search/enumvalues_6d.js create mode 100644 doc/api/html/search/enumvalues_6e.html create mode 100644 doc/api/html/search/enumvalues_6e.js create mode 100644 doc/api/html/search/enumvalues_6f.html create mode 100644 doc/api/html/search/enumvalues_6f.js create mode 100644 doc/api/html/search/enumvalues_72.html create mode 100644 doc/api/html/search/enumvalues_72.js create mode 100644 doc/api/html/search/enumvalues_73.html create mode 100644 doc/api/html/search/enumvalues_73.js create mode 100644 doc/api/html/search/enumvalues_75.html create mode 100644 doc/api/html/search/enumvalues_75.js create mode 100644 doc/api/html/search/enumvalues_76.html create mode 100644 doc/api/html/search/enumvalues_76.js create mode 100644 doc/api/html/search/files_61.html create mode 100644 doc/api/html/search/files_61.js create mode 100644 doc/api/html/search/files_62.html create mode 100644 doc/api/html/search/files_62.js create mode 100644 doc/api/html/search/files_63.html create mode 100644 doc/api/html/search/files_63.js create mode 100644 doc/api/html/search/files_64.html create mode 100644 doc/api/html/search/files_64.js create mode 100644 doc/api/html/search/files_65.html create mode 100644 doc/api/html/search/files_65.js create mode 100644 doc/api/html/search/files_66.html create mode 100644 doc/api/html/search/files_66.js create mode 100644 doc/api/html/search/files_67.html create mode 100644 doc/api/html/search/files_67.js create mode 100644 doc/api/html/search/files_68.html create mode 100644 doc/api/html/search/files_68.js create mode 100644 doc/api/html/search/files_69.html create mode 100644 doc/api/html/search/files_69.js create mode 100644 doc/api/html/search/files_6a.html create mode 100644 doc/api/html/search/files_6a.js create mode 100644 doc/api/html/search/files_6c.html create mode 100644 doc/api/html/search/files_6c.js create mode 100644 doc/api/html/search/files_6d.html create mode 100644 doc/api/html/search/files_6d.js create mode 100644 doc/api/html/search/files_6e.html create mode 100644 doc/api/html/search/files_6e.js create mode 100644 doc/api/html/search/files_6f.html create mode 100644 doc/api/html/search/files_6f.js create mode 100644 doc/api/html/search/files_70.html create mode 100644 doc/api/html/search/files_70.js create mode 100644 doc/api/html/search/files_71.html create mode 100644 doc/api/html/search/files_71.js create mode 100644 doc/api/html/search/files_72.html create mode 100644 doc/api/html/search/files_72.js create mode 100644 doc/api/html/search/files_73.html create mode 100644 doc/api/html/search/files_73.js create mode 100644 doc/api/html/search/files_74.html create mode 100644 doc/api/html/search/files_74.js create mode 100644 doc/api/html/search/files_75.html create mode 100644 doc/api/html/search/files_75.js create mode 100644 doc/api/html/search/files_76.html create mode 100644 doc/api/html/search/files_76.js create mode 100644 doc/api/html/search/files_77.html create mode 100644 doc/api/html/search/files_77.js create mode 100644 doc/api/html/search/functions_5f.html create mode 100644 doc/api/html/search/functions_5f.js create mode 100644 doc/api/html/search/functions_61.html create mode 100644 doc/api/html/search/functions_61.js create mode 100644 doc/api/html/search/functions_62.html create mode 100644 doc/api/html/search/functions_62.js create mode 100644 doc/api/html/search/functions_63.html create mode 100644 doc/api/html/search/functions_63.js create mode 100644 doc/api/html/search/functions_64.html create mode 100644 doc/api/html/search/functions_64.js create mode 100644 doc/api/html/search/functions_65.html create mode 100644 doc/api/html/search/functions_65.js create mode 100644 doc/api/html/search/functions_66.html create mode 100644 doc/api/html/search/functions_66.js create mode 100644 doc/api/html/search/functions_67.html create mode 100644 doc/api/html/search/functions_67.js create mode 100644 doc/api/html/search/functions_68.html create mode 100644 doc/api/html/search/functions_68.js create mode 100644 doc/api/html/search/functions_69.html create mode 100644 doc/api/html/search/functions_69.js create mode 100644 doc/api/html/search/functions_6a.html create mode 100644 doc/api/html/search/functions_6a.js create mode 100644 doc/api/html/search/functions_6b.html create mode 100644 doc/api/html/search/functions_6b.js create mode 100644 doc/api/html/search/functions_6c.html create mode 100644 doc/api/html/search/functions_6c.js create mode 100644 doc/api/html/search/functions_6d.html create mode 100644 doc/api/html/search/functions_6d.js create mode 100644 doc/api/html/search/functions_6e.html create mode 100644 doc/api/html/search/functions_6e.js create mode 100644 doc/api/html/search/functions_6f.html create mode 100644 doc/api/html/search/functions_6f.js create mode 100644 doc/api/html/search/functions_70.html create mode 100644 doc/api/html/search/functions_70.js create mode 100644 doc/api/html/search/functions_71.html create mode 100644 doc/api/html/search/functions_71.js create mode 100644 doc/api/html/search/functions_72.html create mode 100644 doc/api/html/search/functions_72.js create mode 100644 doc/api/html/search/functions_73.html create mode 100644 doc/api/html/search/functions_73.js create mode 100644 doc/api/html/search/functions_74.html create mode 100644 doc/api/html/search/functions_74.js create mode 100644 doc/api/html/search/functions_75.html create mode 100644 doc/api/html/search/functions_75.js create mode 100644 doc/api/html/search/functions_76.html create mode 100644 doc/api/html/search/functions_76.js create mode 100644 doc/api/html/search/functions_77.html create mode 100644 doc/api/html/search/functions_77.js create mode 100644 doc/api/html/search/functions_7a.html create mode 100644 doc/api/html/search/functions_7a.js create mode 100644 doc/api/html/search/functions_7e.html create mode 100644 doc/api/html/search/functions_7e.js create mode 100644 doc/api/html/search/mag_sel.png create mode 100644 doc/api/html/search/namespaces_62.html create mode 100644 doc/api/html/search/namespaces_62.js create mode 100644 doc/api/html/search/namespaces_65.html create mode 100644 doc/api/html/search/namespaces_65.js create mode 100644 doc/api/html/search/namespaces_73.html create mode 100644 doc/api/html/search/namespaces_73.js create mode 100644 doc/api/html/search/nomatches.html create mode 100644 doc/api/html/search/pages_65.html create mode 100644 doc/api/html/search/pages_65.js create mode 100644 doc/api/html/search/related_6f.html create mode 100644 doc/api/html/search/related_6f.js create mode 100644 doc/api/html/search/related_76.html create mode 100644 doc/api/html/search/related_76.js create mode 100644 doc/api/html/search/search.css create mode 100644 doc/api/html/search/search.js create mode 100644 doc/api/html/search/search_l.png create mode 100644 doc/api/html/search/search_m.png create mode 100644 doc/api/html/search/search_r.png create mode 100644 doc/api/html/search/typedefs_61.html create mode 100644 doc/api/html/search/typedefs_61.js create mode 100644 doc/api/html/search/typedefs_62.html create mode 100644 doc/api/html/search/typedefs_62.js create mode 100644 doc/api/html/search/typedefs_65.html create mode 100644 doc/api/html/search/typedefs_65.js create mode 100644 doc/api/html/search/typedefs_66.html create mode 100644 doc/api/html/search/typedefs_66.js create mode 100644 doc/api/html/search/typedefs_68.html create mode 100644 doc/api/html/search/typedefs_68.js create mode 100644 doc/api/html/search/typedefs_69.html create mode 100644 doc/api/html/search/typedefs_69.js create mode 100644 doc/api/html/search/typedefs_6c.html create mode 100644 doc/api/html/search/typedefs_6c.js create mode 100644 doc/api/html/search/typedefs_6d.html create mode 100644 doc/api/html/search/typedefs_6d.js create mode 100644 doc/api/html/search/typedefs_6e.html create mode 100644 doc/api/html/search/typedefs_6e.js create mode 100644 doc/api/html/search/typedefs_70.html create mode 100644 doc/api/html/search/typedefs_70.js create mode 100644 doc/api/html/search/typedefs_72.html create mode 100644 doc/api/html/search/typedefs_72.js create mode 100644 doc/api/html/search/typedefs_73.html create mode 100644 doc/api/html/search/typedefs_73.js create mode 100644 doc/api/html/search/typedefs_74.html create mode 100644 doc/api/html/search/typedefs_74.js create mode 100644 doc/api/html/search/typedefs_75.html create mode 100644 doc/api/html/search/typedefs_75.js create mode 100644 doc/api/html/search/typedefs_76.html create mode 100644 doc/api/html/search/typedefs_76.js create mode 100644 doc/api/html/search/variables_5f.html create mode 100644 doc/api/html/search/variables_5f.js create mode 100644 doc/api/html/search/variables_61.html create mode 100644 doc/api/html/search/variables_61.js create mode 100644 doc/api/html/search/variables_62.html create mode 100644 doc/api/html/search/variables_62.js create mode 100644 doc/api/html/search/variables_63.html create mode 100644 doc/api/html/search/variables_63.js create mode 100644 doc/api/html/search/variables_64.html create mode 100644 doc/api/html/search/variables_64.js create mode 100644 doc/api/html/search/variables_65.html create mode 100644 doc/api/html/search/variables_65.js create mode 100644 doc/api/html/search/variables_66.html create mode 100644 doc/api/html/search/variables_66.js create mode 100644 doc/api/html/search/variables_67.html create mode 100644 doc/api/html/search/variables_67.js create mode 100644 doc/api/html/search/variables_68.html create mode 100644 doc/api/html/search/variables_68.js create mode 100644 doc/api/html/search/variables_69.html create mode 100644 doc/api/html/search/variables_69.js create mode 100644 doc/api/html/search/variables_6b.html create mode 100644 doc/api/html/search/variables_6b.js create mode 100644 doc/api/html/search/variables_6c.html create mode 100644 doc/api/html/search/variables_6c.js create mode 100644 doc/api/html/search/variables_6d.html create mode 100644 doc/api/html/search/variables_6d.js create mode 100644 doc/api/html/search/variables_6e.html create mode 100644 doc/api/html/search/variables_6e.js create mode 100644 doc/api/html/search/variables_6f.html create mode 100644 doc/api/html/search/variables_6f.js create mode 100644 doc/api/html/search/variables_70.html create mode 100644 doc/api/html/search/variables_70.js create mode 100644 doc/api/html/search/variables_71.html create mode 100644 doc/api/html/search/variables_71.js create mode 100644 doc/api/html/search/variables_72.html create mode 100644 doc/api/html/search/variables_72.js create mode 100644 doc/api/html/search/variables_73.html create mode 100644 doc/api/html/search/variables_73.js create mode 100644 doc/api/html/search/variables_74.html create mode 100644 doc/api/html/search/variables_74.js create mode 100644 doc/api/html/search/variables_75.html create mode 100644 doc/api/html/search/variables_75.js create mode 100644 doc/api/html/search/variables_76.html create mode 100644 doc/api/html/search/variables_76.js create mode 100644 doc/api/html/search/variables_77.html create mode 100644 doc/api/html/search/variables_77.js create mode 100644 doc/api/html/search/variables_78.html create mode 100644 doc/api/html/search/variables_78.js create mode 100644 doc/api/html/segment_8hpp.html create mode 100644 doc/api/html/segment_8hpp_source.html create mode 100644 doc/api/html/seq__view_8hpp.html create mode 100644 doc/api/html/seq__view_8hpp_source.html create mode 100644 doc/api/html/singleton__argument_8hpp.html create mode 100644 doc/api/html/singleton__argument_8hpp_source.html create mode 100644 doc/api/html/singular__values_8hpp.html create mode 100644 doc/api/html/singular__values_8hpp_source.html create mode 100644 doc/api/html/size_8hpp.html create mode 100644 doc/api/html/size_8hpp_source.html create mode 100644 doc/api/html/skew__normal_8hpp.html create mode 100644 doc/api/html/skew__normal_8hpp_source.html create mode 100644 doc/api/html/stack__alloc_8hpp.html create mode 100644 doc/api/html/stack__alloc_8hpp_source.html create mode 100644 doc/api/html/stan_8dox.html create mode 100644 doc/api/html/stan__csv__reader_8hpp.html create mode 100644 doc/api/html/stan__csv__reader_8hpp_source.html create mode 100644 doc/api/html/stanc_8cpp.html create mode 100644 doc/api/html/stanc_8cpp_source.html create mode 100644 doc/api/html/stanc__helper_8hpp.html create mode 100644 doc/api/html/stanc__helper_8hpp_source.html create mode 100644 doc/api/html/stanlogo-main.png create mode 100644 doc/api/html/statement__2__grammar_8hpp.html create mode 100644 doc/api/html/statement__2__grammar_8hpp_source.html create mode 100644 doc/api/html/statement__2__grammar__def_8hpp.html create mode 100644 doc/api/html/statement__2__grammar__def_8hpp_source.html create mode 100644 doc/api/html/statement__2__grammar__inst_8cpp.html create mode 100644 doc/api/html/statement__2__grammar__inst_8cpp_source.html create mode 100644 doc/api/html/statement__grammar_8hpp.html create mode 100644 doc/api/html/statement__grammar_8hpp_source.html create mode 100644 doc/api/html/statement__grammar__def_8hpp.html create mode 100644 doc/api/html/statement__grammar__def_8hpp_source.html create mode 100644 doc/api/html/statement__grammar__inst_8cpp.html create mode 100644 doc/api/html/statement__grammar__inst_8cpp_source.html create mode 100644 doc/api/html/std_8dox.html create mode 100644 doc/api/html/stepsize__adaptation_8hpp.html create mode 100644 doc/api/html/stepsize__adaptation_8hpp_source.html create mode 100644 doc/api/html/stepsize__adapter_8hpp.html create mode 100644 doc/api/html/stepsize__adapter_8hpp_source.html create mode 100644 doc/api/html/stepsize__covar__adapter_8hpp.html create mode 100644 doc/api/html/stepsize__covar__adapter_8hpp_source.html create mode 100644 doc/api/html/stepsize__var__adapter_8hpp.html create mode 100644 doc/api/html/stepsize__var__adapter_8hpp_source.html create mode 100644 doc/api/html/stored__gradient__vari_8hpp.html create mode 100644 doc/api/html/stored__gradient__vari_8hpp_source.html create mode 100644 doc/api/html/struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4-members.html create mode 100644 doc/api/html/struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html create mode 100644 doc/api/html/struct_eigen_1_1internal_1_1general__matrix__matrix__product_3_01_index_00_01stan_1_1agrad_1_1va753d9f8f3d54fbedc22d657246672d94.html create mode 100644 doc/api/html/struct_eigen_1_1internal_1_1general__matrix__matrix__product_3_01_index_00_01stan_1_1agrad_1_1va9b485de9571b6e46d7a64aff43a6d9d3.html create mode 100644 doc/api/html/struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1va16fe21f36cb92096f2fc63d419437421.html create mode 100644 doc/api/html/struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1va3d1bc254c18abbf59c1006f7e7cbcbac.html create mode 100644 doc/api/html/struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1va44da5f98e1caea9523bacbd5bdc025fe.html create mode 100644 doc/api/html/struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1vacd54cabc78c49ca719650381b68b105e.html create mode 100644 doc/api/html/struct_eigen_1_1internal_1_1scalar__product__traits_3_01double_00_01stan_1_1agrad_1_1var_01_4-members.html create mode 100644 doc/api/html/struct_eigen_1_1internal_1_1scalar__product__traits_3_01double_00_01stan_1_1agrad_1_1var_01_4.html create mode 100644 doc/api/html/struct_eigen_1_1internal_1_1scalar__product__traits_3_01stan_1_1agrad_1_1var_00_01double_01_4-members.html create mode 100644 doc/api/html/struct_eigen_1_1internal_1_1scalar__product__traits_3_01stan_1_1agrad_1_1var_00_01double_01_4.html create mode 100644 doc/api/html/struct_eigen_1_1internal_1_1significant__decimals__default__impl_3_01stan_1_1agrad_1_1var_00_01false_01_4-members.html create mode 100644 doc/api/html/struct_eigen_1_1internal_1_1significant__decimals__default__impl_3_01stan_1_1agrad_1_1var_00_01false_01_4.html create mode 100644 doc/api/html/structdot__product__store__type.html create mode 100644 doc/api/html/structexpression__grammar.html create mode 100644 doc/api/html/structstan_1_1agrad_1_1_operands_and_partials-members.html create mode 100644 doc/api/html/structstan_1_1agrad_1_1_operands_and_partials.html create mode 100644 doc/api/html/structstan_1_1agrad_1_1fvar-members.html create mode 100644 doc/api/html/structstan_1_1agrad_1_1fvar.html create mode 100644 doc/api/html/structstan_1_1contains__fvar-members.html create mode 100644 doc/api/html/structstan_1_1contains__fvar.html create mode 100644 doc/api/html/structstan_1_1gm_1_1add__conditional__body-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1add__conditional__body.html create mode 100644 doc/api/html/structstan_1_1gm_1_1add__conditional__body_1_1result-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1add__conditional__body_1_1result.html create mode 100644 doc/api/html/structstan_1_1gm_1_1add__conditional__condition-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1add__conditional__condition.html create mode 100644 doc/api/html/structstan_1_1gm_1_1add__conditional__condition_1_1result-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1add__conditional__condition_1_1result.html create mode 100644 doc/api/html/structstan_1_1gm_1_1add__expression__dimss-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1add__expression__dimss.html create mode 100644 doc/api/html/structstan_1_1gm_1_1add__expression__dimss_1_1result-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1add__expression__dimss_1_1result.html create mode 100644 doc/api/html/structstan_1_1gm_1_1add__loop__identifier-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1add__loop__identifier.html create mode 100644 doc/api/html/structstan_1_1gm_1_1add__loop__identifier_1_1result-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1add__loop__identifier_1_1result.html create mode 100644 doc/api/html/structstan_1_1gm_1_1add__while__body-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1add__while__body.html create mode 100644 doc/api/html/structstan_1_1gm_1_1add__while__body_1_1result-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1add__while__body_1_1result.html create mode 100644 doc/api/html/structstan_1_1gm_1_1add__while__condition-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1add__while__condition.html create mode 100644 doc/api/html/structstan_1_1gm_1_1add__while__condition_1_1result-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1add__while__condition_1_1result.html create mode 100644 doc/api/html/structstan_1_1gm_1_1addition__expr-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1addition__expr.html create mode 100644 doc/api/html/structstan_1_1gm_1_1addition__expr_1_1result-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1addition__expr_1_1result.html create mode 100644 doc/api/html/structstan_1_1gm_1_1array__literal-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1array__literal.html create mode 100644 doc/api/html/structstan_1_1gm_1_1assignment-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1assignment.html create mode 100644 doc/api/html/structstan_1_1gm_1_1base__var__decl-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1base__var__decl.html create mode 100644 doc/api/html/structstan_1_1gm_1_1base__var__decl.png create mode 100644 doc/api/html/structstan_1_1gm_1_1binary__op-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1binary__op.html create mode 100644 doc/api/html/structstan_1_1gm_1_1binary__op__expr-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1binary__op__expr.html create mode 100644 doc/api/html/structstan_1_1gm_1_1binary__op__expr_1_1result-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1binary__op__expr_1_1result.html create mode 100644 doc/api/html/structstan_1_1gm_1_1cholesky__factor__var__decl-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1cholesky__factor__var__decl.html create mode 100644 doc/api/html/structstan_1_1gm_1_1cholesky__factor__var__decl.png create mode 100644 doc/api/html/structstan_1_1gm_1_1conditional__statement-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1conditional__statement.html create mode 100644 doc/api/html/structstan_1_1gm_1_1constrained__param__names__visgen-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1constrained__param__names__visgen.html create mode 100644 doc/api/html/structstan_1_1gm_1_1constrained__param__names__visgen.png create mode 100644 doc/api/html/structstan_1_1gm_1_1contains__nonparam__var-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1contains__nonparam__var.html create mode 100644 doc/api/html/structstan_1_1gm_1_1contains__nonparam__var.png create mode 100644 doc/api/html/structstan_1_1gm_1_1contains__var-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1contains__var.html create mode 100644 doc/api/html/structstan_1_1gm_1_1contains__var.png create mode 100644 doc/api/html/structstan_1_1gm_1_1corr__matrix__var__decl-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1corr__matrix__var__decl.html create mode 100644 doc/api/html/structstan_1_1gm_1_1corr__matrix__var__decl.png create mode 100644 doc/api/html/structstan_1_1gm_1_1cov__matrix__var__decl-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1cov__matrix__var__decl.html create mode 100644 doc/api/html/structstan_1_1gm_1_1cov__matrix__var__decl.png create mode 100644 doc/api/html/structstan_1_1gm_1_1distribution-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1distribution.html create mode 100644 doc/api/html/structstan_1_1gm_1_1division__expr-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1division__expr.html create mode 100644 doc/api/html/structstan_1_1gm_1_1division__expr_1_1result-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1division__expr_1_1result.html create mode 100644 doc/api/html/structstan_1_1gm_1_1double__literal-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1double__literal.html create mode 100644 doc/api/html/structstan_1_1gm_1_1double__var__decl-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1double__var__decl.html create mode 100644 doc/api/html/structstan_1_1gm_1_1double__var__decl.png create mode 100644 doc/api/html/structstan_1_1gm_1_1dump__member__var__visgen-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1dump__member__var__visgen.html create mode 100644 doc/api/html/structstan_1_1gm_1_1dump__member__var__visgen.png create mode 100644 doc/api/html/structstan_1_1gm_1_1elt__division__expr-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1elt__division__expr.html create mode 100644 doc/api/html/structstan_1_1gm_1_1elt__division__expr_1_1result-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1elt__division__expr_1_1result.html create mode 100644 doc/api/html/structstan_1_1gm_1_1elt__multiplication__expr-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1elt__multiplication__expr.html create mode 100644 doc/api/html/structstan_1_1gm_1_1elt__multiplication__expr_1_1result-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1elt__multiplication__expr_1_1result.html create mode 100644 doc/api/html/structstan_1_1gm_1_1error__codes-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1error__codes.html create mode 100644 doc/api/html/structstan_1_1gm_1_1expr__type-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1expr__type.html create mode 100644 doc/api/html/structstan_1_1gm_1_1expression-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1expression.html create mode 100644 doc/api/html/structstan_1_1gm_1_1expression__as__statement-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1expression__as__statement.html create mode 100644 doc/api/html/structstan_1_1gm_1_1expression__as__statement_1_1result-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1expression__as__statement_1_1result.html create mode 100644 doc/api/html/structstan_1_1gm_1_1expression__grammar-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1expression__grammar.html create mode 100644 doc/api/html/structstan_1_1gm_1_1expression__grammar.png create mode 100644 doc/api/html/structstan_1_1gm_1_1expression__type__vis-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1expression__type__vis.html create mode 100644 doc/api/html/structstan_1_1gm_1_1expression__type__vis.png create mode 100644 doc/api/html/structstan_1_1gm_1_1expression__visgen-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1expression__visgen.html create mode 100644 doc/api/html/structstan_1_1gm_1_1expression__visgen.png create mode 100644 doc/api/html/structstan_1_1gm_1_1for__statement-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1for__statement.html create mode 100644 doc/api/html/structstan_1_1gm_1_1fun-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1fun.html create mode 100644 doc/api/html/structstan_1_1gm_1_1generate__init__vars__visgen-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1generate__init__vars__visgen.html create mode 100644 doc/api/html/structstan_1_1gm_1_1generate__init__vars__visgen.png create mode 100644 doc/api/html/structstan_1_1gm_1_1generate__init__visgen-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1generate__init__visgen.html create mode 100644 doc/api/html/structstan_1_1gm_1_1generate__init__visgen.png create mode 100644 doc/api/html/structstan_1_1gm_1_1generate__local__var__init__nan__visgen-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html create mode 100644 doc/api/html/structstan_1_1gm_1_1generate__local__var__init__nan__visgen.png create mode 100644 doc/api/html/structstan_1_1gm_1_1increment__log__prob__statement-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1increment__log__prob__statement.html create mode 100644 doc/api/html/structstan_1_1gm_1_1index__op-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1index__op.html create mode 100644 doc/api/html/structstan_1_1gm_1_1init__local__var__visgen-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1init__local__var__visgen.html create mode 100644 doc/api/html/structstan_1_1gm_1_1init__local__var__visgen.png create mode 100644 doc/api/html/structstan_1_1gm_1_1int__literal-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1int__literal.html create mode 100644 doc/api/html/structstan_1_1gm_1_1int__var__decl-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1int__var__decl.html create mode 100644 doc/api/html/structstan_1_1gm_1_1int__var__decl.png create mode 100644 doc/api/html/structstan_1_1gm_1_1is__nil__op-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1is__nil__op.html create mode 100644 doc/api/html/structstan_1_1gm_1_1is__nil__op.png create mode 100644 doc/api/html/structstan_1_1gm_1_1left__division__expr-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1left__division__expr.html create mode 100644 doc/api/html/structstan_1_1gm_1_1left__division__expr_1_1result-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1left__division__expr_1_1result.html create mode 100644 doc/api/html/structstan_1_1gm_1_1local__var__decl__visgen-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1local__var__decl__visgen.html create mode 100644 doc/api/html/structstan_1_1gm_1_1local__var__decl__visgen.png create mode 100644 doc/api/html/structstan_1_1gm_1_1logical__negate__expr-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1logical__negate__expr.html create mode 100644 doc/api/html/structstan_1_1gm_1_1logical__negate__expr_1_1result-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1logical__negate__expr_1_1result.html create mode 100644 doc/api/html/structstan_1_1gm_1_1matrix__var__decl-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1matrix__var__decl.html create mode 100644 doc/api/html/structstan_1_1gm_1_1matrix__var__decl.png create mode 100644 doc/api/html/structstan_1_1gm_1_1member__var__decl__visgen-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1member__var__decl__visgen.html create mode 100644 doc/api/html/structstan_1_1gm_1_1member__var__decl__visgen.png create mode 100644 doc/api/html/structstan_1_1gm_1_1multiplication__expr-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1multiplication__expr.html create mode 100644 doc/api/html/structstan_1_1gm_1_1multiplication__expr_1_1result-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1multiplication__expr_1_1result.html create mode 100644 doc/api/html/structstan_1_1gm_1_1name__vis-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1name__vis.html create mode 100644 doc/api/html/structstan_1_1gm_1_1name__vis.png create mode 100644 doc/api/html/structstan_1_1gm_1_1negate__expr-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1negate__expr.html create mode 100644 doc/api/html/structstan_1_1gm_1_1negate__expr_1_1result-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1negate__expr_1_1result.html create mode 100644 doc/api/html/structstan_1_1gm_1_1nil.html create mode 100644 doc/api/html/structstan_1_1gm_1_1no__op__statement.html create mode 100644 doc/api/html/structstan_1_1gm_1_1ordered__var__decl-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1ordered__var__decl.html create mode 100644 doc/api/html/structstan_1_1gm_1_1ordered__var__decl.png create mode 100644 doc/api/html/structstan_1_1gm_1_1positive__ordered__var__decl-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1positive__ordered__var__decl.html create mode 100644 doc/api/html/structstan_1_1gm_1_1positive__ordered__var__decl.png create mode 100644 doc/api/html/structstan_1_1gm_1_1print__statement-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1print__statement.html create mode 100644 doc/api/html/structstan_1_1gm_1_1printable-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1printable.html create mode 100644 doc/api/html/structstan_1_1gm_1_1printable__visgen-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1printable__visgen.html create mode 100644 doc/api/html/structstan_1_1gm_1_1printable__visgen.png create mode 100644 doc/api/html/structstan_1_1gm_1_1program-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1program.html create mode 100644 doc/api/html/structstan_1_1gm_1_1program__grammar-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1program__grammar.html create mode 100644 doc/api/html/structstan_1_1gm_1_1program__grammar.png create mode 100644 doc/api/html/structstan_1_1gm_1_1range-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1range.html create mode 100644 doc/api/html/structstan_1_1gm_1_1remove__loop__identifier-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1remove__loop__identifier.html create mode 100644 doc/api/html/structstan_1_1gm_1_1remove__loop__identifier_1_1result-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1remove__loop__identifier_1_1result.html create mode 100644 doc/api/html/structstan_1_1gm_1_1row__vector__var__decl-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1row__vector__var__decl.html create mode 100644 doc/api/html/structstan_1_1gm_1_1row__vector__var__decl.png create mode 100644 doc/api/html/structstan_1_1gm_1_1sample-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1sample.html create mode 100644 doc/api/html/structstan_1_1gm_1_1set__fun__type-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1set__fun__type.html create mode 100644 doc/api/html/structstan_1_1gm_1_1set__fun__type2-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1set__fun__type2.html create mode 100644 doc/api/html/structstan_1_1gm_1_1set__fun__type2_1_1result-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1set__fun__type2_1_1result.html create mode 100644 doc/api/html/structstan_1_1gm_1_1set__fun__type_1_1result-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1set__fun__type_1_1result.html create mode 100644 doc/api/html/structstan_1_1gm_1_1set__fun__type__named-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1set__fun__type__named.html create mode 100644 doc/api/html/structstan_1_1gm_1_1set__fun__type__named_1_1result-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1set__fun__type__named_1_1result.html create mode 100644 doc/api/html/structstan_1_1gm_1_1set__param__ranges__visgen-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1set__param__ranges__visgen.html create mode 100644 doc/api/html/structstan_1_1gm_1_1set__param__ranges__visgen.png create mode 100644 doc/api/html/structstan_1_1gm_1_1set__var__type-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1set__var__type.html create mode 100644 doc/api/html/structstan_1_1gm_1_1set__var__type_1_1result-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1set__var__type_1_1result.html create mode 100644 doc/api/html/structstan_1_1gm_1_1simplex__var__decl-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1simplex__var__decl.html create mode 100644 doc/api/html/structstan_1_1gm_1_1simplex__var__decl.png create mode 100644 doc/api/html/structstan_1_1gm_1_1statement-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1statement.html create mode 100644 doc/api/html/structstan_1_1gm_1_1statement__2__grammar-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1statement__2__grammar.html create mode 100644 doc/api/html/structstan_1_1gm_1_1statement__2__grammar.png create mode 100644 doc/api/html/structstan_1_1gm_1_1statement__grammar-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1statement__grammar.html create mode 100644 doc/api/html/structstan_1_1gm_1_1statement__grammar.png create mode 100644 doc/api/html/structstan_1_1gm_1_1statement__visgen-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1statement__visgen.html create mode 100644 doc/api/html/structstan_1_1gm_1_1statement__visgen.png create mode 100644 doc/api/html/structstan_1_1gm_1_1statements-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1statements.html create mode 100644 doc/api/html/structstan_1_1gm_1_1subtraction__expr-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1subtraction__expr.html create mode 100644 doc/api/html/structstan_1_1gm_1_1subtraction__expr_1_1result-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1subtraction__expr_1_1result.html create mode 100644 doc/api/html/structstan_1_1gm_1_1term__grammar-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1term__grammar.html create mode 100644 doc/api/html/structstan_1_1gm_1_1term__grammar.png create mode 100644 doc/api/html/structstan_1_1gm_1_1transpose__expr-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1transpose__expr.html create mode 100644 doc/api/html/structstan_1_1gm_1_1transpose__expr_1_1result-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1transpose__expr_1_1result.html create mode 100644 doc/api/html/structstan_1_1gm_1_1type__name-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1type__name.html create mode 100644 doc/api/html/structstan_1_1gm_1_1type__name_3_01bool_01_4-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1type__name_3_01bool_01_4.html create mode 100644 doc/api/html/structstan_1_1gm_1_1type__name_3_01double_01_4-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1type__name_3_01double_01_4.html create mode 100644 doc/api/html/structstan_1_1gm_1_1type__name_3_01int_01_4-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1type__name_3_01int_01_4.html create mode 100644 doc/api/html/structstan_1_1gm_1_1type__name_3_01std_1_1string_01_4-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1type__name_3_01std_1_1string_01_4.html create mode 100644 doc/api/html/structstan_1_1gm_1_1type__name_3_01unsigned_01int_01_4-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1type__name_3_01unsigned_01int_01_4.html create mode 100644 doc/api/html/structstan_1_1gm_1_1unary__op-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1unary__op.html create mode 100644 doc/api/html/structstan_1_1gm_1_1unconstrained__param__names__visgen-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1unconstrained__param__names__visgen.html create mode 100644 doc/api/html/structstan_1_1gm_1_1unconstrained__param__names__visgen.png create mode 100644 doc/api/html/structstan_1_1gm_1_1unit__vector__var__decl-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1unit__vector__var__decl.html create mode 100644 doc/api/html/structstan_1_1gm_1_1unit__vector__var__decl.png create mode 100644 doc/api/html/structstan_1_1gm_1_1unscope__locals-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1unscope__locals.html create mode 100644 doc/api/html/structstan_1_1gm_1_1unscope__locals_1_1result-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1unscope__locals_1_1result.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__allow__sample-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__allow__sample.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__allow__sample_1_1result-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__allow__sample_1_1result.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__assignment-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__assignment.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__assignment_1_1result-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__assignment_1_1result.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__expr__type-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__expr__type.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__expr__type2-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__expr__type2.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__expr__type2_1_1result-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__expr__type2_1_1result.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__expr__type_1_1result-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__expr__type_1_1result.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__int__expr2-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__int__expr2.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__int__expr2_1_1result-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__int__expr2_1_1result.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__int__expr3-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__int__expr3.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__int__expr3_1_1result-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__int__expr3_1_1result.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__sample-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__sample.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__sample_1_1result-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__sample_1_1result.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__transformed__params__visgen-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__transformed__params__visgen.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__transformed__params__visgen.png create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__var__decl__visgen-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__var__decl__visgen.html create mode 100644 doc/api/html/structstan_1_1gm_1_1validate__var__decl__visgen.png create mode 100644 doc/api/html/structstan_1_1gm_1_1var__decl-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1var__decl.html create mode 100644 doc/api/html/structstan_1_1gm_1_1var__decls__grammar-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1var__decls__grammar.html create mode 100644 doc/api/html/structstan_1_1gm_1_1var__decls__grammar.png create mode 100644 doc/api/html/structstan_1_1gm_1_1var__resizing__visgen-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1var__resizing__visgen.html create mode 100644 doc/api/html/structstan_1_1gm_1_1var__resizing__visgen.png create mode 100644 doc/api/html/structstan_1_1gm_1_1var__size__validating__visgen-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1var__size__validating__visgen.html create mode 100644 doc/api/html/structstan_1_1gm_1_1var__size__validating__visgen.png create mode 100644 doc/api/html/structstan_1_1gm_1_1variable-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1variable.html create mode 100644 doc/api/html/structstan_1_1gm_1_1variable__dims-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1variable__dims.html create mode 100644 doc/api/html/structstan_1_1gm_1_1variable__map-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1variable__map.html create mode 100644 doc/api/html/structstan_1_1gm_1_1vector__var__decl-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1vector__var__decl.html create mode 100644 doc/api/html/structstan_1_1gm_1_1vector__var__decl.png create mode 100644 doc/api/html/structstan_1_1gm_1_1visgen-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1visgen.html create mode 100644 doc/api/html/structstan_1_1gm_1_1visgen.png create mode 100644 doc/api/html/structstan_1_1gm_1_1while__statement-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1while__statement.html create mode 100644 doc/api/html/structstan_1_1gm_1_1whitespace__grammar-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1whitespace__grammar.html create mode 100644 doc/api/html/structstan_1_1gm_1_1whitespace__grammar.png create mode 100644 doc/api/html/structstan_1_1gm_1_1write__array__vars__visgen-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1write__array__vars__visgen.html create mode 100644 doc/api/html/structstan_1_1gm_1_1write__array__vars__visgen.png create mode 100644 doc/api/html/structstan_1_1gm_1_1write__array__visgen-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1write__array__visgen.html create mode 100644 doc/api/html/structstan_1_1gm_1_1write__array__visgen.png create mode 100644 doc/api/html/structstan_1_1gm_1_1write__csv__header__visgen-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1write__csv__header__visgen.html create mode 100644 doc/api/html/structstan_1_1gm_1_1write__csv__header__visgen.png create mode 100644 doc/api/html/structstan_1_1gm_1_1write__csv__vars__visgen-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1write__csv__vars__visgen.html create mode 100644 doc/api/html/structstan_1_1gm_1_1write__csv__vars__visgen.png create mode 100644 doc/api/html/structstan_1_1gm_1_1write__csv__visgen-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1write__csv__visgen.html create mode 100644 doc/api/html/structstan_1_1gm_1_1write__csv__visgen.png create mode 100644 doc/api/html/structstan_1_1gm_1_1write__dims__visgen-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1write__dims__visgen.html create mode 100644 doc/api/html/structstan_1_1gm_1_1write__dims__visgen.png create mode 100644 doc/api/html/structstan_1_1gm_1_1write__param__names__visgen-members.html create mode 100644 doc/api/html/structstan_1_1gm_1_1write__param__names__visgen.html create mode 100644 doc/api/html/structstan_1_1gm_1_1write__param__names__visgen.png create mode 100644 doc/api/html/structstan_1_1io_1_1stan__csv-members.html create mode 100644 doc/api/html/structstan_1_1io_1_1stan__csv.html create mode 100644 doc/api/html/structstan_1_1io_1_1stan__csv__adaptation-members.html create mode 100644 doc/api/html/structstan_1_1io_1_1stan__csv__adaptation.html create mode 100644 doc/api/html/structstan_1_1io_1_1stan__csv__metadata-members.html create mode 100644 doc/api/html/structstan_1_1io_1_1stan__csv__metadata.html create mode 100644 doc/api/html/structstan_1_1io_1_1stan__csv__timing-members.html create mode 100644 doc/api/html/structstan_1_1io_1_1stan__csv__timing.html create mode 100644 doc/api/html/structstan_1_1is__constant-members.html create mode 100644 doc/api/html/structstan_1_1is__constant.html create mode 100644 doc/api/html/structstan_1_1is__constant__struct-members.html create mode 100644 doc/api/html/structstan_1_1is__constant__struct.html create mode 100644 doc/api/html/structstan_1_1is__constant__struct_3_01_eigen_1_1_block_3_01_t_01_4_01_4-members.html create mode 100644 doc/api/html/structstan_1_1is__constant__struct_3_01_eigen_1_1_block_3_01_t_01_4_01_4.html create mode 100644 doc/api/html/structstan_1_1is__constant__struct_3_01_eigen_1_1_matrix_3_01_t_00_01_r_00_01_c_01_4_01_4-members.html create mode 100644 doc/api/html/structstan_1_1is__constant__struct_3_01_eigen_1_1_matrix_3_01_t_00_01_r_00_01_c_01_4_01_4.html create mode 100644 doc/api/html/structstan_1_1is__constant__struct_3_01std_1_1vector_3_01_t_01_4_01_4-members.html create mode 100644 doc/api/html/structstan_1_1is__constant__struct_3_01std_1_1vector_3_01_t_01_4_01_4.html create mode 100644 doc/api/html/structstan_1_1is__fvar-members.html create mode 100644 doc/api/html/structstan_1_1is__fvar.html create mode 100644 doc/api/html/structstan_1_1is__fvar_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4-members.html create mode 100644 doc/api/html/structstan_1_1is__fvar_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html create mode 100644 doc/api/html/structstan_1_1is__var-members.html create mode 100644 doc/api/html/structstan_1_1is__var.html create mode 100644 doc/api/html/structstan_1_1is__var_3_01stan_1_1agrad_1_1var_01_4-members.html create mode 100644 doc/api/html/structstan_1_1is__var_3_01stan_1_1agrad_1_1var_01_4.html create mode 100644 doc/api/html/structstan_1_1is__var__or__arithmetic-members.html create mode 100644 doc/api/html/structstan_1_1is__var__or__arithmetic.html create mode 100644 doc/api/html/structstan_1_1is__vector-members.html create mode 100644 doc/api/html/structstan_1_1is__vector.html create mode 100644 doc/api/html/structstan_1_1is__vector_3_01_eigen_1_1_matrix_3_01_t_00_011_00_01_eigen_1_1_dynamic_01_4_01_4-members.html create mode 100644 doc/api/html/structstan_1_1is__vector_3_01_eigen_1_1_matrix_3_01_t_00_011_00_01_eigen_1_1_dynamic_01_4_01_4.html create mode 100644 doc/api/html/structstan_1_1is__vector_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_011_01_4_01_4-members.html create mode 100644 doc/api/html/structstan_1_1is__vector_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_011_01_4_01_4.html create mode 100644 doc/api/html/structstan_1_1is__vector_3_01const_01_t_01_4-members.html create mode 100644 doc/api/html/structstan_1_1is__vector_3_01const_01_t_01_4.html create mode 100644 doc/api/html/structstan_1_1is__vector_3_01std_1_1vector_3_01_t_01_4_01_4-members.html create mode 100644 doc/api/html/structstan_1_1is__vector_3_01std_1_1vector_3_01_t_01_4_01_4.html create mode 100644 doc/api/html/structstan_1_1is__vector__like-members.html create mode 100644 doc/api/html/structstan_1_1is__vector__like.html create mode 100644 doc/api/html/structstan_1_1is__vector__like_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4-members.html create mode 100644 doc/api/html/structstan_1_1is__vector__like_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4.html create mode 100644 doc/api/html/structstan_1_1is__vector__like_3_01_t_01_5_01_4-members.html create mode 100644 doc/api/html/structstan_1_1is__vector__like_3_01_t_01_5_01_4.html create mode 100644 doc/api/html/structstan_1_1is__vector__like_3_01const_01_t_01_4-members.html create mode 100644 doc/api/html/structstan_1_1is__vector__like_3_01const_01_t_01_4.html create mode 100644 doc/api/html/structstan_1_1math_1_1array__builder-members.html create mode 100644 doc/api/html/structstan_1_1math_1_1array__builder.html create mode 100644 doc/api/html/structstan_1_1math_1_1common__type-members.html create mode 100644 doc/api/html/structstan_1_1math_1_1common__type.html create mode 100644 doc/api/html/structstan_1_1math_1_1common__type_3_01_eigen_1_1_matrix_3_01_t1_00_01_r_00_01_c_01_4_00_01_eige106a86f1021708b40db478c4e2fef0a7.html create mode 100644 doc/api/html/structstan_1_1math_1_1common__type_3_01_eigen_1_1_matrix_3_01_t1_00_01_r_00_01_c_01_4_00_01_eiged8accfa00e73f240c58ad02ac582ba93.html create mode 100644 doc/api/html/structstan_1_1math_1_1common__type_3_01std_1_1vector_3_01_t1_01_4_00_01std_1_1vector_3_01_t2_01_4_01_4-members.html create mode 100644 doc/api/html/structstan_1_1math_1_1common__type_3_01std_1_1vector_3_01_t1_01_4_00_01std_1_1vector_3_01_t2_01_4_01_4.html create mode 100644 doc/api/html/structstan_1_1math_1_1pass__type-members.html create mode 100644 doc/api/html/structstan_1_1math_1_1pass__type.html create mode 100644 doc/api/html/structstan_1_1math_1_1pass__type_3_01double_01_4-members.html create mode 100644 doc/api/html/structstan_1_1math_1_1pass__type_3_01double_01_4.html create mode 100644 doc/api/html/structstan_1_1math_1_1pass__type_3_01int_01_4-members.html create mode 100644 doc/api/html/structstan_1_1math_1_1pass__type_3_01int_01_4.html create mode 100644 doc/api/html/structstan_1_1math_1_1promoter-members.html create mode 100644 doc/api/html/structstan_1_1math_1_1promoter.html create mode 100644 doc/api/html/structstan_1_1math_1_1promoter_3_01_eigen_1_1_matrix_3_01_f_00_01_r_00_01_c_01_4_00_01_eigen_1_142b48fda94601374e41a81325f3f7b84.html create mode 100644 doc/api/html/structstan_1_1math_1_1promoter_3_01_eigen_1_1_matrix_3_01_f_00_01_r_00_01_c_01_4_00_01_eigen_1_19fcbf4e7bc8e106173bfa338a15054ff.html create mode 100644 doc/api/html/structstan_1_1math_1_1promoter_3_01_eigen_1_1_matrix_3_01_t_00_01_r_00_01_c_01_4_00_01_eigen_1_12d7fadf0560f1f2f3abc5388b7666f9c.html create mode 100644 doc/api/html/structstan_1_1math_1_1promoter_3_01_eigen_1_1_matrix_3_01_t_00_01_r_00_01_c_01_4_00_01_eigen_1_1ab38afe2feaa91a91579e3639d1f03b0.html create mode 100644 doc/api/html/structstan_1_1math_1_1promoter_3_01_t_00_01_t_01_4-members.html create mode 100644 doc/api/html/structstan_1_1math_1_1promoter_3_01_t_00_01_t_01_4.html create mode 100644 doc/api/html/structstan_1_1math_1_1promoter_3_01std_1_1vector_3_01_f_01_4_00_01std_1_1vector_3_01_t_01_4_01_4-members.html create mode 100644 doc/api/html/structstan_1_1math_1_1promoter_3_01std_1_1vector_3_01_f_01_4_00_01std_1_1vector_3_01_t_01_4_01_4.html create mode 100644 doc/api/html/structstan_1_1math_1_1promoter_3_01std_1_1vector_3_01_t_01_4_00_01std_1_1vector_3_01_t_01_4_01_4-members.html create mode 100644 doc/api/html/structstan_1_1math_1_1promoter_3_01std_1_1vector_3_01_t_01_4_00_01std_1_1vector_3_01_t_01_4_01_4.html create mode 100644 doc/api/html/structstan_1_1math_1_1store__type-members.html create mode 100644 doc/api/html/structstan_1_1math_1_1store__type.html create mode 100644 doc/api/html/structstan_1_1math_1_1store__type_3_01double_01_4-members.html create mode 100644 doc/api/html/structstan_1_1math_1_1store__type_3_01double_01_4.html create mode 100644 doc/api/html/structstan_1_1math_1_1store__type_3_01int_01_4-members.html create mode 100644 doc/api/html/structstan_1_1math_1_1store__type_3_01int_01_4.html create mode 100644 doc/api/html/structstan_1_1mcmc_1_1nuts__util-members.html create mode 100644 doc/api/html/structstan_1_1mcmc_1_1nuts__util.html create mode 100644 doc/api/html/structstan_1_1optimization_1_1_b_f_g_s_minimizer_1_1_b_f_g_s_options-members.html create mode 100644 doc/api/html/structstan_1_1optimization_1_1_b_f_g_s_minimizer_1_1_b_f_g_s_options.html create mode 100644 doc/api/html/structstan_1_1prob_1_1include__summand-members.html create mode 100644 doc/api/html/structstan_1_1prob_1_1include__summand.html create mode 100644 doc/api/html/structstan_1_1return__type-members.html create mode 100644 doc/api/html/structstan_1_1return__type.html create mode 100644 doc/api/html/structstan_1_1scalar__type-members.html create mode 100644 doc/api/html/structstan_1_1scalar__type.html create mode 100644 doc/api/html/structstan_1_1scalar__type_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4-members.html create mode 100644 doc/api/html/structstan_1_1scalar__type_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4.html create mode 100644 doc/api/html/structstan_1_1scalar__type_3_01_t_01_5_01_4-members.html create mode 100644 doc/api/html/structstan_1_1scalar__type_3_01_t_01_5_01_4.html create mode 100644 doc/api/html/structstan_1_1size__of__helper-members.html create mode 100644 doc/api/html/structstan_1_1size__of__helper.html create mode 100644 doc/api/html/structstan_1_1size__of__helper_3_01_t_00_01true_01_4-members.html create mode 100644 doc/api/html/structstan_1_1size__of__helper_3_01_t_00_01true_01_4.html create mode 100644 doc/api/html/structstatement__grammar.html create mode 100644 doc/api/html/structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4-members.html create mode 100644 doc/api/html/structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html create mode 100644 doc/api/html/structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4-members.html create mode 100644 doc/api/html/structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html create mode 100644 doc/api/html/structterm__grammar.html create mode 100644 doc/api/html/student__t_8hpp.html create mode 100644 doc/api/html/student__t_8hpp_source.html create mode 100644 doc/api/html/sub_8hpp.html create mode 100644 doc/api/html/sub_8hpp_source.html create mode 100644 doc/api/html/sub__col_8hpp.html create mode 100644 doc/api/html/sub__col_8hpp_source.html create mode 100644 doc/api/html/sub__row_8hpp.html create mode 100644 doc/api/html/sub__row_8hpp_source.html create mode 100644 doc/api/html/subtract_8hpp.html create mode 100644 doc/api/html/subtract_8hpp_source.html create mode 100644 doc/api/html/sync_off.png create mode 100644 doc/api/html/sync_on.png create mode 100644 doc/api/html/tab_a.png create mode 100644 doc/api/html/tab_b.png create mode 100644 doc/api/html/tab_h.png create mode 100644 doc/api/html/tab_s.png create mode 100644 doc/api/html/tabs.css create mode 100644 doc/api/html/tail_8hpp.html create mode 100644 doc/api/html/tail_8hpp_source.html create mode 100644 doc/api/html/term__grammar_8hpp.html create mode 100644 doc/api/html/term__grammar_8hpp_source.html create mode 100644 doc/api/html/term__grammar__def_8hpp.html create mode 100644 doc/api/html/term__grammar__def_8hpp_source.html create mode 100644 doc/api/html/term__grammar__inst_8cpp.html create mode 100644 doc/api/html/term__grammar__inst_8cpp_source.html create mode 100644 doc/api/html/to__fvar_8hpp.html create mode 100644 doc/api/html/to__fvar_8hpp_source.html create mode 100644 doc/api/html/to__var_8hpp.html create mode 100644 doc/api/html/to__var_8hpp_source.html create mode 100644 doc/api/html/to__vector_8hpp.html create mode 100644 doc/api/html/to__vector_8hpp_source.html create mode 100644 doc/api/html/trace_8hpp.html create mode 100644 doc/api/html/trace_8hpp_source.html create mode 100644 doc/api/html/transform_8hpp.html create mode 100644 doc/api/html/transform_8hpp_source.html create mode 100644 doc/api/html/transpose_8hpp.html create mode 100644 doc/api/html/transpose_8hpp_source.html create mode 100644 doc/api/html/trigamma_8hpp.html create mode 100644 doc/api/html/trigamma_8hpp_source.html create mode 100644 doc/api/html/uniform_8hpp.html create mode 100644 doc/api/html/uniform_8hpp_source.html create mode 100644 doc/api/html/unit__e__metric_8hpp.html create mode 100644 doc/api/html/unit__e__metric_8hpp_source.html create mode 100644 doc/api/html/unit__e__nuts_8hpp.html create mode 100644 doc/api/html/unit__e__nuts_8hpp_source.html create mode 100644 doc/api/html/unit__e__point_8hpp.html create mode 100644 doc/api/html/unit__e__point_8hpp_source.html create mode 100644 doc/api/html/unit__e__static__hmc_8hpp.html create mode 100644 doc/api/html/unit__e__static__hmc_8hpp_source.html create mode 100644 doc/api/html/univariate_2continuous_8hpp.html create mode 100644 doc/api/html/univariate_2continuous_8hpp_source.html create mode 100644 doc/api/html/univariate_2discrete_8hpp.html create mode 100644 doc/api/html/univariate_2discrete_8hpp_source.html create mode 100644 doc/api/html/univariate_8hpp.html create mode 100644 doc/api/html/univariate_8hpp_source.html create mode 100644 doc/api/html/unvalued__argument_8hpp.html create mode 100644 doc/api/html/unvalued__argument_8hpp_source.html create mode 100644 doc/api/html/v__vari_8hpp.html create mode 100644 doc/api/html/v__vari_8hpp_source.html create mode 100644 doc/api/html/validate__column__index_8hpp.html create mode 100644 doc/api/html/validate__column__index_8hpp_source.html create mode 100644 doc/api/html/validate__greater_8hpp.html create mode 100644 doc/api/html/validate__greater_8hpp_source.html create mode 100644 doc/api/html/validate__greater__or__equal_8hpp.html create mode 100644 doc/api/html/validate__greater__or__equal_8hpp_source.html create mode 100644 doc/api/html/validate__less_8hpp.html create mode 100644 doc/api/html/validate__less_8hpp_source.html create mode 100644 doc/api/html/validate__less__or__equal_8hpp.html create mode 100644 doc/api/html/validate__less__or__equal_8hpp_source.html create mode 100644 doc/api/html/validate__matching__dims_8hpp.html create mode 100644 doc/api/html/validate__matching__dims_8hpp_source.html create mode 100644 doc/api/html/validate__matching__sizes_8hpp.html create mode 100644 doc/api/html/validate__matching__sizes_8hpp_source.html create mode 100644 doc/api/html/validate__multiplicable_8hpp.html create mode 100644 doc/api/html/validate__multiplicable_8hpp_source.html create mode 100644 doc/api/html/validate__non__negative__index_8hpp.html create mode 100644 doc/api/html/validate__non__negative__index_8hpp_source.html create mode 100644 doc/api/html/validate__non__negative__rep_8hpp.html create mode 100644 doc/api/html/validate__non__negative__rep_8hpp_source.html create mode 100644 doc/api/html/validate__nonzero__size_8hpp.html create mode 100644 doc/api/html/validate__nonzero__size_8hpp_source.html create mode 100644 doc/api/html/validate__row__index_8hpp.html create mode 100644 doc/api/html/validate__row__index_8hpp_source.html create mode 100644 doc/api/html/validate__square_8hpp.html create mode 100644 doc/api/html/validate__square_8hpp_source.html create mode 100644 doc/api/html/validate__std__vector__index_8hpp.html create mode 100644 doc/api/html/validate__std__vector__index_8hpp_source.html create mode 100644 doc/api/html/validate__symmetric_8hpp.html create mode 100644 doc/api/html/validate__symmetric_8hpp_source.html create mode 100644 doc/api/html/validate__vector_8hpp.html create mode 100644 doc/api/html/validate__vector_8hpp_source.html create mode 100644 doc/api/html/valued__argument_8hpp.html create mode 100644 doc/api/html/valued__argument_8hpp_source.html create mode 100644 doc/api/html/var_8hpp.html create mode 100644 doc/api/html/var_8hpp_source.html create mode 100644 doc/api/html/var__adaptation_8hpp.html create mode 100644 doc/api/html/var__adaptation_8hpp_source.html create mode 100644 doc/api/html/var__context_8hpp.html create mode 100644 doc/api/html/var__context_8hpp_source.html create mode 100644 doc/api/html/var__decls__grammar_8hpp.html create mode 100644 doc/api/html/var__decls__grammar_8hpp_source.html create mode 100644 doc/api/html/var__decls__grammar__def_8hpp.html create mode 100644 doc/api/html/var__decls__grammar__def_8hpp_source.html create mode 100644 doc/api/html/var__decls__grammar__inst_8cpp.html create mode 100644 doc/api/html/var__decls__grammar__inst_8cpp_source.html create mode 100644 doc/api/html/var__stack_8cpp.html create mode 100644 doc/api/html/var__stack_8cpp_source.html create mode 100644 doc/api/html/var__stack_8hpp.html create mode 100644 doc/api/html/var__stack_8hpp_source.html create mode 100644 doc/api/html/vari_8hpp.html create mode 100644 doc/api/html/vari_8hpp_source.html create mode 100644 doc/api/html/vd__vari_8hpp.html create mode 100644 doc/api/html/vd__vari_8hpp_source.html create mode 100644 doc/api/html/vdd__vari_8hpp.html create mode 100644 doc/api/html/vdd__vari_8hpp_source.html create mode 100644 doc/api/html/vdv__vari_8hpp.html create mode 100644 doc/api/html/vdv__vari_8hpp_source.html create mode 100644 doc/api/html/vector__vari_8hpp.html create mode 100644 doc/api/html/vector__vari_8hpp_source.html create mode 100644 doc/api/html/version_8hpp.html create mode 100644 doc/api/html/version_8hpp_source.html create mode 100644 doc/api/html/von__mises_8hpp.html create mode 100644 doc/api/html/von__mises_8hpp_source.html create mode 100644 doc/api/html/vv__vari_8hpp.html create mode 100644 doc/api/html/vv__vari_8hpp_source.html create mode 100644 doc/api/html/vvd__vari_8hpp.html create mode 100644 doc/api/html/vvd__vari_8hpp_source.html create mode 100644 doc/api/html/vvv__vari_8hpp.html create mode 100644 doc/api/html/vvv__vari_8hpp_source.html create mode 100644 doc/api/html/weibull_8hpp.html create mode 100644 doc/api/html/weibull_8hpp_source.html create mode 100644 doc/api/html/welford__covar__estimator_8hpp.html create mode 100644 doc/api/html/welford__covar__estimator_8hpp_source.html create mode 100644 doc/api/html/welford__var__estimator_8hpp.html create mode 100644 doc/api/html/welford__var__estimator_8hpp_source.html create mode 100644 doc/api/html/whitespace__grammar_8hpp.html create mode 100644 doc/api/html/whitespace__grammar_8hpp_source.html create mode 100644 doc/api/html/whitespace__grammar__def_8hpp.html create mode 100644 doc/api/html/whitespace__grammar__def_8hpp_source.html create mode 100644 doc/api/html/whitespace__grammar__inst_8cpp.html create mode 100644 doc/api/html/whitespace__grammar__inst_8cpp_source.html create mode 100644 doc/api/html/windowed__adaptation_8hpp.html create mode 100644 doc/api/html/windowed__adaptation_8hpp_source.html create mode 100644 doc/api/html/wishart_8hpp.html create mode 100644 doc/api/html/wishart_8hpp_source.html create mode 100644 doc/api/html/writer_8hpp.html create mode 100644 doc/api/html/writer_8hpp_source.html create mode 100644 doc/stan-reference-2.1.0.pdf diff --git a/doc/api/html/_eigen_8dox.html b/doc/api/html/_eigen_8dox.html new file mode 100644 index 00000000000..48268607b74 --- /dev/null +++ b/doc/api/html/_eigen_8dox.html @@ -0,0 +1,115 @@ + + + + + +Stan: src/doxygen/Eigen.dox File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ +
+
+ +
+
src/doxygen/Eigen.dox File Reference
+
+
+ + + + + + + + +

+Namespaces

namespace  Eigen
 (Expert) Numerical traits for algorithmic differentiation variables.
 
namespace  Eigen::internal
 (Expert) Product traits for algorithmic differentiation variables.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/_eigen_8hpp.html b/doc/api/html/_eigen_8hpp.html new file mode 100644 index 00000000000..147cc3f01a6 --- /dev/null +++ b/doc/api/html/_eigen_8hpp.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/math/matrix/Eigen.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
Eigen.hpp File Reference
+
+
+
#include <Eigen/Dense>
+#include <Eigen/QR>
+
+

Go to the source code of this file.

+ + + + +

+Macros

#define EIGEN_DENSEBASE_PLUGIN   "stan/math/matrix/EigenDenseBaseAddons.h"
 
+

Macro Definition Documentation

+ +
+
+ + + + +
#define EIGEN_DENSEBASE_PLUGIN   "stan/math/matrix/EigenDenseBaseAddons.h"
+
+ +

Definition at line 4 of file Eigen.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/_eigen_8hpp_source.html b/doc/api/html/_eigen_8hpp_source.html new file mode 100644 index 00000000000..c293b4a464c --- /dev/null +++ b/doc/api/html/_eigen_8hpp_source.html @@ -0,0 +1,115 @@ + + + + + +Stan: src/stan/math/matrix/Eigen.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
Eigen.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__EIGEN_HPP__
+
2 #define __STAN__MATH__MATRIX__EIGEN_HPP__
+
3 
+
4 #define EIGEN_DENSEBASE_PLUGIN "stan/math/matrix/EigenDenseBaseAddons.h"
+
5 #include <Eigen/Dense>
+
6 #include <Eigen/QR>
+
7 
+
8 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/_eigen___num_traits_8hpp.html b/doc/api/html/_eigen___num_traits_8hpp.html new file mode 100644 index 00000000000..06ee7edc96b --- /dev/null +++ b/doc/api/html/_eigen___num_traits_8hpp.html @@ -0,0 +1,232 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/Eigen_NumTraits.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
Eigen_NumTraits.hpp File Reference
+
+
+
#include <limits>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/agrad/rev/var.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + + + + + + + + + + + + + + +

+Classes

struct  Eigen::NumTraits< stan::agrad::var >
 Numerical traits template override for Eigen for automatic gradient variables. More...
 
struct  Eigen::internal::significant_decimals_default_impl< stan::agrad::var, false >
 Implemented this for printing to stream. More...
 
struct  Eigen::internal::scalar_product_traits< stan::agrad::var, double >
 Scalar product traits override for Eigen for automatic gradient variables. More...
 
struct  Eigen::internal::scalar_product_traits< double, stan::agrad::var >
 Scalar product traits override for Eigen for automatic gradient variables. More...
 
struct  Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, ColMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >
 Override matrix-vector and matrix-matrix products to use more efficient implementation. More...
 
struct  Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, RowMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >
 
struct  Eigen::internal::general_matrix_matrix_product< Index, stan::agrad::var, LhsStorageOrder, ConjugateLhs, stan::agrad::var, RhsStorageOrder, ConjugateRhs, ColMajor >
 
+ + + + + + + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
namespace  Eigen
 (Expert) Numerical traits for algorithmic differentiation variables.
 
namespace  Eigen::internal
 (Expert) Product traits for algorithmic differentiation variables.
 
+

Variable Documentation

+ +
+
+ + + + + +
+ + + + +
stan::agrad::vari* alpha_
+
+static
+
+ +

Definition at line 14 of file Eigen_NumTraits.hpp.

+ +
+
+ +
+
+ + + + +
double dotval_
+
+ +

Definition at line 17 of file Eigen_NumTraits.hpp.

+ +
+
+ +
+
+ + + + +
size_t length_
+
+ +

Definition at line 18 of file Eigen_NumTraits.hpp.

+ +
+
+ +
+
+ + + + +
stan::agrad::vari** v1_
+
+ +

Definition at line 15 of file Eigen_NumTraits.hpp.

+ +
+
+ +
+
+ + + + +
stan::agrad::vari** v2_
+
+ +

Definition at line 16 of file Eigen_NumTraits.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/_eigen___num_traits_8hpp_source.html b/doc/api/html/_eigen___num_traits_8hpp_source.html new file mode 100644 index 00000000000..2d8aceed33e --- /dev/null +++ b/doc/api/html/_eigen___num_traits_8hpp_source.html @@ -0,0 +1,289 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/Eigen_NumTraits.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
Eigen_NumTraits.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__EIGEN_NUMTRAITS_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__EIGEN_NUMTRAITS_HPP__
+
3 
+
4 #include <limits>
+ +
6 #include <stan/agrad/rev/var.hpp>
+
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  namespace {
+
12  class gevv_vvv_vari : public stan::agrad::vari {
+
13  protected:
+ + + +
17  double dotval_;
+
18  size_t length_;
+
19  inline static double eval_gevv(const stan::agrad::var* alpha,
+
20  const stan::agrad::var* v1, int stride1,
+
21  const stan::agrad::var* v2, int stride2,
+
22  size_t length, double *dotprod) {
+
23  double result = 0;
+
24  for (size_t i = 0; i < length; i++)
+
25  result += v1[i*stride1].vi_->val_ * v2[i*stride2].vi_->val_;
+
26  *dotprod = result;
+
27  return alpha->vi_->val_ * result;
+
28  }
+
29  public:
+
30  gevv_vvv_vari(const stan::agrad::var* alpha,
+
31  const stan::agrad::var* v1, int stride1,
+
32  const stan::agrad::var* v2, int stride2, size_t length) :
+
33  vari(eval_gevv(alpha,v1,stride1,v2,stride2,length,&dotval_)), length_(length) {
+
34  alpha_ = alpha->vi_;
+ +
36  v2_ = v1_ + length_;
+
37  for (size_t i = 0; i < length_; i++)
+
38  v1_[i] = v1[i*stride1].vi_;
+
39  for (size_t i = 0; i < length_; i++)
+
40  v2_[i] = v2[i*stride2].vi_;
+
41  }
+
42  virtual ~gevv_vvv_vari() {}
+
43  void chain() {
+
44  const double adj_alpha = adj_ * alpha_->val_;
+
45  for (size_t i = 0; i < length_; i++) {
+
46  v1_[i]->adj_ += adj_alpha * v2_[i]->val_;
+
47  v2_[i]->adj_ += adj_alpha * v1_[i]->val_;
+
48  }
+
49  alpha_->adj_ += adj_ * dotval_;
+
50  }
+
51  };
+
52  }
+
53 
+
54  }
+
55 }
+
56 
+
57 
+
58 namespace Eigen {
+
59 
+
64  template <>
+
65  struct NumTraits<stan::agrad::var> {
+ +
72 
+ +
79 
+ +
86 
+
93  inline static Real epsilon() {
+
94  return std::numeric_limits<double>::epsilon();
+
95  }
+
96 
+
100  inline static Real dummy_precision() {
+
101  return 1e-12; // copied from NumTraits.h values for double
+
102  }
+
103 
+
110  inline static Real highest() {
+ +
112  }
+
113 
+
120  inline static Real lowest() {
+ +
122  }
+
123 
+
128  enum {
+
129  IsInteger = 0,
+
130  IsSigned = 1,
+
131  IsComplex = 0,
+
132  RequireInitialization = 0,
+
133  ReadCost = 1,
+
134  AddCost = 1,
+
135  MulCost = 1,
+
136  HasFloatingPoint = 1
+
137  };
+
138  };
+
139 
+
140  namespace internal {
+
144  template<>
+
145  struct significant_decimals_default_impl<stan::agrad::var,false>
+
146  {
+
147  static inline int run()
+
148  {
+
149  using std::ceil;
+
150  using std::log;
+
151  return cast<double,int>(ceil(-log(std::numeric_limits<double>::epsilon())
+
152  / log(10.0)));
+
153  }
+
154  };
+
155 
+
160  template <>
+
161  struct scalar_product_traits<stan::agrad::var,double> {
+ +
163  };
+
164 
+
169  template <>
+
170  struct scalar_product_traits<double,stan::agrad::var> {
+ +
172  };
+
173 
+
177  template<typename Index, bool ConjugateLhs, bool ConjugateRhs>
+
178  struct general_matrix_vector_product<Index,stan::agrad::var,ColMajor,ConjugateLhs,stan::agrad::var,ConjugateRhs>
+
179  {
+ + +
182  typedef typename scalar_product_traits<LhsScalar, RhsScalar>::ReturnType ResScalar;
+
183  enum { LhsStorageOrder = ColMajor };
+
184 
+
185  EIGEN_DONT_INLINE static void run(
+
186  Index rows, Index cols,
+
187  const LhsScalar* lhs, Index lhsStride,
+
188  const RhsScalar* rhs, Index rhsIncr,
+
189  ResScalar* res, Index resIncr, const ResScalar &alpha)
+
190  {
+
191  for (Index i = 0; i < rows; i++) {
+
192  res[i*resIncr] += stan::agrad::var(new stan::agrad::gevv_vvv_vari(&alpha,((int)LhsStorageOrder == (int)ColMajor)?(&lhs[i]):(&lhs[i*lhsStride]),((int)LhsStorageOrder == (int)ColMajor)?(lhsStride):(1),rhs,rhsIncr,cols));
+
193  }
+
194  }
+
195  };
+
196  template<typename Index, bool ConjugateLhs, bool ConjugateRhs>
+
197  struct general_matrix_vector_product<Index,stan::agrad::var,RowMajor,ConjugateLhs,stan::agrad::var,ConjugateRhs>
+
198  {
+ + +
201  typedef typename scalar_product_traits<LhsScalar, RhsScalar>::ReturnType ResScalar;
+
202  enum { LhsStorageOrder = RowMajor };
+
203 
+
204  EIGEN_DONT_INLINE static void run(
+
205  Index rows, Index cols,
+
206  const LhsScalar* lhs, Index lhsStride,
+
207  const RhsScalar* rhs, Index rhsIncr,
+
208  ResScalar* res, Index resIncr, const RhsScalar &alpha)
+
209  {
+
210  for (Index i = 0; i < rows; i++) {
+
211  res[i*resIncr] += stan::agrad::var(new stan::agrad::gevv_vvv_vari(&alpha,((int)LhsStorageOrder == (int)ColMajor)?(&lhs[i]):(&lhs[i*lhsStride]),((int)LhsStorageOrder == (int)ColMajor)?(lhsStride):(1),rhs,rhsIncr,cols));
+
212  }
+
213  }
+
214  };
+
215  template<typename Index, int LhsStorageOrder, bool ConjugateLhs, int RhsStorageOrder, bool ConjugateRhs>
+
216  struct general_matrix_matrix_product<Index,stan::agrad::var,LhsStorageOrder,ConjugateLhs,stan::agrad::var,RhsStorageOrder,ConjugateRhs,ColMajor>
+
217  {
+ + +
220  typedef typename scalar_product_traits<LhsScalar, RhsScalar>::ReturnType ResScalar;
+
221  static void run(Index rows, Index cols, Index depth,
+
222  const LhsScalar* _lhs, Index lhsStride,
+
223  const RhsScalar* _rhs, Index rhsStride,
+
224  ResScalar* res, Index resStride,
+
225  const ResScalar &alpha,
+
226  level3_blocking<LhsScalar,RhsScalar>& /* blocking */,
+
227  GemmParallelInfo<Index>* /* info = 0 */)
+
228  {
+
229  for (Index i = 0; i < cols; i++) {
+
230  general_matrix_vector_product<Index,LhsScalar,LhsStorageOrder,ConjugateLhs,RhsScalar,ConjugateRhs>::run(
+
231  rows,depth,_lhs,lhsStride,
+
232  &_rhs[((int)RhsStorageOrder == (int)ColMajor)?(i*rhsStride):(i)],((int)RhsStorageOrder == (int)ColMajor)?(1):(rhsStride),
+
233  &res[i*resStride],1,alpha);
+
234  }
+
235  }
+
236  };
+
237  }
+
238 }
+
239 
+
240 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/accumulator_8hpp.html b/doc/api/html/accumulator_8hpp.html new file mode 100644 index 00000000000..5d628fafccd --- /dev/null +++ b/doc/api/html/accumulator_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/matrix/accumulator.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
accumulator.hpp File Reference
+
+
+
#include <vector>
+#include <stan/math/matrix/sum.hpp>
+
+

Go to the source code of this file.

+ + + + + +

+Classes

class  stan::math::accumulator< T >
 Class to accumulate values and eventually return their sum. More...
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/accumulator_8hpp_source.html b/doc/api/html/accumulator_8hpp_source.html new file mode 100644 index 00000000000..88797bdc64d --- /dev/null +++ b/doc/api/html/accumulator_8hpp_source.html @@ -0,0 +1,146 @@ + + + + + +Stan: src/stan/math/matrix/accumulator.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
accumulator.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__ACCUMULATOR_HPP__
+
2 #define __STAN__MATH__MATRIX__ACCUMULATOR_HPP__
+
3 
+
4 #include <vector>
+ +
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
20  template <typename T>
+
21  class accumulator {
+
22  private:
+
23  std::vector<T> buf_;
+
24 
+
25  public:
+ +
30  : buf_() {
+
31  }
+
32 
+ +
34 
+
40  void add(const T& x) {
+
41  buf_.push_back(x);
+
42  }
+
43 
+
49  T sum() {
+
50  using math::sum;
+
51  return sum(buf_);
+
52  }
+
53 
+
54  };
+
55 
+
56 
+
57 
+
58 
+
59  }
+
60 }
+
61 
+
62 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/adapt__dense__e__nuts_8hpp.html b/doc/api/html/adapt__dense__e__nuts_8hpp.html new file mode 100644 index 00000000000..f9b5e2c3144 --- /dev/null +++ b/doc/api/html/adapt__dense__e__nuts_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/mcmc/hmc/nuts/adapt_dense_e_nuts.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
adapt_dense_e_nuts.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::adapt_dense_e_nuts< M, BaseRNG >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/adapt__dense__e__nuts_8hpp_source.html b/doc/api/html/adapt__dense__e__nuts_8hpp_source.html new file mode 100644 index 00000000000..29c7e79b979 --- /dev/null +++ b/doc/api/html/adapt__dense__e__nuts_8hpp_source.html @@ -0,0 +1,171 @@ + + + + + +Stan: src/stan/mcmc/hmc/nuts/adapt_dense_e_nuts.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
adapt_dense_e_nuts.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__ADAPT__DENSE__E__NUTS__BETA__
+
2 #define __STAN__MCMC__ADAPT__DENSE__E__NUTS__BETA__
+
3 
+ + +
6 
+
7 namespace stan {
+
8 
+
9  namespace mcmc {
+
10 
+
11  // The No-U-Turn Sampler (NUTS) on a
+
12  // Euclidean manifold with dense metric
+
13  // and adaptive stepsize
+
14 
+
15  template <typename M, class BaseRNG>
+
16  class adapt_dense_e_nuts: public dense_e_nuts<M, BaseRNG>,
+
17  public stepsize_covar_adapter {
+
18 
+
19  public:
+
20 
+
21  adapt_dense_e_nuts(M &m, BaseRNG& rng,
+
22  std::ostream* o = &std::cout, std::ostream* e = 0):
+
23  dense_e_nuts<M, BaseRNG>(m, rng, o, e),
+
24  stepsize_covar_adapter(m.num_params_r())
+
25  {};
+
26 
+ +
28 
+
29  sample transition(sample& init_sample) {
+
30 
+ +
32 
+
33  if (this->_adapt_flag) {
+
34 
+ +
36 
+
37  bool update = this->_covar_adaptation.learn_covariance(this->_z.mInv, this->_z.q);
+
38 
+
39  if(update) {
+
40  this->init_stepsize();
+
41 
+
42  this->_stepsize_adaptation.set_mu(log(10 * this->_nom_epsilon));
+ +
44  }
+
45 
+
46  }
+
47 
+
48  return s;
+
49 
+
50  }
+
51 
+ + + +
55  }
+
56 
+
57  };
+
58 
+
59  } // mcmc
+
60 
+
61 } // stan
+
62 
+
63 
+
64 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/adapt__dense__e__static__hmc_8hpp.html b/doc/api/html/adapt__dense__e__static__hmc_8hpp.html new file mode 100644 index 00000000000..e6b00bfb8fb --- /dev/null +++ b/doc/api/html/adapt__dense__e__static__hmc_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/mcmc/hmc/static/adapt_dense_e_static_hmc.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
adapt_dense_e_static_hmc.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::adapt_dense_e_static_hmc< M, BaseRNG >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/adapt__dense__e__static__hmc_8hpp_source.html b/doc/api/html/adapt__dense__e__static__hmc_8hpp_source.html new file mode 100644 index 00000000000..42dda3153bc --- /dev/null +++ b/doc/api/html/adapt__dense__e__static__hmc_8hpp_source.html @@ -0,0 +1,174 @@ + + + + + +Stan: src/stan/mcmc/hmc/static/adapt_dense_e_static_hmc.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
adapt_dense_e_static_hmc.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__ADAPT__DENSE__E__STATIC__HMC__BETA__
+
2 #define __STAN__MCMC__ADAPT__DENSE__E__STATIC__HMC__BETA__
+
3 
+ + +
6 
+
7 namespace stan {
+
8 
+
9  namespace mcmc {
+
10 
+
11  // Hamiltonian Monte Carlo on a
+
12  // Euclidean manifold with dense metric,
+
13  // static integration time,
+
14  // and adaptive stepsize
+
15 
+
16  template <typename M, class BaseRNG>
+
17  class adapt_dense_e_static_hmc: public dense_e_static_hmc<M, BaseRNG>,
+
18  public stepsize_covar_adapter {
+
19 
+
20  public:
+
21 
+
22  adapt_dense_e_static_hmc(M &m, BaseRNG& rng,
+
23  std::ostream* o = &std::cout, std::ostream* e = 0):
+
24  dense_e_static_hmc<M, BaseRNG>(m, rng, o, e),
+
25  stepsize_covar_adapter(m.num_params_r())
+
26  {};
+
27 
+ +
29 
+
30  sample transition(sample& init_sample) {
+
31 
+ +
33 
+
34  if (this->_adapt_flag) {
+
35 
+ +
37  this->_update_L();
+
38 
+
39  bool update = this->_covar_adaptation.learn_covariance(this->_z.mInv, this->_z.q);
+
40 
+
41  if(update) {
+
42  this->init_stepsize();
+
43  this->_update_L();
+
44 
+
45  this->_stepsize_adaptation.set_mu(log(10 * this->_nom_epsilon));
+ +
47  }
+
48 
+
49  }
+
50 
+
51  return s;
+
52 
+
53  }
+
54 
+ + + +
58  }
+
59 
+
60  };
+
61 
+
62  } // mcmc
+
63 
+
64 } // stan
+
65 
+
66 
+
67 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/adapt__diag__e__nuts_8hpp.html b/doc/api/html/adapt__diag__e__nuts_8hpp.html new file mode 100644 index 00000000000..5d9c472850d --- /dev/null +++ b/doc/api/html/adapt__diag__e__nuts_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/mcmc/hmc/nuts/adapt_diag_e_nuts.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
adapt_diag_e_nuts.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::adapt_diag_e_nuts< M, BaseRNG >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/adapt__diag__e__nuts_8hpp_source.html b/doc/api/html/adapt__diag__e__nuts_8hpp_source.html new file mode 100644 index 00000000000..ab5de2903c9 --- /dev/null +++ b/doc/api/html/adapt__diag__e__nuts_8hpp_source.html @@ -0,0 +1,171 @@ + + + + + +Stan: src/stan/mcmc/hmc/nuts/adapt_diag_e_nuts.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
adapt_diag_e_nuts.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__ADAPT__DIAG__E__NUTS__BETA__
+
2 #define __STAN__MCMC__ADAPT__DIAG__E__NUTS__BETA__
+
3 
+ + +
6 
+
7 namespace stan {
+
8 
+
9  namespace mcmc {
+
10 
+
11  // The No-U-Turn Sampler (NUTS) on a
+
12  // Euclidean manifold with diagonal metric
+
13  // and adaptive stepsize
+
14 
+
15  template <typename M, class BaseRNG>
+
16  class adapt_diag_e_nuts: public diag_e_nuts<M, BaseRNG>,
+
17  public stepsize_var_adapter {
+
18 
+
19  public:
+
20 
+
21  adapt_diag_e_nuts(M &m, BaseRNG& rng,
+
22  std::ostream* o = &std::cout, std::ostream* e = 0):
+
23  diag_e_nuts<M, BaseRNG>(m, rng, o, e),
+
24  stepsize_var_adapter(m.num_params_r())
+
25  {};
+
26 
+ +
28 
+
29  sample transition(sample& init_sample) {
+
30 
+ +
32 
+
33  if (this->_adapt_flag) {
+
34 
+ +
36 
+
37  bool update = this->_var_adaptation.learn_variance(this->_z.mInv, this->_z.q);
+
38 
+
39  if(update) {
+
40  this->init_stepsize();
+
41 
+
42  this->_stepsize_adaptation.set_mu(log(10 * this->_nom_epsilon));
+ +
44  }
+
45 
+
46  }
+
47 
+
48  return s;
+
49 
+
50  }
+
51 
+ + + +
55  }
+
56 
+
57  };
+
58 
+
59  } // mcmc
+
60 
+
61 } // stan
+
62 
+
63 
+
64 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/adapt__diag__e__static__hmc_8hpp.html b/doc/api/html/adapt__diag__e__static__hmc_8hpp.html new file mode 100644 index 00000000000..b809e16ea64 --- /dev/null +++ b/doc/api/html/adapt__diag__e__static__hmc_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/mcmc/hmc/static/adapt_diag_e_static_hmc.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
adapt_diag_e_static_hmc.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::adapt_diag_e_static_hmc< M, BaseRNG >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/adapt__diag__e__static__hmc_8hpp_source.html b/doc/api/html/adapt__diag__e__static__hmc_8hpp_source.html new file mode 100644 index 00000000000..b6304dabd1e --- /dev/null +++ b/doc/api/html/adapt__diag__e__static__hmc_8hpp_source.html @@ -0,0 +1,174 @@ + + + + + +Stan: src/stan/mcmc/hmc/static/adapt_diag_e_static_hmc.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
adapt_diag_e_static_hmc.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__ADAPT__DIAG__E__STATIC__HMC__BETA__
+
2 #define __STAN__MCMC__ADAPT__DIAG__E__STATIC__HMC__BETA__
+
3 
+ + +
6 
+
7 namespace stan {
+
8 
+
9  namespace mcmc {
+
10 
+
11  // Hamiltonian Monte Carlo on a
+
12  // Euclidean manifold with diagonal metric,
+
13  // static integration time,
+
14  // and adaptive stepsize
+
15 
+
16  template <typename M, class BaseRNG>
+
17  class adapt_diag_e_static_hmc: public diag_e_static_hmc<M, BaseRNG>,
+
18  public stepsize_var_adapter {
+
19 
+
20  public:
+
21 
+
22  adapt_diag_e_static_hmc(M &m, BaseRNG& rng,
+
23  std::ostream* o = &std::cout, std::ostream* e = 0):
+
24  diag_e_static_hmc<M, BaseRNG>(m, rng, o, e),
+
25  stepsize_var_adapter(m.num_params_r())
+
26  {};
+
27 
+ +
29 
+
30  sample transition(sample& init_sample) {
+
31 
+ +
33 
+
34  if (this->_adapt_flag) {
+
35 
+ +
37  this->_update_L();
+
38 
+
39  bool update = this->_var_adaptation.learn_variance(this->_z.mInv, this->_z.q);
+
40 
+
41  if(update) {
+
42  this->init_stepsize();
+
43  this->_update_L();
+
44 
+
45  this->_stepsize_adaptation.set_mu(log(10 * this->_nom_epsilon));
+ +
47  }
+
48 
+
49  }
+
50 
+
51  return s;
+
52 
+
53  }
+
54 
+ + + +
58  }
+
59 
+
60  };
+
61 
+
62  } // mcmc
+
63 
+
64 } // stan
+
65 
+
66 
+
67 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/adapt__unit__e__nuts_8hpp.html b/doc/api/html/adapt__unit__e__nuts_8hpp.html new file mode 100644 index 00000000000..2ba6b53c379 --- /dev/null +++ b/doc/api/html/adapt__unit__e__nuts_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/mcmc/hmc/nuts/adapt_unit_e_nuts.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
adapt_unit_e_nuts.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::adapt_unit_e_nuts< M, BaseRNG >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/adapt__unit__e__nuts_8hpp_source.html b/doc/api/html/adapt__unit__e__nuts_8hpp_source.html new file mode 100644 index 00000000000..4e68889f032 --- /dev/null +++ b/doc/api/html/adapt__unit__e__nuts_8hpp_source.html @@ -0,0 +1,157 @@ + + + + + +Stan: src/stan/mcmc/hmc/nuts/adapt_unit_e_nuts.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
adapt_unit_e_nuts.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__ADAPT__UNIT__E__NUTS__BETA__
+
2 #define __STAN__MCMC__ADAPT__UNIT__E__NUTS__BETA__
+
3 
+ + +
6 
+
7 namespace stan {
+
8 
+
9  namespace mcmc {
+
10 
+
11  // The No-U-Turn Sampler (NUTS) on a
+
12  // Euclidean manifold with unit metric
+
13  // and adaptive stepsize
+
14 
+
15  template <typename M, class BaseRNG>
+
16  class adapt_unit_e_nuts: public unit_e_nuts<M, BaseRNG>,
+
17  public stepsize_adapter {
+
18 
+
19  public:
+
20 
+
21  adapt_unit_e_nuts(M &m, BaseRNG& rng,
+
22  std::ostream* o = &std::cout, std::ostream* e = 0):
+
23  unit_e_nuts<M, BaseRNG>(m, rng, o, e) {};
+
24 
+ +
26 
+
27  sample transition(sample& init_sample) {
+
28 
+ +
30 
+
31  if (this->_adapt_flag)
+ +
33 
+
34  return s;
+
35 
+
36  }
+
37 
+ + + +
41  }
+
42 
+
43  };
+
44 
+
45  } // mcmc
+
46 
+
47 } // stan
+
48 
+
49 
+
50 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/adapt__unit__e__static__hmc_8hpp.html b/doc/api/html/adapt__unit__e__static__hmc_8hpp.html new file mode 100644 index 00000000000..91a11d20414 --- /dev/null +++ b/doc/api/html/adapt__unit__e__static__hmc_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/mcmc/hmc/static/adapt_unit_e_static_hmc.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
adapt_unit_e_static_hmc.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::adapt_unit_e_static_hmc< M, BaseRNG >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/adapt__unit__e__static__hmc_8hpp_source.html b/doc/api/html/adapt__unit__e__static__hmc_8hpp_source.html new file mode 100644 index 00000000000..60f0f5c335a --- /dev/null +++ b/doc/api/html/adapt__unit__e__static__hmc_8hpp_source.html @@ -0,0 +1,160 @@ + + + + + +Stan: src/stan/mcmc/hmc/static/adapt_unit_e_static_hmc.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
adapt_unit_e_static_hmc.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__ADAPT__UNIT__E__STATIC__HMC__BETA__
+
2 #define __STAN__MCMC__ADAPT__UNIT__E__STATIC__HMC__BETA__
+
3 
+ + +
6 
+
7 namespace stan {
+
8 
+
9  namespace mcmc {
+
10 
+
11  // Hamiltonian Monte Carlo on a
+
12  // Euclidean manifold with unit metric,
+
13  // static integration time,
+
14  // and adaptive stepsize
+
15 
+
16  template <typename M, class BaseRNG>
+
17  class adapt_unit_e_static_hmc: public unit_e_static_hmc<M, BaseRNG>,
+
18  public stepsize_adapter {
+
19 
+
20  public:
+
21 
+
22  adapt_unit_e_static_hmc(M &m, BaseRNG& rng,
+
23  std::ostream* o = &std::cout, std::ostream* e = 0):
+
24  unit_e_static_hmc<M, BaseRNG>(m, rng, o, e) {};
+
25 
+ +
27 
+
28  sample transition(sample& init_sample) {
+
29 
+ +
31 
+
32  if (this->_adapt_flag) {
+ +
34  this->_update_L();
+
35  }
+
36 
+
37  return s;
+
38 
+
39  }
+
40 
+ + + +
44  }
+
45 
+
46  };
+
47 
+
48  } // mcmc
+
49 
+
50 } // stan
+
51 
+
52 
+
53 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/add_8hpp.html b/doc/api/html/add_8hpp.html new file mode 100644 index 00000000000..c52f5b71076 --- /dev/null +++ b/doc/api/html/add_8hpp.html @@ -0,0 +1,146 @@ + + + + + +Stan: src/stan/math/matrix/add.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
add.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/validate_matching_dims.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + + + + + +

+Functions

template<typename T1 , typename T2 , int R, int C>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R, C > 
stan::math::add (const Eigen::Matrix< T1, R, C > &m1, const Eigen::Matrix< T2, R, C > &m2)
 Return the sum of the specified matrices.
 
template<typename T1 , typename T2 , int R, int C>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R, C > 
stan::math::add (const Eigen::Matrix< T1, R, C > &m, const T2 &c)
 Return the sum of the specified matrix and specified scalar.
 
template<typename T1 , typename T2 , int R, int C>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R, C > 
stan::math::add (const T1 &c, const Eigen::Matrix< T2, R, C > &m)
 Return the sum of the specified scalar and specified matrix.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/add_8hpp_source.html b/doc/api/html/add_8hpp_source.html new file mode 100644 index 00000000000..d36b78ca7e4 --- /dev/null +++ b/doc/api/html/add_8hpp_source.html @@ -0,0 +1,157 @@ + + + + + +Stan: src/stan/math/matrix/add.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
add.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__ADD_HPP__
+
2 #define __STAN__MATH__MATRIX__ADD_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+ + +
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
24  template <typename T1, typename T2, int R, int C>
+
25  inline
+
26  Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type,R,C>
+
27  add(const Eigen::Matrix<T1,R,C>& m1,
+
28  const Eigen::Matrix<T2,R,C>& m2) {
+ +
30  Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type,R,C>
+
31  result(m1.rows(),m1.cols());
+
32  for (int i = 0; i < result.size(); ++i)
+
33  result(i) = m1(i) + m2(i);
+
34  return result;
+
35  }
+
36 
+
46  template <typename T1, typename T2, int R, int C>
+
47  inline
+
48  Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type,R,C>
+
49  add(const Eigen::Matrix<T1,R,C>& m,
+
50  const T2& c) {
+
51  Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type,R,C>
+
52  result(m.rows(),m.cols());
+
53  for (int i = 0; i < result.size(); ++i)
+
54  result(i) = m(i) + c;
+
55  return result;
+
56  }
+
57 
+
67  template <typename T1, typename T2, int R, int C>
+
68  inline
+
69  Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type,R,C>
+
70  add(const T1& c,
+
71  const Eigen::Matrix<T2,R,C>& m) {
+
72  Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type,R,C>
+
73  result(m.rows(),m.cols());
+
74  for (int i = 0; i < result.size(); ++i)
+
75  result(i) = c + m(i);
+
76  return result;
+
77  }
+
78 
+
79  }
+
80 }
+
81 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2_phi_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2_phi_8hpp.html new file mode 100644 index 00000000000..b74f464ce71 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2_phi_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/Phi.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
Phi.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::Phi (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2_phi_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2_phi_8hpp_source.html new file mode 100644 index 00000000000..791607d4634 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2_phi_8hpp_source.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/Phi.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
Phi.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__PHI_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__PHI_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ + +
8 
+
9 namespace stan {
+
10 
+
11  namespace agrad {
+
12 
+
13  template <typename T>
+
14  inline fvar<T> Phi(const fvar<T>& x) {
+
15  using stan::math::Phi;
+
16  using std::exp;
+
17  using std::sqrt;
+
18  T xv = x.val_;
+
19  return fvar<T>(Phi(xv),
+
20  x.d_ * exp(xv * xv / -2.0) / sqrt(2.0 * stan::math::pi()));
+
21  }
+
22  }
+
23 }
+
24 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2abs_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2abs_8hpp.html new file mode 100644 index 00000000000..9a7df61c974 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2abs_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/abs.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
abs.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::abs (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2abs_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2abs_8hpp_source.html new file mode 100644 index 00000000000..436cdb9175e --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2abs_8hpp_source.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/abs.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
abs.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__ABS_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__ABS_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template<typename T>
+
13  inline
+
14  fvar<T>
+
15  abs(const fvar<T>& x) {
+ +
17  if (x.val_ > 0.0)
+
18  return x;
+
19  else if (x.val_ < 0.0)
+
20  return fvar<T>(-x.val_, -x.d_);
+
21  else if (x.val_ == 0.0)
+
22  return fvar<T>(0, 0);
+
23  else
+ +
25  }
+
26  }
+
27 }
+
28 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2bessel__first__kind_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2bessel__first__kind_8hpp.html new file mode 100644 index 00000000000..f87188f7ce0 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2bessel__first__kind_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/bessel_first_kind.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
bessel_first_kind.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::bessel_first_kind (int v, const fvar< T > &z)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2bessel__first__kind_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2bessel__first__kind_8hpp_source.html new file mode 100644 index 00000000000..dcfe895d18c --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2bessel__first__kind_8hpp_source.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/bessel_first_kind.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
bessel_first_kind.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__BESSEL_FIRST_KIND_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__BESSEL_FIRST_KIND_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+
15  bessel_first_kind(int v, const fvar<T>& z) {
+ +
17 
+
18  T bessel_first_kind_z(bessel_first_kind(v, z.val_));
+
19  return fvar<T>(bessel_first_kind_z,
+
20  v * z.d_ * bessel_first_kind_z / z.val_
+
21  - z.d_ * bessel_first_kind(v + 1,z.val_));
+
22  }
+
23  }
+
24 }
+
25 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2bessel__second__kind_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2bessel__second__kind_8hpp.html new file mode 100644 index 00000000000..7b7d6d5ab25 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2bessel__second__kind_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/bessel_second_kind.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
bessel_second_kind.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::bessel_second_kind (int v, const fvar< T > &z)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2bessel__second__kind_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2bessel__second__kind_8hpp_source.html new file mode 100644 index 00000000000..189e06a2f51 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2bessel__second__kind_8hpp_source.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/bessel_second_kind.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
bessel_second_kind.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__BESSEL_SECOND_KIND_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__BESSEL_SECOND_KIND_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+
15  bessel_second_kind(int v, const fvar<T>& z) {
+ +
17 
+
18  T bessel_second_kind_z(bessel_second_kind(v, z.val_));
+
19  return fvar<T>(bessel_second_kind_z,
+
20  v * z.d_ * bessel_second_kind_z / z.val_
+
21  - z.d_ * bessel_second_kind(v + 1,z.val_));
+
22  }
+
23  }
+
24 }
+
25 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2binary__log__loss_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2binary__log__loss_8hpp.html new file mode 100644 index 00000000000..8fe391eca70 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2binary__log__loss_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/binary_log_loss.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
binary_log_loss.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::binary_log_loss (const int y, const fvar< T > &y_hat)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2binary__log__loss_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2binary__log__loss_8hpp_source.html new file mode 100644 index 00000000000..8e427e25eab --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2binary__log__loss_8hpp_source.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/binary_log_loss.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
binary_log_loss.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__BINARY_LOG_LOSS_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__BINARY_LOG_LOSS_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+
15  binary_log_loss(const int y, const fvar<T>& y_hat) {
+ +
17 
+
18  if (y)
+
19  return fvar<T>(binary_log_loss(y,y_hat.val_), -y_hat.d_ / y_hat.val_);
+
20  else
+
21  return fvar<T>(binary_log_loss(y,y_hat.val_), y_hat.d_ / (1.0 - y_hat.val_));
+
22  }
+
23  }
+
24 }
+
25 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2binomial__coefficient__log_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2binomial__coefficient__log_8hpp.html new file mode 100644 index 00000000000..a9f6e09c841 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2binomial__coefficient__log_8hpp.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/binomial_coefficient_log.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
binomial_coefficient_log.hpp File Reference
+
+
+
#include <stan/agrad/fwd/fvar.hpp>
+#include <stan/meta/traits.hpp>
+#include <boost/math/special_functions/digamma.hpp>
+#include <stan/math/functions/binomial_coefficient_log.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::binomial_coefficient_log (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > stan::agrad::binomial_coefficient_log (const fvar< T > &x1, const double x2)
 
template<typename T >
fvar< T > stan::agrad::binomial_coefficient_log (const double x1, const fvar< T > &x2)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2binomial__coefficient__log_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2binomial__coefficient__log_8hpp_source.html new file mode 100644 index 00000000000..b4cb339009c --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2binomial__coefficient__log_8hpp_source.html @@ -0,0 +1,197 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/binomial_coefficient_log.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
binomial_coefficient_log.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__BINOMIAL_COEFFICIENT_LOG_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__BINOMIAL_COEFFICIENT_LOG_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 #include <boost/math/special_functions/digamma.hpp>
+ +
8 
+
9 namespace stan {
+
10 
+
11  namespace agrad {
+
12 
+
13  template <typename T>
+
14  inline
+
15  fvar<T>
+
16  binomial_coefficient_log(const fvar<T>& x1, const fvar<T>& x2) {
+ +
18  using std::log;
+ +
20  const double cutoff = 1000;
+
21  if ((x1.val_ < cutoff) || (x1.val_ - x2.val_ < cutoff)) {
+ +
23  x1.d_ * digamma(x1.val_ + 1)
+
24  - x2.d_ * digamma(x2.val_ + 1)
+
25  - (x1.d_ - x2.d_) * digamma(x1.val_ - x2.val_ + 1));
+
26  } else {
+
27  return fvar<T>(binomial_coefficient_log(x1.val_, x2.val_),
+
28  x2.d_ * log(x1.val_ - x2.val_)
+
29  + x2.val_ * (x1.d_ - x2.d_) / (x1.val_ - x2.val_)
+
30  + x1.d_ * log(x1.val_ / (x1.val_ - x2.val_))
+
31  + (x1.val_ + 0.5) / (x1.val_ / (x1.val_ - x2.val_))
+
32  * (x1.d_ * (x1.val_ - x2.val_) - (x1.d_ - x2.d_) * x1.val_)
+
33  / ((x1.val_ - x2.val_) * (x1.val_ - x2.val_))
+
34  - x1.d_ / (12.0 * x1.val_ * x1.val_)
+
35  - x2.d_
+
36  + (x1.d_ - x2.d_) / (12.0 * (x1.val_ - x2.val_)
+
37  * (x1.val_ - x2.val_))
+
38  - digamma(x2.val_ + 1) * x2.d_);
+
39  }
+
40  }
+
41 
+
42  template <typename T>
+
43  inline
+
44  fvar<T>
+
45  binomial_coefficient_log(const fvar<T>& x1, const double x2) {
+ +
47  using std::log;
+ +
49  const double cutoff = 1000;
+
50  if ((x1.val_ < cutoff) || (x1.val_ - x2 < cutoff)) {
+
51  return fvar<T>(binomial_coefficient_log(x1.val_, x2),
+
52  x1.d_ * digamma(x1.val_ + 1)
+
53  - x1.d_ * digamma(x1.val_ - x2 + 1));
+
54  } else {
+
55  return fvar<T>(binomial_coefficient_log(x1.val_, x2),
+
56  x2 * x1.d_ / (x1.val_ - x2)
+
57  + x1.d_ * log(x1.val_ / (x1.val_ - x2))
+
58  + (x1.val_ + 0.5) / (x1.val_ / (x1.val_ - x2))
+
59  * (x1.d_ * (x1.val_ - x2) - x1.d_ * x1.val_)
+
60  / ((x1.val_ - x2) * (x1.val_ - x2))
+
61  - x1.d_ / (12.0 * x1.val_ * x1.val_)
+
62  + x1.d_ / (12.0 * (x1.val_ - x2) * (x1.val_ - x2)));
+
63  }
+
64  }
+
65 
+
66  template <typename T>
+
67  inline
+
68  fvar<T>
+
69  binomial_coefficient_log(const double x1, const fvar<T>& x2) {
+ +
71  using std::log;
+ +
73  const double cutoff = 1000;
+
74  if ((x1 < cutoff) || (x1 - x2.val_ < cutoff)) {
+
75  return fvar<T>(binomial_coefficient_log(x1, x2.val_),
+
76  -x2.d_ * digamma(x2.val_ + 1)
+
77  - x2.d_ * digamma(x1 - x2.val_ + 1));
+
78  } else {
+
79  return fvar<T>(binomial_coefficient_log(x1, x2.val_),
+
80  x2.d_ * log(x1 - x2.val_)
+
81  + x2.val_ * -x2.d_ / (x1 - x2.val_)
+
82  - x2.d_
+
83  - x2.d_ / (12.0 * (x1 - x2.val_) * (x1 - x2.val_))
+
84  + x2.d_ * (x1 + 0.5) / (x1 - x2.val_)
+
85  - digamma(x2.val_ + 1) * x2.d_);
+
86  }
+
87  }
+
88  }
+
89 }
+
90 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2digamma_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2digamma_8hpp.html new file mode 100644 index 00000000000..cac318916b0 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2digamma_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/digamma.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
digamma.hpp File Reference
+
+
+
#include <stan/agrad/fwd/fvar.hpp>
+#include <stan/meta/traits.hpp>
+#include <boost/math/special_functions/digamma.hpp>
+#include <stan/math/functions/trigamma.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::digamma (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2digamma_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2digamma_8hpp_source.html new file mode 100644 index 00000000000..4a4ce94af40 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2digamma_8hpp_source.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/digamma.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
digamma.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__DIGAMMA_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__DIGAMMA_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 #include <boost/math/special_functions/digamma.hpp>
+ +
8 
+
9 namespace stan {
+
10 
+
11  namespace agrad {
+
12 
+
13  template <typename T>
+
14  inline
+
15  fvar<T>
+
16  digamma(const fvar<T>& x) {
+ + +
19  return fvar<T>(digamma(x.val_), x.d_ * trigamma(x.val_));
+
20  }
+
21  }
+
22 }
+
23 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2exp2_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2exp2_8hpp.html new file mode 100644 index 00000000000..6f188db5187 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2exp2_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/exp2.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
exp2.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::exp2 (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2exp2_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2exp2_8hpp_source.html new file mode 100644 index 00000000000..dde87d3362c --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2exp2_8hpp_source.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/exp2.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
exp2.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__EXP2_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__EXP2_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ + +
8 
+
9 namespace stan {
+
10 
+
11  namespace agrad {
+
12 
+
13  template <typename T>
+
14  inline
+
15  fvar<T>
+
16  exp2(const fvar<T>& x) {
+
17  using stan::math::exp2;
+
18  using std::log;
+
19  return fvar<T>(exp2(x.val_), x.d_ * exp2(x.val_) * stan::math::LOG_2);
+
20  }
+
21  }
+
22 }
+
23 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2exp_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2exp_8hpp.html new file mode 100644 index 00000000000..f1dab53834c --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2exp_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/exp.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
exp.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::exp (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2exp_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2exp_8hpp_source.html new file mode 100644 index 00000000000..0ebb5925fe4 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2exp_8hpp_source.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/exp.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
exp.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__EXP_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__EXP_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 
+
7 namespace stan {
+
8 
+
9  namespace agrad {
+
10 
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+
15  exp(const fvar<T>& x) {
+
16  using std::exp;
+
17  return fvar<T>(exp(x.val_), x.d_ * exp(x.val_));
+
18  }
+
19  }
+
20 }
+
21 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2falling__factorial_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2falling__factorial_8hpp.html new file mode 100644 index 00000000000..f3077e18059 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2falling__factorial_8hpp.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/falling_factorial.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
falling_factorial.hpp File Reference
+
+
+
#include <stan/agrad/fwd/fvar.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/math/functions/falling_factorial.hpp>
+#include <boost/math/special_functions/digamma.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::falling_factorial (const fvar< T > &x, const fvar< T > &n)
 
template<typename T >
fvar< T > stan::agrad::falling_factorial (const fvar< T > &x, const double n)
 
template<typename T >
fvar< T > stan::agrad::falling_factorial (const double x, const fvar< T > &n)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2falling__factorial_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2falling__factorial_8hpp_source.html new file mode 100644 index 00000000000..54f9f16e3fb --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2falling__factorial_8hpp_source.html @@ -0,0 +1,154 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/falling_factorial.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
falling_factorial.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__FALLING_FACTORIAL_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__FALLING_FACTORIAL_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 #include <boost/math/special_functions/digamma.hpp>
+
8 
+
9 namespace stan {
+
10 
+
11  namespace agrad {
+
12 
+
13  template<typename T>
+
14  inline fvar<T>
+
15  falling_factorial(const fvar<T>& x, const fvar<T>& n) {
+ + +
18 
+
19  T falling_fact(falling_factorial(x.val_,n.val_));
+
20  return fvar<T>(falling_fact, falling_fact * digamma(x.val_ + 1) * x.d_
+
21  - falling_fact * digamma(n.val_ + 1) * n.d_);
+
22  }
+
23 
+
24  template<typename T>
+
25  inline fvar<T>
+
26  falling_factorial(const fvar<T>& x, const double n) {
+ + +
29 
+
30  T falling_fact(falling_factorial(x.val_,n));
+
31  return fvar<T>(falling_fact,
+
32  falling_fact * digamma(x.val_ + 1) * x.d_);
+
33  }
+
34 
+
35  template<typename T>
+
36  inline fvar<T>
+
37  falling_factorial(const double x, const fvar<T>& n) {
+ + +
40 
+
41  T falling_fact(falling_factorial(x, n.val_));
+
42  return fvar<T>(falling_fact,
+
43  -falling_fact * digamma(n.val_ + 1) * n.d_);
+
44  }
+
45  }
+
46 }
+
47 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2fdim_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2fdim_8hpp.html new file mode 100644 index 00000000000..2fb93c677af --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2fdim_8hpp.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/fdim.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
fdim.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::fdim (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > stan::agrad::fdim (const fvar< T > &x1, const double x2)
 
template<typename T >
fvar< T > stan::agrad::fdim (const double x1, const fvar< T > &x2)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2fdim_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2fdim_8hpp_source.html new file mode 100644 index 00000000000..5345a64d504 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2fdim_8hpp_source.html @@ -0,0 +1,157 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/fdim.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
fdim.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__FDIM_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__FDIM_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+
15  fdim(const fvar<T>& x1, const fvar<T>& x2) {
+
16  using stan::math::fdim;
+
17  using std::floor;
+
18  if(x1.val_ < x2.val_)
+
19  return fvar<T>(fdim(x1.val_, x2.val_), 0);
+
20  else
+
21  return fvar<T>(fdim(x1.val_, x2.val_),
+
22  x1.d_ - x2.d_ * floor(x1.val_ / x2.val_));
+
23  }
+
24 
+
25  template <typename T>
+
26  inline
+
27  fvar<T>
+
28  fdim(const fvar<T>& x1, const double x2) {
+
29  using stan::math::fdim;
+
30  using std::floor;
+
31  if(x1.val_ < x2)
+
32  return fvar<T>(fdim(x1.val_, x2), 0);
+
33  else
+
34  return fvar<T>(fdim(x1.val_, x2), x1.d_);
+
35  }
+
36 
+
37  template <typename T>
+
38  inline
+
39  fvar<T>
+
40  fdim(const double x1, const fvar<T>& x2) {
+
41  using stan::math::fdim;
+
42  using std::floor;
+
43  if(x1 < x2.val_)
+
44  return fvar<T>(fdim(x1, x2.val_), 0);
+
45  else
+
46  return fvar<T>(fdim(x1, x2.val_), x2.d_ * -floor(x1 / x2.val_));
+
47  }
+
48  }
+
49 }
+
50 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2fma_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2fma_8hpp.html new file mode 100644 index 00000000000..ad307765279 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2fma_8hpp.html @@ -0,0 +1,163 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/fma.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
fma.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + + + + + + + + + + + + + +

+Functions

template<typename T1 , typename T2 , typename T3 >
fvar< typename
+stan::return_type< T1, T2, T3 >
+::type > 
stan::agrad::fma (const fvar< T1 > &x1, const fvar< T2 > &x2, const fvar< T3 > &x3)
 
template<typename T1 , typename T2 , typename T3 >
fvar< typename
+stan::return_type< T1, T2, T3 >
+::type > 
stan::agrad::fma (const T1 &x1, const fvar< T2 > &x2, const fvar< T3 > &x3)
 
template<typename T1 , typename T2 , typename T3 >
fvar< typename
+stan::return_type< T1, T2, T3 >
+::type > 
stan::agrad::fma (const fvar< T1 > &x1, const T2 &x2, const fvar< T3 > &x3)
 
template<typename T1 , typename T2 , typename T3 >
fvar< typename
+stan::return_type< T1, T2, T3 >
+::type > 
stan::agrad::fma (const fvar< T1 > &x1, const fvar< T2 > &x2, const T3 &x3)
 
template<typename T1 , typename T2 , typename T3 >
fvar< typename
+stan::return_type< T1, T2, T3 >
+::type > 
stan::agrad::fma (const T1 &x1, const T2 &x2, const fvar< T3 > &x3)
 
template<typename T1 , typename T2 , typename T3 >
fvar< typename
+stan::return_type< T1, T2, T3 >
+::type > 
stan::agrad::fma (const fvar< T1 > &x1, const T2 &x2, const T3 &x3)
 
template<typename T1 , typename T2 , typename T3 >
fvar< typename
+stan::return_type< T1, T2, T3 >
+::type > 
stan::agrad::fma (const T1 &x1, const fvar< T2 > &x2, const T3 &x3)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2fma_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2fma_8hpp_source.html new file mode 100644 index 00000000000..62ece0e3aae --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2fma_8hpp_source.html @@ -0,0 +1,190 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/fma.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
fma.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__FMA_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__FMA_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template <typename T1, typename T2, typename T3>
+
13  inline
+
14  fvar<typename stan::return_type<T1,T2,T3>::type>
+
15  fma(const fvar<T1>& x1, const fvar<T2>& x2, const fvar<T3>& x3) {
+
16  using stan::math::fma;
+
17  return fvar<typename
+ +
19  x3.val_), x1.d_ * x2.val_ + x2.d_ * x1.val_ + x3.d_);
+
20  }
+
21 
+
22  template <typename T1, typename T2, typename T3>
+
23  inline
+
24  fvar<typename stan::return_type<T1,T2,T3>::type>
+
25  fma(const T1& x1, const fvar<T2>& x2, const fvar<T3>& x3) {
+
26  using stan::math::fma;
+
27  return fvar<typename
+ +
29  x2.d_ * x1 + x3.d_);
+
30  }
+
31 
+
32  template <typename T1, typename T2, typename T3>
+
33  inline
+
34  fvar<typename stan::return_type<T1,T2,T3>::type>
+
35  fma(const fvar<T1>& x1, const T2& x2, const fvar<T3>& x3) {
+
36  using stan::math::fma;
+
37  return fvar<typename
+ +
39  x1.d_ * x2 + x3.d_);
+
40  }
+
41 
+
42  template <typename T1, typename T2, typename T3>
+
43  inline
+
44  fvar<typename stan::return_type<T1,T2,T3>::type>
+
45  fma(const fvar<T1>& x1, const fvar<T2>& x2, const T3& x3) {
+
46  using stan::math::fma;
+
47  return fvar<typename
+ +
49  x1.d_ * x2.val_ + x2.d_ * x1.val_);
+
50  }
+
51 
+
52  template <typename T1, typename T2, typename T3>
+
53  inline
+
54  fvar<typename stan::return_type<T1,T2,T3>::type>
+
55  fma(const T1& x1, const T2& x2, const fvar<T3>& x3) {
+
56  using stan::math::fma;
+
57  return fvar<typename
+ +
59  x3.d_);
+
60  }
+
61 
+
62  template <typename T1, typename T2, typename T3>
+
63  inline
+
64  fvar<typename stan::return_type<T1,T2,T3>::type>
+
65  fma(const fvar<T1>& x1, const T2& x2, const T3& x3) {
+
66  using stan::math::fma;
+
67  return fvar<typename
+ +
69  x1.d_ * x2);
+
70  }
+
71 
+
72  template <typename T1, typename T2, typename T3>
+
73  inline
+
74  fvar<typename stan::return_type<T1,T2,T3>::type>
+
75  fma(const T1& x1, const fvar<T2>& x2, const T3& x3) {
+
76  using stan::math::fma;
+
77  return fvar<typename
+ +
79  x2.d_ * x1);
+
80  }
+
81  }
+
82 }
+
83 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2gamma__p_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2gamma__p_8hpp.html new file mode 100644 index 00000000000..3420c5ec183 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2gamma__p_8hpp.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/gamma_p.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
gamma_p.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::gamma_p (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > stan::agrad::gamma_p (const fvar< T > &x1, const double x2)
 
template<typename T >
fvar< T > stan::agrad::gamma_p (const double x1, const fvar< T > &x2)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2gamma__p_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2gamma__p_8hpp_source.html new file mode 100644 index 00000000000..6e45a4b927f --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2gamma__p_8hpp_source.html @@ -0,0 +1,209 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/gamma_p.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
gamma_p.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__GAMMA_P_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__GAMMA_P_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ + +
8 
+
9 namespace stan{
+
10 
+
11  namespace agrad{
+
12 
+
13  template <typename T>
+
14  inline
+
15  fvar<T>
+
16  gamma_p(const fvar<T>& x1, const fvar<T>& x2){
+
17  using stan::math::gamma_p;
+
18  using std::log;
+
19  using std::exp;
+
20  using std::pow;
+
21  using std::fabs;
+
22  using boost::math::tgamma;
+ +
24 
+
25  T u = gamma_p(x1.val_, x2.val_);
+
26 
+
27  T S = 0;
+
28  T s = 1;
+
29  T l = log(x2.val_);
+
30  T g = tgamma(x1.val_);
+
31  T dig = digamma(x1.val_);
+
32 
+
33  int k = 0;
+
34  T delta = s / (x1.val_ * x1.val_);
+
35 
+
36  while (fabs(delta) > 1e-6) {
+
37  S += delta;
+
38  ++k;
+
39  s *= -x2.val_ / k;
+
40  delta = s / ((k + x1.val_) * (k + x1.val_));
+
41  }
+
42 
+
43  T der1 = (u) * ( dig - l ) + exp( x1.val_ * l ) * S / g;
+
44  T der2 = exp(-x2.val_) * pow(x2.val_, x1.val_ - 1.0) / g;
+
45 
+
46  return fvar<T>(u,x1.d_ * -der1 + x2.d_ * der2);
+
47  }
+
48 
+
49  template <typename T>
+
50  inline
+
51  fvar<T>
+
52  gamma_p(const fvar<T>& x1, const double x2){
+
53  using stan::math::gamma_p;
+
54  using std::log;
+
55  using std::exp;
+
56  using std::pow;
+
57  using std::fabs;
+
58  using boost::math::tgamma;
+ +
60 
+
61  T u = gamma_p(x1.val_, x2);
+
62 
+
63  T S = 0.0;
+
64  double s = 1.0;
+
65  double l = log(x2);
+
66  T g = tgamma(x1.val_);
+
67  T dig = digamma(x1.val_);
+
68 
+
69  int k = 0;
+
70  T delta = s / (x1.val_ * x1.val_);
+
71 
+
72  while (fabs(delta) > 1e-6) {
+
73  S += delta;
+
74  ++k;
+
75  s *= -x2 / k;
+
76  delta = s / ((k + x1.val_) * (k + x1.val_));
+
77  }
+
78 
+
79  T der1 = (u) * ( dig - l ) + exp( x1.val_ * l ) * S / g;
+
80 
+
81  return fvar<T>(u, x1.d_ * -der1);
+
82  }
+
83 
+
84  template <typename T>
+
85  inline
+
86  fvar<T>
+
87  gamma_p(const double x1, const fvar<T>& x2){
+
88  using stan::math::gamma_p;
+
89  using std::exp;
+
90  using std::pow;
+
91 
+
92  T u = gamma_p(x1, x2.val_);
+
93 
+
94  double g = boost::math::tgamma(x1);
+
95 
+
96  T der2 = exp(-x2.val_) * pow(x2.val_, x1 - 1.0) / g;
+
97 
+
98  return fvar<T>(u, x2.d_ * der2);
+
99  }
+
100  }
+
101 }
+
102 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2gamma__q_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2gamma__q_8hpp.html new file mode 100644 index 00000000000..4d0f483431b --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2gamma__q_8hpp.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/gamma_q.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
gamma_q.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::gamma_q (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > stan::agrad::gamma_q (const fvar< T > &x1, const double x2)
 
template<typename T >
fvar< T > stan::agrad::gamma_q (const double x1, const fvar< T > &x2)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2gamma__q_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2gamma__q_8hpp_source.html new file mode 100644 index 00000000000..2c0237fdff3 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2gamma__q_8hpp_source.html @@ -0,0 +1,208 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/gamma_q.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
gamma_q.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__GAMMA_Q_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__GAMMA_Q_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 
+
8 namespace stan{
+
9 
+
10  namespace agrad{
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+
15  gamma_q(const fvar<T>& x1, const fvar<T>& x2){
+
16  using stan::math::gamma_q;
+
17  using std::log;
+
18  using std::exp;
+
19  using std::pow;
+
20  using std::fabs;
+
21  using boost::math::tgamma;
+ +
23 
+
24  T u = gamma_q(x1.val_, x2.val_);
+
25 
+
26  T S = 0;
+
27  T s = 1;
+
28  T l = log(x2.val_);
+
29  T g = tgamma(x1.val_);
+
30  T dig = digamma(x1.val_);
+
31 
+
32  int k = 0;
+
33  T delta = s / (x1.val_ * x1.val_);
+
34 
+
35  while (fabs(delta) > 1e-6) {
+
36  S += delta;
+
37  ++k;
+
38  s *= -x2.val_ / k;
+
39  delta = s / ((k + x1.val_) * (k + x1.val_));
+
40  }
+
41 
+
42  T der1 = (1.0 - u) * ( dig - l ) + exp( x1.val_ * l ) * S / g;
+
43  T der2 = -exp(-x2.val_) * pow(x2.val_, x1.val_ - 1.0) / g;
+
44 
+
45  return fvar<T>(u,x1.d_ * der1 + x2.d_ * der2);
+
46  }
+
47 
+
48  template <typename T>
+
49  inline
+
50  fvar<T>
+
51  gamma_q(const fvar<T>& x1, const double x2){
+
52  using stan::math::gamma_q;
+
53  using std::log;
+
54  using std::exp;
+
55  using std::pow;
+
56  using std::fabs;
+
57  using boost::math::tgamma;
+ +
59 
+
60  T u = gamma_q(x1.val_, x2);
+
61 
+
62  T S = 0;
+
63  double s = 1;
+
64  double l = log(x2);
+
65  T g = tgamma(x1.val_);
+
66  T dig = digamma(x1.val_);
+
67 
+
68  int k = 0;
+
69  T delta = s / (x1.val_ * x1.val_);
+
70 
+
71  while (fabs(delta) > 1e-6) {
+
72  S += delta;
+
73  ++k;
+
74  s *= -x2 / k;
+
75  delta = s / ((k + x1.val_) * (k + x1.val_));
+
76  }
+
77 
+
78  T der1 = (1.0 - u) * ( dig - l ) + exp( x1.val_ * l ) * S / g;
+
79 
+
80  return fvar<T>(u, x1.d_ * der1);
+
81  }
+
82 
+
83  template <typename T>
+
84  inline
+
85  fvar<T>
+
86  gamma_q(const double x1, const fvar<T>& x2){
+
87  using stan::math::gamma_q;
+
88  using std::exp;
+
89  using std::pow;
+
90 
+
91  T u = gamma_q(x1, x2.val_);
+
92 
+
93  double g = boost::math::tgamma(x1);
+
94 
+
95  T der2 = -exp(-x2.val_) * pow(x2.val_, x1 - 1.0) / g;
+
96 
+
97  return fvar<T>(u, x2.d_ * der2);
+
98  }
+
99  }
+
100 }
+
101 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2inv_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2inv_8hpp.html new file mode 100644 index 00000000000..9c980265ac9 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2inv_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/inv.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
inv.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::inv (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2inv_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2inv_8hpp_source.html new file mode 100644 index 00000000000..e5b63793dd4 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2inv_8hpp_source.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/inv.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
inv.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__INV_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__INV_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+
15  inv(const fvar<T>& x) {
+
16  using stan::math::square;
+
17  return fvar<T>(1 / x.val_, -x.d_ / square(x.val_));
+
18  }
+
19  }
+
20 }
+
21 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2inv__cloglog_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2inv__cloglog_8hpp.html new file mode 100644 index 00000000000..cecdae558bd --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2inv__cloglog_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/inv_cloglog.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
inv_cloglog.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::inv_cloglog (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2inv__cloglog_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2inv__cloglog_8hpp_source.html new file mode 100644 index 00000000000..9fff676ff43 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2inv__cloglog_8hpp_source.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/inv_cloglog.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
inv_cloglog.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__INV_CLOGLOG_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__INV_CLOGLOG_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+
15  inv_cloglog(const fvar<T>& x) {
+
16  using std::exp;
+ +
18  return fvar<T>(inv_cloglog(x.val_), x.d_ * exp(x.val_ - exp(x.val_)));
+
19  }
+
20  }
+
21 }
+
22 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2inv__logit_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2inv__logit_8hpp.html new file mode 100644 index 00000000000..0dca348de53 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2inv__logit_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/inv_logit.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
inv_logit.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::inv_logit (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2inv__logit_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2inv__logit_8hpp_source.html new file mode 100644 index 00000000000..742ea16939b --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2inv__logit_8hpp_source.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/inv_logit.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
inv_logit.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__INV_LOGIT_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__INV_LOGIT_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+
15  inv_logit(const fvar<T>& x) {
+
16  using std::exp;
+
17  using std::pow;
+ +
19  return fvar<T>(inv_logit(x.val_),
+
20  x.d_ * inv_logit(x.val_) * (1 - inv_logit(x.val_)));
+
21  }
+
22  }
+
23 }
+
24 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2inv__sqrt_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2inv__sqrt_8hpp.html new file mode 100644 index 00000000000..d1469d0c6ab --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2inv__sqrt_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/inv_sqrt.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
inv_sqrt.hpp File Reference
+
+
+
#include <stan/agrad/fwd/fvar.hpp>
+#include <stan/meta/traits.hpp>
+#include <boost/math/tools/promotion.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::inv_sqrt (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2inv__sqrt_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2inv__sqrt_8hpp_source.html new file mode 100644 index 00000000000..88d7b9e2670 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2inv__sqrt_8hpp_source.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/inv_sqrt.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
inv_sqrt.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__INV_SQRT_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__INV_SQRT_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 #include <boost/math/tools/promotion.hpp>
+
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+
15  inv_sqrt(const fvar<T>& x) {
+
16  using std::sqrt;
+
17  T sqrt_x(sqrt(x.val_));
+
18  return fvar<T>(1 / sqrt_x, -0.5 * x.d_ / (x.val_ * sqrt_x));
+
19  }
+
20  }
+
21 }
+
22 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2inv__square_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2inv__square_8hpp.html new file mode 100644 index 00000000000..da3b46f525c --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2inv__square_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/inv_square.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
inv_square.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::inv_square (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2inv__square_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2inv__square_8hpp_source.html new file mode 100644 index 00000000000..aeaba559389 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2inv__square_8hpp_source.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/inv_square.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
inv_square.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__INV_SQUARE_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__INV_SQUARE_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+
15  inv_square(const fvar<T>& x) {
+
16  using stan::math::square;
+
17  T square_x(square(x.val_));
+
18  return fvar<T>(1 / square_x, -2 * x.d_ / (square_x * x.val_));
+
19  }
+
20  }
+
21 }
+
22 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2lbeta_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2lbeta_8hpp.html new file mode 100644 index 00000000000..e4914731de4 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2lbeta_8hpp.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/lbeta.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
lbeta.hpp File Reference
+
+
+
#include <stan/agrad/fwd/fvar.hpp>
+#include <stan/meta/traits.hpp>
+#include <boost/math/special_functions/digamma.hpp>
+#include <stan/math/functions/lbeta.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::lbeta (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > stan::agrad::lbeta (const double x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > stan::agrad::lbeta (const fvar< T > &x1, const double x2)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2lbeta_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2lbeta_8hpp_source.html new file mode 100644 index 00000000000..88ec535f7ee --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2lbeta_8hpp_source.html @@ -0,0 +1,153 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/lbeta.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
lbeta.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__LBETA_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__LBETA_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 #include <boost/math/special_functions/digamma.hpp>
+ +
8 
+
9 namespace stan {
+
10 
+
11  namespace agrad {
+
12 
+
13  template <typename T>
+
14  inline
+
15  fvar<T>
+
16  lbeta(const fvar<T>& x1, const fvar<T>& x2) {
+
17  using stan::math::lbeta;
+ +
19  return fvar<T>(lbeta(x1.val_, x2.val_),
+
20  x1.d_ * digamma(x1.val_)
+
21  + x2.d_ * digamma(x2.val_)
+
22  - (x1.d_ + x2.d_) * digamma(x1.val_ + x2.val_));
+
23  }
+
24 
+
25  template <typename T>
+
26  inline
+
27  fvar<T>
+
28  lbeta(const double x1, const fvar<T>& x2) {
+
29  using stan::math::lbeta;
+ +
31  return fvar<T>(lbeta(x1, x2.val_),
+
32  x2.d_ * digamma(x2.val_) - x2.d_ * digamma(x1 + x2.val_));
+
33  }
+
34 
+
35  template <typename T>
+
36  inline
+
37  fvar<T>
+
38  lbeta(const fvar<T>& x1, const double x2) {
+
39  using stan::math::lbeta;
+ +
41  return fvar<T>(lbeta(x1.val_, x2),
+
42  x1.d_ * digamma(x1.val_) - x1.d_ * digamma(x1.val_ + x2));
+
43  }
+
44  }
+
45 }
+
46 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2lgamma_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2lgamma_8hpp.html new file mode 100644 index 00000000000..ba546002717 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2lgamma_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/lgamma.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
lgamma.hpp File Reference
+
+
+
#include <stan/agrad/fwd/fvar.hpp>
+#include <stan/meta/traits.hpp>
+#include <boost/math/special_functions/digamma.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::lgamma (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2lgamma_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2lgamma_8hpp_source.html new file mode 100644 index 00000000000..9493eb45ef9 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2lgamma_8hpp_source.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/lgamma.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
lgamma.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__LGAMMA_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__LGAMMA_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 #include <boost/math/special_functions/digamma.hpp>
+
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+
15  lgamma(const fvar<T>& x) {
+ +
17  using boost::math::lgamma;
+
18  return fvar<T>(lgamma(x.val_), x.d_ * digamma(x.val_));
+
19  }
+
20  }
+
21 }
+
22 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2lmgamma_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2lmgamma_8hpp.html new file mode 100644 index 00000000000..82913864396 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2lmgamma_8hpp.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/lmgamma.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
lmgamma.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< typename
+stan::return_type< T, int >
+::type > 
stan::agrad::lmgamma (int x1, const fvar< T > &x2)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2lmgamma_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2lmgamma_8hpp_source.html new file mode 100644 index 00000000000..0bc2b14fe8e --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2lmgamma_8hpp_source.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/lmgamma.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
lmgamma.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__LMGAMMA_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__LMGAMMA_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ + +
8 
+
9 namespace stan {
+
10 
+
11  namespace agrad {
+
12 
+
13  template <typename T>
+
14  inline
+
15  fvar<typename stan::return_type<T,int>::type>
+
16  lmgamma(int x1, const fvar<T>& x2) {
+
17  using stan::math::lmgamma;
+
18  using stan::math::digamma;
+
19  using std::log;
+
20  T deriv = 0;
+
21  for(int count = 1; count < x1 + 1; count++)
+
22  deriv += x2.d_ * digamma(x2.val_ + (1.0 - count) / 2.0);
+
23  return fvar<typename
+ +
25  }
+
26  }
+
27 }
+
28 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2log1m_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2log1m_8hpp.html new file mode 100644 index 00000000000..f4aba6ccfc8 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2log1m_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/log1m.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log1m.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::log1m (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2log1m_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2log1m_8hpp_source.html new file mode 100644 index 00000000000..f2ae1699411 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2log1m_8hpp_source.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/log1m.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log1m.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__LOG1M_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__LOG1M_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ + +
8 
+
9 namespace stan {
+
10 
+
11  namespace agrad {
+
12 
+
13  template <typename T>
+
14  inline
+
15  fvar<T>
+
16  log1m(const fvar<T>& x) {
+
17  using stan::math::log1m;
+ +
19  if(x.val_ > 1.0)
+ +
21  else
+
22  return fvar<T>(log1m(x.val_), -x.d_ / (1 - x.val_));
+
23  }
+
24  }
+
25 }
+
26 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2log1m__exp_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2log1m__exp_8hpp.html new file mode 100644 index 00000000000..e0ad9929835 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2log1m__exp_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/log1m_exp.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log1m_exp.hpp File Reference
+
+
+
#include <stan/agrad/fwd/fvar.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/math/functions/log1m_exp.hpp>
+#include <boost/math/special_functions/expm1.hpp>
+#include <stan/math/constants.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::log1m_exp (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2log1m__exp_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2log1m__exp_8hpp_source.html new file mode 100644 index 00000000000..36f3828d7e3 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2log1m__exp_8hpp_source.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/log1m_exp.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log1m_exp.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__LOG1M_EXP_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__LOG1M_EXP_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 #include <boost/math/special_functions/expm1.hpp>
+ +
9 
+
10 namespace stan{
+
11 
+
12  namespace agrad{
+
13 
+
14  template <typename T>
+
15  inline
+
16  fvar<T>
+
17  log1m_exp(const fvar<T>& x) {
+ +
19  using boost::math::expm1;
+ +
21  using std::exp;
+
22  if (x.val_ >= 0)
+
23  return fvar<T>(NOT_A_NUMBER);
+
24  return fvar<T>(log1m_exp(x.val_), x.d_ / -expm1(-x.val_));
+
25  }
+
26  }
+
27 }
+
28 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2log1m__inv__logit_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2log1m__inv__logit_8hpp.html new file mode 100644 index 00000000000..344c39616c2 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2log1m__inv__logit_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/log1m_inv_logit.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log1m_inv_logit.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::log1m_inv_logit (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2log1m__inv__logit_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2log1m__inv__logit_8hpp_source.html new file mode 100644 index 00000000000..2a40728ac26 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2log1m__inv__logit_8hpp_source.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/log1m_inv_logit.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log1m_inv_logit.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__LOG1M_INV_LOGIT_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__LOG1M_INV_LOGIT_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+ +
16  using std::exp;
+ +
18  return fvar<T>(log1m_inv_logit(x.val_),
+
19  -x.d_ / (1 + exp(-x.val_)));
+
20  }
+
21  }
+
22 }
+
23 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2log1p_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2log1p_8hpp.html new file mode 100644 index 00000000000..bea1fd6b9d4 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2log1p_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/log1p.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log1p.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::log1p (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2log1p_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2log1p_8hpp_source.html new file mode 100644 index 00000000000..7e3a8294cce --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2log1p_8hpp_source.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/log1p.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log1p.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__LOG1P_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__LOG1P_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ + +
8 
+
9 namespace stan {
+
10 
+
11  namespace agrad {
+
12 
+
13  template <typename T>
+
14  inline
+
15  fvar<T>
+
16  log1p(const fvar<T>& x) {
+
17  using stan::math::log1p;
+ +
19  if(x.val_ < -1.0)
+ +
21  else
+
22  return fvar<T>(log1p(x.val_), x.d_ / (1 + x.val_));
+
23  }
+
24  }
+
25 }
+
26 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2log1p__exp_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2log1p__exp_8hpp.html new file mode 100644 index 00000000000..1a22e38508d --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2log1p__exp_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/log1p_exp.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log1p_exp.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::log1p_exp (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2log1p__exp_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2log1p__exp_8hpp_source.html new file mode 100644 index 00000000000..a82d9407a6f --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2log1p__exp_8hpp_source.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/log1p_exp.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log1p_exp.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__LOG1P_EXP_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__LOG1P_EXP_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+
15  log1p_exp(const fvar<T>& x) {
+ +
17  using std::exp;
+
18  return fvar<T>(log1p_exp(x.val_), x.d_ / (1 + exp(-x.val_)));
+
19  }
+
20  }
+
21 }
+
22 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2log2_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2log2_8hpp.html new file mode 100644 index 00000000000..92b0240238a --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2log2_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/log2.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log2.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::log2 (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2log2_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2log2_8hpp_source.html new file mode 100644 index 00000000000..c35379f95f3 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2log2_8hpp_source.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/log2.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log2.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__LOG2_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__LOG2_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ + +
8 
+
9 
+
10 namespace stan {
+
11 
+
12  namespace agrad {
+
13 
+
14  template <typename T>
+
15  inline
+
16  fvar<T>
+
17  log2(const fvar<T>& x) {
+
18  using std::log;
+
19  using stan::math::log2;
+ +
21  if(x.val_ < 0.0)
+ +
23  else
+
24  return fvar<T>(log2(x.val_), x.d_ / (x.val_ * stan::math::LOG_2));
+
25  }
+
26  }
+
27 }
+
28 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2log_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2log_8hpp.html new file mode 100644 index 00000000000..de54afeefc5 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2log_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/log.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::log (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2log_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2log_8hpp_source.html new file mode 100644 index 00000000000..1c750356106 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2log_8hpp_source.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/log.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__LOG_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__LOG_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+
15  log(const fvar<T>& x) {
+
16  using std::log;
+ +
18  if(x.val_ < 0.0)
+ +
20  else
+
21  return fvar<T>(log(x.val_), x.d_ / x.val_);
+
22  }
+
23  }
+
24 }
+
25 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2log__diff__exp_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2log__diff__exp_8hpp.html new file mode 100644 index 00000000000..22d9731e91c --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2log__diff__exp_8hpp.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/log_diff_exp.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log_diff_exp.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::log_diff_exp (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T1 , typename T2 >
fvar< T2 > stan::agrad::log_diff_exp (const T1 &x1, const fvar< T2 > &x2)
 
template<typename T1 , typename T2 >
fvar< T1 > stan::agrad::log_diff_exp (const fvar< T1 > &x1, const T2 &x2)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2log__diff__exp_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2log__diff__exp_8hpp_source.html new file mode 100644 index 00000000000..157ea050056 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2log__diff__exp_8hpp_source.html @@ -0,0 +1,154 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/log_diff_exp.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log_diff_exp.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__LOG_DIFF_EXP_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__LOG_DIFF_EXP_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ + +
8 
+
9 namespace stan{
+
10 
+
11  namespace agrad{
+
12 
+
13  template <typename T> inline fvar<T>
+
14  log_diff_exp(const fvar<T>& x1, const fvar<T>& x2) {
+ + +
17  using std::exp;
+
18  if (x1.val_ <= x2.val_)
+ +
20  return fvar<T>(log_diff_exp(x1.val_, x2.val_),
+
21  x1.d_ / (1 - exp(x2.val_ - x1.val_) ) + x2.d_ / (1 - exp(x1.val_ - x2.val_) ) );
+
22  }
+
23 
+
24  template <typename T1, typename T2> inline fvar<T2>
+
25  log_diff_exp(const T1& x1, const fvar<T2>& x2) {
+ + +
28  using std::exp;
+
29  if (x1 <= x2.val_)
+ +
31  return fvar<T2>(log_diff_exp(x1, x2.val_),
+
32  x2.d_ / (1 - exp(x1 - x2.val_)));
+
33  }
+
34 
+
35  template <typename T1, typename T2> inline fvar<T1>
+
36  log_diff_exp(const fvar<T1>& x1, const T2& x2) {
+ + +
39  using std::exp;
+
40  if (x1.val_ <= x2)
+ +
42  return fvar<T1>(log_diff_exp(x1.val_, x2),
+
43  x1.d_ / (1 - exp(x2 - x1.val_)));
+
44  }
+
45  }
+
46 }
+
47 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2log__falling__factorial_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2log__falling__factorial_8hpp.html new file mode 100644 index 00000000000..49226c97f56 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2log__falling__factorial_8hpp.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/log_falling_factorial.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log_falling_factorial.hpp File Reference
+
+
+
#include <stan/agrad/fwd/fvar.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/math/functions/log_falling_factorial.hpp>
+#include <boost/math/special_functions/digamma.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::log_falling_factorial (const fvar< T > &x, const fvar< T > &n)
 
template<typename T >
fvar< T > stan::agrad::log_falling_factorial (const double x, const fvar< T > &n)
 
template<typename T >
fvar< T > stan::agrad::log_falling_factorial (const fvar< T > &x, const double n)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2log__falling__factorial_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2log__falling__factorial_8hpp_source.html new file mode 100644 index 00000000000..920c6919e16 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2log__falling__factorial_8hpp_source.html @@ -0,0 +1,151 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/log_falling_factorial.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log_falling_factorial.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__LOG_FALLING_FACTORIAL_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__LOG_FALLING_FACTORIAL_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 #include <boost/math/special_functions/digamma.hpp>
+
8 
+
9 namespace stan {
+
10 
+
11  namespace agrad {
+
12 
+
13  template<typename T>
+
14  inline fvar<T>
+
15  log_falling_factorial(const fvar<T>& x, const fvar<T>& n) {
+ + +
18 
+
19  return fvar<T>(log_falling_factorial(x.val_, n.val_),
+
20  digamma(x.val_ + 1) * x.d_ - digamma(n.val_ + 1) * n.d_);
+
21  }
+
22 
+
23  template<typename T>
+
24  inline fvar<T>
+
25  log_falling_factorial(const double x, const fvar<T>& n) {
+ + +
28 
+
29  return fvar<T>(log_falling_factorial(x, n.val_),
+
30  -digamma(n.val_ + 1) * n.d_);
+
31  }
+
32 
+
33  template<typename T>
+
34  inline fvar<T>
+
35  log_falling_factorial(const fvar<T>& x, const double n) {
+ + +
38 
+
39  return fvar<T>(log_falling_factorial(x.val_, n),
+
40  digamma(x.val_ + 1) * x.d_);
+
41  }
+
42  }
+
43 }
+
44 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2log__inv__logit_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2log__inv__logit_8hpp.html new file mode 100644 index 00000000000..17e6a435973 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2log__inv__logit_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/log_inv_logit.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log_inv_logit.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::log_inv_logit (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2log__inv__logit_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2log__inv__logit_8hpp_source.html new file mode 100644 index 00000000000..208749763a7 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2log__inv__logit_8hpp_source.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/log_inv_logit.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log_inv_logit.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__LOG_INV_LOGIT_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__LOG_INV_LOGIT_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+
15  log_inv_logit(const fvar<T>& x) {
+
16  using std::exp;
+ +
18  return fvar<T>(log_inv_logit(x.val_),
+
19  x.d_ / (1 + exp(x.val_)));
+
20  }
+
21  }
+
22 }
+
23 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2log__rising__factorial_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2log__rising__factorial_8hpp.html new file mode 100644 index 00000000000..cb34043373c --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2log__rising__factorial_8hpp.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/log_rising_factorial.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log_rising_factorial.hpp File Reference
+
+
+
#include <stan/agrad/fwd/fvar.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/math/functions/log_rising_factorial.hpp>
+#include <boost/math/special_functions/digamma.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::log_rising_factorial (const fvar< T > &x, const fvar< T > &n)
 
template<typename T >
fvar< T > stan::agrad::log_rising_factorial (const fvar< T > &x, const double n)
 
template<typename T >
fvar< T > stan::agrad::log_rising_factorial (const double x, const fvar< T > &n)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2log__rising__factorial_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2log__rising__factorial_8hpp_source.html new file mode 100644 index 00000000000..1c2b8b6ef73 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2log__rising__factorial_8hpp_source.html @@ -0,0 +1,155 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/log_rising_factorial.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log_rising_factorial.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__LOG_RISING_FACTORIAL_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__LOG_RISING_FACTORIAL_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 #include <boost/math/special_functions/digamma.hpp>
+
8 
+
9 namespace stan {
+
10 
+
11  namespace agrad {
+
12 
+
13  template<typename T>
+
14  inline
+
15  fvar<T>
+
16  log_rising_factorial(const fvar<T>& x, const fvar<T>& n) {
+ + +
19 
+ +
21  (digamma(x.val_ + n.val_) * (x.d_ + n.d_) - digamma(x.val_) * x.d_));
+
22  }
+
23 
+
24  template<typename T>
+
25  inline
+
26  fvar<T>
+
27  log_rising_factorial(const fvar<T>& x, const double n) {
+ + +
30 
+
31  return fvar<T>(log_rising_factorial(x.val_,n),
+
32  (digamma(x.val_ + n) - digamma(x.val_)) * x.d_);
+
33 
+
34  }
+
35 
+
36  template<typename T>
+
37  inline
+
38  fvar<T>
+
39  log_rising_factorial(const double x, const fvar<T>& n) {
+ + +
42 
+
43  return fvar<T>(log_rising_factorial(x,n.val_),
+
44  (digamma(x + n.val_) * n.d_));
+
45  }
+
46  }
+
47 }
+
48 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2log__sum__exp_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2log__sum__exp_8hpp.html new file mode 100644 index 00000000000..1e321042fb2 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2log__sum__exp_8hpp.html @@ -0,0 +1,140 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/log_sum_exp.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log_sum_exp.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::log_sum_exp (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > stan::agrad::log_sum_exp (const double x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > stan::agrad::log_sum_exp (const fvar< T > &x1, const double x2)
 
template<typename T >
fvar< T > stan::agrad::log_sum_exp (const std::vector< fvar< T > > &v)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2log__sum__exp_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2log__sum__exp_8hpp_source.html new file mode 100644 index 00000000000..997361bc799 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2log__sum__exp_8hpp_source.html @@ -0,0 +1,170 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/log_sum_exp.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log_sum_exp.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__LOG_SUM_EXP_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__LOG_SUM_EXP_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+
15  log_sum_exp(const fvar<T>& x1, const fvar<T>& x2) {
+ +
17  using std::exp;
+
18  return fvar<T>(log_sum_exp(x1.val_, x2.val_),
+
19  x1.d_ / (1 + exp(x2.val_ - x1.val_))
+
20  + x2.d_ / (exp(x1.val_ - x2.val_) + 1));
+
21  }
+
22 
+
23  template <typename T>
+
24  inline
+
25  fvar<T>
+
26  log_sum_exp(const double x1, const fvar<T>& x2) {
+ +
28  using std::exp;
+
29  return fvar<T>(log_sum_exp(x1, x2.val_),
+
30  x2.d_ / (exp(x1 - x2.val_) + 1));
+
31  }
+
32 
+
33  template <typename T>
+
34  inline
+
35  fvar<T>
+
36  log_sum_exp(const fvar<T>& x1, const double x2) {
+ +
38  using std::exp;
+
39  return fvar<T>(log_sum_exp(x1.val_, x2),
+
40  x1.d_ / (1 + exp(x2 - x1.val_)));
+
41  }
+
42 
+
43  template <typename T>
+
44  fvar<T>
+
45  log_sum_exp(const std::vector<fvar<T> >& v) {
+ +
47  using std::exp;
+
48  std::vector<T> vals(v.size());
+
49  for (size_t i = 0; i < v.size(); ++i)
+
50  vals[i] = v[i].val_;
+
51  T deriv(0.0);
+
52  T denominator(0.0);
+
53  for (size_t i = 0; i < v.size(); ++i) {
+
54  T exp_vi = exp(vals[i]);
+
55  denominator += exp_vi;
+
56  deriv += v[i].d_ * exp_vi;
+
57  }
+
58  return fvar<T>(log_sum_exp(vals), deriv / denominator);
+
59  }
+
60 
+
61  }
+
62 }
+
63 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2logit_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2logit_8hpp.html new file mode 100644 index 00000000000..64729136b1b --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2logit_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/logit.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
logit.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::logit (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2logit_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2logit_8hpp_source.html new file mode 100644 index 00000000000..875df347f66 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2logit_8hpp_source.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/logit.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
logit.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__LOGIT_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__LOGIT_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ + + +
9 
+
10 namespace stan {
+
11 
+
12  namespace agrad {
+
13 
+
14  template <typename T>
+
15  inline
+
16  fvar<T>
+
17  logit(const fvar<T>& x) {
+
18  using stan::math::logit;
+
19  using stan::math::square;
+ +
21  if(x.val_ > 1 || x.val_ < 0)
+ +
23  else
+
24  return fvar<T>(logit(x.val_), x.d_ / (x.val_ - square(x.val_)));
+
25  }
+
26  }
+
27 }
+
28 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2modified__bessel__first__kind_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2modified__bessel__first__kind_8hpp.html new file mode 100644 index 00000000000..842aef57a71 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2modified__bessel__first__kind_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/modified_bessel_first_kind.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
modified_bessel_first_kind.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::modified_bessel_first_kind (int v, const fvar< T > &z)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2modified__bessel__first__kind_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2modified__bessel__first__kind_8hpp_source.html new file mode 100644 index 00000000000..a0f3f92c8e6 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2modified__bessel__first__kind_8hpp_source.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/modified_bessel_first_kind.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
modified_bessel_first_kind.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__MODIFIED_BESSEL_FIRST_KIND_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__MODIFIED_BESSEL_FIRST_KIND_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+ + +
17 
+
18  T modified_bessel_first_kind_z(modified_bessel_first_kind(v, z.val_));
+
19  return fvar<T>(modified_bessel_first_kind_z,
+
20  -v * z.d_ * modified_bessel_first_kind_z / z.val_
+
21  + z.d_ * modified_bessel_first_kind(v - 1,z.val_));
+
22  }
+
23  }
+
24 }
+
25 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2modified__bessel__second__kind_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2modified__bessel__second__kind_8hpp.html new file mode 100644 index 00000000000..5cae7de39bf --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2modified__bessel__second__kind_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/modified_bessel_second_kind.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
modified_bessel_second_kind.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::modified_bessel_second_kind (int v, const fvar< T > &z)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2modified__bessel__second__kind_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2modified__bessel__second__kind_8hpp_source.html new file mode 100644 index 00000000000..638c29b8acc --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2modified__bessel__second__kind_8hpp_source.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/modified_bessel_second_kind.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
modified_bessel_second_kind.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__MODIFIED_BESSEL_SECOND_KIND_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__MODIFIED_BESSEL_SECOND_KIND_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+ + +
17 
+
18  T modified_bessel_second_kind_z(modified_bessel_second_kind(v, z.val_));
+
19  return fvar<T>(modified_bessel_second_kind_z,
+
20  -v * z.d_ * modified_bessel_second_kind_z / z.val_
+
21  - z.d_ * modified_bessel_second_kind(v - 1,z.val_));
+
22  }
+
23  }
+
24 }
+
25 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2multiply__log_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2multiply__log_8hpp.html new file mode 100644 index 00000000000..81cd5311cc2 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2multiply__log_8hpp.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/multiply_log.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
multiply_log.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::multiply_log (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > stan::agrad::multiply_log (const double x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > stan::agrad::multiply_log (const fvar< T > &x1, const double x2)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2multiply__log_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2multiply__log_8hpp_source.html new file mode 100644 index 00000000000..959a7b0929a --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2multiply__log_8hpp_source.html @@ -0,0 +1,150 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/multiply_log.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
multiply_log.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__MULTIPLY_LOG_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__MULTIPLY_LOG_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+
15  multiply_log(const fvar<T>& x1, const fvar<T>& x2) {
+ +
17  using std::log;
+
18  return fvar<T>(multiply_log(x1.val_, x2.val_),
+
19  x1.d_ * log(x2.val_) + x1.val_ * x2.d_ / x2.val_);
+
20  }
+
21 
+
22  template <typename T>
+
23  inline
+
24  fvar<T>
+
25  multiply_log(const double x1, const fvar<T>& x2) {
+ +
27  using std::log;
+
28  return fvar<T>(multiply_log(x1, x2.val_),
+
29  x1 * x2.d_ / x2.val_);
+
30  }
+
31 
+
32  template <typename T>
+
33  inline
+
34  fvar<T>
+
35  multiply_log(const fvar<T>& x1, const double x2) {
+ +
37  using std::log;
+
38  return fvar<T>(multiply_log(x1.val_, x2),
+
39  x1.d_ * log(x2));
+
40  }
+
41  }
+
42 }
+
43 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2owens__t_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2owens__t_8hpp.html new file mode 100644 index 00000000000..b8bea51b35d --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2owens__t_8hpp.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/owens_t.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
owens_t.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::owens_t (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > stan::agrad::owens_t (const double x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > stan::agrad::owens_t (const fvar< T > &x1, const double x2)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2owens__t_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2owens__t_8hpp_source.html new file mode 100644 index 00000000000..26603a7bff4 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2owens__t_8hpp_source.html @@ -0,0 +1,175 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/owens_t.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
owens_t.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__OWENS_T_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__OWENS_T_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ + +
8 
+
9 namespace stan {
+
10  namespace agrad {
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+
15  owens_t(const fvar<T>& x1, const fvar<T>& x2) {
+
16  using stan::math::owens_t;
+
17  using boost::math::erf;
+
18  using stan::math::pi;
+
19  using std::exp;
+
20 
+
21  T neg_x1_sq_div_2 = -x1.val_ * x1.val_ / 2.0;
+
22  T one_p_x2_sq = 1.0 + x2.val_ * x2.val_;
+
23 
+
24  return fvar<T>(owens_t(x1.val_, x2.val_),
+
25  - x1.d_
+
26  * (erf(x2.val_ * x1.val_ / std::sqrt(2.0))
+
27  * exp(neg_x1_sq_div_2) / std::sqrt(8.0 * pi()))
+
28  + x2.d_ * exp(neg_x1_sq_div_2 * one_p_x2_sq)
+
29  / (one_p_x2_sq * 2.0 * pi()));
+
30  }
+
31 
+
32  template <typename T>
+
33  inline
+
34  fvar<T>
+
35  owens_t(const double x1, const fvar<T>& x2) {
+
36  using stan::math::owens_t;
+
37  using boost::math::erf;
+
38  using stan::math::pi;
+
39  using std::exp;
+
40 
+
41  T neg_x1_sq_div_2 = -x1 * x1 / 2.0;
+
42  T one_p_x2_sq = 1.0 + x2.val_ * x2.val_;
+
43 
+
44  return fvar<T>(owens_t(x1, x2.val_),
+
45  x2.d_ * exp(neg_x1_sq_div_2 * one_p_x2_sq)
+
46  / (one_p_x2_sq * 2.0 * pi()));
+
47  }
+
48 
+
49  template <typename T>
+
50  inline
+
51  fvar<T>
+
52  owens_t(const fvar<T>& x1, const double x2) {
+
53  using stan::math::owens_t;
+
54  using boost::math::erf;
+
55  using stan::math::pi;
+
56  using std::exp;
+
57 
+
58  T neg_x1_sq_div_2 = -x1.val_ * x1.val_ / 2.0;
+
59 
+
60  return fvar<T>(owens_t(x1.val_, x2),
+
61  -x1.d_ * (erf(x2 * x1.val_ / std::sqrt(2.0))
+
62  * exp(neg_x1_sq_div_2)
+
63  / std::sqrt(8.0 * pi())));
+
64  }
+
65 
+
66  }
+
67 }
+
68 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2rising__factorial_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2rising__factorial_8hpp.html new file mode 100644 index 00000000000..a7e368f3cff --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2rising__factorial_8hpp.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/rising_factorial.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
rising_factorial.hpp File Reference
+
+
+
#include <stan/agrad/fwd/fvar.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/math/functions/rising_factorial.hpp>
+#include <boost/math/special_functions/digamma.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::rising_factorial (const fvar< T > &x, const fvar< T > &n)
 
template<typename T >
fvar< T > stan::agrad::rising_factorial (const fvar< T > &x, const double n)
 
template<typename T >
fvar< T > stan::agrad::rising_factorial (const double x, const fvar< T > &n)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2rising__factorial_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2rising__factorial_8hpp_source.html new file mode 100644 index 00000000000..5a15d7e50c0 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2rising__factorial_8hpp_source.html @@ -0,0 +1,157 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/rising_factorial.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
rising_factorial.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__RISING_FACTORIAL_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__RISING_FACTORIAL_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 #include <boost/math/special_functions/digamma.hpp>
+
8 
+
9 namespace stan {
+
10 
+
11  namespace agrad {
+
12 
+
13  template<typename T>
+
14  inline
+
15  fvar<T>
+
16  rising_factorial(const fvar<T>& x, const fvar<T>& n) {
+ + +
19 
+
20  T rising_fact(rising_factorial(x.val_,n.val_));
+
21  return fvar<T>(rising_fact, rising_fact * (digamma(x.val_ + n.val_)
+
22  * (x.d_ + n.d_) - digamma(x.val_) * x.d_));
+
23  }
+
24 
+
25  template<typename T>
+
26  inline
+
27  fvar<T>
+
28  rising_factorial(const fvar<T>& x, const double n) {
+ + +
31 
+
32  T rising_fact(rising_factorial(x.val_,n));
+
33  return fvar<T>(rising_fact,
+
34  rising_fact * x.d_ * (digamma(x.val_ + n) - digamma(x.val_)));
+
35  }
+
36 
+
37  template<typename T>
+
38  inline
+
39  fvar<T>
+
40  rising_factorial(const double x, const fvar<T>& n) {
+ + +
43 
+
44  T rising_fact(rising_factorial(x,n.val_));
+
45  return fvar<T>(rising_fact,
+
46  rising_fact * (digamma(x + n.val_) * n.d_));
+
47  }
+
48  }
+
49 }
+
50 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2square_8hpp.html b/doc/api/html/agrad_2fwd_2functions_2square_8hpp.html new file mode 100644 index 00000000000..acbe3f9e214 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2square_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/square.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
square.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::square (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_2square_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_2square_8hpp_source.html new file mode 100644 index 00000000000..17592840062 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_2square_8hpp_source.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/square.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
square.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__SQUARE_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__SQUARE_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+
15  square(const fvar<T>& x) {
+
16  using stan::math::square;
+
17  return fvar<T>(square(x.val_),
+
18  x.d_ * 2 * x.val_);
+
19  }
+
20  }
+
21 }
+
22 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_8hpp.html b/doc/api/html/agrad_2fwd_2functions_8hpp.html new file mode 100644 index 00000000000..33d6419c656 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_8hpp.html @@ -0,0 +1,180 @@ + + + + + +Stan: src/stan/agrad/fwd/functions.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
functions.hpp File Reference
+
+
+
#include <stan/agrad/fwd/functions/Phi.hpp>
+#include <stan/agrad/fwd/functions/abs.hpp>
+#include <stan/agrad/fwd/functions/acos.hpp>
+#include <stan/agrad/fwd/functions/acosh.hpp>
+#include <stan/agrad/fwd/functions/asin.hpp>
+#include <stan/agrad/fwd/functions/asinh.hpp>
+#include <stan/agrad/fwd/functions/atan.hpp>
+#include <stan/agrad/fwd/functions/atan2.hpp>
+#include <stan/agrad/fwd/functions/atanh.hpp>
+#include <stan/agrad/fwd/functions/bessel_first_kind.hpp>
+#include <stan/agrad/fwd/functions/bessel_second_kind.hpp>
+#include <stan/agrad/fwd/functions/binary_log_loss.hpp>
+#include <stan/agrad/fwd/functions/binomial_coefficient_log.hpp>
+#include <stan/agrad/fwd/functions/cbrt.hpp>
+#include <stan/agrad/fwd/functions/ceil.hpp>
+#include <stan/agrad/fwd/functions/cos.hpp>
+#include <stan/agrad/fwd/functions/cosh.hpp>
+#include <stan/agrad/fwd/functions/digamma.hpp>
+#include <stan/agrad/fwd/functions/erf.hpp>
+#include <stan/agrad/fwd/functions/erfc.hpp>
+#include <stan/agrad/fwd/functions/exp.hpp>
+#include <stan/agrad/fwd/functions/exp2.hpp>
+#include <stan/agrad/fwd/functions/expm1.hpp>
+#include <stan/agrad/fwd/functions/fabs.hpp>
+#include <stan/agrad/fwd/functions/falling_factorial.hpp>
+#include <stan/agrad/fwd/functions/fdim.hpp>
+#include <stan/agrad/fwd/functions/floor.hpp>
+#include <stan/agrad/fwd/functions/fma.hpp>
+#include <stan/agrad/fwd/functions/fmax.hpp>
+#include <stan/agrad/fwd/functions/fmin.hpp>
+#include <stan/agrad/fwd/functions/fmod.hpp>
+#include <stan/agrad/fwd/functions/gamma_p.hpp>
+#include <stan/agrad/fwd/functions/gamma_q.hpp>
+#include <stan/agrad/fwd/functions/hypot.hpp>
+#include <stan/agrad/fwd/functions/inv.hpp>
+#include <stan/agrad/fwd/functions/inv_cloglog.hpp>
+#include <stan/agrad/fwd/functions/inv_logit.hpp>
+#include <stan/agrad/fwd/functions/inv_sqrt.hpp>
+#include <stan/agrad/fwd/functions/inv_square.hpp>
+#include <stan/agrad/fwd/functions/lbeta.hpp>
+#include <stan/agrad/fwd/functions/lgamma.hpp>
+#include <stan/agrad/fwd/functions/lmgamma.hpp>
+#include <stan/agrad/fwd/functions/log.hpp>
+#include <stan/agrad/fwd/functions/log10.hpp>
+#include <stan/agrad/fwd/functions/log1m.hpp>
+#include <stan/agrad/fwd/functions/log1m_exp.hpp>
+#include <stan/agrad/fwd/functions/log1m_inv_logit.hpp>
+#include <stan/agrad/fwd/functions/log1p.hpp>
+#include <stan/agrad/fwd/functions/log1p_exp.hpp>
+#include <stan/agrad/fwd/functions/log2.hpp>
+#include <stan/agrad/fwd/functions/log_diff_exp.hpp>
+#include <stan/agrad/fwd/functions/log_falling_factorial.hpp>
+#include <stan/agrad/fwd/functions/log_inv_logit.hpp>
+#include <stan/agrad/fwd/functions/log_rising_factorial.hpp>
+#include <stan/agrad/fwd/functions/log_sum_exp.hpp>
+#include <stan/agrad/fwd/functions/logit.hpp>
+#include <stan/agrad/fwd/functions/modified_bessel_first_kind.hpp>
+#include <stan/agrad/fwd/functions/modified_bessel_second_kind.hpp>
+#include <stan/agrad/fwd/functions/multiply_log.hpp>
+#include <stan/agrad/fwd/functions/owens_t.hpp>
+#include <stan/agrad/fwd/functions/pow.hpp>
+#include <stan/agrad/fwd/functions/rising_factorial.hpp>
+#include <stan/agrad/fwd/functions/round.hpp>
+#include <stan/agrad/fwd/functions/sin.hpp>
+#include <stan/agrad/fwd/functions/sinh.hpp>
+#include <stan/agrad/fwd/functions/sqrt.hpp>
+#include <stan/agrad/fwd/functions/square.hpp>
+#include <stan/agrad/fwd/functions/tan.hpp>
+#include <stan/agrad/fwd/functions/tanh.hpp>
+#include <stan/agrad/fwd/functions/tgamma.hpp>
+#include <stan/agrad/fwd/functions/trunc.hpp>
+
+

Go to the source code of this file.

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2functions_8hpp_source.html b/doc/api/html/agrad_2fwd_2functions_8hpp_source.html new file mode 100644 index 00000000000..fa43a049aa5 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2functions_8hpp_source.html @@ -0,0 +1,183 @@ + + + + + +Stan: src/stan/agrad/fwd/functions.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
functions.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS_HPP__
+
3 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
75 
+
76 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2columns__dot__product_8hpp.html b/doc/api/html/agrad_2fwd_2matrix_2columns__dot__product_8hpp.html new file mode 100644 index 00000000000..fc72f9df98c --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2columns__dot__product_8hpp.html @@ -0,0 +1,141 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/columns_dot_product.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
columns_dot_product.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, 1, C1 > stan::agrad::columns_dot_product (const Eigen::Matrix< fvar< T >, R1, C1 > &v1, const Eigen::Matrix< fvar< T >, R2, C2 > &v2)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, 1, C1 > stan::agrad::columns_dot_product (const Eigen::Matrix< fvar< T >, R1, C1 > &v1, const Eigen::Matrix< double, R2, C2 > &v2)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, 1, C1 > stan::agrad::columns_dot_product (const Eigen::Matrix< double, R1, C1 > &v1, const Eigen::Matrix< fvar< T >, R2, C2 > &v2)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2columns__dot__product_8hpp_source.html b/doc/api/html/agrad_2fwd_2matrix_2columns__dot__product_8hpp_source.html new file mode 100644 index 00000000000..a12d3a38d64 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2columns__dot__product_8hpp_source.html @@ -0,0 +1,169 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/columns_dot_product.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
columns_dot_product.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__MATRIX__COLUMNS__DOT_PRODUCT_HPP__
+
2 #define __STAN__AGRAD__FWD__MATRIX__COLUMNS__DOT_PRODUCT_HPP__
+
3 
+
4 #include <vector>
+ + + + + +
10 #include <stan/agrad/fwd/fvar.hpp>
+
11 
+
12 namespace stan {
+
13  namespace agrad {
+
14 
+
15  template<typename T, int R1,int C1,int R2, int C2>
+
16  inline
+
17  Eigen::Matrix<fvar<T>, 1, C1>
+
18  columns_dot_product(const Eigen::Matrix<fvar<T>, R1, C1>& v1,
+
19  const Eigen::Matrix<fvar<T>, R2, C2>& v2) {
+
20  stan::math::validate_matching_dims(v1,v2,"columns_dot_product");
+
21  Eigen::Matrix<fvar<T>, 1, C1> ret(1,v1.cols());
+
22  for (size_type j = 0; j < v1.cols(); ++j) {
+
23  Eigen::Matrix<fvar<T>,R1,C1> ccol1 = v1.col(j);
+
24  Eigen::Matrix<fvar<T>,R2,C2> ccol2 = v2.col(j);
+
25  ret(0,j) = dot_product(ccol1, ccol2);
+
26  }
+
27  return ret;
+
28  }
+
29 
+
30  template<typename T, int R1,int C1,int R2, int C2>
+
31  inline
+
32  Eigen::Matrix<fvar<T>, 1, C1>
+
33  columns_dot_product(const Eigen::Matrix<fvar<T>, R1, C1>& v1,
+
34  const Eigen::Matrix<double, R2, C2>& v2) {
+
35  stan::math::validate_matching_dims(v1,v2,"columns_dot_product");
+
36  Eigen::Matrix<fvar<T>, 1, C1>
+
37  ret(1,v1.cols());
+
38  for (size_type j = 0; j < v1.cols(); ++j) {
+
39  Eigen::Matrix<fvar<T>,R1,C1> ccol1 = v1.col(j);
+
40  Eigen::Matrix<double,R2,C2> ccol = v2.col(j);
+
41  ret(0,j) = dot_product(ccol1, ccol);
+
42  }
+
43  return ret;
+
44  }
+
45 
+
46  template<typename T, int R1,int C1,int R2, int C2>
+
47  inline
+
48  Eigen::Matrix<fvar<T>, 1, C1>
+
49  columns_dot_product(const Eigen::Matrix<double, R1, C1>& v1,
+
50  const Eigen::Matrix<fvar<T>, R2, C2>& v2) {
+
51  stan::math::validate_matching_dims(v1,v2,"columns_dot_product");
+
52  Eigen::Matrix<fvar<T>, 1, C1> ret(1,v1.cols());
+
53  for (size_type j = 0; j < v1.cols(); ++j) {
+
54  Eigen::Matrix<double,R1,C1> ccol = v1.col(j);
+
55  Eigen::Matrix<fvar<T>,R2,C2> ccol2 = v2.col(j);
+
56  ret(0,j) = dot_product(ccol, ccol2);
+
57  }
+
58  return ret;
+
59  }
+
60  }
+
61 }
+
62 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2columns__dot__self_8hpp.html b/doc/api/html/agrad_2fwd_2matrix_2columns__dot__self_8hpp.html new file mode 100644 index 00000000000..05b7c93a1cd --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2columns__dot__self_8hpp.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/columns_dot_self.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
columns_dot_self.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T , int R, int C>
Eigen::Matrix< fvar< T >, 1, C > stan::agrad::columns_dot_self (const Eigen::Matrix< fvar< T >, R, C > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2columns__dot__self_8hpp_source.html b/doc/api/html/agrad_2fwd_2matrix_2columns__dot__self_8hpp_source.html new file mode 100644 index 00000000000..dfff36a4abf --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2columns__dot__self_8hpp_source.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/columns_dot_self.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
columns_dot_self.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__COLUMNS_DOT_SELF_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__COLUMNS_DOT_SELF_HPP__
+
3 
+
4 #include <vector>
+ + + + + +
10 
+
11 namespace stan {
+
12  namespace agrad {
+
13 
+
14  template<typename T, int R,int C>
+
15  inline Eigen::Matrix<fvar<T>,1,C>
+
16  columns_dot_self(const Eigen::Matrix<fvar<T>,R,C>& x) {
+
17  Eigen::Matrix<fvar<T>,1,C> ret(1,x.cols());
+
18  for (size_type i = 0; i < x.cols(); i++) {
+
19  Eigen::Matrix<fvar<T>,R,1> ccol = x.col(i);
+
20  ret(0,i) = dot_self(ccol);
+
21  }
+
22  return ret;
+
23  }
+
24  }
+
25 }
+
26 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2crossprod_8hpp.html b/doc/api/html/agrad_2fwd_2matrix_2crossprod_8hpp.html new file mode 100644 index 00000000000..90417ebfb01 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2crossprod_8hpp.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/crossprod.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
crossprod.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T , int R, int C>
Eigen::Matrix< fvar< T >, C, C > stan::agrad::crossprod (const Eigen::Matrix< fvar< T >, R, C > &m)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2crossprod_8hpp_source.html b/doc/api/html/agrad_2fwd_2matrix_2crossprod_8hpp_source.html new file mode 100644 index 00000000000..2c22007d9bd --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2crossprod_8hpp_source.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/crossprod.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
crossprod.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__MATRIX__CROSSPROD_HPP__
+
2 #define __STAN__AGRAD__FWD__MATRIX__CROSSPROD_HPP__
+
3 
+
4 #include <vector>
+ + + + + +
10 
+
11 namespace stan {
+
12  namespace agrad {
+
13 
+
14  template<typename T,int R, int C>
+
15  inline
+
16  Eigen::Matrix<fvar<T>,C,C>
+
17  crossprod(const Eigen::Matrix<fvar<T>, R, C>& m) {
+
18  if (m.rows() == 0)
+
19  return Eigen::Matrix<fvar<T>,C,C>(0,0);
+ +
21  }
+
22 
+
23  }
+
24 }
+
25 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2determinant_8hpp.html b/doc/api/html/agrad_2fwd_2matrix_2determinant_8hpp.html new file mode 100644 index 00000000000..d29fd9b3038 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2determinant_8hpp.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/determinant.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
determinant.hpp File Reference
+
+
+
#include <vector>
+#include <boost/math/tools/promotion.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/agrad/fwd/fvar.hpp>
+#include <stan/agrad/fwd/matrix/typedefs.hpp>
+#include <stan/math/matrix/multiply.hpp>
+#include <stan/agrad/fwd/matrix/multiply.hpp>
+#include <stan/math/matrix/inverse.hpp>
+#include <stan/agrad/fwd/matrix/inverse.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T , int R, int C>
fvar< T > stan::agrad::determinant (const Eigen::Matrix< fvar< T >, R, C > &m)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2determinant_8hpp_source.html b/doc/api/html/agrad_2fwd_2matrix_2determinant_8hpp_source.html new file mode 100644 index 00000000000..579cf1d74f0 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2determinant_8hpp_source.html @@ -0,0 +1,153 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/determinant.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
determinant.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__MATRIX__DETERMINANT_HPP__
+
2 #define __STAN__AGRAD__FWD__MATRIX__DETERMINANT_HPP__
+
3 
+
4 #include <vector>
+
5 #include <boost/math/tools/promotion.hpp>
+ + + + + + + +
13 
+
14 namespace stan {
+
15  namespace agrad {
+
16 
+
17  template<typename T, int R,int C>
+
18  inline
+
19  fvar<T>
+
20  determinant(const Eigen::Matrix<fvar<T>, R, C>& m) {
+ +
22 
+
23  stan::math::validate_square(m, "determinant");
+
24  Eigen::Matrix<T,R,C> m_deriv(m.rows(), m.cols());
+
25  Eigen::Matrix<T,R,C> m_val(m.rows(), m.cols());
+
26  Eigen::Matrix<T,R,C> m_inv(m.rows(), m.cols());
+
27  fvar<T> result;
+
28 
+
29  for(size_type i = 0; i < m.rows(); i++) {
+
30  for(size_type j = 0; j < m.cols(); j++) {
+
31  m_deriv(i,j) = m(i,j).d_;
+
32  m_val(i,j) = m(i,j).val_;
+
33  }
+
34  }
+
35 
+
36  m_inv = stan::math::inverse(m_val);
+
37  m_deriv = multiply(m_inv, m_deriv);
+
38 
+
39  result.val_ = m_val.determinant();
+
40  result.d_ = result.val_ * m_deriv.trace();
+
41 
+
42  return result;
+
43  }
+
44  }
+
45 }
+
46 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2divide_8hpp.html b/doc/api/html/agrad_2fwd_2matrix_2divide_8hpp.html new file mode 100644 index 00000000000..acda53beef8 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2divide_8hpp.html @@ -0,0 +1,152 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/divide.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
divide.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + + + + + + + + + + + + + +

+Functions

template<typename T1 , typename T2 >
stan::return_type< T1, T2 >::type stan::agrad::divide (const T1 &v, const T2 &c)
 
template<typename T , int R, int C>
Eigen::Matrix< fvar< T >, R, C > stan::agrad::divide (const Eigen::Matrix< fvar< T >, R, C > &v, const fvar< T > &c)
 
template<typename T , int R, int C>
Eigen::Matrix< fvar< T >, R, C > stan::agrad::divide (const Eigen::Matrix< fvar< T >, R, C > &v, const double c)
 
template<typename T , int R, int C>
Eigen::Matrix< fvar< T >, R, C > stan::agrad::divide (const Eigen::Matrix< double, R, C > &v, const fvar< T > &c)
 
template<typename T , int R, int C>
Eigen::Matrix< fvar< T >, R, C > stan::agrad::operator/ (const Eigen::Matrix< fvar< T >, R, C > &v, const fvar< T > &c)
 
template<typename T , int R, int C>
Eigen::Matrix< fvar< T >, R, C > stan::agrad::operator/ (const Eigen::Matrix< fvar< T >, R, C > &v, const double c)
 
template<typename T , int R, int C>
Eigen::Matrix< fvar< T >, R, C > stan::agrad::operator/ (const Eigen::Matrix< double, R, C > &v, const fvar< T > &c)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2divide_8hpp_source.html b/doc/api/html/agrad_2fwd_2matrix_2divide_8hpp_source.html new file mode 100644 index 00000000000..abe7c6a2c8a --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2divide_8hpp_source.html @@ -0,0 +1,182 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/divide.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
divide.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__MATRIX__DIVIDE_HPP__
+
2 #define __STAN__AGRAD__FWD__MATRIX__DIVIDE_HPP__
+
3 
+
4 #include <vector>
+ +
6 #include <stan/agrad/fwd.hpp>
+ + + +
10 
+
11 namespace stan {
+
12  namespace agrad {
+
13 
+
14  template <typename T1, typename T2>
+
15  inline
+ +
17  divide(const T1& v, const T2& c) {
+
18  return v / c;
+
19  }
+
20 
+
21  template <typename T, int R, int C>
+
22  inline Eigen::Matrix<fvar<T>,R,C>
+
23  divide(const Eigen::Matrix<fvar<T>, R,C>& v, const fvar<T>& c) {
+
24  Eigen::Matrix<fvar<T>,R,C> res(v.rows(),v.cols());
+
25  for(int i = 0; i < v.rows(); i++) {
+
26  for(int j = 0; j < v.cols(); j++)
+
27  res(i,j) = v(i,j) / c;
+
28  }
+
29  return res;
+
30  }
+
31 
+
32  template <typename T, int R, int C>
+
33  inline Eigen::Matrix<fvar<T>,R,C>
+
34  divide(const Eigen::Matrix<fvar<T>, R,C>& v, const double c) {
+
35  Eigen::Matrix<fvar<T>,R,C>
+
36  res(v.rows(),v.cols());
+
37  for(int i = 0; i < v.rows(); i++) {
+
38  for(int j = 0; j < v.cols(); j++)
+
39  res(i,j) = v(i,j) / c;
+
40  }
+
41  return res;
+
42  }
+
43 
+
44  template <typename T, int R, int C>
+
45  inline Eigen::Matrix<fvar<T>,R,C>
+
46  divide(const Eigen::Matrix<double, R,C>& v, const fvar<T>& c) {
+
47  Eigen::Matrix<fvar<T>,R,C>
+
48  res(v.rows(),v.cols());
+
49  for(int i = 0; i < v.rows(); i++) {
+
50  for(int j = 0; j < v.cols(); j++)
+
51  res(i,j) = v(i,j) / c;
+
52  }
+
53  return res;
+
54  }
+
55 
+
56  template <typename T, int R, int C>
+
57  inline Eigen::Matrix<fvar<T>,R,C>
+
58  operator/(const Eigen::Matrix<fvar<T>, R,C>& v, const fvar<T>& c) {
+
59  return divide(v,c);
+
60  }
+
61 
+
62  template <typename T, int R, int C>
+
63  inline Eigen::Matrix<fvar<T>,R,C>
+
64  operator/(const Eigen::Matrix<fvar<T>, R,C>& v, const double c) {
+
65  return divide(v,c);
+
66  }
+
67 
+
68  template <typename T, int R, int C>
+
69  inline Eigen::Matrix<fvar<T>,R,C>
+
70  operator/(const Eigen::Matrix<double,R,C>& v, const fvar<T>& c) {
+
71  return divide(v,c);
+
72  }
+
73  }
+
74 }
+
75 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2dot__product_8hpp.html b/doc/api/html/agrad_2fwd_2matrix_2dot__product_8hpp.html new file mode 100644 index 00000000000..24f1ace9eb3 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2dot__product_8hpp.html @@ -0,0 +1,169 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/dot_product.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
dot_product.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

template<typename T , int R1, int C1, int R2, int C2>
fvar< T > stan::agrad::dot_product (const Eigen::Matrix< fvar< T >, R1, C1 > &v1, const Eigen::Matrix< fvar< T >, R2, C2 > &v2)
 
template<typename T , int R1, int C1, int R2, int C2>
fvar< T > stan::agrad::dot_product (const Eigen::Matrix< fvar< T >, R1, C1 > &v1, const Eigen::Matrix< double, R2, C2 > &v2)
 
template<typename T , int R1, int C1, int R2, int C2>
fvar< T > stan::agrad::dot_product (const Eigen::Matrix< double, R1, C1 > &v1, const Eigen::Matrix< fvar< T >, R2, C2 > &v2)
 
template<typename T , int R1, int C1, int R2, int C2>
fvar< T > stan::agrad::dot_product (const Eigen::Matrix< fvar< T >, R1, C1 > &v1, const Eigen::Matrix< fvar< T >, R2, C2 > &v2, size_type &length)
 
template<typename T , int R1, int C1, int R2, int C2>
fvar< T > stan::agrad::dot_product (const Eigen::Matrix< fvar< T >, R1, C1 > &v1, const Eigen::Matrix< double, R2, C2 > &v2, size_type &length)
 
template<typename T , int R1, int C1, int R2, int C2>
fvar< T > stan::agrad::dot_product (const Eigen::Matrix< double, R1, C1 > &v1, const Eigen::Matrix< fvar< T >, R2, C2 > &v2, size_type &length)
 
template<typename T >
fvar< T > stan::agrad::dot_product (const std::vector< fvar< T > > &v1, const std::vector< fvar< T > > &v2)
 
template<typename T >
fvar< T > stan::agrad::dot_product (const std::vector< double > &v1, const std::vector< fvar< T > > &v2)
 
template<typename T >
fvar< T > stan::agrad::dot_product (const std::vector< fvar< T > > &v1, const std::vector< double > &v2)
 
template<typename T >
fvar< T > stan::agrad::dot_product (const std::vector< fvar< T > > &v1, const std::vector< fvar< T > > &v2, size_type &length)
 
template<typename T >
fvar< T > stan::agrad::dot_product (const std::vector< double > &v1, const std::vector< fvar< T > > &v2, size_type &length)
 
template<typename T >
fvar< T > stan::agrad::dot_product (const std::vector< fvar< T > > &v1, const std::vector< double > &v2, size_type &length)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2dot__product_8hpp_source.html b/doc/api/html/agrad_2fwd_2matrix_2dot__product_8hpp_source.html new file mode 100644 index 00000000000..a42c540101f --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2dot__product_8hpp_source.html @@ -0,0 +1,287 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/dot_product.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
dot_product.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__MATRIX__DOT_PRODUCT_HPP__
+
2 #define __STAN__AGRAD__FWD__MATRIX__DOT_PRODUCT_HPP__
+
3 
+
4 #include <vector>
+ + + + +
9 #include <stan/agrad/fwd.hpp>
+ + +
12 
+
13 namespace stan {
+
14  namespace agrad {
+
15 
+
16  //dot_product for vec (in matrix) * vec (in matrix); does all combos of row row, col col, row col, col row
+
17  template<typename T, int R1, int C1, int R2, int C2>
+
18  inline
+
19  fvar<T>
+
20  dot_product(const Eigen::Matrix<fvar<T>, R1, C1>& v1,
+
21  const Eigen::Matrix<fvar<T>, R2, C2>& v2) {
+
22  stan::math::validate_vector(v1,"dot_product");
+
23  stan::math::validate_vector(v2,"dot_product");
+
24  stan::math::validate_matching_sizes(v1,v2,"dot_product");
+
25 
+
26  fvar<T> ret(0,0);
+
27  for(size_type i = 0; i < v1.size(); i++)
+
28  ret += v1(i) * v2(i);
+
29  return ret;
+
30  }
+
31 
+
32  template<typename T, int R1, int C1, int R2, int C2>
+
33  inline
+
34  fvar<T>
+
35  dot_product(const Eigen::Matrix<fvar<T>, R1, C1>& v1,
+
36  const Eigen::Matrix<double, R2, C2>& v2) {
+
37  stan::math::validate_vector(v1,"dot_product");
+
38  stan::math::validate_vector(v2,"dot_product");
+
39  stan::math::validate_matching_sizes(v1,v2,"dot_product");
+
40 
+
41  fvar<T> ret(0,0);
+
42  for(size_type i = 0; i < v1.size(); i++)
+
43  ret += v1(i) * v2(i);
+
44  return ret;
+
45  }
+
46 
+
47  template<typename T, int R1, int C1, int R2, int C2>
+
48  inline
+
49  fvar<T>
+
50  dot_product(const Eigen::Matrix<double, R1, C1>& v1,
+
51  const Eigen::Matrix<fvar<T>, R2, C2>& v2) {
+
52  stan::math::validate_vector(v1,"dot_product");
+
53  stan::math::validate_vector(v2,"dot_product");
+
54  stan::math::validate_matching_sizes(v1,v2,"dot_product");
+
55 
+
56  fvar<T> ret(0,0);
+
57  for(size_type i = 0; i < v1.size(); i++)
+
58  ret += v1(i) * v2(i);
+
59  return ret;
+
60  }
+
61 
+
62  template<typename T, int R1,int C1, int R2, int C2>
+
63  inline
+
64  fvar<T>
+
65  dot_product(const Eigen::Matrix<fvar<T>, R1, C1>& v1,
+
66  const Eigen::Matrix<fvar<T>, R2, C2>& v2,
+
67  size_type& length) {
+
68  stan::math::validate_vector(v1,"dot_product");
+
69  stan::math::validate_vector(v2,"dot_product");
+
70 
+
71  fvar<T> ret(0,0);
+
72  for(size_type i = 0; i < length; i++)
+
73  ret += v1(i) * v2(i);
+
74  return ret;
+
75  }
+
76 
+
77  template<typename T, int R1,int C1, int R2, int C2>
+
78  inline
+
79  fvar<T>
+
80  dot_product(const Eigen::Matrix<fvar<T>, R1, C1>& v1,
+
81  const Eigen::Matrix<double, R2, C2>& v2,
+
82  size_type& length) {
+
83  stan::math::validate_vector(v1,"dot_product");
+
84  stan::math::validate_vector(v2,"dot_product");
+
85 
+
86  fvar<T> ret(0,0);
+
87  for(size_type i = 0; i < length; i++)
+
88  ret += v1(i) * v2(i);
+
89  return ret;
+
90  }
+
91 
+
92  template<typename T, int R1,int C1, int R2, int C2>
+
93  inline
+
94  fvar<T>
+
95  dot_product(const Eigen::Matrix<double, R1, C1>& v1,
+
96  const Eigen::Matrix<fvar<T>, R2, C2>& v2,
+
97  size_type& length) {
+
98  stan::math::validate_vector(v1,"dot_product");
+
99  stan::math::validate_vector(v2,"dot_product");
+
100 
+
101  fvar<T> ret(0,0);
+
102  for(size_type i = 0; i < length; i++)
+
103  ret += v1(i) * v2(i);
+
104  return ret;
+
105  }
+
106 
+
107  template<typename T>
+
108  inline
+
109  fvar<T>
+
110  dot_product(const std::vector<fvar<T> >& v1,
+
111  const std::vector<fvar<T> >& v2) {
+
112  stan::math::validate_matching_sizes(v1,v2,"dot_product");
+
113  fvar<T> ret(0,0);
+
114  for (size_t i = 0; i < v1.size(); i++)
+
115  ret += v1.at(i) * v2.at(i);
+
116  return ret;
+
117  }
+
118 
+
119  template<typename T>
+
120  inline
+
121  fvar<T>
+
122  dot_product(const std::vector<double>& v1,
+
123  const std::vector<fvar<T> >& v2) {
+
124  stan::math::validate_matching_sizes(v1,v2,"dot_product");
+
125  fvar<T> ret(0,0);
+
126  for (size_t i = 0; i < v1.size(); i++)
+
127  ret += v1.at(i) * v2.at(i);
+
128  return ret;
+
129  }
+
130 
+
131  template<typename T>
+
132  inline
+
133  fvar<T>
+
134  dot_product(const std::vector<fvar<T> >& v1,
+
135  const std::vector<double>& v2) {
+
136  stan::math::validate_matching_sizes(v1,v2,"dot_product");
+
137  fvar<T> ret(0,0);
+
138  for (size_t i = 0; i < v1.size(); i++)
+
139  ret += v1.at(i) * v2.at(i);
+
140  return ret;
+
141  }
+
142 
+
143  template<typename T>
+
144  inline
+
145  fvar<T>
+
146  dot_product(const std::vector<fvar<T> >& v1,
+
147  const std::vector<fvar<T> >& v2,
+
148  size_type& length) {
+
149  fvar<T> ret(0,0);
+
150  for(size_type i = 0; i < length; i++)
+
151  ret += v1.at(i) * v2.at(i);
+
152  return ret;
+
153  }
+
154 
+
155  template<typename T>
+
156  inline
+
157  fvar<T>
+
158  dot_product(const std::vector<double>& v1,
+
159  const std::vector<fvar<T> >& v2,
+
160  size_type& length) {
+
161  fvar<T> ret(0,0);
+
162  for(size_type i = 0; i < length; i++)
+
163  ret += v1.at(i) * v2.at(i);
+
164  return ret;
+
165  }
+
166 
+
167  template<typename T>
+
168  inline
+
169  fvar<T>
+
170  dot_product(const std::vector<fvar<T> >& v1,
+
171  const std::vector<double>& v2,
+
172  size_type& length) {
+
173  fvar<T> ret(0,0);
+
174  for(size_type i = 0; i < length; i++)
+
175  ret += v1.at(i) * v2.at(i);
+
176  return ret;
+
177  }
+
178  }
+
179 }
+
180 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2dot__self_8hpp.html b/doc/api/html/agrad_2fwd_2matrix_2dot__self_8hpp.html new file mode 100644 index 00000000000..07306c66d87 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2dot__self_8hpp.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/dot_self.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
dot_self.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T , int R, int C>
fvar< T > stan::agrad::dot_self (const Eigen::Matrix< fvar< T >, R, C > &v)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2dot__self_8hpp_source.html b/doc/api/html/agrad_2fwd_2matrix_2dot__self_8hpp_source.html new file mode 100644 index 00000000000..7bfd702b257 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2dot__self_8hpp_source.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/dot_self.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
dot_self.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__DOT_SELF_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__DOT_SELF_HPP__
+
3 
+
4 #include <vector>
+ + + + + +
10 
+
11 namespace stan {
+
12  namespace agrad {
+
13 
+
14  template<typename T, int R, int C>
+
15  inline fvar<T>
+
16  dot_self(const Eigen::Matrix<fvar<T>, R, C>& v) {
+
17  stan::math::validate_vector(v,"dot_self");
+
18  return dot_product(v, v);
+
19  }
+
20  }
+
21 }
+
22 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2inverse_8hpp.html b/doc/api/html/agrad_2fwd_2matrix_2inverse_8hpp.html new file mode 100644 index 00000000000..a51772532e5 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2inverse_8hpp.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/inverse.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
inverse.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T , int R, int C>
Eigen::Matrix< fvar< T >, R, C > stan::agrad::inverse (const Eigen::Matrix< fvar< T >, R, C > &m)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2inverse_8hpp_source.html b/doc/api/html/agrad_2fwd_2matrix_2inverse_8hpp_source.html new file mode 100644 index 00000000000..b54d9177d28 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2inverse_8hpp_source.html @@ -0,0 +1,151 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/inverse.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
inverse.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__MATRIX__INVERSE_HPP__
+
2 #define __STAN__AGRAD__FWD__MATRIX__INVERSE_HPP__
+
3 
+
4 #include <vector>
+
5 #include <boost/math/tools/promotion.hpp>
+ + + + + + + + +
14 
+
15 namespace stan {
+
16  namespace agrad {
+
17 
+
18  template<typename T, int R,int C>
+
19  inline
+
20  Eigen::Matrix<fvar<T>,R,C>
+
21  inverse(const Eigen::Matrix<fvar<T>, R, C>& m) {
+ + +
24  using stan::math::inverse;
+
25  stan::math::validate_square(m, "inverse");
+
26  Eigen::Matrix<T,R,C> m_deriv(m.rows(), m.cols());
+
27  Eigen::Matrix<T,R,C> m_inv(m.rows(), m.cols());
+
28 
+
29  for(size_type i = 0; i < m.rows(); i++) {
+
30  for(size_type j = 0; j < m.cols(); j++) {
+
31  m_inv(i,j) = m(i,j).val_;
+
32  m_deriv(i,j) = m(i,j).d_;
+
33  }
+
34  }
+
35 
+
36  m_inv = stan::math::inverse(m_inv);
+
37 
+
38  m_deriv = -1 * multiply(multiply(m_inv, m_deriv), m_inv);
+
39 
+
40  return to_fvar(m_inv, m_deriv);
+
41  }
+
42  }
+
43 }
+
44 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2log__determinant_8hpp.html b/doc/api/html/agrad_2fwd_2matrix_2log__determinant_8hpp.html new file mode 100644 index 00000000000..bc8b6d3deac --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2log__determinant_8hpp.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/log_determinant.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log_determinant.hpp File Reference
+
+
+
#include <vector>
+#include <boost/math/tools/promotion.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/agrad/fwd/fvar.hpp>
+#include <stan/agrad/fwd/matrix/typedefs.hpp>
+#include <stan/agrad/fwd/matrix/determinant.hpp>
+#include <stan/agrad/fwd/functions/fabs.hpp>
+#include <stan/agrad/fwd/functions/log.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T , int R, int C>
fvar< T > stan::agrad::log_determinant (const Eigen::Matrix< fvar< T >, R, C > &m)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2log__determinant_8hpp_source.html b/doc/api/html/agrad_2fwd_2matrix_2log__determinant_8hpp_source.html new file mode 100644 index 00000000000..09bc2e33be2 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2log__determinant_8hpp_source.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/log_determinant.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log_determinant.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__MATRIX__LOG_DETERMINANT_HPP__
+
2 #define __STAN__AGRAD__FWD__MATRIX__LOG_DETERMINANT_HPP__
+
3 
+
4 #include <vector>
+
5 #include <boost/math/tools/promotion.hpp>
+ + + + + + +
12 
+
13 namespace stan {
+
14  namespace agrad {
+
15 
+
16  template<typename T, int R,int C>
+
17  inline
+
18  fvar<T>
+
19  log_determinant(const Eigen::Matrix<fvar<T>, R, C>& m) {
+
20  stan::math::validate_square(m, "log_determinant");
+
21 
+ +
23  }
+
24  }
+
25 }
+
26 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2log__softmax_8hpp.html b/doc/api/html/agrad_2fwd_2matrix_2log__softmax_8hpp.html new file mode 100644 index 00000000000..efce88c573b --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2log__softmax_8hpp.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/log_softmax.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log_softmax.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
Eigen::Matrix< fvar< T >
+, Eigen::Dynamic, 1 > 
stan::agrad::log_softmax (const Eigen::Matrix< fvar< T >, Eigen::Dynamic, 1 > &alpha)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2log__softmax_8hpp_source.html b/doc/api/html/agrad_2fwd_2matrix_2log__softmax_8hpp_source.html new file mode 100644 index 00000000000..9eebdabca91 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2log__softmax_8hpp_source.html @@ -0,0 +1,166 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/log_softmax.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log_softmax.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__MATRIX__LOG_SOFTMAX_HPP__
+
2 #define __STAN__AGRAD__FWD__MATRIX__LOG_SOFTMAX_HPP__
+
3 
+ + + + + +
9 
+
10 namespace stan {
+
11  namespace agrad {
+
12 
+
13  template <typename T>
+
14  inline
+
15  Eigen::Matrix<fvar<T>,Eigen::Dynamic,1>
+
16  log_softmax(const Eigen::Matrix<fvar<T>,Eigen::Dynamic,1>& alpha) {
+
17  using stan::math::softmax;
+ +
19  using Eigen::Matrix;
+
20  using Eigen::Dynamic;
+
21 
+
22  Matrix<T,Dynamic,1> alpha_t(alpha.size());
+
23  for (int k = 0; k < alpha.size(); ++k)
+
24  alpha_t(k) = alpha(k).val_;
+
25 
+
26  Matrix<T,Dynamic,1> softmax_alpha_t = softmax(alpha_t);
+
27  Matrix<T,Dynamic,1> log_softmax_alpha_t = log_softmax(alpha_t);
+
28 
+
29  Matrix<fvar<T>,Dynamic,1> log_softmax_alpha(alpha.size());
+
30  for (int k = 0; k < alpha.size(); ++k) {
+
31  log_softmax_alpha(k).val_ = log_softmax_alpha_t(k);
+
32  log_softmax_alpha(k).d_ = 0;
+
33  }
+
34 
+
35  // for each input position
+
36  for (int m = 0; m < alpha.size(); ++m) {
+
37  T negative_alpha_m_d_times_softmax_alpha_t_m
+
38  = - alpha(m).d_ * softmax_alpha_t(m);
+
39  // for each output position
+
40  for (int k = 0; k < alpha.size(); ++k) {
+
41  // chain from input to output
+
42  if (m == k)
+
43  log_softmax_alpha(k).d_
+
44  += alpha(m).d_
+
45  + negative_alpha_m_d_times_softmax_alpha_t_m;
+
46  else
+
47  log_softmax_alpha(k).d_
+
48  += negative_alpha_m_d_times_softmax_alpha_t_m;
+
49  }
+
50  }
+
51 
+
52  return log_softmax_alpha;
+
53  }
+
54 
+
55 
+
56  }
+
57 }
+
58 
+
59 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2log__sum__exp_8hpp.html b/doc/api/html/agrad_2fwd_2matrix_2log__sum__exp_8hpp.html new file mode 100644 index 00000000000..4213606c904 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2log__sum__exp_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/log_sum_exp.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log_sum_exp.hpp File Reference
+
+
+
#include <vector>
+#include <stan/agrad/fwd/fvar.hpp>
+#include <stan/math/functions/log_sum_exp.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T , int R, int C>
fvar< T > stan::agrad::log_sum_exp (const Eigen::Matrix< fvar< T >, R, C > &v)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2log__sum__exp_8hpp_source.html b/doc/api/html/agrad_2fwd_2matrix_2log__sum__exp_8hpp_source.html new file mode 100644 index 00000000000..db80320f1ae --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2log__sum__exp_8hpp_source.html @@ -0,0 +1,142 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/log_sum_exp.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log_sum_exp.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__MATRIX__LOG_SUM_EXP_HPP__
+
2 #define __STAN__AGRAD__FWD__MATRIX__LOG_SUM_EXP_HPP__
+
3 
+
4 #include <vector>
+ + + +
8 
+
9 namespace stan{
+
10 
+
11  namespace agrad{
+
12 
+
13  // FIXME: cut-and-paste from fwd/log_sum_exp.hpp; should
+
14  // be able to generalize
+
15  template <typename T, int R, int C>
+
16  fvar<T>
+
17  log_sum_exp(const Eigen::Matrix<fvar<T>,R,C>& v) {
+ +
19  using std::exp;
+
20  std::vector<T> vals(v.size());
+
21  for (int i = 0; i < v.size(); ++i)
+
22  vals[i] = v[i].val_;
+
23  T deriv(0.0);
+
24  T denominator(0.0);
+
25  for (size_t i = 0; i < v.size(); ++i) {
+
26  T exp_vi = exp(vals[i]);
+
27  denominator += exp_vi;
+
28  deriv += v[i].d_ * exp_vi;
+
29  }
+
30  return fvar<T>(log_sum_exp(vals), deriv / denominator);
+
31  }
+
32 
+
33  }
+
34 }
+
35 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2mdivide__left_8hpp.html b/doc/api/html/agrad_2fwd_2matrix_2mdivide__left_8hpp.html new file mode 100644 index 00000000000..747d67f1e8d --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2mdivide__left_8hpp.html @@ -0,0 +1,147 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/mdivide_left.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
mdivide_left.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, C2 > stan::agrad::mdivide_left (const Eigen::Matrix< fvar< T >, R1, C1 > &A, const Eigen::Matrix< fvar< T >, R2, C2 > &b)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, C2 > stan::agrad::mdivide_left (const Eigen::Matrix< double, R1, C1 > &A, const Eigen::Matrix< fvar< T >, R2, C2 > &b)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, C2 > stan::agrad::mdivide_left (const Eigen::Matrix< fvar< T >, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2mdivide__left_8hpp_source.html b/doc/api/html/agrad_2fwd_2matrix_2mdivide__left_8hpp_source.html new file mode 100644 index 00000000000..3177f331caf --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2mdivide__left_8hpp_source.html @@ -0,0 +1,231 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/mdivide_left.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
mdivide_left.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__MATRIX__COLUMNS_MDIVIDE_LEFT_HPP__
+
2 #define __STAN__AGRAD__FWD__MATRIX__COLUMNS_MDIVIDE_LEFT_HPP__
+
3 
+
4 #include <vector>
+ + + + + + + + + + + + + +
18 
+
19 namespace stan {
+
20  namespace agrad {
+
21 
+
22  template <typename T, int R1,int C1,int R2,int C2>
+
23  inline
+
24  Eigen::Matrix<fvar<T>,R1,C2>
+
25  mdivide_left(const Eigen::Matrix<fvar<T>,R1,C1> &A,
+
26  const Eigen::Matrix<fvar<T>,R2,C2> &b) {
+
27 
+
28  using stan::math::multiply;
+ +
30  stan::math::validate_square(A,"mdivide_left");
+
31  stan::math::validate_multiplicable(A,b,"mdivide_left");
+
32 
+
33  Eigen::Matrix<T,R1,C2> inv_A_mult_b(A.rows(),b.cols());
+
34  Eigen::Matrix<T,R1,C2> inv_A_mult_deriv_b(A.rows(),b.cols());
+
35  Eigen::Matrix<T,R1,C1> inv_A_mult_deriv_A(A.rows(),A.cols());
+
36  Eigen::Matrix<T,R1,C1> val_A(A.rows(),A.cols());
+
37  Eigen::Matrix<T,R1,C1> deriv_A(A.rows(),A.cols());
+
38  Eigen::Matrix<T,R2,C2> val_b(b.rows(),b.cols());
+
39  Eigen::Matrix<T,R2,C2> deriv_b(b.rows(),b.cols());
+
40 
+
41  for (int j = 0; j < A.cols(); j++) {
+
42  for(int i = 0; i < A.rows(); i++) {
+
43  val_A(i,j) = A(i,j).val_;
+
44  deriv_A(i,j) = A(i,j).d_;
+
45  }
+
46  }
+
47 
+
48  for (int j = 0; j < b.cols(); j++) {
+
49  for(int i = 0; i < b.rows(); i++) {
+
50  val_b(i,j) = b(i,j).val_;
+
51  deriv_b(i,j) = b(i,j).d_;
+
52  }
+
53  }
+
54 
+
55  inv_A_mult_b = mdivide_left(val_A, val_b);
+
56  inv_A_mult_deriv_b = mdivide_left(val_A, deriv_b);
+
57  inv_A_mult_deriv_A = mdivide_left(val_A, deriv_A);
+
58 
+
59  Eigen::Matrix<T,R1,C2> deriv(A.rows(), b.cols());
+
60  deriv = inv_A_mult_deriv_b - multiply(inv_A_mult_deriv_A, inv_A_mult_b);
+
61 
+
62  return stan::agrad::to_fvar(inv_A_mult_b, deriv);
+
63  }
+
64 
+
65  template <typename T, int R1,int C1,int R2,int C2>
+
66  inline
+
67  Eigen::Matrix<fvar<T>,R1,C2>
+
68  mdivide_left(const Eigen::Matrix<double,R1,C1> &A,
+
69  const Eigen::Matrix<fvar<T>,R2,C2> &b) {
+
70 
+
71  using stan::math::multiply;
+ +
73  stan::math::validate_square(A,"mdivide_left");
+
74  stan::math::validate_multiplicable(A,b,"mdivide_left");
+
75 
+
76  Eigen::Matrix<T,R2,C2> val_b(b.rows(),b.cols());
+
77  Eigen::Matrix<T,R2,C2> deriv_b(b.rows(),b.cols());
+
78 
+
79  for (int j = 0; j < b.cols(); j++) {
+
80  for(int i = 0; i < b.rows(); i++) {
+
81  val_b(i,j) = b(i,j).val_;
+
82  deriv_b(i,j) = b(i,j).d_;
+
83  }
+
84  }
+
85 
+
86  return stan::agrad::to_fvar(mdivide_left(A, val_b),
+
87  mdivide_left(A, deriv_b));
+
88  }
+
89 
+
90  template <typename T, int R1,int C1,int R2,int C2>
+
91  inline
+
92  Eigen::Matrix<fvar<T>,R1,C2>
+
93  mdivide_left(const Eigen::Matrix<fvar<T>,R1,C1> &A,
+
94  const Eigen::Matrix<double,R2,C2> &b) {
+
95 
+
96  using stan::math::multiply;
+ +
98  stan::math::validate_square(A,"mdivide_left");
+
99  stan::math::validate_multiplicable(A,b,"mdivide_left");
+
100 
+
101  Eigen::Matrix<T,R1,C2>
+
102  inv_A_mult_b(A.rows(),b.cols());
+
103  Eigen::Matrix<T,R1,C1> inv_A_mult_deriv_A(A.rows(),A.cols());
+
104  Eigen::Matrix<T,R1,C1> val_A(A.rows(),A.cols());
+
105  Eigen::Matrix<T,R1,C1> deriv_A(A.rows(),A.cols());
+
106 
+
107  for (int j = 0; j < A.cols(); j++) {
+
108  for(int i = 0; i < A.rows(); i++) {
+
109  val_A(i,j) = A(i,j).val_;
+
110  deriv_A(i,j) = A(i,j).d_;
+
111  }
+
112  }
+
113 
+
114  inv_A_mult_b = mdivide_left(val_A, b);
+
115  inv_A_mult_deriv_A = mdivide_left(val_A, deriv_A);
+
116 
+
117  Eigen::Matrix<T,R1,C2> deriv(A.rows(), b.cols());
+
118  deriv = -multiply(inv_A_mult_deriv_A, inv_A_mult_b);
+
119 
+
120  return stan::agrad::to_fvar(inv_A_mult_b, deriv);
+
121  }
+
122  }
+
123 }
+
124 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2mdivide__left__tri__low_8hpp.html b/doc/api/html/agrad_2fwd_2matrix_2mdivide__left__tri__low_8hpp.html new file mode 100644 index 00000000000..1b6afd9e474 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2mdivide__left__tri__low_8hpp.html @@ -0,0 +1,144 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/mdivide_left_tri_low.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
mdivide_left_tri_low.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, C1 > stan::agrad::mdivide_left_tri_low (const Eigen::Matrix< fvar< T >, R1, C1 > &A, const Eigen::Matrix< fvar< T >, R2, C2 > &b)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, C1 > stan::agrad::mdivide_left_tri_low (const Eigen::Matrix< double, R1, C1 > &A, const Eigen::Matrix< fvar< T >, R2, C2 > &b)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, C1 > stan::agrad::mdivide_left_tri_low (const Eigen::Matrix< fvar< T >, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2mdivide__left__tri__low_8hpp_source.html b/doc/api/html/agrad_2fwd_2matrix_2mdivide__left__tri__low_8hpp_source.html new file mode 100644 index 00000000000..1b9ab3a6b8f --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2mdivide__left__tri__low_8hpp_source.html @@ -0,0 +1,243 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/mdivide_left_tri_low.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
mdivide_left_tri_low.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__MATRIX__MDIVIDE_LEFT_TRI_LOW_HPP__
+
2 #define __STAN__AGRAD__FWD__MATRIX__MDIVIDE_LEFT_TRI_LOW_HPP__
+
3 
+
4 #include <vector>
+ + + + + + + + +
13 #include <stan/agrad/fwd/fvar.hpp>
+
14 
+
15 namespace stan {
+
16  namespace agrad {
+
17 
+
18  template<typename T,int R1, int C1, int R2, int C2>
+
19  inline
+
20  Eigen::Matrix<fvar<T>,R1,C1>
+
21  mdivide_left_tri_low(const Eigen::Matrix<fvar<T>, R1, C1>& A,
+
22  const Eigen::Matrix<fvar<T>, R2, C2>& b) {
+
23  using stan::math::multiply;
+ +
25  stan::math::validate_square(A,"mdivide_left");
+
26  stan::math::validate_multiplicable(A,b,"mdivide_left");
+
27 
+
28  Eigen::Matrix<T,R1,C2> inv_A_mult_b(A.rows(),b.cols());
+
29  Eigen::Matrix<T,R1,C2> inv_A_mult_deriv_b(A.rows(),b.cols());
+
30  Eigen::Matrix<T,R1,C1> inv_A_mult_deriv_A(A.rows(),A.cols());
+
31  Eigen::Matrix<T,R1,C1> val_A(A.rows(),A.cols());
+
32  Eigen::Matrix<T,R1,C1> deriv_A(A.rows(),A.cols());
+
33  Eigen::Matrix<T,R2,C2> val_b(b.rows(),b.cols());
+
34  Eigen::Matrix<T,R2,C2> deriv_b(b.rows(),b.cols());
+
35  val_A.setZero();
+
36  deriv_A.setZero();
+
37 
+
38  for (size_type j = 0; j < A.cols(); j++) {
+
39  for(size_type i = j; i < A.rows(); i++) {
+
40  val_A(i,j) = A(i,j).val_;
+
41  deriv_A(i,j) = A(i,j).d_;
+
42  }
+
43  }
+
44 
+
45  for (size_type j = 0; j < b.cols(); j++) {
+
46  for(size_type i = 0; i < b.rows(); i++) {
+
47  val_b(i,j) = b(i,j).val_;
+
48  deriv_b(i,j) = b(i,j).d_;
+
49  }
+
50  }
+
51 
+
52  inv_A_mult_b = mdivide_left(val_A, val_b);
+
53  inv_A_mult_deriv_b = mdivide_left(val_A, deriv_b);
+
54  inv_A_mult_deriv_A = mdivide_left(val_A, deriv_A);
+
55 
+
56  Eigen::Matrix<T,R1,C2> deriv(A.rows(), b.cols());
+
57  deriv = inv_A_mult_deriv_b - multiply(inv_A_mult_deriv_A, inv_A_mult_b);
+
58 
+
59  return stan::agrad::to_fvar(inv_A_mult_b, deriv);
+
60  }
+
61 
+
62  template<typename T,int R1, int C1, int R2, int C2>
+
63  inline
+
64  Eigen::Matrix<fvar<T>,R1,C1>
+
65  mdivide_left_tri_low(const Eigen::Matrix<double, R1, C1>& A,
+
66  const Eigen::Matrix<fvar<T>, R2, C2>& b) {
+
67  using stan::math::multiply;
+ +
69  stan::math::validate_square(A,"mdivide_left");
+
70  stan::math::validate_multiplicable(A,b,"mdivide_left");
+
71 
+
72  Eigen::Matrix<T,R1,C2> inv_A_mult_b(A.rows(),b.cols());
+
73  Eigen::Matrix<T,R1,C2> inv_A_mult_deriv_b(A.rows(),b.cols());
+
74  Eigen::Matrix<T,R2,C2> val_b(b.rows(),b.cols());
+
75  Eigen::Matrix<T,R2,C2> deriv_b(b.rows(),b.cols());
+
76  Eigen::Matrix<double,R1,C1> val_A(A.rows(),A.cols());
+
77  val_A.setZero();
+
78 
+
79  for (size_type j = 0; j < A.cols(); j++) {
+
80  for(size_type i = j; i < A.rows(); i++) {
+
81  val_A(i,j) = A(i,j);
+
82  }
+
83  }
+
84 
+
85  for (size_type j = 0; j < b.cols(); j++) {
+
86  for(size_type i = 0; i < b.rows(); i++) {
+
87  val_b(i,j) = b(i,j).val_;
+
88  deriv_b(i,j) = b(i,j).d_;
+
89  }
+
90  }
+
91 
+
92  inv_A_mult_b = mdivide_left(val_A, val_b);
+
93  inv_A_mult_deriv_b = mdivide_left(val_A, deriv_b);
+
94 
+
95  Eigen::Matrix<T,R1,C2> deriv(A.rows(), b.cols());
+
96  deriv = inv_A_mult_deriv_b;
+
97 
+
98  return stan::agrad::to_fvar(inv_A_mult_b, deriv);
+
99  }
+
100 
+
101  template<typename T,int R1, int C1, int R2, int C2>
+
102  inline
+
103  Eigen::Matrix<fvar<T>,R1,C1>
+
104  mdivide_left_tri_low(const Eigen::Matrix<fvar<T>, R1, C1>& A,
+
105  const Eigen::Matrix<double, R2, C2>& b) {
+
106  using stan::math::multiply;
+ +
108  stan::math::validate_square(A,"mdivide_left");
+
109  stan::math::validate_multiplicable(A,b,"mdivide_left");
+
110 
+
111  Eigen::Matrix<T,R1,C2>
+
112  inv_A_mult_b(A.rows(),b.cols());
+
113  Eigen::Matrix<T,R1,C1> inv_A_mult_deriv_A(A.rows(),A.cols());
+
114  Eigen::Matrix<T,R1,C1> val_A(A.rows(),A.cols());
+
115  Eigen::Matrix<T,R1,C1> deriv_A(A.rows(),A.cols());
+
116  val_A.setZero();
+
117  deriv_A.setZero();
+
118 
+
119  for (size_type j = 0; j < A.cols(); j++) {
+
120  for(size_type i = j; i < A.rows(); i++) {
+
121  val_A(i,j) = A(i,j).val_;
+
122  deriv_A(i,j) = A(i,j).d_;
+
123  }
+
124  }
+
125 
+
126  inv_A_mult_b = mdivide_left(val_A, b);
+
127  inv_A_mult_deriv_A = mdivide_left(val_A, deriv_A);
+
128 
+
129  Eigen::Matrix<T,R1,C2> deriv(A.rows(), b.cols());
+
130  deriv = -multiply(inv_A_mult_deriv_A, inv_A_mult_b);
+
131 
+
132  return stan::agrad::to_fvar(inv_A_mult_b, deriv);
+
133  }
+
134  }
+
135 }
+
136 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2mdivide__right_8hpp.html b/doc/api/html/agrad_2fwd_2matrix_2mdivide__right_8hpp.html new file mode 100644 index 00000000000..3f607e37e90 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2mdivide__right_8hpp.html @@ -0,0 +1,143 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/mdivide_right.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
mdivide_right.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, C2 > stan::agrad::mdivide_right (const Eigen::Matrix< fvar< T >, R1, C1 > &A, const Eigen::Matrix< fvar< T >, R2, C2 > &b)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, C2 > stan::agrad::mdivide_right (const Eigen::Matrix< fvar< T >, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, C2 > stan::agrad::mdivide_right (const Eigen::Matrix< double, R1, C1 > &A, const Eigen::Matrix< fvar< T >, R2, C2 > &b)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2mdivide__right_8hpp_source.html b/doc/api/html/agrad_2fwd_2matrix_2mdivide__right_8hpp_source.html new file mode 100644 index 00000000000..941914ba0fd --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2mdivide__right_8hpp_source.html @@ -0,0 +1,228 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/mdivide_right.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
mdivide_right.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__MATRIX__COLUMNS_MDIVIDE_RIGHT_HPP__
+
2 #define __STAN__AGRAD__FWD__MATRIX__COLUMNS_MDIVIDE_RIGHT_HPP__
+
3 
+
4 #include <vector>
+ + + + + + + + +
13 
+
14 namespace stan {
+
15  namespace agrad {
+
16 
+
17  template <typename T, int R1,int C1,int R2,int C2>
+
18  inline
+
19  Eigen::Matrix<fvar<T>,R1,C2>
+
20  mdivide_right(const Eigen::Matrix<fvar<T>,R1,C1> &A,
+
21  const Eigen::Matrix<fvar<T>,R2,C2> &b) {
+
22 
+
23  using stan::math::multiply;
+ +
25  stan::math::validate_square(b,"mdivide_right");
+
26  stan::math::validate_multiplicable(A,b,"mdivide_right");
+
27 
+
28  Eigen::Matrix<T,R1,C2> A_mult_inv_b(A.rows(),b.cols());
+
29  Eigen::Matrix<T,R1,C2> deriv_A_mult_inv_b(A.rows(),b.cols());
+
30  Eigen::Matrix<T,R2,C2> deriv_b_mult_inv_b(b.rows(),b.cols());
+
31  Eigen::Matrix<T,R1,C1> val_A(A.rows(),A.cols());
+
32  Eigen::Matrix<T,R1,C1> deriv_A(A.rows(),A.cols());
+
33  Eigen::Matrix<T,R2,C2> val_b(b.rows(),b.cols());
+
34  Eigen::Matrix<T,R2,C2> deriv_b(b.rows(),b.cols());
+
35 
+
36  for (int j = 0; j < A.cols(); j++) {
+
37  for(int i = 0; i < A.rows(); i++) {
+
38  val_A(i,j) = A(i,j).val_;
+
39  deriv_A(i,j) = A(i,j).d_;
+
40  }
+
41  }
+
42 
+
43  for (int j = 0; j < b.cols(); j++) {
+
44  for(int i = 0; i < b.rows(); i++) {
+
45  val_b(i,j) = b(i,j).val_;
+
46  deriv_b(i,j) = b(i,j).d_;
+
47  }
+
48  }
+
49 
+
50  A_mult_inv_b = mdivide_right(val_A, val_b);
+
51  deriv_A_mult_inv_b = mdivide_right(deriv_A, val_b);
+
52  deriv_b_mult_inv_b = mdivide_right(deriv_b, val_b);
+
53 
+
54  Eigen::Matrix<T,R1,C2> deriv(A.rows(), b.cols());
+
55  deriv = deriv_A_mult_inv_b - multiply(A_mult_inv_b, deriv_b_mult_inv_b);
+
56 
+
57  return stan::agrad::to_fvar(A_mult_inv_b, deriv);
+
58  }
+
59 
+
60  template <typename T, int R1,int C1,int R2,int C2>
+
61  inline
+
62  Eigen::Matrix<fvar<T>,R1,C2>
+
63  mdivide_right(const Eigen::Matrix<fvar<T>,R1,C1> &A,
+
64  const Eigen::Matrix<double,R2,C2> &b) {
+
65 
+
66  using stan::math::multiply;
+ +
68  stan::math::validate_square(b,"mdivide_right");
+
69  stan::math::validate_multiplicable(A,b,"mdivide_right");
+
70 
+
71  Eigen::Matrix<T,R2,C2> deriv_b_mult_inv_b(b.rows(),b.cols());
+
72  Eigen::Matrix<T,R1,C1> val_A(A.rows(),A.cols());
+
73  Eigen::Matrix<T,R1,C1> deriv_A(A.rows(),A.cols());
+
74 
+
75  for (int j = 0; j < A.cols(); j++) {
+
76  for(int i = 0; i < A.rows(); i++) {
+
77  val_A(i,j) = A(i,j).val_;
+
78  deriv_A(i,j) = A(i,j).d_;
+
79  }
+
80  }
+
81 
+
82  return stan::agrad::to_fvar(mdivide_right(val_A, b),
+
83  mdivide_right(deriv_A, b));
+
84  }
+
85 
+
86  template <typename T, int R1,int C1,int R2,int C2>
+
87  inline
+
88  Eigen::Matrix<fvar<T>,R1,C2>
+
89  mdivide_right(const Eigen::Matrix<double,R1,C1> &A,
+
90  const Eigen::Matrix<fvar<T>,R2,C2> &b) {
+
91 
+
92  using stan::math::multiply;
+ +
94  stan::math::validate_square(b,"mdivide_right");
+
95  stan::math::validate_multiplicable(A,b,"mdivide_right");
+
96 
+
97  Eigen::Matrix<T,R1,C2>
+
98  A_mult_inv_b(A.rows(),b.cols());
+
99  Eigen::Matrix<T,R2,C2> deriv_b_mult_inv_b(b.rows(),b.cols());
+
100  Eigen::Matrix<T,R2,C2> val_b(b.rows(),b.cols());
+
101  Eigen::Matrix<T,R2,C2> deriv_b(b.rows(),b.cols());
+
102 
+
103  for (int j = 0; j < b.cols(); j++) {
+
104  for(int i = 0; i < b.rows(); i++) {
+
105  val_b(i,j) = b(i,j).val_;
+
106  deriv_b(i,j) = b(i,j).d_;
+
107  }
+
108  }
+
109 
+
110  A_mult_inv_b = mdivide_right(A, val_b);
+
111  deriv_b_mult_inv_b = mdivide_right(deriv_b, val_b);
+
112 
+
113  Eigen::Matrix<T,R1,C2>
+
114  deriv(A.rows(), b.cols());
+
115  deriv = -multiply(A_mult_inv_b, deriv_b_mult_inv_b);
+
116 
+
117  return stan::agrad::to_fvar(A_mult_inv_b, deriv);
+
118  }
+
119  }
+
120 }
+
121 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2mdivide__right__tri__low_8hpp.html b/doc/api/html/agrad_2fwd_2matrix_2mdivide__right__tri__low_8hpp.html new file mode 100644 index 00000000000..b3c3b973f7a --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2mdivide__right__tri__low_8hpp.html @@ -0,0 +1,144 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/mdivide_right_tri_low.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
mdivide_right_tri_low.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, C1 > stan::agrad::mdivide_right_tri_low (const Eigen::Matrix< fvar< T >, R1, C1 > &A, const Eigen::Matrix< fvar< T >, R2, C2 > &b)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, C2 > stan::agrad::mdivide_right_tri_low (const Eigen::Matrix< fvar< T >, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, C2 > stan::agrad::mdivide_right_tri_low (const Eigen::Matrix< double, R1, C1 > &A, const Eigen::Matrix< fvar< T >, R2, C2 > &b)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2mdivide__right__tri__low_8hpp_source.html b/doc/api/html/agrad_2fwd_2matrix_2mdivide__right__tri__low_8hpp_source.html new file mode 100644 index 00000000000..ae3640b4759 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2mdivide__right__tri__low_8hpp_source.html @@ -0,0 +1,240 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/mdivide_right_tri_low.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
mdivide_right_tri_low.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__MATRIX__MDIVIDE_RIGHT_TRI_LOW_HPP__
+
2 #define __STAN__AGRAD__FWD__MATRIX__MDIVIDE_RIGHT_TRI_LOW_HPP__
+
3 
+
4 #include <vector>
+ + + + + + + + +
13 #include <stan/agrad/fwd/fvar.hpp>
+
14 
+
15 namespace stan {
+
16  namespace agrad {
+
17 
+
18  template<typename T,int R1, int C1, int R2, int C2>
+
19  inline
+
20  Eigen::Matrix<fvar<T>,R1,C1>
+
21  mdivide_right_tri_low(const Eigen::Matrix<fvar<T>, R1, C1>& A,
+
22  const Eigen::Matrix<fvar<T>, R2, C2>& b) {
+
23  using stan::math::multiply;
+ +
25  stan::math::validate_square(b,"mdivide_right");
+
26  stan::math::validate_multiplicable(A,b,"mdivide_right");
+
27 
+
28  Eigen::Matrix<T,R1,C2> A_mult_inv_b(A.rows(),b.cols());
+
29  Eigen::Matrix<T,R1,C2> deriv_A_mult_inv_b(A.rows(),b.cols());
+
30  Eigen::Matrix<T,R2,C2> deriv_b_mult_inv_b(b.rows(),b.cols());
+
31  Eigen::Matrix<T,R1,C1> val_A(A.rows(),A.cols());
+
32  Eigen::Matrix<T,R1,C1> deriv_A(A.rows(),A.cols());
+
33  Eigen::Matrix<T,R2,C2> val_b(b.rows(),b.cols());
+
34  Eigen::Matrix<T,R2,C2> deriv_b(b.rows(),b.cols());
+
35  val_b.setZero();
+
36  deriv_b.setZero();
+
37 
+
38  for (size_type j = 0; j < A.cols(); j++) {
+
39  for(size_type i = 0; i < A.rows(); i++) {
+
40  val_A(i,j) = A(i,j).val_;
+
41  deriv_A(i,j) = A(i,j).d_;
+
42  }
+
43  }
+
44 
+
45  for (size_type j = 0; j < b.cols(); j++) {
+
46  for(size_type i = j; i < b.rows(); i++) {
+
47  val_b(i,j) = b(i,j).val_;
+
48  deriv_b(i,j) = b(i,j).d_;
+
49  }
+
50  }
+
51 
+
52  A_mult_inv_b = mdivide_right(val_A, val_b);
+
53  deriv_A_mult_inv_b = mdivide_right(deriv_A, val_b);
+
54  deriv_b_mult_inv_b = mdivide_right(deriv_b, val_b);
+
55 
+
56  Eigen::Matrix<T,R1,C2> deriv(A.rows(), b.cols());
+
57  deriv = deriv_A_mult_inv_b - multiply(A_mult_inv_b, deriv_b_mult_inv_b);
+
58 
+
59  return stan::agrad::to_fvar(A_mult_inv_b, deriv);
+
60  }
+
61 
+
62  template <typename T, int R1,int C1,int R2,int C2>
+
63  inline
+
64  Eigen::Matrix<fvar<T>,R1,C2>
+
65  mdivide_right_tri_low(const Eigen::Matrix<fvar<T>,R1,C1> &A,
+
66  const Eigen::Matrix<double,R2,C2> &b) {
+
67 
+
68  using stan::math::multiply;
+ +
70  stan::math::validate_square(b,"mdivide_right");
+
71  stan::math::validate_multiplicable(A,b,"mdivide_right");
+
72 
+
73  Eigen::Matrix<T,R2,C2> deriv_b_mult_inv_b(b.rows(),b.cols());
+
74  Eigen::Matrix<T,R1,C1> val_A(A.rows(),A.cols());
+
75  Eigen::Matrix<T,R1,C1> deriv_A(A.rows(),A.cols());
+
76  Eigen::Matrix<T,R2,C2> val_b(b.rows(),b.cols());
+
77  val_b.setZero();
+
78 
+
79  for (int j = 0; j < A.cols(); j++) {
+
80  for(int i = 0; i < A.rows(); i++) {
+
81  val_A(i,j) = A(i,j).val_;
+
82  deriv_A(i,j) = A(i,j).d_;
+
83  }
+
84  }
+
85 
+
86  for (size_type j = 0; j < b.cols(); j++) {
+
87  for(size_type i = j; i < b.rows(); i++) {
+
88  val_b(i,j) = b(i,j);
+
89  }
+
90  }
+
91 
+
92  return stan::agrad::to_fvar(mdivide_right(val_A, val_b),
+
93  mdivide_right(deriv_A, val_b));
+
94  }
+
95 
+
96  template <typename T, int R1,int C1,int R2,int C2>
+
97  inline
+
98  Eigen::Matrix<fvar<T>,R1,C2>
+
99  mdivide_right_tri_low(const Eigen::Matrix<double,R1,C1> &A,
+
100  const Eigen::Matrix<fvar<T>,R2,C2> &b) {
+
101 
+
102  using stan::math::multiply;
+ +
104  stan::math::validate_square(b,"mdivide_right");
+
105  stan::math::validate_multiplicable(A,b,"mdivide_right");
+
106 
+
107  Eigen::Matrix<T,R1,C2>
+
108  A_mult_inv_b(A.rows(),b.cols());
+
109  Eigen::Matrix<T,R2,C2> deriv_b_mult_inv_b(b.rows(),b.cols());
+
110  Eigen::Matrix<T,R2,C2> val_b(b.rows(),b.cols());
+
111  Eigen::Matrix<T,R2,C2> deriv_b(b.rows(),b.cols());
+
112  val_b.setZero();
+
113  deriv_b.setZero();
+
114 
+
115  for (int j = 0; j < b.cols(); j++) {
+
116  for(int i = j; i < b.rows(); i++) {
+
117  val_b(i,j) = b(i,j).val_;
+
118  deriv_b(i,j) = b(i,j).d_;
+
119  }
+
120  }
+
121 
+
122  A_mult_inv_b = mdivide_right(A, val_b);
+
123  deriv_b_mult_inv_b = mdivide_right(deriv_b, val_b);
+
124 
+
125  Eigen::Matrix<T,R1,C2>
+
126  deriv(A.rows(), b.cols());
+
127  deriv = -multiply(A_mult_inv_b, deriv_b_mult_inv_b);
+
128 
+
129  return stan::agrad::to_fvar(A_mult_inv_b, deriv);
+
130  }
+
131  }
+
132 }
+
133 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2multiply_8hpp.html b/doc/api/html/agrad_2fwd_2matrix_2multiply_8hpp.html new file mode 100644 index 00000000000..9f87b7e03d9 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2multiply_8hpp.html @@ -0,0 +1,171 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/multiply.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
multiply.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

template<typename T , int R1, int C1>
Eigen::Matrix< fvar< T >, R1, C1 > stan::agrad::multiply (const Eigen::Matrix< fvar< T >, R1, C1 > &m, const fvar< T > &c)
 
template<typename T , int R2, int C2>
Eigen::Matrix< fvar< T >, R2, C2 > stan::agrad::multiply (const Eigen::Matrix< fvar< T >, R2, C2 > &m, const double c)
 
template<typename T , int R1, int C1>
Eigen::Matrix< fvar< T >, R1, C1 > stan::agrad::multiply (const Eigen::Matrix< double, R1, C1 > &m, const fvar< T > &c)
 
template<typename T , int R1, int C1>
Eigen::Matrix< fvar< T >, R1, C1 > stan::agrad::multiply (const fvar< T > &c, const Eigen::Matrix< fvar< T >, R1, C1 > &m)
 
template<typename T , int R1, int C1>
Eigen::Matrix< fvar< T >, R1, C1 > stan::agrad::multiply (const double c, const Eigen::Matrix< fvar< T >, R1, C1 > &m)
 
template<typename T , int R1, int C1>
Eigen::Matrix< fvar< T >, R1, C1 > stan::agrad::multiply (const fvar< T > &c, const Eigen::Matrix< double, R1, C1 > &m)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, C2 > stan::agrad::multiply (const Eigen::Matrix< fvar< T >, R1, C1 > &m1, const Eigen::Matrix< fvar< T >, R2, C2 > &m2)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, C2 > stan::agrad::multiply (const Eigen::Matrix< fvar< T >, R1, C1 > &m1, const Eigen::Matrix< double, R2, C2 > &m2)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, C2 > stan::agrad::multiply (const Eigen::Matrix< double, R1, C1 > &m1, const Eigen::Matrix< fvar< T >, R2, C2 > &m2)
 
template<typename T , int C1, int R2>
fvar< T > stan::agrad::multiply (const Eigen::Matrix< fvar< T >, 1, C1 > &rv, const Eigen::Matrix< fvar< T >, R2, 1 > &v)
 
template<typename T , int C1, int R2>
fvar< T > stan::agrad::multiply (const Eigen::Matrix< fvar< T >, 1, C1 > &rv, const Eigen::Matrix< double, R2, 1 > &v)
 
template<typename T , int C1, int R2>
fvar< T > stan::agrad::multiply (const Eigen::Matrix< double, 1, C1 > &rv, const Eigen::Matrix< fvar< T >, R2, 1 > &v)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2multiply_8hpp_source.html b/doc/api/html/agrad_2fwd_2matrix_2multiply_8hpp_source.html new file mode 100644 index 00000000000..906cd53771c --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2multiply_8hpp_source.html @@ -0,0 +1,268 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/multiply.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
multiply.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__MATRIX__MULTIPLY_HPP__
+
2 #define __STAN__AGRAD__FWD__MATRIX__MULTIPLY_HPP__
+
3 
+
4 #include <vector>
+
5 #include <boost/math/tools/promotion.hpp>
+ + + + + + + + +
14 
+
15 namespace stan {
+
16  namespace agrad {
+
17 
+
18  template<typename T, int R1,int C1>
+
19  inline
+
20  Eigen::Matrix<fvar<T>,R1,C1>
+
21  multiply(const Eigen::Matrix<fvar<T>, R1, C1>& m, const fvar<T>& c) {
+
22  Eigen::Matrix<fvar<T>,R1,C1> res(m.rows(),m.cols());
+
23  for(int i = 0; i < m.rows(); i++) {
+
24  for(int j = 0; j < m.cols(); j++)
+
25  res(i,j) = c * m(i,j);
+
26  }
+
27  return res;
+
28  }
+
29 
+
30  template<typename T,int R2,int C2>
+
31  inline
+
32  Eigen::Matrix<fvar<T>, R2, C2>
+
33  multiply(const Eigen::Matrix<fvar<T>, R2, C2>& m, const double c) {
+
34  Eigen::Matrix<fvar<T>,R2,C2>
+
35  res(m.rows(),m.cols());
+
36  for(int i = 0; i < m.rows(); i++) {
+
37  for(int j = 0; j < m.cols(); j++)
+
38  res(i,j) = c * m(i,j);
+
39  }
+
40  return res;
+
41  }
+
42 
+
43  template<typename T, int R1,int C1>
+
44  inline
+
45  Eigen::Matrix<fvar<T>,R1,C1>
+
46  multiply(const Eigen::Matrix<double, R1, C1>& m, const fvar<T>& c) {
+
47  Eigen::Matrix<fvar<T>,R1,C1>
+
48  res(m.rows(),m.cols());
+
49  for(int i = 0; i < m.rows(); i++) {
+
50  for(int j = 0; j < m.cols(); j++)
+
51  res(i,j) = c * m(i,j);
+
52  }
+
53  return res;
+
54  }
+
55 
+
56  template<typename T, int R1,int C1>
+
57  inline
+
58  Eigen::Matrix<fvar<T>,R1,C1>
+
59  multiply(const fvar<T>& c, const Eigen::Matrix<fvar<T>, R1, C1>& m) {
+
60  return multiply(m, c);
+
61  }
+
62 
+
63  template<typename T, int R1,int C1>
+
64  inline
+
65  Eigen::Matrix<fvar<T>,R1,C1>
+
66  multiply(const double c, const Eigen::Matrix<fvar<T>, R1, C1>& m) {
+
67  return multiply(m, c);
+
68  }
+
69 
+
70  template<typename T, int R1,int C1>
+
71  inline
+
72  Eigen::Matrix<fvar<T>,R1,C1>
+
73  multiply(const fvar<T>& c, const Eigen::Matrix<double, R1, C1>& m) {
+
74  return multiply(m, c);
+
75  }
+
76 
+
77  template<typename T, int R1,int C1,int R2,int C2>
+
78  inline
+
79  Eigen::Matrix<fvar<T>,R1,C2>
+
80  multiply(const Eigen::Matrix<fvar<T>,R1,C1>& m1,
+
81  const Eigen::Matrix<fvar<T>,R2,C2>& m2) {
+
82  stan::math::validate_multiplicable(m1,m2,"multiply");
+
83  Eigen::Matrix<fvar<T>,R1,C2> result(m1.rows(),m2.cols());
+
84  for (size_type i = 0; i < m1.rows(); i++) {
+
85  Eigen::Matrix<fvar<T>,1,C1> crow = m1.row(i);
+
86  for (size_type j = 0; j < m2.cols(); j++) {
+
87  Eigen::Matrix<fvar<T>,R2,1> ccol = m2.col(j);
+
88  result(i,j) = stan::agrad::dot_product(crow,ccol);
+
89  }
+
90  }
+
91  return result;
+
92  }
+
93 
+
94  template<typename T, int R1,int C1,int R2,int C2>
+
95  inline
+
96  Eigen::Matrix<fvar<T>,R1,C2>
+
97  multiply(const Eigen::Matrix<fvar<T>,R1,C1>& m1,
+
98  const Eigen::Matrix<double,R2,C2>& m2) {
+
99  stan::math::validate_multiplicable(m1,m2,"multiply");
+
100  Eigen::Matrix<fvar<T>,R1,C2>
+
101  result(m1.rows(),m2.cols());
+
102  for (size_type i = 0; i < m1.rows(); i++) {
+
103  Eigen::Matrix<fvar<T>,1,C1> crow = m1.row(i);
+
104  for (size_type j = 0; j < m2.cols(); j++) {
+
105  Eigen::Matrix<double,R2,1> ccol = m2.col(j);
+
106  result(i,j) = stan::agrad::dot_product(crow,ccol);
+
107  }
+
108  }
+
109  return result;
+
110  }
+
111 
+
112  template<typename T, int R1,int C1,int R2,int C2>
+
113  inline
+
114  Eigen::Matrix<fvar<T>,R1,C2>
+
115  multiply(const Eigen::Matrix<double,R1,C1>& m1,
+
116  const Eigen::Matrix<fvar<T>,R2,C2>& m2) {
+
117  stan::math::validate_multiplicable(m1,m2,"multiply");
+
118  Eigen::Matrix<fvar<T>,R1,C2>
+
119  result(m1.rows(),m2.cols());
+
120  for (size_type i = 0; i < m1.rows(); i++) {
+
121  Eigen::Matrix<double,1,C1> crow = m1.row(i);
+
122  for (size_type j = 0; j < m2.cols(); j++) {
+
123  Eigen::Matrix<fvar<T>,R2,1> ccol = m2.col(j);
+
124  result(i,j) = stan::agrad::dot_product(crow,ccol);
+
125  }
+
126  }
+
127  return result;
+
128  }
+
129 
+
130  template <typename T, int C1,int R2>
+
131  inline
+
132  fvar<T>
+
133  multiply(const Eigen::Matrix<fvar<T>, 1, C1>& rv,
+
134  const Eigen::Matrix<fvar<T>, R2, 1>& v) {
+
135  if (rv.size() != v.size())
+
136  throw std::domain_error("row vector and vector must be same length in multiply");
+
137  return dot_product(rv, v);
+
138  }
+
139 
+
140  template <typename T, int C1,int R2>
+
141  inline
+
142  fvar<T>
+
143  multiply(const Eigen::Matrix<fvar<T>, 1, C1>& rv,
+
144  const Eigen::Matrix<double, R2, 1>& v) {
+
145  if (rv.size() != v.size())
+
146  throw std::domain_error("row vector and vector must be same length in multiply");
+
147  return dot_product(rv, v);
+
148  }
+
149 
+
150  template <typename T, int C1,int R2>
+
151  inline
+
152  fvar<T>
+
153  multiply(const Eigen::Matrix<double, 1, C1>& rv,
+
154  const Eigen::Matrix<fvar<T>, R2, 1>& v) {
+
155  if (rv.size() != v.size())
+
156  throw std::domain_error("row vector and vector must be same length in multiply");
+
157  return dot_product(rv, v);
+
158  }
+
159  }
+
160 }
+
161 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2multiply__lower__tri__self__transpose_8hpp.html b/doc/api/html/agrad_2fwd_2matrix_2multiply__lower__tri__self__transpose_8hpp.html new file mode 100644 index 00000000000..9b7648ba6d4 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2multiply__lower__tri__self__transpose_8hpp.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/multiply_lower_tri_self_transpose.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
multiply_lower_tri_self_transpose.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T , int R, int C>
Eigen::Matrix< fvar< T >, R, R > stan::agrad::multiply_lower_tri_self_transpose (const Eigen::Matrix< fvar< T >, R, C > &m)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2multiply__lower__tri__self__transpose_8hpp_source.html b/doc/api/html/agrad_2fwd_2matrix_2multiply__lower__tri__self__transpose_8hpp_source.html new file mode 100644 index 00000000000..f03d490b704 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2multiply__lower__tri__self__transpose_8hpp_source.html @@ -0,0 +1,140 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/multiply_lower_tri_self_transpose.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
multiply_lower_tri_self_transpose.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__MATRIX__MULTIPLY_LOWER_TRI_SELF_TRANSPOSE_HPP__
+
2 #define __STAN__AGRAD__FWD__MATRIX__MULTIPLY_LOWER_TRI_SELF_TRANSPOSE_HPP__
+
3 
+
4 #include <vector>
+ + + + + +
10 
+
11 namespace stan {
+
12  namespace agrad {
+
13 
+
14  template<typename T,int R, int C>
+
15  inline
+
16  Eigen::Matrix<fvar<T>,R,R>
+
17  multiply_lower_tri_self_transpose(const Eigen::Matrix<fvar<T>, R, C>& m) {
+
18  if (m.rows() == 0)
+
19  return Eigen::Matrix<fvar<T>,R,R>(0,0);
+
20  Eigen::Matrix<fvar<T>,R,C> L(m.rows(),m.cols());
+
21  L.setZero();
+
22 
+
23  for(size_type i = 0; i < m.rows(); i++) {
+
24  for(size_type j = 0; (j < i + 1) && (j < m.cols()); j++)
+
25  L(i,j) = m(i,j);
+
26  }
+
27 
+ +
29  }
+
30 
+
31  }
+
32 }
+
33 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2rows__dot__product_8hpp.html b/doc/api/html/agrad_2fwd_2matrix_2rows__dot__product_8hpp.html new file mode 100644 index 00000000000..6a169eb61a8 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2rows__dot__product_8hpp.html @@ -0,0 +1,141 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/rows_dot_product.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
rows_dot_product.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, 1 > stan::agrad::rows_dot_product (const Eigen::Matrix< fvar< T >, R1, C1 > &v1, const Eigen::Matrix< fvar< T >, R2, C2 > &v2)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, 1 > stan::agrad::rows_dot_product (const Eigen::Matrix< double, R1, C1 > &v1, const Eigen::Matrix< fvar< T >, R2, C2 > &v2)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, 1 > stan::agrad::rows_dot_product (const Eigen::Matrix< fvar< T >, R1, C1 > &v1, const Eigen::Matrix< double, R2, C2 > &v2)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2rows__dot__product_8hpp_source.html b/doc/api/html/agrad_2fwd_2matrix_2rows__dot__product_8hpp_source.html new file mode 100644 index 00000000000..be96d1e5822 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2rows__dot__product_8hpp_source.html @@ -0,0 +1,171 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/rows_dot_product.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
rows_dot_product.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__MATRIX__ROWS__DOT_PRODUCT_HPP__
+
2 #define __STAN__AGRAD__FWD__MATRIX__ROWS__DOT_PRODUCT_HPP__
+
3 
+
4 #include <vector>
+ + + + + +
10 #include <stan/agrad/fwd/fvar.hpp>
+
11 
+
12 
+
13 namespace stan {
+
14  namespace agrad {
+
15 
+
16  template<typename T, int R1,int C1,int R2, int C2>
+
17  inline
+
18  Eigen::Matrix<fvar<T>, R1, 1>
+
19  rows_dot_product(const Eigen::Matrix<fvar<T>, R1, C1>& v1,
+
20  const Eigen::Matrix<fvar<T>, R2, C2>& v2) {
+
21  stan::math::validate_matching_dims(v1,v2,"rows_dot_product");
+
22  Eigen::Matrix<fvar<T>, R1, 1> ret(v1.rows(),1);
+
23  for (size_type j = 0; j < v1.rows(); ++j) {
+
24  Eigen::Matrix<fvar<T>,R1,C1> crow1 = v1.row(j);
+
25  Eigen::Matrix<fvar<T>,R2,C2> crow2 = v2.row(j);
+
26  ret(j,0) = dot_product(crow1, crow2);
+
27  }
+
28  return ret;
+
29  }
+
30 
+
31  template<typename T, int R1,int C1,int R2, int C2>
+
32  inline
+
33  Eigen::Matrix<fvar<T>, R1, 1>
+
34  rows_dot_product(const Eigen::Matrix<double, R1, C1>& v1,
+
35  const Eigen::Matrix<fvar<T>, R2, C2>& v2) {
+
36  stan::math::validate_matching_dims(v1,v2,"rows_dot_product");
+
37  Eigen::Matrix<fvar<T>, R1, 1>
+
38  ret(v1.rows(),1);
+
39  for (size_type j = 0; j < v1.rows(); ++j) {
+
40  Eigen::Matrix<double,R1,C1> crow = v1.row(j);
+
41  Eigen::Matrix<fvar<T>,R2,C2> crow2 = v2.row(j);
+
42  ret(j,0) = dot_product(crow, crow2);
+
43  }
+
44  return ret;
+
45  }
+
46 
+
47  template<typename T, int R1,int C1,int R2, int C2>
+
48  inline
+
49  Eigen::Matrix<fvar<T>, R1, 1>
+
50  rows_dot_product(const Eigen::Matrix<fvar<T>, R1, C1>& v1,
+
51  const Eigen::Matrix<double, R2, C2>& v2) {
+
52  stan::math::validate_matching_dims(v1,v2,"rows_dot_product");
+
53  Eigen::Matrix<fvar<T>, R1, 1>
+
54  ret(v1.rows(),1);
+
55  for (size_type j = 0; j < v1.rows(); ++j) {
+
56  Eigen::Matrix<fvar<T>,R1,C1> crow1 = v1.row(j);
+
57  Eigen::Matrix<double,R2,C2> crow = v2.row(j);
+
58  ret(j,0) = dot_product(crow1, crow);
+
59  }
+
60  return ret;
+
61  }
+
62  }
+
63 }
+
64 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2rows__dot__self_8hpp.html b/doc/api/html/agrad_2fwd_2matrix_2rows__dot__self_8hpp.html new file mode 100644 index 00000000000..1d4451fa778 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2rows__dot__self_8hpp.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/rows_dot_self.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
rows_dot_self.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T , int R, int C>
Eigen::Matrix< fvar< T >, R, 1 > stan::agrad::rows_dot_self (const Eigen::Matrix< fvar< T >, R, C > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2rows__dot__self_8hpp_source.html b/doc/api/html/agrad_2fwd_2matrix_2rows__dot__self_8hpp_source.html new file mode 100644 index 00000000000..5d1808365c5 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2rows__dot__self_8hpp_source.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/rows_dot_self.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
rows_dot_self.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__ROWS_DOT_SELF_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__ROWS_DOT_SELF_HPP__
+
3 
+
4 #include <vector>
+ + + + + +
10 
+
11 namespace stan {
+
12  namespace agrad {
+
13 
+
14  template<typename T, int R,int C>
+
15  inline Eigen::Matrix<fvar<T>,R,1>
+
16  rows_dot_self(const Eigen::Matrix<fvar<T>,R,C>& x) {
+
17  Eigen::Matrix<fvar<T>,R,1> ret(x.rows(),1);
+
18  for (size_type i = 0; i < x.rows(); i++) {
+
19  Eigen::Matrix<fvar<T>,1,C> crow = x.row(i);
+
20  ret(i,0) = dot_self(crow);
+
21  }
+
22  return ret;
+
23  }
+
24  }
+
25 }
+
26 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2softmax_8hpp.html b/doc/api/html/agrad_2fwd_2matrix_2softmax_8hpp.html new file mode 100644 index 00000000000..65af93c382b --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2softmax_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/softmax.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
softmax.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
Eigen::Matrix< fvar< T >
+, Eigen::Dynamic, 1 > 
stan::agrad::softmax (const Eigen::Matrix< fvar< T >, Eigen::Dynamic, 1 > &alpha)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2softmax_8hpp_source.html b/doc/api/html/agrad_2fwd_2matrix_2softmax_8hpp_source.html new file mode 100644 index 00000000000..f49d92ebdd1 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2softmax_8hpp_source.html @@ -0,0 +1,165 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/softmax.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
softmax.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__MATRIX__SOFTMAX_HPP__
+
2 #define __STAN__AGRAD__FWD__MATRIX__SOFTMAX_HPP__
+
3 
+ + + +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  template <typename T>
+
12  inline
+
13  Eigen::Matrix<fvar<T>,Eigen::Dynamic,1>
+
14  softmax(const Eigen::Matrix<fvar<T>,Eigen::Dynamic,1>& alpha) {
+
15  using stan::math::softmax;
+
16  using Eigen::Matrix;
+
17  using Eigen::Dynamic;
+
18 
+
19  Matrix<T,Dynamic,1> alpha_t(alpha.size());
+
20  for (int k = 0; k < alpha.size(); ++k)
+
21  alpha_t(k) = alpha(k).val_;
+
22 
+
23  Matrix<T,Dynamic,1> softmax_alpha_t = softmax(alpha_t);
+
24 
+
25  Matrix<fvar<T>,Dynamic,1> softmax_alpha(alpha.size());
+
26  for (int k = 0; k < alpha.size(); ++k) {
+
27  softmax_alpha(k).val_ = softmax_alpha_t(k);
+
28  softmax_alpha(k).d_ = 0;
+
29  }
+
30 
+
31  // for each input position
+
32  for (int m = 0; m < alpha.size(); ++m) {
+
33  // for each output position
+
34  T negative_alpha_m_d_times_softmax_alpha_t_m
+
35  = - alpha(m).d_ * softmax_alpha_t(m);
+
36  for (int k = 0; k < alpha.size(); ++k) {
+
37  // chain from input to output
+
38  if (m == k) {
+
39  softmax_alpha(k).d_
+
40  += softmax_alpha_t(k)
+
41  * (alpha(m).d_
+
42  + negative_alpha_m_d_times_softmax_alpha_t_m);
+
43  } else {
+
44  softmax_alpha(k).d_
+
45  += negative_alpha_m_d_times_softmax_alpha_t_m
+
46  * softmax_alpha_t(k);
+
47  }
+
48  }
+
49  }
+
50 
+
51  return softmax_alpha;
+
52  }
+
53 
+
54 
+
55  }
+
56 }
+
57 
+
58 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2sort_8hpp.html b/doc/api/html/agrad_2fwd_2matrix_2sort_8hpp.html new file mode 100644 index 00000000000..45470eb19f6 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2sort_8hpp.html @@ -0,0 +1,143 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/sort.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
sort.hpp File Reference
+
+
+
#include <stan/agrad/fwd/fvar.hpp>
+#include <stan/meta/traits.hpp>
+#include <vector>
+#include <stan/math/matrix/Eigen.hpp>
+#include <algorithm>
+#include <functional>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + + + + +

+Functions

template<typename T >
std::vector< fvar< T > > stan::agrad::sort_asc (std::vector< fvar< T > > xs)
 
template<typename T >
std::vector< fvar< T > > stan::agrad::sort_desc (std::vector< fvar< T > > xs)
 
template<typename T , int R, int C>
Eigen::Matrix< fvar< T >, R, C > stan::agrad::sort_asc (Eigen::Matrix< fvar< T >, R, C > xs)
 
template<typename T , int R, int C>
Eigen::Matrix< fvar< T >, R, C > stan::agrad::sort_desc (Eigen::Matrix< fvar< T >, R, C > xs)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2sort_8hpp_source.html b/doc/api/html/agrad_2fwd_2matrix_2sort_8hpp_source.html new file mode 100644 index 00000000000..717bffd6d32 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2sort_8hpp_source.html @@ -0,0 +1,156 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/sort.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
sort.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__SORT_HPP__
+
2 #define __STAN__AGRAD__FWD__SORT_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 #include <vector>
+ +
8 #include <algorithm> // std::sort
+
9 #include <functional> // std::greater
+
10 
+
11 namespace stan {
+
12 
+
13  namespace agrad {
+
14 
+
15  template <typename T>
+
16  inline
+
17  std::vector< fvar<T> >
+
18  sort_asc(std::vector< fvar<T> > xs) {
+
19  std::sort(xs.begin(), xs.end());
+
20  return xs;
+
21  }
+
22 
+
23  template <typename T>
+
24  inline
+
25  std::vector< fvar<T> >
+
26  sort_desc(std::vector< fvar<T> > xs) {
+
27  std::sort(xs.begin(), xs.end(), std::greater< fvar<T> >());
+
28  return xs;
+
29  }
+
30 
+
31  template <typename T, int R, int C>
+
32  inline
+
33  typename Eigen::Matrix<fvar<T>,R,C>
+
34  sort_asc(Eigen::Matrix<fvar<T>,R,C> xs) {
+
35  std::sort(xs.data(), xs.data()+xs.size());
+
36  return xs;
+
37  }
+
38 
+
39  template <typename T, int R, int C>
+
40  inline
+
41  typename Eigen::Matrix<fvar<T>,R,C>
+
42  sort_desc(Eigen::Matrix<fvar<T>,R,C> xs) {
+
43  std::sort(xs.data(), xs.data()+xs.size(), std::greater< fvar<T> >());
+
44  return xs;
+
45  }
+
46 
+
47  }
+
48 }
+
49 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2sum_8hpp.html b/doc/api/html/agrad_2fwd_2matrix_2sum_8hpp.html new file mode 100644 index 00000000000..7c95d5eaeb0 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2sum_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/sum.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
sum.hpp File Reference
+
+
+
#include <vector>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/agrad/fwd/fvar.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T , int R, int C>
fvar< T > stan::agrad::sum (const Eigen::Matrix< fvar< T >, R, C > &m)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2sum_8hpp_source.html b/doc/api/html/agrad_2fwd_2matrix_2sum_8hpp_source.html new file mode 100644 index 00000000000..1149047139a --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2sum_8hpp_source.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/sum.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
sum.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__MATRIX__SUM_HPP__
+
2 #define __STAN__AGRAD__FWD__MATRIX__SUM_HPP__
+
3 
+
4 #include <vector>
+ + +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  template <typename T, int R, int C>
+
12  inline
+
13  fvar<T>
+
14  sum(const Eigen::Matrix<fvar<T>,R,C>& m) {
+
15  fvar<T> sum = 0;
+
16  if (m.size() == 0)
+
17  return 0.0;
+
18  for(unsigned i = 0; i < m.rows(); i++) {
+
19  for(unsigned j = 0; j < m.cols(); j++)
+
20  sum += m(i,j);
+
21  }
+
22  return sum;
+
23  }
+
24  }
+
25 }
+
26 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2tcrossprod_8hpp.html b/doc/api/html/agrad_2fwd_2matrix_2tcrossprod_8hpp.html new file mode 100644 index 00000000000..77a100f1371 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2tcrossprod_8hpp.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/tcrossprod.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
tcrossprod.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T , int R, int C>
Eigen::Matrix< fvar< T >, R, R > stan::agrad::tcrossprod (const Eigen::Matrix< fvar< T >, R, C > &m)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2tcrossprod_8hpp_source.html b/doc/api/html/agrad_2fwd_2matrix_2tcrossprod_8hpp_source.html new file mode 100644 index 00000000000..61adf8a18d8 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2tcrossprod_8hpp_source.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/tcrossprod.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
tcrossprod.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__MATRIX__TCROSSPROD_HPP__
+
2 #define __STAN__AGRAD__FWD__MATRIX__TCROSSPROD_HPP__
+
3 
+
4 #include <vector>
+ + + + + +
10 
+
11 namespace stan {
+
12  namespace agrad {
+
13 
+
14  template<typename T,int R, int C>
+
15  inline
+
16  Eigen::Matrix<fvar<T>,R,R>
+
17  tcrossprod(const Eigen::Matrix<fvar<T>, R, C>& m) {
+
18  if (m.rows() == 0)
+
19  return Eigen::Matrix<fvar<T>,R,R>(0,0);
+ +
21  }
+
22 
+
23  }
+
24 }
+
25 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2typedefs_8hpp.html b/doc/api/html/agrad_2fwd_2matrix_2typedefs_8hpp.html new file mode 100644 index 00000000000..1c7084722fb --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2typedefs_8hpp.html @@ -0,0 +1,179 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/typedefs.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
typedefs.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Typedefs

typedef Eigen::Matrix< double,
+Eigen::Dynamic, Eigen::Dynamic >
+::Index 
stan::agrad::size_type
 
typedef Eigen::Matrix< fvar
+< double >, Eigen::Dynamic,
+Eigen::Dynamic > 
stan::agrad::matrix_fd
 
typedef Eigen::Matrix< fvar
+< var >, Eigen::Dynamic,
+Eigen::Dynamic > 
stan::agrad::matrix_fv
 
typedef Eigen::Matrix< fvar
+< fvar< double >
+ >, Eigen::Dynamic,
+Eigen::Dynamic > 
stan::agrad::matrix_ffd
 
typedef Eigen::Matrix< fvar
+< fvar< var >
+ >, Eigen::Dynamic,
+Eigen::Dynamic > 
stan::agrad::matrix_ffv
 
typedef Eigen::Matrix< fvar
+< double >, Eigen::Dynamic, 1 > 
stan::agrad::vector_fd
 
typedef Eigen::Matrix< fvar
+< var >, Eigen::Dynamic, 1 > 
stan::agrad::vector_fv
 
typedef Eigen::Matrix< fvar
+< fvar< double >
+ >, Eigen::Dynamic, 1 > 
stan::agrad::vector_ffd
 
typedef Eigen::Matrix< fvar
+< fvar< var >
+ >, Eigen::Dynamic, 1 > 
stan::agrad::vector_ffv
 
typedef Eigen::Matrix< fvar
+< double >, 1, Eigen::Dynamic > 
stan::agrad::row_vector_fd
 
typedef Eigen::Matrix< fvar
+< var >, 1, Eigen::Dynamic > 
stan::agrad::row_vector_fv
 
typedef Eigen::Matrix< fvar
+< fvar< double >
+ >, 1, Eigen::Dynamic > 
stan::agrad::row_vector_ffd
 
typedef Eigen::Matrix< fvar
+< fvar< var >
+ >, 1, Eigen::Dynamic > 
stan::agrad::row_vector_ffv
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_2typedefs_8hpp_source.html b/doc/api/html/agrad_2fwd_2matrix_2typedefs_8hpp_source.html new file mode 100644 index 00000000000..86a8c57eebb --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_2typedefs_8hpp_source.html @@ -0,0 +1,173 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/typedefs.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
typedefs.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__MATRIX__TYPEDEFS_HPP__
+
2 #define __STAN__AGRAD__FWD__MATRIX__TYPEDEFS_HPP__
+
3 
+ + +
6 #include <stan/agrad/rev/var.hpp>
+ +
8 
+
9 namespace stan {
+
10  namespace agrad {
+
11 
+
12  typedef
+
13  Eigen::Matrix<double,Eigen::Dynamic,Eigen::Dynamic>::Index
+ +
15 
+
16  typedef
+
17  Eigen::Matrix<fvar<double>,Eigen::Dynamic,Eigen::Dynamic>
+ +
19 
+
20  typedef
+
21  Eigen::Matrix<fvar<var>,Eigen::Dynamic,Eigen::Dynamic>
+ +
23 
+
24  typedef
+
25  Eigen::Matrix<fvar<fvar<double> >,Eigen::Dynamic,Eigen::Dynamic>
+ +
27 
+
28  typedef
+
29  Eigen::Matrix<fvar<fvar<var> >,Eigen::Dynamic,Eigen::Dynamic>
+ +
31 
+
32  typedef
+
33  Eigen::Matrix<fvar<double>,Eigen::Dynamic,1>
+ +
35 
+
36  typedef
+
37  Eigen::Matrix<fvar<var>,Eigen::Dynamic,1>
+ +
39 
+
40  typedef
+
41  Eigen::Matrix<fvar<fvar<double> >,Eigen::Dynamic,1>
+ +
43 
+
44  typedef
+
45  Eigen::Matrix<fvar<fvar<var> >,Eigen::Dynamic,1>
+ +
47 
+
48  typedef
+
49  Eigen::Matrix<fvar<double>,1,Eigen::Dynamic>
+ +
51 
+
52  typedef
+
53  Eigen::Matrix<fvar<var>,1,Eigen::Dynamic>
+ +
55 
+
56  typedef
+
57  Eigen::Matrix<fvar<fvar<double> >,1,Eigen::Dynamic>
+ +
59 
+
60  typedef
+
61  Eigen::Matrix<fvar<fvar<var> >,1,Eigen::Dynamic>
+ +
63 
+
64  }
+
65 }
+
66 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_8hpp.html b/doc/api/html/agrad_2fwd_2matrix_8hpp.html new file mode 100644 index 00000000000..2d3a9a92e2c --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_8hpp.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
matrix.hpp File Reference
+
+
+ +

Go to the source code of this file.

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2matrix_8hpp_source.html b/doc/api/html/agrad_2fwd_2matrix_8hpp_source.html new file mode 100644 index 00000000000..d9d06c14eae --- /dev/null +++ b/doc/api/html/agrad_2fwd_2matrix_8hpp_source.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
matrix.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__MATRIX_HPP__
+
2 #define __STAN__AGRAD__FWD__MATRIX_HPP__
+
3 
+ + + + + + + + + + + + + + + + + + + + + + + + + +
29 
+
30 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2prob_2univariate_2continuous_2normal_8hpp.html b/doc/api/html/agrad_2fwd_2prob_2univariate_2continuous_2normal_8hpp.html new file mode 100644 index 00000000000..87cd3423cbe --- /dev/null +++ b/doc/api/html/agrad_2fwd_2prob_2univariate_2continuous_2normal_8hpp.html @@ -0,0 +1,142 @@ + + + + + +Stan: src/stan/agrad/fwd/prob/univariate/continuous/normal.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
normal.hpp File Reference
+
+
+
#include <boost/random/normal_distribution.hpp>
+#include <boost/random/variate_generator.hpp>
+#include <boost/utility/enable_if.hpp>
+#include <stan/agrad/partials_vari.hpp>
+#include <stan/math.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/prob/constants.hpp>
+#include <stan/prob/traits.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + +

+Functions

template<bool propto, typename T_y , typename T_loc , typename T_scale >
boost::enable_if_c
+< contains_fvar< T_y, T_loc,
+T_scale >::value, typename
+return_type< T_y, T_loc,
+T_scale >::type >::type 
stan::prob::normal_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 The log of the normal density for the specified scalar(s) given the specified mean(s) and deviation(s).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2fwd_2prob_2univariate_2continuous_2normal_8hpp_source.html b/doc/api/html/agrad_2fwd_2prob_2univariate_2continuous_2normal_8hpp_source.html new file mode 100644 index 00000000000..578d9674da0 --- /dev/null +++ b/doc/api/html/agrad_2fwd_2prob_2univariate_2continuous_2normal_8hpp_source.html @@ -0,0 +1,163 @@ + + + + + +Stan: src/stan/agrad/fwd/prob/univariate/continuous/normal.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
normal.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__PROB__UNIVARIATE__CONTINUOUS__NORMAL_HPP__
+
2 #define __STAN__AGRAD__FWD__PROB__UNIVARIATE__CONTINUOUS__NORMAL_HPP__
+
3 
+
4 #include <boost/random/normal_distribution.hpp>
+
5 #include <boost/random/variate_generator.hpp>
+
6 #include <boost/utility/enable_if.hpp>
+ +
8 #include <stan/math.hpp>
+ +
10 #include <stan/meta/traits.hpp>
+
11 #include <stan/prob/constants.hpp>
+
12 #include <stan/prob/traits.hpp>
+
13 
+
14 namespace stan {
+
15 
+
16  namespace prob {
+
17 
+
18  template <bool propto,
+
19  typename T_y, typename T_loc, typename T_scale>
+
20  typename boost::enable_if_c<contains_fvar<T_y,T_loc,T_scale>::value,
+ +
22  normal_log(const T_y& y, const T_loc& mu, const T_scale& sigma) {
+
23  // static const char* function = "stan::prob::normal_log(%1%)";
+
24  // FIXME: add input checks
+
25 
+
26  using std::log;
+ + + +
30 
+
31  // check if no variables are involved and prop-to
+ +
33  return 0.0;
+
34 
+
35  typename return_type<T_y,T_loc,T_scale>::type logp(0);
+
36 
+
37  // log probability
+ +
39  logp += NEG_LOG_SQRT_TWO_PI;
+
40 
+ +
42  logp -= log(sigma);
+
43 
+ +
45  typename return_type<T_y,T_loc,T_scale>::type z = (y - mu) / sigma;
+
46  logp -= 0.5 * z * z;
+
47  }
+
48 
+
49  return logp;
+
50  }
+
51 
+
52  }
+
53 
+
54 }
+
55 
+
56 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2error__handling_2matrix_2check__pos__definite_8hpp.html b/doc/api/html/agrad_2rev_2error__handling_2matrix_2check__pos__definite_8hpp.html new file mode 100644 index 00000000000..63f790a9d6e --- /dev/null +++ b/doc/api/html/agrad_2rev_2error__handling_2matrix_2check__pos__definite_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/rev/error_handling/matrix/check_pos_definite.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
check_pos_definite.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T_result , class Policy >
bool stan::agrad::check_pos_definite (const char *function, const Eigen::Matrix< var, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result, const Policy &)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2error__handling_2matrix_2check__pos__definite_8hpp_source.html b/doc/api/html/agrad_2rev_2error__handling_2matrix_2check__pos__definite_8hpp_source.html new file mode 100644 index 00000000000..1c5be39e15d --- /dev/null +++ b/doc/api/html/agrad_2rev_2error__handling_2matrix_2check__pos__definite_8hpp_source.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/agrad/rev/error_handling/matrix/check_pos_definite.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
check_pos_definite.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__ERROR_HANDLING__MATRIX__CHECK_POS_DEFINITE_HPP__
+
2 #define __STAN__AGRAD__REV__ERROR_HANDLING__MATRIX__CHECK_POS_DEFINITE_HPP__
+
3 
+
4 // global include
+ + +
7 #include <stan/agrad/rev/var.hpp>
+ +
9 
+
10 namespace stan {
+
11  namespace agrad {
+
12 
+
13  template <typename T_result, class Policy>
+
14  inline bool check_pos_definite(const char* function,
+
15  const Eigen::Matrix<var,Eigen::Dynamic,Eigen::Dynamic>& y,
+
16  const char* name,
+
17  T_result* result,
+
18  const Policy&) {
+
19  typedef
+ +
21  size_type;
+
22  Eigen::Matrix<double,Eigen::Dynamic,Eigen::Dynamic> y_d(y.rows(),y.cols());
+
23  for (size_type i = 0; i < y_d.rows(); i++)
+
24  for (size_type j = 0; j < y_d.cols(); j++)
+
25  y_d(i,j) = y(i,j).val();
+
26  return stan::math::check_pos_definite(function,y_d,name,result,Policy());
+
27  }
+
28 
+
29  }
+
30 }
+
31 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2error__handling_2matrix_8hpp.html b/doc/api/html/agrad_2rev_2error__handling_2matrix_8hpp.html new file mode 100644 index 00000000000..1d284bc24f4 --- /dev/null +++ b/doc/api/html/agrad_2rev_2error__handling_2matrix_8hpp.html @@ -0,0 +1,110 @@ + + + + + +Stan: src/stan/agrad/rev/error_handling/matrix.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
matrix.hpp File Reference
+
+
+ +

Go to the source code of this file.

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2error__handling_2matrix_8hpp_source.html b/doc/api/html/agrad_2rev_2error__handling_2matrix_8hpp_source.html new file mode 100644 index 00000000000..082e5c57aec --- /dev/null +++ b/doc/api/html/agrad_2rev_2error__handling_2matrix_8hpp_source.html @@ -0,0 +1,113 @@ + + + + + +Stan: src/stan/agrad/rev/error_handling/matrix.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
matrix.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__ERROR_HANDLING__MATRIX_HPP__
+
2 #define __STAN__AGRAD__REV__ERROR_HANDLING__MATRIX_HPP__
+
3 
+ +
5 
+
6 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2error__handling_8hpp.html b/doc/api/html/agrad_2rev_2error__handling_8hpp.html new file mode 100644 index 00000000000..545e1b5d20c --- /dev/null +++ b/doc/api/html/agrad_2rev_2error__handling_8hpp.html @@ -0,0 +1,109 @@ + + + + + +Stan: src/stan/agrad/rev/error_handling.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
error_handling.hpp File Reference
+
+
+ +

Go to the source code of this file.

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2error__handling_8hpp_source.html b/doc/api/html/agrad_2rev_2error__handling_8hpp_source.html new file mode 100644 index 00000000000..17681c50ac5 --- /dev/null +++ b/doc/api/html/agrad_2rev_2error__handling_8hpp_source.html @@ -0,0 +1,111 @@ + + + + + +Stan: src/stan/agrad/rev/error_handling.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
error_handling.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__ERROR_HANDLING_HPP__
+
2 #define __STAN__AGRAD__REV__ERROR_HANDLING_HPP__
+
3 
+
4 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2_phi_8hpp.html b/doc/api/html/agrad_2rev_2functions_2_phi_8hpp.html new file mode 100644 index 00000000000..b8882fac6db --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2_phi_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/functions/Phi.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
Phi.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::Phi (const stan::agrad::var &a)
 The unit normal cumulative density function for variables (stan).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2_phi_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2_phi_8hpp_source.html new file mode 100644 index 00000000000..7de641ab71f --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2_phi_8hpp_source.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/agrad/rev/functions/Phi.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
Phi.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__PHI_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__PHI_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ + +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  namespace {
+
12  class Phi_vari : public op_v_vari {
+
13  public:
+
14  Phi_vari(vari* avi) :
+
15  op_v_vari(stan::math::Phi(avi->val_), avi) {
+
16  }
+
17  void chain() {
+
18  static const double NEG_HALF = -0.5;
+
19  avi_->adj_ += adj_
+
20  * stan::math::INV_SQRT_TWO_PI * std::exp(NEG_HALF * avi_->val_ * avi_->val_);
+
21  }
+
22  };
+
23  }
+
24 
+
37  inline var Phi(const stan::agrad::var& a) {
+
38  return var(new Phi_vari(a.vi_));
+
39  }
+
40 
+
41  }
+
42 }
+
43 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2_phi__approx_8hpp.html b/doc/api/html/agrad_2rev_2functions_2_phi__approx_8hpp.html new file mode 100644 index 00000000000..333a8924288 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2_phi__approx_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/functions/Phi_approx.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
Phi_approx.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::Phi_approx (const stan::agrad::var &a)
 Approximation of the unit normal CDF for variables (stan).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2_phi__approx_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2_phi__approx_8hpp_source.html new file mode 100644 index 00000000000..617e851498b --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2_phi__approx_8hpp_source.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/functions/Phi_approx.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
Phi_approx.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__PHI_APPROX_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__PHI_APPROX_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ + +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
19  inline var Phi_approx(const stan::agrad::var& a) {
+
20  // return inv_logit(0.07056 * pow(a,3.0) + 1.5976 * a);
+
21 
+
22  double av = a.vi_->val_;
+
23  double av_squared = av * av;
+
24  double av_cubed = av * av_squared;
+
25  double f = stan::math::inv_logit(0.07056 * av_cubed + 1.5976 * av);
+
26  double da = f * (1 - f) * (3.0 * 0.07056 * av_squared + 1.5976);
+
27  return var(new precomp_v_vari(f,a.vi_,da));
+
28  }
+
29 
+
30  }
+
31 }
+
32 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2abs_8hpp.html b/doc/api/html/agrad_2rev_2functions_2abs_8hpp.html new file mode 100644 index 00000000000..b76042d28fc --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2abs_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/agrad/rev/functions/abs.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
abs.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::abs (const var &a)
 Return the absolute value of the variable (std).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2abs_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2abs_8hpp_source.html new file mode 100644 index 00000000000..3a86fa19ae8 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2abs_8hpp_source.html @@ -0,0 +1,122 @@ + + + + + +Stan: src/stan/agrad/rev/functions/abs.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
abs.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__ABS_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__ABS_HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7  namespace agrad {
+
8 
+
17  inline var abs(const var& a) {
+
18  return fabs(a);
+
19  }
+
20 
+
21  }
+
22 }
+
23 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2as__bool_8hpp.html b/doc/api/html/agrad_2rev_2functions_2as__bool_8hpp.html new file mode 100644 index 00000000000..b0998926531 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2as__bool_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/agrad/rev/functions/as_bool.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
as_bool.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

int stan::agrad::as_bool (const agrad::var &v)
 Return 1 if the argument is unequal to zero and 0 otherwise.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2as__bool_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2as__bool_8hpp_source.html new file mode 100644 index 00000000000..7d28243e485 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2as__bool_8hpp_source.html @@ -0,0 +1,122 @@ + + + + + +Stan: src/stan/agrad/rev/functions/as_bool.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
as_bool.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__AS_BOOL_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__AS_BOOL_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+
5 
+
6 namespace stan {
+
7  namespace agrad {
+
8 
+
15  inline int as_bool(const agrad::var& v) {
+
16  return 0.0 != v.vi_->val_;
+
17  }
+
18 
+
19  }
+
20 }
+
21 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2bessel__first__kind_8hpp.html b/doc/api/html/agrad_2rev_2functions_2bessel__first__kind_8hpp.html new file mode 100644 index 00000000000..46a05122622 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2bessel__first__kind_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/agrad/rev/functions/bessel_first_kind.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
bessel_first_kind.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + +

+Functions

var stan::agrad::bessel_first_kind (const int &v, const var &a)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2bessel__first__kind_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2bessel__first__kind_8hpp_source.html new file mode 100644 index 00000000000..9b2c01a375a --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2bessel__first__kind_8hpp_source.html @@ -0,0 +1,141 @@ + + + + + +Stan: src/stan/agrad/rev/functions/bessel_first_kind.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
bessel_first_kind.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__BESSEL_FIRST_KIND_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__BESSEL_FIRST_KIND_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ + + + + +
10 
+
11 namespace stan {
+
12  namespace agrad {
+
13 
+
14  namespace {
+
15 
+
16  class bessel_first_kind_dv_vari : public op_dv_vari {
+
17  public:
+
18  bessel_first_kind_dv_vari(int a, vari* bvi) :
+
19  op_dv_vari(stan::math::bessel_first_kind(a, bvi->val_), a, bvi) {
+
20  }
+
21  void chain() {
+
22  bvi_->adj_ += adj_ * (ad_ * stan::math::bessel_first_kind(ad_, bvi_->val_) / bvi_->val_ - stan::math::bessel_first_kind(ad_ + 1, bvi_->val_));
+
23  }
+
24  };
+
25  }
+
26 
+
27  inline var bessel_first_kind(const int& v,
+
28  const var& a) {
+
29  return var(new bessel_first_kind_dv_vari(v, a.vi_));
+
30  }
+
31 
+
32  }
+
33 }
+
34 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2bessel__second__kind_8hpp.html b/doc/api/html/agrad_2rev_2functions_2bessel__second__kind_8hpp.html new file mode 100644 index 00000000000..9093f04bc82 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2bessel__second__kind_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/agrad/rev/functions/bessel_second_kind.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
bessel_second_kind.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + +

+Functions

var stan::agrad::bessel_second_kind (const int &v, const var &a)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2bessel__second__kind_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2bessel__second__kind_8hpp_source.html new file mode 100644 index 00000000000..e590553c0dc --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2bessel__second__kind_8hpp_source.html @@ -0,0 +1,141 @@ + + + + + +Stan: src/stan/agrad/rev/functions/bessel_second_kind.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
bessel_second_kind.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__BESSEL_SECOND_KIND_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__BESSEL_SECOND_KIND_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ + + + + +
10 
+
11 namespace stan {
+
12  namespace agrad {
+
13 
+
14  namespace {
+
15 
+
16  class bessel_second_kind_dv_vari : public op_dv_vari {
+
17  public:
+
18  bessel_second_kind_dv_vari(int a, vari* bvi) :
+
19  op_dv_vari(stan::math::bessel_second_kind(a, bvi->val_), a, bvi) {
+
20  }
+
21  void chain() {
+
22  bvi_->adj_ += adj_ * (ad_ * stan::math::bessel_second_kind(ad_, bvi_->val_) / bvi_->val_ - stan::math::bessel_second_kind(ad_ + 1, bvi_->val_));
+
23  }
+
24  };
+
25  }
+
26 
+
27  inline var bessel_second_kind(const int& v,
+
28  const var& a) {
+
29  return var(new bessel_second_kind_dv_vari(v, a.vi_));
+
30  }
+
31 
+
32  }
+
33 }
+
34 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2binary__log__loss_8hpp.html b/doc/api/html/agrad_2rev_2functions_2binary__log__loss_8hpp.html new file mode 100644 index 00000000000..1c953d98f73 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2binary__log__loss_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/agrad/rev/functions/binary_log_loss.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
binary_log_loss.hpp File Reference
+
+
+
#include <valarray>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+#include <stan/math/constants.hpp>
+#include <stan/math/functions/log1p.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::binary_log_loss (const int y, const stan::agrad::var &y_hat)
 The log loss function for variables (stan).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2binary__log__loss_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2binary__log__loss_8hpp_source.html new file mode 100644 index 00000000000..dc663596f51 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2binary__log__loss_8hpp_source.html @@ -0,0 +1,151 @@ + + + + + +Stan: src/stan/agrad/rev/functions/binary_log_loss.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
binary_log_loss.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__BINARY_LOG_LOSS_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__BINARY_LOG_LOSS_HPP__
+
3 
+
4 #include <valarray>
+
5 #include <stan/agrad/rev/var.hpp>
+ + + +
9 
+
10 namespace stan {
+
11  namespace agrad {
+
12 
+
13  namespace {
+
14  class binary_log_loss_1_vari : public op_v_vari {
+
15  public:
+
16  binary_log_loss_1_vari(vari* avi) :
+
17  op_v_vari(-std::log(avi->val_),avi) {
+
18  }
+
19  void chain() {
+
20  avi_->adj_ -= adj_ / avi_->val_;
+
21  }
+
22  };
+
23 
+
24  class binary_log_loss_0_vari : public op_v_vari {
+
25  public:
+
26  binary_log_loss_0_vari(vari* avi) :
+
27  op_v_vari(-stan::math::log1p(-avi->val_),avi) {
+
28  }
+
29  void chain() {
+
30  avi_->adj_ += adj_ / (1.0 - avi_->val_);
+
31  }
+
32  };
+
33  }
+
34 
+
50  inline var binary_log_loss(const int y, const stan::agrad::var& y_hat) {
+
51  if (y == 0)
+
52  return var(new binary_log_loss_0_vari(y_hat.vi_));
+
53  else
+
54  return var(new binary_log_loss_1_vari(y_hat.vi_));
+
55  }
+
56 
+
57  }
+
58 }
+
59 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2digamma_8hpp.html b/doc/api/html/agrad_2rev_2functions_2digamma_8hpp.html new file mode 100644 index 00000000000..8c547d608dc --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2digamma_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/rev/functions/digamma.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
digamma.hpp File Reference
+
+
+
#include <boost/math/special_functions/digamma.hpp>
+#include <boost/math/special_functions/zeta.hpp>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+#include <stan/math/functions/trigamma.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + +

+Functions

var stan::agrad::digamma (const stan::agrad::var &a)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2digamma_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2digamma_8hpp_source.html new file mode 100644 index 00000000000..de6fb1698a7 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2digamma_8hpp_source.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/agrad/rev/functions/digamma.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
digamma.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__DIGAMMA_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__DIGAMMA_HPP__
+
3 
+
4 #include <boost/math/special_functions/digamma.hpp>
+
5 #include <boost/math/special_functions/zeta.hpp>
+
6 #include <stan/agrad/rev/var.hpp>
+ + +
9 
+
10 namespace stan {
+
11  namespace agrad {
+
12 
+
13  namespace {
+
14  class digamma_vari : public op_v_vari {
+
15  public:
+
16  digamma_vari(vari* avi) :
+
17  op_v_vari(boost::math::digamma(avi->val_), avi) {
+
18  }
+
19  void chain() {
+
20  avi_->adj_ += adj_ * stan::math::trigamma(avi_->val_);
+
21  }
+
22  };
+
23  }
+
24 
+
25  inline var digamma(const stan::agrad::var& a) {
+
26  return var(new digamma_vari(a.vi_));
+
27  }
+
28 
+
29  }
+
30 }
+
31 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2exp2_8hpp.html b/doc/api/html/agrad_2rev_2functions_2exp2_8hpp.html new file mode 100644 index 00000000000..112bd56c9a3 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2exp2_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/rev/functions/exp2.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
exp2.hpp File Reference
+
+
+
#include <valarray>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+#include <stan/math/constants.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::exp2 (const stan::agrad::var &a)
 Exponentiation base 2 function for variables (C99).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2exp2_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2exp2_8hpp_source.html new file mode 100644 index 00000000000..ac4a306a17c --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2exp2_8hpp_source.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/agrad/rev/functions/exp2.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
exp2.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__EXP2_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__EXP2_HPP__
+
3 
+
4 #include <valarray>
+
5 #include <stan/agrad/rev/var.hpp>
+ + +
8 
+
9 namespace stan {
+
10  namespace agrad {
+
11 
+
12  namespace {
+
13  class exp2_vari : public op_v_vari {
+
14  public:
+
15  exp2_vari(vari* avi) :
+
16  op_v_vari(std::pow(2.0,avi->val_),avi) {
+
17  }
+
18  void chain() {
+
19  avi_->adj_ += adj_ * val_ * stan::math::LOG_2;
+
20  }
+
21  };
+
22  }
+
23 
+
36  inline var exp2(const stan::agrad::var& a) {
+
37  return var(new exp2_vari(a.vi_));
+
38  }
+
39 
+
40  }
+
41 }
+
42 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2exp_8hpp.html b/doc/api/html/agrad_2rev_2functions_2exp_8hpp.html new file mode 100644 index 00000000000..f8b8794b0e4 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2exp_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/functions/exp.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
exp.hpp File Reference
+
+
+
#include <cmath>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::exp (const var &a)
 Return the exponentiation of the specified variable (cmath).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2exp_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2exp_8hpp_source.html new file mode 100644 index 00000000000..f8c76d622ca --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2exp_8hpp_source.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/agrad/rev/functions/exp.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
exp.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__EXP_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__EXP_HPP__
+
3 
+
4 #include <cmath>
+
5 #include <stan/agrad/rev/var.hpp>
+ +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  namespace {
+
12  class exp_vari : public op_v_vari {
+
13  public:
+
14  exp_vari(vari* avi) :
+
15  op_v_vari(std::exp(avi->val_),avi) {
+
16  }
+
17  void chain() {
+
18  avi_->adj_ += adj_ * val_;
+
19  }
+
20  };
+
21  }
+
22 
+
29  inline var exp(const var& a) {
+
30  return var(new exp_vari(a.vi_));
+
31  }
+
32 
+
33  }
+
34 }
+
35 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2falling__factorial_8hpp.html b/doc/api/html/agrad_2rev_2functions_2falling__factorial_8hpp.html new file mode 100644 index 00000000000..84f94d7fa29 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2falling__factorial_8hpp.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/agrad/rev/functions/falling_factorial.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
falling_factorial.hpp File Reference
+
+
+
#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/vd_vari.hpp>
+#include <stan/agrad/rev/internal/dv_vari.hpp>
+#include <stan/agrad/rev/internal/vv_vari.hpp>
+#include <stan/math/functions/falling_factorial.hpp>
+#include <boost/math/special_functions/digamma.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + +

+Functions

var stan::agrad::falling_factorial (const var &a, const double &b)
 
var stan::agrad::falling_factorial (const var &a, const var &b)
 
var stan::agrad::falling_factorial (const double &a, const var &b)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2falling__factorial_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2falling__factorial_8hpp_source.html new file mode 100644 index 00000000000..3528e66f11d --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2falling__factorial_8hpp_source.html @@ -0,0 +1,171 @@ + + + + + +Stan: src/stan/agrad/rev/functions/falling_factorial.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
falling_factorial.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__FALLING_FACTORIAL_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__FALLING_FACTORIAL_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ + + + +
9 #include <boost/math/special_functions/digamma.hpp>
+
10 
+
11 namespace stan {
+
12  namespace agrad {
+
13 
+
14  namespace {
+
15 
+
16  class falling_factorial_vv_vari : public op_vv_vari {
+
17  public:
+
18  falling_factorial_vv_vari(vari* avi, vari* bvi) :
+
19  op_vv_vari(stan::math::falling_factorial(avi->val_, bvi->val_), avi, bvi) {
+
20  }
+
21  void chain() {
+
22  avi_->adj_ += adj_ * stan::math::falling_factorial(avi_->val_, bvi_->val_) * boost::math::digamma(avi_->val_ + 1);
+
23  bvi_->adj_ -= adj_ * stan::math::falling_factorial(avi_->val_, bvi_->val_) * boost::math::digamma(bvi_->val_ + 1);
+
24  }
+
25  };
+
26 
+
27  class falling_factorial_vd_vari : public op_vd_vari {
+
28  public:
+
29  falling_factorial_vd_vari(vari* avi, double b) :
+
30  op_vd_vari(stan::math::falling_factorial(avi->val_, b), avi, b) {
+
31  }
+
32  void chain() {
+
33  avi_->adj_ += adj_ * stan::math::falling_factorial(avi_->val_, bd_) * boost::math::digamma(avi_->val_ + 1);
+
34  }
+
35  };
+
36 
+
37  class falling_factorial_dv_vari : public op_dv_vari {
+
38  public:
+
39  falling_factorial_dv_vari(double a, vari* bvi) :
+
40  op_dv_vari(stan::math::falling_factorial(a, bvi->val_), a, bvi) {
+
41  }
+
42  void chain() {
+
43  bvi_->adj_ += adj_ * -stan::math::falling_factorial(ad_, bvi_->val_) * boost::math::digamma(bvi_->val_ + 1);
+
44  }
+
45  };
+
46  }
+
47 
+
48  inline var falling_factorial(const var& a,
+
49  const double& b) {
+
50  return var(new falling_factorial_vd_vari(a.vi_, b));
+
51  }
+
52 
+
53  inline var falling_factorial(const var& a,
+
54  const var& b) {
+
55  return var(new falling_factorial_vv_vari(a.vi_, b.vi_));
+
56  }
+
57 
+
58  inline var falling_factorial(const double& a,
+
59  const var& b) {
+
60  return var(new falling_factorial_dv_vari(a, b.vi_));
+
61  }
+
62  }
+
63 }
+
64 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2fdim_8hpp.html b/doc/api/html/agrad_2rev_2functions_2fdim_8hpp.html new file mode 100644 index 00000000000..3c571fbb0b1 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2fdim_8hpp.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/agrad/rev/functions/fdim.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
fdim.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

var stan::agrad::fdim (const stan::agrad::var &a, const stan::agrad::var &b)
 Return the positive difference between the first variable's the value and the second's (C99).
 
var stan::agrad::fdim (const double &a, const stan::agrad::var &b)
 Return the positive difference between the first value and the value of the second variable (C99).
 
var stan::agrad::fdim (const stan::agrad::var &a, const double &b)
 Return the positive difference between the first variable's value and the second value (C99).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2fdim_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2fdim_8hpp_source.html new file mode 100644 index 00000000000..b25a9965ed1 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2fdim_8hpp_source.html @@ -0,0 +1,176 @@ + + + + + +Stan: src/stan/agrad/rev/functions/fdim.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
fdim.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__FDIM_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__FDIM_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ + +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  namespace {
+
12  class fdim_vv_vari : public op_vv_vari {
+
13  public:
+
14  fdim_vv_vari(vari* avi, vari* bvi) :
+
15  op_vv_vari(avi->val_ - bvi->val_, avi, bvi) {
+
16  }
+
17  void chain() {
+
18  avi_->adj_ += adj_;
+
19  bvi_->adj_ -= adj_;
+
20  }
+
21  };
+
22 
+
23  class fdim_vd_vari : public op_v_vari {
+
24  public:
+
25  fdim_vd_vari(vari* avi, double b) :
+
26  op_v_vari(avi->val_ - b, avi) {
+
27  }
+
28  void chain() {
+
29  avi_->adj_ += adj_;
+
30  }
+
31  };
+
32 
+
33  class fdim_dv_vari : public op_v_vari {
+
34  public:
+
35  fdim_dv_vari(double a, vari* bvi) :
+
36  op_v_vari(a - bvi->val_, bvi) {
+
37  }
+
38  void chain() {
+
39  // avi_ is bvi argument to constructor
+
40  avi_->adj_ -= adj_;
+
41  }
+
42  };
+
43  }
+
44 
+
68  inline var fdim(const stan::agrad::var& a,
+
69  const stan::agrad::var& b) {
+
70  if (a.vi_->val_ > b.vi_->val_)
+
71  return var(new fdim_vv_vari(a.vi_,b.vi_));
+
72  else
+
73  return var(new vari(0.0));
+
74  }
+
75 
+
93  inline var fdim(const double& a,
+
94  const stan::agrad::var& b) {
+
95  return a > b.vi_->val_
+
96  ? var(new fdim_dv_vari(a,b.vi_))
+
97  : var(new vari(0.0));
+
98  }
+
99 
+
116  inline var fdim(const stan::agrad::var& a,
+
117  const double& b) {
+
118  return a.vi_->val_ > b
+
119  ? var(new fdim_vd_vari(a.vi_,b))
+
120  : var(new vari(0.0));
+
121  }
+
122 
+
123  }
+
124 }
+
125 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2fma_8hpp.html b/doc/api/html/agrad_2rev_2functions_2fma_8hpp.html new file mode 100644 index 00000000000..87357565148 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2fma_8hpp.html @@ -0,0 +1,154 @@ + + + + + +Stan: src/stan/agrad/rev/functions/fma.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
fma.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + + + + + + + + + + + + + +

+Functions

var stan::agrad::fma (const stan::agrad::var &a, const stan::agrad::var &b, const stan::agrad::var &c)
 The fused multiply-add function for three variables (C99).
 
var stan::agrad::fma (const stan::agrad::var &a, const stan::agrad::var &b, const double &c)
 The fused multiply-add function for two variables and a value (C99).
 
var stan::agrad::fma (const stan::agrad::var &a, const double &b, const stan::agrad::var &c)
 The fused multiply-add function for a variable, value, and variable (C99).
 
var stan::agrad::fma (const stan::agrad::var &a, const double &b, const double &c)
 The fused multiply-add function for a variable and two values (C99).
 
var stan::agrad::fma (const double &a, const stan::agrad::var &b, const double &c)
 The fused multiply-add function for a value, variable, and value (C99).
 
var stan::agrad::fma (const double &a, const double &b, const stan::agrad::var &c)
 The fused multiply-add function for two values and a variable, and value (C99).
 
var stan::agrad::fma (const double &a, const stan::agrad::var &b, const stan::agrad::var &c)
 The fused multiply-add function for a value and two variables (C99).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2fma_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2fma_8hpp_source.html new file mode 100644 index 00000000000..5002bba1018 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2fma_8hpp_source.html @@ -0,0 +1,229 @@ + + + + + +Stan: src/stan/agrad/rev/functions/fma.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
fma.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__FMA_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__FMA_HPP__
+
3 
+
4 #include <valarray>
+
5 #include <stan/agrad/rev/var.hpp>
+ + + + + +
11 #include <stan/math/constants.hpp>
+
12 
+
13 namespace stan {
+
14  namespace agrad {
+
15 
+
16  namespace {
+
17  class fma_vvv_vari : public op_vvv_vari {
+
18  public:
+
19  fma_vvv_vari(vari* avi, vari* bvi, vari* cvi) :
+
20  op_vvv_vari(avi->val_ * bvi->val_ + cvi->val_,
+
21  avi,bvi,cvi) {
+
22  }
+
23  void chain() {
+
24  avi_->adj_ += adj_ * bvi_->val_;
+
25  bvi_->adj_ += adj_ * avi_->val_;
+
26  cvi_->adj_ += adj_;
+
27  }
+
28  };
+
29 
+
30  class fma_vvd_vari : public op_vv_vari {
+
31  public:
+
32  fma_vvd_vari(vari* avi, vari* bvi, double c) :
+
33  op_vv_vari(avi->val_ * bvi->val_ + c,
+
34  avi,bvi) {
+
35  }
+
36  void chain() {
+
37  avi_->adj_ += adj_ * bvi_->val_;
+
38  bvi_->adj_ += adj_ * avi_->val_;
+
39  }
+
40  };
+
41 
+
42  class fma_vdv_vari : public op_vdv_vari {
+
43  public:
+
44  fma_vdv_vari(vari* avi, double b, vari* cvi) :
+
45  op_vdv_vari(avi->val_ * b + cvi->val_,
+
46  avi,b,cvi) {
+
47  }
+
48  void chain() {
+
49  avi_->adj_ += adj_ * bd_;
+
50  cvi_->adj_ += adj_;
+
51  }
+
52  };
+
53 
+
54  class fma_vdd_vari : public op_vd_vari {
+
55  public:
+
56  fma_vdd_vari(vari* avi, double b, double c) :
+
57  op_vd_vari(avi->val_ * b + c,
+
58  avi,b) {
+
59  }
+
60  void chain() {
+
61  avi_->adj_ += adj_ * bd_;
+
62  }
+
63  };
+
64 
+
65  class fma_ddv_vari : public op_v_vari {
+
66  public:
+
67  fma_ddv_vari(double a, double b, vari* cvi) :
+
68  op_v_vari(a * b + cvi->val_,
+
69  cvi) {
+
70  }
+
71  void chain() {
+
72  // avi_ is cvi from constructor
+
73  avi_->adj_ += adj_;
+
74  }
+
75  };
+
76  }
+
77 
+
98  inline var fma(const stan::agrad::var& a,
+
99  const stan::agrad::var& b,
+
100  const stan::agrad::var& c) {
+
101  return var(new fma_vvv_vari(a.vi_,b.vi_,c.vi_));
+
102  }
+
103 
+
122  inline var fma(const stan::agrad::var& a,
+
123  const stan::agrad::var& b,
+
124  const double& c) {
+
125  return var(new fma_vvd_vari(a.vi_,b.vi_,c));
+
126  }
+
127 
+
146  inline var fma(const stan::agrad::var& a,
+
147  const double& b,
+
148  const stan::agrad::var& c) {
+
149  return var(new fma_vdv_vari(a.vi_,b,c.vi_));
+
150  }
+
151 
+
168  inline var fma(const stan::agrad::var& a,
+
169  const double& b,
+
170  const double& c) {
+
171  return var(new fma_vdd_vari(a.vi_,b,c));
+
172  }
+
173 
+
190  inline var fma(const double& a,
+
191  const stan::agrad::var& b,
+
192  const double& c) {
+
193  return var(new fma_vdd_vari(b.vi_,a,c));
+
194  }
+
195 
+
212  inline var fma(const double& a,
+
213  const double& b,
+
214  const stan::agrad::var& c) {
+
215  return var(new fma_ddv_vari(a,b,c.vi_));
+
216  }
+
217 
+
236  inline var fma(const double& a,
+
237  const stan::agrad::var& b,
+
238  const stan::agrad::var& c) {
+
239  return var(new fma_vdv_vari(b.vi_,a,c.vi_)); // a-b symmetry
+
240  }
+
241 
+
242  }
+
243 }
+
244 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2gamma__p_8hpp.html b/doc/api/html/agrad_2rev_2functions_2gamma__p_8hpp.html new file mode 100644 index 00000000000..ebdd9ef5bd1 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2gamma__p_8hpp.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/agrad/rev/functions/gamma_p.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
gamma_p.hpp File Reference
+
+
+
#include <valarray>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/vv_vari.hpp>
+#include <stan/agrad/rev/internal/dv_vari.hpp>
+#include <stan/agrad/rev/internal/vd_vari.hpp>
+#include <stan/math/functions/gamma_p.hpp>
+#include <boost/math/special_functions/gamma.hpp>
+#include <boost/math/special_functions/digamma.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + +

+Functions

var stan::agrad::gamma_p (const stan::agrad::var &a, const stan::agrad::var &b)
 
var stan::agrad::gamma_p (const stan::agrad::var &a, const double &b)
 
var stan::agrad::gamma_p (const double &a, const stan::agrad::var &b)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2gamma__p_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2gamma__p_8hpp_source.html new file mode 100644 index 00000000000..c987ae2e70d --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2gamma__p_8hpp_source.html @@ -0,0 +1,215 @@ + + + + + +Stan: src/stan/agrad/rev/functions/gamma_p.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
gamma_p.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__GAMMA_P_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__GAMMA_P_HPP__
+
3 
+
4 #include <valarray>
+
5 #include <stan/agrad/rev/var.hpp>
+ + + + +
10 #include <boost/math/special_functions/gamma.hpp>
+
11 #include <boost/math/special_functions/digamma.hpp>
+
12 
+
13 namespace stan {
+
14  namespace agrad {
+
15 
+
16  namespace {
+
17  class gamma_p_vv_vari : public op_vv_vari {
+
18  public:
+
19  gamma_p_vv_vari(vari* avi, vari* bvi) :
+
20  op_vv_vari(stan::math::gamma_p(avi->val_,bvi->val_),
+
21  avi,bvi) {
+
22  }
+
23  void chain() {
+
24 
+
25  double u = stan::math::gamma_p(avi_->val_, bvi_->val_);
+
26 
+
27  double S = 0.0;
+
28  double s = 1.0;
+
29  double l = std::log(bvi_->val_);
+
30  double g = boost::math::tgamma(avi_->val_);
+
31  double dig = boost::math::digamma(avi_->val_);
+
32 
+
33  int k = 0;
+
34  double delta = s / (avi_->val_ * avi_->val_);
+
35 
+
36  while (std::fabs(delta) > 1e-6) {
+
37  S += delta;
+
38  ++k;
+
39  s *= -bvi_->val_ / k;
+
40  delta = s / ((k + avi_->val_) * (k + avi_->val_));
+
41  }
+
42 
+
43 
+
44  avi_->adj_ -= adj_ * ((u) * ( dig - l ) + std::exp( avi_->val_ * l ) * S / g);
+
45  bvi_->adj_ += adj_ * (std::exp(-bvi_->val_) * std::pow(bvi_->val_, avi_->val_ - 1.0) / g);
+
46  }
+
47  };
+
48 
+
49  class gamma_p_vd_vari : public op_vd_vari {
+
50  public:
+
51  gamma_p_vd_vari(vari* avi, double b) :
+
52  op_vd_vari(stan::math::gamma_p(avi->val_,b),
+
53  avi,b) {
+
54  }
+
55  void chain() {
+
56 
+
57  double u = stan::math::gamma_p(avi_->val_, bd_);
+
58 
+
59  double S = 0.0;
+
60  double s = 1.0;
+
61  double l = std::log(bd_);
+
62  double g = boost::math::tgamma(avi_->val_);
+
63  double dig = boost::math::digamma(avi_->val_);
+
64 
+
65  int k = 0;
+
66  double delta = s / (avi_->val_ * avi_->val_);
+
67 
+
68  while (std::fabs(delta) > 1e-6) {
+
69  S += delta;
+
70  ++k;
+
71  s *= -bd_ / k;
+
72  delta = s / ((k + avi_->val_) * (k + avi_->val_));
+
73  }
+
74 
+
75  avi_->adj_ -= adj_ * ((u) * ( dig - l ) + std::exp( avi_->val_ * l ) * S / g);
+
76  }
+
77  };
+
78 
+
79  class gamma_p_dv_vari : public op_dv_vari {
+
80  public:
+
81  gamma_p_dv_vari(double a, vari* bvi) :
+
82  op_dv_vari(stan::math::gamma_p(a,bvi->val_),
+
83  a,bvi) {
+
84  }
+
85  void chain() {
+
86  bvi_->adj_ += adj_ * (std::exp(-bvi_->val_) * std::pow(bvi_->val_, ad_ - 1.0) / boost::math::tgamma(ad_));
+
87  }
+
88  };
+
89  }
+
90 
+
91  inline var gamma_p(const stan::agrad::var& a,
+
92  const stan::agrad::var& b) {
+
93  return var(new gamma_p_vv_vari(a.vi_,b.vi_));
+
94  }
+
95 
+
96  inline var gamma_p(const stan::agrad::var& a,
+
97  const double& b) {
+
98  return var(new gamma_p_vd_vari(a.vi_,b));
+
99  }
+
100 
+
101  inline var gamma_p(const double& a,
+
102  const stan::agrad::var& b) {
+
103  return var(new gamma_p_dv_vari(a,b.vi_));
+
104  }
+
105 
+
106  }
+
107 }
+
108 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2gamma__q_8hpp.html b/doc/api/html/agrad_2rev_2functions_2gamma__q_8hpp.html new file mode 100644 index 00000000000..7a28ceb784e --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2gamma__q_8hpp.html @@ -0,0 +1,140 @@ + + + + + +Stan: src/stan/agrad/rev/functions/gamma_q.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
gamma_q.hpp File Reference
+
+
+
#include <valarray>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/vv_vari.hpp>
+#include <stan/agrad/rev/internal/dv_vari.hpp>
+#include <stan/agrad/rev/internal/vd_vari.hpp>
+#include <stan/math/functions/gamma_q.hpp>
+#include <stan/prob/internal_math.hpp>
+#include <boost/math/special_functions/gamma.hpp>
+#include <boost/math/special_functions/digamma.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + +

+Functions

var stan::agrad::gamma_q (const stan::agrad::var &a, const stan::agrad::var &b)
 
var stan::agrad::gamma_q (const stan::agrad::var &a, const double &b)
 
var stan::agrad::gamma_q (const double &a, const stan::agrad::var &b)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2gamma__q_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2gamma__q_8hpp_source.html new file mode 100644 index 00000000000..c97cec4e005 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2gamma__q_8hpp_source.html @@ -0,0 +1,185 @@ + + + + + +Stan: src/stan/agrad/rev/functions/gamma_q.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
gamma_q.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__GAMMA_Q_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__GAMMA_Q_HPP__
+
3 
+
4 #include <valarray>
+
5 #include <stan/agrad/rev/var.hpp>
+ + + + + +
11 #include <boost/math/special_functions/gamma.hpp>
+
12 #include <boost/math/special_functions/digamma.hpp>
+
13 
+
14 namespace stan {
+
15  namespace agrad {
+
16 
+
17  namespace {
+
18  class gamma_q_vv_vari : public op_vv_vari {
+
19  public:
+
20  gamma_q_vv_vari(vari* avi, vari* bvi) :
+
21  op_vv_vari(stan::math::gamma_q(avi->val_,bvi->val_),
+
22  avi,bvi) {
+
23  }
+
24  void chain() {
+
25  avi_->adj_ += adj_
+
26  * stan::math::gradRegIncGamma(avi_->val_, bvi_->val_,
+ +
28  boost::math::digamma(avi_->val_));
+
29  bvi_->adj_ -= adj_
+
30  * boost::math::gamma_p_derivative(avi_->val_, bvi_->val_);
+
31  }
+
32  };
+
33 
+
34  class gamma_q_vd_vari : public op_vd_vari {
+
35  public:
+
36  gamma_q_vd_vari(vari* avi, double b) :
+
37  op_vd_vari(stan::math::gamma_q(avi->val_,b),
+
38  avi,b) {
+
39  }
+
40  void chain() {
+
41  avi_->adj_ += adj_
+ + +
44  boost::math::digamma(avi_->val_));
+
45  }
+
46  };
+
47 
+
48  class gamma_q_dv_vari : public op_dv_vari {
+
49  public:
+
50  gamma_q_dv_vari(double a, vari* bvi) :
+
51  op_dv_vari(stan::math::gamma_q(a,bvi->val_),
+
52  a,bvi) {
+
53  }
+
54  void chain() {
+
55  bvi_->adj_ -= adj_
+
56  * boost::math::gamma_p_derivative(ad_, bvi_->val_);
+
57  }
+
58  };
+
59  }
+
60 
+
61  inline var gamma_q(const stan::agrad::var& a,
+
62  const stan::agrad::var& b) {
+
63  return var(new gamma_q_vv_vari(a.vi_,b.vi_));
+
64  }
+
65 
+
66  inline var gamma_q(const stan::agrad::var& a,
+
67  const double& b) {
+
68  return var(new gamma_q_vd_vari(a.vi_,b));
+
69  }
+
70 
+
71  inline var gamma_q(const double& a,
+
72  const stan::agrad::var& b) {
+
73  return var(new gamma_q_dv_vari(a,b.vi_));
+
74  }
+
75 
+
76  }
+
77 }
+
78 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2ibeta_8hpp.html b/doc/api/html/agrad_2rev_2functions_2ibeta_8hpp.html new file mode 100644 index 00000000000..cdae060a148 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2ibeta_8hpp.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/agrad/rev/functions/ibeta.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
ibeta.hpp File Reference
+
+
+
#include <boost/math/special_functions/digamma.hpp>
+#include <boost/math/special_functions/gamma.hpp>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/vvv_vari.hpp>
+#include <stan/agrad/rev/internal/vvd_vari.hpp>
+#include <stan/agrad/rev/internal/vdv_vari.hpp>
+#include <stan/agrad/rev/internal/vdd_vari.hpp>
+#include <stan/agrad/rev/internal/dvv_vari.hpp>
+#include <stan/agrad/rev/internal/dvd_vari.hpp>
+#include <stan/agrad/rev/internal/ddv_vari.hpp>
+#include <stan/math/functions/ibeta.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::ibeta (const var &a, const var &b, const var &x)
 The normalized incomplete beta function of a, b, and x.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2ibeta_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2ibeta_8hpp_source.html new file mode 100644 index 00000000000..634d3d13b95 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2ibeta_8hpp_source.html @@ -0,0 +1,315 @@ + + + + + +Stan: src/stan/agrad/rev/functions/ibeta.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
ibeta.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__IBETA_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__IBETA_HPP__
+
3 
+
4 #include <boost/math/special_functions/digamma.hpp>
+
5 #include <boost/math/special_functions/gamma.hpp>
+
6 #include <stan/agrad/rev/var.hpp>
+ + + + + + + + +
15 
+
16 namespace stan {
+
17  namespace agrad {
+
18 
+
19  namespace {
+
25  double ibeta_hypergeometric_helper(double a, double b, double z, double precision=1e-8, double max_steps=1000) {
+
26  double val=0;
+
27  double diff=1;
+
28  double k=0;
+
29  double a_2 = a*a;
+
30  double bprod = 1;
+
31  while (std::abs(diff) > precision && (++k < max_steps) && !std::isnan(diff)) {
+
32  val += diff;
+
33  bprod *= b+k-1.0;
+
34  diff = a_2*std::pow(a+k,-2)*bprod*std::pow(z,k)/boost::math::tgamma(k+1);
+
35  }
+
36  return val;
+
37  }
+
38 
+
39  class ibeta_vvv_vari : public op_vvv_vari {
+
40  public:
+
41  ibeta_vvv_vari(vari* avi, vari* bvi, vari* xvi) :
+
42  op_vvv_vari(stan::math::ibeta(avi->val_,bvi->val_,xvi->val_),avi,bvi,xvi) {
+
43  }
+
44  void chain() {
+
45  double a = avi_->val_;
+
46  double b = bvi_->val_;
+
47  double c = cvi_->val_;
+
48 
+
49  using std::sin;
+
50  using std::pow;
+
51  using std::log;
+ +
53  using boost::math::tgamma;
+ +
55  using boost::math::ibeta;
+
56  using stan::agrad::ibeta_hypergeometric_helper;
+
57  avi_->adj_ += adj_ *
+
58  (log(c) - digamma(a) + digamma(a+b)) * val_ -
+
59  tgamma(a)*tgamma(a+b)/tgamma(b) * pow(c,a) / tgamma(1+a) / tgamma(1+a) * ibeta_hypergeometric_helper(a, 1-b, c);
+
60  bvi_->adj_ += adj_ *
+
61  (tgamma(b)*tgamma(a+b)/tgamma(a)*pow(1-c,b) * ibeta_hypergeometric_helper(b,1-a,1-c)/tgamma(b+1)/tgamma(b+1)
+
62  + ibeta(b, a, 1-c) * (digamma(b) - digamma(a+b) - log(1-c)));
+
63  cvi_->adj_ += adj_ *
+
64  boost::math::ibeta_derivative(a,b,c);
+
65  }
+
66  };
+
67  class ibeta_vvd_vari : public op_vvd_vari {
+
68  public:
+
69  ibeta_vvd_vari(vari* avi, vari* bvi, double x) :
+
70  op_vvd_vari(stan::math::ibeta(avi->val_,bvi->val_,x),avi,bvi,x) {
+
71  }
+
72  void chain() {
+
73  double a = avi_->val_;
+
74  double b = bvi_->val_;
+
75  double c = cd_;
+
76 
+
77  using std::sin;
+
78  using std::pow;
+
79  using std::log;
+ +
81  using boost::math::tgamma;
+ +
83  using boost::math::ibeta;
+
84  using stan::agrad::ibeta_hypergeometric_helper;
+
85  avi_->adj_ += adj_ *
+
86  (log(c) - digamma(a) + digamma(a+b)) * val_ -
+
87  tgamma(a)*tgamma(a+b)/tgamma(b) * pow(c,a) / tgamma(1+a) / tgamma(1+a) * ibeta_hypergeometric_helper(a, 1-b, c);
+
88  bvi_->adj_ += adj_ *
+
89  (tgamma(b)*tgamma(a+b)/tgamma(a)*pow(1-c,b) * ibeta_hypergeometric_helper(b,1-a,1-c)/tgamma(b+1)/tgamma(b+1)
+
90  + ibeta(b, a, 1-c) * (digamma(b) - digamma(a+b) - log(1-c)));
+
91  }
+
92  };
+
93  class ibeta_vdv_vari : public op_vdv_vari {
+
94  public:
+
95  ibeta_vdv_vari(vari* avi, double b, vari* xvi) :
+
96  op_vdv_vari(stan::math::ibeta(avi->val_,b,xvi->val_),avi,b,xvi) {
+
97  }
+
98  void chain() {
+
99  double a = avi_->val_;
+
100  double b = bd_;
+
101  double c = cvi_->val_;
+
102 
+
103  using std::sin;
+
104  using std::pow;
+
105  using std::log;
+ +
107  using boost::math::tgamma;
+
108  using boost::math::digamma;
+
109  using boost::math::ibeta;
+
110  using stan::agrad::ibeta_hypergeometric_helper;
+
111  avi_->adj_ += adj_ *
+
112  (log(c) - digamma(a) + digamma(a+b)) * val_ -
+
113  tgamma(a)*tgamma(a+b)/tgamma(b) * pow(c,a) / tgamma(1+a) / tgamma(1+a) * ibeta_hypergeometric_helper(a, 1-b, c);
+
114  cvi_->adj_ += adj_ *
+
115  boost::math::ibeta_derivative(a,b,c);
+
116  }
+
117  };
+
118  class ibeta_vdd_vari : public op_vdd_vari {
+
119  public:
+
120  ibeta_vdd_vari(vari* avi, double b, double x) :
+
121  op_vdd_vari(stan::math::ibeta(avi->val_,b,x),avi,b,x) {
+
122  }
+
123  void chain() {
+
124  double a = avi_->val_;
+
125  double b = bd_;
+
126  double c = cd_;
+
127 
+
128  using std::sin;
+
129  using std::pow;
+
130  using std::log;
+ +
132  using boost::math::tgamma;
+
133  using boost::math::digamma;
+
134  using boost::math::ibeta;
+
135  using stan::agrad::ibeta_hypergeometric_helper;
+
136  avi_->adj_ += adj_ *
+
137  (log(c) - digamma(a) + digamma(a+b)) * val_ -
+
138  tgamma(a)*tgamma(a+b)/tgamma(b) * pow(c,a) / tgamma(1+a) / tgamma(1+a) * ibeta_hypergeometric_helper(a, 1-b, c);
+
139  }
+
140  };
+
141  class ibeta_dvv_vari : public op_dvv_vari {
+
142  public:
+
143  ibeta_dvv_vari(double a, vari* bvi, vari* xvi) :
+
144  op_dvv_vari(stan::math::ibeta(a,bvi->val_,xvi->val_),a,bvi,xvi) {
+
145  }
+
146  void chain() {
+
147  double a = ad_;
+
148  double b = bvi_->val_;
+
149  double c = cvi_->val_;
+
150 
+
151  using std::sin;
+
152  using std::pow;
+
153  using std::log;
+ +
155  using boost::math::tgamma;
+
156  using boost::math::digamma;
+
157  using boost::math::ibeta;
+
158  using stan::agrad::ibeta_hypergeometric_helper;
+
159  bvi_->adj_ += adj_ *
+
160  (tgamma(b)*tgamma(a+b)/tgamma(a)*pow(1-c,b) * ibeta_hypergeometric_helper(b,1-a,1-c)/tgamma(b+1)/tgamma(b+1)
+
161  + ibeta(b, a, 1-c) * (digamma(b) - digamma(a+b) - log(1-c)));
+
162  cvi_->adj_ += adj_ *
+
163  boost::math::ibeta_derivative(a,b,c);
+
164  }
+
165  };
+
166  class ibeta_dvd_vari : public op_dvd_vari {
+
167  public:
+
168  ibeta_dvd_vari(double a, vari* bvi, double x) :
+
169  op_dvd_vari(stan::math::ibeta(a,bvi->val_,x),a,bvi,x) {
+
170  }
+
171  void chain() {
+
172  double a = ad_;
+
173  double b = bvi_->val_;
+
174  double c = cd_;
+
175 
+
176  using std::sin;
+
177  using std::pow;
+
178  using std::log;
+ +
180  using boost::math::tgamma;
+
181  using boost::math::digamma;
+
182  using boost::math::ibeta;
+
183  using stan::agrad::ibeta_hypergeometric_helper;
+
184  bvi_->adj_ += adj_ *
+
185  (tgamma(b)*tgamma(a+b)/tgamma(a)*pow(1-c,b) * ibeta_hypergeometric_helper(b,1-a,1-c)/tgamma(b+1)/tgamma(b+1)
+
186  + ibeta(b, a, 1-c) * (digamma(b) - digamma(a+b) - log(1-c)));
+
187  }
+
188  };
+
189  class ibeta_ddv_vari : public op_ddv_vari {
+
190  public:
+
191  ibeta_ddv_vari(double a, double b, vari* xvi) :
+
192  op_ddv_vari(stan::math::ibeta(a,b,xvi->val_),a,b,xvi) {
+
193  }
+
194  void chain() {
+
195  double a = ad_;
+
196  double b = bd_;
+
197  double c = cvi_->val_;
+
198 
+
199  cvi_->adj_ += adj_ *
+
200  boost::math::ibeta_derivative(a,b,c);
+
201  }
+
202  };
+
203  }
+
204 
+
222  inline var ibeta(const var& a,
+
223  const var& b,
+
224  const var& x) {
+
225  return var(new ibeta_vvv_vari(a.vi_, b.vi_, x.vi_));
+
226  }
+
227 
+
228  }
+
229 }
+
230 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2if__else_8hpp.html b/doc/api/html/agrad_2rev_2functions_2if__else_8hpp.html new file mode 100644 index 00000000000..bfbb8b9fb3c --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2if__else_8hpp.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/agrad/rev/functions/if_else.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
if_else.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

var stan::agrad::if_else (bool c, const var &y_true, const var &y_false)
 If the specified condition is true, return the first variable, otherwise return the second variable.
 
var stan::agrad::if_else (bool c, double y_true, const var &y_false)
 If the specified condition is true, return a new variable constructed from the first scalar, otherwise return the second variable.
 
var stan::agrad::if_else (bool c, const var &y_true, const double y_false)
 If the specified condition is true, return the first variable, otherwise return a new variable constructed from the second scalar.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2if__else_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2if__else_8hpp_source.html new file mode 100644 index 00000000000..bf9d62d44de --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2if__else_8hpp_source.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/agrad/rev/functions/if_else.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
if_else.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__IF_ELSE_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__IF_ELSE_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+
5 
+
6 namespace stan {
+
7  namespace agrad {
+
8 
+
17  inline var if_else(bool c, const var& y_true, const var&y_false) {
+
18  return c ? y_true : y_false;
+
19  }
+
29  inline var if_else(bool c, double y_true, const var& y_false) {
+
30  if (c)
+
31  return var(y_true);
+
32  else
+
33  return y_false;
+
34  }
+
44  inline var if_else(bool c, const var& y_true, const double y_false) {
+
45  if (c)
+
46  return y_true;
+
47  else
+
48  return var(y_false);
+
49  }
+
50 
+
51  }
+
52 }
+
53 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2inv_8hpp.html b/doc/api/html/agrad_2rev_2functions_2inv_8hpp.html new file mode 100644 index 00000000000..a680fe88288 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2inv_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/functions/inv.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
inv.hpp File Reference
+
+
+
#include <valarray>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+#include <stan/math/functions/inv.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + +

+Functions

var stan::agrad::inv (const var &a)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2inv_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2inv_8hpp_source.html new file mode 100644 index 00000000000..042820ca919 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2inv_8hpp_source.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/agrad/rev/functions/inv.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
inv.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__INV_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__INV_HPP__
+
3 
+
4 #include <valarray>
+
5 #include <stan/agrad/rev/var.hpp>
+ + +
8 
+
9 namespace stan {
+
10  namespace agrad {
+
11 
+
12  namespace {
+
13  class inv_vari : public op_v_vari {
+
14  public:
+
15  inv_vari(vari* avi) :
+
16  op_v_vari(stan::math::inv(avi->val_),avi) {
+
17  }
+
18  void chain() {
+
19  avi_->adj_ -= adj_ / (avi_->val_ * avi_->val_);
+
20  }
+
21  };
+
22  }
+
23 
+
24  inline var inv(const var& a) {
+
25  return var(new inv_vari(a.vi_));
+
26  }
+
27 
+
28  }
+
29 }
+
30 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2inv__cloglog_8hpp.html b/doc/api/html/agrad_2rev_2functions_2inv__cloglog_8hpp.html new file mode 100644 index 00000000000..86a7a541387 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2inv__cloglog_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/functions/inv_cloglog.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
inv_cloglog.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::inv_cloglog (const stan::agrad::var &a)
 Return the inverse complementary log-log function applied specified variable (stan).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2inv__cloglog_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2inv__cloglog_8hpp_source.html new file mode 100644 index 00000000000..1534700f736 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2inv__cloglog_8hpp_source.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/agrad/rev/functions/inv_cloglog.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
inv_cloglog.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__INV_CLOGLOG_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__INV_CLOGLOG_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ + +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  namespace {
+
12  class inv_cloglog_vari : public op_v_vari {
+
13  public:
+
14  inv_cloglog_vari(vari* avi) :
+
15  op_v_vari(stan::math::inv_cloglog(avi->val_), avi) {
+
16  }
+
17  void chain() {
+
18  avi_->adj_ += adj_ * std::exp(avi_->val_ - std::exp(avi_->val_));
+
19  }
+
20  };
+
21  }
+
22 
+
37  inline var inv_cloglog(const stan::agrad::var& a) {
+
38  return var(new inv_cloglog_vari(a.vi_));
+
39  }
+
40 
+
41  }
+
42 }
+
43 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2inv__logit_8hpp.html b/doc/api/html/agrad_2rev_2functions_2inv__logit_8hpp.html new file mode 100644 index 00000000000..9cbf03fa849 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2inv__logit_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/functions/inv_logit.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
inv_logit.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::inv_logit (const stan::agrad::var &a)
 The inverse logit function for variables (stan).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2inv__logit_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2inv__logit_8hpp_source.html new file mode 100644 index 00000000000..683bd8c1185 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2inv__logit_8hpp_source.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/agrad/rev/functions/inv_logit.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
inv_logit.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__INV_LOGIT_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__INV_LOGIT_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ + +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  namespace {
+
12  class inv_logit_vari : public op_v_vari {
+
13  public:
+
14  inv_logit_vari(vari* avi) :
+
15  op_v_vari(stan::math::inv_logit(avi->val_),avi) {
+
16  }
+
17  void chain() {
+
18  avi_->adj_ += adj_ * val_ * (1.0 - val_);
+
19  }
+
20  };
+
21  }
+
22 
+
35  inline var inv_logit(const stan::agrad::var& a) {
+
36  return var(new inv_logit_vari(a.vi_));
+
37  }
+
38 
+
39  }
+
40 }
+
41 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2inv__sqrt_8hpp.html b/doc/api/html/agrad_2rev_2functions_2inv__sqrt_8hpp.html new file mode 100644 index 00000000000..35581d4dffa --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2inv__sqrt_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/functions/inv_sqrt.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
inv_sqrt.hpp File Reference
+
+
+
#include <valarray>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+#include <stan/math/functions/inv_sqrt.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + +

+Functions

var stan::agrad::inv_sqrt (const var &a)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2inv__sqrt_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2inv__sqrt_8hpp_source.html new file mode 100644 index 00000000000..d7e6bf9796e --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2inv__sqrt_8hpp_source.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/agrad/rev/functions/inv_sqrt.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
inv_sqrt.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__INV_SQRT_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__INV_SQRT_HPP__
+
3 
+
4 #include <valarray>
+
5 #include <stan/agrad/rev/var.hpp>
+ + +
8 
+
9 namespace stan {
+
10  namespace agrad {
+
11 
+
12  namespace {
+
13  class inv_sqrt_vari : public op_v_vari {
+
14  public:
+
15  inv_sqrt_vari(vari* avi) :
+
16  op_v_vari(stan::math::inv_sqrt(avi->val_),avi) {
+
17  }
+
18  void chain() {
+
19  avi_->adj_ -= 0.5 * adj_ / (avi_->val_ * std::sqrt(avi_->val_));
+
20  }
+
21  };
+
22  }
+
23 
+
24  inline var inv_sqrt(const var& a) {
+
25  return var(new inv_sqrt_vari(a.vi_));
+
26  }
+
27 
+
28  }
+
29 }
+
30 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2inv__square_8hpp.html b/doc/api/html/agrad_2rev_2functions_2inv__square_8hpp.html new file mode 100644 index 00000000000..e3e36a1a0c6 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2inv__square_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/functions/inv_square.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
inv_square.hpp File Reference
+
+
+
#include <valarray>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+#include <stan/math/functions/inv_square.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + +

+Functions

var stan::agrad::inv_square (const var &a)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2inv__square_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2inv__square_8hpp_source.html new file mode 100644 index 00000000000..cf9424c4024 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2inv__square_8hpp_source.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/agrad/rev/functions/inv_square.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
inv_square.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__INV_SQUARE_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__INV_SQUARE_HPP__
+
3 
+
4 #include <valarray>
+
5 #include <stan/agrad/rev/var.hpp>
+ + +
8 
+
9 namespace stan {
+
10  namespace agrad {
+
11 
+
12  namespace {
+
13  class inv_square_vari : public op_v_vari {
+
14  public:
+
15  inv_square_vari(vari* avi) :
+
16  op_v_vari(stan::math::inv_square(avi->val_),avi) {
+
17  }
+
18  void chain() {
+
19  avi_->adj_ -= 2 * adj_ / (avi_->val_ * avi_->val_ * avi_->val_);
+
20  }
+
21  };
+
22  }
+
23 
+
24  inline var inv_square(const var& a) {
+
25  return var(new inv_square_vari(a.vi_));
+
26  }
+
27 
+
28  }
+
29 }
+
30 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2is__uninitialized_8hpp.html b/doc/api/html/agrad_2rev_2functions_2is__uninitialized_8hpp.html new file mode 100644 index 00000000000..bbabc407b76 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2is__uninitialized_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/rev/functions/is_uninitialized.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
is_uninitialized.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

bool stan::agrad::is_uninitialized (var x)
 Returns true if the specified variable is uninitialized.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2is__uninitialized_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2is__uninitialized_8hpp_source.html new file mode 100644 index 00000000000..dd41be8fa1b --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2is__uninitialized_8hpp_source.html @@ -0,0 +1,126 @@ + + + + + +Stan: src/stan/agrad/rev/functions/is_uninitialized.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
is_uninitialized.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__IS_UNINITIALIZED_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__IS_UNINITIALIZED_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ + + +
8 
+
9 namespace stan {
+
10 
+
11  namespace agrad {
+
12 
+
25  inline bool is_uninitialized(var x) {
+
26  return x.is_uninitialized();
+
27  }
+
28 
+
29  }
+
30 }
+
31 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2lgamma_8hpp.html b/doc/api/html/agrad_2rev_2functions_2lgamma_8hpp.html new file mode 100644 index 00000000000..e39049a8ee5 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2lgamma_8hpp.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/agrad/rev/functions/lgamma.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
lgamma.hpp File Reference
+
+
+
#include <valarray>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+#include <stan/math/constants.hpp>
+#include <boost/math/special_functions/digamma.hpp>
+#include <boost/math/special_functions/gamma.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::lgamma (const stan::agrad::var &a)
 The log gamma function for variables (C99).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2lgamma_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2lgamma_8hpp_source.html new file mode 100644 index 00000000000..debb2438b12 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2lgamma_8hpp_source.html @@ -0,0 +1,140 @@ + + + + + +Stan: src/stan/agrad/rev/functions/lgamma.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
lgamma.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__LGAMMA_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__LGAMMA_HPP__
+
3 
+
4 #include <valarray>
+
5 #include <stan/agrad/rev/var.hpp>
+ + +
8 #include <boost/math/special_functions/digamma.hpp>
+
9 #include <boost/math/special_functions/gamma.hpp>
+
10 
+
11 namespace stan {
+
12  namespace agrad {
+
13 
+
14  namespace {
+
15  class lgamma_vari : public op_v_vari {
+
16  public:
+
17  lgamma_vari(double value, vari* avi) :
+
18  op_v_vari(value, avi) {
+
19  }
+
20  void chain() {
+
21  avi_->adj_ += adj_ * boost::math::digamma(avi_->val_);
+
22  }
+
23  };
+
24  }
+
25 
+
36  inline var lgamma(const stan::agrad::var& a) {
+
37  double lgamma_a = boost::math::lgamma(a.val());
+
38  return var(new lgamma_vari(lgamma_a, a.vi_));
+
39  }
+
40 
+
41  }
+
42 }
+
43 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2lmgamma_8hpp.html b/doc/api/html/agrad_2rev_2functions_2lmgamma_8hpp.html new file mode 100644 index 00000000000..2e3600e248d --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2lmgamma_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/agrad/rev/functions/lmgamma.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
lmgamma.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + +

+Functions

var stan::agrad::lmgamma (int a, const stan::agrad::var &b)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2lmgamma_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2lmgamma_8hpp_source.html new file mode 100644 index 00000000000..a6bdfd3e2ef --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2lmgamma_8hpp_source.html @@ -0,0 +1,142 @@ + + + + + +Stan: src/stan/agrad/rev/functions/lmgamma.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
lmgamma.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__LMGAMMA_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__LMGAMMA_HPP__
+
3 
+
4 #include <valarray>
+
5 #include <stan/agrad/rev/var.hpp>
+ + + + +
10 
+
11 namespace stan {
+
12  namespace agrad {
+
13 
+
14  namespace {
+
15  class lmgamma_dv_vari : public op_dv_vari {
+
16  public:
+
17  lmgamma_dv_vari(int a, vari* bvi) :
+
18  op_dv_vari(stan::math::lmgamma(a, bvi->val_),a,bvi) {
+
19  }
+
20  void chain() {
+
21  double deriv = 0;
+
22  for (int i = 1; i < ad_ + 1; i++)
+
23  deriv += stan::math::digamma(bvi_->val_ + (1.0 - i) / 2.0);
+
24  bvi_->adj_ += adj_ * deriv;
+
25  }
+
26  };
+
27  }
+
28 
+
29  inline var lmgamma(int a, const stan::agrad::var& b) {
+
30  return var(new lmgamma_dv_vari(a, b.vi_));
+
31  }
+
32 
+
33  }
+
34 }
+
35 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2log1m_8hpp.html b/doc/api/html/agrad_2rev_2functions_2log1m_8hpp.html new file mode 100644 index 00000000000..912be6cdc76 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2log1m_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/functions/log1m.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log1m.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::log1m (const stan::agrad::var &a)
 The log (1 - x) function for variables.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2log1m_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2log1m_8hpp_source.html new file mode 100644 index 00000000000..f0c61277c54 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2log1m_8hpp_source.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/agrad/rev/functions/log1m.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log1m.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__LOG1M_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__LOG1M_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ + +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  namespace {
+
12  class log1m_vari : public op_v_vari {
+
13  public:
+
14  log1m_vari(vari* avi) :
+
15  op_v_vari(stan::math::log1p(-avi->val_),avi) {
+
16  }
+
17  void chain() {
+
18  avi_->adj_ += adj_ / (avi_->val_ - 1);
+
19  }
+
20  };
+
21  }
+
22 
+
33  inline var log1m(const stan::agrad::var& a) {
+
34  return var(new log1m_vari(a.vi_));
+
35  }
+
36 
+
37  }
+
38 }
+
39 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2log1m__exp_8hpp.html b/doc/api/html/agrad_2rev_2functions_2log1m__exp_8hpp.html new file mode 100644 index 00000000000..0c7fd28554e --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2log1m__exp_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/agrad/rev/functions/log1m_exp.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log1m_exp.hpp File Reference
+
+
+
#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+#include <stan/math/functions/log1m_exp.hpp>
+#include <stan/agrad/rev/calculate_chain.hpp>
+#include <boost/math/special_functions/expm1.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::log1m_exp (const stan::agrad::var &a)
 Return the log of 1 minus the exponential of the specified variable.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2log1m__exp_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2log1m__exp_8hpp_source.html new file mode 100644 index 00000000000..a1b9891a281 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2log1m__exp_8hpp_source.html @@ -0,0 +1,140 @@ + + + + + +Stan: src/stan/agrad/rev/functions/log1m_exp.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log1m_exp.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__LOG1M_EXP_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__LOG1M_EXP_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ + + +
8 #include <boost/math/special_functions/expm1.hpp>
+
9 
+
10 namespace stan {
+
11  namespace agrad {
+
12 
+
13  namespace {
+
14  class log1m_exp_v_vari : public op_v_vari {
+
15  public:
+
16  log1m_exp_v_vari(vari* avi) :
+
17  op_v_vari(stan::math::log1m_exp(avi->val_),
+
18  avi) {
+
19  }
+
20  void chain() {
+
21  //derivative of log(1-exp(x)) = -exp(x)/(1-exp(x)) = -1/(exp(-x)-1) = -1/expm1(-x)
+
22  avi_->adj_ -= adj_ / boost::math::expm1(-(avi_->val_));
+
23  }
+
24  };
+
25  }
+
26 
+
31  inline var log1m_exp(const stan::agrad::var& a) {
+
32  return var(new log1m_exp_v_vari(a.vi_));
+
33  }
+
34 
+
35  }
+
36 }
+
37 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2log1p_8hpp.html b/doc/api/html/agrad_2rev_2functions_2log1p_8hpp.html new file mode 100644 index 00000000000..8f348da8d6d --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2log1p_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/agrad/rev/functions/log1p.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log1p.hpp File Reference
+
+
+
#include <valarray>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+#include <stan/math/constants.hpp>
+#include <stan/math/functions/log1p.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::log1p (const stan::agrad::var &a)
 The log (1 + x) function for variables (C99).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2log1p_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2log1p_8hpp_source.html new file mode 100644 index 00000000000..3c9c1979f74 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2log1p_8hpp_source.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/agrad/rev/functions/log1p.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log1p.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__LOG1P_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__LOG1P_HPP__
+
3 
+
4 #include <valarray>
+
5 #include <stan/agrad/rev/var.hpp>
+ + + +
9 
+
10 namespace stan {
+
11  namespace agrad {
+
12 
+
13  namespace {
+
14  class log1p_vari : public op_v_vari {
+
15  public:
+
16  log1p_vari(vari* avi) :
+
17  op_v_vari(stan::math::log1p(avi->val_),avi) {
+
18  }
+
19  void chain() {
+
20  avi_->adj_ += adj_ / (1 + avi_->val_);
+
21  }
+
22  };
+
23  }
+
24 
+
35  inline var log1p(const stan::agrad::var& a) {
+
36  return var(new log1p_vari(a.vi_));
+
37  }
+
38 
+
39  }
+
40 }
+
41 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2log1p__exp_8hpp.html b/doc/api/html/agrad_2rev_2functions_2log1p__exp_8hpp.html new file mode 100644 index 00000000000..3dd6c977e5b --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2log1p__exp_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/rev/functions/log1p_exp.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log1p_exp.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::log1p_exp (const stan::agrad::var &a)
 Return the log of 1 plus the exponential of the specified variable.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2log1p__exp_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2log1p__exp_8hpp_source.html new file mode 100644 index 00000000000..234348e60c3 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2log1p__exp_8hpp_source.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/agrad/rev/functions/log1p_exp.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log1p_exp.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__LOG1P_EXP_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__LOG1P_EXP_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ + + +
8 
+
9 namespace stan {
+
10  namespace agrad {
+
11 
+
12  namespace {
+
13  class log1p_exp_v_vari : public op_v_vari {
+
14  public:
+
15  log1p_exp_v_vari(vari* avi) :
+
16  op_v_vari(stan::math::log1p_exp(avi->val_),
+
17  avi) {
+
18  }
+
19  void chain() {
+
20  avi_->adj_ += adj_ * calculate_chain(avi_->val_, val_);
+
21  }
+
22  };
+
23  }
+
24 
+
29  inline var log1p_exp(const stan::agrad::var& a) {
+
30  return var(new log1p_exp_v_vari(a.vi_));
+
31  }
+
32 
+
33  }
+
34 }
+
35 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2log2_8hpp.html b/doc/api/html/agrad_2rev_2functions_2log2_8hpp.html new file mode 100644 index 00000000000..a8d06072bc0 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2log2_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/rev/functions/log2.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log2.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::log2 (const stan::agrad::var &a)
 Returns the base 2 logarithm of the specified variable (C99).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2log2_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2log2_8hpp_source.html new file mode 100644 index 00000000000..5f7fa4e76f2 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2log2_8hpp_source.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/agrad/rev/functions/log2.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log2.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__LOG2_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__LOG2_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ + + +
8 
+
9 namespace stan {
+
10  namespace agrad {
+
11 
+
12  namespace {
+
13  class log2_vari : public op_v_vari {
+
14  public:
+
15  log2_vari(vari* avi) :
+
16  op_v_vari(stan::math::log2(avi->val_),avi) {
+
17  }
+
18  void chain() {
+
19  avi_->adj_ += adj_ / (stan::math::LOG_2 * avi_->val_);
+
20  }
+
21  };
+
22  }
+
23 
+
36  inline var log2(const stan::agrad::var& a) {
+
37  return var(new log2_vari(a.vi_));
+
38  }
+
39 
+
40  }
+
41 }
+
42 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2log_8hpp.html b/doc/api/html/agrad_2rev_2functions_2log_8hpp.html new file mode 100644 index 00000000000..8bdc6409588 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2log_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/functions/log.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log.hpp File Reference
+
+
+
#include <cmath>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::log (const var &a)
 Return the natural log of the specified variable (cmath).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2log_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2log_8hpp_source.html new file mode 100644 index 00000000000..6a14746052f --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2log_8hpp_source.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/agrad/rev/functions/log.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__LOG_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__LOG_HPP__
+
3 
+
4 #include <cmath>
+
5 #include <stan/agrad/rev/var.hpp>
+ +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  namespace {
+
12  class log_vari : public op_v_vari {
+
13  public:
+
14  log_vari(vari* avi) :
+
15  op_v_vari(std::log(avi->val_),avi) {
+
16  }
+
17  void chain() {
+
18  avi_->adj_ += adj_ / avi_->val_;
+
19  }
+
20  };
+
21  }
+
22 
+
33  inline var log(const var& a) {
+
34  return var(new log_vari(a.vi_));
+
35  }
+
36 
+
37  }
+
38 }
+
39 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2log__diff__exp_8hpp.html b/doc/api/html/agrad_2rev_2functions_2log__diff__exp_8hpp.html new file mode 100644 index 00000000000..a4bcbe15459 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2log__diff__exp_8hpp.html @@ -0,0 +1,144 @@ + + + + + +Stan: src/stan/agrad/rev/functions/log_diff_exp.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log_diff_exp.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

var stan::agrad::log_diff_exp (const stan::agrad::var &a, const stan::agrad::var &b)
 Returns the log sum of exponentials.
 
var stan::agrad::log_diff_exp (const stan::agrad::var &a, const double &b)
 Returns the log sum of exponentials.
 
var stan::agrad::log_diff_exp (const double &a, const stan::agrad::var &b)
 Returns the log sum of exponentials.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2log__diff__exp_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2log__diff__exp_8hpp_source.html new file mode 100644 index 00000000000..957f590f92a --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2log__diff__exp_8hpp_source.html @@ -0,0 +1,174 @@ + + + + + +Stan: src/stan/agrad/rev/functions/log_diff_exp.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log_diff_exp.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__LOG_DIFF_EXP_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__LOG_DIFF_EXP_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ + + + + + + + +
13 #include <boost/math/special_functions/expm1.hpp>
+
14 
+
15 namespace stan {
+
16  namespace agrad {
+
17 
+
18  namespace {
+
19  class log_diff_exp_vv_vari : public op_vv_vari {
+
20  public:
+
21  log_diff_exp_vv_vari(vari* avi, vari* bvi) :
+
22  op_vv_vari(stan::math::log_diff_exp(avi->val_, bvi->val_),
+
23  avi, bvi) {
+
24  }
+
25  void chain() {
+
26  avi_->adj_ += adj_ * calculate_chain(avi_->val_, val_);
+
27  bvi_->adj_ -= adj_ / boost::math::expm1(avi_->val_ - bvi_->val_);
+
28  }
+
29  };
+
30  class log_diff_exp_vd_vari : public op_vd_vari {
+
31  public:
+
32  log_diff_exp_vd_vari(vari* avi, double b) :
+
33  op_vd_vari(stan::math::log_diff_exp(avi->val_, b),
+
34  avi, b) {
+
35  }
+
36  void chain() {
+
37  avi_->adj_ += adj_ * calculate_chain(avi_->val_, val_);
+
38  }
+
39  };
+
40  class log_diff_exp_dv_vari : public op_dv_vari {
+
41  public:
+
42  log_diff_exp_dv_vari(double a, vari* bvi) :
+
43  op_dv_vari(stan::math::log_diff_exp(a, bvi->val_),
+
44  a, bvi) {
+
45  }
+
46  void chain() {
+
47  bvi_->adj_ -= adj_ / boost::math::expm1(ad_ - bvi_->val_);
+
48  }
+
49  };
+
50  }
+
51 
+ +
56  const stan::agrad::var& b) {
+
57  return var(new log_diff_exp_vv_vari(a.vi_, b.vi_));
+
58  }
+ +
63  const double& b) {
+
64  return var(new log_diff_exp_vd_vari(a.vi_, b));
+
65  }
+
69  inline var log_diff_exp(const double& a,
+
70  const stan::agrad::var& b) {
+
71  return var(new log_diff_exp_dv_vari(a, b.vi_));
+
72  }
+
73 
+
74  }
+
75 }
+
76 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2log__falling__factorial_8hpp.html b/doc/api/html/agrad_2rev_2functions_2log__falling__factorial_8hpp.html new file mode 100644 index 00000000000..d4f361c8f91 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2log__falling__factorial_8hpp.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/agrad/rev/functions/log_falling_factorial.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log_falling_factorial.hpp File Reference
+
+
+
#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/vd_vari.hpp>
+#include <stan/agrad/rev/internal/dv_vari.hpp>
+#include <stan/agrad/rev/internal/vv_vari.hpp>
+#include <stan/math/functions/log_falling_factorial.hpp>
+#include <boost/math/special_functions/digamma.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + +

+Functions

var stan::agrad::log_falling_factorial (const var &a, const double &b)
 
var stan::agrad::log_falling_factorial (const var &a, const var &b)
 
var stan::agrad::log_falling_factorial (const double &a, const var &b)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2log__falling__factorial_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2log__falling__factorial_8hpp_source.html new file mode 100644 index 00000000000..4b1f9c9593c --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2log__falling__factorial_8hpp_source.html @@ -0,0 +1,171 @@ + + + + + +Stan: src/stan/agrad/rev/functions/log_falling_factorial.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log_falling_factorial.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__LOG_FALLING_FACTORIAL_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__LOG_FALLING_FACTORIAL_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ + + + +
9 #include <boost/math/special_functions/digamma.hpp>
+
10 
+
11 namespace stan {
+
12  namespace agrad {
+
13 
+
14  namespace {
+
15 
+
16  class log_falling_factorial_vv_vari : public op_vv_vari {
+
17  public:
+
18  log_falling_factorial_vv_vari(vari* avi, vari* bvi) :
+
19  op_vv_vari(stan::math::log_falling_factorial(avi->val_, bvi->val_), avi, bvi) {
+
20  }
+
21  void chain() {
+
22  avi_->adj_ += adj_ * boost::math::digamma(avi_->val_ + 1);
+
23  bvi_->adj_ += adj_ * -boost::math::digamma(bvi_->val_ + 1);
+
24  }
+
25  };
+
26 
+
27  class log_falling_factorial_vd_vari : public op_vd_vari {
+
28  public:
+
29  log_falling_factorial_vd_vari(vari* avi, double b) :
+
30  op_vd_vari(stan::math::log_falling_factorial(avi->val_, b), avi, b) {
+
31  }
+
32  void chain() {
+
33  avi_->adj_ += adj_ * boost::math::digamma(avi_->val_ + 1);
+
34  }
+
35  };
+
36 
+
37  class log_falling_factorial_dv_vari : public op_dv_vari {
+
38  public:
+
39  log_falling_factorial_dv_vari(double a, vari* bvi) :
+
40  op_dv_vari(stan::math::log_falling_factorial(a, bvi->val_), a, bvi) {
+
41  }
+
42  void chain() {
+
43  bvi_->adj_ += adj_ * -boost::math::digamma(bvi_->val_ + 1);
+
44  }
+
45  };
+
46  }
+
47 
+
48  inline var log_falling_factorial(const var& a,
+
49  const double& b) {
+
50  return var(new log_falling_factorial_vd_vari(a.vi_, b));
+
51  }
+
52 
+
53  inline var log_falling_factorial(const var& a,
+
54  const var& b) {
+
55  return var(new log_falling_factorial_vv_vari(a.vi_, b.vi_));
+
56  }
+
57 
+
58  inline var log_falling_factorial(const double& a,
+
59  const var& b) {
+
60  return var(new log_falling_factorial_dv_vari(a, b.vi_));
+
61  }
+
62  }
+
63 }
+
64 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2log__rising__factorial_8hpp.html b/doc/api/html/agrad_2rev_2functions_2log__rising__factorial_8hpp.html new file mode 100644 index 00000000000..53ae7739255 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2log__rising__factorial_8hpp.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/agrad/rev/functions/log_rising_factorial.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log_rising_factorial.hpp File Reference
+
+
+
#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/vd_vari.hpp>
+#include <stan/agrad/rev/internal/dv_vari.hpp>
+#include <stan/agrad/rev/internal/vv_vari.hpp>
+#include <stan/math/functions/log_rising_factorial.hpp>
+#include <boost/math/special_functions/digamma.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + +

+Functions

var stan::agrad::log_rising_factorial (const var &a, const double &b)
 
var stan::agrad::log_rising_factorial (const var &a, const var &b)
 
var stan::agrad::log_rising_factorial (const double &a, const var &b)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2log__rising__factorial_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2log__rising__factorial_8hpp_source.html new file mode 100644 index 00000000000..173ef7887b1 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2log__rising__factorial_8hpp_source.html @@ -0,0 +1,172 @@ + + + + + +Stan: src/stan/agrad/rev/functions/log_rising_factorial.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log_rising_factorial.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__LOG_RISING_FACTORIAL_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__LOG_RISING_FACTORIAL_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ + + + +
9 #include <boost/math/special_functions/digamma.hpp>
+
10 
+
11 namespace stan {
+
12  namespace agrad {
+
13 
+
14  namespace {
+
15 
+
16  class log_rising_factorial_vv_vari : public op_vv_vari {
+
17  public:
+
18  log_rising_factorial_vv_vari(vari* avi, vari* bvi) :
+
19  op_vv_vari(stan::math::log_rising_factorial(avi->val_, bvi->val_), avi, bvi) {
+
20  }
+
21  void chain() {
+
22  avi_->adj_ += adj_ * (boost::math::digamma(avi_->val_ + bvi_->val_)
+
23  - boost::math::digamma(avi_->val_));
+
24  bvi_->adj_ += adj_ * boost::math::digamma(avi_->val_ + bvi_->val_);
+
25  }
+
26  };
+
27 
+
28  class log_rising_factorial_vd_vari : public op_vd_vari {
+
29  public:
+
30  log_rising_factorial_vd_vari(vari* avi, double b) :
+
31  op_vd_vari(stan::math::log_rising_factorial(avi->val_, b), avi, b) {
+
32  }
+
33  void chain() {
+
34  avi_->adj_ += adj_ * (boost::math::digamma(avi_->val_ + bd_) - boost::math::digamma(avi_->val_));
+
35  }
+
36  };
+
37 
+
38  class log_rising_factorial_dv_vari : public op_dv_vari {
+
39  public:
+
40  log_rising_factorial_dv_vari(double a, vari* bvi) :
+
41  op_dv_vari(stan::math::log_rising_factorial(a, bvi->val_), a, bvi) {
+
42  }
+
43  void chain() {
+
44  bvi_->adj_ += adj_ * boost::math::digamma(bvi_->val_ + ad_);
+
45  }
+
46  };
+
47  }
+
48 
+
49  inline var log_rising_factorial(const var& a,
+
50  const double& b) {
+
51  return var(new log_rising_factorial_vd_vari(a.vi_, b));
+
52  }
+
53 
+
54  inline var log_rising_factorial(const var& a,
+
55  const var& b) {
+
56  return var(new log_rising_factorial_vv_vari(a.vi_, b.vi_));
+
57  }
+
58 
+
59  inline var log_rising_factorial(const double& a,
+
60  const var& b) {
+
61  return var(new log_rising_factorial_dv_vari(a, b.vi_));
+
62  }
+
63  }
+
64 }
+
65 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2log__sum__exp_8hpp.html b/doc/api/html/agrad_2rev_2functions_2log__sum__exp_8hpp.html new file mode 100644 index 00000000000..3f145db0db9 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2log__sum__exp_8hpp.html @@ -0,0 +1,146 @@ + + + + + +Stan: src/stan/agrad/rev/functions/log_sum_exp.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log_sum_exp.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + + + + +

+Functions

var stan::agrad::log_sum_exp (const stan::agrad::var &a, const stan::agrad::var &b)
 Returns the log sum of exponentials.
 
var stan::agrad::log_sum_exp (const stan::agrad::var &a, const double &b)
 Returns the log sum of exponentials.
 
var stan::agrad::log_sum_exp (const double &a, const stan::agrad::var &b)
 Returns the log sum of exponentials.
 
var stan::agrad::log_sum_exp (const std::vector< var > &x)
 Returns the log sum of exponentials.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2log__sum__exp_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2log__sum__exp_8hpp_source.html new file mode 100644 index 00000000000..c1f8ef65d0f --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2log__sum__exp_8hpp_source.html @@ -0,0 +1,203 @@ + + + + + +Stan: src/stan/agrad/rev/functions/log_sum_exp.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log_sum_exp.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__LOG_SUM_EXP_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__LOG_SUM_EXP_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ + + + + + + + +
13 
+
14 namespace stan {
+
15  namespace agrad {
+
16 
+
17  namespace {
+
18  double log_sum_exp_as_double(const std::vector<var>& x) {
+
19  using std::numeric_limits;
+
20  using std::exp;
+
21  using std::log;
+
22  double max = -numeric_limits<double>::infinity();
+
23  for (size_t i = 0; i < x.size(); ++i)
+
24  if (x[i] > max)
+
25  max = x[i].val();
+
26  double sum = 0.0;
+
27  for (size_t i = 0; i < x.size(); ++i)
+
28  if (x[i] != -numeric_limits<double>::infinity())
+
29  sum += exp(x[i].val() - max);
+
30  return max + log(sum);
+
31  }
+
32 
+
33  class log_sum_exp_vv_vari : public op_vv_vari {
+
34  public:
+
35  log_sum_exp_vv_vari(vari* avi, vari* bvi) :
+
36  op_vv_vari(stan::math::log_sum_exp(avi->val_, bvi->val_),
+
37  avi, bvi) {
+
38  }
+
39  void chain() {
+
40  avi_->adj_ += adj_ * calculate_chain(avi_->val_, val_);
+
41  bvi_->adj_ += adj_ * calculate_chain(bvi_->val_, val_);
+
42  }
+
43  };
+
44  class log_sum_exp_vd_vari : public op_vd_vari {
+
45  public:
+
46  log_sum_exp_vd_vari(vari* avi, double b) :
+
47  op_vd_vari(stan::math::log_sum_exp(avi->val_, b),
+
48  avi, b) {
+
49  }
+
50  void chain() {
+
51  avi_->adj_ += adj_ * calculate_chain(avi_->val_, val_);
+
52  }
+
53  };
+
54  class log_sum_exp_dv_vari : public op_dv_vari {
+
55  public:
+
56  log_sum_exp_dv_vari(double a, vari* bvi) :
+
57  op_dv_vari(stan::math::log_sum_exp(a, bvi->val_),
+
58  a, bvi) {
+
59  }
+
60  void chain() {
+
61  bvi_->adj_ += adj_ * calculate_chain(bvi_->val_, val_);
+
62  }
+
63  };
+
64 
+
65  class log_sum_exp_vector_vari : public op_vector_vari {
+
66  public:
+
67  log_sum_exp_vector_vari(const std::vector<var>& x) :
+
68  op_vector_vari(log_sum_exp_as_double(x), x) {
+
69  }
+
70  void chain() {
+
71  for (size_t i = 0; i < size_; ++i) {
+
72  vis_[i]->adj_ += adj_ * calculate_chain(vis_[i]->val_, val_);
+
73  }
+
74  }
+
75  };
+
76  }
+
77 
+
81  inline var log_sum_exp(const stan::agrad::var& a,
+
82  const stan::agrad::var& b) {
+
83  return var(new log_sum_exp_vv_vari(a.vi_, b.vi_));
+
84  }
+
88  inline var log_sum_exp(const stan::agrad::var& a,
+
89  const double& b) {
+
90  return var(new log_sum_exp_vd_vari(a.vi_, b));
+
91  }
+
95  inline var log_sum_exp(const double& a,
+
96  const stan::agrad::var& b) {
+
97  return var(new log_sum_exp_dv_vari(a, b.vi_));
+
98  }
+
102  inline var log_sum_exp(const std::vector<var>& x) {
+
103  return var(new log_sum_exp_vector_vari(x));
+
104  }
+
105 
+
106  }
+
107 }
+
108 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2modified__bessel__first__kind_8hpp.html b/doc/api/html/agrad_2rev_2functions_2modified__bessel__first__kind_8hpp.html new file mode 100644 index 00000000000..6d8c9d4868d --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2modified__bessel__first__kind_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/rev/functions/modified_bessel_first_kind.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
modified_bessel_first_kind.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + +

+Functions

var stan::agrad::modified_bessel_first_kind (const int &v, const var &a)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2modified__bessel__first__kind_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2modified__bessel__first__kind_8hpp_source.html new file mode 100644 index 00000000000..a9a910c8863 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2modified__bessel__first__kind_8hpp_source.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/agrad/rev/functions/modified_bessel_first_kind.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
modified_bessel_first_kind.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__MODIFIED_BESSEL_FIRST_KIND_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__MODIFIED_BESSEL_FIRST_KIND_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ + +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  namespace {
+
12 
+
13  class modified_bessel_first_kind_dv_vari : public op_dv_vari {
+
14  public:
+
15  modified_bessel_first_kind_dv_vari(int a, vari* bvi) :
+
16  op_dv_vari(stan::math::modified_bessel_first_kind(a, bvi->val_), a, bvi) {
+
17  }
+
18  void chain() {
+ +
20  }
+
21  };
+
22  }
+
23 
+
24  inline var modified_bessel_first_kind(const int& v,
+
25  const var& a) {
+
26  return var(new modified_bessel_first_kind_dv_vari(v, a.vi_));
+
27  }
+
28 
+
29  }
+
30 }
+
31 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2modified__bessel__second__kind_8hpp.html b/doc/api/html/agrad_2rev_2functions_2modified__bessel__second__kind_8hpp.html new file mode 100644 index 00000000000..54069539159 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2modified__bessel__second__kind_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/rev/functions/modified_bessel_second_kind.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
modified_bessel_second_kind.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + +

+Functions

var stan::agrad::modified_bessel_second_kind (const int &v, const var &a)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2modified__bessel__second__kind_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2modified__bessel__second__kind_8hpp_source.html new file mode 100644 index 00000000000..d4bcb4d9eb4 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2modified__bessel__second__kind_8hpp_source.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/agrad/rev/functions/modified_bessel_second_kind.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
modified_bessel_second_kind.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__MODIFIED_BESSEL_SECOND_KIND_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__MODIFIED_BESSEL_SECOND_KIND_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ + +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  namespace {
+
12 
+
13  class modified_bessel_second_kind_dv_vari : public op_dv_vari {
+
14  public:
+
15  modified_bessel_second_kind_dv_vari(int a, vari* bvi) :
+
16  op_dv_vari(stan::math::modified_bessel_second_kind(a, bvi->val_), a, bvi) {
+
17  }
+
18  void chain() {
+ +
20  }
+
21  };
+
22  }
+
23 
+
24  inline var modified_bessel_second_kind(const int& v,
+
25  const var& a) {
+
26  return var(new modified_bessel_second_kind_dv_vari(v, a.vi_));
+
27  }
+
28 
+
29  }
+
30 }
+
31 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2multiply__log_8hpp.html b/doc/api/html/agrad_2rev_2functions_2multiply__log_8hpp.html new file mode 100644 index 00000000000..014f58f3f10 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2multiply__log_8hpp.html @@ -0,0 +1,141 @@ + + + + + +Stan: src/stan/agrad/rev/functions/multiply_log.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
multiply_log.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

var stan::agrad::multiply_log (const var &a, const var &b)
 Return the value of a*log(b).
 
var stan::agrad::multiply_log (const var &a, const double b)
 Return the value of a*log(b).
 
var stan::agrad::multiply_log (const double a, const var &b)
 Return the value of a*log(b).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2multiply__log_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2multiply__log_8hpp_source.html new file mode 100644 index 00000000000..4e925387878 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2multiply__log_8hpp_source.html @@ -0,0 +1,175 @@ + + + + + +Stan: src/stan/agrad/rev/functions/multiply_log.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
multiply_log.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__MULTIPLY_LOG_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__MULTIPLY_LOG_HPP__
+
3 
+
4 #include <limits>
+
5 #include <stan/agrad/rev/var.hpp>
+ + + + + +
11 
+
12 namespace stan {
+
13  namespace agrad {
+
14 
+
15  namespace {
+
16  class multiply_log_vv_vari : public op_vv_vari {
+
17  public:
+
18  multiply_log_vv_vari(vari* avi, vari* bvi) :
+
19  op_vv_vari(stan::math::multiply_log(avi->val_,bvi->val_),avi,bvi) {
+
20  }
+
21  void chain() {
+
22  using std::log;
+
23  avi_->adj_ += adj_ * log(bvi_->val_);
+
24  if (bvi_->val_ == 0.0 && avi_->val_ == 0)
+
25  bvi_->adj_ += adj_ * std::numeric_limits<double>::infinity();
+
26  else
+
27  bvi_->adj_ += adj_ * avi_->val_ / bvi_->val_;
+
28  }
+
29  };
+
30  class multiply_log_vd_vari : public op_vd_vari {
+
31  public:
+
32  multiply_log_vd_vari(vari* avi, double b) :
+
33  op_vd_vari(stan::math::multiply_log(avi->val_,b),avi,b) {
+
34  }
+
35  void chain() {
+
36  using std::log;
+
37  avi_->adj_ += adj_ * log(bd_);
+
38  }
+
39  };
+
40  class multiply_log_dv_vari : public op_dv_vari {
+
41  public:
+
42  multiply_log_dv_vari(double a, vari* bvi) :
+
43  op_dv_vari(stan::math::multiply_log(a,bvi->val_),a,bvi) {
+
44  }
+
45  void chain() {
+
46  if (bvi_->val_ == 0.0 && ad_ == 0.0)
+
47  bvi_->adj_ += adj_ * std::numeric_limits<double>::infinity();
+
48  else
+
49  bvi_->adj_ += adj_ * ad_ / bvi_->val_;
+
50  }
+
51  };
+
52  }
+
53 
+
66  inline var multiply_log(const var& a, const var& b) {
+
67  return var(new multiply_log_vv_vari(a.vi_,b.vi_));
+
68  }
+
79  inline var multiply_log(const var& a, const double b) {
+
80  return var(new multiply_log_vd_vari(a.vi_,b));
+
81  }
+
93  inline var multiply_log(const double a, const var& b) {
+
94  if (a == 1.0)
+
95  return log(b);
+
96  return var(new multiply_log_dv_vari(a,b.vi_));
+
97  }
+
98 
+
99  }
+
100 }
+
101 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2owens__t_8hpp.html b/doc/api/html/agrad_2rev_2functions_2owens__t_8hpp.html new file mode 100644 index 00000000000..d19f1d163db --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2owens__t_8hpp.html @@ -0,0 +1,140 @@ + + + + + +Stan: src/stan/agrad/rev/functions/owens_t.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
owens_t.hpp File Reference
+
+
+
#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/vv_vari.hpp>
+#include <stan/agrad/rev/internal/vd_vari.hpp>
+#include <stan/agrad/rev/internal/dv_vari.hpp>
+#include <stan/math/constants.hpp>
+#include <boost/math/special_functions/owens_t.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

var stan::agrad::owens_t (const var &h, const var &a)
 The Owen's T function of h and a.
 
var stan::agrad::owens_t (const var &h, const double &a)
 The Owen's T function of h and a.
 
var stan::agrad::owens_t (const double &h, const var &a)
 The Owen's T function of h and a.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2owens__t_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2owens__t_8hpp_source.html new file mode 100644 index 00000000000..46c983289f1 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2owens__t_8hpp_source.html @@ -0,0 +1,173 @@ + + + + + +Stan: src/stan/agrad/rev/functions/owens_t.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
owens_t.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__OWENS__T_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__OWENS__T_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ + + + +
9 #include <boost/math/special_functions/owens_t.hpp>
+
10 
+
11 namespace stan {
+
12  namespace agrad {
+
13 
+
14  namespace {
+
15 
+
16  using stan::math::pi;
+
17  class owens_t_vv_vari : public op_vv_vari {
+
18  public:
+
19  owens_t_vv_vari(vari* avi, vari* bvi) :
+
20  op_vv_vari(boost::math::owens_t(avi->val_, bvi->val_), avi, bvi) {
+
21  }
+
22  void chain() {
+
23  avi_->adj_ += adj_ * boost::math::erf(bvi_->val_ * avi_->val_ / std::sqrt(2.0)) * std::exp(-avi_->val_ * avi_->val_ / 2.0) * std::sqrt(pi() / 2.0) / (-2.0 * pi());
+
24  bvi_->adj_ += adj_ * std::exp(-0.5 * avi_->val_ * avi_->val_ * (1.0 + bvi_->val_ * bvi_->val_)) / ((1 + bvi_->val_ * bvi_->val_) * 2.0 * pi());
+
25  }
+
26  };
+
27 
+
28  class owens_t_vd_vari : public op_vd_vari {
+
29  public:
+
30  owens_t_vd_vari(vari* avi, double b) :
+
31  op_vd_vari(boost::math::owens_t(avi->val_, b), avi, b) {
+
32  }
+
33  void chain() {
+
34  avi_->adj_ += adj_ * boost::math::erf(bd_ * avi_->val_ / std::sqrt(2.0)) * std::exp(-avi_->val_ * avi_->val_ / 2.0) * std::sqrt(pi() / 2.0) / (-2.0 * pi());
+
35  }
+
36  };
+
37 
+
38  class owens_t_dv_vari : public op_dv_vari {
+
39  public:
+
40  owens_t_dv_vari(double a, vari* bvi) :
+
41  op_dv_vari(boost::math::owens_t(a, bvi->val_), a, bvi) {
+
42  }
+
43  void chain() {
+
44  bvi_->adj_ += adj_ * std::exp(-0.5 * ad_ * ad_ * (1.0 + bvi_->val_ * bvi_->val_)) / ((1 + bvi_->val_ * bvi_->val_) * 2.0 * pi());
+
45  }
+
46  };
+
47  }
+
48 
+
60  inline var owens_t(const var& h,
+
61  const var& a) {
+
62  return var(new owens_t_vv_vari(h.vi_, a.vi_));
+
63  }
+
64 
+
76  inline var owens_t(const var& h,
+
77  const double& a) {
+
78  return var(new owens_t_vd_vari(h.vi_, a));
+
79  }
+
80 
+
92  inline var owens_t(const double& h,
+
93  const var& a) {
+
94  return var(new owens_t_dv_vari(h, a.vi_));
+
95  }
+
96 
+
97  }
+
98 }
+
99 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2rising__factorial_8hpp.html b/doc/api/html/agrad_2rev_2functions_2rising__factorial_8hpp.html new file mode 100644 index 00000000000..e01504df617 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2rising__factorial_8hpp.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/agrad/rev/functions/rising_factorial.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
rising_factorial.hpp File Reference
+
+
+
#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/vd_vari.hpp>
+#include <stan/agrad/rev/internal/dv_vari.hpp>
+#include <stan/agrad/rev/internal/vv_vari.hpp>
+#include <stan/math/functions/rising_factorial.hpp>
+#include <boost/math/special_functions/digamma.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + +

+Functions

var stan::agrad::rising_factorial (const var &a, const double &b)
 
var stan::agrad::rising_factorial (const var &a, const var &b)
 
var stan::agrad::rising_factorial (const double &a, const var &b)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2rising__factorial_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2rising__factorial_8hpp_source.html new file mode 100644 index 00000000000..0c6926424ac --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2rising__factorial_8hpp_source.html @@ -0,0 +1,171 @@ + + + + + +Stan: src/stan/agrad/rev/functions/rising_factorial.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
rising_factorial.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__RISING_FACTORIAL_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__RISING_FACTORIAL_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ + + + +
9 #include <boost/math/special_functions/digamma.hpp>
+
10 
+
11 namespace stan {
+
12  namespace agrad {
+
13 
+
14  namespace {
+
15 
+
16  class rising_factorial_vv_vari : public op_vv_vari {
+
17  public:
+
18  rising_factorial_vv_vari(vari* avi, vari* bvi) :
+
19  op_vv_vari(stan::math::rising_factorial(avi->val_, bvi->val_), avi, bvi) {
+
20  }
+
21  void chain() {
+
22  avi_->adj_ += adj_ * stan::math::rising_factorial(avi_->val_, bvi_->val_) * (boost::math::digamma(avi_->val_ + bvi_->val_) - boost::math::digamma(avi_->val_));
+
23  bvi_->adj_ += adj_ * stan::math::rising_factorial(avi_->val_, bvi_->val_) * boost::math::digamma(bvi_->val_ + avi_->val_);
+
24  }
+
25  };
+
26 
+
27  class rising_factorial_vd_vari : public op_vd_vari {
+
28  public:
+
29  rising_factorial_vd_vari(vari* avi, double b) :
+
30  op_vd_vari(stan::math::rising_factorial(avi->val_, b), avi, b) {
+
31  }
+
32  void chain() {
+
33  avi_->adj_ += adj_ * stan::math::rising_factorial(avi_->val_, bd_) * (boost::math::digamma(avi_->val_ + bd_) - boost::math::digamma(avi_->val_));
+
34  }
+
35  };
+
36 
+
37  class rising_factorial_dv_vari : public op_dv_vari {
+
38  public:
+
39  rising_factorial_dv_vari(double a, vari* bvi) :
+
40  op_dv_vari(stan::math::rising_factorial(a, bvi->val_), a, bvi) {
+
41  }
+
42  void chain() {
+
43  bvi_->adj_ += adj_ * stan::math::rising_factorial(ad_, bvi_->val_) * boost::math::digamma(bvi_->val_ + ad_);
+
44  }
+
45  };
+
46  }
+
47 
+
48  inline var rising_factorial(const var& a,
+
49  const double& b) {
+
50  return var(new rising_factorial_vd_vari(a.vi_, b));
+
51  }
+
52 
+
53  inline var rising_factorial(const var& a,
+
54  const var& b) {
+
55  return var(new rising_factorial_vv_vari(a.vi_, b.vi_));
+
56  }
+
57 
+
58  inline var rising_factorial(const double& a,
+
59  const var& b) {
+
60  return var(new rising_factorial_dv_vari(a, b.vi_));
+
61  }
+
62  }
+
63 }
+
64 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2square_8hpp.html b/doc/api/html/agrad_2rev_2functions_2square_8hpp.html new file mode 100644 index 00000000000..a9b6fb9d26f --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2square_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/rev/functions/square.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
square.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::square (const var &x)
 Return the square of the input variable.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2square_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2square_8hpp_source.html new file mode 100644 index 00000000000..0c389de75bd --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2square_8hpp_source.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/agrad/rev/functions/square.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
square.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__SQUARE_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__SQUARE_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ +
6 
+
7 namespace stan {
+
8  namespace agrad {
+
9 
+
10  namespace {
+
11  class square_vari : public op_v_vari {
+
12  public:
+
13  square_vari(vari* avi) :
+
14  op_v_vari(avi->val_ * avi->val_,avi) {
+
15  }
+
16  void chain() {
+
17  avi_->adj_ += adj_ * 2.0 * avi_->val_;
+
18  }
+
19  };
+
20  }
+
21 
+
31  inline var square(const var& x) {
+
32  return var(new square_vari(x.vi_));
+
33  }
+
34 
+
35  }
+
36 }
+
37 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2step_8hpp.html b/doc/api/html/agrad_2rev_2functions_2step_8hpp.html new file mode 100644 index 00000000000..4fc3e2a331a --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2step_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/agrad/rev/functions/step.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
step.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::step (const stan::agrad::var &a)
 Return the step, or heaviside, function applied to the specified variable (stan).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2step_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2step_8hpp_source.html new file mode 100644 index 00000000000..d2fde7760d5 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2step_8hpp_source.html @@ -0,0 +1,122 @@ + + + + + +Stan: src/stan/agrad/rev/functions/step.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
step.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__STEP_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__STEP_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+
5 
+
6 namespace stan {
+
7  namespace agrad {
+
8 
+
25  inline var step(const stan::agrad::var& a) {
+
26  return var(new vari(a.vi_->val_ < 0.0 ? 0.0 : 1.0));
+
27  }
+
28 
+
29  }
+
30 }
+
31 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2value__of_8hpp.html b/doc/api/html/agrad_2rev_2functions_2value__of_8hpp.html new file mode 100644 index 00000000000..c3e997ff22c --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2value__of_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/agrad/rev/functions/value_of.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
value_of.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

double stan::agrad::value_of (const agrad::var &v)
 Return the value of the specified variable.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_2value__of_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_2value__of_8hpp_source.html new file mode 100644 index 00000000000..df2f091a745 --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_2value__of_8hpp_source.html @@ -0,0 +1,122 @@ + + + + + +Stan: src/stan/agrad/rev/functions/value_of.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
value_of.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__VALUE_OF_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__VALUE_OF_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+
5 
+
6 namespace stan {
+
7  namespace agrad {
+
8 
+
22  inline double value_of(const agrad::var& v) {
+
23  return v.vi_->val_;
+
24  }
+
25 
+
26  }
+
27 }
+
28 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_8hpp.html b/doc/api/html/agrad_2rev_2functions_8hpp.html new file mode 100644 index 00000000000..df89193f70d --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_8hpp.html @@ -0,0 +1,182 @@ + + + + + +Stan: src/stan/agrad/rev/functions.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
functions.hpp File Reference
+
+
+
#include <stan/agrad/rev/functions/Phi.hpp>
+#include <stan/agrad/rev/functions/Phi_approx.hpp>
+#include <stan/agrad/rev/functions/abs.hpp>
+#include <stan/agrad/rev/functions/acos.hpp>
+#include <stan/agrad/rev/functions/acosh.hpp>
+#include <stan/agrad/rev/functions/as_bool.hpp>
+#include <stan/agrad/rev/functions/asin.hpp>
+#include <stan/agrad/rev/functions/asinh.hpp>
+#include <stan/agrad/rev/functions/atan.hpp>
+#include <stan/agrad/rev/functions/atan2.hpp>
+#include <stan/agrad/rev/functions/atanh.hpp>
+#include <stan/agrad/rev/functions/bessel_first_kind.hpp>
+#include <stan/agrad/rev/functions/bessel_second_kind.hpp>
+#include <stan/agrad/rev/functions/binary_log_loss.hpp>
+#include <stan/agrad/rev/functions/cbrt.hpp>
+#include <stan/agrad/rev/functions/ceil.hpp>
+#include <stan/agrad/rev/functions/cos.hpp>
+#include <stan/agrad/rev/functions/cosh.hpp>
+#include <stan/agrad/rev/functions/digamma.hpp>
+#include <stan/agrad/rev/functions/erf.hpp>
+#include <stan/agrad/rev/functions/erfc.hpp>
+#include <stan/agrad/rev/functions/exp.hpp>
+#include <stan/agrad/rev/functions/exp2.hpp>
+#include <stan/agrad/rev/functions/expm1.hpp>
+#include <stan/agrad/rev/functions/fabs.hpp>
+#include <stan/agrad/rev/functions/falling_factorial.hpp>
+#include <stan/agrad/rev/functions/fdim.hpp>
+#include <stan/agrad/rev/functions/floor.hpp>
+#include <stan/agrad/rev/functions/fma.hpp>
+#include <stan/agrad/rev/functions/fmax.hpp>
+#include <stan/agrad/rev/functions/fmin.hpp>
+#include <stan/agrad/rev/functions/fmod.hpp>
+#include <stan/agrad/rev/functions/gamma_p.hpp>
+#include <stan/agrad/rev/functions/gamma_q.hpp>
+#include <stan/agrad/rev/functions/hypot.hpp>
+#include <stan/agrad/rev/functions/ibeta.hpp>
+#include <stan/agrad/rev/functions/if_else.hpp>
+#include <stan/agrad/rev/functions/inv.hpp>
+#include <stan/agrad/rev/functions/inv_cloglog.hpp>
+#include <stan/agrad/rev/functions/inv_logit.hpp>
+#include <stan/agrad/rev/functions/inv_sqrt.hpp>
+#include <stan/agrad/rev/functions/inv_square.hpp>
+#include <stan/agrad/rev/functions/is_uninitialized.hpp>
+#include <stan/agrad/rev/functions/lgamma.hpp>
+#include <stan/agrad/rev/functions/lmgamma.hpp>
+#include <stan/agrad/rev/functions/log.hpp>
+#include <stan/agrad/rev/functions/log10.hpp>
+#include <stan/agrad/rev/functions/log1m.hpp>
+#include <stan/agrad/rev/functions/log1m_exp.hpp>
+#include <stan/agrad/rev/functions/log1p.hpp>
+#include <stan/agrad/rev/functions/log1p_exp.hpp>
+#include <stan/agrad/rev/functions/log2.hpp>
+#include <stan/agrad/rev/functions/log_diff_exp.hpp>
+#include <stan/agrad/rev/functions/log_falling_factorial.hpp>
+#include <stan/agrad/rev/functions/log_rising_factorial.hpp>
+#include <stan/agrad/rev/functions/log_sum_exp.hpp>
+#include <stan/agrad/rev/functions/modified_bessel_first_kind.hpp>
+#include <stan/agrad/rev/functions/modified_bessel_second_kind.hpp>
+#include <stan/agrad/rev/functions/multiply_log.hpp>
+#include <stan/agrad/rev/functions/owens_t.hpp>
+#include <stan/agrad/rev/functions/pow.hpp>
+#include <stan/agrad/rev/functions/rising_factorial.hpp>
+#include <stan/agrad/rev/functions/round.hpp>
+#include <stan/agrad/rev/functions/sin.hpp>
+#include <stan/agrad/rev/functions/sinh.hpp>
+#include <stan/agrad/rev/functions/sqrt.hpp>
+#include <stan/agrad/rev/functions/square.hpp>
+#include <stan/agrad/rev/functions/step.hpp>
+#include <stan/agrad/rev/functions/tan.hpp>
+#include <stan/agrad/rev/functions/tanh.hpp>
+#include <stan/agrad/rev/functions/tgamma.hpp>
+#include <stan/agrad/rev/functions/trunc.hpp>
+#include <stan/agrad/rev/functions/value_of.hpp>
+
+

Go to the source code of this file.

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2functions_8hpp_source.html b/doc/api/html/agrad_2rev_2functions_8hpp_source.html new file mode 100644 index 00000000000..645165e336d --- /dev/null +++ b/doc/api/html/agrad_2rev_2functions_8hpp_source.html @@ -0,0 +1,185 @@ + + + + + +Stan: src/stan/agrad/rev/functions.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
functions.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS_HPP__
+
3 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
77 
+
78 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2crossprod_8hpp.html b/doc/api/html/agrad_2rev_2matrix_2crossprod_8hpp.html new file mode 100644 index 00000000000..2a467d3b5d6 --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2crossprod_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/crossprod.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
crossprod.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

matrix_v stan::agrad::crossprod (const matrix_v &M)
 Returns the result of pre-multiplying a matrix by its own transpose.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2crossprod_8hpp_source.html b/doc/api/html/agrad_2rev_2matrix_2crossprod_8hpp_source.html new file mode 100644 index 00000000000..a78cbde1adc --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2crossprod_8hpp_source.html @@ -0,0 +1,124 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/crossprod.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
crossprod.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__CROSSPROD_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__CROSSPROD_HPP__
+
3 
+ + +
6 
+
7 namespace stan {
+
8  namespace agrad {
+
9 
+
16  inline matrix_v
+
17  crossprod(const matrix_v& M) {
+
18  return tcrossprod(M.transpose());
+
19  }
+
20 
+
21  }
+
22 }
+
23 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2determinant_8hpp.html b/doc/api/html/agrad_2rev_2matrix_2determinant_8hpp.html new file mode 100644 index 00000000000..fe969ee59fe --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2determinant_8hpp.html @@ -0,0 +1,201 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/determinant.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
determinant.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<int R, int C>
var stan::agrad::determinant (const Eigen::Matrix< var, R, C > &m)
 
+

Variable Documentation

+ +
+
+ + + + +
vari** _adjARef
+
+ +

Definition at line 24 of file determinant.hpp.

+ +
+
+ +
+
+ + + + +
int _cols
+
+ +

Definition at line 22 of file determinant.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
int _rows
+
+static
+
+ +

Definition at line 21 of file determinant.hpp.

+ +
+
+ +
+
+ + + + +
double* A_
+
+ +

Definition at line 23 of file determinant.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2determinant_8hpp_source.html b/doc/api/html/agrad_2rev_2matrix_2determinant_8hpp_source.html new file mode 100644 index 00000000000..1c3dcaa89ee --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2determinant_8hpp_source.html @@ -0,0 +1,182 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/determinant.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
determinant.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__DETERMINANT_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__DETERMINANT_HPP__
+
3 
+
4 #include <vector>
+ + + + +
9 #include <stan/agrad/rev/var.hpp>
+ +
11 
+
12 // FIXME: use explicit files
+
13 #include <stan/agrad/rev.hpp>
+
14 
+
15 namespace stan {
+
16  namespace agrad {
+
17 
+
18  namespace {
+
19  template<int R,int C>
+
20  class determinant_vari : public vari {
+
21  int _rows;
+
22  int _cols;
+
23  double* A_;
+
24  vari** _adjARef;
+
25  public:
+
26  determinant_vari(const Eigen::Matrix<var,R,C> &A)
+
27  : vari(determinant_vari_calc(A)),
+
28  _rows(A.rows()),
+
29  _cols(A.cols()),
+
30  A_((double*)stan::agrad::memalloc_.alloc(sizeof(double)
+
31  * A.rows() * A.cols())),
+
32  _adjARef((vari**)stan::agrad::memalloc_.alloc(sizeof(vari*)
+
33  * A.rows() * A.cols()))
+
34  {
+
35  size_t pos = 0;
+
36  for (size_type j = 0; j < _cols; j++) {
+
37  for (size_type i = 0; i < _rows; i++) {
+
38  A_[pos] = A(i,j).val();
+
39  _adjARef[pos++] = A(i,j).vi_;
+
40  }
+
41  }
+
42  }
+
43  static
+
44  double determinant_vari_calc(const Eigen::Matrix<var,R,C> &A) {
+
45  Eigen::Matrix<double,R,C> Ad(A.rows(),A.cols());
+
46  for (size_type j = 0; j < A.rows(); j++)
+
47  for (size_type i = 0; i < A.cols(); i++)
+
48  Ad(i,j) = A(i,j).val();
+
49  return Ad.determinant();
+
50  }
+
51  virtual void chain() {
+
52  using Eigen::Matrix;
+
53  using Eigen::Map;
+
54  Matrix<double,R,C> adjA(_rows,_cols);
+
55  adjA = (adj_ * val_) *
+
56  Map<Matrix<double,R,C> >(A_,_rows,_cols).inverse().transpose();
+
57  size_t pos = 0;
+
58  for (size_type j = 0; j < _cols; j++) {
+
59  for (size_type i = 0; i < _rows; i++) {
+
60  _adjARef[pos++]->adj_ += adjA(i,j);
+
61  }
+
62  }
+
63  }
+
64  };
+
65  }
+
66 
+
67  template <int R, int C>
+
68  inline var determinant(const Eigen::Matrix<var,R,C>& m) {
+
69  stan::math::validate_square(m,"determinant");
+
70  return var(new determinant_vari<R,C>(m));
+
71  }
+
72 
+
73  }
+
74 }
+
75 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2divide_8hpp.html b/doc/api/html/agrad_2rev_2matrix_2divide_8hpp.html new file mode 100644 index 00000000000..27b4b78f733 --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2divide_8hpp.html @@ -0,0 +1,144 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/divide.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
divide.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + + +

+Functions

double stan::agrad::divide (double x, double y)
 Return the division of the first scalar by the second scalar.
 
template<typename T1 , typename T2 >
stan::return_type< T1, T2 >::type stan::agrad::divide (const T1 &v, const T2 &c)
 
template<typename T1 , typename T2 , int R, int C>
Eigen::Matrix< var, R, C > stan::agrad::divide (const Eigen::Matrix< T1, R, C > &v, const T2 &c)
 Return the division of the specified column vector by the specified scalar.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2divide_8hpp_source.html b/doc/api/html/agrad_2rev_2matrix_2divide_8hpp_source.html new file mode 100644 index 00000000000..71bdd2304ee --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2divide_8hpp_source.html @@ -0,0 +1,141 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/divide.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
divide.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__DIVIDE_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__DIVIDE_HPP__
+
3 
+
4 #include <vector>
+ + + + +
9 #include <stan/agrad/rev/var.hpp>
+ + + +
13 
+
14 namespace stan {
+
15  namespace agrad {
+
16 
+
24  inline double
+
25  divide(double x, double y) {
+
26  return x / y;
+
27  }
+
28  template <typename T1, typename T2>
+
29  inline var
+
30  divide(const T1& v, const T2& c) {
+
31  return to_var(v) / to_var(c);
+
32  }
+
40  template <typename T1, typename T2, int R, int C>
+
41  inline Eigen::Matrix<var,R,C>
+
42  divide(const Eigen::Matrix<T1, R,C>& v, const T2& c) {
+
43  return to_var(v) / to_var(c);
+
44  }
+
45 
+
46  }
+
47 }
+
48 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2dot__product_8hpp.html b/doc/api/html/agrad_2rev_2matrix_2dot__product_8hpp.html new file mode 100644 index 00000000000..a4c0a469c71 --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2dot__product_8hpp.html @@ -0,0 +1,221 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/dot_product.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
dot_product.hpp File Reference
+
+
+
#include <vector>
+#include <boost/utility/enable_if.hpp>
+#include <boost/type_traits.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/typedefs.hpp>
+#include <stan/math/matrix/validate_vector.hpp>
+#include <stan/math/matrix/validate_matching_sizes.hpp>
+#include <stan/math/functions/value_of.hpp>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/vari.hpp>
+#include <stan/agrad/rev/matrix/typedefs.hpp>
+#include <stan/agrad/rev/functions/value_of.hpp>
+
+

Go to the source code of this file.

+ + + + +

+Classes

struct  dot_product_store_type< T >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + + + + + + + + + + +

+Functions

template<typename T1 , int R1, int C1, typename T2 , int R2, int C2>
boost::enable_if_c
+< boost::is_same< T1, var >
+::value||boost::is_same< T2,
+var >::value, var >::type 
stan::agrad::dot_product (const Eigen::Matrix< T1, R1, C1 > &v1, const Eigen::Matrix< T2, R2, C2 > &v2)
 Returns the dot product.
 
template<typename T1 , typename T2 >
boost::enable_if_c
+< boost::is_same< T1, var >
+::value||boost::is_same< T2,
+var >::value, var >::type 
stan::agrad::dot_product (const T1 *v1, const T2 *v2, size_t length)
 Returns the dot product.
 
template<typename T1 , typename T2 >
boost::enable_if_c
+< boost::is_same< T1, var >
+::value||boost::is_same< T2,
+var >::value, var >::type 
stan::agrad::dot_product (const std::vector< T1 > &v1, const std::vector< T2 > &v2)
 Returns the dot product.
 
template<typename T1 , int R1, int C1, typename T2 , int R2, int C2>
boost::enable_if_c
+< boost::is_same< T1, var >
+::value||boost::is_same< T2,
+var >::value, Eigen::Matrix
+< var, 1, C1 > >::type 
stan::agrad::columns_dot_product (const Eigen::Matrix< T1, R1, C1 > &v1, const Eigen::Matrix< T2, R2, C2 > &v2)
 
template<typename T1 , int R1, int C1, typename T2 , int R2, int C2>
boost::enable_if_c
+< boost::is_same< T1, var >
+::value||boost::is_same< T2,
+var >::value, Eigen::Matrix
+< var, R1, 1 > >::type 
stan::agrad::rows_dot_product (const Eigen::Matrix< T1, R1, C1 > &v1, const Eigen::Matrix< T2, R2, C2 > &v2)
 
+

Variable Documentation

+ +
+
+ + + + +
size_t length_
+
+ +

Definition at line 39 of file dot_product.hpp.

+ +
+
+ +
+
+ + + + +
dot_product_store_type<T1>::type v1_
+
+ +

Definition at line 37 of file dot_product.hpp.

+ +
+
+ +
+
+ + + + +
dot_product_store_type<T2>::type v2_
+
+ +

Definition at line 38 of file dot_product.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2dot__product_8hpp_source.html b/doc/api/html/agrad_2rev_2matrix_2dot__product_8hpp_source.html new file mode 100644 index 00000000000..6ba6592f365 --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2dot__product_8hpp_source.html @@ -0,0 +1,368 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/dot_product.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
dot_product.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__DOT_PRODUCT_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__DOT_PRODUCT_HPP__
+
3 
+
4 #include <vector>
+
5 #include <boost/utility/enable_if.hpp>
+
6 #include <boost/type_traits.hpp>
+ + + + + +
12 #include <stan/agrad/rev/var.hpp>
+
13 #include <stan/agrad/rev/vari.hpp>
+ + +
16 
+
17 namespace stan {
+
18  namespace agrad {
+
19 
+
20  namespace {
+
21  template<typename T>
+ +
23 
+
24  template<>
+
25  struct dot_product_store_type<var> {
+
26  typedef vari** type;
+
27  };
+
28 
+
29  template<>
+
30  struct dot_product_store_type<double> {
+
31  typedef double* type;
+
32  };
+
33 
+
34  template<typename T1, typename T2>
+
35  class dot_product_vari : public vari {
+
36  protected:
+ + +
39  size_t length_;
+
40 
+
41  inline static double var_dot(vari** v1, vari** v2,
+
42  size_t length) {
+
43  Eigen::VectorXd vd1(length), vd2(length);
+
44  for (size_t i = 0; i < length; i++) {
+
45  vd1[i] = v1[i]->val_;
+
46  vd2[i] = v2[i]->val_;
+
47  }
+
48  return vd1.dot(vd2);
+
49  }
+
50 
+
51  inline static double var_dot(const T1* v1, const T2* v2,
+
52  size_t length) {
+ +
54  Eigen::VectorXd vd1(length), vd2(length);
+
55  for (size_t i = 0; i < length; i++) {
+
56  vd1[i] = value_of(v1[i]);
+
57  vd2[i] = value_of(v2[i]);
+
58  }
+
59  return vd1.dot(vd2);
+
60  }
+
61 
+
62  template<typename Derived1,typename Derived2>
+
63  inline static double var_dot(const Eigen::DenseBase<Derived1> &v1,
+
64  const Eigen::DenseBase<Derived2> &v2) {
+ + +
67  Eigen::VectorXd vd1(v1.size()), vd2(v1.size());
+
68  for (int i = 0; i < v1.size(); i++) {
+
69  vd1[i] = value_of(v1[i]);
+
70  vd2[i] = value_of(v2[i]);
+
71  }
+
72  return vd1.dot(vd2);
+
73  }
+
74  inline void chain(vari** v1, vari** v2) {
+
75  for (size_t i = 0; i < length_; i++) {
+
76  v1[i]->adj_ += adj_ * v2_[i]->val_;
+
77  v2[i]->adj_ += adj_ * v1_[i]->val_;
+
78  }
+
79  }
+
80  inline void chain(double* v1, vari** v2) {
+
81  for (size_t i = 0; i < length_; i++) {
+
82  v2[i]->adj_ += adj_ * v1_[i];
+
83  }
+
84  }
+
85  inline void chain(vari** v1, double* v2) {
+
86  for (size_t i = 0; i < length_; i++) {
+
87  v1[i]->adj_ += adj_ * v2_[i];
+
88  }
+
89  }
+
90  inline void initialize(vari** &mem_v, const var *inv, vari **shared = NULL) {
+
91  if (shared == NULL) {
+
92  mem_v = (vari**)memalloc_.alloc(length_*sizeof(vari*));
+
93  for (size_t i = 0; i < length_; i++)
+
94  mem_v[i] = inv[i].vi_;
+
95  }
+
96  else {
+
97  mem_v = shared;
+
98  }
+
99  }
+
100  template<typename Derived>
+
101  inline void initialize(vari** &mem_v, const Eigen::DenseBase<Derived> &inv, vari **shared = NULL) {
+
102  if (shared == NULL) {
+
103  mem_v = (vari**)memalloc_.alloc(length_*sizeof(vari*));
+
104  for (size_t i = 0; i < length_; i++)
+
105  mem_v[i] = inv(i).vi_;
+
106  }
+
107  else {
+
108  mem_v = shared;
+
109  }
+
110  }
+
111 
+
112  inline void initialize(double* &mem_d, const double *ind, double *shared = NULL) {
+
113  if (shared == NULL) {
+
114  mem_d = (double*)memalloc_.alloc(length_*sizeof(double));
+
115  for (size_t i = 0; i < length_; i++)
+
116  mem_d[i] = ind[i];
+
117  }
+
118  else {
+
119  mem_d = shared;
+
120  }
+
121  }
+
122  template<typename Derived>
+
123  inline void initialize(double* &mem_d, const Eigen::DenseBase<Derived> &ind, double *shared = NULL) {
+
124  if (shared == NULL) {
+
125  mem_d = (double*)memalloc_.alloc(length_*sizeof(double));
+
126  for (size_t i = 0; i < length_; i++)
+
127  mem_d[i] = ind(i);
+
128  }
+
129  else {
+
130  mem_d = shared;
+
131  }
+
132  }
+
133 
+
134  public:
+
135  dot_product_vari(typename dot_product_store_type<T1>::type v1,
+ +
137  size_t length)
+
138  : vari(var_dot(v1,v2,length)), v1_(v1), v2_(v2), length_(length) {}
+
139 
+
140  dot_product_vari(const T1* v1, const T2* v2, size_t length,
+
141  dot_product_vari<T1,T2>* shared_v1 = NULL,
+
142  dot_product_vari<T1,T2>* shared_v2 = NULL) :
+
143  vari(var_dot(v1, v2, length)), length_(length) {
+
144  if (shared_v1 == NULL) {
+
145  initialize(v1_,v1);
+
146  }
+
147  else {
+
148  initialize(v1_,v1,shared_v1->v1_);
+
149  }
+
150  if (shared_v2 == NULL) {
+
151  initialize(v2_,v2);
+
152  }
+
153  else {
+
154  initialize(v2_,v2,shared_v2->v2_);
+
155  }
+
156  }
+
157  template<typename Derived1,typename Derived2>
+
158  dot_product_vari(const Eigen::DenseBase<Derived1> &v1,
+
159  const Eigen::DenseBase<Derived2> &v2,
+
160  dot_product_vari<T1,T2>* shared_v1 = NULL,
+
161  dot_product_vari<T1,T2>* shared_v2 = NULL) :
+
162  vari(var_dot(v1, v2)), length_(v1.size()) {
+
163  if (shared_v1 == NULL) {
+
164  initialize(v1_,v1);
+
165  }
+
166  else {
+
167  initialize(v1_,v1,shared_v1->v1_);
+
168  }
+
169  if (shared_v2 == NULL) {
+
170  initialize(v2_,v2);
+
171  }
+
172  else {
+
173  initialize(v2_,v2,shared_v2->v2_);
+
174  }
+
175  }
+
176  template<int R1,int C1,int R2,int C2>
+
177  dot_product_vari(const Eigen::Matrix<T1,R1,C1> &v1,
+
178  const Eigen::Matrix<T2,R2,C2> &v2,
+
179  dot_product_vari<T1,T2>* shared_v1 = NULL,
+
180  dot_product_vari<T1,T2>* shared_v2 = NULL) :
+
181  vari(var_dot(v1, v2)), length_(v1.size()) {
+
182  if (shared_v1 == NULL) {
+
183  initialize(v1_,v1);
+
184  }
+
185  else {
+
186  initialize(v1_,v1,shared_v1->v1_);
+
187  }
+
188  if (shared_v2 == NULL) {
+
189  initialize(v2_,v2);
+
190  }
+
191  else {
+
192  initialize(v2_,v2,shared_v2->v2_);
+
193  }
+
194  }
+
195  virtual void chain() {
+
196  chain(v1_,v2_);
+
197  }
+
198  };
+
199  }
+
200 
+
209  template<typename T1, int R1, int C1, typename T2, int R2, int C2>
+
210  inline
+
211  typename boost::enable_if_c<boost::is_same<T1,var>::value ||
+
212  boost::is_same<T2,var>::value, var>::type
+
213  dot_product(const Eigen::Matrix<T1, R1, C1>& v1,
+
214  const Eigen::Matrix<T2, R2, C2>& v2) {
+
215  stan::math::validate_vector(v1,"dot_product");
+
216  stan::math::validate_vector(v2,"dot_product");
+
217  stan::math::validate_matching_sizes(v1,v2,"dot_product");
+
218  return var(new dot_product_vari<T1,T2>(v1,v2));
+
219  }
+
228  template<typename T1, typename T2>
+
229  inline
+
230  typename boost::enable_if_c<boost::is_same<T1,var>::value ||
+
231  boost::is_same<T2,var>::value, var>::type
+
232  dot_product(const T1* v1, const T2* v2, size_t length) {
+
233  return var(new dot_product_vari<T1,T2>(v1, v2, length));
+
234  }
+
235 
+
244  template<typename T1, typename T2>
+
245  inline
+
246  typename boost::enable_if_c<boost::is_same<T1,var>::value ||
+
247  boost::is_same<T2,var>::value, var>::type
+
248  dot_product(const std::vector<T1>& v1,
+
249  const std::vector<T2>& v2) {
+
250  stan::math::validate_matching_sizes(v1,v2,"dot_product");
+
251  return var(new dot_product_vari<T1,T2>(&v1[0], &v2[0], v1.size()));
+
252  }
+
253 
+
254  template<typename T1, int R1, int C1, typename T2, int R2, int C2>
+
255  inline
+
256  typename boost::enable_if_c<boost::is_same<T1,var>::value ||
+
257  boost::is_same<T2,var>::value,
+
258  Eigen::Matrix<var, 1, C1> >::type
+
259  columns_dot_product(const Eigen::Matrix<T1, R1, C1>& v1,
+
260  const Eigen::Matrix<T2, R2, C2>& v2) {
+
261  stan::math::validate_matching_sizes(v1,v2,"columns_dot_product");
+
262  Eigen::Matrix<var, 1, C1> ret(1,v1.cols());
+
263  for (size_type j = 0; j < v1.cols(); ++j) {
+
264  ret(j) = var(new dot_product_vari<T1,T2>(v1.col(j),v2.col(j)));
+
265  }
+
266  return ret;
+
267  }
+
268 
+
269  template<typename T1, int R1, int C1, typename T2, int R2, int C2>
+
270  inline
+
271  typename boost::enable_if_c<boost::is_same<T1,var>::value ||
+
272  boost::is_same<T2,var>::value,
+
273  Eigen::Matrix<var, R1, 1> >::type
+
274  rows_dot_product(const Eigen::Matrix<T1, R1, C1>& v1,
+
275  const Eigen::Matrix<T2, R2, C2>& v2) {
+
276  stan::math::validate_matching_sizes(v1,v2,"rows_dot_product");
+
277  Eigen::Matrix<var, R1, 1> ret(v1.rows(),1);
+
278  for (size_type j = 0; j < v1.rows(); ++j) {
+
279  ret(j) = var(new dot_product_vari<T1,T2>(v1.row(j),v2.row(j)));
+
280  }
+
281  return ret;
+
282  }
+
283  }
+
284 }
+
285 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2dot__self_8hpp.html b/doc/api/html/agrad_2rev_2matrix_2dot__self_8hpp.html new file mode 100644 index 00000000000..b617b7ae3d5 --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2dot__self_8hpp.html @@ -0,0 +1,176 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/dot_self.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
dot_self.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + +

+Functions

template<int R, int C>
var stan::agrad::dot_self (const Eigen::Matrix< var, R, C > &v)
 Returns the dot product of a vector with itself.
 
template<int R, int C>
Eigen::Matrix< var, 1, C > stan::agrad::columns_dot_self (const Eigen::Matrix< var, R, C > &x)
 Returns the dot product of each column of a matrix with itself.
 
+

Variable Documentation

+ +
+
+ + + + +
size_t size_
+
+ +

Definition at line 18 of file dot_self.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
vari** v_
+
+static
+
+ +

Definition at line 17 of file dot_self.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2dot__self_8hpp_source.html b/doc/api/html/agrad_2rev_2matrix_2dot__self_8hpp_source.html new file mode 100644 index 00000000000..2a6f0926005 --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2dot__self_8hpp_source.html @@ -0,0 +1,192 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/dot_self.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
dot_self.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__DOT_SELF_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__DOT_SELF_HPP__
+
3 
+
4 #include <vector>
+ + + +
8 #include <stan/agrad/rev/var.hpp>
+ +
10 
+
11 namespace stan {
+
12  namespace agrad {
+
13 
+
14  namespace {
+
15  class dot_self_vari : public vari {
+
16  protected:
+
17  vari** v_;
+
18  size_t size_;
+
19  public:
+
20  dot_self_vari(vari** v, size_t size)
+
21  : vari(var_dot_self(v,size)),
+
22  v_(v),
+
23  size_(size) {
+
24  }
+
25  template<typename Derived>
+
26  dot_self_vari(const Eigen::DenseBase<Derived> &v) :
+
27  vari(var_dot_self(v)), size_(v.size()) {
+
28  v_ = (vari**)memalloc_.alloc(size_*sizeof(vari*));
+
29  for (size_t i = 0; i < size_; i++)
+
30  v_[i] = v[i].vi_;
+
31  }
+
32  template <int R, int C>
+
33  dot_self_vari(const Eigen::Matrix<var,R,C>& v) :
+
34  vari(var_dot_self(v)), size_(v.size()) {
+
35  v_ = (vari**) memalloc_.alloc(size_ * sizeof(vari*));
+
36  for (size_t i = 0; i < size_; ++i)
+
37  v_[i] = v(i).vi_;
+
38  }
+
39  inline static double square(double x) { return x * x; }
+
40  inline static double var_dot_self(vari** v, size_t size) {
+
41  double sum = 0.0;
+
42  for (size_t i = 0; i < size; ++i)
+
43  sum += square(v[i]->val_);
+
44  return sum;
+
45  }
+
46  template<typename Derived>
+
47  double var_dot_self(const Eigen::DenseBase<Derived> &v) {
+
48  double sum = 0.0;
+
49  for (int i = 0; i < v.size(); ++i)
+
50  sum += square(v(i).vi_->val_);
+
51  return sum;
+
52  }
+
53  template <int R, int C>
+
54  inline static double var_dot_self(const Eigen::Matrix<var,R,C> &v) {
+
55  double sum = 0.0;
+
56  for (int i = 0; i < v.size(); ++i)
+
57  sum += square(v(i).vi_->val_);
+
58  return sum;
+
59  }
+
60  virtual void chain() {
+
61  for (size_t i = 0; i < size_; ++i)
+
62  v_[i]->adj_ += adj_ * 2.0 * v_[i]->val_;
+
63  }
+
64  };
+
65  }
+
76  template<int R, int C>
+
77  inline var dot_self(const Eigen::Matrix<var, R, C>& v) {
+
78  stan::math::validate_vector(v,"dot_self");
+
79  return var(new dot_self_vari(v));
+
80  }
+
81 
+
87  template<int R,int C>
+
88  inline Eigen::Matrix<var,1,C>
+
89  columns_dot_self(const Eigen::Matrix<var,R,C>& x) {
+
90  Eigen::Matrix<var,1,C> ret(1,x.cols());
+
91  for (size_type i = 0; i < x.cols(); i++) {
+
92  ret(i) = var(new dot_self_vari(x.col(i)));
+
93  }
+
94  return ret;
+
95  }
+
96 
+
97 
+
98  }
+
99 }
+
100 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2ldlt_8hpp.html b/doc/api/html/agrad_2rev_2matrix_2ldlt_8hpp.html new file mode 100644 index 00000000000..7791945a586 --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2ldlt_8hpp.html @@ -0,0 +1,411 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/ldlt.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
ldlt.hpp File Reference
+
+
+
#include <vector>
+#include <boost/type_traits.hpp>
+#include <boost/utility/enable_if.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/typedefs.hpp>
+#include <stan/math/matrix/validate_multiplicable.hpp>
+#include <stan/math/matrix/validate_square.hpp>
+#include <stan/math/matrix/ldlt.hpp>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/matrix/typedefs.hpp>
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  stan::math::LDLT_factor< stan::agrad::var, R, C >
 
+ + + + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + + + + + + + + + + + + + +

+Functions

template<int R, int C>
var stan::agrad::log_determinant_ldlt (stan::math::LDLT_factor< var, R, C > &A)
 
template<int R1, int C1, int R2, int C2>
Eigen::Matrix< var, R1, C2 > stan::agrad::mdivide_left_ldlt (const stan::math::LDLT_factor< var, R1, C1 > &A, const Eigen::Matrix< var, R2, C2 > &b)
 
template<int R1, int C1, int R2, int C2>
Eigen::Matrix< var, R1, C2 > stan::agrad::mdivide_left_ldlt (const stan::math::LDLT_factor< var, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)
 
template<int R1, int C1, int R2, int C2>
Eigen::Matrix< var, R1, C2 > stan::agrad::mdivide_left_ldlt (const stan::math::LDLT_factor< double, R1, C1 > &A, const Eigen::Matrix< var, R2, C2 > &b)
 
template<typename T1 , int R1, int C1, typename T2 , int R2, int C2, typename T3 , int R3, int C3>
boost::enable_if_c
+< boost::is_same< T1, var >
+::value||boost::is_same< T2,
+var >::value||boost::is_same
+< T3, var >::value, var >
+::type 
stan::agrad::trace_inv_quad_form_ldlt (const Eigen::Matrix< T1, R1, C1 > &D, const stan::math::LDLT_factor< T2, R2, C2 > &A, const Eigen::Matrix< T3, R3, C3 > &B)
 Compute the trace of an inverse quadratic form.
 
template<typename T2 , int R2, int C2, typename T3 , int R3, int C3>
boost::enable_if_c
+< boost::is_same< T2, var >
+::value||boost::is_same< T3,
+var >::value, var >::type 
stan::agrad::trace_inv_quad_form_ldlt (const stan::math::LDLT_factor< T2, R2, C2 > &A, const Eigen::Matrix< T3, R3, C3 > &B)
 Compute the trace of an inverse quadratic form.
 
+

Variable Documentation

+ +
+
+ + + + +
mdivide_left_ldlt_alloc<R1,C1,R2,C2>* _alloc
+
+ +

Definition at line 134 of file ldlt.hpp.

+ +
+
+ +
+
+ + + + +
const LDLT_alloc<R1,C1>* _alloc_ldlt
+
+ +

Definition at line 115 of file ldlt.hpp.

+ +
+
+ +
+
+ + + + +
trace_inv_quad_form_ldlt_impl<T2,R2,C2,T3,R3,C3>* _impl
+
+ +

Definition at line 492 of file ldlt.hpp.

+ +
+
+ +
+
+ + + + +
stan::math::LDLT_factor<T2,R2,C2> _ldlt
+
+ +

Definition at line 46 of file ldlt.hpp.

+ +
+
+ +
+
+ + + + +
boost::shared_ptr< Eigen::LDLT< Eigen::Matrix<double,R1,C1> > > _ldltP
+
+ +

Definition at line 123 of file ldlt.hpp.

+ +
+
+ +
+
+ + + + +
double _value
+
+ +

Definition at line 435 of file ldlt.hpp.

+ +
+
+ +
+
+ + + + +
Eigen::Matrix<vari*,R,C> _variA
+
+ +

Definition at line 47 of file ldlt.hpp.

+ +
+
+ +
+
+ + + + +
Eigen::Matrix<vari*,R3,C3> _variB
+
+ +

Definition at line 432 of file ldlt.hpp.

+ +
+
+ +
+
+ + + + +
Eigen::Matrix<vari*,Eigen::Dynamic,Eigen::Dynamic> _variD
+
+ +

Definition at line 431 of file ldlt.hpp.

+ +
+
+ +
+
+ + + + +
vari** _variRefB
+
+ +

Definition at line 132 of file ldlt.hpp.

+ +
+
+ +
+
+ + + + +
vari** _variRefC
+
+ +

Definition at line 133 of file ldlt.hpp.

+ +
+
+ +
+
+ + + + +
Eigen::Matrix<double,R3,C3> AinvB_
+
+ +

Definition at line 433 of file ldlt.hpp.

+ +
+
+ +
+
+ + + + +
Eigen::Matrix<double,C3,C3> C_
+
+ +

Definition at line 124 of file ldlt.hpp.

+ +
+
+ +
+
+ + + + +
Eigen::Matrix<double,Eigen::Dynamic,Eigen::Dynamic> D_
+
+ +

Definition at line 430 of file ldlt.hpp.

+ +
+
+ +
+
+ + + + +
const int Dtype_
+
+ +

Definition at line 428 of file ldlt.hpp.

+ +
+
+ +
+
+ + + + +
int M_
+
+ +

Definition at line 130 of file ldlt.hpp.

+ +
+
+ +
+
+ + + + +
int N_
+
+ +

Definition at line 45 of file ldlt.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2ldlt_8hpp_source.html b/doc/api/html/agrad_2rev_2matrix_2ldlt_8hpp_source.html new file mode 100644 index 00000000000..3abd5b9dd2e --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2ldlt_8hpp_source.html @@ -0,0 +1,636 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/ldlt.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
ldlt.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__LDLT_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__LDLT_HPP__
+
3 
+
4 #include <vector>
+
5 #include <boost/type_traits.hpp>
+
6 #include <boost/utility/enable_if.hpp>
+ + + + + +
12 #include <stan/agrad/rev/var.hpp>
+ +
14 
+
15 namespace stan {
+
16  namespace agrad {
+
17  namespace {
+
18  template<int R, int C>
+
19  class LDLT_alloc : public chainable_alloc {
+
20  public:
+
21  LDLT_alloc() : N_(0) {}
+
22  LDLT_alloc(const Eigen::Matrix<var,R,C> &A) : N_(0) {
+
23  compute(A);
+
24  }
+
25 
+
26  inline void compute(const Eigen::Matrix<var,R,C> &A) {
+
27  Eigen::Matrix<double,R,C> Ad(A.rows(),A.cols());
+
28 
+
29  N_ = A.rows();
+
30  _variA.resize(A.rows(),A.cols());
+
31 
+
32  for (size_t j = 0; j < N_; j++) {
+
33  for (size_t i = 0; i < N_; i++) {
+
34  Ad(i,j) = A(i,j).val();
+
35  _variA(i,j) = A(i,j).vi_;
+
36  }
+
37  }
+
38 
+
39  _ldlt.compute(Ad);
+
40  }
+
41  inline double log_abs_det() const {
+
42  return _ldlt.vectorD().array().log().sum();
+
43  }
+
44 
+
45  size_t N_;
+
46  Eigen::LDLT< Eigen::Matrix<double,R,C> > _ldlt;
+
47  Eigen::Matrix<vari*,R,C> _variA;
+
48  };
+
49  }
+
50  }
+
51 }
+
52 
+
53 namespace stan {
+
54  namespace math {
+
55  template<int R, int C>
+
56  class LDLT_factor<stan::agrad::var,R,C> {
+
57  public:
+
58  LDLT_factor() : _alloc(new stan::agrad::LDLT_alloc<R,C>()) {}
+
59  LDLT_factor(const Eigen::Matrix<stan::agrad::var,R,C> &A) : _alloc(new stan::agrad::LDLT_alloc<R,C>(A)) { }
+
60 
+
61  inline void compute(const Eigen::Matrix<stan::agrad::var,R,C> &A) {
+
62  stan::math::validate_square(A,"LDLT_factor<var>::compute");
+
63  _alloc->compute(A);
+
64  }
+
65 
+
66 
+
67  template<typename Rhs>
+
68  inline const Eigen::internal::solve_retval<Eigen::LDLT< Eigen::Matrix<double,R,C> >, Rhs>
+
69  solve(const Eigen::MatrixBase<Rhs>& b) const {
+
70  return _alloc->_ldlt.solve(b);
+
71  }
+
72 
+
73  inline bool success() const {
+
74  bool ret;
+
75  ret = _alloc->_ldlt.info() == Eigen::Success;
+
76  ret = ret && _alloc->_ldlt.isPositive();
+
77  ret = ret && (_alloc->_ldlt.vectorD().array() > 0).all();
+
78  return ret;
+
79  }
+
80 
+
81  inline size_t rows() const { return _alloc->N_; }
+
82  inline size_t cols() const { return _alloc->N_; }
+
83 
+
84  typedef size_t size_type;
+
85 
+
86  stan::agrad::LDLT_alloc<R,C> *_alloc;
+
87  };
+
88  }
+
89 }
+
90 
+
91 namespace stan {
+
92  namespace agrad {
+
93  namespace {
+
94  template<int R,int C>
+
95  class log_det_ldlt_vari : public vari {
+
96  public:
+
97  log_det_ldlt_vari(const stan::math::LDLT_factor<var,R,C> &A)
+
98  : vari(A._alloc->log_abs_det()), _alloc_ldlt(A._alloc)
+
99  { }
+
100 
+
101  virtual void chain() {
+
102  Eigen::Matrix<double,R,C> invA;
+
103 
+
104  // If we start computing Jacobians, this may be a bit inefficient
+
105  invA.setIdentity(_alloc_ldlt->N_, _alloc_ldlt->N_);
+
106  _alloc_ldlt->_ldlt.solveInPlace(invA);
+
107 
+
108  for (size_t j = 0; j < _alloc_ldlt->N_; j++) {
+
109  for (size_t i = 0; i < _alloc_ldlt->N_; i++) {
+
110  _alloc_ldlt->_variA(i,j)->adj_ += adj_ * invA(i,j);
+
111  }
+
112  }
+
113  }
+
114 
+
115  const LDLT_alloc<R,C> *_alloc_ldlt;
+
116  };
+
117 
+
118  template <int R1,int C1,int R2,int C2>
+
119  class mdivide_left_ldlt_alloc : public chainable_alloc {
+
120  public:
+
121  virtual ~mdivide_left_ldlt_alloc() {}
+
122 
+
123  boost::shared_ptr< Eigen::LDLT< Eigen::Matrix<double,R1,C1> > > _ldltP;
+
124  Eigen::Matrix<double,R2,C2> C_;
+
125  };
+
126 
+
127  template <int R1,int C1,int R2,int C2>
+
128  class mdivide_left_ldlt_vv_vari : public vari {
+
129  public:
+
130  int M_; // A.rows() = A.cols() = B.rows()
+
131  int N_; // B.cols()
+
132  vari** _variRefB;
+
133  vari** _variRefC;
+
134  mdivide_left_ldlt_alloc<R1,C1,R2,C2> *_alloc;
+
135  const LDLT_alloc<R1,C1> *_alloc_ldlt;
+
136 
+
137  mdivide_left_ldlt_vv_vari(const stan::math::LDLT_factor<var,R1,C1> &A,
+
138  const Eigen::Matrix<var,R2,C2> &B)
+
139  : vari(0.0),
+
140  M_(A.rows()),
+
141  N_(B.cols()),
+
142  _variRefB((vari**)stan::agrad::memalloc_.alloc(sizeof(vari*)
+
143  * B.rows() * B.cols())),
+
144  _variRefC((vari**)stan::agrad::memalloc_.alloc(sizeof(vari*)
+
145  * B.rows() * B.cols())),
+
146  _alloc(new mdivide_left_ldlt_alloc<R1,C1,R2,C2>()),
+ +
148  {
+
149  size_t pos = 0;
+
150  _alloc->C_.resize(M_,N_);
+
151  for (size_type j = 0; j < N_; j++) {
+
152  for (size_type i = 0; i < M_; i++) {
+
153  _variRefB[pos] = B(i,j).vi_;
+
154  _alloc->C_(i,j) = B(i,j).val();
+
155  pos++;
+
156  }
+
157  }
+
158 
+
159  _alloc_ldlt->_ldlt.solveInPlace(_alloc->C_);
+
160 
+
161  pos = 0;
+
162  for (size_type j = 0; j < N_; j++) {
+
163  for (size_type i = 0; i < M_; i++) {
+
164  _variRefC[pos] = new vari(_alloc->C_(i,j),false);
+
165  pos++;
+
166  }
+
167  }
+
168  }
+
169 
+
170  virtual void chain() {
+
171  Eigen::Matrix<double,R1,C1> adjA(M_,M_);
+
172  Eigen::Matrix<double,R2,C2> adjB(M_,N_);
+
173 
+
174  size_t pos = 0;
+
175  for (size_type j = 0; j < N_; j++)
+
176  for (size_type i = 0; i < M_; i++)
+
177  adjB(i,j) = _variRefC[pos++]->adj_;
+
178 
+
179  _alloc_ldlt->_ldlt.solveInPlace(adjB);
+
180  adjA.noalias() = -adjB * _alloc->C_.transpose();
+
181 
+
182  for (size_type j = 0; j < M_; j++)
+
183  for (size_type i = 0; i < M_; i++)
+
184  _alloc_ldlt->_variA(i,j)->adj_ += adjA(i,j);
+
185 
+
186  pos = 0;
+
187  for (size_type j = 0; j < N_; j++)
+
188  for (size_type i = 0; i < M_; i++)
+
189  _variRefB[pos++]->adj_ += adjB(i,j);
+
190  }
+
191  };
+
192 
+
193  template <int R1,int C1,int R2,int C2>
+
194  class mdivide_left_ldlt_dv_vari : public vari {
+
195  public:
+
196  int M_; // A.rows() = A.cols() = B.rows()
+
197  int N_; // B.cols()
+
198  vari** _variRefB;
+
199  vari** _variRefC;
+
200  mdivide_left_ldlt_alloc<R1,C1,R2,C2> *_alloc;
+
201 
+
202  mdivide_left_ldlt_dv_vari(const stan::math::LDLT_factor<double,R1,C1> &A,
+
203  const Eigen::Matrix<var,R2,C2> &B)
+
204  : vari(0.0),
+
205  M_(A.rows()),
+
206  N_(B.cols()),
+
207  _variRefB((vari**)stan::agrad::memalloc_.alloc(sizeof(vari*)
+
208  * B.rows() * B.cols())),
+
209  _variRefC((vari**)stan::agrad::memalloc_.alloc(sizeof(vari*)
+
210  * B.rows() * B.cols())),
+
211  _alloc(new mdivide_left_ldlt_alloc<R1,C1,R2,C2>())
+
212  {
+
213  using Eigen::Matrix;
+
214  using Eigen::Map;
+
215 
+
216  size_t pos = 0;
+
217  _alloc->C_.resize(M_,N_);
+
218  for (size_type j = 0; j < N_; j++) {
+
219  for (size_type i = 0; i < M_; i++) {
+
220  _variRefB[pos] = B(i,j).vi_;
+
221  _alloc->C_(i,j) = B(i,j).val();
+
222  pos++;
+
223  }
+
224  }
+
225 
+
226  _alloc->_ldltP = A._ldltP;
+
227  _alloc->_ldltP->solveInPlace(_alloc->C_);
+
228 
+
229  pos = 0;
+
230  for (size_type j = 0; j < N_; j++) {
+
231  for (size_type i = 0; i < M_; i++) {
+
232  _variRefC[pos] = new vari(_alloc->C_(i,j),false);
+
233  pos++;
+
234  }
+
235  }
+
236  }
+
237 
+
238  virtual void chain() {
+
239  Eigen::Matrix<double,R2,C2> adjB(M_,N_);
+
240 
+
241  size_t pos = 0;
+
242  for (size_type j = 0; j < adjB.cols(); j++)
+
243  for (size_type i = 0; i < adjB.rows(); i++)
+
244  adjB(i,j) = _variRefC[pos++]->adj_;
+
245 
+
246  _alloc->_ldltP->solveInPlace(adjB);
+
247 
+
248  pos = 0;
+
249  for (size_type j = 0; j < adjB.cols(); j++)
+
250  for (size_type i = 0; i < adjB.rows(); i++)
+
251  _variRefB[pos++]->adj_ += adjB(i,j);
+
252  }
+
253  };
+
254 
+
255  template <int R1,int C1,int R2,int C2>
+
256  class mdivide_left_ldlt_vd_vari : public vari {
+
257  public:
+
258  int M_; // A.rows() = A.cols() = B.rows()
+
259  int N_; // B.cols()
+
260  vari** _variRefC;
+
261  mdivide_left_ldlt_alloc<R1,C1,R2,C2> *_alloc;
+
262  const LDLT_alloc<R1,C1> *_alloc_ldlt;
+
263 
+
264  mdivide_left_ldlt_vd_vari(const stan::math::LDLT_factor<var,R1,C1> &A,
+
265  const Eigen::Matrix<double,R2,C2> &B)
+
266  : vari(0.0),
+
267  M_(A.rows()),
+
268  N_(B.cols()),
+
269  _variRefC((vari**)stan::agrad::memalloc_.alloc(sizeof(vari*)
+
270  * B.rows() * B.cols())),
+
271  _alloc(new mdivide_left_ldlt_alloc<R1,C1,R2,C2>()),
+ +
273  {
+
274  _alloc->C_ = B;
+
275  _alloc_ldlt->_ldlt.solveInPlace(_alloc->C_);
+
276 
+
277  size_t pos = 0;
+
278  for (size_type j = 0; j < N_; j++) {
+
279  for (size_type i = 0; i < M_; i++) {
+
280  _variRefC[pos] = new vari(_alloc->C_(i,j),false);
+
281  pos++;
+
282  }
+
283  }
+
284  }
+
285 
+
286  virtual void chain() {
+
287  Eigen::Matrix<double,R1,C1> adjA(M_,M_);
+
288  Eigen::Matrix<double,R1,C2> adjC(M_,N_);
+
289 
+
290  size_t pos = 0;
+
291  for (size_type j = 0; j < adjC.cols(); j++)
+
292  for (size_type i = 0; i < adjC.rows(); i++)
+
293  adjC(i,j) = _variRefC[pos++]->adj_;
+
294 
+
295  adjA = -_alloc_ldlt->_ldlt.solve(adjC*_alloc->C_.transpose());
+
296 
+
297  for (size_type j = 0; j < adjA.cols(); j++)
+
298  for (size_type i = 0; i < adjA.rows(); i++)
+
299  _alloc_ldlt->_variA(i,j)->adj_ += adjA(i,j);
+
300  }
+
301  };
+
302  }
+
303 
+
304  template<int R, int C>
+
305  var log_determinant_ldlt(stan::math::LDLT_factor<var,R,C> &A) {
+
306  return var(new log_det_ldlt_vari<R,C>(A));
+
307  }
+
308 
+
309  template <int R1,int C1,int R2,int C2>
+
310  inline Eigen::Matrix<var,R1,C2>
+
311  mdivide_left_ldlt(const stan::math::LDLT_factor<var,R1,C1> &A,
+
312  const Eigen::Matrix<var,R2,C2> &b) {
+
313  Eigen::Matrix<var,R1,C2> res(b.rows(),b.cols());
+
314 
+
315  stan::math::validate_multiplicable(A,b,"mdivide_left_ldlt");
+
316 
+
317  mdivide_left_ldlt_vv_vari<R1,C1,R2,C2> *baseVari = new mdivide_left_ldlt_vv_vari<R1,C1,R2,C2>(A,b);
+
318 
+
319  size_t pos = 0;
+
320  for (size_type j = 0; j < res.cols(); j++)
+
321  for (size_type i = 0; i < res.rows(); i++)
+
322  res(i,j).vi_ = baseVari->_variRefC[pos++];
+
323 
+
324  return res;
+
325  }
+
326 
+
327  template <int R1,int C1,int R2,int C2>
+
328  inline Eigen::Matrix<var,R1,C2>
+
329  mdivide_left_ldlt(const stan::math::LDLT_factor<var,R1,C1> &A,
+
330  const Eigen::Matrix<double,R2,C2> &b) {
+
331  Eigen::Matrix<var,R1,C2> res(b.rows(),b.cols());
+
332 
+
333  stan::math::validate_multiplicable(A,b,"mdivide_left_ldlt");
+
334 
+
335  mdivide_left_ldlt_vd_vari<R1,C1,R2,C2> *baseVari = new mdivide_left_ldlt_vd_vari<R1,C1,R2,C2>(A,b);
+
336 
+
337  size_t pos = 0;
+
338  for (size_type j = 0; j < res.cols(); j++)
+
339  for (size_type i = 0; i < res.rows(); i++)
+
340  res(i,j).vi_ = baseVari->_variRefC[pos++];
+
341 
+
342  return res;
+
343  }
+
344 
+
345  template <int R1,int C1,int R2,int C2>
+
346  inline Eigen::Matrix<var,R1,C2>
+
347  mdivide_left_ldlt(const stan::math::LDLT_factor<double,R1,C1> &A,
+
348  const Eigen::Matrix<var,R2,C2> &b) {
+
349  Eigen::Matrix<var,R1,C2> res(b.rows(),b.cols());
+
350 
+
351  stan::math::validate_multiplicable(A,b,"mdivide_left_ldlt");
+
352 
+
353  mdivide_left_ldlt_dv_vari<R1,C1,R2,C2> *baseVari = new mdivide_left_ldlt_dv_vari<R1,C1,R2,C2>(A,b);
+
354 
+
355  size_t pos = 0;
+
356  for (size_type j = 0; j < res.cols(); j++)
+
357  for (size_type i = 0; i < res.rows(); i++)
+
358  res(i,j).vi_ = baseVari->_variRefC[pos++];
+
359 
+
360  return res;
+
361  }
+
362 
+
363  namespace {
+
364  template <typename T2, int R2,int C2,typename T3,int R3,int C3>
+
365  class trace_inv_quad_form_ldlt_impl : public chainable_alloc {
+
366  protected:
+
367  inline void initializeB(const Eigen::Matrix<var,R3,C3> &B,bool haveD) {
+
368  Eigen::Matrix<double,R3,C3> Bd(B.rows(),B.cols());
+
369  _variB.resize(B.rows(),B.cols());
+
370  for (int j = 0; j < B.cols(); j++) {
+
371  for (int i = 0; i < B.rows(); i++) {
+
372  _variB(i,j) = B(i,j).vi_;
+
373  Bd(i,j) = B(i,j).val();
+
374  }
+
375  }
+
376  AinvB_ = _ldlt.solve(Bd);
+
377  if (haveD)
+
378  C_.noalias() = Bd.transpose()*AinvB_;
+
379  else
+
380  _value = (Bd.transpose()*AinvB_).trace();
+
381  }
+
382  inline void initializeB(const Eigen::Matrix<double,R3,C3> &B,bool haveD) {
+
383  AinvB_ = _ldlt.solve(B);
+
384  if (haveD)
+
385  C_.noalias() = B.transpose()*AinvB_;
+
386  else
+
387  _value = (B.transpose()*AinvB_).trace();
+
388  }
+
389 
+
390  template<int R1,int C1>
+
391  inline void initializeD(const Eigen::Matrix<var,R1,C1> &D) {
+
392  D_.resize(D.rows(),D.cols());
+
393  _variD.resize(D.rows(),D.cols());
+
394  for (size_t j = 0; j < D.cols(); j++) {
+
395  for (size_t i = 0; i < D.rows(); i++) {
+
396  _variD(i,j) = D(i,j).vi_;
+
397  D_(i,j) = D(i,j).val();
+
398  }
+
399  }
+
400  }
+
401  template<int R1,int C1>
+
402  inline void initializeD(const Eigen::Matrix<double,R1,C1> &D) {
+
403  D_ = D;
+
404  }
+
405 
+
406  public:
+
407  template<typename T1, int R1,int C1>
+
408  trace_inv_quad_form_ldlt_impl(const Eigen::Matrix<T1,R1,C1> &D,
+
409  const stan::math::LDLT_factor<T2,R2,C2> &A,
+
410  const Eigen::Matrix<T3,R3,C3> &B)
+
411  : Dtype_(boost::is_same<T1,var>::value?1:0),
+
412  _ldlt(A)
+
413  {
+
414  initializeB(B,true);
+
415  initializeD(D);
+
416 
+
417  _value = (D_*C_).trace();
+
418  }
+
419 
+
420  trace_inv_quad_form_ldlt_impl(const stan::math::LDLT_factor<T2,R2,C2> &A,
+
421  const Eigen::Matrix<T3,R3,C3> &B)
+
422  : Dtype_(2),
+
423  _ldlt(A)
+
424  {
+
425  initializeB(B,false);
+
426  }
+
427 
+
428  const int Dtype_; // 0 = double, 1 = var, 2 = missing
+
429  stan::math::LDLT_factor<T2,R2,C2> _ldlt;
+
430  Eigen::Matrix<double,Eigen::Dynamic,Eigen::Dynamic> D_;
+
431  Eigen::Matrix<vari*,Eigen::Dynamic,Eigen::Dynamic> _variD;
+
432  Eigen::Matrix<vari*,R3,C3> _variB;
+
433  Eigen::Matrix<double,R3,C3> AinvB_;
+
434  Eigen::Matrix<double,C3,C3> C_;
+
435  double _value;
+
436  };
+
437 
+
438  template <typename T2,int R2,int C2,typename T3,int R3,int C3>
+
439  class trace_inv_quad_form_ldlt_vari : public vari {
+
440  protected:
+
441  static inline void chainA(const double &adj,
+
442  trace_inv_quad_form_ldlt_impl<double,R2,C2,T3,R3,C3> *impl) {
+
443  }
+
444  static inline void chainB(const double &adj,
+
445  trace_inv_quad_form_ldlt_impl<T2,R2,C2,double,R3,C3> *impl) {
+
446  }
+
447 
+
448  static inline void chainA(const double &adj,
+
449  trace_inv_quad_form_ldlt_impl<var,R2,C2,T3,R3,C3> *impl) {
+
450  Eigen::Matrix<double,R2,C2> aA;
+
451  if (impl->Dtype_ != 2)
+
452  aA.noalias() = -adj*(impl->AinvB_*impl->D_.transpose()*impl->AinvB_.transpose());
+
453  else
+
454  aA.noalias() = -adj*(impl->AinvB_*impl->AinvB_.transpose());
+
455  for (size_type j = 0; j < aA.cols(); j++)
+
456  for (size_type i = 0; i < aA.rows(); i++)
+
457  impl->_ldlt._alloc->_variA(i,j)->adj_ += aA(i,j);
+
458  }
+
459  static inline void chainB(const double &adj,
+
460  trace_inv_quad_form_ldlt_impl<T2,R2,C2,var,R3,C3> *impl) {
+
461  Eigen::Matrix<double,R3,C3> aB;
+
462  if (impl->Dtype_ != 2)
+
463  aB.noalias() = adj*impl->AinvB_*(impl->D_ + impl->D_.transpose());
+
464  else
+
465  aB.noalias() = adj*impl->AinvB_;
+
466  for (size_type j = 0; j < aB.cols(); j++)
+
467  for (size_type i = 0; i < aB.rows(); i++)
+
468  impl->_variB(i,j)->adj_ += aB(i,j);
+
469  }
+
470 
+
471  public:
+
472  trace_inv_quad_form_ldlt_vari(trace_inv_quad_form_ldlt_impl<T2,R2,C2,T3,R3,C3> *impl)
+
473  : vari(impl->_value), _impl(impl)
+
474  {}
+
475 
+
476  virtual void chain() {
+
477  // F = trace(D * B' * inv(A) * B)
+
478  // aA = -aF * inv(A') * B * D' * B' * inv(A')
+
479  // aB = aF*(inv(A) * B * D + inv(A') * B * D')
+
480  // aD = aF*(B' * inv(A) * B)
+
481  chainA(adj_, _impl);
+
482 
+
483  chainB(adj_, _impl);
+
484 
+
485  if (_impl->Dtype_ == 1) {
+
486  for (size_type j = 0; j < _impl->_variD.cols(); j++)
+
487  for (size_type i = 0; i < _impl->_variD.rows(); i++)
+
488  _impl->_variD(i,j)->adj_ += adj_*_impl->C_(i,j);
+
489  }
+
490  }
+
491 
+
492  trace_inv_quad_form_ldlt_impl<T2,R2,C2,T3,R3,C3> *_impl;
+
493  };
+
494  }
+
495 
+
501  template <typename T1,int R1,int C1,typename T2,int R2,int C2,typename T3,int R3,int C3>
+
502  inline typename
+
503  boost::enable_if_c<boost::is_same<T1,var>::value ||
+
504  boost::is_same<T2,var>::value ||
+
505  boost::is_same<T3,var>::value, var>::type
+
506  trace_inv_quad_form_ldlt(const Eigen::Matrix<T1,R1,C1> &D,
+
507  const stan::math::LDLT_factor<T2,R2,C2> &A,
+
508  const Eigen::Matrix<T3,R3,C3> &B)
+
509  {
+
510  stan::math::validate_square(D,"trace_inv_quad_form_ldlt");
+
511  stan::math::validate_multiplicable(A,B,"trace_inv_quad_form_ldlt");
+
512  stan::math::validate_multiplicable(B,D,"trace_inv_quad_form_ldlt");
+
513 
+
514  trace_inv_quad_form_ldlt_impl<T2,R2,C2,T3,R3,C3> *_impl = new trace_inv_quad_form_ldlt_impl<T2,R2,C2,T3,R3,C3>(D,A,B);
+
515 
+
516  return var(new trace_inv_quad_form_ldlt_vari<T2,R2,C2,T3,R3,C3>(_impl));
+
517  }
+
518 
+
524  template <typename T2,int R2,int C2,typename T3,int R3,int C3>
+
525  inline typename
+
526  boost::enable_if_c<boost::is_same<T2,var>::value ||
+
527  boost::is_same<T3,var>::value, var>::type
+
528  trace_inv_quad_form_ldlt(const stan::math::LDLT_factor<T2,R2,C2> &A,
+
529  const Eigen::Matrix<T3,R3,C3> &B)
+
530  {
+
531  stan::math::validate_multiplicable(A,B,"trace_inv_quad_form_ldlt");
+
532 
+
533  trace_inv_quad_form_ldlt_impl<T2,R2,C2,T3,R3,C3> *_impl = new trace_inv_quad_form_ldlt_impl<T2,R2,C2,T3,R3,C3>(A,B);
+
534 
+
535  return var(new trace_inv_quad_form_ldlt_vari<T2,R2,C2,T3,R3,C3>(_impl));
+
536  }
+
537  }
+
538 }
+
539 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2log__determinant_8hpp.html b/doc/api/html/agrad_2rev_2matrix_2log__determinant_8hpp.html new file mode 100644 index 00000000000..17c4236dcbb --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2log__determinant_8hpp.html @@ -0,0 +1,201 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/log_determinant.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log_determinant.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<int R, int C>
var stan::agrad::log_determinant (const Eigen::Matrix< var, R, C > &m)
 
+

Variable Documentation

+ +
+
+ + + + +
vari** _adjARef
+
+ +

Definition at line 24 of file log_determinant.hpp.

+ +
+
+ +
+
+ + + + +
int _cols
+
+ +

Definition at line 22 of file log_determinant.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
int _rows
+
+static
+
+ +

Definition at line 21 of file log_determinant.hpp.

+ +
+
+ +
+
+ + + + +
double* A_
+
+ +

Definition at line 23 of file log_determinant.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2log__determinant_8hpp_source.html b/doc/api/html/agrad_2rev_2matrix_2log__determinant_8hpp_source.html new file mode 100644 index 00000000000..6e564c9f5fa --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2log__determinant_8hpp_source.html @@ -0,0 +1,184 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/log_determinant.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log_determinant.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__LOG_DETERMINANT_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__LOG_DETERMINANT_HPP__
+
3 
+
4 #include <vector>
+ + + + +
9 #include <stan/agrad/rev/var.hpp>
+ +
11 
+
12 // FIXME: use explicit files
+
13 #include <stan/agrad/rev.hpp>
+
14 
+
15 namespace stan {
+
16  namespace agrad {
+
17 
+
18  namespace {
+
19  template<int R,int C>
+
20  class log_determinant_vari : public vari {
+
21  int _rows;
+
22  int _cols;
+
23  double* A_;
+
24  vari** _adjARef;
+
25  public:
+
26  log_determinant_vari(const Eigen::Matrix<var,R,C> &A)
+
27  : vari(log_determinant_vari_calc(A)),
+
28  _rows(A.rows()),
+
29  _cols(A.cols()),
+
30  A_((double*)stan::agrad::memalloc_.alloc(sizeof(double)
+
31  * A.rows() * A.cols())),
+
32  _adjARef((vari**)stan::agrad::memalloc_.alloc(sizeof(vari*)
+
33  * A.rows() * A.cols()))
+
34  {
+
35  size_t pos = 0;
+
36  for (size_type j = 0; j < _cols; j++) {
+
37  for (size_type i = 0; i < _rows; i++) {
+
38  A_[pos] = A(i,j).val();
+
39  _adjARef[pos++] = A(i,j).vi_;
+
40  }
+
41  }
+
42  }
+
43  static
+
44  double log_determinant_vari_calc(const Eigen::Matrix<var,R,C> &A)
+
45  {
+
46  Eigen::Matrix<double,R,C> Ad(A.rows(),A.cols());
+
47  for (size_type j = 0; j < A.cols(); j++)
+
48  for (size_type i = 0; i < A.rows(); i++)
+
49  Ad(i,j) = A(i,j).val();
+
50  return Ad.fullPivHouseholderQr().logAbsDeterminant();
+
51  }
+
52  virtual void chain() {
+
53  using Eigen::Matrix;
+
54  using Eigen::Map;
+
55  Matrix<double,R,C> adjA(_rows,_cols);
+
56  adjA = adj_
+
57  * Map<Matrix<double,R,C> >(A_,_rows,_cols)
+
58  .inverse().transpose();
+
59  size_t pos = 0;
+
60  for (size_type j = 0; j < _cols; j++) {
+
61  for (size_type i = 0; i < _rows; i++) {
+
62  _adjARef[pos++]->adj_ += adjA(i,j);
+
63  }
+
64  }
+
65  }
+
66  };
+
67  }
+
68 
+
69  template <int R, int C>
+
70  inline var log_determinant(const Eigen::Matrix<var,R,C>& m) {
+
71  stan::math::validate_square(m,"log_determinant");
+
72  return var(new log_determinant_vari<R,C>(m));
+
73  }
+
74 
+
75  }
+
76 }
+
77 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2log__determinant__spd_8hpp.html b/doc/api/html/agrad_2rev_2matrix_2log__determinant__spd_8hpp.html new file mode 100644 index 00000000000..048a3656e98 --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2log__determinant__spd_8hpp.html @@ -0,0 +1,208 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/log_determinant_spd.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log_determinant_spd.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<int R, int C>
var stan::agrad::log_determinant_spd (const Eigen::Matrix< var, R, C > &m)
 
+

Variable Documentation

+ +
+
+ + + + +
vari** _adjARef
+
+ +

Definition at line 34 of file log_determinant_spd.hpp.

+ +
+
+ +
+
+ + + + +
log_determinant_spd_alloc<R,C>* _alloc
+
+ +

Definition at line 31 of file log_determinant_spd.hpp.

+ +
+
+ +
+
+ + + + +
int _cols
+
+ +

Definition at line 33 of file log_determinant_spd.hpp.

+ +
+
+ +
+
+ + + + +
Eigen::Matrix<double,R,C> _invA
+
+ +

Definition at line 25 of file log_determinant_spd.hpp.

+ +
+
+ +
+
+ + + + +
int _rows
+
+ +

Definition at line 32 of file log_determinant_spd.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2log__determinant__spd_8hpp_source.html b/doc/api/html/agrad_2rev_2matrix_2log__determinant__spd_8hpp_source.html new file mode 100644 index 00000000000..2c575c5889d --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2log__determinant__spd_8hpp_source.html @@ -0,0 +1,231 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/log_determinant_spd.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log_determinant_spd.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__LOG_DETERMINANT_SPD_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__LOG_DETERMINANT_SPD_HPP__
+
3 
+
4 #include <vector>
+ + + + + +
10 #include <stan/agrad/rev/var.hpp>
+ +
12 
+
13 // FIXME: use explicit files
+
14 #include <stan/agrad/rev.hpp>
+
15 
+
16 namespace stan {
+
17  namespace agrad {
+
18 
+
19  namespace {
+
20  template <int R,int C>
+
21  class log_determinant_spd_alloc : public chainable_alloc {
+
22  public:
+
23  virtual ~log_determinant_spd_alloc() {}
+
24 
+
25  Eigen::Matrix<double,R,C> _invA;
+
26  };
+
27 
+
28 
+
29  template<int R,int C>
+
30  class log_determinant_spd_vari : public vari {
+
31  log_determinant_spd_alloc<R,C> *_alloc;
+
32  int _rows;
+
33  int _cols;
+
34  vari** _adjARef;
+
35  public:
+
36  log_determinant_spd_vari(const Eigen::Matrix<var,R,C> &A)
+
37  : vari(log_determinant_spd_vari_calc(A,&_alloc)),
+
38  _rows(A.rows()),
+
39  _cols(A.cols()),
+
40  _adjARef((vari**)stan::agrad::memalloc_.alloc(sizeof(vari*)
+
41  * A.rows() * A.cols()))
+
42  {
+
43  size_t pos = 0;
+
44  for (size_type j = 0; j < _cols; j++) {
+
45  for (size_type i = 0; i < _rows; i++) {
+
46  _adjARef[pos++] = A(i,j).vi_;
+
47  }
+
48  }
+
49  }
+
50 
+
51  static
+
52  double log_determinant_spd_vari_calc(const Eigen::Matrix<var,R,C> &A,
+
53  log_determinant_spd_alloc<R,C> **alloc)
+
54  {
+
55  using stan::math::dom_err;
+
56 
+
57  // allocate space for information needed in chain
+
58  *alloc = new log_determinant_spd_alloc<R,C>();
+
59 
+
60  // compute cholesky decomposition of A
+
61  (*alloc)->_invA.resize(A.rows(),A.cols());
+
62  for (size_type j = 0; j < A.cols(); j++)
+
63  for (size_type i = 0; i < A.rows(); i++)
+
64  (*alloc)->_invA(i,j) = A(i,j).val();
+
65  Eigen::LDLT< Eigen::Matrix<double,R,C> > ldlt((*alloc)->_invA);
+
66  if (ldlt.info() != Eigen::Success) {
+
67  // Handle this better.
+
68  (*alloc)->_invA.setZero(A.rows(),A.cols());
+
69  double y = 0;
+
70  double result = -std::numeric_limits<double>::infinity();
+
71  return dom_err("log_determinant_spd(%1%)",
+
72  y,
+
73  "matrix argument",
+
74  "failed LDLT factorization","",
+
75  &result);
+
76  }
+
77 
+
78  // compute the inverse of A (needed for the derivative)
+
79  (*alloc)->_invA.setIdentity(A.rows(),A.cols());
+
80  ldlt.solveInPlace((*alloc)->_invA);
+
81 
+
82  if (ldlt.isNegative() || (ldlt.vectorD().array() <= 1e-16).any()) {
+
83  double y = 0;
+
84  double result = -std::numeric_limits<double>::infinity();
+
85  return dom_err("log_determinant_spd(%1%)",
+
86  y,
+
87  "matrix argument",
+
88  "matrix is negative definite","",
+
89  &result);
+
90  }
+
91 
+
92  double ret = ldlt.vectorD().array().log().sum();
+
93  if (!boost::math::isfinite(ret)) {
+
94  double y = 0;
+
95  double result = -std::numeric_limits<double>::infinity();
+
96  return dom_err("log_determinant_spd(%1%)",
+
97  y,
+
98  "matrix argument",
+
99  "log determininant is infinite","",
+
100  &result);
+
101  }
+
102  return ret;
+
103  }
+
104 
+
105  virtual void chain() {
+
106  size_t pos = 0;
+
107  for (size_type j = 0; j < _cols; j++) {
+
108  for (size_type i = 0; i < _rows; i++) {
+
109  _adjARef[pos++]->adj_ += adj_*_alloc->_invA(i,j);
+
110  }
+
111  }
+
112  }
+
113  };
+
114  }
+
115 
+
116  template <int R, int C>
+
117  inline var log_determinant_spd(const Eigen::Matrix<var,R,C>& m) {
+
118  stan::math::validate_square(m,"log_determinant_spd");
+
119  return var(new log_determinant_spd_vari<R,C>(m));
+
120  }
+
121 
+
122  }
+
123 }
+
124 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2log__softmax_8hpp.html b/doc/api/html/agrad_2rev_2matrix_2log__softmax_8hpp.html new file mode 100644 index 00000000000..66f9695ce2b --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2log__softmax_8hpp.html @@ -0,0 +1,201 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/log_softmax.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log_softmax.hpp File Reference
+
+
+
#include <cmath>
+#include <vector>
+#include <stdexcept>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/log_softmax.hpp>
+#include <stan/math/matrix/softmax.hpp>
+#include <stan/agrad/rev/var.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

Eigen::Matrix< var,
+Eigen::Dynamic, 1 > 
stan::agrad::log_softmax (const Eigen::Matrix< var, Eigen::Dynamic, 1 > &alpha)
 Return the softmax of the specified Eigen vector.
 
+

Variable Documentation

+ +
+
+ + + + + +
+ + + + +
vari** alpha_
+
+static
+
+ +

Definition at line 19 of file log_softmax.hpp.

+ +
+
+ +
+
+ + + + +
const int idx_
+
+ +

Definition at line 22 of file log_softmax.hpp.

+ +
+
+ +
+
+ + + + +
const int size_
+
+ +

Definition at line 21 of file log_softmax.hpp.

+ +
+
+ +
+
+ + + + +
const double* softmax_alpha_
+
+ +

Definition at line 20 of file log_softmax.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2log__softmax_8hpp_source.html b/doc/api/html/agrad_2rev_2matrix_2log__softmax_8hpp_source.html new file mode 100644 index 00000000000..4a1f33fd50d --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2log__softmax_8hpp_source.html @@ -0,0 +1,221 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/log_softmax.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log_softmax.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__LOG_SOFTMAX_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__LOG_SOFTMAX_HPP__
+
3 
+
4 #include <cmath>
+
5 #include <vector>
+
6 #include <stdexcept>
+ + + +
10 #include <stan/agrad/rev/var.hpp>
+
11 
+
12 namespace stan {
+
13  namespace agrad {
+
14 
+
15  namespace {
+
16 
+
17  class log_softmax_elt_vari : public vari {
+
18  private:
+
19  vari** alpha_;
+
20  const double* softmax_alpha_;
+
21  const int size_; // array sizes
+
22  const int idx_; // in in softmax output
+
23  public:
+
24  log_softmax_elt_vari(double val,
+
25  vari** alpha,
+
26  const double* softmax_alpha,
+
27  int size,
+
28  int idx)
+
29  : vari(val),
+
30  alpha_(alpha),
+
31  softmax_alpha_(softmax_alpha),
+
32  size_(size),
+
33  idx_(idx) {
+
34  }
+
35  void chain() {
+
36  for (int m = 0; m < size_; ++m) {
+
37  if (m == idx_)
+
38  alpha_[m]->adj_ += adj_ * (1 - softmax_alpha_[m]);
+
39  else
+
40  alpha_[m]->adj_ -= adj_ * softmax_alpha_[m];
+
41  }
+
42  }
+
43  };
+
44 
+
45  }
+
46 
+
47 
+
58  inline Eigen::Matrix<var,Eigen::Dynamic,1>
+
59  log_softmax(const Eigen::Matrix<var,Eigen::Dynamic,1>& alpha) {
+
60  using Eigen::Matrix;
+
61  using Eigen::Dynamic;
+
62 
+
63  stan::math::validate_nonzero_size(alpha,"vector argument to var log_softmax");
+
64 
+
65  if (alpha.size() == 0)
+
66  throw std::domain_error("arg vector to log_softmax() must have size > 0");
+
67  if (alpha.size() == 0)
+
68  throw std::domain_error("arg vector to log_softmax() must have size > 0");
+
69 
+
70  if (alpha.size() == 0)
+
71  throw std::domain_error("arg vector to log_softmax() must have size > 0");
+
72 
+
73  vari** alpha_vi_array
+
74  = (vari**) operator new(sizeof(vari*) * alpha.size());
+
75  for (int i = 0; i < alpha.size(); ++i)
+
76  alpha_vi_array[i] = alpha(i).vi_;
+
77 
+
78 
+
79  Matrix<double,Dynamic,1> alpha_d(alpha.size());
+
80  for (int i = 0; i < alpha_d.size(); ++i)
+
81  alpha_d(i) = alpha(i).val();
+
82 
+
83  // fold logic of math::softmax() and math::log_softmax() to save computations
+
84 
+
85  Matrix<double,Dynamic,1> softmax_alpha_d(alpha_d.size());
+
86  Matrix<double,Dynamic,1> log_softmax_alpha_d(alpha_d.size());
+
87 
+
88  double max_v = alpha_d.maxCoeff();
+
89 
+
90  double sum = 0.0;
+
91  for (int i = 0; i < alpha_d.size(); ++i) {
+
92  softmax_alpha_d(i) = std::exp(alpha_d(i) - max_v);
+
93  sum += softmax_alpha_d(i);
+
94  }
+
95 
+
96  for (int i = 0; i < alpha_d.size(); ++i)
+
97  softmax_alpha_d(i) /= sum;
+
98  double log_sum = std::log(sum);
+
99 
+
100  for (int i = 0; i < alpha_d.size(); ++i)
+
101  log_softmax_alpha_d(i) = (alpha_d(i) - max_v) - log_sum;
+
102 
+
103  // end fold
+
104 
+
105  double* softmax_alpha_d_array
+
106  = (double*) operator new(sizeof(double) * alpha_d.size());
+
107  for (int i = 0; i < alpha_d.size(); ++i)
+
108  softmax_alpha_d_array[i] = softmax_alpha_d(i);
+
109 
+
110  Matrix<var,Dynamic,1> log_softmax_alpha(alpha.size());
+
111  for (int k = 0; k < log_softmax_alpha.size(); ++k)
+
112  log_softmax_alpha(k) = var(new log_softmax_elt_vari(log_softmax_alpha_d[k],
+
113  alpha_vi_array,
+
114  softmax_alpha_d_array,
+
115  alpha.size(),
+
116  k));
+
117  return log_softmax_alpha;
+
118  }
+
119 
+
120 
+
121  }
+
122 }
+
123 
+
124 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2log__sum__exp_8hpp.html b/doc/api/html/agrad_2rev_2matrix_2log__sum__exp_8hpp.html new file mode 100644 index 00000000000..26ccc474d9b --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2log__sum__exp_8hpp.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/log_sum_exp.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log_sum_exp.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + +

+Functions

template<int R, int C>
var stan::agrad::log_sum_exp (const Eigen::Matrix< var, R, C > &x)
 Returns the log sum of exponentials.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2log__sum__exp_8hpp_source.html b/doc/api/html/agrad_2rev_2matrix_2log__sum__exp_8hpp_source.html new file mode 100644 index 00000000000..136db49e4ce --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2log__sum__exp_8hpp_source.html @@ -0,0 +1,167 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/log_sum_exp.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log_sum_exp.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__LOG_SUM_EXP_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__LOG_SUM_EXP_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ + + + + + + + + +
14 
+
15 namespace stan {
+
16  namespace agrad {
+
17 
+
18  namespace {
+
19 
+
20  // these function and the following class just translate
+
21  // log_sum_exp for std::vector for Eigen::Matrix
+
22 
+
23  template <int R, int C>
+
24  double log_sum_exp_as_double(const Eigen::Matrix<var,R,C>& x) {
+
25  using std::numeric_limits;
+
26  using std::exp;
+
27  using std::log;
+
28  double max = -numeric_limits<double>::infinity();
+
29  for (int i = 0; i < x.size(); ++i)
+
30  if (x(i) > max)
+
31  max = x(i).val();
+
32  double sum = 0.0;
+
33  for (int i = 0; i < x.size(); ++i)
+
34  if (x(i) != -numeric_limits<double>::infinity())
+
35  sum += exp(x(i).val() - max);
+
36  return max + log(sum);
+
37  }
+
38 
+
39  class log_sum_exp_matrix_vari : public op_matrix_vari {
+
40  public:
+
41  template <int R, int C>
+
42  log_sum_exp_matrix_vari(const Eigen::Matrix<var,R,C>& x) :
+
43  op_matrix_vari(log_sum_exp_as_double(x), x) {
+
44  }
+
45  void chain() {
+
46  for (size_t i = 0; i < size_; ++i) {
+
47  vis_[i]->adj_ += adj_ * calculate_chain(vis_[i]->val_, val_);
+
48  }
+
49  }
+
50  };
+
51  }
+
52 
+
58  template <int R, int C>
+
59  inline var log_sum_exp(const Eigen::Matrix<var,R,C>& x) {
+
60  return var(new log_sum_exp_matrix_vari(x));
+
61  }
+
62 
+
63  }
+
64 }
+
65 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2mdivide__left_8hpp.html b/doc/api/html/agrad_2rev_2matrix_2mdivide__left_8hpp.html new file mode 100644 index 00000000000..45bc7007ee9 --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2mdivide__left_8hpp.html @@ -0,0 +1,248 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/mdivide_left.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
mdivide_left.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<int R1, int C1, int R2, int C2>
Eigen::Matrix< var, R1, C2 > stan::agrad::mdivide_left (const Eigen::Matrix< var, R1, C1 > &A, const Eigen::Matrix< var, R2, C2 > &b)
 
template<int R1, int C1, int R2, int C2>
Eigen::Matrix< var, R1, C2 > stan::agrad::mdivide_left (const Eigen::Matrix< var, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)
 
template<int R1, int C1, int R2, int C2>
Eigen::Matrix< var, R1, C2 > stan::agrad::mdivide_left (const Eigen::Matrix< double, R1, C1 > &A, const Eigen::Matrix< var, R2, C2 > &b)
 
+

Variable Documentation

+ +
+
+ + + + +
vari** _variRefA
+
+ +

Definition at line 23 of file mdivide_left.hpp.

+ +
+
+ +
+
+ + + + +
vari** _variRefB
+
+ +

Definition at line 24 of file mdivide_left.hpp.

+ +
+
+ +
+
+ + + + +
vari** _variRefC
+
+ +

Definition at line 25 of file mdivide_left.hpp.

+ +
+
+ +
+
+ + + + +
double* A_
+
+ +

Definition at line 21 of file mdivide_left.hpp.

+ +
+
+ +
+
+ + + + +
double* C_
+
+ +

Definition at line 22 of file mdivide_left.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
int M_
+
+static
+
+ +

Definition at line 19 of file mdivide_left.hpp.

+ +
+
+ +
+
+ + + + +
int N_
+
+ +

Definition at line 20 of file mdivide_left.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2mdivide__left_8hpp_source.html b/doc/api/html/agrad_2rev_2matrix_2mdivide__left_8hpp_source.html new file mode 100644 index 00000000000..bdf2b89b7ee --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2mdivide__left_8hpp_source.html @@ -0,0 +1,439 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/mdivide_left.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
mdivide_left.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__COLUMNS_MDIVIDE_LEFT_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__COLUMNS_MDIVIDE_LEFT_HPP__
+
3 
+
4 #include <vector>
+ + + + +
9 #include <stan/agrad/rev/var.hpp>
+ +
11 
+
12 namespace stan {
+
13  namespace agrad {
+
14 
+
15  namespace {
+
16  template <int R1,int C1,int R2,int C2>
+
17  class mdivide_left_vv_vari : public vari {
+
18  public:
+
19  int M_; // A.rows() = A.cols() = B.rows()
+
20  int N_; // B.cols()
+
21  double* A_;
+
22  double* C_;
+
23  vari** _variRefA;
+
24  vari** _variRefB;
+
25  vari** _variRefC;
+
26 
+
27  mdivide_left_vv_vari(const Eigen::Matrix<var,R1,C1> &A,
+
28  const Eigen::Matrix<var,R2,C2> &B)
+
29  : vari(0.0),
+
30  M_(A.rows()),
+
31  N_(B.cols()),
+
32  A_((double*)stan::agrad::memalloc_.alloc(sizeof(double)
+
33  * A.rows() * A.cols())),
+
34  C_((double*)stan::agrad::memalloc_.alloc(sizeof(double)
+
35  * B.rows() * B.cols())),
+
36  _variRefA((vari**)stan::agrad::memalloc_.alloc(sizeof(vari*)
+
37  * A.rows() * A.cols())),
+
38  _variRefB((vari**)stan::agrad::memalloc_.alloc(sizeof(vari*)
+
39  * B.rows() * B.cols())),
+
40  _variRefC((vari**)stan::agrad::memalloc_.alloc(sizeof(vari*)
+
41  * B.rows() * B.cols()))
+
42  {
+
43  using Eigen::Matrix;
+
44  using Eigen::Map;
+
45 
+
46  size_t pos = 0;
+
47  for (size_type j = 0; j < M_; j++) {
+
48  for (size_type i = 0; i < M_; i++) {
+
49  _variRefA[pos] = A(i,j).vi_;
+
50  A_[pos++] = A(i,j).val();
+
51  }
+
52  }
+
53 
+
54  pos = 0;
+
55  for (size_type j = 0; j < N_; j++) {
+
56  for (size_type i = 0; i < M_; i++) {
+
57  _variRefB[pos] = B(i,j).vi_;
+
58  C_[pos++] = B(i,j).val();
+
59  }
+
60  }
+
61 
+
62  Matrix<double,R1,C2> C(M_,N_);
+
63  C = Map<Matrix<double,R1,C2> >(C_,M_,N_);
+
64 
+
65  C = Map<Matrix<double,R1,C1> >(A_,M_,M_)
+
66  .colPivHouseholderQr().solve(C);
+
67 
+
68  pos = 0;
+
69  for (size_type j = 0; j < N_; j++) {
+
70  for (size_type i = 0; i < M_; i++) {
+
71  C_[pos] = C(i,j);
+
72  _variRefC[pos] = new vari(C_[pos],false);
+
73  pos++;
+
74  }
+
75  }
+
76  }
+
77 
+
78  virtual void chain() {
+
79  using Eigen::Matrix;
+
80  using Eigen::Map;
+
81  Eigen::Matrix<double,R1,C1> adjA(M_,M_);
+
82  Eigen::Matrix<double,R2,C2> adjB(M_,N_);
+
83  Eigen::Matrix<double,R1,C2> adjC(M_,N_);
+
84 
+
85  size_t pos = 0;
+
86  for (size_type j = 0; j < adjC.cols(); j++)
+
87  for (size_type i = 0; i < adjC.rows(); i++)
+
88  adjC(i,j) = _variRefC[pos++]->adj_;
+
89 
+
90 
+
91  adjB = Map<Matrix<double,R1,C1> >(A_,M_,M_)
+
92  .transpose().colPivHouseholderQr().solve(adjC);
+
93  adjA.noalias() = -adjB
+
94  * Map<Matrix<double,R1,C2> >(C_,M_,N_).transpose();
+
95 
+
96  pos = 0;
+
97  for (size_type j = 0; j < adjA.cols(); j++)
+
98  for (size_type i = 0; i < adjA.rows(); i++)
+
99  _variRefA[pos++]->adj_ += adjA(i,j);
+
100 
+
101  pos = 0;
+
102  for (size_type j = 0; j < adjB.cols(); j++)
+
103  for (size_type i = 0; i < adjB.rows(); i++)
+
104  _variRefB[pos++]->adj_ += adjB(i,j);
+
105  }
+
106  };
+
107 
+
108  template <int R1,int C1,int R2,int C2>
+
109  class mdivide_left_dv_vari : public vari {
+
110  public:
+
111  int M_; // A.rows() = A.cols() = B.rows()
+
112  int N_; // B.cols()
+
113  double* A_;
+
114  double* C_;
+
115  vari** _variRefB;
+
116  vari** _variRefC;
+
117 
+
118  mdivide_left_dv_vari(const Eigen::Matrix<double,R1,C1> &A,
+
119  const Eigen::Matrix<var,R2,C2> &B)
+
120  : vari(0.0),
+
121  M_(A.rows()),
+
122  N_(B.cols()),
+
123  A_((double*)stan::agrad::memalloc_.alloc(sizeof(double)
+
124  * A.rows() * A.cols())),
+
125  C_((double*)stan::agrad::memalloc_.alloc(sizeof(double)
+
126  * B.rows() * B.cols())),
+
127  _variRefB((vari**)stan::agrad::memalloc_.alloc(sizeof(vari*)
+
128  * B.rows() * B.cols())),
+
129  _variRefC((vari**)stan::agrad::memalloc_.alloc(sizeof(vari*)
+
130  * B.rows() * B.cols()))
+
131  {
+
132  using Eigen::Matrix;
+
133  using Eigen::Map;
+
134 
+
135  size_t pos = 0;
+
136  for (size_type j = 0; j < M_; j++) {
+
137  for (size_type i = 0; i < M_; i++) {
+
138  A_[pos++] = A(i,j);
+
139  }
+
140  }
+
141 
+
142  pos = 0;
+
143  for (size_type j = 0; j < N_; j++) {
+
144  for (size_type i = 0; i < M_; i++) {
+
145  _variRefB[pos] = B(i,j).vi_;
+
146  C_[pos++] = B(i,j).val();
+
147  }
+
148  }
+
149 
+
150  Matrix<double,R1,C2> C(M_,N_);
+
151  C = Map<Matrix<double,R1,C2> >(C_,M_,N_);
+
152 
+
153  C = Map<Matrix<double,R1,C1> >(A_,M_,M_)
+
154  .colPivHouseholderQr().solve(C);
+
155 
+
156  pos = 0;
+
157  for (size_type j = 0; j < N_; j++) {
+
158  for (size_type i = 0; i < M_; i++) {
+
159  C_[pos] = C(i,j);
+
160  _variRefC[pos] = new vari(C_[pos],false);
+
161  pos++;
+
162  }
+
163  }
+
164  }
+
165 
+
166  virtual void chain() {
+
167  using Eigen::Matrix;
+
168  using Eigen::Map;
+
169  Eigen::Matrix<double,R2,C2> adjB(M_,N_);
+
170  Eigen::Matrix<double,R1,C2> adjC(M_,N_);
+
171 
+
172  size_t pos = 0;
+
173  for (size_type j = 0; j < adjC.cols(); j++)
+
174  for (size_type i = 0; i < adjC.rows(); i++)
+
175  adjC(i,j) = _variRefC[pos++]->adj_;
+
176 
+
177  adjB = Map<Matrix<double,R1,C1> >(A_,M_,M_)
+
178  .transpose().colPivHouseholderQr().solve(adjC);
+
179 
+
180  pos = 0;
+
181  for (size_type j = 0; j < adjB.cols(); j++)
+
182  for (size_type i = 0; i < adjB.rows(); i++)
+
183  _variRefB[pos++]->adj_ += adjB(i,j);
+
184  }
+
185  };
+
186 
+
187  template <int R1,int C1,int R2,int C2>
+
188  class mdivide_left_vd_vari : public vari {
+
189  public:
+
190  int M_; // A.rows() = A.cols() = B.rows()
+
191  int N_; // B.cols()
+
192  double* A_;
+
193  double* C_;
+
194  vari** _variRefA;
+
195  vari** _variRefC;
+
196 
+
197  mdivide_left_vd_vari(const Eigen::Matrix<var,R1,C1> &A,
+
198  const Eigen::Matrix<double,R2,C2> &B)
+
199  : vari(0.0),
+
200  M_(A.rows()),
+
201  N_(B.cols()),
+
202  A_((double*)stan::agrad::memalloc_.alloc(sizeof(double)
+
203  * A.rows() * A.cols())),
+
204  C_((double*)stan::agrad::memalloc_.alloc(sizeof(double)
+
205  * B.rows() * B.cols())),
+
206  _variRefA((vari**)stan::agrad::memalloc_.alloc(sizeof(vari*)
+
207  * A.rows() * A.cols())),
+
208  _variRefC((vari**)stan::agrad::memalloc_.alloc(sizeof(vari*)
+
209  * B.rows() * B.cols()))
+
210  {
+
211  using Eigen::Matrix;
+
212  using Eigen::Map;
+
213 
+
214  size_t pos = 0;
+
215  for (size_type j = 0; j < M_; j++) {
+
216  for (size_type i = 0; i < M_; i++) {
+
217  _variRefA[pos] = A(i,j).vi_;
+
218  A_[pos++] = A(i,j).val();
+
219  }
+
220  }
+
221 
+
222  Matrix<double,R1,C2> C(M_,N_);
+
223  C = Map<Matrix<double,R1,C1> >(A_,M_,M_)
+
224  .colPivHouseholderQr().solve(B);
+
225 
+
226  pos = 0;
+
227  for (size_type j = 0; j < N_; j++) {
+
228  for (size_type i = 0; i < M_; i++) {
+
229  C_[pos] = C(i,j);
+
230  _variRefC[pos] = new vari(C_[pos],false);
+
231  pos++;
+
232  }
+
233  }
+
234  }
+
235 
+
236  virtual void chain() {
+
237  using Eigen::Matrix;
+
238  using Eigen::Map;
+
239  Eigen::Matrix<double,R1,C1> adjA(M_,M_);
+
240  Eigen::Matrix<double,R1,C2> adjC(M_,N_);
+
241 
+
242  size_t pos = 0;
+
243  for (size_type j = 0; j < adjC.cols(); j++)
+
244  for (size_type i = 0; i < adjC.rows(); i++)
+
245  adjC(i,j) = _variRefC[pos++]->adj_;
+
246 
+
247  // FIXME: add .noalias() to LHS
+
248  adjA = -Map<Matrix<double,R1,C1> >(A_,M_,M_)
+
249  .transpose()
+
250  .colPivHouseholderQr()
+
251  .solve(adjC*Map<Matrix<double,R1,C2> >(C_,M_,N_).transpose());
+
252 
+
253  pos = 0;
+
254  for (size_type j = 0; j < adjA.cols(); j++)
+
255  for (size_type i = 0; i < adjA.rows(); i++)
+
256  _variRefA[pos++]->adj_ += adjA(i,j);
+
257  }
+
258  };
+
259  }
+
260 
+
261  template <int R1,int C1,int R2,int C2>
+
262  inline
+
263  Eigen::Matrix<var,R1,C2>
+
264  mdivide_left(const Eigen::Matrix<var,R1,C1> &A,
+
265  const Eigen::Matrix<var,R2,C2> &b) {
+
266  Eigen::Matrix<var,R1,C2> res(b.rows(),b.cols());
+
267 
+
268  stan::math::validate_square(A,"mdivide_left");
+
269  stan::math::validate_multiplicable(A,b,"mdivide_left");
+
270 
+
271  // NOTE: this is not a memory leak, this vari is used in the
+
272  // expression graph to evaluate the adjoint, but is not needed
+
273  // for the returned matrix. Memory will be cleaned up with the arena allocator.
+
274  mdivide_left_vv_vari<R1,C1,R2,C2> *baseVari = new mdivide_left_vv_vari<R1,C1,R2,C2>(A,b);
+
275 
+
276  size_t pos = 0;
+
277  for (size_type j = 0; j < res.cols(); j++)
+
278  for (size_type i = 0; i < res.rows(); i++)
+
279  res(i,j).vi_ = baseVari->_variRefC[pos++];
+
280 
+
281  return res;
+
282  }
+
283 
+
284  template <int R1,int C1,int R2,int C2>
+
285  inline
+
286  Eigen::Matrix<var,R1,C2>
+
287  mdivide_left(const Eigen::Matrix<var,R1,C1> &A,
+
288  const Eigen::Matrix<double,R2,C2> &b) {
+
289  Eigen::Matrix<var,R1,C2> res(b.rows(),b.cols());
+
290 
+
291  stan::math::validate_square(A,"mdivide_left");
+
292  stan::math::validate_multiplicable(A,b,"mdivide_left");
+
293 
+
294  // NOTE: this is not a memory leak, this vari is used in the
+
295  // expression graph to evaluate the adjoint, but is not needed
+
296  // for the returned matrix. Memory will be cleaned up with the arena allocator.
+
297  mdivide_left_vd_vari<R1,C1,R2,C2> *baseVari = new mdivide_left_vd_vari<R1,C1,R2,C2>(A,b);
+
298 
+
299  size_t pos = 0;
+
300  for (size_type j = 0; j < res.cols(); j++)
+
301  for (size_type i = 0; i < res.rows(); i++)
+
302  res(i,j).vi_ = baseVari->_variRefC[pos++];
+
303 
+
304  return res;
+
305  }
+
306 
+
307  template <int R1,int C1,int R2,int C2>
+
308  inline
+
309  Eigen::Matrix<var,R1,C2>
+
310  mdivide_left(const Eigen::Matrix<double,R1,C1> &A,
+
311  const Eigen::Matrix<var,R2,C2> &b) {
+
312  Eigen::Matrix<var,R1,C2> res(b.rows(),b.cols());
+
313 
+
314  stan::math::validate_square(A,"mdivide_left");
+
315  stan::math::validate_multiplicable(A,b,"mdivide_left");
+
316 
+
317  // NOTE: this is not a memory leak, this vari is used in the
+
318  // expression graph to evaluate the adjoint, but is not needed
+
319  // for the returned matrix. Memory will be cleaned up with the arena allocator.
+
320  mdivide_left_dv_vari<R1,C1,R2,C2> *baseVari = new mdivide_left_dv_vari<R1,C1,R2,C2>(A,b);
+
321 
+
322  size_t pos = 0;
+
323  for (size_type j = 0; j < res.cols(); j++)
+
324  for (size_type i = 0; i < res.rows(); i++)
+
325  res(i,j).vi_ = baseVari->_variRefC[pos++];
+
326 
+
327  return res;
+
328  }
+
329 
+
330  }
+
331 }
+
332 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2mdivide__left__spd_8hpp.html b/doc/api/html/agrad_2rev_2matrix_2mdivide__left__spd_8hpp.html new file mode 100644 index 00000000000..5fbc0658bba --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2mdivide__left__spd_8hpp.html @@ -0,0 +1,254 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/mdivide_left_spd.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
mdivide_left_spd.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<int R1, int C1, int R2, int C2>
Eigen::Matrix< var, R1, C2 > stan::agrad::mdivide_left_spd (const Eigen::Matrix< var, R1, C1 > &A, const Eigen::Matrix< var, R2, C2 > &b)
 
template<int R1, int C1, int R2, int C2>
Eigen::Matrix< var, R1, C2 > stan::agrad::mdivide_left_spd (const Eigen::Matrix< var, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)
 
template<int R1, int C1, int R2, int C2>
Eigen::Matrix< var, R1, C2 > stan::agrad::mdivide_left_spd (const Eigen::Matrix< double, R1, C1 > &A, const Eigen::Matrix< var, R2, C2 > &b)
 
+

Variable Documentation

+ +
+
+ + + + +
mdivide_left_spd_alloc<R1,C1,R2,C2>* _alloc
+
+ +

Definition at line 33 of file mdivide_left_spd.hpp.

+ +
+
+ +
+
+ + + + +
Eigen::LLT< Eigen::Matrix<double,R1,C1> > _llt
+
+ +

Definition at line 21 of file mdivide_left_spd.hpp.

+ +
+
+ +
+
+ + + + +
vari** _variRefA
+
+ +

Definition at line 30 of file mdivide_left_spd.hpp.

+ +
+
+ +
+
+ + + + +
vari** _variRefB
+
+ +

Definition at line 31 of file mdivide_left_spd.hpp.

+ +
+
+ +
+
+ + + + +
vari** _variRefC
+
+ +

Definition at line 32 of file mdivide_left_spd.hpp.

+ +
+
+ +
+
+ + + + +
Eigen::Matrix<double,R2,C2> C_
+
+ +

Definition at line 22 of file mdivide_left_spd.hpp.

+ +
+
+ +
+
+ + + + +
int M_
+
+ +

Definition at line 28 of file mdivide_left_spd.hpp.

+ +
+
+ +
+
+ + + + +
int N_
+
+ +

Definition at line 29 of file mdivide_left_spd.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2mdivide__left__spd_8hpp_source.html b/doc/api/html/agrad_2rev_2matrix_2mdivide__left__spd_8hpp_source.html new file mode 100644 index 00000000000..2a224948e4f --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2mdivide__left__spd_8hpp_source.html @@ -0,0 +1,419 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/mdivide_left_spd.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
mdivide_left_spd.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__MDIVIDE_LEFT_SPD_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__MDIVIDE_LEFT_SPD_HPP__
+
3 
+
4 #include <vector>
+ + + + +
9 #include <stan/agrad/rev/var.hpp>
+ +
11 
+
12 namespace stan {
+
13  namespace agrad {
+
14 
+
15  namespace {
+
16  template <int R1,int C1,int R2,int C2>
+
17  class mdivide_left_spd_alloc : public chainable_alloc {
+
18  public:
+
19  virtual ~mdivide_left_spd_alloc() {}
+
20 
+
21  Eigen::LLT< Eigen::Matrix<double,R1,C1> > _llt;
+
22  Eigen::Matrix<double,R2,C2> C_;
+
23  };
+
24 
+
25  template <int R1,int C1,int R2,int C2>
+
26  class mdivide_left_spd_vv_vari : public vari {
+
27  public:
+
28  int M_; // A.rows() = A.cols() = B.rows()
+
29  int N_; // B.cols()
+
30  vari** _variRefA;
+
31  vari** _variRefB;
+
32  vari** _variRefC;
+
33  mdivide_left_spd_alloc<R1,C1,R2,C2> *_alloc;
+
34 
+
35  mdivide_left_spd_vv_vari(const Eigen::Matrix<var,R1,C1> &A,
+
36  const Eigen::Matrix<var,R2,C2> &B)
+
37  : vari(0.0),
+
38  M_(A.rows()),
+
39  N_(B.cols()),
+
40  _variRefA((vari**)stan::agrad::memalloc_.alloc(sizeof(vari*)
+
41  * A.rows() * A.cols())),
+
42  _variRefB((vari**)stan::agrad::memalloc_.alloc(sizeof(vari*)
+
43  * B.rows() * B.cols())),
+
44  _variRefC((vari**)stan::agrad::memalloc_.alloc(sizeof(vari*)
+
45  * B.rows() * B.cols())),
+
46  _alloc(new mdivide_left_spd_alloc<R1,C1,R2,C2>())
+
47  {
+
48  using Eigen::Matrix;
+
49  using Eigen::Map;
+
50 
+
51  Matrix<double,R1,C1> Ad(A.rows(),A.cols());
+
52 
+
53  size_t pos = 0;
+
54  for (size_type j = 0; j < M_; j++) {
+
55  for (size_type i = 0; i < M_; i++) {
+
56  _variRefA[pos] = A(i,j).vi_;
+
57  Ad(i,j) = A(i,j).val();
+
58  pos++;
+
59  }
+
60  }
+
61 
+
62  pos = 0;
+
63  _alloc->C_.resize(M_,N_);
+
64  for (size_type j = 0; j < N_; j++) {
+
65  for (size_type i = 0; i < M_; i++) {
+
66  _variRefB[pos] = B(i,j).vi_;
+
67  _alloc->C_(i,j) = B(i,j).val();
+
68  pos++;
+
69  }
+
70  }
+
71 
+
72  _alloc->_llt = Ad.llt();
+
73  _alloc->_llt.solveInPlace(_alloc->C_);
+
74 
+
75  pos = 0;
+
76  for (size_type j = 0; j < N_; j++) {
+
77  for (size_type i = 0; i < M_; i++) {
+
78  _variRefC[pos] = new vari(_alloc->C_(i,j),false);
+
79  pos++;
+
80  }
+
81  }
+
82  }
+
83 
+
84  virtual void chain() {
+
85  using Eigen::Matrix;
+
86  using Eigen::Map;
+
87  Eigen::Matrix<double,R1,C1> adjA(M_,M_);
+
88  Eigen::Matrix<double,R2,C2> adjB(M_,N_);
+
89 
+
90  size_t pos = 0;
+
91  for (size_type j = 0; j < N_; j++)
+
92  for (size_type i = 0; i < M_; i++)
+
93  adjB(i,j) = _variRefC[pos++]->adj_;
+
94 
+
95  _alloc->_llt.solveInPlace(adjB);
+
96  adjA.noalias() = -adjB * _alloc->C_.transpose();
+
97 
+
98  pos = 0;
+
99  for (size_type j = 0; j < M_; j++)
+
100  for (size_type i = 0; i < M_; i++)
+
101  _variRefA[pos++]->adj_ += adjA(i,j);
+
102 
+
103  pos = 0;
+
104  for (size_type j = 0; j < N_; j++)
+
105  for (size_type i = 0; i < M_; i++)
+
106  _variRefB[pos++]->adj_ += adjB(i,j);
+
107  }
+
108  };
+
109 
+
110  template <int R1,int C1,int R2,int C2>
+
111  class mdivide_left_spd_dv_vari : public vari {
+
112  public:
+
113  int M_; // A.rows() = A.cols() = B.rows()
+
114  int N_; // B.cols()
+
115  vari** _variRefB;
+
116  vari** _variRefC;
+
117  mdivide_left_spd_alloc<R1,C1,R2,C2> *_alloc;
+
118 
+
119  mdivide_left_spd_dv_vari(const Eigen::Matrix<double,R1,C1> &A,
+
120  const Eigen::Matrix<var,R2,C2> &B)
+
121  : vari(0.0),
+
122  M_(A.rows()),
+
123  N_(B.cols()),
+
124  _variRefB((vari**)stan::agrad::memalloc_.alloc(sizeof(vari*)
+
125  * B.rows() * B.cols())),
+
126  _variRefC((vari**)stan::agrad::memalloc_.alloc(sizeof(vari*)
+
127  * B.rows() * B.cols())),
+
128  _alloc(new mdivide_left_spd_alloc<R1,C1,R2,C2>())
+
129  {
+
130  using Eigen::Matrix;
+
131  using Eigen::Map;
+
132 
+
133  size_t pos = 0;
+
134  _alloc->C_.resize(M_,N_);
+
135  for (size_type j = 0; j < N_; j++) {
+
136  for (size_type i = 0; i < M_; i++) {
+
137  _variRefB[pos] = B(i,j).vi_;
+
138  _alloc->C_(i,j) = B(i,j).val();
+
139  pos++;
+
140  }
+
141  }
+
142 
+
143  _alloc->_llt = A.llt();
+
144  _alloc->_llt.solveInPlace(_alloc->C_);
+
145 
+
146  pos = 0;
+
147  for (size_type j = 0; j < N_; j++) {
+
148  for (size_type i = 0; i < M_; i++) {
+
149  _variRefC[pos] = new vari(_alloc->C_(i,j),false);
+
150  pos++;
+
151  }
+
152  }
+
153  }
+
154 
+
155  virtual void chain() {
+
156  using Eigen::Matrix;
+
157  using Eigen::Map;
+
158  Eigen::Matrix<double,R2,C2> adjB(M_,N_);
+
159 
+
160  size_t pos = 0;
+
161  for (size_type j = 0; j < adjB.cols(); j++)
+
162  for (size_type i = 0; i < adjB.rows(); i++)
+
163  adjB(i,j) = _variRefC[pos++]->adj_;
+
164 
+
165  _alloc->_llt.solveInPlace(adjB);
+
166 
+
167  pos = 0;
+
168  for (size_type j = 0; j < adjB.cols(); j++)
+
169  for (size_type i = 0; i < adjB.rows(); i++)
+
170  _variRefB[pos++]->adj_ += adjB(i,j);
+
171  }
+
172  };
+
173 
+
174  template <int R1,int C1,int R2,int C2>
+
175  class mdivide_left_spd_vd_vari : public vari {
+
176  public:
+
177  int M_; // A.rows() = A.cols() = B.rows()
+
178  int N_; // B.cols()
+
179  vari** _variRefA;
+
180  vari** _variRefC;
+
181  mdivide_left_spd_alloc<R1,C1,R2,C2> *_alloc;
+
182 
+
183  mdivide_left_spd_vd_vari(const Eigen::Matrix<var,R1,C1> &A,
+
184  const Eigen::Matrix<double,R2,C2> &B)
+
185  : vari(0.0),
+
186  M_(A.rows()),
+
187  N_(B.cols()),
+
188  _variRefA((vari**)stan::agrad::memalloc_.alloc(sizeof(vari*)
+
189  * A.rows() * A.cols())),
+
190  _variRefC((vari**)stan::agrad::memalloc_.alloc(sizeof(vari*)
+
191  * B.rows() * B.cols())),
+
192  _alloc(new mdivide_left_spd_alloc<R1,C1,R2,C2>())
+
193  {
+
194  using Eigen::Matrix;
+
195  using Eigen::Map;
+
196 
+
197  Matrix<double,R1,C1> Ad(A.rows(),A.cols());
+
198 
+
199  size_t pos = 0;
+
200  for (size_type j = 0; j < M_; j++) {
+
201  for (size_type i = 0; i < M_; i++) {
+
202  _variRefA[pos] = A(i,j).vi_;
+
203  Ad(i,j) = A(i,j).val();
+
204  pos++;
+
205  }
+
206  }
+
207 
+
208  _alloc->_llt = Ad.llt();
+
209  _alloc->C_ = _alloc->_llt.solve(B);
+
210 
+
211  pos = 0;
+
212  for (size_type j = 0; j < N_; j++) {
+
213  for (size_type i = 0; i < M_; i++) {
+
214  _variRefC[pos] = new vari(_alloc->C_(i,j),false);
+
215  pos++;
+
216  }
+
217  }
+
218  }
+
219 
+
220  virtual void chain() {
+
221  using Eigen::Matrix;
+
222  using Eigen::Map;
+
223  Eigen::Matrix<double,R1,C1> adjA(M_,M_);
+
224  Eigen::Matrix<double,R1,C2> adjC(M_,N_);
+
225 
+
226  size_t pos = 0;
+
227  for (size_type j = 0; j < adjC.cols(); j++)
+
228  for (size_type i = 0; i < adjC.rows(); i++)
+
229  adjC(i,j) = _variRefC[pos++]->adj_;
+
230 
+
231  adjA = -_alloc->_llt.solve(adjC*_alloc->C_.transpose());
+
232 
+
233  pos = 0;
+
234  for (size_type j = 0; j < adjA.cols(); j++)
+
235  for (size_type i = 0; i < adjA.rows(); i++)
+
236  _variRefA[pos++]->adj_ += adjA(i,j);
+
237  }
+
238  };
+
239  }
+
240 
+
241  template <int R1,int C1,int R2,int C2>
+
242  inline
+
243  Eigen::Matrix<var,R1,C2>
+
244  mdivide_left_spd(const Eigen::Matrix<var,R1,C1> &A,
+
245  const Eigen::Matrix<var,R2,C2> &b) {
+
246  Eigen::Matrix<var,R1,C2> res(b.rows(),b.cols());
+
247 
+
248  stan::math::validate_square(A,"mdivide_left_spd");
+
249  stan::math::validate_multiplicable(A,b,"mdivide_left_spd");
+
250 
+
251  // NOTE: this is not a memory leak, this vari is used in the
+
252  // expression graph to evaluate the adjoint, but is not needed
+
253  // for the returned matrix. Memory will be cleaned up with the arena allocator.
+
254  mdivide_left_spd_vv_vari<R1,C1,R2,C2> *baseVari = new mdivide_left_spd_vv_vari<R1,C1,R2,C2>(A,b);
+
255 
+
256  size_t pos = 0;
+
257  for (size_type j = 0; j < res.cols(); j++)
+
258  for (size_type i = 0; i < res.rows(); i++)
+
259  res(i,j).vi_ = baseVari->_variRefC[pos++];
+
260 
+
261  return res;
+
262  }
+
263 
+
264  template <int R1,int C1,int R2,int C2>
+
265  inline
+
266  Eigen::Matrix<var,R1,C2>
+
267  mdivide_left_spd(const Eigen::Matrix<var,R1,C1> &A,
+
268  const Eigen::Matrix<double,R2,C2> &b) {
+
269  Eigen::Matrix<var,R1,C2> res(b.rows(),b.cols());
+
270 
+
271  stan::math::validate_square(A,"mdivide_left_spd");
+
272  stan::math::validate_multiplicable(A,b,"mdivide_left_spd");
+
273 
+
274  // NOTE: this is not a memory leak, this vari is used in the
+
275  // expression graph to evaluate the adjoint, but is not needed
+
276  // for the returned matrix. Memory will be cleaned up with the arena allocator.
+
277  mdivide_left_spd_vd_vari<R1,C1,R2,C2> *baseVari = new mdivide_left_spd_vd_vari<R1,C1,R2,C2>(A,b);
+
278 
+
279  size_t pos = 0;
+
280  for (size_type j = 0; j < res.cols(); j++)
+
281  for (size_type i = 0; i < res.rows(); i++)
+
282  res(i,j).vi_ = baseVari->_variRefC[pos++];
+
283 
+
284  return res;
+
285  }
+
286 
+
287  template <int R1,int C1,int R2,int C2>
+
288  inline
+
289  Eigen::Matrix<var,R1,C2>
+
290  mdivide_left_spd(const Eigen::Matrix<double,R1,C1> &A,
+
291  const Eigen::Matrix<var,R2,C2> &b) {
+
292  Eigen::Matrix<var,R1,C2> res(b.rows(),b.cols());
+
293 
+
294  stan::math::validate_square(A,"mdivide_left_spd");
+
295  stan::math::validate_multiplicable(A,b,"mdivide_left_spd");
+
296 
+
297  // NOTE: this is not a memory leak, this vari is used in the
+
298  // expression graph to evaluate the adjoint, but is not needed
+
299  // for the returned matrix. Memory will be cleaned up with the arena allocator.
+
300  mdivide_left_spd_dv_vari<R1,C1,R2,C2> *baseVari = new mdivide_left_spd_dv_vari<R1,C1,R2,C2>(A,b);
+
301 
+
302  size_t pos = 0;
+
303  for (size_type j = 0; j < res.cols(); j++)
+
304  for (size_type i = 0; i < res.rows(); i++)
+
305  res(i,j).vi_ = baseVari->_variRefC[pos++];
+
306 
+
307  return res;
+
308  }
+
309 
+
310  }
+
311 }
+
312 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2mdivide__left__tri_8hpp.html b/doc/api/html/agrad_2rev_2matrix_2mdivide__left__tri_8hpp.html new file mode 100644 index 00000000000..6ef3a44a5f6 --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2mdivide__left__tri_8hpp.html @@ -0,0 +1,248 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/mdivide_left_tri.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
mdivide_left_tri.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<int TriView, int R1, int C1, int R2, int C2>
Eigen::Matrix< var, R1, C2 > stan::agrad::mdivide_left_tri (const Eigen::Matrix< var, R1, C1 > &A, const Eigen::Matrix< var, R2, C2 > &b)
 
template<int TriView, int R1, int C1, int R2, int C2>
Eigen::Matrix< var, R1, C2 > stan::agrad::mdivide_left_tri (const Eigen::Matrix< double, R1, C1 > &A, const Eigen::Matrix< var, R2, C2 > &b)
 
template<int TriView, int R1, int C1, int R2, int C2>
Eigen::Matrix< var, R1, C2 > stan::agrad::mdivide_left_tri (const Eigen::Matrix< var, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)
 
+

Variable Documentation

+ +
+
+ + + + +
vari** _variRefA
+
+ +

Definition at line 23 of file mdivide_left_tri.hpp.

+ +
+
+ +
+
+ + + + +
vari** _variRefB
+
+ +

Definition at line 24 of file mdivide_left_tri.hpp.

+ +
+
+ +
+
+ + + + +
vari** _variRefC
+
+ +

Definition at line 25 of file mdivide_left_tri.hpp.

+ +
+
+ +
+
+ + + + +
double* A_
+
+ +

Definition at line 21 of file mdivide_left_tri.hpp.

+ +
+
+ +
+
+ + + + +
double* C_
+
+ +

Definition at line 22 of file mdivide_left_tri.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
int M_
+
+static
+
+ +

Definition at line 19 of file mdivide_left_tri.hpp.

+ +
+
+ +
+
+ + + + +
int N_
+
+ +

Definition at line 20 of file mdivide_left_tri.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2mdivide__left__tri_8hpp_source.html b/doc/api/html/agrad_2rev_2matrix_2mdivide__left__tri_8hpp_source.html new file mode 100644 index 00000000000..c1dc919c23e --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2mdivide__left__tri_8hpp_source.html @@ -0,0 +1,469 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/mdivide_left_tri.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
mdivide_left_tri.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__MDIVIDE_LEFT_TRI_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__MDIVIDE_LEFT_TRI_HPP__
+
3 
+
4 #include <vector>
+ + + + +
9 #include <stan/agrad/rev/var.hpp>
+ +
11 
+
12 namespace stan {
+
13  namespace agrad {
+
14 
+
15  namespace {
+
16  template <int TriView,int R1,int C1,int R2,int C2>
+
17  class mdivide_left_tri_vv_vari : public vari {
+
18  public:
+
19  int M_; // A.rows() = A.cols() = B.rows()
+
20  int N_; // B.cols()
+
21  double* A_;
+
22  double* C_;
+
23  vari** _variRefA;
+
24  vari** _variRefB;
+
25  vari** _variRefC;
+
26 
+
27  mdivide_left_tri_vv_vari(const Eigen::Matrix<var,R1,C1> &A,
+
28  const Eigen::Matrix<var,R2,C2> &B)
+
29  : vari(0.0),
+
30  M_(A.rows()),
+
31  N_(B.cols()),
+
32  A_((double*)stan::agrad::memalloc_.alloc(sizeof(double)
+
33  * A.rows() * A.cols())),
+
34  C_((double*)stan::agrad::memalloc_.alloc(sizeof(double)
+
35  * B.rows() * B.cols())),
+
36  _variRefA((vari**)stan::agrad::memalloc_.alloc(sizeof(vari*)
+
37  * A.rows()
+
38  * (A.rows() + 1) / 2)),
+
39  _variRefB((vari**)stan::agrad::memalloc_.alloc(sizeof(vari*)
+
40  * B.rows() * B.cols())),
+
41  _variRefC((vari**)stan::agrad::memalloc_.alloc(sizeof(vari*)
+
42  * B.rows() * B.cols()))
+
43  {
+
44  using Eigen::Matrix;
+
45  using Eigen::Map;
+
46 
+
47  size_t pos = 0;
+
48  if (TriView == Eigen::Lower) {
+
49  for (size_type j = 0; j < M_; j++)
+
50  for (size_type i = j; i < M_; i++)
+
51  _variRefA[pos++] = A(i,j).vi_;
+
52  } else if (TriView == Eigen::Upper) {
+
53  for (size_type j = 0; j < M_; j++)
+
54  for (size_type i = 0; i < j+1; i++)
+
55  _variRefA[pos++] = A(i,j).vi_;
+
56  }
+
57 
+
58  pos = 0;
+
59  for (size_type j = 0; j < M_; j++) {
+
60  for (size_type i = 0; i < M_; i++) {
+
61  A_[pos++] = A(i,j).val();
+
62  }
+
63  }
+
64 
+
65  pos = 0;
+
66  for (size_type j = 0; j < N_; j++) {
+
67  for (size_type i = 0; i < M_; i++) {
+
68  _variRefB[pos] = B(i,j).vi_;
+
69  C_[pos++] = B(i,j).val();
+
70  }
+
71  }
+
72 
+
73  Matrix<double,R1,C2> C(M_,N_);
+
74  C = Map<Matrix<double,R1,C2> >(C_,M_,N_);
+
75 
+
76  C = Map<Matrix<double,R1,C1> >(A_,M_,M_)
+
77  .template triangularView<TriView>().solve(C);
+
78 
+
79  pos = 0;
+
80  for (size_type j = 0; j < N_; j++) {
+
81  for (size_type i = 0; i < M_; i++) {
+
82  C_[pos] = C(i,j);
+
83  _variRefC[pos] = new vari(C_[pos],false);
+
84  pos++;
+
85  }
+
86  }
+
87 
+
88  }
+
89 
+
90  virtual void chain() {
+
91  using Eigen::Matrix;
+
92  using Eigen::Map;
+
93  Matrix<double,R1,C1> adjA(M_,M_);
+
94  Matrix<double,R2,C2> adjB(M_,N_);
+
95  Matrix<double,R1,C2> adjC(M_,N_);
+
96 
+
97  size_t pos = 0;
+
98  for (size_type j = 0; j < adjC.cols(); j++)
+
99  for (size_type i = 0; i < adjC.rows(); i++)
+
100  adjC(i,j) = _variRefC[pos++]->adj_;
+
101 
+
102  adjB = Map<Matrix<double,R1,C1> >(A_,M_,M_)
+
103  .template triangularView<TriView>().transpose().solve(adjC);
+
104  adjA.noalias() = -adjB
+
105  * Map<Matrix<double,R1,C2> >(C_,M_,N_).transpose();
+
106 
+
107  pos = 0;
+
108  if (TriView == Eigen::Lower) {
+
109  for (size_type j = 0; j < adjA.cols(); j++)
+
110  for (size_type i = j; i < adjA.rows(); i++)
+
111  _variRefA[pos++]->adj_ += adjA(i,j);
+
112  } else if (TriView == Eigen::Upper) {
+
113  for (size_type j = 0; j < adjA.cols(); j++)
+
114  for (size_type i = 0; i < j+1; i++)
+
115  _variRefA[pos++]->adj_ += adjA(i,j);
+
116  }
+
117 
+
118  pos = 0;
+
119  for (size_type j = 0; j < adjB.cols(); j++)
+
120  for (size_type i = 0; i < adjB.rows(); i++)
+
121  _variRefB[pos++]->adj_ += adjB(i,j);
+
122  }
+
123  };
+
124 
+
125  template <int TriView,int R1,int C1,int R2,int C2>
+
126  class mdivide_left_tri_dv_vari : public vari {
+
127  public:
+
128  int M_; // A.rows() = A.cols() = B.rows()
+
129  int N_; // B.cols()
+
130  double* A_;
+
131  double* C_;
+
132  vari** _variRefB;
+
133  vari** _variRefC;
+
134 
+
135  mdivide_left_tri_dv_vari(const Eigen::Matrix<double,R1,C1> &A,
+
136  const Eigen::Matrix<var,R2,C2> &B)
+
137  : vari(0.0),
+
138  M_(A.rows()),
+
139  N_(B.cols()),
+
140  A_((double*)stan::agrad::memalloc_.alloc(sizeof(double)
+
141  * A.rows() * A.cols())),
+
142  C_((double*)stan::agrad::memalloc_.alloc(sizeof(double)
+
143  * B.rows() * B.cols())),
+
144  _variRefB((vari**)stan::agrad::memalloc_.alloc(sizeof(vari*)
+
145  * B.rows() * B.cols())),
+
146  _variRefC((vari**)stan::agrad::memalloc_.alloc(sizeof(vari*)
+
147  * B.rows() * B.cols()))
+
148  {
+
149  using Eigen::Matrix;
+
150  using Eigen::Map;
+
151 
+
152  size_t pos = 0;
+
153  for (size_type j = 0; j < M_; j++) {
+
154  for (size_type i = 0; i < M_; i++) {
+
155  A_[pos++] = A(i,j);
+
156  }
+
157  }
+
158 
+
159  pos = 0;
+
160  for (size_type j = 0; j < N_; j++) {
+
161  for (size_type i = 0; i < M_; i++) {
+
162  _variRefB[pos] = B(i,j).vi_;
+
163  C_[pos++] = B(i,j).val();
+
164  }
+
165  }
+
166 
+
167  Matrix<double,R1,C2> C(M_,N_);
+
168  C = Map<Matrix<double,R1,C2> >(C_,M_,N_);
+
169 
+
170  C = Map<Matrix<double,R1,C1> >(A_,M_,M_)
+
171  .template triangularView<TriView>().solve(C);
+
172 
+
173  pos = 0;
+
174  for (size_type j = 0; j < N_; j++) {
+
175  for (size_type i = 0; i < M_; i++) {
+
176  C_[pos] = C(i,j);
+
177  _variRefC[pos] = new vari(C_[pos],false);
+
178  pos++;
+
179  }
+
180  }
+
181  }
+
182 
+
183  virtual void chain() {
+
184  using Eigen::Matrix;
+
185  using Eigen::Map;
+
186  Matrix<double,R2,C2> adjB(M_,N_);
+
187  Matrix<double,R1,C2> adjC(M_,N_);
+
188 
+
189  size_t pos = 0;
+
190  for (size_type j = 0; j < adjC.cols(); j++)
+
191  for (size_type i = 0; i < adjC.rows(); i++)
+
192  adjC(i,j) = _variRefC[pos++]->adj_;
+
193 
+
194  adjB = Map<Matrix<double,R1,C1> >(A_,M_,M_)
+
195  .template triangularView<TriView>().transpose().solve(adjC);
+
196 
+
197  pos = 0;
+
198  for (size_type j = 0; j < adjB.cols(); j++)
+
199  for (size_type i = 0; i < adjB.rows(); i++)
+
200  _variRefB[pos++]->adj_ += adjB(i,j);
+
201  }
+
202  };
+
203 
+
204  template <int TriView,int R1,int C1,int R2,int C2>
+
205  class mdivide_left_tri_vd_vari : public vari {
+
206  public:
+
207  int M_; // A.rows() = A.cols() = B.rows()
+
208  int N_; // B.cols()
+
209  double* A_;
+
210  double* C_;
+
211  vari** _variRefA;
+
212  vari** _variRefC;
+
213 
+
214  mdivide_left_tri_vd_vari(const Eigen::Matrix<var,R1,C1> &A,
+
215  const Eigen::Matrix<double,R2,C2> &B)
+
216  : vari(0.0),
+
217  M_(A.rows()),
+
218  N_(B.cols()),
+
219  A_((double*)stan::agrad::memalloc_.alloc(sizeof(double)
+
220  * A.rows() * A.cols())),
+
221  C_((double*)stan::agrad::memalloc_.alloc(sizeof(double)
+
222  * B.rows() * B.cols())),
+
223  _variRefA((vari**)stan::agrad::memalloc_.alloc(sizeof(vari*)
+
224  * A.rows()
+
225  * (A.rows() + 1) / 2)),
+
226  _variRefC((vari**)stan::agrad::memalloc_.alloc(sizeof(vari*)
+
227  * B.rows() * B.cols()))
+
228  {
+
229  using Eigen::Matrix;
+
230  using Eigen::Map;
+
231 
+
232  size_t pos = 0;
+
233  if (TriView == Eigen::Lower) {
+
234  for (size_type j = 0; j < M_; j++)
+
235  for (size_type i = j; i < M_; i++)
+
236  _variRefA[pos++] = A(i,j).vi_;
+
237  } else if (TriView == Eigen::Upper) {
+
238  for (size_type j = 0; j < M_; j++)
+
239  for (size_type i = 0; i < j+1; i++)
+
240  _variRefA[pos++] = A(i,j).vi_;
+
241  }
+
242 
+
243  pos = 0;
+
244  for (size_type j = 0; j < M_; j++) {
+
245  for (size_type i = 0; i < M_; i++) {
+
246  A_[pos++] = A(i,j).val();
+
247  }
+
248  }
+
249 
+
250  Matrix<double,R1,C2> C(M_,N_);
+
251  C = Map<Matrix<double,R1,C1> >(A_,M_,M_)
+
252  .template triangularView<TriView>().solve(B);
+
253 
+
254  pos = 0;
+
255  for (size_type j = 0; j < N_; j++) {
+
256  for (size_type i = 0; i < M_; i++) {
+
257  C_[pos] = C(i,j);
+
258  _variRefC[pos] = new vari(C_[pos],false);
+
259  pos++;
+
260  }
+
261  }
+
262  }
+
263 
+
264  virtual void chain() {
+
265  using Eigen::Matrix;
+
266  using Eigen::Map;
+
267  Matrix<double,R1,C1> adjA(M_,M_);
+
268  Matrix<double,R1,C2> adjC(M_,N_);
+
269 
+
270  size_t pos = 0;
+
271  for (size_type j = 0; j < adjC.cols(); j++)
+
272  for (size_type i = 0; i < adjC.rows(); i++)
+
273  adjC(i,j) = _variRefC[pos++]->adj_;
+
274 
+
275  adjA.noalias() = -Map<Matrix<double,R1,C1> >(A_,M_,M_)
+
276  .template triangularView<TriView>()
+
277  .transpose().solve(adjC*Map<Matrix<double,R1,C2> >(C_,M_,N_).transpose());
+
278 
+
279  pos = 0;
+
280  if (TriView == Eigen::Lower) {
+
281  for (size_type j = 0; j < adjA.cols(); j++)
+
282  for (size_type i = j; i < adjA.rows(); i++)
+
283  _variRefA[pos++]->adj_ += adjA(i,j);
+
284  } else if (TriView == Eigen::Upper) {
+
285  for (size_type j = 0; j < adjA.cols(); j++)
+
286  for (size_type i = 0; i < j+1; i++)
+
287  _variRefA[pos++]->adj_ += adjA(i,j);
+
288  }
+
289  }
+
290  };
+
291  }
+
292 
+
293  template <int TriView,int R1,int C1,int R2,int C2>
+
294  inline
+
295  Eigen::Matrix<var,R1,C2>
+
296  mdivide_left_tri(const Eigen::Matrix<var,R1,C1> &A,
+
297  const Eigen::Matrix<var,R2,C2> &b) {
+
298  Eigen::Matrix<var,R1,C2> res(b.rows(),b.cols());
+
299 
+
300  stan::math::validate_square(A,"mdivide_left_tri");
+
301  stan::math::validate_multiplicable(A,b,"mdivide_left_tri");
+
302 
+
303  // NOTE: this is not a memory leak, this vari is used in the
+
304  // expression graph to evaluate the adjoint, but is not needed
+
305  // for the returned matrix. Memory will be cleaned up with the arena allocator.
+
306  mdivide_left_tri_vv_vari<TriView,R1,C1,R2,C2> *baseVari = new mdivide_left_tri_vv_vari<TriView,R1,C1,R2,C2>(A,b);
+
307 
+
308  size_t pos = 0;
+
309  for (size_type j = 0; j < res.cols(); j++)
+
310  for (size_type i = 0; i < res.rows(); i++)
+
311  res(i,j).vi_ = baseVari->_variRefC[pos++];
+
312 
+
313  return res;
+
314  }
+
315  template <int TriView,int R1,int C1,int R2,int C2>
+
316  inline
+
317  Eigen::Matrix<var,R1,C2>
+
318  mdivide_left_tri(const Eigen::Matrix<double,R1,C1> &A,
+
319  const Eigen::Matrix<var,R2,C2> &b) {
+
320  Eigen::Matrix<var,R1,C2> res(b.rows(),b.cols());
+
321 
+
322  stan::math::validate_square(A,"mdivide_left_tri");
+
323  stan::math::validate_multiplicable(A,b,"mdivide_left_tri");
+
324 
+
325  // NOTE: this is not a memory leak, this vari is used in the
+
326  // expression graph to evaluate the adjoint, but is not needed
+
327  // for the returned matrix. Memory will be cleaned up with the arena allocator.
+
328  mdivide_left_tri_dv_vari<TriView,R1,C1,R2,C2> *baseVari = new mdivide_left_tri_dv_vari<TriView,R1,C1,R2,C2>(A,b);
+
329 
+
330  size_t pos = 0;
+
331  for (size_type j = 0; j < res.cols(); j++)
+
332  for (size_type i = 0; i < res.rows(); i++)
+
333  res(i,j).vi_ = baseVari->_variRefC[pos++];
+
334 
+
335  return res;
+
336  }
+
337  template <int TriView,int R1,int C1,int R2,int C2>
+
338  inline
+
339  Eigen::Matrix<var,R1,C2>
+
340  mdivide_left_tri(const Eigen::Matrix<var,R1,C1> &A,
+
341  const Eigen::Matrix<double,R2,C2> &b) {
+
342  Eigen::Matrix<var,R1,C2> res(b.rows(),b.cols());
+
343 
+
344  stan::math::validate_square(A,"mdivide_left_tri");
+
345  stan::math::validate_multiplicable(A,b,"mdivide_left_tri");
+
346 
+
347  // NOTE: this is not a memory leak, this vari is used in the
+
348  // expression graph to evaluate the adjoint, but is not needed
+
349  // for the returned matrix. Memory will be cleaned up with the arena allocator.
+
350  mdivide_left_tri_vd_vari<TriView,R1,C1,R2,C2> *baseVari = new mdivide_left_tri_vd_vari<TriView,R1,C1,R2,C2>(A,b);
+
351 
+
352  size_t pos = 0;
+
353  for (size_type j = 0; j < res.cols(); j++)
+
354  for (size_type i = 0; i < res.rows(); i++)
+
355  res(i,j).vi_ = baseVari->_variRefC[pos++];
+
356 
+
357  return res;
+
358  }
+
359 
+
360  }
+
361 }
+
362 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2multiply_8hpp.html b/doc/api/html/agrad_2rev_2matrix_2multiply_8hpp.html new file mode 100644 index 00000000000..5622060d4ca --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2multiply_8hpp.html @@ -0,0 +1,172 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/multiply.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
multiply.hpp File Reference
+
+
+
#include <boost/utility/enable_if.hpp>
+#include <boost/type_traits.hpp>
+#include <boost/math/tools/promotion.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/typedefs.hpp>
+#include <stan/math/matrix/validate_multiplicable.hpp>
+#include <stan/math/matrix/validate_matching_sizes.hpp>
+#include <stan/math/matrix/validate_square.hpp>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/matrix/typedefs.hpp>
+#include <stan/agrad/rev/matrix/to_var.hpp>
+#include <stan/agrad/rev/matrix/dot_product.hpp>
+#include <stan/agrad/rev/operators/operator_multiplication.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + + + + + + + + + + + + +

+Functions

template<typename T1 , typename T2 >
boost::enable_if_c
+< (boost::is_scalar< T1 >
+::value||boost::is_same< T1,
+var >::value)&&(boost::is_scalar
+< T2 >::value||boost::is_same
+< T2, var >::value), typename
+boost::math::tools::promote_args
+< T1, T2 >::type >::type 
stan::agrad::multiply (const T1 &v, const T2 &c)
 Return the product of two scalars.
 
template<typename T1 , typename T2 , int R2, int C2>
Eigen::Matrix< var, R2, C2 > stan::agrad::multiply (const T1 &c, const Eigen::Matrix< T2, R2, C2 > &m)
 Return the product of scalar and matrix.
 
template<typename T1 , int R1, int C1, typename T2 >
Eigen::Matrix< var, R1, C1 > stan::agrad::multiply (const Eigen::Matrix< T1, R1, C1 > &m, const T2 &c)
 Return the product of scalar and matrix.
 
template<typename T1 , int R1, int C1, typename T2 , int R2, int C2>
boost::enable_if_c
+< boost::is_same< T1, var >
+::value||boost::is_same< T2,
+var >::value, Eigen::Matrix
+< var, R1, C2 > >::type 
stan::agrad::multiply (const Eigen::Matrix< T1, R1, C1 > &m1, const Eigen::Matrix< T2, R2, C2 > &m2)
 Return the product of the specified matrices.
 
template<typename T1 , int C1, typename T2 , int R2>
boost::enable_if_c
+< boost::is_same< T1, var >
+::value||boost::is_same< T2,
+var >::value, var >::type 
stan::agrad::multiply (const Eigen::Matrix< T1, 1, C1 > &rv, const Eigen::Matrix< T2, R2, 1 > &v)
 Return the scalar product of the specified row vector and specified column vector.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2multiply_8hpp_source.html b/doc/api/html/agrad_2rev_2matrix_2multiply_8hpp_source.html new file mode 100644 index 00000000000..28dcc87540d --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2multiply_8hpp_source.html @@ -0,0 +1,202 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/multiply.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
multiply.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__MULTIPLY_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__MULTIPLY_HPP__
+
3 
+
4 #include <boost/utility/enable_if.hpp>
+
5 #include <boost/type_traits.hpp>
+
6 #include <boost/math/tools/promotion.hpp>
+ + + + + +
12 #include <stan/agrad/rev/var.hpp>
+ + + + +
17 
+
18 namespace stan {
+
19  namespace agrad {
+
20 
+
27  template <typename T1, typename T2>
+
28  inline typename
+
29  boost::enable_if_c< (boost::is_scalar<T1>::value || boost::is_same<T1,var>::value) &&
+
30  (boost::is_scalar<T2>::value || boost::is_same<T2,var>::value),
+
31  typename boost::math::tools::promote_args<T1,T2>::type>::type
+
32  multiply(const T1& v, const T2& c) {
+
33  return v * c;
+
34  }
+
35 
+
42  template<typename T1,typename T2,int R2,int C2>
+
43  inline Eigen::Matrix<var,R2,C2> multiply(const T1& c,
+
44  const Eigen::Matrix<T2, R2, C2>& m) {
+
45  // FIXME: pull out to eliminate overpromotion of one side
+
46  // move to matrix.hpp w. promotion?
+
47  return to_var(m) * to_var(c);
+
48  }
+
49 
+
56  template<typename T1,int R1,int C1,typename T2>
+
57  inline Eigen::Matrix<var,R1,C1> multiply(const Eigen::Matrix<T1, R1, C1>& m,
+
58  const T2& c) {
+
59  return to_var(m) * to_var(c);
+
60  }
+
61 
+
72  template<typename T1,int R1,int C1,typename T2,int R2,int C2>
+
73  inline typename
+
74  boost::enable_if_c< boost::is_same<T1,var>::value ||
+
75  boost::is_same<T2,var>::value,
+
76  Eigen::Matrix<var,R1,C2> >::type
+
77  multiply(const Eigen::Matrix<T1,R1,C1>& m1,
+
78  const Eigen::Matrix<T2,R2,C2>& m2) {
+
79  stan::math::validate_multiplicable(m1,m2,"multiply");
+
80  Eigen::Matrix<var,R1,C2> result(m1.rows(),m2.cols());
+
81  for (int i = 0; i < m1.rows(); i++) {
+
82  typename Eigen::Matrix<T1,R1,C1>::ConstRowXpr crow(m1.row(i));
+
83  for (int j = 0; j < m2.cols(); j++) {
+
84  typename Eigen::Matrix<T2,R2,C2>::ConstColXpr ccol(m2.col(j));
+
85  if (j == 0) {
+
86  if (i == 0) {
+
87  result(i,j) = var(new dot_product_vari<T1,T2>(crow,ccol));
+
88  }
+
89  else {
+
90  dot_product_vari<T1,T2> *v2 = static_cast<dot_product_vari<T1,T2>*>(result(0,j).vi_);
+
91  result(i,j) = var(new dot_product_vari<T1,T2>(crow,ccol,NULL,v2));
+
92  }
+
93  }
+
94  else {
+
95  if (i == 0) {
+
96  dot_product_vari<T1,T2> *v1 = static_cast<dot_product_vari<T1,T2>*>(result(i,0).vi_);
+
97  result(i,j) = var(new dot_product_vari<T1,T2>(crow,ccol,v1,NULL));
+
98  }
+
99  else /* if (i != 0 && j != 0) */ {
+
100  dot_product_vari<T1,T2> *v1 = static_cast<dot_product_vari<T1,T2>*>(result(i,0).vi_);
+
101  dot_product_vari<T1,T2> *v2 = static_cast<dot_product_vari<T1,T2>*>(result(0,j).vi_);
+
102  result(i,j) = var(new dot_product_vari<T1,T2>(crow,ccol,v1,v2));
+
103  }
+
104  }
+
105  }
+
106  }
+
107  return result;
+
108  }
+
109 
+
119  template <typename T1,int C1,typename T2,int R2>
+
120  inline typename
+
121  boost::enable_if_c< boost::is_same<T1,var>::value ||
+
122  boost::is_same<T2,var>::value, var >::type
+
123  multiply(const Eigen::Matrix<T1, 1, C1>& rv,
+
124  const Eigen::Matrix<T2, R2, 1>& v) {
+
125  if (rv.size() != v.size())
+
126  throw std::domain_error("row vector and vector must be same length in multiply");
+
127  return dot_product(rv, v);
+
128  }
+
129 
+
130  }
+
131 }
+
132 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2multiply__lower__tri__self__transpose_8hpp.html b/doc/api/html/agrad_2rev_2matrix_2multiply__lower__tri__self__transpose_8hpp.html new file mode 100644 index 00000000000..a63f1c861a8 --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2multiply__lower__tri__self__transpose_8hpp.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/multiply_lower_tri_self_transpose.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
multiply_lower_tri_self_transpose.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + +

+Functions

matrix_v stan::agrad::multiply_lower_tri_self_transpose (const matrix_v &L)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2multiply__lower__tri__self__transpose_8hpp_source.html b/doc/api/html/agrad_2rev_2matrix_2multiply__lower__tri__self__transpose_8hpp_source.html new file mode 100644 index 00000000000..eb78282f018 --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2multiply__lower__tri__self__transpose_8hpp_source.html @@ -0,0 +1,160 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/multiply_lower_tri_self_transpose.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
multiply_lower_tri_self_transpose.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__MULTIPLY_LOWER_TRI_SELF_TRANSPOSE_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__MULTIPLY_LOWER_TRI_SELF_TRANSPOSE_HPP__
+
3 
+
4 #include <vector>
+
5 #include <boost/math/tools/promotion.hpp>
+ + + + + +
11 #include <stan/agrad/rev/var.hpp>
+ + + + +
16 
+
17 namespace stan {
+
18  namespace agrad {
+
19 
+
20  inline matrix_v
+ +
22  // stan::math::validate_square(L,"multiply_lower_tri_self_transpose");
+
23  int K = L.rows();
+
24  int J = L.cols();
+
25  matrix_v LLt(K,K);
+
26  if (K == 0) return LLt;
+
27  // if (K == 1) {
+
28  // LLt(0,0) = L(0,0) * L(0,0);
+
29  // return LLt;
+
30  // }
+
31  int Knz;
+
32  if (K >= J)
+
33  Knz = (K-J)*J + (J * (J + 1)) / 2;
+
34  else // if (K < J)
+
35  Knz = (K * (K + 1)) / 2;
+
36  vari** vs = (vari**)memalloc_.alloc( Knz * sizeof(vari*) );
+
37  int pos = 0;
+
38  for (int m = 0; m < K; ++m)
+
39  for (int n = 0; n < ((J < (m+1))?J:(m+1)); ++n) {
+
40  vs[pos++] = L(m,n).vi_;
+
41  }
+
42  for (int m = 0, mpos=0; m < K; ++m, mpos += (J < m)?J:m) {
+
43  LLt(m,m) = var(new dot_self_vari(vs + mpos, (J < (m+1))?J:(m+1)));
+
44  for (int n = 0, npos = 0; n < m; ++n, npos += (J < n)?J:n) {
+
45  LLt(m,n) = LLt(n,m) = var(new dot_product_vari<var,var>(vs + mpos, vs + npos, (J < (n+1))?J:(n+1)));
+
46  }
+
47  }
+
48  return LLt;
+
49  }
+
50 
+
51  }
+
52 }
+
53 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2quad__form_8hpp.html b/doc/api/html/agrad_2rev_2matrix_2quad__form_8hpp.html new file mode 100644 index 00000000000..5922d075bf4 --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2quad__form_8hpp.html @@ -0,0 +1,233 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/quad_form.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
quad_form.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + + + + +

+Functions

template<typename TA , int RA, int CA, typename TB , int RB, int CB>
boost::enable_if_c
+< boost::is_same< TA, var >
+::value||boost::is_same< TB,
+var >::value, Eigen::Matrix
+< var, CB, CB > >::type 
stan::agrad::quad_form (const Eigen::Matrix< TA, RA, CA > &A, const Eigen::Matrix< TB, RB, CB > &B)
 
template<typename TA , int RA, int CA, typename TB , int RB>
boost::enable_if_c
+< boost::is_same< TA, var >
+::value||boost::is_same< TB,
+var >::value, var >::type 
stan::agrad::quad_form (const Eigen::Matrix< TA, RA, CA > &A, const Eigen::Matrix< TB, RB, 1 > &B)
 
template<typename TA , int RA, int CA, typename TB , int RB, int CB>
boost::enable_if_c
+< boost::is_same< TA, var >
+::value||boost::is_same< TB,
+var >::value, Eigen::Matrix
+< var, CB, CB > >::type 
stan::agrad::quad_form_sym (const Eigen::Matrix< TA, RA, CA > &A, const Eigen::Matrix< TB, RB, CB > &B)
 
template<typename TA , int RA, int CA, typename TB , int RB>
boost::enable_if_c
+< boost::is_same< TA, var >
+::value||boost::is_same< TB,
+var >::value, var >::type 
stan::agrad::quad_form_sym (const Eigen::Matrix< TA, RA, CA > &A, const Eigen::Matrix< TB, RB, 1 > &B)
 
+

Variable Documentation

+ +
+
+ + + + +
quad_form_vari_alloc<TA,RA,CA,TB,RB,CB>* _impl
+
+ +

Definition at line 118 of file quad_form.hpp.

+ +
+
+ +
+
+ + + + +
bool _sym
+
+ +

Definition at line 51 of file quad_form.hpp.

+ +
+
+ +
+
+ + + + +
Eigen::Matrix<TA,RA,CA> A_
+
+ +

Definition at line 48 of file quad_form.hpp.

+ +
+
+ +
+
+ + + + +
Eigen::Matrix<TB,RB,CB> B_
+
+ +

Definition at line 49 of file quad_form.hpp.

+ +
+
+ +
+
+ + + + +
Eigen::Matrix<var,CB,CB> C_
+
+ +

Definition at line 50 of file quad_form.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2quad__form_8hpp_source.html b/doc/api/html/agrad_2rev_2matrix_2quad__form_8hpp_source.html new file mode 100644 index 00000000000..e53ff9821bd --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2quad__form_8hpp_source.html @@ -0,0 +1,297 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/quad_form.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
quad_form.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__QUAD_FORM_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__QUAD_FORM_HPP__
+
3 
+
4 #include <boost/utility/enable_if.hpp>
+
5 #include <boost/type_traits.hpp>
+ + +
8 #include <stan/agrad/rev.hpp>
+ + + + + + +
15 
+
16 namespace stan {
+
17  namespace agrad {
+
18  namespace {
+
19  template<typename TA,int RA,int CA,typename TB,int RB,int CB>
+
20  class quad_form_vari_alloc : public chainable_alloc {
+
21  private:
+
22  inline void compute(const Eigen::Matrix<double,RA,CA> &A,
+
23  const Eigen::Matrix<double,RB,CB> &B)
+
24  {
+
25  int i,j;
+
26  Eigen::Matrix<double,CB,CB> Cd(B.transpose()*A*B);
+
27  for (j = 0; j < C_.cols(); j++) {
+
28  for (i = 0; i < C_.rows(); i++) {
+
29  if (_sym) {
+
30  C_(i,j) = var(new vari(0.5*(Cd(i,j) + Cd(j,i)),false));
+
31  }
+
32  else {
+
33  C_(i,j) = var(new vari(Cd(i,j),false));
+
34  }
+
35  }
+
36  }
+
37  }
+
38 
+
39  public:
+
40  quad_form_vari_alloc(const Eigen::Matrix<TA,RA,CA> &A,
+
41  const Eigen::Matrix<TB,RB,CB> &B,
+
42  bool symmetric = false)
+
43  : A_(A), B_(B), C_(B_.cols(),B_.cols()), _sym(symmetric)
+
44  {
+
45  compute(value_of(A),value_of(B));
+
46  }
+
47 
+
48  Eigen::Matrix<TA,RA,CA> A_;
+
49  Eigen::Matrix<TB,RB,CB> B_;
+
50  Eigen::Matrix<var,CB,CB> C_;
+
51  bool _sym;
+
52  };
+
53 
+
54  template<typename TA,int RA,int CA,typename TB,int RB,int CB>
+
55  class quad_form_vari : public vari {
+
56  protected:
+
57  inline void chainA(Eigen::Matrix<double,RA,CA> &A,
+
58  const Eigen::Matrix<double,RB,CB> &Bd,
+
59  const Eigen::Matrix<double,CB,CB> &adjC) {}
+
60  inline void chainB(Eigen::Matrix<double,RB,CB> &B,
+
61  const Eigen::Matrix<double,RA,CA> &Ad,
+
62  const Eigen::Matrix<double,RB,CB> &Bd,
+
63  const Eigen::Matrix<double,CB,CB> &adjC) {}
+
64 
+
65  inline void chainA(Eigen::Matrix<var,RA,CA> &A,
+
66  const Eigen::Matrix<double,RB,CB> &Bd,
+
67  const Eigen::Matrix<double,CB,CB> &adjC)
+
68  {
+
69  int i,j;
+
70  Eigen::Matrix<double,RA,CA> adjA(Bd*adjC*Bd.transpose());
+
71  for (j = 0; j < A.cols(); j++) {
+
72  for (i = 0; i < A.rows(); i++) {
+
73  A(i,j).vi_->adj_ += adjA(i,j);
+
74  }
+
75  }
+
76  }
+
77  inline void chainB(Eigen::Matrix<var,RB,CB> &B,
+
78  const Eigen::Matrix<double,RA,CA> &Ad,
+
79  const Eigen::Matrix<double,RB,CB> &Bd,
+
80  const Eigen::Matrix<double,CB,CB> &adjC)
+
81  {
+
82  int i,j;
+
83  Eigen::Matrix<double,RA,CA> adjB(Ad*Bd*adjC.transpose() + Ad.transpose()*Bd*adjC);
+
84  for (j = 0; j < B.cols(); j++)
+
85  for (i = 0; i < B.rows(); i++)
+
86  B(i,j).vi_->adj_ += adjB(i,j);
+
87  }
+
88 
+
89  inline void chainAB(Eigen::Matrix<TA,RA,CA> &A,
+
90  Eigen::Matrix<TB,RB,CB> &B,
+
91  const Eigen::Matrix<double,RA,CA> &Ad,
+
92  const Eigen::Matrix<double,RB,CB> &Bd,
+
93  const Eigen::Matrix<double,CB,CB> &adjC)
+
94  {
+
95  chainA(A,Bd,adjC);
+
96  chainB(B,Ad,Bd,adjC);
+
97  }
+
98 
+
99  public:
+
100  quad_form_vari(const Eigen::Matrix<TA,RA,CA> &A,
+
101  const Eigen::Matrix<TB,RB,CB> &B,
+
102  bool symmetric = false)
+
103  : vari(0.0) {
+
104  _impl = new quad_form_vari_alloc<TA,RA,CA,TB,RB,CB>(A,B,symmetric);
+
105  }
+
106 
+
107  virtual void chain() {
+
108  int i,j;
+
109  Eigen::Matrix<double,CB,CB> adjC(_impl->C_.rows(),_impl->C_.cols());
+
110 
+
111  for (j = 0; j < _impl->C_.cols(); j++)
+
112  for (i = 0; i < _impl->C_.rows(); i++)
+
113  adjC(i,j) = _impl->C_(i,j).vi_->adj_;
+
114 
+
115  chainAB(_impl->A_, _impl->B_,
+
116  value_of(_impl->A_), value_of(_impl->B_),
+
117  adjC);
+
118  };
+
119 
+
120  quad_form_vari_alloc<TA,RA,CA,TB,RB,CB> *_impl;
+
121  };
+
122  }
+
123 
+
124  template<typename TA,int RA,int CA,typename TB,int RB,int CB>
+
125  inline typename
+
126  boost::enable_if_c< boost::is_same<TA,var>::value ||
+
127  boost::is_same<TB,var>::value,
+
128  Eigen::Matrix<var,CB,CB> >::type
+
129  quad_form(const Eigen::Matrix<TA,RA,CA> &A,
+
130  const Eigen::Matrix<TB,RB,CB> &B)
+
131  {
+
132  stan::math::validate_square(A,"quad_form");
+
133  stan::math::validate_multiplicable(A,B,"quad_form");
+
134 
+
135  quad_form_vari<TA,RA,CA,TB,RB,CB> *baseVari = new quad_form_vari<TA,RA,CA,TB,RB,CB>(A,B);
+
136 
+
137  return baseVari->_impl->C_;
+
138  }
+
139  template<typename TA,int RA,int CA,typename TB,int RB>
+
140  inline typename
+
141  boost::enable_if_c< boost::is_same<TA,var>::value ||
+
142  boost::is_same<TB,var>::value,
+
143  var >::type
+
144  quad_form(const Eigen::Matrix<TA,RA,CA> &A,
+
145  const Eigen::Matrix<TB,RB,1> &B)
+
146  {
+
147  stan::math::validate_square(A,"quad_form");
+
148  stan::math::validate_multiplicable(A,B,"quad_form");
+
149 
+
150  quad_form_vari<TA,RA,CA,TB,RB,1> *baseVari = new quad_form_vari<TA,RA,CA,TB,RB,1>(A,B);
+
151 
+
152  return baseVari->_impl->C_(0,0);
+
153  }
+
154 
+
155  template<typename TA,int RA,int CA,typename TB,int RB,int CB>
+
156  inline typename
+
157  boost::enable_if_c< boost::is_same<TA,var>::value ||
+
158  boost::is_same<TB,var>::value,
+
159  Eigen::Matrix<var,CB,CB> >::type
+
160  quad_form_sym(const Eigen::Matrix<TA,RA,CA> &A,
+
161  const Eigen::Matrix<TB,RB,CB> &B)
+
162  {
+
163  stan::math::validate_square(A,"quad_form_sym");
+
164  stan::math::validate_symmetric(A,"quad_form_sym");
+
165  stan::math::validate_multiplicable(A,B,"quad_form_sym");
+
166 
+
167  quad_form_vari<TA,RA,CA,TB,RB,CB> *baseVari = new quad_form_vari<TA,RA,CA,TB,RB,CB>(A,B,true);
+
168 
+
169  return baseVari->_impl->C_;
+
170  }
+
171  template<typename TA,int RA,int CA,typename TB,int RB>
+
172  inline typename
+
173  boost::enable_if_c< boost::is_same<TA,var>::value ||
+
174  boost::is_same<TB,var>::value,
+
175  var >::type
+
176  quad_form_sym(const Eigen::Matrix<TA,RA,CA> &A,
+
177  const Eigen::Matrix<TB,RB,1> &B)
+
178  {
+
179  stan::math::validate_square(A,"quad_form_sym");
+
180  stan::math::validate_symmetric(A,"quad_form_sym");
+
181  stan::math::validate_multiplicable(A,B,"quad_form_sym");
+
182 
+
183  quad_form_vari<TA,RA,CA,TB,RB,1> *baseVari = new quad_form_vari<TA,RA,CA,TB,RB,1>(A,B,true);
+
184 
+
185  return baseVari->_impl->C_(0,0);
+
186  }
+
187  }
+
188 }
+
189 
+
190 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2sd_8hpp.html b/doc/api/html/agrad_2rev_2matrix_2sd_8hpp.html new file mode 100644 index 00000000000..b30a7f7cff7 --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2sd_8hpp.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/sd.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
sd.hpp File Reference
+
+
+
#include <cmath>
+#include <vector>
+#include <boost/math/tools/promotion.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/mean.hpp>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/vari.hpp>
+#include <stan/agrad/rev/matrix/stored_gradient_vari.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + +

+Functions

var stan::agrad::sd (const std::vector< var > &v)
 Return the sample standard deviation of the specified standard vector.
 
template<int R, int C>
var stan::agrad::sd (const Eigen::Matrix< var, R, C > &m)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2sd_8hpp_source.html b/doc/api/html/agrad_2rev_2matrix_2sd_8hpp_source.html new file mode 100644 index 00000000000..03d89451ac6 --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2sd_8hpp_source.html @@ -0,0 +1,188 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/sd.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
sd.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__VARIANCE_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__VARIANCE_HPP__
+
3 
+
4 #include <cmath>
+
5 #include <vector>
+
6 #include <boost/math/tools/promotion.hpp>
+ + +
9 #include <stan/agrad/rev/var.hpp>
+
10 #include <stan/agrad/rev/vari.hpp>
+ +
12 
+
13 namespace stan {
+
14 
+
15  namespace agrad {
+
16 
+
17  namespace { // anonymous
+
18 
+
19  // if x.size() = N, and x[i] = x[j] =
+
20  // then lim sd(x) -> 0 [ d/dx[n] sd(x) ] = sqrt(N) / N
+
21 
+
22  var calc_sd(size_t size,
+
23  const var* dtrs) {
+
24  using std::sqrt;
+
25  vari** varis = (vari**) memalloc_.alloc(size * sizeof(vari*));
+
26  for (size_t i = 0; i < size; ++i)
+
27  varis[i] = dtrs[i].vi_;
+
28  double sum = 0.0;
+
29  for (size_t i = 0; i < size; ++i)
+
30  sum += dtrs[i].vi_->val_;
+
31  double mean = sum / size;
+
32  double sum_of_squares = 0;
+
33  for (size_t i = 0; i < size; ++i) {
+
34  double diff = dtrs[i].vi_->val_ - mean;
+
35  sum_of_squares += diff * diff;
+
36  }
+
37  double variance = sum_of_squares / (size - 1);
+
38  double sd = sqrt(variance);
+
39  double* partials = (double*) memalloc_.alloc(size * sizeof(double));
+
40  if (sum_of_squares < 1e-20) {
+
41  double grad_limit = 1 / std::sqrt(size);
+
42  for (size_t i = 0; i < size; ++i)
+
43  partials[i] = grad_limit;
+
44  } else {
+
45  double multiplier = 1 / (sd * (size - 1));
+
46  for (size_t i = 0; i < size; ++i)
+
47  partials[i] = multiplier * (dtrs[i].vi_->val_ - mean);
+
48  }
+
49  return var(new stored_gradient_vari(sd, size,
+
50  varis, partials));
+
51  }
+
52 
+
53  }
+
54 
+
62  var sd(const std::vector<var>& v) {
+ +
64  if (v.size() == 1) return 0;
+
65  return calc_sd(v.size(), &v[0]);
+
66  }
+
67 
+
68  /*
+
69  * Return the sample standard deviation of the specified vector,
+
70  * row vector, or matrix. Raise domain error if size is not
+
71  * greater than zero.
+
72  *
+
73  * @tparam R number of rows
+
74  * @tparam C number of columns
+
75  * @param[in] m input matrix
+
76  * @return sample standard deviation of specified matrix
+
77  */
+
78  template <int R, int C>
+
79  var sd(const Eigen::Matrix<var,R,C>& m) {
+ +
81  if (m.size() == 1) return 0;
+
82  return calc_sd(m.size(), &m(0));
+
83  }
+
84 
+
85  }
+
86 }
+
87 
+
88 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2softmax_8hpp.html b/doc/api/html/agrad_2rev_2matrix_2softmax_8hpp.html new file mode 100644 index 00000000000..328b2bb5e3c --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2softmax_8hpp.html @@ -0,0 +1,198 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/softmax.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
softmax.hpp File Reference
+
+
+
#include <vector>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/softmax.hpp>
+#include <stan/agrad/rev/var.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

Eigen::Matrix< var,
+Eigen::Dynamic, 1 > 
stan::agrad::softmax (const Eigen::Matrix< var, Eigen::Dynamic, 1 > &alpha)
 Return the softmax of the specified Eigen vector.
 
+

Variable Documentation

+ +
+
+ + + + + +
+ + + + +
vari** alpha_
+
+static
+
+ +

Definition at line 15 of file softmax.hpp.

+ +
+
+ +
+
+ + + + +
const int idx_
+
+ +

Definition at line 18 of file softmax.hpp.

+ +
+
+ +
+
+ + + + +
const int size_
+
+ +

Definition at line 17 of file softmax.hpp.

+ +
+
+ +
+
+ + + + +
const double* softmax_alpha_
+
+ +

Definition at line 16 of file softmax.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2softmax_8hpp_source.html b/doc/api/html/agrad_2rev_2matrix_2softmax_8hpp_source.html new file mode 100644 index 00000000000..f55d845e27b --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2softmax_8hpp_source.html @@ -0,0 +1,191 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/softmax.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
softmax.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__SOFTMAX_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__SOFTMAX_HPP__
+
3 
+
4 #include <vector>
+ + +
7 #include <stan/agrad/rev/var.hpp>
+
8 
+
9 namespace stan {
+
10  namespace agrad {
+
11 
+
12  namespace {
+
13  class softmax_elt_vari : public vari {
+
14  private:
+
15  vari** alpha_;
+
16  const double* softmax_alpha_;
+
17  const int size_; // array sizes
+
18  const int idx_; // in in softmax output
+
19  public:
+
20  softmax_elt_vari(double val,
+
21  vari** alpha,
+
22  const double* softmax_alpha,
+
23  int size,
+
24  int idx)
+
25  : vari(val),
+
26  alpha_(alpha),
+
27  softmax_alpha_(softmax_alpha),
+
28  size_(size),
+
29  idx_(idx) {
+
30  }
+
31  void chain() {
+
32  for (int m = 0; m < size_; ++m) {
+
33  if (m == idx_) {
+
34  alpha_[m]->adj_
+
35  += adj_ * softmax_alpha_[idx_] * (1 - softmax_alpha_[m]);
+
36  } else {
+
37  alpha_[m]->adj_
+
38  -= adj_ * softmax_alpha_[idx_] * softmax_alpha_[m];
+
39  }
+
40  }
+
41  }
+
42  };
+
43  }
+
44 
+
45 
+
56  inline Eigen::Matrix<var,Eigen::Dynamic,1>
+
57  softmax(const Eigen::Matrix<var,Eigen::Dynamic,1>& alpha) {
+
58  using Eigen::Matrix;
+
59  using Eigen::Dynamic;
+
60 
+
61  stan::math::validate_nonzero_size(alpha,"vector argument to var softmax");
+
62 
+
63  vari** alpha_vi_array
+
64  = (vari**) operator new(sizeof(vari*) * alpha.size());
+
65  for (int i = 0; i < alpha.size(); ++i)
+
66  alpha_vi_array[i] = alpha(i).vi_;
+
67 
+
68  Matrix<double,Dynamic,1> alpha_d(alpha.size());
+
69  for (int i = 0; i < alpha_d.size(); ++i)
+
70  alpha_d(i) = alpha(i).val();
+
71 
+
72  Matrix<double,Dynamic,1> softmax_alpha_d
+
73  = stan::math::softmax(alpha_d);
+
74 
+
75  double* softmax_alpha_d_array
+
76  = (double*) operator new(sizeof(double) * alpha_d.size());
+
77  for (int i = 0; i < alpha_d.size(); ++i)
+
78  softmax_alpha_d_array[i] = softmax_alpha_d(i);
+
79 
+
80  Matrix<var,Dynamic,1> softmax_alpha(alpha.size());
+
81  for (int k = 0; k < softmax_alpha.size(); ++k)
+
82  softmax_alpha(k) = var(new softmax_elt_vari(softmax_alpha_d[k],
+
83  alpha_vi_array,
+
84  softmax_alpha_d_array,
+
85  alpha.size(),
+
86  k));
+
87  return softmax_alpha;
+
88  }
+
89 
+
90 
+
91  }
+
92 }
+
93 
+
94 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2sort_8hpp.html b/doc/api/html/agrad_2rev_2matrix_2sort_8hpp.html new file mode 100644 index 00000000000..c6dd507c46b --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2sort_8hpp.html @@ -0,0 +1,148 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/sort.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
sort.hpp File Reference
+
+
+
#include <valarray>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+#include <stan/agrad/rev/operators/operator_greater_than.hpp>
+#include <stan/agrad/rev/operators/operator_less_than.hpp>
+#include <vector>
+#include <stan/math/matrix/Eigen.hpp>
+#include <algorithm>
+#include <functional>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + + + + + + +

+Functions

std::vector< var > stan::agrad::sort_asc (std::vector< var > xs)
 Return the specified standard vector in ascending order with gradients kept.
 
std::vector< var > stan::agrad::sort_desc (std::vector< var > xs)
 Return the specified standard vector in descending order with gradients kept.
 
template<int R, int C>
Eigen::Matrix< var, R, C > stan::agrad::sort_asc (Eigen::Matrix< var, R, C > xs)
 Return the specified eigen vector in ascending order with gradients kept.
 
template<int R, int C>
Eigen::Matrix< var, R, C > stan::agrad::sort_desc (Eigen::Matrix< var, R, C > xs)
 Return the specified eigen vector in descending order with gradients kept.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2sort_8hpp_source.html b/doc/api/html/agrad_2rev_2matrix_2sort_8hpp_source.html new file mode 100644 index 00000000000..66031b068b1 --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2sort_8hpp_source.html @@ -0,0 +1,148 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/sort.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
sort.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__SORT_HPP__
+
2 #define __STAN__AGRAD__REV__SORT_HPP__
+
3 
+
4 #include <valarray>
+
5 #include <stan/agrad/rev/var.hpp>
+ + + +
9 #include <vector>
+ +
11 #include <algorithm> // std::sort
+
12 #include <functional> // std::greater
+
13 
+
14 namespace stan {
+
15  namespace agrad {
+
16 
+
24  inline std::vector<var> sort_asc(std::vector<var> xs) {
+
25  std::sort(xs.begin(), xs.end());
+
26  return xs;
+
27  }
+
28 
+
36  inline std::vector<var> sort_desc(std::vector<var> xs) {
+
37  std::sort(xs.begin(), xs.end(), std::greater<var>());
+
38  return xs;
+
39  }
+
40 
+
48  template <int R, int C>
+
49  inline typename Eigen::Matrix<var,R,C> sort_asc(Eigen::Matrix<var,R,C> xs) {
+
50  std::sort(xs.data(), xs.data()+xs.size());
+
51  return xs;
+
52  }
+
53 
+
61  template <int R, int C>
+
62  inline typename Eigen::Matrix<var,R,C> sort_desc(Eigen::Matrix<var,R,C> xs) {
+
63  std::sort(xs.data(), xs.data()+xs.size(), std::greater<var>());
+
64  return xs;
+
65  }
+
66 
+
67  }
+
68 }
+
69 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2squared__dist_8hpp.html b/doc/api/html/agrad_2rev_2matrix_2squared__dist_8hpp.html new file mode 100644 index 00000000000..7a90cf8b54b --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2squared__dist_8hpp.html @@ -0,0 +1,194 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/squared_dist.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
squared_dist.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<int R1, int C1, int R2, int C2>
var stan::agrad::squared_dist (const Eigen::Matrix< var, R1, C1 > &v1, const Eigen::Matrix< var, R2, C2 > &v2)
 
template<int R1, int C1, int R2, int C2>
var stan::agrad::squared_dist (const Eigen::Matrix< var, R1, C1 > &v1, const Eigen::Matrix< double, R2, C2 > &v2)
 
template<int R1, int C1, int R2, int C2>
var stan::agrad::squared_dist (const Eigen::Matrix< double, R1, C1 > &v1, const Eigen::Matrix< var, R2, C2 > &v2)
 
+

Variable Documentation

+ +
+
+ + + + +
size_t length_
+
+ +

Definition at line 21 of file squared_dist.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
vari** v1_
+
+static
+
+ +

Definition at line 19 of file squared_dist.hpp.

+ +
+
+ +
+
+ + + + +
double* v2_
+
+ +

Definition at line 20 of file squared_dist.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2squared__dist_8hpp_source.html b/doc/api/html/agrad_2rev_2matrix_2squared__dist_8hpp_source.html new file mode 100644 index 00000000000..a82df1f36e8 --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2squared__dist_8hpp_source.html @@ -0,0 +1,228 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/squared_dist.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
squared_dist.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__SQUARED_DIST_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__SQUARED_DIST_HPP__
+
3 
+
4 #include <vector>
+ + + + +
9 #include <stan/agrad/rev/var.hpp>
+
10 #include <stan/agrad/rev/vari.hpp>
+ + +
13 
+
14 namespace stan {
+
15  namespace agrad {
+
16  namespace {
+
17  class squared_dist_vv_vari : public vari {
+
18  protected:
+
19  vari** v1_;
+
20  vari** v2_;
+
21  size_t length_;
+
22 
+
23  template<int R1,int C1,int R2,int C2>
+
24  inline static double var_squared_dist(const Eigen::Matrix<var,R1,C1> &v1,
+
25  const Eigen::Matrix<var,R2,C2> &v2) {
+
26  double result = 0;
+
27  for (typename Eigen::Matrix<var,R1,C1>::size_type i = 0;
+
28  i < v1.size(); i++) {
+
29  double diff = v1(i).vi_->val_ - v2(i).vi_->val_;
+
30  result += diff*diff;
+
31  }
+
32  return result;
+
33  }
+
34  public:
+
35  template<int R1,int C1,int R2,int C2>
+
36  squared_dist_vv_vari(const Eigen::Matrix<var,R1,C1> &v1,
+
37  const Eigen::Matrix<var,R2,C2> &v2)
+
38  : vari(var_squared_dist(v1, v2)), length_(v1.size())
+
39  {
+
40  v1_ = (vari**)memalloc_.alloc(length_*sizeof(vari*));
+
41  for (size_t i = 0; i < length_; i++)
+
42  v1_[i] = v1(i).vi_;
+
43 
+
44  v2_ = (vari**)memalloc_.alloc(length_*sizeof(vari*));
+
45  for (size_t i = 0; i < length_; i++)
+
46  v2_[i] = v2(i).vi_;
+
47  }
+
48  virtual void chain() {
+
49  for (size_t i = 0; i < length_; i++) {
+
50  double di = 2 * adj_ * (v1_[i]->val_ - v2_[i]->val_);
+
51  v1_[i]->adj_ += di;
+
52  v2_[i]->adj_ -= di;
+
53  }
+
54  }
+
55  };
+
56  class squared_dist_vd_vari : public vari {
+
57  protected:
+
58  vari** v1_;
+
59  double* v2_;
+
60  size_t length_;
+
61 
+
62  template<int R1,int C1,int R2,int C2>
+
63  inline static double var_squared_dist(const Eigen::Matrix<var,R1,C1> &v1,
+
64  const Eigen::Matrix<double,R2,C2> &v2) {
+
65  double result = 0;
+
66  for (typename Eigen::Matrix<var,R1,C1>::size_type i = 0;
+
67  i < v1.size(); i++) {
+
68  double diff = v1(i).vi_->val_ - v2(i);
+
69  result += diff*diff;
+
70  }
+
71  return result;
+
72  }
+
73  public:
+
74  template<int R1,int C1,int R2,int C2>
+
75  squared_dist_vd_vari(const Eigen::Matrix<var,R1,C1> &v1,
+
76  const Eigen::Matrix<double,R2,C2> &v2)
+
77  : vari(var_squared_dist(v1, v2)), length_(v1.size())
+
78  {
+
79  v1_ = (vari**)memalloc_.alloc(length_*sizeof(vari*));
+
80  for (size_t i = 0; i < length_; i++)
+
81  v1_[i] = v1(i).vi_;
+
82 
+
83  v2_ = (double*)memalloc_.alloc(length_*sizeof(double));
+
84  for (size_t i = 0; i < length_; i++)
+
85  v2_[i] = v2(i);
+
86  }
+
87  virtual void chain() {
+
88  for (size_t i = 0; i < length_; i++) {
+
89  v1_[i]->adj_ += 2 * adj_ * (v1_[i]->val_ - v2_[i]);
+
90  }
+
91  }
+
92  };
+
93  }
+
94 
+
95  template<int R1,int C1,int R2, int C2>
+
96  inline var squared_dist(const Eigen::Matrix<var, R1, C1>& v1,
+
97  const Eigen::Matrix<var, R2, C2>& v2) {
+
98  stan::math::validate_vector(v1,"squared_dist");
+
99  stan::math::validate_vector(v2,"squared_dist");
+
100  stan::math::validate_matching_sizes(v1,v2,"squared_dist");
+
101  return var(new squared_dist_vv_vari(v1,v2));
+
102  }
+
103  template<int R1,int C1,int R2, int C2>
+
104  inline var squared_dist(const Eigen::Matrix<var, R1, C1>& v1,
+
105  const Eigen::Matrix<double, R2, C2>& v2) {
+
106  stan::math::validate_vector(v1,"squared_dist");
+
107  stan::math::validate_vector(v2,"squared_dist");
+
108  stan::math::validate_matching_sizes(v1,v2,"squared_dist");
+
109  return var(new squared_dist_vd_vari(v1,v2));
+
110  }
+
111  template<int R1,int C1,int R2, int C2>
+
112  inline var squared_dist(const Eigen::Matrix<double, R1, C1>& v1,
+
113  const Eigen::Matrix<var, R2, C2>& v2) {
+
114  stan::math::validate_vector(v1,"squared_dist");
+
115  stan::math::validate_vector(v2,"squared_dist");
+
116  stan::math::validate_matching_sizes(v1,v2,"squared_dist");
+
117  return var(new squared_dist_vd_vari(v2,v1));
+
118  }
+
119  }
+
120 }
+
121 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2stan__print_8hpp.html b/doc/api/html/agrad_2rev_2matrix_2stan__print_8hpp.html new file mode 100644 index 00000000000..803af4736a4 --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2stan__print_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/stan_print.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan_print.hpp File Reference
+
+
+
#include <ostream>
+#include <stan/agrad/rev/var.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + +

+Functions

void stan::agrad::stan_print (std::ostream *o, const var &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2stan__print_8hpp_source.html b/doc/api/html/agrad_2rev_2matrix_2stan__print_8hpp_source.html new file mode 100644 index 00000000000..bbd76c2a6ad --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2stan__print_8hpp_source.html @@ -0,0 +1,123 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/stan_print.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan_print.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__STAN_PRINT_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__STAN_PRINT_HPP__
+
3 
+
4 #include <ostream>
+
5 #include <stan/agrad/rev/var.hpp>
+
6 
+
7 namespace stan {
+
8  namespace agrad {
+
9 
+
10  void stan_print(std::ostream* o, const var& x) {
+
11  *o << x.val();
+
12  }
+
13 
+
14  }
+
15 }
+
16 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2sum_8hpp.html b/doc/api/html/agrad_2rev_2matrix_2sum_8hpp.html new file mode 100644 index 00000000000..17441edf5be --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2sum_8hpp.html @@ -0,0 +1,172 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/sum.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
sum.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + +

+Functions

template<int R, int C>
var stan::agrad::sum (const Eigen::Matrix< var, R, C > &m)
 Returns the sum of the coefficients of the specified matrix, column vector or row vector.
 
+

Variable Documentation

+ +
+
+ + + + +
size_t length_
+
+ +

Definition at line 18 of file sum.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
vari** v_
+
+static
+
+ +

Definition at line 17 of file sum.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2sum_8hpp_source.html b/doc/api/html/agrad_2rev_2matrix_2sum_8hpp_source.html new file mode 100644 index 00000000000..019794167e2 --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2sum_8hpp_source.html @@ -0,0 +1,177 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/sum.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
sum.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__SUM_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__SUM_HPP__
+
3 
+
4 #include <vector>
+ + +
7 #include <stan/agrad/rev/var.hpp>
+ + +
10 
+
11 namespace stan {
+
12  namespace agrad {
+
13 
+
14  namespace {
+
15  class sum_v_vari : public vari{
+
16  protected:
+
17  vari** v_;
+
18  size_t length_;
+
19  inline static double var_sum(const var *v, size_t length) {
+
20  double result = 0;
+
21  for (size_t i = 0; i < length; i++)
+
22  result += v[i].vi_->val_;
+
23  return result;
+
24  }
+
25  template<typename Derived>
+
26  inline static double var_sum(const Eigen::DenseBase<Derived> &v) {
+
27  double result = 0;
+
28  for (int i = 0; i < v.size(); i++)
+
29  result += v(i).vi_->val_;
+
30  return result;
+
31  }
+
32  public:
+
33  template<typename Derived>
+
34  sum_v_vari(const Eigen::DenseBase<Derived> &v) :
+
35  vari(var_sum(v)), length_(v.size()) {
+
36  v_ = (vari**)memalloc_.alloc(length_*sizeof(vari*));
+
37  for (size_t i = 0; i < length_; i++)
+
38  v_[i] = v(i).vi_;
+
39  }
+
40  template<int R1,int C1>
+
41  sum_v_vari(const Eigen::Matrix<var,R1,C1> &v1) :
+
42  vari(var_sum(v1)), length_(v1.size()) {
+
43  v_ = (vari**)memalloc_.alloc(length_*sizeof(vari*));
+
44  for (size_t i = 0; i < length_; i++)
+
45  v_[i] = v1(i).vi_;
+
46  }
+
47  sum_v_vari(const var *v, size_t len) :
+
48  vari(var_sum(v,len)), length_(len) {
+
49  v_ = (vari**)memalloc_.alloc(length_*sizeof(vari*));
+
50  for (size_t i = 0; i < length_; i++)
+
51  v_[i] = v[i].vi_;
+
52  }
+
53  virtual void chain() {
+
54  for (size_t i = 0; i < length_; i++) {
+
55  v_[i]->adj_ += adj_;
+
56  }
+
57  }
+
58  };
+
59  }
+
60 
+
67  template <int R, int C>
+
68  inline var sum(const Eigen::Matrix<var,R,C>& m) {
+
69  if (m.size() == 0)
+
70  return 0.0;
+
71  return var(new sum_v_vari(m));
+
72  }
+
73 
+
74  }
+
75 }
+
76 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2tcrossprod_8hpp.html b/doc/api/html/agrad_2rev_2matrix_2tcrossprod_8hpp.html new file mode 100644 index 00000000000..b46094c256c --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2tcrossprod_8hpp.html @@ -0,0 +1,140 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/tcrossprod.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
tcrossprod.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

matrix_v stan::agrad::tcrossprod (const matrix_v &M)
 Returns the result of post-multiplying a matrix by its own transpose.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2tcrossprod_8hpp_source.html b/doc/api/html/agrad_2rev_2matrix_2tcrossprod_8hpp_source.html new file mode 100644 index 00000000000..110c7ac1511 --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2tcrossprod_8hpp_source.html @@ -0,0 +1,161 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/tcrossprod.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
tcrossprod.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__TCROSSPROD_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__TCROSSPROD_HPP__
+
3 
+
4 #include <vector>
+
5 #include <boost/math/tools/promotion.hpp>
+ + + + + +
11 #include <stan/agrad/rev/var.hpp>
+ + + + +
16 
+
17 namespace stan {
+
18  namespace agrad {
+
19 
+
26  inline matrix_v
+
27  tcrossprod(const matrix_v& M) {
+
28  if (M.rows() == 0)
+
29  return matrix_v(0,0);
+
30  // if (M.rows() == 1)
+
31  // return M * M.transpose();
+
32 
+
33  // WAS JUST THIS
+
34  // matrix_v result(M.rows(),M.rows());
+
35  // return result.setZero().selfadjointView<Eigen::Upper>().rankUpdate(M);
+
36 
+
37  matrix_v MMt(M.rows(),M.rows());
+
38 
+
39  vari** vs
+
40  = (vari**)memalloc_.alloc((M.rows() * M.cols() ) * sizeof(vari*));
+
41  int pos = 0;
+
42  for (int m = 0; m < M.rows(); ++m)
+
43  for (int n = 0; n < M.cols(); ++n)
+
44  vs[pos++] = M(m,n).vi_;
+
45  for (int m = 0; m < M.rows(); ++m)
+
46  MMt(m,m) = var(new dot_self_vari(vs + m * M.cols(),M.cols()));
+
47  for (int m = 0; m < M.rows(); ++m) {
+
48  for (int n = 0; n < m; ++n) {
+
49  MMt(m,n) = var(new dot_product_vari<var,var>(vs + m * M.cols(),
+
50  vs + n * M.cols(),
+
51  M.cols()));
+
52  MMt(n,m) = MMt(m,n);
+
53  }
+
54  }
+
55  return MMt;
+
56  }
+
57 
+
58  }
+
59 }
+
60 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2trace__gen__quad__form_8hpp.html b/doc/api/html/agrad_2rev_2matrix_2trace__gen__quad__form_8hpp.html new file mode 100644 index 00000000000..3eac8c7261e --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2trace__gen__quad__form_8hpp.html @@ -0,0 +1,201 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/trace_gen_quad_form.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
trace_gen_quad_form.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename TD , int RD, int CD, typename TA , int RA, int CA, typename TB , int RB, int CB>
boost::enable_if_c
+< boost::is_same< TD, var >
+::value||boost::is_same< TA,
+var >::value||boost::is_same
+< TB, var >::value, var >
+::type 
stan::agrad::trace_gen_quad_form (const Eigen::Matrix< TD, RD, CD > &D, const Eigen::Matrix< TA, RA, CA > &A, const Eigen::Matrix< TB, RB, CB > &B)
 
+

Variable Documentation

+ +
+
+ + + + +
trace_gen_quad_form_vari_alloc<TD,RD,CD,TA,RA,CA,TB,RB,CB>* _impl
+
+ +

Definition at line 99 of file trace_gen_quad_form.hpp.

+ +
+
+ +
+
+ + + + +
Eigen::Matrix<TA,RA,CA> A_
+
+ +

Definition at line 37 of file trace_gen_quad_form.hpp.

+ +
+
+ +
+
+ + + + +
Eigen::Matrix<TB,RB,CB> B_
+
+ +

Definition at line 38 of file trace_gen_quad_form.hpp.

+ +
+
+ +
+
+ + + + +
Eigen::Matrix<TD,RD,CD> D_
+
+ +

Definition at line 36 of file trace_gen_quad_form.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2trace__gen__quad__form_8hpp_source.html b/doc/api/html/agrad_2rev_2matrix_2trace__gen__quad__form_8hpp_source.html new file mode 100644 index 00000000000..0a67fa2705d --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2trace__gen__quad__form_8hpp_source.html @@ -0,0 +1,234 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/trace_gen_quad_form.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
trace_gen_quad_form.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__TRACE_GEN_QUAD_FORM_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__TRACE_GEN_QUAD_FORM_HPP__
+
3 
+
4 #include <boost/utility/enable_if.hpp>
+
5 #include <boost/type_traits.hpp>
+ + + +
9 #include <stan/agrad/rev/var.hpp>
+
10 #include <stan/agrad/rev/vari.hpp>
+ + + + +
15 
+
16 namespace stan {
+
17  namespace agrad {
+
18  namespace {
+
19  template<typename TD,int RD,int CD,
+
20  typename TA,int RA,int CA,
+
21  typename TB,int RB,int CB>
+
22  class trace_gen_quad_form_vari_alloc : public chainable_alloc {
+
23  public:
+
24  trace_gen_quad_form_vari_alloc(const Eigen::Matrix<TD,RD,CD> &D,
+
25  const Eigen::Matrix<TA,RA,CA> &A,
+
26  const Eigen::Matrix<TB,RB,CB> &B)
+
27  : D_(D), A_(A), B_(B)
+
28  { }
+
29 
+
30  double compute() {
+ +
32  value_of(A_),
+
33  value_of(B_));
+
34  }
+
35 
+
36  Eigen::Matrix<TD,RD,CD> D_;
+
37  Eigen::Matrix<TA,RA,CA> A_;
+
38  Eigen::Matrix<TB,RB,CB> B_;
+
39  };
+
40 
+
41  template<typename TD,int RD,int CD,
+
42  typename TA,int RA,int CA,
+
43  typename TB,int RB,int CB>
+
44  class trace_gen_quad_form_vari : public vari {
+
45  protected:
+
46  static inline void computeAdjoints(const double &adj,
+
47  const Eigen::Matrix<double,RD,CD> &D,
+
48  const Eigen::Matrix<double,RA,CA> &A,
+
49  const Eigen::Matrix<double,RB,CB> &B,
+
50  Eigen::Matrix<var,RD,CD> *varD,
+
51  Eigen::Matrix<var,RA,CA> *varA,
+
52  Eigen::Matrix<var,RB,CB> *varB)
+
53  {
+
54  Eigen::Matrix<double,CA,CB> AtB;
+
55  Eigen::Matrix<double,RA,CB> BD;
+
56  if (varB || varA)
+
57  BD.noalias() = B*D;
+
58  if (varB || varD)
+
59  AtB.noalias() = A.transpose()*B;
+
60 
+
61  if (varB) {
+
62  Eigen::Matrix<double,RB,CB> adjB(adj*(A*BD + AtB*D.transpose()));
+
63  int i,j;
+
64  for (j = 0; j < B.cols(); j++)
+
65  for (i = 0; i < B.rows(); i++)
+
66  (*varB)(i,j).vi_->adj_ += adjB(i,j);
+
67  }
+
68  if (varA) {
+
69  Eigen::Matrix<double,RA,CA> adjA(adj*(B*BD.transpose()));
+
70  int i,j;
+
71  for (j = 0; j < A.cols(); j++)
+
72  for (i = 0; i < A.rows(); i++)
+
73  (*varA)(i,j).vi_->adj_ += adjA(i,j);
+
74  }
+
75  if (varD) {
+
76  Eigen::Matrix<double,RD,CD> adjD(adj*(B.transpose()*AtB));
+
77  int i,j;
+
78  for (j = 0; j < D.cols(); j++)
+
79  for (i = 0; i < D.rows(); i++)
+
80  (*varD)(i,j).vi_->adj_ += adjD(i,j);
+
81  }
+
82  }
+
83 
+
84 
+
85  public:
+
86  trace_gen_quad_form_vari(trace_gen_quad_form_vari_alloc<TD,RD,CD,TA,RA,CA,TB,RB,CB> *impl)
+
87  : vari(impl->compute()), _impl(impl) { }
+
88 
+
89  virtual void chain() {
+
90  computeAdjoints(adj_,
+
91  value_of(_impl->D_),
+
92  value_of(_impl->A_),
+
93  value_of(_impl->B_),
+
94  (Eigen::Matrix<var,RD,CD>*)(boost::is_same<TD,var>::value?(&_impl->D_):NULL),
+
95  (Eigen::Matrix<var,RA,CA>*)(boost::is_same<TA,var>::value?(&_impl->A_):NULL),
+
96  (Eigen::Matrix<var,RB,CB>*)(boost::is_same<TB,var>::value?(&_impl->B_):NULL));
+
97  }
+
98 
+
99  trace_gen_quad_form_vari_alloc<TD,RD,CD,TA,RA,CA,TB,RB,CB> *_impl;
+
100  };
+
101  }
+
102 
+
103  template<typename TD,int RD,int CD,
+
104  typename TA,int RA,int CA,
+
105  typename TB,int RB,int CB>
+
106  inline typename
+
107  boost::enable_if_c< boost::is_same<TD,var>::value ||
+
108  boost::is_same<TA,var>::value ||
+
109  boost::is_same<TB,var>::value,
+
110  var >::type
+
111  trace_gen_quad_form(const Eigen::Matrix<TD,RD,CD> &D,
+
112  const Eigen::Matrix<TA,RA,CA> &A,
+
113  const Eigen::Matrix<TB,RB,CB> &B)
+
114  {
+
115  stan::math::validate_square(A,"trace_gen_quad_form");
+
116  stan::math::validate_square(D,"trace_gen_quad_form");
+
117  stan::math::validate_multiplicable(A,B,"trace_gen_quad_form");
+
118  stan::math::validate_multiplicable(B,D,"trace_gen_quad_form");
+
119 
+
120  trace_gen_quad_form_vari_alloc<TD,RD,CD,TA,RA,CA,TB,RB,CB> *baseVari = new trace_gen_quad_form_vari_alloc<TD,RD,CD,TA,RA,CA,TB,RB,CB>(D,A,B);
+
121 
+
122  return var(new trace_gen_quad_form_vari<TD,RD,CD,TA,RA,CA,TB,RB,CB>(baseVari));
+
123  }
+
124  }
+
125 }
+
126 
+
127 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2trace__quad__form_8hpp.html b/doc/api/html/agrad_2rev_2matrix_2trace__quad__form_8hpp.html new file mode 100644 index 00000000000..8fac05ffc71 --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2trace__quad__form_8hpp.html @@ -0,0 +1,185 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/trace_quad_form.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
trace_quad_form.hpp File Reference
+
+
+
#include <boost/utility/enable_if.hpp>
+#include <boost/type_traits.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/typedefs.hpp>
+#include <stan/agrad/rev/matrix/value_of.hpp>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/vari.hpp>
+#include <stan/agrad/rev/matrix/typedefs.hpp>
+#include <stan/math/matrix/trace_quad_form.hpp>
+#include <stan/math/matrix/validate_multiplicable.hpp>
+#include <stan/math/matrix/validate_square.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename TA , int RA, int CA, typename TB , int RB, int CB>
boost::enable_if_c
+< boost::is_same< TA, var >
+::value||boost::is_same< TB,
+var >::value, var >::type 
stan::agrad::trace_quad_form (const Eigen::Matrix< TA, RA, CA > &A, const Eigen::Matrix< TB, RB, CB > &B)
 
+

Variable Documentation

+ +
+
+ + + + +
trace_quad_form_vari_alloc<TA,RA,CA,TB,RB,CB>* _impl
+
+ +

Definition at line 88 of file trace_quad_form.hpp.

+ +
+
+ +
+
+ + + + +
Eigen::Matrix<TA,RA,CA> A_
+
+ +

Definition at line 32 of file trace_quad_form.hpp.

+ +
+
+ +
+
+ + + + +
Eigen::Matrix<TB,RB,CB> B_
+
+ +

Definition at line 33 of file trace_quad_form.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2trace__quad__form_8hpp_source.html b/doc/api/html/agrad_2rev_2matrix_2trace__quad__form_8hpp_source.html new file mode 100644 index 00000000000..e049a8ab859 --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2trace__quad__form_8hpp_source.html @@ -0,0 +1,219 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/trace_quad_form.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
trace_quad_form.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__TRACE_QUAD_FORM_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__TRACE_QUAD_FORM_HPP__
+
3 
+
4 #include <boost/utility/enable_if.hpp>
+
5 #include <boost/type_traits.hpp>
+ + + +
9 #include <stan/agrad/rev/var.hpp>
+
10 #include <stan/agrad/rev/vari.hpp>
+ + + + +
15 
+
16 namespace stan {
+
17  namespace agrad {
+
18  namespace {
+
19  template<typename TA,int RA,int CA,typename TB,int RB,int CB>
+
20  class trace_quad_form_vari_alloc : public chainable_alloc {
+
21  public:
+
22  trace_quad_form_vari_alloc(const Eigen::Matrix<TA,RA,CA> &A,
+
23  const Eigen::Matrix<TB,RB,CB> &B)
+
24  : A_(A), B_(B)
+
25  { }
+
26 
+
27  double compute() {
+ +
29  value_of(B_));
+
30  }
+
31 
+
32  Eigen::Matrix<TA,RA,CA> A_;
+
33  Eigen::Matrix<TB,RB,CB> B_;
+
34  };
+
35 
+
36  template<typename TA,int RA,int CA,typename TB,int RB,int CB>
+
37  class trace_quad_form_vari : public vari {
+
38  protected:
+
39  static inline void chainA(Eigen::Matrix<double,RA,CA> &A,
+
40  const Eigen::Matrix<double,RB,CB> &Bd,
+
41  const double &adjC) {}
+
42  static inline void chainB(Eigen::Matrix<double,RB,CB> &B,
+
43  const Eigen::Matrix<double,RA,CA> &Ad,
+
44  const Eigen::Matrix<double,RB,CB> &Bd,
+
45  const double &adjC) {}
+
46 
+
47  static inline void chainA(Eigen::Matrix<var,RA,CA> &A,
+
48  const Eigen::Matrix<double,RB,CB> &Bd,
+
49  const double &adjC)
+
50  {
+
51  int i,j;
+
52  Eigen::Matrix<double,RA,CA> adjA(adjC*Bd*Bd.transpose());
+
53  for (j = 0; j < A.cols(); j++)
+
54  for (i = 0; i < A.rows(); i++)
+
55  A(i,j).vi_->adj_ += adjA(i,j);
+
56  }
+
57  static inline void chainB(Eigen::Matrix<var,RB,CB> &B,
+
58  const Eigen::Matrix<double,RA,CA> &Ad,
+
59  const Eigen::Matrix<double,RB,CB> &Bd,
+
60  const double &adjC)
+
61  {
+
62  int i,j;
+
63  Eigen::Matrix<double,RA,CA> adjB(adjC*(Ad + Ad.transpose())*Bd);
+
64  for (j = 0; j < B.cols(); j++)
+
65  for (i = 0; i < B.rows(); i++)
+
66  B(i,j).vi_->adj_ += adjB(i,j);
+
67  }
+
68 
+
69  inline void chainAB(Eigen::Matrix<TA,RA,CA> &A,
+
70  Eigen::Matrix<TB,RB,CB> &B,
+
71  const Eigen::Matrix<double,RA,CA> &Ad,
+
72  const Eigen::Matrix<double,RB,CB> &Bd,
+
73  const double &adjC)
+
74  {
+
75  chainA(A,Bd,adjC);
+
76  chainB(B,Ad,Bd,adjC);
+
77  }
+
78 
+
79 
+
80  public:
+
81  trace_quad_form_vari(trace_quad_form_vari_alloc<TA,RA,CA,TB,RB,CB> *impl)
+
82  : vari(impl->compute()), _impl(impl) { }
+
83 
+
84  virtual void chain() {
+
85  chainAB(_impl->A_, _impl->B_,
+
86  value_of(_impl->A_), value_of(_impl->B_),
+
87  adj_);
+
88  };
+
89 
+
90  trace_quad_form_vari_alloc<TA,RA,CA,TB,RB,CB> *_impl;
+
91  };
+
92  }
+
93 
+
94  template<typename TA,int RA,int CA,typename TB,int RB,int CB>
+
95  inline typename
+
96  boost::enable_if_c< boost::is_same<TA,var>::value ||
+
97  boost::is_same<TB,var>::value,
+
98  var >::type
+
99  trace_quad_form(const Eigen::Matrix<TA,RA,CA> &A,
+
100  const Eigen::Matrix<TB,RB,CB> &B)
+
101  {
+
102  stan::math::validate_square(A,"trace_quad_form");
+
103  stan::math::validate_multiplicable(A,B,"trace_quad_form");
+
104 
+
105  trace_quad_form_vari_alloc<TA,RA,CA,TB,RB,CB> *baseVari = new trace_quad_form_vari_alloc<TA,RA,CA,TB,RB,CB>(A,B);
+
106 
+
107  return var(new trace_quad_form_vari<TA,RA,CA,TB,RB,CB>(baseVari));
+
108  }
+
109  }
+
110 }
+
111 
+
112 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2typedefs_8hpp.html b/doc/api/html/agrad_2rev_2matrix_2typedefs_8hpp.html new file mode 100644 index 00000000000..8a7e4b3014b --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2typedefs_8hpp.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/typedefs.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
typedefs.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Typedefs

typedef Eigen::Matrix< var,
+Eigen::Dynamic, Eigen::Dynamic > 
stan::agrad::matrix_v
 The type of a matrix holding stan::agrad::var values.
 
typedef Eigen::Matrix< var,
+Eigen::Dynamic, 1 > 
stan::agrad::vector_v
 The type of a (column) vector holding stan::agrad::var values.
 
typedef Eigen::Matrix< var,
+1, Eigen::Dynamic > 
stan::agrad::row_vector_v
 The type of a row vector holding stan::agrad::var values.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2typedefs_8hpp_source.html b/doc/api/html/agrad_2rev_2matrix_2typedefs_8hpp_source.html new file mode 100644 index 00000000000..9773878a2d6 --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2typedefs_8hpp_source.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/typedefs.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
typedefs.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__TYPEDEFS_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__TYPEDEFS_HPP__
+
3 
+ +
5 #include <stan/agrad/rev/var.hpp>
+
6 
+
7 namespace stan {
+
8  namespace agrad {
+ +
10 
+
15  typedef
+
16  Eigen::Matrix<var,Eigen::Dynamic,Eigen::Dynamic>
+ +
18 
+
23  typedef
+
24  Eigen::Matrix<var,Eigen::Dynamic,1>
+ +
26 
+
31  typedef
+
32  Eigen::Matrix<var,1,Eigen::Dynamic>
+ +
34 
+
35  }
+
36 }
+
37 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2value__of_8hpp.html b/doc/api/html/agrad_2rev_2matrix_2value__of_8hpp.html new file mode 100644 index 00000000000..2b66e00b39e --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2value__of_8hpp.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/value_of.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
value_of.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + +

+Functions

template<int R, int C>
const Eigen::Matrix< double, R,
+C > & 
stan::agrad::value_of (const Eigen::Matrix< double, R, C > &M)
 Convert a matrix to a matrix of doubles.
 
template<int R, int C>
Eigen::Matrix< double, R, C > stan::agrad::value_of (const Eigen::Matrix< var, R, C > &M)
 Convert a matrix to a matrix of doubles.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2value__of_8hpp_source.html b/doc/api/html/agrad_2rev_2matrix_2value__of_8hpp_source.html new file mode 100644 index 00000000000..b93562e211a --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2value__of_8hpp_source.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/value_of.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
value_of.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__VALUE_OF_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__VALUE_OF_HPP__
+
3 
+ +
5 #include <stan/agrad/rev/var.hpp>
+
6 
+
7 namespace stan {
+
8  namespace agrad {
+
15  template<int R,int C>
+
16  inline const Eigen::Matrix<double,R,C> &value_of(const Eigen::Matrix<double,R,C> &M) {
+
17  return M;
+
18  }
+
19 
+
26  template<int R,int C>
+
27  inline Eigen::Matrix<double,R,C> value_of(const Eigen::Matrix<var,R,C> &M) {
+
28  int i,j;
+
29  Eigen::Matrix<double,R,C> Md(M.rows(),M.cols());
+
30  for (j = 0; j < M.cols(); j++)
+
31  for (i = 0; i < M.rows(); i++)
+
32  Md(i,j) = M(i,j).vi_->val_;
+
33  return Md;
+
34  }
+
35  }
+
36 }
+
37 
+
38 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2variance_8hpp.html b/doc/api/html/agrad_2rev_2matrix_2variance_8hpp.html new file mode 100644 index 00000000000..0b2f54f0f85 --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2variance_8hpp.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/variance.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
variance.hpp File Reference
+
+
+
#include <vector>
+#include <boost/math/tools/promotion.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/mean.hpp>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/vari.hpp>
+#include <stan/agrad/rev/matrix/stored_gradient_vari.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + +

+Functions

var stan::agrad::variance (const std::vector< var > &v)
 Return the sample variance of the specified standard vector.
 
template<int R, int C>
var stan::agrad::variance (const Eigen::Matrix< var, R, C > &m)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_2variance_8hpp_source.html b/doc/api/html/agrad_2rev_2matrix_2variance_8hpp_source.html new file mode 100644 index 00000000000..0fab95f4776 --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_2variance_8hpp_source.html @@ -0,0 +1,176 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/variance.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
variance.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__VARIANCE_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__VARIANCE_HPP__
+
3 
+
4 #include <vector>
+
5 #include <boost/math/tools/promotion.hpp>
+ + +
8 #include <stan/agrad/rev/var.hpp>
+ + +
11 
+
12 namespace stan {
+
13 
+
14  namespace agrad {
+
15 
+
16  namespace { // anonymous
+
17 
+
18  var calc_variance(size_t size,
+
19  const var* dtrs) {
+
20  vari** varis = (vari**) memalloc_.alloc(size * sizeof(vari*));
+
21  for (size_t i = 0; i < size; ++i)
+
22  varis[i] = dtrs[i].vi_;
+
23  double sum = 0.0;
+
24  for (size_t i = 0; i < size; ++i)
+
25  sum += dtrs[i].vi_->val_;
+
26  double mean = sum / size;
+
27  double sum_of_squares = 0;
+
28  for (size_t i = 0; i < size; ++i) {
+
29  double diff = dtrs[i].vi_->val_ - mean;
+
30  sum_of_squares += diff * diff;
+
31  }
+
32  double variance = sum_of_squares / (size - 1);
+
33  double* partials = (double*) memalloc_.alloc(size * sizeof(double));
+
34  double two_over_size_m1 = 2 / (size - 1);
+
35  for (size_t i = 0; i < size; ++i)
+
36  partials[i] = two_over_size_m1 * (dtrs[i].vi_->val_ - mean);
+
37  return var(new stored_gradient_vari(variance, size,
+
38  varis, partials));
+
39  }
+
40 
+
41  }
+
42 
+
50  var variance(const std::vector<var>& v) {
+ +
52  if (v.size() == 1) return 0;
+
53  return calc_variance(v.size(), &v[0]);
+
54  }
+
55 
+
56  /*
+
57  * Return the sample variance of the specified vector, row vector,
+
58  * or matrix. Raise domain error if size is not greater than
+
59  * zero.
+
60  *
+
61  * @tparam R number of rows
+
62  * @tparam C number of columns
+
63  * @param[in] m input matrix
+
64  * @return sample variance of specified matrix
+
65  */
+
66  template <int R, int C>
+
67  var variance(const Eigen::Matrix<var,R,C>& m) {
+ +
69  if (m.size() == 1) return 0;
+
70  return calc_variance(m.size(), &m(0));
+
71  }
+
72 
+
73  }
+
74 }
+
75 
+
76 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_8hpp.html b/doc/api/html/agrad_2rev_2matrix_8hpp.html new file mode 100644 index 00000000000..904b8ce9ee4 --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_8hpp.html @@ -0,0 +1,143 @@ + + + + + +Stan: src/stan/agrad/rev/matrix.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
matrix.hpp File Reference
+
+
+
#include <stan/agrad/rev/matrix/Eigen_NumTraits.hpp>
+#include <stan/agrad/rev/matrix/crossprod.hpp>
+#include <stan/agrad/rev/matrix/determinant.hpp>
+#include <stan/agrad/rev/matrix/divide.hpp>
+#include <stan/agrad/rev/matrix/dot_product.hpp>
+#include <stan/agrad/rev/matrix/dot_self.hpp>
+#include <stan/agrad/rev/matrix/grad.hpp>
+#include <stan/agrad/rev/matrix/initialize_variable.hpp>
+#include <stan/agrad/rev/matrix/ldlt.hpp>
+#include <stan/agrad/rev/matrix/log_determinant.hpp>
+#include <stan/agrad/rev/matrix/log_determinant_spd.hpp>
+#include <stan/agrad/rev/matrix/log_softmax.hpp>
+#include <stan/agrad/rev/matrix/log_sum_exp.hpp>
+#include <stan/agrad/rev/matrix/mdivide_left.hpp>
+#include <stan/agrad/rev/matrix/mdivide_left_spd.hpp>
+#include <stan/agrad/rev/matrix/mdivide_left_tri.hpp>
+#include <stan/agrad/rev/matrix/multiply.hpp>
+#include <stan/agrad/rev/matrix/multiply_lower_tri_self_transpose.hpp>
+#include <stan/agrad/rev/matrix/quad_form.hpp>
+#include <stan/agrad/rev/matrix/sd.hpp>
+#include <stan/agrad/rev/matrix/softmax.hpp>
+#include <stan/agrad/rev/matrix/sort.hpp>
+#include <stan/agrad/rev/matrix/squared_dist.hpp>
+#include <stan/agrad/rev/matrix/stan_print.hpp>
+#include <stan/agrad/rev/matrix/stored_gradient_vari.hpp>
+#include <stan/agrad/rev/matrix/sum.hpp>
+#include <stan/agrad/rev/matrix/tcrossprod.hpp>
+#include <stan/agrad/rev/matrix/to_var.hpp>
+#include <stan/agrad/rev/matrix/trace_gen_quad_form.hpp>
+#include <stan/agrad/rev/matrix/trace_quad_form.hpp>
+#include <stan/agrad/rev/matrix/typedefs.hpp>
+#include <stan/agrad/rev/matrix/value_of.hpp>
+#include <stan/agrad/rev/matrix/variance.hpp>
+#include <stan/agrad/rev/error_handling/matrix.hpp>
+
+

Go to the source code of this file.

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_2rev_2matrix_8hpp_source.html b/doc/api/html/agrad_2rev_2matrix_8hpp_source.html new file mode 100644 index 00000000000..78874786939 --- /dev/null +++ b/doc/api/html/agrad_2rev_2matrix_8hpp_source.html @@ -0,0 +1,147 @@ + + + + + +Stan: src/stan/agrad/rev/matrix.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
matrix.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX_HPP__
+
3 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
37 
+ +
39 
+
40 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_8hpp.html b/doc/api/html/agrad_8hpp.html new file mode 100644 index 00000000000..8b58b681048 --- /dev/null +++ b/doc/api/html/agrad_8hpp.html @@ -0,0 +1,109 @@ + + + + + +Stan: src/stan/agrad.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
agrad.hpp File Reference
+
+
+ +

Go to the source code of this file.

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad_8hpp_source.html b/doc/api/html/agrad_8hpp_source.html new file mode 100644 index 00000000000..709c0bf8563 --- /dev/null +++ b/doc/api/html/agrad_8hpp_source.html @@ -0,0 +1,119 @@ + + + + + +Stan: src/stan/agrad.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
agrad.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD_HPP__
+
2 #define __STAN__AGRAD_HPP__
+
3 
+
4 // This header shouldn't be included directly.
+
5 // For reverse mode autodiff, include:
+
6 // #include <stan/agrad/rev.hpp>
+
7 // #include <stan/agrad/rev/matrix.hpp>
+
8 // For forward mode autodiff, include:
+
9 // #include <stan/agrad/fwd.hpp>
+
10 // #include <stan/agrad/fwd/matrix.hpp>
+
11 
+
12 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad__thread__safe_8hpp.html b/doc/api/html/agrad__thread__safe_8hpp.html new file mode 100644 index 00000000000..2e14eb999af --- /dev/null +++ b/doc/api/html/agrad__thread__safe_8hpp.html @@ -0,0 +1,473 @@ + + + + + +Stan: src/stan/agrad/agrad_thread_safe.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
agrad_thread_safe.hpp File Reference
+
+
+
#include <stdio.h>
+#include <stdlib.h>
+#include <vector>
+#include <cmath>
+#include <cstddef>
+#include "stan/memory/stack_alloc.hpp"
+
+

Go to the source code of this file.

+ + + + + + + + +

+Classes

class  stan::agrad::vari
 The variable implementation base class. More...
 
class  stan::agrad::var
 Independent (input) and dependent (output) variables for gradients. More...
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

bool stan::agrad::operator== (const var &a, const var &b)
 Equality operator comparing two variables' values (C++).
 
bool stan::agrad::operator== (const var &a, const double &b)
 Equality operator comparing a variable's value and a double (C++).
 
bool stan::agrad::operator== (const double &a, const var &b)
 Equality operator comparing a scalar and a variable's value (C++).
 
bool stan::agrad::operator!= (const var &a, const var &b)
 Inequality operator comparing two variables' values (C++).
 
bool stan::agrad::operator!= (const var &a, const double &b)
 Inequality operator comparing a variable's value and a double (C++).
 
bool stan::agrad::operator!= (const double &a, const var &b)
 Inequality operator comparing a double and a variable's value (C++).
 
bool stan::agrad::operator< (const var &a, const var &b)
 Less than operator comparing variables' values (C++).
 
bool stan::agrad::operator< (const var &a, const double &b)
 Less than operator comparing variable's value and a double (C++).
 
bool stan::agrad::operator< (const double &a, const var &b)
 Less than operator comparing a double and variable's value (C++).
 
bool stan::agrad::operator> (const var &a, const var &b)
 Greater than operator comparing variables' values (C++).
 
bool stan::agrad::operator> (const var &a, const double &b)
 Greater than operator comparing variable's value and double (C++).
 
bool stan::agrad::operator> (const double &a, const var &b)
 Greater than operator comparing a double and a variable's value (C++).
 
bool stan::agrad::operator<= (const var &a, const var &b)
 Less than or equal operator comparing two variables' values (C++).
 
bool stan::agrad::operator<= (const var &a, const double &b)
 Less than or equal operator comparing a variable's value and a scalar (C++).
 
bool stan::agrad::operator<= (const double &a, const var &b)
 Less than or equal operator comparing a double and variable's value (C++).
 
bool stan::agrad::operator>= (const var &a, const var &b)
 Greater than or equal operator comparing two variables' values (C++).
 
bool stan::agrad::operator>= (const var &a, const double &b)
 Greater than or equal operator comparing variable's value and double (C++).
 
bool stan::agrad::operator>= (const double &a, const var &b)
 Greater than or equal operator comparing double and variable's value (C++).
 
bool stan::agrad::operator! (const var &a)
 Prefix logical negation for the value of variables (C++).
 
var stan::agrad::operator+ (const var &a)
 Unary plus operator for variables (C++).
 
var stan::agrad::operator- (const var &a)
 Unary negation operator for variables (C++).
 
var stan::agrad::operator+ (const var &a, const var &b)
 Addition operator for variables (C++).
 
var stan::agrad::operator+ (const var &a, const double &b)
 Addition operator for variable and scalar (C++).
 
var stan::agrad::operator+ (const double &a, const var &b)
 Addition operator for scalar and variable (C++).
 
var stan::agrad::operator- (const var &a, const var &b)
 Subtraction operator for variables (C++).
 
var stan::agrad::operator- (const var &a, const double &b)
 Subtraction operator for variable and scalar (C++).
 
var stan::agrad::operator- (const double &a, const var &b)
 Subtraction operator for scalar and variable (C++).
 
var stan::agrad::operator* (const var &a, const var &b)
 Multiplication operator for two variables (C++).
 
var stan::agrad::operator* (const var &a, const double &b)
 Multiplication operator for a variable and a scalar (C++).
 
var stan::agrad::operator* (const double &a, const var &b)
 Multiplication operator for a scalar and a variable (C++).
 
var stan::agrad::operator/ (const var &a, const var &b)
 Division operator for two variables (C++).
 
var stan::agrad::operator/ (const var &a, const double &b)
 Division operator for dividing a variable by a scalar (C++).
 
var stan::agrad::operator/ (const double &a, const var &b)
 Division operator for dividing a scalar by a variable (C++).
 
var & stan::agrad::operator++ (var &a)
 Prefix increment operator for variables (C++).
 
var stan::agrad::operator++ (var &a, int)
 Postfix increment operator for variables (C++).
 
var & stan::agrad::operator-- (var &a)
 Prefix decrement operator for variables (C++).
 
var stan::agrad::operator-- (var &a, int)
 Postfix decrement operator for variables (C++).
 
var stan::agrad::exp (const var &a)
 Return the exponentiation of the specified variable (cmath).
 
var stan::agrad::log (const var &a)
 Return the natural log of the specified variable (cmath).
 
var stan::agrad::log10 (const var &a)
 Return the base 10 log of the specified variable (cmath).
 
var stan::agrad::sqrt (const var &a)
 Return the square root of the specified variable (cmath).
 
var stan::agrad::pow (const var &base, const var &exponent)
 Return the base raised to the power of the exponent (cmath).
 
var stan::agrad::pow (const var &base, const double &exponent)
 Return the base variable raised to the power of the exponent scalar (cmath).
 
var stan::agrad::pow (const double &base, const var &exponent)
 Return the base scalar raised to the power of the exponent variable (cmath).
 
var stan::agrad::cos (const var &a)
 Return the cosine of a radian-scaled variable (cmath).
 
var stan::agrad::sin (const var &a)
 Return the sine of a radian-scaled variable (cmath).
 
var stan::agrad::tan (const var &a)
 Return the tangent of a radian-scaled variable (cmath).
 
var stan::agrad::acos (const var &a)
 Return the principal value of the arc cosine of a variable, in radians (cmath).
 
var stan::agrad::asin (const var &a)
 Return the principal value of the arc sine, in radians, of the specified variable (cmath).
 
var stan::agrad::atan (const var &a)
 Return the principal value of the arc tangent, in radians, of the specified variable (cmath).
 
var stan::agrad::atan2 (const var &a, const var &b)
 Return the principal value of the arc tangent, in radians, of the first variable divided by the second (cmath).
 
var stan::agrad::atan2 (const var &a, const double &b)
 Return the principal value of the arc tangent, in radians, of the first variable divided by the second scalar (cmath).
 
var stan::agrad::atan2 (const double &a, const var &b)
 Return the principal value of the arc tangent, in radians, of the first scalar divided by the second variable (cmath).
 
var stan::agrad::cosh (const var &a)
 Return the hyperbolic cosine of the specified variable (cmath).
 
var stan::agrad::sinh (const var &a)
 Return the hyperbolic sine of the specified variable (cmath).
 
var stan::agrad::tanh (const var &a)
 Return the hyperbolic tangent of the specified variable (cmath).
 
var stan::agrad::fabs (const var &a)
 Return the absolute value of the variable (cmath).
 
var stan::agrad::floor (const var &a)
 Return the floor of the specified variable (cmath).
 
var stan::agrad::ceil (const var &a)
 Return the ceiling of the specified variable (cmath).
 
var stan::agrad::fmod (const var &a, const var &b)
 Return the floating point remainder after dividing the first variable by the second (cmath).
 
var stan::agrad::fmod (const var &a, const double &b)
 Return the floating point remainder after dividing the the first variable by the second scalar (cmath).
 
var stan::agrad::fmod (const double &a, const var &b)
 Return the floating point remainder after dividing the first scalar by the second variable (cmath).
 
var stan::agrad::abs (const var &a)
 Return the absolute value of the variable (std).
 
+

Variable Documentation

+ +
+
+ + + + +
double ad_
+
+ +

Definition at line 189 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
vari* avi_
+
+static
+
+ +

Definition at line 155 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + +
double bd_
+
+ +

Definition at line 178 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + +
vari* bvi_
+
+ +

Definition at line 166 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + +
double cd_
+
+ +

Definition at line 217 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + +
vari* cvi_
+
+ +

Definition at line 203 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + +
const double exp_val_
+
+ +

Definition at line 457 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + +
memory::stack_alloc memalloc_
+
+ +

Definition at line 22 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
std::vector<vari*> var_stack_
+
+static
+
+ +

Definition at line 21 of file agrad_thread_safe.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/agrad__thread__safe_8hpp_source.html b/doc/api/html/agrad__thread__safe_8hpp_source.html new file mode 100644 index 00000000000..55a8752a265 --- /dev/null +++ b/doc/api/html/agrad__thread__safe_8hpp_source.html @@ -0,0 +1,1156 @@ + + + + + +Stan: src/stan/agrad/agrad_thread_safe.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
agrad_thread_safe.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__AGRAD_HPP__
+
2 #define __STAN__AGRAD__AGRAD_HPP__
+
3 
+
4 #include <stdio.h>
+
5 #include <stdlib.h>
+
6 #include <vector>
+
7 #include <cmath>
+
8 #include <cstddef>
+ +
10 
+
11 // FIXME: Should include common defs, not this huge cut-and-paste!
+
12 
+
13 namespace stan {
+
14 
+
15  namespace agrad {
+
16 
+
17  class vari;
+
18 
+
19  namespace {
+
20  struct var_allocator {
+
21  std::vector<vari*> var_stack_;
+
22  memory::stack_alloc memalloc_;
+
23  inline void* alloc(size_t nbytes) {
+
24  return memalloc_.alloc(nbytes);
+
25  }
+
26  inline void recover() {
+
27  var_stack_.resize(0);
+ +
29  }
+
30  inline void free() {
+ +
32  }
+
33  };
+
34 #ifdef AGRAD_THREAD_SAFE
+
35  __thread
+
36 #endif
+
37  var_allocator* allocator_;
+
38  }
+
39 
+
53  class vari {
+
54  private:
+
55  friend class var;
+
56 
+
57  public:
+
58 
+
62  const double val_;
+
63 
+
68  double adj_;
+
69 
+
82  vari(const double x):
+
83  val_(x),
+
84  adj_(0.0) {
+
85  allocator_->var_stack_.push_back(this);
+
86  }
+
87 
+
93  virtual void chain() {
+
94  }
+
95 
+
105  static inline void* operator new(size_t nbytes) {
+
106  if (allocator_ == 0)
+
107  allocator_ = new var_allocator();
+
108  return allocator_->alloc(nbytes);
+
109  }
+
110 
+
114  static void recover_memory() {
+
115  return allocator_->recover();
+
116  // allocator_.var_stack_.resize(0);
+
117  // allocator_.memalloc_.recover_all();
+
118  }
+
119 
+
123  static void free_memory() {
+
124  allocator_->free();
+
125  // allocator_.memalloc_.free_all();
+
126  }
+
127 
+
128  private:
+
137  static void grad(vari* vi) {
+
138  std::vector<vari*>::iterator it = allocator_->var_stack_.end();
+
139  std::vector<vari*>::iterator begin = allocator_->var_stack_.begin();
+
140  // skip to root variable
+
141  for (; (it >= begin) && (*it != vi); --it)
+
142  ;
+
143  vi->adj_ = 1.0; // droot/droot = 1
+
144  // propagate derivates for remaining vars
+
145  for (; it >= begin; --it)
+
146  (*it)->chain();
+
147  }
+
148 
+
149  };
+
150 
+
151  namespace {
+
152 
+
153  class op_v_vari : public vari {
+
154  protected:
+
155  vari* avi_;
+
156  public:
+
157  op_v_vari(double f, vari* avi) :
+
158  vari(f),
+
159  avi_(avi) {
+
160  }
+
161  };
+
162 
+
163  class op_vv_vari : public vari {
+
164  protected:
+
165  vari* avi_;
+
166  vari* bvi_;
+
167  public:
+
168  op_vv_vari(double f, vari* avi, vari* bvi):
+
169  vari(f),
+
170  avi_(avi),
+
171  bvi_(bvi) {
+
172  }
+
173  };
+
174 
+
175  class op_vd_vari : public vari {
+
176  protected:
+
177  vari* avi_;
+
178  double bd_;
+
179  public:
+
180  op_vd_vari(double f, vari* avi, double b) :
+
181  vari(f),
+
182  avi_(avi),
+
183  bd_(b) {
+
184  }
+
185  };
+
186 
+
187  class op_dv_vari : public vari {
+
188  protected:
+
189  double ad_;
+
190  vari* bvi_;
+
191  public:
+
192  op_dv_vari(double f, double a, vari* bvi) :
+
193  vari(f),
+
194  ad_(a),
+
195  bvi_(bvi) {
+
196  }
+
197  };
+
198 
+
199  class op_vvv_vari : public vari {
+
200  protected:
+
201  vari* avi_;
+
202  vari* bvi_;
+
203  vari* cvi_;
+
204  public:
+
205  op_vvv_vari(double f, vari* avi, vari* bvi, vari* cvi) :
+
206  vari(f),
+
207  avi_(avi),
+
208  bvi_(bvi),
+
209  cvi_(cvi) {
+
210  }
+
211  };
+
212 
+
213  class op_vvd_vari : public vari {
+
214  protected:
+
215  vari* avi_;
+
216  vari* bvi_;
+
217  double cd_;
+
218  public:
+
219  op_vvd_vari(double f, vari* avi, vari* bvi, double c) :
+
220  vari(f),
+
221  avi_(avi),
+
222  bvi_(bvi),
+
223  cd_(c) {
+
224  }
+
225  };
+
226 
+
227  class op_vdv_vari : public vari {
+
228  protected:
+
229  vari* avi_;
+
230  double bd_;
+
231  vari* cvi_;
+
232  public:
+
233  op_vdv_vari(double f, vari* avi, double b, vari* cvi) :
+
234  vari(f),
+
235  avi_(avi),
+
236  bd_(b),
+
237  cvi_(cvi) {
+
238  }
+
239  };
+
240 
+
241  class op_vdd_vari : public vari {
+
242  protected:
+
243  vari* avi_;
+
244  double bd_;
+
245  double cd_;
+
246  public:
+
247  op_vdd_vari(double f, vari* avi, double b, double c) :
+
248  vari(f),
+
249  avi_(avi),
+
250  bd_(b),
+
251  cd_(c) {
+
252  }
+
253  };
+
254 
+
255  class op_dvv_vari : public vari {
+
256  protected:
+
257  double ad_;
+
258  vari* bvi_;
+
259  vari* cvi_;
+
260  public:
+
261  op_dvv_vari(double f, double a, vari* bvi, vari* cvi) :
+
262  vari(f),
+
263  ad_(a),
+
264  bvi_(bvi),
+
265  cvi_(cvi) {
+
266  }
+
267  };
+
268 
+
269  class op_dvd_vari : public vari {
+
270  protected:
+
271  double ad_;
+
272  vari* bvi_;
+
273  double cd_;
+
274  public:
+
275  op_dvd_vari(double f, double a, vari* bvi, double c) :
+
276  vari(f),
+
277  ad_(a),
+
278  bvi_(bvi),
+
279  cd_(c) {
+
280  }
+
281  };
+
282 
+
283  class op_ddv_vari : public vari {
+
284  protected:
+
285  double ad_;
+
286  double bd_;
+
287  vari* cvi_;
+
288  public:
+
289  op_ddv_vari(double f, double a, double b, vari* cvi) :
+
290  vari(f),
+
291  ad_(a),
+
292  bd_(b),
+
293  cvi_(cvi) {
+
294  }
+
295  };
+
296 
+
297  class neg_vari : public op_v_vari {
+
298  public:
+
299  neg_vari(vari* avi) :
+
300  op_v_vari(-(avi->val_), avi) {
+
301  }
+
302  void chain() {
+
303  avi_->adj_ -= adj_;
+
304  }
+
305  };
+
306 
+
307 
+
308  class add_vv_vari : public op_vv_vari {
+
309  public:
+
310  add_vv_vari(vari* avi, vari* bvi) :
+
311  op_vv_vari(avi->val_ + bvi->val_, avi, bvi) {
+
312  }
+
313  void chain() {
+
314  avi_->adj_ += adj_;
+
315  bvi_->adj_ += adj_;
+
316  }
+
317  };
+
318 
+
319  class add_vd_vari : public op_vd_vari {
+
320  public:
+
321  add_vd_vari(vari* avi, double b) :
+
322  op_vd_vari(avi->val_ + b, avi, b) {
+
323  }
+
324  void chain() {
+
325  avi_->adj_ += adj_;
+
326  }
+
327  };
+
328 
+
329  class increment_vari : public op_v_vari {
+
330  public:
+
331  increment_vari(vari* avi) :
+
332  op_v_vari(avi->val_ + 1.0, avi) {
+
333  }
+
334  void chain() {
+
335  avi_->adj_ += adj_;
+
336  }
+
337  };
+
338 
+
339  class decrement_vari : public op_v_vari {
+
340  public:
+
341  decrement_vari(vari* avi) :
+
342  op_v_vari(avi->val_ - 1.0, avi) {
+
343  }
+
344  void chain() {
+
345  avi_->adj_ += adj_;
+
346  }
+
347  };
+
348 
+
349  class subtract_vv_vari : public op_vv_vari {
+
350  public:
+
351  subtract_vv_vari(vari* avi, vari* bvi) :
+
352  op_vv_vari(avi->val_ - bvi->val_, avi, bvi) {
+
353  }
+
354  void chain() {
+
355  avi_->adj_ += adj_;
+
356  bvi_->adj_ -= adj_;
+
357  }
+
358  };
+
359 
+
360  class subtract_vd_vari : public op_vd_vari {
+
361  public:
+
362  subtract_vd_vari(vari* avi, double b) :
+
363  op_vd_vari(avi->val_ - b, avi, b) {
+
364  }
+
365  void chain() {
+
366  avi_->adj_ += adj_;
+
367  }
+
368  };
+
369 
+
370  class subtract_dv_vari : public op_dv_vari {
+
371  public:
+
372  subtract_dv_vari(double a, vari* bvi) :
+
373  op_dv_vari(a - bvi->val_, a, bvi) {
+
374  }
+
375  void chain() {
+
376  bvi_->adj_ -= adj_;
+
377  }
+
378  };
+
379 
+
380  class multiply_vv_vari : public op_vv_vari {
+
381  public:
+
382  multiply_vv_vari(vari* avi, vari* bvi) :
+
383  op_vv_vari(avi->val_ * bvi->val_, avi, bvi) {
+
384  }
+
385  void chain() {
+
386  avi_->adj_ += bvi_->val_ * adj_;
+
387  bvi_->adj_ += avi_->val_ * adj_;
+
388  }
+
389  };
+
390 
+
391  class multiply_vd_vari : public op_vd_vari {
+
392  public:
+
393  multiply_vd_vari(vari* avi, double b) :
+
394  op_vd_vari(avi->val_ * b, avi, b) {
+
395  }
+
396  void chain() {
+
397  avi_->adj_ += adj_ * bd_;
+
398  }
+
399  };
+
400 
+
401  // (a/b)' = a' * (1 / b) - b' * (a / [b * b])
+
402  class divide_vv_vari : public op_vv_vari {
+
403  public:
+
404  divide_vv_vari(vari* avi, vari* bvi) :
+
405  op_vv_vari(avi->val_ / bvi->val_, avi, bvi) {
+
406  }
+
407  void chain() {
+
408  avi_->adj_ += adj_ / bvi_->val_;
+
409  bvi_->adj_ -= adj_ * avi_->val_ / (bvi_->val_ * bvi_->val_);
+
410  }
+
411  };
+
412 
+
413  class divide_vd_vari : public op_vd_vari {
+
414  public:
+
415  divide_vd_vari(vari* avi, double b) :
+
416  op_vd_vari(avi->val_ / b, avi, b) {
+
417  }
+
418  void chain() {
+
419  avi_->adj_ += adj_ / bd_;
+
420  }
+
421  };
+
422 
+
423  class divide_dv_vari : public op_dv_vari {
+
424  public:
+
425  divide_dv_vari(double a, vari* bvi) :
+
426  op_dv_vari(a / bvi->val_, a, bvi) {
+
427  }
+
428  void chain() {
+
429  bvi_->adj_ -= adj_ * ad_ / (bvi_->val_ * bvi_->val_);
+
430  }
+
431  };
+
432 
+
433  class exp_vari : public op_v_vari {
+
434  public:
+
435  exp_vari(vari* avi) :
+
436  op_v_vari(std::exp(avi->val_),avi) {
+
437  }
+
438  void chain() {
+
439  avi_->adj_ += adj_ * val_;
+
440  }
+
441  };
+
442 
+
443  class log_vari : public op_v_vari {
+
444  public:
+
445  log_vari(vari* avi) :
+
446  op_v_vari(std::log(avi->val_),avi) {
+
447  }
+
448  void chain() {
+
449  avi_->adj_ += adj_ / avi_->val_;
+
450  }
+
451  };
+
452 
+
453  double LOG_10 = std::log(10.0);
+
454 
+
455  class log10_vari : public op_v_vari {
+
456  public:
+
457  const double exp_val_;
+
458  log10_vari(vari* avi) :
+
459  op_v_vari(std::log10(avi->val_),avi),
+
460  exp_val_(avi->val_) {
+
461  }
+
462  void chain() {
+
463  avi_->adj_ += adj_ / (LOG_10 * exp_val_);
+
464  }
+
465  };
+
466 
+
467  class sqrt_vari : public op_v_vari {
+
468  public:
+
469  sqrt_vari(vari* avi) :
+
470  op_v_vari(std::sqrt(avi->val_),avi) {
+
471  }
+
472  void chain() {
+
473  avi_->adj_ += adj_ / (2.0 * val_);
+
474  }
+
475  };
+
476 
+
477  class pow_vv_vari : public op_vv_vari {
+
478  public:
+
479  pow_vv_vari(vari* avi, vari* bvi) :
+
480  op_vv_vari(std::pow(avi->val_,bvi->val_),avi,bvi) {
+
481  }
+
482  void chain() {
+
483  if (avi_->val_ == 0.0) return; // partials zero, avoids /0 & log(0)
+
484  avi_->adj_ += adj_ * bvi_->val_ * val_ / avi_->val_;
+
485  bvi_->adj_ += adj_ * std::log(avi_->val_) * val_;
+
486  }
+
487  };
+
488 
+
489  class pow_vd_vari : public op_vd_vari {
+
490  public:
+
491  pow_vd_vari(vari* avi, double b) :
+
492  op_vd_vari(std::pow(avi->val_,b),avi,b) {
+
493  }
+
494  void chain() {
+
495  if (avi_->val_ == 0.0) return; // partials zero, avoids /0 & log(0)
+
496  avi_->adj_ += adj_ * bd_ * val_ / avi_->val_;
+
497  }
+
498  };
+
499 
+
500  class pow_dv_vari : public op_dv_vari {
+
501  public:
+
502  pow_dv_vari(double a, vari* bvi) :
+
503  op_dv_vari(std::pow(a,bvi->val_),a,bvi) {
+
504  }
+
505  void chain() {
+
506  if (ad_ == 0.0) return; // partials zero, avoids /0 & log(0)
+
507  bvi_->adj_ += adj_ * std::log(ad_) * val_;
+
508  }
+
509  };
+
510 
+
511  class cos_vari : public op_v_vari {
+
512  public:
+
513  cos_vari(vari* avi) :
+
514  op_v_vari(std::cos(avi->val_),avi) {
+
515  }
+
516  void chain() {
+
517  avi_->adj_ -= adj_ * std::sin(avi_->val_);
+
518  }
+
519  };
+
520 
+
521  class sin_vari : public op_v_vari {
+
522  public:
+
523  sin_vari(vari* avi) :
+
524  op_v_vari(std::sin(avi->val_),avi) {
+
525  }
+
526  void chain() {
+
527  avi_->adj_ += adj_ * std::cos(avi_->val_);
+
528  }
+
529  };
+
530 
+
531  class tan_vari : public op_v_vari {
+
532  public:
+
533  tan_vari(vari* avi) :
+
534  op_v_vari(std::tan(avi->val_),avi) {
+
535  }
+
536  void chain() {
+
537  avi_->adj_ += adj_ * (1.0 + val_ * val_);
+
538  }
+
539  };
+
540 
+
541  class acos_vari : public op_v_vari {
+
542  public:
+
543  acos_vari(vari* avi) :
+
544  op_v_vari(std::acos(avi->val_),avi) {
+
545  }
+
546  void chain() {
+
547  avi_->adj_ -= adj_ / std::sqrt(1.0 - (avi_->val_ * avi_->val_));
+
548  }
+
549  };
+
550 
+
551  class asin_vari : public op_v_vari {
+
552  public:
+
553  asin_vari(vari* avi) :
+
554  op_v_vari(std::asin(avi->val_),avi) {
+
555  }
+
556  void chain() {
+
557  avi_->adj_ += adj_ / std::sqrt(1.0 - (avi_->val_ * avi_->val_));
+
558  }
+
559  };
+
560 
+
561  class atan_vari : public op_v_vari {
+
562  public:
+
563  atan_vari(vari* avi) :
+
564  op_v_vari(std::atan(avi->val_),avi) {
+
565  }
+
566  void chain() {
+
567  avi_->adj_ += adj_ / (1.0 + (avi_->val_ * avi_->val_));
+
568  }
+
569  };
+
570 
+
571  class atan2_vv_vari : public op_vv_vari {
+
572  public:
+
573  atan2_vv_vari(vari* avi, vari* bvi) :
+
574  op_vv_vari(std::atan2(avi->val_,bvi->val_),avi,bvi) {
+
575  }
+
576  void chain() {
+
577  double a_sq_plus_b_sq = (avi_->val_ * avi_->val_) + (bvi_->val_ * bvi_->val_);
+
578  avi_->adj_ += bvi_->val_ / a_sq_plus_b_sq;
+
579  bvi_->adj_ -= avi_->val_ / a_sq_plus_b_sq;
+
580  }
+
581  };
+
582 
+
583  class atan2_vd_vari : public op_vd_vari {
+
584  public:
+
585  atan2_vd_vari(vari* avi, double b) :
+
586  op_vd_vari(std::atan2(avi->val_,b),avi,b) {
+
587  }
+
588  void chain() {
+
589  double a_sq_plus_b_sq = (avi_->val_ * avi_->val_) + (bd_ * bd_);
+
590  avi_->adj_ += bd_ / a_sq_plus_b_sq;
+
591  }
+
592  };
+
593 
+
594  class atan2_dv_vari : public op_dv_vari {
+
595  public:
+
596  atan2_dv_vari(double a, vari* bvi) :
+
597  op_dv_vari(std::atan2(a,bvi->val_),a,bvi) {
+
598  }
+
599  void chain() {
+
600  double a_sq_plus_b_sq = (ad_ * ad_) + (bvi_->val_ * bvi_->val_);
+
601  bvi_->adj_ -= ad_ / a_sq_plus_b_sq;
+
602  }
+
603  };
+
604 
+
605  class cosh_vari : public op_v_vari {
+
606  public:
+
607  cosh_vari(vari* avi) :
+
608  op_v_vari(std::cosh(avi->val_),avi) {
+
609  }
+
610  void chain() {
+
611  avi_->adj_ += adj_ * std::sinh(avi_->val_);
+
612  }
+
613  };
+
614 
+
615  class sinh_vari : public op_v_vari {
+
616  public:
+
617  sinh_vari(vari* avi) :
+
618  op_v_vari(std::sinh(avi->val_),avi) {
+
619  }
+
620  void chain() {
+
621  avi_->adj_ += adj_ * std::cosh(avi_->val_);
+
622  }
+
623  };
+
624 
+
625  class tanh_vari : public op_v_vari {
+
626  public:
+
627  tanh_vari(vari* avi) :
+
628  op_v_vari(std::tanh(avi->val_),avi) {
+
629  }
+
630  void chain() {
+
631  double cosh = std::cosh(avi_->val_);
+
632  avi_->adj_ += adj_ / (cosh * cosh);
+
633  }
+
634  };
+
635 
+
636 
+
637  class floor_vari : public vari {
+
638  public:
+
639  floor_vari(vari* avi) :
+
640  vari(std::floor(avi->val_)) {
+
641  }
+
642  };
+
643 
+
644  class ceil_vari : public vari {
+
645  public:
+
646  ceil_vari(vari* avi) :
+
647  vari(std::ceil(avi->val_)) {
+
648  }
+
649  };
+
650 
+
651  class fmod_vv_vari : public op_vv_vari {
+
652  public:
+
653  fmod_vv_vari(vari* avi, vari* bvi) :
+
654  op_vv_vari(std::fmod(avi->val_,bvi->val_),avi,bvi) {
+
655  }
+
656  void chain() {
+
657  avi_->adj_ += adj_;
+
658  bvi_->adj_ -= adj_ * static_cast<int>(avi_->val_ / bvi_->val_);
+
659  }
+
660  };
+
661 
+
662  class fmod_vd_vari : public op_v_vari {
+
663  public:
+
664  fmod_vd_vari(vari* avi, double b) :
+
665  op_v_vari(std::fmod(avi->val_,b),avi) {
+
666  }
+
667  void chain() {
+
668  avi_->adj_ += adj_;
+
669  }
+
670  };
+
671 
+
672  class fmod_dv_vari : public op_dv_vari {
+
673  public:
+
674  fmod_dv_vari(double a, vari* bvi) :
+
675  op_dv_vari(std::fmod(a,bvi->val_),a,bvi) {
+
676  }
+
677  void chain() {
+
678  int d = static_cast<int>(ad_ / bvi_->val_);
+
679  bvi_->adj_ -= adj_ * d;
+
680  }
+
681  };
+
682 
+
683 
+
684 
+
685 
+
686 
+
687  }
+
688 
+
689  // ********************* vari UP, var DOWN ***********************************************************
+
690 
+
691 
+
701  class var {
+
702  public:
+
703 
+
704  typedef double Scalar;
+
705 
+ +
714 
+
720  explicit var(vari* vi) :
+
721  vi_(vi) {
+
722  }
+
723 
+
731  var() :
+
732  vi_(0) {
+
733  }
+
734 
+
741  var(bool b) :
+
742  vi_(new vari(static_cast<double>(b))) {
+
743  }
+
744 
+
751  var(char c) :
+
752  vi_(new vari(static_cast<double>(c))) {
+
753  }
+
754 
+
761  var(short n) :
+
762  vi_(new vari(static_cast<double>(n))) {
+
763  }
+
764 
+
771  var(unsigned short n) :
+
772  vi_(new vari(static_cast<double>(n))) {
+
773  }
+
774 
+
781  var(int n) :
+
782  vi_(new vari(static_cast<double>(n))) {
+
783  }
+
784 
+
791  var(unsigned int n) :
+
792  vi_(new vari(static_cast<double>(n))) {
+
793  }
+
794 
+
801  var(long int n) :
+
802  vi_(new vari(static_cast<double>(n))) {
+
803  }
+
804 
+
811  var(unsigned long int n) :
+
812  vi_(new vari(static_cast<double>(n))) {
+
813  }
+
814 
+
821  var(float x) :
+
822  vi_(new vari(static_cast<double>(x))) {
+
823  }
+
824 
+
830  var(double x) :
+
831  vi_(new vari(x)) {
+
832  }
+
833 
+
840  var(long double x) :
+
841  vi_(new vari(static_cast<double>(x))) {
+
842  }
+
843 
+
849  inline double val() const {
+
850  return vi_->val_;
+
851  }
+
852 
+
865  void grad(std::vector<var>& x,
+
866  std::vector<double>& g) {
+
867  vari::grad(vi_);
+
868  g.resize(x.size());
+
869  for (size_t i = 0U; i < x.size(); ++i)
+
870  g[i] = x[i].vi_->adj_;
+ +
872  }
+
873 
+
890  void grad() {
+
891  vari::grad(vi_);
+ +
893  }
+
894 
+
895  // COMPOUND ASSIGNMENT OPERATORS
+
896 
+
907  inline var& operator+=(const var& b) {
+
908  vi_ = new add_vv_vari(vi_,b.vi_);
+
909  return *this;
+
910  }
+
911 
+
922  inline var& operator+=(const double& b) {
+
923  vi_ = new add_vd_vari(vi_,b);
+
924  return *this;
+
925  }
+
926 
+
938  inline var& operator-=(const var& b) {
+
939  vi_ = new subtract_vv_vari(vi_,b.vi_);
+
940  return *this;
+
941  }
+
942 
+
954  inline var& operator-=(const double& b) {
+
955  vi_ = new subtract_vd_vari(vi_,b);
+
956  return *this;
+
957  }
+
958 
+
970  inline var& operator*=(const var& b) {
+
971  vi_ = new multiply_vv_vari(vi_,b.vi_);
+
972  return *this;
+
973  }
+
974 
+
986  inline var& operator*=(const double& b) {
+
987  vi_ = new multiply_vd_vari(vi_,b);
+
988  return *this;
+
989  }
+
990 
+
1001  inline var& operator/=(const var& b) {
+
1002  vi_ = new divide_vv_vari(vi_,b.vi_);
+
1003  return *this;
+
1004  }
+
1005 
+
1017  inline var& operator/=(const double& b) {
+
1018  vi_ = new divide_vd_vari(vi_,b);
+
1019  return *this;
+
1020  };
+
1021 
+
1022 
+
1023  };
+
1024 
+
1025  // COMPARISON OPERATORS
+
1026 
+
1035  inline bool operator==(const var& a, const var& b) {
+
1036  return a.val() == b.val();
+
1037  }
+
1038 
+
1048  inline bool operator==(const var& a, const double& b) {
+
1049  return a.val() == b;
+
1050  }
+
1051 
+
1060  inline bool operator==(const double& a, const var& b) {
+
1061  return a == b.val();
+
1062  }
+
1063 
+
1072  inline bool operator!=(const var& a, const var& b) {
+
1073  return a.val() != b.val();
+
1074  }
+
1075 
+
1085  inline bool operator!=(const var& a, const double& b) {
+
1086  return a.val() != b;
+
1087  }
+
1088 
+
1098  inline bool operator!=(const double& a, const var& b) {
+
1099  return a != b.val();
+
1100  }
+
1101 
+
1109  inline bool operator<(const var& a, const var& b) {
+
1110  return a.val() < b.val();
+
1111  }
+
1112 
+
1121  inline bool operator<(const var& a, const double& b) {
+
1122  return a.val() < b;
+
1123  }
+
1124 
+
1133  inline bool operator<(const double& a, const var& b) {
+
1134  return a < b.val();
+
1135  }
+
1136 
+
1144  inline bool operator>(const var& a, const var& b) {
+
1145  return a.val() > b.val();
+
1146  }
+
1147 
+
1156  inline bool operator>(const var& a, const double& b) {
+
1157  return a.val() > b;
+
1158  }
+
1159 
+
1168  inline bool operator>(const double& a, const var& b) {
+
1169  return a > b.val();
+
1170  }
+
1171 
+
1181  inline bool operator<=(const var& a, const var& b) {
+
1182  return a.val() <= b.val();
+
1183  }
+
1184 
+
1194  inline bool operator<=(const var& a, const double& b) {
+
1195  return a.val() <= b;
+
1196  }
+
1197 
+
1207  inline bool operator<=(const double& a, const var& b) {
+
1208  return a <= b.val();
+
1209  }
+
1210 
+
1220  inline bool operator>=(const var& a, const var& b) {
+
1221  return a.val() >= b.val();
+
1222  }
+
1223 
+
1233  inline bool operator>=(const var& a, const double& b) {
+
1234  return a.val() >= b;
+
1235  }
+
1236 
+
1246  inline bool operator>=(const double& a, const var& b) {
+
1247  return a >= b.val();
+
1248  }
+
1249 
+
1250  // LOGICAL OPERATORS
+
1251 
+
1265  inline bool operator!(const var& a) {
+
1266  return !a.val();
+
1267  }
+
1268 
+
1269  // ARITHMETIC OPERATORS
+
1270 
+
1286  inline var operator+(const var& a) {
+
1287  return a;
+
1288  }
+
1289 
+
1298  inline var operator-(const var& a) {
+
1299  return var(new neg_vari(a.vi_));
+
1300  }
+
1301 
+
1315  inline var operator+(const var& a, const var& b) {
+
1316  return var(new add_vv_vari(a.vi_,b.vi_));
+
1317  }
+
1318 
+
1319 
+
1331  inline var operator+(const var& a, const double& b) {
+
1332  return var(new add_vd_vari(a.vi_,b));
+
1333  }
+
1334 
+
1346  inline var operator+(const double& a, const var& b) {
+
1347  return var(new add_vd_vari(b.vi_,a)); // by symmetry
+
1348  }
+
1349 
+
1364  inline var operator-(const var& a, const var& b) {
+
1365  return var(new subtract_vv_vari(a.vi_,b.vi_));
+
1366  }
+
1367 
+
1379  inline var operator-(const var& a, const double& b) {
+
1380  return var(new subtract_vd_vari(a.vi_,b));
+
1381  }
+
1382 
+
1394  inline var operator-(const double& a, const var& b) {
+
1395  return var(new subtract_dv_vari(a,b.vi_));
+
1396  }
+
1397 
+
1411  inline var operator*(const var& a, const var& b) {
+
1412  return var(new multiply_vv_vari(a.vi_,b.vi_));
+
1413  }
+
1414 
+
1426  inline var operator*(const var& a, const double& b) {
+
1427  return var(new multiply_vd_vari(a.vi_,b));
+
1428  }
+
1429 
+
1441  inline var operator*(const double& a, const var& b) {
+
1442  return var(new multiply_vd_vari(b.vi_,a)); // by symmetry
+
1443  }
+
1444 
+
1459  inline var operator/(const var& a, const var& b) {
+
1460  return var(new divide_vv_vari(a.vi_,b.vi_));
+
1461  }
+
1462 
+
1474  inline var operator/(const var& a, const double& b) {
+
1475  return var(new divide_vd_vari(a.vi_,b));
+
1476  }
+
1477 
+
1489  inline var operator/(const double& a, const var& b) {
+
1490  return var(new divide_dv_vari(a,b.vi_));
+
1491  }
+
1492 
+
1502  inline var& operator++(var& a) {
+
1503  a.vi_ = new increment_vari(a.vi_);
+
1504  return a;
+
1505  }
+
1506 
+
1520  inline var operator++(var& a, int /*dummy*/) {
+
1521  var temp(a);
+
1522  a.vi_ = new increment_vari(a.vi_);
+
1523  return temp;
+
1524  }
+
1525 
+
1539  inline var& operator--(var& a) {
+
1540  a.vi_ = new decrement_vari(a.vi_);
+
1541  return a;
+
1542  }
+
1543 
+
1557  inline var operator--(var& a, int /*dummy*/) {
+
1558  var temp(a);
+
1559  a.vi_ = new decrement_vari(a.vi_);
+
1560  return temp;
+
1561  }
+
1562 
+
1563  // CMATH EXP AND LOG
+
1564 
+
1571  inline var exp(const var& a) {
+
1572  return var(new exp_vari(a.vi_));
+
1573  }
+
1574 
+
1585  inline var log(const var& a) {
+
1586  return var(new log_vari(a.vi_));
+
1587  }
+
1588 
+
1599  inline var log10(const var& a) {
+
1600  return var(new log10_vari(a.vi_));
+
1601  }
+
1602 
+
1603 
+
1604  // POWER FUNCTIONS
+
1605 
+
1616  inline var sqrt(const var& a) {
+
1617  return var(new sqrt_vari(a.vi_));
+
1618  }
+
1619 
+
1633  inline var pow(const var& base, const var& exponent) {
+
1634  return var(new pow_vv_vari(base.vi_,exponent.vi_));
+
1635  }
+
1636 
+
1649  inline var pow(const var& base, const double& exponent) {
+
1650  return var(new pow_vd_vari(base.vi_,exponent));
+
1651  }
+
1652 
+
1665  inline var pow(const double& base, const var& exponent) {
+
1666  return var(new pow_dv_vari(base,exponent.vi_));
+
1667  }
+
1668 
+
1669 
+
1670  // TRIG FUNCTIONS
+
1671 
+
1682  inline var cos(const var& a) {
+
1683  return var(new cos_vari(a.vi_));
+
1684  }
+
1685 
+
1696  inline var sin(const var& a) {
+
1697  return var(new sin_vari(a.vi_));
+
1698  }
+
1699 
+
1710  inline var tan(const var& a) {
+
1711  return var(new tan_vari(a.vi_));
+
1712  }
+
1713 
+
1725  inline var acos(const var& a) {
+
1726  return var(new acos_vari(a.vi_));
+
1727  }
+
1728 
+
1740  inline var asin(const var& a) {
+
1741  return var(new asin_vari(a.vi_));
+
1742  }
+
1743 
+
1755  inline var atan(const var& a) {
+
1756  return var(new atan_vari(a.vi_));
+
1757  }
+
1758 
+
1774  inline var atan2(const var& a, const var& b) {
+
1775  return var(new atan2_vv_vari(a.vi_,b.vi_));
+
1776  }
+
1777 
+
1790  inline var atan2(const var& a, const double& b) {
+
1791  return var(new atan2_vd_vari(a.vi_,b));
+
1792  }
+
1793 
+
1806  inline var atan2(const double& a, const var& b) {
+
1807  return var(new atan2_dv_vari(a,b.vi_));
+
1808  }
+
1809 
+
1810  // HYPERBOLIC FUNCTIONS
+
1811 
+
1822  inline var cosh(const var& a) {
+
1823  return var(new cosh_vari(a.vi_));
+
1824  }
+
1825 
+
1836  inline var sinh(const var& a) {
+
1837  return var(new sinh_vari(a.vi_));
+
1838  }
+
1839 
+
1850  inline var tanh(const var& a) {
+
1851  return var(new tanh_vari(a.vi_));
+
1852  }
+
1853 
+
1854 
+
1855  // ROUNDING FUNCTIONS
+
1856 
+
1873  inline var fabs(const var& a) {
+
1874  // cut-and-paste from abs()
+
1875  if (a.val() > 0.0)
+
1876  return a;
+
1877  if (a.val() < 0.0)
+
1878  return var(new neg_vari(a.vi_));
+
1879  return var(new vari(0.0));
+
1880  }
+
1881 
+
1900  inline var floor(const var& a) {
+
1901  return var(new floor_vari(a.vi_));
+
1902  }
+
1903 
+
1922  inline var ceil(const var& a) {
+
1923  return var(new ceil_vari(a.vi_));
+
1924  }
+
1925 
+
1943  inline var fmod(const var& a, const var& b) {
+
1944  return var(new fmod_vv_vari(a.vi_,b.vi_));
+
1945  }
+
1946 
+
1960  inline var fmod(const var& a, const double& b) {
+
1961  return var(new fmod_vd_vari(a.vi_,b));
+
1962  }
+
1963 
+
1977  inline var fmod(const double& a, const var& b) {
+
1978  return var(new fmod_dv_vari(a,b.vi_));
+
1979  }
+
1980 
+
1981 
+
1982  // STD LIB FUNCTIONS
+
1983 
+
1998  inline var abs(const var& a) {
+
1999  // cut-and-paste from fabs()
+
2000  if (a.val() > 0.0)
+
2001  return a;
+
2002  if (a.val() < 0.0)
+
2003  return var(new neg_vari(a.vi_));
+
2004  return var(new vari(0.0));
+
2005  }
+
2006 
+
2007  }
+
2008 
+
2009 }
+
2010 
+
2011 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/annotated.html b/doc/api/html/annotated.html new file mode 100644 index 00000000000..3fa08cd9a4a --- /dev/null +++ b/doc/api/html/annotated.html @@ -0,0 +1,496 @@ + + + + + +Stan: Class List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + +
+ +
+ All Classes Namespaces Files Functions Variables Typedefs Enumerator Friends Macros Pages
+ + +
+ +
+ +
+
+
Class List
+
+
+
Here are the classes, structs, unions and interfaces with brief descriptions:
+
[detail level 1234]
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
oNboostReimplementing boost functionality
|\NmathReimplmeneting boost functionality for stan::agrad::var and and bugs in classification of integer types
oNEigen(Expert) Numerical traits for algorithmic differentiation variables
|oNinternal(Expert) Product traits for algorithmic differentiation variables
|\CNumTraits< stan::agrad::var >Numerical traits template override for Eigen for automatic gradient variables
oNstanProbability, optimization and sampling library
|oNagradFunction gradients via reverse-mode automatic differentiation
|oNgmDirected graphical model compiler
|oNioInput/output utilities
|oNmathMatrices and templated mathematical functions
|oNmcmcMarkov chain Monte Carlo samplers
|oNmemory(Expert) Allocate, free, and manage underlying system memory
|oNmodelFor compiling models
|oNoptimization
|oNprobTemplated probability distributions
|oCis_constantMetaprogramming struct to detect whether a given type is constant in the mathematical sense (not the C++ const sense)
|oCis_constant_structMetaprogram to determine if a type has a base scalar type that can be assigned to type double
|oCis_constant_struct< std::vector< T > >
|oCis_constant_struct< Eigen::Matrix< T, R, C > >
|oCis_constant_struct< Eigen::Block< T > >
|oCis_vector
|oCis_vector< const T >
|oCis_vector< std::vector< T > >
|oCis_vector< Eigen::Matrix< T, Eigen::Dynamic, 1 > >
|oCis_vector< Eigen::Matrix< T, 1, Eigen::Dynamic > >
|oCscalar_typeMetaprogram structure to determine the base scalar type of a template argument
|oCsize_of_helper
|oCsize_of_helper< T, true >
|oCscalar_type< Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > >
|oCscalar_type< T * >
|oCis_vector_like
|oCis_vector_like< T * >
|oCis_vector_like< const T >
|oCis_vector_like< Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > >
|oCVectorViewVectorView is a template metaprogram that takes its argument and allows it to be used like a vector
|oCVectorView< const T, is_array, throw_if_accessed >VectorView that has const correctness
|oCVectorView< const double, false, false >
|oCDoubleVectorViewDoubleVectorView allocates double values to be used as intermediate values
|oCDoubleVectorView< true, false >
|oCDoubleVectorView< true, true >
|oCreturn_typeMetaprogram to calculate the base scalar return type resulting from promoting all the scalar types of the template parameters
|oCis_fvar
|oCis_fvar< stan::agrad::fvar< T > >
|oCis_var
|oCis_var< stan::agrad::var >
|oCcontains_fvarMetaprogram to calculate the base scalar return type resulting from promoting all the scalar types of the template parameters
|\Cis_var_or_arithmetic
oNstdTemplate specification of functions in std for Stan
|oCnumeric_limits< stan::agrad::fvar< T > >
|\Cnumeric_limits< stan::agrad::var >Specialization of numeric limits for var objects
oCdot_product_store_type
oCexpression_grammar
oCLDLT_factor
oCstatement_grammar
oCterm_grammar
\Cterm_grammar
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__adapt_8hpp.html b/doc/api/html/arg__adapt_8hpp.html new file mode 100644 index 00000000000..6fe891cad73 --- /dev/null +++ b/doc/api/html/arg__adapt_8hpp.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/gm/arguments/arg_adapt.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_adapt.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_adapt
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__adapt_8hpp_source.html b/doc/api/html/arg__adapt_8hpp_source.html new file mode 100644 index 00000000000..5613c7b9644 --- /dev/null +++ b/doc/api/html/arg__adapt_8hpp_source.html @@ -0,0 +1,153 @@ + + + + + +Stan: src/stan/gm/arguments/arg_adapt.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_adapt.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__ADAPT__HPP__
+
2 #define __STAN__GM__ARGUMENTS__ADAPT__HPP__
+
3 
+ +
5 
+ + + + + + + + +
14 
+
15 namespace stan {
+
16 
+
17  namespace gm {
+
18 
+ +
20 
+
21  public:
+
22 
+ +
24 
+
25  _name = "adapt";
+
26  _description = "Warmup Adaptation";
+
27 
+
28  _subarguments.push_back(new arg_adapt_engaged());
+
29  _subarguments.push_back(new arg_adapt_gamma());
+
30  _subarguments.push_back(new arg_adapt_delta());
+
31  _subarguments.push_back(new arg_adapt_kappa());
+
32  _subarguments.push_back(new arg_adapt_t0());
+
33  _subarguments.push_back(new arg_adapt_init_buffer());
+
34  _subarguments.push_back(new arg_adapt_term_buffer());
+
35  _subarguments.push_back(new arg_adapt_window());
+
36 
+
37  }
+
38 
+
39  };
+
40 
+
41  } // gm
+
42 
+
43 } // stan
+
44 
+
45 #endif
+
46 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__adapt__delta_8hpp.html b/doc/api/html/arg__adapt__delta_8hpp.html new file mode 100644 index 00000000000..35bf7e40d54 --- /dev/null +++ b/doc/api/html/arg__adapt__delta_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_adapt_delta.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_adapt_delta.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_adapt_delta
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__adapt__delta_8hpp_source.html b/doc/api/html/arg__adapt__delta_8hpp_source.html new file mode 100644 index 00000000000..67da45c5fa9 --- /dev/null +++ b/doc/api/html/arg__adapt__delta_8hpp_source.html @@ -0,0 +1,141 @@ + + + + + +Stan: src/stan/gm/arguments/arg_adapt_delta.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_adapt_delta.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__ADAPT__DELTA__HPP__
+
2 #define __STAN__GM__ARGUMENTS__ADAPT__DELTA__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+ +
11 
+
12  public:
+
13 
+ +
15  _name = "delta";
+
16  _description = "Adaptation target acceptance statistic";
+
17  _validity = "0 < delta < 1";
+
18  _default = "0.8";
+
19  _default_value = 0.8;
+
20  _constrained = true;
+
21  _good_value = 0.5;
+
22  _bad_value = -1.0;
+ +
24  };
+
25 
+
26  bool is_valid(double value) { return 0 < value && value < 1; }
+
27 
+
28  };
+
29 
+
30  } // gm
+
31 
+
32 } // stan
+
33 
+
34 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__adapt__engaged_8hpp.html b/doc/api/html/arg__adapt__engaged_8hpp.html new file mode 100644 index 00000000000..70d22555d0d --- /dev/null +++ b/doc/api/html/arg__adapt__engaged_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_adapt_engaged.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_adapt_engaged.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_adapt_engaged
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__adapt__engaged_8hpp_source.html b/doc/api/html/arg__adapt__engaged_8hpp_source.html new file mode 100644 index 00000000000..f97e968b87a --- /dev/null +++ b/doc/api/html/arg__adapt__engaged_8hpp_source.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/gm/arguments/arg_adapt_engaged.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_adapt_engaged.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__ADAPT__ENGAGED__HPP__
+
2 #define __STAN__GM__ARGUMENTS__ADAPT__ENGAGED__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+ +
11 
+
12  public:
+
13 
+ +
15  _name = "engaged";
+
16  _description = "Adaptation engaged?";
+
17  _validity = "[0, 1]";
+
18  _default = "1";
+
19  _default_value = true;
+
20  _constrained = false;
+
21  _good_value = 1;
+ +
23  };
+
24 
+
25  };
+
26 
+
27  } // gm
+
28 
+
29 } // stan
+
30 
+
31 #endif
+
32 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__adapt__gamma_8hpp.html b/doc/api/html/arg__adapt__gamma_8hpp.html new file mode 100644 index 00000000000..e2fb4df4853 --- /dev/null +++ b/doc/api/html/arg__adapt__gamma_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_adapt_gamma.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_adapt_gamma.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_adapt_gamma
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__adapt__gamma_8hpp_source.html b/doc/api/html/arg__adapt__gamma_8hpp_source.html new file mode 100644 index 00000000000..5ae4a3cd66d --- /dev/null +++ b/doc/api/html/arg__adapt__gamma_8hpp_source.html @@ -0,0 +1,142 @@ + + + + + +Stan: src/stan/gm/arguments/arg_adapt_gamma.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_adapt_gamma.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__ADAPT__GAMMA__HPP__
+
2 #define __STAN__GM__ARGUMENTS__ADAPT__GAMMA__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+ +
11 
+
12  public:
+
13 
+ +
15  _name = "gamma";
+
16  _description = "Adaptation regularization scale";
+
17  _validity = "0 < gamma";
+
18  _default = "0.05";
+
19  _default_value = 0.05;
+
20  _constrained = true;
+
21  _good_value = 2.0;
+
22  _bad_value = -1.0;
+ +
24  };
+
25 
+
26  bool is_valid(double value) { return value > 0; }
+
27 
+
28  };
+
29 
+
30  } // gm
+
31 
+
32 } // stan
+
33 
+
34 #endif
+
35 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__adapt__init__buffer_8hpp.html b/doc/api/html/arg__adapt__init__buffer_8hpp.html new file mode 100644 index 00000000000..99bb364cd83 --- /dev/null +++ b/doc/api/html/arg__adapt__init__buffer_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_adapt_init_buffer.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_adapt_init_buffer.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_adapt_init_buffer
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__adapt__init__buffer_8hpp_source.html b/doc/api/html/arg__adapt__init__buffer_8hpp_source.html new file mode 100644 index 00000000000..45f6caa5cfa --- /dev/null +++ b/doc/api/html/arg__adapt__init__buffer_8hpp_source.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/gm/arguments/arg_adapt_init_buffer.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_adapt_init_buffer.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__ADAPT__INIT__BUFFER__HPP__
+
2 #define __STAN__GM__ARGUMENTS__ADAPT__INIT__BUFFER__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+ +
11 
+
12  public:
+
13 
+ +
15  _name = "init_buffer";
+
16  _description = std::string("Width of initial fast adaptation interval");
+
17  _default = "75";
+
18  _default_value = 75;
+ +
20  };
+
21 
+
22  };
+
23 
+
24  } // gm
+
25 
+
26 } // stan
+
27 
+
28 #endif
+
29 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__adapt__kappa_8hpp.html b/doc/api/html/arg__adapt__kappa_8hpp.html new file mode 100644 index 00000000000..080bed30b29 --- /dev/null +++ b/doc/api/html/arg__adapt__kappa_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_adapt_kappa.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_adapt_kappa.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_adapt_kappa
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__adapt__kappa_8hpp_source.html b/doc/api/html/arg__adapt__kappa_8hpp_source.html new file mode 100644 index 00000000000..facfdbb4916 --- /dev/null +++ b/doc/api/html/arg__adapt__kappa_8hpp_source.html @@ -0,0 +1,142 @@ + + + + + +Stan: src/stan/gm/arguments/arg_adapt_kappa.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_adapt_kappa.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__ADAPT__KAPPA__HPP__
+
2 #define __STAN__GM__ARGUMENTS__ADAPT__KAPPA__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+ +
11 
+
12  public:
+
13 
+ +
15  _name = "kappa";
+
16  _description = "Adaptation relaxation exponent";
+
17  _validity = "0 < kappa";
+
18  _default = "0.75";
+
19  _default_value = 0.75;
+
20  _constrained = true;
+
21  _good_value = 2.0;
+
22  _bad_value = -1.0;
+ +
24  };
+
25 
+
26  bool is_valid(double value) { return value > 0; }
+
27 
+
28  };
+
29 
+
30  } // gm
+
31 
+
32 } // stan
+
33 
+
34 #endif
+
35 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__adapt__t0_8hpp.html b/doc/api/html/arg__adapt__t0_8hpp.html new file mode 100644 index 00000000000..ab293ab77bc --- /dev/null +++ b/doc/api/html/arg__adapt__t0_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_adapt_t0.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_adapt_t0.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_adapt_t0
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__adapt__t0_8hpp_source.html b/doc/api/html/arg__adapt__t0_8hpp_source.html new file mode 100644 index 00000000000..4d3fcec78f9 --- /dev/null +++ b/doc/api/html/arg__adapt__t0_8hpp_source.html @@ -0,0 +1,142 @@ + + + + + +Stan: src/stan/gm/arguments/arg_adapt_t0.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_adapt_t0.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__ADAPT__T0__HPP__
+
2 #define __STAN__GM__ARGUMENTS__ADAPT__T0__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+
10  class arg_adapt_t0: public real_argument {
+
11 
+
12  public:
+
13 
+ +
15  _name = "t0";
+
16  _description = "Adaptation iteration offset";
+
17  _validity = "0 < t0";
+
18  _default = "10";
+
19  _default_value = 10;
+
20  _constrained = true;
+
21  _good_value = 2.0;
+
22  _bad_value = -1.0;
+ +
24  };
+
25 
+
26  bool is_valid(double value) { return value > 0; }
+
27 
+
28  };
+
29 
+
30  } // gm
+
31 
+
32 } // stan
+
33 
+
34 #endif
+
35 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__adapt__term__buffer_8hpp.html b/doc/api/html/arg__adapt__term__buffer_8hpp.html new file mode 100644 index 00000000000..574736fae27 --- /dev/null +++ b/doc/api/html/arg__adapt__term__buffer_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_adapt_term_buffer.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_adapt_term_buffer.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_adapt_term_buffer
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__adapt__term__buffer_8hpp_source.html b/doc/api/html/arg__adapt__term__buffer_8hpp_source.html new file mode 100644 index 00000000000..503b1c21afd --- /dev/null +++ b/doc/api/html/arg__adapt__term__buffer_8hpp_source.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/gm/arguments/arg_adapt_term_buffer.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_adapt_term_buffer.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__ADAPT__TERM__BUFFER__HPP__
+
2 #define __STAN__GM__ARGUMENTS__ADAPT__TERM__BUFFER__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+ +
11 
+
12  public:
+
13 
+ +
15  _name = "term_buffer";
+
16  _description = std::string("Width of final fast adaptation interval");
+
17  _default = "50";
+
18  _default_value = 50;
+ +
20  };
+
21 
+
22  };
+
23 
+
24  } // gm
+
25 
+
26 } // stan
+
27 
+
28 #endif
+
29 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__adapt__window_8hpp.html b/doc/api/html/arg__adapt__window_8hpp.html new file mode 100644 index 00000000000..2b024f41638 --- /dev/null +++ b/doc/api/html/arg__adapt__window_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_adapt_window.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_adapt_window.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_adapt_window
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__adapt__window_8hpp_source.html b/doc/api/html/arg__adapt__window_8hpp_source.html new file mode 100644 index 00000000000..066c38d3307 --- /dev/null +++ b/doc/api/html/arg__adapt__window_8hpp_source.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/gm/arguments/arg_adapt_window.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_adapt_window.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__ADAPT__WINDOW__HPP__
+
2 #define __STAN__GM__ARGUMENTS__ADAPT__WINDOW__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+ +
11 
+
12  public:
+
13 
+ +
15  _name = "window";
+
16  _description = "Initial width of slow adaptation interval";
+
17  _default = "25";
+
18  _default_value = 25;
+ +
20  };
+
21 
+
22  };
+
23 
+
24  } // gm
+
25 
+
26 } // stan
+
27 
+
28 #endif
+
29 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__bfgs_8hpp.html b/doc/api/html/arg__bfgs_8hpp.html new file mode 100644 index 00000000000..90d7899d721 --- /dev/null +++ b/doc/api/html/arg__bfgs_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/gm/arguments/arg_bfgs.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_bfgs.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_bfgs
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__bfgs_8hpp_source.html b/doc/api/html/arg__bfgs_8hpp_source.html new file mode 100644 index 00000000000..af4bd6cba41 --- /dev/null +++ b/doc/api/html/arg__bfgs_8hpp_source.html @@ -0,0 +1,145 @@ + + + + + +Stan: src/stan/gm/arguments/arg_bfgs.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_bfgs.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__BFGS__HPP__
+
2 #define __STAN__GM__ARGUMENTS__BFGS__HPP__
+
3 
+ +
5 
+ + +
8 
+
9 namespace stan {
+
10 
+
11  namespace gm {
+
12 
+ +
14 
+
15  public:
+
16 
+ +
18 
+
19  _name = "bfgs";
+
20  _description = "BFGS with linesearch";
+
21 
+
22  _subarguments.push_back(new arg_init_alpha());
+
23  _subarguments.push_back(new arg_tolerance("tol_obj","Convergence tolerance on changes in objective function value","1e-8",1e-8));
+
24  _subarguments.push_back(new arg_tolerance("tol_grad","Convergence tolerance on the norm of the gradient","1e-8",1e-8));
+
25  _subarguments.push_back(new arg_tolerance("tol_param","Convergence tolerance on changes in parameter value","1e-8",1e-8));
+
26 
+
27 
+
28 
+
29  }
+
30 
+
31  };
+
32 
+
33  } // gm
+
34 
+
35 } // stan
+
36 
+
37 #endif
+
38 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__data_8hpp.html b/doc/api/html/arg__data_8hpp.html new file mode 100644 index 00000000000..10c593428d0 --- /dev/null +++ b/doc/api/html/arg__data_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/gm/arguments/arg_data.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_data.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_data
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__data_8hpp_source.html b/doc/api/html/arg__data_8hpp_source.html new file mode 100644 index 00000000000..4f9d2fdc48f --- /dev/null +++ b/doc/api/html/arg__data_8hpp_source.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/gm/arguments/arg_data.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_data.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__DATA__HPP__
+
2 #define __STAN__GM__ARGUMENTS__DATA__HPP__
+
3 
+ +
5 
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace gm {
+
11 
+ +
13 
+
14  public:
+
15 
+ +
17 
+
18  _name = "data";
+
19  _description = "Input data options";
+
20 
+
21  _subarguments.push_back(new arg_data_file());
+
22 
+
23  };
+
24 
+
25  };
+
26 
+
27  } // gm
+
28 
+
29 } // stan
+
30 
+
31 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__data__file_8hpp.html b/doc/api/html/arg__data__file_8hpp.html new file mode 100644 index 00000000000..f2c3938fc1e --- /dev/null +++ b/doc/api/html/arg__data__file_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_data_file.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_data_file.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_data_file
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__data__file_8hpp_source.html b/doc/api/html/arg__data__file_8hpp_source.html new file mode 100644 index 00000000000..951d5ebf928 --- /dev/null +++ b/doc/api/html/arg__data__file_8hpp_source.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/gm/arguments/arg_data_file.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_data_file.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__DATA__FILE__HPP__
+
2 #define __STAN__GM__ARGUMENTS__DATA__FILE__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+ +
11 
+
12  public:
+
13 
+ +
15  _name = "file";
+
16  _description = "Input data file";
+
17  _validity = "Path to existing file";
+
18  _default = "\"\"";
+
19  _default_value = "";
+
20  _constrained = false;
+
21  _good_value = "good";
+ +
23  };
+
24 
+
25  };
+
26 
+
27  } // gm
+
28 
+
29 } // stan
+
30 
+
31 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__dense__e_8hpp.html b/doc/api/html/arg__dense__e_8hpp.html new file mode 100644 index 00000000000..f6732ef745e --- /dev/null +++ b/doc/api/html/arg__dense__e_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_dense_e.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_dense_e.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_dense_e
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__dense__e_8hpp_source.html b/doc/api/html/arg__dense__e_8hpp_source.html new file mode 100644 index 00000000000..d77ff8585a5 --- /dev/null +++ b/doc/api/html/arg__dense__e_8hpp_source.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/gm/arguments/arg_dense_e.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_dense_e.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__DENSE_E__HPP__
+
2 #define __STAN__GM__ARGUMENTS__DENSE_E__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+ +
11 
+
12  public:
+
13 
+ +
15 
+
16  _name = "dense_e";
+
17  _description = "Euclidean manifold with dense metric";
+
18 
+
19  }
+
20 
+
21  };
+
22 
+
23  } // gm
+
24 
+
25 } // stan
+
26 
+
27 #endif
+
28 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__diag__e_8hpp.html b/doc/api/html/arg__diag__e_8hpp.html new file mode 100644 index 00000000000..7707226a686 --- /dev/null +++ b/doc/api/html/arg__diag__e_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_diag_e.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_diag_e.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_diag_e
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__diag__e_8hpp_source.html b/doc/api/html/arg__diag__e_8hpp_source.html new file mode 100644 index 00000000000..15bde757c0b --- /dev/null +++ b/doc/api/html/arg__diag__e_8hpp_source.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/gm/arguments/arg_diag_e.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_diag_e.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__DIAG_E__HPP__
+
2 #define __STAN__GM__ARGUMENTS__DIAG_E__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+
10  class arg_diag_e: public unvalued_argument {
+
11 
+
12  public:
+
13 
+ +
15 
+
16  _name = "diag_e";
+
17  _description = "Euclidean manifold with diag metric";
+
18 
+
19  }
+
20 
+
21  };
+
22 
+
23  } // gm
+
24 
+
25 } // stan
+
26 
+
27 #endif
+
28 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__diagnose_8hpp.html b/doc/api/html/arg__diagnose_8hpp.html new file mode 100644 index 00000000000..95a136f9760 --- /dev/null +++ b/doc/api/html/arg__diagnose_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/gm/arguments/arg_diagnose.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_diagnose.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_diagnose
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__diagnose_8hpp_source.html b/doc/api/html/arg__diagnose_8hpp_source.html new file mode 100644 index 00000000000..5193701a714 --- /dev/null +++ b/doc/api/html/arg__diagnose_8hpp_source.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/gm/arguments/arg_diagnose.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_diagnose.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__DIAGNOSE__HPP__
+
2 #define __STAN__GM__ARGUMENTS__DIAGNOSE__HPP__
+
3 
+ +
5 
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace gm {
+
11 
+ +
13 
+
14  public:
+
15 
+ +
17 
+
18  _name = "diagnose";
+
19  _description = "Model diagnostics";
+
20 
+
21  _subarguments.push_back(new arg_test());
+
22 
+
23  }
+
24 
+
25  };
+
26 
+
27  } // gm
+
28 
+
29 } // stan
+
30 
+
31 #endif
+
32 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__diagnostic__file_8hpp.html b/doc/api/html/arg__diagnostic__file_8hpp.html new file mode 100644 index 00000000000..5640083ae68 --- /dev/null +++ b/doc/api/html/arg__diagnostic__file_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_diagnostic_file.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_diagnostic_file.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_diagnostic_file
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__diagnostic__file_8hpp_source.html b/doc/api/html/arg__diagnostic__file_8hpp_source.html new file mode 100644 index 00000000000..0c2e5daf88b --- /dev/null +++ b/doc/api/html/arg__diagnostic__file_8hpp_source.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/gm/arguments/arg_diagnostic_file.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_diagnostic_file.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__DIAGNOSTIC__FILE__HPP__
+
2 #define __STAN__GM__ARGUMENTS__DIAGNOSTIC__FILE__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+ +
11 
+
12  public:
+
13 
+ +
15  _name = "diagnostic_file";
+
16  _description = "Auxiliary output file for diagnostic information";
+
17  _validity = "Path to existing file";
+
18  _default = "\"\"";
+
19  _default_value = "";
+
20  _constrained = false;
+
21  _good_value = "good";
+ +
23  };
+
24 
+
25  };
+
26 
+
27  } // gm
+
28 
+
29 } // stan
+
30 
+
31 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__engine_8hpp.html b/doc/api/html/arg__engine_8hpp.html new file mode 100644 index 00000000000..baa1ab3fc4b --- /dev/null +++ b/doc/api/html/arg__engine_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/gm/arguments/arg_engine.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_engine.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_engine
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__engine_8hpp_source.html b/doc/api/html/arg__engine_8hpp_source.html new file mode 100644 index 00000000000..36c92654db3 --- /dev/null +++ b/doc/api/html/arg__engine_8hpp_source.html @@ -0,0 +1,144 @@ + + + + + +Stan: src/stan/gm/arguments/arg_engine.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_engine.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__ENGINE__HPP__
+
2 #define __STAN__GM__ARGUMENTS__ENGINE__HPP__
+
3 
+ +
5 
+ + +
8 
+
9 namespace stan {
+
10 
+
11  namespace gm {
+
12 
+
13  class arg_engine: public list_argument {
+
14 
+
15  public:
+
16 
+ +
18 
+
19  _name = "engine";
+
20  _description = "Engine for Hamiltonian Monte Carlo";
+
21 
+
22  _values.push_back(new arg_static());
+
23  _values.push_back(new arg_nuts());
+
24 
+
25  _default_cursor = 1;
+ +
27 
+
28  }
+
29 
+
30  };
+
31 
+
32  } // gm
+
33 
+
34 } // stan
+
35 
+
36 #endif
+
37 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__fail_8hpp.html b/doc/api/html/arg__fail_8hpp.html new file mode 100644 index 00000000000..819481335e7 --- /dev/null +++ b/doc/api/html/arg__fail_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_fail.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_fail.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_fail
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__fail_8hpp_source.html b/doc/api/html/arg__fail_8hpp_source.html new file mode 100644 index 00000000000..92840a51596 --- /dev/null +++ b/doc/api/html/arg__fail_8hpp_source.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/gm/arguments/arg_fail.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_fail.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__FAIL__HPP__
+
2 #define __STAN__GM__ARGUMENTS__FAIL__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+
10  class arg_fail: public unvalued_argument {
+
11 
+
12  public:
+
13 
+ +
15 
+
16  _name = "fail";
+
17  _description = "Dummy argument to induce failures for testing";
+
18 
+
19  }
+
20 
+
21  };
+
22 
+
23  } // gm
+
24 
+
25 } // stan
+
26 
+
27 #endif
+
28 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__hmc_8hpp.html b/doc/api/html/arg__hmc_8hpp.html new file mode 100644 index 00000000000..69a6abf25e6 --- /dev/null +++ b/doc/api/html/arg__hmc_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/gm/arguments/arg_hmc.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_hmc.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_hmc
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__hmc_8hpp_source.html b/doc/api/html/arg__hmc_8hpp_source.html new file mode 100644 index 00000000000..c290332b3cc --- /dev/null +++ b/doc/api/html/arg__hmc_8hpp_source.html @@ -0,0 +1,145 @@ + + + + + +Stan: src/stan/gm/arguments/arg_hmc.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_hmc.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__HMC__HPP__
+
2 #define __STAN__GM__ARGUMENTS__HMC__HPP__
+
3 
+ +
5 
+ + + + +
10 
+
11 namespace stan {
+
12 
+
13  namespace gm {
+
14 
+
15  class arg_hmc: public categorical_argument {
+
16 
+
17  public:
+
18 
+
19  arg_hmc() {
+
20 
+
21  _name = "hmc";
+
22  _description = "Hamiltonian Monte Carlo";
+
23 
+
24  _subarguments.push_back(new arg_engine());
+
25  _subarguments.push_back(new arg_metric());
+
26  _subarguments.push_back(new arg_stepsize());
+
27  _subarguments.push_back(new arg_stepsize_jitter());
+
28 
+
29  }
+
30 
+
31  };
+
32 
+
33  } // gm
+
34 
+
35 } // stan
+
36 
+
37 #endif
+
38 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__id_8hpp.html b/doc/api/html/arg__id_8hpp.html new file mode 100644 index 00000000000..9bb935e4fca --- /dev/null +++ b/doc/api/html/arg__id_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_id.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_id.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_id
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__id_8hpp_source.html b/doc/api/html/arg__id_8hpp_source.html new file mode 100644 index 00000000000..9dc245c5e24 --- /dev/null +++ b/doc/api/html/arg__id_8hpp_source.html @@ -0,0 +1,142 @@ + + + + + +Stan: src/stan/gm/arguments/arg_id.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_id.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__ID__HPP__
+
2 #define __STAN__GM__ARGUMENTS__ID__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+
10  class arg_id: public int_argument {
+
11 
+
12  public:
+
13 
+ +
15  _name = "id";
+
16  _description = "Unique process identifier";
+
17  _validity = "id > 0";
+
18  _default = "0";
+
19  _default_value = 0;
+
20  _constrained = true;
+
21  _good_value = 2.0;
+
22  _bad_value = -1.0;
+ +
24  };
+
25 
+
26  bool is_valid(int value) { return value > 0; }
+
27 
+
28  };
+
29 
+
30  } // gm
+
31 
+
32 } // stan
+
33 
+
34 #endif
+
35 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__init_8hpp.html b/doc/api/html/arg__init_8hpp.html new file mode 100644 index 00000000000..c99da73f82a --- /dev/null +++ b/doc/api/html/arg__init_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_init.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_init.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_init
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__init_8hpp_source.html b/doc/api/html/arg__init_8hpp_source.html new file mode 100644 index 00000000000..5e6b5a81dd5 --- /dev/null +++ b/doc/api/html/arg__init_8hpp_source.html @@ -0,0 +1,140 @@ + + + + + +Stan: src/stan/gm/arguments/arg_init.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_init.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__INIT__HPP__
+
2 #define __STAN__GM__ARGUMENTS__INIT__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+
10  class arg_init: public string_argument {
+
11 
+
12  public:
+
13 
+ +
15  _name = "init";
+
16  _description = std::string("Initialization method: ")
+
17  + std::string("\"x\" initializes randomly bewteen [-x, x], ")
+
18  + std::string("\"0\" initializes to 0, ")
+
19  + std::string("anything else identifies a file of values");
+
20  _default = "\"2\"";
+
21  _default_value = "2";
+
22  _constrained = false;
+
23  _good_value = "../src/test/gm/arguments/test_model.init.R";
+ +
25  };
+
26 
+
27  };
+
28 
+
29  } // gm
+
30 
+
31 } // stan
+
32 
+
33 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__init__alpha_8hpp.html b/doc/api/html/arg__init__alpha_8hpp.html new file mode 100644 index 00000000000..b92d6947640 --- /dev/null +++ b/doc/api/html/arg__init__alpha_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_init_alpha.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_init_alpha.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_init_alpha
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__init__alpha_8hpp_source.html b/doc/api/html/arg__init__alpha_8hpp_source.html new file mode 100644 index 00000000000..c468455fb48 --- /dev/null +++ b/doc/api/html/arg__init__alpha_8hpp_source.html @@ -0,0 +1,141 @@ + + + + + +Stan: src/stan/gm/arguments/arg_init_alpha.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_init_alpha.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__INIT_ALPHA__HPP__
+
2 #define __STAN__GM__ARGUMENTS__INIT_ALPHA__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+
10  class arg_init_alpha: public real_argument {
+
11 
+
12  public:
+
13 
+ +
15  _name = "init_alpha";
+
16  _description = "Line search step size for first iteration";
+
17  _validity = "0 < init_alpha";
+
18  _default = "0.001";
+
19  _default_value = 0.001;
+
20  _constrained = true;
+
21  _good_value = 1.0;
+
22  _bad_value = -1.0;
+ +
24  };
+
25 
+
26  bool is_valid(double value) { return value > 0; }
+
27 
+
28  };
+
29 
+
30  } // gm
+
31 
+
32 } // stan
+
33 
+
34 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__int__time_8hpp.html b/doc/api/html/arg__int__time_8hpp.html new file mode 100644 index 00000000000..5b87428ed20 --- /dev/null +++ b/doc/api/html/arg__int__time_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_int_time.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_int_time.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_int_time
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__int__time_8hpp_source.html b/doc/api/html/arg__int__time_8hpp_source.html new file mode 100644 index 00000000000..93bce215b46 --- /dev/null +++ b/doc/api/html/arg__int__time_8hpp_source.html @@ -0,0 +1,142 @@ + + + + + +Stan: src/stan/gm/arguments/arg_int_time.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_int_time.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__INT__TIME__HPP__
+
2 #define __STAN__GM__ARGUMENTS__INT__TIME__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+
10  class arg_int_time: public real_argument {
+
11 
+
12  public:
+
13 
+ +
15  _name = "int_time";
+
16  _description = "Total integration time for Hamiltonian evolution";
+
17  _validity = "0 < int_time";
+
18  _default = "2 * pi";
+
19  _default_value = 6.28318530717959;
+
20  _constrained = true;
+
21  _good_value = 2.0;
+
22  _bad_value = -1.0;
+ +
24  };
+
25 
+
26  bool is_valid(double value) { return value > 0; }
+
27 
+
28  };
+
29 
+
30  } // gm
+
31 
+
32 } // stan
+
33 
+
34 #endif
+
35 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__iter_8hpp.html b/doc/api/html/arg__iter_8hpp.html new file mode 100644 index 00000000000..71e96af7b3a --- /dev/null +++ b/doc/api/html/arg__iter_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_iter.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_iter.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_iter
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__iter_8hpp_source.html b/doc/api/html/arg__iter_8hpp_source.html new file mode 100644 index 00000000000..a8ffb0dcc2c --- /dev/null +++ b/doc/api/html/arg__iter_8hpp_source.html @@ -0,0 +1,142 @@ + + + + + +Stan: src/stan/gm/arguments/arg_iter.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_iter.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__ITER__HPP__
+
2 #define __STAN__GM__ARGUMENTS__ITER__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+
10  class arg_iter: public int_argument {
+
11 
+
12  public:
+
13 
+ +
15  _name = "iter";
+
16  _description = "Total number of iterations";
+
17  _validity = "0 < iter";
+
18  _default = "2000";
+
19  _default_value = 2000;
+
20  _constrained = true;
+
21  _good_value = 2.0;
+
22  _bad_value = -1.0;
+ +
24  };
+
25 
+
26  bool is_valid(int value) { return value > 0; }
+
27 
+
28  };
+
29 
+
30  } // gm
+
31 
+
32 } // stan
+
33 
+
34 #endif
+
35 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__max__depth_8hpp.html b/doc/api/html/arg__max__depth_8hpp.html new file mode 100644 index 00000000000..33309403071 --- /dev/null +++ b/doc/api/html/arg__max__depth_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_max_depth.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_max_depth.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_max_depth
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__max__depth_8hpp_source.html b/doc/api/html/arg__max__depth_8hpp_source.html new file mode 100644 index 00000000000..63a59fdc199 --- /dev/null +++ b/doc/api/html/arg__max__depth_8hpp_source.html @@ -0,0 +1,142 @@ + + + + + +Stan: src/stan/gm/arguments/arg_max_depth.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_max_depth.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__MAX_DEPTH__HPP__
+
2 #define __STAN__GM__ARGUMENTS__MAX_DEPTH__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+
10  class arg_max_depth: public int_argument {
+
11 
+
12  public:
+
13 
+ +
15  _name = "max_depth";
+
16  _description = "Maximum tree depth";
+
17  _validity = "0 < max_depth";
+
18  _default = "10";
+
19  _default_value = 10;
+
20  _constrained = true;
+
21  _good_value = 2.0;
+
22  _bad_value = -1.0;
+ +
24  };
+
25 
+
26  bool is_valid(int value) { return value > 0; }
+
27 
+
28  };
+
29 
+
30  } // gm
+
31 
+
32 } // stan
+
33 
+
34 #endif
+
35 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__method_8hpp.html b/doc/api/html/arg__method_8hpp.html new file mode 100644 index 00000000000..2f9bb4b2690 --- /dev/null +++ b/doc/api/html/arg__method_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/gm/arguments/arg_method.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_method.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_method
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__method_8hpp_source.html b/doc/api/html/arg__method_8hpp_source.html new file mode 100644 index 00000000000..1aca92800c3 --- /dev/null +++ b/doc/api/html/arg__method_8hpp_source.html @@ -0,0 +1,146 @@ + + + + + +Stan: src/stan/gm/arguments/arg_method.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_method.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__METHOD__HPP__
+
2 #define __STAN__GM__ARGUMENTS__METHOD__HPP__
+
3 
+ +
5 
+ + + +
9 
+
10 namespace stan {
+
11 
+
12  namespace gm {
+
13 
+
14  class arg_method: public list_argument {
+
15 
+
16  public:
+
17 
+ +
19 
+
20  _name = "method";
+
21  _description = "Analysis method (Note that method= is optional)";
+
22 
+
23  _values.push_back(new arg_sample());
+
24  _values.push_back(new arg_optimize());
+
25  _values.push_back(new arg_diagnose());
+
26 
+
27  _default_cursor = 0;
+ +
29 
+
30  }
+
31 
+
32  };
+
33 
+
34  } // gm
+
35 
+
36 } // stan
+
37 
+
38 #endif
+
39 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__metric_8hpp.html b/doc/api/html/arg__metric_8hpp.html new file mode 100644 index 00000000000..5a41f83b0de --- /dev/null +++ b/doc/api/html/arg__metric_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/gm/arguments/arg_metric.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_metric.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_metric
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__metric_8hpp_source.html b/doc/api/html/arg__metric_8hpp_source.html new file mode 100644 index 00000000000..b7362316b73 --- /dev/null +++ b/doc/api/html/arg__metric_8hpp_source.html @@ -0,0 +1,146 @@ + + + + + +Stan: src/stan/gm/arguments/arg_metric.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_metric.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__METRIC__HPP__
+
2 #define __STAN__GM__ARGUMENTS__METRIC__HPP__
+
3 
+ +
5 
+ + + +
9 
+
10 namespace stan {
+
11 
+
12  namespace gm {
+
13 
+
14  class arg_metric: public list_argument {
+
15 
+
16  public:
+
17 
+ +
19 
+
20  _name = "metric";
+
21  _description = "Geometry of base manifold";
+
22 
+
23  _values.push_back(new arg_unit_e());
+
24  _values.push_back(new arg_diag_e());
+
25  _values.push_back(new arg_dense_e());
+
26 
+
27  _default_cursor = 1;
+ +
29 
+
30  }
+
31 
+
32  };
+
33 
+
34  } // gm
+
35 
+
36 } // stan
+
37 
+
38 #endif
+
39 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__nesterov_8hpp.html b/doc/api/html/arg__nesterov_8hpp.html new file mode 100644 index 00000000000..4d03aa3dce2 --- /dev/null +++ b/doc/api/html/arg__nesterov_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/gm/arguments/arg_nesterov.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_nesterov.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_nesterov
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__nesterov_8hpp_source.html b/doc/api/html/arg__nesterov_8hpp_source.html new file mode 100644 index 00000000000..788d9cbd1d6 --- /dev/null +++ b/doc/api/html/arg__nesterov_8hpp_source.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/gm/arguments/arg_nesterov.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_nesterov.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__NESTEROV__HPP__
+
2 #define __STAN__GM__ARGUMENTS__NESTEROV__HPP__
+
3 
+ +
5 
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace gm {
+
11 
+ +
13 
+
14  public:
+
15 
+ +
17 
+
18  _name = "nesterov";
+
19  _description = "Nesterov's accelerated gradient method";
+
20 
+
21  _subarguments.push_back(new arg_stepsize());
+
22 
+
23  }
+
24 
+
25  };
+
26 
+
27  } // gm
+
28 
+
29 } // stan
+
30 
+
31 #endif
+
32 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__newton_8hpp.html b/doc/api/html/arg__newton_8hpp.html new file mode 100644 index 00000000000..7cf9cba85f1 --- /dev/null +++ b/doc/api/html/arg__newton_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_newton.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_newton.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_newton
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__newton_8hpp_source.html b/doc/api/html/arg__newton_8hpp_source.html new file mode 100644 index 00000000000..9887f606487 --- /dev/null +++ b/doc/api/html/arg__newton_8hpp_source.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/gm/arguments/arg_newton.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_newton.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__NEWTON__HPP__
+
2 #define __STAN__GM__ARGUMENTS__NEWTON__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+ +
11 
+
12  public:
+
13 
+ +
15 
+
16  _name = "newton";
+
17  _description = "Newton's method";
+
18 
+
19  }
+
20 
+
21  };
+
22 
+
23  } // gm
+
24 
+
25 } // stan
+
26 
+
27 #endif
+
28 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__num__samples_8hpp.html b/doc/api/html/arg__num__samples_8hpp.html new file mode 100644 index 00000000000..bf1ed107d47 --- /dev/null +++ b/doc/api/html/arg__num__samples_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_num_samples.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_num_samples.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_num_samples
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__num__samples_8hpp_source.html b/doc/api/html/arg__num__samples_8hpp_source.html new file mode 100644 index 00000000000..1d728801b51 --- /dev/null +++ b/doc/api/html/arg__num__samples_8hpp_source.html @@ -0,0 +1,142 @@ + + + + + +Stan: src/stan/gm/arguments/arg_num_samples.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_num_samples.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__NUM__SAMPLES__HPP__
+
2 #define __STAN__GM__ARGUMENTS__NUM__SAMPLES__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+
10  class arg_num_samples: public int_argument {
+
11 
+
12  public:
+
13 
+ +
15  _name = "num_samples";
+
16  _description = "Number of sampling iterations";
+
17  _validity = "0 <= num_samples";
+
18  _default = "1000";
+
19  _default_value = 1000;
+
20  _constrained = true;
+
21  _good_value = 2.0;
+
22  _bad_value = -1.0;
+ +
24  };
+
25 
+
26  bool is_valid(int value) { return value >= 0; }
+
27 
+
28  };
+
29 
+
30  } // gm
+
31 
+
32 } // stan
+
33 
+
34 #endif
+
35 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__num__warmup_8hpp.html b/doc/api/html/arg__num__warmup_8hpp.html new file mode 100644 index 00000000000..6fb0e826054 --- /dev/null +++ b/doc/api/html/arg__num__warmup_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_num_warmup.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_num_warmup.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_num_warmup
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__num__warmup_8hpp_source.html b/doc/api/html/arg__num__warmup_8hpp_source.html new file mode 100644 index 00000000000..169886b5681 --- /dev/null +++ b/doc/api/html/arg__num__warmup_8hpp_source.html @@ -0,0 +1,142 @@ + + + + + +Stan: src/stan/gm/arguments/arg_num_warmup.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_num_warmup.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__NUM__WARMUP__HPP__
+
2 #define __STAN__GM__ARGUMENTS__NUM__WARMUP__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+
10  class arg_num_warmup: public int_argument {
+
11 
+
12  public:
+
13 
+ +
15  _name = "num_warmup";
+
16  _description = "Number of warmup iterations";
+
17  _validity = "0 <= warmup";
+
18  _default = "1000";
+
19  _default_value = 1000;
+
20  _constrained = true;
+
21  _good_value = 2.0;
+
22  _bad_value = -1.0;
+ +
24  };
+
25 
+
26  bool is_valid(int value) { return value >= 0; }
+
27 
+
28  };
+
29 
+
30  } // gm
+
31 
+
32 } // stan
+
33 
+
34 #endif
+
35 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__nuts_8hpp.html b/doc/api/html/arg__nuts_8hpp.html new file mode 100644 index 00000000000..45ebb64ad83 --- /dev/null +++ b/doc/api/html/arg__nuts_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/gm/arguments/arg_nuts.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_nuts.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_nuts
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__nuts_8hpp_source.html b/doc/api/html/arg__nuts_8hpp_source.html new file mode 100644 index 00000000000..576a618c7d1 --- /dev/null +++ b/doc/api/html/arg__nuts_8hpp_source.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/gm/arguments/arg_nuts.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_nuts.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__NUTS__HMC__HPP__
+
2 #define __STAN__GM__ARGUMENTS__NUTS__HMC__HPP__
+
3 
+ +
5 
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace gm {
+
11 
+ +
13 
+
14  public:
+
15 
+ +
17 
+
18  _name = "nuts";
+
19  _description = "The No-U-Turn Sampler";
+
20 
+
21  _subarguments.push_back(new arg_max_depth());
+
22 
+
23  }
+
24 
+
25  };
+
26 
+
27  } // gm
+
28 
+
29 } // stan
+
30 
+
31 #endif
+
32 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__optimize_8hpp.html b/doc/api/html/arg__optimize_8hpp.html new file mode 100644 index 00000000000..403381b682b --- /dev/null +++ b/doc/api/html/arg__optimize_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/gm/arguments/arg_optimize.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_optimize.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_optimize
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__optimize_8hpp_source.html b/doc/api/html/arg__optimize_8hpp_source.html new file mode 100644 index 00000000000..26fc3307433 --- /dev/null +++ b/doc/api/html/arg__optimize_8hpp_source.html @@ -0,0 +1,143 @@ + + + + + +Stan: src/stan/gm/arguments/arg_optimize.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_optimize.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__OPTIMIZE__HPP__
+
2 #define __STAN__GM__ARGUMENTS__OPTIMIZE__HPP__
+
3 
+ +
5 
+ + + +
9 
+
10 namespace stan {
+
11 
+
12  namespace gm {
+
13 
+ +
15 
+
16  public:
+
17 
+ +
19 
+
20  _name = "optimize";
+
21  _description = "Point estimation";
+
22 
+
23  _subarguments.push_back(new arg_optimize_algo());
+
24  _subarguments.push_back(new arg_iter());
+
25  _subarguments.push_back(new arg_save_iterations());
+
26 
+
27  }
+
28 
+
29  };
+
30 
+
31  } // gm
+
32 
+
33 } // stan
+
34 
+
35 #endif
+
36 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__optimize__algo_8hpp.html b/doc/api/html/arg__optimize__algo_8hpp.html new file mode 100644 index 00000000000..e640bb51684 --- /dev/null +++ b/doc/api/html/arg__optimize__algo_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/gm/arguments/arg_optimize_algo.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_optimize_algo.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_optimize_algo
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__optimize__algo_8hpp_source.html b/doc/api/html/arg__optimize__algo_8hpp_source.html new file mode 100644 index 00000000000..f255db9cdee --- /dev/null +++ b/doc/api/html/arg__optimize__algo_8hpp_source.html @@ -0,0 +1,146 @@ + + + + + +Stan: src/stan/gm/arguments/arg_optimize_algo.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_optimize_algo.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__OPTIMIZE__ALGO__HPP__
+
2 #define __STAN__GM__ARGUMENTS__OPTIMIZE__ALGO__HPP__
+
3 
+ +
5 
+ + + +
9 
+
10 namespace stan {
+
11 
+
12  namespace gm {
+
13 
+ +
15 
+
16  public:
+
17 
+ +
19 
+
20  _name = "algorithm";
+
21  _description = "Optimization algorithm";
+
22 
+
23  _values.push_back(new arg_nesterov());
+
24  _values.push_back(new arg_bfgs());
+
25  _values.push_back(new arg_newton());
+
26 
+
27  _default_cursor = 1;
+ +
29 
+
30  }
+
31 
+
32  };
+
33 
+
34  } // gm
+
35 
+
36 } // stan
+
37 
+
38 #endif
+
39 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__output_8hpp.html b/doc/api/html/arg__output_8hpp.html new file mode 100644 index 00000000000..a478bcbae69 --- /dev/null +++ b/doc/api/html/arg__output_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/gm/arguments/arg_output.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_output.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_output
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__output_8hpp_source.html b/doc/api/html/arg__output_8hpp_source.html new file mode 100644 index 00000000000..9ba5cfba3f4 --- /dev/null +++ b/doc/api/html/arg__output_8hpp_source.html @@ -0,0 +1,143 @@ + + + + + +Stan: src/stan/gm/arguments/arg_output.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_output.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__OUTPUT__HPP__
+
2 #define __STAN__GM__ARGUMENTS__OUTPUT__HPP__
+
3 
+ +
5 
+ + + +
9 
+
10 namespace stan {
+
11 
+
12  namespace gm {
+
13 
+ +
15 
+
16  public:
+
17 
+ +
19 
+
20  _name = "output";
+
21  _description = "File output options";
+
22 
+
23  _subarguments.push_back(new arg_output_file());
+
24  _subarguments.push_back(new arg_diagnostic_file());
+
25  _subarguments.push_back(new arg_refresh());
+
26 
+
27  }
+
28 
+
29  };
+
30 
+
31  } // gm
+
32 
+
33 } // stan
+
34 
+
35 #endif
+
36 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__output__file_8hpp.html b/doc/api/html/arg__output__file_8hpp.html new file mode 100644 index 00000000000..adc84ef9955 --- /dev/null +++ b/doc/api/html/arg__output__file_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_output_file.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_output_file.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_output_file
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__output__file_8hpp_source.html b/doc/api/html/arg__output__file_8hpp_source.html new file mode 100644 index 00000000000..bbbef6ab75a --- /dev/null +++ b/doc/api/html/arg__output__file_8hpp_source.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/gm/arguments/arg_output_file.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_output_file.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__OUTPUT__FILE__HPP__
+
2 #define __STAN__GM__ARGUMENTS__OUTPUT__FILE__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+ +
11 
+
12  public:
+
13 
+ +
15  _name = "file";
+
16  _description = "Output file";
+
17  _validity = "Path to existing file";
+
18  _default = "output.csv";
+
19  _default_value = "output.csv";
+
20  _constrained = false;
+
21  _good_value = "good";
+ +
23  };
+
24 
+
25  };
+
26 
+
27  } // gm
+
28 
+
29 } // stan
+
30 
+
31 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__random_8hpp.html b/doc/api/html/arg__random_8hpp.html new file mode 100644 index 00000000000..ca2b2221813 --- /dev/null +++ b/doc/api/html/arg__random_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/gm/arguments/arg_random.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_random.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_random
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__random_8hpp_source.html b/doc/api/html/arg__random_8hpp_source.html new file mode 100644 index 00000000000..494b5e35ed2 --- /dev/null +++ b/doc/api/html/arg__random_8hpp_source.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/gm/arguments/arg_random.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_random.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__RANDOM__HPP__
+
2 #define __STAN__GM__ARGUMENTS__RANDOM__HPP__
+
3 
+ +
5 
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace gm {
+
11 
+ +
13 
+
14  public:
+
15 
+ +
17 
+
18  _name = "random";
+
19  _description = "Random number configuration";
+
20 
+
21  _subarguments.push_back(new arg_seed());
+
22 
+
23  }
+
24 
+
25  };
+
26 
+
27  } // gm
+
28 
+
29 } // stan
+
30 
+
31 #endif
+
32 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__refresh_8hpp.html b/doc/api/html/arg__refresh_8hpp.html new file mode 100644 index 00000000000..4f4892f9158 --- /dev/null +++ b/doc/api/html/arg__refresh_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_refresh.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_refresh.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_refresh
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__refresh_8hpp_source.html b/doc/api/html/arg__refresh_8hpp_source.html new file mode 100644 index 00000000000..bcb6aaa9dcc --- /dev/null +++ b/doc/api/html/arg__refresh_8hpp_source.html @@ -0,0 +1,142 @@ + + + + + +Stan: src/stan/gm/arguments/arg_refresh.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_refresh.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__REFRESH__HPP__
+
2 #define __STAN__GM__ARGUMENTS__REFRESH__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+
10  class arg_refresh: public int_argument {
+
11 
+
12  public:
+
13 
+ +
15  _name = "refresh";
+
16  _description = "Number of interations between screen updates";
+
17  _validity = "0 < refresh";
+
18  _default = "100";
+
19  _default_value = 100;
+
20  _constrained = true;
+
21  _good_value = 2.0;
+
22  _bad_value = -1.0;
+ +
24  };
+
25 
+
26  bool is_valid(int value) { return value > 0; }
+
27 
+
28  };
+
29 
+
30  } // gm
+
31 
+
32 } // stan
+
33 
+
34 #endif
+
35 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__rwm_8hpp.html b/doc/api/html/arg__rwm_8hpp.html new file mode 100644 index 00000000000..3bdfaa32738 --- /dev/null +++ b/doc/api/html/arg__rwm_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_rwm.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_rwm.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_rwm
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__rwm_8hpp_source.html b/doc/api/html/arg__rwm_8hpp_source.html new file mode 100644 index 00000000000..b8f27c73962 --- /dev/null +++ b/doc/api/html/arg__rwm_8hpp_source.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/gm/arguments/arg_rwm.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_rwm.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__RWM__HPP__
+
2 #define __STAN__GM__ARGUMENTS__RWM__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+
10  class arg_rwm: public categorical_argument {
+
11 
+
12  public:
+
13 
+
14  arg_rwm() {
+
15 
+
16  _name = "rwm";
+
17  _description = "Random Walk Metropolis Monte Carlo";
+
18 
+
19  }
+
20 
+
21  };
+
22 
+
23  } // gm
+
24 
+
25 } // stan
+
26 
+
27 #endif
+
28 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__sample_8hpp.html b/doc/api/html/arg__sample_8hpp.html new file mode 100644 index 00000000000..bf898aa9f7a --- /dev/null +++ b/doc/api/html/arg__sample_8hpp.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/gm/arguments/arg_sample.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_sample.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_sample
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__sample_8hpp_source.html b/doc/api/html/arg__sample_8hpp_source.html new file mode 100644 index 00000000000..cdceab2c35a --- /dev/null +++ b/doc/api/html/arg__sample_8hpp_source.html @@ -0,0 +1,149 @@ + + + + + +Stan: src/stan/gm/arguments/arg_sample.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_sample.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__SAMPLE__HPP__
+
2 #define __STAN__GM__ARGUMENTS__SAMPLE__HPP__
+
3 
+ +
5 
+ + + + + + +
12 
+
13 namespace stan {
+
14 
+
15  namespace gm {
+
16 
+ +
18 
+
19  public:
+
20 
+ +
22 
+
23  _name = "sample";
+
24  _description = "Bayesian inference with Markov Chain Monte Carlo";
+
25 
+
26  _subarguments.push_back(new arg_num_samples());
+
27  _subarguments.push_back(new arg_num_warmup());
+
28  _subarguments.push_back(new arg_save_warmup());
+
29  _subarguments.push_back(new arg_thin());
+
30  _subarguments.push_back(new arg_adapt());
+
31  _subarguments.push_back(new arg_sample_algo());
+
32 
+
33  }
+
34 
+
35  };
+
36 
+
37  } // gm
+
38 
+
39 } // stan
+
40 
+
41 #endif
+
42 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__sample__algo_8hpp.html b/doc/api/html/arg__sample__algo_8hpp.html new file mode 100644 index 00000000000..dc8034fc48a --- /dev/null +++ b/doc/api/html/arg__sample__algo_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/gm/arguments/arg_sample_algo.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_sample_algo.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_sample_algo
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__sample__algo_8hpp_source.html b/doc/api/html/arg__sample__algo_8hpp_source.html new file mode 100644 index 00000000000..ee47bdbe089 --- /dev/null +++ b/doc/api/html/arg__sample__algo_8hpp_source.html @@ -0,0 +1,143 @@ + + + + + +Stan: src/stan/gm/arguments/arg_sample_algo.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_sample_algo.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__SAMPLE__ALGO__HPP__
+
2 #define __STAN__GM__ARGUMENTS__SAMPLE__ALGO__HPP__
+
3 
+ +
5 
+ + +
8 
+
9 namespace stan {
+
10 
+
11  namespace gm {
+
12 
+ +
14 
+
15  public:
+
16 
+ +
18 
+
19  _name = "algorithm";
+
20  _description = "Sampling algorithm";
+
21 
+
22  _values.push_back(new arg_hmc());
+
23 
+
24  _default_cursor = 0;
+ +
26 
+
27  }
+
28 
+
29  };
+
30 
+
31  } // gm
+
32 
+
33 } // stan
+
34 
+
35 #endif
+
36 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__save__iterations_8hpp.html b/doc/api/html/arg__save__iterations_8hpp.html new file mode 100644 index 00000000000..cd8d82eb265 --- /dev/null +++ b/doc/api/html/arg__save__iterations_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_save_iterations.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_save_iterations.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_save_iterations
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__save__iterations_8hpp_source.html b/doc/api/html/arg__save__iterations_8hpp_source.html new file mode 100644 index 00000000000..09554d07551 --- /dev/null +++ b/doc/api/html/arg__save__iterations_8hpp_source.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/gm/arguments/arg_save_iterations.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_save_iterations.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__OUTPUT__SAVE__ITERATIONS__HPP__
+
2 #define __STAN__GM__ARGUMENTS__OUTPUT__SAVE__ITERATIONS__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+ +
11 
+
12  public:
+
13 
+ +
15  _name = "save_iterations";
+
16  _description = "Stream optimization progress to output?";
+
17  _validity = "[0, 1]";
+
18  _default = "0";
+
19  _default_value = false;
+
20  _constrained = false;
+
21  _good_value = 1;
+ +
23  };
+
24 
+
25  };
+
26 
+
27  } // gm
+
28 
+
29 } // stan
+
30 
+
31 #endif
+
32 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__save__warmup_8hpp.html b/doc/api/html/arg__save__warmup_8hpp.html new file mode 100644 index 00000000000..934577e4a84 --- /dev/null +++ b/doc/api/html/arg__save__warmup_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_save_warmup.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_save_warmup.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_save_warmup
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__save__warmup_8hpp_source.html b/doc/api/html/arg__save__warmup_8hpp_source.html new file mode 100644 index 00000000000..bd59f68a81a --- /dev/null +++ b/doc/api/html/arg__save__warmup_8hpp_source.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/gm/arguments/arg_save_warmup.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_save_warmup.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__OUTPUT__SAVE__WARMUP__HPP__
+
2 #define __STAN__GM__ARGUMENTS__OUTPUT__SAVE__WARMUP__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+ +
11 
+
12  public:
+
13 
+ +
15  _name = "save_warmup";
+
16  _description = "Stream warmup samples to output?";
+
17  _validity = "[0, 1]";
+
18  _default = "0";
+
19  _default_value = false;
+
20  _constrained = false;
+
21  _good_value = 1;
+ +
23  };
+
24 
+
25  };
+
26 
+
27  } // gm
+
28 
+
29 } // stan
+
30 
+
31 #endif
+
32 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__seed_8hpp.html b/doc/api/html/arg__seed_8hpp.html new file mode 100644 index 00000000000..68f3dd7b4fd --- /dev/null +++ b/doc/api/html/arg__seed_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_seed.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_seed.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_seed
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__seed_8hpp_source.html b/doc/api/html/arg__seed_8hpp_source.html new file mode 100644 index 00000000000..bece116121d --- /dev/null +++ b/doc/api/html/arg__seed_8hpp_source.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/gm/arguments/arg_seed.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_seed.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__SEED__HPP__
+
2 #define __STAN__GM__ARGUMENTS__SEED__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+
10  class arg_seed: public u_int_argument {
+
11 
+
12  public:
+
13 
+ +
15  _name = "seed";
+
16  _description = "Random number generator seed";
+
17  _validity = "seed > 0, if negative seed is generated from time";
+
18  _default = "-1";
+
19  _default_value = -1;
+
20  _constrained = false;
+
21  _good_value = 18383;
+ +
23  };
+
24 
+
25  };
+
26 
+
27  } // gm
+
28 
+
29 } // stan
+
30 
+
31 #endif
+
32 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__static_8hpp.html b/doc/api/html/arg__static_8hpp.html new file mode 100644 index 00000000000..e1fe90bb4a9 --- /dev/null +++ b/doc/api/html/arg__static_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/gm/arguments/arg_static.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_static.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_static
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__static_8hpp_source.html b/doc/api/html/arg__static_8hpp_source.html new file mode 100644 index 00000000000..9c893040738 --- /dev/null +++ b/doc/api/html/arg__static_8hpp_source.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/gm/arguments/arg_static.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_static.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__STATIC__HMC__HPP__
+
2 #define __STAN__GM__ARGUMENTS__STATIC__HMC__HPP__
+
3 
+ +
5 
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace gm {
+
11 
+ +
13 
+
14  public:
+
15 
+ +
17 
+
18  _name = "static";
+
19  _description = "Static integration time";
+
20 
+
21  _subarguments.push_back(new arg_int_time());
+
22 
+
23  }
+
24 
+
25  };
+
26 
+
27  } // gm
+
28 
+
29 } // stan
+
30 
+
31 #endif
+
32 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__stepsize_8hpp.html b/doc/api/html/arg__stepsize_8hpp.html new file mode 100644 index 00000000000..deae7cf9412 --- /dev/null +++ b/doc/api/html/arg__stepsize_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_stepsize.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_stepsize.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_stepsize
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__stepsize_8hpp_source.html b/doc/api/html/arg__stepsize_8hpp_source.html new file mode 100644 index 00000000000..9a9ec9adbbf --- /dev/null +++ b/doc/api/html/arg__stepsize_8hpp_source.html @@ -0,0 +1,141 @@ + + + + + +Stan: src/stan/gm/arguments/arg_stepsize.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_stepsize.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__STEPSIZE__HPP__
+
2 #define __STAN__GM__ARGUMENTS__STEPSIZE__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+
10  class arg_stepsize: public real_argument {
+
11 
+
12  public:
+
13 
+ +
15  _name = "stepsize";
+
16  _description = "Step size for discrete evolution";
+
17  _validity = "0 < stepsize";
+
18  _default = "1";
+
19  _default_value = 1.0;
+
20  _constrained = true;
+
21  _good_value = 2.0;
+
22  _bad_value = -1.0;
+ +
24  };
+
25 
+
26  bool is_valid(double value) { return value > 0; }
+
27 
+
28  };
+
29 
+
30  } // gm
+
31 
+
32 } // stan
+
33 
+
34 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__stepsize__jitter_8hpp.html b/doc/api/html/arg__stepsize__jitter_8hpp.html new file mode 100644 index 00000000000..49542b53290 --- /dev/null +++ b/doc/api/html/arg__stepsize__jitter_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_stepsize_jitter.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_stepsize_jitter.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_stepsize_jitter
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__stepsize__jitter_8hpp_source.html b/doc/api/html/arg__stepsize__jitter_8hpp_source.html new file mode 100644 index 00000000000..fdcf2f9c7f7 --- /dev/null +++ b/doc/api/html/arg__stepsize__jitter_8hpp_source.html @@ -0,0 +1,141 @@ + + + + + +Stan: src/stan/gm/arguments/arg_stepsize_jitter.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_stepsize_jitter.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__STEPSIZE__JITTER__HPP__
+
2 #define __STAN__GM__ARGUMENTS__STEPSIZE__JITTER__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+ +
11 
+
12  public:
+
13 
+ +
15  _name = "stepsize_jitter";
+
16  _description = "Uniformly random jitter of the stepsize, in percent";
+
17  _validity = "0 <= stepsize_jitter <= 1";
+
18  _default = "0";
+
19  _default_value = 0.0;
+
20  _constrained = true;
+
21  _good_value = 0.5;
+
22  _bad_value = -1.0;
+ +
24  };
+
25 
+
26  bool is_valid(double value) { return 0 <= value && value <= 1; }
+
27 
+
28  };
+
29 
+
30  } // gm
+
31 
+
32 } // stan
+
33 
+
34 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__test_8hpp.html b/doc/api/html/arg__test_8hpp.html new file mode 100644 index 00000000000..8531de3d034 --- /dev/null +++ b/doc/api/html/arg__test_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/gm/arguments/arg_test.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_test.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_test
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__test_8hpp_source.html b/doc/api/html/arg__test_8hpp_source.html new file mode 100644 index 00000000000..8471e65098b --- /dev/null +++ b/doc/api/html/arg__test_8hpp_source.html @@ -0,0 +1,142 @@ + + + + + +Stan: src/stan/gm/arguments/arg_test.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_test.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__TEST__HPP__
+
2 #define __STAN__GM__ARGUMENTS__TEST__HPP__
+
3 
+ +
5 
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace gm {
+
11 
+
12  class arg_test: public list_argument {
+
13 
+
14  public:
+
15 
+ +
17 
+
18  _name = "test";
+
19  _description = "Diagnostic test";
+
20 
+
21  _values.push_back(new arg_test_gradient());
+
22 
+
23  _default_cursor = 0;
+ +
25 
+
26  }
+
27 
+
28  };
+
29 
+
30  } // gm
+
31 
+
32 } // stan
+
33 
+
34 #endif
+
35 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__test__grad__eps_8hpp.html b/doc/api/html/arg__test__grad__eps_8hpp.html new file mode 100644 index 00000000000..ba4edc5b5dc --- /dev/null +++ b/doc/api/html/arg__test__grad__eps_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_test_grad_eps.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_test_grad_eps.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_test_grad_eps
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__test__grad__eps_8hpp_source.html b/doc/api/html/arg__test__grad__eps_8hpp_source.html new file mode 100644 index 00000000000..6e919879d97 --- /dev/null +++ b/doc/api/html/arg__test__grad__eps_8hpp_source.html @@ -0,0 +1,141 @@ + + + + + +Stan: src/stan/gm/arguments/arg_test_grad_eps.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_test_grad_eps.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__TEST__GRAD__EPS__HPP__
+
2 #define __STAN__GM__ARGUMENTS__TEST__GRAD__EPS__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+ +
11 
+
12  public:
+
13 
+ +
15  _name = "epsilon";
+
16  _description = "Finite difference step size";
+
17  _validity = "0 < epsilon";
+
18  _default = "1e-6";
+
19  _default_value = 1e-6;
+
20  _constrained = true;
+
21  _good_value = 1e-6;
+
22  _bad_value = -1.0;
+ +
24  };
+
25 
+
26  bool is_valid(double value) { return value > 0; }
+
27 
+
28  };
+
29 
+
30  } // gm
+
31 
+
32 } // stan
+
33 
+
34 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__test__grad__err_8hpp.html b/doc/api/html/arg__test__grad__err_8hpp.html new file mode 100644 index 00000000000..5ba1514d5d6 --- /dev/null +++ b/doc/api/html/arg__test__grad__err_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_test_grad_err.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_test_grad_err.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_test_grad_err
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__test__grad__err_8hpp_source.html b/doc/api/html/arg__test__grad__err_8hpp_source.html new file mode 100644 index 00000000000..cdde9373be5 --- /dev/null +++ b/doc/api/html/arg__test__grad__err_8hpp_source.html @@ -0,0 +1,141 @@ + + + + + +Stan: src/stan/gm/arguments/arg_test_grad_err.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_test_grad_err.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__TEST__GRAD__ERR__HPP__
+
2 #define __STAN__GM__ARGUMENTS__TEST__GRAD__ERR__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+ +
11 
+
12  public:
+
13 
+ +
15  _name = "error";
+
16  _description = "Error threshold";
+
17  _validity = "0 < error";
+
18  _default = "1e-6";
+
19  _default_value = 1e-6;
+
20  _constrained = true;
+
21  _good_value = 1e-6;
+
22  _bad_value = -1.0;
+ +
24  };
+
25 
+
26  bool is_valid(double value) { return value > 0; }
+
27 
+
28  };
+
29 
+
30  } // gm
+
31 
+
32 } // stan
+
33 
+
34 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__test__gradient_8hpp.html b/doc/api/html/arg__test__gradient_8hpp.html new file mode 100644 index 00000000000..dbaa08eb3b4 --- /dev/null +++ b/doc/api/html/arg__test__gradient_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/gm/arguments/arg_test_gradient.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_test_gradient.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_test_gradient
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__test__gradient_8hpp_source.html b/doc/api/html/arg__test__gradient_8hpp_source.html new file mode 100644 index 00000000000..1e0e2dfd84c --- /dev/null +++ b/doc/api/html/arg__test__gradient_8hpp_source.html @@ -0,0 +1,140 @@ + + + + + +Stan: src/stan/gm/arguments/arg_test_gradient.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_test_gradient.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__TEST__GRADIENT__HPP__
+
2 #define __STAN__GM__ARGUMENTS__TEST__GRADIENT__HPP__
+
3 
+ + + +
7 
+
8 namespace stan {
+
9 
+
10  namespace gm {
+
11 
+ +
13 
+
14  public:
+
15 
+ +
17 
+
18  _name = "gradient";
+
19  _description = "Check model gradient against finite differences";
+
20 
+
21  _subarguments.push_back(new arg_test_grad_eps());
+
22  _subarguments.push_back(new arg_test_grad_err());
+
23 
+
24  }
+
25 
+
26  };
+
27 
+
28  } // gm
+
29 
+
30 } // stan
+
31 
+
32 #endif
+
33 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__thin_8hpp.html b/doc/api/html/arg__thin_8hpp.html new file mode 100644 index 00000000000..da920ebef92 --- /dev/null +++ b/doc/api/html/arg__thin_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_thin.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_thin.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_thin
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__thin_8hpp_source.html b/doc/api/html/arg__thin_8hpp_source.html new file mode 100644 index 00000000000..a7a34dcf0b9 --- /dev/null +++ b/doc/api/html/arg__thin_8hpp_source.html @@ -0,0 +1,142 @@ + + + + + +Stan: src/stan/gm/arguments/arg_thin.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_thin.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__THIN__HPP__
+
2 #define __STAN__GM__ARGUMENTS__THIN__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+
10  class arg_thin: public int_argument {
+
11 
+
12  public:
+
13 
+ +
15  _name = "thin";
+
16  _description = "Period between saved samples";
+
17  _validity = "0 < thin";
+
18  _default = "1";
+
19  _default_value = 1;
+
20  _constrained = true;
+
21  _good_value = 2.0;
+
22  _bad_value = -1.0;
+ +
24  };
+
25 
+
26  bool is_valid(int value) { return value > 0; }
+
27 
+
28  };
+
29 
+
30  } // gm
+
31 
+
32 } // stan
+
33 
+
34 #endif
+
35 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__tolerance_8hpp.html b/doc/api/html/arg__tolerance_8hpp.html new file mode 100644 index 00000000000..c9189a4bb49 --- /dev/null +++ b/doc/api/html/arg__tolerance_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_tolerance.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_tolerance.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_tolerance
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__tolerance_8hpp_source.html b/doc/api/html/arg__tolerance_8hpp_source.html new file mode 100644 index 00000000000..c77aa38e390 --- /dev/null +++ b/doc/api/html/arg__tolerance_8hpp_source.html @@ -0,0 +1,141 @@ + + + + + +Stan: src/stan/gm/arguments/arg_tolerance.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_tolerance.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__TOLERANCE_HPP__
+
2 #define __STAN__GM__ARGUMENTS__TOLERANCE_HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+
10  class arg_tolerance : public real_argument {
+
11 
+
12  public:
+
13 
+
14  arg_tolerance(const char *name, const char *desc, const char *def_str, double def) : real_argument() {
+
15  _name = name;
+
16  _description = desc;
+
17  _validity = "0 < tol";
+
18  _default = def_str;
+
19  _default_value = def;
+
20  _constrained = true;
+
21  _good_value = 1.0;
+
22  _bad_value = -1.0;
+ +
24  };
+
25 
+
26  bool is_valid(double value) { return value > 0; }
+
27 
+
28  };
+
29 
+
30  } // gm
+
31 
+
32 } // stan
+
33 
+
34 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__unit__e_8hpp.html b/doc/api/html/arg__unit__e_8hpp.html new file mode 100644 index 00000000000..fc63b4e9a79 --- /dev/null +++ b/doc/api/html/arg__unit__e_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/arg_unit_e.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
arg_unit_e.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::arg_unit_e
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/arg__unit__e_8hpp_source.html b/doc/api/html/arg__unit__e_8hpp_source.html new file mode 100644 index 00000000000..88d550bca79 --- /dev/null +++ b/doc/api/html/arg__unit__e_8hpp_source.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/gm/arguments/arg_unit_e.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
arg_unit_e.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__UNIT_E__HPP__
+
2 #define __STAN__GM__ARGUMENTS__UNIT_E__HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+
10  class arg_unit_e: public unvalued_argument {
+
11 
+
12  public:
+
13 
+ +
15 
+
16  _name = "unit_e";
+
17  _description = "Euclidean manifold with unit metric";
+
18 
+
19  }
+
20 
+
21  };
+
22 
+
23  } // gm
+
24 
+
25 } // stan
+
26 
+
27 #endif
+
28 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/argument_8hpp.html b/doc/api/html/argument_8hpp.html new file mode 100644 index 00000000000..19b7ae97a03 --- /dev/null +++ b/doc/api/html/argument_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/gm/arguments/argument.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
argument.hpp File Reference
+
+
+
#include <vector>
+#include <string>
+#include <sstream>
+#include <iomanip>
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::argument
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/argument_8hpp_source.html b/doc/api/html/argument_8hpp_source.html new file mode 100644 index 00000000000..4df8f15d71f --- /dev/null +++ b/doc/api/html/argument_8hpp_source.html @@ -0,0 +1,193 @@ + + + + + +Stan: src/stan/gm/arguments/argument.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
argument.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__ARGUMENT__BETA__
+
2 #define __STAN__GM__ARGUMENTS__ARGUMENT__BETA__
+
3 
+
4 #include <vector>
+
5 #include <string>
+
6 #include <sstream>
+
7 #include <iomanip>
+
8 
+
9 namespace stan {
+
10  namespace gm {
+
11 
+
12  class argument {
+
13  public:
+
14 
+ +
16  : indent_width(2),
+
17  help_width(20) { }
+
18 
+
19  argument(const std::string name)
+
20  : _name(name),
+
21  indent_width(2),
+
22  help_width(20) { }
+
23 
+
24  virtual ~argument() { }
+
25 
+
26  std::string name() const {
+
27  return _name;
+
28  }
+
29 
+
30  std::string description() const {
+
31  return _description;
+
32  }
+
33 
+
34  virtual void print(std::ostream* s, const int depth, const char prefix) = 0;
+
35  virtual void print_help(std::ostream* s, const int depth, const bool recurse) = 0;
+
36 
+
37  virtual bool parse_args(std::vector<std::string>& args,
+
38  std::ostream* out,
+
39  std::ostream* err,
+
40  bool& help_flag) {
+
41  return true;
+
42  }
+
43 
+
44  virtual void probe_args(argument* base_arg, std::stringstream& s) {};
+
45 
+
46  virtual void find_arg(std::string name,
+
47  std::string prefix,
+
48  std::vector<std::string>& valid_paths) {
+
49  if (name == _name) {
+
50  valid_paths.push_back(prefix + _name);
+
51  }
+
52  }
+
53 
+
54  static void split_arg(const std::string& arg, std::string& name, std::string& value) {
+
55  size_t pos = arg.find('=');
+
56 
+
57  if (pos != std::string::npos) {
+
58  name = arg.substr(0, pos);
+
59  value = arg.substr(pos + 1, arg.size() - pos);
+
60  }
+
61  else {
+
62  name = arg;
+
63  value = "";
+
64  }
+
65  }
+
66 
+
67  virtual argument* arg(const std::string name) {
+
68  return 0;
+
69  }
+
70 
+
71  int compute_indent(const int depth) {
+
72  return indent_width * depth + 1;
+
73  }
+
74 
+
75  protected:
+
76  std::string _name;
+
77  std::string _description;
+
78 
+ + +
81  };
+
82 
+
83  } // gm
+
84 } // stan
+
85 #endif
+
86 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/argument__parser_8hpp.html b/doc/api/html/argument__parser_8hpp.html new file mode 100644 index 00000000000..18e4b8a2929 --- /dev/null +++ b/doc/api/html/argument__parser_8hpp.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/gm/arguments/argument_parser.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
argument_parser.hpp File Reference
+
+
+
#include <string>
+#include <vector>
+#include <fstream>
+#include <cstring>
+#include <stan/gm/arguments/argument.hpp>
+#include <stan/gm/arguments/arg_method.hpp>
+#include <stan/gm/error_codes.hpp>
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::argument_parser
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/argument__parser_8hpp_source.html b/doc/api/html/argument__parser_8hpp_source.html new file mode 100644 index 00000000000..f43241bee19 --- /dev/null +++ b/doc/api/html/argument__parser_8hpp_source.html @@ -0,0 +1,345 @@ + + + + + +Stan: src/stan/gm/arguments/argument_parser.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
argument_parser.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__ARGUMENT__PARSER__HPP__
+
2 #define __STAN__GM__ARGUMENTS__ARGUMENT__PARSER__HPP__
+
3 
+
4 #include <string>
+
5 #include <vector>
+
6 #include <fstream>
+
7 #include <cstring>
+
8 
+ + +
11 #include <stan/gm/error_codes.hpp>
+
12 
+
13 namespace stan {
+
14 
+
15  namespace gm {
+
16 
+ +
18 
+
19  public:
+
20 
+
21  argument_parser(std::vector<argument*>& valid_args)
+
22  : _arguments(valid_args),
+
23  _help_flag(false),
+
24  _method_flag(false)
+
25  {
+
26  _arguments.insert(_arguments.begin(), new arg_method());
+
27  }
+
28 
+
29  int parse_args(int argc,
+
30  const char* argv[],
+
31  std::ostream* out = 0,
+
32  std::ostream* err = 0) {
+
33 
+
34  if (argc == 1) {
+
35  print_usage(out, argv[0]);
+
36  return error_codes::USAGE;
+
37  }
+
38 
+
39  std::vector<std::string> args;
+
40 
+
41  // Fill in reverse order as parse_args pops from the back
+
42  for (int i = argc - 1; i > 0; --i)
+
43  args.push_back(std::string(argv[i]));
+
44 
+
45  bool good_arg = true;
+
46  bool valid_arg = true;
+
47  _help_flag = false;
+
48 
+
49  std::vector<argument*> unset_args = _arguments;
+
50 
+
51  while(good_arg) {
+
52 
+
53  if (args.size() == 0)
+
54  break;
+
55 
+
56  good_arg = false;
+
57  std::string cat_name = args.back();
+
58 
+
59  // Check for method arguments entered without the method= prefix
+
60  if (!_method_flag) {
+
61 
+
62  list_argument* method = dynamic_cast<list_argument*>(_arguments.front());
+
63 
+
64  if (method->valid_value(cat_name)) {
+
65  cat_name = "method=" + cat_name;
+
66  args.back() = cat_name;
+
67  }
+
68 
+
69  }
+
70 
+
71  std::string val_name;
+
72  std::string val;
+
73  argument::split_arg(cat_name, val_name, val);
+
74 
+
75  if (val_name == "method")
+
76  _method_flag = true;
+
77 
+
78  std::vector<argument*>::iterator arg_it;
+
79 
+
80  for (arg_it = unset_args.begin(); arg_it != unset_args.end(); ++arg_it) {
+
81  if ( (*arg_it)->name() == cat_name) {
+
82  args.pop_back();
+
83  valid_arg &= (*arg_it)->parse_args(args, out, err, _help_flag);
+
84  good_arg = true;
+
85  break;
+
86  }
+
87  else if ( (*arg_it)->name() == val_name) {
+
88  valid_arg &= (*arg_it)->parse_args(args, out, err, _help_flag);
+
89  good_arg = true;
+
90  break;
+
91  }
+
92 
+
93  }
+
94 
+
95  if (good_arg) unset_args.erase(arg_it);
+
96 
+
97  if (cat_name == "help") {
+
98  _help_flag |= true;
+
99  args.clear();
+
100  } else if (cat_name == "help-all") {
+
101  print_help(out, true);
+
102  _help_flag |= true;
+
103  args.clear();
+
104  }
+
105 
+
106  if (_help_flag) {
+
107  print_usage(out, argv[0]);
+
108  return error_codes::OK;
+
109  }
+
110 
+
111  if (!good_arg && err) {
+
112 
+
113  *err << cat_name << " is either mistyped or misplaced." << std::endl;
+
114 
+
115  std::vector<std::string> valid_paths;
+
116 
+
117  for (size_t i = 0; i < _arguments.size(); ++i) {
+
118  _arguments.at(i)->find_arg(val_name, "", valid_paths);
+
119  }
+
120 
+
121  if (valid_paths.size()) {
+
122  *err << "Perhaps you meant one of the following valid configurations?" << std::endl;
+
123  for (size_t i = 0; i < valid_paths.size(); ++i)
+
124  *err << " " << valid_paths.at(i) << std::endl;
+
125  }
+
126  }
+
127  }
+
128 
+
129  if (_help_flag)
+
130  return error_codes::OK;
+
131 
+
132  if (!_method_flag)
+
133  *err << "A method must be specified!" << std::endl;
+
134 
+
135  return (valid_arg && good_arg && _method_flag) ?
+ +
137  }
+
138 
+
139  void print(std::ostream* s, const char prefix = '\0') {
+
140  if (!s)
+
141  return;
+
142 
+
143  for (size_t i = 0; i < _arguments.size(); ++i) {
+
144  _arguments.at(i)->print(s, 0, prefix);
+
145  }
+
146 
+
147  }
+
148 
+
149  void print_help(std::ostream* s, bool recurse) {
+
150  if (!s)
+
151  return;
+
152 
+
153  for (size_t i = 0; i < _arguments.size(); ++i) {
+
154  _arguments.at(i)->print_help(s, 1, recurse);
+
155  }
+
156  }
+
157 
+
158  void print_usage(std::ostream* s, const char* executable) {
+
159  if (!s)
+
160  return;
+
161 
+
162  std::string indent(2, ' ');
+
163  int width = 12;
+
164  *s << std::left;
+
165 
+
166  *s << "Usage: " << executable << " <arg1> <subarg1_1> ... <subarg1_m>"
+
167  << " ... <arg_n> <subarg_n_1> ... <subarg_n_m>"
+
168  << std::endl << std::endl;
+
169 
+
170  *s << "Begin by selecting amongst the following inference methods"
+
171  << " and diagnostics," << std::endl;
+
172 
+
173  std::vector<argument*>::iterator arg_it = _arguments.begin();
+
174  list_argument* method = dynamic_cast<list_argument*>(*arg_it);
+
175 
+
176  for (std::vector<argument*>::iterator value_it = method->values().begin();
+
177  value_it != method->values().end(); ++value_it) {
+
178  *s << std::setw(width)
+
179  << indent + (*value_it)->name()
+
180  << indent + (*value_it)->description() << std::endl;
+
181  }
+
182  *s << std::endl;
+
183 
+
184  *s << "Or see help information with" << std::endl;
+
185  *s << std::setw(width)
+
186  << indent + "help"
+
187  << indent + "Prints help" << std::endl;
+
188  *s << std::setw(width)
+
189  << indent + "help-all"
+
190  << indent + "Prints entire argument tree" << std::endl;
+
191  *s << std::endl;
+
192 
+
193  *s << "Additional configuration available by specifying" << std::endl;
+
194 
+
195  ++arg_it;
+
196  for (; arg_it != _arguments.end(); ++arg_it) {
+
197  *s << std::setw(width)
+
198  << indent + (*arg_it)->name()
+
199  << indent + (*arg_it)->description() << std::endl;
+
200  }
+
201 
+
202  *s << std::endl;
+
203  *s << "See " << executable << " <arg1> [ help | help-all ] "
+
204  << "for details on individual arguments." << std::endl << std::endl;
+
205 
+
206  }
+
207 
+
208  argument* arg(std::string name) {
+
209  for (std::vector<argument*>::iterator it = _arguments.begin();
+
210  it != _arguments.end(); ++it)
+
211  if ( name == (*it)->name() )
+
212  return (*it);
+
213  return 0;
+
214  }
+
215 
+
216  bool help_printed() {
+
217  return _help_flag;
+
218  }
+
219 
+
220  protected:
+
221 
+
222  std::vector<argument*>& _arguments;
+
223 
+
224  // We can also check for, and warn the user of, deprecated arguments
+
225  //std::vector<argument*> deprecated_arguments;
+
226  // check_arg_conflict // Ensure non-zero intersection of valid and deprecated arguments
+
227 
+ + +
230 
+
231  };
+
232 
+
233  } // gm
+
234 
+
235 } // stan
+
236 
+
237 #endif
+
238 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/argument__probe_8hpp.html b/doc/api/html/argument__probe_8hpp.html new file mode 100644 index 00000000000..f62e3b378d5 --- /dev/null +++ b/doc/api/html/argument__probe_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/gm/arguments/argument_probe.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
argument_probe.hpp File Reference
+
+
+
#include <string>
+#include <vector>
+#include <sstream>
+#include <stan/gm/arguments/argument.hpp>
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::argument_probe
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/argument__probe_8hpp_source.html b/doc/api/html/argument__probe_8hpp_source.html new file mode 100644 index 00000000000..05596cba415 --- /dev/null +++ b/doc/api/html/argument__probe_8hpp_source.html @@ -0,0 +1,147 @@ + + + + + +Stan: src/stan/gm/arguments/argument_probe.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
argument_probe.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__ARGUMENT__PROBE__HPP__
+
2 #define __STAN__GM__ARGUMENTS__ARGUMENT__PROBE__HPP__
+
3 
+
4 #include <string>
+
5 #include <vector>
+
6 #include <sstream>
+
7 
+ +
9 
+
10 namespace stan {
+
11 
+
12  namespace gm {
+
13 
+ +
15 
+
16  public:
+
17 
+
18  argument_probe(std::vector<argument*>& valid_args)
+
19  : _arguments(valid_args) {}
+
20 
+
21  void probe_args(std::stringstream& s) {
+
22 
+
23  for (std::vector<argument*>::iterator arg_it = _arguments.begin();
+
24  arg_it != _arguments.end(); ++arg_it)
+
25  (*arg_it)->probe_args(*arg_it, s);
+
26 
+
27  }
+
28 
+
29  protected:
+
30 
+
31  std::vector<argument*>& _arguments;
+
32 
+
33  };
+
34 
+
35  } // gm
+
36 
+
37 } // stan
+
38 
+
39 #endif
+
40 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/array__builder_8hpp.html b/doc/api/html/array__builder_8hpp.html new file mode 100644 index 00000000000..5ab0f4b035b --- /dev/null +++ b/doc/api/html/array__builder_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/matrix/array_builder.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
array_builder.hpp File Reference
+
+
+
#include <vector>
+#include <stan/math/matrix/promoter.hpp>
+
+

Go to the source code of this file.

+ + + + + +

+Classes

struct  stan::math::array_builder< T >
 Structure for building up arrays in an expression (rather than in statements) using an argumentchaining add() method and a getter method array() to return the result. More...
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/array__builder_8hpp_source.html b/doc/api/html/array__builder_8hpp_source.html new file mode 100644 index 00000000000..7ce26de1cce --- /dev/null +++ b/doc/api/html/array__builder_8hpp_source.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/math/matrix/array_builder.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
array_builder.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__ARRAY_BUILDER_HPP__
+
2 #define __STAN__MATH__MATRIX__ARRAY_BUILDER_HPP__
+
3 
+
4 #include <vector>
+ +
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
15  template <typename T>
+
16  struct array_builder {
+
17  std::vector<T> x_;
+
18  array_builder() : x_() { }
+
19  template <typename F>
+
20  array_builder& add(const F& u) {
+
21  T t;
+ +
23  x_.push_back(t);
+
24  return *this;
+
25  }
+
26  std::vector<T> array() {
+
27  return x_;
+
28  }
+
29  };
+
30 
+
31  }
+
32 }
+
33 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/assign_8hpp.html b/doc/api/html/assign_8hpp.html new file mode 100644 index 00000000000..f09d8581d86 --- /dev/null +++ b/doc/api/html/assign_8hpp.html @@ -0,0 +1,152 @@ + + + + + +Stan: src/stan/math/matrix/assign.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
assign.hpp File Reference
+
+
+
#include <vector>
+#include <sstream>
+#include <stdexcept>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/validate_matching_sizes.hpp>
+#include <stan/math/matrix/validate_matching_dims.hpp>
+#include <iostream>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + + + + + + + + + + + + + +

+Functions

template<typename LHS , typename RHS >
void stan::math::assign (LHS &lhs, const RHS &rhs)
 Copy the right-hand side's value to the left-hand side variable.
 
template<typename LHS , typename RHS , int R1, int C1, int R2, int C2>
void stan::math::assign (Eigen::Matrix< LHS, R1, C1 > &x, const Eigen::Matrix< RHS, R2, C2 > &y)
 Copy the right-hand side's value to the left-hand side variable.
 
template<typename LHS , typename RHS , int R, int C>
void stan::math::assign (Eigen::Matrix< LHS, R, C > &x, const Eigen::Matrix< RHS, R, C > &y)
 Copy the right-hand side's value to the left-hand side variable.
 
template<typename LHS , typename RHS , int R, int C>
void stan::math::assign (Eigen::Block< LHS > x, const Eigen::Matrix< RHS, R, C > &y)
 Copy the right-hand side's value to the left-hand side variable.
 
template<typename LHS , typename RHS >
void stan::math::assign (std::vector< LHS > &x, const std::vector< RHS > &y)
 Copy the right-hand side's value to the left-hand side variable.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/assign_8hpp_source.html b/doc/api/html/assign_8hpp_source.html new file mode 100644 index 00000000000..7409ada48d6 --- /dev/null +++ b/doc/api/html/assign_8hpp_source.html @@ -0,0 +1,181 @@ + + + + + +Stan: src/stan/math/matrix/assign.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
assign.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__ASSIGN_HPP__
+
2 #define __STAN__MATH__MATRIX__ASSIGN_HPP__
+
3 
+
4 #include <vector>
+
5 #include <sstream>
+
6 #include <stdexcept>
+
7 
+
8 // #include <boost/utility/enable_if.hpp>
+
9 
+ + + +
13 
+
14 
+
15 #include <iostream>
+
16 
+
17 namespace stan {
+
18 
+
19  namespace math {
+
20 
+
21  // Recursive assignment with size match checking and promotion
+
22 
+
37  template <typename LHS, typename RHS>
+
38  inline void
+
39  assign(LHS& lhs, const RHS& rhs) {
+
40  lhs = rhs;
+
41  }
+
42 
+
63  template <typename LHS, typename RHS, int R1, int C1, int R2, int C2>
+
64  inline void
+
65  assign(Eigen::Matrix<LHS,R1,C1>& x,
+
66  const Eigen::Matrix<RHS,R2,C2>& y) {
+
67  std::stringstream ss;
+
68  ss << "error in call to assign(Eigen::Matrix,Eigen::Matrix)"
+
69  << "; shapes must match, but found"
+
70  << " R1=" << R1
+
71  << "; C1=" << C1
+
72  << "; R2=" << R2
+
73  << "; C2=" << C2;
+
74  throw std::domain_error(ss.str());
+
75  }
+
76 
+
94  template <typename LHS, typename RHS, int R, int C>
+
95  inline void
+
96  assign(Eigen::Matrix<LHS,R,C>& x,
+
97  const Eigen::Matrix<RHS,R,C>& y) {
+ +
99  for (int i = 0; i < x.size(); ++i)
+
100  assign(x(i),y(i));
+
101  }
+
102 
+
121  template <typename LHS, typename RHS, int R, int C>
+
122  inline void
+
123  assign(Eigen::Block<LHS> x,
+
124  const Eigen::Matrix<RHS,R,C>& y) {
+ +
126  for (int n = 0; n < y.cols(); ++n)
+
127  for (int m = 0; m < y.rows(); ++m)
+
128  assign(x(m,n),y(m,n));
+
129  }
+
130 
+
131 
+
151  template <typename LHS, typename RHS>
+
152  inline void
+
153  assign(std::vector<LHS>& x, const std::vector<RHS>& y) {
+ +
155  for (size_t i = 0; i < x.size(); ++i)
+
156  assign(x[i],y[i]);
+
157  }
+
158 
+
159 
+
160  }
+
161 }
+
162 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/ast_8hpp.html b/doc/api/html/ast_8hpp.html new file mode 100644 index 00000000000..4d587e77a0b --- /dev/null +++ b/doc/api/html/ast_8hpp.html @@ -0,0 +1,296 @@ + + + + + +Stan: src/stan/gm/ast.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
ast.hpp File Reference
+
+
+
#include <map>
+#include <string>
+#include <vector>
+#include <set>
+#include <boost/variant/recursive_variant.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Classes

struct  stan::gm::nil
 Placeholder struct for boost::variant default ctors. More...
 
struct  stan::gm::expr_type
 
class  stan::gm::function_signatures
 
struct  stan::gm::statements
 
struct  stan::gm::distribution
 
struct  stan::gm::expression_type_vis
 
struct  stan::gm::expression
 
struct  stan::gm::printable
 
struct  stan::gm::is_nil_op
 
struct  stan::gm::variable_dims
 
struct  stan::gm::int_literal
 
struct  stan::gm::double_literal
 
struct  stan::gm::array_literal
 
struct  stan::gm::variable
 
struct  stan::gm::fun
 
struct  stan::gm::index_op
 
struct  stan::gm::binary_op
 
struct  stan::gm::unary_op
 
struct  stan::gm::range
 
struct  stan::gm::base_var_decl
 
struct  stan::gm::variable_map
 
struct  stan::gm::int_var_decl
 
struct  stan::gm::double_var_decl
 
struct  stan::gm::unit_vector_var_decl
 
struct  stan::gm::simplex_var_decl
 
struct  stan::gm::ordered_var_decl
 
struct  stan::gm::positive_ordered_var_decl
 
struct  stan::gm::vector_var_decl
 
struct  stan::gm::row_vector_var_decl
 
struct  stan::gm::matrix_var_decl
 
struct  stan::gm::cholesky_factor_var_decl
 
struct  stan::gm::cov_matrix_var_decl
 
struct  stan::gm::corr_matrix_var_decl
 
struct  stan::gm::name_vis
 
struct  stan::gm::var_decl
 
struct  stan::gm::statement
 
struct  stan::gm::increment_log_prob_statement
 
struct  stan::gm::for_statement
 
struct  stan::gm::conditional_statement
 
struct  stan::gm::while_statement
 
struct  stan::gm::print_statement
 
struct  stan::gm::no_op_statement
 
struct  stan::gm::program
 
struct  stan::gm::sample
 
struct  stan::gm::assignment
 
struct  stan::gm::contains_var
 
struct  stan::gm::contains_nonparam_var
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+ + + + + + + +

+Typedefs

typedef int stan::gm::base_expr_type
 
typedef std::pair< expr_type,
+std::vector< expr_type > > 
stan::gm::function_signature_t
 
typedef int stan::gm::var_origin
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

std::ostream & stan::gm::write_base_expr_type (std::ostream &o, base_expr_type type)
 
std::ostream & stan::gm::operator<< (std::ostream &o, const expr_type &et)
 
expr_type stan::gm::promote_primitive (const expr_type &et)
 
expr_type stan::gm::promote_primitive (const expr_type &et1, const expr_type &et2)
 
bool stan::gm::is_nil (const expression &e)
 
size_t stan::gm::total_dims (const std::vector< std::vector< expression > > &dimss)
 
expr_type stan::gm::infer_type_indexing (const base_expr_type &expr_base_type, size_t num_expr_dims, size_t num_index_dims)
 
expr_type stan::gm::infer_type_indexing (const expression &expr, size_t num_index_dims)
 
void stan::gm::print_var_origin (std::ostream &o, const var_origin &vo)
 
void stan::gm::generate_expression (const expression &e, std::ostream &o)
 
bool stan::gm::has_rng_suffix (const std::string &s)
 
bool stan::gm::has_var (const expression &e, const variable_map &var_map)
 
bool stan::gm::has_non_param_var (const expression &e, const variable_map &var_map)
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Variables

const int stan::gm::INT_T = 1
 
const int stan::gm::DOUBLE_T = 2
 
const int stan::gm::VECTOR_T = 3
 
const int stan::gm::ROW_VECTOR_T = 4
 
const int stan::gm::MATRIX_T = 5
 
const int stan::gm::ILL_FORMED_T = 6
 
const int stan::gm::model_name_origin = 0
 
const int stan::gm::data_origin = 1
 
const int stan::gm::transformed_data_origin = 2
 
const int stan::gm::parameter_origin = 3
 
const int stan::gm::transformed_parameter_origin = 4
 
const int stan::gm::derived_origin = 5
 
const int stan::gm::local_origin = 6
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/ast_8hpp_source.html b/doc/api/html/ast_8hpp_source.html new file mode 100644 index 00000000000..c59b929b014 --- /dev/null +++ b/doc/api/html/ast_8hpp_source.html @@ -0,0 +1,847 @@ + + + + + +Stan: src/stan/gm/ast.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
ast.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__AST_HPP__
+
2 #define __STAN__GM__AST_HPP__
+
3 
+
4 #include <map>
+
5 #include <string>
+
6 #include <vector>
+
7 #include <map>
+
8 #include <set>
+
9 
+
10 #include <boost/variant/recursive_variant.hpp>
+
11 
+
12 namespace stan {
+
13 
+
14  namespace gm {
+
15 
+
18  struct nil { };
+
19 
+
20  // components of abstract syntax tree
+
21  struct array_literal;
+
22  struct assignment;
+
23  struct binary_op;
+
24  struct conditional_statement;
+
25  struct distribution;
+
26  struct double_var_decl;
+
27  struct double_literal;
+
28  struct expression;
+
29  struct for_statement;
+
30  struct fun;
+
31  struct identifier;
+ +
33  struct index_op;
+
34  struct int_literal;
+
35  struct inv_var_decl;
+
36  struct matrix_var_decl;
+
37  struct no_op_statement;
+
38  struct ordered_var_decl;
+ +
40  struct print_statement;
+
41  struct program;
+
42  struct range;
+
43  struct row_vector_var_decl;
+
44  struct sample;
+
45  struct simplex_var_decl;
+
46  struct unit_vector_var_decl;
+
47  struct statement;
+
48  struct statements;
+
49  struct unary_op;
+
50  struct variable;
+
51  struct variable_dims;
+
52  struct var_decl;
+
53  struct var_type;
+
54  struct vector_var_decl;
+ +
56 
+
57  // forward declarable enum hack (can't fwd-decl enum)
+
58  typedef int base_expr_type;
+
59  const int INT_T = 1;
+
60  const int DOUBLE_T = 2;
+
61  const int VECTOR_T = 3;
+
62  const int ROW_VECTOR_T = 4;
+
63  const int MATRIX_T = 5;
+
64  const int ILL_FORMED_T = 6;
+
65 
+
66  std::ostream& write_base_expr_type(std::ostream& o, base_expr_type type);
+
67 
+
68  struct expr_type {
+ +
70  size_t num_dims_;
+
71  expr_type();
+
72  expr_type(const base_expr_type base_type);
+
73  expr_type(const base_expr_type base_type,
+
74  size_t num_dims);
+
75  bool operator==(const expr_type& et) const;
+
76  bool operator!=(const expr_type& et) const;
+
77  bool is_primitive() const;
+
78  bool is_primitive_int() const;
+
79  bool is_primitive_double() const;
+
80  bool is_ill_formed() const;
+
81  base_expr_type type() const;
+
82  size_t num_dims() const;
+
83  };
+
84 
+
85  std::ostream& operator<<(std::ostream& o, const expr_type& et);
+
86 
+ +
88 
+ +
90  const expr_type& et2);
+
91 
+
92  typedef std::pair<expr_type, std::vector<expr_type> > function_signature_t;
+
93 
+ +
95  public:
+
96  static function_signatures& instance();
+
97  void add(const std::string& name,
+
98  const expr_type& result_type,
+
99  const std::vector<expr_type>& arg_types);
+
100  void add(const std::string& name,
+
101  const expr_type& result_type);
+
102  void add(const std::string& name,
+
103  const expr_type& result_type,
+
104  const expr_type& arg_type);
+
105  void add(const std::string& name,
+
106  const expr_type& result_type,
+
107  const expr_type& arg_type1,
+
108  const expr_type& arg_type2);
+
109  void add(const std::string& name,
+
110  const expr_type& result_type,
+
111  const expr_type& arg_type1,
+
112  const expr_type& arg_type2,
+
113  const expr_type& arg_type3);
+
114  void add(const std::string& name,
+
115  const expr_type& result_type,
+
116  const expr_type& arg_type1,
+
117  const expr_type& arg_type2,
+
118  const expr_type& arg_type3,
+
119  const expr_type& arg_type4);
+
120  void add(const std::string& name,
+
121  const expr_type& result_type,
+
122  const expr_type& arg_type1,
+
123  const expr_type& arg_type2,
+
124  const expr_type& arg_type3,
+
125  const expr_type& arg_type4,
+
126  const expr_type& arg_type5);
+
127  void add(const std::string& name,
+
128  const expr_type& result_type,
+
129  const expr_type& arg_type1,
+
130  const expr_type& arg_type2,
+
131  const expr_type& arg_type3,
+
132  const expr_type& arg_type4,
+
133  const expr_type& arg_type5,
+
134  const expr_type& arg_type6);
+
135  void add(const std::string& name,
+
136  const expr_type& result_type,
+
137  const expr_type& arg_type1,
+
138  const expr_type& arg_type2,
+
139  const expr_type& arg_type3,
+
140  const expr_type& arg_type4,
+
141  const expr_type& arg_type5,
+
142  const expr_type& arg_type6,
+
143  const expr_type& arg_type7);
+
144  void add_nullary(const::std::string& name);
+
145  void add_unary(const::std::string& name);
+
146  void add_binary(const::std::string& name);
+
147  void add_ternary(const::std::string& name);
+
148  void add_quaternary(const::std::string& name);
+
149  int num_promotions(const std::vector<expr_type>& call_args,
+
150  const std::vector<expr_type>& sig_args);
+
151  expr_type get_result_type(const std::string& name,
+
152  const std::vector<expr_type>& args,
+
153  std::ostream& error_msgs);
+
154  std::set<std::string> key_set() const;
+
155  private:
+ + +
158  std::map<std::string, std::vector<function_signature_t> > sigs_map_;
+
159  static function_signatures* sigs_; // init below outside of class
+
160  };
+
161 
+
162  struct statements {
+
163  std::vector<var_decl> local_decl_;
+
164  std::vector<statement> statements_;
+
165  statements();
+
166  statements(const std::vector<var_decl>& local_decl,
+
167  const std::vector<statement>& stmts);
+
168  };
+
169 
+
170 
+
171  struct distribution {
+
172  std::string family_;
+
173  std::vector<expression> args_;
+
174  };
+
175 
+
176  struct expression_type_vis : public boost::static_visitor<expr_type> {
+
177  expr_type operator()(const nil& e) const;
+
178  expr_type operator()(const int_literal& e) const;
+
179  expr_type operator()(const double_literal& e) const;
+
180  expr_type operator()(const array_literal& e) const;
+
181  expr_type operator()(const variable& e) const;
+
182  expr_type operator()(const fun& e) const;
+
183  expr_type operator()(const index_op& e) const;
+
184  expr_type operator()(const binary_op& e) const;
+
185  expr_type operator()(const unary_op& e) const;
+
186  // template <typename T> expr_type operator()(const T& e) const;
+
187  };
+
188 
+
189 
+
190 
+
191 
+
192  struct expression;
+
193 
+
194  struct expression {
+
195  typedef boost::variant<boost::recursive_wrapper<nil>,
+
196  boost::recursive_wrapper<int_literal>,
+
197  boost::recursive_wrapper<double_literal>,
+
198  boost::recursive_wrapper<array_literal>,
+
199  boost::recursive_wrapper<variable>,
+
200  boost::recursive_wrapper<fun>,
+
201  boost::recursive_wrapper<index_op>,
+
202  boost::recursive_wrapper<binary_op>,
+
203  boost::recursive_wrapper<unary_op> >
+ +
205 
+
206  expression();
+
207  expression(const expression& e);
+
208 
+
209  // template <typename Expr> expression(const Expr& expr);
+
210  expression(const nil& expr);
+
211  expression(const int_literal& expr);
+
212  expression(const double_literal& expr);
+
213  expression(const array_literal& expr);
+
214  expression(const variable& expr);
+
215  expression(const fun& expr);
+
216  expression(const index_op& expr);
+
217  expression(const binary_op& expr);
+
218  expression(const unary_op& expr);
+
219  expression(const expression_t& expr_);
+
220 
+
221  expr_type expression_type() const;
+
222 
+
223  expression& operator+=(const expression& rhs);
+
224  expression& operator-=(const expression& rhs);
+
225  expression& operator*=(const expression& rhs);
+
226  expression& operator/=(const expression& rhs);
+
227 
+ +
229  };
+
230 
+
231 
+
232  struct printable {
+
233  typedef boost::variant<boost::recursive_wrapper<std::string>,
+
234  boost::recursive_wrapper<expression> >
+ +
236 
+
237  printable();
+ +
239  printable(const std::string& msg);
+ +
241  printable(const printable& printable);
+
242 
+ +
244  };
+
245 
+
246  struct is_nil_op : public boost::static_visitor<bool> {
+
247  bool operator()(const nil& x) const;
+
248  bool operator()(const int_literal& x) const;
+
249  bool operator()(const double_literal& x) const;
+
250  bool operator()(const array_literal& x) const;
+
251  bool operator()(const variable& x) const;
+
252  bool operator()(const fun& x) const;
+
253  bool operator()(const index_op& x) const;
+
254  bool operator()(const binary_op& x) const;
+
255  bool operator()(const unary_op& x) const;
+
256 
+
257  // template <typename T>
+
258  // bool operator()(const T& x) const;
+
259  };
+
260 
+
261  bool is_nil(const expression& e);
+
262 
+
263  struct variable_dims {
+
264  std::string name_;
+
265  std::vector<expression> dims_;
+
266  variable_dims();
+
267  variable_dims(std::string const& name,
+
268  std::vector<expression> const& dims);
+
269  };
+
270 
+
271 
+
272  struct int_literal {
+
273  int val_;
+ +
275  int_literal();
+
276  int_literal(int val);
+
277  int_literal(const int_literal& il);
+
278  int_literal& operator=(const int_literal& il);
+
279  };
+
280 
+
281 
+
282  struct double_literal {
+
283  double val_;
+ +
285  double_literal();
+
286  double_literal(double val);
+ +
288  };
+
289 
+
290  struct array_literal {
+
291  std::vector<expression> args_;
+ +
293  array_literal();
+
294  array_literal(const std::vector<expression>& args);
+ +
296  };
+
297 
+
298  struct variable {
+
299  std::string name_;
+ +
301  variable();
+
302  variable(std::string name);
+
303  void set_type(const base_expr_type& base_type,
+
304  size_t num_dims);
+
305  };
+
306 
+
307  struct fun {
+
308  std::string name_;
+
309  std::vector<expression> args_;
+ +
311  fun();
+
312  fun(std::string const& name,
+
313  std::vector<expression> const& args);
+
314  void infer_type(); // FIXME: is this used anywhere?
+
315  };
+
316 
+
317  size_t total_dims(const std::vector<std::vector<expression> >& dimss);
+
318 
+
319  expr_type infer_type_indexing(const base_expr_type& expr_base_type,
+
320  size_t num_expr_dims,
+
321  size_t num_index_dims);
+
322 
+ +
324  size_t num_index_dims);
+
325 
+
326 
+
327  struct index_op {
+ +
329  std::vector<std::vector<expression> > dimss_;
+ +
331  index_op();
+
332  // vec of vec for e.g., e[1,2][3][4,5,6]
+
333  index_op(const expression& expr,
+
334  const std::vector<std::vector<expression> >& dimss);
+
335  void infer_type();
+
336  };
+
337 
+
338 
+
339  struct binary_op {
+
340  std::string op;
+ + + +
344  binary_op();
+
345  binary_op(const expression& left,
+
346  const std::string& op,
+
347  const expression& right);
+
348  };
+
349 
+
350  struct unary_op {
+
351  char op;
+ + +
354  unary_op(char op,
+
355  expression const& subject);
+
356  };
+
357 
+
358  struct range {
+ + +
361  range();
+
362  range(expression const& low,
+
363  expression const& high);
+
364  bool has_low() const;
+
365  bool has_high() const;
+
366  };
+
367 
+
368  typedef int var_origin;
+
369  const int model_name_origin = 0;
+
370  const int data_origin = 1;
+
371  const int transformed_data_origin = 2;
+
372  const int parameter_origin = 3;
+ +
374  const int derived_origin = 5;
+
375  const int local_origin = 6;
+
376 
+
377 
+
378 
+
379  void print_var_origin(std::ostream& o, const var_origin& vo);
+
380 
+
381  struct base_var_decl {
+
382  std::string name_;
+
383  std::vector<expression> dims_;
+ +
385  base_var_decl();
+
386  base_var_decl(const base_expr_type& base_type);
+
387  base_var_decl(const std::string& name,
+
388  const std::vector<expression>& dims,
+
389  const base_expr_type& base_type);
+
390  };
+
391 
+
392  struct variable_map {
+
393  typedef std::pair<base_var_decl,var_origin> range_t;
+
394  std::map<std::string, range_t> map_;
+
395  bool exists(const std::string& name) const;
+
396  base_var_decl get(const std::string& name) const;
+
397  base_expr_type get_base_type(const std::string& name) const;
+
398  size_t get_num_dims(const std::string& name) const;
+
399  var_origin get_origin(const std::string& name) const;
+
400  void add(const std::string& name,
+
401  const base_var_decl& base_decl,
+
402  const var_origin& vo);
+
403  void remove(const std::string& name);
+
404  };
+
405 
+
406  struct int_var_decl : public base_var_decl {
+ +
408  int_var_decl();
+
409  int_var_decl(range const& range,
+
410  std::string const& name,
+
411  std::vector<expression> const& dims);
+
412  };
+
413 
+
414 
+
415  struct double_var_decl : public base_var_decl {
+ +
417  double_var_decl();
+
418  double_var_decl(range const& range,
+
419  std::string const& name,
+
420  std::vector<expression> const& dims);
+
421  };
+
422 
+ + + + +
427  std::string const& name,
+
428  std::vector<expression> const& dims);
+
429  };
+
430 
+
431  struct simplex_var_decl : public base_var_decl {
+ + +
434  simplex_var_decl(expression const& K,
+
435  std::string const& name,
+
436  std::vector<expression> const& dims);
+
437  };
+
438 
+
439  struct ordered_var_decl : public base_var_decl {
+ + +
442  ordered_var_decl(expression const& K,
+
443  std::string const& name,
+
444  std::vector<expression> const& dims);
+
445  };
+
446 
+ + + + +
451  std::string const& name,
+
452  std::vector<expression> const& dims);
+
453  };
+
454 
+
455  struct vector_var_decl : public base_var_decl {
+ + +
458  vector_var_decl();
+
459  vector_var_decl(range const& range,
+
460  expression const& M,
+
461  std::string const& name,
+
462  std::vector<expression> const& dims);
+
463  };
+
464 
+ + + + + +
470  expression const& N,
+
471  std::string const& name,
+
472  std::vector<expression> const& dims);
+
473  };
+
474 
+
475  struct matrix_var_decl : public base_var_decl {
+ + + +
479  matrix_var_decl();
+
480  matrix_var_decl(range const& range,
+
481  expression const& M,
+
482  expression const& N,
+
483  std::string const& name,
+
484  std::vector<expression> const& dims);
+
485  };
+
486 
+ + + + + +
492  expression const& N,
+
493  std::string const& name,
+
494  std::vector<expression> const& dims);
+
495  };
+
496 
+ + + + +
501  std::string const& name,
+
502  std::vector<expression> const& dims);
+
503  };
+
504 
+
505 
+ + + + +
510  std::string const& name,
+
511  std::vector<expression> const& dims);
+
512  };
+
513 
+
514  struct name_vis : public boost::static_visitor<std::string> {
+
515  name_vis();
+
516  std::string operator()(const nil& x) const;
+
517  std::string operator()(const int_var_decl& x) const;
+
518  std::string operator()(const double_var_decl& x) const;
+
519  std::string operator()(const vector_var_decl& x) const;
+
520  std::string operator()(const row_vector_var_decl& x) const;
+
521  std::string operator()(const matrix_var_decl& x) const;
+
522  std::string operator()(const simplex_var_decl& x) const;
+
523  std::string operator()(const unit_vector_var_decl& x) const;
+
524  std::string operator()(const ordered_var_decl& x) const;
+
525  std::string operator()(const positive_ordered_var_decl& x) const;
+
526  std::string operator()(const cholesky_factor_var_decl& x) const;
+
527  std::string operator()(const cov_matrix_var_decl& x) const;
+
528  std::string operator()(const corr_matrix_var_decl& x) const;
+
529  };
+
530 
+
531 
+
532 
+
533 
+
534  struct var_decl {
+
535  typedef boost::variant<boost::recursive_wrapper<nil>,
+
536  boost::recursive_wrapper<int_var_decl>,
+
537  boost::recursive_wrapper<double_var_decl>,
+
538  boost::recursive_wrapper<vector_var_decl>,
+
539  boost::recursive_wrapper<row_vector_var_decl>,
+
540  boost::recursive_wrapper<matrix_var_decl>,
+
541  boost::recursive_wrapper<simplex_var_decl>,
+
542  boost::recursive_wrapper<unit_vector_var_decl>,
+
543  boost::recursive_wrapper<ordered_var_decl>,
+
544  boost::recursive_wrapper<positive_ordered_var_decl>,
+
545  boost::recursive_wrapper<cholesky_factor_var_decl>,
+
546  boost::recursive_wrapper<cov_matrix_var_decl>,
+
547  boost::recursive_wrapper<corr_matrix_var_decl> >
+ +
549 
+ +
551 
+
552  var_decl();
+
553 
+
554  // template <typename Decl>
+
555  // var_decl(Decl const& decl);
+
556  var_decl(const var_decl_t& decl);
+
557  var_decl(const nil& decl);
+
558  var_decl(const int_var_decl& decl);
+
559  var_decl(const double_var_decl& decl);
+
560  var_decl(const vector_var_decl& decl);
+
561  var_decl(const row_vector_var_decl& decl);
+
562  var_decl(const matrix_var_decl& decl);
+
563  var_decl(const simplex_var_decl& decl);
+
564  var_decl(const unit_vector_var_decl& decl);
+
565  var_decl(const ordered_var_decl& decl);
+
566  var_decl(const positive_ordered_var_decl& decl);
+
567  var_decl(const cholesky_factor_var_decl& decl);
+
568  var_decl(const cov_matrix_var_decl& decl);
+
569  var_decl(const corr_matrix_var_decl& decl);
+
570 
+
571  std::string name() const;
+
572  };
+
573 
+
574  struct statement {
+
575  typedef boost::variant<boost::recursive_wrapper<nil>,
+
576  boost::recursive_wrapper<assignment>,
+
577  boost::recursive_wrapper<sample>,
+
578  boost::recursive_wrapper<increment_log_prob_statement>,
+
579  boost::recursive_wrapper<expression>, // dummy now
+
580  boost::recursive_wrapper<statements>,
+
581  boost::recursive_wrapper<for_statement>,
+
582  boost::recursive_wrapper<conditional_statement>,
+
583  boost::recursive_wrapper<while_statement>,
+
584  boost::recursive_wrapper<print_statement>,
+
585  boost::recursive_wrapper<no_op_statement> >
+ +
587 
+ +
589 
+
590  statement();
+
591  statement(const statement_t& st);
+
592  statement(const nil& st);
+
593  statement(const assignment& st);
+
594  statement(const sample& st);
+ +
596  statement(const expression& st);
+
597  statement(const statements& st);
+
598  statement(const for_statement& st);
+
599  statement(const conditional_statement& st);
+
600  statement(const while_statement& st);
+
601  statement(const print_statement& st);
+
602  statement(const no_op_statement& st);
+
603 
+
604  // template <typename Statement>
+
605  // statement(const Statement& statement);
+
606  };
+
607 
+ + + +
611  increment_log_prob_statement(const expression& log_prob);
+
612  };
+
613 
+
614  struct for_statement {
+
615  std::string variable_;
+ + +
618  for_statement();
+
619  for_statement(std::string& variable,
+
620  range& range,
+
621  statement& stmt);
+
622  };
+
623 
+
624  // bodies may be 1 longer than conditions due to else
+ +
626  std::vector<expression> conditions_;
+
627  std::vector<statement> bodies_;
+ +
629  conditional_statement(const std::vector<expression>& conditions,
+
630  const std::vector<statement>& statements);
+
631  };
+
632 
+ + + +
636  while_statement();
+
637  while_statement(const expression& condition,
+
638  const statement& body);
+
639  };
+
640 
+ +
642  std::vector<printable> printables_;
+
643  print_statement();
+
644  print_statement(const std::vector<printable>& printables);
+
645  };
+
646 
+
647 
+ +
649  // no op, no data
+
650  };
+
651 
+
652 
+
653 
+
654  struct program {
+
655  std::vector<var_decl> data_decl_;
+
656  std::pair<std::vector<var_decl>,std::vector<statement> >
+ +
658  std::vector<var_decl> parameter_decl_;
+
659  std::pair<std::vector<var_decl>,std::vector<statement> >
+ + +
662  std::pair<std::vector<var_decl>,std::vector<statement> > generated_decl_;
+
663  program();
+
664  program(const std::vector<var_decl>& data_decl,
+
665  const std::pair<std::vector<var_decl>,
+
666  std::vector<statement> >& derived_data_decl,
+
667  const std::vector<var_decl>& parameter_decl,
+
668  const std::pair<std::vector<var_decl>,
+
669  std::vector<statement> >& derived_decl,
+
670  const statement& st,
+
671  const std::pair<std::vector<var_decl>,
+
672  std::vector<statement> >& generated_decl);
+
673 
+
674 
+
675  };
+
676 
+
677  struct sample {
+ + + +
681  sample();
+ +
683  distribution& dist);
+
684  bool is_ill_formed() const;
+
685  };
+
686 
+
687  struct assignment {
+
688  variable_dims var_dims_; // lhs_var[dim0,...,dimN-1]
+
689  expression expr_; // = rhs
+
690  base_var_decl var_type_; // type of lhs_var
+
691  assignment();
+
692  assignment(variable_dims& var_dims,
+
693  expression& expr);
+
694  };
+
695 
+
696  // FIXME: is this next necessary dependency?
+
697  // from generator.hpp
+
698  void generate_expression(const expression& e, std::ostream& o);
+
699 
+
700  bool has_rng_suffix(const std::string& s);
+
701 
+
702 
+
703  struct contains_var : public boost::static_visitor<bool> {
+ +
705  contains_var(const variable_map& var_map);
+
706  bool operator()(const nil& e) const;
+
707  bool operator()(const int_literal& e) const;
+
708  bool operator()(const double_literal& e) const;
+
709  bool operator()(const array_literal& e) const;
+
710  bool operator()(const variable& e) const;
+
711  bool operator()(const fun& e) const;
+
712  bool operator()(const index_op& e) const;
+
713  bool operator()(const binary_op& e) const;
+
714  bool operator()(const unary_op& e) const;
+
715  };
+
716 
+
717  bool has_var(const expression& e,
+
718  const variable_map& var_map);
+
719 
+
720 
+
721  struct contains_nonparam_var : public boost::static_visitor<bool> {
+ +
723  contains_nonparam_var(const variable_map& var_map);
+
724  bool operator()(const nil& e) const;
+
725  bool operator()(const int_literal& e) const;
+
726  bool operator()(const double_literal& e) const;
+
727  bool operator()(const array_literal& e) const;
+
728  bool operator()(const variable& e) const;
+
729  bool operator()(const fun& e) const;
+
730  bool operator()(const index_op& e) const;
+
731  bool operator()(const binary_op& e) const;
+
732  bool operator()(const unary_op& e) const;
+
733  };
+
734 
+
735  bool has_non_param_var(const expression& e,
+
736  const variable_map& var_map);
+
737 
+
738 
+
739  }
+
740 }
+
741 
+
742 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/ast__def_8cpp.html b/doc/api/html/ast__def_8cpp.html new file mode 100644 index 00000000000..a974ec34b95 --- /dev/null +++ b/doc/api/html/ast__def_8cpp.html @@ -0,0 +1,183 @@ + + + + + +Stan: src/stan/gm/ast_def.cpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
ast_def.cpp File Reference
+
+
+
#include <boost/variant/apply_visitor.hpp>
+#include <boost/variant/recursive_variant.hpp>
+#include <cstddef>
+#include <limits>
+#include <climits>
+#include <iostream>
+#include <map>
+#include <stdexcept>
+#include <string>
+#include <utility>
+#include <vector>
+#include <stan/gm/ast.hpp>
+#include <stan/gm/function_signatures.h>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+ + + +

+Macros

#define __STAN__GM__AST_DEF_HPP__
 
+ + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

std::ostream & stan::gm::write_base_expr_type (std::ostream &o, base_expr_type type)
 
std::ostream & stan::gm::operator<< (std::ostream &o, const expr_type &et)
 
expr_type stan::gm::promote_primitive (const expr_type &et)
 
expr_type stan::gm::promote_primitive (const expr_type &et1, const expr_type &et2)
 
bool stan::gm::has_var (const expression &e, const variable_map &var_map)
 
bool stan::gm::has_non_param_var (const expression &e, const variable_map &var_map)
 
bool stan::gm::is_nil (const expression &e)
 
size_t stan::gm::total_dims (const std::vector< std::vector< expression > > &dimss)
 
expr_type stan::gm::infer_type_indexing (const base_expr_type &expr_base_type, size_t num_expr_dims, size_t num_index_dims)
 
expr_type stan::gm::infer_type_indexing (const expression &expr, size_t num_index_dims)
 
void stan::gm::print_var_origin (std::ostream &o, const var_origin &vo)
 
bool stan::gm::has_rng_suffix (const std::string &s)
 
+

Macro Definition Documentation

+ +
+
+ + + + +
#define __STAN__GM__AST_DEF_HPP__
+
+ +

Definition at line 2 of file ast_def.cpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/ast__def_8cpp_source.html b/doc/api/html/ast__def_8cpp_source.html new file mode 100644 index 00000000000..a6f63877f08 --- /dev/null +++ b/doc/api/html/ast__def_8cpp_source.html @@ -0,0 +1,1160 @@ + + + + + +Stan: src/stan/gm/ast_def.cpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
ast_def.cpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__AST_DEF_HPP__
+
2 #define __STAN__GM__AST_DEF_HPP__
+
3 
+
4 #include <boost/variant/apply_visitor.hpp>
+
5 #include <boost/variant/recursive_variant.hpp>
+
6 
+
7 #include <cstddef>
+
8 #include <limits>
+
9 #include <climits>
+
10 #include <iostream>
+
11 #include <map>
+
12 #include <stdexcept>
+
13 #include <string>
+
14 #include <utility>
+
15 #include <vector>
+
16 
+
17 #include <stan/gm/ast.hpp>
+
18 
+
19 namespace stan {
+
20 
+
21  namespace gm {
+
22 
+
23  std::ostream& write_base_expr_type(std::ostream& o, base_expr_type type) {
+
24  switch (type) {
+
25  case INT_T :
+
26  o << "int";
+
27  break;
+
28  case DOUBLE_T :
+
29  o << "real";
+
30  break;
+
31  case VECTOR_T :
+
32  o << "vector";
+
33  break;
+
34  case ROW_VECTOR_T :
+
35  o << "row vector";
+
36  break;
+
37  case MATRIX_T :
+
38  o << "matrix";
+
39  break;
+
40  case ILL_FORMED_T :
+
41  o << "ill formed";
+
42  break;
+
43  default:
+
44  o << "UNKNOWN";
+
45  }
+
46  return o;
+
47  }
+
48 
+
49  // expr_type ctors and methods
+ +
51  : base_type_(ILL_FORMED_T),
+
52  num_dims_(0) {
+
53  }
+ +
55  : base_type_(base_type),
+
56  num_dims_(0) {
+
57  }
+ +
59  size_t num_dims)
+
60  : base_type_(base_type),
+
61  num_dims_(num_dims) {
+
62  }
+
63  bool expr_type::operator==(const expr_type& et) const {
+
64  return base_type_ == et.base_type_
+
65  && num_dims_ == et.num_dims_;
+
66  }
+
67  bool expr_type::operator!=(const expr_type& et) const {
+
68  return !(*this == et);
+
69  }
+
70  bool expr_type::is_primitive() const {
+
71  return is_primitive_int()
+ +
73  }
+ +
75  return base_type_ == INT_T
+
76  && num_dims_ == 0U;
+
77  }
+ +
79  return base_type_ == DOUBLE_T
+
80  && num_dims_ == 0U;
+
81  }
+
82  bool expr_type::is_ill_formed() const {
+
83  return base_type_ == ILL_FORMED_T;
+
84  }
+ +
86  return base_type_;
+
87  }
+
88  size_t expr_type::num_dims() const {
+
89  return num_dims_;
+
90  }
+
91 
+
92  std::ostream& operator<<(std::ostream& o, const expr_type& et) {
+
93  write_base_expr_type(o,et.type());
+
94  if (et.num_dims() > 0)
+
95  o << '[' << et.num_dims() << ']';
+
96  return o;
+
97  }
+
98 
+ +
100  if (!et.is_primitive())
+
101  return expr_type();
+
102  return et;
+
103  }
+
104 
+ +
106  const expr_type& et2) {
+
107  if (!et1.is_primitive() || !et2.is_primitive())
+
108  return expr_type();
+
109  return et1.type() == DOUBLE_T ? et1 : et2;
+
110  }
+
111 
+ +
113  // FIXME: for threaded models, requires double-check lock
+
114  if (!sigs_)
+
115  sigs_ = new function_signatures;
+
116  return *sigs_;
+
117  }
+
118  void function_signatures::add(const std::string& name,
+
119  const expr_type& result_type,
+
120  const std::vector<expr_type>& arg_types) {
+
121  sigs_map_[name].push_back(function_signature_t(result_type,arg_types));
+
122 
+
123  }
+
124  void function_signatures::add(const std::string& name,
+
125  const expr_type& result_type) {
+
126  std::vector<expr_type> arg_types;
+
127  add(name,result_type,arg_types);
+
128  }
+
129  void function_signatures::add(const std::string& name,
+
130  const expr_type& result_type,
+
131  const expr_type& arg_type) {
+
132  std::vector<expr_type> arg_types;
+
133  arg_types.push_back(arg_type);
+
134  add(name,result_type,arg_types);
+
135  }
+
136  void function_signatures::add(const std::string& name,
+
137  const expr_type& result_type,
+
138  const expr_type& arg_type1,
+
139  const expr_type& arg_type2) {
+
140  std::vector<expr_type> arg_types;
+
141  arg_types.push_back(arg_type1);
+
142  arg_types.push_back(arg_type2);
+
143  add(name,result_type,arg_types);
+
144  }
+
145  void function_signatures::add(const std::string& name,
+
146  const expr_type& result_type,
+
147  const expr_type& arg_type1,
+
148  const expr_type& arg_type2,
+
149  const expr_type& arg_type3) {
+
150  std::vector<expr_type> arg_types;
+
151  arg_types.push_back(arg_type1);
+
152  arg_types.push_back(arg_type2);
+
153  arg_types.push_back(arg_type3);
+
154  add(name,result_type,arg_types);
+
155  }
+
156  void function_signatures::add(const std::string& name,
+
157  const expr_type& result_type,
+
158  const expr_type& arg_type1,
+
159  const expr_type& arg_type2,
+
160  const expr_type& arg_type3,
+
161  const expr_type& arg_type4) {
+
162  std::vector<expr_type> arg_types;
+
163  arg_types.push_back(arg_type1);
+
164  arg_types.push_back(arg_type2);
+
165  arg_types.push_back(arg_type3);
+
166  arg_types.push_back(arg_type4);
+
167  add(name,result_type,arg_types);
+
168  }
+
169  void function_signatures::add(const std::string& name,
+
170  const expr_type& result_type,
+
171  const expr_type& arg_type1,
+
172  const expr_type& arg_type2,
+
173  const expr_type& arg_type3,
+
174  const expr_type& arg_type4,
+
175  const expr_type& arg_type5) {
+
176  std::vector<expr_type> arg_types;
+
177  arg_types.push_back(arg_type1);
+
178  arg_types.push_back(arg_type2);
+
179  arg_types.push_back(arg_type3);
+
180  arg_types.push_back(arg_type4);
+
181  arg_types.push_back(arg_type5);
+
182  add(name,result_type,arg_types);
+
183  }
+
184  void function_signatures::add(const std::string& name,
+
185  const expr_type& result_type,
+
186  const expr_type& arg_type1,
+
187  const expr_type& arg_type2,
+
188  const expr_type& arg_type3,
+
189  const expr_type& arg_type4,
+
190  const expr_type& arg_type5,
+
191  const expr_type& arg_type6) {
+
192  std::vector<expr_type> arg_types;
+
193  arg_types.push_back(arg_type1);
+
194  arg_types.push_back(arg_type2);
+
195  arg_types.push_back(arg_type3);
+
196  arg_types.push_back(arg_type4);
+
197  arg_types.push_back(arg_type5);
+
198  arg_types.push_back(arg_type6);
+
199  add(name,result_type,arg_types);
+
200  }
+
201  void function_signatures::add(const std::string& name,
+
202  const expr_type& result_type,
+
203  const expr_type& arg_type1,
+
204  const expr_type& arg_type2,
+
205  const expr_type& arg_type3,
+
206  const expr_type& arg_type4,
+
207  const expr_type& arg_type5,
+
208  const expr_type& arg_type6,
+
209  const expr_type& arg_type7) {
+
210  std::vector<expr_type> arg_types;
+
211  arg_types.push_back(arg_type1);
+
212  arg_types.push_back(arg_type2);
+
213  arg_types.push_back(arg_type3);
+
214  arg_types.push_back(arg_type4);
+
215  arg_types.push_back(arg_type5);
+
216  arg_types.push_back(arg_type6);
+
217  arg_types.push_back(arg_type7);
+
218  add(name,result_type,arg_types);
+
219  }
+
220  void function_signatures::add_nullary(const::std::string& name) {
+
221  add(name,DOUBLE_T);
+
222  }
+
223  void function_signatures::add_unary(const::std::string& name) {
+
224  add(name,DOUBLE_T,DOUBLE_T);
+
225  }
+
226  void function_signatures::add_binary(const::std::string& name) {
+ +
228  }
+
229  void function_signatures::add_ternary(const::std::string& name) {
+ +
231  }
+
232  void function_signatures::add_quaternary(const::std::string& name) {
+ +
234  }
+ +
236  const std::vector<expr_type>& call_args,
+
237  const std::vector<expr_type>& sig_args) {
+
238  if (call_args.size() != sig_args.size()) {
+
239  return -1; // failure
+
240  }
+
241  int num_promotions = 0;
+
242  for (size_t i = 0; i < call_args.size(); ++i) {
+
243  if (call_args[i] == sig_args[i]) {
+
244  continue;
+
245  } else if (call_args[i].is_primitive_int()
+
246  && sig_args[i].is_primitive_double()) {
+
247  ++num_promotions;
+
248  } else {
+
249  return -1; // failed match
+
250  }
+
251  }
+
252  return num_promotions;
+
253  }
+ +
255  const std::string& name,
+
256  const std::vector<expr_type>& args,
+
257  std::ostream& error_msgs) {
+
258  std::vector<function_signature_t> signatures = sigs_map_[name];
+
259  size_t match_index = 0;
+
260  size_t min_promotions = std::numeric_limits<size_t>::max();
+
261  size_t num_matches = 0;
+
262 
+
263  for (size_t i = 0; i < signatures.size(); ++i) {
+
264  int promotions = num_promotions(args,signatures[i].second);
+
265  if (promotions < 0) continue; // no match
+
266  size_t promotions_ui = static_cast<size_t>(promotions);
+
267  if (promotions_ui < min_promotions) {
+
268  min_promotions = promotions_ui;
+
269  match_index = i;
+
270  num_matches = 1;
+
271  } else if (promotions_ui == min_promotions) {
+
272  ++num_matches;
+
273  }
+
274  }
+
275 
+
276  if (num_matches == 1) {
+
277  return signatures[match_index].first;
+
278  } else if (num_matches == 0) {
+
279  error_msgs << "no matches for function name=\"" << name << "\""
+
280  << std::endl;
+
281  } else {
+
282  error_msgs << num_matches << " matches with "
+
283  << min_promotions << " integer promotions "
+
284  << "for function name=\"" << name << "\"" << std::endl;
+
285  }
+
286  for (size_t i = 0; i < args.size(); ++i)
+
287  error_msgs << " arg " << i << " type=" << args[i] << std::endl;
+
288 
+
289  error_msgs << "available function signatures for "
+
290  << name << ":" << std::endl;
+
291  for (size_t i = 0; i < signatures.size(); ++i) {
+
292  error_msgs << i << ". " << name << "(";
+
293  for (size_t j = 0; j < signatures[i].second.size(); ++j) {
+
294  if (j > 0) error_msgs << ", ";
+
295  error_msgs << signatures[i].second[j];
+
296  }
+
297  error_msgs << ") : " << signatures[i].first << std::endl;
+
298  }
+
299  return expr_type(); // ill-formed dummy
+
300  }
+
301  function_signatures::function_signatures() {
+
302 #include <stan/gm/function_signatures.h>
+
303  }
+
304  std::set<std::string>
+ +
306  using std::map;
+
307  using std::set;
+
308  using std::string;
+
309  using std::vector;
+
310  // inefficient: if used intensively, should provide const iterator adaptor
+
311  set<string> result;
+
312  for (map<string,vector<function_signature_t> >::const_iterator it = sigs_map_.begin();
+
313  it != sigs_map_.end();
+
314  ++it)
+
315  result.insert(it->first);
+
316  return result;
+
317  }
+
318 
+
319  function_signatures* function_signatures::sigs_ = 0;
+
320 
+
321 
+
322 
+ +
324  statements::statements(const std::vector<var_decl>& local_decl,
+
325  const std::vector<statement>& stmts)
+
326  : local_decl_(local_decl),
+
327  statements_(stmts) {
+
328  }
+
329 
+ +
331  return expr_type();
+
332  }
+
333  // template <typename T>
+
334  // expr_type expression_type_vis::operator()(const T& e) const {
+
335  // return e.type_;
+
336  // }
+ +
338  return e.type_;
+
339  }
+ +
341  return e.type_;
+
342  }
+ +
344  return e.type_;
+
345  }
+ +
347  return e.type_;
+
348  }
+ +
350  return e.type_;
+
351  }
+ +
353  return e.type_;
+
354  }
+ +
356  return e.type_;
+
357  }
+ +
359  return e.type_;
+
360  }
+
361 
+ +
363  : expr_(nil()) {
+
364  }
+ +
366  : expr_(e.expr_) {
+
367  }
+ + +
370  return boost::apply_visitor(vis,expr_);
+
371  }
+
372  // template <typename Expr>
+
373  // expression::expression(const Expr& expr) : expr_(expr) { }
+
374 
+
375  expression::expression(const expression_t& expr) : expr_(expr) { }
+
376  expression::expression(const nil& expr) : expr_(expr) { }
+
377  expression::expression(const int_literal& expr) : expr_(expr) { }
+
378  expression::expression(const double_literal& expr) : expr_(expr) { }
+
379  expression::expression(const array_literal& expr) : expr_(expr) { }
+
380  expression::expression(const variable& expr) : expr_(expr) { }
+
381  expression::expression(const fun& expr) : expr_(expr) { }
+
382  expression::expression(const index_op& expr) : expr_(expr) { }
+
383  expression::expression(const binary_op& expr) : expr_(expr) { }
+
384  expression::expression(const unary_op& expr) : expr_(expr) { }
+
385 
+
386  printable::printable() : printable_("") { }
+
387  printable::printable(const expression& expr) : printable_(expr) { }
+
388  printable::printable(const std::string& msg) : printable_(msg) { }
+ +
390  : printable_(printable) { }
+ +
392  : printable_(printable.printable_) { }
+
393 
+ +
395  : var_map_(var_map) {
+
396  }
+
397  bool contains_var::operator()(const nil& e) const {
+
398  return false;
+
399  }
+ +
401  return false;
+
402  }
+ +
404  return false;
+
405  }
+ +
407  for (size_t i = 0; i < e.args_.size(); ++i)
+
408  if (boost::apply_visitor(*this,e.args_[i].expr_))
+
409  return true;
+
410  return false;
+
411  }
+
412  bool contains_var::operator()(const variable& e) const {
+ +
414  return ( vo == parameter_origin
+ +
416  || vo == local_origin );
+
417  }
+
418  bool contains_var::operator()(const fun& e) const {
+
419  for (size_t i = 0; i < e.args_.size(); ++i)
+
420  if (boost::apply_visitor(*this,e.args_[i].expr_))
+
421  return true;
+
422  return false;
+
423  }
+
424  bool contains_var::operator()(const index_op& e) const {
+
425  return boost::apply_visitor(*this,e.expr_.expr_);
+
426  }
+
427  bool contains_var::operator()(const binary_op& e) const {
+
428  return boost::apply_visitor(*this,e.left.expr_)
+
429  || boost::apply_visitor(*this,e.right.expr_);
+
430  }
+
431  bool contains_var::operator()(const unary_op& e) const {
+
432  return boost::apply_visitor(*this,e.subject.expr_);
+
433  }
+
434 
+
435  bool has_var(const expression& e,
+
436  const variable_map& var_map) {
+
437  contains_var vis(var_map);
+
438  return boost::apply_visitor(vis,e.expr_);
+
439  }
+
440 
+
441 
+ +
443  : var_map_(var_map) {
+
444  }
+ +
446  return false;
+
447  }
+ +
449  return false;
+
450  }
+ +
452  return false;
+
453  }
+ +
455  for (size_t i = 0; i < e.args_.size(); ++i)
+
456  if (boost::apply_visitor(*this,e.args_[i].expr_))
+
457  return true;
+
458  return false;
+
459  }
+ + +
462  return ( vo == transformed_parameter_origin
+
463  || vo == local_origin );
+
464  }
+ +
466  for (size_t i = 0; i < e.args_.size(); ++i)
+
467  if (boost::apply_visitor(*this,e.args_[i].expr_))
+
468  return true;
+
469  return false;
+
470  }
+ +
472  return boost::apply_visitor(*this,e.expr_.expr_);
+
473  }
+ +
475  return has_var(e,var_map_);
+
476  }
+ +
478  return has_var(e,var_map_);
+
479  }
+
480 
+ +
482  const variable_map& var_map) {
+
483  contains_nonparam_var vis(var_map);
+
484  return boost::apply_visitor(vis,e.expr_);
+
485  }
+
486 
+
487  bool is_nil_op::operator()(const nil& /*x*/) const { return true; }
+
488  bool is_nil_op::operator()(const int_literal& /*x*/) const { return false; }
+
489  bool is_nil_op::operator()(const double_literal& /* x */) const { return false; }
+
490  bool is_nil_op::operator()(const array_literal& /* x */) const { return false; }
+
491  bool is_nil_op::operator()(const variable& /* x */) const { return false; }
+
492  bool is_nil_op::operator()(const fun& /* x */) const { return false; }
+
493  bool is_nil_op::operator()(const index_op& /* x */) const { return false; }
+
494  bool is_nil_op::operator()(const binary_op& /* x */) const { return false; }
+
495  bool is_nil_op::operator()(const unary_op& /* x */) const { return false; }
+
496 
+
497  // template <typename T>
+
498  // bool is_nil_op::operator()(const T& /* x */) const { return false; }
+
499 
+
500  bool is_nil(const expression& e) {
+
501  is_nil_op ino;
+
502  return boost::apply_visitor(ino,e.expr_);
+
503  }
+
504 
+
505  variable_dims::variable_dims() { } // req for FUSION_ADAPT
+
506  variable_dims::variable_dims(std::string const& name,
+
507  std::vector<expression> const& dims)
+
508  : name_(name),
+
509  dims_(dims) {
+
510  }
+
511 
+
512 
+ +
514  : type_(INT_T) {
+
515  }
+ +
517  : val_(val),
+
518  type_(INT_T) {
+
519  }
+ +
521  : val_(il.val_),
+
522  type_(il.type_) {
+
523  }
+ +
525  val_ = il.val_;
+
526  type_ = il.type_;
+
527  return *this;
+
528  }
+
529 
+
530 
+ +
532  : type_(DOUBLE_T,0U) {
+
533  }
+ +
535  : val_(val),
+
536  type_(DOUBLE_T,0U) {
+
537  }
+ +
539  val_ = dl.val_;
+
540  type_ = dl.type_;
+
541  return *this;
+
542  }
+
543 
+
544 
+ +
546  : args_(),
+
547  type_(DOUBLE_T,1U) {
+
548  }
+
549  array_literal::array_literal(const std::vector<expression>& args)
+
550  : args_(args),
+
551  type_() { // ill-formed w/o help
+
552  }
+ +
554  args_ = al.args_;
+
555  type_ = al.type_;
+
556  return *this;
+
557  }
+
558 
+ +
560  variable::variable(std::string name) : name_(name) { }
+
561  void variable::set_type(const base_expr_type& base_type,
+
562  size_t num_dims) {
+
563  type_ = expr_type(base_type, num_dims);
+
564  }
+
565 
+
566 
+
567  fun::fun() { }
+
568  fun::fun(std::string const& name,
+
569  std::vector<expression> const& args)
+
570  : name_(name),
+
571  args_(args) {
+
572  infer_type();
+
573  }
+ +
575  // FIXME: remove this useless function and any calls to it
+
576  }
+
577 
+
578 
+
579  size_t total_dims(const std::vector<std::vector<expression> >& dimss) {
+
580  size_t total = 0U;
+
581  for (size_t i = 0; i < dimss.size(); ++i)
+
582  total += dimss[i].size();
+
583  return total;
+
584  }
+
585 
+
586 
+ +
588  size_t num_expr_dims,
+
589  size_t num_index_dims) {
+
590  if (num_index_dims <= num_expr_dims)
+
591  return expr_type(expr_base_type,num_expr_dims - num_index_dims);
+
592  if (num_index_dims == (num_expr_dims + 1)) {
+
593  if (expr_base_type == VECTOR_T || expr_base_type == ROW_VECTOR_T)
+
594  return expr_type(DOUBLE_T,0U);
+
595  if (expr_base_type == MATRIX_T)
+
596  return expr_type(ROW_VECTOR_T,0U);
+
597  }
+
598  if (num_index_dims == (num_expr_dims + 2))
+
599  if (expr_base_type == MATRIX_T)
+
600  return expr_type(DOUBLE_T,0U);
+
601 
+
602  // error condition, result expr_type has is_ill_formed() = true
+
603  return expr_type();
+
604  }
+
605 
+ +
607  size_t num_index_dims) {
+ +
609  expr.expression_type().num_dims(),
+
610  num_index_dims);
+
611  }
+
612 
+
613 
+ + +
616  const std::vector<std::vector<expression> >& dimss)
+
617  : expr_(expr),
+
618  dimss_(dimss) {
+
619  infer_type();
+
620  }
+ + +
623  }
+
624 
+ + +
627  const std::string& op,
+
628  const expression& right)
+
629  : op(op),
+
630  left(left),
+
631  right(right),
+
632  type_(promote_primitive(left.expression_type(),
+
633  right.expression_type())) {
+
634  }
+
635 
+
636 
+ +
638  expression const& subject)
+
639  : op(op),
+
640  subject(subject),
+
641  type_(promote_primitive(subject.expression_type())) {
+
642  }
+
643 
+
644 
+ + +
647  expression const& high)
+
648  : low_(low),
+
649  high_(high) {
+
650  }
+
651  bool range::has_low() const {
+
652  return !is_nil(low_.expr_);
+
653  }
+
654  bool range::has_high() const {
+
655  return !is_nil(high_.expr_);
+
656  }
+
657 
+
658  void print_var_origin(std::ostream& o, const var_origin& vo) {
+
659  if (vo == model_name_origin)
+
660  o << "model name";
+
661  else if (vo == data_origin)
+
662  o << "data";
+
663  else if (vo == transformed_data_origin)
+
664  o << "transformed data";
+
665  else if (vo == parameter_origin)
+
666  o << "parameter";
+
667  else if (vo == transformed_parameter_origin)
+
668  o << "transformed parameter";
+
669  else if (vo == derived_origin)
+
670  o << "generated quantities";
+
671  else if (vo == local_origin)
+
672  o << "local";
+
673  else
+
674  o << "UNKNOWN ORIGIN";
+
675  }
+
676 
+
677 
+ + +
680  : base_type_(base_type) {
+
681  }
+
682  base_var_decl::base_var_decl(const std::string& name,
+
683  const std::vector<expression>& dims,
+
684  const base_expr_type& base_type)
+
685  : name_(name),
+
686  dims_(dims),
+
687  base_type_(base_type) {
+
688  }
+
689 
+
690  bool variable_map::exists(const std::string& name) const {
+
691  return map_.find(name) != map_.end();
+
692  }
+
693  base_var_decl variable_map::get(const std::string& name) const {
+
694  if (!exists(name))
+
695  throw std::invalid_argument("variable does not exist");
+
696  return map_.find(name)->second.first;
+
697  }
+
698  base_expr_type variable_map::get_base_type(const std::string& name) const {
+
699  return get(name).base_type_;
+
700  }
+
701  size_t variable_map::get_num_dims(const std::string& name) const {
+
702  return get(name).dims_.size();
+
703  }
+
704  var_origin variable_map::get_origin(const std::string& name) const {
+
705  if (!exists(name))
+
706  throw std::invalid_argument("variable does not exist");
+
707  return map_.find(name)->second.second;
+
708  }
+
709  void variable_map::add(const std::string& name,
+
710  const base_var_decl& base_decl,
+
711  const var_origin& vo) {
+
712  map_[name] = range_t(base_decl,vo);
+
713  }
+
714  void variable_map::remove(const std::string& name) {
+
715  map_.erase(name);
+
716  }
+
717 
+ +
719  : base_var_decl(INT_T)
+
720  { }
+
721 
+ +
723  std::string const& name,
+
724  std::vector<expression> const& dims)
+
725  : base_var_decl(name,dims,INT_T),
+
726  range_(range)
+
727  { }
+
728 
+
729 
+
730 
+ + +
733  { }
+
734 
+ +
736  std::string const& name,
+
737  std::vector<expression> const& dims)
+
738  : base_var_decl(name,dims,DOUBLE_T),
+
739  range_(range)
+
740  { }
+
741 
+ + +
744  { }
+
745 
+ +
747  std::string const& name,
+
748  std::vector<expression> const& dims)
+
749  : base_var_decl(name,dims,VECTOR_T),
+
750  K_(K)
+
751  { }
+
752 
+ + +
755  { }
+
756 
+ +
758  std::string const& name,
+
759  std::vector<expression> const& dims)
+
760  : base_var_decl(name,dims,VECTOR_T),
+
761  K_(K)
+
762  { }
+
763 
+ + +
766  { }
+
767 
+ +
769  std::string const& name,
+
770  std::vector<expression> const& dims)
+
771  : base_var_decl(name,dims,VECTOR_T),
+
772  K_(K) {
+
773  }
+
774 
+ + +
777  { }
+
778 
+ +
780  std::string const& name,
+
781  std::vector<expression> const& dims)
+
782  : base_var_decl(name,dims,VECTOR_T),
+
783  K_(K) {
+
784  }
+
785 
+ +
787 
+ +
789  expression const& M,
+
790  std::string const& name,
+
791  std::vector<expression> const& dims)
+
792  : base_var_decl(name,dims,VECTOR_T),
+
793  range_(range),
+
794  M_(M) {
+
795  }
+
796 
+ + +
799  expression const& N,
+
800  std::string const& name,
+
801  std::vector<expression> const& dims)
+
802  : base_var_decl(name,dims,ROW_VECTOR_T),
+
803  range_(range),
+
804  N_(N) {
+
805  }
+
806 
+ + +
809  expression const& M,
+
810  expression const& N,
+
811  std::string const& name,
+
812  std::vector<expression> const& dims)
+
813  : base_var_decl(name,dims,MATRIX_T),
+
814  range_(range),
+
815  M_(M),
+
816  N_(N) {
+
817  }
+
818 
+
819 
+ +
821  : base_var_decl(MATRIX_T) {
+
822  }
+ +
824  expression const& N,
+
825  std::string const& name,
+
826  std::vector<expression> const& dims)
+
827  : base_var_decl(name,dims,MATRIX_T),
+
828  M_(M),
+
829  N_(N) {
+
830  }
+
831 
+ +
833  }
+ +
835  std::string const& name,
+
836  std::vector<expression> const& dims)
+
837  : base_var_decl(name,dims,MATRIX_T),
+
838  K_(K) {
+
839  }
+
840 
+ + +
843  std::string const& name,
+
844  std::vector<expression> const& dims)
+
845  : base_var_decl(name,dims,MATRIX_T),
+
846  K_(K) {
+
847  }
+
848 
+
849 
+
850 
+
851 
+ +
853  std::string name_vis::operator()(const nil& /* x */) const {
+
854  return ""; // fail if arises
+
855  }
+
856  std::string name_vis::operator()(const int_var_decl& x) const {
+
857  return x.name_;
+
858  }
+
859  std::string name_vis::operator()(const double_var_decl& x) const {
+
860  return x.name_;
+
861  }
+
862  std::string name_vis::operator()(const vector_var_decl& x) const {
+
863  return x.name_;
+
864  }
+
865  std::string name_vis::operator()(const row_vector_var_decl& x) const {
+
866  return x.name_;
+
867  }
+
868  std::string name_vis::operator()(const matrix_var_decl& x) const {
+
869  return x.name_;
+
870  }
+
871  std::string name_vis::operator()(const unit_vector_var_decl& x) const {
+
872  return x.name_;
+
873  }
+
874  std::string name_vis::operator()(const simplex_var_decl& x) const {
+
875  return x.name_;
+
876  }
+
877  std::string name_vis::operator()(const ordered_var_decl& x) const {
+
878  return x.name_;
+
879  }
+
880  std::string name_vis::operator()(const positive_ordered_var_decl& x) const {
+
881  return x.name_;
+
882  }
+
883  std::string name_vis::operator()(const cholesky_factor_var_decl& x) const {
+
884  return x.name_;
+
885  }
+
886  std::string name_vis::operator()(const cov_matrix_var_decl& x) const {
+
887  return x.name_;
+
888  }
+
889  std::string name_vis::operator()(const corr_matrix_var_decl& x) const {
+
890  return x.name_;
+
891  }
+
892 
+
893 
+
894  // can't template out in .cpp file
+
895 
+
896  var_decl::var_decl(const var_decl_t& decl) : decl_(decl) { }
+
897  var_decl::var_decl() : decl_(nil()) { }
+
898  var_decl::var_decl(const nil& decl) : decl_(decl) { }
+
899  var_decl::var_decl(const int_var_decl& decl) : decl_(decl) { }
+
900  var_decl::var_decl(const double_var_decl& decl) : decl_(decl) { }
+
901  var_decl::var_decl(const vector_var_decl& decl) : decl_(decl) { }
+
902  var_decl::var_decl(const row_vector_var_decl& decl) : decl_(decl) { }
+
903  var_decl::var_decl(const matrix_var_decl& decl) : decl_(decl) { }
+
904  var_decl::var_decl(const unit_vector_var_decl& decl) : decl_(decl) { }
+
905  var_decl::var_decl(const simplex_var_decl& decl) : decl_(decl) { }
+
906  var_decl::var_decl(const ordered_var_decl& decl) : decl_(decl) { }
+
907  var_decl::var_decl(const positive_ordered_var_decl& decl) : decl_(decl) { }
+
908  var_decl::var_decl(const cholesky_factor_var_decl& decl) : decl_(decl) { }
+
909  var_decl::var_decl(const cov_matrix_var_decl& decl) : decl_(decl) { }
+
910  var_decl::var_decl(const corr_matrix_var_decl& decl) : decl_(decl) { }
+
911 
+
912  std::string var_decl::name() const {
+
913  return boost::apply_visitor(name_vis(),decl_);
+
914  }
+
915 
+
916  statement::statement() : statement_(nil()) { }
+
917 
+
918  statement::statement(const statement_t& st) : statement_(st) { }
+
919  statement::statement(const nil& st) : statement_(st) { }
+
920  statement::statement(const assignment& st) : statement_(st) { }
+
921  statement::statement(const sample& st) : statement_(st) { }
+
922  statement::statement(const increment_log_prob_statement& st) : statement_(st) { }
+
923  statement::statement(const statements& st) : statement_(st) { }
+
924  statement::statement(const expression& st) : statement_(st) { }
+
925  statement::statement(const for_statement& st) : statement_(st) { }
+
926  statement::statement(const while_statement& st) : statement_(st) { }
+
927  statement::statement(const conditional_statement& st) : statement_(st) { }
+
928  statement::statement(const print_statement& st) : statement_(st) { }
+
929  statement::statement(const no_op_statement& st) : statement_(st) { }
+
930 
+
931  // template <typename Statement>
+
932  // statement::statement(const Statement& statement)
+
933  // : statement_(statement) {
+
934  // }
+
935 
+
936 
+ +
938  }
+ +
940  : log_prob_(log_prob) {
+
941  }
+
942 
+ +
944  }
+ +
946  range& range,
+
947  statement& stmt)
+
948  : variable_(variable),
+
949  range_(range),
+
950  statement_(stmt) {
+
951  }
+
952 
+ +
954  }
+ +
956  const statement& body)
+
957  : condition_(condition),
+
958  body_(body) {
+
959  }
+
960 
+ +
962  }
+ +
964  ::conditional_statement(const std::vector<expression>& conditions,
+
965  const std::vector<statement>& bodies)
+
966  : conditions_(conditions),
+
967  bodies_(bodies) {
+
968  }
+
969 
+ +
971 
+
972  print_statement::print_statement(const std::vector<printable>& printables)
+
973  : printables_(printables) {
+
974  }
+
975 
+ +
977  program::program(const std::vector<var_decl>& data_decl,
+
978  const std::pair<std::vector<var_decl>,
+
979  std::vector<statement> >& derived_data_decl,
+
980  const std::vector<var_decl>& parameter_decl,
+
981  const std::pair<std::vector<var_decl>,
+
982  std::vector<statement> >& derived_decl,
+
983  const statement& st,
+
984  const std::pair<std::vector<var_decl>,
+
985  std::vector<statement> >& generated_decl)
+
986  : data_decl_(data_decl),
+
987  derived_data_decl_(derived_data_decl),
+
988  parameter_decl_(parameter_decl),
+
989  derived_decl_(derived_decl),
+
990  statement_(st),
+
991  generated_decl_(generated_decl) {
+
992  }
+
993 
+ +
995  }
+ +
997  distribution& dist)
+
998  : expr_(e),
+
999  dist_(dist) {
+
1000  }
+
1001  bool sample::is_ill_formed() const {
+ +
1003  || ( truncation_.has_low()
+
1004  && expr_.expression_type()
+ +
1006  || ( truncation_.has_high()
+
1007  && expr_.expression_type()
+ +
1009  }
+
1010 
+ +
1012  }
+ +
1014  expression& expr)
+
1015  : var_dims_(var_dims),
+
1016  expr_(expr) {
+
1017  }
+
1018 
+ +
1020  expr_ = binary_op(expr_, "+", rhs);
+
1021  return *this;
+
1022  }
+
1023 
+ +
1025  expr_ = binary_op(expr_, "-", rhs);
+
1026  return *this;
+
1027  }
+
1028 
+ +
1030  expr_ = binary_op(expr_, "*", rhs);
+
1031  return *this;
+
1032  }
+
1033 
+ +
1035  expr_ = binary_op(expr_, "/", rhs);
+
1036  return *this;
+
1037  }
+
1038 
+
1039  bool has_rng_suffix(const std::string& s) {
+
1040  int n = s.size();
+
1041  return n > 4
+
1042  && s[n-1] == 'g'
+
1043  && s[n-2] == 'n'
+
1044  && s[n-3] == 'r'
+
1045  && s[n-4] == '_';
+
1046  }
+
1047 
+
1048 
+
1049  }
+
1050 }
+
1051 
+
1052 
+
1053 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/autocorrelation_8hpp.html b/doc/api/html/autocorrelation_8hpp.html new file mode 100644 index 00000000000..9c01c2049ca --- /dev/null +++ b/doc/api/html/autocorrelation_8hpp.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/prob/autocorrelation.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
autocorrelation.hpp File Reference
+
+
+
#include <stan/math/matrix.hpp>
+#include <stan/math/matrix/mean.hpp>
+#include <vector>
+#include <complex>
+#include <unsupported/Eigen/FFT>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + +

+Functions

template<typename T >
void stan::prob::autocorrelation (const std::vector< T > &y, std::vector< T > &ac, Eigen::FFT< T > &fft)
 Write autocorrelation estimates for every lag for the specified input sequence into the specified result using the specified FFT engine.
 
template<typename T >
void stan::prob::autocorrelation (const std::vector< T > &y, std::vector< T > &ac)
 Write autocorrelation estimates for every lag for the specified input sequence into the specified result.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/autocorrelation_8hpp_source.html b/doc/api/html/autocorrelation_8hpp_source.html new file mode 100644 index 00000000000..a168edd1693 --- /dev/null +++ b/doc/api/html/autocorrelation_8hpp_source.html @@ -0,0 +1,203 @@ + + + + + +Stan: src/stan/prob/autocorrelation.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
autocorrelation.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__AUTOCORRELATION_HPP__
+
2 #define __STAN__PROB__AUTOCORRELATION_HPP__
+
3 
+
4 #include <stan/math/matrix.hpp>
+ +
6 
+
7 #include <vector>
+
8 #include <complex>
+
9 #include <unsupported/Eigen/FFT>
+
10 
+
11 
+
12 namespace stan {
+
13 
+
14  namespace prob {
+
15 
+
16  namespace {
+
21  size_t fft_next_good_size(size_t N) {
+
22  if (N <= 2) return 2;
+
23  while (true) {
+
24  size_t m = N;
+
25  while((m % 2) == 0) m /= 2;
+
26  while((m % 3) == 0) m /= 3;
+
27  while((m % 5) == 0) m /= 5;
+
28  if (m <= 1)
+
29  return N;
+
30  N++;
+
31  }
+
32  }
+
33  }
+
34 
+
55  template <typename T>
+
56  void autocorrelation(const std::vector<T>& y,
+
57  std::vector<T>& ac,
+
58  Eigen::FFT<T>& fft) {
+
59 
+
60  using std::vector;
+
61  using std::complex;
+
62 
+
63  size_t N = y.size();
+
64  size_t M = fft_next_good_size(N);
+
65  size_t Mt2 = 2 * M;
+
66 
+
67 
+
68  vector<complex<T> > freqvec;
+
69 
+
70  // centered_signal = y-mean(y) followed by N zeroes
+
71  vector<T> centered_signal(y);
+
72  centered_signal.insert(centered_signal.end(),Mt2-N,0.0);
+
73  T mean = stan::math::mean(y);
+
74  for (size_t i = 0; i < N; i++)
+
75  centered_signal[i] -= mean;
+
76 
+
77  fft.fwd(freqvec,centered_signal);
+
78  for (size_t i = 0; i < Mt2; ++i)
+
79  freqvec[i] = complex<T>(norm(freqvec[i]), 0.0);
+
80 
+
81  fft.inv(ac,freqvec);
+
82  ac.resize(N);
+
83 
+
84  /*
+
85  vector<T> mask_correction_factors;
+
86  vector<T> mask;
+
87  mask.insert(mask.end(),N,1.0);
+
88  mask.insert(mask.end(),N,0.0);
+
89 
+
90  freqvec.resize(0);
+
91  fft.fwd(freqvec,mask);
+
92  for (size_t i = 0; i < Nt2; ++i)
+
93  freqvec[i] = complex<T>(norm(freqvec[i]), 0.0);
+
94 
+
95  fft.inv(mask_correction_factors, freqvec);
+
96 
+
97  for (size_t i = 0; i < N; ++i) {
+
98  ac[i] /= mask_correction_factors[i];
+
99  }
+
100  */
+
101  for (size_t i = 0; i < N; ++i) {
+
102  ac[i] /= (N - i);
+
103  }
+
104  T var = ac[0];
+
105  for (size_t i = 0; i < N; ++i)
+
106  ac[i] /= var;
+
107  }
+
108 
+
125  template <typename T>
+
126  void autocorrelation(const std::vector<T>& y,
+
127  std::vector<T>& ac) {
+
128  Eigen::FFT<T> fft;
+
129  return autocorrelation(y,ac,fft);
+
130  }
+
131 
+
132 
+
133  }
+
134 }
+
135 
+
136 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/autocovariance_8hpp.html b/doc/api/html/autocovariance_8hpp.html new file mode 100644 index 00000000000..be76c03821f --- /dev/null +++ b/doc/api/html/autocovariance_8hpp.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/prob/autocovariance.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
autocovariance.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + +

+Functions

template<typename T >
void stan::prob::autocovariance (const std::vector< T > &y, std::vector< T > &acov, Eigen::FFT< T > &fft)
 Write autocovariance estimates for every lag for the specified input sequence into the specified result using the specified FFT engine.
 
template<typename T >
void stan::prob::autocovariance (const std::vector< T > &y, std::vector< T > &acov)
 Write autocovariance estimates for every lag for the specified input sequence into the specified result.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/autocovariance_8hpp_source.html b/doc/api/html/autocovariance_8hpp_source.html new file mode 100644 index 00000000000..6e279ee8546 --- /dev/null +++ b/doc/api/html/autocovariance_8hpp_source.html @@ -0,0 +1,143 @@ + + + + + +Stan: src/stan/prob/autocovariance.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
autocovariance.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__AUTOCOVARIANCE_HPP__
+
2 #define __STAN__PROB__AUTOCOVARIANCE_HPP__
+
3 
+ + +
6 
+
7 namespace stan {
+
8 
+
9  namespace prob {
+
10 
+
11 
+
32  template <typename T>
+
33  void autocovariance(const std::vector<T>& y,
+
34  std::vector<T>& acov,
+
35  Eigen::FFT<T>& fft) {
+
36 
+
37  stan::prob::autocorrelation(y, acov, fft);
+
38 
+
39  T var = stan::math::variance(y) * (y.size()-1) / y.size();
+
40  for (size_t i = 0; i < y.size(); i++) {
+
41  acov[i] *= var;
+
42  }
+
43  }
+
44 
+
61  template <typename T>
+
62  void autocovariance(const std::vector<T>& y,
+
63  std::vector<T>& acov) {
+
64  Eigen::FFT<T> fft;
+
65  autocovariance(y,acov,fft);
+
66  }
+
67 
+
68 
+
69  }
+
70 }
+
71 
+
72 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/autodiff_8hpp.html b/doc/api/html/autodiff_8hpp.html new file mode 100644 index 00000000000..36c79275614 --- /dev/null +++ b/doc/api/html/autodiff_8hpp.html @@ -0,0 +1,165 @@ + + + + + +Stan: src/stan/agrad/autodiff.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
autodiff.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

template<typename T , typename F >
void stan::agrad::derivative (const F &f, const T &x, T &fx, T &dfx_dx)
 
template<typename T , typename F >
void stan::agrad::partial_derivative (const F &f, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, int n, T &fx, T &dfx_dxn)
 
template<typename F >
void stan::agrad::gradient (const F &f, const Eigen::Matrix< double, Eigen::Dynamic, 1 > &x, double &fx, Eigen::Matrix< double, Eigen::Dynamic, 1 > &grad_fx)
 Calculate the value and the gradient of the specified function at the specified argument.
 
template<typename T , typename F >
void stan::agrad::gradient (const F &f, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, T &fx, Eigen::Matrix< T, Eigen::Dynamic, 1 > &grad_fx)
 
template<typename F >
void stan::agrad::jacobian (const F &f, const Eigen::Matrix< double, Eigen::Dynamic, 1 > &x, Eigen::Matrix< double, Eigen::Dynamic, 1 > &fx, Eigen::Matrix< double, Eigen::Dynamic, Eigen::Dynamic > &J)
 
template<typename T , typename F >
void stan::agrad::jacobian (const F &f, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, Eigen::Matrix< T, Eigen::Dynamic, 1 > &fx, Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &J)
 
template<typename F >
void stan::agrad::hessian (const F &f, const Eigen::Matrix< double, Eigen::Dynamic, 1 > &x, double &fx, Eigen::Matrix< double, Eigen::Dynamic, 1 > &grad, Eigen::Matrix< double, Eigen::Dynamic, Eigen::Dynamic > &H)
 
template<typename T , typename F >
void stan::agrad::hessian (const F &f, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, T &fx, Eigen::Matrix< T, Eigen::Dynamic, 1 > &grad, Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &H)
 
template<typename T1 , typename T2 , typename F >
void stan::agrad::gradient_dot_vector (const F &f, const Eigen::Matrix< T1, Eigen::Dynamic, 1 > &x, const Eigen::Matrix< T2, Eigen::Dynamic, 1 > &v, T1 &fx, T1 &grad_fx_dot_v)
 
template<typename F >
void stan::agrad::hessian_times_vector (const F &f, const Eigen::Matrix< double, Eigen::Dynamic, 1 > &x, const Eigen::Matrix< double, Eigen::Dynamic, 1 > &v, double &fx, Eigen::Matrix< double, Eigen::Dynamic, 1 > &Hv)
 
template<typename T , typename F >
void stan::agrad::hessian_times_vector (const F &f, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v, T &fx, Eigen::Matrix< T, Eigen::Dynamic, 1 > &Hv)
 
template<typename F >
void stan::agrad::grad_tr_mat_times_hessian (const F &f, const Eigen::Matrix< double, Eigen::Dynamic, 1 > &x, const Eigen::Matrix< double, Eigen::Dynamic, Eigen::Dynamic > &M, Eigen::Matrix< double, Eigen::Dynamic, 1 > &grad_tr_MH)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/autodiff_8hpp_source.html b/doc/api/html/autodiff_8hpp_source.html new file mode 100644 index 00000000000..531c51d9b48 --- /dev/null +++ b/doc/api/html/autodiff_8hpp_source.html @@ -0,0 +1,389 @@ + + + + + +Stan: src/stan/agrad/autodiff.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
autodiff.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__AUTO_DIFF_HPP__
+
2 #define __STAN__AGRAD__AUTO_DIFF_HPP__
+
3 
+ +
5 #include <stan/agrad/rev.hpp>
+
6 #include <stan/agrad/fwd.hpp>
+
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12 
+
13  template <typename T, typename F>
+
14  void
+
15  derivative(const F& f,
+
16  const T& x,
+
17  T& fx,
+
18  T& dfx_dx) {
+
19  fvar<T> x_fvar = fvar<T>(x,1.0);
+
20  fvar<T> fx_fvar = f(x_fvar);
+
21  fx = fx_fvar.val_;
+
22  dfx_dx = fx_fvar.d_;
+
23  }
+
24 
+
25  template <typename T, typename F>
+
26  void
+
27  partial_derivative(const F& f,
+
28  const Eigen::Matrix<T,Eigen::Dynamic,1>& x,
+
29  int n,
+
30  T& fx,
+
31  T& dfx_dxn) {
+
32  Eigen::Matrix<fvar<T>,Eigen::Dynamic,1> x_fvar(x.size());
+
33  for (int i = 0; i < x.size(); ++i)
+
34  x_fvar(i) = fvar<T>(x(i),i==n);
+
35  fvar<T> fx_fvar = f(x_fvar);
+
36  fx = fx_fvar.val_;
+
37  dfx_dxn = fx_fvar.d_;
+
38  }
+
39 
+
69  template <typename F>
+
70  void
+
71  gradient(const F& f,
+
72  const Eigen::Matrix<double,Eigen::Dynamic,1>& x,
+
73  double& fx,
+
74  Eigen::Matrix<double,Eigen::Dynamic,1>& grad_fx) {
+
75  using stan::agrad::var;
+
76  Eigen::Matrix<var,Eigen::Dynamic,1> x_var(x.size());
+
77  for (int i = 0; i < x.size(); ++i)
+
78  x_var(i) = x(i);
+
79  var fx_var = f(x_var);
+
80  fx = fx_var.val();
+
81 
+
82  grad_fx.resize(x.size());
+
83  stan::agrad::grad(fx_var.vi_);
+
84  for (int i = 0; i < x.size(); ++i)
+
85  grad_fx(i) = x_var(i).adj();
+ +
87  }
+
88  template <typename T, typename F>
+
89  void
+
90  gradient(const F& f,
+
91  const Eigen::Matrix<T,Eigen::Dynamic,1>& x,
+
92  T& fx,
+
93  Eigen::Matrix<T,Eigen::Dynamic,1>& grad_fx) {
+
94  Eigen::Matrix<fvar<T>,Eigen::Dynamic,1> x_fvar(x.size());
+
95  grad_fx.resize(x.size());
+
96  for (int i = 0; i < x.size(); ++i) {
+
97  for (int k = 0; k < x.size(); ++k)
+
98  x_fvar(k) = fvar<T>(x(k),k==i);
+
99  fvar<T> fx_fvar = f(x_fvar);
+
100  if (i == 0) fx = fx_fvar.val_;
+
101  grad_fx(i) = fx_fvar.d_;
+
102  }
+
103  }
+
104 
+
105 
+
106  template <typename F>
+
107  void
+
108  jacobian(const F& f,
+
109  const Eigen::Matrix<double,Eigen::Dynamic,1>& x,
+
110  Eigen::Matrix<double,Eigen::Dynamic,1>& fx,
+
111  Eigen::Matrix<double,Eigen::Dynamic,Eigen::Dynamic>& J) {
+
112  using Eigen::Matrix; using Eigen::Dynamic;
+
113  using stan::agrad::var;
+
114  Matrix<var,Dynamic,1> x_var(x.size());
+
115  for (int k = 0; k < x.size(); ++k)
+
116  x_var(k) = x(k);
+
117  Matrix<var,Dynamic,1> fx_var = f(x_var);
+
118  fx.resize(fx_var.size());
+
119  for (int i = 0; i < fx_var.size(); ++i)
+
120  fx(i) = fx_var(i).val();
+
121  J.resize(x.size(), fx_var.size());
+
122  for (int i = 0; i < fx_var.size(); ++i) {
+
123  if (i > 0)
+ +
125  grad(fx_var(i).vi_);
+
126  for (int k = 0; k < x.size(); ++k)
+
127  J(k,i) = x_var(k).adj();
+
128  }
+
129  }
+
130  template <typename T, typename F>
+
131  void
+
132  jacobian(const F& f,
+
133  const Eigen::Matrix<T,Eigen::Dynamic,1>& x,
+
134  Eigen::Matrix<T,Eigen::Dynamic,1>& fx,
+
135  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& J) {
+
136  using Eigen::Matrix; using Eigen::Dynamic;
+
137  using stan::agrad::fvar;
+
138  Matrix<fvar<T>,Dynamic,1> x_fvar(x.size());
+
139  for (int i = 0; i < x.size(); ++i) {
+
140  for (int k = 0; k < x.size(); ++k)
+
141  x_fvar(k) = fvar<T>(x(k), i == k);
+
142  Matrix<fvar<T>,Dynamic,1> fx_fvar = f(x_fvar);
+
143  if (i == 0) {
+
144  J.resize(x.size(),fx_fvar.size());
+
145  fx.resize(fx_fvar.size());
+
146  for (int k = 0; k < fx_fvar.size(); ++k)
+
147  fx(k) = fx_fvar(k).val_;
+
148  }
+
149  for (int k = 0; k < fx_fvar.size(); ++k) {
+
150  J(i,k) = fx_fvar(k).d_;
+
151  }
+
152  }
+
153  }
+
154 
+
155 
+
156  // time O(N^2); space O(N^2)
+
157  template <typename F>
+
158  void
+
159  hessian(const F& f,
+
160  const Eigen::Matrix<double,Eigen::Dynamic,1>& x,
+
161  double& fx,
+
162  Eigen::Matrix<double,Eigen::Dynamic,1>& grad,
+
163  Eigen::Matrix<double,Eigen::Dynamic,Eigen::Dynamic>& H) {
+
164  H.resize(x.size(), x.size());
+
165  grad.resize(x.size());
+
166  for (int i = 0; i < x.size(); ++i) {
+
167  Eigen::Matrix<fvar<var>, Eigen::Dynamic, 1> x_fvar(x.size());
+
168  for (int j = 0; j < x.size(); ++j)
+
169  x_fvar(j) = fvar<var>(x(j),i==j);
+
170  fvar<var> fx_fvar = f(x_fvar);
+
171  grad(i) = fx_fvar.d_.val();
+
172  if (i == 0) fx = fx_fvar.val_.val();
+
173  stan::agrad::grad(fx_fvar.d_.vi_);
+
174  for (int j = 0; j < x.size(); ++j)
+
175  H(i,j) = x_fvar(j).val_.adj();
+
176  }
+
177  }
+
178  // time O(N^3); space O(N^2)
+
179  template <typename T, typename F>
+
180  void
+
181  hessian(const F& f,
+
182  const Eigen::Matrix<T,Eigen::Dynamic,1>& x,
+
183  T& fx,
+
184  Eigen::Matrix<T,Eigen::Dynamic,1>& grad,
+
185  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& H) {
+
186  H.resize(x.size(), x.size());
+
187  grad.resize(x.size());
+
188  Eigen::Matrix<fvar<fvar<T> >,Eigen::Dynamic,1> x_fvar(x.size());
+
189  for (int i = 0; i < x.size(); ++i) {
+
190  for (int j = i; j < x.size(); ++j) {
+
191  for (int k = 0; k < x.size(); ++k)
+
192  x_fvar(k) = fvar<fvar<T> >(fvar<T>(x(k),j==k),
+
193  fvar<T>(i==k,0));
+
194  fvar<fvar<T> > fx_fvar = f(x_fvar);
+
195  if (j == 0)
+
196  fx = fx_fvar.val_.val_;
+
197  if (i == j)
+
198  grad(i) = fx_fvar.d_.val_;
+
199  H(i,j) = fx_fvar.d_.d_;
+
200  H(j,i) = H(i,j);
+
201  }
+
202  }
+
203  }
+
204 
+
205 
+
206  // aka directional derivative (not length normalized)
+
207  // T2 must be assignable to T1
+
208  template <typename T1, typename T2, typename F>
+
209  void
+ +
211  const Eigen::Matrix<T1,Eigen::Dynamic,1>& x,
+
212  const Eigen::Matrix<T2,Eigen::Dynamic,1>& v,
+
213  T1& fx,
+
214  T1& grad_fx_dot_v) {
+
215  using stan::agrad::fvar;
+
216  using stan::agrad::var;
+
217  using Eigen::Matrix;
+
218  using Eigen::Dynamic;
+
219  Matrix<fvar<T1>,Dynamic,1> x_fvar(x.size());
+
220  for (int i = 0; i < x.size(); ++i)
+
221  x_fvar(i) = fvar<T1>(x(i),v(i));
+
222  fvar<T1> fx_fvar = f(x_fvar);
+
223  fx = fx_fvar.val_;
+
224  grad_fx_dot_v = fx_fvar.d_;
+
225  }
+
226 
+
227 
+
228 
+
229 
+
230  template <typename F>
+
231  void
+ +
233  const Eigen::Matrix<double,Eigen::Dynamic,1>& x,
+
234  const Eigen::Matrix<double,Eigen::Dynamic,1>& v,
+
235  double& fx,
+
236  Eigen::Matrix<double,Eigen::Dynamic,1>& Hv) {
+
237  using stan::agrad::fvar;
+
238  using stan::agrad::var;
+
239  using Eigen::Matrix; using Eigen::Dynamic;
+
240  Matrix<var,Dynamic,1> x_var(x.size());
+
241  for (int i = 0; i < x_var.size(); ++i)
+
242  x_var(i) = x(i);
+
243  var fx_var;
+
244  var grad_fx_var_dot_v;
+
245  gradient_dot_vector(f,x_var,v,fx_var,grad_fx_var_dot_v);
+
246  fx = fx_var.val();
+
247  stan::agrad::grad(grad_fx_var_dot_v.vi_);
+
248  Hv.resize(x.size());
+
249  for (int i = 0; i < x.size(); ++i)
+
250  Hv(i) = x_var(i).adj();
+ +
252  }
+
253  template <typename T, typename F>
+
254  void
+ +
256  const Eigen::Matrix<T,Eigen::Dynamic,1>& x,
+
257  const Eigen::Matrix<T,Eigen::Dynamic,1>& v,
+
258  T& fx,
+
259  Eigen::Matrix<T,Eigen::Dynamic,1>& Hv) {
+
260  using Eigen::Matrix;
+
261  using Eigen::Dynamic;
+
262  Matrix<T,Dynamic,1> grad;
+
263  Matrix<T,Dynamic,Dynamic> H;
+
264  hessian(f,x,fx,grad,H);
+
265  Hv = H * v;
+
266  }
+
267 
+
268  // FIXME: add other results that are easy to extract
+
269  // // N * (fwd(2) + bk)
+
270  template <typename F>
+
271  void
+ +
273  const F& f,
+
274  const Eigen::Matrix<double,Eigen::Dynamic,1>& x,
+
275  const Eigen::Matrix<double,Eigen::Dynamic,Eigen::Dynamic>& M,
+
276  Eigen::Matrix<double,Eigen::Dynamic,1>& grad_tr_MH) {
+
277  using Eigen::Matrix;
+
278  using Eigen::Dynamic;
+
279 
+
280  grad_tr_MH.resize(x.size());
+
281 
+
282  Matrix<var,Dynamic,1> x_var(x.size());
+
283  for (int i = 0; i < x.size(); ++i)
+
284  x_var(i) = x(i);
+
285 
+
286  Matrix<fvar<var>,Dynamic,1> x_fvar(x.size());
+
287 
+
288  var sum(0.0);
+
289  Matrix<double,Dynamic,1> M_n(x.size());
+
290  for (int n = 0; n < x.size(); ++n) {
+
291  for (int k = 0; k < x.size(); ++k)
+
292  M_n(k) = M(n,k);
+
293  for (int k = 0; k < x.size(); ++k)
+
294  x_fvar(k) = fvar<var>(x_var(k), k == n);
+
295  fvar<var> fx;
+
296  fvar<var> grad_fx_dot_v;
+
297  gradient_dot_vector<fvar<var>,double>(f,x_fvar,M_n,fx,grad_fx_dot_v);
+
298  sum += grad_fx_dot_v.d_;
+
299  }
+
300 
+
301  stan::agrad::grad(sum.vi_);
+
302  for (int i = 0; i < x.size(); ++i)
+
303  grad_tr_MH(i) = x_var(i).adj();
+ +
305  }
+
306 
+
307 
+
308 
+
309  }
+
310 }
+
311 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/base__adaptation_8hpp.html b/doc/api/html/base__adaptation_8hpp.html new file mode 100644 index 00000000000..c3e313df02a --- /dev/null +++ b/doc/api/html/base__adaptation_8hpp.html @@ -0,0 +1,127 @@ + + + + + +Stan: src/stan/mcmc/base_adaptation.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
base_adaptation.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::base_adaptation
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/base__adaptation_8hpp_source.html b/doc/api/html/base__adaptation_8hpp_source.html new file mode 100644 index 00000000000..4b9e32fd07d --- /dev/null +++ b/doc/api/html/base__adaptation_8hpp_source.html @@ -0,0 +1,127 @@ + + + + + +Stan: src/stan/mcmc/base_adaptation.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
base_adaptation.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__BASE__ADAPTATION__BETA__
+
2 #define __STAN__MCMC__BASE__ADAPTATION__BETA__
+
3 
+
4 namespace stan {
+
5 
+
6  namespace mcmc {
+
7 
+ +
9 
+
10  public:
+
11 
+
12  virtual void restart() {};
+
13 
+
14  };
+
15 
+
16  } // mcmc
+
17 
+
18 } // stan
+
19 
+
20 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/base__adapter_8hpp.html b/doc/api/html/base__adapter_8hpp.html new file mode 100644 index 00000000000..c4c861b3fc8 --- /dev/null +++ b/doc/api/html/base__adapter_8hpp.html @@ -0,0 +1,127 @@ + + + + + +Stan: src/stan/mcmc/base_adapter.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
base_adapter.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::base_adapter
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/base__adapter_8hpp_source.html b/doc/api/html/base__adapter_8hpp_source.html new file mode 100644 index 00000000000..2c8ebb29a1e --- /dev/null +++ b/doc/api/html/base__adapter_8hpp_source.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/mcmc/base_adapter.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
base_adapter.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__BASE__ADAPTER__BETA__
+
2 #define __STAN__MCMC__BASE__ADAPTER__BETA__
+
3 
+
4 namespace stan {
+
5 
+
6  namespace mcmc {
+
7 
+
8  class base_adapter {
+
9 
+
10  public:
+
11 
+
12  base_adapter(): _adapt_flag(false) {};
+
13 
+
14  virtual void engage_adaptation() { _adapt_flag = true; }
+
15  virtual void disengage_adaptation() { _adapt_flag = false; }
+
16 
+
17  bool adapting() { return _adapt_flag; }
+
18 
+
19  protected:
+
20 
+ +
22 
+
23  };
+
24 
+
25  } // mcmc
+
26 
+
27 } // stan
+
28 
+
29 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/base__hamiltonian_8hpp.html b/doc/api/html/base__hamiltonian_8hpp.html new file mode 100644 index 00000000000..6b691265dd5 --- /dev/null +++ b/doc/api/html/base__hamiltonian_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/mcmc/hmc/hamiltonians/base_hamiltonian.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
base_hamiltonian.hpp File Reference
+
+
+
#include <stdexcept>
+#include <fstream>
+#include <iostream>
+#include <vector>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/model/util.hpp>
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::base_hamiltonian< M, P, BaseRNG >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/base__hamiltonian_8hpp_source.html b/doc/api/html/base__hamiltonian_8hpp_source.html new file mode 100644 index 00000000000..2a00dd54b0f --- /dev/null +++ b/doc/api/html/base__hamiltonian_8hpp_source.html @@ -0,0 +1,195 @@ + + + + + +Stan: src/stan/mcmc/hmc/hamiltonians/base_hamiltonian.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
base_hamiltonian.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__BASE__HAMILTONIAN__BETA__
+
2 #define __STAN__MCMC__BASE__HAMILTONIAN__BETA__
+
3 
+
4 #include <stdexcept>
+
5 #include <fstream>
+
6 #include <iostream>
+
7 #include <vector>
+
8 
+ +
10 #include <stan/model/util.hpp>
+
11 
+
12 namespace stan {
+
13 
+
14  namespace mcmc {
+
15 
+
16  template <typename M, typename P, typename BaseRNG>
+ +
18 
+
19  public:
+
20 
+
21  base_hamiltonian(M& m, std::ostream* e): _model(m), _err_stream(e) {};
+ +
23 
+
24  virtual double T(P& z) = 0;
+
25  double V(P& z) { return z.V; }
+
26 
+
27  virtual double tau(P& z) = 0;
+
28  virtual double phi(P& z) = 0;
+
29 
+
30  double H(P& z) { return T(z) + V(z); }
+
31 
+
32  // tau = 0.5 p_{i} p_{j} Lambda^{ij} (q)
+
33  virtual const Eigen::VectorXd dtau_dq(P& z) = 0;
+
34  virtual const Eigen::VectorXd dtau_dp(P& z) = 0;
+
35 
+
36  // phi = 0.5 * log | Lambda (q) | + V(q)
+
37  virtual const Eigen::VectorXd dphi_dq(P& z) = 0;
+
38 
+
39  virtual void sample_p(P& z, BaseRNG& rng) = 0;
+
40 
+
41  virtual void init(P& z) { this->update(z); }
+
42 
+
43  virtual void update(P& z) {
+
44 
+
45  try {
+
46  z.V = - stan::model::log_prob_grad<true,true>(_model, z.q, z.g, _err_stream);
+
47  } catch (std::domain_error e) {
+
48  this->_write_error_msg(_err_stream, e);
+
49  z.V = std::numeric_limits<double>::infinity();
+
50  }
+
51 
+
52  z.g *= -1;
+
53 
+
54  }
+
55 
+
56  protected:
+
57 
+
58  M& _model;
+
59 
+
60  std::ostream* _err_stream;
+
61 
+
62  void _write_error_msg(std::ostream* error_msgs,
+
63  const std::domain_error& e) {
+
64 
+
65  if (!error_msgs) return;
+
66 
+
67  *error_msgs << std::endl
+
68  << "Informational Message: The current Metropolis proposal is about to be "
+
69  << "rejected becuase of the following issue:"
+
70  << std::endl
+
71  << e.what() << std::endl
+
72  << "If this warning occurs sporadically, such as for highly constrained "
+
73  << "variable types like covariance matrices, then the sampler is fine,"
+
74  << std::endl
+
75  << "but if this warning occurs often then your model may be either severely "
+
76  << "ill-conditioned or misspecified."
+
77  << std::endl;
+
78 
+
79  }
+
80 
+
81  };
+
82 
+
83  } // mcmc
+
84 
+
85 } // stan
+
86 
+
87 
+
88 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/base__hmc_8hpp.html b/doc/api/html/base__hmc_8hpp.html new file mode 100644 index 00000000000..4199fab1c98 --- /dev/null +++ b/doc/api/html/base__hmc_8hpp.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/mcmc/hmc/base_hmc.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
base_hmc.hpp File Reference
+
+
+
#include <math.h>
+#include <stdexcept>
+#include <boost/math/special_functions/fpclassify.hpp>
+#include <boost/random/variate_generator.hpp>
+#include <boost/random/uniform_01.hpp>
+#include <stan/mcmc/base_mcmc.hpp>
+#include <stan/mcmc/hmc/hamiltonians/ps_point.hpp>
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::base_hmc< M, P, H, I, BaseRNG >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/base__hmc_8hpp_source.html b/doc/api/html/base__hmc_8hpp_source.html new file mode 100644 index 00000000000..a80e132ef55 --- /dev/null +++ b/doc/api/html/base__hmc_8hpp_source.html @@ -0,0 +1,259 @@ + + + + + +Stan: src/stan/mcmc/hmc/base_hmc.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
base_hmc.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__BASE__HMC__BETA__
+
2 #define __STAN__MCMC__BASE__HMC__BETA__
+
3 
+
4 #include <math.h>
+
5 #include <stdexcept>
+
6 
+
7 #include <boost/math/special_functions/fpclassify.hpp>
+
8 #include <boost/random/variate_generator.hpp>
+
9 #include <boost/random/uniform_01.hpp>
+
10 
+
11 #include <stan/mcmc/base_mcmc.hpp>
+ +
13 
+
14 namespace stan {
+
15 
+
16  namespace mcmc {
+
17 
+
18  template <class M, class P, template<class, class> class H,
+
19  template<class, class> class I, class BaseRNG>
+
20  class base_hmc: public base_mcmc {
+
21 
+
22  public:
+
23 
+
24  base_hmc(M &m, BaseRNG& rng, std::ostream* o, std::ostream* e):
+
25  base_mcmc(o, e),
+
26  _z(m.num_params_r()),
+
27  _integrator(this->_out_stream),
+
28  _hamiltonian(m, this->_err_stream),
+
29  _rand_int(rng),
+ +
31  _nom_epsilon(0.1),
+ +
33  _epsilon_jitter(0.0)
+
34  {};
+
35 
+
36  void write_sampler_state(std::ostream* o) {
+
37  if(!o) return;
+
38  *o << "# Step size = " << get_nominal_stepsize() << std::endl;
+
39  _z.write_metric(o);
+
40  }
+
41 
+
42  void get_sampler_diagnostic_names(std::vector<std::string>& model_names,
+
43  std::vector<std::string>& names) {
+
44  _z.get_param_names(model_names, names);
+
45  };
+
46 
+
47  void get_sampler_diagnostics(std::vector<double>& values) {
+
48  _z.get_params(values);
+
49  };
+
50 
+
51  void seed(const Eigen::VectorXd& q) {
+
52  _z.q = q;
+
53  }
+
54 
+
55  void init_stepsize() {
+
56 
+
57  ps_point z_init(this->_z);
+
58 
+
59  this->_hamiltonian.sample_p(this->_z, this->_rand_int);
+
60  this->_hamiltonian.init(this->_z);
+
61 
+
62  double H0 = this->_hamiltonian.H(this->_z); // Guaranteed to be finite if randomly initialized
+
63 
+
64  this->_integrator.evolve(this->_z, this->_hamiltonian, this->_nom_epsilon);
+
65 
+
66  double h = this->_hamiltonian.H(this->_z);
+
67  if (boost::math::isnan(h)) h = std::numeric_limits<double>::infinity();
+
68 
+
69  double delta_H = H0 - h;
+
70 
+
71  int direction = delta_H > std::log(0.8) ? 1 : -1;
+
72 
+
73  while (1) {
+
74 
+
75  this->_z.ps_point::operator=(z_init);
+
76 
+
77  this->_hamiltonian.sample_p(this->_z, this->_rand_int);
+
78  this->_hamiltonian.init(this->_z);
+
79 
+
80  double H0 = this->_hamiltonian.H(this->_z);
+
81 
+
82  this->_integrator.evolve(this->_z, this->_hamiltonian, this->_nom_epsilon);
+
83 
+
84  double h = this->_hamiltonian.H(this->_z);
+
85  if (boost::math::isnan(h)) h = std::numeric_limits<double>::infinity();
+
86 
+
87  double delta_H = H0 - h;
+
88 
+
89  if ((direction == 1) && !(delta_H > std::log(0.8)))
+
90  break;
+
91  else if ((direction == -1) && !(delta_H < std::log(0.8)))
+
92  break;
+
93  else
+
94  this->_nom_epsilon = ( (direction == 1)
+
95  ? 2.0 * this->_nom_epsilon
+
96  : 0.5 * this->_nom_epsilon );
+
97 
+
98  if (this->_nom_epsilon > 1e7)
+
99  throw std::runtime_error("Posterior is improper. Please check your model.");
+
100  if (this->_nom_epsilon == 0)
+
101  throw std::runtime_error("No acceptably small step size could be found. Perhaps the posterior is not continuous?");
+
102 
+
103  }
+
104 
+
105  this->_z.ps_point::operator=(z_init);
+
106 
+
107  }
+
108 
+
109  P& z() { return _z; }
+
110 
+
111  virtual void set_nominal_stepsize(const double e) {
+
112  if(e > 0) _nom_epsilon = e;
+
113  }
+
114 
+
115  double get_nominal_stepsize() { return this->_nom_epsilon; }
+
116 
+
117  double get_current_stepsize() { return this->_epsilon; }
+
118 
+
119  virtual void set_stepsize_jitter(const double j) {
+
120  if(j > 0 && j < 1) _epsilon_jitter = j;
+
121  }
+
122 
+
123  double get_stepsize_jitter() { return this->_epsilon_jitter; }
+
124 
+ +
126  this->_epsilon = this->_nom_epsilon;
+
127  if(this->_epsilon_jitter)
+
128  this->_epsilon *= ( 1.0 + this->_epsilon_jitter * (2.0 * this->_rand_uniform() - 1.0) );
+
129  }
+
130 
+
131  protected:
+
132 
+
133  P _z;
+
134  I<H<M, BaseRNG>, P> _integrator;
+
135  H<M, BaseRNG> _hamiltonian;
+
136 
+
137  BaseRNG& _rand_int;
+
138 
+
139  // Uniform(0, 1) RNG
+
140  boost::uniform_01<BaseRNG&> _rand_uniform;
+
141 
+
142  double _nom_epsilon;
+
143  double _epsilon;
+ +
145 
+
146  };
+
147 
+
148  } // mcmc
+
149 
+
150 } // stan
+
151 
+
152 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/base__integrator_8hpp.html b/doc/api/html/base__integrator_8hpp.html new file mode 100644 index 00000000000..4bff8c5640c --- /dev/null +++ b/doc/api/html/base__integrator_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/mcmc/hmc/integrators/base_integrator.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
base_integrator.hpp File Reference
+
+
+
#include <ostream>
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::base_integrator< H, P >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/base__integrator_8hpp_source.html b/doc/api/html/base__integrator_8hpp_source.html new file mode 100644 index 00000000000..b27da4364b9 --- /dev/null +++ b/doc/api/html/base__integrator_8hpp_source.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/mcmc/hmc/integrators/base_integrator.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
base_integrator.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__BASE__INTEGRATOR__BETA__
+
2 #define __STAN__MCMC__BASE__INTEGRATOR__BETA__
+
3 
+
4 #include <ostream>
+
5 
+
6 namespace stan {
+
7 
+
8  namespace mcmc {
+
9 
+
10  template <typename H, typename P>
+ +
12 
+
13  public:
+
14 
+
15  base_integrator(std::ostream* o): _out_stream(o) {};
+
16 
+
17  virtual void evolve(P& z, H& hamiltonian, const double epsilon) = 0;
+
18 
+
19  protected:
+
20 
+
21  std::ostream* _out_stream;
+
22 
+
23  };
+
24 
+
25  } // mcmc
+
26 
+
27 } // stan
+
28 
+
29 
+
30 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/base__leapfrog_8hpp.html b/doc/api/html/base__leapfrog_8hpp.html new file mode 100644 index 00000000000..b7c98d923b5 --- /dev/null +++ b/doc/api/html/base__leapfrog_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/mcmc/hmc/integrators/base_leapfrog.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
base_leapfrog.hpp File Reference
+
+
+
#include <iostream>
+#include <iomanip>
+#include <stan/mcmc/hmc/integrators/base_integrator.hpp>
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::base_leapfrog< H, P >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/base__leapfrog_8hpp_source.html b/doc/api/html/base__leapfrog_8hpp_source.html new file mode 100644 index 00000000000..b9f2ccf4652 --- /dev/null +++ b/doc/api/html/base__leapfrog_8hpp_source.html @@ -0,0 +1,229 @@ + + + + + +Stan: src/stan/mcmc/hmc/integrators/base_leapfrog.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
base_leapfrog.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__BASE__LEAPFROG__BETA__
+
2 #define __STAN__MCMC__BASE__LEAPFROG__BETA__
+
3 
+
4 #include <iostream>
+
5 #include <iomanip>
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace mcmc {
+
11 
+
12  template <typename H, typename P>
+
13  class base_leapfrog: public base_integrator<H, P> {
+
14 
+
15  public:
+
16 
+
17  base_leapfrog(std::ostream* o): base_integrator<H, P>(o) {};
+
18 
+
19  void evolve(P& z, H& hamiltonian, const double epsilon) {
+
20 
+
21  begin_update_p(z, hamiltonian, 0.5 * epsilon);
+
22 
+
23  update_q(z, hamiltonian, epsilon);
+
24  hamiltonian.update(z);
+
25 
+
26  end_update_p(z, hamiltonian, 0.5 * epsilon);
+
27 
+
28  }
+
29 
+
30  void verbose_evolve(P& z, H& hamiltonian, const double epsilon) {
+
31 
+
32  this->_out_stream->precision(6);
+
33  int width = 14;
+
34  int nColumn = 4;
+
35 
+
36  if (this->_out_stream) {
+
37 
+
38  *(this->_out_stream) << "Verbose Hamiltonian Evolution, Step Size = " << epsilon << ":" << std::endl;
+
39  *(this->_out_stream) << " " << std::setw(nColumn * width) << std::setfill('-')
+
40  << "" << std::setfill(' ') << std::endl;
+
41  *(this->_out_stream) << " "
+
42  << std::setw(width) << std::left << "Poisson"
+
43  << std::setw(width) << std::left << "Initial"
+
44  << std::setw(width) << std::left << "Current"
+
45  << std::setw(width) << std::left << "DeltaH"
+
46  << std::endl;
+
47  *(this->_out_stream) << " "
+
48  << std::setw(width) << std::left << "Operator"
+
49  << std::setw(width) << std::left << "Hamiltonian"
+
50  << std::setw(width) << std::left << "Hamiltonian"
+
51  << std::setw(width) << std::left << "/ Stepsize^{2}"
+
52  << std::endl;
+
53  *(this->_out_stream) << " " << std::setw(nColumn * width) << std::setfill('-')
+
54  << "" << std::setfill(' ') << std::endl;
+
55 
+
56  }
+
57 
+
58  double H0 = hamiltonian.H(z);
+
59 
+
60  begin_update_p(z, hamiltonian, 0.5 * epsilon);
+
61 
+
62  double H1 = hamiltonian.H(z);
+
63 
+
64  if (this->_out_stream) {
+
65 
+
66  *(this->_out_stream) << " "
+
67  << std::setw(width) << std::left << "hat{V}/2"
+
68  << std::setw(width) << std::left << H0
+
69  << std::setw(width) << std::left << H1
+
70  << std::setw(width) << std::left << (H1 - H0) / (epsilon * epsilon)
+
71  << std::endl;
+
72 
+
73  }
+
74 
+
75  update_q(z, hamiltonian, epsilon);
+
76  hamiltonian.update(z);
+
77 
+
78  double H2 = hamiltonian.H(z);
+
79 
+
80  if (this->_out_stream) {
+
81 
+
82  *(this->_out_stream) << " "
+
83  << std::setw(width) << std::left << "hat{T}"
+
84  << std::setw(width) << std::left << H0
+
85  << std::setw(width) << std::left << H2
+
86  << std::setw(width) << std::left << (H2 - H0) / (epsilon * epsilon)
+
87  << std::endl;
+
88 
+
89  }
+
90 
+
91  end_update_p(z, hamiltonian, 0.5 * epsilon);
+
92 
+
93  double H3 = hamiltonian.H(z);
+
94 
+
95  if (this->_out_stream) {
+
96 
+
97  *(this->_out_stream) << " "
+
98  << std::setw(width) << std::left << "hat{V}/2"
+
99  << std::setw(width) << std::left << H0
+
100  << std::setw(width) << std::left << H3
+
101  << std::setw(width) << std::left << (H3 - H0) / (epsilon * epsilon)
+
102  << std::endl;
+
103 
+
104  *(this->_out_stream) << " " << std::setw(nColumn * width) << std::setfill('-')
+
105  << "" << std::setfill(' ') << std::endl;
+
106 
+
107  }
+
108 
+
109  }
+
110 
+
111  virtual void begin_update_p(P& z, H& hamiltonian, double epsilon) = 0;
+
112  virtual void update_q(P& z, H& hamiltonian, double epsilon) = 0;
+
113  virtual void end_update_p(P& z, H& hamiltonian, double epsilon) = 0;
+
114 
+
115  };
+
116 
+
117  } // mcmc
+
118 
+
119 } // stan
+
120 
+
121 
+
122 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/base__mcmc_8hpp.html b/doc/api/html/base__mcmc_8hpp.html new file mode 100644 index 00000000000..e286df5ec76 --- /dev/null +++ b/doc/api/html/base__mcmc_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/mcmc/base_mcmc.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
base_mcmc.hpp File Reference
+
+
+
#include <ostream>
+#include <string>
+#include <stan/mcmc/sample.hpp>
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::base_mcmc
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/base__mcmc_8hpp_source.html b/doc/api/html/base__mcmc_8hpp_source.html new file mode 100644 index 00000000000..2142bff1eda --- /dev/null +++ b/doc/api/html/base__mcmc_8hpp_source.html @@ -0,0 +1,161 @@ + + + + + +Stan: src/stan/mcmc/base_mcmc.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
base_mcmc.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__BASE_MCMC__HPP__
+
2 #define __STAN__MCMC__BASE_MCMC__HPP__
+
3 
+
4 #include <ostream>
+
5 #include <string>
+
6 
+
7 #include <stan/mcmc/sample.hpp>
+
8 
+
9 namespace stan {
+
10 
+
11  namespace mcmc {
+
12 
+
13  class base_mcmc {
+
14 
+
15  public:
+
16 
+
17  base_mcmc(std::ostream* o, std::ostream* e): _out_stream(o), _err_stream(e) {};
+
18 
+
19  virtual ~base_mcmc() {};
+
20 
+
21  virtual sample transition(sample& init_sample) = 0;
+
22 
+
23  std::string name() { return _name; }
+
24 
+
25  virtual void write_sampler_param_names(std::ostream& o) {};
+
26 
+
27  virtual void write_sampler_params(std::ostream& o) {};
+
28 
+
29  virtual void get_sampler_param_names(std::vector<std::string>& names) {};
+
30 
+
31  virtual void get_sampler_params(std::vector<double>& values) {};
+
32 
+
33  virtual void write_sampler_state(std::ostream* o) {};
+
34 
+
35  virtual void get_sampler_diagnostic_names(std::vector<std::string>& model_names,
+
36  std::vector<std::string>& names) {};
+
37 
+
38  virtual void get_sampler_diagnostics(std::vector<double>& values) {};
+
39 
+
40  protected:
+
41 
+
42  std::string _name;
+
43 
+
44  std::ostream* _out_stream;
+
45  std::ostream* _err_stream;
+
46 
+
47  };
+
48 
+
49  } // mcmc
+
50 
+
51 } // stan
+
52 
+
53 #endif
+
54 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/base__nuts_8hpp.html b/doc/api/html/base__nuts_8hpp.html new file mode 100644 index 00000000000..3c30be80bc3 --- /dev/null +++ b/doc/api/html/base__nuts_8hpp.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/mcmc/hmc/nuts/base_nuts.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
base_nuts.hpp File Reference
+
+
+
#include <math.h>
+#include <boost/math/special_functions/fpclassify.hpp>
+#include <stan/math/functions/min.hpp>
+#include <stan/mcmc/hmc/base_hmc.hpp>
+#include <stan/mcmc/hmc/hamiltonians/ps_point.hpp>
+
+

Go to the source code of this file.

+ + + + + + +

+Classes

struct  stan::mcmc::nuts_util
 
class  stan::mcmc::base_nuts< M, P, H, I, BaseRNG >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/base__nuts_8hpp_source.html b/doc/api/html/base__nuts_8hpp_source.html new file mode 100644 index 00000000000..bbcdb6972c7 --- /dev/null +++ b/doc/api/html/base__nuts_8hpp_source.html @@ -0,0 +1,368 @@ + + + + + +Stan: src/stan/mcmc/hmc/nuts/base_nuts.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
base_nuts.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__BASE__NUTS__BETA__
+
2 #define __STAN__MCMC__BASE__NUTS__BETA__
+
3 
+
4 #include <math.h>
+
5 #include <boost/math/special_functions/fpclassify.hpp>
+ + + +
9 
+
10 namespace stan {
+
11 
+
12  namespace mcmc {
+
13 
+
14  struct nuts_util
+
15  {
+
16  // Constants through each recursion
+
17  double log_u;
+
18  double H0;
+
19  int sign;
+
20 
+
21  // Aggregators through each recursion
+
22  int n_tree;
+
23  double sum_prob;
+
24  bool criterion;
+
25 
+
26  };
+
27 
+
28  // The No-U-Turn Sampler (NUTS).
+
29 
+
30  template <class M, class P, template<class, class> class H,
+
31  template<class, class> class I, class BaseRNG>
+
32  class base_nuts: public base_hmc<M, P, H, I, BaseRNG>
+
33  {
+
34 
+
35  public:
+
36 
+
37  base_nuts(M &m, BaseRNG& rng, std::ostream* o, std::ostream* e):
+
38  base_hmc<M, P, H, I, BaseRNG>(m, rng, o, e),
+
39  _depth(0), _max_depth(5), _max_delta(1000), _n_divergent(0)
+
40  {};
+
41 
+
42  ~base_nuts() {};
+
43 
+
44  void set_max_depth(const int d) {
+
45  if(d > 0)
+
46  _max_depth = d;
+
47  }
+
48 
+
49  void set_max_delta(const double d) {
+
50  _max_delta = d;
+
51  }
+
52 
+
53  int get_max_depth() { return this->_max_depth; }
+
54  double get_max_delta() { return this->_max_delta; }
+
55 
+
56  sample transition(sample& init_sample)
+
57  {
+
58 
+
59  // Initialize the algorithm
+
60  this->sample_stepsize();
+
61 
+
62  nuts_util util;
+
63 
+
64  this->seed(init_sample.cont_params());
+
65 
+
66  this->_hamiltonian.sample_p(this->_z, this->_rand_int);
+
67  this->_hamiltonian.init(this->_z);
+
68 
+
69  ps_point z_plus(this->_z);
+
70  ps_point z_minus(z_plus);
+
71 
+
72  ps_point z_sample(z_plus);
+
73  ps_point z_propose(z_plus);
+
74 
+
75  int n_cont = init_sample.cont_params().size();
+
76 
+
77  Eigen::VectorXd rho_init = this->_z.p;
+
78  Eigen::VectorXd rho_plus(n_cont); rho_plus.setZero();
+
79  Eigen::VectorXd rho_minus(n_cont); rho_minus.setZero();
+
80 
+
81  util.H0 = this->_hamiltonian.H(this->_z);
+
82 
+
83  // Sample the slice variable
+
84  util.log_u = std::log(this->_rand_uniform());
+
85 
+
86  // Build a balanced binary tree until the NUTS criterion fails
+
87  util.criterion = true;
+
88  int n_valid = 0;
+
89 
+
90  this->_depth = 0;
+
91  this->_n_divergent = 0;
+
92 
+
93  util.n_tree = 0;
+
94  util.sum_prob = 0;
+
95 
+
96  while (util.criterion && (this->_depth <= this->_max_depth) ) {
+
97 
+
98  // Randomly sample a direction in time
+
99  ps_point* z = 0;
+
100  Eigen::VectorXd* rho = 0;
+
101 
+
102  if (this->_rand_uniform() > 0.5)
+
103  {
+
104  z = &z_plus;
+
105  rho = &rho_plus;
+
106  util.sign = 1;
+
107  }
+
108  else
+
109  {
+
110  z = &z_minus;
+
111  rho = &rho_minus;
+
112  util.sign = -1;
+
113  }
+
114 
+
115  // And build a new subtree in that direction
+
116  this->_z.ps_point::operator=(*z);
+
117 
+
118  int n_valid_subtree = build_tree(_depth, *rho, 0, z_propose, util);
+
119 
+
120  *z = this->_z;
+
121 
+
122  // Metropolis-Hastings sample the fresh subtree
+
123  if (!util.criterion)
+
124  break;
+
125 
+
126  double subtree_prob = 0;
+
127 
+
128  if (n_valid) {
+
129  subtree_prob = static_cast<double>(n_valid_subtree) /
+
130  static_cast<double>(n_valid);
+
131  } else {
+
132  subtree_prob = n_valid_subtree ? 1 : 0;
+
133  }
+
134 
+
135  if (this->_rand_uniform() < subtree_prob)
+
136  z_sample = z_propose;
+
137 
+
138  n_valid += n_valid_subtree;
+
139 
+
140  // Check validity of completed tree
+
141  this->_z.ps_point::operator=(z_plus);
+
142  Eigen::VectorXd delta_rho = rho_minus + rho_init + rho_plus;
+
143 
+
144  util.criterion = compute_criterion(z_minus, this->_z, delta_rho);
+
145 
+
146  ++(this->_depth);
+
147 
+
148  }
+
149 
+
150  --(this->_depth); // Correct for increment at end of loop
+
151 
+
152  double accept_prob = util.sum_prob / static_cast<double>(util.n_tree);
+
153 
+
154  this->_z.ps_point::operator=(z_sample);
+
155  return sample(this->_z.q, - this->_z.V, accept_prob);
+
156 
+
157  }
+
158 
+
159  void write_sampler_param_names(std::ostream& o) {
+
160  o << "stepsize__,treedepth__,n_divergent__,";
+
161  }
+
162 
+
163  void write_sampler_params(std::ostream& o) {
+
164  o << this->_epsilon << "," << this->_depth << "," << this->_n_divergent << ",";
+
165  }
+
166 
+
167  void get_sampler_param_names(std::vector<std::string>& names) {
+
168  names.push_back("stepsize__");
+
169  names.push_back("treedepth__");
+
170  names.push_back("n_divergent__");
+
171  }
+
172 
+
173  void get_sampler_params(std::vector<double>& values) {
+
174  values.push_back(this->_epsilon);
+
175  values.push_back(this->_depth);
+
176  values.push_back(this->_n_divergent);
+
177  }
+
178 
+
179  virtual bool compute_criterion(ps_point& start, P& finish, Eigen::VectorXd& rho) = 0;
+
180 
+
181  // Returns number of valid points in the completed subtree
+
182  int build_tree(int depth, Eigen::VectorXd& rho,
+
183  ps_point* z_init_parent, ps_point& z_propose,
+
184  nuts_util& util)
+
185  {
+
186 
+
187  // Base case
+
188  if (depth == 0)
+
189  {
+
190 
+
191  this->_integrator.evolve(this->_z, this->_hamiltonian,
+
192  util.sign * this->_epsilon);
+
193 
+
194  rho += this->_z.p;
+
195 
+
196  if (z_init_parent) *z_init_parent = this->_z;
+
197  z_propose = this->_z;
+
198 
+
199  double h = this->_hamiltonian.H(this->_z);
+
200  if (boost::math::isnan(h)) h = std::numeric_limits<double>::infinity();
+
201 
+
202  util.criterion = util.log_u + (h - util.H0) < this->_max_delta;
+
203  if (!util.criterion) ++(this->_n_divergent);
+
204 
+
205  util.sum_prob += stan::math::min(1, std::exp(util.H0 - h));
+
206  util.n_tree += 1;
+
207 
+
208  return (util.log_u + (h - util.H0) < 0);
+
209 
+
210  }
+
211  // General recursion
+
212  else
+
213  {
+
214 
+
215  Eigen::VectorXd left_subtree_rho(rho.size()); left_subtree_rho.setZero();
+
216  ps_point z_init(this->_z);
+
217 
+
218  int n1 = build_tree(depth - 1, left_subtree_rho, &z_init, z_propose, util);
+
219 
+
220  if (z_init_parent) *z_init_parent = z_init;
+
221 
+
222  if (!util.criterion) return 0;
+
223 
+
224  Eigen::VectorXd right_subtree_rho(rho.size()); right_subtree_rho.setZero();
+
225  ps_point z_propose_right(z_init);
+
226 
+
227  int n2 = build_tree(depth - 1, right_subtree_rho, 0, z_propose_right, util);
+
228 
+
229  double accept_prob = static_cast<double>(n2) /
+
230  static_cast<double>(n1 + n2);
+
231 
+
232  if ( util.criterion && (this->_rand_uniform() < accept_prob) )
+
233  z_propose = z_propose_right;
+
234 
+
235  Eigen::VectorXd& subtree_rho = left_subtree_rho;
+
236  subtree_rho += right_subtree_rho;
+
237 
+
238  rho += subtree_rho;
+
239 
+
240  util.criterion &= compute_criterion(z_init, this->_z, subtree_rho);
+
241 
+
242  return n1 + n2;
+
243 
+
244  }
+
245 
+
246  }
+
247 
+
248  int _depth;
+ +
250  double _max_delta;
+
251 
+ +
253 
+
254  };
+
255 
+
256  } // mcmc
+
257 
+
258 } // stan
+
259 
+
260 
+
261 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/base__static__hmc_8hpp.html b/doc/api/html/base__static__hmc_8hpp.html new file mode 100644 index 00000000000..6d4685f0e5c --- /dev/null +++ b/doc/api/html/base__static__hmc_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/mcmc/hmc/static/base_static_hmc.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
base_static_hmc.hpp File Reference
+
+
+
#include <math.h>
+#include <boost/math/special_functions/fpclassify.hpp>
+#include <stan/mcmc/hmc/base_hmc.hpp>
+#include <stan/mcmc/hmc/hamiltonians/ps_point.hpp>
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/base__static__hmc_8hpp_source.html b/doc/api/html/base__static__hmc_8hpp_source.html new file mode 100644 index 00000000000..12ce0f28c6c --- /dev/null +++ b/doc/api/html/base__static__hmc_8hpp_source.html @@ -0,0 +1,230 @@ + + + + + +Stan: src/stan/mcmc/hmc/static/base_static_hmc.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
base_static_hmc.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__BASE__STATIC__HMC__BETA__
+
2 #define __STAN__MCMC__BASE__STATIC__HMC__BETA__
+
3 
+
4 #include <math.h>
+
5 #include <boost/math/special_functions/fpclassify.hpp>
+ + +
8 
+
9 namespace stan {
+
10 
+
11  namespace mcmc {
+
12 
+
13  // Hamiltonian Monte Carlo
+
14  // with static integration time
+
15 
+
16  template <class M, class P, template<class, class> class H,
+
17  template<class, class> class I, class BaseRNG>
+
18  class base_static_hmc: public base_hmc<M, P, H, I, BaseRNG> {
+
19 
+
20  public:
+
21 
+
22  base_static_hmc(M &m, BaseRNG& rng, std::ostream* o, std::ostream* e):
+
23  base_hmc<M, P, H, I, BaseRNG>(m, rng, o, e), T_(1)
+
24  { _update_L(); }
+
25 
+ +
27 
+
28  sample transition(sample& init_sample) {
+
29 
+
30  this->sample_stepsize();
+
31 
+
32  this->seed(init_sample.cont_params());
+
33 
+
34  this->_hamiltonian.sample_p(this->_z, this->_rand_int);
+
35  this->_hamiltonian.init(this->_z);
+
36 
+
37  ps_point z_init(this->_z);
+
38 
+
39  double H0 = this->_hamiltonian.H(this->_z);
+
40 
+
41  for (int i = 0; i < L_; ++i) {
+
42  this->_integrator.evolve(this->_z, this->_hamiltonian, this->_epsilon);
+
43  }
+
44 
+
45  double h = this->_hamiltonian.H(this->_z);
+
46  if (boost::math::isnan(h)) h = std::numeric_limits<double>::infinity();
+
47 
+
48  double acceptProb = std::exp(H0 - h);
+
49 
+
50  if (acceptProb < 1 && this->_rand_uniform() > acceptProb) {
+
51  this->_z.ps_point::operator=(z_init);
+
52  }
+
53 
+
54  acceptProb = acceptProb > 1 ? 1 : acceptProb;
+
55 
+
56  return sample(this->_z.q, - this->_hamiltonian.V(this->_z), acceptProb);
+
57 
+
58  }
+
59 
+
60  void write_sampler_param_names(std::ostream& o) {
+
61  o << "stepsize__,int_time__,";
+
62  }
+
63 
+
64  void write_sampler_params(std::ostream& o) {
+
65  o << this->_epsilon << "," << this->T_ << ",";
+
66  }
+
67 
+
68  void get_sampler_param_names(std::vector<std::string>& names) {
+
69  names.push_back("stepsize__");
+
70  names.push_back("int_time__");
+
71  }
+
72 
+
73  void get_sampler_params(std::vector<double>& values) {
+
74  values.push_back(this->_epsilon);
+
75  values.push_back(this->T_);
+
76  }
+
77 
+
78  void set_nominal_stepsize_and_T(const double e, const double t) {
+
79  if(e > 0 && t > 0) {
+
80  this->_nom_epsilon = e; T_ = t; _update_L();
+
81  }
+
82  }
+
83 
+
84  void set_nominal_stepsize_and_L(const double e, const int l) {
+
85  if(e > 0 && l > 0) {
+
86  this->_nom_epsilon = e; L_ = l; T_ = this->_nom_epsilon * L_;
+
87  }
+
88  }
+
89 
+
90  void set_T(const double t) {
+
91  if(t > 0) {
+
92  T_ = t; _update_L();
+
93  }
+
94 
+
95  }
+
96 
+
97  void set_nominal_stepsize(const double e) {
+
98  if(e > 0) {
+
99  this->_nom_epsilon = e; _update_L();
+
100  }
+
101  }
+
102 
+
103  double get_T() { return this->T_; }
+
104  int get_L() { return this->L_; }
+
105 
+
106  protected:
+
107 
+
108  double T_;
+
109  int L_;
+
110 
+
111  void _update_L() {
+
112  L_ = static_cast<int>(T_ / this->_nom_epsilon);
+
113  L_ = L_ < 1 ? 1 : L_;
+
114  }
+
115 
+
116  };
+
117 
+
118  } // mcmc
+
119 
+
120 } // stan
+
121 
+
122 
+
123 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/bc_s.png b/doc/api/html/bc_s.png new file mode 100644 index 0000000000000000000000000000000000000000..224b29aa9847d5a4b3902efd602b7ddf7d33e6c2 GIT binary patch literal 676 zcmV;V0$crwP)y__>=_9%My z{n931IS})GlGUF8K#6VIbs%684A^L3@%PlP2>_sk`UWPq@f;rU*V%rPy_ekbhXT&s z(GN{DxFv}*vZp`F>S!r||M`I*nOwwKX+BC~3P5N3-)Y{65c;ywYiAh-1*hZcToLHK ztpl1xomJ+Yb}K(cfbJr2=GNOnT!UFA7Vy~fBz8?J>XHsbZoDad^8PxfSa0GDgENZS zuLCEqzb*xWX2CG*b&5IiO#NzrW*;`VC9455M`o1NBh+(k8~`XCEEoC1Ybwf;vr4K3 zg|EB<07?SOqHp9DhLpS&bzgo70I+ghB_#)K7H%AMU3v}xuyQq9&Bm~++VYhF09a+U zl7>n7Jjm$K#b*FONz~fj;I->Bf;ule1prFN9FovcDGBkpg>)O*-}eLnC{6oZHZ$o% zXKW$;0_{8hxHQ>l;_*HATI(`7t#^{$(zLe}h*mqwOc*nRY9=?Sx4OOeVIfI|0V(V2 zBrW#G7Ss9wvzr@>H*`r>zE z+e8bOBgqIgldUJlG(YUDviMB`9+DH8n-s9SXRLyJHO1!=wY^79WYZMTa(wiZ!zP66 zA~!21vmF3H2{ngD;+`6j#~6j;$*f*G_2ZD1E;9(yaw7d-QnSCpK(cR1zU3qU0000< KMNUMnLSTYoA~SLT literal 0 HcmV?d00001 diff --git a/doc/api/html/bdwn.png b/doc/api/html/bdwn.png new file mode 100644 index 0000000000000000000000000000000000000000..940a0b950443a0bb1b216ac03c45b8a16c955452 GIT binary patch literal 147 zcmeAS@N?(olHy`uVBq!ia0vp^>_E)H!3HEvS)PKZC{Gv1kP61Pb5HX&C2wk~_T + + + + +Stan: src/stan/prob/distributions/univariate/discrete/bernoulli.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
bernoulli.hpp File Reference
+
+
+
#include <boost/random/bernoulli_distribution.hpp>
+#include <boost/random/variate_generator.hpp>
+#include <stan/agrad/partials_vari.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/math/constants.hpp>
+#include <stan/math/functions/inv_logit.hpp>
+#include <stan/math/functions/log1m.hpp>
+#include <stan/math/functions/value_of.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/prob/traits.hpp>
+#include <stan/prob/constants.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

template<bool propto, typename T_n , typename T_prob >
return_type< T_prob >::type stan::prob::bernoulli_log (const T_n &n, const T_prob &theta)
 
template<typename T_y , typename T_prob >
return_type< T_prob >::type stan::prob::bernoulli_log (const T_y &n, const T_prob &theta)
 
template<bool propto, typename T_n , typename T_prob >
return_type< T_prob >::type stan::prob::bernoulli_logit_log (const T_n &n, const T_prob &theta)
 
template<typename T_n , typename T_prob >
return_type< T_prob >::type stan::prob::bernoulli_logit_log (const T_n &n, const T_prob &theta)
 
template<typename T_n , typename T_prob >
return_type< T_prob >::type stan::prob::bernoulli_cdf (const T_n &n, const T_prob &theta)
 
template<typename T_n , typename T_prob >
return_type< T_prob >::type stan::prob::bernoulli_cdf_log (const T_n &n, const T_prob &theta)
 
template<typename T_n , typename T_prob >
return_type< T_prob >::type stan::prob::bernoulli_ccdf_log (const T_n &n, const T_prob &theta)
 
template<class RNG >
int stan::prob::bernoulli_rng (const double theta, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/bernoulli_8hpp_source.html b/doc/api/html/bernoulli_8hpp_source.html new file mode 100644 index 00000000000..658018fc1a6 --- /dev/null +++ b/doc/api/html/bernoulli_8hpp_source.html @@ -0,0 +1,539 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/discrete/bernoulli.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
bernoulli.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__DISCRETE__BERNOULLI_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__DISCRETE__BERNOULLI_HPP__
+
3 
+
4 #include <boost/random/bernoulli_distribution.hpp>
+
5 #include <boost/random/variate_generator.hpp>
+
6 
+ + + + + + +
13 #include <stan/meta/traits.hpp>
+
14 #include <stan/prob/traits.hpp>
+
15 #include <stan/prob/constants.hpp>
+
16 
+
17 namespace stan {
+
18 
+
19  namespace prob {
+
20 
+
21  // Bernoulli(n|theta) [0 <= n <= 1; 0 <= theta <= 1]
+
22  // FIXME: documentation
+
23  template <bool propto, typename T_n, typename T_prob>
+
24  typename return_type<T_prob>::type
+
25  bernoulli_log(const T_n& n,
+
26  const T_prob& theta) {
+
27  static const char* function = "stan::prob::bernoulli_log(%1%)";
+
28 
+ + +
31  using stan::math::log1m;
+ + + +
35 
+
36  // check if any vectors are zero length
+
37  if (!(stan::length(n)
+
38  && stan::length(theta)))
+
39  return 0.0;
+
40 
+
41  // set up return value accumulator
+
42  double logp(0.0);
+
43 
+
44  // validate args (here done over var, which should be OK)
+
45  if (!check_bounded(function, n, 0, 1, "n", &logp))
+
46  return logp;
+
47  if (!check_finite(function, theta, "Probability parameter", &logp))
+
48  return logp;
+
49  if (!check_bounded(function, theta, 0.0, 1.0,
+
50  "Probability parameter", &logp))
+
51  return logp;
+
52  if (!(check_consistent_sizes(function,
+
53  n,theta,
+
54  "Random variable","Probability parameter",
+
55  &logp)))
+
56  return logp;
+
57 
+
58  // check if no variables are involved and prop-to
+ +
60  return 0.0;
+
61 
+
62  // set up template expressions wrapping scalars into vector views
+
63  VectorView<const T_n> n_vec(n);
+
64  VectorView<const T_prob> theta_vec(theta);
+
65  size_t N = max_size(n, theta);
+
66  agrad::OperandsAndPartials<T_prob> operands_and_partials(theta);
+
67 
+
68  if (length(theta) == 1) {
+
69  size_t sum = 0;
+
70  for (size_t n = 0; n < N; n++) {
+
71  sum += value_of(n_vec[n]);
+
72  }
+
73  const double theta_dbl = value_of(theta_vec[0]);
+
74  // avoid nans when sum == N or sum == 0
+
75  if (sum == N) {
+
76  logp += N * log(theta_dbl);
+ +
78  operands_and_partials.d_x1[0] += N / theta_dbl;
+
79  } else if (sum == 0) {
+
80  logp += N * log1m(theta_dbl);
+ +
82  operands_and_partials.d_x1[0] += N / (theta_dbl - 1);
+
83  } else {
+
84  const double log_theta = log(theta_dbl);
+
85  const double log1m_theta = log1m(theta_dbl);
+
86 
+
87  logp += sum * log_theta;
+
88  logp += (N - sum) * log1m_theta;
+
89 
+
90  // gradient
+ +
92  operands_and_partials.d_x1[0] += sum / theta_dbl;
+
93  operands_and_partials.d_x1[0] += (N - sum) / (theta_dbl - 1);
+
94  }
+
95  }
+
96  } else {
+
97  for (size_t n = 0; n < N; n++) {
+
98  // pull out values of arguments
+
99  const int n_int = value_of(n_vec[n]);
+
100  const double theta_dbl = value_of(theta_vec[n]);
+
101 
+
102  if (n_int == 1)
+
103  logp += log(theta_dbl);
+
104  else
+
105  logp += log1m(theta_dbl);
+
106 
+
107  // gradient
+ +
109  if (n_int == 1)
+
110  operands_and_partials.d_x1[n] += 1.0 / theta_dbl;
+
111  else
+
112  operands_and_partials.d_x1[n] += 1.0 / (theta_dbl - 1);
+
113  }
+
114  }
+
115  }
+
116  return operands_and_partials.to_var(logp);
+
117  }
+
118 
+
119  template <typename T_y, typename T_prob>
+
120  inline
+ +
122  bernoulli_log(const T_y& n,
+
123  const T_prob& theta) {
+
124  return bernoulli_log<false>(n,theta);
+
125  }
+
126 
+
127 
+
128  // Bernoulli(n|inv_logit(theta)) [0 <= n <= 1; -inf <= theta <= inf]
+
129  // FIXME: documentation
+
130  template <bool propto, typename T_n, typename T_prob>
+ +
132  bernoulli_logit_log(const T_n& n, const T_prob& theta) {
+
133  static const char* function = "stan::prob::bernoulli_logit_log(%1%)";
+
134 
+ + + +
138  using stan::math::value_of;
+ + +
141  using stan::math::log1p;
+
142  using stan::math::inv_logit;
+
143 
+
144  // check if any vectors are zero length
+
145  if (!(stan::length(n)
+
146  && stan::length(theta)))
+
147  return 0.0;
+
148 
+
149  // set up return value accumulator
+
150  double logp(0.0);
+
151 
+
152  // validate args (here done over var, which should be OK)
+
153  if (!check_bounded(function, n, 0, 1, "n", &logp))
+
154  return logp;
+
155  if (!check_not_nan(function, theta, "Logit transformed probability parameter",
+
156  &logp))
+
157  return logp;
+
158  if (!(check_consistent_sizes(function,
+
159  n,theta,
+
160  "Random variable","Probability parameter",
+
161  &logp)))
+
162  return logp;
+
163 
+
164  // check if no variables are involved and prop-to
+ +
166  return 0.0;
+
167 
+
168  // set up template expressions wrapping scalars into vector views
+
169  VectorView<const T_n> n_vec(n);
+
170  VectorView<const T_prob> theta_vec(theta);
+
171  size_t N = max_size(n, theta);
+
172  agrad::OperandsAndPartials<T_prob> operands_and_partials(theta);
+
173 
+
174  for (size_t n = 0; n < N; n++) {
+
175  // pull out values of arguments
+
176  const int n_int = value_of(n_vec[n]);
+
177  const double theta_dbl = value_of(theta_vec[n]);
+
178 
+
179  // reusable subexpression values
+
180  const int sign = 2*n_int-1;
+
181  const double ntheta = sign * theta_dbl;
+
182  const double exp_m_ntheta = exp(-ntheta);
+
183 
+
184  // Handle extreme values gracefully using Taylor approximations.
+
185  const static double cutoff = 20.0;
+
186  if (ntheta > cutoff)
+
187  logp -= exp_m_ntheta;
+
188  else if (ntheta < -cutoff)
+
189  logp += ntheta;
+
190  else
+
191  logp -= log1p(exp_m_ntheta);
+
192 
+
193  // gradients
+ +
195  const static double cutoff = 20.0;
+
196  if (ntheta > cutoff)
+
197  operands_and_partials.d_x1[n] -= exp_m_ntheta;
+
198  else if (ntheta < -cutoff)
+
199  operands_and_partials.d_x1[n] += sign;
+
200  else
+
201  operands_and_partials.d_x1[n] += sign * exp_m_ntheta / (exp_m_ntheta + 1);
+
202  }
+
203  }
+
204  return operands_and_partials.to_var(logp);
+
205  }
+
206 
+
207  template <typename T_n,
+
208  typename T_prob>
+
209  inline
+ +
211  bernoulli_logit_log(const T_n& n,
+
212  const T_prob& theta) {
+
213  return bernoulli_logit_log<false>(n,theta);
+
214  }
+
215 
+
216  // Bernoulli CDF
+
217  template <typename T_n, typename T_prob>
+ +
219  bernoulli_cdf(const T_n& n, const T_prob& theta) {
+
220  static const char* function = "stan::prob::bernoulli_cdf(%1%)";
+
221 
+ + + + +
226 
+
227  // Ensure non-zero argument lenghts
+
228  if (!(stan::length(n) && stan::length(theta)))
+
229  return 1.0;
+
230 
+
231  double P(1.0);
+
232 
+
233  // Validate arguments
+
234  if (!check_finite(function, theta, "Probability parameter", &P))
+
235  return P;
+
236  if (!check_bounded(function, theta, 0.0, 1.0,
+
237  "Probability parameter", &P))
+
238  return P;
+
239  if (!(check_consistent_sizes(function,
+
240  n, theta,
+
241  "Random variable","Probability parameter",
+
242  &P)))
+
243  return P;
+
244 
+
245  // set up template expressions wrapping scalars into vector views
+
246  VectorView<const T_n> n_vec(n);
+
247  VectorView<const T_prob> theta_vec(theta);
+
248  size_t size = max_size(n, theta);
+
249 
+
250  // Compute vectorized CDF and gradient
+
251  using stan::math::value_of;
+
252  agrad::OperandsAndPartials<T_prob> operands_and_partials(theta);
+
253 
+
254  // Explicit return for extreme values
+
255  // The gradients are technically ill-defined, but treated as zero
+
256  for (size_t i = 0; i < stan::length(n); i++) {
+
257  if (value_of(n_vec[i]) < 0)
+
258  return operands_and_partials.to_var(0.0);
+
259  }
+
260 
+
261  for (size_t i = 0; i < size; i++) {
+
262 
+
263  // Explicit results for extreme values
+
264  // The gradients are technically ill-defined, but treated as zero
+
265  if (value_of(n_vec[i]) >= 1) continue;
+
266  else {
+
267  const double Pi = 1 - value_of(theta_vec[i]);
+
268 
+
269  P *= Pi;
+
270 
+ +
272  operands_and_partials.d_x1[i] += - 1 / Pi;
+
273  }
+
274  }
+
275 
+ +
277  for(size_t i = 0; i < stan::length(theta); ++i) operands_and_partials.d_x1[i] *= P;
+
278  }
+
279  return operands_and_partials.to_var(P);
+
280  }
+
281 
+
282  template <typename T_n, typename T_prob>
+ +
284  bernoulli_cdf_log(const T_n& n, const T_prob& theta) {
+
285  static const char* function = "stan::prob::bernoulli_cdf_log(%1%)";
+
286 
+ + + + +
291 
+
292  // Ensure non-zero argument lenghts
+
293  if (!(stan::length(n) && stan::length(theta)))
+
294  return 0.0;
+
295 
+
296  double P(0.0);
+
297 
+
298  // Validate arguments
+
299  if (!check_finite(function, theta, "Probability parameter", &P))
+
300  return P;
+
301  if (!check_bounded(function, theta, 0.0, 1.0,
+
302  "Probability parameter", &P))
+
303  return P;
+
304  if (!(check_consistent_sizes(function,
+
305  n, theta,
+
306  "Random variable","Probability parameter",
+
307  &P)))
+
308  return P;
+
309 
+
310  // set up template expressions wrapping scalars into vector views
+
311  VectorView<const T_n> n_vec(n);
+
312  VectorView<const T_prob> theta_vec(theta);
+
313  size_t size = max_size(n, theta);
+
314 
+
315  // Compute vectorized cdf_log and gradient
+
316  using stan::math::value_of;
+
317  agrad::OperandsAndPartials<T_prob> operands_and_partials(theta);
+
318 
+
319  // Explicit return for extreme values
+
320  // The gradients are technically ill-defined, but treated as zero
+
321  for (size_t i = 0; i < stan::length(n); i++) {
+
322  if (value_of(n_vec[i]) < 0)
+
323  return operands_and_partials.to_var(stan::math::negative_infinity());
+
324  }
+
325 
+
326  for (size_t i = 0; i < size; i++) {
+
327 
+
328  // Explicit results for extreme values
+
329  // The gradients are technically ill-defined, but treated as zero
+
330  if (value_of(n_vec[i]) >= 1) continue;
+
331  else {
+
332  const double Pi = 1 - value_of(theta_vec[i]);
+
333 
+
334  P += log(Pi);
+
335 
+ +
337  operands_and_partials.d_x1[i] -= 1 / Pi;
+
338  }
+
339  }
+
340 
+
341  return operands_and_partials.to_var(P);
+
342  }
+
343 
+
344  template <typename T_n, typename T_prob>
+ +
346  bernoulli_ccdf_log(const T_n& n, const T_prob& theta) {
+
347  static const char* function = "stan::prob::bernoulli_ccdf_log(%1%)";
+
348 
+ + + + +
353 
+
354  // Ensure non-zero argument lenghts
+
355  if (!(stan::length(n) && stan::length(theta)))
+
356  return 0.0;
+
357 
+
358  double P(0.0);
+
359 
+
360  // Validate arguments
+
361  if (!check_finite(function, theta, "Probability parameter", &P))
+
362  return P;
+
363  if (!check_bounded(function, theta, 0.0, 1.0,
+
364  "Probability parameter", &P))
+
365  return P;
+
366  if (!(check_consistent_sizes(function,
+
367  n, theta,
+
368  "Random variable","Probability parameter",
+
369  &P)))
+
370  return P;
+
371 
+
372  // set up template expressions wrapping scalars into vector views
+
373  VectorView<const T_n> n_vec(n);
+
374  VectorView<const T_prob> theta_vec(theta);
+
375  size_t size = max_size(n, theta);
+
376 
+
377  // Compute vectorized cdf_log and gradient
+
378  using stan::math::value_of;
+
379  agrad::OperandsAndPartials<T_prob> operands_and_partials(theta);
+
380 
+
381  // Explicit return for extreme values
+
382  // The gradients are technically ill-defined, but treated as zero
+
383  for (size_t i = 0; i < stan::length(n); i++) {
+
384  if (value_of(n_vec[i]) < 0)
+
385  return operands_and_partials.to_var(0.0);
+
386  }
+
387 
+
388  for (size_t i = 0; i < size; i++) {
+
389 
+
390  // Explicit results for extreme values
+
391  // The gradients are technically ill-defined, but treated as zero
+
392  if (value_of(n_vec[i]) >= 1)
+
393  return operands_and_partials.to_var(stan::math::negative_infinity());
+
394  else {
+
395  const double Pi = value_of(theta_vec[i]);
+
396 
+
397  P += log(Pi);
+
398 
+ +
400  operands_and_partials.d_x1[i] += 1 / Pi;
+
401  }
+
402  }
+
403 
+
404  return operands_and_partials.to_var(P);
+
405  }
+
406 
+
407 
+
408  template <class RNG>
+
409  inline int
+
410  bernoulli_rng(const double theta,
+
411  RNG& rng) {
+
412  using boost::variate_generator;
+
413  using boost::bernoulli_distribution;
+
414 
+
415  static const char* function = "stan::prob::bernoulli_rng(%1%)";
+
416 
+ + +
419 
+
420  if (!check_finite(function, theta, "Probability parameter"))
+
421  return 0;
+
422  if (!check_bounded(function, theta, 0.0, 1.0,
+
423  "Probability parameter"))
+
424  return 0;
+
425 
+
426  variate_generator<RNG&, bernoulli_distribution<> >
+
427  bernoulli_rng(rng, bernoulli_distribution<>(theta));
+
428  return bernoulli_rng();
+
429  }
+
430  }
+
431 }
+
432 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/beta_8hpp.html b/doc/api/html/beta_8hpp.html new file mode 100644 index 00000000000..ea523ae0b6e --- /dev/null +++ b/doc/api/html/beta_8hpp.html @@ -0,0 +1,162 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/beta.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
beta.hpp File Reference
+
+
+
#include <boost/math/special_functions/gamma.hpp>
+#include <boost/random/gamma_distribution.hpp>
+#include <boost/random/variate_generator.hpp>
+#include <stan/agrad/partials_vari.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/math/functions/log1m.hpp>
+#include <stan/math/functions/multiply_log.hpp>
+#include <stan/math/functions/value_of.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/prob/constants.hpp>
+#include <stan/prob/traits.hpp>
+#include <stan/prob/internal_math.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + + + + + + + + +

+Functions

template<bool propto, typename T_y , typename T_scale_succ , typename T_scale_fail >
return_type< T_y, T_scale_succ,
+T_scale_fail >::type 
stan::prob::beta_log (const T_y &y, const T_scale_succ &alpha, const T_scale_fail &beta)
 The log of the beta density for the specified scalar(s) given the specified sample size(s).
 
template<typename T_y , typename T_scale_succ , typename T_scale_fail >
return_type< T_y, T_scale_succ,
+T_scale_fail >::type 
stan::prob::beta_log (const T_y &y, const T_scale_succ &alpha, const T_scale_fail &beta)
 
template<typename T_y , typename T_scale_succ , typename T_scale_fail >
return_type< T_y, T_scale_succ,
+T_scale_fail >::type 
stan::prob::beta_cdf (const T_y &y, const T_scale_succ &alpha, const T_scale_fail &beta)
 Calculates the beta cumulative distribution function for the given variate and scale variables.
 
template<typename T_y , typename T_scale_succ , typename T_scale_fail >
return_type< T_y, T_scale_succ,
+T_scale_fail >::type 
stan::prob::beta_cdf_log (const T_y &y, const T_scale_succ &alpha, const T_scale_fail &beta)
 
template<typename T_y , typename T_scale_succ , typename T_scale_fail >
return_type< T_y, T_scale_succ,
+T_scale_fail >::type 
stan::prob::beta_ccdf_log (const T_y &y, const T_scale_succ &alpha, const T_scale_fail &beta)
 
template<class RNG >
double stan::prob::beta_rng (const double alpha, const double beta, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/beta_8hpp_source.html b/doc/api/html/beta_8hpp_source.html new file mode 100644 index 00000000000..41886617b70 --- /dev/null +++ b/doc/api/html/beta_8hpp_source.html @@ -0,0 +1,743 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/beta.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
beta.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS__BETA_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS__BETA_HPP__
+
3 
+
4 #include <boost/math/special_functions/gamma.hpp>
+
5 #include <boost/random/gamma_distribution.hpp>
+
6 #include <boost/random/variate_generator.hpp>
+
7 
+ + + + + +
13 #include <stan/meta/traits.hpp>
+
14 #include <stan/prob/constants.hpp>
+
15 #include <stan/prob/traits.hpp>
+ +
17 
+
18 namespace stan {
+
19 
+
20  namespace prob {
+
21 
+
43  template <bool propto,
+
44  typename T_y, typename T_scale_succ, typename T_scale_fail>
+
45  typename return_type<T_y,T_scale_succ,T_scale_fail>::type
+
46  beta_log(const T_y& y,
+
47  const T_scale_succ& alpha, const T_scale_fail& beta) {
+
48  static const char* function = "stan::prob::beta_log(%1%)";
+
49 
+ +
51  using boost::math::lgamma;
+ +
53  using stan::is_vector;
+ + + + + +
59  using stan::math::log1m;
+ + + + +
64 
+
65  // check if any vectors are zero length
+
66  if (!(stan::length(y)
+
67  && stan::length(alpha)
+
68  && stan::length(beta)))
+
69  return 0.0;
+
70 
+
71  // set up return value accumulator
+
72  double logp(0.0);
+
73 
+
74  // validate args (here done over var, which should be OK)
+
75  if (!check_finite(function, alpha, "First shape parameter", &logp))
+
76  return logp;
+
77  if (!check_positive(function, alpha, "First shape parameter", &logp))
+
78  return logp;
+
79  if (!check_finite(function, beta, "Second shape parameter", &logp))
+
80  return logp;
+
81  if (!check_positive(function, beta, "Second shape parameter", &logp))
+
82  return logp;
+
83  if (!check_not_nan(function, y, "Random variable", &logp))
+
84  return logp;
+
85  if (!(check_consistent_sizes(function,
+
86  y,alpha,beta,
+
87  "Random variable","First shape parameter",
+
88  "Second shape parameter",
+
89  &logp)))
+
90  return logp;
+
91  if (!check_nonnegative(function, y, "Random variable", &logp))
+
92  return logp;
+
93  if (!check_less_or_equal(function, y, 1,"Random variable", &logp))
+
94  return logp;
+
95 
+
96  // check if no variables are involved and prop-to
+ +
98  return 0.0;
+
99 
+
100  VectorView<const T_y> y_vec(y);
+
101  VectorView<const T_scale_succ> alpha_vec(alpha);
+
102  VectorView<const T_scale_fail> beta_vec(beta);
+
103  size_t N = max_size(y, alpha, beta);
+
104 
+
105  for (size_t n = 0; n < N; n++) {
+
106  const double y_dbl = value_of(y_vec[n]);
+
107  if (y_dbl < 0 || y_dbl > 1)
+
108  return LOG_ZERO;
+
109  }
+
110 
+
111  // set up template expressions wrapping scalars into vector views
+ +
113  operands_and_partials(y, alpha, beta);
+
114 
+ +
116  is_vector<T_y>::value> log_y(length(y));
+ +
118  is_vector<T_y>::value> log1m_y(length(y));
+
119 
+
120  for (size_t n = 0; n < length(y); n++) {
+ +
122  log_y[n] = log(value_of(y_vec[n]));
+ +
124  log1m_y[n] = log1m(value_of(y_vec[n]));
+
125  }
+
126 
+ +
128  is_vector<T_scale_succ>::value> lgamma_alpha(length(alpha));
+ +
130  is_vector<T_scale_succ>::value> digamma_alpha(length(alpha));
+
131  for (size_t n = 0; n < length(alpha); n++) {
+ +
133  lgamma_alpha[n] = lgamma(value_of(alpha_vec[n]));
+ +
135  digamma_alpha[n] = digamma(value_of(alpha_vec[n]));
+
136  }
+
137 
+ +
139  is_vector<T_scale_fail>::value> lgamma_beta(length(beta));
+ +
141  is_vector<T_scale_fail>::value> digamma_beta(length(beta));
+
142 
+
143  for (size_t n = 0; n < length(beta); n++) {
+ +
145  lgamma_beta[n] = lgamma(value_of(beta_vec[n]));
+ +
147  digamma_beta[n] = digamma(value_of(beta_vec[n]));
+
148  }
+
149 
+ + + +
153  lgamma_alpha_beta(max_size(alpha,beta));
+
154 
+ + + + +
159  digamma_alpha_beta(max_size(alpha,beta));
+
160 
+
161  for (size_t n = 0; n < max_size(alpha,beta); n++) {
+
162  const double alpha_beta = value_of(alpha_vec[n])
+
163  + value_of(beta_vec[n]);
+ +
165  lgamma_alpha_beta[n] = lgamma(alpha_beta);
+ + +
168  digamma_alpha_beta[n] = digamma(alpha_beta);
+
169  }
+
170 
+
171  for (size_t n = 0; n < N; n++) {
+
172  // pull out values of arguments
+
173  const double y_dbl = value_of(y_vec[n]);
+
174  const double alpha_dbl = value_of(alpha_vec[n]);
+
175  const double beta_dbl = value_of(beta_vec[n]);
+
176 
+
177  // log probability
+ +
179  logp += lgamma_alpha_beta[n];
+ +
181  logp -= lgamma_alpha[n];
+ +
183  logp -= lgamma_beta[n];
+ +
185  logp += (alpha_dbl-1.0) * log_y[n];
+ +
187  logp += (beta_dbl-1.0) * log1m_y[n];
+
188 
+
189  // gradients
+ +
191  operands_and_partials.d_x1[n] += (alpha_dbl-1)/y_dbl
+
192  + (beta_dbl-1)/(y_dbl-1);
+ +
194  operands_and_partials.d_x2[n]
+
195  += log_y[n] + digamma_alpha_beta[n] - digamma_alpha[n];
+ +
197  operands_and_partials.d_x3[n]
+
198  += log1m_y[n] + digamma_alpha_beta[n] - digamma_beta[n];
+
199  }
+
200  return operands_and_partials.to_var(logp);
+
201  }
+
202 
+
203  template <typename T_y, typename T_scale_succ, typename T_scale_fail>
+ +
205  beta_log(const T_y& y, const T_scale_succ& alpha,
+
206  const T_scale_fail& beta) {
+
207  return beta_log<false>(y,alpha,beta);
+
208  }
+
209 
+
222  template <typename T_y, typename T_scale_succ, typename T_scale_fail>
+ +
224  beta_cdf(const T_y& y, const T_scale_succ& alpha,
+
225  const T_scale_fail& beta) {
+
226 
+
227  // Size checks
+
228  if ( !( stan::length(y) && stan::length(alpha)
+
229  && stan::length(beta) ) )
+
230  return 1.0;
+
231 
+
232  // Error checks
+
233  static const char* function = "stan::prob::beta_cdf(%1%)";
+
234 
+ + + +
238  using boost::math::tools::promote_args;
+ +
240  using stan::math::value_of;
+ + +
243 
+
244  double P(1.0);
+
245 
+
246  if (!check_finite(function, alpha, "First shape parameter", &P))
+
247  return P;
+
248  if (!check_positive(function, alpha, "First shape parameter", &P))
+
249  return P;
+
250  if (!check_finite(function, beta, "Second shape parameter", &P))
+
251  return P;
+
252  if (!check_positive(function, beta, "Second shape parameter", &P))
+
253  return P;
+
254  if (!check_not_nan(function, y, "Random variable", &P))
+
255  return P;
+
256  if (!(check_consistent_sizes(function, y, alpha, beta,
+
257  "Random variable", "Shape parameter",
+
258  "Scale Parameter", &P)))
+
259  return P;
+
260  if (!check_nonnegative(function, y, "Random variable", &P))
+
261  return P;
+
262  if (!check_less_or_equal(function, y, 1,"Random variable", &P))
+
263  return P;
+
264 
+
265  // Wrap arguments in vectors
+
266  VectorView<const T_y> y_vec(y);
+
267  VectorView<const T_scale_succ> alpha_vec(alpha);
+
268  VectorView<const T_scale_fail> beta_vec(beta);
+
269  size_t N = max_size(y, alpha, beta);
+
270 
+ +
272  operands_and_partials(y, alpha, beta);
+
273 
+
274  // Explicit return for extreme values
+
275  // The gradients are technically ill-defined, but treated as zero
+
276  for (size_t i = 0; i < stan::length(y); i++) {
+
277  if (value_of(y_vec[i]) <= 0)
+
278  return operands_and_partials.to_var(0.0);
+
279  }
+
280 
+
281  // Compute CDF and its gradients
+
282  using boost::math::ibeta;
+
283  using boost::math::ibeta_derivative;
+
284  using boost::math::digamma;
+
285 
+
286  // Cache a few expensive function calls if alpha or beta is a parameter
+ + + +
290  digamma_alpha_vec(max_size(alpha, beta));
+
291 
+ + + +
295  digamma_beta_vec(max_size(alpha, beta));
+
296 
+ + + +
300  digamma_sum_vec(max_size(alpha, beta));
+
301 
+ + + +
305  betafunc_vec(max_size(alpha, beta));
+
306 
+ + +
309 
+
310  for (size_t i = 0; i < N; i++) {
+
311 
+
312  const double alpha_dbl = value_of(alpha_vec[i]);
+
313  const double beta_dbl = value_of(beta_vec[i]);
+
314 
+
315  digamma_alpha_vec[i] = digamma(alpha_dbl);
+
316  digamma_beta_vec[i] = digamma(beta_dbl);
+
317  digamma_sum_vec[i] = digamma(alpha_dbl + beta_dbl);
+
318  betafunc_vec[i] = boost::math::beta(alpha_dbl, beta_dbl);
+
319 
+
320  }
+
321 
+
322  }
+
323 
+
324  // Compute vectorized CDF and gradient
+
325  for (size_t n = 0; n < N; n++) {
+
326 
+
327  // Explicit results for extreme values
+
328  // The gradients are technically ill-defined, but treated as zero
+
329  if (value_of(y_vec[n]) >= 1.0) continue;
+
330 
+
331  // Pull out values
+
332  const double y_dbl = value_of(y_vec[n]);
+
333  const double alpha_dbl = value_of(alpha_vec[n]);
+
334  const double beta_dbl = value_of(beta_vec[n]);
+
335 
+
336  // Compute
+
337  const double Pn = ibeta(alpha_dbl, beta_dbl, y_dbl);
+
338 
+
339  P *= Pn;
+
340 
+ +
342  operands_and_partials.d_x1[n] += ibeta_derivative(alpha_dbl, beta_dbl,
+
343  y_dbl) / Pn;
+
344 
+
345  double g1 = 0;
+
346  double g2 = 0;
+
347 
+ + +
350  stan::math::gradRegIncBeta(g1, g2, alpha_dbl, beta_dbl, y_dbl,
+
351  digamma_alpha_vec[n],
+
352  digamma_beta_vec[n], digamma_sum_vec[n],
+
353  betafunc_vec[n]);
+
354  }
+
355 
+ +
357  operands_and_partials.d_x2[n] += g1 / Pn;
+ +
359  operands_and_partials.d_x3[n] += g2 / Pn;
+
360  }
+
361 
+ +
363  for(size_t n = 0; n < stan::length(y); ++n)
+
364  operands_and_partials.d_x1[n] *= P;
+
365  }
+ +
367  for(size_t n = 0; n < stan::length(alpha); ++n)
+
368  operands_and_partials.d_x2[n] *= P;
+
369  }
+ +
371  for(size_t n = 0; n < stan::length(beta); ++n)
+
372  operands_and_partials.d_x3[n] *= P;
+
373  }
+
374 
+
375  return operands_and_partials.to_var(P);
+
376  }
+
377 
+
378  template <typename T_y, typename T_scale_succ, typename T_scale_fail>
+ +
380  beta_cdf_log(const T_y& y, const T_scale_succ& alpha,
+
381  const T_scale_fail& beta) {
+
382 
+
383  // Size checks
+
384  if ( !( stan::length(y) && stan::length(alpha)
+
385  && stan::length(beta) ) )
+
386  return 0.0;
+
387 
+
388  // Error checks
+
389  static const char* function = "stan::prob::beta_cdf(%1%)";
+
390 
+ + + + + +
396  using boost::math::tools::promote_args;
+ +
398  using stan::math::value_of;
+
399 
+
400  double cdf_log(0.0);
+
401 
+
402  if (!check_finite(function, alpha, "First shape parameter", &cdf_log))
+
403  return cdf_log;
+
404  if (!check_positive(function, alpha, "First shape parameter", &cdf_log))
+
405  return cdf_log;
+
406  if (!check_finite(function, beta, "Second shape parameter", &cdf_log))
+
407  return cdf_log;
+
408  if (!check_positive(function, beta, "Second shape parameter", &cdf_log))
+
409  return cdf_log;
+
410  if (!check_not_nan(function, y, "Random variable", &cdf_log))
+
411  return cdf_log;
+
412  if (!check_nonnegative(function, y, "Random variable", &cdf_log))
+
413  return cdf_log;
+
414  if (!check_less_or_equal(function, y, 1,"Random variable", &cdf_log))
+
415  return cdf_log;
+
416  if (!(check_consistent_sizes(function, y, alpha, beta,
+
417  "Random variable", "Shape parameter",
+
418  "Scale Parameter", &cdf_log)))
+
419  return cdf_log;
+
420 
+
421  // Wrap arguments in vectors
+
422  VectorView<const T_y> y_vec(y);
+
423  VectorView<const T_scale_succ> alpha_vec(alpha);
+
424  VectorView<const T_scale_fail> beta_vec(beta);
+
425  size_t N = max_size(y, alpha, beta);
+
426 
+ +
428  operands_and_partials(y, alpha, beta);
+
429 
+
430  // Compute CDF and its gradients
+
431  using boost::math::ibeta;
+
432  using boost::math::ibeta_derivative;
+
433  using boost::math::digamma;
+
434 
+
435  // Cache a few expensive function calls if alpha or beta is a parameter
+ + + +
439  digamma_alpha_vec(max_size(alpha, beta));
+
440 
+ + + +
444  digamma_beta_vec(max_size(alpha, beta));
+
445 
+ + + +
449  digamma_sum_vec(max_size(alpha, beta));
+
450 
+ + + +
454  betafunc_vec(max_size(alpha, beta));
+
455 
+ + +
458 
+
459  for (size_t i = 0; i < N; i++) {
+
460 
+
461  const double alpha_dbl = value_of(alpha_vec[i]);
+
462  const double beta_dbl = value_of(beta_vec[i]);
+
463 
+
464  digamma_alpha_vec[i] = digamma(alpha_dbl);
+
465  digamma_beta_vec[i] = digamma(beta_dbl);
+
466  digamma_sum_vec[i] = digamma(alpha_dbl + beta_dbl);
+
467  betafunc_vec[i] = boost::math::beta(alpha_dbl, beta_dbl);
+
468  }
+
469  }
+
470 
+
471  // Compute vectorized CDFLog and gradient
+
472  for (size_t n = 0; n < N; n++) {
+
473 
+
474  // Pull out values
+
475  const double y_dbl = value_of(y_vec[n]);
+
476  const double alpha_dbl = value_of(alpha_vec[n]);
+
477  const double beta_dbl = value_of(beta_vec[n]);
+
478 
+
479  // Compute
+
480  const double Pn = ibeta(alpha_dbl, beta_dbl, y_dbl);
+
481 
+
482  cdf_log += log(Pn);
+
483 
+ +
485  operands_and_partials.d_x1[n] +=
+
486  ibeta_derivative(alpha_dbl, beta_dbl, y_dbl) / Pn;
+
487 
+
488  double g1 = 0;
+
489  double g2 = 0;
+
490 
+ + +
493  stan::math::gradRegIncBeta(g1, g2, alpha_dbl, beta_dbl, y_dbl,
+
494  digamma_alpha_vec[n],
+
495  digamma_beta_vec[n], digamma_sum_vec[n],
+
496  betafunc_vec[n]);
+
497  }
+ +
499  operands_and_partials.d_x2[n] += g1 / Pn;
+ +
501  operands_and_partials.d_x3[n] += g2 / Pn;
+
502  }
+
503 
+
504  return operands_and_partials.to_var(cdf_log);
+
505  }
+
506 
+
507  template <typename T_y, typename T_scale_succ, typename T_scale_fail>
+ +
509  beta_ccdf_log(const T_y& y, const T_scale_succ& alpha,
+
510  const T_scale_fail& beta) {
+
511 
+
512  // Size checks
+
513  if ( !( stan::length(y) && stan::length(alpha)
+
514  && stan::length(beta) ) )
+
515  return 0.0;
+
516 
+
517  // Error checks
+
518  static const char* function = "stan::prob::beta_cdf(%1%)";
+
519 
+ + + + + +
525  using boost::math::tools::promote_args;
+ +
527  using stan::math::value_of;
+
528 
+
529  double ccdf_log(0.0);
+
530 
+
531  if (!check_finite(function, alpha, "First shape parameter", &ccdf_log))
+
532  return ccdf_log;
+
533  if (!check_positive(function, alpha, "First shape parameter", &ccdf_log))
+
534  return ccdf_log;
+
535  if (!check_finite(function, beta, "Second shape parameter", &ccdf_log))
+
536  return ccdf_log;
+
537  if (!check_positive(function, beta, "Second shape parameter", &ccdf_log))
+
538  return ccdf_log;
+
539  if (!check_not_nan(function, y, "Random variable", &ccdf_log))
+
540  return ccdf_log;
+
541  if (!check_nonnegative(function, y, "Random variable", &ccdf_log))
+
542  return ccdf_log;
+
543  if (!check_less_or_equal(function, y, 1,"Random variable", &ccdf_log))
+
544  return ccdf_log;
+
545  if (!(check_consistent_sizes(function, y, alpha, beta,
+
546  "Random variable", "Shape parameter",
+
547  "Scale Parameter", &ccdf_log)))
+
548  return ccdf_log;
+
549 
+
550  // Wrap arguments in vectors
+
551  VectorView<const T_y> y_vec(y);
+
552  VectorView<const T_scale_succ> alpha_vec(alpha);
+
553  VectorView<const T_scale_fail> beta_vec(beta);
+
554  size_t N = max_size(y, alpha, beta);
+
555 
+ +
557  operands_and_partials(y, alpha, beta);
+
558 
+
559  // Compute CDF and its gradients
+
560  using boost::math::ibeta;
+
561  using boost::math::ibeta_derivative;
+
562  using boost::math::digamma;
+
563 
+
564  // Cache a few expensive function calls if alpha or beta is a parameter
+ + + +
568  digamma_alpha_vec(max_size(alpha, beta));
+ + + +
572  digamma_beta_vec(max_size(alpha, beta));
+ + + +
576  digamma_sum_vec(max_size(alpha, beta));
+ + + +
580  betafunc_vec(max_size(alpha, beta));
+
581 
+ + +
584 
+
585  for (size_t i = 0; i < N; i++) {
+
586 
+
587  const double alpha_dbl = value_of(alpha_vec[i]);
+
588  const double beta_dbl = value_of(beta_vec[i]);
+
589 
+
590  digamma_alpha_vec[i] = digamma(alpha_dbl);
+
591  digamma_beta_vec[i] = digamma(beta_dbl);
+
592  digamma_sum_vec[i] = digamma(alpha_dbl + beta_dbl);
+
593  betafunc_vec[i] = boost::math::beta(alpha_dbl, beta_dbl);
+
594  }
+
595  }
+
596 
+
597  // Compute vectorized CDFLog and gradient
+
598  for (size_t n = 0; n < N; n++) {
+
599 
+
600  // Pull out values
+
601  const double y_dbl = value_of(y_vec[n]);
+
602  const double alpha_dbl = value_of(alpha_vec[n]);
+
603  const double beta_dbl = value_of(beta_vec[n]);
+
604 
+
605  // Compute
+
606  const double Pn = 1.0 - ibeta(alpha_dbl, beta_dbl, y_dbl);
+
607 
+
608  ccdf_log += log(Pn);
+
609 
+ +
611  operands_and_partials.d_x1[n] -=
+
612  ibeta_derivative(alpha_dbl, beta_dbl, y_dbl) / Pn;
+
613 
+
614  double g1 = 0;
+
615  double g2 = 0;
+
616 
+ + +
619  stan::math::gradRegIncBeta(g1, g2, alpha_dbl, beta_dbl, y_dbl,
+
620  digamma_alpha_vec[n],
+
621  digamma_beta_vec[n], digamma_sum_vec[n],
+
622  betafunc_vec[n]);
+
623  }
+ +
625  operands_and_partials.d_x2[n] -= g1 / Pn;
+ +
627  operands_and_partials.d_x3[n] -= g2 / Pn;
+
628  }
+
629 
+
630  return operands_and_partials.to_var(ccdf_log);
+
631  }
+
632 
+
633  template <class RNG>
+
634  inline double
+
635  beta_rng(const double alpha,
+
636  const double beta,
+
637  RNG& rng) {
+
638  using boost::variate_generator;
+
639  using boost::random::gamma_distribution;
+
640  // Error checks
+
641  static const char* function = "stan::prob::beta_rng(%1%)";
+
642 
+ + + + + +
648 
+
649  if (!check_finite(function, alpha, "First shape parameter"))
+
650  return 0;
+
651  if (!check_positive(function, alpha, "First shape parameter"))
+
652  return 0;
+
653  if (!check_finite(function, beta, "Second shape parameter"))
+
654  return 0;
+
655  if (!check_positive(function, beta, "Second shape parameter"))
+
656  return 0;
+
657 
+
658  variate_generator<RNG&, gamma_distribution<> >
+
659  rng_gamma_alpha(rng, gamma_distribution<>(alpha, 1.0));
+
660  variate_generator<RNG&, gamma_distribution<> >
+
661  rng_gamma_beta(rng, gamma_distribution<>(beta, 1.0));
+
662  double a = rng_gamma_alpha();
+
663  double b = rng_gamma_beta();
+
664  return a / (a + b);
+
665  }
+
666 
+
667  }
+
668 }
+
669 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/beta__binomial_8hpp.html b/doc/api/html/beta__binomial_8hpp.html new file mode 100644 index 00000000000..0e869726efe --- /dev/null +++ b/doc/api/html/beta__binomial_8hpp.html @@ -0,0 +1,160 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/discrete/beta_binomial.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
beta_binomial.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + + + + + + +

+Functions

template<bool propto, typename T_n , typename T_N , typename T_size1 , typename T_size2 >
return_type< T_size1, T_size2 >
+::type 
stan::prob::beta_binomial_log (const T_n &n, const T_N &N, const T_size1 &alpha, const T_size2 &beta)
 
template<typename T_n , typename T_N , typename T_size1 , typename T_size2 >
return_type< T_size1, T_size2 >
+::type 
stan::prob::beta_binomial_log (const T_n &n, const T_N &N, const T_size1 &alpha, const T_size2 &beta)
 
template<typename T_n , typename T_N , typename T_size1 , typename T_size2 >
return_type< T_size1, T_size2 >
+::type 
stan::prob::beta_binomial_cdf (const T_n &n, const T_N &N, const T_size1 &alpha, const T_size2 &beta)
 
template<typename T_n , typename T_N , typename T_size1 , typename T_size2 >
return_type< T_size1, T_size2 >
+::type 
stan::prob::beta_binomial_cdf_log (const T_n &n, const T_N &N, const T_size1 &alpha, const T_size2 &beta)
 
template<typename T_n , typename T_N , typename T_size1 , typename T_size2 >
return_type< T_size1, T_size2 >
+::type 
stan::prob::beta_binomial_ccdf_log (const T_n &n, const T_N &N, const T_size1 &alpha, const T_size2 &beta)
 
template<class RNG >
int stan::prob::beta_binomial_rng (const int N, const double alpha, const double beta, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/beta__binomial_8hpp_source.html b/doc/api/html/beta__binomial_8hpp_source.html new file mode 100644 index 00000000000..2b23fd8dd51 --- /dev/null +++ b/doc/api/html/beta__binomial_8hpp_source.html @@ -0,0 +1,708 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/discrete/beta_binomial.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
beta_binomial.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__DISCRETE__BETA_BINOMIAL_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__DISCRETE__BETA_BINOMIAL_HPP__
+
3 
+ + +
6 
+ + + + + +
12 #include <stan/meta/traits.hpp>
+
13 #include <stan/prob/traits.hpp>
+
14 #include <stan/prob/constants.hpp>
+ +
16 
+ +
18 
+
19 namespace stan {
+
20 
+
21  namespace prob {
+
22 
+
23  // BetaBinomial(n|alpha,beta) [alpha > 0; beta > 0; n >= 0]
+
24  template <bool propto,
+
25  typename T_n, typename T_N,
+
26  typename T_size1, typename T_size2>
+
27  typename return_type<T_size1,T_size2>::type
+
28  beta_binomial_log(const T_n& n,
+
29  const T_N& N,
+
30  const T_size1& alpha,
+
31  const T_size2& beta) {
+
32  static const char* function = "stan::prob::beta_binomial_log(%1%)";
+
33 
+ + + + + + +
40 
+
41  // check if any vectors are zero length
+
42  if (!(stan::length(n)
+
43  && stan::length(N)
+
44  && stan::length(alpha)
+
45  && stan::length(beta)))
+
46  return 0.0;
+
47 
+
48  double logp(0.0);
+
49  if (!check_nonnegative(function, N, "Population size parameter", &logp))
+
50  return logp;
+
51  if (!check_finite(function, alpha, "First prior sample size parameter", &logp))
+
52  return logp;
+
53  if (!check_positive(function, alpha, "First prior sample size parameter", &logp))
+
54  return logp;
+
55  if (!check_finite(function, beta, "Second prior sample size parameter", &logp))
+
56  return logp;
+
57  if (!check_positive(function, beta, "Second prior sample size parameter", &logp))
+
58  return logp;
+
59  if (!(check_consistent_sizes(function,
+
60  n,N,alpha,beta,
+
61  "Successes variable",
+
62  "Population size parameter",
+
63  "First prior sample size parameter",
+
64  "Second prior sample size parameter",
+
65  &logp)))
+
66  return logp;
+
67 
+
68  // check if no variables are involved and prop-to
+ +
70  return 0.0;
+
71 
+
72  VectorView<const T_n> n_vec(n);
+
73  VectorView<const T_N> N_vec(N);
+
74  VectorView<const T_size1> alpha_vec(alpha);
+
75  VectorView<const T_size2> beta_vec(beta);
+
76  size_t size = max_size(n, N, alpha, beta);
+
77 
+
78  for (size_t i = 0; i < size; i++) {
+
79  if (n_vec[i] < 0 || n_vec[i] > N_vec[i])
+
80  return LOG_ZERO;
+
81  }
+
82 
+
83  using stan::math::lbeta;
+ + +
86 
+ + +
89  normalizing_constant(max_size(N,n));
+
90  for (size_t i = 0; i < max_size(N,n); i++)
+ +
92  normalizing_constant[i]
+
93  = binomial_coefficient_log(N_vec[i],n_vec[i]);
+
94 
+ + + +
98  lbeta_numerator(size);
+
99  for (size_t i = 0; i < size; i++)
+ +
101  lbeta_numerator[i] = lbeta(n_vec[i] + value_of(alpha_vec[i]),
+
102  N_vec[i] - n_vec[i]
+
103  + value_of(beta_vec[i]));
+ + +
106  lbeta_denominator(max_size(alpha,beta));
+
107 for (size_t i = 0; i < max_size(alpha,beta); i++)
+ +
109  lbeta_denominator[i] = lbeta(value_of(alpha_vec[i]),
+
110  value_of(beta_vec[i]));
+
111 
+ + +
114  digamma_n_plus_alpha(max_size(n,alpha));
+
115  for (size_t i = 0; i < max_size(n,alpha); i++)
+ +
117  digamma_n_plus_alpha[i]
+
118  = digamma(n_vec[i] + value_of(alpha_vec[i]));
+
119 
+ + + + + +
125  digamma_N_plus_alpha_plus_beta(max_size(N,alpha,beta));
+
126  for (size_t i = 0; i < max_size(N,alpha,beta); i++)
+ + +
129  digamma_N_plus_alpha_plus_beta[i]
+
130  = digamma(N_vec[i] + value_of(alpha_vec[i]) + value_of(beta_vec[i]));
+
131 
+ + + + +
136  digamma_alpha_plus_beta(max_size(alpha,beta));
+
137  for (size_t i = 0; i < max_size(alpha,beta); i++)
+ + +
140  digamma_alpha_plus_beta[i]
+
141  = digamma(value_of(alpha_vec[i]) + value_of(beta_vec[i]));
+
142 
+ + +
145  digamma_alpha(length(alpha));
+
146  for (size_t i = 0; i < length(alpha); i++)
+ +
148  digamma_alpha[i] = digamma(value_of(alpha_vec[i]));
+
149 
+ + +
152  digamma_beta(length(beta));
+
153  for (size_t i = 0; i < length(beta); i++)
+ +
155  digamma_beta[i] = digamma(value_of(beta_vec[i]));
+
156 
+ +
158  operands_and_partials(n,N,alpha,beta);
+
159  for (size_t i = 0; i < size; i++) {
+ +
161  logp += normalizing_constant[i];
+ +
163  logp += lbeta_numerator[i]
+
164  - lbeta_denominator[i];
+
165 
+ +
167  operands_and_partials.d_x3[i]
+
168  += digamma_n_plus_alpha[i]
+
169  - digamma_N_plus_alpha_plus_beta[i]
+
170  + digamma_alpha_plus_beta[i]
+
171  - digamma_alpha[i];
+ +
173  operands_and_partials.d_x4[i]
+
174  += digamma(value_of(N_vec[i]-n_vec[i]+beta_vec[i]))
+
175  - digamma_N_plus_alpha_plus_beta[i]
+
176  + digamma_alpha_plus_beta[i]
+
177  - digamma_beta[i];
+
178  }
+
179  return operands_and_partials.to_var(logp);
+
180  }
+
181 
+
182  template <typename T_n,
+
183  typename T_N,
+
184  typename T_size1,
+
185  typename T_size2>
+ +
187  beta_binomial_log(const T_n& n, const T_N& N,
+
188  const T_size1& alpha, const T_size2& beta) {
+
189  return beta_binomial_log<false>(n,N,alpha,beta);
+
190  }
+
191 
+
192  // Beta-Binomial CDF
+
193  template <typename T_n, typename T_N,
+
194  typename T_size1, typename T_size2>
+ +
196  beta_binomial_cdf(const T_n& n, const T_N& N, const T_size1& alpha,
+
197  const T_size2& beta) {
+
198 
+
199  static const char* function = "stan::prob::beta_binomial_cdf(%1%)";
+
200 
+ + + +
204  using stan::math::value_of;
+ + +
207 
+
208  // Ensure non-zero argument lengths
+
209  if (!(stan::length(n) && stan::length(N) && stan::length(alpha)
+
210  && stan::length(beta)))
+
211  return 1.0;
+
212 
+
213  double P(1.0);
+
214 
+
215  // Validate arguments
+
216  if (!check_nonnegative(function, N, "Population size parameter", &P))
+
217  return P;
+
218 
+
219  if (!check_finite(function, alpha, "First prior sample size parameter", &P))
+
220  return P;
+
221 
+
222  if (!check_positive(function, alpha, "First prior sample size parameter", &P))
+
223  return P;
+
224 
+
225  if (!check_finite(function, beta, "Second prior sample size parameter", &P))
+
226  return P;
+
227 
+
228  if (!check_positive(function, beta, "Second prior sample size parameter", &P))
+
229  return P;
+
230 
+
231  if (!(check_consistent_sizes(function,
+
232  n, N, alpha, beta,
+
233  "Successes variable",
+
234  "Population size parameter",
+
235  "First prior sample size parameter",
+
236  "Second prior sample size parameter",
+
237  &P)))
+
238  return P;
+
239 
+
240  // Wrap arguments in vector views
+
241  VectorView<const T_n> n_vec(n);
+
242  VectorView<const T_N> N_vec(N);
+
243  VectorView<const T_size1> alpha_vec(alpha);
+
244  VectorView<const T_size2> beta_vec(beta);
+
245  size_t size = max_size(n, N, alpha, beta);
+
246 
+
247  // Compute vectorized CDF and gradient
+
248  using boost::math::lgamma;
+
249  using boost::math::digamma;
+
250 
+ +
252  operands_and_partials(alpha, beta);
+
253 
+
254  // Explicit return for extreme values
+
255  // The gradients are technically ill-defined, but treated as zero
+
256  for (size_t i = 0; i < stan::length(n); i++) {
+
257  if (value_of(n_vec[i]) <= 0)
+
258  return operands_and_partials.to_var(0.0);
+
259  }
+
260 
+
261  for (size_t i = 0; i < size; i++) {
+
262  // Explicit results for extreme values
+
263  // The gradients are technically ill-defined, but treated as zero
+
264  if (value_of(n_vec[i]) >= value_of(N_vec[i])) {
+
265  continue;
+
266  }
+
267 
+
268  const double n_dbl = value_of(n_vec[i]);
+
269  const double N_dbl = value_of(N_vec[i]);
+
270  const double alpha_dbl = value_of(alpha_vec[i]);
+
271  const double beta_dbl = value_of(beta_vec[i]);
+
272 
+
273  const double mu = alpha_dbl + n_dbl + 1;
+
274  const double nu = beta_dbl + N_dbl - n_dbl - 1;
+
275 
+
276  const double F = stan::math::F32(1, mu, -N_dbl + n_dbl + 1, n_dbl + 2,
+
277  1 - nu, 1);
+
278 
+
279  double C = lgamma(nu) - lgamma(N_dbl - n_dbl);
+
280  C += lgamma(mu) - lgamma(n_dbl + 2);
+
281  C += lgamma(N_dbl + 2) - lgamma(N_dbl + alpha_dbl + beta_dbl);
+
282  C = std::exp(C);
+
283 
+
284  C *= F / boost::math::beta(alpha_dbl, beta_dbl);
+
285  C /= N_dbl + 1;
+
286 
+
287  const double Pi = 1 - C;
+
288 
+
289  P *= Pi;
+
290 
+
291  double dF[6];
+
292  double digammaOne = 0;
+
293  double digammaTwo = 0;
+
294 
+ + +
297  digammaOne = digamma(mu + nu);
+
298  digammaTwo = digamma(alpha_dbl + beta_dbl);
+
299  stan::math::gradF32(dF, 1, mu, -N_dbl + n_dbl + 1, n_dbl + 2,
+
300  1 - nu, 1);
+
301  }
+ +
303  const double g
+
304  = - C * (digamma(mu) - digammaOne + dF[1] / F
+
305  - digamma(alpha_dbl) + digammaTwo);
+
306  operands_and_partials.d_x1[i]
+
307  += g / Pi;
+
308  }
+ +
310  const double g
+
311  = - C * (digamma(nu) - digammaOne - dF[4] / F - digamma(beta_dbl)
+
312  + digammaTwo);
+
313  operands_and_partials.d_x2[i]
+
314  += g / Pi;
+
315  }
+
316  }
+
317 
+ +
319  for(size_t i = 0; i < stan::length(alpha); ++i)
+
320  operands_and_partials.d_x1[i] *= P;
+ +
322  for(size_t i = 0; i < stan::length(beta); ++i)
+
323  operands_and_partials.d_x2[i] *= P;
+
324 
+
325  return operands_and_partials.to_var(P);
+
326  }
+
327 
+
328  template <typename T_n, typename T_N,
+
329  typename T_size1, typename T_size2>
+ +
331  beta_binomial_cdf_log(const T_n& n, const T_N& N, const T_size1& alpha,
+
332  const T_size2& beta) {
+
333 
+
334  static const char* function = "stan::prob::beta_binomial_cdf_log(%1%)";
+
335 
+ + + +
339  using stan::math::value_of;
+ + +
342 
+
343  // Ensure non-zero argument lengths
+
344  if (!(stan::length(n) && stan::length(N) && stan::length(alpha)
+
345  && stan::length(beta)))
+
346  return 0.0;
+
347 
+
348  double P(0.0);
+
349 
+
350  // Validate arguments
+
351  if (!check_nonnegative(function, N, "Population size parameter", &P))
+
352  return P;
+
353  if (!check_finite(function, alpha, "First prior sample size parameter", &P))
+
354  return P;
+
355  if (!check_positive(function, alpha, "First prior sample size parameter", &P))
+
356  return P;
+
357  if (!check_finite(function, beta, "Second prior sample size parameter", &P))
+
358  return P;
+
359  if (!check_positive(function, beta, "Second prior sample size parameter", &P))
+
360  return P;
+
361  if (!(check_consistent_sizes(function,
+
362  n, N, alpha, beta,
+
363  "Successes variable",
+
364  "Population size parameter",
+
365  "First prior sample size parameter",
+
366  "Second prior sample size parameter",
+
367  &P)))
+
368  return P;
+
369 
+
370  // Wrap arguments in vector views
+
371  VectorView<const T_n> n_vec(n);
+
372  VectorView<const T_N> N_vec(N);
+
373  VectorView<const T_size1> alpha_vec(alpha);
+
374  VectorView<const T_size2> beta_vec(beta);
+
375  size_t size = max_size(n, N, alpha, beta);
+
376 
+
377  // Compute vectorized cdf_log and gradient
+
378  using boost::math::lgamma;
+
379  using boost::math::digamma;
+
380 
+ +
382  operands_and_partials(alpha, beta);
+
383 
+
384  // Explicit return for extreme values
+
385  // The gradients are technically ill-defined, but treated as neg infinity
+
386  for (size_t i = 0; i < stan::length(n); i++) {
+
387  if (value_of(n_vec[i]) <= 0)
+
388  return operands_and_partials.to_var(stan::math::negative_infinity());
+
389  }
+
390 
+
391  for (size_t i = 0; i < size; i++) {
+
392  // Explicit results for extreme values
+
393  // The gradients are technically ill-defined, but treated as zero
+
394  if (value_of(n_vec[i]) >= value_of(N_vec[i])) {
+
395  continue;
+
396  }
+
397 
+
398  const double n_dbl = value_of(n_vec[i]);
+
399  const double N_dbl = value_of(N_vec[i]);
+
400  const double alpha_dbl = value_of(alpha_vec[i]);
+
401  const double beta_dbl = value_of(beta_vec[i]);
+
402 
+
403  const double mu = alpha_dbl + n_dbl + 1;
+
404  const double nu = beta_dbl + N_dbl - n_dbl - 1;
+
405 
+
406  const double F = stan::math::F32(1, mu, -N_dbl + n_dbl + 1, n_dbl + 2,
+
407  1 - nu, 1);
+
408 
+
409  double C = lgamma(nu) - lgamma(N_dbl - n_dbl);
+
410  C += lgamma(mu) - lgamma(n_dbl + 2);
+
411  C += lgamma(N_dbl + 2) - lgamma(N_dbl + alpha_dbl + beta_dbl);
+
412  C = std::exp(C);
+
413 
+
414  C *= F / boost::math::beta(alpha_dbl, beta_dbl);
+
415  C /= N_dbl + 1;
+
416 
+
417  const double Pi = 1 - C;
+
418 
+
419  P += log(Pi);
+
420 
+
421  double dF[6];
+
422  double digammaOne = 0;
+
423  double digammaTwo = 0;
+
424 
+ + +
427  digammaOne = digamma(mu + nu);
+
428  digammaTwo = digamma(alpha_dbl + beta_dbl);
+
429  stan::math::gradF32(dF, 1, mu, -N_dbl + n_dbl + 1, n_dbl + 2,
+
430  1 - nu, 1);
+
431  }
+ +
433  const double g
+
434  = - C * (digamma(mu) - digammaOne + dF[1] / F
+
435  - digamma(alpha_dbl) + digammaTwo);
+
436  operands_and_partials.d_x1[i] += g / Pi;
+
437  }
+ +
439  const double g
+
440  = - C * (digamma(nu) - digammaOne - dF[4] / F - digamma(beta_dbl)
+
441  + digammaTwo);
+
442  operands_and_partials.d_x2[i] += g / Pi;
+
443  }
+
444  }
+
445 
+
446  return operands_and_partials.to_var(P);
+
447  }
+
448 
+
449  template <typename T_n, typename T_N,
+
450  typename T_size1, typename T_size2>
+ +
452  beta_binomial_ccdf_log(const T_n& n, const T_N& N, const T_size1& alpha,
+
453  const T_size2& beta) {
+
454 
+
455  static const char* function = "stan::prob::beta_binomial_ccdf_log(%1%)";
+
456 
+ + + +
460  using stan::math::value_of;
+ + +
463 
+
464  // Ensure non-zero argument lengths
+
465  if (!(stan::length(n) && stan::length(N) && stan::length(alpha)
+
466  && stan::length(beta)))
+
467  return 0.0;
+
468 
+
469  double P(0.0);
+
470 
+
471  // Validate arguments
+
472  if (!check_nonnegative(function, N, "Population size parameter", &P))
+
473  return P;
+
474  if (!check_finite(function, alpha, "First prior sample size parameter", &P))
+
475  return P;
+
476  if (!check_positive(function, alpha, "First prior sample size parameter", &P))
+
477  return P;
+
478  if (!check_finite(function, beta, "Second prior sample size parameter", &P))
+
479  return P;
+
480  if (!check_positive(function, beta, "Second prior sample size parameter", &P))
+
481  return P;
+
482  if (!(check_consistent_sizes(function,
+
483  n, N, alpha, beta,
+
484  "Successes variable",
+
485  "Population size parameter",
+
486  "First prior sample size parameter",
+
487  "Second prior sample size parameter",
+
488  &P)))
+
489  return P;
+
490 
+
491  // Wrap arguments in vector views
+
492  VectorView<const T_n> n_vec(n);
+
493  VectorView<const T_N> N_vec(N);
+
494  VectorView<const T_size1> alpha_vec(alpha);
+
495  VectorView<const T_size2> beta_vec(beta);
+
496  size_t size = max_size(n, N, alpha, beta);
+
497 
+
498  // Compute vectorized cdf_log and gradient
+
499  using boost::math::lgamma;
+
500  using boost::math::digamma;
+
501 
+ +
503  operands_and_partials(alpha, beta);
+
504 
+
505  // Explicit return for extreme values
+
506  // The gradients are technically ill-defined, but treated as neg infinity
+
507  for (size_t i = 0; i < stan::length(n); i++) {
+
508  if (value_of(n_vec[i]) <= 0)
+
509  return operands_and_partials.to_var(0.0);
+
510  }
+
511 
+
512  for (size_t i = 0; i < size; i++) {
+
513  // Explicit results for extreme values
+
514  // The gradients are technically ill-defined, but treated as zero
+
515  if (value_of(n_vec[i]) >= value_of(N_vec[i])) {
+
516  return operands_and_partials.to_var(stan::math::negative_infinity());
+
517  }
+
518 
+
519  const double n_dbl = value_of(n_vec[i]);
+
520  const double N_dbl = value_of(N_vec[i]);
+
521  const double alpha_dbl = value_of(alpha_vec[i]);
+
522  const double beta_dbl = value_of(beta_vec[i]);
+
523 
+
524  const double mu = alpha_dbl + n_dbl + 1;
+
525  const double nu = beta_dbl + N_dbl - n_dbl - 1;
+
526 
+
527  const double F = stan::math::F32(1, mu, -N_dbl + n_dbl + 1, n_dbl + 2,
+
528  1 - nu, 1);
+
529 
+
530  double C = lgamma(nu) - lgamma(N_dbl - n_dbl);
+
531  C += lgamma(mu) - lgamma(n_dbl + 2);
+
532  C += lgamma(N_dbl + 2) - lgamma(N_dbl + alpha_dbl + beta_dbl);
+
533  C = std::exp(C);
+
534 
+
535  C *= F / boost::math::beta(alpha_dbl, beta_dbl);
+
536  C /= N_dbl + 1;
+
537 
+
538  const double Pi = C;
+
539 
+
540  P += log(Pi);
+
541 
+
542  double dF[6];
+
543  double digammaOne = 0;
+
544  double digammaTwo = 0;
+
545 
+ + +
548  digammaOne = digamma(mu + nu);
+
549  digammaTwo = digamma(alpha_dbl + beta_dbl);
+
550  stan::math::gradF32(dF, 1, mu, -N_dbl + n_dbl + 1, n_dbl + 2,
+
551  1 - nu, 1);
+
552  }
+ +
554  const double g
+
555  = - C * (digamma(mu) - digammaOne + dF[1] / F
+
556  - digamma(alpha_dbl) + digammaTwo);
+
557  operands_and_partials.d_x1[i] -= g / Pi;
+
558  }
+ +
560  const double g
+
561  = - C * (digamma(nu) - digammaOne - dF[4] / F - digamma(beta_dbl)
+
562  + digammaTwo);
+
563  operands_and_partials.d_x2[i] -= g / Pi;
+
564  }
+
565  }
+
566 
+
567  return operands_and_partials.to_var(P);
+
568  }
+
569 
+
570  template <class RNG>
+
571  inline int
+
572  beta_binomial_rng(const int N,
+
573  const double alpha,
+
574  const double beta,
+
575  RNG& rng) {
+
576 
+
577  static const char* function = "stan::prob::beta_binomial_rng(%1%)";
+
578 
+ + + +
582 
+
583  if (!check_nonnegative(function, N, "Population size parameter"))
+
584  return 0;
+
585  if (!check_finite(function, alpha, "First prior sample size parameter"))
+
586  return 0;
+
587  if (!check_positive(function, alpha, "First prior sample size parameter"))
+
588  return 0;
+
589  if (!check_finite(function, beta, "Second prior sample size parameter"))
+
590  return 0;
+
591  if (!check_positive(function, beta, "Second prior sample size parameter"))
+
592  return 0;
+
593 
+
594  double a = stan::prob::beta_rng(alpha, beta, rng);
+
595  while(a > 1 || a < 0)
+
596  a = stan::prob::beta_rng(alpha, beta, rng);
+
597  return stan::prob::binomial_rng(N, a, rng);
+
598  }
+
599 }
+
600  }
+
601 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/bfgs_8hpp.html b/doc/api/html/bfgs_8hpp.html new file mode 100644 index 00000000000..be7e0e13aad --- /dev/null +++ b/doc/api/html/bfgs_8hpp.html @@ -0,0 +1,145 @@ + + + + + +Stan: src/stan/optimization/bfgs.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
bfgs.hpp File Reference
+
+
+
#include <cmath>
+#include <cstdlib>
+#include <string>
+#include <boost/math/special_functions/fpclassify.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/model/util.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + + + +

+Classes

class  stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >
 
struct  stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::BFGSOptions
 
class  stan::optimization::ModelAdaptor< M >
 
class  stan::optimization::BFGSLineSearch< M >
 
+ + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::optimization
 
+ + + + +

+Functions

template<typename M >
double stan::optimization::lp_no_jacobian (const M &model, std::vector< double > &params_r, std::vector< int > &params_i, std::ostream *o=0)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/bfgs_8hpp_source.html b/doc/api/html/bfgs_8hpp_source.html new file mode 100644 index 00000000000..0e9d768a266 --- /dev/null +++ b/doc/api/html/bfgs_8hpp_source.html @@ -0,0 +1,706 @@ + + + + + +Stan: src/stan/optimization/bfgs.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
bfgs.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__OPTIMIZATION__BFGS_HPP__
+
2 #define __STAN__OPTIMIZATION__BFGS_HPP__
+
3 
+
4 #include <cmath>
+
5 #include <cstdlib>
+
6 #include <string>
+
7 
+
8 #include <boost/math/special_functions/fpclassify.hpp>
+
9 
+ +
11 #include <stan/model/util.hpp>
+
12 
+
13 namespace stan {
+
14  namespace optimization {
+
15  namespace {
+
16  template<typename FunctorType, typename Scalar, typename XType>
+
17  int BTLineSearch(FunctorType &func,
+
18  Scalar &alpha,
+
19  XType &x1, Scalar &f1, XType &gradx1,
+
20  const XType &p,
+
21  const XType &x0, const Scalar &f0, const XType &gradx0,
+
22  const Scalar &rho, const Scalar &c,
+
23  const Scalar &minAlpha)
+
24  {
+
25  const Scalar cdfdp(c*gradx0.dot(p));
+
26  int ret;
+
27 
+
28  while (1) {
+
29  x1 = x0 + alpha*p;
+
30  ret = func(x1,f1);
+
31  if (ret!=0 && f1 <= f0 + alpha*cdfdp)
+
32  break;
+
33  else
+
34  alpha *= rho;
+
35 
+
36  if (alpha < minAlpha)
+
37  return 1;
+
38  }
+
39  func.df(x1,gradx1);
+
40  return 0;
+
41  }
+
42 
+
43  template<typename Scalar>
+
44  Scalar CubicInterp(const Scalar &df0,
+
45  const Scalar &x1, const Scalar &f1, const Scalar &df1,
+
46  const Scalar &loX, const Scalar &hiX)
+
47  {
+
48  const Scalar c3((-12*f1 + 6*x1*(df0 + df1))/(x1*x1*x1));
+
49  const Scalar c2(-(4*df0 + 2*df1)/x1 + 6*f1/(x1*x1));
+
50  const Scalar &c1(df0);
+
51 
+
52  const Scalar t_s = std::sqrt(c2*c2 - 2.0*c1*c3);
+
53  const Scalar s1 = - (c2 + t_s)/c3;
+
54  const Scalar s2 = - (c2 - t_s)/c3;
+
55 
+
56  Scalar tmpF;
+
57  Scalar minF, minX;
+
58 
+
59  // Check value at lower bound
+
60  minF = loX*(loX*(loX*c3/3.0 + c2)/2.0 + c1);
+
61  minX = loX;
+
62 
+
63  // Check value at upper bound
+
64  tmpF = hiX*(hiX*(hiX*c3/3.0 + c2)/2.0 + c1);
+
65  if (tmpF < minF) {
+
66  minF = tmpF;
+
67  minX = hiX;
+
68  }
+
69 
+
70  // Check value of first root
+
71  if (loX < s1 && s1 < hiX) {
+
72  tmpF = s1*(s1*(s1*c3/3.0 + c2)/2.0 + c1);
+
73  if (tmpF < minF) {
+
74  minF = tmpF;
+
75  minX = s1;
+
76  }
+
77  }
+
78 
+
79  // Check value of second root
+
80  if (loX < s2 && s2 < hiX) {
+
81  tmpF = s2*(s2*(s2*c3/3.0 + c2)/2.0 + c1);
+
82  if (tmpF < minF) {
+
83  minF = tmpF;
+
84  minX = s2;
+
85  }
+
86  }
+
87 
+
88  return minX;
+
89  }
+
90  template<typename Scalar>
+
91  Scalar CubicInterp(const Scalar &x0, const Scalar &f0, const Scalar &df0,
+
92  const Scalar &x1, const Scalar &f1, const Scalar &df1,
+
93  const Scalar &loX, const Scalar &hiX)
+
94  {
+
95  return x0 + CubicInterp(df0,x1-x0,f1-f0,df1,loX-x0,hiX-x0);
+
96  }
+
97 
+
98  template<typename FunctorType, typename Scalar, typename XType>
+
99  int WolfLSZoom(Scalar &alpha, XType &newX, Scalar &newF, XType &newDF,
+
100  FunctorType &func,
+
101  const XType &x, const Scalar &f, const Scalar &dfp,
+
102  const Scalar &c1dfp, const Scalar &c2dfp, const XType &p,
+
103  Scalar alo, Scalar aloF, Scalar aloDFp,
+
104  Scalar ahi, Scalar ahiF, Scalar ahiDFp,
+
105  const Scalar &min_range)
+
106  {
+
107  Scalar d1, d2, newDFp;
+
108  int itNum(0);
+
109 
+
110  while (1) {
+
111  itNum++;
+
112 
+
113  if (std::fabs(alo-ahi) < min_range)
+
114  return 1;
+
115 
+
116  if (itNum%5 == 0) {
+
117  alpha = 0.5*(alo+ahi);
+
118  }
+
119  else {
+
120  // Perform cubic interpolation to determine next point to try
+
121  d1 = aloDFp + ahiDFp - 3*(aloF-ahiF)/(alo-ahi);
+
122  d2 = std::sqrt(d1*d1 - aloDFp*ahiDFp);
+
123  if (ahi < alo)
+
124  d2 = -d2;
+
125  alpha = ahi - (ahi - alo)*(ahiDFp + d2 - d1)/(ahiDFp - aloDFp + 2*d2);
+
126  if (!boost::math::isfinite(alpha) ||
+
127  alpha < std::min(alo,ahi)+0.01*std::fabs(alo-ahi) ||
+
128  alpha > std::max(alo,ahi)-0.01*std::fabs(alo-ahi))
+
129  alpha = 0.5*(alo+ahi);
+
130  }
+
131 
+
132  newX = x + alpha*p;
+
133  while (func(newX,newF,newDF)) {
+
134  alpha = 0.5*(alpha+std::min(alo,ahi));
+
135  if (std::fabs(std::min(alo,ahi)-alpha) < min_range)
+
136  return 1;
+
137  newX = x + alpha*p;
+
138  }
+
139  newDFp = newDF.dot(p);
+
140  if (newF > (f + alpha*c1dfp) || newF >= aloF) {
+
141  ahi = alpha;
+
142  ahiF = newF;
+
143  ahiDFp = newDFp;
+
144  }
+
145  else {
+
146  if (std::fabs(newDFp) <= -c2dfp)
+
147  break;
+
148  if (newDFp*(ahi-alo) >= 0) {
+
149  ahi = alo;
+
150  ahiF = aloF;
+
151  ahiDFp = aloDFp;
+
152  }
+
153  alo = alpha;
+
154  aloF = newF;
+
155  aloDFp = newDFp;
+
156  }
+
157  }
+
158  return 0;
+
159  }
+
160 
+
161  template<typename FunctorType, typename Scalar, typename XType>
+
162  int WolfeLineSearch(FunctorType &func,
+
163  Scalar &alpha,
+
164  XType &x1, Scalar &f1, XType &gradx1,
+
165  const XType &p,
+
166  const XType &x0, const Scalar &f0, const XType &gradx0,
+
167  const Scalar &c1, const Scalar &c2,
+
168  const Scalar &minAlpha)
+
169  {
+
170  const Scalar dfp(gradx0.dot(p));
+
171  const Scalar c1dfp(c1*dfp);
+
172  const Scalar c2dfp(c2*dfp);
+
173 
+
174  Scalar alpha0(minAlpha);
+
175  Scalar alpha1(alpha);
+
176 
+
177  Scalar prevF(f0);
+
178  XType prevDF(gradx0);
+
179  Scalar prevDFp(dfp);
+
180  Scalar newDFp;
+
181 
+
182  int retCode = 0, nits = 0, ret;
+
183 
+
184  while (1) {
+
185  x1.noalias() = x0 + alpha1*p;
+
186  ret = func(x1,f1,gradx1);
+
187  if (ret!=0) {
+
188  alpha1 = 0.5*(alpha0+alpha1);
+
189  continue;
+
190  }
+
191  newDFp = gradx1.dot(p);
+
192  if ((f1 > f0 + alpha*c1dfp) || (f1 >= prevF && nits > 0)) {
+
193  retCode = WolfLSZoom(alpha, x1, f1, gradx1,
+
194  func,
+
195  x0, f0, dfp,
+
196  c1dfp, c2dfp, p,
+
197  alpha0, prevF, prevDFp,
+
198  alpha1, f1, newDFp,
+
199  1e-16);
+
200  break;
+
201  }
+
202  if (std::fabs(newDFp) <= -c2dfp) {
+
203  alpha = alpha1;
+
204  break;
+
205  }
+
206  if (newDFp >= 0) {
+
207  retCode = WolfLSZoom(alpha, x1, f1, gradx1,
+
208  func,
+
209  x0, f0, dfp,
+
210  c1dfp, c2dfp, p,
+
211  alpha1, f1, newDFp,
+
212  alpha0, prevF, prevDFp,
+
213  1e-16);
+
214  break;
+
215  }
+
216 
+
217  alpha0 = alpha1;
+
218  prevF = f1;
+
219  std::swap(prevDF,gradx1);
+
220  prevDFp = newDFp;
+
221 
+
222 // alpha1 = std::min(2.0*alpha0,maxAlpha);
+
223  alpha1 *= 10.0;
+
224 
+
225  nits++;
+
226  }
+
227  return retCode;
+
228  }
+
229 
+
230  }
+
231  template<typename FunctorType, typename Scalar = double,
+
232  int DimAtCompile = Eigen::Dynamic,
+
233  int LineSearchMethod = 1>
+ +
235  public:
+
236  typedef Eigen::Matrix<Scalar,DimAtCompile,1> VectorT;
+
237  typedef Eigen::Matrix<Scalar,DimAtCompile,DimAtCompile> HessianT;
+
238 
+
239  protected:
+
240  FunctorType &_func;
+ +
242  Scalar _fk, _fk_1, _alphak_1;
+
243  Scalar _alpha, _alpha0;
+
244  Eigen::LDLT< HessianT > _ldlt;
+
245  size_t _itNum;
+
246  std::string _note;
+
247 
+
248  public:
+
249  const Scalar &curr_f() const { return _fk; }
+
250  const VectorT &curr_x() const { return _xk; }
+
251  const VectorT &curr_g() const { return _gk; }
+
252  const VectorT &curr_s() const { return _sk; }
+
253 
+
254  const Scalar &prev_f() const { return _fk_1; }
+
255  const VectorT &prev_x() const { return _xk_1; }
+
256  const VectorT &prev_g() const { return _gk_1; }
+
257  const VectorT &prev_s() const { return _sk_1; }
+
258  Scalar prev_step_size() const { return _sk_1.norm()*_alphak_1; }
+
259 
+
260  const Scalar &alpha0() const { return _alpha0; }
+
261  const Scalar &alpha() const { return _alpha; }
+
262  const size_t iter_num() const { return _itNum; }
+
263 
+
264  const std::string &note() const { return _note; }
+
265 
+
266  std::string get_code_string(int retCode) {
+
267  switch(retCode) {
+
268  case 0:
+
269  return std::string("Successful step completed");
+
270  case 1:
+
271  return std::string("Convergence detected: change in objective function was below tolerance");
+
272  case 2:
+
273  return std::string("Convergence detected: gradient norm is below tolerance");
+
274  case 3:
+
275  return std::string("Convergence detected: parameter change was below tolerance");
+
276  case 4:
+
277  return std::string("Maximum number of iterations hit, may not be at an optima");
+
278  case -1:
+
279  return std::string("Line search failed to achieve a sufficient decrease, no more progress can be made");
+
280  default:
+
281  return std::string("Unknown termination code");
+
282  }
+
283  }
+
284 
+
285  struct BFGSOptions {
+ +
287  maxIts = 10000;
+
288  rho = 0.75;
+
289  c1 = 1e-4;
+
290  c2 = 0.9;
+
291  minAlpha = 1e-12;
+
292  alpha0 = 1e-3;
+
293  tolX = 1e-8;
+
294  tolF = 1e-8;
+
295  tolGrad = 1e-8;
+
296  }
+
297  size_t maxIts;
+
298  Scalar rho;
+
299  Scalar c1;
+
300  Scalar c2;
+
301  Scalar alpha0;
+
302  Scalar minAlpha;
+
303  Scalar tolX;
+
304  Scalar tolF;
+
305  Scalar tolGrad;
+
306  } _opts;
+
307 
+
308 
+
309  BFGSMinimizer(FunctorType &f) : _func(f) { }
+
310 
+
311  void initialize(const VectorT &x0) {
+
312  int ret;
+
313  _xk = x0;
+
314  ret = _func(_xk,_fk,_gk);
+
315  if (ret) {
+
316  throw std::runtime_error("Error evaluating initial BFGS point.");
+
317  }
+
318 
+
319  _itNum = 0;
+
320  _note = "";
+
321  }
+
322 
+
323  int step() {
+
324  Scalar gradNorm, thetak, skyk, skBksk;
+
325  VectorT sk, yk, Bksk, rk;
+
326  int retCode;
+
327  int resetB(0);
+
328 
+
329  _itNum++;
+
330 
+
331  if (_itNum == 1) {
+
332  resetB = 1;
+
333  _note = "";
+
334  }
+
335  else if (!(_ldlt.info() == Eigen::Success && _ldlt.isPositive() && (_ldlt.vectorD().array() > 0).all())) {
+
336  resetB = 1;
+
337  _note = "LDLT failed, BFGS reset; ";
+
338  }
+
339  else {
+
340  resetB = 0;
+
341  _note = "";
+
342  }
+
343 
+
344  while (true) {
+
345  if (resetB) {
+
346  // Reset the Hessian approximation
+
347  _sk = -_gk;
+
348  }
+
349  else {
+
350  _sk = -_ldlt.solve(_gk);
+
351  }
+
352 
+
353  if (_itNum > 1 && resetB != 2) {
+
354  _alpha0 = _alpha = std::min(1.0,
+
355  1.01*CubicInterp(_gk_1.dot(_sk_1),
+
356  _alphak_1, _fk - _fk_1, _gk.dot(_sk_1),
+
357  _opts.minAlpha, 1.0));
+
358 // _alpha0 = _alpha = std::min(1.0, 1.01*(2*(_fk - _fk_1)/_gk_1.dot(_sk_1)));
+
359  }
+
360  else {
+ +
362  }
+
363 
+
364  if (LineSearchMethod == 0) {
+
365  retCode = BTLineSearch(_func, _alpha, _xk_1, _fk_1, _gk_1,
+
366  _sk, _xk, _fk, _gk, _opts.rho,
+ +
368  }
+
369  else if (LineSearchMethod == 1) {
+
370  retCode = WolfeLineSearch(_func, _alpha, _xk_1, _fk_1, _gk_1,
+
371  _sk, _xk, _fk, _gk,
+
372  _opts.c1, _opts.c2,
+
373  _opts.minAlpha);
+
374  }
+
375  if (retCode) {
+
376  if (resetB) {
+
377  // Line-search failed and nothing left to try
+
378  retCode = -1;
+
379  return retCode;
+
380  }
+
381  else {
+
382  // Line-search failed, try ditching the Hessian approximation
+
383  resetB = 2;
+
384  _note += "LS failed, BFGS reset; ";
+
385  continue;
+
386  }
+
387  }
+
388  else {
+
389  break;
+
390  }
+
391  }
+
392  std::swap(_fk,_fk_1);
+
393  _xk.swap(_xk_1);
+
394  _gk.swap(_gk_1);
+
395  _sk.swap(_sk_1);
+
396 
+
397  gradNorm = _gk.norm();
+
398  sk.noalias() = _xk - _xk_1;
+
399  // Check for convergence
+
400  if (std::fabs(_fk - _fk_1) < _opts.tolF) {
+
401  retCode = 1; // Objective function improvement wasn't sufficient
+
402  }
+
403  else if (gradNorm < _opts.tolGrad) {
+
404  retCode = 2; // Gradient norm was below threshold
+
405  }
+
406  else if (sk.norm() < _opts.tolX) {
+
407  retCode = 3; // Change in x was too small
+
408  }
+
409  else if (_itNum >= _opts.maxIts) {
+
410  retCode = 4; // Max number of iterations hit
+
411  }
+
412  else {
+
413  retCode = 0; // Step was successful more progress to be made
+
414  }
+
415 
+
416  yk.noalias() = _gk - _gk_1;
+
417  skyk = yk.dot(sk);
+
418  if (resetB) {
+
419  Scalar B0fact = yk.squaredNorm()/skyk;
+
420  _ldlt.compute(B0fact*HessianT::Identity(_xk.size(),_xk.size()));
+
421  Bksk.noalias() = B0fact*sk;
+
422  _sk_1 = -_gk_1/B0fact;
+
423  _alphak_1 = B0fact*_alpha;
+
424  }
+
425  else {
+
426  Bksk = _ldlt.transpositionsP().transpose()*(_ldlt.matrixL()*(_ldlt.vectorD().asDiagonal()*(_ldlt.matrixU()*(_ldlt.transpositionsP()*sk))));
+
427  _alphak_1 = _alpha;
+
428  }
+
429  skBksk = sk.dot(Bksk);
+
430  if (skyk >= 0.2*skBksk) {
+
431  // Full update
+
432  thetak = 1;
+
433  rk = yk;
+
434  }
+
435  else {
+
436  // Damped update (Procedure 18.2)
+
437  thetak = 0.8*skBksk/(skBksk - skyk);
+
438  rk.noalias() = thetak*yk + (1.0 - thetak)*Bksk;
+
439  _note += "Damped BFGS update";
+
440  }
+
441  _ldlt.rankUpdate(rk,1.0/sk.dot(rk));
+
442  _ldlt.rankUpdate(Bksk,-1.0/skBksk);
+
443 
+
444  return retCode;
+
445  }
+
446 
+
447  int minimize(VectorT &x0) {
+
448  int retcode;
+
449  initialize(x0);
+
450  while (!(retcode = step()));
+
451  x0 = _xk;
+
452  return retcode;
+
453  }
+
454  };
+
455 
+
456 
+
457 
+
458  template <typename M>
+
459  double lp_no_jacobian(const M& model,
+
460  std::vector<double>& params_r,
+
461  std::vector<int>& params_i,
+
462  std::ostream* o = 0) {
+
463  // FIXME: is this supposed to return the log probability from the model?
+
464  return 0;
+
465  }
+
466 
+
467  template <class M>
+
468  class ModelAdaptor {
+
469  private:
+
470  M& _model;
+
471  std::vector<int> _params_i;
+
472  std::ostream* _msgs;
+
473  std::vector<double> _x, _g;
+
474  size_t _fevals;
+
475 
+
476  public:
+
477  ModelAdaptor(M& model,
+
478  const std::vector<int>& params_i,
+
479  std::ostream* msgs)
+
480  : _model(model), _params_i(params_i), _msgs(msgs), _fevals(0) {}
+
481 
+
482  size_t fevals() const { return _fevals; }
+
483  int operator()(const Eigen::Matrix<double,Eigen::Dynamic,1> &x,
+
484  double &f) {
+
485  _x.resize(x.size());
+ +
487  i < x.size(); i++)
+
488  _x[i] = x[i];
+
489 
+
490  try {
+
491  f = - _model.template log_prob<false,false>(_x,_params_i,
+
492  _msgs);
+
493  } catch (const std::exception& e) {
+
494  if (_msgs)
+
495  (*_msgs) << e.what() << std::endl;
+
496  return 1;
+
497  }
+
498 
+
499  if (boost::math::isfinite(f))
+
500  return 0;
+
501  else {
+
502  if (_msgs)
+
503  *_msgs << "Error evaluating model log probability: "
+
504  "Non-finite function evaluation." << std::endl;
+
505  return 2;
+
506  }
+
507  }
+
508  int operator()(const Eigen::Matrix<double,Eigen::Dynamic,1> &x,
+
509  double &f, Eigen::Matrix<double,Eigen::Dynamic,1> &g) {
+
510  _x.resize(x.size());
+ +
512  i < x.size(); i++)
+
513  _x[i] = x[i];
+
514 
+
515  _fevals++;
+
516 
+
517  try {
+
518  f = - stan::model::log_prob_grad<true,false>(_model,
+
519  _x, _params_i,
+
520  _g, _msgs);
+
521  } catch (const std::exception& e) {
+
522  if (_msgs)
+
523  (*_msgs) << e.what() << std::endl;
+
524  return 1;
+
525  }
+
526 
+
527  g.resize(_g.size());
+
528  for (size_t i = 0; i < _g.size(); i++) {
+
529  if (!boost::math::isfinite(_g[i])) {
+
530  if (_msgs)
+
531  *_msgs << "Error evaluating model log probability: "
+
532  "Non-finite gradient." << std::endl;
+
533  return 3;
+
534  }
+
535  g[i] = -_g[i];
+
536  }
+
537 
+
538  if (boost::math::isfinite(f))
+
539  return 0;
+
540  else {
+
541  if (_msgs)
+
542  *_msgs << "Error evaluating model log probability: "
+
543  "Non-finite function evaluation."
+
544  << std::endl;
+
545  return 2;
+
546  }
+
547  }
+
548  int df(const Eigen::Matrix<double,Eigen::Dynamic,1> &x,
+
549  Eigen::Matrix<double,Eigen::Dynamic,1> &g) {
+
550  double f;
+
551  return (*this)(x,f,g);
+
552  }
+
553  };
+
554 
+
555  template <typename M>
+
556  class BFGSLineSearch : public BFGSMinimizer<ModelAdaptor<M> > {
+
557  private:
+
558  ModelAdaptor<M> _adaptor;
+
559  public:
+ +
561  typedef typename vector_t::size_type idx_t;
+
562 
+
563  BFGSLineSearch(M& model,
+
564  const std::vector<double>& params_r,
+
565  const std::vector<int>& params_i,
+
566  std::ostream* msgs = 0)
+
567  : BFGSMinimizer<ModelAdaptor<M> >(_adaptor),
+
568  _adaptor(model,params_i,msgs)
+
569  {
+
570 
+
571  Eigen::Matrix<double,Eigen::Dynamic,1> x;
+
572  x.resize(params_r.size());
+
573  for (size_t i = 0; i < params_r.size(); i++)
+
574  x[i] = params_r[i];
+
575  this->initialize(x);
+
576  }
+
577 
+
578  size_t grad_evals() { return _adaptor.fevals(); }
+
579  double logp() { return -(this->curr_f()); }
+
580  double grad_norm() { return this->curr_g().norm(); }
+
581  void grad(std::vector<double>& g) {
+
582  const vector_t &cg(this->curr_g());
+
583  g.resize(cg.size());
+
584  for (idx_t i = 0; i < cg.size(); i++)
+
585  g[i] = -cg[i];
+
586  }
+
587  void params_r(std::vector<double>& x) {
+
588  const vector_t &cx(this->curr_x());
+
589  x.resize(cx.size());
+
590  for (idx_t i = 0; i < cx.size(); i++)
+
591  x[i] = cx[i];
+
592  }
+
593  };
+
594 
+
595  }
+
596 
+
597 }
+
598 
+
599 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/binomial_8hpp.html b/doc/api/html/binomial_8hpp.html new file mode 100644 index 00000000000..3aa0308d747 --- /dev/null +++ b/doc/api/html/binomial_8hpp.html @@ -0,0 +1,163 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/discrete/binomial.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
binomial.hpp File Reference
+
+
+
#include <boost/random/binomial_distribution.hpp>
+#include <boost/random/variate_generator.hpp>
+#include <stan/agrad/partials_vari.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/math/constants.hpp>
+#include <stan/math/functions/inv_logit.hpp>
+#include <stan/math/functions/log1m.hpp>
+#include <stan/math/functions/log_inv_logit.hpp>
+#include <stan/math/functions/multiply_log.hpp>
+#include <stan/math/functions/value_of.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/prob/traits.hpp>
+#include <stan/prob/constants.hpp>
+#include <stan/math/functions/binomial_coefficient_log.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

template<bool propto, typename T_n , typename T_N , typename T_prob >
return_type< T_prob >::type stan::prob::binomial_log (const T_n &n, const T_N &N, const T_prob &theta)
 
template<typename T_n , typename T_N , typename T_prob >
return_type< T_prob >::type stan::prob::binomial_log (const T_n &n, const T_N &N, const T_prob &theta)
 
template<bool propto, typename T_n , typename T_N , typename T_prob >
return_type< T_prob >::type stan::prob::binomial_logit_log (const T_n &n, const T_N &N, const T_prob &alpha)
 
template<typename T_n , typename T_N , typename T_prob >
return_type< T_prob >::type stan::prob::binomial_logit_log (const T_n &n, const T_N &N, const T_prob &alpha)
 
template<typename T_n , typename T_N , typename T_prob >
return_type< T_prob >::type stan::prob::binomial_cdf (const T_n &n, const T_N &N, const T_prob &theta)
 
template<typename T_n , typename T_N , typename T_prob >
return_type< T_prob >::type stan::prob::binomial_cdf_log (const T_n &n, const T_N &N, const T_prob &theta)
 
template<typename T_n , typename T_N , typename T_prob >
return_type< T_prob >::type stan::prob::binomial_ccdf_log (const T_n &n, const T_N &N, const T_prob &theta)
 
template<class RNG >
int stan::prob::binomial_rng (const int N, const double theta, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/binomial_8hpp_source.html b/doc/api/html/binomial_8hpp_source.html new file mode 100644 index 00000000000..616073254bf --- /dev/null +++ b/doc/api/html/binomial_8hpp_source.html @@ -0,0 +1,631 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/discrete/binomial.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
binomial.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__DISCRETE__BINOMIAL_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__DISCRETE__BINOMIAL_HPP__
+
3 
+
4 #include <boost/random/binomial_distribution.hpp>
+
5 #include <boost/random/variate_generator.hpp>
+
6 
+ + + + + + + + +
15 #include <stan/meta/traits.hpp>
+
16 #include <stan/prob/traits.hpp>
+
17 #include <stan/prob/constants.hpp>
+
18 
+ +
20 
+
21 namespace stan {
+
22 
+
23  namespace prob {
+
24 
+
25  // Binomial(n|N,theta) [N >= 0; 0 <= n <= N; 0 <= theta <= 1]
+
26  template <bool propto,
+
27  typename T_n,
+
28  typename T_N,
+
29  typename T_prob>
+
30  typename return_type<T_prob>::type
+
31  binomial_log(const T_n& n,
+
32  const T_N& N,
+
33  const T_prob& theta) {
+
34 
+
35  static const char* function = "stan::prob::binomial_log(%1%)";
+
36 
+ + + + + + +
43 
+
44  // check if any vectors are zero length
+
45  if (!(stan::length(n)
+
46  && stan::length(N)
+
47  && stan::length(theta)))
+
48  return 0.0;
+
49 
+
50  double logp = 0;
+
51  if (!check_bounded(function, n, 0, N,
+
52  "Successes variable",
+
53  &logp))
+
54  return logp;
+
55  if (!check_nonnegative(function, N,
+
56  "Population size parameter",
+
57  &logp))
+
58  return logp;
+
59  if (!check_finite(function, theta,
+
60  "Probability parameter",
+
61  &logp))
+
62  return logp;
+
63  if (!check_bounded(function, theta, 0.0, 1.0,
+
64  "Probability parameter",
+
65  &logp))
+
66  return logp;
+
67  if (!(check_consistent_sizes(function,
+
68  n,N,theta,
+
69  "Successes variable",
+
70  "Population size parameter",
+
71  "Probability parameter",
+
72  &logp)))
+
73  return logp;
+
74 
+
75 
+
76  // check if no variables are involved and prop-to
+ +
78  return 0.0;
+
79 
+
80  // set up template expressions wrapping scalars into vector views
+
81  VectorView<const T_n> n_vec(n);
+
82  VectorView<const T_N> N_vec(N);
+
83  VectorView<const T_prob> theta_vec(theta);
+
84  size_t size = max_size(n, N, theta);
+
85 
+
86  agrad::OperandsAndPartials<T_prob> operands_and_partials(theta);
+
87 
+ + +
90  using stan::math::log1m;
+
91 
+ +
93  for (size_t i = 0; i < size; ++i)
+
94  logp += binomial_coefficient_log(N_vec[i],n_vec[i]);
+
95 
+ +
97  for (size_t i = 0; i < length(theta); ++i)
+
98  log1m_theta[i] = log1m(value_of(theta_vec[i]));
+
99 
+
100  // no test for include_summand because return if not live
+
101  for (size_t i = 0; i < size; ++i)
+
102  logp += multiply_log(n_vec[i],value_of(theta_vec[i]))
+
103  + (N_vec[i] - n_vec[i]) * log1m_theta[i];
+
104 
+
105  if (length(theta) == 1) {
+
106  double temp1 = 0;
+
107  double temp2 = 0;
+
108  for (size_t i = 0; i < size; ++i) {
+
109  temp1 += n_vec[i];
+
110  temp2 += N_vec[i] - n_vec[i];
+
111  }
+ +
113  operands_and_partials.d_x1[0]
+
114  += temp1 / value_of(theta_vec[0])
+
115  - temp2 / (1.0 - value_of(theta_vec[0]));
+
116  }
+
117  } else {
+ +
119  for (size_t i = 0; i < size; ++i)
+
120  operands_and_partials.d_x1[i]
+
121  += n_vec[i] / value_of(theta_vec[i])
+
122  - (N_vec[i] - n_vec[i]) / (1.0 - value_of(theta_vec[i]));
+
123  }
+
124  }
+
125 
+
126  return operands_and_partials.to_var(logp);
+
127  }
+
128 
+
129  template <typename T_n,
+
130  typename T_N,
+
131  typename T_prob>
+
132  inline
+ +
134  binomial_log(const T_n& n,
+
135  const T_N& N,
+
136  const T_prob& theta) {
+
137  return binomial_log<false>(n,N,theta);
+
138  }
+
139 
+
140  // BinomialLogit(n|N,alpha) [N >= 0; 0 <= n <= N]
+
141  // BinomialLogit(n|N,alpha) = Binomial(n|N,inv_logit(alpha))
+
142  template <bool propto,
+
143  typename T_n,
+
144  typename T_N,
+
145  typename T_prob>
+ +
147  binomial_logit_log(const T_n& n,
+
148  const T_N& N,
+
149  const T_prob& alpha) {
+
150 
+
151  static const char* function = "stan::prob::binomial_logit_log(%1%)";
+
152 
+ + + +
156  using stan::math::value_of;
+ + +
159 
+
160  // check if any vectors are zero length
+
161  if (!(stan::length(n)
+
162  && stan::length(N)
+
163  && stan::length(alpha)))
+
164  return 0.0;
+
165 
+
166  double logp = 0;
+
167  if (!check_bounded(function, n, 0, N,
+
168  "Successes variable",
+
169  &logp))
+
170  return logp;
+
171  if (!check_nonnegative(function, N,
+
172  "Population size parameter",
+
173  &logp))
+
174  return logp;
+
175  if (!check_finite(function, alpha,
+
176  "Probability parameter",
+
177  &logp))
+
178  return logp;
+
179  if (!(check_consistent_sizes(function,
+
180  n,N,alpha,
+
181  "Successes variable",
+
182  "Population size parameter",
+
183  "Probability parameter",
+
184  &logp)))
+
185  return logp;
+
186 
+
187  // check if no variables are involved and prop-to
+ +
189  return 0.0;
+
190 
+
191  // set up template expressions wrapping scalars into vector views
+
192  VectorView<const T_n> n_vec(n);
+
193  VectorView<const T_N> N_vec(N);
+
194  VectorView<const T_prob> alpha_vec(alpha);
+
195  size_t size = max_size(n, N, alpha);
+
196 
+
197  agrad::OperandsAndPartials<T_prob> operands_and_partials(alpha);
+
198 
+ + +
201  using stan::math::inv_logit;
+
202 
+ +
204  for (size_t i = 0; i < size; ++i)
+
205  logp += binomial_coefficient_log(N_vec[i],n_vec[i]);
+
206 
+
207  DoubleVectorView<true,is_vector<T_prob>::value> log_inv_logit_alpha(length(alpha));
+
208  for (size_t i = 0; i < length(alpha); ++i)
+
209  log_inv_logit_alpha[i] = log_inv_logit(value_of(alpha_vec[i]));
+
210 
+
211  DoubleVectorView<true,is_vector<T_prob>::value> log_inv_logit_neg_alpha(length(alpha));
+
212  for (size_t i = 0; i < length(alpha); ++i)
+
213  log_inv_logit_neg_alpha[i] = log_inv_logit(-value_of(alpha_vec[i]));
+
214 
+
215  for (size_t i = 0; i < size; ++i)
+
216  logp += n_vec[i] * log_inv_logit_alpha[i]
+
217  + (N_vec[i] - n_vec[i]) * log_inv_logit_neg_alpha[i];
+
218 
+
219  if (length(alpha) == 1) {
+
220  double temp1 = 0;
+
221  double temp2 = 0;
+
222  for (size_t i = 0; i < size; ++i) {
+
223  temp1 += n_vec[i];
+
224  temp2 += N_vec[i] - n_vec[i];
+
225  }
+ +
227  operands_and_partials.d_x1[0]
+
228  += temp1 * inv_logit(-value_of(alpha_vec[0]))
+
229  - temp2 * inv_logit(value_of(alpha_vec[0]));
+
230  }
+
231  } else {
+ +
233  for (size_t i = 0; i < size; ++i)
+
234  operands_and_partials.d_x1[i]
+
235  += n_vec[i] * inv_logit(-value_of(alpha_vec[i]))
+
236  - (N_vec[i] - n_vec[i]) * inv_logit(value_of(alpha_vec[i]));
+
237  }
+
238  }
+
239 
+
240  return operands_and_partials.to_var(logp);
+
241  }
+
242 
+
243  template <typename T_n,
+
244  typename T_N,
+
245  typename T_prob>
+
246  inline
+ +
248  binomial_logit_log(const T_n& n,
+
249  const T_N& N,
+
250  const T_prob& alpha) {
+
251  return binomial_logit_log<false>(n,N,alpha);
+
252  }
+
253 
+
254 
+
255  // Binomial CDF
+
256  template <typename T_n, typename T_N, typename T_prob>
+ +
258  binomial_cdf(const T_n& n, const T_N& N, const T_prob& theta) {
+
259 
+
260  static const char* function = "stan::prob::binomial_cdf(%1%)";
+
261 
+ + + +
265  using stan::math::value_of;
+ + +
268 
+
269  // Ensure non-zero arguments lenghts
+
270  if (!(stan::length(n) && stan::length(N) && stan::length(theta)))
+
271  return 1.0;
+
272 
+
273  double P(1.0);
+
274 
+
275  // Validate arguments
+
276  if (!check_nonnegative(function, N, "Population size parameter", &P))
+
277  return P;
+
278 
+
279  if (!check_finite(function, theta, "Probability parameter", &P))
+
280  return P;
+
281 
+
282  if (!check_bounded(function, theta, 0.0, 1.0,
+
283  "Probability parameter", &P))
+
284  return P;
+
285 
+
286  if (!(check_consistent_sizes(function, n, N, theta,
+
287  "Successes variable", "Population size parameter", "Probability parameter",
+
288  &P)))
+
289  return P;
+
290 
+
291  // Wrap arguments in vector views
+
292  VectorView<const T_n> n_vec(n);
+
293  VectorView<const T_N> N_vec(N);
+
294  VectorView<const T_prob> theta_vec(theta);
+
295  size_t size = max_size(n, N, theta);
+
296 
+
297  // Compute vectorized CDF and gradient
+
298  using stan::math::value_of;
+
299  using boost::math::ibeta;
+
300  using boost::math::ibeta_derivative;
+
301 
+
302  agrad::OperandsAndPartials<T_prob> operands_and_partials(theta);
+
303 
+
304  // Explicit return for extreme values
+
305  // The gradients are technically ill-defined, but treated as zero
+
306  for (size_t i = 0; i < stan::length(n); i++) {
+
307  if (value_of(n_vec[i]) < 0)
+
308  return operands_and_partials.to_var(0.0);
+
309  }
+
310 
+
311  for (size_t i = 0; i < size; i++) {
+
312 
+
313  // Explicit results for extreme values
+
314  // The gradients are technically ill-defined, but treated as zero
+
315  if (value_of(n_vec[i]) >= value_of(N_vec[i])) {
+
316  continue;
+
317  }
+
318 
+
319  const double n_dbl = value_of(n_vec[i]);
+
320  const double N_dbl = value_of(N_vec[i]);
+
321  const double theta_dbl = value_of(theta_vec[i]);
+
322 
+
323  const double Pi = ibeta(N_dbl - n_dbl, n_dbl + 1, 1 - theta_dbl);
+
324 
+
325  P *= Pi;
+
326 
+ +
328  operands_and_partials.d_x1[i]
+
329  += - ibeta_derivative(N_dbl - n_dbl, n_dbl + 1, 1 - theta_dbl) / Pi;
+
330 
+
331 
+
332  }
+
333 
+ +
335  for(size_t i = 0; i < stan::length(theta); ++i) operands_and_partials.d_x1[i] *= P;
+
336  }
+
337 
+
338  return operands_and_partials.to_var(P);
+
339 
+
340  }
+
341 
+
342  template <typename T_n, typename T_N, typename T_prob>
+ +
344  binomial_cdf_log(const T_n& n, const T_N& N, const T_prob& theta) {
+
345 
+
346  static const char* function = "stan::prob::binomial_cdf_log(%1%)";
+
347 
+ + + +
351  using stan::math::value_of;
+ + +
354 
+
355  // Ensure non-zero arguments lenghts
+
356  if (!(stan::length(n) && stan::length(N) && stan::length(theta)))
+
357  return 0.0;
+
358 
+
359  double P(0.0);
+
360 
+
361  // Validate arguments
+
362  if (!check_nonnegative(function, N, "Population size parameter", &P))
+
363  return P;
+
364  if (!check_finite(function, theta, "Probability parameter", &P))
+
365  return P;
+
366  if (!check_bounded(function, theta, 0.0, 1.0,
+
367  "Probability parameter", &P))
+
368  return P;
+
369  if (!(check_consistent_sizes(function, n, N, theta,
+
370  "Successes variable", "Population size parameter", "Probability parameter",
+
371  &P)))
+
372  return P;
+
373 
+
374  // Wrap arguments in vector views
+
375  VectorView<const T_n> n_vec(n);
+
376  VectorView<const T_N> N_vec(N);
+
377  VectorView<const T_prob> theta_vec(theta);
+
378  size_t size = max_size(n, N, theta);
+
379 
+
380  // Compute vectorized cdf_log and gradient
+
381  using stan::math::value_of;
+
382  using boost::math::ibeta;
+
383  using boost::math::ibeta_derivative;
+
384 
+
385  agrad::OperandsAndPartials<T_prob> operands_and_partials(theta);
+
386 
+
387  // Explicit return for extreme values
+
388  // The gradients are technically ill-defined, but treated as negative infinity
+
389  for (size_t i = 0; i < stan::length(n); i++) {
+
390  if (value_of(n_vec[i]) < 0)
+
391  return operands_and_partials.to_var(stan::math::negative_infinity());
+
392  }
+
393 
+
394  for (size_t i = 0; i < size; i++) {
+
395  // Explicit results for extreme values
+
396  // The gradients are technically ill-defined, but treated as zero
+
397  if (value_of(n_vec[i]) >= value_of(N_vec[i])) {
+
398  continue;
+
399  }
+
400  const double n_dbl = value_of(n_vec[i]);
+
401  const double N_dbl = value_of(N_vec[i]);
+
402  const double theta_dbl = value_of(theta_vec[i]);
+
403  const double Pi = ibeta(N_dbl - n_dbl, n_dbl + 1, 1 - theta_dbl);
+
404 
+
405  P += log(Pi);
+
406 
+ +
408  operands_and_partials.d_x1[i]
+
409  += - ibeta_derivative(N_dbl - n_dbl, n_dbl + 1, 1 - theta_dbl) / Pi;
+
410  }
+
411 
+
412  return operands_and_partials.to_var(P);
+
413  }
+
414 
+
415  template <typename T_n, typename T_N, typename T_prob>
+ +
417  binomial_ccdf_log(const T_n& n, const T_N& N, const T_prob& theta) {
+
418 
+
419  static const char* function = "stan::prob::binomial_ccdf_log(%1%)";
+
420 
+ + + +
424  using stan::math::value_of;
+ + +
427 
+
428  // Ensure non-zero arguments lenghts
+
429  if (!(stan::length(n) && stan::length(N) && stan::length(theta)))
+
430  return 0.0;
+
431 
+
432  double P(0.0);
+
433 
+
434  // Validate arguments
+
435  if (!check_nonnegative(function, N, "Population size parameter", &P))
+
436  return P;
+
437  if (!check_finite(function, theta, "Probability parameter", &P))
+
438  return P;
+
439  if (!check_bounded(function, theta, 0.0, 1.0,
+
440  "Probability parameter", &P))
+
441  return P;
+
442  if (!(check_consistent_sizes(function, n, N, theta,
+
443  "Successes variable", "Population size parameter", "Probability parameter",
+
444  &P)))
+
445  return P;
+
446 
+
447  // Wrap arguments in vector views
+
448  VectorView<const T_n> n_vec(n);
+
449  VectorView<const T_N> N_vec(N);
+
450  VectorView<const T_prob> theta_vec(theta);
+
451  size_t size = max_size(n, N, theta);
+
452 
+
453  // Compute vectorized cdf_log and gradient
+
454  using stan::math::value_of;
+
455  using boost::math::ibeta;
+
456  using boost::math::ibeta_derivative;
+
457 
+
458  agrad::OperandsAndPartials<T_prob> operands_and_partials(theta);
+
459 
+
460  // Explicit return for extreme values
+
461  // The gradients are technically ill-defined, but treated as negative infinity
+
462  for (size_t i = 0; i < stan::length(n); i++) {
+
463  if (value_of(n_vec[i]) < 0)
+
464  return operands_and_partials.to_var(0.0);
+
465  }
+
466 
+
467  for (size_t i = 0; i < size; i++) {
+
468  // Explicit results for extreme values
+
469  // The gradients are technically ill-defined, but treated as zero
+
470  if (value_of(n_vec[i]) >= value_of(N_vec[i])) {
+
471  return operands_and_partials.to_var(stan::math::negative_infinity());
+
472  }
+
473  const double n_dbl = value_of(n_vec[i]);
+
474  const double N_dbl = value_of(N_vec[i]);
+
475  const double theta_dbl = value_of(theta_vec[i]);
+
476  const double Pi = 1.0 - ibeta(N_dbl - n_dbl, n_dbl + 1, 1 - theta_dbl);
+
477 
+
478  P += log(Pi);
+
479 
+ +
481  operands_and_partials.d_x1[i]
+
482  += ibeta_derivative(N_dbl - n_dbl, n_dbl + 1, 1 - theta_dbl) / Pi;
+
483  }
+
484 
+
485  return operands_and_partials.to_var(P);
+
486  }
+
487 
+
488 
+
489  template <class RNG>
+
490  inline int
+
491  binomial_rng(const int N,
+
492  const double theta,
+
493  RNG& rng) {
+
494  using boost::variate_generator;
+
495  using boost::binomial_distribution;
+
496 
+
497  static const char* function = "stan::prob::binomial_rng(%1%)";
+
498 
+ + + + +
503 
+
504  if (!check_nonnegative(function, N,
+
505  "Population size parameter"))
+
506  return 0;
+
507  if (!check_finite(function, theta,
+
508  "Probability parameter"))
+
509  return 0;
+
510  if (!check_less_or_equal(function, theta, 1.0,
+
511  "Probability parameter"))
+
512  return 0;
+
513  if (!check_greater_or_equal(function, theta, 0.0,
+
514  "Probability parameter"))
+
515  return 0;
+
516 
+
517  variate_generator<RNG&, binomial_distribution<> >
+
518  binomial_rng(rng, binomial_distribution<>(N, theta));
+
519  return binomial_rng();
+
520  }
+
521 
+
522  }
+
523 }
+
524 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/block_8hpp.html b/doc/api/html/block_8hpp.html new file mode 100644 index 00000000000..a27ad25ae47 --- /dev/null +++ b/doc/api/html/block_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/matrix/block.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
block.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
stan::math::block (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &m, size_t i, size_t j, size_t nrows, size_t ncols)
 Return a nrows x ncols submatrix starting at (i-1,j-1).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/block_8hpp_source.html b/doc/api/html/block_8hpp_source.html new file mode 100644 index 00000000000..8439c05dab9 --- /dev/null +++ b/doc/api/html/block_8hpp_source.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/math/matrix/block.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
block.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__BLOCK_HPP__
+
2 #define __STAN__MATH__MATRIX__BLOCK_HPP__
+
3 
+ + + +
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
20  template <typename T>
+
21  inline
+
22  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>
+
23  block(const Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& m,
+
24  size_t i, size_t j, size_t nrows, size_t ncols) {
+
25  validate_row_index(m,i,"block");
+
26  validate_row_index(m,i+nrows-1,"block");
+
27  validate_column_index(m,j,"block");
+
28  validate_column_index(m,j+ncols-1,"block");
+
29  return m.block(i - 1,j - 1,nrows,ncols);
+
30  }
+
31 
+
32 
+
33 
+
34 
+
35 
+
36  }
+
37 }
+
38 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/boost_8dox.html b/doc/api/html/boost_8dox.html new file mode 100644 index 00000000000..f76dac1a967 --- /dev/null +++ b/doc/api/html/boost_8dox.html @@ -0,0 +1,115 @@ + + + + + +Stan: src/doxygen/boost.dox File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ +
+
+ +
+
src/doxygen/boost.dox File Reference
+
+
+ + + + + + + + +

+Namespaces

namespace  boost
 Reimplementing boost functionality.
 
namespace  boost::math
 Reimplmeneting boost functionality for stan::agrad::var and and bugs in classification of integer types.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/boost__fpclassify_8hpp.html b/doc/api/html/boost__fpclassify_8hpp.html new file mode 100644 index 00000000000..522559c076e --- /dev/null +++ b/doc/api/html/boost__fpclassify_8hpp.html @@ -0,0 +1,147 @@ + + + + + +Stan: src/stan/agrad/rev/boost_fpclassify.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
boost_fpclassify.hpp File Reference
+
+
+
#include <boost/math/special_functions/fpclassify.hpp>
+#include <stan/agrad/rev.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  boost
 Reimplementing boost functionality.
 
namespace  boost::math
 Reimplmeneting boost functionality for stan::agrad::var and and bugs in classification of integer types.
 
+ + + + + + + + + + + + + + + + + + + + + +

+Functions

template<>
int boost::math::fpclassify (const stan::agrad::var &v)
 Categorizes the given stan::agrad::var value.
 
template<>
bool boost::math::isfinite (const stan::agrad::var &v)
 Checks if the given number has finite value.
 
template<>
bool boost::math::isinf (const stan::agrad::var &v)
 Checks if the given number is infinite.
 
template<>
bool boost::math::isnan (const stan::agrad::var &v)
 Checks if the given number is NaN.
 
template<>
bool boost::math::isnormal (const stan::agrad::var &v)
 Checks if the given number is normal.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/boost__fpclassify_8hpp_source.html b/doc/api/html/boost__fpclassify_8hpp_source.html new file mode 100644 index 00000000000..300766d9022 --- /dev/null +++ b/doc/api/html/boost__fpclassify_8hpp_source.html @@ -0,0 +1,151 @@ + + + + + +Stan: src/stan/agrad/rev/boost_fpclassify.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
boost_fpclassify.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__BOOST_FPCLASSIFY_HPP__
+
2 #define __STAN__AGRAD__REV__BOOST_FPCLASSIFY_HPP__
+
3 
+
4 #include <boost/math/special_functions/fpclassify.hpp>
+
5 #include <stan/agrad/rev.hpp>
+
6 
+
7 namespace boost {
+
8 
+
9  namespace math {
+
10 
+
22  template <>
+
23  inline
+
24  int fpclassify(const stan::agrad::var& v) {
+
25  return (boost::math::fpclassify)(v.val());
+
26  }
+
27 
+
37  template <>
+
38  inline
+
39  bool isfinite(const stan::agrad::var& v) {
+
40  return (boost::math::isfinite)(v.val());
+
41  }
+
42 
+
52  template <>
+
53  inline
+
54  bool isinf(const stan::agrad::var& v) {
+
55  return (boost::math::isinf)(v.val());
+
56  }
+
57 
+
67  template <>
+
68  inline
+
69  bool isnan(const stan::agrad::var& v) {
+
70  return (boost::math::isnan)(v.val());
+
71  }
+
72 
+
82  template <>
+
83  inline
+
84  bool isnormal(const stan::agrad::var& v) {
+
85  return (boost::math::isnormal)(v.val());
+
86  }
+
87 
+
88  }
+
89 }
+
90 #endif
+
91 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/calculate__chain_8hpp.html b/doc/api/html/calculate__chain_8hpp.html new file mode 100644 index 00000000000..93771f3f316 --- /dev/null +++ b/doc/api/html/calculate__chain_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/agrad/rev/calculate_chain.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
calculate_chain.hpp File Reference
+
+
+
#include <valarray>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + +

+Functions

double stan::agrad::calculate_chain (const double &x, const double &val)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/calculate__chain_8hpp_source.html b/doc/api/html/calculate__chain_8hpp_source.html new file mode 100644 index 00000000000..ec5b80382e0 --- /dev/null +++ b/doc/api/html/calculate__chain_8hpp_source.html @@ -0,0 +1,120 @@ + + + + + +Stan: src/stan/agrad/rev/calculate_chain.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
calculate_chain.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__CALCULATE_CHAIN_HPP__
+
2 #define __STAN__AGRAD__REV__CALCULATE_CHAIN_HPP__
+
3 
+
4 #include <valarray>
+
5 
+
6 namespace stan {
+
7  namespace agrad {
+
8  inline double calculate_chain(const double& x, const double& val) {
+
9  return std::exp(x - val); // works out to inv_logit(x)
+
10  }
+
11  }
+
12 }
+
13 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/categorical_8hpp.html b/doc/api/html/categorical_8hpp.html new file mode 100644 index 00000000000..d50424febb0 --- /dev/null +++ b/doc/api/html/categorical_8hpp.html @@ -0,0 +1,152 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/discrete/categorical.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
categorical.hpp File Reference
+
+
+
#include <boost/random/uniform_01.hpp>
+#include <boost/random/variate_generator.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/math/matrix_error_handling.hpp>
+#include <stan/math/functions/value_of.hpp>
+#include <stan/math/matrix/sum.hpp>
+#include <stan/prob/constants.hpp>
+#include <stan/prob/traits.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + + + +

+Functions

template<bool propto, typename T_prob >
boost::math::tools::promote_args
+< T_prob >::type 
stan::prob::categorical_log (int n, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta)
 
template<typename T_prob >
boost::math::tools::promote_args
+< T_prob >::type 
stan::prob::categorical_log (const typename Eigen::Matrix< T_prob, Eigen::Dynamic, 1 >::size_type n, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta)
 
template<bool propto, typename T_prob >
boost::math::tools::promote_args
+< T_prob >::type 
stan::prob::categorical_log (const std::vector< int > &ns, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta)
 
template<typename T_prob >
boost::math::tools::promote_args
+< T_prob >::type 
stan::prob::categorical_log (const std::vector< int > &ns, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta)
 
template<class RNG >
int stan::prob::categorical_rng (const Eigen::Matrix< double, Eigen::Dynamic, 1 > &theta, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/categorical_8hpp_source.html b/doc/api/html/categorical_8hpp_source.html new file mode 100644 index 00000000000..8809409bf9b --- /dev/null +++ b/doc/api/html/categorical_8hpp_source.html @@ -0,0 +1,272 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/discrete/categorical.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
categorical.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__MULTIVARIATE__DISCRETE__CATEGORICAL_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__MULTIVARIATE__DISCRETE__CATEGORICAL_HPP__
+
3 
+
4 #include <boost/random/uniform_01.hpp>
+
5 #include <boost/random/variate_generator.hpp>
+
6 
+ + + +
10 #include <stan/math/matrix/sum.hpp>
+
11 #include <stan/prob/constants.hpp>
+
12 #include <stan/prob/traits.hpp>
+
13 
+
14 namespace stan {
+
15 
+
16  namespace prob {
+
17 
+
18  // Categorical(n|theta) [0 < n <= N; 0 <= theta[n] <= 1; SUM theta = 1]
+
19  template <bool propto,
+
20  typename T_prob>
+
21  typename boost::math::tools::promote_args<T_prob>::type
+ +
23  const Eigen::Matrix<T_prob,Eigen::Dynamic,1>& theta) {
+
24  static const char* function = "stan::prob::categorical_log(%1%)";
+
25 
+ + +
28  using boost::math::tools::promote_args;
+ +
30 
+
31  int lb = 1;
+
32 
+
33  double lp = 0.0;
+
34  if (!check_bounded(function, n, lb, theta.size(),
+
35  "Number of categories",
+
36  &lp))
+
37  return lp;
+
38 
+ +
40  Eigen::Matrix<double,Eigen::Dynamic,1> theta_dbl(theta.size());
+
41  for (int i = 0; i < theta_dbl.size(); ++i)
+
42  theta_dbl(i) = value_of(theta(i));
+
43  if (!check_simplex(function, theta,
+
44  "Probabilities parameter",
+
45  &lp))
+
46  return lp;
+
47  } else {
+
48  if (!check_simplex(function, theta,
+
49  "Probabilities parameter",
+
50  &lp))
+
51  return lp;
+
52  }
+
53 
+ +
55  return log(theta(n-1));
+
56  return 0.0;
+
57  }
+
58 
+
59  template <typename T_prob>
+
60  inline
+
61  typename boost::math::tools::promote_args<T_prob>::type
+ +
63  const Eigen::Matrix<T_prob,Eigen::Dynamic,1>& theta) {
+
64  return categorical_log<false>(n,theta);
+
65  }
+
66 
+
67 
+
68  // Categorical(n|theta) [0 < n <= N; 0 <= theta[n] <= 1; SUM theta = 1]
+
69  template <bool propto,
+
70  typename T_prob>
+
71  typename boost::math::tools::promote_args<T_prob>::type
+
72  categorical_log(const std::vector<int>& ns,
+
73  const Eigen::Matrix<T_prob,Eigen::Dynamic,1>& theta) {
+
74  static const char* function = "stan::prob::categorical_log(%1%)";
+
75 
+
76  using boost::math::tools::promote_args;
+ + +
79  using stan::math::sum;
+ +
81 
+
82  int lb = 1;
+
83 
+
84  double lp = 0.0;
+
85  for (size_t i = 0; i < ns.size(); ++i)
+
86  if (!check_bounded(function, ns[i], lb, theta.size(),
+
87  "element of outcome array",
+
88  &lp))
+
89  return lp;
+
90 
+ +
92  Eigen::Matrix<double,Eigen::Dynamic,1> theta_dbl(theta.size());
+
93  for (int i = 0; i < theta_dbl.size(); ++i)
+
94  theta_dbl(i) = value_of(theta(i));
+
95  if (!check_simplex(function, theta,
+
96  "Probabilities parameter",
+
97  &lp))
+
98  return lp;
+
99  } else {
+
100  if (!check_simplex(function, theta,
+
101  "Probabilities parameter",
+
102  &lp))
+
103  return lp;
+
104  }
+
105 
+ +
107  return 0.0;
+
108 
+
109  if (ns.size() == 0)
+
110  return 0.0;
+
111 
+
112  Eigen::Matrix<T_prob,Eigen::Dynamic,1> log_theta(theta.size());
+
113  for (int i = 0; i < theta.size(); ++i)
+
114  log_theta(i) = log(theta(i));
+
115 
+
116  Eigen::Matrix<typename boost::math::tools::promote_args<T_prob>::type,
+
117  Eigen::Dynamic,1> log_theta_ns(ns.size());
+
118  for (size_t i = 0; i < ns.size(); ++i)
+
119  log_theta_ns(i) = log_theta(ns[i] - 1);
+
120 
+
121  return sum(log_theta_ns);
+
122  }
+
123 
+
124 
+
125  template <typename T_prob>
+
126  inline
+
127  typename boost::math::tools::promote_args<T_prob>::type
+
128  categorical_log(const std::vector<int>& ns,
+
129  const Eigen::Matrix<T_prob,Eigen::Dynamic,1>& theta) {
+
130  return categorical_log<false>(ns,theta);
+
131  }
+
132 
+
133  template <class RNG>
+
134  inline int
+
135  categorical_rng(const Eigen::Matrix<double,Eigen::Dynamic,1>& theta,
+
136  RNG& rng) {
+
137  using boost::variate_generator;
+
138  using boost::uniform_01;
+ +
140 
+
141  static const char* function = "stan::prob::categorical_rng(%1%)";
+
142 
+
143  check_simplex(function, theta,
+
144  "Probabilities parameter");
+
145 
+
146  variate_generator<RNG&, uniform_01<> >
+
147  uniform01_rng(rng, uniform_01<>());
+
148 
+
149  Eigen::VectorXd index(theta.rows());
+
150  index.setZero();
+
151 
+
152  for(int i = 0; i < theta.rows(); i++) {
+
153  for(int j = i; j < theta.rows(); j++)
+
154  index(j) += theta(i,0);
+
155  }
+
156 
+
157  double c = uniform01_rng();
+
158  int b = 0;
+
159  while(c > index(b,0))
+
160  b++;
+
161  return b + 1;
+
162  }
+
163  }
+
164 }
+
165 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/categorical__argument_8hpp.html b/doc/api/html/categorical__argument_8hpp.html new file mode 100644 index 00000000000..74d7c12ec91 --- /dev/null +++ b/doc/api/html/categorical__argument_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/gm/arguments/categorical_argument.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
categorical_argument.hpp File Reference
+
+
+
#include <vector>
+#include <stan/gm/arguments/argument.hpp>
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::categorical_argument
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/categorical__argument_8hpp_source.html b/doc/api/html/categorical__argument_8hpp_source.html new file mode 100644 index 00000000000..4fc214f059a --- /dev/null +++ b/doc/api/html/categorical__argument_8hpp_source.html @@ -0,0 +1,268 @@ + + + + + +Stan: src/stan/gm/arguments/categorical_argument.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
categorical_argument.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__CATEGORY__ARGUMENT__BETA__
+
2 #define __STAN__GM__ARGUMENTS__CATEGORY__ARGUMENT__BETA__
+
3 
+
4 #include <vector>
+ +
6 
+
7 namespace stan {
+
8 
+
9  namespace gm {
+
10 
+ +
12 
+
13  public:
+
14 
+ +
16  for (std::vector<argument*>::iterator it = _subarguments.begin();
+
17  it != _subarguments.end(); ++it) {
+
18  delete *it;
+
19  }
+
20 
+
21  _subarguments.clear();
+
22  }
+
23 
+
24  void print(std::ostream* s, const int depth, const char prefix) {
+
25  if (!s)
+
26  return;
+
27  std::string indent(compute_indent(depth), ' ');
+
28  *s << prefix << indent << _name << std::endl;
+
29 
+
30  for (std::vector<argument*>::iterator it = _subarguments.begin();
+
31  it != _subarguments.end(); ++it)
+
32  (*it)->print(s, depth + 1, prefix);
+
33  }
+
34 
+
35  void print_help(std::ostream* s, const int depth, const bool recurse) {
+
36 
+
37  if (!s)
+
38  return;
+
39 
+
40  std::string indent(indent_width * depth, ' ');
+
41  std::string subindent(indent_width, ' ');
+
42 
+
43  *s << indent << _name << std::endl;
+
44  *s << indent << subindent << _description << std::endl;
+
45  if (_subarguments.size() > 0) {
+
46  *s << indent << subindent << "Valid subarguments:";
+
47 
+
48  std::vector<argument*>::iterator it = _subarguments.begin();
+
49  *s << " " << (*it)->name();
+
50  ++it;
+
51 
+
52  for (; it != _subarguments.end(); ++it)
+
53  *s << ", " << (*it)->name();
+
54  *s << std::endl << std::endl;
+
55 
+
56  if (recurse) {
+
57  for (std::vector<argument*>::iterator it = _subarguments.begin();
+
58  it != _subarguments.end(); ++it)
+
59  (*it)->print_help(s, depth + 1, true);
+
60  }
+
61  }
+
62  else {
+
63  *s << std::endl;
+
64  }
+
65 
+
66  }
+
67 
+
68  bool parse_args(std::vector<std::string>& args, std::ostream* out,
+
69  std::ostream* err, bool& help_flag) {
+
70 
+
71  bool good_arg = true;
+
72  bool valid_arg = true;
+
73 
+
74  while(good_arg) {
+
75  if (args.size() == 0)
+
76  return valid_arg;
+
77 
+
78  good_arg = false;
+
79 
+
80  std::string cat_name = args.back();
+
81 
+
82  if (cat_name == "help") {
+
83  print_help(out, 0, false);
+
84  help_flag |= true;
+
85  args.clear();
+
86  return true;
+
87  } else if (cat_name == "help-all") {
+
88  print_help(out, 0, true);
+
89  help_flag |= true;
+
90  args.clear();
+
91  return true;
+
92  }
+
93 
+
94  std::string val_name;
+
95  std::string val;
+
96  split_arg(cat_name, val_name, val);
+
97 
+
98  if (_subarguments.size() == 0)
+
99  valid_arg = true;
+
100  for (std::vector<argument*>::iterator it = _subarguments.begin();
+
101  it != _subarguments.end(); ++it) {
+
102  if ( (*it)->name() == cat_name) {
+
103  args.pop_back();
+
104  valid_arg &= (*it)->parse_args(args, out, err, help_flag);
+
105  good_arg = true;
+
106  break;
+
107  } else if ( (*it)->name() == val_name ) {
+
108  valid_arg &= (*it)->parse_args(args, out, err, help_flag);
+
109  good_arg = true;
+
110  break;
+
111  } else {
+
112  good_arg = false;
+
113  }
+
114  }
+
115  }
+
116  return valid_arg;
+
117  };
+
118 
+
119  virtual void probe_args(argument* base_arg, std::stringstream& s) {
+
120  for (std::vector<argument*>::iterator it = _subarguments.begin();
+
121  it != _subarguments.end(); ++it) {
+
122  (*it)->probe_args(base_arg, s);
+
123  }
+
124  }
+
125 
+
126  void find_arg(std::string name,
+
127  std::string prefix,
+
128  std::vector<std::string>& valid_paths) {
+
129 
+
130  argument::find_arg(name, prefix, valid_paths);
+
131 
+
132  prefix += _name + " ";
+
133  for (std::vector<argument*>::iterator it = _subarguments.begin();
+
134  it != _subarguments.end(); ++it)
+
135  (*it)->find_arg(name, prefix, valid_paths);
+
136 
+
137  }
+
138 
+
139  std::vector<argument*>& subarguments() {
+
140  return _subarguments;
+
141  }
+
142 
+
143  argument* arg(const std::string name) {
+
144  for (std::vector<argument*>::iterator it = _subarguments.begin();
+
145  it != _subarguments.end(); ++it)
+
146  if ( name == (*it)->name() )
+
147  return (*it);
+
148  return 0;
+
149  }
+
150 
+
151  protected:
+
152 
+
153  std::vector<argument*> _subarguments;
+
154 
+
155  };
+
156 
+
157  } // gm
+
158 
+
159 } // stan
+
160 
+
161 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/categorical__logit_8hpp.html b/doc/api/html/categorical__logit_8hpp.html new file mode 100644 index 00000000000..8240fe13fba --- /dev/null +++ b/doc/api/html/categorical__logit_8hpp.html @@ -0,0 +1,149 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/discrete/categorical_logit.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
categorical_logit.hpp File Reference
+
+
+
#include <vector>
+#include <boost/math/tools/promotion.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/math/matrix/log_softmax.hpp>
+#include <stan/math/functions/log_sum_exp.hpp>
+#include <stan/math/matrix/log_sum_exp.hpp>
+#include <stan/math/matrix/sum.hpp>
+#include <stan/prob/traits.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + +

+Functions

template<bool propto, typename T_prob >
boost::math::tools::promote_args
+< T_prob >::type 
stan::prob::categorical_logit_log (int n, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &beta)
 
template<typename T_prob >
boost::math::tools::promote_args
+< T_prob >::type 
stan::prob::categorical_logit_log (int n, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &beta)
 
template<bool propto, typename T_prob >
boost::math::tools::promote_args
+< T_prob >::type 
stan::prob::categorical_logit_log (const std::vector< int > &ns, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &beta)
 
template<typename T_prob >
boost::math::tools::promote_args
+< T_prob >::type 
stan::prob::categorical_logit_log (const std::vector< int > &ns, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &beta)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/categorical__logit_8hpp_source.html b/doc/api/html/categorical__logit_8hpp_source.html new file mode 100644 index 00000000000..5c98d5d17db --- /dev/null +++ b/doc/api/html/categorical__logit_8hpp_source.html @@ -0,0 +1,210 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/discrete/categorical_logit.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
categorical_logit.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__MULTIVARIATE__DISCRETE__CATEGORICAL_LOGIT_LOG_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__MULTIVARIATE__DISCRETE__CATEGORICAL_LOGIT_LOG_HPP__
+
3 
+
4 #include <vector>
+
5 #include <boost/math/tools/promotion.hpp>
+ + + + +
10 #include <stan/math/matrix/sum.hpp>
+
11 #include <stan/prob/traits.hpp>
+
12 
+
13 namespace stan {
+
14 
+
15  namespace prob {
+
16 
+
17  // CategoricalLog(n|theta) [0 < n <= N, theta unconstrained], no checking
+
18  template <bool propto,
+
19  typename T_prob>
+
20  typename boost::math::tools::promote_args<T_prob>::type
+ +
22  const Eigen::Matrix<T_prob,Eigen::Dynamic,1>& beta) {
+
23  static const char* function = "stan::prob::categorical_logit_log(%1%)";
+
24 
+ + + +
28 
+
29  double lp = 0.0;
+
30  if (!check_bounded(function, n, 1, beta.size(),
+
31  "categorical outcome out of support",
+
32  &lp))
+
33  return lp;
+
34 
+
35  if (!check_finite(function, beta, "log odds parameter", &lp))
+
36  return lp;
+
37 
+ +
39  return 0.0;
+
40 
+
41  // FIXME: wasteful vs. creating term (n-1) if not vectorized
+
42  return beta(n-1) - log_sum_exp(beta); // == log_softmax(beta)(n-1);
+
43  }
+
44 
+
45  template <typename T_prob>
+
46  inline
+
47  typename boost::math::tools::promote_args<T_prob>::type
+ +
49  const Eigen::Matrix<T_prob,Eigen::Dynamic,1>& beta) {
+
50  return categorical_logit_log<false>(n,beta);
+
51  }
+
52 
+
53  template <bool propto,
+
54  typename T_prob>
+
55  typename boost::math::tools::promote_args<T_prob>::type
+
56  categorical_logit_log(const std::vector<int>& ns,
+
57  const Eigen::Matrix<T_prob,Eigen::Dynamic,1>& beta) {
+
58  static const char* function = "stan::prob::categorical_logit_log(%1%)";
+
59 
+ + + +
63  using stan::math::sum;
+
64 
+
65  double lp = 0.0;
+
66  for (size_t k = 0; k < ns.size(); ++k)
+
67  if (!check_bounded(function, ns[k], 1, beta.size(),
+
68  "categorical outcome out of support",
+
69  &lp))
+
70  return lp;
+
71 
+
72  if (!check_finite(function, beta, "log odds parameter", &lp))
+
73  return lp;
+
74 
+ +
76  return 0.0;
+
77 
+
78  if (ns.size() == 0)
+
79  return 0.0;
+
80 
+
81  Eigen::Matrix<T_prob,Eigen::Dynamic,1> log_softmax_beta
+
82  = log_softmax(beta);
+
83 
+
84  // FIXME: replace with more efficient sum()
+
85  Eigen::Matrix<typename boost::math::tools::promote_args<T_prob>::type,
+
86  Eigen::Dynamic,1> results(ns.size());
+
87  for (size_t i = 0; i < ns.size(); ++i)
+
88  results[i] = log_softmax_beta(ns[i] - 1);
+
89  return sum(results);
+
90  }
+
91 
+
92  template <typename T_prob>
+
93  inline
+
94  typename boost::math::tools::promote_args<T_prob>::type
+
95  categorical_logit_log(const std::vector<int>& ns,
+
96  const Eigen::Matrix<T_prob,Eigen::Dynamic,1>& beta) {
+
97  return categorical_logit_log<false>(ns,beta);
+
98  }
+
99 
+
100 
+
101  }
+
102 }
+
103 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/cauchy_8hpp.html b/doc/api/html/cauchy_8hpp.html new file mode 100644 index 00000000000..18f095749ec --- /dev/null +++ b/doc/api/html/cauchy_8hpp.html @@ -0,0 +1,159 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/cauchy.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
cauchy.hpp File Reference
+
+
+
#include <boost/random/cauchy_distribution.hpp>
+#include <boost/random/variate_generator.hpp>
+#include <stan/agrad/partials_vari.hpp>
+#include <stan/prob/traits.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/math/constants.hpp>
+#include <stan/math/functions/square.hpp>
+#include <stan/math/functions/value_of.hpp>
+#include <stan/prob/constants.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + + + + + + + + +

+Functions

template<bool propto, typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
stan::prob::cauchy_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 The log of the Cauchy density for the specified scalar(s) given the specified location parameter(s) and scale parameter(s).
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
stan::prob::cauchy_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
stan::prob::cauchy_cdf (const T_y &y, const T_loc &mu, const T_scale &sigma)
 Calculates the cauchy cumulative distribution function for the given variate, location, and scale.
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
stan::prob::cauchy_cdf_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
stan::prob::cauchy_ccdf_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<class RNG >
double stan::prob::cauchy_rng (const double mu, const double sigma, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/cauchy_8hpp_source.html b/doc/api/html/cauchy_8hpp_source.html new file mode 100644 index 00000000000..54bc7509cf5 --- /dev/null +++ b/doc/api/html/cauchy_8hpp_source.html @@ -0,0 +1,508 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/cauchy.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
cauchy.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CAUCHY_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CAUCHY_HPP__
+
3 
+
4 #include <boost/random/cauchy_distribution.hpp>
+
5 #include <boost/random/variate_generator.hpp>
+
6 
+ +
8 #include <stan/prob/traits.hpp>
+ +
10 #include <stan/math/constants.hpp>
+ + +
13 #include <stan/prob/constants.hpp>
+
14 
+
15 namespace stan {
+
16 
+
17  namespace prob {
+
18 
+
37  template <bool propto,
+
38  typename T_y, typename T_loc, typename T_scale>
+
39  typename return_type<T_y,T_loc,T_scale>::type
+
40  cauchy_log(const T_y& y, const T_loc& mu, const T_scale& sigma) {
+
41  static const char* function = "stan::prob::cauchy_log(%1%)";
+
42 
+ + + + + + +
49 
+
50  // check if any vectors are zero length
+
51  if (!(stan::length(y)
+
52  && stan::length(mu)
+
53  && stan::length(sigma)))
+
54  return 0.0;
+
55 
+
56  // set up return value accumulator
+
57  double logp(0.0);
+
58 
+
59  // validate args (here done over var, which should be OK)
+
60  if (!check_not_nan(function, y, "Random variable", &logp))
+
61  return logp;
+
62  if (!check_finite(function, mu, "Location parameter", &logp))
+
63  return logp;
+
64  if (!check_positive(function, sigma, "Scale parameter", &logp))
+
65  return logp;
+
66  if (!check_finite(function, sigma, "Scale parameter", &logp))
+
67  return logp;
+
68  if (!(check_consistent_sizes(function,
+
69  y,mu,sigma,
+
70  "Random variable","Location parameter",
+
71  "Scale parameter",
+
72  &logp)))
+
73  return logp;
+
74 
+
75  // check if no variables are involved and prop-to
+ +
77  return 0.0;
+
78 
+
79  using stan::math::log1p;
+
80  using stan::math::square;
+
81 
+
82  // set up template expressions wrapping scalars into vector views
+
83  VectorView<const T_y> y_vec(y);
+
84  VectorView<const T_loc> mu_vec(mu);
+
85  VectorView<const T_scale> sigma_vec(sigma);
+
86  size_t N = max_size(y, mu, sigma);
+
87 
+ + + +
91  is_vector<T_scale>::value> log_sigma(length(sigma));
+
92  for (size_t i = 0; i < length(sigma); i++) {
+
93  const double sigma_dbl = value_of(sigma_vec[i]);
+
94  inv_sigma[i] = 1.0 / sigma_dbl;
+
95  sigma_squared[i] = sigma_dbl * sigma_dbl;
+ +
97  log_sigma[i] = log(sigma_dbl);
+
98  }
+
99  }
+
100 
+
101  agrad::OperandsAndPartials<T_y, T_loc, T_scale> operands_and_partials(y, mu, sigma);
+
102 
+
103  for (size_t n = 0; n < N; n++) {
+
104  // pull out values of arguments
+
105  const double y_dbl = value_of(y_vec[n]);
+
106  const double mu_dbl = value_of(mu_vec[n]);
+
107 
+
108  // reusable subexpression values
+
109  const double y_minus_mu
+
110  = y_dbl - mu_dbl;
+
111  const double y_minus_mu_squared
+
112  = y_minus_mu * y_minus_mu;
+
113  const double y_minus_mu_over_sigma
+
114  = y_minus_mu * inv_sigma[n];
+
115  const double y_minus_mu_over_sigma_squared
+
116  = y_minus_mu_over_sigma * y_minus_mu_over_sigma;
+
117 
+
118  // log probability
+ +
120  logp += NEG_LOG_PI;
+ +
122  logp -= log_sigma[n];
+ +
124  logp -= log1p(y_minus_mu_over_sigma_squared);
+
125 
+
126  // gradients
+ +
128  operands_and_partials.d_x1[n] -= 2 * y_minus_mu / (sigma_squared[n] + y_minus_mu_squared);
+ +
130  operands_and_partials.d_x2[n] += 2 * y_minus_mu / (sigma_squared[n] + y_minus_mu_squared);
+ +
132  operands_and_partials.d_x3[n] += (y_minus_mu_squared - sigma_squared[n]) * inv_sigma[n] / (sigma_squared[n] + y_minus_mu_squared);
+
133  }
+
134  return operands_and_partials.to_var(logp);
+
135  }
+
136 
+
137  template <typename T_y, typename T_loc, typename T_scale>
+
138  inline
+ +
140  cauchy_log(const T_y& y, const T_loc& mu, const T_scale& sigma) {
+
141  return cauchy_log<false>(y,mu,sigma);
+
142  }
+
143 
+
144 
+
160  template <typename T_y, typename T_loc, typename T_scale>
+ +
162  cauchy_cdf(const T_y& y, const T_loc& mu, const T_scale& sigma) {
+
163 
+
164  // Size checks
+
165  if ( !( stan::length(y) && stan::length(mu)
+
166  && stan::length(sigma) ) )
+
167  return 1.0;
+
168 
+
169  static const char* function = "stan::prob::cauchy_cdf(%1%)";
+
170 
+ + + + +
175  using boost::math::tools::promote_args;
+
176  using stan::math::value_of;
+
177 
+
178  double P(1.0);
+
179 
+
180  if(!check_not_nan(function, y, "Random variable", &P))
+
181  return P;
+
182  if(!check_finite(function, mu, "Location parameter", &P))
+
183  return P;
+
184  if(!check_finite(function, sigma, "Scale parameter", &P))
+
185  return P;
+
186  if(!check_positive(function, sigma, "Scale parameter", &P))
+
187  return P;
+
188  if (!(check_consistent_sizes(function, y, mu, sigma,
+
189  "Random variable", "Location parameter",
+
190  "Scale Parameter",
+
191  &P)))
+
192  return P;
+
193 
+
194  // Wrap arguments in vectors
+
195  VectorView<const T_y> y_vec(y);
+
196  VectorView<const T_loc> mu_vec(mu);
+
197  VectorView<const T_scale> sigma_vec(sigma);
+
198  size_t N = max_size(y, mu, sigma);
+
199 
+ +
201  operands_and_partials(y, mu, sigma);
+
202 
+
203  // Explicit return for extreme values
+
204  // The gradients are technically ill-defined, but treated as zero
+
205  for (size_t i = 0; i < stan::length(y); i++) {
+
206  if (value_of(y_vec[i]) == -std::numeric_limits<double>::infinity())
+
207  return operands_and_partials.to_var(0.0);
+
208  }
+
209 
+
210  // Compute CDF and its gradients
+
211  using std::atan;
+
212  using stan::math::pi;
+
213 
+
214  // Compute vectorized CDF and gradient
+
215  for (size_t n = 0; n < N; n++) {
+
216 
+
217  // Explicit results for extreme values
+
218  // The gradients are technically ill-defined, but treated as zero
+
219  if (value_of(y_vec[n]) == std::numeric_limits<double>::infinity()) {
+
220  continue;
+
221  }
+
222 
+
223  // Pull out values
+
224  const double y_dbl = value_of(y_vec[n]);
+
225  const double mu_dbl = value_of(mu_vec[n]);
+
226  const double sigma_inv_dbl = 1.0 / value_of(sigma_vec[n]);
+
227 
+
228  const double z = (y_dbl - mu_dbl) * sigma_inv_dbl;
+
229 
+
230  // Compute
+
231  const double Pn = atan(z) / pi() + 0.5;
+
232 
+
233  P *= Pn;
+
234 
+ +
236  operands_and_partials.d_x1[n]
+
237  += sigma_inv_dbl / (pi() * (1.0 + z * z) * Pn);
+ +
239  operands_and_partials.d_x2[n]
+
240  += - sigma_inv_dbl / (pi() * (1.0 + z * z) * Pn);
+ +
242  operands_and_partials.d_x3[n]
+
243  += - z * sigma_inv_dbl / (pi() * (1.0 + z * z) * Pn);
+
244 
+
245  }
+
246 
+ +
248  for(size_t n = 0; n < stan::length(y); ++n)
+
249  operands_and_partials.d_x1[n] *= P;
+
250  }
+ +
252  for(size_t n = 0; n < stan::length(mu); ++n)
+
253  operands_and_partials.d_x2[n] *= P;
+
254  }
+ +
256  for(size_t n = 0; n < stan::length(sigma); ++n)
+
257  operands_and_partials.d_x3[n] *= P;
+
258  }
+
259 
+
260  return operands_and_partials.to_var(P);
+
261  }
+
262 
+
263  template <typename T_y, typename T_loc, typename T_scale>
+ +
265  cauchy_cdf_log(const T_y& y, const T_loc& mu, const T_scale& sigma) {
+
266 
+
267  // Size checks
+
268  if ( !( stan::length(y) && stan::length(mu)
+
269  && stan::length(sigma) ) )
+
270  return 0.0;
+
271 
+
272  static const char* function = "stan::prob::cauchy_cdf(%1%)";
+
273 
+ + + + +
278  using boost::math::tools::promote_args;
+
279  using stan::math::value_of;
+
280 
+
281  double cdf_log(0.0);
+
282 
+
283  if(!check_not_nan(function, y, "Random variable", &cdf_log))
+
284  return cdf_log;
+
285  if(!check_finite(function, mu, "Location parameter", &cdf_log))
+
286  return cdf_log;
+
287  if(!check_finite(function, sigma, "Scale parameter", &cdf_log))
+
288  return cdf_log;
+
289  if(!check_positive(function, sigma, "Scale parameter", &cdf_log))
+
290  return cdf_log;
+
291  if (!(check_consistent_sizes(function, y, mu, sigma,
+
292  "Random variable", "Location parameter",
+
293  "Scale Parameter", &cdf_log)))
+
294  return cdf_log;
+
295 
+
296  // Wrap arguments in vectors
+
297  VectorView<const T_y> y_vec(y);
+
298  VectorView<const T_loc> mu_vec(mu);
+
299  VectorView<const T_scale> sigma_vec(sigma);
+
300  size_t N = max_size(y, mu, sigma);
+
301 
+ +
303  operands_and_partials(y, mu, sigma);
+
304 
+
305  // Compute CDFLog and its gradients
+
306  using std::atan;
+
307  using stan::math::pi;
+
308 
+
309  // Compute vectorized CDF and gradient
+
310  for (size_t n = 0; n < N; n++) {
+
311 
+
312  // Pull out values
+
313  const double y_dbl = value_of(y_vec[n]);
+
314  const double mu_dbl = value_of(mu_vec[n]);
+
315  const double sigma_inv_dbl = 1.0 / value_of(sigma_vec[n]);
+
316  const double sigma_dbl = value_of(sigma_vec[n]);
+
317 
+
318  const double z = (y_dbl - mu_dbl) * sigma_inv_dbl;
+
319 
+
320  // Compute
+
321  const double Pn = atan(z) / pi() + 0.5;
+
322  cdf_log += log(Pn);
+
323 
+
324  const double rep_deriv = 1.0 / (pi() * Pn
+
325  * (z * z * sigma_dbl + sigma_dbl));
+ +
327  operands_and_partials.d_x1[n] += rep_deriv;
+ +
329  operands_and_partials.d_x2[n] -= rep_deriv;
+ +
331  operands_and_partials.d_x3[n] -= rep_deriv * z;
+
332  }
+
333  return operands_and_partials.to_var(cdf_log);
+
334  }
+
335 
+
336  template <typename T_y, typename T_loc, typename T_scale>
+ +
338  cauchy_ccdf_log(const T_y& y, const T_loc& mu, const T_scale& sigma) {
+
339 
+
340  // Size checks
+
341  if ( !( stan::length(y) && stan::length(mu)
+
342  && stan::length(sigma) ) )
+
343  return 0.0;
+
344 
+
345  static const char* function = "stan::prob::cauchy_cdf(%1%)";
+
346 
+ + + + +
351  using boost::math::tools::promote_args;
+
352  using stan::math::value_of;
+
353 
+
354  double ccdf_log(0.0);
+
355 
+
356  if(!check_not_nan(function, y, "Random variable", &ccdf_log))
+
357  return ccdf_log;
+
358  if(!check_finite(function, mu, "Location parameter", &ccdf_log))
+
359  return ccdf_log;
+
360  if(!check_finite(function, sigma, "Scale parameter", &ccdf_log))
+
361  return ccdf_log;
+
362  if(!check_positive(function, sigma, "Scale parameter", &ccdf_log))
+
363  return ccdf_log;
+
364  if (!(check_consistent_sizes(function, y, mu, sigma,
+
365  "Random variable", "Location parameter",
+
366  "Scale Parameter", &ccdf_log)))
+
367  return ccdf_log;
+
368 
+
369  // Wrap arguments in vectors
+
370  VectorView<const T_y> y_vec(y);
+
371  VectorView<const T_loc> mu_vec(mu);
+
372  VectorView<const T_scale> sigma_vec(sigma);
+
373  size_t N = max_size(y, mu, sigma);
+
374 
+ +
376  operands_and_partials(y, mu, sigma);
+
377 
+
378  // Compute CDFLog and its gradients
+
379  using std::atan;
+
380  using stan::math::pi;
+
381 
+
382  // Compute vectorized CDF and gradient
+
383  for (size_t n = 0; n < N; n++) {
+
384 
+
385  // Pull out values
+
386  const double y_dbl = value_of(y_vec[n]);
+
387  const double mu_dbl = value_of(mu_vec[n]);
+
388  const double sigma_inv_dbl = 1.0 / value_of(sigma_vec[n]);
+
389  const double sigma_dbl = value_of(sigma_vec[n]);
+
390  const double z = (y_dbl - mu_dbl) * sigma_inv_dbl;
+
391 
+
392  // Compute
+
393  const double Pn = 0.5 - atan(z) / pi();
+
394  ccdf_log += log(Pn);
+
395 
+
396  const double rep_deriv = 1.0 / (Pn * pi()
+
397  * (z * z * sigma_dbl + sigma_dbl));
+ +
399  operands_and_partials.d_x1[n] -= rep_deriv;
+ +
401  operands_and_partials.d_x2[n] += rep_deriv;
+ +
403  operands_and_partials.d_x3[n] += rep_deriv * z;
+
404  }
+
405  return operands_and_partials.to_var(ccdf_log);
+
406  }
+
407 
+
408  template <class RNG>
+
409  inline double
+
410  cauchy_rng(const double mu,
+
411  const double sigma,
+
412  RNG& rng) {
+
413  using boost::variate_generator;
+
414  using boost::random::cauchy_distribution;
+
415 
+
416  static const char* function = "stan::prob::cauchy_rng(%1%)";
+
417 
+ + +
420 
+
421  if (!check_finite(function, mu, "Location parameter"))
+
422  return 0;
+
423  if (!check_positive(function, sigma, "Scale parameter"))
+
424  return 0;
+
425  if (!check_finite(function, sigma, "Scale parameter"))
+
426  return 0;
+
427 
+
428  variate_generator<RNG&, cauchy_distribution<> >
+
429  cauchy_rng(rng, cauchy_distribution<>(mu, sigma));
+
430  return cauchy_rng();
+
431  }
+
432  }
+
433 }
+
434 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/chainable_8hpp.html b/doc/api/html/chainable_8hpp.html new file mode 100644 index 00000000000..e20e828fee1 --- /dev/null +++ b/doc/api/html/chainable_8hpp.html @@ -0,0 +1,140 @@ + + + + + +Stan: src/stan/agrad/rev/chainable.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
chainable.hpp File Reference
+
+
+
#include <vector>
+#include <stan/agrad/rev/var_stack.hpp>
+
+

Go to the source code of this file.

+ + + + + +

+Classes

class  stan::agrad::chainable
 Abstract base class for variable implementations that handles memory management and applying the chain rule. More...
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + +

+Functions

static void stan::agrad::set_zero_all_adjoints ()
 Reset all adjoint values in the stack to zero.
 
static void stan::agrad::grad (chainable *vi)
 Compute the gradient for all variables starting from the specified root variable implementation.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/chainable_8hpp_source.html b/doc/api/html/chainable_8hpp_source.html new file mode 100644 index 00000000000..84e3bc0e03d --- /dev/null +++ b/doc/api/html/chainable_8hpp_source.html @@ -0,0 +1,165 @@ + + + + + +Stan: src/stan/agrad/rev/chainable.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
chainable.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__CHAINABLE_HPP__
+
2 #define __STAN__AGRAD__REV__CHAINABLE_HPP__
+
3 
+
4 #include <vector>
+ +
6 
+
7 namespace stan {
+
8  namespace agrad {
+
9 
+
14  class chainable {
+
15 
+
16  public:
+
17 
+
22  chainable() { }
+
23 
+
28  virtual ~chainable() {
+
29  // handled automatically
+
30  }
+
31 
+
37  virtual void chain() {
+
38  }
+
39 
+
44  virtual void init_dependent() {
+
45  }
+
46 
+
51  virtual void set_zero_adjoint() {
+
52  }
+
53 
+
63  static inline void* operator new(size_t nbytes) {
+
64  return memalloc_.alloc(nbytes);
+
65  }
+
66 
+
77  static inline void operator delete(void* /* ignore arg */) {
+
78  /* no op */
+
79  }
+
80  };
+
81 
+
82 
+
83 
+
87  static void set_zero_all_adjoints() {
+
88  for (size_t i = 0; i < var_stack_.size(); ++i)
+
89  var_stack_[i]->set_zero_adjoint();
+
90  for (size_t i = 0; i < var_nochain_stack_.size(); ++i)
+
91  var_nochain_stack_[i]->set_zero_adjoint();
+
92  }
+
93 
+
106  static void grad(chainable* vi) {
+
107  std::vector<chainable*>::reverse_iterator it;
+
108 
+
109  vi->init_dependent();
+
110  // propagate derivates for vars
+
111  for (it = var_stack_.rbegin(); it < var_stack_.rend(); ++it)
+
112  (*it)->chain();
+
113  }
+
114 
+
115  }
+
116 }
+
117 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/chains_8hpp.html b/doc/api/html/chains_8hpp.html new file mode 100644 index 00000000000..c7bc29c3164 --- /dev/null +++ b/doc/api/html/chains_8hpp.html @@ -0,0 +1,154 @@ + + + + + +Stan: src/stan/mcmc/chains.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
chains.hpp File Reference
+
+
+
#include <algorithm>
+#include <cmath>
+#include <iostream>
+#include <map>
+#include <stdexcept>
+#include <string>
+#include <sstream>
+#include <utility>
+#include <vector>
+#include <fstream>
+#include <cstdlib>
+#include <boost/accumulators/accumulators.hpp>
+#include <boost/accumulators/statistics/stats.hpp>
+#include <boost/accumulators/statistics/mean.hpp>
+#include <boost/accumulators/statistics/tail_quantile.hpp>
+#include <boost/accumulators/statistics/p_square_quantile.hpp>
+#include <boost/accumulators/statistics/variance.hpp>
+#include <boost/accumulators/statistics/covariance.hpp>
+#include <boost/accumulators/statistics/variates/covariate.hpp>
+#include <boost/random/uniform_int_distribution.hpp>
+#include <boost/random/additive_combine.hpp>
+#include <stan/math/matrix.hpp>
+#include <stan/math/matrix/variance.hpp>
+#include <stan/prob/autocorrelation.hpp>
+#include <stan/prob/autocovariance.hpp>
+#include <stan/io/stan_csv_reader.hpp>
+
+

Go to the source code of this file.

+ + + + + +

+Classes

class  stan::mcmc::chains< RNG >
 An mcmc::chains object stores parameter names and dimensionalities along with samples from multiple chains. More...
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/chains_8hpp_source.html b/doc/api/html/chains_8hpp_source.html new file mode 100644 index 00000000000..cf328eb67b9 --- /dev/null +++ b/doc/api/html/chains_8hpp_source.html @@ -0,0 +1,702 @@ + + + + + +Stan: src/stan/mcmc/chains.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
chains.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__CHAINS_HPP__
+
2 #define __STAN__MCMC__CHAINS_HPP__
+
3 
+
4 #include <algorithm>
+
5 #include <cmath>
+
6 #include <iostream>
+
7 #include <map>
+
8 #include <stdexcept>
+
9 #include <string>
+
10 #include <sstream>
+
11 #include <utility>
+
12 #include <vector>
+
13 #include <fstream>
+
14 #include <cstdlib>
+
15 
+
16 #include <boost/accumulators/accumulators.hpp>
+
17 #include <boost/accumulators/statistics/stats.hpp>
+
18 #include <boost/accumulators/statistics/mean.hpp>
+
19 #include <boost/accumulators/statistics/tail_quantile.hpp>
+
20 #include <boost/accumulators/statistics/p_square_quantile.hpp>
+
21 #include <boost/accumulators/statistics/variance.hpp>
+
22 #include <boost/accumulators/statistics/covariance.hpp>
+
23 #include <boost/accumulators/statistics/variates/covariate.hpp>
+
24 
+
25 
+
26 #include <boost/random/uniform_int_distribution.hpp>
+
27 #include <boost/random/additive_combine.hpp>
+
28 
+
29 #include <stan/math/matrix.hpp>
+ + + +
33 
+ +
35 
+
36 namespace stan {
+
37 
+
38  namespace mcmc {
+
39 
+
54  template <typename RNG = boost::random::ecuyer1988>
+
55  class chains {
+
56  private:
+
57  Eigen::Matrix<std::string, Eigen::Dynamic, 1> param_names_;
+
58  Eigen::Matrix<Eigen::MatrixXd, Eigen::Dynamic, 1> samples_;
+
59  Eigen::VectorXi warmup_;
+
60 
+
61  double mean(const Eigen::VectorXd& x) {
+
62  return (x.array() / x.size()).sum();
+
63  }
+
64 
+
65  double variance(const Eigen::VectorXd& x) {
+
66  double m = mean(x);
+
67  return ((x.array() - m) / std::sqrt((x.size() - 1.0))).square().sum();
+
68  }
+
69 
+
70  double sd(const Eigen::VectorXd& x) {
+
71  return std::sqrt(variance(x));
+
72  }
+
73 
+
74 
+
75  double covariance(const Eigen::VectorXd& x, const Eigen::VectorXd& y) {
+
76  if (x.rows() != y.rows())
+
77  std::cerr << "warning: covariance of different length chains";
+
78  using boost::accumulators::accumulator_set;
+
79  using boost::accumulators::stats;
+ +
81  using boost::accumulators::tag::covariance;
+
82  using boost::accumulators::tag::covariate1;
+
83 
+
84  accumulator_set<double, stats<covariance<double, covariate1> > > acc;
+
85 
+
86  int M = std::min(x.size(), y.size());
+
87  for (int i = 0; i < M; i++)
+
88  acc(x(i), boost::accumulators::covariate1=y(i));
+
89 
+
90  return boost::accumulators::covariance(acc) * M / (M-1);
+
91  }
+
92 
+
93  double correlation(const Eigen::VectorXd& x, const Eigen::VectorXd& y) {
+
94  if (x.rows() != y.rows())
+
95  std::cerr << "warning: covariance of different length chains";
+
96  using boost::accumulators::accumulator_set;
+
97  using boost::accumulators::stats;
+ +
99  using boost::accumulators::tag::covariance;
+
100  using boost::accumulators::tag::covariate1;
+
101 
+
102  accumulator_set<double, stats<variance, covariance<double, covariate1> > > acc_xy;
+
103  accumulator_set<double, stats<variance> > acc_y;
+
104 
+
105  int M = std::min(x.size(), y.size());
+
106  for (int i = 0; i < M; i++) {
+
107  acc_xy(x(i), boost::accumulators::covariate1=y(i));
+
108  acc_y(y(i));
+
109  }
+
110 
+
111  double cov = boost::accumulators::covariance(acc_xy);
+
112  if (cov > -1e-8 && cov < 1e-8)
+
113  return cov;
+ +
115  }
+
116 
+
117  double quantile(const Eigen::VectorXd& x, const double prob) {
+
118  using boost::accumulators::accumulator_set;
+
119  using boost::accumulators::left;
+
120  using boost::accumulators::quantile_probability;
+
121  using boost::accumulators::right;
+
122  using boost::accumulators::stats;
+ +
124  using boost::accumulators::tag::tail_quantile;
+
125  double M = x.rows();
+
126  //size_t cache_size = std::min(prob, 1-prob)*M + 2;
+
127  size_t cache_size = M;
+
128 
+
129  if (prob < 0.5) {
+
130  accumulator_set<double, stats<tail_quantile<left> > >
+
131  acc(tail<left>::cache_size = cache_size);
+
132  for (int i = 0; i < M; i++)
+
133  acc(x(i));
+
134  return boost::accumulators::quantile(acc, quantile_probability=prob);
+
135  }
+
136  accumulator_set<double, stats<tail_quantile<right> > >
+
137  acc(tail<right>::cache_size = cache_size);
+
138  for (int i = 0; i < M; i++)
+
139  acc(x(i));
+
140  return boost::accumulators::quantile(acc, quantile_probability=prob);
+
141  }
+
142 
+
143  Eigen::VectorXd quantiles(const Eigen::VectorXd& x, const Eigen::VectorXd& probs) {
+
144  using boost::accumulators::accumulator_set;
+
145  using boost::accumulators::left;
+
146  using boost::accumulators::quantile_probability;
+
147  using boost::accumulators::right;
+
148  using boost::accumulators::stats;
+ +
150  using boost::accumulators::tag::tail_quantile;
+
151  double M = x.rows();
+
152 
+
153  //size_t cache_size = M/2 + 2;
+
154  size_t cache_size = M;
+
155 
+
156  accumulator_set<double, stats<tail_quantile<left> > >
+
157  acc_left(tail<left>::cache_size = cache_size);
+
158  accumulator_set<double, stats<tail_quantile<right> > >
+
159  acc_right(tail<right>::cache_size = cache_size);
+
160 
+
161  for (int i = 0; i < M; i++) {
+
162  acc_left(x(i));
+
163  acc_right(x(i));
+
164  }
+
165 
+
166  Eigen::VectorXd q(probs.size());
+
167  for (int i = 0; i < probs.size(); i++) {
+
168  if (probs(i) < 0.5)
+
169  q(i) = boost::accumulators::quantile(acc_left, quantile_probability=probs(i));
+
170  else
+
171  q(i) = boost::accumulators::quantile(acc_right, quantile_probability=probs(i));
+
172  }
+
173  return q;
+
174  }
+
175 
+
176  Eigen::VectorXd autocorrelation(const Eigen::VectorXd& x) {
+
177  std::vector<double> ac;
+
178  std::vector<double> sample(x.size());
+
179  for (int i = 0; i < x.size(); i++)
+
180  sample[i] = x(i);
+ +
182 
+
183  Eigen::VectorXd ac2(ac.size());
+
184  for (std::vector<double>::size_type i = 0; i < ac.size(); i++)
+
185  ac2(i) = ac[i];
+
186  return ac2;
+
187  }
+
188 
+
189  Eigen::VectorXd autocovariance(const Eigen::VectorXd& x) {
+
190  std::vector<double> ac;
+
191  std::vector<double> sample(x.size());
+
192  for (int i = 0; i < x.size(); i++)
+
193  sample[i] = x(i);
+ +
195 
+
196  Eigen::VectorXd ac2(ac.size());
+
197  for (std::vector<double>::size_type i = 0; i < ac.size(); i++)
+
198  ac2(i) = ac[i];
+
199  return ac2;
+
200  }
+
201 
+
217  double effective_sample_size(const Eigen::Matrix<Eigen::VectorXd, Eigen::Dynamic, 1> &samples) {
+
218  int chains = samples.size();
+
219 
+
220  // need to generalize to each jagged samples per chain
+
221  int n_samples = samples(0).size();
+
222  for (int chain = 1; chain < chains; chain++) {
+
223  n_samples = std::min(n_samples, int(samples(chain).size()));
+
224  }
+
225 
+
226  Eigen::Matrix<Eigen::VectorXd, Eigen::Dynamic, 1> acov(chains);
+
227  for (int chain = 0; chain < chains; chain++) {
+
228  acov(chain) = autocovariance(samples(chain));
+
229  }
+
230 
+
231  Eigen::VectorXd chain_mean(chains);
+
232  Eigen::VectorXd chain_var(chains);
+
233  for (int chain = 0; chain < chains; chain++) {
+
234  double n_kept_samples = num_kept_samples(chain);
+
235  chain_mean(chain) = mean(samples(chain));
+
236  chain_var(chain) = acov(chain)(0)*n_kept_samples/(n_kept_samples-1);
+
237  }
+
238 
+
239  double mean_var = mean(chain_var);
+
240  double var_plus = mean_var*(n_samples-1)/n_samples;
+
241  if (chains > 1)
+
242  var_plus += variance(chain_mean);
+
243  Eigen::VectorXd rho_hat_t(n_samples);
+
244  rho_hat_t.setZero();
+
245  double rho_hat = 0;
+
246  int max_t = 0;
+
247  for (int t = 1; (t < n_samples && rho_hat >= 0); t++) {
+
248  Eigen::VectorXd acov_t(chains);
+
249  for (int chain = 0; chain < chains; chain++) {
+
250  acov_t(chain) = acov(chain)(t);
+
251  }
+
252  rho_hat = 1 - (mean_var - mean(acov_t)) / var_plus;
+
253  if (rho_hat >= 0)
+
254  rho_hat_t(t) = rho_hat;
+
255  max_t = t;
+
256  }
+
257  double ess = chains * n_samples;
+
258  if (max_t > 1) {
+
259  ess /= 1 + 2 * rho_hat_t.sum();
+
260  }
+
261  return ess;
+
262  }
+
263 
+
277  double split_potential_scale_reduction(const Eigen::Matrix<Eigen::VectorXd, Eigen::Dynamic, 1> &samples) {
+
278  int chains = samples.size();
+
279  int n_samples = samples(0).size();
+
280  for (int chain = 1; chain < chains; chain++) {
+
281  n_samples = std::min(n_samples, int(samples(chain).size()));
+
282  }
+
283  if (n_samples % 2 == 1)
+
284  n_samples--;
+
285  int n = n_samples / 2;
+
286 
+
287  Eigen::VectorXd split_chain_mean(2*chains);
+
288  Eigen::VectorXd split_chain_var(2*chains);
+
289 
+
290  for (int chain = 0; chain < chains; chain++) {
+
291  split_chain_mean(2*chain) = mean(samples(chain).topRows(n));
+
292  split_chain_mean(2*chain+1) = mean(samples(chain).bottomRows(n));
+
293 
+
294  split_chain_var(2*chain) = variance(samples(chain).topRows(n));
+
295  split_chain_var(2*chain+1) = variance(samples(chain).bottomRows(n));
+
296  }
+
297 
+
298 
+
299  double var_between = n * variance(split_chain_mean);
+
300  double var_within = mean(split_chain_var);
+
301 
+
302  // rewrote [(n-1)*W/n + B/n]/W as (n-1+ B/W)/n
+
303  return sqrt((var_between/var_within + n-1)/n);
+
304  }
+
305 
+
306  public:
+
307  chains(const Eigen::Matrix<std::string, Eigen::Dynamic, 1>& param_names)
+
308  : param_names_(param_names) { }
+
309 
+
310  chains(const stan::io::stan_csv& stan_csv)
+
311  : param_names_(stan_csv.header) {
+
312  if (stan_csv.samples.rows() > 0)
+
313  add(stan_csv);
+
314  }
+
315 
+
316  inline const int num_chains() {
+
317  return samples_.size();
+
318  }
+
319 
+
320  inline const int num_params() {
+
321  return param_names_.size();
+
322  }
+
323 
+
324  const Eigen::Matrix<std::string, Eigen::Dynamic, 1>& param_names() {
+
325  return param_names_;
+
326  }
+
327 
+
328  const std::string& param_name(int j) {
+
329  return param_names_(j);
+
330  }
+
331 
+
332  const int index(const std::string& name) {
+
333  int index = -1;
+
334  for (int i = 0; i < param_names_.size(); i++)
+
335  if (param_names_(i) == name)
+
336  return i;
+
337  return index;
+
338  }
+
339 
+
340  void set_warmup(const int chain, const int warmup) {
+
341  warmup_(chain) = warmup;
+
342  }
+
343 
+
344  void set_warmup(const int warmup) {
+
345  warmup_.setConstant(warmup);
+
346  }
+
347 
+
348  const Eigen::VectorXi& warmup() {
+
349  return warmup_;
+
350  }
+
351 
+
352  const int warmup(const int chain) {
+
353  return warmup_(chain);
+
354  }
+
355 
+
356  const int num_samples(const int chain) {
+
357  return samples_(chain).rows();
+
358  }
+
359 
+
360  const int num_samples() {
+
361  int n = 0;
+
362  for (int chain = 0; chain < num_chains(); chain++)
+
363  n += num_samples(chain);
+
364  return n;
+
365  }
+
366 
+
367  const int num_kept_samples(const int chain) {
+
368  return num_samples(chain) - warmup(chain);
+
369  }
+
370 
+
371  const int num_kept_samples() {
+
372  int n = 0;
+
373  for (int chain = 0; chain < num_chains(); chain++)
+
374  n += num_kept_samples(chain);
+
375  return n;
+
376  }
+
377 
+
378  void add(const int chain,
+
379  const Eigen::MatrixXd& sample) {
+
380  if (sample.cols() != num_params())
+
381  throw std::invalid_argument("add(chain,sample): number of columns in sample does not match chains");
+
382  if (num_chains() == 0 || chain >= num_chains()) {
+
383  int n = num_chains();
+
384 
+
385  // Need this block for Windows. conservativeResize does not keep the references.
+
386  Eigen::Matrix<Eigen::MatrixXd, Eigen::Dynamic, 1> samples_copy(num_chains());
+
387  Eigen::VectorXi warmup_copy(num_chains());
+
388  for (int i = 0; i < n; i++) {
+
389  samples_copy(i) = samples_(i);
+
390  warmup_copy(i) = warmup_(i);
+
391  }
+
392 
+
393  samples_.resize(chain+1);
+
394  warmup_.resize(chain+1);
+
395  for (int i = 0; i < n; i++) {
+
396  samples_(i) = samples_copy(i);
+
397  warmup_(i) = warmup_copy(i);
+
398  }
+
399  for (int i = n; i < chain+1; i++) {
+
400  samples_(i) = Eigen::MatrixXd(0, num_params());
+
401  warmup_(i) = 0;
+
402  }
+
403  }
+
404  int row = samples_(chain).rows();
+
405  Eigen::MatrixXd new_samples(row+sample.rows(), num_params());
+
406  new_samples << samples_(chain), sample;
+
407  samples_(chain) = new_samples;
+
408  }
+
409 
+
410  void add(const Eigen::MatrixXd& sample) {
+
411  if (sample.rows() == 0)
+
412  return;
+
413  if (sample.cols() != num_params())
+
414  throw std::invalid_argument("add(sample): number of columns in sample does not match chains");
+
415  add(num_chains(), sample);
+
416  }
+
417 
+
418  void add(const stan::io::stan_csv& stan_csv) {
+
419  if (stan_csv.header.size() != num_params())
+
420  throw std::invalid_argument("add(stan_csv): number of columns in sample does not match chains");
+
421  if (!param_names_.cwiseEqual(stan_csv.header).all()) {
+
422  throw std::invalid_argument("add(stan_csv): header does not match chain's header");
+
423  }
+
424  add(stan_csv.samples);
+
425  if (stan_csv.metadata.save_warmup)
+
426  set_warmup(num_chains()-1, stan_csv.metadata.num_warmup);
+
427  }
+
428 
+
429  Eigen::VectorXd samples(const int chain, const int index) {
+
430  return samples_(chain).col(index).bottomRows(num_kept_samples(chain));
+
431  }
+
432 
+
433  Eigen::VectorXd samples(const int index) {
+
434  Eigen::VectorXd s(num_kept_samples());
+
435  int start = 0;
+
436  for (int chain = 0; chain < num_chains(); chain++) {
+
437  int n = num_kept_samples(chain);
+
438  s.middleRows(start,n) = samples_(chain).col(index).bottomRows(n);
+
439  start += n;
+
440  }
+
441  return s;
+
442  }
+
443 
+
444  Eigen::VectorXd samples(const int chain, const std::string& name) {
+
445  return samples(chain,index(name));
+
446  }
+
447 
+
448  Eigen::VectorXd samples(const std::string& name) {
+
449  return samples(index(name));
+
450  }
+
451 
+
452  double mean(const int chain, const int index) {
+
453  return mean(samples(chain,index));
+
454  }
+
455 
+
456  double mean(const int index) {
+
457  return mean(samples(index));
+
458  }
+
459 
+
460  double mean(const int chain, const std::string& name) {
+
461  return mean(chain, index(name));
+
462  }
+
463 
+
464  double mean(const std::string& name) {
+
465  return mean(index(name));
+
466  }
+
467 
+
468  double sd(const int chain, const int index) {
+
469  return sd(samples(chain,index));
+
470  }
+
471 
+
472  double sd(const int index) {
+
473  return sd(samples(index));
+
474  }
+
475 
+
476  double sd(const int chain, const std::string& name) {
+
477  return sd(chain, index(name));
+
478  }
+
479 
+
480  double sd(const std::string& name) {
+
481  return sd(index(name));
+
482  }
+
483 
+
484  double variance(const int chain, const int index) {
+
485  return variance(samples(chain,index));
+
486  }
+
487 
+
488  double variance(const int index) {
+
489  return variance(samples(index));
+
490  }
+
491 
+
492  double variance(const int chain, const std::string& name) {
+
493  return variance(chain, index(name));
+
494  }
+
495 
+
496  double variance(const std::string& name) {
+
497  return variance(index(name));
+
498  }
+
499 
+
500  double covariance(const int chain, const int index1, const int index2) {
+
501  return covariance(samples(chain,index1), samples(chain,index2));
+
502  }
+
503 
+
504  double covariance(const int index1, const int index2) {
+
505  return covariance(samples(index1), samples(index2));
+
506  }
+
507 
+
508  double covariance(const int chain, const std::string& name1, const std::string& name2) {
+
509  return covariance(chain, index(name1), index(name2));
+
510  }
+
511 
+
512  double covariance(const std::string& name1, const std::string& name2) {
+
513  return covariance(index(name1), index(name2));
+
514  }
+
515 
+
516  double correlation(const int chain, const int index1, const int index2) {
+
517  return correlation(samples(chain,index1),samples(chain,index2));
+
518  }
+
519 
+
520  double correlation(const int index1, const int index2) {
+
521  return correlation(samples(index1),samples(index2));
+
522  }
+
523 
+
524  double correlation(const int chain, const std::string& name1, const std::string& name2) {
+
525  return correlation(chain, index(name1), index(name2));
+
526  }
+
527 
+
528  double correlation(const std::string& name1, const std::string& name2) {
+
529  return correlation(index(name1), index(name2));
+
530  }
+
531 
+
532  double quantile(const int chain, const int index, const double prob) {
+
533  return quantile(samples(chain,index), prob);
+
534  }
+
535 
+
536  double quantile(const int index, const double prob) {
+
537  return quantile(samples(index), prob);
+
538  }
+
539 
+
540  double quantile(const int chain, const std::string& name, const double prob) {
+
541  return quantile(chain, index(name), prob);
+
542  }
+
543 
+
544  double quantile(const std::string& name, const double prob) {
+
545  return quantile(index(name), prob);
+
546  }
+
547 
+
548  Eigen::VectorXd quantiles(const int chain, const int index, const Eigen::VectorXd& probs) {
+
549  return quantiles(samples(chain,index), probs);
+
550  }
+
551 
+
552  Eigen::VectorXd quantiles(const int index, const Eigen::VectorXd& probs) {
+
553  return quantiles(samples(index), probs);
+
554  }
+
555 
+
556  Eigen::VectorXd quantiles(const int chain,
+
557  const std::string& name, const Eigen::VectorXd& probs) {
+
558  return quantiles(chain, index(name), probs);
+
559  }
+
560 
+
561  Eigen::VectorXd quantiles(const std::string& name, const Eigen::VectorXd& probs) {
+
562  return quantiles(index(name), probs);
+
563  }
+
564 
+
565  Eigen::Vector2d central_interval(const int chain, const int index, const double prob) {
+
566  double low_prob = (1-prob)/2;
+
567  double high_prob = 1-low_prob;
+
568 
+
569  Eigen::Vector2d interval;
+
570  interval << quantile(chain,index,low_prob), quantile(chain,index,high_prob);
+
571  return interval;
+
572  }
+
573 
+
574  Eigen::Vector2d central_interval(const int index, const double prob) {
+
575  double low_prob = (1-prob)/2;
+
576  double high_prob = 1-low_prob;
+
577 
+
578  Eigen::Vector2d interval;
+
579  interval << quantile(index,low_prob), quantile(index,high_prob);
+
580  return interval;
+
581  }
+
582 
+
583  Eigen::Vector2d central_interval(const int chain,
+
584  const std::string& name, const double prob) {
+
585  return central_interval(chain, index(name), prob);
+
586  }
+
587 
+
588  Eigen::Vector2d central_interval(const std::string& name, const double prob) {
+
589  return central_interval(index(name), prob);
+
590  }
+
591 
+
592  Eigen::VectorXd autocorrelation(const int chain, const int index) {
+
593  return autocorrelation(samples(chain, index));
+
594  }
+
595 
+
596  Eigen::VectorXd autocorrelation(const int chain, const std::string& name) {
+
597  return autocorrelation(chain, index(name));
+
598  }
+
599 
+
600  Eigen::VectorXd autocovariance(const int chain, const int index) {
+
601  return autocovariance(samples(chain,index));
+
602  }
+
603 
+
604  Eigen::VectorXd autocovariance(const int chain, const std::string& name) {
+
605  return autocovariance(chain, index(name));
+
606  }
+
607 
+
608  // FIXME: reimplement using autocorrelation.
+
609  double effective_sample_size(const int index) {
+
610  Eigen::Matrix<Eigen::VectorXd, Eigen::Dynamic, 1> samples(num_chains());
+
611  for (int chain = 0; chain < num_chains(); chain++) {
+
612  samples(chain) = this->samples(chain, index);
+
613  }
+
614  return effective_sample_size(samples);
+
615  }
+
616 
+
617  double effective_sample_size(const std::string& name) {
+
618  return effective_sample_size(index(name));
+
619  }
+
620 
+ +
622  Eigen::Matrix<Eigen::VectorXd, Eigen::Dynamic, 1> samples(num_chains());
+
623  for (int chain = 0; chain < num_chains(); chain++) {
+
624  samples(chain) = this->samples(chain, index);
+
625  }
+
626  return split_potential_scale_reduction(samples);
+
627  }
+
628 
+
629  double split_potential_scale_reduction(const std::string& name) {
+
630  return split_potential_scale_reduction(index(name));
+
631  }
+
632  };
+
633 
+
634  }
+
635 }
+
636 
+
637 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__bounded_8hpp.html b/doc/api/html/check__bounded_8hpp.html new file mode 100644 index 00000000000..f3c968740b3 --- /dev/null +++ b/doc/api/html/check__bounded_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/error_handling/check_bounded.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
check_bounded.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + +

+Functions

template<typename T_y , typename T_low , typename T_high , typename T_result >
bool stan::math::check_bounded (const char *function, const T_y &y, const T_low &low, const T_high &high, const char *name, T_result *result)
 
template<typename T_y , typename T_low , typename T_high >
bool stan::math::check_bounded (const char *function, const T_y &y, const T_low &low, const T_high &high, const char *name)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__bounded_8hpp_source.html b/doc/api/html/check__bounded_8hpp_source.html new file mode 100644 index 00000000000..19e3e25b4cc --- /dev/null +++ b/doc/api/html/check__bounded_8hpp_source.html @@ -0,0 +1,197 @@ + + + + + +Stan: src/stan/math/error_handling/check_bounded.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
check_bounded.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__ERROR_HANDLING__CHECK_BOUNDED_HPP__
+
2 #define __STAN__MATH__ERROR_HANDLING__CHECK_BOUNDED_HPP__
+
3 
+ + +
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
10  namespace {
+
11  template <typename T_y,
+
12  typename T_low,
+
13  typename T_high,
+
14  typename T_result,
+
15  bool is_vec>
+
16  struct bounded {
+
17  static bool check(const char* function,
+
18  const T_y& y,
+
19  const T_low& low,
+
20  const T_high& high,
+
21  const char* name,
+
22  T_result* result) {
+
23  using stan::length;
+
24  using stan::max_size;
+
25  VectorView<const T_low> low_vec(low);
+
26  VectorView<const T_high> high_vec(high);
+
27  for (size_t n = 0; n < max_size(low, high); n++) {
+
28  if (!(low_vec[n] <= y && y <= high_vec[n]))
+
29  return dom_err(function,y,name," is %1%, but must be between ",
+
30  std::pair<typename scalar_type<T_low>::type,
+
31  typename scalar_type<T_high>::type>(low_vec[n],
+
32  high_vec[n]),
+
33  result);
+
34  }
+
35  return true;
+
36  }
+
37  };
+
38 
+
39  template <typename T_y,
+
40  typename T_low,
+
41  typename T_high,
+
42  typename T_result>
+
43  struct bounded<T_y, T_low, T_high, T_result, true> {
+
44  static bool check(const char* function,
+
45  const T_y& y,
+
46  const T_low& low,
+
47  const T_high& high,
+
48  const char* name,
+
49  T_result* result) {
+
50  using stan::length;
+
51  using stan::get;
+
52  VectorView<const T_low> low_vec(low);
+
53  VectorView<const T_high> high_vec(high);
+
54  for (size_t n = 0; n < length(y); n++) {
+
55  if (!(low_vec[n] <= get(y,n) && get(y,n) <= high_vec[n]))
+
56  return dom_err_vec(n,function,y,name,
+
57  " is %1%, but must be between ",
+
58  std::pair<typename scalar_type<T_low>::type,
+
59  typename scalar_type<T_high>::type>(low_vec[n],
+
60  high_vec[n]),
+
61  result);
+
62  }
+
63  return true;
+
64  }
+
65  };
+
66  }
+
67  template <typename T_y, typename T_low, typename T_high, typename T_result>
+
68  inline bool check_bounded(const char* function,
+
69  const T_y& y,
+
70  const T_low& low,
+
71  const T_high& high,
+
72  const char* name,
+
73  T_result* result) {
+
74  return bounded<T_y,T_low,T_high,T_result,
+ +
76  ::check(function,y,low,high,name,result);
+
77  }
+
78  template <typename T_y, typename T_low, typename T_high>
+
79  inline bool check_bounded(const char* function,
+
80  const T_y& y,
+
81  const T_low& low,
+
82  const T_high& high,
+
83  const char* name) {
+
84  return check_bounded<T_y,T_low,T_high,typename scalar_type<T_y>::type *>
+
85  (function,y,low,high,name,0);
+
86  }
+
87 
+
88  }
+
89 }
+
90 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__cholesky__factor_8hpp.html b/doc/api/html/check__cholesky__factor_8hpp.html new file mode 100644 index 00000000000..1f2f82d1699 --- /dev/null +++ b/doc/api/html/check__cholesky__factor_8hpp.html @@ -0,0 +1,143 @@ + + + + + +Stan: src/stan/math/error_handling/matrix/check_cholesky_factor.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
check_cholesky_factor.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + + + + + + + +

+Functions

template<typename T_y , typename T_result >
bool stan::math::check_cholesky_factor (const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)
 Return true if the specified matrix is a valid Cholesky factor.
 
template<typename T >
bool stan::math::check_cholesky_factor (const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)
 
template<typename T_y , typename T_result >
bool stan::math::check_cholesky_factor (const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, T_result *result)
 Return true if the specified matrix is a valid Cholesky factor (lower triangular, positive diagonal).
 
template<typename T >
bool stan::math::check_cholesky_factor (const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, T *result=0)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__cholesky__factor_8hpp_source.html b/doc/api/html/check__cholesky__factor_8hpp_source.html new file mode 100644 index 00000000000..3411ad040ba --- /dev/null +++ b/doc/api/html/check__cholesky__factor_8hpp_source.html @@ -0,0 +1,167 @@ + + + + + +Stan: src/stan/math/error_handling/matrix/check_cholesky_factor.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
check_cholesky_factor.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__ERROR_HANDLING__MATRIX__CHECK_CHOLESKY_FACTOR_HPP__
+
2 #define __STAN__MATH__ERROR_HANDLING__MATRIX__CHECK_CHOLESKY_FACTOR_HPP__
+
3 
+ + + + +
8 
+
9 
+
10 namespace stan {
+
11 
+
12  namespace math {
+
13 
+
29  template <typename T_y, typename T_result>
+
30  inline bool check_cholesky_factor(const char* function,
+
31  const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& y,
+
32  const char* name,
+
33  T_result* result) {
+
34  if (!check_less_or_equal(function,y.cols(),y.rows(),
+
35  "columns and rows of Cholesky factor",
+
36  result))
+
37  return false;
+
38  if (!check_positive(function, y.cols(), "columns of Cholesky factor",
+
39  result))
+
40  return false;
+
41  // FIXME: should report row i
+
42  if (!check_lower_triangular(function, y, name, result))
+
43  return false;
+
44  for (int i = 0; i < y.cols(); ++i)
+
45  if (!check_positive(function, y(i,i), name, result))
+
46  return false;
+
47  return true;
+
48  }
+
49 
+
50  template <typename T>
+
51  inline bool check_cholesky_factor(const char* function,
+
52  const Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& y,
+
53  const char* name,
+
54  T* result = 0) {
+
55  return check_cholesky_factor<T,T>(function,y,name,result);
+
56  }
+
57 
+
58 
+
70  template <typename T_y, typename T_result>
+
71  inline bool check_cholesky_factor(const char* function,
+
72  const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& y,
+
73  T_result* result) {
+
74  return check_cholesky_factor(function,y,"(internal variable)",result);
+
75  }
+
76 
+
77  template <typename T>
+
78  inline bool check_cholesky_factor(const char* function,
+
79  const Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& y,
+
80  T* result = 0) {
+
81  return check_cholesky_factor<T,T>(function,y,result);
+
82  }
+
83 
+
84  }
+
85 }
+
86 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__consistent__size_8hpp.html b/doc/api/html/check__consistent__size_8hpp.html new file mode 100644 index 00000000000..1a28987536b --- /dev/null +++ b/doc/api/html/check__consistent__size_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/error_handling/check_consistent_size.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
check_consistent_size.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T , typename T_result >
bool stan::math::check_consistent_size (size_t max_size, const char *function, const T &x, const char *name, T_result *result)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__consistent__size_8hpp_source.html b/doc/api/html/check__consistent__size_8hpp_source.html new file mode 100644 index 00000000000..71b5ed40c59 --- /dev/null +++ b/doc/api/html/check__consistent__size_8hpp_source.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/math/error_handling/check_consistent_size.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
check_consistent_size.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__ERROR_HANDLING__CHECK_CONSISTENT_SIZE_HPP__
+
2 #define __STAN__MATH__ERROR_HANDLING__CHECK_CONSISTENT_SIZE_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
10  template <typename T, typename T_result>
+
11  inline bool check_consistent_size(size_t max_size,
+
12  const char* function,
+
13  const T& x,
+
14  const char* name,
+
15  T_result* result) {
+
16  size_t x_size = stan::size_of(x);
+
17  if (is_vector<T>::value && x_size == max_size)
+
18  return true;
+
19  if (!is_vector<T>::value && x_size == 1)
+
20  return true;
+
21  return dom_err(function,x_size,name,
+
22  " (max size) is %1%, but must be consistent, 1 or max=",max_size,
+
23  result);
+
24  }
+
25 
+
26  }
+
27 }
+
28 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__consistent__sizes_8hpp.html b/doc/api/html/check__consistent__sizes_8hpp.html new file mode 100644 index 00000000000..37cd2cd5f13 --- /dev/null +++ b/doc/api/html/check__consistent__sizes_8hpp.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/math/error_handling/check_consistent_sizes.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
check_consistent_sizes.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + + +

+Functions

template<typename T1 , typename T2 , typename T_result >
bool stan::math::check_consistent_sizes (const char *function, const T1 &x1, const T2 &x2, const char *name1, const char *name2, T_result *result)
 
template<typename T1 , typename T2 , typename T3 , typename T_result >
bool stan::math::check_consistent_sizes (const char *function, const T1 &x1, const T2 &x2, const T3 &x3, const char *name1, const char *name2, const char *name3, T_result *result)
 
template<typename T1 , typename T2 , typename T3 , typename T4 , typename T_result >
bool stan::math::check_consistent_sizes (const char *function, const T1 &x1, const T2 &x2, const T3 &x3, const T4 &x4, const char *name1, const char *name2, const char *name3, const char *name4, T_result *result)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__consistent__sizes_8hpp_source.html b/doc/api/html/check__consistent__sizes_8hpp_source.html new file mode 100644 index 00000000000..cd66f9f529e --- /dev/null +++ b/doc/api/html/check__consistent__sizes_8hpp_source.html @@ -0,0 +1,168 @@ + + + + + +Stan: src/stan/math/error_handling/check_consistent_sizes.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
check_consistent_sizes.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__ERROR_HANDLING__CHECK_CONSISTENT_SIZES_HPP__
+
2 #define __STAN__MATH__ERROR_HANDLING__CHECK_CONSISTENT_SIZES_HPP__
+
3 
+ + +
6 #include <stan/meta/traits.hpp>
+
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
11  template <typename T1, typename T2, typename T_result>
+
12  inline bool check_consistent_sizes(const char* function,
+
13  const T1& x1,
+
14  const T2& x2,
+
15  const char* name1,
+
16  const char* name2,
+
17  T_result* result) {
+
18  size_t max_size = std::max(size_of(x1),
+
19  size_of(x2));
+
20  return check_consistent_size(max_size,function,x1,name1,result)
+
21  && check_consistent_size(max_size,function,x2,name2,result);
+
22  }
+
23 
+
24  template <typename T1, typename T2, typename T3, typename T_result>
+
25  inline bool check_consistent_sizes(const char* function,
+
26  const T1& x1,
+
27  const T2& x2,
+
28  const T3& x3,
+
29  const char* name1,
+
30  const char* name2,
+
31  const char* name3,
+
32  T_result* result) {
+
33  size_t max_size = std::max(size_of(x1),
+
34  std::max(size_of(x2),size_of(x3)));
+
35  return check_consistent_size(max_size,function,x1,name1,result)
+
36  && check_consistent_size(max_size,function,x2,name2,result)
+
37  && check_consistent_size(max_size,function,x3,name3,result);
+
38  }
+
39  template <typename T1, typename T2, typename T3, typename T4, typename T_result>
+
40  inline bool check_consistent_sizes(const char* function,
+
41  const T1& x1,
+
42  const T2& x2,
+
43  const T3& x3,
+
44  const T4& x4,
+
45  const char* name1,
+
46  const char* name2,
+
47  const char* name3,
+
48  const char* name4,
+
49  T_result* result) {
+
50  size_t max_size = std::max(size_of(x1),
+
51  std::max(size_of(x2),
+
52  std::max(size_of(x3), size_of(x4))));
+
53  return check_consistent_size(max_size,function,x1,name1,result)
+
54  && check_consistent_size(max_size,function,x2,name2,result)
+
55  && check_consistent_size(max_size,function,x3,name3,result)
+
56  && check_consistent_size(max_size,function,x4,name4,result);
+
57  }
+
58 
+
59  }
+
60 }
+
61 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__corr__matrix_8hpp.html b/doc/api/html/check__corr__matrix_8hpp.html new file mode 100644 index 00000000000..0eae34a85f9 --- /dev/null +++ b/doc/api/html/check__corr__matrix_8hpp.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/math/error_handling/matrix/check_corr_matrix.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
check_corr_matrix.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + +

+Functions

template<typename T_y , typename T_result >
bool stan::math::check_corr_matrix (const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)
 Return true if the specified matrix is a valid correlation matrix.
 
template<typename T >
bool stan::math::check_corr_matrix (const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__corr__matrix_8hpp_source.html b/doc/api/html/check__corr__matrix_8hpp_source.html new file mode 100644 index 00000000000..8d5db1964a1 --- /dev/null +++ b/doc/api/html/check__corr__matrix_8hpp_source.html @@ -0,0 +1,163 @@ + + + + + +Stan: src/stan/math/error_handling/matrix/check_corr_matrix.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
check_corr_matrix.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__ERROR_HANDLING__MATRIX__CHECK_CORR_MATRIX_HPP__
+
2 #define __STAN__MATH__ERROR_HANDLING__MATRIX__CHECK_CORR_MATRIX_HPP__
+
3 
+
4 #include <sstream>
+ + + + + + +
11 
+
12 namespace stan {
+
13  namespace math {
+
14 
+
30  // FIXME: update warnings
+
31  template <typename T_y, typename T_result>
+
32  inline bool check_corr_matrix(const char* function,
+
33  const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& y,
+
34  const char* name,
+
35  T_result* result) {
+
36  if (!check_size_match(function,
+
37  y.rows(), "Rows of correlation matrix",
+
38  y.cols(), "columns of correlation matrix",
+
39  result))
+
40  return false;
+
41  if (!check_positive(function, y.rows(), "rows", result))
+
42  return false;
+
43  if (!check_symmetric(function, y, "y", result))
+
44  return false;
+ +
46  k = 0; k < y.rows(); ++k) {
+
47  if (fabs(y(k,k) - 1.0) > CONSTRAINT_TOLERANCE) {
+
48  std::ostringstream message;
+
49  message << name << " is not a valid correlation matrix. "
+
50  << name << "(" << k << "," << k
+
51  << ") is %1%, but should be near 1.0";
+
52  std::string msg(message.str());
+
53  return dom_err(function,y(k,k),name,msg.c_str(),"",result);
+
54  }
+
55  }
+
56  if (!check_pos_definite(function, y, "y", result))
+
57  return false;
+
58  return true;
+
59  }
+
60 
+
61  template <typename T>
+
62  inline bool check_corr_matrix(const char* function,
+
63  const Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& y,
+
64  const char* name,
+
65  T* result = 0) {
+
66  return check_corr_matrix<T,T>(function,y,name,result);
+
67  }
+
68 
+
69  }
+
70 }
+
71 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__cov__matrix_8hpp.html b/doc/api/html/check__cov__matrix_8hpp.html new file mode 100644 index 00000000000..176eda0646e --- /dev/null +++ b/doc/api/html/check__cov__matrix_8hpp.html @@ -0,0 +1,145 @@ + + + + + +Stan: src/stan/math/error_handling/matrix/check_cov_matrix.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
check_cov_matrix.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + + + + + + + +

+Functions

template<typename T_y , typename T_result >
bool stan::math::check_cov_matrix (const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)
 Return true if the specified matrix is a valid covariance matrix.
 
template<typename T >
bool stan::math::check_cov_matrix (const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)
 
template<typename T_covar , typename T_result >
bool stan::math::check_cov_matrix (const char *function, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma, T_result *result)
 Return true if the specified matrix is a valid covariance matrix.
 
template<typename T >
bool stan::math::check_cov_matrix (const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &Sigma, T *result=0)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__cov__matrix_8hpp_source.html b/doc/api/html/check__cov__matrix_8hpp_source.html new file mode 100644 index 00000000000..2732ea67139 --- /dev/null +++ b/doc/api/html/check__cov__matrix_8hpp_source.html @@ -0,0 +1,177 @@ + + + + + +Stan: src/stan/math/error_handling/matrix/check_cov_matrix.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
check_cov_matrix.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__ERROR_HANDLING__MATRIX__CHECK_COV_MATRIX_HPP__
+
2 #define __STAN__MATH__ERROR_HANDLING__MATRIX__CHECK_COV_MATRIX_HPP__
+
3 
+
4 #include <sstream>
+ + + + + +
10 
+
11 
+
12 namespace stan {
+
13  namespace math {
+
14 
+
27  // FIXME: update warnings
+
28  template <typename T_y, typename T_result>
+
29  inline bool check_cov_matrix(const char* function,
+
30  const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& y,
+
31  const char* name,
+
32  T_result* result) {
+
33  if (!check_size_match(function,
+
34  y.rows(), "Rows of covariance matrix",
+
35  y.cols(), "columns of covariance matrix",
+
36  result))
+
37  return false;
+
38  if (!check_positive(function, y.rows(), "rows", result))
+
39  return false;
+
40  if (!check_symmetric(function, y, name, result))
+
41  return false;
+
42  if (!check_pos_definite(function, y, name, result))
+
43  return false;
+
44  return true;
+
45  }
+
46 
+
47  template <typename T>
+
48  inline bool check_cov_matrix(const char* function,
+
49  const Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& y,
+
50  const char* name,
+
51  T* result = 0) {
+
52  return check_cov_matrix<T,T>(function,y,name,result);
+
53  }
+
54 
+
55 
+
56  // FIXME: this looks redundant
+
68  // FIXME: update warnings
+
69  template <typename T_covar, typename T_result>
+
70  inline bool check_cov_matrix(const char* function,
+
71  const Eigen::Matrix<T_covar,Eigen::Dynamic,Eigen::Dynamic>& Sigma,
+
72  T_result* result) {
+
73  if (!check_size_match(function,
+
74  Sigma.rows(), "Rows of covariance matrix",
+
75  Sigma.cols(), "columns of covariance matrix",
+
76  result))
+
77  return false;
+
78  if (!check_positive(function, Sigma.rows(), "rows", result))
+
79  return false;
+
80  if (!check_symmetric(function, Sigma, "Sigma", result))
+
81  return false;
+
82  return true;
+
83  }
+
84  template <typename T>
+
85  inline bool check_cov_matrix(const char* function,
+
86  const Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& Sigma,
+
87  T* result = 0) {
+
88  return check_cov_matrix<T,T>(function,Sigma,result);
+
89  }
+
90 
+
91  }
+
92 }
+
93 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__finite_8hpp.html b/doc/api/html/check__finite_8hpp.html new file mode 100644 index 00000000000..c2688869e8a --- /dev/null +++ b/doc/api/html/check__finite_8hpp.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/math/error_handling/check_finite.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
check_finite.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + +

+Functions

template<typename T_y , typename T_result >
bool stan::math::check_finite (const char *function, const T_y &y, const char *name, T_result *result)
 Checks if the variable y is finite.
 
template<typename T >
bool stan::math::check_finite (const char *function, const T &y, const char *name)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__finite_8hpp_source.html b/doc/api/html/check__finite_8hpp_source.html new file mode 100644 index 00000000000..66077fb5c8a --- /dev/null +++ b/doc/api/html/check__finite_8hpp_source.html @@ -0,0 +1,171 @@ + + + + + +Stan: src/stan/math/error_handling/check_finite.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
check_finite.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__ERROR_HANDLING__CHECK_FINITE_HPP__
+
2 #define __STAN__MATH__ERROR_HANDLING__CHECK_FINITE_HPP__
+
3 
+ + +
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
10  namespace {
+
11  template <typename T_y,
+
12  typename T_result,
+
13  bool is_vec>
+
14  struct finite {
+
15  static bool check(const char* function,
+
16  const T_y& y,
+
17  const char* name,
+
18  T_result* result) {
+
19  if (!(boost::math::isfinite)(y))
+
20  return dom_err(function,y,name,
+
21  " is %1%, but must be finite!","",
+
22  result);
+
23  return true;
+
24  }
+
25  };
+
26 
+
27  template <typename T_y, typename T_result>
+
28  struct finite<T_y, T_result, true> {
+
29  static bool check(const char* function,
+
30  const T_y& y,
+
31  const char* name,
+
32  T_result* result) {
+
33  using stan::length;
+
34  for (size_t n = 0; n < length(y); n++) {
+
35  if (!(boost::math::isfinite)(stan::get(y,n)))
+
36  return dom_err_vec(n,function,y,name,
+
37  " is %1%, but must be finite!","",
+
38  result);
+
39  }
+
40  return true;
+
41  }
+
42  };
+
43  }
+
44 
+
48  template <typename T_y, typename T_result>
+
49  inline bool check_finite(const char* function,
+
50  const T_y& y,
+
51  const char* name,
+
52  T_result* result) {
+
53  return finite<T_y,T_result,is_vector_like<T_y>::value>
+
54  ::check(function, y, name, result);
+
55  }
+
56 
+
57  template <typename T>
+
58  inline bool check_finite(const char* function,
+
59  const T& y,
+
60  const char* name) {
+
61  return check_finite<T,typename scalar_type<T>::type *>
+
62  (function,y,name,0);
+
63  }
+
64 
+
65  }
+
66 }
+
67 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__greater_8hpp.html b/doc/api/html/check__greater_8hpp.html new file mode 100644 index 00000000000..fd05efd3186 --- /dev/null +++ b/doc/api/html/check__greater_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/error_handling/check_greater.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
check_greater.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + +

+Functions

template<typename T_y , typename T_low , typename T_result >
bool stan::math::check_greater (const char *function, const T_y &y, const T_low &low, const char *name, T_result *result)
 
template<typename T_y , typename T_low >
bool stan::math::check_greater (const char *function, const T_y &y, const T_low &low, const char *name)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__greater_8hpp_source.html b/doc/api/html/check__greater_8hpp_source.html new file mode 100644 index 00000000000..c712c02f8ae --- /dev/null +++ b/doc/api/html/check__greater_8hpp_source.html @@ -0,0 +1,182 @@ + + + + + +Stan: src/stan/math/error_handling/check_greater.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
check_greater.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__ERROR_HANDLING__CHECK_GREATER_HPP__
+
2 #define __STAN__MATH__ERROR_HANDLING__CHECK_GREATER_HPP__
+
3 
+ + +
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
10  namespace {
+
11  template <typename T_y,
+
12  typename T_low,
+
13  typename T_result,
+
14  bool is_vec>
+
15  struct greater {
+
16  static bool check(const char* function,
+
17  const T_y& y,
+
18  const T_low& low,
+
19  const char* name,
+
20  T_result* result) {
+
21  using stan::length;
+
22  VectorView<const T_low> low_vec(low);
+
23  for (size_t n = 0; n < length(low); n++) {
+
24  if (!(y > low_vec[n]))
+
25  return dom_err(function,y,name,
+
26  " is %1%, but must be greater than ",
+
27  low_vec[n],result);
+
28  }
+
29  return true;
+
30  }
+
31  };
+
32 
+
33  template <typename T_y,
+
34  typename T_low,
+
35  typename T_result>
+
36  struct greater<T_y, T_low, T_result, true> {
+
37  static bool check(const char* function,
+
38  const T_y& y,
+
39  const T_low& low,
+
40  const char* name,
+
41  T_result* result) {
+
42  using stan::length;
+
43  VectorView<const T_low> low_vec(low);
+
44  for (size_t n = 0; n < length(y); n++) {
+
45  if (!(stan::get(y,n) > low_vec[n])) {
+
46  return dom_err_vec(n,function,y,name,
+
47  " is %1%, but must be greater than ",
+
48  low_vec[n],result);
+
49  }
+
50  }
+
51  return true;
+
52  }
+
53  };
+
54  }
+
55  template <typename T_y, typename T_low, typename T_result>
+
56  inline bool check_greater(const char* function,
+
57  const T_y& y,
+
58  const T_low& low,
+
59  const char* name,
+
60  T_result* result) {
+
61  return greater<T_y,T_low,T_result,is_vector_like<T_y>::value>
+
62  ::check(function,y,low,name,result);
+
63  }
+
64  template <typename T_y, typename T_low>
+
65  inline bool check_greater(const char* function,
+
66  const T_y& y,
+
67  const T_low& low,
+
68  const char* name) {
+
69  return check_greater<T_y,T_low,typename scalar_type<T_y>::type *>
+
70  (function,y,low,name,0);
+
71  }
+
72 
+
73  }
+
74 }
+
75 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__greater__or__equal_8hpp.html b/doc/api/html/check__greater__or__equal_8hpp.html new file mode 100644 index 00000000000..8acc5c3b8f6 --- /dev/null +++ b/doc/api/html/check__greater__or__equal_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/error_handling/check_greater_or_equal.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
check_greater_or_equal.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + +

+Functions

template<typename T_y , typename T_low , typename T_result >
bool stan::math::check_greater_or_equal (const char *function, const T_y &y, const T_low &low, const char *name, T_result *result)
 
template<typename T_y , typename T_low >
bool stan::math::check_greater_or_equal (const char *function, const T_y &y, const T_low &low, const char *name)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__greater__or__equal_8hpp_source.html b/doc/api/html/check__greater__or__equal_8hpp_source.html new file mode 100644 index 00000000000..ab525e779a8 --- /dev/null +++ b/doc/api/html/check__greater__or__equal_8hpp_source.html @@ -0,0 +1,182 @@ + + + + + +Stan: src/stan/math/error_handling/check_greater_or_equal.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
check_greater_or_equal.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__ERROR_HANDLING__CHECK_GREATER_OR_EQUAL_HPP__
+
2 #define __STAN__MATH__ERROR_HANDLING__CHECK_GREATER_OR_EQUAL_HPP__
+
3 
+ + +
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
10  namespace {
+
11  template <typename T_y,
+
12  typename T_low,
+
13  typename T_result,
+
14  bool is_vec>
+
15  struct greater_or_equal {
+
16  static bool check(const char* function,
+
17  const T_y& y,
+
18  const T_low& low,
+
19  const char* name,
+
20  T_result* result) {
+
21  using stan::length;
+
22  VectorView<const T_low> low_vec(low);
+
23  for (size_t n = 0; n < length(low); n++) {
+
24  if (!(y >= low_vec[n]))
+
25  return dom_err(function,y,name,
+
26  " is %1%, but must be greater than ",
+
27  low_vec[n],result);
+
28  }
+
29  return true;
+
30  }
+
31  };
+
32 
+
33  template <typename T_y,
+
34  typename T_low,
+
35  typename T_result>
+
36  struct greater_or_equal<T_y, T_low, T_result, true> {
+
37  static bool check(const char* function,
+
38  const T_y& y,
+
39  const T_low& low,
+
40  const char* name,
+
41  T_result* result) {
+
42  using stan::length;
+
43  using stan::get;
+
44  VectorView<const T_low> low_vec(low);
+
45  for (size_t n = 0; n < length(y); n++) {
+
46  if (!(get(y,n) >= low_vec[n]))
+
47  return dom_err_vec(n,function,y,name,
+
48  " is %1%, but must be greater than or equal to ",
+
49  low_vec[n],result);
+
50  }
+
51  return true;
+
52  }
+
53  };
+
54  }
+
55  template <typename T_y, typename T_low, typename T_result>
+
56  inline bool check_greater_or_equal(const char* function,
+
57  const T_y& y,
+
58  const T_low& low,
+
59  const char* name,
+
60  T_result* result) {
+
61  return greater_or_equal<T_y,T_low,T_result,is_vector_like<T_y>::value>
+
62  ::check(function,y,low,name,result);
+
63  }
+
64  template <typename T_y, typename T_low>
+
65  inline bool check_greater_or_equal(const char* function,
+
66  const T_y& y,
+
67  const T_low& low,
+
68  const char* name) {
+
69  return check_greater_or_equal<T_y,T_low,typename scalar_type<T_y>::type *>
+
70  (function,y,low,name,0);
+
71  }
+
72 
+
73  }
+
74 }
+
75 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__less_8hpp.html b/doc/api/html/check__less_8hpp.html new file mode 100644 index 00000000000..43d838787dd --- /dev/null +++ b/doc/api/html/check__less_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/error_handling/check_less.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
check_less.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + +

+Functions

template<typename T_y , typename T_high , typename T_result >
bool stan::math::check_less (const char *function, const T_y &y, const T_high &high, const char *name, T_result *result)
 
template<typename T_y , typename T_high >
bool stan::math::check_less (const char *function, const T_y &y, const T_high &high, const char *name)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__less_8hpp_source.html b/doc/api/html/check__less_8hpp_source.html new file mode 100644 index 00000000000..e4e92c3e46f --- /dev/null +++ b/doc/api/html/check__less_8hpp_source.html @@ -0,0 +1,181 @@ + + + + + +Stan: src/stan/math/error_handling/check_less.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
check_less.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__ERROR_HANDLING__CHECK_LESS_HPP__
+
2 #define __STAN__MATH__ERROR_HANDLING__CHECK_LESS_HPP__
+
3 
+ + +
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
10  namespace {
+
11  template <typename T_y,
+
12  typename T_high,
+
13  typename T_result,
+
14  bool is_vec>
+
15  struct less {
+
16  static bool check(const char* function,
+
17  const T_y& y,
+
18  const T_high& high,
+
19  const char* name,
+
20  T_result* result) {
+
21  using stan::length;
+
22  VectorView<const T_high> high_vec(high);
+
23  for (size_t n = 0; n < length(high); n++) {
+
24  if (!(y < high_vec[n]))
+
25  return dom_err(function,y,name,
+
26  " is %1%, but must be less than ",
+
27  high_vec[n],result);
+
28  }
+
29  return true;
+
30  }
+
31  };
+
32 
+
33  template <typename T_y,
+
34  typename T_high,
+
35  typename T_result>
+
36  struct less<T_y, T_high, T_result, true> {
+
37  static bool check(const char* function,
+
38  const T_y& y,
+
39  const T_high& high,
+
40  const char* name,
+
41  T_result* result) {
+
42  using stan::length;
+
43  VectorView<const T_high> high_vec(high);
+
44  for (size_t n = 0; n < length(y); n++) {
+
45  if (!(stan::get(y,n) < high_vec[n]))
+
46  return dom_err_vec(n,function,y,name,
+
47  " is %1%, but must be less than ",
+
48  high_vec[n],result);
+
49  }
+
50  return true;
+
51  }
+
52  };
+
53  }
+
54  template <typename T_y, typename T_high, typename T_result>
+
55  inline bool check_less(const char* function,
+
56  const T_y& y,
+
57  const T_high& high,
+
58  const char* name,
+
59  T_result* result) {
+
60  return less<T_y,T_high,T_result,is_vector_like<T_y>::value>
+
61  ::check(function,y,high,name,result);
+
62  }
+
63  template <typename T_y, typename T_high>
+
64  inline bool check_less(const char* function,
+
65  const T_y& y,
+
66  const T_high& high,
+
67  const char* name) {
+
68  return check_less<T_y,T_high,typename scalar_type<T_y>::type *>
+
69  (function,y,high,name,0);
+
70  }
+
71 
+
72  }
+
73 }
+
74 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__less__or__equal_8hpp.html b/doc/api/html/check__less__or__equal_8hpp.html new file mode 100644 index 00000000000..11bc43d4a97 --- /dev/null +++ b/doc/api/html/check__less__or__equal_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/error_handling/check_less_or_equal.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
check_less_or_equal.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + +

+Functions

template<typename T_y , typename T_high , typename T_result >
bool stan::math::check_less_or_equal (const char *function, const T_y &y, const T_high &high, const char *name, T_result *result)
 
template<typename T_y , typename T_high >
bool stan::math::check_less_or_equal (const char *function, const T_y &y, const T_high &high, const char *name)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__less__or__equal_8hpp_source.html b/doc/api/html/check__less__or__equal_8hpp_source.html new file mode 100644 index 00000000000..b5cdcf8697c --- /dev/null +++ b/doc/api/html/check__less__or__equal_8hpp_source.html @@ -0,0 +1,176 @@ + + + + + +Stan: src/stan/math/error_handling/check_less_or_equal.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
check_less_or_equal.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__ERROR_HANDLING__CHECK_LESS_OR_EQUAL_HPP__
+
2 #define __STAN__MATH__ERROR_HANDLING__CHECK_LESS_OR_EQUAL_HPP__
+
3 
+ + +
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
10  namespace {
+
11  template <typename T_y, typename T_high, typename T_result, bool is_vec>
+
12  struct less_or_equal {
+
13  static bool check(const char* function,
+
14  const T_y& y,
+
15  const T_high& high,
+
16  const char* name,
+
17  T_result* result) {
+
18  using stan::length;
+
19  VectorView<const T_high> high_vec(high);
+
20  for (size_t n = 0; n < length(high); n++) {
+
21  if (!(y <= high_vec[n]))
+
22  return dom_err(function,y,name,
+
23  " is %1%, but must be less than or equal to ",
+
24  high_vec[n],result);
+
25  }
+
26  return true;
+
27  }
+
28  };
+
29 
+
30  template <typename T_y, typename T_high, typename T_result>
+
31  struct less_or_equal<T_y, T_high, T_result, true> {
+
32  static bool check(const char* function,
+
33  const T_y& y,
+
34  const T_high& high,
+
35  const char* name,
+
36  T_result* result) {
+
37  using stan::length;
+
38  VectorView<const T_high> high_vec(high);
+
39  for (size_t n = 0; n < length(y); n++) {
+
40  if (!(stan::get(y,n) <= high_vec[n]))
+
41  return dom_err_vec(n,function,y,name,
+
42  " is %1%, but must be less than or equal to ",
+
43  high_vec[n],result);
+
44  }
+
45  return true;
+
46  }
+
47  };
+
48  }
+
49  template <typename T_y, typename T_high, typename T_result>
+
50  inline bool check_less_or_equal(const char* function,
+
51  const T_y& y,
+
52  const T_high& high,
+
53  const char* name,
+
54  T_result* result) {
+
55  return less_or_equal<T_y,T_high,T_result,is_vector_like<T_y>::value>
+
56  ::check(function,y,high,name,result);
+
57  }
+
58  template <typename T_y, typename T_high>
+
59  inline bool check_less_or_equal(const char* function,
+
60  const T_y& y,
+
61  const T_high& high,
+
62  const char* name) {
+
63  return check_less_or_equal<T_y,T_high,typename scalar_type<T_y>::type *>
+
64  (function,y,high,name,0);
+
65  }
+
66 
+
67  }
+
68 }
+
69 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__lower__triangular_8hpp.html b/doc/api/html/check__lower__triangular_8hpp.html new file mode 100644 index 00000000000..ab1951ec765 --- /dev/null +++ b/doc/api/html/check__lower__triangular_8hpp.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/math/error_handling/matrix/check_lower_triangular.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
check_lower_triangular.hpp File Reference
+
+
+
#include <sstream>
+#include <boost/type_traits/common_type.hpp>
+#include <stan/math/error_handling/dom_err.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + +

+Functions

template<typename T_y , typename T_result >
bool stan::math::check_lower_triangular (const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)
 Return true if the specified matrix is lower triangular.
 
template<typename T >
bool stan::math::check_lower_triangular (const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__lower__triangular_8hpp_source.html b/doc/api/html/check__lower__triangular_8hpp_source.html new file mode 100644 index 00000000000..a60641d6ea1 --- /dev/null +++ b/doc/api/html/check__lower__triangular_8hpp_source.html @@ -0,0 +1,150 @@ + + + + + +Stan: src/stan/math/error_handling/matrix/check_lower_triangular.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
check_lower_triangular.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__ERROR_HANDLING__MATRIX__CHECK_LOWER_TRIANGULAR_HPP__
+
2 #define __STAN__MATH__ERROR_HANDLING__MATRIX__CHECK_LOWER_TRIANGULAR_HPP__
+
3 
+
4 #include <sstream>
+
5 #include <boost/type_traits/common_type.hpp>
+ + +
8 
+
9 namespace stan {
+
10 
+
11  namespace math {
+
12 
+
25  template <typename T_y, typename T_result>
+
26  inline bool check_lower_triangular(const char* function,
+
27  const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& y,
+
28  const char* name,
+
29  T_result* result) {
+
30  for (int n = 1; n < y.cols(); ++n) {
+
31  for (int m = 0; m < n && m < y.rows(); ++m) {
+
32  if (y(m,n) != 0) {
+
33  std::stringstream msg;
+
34  msg << name << " is not lower triangular;"
+
35  << " " << name << "[" << m << "," << n << "]="
+
36  << "%1%";
+
37  std::string msg_string(msg.str());
+
38  return dom_err(function,y(m,n),"",msg_string.c_str(),"",result);
+
39  }
+
40  }
+
41  }
+
42  return true;
+
43  }
+
44 
+
45  template <typename T>
+
46  inline bool check_lower_triangular(const char* function,
+
47  const Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& y,
+
48  const char* name,
+
49  T* result = 0) {
+
50  return check_lower_triangular<T,T>(function,y,name,result);
+
51  }
+
52 
+
53  }
+
54 }
+
55 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__nonnegative_8hpp.html b/doc/api/html/check__nonnegative_8hpp.html new file mode 100644 index 00000000000..c50b3f9577a --- /dev/null +++ b/doc/api/html/check__nonnegative_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/error_handling/check_nonnegative.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
check_nonnegative.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + +

+Functions

template<typename T_y , typename T_result >
bool stan::math::check_nonnegative (const char *function, const T_y &y, const char *name, T_result *result)
 
template<typename T_y >
bool stan::math::check_nonnegative (const char *function, const T_y &y, const char *name)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__nonnegative_8hpp_source.html b/doc/api/html/check__nonnegative_8hpp_source.html new file mode 100644 index 00000000000..a38d0201178 --- /dev/null +++ b/doc/api/html/check__nonnegative_8hpp_source.html @@ -0,0 +1,170 @@ + + + + + +Stan: src/stan/math/error_handling/check_nonnegative.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
check_nonnegative.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__ERROR_HANDLING__CHECK_NONNEGATIVE_HPP__
+
2 #define __STAN__MATH__ERROR_HANDLING__CHECK_NONNEGATIVE_HPP__
+
3 
+ + +
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
10  namespace {
+
11  template <typename T_y, typename T_result, bool is_vec>
+
12  struct nonnegative {
+
13  static bool check(const char* function,
+
14  const T_y& y,
+
15  const char* name,
+
16  T_result* result) {
+
17  // have to use not is_unsigned. is_signed will be false
+
18  // floating point types that have no unsigned versions.
+
19  if (!boost::is_unsigned<T_y>::value && !(y >= 0))
+
20  return dom_err(function,y,name,
+
21  " is %1%, but must be >= 0!","",
+
22  result);
+
23  return true;
+
24  }
+
25  };
+
26 
+
27  template <typename T_y, typename T_result>
+
28  struct nonnegative<T_y, T_result, true> {
+
29  static bool check(const char* function,
+
30  const T_y& y,
+
31  const char* name,
+
32  T_result* result) {
+
33  using stan::length;
+
34  for (size_t n = 0; n < length(y); n++) {
+
35  if (!boost::is_unsigned<typename T_y::value_type>::value
+
36  && !(stan::get(y,n) >= 0))
+
37  return dom_err_vec(n,function,y,name,
+
38  " is %1%, but must be >= 0!","",
+
39  result);
+
40  }
+
41  return true;
+
42  }
+
43  };
+
44  }
+
45  template <typename T_y, typename T_result>
+
46  inline bool check_nonnegative(const char* function,
+
47  const T_y& y,
+
48  const char* name,
+
49  T_result* result) {
+
50  return nonnegative<T_y,T_result,is_vector_like<T_y>::value>
+
51  ::check(function, y, name, result);
+
52  }
+
53  template <typename T_y>
+
54  inline bool check_nonnegative(const char* function,
+
55  const T_y& y,
+
56  const char* name) {
+
57  return check_nonnegative<T_y,typename scalar_type<T_y>::type *>
+
58  (function,y,name,0);
+
59  }
+
60 
+
61  }
+
62 }
+
63 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__not__nan_8hpp.html b/doc/api/html/check__not__nan_8hpp.html new file mode 100644 index 00000000000..de8eb8ab277 --- /dev/null +++ b/doc/api/html/check__not__nan_8hpp.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/math/error_handling/check_not_nan.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
check_not_nan.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + +

+Functions

template<typename T_y , typename T_result >
bool stan::math::check_not_nan (const char *function, const T_y &y, const char *name, T_result *result=0)
 Checks if the variable y is nan.
 
template<typename T >
bool stan::math::check_not_nan (const char *function, const T &y, const char *name)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__not__nan_8hpp_source.html b/doc/api/html/check__not__nan_8hpp_source.html new file mode 100644 index 00000000000..99519a058b8 --- /dev/null +++ b/doc/api/html/check__not__nan_8hpp_source.html @@ -0,0 +1,170 @@ + + + + + +Stan: src/stan/math/error_handling/check_not_nan.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
check_not_nan.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__ERROR_HANDLING__CHECK_NOT_NAN_HPP__
+
2 #define __STAN__MATH__ERROR_HANDLING__CHECK_NOT_NAN_HPP__
+
3 
+ + +
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
10  namespace {
+
11  template <typename T_y, typename T_result, bool is_vec>
+
12  struct not_nan {
+
13  static bool check(const char* function,
+
14  const T_y& y,
+
15  const char* name,
+
16  T_result* result) {
+
17  if ((boost::math::isnan)(y))
+
18  return dom_err(function,y,name,
+
19  " is %1%, but must not be nan!","",
+
20  result);
+
21  return true;
+
22  }
+
23  };
+
24 
+
25  template <typename T_y, typename T_result>
+
26  struct not_nan<T_y, T_result, true> {
+
27  static bool check(const char* function,
+
28  const T_y& y,
+
29  const char* name,
+
30  T_result* result) {
+
31  // using stan::length;
+
32  for (size_t n = 0; n < stan::length(y); n++) {
+
33  if ((boost::math::isnan)(stan::get(y,n)))
+
34  return dom_err_vec(n,function,y,name,
+
35  " is %1%, but must not be nan!","",
+
36  result);
+
37  }
+
38  return true;
+
39  }
+
40  };
+
41  }
+
42 
+
53  template <typename T_y, typename T_result>
+
54  inline bool check_not_nan(const char* function,
+
55  const T_y& y,
+
56  const char* name,
+
57  T_result* result = 0) {
+
58  return not_nan<T_y,T_result,is_vector_like<T_y>::value>
+
59  ::check(function, y, name, result);
+
60  }
+
61 
+
62  // need this sig to infer types for result from type of y
+
63  template <typename T>
+
64  inline bool check_not_nan(const char* function,
+
65  const T& y,
+
66  const char* name) {
+
67  return check_not_nan<T, typename scalar_type<T>::type *>
+
68  (function,y,name,0);
+
69  }
+
70 
+
71  }
+
72 }
+
73 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__ordered_8hpp.html b/doc/api/html/check__ordered_8hpp.html new file mode 100644 index 00000000000..f70289669de --- /dev/null +++ b/doc/api/html/check__ordered_8hpp.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/math/error_handling/matrix/check_ordered.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
check_ordered.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + +

+Functions

template<typename T_y , typename T_result >
bool stan::math::check_ordered (const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const char *name, T_result *result)
 Return true if the specified vector is sorted into increasing order.
 
template<typename T >
bool stan::math::check_ordered (const char *function, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &y, const char *name, T *result=0)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__ordered_8hpp_source.html b/doc/api/html/check__ordered_8hpp_source.html new file mode 100644 index 00000000000..e7df82cd006 --- /dev/null +++ b/doc/api/html/check__ordered_8hpp_source.html @@ -0,0 +1,153 @@ + + + + + +Stan: src/stan/math/error_handling/matrix/check_ordered.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
check_ordered.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__ERROR_HANDLING__MATRIX__CHECK_ORDERED_HPP__
+
2 #define __STAN__MATH__ERROR_HANDLING__MATRIX__CHECK_ORDERED_HPP__
+
3 
+
4 #include <sstream>
+ + +
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
24  template <typename T_y, typename T_result>
+
25  bool check_ordered(const char* function,
+
26  const Eigen::Matrix<T_y,Eigen::Dynamic,1>& y,
+
27  const char* name,
+
28  T_result* result) {
+
29  typedef typename Eigen::Matrix<T_y,Eigen::Dynamic,1>::size_type size_t;
+
30  if (y.size() == 0) {
+
31  return true;
+
32  }
+
33  for (size_t n = 1; n < y.size(); n++) {
+
34  if (!(y[n] > y[n-1])) {
+
35  std::ostringstream stream;
+
36  stream << name << " is not a valid ordered vector."
+
37  << " The element at " << n
+
38  << " is %1%, but should be greater than the previous element, "
+
39  << y[n-1];
+
40  std::string msg(stream.str());
+
41  return dom_err(function,y[n],name,
+
42  msg.c_str(),"",
+
43  result);
+
44  return false;
+
45  }
+
46  }
+
47  return true;
+
48  }
+
49  template <typename T>
+
50  bool check_ordered(const char* function,
+
51  const Eigen::Matrix<T,Eigen::Dynamic,1>& y,
+
52  const char* name,
+
53  T* result = 0) {
+
54  return check_ordered<T,T>(function,y,name,result);
+
55  }
+
56 
+
57  }
+
58 }
+
59 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__pos__semidefinite_8hpp.html b/doc/api/html/check__pos__semidefinite_8hpp.html new file mode 100644 index 00000000000..4131c9a7104 --- /dev/null +++ b/doc/api/html/check__pos__semidefinite_8hpp.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/math/error_handling/matrix/check_pos_semidefinite.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
check_pos_semidefinite.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + +

+Functions

template<typename T_y , typename T_result >
bool stan::math::check_pos_semidefinite (const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)
 Return true if the specified matrix is positive definite.
 
template<typename T >
bool stan::math::check_pos_semidefinite (const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__pos__semidefinite_8hpp_source.html b/doc/api/html/check__pos__semidefinite_8hpp_source.html new file mode 100644 index 00000000000..cea3896bfd4 --- /dev/null +++ b/doc/api/html/check__pos__semidefinite_8hpp_source.html @@ -0,0 +1,157 @@ + + + + + +Stan: src/stan/math/error_handling/matrix/check_pos_semidefinite.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
check_pos_semidefinite.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__ERROR_HANDLING__MATRIX__CHECK_POS_SEMIDEFINITE_HPP__
+
2 #define __STAN__MATH__ERROR_HANDLING__MATRIX__CHECK_POS_SEMIDEFINITE_HPP__
+
3 
+
4 #include <sstream>
+ + + +
8 
+
9 namespace stan {
+
10  namespace math {
+
11 
+
24  // FIXME: update warnings (message has (0,0) item)
+
25  template <typename T_y, typename T_result>
+
26  inline bool check_pos_semidefinite(const char* function,
+
27  const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& y,
+
28  const char* name,
+
29  T_result* result) {
+
30  typedef
+ +
32  size_type;
+
33  if (y.rows() == 1 && y(0,0) < 0.0) {
+
34  std::ostringstream message;
+
35  message << name << " is not positive semi-definite. "
+
36  << name << "(0,0) is %1%.";
+
37  std::string msg(message.str());
+
38  return dom_err(function,y(0,0),name,msg.c_str(),"",result);
+
39  }
+
40  Eigen::LDLT< Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic> > cholesky
+
41  = y.ldlt();
+
42  if(cholesky.info() != Eigen::Success || (cholesky.vectorD().array() < 0.0).any()) {
+
43  std::ostringstream message;
+
44  message << name << " is not positive semi-definite. "
+
45  << name << "(0,0) is %1%.";
+
46  std::string msg(message.str());
+
47  return dom_err(function,y(0,0),name,msg.c_str(),"",result);
+
48  }
+
49  return true;
+
50  }
+
51 
+
52  template <typename T>
+
53  inline bool check_pos_semidefinite(const char* function,
+
54  const Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& y,
+
55  const char* name,
+
56  T* result = 0) {
+
57  return check_pos_semidefinite<T,T>(function,y,name,result);
+
58  }
+
59 
+
60  }
+
61 }
+
62 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__positive_8hpp.html b/doc/api/html/check__positive_8hpp.html new file mode 100644 index 00000000000..e8c76eb096e --- /dev/null +++ b/doc/api/html/check__positive_8hpp.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/math/error_handling/check_positive.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
check_positive.hpp File Reference
+
+
+
#include <boost/type_traits/is_unsigned.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/math/error_handling/dom_err.hpp>
+#include <stan/math/error_handling/dom_err_vec.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + +

+Functions

template<typename T_y , typename T_result >
bool stan::math::check_positive (const char *function, const T_y &y, const char *name, T_result *result)
 
template<typename T >
bool stan::math::check_positive (const char *function, const T &x, const char *name)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__positive_8hpp_source.html b/doc/api/html/check__positive_8hpp_source.html new file mode 100644 index 00000000000..c9a62f4f36f --- /dev/null +++ b/doc/api/html/check__positive_8hpp_source.html @@ -0,0 +1,172 @@ + + + + + +Stan: src/stan/math/error_handling/check_positive.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
check_positive.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__ERROR_HANDLING__CHECK_POSITIVE_HPP__
+
2 #define __STAN__MATH__ERROR_HANDLING__CHECK_POSITIVE_HPP__
+
3 
+
4 #include <boost/type_traits/is_unsigned.hpp>
+
5 #include <stan/meta/traits.hpp>
+ + +
8 
+
9 namespace stan {
+
10  namespace math {
+
11 
+
12  namespace {
+
13  template <typename T_y, typename T_result, bool is_vec>
+
14  struct positive {
+
15  static bool check(const char* function,
+
16  const T_y& y,
+
17  const char* name,
+
18  T_result* result) {
+
19  // have to use not is_unsigned. is_signed will be false
+
20  // floating point types that have no unsigned versions.
+
21  if (!boost::is_unsigned<T_y>::value && !(y > 0))
+
22  return dom_err(function,y,name,
+
23  " is %1%, but must be > 0!","",
+
24  result);
+
25  return true;
+
26  }
+
27  };
+
28 
+
29  template <typename T_y, typename T_result>
+
30  struct positive<T_y, T_result, true> {
+
31  static bool check(const char* function,
+
32  const T_y& y,
+
33  const char* name,
+
34  T_result* result) {
+
35  using stan::length;
+
36  for (size_t n = 0; n < length(y); n++) {
+
37  if (!boost::is_unsigned<typename T_y::value_type>::value
+
38  && !(stan::get(y,n) > 0))
+
39  return dom_err_vec(n,function,y,name,
+
40  " is %1%, but must be > 0!","",
+
41  result);
+
42  }
+
43  return true;
+
44  }
+
45  };
+
46  }
+
47  template <typename T_y, typename T_result>
+
48  inline bool check_positive(const char* function,
+
49  const T_y& y,
+
50  const char* name,
+
51  T_result* result) {
+
52  return positive<T_y,T_result,is_vector_like<T_y>::value>
+
53  ::check(function, y, name, result);
+
54  }
+
55  template <typename T>
+
56  inline bool check_positive(const char* function,
+
57  const T& x,
+
58  const char* name) {
+
59  return check_positive<T,typename scalar_type<T>::type *>
+
60  (function,x,name,0);
+
61  }
+
62 
+
63  }
+
64 }
+
65 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__positive__ordered_8hpp.html b/doc/api/html/check__positive__ordered_8hpp.html new file mode 100644 index 00000000000..9a54edaf51b --- /dev/null +++ b/doc/api/html/check__positive__ordered_8hpp.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/math/error_handling/matrix/check_positive_ordered.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
check_positive_ordered.hpp File Reference
+
+
+
#include <sstream>
+#include <stan/math/error_handling/dom_err.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + +

+Functions

template<typename T_y , typename T_result >
bool stan::math::check_positive_ordered (const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const char *name, T_result *result)
 Return true if the specified vector contains only non-negative values and is sorted into increasing order.
 
template<typename T >
bool stan::math::check_positive_ordered (const char *function, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &y, const char *name, T *result=0)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__positive__ordered_8hpp_source.html b/doc/api/html/check__positive__ordered_8hpp_source.html new file mode 100644 index 00000000000..fab7183c111 --- /dev/null +++ b/doc/api/html/check__positive__ordered_8hpp_source.html @@ -0,0 +1,162 @@ + + + + + +Stan: src/stan/math/error_handling/matrix/check_positive_ordered.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
check_positive_ordered.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__ERROR_HANDLING__MATRIX__CHECK_POSITIVE_ORDERED_HPP__
+
2 #define __STAN__MATH__ERROR_HANDLING__MATRIX__CHECK_POSITIVE_ORDERED_HPP__
+
3 
+
4 #include <sstream>
+ + +
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
24  template <typename T_y, typename T_result>
+
25  bool check_positive_ordered(const char* function,
+
26  const Eigen::Matrix<T_y,Eigen::Dynamic,1>& y,
+
27  const char* name,
+
28  T_result* result) {
+ +
30  typedef typename Eigen::Matrix<T_y,Eigen::Dynamic,1>::size_type size_t;
+
31  if (y.size() == 0) {
+
32  return true;
+
33  }
+
34  if (y[0] < 0) {
+
35  std::ostringstream stream;
+
36  stream << name << " is not a valid positive_ordered vector."
+
37  << " The element at 0 is %1%, but should be postive.";
+
38  std::string msg(stream.str());
+
39  return dom_err(function,y[0],name,
+
40  msg.c_str(),"",
+
41  result);
+
42  }
+
43  for (size_t n = 1; n < y.size(); n++) {
+
44  if (!(y[n] > y[n-1])) {
+
45  std::ostringstream stream;
+
46  stream << name << " is not a valid ordered vector."
+
47  << " The element at " << n
+
48  << " is %1%, but should be greater than the previous element, "
+
49  << y[n-1];
+
50  std::string msg(stream.str());
+
51  return dom_err(function,y[n],name,
+
52  msg.c_str(),"",
+
53  result);
+
54  }
+
55  }
+
56  return true;
+
57  }
+
58  template <typename T>
+
59  bool check_positive_ordered(const char* function,
+
60  const Eigen::Matrix<T,Eigen::Dynamic,1>& y,
+
61  const char* name,
+
62  T* result = 0) {
+
63  return check_positive_ordered<T,T>(function,y,name,result);
+
64  }
+
65 
+
66  }
+
67 }
+
68 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__range_8hpp.html b/doc/api/html/check__range_8hpp.html new file mode 100644 index 00000000000..3df7a7b3f6e --- /dev/null +++ b/doc/api/html/check__range_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/matrix/check_range.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
check_range.hpp File Reference
+
+
+
#include <sstream>
+#include <stdexcept>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + +

+Functions

void stan::math::check_range (size_t max, size_t i, const char *msg, size_t idx)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__range_8hpp_source.html b/doc/api/html/check__range_8hpp_source.html new file mode 100644 index 00000000000..6c82b5fbf70 --- /dev/null +++ b/doc/api/html/check__range_8hpp_source.html @@ -0,0 +1,148 @@ + + + + + +Stan: src/stan/math/matrix/check_range.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
check_range.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__CHECK_RANGE_HPP__
+
2 #define __STAN__MATH__MATRIX__CHECK_RANGE_HPP__
+
3 
+
4 #include <sstream>
+
5 #include <stdexcept>
+
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
10  namespace {
+
11 
+
12  void raise_range_error(size_t max,
+
13  size_t i,
+
14  const char* msg,
+
15  size_t idx) {
+
16  std::stringstream s;
+
17  s << "INDEX OPERATOR [] OUT OF BOUNDS"
+
18  << "; index=" << i
+
19  << "; lower bound=1"
+
20  << "; upper bound=" << max
+
21  << "; index position=" << idx
+
22  << "; " << msg
+
23  << std::endl;
+
24  throw std::out_of_range(s.str());
+
25  }
+
26 
+
27  }
+
28 
+
29  inline
+
30  void check_range(size_t max,
+
31  size_t i,
+
32  const char* msg,
+
33  size_t idx) {
+
34  if (i < 1 || i > max)
+
35  raise_range_error(max,i,msg,idx);
+
36  }
+
37 
+
38 
+
39  }
+
40 }
+
41 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__simplex_8hpp.html b/doc/api/html/check__simplex_8hpp.html new file mode 100644 index 00000000000..835b3fe4073 --- /dev/null +++ b/doc/api/html/check__simplex_8hpp.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/math/error_handling/matrix/check_simplex.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
check_simplex.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + +

+Functions

template<typename T_prob , typename T_result >
bool stan::math::check_simplex (const char *function, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta, const char *name, T_result *result)
 Return true if the specified vector is simplex.
 
template<typename T >
bool stan::math::check_simplex (const char *function, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &theta, const char *name, T *result=0)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__simplex_8hpp_source.html b/doc/api/html/check__simplex_8hpp_source.html new file mode 100644 index 00000000000..57961c0a926 --- /dev/null +++ b/doc/api/html/check__simplex_8hpp_source.html @@ -0,0 +1,169 @@ + + + + + +Stan: src/stan/math/error_handling/matrix/check_simplex.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
check_simplex.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__ERROR_HANDLING__MATRIX__CHECK_SIMPLEX_HPP__
+
2 #define __STAN__MATH__ERROR_HANDLING__MATRIX__CHECK_SIMPLEX_HPP__
+
3 
+
4 #include <sstream>
+ + + +
8 
+
9 namespace stan {
+
10  namespace math {
+
11 
+
26  template <typename T_prob, typename T_result>
+
27  bool check_simplex(const char* function,
+
28  const Eigen::Matrix<T_prob,Eigen::Dynamic,1>& theta,
+
29  const char* name,
+
30  T_result* result) {
+ + +
33  if (theta.size() == 0) {
+
34  std::string message(name);
+
35  message += " is not a valid simplex. %1% elements in the vector.";
+
36  return dom_err(function,0,name,
+
37  message.c_str(),"",
+
38  result);
+
39  }
+
40  if (fabs(1.0 - theta.sum()) > CONSTRAINT_TOLERANCE) {
+
41  std::stringstream msg;
+
42  T_prob sum = theta.sum();
+
43  msg << "in function check_simplex(%1%), ";
+
44  msg << name << " is not a valid simplex.";
+
45  msg << " The sum of the elements should be 1, but is " << sum;
+
46  std::string tmp(msg.str());
+
47  return dom_err(function,sum,name,
+
48  tmp.c_str(),"",
+
49  result);
+
50  }
+
51  for (size_t n = 0; n < theta.size(); n++) {
+
52  if (!(theta[n] >= 0)) {
+
53  std::ostringstream stream;
+
54  stream << name << " is not a valid simplex."
+
55  << " The element at " << n
+
56  << " is %1%, but should be greater than or equal to 0";
+
57  std::string tmp(stream.str());
+
58  return dom_err(function,theta[n],name,
+
59  tmp.c_str(),"",
+
60  result);
+
61  }
+
62  }
+
63  return true;
+
64  }
+
65 
+
66  template <typename T>
+
67  inline bool check_simplex(const char* function,
+
68  const Eigen::Matrix<T,Eigen::Dynamic,1>& theta,
+
69  const char* name,
+
70  T* result = 0) {
+
71  return check_simplex<T,T>(function,theta,name,result);
+
72  }
+
73 
+
74  }
+
75 }
+
76 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__size__match_8hpp.html b/doc/api/html/check__size__match_8hpp.html new file mode 100644 index 00000000000..80952ef46e4 --- /dev/null +++ b/doc/api/html/check__size__match_8hpp.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/math/error_handling/matrix/check_size_match.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
check_size_match.hpp File Reference
+
+
+
#include <sstream>
+#include <boost/type_traits/common_type.hpp>
+#include <stan/math/error_handling/dom_err.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + +

+Functions

template<typename T_size1 , typename T_size2 , typename T_result >
bool stan::math::check_size_match (const char *function, T_size1 i, const char *name_i, T_size2 j, const char *name_j, T_result *result)
 
template<typename T_size1 , typename T_size2 >
bool stan::math::check_size_match (const char *function, T_size1 i, const char *name_i, T_size2 j, const char *name_j, T_size1 *result=0)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__size__match_8hpp_source.html b/doc/api/html/check__size__match_8hpp_source.html new file mode 100644 index 00000000000..21cc95fc3e9 --- /dev/null +++ b/doc/api/html/check__size__match_8hpp_source.html @@ -0,0 +1,153 @@ + + + + + +Stan: src/stan/math/error_handling/matrix/check_size_match.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
check_size_match.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__ERROR_HANDLING__MATRIX__CHECK_SIZE_MATCH_HPP__
+
2 #define __STAN__MATH__ERROR_HANDLING__MATRIX__CHECK_SIZE_MATCH_HPP__
+
3 
+
4 #include <sstream>
+
5 #include <boost/type_traits/common_type.hpp>
+ +
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
11  // FIXME: update warnings
+
12  template <typename T_size1, typename T_size2, typename T_result>
+
13  inline bool check_size_match(const char* function,
+
14  T_size1 i,
+
15  const char* name_i,
+
16  T_size2 j,
+
17  const char* name_j,
+
18  T_result* result) {
+
19  typedef typename boost::common_type<T_size1,T_size2>::type common_type;
+
20  if (static_cast<common_type>(i) != static_cast<common_type>(j)) {
+
21  std::ostringstream msg;
+
22  msg << name_i << " (%1%) and "
+
23  << name_j << " (" << j << ") must match in size";
+
24  std::string tmp(msg.str());
+
25  return dom_err(function,i,name_i,
+
26  tmp.c_str(),"",
+
27  result);
+
28  }
+
29  return true;
+
30  }
+
31 
+
32  template <typename T_size1, typename T_size2>
+
33  inline
+
34  bool check_size_match(const char* function,
+
35  T_size1 i, const char* name_i,
+
36  T_size2 j, const char* name_j,
+
37  T_size1* result = 0) {
+
38  return check_size_match<T_size1,T_size2,T_size1>(function,
+
39  i,name_i,
+
40  j,name_j,
+
41  result);
+
42  }
+
43 
+
44  }
+
45 }
+
46 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__spsd__matrix_8hpp.html b/doc/api/html/check__spsd__matrix_8hpp.html new file mode 100644 index 00000000000..c91ccd30802 --- /dev/null +++ b/doc/api/html/check__spsd__matrix_8hpp.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/math/error_handling/matrix/check_spsd_matrix.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
check_spsd_matrix.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + +

+Functions

template<typename T_y , typename T_result >
bool stan::math::check_spsd_matrix (const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)
 Return true if the specified matrix is a square, symmetric, and positive semi-definite.
 
template<typename T >
bool stan::math::check_spsd_matrix (const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__spsd__matrix_8hpp_source.html b/doc/api/html/check__spsd__matrix_8hpp_source.html new file mode 100644 index 00000000000..52abfa414c5 --- /dev/null +++ b/doc/api/html/check__spsd__matrix_8hpp_source.html @@ -0,0 +1,149 @@ + + + + + +Stan: src/stan/math/error_handling/matrix/check_spsd_matrix.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
check_spsd_matrix.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__ERROR_HANDLING__MATRIX__CHECK_SPSD_MATRIX_HPP__
+
2 #define __STAN__MATH__ERROR_HANDLING__MATRIX__CHECK_SPSD_MATRIX_HPP__
+
3 
+
4 #include <sstream>
+ + + + + +
10 
+
11 
+
12 namespace stan {
+
13  namespace math {
+
14 
+
27  // FIXME: update warnings
+
28  template <typename T_y, typename T_result>
+
29  inline bool check_spsd_matrix(const char* function,
+
30  const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& y,
+
31  const char* name,
+
32  T_result* result) {
+
33  if (!check_square(function, y, name, result))
+
34  return false;
+
35  if (!check_positive(function, y.rows(), "rows", result))
+
36  return false;
+
37  if (!check_symmetric(function, y, name, result))
+
38  return false;
+
39  if (!check_pos_semidefinite(function, y, name, result))
+
40  return false;
+
41  return true;
+
42  }
+
43 
+
44  template <typename T>
+
45  inline bool check_spsd_matrix(const char* function,
+
46  const Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& y,
+
47  const char* name,
+
48  T* result = 0) {
+
49  return check_spsd_matrix<T,T>(function,y,name,result);
+
50  }
+
51 
+
52  }
+
53 }
+
54 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__square_8hpp.html b/doc/api/html/check__square_8hpp.html new file mode 100644 index 00000000000..1dddeca20d8 --- /dev/null +++ b/doc/api/html/check__square_8hpp.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/math/error_handling/matrix/check_square.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
check_square.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + +

+Functions

template<typename T_y , typename T_result >
bool stan::math::check_square (const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)
 Return true if the specified matrix is square.
 
template<typename T >
bool stan::math::check_square (const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__square_8hpp_source.html b/doc/api/html/check__square_8hpp_source.html new file mode 100644 index 00000000000..0eea8b938e2 --- /dev/null +++ b/doc/api/html/check__square_8hpp_source.html @@ -0,0 +1,144 @@ + + + + + +Stan: src/stan/math/error_handling/matrix/check_square.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
check_square.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__ERROR_HANDLING__MATRIX__CHECK_SQUARE_HPP__
+
2 #define __STAN__MATH__ERROR_HANDLING__MATRIX__CHECK_SQUARE_HPP__
+
3 
+
4 #include <sstream>
+ + + + + +
10 
+
11 
+
12 namespace stan {
+
13  namespace math {
+
14 
+
25  template <typename T_y, typename T_result>
+
26  inline bool check_square(const char* function,
+
27  const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& y,
+
28  const char* name,
+
29  T_result* result) {
+
30  if (!check_size_match(function,
+
31  y.rows(), "Rows of matrix",
+
32  y.cols(), "columns of matrix",
+
33  result))
+
34  return false;
+
35  return true;
+
36  }
+
37 
+
38  template <typename T>
+
39  inline bool check_square(const char* function,
+
40  const Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& y,
+
41  const char* name,
+
42  T* result = 0) {
+
43  return check_square<T,T>(function,y,name,result);
+
44  }
+
45  }
+
46 }
+
47 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__symmetric_8hpp.html b/doc/api/html/check__symmetric_8hpp.html new file mode 100644 index 00000000000..7dbdd0a4ce4 --- /dev/null +++ b/doc/api/html/check__symmetric_8hpp.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/math/error_handling/matrix/check_symmetric.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
check_symmetric.hpp File Reference
+
+
+
#include <sstream>
+#include <boost/type_traits/common_type.hpp>
+#include <stan/math/error_handling/dom_err.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/error_handling/matrix/constraint_tolerance.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + +

+Functions

template<typename T_y , typename T_result >
bool stan::math::check_symmetric (const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)
 Return true if the specified matrix is symmetric.
 
template<typename T >
bool stan::math::check_symmetric (const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__symmetric_8hpp_source.html b/doc/api/html/check__symmetric_8hpp_source.html new file mode 100644 index 00000000000..b38563ff80d --- /dev/null +++ b/doc/api/html/check__symmetric_8hpp_source.html @@ -0,0 +1,159 @@ + + + + + +Stan: src/stan/math/error_handling/matrix/check_symmetric.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
check_symmetric.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__ERROR_HANDLING__MATRIX__CHECK_SYMMETRIC_HPP__
+
2 #define __STAN__MATH__ERROR_HANDLING__MATRIX__CHECK_SYMMETRIC_HPP__
+
3 
+
4 #include <sstream>
+
5 #include <boost/type_traits/common_type.hpp>
+ + + +
9 
+
10 namespace stan {
+
11  namespace math {
+
12 
+
25  template <typename T_y, typename T_result>
+
26  inline bool check_symmetric(const char* function,
+
27  const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& y,
+
28  const char* name,
+
29  T_result* result) {
+
30  typedef
+ +
32  size_type;
+
33  size_type k = y.rows();
+
34  if (k == 1)
+
35  return true;
+
36  for (size_type m = 0; m < k; ++m) {
+
37  for (size_type n = m + 1; n < k; ++n) {
+
38  if (fabs(y(m,n) - y(n,m)) > CONSTRAINT_TOLERANCE) {
+
39  std::ostringstream message;
+
40  message << name << " is not symmetric. "
+
41  << name << "[" << m << "," << n << "] is %1%, but "
+
42  << name << "[" << n << "," << m
+
43  << "] element is " << y(n,m);
+
44  std::string msg(message.str());
+
45  return dom_err(function,y(m,n),name,
+
46  msg.c_str(),"",
+
47  result);
+
48  }
+
49  }
+
50  }
+
51  return true;
+
52  }
+
53 
+
54  template <typename T>
+
55  inline bool check_symmetric(const char* function,
+
56  const Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& y,
+
57  const char* name,
+
58  T* result = 0) {
+
59  return check_symmetric<T,T>(function,y,name,result);
+
60  }
+
61 
+
62  }
+
63 }
+
64 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__unit__vector_8hpp.html b/doc/api/html/check__unit__vector_8hpp.html new file mode 100644 index 00000000000..aa321b9148a --- /dev/null +++ b/doc/api/html/check__unit__vector_8hpp.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/math/error_handling/matrix/check_unit_vector.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
check_unit_vector.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + +

+Functions

template<typename T_prob , typename T_result >
bool stan::math::check_unit_vector (const char *function, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta, const char *name, T_result *result)
 Return true if the specified vector is unit vector.
 
template<typename T >
bool stan::math::check_unit_vector (const char *function, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &theta, const char *name, T *result=0)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/check__unit__vector_8hpp_source.html b/doc/api/html/check__unit__vector_8hpp_source.html new file mode 100644 index 00000000000..ab5e71068ae --- /dev/null +++ b/doc/api/html/check__unit__vector_8hpp_source.html @@ -0,0 +1,156 @@ + + + + + +Stan: src/stan/math/error_handling/matrix/check_unit_vector.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
check_unit_vector.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__ERROR_HANDLING__MATRIX__CHECK_UNIT_VECTOR_HPP__
+
2 #define __STAN__MATH__ERROR_HANDLING__MATRIX__CHECK_UNIT_VECTOR_HPP__
+
3 
+
4 #include <sstream>
+ + + +
8 
+
9 namespace stan {
+
10  namespace math {
+
11 
+
24  template <typename T_prob, typename T_result>
+
25  bool check_unit_vector(const char* function,
+
26  const Eigen::Matrix<T_prob,Eigen::Dynamic,1>& theta,
+
27  const char* name,
+
28  T_result* result) {
+ +
30  if (theta.size() == 0) {
+
31  std::string message(name);
+
32  message += " is not a valid unit vector. %1% elements in the vector.";
+
33  return dom_err(function,0,name,
+
34  message.c_str(),"",
+
35  result);
+
36  }
+
37  T_prob ssq = theta.squaredNorm();
+
38  if (fabs(1.0 - ssq) > CONSTRAINT_TOLERANCE) {
+
39  std::stringstream msg;
+
40  msg << "in function check_unit_vector(%1%), ";
+
41  msg << name << " is not a valid unit vector.";
+
42  msg << " The sum of the squares of the elements should be 1, but is " << ssq;
+
43  std::string tmp(msg.str());
+
44  return dom_err(function,ssq,name,
+
45  tmp.c_str(),"",
+
46  result);
+
47  }
+
48  return true;
+
49  }
+
50 
+
51  template <typename T>
+
52  inline bool check_unit_vector(const char* function,
+
53  const Eigen::Matrix<T,Eigen::Dynamic,1>& theta,
+
54  const char* name,
+
55  T* result = 0) {
+
56  return check_unit_vector<T,T>(function,theta,name,result);
+
57  }
+
58 
+
59  }
+
60 }
+
61 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/chi__square_8hpp.html b/doc/api/html/chi__square_8hpp.html new file mode 100644 index 00000000000..65db0b961e7 --- /dev/null +++ b/doc/api/html/chi__square_8hpp.html @@ -0,0 +1,156 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/chi_square.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
chi_square.hpp File Reference
+
+
+
#include <boost/random/chi_squared_distribution.hpp>
+#include <boost/random/variate_generator.hpp>
+#include <stan/agrad/partials_vari.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/math/constants.hpp>
+#include <stan/math/functions/multiply_log.hpp>
+#include <stan/math/functions/value_of.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/prob/constants.hpp>
+#include <stan/prob/traits.hpp>
+#include <stan/prob/internal_math.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + + + + + + + + +

+Functions

template<bool propto, typename T_y , typename T_dof >
return_type< T_y, T_dof >::type stan::prob::chi_square_log (const T_y &y, const T_dof &nu)
 The log of a chi-squared density for y with the specified degrees of freedom parameter.
 
template<typename T_y , typename T_dof >
return_type< T_y, T_dof >::type stan::prob::chi_square_log (const T_y &y, const T_dof &nu)
 
template<typename T_y , typename T_dof >
return_type< T_y, T_dof >::type stan::prob::chi_square_cdf (const T_y &y, const T_dof &nu)
 Calculates the chi square cumulative distribution function for the given variate and degrees of freedom.
 
template<typename T_y , typename T_dof >
return_type< T_y, T_dof >::type stan::prob::chi_square_cdf_log (const T_y &y, const T_dof &nu)
 
template<typename T_y , typename T_dof >
return_type< T_y, T_dof >::type stan::prob::chi_square_ccdf_log (const T_y &y, const T_dof &nu)
 
template<class RNG >
double stan::prob::chi_square_rng (const double nu, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/chi__square_8hpp_source.html b/doc/api/html/chi__square_8hpp_source.html new file mode 100644 index 00000000000..0da8a63bf4f --- /dev/null +++ b/doc/api/html/chi__square_8hpp_source.html @@ -0,0 +1,570 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/chi_square.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
chi_square.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS__CHI_SQUARE_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS__CHI_SQUARE_HPP__
+
3 
+
4 #include <boost/random/chi_squared_distribution.hpp>
+
5 #include <boost/random/variate_generator.hpp>
+
6 
+ + + + + +
12 #include <stan/meta/traits.hpp>
+
13 #include <stan/prob/constants.hpp>
+
14 #include <stan/prob/traits.hpp>
+ +
16 
+
17 namespace stan {
+
18 
+
19  namespace prob {
+
20 
+
40  template <bool propto,
+
41  typename T_y, typename T_dof>
+
42  typename return_type<T_y,T_dof>::type
+
43  chi_square_log(const T_y& y, const T_dof& nu) {
+
44  static const char* function = "stan::prob::chi_square_log(%1%)";
+
45 
+
46  // check if any vectors are zero length
+
47  if (!(stan::length(y)
+
48  && stan::length(nu)))
+
49  return 0.0;
+
50 
+ + + + + + +
57 
+
58  double logp(0.0);
+
59  if (!check_not_nan(function, y, "Random variable", &logp))
+
60  return logp;
+
61  if (!check_nonnegative(function, y, "Random variable", &logp))
+
62  return logp;
+
63  if (!check_finite(function, nu, "Degrees of freedom parameter", &logp))
+
64  return logp;
+
65  if (!check_positive(function, nu, "Degrees of freedom parameter", &logp))
+
66  return logp;
+
67  if (!(check_consistent_sizes(function,
+
68  y,nu,
+
69  "Random variable","Degrees of freedom parameter",
+
70  &logp)))
+
71  return logp;
+
72 
+
73 
+
74  // set up template expressions wrapping scalars into vector views
+
75  VectorView<const T_y> y_vec(y);
+
76  VectorView<const T_dof> nu_vec(nu);
+
77  size_t N = max_size(y, nu);
+
78 
+
79  for (size_t n = 0; n < length(y); n++)
+
80  if (value_of(y_vec[n]) < 0)
+
81  return LOG_ZERO;
+
82 
+
83  // check if no variables are involved and prop-to
+ +
85  return 0.0;
+
86 
+ +
88  using boost::math::lgamma;
+ +
90 
+ +
92  is_vector<T_y>::value> log_y(length(y));
+
93  for (size_t i = 0; i < length(y); i++)
+ +
95  log_y[i] = log(value_of(y_vec[i]));
+
96 
+ +
98  is_vector<T_y>::value> inv_y(length(y));
+
99  for (size_t i = 0; i < length(y); i++)
+ +
101  inv_y[i] = 1.0 / value_of(y_vec[i]);
+
102 
+ +
104  is_vector<T_dof>::value> lgamma_half_nu(length(nu));
+ +
106  is_vector<T_dof>::value> digamma_half_nu_over_two(length(nu));
+
107 
+
108  for (size_t i = 0; i < length(nu); i++) {
+
109  double half_nu = 0.5 * value_of(nu_vec[i]);
+ +
111  lgamma_half_nu[i] = lgamma(half_nu);
+ +
113  digamma_half_nu_over_two[i] = digamma(half_nu) * 0.5;
+
114  }
+
115 
+
116 
+
117  agrad::OperandsAndPartials<T_y,T_dof> operands_and_partials(y, nu);
+
118 
+
119  for (size_t n = 0; n < N; n++) {
+
120  const double y_dbl = value_of(y_vec[n]);
+
121  const double half_y = 0.5 * y_dbl;
+
122  const double nu_dbl = value_of(nu_vec[n]);
+
123  const double half_nu = 0.5 * nu_dbl;
+ +
125  logp += nu_dbl * NEG_LOG_TWO_OVER_TWO - lgamma_half_nu[n];
+ +
127  logp += (half_nu-1.0) * log_y[n];
+ +
129  logp -= half_y;
+
130 
+ +
132  operands_and_partials.d_x1[n] += (half_nu-1.0)*inv_y[n] - 0.5;
+
133  }
+ +
135  operands_and_partials.d_x2[n]
+
136  += NEG_LOG_TWO_OVER_TWO - digamma_half_nu_over_two[n] + log_y[n]*0.5;
+
137  }
+
138  }
+
139  return operands_and_partials.to_var(logp);
+
140  }
+
141 
+
142  template <typename T_y, typename T_dof>
+
143  inline
+ +
145  chi_square_log(const T_y& y, const T_dof& nu) {
+
146  return chi_square_log<false>(y,nu);
+
147  }
+
148 
+
158  template <typename T_y, typename T_dof>
+ +
160  chi_square_cdf(const T_y& y, const T_dof& nu) {
+
161  static const char* function = "stan::prob::chi_square_cdf(%1%)";
+
162 
+ + + + + +
168  using stan::math::value_of;
+
169 
+
170  double cdf(1.0);
+
171 
+
172  // Size checks
+
173  if (!(stan::length(y) && stan::length(nu)))
+
174  return cdf;
+
175 
+
176  if (!check_not_nan(function, y, "Random variable", &cdf))
+
177  return cdf;
+
178  if (!check_nonnegative(function, y, "Random variable", &cdf))
+
179  return cdf;
+
180  if (!check_finite(function, nu, "Degrees of freedom parameter", &cdf))
+
181  return cdf;
+
182  if (!check_positive(function, nu, "Degrees of freedom parameter", &cdf))
+
183  return cdf;
+
184  if (!(check_consistent_sizes(function,
+
185  y,nu,
+
186  "Random variable","Degrees of freedom parameter",
+
187  &cdf)))
+
188  return cdf;
+
189 
+
190  // Wrap arguments in vectors
+
191  VectorView<const T_y> y_vec(y);
+
192  VectorView<const T_dof> nu_vec(nu);
+
193  size_t N = max_size(y, nu);
+
194 
+ +
196  operands_and_partials(y, nu);
+
197 
+
198  // Explicit return for extreme values
+
199  // The gradients are technically ill-defined, but treated as zero
+
200  for (size_t i = 0; i < stan::length(y); i++) {
+
201  if (value_of(y_vec[i]) == 0)
+
202  return operands_and_partials.to_var(0.0);
+
203  }
+
204 
+
205  // Compute CDF and its gradients
+
206  using boost::math::gamma_p_derivative;
+
207  using boost::math::gamma_p;
+
208  using boost::math::digamma;
+
209  using boost::math::tgamma;
+
210 
+
211  // Cache a few expensive function calls if nu is a parameter
+ + +
214  gamma_vec(stan::length(nu));
+ + +
217  digamma_vec(stan::length(nu));
+
218 
+ +
220  for (size_t i = 0; i < stan::length(nu); i++) {
+
221  const double alpha_dbl = value_of(nu_vec[i]) * 0.5;
+
222  gamma_vec[i] = tgamma(alpha_dbl);
+
223  digamma_vec[i] = digamma(alpha_dbl);
+
224  }
+
225  }
+
226 
+
227  // Compute vectorized CDF and gradient
+
228  for (size_t n = 0; n < N; n++) {
+
229  // Explicit results for extreme values
+
230  // The gradients are technically ill-defined, but treated as zero
+
231  if (value_of(y_vec[n]) == std::numeric_limits<double>::infinity())
+
232  continue;
+
233 
+
234  // Pull out values
+
235  const double y_dbl = value_of(y_vec[n]);
+
236  const double alpha_dbl = value_of(nu_vec[n]) * 0.5;
+
237  const double beta_dbl = 0.5;
+
238 
+
239  // Compute
+
240  const double Pn = gamma_p(alpha_dbl, beta_dbl * y_dbl);
+
241 
+
242  cdf *= Pn;
+
243 
+ +
245  operands_and_partials.d_x1[n]
+
246  += beta_dbl * gamma_p_derivative(alpha_dbl, beta_dbl * y_dbl)
+
247  / Pn;
+ +
249  operands_and_partials.d_x2[n]
+
250  -= 0.5 * stan::math::gradRegIncGamma(alpha_dbl, beta_dbl
+
251  * y_dbl, gamma_vec[n],
+
252  digamma_vec[n]) / Pn;
+
253  }
+
254 
+ +
256  for (size_t n = 0; n < stan::length(y); ++n)
+
257  operands_and_partials.d_x1[n] *= cdf;
+ +
259  for (size_t n = 0; n < stan::length(nu); ++n)
+
260  operands_and_partials.d_x2[n] *= cdf;
+
261 
+
262  return operands_and_partials.to_var(cdf);
+
263  }
+
264 
+
265  template <typename T_y, typename T_dof>
+ +
267  chi_square_cdf_log(const T_y& y, const T_dof& nu) {
+
268  static const char* function = "stan::prob::chi_square_cdf_log(%1%)";
+
269 
+ + + + + +
275  using stan::math::value_of;
+
276 
+
277  double cdf_log(0.0);
+
278 
+
279  // Size checks
+
280  if (!(stan::length(y) && stan::length(nu)))
+
281  return cdf_log;
+
282 
+
283  if (!check_not_nan(function, y, "Random variable", &cdf_log))
+
284  return cdf_log;
+
285  if (!check_nonnegative(function, y, "Random variable", &cdf_log))
+
286  return cdf_log;
+
287  if (!check_finite(function, nu, "Degrees of freedom parameter", &cdf_log))
+
288  return cdf_log;
+
289  if (!check_positive(function, nu, "Degrees of freedom parameter", &cdf_log))
+
290  return cdf_log;
+
291  if (!(check_consistent_sizes(function,
+
292  y,nu,
+
293  "Random variable","Degrees of freedom parameter",
+
294  &cdf_log)))
+
295  return cdf_log;
+
296 
+
297  // Wrap arguments in vectors
+
298  VectorView<const T_y> y_vec(y);
+
299  VectorView<const T_dof> nu_vec(nu);
+
300  size_t N = max_size(y, nu);
+
301 
+ +
303  operands_and_partials(y, nu);
+
304 
+
305  // Explicit return for extreme values
+
306  // The gradients are technically ill-defined, but treated as zero
+
307  for (size_t i = 0; i < stan::length(y); i++) {
+
308  if (value_of(y_vec[i]) == 0)
+
309  return operands_and_partials.to_var(stan::math::negative_infinity());
+
310  }
+
311 
+
312  // Compute cdf_log and its gradients
+
313  using boost::math::gamma_p_derivative;
+
314  using boost::math::gamma_p;
+
315  using boost::math::digamma;
+
316  using boost::math::tgamma;
+
317 
+
318  // Cache a few expensive function calls if nu is a parameter
+ + +
321  gamma_vec(stan::length(nu));
+ + +
324  digamma_vec(stan::length(nu));
+
325 
+ +
327  for (size_t i = 0; i < stan::length(nu); i++) {
+
328  const double alpha_dbl = value_of(nu_vec[i]) * 0.5;
+
329  gamma_vec[i] = tgamma(alpha_dbl);
+
330  digamma_vec[i] = digamma(alpha_dbl);
+
331  }
+
332  }
+
333 
+
334  // Compute vectorized cdf_log and gradient
+
335  for (size_t n = 0; n < N; n++) {
+
336  // Explicit results for extreme values
+
337  // The gradients are technically ill-defined, but treated as zero
+
338  if (value_of(y_vec[n]) == std::numeric_limits<double>::infinity())
+
339  return operands_and_partials.to_var(0.0);
+
340 
+
341  // Pull out values
+
342  const double y_dbl = value_of(y_vec[n]);
+
343  const double alpha_dbl = value_of(nu_vec[n]) * 0.5;
+
344  const double beta_dbl = 0.5;
+
345 
+
346  // Compute
+
347  const double Pn = gamma_p(alpha_dbl, beta_dbl * y_dbl);
+
348 
+
349  cdf_log += log(Pn);
+
350 
+ +
352  operands_and_partials.d_x1[n]
+
353  += beta_dbl * gamma_p_derivative(alpha_dbl, beta_dbl * y_dbl)
+
354  / Pn;
+ +
356  operands_and_partials.d_x2[n]
+
357  -= 0.5 * stan::math::gradRegIncGamma(alpha_dbl, beta_dbl
+
358  * y_dbl, gamma_vec[n],
+
359  digamma_vec[n]) / Pn;
+
360  }
+
361 
+
362  return operands_and_partials.to_var(cdf_log);
+
363  }
+
364 
+
365  template <typename T_y, typename T_dof>
+ +
367  chi_square_ccdf_log(const T_y& y, const T_dof& nu) {
+
368  static const char* function = "stan::prob::chi_square_ccdf_log(%1%)";
+
369 
+ + + + + +
375  using stan::math::value_of;
+
376 
+
377  double ccdf_log(0.0);
+
378 
+
379  // Size checks
+
380  if (!(stan::length(y) && stan::length(nu)))
+
381  return ccdf_log;
+
382 
+
383  if (!check_not_nan(function, y, "Random variable", &ccdf_log))
+
384  return ccdf_log;
+
385  if (!check_nonnegative(function, y, "Random variable", &ccdf_log))
+
386  return ccdf_log;
+
387  if (!check_finite(function, nu, "Degrees of freedom parameter", &ccdf_log))
+
388  return ccdf_log;
+
389  if (!check_positive(function, nu, "Degrees of freedom parameter", &ccdf_log))
+
390  return ccdf_log;
+
391  if (!(check_consistent_sizes(function,
+
392  y,nu,
+
393  "Random variable","Degrees of freedom parameter",
+
394  &ccdf_log)))
+
395  return ccdf_log;
+
396 
+
397  // Wrap arguments in vectors
+
398  VectorView<const T_y> y_vec(y);
+
399  VectorView<const T_dof> nu_vec(nu);
+
400  size_t N = max_size(y, nu);
+
401 
+ +
403  operands_and_partials(y, nu);
+
404 
+
405  // Explicit return for extreme values
+
406  // The gradients are technically ill-defined, but treated as zero
+
407  for (size_t i = 0; i < stan::length(y); i++) {
+
408  if (value_of(y_vec[i]) == 0)
+
409  return operands_and_partials.to_var(0.0);
+
410  }
+
411 
+
412  // Compute ccdf_log and its gradients
+
413  using boost::math::gamma_p_derivative;
+
414  using boost::math::gamma_p;
+
415  using boost::math::digamma;
+
416  using boost::math::tgamma;
+
417 
+
418  // Cache a few expensive function calls if nu is a parameter
+ + +
421  gamma_vec(stan::length(nu));
+ + +
424  digamma_vec(stan::length(nu));
+
425 
+ +
427  for (size_t i = 0; i < stan::length(nu); i++) {
+
428  const double alpha_dbl = value_of(nu_vec[i]) * 0.5;
+
429  gamma_vec[i] = tgamma(alpha_dbl);
+
430  digamma_vec[i] = digamma(alpha_dbl);
+
431  }
+
432  }
+
433 
+
434  // Compute vectorized ccdf_log and gradient
+
435  for (size_t n = 0; n < N; n++) {
+
436  // Explicit results for extreme values
+
437  // The gradients are technically ill-defined, but treated as zero
+
438  if (value_of(y_vec[n]) == std::numeric_limits<double>::infinity())
+
439  return operands_and_partials.to_var(stan::math::negative_infinity());
+
440 
+
441  // Pull out values
+
442  const double y_dbl = value_of(y_vec[n]);
+
443  const double alpha_dbl = value_of(nu_vec[n]) * 0.5;
+
444  const double beta_dbl = 0.5;
+
445 
+
446  // Compute
+
447  const double Pn = 1.0 - gamma_p(alpha_dbl, beta_dbl * y_dbl);
+
448 
+
449  ccdf_log += log(Pn);
+
450 
+ +
452  operands_and_partials.d_x1[n]
+
453  -= beta_dbl * gamma_p_derivative(alpha_dbl, beta_dbl * y_dbl)
+
454  / Pn;
+ +
456  operands_and_partials.d_x2[n]
+
457  += 0.5 * stan::math::gradRegIncGamma(alpha_dbl, beta_dbl
+
458  * y_dbl, gamma_vec[n],
+
459  digamma_vec[n]) / Pn;
+
460  }
+
461 
+
462  return operands_and_partials.to_var(ccdf_log);
+
463  }
+
464 
+
465  template <class RNG>
+
466  inline double
+
467  chi_square_rng(const double nu,
+
468  RNG& rng) {
+
469  using boost::variate_generator;
+
470  using boost::random::chi_squared_distribution;
+
471 
+
472  static const char* function = "stan::prob::chi_square_rng(%1%)";
+
473 
+ + +
476 
+
477  if (!check_finite(function, nu, "Degrees of freedom parameter"))
+
478  return 0;
+
479  if (!check_positive(function, nu, "Degrees of freedom parameter"))
+
480  return 0;
+
481 
+
482 
+
483  variate_generator<RNG&, chi_squared_distribution<> >
+
484  chi_square_rng(rng, chi_squared_distribution<>(nu));
+
485  return chi_square_rng();
+
486  }
+
487  }
+
488 }
+
489 
+
490 #endif
+
491 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/cholesky__decompose_8hpp.html b/doc/api/html/cholesky__decompose_8hpp.html new file mode 100644 index 00000000000..70abd48da80 --- /dev/null +++ b/doc/api/html/cholesky__decompose_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/math/matrix/cholesky_decompose.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
cholesky_decompose.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
stan::math::cholesky_decompose (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &m)
 Return the lower-triangular Cholesky factor (i.e., matrix square root) of the specified square, symmetric matrix.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/cholesky__decompose_8hpp_source.html b/doc/api/html/cholesky__decompose_8hpp_source.html new file mode 100644 index 00000000000..076cce34ef5 --- /dev/null +++ b/doc/api/html/cholesky__decompose_8hpp_source.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/math/matrix/cholesky_decompose.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
cholesky_decompose.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__CHOLESKY_DECOMPOSE_HPP__
+
2 #define __STAN__MATH__MATRIX__CHOLESKY_DECOMPOSE_HPP__
+
3 
+ + +
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
20  template <typename T>
+
21  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>
+
22  cholesky_decompose(const Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& m) {
+
23  validate_symmetric(m,"cholesky decomposition");
+
24  Eigen::LLT<Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> >llt(m.rows());
+
25  llt.compute(m);
+
26  return llt.matrixL();
+
27  }
+
28 
+
29  }
+
30 }
+
31 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/chunk__alloc_8hpp.html b/doc/api/html/chunk__alloc_8hpp.html new file mode 100644 index 00000000000..5969234c262 --- /dev/null +++ b/doc/api/html/chunk__alloc_8hpp.html @@ -0,0 +1,155 @@ + + + + + +Stan: src/stan/memory/chunk_alloc.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
chunk_alloc.hpp File Reference
+
+
+
#include <cstdlib>
+#include <cstddef>
+#include <sstream>
+#include <stdexcept>
+#include <stdint.h>
+#include <vector>
+#include <stan/memory/stack_alloc.hpp>
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  stan::memory::chunk_alloc< T, Tnchunks_per_block >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::memory
 (Expert) Allocate, free, and manage underlying system memory.
 
+ + + +

+Macros

#define DEFAULT_INITIAL_NCHUNKS   (1 << 8)
 
+

Macro Definition Documentation

+ +
+
+ + + + +
#define DEFAULT_INITIAL_NCHUNKS   (1 << 8)
+
+ +

Definition at line 12 of file chunk_alloc.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/chunk__alloc_8hpp_source.html b/doc/api/html/chunk__alloc_8hpp_source.html new file mode 100644 index 00000000000..71fe106b39c --- /dev/null +++ b/doc/api/html/chunk__alloc_8hpp_source.html @@ -0,0 +1,181 @@ + + + + + +Stan: src/stan/memory/chunk_alloc.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
chunk_alloc.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MEMORY__CHUNK_ALLOC_HPP__
+
2 #define __STAN__MEMORY__CHUNK_ALLOC_HPP__
+
3 
+
4 #include <cstdlib>
+
5 #include <cstddef>
+
6 #include <sstream>
+
7 #include <stdexcept>
+
8 #include <stdint.h> // FIXME: replace with cstddef?
+
9 #include <vector>
+ +
11 
+
12 #define DEFAULT_INITIAL_NCHUNKS (1 << 8)
+
13 
+
14 namespace stan {
+
15  namespace memory {
+
18  template<typename T, size_t Tnchunks_per_block = DEFAULT_INITIAL_NCHUNKS>
+
19  class chunk_alloc {
+
20  private:
+
21  std::vector<char*> blocks_; // storage for blocks, may be bigger than cur_block_
+
22  size_t cur_block_; // index into blocks_ for next alloc
+
23  size_t used_; // index into blocks_[cur_block_] for next alloc
+
24  public:
+
25 
+
26 
+ +
35  blocks_(1, eight_byte_aligned_malloc(sizeof(T)*Tnchunks_per_block)),
+
36  used_(0)
+
37  {
+
38  if (!blocks_[0])
+
39  throw std::bad_alloc(); // no msg allowed in bad_alloc ctor
+
40  }
+
41 
+ +
49  // free ALL blocks
+
50  for (size_t i = 0; i < blocks_.size(); ++i)
+
51  if (blocks_[i])
+
52  free(blocks_[i]);
+
53  }
+
54 
+
61  inline void* alloc() {
+
62  char *result;
+
63  if (unlikely(used_ >= Tnchunks_per_block)) {
+
64  used_ = 0;
+
65  cur_block_++;
+
66  }
+
67  if (unlikely(cur_block_ >= blocks_.size())) {
+
68  result = eight_byte_aligned_malloc(Tnchunks_per_block*sizeof(T));
+
69  if (!result)
+
70  throw std::bad_alloc(); // no msg allowed in bad_alloc ctor
+
71  blocks_.push_back(result);
+
72  }
+
73  result = blocks_[cur_block_] + sizeof(T)*used_;
+
74  ++used_;
+
75 
+
76  return (void*)result;
+
77  }
+
78 
+
85  inline void recover_all() {
+
86  cur_block_ = 0;
+
87  used_ = 0;
+
88  }
+
89 
+
95  inline void free_all() {
+
96  // frees all BUT the first (index 0) block
+
97  for (size_t i = 1; i < blocks_.size(); ++i)
+
98  if (blocks_[i])
+
99  free(blocks_[i]);
+
100  blocks_.resize(1);
+
101  recover_all();
+
102  }
+
103  };
+
104  }
+
105 }
+
106 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/class_l_d_l_t__factor.html b/doc/api/html/class_l_d_l_t__factor.html new file mode 100644 index 00000000000..433000ae871 --- /dev/null +++ b/doc/api/html/class_l_d_l_t__factor.html @@ -0,0 +1,116 @@ + + + + + +Stan: LDLT_factor< T, R, C > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ +
+
+
+
LDLT_factor< T, R, C > Class Template Reference
+
+
+ +

#include <ldlt.hpp>

+

Detailed Description

+

template<typename T, int R, int C>
+class LDLT_factor< T, R, C >

+ + +

Definition at line 16 of file ldlt.hpp.

+

The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classes.html b/doc/api/html/classes.html new file mode 100644 index 00000000000..8cba11b0117 --- /dev/null +++ b/doc/api/html/classes.html @@ -0,0 +1,213 @@ + + + + + +Stan: Class Index + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + +
+ + + + +
+ +
+ +
+
+
Class Index
+
+
+
A | B | C | D | E | F | G | I | L | M | N | O | P | R | S | T | U | V | W
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
  A  
+
base_integrator (stan::mcmc)   increment_log_prob_statement (stan::gm)   program_grammar (stan::gm)   statement_grammar (stan::gm)   
base_leapfrog (stan::mcmc)   index_op (stan::gm)   promoter (stan::math)   statement_visgen (stan::gm)   
accumulator (stan::math)   base_mcmc (stan::mcmc)   init_local_var_visgen (stan::gm)   promoter< Eigen::Matrix< F, R, C >, Eigen::Matrix< T, R, C > > (stan::math)   statements (stan::gm)   
adapt_dense_e_nuts (stan::mcmc)   base_nuts (stan::mcmc)   int_literal (stan::gm)   promoter< Eigen::Matrix< T, R, C >, Eigen::Matrix< T, R, C > > (stan::math)   stepsize_adaptation (stan::mcmc)   
adapt_dense_e_static_hmc (stan::mcmc)   base_static_hmc (stan::mcmc)   int_var_decl (stan::gm)   promoter< std::vector< F >, std::vector< T > > (stan::math)   stepsize_adapter (stan::mcmc)   
adapt_diag_e_nuts (stan::mcmc)   base_var_decl (stan::gm)   is_constant (stan)   promoter< std::vector< T >, std::vector< T > > (stan::math)   stepsize_covar_adapter (stan::mcmc)   
adapt_diag_e_static_hmc (stan::mcmc)   BFGSLineSearch (stan::optimization)   is_constant_struct (stan)   promoter< T, T > (stan::math)   stepsize_var_adapter (stan::mcmc)   
adapt_unit_e_nuts (stan::mcmc)   BFGSMinimizer (stan::optimization)   is_constant_struct< Eigen::Block< T > > (stan)   ps_point (stan::mcmc)   store_type (stan::math)   
adapt_unit_e_static_hmc (stan::mcmc)   BFGSMinimizer::BFGSOptions (stan::optimization)   is_constant_struct< Eigen::Matrix< T, R, C > > (stan)   
  R  
+
store_type< double > (stan::math)   
add_conditional_body (stan::gm)   binary_op (stan::gm)   is_constant_struct< std::vector< T > > (stan)   store_type< int > (stan::math)   
add_conditional_condition (stan::gm)   binary_op_expr (stan::gm)   is_fvar (stan)   range (stan::gm)   stored_gradient_vari (stan::agrad)   
add_expression_dimss (stan::gm)   
  C  
+
is_fvar< stan::agrad::fvar< T > > (stan)   reader (stan::io)   subtraction_expr (stan::gm)   
add_loop_identifier (stan::gm)   is_nil_op (stan::gm)   remove_loop_identifier (stan::gm)   
  T  
+
add_while_body (stan::gm)   categorical_argument (stan::gm)   is_var (stan)   transpose_expr::result (stan::gm)   
add_while_condition (stan::gm)   chainable (stan::agrad)   is_var< stan::agrad::var > (stan)   left_division_expr::result (stan::gm)   term_grammar   
addition_expr (stan::gm)   chainable_alloc (stan::agrad)   is_var_or_arithmetic (stan)   add_loop_identifier::result (stan::gm)   term_grammar (stan::gm)   
arg_adapt (stan::gm)   chains (stan::mcmc)   is_vector (stan)   validate_int_expr3::result (stan::gm)   term_grammar   
arg_adapt_delta (stan::gm)   cholesky_factor_var_decl (stan::gm)   is_vector< const T > (stan)   set_var_type::result (stan::gm)   transpose_expr (stan::gm)   
arg_adapt_engaged (stan::gm)   chunk_alloc (stan::memory)   is_vector< Eigen::Matrix< T, 1, Eigen::Dynamic > > (stan)   add_expression_dimss::result (stan::gm)   type_name (stan::gm)   
arg_adapt_gamma (stan::gm)   cmd_line (stan::io)   is_vector< Eigen::Matrix< T, Eigen::Dynamic, 1 > > (stan)   logical_negate_expr::result (stan::gm)   type_name< bool > (stan::gm)   
arg_adapt_init_buffer (stan::gm)   common_type (stan::math)   is_vector< std::vector< T > > (stan)   elt_division_expr::result (stan::gm)   type_name< double > (stan::gm)   
arg_adapt_kappa (stan::gm)   common_type< Eigen::Matrix< T1, R, C >, Eigen::Matrix< T2, R, C > > (stan::math)   is_vector_like (stan)   elt_multiplication_expr::result (stan::gm)   type_name< int > (stan::gm)   
arg_adapt_t0 (stan::gm)   common_type< std::vector< T1 >, std::vector< T2 > > (stan::math)   is_vector_like< const T > (stan)   validate_int_expr2::result (stan::gm)   type_name< std::string > (stan::gm)   
arg_adapt_term_buffer (stan::gm)   conditional_statement (stan::gm)   is_vector_like< Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > > (stan)   validate_assignment::result (stan::gm)   type_name< unsigned int > (stan::gm)   
arg_adapt_window (stan::gm)   constrained_param_names_visgen (stan::gm)   is_vector_like< T * > (stan)   multiplication_expr::result (stan::gm)   
  U  
+
arg_bfgs (stan::gm)   contains_fvar (stan)   
  L  
+
validate_sample::result (stan::gm)   
arg_data (stan::gm)   contains_nonparam_var (stan::gm)   negate_expr::result (stan::gm)   unary_op (stan::gm)   
arg_data_file (stan::gm)   contains_var (stan::gm)   LDLT_factor   subtraction_expr::result (stan::gm)   unconstrained_param_names_visgen (stan::gm)   
arg_dense_e (stan::gm)   corr_matrix_var_decl (stan::gm)   LDLT_factor< double, R, C > (stan::math)   set_fun_type::result (stan::gm)   unit_e_metric (stan::mcmc)   
arg_diag_e (stan::gm)   cov_matrix_var_decl (stan::gm)   LDLT_factor< stan::agrad::var, R, C > (stan::math)   validate_expr_type2::result (stan::gm)   unit_e_nuts (stan::mcmc)   
arg_diagnose (stan::gm)   covar_adaptation (stan::mcmc)   left_division_expr (stan::gm)   remove_loop_identifier::result (stan::gm)   unit_e_point (stan::mcmc)   
arg_diagnostic_file (stan::gm)   csv_writer (stan::io)   list_argument (stan::gm)   unscope_locals::result (stan::gm)   unit_e_static_hmc (stan::mcmc)   
arg_engine (stan::gm)   
  D  
+
local_var_decl_visgen (stan::gm)   add_conditional_body::result (stan::gm)   unit_vector_var_decl (stan::gm)   
arg_fail (stan::gm)   logical_negate_expr (stan::gm)   add_conditional_condition::result (stan::gm)   unscope_locals (stan::gm)   
arg_hmc (stan::gm)   dense_e_metric (stan::mcmc)   
  M  
+
addition_expr::result (stan::gm)   unvalued_argument (stan::gm)   
arg_id (stan::gm)   dense_e_nuts (stan::mcmc)   add_while_condition::result (stan::gm)   
  V  
+
arg_init (stan::gm)   dense_e_point (stan::mcmc)   matrix_var_decl (stan::gm)   binary_op_expr::result (stan::gm)   
arg_init_alpha (stan::gm)   dense_e_static_hmc (stan::mcmc)   mcmc_writer (stan::io)   set_fun_type2::result (stan::gm)   validate_allow_sample (stan::gm)   
arg_int_time (stan::gm)   diag_e_metric (stan::mcmc)   member_var_decl_visgen (stan::gm)   validate_expr_type::result (stan::gm)   validate_assignment (stan::gm)   
arg_iter (stan::gm)   diag_e_nuts (stan::mcmc)   ModelAdaptor (stan::optimization)   division_expr::result (stan::gm)   validate_expr_type (stan::gm)   
arg_max_depth (stan::gm)   diag_e_point (stan::mcmc)   multiplication_expr (stan::gm)   expression_as_statement::result (stan::gm)   validate_expr_type2 (stan::gm)   
arg_method (stan::gm)   diag_e_static_hmc (stan::mcmc)   
  N  
+
set_fun_type_named::result (stan::gm)   validate_int_expr2 (stan::gm)   
arg_metric (stan::gm)   distribution (stan::gm)   validate_allow_sample::result (stan::gm)   validate_int_expr3 (stan::gm)   
arg_nesterov (stan::gm)   division_expr (stan::gm)   name_vis (stan::gm)   add_while_body::result (stan::gm)   validate_sample (stan::gm)   
arg_newton (stan::gm)   dot_product_store_type   negate_expr (stan::gm)   return_type (stan)   validate_transformed_params_visgen (stan::gm)   
arg_num_samples (stan::gm)   double_literal (stan::gm)   NesterovGradient (stan::optimization)   row_vector_var_decl (stan::gm)   validate_var_decl_visgen (stan::gm)   
arg_num_warmup (stan::gm)   double_var_decl (stan::gm)   nil (stan::gm)   
  S  
+
valued_argument (stan::gm)   
arg_nuts (stan::gm)   DoubleVectorView (stan)   no_op_statement (stan::gm)   var (stan::agrad)   
arg_optimize (stan::gm)   DoubleVectorView< true, false > (stan)   numeric_limits< stan::agrad::fvar< T > > (std)   sample (stan::mcmc)   var_adaptation (stan::mcmc)   
arg_optimize_algo (stan::gm)   DoubleVectorView< true, true > (stan)   numeric_limits< stan::agrad::var > (std)   sample (stan::gm)   var_context (stan::io)   
arg_output (stan::gm)   dump (stan::io)   NumTraits< stan::agrad::var > (Eigen)   scalar_product_traits< double, stan::agrad::var > (Eigen::internal)   var_decl (stan::gm)   
arg_output_file (stan::gm)   dump_member_var_visgen (stan::gm)   nuts_util (stan::mcmc)   scalar_product_traits< stan::agrad::var, double > (Eigen::internal)   var_decls_grammar (stan::gm)   
arg_random (stan::gm)   dump_reader (stan::io)   
  O  
+
scalar_type (stan)   var_resizing_visgen (stan::gm)   
arg_refresh (stan::gm)   dump_writer (stan::io)   scalar_type< Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > > (stan)   var_size_validating_visgen (stan::gm)   
arg_rwm (stan::gm)   
  E  
+
op_ddv_vari (stan::agrad)   scalar_type< T * > (stan)   vari (stan::agrad)   
arg_sample (stan::gm)   op_dv_vari (stan::agrad)   seq_view (stan::math)   variable (stan::gm)   
arg_sample_algo (stan::gm)   elt_division_expr (stan::gm)   op_dvd_vari (stan::agrad)   seq_view< double, std::vector< int > > (stan::math)   variable_dims (stan::gm)   
arg_save_iterations (stan::gm)   elt_multiplication_expr (stan::gm)   op_dvv_vari (stan::agrad)   seq_view< T, Eigen::Matrix< S, 1, Eigen::Dynamic > > (stan::math)   variable_map (stan::gm)   
arg_save_warmup (stan::gm)   error_codes (stan::gm)   op_matrix_vari (stan::agrad)   seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, 1 > > (stan::math)   vector_var_decl (stan::gm)   
arg_seed (stan::gm)   expl_leapfrog (stan::mcmc)   op_v_vari (stan::agrad)   seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, Eigen::Dynamic > > (stan::math)   VectorView (stan)   
arg_static (stan::gm)   expr_type (stan::gm)   op_vd_vari (stan::agrad)   seq_view< T, std::vector< S > > (stan::math)   VectorView< const double, false, false > (stan)   
arg_stepsize (stan::gm)   expression (stan::gm)   op_vdd_vari (stan::agrad)   seq_view< T, std::vector< std::vector< T > > > (stan::math)   VectorView< const T, is_array, throw_if_accessed > (stan)   
arg_stepsize_jitter (stan::gm)   expression_as_statement (stan::gm)   op_vdv_vari (stan::agrad)   seq_view< T, std::vector< T > > (stan::math)   visgen (stan::gm)   
arg_test (stan::gm)   expression_grammar   op_vector_vari (stan::agrad)   set_fun_type (stan::gm)   
  W  
+
arg_test_grad_eps (stan::gm)   expression_grammar (stan::gm)   op_vv_vari (stan::agrad)   set_fun_type2 (stan::gm)   
arg_test_grad_err (stan::gm)   expression_type_vis (stan::gm)   op_vvd_vari (stan::agrad)   set_fun_type_named (stan::gm)   welford_covar_estimator (stan::prob)   
arg_test_gradient (stan::gm)   expression_visgen (stan::gm)   op_vvv_vari (stan::agrad)   set_param_ranges_visgen (stan::gm)   welford_var_estimator (stan::prob)   
arg_thin (stan::gm)   
  F  
+
OperandsAndPartials (stan::agrad)   set_var_type (stan::gm)   while_statement (stan::gm)   
arg_tolerance (stan::gm)   ordered_var_decl (stan::gm)   significant_decimals_default_impl< stan::agrad::var, false > (Eigen::internal)   whitespace_grammar (stan::gm)   
arg_unit_e (stan::gm)   for_statement (stan::gm)   
  P  
+
simplex_var_decl (stan::gm)   windowed_adaptation (stan::mcmc)   
argument (stan::gm)   fun (stan::gm)   singleton_argument (stan::gm)   write_array_vars_visgen (stan::gm)   
argument_parser (stan::gm)   function_signatures (stan::gm)   partials_vari (stan::agrad)   size_of_helper (stan)   write_array_visgen (stan::gm)   
argument_probe (stan::gm)   fvar (stan::agrad)   pass_type (stan::math)   size_of_helper< T, true > (stan)   write_csv_header_visgen (stan::gm)   
array_builder (stan::math)   
  G  
+
pass_type< double > (stan::math)   stack_alloc (stan::memory)   write_csv_vars_visgen (stan::gm)   
array_literal (stan::gm)   pass_type< int > (stan::math)   stan_csv (stan::io)   write_csv_visgen (stan::gm)   
assignment (stan::gm)   general_matrix_matrix_product< Index, stan::agrad::var, LhsStorageOrder, ConjugateLhs, stan::agrad::var, RhsStorageOrder, ConjugateRhs, ColMajor > (Eigen::internal)   positive_ordered_var_decl (stan::gm)   stan_csv_adaptation (stan::io)   write_dims_visgen (stan::gm)   
  B  
+
general_matrix_vector_product< Index, stan::agrad::var, ColMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs > (Eigen::internal)   precomp_v_vari (stan::agrad)   stan_csv_metadata (stan::io)   write_param_names_visgen (stan::gm)   
general_matrix_vector_product< Index, stan::agrad::var, RowMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs > (Eigen::internal)   print_statement (stan::gm)   stan_csv_reader (stan::io)   writer (stan::io)   
base_adaptation (stan::mcmc)   generate_init_vars_visgen (stan::gm)   printable (stan::gm)   stan_csv_timing (stan::io)   
base_adapter (stan::mcmc)   generate_init_visgen (stan::gm)   printable_visgen (stan::gm)   statement (stan::gm)   
base_hamiltonian (stan::mcmc)   generate_local_var_init_nan_visgen (stan::gm)   prob_grad (stan::model)   statement_2_grammar (stan::gm)   
base_hmc (stan::mcmc)   
  I  
+
program (stan::gm)   statement_grammar   
include_summand (stan::prob)   
+
A | B | C | D | E | F | G | I | L | M | N | O | P | R | S | T | U | V | W
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1_double_vector_view-members.html b/doc/api/html/classstan_1_1_double_vector_view-members.html new file mode 100644 index 00000000000..112be89c023 --- /dev/null +++ b/doc/api/html/classstan_1_1_double_vector_view-members.html @@ -0,0 +1,114 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::DoubleVectorView< used, is_vec > Member List
+
+
+ +

This is the complete list of members for stan::DoubleVectorView< used, is_vec >, including all inherited members.

+ + + +
DoubleVectorView(size_t)stan::DoubleVectorView< used, is_vec >inline
operator[](size_t)stan::DoubleVectorView< used, is_vec >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1_double_vector_view.html b/doc/api/html/classstan_1_1_double_vector_view.html new file mode 100644 index 00000000000..3bf96fef378 --- /dev/null +++ b/doc/api/html/classstan_1_1_double_vector_view.html @@ -0,0 +1,199 @@ + + + + + +Stan: stan::DoubleVectorView< used, is_vec > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::DoubleVectorView< used, is_vec > Class Template Reference
+
+
+ +

DoubleVectorView allocates double values to be used as intermediate values. + More...

+ +

#include <traits.hpp>

+ + + + + + +

+Public Member Functions

 DoubleVectorView (size_t)
 
double & operator[] (size_t)
 
+

Detailed Description

+

template<bool used, bool is_vec>
+class stan::DoubleVectorView< used, is_vec >

+ +

DoubleVectorView allocates double values to be used as intermediate values.

+

There are 2 template parameters:

+
    +
  • used: boolean variable indicating whether this instance is used. If this is false, there is no storage allocated and operator[] throws.
  • +
  • is_vec: boolean variable indicating whether this instance should allocate a vector, if it is used. If this is false, the instance will only allocate a single double value. If this is true, it will allocate the number requested.
  • +
+

These values are mutable.

+ +

Definition at line 336 of file traits.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<bool used, bool is_vec>
+ + + + + +
+ + + + + + + + +
stan::DoubleVectorView< used, is_vec >::DoubleVectorView (size_t )
+
+inline
+
+ +

Definition at line 338 of file traits.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<bool used, bool is_vec>
+ + + + + +
+ + + + + + + + +
double& stan::DoubleVectorView< used, is_vec >::operator[] (size_t )
+
+inline
+
+ +

Definition at line 339 of file traits.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1_double_vector_view_3_01true_00_01false_01_4-members.html b/doc/api/html/classstan_1_1_double_vector_view_3_01true_00_01false_01_4-members.html new file mode 100644 index 00000000000..fd6194ea2ec --- /dev/null +++ b/doc/api/html/classstan_1_1_double_vector_view_3_01true_00_01false_01_4-members.html @@ -0,0 +1,114 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::DoubleVectorView< true, false > Member List
+
+
+ +

This is the complete list of members for stan::DoubleVectorView< true, false >, including all inherited members.

+ + + +
DoubleVectorView(size_t)stan::DoubleVectorView< true, false >inline
operator[](size_t)stan::DoubleVectorView< true, false >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1_double_vector_view_3_01true_00_01false_01_4.html b/doc/api/html/classstan_1_1_double_vector_view_3_01true_00_01false_01_4.html new file mode 100644 index 00000000000..2a13d8208cf --- /dev/null +++ b/doc/api/html/classstan_1_1_double_vector_view_3_01true_00_01false_01_4.html @@ -0,0 +1,185 @@ + + + + + +Stan: stan::DoubleVectorView< true, false > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::DoubleVectorView< true, false > Class Template Reference
+
+
+ +

#include <traits.hpp>

+ + + + + + +

+Public Member Functions

 DoubleVectorView (size_t)
 
double & operator[] (size_t)
 
+

Detailed Description

+

template<>
+class stan::DoubleVectorView< true, false >

+ + +

Definition at line 345 of file traits.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::DoubleVectorView< true, false >::DoubleVectorView (size_t )
+
+inline
+
+ +

Definition at line 349 of file traits.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
double& stan::DoubleVectorView< true, false >::operator[] (size_t )
+
+inline
+
+ +

Definition at line 350 of file traits.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1_double_vector_view_3_01true_00_01true_01_4-members.html b/doc/api/html/classstan_1_1_double_vector_view_3_01true_00_01true_01_4-members.html new file mode 100644 index 00000000000..015d45a8d7d --- /dev/null +++ b/doc/api/html/classstan_1_1_double_vector_view_3_01true_00_01true_01_4-members.html @@ -0,0 +1,114 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::DoubleVectorView< true, true > Member List
+
+
+ +

This is the complete list of members for stan::DoubleVectorView< true, true >, including all inherited members.

+ + + +
DoubleVectorView(size_t n)stan::DoubleVectorView< true, true >inline
operator[](size_t i)stan::DoubleVectorView< true, true >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1_double_vector_view_3_01true_00_01true_01_4.html b/doc/api/html/classstan_1_1_double_vector_view_3_01true_00_01true_01_4.html new file mode 100644 index 00000000000..7bcc9b07373 --- /dev/null +++ b/doc/api/html/classstan_1_1_double_vector_view_3_01true_00_01true_01_4.html @@ -0,0 +1,185 @@ + + + + + +Stan: stan::DoubleVectorView< true, true > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::DoubleVectorView< true, true > Class Template Reference
+
+
+ +

#include <traits.hpp>

+ + + + + + +

+Public Member Functions

 DoubleVectorView (size_t n)
 
double & operator[] (size_t i)
 
+

Detailed Description

+

template<>
+class stan::DoubleVectorView< true, true >

+ + +

Definition at line 356 of file traits.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::DoubleVectorView< true, true >::DoubleVectorView (size_t n)
+
+inline
+
+ +

Definition at line 360 of file traits.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
double& stan::DoubleVectorView< true, true >::operator[] (size_t i)
+
+inline
+
+ +

Definition at line 361 of file traits.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1_vector_view-members.html b/doc/api/html/classstan_1_1_vector_view-members.html new file mode 100644 index 00000000000..2885a363775 --- /dev/null +++ b/doc/api/html/classstan_1_1_vector_view-members.html @@ -0,0 +1,118 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::VectorView< T, is_array, throw_if_accessed > Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1_vector_view.html b/doc/api/html/classstan_1_1_vector_view.html new file mode 100644 index 00000000000..8b4472f2159 --- /dev/null +++ b/doc/api/html/classstan_1_1_vector_view.html @@ -0,0 +1,319 @@ + + + + + +Stan: stan::VectorView< T, is_array, throw_if_accessed > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::VectorView< T, is_array, throw_if_accessed > Class Template Reference
+
+
+ +

VectorView is a template metaprogram that takes its argument and allows it to be used like a vector. + More...

+ +

#include <traits.hpp>

+ + + + +

+Public Types

typedef scalar_type< T >::type scalar_t
 
+ + + + + + + + + + + + +

+Public Member Functions

 VectorView (scalar_t &c)
 
 VectorView (std::vector< scalar_t > &v)
 
template<int R, int C>
 VectorView (Eigen::Matrix< scalar_t, R, C > &m)
 
 VectorView (scalar_t *x)
 
scalar_toperator[] (int i)
 
+

Detailed Description

+

template<typename T, bool is_array = stan::is_vector_like<T>::value, bool throw_if_accessed = false>
+class stan::VectorView< T, is_array, throw_if_accessed >

+ +

VectorView is a template metaprogram that takes its argument and allows it to be used like a vector.

+

There are three template parameters

+
    +
  • T: Type of the thing to be wrapped. For example, double, var, vector<double>, etc.
  • +
  • is_array: Boolean variable indicating whether the underlying type is an array.
  • +
  • throw_if_accessed: Boolean variable indicating whether this instance should not be used and should throw if operator[] is used.
  • +
+

For a scalar value, it broadcasts the single value when using operator[].

+

For a vector, operator[] looks into the value passed in. Note: this is not safe. It is possible to read past the size of an array.

+

Uses: Read arguments to prob functions as vectors, even if scalars, so they can be read by common code (and scalars automatically broadcast up to behave like vectors) : VectorView of immutable const array of double* (no allocation)

+

Build up derivatives into common storage : VectorView of mutable shared array (no allocation because allocated on auto-diff arena memory)

+ +

Definition at line 253 of file traits.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T, bool is_array = stan::is_vector_like<T>::value, bool throw_if_accessed = false>
+ + + + +
typedef scalar_type<T>::type stan::VectorView< T, is_array, throw_if_accessed >::scalar_t
+
+ +

Definition at line 255 of file traits.hpp.

+ +
+
+

Constructor & Destructor Documentation

+ +
+
+
+template<typename T, bool is_array = stan::is_vector_like<T>::value, bool throw_if_accessed = false>
+ + + + + +
+ + + + + + + + +
stan::VectorView< T, is_array, throw_if_accessed >::VectorView (scalar_tc)
+
+inline
+
+ +

Definition at line 257 of file traits.hpp.

+ +
+
+ +
+
+
+template<typename T, bool is_array = stan::is_vector_like<T>::value, bool throw_if_accessed = false>
+ + + + + +
+ + + + + + + + +
stan::VectorView< T, is_array, throw_if_accessed >::VectorView (std::vector< scalar_t > & v)
+
+inline
+
+ +

Definition at line 259 of file traits.hpp.

+ +
+
+ +
+
+
+template<typename T, bool is_array = stan::is_vector_like<T>::value, bool throw_if_accessed = false>
+
+template<int R, int C>
+ + + + + +
+ + + + + + + + +
stan::VectorView< T, is_array, throw_if_accessed >::VectorView (Eigen::Matrix< scalar_t, R, C > & m)
+
+inline
+
+ +

Definition at line 262 of file traits.hpp.

+ +
+
+ +
+
+
+template<typename T, bool is_array = stan::is_vector_like<T>::value, bool throw_if_accessed = false>
+ + + + + +
+ + + + + + + + +
stan::VectorView< T, is_array, throw_if_accessed >::VectorView (scalar_tx)
+
+inline
+
+ +

Definition at line 264 of file traits.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename T, bool is_array = stan::is_vector_like<T>::value, bool throw_if_accessed = false>
+ + + + + +
+ + + + + + + + +
scalar_t& stan::VectorView< T, is_array, throw_if_accessed >::operator[] (int i)
+
+inline
+
+ +

Definition at line 266 of file traits.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1_vector_view_3_01const_01_t_00_01is__array_00_01throw__if__accessed_01_4-members.html b/doc/api/html/classstan_1_1_vector_view_3_01const_01_t_00_01is__array_00_01throw__if__accessed_01_4-members.html new file mode 100644 index 00000000000..99ff54ca9f5 --- /dev/null +++ b/doc/api/html/classstan_1_1_vector_view_3_01const_01_t_00_01is__array_00_01throw__if__accessed_01_4-members.html @@ -0,0 +1,118 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::VectorView< const T, is_array, throw_if_accessed > Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1_vector_view_3_01const_01_t_00_01is__array_00_01throw__if__accessed_01_4.html b/doc/api/html/classstan_1_1_vector_view_3_01const_01_t_00_01is__array_00_01throw__if__accessed_01_4.html new file mode 100644 index 00000000000..b42c9b3ab60 --- /dev/null +++ b/doc/api/html/classstan_1_1_vector_view_3_01const_01_t_00_01is__array_00_01throw__if__accessed_01_4.html @@ -0,0 +1,309 @@ + + + + + +Stan: stan::VectorView< const T, is_array, throw_if_accessed > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::VectorView< const T, is_array, throw_if_accessed > Class Template Reference
+
+
+ +

VectorView that has const correctness. + More...

+ +

#include <traits.hpp>

+ + + + +

+Public Types

typedef scalar_type< T >::type scalar_t
 
+ + + + + + + + + + + + +

+Public Member Functions

 VectorView (const scalar_t &c)
 
 VectorView (const scalar_t *x)
 
 VectorView (const std::vector< scalar_t > &v)
 
template<int R, int C>
 VectorView (const Eigen::Matrix< scalar_t, R, C > &m)
 
const scalar_toperator[] (int i) const
 
+

Detailed Description

+

template<typename T, bool is_array, bool throw_if_accessed>
+class stan::VectorView< const T, is_array, throw_if_accessed >

+ +

VectorView that has const correctness.

+ +

Definition at line 283 of file traits.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T , bool is_array, bool throw_if_accessed>
+ + + + +
typedef scalar_type<T>::type stan::VectorView< const T, is_array, throw_if_accessed >::scalar_t
+
+ +

Definition at line 285 of file traits.hpp.

+ +
+
+

Constructor & Destructor Documentation

+ +
+
+
+template<typename T , bool is_array, bool throw_if_accessed>
+ + + + + +
+ + + + + + + + +
stan::VectorView< const T, is_array, throw_if_accessed >::VectorView (const scalar_tc)
+
+inline
+
+ +

Definition at line 287 of file traits.hpp.

+ +
+
+ +
+
+
+template<typename T , bool is_array, bool throw_if_accessed>
+ + + + + +
+ + + + + + + + +
stan::VectorView< const T, is_array, throw_if_accessed >::VectorView (const scalar_tx)
+
+inline
+
+ +

Definition at line 289 of file traits.hpp.

+ +
+
+ +
+
+
+template<typename T , bool is_array, bool throw_if_accessed>
+ + + + + +
+ + + + + + + + +
stan::VectorView< const T, is_array, throw_if_accessed >::VectorView (const std::vector< scalar_t > & v)
+
+inline
+
+ +

Definition at line 291 of file traits.hpp.

+ +
+
+ +
+
+
+template<typename T , bool is_array, bool throw_if_accessed>
+
+template<int R, int C>
+ + + + + +
+ + + + + + + + +
stan::VectorView< const T, is_array, throw_if_accessed >::VectorView (const Eigen::Matrix< scalar_t, R, C > & m)
+
+inline
+
+ +

Definition at line 294 of file traits.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename T , bool is_array, bool throw_if_accessed>
+ + + + + +
+ + + + + + + + +
const scalar_t& stan::VectorView< const T, is_array, throw_if_accessed >::operator[] (int i) const
+
+inline
+
+ +

Definition at line 296 of file traits.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1_vector_view_3_01const_01double_00_01false_00_01false_01_4-members.html b/doc/api/html/classstan_1_1_vector_view_3_01const_01double_00_01false_00_01false_01_4-members.html new file mode 100644 index 00000000000..7d5119e250f --- /dev/null +++ b/doc/api/html/classstan_1_1_vector_view_3_01const_01double_00_01false_00_01false_01_4-members.html @@ -0,0 +1,114 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::VectorView< const double, false, false > Member List
+
+
+ +

This is the complete list of members for stan::VectorView< const double, false, false >, including all inherited members.

+ + + +
operator[](int) const stan::VectorView< const double, false, false >inline
VectorView(double x)stan::VectorView< const double, false, false >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1_vector_view_3_01const_01double_00_01false_00_01false_01_4.html b/doc/api/html/classstan_1_1_vector_view_3_01const_01double_00_01false_00_01false_01_4.html new file mode 100644 index 00000000000..bd69738d344 --- /dev/null +++ b/doc/api/html/classstan_1_1_vector_view_3_01const_01double_00_01false_00_01false_01_4.html @@ -0,0 +1,185 @@ + + + + + +Stan: stan::VectorView< const double, false, false > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::VectorView< const double, false, false > Class Template Reference
+
+
+ +

#include <traits.hpp>

+ + + + + + +

+Public Member Functions

 VectorView (double x)
 
double operator[] (int) const
 
+

Detailed Description

+

template<>
+class stan::VectorView< const double, false, false >

+ + +

Definition at line 310 of file traits.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::VectorView< const double, false, false >::VectorView (double x)
+
+inline
+
+ +

Definition at line 312 of file traits.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
double stan::VectorView< const double, false, false >::operator[] (int ) const
+
+inline
+
+ +

Definition at line 313 of file traits.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1chainable-members.html b/doc/api/html/classstan_1_1agrad_1_1chainable-members.html new file mode 100644 index 00000000000..e785c36f0cc --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1chainable-members.html @@ -0,0 +1,119 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::agrad::chainable Member List
+
+
+ +

This is the complete list of members for stan::agrad::chainable, including all inherited members.

+ + + + + + + + +
chain()stan::agrad::chainableinlinevirtual
chainable()stan::agrad::chainableinline
init_dependent()stan::agrad::chainableinlinevirtual
operator delete(void *)stan::agrad::chainableinlinestatic
operator new(size_t nbytes)stan::agrad::chainableinlinestatic
set_zero_adjoint()stan::agrad::chainableinlinevirtual
~chainable()stan::agrad::chainableinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1chainable.html b/doc/api/html/classstan_1_1agrad_1_1chainable.html new file mode 100644 index 00000000000..471241a2490 --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1chainable.html @@ -0,0 +1,399 @@ + + + + + +Stan: stan::agrad::chainable Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::agrad::chainable Class Reference
+
+
+ +

Abstract base class for variable implementations that handles memory management and applying the chain rule. + More...

+ +

#include <chainable.hpp>

+
+Inheritance diagram for stan::agrad::chainable:
+
+
+ + +stan::agrad::vari +stan::agrad::op_ddv_vari +stan::agrad::op_ddv_vari +stan::agrad::op_dv_vari +stan::agrad::op_dv_vari +stan::agrad::op_dvd_vari +stan::agrad::op_dvd_vari +stan::agrad::op_dvv_vari +stan::agrad::op_dvv_vari +stan::agrad::op_matrix_vari +stan::agrad::op_v_vari +stan::agrad::op_v_vari +stan::agrad::op_vd_vari +stan::agrad::op_vd_vari +stan::agrad::op_vdd_vari +stan::agrad::op_vdd_vari +stan::agrad::op_vdv_vari +stan::agrad::op_vdv_vari +stan::agrad::op_vector_vari +stan::agrad::op_vv_vari +stan::agrad::op_vv_vari +stan::agrad::op_vvd_vari +stan::agrad::op_vvd_vari +stan::agrad::op_vvv_vari +stan::agrad::op_vvv_vari +stan::agrad::partials_vari +stan::agrad::stored_gradient_vari + +
+ + + + + + + + + + + + + + + + + +

+Public Member Functions

 chainable ()
 Construct a chainable object.
 
virtual ~chainable ()
 Chainables are not destructible and should go on the function call stack or be allocated with operator new.
 
virtual void chain ()
 Apply the chain rule to this variable based on the variables on which it depends.
 
virtual void init_dependent ()
 Initialize this chainable's adjoint value to make it the dependent variable in a gradient calculation.
 
virtual void set_zero_adjoint ()
 Set the value of the adjoint for this chainable to its initial value.
 
+ + + + + + + +

+Static Public Member Functions

static void * operator new (size_t nbytes)
 Allocate memory from the underlying memory pool.
 
static void operator delete (void *)
 Delete a pointer from the underlying memory pool.
 
+

Detailed Description

+

Abstract base class for variable implementations that handles memory management and applying the chain rule.

+ +

Definition at line 14 of file chainable.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::agrad::chainable::chainable ()
+
+inline
+
+ +

Construct a chainable object.

+

The implementation in this abstract base class is a no-op.

+ +

Definition at line 22 of file chainable.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
virtual stan::agrad::chainable::~chainable ()
+
+inlinevirtual
+
+ +

Chainables are not destructible and should go on the function call stack or be allocated with operator new.

+ +

Definition at line 28 of file chainable.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + +
virtual void stan::agrad::chainable::chain ()
+
+inlinevirtual
+
+ +

Apply the chain rule to this variable based on the variables on which it depends.

+

The base implementation in this class is a no-op.

+ +

Reimplemented in stan::agrad::vari, stan::agrad::stored_gradient_vari, and stan::agrad::partials_vari.

+ +

Definition at line 37 of file chainable.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
virtual void stan::agrad::chainable::init_dependent ()
+
+inlinevirtual
+
+ +

Initialize this chainable's adjoint value to make it the dependent variable in a gradient calculation.

+ +

Reimplemented in stan::agrad::vari.

+ +

Definition at line 44 of file chainable.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
static void stan::agrad::chainable::operator delete (void * )
+
+inlinestatic
+
+ +

Delete a pointer from the underlying memory pool.

+

This no-op implementation enables a subclass to throw exceptions in its constructor. An exception thrown in the constructor of a subclass will result in an error being raised, which is in turn caught and calls delete().

+

See the discussion of "plugging the memory leak" in: http://www.parashift.com/c++-faq/memory-pools.html

+ +

Definition at line 77 of file chainable.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
static void* stan::agrad::chainable::operator new (size_t nbytes)
+
+inlinestatic
+
+ +

Allocate memory from the underlying memory pool.

+

This memory is is managed by the gradient program and will be recovered as a whole. Classes should not be allocated with this operator if they have non-trivial destructors.

+
Parameters
+ + +
nbytesNumber of bytes to allocate.
+
+
+
Returns
Pointer to allocated bytes.
+ +

Definition at line 63 of file chainable.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
virtual void stan::agrad::chainable::set_zero_adjoint ()
+
+inlinevirtual
+
+ +

Set the value of the adjoint for this chainable to its initial value.

+ +

Reimplemented in stan::agrad::vari.

+ +

Definition at line 51 of file chainable.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1chainable.png b/doc/api/html/classstan_1_1agrad_1_1chainable.png new file mode 100644 index 0000000000000000000000000000000000000000..17afc8097fbcf32d567a0140023cd7f395ac8fdc GIT binary patch literal 12320 zcmeHN3pkW{`<~iu+e4*xrKs4BzA1+yY{}R*awcOC!bWIf%sL-uw6&X!WMfdoY?@(m z48u52C6q&AjKhpW5i$%T#$jgg|IM&{*mn23uJ3SN`)^&B%Zzu7ci#Jb?&rSm=ec^y zSZDpGQlCN~ko9`HT5t$t6%GRV2=eg<;5W_&#(Ln#)>DQE?fLn6@bL98*C+DP&)|{h z`@w?;Yp!<4fTtgO!;Q@#;6=hOdJRGe0#VG?(>jjuU&T%w@?`1et%*i_I6D92a^sqN zd%x$j4L{28(mk7|$WMr2v8cC=Q)$c(IC0aT%^$z9`qVYuRsT3ifQavgL&C-y;pJSJ zZUyT(JJb>JBwp&SH7_Jb3|5`q2(6yKY#bMmI_P2LGaLU=wx&YE*$nym)ChxW`}9Yr zWu_p74War)&T7HDx|fIf*Fv~f1;j*Rx@5xmDrrs;Tq4tHb6bXL3lo`FMQ%H9{u54? z(b{Ha@x8pOqhjEfPVqTKUfrw2CbJvLUNf`u3`=h0s-aZK3{R`I{)QvCAh`Pg(uz@# zBfrQe+b-hw zz##=kI@}@Hs3o6t6BJVUllVmkfd({{HaIZ?`S9Z1+pAW8y<^v!UnB;+G9b8JaL5G@ zkIxT4V!-P>wLba!5ID4T#RdEIZL~i9_Yc2-7H17%2a81l^NF-p}Zi4Bm$~k^_I5A7iD1e?gM&O;@}(cl1WG z^|ckBZ8``JK7QAZi;(Yd%3niBCkT+{p5W`7FT%mKl~*u!So6#0;NoBZ$3O4Z|K!DA zhHNiUbS}~t?fdiLzlC917b;742`D{()8pI}-)omP_hZfd+CF%bXwPCT-+1XbNVYxg z1-H8I$hCap47slfX-d8D(pjJ~LLbd2t_al|{Gg=LmriTpz4=P@07^a)ReG~9*3&C` zlGp{qY^A{R46{E$+cIkW(+e^1{?L;?aVBo|j*3>P6w-Q(s|x!fF6H=oDz7X}_XxgW zz;cX}jJBb>GnBDf`r#~9JT}!Wwaovn3$c={?x&x?LxhRbW0{+=0fuM}X~3E> z>PvNctG=pgAS=>Cbe7(i;&fpl*|z$OZg`+L4u?Wky@34}D`gp2Lf%?>C)n*L4i%5E zS4}(F9nj|1gY$OK3cGMiAMMW#NcO&RsZSYUVIB)!-bU zw@)}cmGyQZXOb#T+r*pLC?ra7(-^9W0+qhY3pfVLB9rK!6n%b+v zuew6j)R6WpHZ9a+NV#?*p3_3iyhaIQ$~s}sBm8C_PpV8t`2>bDo>MGn8+4IU&7Ab^ z^f27`OfYt{m?E#hoSmZ4t3x1@+{Xv~YJ3^tYJnEkh9zF9t!CFD7 ze^z*ig~EINq#$wt+@i;^C&O46*r}Sqs19V{8P8Iz(dAZ|xPgN$vHi4IgHXxY2OUi@ zXQQzOboJmQ9E@TUxC}YaRot7(5jH%-E9WeBs!C=V*qCZ6C~Sye*}}+}2zjR+J;|yQ znRIf=jN&#SXoRQ*&~y|QL7Ue@ns&G47O!tU!jf zy>zuRF_V}V(P|?{sQW>?rZ{!ojk-%0GUQoo^1j~8p8mF;=cJK0SJ|$^dxs_@fb7Uj z>0FN;4i4`K^`(!RYuC&K!>D1QTQJNtUs}@GZn!mqGBcs>q|UC~*4edbY6LeHEI)#? zIRr;oc4TpC9Rn}xX#7(Xwzh`c;J4kCpvGFZlMM(YSncfd>&B+D8*U^QzZgp>4d#dP zZG4`V9irRr()M|p^Q9LYa(zshZNTjoiLE7#Bg8}>sIrm|IJKpSPrrr~n*7@+{0T_E zcQ{UeusACy2!g%Us&9$`(qo~iEo!OW-Nf5K9*!mVT`L(MMN2@_bf!(AY5d@L9Bpqp zZK80G-%{-^AGbl7_r32NVt9(>XVLkxf-q6k*;K+px?%#hC&U!QK2xgc zNl8oTv$UK75``8IT3do+_=&s4wXy}-IdK^@o8~L!`SHGL(>devo-zz`s^w|WcD~&we+1n`2Ki=zPpTXbK~veS?Gyfcs?z)9B*8EUkjHq3 z82hz2eRLxosw@yu0Oe-=VUHcavP%uKr!+?!j^)$)$XeIV$ASS*3 z-;2qEA~EUS_!a*_S{W3$RQ#x(>FhrI?mln5A<*dBmo>WjrlD6za>%-QO~2;sQntGB zDb(~3OtJPLD{LbmlZO@oS%MEQ*Xp*-S}W*h1_kC%XaldxuM;1kC~2J z4Ta1*GF#g;Tb?Rha8wS2*91lv;qKuhG&nK_B17jfuxRL#e$MSW*M6spzhAcRtgjIx zoZ=5ert4_f4rpyS_SnT6xfkqP4XJOe%j+nMMCI6QNq+dUpl#Le6>#XMe1$vL#C}j1 zQWprR63JUervO{FoDr{W4*d)UN60MnIn1&?Cw3xeTc%<*(w0D))7+rt{|_g+EC4}% zLwPIBYODJ=SCKvdo*P}SjE`Q;xhR9OPn*B^d(nw~KM@XD{Q$E<@%>6#bcm87K7Ll)Ame{ffJ4&b%i(u`B z6=EV1of3x^yqgi!=&}@+n;x#WP+Jp=wN(x!YI7Be%ti=h{#0RB(w}@f1$Kr5QjniS zZEbXXX;>1tmBBoZ2{0N0anHQRmyb?BMS+&P2d6CQ*`x0gvP15{KqlhuDc1r@YOUZr zaBXY<(yr}D>Fbfl)g{Y(_UG-uXRlu7v*U@o!>^jqV;MK ztvNhSf{yV_9R_ISFw-5zjU~ledW?%U0~Hb}f=ltuGPpivFiG8kdz~12Kt@{MJAB>H z6cZ25;mG7S-5VZ$7om8)_oONJW8ejPPA46KLe@^_fW$I#DFF%v2~}2@CUpwar2T8Y zgmlQRNSppwrB-D?6sjQ&poUzDr1B#x#nL^vF$jSC8#}K?3ZuHq0?_68!M_0Ap9^&V zhyF`-zlwp5#22X!R6Qz@wF72SV_Dam+Hl4suVK3NXS5l^y0|Xn3{yhq?2Tl`a~GvO z%C+eWOh}U1vL*B+S3!nRUKN|W!NYVLujK;6dG3S@LvBL?BFYnnZ^-U>qTOAP)=72| zXoAd`|H`;sFKEnxVp-Xrs3e_Hndo@{v?OWD0l}M_cCSnu@+Vb}q3tP6ZVawCnPN)i z>erC<2qbJmb^DH6$-Kkh96X1AEZ=eIrIh{l>WF04Cg9a7bB+P8wt?da+Lp{;+pBSs z&-QfAOsR#7({~F<;&cqm2&7qbP-RgiOVcb+WfhD{0WzaIz1zwsR4n?<=JDx4%!ezWsht#$ofzi(IkgD5?a73A+Q&oU+RI8TwO@@q8p1!lUbKADbv|W9{ zFuZ+bMR+;NyaYM=qrev6#th~q<|a<|M7WRsRIl!I?6i$v4NC6!d^WW#f|nT@au!tE z0XPCbfIY91O2UQ$YsZ;3vMZmhn9VGH)pe5v66WGpr+)_3Ry}POxzkmPD;*8T|(*G7{onn*ykP*@o1M*r?vZf=XHN< zvNfd0>xZOBt>?FnSv8d=W)%#RI7I5I5qQATA z61#(7W|Om6yB-y*kSa%20EW;!||qDzR|pL#XaN19~9 zw(+)5`&m2lKQn9AUMlP2rVo1D`h)2WMaY*)IAk_ZQ%U?gI}($5I{-UA>{SbxnG~C% zu%dz-(}evy%JFzV0kXZ5W(sfX2+6v?9HUWaI7A37*{XZPHEl}mnYM6jEwSp}hrZ+7m%cK|yT73H1 z!pEUkYeiFlf_KJ}BD$P)hp9zbdELOOgX0G*n`$si z)bKWoFf94DFdxLr=3hkMQZTm4vw>$5CYH?JM)^kv&$``K5~wG@Q!+v315t-+909&y zBQ%^WW>C~MT)X>jape~v4)S@J^U4zrN$Q=?2SZbnzv$4^Bt|$iMa#o&IsRansPUvh z*R-r*t^N_)-z**g49PCj))J{kJbCj`P5_+O;XY`~CFhqPyIv1ko!CMui5di6!0N}g zbA<{!o`nPmr`*34mX0pgs-&E+R7;iM&p@7RzP;!*(;`1%^4h#C$hPnuP<5oD-LMt% zP-f9iXG|ItD9arSP43CEWD9y8eRl_xwhvf4l(dWAxiA(DuuE;u7M}0NS6qWVwyTAu z=>RRVx%!Q8!2KXnh?UmgSpALFzq{4*FD)auZ0Sr43CUZQ`CADy|DxsL6+<~#WgPf6 zOKKi#gUmi+13R|M+{9+6wzn;VobPQ`Q&^dFU)O31w=>G>)Iuh5u5`CkuP7B!z_*oG z+2tCe7hN02(LhSQyT7e%O8*bHNSNxtYg-*A^)GnsO7^GJV<~F>&0d+9^$pC{%)<%3 zm{}(Cyszu}wJrfMMnb)j_nw6QNw(g8bF=l!7J$zAfYAR{*3tzaXJiA1UWX5xeY--k zd=bG2+A9$x)c$5ybe)f@v`BD$t)s`T<09TQsY!SkDUTcuPH=SWKCp9{bz31u7Mxq- zFY)Sq79b4REVA5PFP2$uE*gEeJyT`-?Y{SBg+wI(XIggAREi6}dl*tL*B*1xEZB?~T8 zRh3(Q^G8!{jRW#2DwY))$1~wFT3~t>|IYauh0=(D((FJtJNBNeYXRla*)!)1)Z-5_ zG0DXZsd~SsJZAE@C;ZN2O*-!FirtAl>5E%hk$7Ra-`V#C7|0m349Z_P(QR$ST!(ej ztIc+H`xmBaz^K(pHSgyhM-WI^?_AUh3EI{f_g=Z{BFbwe-)*q_{L8|z+7D~ta|0t_ zTNMd6wpZjXPb1ggiOioH8j3tydEaHep>A*I$!umnA%kD{9F?`0kX*KnWl&QDmP1V6 zf~4%?>H)nXm77*@Hv3>Uh32g3Y_=sRi_sof&XN|kIOp7`+>8i~3nu!Su|oat+&CvK=0`O=U0+mkek-K4yhzc z$H^^eeDxZWvLmD3na}37th;LoO6?7qNe+m}$x#$9(3 zI|XQiB5qiFNFZ}`fa}X3SL>lpk5H(zo@^uNwxM}%zEnxY(Z^tCLDhz)N^mpo=)5<2 zy7m!@?lxCT6wSX2Z6|C-2Yq|n)FJ7U`B+LT++wX`k;7gm$8k&DRsNDeq7`O!hTY~N zbtjje#KaMD_Sm$vvHpa8?sS6iQnBI%=)ro*U$>R<=^BCm#z5!o-K3rb+-6rB$NaX4> W8Xxf + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::agrad::chainable_alloc Member List
+
+
+ +

This is the complete list of members for stan::agrad::chainable_alloc, including all inherited members.

+ + + +
chainable_alloc()stan::agrad::chainable_allocinline
~chainable_alloc()stan::agrad::chainable_allocinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1chainable__alloc.html b/doc/api/html/classstan_1_1agrad_1_1chainable__alloc.html new file mode 100644 index 00000000000..9f4e24e2508 --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1chainable__alloc.html @@ -0,0 +1,184 @@ + + + + + +Stan: stan::agrad::chainable_alloc Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::agrad::chainable_alloc Class Reference
+
+
+ +

A chainable_alloc is an object which is constructed and destructed normally but the memory lifespan is managed along with the arena allocator for the gradient calculation. + More...

+ +

#include <var_stack.hpp>

+ + + + + + +

+Public Member Functions

 chainable_alloc ()
 
virtual ~chainable_alloc ()
 
+

Detailed Description

+

A chainable_alloc is an object which is constructed and destructed normally but the memory lifespan is managed along with the arena allocator for the gradient calculation.

+

A chainable_alloc should never be created on the stack, only with a new call.

+ +

Definition at line 26 of file var_stack.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::agrad::chainable_alloc::chainable_alloc ()
+
+inline
+
+ +

Definition at line 28 of file var_stack.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
virtual stan::agrad::chainable_alloc::~chainable_alloc ()
+
+inlinevirtual
+
+ +

Definition at line 31 of file var_stack.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1op__ddv__vari-members.html b/doc/api/html/classstan_1_1agrad_1_1op__ddv__vari-members.html new file mode 100644 index 00000000000..c05193d1a86 --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1op__ddv__vari-members.html @@ -0,0 +1,131 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::agrad::op_ddv_vari Member List
+
+
+ +

This is the complete list of members for stan::agrad::op_ddv_vari, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + +
ad_stan::agrad::op_ddv_variprotected
adj_stan::agrad::vari
bd_stan::agrad::op_ddv_variprotected
chain()stan::agrad::variinlinevirtual
chainable()stan::agrad::chainableinline
cvi_stan::agrad::op_ddv_variprotected
free_memory()stan::agrad::variinlinestatic
init_dependent()stan::agrad::variinlinevirtual
op_ddv_vari(double f, double a, double b, vari *cvi)stan::agrad::op_ddv_variinline
operator delete(void *)stan::agrad::chainableinlinestatic
operator new(size_t nbytes)stan::agrad::variinlinestatic
recover_memory()stan::agrad::variinlinestatic
set_zero_adjoint()stan::agrad::variinlinevirtual
val_stan::agrad::vari
vari(const double x)stan::agrad::variinline
vari(const double x)stan::agrad::variinline
vari(const double x, bool stacked)stan::agrad::variinline
~chainable()stan::agrad::chainableinlinevirtual
~vari()stan::agrad::variinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1op__ddv__vari.html b/doc/api/html/classstan_1_1agrad_1_1op__ddv__vari.html new file mode 100644 index 00000000000..cf88c3f1ffc --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1op__ddv__vari.html @@ -0,0 +1,312 @@ + + + + + +Stan: stan::agrad::op_ddv_vari Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::agrad::op_ddv_vari Class Reference
+
+
+ +

#include <ddv_vari.hpp>

+
+Inheritance diagram for stan::agrad::op_ddv_vari:
+
+
+ + +stan::agrad::vari +stan::agrad::vari +stan::agrad::chainable +stan::agrad::chainable + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 op_ddv_vari (double f, double a, double b, vari *cvi)
 
- Public Member Functions inherited from stan::agrad::vari
 vari (const double x)
 Construct a variable implementation from a value.
 
virtual void chain ()
 Apply the chain rule to this variable based on the variables on which it depends.
 
 vari (const double x)
 Construct a variable implementation from a value.
 
 vari (const double x, bool stacked)
 
virtual ~vari ()
 Throw an illegal argument exception.
 
virtual void init_dependent ()
 Initialize the adjoint for this (dependent) variable to 1.
 
virtual void set_zero_adjoint ()
 Set the adjoint value of this variable to 0.
 
- Public Member Functions inherited from stan::agrad::chainable
 chainable ()
 Construct a chainable object.
 
virtual ~chainable ()
 Chainables are not destructible and should go on the function call stack or be allocated with operator new.
 
+ + + + + + + +

+Protected Attributes

double ad_
 
double bd_
 
varicvi_
 
+ + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::agrad::vari
static void * operator new (size_t nbytes)
 Allocate memory from the underlying memory pool.
 
static void recover_memory ()
 Recover memory used for all variables for reuse.
 
static void free_memory ()
 Return all memory used for gradients back to the system.
 
- Public Attributes inherited from stan::agrad::vari
const double val_
 The value of this variable.
 
double adj_
 The adjoint of this variable, which is the partial derivative of this variable with respect to the root variable.
 
+

Detailed Description

+
+

Definition at line 9 of file ddv_vari.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::agrad::op_ddv_vari::op_ddv_vari (double f,
double a,
double b,
varicvi 
)
+
+inline
+
+ +

Definition at line 15 of file ddv_vari.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
double stan::agrad::op_ddv_vari::ad_
+
+protected
+
+ +

Definition at line 11 of file ddv_vari.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
double stan::agrad::op_ddv_vari::bd_
+
+protected
+
+ +

Definition at line 12 of file ddv_vari.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
vari* stan::agrad::op_ddv_vari::cvi_
+
+protected
+
+ +

Definition at line 13 of file ddv_vari.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1op__ddv__vari.png b/doc/api/html/classstan_1_1agrad_1_1op__ddv__vari.png new file mode 100644 index 0000000000000000000000000000000000000000..c87ce0fe4098fc3527ac596653904c7731df710a GIT binary patch literal 1326 zcmeAS@N?(olHy`uVBq!ia0y~yV6*_TJ2;quq>BvuOdur@;1lBd|Nnm=^TnI5rTvE{ z09jys;J^Xa&O7ozE=Ng_UoZnu5eQs86=KA|z_QoV#WAFU@$KB#lQ!81u+8?H`n~?7 z{Ct@wOHSzMeY|^fQ>mm=MUL?k{iRca6npAHq{!7*GrEG;_K7T)QaHMj&7*J?W6+$e z2K7f$R~PH(&yrui><#zr?YD%(9S__;wbW{{S>Y;UzOL+Bjc0#ci!1vt;eU_+*7tvR zHkrtp#aPL#<#Mi_@z}O-D@)9iUGew!@4B63T*>>t^s=tEzg}$b4VnM*c4RTFD?S_c z^3^QQ+!gxmzSn-_EDBZBSl8DOJ=Z|z{8iJ>w>GRPFX~k`OMf>j^Cp+|+9>A(UpJTU zYp->7I3d@%rZNR!r|~owgO*)_tqYw7yWbZt}dsaMnBTTI$TD%$9$A zm6tDNzBV<}C}-P;-+yxhJKnD{Wr-tn7O|9sf>ySL$>U%+1l`~1+W{F5GqFfXyV%Ao0I>d+O;d!b8v>6BkHIzS|Y zMYpuW*(*{8M;T?Fm#w}Nvz9Sf=0M@Ch|<}sO%uA9IVR3#c4!b`7f?9L$l_7Rz!)S$ zRqlS(byI@0mi%jQ-Dy-w-dBNfv0Ka^1{R95>`|NkN?T8S`LC|p zLSO4z<9%Drch~o*zh{42U7r^z#eDCje<^e5{33@tp^W84f9sb&ym~im_Q~uY>vzB3 zv_Y`rJF_zuve)eX@Sj`B$eCCpSM0xT?$7xm)dl^<0BBk3-j0uFY@kO}ree z-o0Dr!N1Mr#g_i{^W0)LOwI0mWz3h$cb&!N7st(WroWe}EzPvAb-Rgsh&gy3> zCT=(HoqcVSiB0Nn_KOiV`$OyPAJnO@c((%6SDEK%zf)#B z|HEJDft{8NL_}5I_SI$!OFsZg4>_$o?m#|EloQ)Xclkv$DU{{N$>mjR{brrT-V~5xL@5a?8F`u$!}HR zcSX$4eOj!{>io`af;QRX^?xX)&&UjpY;0tuFrmq^tUGYVlFV7$4M-IbhzA hJ!=^-PJ(~(Z&k0k^D~ + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::agrad::op_dv_vari Member List
+
+
+ +

This is the complete list of members for stan::agrad::op_dv_vari, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
ad_stan::agrad::op_dv_variprotected
adj_stan::agrad::vari
bvi_stan::agrad::op_dv_variprotected
chain()stan::agrad::variinlinevirtual
chainable()stan::agrad::chainableinline
free_memory()stan::agrad::variinlinestatic
init_dependent()stan::agrad::variinlinevirtual
op_dv_vari(double f, double a, vari *bvi)stan::agrad::op_dv_variinline
operator delete(void *)stan::agrad::chainableinlinestatic
operator new(size_t nbytes)stan::agrad::variinlinestatic
recover_memory()stan::agrad::variinlinestatic
set_zero_adjoint()stan::agrad::variinlinevirtual
val_stan::agrad::vari
vari(const double x)stan::agrad::variinline
vari(const double x)stan::agrad::variinline
vari(const double x, bool stacked)stan::agrad::variinline
~chainable()stan::agrad::chainableinlinevirtual
~vari()stan::agrad::variinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1op__dv__vari.html b/doc/api/html/classstan_1_1agrad_1_1op__dv__vari.html new file mode 100644 index 00000000000..fa2a7e5687e --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1op__dv__vari.html @@ -0,0 +1,282 @@ + + + + + +Stan: stan::agrad::op_dv_vari Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::agrad::op_dv_vari Class Reference
+
+
+ +

#include <dv_vari.hpp>

+
+Inheritance diagram for stan::agrad::op_dv_vari:
+
+
+ + +stan::agrad::vari +stan::agrad::vari +stan::agrad::chainable +stan::agrad::chainable + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 op_dv_vari (double f, double a, vari *bvi)
 
- Public Member Functions inherited from stan::agrad::vari
 vari (const double x)
 Construct a variable implementation from a value.
 
virtual void chain ()
 Apply the chain rule to this variable based on the variables on which it depends.
 
 vari (const double x)
 Construct a variable implementation from a value.
 
 vari (const double x, bool stacked)
 
virtual ~vari ()
 Throw an illegal argument exception.
 
virtual void init_dependent ()
 Initialize the adjoint for this (dependent) variable to 1.
 
virtual void set_zero_adjoint ()
 Set the adjoint value of this variable to 0.
 
- Public Member Functions inherited from stan::agrad::chainable
 chainable ()
 Construct a chainable object.
 
virtual ~chainable ()
 Chainables are not destructible and should go on the function call stack or be allocated with operator new.
 
+ + + + + +

+Protected Attributes

double ad_
 
varibvi_
 
+ + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::agrad::vari
static void * operator new (size_t nbytes)
 Allocate memory from the underlying memory pool.
 
static void recover_memory ()
 Recover memory used for all variables for reuse.
 
static void free_memory ()
 Return all memory used for gradients back to the system.
 
- Public Attributes inherited from stan::agrad::vari
const double val_
 The value of this variable.
 
double adj_
 The adjoint of this variable, which is the partial derivative of this variable with respect to the root variable.
 
+

Detailed Description

+
+

Definition at line 9 of file dv_vari.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
stan::agrad::op_dv_vari::op_dv_vari (double f,
double a,
varibvi 
)
+
+inline
+
+ +

Definition at line 14 of file dv_vari.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
double stan::agrad::op_dv_vari::ad_
+
+protected
+
+ +

Definition at line 11 of file dv_vari.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
vari* stan::agrad::op_dv_vari::bvi_
+
+protected
+
+ +

Definition at line 12 of file dv_vari.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1op__dv__vari.png b/doc/api/html/classstan_1_1agrad_1_1op__dv__vari.png new file mode 100644 index 0000000000000000000000000000000000000000..2853fd9e60c68a8d3d4ac5d3554e8b5d78861f41 GIT binary patch literal 1314 zcmeAS@N?(olHy`uVBq!ia0y~yVAKM#J2;quWV(Bp50H`w@CkAK|NlRb`Qpvj(*8pe zfGjXRaNq!I=N)+Sh~+e?fI`P z&u2cl;ZmPu@8`FX)B0vJ)Y_9nJFw|h@3&5nGpaC5QfLz@e4Ij1lEtn$1uE_Suuq&GL7y=L3=R{eM8 z>9S4ljY~D9!%DvHQVngDf72lEAGU3$N^H>fWhz@AyV6f|C(l>a z+27oJeqENgXVyvX*srfo)?Iiu=}Yt;Ge*^y+c84NGt^77)Mc60(kWI<3pkY>rk70D z31PJ8NnXEhm$%p|2AO3xb9cSci(J8E(3vWGKq-VVqD70LJAgGoa211&lW2qM3Z@Ml zp$uXRxhRl)Bp)y}$jkO(;U-+s$nAbr!Snp57fala&kOqcEJdC}#q;}*HCmp#j<>E# z-1Tn5e&6z$h$#G)V*Gkx>H?Lyk5>J1+2r2%Z~xJ6@EA;tUDdvJ=PaKC{VKaTN?zZ1 zvnuq_qB#E3`>r^vt~?h0^L+BVl6XT?RsgdzS*3H_r7Hp zpG_(`x!Bs{lJF1VfJu6pv)){F2z8r|7AhaWi!7?xB zIW;_cX&z%ek1fi$4$Oa=|KF-1jl{V9!5+eU*x(C`!}5}8x~NHGpWD^`rnvb}V#;KN zfhlF5<5h#d#&7b2EC1c#KNr93``3urQ|(iiuT!4J{L?r6TDQ*hKSH6W*YEthEHWxK z`qb@>Yf8#qz5R9bN6^)?H_UwxJYD>uY{u;0`qtCVvBZdXv;AJjxx=^XvA=fK>oe9o z)fuYuSNz`oRO$Y*R~9$lS)Hix4Lv)3UFdVZF0~V0M>lNVx@y{n>HEr<)TXjqSQ?9VU1EJ&}-uu7xudsU4#o+#}EmHjLqQib&2i|@S-}UO_ t`kr-674oQw{NmPCi4tvn3>nAj|7w;?EMJn=4J^ + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::agrad::op_dvd_vari Member List
+
+
+ +

This is the complete list of members for stan::agrad::op_dvd_vari, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + +
ad_stan::agrad::op_dvd_variprotected
adj_stan::agrad::vari
bvi_stan::agrad::op_dvd_variprotected
cd_stan::agrad::op_dvd_variprotected
chain()stan::agrad::variinlinevirtual
chainable()stan::agrad::chainableinline
free_memory()stan::agrad::variinlinestatic
init_dependent()stan::agrad::variinlinevirtual
op_dvd_vari(double f, double a, vari *bvi, double c)stan::agrad::op_dvd_variinline
operator delete(void *)stan::agrad::chainableinlinestatic
operator new(size_t nbytes)stan::agrad::variinlinestatic
recover_memory()stan::agrad::variinlinestatic
set_zero_adjoint()stan::agrad::variinlinevirtual
val_stan::agrad::vari
vari(const double x)stan::agrad::variinline
vari(const double x)stan::agrad::variinline
vari(const double x, bool stacked)stan::agrad::variinline
~chainable()stan::agrad::chainableinlinevirtual
~vari()stan::agrad::variinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1op__dvd__vari.html b/doc/api/html/classstan_1_1agrad_1_1op__dvd__vari.html new file mode 100644 index 00000000000..2eeb01c5e75 --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1op__dvd__vari.html @@ -0,0 +1,312 @@ + + + + + +Stan: stan::agrad::op_dvd_vari Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::agrad::op_dvd_vari Class Reference
+
+
+ +

#include <dvd_vari.hpp>

+
+Inheritance diagram for stan::agrad::op_dvd_vari:
+
+
+ + +stan::agrad::vari +stan::agrad::vari +stan::agrad::chainable +stan::agrad::chainable + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 op_dvd_vari (double f, double a, vari *bvi, double c)
 
- Public Member Functions inherited from stan::agrad::vari
 vari (const double x)
 Construct a variable implementation from a value.
 
virtual void chain ()
 Apply the chain rule to this variable based on the variables on which it depends.
 
 vari (const double x)
 Construct a variable implementation from a value.
 
 vari (const double x, bool stacked)
 
virtual ~vari ()
 Throw an illegal argument exception.
 
virtual void init_dependent ()
 Initialize the adjoint for this (dependent) variable to 1.
 
virtual void set_zero_adjoint ()
 Set the adjoint value of this variable to 0.
 
- Public Member Functions inherited from stan::agrad::chainable
 chainable ()
 Construct a chainable object.
 
virtual ~chainable ()
 Chainables are not destructible and should go on the function call stack or be allocated with operator new.
 
+ + + + + + + +

+Protected Attributes

double ad_
 
varibvi_
 
double cd_
 
+ + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::agrad::vari
static void * operator new (size_t nbytes)
 Allocate memory from the underlying memory pool.
 
static void recover_memory ()
 Recover memory used for all variables for reuse.
 
static void free_memory ()
 Return all memory used for gradients back to the system.
 
- Public Attributes inherited from stan::agrad::vari
const double val_
 The value of this variable.
 
double adj_
 The adjoint of this variable, which is the partial derivative of this variable with respect to the root variable.
 
+

Detailed Description

+
+

Definition at line 9 of file dvd_vari.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::agrad::op_dvd_vari::op_dvd_vari (double f,
double a,
varibvi,
double c 
)
+
+inline
+
+ +

Definition at line 15 of file dvd_vari.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
double stan::agrad::op_dvd_vari::ad_
+
+protected
+
+ +

Definition at line 11 of file dvd_vari.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
vari* stan::agrad::op_dvd_vari::bvi_
+
+protected
+
+ +

Definition at line 12 of file dvd_vari.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
double stan::agrad::op_dvd_vari::cd_
+
+protected
+
+ +

Definition at line 13 of file dvd_vari.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1op__dvd__vari.png b/doc/api/html/classstan_1_1agrad_1_1op__dvd__vari.png new file mode 100644 index 0000000000000000000000000000000000000000..c1ceca0511a24cda2c5b79bdec182fd644f1fefe GIT binary patch literal 1331 zcmeAS@N?(olHy`uVBq!ia0y~yV6*_TJ2;quq>BvuOdur@;1lBd|Nnm=^TnI5rTvE{ z09jys;J^Xa&O7ozE=Ng_UoZnu5eQs86=KA|z;ejb#WAFU@$KBVlQvliu+8?H`n~?- zabMpcrVSRjx+v&NR3rz4aJw=lF{@tb?6G_o$x4xd5OhU z2L2jB=%Mae3{#q-s z+WT|nbky}SC3WM=59MCt{x@Y^yn7Hj;oxHKgGyyUekNJO8vS?^5-+P##h&FxV%c2CC0w` zHS3-|2~%HR+;a88t0|{zGc&T;cx>HnM4m%eqlz0?7*?bBaj_*8{bvtG?W3Y@v#~m34rX>~)44Qlj4qeO~ z6CP2O`$xBM>6A+fZ`pOQN2Gq&>yZ9WZx-womJ|Kn*f9U((qBFO-NCiT_U(9A^((Jx zcifwA`BHmockbg)F3sesNS1h|zRK=N!w!GeJ14*XpLz@)g?D#__)9;UdvldM_m26m z_pL}*U*Dwv>g$%9)2mj!5^FzFtM)*9uEDy;q3cp}Ga7p{KQEkov{vWAzs=>vmgno| z`K`TiDs=I$4(Hj2)0yOITXLR9{R!H9Y0vz7%I}gH<6pNVn$N16X_&a*+;?_ZtknEX zhnq9B=G|YlU%p_!a7g*h-4k9h@@-x9N^d#4jpB9f{Xp(H(eKk5(*G>@o3^A%Onv>1 zau%DF!Xf@o{)C0vP6Wo20#dZC-Vx-L**_CR@;7YW!LY>#6gvkB^`;*?yH(2ID5K1C zsnxlV*i$SjW*{P-V)Uka-)8v3`0rFL(;P2SqxQr0Bc-v|O*tHHZ;>=S%E;nT$iNsR zj^u?6F Yd0%sFVdQ&MBb@0Q2r_N&o-= literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1agrad_1_1op__dvv__vari-members.html b/doc/api/html/classstan_1_1agrad_1_1op__dvv__vari-members.html new file mode 100644 index 00000000000..47da5078042 --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1op__dvv__vari-members.html @@ -0,0 +1,131 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::agrad::op_dvv_vari Member List
+
+
+ +

This is the complete list of members for stan::agrad::op_dvv_vari, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + +
ad_stan::agrad::op_dvv_variprotected
adj_stan::agrad::vari
bvi_stan::agrad::op_dvv_variprotected
chain()stan::agrad::variinlinevirtual
chainable()stan::agrad::chainableinline
cvi_stan::agrad::op_dvv_variprotected
free_memory()stan::agrad::variinlinestatic
init_dependent()stan::agrad::variinlinevirtual
op_dvv_vari(double f, double a, vari *bvi, vari *cvi)stan::agrad::op_dvv_variinline
operator delete(void *)stan::agrad::chainableinlinestatic
operator new(size_t nbytes)stan::agrad::variinlinestatic
recover_memory()stan::agrad::variinlinestatic
set_zero_adjoint()stan::agrad::variinlinevirtual
val_stan::agrad::vari
vari(const double x)stan::agrad::variinline
vari(const double x)stan::agrad::variinline
vari(const double x, bool stacked)stan::agrad::variinline
~chainable()stan::agrad::chainableinlinevirtual
~vari()stan::agrad::variinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1op__dvv__vari.html b/doc/api/html/classstan_1_1agrad_1_1op__dvv__vari.html new file mode 100644 index 00000000000..0f318dc6e10 --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1op__dvv__vari.html @@ -0,0 +1,312 @@ + + + + + +Stan: stan::agrad::op_dvv_vari Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::agrad::op_dvv_vari Class Reference
+
+
+ +

#include <dvv_vari.hpp>

+
+Inheritance diagram for stan::agrad::op_dvv_vari:
+
+
+ + +stan::agrad::vari +stan::agrad::vari +stan::agrad::chainable +stan::agrad::chainable + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 op_dvv_vari (double f, double a, vari *bvi, vari *cvi)
 
- Public Member Functions inherited from stan::agrad::vari
 vari (const double x)
 Construct a variable implementation from a value.
 
virtual void chain ()
 Apply the chain rule to this variable based on the variables on which it depends.
 
 vari (const double x)
 Construct a variable implementation from a value.
 
 vari (const double x, bool stacked)
 
virtual ~vari ()
 Throw an illegal argument exception.
 
virtual void init_dependent ()
 Initialize the adjoint for this (dependent) variable to 1.
 
virtual void set_zero_adjoint ()
 Set the adjoint value of this variable to 0.
 
- Public Member Functions inherited from stan::agrad::chainable
 chainable ()
 Construct a chainable object.
 
virtual ~chainable ()
 Chainables are not destructible and should go on the function call stack or be allocated with operator new.
 
+ + + + + + + +

+Protected Attributes

double ad_
 
varibvi_
 
varicvi_
 
+ + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::agrad::vari
static void * operator new (size_t nbytes)
 Allocate memory from the underlying memory pool.
 
static void recover_memory ()
 Recover memory used for all variables for reuse.
 
static void free_memory ()
 Return all memory used for gradients back to the system.
 
- Public Attributes inherited from stan::agrad::vari
const double val_
 The value of this variable.
 
double adj_
 The adjoint of this variable, which is the partial derivative of this variable with respect to the root variable.
 
+

Detailed Description

+
+

Definition at line 9 of file dvv_vari.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::agrad::op_dvv_vari::op_dvv_vari (double f,
double a,
varibvi,
varicvi 
)
+
+inline
+
+ +

Definition at line 15 of file dvv_vari.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
double stan::agrad::op_dvv_vari::ad_
+
+protected
+
+ +

Definition at line 11 of file dvv_vari.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
vari* stan::agrad::op_dvv_vari::bvi_
+
+protected
+
+ +

Definition at line 12 of file dvv_vari.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
vari* stan::agrad::op_dvv_vari::cvi_
+
+protected
+
+ +

Definition at line 13 of file dvv_vari.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1op__dvv__vari.png b/doc/api/html/classstan_1_1agrad_1_1op__dvv__vari.png new file mode 100644 index 0000000000000000000000000000000000000000..f2a274c736ef6c393be1e6985c521b2a170a6f6f GIT binary patch literal 1326 zcmeAS@N?(olHy`uVBq!ia0y~yV6*_TJ2;quq>BvuOdur@;1lBd|Nnm=^TnI5rTvE{ z09jys;J^Xa&O7ozE=Ng_UoZnu5eQs86=KA|z_QoV#WAFU@$KB#MVovC*k<3;djEft zy`5!>rG}AWVXd)d^y3XW{BQYwPY?3S6nM5DM0RBrUwITVTlwfpHjlzpj6rj<8bp>$ zJ!stF_f_Zh<8^`oVK59HOo_TOE9hW&l~ukRmk z>YguBR?wW76ukCbJ_}*pz+g@H<%Dz0$?M+|3Z;UbH_MKv@ zON#wMXTN%#cvULiXNxAw(XE07>xGv+-D#N~IeXey$90uQ-kotaUK{;zL1;9`j@obQ z#6Ns$S{>8hmdlsBEauwPUtdd#Gn5}(R8FzKe*OGDoww|_&X-;^eizI5-8%73@3OO* zcGWj#Kl9CwUDc*5_HW1jwOk)#x3)Ii_6x90N&mVk?&#&PP}?WRnc0fou8Fy-{d3-q zcut9*j@z}vzk2Q4`KV4gVS{i;{e<`1SH0q&^eBXRiN#e0O+QnIu3+8^-P%j1d|Pp3 zYLHhoL(Ea$1*uWIGafOVE8cCIx9)0#Cf@^_+BMtGZj~}P%Gh$^ETe)$7c<9%M+{6$ zEE*Uz`KZY~a9=3gOOy9f-GN27WVTvdeTEc?3cxt62#i@?H7#9T*0&<;jx^Ig_35vS z@9Ft{l|24vSKTjQ9O{?-pTU1`|CjfVH#Qk zUH@|b!(Fd0Ro#$ye=4jt`oQCu`0ib^YD8-SVYNmacI4@h>dlGf+ znAi=;F!@~(cWyJu*;kiOFaG1{dS4DMs}VSR^mX*t@62-LO|KN)#e-}Qt^`Hdrv~vSRZl_O zt&i$d9*Ek%*dVzw?&wkNcj`=WS2$OR7uBv_73TqrrwK^WroV1V(5=Owzlii`nA*+iN>^hA}U*X!!hP<1Mr6SqDVe1(eL$iHN5IZ_9RX!q>H3|o9>3kJ(LGyv^YILgT4QOLk(=NqH({-dY*GTHWJJ05J2S6TP^|I26F z_thYxYNgyZn^GA=nHhGgvhPbimrDDmQ+U`nwETwS-&y~p-xbH+vi_R=@9B@VJM`=2 zZ>&0e{LrIi-Or`(O#5c@M)Z4l%-$b%n?jfGyLs>7BC~HV(r$b%lktzXnAsKFU;pgc zhP>15Zd!VR+n;ToU-;WiOnb4GZrfYi$8s7o`)jIJ_uYQFM@X&p@wFdYou)0#y3ri_ zb>@!Bb^N)Z4bE{Abw_>wM?W&N);%z-QndGcO@r$BzQ2>T-~BxMtc$tA7%lnFS6KIY g*E(AUy{GnOpKGp!$9=sBEZi78UHx3vIVCg!0QU)CdH?_b literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1agrad_1_1op__matrix__vari-members.html b/doc/api/html/classstan_1_1agrad_1_1op__matrix__vari-members.html new file mode 100644 index 00000000000..9385a718d80 --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1op__matrix__vari-members.html @@ -0,0 +1,132 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::agrad::op_matrix_vari Member List
+
+
+ +

This is the complete list of members for stan::agrad::op_matrix_vari, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + +
adj_stan::agrad::vari
chain()stan::agrad::variinlinevirtual
chainable()stan::agrad::chainableinline
free_memory()stan::agrad::variinlinestatic
init_dependent()stan::agrad::variinlinevirtual
op_matrix_vari(double f, const Eigen::Matrix< stan::agrad::var, R, C > &vs)stan::agrad::op_matrix_variinline
operator delete(void *)stan::agrad::chainableinlinestatic
operator new(size_t nbytes)stan::agrad::variinlinestatic
operator[](size_t n) const stan::agrad::op_matrix_variinline
recover_memory()stan::agrad::variinlinestatic
set_zero_adjoint()stan::agrad::variinlinevirtual
size()stan::agrad::op_matrix_variinline
size_stan::agrad::op_matrix_variprotected
val_stan::agrad::vari
vari(const double x)stan::agrad::variinline
vari(const double x)stan::agrad::variinline
vari(const double x, bool stacked)stan::agrad::variinline
vis_stan::agrad::op_matrix_variprotected
~chainable()stan::agrad::chainableinlinevirtual
~vari()stan::agrad::variinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1op__matrix__vari.html b/doc/api/html/classstan_1_1agrad_1_1op__matrix__vari.html new file mode 100644 index 00000000000..b2eab3ac1a1 --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1op__matrix__vari.html @@ -0,0 +1,333 @@ + + + + + +Stan: stan::agrad::op_matrix_vari Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::agrad::op_matrix_vari Class Reference
+
+
+ +

#include <matrix_vari.hpp>

+
+Inheritance diagram for stan::agrad::op_matrix_vari:
+
+
+ + +stan::agrad::vari +stan::agrad::chainable + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

template<int R, int C>
 op_matrix_vari (double f, const Eigen::Matrix< stan::agrad::var, R, C > &vs)
 
varioperator[] (size_t n) const
 
size_t size ()
 
- Public Member Functions inherited from stan::agrad::vari
 vari (const double x)
 Construct a variable implementation from a value.
 
virtual void chain ()
 Apply the chain rule to this variable based on the variables on which it depends.
 
 vari (const double x)
 Construct a variable implementation from a value.
 
 vari (const double x, bool stacked)
 
virtual ~vari ()
 Throw an illegal argument exception.
 
virtual void init_dependent ()
 Initialize the adjoint for this (dependent) variable to 1.
 
virtual void set_zero_adjoint ()
 Set the adjoint value of this variable to 0.
 
- Public Member Functions inherited from stan::agrad::chainable
 chainable ()
 Construct a chainable object.
 
virtual ~chainable ()
 Chainables are not destructible and should go on the function call stack or be allocated with operator new.
 
+ + + + + +

+Protected Attributes

const size_t size_
 
vari ** vis_
 
+ + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::agrad::vari
static void * operator new (size_t nbytes)
 Allocate memory from the underlying memory pool.
 
static void recover_memory ()
 Recover memory used for all variables for reuse.
 
static void free_memory ()
 Return all memory used for gradients back to the system.
 
- Public Attributes inherited from stan::agrad::vari
const double val_
 The value of this variable.
 
double adj_
 The adjoint of this variable, which is the partial derivative of this variable with respect to the root variable.
 
+

Detailed Description

+
+

Definition at line 11 of file matrix_vari.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
stan::agrad::op_matrix_vari::op_matrix_vari (double f,
const Eigen::Matrix< stan::agrad::var, R, C > & vs 
)
+
+inline
+
+ +

Definition at line 17 of file matrix_vari.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
vari* stan::agrad::op_matrix_vari::operator[] (size_t n) const
+
+inline
+
+ +

Definition at line 25 of file matrix_vari.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
size_t stan::agrad::op_matrix_vari::size ()
+
+inline
+
+ +

Definition at line 28 of file matrix_vari.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
const size_t stan::agrad::op_matrix_vari::size_
+
+protected
+
+ +

Definition at line 13 of file matrix_vari.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
vari** stan::agrad::op_matrix_vari::vis_
+
+protected
+
+ +

Definition at line 14 of file matrix_vari.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1op__matrix__vari.png b/doc/api/html/classstan_1_1agrad_1_1op__matrix__vari.png new file mode 100644 index 0000000000000000000000000000000000000000..98eb0ee5528e78692e9d9fe47f22257bc5332879 GIT binary patch literal 985 zcmeAS@N?(olHy`uVBq!ia0vp^i-EX+3lnR3vHkGvF}x?UNae0n`4koFcN(5$aaL@eR^Inl)XMET(-`jj z_kQ1`D+vWW!HYNCS*G`_{`BdeiMyVc*RJr>_C0-BK;z@3b`{e%7UyE0YHNBd+;wXG zl~VaznN}$|&%A?9?@JDDUsx-u{n2jis-(*o1%6!EsCnSRzTT;a_7=t%nN|CpPThUu zcl9#;Kc#=s$iEW3 z|LM~|26sR2w%c;z+>>z4z)ANCE_}4i+BvC7WYy|FUVODH{7#{L-uN_<}o{5w_ZnLC2>h_p9uEcKPd$w>NwOL|28M zxh}K%u0j6QQ;P4eED63|#XI%x#PF{|e~$gs@La!9zHQQ#!iA4Nc1~O(9Anx4vtZg1 z@0~lYO)9Yj#W2YEJ|NHJGpu{cSWsMd;N!;~`=9Vz_;qcc{)g55{&j}%2Ux=ZGk|`& z%Q|yBd?vt<*9#4SgO+zk496E_2*( zR#f`bdDCAPR)2UVy*gm>we_22kC&aF@@dcd(tDMs&DW-$T6}$LoO9@{9qVuVU8~Bs z();^vUO&Tn%epU2F^4pdC$4Ai(fK@ay8QvW_n*(5eLT_de}x?5KL%(5nU|i$p?GK3 be}*&vonA`4dAA;z4;egN{an^LB{Ts5fPw3_ literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1agrad_1_1op__v__vari-members.html b/doc/api/html/classstan_1_1agrad_1_1op__v__vari-members.html new file mode 100644 index 00000000000..e88a288d015 --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1op__v__vari-members.html @@ -0,0 +1,129 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::agrad::op_v_vari Member List
+
+
+ +

This is the complete list of members for stan::agrad::op_v_vari, including all inherited members.

+ + + + + + + + + + + + + + + + + + +
adj_stan::agrad::vari
avi_stan::agrad::op_v_variprotected
chain()stan::agrad::variinlinevirtual
chainable()stan::agrad::chainableinline
free_memory()stan::agrad::variinlinestatic
init_dependent()stan::agrad::variinlinevirtual
op_v_vari(double f, vari *avi)stan::agrad::op_v_variinline
operator delete(void *)stan::agrad::chainableinlinestatic
operator new(size_t nbytes)stan::agrad::variinlinestatic
recover_memory()stan::agrad::variinlinestatic
set_zero_adjoint()stan::agrad::variinlinevirtual
val_stan::agrad::vari
vari(const double x)stan::agrad::variinline
vari(const double x)stan::agrad::variinline
vari(const double x, bool stacked)stan::agrad::variinline
~chainable()stan::agrad::chainableinlinevirtual
~vari()stan::agrad::variinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1op__v__vari.html b/doc/api/html/classstan_1_1agrad_1_1op__v__vari.html new file mode 100644 index 00000000000..5a7629d7a55 --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1op__v__vari.html @@ -0,0 +1,252 @@ + + + + + +Stan: stan::agrad::op_v_vari Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::agrad::op_v_vari Class Reference
+
+
+ +

#include <v_vari.hpp>

+
+Inheritance diagram for stan::agrad::op_v_vari:
+
+
+ + +stan::agrad::vari +stan::agrad::vari +stan::agrad::chainable +stan::agrad::chainable + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 op_v_vari (double f, vari *avi)
 
- Public Member Functions inherited from stan::agrad::vari
 vari (const double x)
 Construct a variable implementation from a value.
 
virtual void chain ()
 Apply the chain rule to this variable based on the variables on which it depends.
 
 vari (const double x)
 Construct a variable implementation from a value.
 
 vari (const double x, bool stacked)
 
virtual ~vari ()
 Throw an illegal argument exception.
 
virtual void init_dependent ()
 Initialize the adjoint for this (dependent) variable to 1.
 
virtual void set_zero_adjoint ()
 Set the adjoint value of this variable to 0.
 
- Public Member Functions inherited from stan::agrad::chainable
 chainable ()
 Construct a chainable object.
 
virtual ~chainable ()
 Chainables are not destructible and should go on the function call stack or be allocated with operator new.
 
+ + + +

+Protected Attributes

variavi_
 
+ + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::agrad::vari
static void * operator new (size_t nbytes)
 Allocate memory from the underlying memory pool.
 
static void recover_memory ()
 Recover memory used for all variables for reuse.
 
static void free_memory ()
 Return all memory used for gradients back to the system.
 
- Public Attributes inherited from stan::agrad::vari
const double val_
 The value of this variable.
 
double adj_
 The adjoint of this variable, which is the partial derivative of this variable with respect to the root variable.
 
+

Detailed Description

+
+

Definition at line 9 of file v_vari.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
stan::agrad::op_v_vari::op_v_vari (double f,
variavi 
)
+
+inline
+
+ +

Definition at line 13 of file v_vari.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
vari* stan::agrad::op_v_vari::avi_
+
+protected
+
+ +

Definition at line 11 of file v_vari.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1op__v__vari.png b/doc/api/html/classstan_1_1agrad_1_1op__v__vari.png new file mode 100644 index 0000000000000000000000000000000000000000..ea13d652338d1c28e9b870056c0b772ea2f2986b GIT binary patch literal 1293 zcmeAS@N?(olHy`uVBq!ia0y~yV3Yx}J2;quB-5%T#z0CUz$e7@|Ns9$=8HF9OZyK^ z0J6aNz<~p-opt~N|rEH$AhggK}$ z%RxImpmxf)MPENYn-;uqWqXmGlP~eXqJ^7qxv}nOJGfzo$k=U7!8=_m?rz ztJ=>_Kj%LCP|W=If+v4gEU`TKwCSbkKV{if*Z<`1ag65DyW4X^R{rGAnk8B%SM7fl zn47z9`{7mZV(w-H?}$FvuDrIYB5#fFq|)5H6Vjg31b3IqO+R?)$i+>+GL~e0&yLRj zt3ONS;)b&;&+1x<#k)Mq_dQ>psjS*v zD5b7{WQw|{<{-v9K;(+7X-=4N|)FX6ttvT(txY1L2m*al5`a)0mh>p%KS zR>XbY{?UHx(y|*OFLtJW{pS%r>Ccwr(%ovWR^8)U&39|zD(!cZKR@#budaA^02Fgs z_vR*kUAg?}9{WpE@8)k8%zoK?Ys2&!in=di>~f| z#Vn)p{Dz1BU!TX**8ehbFFm(#;=H$sSCuUaB3H^eo(kke3WhmPrv!QNhZK2fE@fw! z_l)I&_+J+eCOU@-nlJ= zKU*)>x5jSPdb#&kch9N6JU9OFokURd6sF~7zQ2@RR3}q=bd!{Q*fKNiyqTA_Z886x zJvZ3=;&h$WJ0EX1j=8$*>lVpv+RxJ;UU7eXHC{P=cgvy3@IOI*r?~eC(&)Rg~$Ih9RQCpX0Mf~1!YwG5hzow_T9;lV`{J(3mKla=+ zPPPrHFMBhu-<4zBQd9dpX8yhZyNem(+)xwz7tM5uwuS5reGlyy&n*m5nQ_ekSavaZ My85}Sb4q9e0Mk%cNB{r; literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1agrad_1_1op__vd__vari-members.html b/doc/api/html/classstan_1_1agrad_1_1op__vd__vari-members.html new file mode 100644 index 00000000000..66dbe436691 --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1op__vd__vari-members.html @@ -0,0 +1,130 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::agrad::op_vd_vari Member List
+
+
+ +

This is the complete list of members for stan::agrad::op_vd_vari, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
adj_stan::agrad::vari
avi_stan::agrad::op_vd_variprotected
bd_stan::agrad::op_vd_variprotected
chain()stan::agrad::variinlinevirtual
chainable()stan::agrad::chainableinline
free_memory()stan::agrad::variinlinestatic
init_dependent()stan::agrad::variinlinevirtual
op_vd_vari(double f, vari *avi, double b)stan::agrad::op_vd_variinline
operator delete(void *)stan::agrad::chainableinlinestatic
operator new(size_t nbytes)stan::agrad::variinlinestatic
recover_memory()stan::agrad::variinlinestatic
set_zero_adjoint()stan::agrad::variinlinevirtual
val_stan::agrad::vari
vari(const double x)stan::agrad::variinline
vari(const double x)stan::agrad::variinline
vari(const double x, bool stacked)stan::agrad::variinline
~chainable()stan::agrad::chainableinlinevirtual
~vari()stan::agrad::variinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1op__vd__vari.html b/doc/api/html/classstan_1_1agrad_1_1op__vd__vari.html new file mode 100644 index 00000000000..0aaf25932b9 --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1op__vd__vari.html @@ -0,0 +1,282 @@ + + + + + +Stan: stan::agrad::op_vd_vari Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::agrad::op_vd_vari Class Reference
+
+
+ +

#include <vd_vari.hpp>

+
+Inheritance diagram for stan::agrad::op_vd_vari:
+
+
+ + +stan::agrad::vari +stan::agrad::vari +stan::agrad::chainable +stan::agrad::chainable + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 op_vd_vari (double f, vari *avi, double b)
 
- Public Member Functions inherited from stan::agrad::vari
 vari (const double x)
 Construct a variable implementation from a value.
 
virtual void chain ()
 Apply the chain rule to this variable based on the variables on which it depends.
 
 vari (const double x)
 Construct a variable implementation from a value.
 
 vari (const double x, bool stacked)
 
virtual ~vari ()
 Throw an illegal argument exception.
 
virtual void init_dependent ()
 Initialize the adjoint for this (dependent) variable to 1.
 
virtual void set_zero_adjoint ()
 Set the adjoint value of this variable to 0.
 
- Public Member Functions inherited from stan::agrad::chainable
 chainable ()
 Construct a chainable object.
 
virtual ~chainable ()
 Chainables are not destructible and should go on the function call stack or be allocated with operator new.
 
+ + + + + +

+Protected Attributes

variavi_
 
double bd_
 
+ + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::agrad::vari
static void * operator new (size_t nbytes)
 Allocate memory from the underlying memory pool.
 
static void recover_memory ()
 Recover memory used for all variables for reuse.
 
static void free_memory ()
 Return all memory used for gradients back to the system.
 
- Public Attributes inherited from stan::agrad::vari
const double val_
 The value of this variable.
 
double adj_
 The adjoint of this variable, which is the partial derivative of this variable with respect to the root variable.
 
+

Detailed Description

+
+

Definition at line 9 of file vd_vari.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
stan::agrad::op_vd_vari::op_vd_vari (double f,
variavi,
double b 
)
+
+inline
+
+ +

Definition at line 14 of file vd_vari.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
vari* stan::agrad::op_vd_vari::avi_
+
+protected
+
+ +

Definition at line 11 of file vd_vari.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
double stan::agrad::op_vd_vari::bd_
+
+protected
+
+ +

Definition at line 12 of file vd_vari.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1op__vd__vari.png b/doc/api/html/classstan_1_1agrad_1_1op__vd__vari.png new file mode 100644 index 0000000000000000000000000000000000000000..99cc44ad79e9df46e82d894e662d13eb8bd2ef46 GIT binary patch literal 1315 zcmeAS@N?(olHy`uVBq!ia0y~yVAKM#J2;quWV(Bp50H`w@CkAK|NlRb`Qpvj(*8pe zfGjXRaNq!I=N)+yRxixLRW5cUKPYUaaD-(60NHOE4@sQ z^sVyy8u)7RwfpANWw@=k?^^!q?#Vbok5X6TRUzRnp{0L2^6Fk6kNnpb*cGM?n-U5+_Lk@F1e^{(jH~`t~dC<{B60u^smbA#(A-;?@h|N{p>ND(OdP;nTN}a z-W!)@8s=QR`gmH1Xx#?peYQ7uoekw*86EspC(qB}s&k$B&E`h4>i$=qe`2n_SFiqZ zGcwre<}7ER|Xm9_ppZyDhRmMXqA%DA>8>)vBE-E4dV$<}VKnKdb5;%HUWO$<8rx6@$|ftp)+0jLRw}YH~ly zuh3dLWm<+sWMFRlQmw0HNX`Vgx?{zw5c#L~JiqtZE_rqIBf9*Q@Me5!1yN^t3rSc-Cze-GA z7p(RmdXg;5uXi_&hOR!cy2>`^<5Ia*QNrP0f2FkN+L^voyRggb+xK%Do-W)RvRC!y z!ACo9uRg7QaiwT=V^+xb4*l2b{l8u4+903tH9&0X(-h0dtI?BKZ`Is!c-C&dTY!>dFrP zTUf=GUUv27$#WUSS0`IkGOe2Df|`twu+(Y$tFGlrBKEek5C3hpiBo)9Tx767`^Fkj6XL2c^l7OAVq4l z9;sij>h-R5sti&~H|C&emS6nJ-SM#cU0Dk`pU{Vm^MNYuOFl=(@B25KKW_h*_m4O3 z+9DG+*J`7bg?M{6&-6b6q4D;0RlI5oK)LMk`gLB_%h#>-d4BDv=i~I1tM=wTd-mt_ zwxza=$B%|K*Ir|pqjvP$^0iry&)nv@z18U4+PjY`Ci(|&ottAWt5e|@dbWLC=x@F- z-vE8b-Pu>Kw5;CxYWI(w!UcD3J!`k~l>WB9l6{SLcj8w*3;pKPvLAL^%>5TBEbw5$ zfe*{;-pU7Vy(!AL?F_H6-mTNl)vgbIe+}RD>fib^>zFEJ(fsMV`qi#=*&Gd*f3W}g XST6DT#H(^(iN@gR>gTe~DWM4fVlrCi literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1agrad_1_1op__vdd__vari-members.html b/doc/api/html/classstan_1_1agrad_1_1op__vdd__vari-members.html new file mode 100644 index 00000000000..164d0971211 --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1op__vdd__vari-members.html @@ -0,0 +1,131 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::agrad::op_vdd_vari Member List
+
+
+ +

This is the complete list of members for stan::agrad::op_vdd_vari, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + +
adj_stan::agrad::vari
avi_stan::agrad::op_vdd_variprotected
bd_stan::agrad::op_vdd_variprotected
cd_stan::agrad::op_vdd_variprotected
chain()stan::agrad::variinlinevirtual
chainable()stan::agrad::chainableinline
free_memory()stan::agrad::variinlinestatic
init_dependent()stan::agrad::variinlinevirtual
op_vdd_vari(double f, vari *avi, double b, double c)stan::agrad::op_vdd_variinline
operator delete(void *)stan::agrad::chainableinlinestatic
operator new(size_t nbytes)stan::agrad::variinlinestatic
recover_memory()stan::agrad::variinlinestatic
set_zero_adjoint()stan::agrad::variinlinevirtual
val_stan::agrad::vari
vari(const double x)stan::agrad::variinline
vari(const double x)stan::agrad::variinline
vari(const double x, bool stacked)stan::agrad::variinline
~chainable()stan::agrad::chainableinlinevirtual
~vari()stan::agrad::variinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1op__vdd__vari.html b/doc/api/html/classstan_1_1agrad_1_1op__vdd__vari.html new file mode 100644 index 00000000000..8b6d98b98fb --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1op__vdd__vari.html @@ -0,0 +1,312 @@ + + + + + +Stan: stan::agrad::op_vdd_vari Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::agrad::op_vdd_vari Class Reference
+
+
+ +

#include <vdd_vari.hpp>

+
+Inheritance diagram for stan::agrad::op_vdd_vari:
+
+
+ + +stan::agrad::vari +stan::agrad::vari +stan::agrad::chainable +stan::agrad::chainable + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 op_vdd_vari (double f, vari *avi, double b, double c)
 
- Public Member Functions inherited from stan::agrad::vari
 vari (const double x)
 Construct a variable implementation from a value.
 
virtual void chain ()
 Apply the chain rule to this variable based on the variables on which it depends.
 
 vari (const double x)
 Construct a variable implementation from a value.
 
 vari (const double x, bool stacked)
 
virtual ~vari ()
 Throw an illegal argument exception.
 
virtual void init_dependent ()
 Initialize the adjoint for this (dependent) variable to 1.
 
virtual void set_zero_adjoint ()
 Set the adjoint value of this variable to 0.
 
- Public Member Functions inherited from stan::agrad::chainable
 chainable ()
 Construct a chainable object.
 
virtual ~chainable ()
 Chainables are not destructible and should go on the function call stack or be allocated with operator new.
 
+ + + + + + + +

+Protected Attributes

variavi_
 
double bd_
 
double cd_
 
+ + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::agrad::vari
static void * operator new (size_t nbytes)
 Allocate memory from the underlying memory pool.
 
static void recover_memory ()
 Recover memory used for all variables for reuse.
 
static void free_memory ()
 Return all memory used for gradients back to the system.
 
- Public Attributes inherited from stan::agrad::vari
const double val_
 The value of this variable.
 
double adj_
 The adjoint of this variable, which is the partial derivative of this variable with respect to the root variable.
 
+

Detailed Description

+
+

Definition at line 9 of file vdd_vari.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::agrad::op_vdd_vari::op_vdd_vari (double f,
variavi,
double b,
double c 
)
+
+inline
+
+ +

Definition at line 15 of file vdd_vari.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
vari* stan::agrad::op_vdd_vari::avi_
+
+protected
+
+ +

Definition at line 11 of file vdd_vari.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
double stan::agrad::op_vdd_vari::bd_
+
+protected
+
+ +

Definition at line 12 of file vdd_vari.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
double stan::agrad::op_vdd_vari::cd_
+
+protected
+
+ +

Definition at line 13 of file vdd_vari.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1op__vdd__vari.png b/doc/api/html/classstan_1_1agrad_1_1op__vdd__vari.png new file mode 100644 index 0000000000000000000000000000000000000000..c2051b81fea3b1ad2da2ef44538f7275a9032f9d GIT binary patch literal 1331 zcmeAS@N?(olHy`uVBq!ia0y~yV6*_TJ2;quq>BvuOdur@;1lBd|Nnm=^TnI5rTvE{ z09jys;J^Xa&O7ozE=Ng_UoZnu5eQs86=KA|z;ejb#WAFU@$KBVMVq_?*k<3;djEeC zzq=h1cbAVx%zd9zW>&ioByT?aZ|RgEsg|GXLFA%aGTw!&&Q5$3!o0-dDubq;L_2 z5jK6=#x^JgClnSbu%tQ}!YVLRWo_pg7r>6UKX<>e1cN?#saI9qb}=Xl}kJ_mBw zUDdiPvw4N@*Q#4dz3ct9XtEsLDp;^yc-hmPmT9rGr+sx?S9$E+%=WZZ(GM4dMsw__ z{dSGJqV}NH^~IU97oOF;URwIIYM12}!4EG4H_deJiMzVG;?}BF?SCo`IINpHb#;~M zec|ugjLPOEyNg2CKbful&YX$O+VLy<&$`vC{wY91Wdbyi_U;Js%It3ik^Bv-cQ9`8 zSL&BPq+I@PpyN2z=yi8(P{Q{OF$WhpB!uu63S6A3Qy7KJ9yoPjn#os%_%CiEazFj`wQ5}8Y zx>e$x-e=avsxpu`yBu6rBXIWU>*%lFndQoxUMaeZ2iYE685U~$o_gAeFpM;v8FLY}!o$@WB14J_H=#q9gy#*Xk z&&#s!#6TkNS48gYY}14;W{!!onTd$12W7kO-eP;e{~^3i{lL;C77YxVd!;?O{Ep1VceaoB9kbgPdi-rs9OvXiiN9j|w-%jR$J{>i^(d(EBg-i#8!5{|*s)z4*}Q$iB}$JA@j literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1agrad_1_1op__vdv__vari-members.html b/doc/api/html/classstan_1_1agrad_1_1op__vdv__vari-members.html new file mode 100644 index 00000000000..b02d9cad100 --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1op__vdv__vari-members.html @@ -0,0 +1,131 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::agrad::op_vdv_vari Member List
+
+
+ +

This is the complete list of members for stan::agrad::op_vdv_vari, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + +
adj_stan::agrad::vari
avi_stan::agrad::op_vdv_variprotected
bd_stan::agrad::op_vdv_variprotected
chain()stan::agrad::variinlinevirtual
chainable()stan::agrad::chainableinline
cvi_stan::agrad::op_vdv_variprotected
free_memory()stan::agrad::variinlinestatic
init_dependent()stan::agrad::variinlinevirtual
op_vdv_vari(double f, vari *avi, double b, vari *cvi)stan::agrad::op_vdv_variinline
operator delete(void *)stan::agrad::chainableinlinestatic
operator new(size_t nbytes)stan::agrad::variinlinestatic
recover_memory()stan::agrad::variinlinestatic
set_zero_adjoint()stan::agrad::variinlinevirtual
val_stan::agrad::vari
vari(const double x)stan::agrad::variinline
vari(const double x)stan::agrad::variinline
vari(const double x, bool stacked)stan::agrad::variinline
~chainable()stan::agrad::chainableinlinevirtual
~vari()stan::agrad::variinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1op__vdv__vari.html b/doc/api/html/classstan_1_1agrad_1_1op__vdv__vari.html new file mode 100644 index 00000000000..3620143a6d8 --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1op__vdv__vari.html @@ -0,0 +1,312 @@ + + + + + +Stan: stan::agrad::op_vdv_vari Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::agrad::op_vdv_vari Class Reference
+
+
+ +

#include <vdv_vari.hpp>

+
+Inheritance diagram for stan::agrad::op_vdv_vari:
+
+
+ + +stan::agrad::vari +stan::agrad::vari +stan::agrad::chainable +stan::agrad::chainable + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 op_vdv_vari (double f, vari *avi, double b, vari *cvi)
 
- Public Member Functions inherited from stan::agrad::vari
 vari (const double x)
 Construct a variable implementation from a value.
 
virtual void chain ()
 Apply the chain rule to this variable based on the variables on which it depends.
 
 vari (const double x)
 Construct a variable implementation from a value.
 
 vari (const double x, bool stacked)
 
virtual ~vari ()
 Throw an illegal argument exception.
 
virtual void init_dependent ()
 Initialize the adjoint for this (dependent) variable to 1.
 
virtual void set_zero_adjoint ()
 Set the adjoint value of this variable to 0.
 
- Public Member Functions inherited from stan::agrad::chainable
 chainable ()
 Construct a chainable object.
 
virtual ~chainable ()
 Chainables are not destructible and should go on the function call stack or be allocated with operator new.
 
+ + + + + + + +

+Protected Attributes

variavi_
 
double bd_
 
varicvi_
 
+ + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::agrad::vari
static void * operator new (size_t nbytes)
 Allocate memory from the underlying memory pool.
 
static void recover_memory ()
 Recover memory used for all variables for reuse.
 
static void free_memory ()
 Return all memory used for gradients back to the system.
 
- Public Attributes inherited from stan::agrad::vari
const double val_
 The value of this variable.
 
double adj_
 The adjoint of this variable, which is the partial derivative of this variable with respect to the root variable.
 
+

Detailed Description

+
+

Definition at line 9 of file vdv_vari.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::agrad::op_vdv_vari::op_vdv_vari (double f,
variavi,
double b,
varicvi 
)
+
+inline
+
+ +

Definition at line 15 of file vdv_vari.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
vari* stan::agrad::op_vdv_vari::avi_
+
+protected
+
+ +

Definition at line 11 of file vdv_vari.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
double stan::agrad::op_vdv_vari::bd_
+
+protected
+
+ +

Definition at line 12 of file vdv_vari.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
vari* stan::agrad::op_vdv_vari::cvi_
+
+protected
+
+ +

Definition at line 13 of file vdv_vari.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1op__vdv__vari.png b/doc/api/html/classstan_1_1agrad_1_1op__vdv__vari.png new file mode 100644 index 0000000000000000000000000000000000000000..85ed7e762df897a4ac4c852c3d9207b6f58342fd GIT binary patch literal 1333 zcmeAS@N?(olHy`uVBq!ia0y~yV6*_TJ2;quq>BvuOdur@;1lBd|Nnm=^TnI5rTvE{ z09jys;J^Xa&O7ozE=Ng_UoZnu5eQs86=KA|z;eXX#WAFU@$KBVMVq_?*k<3;djEeC zzq?&aYln|V%zd9zW=1+6F1*=Lueo#zTjD=$Ah~db+3}z`S;b2%t}Q^ck^0NF{8?#C~N_hFMM@x3BlfQ8`{%_*<`p@TnyZyI) zx7z!3;^l>xuPrmUy1aOg+PbL?q3eD>e4M^xO(z;~V`m4id;RLu=aRw<*e`w6;RpWuNrW%X zES%LZcWqha#Z}(jiK{#9*X4&Q?pw7@px`#=s`fW$;;yc)xV36k`=5#f4(sO5TwSGl zU--K=qcVSqb#dtWC$o*;nKQ9jJAP&VS+{!CKLwlv2)ls7QATQVe?&j> z(p>6zi$5Y{cCx15R!d-HHi#^jQaHMj&7*J?W1PtKmGhq7baYp@(SFCvcz?3@SIK_Ob7}(%hWJ zxrwJ^#k;Gc4?He^|E?s?Zl2%T8>d4T{}Np;*8ZKv<~P^P^INNex-V^-U*~q`Hq*Xq zoR70i>}P5|++cRLJ1lnAy-kn1GxXx_ui7vFVTW)CzvZq8uQ>g-u6m_7oqdnOb!~r- zuPoQQeot%&x4DpL7__&mJN=G7%bpd&A^J~#g@x{&fD{IxAc>37T)O4B6NqF#5PF9p zYT4BWO}+;<+oK;pi{hQ}h~eDj<5{<3K=J6%5hKIEw8Wx;L6c9xp^KSg!XvEQ?YG}v zGh?W4*k3fCVfrNOYH*wIN4GHcdMPi{1+!c?AJpXW!=!NG9)0;Qrw$bQbaBu7+kB+- zZ$B`qPNQVEs|$q>2Wo5f*B;*4W?VmQ$HQfE+sncuuD5;Kk{@`>xv2WEIN{sS&pZ^LdyuIzu zr4vowN3Pa + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::agrad::op_vector_vari Member List
+
+
+ +

This is the complete list of members for stan::agrad::op_vector_vari, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + +
adj_stan::agrad::vari
chain()stan::agrad::variinlinevirtual
chainable()stan::agrad::chainableinline
free_memory()stan::agrad::variinlinestatic
init_dependent()stan::agrad::variinlinevirtual
op_vector_vari(double f, const std::vector< stan::agrad::var > &vs)stan::agrad::op_vector_variinline
operator delete(void *)stan::agrad::chainableinlinestatic
operator new(size_t nbytes)stan::agrad::variinlinestatic
operator[](size_t n) const stan::agrad::op_vector_variinline
recover_memory()stan::agrad::variinlinestatic
set_zero_adjoint()stan::agrad::variinlinevirtual
size()stan::agrad::op_vector_variinline
size_stan::agrad::op_vector_variprotected
val_stan::agrad::vari
vari(const double x)stan::agrad::variinline
vari(const double x)stan::agrad::variinline
vari(const double x, bool stacked)stan::agrad::variinline
vis_stan::agrad::op_vector_variprotected
~chainable()stan::agrad::chainableinlinevirtual
~vari()stan::agrad::variinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1op__vector__vari.html b/doc/api/html/classstan_1_1agrad_1_1op__vector__vari.html new file mode 100644 index 00000000000..b668ae644be --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1op__vector__vari.html @@ -0,0 +1,330 @@ + + + + + +Stan: stan::agrad::op_vector_vari Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::agrad::op_vector_vari Class Reference
+
+
+ +

#include <vector_vari.hpp>

+
+Inheritance diagram for stan::agrad::op_vector_vari:
+
+
+ + +stan::agrad::vari +stan::agrad::chainable + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 op_vector_vari (double f, const std::vector< stan::agrad::var > &vs)
 
varioperator[] (size_t n) const
 
size_t size ()
 
- Public Member Functions inherited from stan::agrad::vari
 vari (const double x)
 Construct a variable implementation from a value.
 
virtual void chain ()
 Apply the chain rule to this variable based on the variables on which it depends.
 
 vari (const double x)
 Construct a variable implementation from a value.
 
 vari (const double x, bool stacked)
 
virtual ~vari ()
 Throw an illegal argument exception.
 
virtual void init_dependent ()
 Initialize the adjoint for this (dependent) variable to 1.
 
virtual void set_zero_adjoint ()
 Set the adjoint value of this variable to 0.
 
- Public Member Functions inherited from stan::agrad::chainable
 chainable ()
 Construct a chainable object.
 
virtual ~chainable ()
 Chainables are not destructible and should go on the function call stack or be allocated with operator new.
 
+ + + + + +

+Protected Attributes

const size_t size_
 
vari ** vis_
 
+ + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::agrad::vari
static void * operator new (size_t nbytes)
 Allocate memory from the underlying memory pool.
 
static void recover_memory ()
 Recover memory used for all variables for reuse.
 
static void free_memory ()
 Return all memory used for gradients back to the system.
 
- Public Attributes inherited from stan::agrad::vari
const double val_
 The value of this variable.
 
double adj_
 The adjoint of this variable, which is the partial derivative of this variable with respect to the root variable.
 
+

Detailed Description

+
+

Definition at line 11 of file vector_vari.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
stan::agrad::op_vector_vari::op_vector_vari (double f,
const std::vector< stan::agrad::var > & vs 
)
+
+inline
+
+ +

Definition at line 16 of file vector_vari.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
vari* stan::agrad::op_vector_vari::operator[] (size_t n) const
+
+inline
+
+ +

Definition at line 23 of file vector_vari.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
size_t stan::agrad::op_vector_vari::size ()
+
+inline
+
+ +

Definition at line 26 of file vector_vari.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
const size_t stan::agrad::op_vector_vari::size_
+
+protected
+
+ +

Definition at line 13 of file vector_vari.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
vari** stan::agrad::op_vector_vari::vis_
+
+protected
+
+ +

Definition at line 14 of file vector_vari.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1op__vector__vari.png b/doc/api/html/classstan_1_1agrad_1_1op__vector__vari.png new file mode 100644 index 0000000000000000000000000000000000000000..260a6481405b520730120de50a0e0b18871b7c12 GIT binary patch literal 979 zcmeAS@N?(olHy`uVBq!ia0vp^%Ye9pgBeIheMkUN5&=FTuK)l42Qpv0`C8h4XabN0 z#s>}@VC}pk59D%`1o;Is02P72)l(rx3=GUko-U3d6^w7^zMiyNL4a*`|EfLzmE{*F z?0A`Fbn~iJaH@Kt#DeLJ-}DWSRn&G&Dk+T#p0uXG*K<=+ys^in$XkA2tIbom-uQog zJ!?|P$C+s}ezks0mP-8>CH;K*OXICu7aHl7pUsa|IR05;(v=NME&HdYW5Z*slo;fd4xZm#-u zPB1Gw^!)vdyrreScPEs_Ok$I{H#_<4^;y>!ZoD7ydGg*!nZBPN%qHuwSJ}SIUE#4h zYmQ#4+J}Rl)0ZgkDc$UK$(U0 z0CCyguyyS_yE^+mJNqY8G-(1(8kUE(QlgE z^YNE}>dRMfvpvr$c&6WcT~csh|FtPgm}Rc>T+T`SJLB2B{nw8DO#S7Po15`x(Y7-P)3p9sebDk4ctc_~-JFk7jEtGJ{n!+lyV#tG+gQ z9kJ@0!rGi)eb3yUp4!SeNy=@O?xZiw@86%@n6}l&b;TX4`&V@Mj@MLh_m-52FW&TG zeSn=#X8Zbs`gdnf+R}eeRnwDq*(~*G?vwlycF%fwZ<+x@%BGIz9k7fPA!n4nwyvx}3=H1zkf3D7t zY+1D>EC1Qi`*&vF<=wCxl8PSdLQ_$;|F2zdyC?tK73MbU^@Z8r)ehLPU)ukn{_T{s zaOH-1rJk1p8E!m%ex-PIWzMbralQ@v4?mdK II;Vst0BPyvs{jB1 literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1agrad_1_1op__vv__vari-members.html b/doc/api/html/classstan_1_1agrad_1_1op__vv__vari-members.html new file mode 100644 index 00000000000..8bac63f4b0c --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1op__vv__vari-members.html @@ -0,0 +1,130 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::agrad::op_vv_vari Member List
+
+
+ +

This is the complete list of members for stan::agrad::op_vv_vari, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
adj_stan::agrad::vari
avi_stan::agrad::op_vv_variprotected
bvi_stan::agrad::op_vv_variprotected
chain()stan::agrad::variinlinevirtual
chainable()stan::agrad::chainableinline
free_memory()stan::agrad::variinlinestatic
init_dependent()stan::agrad::variinlinevirtual
op_vv_vari(double f, vari *avi, vari *bvi)stan::agrad::op_vv_variinline
operator delete(void *)stan::agrad::chainableinlinestatic
operator new(size_t nbytes)stan::agrad::variinlinestatic
recover_memory()stan::agrad::variinlinestatic
set_zero_adjoint()stan::agrad::variinlinevirtual
val_stan::agrad::vari
vari(const double x)stan::agrad::variinline
vari(const double x)stan::agrad::variinline
vari(const double x, bool stacked)stan::agrad::variinline
~chainable()stan::agrad::chainableinlinevirtual
~vari()stan::agrad::variinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1op__vv__vari.html b/doc/api/html/classstan_1_1agrad_1_1op__vv__vari.html new file mode 100644 index 00000000000..d43f4c13640 --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1op__vv__vari.html @@ -0,0 +1,282 @@ + + + + + +Stan: stan::agrad::op_vv_vari Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::agrad::op_vv_vari Class Reference
+
+
+ +

#include <vv_vari.hpp>

+
+Inheritance diagram for stan::agrad::op_vv_vari:
+
+
+ + +stan::agrad::vari +stan::agrad::vari +stan::agrad::chainable +stan::agrad::chainable + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 op_vv_vari (double f, vari *avi, vari *bvi)
 
- Public Member Functions inherited from stan::agrad::vari
 vari (const double x)
 Construct a variable implementation from a value.
 
virtual void chain ()
 Apply the chain rule to this variable based on the variables on which it depends.
 
 vari (const double x)
 Construct a variable implementation from a value.
 
 vari (const double x, bool stacked)
 
virtual ~vari ()
 Throw an illegal argument exception.
 
virtual void init_dependent ()
 Initialize the adjoint for this (dependent) variable to 1.
 
virtual void set_zero_adjoint ()
 Set the adjoint value of this variable to 0.
 
- Public Member Functions inherited from stan::agrad::chainable
 chainable ()
 Construct a chainable object.
 
virtual ~chainable ()
 Chainables are not destructible and should go on the function call stack or be allocated with operator new.
 
+ + + + + +

+Protected Attributes

variavi_
 
varibvi_
 
+ + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::agrad::vari
static void * operator new (size_t nbytes)
 Allocate memory from the underlying memory pool.
 
static void recover_memory ()
 Recover memory used for all variables for reuse.
 
static void free_memory ()
 Return all memory used for gradients back to the system.
 
- Public Attributes inherited from stan::agrad::vari
const double val_
 The value of this variable.
 
double adj_
 The adjoint of this variable, which is the partial derivative of this variable with respect to the root variable.
 
+

Detailed Description

+
+

Definition at line 9 of file vv_vari.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
stan::agrad::op_vv_vari::op_vv_vari (double f,
variavi,
varibvi 
)
+
+inline
+
+ +

Definition at line 14 of file vv_vari.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
vari* stan::agrad::op_vv_vari::avi_
+
+protected
+
+ +

Definition at line 11 of file vv_vari.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
vari* stan::agrad::op_vv_vari::bvi_
+
+protected
+
+ +

Definition at line 12 of file vv_vari.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1op__vv__vari.png b/doc/api/html/classstan_1_1agrad_1_1op__vv__vari.png new file mode 100644 index 0000000000000000000000000000000000000000..c73771d76ac9dde6d030e8d972046cc4cfdc7cae GIT binary patch literal 1309 zcmeAS@N?(olHy`uVBq!ia0y~yVAKM#J2;quWV(Bp50H`w@CkAK|NlRb`Qpvj(*8pe zfGjXRaNq!I=N)+61na7Y5J6)SDf4SgUCrLU!B)^P5Px6;yKB6#Uz#P098-1 zg+JP=w|Vulv(L|Cx#cDkS2<79b-w+~hUx0s z;^%i+pSBKdl;gcEdn?h}~Zht|fm0yv}i@RH2O-lJ~7H>A8)c&U5 z?Cq0t=dbj>xna@j>AEYm{v@#Pv5CC-Y*LBW-C2{abhQfyO!E7AH$|WA)?3?2S0>C~ z{p)Ya`hR7i(OyB`_g<`u_y5*xHhszcM|(LnJolr7jMG$=NS{?fUMrQ2LN%9O5oGX{ zVBEE2cgjMp1Bo)#rB`D&1+YFac>3~6X!%Je(FRYQ*9>AnIi(QBh!!n|?f}*V!Bq@8 zKpEE+OdB{tDUtl&unHK7oqdy4JzurQOa;azauk9bYO#vVvubL(x~=uMNvrtPcPmU# zv3(R3I_XP?aOmNZyNT7a-xVREaEt2hjWV;?y)G%PTcth8mix@!cqy{`Yv z`#Q)r=j7ECrnpIOR4(jI-n=@jv%AVx=XVhQ)Fo2!SD#OwyY1(#CA%F`b6>u1PW-tr zY?Yp8*`^A)Z(0Amc_wM~F}kpor^|SJi$xdFjSg-jgJA_vI+u?%&`B zjkVWCJJ)DOZ+yt|Cuh@SU^E2JyX!b9?!f#8VDw#1dCz9`+fd~ttJJEjd2im{&%0-@ zvXWJI_o~uOV!3*ry%{!)sw)LSX&4j$En1$NI6^0-7_RivT-tXcWa*S3cLtM0mKT%W zO={I*XfJ$o6%tQ}rz{T+zpKg}%AmG!4Kv}WDwH|y$M|FOpSR1IGu%jw$$E#Y20YIG z3?*LaH&GM9qwJ8s8X2>fN3RnCCX#)QR}KCe=i~?f{I*ecPwmWm)00az<-_J$ZLXPe z^sUlo)%`A4|CoGF-{rYFySUPJ+SEQj(~!HpwU=4u*mLFY-nrBE=Dw6@&D~o08{W@q zc)jF?eNtGmJhlxrjo%d}YppR$L0j~2*Vb2! zEw1;){STyO->&--dTYr1YFUf#2g>4ywz!oRq6RiZ>&A4A5m`j*~ufz>q&E& + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::agrad::op_vvd_vari Member List
+
+
+ +

This is the complete list of members for stan::agrad::op_vvd_vari, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + +
adj_stan::agrad::vari
avi_stan::agrad::op_vvd_variprotected
bvi_stan::agrad::op_vvd_variprotected
cd_stan::agrad::op_vvd_variprotected
chain()stan::agrad::variinlinevirtual
chainable()stan::agrad::chainableinline
free_memory()stan::agrad::variinlinestatic
init_dependent()stan::agrad::variinlinevirtual
op_vvd_vari(double f, vari *avi, vari *bvi, double c)stan::agrad::op_vvd_variinline
operator delete(void *)stan::agrad::chainableinlinestatic
operator new(size_t nbytes)stan::agrad::variinlinestatic
recover_memory()stan::agrad::variinlinestatic
set_zero_adjoint()stan::agrad::variinlinevirtual
val_stan::agrad::vari
vari(const double x)stan::agrad::variinline
vari(const double x)stan::agrad::variinline
vari(const double x, bool stacked)stan::agrad::variinline
~chainable()stan::agrad::chainableinlinevirtual
~vari()stan::agrad::variinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1op__vvd__vari.html b/doc/api/html/classstan_1_1agrad_1_1op__vvd__vari.html new file mode 100644 index 00000000000..383f170b8aa --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1op__vvd__vari.html @@ -0,0 +1,312 @@ + + + + + +Stan: stan::agrad::op_vvd_vari Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::agrad::op_vvd_vari Class Reference
+
+
+ +

#include <vvd_vari.hpp>

+
+Inheritance diagram for stan::agrad::op_vvd_vari:
+
+
+ + +stan::agrad::vari +stan::agrad::vari +stan::agrad::chainable +stan::agrad::chainable + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 op_vvd_vari (double f, vari *avi, vari *bvi, double c)
 
- Public Member Functions inherited from stan::agrad::vari
 vari (const double x)
 Construct a variable implementation from a value.
 
virtual void chain ()
 Apply the chain rule to this variable based on the variables on which it depends.
 
 vari (const double x)
 Construct a variable implementation from a value.
 
 vari (const double x, bool stacked)
 
virtual ~vari ()
 Throw an illegal argument exception.
 
virtual void init_dependent ()
 Initialize the adjoint for this (dependent) variable to 1.
 
virtual void set_zero_adjoint ()
 Set the adjoint value of this variable to 0.
 
- Public Member Functions inherited from stan::agrad::chainable
 chainable ()
 Construct a chainable object.
 
virtual ~chainable ()
 Chainables are not destructible and should go on the function call stack or be allocated with operator new.
 
+ + + + + + + +

+Protected Attributes

variavi_
 
varibvi_
 
double cd_
 
+ + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::agrad::vari
static void * operator new (size_t nbytes)
 Allocate memory from the underlying memory pool.
 
static void recover_memory ()
 Recover memory used for all variables for reuse.
 
static void free_memory ()
 Return all memory used for gradients back to the system.
 
- Public Attributes inherited from stan::agrad::vari
const double val_
 The value of this variable.
 
double adj_
 The adjoint of this variable, which is the partial derivative of this variable with respect to the root variable.
 
+

Detailed Description

+
+

Definition at line 9 of file vvd_vari.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::agrad::op_vvd_vari::op_vvd_vari (double f,
variavi,
varibvi,
double c 
)
+
+inline
+
+ +

Definition at line 15 of file vvd_vari.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
vari* stan::agrad::op_vvd_vari::avi_
+
+protected
+
+ +

Definition at line 11 of file vvd_vari.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
vari* stan::agrad::op_vvd_vari::bvi_
+
+protected
+
+ +

Definition at line 12 of file vvd_vari.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
double stan::agrad::op_vvd_vari::cd_
+
+protected
+
+ +

Definition at line 13 of file vvd_vari.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1op__vvd__vari.png b/doc/api/html/classstan_1_1agrad_1_1op__vvd__vari.png new file mode 100644 index 0000000000000000000000000000000000000000..5fe818414ab788804843fcc184e7397b01ed9996 GIT binary patch literal 1328 zcmeAS@N?(olHy`uVBq!ia0y~yV6*_TJ2;quq>BvuOdur@;1lBd|Nnm=^TnI5rTvE{ z09jys;J^Xa&O7ozE=Ng_UoZnu5eQs86=KA|z_Q=d#WAFU@$KBVMVq_?*k<3;djEeC zzq=h1cbAVx%zd9z*DQ2CTzL29-_j{TQY}B%gUCgt1iKO|JUVr?VmM&*Z=#w zVvU||yYF(p`(~{x?P4FB7OrJkQ*_r~KK^j-*62OU{h_rqrGX47M?Uw!)e<+BTJ2NtWQ*k8YXexKf3_FLymFG_u1*YJC;!8^Ch z&rIgqzVZFMEOffq;V|L)JNH*P)r130+9n*re{<&ERpB4Egog6}{MgVKV{IJ%)oY*n zyKpAAx(jd5gzlY`e{RQp4v9A`SLL7lUc2g7Gg8P*00z{TM_!ssZN zox+xBpAeYax76b5GmpYmj6rj<8bp>$DI8tNRuKq_$aHnt*bi%Vn6uRQ>s?LX6FcXX zao^F>zfX7nT)Y3~-(&L1%{^**O?W^7udflmJ+INZbvdz6GQP+=&-H_a7Q?hZ# zc2=9X>hk5EKRthWrE71D>8gHOj>V*Kcy*oUot66K43PM;~n zSABU;=GCQ{Q)R^$?X0L>{jcu8W4{2~CokMqsasrKwW>Wv?n6_|`ae#q)OUp4>1WyV zh+Wo9`ReK&703R%9O$-k{OYtWKlCcMCu%snI65`Rt6Jv>h-8R4%DW&H96RTVcbn#| zyV{`1_rRuh&9<{!r3{WTwwyT2sNm4W%rW5+1Je?V1_n(&Y}|s~ck^+RKPp)J@YH)%R$x$#$-^+NSY#?k?@TT}PBx z%4@FMw&UfapN!j=+Vb-sd3$EZ( + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::agrad::op_vvv_vari Member List
+
+
+ +

This is the complete list of members for stan::agrad::op_vvv_vari, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + +
adj_stan::agrad::vari
avi_stan::agrad::op_vvv_variprotected
bvi_stan::agrad::op_vvv_variprotected
chain()stan::agrad::variinlinevirtual
chainable()stan::agrad::chainableinline
cvi_stan::agrad::op_vvv_variprotected
free_memory()stan::agrad::variinlinestatic
init_dependent()stan::agrad::variinlinevirtual
op_vvv_vari(double f, vari *avi, vari *bvi, vari *cvi)stan::agrad::op_vvv_variinline
operator delete(void *)stan::agrad::chainableinlinestatic
operator new(size_t nbytes)stan::agrad::variinlinestatic
recover_memory()stan::agrad::variinlinestatic
set_zero_adjoint()stan::agrad::variinlinevirtual
val_stan::agrad::vari
vari(const double x)stan::agrad::variinline
vari(const double x)stan::agrad::variinline
vari(const double x, bool stacked)stan::agrad::variinline
~chainable()stan::agrad::chainableinlinevirtual
~vari()stan::agrad::variinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1op__vvv__vari.html b/doc/api/html/classstan_1_1agrad_1_1op__vvv__vari.html new file mode 100644 index 00000000000..d3f5bde0559 --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1op__vvv__vari.html @@ -0,0 +1,312 @@ + + + + + +Stan: stan::agrad::op_vvv_vari Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::agrad::op_vvv_vari Class Reference
+
+
+ +

#include <vvv_vari.hpp>

+
+Inheritance diagram for stan::agrad::op_vvv_vari:
+
+
+ + +stan::agrad::vari +stan::agrad::vari +stan::agrad::chainable +stan::agrad::chainable + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 op_vvv_vari (double f, vari *avi, vari *bvi, vari *cvi)
 
- Public Member Functions inherited from stan::agrad::vari
 vari (const double x)
 Construct a variable implementation from a value.
 
virtual void chain ()
 Apply the chain rule to this variable based on the variables on which it depends.
 
 vari (const double x)
 Construct a variable implementation from a value.
 
 vari (const double x, bool stacked)
 
virtual ~vari ()
 Throw an illegal argument exception.
 
virtual void init_dependent ()
 Initialize the adjoint for this (dependent) variable to 1.
 
virtual void set_zero_adjoint ()
 Set the adjoint value of this variable to 0.
 
- Public Member Functions inherited from stan::agrad::chainable
 chainable ()
 Construct a chainable object.
 
virtual ~chainable ()
 Chainables are not destructible and should go on the function call stack or be allocated with operator new.
 
+ + + + + + + +

+Protected Attributes

variavi_
 
varibvi_
 
varicvi_
 
+ + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::agrad::vari
static void * operator new (size_t nbytes)
 Allocate memory from the underlying memory pool.
 
static void recover_memory ()
 Recover memory used for all variables for reuse.
 
static void free_memory ()
 Return all memory used for gradients back to the system.
 
- Public Attributes inherited from stan::agrad::vari
const double val_
 The value of this variable.
 
double adj_
 The adjoint of this variable, which is the partial derivative of this variable with respect to the root variable.
 
+

Detailed Description

+
+

Definition at line 9 of file vvv_vari.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::agrad::op_vvv_vari::op_vvv_vari (double f,
variavi,
varibvi,
varicvi 
)
+
+inline
+
+ +

Definition at line 15 of file vvv_vari.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
vari* stan::agrad::op_vvv_vari::avi_
+
+protected
+
+ +

Definition at line 11 of file vvv_vari.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
vari* stan::agrad::op_vvv_vari::bvi_
+
+protected
+
+ +

Definition at line 12 of file vvv_vari.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
vari* stan::agrad::op_vvv_vari::cvi_
+
+protected
+
+ +

Definition at line 13 of file vvv_vari.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1op__vvv__vari.png b/doc/api/html/classstan_1_1agrad_1_1op__vvv__vari.png new file mode 100644 index 0000000000000000000000000000000000000000..a1450f77aee0c30c97686bbcd1cfe1480f26d703 GIT binary patch literal 1316 zcmeAS@N?(olHy`uVBq!ia0y~yV6*_TJ2;quq>BvuOdur@;1lBd|Nnm=^TnI5rTvE{ z09jys;J^Xa&O7ozE=Ng_UoZnu5eQs86=KA|z_QuX#WAFU@$KBVMVq_?*k<3;djEeC zzq=h1x8Tf#nEO7bu36}ucHVvX-_j{TQY}B%gUCg;L^- zu|`j~-FLa)eY4h;c4t4%*%8JRw)5Tc{`C(x-O`P_Tz|Nv^yTbebLFz*_Uh|qHr$R` z9lFahJ#hA`uN#g^#rtm2WI4K3uwcFLvZp&O(_?2(`|7x^^2ob0&c;{Q7F<}R%W}uA z`ZepGeF;-v?@pZUJX`a6Y3a|Z9hO@JKfDm!H2?MM^!VxDnBP9%^+NLdx`y9#4c@t3 zer7V?_Kol7Wueo>4u^5q-?_iasU|#E@xeCX5dNEydsl^j+z=YdUs-v;Vcp!RtE*J) zg}-YvD%-y(d%7y_B!Bpwd={RvrdQlQD_5`DH$h~%l)}-KY#xQH7=z|yHN?eeF5Pn6 z2}H6V2))A)wd`txCf@^_?a_~)Me)vf#BlEN@hqSx8G~gUI_}6YFfFlYV9?}KaOh&@ znDB_I+&{X7OQ&2?c+0M{>g-05<+o&@5jX)FpZ;C1L(YGCv1Bpl`L1f`1K*zn)gHNh zbfw*+h?wjC_s{14J^D`m^TFTK|JB-rO@G!!_|CC#dooc{6&B3m%cQO3EO=% z`&a&syx3Lky&u=*T;0xUbMEWb72=b_4~BoOy79={Hl(ya_|ZM#4>SE{T>GeYeV5s` z1Lrn8UD$neukM47o6E~B_3P*Pt-WzNbn!3QisrGx_?%Zaw zyUzJI&*Z;R@S()~S>|hZnb@WtXTKP;XJ2T&{ewdF6>>!-idTi_WQAUJ*5j{mT$f%4 zfQ)OKL!?FFW$5$=AxWe@u6@lt2;!b>ByQ)eNEgbgl2=dD8Zv~P34XbxBZt(%d z&VkCj?Z?h;l`=TWIA?kP)onY&n3q{J2<)_EVDTtqU<{IRXb@o+P&mqnjhnaq_S#&A ze+>0c?HKh`v8%yt!jI@jyVkvyVp))Ts|T23kdw%V%tua@`g>0nZUS2Vp!rDYU;Dd% zu1$ZBh^T3YR|T_QlYgE3Ip*-0`Koz4Rvwit+fd{CpZ9y@^lyH(ad)Qg=g+zNFgdmG z^3l({dEV7>^WqCnAN@XYt<~4F-}u6}Zge+4T=vxG?e>2w`h0Ew&7AFgciMfa$b!xt zv(DEYdn+Bew#PNoH0Nv2>ew|?dyMS&haP`h6vsLFP~zt~bP0l+XkK4L)D{ literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1agrad_1_1partials__vari-members.html b/doc/api/html/classstan_1_1agrad_1_1partials__vari-members.html new file mode 100644 index 00000000000..a29ad7d2442 --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1partials__vari-members.html @@ -0,0 +1,128 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::agrad::partials_vari Member List
+
+
+ +

This is the complete list of members for stan::agrad::partials_vari, including all inherited members.

+ + + + + + + + + + + + + + + + + +
adj_stan::agrad::vari
chain()stan::agrad::partials_variinlinevirtual
chainable()stan::agrad::chainableinline
free_memory()stan::agrad::variinlinestatic
init_dependent()stan::agrad::variinlinevirtual
operator delete(void *)stan::agrad::chainableinlinestatic
operator new(size_t nbytes)stan::agrad::variinlinestatic
partials_vari(double value, size_t N, vari **operands, double *partials)stan::agrad::partials_variinline
recover_memory()stan::agrad::variinlinestatic
set_zero_adjoint()stan::agrad::variinlinevirtual
val_stan::agrad::vari
vari(const double x)stan::agrad::variinline
vari(const double x)stan::agrad::variinline
vari(const double x, bool stacked)stan::agrad::variinline
~chainable()stan::agrad::chainableinlinevirtual
~vari()stan::agrad::variinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1partials__vari.html b/doc/api/html/classstan_1_1agrad_1_1partials__vari.html new file mode 100644 index 00000000000..322e65c575c --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1partials__vari.html @@ -0,0 +1,264 @@ + + + + + +Stan: stan::agrad::partials_vari Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::agrad::partials_vari Class Reference
+
+
+ +

#include <partials_vari.hpp>

+
+Inheritance diagram for stan::agrad::partials_vari:
+
+
+ + +stan::agrad::vari +stan::agrad::chainable + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 partials_vari (double value, size_t N, vari **operands, double *partials)
 
void chain ()
 Apply the chain rule to this variable based on the variables on which it depends.
 
- Public Member Functions inherited from stan::agrad::vari
 vari (const double x)
 Construct a variable implementation from a value.
 
 vari (const double x)
 Construct a variable implementation from a value.
 
 vari (const double x, bool stacked)
 
virtual ~vari ()
 Throw an illegal argument exception.
 
virtual void init_dependent ()
 Initialize the adjoint for this (dependent) variable to 1.
 
virtual void set_zero_adjoint ()
 Set the adjoint value of this variable to 0.
 
- Public Member Functions inherited from stan::agrad::chainable
 chainable ()
 Construct a chainable object.
 
virtual ~chainable ()
 Chainables are not destructible and should go on the function call stack or be allocated with operator new.
 
+ + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::agrad::vari
static void * operator new (size_t nbytes)
 Allocate memory from the underlying memory pool.
 
static void recover_memory ()
 Recover memory used for all variables for reuse.
 
static void free_memory ()
 Return all memory used for gradients back to the system.
 
- Public Attributes inherited from stan::agrad::vari
const double val_
 The value of this variable.
 
double adj_
 The adjoint of this variable, which is the partial derivative of this variable with respect to the root variable.
 
+

Detailed Description

+
+

Definition at line 11 of file partials_vari.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::agrad::partials_vari::partials_vari (double value,
size_t N,
vari ** operands,
double * partials 
)
+
+inline
+
+ +

Definition at line 17 of file partials_vari.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + +
void stan::agrad::partials_vari::chain ()
+
+inlinevirtual
+
+ +

Apply the chain rule to this variable based on the variables on which it depends.

+

The base implementation in this class is a no-op.

+ +

Reimplemented from stan::agrad::vari.

+ +

Definition at line 24 of file partials_vari.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1partials__vari.png b/doc/api/html/classstan_1_1agrad_1_1partials__vari.png new file mode 100644 index 0000000000000000000000000000000000000000..78719cc743cafc8cc9ee0cbe91a4a77d1772f60a GIT binary patch literal 972 zcmeAS@N?(olHy`uVBq!ia0vp^(}1{xgBeH~F+Z{fQW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;UDUwzk0G3uHA zOKO@*=&m+VvHctFPm6qg-fqV}o$n^sW_fM5G2LI+p1Hq-@Yf6ENi*eH+i1nwW;^CW>wye@x73H_^tIuQ_;N8vzM0T@`#r$ zQi=R>@uZrkS#6W4$1at-EBiNHRgazY?#ldMtEVlApPKABDfDyFQHjSTOgp^!8-ALo zUwdq*dVNj=_tl=5$w@!`ST>yA$grkJhheo0_W`ZrOdC$&&u6j-KE7`mKSVX84SMW`)@+8r-d-B#L-Q2R>tZ7q6yQX>hs|$B4F7H(J zT>rJ%*=v&2-KNwZHJ-Z`RBxJk&eL<3d;RbAQIqy*9-pML`q|Mg!(%U53Z~03e9rV+ zb3EB=o#jTcRgyc^j((cUkuW`(G2&?iLztylLuems!c^Sc|BPWAif7cB4&*?Ca24BY zTX2{gNXdCIYnNVJbitm)BSAU&sf3Ye_a3h{VP8!vVPd8 zmsq-6SVKR1MSA!0&0Gl!vTs(&zTUox^@A)lNUnZn;Zbb4`GtSl6We9}jT4=KS&zZf L)z4*}Q$iB}H+0NO literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1agrad_1_1precomp__v__vari-members.html b/doc/api/html/classstan_1_1agrad_1_1precomp__v__vari-members.html new file mode 100644 index 00000000000..1245aedfd42 --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1precomp__v__vari-members.html @@ -0,0 +1,116 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::agrad::precomp_v_vari Member List
+
+
+ +

This is the complete list of members for stan::agrad::precomp_v_vari, including all inherited members.

+ + + + + +
avi_ (defined in stan::agrad::op_v_vari)stan::agrad::op_v_variprotectedstatic
chain()stan::agrad::precomp_v_variinline
da_stan::agrad::precomp_v_variprotected
precomp_v_vari(double val, vari *avi, double da)stan::agrad::precomp_v_variinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1precomp__v__vari.html b/doc/api/html/classstan_1_1agrad_1_1precomp__v__vari.html new file mode 100644 index 00000000000..c83db4dc289 --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1precomp__v__vari.html @@ -0,0 +1,234 @@ + + + + + +Stan: stan::agrad::precomp_v_vari Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::agrad::precomp_v_vari Class Reference
+
+
+ +

#include <precomp_v_vari.hpp>

+ +

Inherits stan::agrad::op_v_vari.

+ + + + + + +

+Public Member Functions

 precomp_v_vari (double val, vari *avi, double da)
 
void chain ()
 
+ + + +

+Protected Attributes

double da_
 
+ + + + +

+Additional Inherited Members

- Static Protected Attributes inherited from stan::agrad::op_v_vari
vari *   avi_
 
+

Detailed Description

+
+

Definition at line 11 of file precomp_v_vari.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
stan::agrad::precomp_v_vari::precomp_v_vari (double val,
variavi,
double da 
)
+
+inline
+
+ +

Definition at line 15 of file precomp_v_vari.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + +
void stan::agrad::precomp_v_vari::chain ()
+
+inline
+
+ +

Definition at line 19 of file precomp_v_vari.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
double stan::agrad::precomp_v_vari::da_
+
+protected
+
+ +

Definition at line 13 of file precomp_v_vari.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1stored__gradient__vari-members.html b/doc/api/html/classstan_1_1agrad_1_1stored__gradient__vari-members.html new file mode 100644 index 00000000000..6131ad9d993 --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1stored__gradient__vari-members.html @@ -0,0 +1,131 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::agrad::stored_gradient_vari Member List
+
+
+ +

This is the complete list of members for stan::agrad::stored_gradient_vari, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + +
adj_stan::agrad::vari
chain()stan::agrad::stored_gradient_variinlinevirtual
chainable()stan::agrad::chainableinline
dtrs_stan::agrad::stored_gradient_variprotected
free_memory()stan::agrad::variinlinestatic
init_dependent()stan::agrad::variinlinevirtual
operator delete(void *)stan::agrad::chainableinlinestatic
operator new(size_t nbytes)stan::agrad::variinlinestatic
partials_stan::agrad::stored_gradient_variprotected
recover_memory()stan::agrad::variinlinestatic
set_zero_adjoint()stan::agrad::variinlinevirtual
size_stan::agrad::stored_gradient_variprotected
stored_gradient_vari(double value, size_t size, vari **dtrs, double *partials)stan::agrad::stored_gradient_variinline
val_stan::agrad::vari
vari(const double x)stan::agrad::variinline
vari(const double x)stan::agrad::variinline
vari(const double x, bool stacked)stan::agrad::variinline
~chainable()stan::agrad::chainableinlinevirtual
~vari()stan::agrad::variinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1stored__gradient__vari.html b/doc/api/html/classstan_1_1agrad_1_1stored__gradient__vari.html new file mode 100644 index 00000000000..94bda464d0e --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1stored__gradient__vari.html @@ -0,0 +1,357 @@ + + + + + +Stan: stan::agrad::stored_gradient_vari Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::agrad::stored_gradient_vari Class Reference
+
+
+ +

A var implementation that stores the daughter variable implementation pointers and the partial derivative with respect to the result explicitly in arrays constructed on the auto-diff memory stack. + More...

+ +

#include <stored_gradient_vari.hpp>

+
+Inheritance diagram for stan::agrad::stored_gradient_vari:
+
+
+ + +stan::agrad::vari +stan::agrad::chainable + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 stored_gradient_vari (double value, size_t size, vari **dtrs, double *partials)
 Construct a stored gradient vari with the specified value, size, daughter varis, and partial derivatives.
 
void chain ()
 Propagate derivatives through this vari with partial derivatives given for the daughter vari by the stored partials.
 
- Public Member Functions inherited from stan::agrad::vari
 vari (const double x)
 Construct a variable implementation from a value.
 
 vari (const double x)
 Construct a variable implementation from a value.
 
 vari (const double x, bool stacked)
 
virtual ~vari ()
 Throw an illegal argument exception.
 
virtual void init_dependent ()
 Initialize the adjoint for this (dependent) variable to 1.
 
virtual void set_zero_adjoint ()
 Set the adjoint value of this variable to 0.
 
- Public Member Functions inherited from stan::agrad::chainable
 chainable ()
 Construct a chainable object.
 
virtual ~chainable ()
 Chainables are not destructible and should go on the function call stack or be allocated with operator new.
 
+ + + + + + + +

+Protected Attributes

size_t size_
 
vari ** dtrs_
 
double * partials_
 
+ + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::agrad::vari
static void * operator new (size_t nbytes)
 Allocate memory from the underlying memory pool.
 
static void recover_memory ()
 Recover memory used for all variables for reuse.
 
static void free_memory ()
 Return all memory used for gradients back to the system.
 
- Public Attributes inherited from stan::agrad::vari
const double val_
 The value of this variable.
 
double adj_
 The adjoint of this variable, which is the partial derivative of this variable with respect to the root variable.
 
+

Detailed Description

+

A var implementation that stores the daughter variable implementation pointers and the partial derivative with respect to the result explicitly in arrays constructed on the auto-diff memory stack.

+

Like a simplified version of OperandsAndPartials.

+ +

Definition at line 18 of file stored_gradient_vari.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::agrad::stored_gradient_vari::stored_gradient_vari (double value,
size_t size,
vari ** dtrs,
double * partials 
)
+
+inline
+
+ +

Construct a stored gradient vari with the specified value, size, daughter varis, and partial derivatives.

+
Parameters
+ + + + + +
[in]valueValue of vari
[in]sizeNumber of daughters
[in]dtrsArray of pointers to daughters
[in]partialsPartial derivatives of value with respect to daughters.
+
+
+ +

Definition at line 38 of file stored_gradient_vari.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + +
void stan::agrad::stored_gradient_vari::chain ()
+
+inlinevirtual
+
+ +

Propagate derivatives through this vari with partial derivatives given for the daughter vari by the stored partials.

+ +

Reimplemented from stan::agrad::vari.

+ +

Definition at line 52 of file stored_gradient_vari.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
vari** stan::agrad::stored_gradient_vari::dtrs_
+
+protected
+
+ +

Definition at line 23 of file stored_gradient_vari.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
double* stan::agrad::stored_gradient_vari::partials_
+
+protected
+
+ +

Definition at line 24 of file stored_gradient_vari.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
size_t stan::agrad::stored_gradient_vari::size_
+
+protected
+
+ +

Definition at line 22 of file stored_gradient_vari.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1stored__gradient__vari.png b/doc/api/html/classstan_1_1agrad_1_1stored__gradient__vari.png new file mode 100644 index 0000000000000000000000000000000000000000..7f80b01ef065bad2376b0eee4ccb8d38b9980aa5 GIT binary patch literal 1049 zcmeAS@N?(olHy`uVBq!ia0vp^M}fG5gBeIBDBLdqQW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;CT*GiYtg6jU?a9N z->=WbCWRENbd@;W_B4A=%CF5le)h-STZFZL+ESAF>ncl-&D9A@&gX2Mq1HXWa$?X4 zyO;YbKUr-l%A9=h?DQr2Z#HPmD>HT$^Zsb1`+Dl40O1{H7FC=%%af|J^|*Mq>f-3i zyi>ipTa(ML_Xg;#-xT4U-8O4dYRsg4#TD^ibnp4E;rTlK{`MUO@hQK{tjboIo^iie z~xxU!T+Pyme@yd6&xHE@Rzo+b>20Yu_9Vg}Wfy}<+G%4qUb+>|N_0N)v3!9$l zsJvuo*FCgj#)g_+@7e!!nlJZ%wC=mQ&^29&?`$V9co&P=zxINM*VNJ#e%(g@_bz_+ z^3jr;L0V^(;+Ch{zY6iZb#T3v)>r4`z+*|;rI$V}wBHz!+5P7no2RI4x0L6tlbOF4 zO4qBf^awgSRc!x`os+gS zd(U^Rnd^CJYYZ@iN^J8KJ%Jwg+;lL*kmqngIfLFa)`Due#E(_Bj*kV!79U|YnV0x5 zU8F&jV5lGmT8?6iKpsEigJ-btoO)Do>8nLwrQ%ojbNZe;-u-BSC3i!Uu6I>*Py4&` zyOrzy@}yipzj1zm%xdSmQm;E-PhFO=t;u3W&Ar2yw|?C`gL{clp<`(d-|~$*A`5;U z`8g~5{^r_MA%C@WUOk%XdN18O@9yTxJ$}(yEDIK`*&es@$NKDxJNLa=@#Vm+$nJ=o zhPbHXi)QbL%FJ726tMNb&7JKp?sxv%9JBkVulv^W^;>Z?4Q(e)9JN*{DmOnzg)R>=#>2oo2kM%wJmnw9Suq zcJD*$Ov-6A(q+cpE*!`Y&^m!CRwB`Cs3;UQ1+M(&mAgV>+(A}Tx Y+4cb!415IQf%%xh)78&qol`;+0OiW;I{*Lx literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1agrad_1_1var-members.html b/doc/api/html/classstan_1_1agrad_1_1var-members.html new file mode 100644 index 00000000000..295194f9a77 --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1var-members.html @@ -0,0 +1,170 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::agrad::var Member List
+
+
+ +

This is the complete list of members for stan::agrad::var, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
adj() const stan::agrad::varinline
grad(std::vector< var > &x, std::vector< double > &g)stan::agrad::varinline
grad()stan::agrad::varinline
grad(std::vector< var > &x, std::vector< double > &g)stan::agrad::varinline
grad()stan::agrad::varinline
is_uninitialized()stan::agrad::varinline
operator*()stan::agrad::varinline
operator*=(const var &b)stan::agrad::varinline
operator*=(const double &b)stan::agrad::varinline
operator*=(const var &b)stan::agrad::varinline
operator*=(const double b)stan::agrad::varinline
operator+=(const var &b)stan::agrad::varinline
operator+=(const double &b)stan::agrad::varinline
operator+=(const var &b)stan::agrad::varinline
operator+=(const double b)stan::agrad::varinline
operator-=(const var &b)stan::agrad::varinline
operator-=(const double &b)stan::agrad::varinline
operator-=(const var &b)stan::agrad::varinline
operator-=(const double b)stan::agrad::varinline
operator->()stan::agrad::varinline
operator/=(const var &b)stan::agrad::varinline
operator/=(const double &b)stan::agrad::varinline
operator/=(const var &b)stan::agrad::varinline
operator/=(const double b)stan::agrad::varinline
operator<<(std::ostream &os, const var &v)stan::agrad::varfriend
Scalar typedefstan::agrad::var
Scalar typedefstan::agrad::var
val() const stan::agrad::varinline
val() const stan::agrad::varinline
var(vari *vi)stan::agrad::varinlineexplicit
var()stan::agrad::varinline
var(bool b)stan::agrad::varinline
var(char c)stan::agrad::varinline
var(short n)stan::agrad::varinline
var(unsigned short n)stan::agrad::varinline
var(int n)stan::agrad::varinline
var(unsigned int n)stan::agrad::varinline
var(long int n)stan::agrad::varinline
var(unsigned long int n)stan::agrad::varinline
var(float x)stan::agrad::varinline
var(double x)stan::agrad::varinline
var(long double x)stan::agrad::varinline
var(vari *vi)stan::agrad::varinlineexplicit
var()stan::agrad::varinline
var(bool b)stan::agrad::varinline
var(char c)stan::agrad::varinline
var(short n)stan::agrad::varinline
var(unsigned short n)stan::agrad::varinline
var(int n)stan::agrad::varinline
var(unsigned int n)stan::agrad::varinline
var(long int n)stan::agrad::varinline
var(unsigned long int n)stan::agrad::varinline
var(unsigned long long n)stan::agrad::varinline
var(long long n)stan::agrad::varinline
var(float x)stan::agrad::varinline
var(double x)stan::agrad::varinline
var(long double x)stan::agrad::varinline
vi_stan::agrad::var
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1var.html b/doc/api/html/classstan_1_1agrad_1_1var.html new file mode 100644 index 00000000000..0d386165dfc --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1var.html @@ -0,0 +1,2247 @@ + + + + + +Stan: stan::agrad::var Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::agrad::var Class Reference
+
+
+ +

Independent (input) and dependent (output) variables for gradients. + More...

+ +

#include <agrad_thread_safe.hpp>

+ + + + + + +

+Public Types

typedef double Scalar
 
typedef double Scalar
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 var (vari *vi)
 Construct a variable from a pointer to a variable implementation.
 
 var ()
 Construct a variable for later assignment.
 
 var (bool b)
 Construct a variable by static casting the specified value to double.
 
 var (char c)
 Construct a variable by static casting the specified value to double.
 
 var (short n)
 Construct a variable by static casting the specified value to double.
 
 var (unsigned short n)
 Construct a variable by static casting the specified value to double.
 
 var (int n)
 Construct a variable by static casting the specified value to double.
 
 var (unsigned int n)
 Construct a variable by static casting the specified value to double.
 
 var (long int n)
 Construct a variable by static casting the specified value to double.
 
 var (unsigned long int n)
 Construct a variable by static casting the specified value to double.
 
 var (float x)
 Construct a variable by static casting the specified value to double.
 
 var (double x)
 Construct a variable with the specified value.
 
 var (long double x)
 Construct a variable by static casting the specified value to double.
 
double val () const
 Return the value of this variable.
 
void grad (std::vector< var > &x, std::vector< double > &g)
 Compute the gradient of this dependent variable with respect to the specified vector of independent variables, assigning the gradients componentwise to the specified vector of gradients.
 
void grad ()
 Compute gradients of this dependent variable with respect to all variables on which it depends.
 
varoperator+= (const var &b)
 The compound add/assignment operator for variables (C++).
 
varoperator+= (const double &b)
 The compound add/assignment operator for scalars (C++).
 
varoperator-= (const var &b)
 The compound subtract/assignment operator for variables (C++).
 
varoperator-= (const double &b)
 The compound subtract/assignment operator for scalars (C++).
 
varoperator*= (const var &b)
 The compound multiply/assignment operator for variables (C++).
 
varoperator*= (const double &b)
 The compound multiply/assignment operator for scalars (C++).
 
varoperator/= (const var &b)
 The compound divide/assignment operator for variables (C++).
 
varoperator/= (const double &b)
 The compound divide/assignment operator for scalars (C++).
 
bool is_uninitialized ()
 Return true if this variable has been declared, but not been defined.
 
 var (vari *vi)
 Construct a variable from a pointer to a variable implementation.
 
 var ()
 Construct a variable for later assignment.
 
 var (bool b)
 Construct a variable by static casting the specified value to double.
 
 var (char c)
 Construct a variable by static casting the specified value to double.
 
 var (short n)
 Construct a variable by static casting the specified value to double.
 
 var (unsigned short n)
 Construct a variable by static casting the specified value to double.
 
 var (int n)
 Construct a variable by static casting the specified value to double.
 
 var (unsigned int n)
 Construct a variable by static casting the specified value to double.
 
 var (long int n)
 Construct a variable by static casting the specified value to double.
 
 var (unsigned long int n)
 Construct a variable by static casting the specified value to double.
 
 var (unsigned long long n)
 Construct a variable by static casting the specified value to double.
 
 var (long long n)
 Construct a variable by static casting the specified value to double.
 
 var (float x)
 Construct a variable by static casting the specified value to double.
 
 var (double x)
 Construct a variable with the specified value.
 
 var (long double x)
 Construct a variable by static casting the specified value to double.
 
double val () const
 Return the value of this variable.
 
double adj () const
 Return the derivative of the root expression with respect to this expression.
 
void grad (std::vector< var > &x, std::vector< double > &g)
 Compute the gradient of this (dependent) variable with respect to the specified vector of (independent) variables, assigning the specified vector to the gradient.
 
void grad ()
 Compute gradients of this dependent variable with respect to all variables on which it depends.
 
varioperator* ()
 Return a reference to underlying implementation of this variable.
 
varioperator-> ()
 Return a pointer to the underlying implementation of this variable.
 
varoperator+= (const var &b)
 The compound add/assignment operator for variables (C++).
 
varoperator+= (const double b)
 The compound add/assignment operator for scalars (C++).
 
varoperator-= (const var &b)
 The compound subtract/assignment operator for variables (C++).
 
varoperator-= (const double b)
 The compound subtract/assignment operator for scalars (C++).
 
varoperator*= (const var &b)
 The compound multiply/assignment operator for variables (C++).
 
varoperator*= (const double b)
 The compound multiply/assignment operator for scalars (C++).
 
varoperator/= (const var &b)
 The compound divide/assignment operator for variables (C++).
 
varoperator/= (const double b)
 The compound divide/assignment operator for scalars (C++).
 
+ + + + +

+Public Attributes

varivi_
 Pointer to the implementation of this variable.
 
+ + + + +

+Friends

std::ostream & operator<< (std::ostream &os, const var &v)
 Write the value of this auto-dif variable and its adjoint to the specified output stream.
 
+

Detailed Description

+

Independent (input) and dependent (output) variables for gradients.

+

An agrad::var is constructed with a double and used like any other scalar. Arithmetical functions like negation, addition, and subtraction, as well as a range of mathematical functions like exponentiation and powers are overridden to operate on agrad::var values objects.

+

This class acts as a smart pointer, with resources managed by an agenda-based memory manager scoped to a single gradient calculation.

+

An agrad::var is constructed with a double and used like any other scalar. Arithmetical functions like negation, addition, and subtraction, as well as a range of mathematical functions like exponentiation and powers are overridden to operate on agrad::var values objects.

+ +

Definition at line 701 of file agrad_thread_safe.hpp.

+

Member Typedef Documentation

+ +
+
+ + + + +
typedef double stan::agrad::var::Scalar
+
+ +

Definition at line 32 of file var.hpp.

+ +
+
+ +
+
+ + + + +
typedef double stan::agrad::var::Scalar
+
+ +

Definition at line 704 of file agrad_thread_safe.hpp.

+ +
+
+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::agrad::var::var (varivi)
+
+inlineexplicit
+
+ +

Construct a variable from a pointer to a variable implementation.

+
Parameters
+ + +
viVariable implementation.
+
+
+ +

Definition at line 720 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
stan::agrad::var::var ()
+
+inline
+
+ +

Construct a variable for later assignment.

+

This is implemented as a no-op, leaving the underlying implementation dangling. Before an assignment, the behavior is thus undefined just as for a basic double.

+ +

Definition at line 731 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
stan::agrad::var::var (bool b)
+
+inline
+
+ +

Construct a variable by static casting the specified value to double.

+
Parameters
+ + +
bValue.
+
+
+ +

Definition at line 741 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
stan::agrad::var::var (char c)
+
+inline
+
+ +

Construct a variable by static casting the specified value to double.

+
Parameters
+ + +
cValue.
+
+
+ +

Definition at line 751 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
stan::agrad::var::var (short n)
+
+inline
+
+ +

Construct a variable by static casting the specified value to double.

+
Parameters
+ + +
nValue.
+
+
+ +

Definition at line 761 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
stan::agrad::var::var (unsigned short n)
+
+inline
+
+ +

Construct a variable by static casting the specified value to double.

+
Parameters
+ + +
nValue.
+
+
+ +

Definition at line 771 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
stan::agrad::var::var (int n)
+
+inline
+
+ +

Construct a variable by static casting the specified value to double.

+
Parameters
+ + +
nValue.
+
+
+ +

Definition at line 781 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
stan::agrad::var::var (unsigned int n)
+
+inline
+
+ +

Construct a variable by static casting the specified value to double.

+
Parameters
+ + +
nValue.
+
+
+ +

Definition at line 791 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
stan::agrad::var::var (long int n)
+
+inline
+
+ +

Construct a variable by static casting the specified value to double.

+
Parameters
+ + +
nValue.
+
+
+ +

Definition at line 801 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
stan::agrad::var::var (unsigned long int n)
+
+inline
+
+ +

Construct a variable by static casting the specified value to double.

+
Parameters
+ + +
nValue.
+
+
+ +

Definition at line 811 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
stan::agrad::var::var (float x)
+
+inline
+
+ +

Construct a variable by static casting the specified value to double.

+
Parameters
+ + +
xValue.
+
+
+ +

Definition at line 821 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
stan::agrad::var::var (double x)
+
+inline
+
+ +

Construct a variable with the specified value.

+
Parameters
+ + +
xValue of the variable.
+
+
+ +

Definition at line 830 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
stan::agrad::var::var (long double x)
+
+inline
+
+ +

Construct a variable by static casting the specified value to double.

+
Parameters
+ + +
xValue.
+
+
+ +

Definition at line 840 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
stan::agrad::var::var (varivi)
+
+inlineexplicit
+
+ +

Construct a variable from a pointer to a variable implementation.

+
Parameters
+ + +
viVariable implementation.
+
+
+ +

Definition at line 61 of file var.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
stan::agrad::var::var ()
+
+inline
+
+ +

Construct a variable for later assignment.

+

This is implemented as a no-op, leaving the underlying implementation dangling. Before an assignment, the behavior is thus undefined just as for a basic double.

+ +

Definition at line 72 of file var.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
stan::agrad::var::var (bool b)
+
+inline
+
+ +

Construct a variable by static casting the specified value to double.

+
Parameters
+ + +
bValue.
+
+
+ +

Definition at line 82 of file var.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
stan::agrad::var::var (char c)
+
+inline
+
+ +

Construct a variable by static casting the specified value to double.

+
Parameters
+ + +
cValue.
+
+
+ +

Definition at line 92 of file var.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
stan::agrad::var::var (short n)
+
+inline
+
+ +

Construct a variable by static casting the specified value to double.

+
Parameters
+ + +
nValue.
+
+
+ +

Definition at line 102 of file var.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
stan::agrad::var::var (unsigned short n)
+
+inline
+
+ +

Construct a variable by static casting the specified value to double.

+
Parameters
+ + +
nValue.
+
+
+ +

Definition at line 112 of file var.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
stan::agrad::var::var (int n)
+
+inline
+
+ +

Construct a variable by static casting the specified value to double.

+
Parameters
+ + +
nValue.
+
+
+ +

Definition at line 122 of file var.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
stan::agrad::var::var (unsigned int n)
+
+inline
+
+ +

Construct a variable by static casting the specified value to double.

+
Parameters
+ + +
nValue.
+
+
+ +

Definition at line 132 of file var.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
stan::agrad::var::var (long int n)
+
+inline
+
+ +

Construct a variable by static casting the specified value to double.

+
Parameters
+ + +
nValue.
+
+
+ +

Definition at line 142 of file var.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
stan::agrad::var::var (unsigned long int n)
+
+inline
+
+ +

Construct a variable by static casting the specified value to double.

+
Parameters
+ + +
nValue.
+
+
+ +

Definition at line 152 of file var.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
stan::agrad::var::var (unsigned long long n)
+
+inline
+
+ +

Construct a variable by static casting the specified value to double.

+
Parameters
+ + +
nValue.
+
+
+ +

Definition at line 162 of file var.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
stan::agrad::var::var (long long n)
+
+inline
+
+ +

Construct a variable by static casting the specified value to double.

+
Parameters
+ + +
nValue.
+
+
+ +

Definition at line 172 of file var.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
stan::agrad::var::var (float x)
+
+inline
+
+ +

Construct a variable by static casting the specified value to double.

+
Parameters
+ + +
xValue.
+
+
+ +

Definition at line 182 of file var.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
stan::agrad::var::var (double x)
+
+inline
+
+ +

Construct a variable with the specified value.

+
Parameters
+ + +
xValue of the variable.
+
+
+ +

Definition at line 191 of file var.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
stan::agrad::var::var (long double x)
+
+inline
+
+ +

Construct a variable by static casting the specified value to double.

+
Parameters
+ + +
xValue.
+
+
+ +

Definition at line 201 of file var.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + +
double stan::agrad::var::adj () const
+
+inline
+
+ +

Return the derivative of the root expression with respect to this expression.

+

This method only works after one of the grad() methods has been called.

+
Returns
Adjoint value for this variable.
+ +

Definition at line 222 of file var.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::agrad::var::grad (std::vector< var > & x,
std::vector< double > & g 
)
+
+inline
+
+ +

Compute the gradient of this (dependent) variable with respect to the specified vector of (independent) variables, assigning the specified vector to the gradient.

+

After the computation of the gradient and value, memory is recovered.

+
Parameters
+ + + +
xVector of independent variables.
gGradient vector of partial derivatives of this variable with respect to x.
+
+
+ +

Definition at line 238 of file var.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
void stan::agrad::var::grad ()
+
+inline
+
+ +

Compute gradients of this dependent variable with respect to all variables on which it depends.

+

Memory is recovered, but not freed after this operation, calling recover_memory(); see free_all() to release resources back to the system rather than saving them for reuse).

+

Until the next creation of a stan::agrad::var instance, the gradient values will be available from an instance x of stan::agrad::var via x.adj(). It may be slightly more efficient to do this without the intermediate creation and population of two vectors as done in the two-argument form grad(std::vector<var>&, std::vector<double>&).

+ +

Definition at line 263 of file var.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::agrad::var::grad (std::vector< var > & x,
std::vector< double > & g 
)
+
+inline
+
+ +

Compute the gradient of this dependent variable with respect to the specified vector of independent variables, assigning the gradients componentwise to the specified vector of gradients.

+

After the computation of the gradient and value, memory is recovered.

+
Parameters
+ + + +
xVector of independent variables.
gGradient vector of partial derivatives of this variable with respect to x.
+
+
+ +

Definition at line 865 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
void stan::agrad::var::grad ()
+
+inline
+
+ +

Compute gradients of this dependent variable with respect to all variables on which it depends.

+

Memory is recovered, but not freed after this operation, calling vari::recover_memory(); see vari::free_all() to release resources back to the system rather than saving them for reuse).

+

Until the next creation of a stan::agrad::var instance, the gradient values will be available from an instance x of stan::agrad::var via x.vi_->adj_. It may be slightly more efficient to do this without the intermediate creation and population of two vectors as done in the two-argument form grad(std::vector<var>&, std::vector<double>&).

+ +

Definition at line 890 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
bool stan::agrad::var::is_uninitialized ()
+
+inline
+
+ +

Return true if this variable has been declared, but not been defined.

+

Any attempt to use an undefined variable's value or adjoint will result in a segmentation fault.

+
Returns
true if this variable does not yet have a defined variable.
+ +

Definition at line 52 of file var.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
vari& stan::agrad::var::operator* ()
+
+inline
+
+ +

Return a reference to underlying implementation of this variable.

+

If x is of type var, then applying this operator, *x, has the same behavior as *(x.vi_).

+

Warning: The returned reference does not track changes to this variable.

+
Returns
variable
+ +

Definition at line 282 of file var.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var& stan::agrad::var::operator*= (const varb)
+
+inline
+
+ +

The compound multiply/assignment operator for variables (C++).

+

If this variable is a and the argument is the variable b, then (a *= b) behaves exactly the same way as (a = a * b). Note that the result is an assignable lvalue.

+
Parameters
+ + +
bThe variable to multiply this variable by.
+
+
+
Returns
The result of multiplying this variable by the specified variable.
+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var & stan::agrad::var::operator*= (const double b)
+
+inline
+
+ +

The compound multiply/assignment operator for scalars (C++).

+

If this variable is a and the argument is the scalar b, then (a *= b) behaves exactly the same way as (a = a * b). Note that the result is an assignable lvalue.

+
Parameters
+ + +
bThe scalar to multiply this variable by.
+
+
+
Returns
The result of multplying this variable by the specified variable.
+ +

Definition at line 15 of file operator_multiply_equal.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var & stan::agrad::var::operator*= (const varb)
+
+inline
+
+ +

The compound multiply/assignment operator for variables (C++).

+

If this variable is a and the argument is the variable b, then (a *= b) behaves exactly the same way as (a = a * b). Note that the result is an assignable lvalue.

+
Parameters
+ + +
bThe variable to multiply this variable by.
+
+
+
Returns
The result of multiplying this variable by the specified variable.
+ +

Definition at line 970 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var& stan::agrad::var::operator*= (const double & b)
+
+inline
+
+ +

The compound multiply/assignment operator for scalars (C++).

+

If this variable is a and the argument is the scalar b, then (a *= b) behaves exactly the same way as (a = a * b). Note that the result is an assignable lvalue.

+
Parameters
+ + +
bThe scalar to multiply this variable by.
+
+
+
Returns
The result of multplying this variable by the specified variable.
+ +

Definition at line 986 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var& stan::agrad::var::operator+= (const varb)
+
+inline
+
+ +

The compound add/assignment operator for variables (C++).

+

If this variable is a and the argument is the variable b, then (a += b) behaves exactly the same way as (a = a + b), creating an intermediate variable representing (a + b).

+
Parameters
+ + +
bThe variable to add to this variable.
+
+
+
Returns
The result of adding the specified variable to this variable.
+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var & stan::agrad::var::operator+= (const double b)
+
+inline
+
+ +

The compound add/assignment operator for scalars (C++).

+

If this variable is a and the argument is the scalar b, then (a += b) behaves exactly the same way as (a = a + b). Note that the result is an assignable lvalue.

+
Parameters
+ + +
bThe scalar to add to this variable.
+
+
+
Returns
The result of adding the specified variable to this variable.
+ +

Definition at line 15 of file operator_plus_equal.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var & stan::agrad::var::operator+= (const varb)
+
+inline
+
+ +

The compound add/assignment operator for variables (C++).

+

If this variable is a and the argument is the variable b, then (a += b) behaves exactly the same way as (a = a + b), creating an intermediate variable representing (a + b).

+
Parameters
+ + +
bThe variable to add to this variable.
+
+
+
Returns
The result of adding the specified variable to this variable.
+ +

Definition at line 907 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var& stan::agrad::var::operator+= (const double & b)
+
+inline
+
+ +

The compound add/assignment operator for scalars (C++).

+

If this variable is a and the argument is the scalar b, then (a += b) behaves exactly the same way as (a = a + b). Note that the result is an assignable lvalue.

+
Parameters
+ + +
bThe scalar to add to this variable.
+
+
+
Returns
The result of adding the specified variable to this variable.
+ +

Definition at line 922 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var& stan::agrad::var::operator-= (const varb)
+
+inline
+
+ +

The compound subtract/assignment operator for variables (C++).

+

If this variable is a and the argument is the variable b, then (a -= b) behaves exactly the same way as (a = a - b). Note that the result is an assignable lvalue.

+
Parameters
+ + +
bThe variable to subtract from this variable.
+
+
+
Returns
The result of subtracting the specified variable from this variable.
+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var & stan::agrad::var::operator-= (const double b)
+
+inline
+
+ +

The compound subtract/assignment operator for scalars (C++).

+

If this variable is a and the argument is the scalar b, then (a -= b) behaves exactly the same way as (a = a - b). Note that the result is an assignable lvalue.

+
Parameters
+ + +
bThe scalar to subtract from this variable.
+
+
+
Returns
The result of subtracting the specified variable from this variable.
+ +

Definition at line 15 of file operator_minus_equal.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var & stan::agrad::var::operator-= (const varb)
+
+inline
+
+ +

The compound subtract/assignment operator for variables (C++).

+

If this variable is a and the argument is the variable b, then (a -= b) behaves exactly the same way as (a = a - b). Note that the result is an assignable lvalue.

+
Parameters
+ + +
bThe variable to subtract from this variable.
+
+
+
Returns
The result of subtracting the specified variable from this variable.
+ +

Definition at line 938 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var& stan::agrad::var::operator-= (const double & b)
+
+inline
+
+ +

The compound subtract/assignment operator for scalars (C++).

+

If this variable is a and the argument is the scalar b, then (a -= b) behaves exactly the same way as (a = a - b). Note that the result is an assignable lvalue.

+
Parameters
+ + +
bThe scalar to subtract from this variable.
+
+
+
Returns
The result of subtracting the specified variable from this variable.
+ +

Definition at line 954 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
vari* stan::agrad::var::operator-> ()
+
+inline
+
+ +

Return a pointer to the underlying implementation of this variable.

+

If x is of type var, then applying this operator, x->, behaves the same way as x.vi_->.

+

Warning: The returned result does not track changes to this variable.

+ +

Definition at line 296 of file var.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var& stan::agrad::var::operator/= (const varb)
+
+inline
+
+ +

The compound divide/assignment operator for variables (C++).

+

If this variable is a and the argument is the variable b, then (a /= b) behaves exactly the same way as (a = a / b). Note that the result is an assignable lvalue.

+
Parameters
+ + +
bThe variable to divide this variable by.
+
+
+
Returns
The result of dividing this variable by the specified variable.
+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var & stan::agrad::var::operator/= (const double b)
+
+inline
+
+ +

The compound divide/assignment operator for scalars (C++).

+

If this variable is a and the argument is the scalar b, then (a /= b) behaves exactly the same way as (a = a / b). Note that the result is an assignable lvalue.

+
Parameters
+ + +
bThe scalar to divide this variable by.
+
+
+
Returns
The result of dividing this variable by the specified variable.
+ +

Definition at line 15 of file operator_divide_equal.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var & stan::agrad::var::operator/= (const varb)
+
+inline
+
+ +

The compound divide/assignment operator for variables (C++).

+

If this variable is a and the argument is the variable b, then (a /= b) behaves exactly the same way as (a = a / b). Note that the result is an assignable lvalue.

+
Parameters
+ + +
bThe variable to divide this variable by.
+
+
+
Returns
The result of dividing this variable by the specified variable.
+ +

Definition at line 1001 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var& stan::agrad::var::operator/= (const double & b)
+
+inline
+
+ +

The compound divide/assignment operator for scalars (C++).

+

If this variable is a and the argument is the scalar b, then (a /= b) behaves exactly the same way as (a = a / b). Note that the result is an assignable lvalue.

+
Parameters
+ + +
bThe scalar to divide this variable by.
+
+
+
Returns
The result of dividing this variable by the specified variable.
+ +

Definition at line 1017 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
double stan::agrad::var::val () const
+
+inline
+
+ +

Return the value of this variable.

+
Returns
The value of this variable.
+ +

Definition at line 210 of file var.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
double stan::agrad::var::val () const
+
+inline
+
+ +

Return the value of this variable.

+
Returns
The value of this variable.
+ +

Definition at line 849 of file agrad_thread_safe.hpp.

+ +
+
+

Friends And Related Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
std::ostream& operator<< (std::ostream & os,
const varv 
)
+
+friend
+
+ +

Write the value of this auto-dif variable and its adjoint to the specified output stream.

+
Parameters
+ + + +
osOutput stream to which to write.
vVariable to write.
+
+
+
Returns
Reference to the specified output stream.
+ +

Definition at line 411 of file var.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
vari * stan::agrad::var::vi_
+
+ +

Pointer to the implementation of this variable.

+

This value should not be modified, but may be accessed in var operators to construct vari instances.

+ +

Definition at line 713 of file agrad_thread_safe.hpp.

+ +
+
+
The documentation for this class was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1vari-members.html b/doc/api/html/classstan_1_1agrad_1_1vari-members.html new file mode 100644 index 00000000000..300d7700ac8 --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1vari-members.html @@ -0,0 +1,129 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::agrad::vari Member List
+
+
+ +

This is the complete list of members for stan::agrad::vari, including all inherited members.

+ + + + + + + + + + + + + + + + + + +
adj_stan::agrad::vari
chain()stan::agrad::variinlinevirtual
chainable()stan::agrad::chainableinline
free_memory()stan::agrad::variinlinestatic
init_dependent()stan::agrad::variinlinevirtual
operator delete(void *)stan::agrad::chainableinlinestatic
operator new(size_t nbytes)stan::agrad::variinlinestatic
operator<<(std::ostream &os, const vari *v)stan::agrad::varifriend
recover_memory()stan::agrad::variinlinestatic
set_zero_adjoint()stan::agrad::variinlinevirtual
val_stan::agrad::vari
var classstan::agrad::varifriend
vari(const double x)stan::agrad::variinline
vari(const double x)stan::agrad::variinline
vari(const double x, bool stacked)stan::agrad::variinline
~chainable()stan::agrad::chainableinlinevirtual
~vari()stan::agrad::variinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1vari.html b/doc/api/html/classstan_1_1agrad_1_1vari.html new file mode 100644 index 00000000000..c34f2464091 --- /dev/null +++ b/doc/api/html/classstan_1_1agrad_1_1vari.html @@ -0,0 +1,660 @@ + + + + + +Stan: stan::agrad::vari Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+ +
+ +

The variable implementation base class. + More...

+ +

#include <agrad_thread_safe.hpp>

+
+Inheritance diagram for stan::agrad::vari:
+
+
+ + +stan::agrad::chainable +stan::agrad::op_ddv_vari +stan::agrad::op_ddv_vari +stan::agrad::op_dv_vari +stan::agrad::op_dv_vari +stan::agrad::op_dvd_vari +stan::agrad::op_dvd_vari +stan::agrad::op_dvv_vari +stan::agrad::op_dvv_vari +stan::agrad::op_matrix_vari +stan::agrad::op_v_vari +stan::agrad::op_v_vari +stan::agrad::op_vd_vari +stan::agrad::op_vd_vari +stan::agrad::op_vdd_vari +stan::agrad::op_vdd_vari +stan::agrad::op_vdv_vari +stan::agrad::op_vdv_vari +stan::agrad::op_vector_vari +stan::agrad::op_vv_vari +stan::agrad::op_vv_vari +stan::agrad::op_vvd_vari +stan::agrad::op_vvd_vari +stan::agrad::op_vvv_vari +stan::agrad::op_vvv_vari +stan::agrad::partials_vari +stan::agrad::stored_gradient_vari + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 vari (const double x)
 Construct a variable implementation from a value.
 
virtual void chain ()
 Apply the chain rule to this variable based on the variables on which it depends.
 
 vari (const double x)
 Construct a variable implementation from a value.
 
 vari (const double x, bool stacked)
 
virtual ~vari ()
 Throw an illegal argument exception.
 
virtual void init_dependent ()
 Initialize the adjoint for this (dependent) variable to 1.
 
virtual void set_zero_adjoint ()
 Set the adjoint value of this variable to 0.
 
- Public Member Functions inherited from stan::agrad::chainable
 chainable ()
 Construct a chainable object.
 
virtual ~chainable ()
 Chainables are not destructible and should go on the function call stack or be allocated with operator new.
 
+ + + + + + + + + + + + + + + + + +

+Static Public Member Functions

static void * operator new (size_t nbytes)
 Allocate memory from the underlying memory pool.
 
static void recover_memory ()
 Recover memory used for all variables for reuse.
 
static void free_memory ()
 Return all memory used for gradients back to the system.
 
- Static Public Member Functions inherited from stan::agrad::chainable
static void * operator new (size_t nbytes)
 Allocate memory from the underlying memory pool.
 
static void operator delete (void *)
 Delete a pointer from the underlying memory pool.
 
+ + + + + + + +

+Public Attributes

const double val_
 The value of this variable.
 
double adj_
 The adjoint of this variable, which is the partial derivative of this variable with respect to the root variable.
 
+ + + + + + +

+Friends

class var
 
std::ostream & operator<< (std::ostream &os, const vari *v)
 Insertion operator for vari.
 
+

Detailed Description

+

The variable implementation base class.

+

A variable implementation is constructed with a constant value. It also stores the adjoint for storing the partial derivative with respect to the root of the derivative tree.

+

The chain() method applies the chain rule. Concrete extensions of this class will represent base variables or the result of operations such as addition or subtraction. These extended classes will store operand variables and propagate derivative information via an implementation of chain().

+ +

Definition at line 53 of file agrad_thread_safe.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::agrad::vari::vari (const double x)
+
+inline
+
+ +

Construct a variable implementation from a value.

+

The adjoint is initialized to zero.

+

All constructed variables are added to the stack. Variables should be constructed before variables on which they depend to insure proper partial derivative propagation. During derivative propagation, the chain() method of each variable will be called in the reverse order of construction.

+
Parameters
+ + +
xValue of the constructed variable.
+
+
+ +

Definition at line 82 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
stan::agrad::vari::vari (const double x)
+
+inline
+
+ +

Construct a variable implementation from a value.

+

The adjoint is initialized to zero.

+

All constructed variables are added to the stack. Variables should be constructed before variables on which they depend to insure proper partial derivative propagation. During derivative propagation, the chain() method of each variable will be called in the reverse order of construction.

+
Parameters
+ + +
xValue of the constructed variable.
+
+
+ +

Definition at line 57 of file vari.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
stan::agrad::vari::vari (const double x,
bool stacked 
)
+
+inline
+
+ +

Definition at line 63 of file vari.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
virtual stan::agrad::vari::~vari ()
+
+inlinevirtual
+
+ +

Throw an illegal argument exception.

+

Warning: Destructors should never called for agrad objects.

+
Exceptions
+ + +
Logicexception always.
+
+
+ +

Definition at line 79 of file vari.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + +
virtual void stan::agrad::vari::chain ()
+
+inlinevirtual
+
+ +

Apply the chain rule to this variable based on the variables on which it depends.

+

The base implementation in this class is a no-op.

+ +

Reimplemented from stan::agrad::chainable.

+ +

Reimplemented in stan::agrad::stored_gradient_vari, and stan::agrad::partials_vari.

+ +

Definition at line 93 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
static void stan::agrad::vari::free_memory ()
+
+inlinestatic
+
+ +

Return all memory used for gradients back to the system.

+ +

Definition at line 123 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
virtual void stan::agrad::vari::init_dependent ()
+
+inlinevirtual
+
+ +

Initialize the adjoint for this (dependent) variable to 1.

+

This operation is applied to the dependent variable before propagating derivatives.

+ +

Reimplemented from stan::agrad::chainable.

+ +

Definition at line 88 of file vari.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
static void* stan::agrad::vari::operator new (size_t nbytes)
+
+inlinestatic
+
+ +

Allocate memory from the underlying memory pool.

+

This memory is is managed by the gradient program and will be recovered as a whole. Classes should not be allocated with this operator if they have non-trivial destructors.

+
Parameters
+ + +
nbytesNumber of bytes to allocate.
+
+
+
Returns
Pointer to allocated bytes.
+ +

Definition at line 105 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
static void stan::agrad::vari::recover_memory ()
+
+inlinestatic
+
+ +

Recover memory used for all variables for reuse.

+ +

Definition at line 114 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
virtual void stan::agrad::vari::set_zero_adjoint ()
+
+inlinevirtual
+
+ +

Set the adjoint value of this variable to 0.

+ +

Reimplemented from stan::agrad::chainable.

+ +

Definition at line 95 of file vari.hpp.

+ +
+
+

Friends And Related Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
std::ostream& operator<< (std::ostream & os,
const variv 
)
+
+friend
+
+ +

Insertion operator for vari.

+

Prints the current value and the adjoint value.

+
Parameters
+ + + +
os[in,out] ostream to modify
v[in] vari object to print.
+
+
+
Returns
The modified ostream.
+ +

Definition at line 108 of file vari.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
var
+
+friend
+
+ +

Definition at line 55 of file agrad_thread_safe.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
double stan::agrad::vari::adj_
+
+ +

The adjoint of this variable, which is the partial derivative of this variable with respect to the root variable.

+ +

Definition at line 68 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + +
const double stan::agrad::vari::val_
+
+ +

The value of this variable.

+ +

Definition at line 62 of file agrad_thread_safe.hpp.

+ +
+
+
The documentation for this class was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1agrad_1_1vari.png b/doc/api/html/classstan_1_1agrad_1_1vari.png new file mode 100644 index 0000000000000000000000000000000000000000..9f01ca59fd8523c85bdedf88335e23656ae77baa GIT binary patch literal 12307 zcmeHNdpy+n`k!{U+O1@F6S-yMl$|nEZV973l3U0SA*Kk)Wg>TGwA&sEk=&A)O*4#f z%WcMOsI0M(6b8+>R2CVH`wV6B=#?92+7<}7y?5MQ?pU(#mU%h4r#6P$O9tl71 z-MhE;N{<})@ne64xfKLlB>12;S?`BHRI-c@e`OuKhLyqaWB%~@+C=M*`22^Lp03T^ z`SnEi>j(JQ~Xg7QnH@R@MioE{0%G2Cht%NN5SR+f=5gb8W0bw08`4nMJY;9Av zUvl!+63gV~$Q!UF$4o69KZQ2pZz)4FvKx1nj&`X9FZzaTcJcOrd!IbGWWSZlt%zcx z;nq#+)i2uJ3v-^iFXXkBz*tI-E#0?@xEEWKOU}ab?zxp0_nD`wXEz+l`#VnOX)QIg zWP_KTblB4mq3y9P8NAKGcO%ea2K|8^iiWu`L{;HvpX^1*`6Sgt5Q07q((y7pZtF$F;SGmi%I3~%zxzDl zgJW@DuKDr^4kD(2fJA==g*03iyXXuq*eAdCyKUgZ43qW%teKUHlY32W?YQF^NEKchjTiLM%Rok~!)c*yJQv?^h1e?L+zr zQ(O37rR$zu>cd`)gh62ti_f8qpe9mM!)G^=hxmawh|)ZgH7YgLwNY;)1!bhaG|dUv zbJdo6Ue&C@DCA+p6VI2?Vi)xn;%()geq?b?gd2iQZG0wucf?=5H!O zaEDwLqdAA;k`kGvI!&A)tY0hx=PA6M4xZ}c4g%XHfl*l=KLXEVW z&5%VuP8W#tV5?hj~&%yUF%$;|6vF2w4?(ah^EUk%|PG6U}PRA!x^ zMZ7(b!_nvVEoCNwUJ|tad1^?m7^olY?@xGYu?p4w*ey_^;hZIu$P2%j)V{N%eWv20;KiHkiu9CQPv^s0a$u?E zG2G)DH3y1(i!kmqS@=;Cxo#LKFO$@n+E{Go;W^?p(C~eEQhIus3Y#-hU%^gu4K)iM zZL^^|G_Vr)>!}f|!<~6jVGj>d3_wxkd925&iJY6GjUP8?nh%H9MMp`X8N|T$%t-}= zy)}7$M%z`J)gZ0A2bSGiX+`hILEs3ap2CS{m(WXwx?S|Hi5hgTNvTIySA?%rq=8Ew zxMg1KP7k~yMsu%}qd$cb`*$F$C3G-}sVM&Wh&<&=&Fm^u96?!2{EYdAd;2ii=-egk z6$c_{_XFd`BUOcAK@dz@s>zy8^1do+%5rFu^illvT*-LNzr#kVF`I zm;U~|Pt!Mb;R^_I5)x5I*vfMBT53wkW?xHbZs$3A??S2oG!(*k88n5rpz(2Kgt0_z zS4CDsi~uw5UZ^+I3W~4}s&IUf+BhR0A6i&m^df{;mF(7Dm~+baOR5dN4_+^;0gD%- zp{5R0D_B`$cOk4D;wVqZ`g>0f#8{PDTI>EDM<_gy;tmj7gUJVoDg1?)u-5)U?Eft} zej~Y+-SQ1uT5JJT_Oae>g8-~WqF>dSfScP>e=J0{KW8@%YQ>i0=gS7$P9M>G@)#Sv z=(PBls2zSI2~Kthwbk`5P>FXbZR>1%MjeHTBitUyyY^Z|8o7O?-YL!wv`?J0@x9>X zd)7K={(Fu(=XyYB4E+h&rhROkUSO@kn0_^LmMA|M4#y%J>SJoXk5_xN&V2@j5gFm! zjFJq_%d0-)m&1aZf@{TtnhLf-iFc} z9-k3Mc3F9?PF#zLgQ>f85&48s+9xqd0Tz<-X=`aG96A^tW`NpSiW_cQ_6}}gbak6{ zj=;|8_uHFQOD}ZKi&u)Wi2ZrdNz?P;n608JT+(q?w(fu-=#xIvBSB4p^cc-5io#eg zbYR}T2TFDZjc&PBu3ObAi}>=h#fC5ptmw}sOf0;@BF^Cm+g}*s31ib92=mk*fv~?m zutL~lNhc3JdbOTfl$O7z{-?UTYZt1R5kalvZej@QP88SEgG1+%E##=5KHN>&RTJQ` zXQ1FE$2d(+islF}Mqj0z$>__{m?@x@@nGjpkS?Q@;?PCk{wwH0ZS0RSs;tD(#F3kz zXc~S=RUT9bLu6Ax^9UJ>3iOX=27!uN8{hxqAVaUGpJ+OEHFxZDDA6=-ZCc_7=VP&e zg!yqRyr)1|{^Z4wLwE$_gL~-T(_Q^L!m`HNq${A8@!>>sjZHK&9Y{u@3wYZfSZdZIlXIs7ZN!@ zC7`$I|1EFk=0qpHAeJ1>P;|xoykC+Dr=Q7liVtuopCcX*PtPCMsd>e)DNpCb$|baA zRkh^wLm3__eXs01_IZz*+s))=dmf2qij(&&Ox@^vZrNJSQP)8s$!%VAHXC^>awPV( zaT+IDj5hqgFD7pY#U%OcE%Yf`Uy_j}rF9lZz$CUN_*LNqME80X(YcKTOsUcJBKa+{ z>^&%6+!kwT_z@Fq&$WJa9o-iA021xv4J3+Lpvo92%dSL-q54OAzu&ttN9eF`o|I-t zrz=@>gm-fL`Q3o@;sZ)z=-siINhN(}lwFzbE}{#K%NX`lzQIrtm#=9TNSLf`G7h=n zn8-rc04jn#TuM4n8B1e7Q(vr$EH?Q_W`6c4f3_4bB->y-Kv1x9KN z7%7$H4?cyAZFx6@_??oDU#rCdyfBp6ei1oTj~T|DdJ>i{RxMg7M>}}WmoH{v_&W4?EFzEa$h_aeqkBBECG0L z)TQ>!(@kqyoIUelOjg;h$uMEz$xYs8dA?Q}JtI+m8�)ZQ>!-F_DLKJi6=%?!0vb zWAeMd%{J?#M+{P+()+iqgV{sfrs zm`meqfAL60_@XIW3;dkuQVguO&T~UXDpT)^KdALqG!xKH0XiPuiFI-}YWmFC3diP+Hwh=A%OvX3|E5@zoY@&?Lu=g=tCe?RdA3&x$*^ zcw3@!)UWhw3&IlaWlCLWd))3GFN&>qJ@ zdn~B@G9_13A{ZhgsQK8#&AxwYh0ly*-knVUKibuQIY+jF7oJajc05 z@-m`>On6aF>E529Q6#Yy&{n!kj5;W(HG1?~YyO&dBF4#CoIt*51Nml(hkSIA_j`wi zzg9|b1IyrCL0AKV-_(!-F`B00J2w>kc#|>PZnH|2_T(hc#-Z1+;0snX$*<~gAZUz` zqLmK7ZR7{%m)5T}N66Nc`eEZ0SV>KJ0}+`zAMeR{`K1!VTAF(_@{C)^vIE${9(eik z388OLA81HK=MH6|hGaa7cy%nmDy}dTvCutNpd=lKPK~BvOjEWZPbIYBO z+1LP7KczVegpv4s{gc8ll9a}OlBN+;zbkn;j6C4?CXD1;n8YyQl~#dmPBq=EX{7F2mUjn=a(%xyP=@_OzJZ3>1h^SUzhuI0qoPh#P$e3D z?+`-21@6sPsr8oF#Sa%w0NOJAqtcd5mKXXGvx3F9Srvo zTa6bRA#z^>Ux06Z?!JXgJ#sps#0N%Rr@HQ6n>EHJ%vs}EY9xhdq=juAww;{FLOIZU z=wUk|YyoZ>SWJ#r4kh>wL)&@UTvD{NGs90B_{pvB6^9n9zp-5TSVJ`LW=Kqvyb$eD009dliMK@|* zdDS4A8O_*=2|0?IAPn2{q%z4x4jvjTE|*NUtYc58GwrpBUByE3)?!| ztx(|A7ItrUn(@w~n}t#1jXW%ShuX)JSY;BZnf$UFohL==cfyaJ%!Vg}=yy=aaMG(7 zu69Y-FBM(sdw`l6{&Qqoe!))@uFMXDVbo_B>u4q%yKB(@{S1epJ!tXH@6YSE3y2a; zY+D}~!y@Jsum^p;Z0Pn?n=m&0QqmNIrmFHy3HfcF4;)fS`}=nLV3X#5mTL)HrRGqv zXdU<6ZmEhnys}xk;~UC`&TUhkJpFP%J68-!g#B{6)P=S?C1i1RX7#lX8nCs&JNl*( zH8sVO8$;1{&Qh&|fNt5@_{}5ZH3z7zWh%4?!*`~T3%Y_K<@jbWq(nd=Yo5b@ugUXo z6_IbJ-cGv(;V4TGj_xsFw}98ZDm#t8?uS69pp*{QoN)(fU*CWxp5QY91-aIDAlLew zu`<`{RFah(R^ex0N?Ezn`vN%gpF)w)t3R2vvjUU0e}vZ6a_@16n;e@nF9Ri$_M2ue zJM3e#I4=}wp>iKLm*wfTU0~IUMP;w=pZTt6Bpw&bB4W9%c;Upf`>hEWK!|HDI0DNi zf(;cC-amvGDsS^)QM6rYhZXQ1$gZPxPTjjGD}rTSt$FA+>6}gc$Jt39qo9f0GdHm? zw_Maa+$7JcM-*!ErhXv!On%=1w90vK`Jc% z%S#2n2yLo~U;r2f27q0_m4VsXPXkloe9#Ji3&iIRF<`LR2Z%s)N)=%}KK(Vo(8~g3 zlQXL^WJ%VhGbOW7n*08Az ztbSn98=uLhWpULKvgm%V|4}RZ%?l}{Oykuo=4ZfVHx%n!KtMK6xB#r=1R3PYIly07 z{e{)Pz3THTb)_Jzt7is5!~OlhAjePKL0HeutAX&!Mi5?&tq!j^n~*IFx!vQm@%*a# zDC3a})%YMr#>cY zY5ZDn%!vbDTU>-#DfHTozSR#@;zvZbvrl>=>jld`E!mDpK1btbuYLV}J15t6kQZ>3 z{`W~ONkD4u61^D_5v8kCq@6%TR<2f&bk%V6=^W=e+qzQbX1QJXR#r;iaSMmh=7H|~ zvT}c`rizA4p#5i)c3ihRcD3AqlF@mlM!|Ie_ek_AQyJS`OLZzSM=h@+xJ|g2N@@2G zb$8F2thR3Nh!LT4vr{7snOAOA0KM(KqZ$U|Y@nyediRiIGr@*W>7PXY*OnUv#PHIA z;rXYGe8>Soi7|5J3Q0>_=3tkf7yTy@sbM;fn{J)6#h!Mc+lQWPYB8gyhVo`k|5HQ4 zF^Hk4BLS%vUPu=eyBzXz2B|t%yc1S;v$%LX`I;Xb+gkMUg+V`w*jwhla5+hw<_%vo ze`X#wd8E}O#-oL{*Yj9j$9hYUlMMZW?)OJFmDz%zvUTxE9MBz`!KKe9(`&+cQ9Or$ zhm?IZkO2ieEdBzpS=^+mKzaO8*=)H(0_8!jsIyx&6@9Pru*1L_vnkw+<3V$Kq3Bbk zGv){Ru@P)Z5(r2d@$Z?34!m!wrg2Hmp=~NpQkv)V$!{=frR&N~(4TIF57L683H4Meo>K(n)3~IJg5kWe$q5{6bwEmch~5-fcJ z`A_NC{x>354_KeI@lJzx5VgvjB_CUKB+&m;Upxf*Kj)9VS3(x(6uezoU1NQ($`+do zW6DzN0H@ps*@@%%ANg(AWIt}GSx)25m=(l#A%5`+PunrCl)t|IIbm2M+>zG^mhc*H zG+je2bDw|Pkm~nj`!HVD7^`E!-pE6f&p`N4oH^J&4ljg~p~3P+NT={v<7IQ6R!vl{ zUT-aR?5 + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_adapt Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_adapt, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + +
_descriptionstan::gm::argumentprotected
_namestan::gm::argumentprotected
_subargumentsstan::gm::categorical_argumentprotected
arg(const std::string name)stan::gm::categorical_argumentinlinevirtual
arg_adapt()stan::gm::arg_adaptinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::categorical_argumentinlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::categorical_argumentinlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::categorical_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse)stan::gm::categorical_argumentinlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::categorical_argumentinlinevirtual
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
subarguments()stan::gm::categorical_argumentinline
~argument()stan::gm::argumentinlinevirtual
~categorical_argument()stan::gm::categorical_argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__adapt.html b/doc/api/html/classstan_1_1gm_1_1arg__adapt.html new file mode 100644 index 00000000000..88aa18a1566 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__adapt.html @@ -0,0 +1,201 @@ + + + + + +Stan: stan::gm::arg_adapt Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_adapt Class Reference
+
+
+ +

#include <arg_adapt.hpp>

+
+Inheritance diagram for stan::gm::arg_adapt:
+
+
+ + +stan::gm::categorical_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_adapt ()
 
- Public Member Functions inherited from stan::gm::categorical_argument
virtual ~categorical_argument ()
 
void print (std::ostream *s, const int depth, const char prefix)
 
void print_help (std::ostream *s, const int depth, const bool recurse)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
std::vector< argument * > & subarguments ()
 
argumentarg (const std::string name)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
int compute_indent (const int depth)
 
+ + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Attributes inherited from stan::gm::categorical_argument
std::vector< argument * > _subarguments
 
+

Detailed Description

+
+

Definition at line 19 of file arg_adapt.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_adapt::arg_adapt ()
+
+inline
+
+ +

Definition at line 23 of file arg_adapt.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__adapt.png b/doc/api/html/classstan_1_1gm_1_1arg__adapt.png new file mode 100644 index 0000000000000000000000000000000000000000..1d77e10e3357c7e9983d635f94222b1c3b24ec4c GIT binary patch literal 1020 zcmeAS@N?(olHy`uVBq!ia0vp^JAt@^gBeKngzicMQW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;IF_RuPm>GoN#9V)VgM{E49s`yX(DYDx&t9Q-9w2gZwmo}=% z7GJFSYb(9hDyQY_rZ&3*V;xWR9WlC31^WvSHZ(D_TeV<`BQ{7Xx`uv@9 zUY88_uljuM&XvD)OJ@|7ub*~_Dem~{vw8e!vbnQQ#3j7d{klx$<&5b23y(+U*GS$; z%ky%dWG3V8aVhg%^|Ryp6S>z*dRjfWmNiku9Oj8sqw|)}1sQ)x@i!<+Ui{R(F^lZ`-@AP>p zFVkyccFp`#tE67+X>=!Z-m-}y`j`K_K5zAN&P@HYFJ7PCwTf@gqG|b`t%Ub(Kb`$~ z)}bZYQ@ws<*|D3Ro|IyjdOvly*}<{}YxIu&zIawS=WtIGFz^ax}dUk{#)PMS&?;Dv!9h7{A}O;EW1bYN5;OJ+pQN?n^zpV6Lwmye)@;n ztu=MeW-opJdXKSr>HhQ|`_6sOda-t=?sx91L45fy*6V z_7AFO7=ft@4|m&=DVHWpU|>^$D%6{Gzkc>?+4IYOa6b!XuKo6}s8TN{?A+b0F}K29 z&nEtUZ)D8B&3c+-!}&R8^XGQm%yC)-Oo2!1fGIG0S!%ykdO3^5ldhk?g3Y4#dQRVU zEC1DjcNgz49N=6RdivAtc_#Cfzn^(4_w2U0--@- + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_adapt_delta Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_adapt_delta, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_bad_valuestan::gm::singleton_argument< T >protected
_constrainedstan::gm::singleton_argument< T >protected
_defaultstan::gm::valued_argumentprotected
_default_valuestan::gm::singleton_argument< T >protected
_descriptionstan::gm::argumentprotected
_good_valuestan::gm::singleton_argument< T >protected
_namestan::gm::argumentprotected
_validitystan::gm::singleton_argument< T >protected
_valuestan::gm::singleton_argument< T >protected
_value_typestan::gm::valued_argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_adapt_delta()stan::gm::arg_adapt_deltainline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::singleton_argument< T >inlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::singleton_argument< T >inlinevirtual
is_valid(double value)stan::gm::arg_adapt_deltainline
stan::gm::singleton_argument::is_valid(T value)stan::gm::singleton_argument< T >inlineprotectedvirtual
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::singleton_argument< T >inlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::valued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::valued_argumentinlinevirtual
print_valid()stan::gm::singleton_argument< T >inlinevirtual
print_value()stan::gm::singleton_argument< T >inlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::singleton_argument< T >inlinevirtual
set_value(const T &value)stan::gm::singleton_argument< T >inline
singleton_argument()stan::gm::singleton_argument< T >inline
singleton_argument(const std::string name)stan::gm::singleton_argument< T >inline
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
value()stan::gm::singleton_argument< T >inline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__adapt__delta.html b/doc/api/html/classstan_1_1gm_1_1arg__adapt__delta.html new file mode 100644 index 00000000000..3496aa8a850 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__adapt__delta.html @@ -0,0 +1,255 @@ + + + + + +Stan: stan::gm::arg_adapt_delta Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_adapt_delta Class Reference
+
+
+ +

#include <arg_adapt_delta.hpp>

+
+Inheritance diagram for stan::gm::arg_adapt_delta:
+
+
+ + +stan::gm::singleton_argument< T > +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_adapt_delta ()
 
bool is_valid (double value)
 
- Public Member Functions inherited from stan::gm::singleton_argument< T >
 singleton_argument ()
 
 singleton_argument (const std::string name)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
value ()
 
bool set_value (const T &value)
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
- Public Member Functions inherited from stan::gm::valued_argument
virtual void print (std::ostream *s, const int depth, const char prefix)
 
virtual void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Member Functions inherited from stan::gm::singleton_argument< T >
virtual bool is_valid (T value)
 
- Protected Attributes inherited from stan::gm::singleton_argument< T >
std::string _validity
 
_value
 
_default_value
 
bool _constrained
 
_good_value
 
_bad_value
 
+

Detailed Description

+
+

Definition at line 10 of file arg_adapt_delta.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_adapt_delta::arg_adapt_delta ()
+
+inline
+
+ +

Definition at line 14 of file arg_adapt_delta.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
bool stan::gm::arg_adapt_delta::is_valid (double value)
+
+inline
+
+ +

Definition at line 26 of file arg_adapt_delta.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__adapt__delta.png b/doc/api/html/classstan_1_1gm_1_1arg__adapt__delta.png new file mode 100644 index 0000000000000000000000000000000000000000..3f8013e7339e57be97ad13343b83c8b5c8987e59 GIT binary patch literal 1508 zcmb_cX;4!K5DriTQAEdbDpEQe3L$a@1cWGZh$2Rk2XaI%xf10t1QJ0aSfSWb6a=|26bR9VK7Cahs!}MS#E|NlFK&P3ZpfcETP1&+^`3-jV!({Du8F$rsh4C zTd3L@AyEn&AdN{7tbYRl1fe~|SV1Cw<^w?Y_SsDv7iOC8z3A>;?z80QR^(8*FNk3S z7OEN?W^<=HC>+X#HgvKot^DAQ6Rbf&;00~QikxN@Vow42b&gfrnUl_g@sg90?TDj- zM;^Ry`vKi#C!jNZjb8Vlep@&8l7DSIlfo1!rF;x9!?I(O94PGLi*v?t@as86xd_`D zw}rk3{V}9s)6c6KSd^fV2#_*`;i*gLZ-x+@2Keq=La!Ci&57neQHKvn!cq;>04cQ* z#Gg$7prJ?1Ep6u3a;2ou4ek0z61TjbJd6>__4iozCnfX%G%KPFHG7(Mh)aH{)@T)st(jm=!uk7qeH}Joc6S zv;L_nyv-~#JbG%R1U=#@Na=%WBM80=K9E()adNUp?Rz=7OAFb-IQvT7B)j$ zA{5!zxDk291j0`9wP~!NtUtyTcZ4!uge?_!Jq8=wl-%#)d1W6ESezyX!tBQ%yMIXU zCk&4Gk=2~QU^-2V#rYc7ih|0R;DDPiP@T;YnQuO{9k%LZd(kG!U6M%P*6Tu?Xj7JI z)uPH~wBCP^`Y+alPHSb{Qq{r+FxEFX%Sh(pUy23UQ6Rxae&!elH8BB#+SDNAu*2mq ziF)E?KOL$+H(=%Wd1-%=D1XDy6%9Qu`4uA}BO!456e4mq4-raXMZCRd?{&>n$C@(+ zmbZV0V`aD4+%eo?j@UzhN9-PJw{@sS(!%QnlsXrCptJ6WnbN(E$^M1v>EW1bv4bU1 zFKfh+5^yn9%o~rV$RB@C^+I|G&ehp*8$|C`vB&_|n^GmvB1NB8P`1`SQ#l*+)Wq(J zW_3n!HO|aGXb8%mWXIN{J5iUL^f{v0DYPcT$b>|iize`K!%6-ctHXhbkT!_1~#lG|kAgfla> zgNGaO+KA+INxb`}stvE4uHgkUQGdf?t0n&v>ZSIUB?b`=lFMRi7V)Cft-)<)5; zj3=Sp@#Q4NQyt>(<4Zz0^2Th1;*Xs~_25h)S;>)wVz=BnU+lBMdlckT@SHlZNq|J~ xAz?m!Qtq=N>v-@*l*jttAbwEO|Ec4PT1V+GPYr*}UzWXOn1`#E3(Gk;{SQLt?1BIQ literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1gm_1_1arg__adapt__engaged-members.html b/doc/api/html/classstan_1_1gm_1_1arg__adapt__engaged-members.html new file mode 100644 index 00000000000..e094fbdb1f5 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__adapt__engaged-members.html @@ -0,0 +1,146 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_adapt_engaged Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_adapt_engaged, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_bad_valuestan::gm::singleton_argument< T >protected
_constrainedstan::gm::singleton_argument< T >protected
_defaultstan::gm::valued_argumentprotected
_default_valuestan::gm::singleton_argument< T >protected
_descriptionstan::gm::argumentprotected
_good_valuestan::gm::singleton_argument< T >protected
_namestan::gm::argumentprotected
_validitystan::gm::singleton_argument< T >protected
_valuestan::gm::singleton_argument< T >protected
_value_typestan::gm::valued_argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_adapt_engaged()stan::gm::arg_adapt_engagedinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::singleton_argument< T >inlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::singleton_argument< T >inlinevirtual
is_valid(T value)stan::gm::singleton_argument< T >inlineprotectedvirtual
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::singleton_argument< T >inlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::valued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::valued_argumentinlinevirtual
print_valid()stan::gm::singleton_argument< T >inlinevirtual
print_value()stan::gm::singleton_argument< T >inlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::singleton_argument< T >inlinevirtual
set_value(const T &value)stan::gm::singleton_argument< T >inline
singleton_argument()stan::gm::singleton_argument< T >inline
singleton_argument(const std::string name)stan::gm::singleton_argument< T >inline
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
value()stan::gm::singleton_argument< T >inline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__adapt__engaged.html b/doc/api/html/classstan_1_1gm_1_1arg__adapt__engaged.html new file mode 100644 index 00000000000..008a302292d --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__adapt__engaged.html @@ -0,0 +1,226 @@ + + + + + +Stan: stan::gm::arg_adapt_engaged Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_adapt_engaged Class Reference
+
+
+ +

#include <arg_adapt_engaged.hpp>

+
+Inheritance diagram for stan::gm::arg_adapt_engaged:
+
+
+ + +stan::gm::singleton_argument< T > +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_adapt_engaged ()
 
- Public Member Functions inherited from stan::gm::singleton_argument< T >
 singleton_argument ()
 
 singleton_argument (const std::string name)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
value ()
 
bool set_value (const T &value)
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
- Public Member Functions inherited from stan::gm::valued_argument
virtual void print (std::ostream *s, const int depth, const char prefix)
 
virtual void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Member Functions inherited from stan::gm::singleton_argument< T >
virtual bool is_valid (T value)
 
- Protected Attributes inherited from stan::gm::singleton_argument< T >
std::string _validity
 
_value
 
_default_value
 
bool _constrained
 
_good_value
 
_bad_value
 
+

Detailed Description

+
+

Definition at line 10 of file arg_adapt_engaged.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_adapt_engaged::arg_adapt_engaged ()
+
+inline
+
+ +

Definition at line 14 of file arg_adapt_engaged.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__adapt__engaged.png b/doc/api/html/classstan_1_1gm_1_1arg__adapt__engaged.png new file mode 100644 index 0000000000000000000000000000000000000000..3ec2467268d35876b0a175f9e47049530b6270ed GIT binary patch literal 1500 zcma)6eKga19R5jWc|W*_kSogDl;m9}@{+e@wxwnyC7EkhjIkSG<*Fo6UWZ!qGMC-! zb&}Uz)lzcJ)SX|+M9v6HavZe#bMHO=?S9Ysd_OPe`RDUIpYvn~BE6LrbQJ&qQ1&_I z5d>uriXONu^q;)FfrgS!pg+b_DwRUz%-k|Lx9>Jo{S!SsJ#yKgA=JVXf{73|N0O7QzIqi^c&@cQeO z!YZdSLXMckIwXd1+?HP_^i#9YRs;&d)v_XLH@kwo7Sj`|)6unrPq z3V|2R#c34`pI_)zCR7dcm<-nV%sc18UX!HX%I@$4Yufxv<^(oDO}=O}k78bWsSm}eUO?GIz!*dkg ztBPfYSh#Cc7u~9uo%6g=L@1xsiQ6_(t0EuBaN2bQS{pdT;>wKFd~X0U)Z8y%w+rk9 z6POrG7P=l~*sIJMuXR`^rV)mnz}%+lwlk|Pm%CF(dn@uJ8rITbTcg<`(|W{{!NLiV znM9ZEQd~Dbvj^lHY5o8a7g2IFJCiz&5@x^I@Gt3U7{nxz4TvwV&S;9BHDZnP?MbI- zis5I1uk*1<%Rab4AF>M3zve<;<8p{6Nfk(L>!V#aLiBsz4?~qRBUY~pSJojpank=!JEY;HszqKW*M98 zB3w?f+UGAO$%CznwdKQgzUQh*y>#8S5ac|V&r0!aYwxgtICdmE2y{0|7|}q`)O3I7 zF&vSt#I`7{P;C8Q+kpA?p^vI2Qd+jxp!HQMy~qw%ATU6{WXaZ`zBk}_8_|YXa8@jf zTRU2#QjKHSKnHm+w(3{?(-ibu^LWgckeSCS)g?2hX?o=h?&oA-*MD@cbbYIcjjDTt z;*E_su7>RGxAFn>btM%jrcS32fVDyz*5>t`5V#gygqbvab_%$ z=(xDB02Z7@$EJjeDfA$H9^Zz255*j-io|I7Sv*{7IN>JIx5m8C1WOuA2-+&<#GM5{2VT) zzA#>s7!@CuaN8-!ijw4Wb2nX)#(9FrK@s?Gs+Bd|iI#v~8?}}l;V`_FHh-U3aE5pG z{M`mrSqVk{S%Okq`DM*ygP-mhD!wiAAC4fwqx&v*MK@+Y`khs z?~*&_tk?^Da6;^h#u;#xk2KH^nw5i&lXaxhe@z6wvP>UqkF + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_adapt_gamma Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_adapt_gamma, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_bad_valuestan::gm::singleton_argument< T >protected
_constrainedstan::gm::singleton_argument< T >protected
_defaultstan::gm::valued_argumentprotected
_default_valuestan::gm::singleton_argument< T >protected
_descriptionstan::gm::argumentprotected
_good_valuestan::gm::singleton_argument< T >protected
_namestan::gm::argumentprotected
_validitystan::gm::singleton_argument< T >protected
_valuestan::gm::singleton_argument< T >protected
_value_typestan::gm::valued_argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_adapt_gamma()stan::gm::arg_adapt_gammainline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::singleton_argument< T >inlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::singleton_argument< T >inlinevirtual
is_valid(double value)stan::gm::arg_adapt_gammainline
stan::gm::singleton_argument::is_valid(T value)stan::gm::singleton_argument< T >inlineprotectedvirtual
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::singleton_argument< T >inlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::valued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::valued_argumentinlinevirtual
print_valid()stan::gm::singleton_argument< T >inlinevirtual
print_value()stan::gm::singleton_argument< T >inlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::singleton_argument< T >inlinevirtual
set_value(const T &value)stan::gm::singleton_argument< T >inline
singleton_argument()stan::gm::singleton_argument< T >inline
singleton_argument(const std::string name)stan::gm::singleton_argument< T >inline
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
value()stan::gm::singleton_argument< T >inline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__adapt__gamma.html b/doc/api/html/classstan_1_1gm_1_1arg__adapt__gamma.html new file mode 100644 index 00000000000..192cac587ab --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__adapt__gamma.html @@ -0,0 +1,255 @@ + + + + + +Stan: stan::gm::arg_adapt_gamma Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_adapt_gamma Class Reference
+
+
+ +

#include <arg_adapt_gamma.hpp>

+
+Inheritance diagram for stan::gm::arg_adapt_gamma:
+
+
+ + +stan::gm::singleton_argument< T > +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_adapt_gamma ()
 
bool is_valid (double value)
 
- Public Member Functions inherited from stan::gm::singleton_argument< T >
 singleton_argument ()
 
 singleton_argument (const std::string name)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
value ()
 
bool set_value (const T &value)
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
- Public Member Functions inherited from stan::gm::valued_argument
virtual void print (std::ostream *s, const int depth, const char prefix)
 
virtual void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Member Functions inherited from stan::gm::singleton_argument< T >
virtual bool is_valid (T value)
 
- Protected Attributes inherited from stan::gm::singleton_argument< T >
std::string _validity
 
_value
 
_default_value
 
bool _constrained
 
_good_value
 
_bad_value
 
+

Detailed Description

+
+

Definition at line 10 of file arg_adapt_gamma.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_adapt_gamma::arg_adapt_gamma ()
+
+inline
+
+ +

Definition at line 14 of file arg_adapt_gamma.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
bool stan::gm::arg_adapt_gamma::is_valid (double value)
+
+inline
+
+ +

Definition at line 26 of file arg_adapt_gamma.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__adapt__gamma.png b/doc/api/html/classstan_1_1gm_1_1arg__adapt__gamma.png new file mode 100644 index 0000000000000000000000000000000000000000..738d4c59b7e336dc9f769c7ab86488283d037ec0 GIT binary patch literal 1527 zcma)6doPgcrvA*8N zAkw0*0(M~cLm;qpch^JMM49QL>05MTHAuk|xVQxX(CP_T|+P3U@ zNCH^j;2cLJ)Cx-knsJ6VN+$*_bqeX`vRKEFU7!J1J$pHtoCo*Zi)8GiC%*_))IDe< zpt*oG6Za`vQ!}}xRhiblaLV&O#&{K=H~VW83)A^*X!>KPgP?`RslhlQ z!MiH4;7K!;gg7XD9ru+hu{copl&;chaX^MMb6)mzT0AzYo=hC@X)bs&D$Jo&b0CZV z2iR|spGBnyYYS5kv0$4M_F~gS;g#tos>9dH*yP<^!*wg?lNmt1cnR0qd@L_&Nq-Y> zv|b9DT24AsQgvD!e6wEJBkV{U_s_AIafi>l?o3ePJAn_|UOqg;+{d5h@poTfx<1{W`TPRXZ!jX;UPq9+h5`Q@DyhX~j$0zK{6DBTdWi9w!v$4NTbneA~Ct z(#0n*+jus{uCS5=TrEWId1vckj!eNN*p#!)N&o}&MSBrS%;R6dujSruWEZJZ;)^Cr z%ia>wut8&&q>HNl3;#zoTmaCL>1z152Q{qw+K(e{V|QUlH4|9VS4vH} zV@9KPTsBmXtB~07YQmVK!ryKGxkhkF@P*+^E%xYnzARCAOm<)GpDdMwS&!BRQb|ha x1xS11eGXJNCKM{W8oc>2@?NEE(Z{|?c^`3OxT07MDgDwAca*m)!}-MJzX3-u_4@z- literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1gm_1_1arg__adapt__init__buffer-members.html b/doc/api/html/classstan_1_1gm_1_1arg__adapt__init__buffer-members.html new file mode 100644 index 00000000000..42bb57535e9 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__adapt__init__buffer-members.html @@ -0,0 +1,146 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_adapt_init_buffer Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_adapt_init_buffer, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_bad_valuestan::gm::singleton_argument< T >protected
_constrainedstan::gm::singleton_argument< T >protected
_defaultstan::gm::valued_argumentprotected
_default_valuestan::gm::singleton_argument< T >protected
_descriptionstan::gm::argumentprotected
_good_valuestan::gm::singleton_argument< T >protected
_namestan::gm::argumentprotected
_validitystan::gm::singleton_argument< T >protected
_valuestan::gm::singleton_argument< T >protected
_value_typestan::gm::valued_argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_adapt_init_buffer()stan::gm::arg_adapt_init_bufferinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::singleton_argument< T >inlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::singleton_argument< T >inlinevirtual
is_valid(T value)stan::gm::singleton_argument< T >inlineprotectedvirtual
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::singleton_argument< T >inlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::valued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::valued_argumentinlinevirtual
print_valid()stan::gm::singleton_argument< T >inlinevirtual
print_value()stan::gm::singleton_argument< T >inlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::singleton_argument< T >inlinevirtual
set_value(const T &value)stan::gm::singleton_argument< T >inline
singleton_argument()stan::gm::singleton_argument< T >inline
singleton_argument(const std::string name)stan::gm::singleton_argument< T >inline
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
value()stan::gm::singleton_argument< T >inline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__adapt__init__buffer.html b/doc/api/html/classstan_1_1gm_1_1arg__adapt__init__buffer.html new file mode 100644 index 00000000000..08e10cde075 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__adapt__init__buffer.html @@ -0,0 +1,226 @@ + + + + + +Stan: stan::gm::arg_adapt_init_buffer Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_adapt_init_buffer Class Reference
+
+
+ +

#include <arg_adapt_init_buffer.hpp>

+
+Inheritance diagram for stan::gm::arg_adapt_init_buffer:
+
+
+ + +stan::gm::singleton_argument< T > +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_adapt_init_buffer ()
 
- Public Member Functions inherited from stan::gm::singleton_argument< T >
 singleton_argument ()
 
 singleton_argument (const std::string name)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
value ()
 
bool set_value (const T &value)
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
- Public Member Functions inherited from stan::gm::valued_argument
virtual void print (std::ostream *s, const int depth, const char prefix)
 
virtual void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Member Functions inherited from stan::gm::singleton_argument< T >
virtual bool is_valid (T value)
 
- Protected Attributes inherited from stan::gm::singleton_argument< T >
std::string _validity
 
_value
 
_default_value
 
bool _constrained
 
_good_value
 
_bad_value
 
+

Detailed Description

+
+

Definition at line 10 of file arg_adapt_init_buffer.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_adapt_init_buffer::arg_adapt_init_buffer ()
+
+inline
+
+ +

Definition at line 14 of file arg_adapt_init_buffer.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__adapt__init__buffer.png b/doc/api/html/classstan_1_1gm_1_1arg__adapt__init__buffer.png new file mode 100644 index 0000000000000000000000000000000000000000..27f740a39b0b0c233d8f75884d25cdec96175de4 GIT binary patch literal 1667 zcmcgtYc$kp82_7*``An=v~%44My1V;8ES|TQ#1c^$)yX2#gN_9G8keR9EYsjO~_rO z8ZqQHBG+t+a$71Uv2Ai|SeF?L!~XSQKkV+8{j%>l@B4e+bAHcx&iOs>?|I|T*-%h& zYH|Popdc#Q9snd{;kZo(37;BR?*bT9&RIF0+TPxV!|Bh0pp=eOIQp{N+S+!-zf*^= zG7Nhg2LLARtl@4)0|1ahL*$c=Arkz2e!y}$S~Bk5;nm0&l{C$EEwHD06C{4`g133u zg+LvN%n0liuGmRc;bd7rv{eTfRn(V81=N?t1J)l(z(GP^ZG?4A#3nmq+;I7#gJ=!6 zzcS;F$ANN!bVE;}2F|wG$tt?2dh~Ky-Q*~Nk?iFo9ksEki56@c^|&M;qxviS$LS6V z^b%6AN%y{EO<`1;Zzxquas#g#Serxv(fy$eEbW^%=9X?~v9{9Evo-G+#^RJ81zJpD zyy0N6-F3B0@HFZT*E3dn!7wy;w{O6^_wz-Ie z&J(%b5wg+Uh|Ex~-iW@6$JM9$mk`-%3KKWSb?j2SYFhaQjfae^gQ<)jrz;A(6`PPQ ziyK@|B5#WNa;kBr%6HbNV{kT=JiW?-^~LK_75peC49rJ=`XaLOc&@H7TGKB^PkH|e z!M2kw>ntwj*;NZ0c|9*_#V#zd=weO0E#o8FQN73F zkZR22PN6Dre3GK}S-6@+2l~YA_<_n@6R7d86*bmsxX6jhx1be5238A*#-fQ+*QSm@ zq%>z|EBccTGF|omG+Ofn@mQ8yvjXVH(^1Ds<4$b_NgAi z^nPZdfp(H5!o80-9|sOP=Dx0E^MALk*yLoljt+J$l=275P=uQol zj;GLqp&|1zY>efjVD|8sXrqkZqPUT4QO|mRVO|igy~;!+gqUQqn91Zo6Qic8P8HVe zhhIT4PAge@Qe)ZAf-%}?y#yoA`95Y`=e(3}@&zz0s<#9`Fg%|hFTPUinNQkdG8I5? zx0snYW7di>jkT^Hc?|G2Y_xpBEv`d}OJt&_&ZFM-`s|^DcEYaeNRu2wb2H|ZHcm}b zIOo88UdH2=Bvpl)+>mJENmMNa`iV-jw(WJJDk|fQDYRUX#80Fj1ytHtaGpHskD-NF z<4~+<9eIt(QSP7Jp^eK0ZNc8s=lyRjwm$=pr*tsvgF9?dcG`|RixR;3E^hoK`Hskv z4@*+LnRoTJ*vepDsQQH!Mw25A;{@XJ^avelGPkmA!i2 z!KFKMX|P$psIcam(ePd}udhJ|v_+Gc7W3kQr`}TH z?#7x?+geIfQo{>Hq&WoyXO!KVFg;FY5Y3mEWT7Gl?c`NCn?cwsNrgX(d1oKk_|NDD@A(n*VBnMhsn zqhJD6i=JT8SE4K5DMF*G%OSST?@Toz_ywcNYcIn?QW;dE%?U(pi?$vj)i;lpJi0}xBvhE literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1gm_1_1arg__adapt__kappa-members.html b/doc/api/html/classstan_1_1gm_1_1arg__adapt__kappa-members.html new file mode 100644 index 00000000000..696340b00bd --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__adapt__kappa-members.html @@ -0,0 +1,147 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_adapt_kappa Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_adapt_kappa, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_bad_valuestan::gm::singleton_argument< T >protected
_constrainedstan::gm::singleton_argument< T >protected
_defaultstan::gm::valued_argumentprotected
_default_valuestan::gm::singleton_argument< T >protected
_descriptionstan::gm::argumentprotected
_good_valuestan::gm::singleton_argument< T >protected
_namestan::gm::argumentprotected
_validitystan::gm::singleton_argument< T >protected
_valuestan::gm::singleton_argument< T >protected
_value_typestan::gm::valued_argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_adapt_kappa()stan::gm::arg_adapt_kappainline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::singleton_argument< T >inlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::singleton_argument< T >inlinevirtual
is_valid(double value)stan::gm::arg_adapt_kappainline
stan::gm::singleton_argument::is_valid(T value)stan::gm::singleton_argument< T >inlineprotectedvirtual
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::singleton_argument< T >inlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::valued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::valued_argumentinlinevirtual
print_valid()stan::gm::singleton_argument< T >inlinevirtual
print_value()stan::gm::singleton_argument< T >inlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::singleton_argument< T >inlinevirtual
set_value(const T &value)stan::gm::singleton_argument< T >inline
singleton_argument()stan::gm::singleton_argument< T >inline
singleton_argument(const std::string name)stan::gm::singleton_argument< T >inline
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
value()stan::gm::singleton_argument< T >inline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__adapt__kappa.html b/doc/api/html/classstan_1_1gm_1_1arg__adapt__kappa.html new file mode 100644 index 00000000000..3c55166db5d --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__adapt__kappa.html @@ -0,0 +1,255 @@ + + + + + +Stan: stan::gm::arg_adapt_kappa Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_adapt_kappa Class Reference
+
+
+ +

#include <arg_adapt_kappa.hpp>

+
+Inheritance diagram for stan::gm::arg_adapt_kappa:
+
+
+ + +stan::gm::singleton_argument< T > +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_adapt_kappa ()
 
bool is_valid (double value)
 
- Public Member Functions inherited from stan::gm::singleton_argument< T >
 singleton_argument ()
 
 singleton_argument (const std::string name)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
value ()
 
bool set_value (const T &value)
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
- Public Member Functions inherited from stan::gm::valued_argument
virtual void print (std::ostream *s, const int depth, const char prefix)
 
virtual void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Member Functions inherited from stan::gm::singleton_argument< T >
virtual bool is_valid (T value)
 
- Protected Attributes inherited from stan::gm::singleton_argument< T >
std::string _validity
 
_value
 
_default_value
 
bool _constrained
 
_good_value
 
_bad_value
 
+

Detailed Description

+
+

Definition at line 10 of file arg_adapt_kappa.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_adapt_kappa::arg_adapt_kappa ()
+
+inline
+
+ +

Definition at line 14 of file arg_adapt_kappa.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
bool stan::gm::arg_adapt_kappa::is_valid (double value)
+
+inline
+
+ +

Definition at line 26 of file arg_adapt_kappa.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__adapt__kappa.png b/doc/api/html/classstan_1_1gm_1_1arg__adapt__kappa.png new file mode 100644 index 0000000000000000000000000000000000000000..fd019ac334b935aa279f7f07892dadbc0aae7014 GIT binary patch literal 1518 zcma)6do|cG)x!-&5IrrRi?&otqH_64xR&4`j z0{{SOb|TYL7DNY^8t;VgczC5(kRqjB}b4hP9yRyxb!C-|) z1!^)y7^4y&1`q1Pc!PXGySp0XE50`74bB}FHKZF2eQb@9>7|(Ki}j&>^{Da_dD`Q`zEIa(;E2eIyHaQJ67gfop z=4MKS?nuQ4cSP^)(0+SB#jpiaoCN0|w$4ZA35*dKnh>;f*XVUjnbZ8H0ebPEd|gP`a+l zhO7{r!rRb+@!pzGc#5+K`CmcoZ+@E05I8?ZVXgfo5P1`2ODJiurH%E@5babR6ha4!1wN)PVo%#4ACs8%W=h+>&;&a;) z!SOD+p!Q5VpYUCFyfIGdMh$Vza`UO%ixk&I@}N-Z?-~y%5!9N^V9yKUoO&9?UDBZ> zBKELrOAWQhAmNcC{k3P#>vd)?#2``sGTE?nqfOK+tX8%2U_31itDo06C#ovuz7!m zT|yAq3#rP^Zv_{936x4XaYkj6Kl6K^*vH+J$DSnBJgj{ox}>UID~nx^i?4g`_AuVM z$eK!G%5cAs%BhoB&iP$gSZURAGx3(Z0X8?_HP}3gQh{rc4Y{U>RC}xRE*OR$r$wrg zUb@x=6aIQl=Lg4~Ba`n78xTvv>XvHe`S?;Han_lRXK><5E7G-OqyXclnC*D4FDDbW zk?+8P3Qo`m6UHsKQ@Qs_ctV^s!c^-a3^^a6pJbw*_cVzic*PJ=2tS zowS^pAfPy_5Co}nZrzh*$Dr~EQ&bK;YkN9|vK3C&X8P601J8tN!x%5yIlAEHB#k)D zC5P9iQ_Eps>RV;-l`W~YrLqX44)83#>L#otZ#9&pk)?!ndIQSg`h{Fh7{_OXzWwagZF8dgeS zMv%%(th9j&oNQT{<51RxT`+(RP?)b%KTnasp#>72FWTOKWWyCU?S`?u4EYxPXRWiI z + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_adapt_t0 Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_adapt_t0, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_bad_valuestan::gm::singleton_argument< T >protected
_constrainedstan::gm::singleton_argument< T >protected
_defaultstan::gm::valued_argumentprotected
_default_valuestan::gm::singleton_argument< T >protected
_descriptionstan::gm::argumentprotected
_good_valuestan::gm::singleton_argument< T >protected
_namestan::gm::argumentprotected
_validitystan::gm::singleton_argument< T >protected
_valuestan::gm::singleton_argument< T >protected
_value_typestan::gm::valued_argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_adapt_t0()stan::gm::arg_adapt_t0inline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::singleton_argument< T >inlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::singleton_argument< T >inlinevirtual
is_valid(double value)stan::gm::arg_adapt_t0inline
stan::gm::singleton_argument::is_valid(T value)stan::gm::singleton_argument< T >inlineprotectedvirtual
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::singleton_argument< T >inlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::valued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::valued_argumentinlinevirtual
print_valid()stan::gm::singleton_argument< T >inlinevirtual
print_value()stan::gm::singleton_argument< T >inlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::singleton_argument< T >inlinevirtual
set_value(const T &value)stan::gm::singleton_argument< T >inline
singleton_argument()stan::gm::singleton_argument< T >inline
singleton_argument(const std::string name)stan::gm::singleton_argument< T >inline
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
value()stan::gm::singleton_argument< T >inline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__adapt__t0.html b/doc/api/html/classstan_1_1gm_1_1arg__adapt__t0.html new file mode 100644 index 00000000000..1dc531316fa --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__adapt__t0.html @@ -0,0 +1,255 @@ + + + + + +Stan: stan::gm::arg_adapt_t0 Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_adapt_t0 Class Reference
+
+
+ +

#include <arg_adapt_t0.hpp>

+
+Inheritance diagram for stan::gm::arg_adapt_t0:
+
+
+ + +stan::gm::singleton_argument< T > +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_adapt_t0 ()
 
bool is_valid (double value)
 
- Public Member Functions inherited from stan::gm::singleton_argument< T >
 singleton_argument ()
 
 singleton_argument (const std::string name)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
value ()
 
bool set_value (const T &value)
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
- Public Member Functions inherited from stan::gm::valued_argument
virtual void print (std::ostream *s, const int depth, const char prefix)
 
virtual void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Member Functions inherited from stan::gm::singleton_argument< T >
virtual bool is_valid (T value)
 
- Protected Attributes inherited from stan::gm::singleton_argument< T >
std::string _validity
 
_value
 
_default_value
 
bool _constrained
 
_good_value
 
_bad_value
 
+

Detailed Description

+
+

Definition at line 10 of file arg_adapt_t0.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_adapt_t0::arg_adapt_t0 ()
+
+inline
+
+ +

Definition at line 14 of file arg_adapt_t0.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
bool stan::gm::arg_adapt_t0::is_valid (double value)
+
+inline
+
+ +

Definition at line 26 of file arg_adapt_t0.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__adapt__t0.png b/doc/api/html/classstan_1_1gm_1_1arg__adapt__t0.png new file mode 100644 index 0000000000000000000000000000000000000000..62bf225fa9b7f12b706b5dca86a7d9fc9b6767ea GIT binary patch literal 1488 zcmaKsdoWvh6vr>BY+GelZEaL^YS)`8iK1jt&mvNCDfMWVw&J~ri1A3bx>hS5^(yO4 zRjx@4%C^EbrKK$OnlP<+wDG8`BGYavOSqfvjDL2v`8gtXBCV?K}zFyrQmoN2_n?ud8OJ zhb<2KrIi^Hvv_q;H*^M?%>9kDS84|riD_juTlGzGJqn{Q;5X?K1uszLN`?aWk=G?{ES(CZN;+-8?w8oWrpErq< zF_;kg#q}x9Be_v8dyx`rn*|AkmLsF-MUNZGiS6*M0d3;^$_MtAcnwL;glAIk(Llu3 z6YRj0LlGn%$Y!lUz``~UfNRj)8768vg}Bk!@zA&7m9?oI6$8>H!Xe<^I8o+YJwvw0 z*+*WF-gtn3@>HwAlpENQ{v}AwXRUQv*Z456H$nlZPg8==D?u%-Rw6hV(!hXR<6hgO zyIz~cTh&X;^OdiU=uVpBpPS?qmZQ|oUVgkp+;;S-wJ+X5w zq}2x+BgP2=CO>oa+I_i`%p^m2VyJzfA?3N@Jjm6Y6FWl7fhd6kmuwE&I?YG6X{Kmb zz~zP%5kt8PK6NyU-9-a4iuVu*prC0o2nf?+05TyDUiYO(+Cr4cfIvggfJs-}lvc?viGO01qh zj7}qhL-)lI$R;KUrKa%emPPO}zH#9jwKr70(58~=QSmfB$TQcUeBnd@COkgJ-*a$Z zP%a&bcD`+K$yNVR88iQxM)kX*$hIMa*VI;5YhO?3IJ&yADsW`j?1{wJH+HZp+%->f zP1N);ed5_Nl_cXelYz$?ETpzt^>@N?+XU?3i55fw3Ke@;#JFz{t~Uu{o86`JfY}v1 z?)n`W~nhc4<90+ zKjZq({+8CanJO?1Ajs`Cb~93T5(1n8O(Z)TEd{dO9K@sJH~Hl2(;$M5MRKwf(v*)l zp>RL&^>;HzBO9w9t-gpmmHRM?|K}A+7ks?c<}HpXRwwJshPyY``jh%EPyB);`(=^% zi#FMMBBKs}N^t^8+iaIETQ#)a0Gr0UW9bDFksL&o`QBH_4v$OUUa3ARtc`dth=F!v z=eVu30kqX-zka3E@_waN-2#sL#i|o8+{0|O7N~O)mh3yBrQpVwe!3sO;SP{3(k!<# zfXKR88+G}(T;+9`Ka9@-9_Ej#nR2}Lc0@l + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_adapt_term_buffer Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_adapt_term_buffer, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_bad_valuestan::gm::singleton_argument< T >protected
_constrainedstan::gm::singleton_argument< T >protected
_defaultstan::gm::valued_argumentprotected
_default_valuestan::gm::singleton_argument< T >protected
_descriptionstan::gm::argumentprotected
_good_valuestan::gm::singleton_argument< T >protected
_namestan::gm::argumentprotected
_validitystan::gm::singleton_argument< T >protected
_valuestan::gm::singleton_argument< T >protected
_value_typestan::gm::valued_argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_adapt_term_buffer()stan::gm::arg_adapt_term_bufferinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::singleton_argument< T >inlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::singleton_argument< T >inlinevirtual
is_valid(T value)stan::gm::singleton_argument< T >inlineprotectedvirtual
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::singleton_argument< T >inlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::valued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::valued_argumentinlinevirtual
print_valid()stan::gm::singleton_argument< T >inlinevirtual
print_value()stan::gm::singleton_argument< T >inlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::singleton_argument< T >inlinevirtual
set_value(const T &value)stan::gm::singleton_argument< T >inline
singleton_argument()stan::gm::singleton_argument< T >inline
singleton_argument(const std::string name)stan::gm::singleton_argument< T >inline
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
value()stan::gm::singleton_argument< T >inline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__adapt__term__buffer.html b/doc/api/html/classstan_1_1gm_1_1arg__adapt__term__buffer.html new file mode 100644 index 00000000000..b7f4f166b7e --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__adapt__term__buffer.html @@ -0,0 +1,226 @@ + + + + + +Stan: stan::gm::arg_adapt_term_buffer Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_adapt_term_buffer Class Reference
+
+
+ +

#include <arg_adapt_term_buffer.hpp>

+
+Inheritance diagram for stan::gm::arg_adapt_term_buffer:
+
+
+ + +stan::gm::singleton_argument< T > +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_adapt_term_buffer ()
 
- Public Member Functions inherited from stan::gm::singleton_argument< T >
 singleton_argument ()
 
 singleton_argument (const std::string name)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
value ()
 
bool set_value (const T &value)
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
- Public Member Functions inherited from stan::gm::valued_argument
virtual void print (std::ostream *s, const int depth, const char prefix)
 
virtual void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Member Functions inherited from stan::gm::singleton_argument< T >
virtual bool is_valid (T value)
 
- Protected Attributes inherited from stan::gm::singleton_argument< T >
std::string _validity
 
_value
 
_default_value
 
bool _constrained
 
_good_value
 
_bad_value
 
+

Detailed Description

+
+

Definition at line 10 of file arg_adapt_term_buffer.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_adapt_term_buffer::arg_adapt_term_buffer ()
+
+inline
+
+ +

Definition at line 14 of file arg_adapt_term_buffer.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__adapt__term__buffer.png b/doc/api/html/classstan_1_1gm_1_1arg__adapt__term__buffer.png new file mode 100644 index 0000000000000000000000000000000000000000..bdf156ba9161f5f968af20c83b7dc35c89f53217 GIT binary patch literal 1676 zcmbW2X;hL~7{_0CAEp%GMS<*DlILsT*#1Alo%^@6qkAF!}Mjo%-nPC{Xh4d=iU$h=l-6{4D=@~ z);HD%0AMi;;e!DHrH8~qU2SAtjg2Zm1QX~N>N__#hlGP8V+m;w*hutk3WdV?%(1V}bni#?Ym?cIU7xWH#D@C( zE6)HO%^({}q^LONgG;g-;HBupo1c-jK3oIW2(ex&E4FzjC6 zy+V8cU|J6=^3uakz1A)@_qJQkSI6K!Mw_V8ZG8q_#bgJt8tZ zvz9ZqC&s&P3?g3}O~<%*_p%nFg$c7SmB5B^+0Ok=;Lgpk} z+jKI1VN&^wRgLz0$y?A*3&QDf0S*=|=r|@>1ABjRhHvk%O!^C_&t<=M`(-U6%Oef2 z7IsfTzb(NW_(}>7!|{6ng4T#7&^F{2cE%C(za@?~K(E8fH_<{-$C3Ob z&GFSkTIl)j-Ip{RG+XjMWyc3&bfj_pabi23%m|YwzL;JyaOO)}k^LSI!BR>ezt7Ol z_p+7q3sk|xKJeq)l*tuPm|<0m=dJ$QLn)5uiPa#^5hJvxXX8CN;S3qB-tIhB2dtML zcUz!)p$BzvR9zFXscQgwKHx#^T$ivaJT@U4ubAMjq}*|}ffmIPe#H5_Jxj%&bQId( zUl%|HgL|RfYn%te3!e1p<7bMys*fmRYa}^xe4VvgxpR+41;e11H4dc~-zD5A(fu<+ z+Gqwe(@AN72hr3(cgmDG;|iP**SK{mRVICaxjLCtOk5~5xxc~G=QAlzM<_k4@c?mD z3(D1abD$iYscizEu44ipp4lQkx6gZ^k&KQ1!|v~O5veSLV))}m3!$SuY)d2Vv4+y*Iw6xpYbGhhSA2;>r=CK-xl~Q zaXE&Od*i{NtCAB2>G(yMn>gmFV_{dxKeQEf*56T(XJ~Ke#0xZng^V|mNuYgxLMs$m zN?Bt^3ayrro5@BUm;U?x;f!3oc}ZzCvH7Ctv1QbAS=}o3hHhccD>115@@Fcx z{#}V{yw~Lo9h0u{C!BPQ95M}V^~<_mg>**dB`>UMQZ2vz*ybx+WEIu2J*?l0yV zTZ?D+jK>k6c6HY>bLK1EI%1(BWLHm0vW~F2wQAa>@X2sR7mHGaGM{P;v}whAGm;ux1zN=i74xbl_7$~A4U!md5k7nnT;{Re(r*ZM zHSB_?;u$a}7L5{R2O(80)l1QcE#<$l^u4&>pkqpXi!*{phDt2qanT1Qq@v4F>UEgEc!Yg;pAV!cc+A>*1oQ| zW+8H#@=6vAk9gex^GCUt^RhC_Y@_!oJ)|8cV{#Kcsl!&K7W*!`pXtuU*sIG9&^dTd zMtDCxvS+2zrn97nV9LFyJ+i=z!{+@?pFLGUngp43^5~Nrf11jK`i}S1 LfBda2hkpGV_W=;B literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1gm_1_1arg__adapt__window-members.html b/doc/api/html/classstan_1_1gm_1_1arg__adapt__window-members.html new file mode 100644 index 00000000000..6683f8d8d1d --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__adapt__window-members.html @@ -0,0 +1,146 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_adapt_window Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_adapt_window, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_bad_valuestan::gm::singleton_argument< T >protected
_constrainedstan::gm::singleton_argument< T >protected
_defaultstan::gm::valued_argumentprotected
_default_valuestan::gm::singleton_argument< T >protected
_descriptionstan::gm::argumentprotected
_good_valuestan::gm::singleton_argument< T >protected
_namestan::gm::argumentprotected
_validitystan::gm::singleton_argument< T >protected
_valuestan::gm::singleton_argument< T >protected
_value_typestan::gm::valued_argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_adapt_window()stan::gm::arg_adapt_windowinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::singleton_argument< T >inlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::singleton_argument< T >inlinevirtual
is_valid(T value)stan::gm::singleton_argument< T >inlineprotectedvirtual
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::singleton_argument< T >inlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::valued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::valued_argumentinlinevirtual
print_valid()stan::gm::singleton_argument< T >inlinevirtual
print_value()stan::gm::singleton_argument< T >inlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::singleton_argument< T >inlinevirtual
set_value(const T &value)stan::gm::singleton_argument< T >inline
singleton_argument()stan::gm::singleton_argument< T >inline
singleton_argument(const std::string name)stan::gm::singleton_argument< T >inline
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
value()stan::gm::singleton_argument< T >inline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__adapt__window.html b/doc/api/html/classstan_1_1gm_1_1arg__adapt__window.html new file mode 100644 index 00000000000..cb19c3d999f --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__adapt__window.html @@ -0,0 +1,226 @@ + + + + + +Stan: stan::gm::arg_adapt_window Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_adapt_window Class Reference
+
+
+ +

#include <arg_adapt_window.hpp>

+
+Inheritance diagram for stan::gm::arg_adapt_window:
+
+
+ + +stan::gm::singleton_argument< T > +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_adapt_window ()
 
- Public Member Functions inherited from stan::gm::singleton_argument< T >
 singleton_argument ()
 
 singleton_argument (const std::string name)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
value ()
 
bool set_value (const T &value)
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
- Public Member Functions inherited from stan::gm::valued_argument
virtual void print (std::ostream *s, const int depth, const char prefix)
 
virtual void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Member Functions inherited from stan::gm::singleton_argument< T >
virtual bool is_valid (T value)
 
- Protected Attributes inherited from stan::gm::singleton_argument< T >
std::string _validity
 
_value
 
_default_value
 
bool _constrained
 
_good_value
 
_bad_value
 
+

Detailed Description

+
+

Definition at line 10 of file arg_adapt_window.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_adapt_window::arg_adapt_window ()
+
+inline
+
+ +

Definition at line 14 of file arg_adapt_window.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__adapt__window.png b/doc/api/html/classstan_1_1gm_1_1arg__adapt__window.png new file mode 100644 index 0000000000000000000000000000000000000000..0bca64d806d0976dc3fd5dc8469d22aeba11f777 GIT binary patch literal 1635 zcmc&#X;4#F6n;UGO|T6hpezbc#e%3bC~FXmB~L@N2+B}t3Wf?rWQ}Ykgo;ZLNeKIz z3Mm2_izvtA&8Yd%tsMzH?^Ix$}LOdIImE zt+_=L003RX!eDp;=Y2$}RKnrZ%p!@_Mu($Mo6F^@QiW#l zRXxTFe-eO6YiqFE+ZF&+=OK)ncN}82L=YvtgTxda@p-MxOm27FcZtsC&%YzSzeo~j zTzyfq{xSOp_FyTx8aS{s0C|W3<*%nNppmNMVXf#U=ur-)VBT6VoV_@Ei$q@PA>3S) zJr_PARiy0a+ZvC5!MVgMPVmL0u!8Eu=7P?!;KJgr2O7ZevL`t5QTwT|P?v(*(_q#R zx}l*j+{xsrl}`AQ4K;q!AGw>)tjaGRj-z1^jx-rYqT29G$->8gUZaN0bZ?uFa*^** zIa}C1IO*P4*KsTm718W;0J~QC*1B;%?R2EVO07Yhj5jyYr<9n{fCizGe7vW~c)XM5 z0i2no73)w4=d$)`Z0iDXD%e8ofZuKZ+hCHAz#tZ3fVm*Oo!hHIR03ew-EE9>_ktTw zWr1)41i^D)FmP=kxT7Ey!XCBN$f9QxkuVW1^$)~1v6+>1rxI5xRrvX-5U`eh=%p&C z$&EI}w>X+|HHvt4VE4jQZIUNdNcMXd`&_Oc-4b8WXJ?(|cdc>mK*aUzvW{JQA0x<; zJZ#UaRJkU&N6S~5VdZeaFyQ*cX=^G@Yr~)EgdH#HiE*4rBmcC3P6YLW!`2&!wuuV*5@_RYBHLRnfI;|+l^ZabipgPEW(X`o^ct`Z8R7+B7C#U5m|MC zWszgBP=lY0P%R_B5cyWiWc9;6Q8$HYii=j(xk@{unPTu`q&;PF3FdMF|F^+=d6WV2p61=` z32HEq$W)IB?;MFecz+lIz~n3IxtUA-?-`aS!(X*l+8HDzDhBv+B@G#zJ9eO2u!4$HDPC1XC!RtdOsB z^*xZP3EI)uz(8(a4)nmkUxl=Hdstf7QL$ubEOvHG93inJ;u6N>O2?kJ4s3URrl9a9w1i=7Tp3W}kys{%pYKTs z?_9~4uG(r;1lLPEjzyzQTrT_9IoJcMQvCMNM~62->C?R0C%J8o!vgw1!6$B)5^rqz^-~*w4%_m?{AV5zL_K&+h476k~RO@L@ z`CzM=MIS(=?1MosNatT=^I!Be*Nn~fN^?o_2D?h_VR2zKKZ$X{oGRWgG1oE8EVAjI zIL@H!Ekq*wRh{D%D>{1Sy$_}H`hMZco?cN`=yRc=g^kP8v^<%t!M66&DTv P2mo{hkGbpq-A{i3GT;bZ literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1gm_1_1arg__bfgs-members.html b/doc/api/html/classstan_1_1gm_1_1arg__bfgs-members.html new file mode 100644 index 00000000000..290a33d163f --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__bfgs-members.html @@ -0,0 +1,133 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_bfgs Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_bfgs, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + +
_descriptionstan::gm::argumentprotected
_namestan::gm::argumentprotected
_subargumentsstan::gm::categorical_argumentprotected
arg(const std::string name)stan::gm::categorical_argumentinlinevirtual
arg_bfgs()stan::gm::arg_bfgsinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::categorical_argumentinlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::categorical_argumentinlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::categorical_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse)stan::gm::categorical_argumentinlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::categorical_argumentinlinevirtual
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
subarguments()stan::gm::categorical_argumentinline
~argument()stan::gm::argumentinlinevirtual
~categorical_argument()stan::gm::categorical_argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__bfgs.html b/doc/api/html/classstan_1_1gm_1_1arg__bfgs.html new file mode 100644 index 00000000000..7560c379c83 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__bfgs.html @@ -0,0 +1,201 @@ + + + + + +Stan: stan::gm::arg_bfgs Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_bfgs Class Reference
+
+
+ +

#include <arg_bfgs.hpp>

+
+Inheritance diagram for stan::gm::arg_bfgs:
+
+
+ + +stan::gm::categorical_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_bfgs ()
 
- Public Member Functions inherited from stan::gm::categorical_argument
virtual ~categorical_argument ()
 
void print (std::ostream *s, const int depth, const char prefix)
 
void print_help (std::ostream *s, const int depth, const bool recurse)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
std::vector< argument * > & subarguments ()
 
argumentarg (const std::string name)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
int compute_indent (const int depth)
 
+ + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Attributes inherited from stan::gm::categorical_argument
std::vector< argument * > _subarguments
 
+

Detailed Description

+
+

Definition at line 13 of file arg_bfgs.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_bfgs::arg_bfgs ()
+
+inline
+
+ +

Definition at line 17 of file arg_bfgs.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__bfgs.png b/doc/api/html/classstan_1_1gm_1_1arg__bfgs.png new file mode 100644 index 0000000000000000000000000000000000000000..d79317443f50e83145b8f6439970d8b32d83995d GIT binary patch literal 1015 zcmeAS@N?(olHy`uVBq!ia0vp^JAt@^gBeKngzicMQW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;9$<|bHQAb#3ICt3go*zEo`8eVcuA-!|VA?G4|iRRvEfIkWctg~ze^HIjGI z^1R$9g~_;kT*`cB{rU0q6Rp>KRAdXXw|Y#HPSo?<*RoUP=O>f%md^zle@OB-C`w-Y z^HCzSHsbU09}8YRp5>m;_(AOqV-069L;N9`1Je!IKd9p4Moca~=j=3X2_t8*=OoiNhv!n+t|7X?X`Kn91&37VX`w8-MjzHMtJYmQ(G$T9?H3{ zHTA>M8osPclTz$b?|v_O%l5i)Qf$xm#j}-j4)-+eot(PxT#aQ{+WoT9$(iSK-Pa|G z-W7EapS9%M=6#vby6@w^&Z_jS_*Q&)0wMv3glkscL?+xLtSpx6;7xhPD-cdfaD) zr}zDz^z%)~nKWUcv&(PneLMYx)U6rsbyy49RzG`|UYC6}Q90*Q)UO}k{2Pj6)&mpa z(+PZMpPvYRX1`|IwYN`ZsxL^t{%85sPZ#f8`Md1r{Z*fXbeF15soU@-U;d2Mu9Dfk z_mb4=qI4O4%dFoj{qbn_Q@!HoqYSq1!w-CUAEo7Ryf^*cONNp+ZZgZ6BHpbPW6+2C iVrkjRDM3=*{~4Zec`c4CS1SbOQU*^~KbLh*2~7Yco%Y)R literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1gm_1_1arg__data-members.html b/doc/api/html/classstan_1_1gm_1_1arg__data-members.html new file mode 100644 index 00000000000..91be23151ec --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__data-members.html @@ -0,0 +1,133 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_data Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_data, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + +
_descriptionstan::gm::argumentprotected
_namestan::gm::argumentprotected
_subargumentsstan::gm::categorical_argumentprotected
arg(const std::string name)stan::gm::categorical_argumentinlinevirtual
arg_data()stan::gm::arg_datainline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::categorical_argumentinlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::categorical_argumentinlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::categorical_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse)stan::gm::categorical_argumentinlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::categorical_argumentinlinevirtual
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
subarguments()stan::gm::categorical_argumentinline
~argument()stan::gm::argumentinlinevirtual
~categorical_argument()stan::gm::categorical_argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__data.html b/doc/api/html/classstan_1_1gm_1_1arg__data.html new file mode 100644 index 00000000000..7db2001ebe8 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__data.html @@ -0,0 +1,201 @@ + + + + + +Stan: stan::gm::arg_data Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_data Class Reference
+
+
+ +

#include <arg_data.hpp>

+
+Inheritance diagram for stan::gm::arg_data:
+
+
+ + +stan::gm::categorical_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_data ()
 
- Public Member Functions inherited from stan::gm::categorical_argument
virtual ~categorical_argument ()
 
void print (std::ostream *s, const int depth, const char prefix)
 
void print_help (std::ostream *s, const int depth, const bool recurse)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
std::vector< argument * > & subarguments ()
 
argumentarg (const std::string name)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
int compute_indent (const int depth)
 
+ + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Attributes inherited from stan::gm::categorical_argument
std::vector< argument * > _subarguments
 
+

Detailed Description

+
+

Definition at line 12 of file arg_data.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_data::arg_data ()
+
+inline
+
+ +

Definition at line 16 of file arg_data.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__data.png b/doc/api/html/classstan_1_1gm_1_1arg__data.png new file mode 100644 index 0000000000000000000000000000000000000000..ce97d963b9f3ebc9c997b258849b7c8d3c43cd0f GIT binary patch literal 1001 zcmeAS@N?(olHy`uVBq!ia0vp^JAt@^gBeKngzicMQW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;4LqPOuvtM?NE^|JX+&pePm$fzL%P>2OxsjD$;@$5 z-_DGCb?5z7^GPQfuT7TSAvtY{aLl@Cn_BO_t2K#NvY$2k=)N+i@7rEZuAHWs-h6v-&Ei_&o7`*mF14GYB3u00`isTuUj63V zXMA6JTxxsF;c0cYwz}?*(9RFDCN5#lTPx;Sq8cHmv{1ATcTN ztbBjq)ppbQN7zH#a7Z)INy$QuF3l`LUxm>fdYTI!(G)toy6o z_LZ7nPY3eY(C#Qa%WeyeV2?Zy2`cBU88|LaeG{v_|)rNq-q>tnCjY-69EpSxFx ztDwpIS$D8uw2w#0{G{)j@+X>Jc~c}A)5 + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_data_file Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_data_file, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_bad_valuestan::gm::singleton_argument< T >protected
_constrainedstan::gm::singleton_argument< T >protected
_defaultstan::gm::valued_argumentprotected
_default_valuestan::gm::singleton_argument< T >protected
_descriptionstan::gm::argumentprotected
_good_valuestan::gm::singleton_argument< T >protected
_namestan::gm::argumentprotected
_validitystan::gm::singleton_argument< T >protected
_valuestan::gm::singleton_argument< T >protected
_value_typestan::gm::valued_argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_data_file()stan::gm::arg_data_fileinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::singleton_argument< T >inlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::singleton_argument< T >inlinevirtual
is_valid(T value)stan::gm::singleton_argument< T >inlineprotectedvirtual
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::singleton_argument< T >inlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::valued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::valued_argumentinlinevirtual
print_valid()stan::gm::singleton_argument< T >inlinevirtual
print_value()stan::gm::singleton_argument< T >inlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::singleton_argument< T >inlinevirtual
set_value(const T &value)stan::gm::singleton_argument< T >inline
singleton_argument()stan::gm::singleton_argument< T >inline
singleton_argument(const std::string name)stan::gm::singleton_argument< T >inline
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
value()stan::gm::singleton_argument< T >inline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__data__file.html b/doc/api/html/classstan_1_1gm_1_1arg__data__file.html new file mode 100644 index 00000000000..6da951ce2a1 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__data__file.html @@ -0,0 +1,226 @@ + + + + + +Stan: stan::gm::arg_data_file Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_data_file Class Reference
+
+
+ +

#include <arg_data_file.hpp>

+
+Inheritance diagram for stan::gm::arg_data_file:
+
+
+ + +stan::gm::singleton_argument< T > +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_data_file ()
 
- Public Member Functions inherited from stan::gm::singleton_argument< T >
 singleton_argument ()
 
 singleton_argument (const std::string name)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
value ()
 
bool set_value (const T &value)
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
- Public Member Functions inherited from stan::gm::valued_argument
virtual void print (std::ostream *s, const int depth, const char prefix)
 
virtual void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Member Functions inherited from stan::gm::singleton_argument< T >
virtual bool is_valid (T value)
 
- Protected Attributes inherited from stan::gm::singleton_argument< T >
std::string _validity
 
_value
 
_default_value
 
bool _constrained
 
_good_value
 
_bad_value
 
+

Detailed Description

+
+

Definition at line 10 of file arg_data_file.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_data_file::arg_data_file ()
+
+inline
+
+ +

Definition at line 14 of file arg_data_file.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__data__file.png b/doc/api/html/classstan_1_1gm_1_1arg__data__file.png new file mode 100644 index 0000000000000000000000000000000000000000..33718f127f6b336a1555633e50fdceaeaf53b0f5 GIT binary patch literal 1429 zcmaJ>do#auCbyAsjd2~7%V0Dlo07row5Q#3_Uz?7=l$OIJKyvE^E}V@rk+N-Zd27# z1pr_hh;qirD_@>m6(#wZJ8_{=UNldi@NkjIWb$@avP_{jX2`oglFQ|8P8I6PuPTuk zv^yXNeF{Ol#{mG?3X|vzjZLqIX;JOH6a)&09u!#s0g^ zJs~FliHIHPt7d`{WVP18YzBqJUg^YY;SomIVwqc4qJKV)RCwBM{}1~YZWxJSZ)Uu6 zrv0z0<8S38BRng<6-w(_hsa+rv|?Xl;Q`<2f6_`@`U5Bg;^YX_PUb#E|(DP8l!ca?LZ5l2CXaeJgO7*DT5 zF&u?142dmNb5i$uF@2|oAH2T909x!*8t*bwk9|V zH*<9s6#dkr6)KYJfT57`B@h3_$q^$mV@5r|C`a#nt&svSW~y9c+}S zYA1W9d!KL%J3M+Kq-Q7dII!!GY0W!{8Hnt2pSOhpn*5?hVai-aUuDyPDhpr@54HUQu z7Aoss-p$>L7}G9+PGW}oaL{TAoWkJ{w4e}~N9tL1ab!dPc%sK)Lg%B%#88`GTg$4~ zq8398kmj9CpEYfzij;rQ_do0= z;N&XlZ8r*5`J~x6f)Pk>H9|dij5`%{*9Yqx!efxBb)r&yBJ=u-T3bSSIiD)%)U884c4N6A2Vx~r zcuQWG1iEP@?!Wzku={bfXjGfn{b)jMWX7B1w;cOmbnFlhF3uoAEjVmDv`|1qNCQxe zb7rN( zyZNT|c^1^7*Ukf#oc(!K1{F`A--kI13+GZGi!}rGgX~jUZ|1UyVV)(~sB0$$ zPxR`^34=m1%d26oaPG;Cnvd_4aY?K0P|&$PHX-tCh)&JUf?_y-y!aDrL`tFM)@{l! zEREOa0cDF%uLk=RulG?NRT40?LPL|i$683o@~>bz3#rh|5LvINSQ;d4K`Mv0#pGN1 zq5%s68F}j3@^=ox4wL%|u$6(@d-PZ9)`~vkRHX7^`NZe%9?A<;(O(< + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_dense_e Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_dense_e, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + +
_descriptionstan::gm::argumentprotected
_is_presentstan::gm::unvalued_argumentprotected
_namestan::gm::argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_dense_e()stan::gm::arg_dense_einline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::argumentinlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_present()stan::gm::unvalued_argumentinline
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::unvalued_argumentinlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::unvalued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::unvalued_argumentinlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::argumentinlinevirtual
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
unvalued_argument()stan::gm::unvalued_argumentinline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__dense__e.html b/doc/api/html/classstan_1_1gm_1_1arg__dense__e.html new file mode 100644 index 00000000000..ae05b5dc3a8 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__dense__e.html @@ -0,0 +1,201 @@ + + + + + +Stan: stan::gm::arg_dense_e Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_dense_e Class Reference
+
+
+ +

#include <arg_dense_e.hpp>

+
+Inheritance diagram for stan::gm::arg_dense_e:
+
+
+ + +stan::gm::unvalued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_dense_e ()
 
- Public Member Functions inherited from stan::gm::unvalued_argument
 unvalued_argument ()
 
void print (std::ostream *s, const int depth, const char prefix)
 
void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
bool is_present ()
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
virtual void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Attributes inherited from stan::gm::unvalued_argument
bool _is_present
 
+

Detailed Description

+
+

Definition at line 10 of file arg_dense_e.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_dense_e::arg_dense_e ()
+
+inline
+
+ +

Definition at line 14 of file arg_dense_e.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__dense__e.png b/doc/api/html/classstan_1_1gm_1_1arg__dense__e.png new file mode 100644 index 0000000000000000000000000000000000000000..8dc6a23792d99e7bbdef044e5507a2d0a5cf5950 GIT binary patch literal 1001 zcmeAS@N?(olHy`uVBq!ia0vp^>wvg}gBeJAsw;d4QW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;}3fn z?=8FVd9iQZS)J{9C3TT)ua_9UX%;Q^w7O_}N40Ky(xfw?6T&8?Mf&z`KAO)rsbtmd z9dC?B3eyP6YT)nuK+rntg+=cI4Ci#86u>RK9pz|hg*$aGA zJudlO7n@Y#?w|5~*WvrWc_%F4whiH#^hKI0#`9Cq1FuQb)$YtGmUCl}t77a~ys;pD z{lbdlhvsIuKa%A!w_{LA&qxw$j-HA(f-xbQ{Qnq{mq^1s&5~|RtLvCE-$#!SN7HHU7}%0Li^0Wdb`WMZ7DO~v25D* z#j5Ln&yBsdj(6UYf4lVBiny|ug|Sy3+O}9W@BKczeJ^>|vdXNz80EA5>hJwo{aaH! zZ@tR9oonE%<6dVy4xFG?vHH-fjMt*e=PuN4 zYqw%PuyUQP{QskWM85x-ZQA|w$(*OBWj1;r?%!Ok{6*HQ!TihQB!(ZUFu!cQx@5{F bhF|QO*WJ3WFg_Cp=1T@oS3j3^P6 + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_diag_e Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_diag_e, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + +
_descriptionstan::gm::argumentprotected
_is_presentstan::gm::unvalued_argumentprotected
_namestan::gm::argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_diag_e()stan::gm::arg_diag_einline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::argumentinlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_present()stan::gm::unvalued_argumentinline
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::unvalued_argumentinlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::unvalued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::unvalued_argumentinlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::argumentinlinevirtual
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
unvalued_argument()stan::gm::unvalued_argumentinline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__diag__e.html b/doc/api/html/classstan_1_1gm_1_1arg__diag__e.html new file mode 100644 index 00000000000..aa5e8c02554 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__diag__e.html @@ -0,0 +1,201 @@ + + + + + +Stan: stan::gm::arg_diag_e Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_diag_e Class Reference
+
+
+ +

#include <arg_diag_e.hpp>

+
+Inheritance diagram for stan::gm::arg_diag_e:
+
+
+ + +stan::gm::unvalued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_diag_e ()
 
- Public Member Functions inherited from stan::gm::unvalued_argument
 unvalued_argument ()
 
void print (std::ostream *s, const int depth, const char prefix)
 
void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
bool is_present ()
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
virtual void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Attributes inherited from stan::gm::unvalued_argument
bool _is_present
 
+

Detailed Description

+
+

Definition at line 10 of file arg_diag_e.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_diag_e::arg_diag_e ()
+
+inline
+
+ +

Definition at line 14 of file arg_diag_e.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__diag__e.png b/doc/api/html/classstan_1_1gm_1_1arg__diag__e.png new file mode 100644 index 0000000000000000000000000000000000000000..c79a1cf977b4538c06b7cbdde5a8ebefc3e6ee4c GIT binary patch literal 996 zcmeAS@N?(olHy`uVBq!ia0vp^>wvg}gBeJAsw;d4QW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;w(|nrG4Duy6l^&3#W^ zDw`Q}KECu*cG^yp#h>L*e=y5rx}BmLGs$nq^4(AJ-_20@tm(Ddv-ghE*`(F+;vSbY zx0k+tofWe!F*$RZ=^JML!;?zRNgoX`TYYnR@LknUA=g!^zpeOc_Qc2B^VY@NvDVt2 z%l~XBE8n$j+V9o`uOH=I3uPYsoU>*77WEwI+-L{=g4aB^Cj*V;|GO&o{;QeG{x+;z z$>V8NAgkzEUXfJ3-ulnp`wX7D9xP0nu;ji%iR#Jj3sY6})$YzImSbb!k7IajFzwxI z(<$#Gc1?ckv9I~1TROuB{@?4U|;e}zirAt`Ibq~WjxSNAOMkqxBTDqAg{*`OcJe7Jv)~FexU5T((c4J z@m&n|PlC#`O5@k=jM?{SHmkS1&h%}Q^H=6Bk9nMZChym)#C0Xp-@LZ%s{IX2Z|=bK z_L}$1FEz)_AH!#tuZ^B;qL=$Gt6;}w(-j~0=J>zR^N)|a?+Z+CG218S%KZ*0kLS6* zi}S|i&iC*24shmQf9H4oN>TXt@a*j(&M$eqON!mA56ueR|7(6}o8RLfTZ|dz6z%;} zbeJLU)5LdQZ%0ReHDCTBN$S9-oA2&bR6iFq*PXA;)^Hz|j<%Ui3i4w9z&~xSTWzZE SR9|40WbkzLb6Mw<&;$VHxa~>+ literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1gm_1_1arg__diagnose-members.html b/doc/api/html/classstan_1_1gm_1_1arg__diagnose-members.html new file mode 100644 index 00000000000..1d71ee6010c --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__diagnose-members.html @@ -0,0 +1,133 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_diagnose Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_diagnose, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + +
_descriptionstan::gm::argumentprotected
_namestan::gm::argumentprotected
_subargumentsstan::gm::categorical_argumentprotected
arg(const std::string name)stan::gm::categorical_argumentinlinevirtual
arg_diagnose()stan::gm::arg_diagnoseinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::categorical_argumentinlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::categorical_argumentinlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::categorical_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse)stan::gm::categorical_argumentinlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::categorical_argumentinlinevirtual
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
subarguments()stan::gm::categorical_argumentinline
~argument()stan::gm::argumentinlinevirtual
~categorical_argument()stan::gm::categorical_argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__diagnose.html b/doc/api/html/classstan_1_1gm_1_1arg__diagnose.html new file mode 100644 index 00000000000..aadfef6989d --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__diagnose.html @@ -0,0 +1,201 @@ + + + + + +Stan: stan::gm::arg_diagnose Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_diagnose Class Reference
+
+
+ +

#include <arg_diagnose.hpp>

+
+Inheritance diagram for stan::gm::arg_diagnose:
+
+
+ + +stan::gm::categorical_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_diagnose ()
 
- Public Member Functions inherited from stan::gm::categorical_argument
virtual ~categorical_argument ()
 
void print (std::ostream *s, const int depth, const char prefix)
 
void print_help (std::ostream *s, const int depth, const bool recurse)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
std::vector< argument * > & subarguments ()
 
argumentarg (const std::string name)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
int compute_indent (const int depth)
 
+ + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Attributes inherited from stan::gm::categorical_argument
std::vector< argument * > _subarguments
 
+

Detailed Description

+
+

Definition at line 12 of file arg_diagnose.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_diagnose::arg_diagnose ()
+
+inline
+
+ +

Definition at line 16 of file arg_diagnose.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__diagnose.png b/doc/api/html/classstan_1_1gm_1_1arg__diagnose.png new file mode 100644 index 0000000000000000000000000000000000000000..4fc7cf092a9067a58e41169a721d2ef42868966e GIT binary patch literal 1040 zcmeAS@N?(olHy`uVBq!ia0vp^JAt@^gBeKngzicMQW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;;<^9W*Ejz=E2Ta! zdzu{c^z+uZn)sP^T^G;yXIAXYU^<;*88a#Bj^X@iT4Mf_ex5Gdd_`(!%dC^%{H}3M zy7Fw<&tEp&Yg2D<%+6#jeUKJ0Nv~jc)F&~q-Q`(!uJdNiPT61P^nKgQGd7;9Zrm=e z4xMzXCiMB#ohyI;^)h_=E>3qRYfWGH&Rw=MPG{V7`NlN;-ljWKRJK-rk-Zi7_2Be_ z$kzCla|acv??wB_`7w^8P$^?mQ+f)U;1Pi_rGSX`2Fx@{YhUwC(qr=Q?uw<{AC;A zz0;pgu8BOP6R!32!_^utt!1hw|2*AOysN13t;4*zz26si>*^ftY1%v4G%$5vp6kZE znRm}@`CXHoW1M5vCX>Ad!?*Qwm+>~9QEnp*}DmI6ZoGQ?V3|l{OBKza(YSQn-JbyIry0^zA!|#jg zEk0Lm^|-X(1?2lgJd#=daX4L*Gy8qteEWM3 zUH@DO{_Os4U3!pWXr|WGrYNMFkfue^wZ`+|5A5HX7ueM3awF^ZiJx75qPTeS*}A8y#bOP$x74@PP0{_# za^=kt`MTI#hw|5ZjLb{-XV)z~_gcDQ(YfdD=5xPl?(oRvPrGRTEZXw5uJ>zAu1`Df zF%_Jex}2-vME~^v$NroWp1bSo!OCoP28#!)ZS(CehPhZX9RJc ctM((iLcG`GFP~T!0kbcIr>mdKI;Vst06EtLE&u=k literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1gm_1_1arg__diagnostic__file-members.html b/doc/api/html/classstan_1_1gm_1_1arg__diagnostic__file-members.html new file mode 100644 index 00000000000..a38083a4ca1 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__diagnostic__file-members.html @@ -0,0 +1,146 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_diagnostic_file Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_diagnostic_file, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_bad_valuestan::gm::singleton_argument< T >protected
_constrainedstan::gm::singleton_argument< T >protected
_defaultstan::gm::valued_argumentprotected
_default_valuestan::gm::singleton_argument< T >protected
_descriptionstan::gm::argumentprotected
_good_valuestan::gm::singleton_argument< T >protected
_namestan::gm::argumentprotected
_validitystan::gm::singleton_argument< T >protected
_valuestan::gm::singleton_argument< T >protected
_value_typestan::gm::valued_argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_diagnostic_file()stan::gm::arg_diagnostic_fileinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::singleton_argument< T >inlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::singleton_argument< T >inlinevirtual
is_valid(T value)stan::gm::singleton_argument< T >inlineprotectedvirtual
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::singleton_argument< T >inlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::valued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::valued_argumentinlinevirtual
print_valid()stan::gm::singleton_argument< T >inlinevirtual
print_value()stan::gm::singleton_argument< T >inlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::singleton_argument< T >inlinevirtual
set_value(const T &value)stan::gm::singleton_argument< T >inline
singleton_argument()stan::gm::singleton_argument< T >inline
singleton_argument(const std::string name)stan::gm::singleton_argument< T >inline
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
value()stan::gm::singleton_argument< T >inline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__diagnostic__file.html b/doc/api/html/classstan_1_1gm_1_1arg__diagnostic__file.html new file mode 100644 index 00000000000..e9459f663e8 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__diagnostic__file.html @@ -0,0 +1,226 @@ + + + + + +Stan: stan::gm::arg_diagnostic_file Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_diagnostic_file Class Reference
+
+
+ +

#include <arg_diagnostic_file.hpp>

+
+Inheritance diagram for stan::gm::arg_diagnostic_file:
+
+
+ + +stan::gm::singleton_argument< T > +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_diagnostic_file ()
 
- Public Member Functions inherited from stan::gm::singleton_argument< T >
 singleton_argument ()
 
 singleton_argument (const std::string name)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
value ()
 
bool set_value (const T &value)
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
- Public Member Functions inherited from stan::gm::valued_argument
virtual void print (std::ostream *s, const int depth, const char prefix)
 
virtual void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Member Functions inherited from stan::gm::singleton_argument< T >
virtual bool is_valid (T value)
 
- Protected Attributes inherited from stan::gm::singleton_argument< T >
std::string _validity
 
_value
 
_default_value
 
bool _constrained
 
_good_value
 
_bad_value
 
+

Detailed Description

+
+

Definition at line 10 of file arg_diagnostic_file.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_diagnostic_file::arg_diagnostic_file ()
+
+inline
+
+ +

Definition at line 14 of file arg_diagnostic_file.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__diagnostic__file.png b/doc/api/html/classstan_1_1gm_1_1arg__diagnostic__file.png new file mode 100644 index 0000000000000000000000000000000000000000..01ccad3a49f58858b705e7799ec2ab46cbad7198 GIT binary patch literal 1468 zcma)+doa{n9Ke6BM@C%St2}zC7TMT}kXUBBWPf(sY9o|gl1(L>*UsjVSGuANZ8Ltk z9=)hpiIQurwd|FTy+-!o_CeC9JJ^AN#H zPsdCL002D@>p_IG5Dvb!Iy@H*gf+p*9YD<$L8UEvG3LuKo@_pRbuI-vlqU zV~K<#0DS1nkhb~Q0e~hB^uYLBP#Z5AshUO_cp4WV`&8E}EfKnZ;73^vi5HPLbjcZi zMsnsZ0mj^0Y*2d@(esRic)oE{tp>Pg>Qu$WU8pg7nG?p9_$4jG+b0{9O59_n7OQk@ zZj?rXdquVoXX>sCrmVQDue889TJI53M&+a-Nc|N!vZkk(Y{2_Y+0jldYL>-_&YaBO zY&ayHP8x0{LCBs>6Dz%kCO8_P9xsm7=PlN3cp78|omG95`TZWDTmB?gj$g-C9^?(l z#MAsy%?d?#nKfuUFXAQ3bAkd1eRS5^LPW%#?A(&E1;8UbA zkWjli1ufU)Z=CocSpT1G=*st)!UEF}Z|)tReZBA*1AQo850fez+1{AQ%Xe>kX-T|% z-`uy&dbr6tQshIiJx+Mb>^jj$>F}#IC>aGw{>M;D(+#(+$oGSqk?cY|vu=IeV5Y60 zR*98h4W|XABb}oX({w5g9E}dSX1jf`P*}e=OJ|HvwYNFUMfvhxd`dbWOQ?;N`J*G4 zO?kcbUFR)W!arBUwLVJ^j@_g|KhEKbP}rdvsY4zim(~o)XY+#ei)Yil*W^_?Dg50Y z#|O-$b~7#^q=^?MlOuhxL}A#7TV&5hkQtkG<`<`v%b2q!31wE|By>J=j1iI?h#a-L!RxWyfg8qLQ-J{G0z5(yzq%7VupLSD3ps zCbod^9$4k|?kB{ESpkyMzuysjMYPhHxrOjegu83p>2Z)Vx8B3*b$~NoGj1DMD)9=~ zyVBT*SUP2r6rl-zdbtnx2%D#gcgrzHzg(b12gjum7_+uaM|&WK?* zl?^ExPdMs8wnRM~lwHFtm6`UW)m%OhW&cEqpv$_e+&VZ$;pO8me!DlxteGgrNw1#D zr0QQ1^(OZ%u7lW@YV&(vSzyn;7vW|;E!WrQzge#03LJ5xU1s5EM{WgMfKo!$!D7~~ z@kYCd^FnrbIl3jw{xnyRrT$R1k2E>pYzcA;xi(aibx>VK2j^VQX7H>tW0cgbAmYTE ztrV1m;~-JU*#-{9JY>SUHwqBX9lt?pkyr>!T7dpJS3v88In;7;eST_SG4fd}V{kxW zlH&RA8vlpofm_lIv{Hec8ehe4NfjD<-eM6bV**iF7iPtsrnaZV7;2+(T{8w~b0s-` z!G;{h5ww3yD6+y%5k(5g(->(ija&?99;&BZOvz)T!p8$bsSgr~$q-?<)uH-5KA@4% zX;j0RPXE}JI?xltvSfRU9m#&%&%7Hu_qviQK1doqao}mZn3650v#O*);WrXcEWMOG z9rG`1tJ4SKTy_BHj!8&R`pTUI*)Ns)E{c-CpBsv84%Ed9jlDj;aESlEk)3?+ndy}_uo*_}Q4+P4#_9l|K}RfdWL r?a1t + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_engine Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_engine, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_cursorstan::gm::list_argumentprotected
_defaultstan::gm::valued_argumentprotected
_default_cursorstan::gm::list_argumentprotected
_descriptionstan::gm::argumentprotected
_namestan::gm::argumentprotected
_value_typestan::gm::valued_argumentprotected
_valuesstan::gm::list_argumentprotected
arg(std::string name)stan::gm::list_argumentinlinevirtual
arg_engine()stan::gm::arg_engineinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::list_argumentinlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::list_argumentinlinevirtual
list_argument()stan::gm::list_argumentinline
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::list_argumentinlinevirtual
print(std::ostream *s, int depth, const char prefix)stan::gm::list_argumentinlinevirtual
print_help(std::ostream *s, int depth, bool recurse)stan::gm::list_argumentinlinevirtual
print_valid()stan::gm::list_argumentinlinevirtual
print_value()stan::gm::list_argumentinlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::list_argumentinlinevirtual
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
valid_value(std::string name)stan::gm::list_argumentinline
value()stan::gm::list_argumentinline
values()stan::gm::list_argumentinline
~argument()stan::gm::argumentinlinevirtual
~list_argument()stan::gm::list_argumentinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__engine.html b/doc/api/html/classstan_1_1gm_1_1arg__engine.html new file mode 100644 index 00000000000..f1b1e8913ef --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__engine.html @@ -0,0 +1,205 @@ + + + + + +Stan: stan::gm::arg_engine Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_engine Class Reference
+
+
+ +

#include <arg_engine.hpp>

+
+Inheritance diagram for stan::gm::arg_engine:
+
+
+ + +stan::gm::list_argument +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_engine ()
 
- Public Member Functions inherited from stan::gm::list_argument
 list_argument ()
 
 ~list_argument ()
 
void print (std::ostream *s, int depth, const char prefix)
 
void print_help (std::ostream *s, int depth, bool recurse)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
bool valid_value (std::string name)
 
argumentarg (std::string name)
 
std::vector< argument * > & values ()
 
std::string value ()
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
+ + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Attributes inherited from stan::gm::list_argument
int _cursor
 
int _default_cursor
 
std::vector< argument * > _values
 
+

Detailed Description

+
+

Definition at line 13 of file arg_engine.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_engine::arg_engine ()
+
+inline
+
+ +

Definition at line 17 of file arg_engine.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__engine.png b/doc/api/html/classstan_1_1gm_1_1arg__engine.png new file mode 100644 index 0000000000000000000000000000000000000000..95f412d66ef20eedb164d6b71eafbbe1e5b04cff GIT binary patch literal 1298 zcmeAS@N?(olHy`uVBq!ia0vp^3xN0l2Q!e|@^pqPkdg@S332`Z|38rV;?396{zDUh zEHFNB-~emq9eE&^qa?^Lm;tB=1g@S6F=Aj~S?KBF7*fIbcJAxG#RfcX{`)*?|GUSX zQZ*0qczrG}EV+}}IKjGIWm$cv;jx*DUYGXlSfCPF;OM!@Kt)33>~+l_hlEfc8ZHN;A`Rq|pLH8b!HC>Ujmwdkz-sBkMoX_@pIZ(%4 z+Z!BV)tmP3xf=ForRu%expyBvRVdA0vO9J6H>O~5^>WWw$$wRM{&$hGUnF)gYp?3d zBeg9mu}QNI&dz@m0AwY`CVBn}j0u>e1M)-!OL9+P62rbz%n4~};x#sE=5t~TKF+>f zQ04eOi9uSABjF$`qs|V623B#F4G)?a#9{;vG;uRU6gV<)BP3hzt4k#J7&}i{QdtNL zl?P3eQWgsGO!^{uH>7&+e-8tlawjX@^VhxWe$;H5drC;V+Nn6%|CH*s+1UxJLPB-j z?;YO!KrCbl>q@I{yWDpcHC#8Z$`77qpQHUSW{u#P&rxUGBKMwJ;}pkX<~>KnI{%ul zz3#`24#`coABk{ga-9?HTj70BYyD-Fz27AS-slzD9-MS&<~^Qk{`%h&lq24rTy^pS$(l(@l3= z^Oqc1)Lp#$+a++4d;0OB{>kO>yZk@h6U({fFv)L?_5PW?6Ky=RD(l&*NFW1voK_cf68cJyqVihZnE?_y&XT!=34AsP;S`3i!ZeyCB;MUg?SWP zW-2nA>4qjs^CtUD`>@~gTugU9M-}{JvfV%N_e;qLm%RDQ|Ay2B1)u%J9CqDeQ@6B! z`lF=}0uyWZ@p>$g}(e~h~W03{^EEzkqCSA|JDbC~IeKkAWnBzin4Zm5_)p>8Y%DyG6`@L25 z-tG!+?N!(IPJH)l-@EdUme#6FB|rX5e`5E(>L~-;51$WNzNb1$zt2y5Zg< + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_fail Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_fail, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + +
_descriptionstan::gm::argumentprotected
_is_presentstan::gm::unvalued_argumentprotected
_namestan::gm::argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_fail()stan::gm::arg_failinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::argumentinlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_present()stan::gm::unvalued_argumentinline
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::unvalued_argumentinlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::unvalued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::unvalued_argumentinlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::argumentinlinevirtual
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
unvalued_argument()stan::gm::unvalued_argumentinline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__fail.html b/doc/api/html/classstan_1_1gm_1_1arg__fail.html new file mode 100644 index 00000000000..589e826616a --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__fail.html @@ -0,0 +1,201 @@ + + + + + +Stan: stan::gm::arg_fail Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_fail Class Reference
+
+
+ +

#include <arg_fail.hpp>

+
+Inheritance diagram for stan::gm::arg_fail:
+
+
+ + +stan::gm::unvalued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_fail ()
 
- Public Member Functions inherited from stan::gm::unvalued_argument
 unvalued_argument ()
 
void print (std::ostream *s, const int depth, const char prefix)
 
void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
bool is_present ()
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
virtual void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Attributes inherited from stan::gm::unvalued_argument
bool _is_present
 
+

Detailed Description

+
+

Definition at line 10 of file arg_fail.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_fail::arg_fail ()
+
+inline
+
+ +

Definition at line 14 of file arg_fail.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__fail.png b/doc/api/html/classstan_1_1gm_1_1arg__fail.png new file mode 100644 index 0000000000000000000000000000000000000000..53818ac2af0f44f4f9035fd62a68e8cd71a6be5a GIT binary patch literal 974 zcmeAS@N?(olHy`uVBq!ia0vp^>wvg}gBeJAsw;d4QW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;++19?MKOJs=cTsAcen1H zRC0>HxO{PT(N7COAFlttMpu|^=1;EktUeT#9naLqw(Zn~c`lRuDqn=Zty-Dh^^JL# znz2ge@vj`7yABKQu8w{9{x6%yC02gbW|hCJAosVdQ>iq3`E1T-1BQwZOcL!IOXAlr ztT}#ZZjSpWSs!yP<_7tN+z(t|FjWZdVu)+eYY@l7efQ_27eqP(*y<_pjZ`<;3*k;boUKIJ)^oCpc-OqXXZ|r8hz5DaVOZnZ~PqCk` zw5XlVbNck}&b-RryI;21{;oK^A~@Fg{eu;N;k-lJf={zlAKJEdZk~PZ&e|0`*_;+p$-0Jj7vK9ITD?Za z`_i=C2j9PZ*S}TeZ^O?&Us(U1eqdf+zPm-m_L%s=_v*l~EOrW?w1*?s^Hb8LvzE^j z89qEX&98-tl6e`IFdRr=HqwogM9!wD*ha-nEy+&q^&kR(Mf2 zG5f{4NFFoq_Pi(cMdn!E?<%_`k|nU^GX05czh Mr>mdKI;Vst0Mq>9=l}o! literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1gm_1_1arg__hmc-members.html b/doc/api/html/classstan_1_1gm_1_1arg__hmc-members.html new file mode 100644 index 00000000000..81e6ec610de --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__hmc-members.html @@ -0,0 +1,133 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_hmc Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_hmc, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + +
_descriptionstan::gm::argumentprotected
_namestan::gm::argumentprotected
_subargumentsstan::gm::categorical_argumentprotected
arg(const std::string name)stan::gm::categorical_argumentinlinevirtual
arg_hmc()stan::gm::arg_hmcinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::categorical_argumentinlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::categorical_argumentinlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::categorical_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse)stan::gm::categorical_argumentinlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::categorical_argumentinlinevirtual
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
subarguments()stan::gm::categorical_argumentinline
~argument()stan::gm::argumentinlinevirtual
~categorical_argument()stan::gm::categorical_argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__hmc.html b/doc/api/html/classstan_1_1gm_1_1arg__hmc.html new file mode 100644 index 00000000000..d0bd69559cc --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__hmc.html @@ -0,0 +1,201 @@ + + + + + +Stan: stan::gm::arg_hmc Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_hmc Class Reference
+
+
+ +

#include <arg_hmc.hpp>

+
+Inheritance diagram for stan::gm::arg_hmc:
+
+
+ + +stan::gm::categorical_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_hmc ()
 
- Public Member Functions inherited from stan::gm::categorical_argument
virtual ~categorical_argument ()
 
void print (std::ostream *s, const int depth, const char prefix)
 
void print_help (std::ostream *s, const int depth, const bool recurse)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
std::vector< argument * > & subarguments ()
 
argumentarg (const std::string name)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
int compute_indent (const int depth)
 
+ + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Attributes inherited from stan::gm::categorical_argument
std::vector< argument * > _subarguments
 
+

Detailed Description

+
+

Definition at line 15 of file arg_hmc.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_hmc::arg_hmc ()
+
+inline
+
+ +

Definition at line 19 of file arg_hmc.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__hmc.png b/doc/api/html/classstan_1_1gm_1_1arg__hmc.png new file mode 100644 index 0000000000000000000000000000000000000000..8b89c05de733a84e45c958e6e3c20d27b9c5546f GIT binary patch literal 993 zcmeAS@N?(olHy`uVBq!ia0vp^JAt@^gBeKngzicMQW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;C(>%p7D?WysAH9Noc;@k-&#Rom_#q~>wS zQ2gxa_mP=TAG+F8P2lhaPx9FuTod5~?x(3TSM z`FL{3*Tl2xA04kAH~oH(DWP{Z^NmN(7`E-OY|zc)OX$YO-Jo_%qP<1KlNl5^-Lt(X z>CUa3uw?#5>(bKCpIzLZO}bLBymE${(>|Z?&+VT+`+TlwrQ37;)G)aji{tK3tMvVH zP3!X`OV`Qk!n__Ht>Ij?jCJMDC8hDFuX0{v&MY&!*SBul2EJ^OTk4wJrO#5eSMB-w z>g<`a`}a4j5sNc}bbyJ4qahwn|Br*8AVI3q4;R%7hvtGn)U-mN+y{496t znos4N_rp*Bo40=1zV+ac)II#YbYG}*{@L3_`vY`eepr?lptgnGxc}MY`*VKp+n(dP zeeY6}iEB$j?Y;O*U&>}(U4QYC9nPYC=ps4@!7K`;A`R8z1tZg9upa~pnzY) zso0{Z$iUM9je|c2{w#CGg9Zd7ya29yC)-V+WX0S=c(P#Ty{0*c>LOVudhzpW{`Vx z;ZLETubkL&+dv7Y(QVE5>lt^Ku~&Of}bG9|P^9sER3)QKbcBY# + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_id Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_id, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_bad_valuestan::gm::singleton_argument< T >protected
_constrainedstan::gm::singleton_argument< T >protected
_defaultstan::gm::valued_argumentprotected
_default_valuestan::gm::singleton_argument< T >protected
_descriptionstan::gm::argumentprotected
_good_valuestan::gm::singleton_argument< T >protected
_namestan::gm::argumentprotected
_validitystan::gm::singleton_argument< T >protected
_valuestan::gm::singleton_argument< T >protected
_value_typestan::gm::valued_argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_id()stan::gm::arg_idinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::singleton_argument< T >inlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::singleton_argument< T >inlinevirtual
is_valid(int value)stan::gm::arg_idinline
stan::gm::singleton_argument::is_valid(T value)stan::gm::singleton_argument< T >inlineprotectedvirtual
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::singleton_argument< T >inlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::valued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::valued_argumentinlinevirtual
print_valid()stan::gm::singleton_argument< T >inlinevirtual
print_value()stan::gm::singleton_argument< T >inlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::singleton_argument< T >inlinevirtual
set_value(const T &value)stan::gm::singleton_argument< T >inline
singleton_argument()stan::gm::singleton_argument< T >inline
singleton_argument(const std::string name)stan::gm::singleton_argument< T >inline
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
value()stan::gm::singleton_argument< T >inline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__id.html b/doc/api/html/classstan_1_1gm_1_1arg__id.html new file mode 100644 index 00000000000..9598005e159 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__id.html @@ -0,0 +1,255 @@ + + + + + +Stan: stan::gm::arg_id Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_id Class Reference
+
+
+ +

#include <arg_id.hpp>

+
+Inheritance diagram for stan::gm::arg_id:
+
+
+ + +stan::gm::singleton_argument< T > +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_id ()
 
bool is_valid (int value)
 
- Public Member Functions inherited from stan::gm::singleton_argument< T >
 singleton_argument ()
 
 singleton_argument (const std::string name)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
value ()
 
bool set_value (const T &value)
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
- Public Member Functions inherited from stan::gm::valued_argument
virtual void print (std::ostream *s, const int depth, const char prefix)
 
virtual void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Member Functions inherited from stan::gm::singleton_argument< T >
virtual bool is_valid (T value)
 
- Protected Attributes inherited from stan::gm::singleton_argument< T >
std::string _validity
 
_value
 
_default_value
 
bool _constrained
 
_good_value
 
_bad_value
 
+

Detailed Description

+
+

Definition at line 10 of file arg_id.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_id::arg_id ()
+
+inline
+
+ +

Definition at line 14 of file arg_id.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
bool stan::gm::arg_id::is_valid (int value)
+
+inline
+
+ +

Definition at line 26 of file arg_id.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__id.png b/doc/api/html/classstan_1_1gm_1_1arg__id.png new file mode 100644 index 0000000000000000000000000000000000000000..eda6aa52dec42f38d5fe10f41565a6c2ceadeae1 GIT binary patch literal 1397 zcmcJPZBUX~6vrReEHW)!Z9>t_CTMH7317F=wl+5(d2BOLXpO{jGnITPLDbZ;9D6g& z6)OvS83i>#A4{bObzwAh7D5Ge2|=w0-_TrhP1KU5rv0$f%zoQDbM853?!6z*`Ty>@ z6dV*_ZRuzU0Dv`w+Z|%^a+8S>=BB+mF-2=~$l#v{{zjwG6poC~(DR#rHANpyEEZc_ z(yTS5h~$udU3Y7q}WDMg(7cvktV|`_`#r zyjB*GY314cXA$yFl|;mvBVOHM zym476;YK=a_A26}8hT>y__icTR1 zLY+s*9o!&99OY(Dy0tR=kt9%&5#ErGrd-gfGDqDPa`Ai%45cM$1vGzgGLx;9PPOPm znJW!_a3Lov`=4q&99ofD9Pln@nK;-g=C3qHx#ul8+Vh4Y4ZNcVs+O$B`!IP+WN))Je1k9wmcyI-^b5AeqkhSyvX#lNkl`YXHcySV!J?h>f=#~`xpD)Pam!6|R~R-)^^pbp7do?}NjzfACSgB@l22<$RCx?DhTexHhpjn@ ziloda?v14eM2}SWEN8!lc{@uu_seGU#z;_~_C2i!NgU?(ac7>a?8G~7!Re;Yk&9}d z3g@K=x?fmfH>)+|f-dH3rH=E*WmaKyog=gU#j8_j$TwU-LRadjf;doJkAW)EzM740 z!sawgpqvL%naOv2o5_Q8X4LYnOte~1fL2Aj=eo5O0EXqO&XgcKMy8N^DcjgktZUg6 zW4qEUto^eN{zrqwF;9@%U>gj@ z{ZVY!-t#kF{8OLMyuQO2(YK{q@rE9D7w!~I)y7J_xyyhNb2rp z`mP359i~z>aO1()mt_{=L!|xoL_U5o*E`DVoKN6uCJ&YWkgLL4OdyJ1QWbQ6En!l4 zwEdRHHz{Oao)QNj!zD z-MdatDwa{kCxk;zycikbm(K13OD8coDN6oh7#E->|BU7jAn2k9SWirTy&md& zq0zmOuTEAs(FbCSxh6gC_f89rD;EwS={4>U*IOAFGMCu{F;ljQ^ytwnv;Rkp9Gm7~ z8(?YkCk-FBkCYRkNZ8-wX!4$VDHytFY)~ll*a+Jbzd0#*jb_Rco?h$le2f9lcJ5=X zJNpuRVX`IMuCH9(`(8tgR-D=$_y+EAKI sp2zLx`eAd!rcb|D#`5_Q5oxt(&f1h&M9TM8m}VpZ`3LQW{SIgU4JMnhA^-pY literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1gm_1_1arg__init-members.html b/doc/api/html/classstan_1_1gm_1_1arg__init-members.html new file mode 100644 index 00000000000..b682b8223cf --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__init-members.html @@ -0,0 +1,146 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_init Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_init, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_bad_valuestan::gm::singleton_argument< T >protected
_constrainedstan::gm::singleton_argument< T >protected
_defaultstan::gm::valued_argumentprotected
_default_valuestan::gm::singleton_argument< T >protected
_descriptionstan::gm::argumentprotected
_good_valuestan::gm::singleton_argument< T >protected
_namestan::gm::argumentprotected
_validitystan::gm::singleton_argument< T >protected
_valuestan::gm::singleton_argument< T >protected
_value_typestan::gm::valued_argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_init()stan::gm::arg_initinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::singleton_argument< T >inlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::singleton_argument< T >inlinevirtual
is_valid(T value)stan::gm::singleton_argument< T >inlineprotectedvirtual
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::singleton_argument< T >inlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::valued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::valued_argumentinlinevirtual
print_valid()stan::gm::singleton_argument< T >inlinevirtual
print_value()stan::gm::singleton_argument< T >inlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::singleton_argument< T >inlinevirtual
set_value(const T &value)stan::gm::singleton_argument< T >inline
singleton_argument()stan::gm::singleton_argument< T >inline
singleton_argument(const std::string name)stan::gm::singleton_argument< T >inline
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
value()stan::gm::singleton_argument< T >inline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__init.html b/doc/api/html/classstan_1_1gm_1_1arg__init.html new file mode 100644 index 00000000000..dbddf1e612b --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__init.html @@ -0,0 +1,226 @@ + + + + + +Stan: stan::gm::arg_init Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_init Class Reference
+
+
+ +

#include <arg_init.hpp>

+
+Inheritance diagram for stan::gm::arg_init:
+
+
+ + +stan::gm::singleton_argument< T > +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_init ()
 
- Public Member Functions inherited from stan::gm::singleton_argument< T >
 singleton_argument ()
 
 singleton_argument (const std::string name)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
value ()
 
bool set_value (const T &value)
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
- Public Member Functions inherited from stan::gm::valued_argument
virtual void print (std::ostream *s, const int depth, const char prefix)
 
virtual void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Member Functions inherited from stan::gm::singleton_argument< T >
virtual bool is_valid (T value)
 
- Protected Attributes inherited from stan::gm::singleton_argument< T >
std::string _validity
 
_value
 
_default_value
 
bool _constrained
 
_good_value
 
_bad_value
 
+

Detailed Description

+
+

Definition at line 10 of file arg_init.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_init::arg_init ()
+
+inline
+
+ +

Definition at line 14 of file arg_init.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__init.png b/doc/api/html/classstan_1_1gm_1_1arg__init.png new file mode 100644 index 0000000000000000000000000000000000000000..fa6405c0c8aabd469522208894ab1affed847105 GIT binary patch literal 1390 zcmeAS@N?(olHy`uVBq!ia0vp^r-AqY2Q!eI`zZYokdg@S332`Z|38rV;?396{zDUh zEHFNB-~emq9eE&^qa?^Lm;tB=1g@S6F=Aj~`RnQ87*fIbcJA#>kJs?A&F){d=fCp* z&fc>JRX!@lEk1i~%I(Nz#|sJ%rb#5ruq;yHZQSiK$@Y%xq&I~JRXr}{&gpok_wZ(L zMEv=><@5i1{F+)Py7Y4WvqxW(LpSnFTjhNz&u{0Mx#EX8gT5~LsCW2`>Gf5ik8kOk zPgue{r}SiG08feTI+0arthq;hH>$`!tm#{tsh9R+@#&b)i@inP@PDt%*RtQq;>o+W zbme}pON@1!vv{$2Ta;m;NRzY>HcHANh$p06IH5hVv~9bc^KY3 zXEfko-f1KE_yo_BPa%?SX)5CO#~E}U=`nmO5ND{~!QEhchxLHmJEjEwa>fnqyBTgA zj%9fB5JmcdfZ;I<4i`@;CXmTHx>ar__j^xRQd~0opVhtp3%x7M_+G!3%=&dwK0f|g z_|4lcSrxLF>Fu?US(4h=j#FSyk6)rXs@ec@jOmb~(Gj;PW*{%PL=^|-e9BU;;K zd?xLxDLu&@eWuWI!m`PWPDxKsb6D-4F0|{c>dMo7GSNmU^H0x_b!{$9+AcUPNxaQGy9ebr_BAR zTDJG;_2zWjg+a|vpP#jy#=j=+N{xcqX9Z7F@%MkZ!&_Ch#&DM(Os!V&yrj2`_wJdG ztp)ZG)6bhvSCM^Gw4>Wn%`>e)+;dYqD4ERD1BM10!}re&5-p7}a{YxVY(C>mb zNU_##U#Z}KbaiFb)TNjIPv7Oe)+j(fO3UYC(c(?*o9>ng+U-7L*tNoO)x0ZjFGWxI zbou9M>9rCkb7E?9sxlreU3q&=?Z3?>CrgVqtom$Ja8so|kLQ;E*)w8WY;(G1x2_f2 zIXl_A?oF{~(HhzFQj6bD+V)O;dX|W9R~~=!*?aZ(e@jo_K6yvvy<4gtSufUle=hyM zYft3eKO1K!&z^E?YVz9SY1h9Ny*W_l$vN4tH}n70#OmmMXE%P6(LT2zw@;KkY<>H# zy9bMXCfRLzzsaI>>7N&Jx1MjZZBtqKG<)s6*1h^$RBBV7@5;&7_RP8&?j7`VPL_(N z^tb0TRBj%NRXHj5PRa9I#jYa~k0luHoM%oD00zFzv5Ar=o~|_NIpd*M*T)!f1S19G zN#F+*oj4K&I2fECK+}9o>CcNkPYllQKX=UJ5z~|B@;hwKf4=^7O5A!6*A+iE_^$K4iGT&fVCA5*+GYIn$0hQ6Ycs?VJbFKpdmzwPSs z?cV>Uo}MHW{OnE1%xtNW%;Gn@y&0l>cI15XethZV|6_}9>i@Spe#z48xaN~ry8EX+ zo19zSH+4DNfxx^y-}kfsE4*&L^U7|<1*v2HSmWgo;X**+|XW#QKw gC7d|^zy8B+(p9Nb`J~euSU56xy85}Sb4q9e0Oe<+0ssI2 literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1gm_1_1arg__init__alpha-members.html b/doc/api/html/classstan_1_1gm_1_1arg__init__alpha-members.html new file mode 100644 index 00000000000..6b6b9b4c9e7 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__init__alpha-members.html @@ -0,0 +1,147 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_init_alpha Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_init_alpha, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_bad_valuestan::gm::singleton_argument< T >protected
_constrainedstan::gm::singleton_argument< T >protected
_defaultstan::gm::valued_argumentprotected
_default_valuestan::gm::singleton_argument< T >protected
_descriptionstan::gm::argumentprotected
_good_valuestan::gm::singleton_argument< T >protected
_namestan::gm::argumentprotected
_validitystan::gm::singleton_argument< T >protected
_valuestan::gm::singleton_argument< T >protected
_value_typestan::gm::valued_argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_init_alpha()stan::gm::arg_init_alphainline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::singleton_argument< T >inlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::singleton_argument< T >inlinevirtual
is_valid(double value)stan::gm::arg_init_alphainline
stan::gm::singleton_argument::is_valid(T value)stan::gm::singleton_argument< T >inlineprotectedvirtual
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::singleton_argument< T >inlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::valued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::valued_argumentinlinevirtual
print_valid()stan::gm::singleton_argument< T >inlinevirtual
print_value()stan::gm::singleton_argument< T >inlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::singleton_argument< T >inlinevirtual
set_value(const T &value)stan::gm::singleton_argument< T >inline
singleton_argument()stan::gm::singleton_argument< T >inline
singleton_argument(const std::string name)stan::gm::singleton_argument< T >inline
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
value()stan::gm::singleton_argument< T >inline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__init__alpha.html b/doc/api/html/classstan_1_1gm_1_1arg__init__alpha.html new file mode 100644 index 00000000000..33c7730d042 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__init__alpha.html @@ -0,0 +1,255 @@ + + + + + +Stan: stan::gm::arg_init_alpha Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_init_alpha Class Reference
+
+
+ +

#include <arg_init_alpha.hpp>

+
+Inheritance diagram for stan::gm::arg_init_alpha:
+
+
+ + +stan::gm::singleton_argument< T > +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_init_alpha ()
 
bool is_valid (double value)
 
- Public Member Functions inherited from stan::gm::singleton_argument< T >
 singleton_argument ()
 
 singleton_argument (const std::string name)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
value ()
 
bool set_value (const T &value)
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
- Public Member Functions inherited from stan::gm::valued_argument
virtual void print (std::ostream *s, const int depth, const char prefix)
 
virtual void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Member Functions inherited from stan::gm::singleton_argument< T >
virtual bool is_valid (T value)
 
- Protected Attributes inherited from stan::gm::singleton_argument< T >
std::string _validity
 
_value
 
_default_value
 
bool _constrained
 
_good_value
 
_bad_value
 
+

Detailed Description

+
+

Definition at line 10 of file arg_init_alpha.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_init_alpha::arg_init_alpha ()
+
+inline
+
+ +

Definition at line 14 of file arg_init_alpha.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
bool stan::gm::arg_init_alpha::is_valid (double value)
+
+inline
+
+ +

Definition at line 26 of file arg_init_alpha.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__init__alpha.png b/doc/api/html/classstan_1_1gm_1_1arg__init__alpha.png new file mode 100644 index 0000000000000000000000000000000000000000..9658fe9aaae8cb98c508a21c5704767afd8de02f GIT binary patch literal 1507 zcmai!do=Q9sO-B=1S`*jXiJcG|Q3)7i88J?DP!z31Hfz32P6_uO<>XM4nE)y*&% z41sa5JucA#iLhm*B{!NPuPsq3uE(%;VzF3a&ddp8s86m*tiOfLX3M0%R+qT4&s60G3CzK`N(#%8xSgq*m2D`yLq7nnws(Yg1j zTTjjgsaN&D(i5o3WP*6)5FHNHMq2&B1mg=MN*rzySAx;!^PVRejqlf@tQjcv-oSAT zy~3EQ2R*B@q8$T~h6%TSKUr5_SP)ngEv&pK*ra=$@WAWcL1j`Jt}*rg80aOG%MXA1 z(1E*Z4ybus06iDho$-A96%uHrGmM8Gc?dTWO&OO$Vq+VP&%~ZgN|Nrf{rpU8mb@Hh zn16>J%NQ$6nXWC3zwmw@fYf|lmRs_d)aijOxR{RjO5pTo5!lwYPHc2V_mqVBLE_@C zzaRh&sCkg1C+7rPSa}WOm#RUpYIY38Vn5!gd5Egu8|Yb5$UriG281>A15zR7j14c3 zc*;~|GB>*-3EN9i&HF6FzY9pb?yr)D@^cMO`BuTg4FQ(a@q~i2Ad(C~I#1BC5?2jegt zmp8Xo6^;pI&oFdbG;n3);*Oo!8fIWeB55S^Og)bvlvNLV8~jDhU9Hh~z~477CY27k zL)D|6F9rr1(WT8zDa&@A99j*~6ADlxma3IN9KxjDw9PA{-sHBx`f{BWemdN_@_!gsaewJXQe)~`wHUSQ= zqW%Zaek(X96I7?y>3yhjZ^inF<)}l^1!M)sCK{S0FtODS>YGbv(KHmv z=TIX4uX);RlgjG*DrHxc+vg02!g8V1>BkDQSff`m!Cw*uxL|(|**u`*eD|QOjVSjp z!=+&*M;^7(ZM;yw)`iVM_-sXW4ST3DO29zYFDv3LkV@M%rxydFiCAo0zF&jsRr#8< z!Wuv)WE2nGm|?N-Ra5rl#F4 zqlb_tmwO>|3K3@8J7qauLD z##9=*3s0Y2cGHC7OxscbaqTP!N=6(A9cLbrklhGN>P3_y_-?Huw8(IK;c5QWP#X{} zE&bB|f5!j&Zn2d&?MX%LhSghsOC(_rtU5T}{6b{h#ObiR){^(#GjG2e-(DdiJX;hV zII0l%=<&P#t?koNEVI*LW|uI}1913)jT_Ep^kVJPtMr|VESGGHFmb`A#ytQlu=^*C z{(&Rvy1jS7?&Qe@?#>KMPqVisxty|yX6=!BGyW8wm9g#cpN>%7Bod6Cu{MHBo}#`O zc=N-kJHnFd4m}DZX(yNakUh3QnJmvBC6cg7Ao7CQn>M5bz;^}wyv$|w`!r8X#K4^! zvgOPtm*#9vwMu10PWj3VkHz#Er?m#95nU;*oGCN%eol2plBbZZCidOB?hhoZSA1I; grqh>yw4Pj(SN)h#K%7urmuzGh#?IN6Y3+C6F9Emc9RL6T literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1gm_1_1arg__int__time-members.html b/doc/api/html/classstan_1_1gm_1_1arg__int__time-members.html new file mode 100644 index 00000000000..4a584485085 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__int__time-members.html @@ -0,0 +1,147 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_int_time Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_int_time, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_bad_valuestan::gm::singleton_argument< T >protected
_constrainedstan::gm::singleton_argument< T >protected
_defaultstan::gm::valued_argumentprotected
_default_valuestan::gm::singleton_argument< T >protected
_descriptionstan::gm::argumentprotected
_good_valuestan::gm::singleton_argument< T >protected
_namestan::gm::argumentprotected
_validitystan::gm::singleton_argument< T >protected
_valuestan::gm::singleton_argument< T >protected
_value_typestan::gm::valued_argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_int_time()stan::gm::arg_int_timeinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::singleton_argument< T >inlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::singleton_argument< T >inlinevirtual
is_valid(double value)stan::gm::arg_int_timeinline
stan::gm::singleton_argument::is_valid(T value)stan::gm::singleton_argument< T >inlineprotectedvirtual
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::singleton_argument< T >inlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::valued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::valued_argumentinlinevirtual
print_valid()stan::gm::singleton_argument< T >inlinevirtual
print_value()stan::gm::singleton_argument< T >inlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::singleton_argument< T >inlinevirtual
set_value(const T &value)stan::gm::singleton_argument< T >inline
singleton_argument()stan::gm::singleton_argument< T >inline
singleton_argument(const std::string name)stan::gm::singleton_argument< T >inline
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
value()stan::gm::singleton_argument< T >inline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__int__time.html b/doc/api/html/classstan_1_1gm_1_1arg__int__time.html new file mode 100644 index 00000000000..c5c0a89f9d2 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__int__time.html @@ -0,0 +1,255 @@ + + + + + +Stan: stan::gm::arg_int_time Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_int_time Class Reference
+
+
+ +

#include <arg_int_time.hpp>

+
+Inheritance diagram for stan::gm::arg_int_time:
+
+
+ + +stan::gm::singleton_argument< T > +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_int_time ()
 
bool is_valid (double value)
 
- Public Member Functions inherited from stan::gm::singleton_argument< T >
 singleton_argument ()
 
 singleton_argument (const std::string name)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
value ()
 
bool set_value (const T &value)
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
- Public Member Functions inherited from stan::gm::valued_argument
virtual void print (std::ostream *s, const int depth, const char prefix)
 
virtual void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Member Functions inherited from stan::gm::singleton_argument< T >
virtual bool is_valid (T value)
 
- Protected Attributes inherited from stan::gm::singleton_argument< T >
std::string _validity
 
_value
 
_default_value
 
bool _constrained
 
_good_value
 
_bad_value
 
+

Detailed Description

+
+

Definition at line 10 of file arg_int_time.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_int_time::arg_int_time ()
+
+inline
+
+ +

Definition at line 14 of file arg_int_time.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
bool stan::gm::arg_int_time::is_valid (double value)
+
+inline
+
+ +

Definition at line 26 of file arg_int_time.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__int__time.png b/doc/api/html/classstan_1_1gm_1_1arg__int__time.png new file mode 100644 index 0000000000000000000000000000000000000000..c00910ac40d45114a81972f7e21cab6b28c1635b GIT binary patch literal 1482 zcmcK4|2NZn90%~p-A!uTZugdOb#HaKT+!`VCmMw!#W?nv*?gJ4tge~H)wp)ECO6cQ zu1FW79bx;-w&HFvWpk@5u~zaS-!eKzA4Hfk%$?4;e?ULn_c@RE>-9e8{nPu)^I{0r zA7yTBjzAz#0f!ER8Y^t1G&42Mo@tiO#$pu`2pn8qUN*L)<2pv}-&c*@M@ppiz)^~$ zE*vGrd^pm@=ttkg-CxB6d#qQC2<#zAqR(syzCT#*kXPC3DQZ?PPLBkgYc2IMyx9`$ z%E?T<&8vr-OL#pa*D1w+)qT!=e(bb6dWT0LoU|G;ExG04dZ+C;Gtz2f|1LO_(+v9W zi8rylmakIdpvGYwwDskHOVilB8X6znXYdA?(+ zoPsVY)m9{n27&Y{$xSAE<|!URMOV%D`_2~v9H?5ZVXTE-pFI~wE;C3X_;y;t#@n#M z0l-IWGkPuVVML{@L9ohfl<2xE@I>O+K-iSv{)S4b*)1H7fIMyc zgay<)DI7fcw|gPF1m|`Hy1R6wulNV7o5OK8KXN5G(c0|AwI}GlB)X?D4TAn z2jxxa+d`$CFl;}4<8$!$_A${$m1 z;r3kNM&Y+~a%D6|)aKNr$4g&ba(@m)>(oQI_@(@eprt2B40hQIqM3AM1pU;BU+4

Yjr|YmvlItO8Y&9UO^$Pp{>pN_($QPTe z(U|}4v_EczEy42*PIdH>0$Y;3uUsE#t@$AfnDmF#cQAddW0WR+60L5y>Vq3Cv0WEm z6@I*T>%&EJP1F_s+~#$uvw~}n#onjd7%M@7AKCo~LCp5ukQB(UyN9K8kl)q?q{NfO zg3f_88dD2b&C$Hf&8dQ(yNe-=(REWMt6M|s*<_*pO|6KC{BRZb{$rZpA*#eMkHi2f zuh8oNF{iRB)jO&Tnt#xNoG8P`u&eG_EIn#6F>kEYGo?BH?`nFgJx%xg^ZulcAs*>P q(54~ex~Y`^9`6k>?XV;I>AB`hoU>YS*kNPvA_5L#4~TtY&i@Pj1M6S_ literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1gm_1_1arg__iter-members.html b/doc/api/html/classstan_1_1gm_1_1arg__iter-members.html new file mode 100644 index 00000000000..7668bf46dc7 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__iter-members.html @@ -0,0 +1,147 @@ + + + + + +Stan: Member List + + + + + + + + + +

+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_iter Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_iter, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_bad_valuestan::gm::singleton_argument< T >protected
_constrainedstan::gm::singleton_argument< T >protected
_defaultstan::gm::valued_argumentprotected
_default_valuestan::gm::singleton_argument< T >protected
_descriptionstan::gm::argumentprotected
_good_valuestan::gm::singleton_argument< T >protected
_namestan::gm::argumentprotected
_validitystan::gm::singleton_argument< T >protected
_valuestan::gm::singleton_argument< T >protected
_value_typestan::gm::valued_argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_iter()stan::gm::arg_iterinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::singleton_argument< T >inlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::singleton_argument< T >inlinevirtual
is_valid(int value)stan::gm::arg_iterinline
stan::gm::singleton_argument::is_valid(T value)stan::gm::singleton_argument< T >inlineprotectedvirtual
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::singleton_argument< T >inlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::valued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::valued_argumentinlinevirtual
print_valid()stan::gm::singleton_argument< T >inlinevirtual
print_value()stan::gm::singleton_argument< T >inlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::singleton_argument< T >inlinevirtual
set_value(const T &value)stan::gm::singleton_argument< T >inline
singleton_argument()stan::gm::singleton_argument< T >inline
singleton_argument(const std::string name)stan::gm::singleton_argument< T >inline
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
value()stan::gm::singleton_argument< T >inline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__iter.html b/doc/api/html/classstan_1_1gm_1_1arg__iter.html new file mode 100644 index 00000000000..0e4342874f9 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__iter.html @@ -0,0 +1,255 @@ + + + + + +Stan: stan::gm::arg_iter Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_iter Class Reference
+
+
+ +

#include <arg_iter.hpp>

+
+Inheritance diagram for stan::gm::arg_iter:
+
+
+ + +stan::gm::singleton_argument< T > +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_iter ()
 
bool is_valid (int value)
 
- Public Member Functions inherited from stan::gm::singleton_argument< T >
 singleton_argument ()
 
 singleton_argument (const std::string name)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
value ()
 
bool set_value (const T &value)
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
- Public Member Functions inherited from stan::gm::valued_argument
virtual void print (std::ostream *s, const int depth, const char prefix)
 
virtual void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Member Functions inherited from stan::gm::singleton_argument< T >
virtual bool is_valid (T value)
 
- Protected Attributes inherited from stan::gm::singleton_argument< T >
std::string _validity
 
_value
 
_default_value
 
bool _constrained
 
_good_value
 
_bad_value
 
+

Detailed Description

+
+

Definition at line 10 of file arg_iter.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_iter::arg_iter ()
+
+inline
+
+ +

Definition at line 14 of file arg_iter.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
bool stan::gm::arg_iter::is_valid (int value)
+
+inline
+
+ +

Definition at line 26 of file arg_iter.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__iter.png b/doc/api/html/classstan_1_1gm_1_1arg__iter.png new file mode 100644 index 0000000000000000000000000000000000000000..636dc83ff06afd401fc797fb2933b23cda6af372 GIT binary patch literal 1418 zcmeAS@N?(olHy`uVBq!ia0vp^7lHTy2Q!ddn^*Q2NJ#|vgt-3y{~ySF@#br3|Dg#$ z78oBmaDcV*jy#adQ4-`A%m7pb0#{Fk7%?!gN_x6DhEy=Vo%?#zVl4qTarw~7|L%5b zaXUILt~mMbVM*w;YPSW6iI@MV9+TMJq~R(1&}~wRwD}~J+cCymlfIaqb1h$Na@Qa} zLhkUJ_4X@2-ZZk?w0-^mp7qm@ElQTld8Ow$zu;O%jMKIi3ZnZnuYOJnKEE{EaEFNx zv&u_jJ&C1zPE6aqN6)1zQL^;-)ojmS6TBnMb1S#q&hI@oFTb}d!G1l@+T7Z75tYy_ z`vPxjdCo7qZMmwatN7}<9gi$#p4_!kWp7{UzEztPbn-thy7p?vm0hl3lk6Vfs#Won zezX3W_w<|LJzXMGmWckgRe33L|EJsU>5oso4xUu@BkG#xrTGtFzTt5*Ja$8v!TurR z1<|{bwsLzlOVdp_N|#-kKk>R1!|NS_4Y_wX4w&V!BuJYxZRnL|ym73TA?L9h!?r?Y zhTEvp7VbTUWvqddtPb_6oHWZ*@!V#aA)@k9=Ip}q!lzH~?7r%8+tCOp{rp*&< z;Cbs&N8qn3H|w6CUb*blt{jQb(@|@rqA$wmc}B~e-esBIC)xXR5^scArEKE6uh&*c zl)I;9yuHG>IPKch`2j%@mw&mXu2#wY_!AtGp-ZxMZn#?<(#9S1@3+%6-_W$1e=FO7 z0eUoZWzyw_pXc4ydb_R_H5EOZWv-HW^x$ugNoG3=wt57eeOhq6=US@wB)*SU@2=Lx zbClmUzqR+h%1ev#mfiD8C#7(LlF5#VDmT*%x(tuaWB9?z->~k*xfdT__^z~G?6|^s z>A#*m*BB#?;|xhG0e!$Ssb`~h$D}KQpnxq@_T1!~3JhH1Fy~9%!WUICeMMiq<+>Jgcw&Ty(na)XFovER*{rQzOIIXLVjQlbU^BN_6##$=edQSUjDYSj{W# zHd}hvuPaLfCxl%5`IjJl*dt9*Im7^qhBSnIeGf&mD(@1RlnYGaaV|E(Am88 z*9+s{e~*_iU2o*6WqHjz=%2MIFt#j!k?}>JMoFDRv4oXzfig66%zo`={`Q2xvw0qA zJ$c*9`UnMWUUai#!EhRva` zc9xv&eO1;V9Ao0ObCPa)Wo(DY;i6e?49|DWDZM<+Z}z@ylW%v-PTgYkE7)i>C31Vd zNW(0vOGlLoUqgxnlUsJ~K*fr$mvNc8oe~QZYk8WxsxEY`_tMY$oB0xE|Gf}D<4?BR z@14f+iN&T2I~w2DF8-T(PwUg{HOxOOp;`NEkexHfLjHfuDJ3mdK II;Vst0HEuiJpcdz literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1gm_1_1arg__max__depth-members.html b/doc/api/html/classstan_1_1gm_1_1arg__max__depth-members.html new file mode 100644 index 00000000000..1f121bf4190 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__max__depth-members.html @@ -0,0 +1,147 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_max_depth Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_max_depth, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_bad_valuestan::gm::singleton_argument< T >protected
_constrainedstan::gm::singleton_argument< T >protected
_defaultstan::gm::valued_argumentprotected
_default_valuestan::gm::singleton_argument< T >protected
_descriptionstan::gm::argumentprotected
_good_valuestan::gm::singleton_argument< T >protected
_namestan::gm::argumentprotected
_validitystan::gm::singleton_argument< T >protected
_valuestan::gm::singleton_argument< T >protected
_value_typestan::gm::valued_argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_max_depth()stan::gm::arg_max_depthinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::singleton_argument< T >inlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::singleton_argument< T >inlinevirtual
is_valid(int value)stan::gm::arg_max_depthinline
stan::gm::singleton_argument::is_valid(T value)stan::gm::singleton_argument< T >inlineprotectedvirtual
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::singleton_argument< T >inlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::valued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::valued_argumentinlinevirtual
print_valid()stan::gm::singleton_argument< T >inlinevirtual
print_value()stan::gm::singleton_argument< T >inlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::singleton_argument< T >inlinevirtual
set_value(const T &value)stan::gm::singleton_argument< T >inline
singleton_argument()stan::gm::singleton_argument< T >inline
singleton_argument(const std::string name)stan::gm::singleton_argument< T >inline
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
value()stan::gm::singleton_argument< T >inline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__max__depth.html b/doc/api/html/classstan_1_1gm_1_1arg__max__depth.html new file mode 100644 index 00000000000..2aebc8e89d8 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__max__depth.html @@ -0,0 +1,255 @@ + + + + + +Stan: stan::gm::arg_max_depth Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_max_depth Class Reference
+
+
+ +

#include <arg_max_depth.hpp>

+
+Inheritance diagram for stan::gm::arg_max_depth:
+
+
+ + +stan::gm::singleton_argument< T > +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_max_depth ()
 
bool is_valid (int value)
 
- Public Member Functions inherited from stan::gm::singleton_argument< T >
 singleton_argument ()
 
 singleton_argument (const std::string name)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
value ()
 
bool set_value (const T &value)
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
- Public Member Functions inherited from stan::gm::valued_argument
virtual void print (std::ostream *s, const int depth, const char prefix)
 
virtual void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Member Functions inherited from stan::gm::singleton_argument< T >
virtual bool is_valid (T value)
 
- Protected Attributes inherited from stan::gm::singleton_argument< T >
std::string _validity
 
_value
 
_default_value
 
bool _constrained
 
_good_value
 
_bad_value
 
+

Detailed Description

+
+

Definition at line 10 of file arg_max_depth.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_max_depth::arg_max_depth ()
+
+inline
+
+ +

Definition at line 14 of file arg_max_depth.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
bool stan::gm::arg_max_depth::is_valid (int value)
+
+inline
+
+ +

Definition at line 26 of file arg_max_depth.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__max__depth.png b/doc/api/html/classstan_1_1gm_1_1arg__max__depth.png new file mode 100644 index 0000000000000000000000000000000000000000..954cc51f41ed71e95fd15549aecbc5efdf780d64 GIT binary patch literal 1458 zcmcgsX;6|082+p*bF$THO>xvMAv>1V4ay^3w^l#=K+P+&$jq|xN>lL21Ity*UDW(k z%zM4iK&(4;_t$yL-$$wj;H$TebVr$0M8vp@Hpd9QhoAJ07Ro9p9^GcrUN z0svqHdARxMyjZ6^gXKEQib)*TIWr&60C%lcs|#OF&m|P_ujrz`mB-`h=MGuxQUkJ| zw?Ck3`XthxfL#EfzYlWT7m%zsQ>B8(x35`QQNZZb+E^b*(+jP1@ZME_pV3qGY+`e` z@te|0l9eGFY2;=G!LfV~I89yc3pZSkL#LRPjM3jp<}rB`t^f9n$jKVU?8ln+WG2=~ zb(}zgQnHz#dIJMO3DbI8YgL0b#YB4W)-I-BX7FD*>^S#@XIcF-C&p5LLO zp{@rm)ryDS)fTRvSK0p%d)V3>1sQd@ukyt1&h>37pmRM4a97&^BUvUFV)+I< z`_L7m6?V(sc$w+F-$Dh_{#hPH=yq)ggAkWLZO$r0E>1S+u!51izXlkTeiki7bmPd*noMsUOd*rdU#> zm>kqqq-ET1&Cv;W6m#VATE>=DVBhUMOpza%Ly(v#*)e@(B#^`nu)OQ8zy%Rqu)8$h z#bIUx|H$&SS52GZ@u?}PVNs~5%kn3_C&NS~(80Yoo0N}o2!5LMO)47kG*OeVB6U-A zX@BC+XiJ&vs-)odffV1~#%C=#$Qg&lPsqkPqv3&fiERtic{vSP^_((PF-Nf(63oAx zO0|WQi*9WTx4dCzlm7=@`nPx;F*rLLNB3i)!TuE~4*Vq$4tviP-~Z`EF@5m1#`Em! z4E)4_z7PJT3T^k@V50P5ikQYn9h(X$@L3?1%dIqqC$Tuj30oaWM^#s$?IFsL;c#h> zNI_?t*XG{)delkYQO96|r#2EiF!~mazYklwAx2pvf8K?>trOB(*<3_$Q&hnfUV_iv5xorG#fv3x6o}O*qWnN|;bY zz?a;X&}cbfW~<6ndMRl*aOE3nslw*M@@iZ=R+Q~sW0%5BQ^kLywEU$pWDy6dh=%8Q sYEvNfV~+vP==16KB{tEEC1xL1#cWPr=eyXz&^=fHa`$#?-G4muFZ3nI5C8xG literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1gm_1_1arg__method-members.html b/doc/api/html/classstan_1_1gm_1_1arg__method-members.html new file mode 100644 index 00000000000..68a405c282d --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__method-members.html @@ -0,0 +1,143 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_method Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_method, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_cursorstan::gm::list_argumentprotected
_defaultstan::gm::valued_argumentprotected
_default_cursorstan::gm::list_argumentprotected
_descriptionstan::gm::argumentprotected
_namestan::gm::argumentprotected
_value_typestan::gm::valued_argumentprotected
_valuesstan::gm::list_argumentprotected
arg(std::string name)stan::gm::list_argumentinlinevirtual
arg_method()stan::gm::arg_methodinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::list_argumentinlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::list_argumentinlinevirtual
list_argument()stan::gm::list_argumentinline
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::list_argumentinlinevirtual
print(std::ostream *s, int depth, const char prefix)stan::gm::list_argumentinlinevirtual
print_help(std::ostream *s, int depth, bool recurse)stan::gm::list_argumentinlinevirtual
print_valid()stan::gm::list_argumentinlinevirtual
print_value()stan::gm::list_argumentinlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::list_argumentinlinevirtual
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
valid_value(std::string name)stan::gm::list_argumentinline
value()stan::gm::list_argumentinline
values()stan::gm::list_argumentinline
~argument()stan::gm::argumentinlinevirtual
~list_argument()stan::gm::list_argumentinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__method.html b/doc/api/html/classstan_1_1gm_1_1arg__method.html new file mode 100644 index 00000000000..56a68003494 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__method.html @@ -0,0 +1,205 @@ + + + + + +Stan: stan::gm::arg_method Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_method Class Reference
+
+
+ +

#include <arg_method.hpp>

+
+Inheritance diagram for stan::gm::arg_method:
+
+
+ + +stan::gm::list_argument +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_method ()
 
- Public Member Functions inherited from stan::gm::list_argument
 list_argument ()
 
 ~list_argument ()
 
void print (std::ostream *s, int depth, const char prefix)
 
void print_help (std::ostream *s, int depth, bool recurse)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
bool valid_value (std::string name)
 
argumentarg (std::string name)
 
std::vector< argument * > & values ()
 
std::string value ()
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
+ + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Attributes inherited from stan::gm::list_argument
int _cursor
 
int _default_cursor
 
std::vector< argument * > _values
 
+

Detailed Description

+
+

Definition at line 14 of file arg_method.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_method::arg_method ()
+
+inline
+
+ +

Definition at line 18 of file arg_method.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__method.png b/doc/api/html/classstan_1_1gm_1_1arg__method.png new file mode 100644 index 0000000000000000000000000000000000000000..6dc596022076a7d9d2043c1fb8a80ce152050072 GIT binary patch literal 1291 zcmeAS@N?(olHy`uVBq!ia0vp^3xN0l2Q!e|@^pqPkdg@S332`Z|38rV;?396{zDUh zEHFNB-~emq9eE&^qa?^Lm;tB=1g@S6F=Aj~ndRx?7*fIbcJAw<&pJG8)7xj>`L9~P zj$c8hrsL{9`MFugW^dW1a;@P+e9^heloOLo^b|Eb<(vX0+1wHGne-)jPWbaVuP`%mL9F8`OlGgi*5aoY_kJx^Obmg!w-Ju0TxwKn#~Dtl*4zQc8$#q(9M zZiM*3p13^oINw=`@;}O=C-LpreB^b@jGY#uF-rcdvy<+rz1;g{X2PT`i_M$g27A8x z{8H`?r&;x;{d>-a{aL9RH#_&q>|WP|CB}Qabv*68IJ_pc3rtbrpPX>clAq_m_D@U_GcU5nuRqA^ zEl}QmVEKcXS=<8d3AyM zjW;KkUA|SQ_dOw6&-2@^xJO&-PuVu$pGZ<0}M6V z`VA8$V?TVAx>Hbc@MM0@;fJh?yBTY61{hjs{+kDkhJK#NNyk)KR8KmCA}9Hvif8%E zChtG)os-U7_55phFdfJ!4L7Lu_4qmC(zEry3g+osXWq6qP4AxjKd#B!YjR%uhL!0} z-s@IQTkVLPrJ?WK6pLL>yqnAXBX^l`gXr;iqg$1RkNG#+U?tT zdSb+rb$l}fu209GNbq$GxLYFdl=l(N)BGnE;xLVRek?P-gfaGJ+=>m z7-Fm!?X78hG?@cRyQ}`ia<&JByY$}QCLX)I-yG;vF&S1*@_mAzsJmG^@Z_~aM z?f#f`Nryc@`+wDHz8SAeI5g8SyeI3oNhBmNwqExHmRt;;u6{1-oD!M + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_metric Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_metric, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_cursorstan::gm::list_argumentprotected
_defaultstan::gm::valued_argumentprotected
_default_cursorstan::gm::list_argumentprotected
_descriptionstan::gm::argumentprotected
_namestan::gm::argumentprotected
_value_typestan::gm::valued_argumentprotected
_valuesstan::gm::list_argumentprotected
arg(std::string name)stan::gm::list_argumentinlinevirtual
arg_metric()stan::gm::arg_metricinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::list_argumentinlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::list_argumentinlinevirtual
list_argument()stan::gm::list_argumentinline
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::list_argumentinlinevirtual
print(std::ostream *s, int depth, const char prefix)stan::gm::list_argumentinlinevirtual
print_help(std::ostream *s, int depth, bool recurse)stan::gm::list_argumentinlinevirtual
print_valid()stan::gm::list_argumentinlinevirtual
print_value()stan::gm::list_argumentinlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::list_argumentinlinevirtual
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
valid_value(std::string name)stan::gm::list_argumentinline
value()stan::gm::list_argumentinline
values()stan::gm::list_argumentinline
~argument()stan::gm::argumentinlinevirtual
~list_argument()stan::gm::list_argumentinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__metric.html b/doc/api/html/classstan_1_1gm_1_1arg__metric.html new file mode 100644 index 00000000000..d55d0da91bd --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__metric.html @@ -0,0 +1,205 @@ + + + + + +Stan: stan::gm::arg_metric Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_metric Class Reference
+
+
+ +

#include <arg_metric.hpp>

+
+Inheritance diagram for stan::gm::arg_metric:
+
+
+ + +stan::gm::list_argument +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_metric ()
 
- Public Member Functions inherited from stan::gm::list_argument
 list_argument ()
 
 ~list_argument ()
 
void print (std::ostream *s, int depth, const char prefix)
 
void print_help (std::ostream *s, int depth, bool recurse)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
bool valid_value (std::string name)
 
argumentarg (std::string name)
 
std::vector< argument * > & values ()
 
std::string value ()
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
+ + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Attributes inherited from stan::gm::list_argument
int _cursor
 
int _default_cursor
 
std::vector< argument * > _values
 
+

Detailed Description

+
+

Definition at line 14 of file arg_metric.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_metric::arg_metric ()
+
+inline
+
+ +

Definition at line 18 of file arg_metric.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__metric.png b/doc/api/html/classstan_1_1gm_1_1arg__metric.png new file mode 100644 index 0000000000000000000000000000000000000000..38d6dec45dbca35cd4fdea628b94f8c3bda2007c GIT binary patch literal 1293 zcmeAS@N?(olHy`uVBq!ia0vp^3xN0l2Q!e|@^pqPkdg@S332`Z|38rV;?396{zDUh zEHFNB-~emq9eE&^qa?^Lm;tB=1g@S6F=Aj~nd9l=7*fIbcJAv*kF|K%X7{h!^IuuM zU%x@7rgN(0>1(S_%{_BtQUkLZAtr5bh~2ambTglw{tzM9-I?eFMR3D(UlK`Dz!4YDrYbGekr}l^HSeEo?FW& zU3q@lc89P@^``xM(zO3w6Iy@P?EQx_f!oqg^KP%(d*IU1qp_2IRn&W~>-TuB_)5^^ zwXSD=jJwAr&2^G{ERyqGJuXS!Q=PUXUX?}lq%()tq;^k(=X2QE9<1KO;FeZ$@OpN^ z;ft*5`#18oi}&cUeGqJ7kaH3^;LO2P!QsfjugLL0k%iHwMWLZxfaQY#Lh{FVmf~}j zDJLeG=qYM=$~gs0vU$TYS;cno>{si*i*qh}>8B-s`7<LFBi8q#+g1cSPQIQw>0b36fj4>^=O%c*oC^xC<<$l18Q+$? zG_gMSRBp@DNmt^od++(?KXbP3!EbJvyD!bpKJ=~h!qKg<)uFEoFYLMVH(u!YL^aRq zchh#O|F}0{Qb~8^^X=}h+Mni~dr-&WS@gki=WlNv&-w;|DJuLRpQ;_4Q!FRZu>KR1 z#LSDV@#_!rx{J^GbIeR8&S00s0e3>-1`X7Q_l3`(CoG*ADlhed3p)R61O^qC2JKh> zp#x;x74@+f4zgRe1sIldp0A#}eY2<;bKj z^@2^4o+tuS-(i&*#pjrrKZM3HC>!s3@Y;08!xv4H@84)U%;`RShr5tAhT!f zO2&c%SB3Jk3xKg=Bf8~iOcT3)t)K4>utB2 z#q2&T{AQhLQTFwFJbCU-nJd#{c?wRIJ`?A=xV-84>mcQ4^DJg7HW + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_nesterov Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_nesterov, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + +
_descriptionstan::gm::argumentprotected
_namestan::gm::argumentprotected
_subargumentsstan::gm::categorical_argumentprotected
arg(const std::string name)stan::gm::categorical_argumentinlinevirtual
arg_nesterov()stan::gm::arg_nesterovinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::categorical_argumentinlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::categorical_argumentinlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::categorical_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse)stan::gm::categorical_argumentinlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::categorical_argumentinlinevirtual
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
subarguments()stan::gm::categorical_argumentinline
~argument()stan::gm::argumentinlinevirtual
~categorical_argument()stan::gm::categorical_argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__nesterov.html b/doc/api/html/classstan_1_1gm_1_1arg__nesterov.html new file mode 100644 index 00000000000..af183149d39 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__nesterov.html @@ -0,0 +1,201 @@ + + + + + +Stan: stan::gm::arg_nesterov Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_nesterov Class Reference
+
+
+ +

#include <arg_nesterov.hpp>

+
+Inheritance diagram for stan::gm::arg_nesterov:
+
+
+ + +stan::gm::categorical_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_nesterov ()
 
- Public Member Functions inherited from stan::gm::categorical_argument
virtual ~categorical_argument ()
 
void print (std::ostream *s, const int depth, const char prefix)
 
void print_help (std::ostream *s, const int depth, const bool recurse)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
std::vector< argument * > & subarguments ()
 
argumentarg (const std::string name)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
int compute_indent (const int depth)
 
+ + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Attributes inherited from stan::gm::categorical_argument
std::vector< argument * > _subarguments
 
+

Detailed Description

+
+

Definition at line 12 of file arg_nesterov.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_nesterov::arg_nesterov ()
+
+inline
+
+ +

Definition at line 16 of file arg_nesterov.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__nesterov.png b/doc/api/html/classstan_1_1gm_1_1arg__nesterov.png new file mode 100644 index 0000000000000000000000000000000000000000..9ceb18a0a152d6e33662a70a5b414a97fbe90a7a GIT binary patch literal 1030 zcmeAS@N?(olHy`uVBq!ia0vp^JAt@^gBeKngzicMQW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;lMlJ2QdvmdlCyla|l*6upDmTXw4a6nZx4$?4k9DxUU_f4%uH_}S#l z>{F=`Pd}&c{JGCKZq>!}(+hXpF=_mo61+oYZsGBom{n0Wp3jVLo(=L&;WRz@&2t)y zr`7XiKR;E6MWx>0n7yUTtiV*qQ+!9P?q#vC-Q^i}ZgR6`pR6l$+P>}O2^-I>8@Gz9 z!zZ2lx$2yBaq#!sQka%;sri;%+cce+X0%bDJj9(sN@=~+@F`L6z-j`{uaW8S8}er`&c+US4fPwpAx zi_x2F)bzb)Jk46FSz{>QylRWe%=0GiZDRKxs7g3BuV?$>)w*jA_cYZ`N?mlU=4Myc z-Kw(5ncs8W*CmPG6>$)rwdB|4x{PSu&+Dts?@`(F-_kTb>CAzJKeO&VYss^Hz*-!w zyZY;F*6*vIR-6xC`MdPqjM=;H8{Jv|d9Bnf)9p{|7Dp{RY+c%{dQk3+QIy|4%kR1Q zH@mj&P0dt_J{|fuqiRL;`+)UzwWgnERbFmXec6zGaei|6e&f7##f9f@tEyzqufAA+ zW>1{%q%Z$nU?ITs%<}miWd{4ltQS=8&e|WhcU5_|T}Sz)Gz7{?p5ArW%-CeHpZ0@zj-N zZ_k}9ZkSu;Co$c!cA4?#i*z`SYDUeuDY4<$}L?7S;^nei^@o=g(AMkh=Bx+bge+{!2`jT9-b)M~v)RLEGzWI?%w^nw4{IcZ!Y-X9ldH)tq zKN$Y(xokom>zQ_e2a5Y{e=eSTymkI+v4;Pg(3BMv73QV+^{D-{sa_XWKku~zW?BYM LS3j3^P6 + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_newton Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_newton, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + +
_descriptionstan::gm::argumentprotected
_namestan::gm::argumentprotected
_subargumentsstan::gm::categorical_argumentprotected
arg(const std::string name)stan::gm::categorical_argumentinlinevirtual
arg_newton()stan::gm::arg_newtoninline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::categorical_argumentinlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::categorical_argumentinlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::categorical_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse)stan::gm::categorical_argumentinlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::categorical_argumentinlinevirtual
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
subarguments()stan::gm::categorical_argumentinline
~argument()stan::gm::argumentinlinevirtual
~categorical_argument()stan::gm::categorical_argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__newton.html b/doc/api/html/classstan_1_1gm_1_1arg__newton.html new file mode 100644 index 00000000000..e8c498b3a9a --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__newton.html @@ -0,0 +1,201 @@ + + + + + +Stan: stan::gm::arg_newton Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_newton Class Reference
+
+
+ +

#include <arg_newton.hpp>

+
+Inheritance diagram for stan::gm::arg_newton:
+
+
+ + +stan::gm::categorical_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_newton ()
 
- Public Member Functions inherited from stan::gm::categorical_argument
virtual ~categorical_argument ()
 
void print (std::ostream *s, const int depth, const char prefix)
 
void print_help (std::ostream *s, const int depth, const bool recurse)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
std::vector< argument * > & subarguments ()
 
argumentarg (const std::string name)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
int compute_indent (const int depth)
 
+ + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Attributes inherited from stan::gm::categorical_argument
std::vector< argument * > _subarguments
 
+

Detailed Description

+
+

Definition at line 10 of file arg_newton.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_newton::arg_newton ()
+
+inline
+
+ +

Definition at line 14 of file arg_newton.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__newton.png b/doc/api/html/classstan_1_1gm_1_1arg__newton.png new file mode 100644 index 0000000000000000000000000000000000000000..d400e9159ae783738eaa58e0a0934d3407c4d3c5 GIT binary patch literal 1015 zcmeAS@N?(olHy`uVBq!ia0vp^JAt@^gBeKngzicMQW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;q_her^icS}|dk|EB1rUMYOJYTNyT)I2U( znx8%WJ~H#^L$@6>!!EMtwW+>j+P+#fH*srq`!nw+3o9qT$yP7PpWSz+c}d@1+x+)l zmn`?M`h0HB%HMyzGEd#z6BWcgqd$CaRkgwAjJq!1n2PgH@~e72xB10q8~^p-^n=OI zd|!H8YWvLLx$8`Eb=^OqogZgSTp}#DR?O4r@LAQ9V&>CTqSZc2B+CdktpCU)F)8tE z{QAJF?WXgOu!qWDzf;ZKV4BC5&^?>^#-nEp+jdws=;GrZma_6vLdXut8J~lT|_L{~P{~)2#XQ|q&N?*S@ zd#3EZ-HFhgMZ1|^I5mgVZ{xokcKX-qd&cL5@BN=MYx<0|2N!B4Z?|4p&0leF&)R8c zf8A}Gzxrv#dGlcV>y_#EuKb<%@VV9f)eHNdT>u(^itt>&5TpHJqWtGyrn zZPD#}L9l`g42I?v*BZT0MyRQuF3j`LVO5dhaUtx2V)Ui~GW# z9=Bf1^VjTxV$V%Sfk8a&q|Gr2ca{g)dl=eMB0gWw4*8mRR{f*n)#Ik$?=dCx5*f6h zfZw3nBGA^tV4whvgQCNKcK26U|K6WxXL`Q;zW?;^OR}zAioCqE&iBb5-}kZV`adUq zzB9jkGxM9GlQofxbf#R>nV+)#mbsVZqI<2T3hlX@nPm#E?)fusYM5MJ%j`_kTARjy zn@{p>IR7at1{Z@xc!e*VQDsc2yT_9y1K v=fn2ZtOumb**6?L%b0WWu2ze{u}A#eB3=iBABQLcb18$TtDnm{r-UW|lD7cD literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1gm_1_1arg__num__samples-members.html b/doc/api/html/classstan_1_1gm_1_1arg__num__samples-members.html new file mode 100644 index 00000000000..163a87af28b --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__num__samples-members.html @@ -0,0 +1,147 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_num_samples Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_num_samples, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_bad_valuestan::gm::singleton_argument< T >protected
_constrainedstan::gm::singleton_argument< T >protected
_defaultstan::gm::valued_argumentprotected
_default_valuestan::gm::singleton_argument< T >protected
_descriptionstan::gm::argumentprotected
_good_valuestan::gm::singleton_argument< T >protected
_namestan::gm::argumentprotected
_validitystan::gm::singleton_argument< T >protected
_valuestan::gm::singleton_argument< T >protected
_value_typestan::gm::valued_argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_num_samples()stan::gm::arg_num_samplesinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::singleton_argument< T >inlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::singleton_argument< T >inlinevirtual
is_valid(int value)stan::gm::arg_num_samplesinline
stan::gm::singleton_argument::is_valid(T value)stan::gm::singleton_argument< T >inlineprotectedvirtual
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::singleton_argument< T >inlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::valued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::valued_argumentinlinevirtual
print_valid()stan::gm::singleton_argument< T >inlinevirtual
print_value()stan::gm::singleton_argument< T >inlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::singleton_argument< T >inlinevirtual
set_value(const T &value)stan::gm::singleton_argument< T >inline
singleton_argument()stan::gm::singleton_argument< T >inline
singleton_argument(const std::string name)stan::gm::singleton_argument< T >inline
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
value()stan::gm::singleton_argument< T >inline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__num__samples.html b/doc/api/html/classstan_1_1gm_1_1arg__num__samples.html new file mode 100644 index 00000000000..33f0479706d --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__num__samples.html @@ -0,0 +1,255 @@ + + + + + +Stan: stan::gm::arg_num_samples Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_num_samples Class Reference
+
+
+ +

#include <arg_num_samples.hpp>

+
+Inheritance diagram for stan::gm::arg_num_samples:
+
+
+ + +stan::gm::singleton_argument< T > +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_num_samples ()
 
bool is_valid (int value)
 
- Public Member Functions inherited from stan::gm::singleton_argument< T >
 singleton_argument ()
 
 singleton_argument (const std::string name)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
value ()
 
bool set_value (const T &value)
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
- Public Member Functions inherited from stan::gm::valued_argument
virtual void print (std::ostream *s, const int depth, const char prefix)
 
virtual void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Member Functions inherited from stan::gm::singleton_argument< T >
virtual bool is_valid (T value)
 
- Protected Attributes inherited from stan::gm::singleton_argument< T >
std::string _validity
 
_value
 
_default_value
 
bool _constrained
 
_good_value
 
_bad_value
 
+

Detailed Description

+
+

Definition at line 10 of file arg_num_samples.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_num_samples::arg_num_samples ()
+
+inline
+
+ +

Definition at line 14 of file arg_num_samples.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
bool stan::gm::arg_num_samples::is_valid (int value)
+
+inline
+
+ +

Definition at line 26 of file arg_num_samples.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__num__samples.png b/doc/api/html/classstan_1_1gm_1_1arg__num__samples.png new file mode 100644 index 0000000000000000000000000000000000000000..87dcd0718a3366c0faafeb3707fcca6dc8a7afde GIT binary patch literal 1460 zcmaJ>2~g5$6#sjzW~rt%-jtzfNyjsr+ zycq8b?ZX0FHC5GY@t}u0`Q=D&6rC-gGmm(ucgL&bWieD zlL>*A-p2FCqGQ3}g-oa@qBH-PegNK-;NeEK)LYM>Gd~T&t&n=JPa$E#JGK5rP|3D1 zD7q!`Ai9A)Y0#^6O@7+DRnGZY42mfTaU9W}OgZG4KlD6U{|<3Ng=HD0cu5y7UkB>S zz3K&lkXaNUYXtQryhFp6{oLXAcA&7h1R4qr}bALaMg8<{jcB3 zK~9&xFZXX7jYc{sv?~X>ZL2>OA2X1dU$Hh&*#QL+Cwv~BTUD%V;PSop!Ju3{aF zS){u*Dts}Sb9`ys)xa=BJAu~XMg4d)0YXHvy9pl6xK}esLXT2qcXtM{vVV^GXmEH> z@`b`EO(z9jNs*8D-EjkgVg95bgRXXX=pcH0<_YHj+B&ZXXFi^5jJA5_*KuQI)25Y@ zKfawkvj zeBb|~`5oA-xTjjP7!6p^fe8nyYzWk=1%n0-+~5#WwsN>_7Tp+kzuf!+oJuFH=vs#w zpk}6YK8U8)-+SuZ_Q~~?h~G=cZ-~5|w!#q>>h%SA> zMT%XBn;#RTDV%o(S@hiKF6b!VHwhY)x{5uFmMZ@Z zSBE>_kZ>-wIgzFQ31gz(47JlcHgBPgR~}`&U;v z`OC%6DVkexsPzwDqOX(+T-O;=kIj*4P#8Bh)qkcSfU{g=aI5Jvn zSJ%yD@HMlG+k*XHrY^?YgY4u{Jm8lO_QPv)3n1`amOX^eUljYB(N(}&^Tzf|CFWS> zt<@})(@-Ah$WyAQEmSvr+gzpF^+16JhzrehEYqVz1fI18VI=-4W`(wxu!D~<`z%H} zV)F=-+_wDt#wr^@hJKPMh?;=cUMA^jR-ZQPqdn4x1lAluiA?0)U|q9`-U?#9Ci%{% yrQuDFGFGjD;&;EHfcc0&w>~OVZGST2(+>Y-?;TCH?{7Q_67w literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1gm_1_1arg__num__warmup-members.html b/doc/api/html/classstan_1_1gm_1_1arg__num__warmup-members.html new file mode 100644 index 00000000000..42d435ab503 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__num__warmup-members.html @@ -0,0 +1,147 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_num_warmup Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_num_warmup, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_bad_valuestan::gm::singleton_argument< T >protected
_constrainedstan::gm::singleton_argument< T >protected
_defaultstan::gm::valued_argumentprotected
_default_valuestan::gm::singleton_argument< T >protected
_descriptionstan::gm::argumentprotected
_good_valuestan::gm::singleton_argument< T >protected
_namestan::gm::argumentprotected
_validitystan::gm::singleton_argument< T >protected
_valuestan::gm::singleton_argument< T >protected
_value_typestan::gm::valued_argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_num_warmup()stan::gm::arg_num_warmupinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::singleton_argument< T >inlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::singleton_argument< T >inlinevirtual
is_valid(int value)stan::gm::arg_num_warmupinline
stan::gm::singleton_argument::is_valid(T value)stan::gm::singleton_argument< T >inlineprotectedvirtual
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::singleton_argument< T >inlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::valued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::valued_argumentinlinevirtual
print_valid()stan::gm::singleton_argument< T >inlinevirtual
print_value()stan::gm::singleton_argument< T >inlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::singleton_argument< T >inlinevirtual
set_value(const T &value)stan::gm::singleton_argument< T >inline
singleton_argument()stan::gm::singleton_argument< T >inline
singleton_argument(const std::string name)stan::gm::singleton_argument< T >inline
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
value()stan::gm::singleton_argument< T >inline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__num__warmup.html b/doc/api/html/classstan_1_1gm_1_1arg__num__warmup.html new file mode 100644 index 00000000000..4f96b48840d --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__num__warmup.html @@ -0,0 +1,255 @@ + + + + + +Stan: stan::gm::arg_num_warmup Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_num_warmup Class Reference
+
+
+ +

#include <arg_num_warmup.hpp>

+
+Inheritance diagram for stan::gm::arg_num_warmup:
+
+
+ + +stan::gm::singleton_argument< T > +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_num_warmup ()
 
bool is_valid (int value)
 
- Public Member Functions inherited from stan::gm::singleton_argument< T >
 singleton_argument ()
 
 singleton_argument (const std::string name)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
value ()
 
bool set_value (const T &value)
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
- Public Member Functions inherited from stan::gm::valued_argument
virtual void print (std::ostream *s, const int depth, const char prefix)
 
virtual void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Member Functions inherited from stan::gm::singleton_argument< T >
virtual bool is_valid (T value)
 
- Protected Attributes inherited from stan::gm::singleton_argument< T >
std::string _validity
 
_value
 
_default_value
 
bool _constrained
 
_good_value
 
_bad_value
 
+

Detailed Description

+
+

Definition at line 10 of file arg_num_warmup.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_num_warmup::arg_num_warmup ()
+
+inline
+
+ +

Definition at line 14 of file arg_num_warmup.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
bool stan::gm::arg_num_warmup::is_valid (int value)
+
+inline
+
+ +

Definition at line 26 of file arg_num_warmup.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__num__warmup.png b/doc/api/html/classstan_1_1gm_1_1arg__num__warmup.png new file mode 100644 index 0000000000000000000000000000000000000000..efde5471f3ed6b8eec57594c7aefb651c892e441 GIT binary patch literal 1453 zcmcJPX;4#F6vv+;>wtjNiYVCDCj!-qEGh=57z{kXs1U0tvMEc52_l9iCF4?rYRRZ? zSPBG?KA;c*ErAqb5@N6l3W0!um;gZ#)C7>0oha$EYbZ%0XtF#UKscb)YSHrb_$>8?=q6hIZPB3UboxA$-aTP z*0IY`7k)z;HA4M~5o{LSZBP*AWD6;gY|Cqc$d7v0BAo3-DD2_8=?`yS*LoRqQ>$j7aGyGbFA4yh3t_vy9Xtmq8R@FW}L zx0Y9*tmto_!y-*%Sj0hgx5SuFq@T$KU1xeLzsf1=TabCiWwGee&c--QQyX{Gmm5#Q zu$K181afT6u>_2IS1?3lkmhfJ)>CONVcd2>B%%B^IFS;Hg$IW*q?vc;)25fQ%eJO% zSA%cvn&IG=g^n<&48Xa)a$f^9i%i1pGMu>sxF9QW>>8^8qC2uj4e%^*0Qzb`nQne5 zUSuHL9kFVt&~fF|LCX~jwpl>hKd*;8{sjv{VZD`*m)@jkn~oIhFPm`H+%wmB_v+8KZmLEau zgh!Rz8uH^Y%!)6AMunB@d!wcK*C~n6-rXAA}u zIjW*h@zde%;z28EIeg)vT2r}`HFq?JH7hKhMD~Wjpq%VT3p1Gi#g#@=LfxsJ z=99Eu2;M64g;6vp;WoQhOrMoQ#~N1{|8@@dt0LB~W&OeZ-`O)_K8dlul>DDW{|=nz zBX%>@4Tkl;$O7ATe`rTy77X$q)k2F?I2TCXvx+8bp>Bp)3j#^YmB{Rh?s|R&cfKTW zA;_tDyicPf4K(DMJo|x@7BZZJ9$qwMOrG7pI^kk zBdW->9dx>^K2E-D&tg1r$h|2wQ`wb6_7r#dPqtykWYhbdNnKR05kkyB!OmA%0lf`~ zJaUFHHk^r*+R4i%EXnw}Gka`WE=yjdPv&xW`N38+(z9#<7pJctfcjNxN`m;zDH2=3 z;8&C8j*y=zeEf~J>$lRADPxMH*jt^`7J=9#xk< zKDal&{%aQc9mE<8J{gf(ePWxuAw8{U9u%!ZSPmr%n&_Bii`_I_4kegXz4K zSFOb&Z_>0)b-8_q=sn?{@AC5aFF0M&*?TUbu?5fJHQ{#%RvsIsED*QQYqVr`r<1B7 zMscw!BIa>Moghkf6tGatn4S|FA}}?&G07~7$v0H)Xz^mJ-o^#1aO)TW#qCYWqS)Hh z2bHU*h=`B52J64?sT=a1^ZAkDPD_t0+2oztTLV5@!gmB)bd?UUOVC9D$de{=Z9sWU zm76|A%%!k7GCkQmb+%e3rFD926Te-2A-S~08S*%!e!pp7=Hv29bivvB(5rwx)5bw) oC?KyIVtkzVXv~QqKcew6V2;qiy2$ + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_nuts Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_nuts, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + +
_descriptionstan::gm::argumentprotected
_namestan::gm::argumentprotected
_subargumentsstan::gm::categorical_argumentprotected
arg(const std::string name)stan::gm::categorical_argumentinlinevirtual
arg_nuts()stan::gm::arg_nutsinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::categorical_argumentinlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::categorical_argumentinlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::categorical_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse)stan::gm::categorical_argumentinlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::categorical_argumentinlinevirtual
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
subarguments()stan::gm::categorical_argumentinline
~argument()stan::gm::argumentinlinevirtual
~categorical_argument()stan::gm::categorical_argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__nuts.html b/doc/api/html/classstan_1_1gm_1_1arg__nuts.html new file mode 100644 index 00000000000..414973d7719 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__nuts.html @@ -0,0 +1,201 @@ + + + + + +Stan: stan::gm::arg_nuts Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_nuts Class Reference
+
+
+ +

#include <arg_nuts.hpp>

+
+Inheritance diagram for stan::gm::arg_nuts:
+
+
+ + +stan::gm::categorical_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_nuts ()
 
- Public Member Functions inherited from stan::gm::categorical_argument
virtual ~categorical_argument ()
 
void print (std::ostream *s, const int depth, const char prefix)
 
void print_help (std::ostream *s, const int depth, const bool recurse)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
std::vector< argument * > & subarguments ()
 
argumentarg (const std::string name)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
int compute_indent (const int depth)
 
+ + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Attributes inherited from stan::gm::categorical_argument
std::vector< argument * > _subarguments
 
+

Detailed Description

+
+

Definition at line 12 of file arg_nuts.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_nuts::arg_nuts ()
+
+inline
+
+ +

Definition at line 16 of file arg_nuts.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__nuts.png b/doc/api/html/classstan_1_1gm_1_1arg__nuts.png new file mode 100644 index 0000000000000000000000000000000000000000..b964b1ec130e22bd8b347ac2892ca1eaa85989b6 GIT binary patch literal 1000 zcmeAS@N?(olHy`uVBq!ia0vp^JAt@^gBeKngzicMQW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;hBp8s2BueZLuRJyi)X4`9D;T!&8hg38Bjh|f(y8Fn}XnxZ7iCGg(uc+Ks&*Yr6 z<-F(TZ`EZ{r8hWcZ|SRikQ6bAuV7cyDY3HM+cWK4^JdLHnP{@i2L^yh!S&oBF2n!c-K@q2yU)qHyv+udJgBfQt_ zboHlQEs^WOwH}_W;d*sxQi@&bz4Il1nNBxOitV|+c(?AG!#z#4lguuj*^}$KJdc0ti2Y0=_}b+SJ(Ha$r;ZtP4K++AmYpK8(-h|OnxnM=krgYNnhp`U$jq?TQBDM z%UAol+}r&vy~;dTWB&&dtX`j4-81q|e)?4k14ZK}8%%!v(JV89=kG$lw% zNa#QVG!9PlKih8e>Zj*_(a-6^wO{`iRjQWX3~tw*{;xFfx}oh3mHKBh^O$9xO!@gF z^BI*)&uWbKZ;vuN3ruvgzL(xp+q3_i_tq)*jFy)5C-JAr=H5-a7VUFu z?_Sn~$$xjQi+*cW9DS6bIP10EaHdUrn8&ed+oUnRz%e@N!QbOZJeOUqUQ{n7oO Zp?QthbV+vKXTWU9;OXk;vd$@?2>{4w?`{A9 literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1gm_1_1arg__optimize-members.html b/doc/api/html/classstan_1_1gm_1_1arg__optimize-members.html new file mode 100644 index 00000000000..ddc9ddadf02 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__optimize-members.html @@ -0,0 +1,133 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_optimize Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_optimize, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + +
_descriptionstan::gm::argumentprotected
_namestan::gm::argumentprotected
_subargumentsstan::gm::categorical_argumentprotected
arg(const std::string name)stan::gm::categorical_argumentinlinevirtual
arg_optimize()stan::gm::arg_optimizeinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::categorical_argumentinlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::categorical_argumentinlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::categorical_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse)stan::gm::categorical_argumentinlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::categorical_argumentinlinevirtual
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
subarguments()stan::gm::categorical_argumentinline
~argument()stan::gm::argumentinlinevirtual
~categorical_argument()stan::gm::categorical_argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__optimize.html b/doc/api/html/classstan_1_1gm_1_1arg__optimize.html new file mode 100644 index 00000000000..861351f5ccb --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__optimize.html @@ -0,0 +1,201 @@ + + + + + +Stan: stan::gm::arg_optimize Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_optimize Class Reference
+
+
+ +

#include <arg_optimize.hpp>

+
+Inheritance diagram for stan::gm::arg_optimize:
+
+
+ + +stan::gm::categorical_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_optimize ()
 
- Public Member Functions inherited from stan::gm::categorical_argument
virtual ~categorical_argument ()
 
void print (std::ostream *s, const int depth, const char prefix)
 
void print_help (std::ostream *s, const int depth, const bool recurse)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
std::vector< argument * > & subarguments ()
 
argumentarg (const std::string name)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
int compute_indent (const int depth)
 
+ + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Attributes inherited from stan::gm::categorical_argument
std::vector< argument * > _subarguments
 
+

Detailed Description

+
+

Definition at line 14 of file arg_optimize.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_optimize::arg_optimize ()
+
+inline
+
+ +

Definition at line 18 of file arg_optimize.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__optimize.png b/doc/api/html/classstan_1_1gm_1_1arg__optimize.png new file mode 100644 index 0000000000000000000000000000000000000000..f38590088be7cbfb11778ccf3c4d2cdc7b4e3205 GIT binary patch literal 1025 zcmeAS@N?(olHy`uVBq!ia0vp^JAt@^gBeKngzicMQW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;mRMK?%>ZENOZtd-V7X8HibK0i$b1z&pt2N@EWaUh7MXAnu6%@V!;l2A?zTy0|s&-2S9}(vsx7+IG41RgX_U zF#Ei$L?!chVT;P#XZvjJ>pEj9&U##8+#c4gGV|fHNh#eRpLAFD7@p%eaJ_=T=j4`W z{m0k5x;#t&(d1R{H&OPQ#uon|wO40OhlRYp zw%L5<+kJZ{uD;<~&U&GhZRNgi{CC4nzYgDrTf-@KDTG(?}-n8TghL&5dC@E9sLk*t34~Fr?h-acy_Vo)9m8= z-=_tZ+>Z7VmedXZy7)`L^m_}#{{G5&X8Cy?v-c(TbFS-;ud7RsiFy8H-gj@0OV#UK z{~LU++3ImA{tzq##6AO4jbOw2j|?*=WuBGqkG#6vH2#Qs==|$t75Uw3yY~N;Dg&F$?EK5uCOfZKpYmNu1DF(b4CgHN(o-$j zvoQV4X_voS^e4xj6ULr>q*jK9ExX-*6(xnx|VU``AcAaW$<+M Kb6Mw<&;$S$j{#`_ literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1gm_1_1arg__optimize__algo-members.html b/doc/api/html/classstan_1_1gm_1_1arg__optimize__algo-members.html new file mode 100644 index 00000000000..4561e64739d --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__optimize__algo-members.html @@ -0,0 +1,143 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_optimize_algo Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_optimize_algo, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_cursorstan::gm::list_argumentprotected
_defaultstan::gm::valued_argumentprotected
_default_cursorstan::gm::list_argumentprotected
_descriptionstan::gm::argumentprotected
_namestan::gm::argumentprotected
_value_typestan::gm::valued_argumentprotected
_valuesstan::gm::list_argumentprotected
arg(std::string name)stan::gm::list_argumentinlinevirtual
arg_optimize_algo()stan::gm::arg_optimize_algoinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::list_argumentinlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::list_argumentinlinevirtual
list_argument()stan::gm::list_argumentinline
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::list_argumentinlinevirtual
print(std::ostream *s, int depth, const char prefix)stan::gm::list_argumentinlinevirtual
print_help(std::ostream *s, int depth, bool recurse)stan::gm::list_argumentinlinevirtual
print_valid()stan::gm::list_argumentinlinevirtual
print_value()stan::gm::list_argumentinlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::list_argumentinlinevirtual
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
valid_value(std::string name)stan::gm::list_argumentinline
value()stan::gm::list_argumentinline
values()stan::gm::list_argumentinline
~argument()stan::gm::argumentinlinevirtual
~list_argument()stan::gm::list_argumentinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__optimize__algo.html b/doc/api/html/classstan_1_1gm_1_1arg__optimize__algo.html new file mode 100644 index 00000000000..de5dff4df8a --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__optimize__algo.html @@ -0,0 +1,205 @@ + + + + + +Stan: stan::gm::arg_optimize_algo Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_optimize_algo Class Reference
+
+
+ +

#include <arg_optimize_algo.hpp>

+
+Inheritance diagram for stan::gm::arg_optimize_algo:
+
+
+ + +stan::gm::list_argument +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_optimize_algo ()
 
- Public Member Functions inherited from stan::gm::list_argument
 list_argument ()
 
 ~list_argument ()
 
void print (std::ostream *s, int depth, const char prefix)
 
void print_help (std::ostream *s, int depth, bool recurse)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
bool valid_value (std::string name)
 
argumentarg (std::string name)
 
std::vector< argument * > & values ()
 
std::string value ()
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
+ + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Attributes inherited from stan::gm::list_argument
int _cursor
 
int _default_cursor
 
std::vector< argument * > _values
 
+

Detailed Description

+
+

Definition at line 14 of file arg_optimize_algo.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_optimize_algo::arg_optimize_algo ()
+
+inline
+
+ +

Definition at line 18 of file arg_optimize_algo.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__optimize__algo.png b/doc/api/html/classstan_1_1gm_1_1arg__optimize__algo.png new file mode 100644 index 0000000000000000000000000000000000000000..b5c59835b0da46dc524886bc3787dcda72155fce GIT binary patch literal 1342 zcma)+dr*>D7{)Q(ysT;I?%0;aw0$_G7&EzQSlX1bg{V`Aql@e0B~2tPMM@BpY2ECy zhJ6(dikNrNQCKgnU?}RCA)pP0hNii?h=xq2sA-D(xx3SU&Fq8-Ry;B~(%?b7;paLd~GI`&zU!k|N2OWj8}3WHfFu>q$D8D@rJJvilRyS<22`)unWoX@~Kf9vHkq!Rk9}x)Jhr2%nHuhXnZ+f#yH4plF&!w&t;ieNDzuLB` zlY@qZmli`k(^s+YC@JX2_1gnMQNlw^bRM$QMMD%=gU!7NIW^ez*R;_WoaVb;S1FO; zHBsy2;wwT^S|S>=pI8`sWNa{VqIl8>?SD;(R4<%8y{r*nXPQ^HBmD9@<` zR(C=+x}!Oi{_B=fj+4|t%hBqWER<&=>_GdMj9c->V@#(Q>k0peZ69~CVSYIXru~=Y zdK(+9V`RPn(mX*cTsw(GL2a0S{n5HX_o^vk+iTZu3q`k3EAeBQcc8F>EhhQau8L?Nlw$HcsyFMi8I-S@*L(aPV1 z$&=dxRfy;88rJxVJc=j3=8RptxzZ|m zC3FVhPgZT^GpR6CmxDA{Xfb~PX$Db&!M`j&UU#STuP)~!W~V=2PiZ_@QD@tUFx3ZO z)#_ks%R2Hro+^pw+^DKz*oq*YSGgkk8asQ4i@3I)X>;VTi)4RUh;IwmhJbi@v4N(D zuK_&6Jv}k)4EMh0;$X=|QNM{O`|S;(ezV2@+t5(5$1de~yLfUDAiU2`5xF$D-AEwa z%4o`@qv)M!S9(}FmEU8aTb-qeD9jQEYg(E|2T47;s=eN{sKqCwz*zMZ*<(e8V-+~% z1Krgfz9qcdCEBc5jWHKU-W^%SDR85K&DwI&99#mXE2?R5K`XF<{u~ma0MeU$Djz4yP!ZE-b4$sggxz5o+?p8tk5Pb)ZNkI{>JH^MGgHK0Lfub-%KsB$EmYFH!qZXSu6x7z9^8?65zpx*{Vlj>PG13w_j3ZJEP zkw=p+T1Vy14b_0d$wDRHBV43zY$xMh+ZeW~n?C?P;i%rAu(;@O2506TTizwPg68zE zR*l@znu_Lra(SY4$3;tm=6TwLtr)VX?gPt+ig!L4O}}KJ1sSulY4zp7M{VTeb1NAr znxMB}dR(8%^zWbY+I4~3Zb)gxCynMYMQpyuzEoMGOf$PtR|&J5!7zLZiipGE&J$O5 j{byEdJbSqE(*j)iO + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_output Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_output, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + +
_descriptionstan::gm::argumentprotected
_namestan::gm::argumentprotected
_subargumentsstan::gm::categorical_argumentprotected
arg(const std::string name)stan::gm::categorical_argumentinlinevirtual
arg_output()stan::gm::arg_outputinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::categorical_argumentinlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::categorical_argumentinlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::categorical_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse)stan::gm::categorical_argumentinlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::categorical_argumentinlinevirtual
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
subarguments()stan::gm::categorical_argumentinline
~argument()stan::gm::argumentinlinevirtual
~categorical_argument()stan::gm::categorical_argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__output.html b/doc/api/html/classstan_1_1gm_1_1arg__output.html new file mode 100644 index 00000000000..7ffe55d46c6 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__output.html @@ -0,0 +1,201 @@ + + + + + +Stan: stan::gm::arg_output Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_output Class Reference
+
+
+ +

#include <arg_output.hpp>

+
+Inheritance diagram for stan::gm::arg_output:
+
+
+ + +stan::gm::categorical_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_output ()
 
- Public Member Functions inherited from stan::gm::categorical_argument
virtual ~categorical_argument ()
 
void print (std::ostream *s, const int depth, const char prefix)
 
void print_help (std::ostream *s, const int depth, const bool recurse)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
std::vector< argument * > & subarguments ()
 
argumentarg (const std::string name)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
int compute_indent (const int depth)
 
+ + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Attributes inherited from stan::gm::categorical_argument
std::vector< argument * > _subarguments
 
+

Detailed Description

+
+

Definition at line 14 of file arg_output.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_output::arg_output ()
+
+inline
+
+ +

Definition at line 18 of file arg_output.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__output.png b/doc/api/html/classstan_1_1gm_1_1arg__output.png new file mode 100644 index 0000000000000000000000000000000000000000..326c5c6e0720fbfecd140373c2c4b409087dcf8f GIT binary patch literal 1014 zcmeAS@N?(olHy`uVBq!ia0vp^JAt@^gBeKngzicMQW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;-8QL*$)@9CaRbpikVcyS?u}gY2LizbH+>`O!F9mjn@8r zYqt8=mS^Q3J+D4D?Z3zLz;_1o520ra`&uj;^b`3Wc;n-4Py<@j8-WB_n=yuS~GdjZ{Kl6W&(b8{FfHMF&DM7XPTS=^wCr3v zE%cw_!{1pq?|;5}<$I~!jM=;H8`Z==k2d{s?as8{ty!Aw+e@0w4$7Ueit^uQ`8_%R zX4kg8OHC)PEs3?);xBzE`|9fY^XF{R?Mf0nZ#|6p^7+Qs_dVT}e(!$HaGG?lSoc@E z@%iv>mA~^jfFY}TM)lY?+m+f;Ekm=g+8 zqyRrKYf8{8A)x~;(5N_V`gy(0)2xfdk^dTg?ya|rs^4kztW%G zW1G%BzGlEsa3J#Y(UmiF)l_!*Z>+w#{e;vlp}p5KUf zUvu_2V*|5ZsQ1l7o1EL9c|Tb{J74{#vHyV+`ZLzQsxdGx-JiKH^7&m!ga3>&1skKh z@*~qq`;++7WOMJPt=_(8+0}cO*ckYJ+_3&qF>`Lme2bbRcft%0c)Y#x^a|78=hx5p x@3Hx&Tz6jPz-$Bd52|MvYgVq+S~}&~Bm3j)y!QO`TnftJ44$rjF6*2UngG;j|BnCw literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1gm_1_1arg__output__file-members.html b/doc/api/html/classstan_1_1gm_1_1arg__output__file-members.html new file mode 100644 index 00000000000..576e4f8c3fc --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__output__file-members.html @@ -0,0 +1,146 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_output_file Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_output_file, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_bad_valuestan::gm::singleton_argument< T >protected
_constrainedstan::gm::singleton_argument< T >protected
_defaultstan::gm::valued_argumentprotected
_default_valuestan::gm::singleton_argument< T >protected
_descriptionstan::gm::argumentprotected
_good_valuestan::gm::singleton_argument< T >protected
_namestan::gm::argumentprotected
_validitystan::gm::singleton_argument< T >protected
_valuestan::gm::singleton_argument< T >protected
_value_typestan::gm::valued_argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_output_file()stan::gm::arg_output_fileinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::singleton_argument< T >inlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::singleton_argument< T >inlinevirtual
is_valid(T value)stan::gm::singleton_argument< T >inlineprotectedvirtual
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::singleton_argument< T >inlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::valued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::valued_argumentinlinevirtual
print_valid()stan::gm::singleton_argument< T >inlinevirtual
print_value()stan::gm::singleton_argument< T >inlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::singleton_argument< T >inlinevirtual
set_value(const T &value)stan::gm::singleton_argument< T >inline
singleton_argument()stan::gm::singleton_argument< T >inline
singleton_argument(const std::string name)stan::gm::singleton_argument< T >inline
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
value()stan::gm::singleton_argument< T >inline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__output__file.html b/doc/api/html/classstan_1_1gm_1_1arg__output__file.html new file mode 100644 index 00000000000..2ab4571ea8d --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__output__file.html @@ -0,0 +1,226 @@ + + + + + +Stan: stan::gm::arg_output_file Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_output_file Class Reference
+
+
+ +

#include <arg_output_file.hpp>

+
+Inheritance diagram for stan::gm::arg_output_file:
+
+
+ + +stan::gm::singleton_argument< T > +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_output_file ()
 
- Public Member Functions inherited from stan::gm::singleton_argument< T >
 singleton_argument ()
 
 singleton_argument (const std::string name)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
value ()
 
bool set_value (const T &value)
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
- Public Member Functions inherited from stan::gm::valued_argument
virtual void print (std::ostream *s, const int depth, const char prefix)
 
virtual void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Member Functions inherited from stan::gm::singleton_argument< T >
virtual bool is_valid (T value)
 
- Protected Attributes inherited from stan::gm::singleton_argument< T >
std::string _validity
 
_value
 
_default_value
 
bool _constrained
 
_good_value
 
_bad_value
 
+

Detailed Description

+
+

Definition at line 10 of file arg_output_file.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_output_file::arg_output_file ()
+
+inline
+
+ +

Definition at line 14 of file arg_output_file.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__output__file.png b/doc/api/html/classstan_1_1gm_1_1arg__output__file.png new file mode 100644 index 0000000000000000000000000000000000000000..14b6112758285e1b6d33601d5d51eb633a904413 GIT binary patch literal 1427 zcma)+ZB)`{6u|$=bf|T3&5kb-Y6tXW@waB>XquUz{)f3jEL|v?sZA|k(3mf2S>b%c z#FES`Gn^@AQZo?pWtx&2>I??vTUlbhkxq>=lToKWY#(;^oO7Rh@45GWcz(~lH*=r2 z$7(|hLjV9)L!Nk&R(ENo84lClC8OajT4lD+i%igHG+OiJ^kPC@%XzK!QJR~Z^)d%7 zwJtoKbj8N;>*|4x&s%yp&`(6*;M1v`tG%Eus=8rd()q zOS~#SeWDCAvCXpnQHg1*0cnvl2ev-iF0b-^{silIo@10U$+}x=_VP!{MzX~4NmlV; zNZ2xtEBv+o(z5_|y|RY5b{e5hjkZ%$(m9M_p_Gc5&>iWw&n4ESExq+Uwho3XWERWY zv0|U-w{^cc)h4Z#)1qV-I7Z9LVHcFx9;|pJA{*F3>zI+AeF>?xpjbX=YkD2Mezq7{ zz-bbHc!X*L^!gIza8B$hAhib;WUL>T=+vHX{xFne?jD9VbrA!bM?v6qj46;TFgoQt zsMm~A=>{R_I<*-hK+zfiOh5Za`01Lh?cc)jkcBQiAD#Sx)$<(Uc}~yE9q&)vPwT~a z<+d(e-qW!1BCp4Oo;y85i0C!pxZ@sB-c$+PtI7(UD<)ae;E_<~!3AT^B;@9o1d9J^ zEVT_}P#@UwkzOnzQuyK=Rw+PwK8E&>PN)}9E!Ytna;86GBBn|DES|yQg>@va1JiCM2A-;&0R3Pqwm1Y?bedvwG5Cmk+#GFH^M?N< z`EStRS0OoPc3)N zdK28A%<$Yl=+Gg0Pq_u5plqNu=&pK1z0y85gFar!KViVKNSf+Pac%;m4>+bxD-|~7 z-eZ1Ky#9m+q^OokYT@`iuhVqaHeg4Te#y+W;k`S=Sun2LZAdkWvw=icM4NXBNsaM{ z5?VjXjU|oqR1bDdhDqWo*_@^<*GXh=mhrhrYD$h)$@EHMp zx1&W~4h#1)`lkACI-FcYc5nBIm36HNVa_j0O-y8@M-;OL`tY3xT6_qx{Ze#`dzjf0t1U7}V<<$Ca)%!qx zGN^O3z77PwOu6^5lj8$~@5&WK+3lu>ym+Q$Z>Jk$_dCvI+QKmI-nK(MJW8*B^Q)2& zK!g-4D(C8wry9Frb*mjc(v0|o=uNuQbLSFpDtZ&+dV)^v=}&{ryL!?3>}=Y&i=};H U0gW^6q1~VWMDWJf> + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_random Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_random, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + +
_descriptionstan::gm::argumentprotected
_namestan::gm::argumentprotected
_subargumentsstan::gm::categorical_argumentprotected
arg(const std::string name)stan::gm::categorical_argumentinlinevirtual
arg_random()stan::gm::arg_randominline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::categorical_argumentinlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::categorical_argumentinlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::categorical_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse)stan::gm::categorical_argumentinlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::categorical_argumentinlinevirtual
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
subarguments()stan::gm::categorical_argumentinline
~argument()stan::gm::argumentinlinevirtual
~categorical_argument()stan::gm::categorical_argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__random.html b/doc/api/html/classstan_1_1gm_1_1arg__random.html new file mode 100644 index 00000000000..16ea19fc695 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__random.html @@ -0,0 +1,201 @@ + + + + + +Stan: stan::gm::arg_random Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_random Class Reference
+
+
+ +

#include <arg_random.hpp>

+
+Inheritance diagram for stan::gm::arg_random:
+
+
+ + +stan::gm::categorical_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_random ()
 
- Public Member Functions inherited from stan::gm::categorical_argument
virtual ~categorical_argument ()
 
void print (std::ostream *s, const int depth, const char prefix)
 
void print_help (std::ostream *s, const int depth, const bool recurse)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
std::vector< argument * > & subarguments ()
 
argumentarg (const std::string name)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
int compute_indent (const int depth)
 
+ + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Attributes inherited from stan::gm::categorical_argument
std::vector< argument * > _subarguments
 
+

Detailed Description

+
+

Definition at line 12 of file arg_random.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_random::arg_random ()
+
+inline
+
+ +

Definition at line 16 of file arg_random.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__random.png b/doc/api/html/classstan_1_1gm_1_1arg__random.png new file mode 100644 index 0000000000000000000000000000000000000000..f75b960dd6faa475a7ce96dc53a96095ea6650a7 GIT binary patch literal 1012 zcmeAS@N?(olHy`uVBq!ia0vp^JAt@^gBeKngzicMQW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;Ku{-V6j@fIs+&sXb%l9~bS>~*^7SBm+DrZzrPB)mY62ES?y5}#cznlN7Kg*nF zKK1mTQ=hh$+ErikzPjsA#BA^7oNLriKb%x@O!RZ<%B+tnGyS(!d*)75y~4Atd=u}4 zCB=HP^3QL+q;=Nq2G8mY=JKPryyycqf6O9d5rWFNGDml0I{e{n=`8ASv z((;1bCzZ`{_Xslo{`Tij? zmKyp``eJOycenIkouYcNr_r6vdC#VW=oSA*1k??;scovSzGlm&FX~T=RMYpK@ic3x z%)XiH9j|Tx2HCvtrm=eu>{IMNckKAZt76v@-45P6X%?8gFV}Tzp6zbQ%od9A-dxKUtC_Dm|9g%3 zm)d#e&(z-c^W1;_Gmvku>Gqd(iqW4Qp1qnNoxq=#sjGf}&hKs8WL$6G+9W!0@zYgR zQ}SP3vc9r9?t9-G<9w|RDzyvrt1QdDT0eedHMjbno}%abonn6vPyBmR$+KQKQO|Q< z%TAS_Mzj4doAh!VxL(1)b8^G8{^KiN9iDamQS++)Y`Lwh2WA_ve^5Qc2n;NS_(L)W zrsLx#_pp+RnQ^nc_HNDe=e;{m{&p^&{M`N7H_khAb$6;fvD%=U3k + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_refresh Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_refresh, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_bad_valuestan::gm::singleton_argument< T >protected
_constrainedstan::gm::singleton_argument< T >protected
_defaultstan::gm::valued_argumentprotected
_default_valuestan::gm::singleton_argument< T >protected
_descriptionstan::gm::argumentprotected
_good_valuestan::gm::singleton_argument< T >protected
_namestan::gm::argumentprotected
_validitystan::gm::singleton_argument< T >protected
_valuestan::gm::singleton_argument< T >protected
_value_typestan::gm::valued_argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_refresh()stan::gm::arg_refreshinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::singleton_argument< T >inlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::singleton_argument< T >inlinevirtual
is_valid(int value)stan::gm::arg_refreshinline
stan::gm::singleton_argument::is_valid(T value)stan::gm::singleton_argument< T >inlineprotectedvirtual
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::singleton_argument< T >inlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::valued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::valued_argumentinlinevirtual
print_valid()stan::gm::singleton_argument< T >inlinevirtual
print_value()stan::gm::singleton_argument< T >inlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::singleton_argument< T >inlinevirtual
set_value(const T &value)stan::gm::singleton_argument< T >inline
singleton_argument()stan::gm::singleton_argument< T >inline
singleton_argument(const std::string name)stan::gm::singleton_argument< T >inline
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
value()stan::gm::singleton_argument< T >inline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__refresh.html b/doc/api/html/classstan_1_1gm_1_1arg__refresh.html new file mode 100644 index 00000000000..60c8479cf4c --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__refresh.html @@ -0,0 +1,255 @@ + + + + + +Stan: stan::gm::arg_refresh Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_refresh Class Reference
+
+
+ +

#include <arg_refresh.hpp>

+
+Inheritance diagram for stan::gm::arg_refresh:
+
+
+ + +stan::gm::singleton_argument< T > +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_refresh ()
 
bool is_valid (int value)
 
- Public Member Functions inherited from stan::gm::singleton_argument< T >
 singleton_argument ()
 
 singleton_argument (const std::string name)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
value ()
 
bool set_value (const T &value)
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
- Public Member Functions inherited from stan::gm::valued_argument
virtual void print (std::ostream *s, const int depth, const char prefix)
 
virtual void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Member Functions inherited from stan::gm::singleton_argument< T >
virtual bool is_valid (T value)
 
- Protected Attributes inherited from stan::gm::singleton_argument< T >
std::string _validity
 
_value
 
_default_value
 
bool _constrained
 
_good_value
 
_bad_value
 
+

Detailed Description

+
+

Definition at line 10 of file arg_refresh.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_refresh::arg_refresh ()
+
+inline
+
+ +

Definition at line 14 of file arg_refresh.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
bool stan::gm::arg_refresh::is_valid (int value)
+
+inline
+
+ +

Definition at line 26 of file arg_refresh.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__refresh.png b/doc/api/html/classstan_1_1gm_1_1arg__refresh.png new file mode 100644 index 0000000000000000000000000000000000000000..c85a695a150abf58425bd9abd3cd44a85850775a GIT binary patch literal 1448 zcma)+X;4#F6vv;mSc+oNqLKtkg;-gFC?tRsP>@8PLAC^t%1!|zB#0r15fG{3C`o`< z*;2)^i7XL9QG|pw!T=Qn3I?8Rih~49*bx*grqQV%I{o6AIro3=-1F&o{`XwAH7rBbOXr>2(~nax?M>SIbI67{Pi2CAz@ zytg|EP&Ivs{tmJw0I1u5E>7gc4Kp_t(0x;F{LbG5^-3dyZ@u=0VP%%VS zlFVX%o2`xuh}5uw(8Ho^^q|av_dOUq{!_e7N6WGC%gZ?S`?rsB-f&lat~0%bd(8Si|c5u4*7j#1#if}Gi=Sg6OS+?MW)9`5$2DDfl z5E6+&Wh*3}c!I<;ecEGnIM)9bLLJmBoKv3yP>w=EcCnCy1oFb>?c z+f{Za!drn0ppTlGffWnSlF{IgdOb2?-k={#U~UYeI44~Db~i4uITr01a4}kc{z2d# z@Io32gs3B~P>dC#Rd?JK`1=w{;<-60zK&glz0r%t=JzEM3Kc-vI02}RGXjQ1TT`hc z8WL;Tmmw${wLjRX4Nu$HK+J!i$B_SH#rMkMN5|Kt*gaE@7`yFiUgN4crkt5*h)l@| zcXZX~rb$h%Ymsdty8rgwj*!gyXwX%u17V#EeVfpwWnv!Wn zSS9UL1iBX^1Sju>OWmR$$T9euI`m8&4K_b7yU|-8d~J)uFxCiDUWoKrcg#jG%^1xk zbqcwMu}RFUWL~W=w34{~k))vdltX0;oqT1J_i9oodn)d=<47j z#(~o1-(~#4vUD`n_M8FOww{Q1;;`6O7@mW+qK^GBN`?sij zK^vRd=ttHxG+0exrK!wRMBFRVJ_c1|FBWp<8?(_qNzbP!cxz1(^>{F8xZOio4?nKB z_j*Cumq78^D8~~on*`00Ii4%TE@Ea1J_38hH0-NVX5Uz6zEg+CWCg7%EFx-7a1U|& zYTl011=0RqeIVRo-$_226U5o z;o^1eR~HrPXv#X#2^tPByn{tu-Me^La^W@-k{BX|B7i{HTq=Fk8wrlCCqwLcd;dCYo}Ep4WNDY%2WC zz&RdO0P%BMd^5)z1LvCd$%7&wGF_O%UldD0D8aT#fqoS%`Gl*06~>A~11Zf~A;#%e zwW9*ed2w_%Zr6vhdD-rL@Lhw@l4AvdZ zTP%D%2{&BW8q&DA?{59Vz-_t0aC=VgnI&ps>fs<9caj@v-;;G{f$wkOE1npt3c85< zYelK|-56#kYcbNesBVX!p-&A&jay?aE2-yGjrPveR=sS!=7{5-m_<$;nozbL0w%>- z2zlVy7@gGIqEoA-cZcVJ_WEQFk|z&fum$wj@$h<^F*W@U2hfzFV(O(e(~b)-0^SbLml6-ImN5E?711c)Pt@6esg~kMPnE1;RPB! VX}H_boTgf<0El;Y5juyY{R1#%x}N|5 literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1gm_1_1arg__rwm-members.html b/doc/api/html/classstan_1_1gm_1_1arg__rwm-members.html new file mode 100644 index 00000000000..3b62e71a2b8 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__rwm-members.html @@ -0,0 +1,133 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_rwm Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_rwm, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + +
_descriptionstan::gm::argumentprotected
_namestan::gm::argumentprotected
_subargumentsstan::gm::categorical_argumentprotected
arg(const std::string name)stan::gm::categorical_argumentinlinevirtual
arg_rwm()stan::gm::arg_rwminline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::categorical_argumentinlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::categorical_argumentinlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::categorical_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse)stan::gm::categorical_argumentinlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::categorical_argumentinlinevirtual
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
subarguments()stan::gm::categorical_argumentinline
~argument()stan::gm::argumentinlinevirtual
~categorical_argument()stan::gm::categorical_argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__rwm.html b/doc/api/html/classstan_1_1gm_1_1arg__rwm.html new file mode 100644 index 00000000000..a61168afb6b --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__rwm.html @@ -0,0 +1,201 @@ + + + + + +Stan: stan::gm::arg_rwm Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_rwm Class Reference
+
+
+ +

#include <arg_rwm.hpp>

+
+Inheritance diagram for stan::gm::arg_rwm:
+
+
+ + +stan::gm::categorical_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_rwm ()
 
- Public Member Functions inherited from stan::gm::categorical_argument
virtual ~categorical_argument ()
 
void print (std::ostream *s, const int depth, const char prefix)
 
void print_help (std::ostream *s, const int depth, const bool recurse)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
std::vector< argument * > & subarguments ()
 
argumentarg (const std::string name)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
int compute_indent (const int depth)
 
+ + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Attributes inherited from stan::gm::categorical_argument
std::vector< argument * > _subarguments
 
+

Detailed Description

+
+

Definition at line 10 of file arg_rwm.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_rwm::arg_rwm ()
+
+inline
+
+ +

Definition at line 14 of file arg_rwm.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__rwm.png b/doc/api/html/classstan_1_1gm_1_1arg__rwm.png new file mode 100644 index 0000000000000000000000000000000000000000..9f7f4e90cba69cb3878a9ff75d3339343fa55023 GIT binary patch literal 994 zcmeAS@N?(olHy`uVBq!ia0vp^JAt@^gBeKngzicMQW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;mP1qa3H+_lmyBX)BLuad>tl4x|X{+0`fXO-UQ+y{Z zDbAa|7XC^Oc+iSdi z^Q4k<>tF3LG%wvBuet2b-PNkw8(w}~Rlc1+O>*t*6LASIb)PO%c{#`Z{=(ra$kFX?IZ@M6|P74t(elWI7NJwK(I$hRfF5Nufgk?F;x zytDD^cyT$HktE|O#}wipD*ciYtEmUo>lT|Q`*!<&8(kh&u6~a z8@lZ1X|c53QJU@RpA`p8ou=~n0g z^<8GWoxezQ_KRf_rWX^S3V$~Kl;3%^{%B3kqWAyi>%V`ZRsC+m&!GK!r|h<| zKYz0)U@}|58Qss7ANL&1aa!~%Ww&c`ug=2R*0E=%n>2XeF^yln^pe(Lw;M~Y)_Clw zeDQs?s(hl|kzioTt2fVI{q&9vqi$N3?#KLD`H(c1o%d?b%<>h}?nIwr-gc+ic8}4n zZN1yJTg+mXDcpChc(-l(y%0l(! + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_sample Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_sample, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + +
_descriptionstan::gm::argumentprotected
_namestan::gm::argumentprotected
_subargumentsstan::gm::categorical_argumentprotected
arg(const std::string name)stan::gm::categorical_argumentinlinevirtual
arg_sample()stan::gm::arg_sampleinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::categorical_argumentinlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::categorical_argumentinlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::categorical_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse)stan::gm::categorical_argumentinlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::categorical_argumentinlinevirtual
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
subarguments()stan::gm::categorical_argumentinline
~argument()stan::gm::argumentinlinevirtual
~categorical_argument()stan::gm::categorical_argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__sample.html b/doc/api/html/classstan_1_1gm_1_1arg__sample.html new file mode 100644 index 00000000000..46a2a4a88f1 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__sample.html @@ -0,0 +1,201 @@ + + + + + +Stan: stan::gm::arg_sample Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_sample Class Reference
+
+
+ +

#include <arg_sample.hpp>

+
+Inheritance diagram for stan::gm::arg_sample:
+
+
+ + +stan::gm::categorical_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_sample ()
 
- Public Member Functions inherited from stan::gm::categorical_argument
virtual ~categorical_argument ()
 
void print (std::ostream *s, const int depth, const char prefix)
 
void print_help (std::ostream *s, const int depth, const bool recurse)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
std::vector< argument * > & subarguments ()
 
argumentarg (const std::string name)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
int compute_indent (const int depth)
 
+ + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Attributes inherited from stan::gm::categorical_argument
std::vector< argument * > _subarguments
 
+

Detailed Description

+
+

Definition at line 17 of file arg_sample.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_sample::arg_sample ()
+
+inline
+
+ +

Definition at line 21 of file arg_sample.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__sample.png b/doc/api/html/classstan_1_1gm_1_1arg__sample.png new file mode 100644 index 0000000000000000000000000000000000000000..53203e1853a1f170d499cc251c5ba01f39fa82ce GIT binary patch literal 1018 zcmeAS@N?(olHy`uVBq!ia0vp^JAt@^gBeKngzicMQW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;iT^QNEP=Pda-BPX$`oKZbF-C(*({JYuep1-87um10U=5mPn z)ypQQ|D^Bzv1ikqSr>mEH;U1pbzoZr=kz7U?`G%+n@(0gDRcCl>Q=XF0h4pyr}$1- zQk*wy{rk-qR~>e{vBdOC%A^n?tk_9+?_9f>z2ZhO2&UcsBXRf>)1c9lyu)z;_1o520ra`&uj;^b`3Wc;n-4P<=k9y+y~98Dy^a z4DU($b1Nq;nO`_#*UlfmJLdp{?StoMlinp&v(}xjzt(+T`}9i5x%F!zOB4F4{ziTB z`4TsEXT{t@KG(ITez;o0nRRJWN?*|T&~l-@XNiE>^4XVz`zg2en_1b&J>p9QY`<=ZmVO)^0Z{_W^7xqf;Nyyus zYFuyr@OPeN-Lu(OzSrKHIeXuIipgp z@@aAJ#XNtR3&KKRa^*S8evSjzD;RiAZg|#ze8sE7v-}@5uju1%X<27%mvAhk8f3US|=Psw;ztW#^zIfR+(ct*KZ03r?=YQ=n-tN0A{ol6p zXM=u5ZJ)9?)iZP1M()jh>vo^rz4xd}U1~m~#gje9B9GK|-=95y|K00#wOhXZJM`z! z?Y$rV{XZh}fS;q7A^woef$6)Vmrl79@rRkO(d&qaz%4moMrH7H^>bP0l+XkK7R?Kn literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1gm_1_1arg__sample__algo-members.html b/doc/api/html/classstan_1_1gm_1_1arg__sample__algo-members.html new file mode 100644 index 00000000000..572ba57004b --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__sample__algo-members.html @@ -0,0 +1,143 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_sample_algo Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_sample_algo, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_cursorstan::gm::list_argumentprotected
_defaultstan::gm::valued_argumentprotected
_default_cursorstan::gm::list_argumentprotected
_descriptionstan::gm::argumentprotected
_namestan::gm::argumentprotected
_value_typestan::gm::valued_argumentprotected
_valuesstan::gm::list_argumentprotected
arg(std::string name)stan::gm::list_argumentinlinevirtual
arg_sample_algo()stan::gm::arg_sample_algoinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::list_argumentinlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::list_argumentinlinevirtual
list_argument()stan::gm::list_argumentinline
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::list_argumentinlinevirtual
print(std::ostream *s, int depth, const char prefix)stan::gm::list_argumentinlinevirtual
print_help(std::ostream *s, int depth, bool recurse)stan::gm::list_argumentinlinevirtual
print_valid()stan::gm::list_argumentinlinevirtual
print_value()stan::gm::list_argumentinlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::list_argumentinlinevirtual
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
valid_value(std::string name)stan::gm::list_argumentinline
value()stan::gm::list_argumentinline
values()stan::gm::list_argumentinline
~argument()stan::gm::argumentinlinevirtual
~list_argument()stan::gm::list_argumentinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__sample__algo.html b/doc/api/html/classstan_1_1gm_1_1arg__sample__algo.html new file mode 100644 index 00000000000..7328c1978ca --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__sample__algo.html @@ -0,0 +1,205 @@ + + + + + +Stan: stan::gm::arg_sample_algo Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_sample_algo Class Reference
+
+
+ +

#include <arg_sample_algo.hpp>

+
+Inheritance diagram for stan::gm::arg_sample_algo:
+
+
+ + +stan::gm::list_argument +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_sample_algo ()
 
- Public Member Functions inherited from stan::gm::list_argument
 list_argument ()
 
 ~list_argument ()
 
void print (std::ostream *s, int depth, const char prefix)
 
void print_help (std::ostream *s, int depth, bool recurse)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
bool valid_value (std::string name)
 
argumentarg (std::string name)
 
std::vector< argument * > & values ()
 
std::string value ()
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
+ + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Attributes inherited from stan::gm::list_argument
int _cursor
 
int _default_cursor
 
std::vector< argument * > _values
 
+

Detailed Description

+
+

Definition at line 13 of file arg_sample_algo.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_sample_algo::arg_sample_algo ()
+
+inline
+
+ +

Definition at line 17 of file arg_sample_algo.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__sample__algo.png b/doc/api/html/classstan_1_1gm_1_1arg__sample__algo.png new file mode 100644 index 0000000000000000000000000000000000000000..a69ab0fe87380d5191c6637e0a2b1268f1ccf22e GIT binary patch literal 1323 zcmeAS@N?(olHy`uVBq!ia0vp^3xN0l2Q!e|@^pqPkdg@S332`Z|38rV;?396{zDUh zEHFNB-~emq9eE&^qa?^Lm;tB=1g@S6F=Aj~+2!ft7*fIbcJAxEFIqgV;?kM-{!jFu z#l3w(i{$qE3s;C_1Lt-KS z%Z)72@s%I5Q>#TbzqY?!619fsbi(ePDqp`a>~Pij#t~#%){*=^XQq$#b14gJkD&PT z4LdoGzRTS8Xw@CAt!>LQJ$GI3==|OyvU3OP9i4o})d|ACi$iq0s8)m7e? zJkN_wD$x#RlYe(Zk=t|Eg}(+WnO zNnd8}TKBDDKZk*iv7+s?uV1H%?+@GNE}3-o-36aFewIhfc1kVt2)$DD{H_gio?C15 zgjE}l+a8)K9pnFH-!h*13t6>0{shWS>IHH|9$a0?d zp6~vr&OQwI?v}Ot%KY7jKkj<*=+3&mD}GvO*ya71exzWjXVB`41<4K1+omj0T&uo+ zPtbiH^BD)rxIK+t^cFl;ownq^BPixA7pO#TVK^r7_z2UFu)Pdv*WNU&zy73UGqYYz zv9KTii&&n7$;?az-+>lvv#GP+Rfk#vNaC_#o<1vra z4`g+J1SYt93=cv(-y27)_tH9kK{AJ7wQ*(HPL?(Oi}oI=j$WI-lc)T$^vR8&aI^h> z+kam{uN0qOih4q6&=H?H-G~7GNU`9B|paJ^jJA*SvVwxZW zFi%24+qB_-)3>bte}D9uV)Ev!w=S%&(G`)qUAo2ol(xyy75ZyxA9if1e5)8f_2A^# zt{|P|8=@zOWIfhB&R3W-U3YTkz0JK_s^{7izj{^M^;F2ff4ku;f!tWHtyj4M`t%{4`&JUSUJg5|dC + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_save_iterations Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_save_iterations, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_bad_valuestan::gm::singleton_argument< T >protected
_constrainedstan::gm::singleton_argument< T >protected
_defaultstan::gm::valued_argumentprotected
_default_valuestan::gm::singleton_argument< T >protected
_descriptionstan::gm::argumentprotected
_good_valuestan::gm::singleton_argument< T >protected
_namestan::gm::argumentprotected
_validitystan::gm::singleton_argument< T >protected
_valuestan::gm::singleton_argument< T >protected
_value_typestan::gm::valued_argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_save_iterations()stan::gm::arg_save_iterationsinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::singleton_argument< T >inlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::singleton_argument< T >inlinevirtual
is_valid(T value)stan::gm::singleton_argument< T >inlineprotectedvirtual
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::singleton_argument< T >inlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::valued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::valued_argumentinlinevirtual
print_valid()stan::gm::singleton_argument< T >inlinevirtual
print_value()stan::gm::singleton_argument< T >inlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::singleton_argument< T >inlinevirtual
set_value(const T &value)stan::gm::singleton_argument< T >inline
singleton_argument()stan::gm::singleton_argument< T >inline
singleton_argument(const std::string name)stan::gm::singleton_argument< T >inline
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
value()stan::gm::singleton_argument< T >inline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__save__iterations.html b/doc/api/html/classstan_1_1gm_1_1arg__save__iterations.html new file mode 100644 index 00000000000..8e766c6f5ca --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__save__iterations.html @@ -0,0 +1,226 @@ + + + + + +Stan: stan::gm::arg_save_iterations Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_save_iterations Class Reference
+
+
+ +

#include <arg_save_iterations.hpp>

+
+Inheritance diagram for stan::gm::arg_save_iterations:
+
+
+ + +stan::gm::singleton_argument< T > +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_save_iterations ()
 
- Public Member Functions inherited from stan::gm::singleton_argument< T >
 singleton_argument ()
 
 singleton_argument (const std::string name)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
value ()
 
bool set_value (const T &value)
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
- Public Member Functions inherited from stan::gm::valued_argument
virtual void print (std::ostream *s, const int depth, const char prefix)
 
virtual void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Member Functions inherited from stan::gm::singleton_argument< T >
virtual bool is_valid (T value)
 
- Protected Attributes inherited from stan::gm::singleton_argument< T >
std::string _validity
 
_value
 
_default_value
 
bool _constrained
 
_good_value
 
_bad_value
 
+

Detailed Description

+
+

Definition at line 10 of file arg_save_iterations.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_save_iterations::arg_save_iterations ()
+
+inline
+
+ +

Definition at line 14 of file arg_save_iterations.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__save__iterations.png b/doc/api/html/classstan_1_1gm_1_1arg__save__iterations.png new file mode 100644 index 0000000000000000000000000000000000000000..91ecc045a7f25ebe6e6302f2f0bc182ae90ce17b GIT binary patch literal 1507 zcmaJ>do+}382_vY9ZD`)mr6z>YX-H;4yvtad@hq_FiaCtw#H@DjKNflQX#i78mduL zGvr!f;uCh3T)&iqacL&yGUQS!+BT)x(b@fD&tBehp7(j4_kEw=InVEX&M(CahtMx@r}A^gWxp^aeRm|IkCHXnWHszX@~#q>_T^!M;9kuALgJLkuQ z_on?+-Jh9HO_Di0BB9LMRm@$H!tI2uZ^>y zJ5Dh$So;$FUlvagJnx=vIT3DlgVCfwazcT4tLl+6?xjjy=^xO^VlwHltStY3C~6 zO@@{H9?Aek37~%h1Ekg(C%BNcM4SG8{o1tE0DIm7JiLsoy-e9>MGHMgqmqVA_Td?j zbladVs;p+qZ!<{y9S0^3V3tz9FJQ7&Wozb}iETgN^@MpCMlN3&*V(0`OHeJY>$#dE zxRfekbxTsVehwyeOayVF+L=(^s+I#5#QsO5sG+Pd-&&36Xn`Y{qxBIap+N?Yin|>w zs(UX{bHB3(3YB)L2x?f!@j8nCFMi-5_qi@{xdNo|N9!Q|aM5kR_}yXV_@^#YdNfpi>)eL$h{9W?)==)MKzmYh8vF7z!b!CNxPC5-f`K zNtr;A)sV&YR3?2g!y9yHi5Pk9<_<2>mj~vd4AHSEo1A8=r6IC@2N-a(Wa~4}yxN<5|44J1?qk25@zf{ z9LMs@P4Z<@^GV)fV?1rFDx{ISFHmkBmm3gL5Kz5f(*h@Ue%pDX_|(X~M??mff6<4k zMe@+$PrJ?d6|TlNIyGWzY-yjPw+LdO?d>bkYX04B6sWCiz zbuU;2)NHUHs1AswJE~_HJ)l4xO$5r&#fV1fm!_Ta34Dg&>B8b|n0b=H_k{10^tn`C zj*I_nmsjQk63TpvO;75_VkHriH~8-ykTq4?IGr;QcZl4<`tx#B4Q8)71%?6?XSa57 z7Ou}zwt%h2F<@mf402pHLk5S9brS-|m251{;O*;`CFxf7P5!5v;*uZcft&G zzxU5J#Pgl??&gK1u&K~|Wik!%6YK~vhbV97gVlA3YyDQxp9sUQ7i4%ZEu6H{RvQni zQcEzwwabPi!tl)%7r50B15b@i+82MWsE5{(oK2%Y$spt4OXR8ibh5VTlLyb(r4%UJ z14~mnHdSBgqSa0`DM`Ltl?+pu76YJsZ}=SVJ1UmK+!*tb=T3q2%N(c#g{VOBuYKU) z`I*owFdYX&PC4Rt_p4V7PA + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_save_warmup Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_save_warmup, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_bad_valuestan::gm::singleton_argument< T >protected
_constrainedstan::gm::singleton_argument< T >protected
_defaultstan::gm::valued_argumentprotected
_default_valuestan::gm::singleton_argument< T >protected
_descriptionstan::gm::argumentprotected
_good_valuestan::gm::singleton_argument< T >protected
_namestan::gm::argumentprotected
_validitystan::gm::singleton_argument< T >protected
_valuestan::gm::singleton_argument< T >protected
_value_typestan::gm::valued_argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_save_warmup()stan::gm::arg_save_warmupinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::singleton_argument< T >inlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::singleton_argument< T >inlinevirtual
is_valid(T value)stan::gm::singleton_argument< T >inlineprotectedvirtual
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::singleton_argument< T >inlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::valued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::valued_argumentinlinevirtual
print_valid()stan::gm::singleton_argument< T >inlinevirtual
print_value()stan::gm::singleton_argument< T >inlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::singleton_argument< T >inlinevirtual
set_value(const T &value)stan::gm::singleton_argument< T >inline
singleton_argument()stan::gm::singleton_argument< T >inline
singleton_argument(const std::string name)stan::gm::singleton_argument< T >inline
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
value()stan::gm::singleton_argument< T >inline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__save__warmup.html b/doc/api/html/classstan_1_1gm_1_1arg__save__warmup.html new file mode 100644 index 00000000000..a553a4d1fff --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__save__warmup.html @@ -0,0 +1,226 @@ + + + + + +Stan: stan::gm::arg_save_warmup Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_save_warmup Class Reference
+
+
+ +

#include <arg_save_warmup.hpp>

+
+Inheritance diagram for stan::gm::arg_save_warmup:
+
+
+ + +stan::gm::singleton_argument< T > +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_save_warmup ()
 
- Public Member Functions inherited from stan::gm::singleton_argument< T >
 singleton_argument ()
 
 singleton_argument (const std::string name)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
value ()
 
bool set_value (const T &value)
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
- Public Member Functions inherited from stan::gm::valued_argument
virtual void print (std::ostream *s, const int depth, const char prefix)
 
virtual void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Member Functions inherited from stan::gm::singleton_argument< T >
virtual bool is_valid (T value)
 
- Protected Attributes inherited from stan::gm::singleton_argument< T >
std::string _validity
 
_value
 
_default_value
 
bool _constrained
 
_good_value
 
_bad_value
 
+

Detailed Description

+
+

Definition at line 10 of file arg_save_warmup.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_save_warmup::arg_save_warmup ()
+
+inline
+
+ +

Definition at line 14 of file arg_save_warmup.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__save__warmup.png b/doc/api/html/classstan_1_1gm_1_1arg__save__warmup.png new file mode 100644 index 0000000000000000000000000000000000000000..3da22b68884787e262216f30111f6b62e043578a GIT binary patch literal 1479 zcma)6X;71A5KhDhil{?HDn*czKsnVSrW~Rm3SYt{r-?9Opr{Z8`h^e#L@HRT7zrPO zV0+A%7Dntb$Y3Rt0{^|6c*>`v6-F<#M`@DO_&&NY& zlffn!45kBky8ElWKy7R-4fTD3_BlZ9zV`D9JgQQu)ZrVMf}GP%Q%C<8o6SaC5g4me ztwevH0GPUH^$d0eeh-5of&q8ez-0Jb=_J@_z3tf6t#(Wmb|uz5Y#Y@(cHDNnC)vxY zJ|R3z1(AC0x)qe~+voti_v8SOM;r|cEkvg29uy(z*rIzr(zAHZ{Ar>xrZ9eHcD`)! z-Pj2-<0*y$EV&qWc31C{V*SZ_KSv2q_BIjiTMC35Jb6xOmd&W^xW%Owu!73^$@~3U3n<52RfF<}nFMWJ@o7e&g|8EUGfhFW*&{>dDhoPIR(XR?-(P z6_o2MWAPZ?A*2Y|X=-8)7!``Zo^yV%^juB${cF}AlQ+kr8w8>QwZcB|xD7l_7lavY zbb#e#8D@C6ZDE_5XintPG~Rl0;K@i4%=zEX6Gm#RKn}FuY!!KxGfuMzLb5z4Z-noV zK_Q&;h~hgHiUZHnS7NCIoB3`ZRr%&KMmJnf{<=8XIAuV;8gtrKh?>pH2ItqG>QZ;$ z`Wv>lwM=QUO6w=}`!Pw{WSJ^Ua+PbR}qT9BphOBtb%q)1TW zcZ%JrSk}VU1u$a--H3|j3;LqgXq@qbaz-TuBv-3T_g5{DF^)jrQqHFVV{jiz*&vHcCTrC;u|)^#M*#ct^hcMPy-}#1hb}78nkA<&{e; zr6=zB@{-6al4Ewo&hf5;BQN{@uu5g#$}D{z*E*_Y)jS)2q-t=aP(~A4vz`>ygdv-l2~Y4kZ~mLu<8)JYrf3VvmUMK)`v zH7V>-Zc9aUSJLU zb_as#Alsp&N7sE@Z_T!il)l=)S24h#ZC{N)fKOx*LB33rI65S7TG!tfBVRZ4d(|^X z!*zXAF?icq((yR?XfB_}GxS}Ir#uXz8ADFmf}7aGSTV;-K4=v~*r&@UR|}#iKJ1cp z?P8H;PWA5aOdX>rhZxq=M4`-{;>ie^#SNwV*`Upf^M@YQnkdrHLD-Cd+E^1dHB|c( zT_6<^T&Uzx*!^?Dsp09O8|%(6A4OzjD + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_seed Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_seed, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_bad_valuestan::gm::singleton_argument< T >protected
_constrainedstan::gm::singleton_argument< T >protected
_defaultstan::gm::valued_argumentprotected
_default_valuestan::gm::singleton_argument< T >protected
_descriptionstan::gm::argumentprotected
_good_valuestan::gm::singleton_argument< T >protected
_namestan::gm::argumentprotected
_validitystan::gm::singleton_argument< T >protected
_valuestan::gm::singleton_argument< T >protected
_value_typestan::gm::valued_argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_seed()stan::gm::arg_seedinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::singleton_argument< T >inlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::singleton_argument< T >inlinevirtual
is_valid(T value)stan::gm::singleton_argument< T >inlineprotectedvirtual
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::singleton_argument< T >inlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::valued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::valued_argumentinlinevirtual
print_valid()stan::gm::singleton_argument< T >inlinevirtual
print_value()stan::gm::singleton_argument< T >inlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::singleton_argument< T >inlinevirtual
set_value(const T &value)stan::gm::singleton_argument< T >inline
singleton_argument()stan::gm::singleton_argument< T >inline
singleton_argument(const std::string name)stan::gm::singleton_argument< T >inline
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
value()stan::gm::singleton_argument< T >inline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__seed.html b/doc/api/html/classstan_1_1gm_1_1arg__seed.html new file mode 100644 index 00000000000..5e4c06c5000 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__seed.html @@ -0,0 +1,226 @@ + + + + + +Stan: stan::gm::arg_seed Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_seed Class Reference
+
+
+ +

#include <arg_seed.hpp>

+
+Inheritance diagram for stan::gm::arg_seed:
+
+
+ + +stan::gm::singleton_argument< T > +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_seed ()
 
- Public Member Functions inherited from stan::gm::singleton_argument< T >
 singleton_argument ()
 
 singleton_argument (const std::string name)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
value ()
 
bool set_value (const T &value)
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
- Public Member Functions inherited from stan::gm::valued_argument
virtual void print (std::ostream *s, const int depth, const char prefix)
 
virtual void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Member Functions inherited from stan::gm::singleton_argument< T >
virtual bool is_valid (T value)
 
- Protected Attributes inherited from stan::gm::singleton_argument< T >
std::string _validity
 
_value
 
_default_value
 
bool _constrained
 
_good_value
 
_bad_value
 
+

Detailed Description

+
+

Definition at line 10 of file arg_seed.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_seed::arg_seed ()
+
+inline
+
+ +

Definition at line 14 of file arg_seed.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__seed.png b/doc/api/html/classstan_1_1gm_1_1arg__seed.png new file mode 100644 index 0000000000000000000000000000000000000000..96ed5af1eba4836d3a6df682f850fe5d1d3cf9de GIT binary patch literal 1562 zcmbW1c~Fx_7{n+qFb+cm08mb>>t!XytL{$!8{$pV)#>n|_4ReJoSa^ay4IK~R$pg*eZ4ewKu3I( zjU>9b0pg;K@w)Y}830HZ!I+;9p9A>}Uc~%vWvQfs-81Viun$6>$o5|`>Tii=@7;m& z^ysXg`=$I%;AXTtur=L8PPYYelE78dFyQ0139Kd65zg?w?iZtYtG4D%>rC$K7KhOF z-t;&hdTGs8TmT(Ul<_VV*;@-vI95h>j$g^;Zw zS3s8qzd~QqNNII6oNP2h$2F`uv8RnjZIIHZ1~@8J>cji%P@AH!5-upOCwVO7@ZIAG!nvj;4lX@0nm+yV-g`A|0je7h8`Kt z8)qtc{j-45TjHq`KCbbj zv9#D@I>Yyc*zwz}46jzFm{e9f>Me>+u%}sVAabxLty0moLcphbDtt=rXjef{Gc3E) zT2*4R^&=ij5b7o)osPyG<;R@(iD2B4P^DI&G#@k}II@TOTkj$=aF@i&i~Bc}DDib= z_CN|=Nk-~dtWO*Q(4I3w{Kym8?V~i;hT$Kb0nat)CrRRJg^|FDT3#XyY|ygpwq?E{ z@kuD|=o%g3KoXbtY!ENrq--xn$!u%*zs$dylb}H*1(he|@1~@{*;1)u%Rp!^Bwye0 zlv}30e+$BkCwW1zH-{&nO-CVtmi+Bt>BQ;JPoP%UW0}pJ!f##})~uo{8ONGzYfia+ zPz~j))+vje+k5uUot(J;am3_q)p4|!o+(W?xyZKLVlw8Qv`5t1l>JNdqol&KIc-{g zx#1AurhBwv8b(p`Pcv#%-@OaDhj4j5+%gZ#`OxAD-a9@=;X9cc)&MWPZa@ed&T+G& zg{H_4k-;9`v@U&9k0Df=eb@IT+L0$UIWY@3Lqi|-fR0FsIw(C5%yMD^DRFVkqCt*| z=-K5Vt6KfDLca;ho$gm@=g(V_FrvB=?{4+ z6vzg|##uF@xD}D9>|J~e z8I(DCg$1DCuj(`GLuS?wN2LyZIGG{%? zl9_yZ>Z3rwTUG2*tM-41(7$GFBsy)^9o4v{A{^Z&%tRba)vv+injtkL51^mIp0Lm3 zT$zq*Gx)^NmWQO z;>V55F1%M5zEyaTo{%qYO5Yj{Nl;95_(B$;`^k*>$0dEk@ A + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_static Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_static, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + +
_descriptionstan::gm::argumentprotected
_namestan::gm::argumentprotected
_subargumentsstan::gm::categorical_argumentprotected
arg(const std::string name)stan::gm::categorical_argumentinlinevirtual
arg_static()stan::gm::arg_staticinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::categorical_argumentinlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::categorical_argumentinlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::categorical_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse)stan::gm::categorical_argumentinlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::categorical_argumentinlinevirtual
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
subarguments()stan::gm::categorical_argumentinline
~argument()stan::gm::argumentinlinevirtual
~categorical_argument()stan::gm::categorical_argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__static.html b/doc/api/html/classstan_1_1gm_1_1arg__static.html new file mode 100644 index 00000000000..8e65af06360 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__static.html @@ -0,0 +1,201 @@ + + + + + +Stan: stan::gm::arg_static Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_static Class Reference
+
+
+ +

#include <arg_static.hpp>

+
+Inheritance diagram for stan::gm::arg_static:
+
+
+ + +stan::gm::categorical_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_static ()
 
- Public Member Functions inherited from stan::gm::categorical_argument
virtual ~categorical_argument ()
 
void print (std::ostream *s, const int depth, const char prefix)
 
void print_help (std::ostream *s, const int depth, const bool recurse)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
std::vector< argument * > & subarguments ()
 
argumentarg (const std::string name)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
int compute_indent (const int depth)
 
+ + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Attributes inherited from stan::gm::categorical_argument
std::vector< argument * > _subarguments
 
+

Detailed Description

+
+

Definition at line 12 of file arg_static.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_static::arg_static ()
+
+inline
+
+ +

Definition at line 16 of file arg_static.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__static.png b/doc/api/html/classstan_1_1gm_1_1arg__static.png new file mode 100644 index 0000000000000000000000000000000000000000..5a9967c68df5a036cabb3bbf1228cac55247fd8b GIT binary patch literal 1002 zcmeAS@N?(olHy`uVBq!ia0vp^JAt@^gBeKngzicMQW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;oWEp6ip{p@tm*+-s6^OL?$ic-#AF*9d<%3KA{ z<1r@j@6#8Dw)bwBdF=vwUYqJmmg%dP<|J;emOnfFME^6jo7d-E*qi$+Wu8juo3}e{ zwLOpjS#{33IQaYTsY$2q?v3)|o*}=!tn_!nwTs(2->_c07o_hssc+|3*{VISdi9%c zpYeU^ajESwho{xq+UmMLLOVaqnz)2HZ>^YTk@6YUlhX~RtHi5)o>MF**s%U1gT$o7 zv-16cSKCeJA7Kxbziv~--C&-`_rQAw^ADkC4EtIv8}#vU4@?7^B(zC|*8>zdiF%&< zN}hR6sylXkH7nZ#2*Yk8*1)x#xq|F+MonHR}-_Qjv%xuNXOR$O17IbUH!B)eErPpoago1pJn$*{>a#O^0w{5YVnFgcfwAm z{mnc0{pzR6^X9?#uUDq$y{bF^p?2>3s~4h+qu+_IT57Xrsq`A*H_egmuP5iv`@L`b z8`sl@?&!1a)ZqMrjlfE<-U;LbWeV?)3y5geqzg1OU+FoB& zZ}GWitH-5yC0YdUlprY~p#u%jcsL#UIeLAuuUYNxSwG*;V2*j%^z(}2{ImOI<{8gk z>0Pbc{w+38d?W7-wd&I6Li`0MDnB1xIYU=XWtRWO>YM8)nr>O&r#7>b-QvllpR;zv zrzs~a+q%cMZ0i;Mu+y*S%`=HtDnC;`srF(`b#wn2;R~P5Zhk*g?seJXT~2KJ-}8LSqst&~=~wdk^n+<7$G`vl$~EIZL*41v>bf<>lRucR sVm&a?fc=B&8OEBGy;@7B9D8JM$>+7IPI$#kV8&$dboFyt=akR{0N9cA)c^nh literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1gm_1_1arg__stepsize-members.html b/doc/api/html/classstan_1_1gm_1_1arg__stepsize-members.html new file mode 100644 index 00000000000..f430d4b4dea --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__stepsize-members.html @@ -0,0 +1,147 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_stepsize Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_stepsize, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_bad_valuestan::gm::singleton_argument< T >protected
_constrainedstan::gm::singleton_argument< T >protected
_defaultstan::gm::valued_argumentprotected
_default_valuestan::gm::singleton_argument< T >protected
_descriptionstan::gm::argumentprotected
_good_valuestan::gm::singleton_argument< T >protected
_namestan::gm::argumentprotected
_validitystan::gm::singleton_argument< T >protected
_valuestan::gm::singleton_argument< T >protected
_value_typestan::gm::valued_argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_stepsize()stan::gm::arg_stepsizeinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::singleton_argument< T >inlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::singleton_argument< T >inlinevirtual
is_valid(double value)stan::gm::arg_stepsizeinline
stan::gm::singleton_argument::is_valid(T value)stan::gm::singleton_argument< T >inlineprotectedvirtual
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::singleton_argument< T >inlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::valued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::valued_argumentinlinevirtual
print_valid()stan::gm::singleton_argument< T >inlinevirtual
print_value()stan::gm::singleton_argument< T >inlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::singleton_argument< T >inlinevirtual
set_value(const T &value)stan::gm::singleton_argument< T >inline
singleton_argument()stan::gm::singleton_argument< T >inline
singleton_argument(const std::string name)stan::gm::singleton_argument< T >inline
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
value()stan::gm::singleton_argument< T >inline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__stepsize.html b/doc/api/html/classstan_1_1gm_1_1arg__stepsize.html new file mode 100644 index 00000000000..a2134038ab6 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__stepsize.html @@ -0,0 +1,255 @@ + + + + + +Stan: stan::gm::arg_stepsize Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_stepsize Class Reference
+
+
+ +

#include <arg_stepsize.hpp>

+
+Inheritance diagram for stan::gm::arg_stepsize:
+
+
+ + +stan::gm::singleton_argument< T > +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_stepsize ()
 
bool is_valid (double value)
 
- Public Member Functions inherited from stan::gm::singleton_argument< T >
 singleton_argument ()
 
 singleton_argument (const std::string name)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
value ()
 
bool set_value (const T &value)
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
- Public Member Functions inherited from stan::gm::valued_argument
virtual void print (std::ostream *s, const int depth, const char prefix)
 
virtual void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Member Functions inherited from stan::gm::singleton_argument< T >
virtual bool is_valid (T value)
 
- Protected Attributes inherited from stan::gm::singleton_argument< T >
std::string _validity
 
_value
 
_default_value
 
bool _constrained
 
_good_value
 
_bad_value
 
+

Detailed Description

+
+

Definition at line 10 of file arg_stepsize.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_stepsize::arg_stepsize ()
+
+inline
+
+ +

Definition at line 14 of file arg_stepsize.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
bool stan::gm::arg_stepsize::is_valid (double value)
+
+inline
+
+ +

Definition at line 26 of file arg_stepsize.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__stepsize.png b/doc/api/html/classstan_1_1gm_1_1arg__stepsize.png new file mode 100644 index 0000000000000000000000000000000000000000..a1a8963940014b9e7293f8a5065ad30ea641fd94 GIT binary patch literal 1481 zcmcJPeN@tC6vsj5dsNF)z7(f9=Sod2=L@!sG~Y-;R1n{=I+i4cD^nCg%jGQRTQk#U ziJCd_$HY)UQxnR{X#$%4vdFh|sbN@Rh-J!f=lIX|$Nt)L&VBBE&bjy8bH2~LpKL6~ z7iMT~2!TLgC_k@YjhAUmsIRTL-P1Pg(l}FW0M1*jR%^oPx60&#`eV(Fu5WOv{c1wV6S1|15{7T`r&8?pU`?UKp};nL$9 zh#C;J^)s9)yh!b-_4|-IpmCInh#!8HTspeEQ(Z_76#=%<1z2~9Dn+RrR4ettfzOAa z>=ktq9+XZ40Pi#bo^|wu*7?yX-9BA8Ya~I`!mpycQXcXwz>y57tctDm)Q6zM%HtSf zw-Ps3xU||Fpd{hXYlWLP6$!k4q$ zPDX3}hsE%Ol_9ghIL8g+nd6=}nleot_Unp&X<)tSIo%?Q9|?h%_;1oLh41OK<~o7P zMv)RL7?MVk`R@iT+v{3!=!S!FOz-vGm*L>oqv0tNW)uv;{l1>gzN@2qK<`H{i^Qq1PHa+voJ91^|-L`OW%1po@%%AcYm~b^hEOgKW zzg5pCI5qd)X?|odAi?NGN615;R$nzKKq;-u83cR^VlEqJcgJbyCtxNPpkMN>x28^e zAwXxstSoYS5;zsLZC0igy3Aga;Qtpnh@}gv!qDONjE(4Ikx#|lfMTZ;EHg)Lvj>Q}<1e zM$1@dE8`?LmlbJl@k!yeU}|Gn1$KUc)5X^%~w&ga-Za zf_dVP0tHFQT1ZzsoTSm9fiKSmI9rb;a@`*BWvNTGPaQn1d9ywLJ z#u~JD44)wiQS9M}%4v>d?|TIe@jL@xp7_@CV}H$uhIjQc`!3ud49ENPHOp79lex(4 z14wQy?3Y%Rv0dCCGM(XsQWEn`Zp)D9)urYD5nEHhqo!HkLKf2!Ae6p*nfzI9{P#f0 zKxov~U^(2hV*h_k|G(Cw!%yF$2@0*ySt~@;(cfH=8c;>%>P#CUP0Sh*;E;!3r+zZH z`oJ6+Ggp-UU+%kOMyvBl<1eHZ5)=dp{-k6gmFGH`g8G`c0cyT + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_stepsize_jitter Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_stepsize_jitter, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_bad_valuestan::gm::singleton_argument< T >protected
_constrainedstan::gm::singleton_argument< T >protected
_defaultstan::gm::valued_argumentprotected
_default_valuestan::gm::singleton_argument< T >protected
_descriptionstan::gm::argumentprotected
_good_valuestan::gm::singleton_argument< T >protected
_namestan::gm::argumentprotected
_validitystan::gm::singleton_argument< T >protected
_valuestan::gm::singleton_argument< T >protected
_value_typestan::gm::valued_argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_stepsize_jitter()stan::gm::arg_stepsize_jitterinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::singleton_argument< T >inlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::singleton_argument< T >inlinevirtual
is_valid(double value)stan::gm::arg_stepsize_jitterinline
stan::gm::singleton_argument::is_valid(T value)stan::gm::singleton_argument< T >inlineprotectedvirtual
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::singleton_argument< T >inlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::valued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::valued_argumentinlinevirtual
print_valid()stan::gm::singleton_argument< T >inlinevirtual
print_value()stan::gm::singleton_argument< T >inlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::singleton_argument< T >inlinevirtual
set_value(const T &value)stan::gm::singleton_argument< T >inline
singleton_argument()stan::gm::singleton_argument< T >inline
singleton_argument(const std::string name)stan::gm::singleton_argument< T >inline
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
value()stan::gm::singleton_argument< T >inline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__stepsize__jitter.html b/doc/api/html/classstan_1_1gm_1_1arg__stepsize__jitter.html new file mode 100644 index 00000000000..ae6ff6c997a --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__stepsize__jitter.html @@ -0,0 +1,255 @@ + + + + + +Stan: stan::gm::arg_stepsize_jitter Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_stepsize_jitter Class Reference
+
+
+ +

#include <arg_stepsize_jitter.hpp>

+
+Inheritance diagram for stan::gm::arg_stepsize_jitter:
+
+
+ + +stan::gm::singleton_argument< T > +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_stepsize_jitter ()
 
bool is_valid (double value)
 
- Public Member Functions inherited from stan::gm::singleton_argument< T >
 singleton_argument ()
 
 singleton_argument (const std::string name)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
value ()
 
bool set_value (const T &value)
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
- Public Member Functions inherited from stan::gm::valued_argument
virtual void print (std::ostream *s, const int depth, const char prefix)
 
virtual void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Member Functions inherited from stan::gm::singleton_argument< T >
virtual bool is_valid (T value)
 
- Protected Attributes inherited from stan::gm::singleton_argument< T >
std::string _validity
 
_value
 
_default_value
 
bool _constrained
 
_good_value
 
_bad_value
 
+

Detailed Description

+
+

Definition at line 10 of file arg_stepsize_jitter.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_stepsize_jitter::arg_stepsize_jitter ()
+
+inline
+
+ +

Definition at line 14 of file arg_stepsize_jitter.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
bool stan::gm::arg_stepsize_jitter::is_valid (double value)
+
+inline
+
+ +

Definition at line 26 of file arg_stepsize_jitter.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__stepsize__jitter.png b/doc/api/html/classstan_1_1gm_1_1arg__stepsize__jitter.png new file mode 100644 index 0000000000000000000000000000000000000000..6d0f2b082c6280cfb1d637f936b9c15198524089 GIT binary patch literal 1527 zcmcIkdo+{@6dz4u)ii0B#F^BJA`BA~X;4JogZaEiI@M|n(lACcZBMOQ6syEw+C0Bu zDnnt4FOtd`^7!(|%+9iuiIAO`!OYI?+5YLD{cGahg<_xUZPS+6RENUCfZ!(^oZW1gG!}R1>a9e>DjHU1MH``B17O(Vfr9>>bN(@t?* zFZ~Wmj}*@4fN$J_ftt(@q>GY)hOMc=0KvCm$Hs|1LQO|EZT?+XiYM1mu^HRFhj*TG z-!4KL$0cGCy=qYf82{+n5VtND-pfWgZod?189??lpUcNarw`R#qKPH7k{uC2(5c*< zmDAwftTeDdeaRt?LNzL`T2miI4W8$NhO>E$dZIuioE{ZK4z(PH9{4+^dKScsGAB3` zj!@r@A(oj|o`vYY0Wc=ALMF`qgsu7ku5KEYYQo(z1-DrtZ`pE3Zru_9fy!bo7-m2Q z>hT}JHmh|$h}oqP#4sBJzpdFkkW88>uW7)S4m(&mGn0UG!|y>veGi}(bC47HGHlVCYzSw0=Z?-4E>Oev&bTFZ zvd&OhRx49U;xah?AUW*xTt2DfQx^lEUqL(G0F7^@^NDn!H-MgdZ`;0}xxtq%$m6F< zE^_6pYi(pQ1pb)!Wd#5KkhNfTY8L#aCq{Mf^GoVt!R#EKx@rUI*!lr zMwT0Q7x!|ql@$;ADs5f|)umWJ4>u{>RXRU9iz_b4xfHr-z?Gk<~qR#nCVFiF?;vAlS#&&B!9*R;k$g<_vR3&aD?ef@U zbPSHM9NQi!?~_AYX!xfXdaHru1gZ&Gz) zhnlDDDaXzsS%Ksr%lUj<2|WNu`J`Az@7@6JIb;UFYX*Oc}yyjBou{&RgGH; zT*d?z@OB)e)>U8jcp{RshJDN^BzaFJ>z(daLKps_p9nr+dq#){{2p_>jFoMxvVyZ)3a->o*3Qt? + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_test Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_test, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_cursorstan::gm::list_argumentprotected
_defaultstan::gm::valued_argumentprotected
_default_cursorstan::gm::list_argumentprotected
_descriptionstan::gm::argumentprotected
_namestan::gm::argumentprotected
_value_typestan::gm::valued_argumentprotected
_valuesstan::gm::list_argumentprotected
arg(std::string name)stan::gm::list_argumentinlinevirtual
arg_test()stan::gm::arg_testinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::list_argumentinlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::list_argumentinlinevirtual
list_argument()stan::gm::list_argumentinline
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::list_argumentinlinevirtual
print(std::ostream *s, int depth, const char prefix)stan::gm::list_argumentinlinevirtual
print_help(std::ostream *s, int depth, bool recurse)stan::gm::list_argumentinlinevirtual
print_valid()stan::gm::list_argumentinlinevirtual
print_value()stan::gm::list_argumentinlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::list_argumentinlinevirtual
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
valid_value(std::string name)stan::gm::list_argumentinline
value()stan::gm::list_argumentinline
values()stan::gm::list_argumentinline
~argument()stan::gm::argumentinlinevirtual
~list_argument()stan::gm::list_argumentinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__test.html b/doc/api/html/classstan_1_1gm_1_1arg__test.html new file mode 100644 index 00000000000..1e71c2b9355 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__test.html @@ -0,0 +1,205 @@ + + + + + +Stan: stan::gm::arg_test Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_test Class Reference
+
+
+ +

#include <arg_test.hpp>

+
+Inheritance diagram for stan::gm::arg_test:
+
+
+ + +stan::gm::list_argument +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_test ()
 
- Public Member Functions inherited from stan::gm::list_argument
 list_argument ()
 
 ~list_argument ()
 
void print (std::ostream *s, int depth, const char prefix)
 
void print_help (std::ostream *s, int depth, bool recurse)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
bool valid_value (std::string name)
 
argumentarg (std::string name)
 
std::vector< argument * > & values ()
 
std::string value ()
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
+ + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Attributes inherited from stan::gm::list_argument
int _cursor
 
int _default_cursor
 
std::vector< argument * > _values
 
+

Detailed Description

+
+

Definition at line 12 of file arg_test.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_test::arg_test ()
+
+inline
+
+ +

Definition at line 16 of file arg_test.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__test.png b/doc/api/html/classstan_1_1gm_1_1arg__test.png new file mode 100644 index 0000000000000000000000000000000000000000..0029759cc979037ff7a8e2f161082304cbad1aca GIT binary patch literal 1282 zcmeAS@N?(olHy`uVBq!ia0vp^3xN0l2Q!e|@^pqPkdg@S332`Z|38rV;?396{zDUh zEHFNB-~emq9eE&^qa?^Lm;tB=1g@S6F=Aj~nds@_7*fIbcJAv*kF|K%X7{h!^Iuv1 z_^}w7oXHxS+wTTWwVrvyV~b$YKcVCvW9KPLDhnMwH$7;Yl#=LS;Bl$HaPHsr;ym6J zC*-|1eO+x+V|UYT)$Z5*Z_Da#@T{4<^x>o{kKGDRN1PR0^2|%<_np)fxmzsT52-p# z`gMnUno`K-=eK*qg~JMEeiTJd@{`akjGB<8tH-*1;`An8qwL9F;(mDiW(nrJ z()HB8(?4N}w~uy3@iD&M2}`uss7_lVf0R}AWD~d7q*hmhV-o6Y4_4bSq@|S|Jf2*1 z_$I6P{++zb#lPsWZFtzkAQmHVpoyC)qQH@XTaP2*AS9h3S?JF<8-_~2;Stg+KI%=)k+`XMSZF4x}yymD{ z=U?Nk*Zdf_!0_N&i%^HSrt3VvS9l*(TX$Jy?{^7-H`8{+CU`!adXHnH2!y}flhs;~Lg(_{Z9OZ1s| zS{cpC^ZBqNTg@3SURgtVvzFX0$`m+82&4ce8YqLu4CZ2PT?{iHF ziJg1lJ!hSm#>!o8tcQyoKOGm^RyVc%b=B4GZT~e4f8Y4}KDU4`^U!O}R~NJo>TWwF z225y|-)?4kSrE!SY47LjdAB*_o!_&ZE}E`#c1e57*Yjo5bZ$PWifle?C#O+Z_4U=- z_pIItnjhyT7$2_KE3R1>vO$x?mG+s&ARnZ~duz`FSf z9ExXn7!%^4=~P1O&!uXa%XgOjRcD#L`9)>avi@`r(ao|UFBjXz6o31rvHH@KEey+f zIP!wk8*`nQu1-}cJ85LZuUj0F`H8Nq#&DJ&JgXo4b-UkxZm&7Ry#srinBCv1$HnU!9_WYWGbcL+Cyqp~f6P3& W3EJWO-W|XKi^0>?&t;ucLK6UxCr^|B literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1gm_1_1arg__test__grad__eps-members.html b/doc/api/html/classstan_1_1gm_1_1arg__test__grad__eps-members.html new file mode 100644 index 00000000000..9259f3f9a6e --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__test__grad__eps-members.html @@ -0,0 +1,147 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_test_grad_eps Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_test_grad_eps, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_bad_valuestan::gm::singleton_argument< T >protected
_constrainedstan::gm::singleton_argument< T >protected
_defaultstan::gm::valued_argumentprotected
_default_valuestan::gm::singleton_argument< T >protected
_descriptionstan::gm::argumentprotected
_good_valuestan::gm::singleton_argument< T >protected
_namestan::gm::argumentprotected
_validitystan::gm::singleton_argument< T >protected
_valuestan::gm::singleton_argument< T >protected
_value_typestan::gm::valued_argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_test_grad_eps()stan::gm::arg_test_grad_epsinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::singleton_argument< T >inlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::singleton_argument< T >inlinevirtual
is_valid(double value)stan::gm::arg_test_grad_epsinline
stan::gm::singleton_argument::is_valid(T value)stan::gm::singleton_argument< T >inlineprotectedvirtual
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::singleton_argument< T >inlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::valued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::valued_argumentinlinevirtual
print_valid()stan::gm::singleton_argument< T >inlinevirtual
print_value()stan::gm::singleton_argument< T >inlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::singleton_argument< T >inlinevirtual
set_value(const T &value)stan::gm::singleton_argument< T >inline
singleton_argument()stan::gm::singleton_argument< T >inline
singleton_argument(const std::string name)stan::gm::singleton_argument< T >inline
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
value()stan::gm::singleton_argument< T >inline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__test__grad__eps.html b/doc/api/html/classstan_1_1gm_1_1arg__test__grad__eps.html new file mode 100644 index 00000000000..cc8ae667711 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__test__grad__eps.html @@ -0,0 +1,255 @@ + + + + + +Stan: stan::gm::arg_test_grad_eps Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_test_grad_eps Class Reference
+
+
+ +

#include <arg_test_grad_eps.hpp>

+
+Inheritance diagram for stan::gm::arg_test_grad_eps:
+
+
+ + +stan::gm::singleton_argument< T > +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_test_grad_eps ()
 
bool is_valid (double value)
 
- Public Member Functions inherited from stan::gm::singleton_argument< T >
 singleton_argument ()
 
 singleton_argument (const std::string name)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
value ()
 
bool set_value (const T &value)
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
- Public Member Functions inherited from stan::gm::valued_argument
virtual void print (std::ostream *s, const int depth, const char prefix)
 
virtual void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Member Functions inherited from stan::gm::singleton_argument< T >
virtual bool is_valid (T value)
 
- Protected Attributes inherited from stan::gm::singleton_argument< T >
std::string _validity
 
_value
 
_default_value
 
bool _constrained
 
_good_value
 
_bad_value
 
+

Detailed Description

+
+

Definition at line 10 of file arg_test_grad_eps.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_test_grad_eps::arg_test_grad_eps ()
+
+inline
+
+ +

Definition at line 14 of file arg_test_grad_eps.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
bool stan::gm::arg_test_grad_eps::is_valid (double value)
+
+inline
+
+ +

Definition at line 26 of file arg_test_grad_eps.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__test__grad__eps.png b/doc/api/html/classstan_1_1gm_1_1arg__test__grad__eps.png new file mode 100644 index 0000000000000000000000000000000000000000..d9b86efc996eccd0d6f205f76b8e83d27f8b2bfc GIT binary patch literal 1523 zcmai!doa{%7{`BZCDX=q=(4#SCkbU&tXA43xnFm)`&&_49Ew(w5G~8fnM%&)RtPzA z_uJY|?yb^FE=3gm+;W@Hw!5yeC}q!Trhm?v=Dah{`#kT=_j%u$&-=dL1frWgLJ6q^ z006?#!Ny&hh0@?D%1LKDLwT<>Z6msnZ6y+kwEQ?J4o`ZPEUmr=kH=F;7}Sz36~o-! zNPtwdHsF_JV*pUN>}X>}j+B|YBTB6>Pyw>54Q3>*yLSXLmsl@q)|ZyQ;_wc&8LbwH zxSUNN$$@!gP`VunG-R!i6^7e3JRTaqB;_sorntp`z>?E1!_4Y;%J zm6ml7qmv5j^o{5{2kv-Sf_(dD71i|^I5N7^-<0IqF-`xZYriRFQW4y>%%Ty$X|SzlZj^8jlR)ZDobOe^ zVvay;f?cg#sEOQ%z9Q2f@AFzcKXzGYX6uySY@$2_COs-1AZ#`KHQ)kbkNVav= zfvAMWq~U}w>Mr7q86f{&!bQCk{?%7X+pf^6haDp(H12Qmz&D~dN4h)>g&0Cxx#A#C zyKPZZknWg;S9;Iz)CL%qcf(Q<&OH}RgFt*^_IIA=QpJMn%AGVMDj=F+5_fd~JJo9z zE~T1!0PgYOEms_gtFWW#L29eWt@Tq+uzKPxAcW}YZ4Bizn zEi6*z3N5f#>kh_&5(8JT3bV!m2i9>!5HPxe1B7{+a7zKQmrnkxxT=;?IACCO=+aMM z{*-ofGDpNU&m-NBD~7y~Yo{2)d307&^5+J0ei_PhL#64|V$KX3(*4SSXD3yQ--Wh{ z{Lg(oBM6@B?v?nCJoHcxFdUdYe+{dA-Tzt(VrYKCh4J3Dy%QeKBCqJ@JI3qw{tbof zv*HI%Jb(k$lbT5io@w zs}+&pF-w78cP%EaWy-Pyx$C?|zp5{_DtH)lrKIpBaY7Y~G*(;J;`{w%Y>jt{dVeCt z`sD!U^!<#B;o95?iV3`+cNWo)V@E-Plp&|lCl%(ZscHVT*^bR)r+`yCskCv{0x`7Rn0k6M^V*Yz(SWSeG*h zi*FLsM90yl^)aRnVgvp!N5!$OYrlGpB>|R_H2{_^l$qwG_TstH<|<9NXCBSZ4NKeWg8P(S7;HhpO<(4VBKwq1DWJ_6;9t1U(=hlu zffwBEDwJ|cUGDPdPI7oao%(t%MMkFjQT=2#xqD1L*<||pQ5JI?d2IjAQ`VB(!b}#h tLw%|C?aWA-?AMSV-jOMcRn%7Ph$S>9c9FfeGNld;ING||a1MK4{s%b!>@olV literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1gm_1_1arg__test__grad__err-members.html b/doc/api/html/classstan_1_1gm_1_1arg__test__grad__err-members.html new file mode 100644 index 00000000000..00f2253beb7 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__test__grad__err-members.html @@ -0,0 +1,147 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_test_grad_err Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_test_grad_err, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_bad_valuestan::gm::singleton_argument< T >protected
_constrainedstan::gm::singleton_argument< T >protected
_defaultstan::gm::valued_argumentprotected
_default_valuestan::gm::singleton_argument< T >protected
_descriptionstan::gm::argumentprotected
_good_valuestan::gm::singleton_argument< T >protected
_namestan::gm::argumentprotected
_validitystan::gm::singleton_argument< T >protected
_valuestan::gm::singleton_argument< T >protected
_value_typestan::gm::valued_argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_test_grad_err()stan::gm::arg_test_grad_errinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::singleton_argument< T >inlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::singleton_argument< T >inlinevirtual
is_valid(double value)stan::gm::arg_test_grad_errinline
stan::gm::singleton_argument::is_valid(T value)stan::gm::singleton_argument< T >inlineprotectedvirtual
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::singleton_argument< T >inlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::valued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::valued_argumentinlinevirtual
print_valid()stan::gm::singleton_argument< T >inlinevirtual
print_value()stan::gm::singleton_argument< T >inlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::singleton_argument< T >inlinevirtual
set_value(const T &value)stan::gm::singleton_argument< T >inline
singleton_argument()stan::gm::singleton_argument< T >inline
singleton_argument(const std::string name)stan::gm::singleton_argument< T >inline
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
value()stan::gm::singleton_argument< T >inline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__test__grad__err.html b/doc/api/html/classstan_1_1gm_1_1arg__test__grad__err.html new file mode 100644 index 00000000000..b95a3dec569 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__test__grad__err.html @@ -0,0 +1,255 @@ + + + + + +Stan: stan::gm::arg_test_grad_err Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_test_grad_err Class Reference
+
+
+ +

#include <arg_test_grad_err.hpp>

+
+Inheritance diagram for stan::gm::arg_test_grad_err:
+
+
+ + +stan::gm::singleton_argument< T > +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_test_grad_err ()
 
bool is_valid (double value)
 
- Public Member Functions inherited from stan::gm::singleton_argument< T >
 singleton_argument ()
 
 singleton_argument (const std::string name)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
value ()
 
bool set_value (const T &value)
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
- Public Member Functions inherited from stan::gm::valued_argument
virtual void print (std::ostream *s, const int depth, const char prefix)
 
virtual void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Member Functions inherited from stan::gm::singleton_argument< T >
virtual bool is_valid (T value)
 
- Protected Attributes inherited from stan::gm::singleton_argument< T >
std::string _validity
 
_value
 
_default_value
 
bool _constrained
 
_good_value
 
_bad_value
 
+

Detailed Description

+
+

Definition at line 10 of file arg_test_grad_err.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_test_grad_err::arg_test_grad_err ()
+
+inline
+
+ +

Definition at line 14 of file arg_test_grad_err.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
bool stan::gm::arg_test_grad_err::is_valid (double value)
+
+inline
+
+ +

Definition at line 26 of file arg_test_grad_err.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__test__grad__err.png b/doc/api/html/classstan_1_1gm_1_1arg__test__grad__err.png new file mode 100644 index 0000000000000000000000000000000000000000..0a9b3b1cc2a29d0132270da8d1ea93072a430b5d GIT binary patch literal 1519 zcmcK4|3A}t902ekk?Qp2m>kwsxUlKej<8et)-*Hw60;UPJVbMnFLN_YB0W;0FPD{+ zhetWvN9HV}quHvn%hz1(qa%hKJ7YFx3bC7e+#k>{_kKK{@7L?~c)WjlzuvF+WgIqm zvxTh%1OnNNJ{o{GM5Tem+{Cb>axC2p!3KvR2I}>CL;Cl$j$ZQonj!m_L?SW0JP0$C z=IMAW0b)3`w!jXe2LxiuLI)fsGK^IBrfxiT*#f!S=%UuYbiT_llKr;lv>3II)Yxxj zldwZ7-t=PMyiq>QvH+kZt|_lBBZ{RP{_rR1ye6Bk9T?_!Hm|s`{oo%c3-b%FR%Qny z)4TH7L!{w}P2lo?0Ca-$!{Y^!%pU5MXH`ochjb=bJQeSzy$ypFw*7Loc}!WabS^KI zj5)_Eo2B!Ig=R-c zLgX5GcqpK*KR7?l0KO^!l-85BKHW`In5K%V+3ImtCp0bA4u`TagMU3^nQX5(8Ys)2 zsBclGog|3DIPjfkQrNEL)}`)r{j_AIFu&Jl=T@t)24R&UlogWrY$rU;^S!T9UmP#?Qx!u~$e5=ipC@oWM&@wN%p3 zXnxp3S~qVLOQb>xp#LB(ROk;YAW+jL_^tDYBXYXhM|-d_pg4pJGzJ++NpzdS%8d|K z#l}Oh`3KBj)5iu%lwbq&Z87nIu}MQP*SI0*^JQN*wCwvBoGK4TN@A}GLGoIqw3l-u z>;xe3J7ZO7i=RRP0H(RoNUBfOVupR{GTAmaYNqMaq)N|I%UmrRtdg?5q?GmJ`~Mn~ z&gfDnzF*u`s-UHG10VJZ&^N8$J^{{ri{>Pb)paNIuOH+P4;jQtk%lUd}jb z9z6E8zL6hK?~>Nb*;a_$Ds)W^cBI)j9!$F@A@hdHDgl0pi)Jp9D+OP$`m*jGK@ zpsrIQekZ;)B?>3b)KNrS`N#TRpd$5LL=)i%oF6NaePSkFQ`Xpp#ejO`|1}Nx5T4~x z2xp-jnOD3Tza2m;yZ!_9j|+oWUn%Z z4gr7SYAHpnI!xRp=-d*x&S5xyp#uiUvu3zhb_u3$KYXl}8|AD?1J}vE%o47IbuUr7 z#KYm#wTt&^x!cK7Jt}qAMDNi=LaRLvx;H-x(!Qy3g2pufl8YU7%pGECp7@Rgvg})u zp3c|y&6|RAUPdxZ#d{tAX+sL9g9cz0n({Xpy2V|^2<>+J^Qaz7%y~b|e-B)GVwDiW bOIbA$MP7LUMTxf>erE_e5F5Zh5_91n?EU(I literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1gm_1_1arg__test__gradient-members.html b/doc/api/html/classstan_1_1gm_1_1arg__test__gradient-members.html new file mode 100644 index 00000000000..031cb6a04d4 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__test__gradient-members.html @@ -0,0 +1,133 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_test_gradient Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_test_gradient, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + +
_descriptionstan::gm::argumentprotected
_namestan::gm::argumentprotected
_subargumentsstan::gm::categorical_argumentprotected
arg(const std::string name)stan::gm::categorical_argumentinlinevirtual
arg_test_gradient()stan::gm::arg_test_gradientinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::categorical_argumentinlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::categorical_argumentinlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::categorical_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse)stan::gm::categorical_argumentinlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::categorical_argumentinlinevirtual
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
subarguments()stan::gm::categorical_argumentinline
~argument()stan::gm::argumentinlinevirtual
~categorical_argument()stan::gm::categorical_argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__test__gradient.html b/doc/api/html/classstan_1_1gm_1_1arg__test__gradient.html new file mode 100644 index 00000000000..b213cabab1a --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__test__gradient.html @@ -0,0 +1,201 @@ + + + + + +Stan: stan::gm::arg_test_gradient Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_test_gradient Class Reference
+
+
+ +

#include <arg_test_gradient.hpp>

+
+Inheritance diagram for stan::gm::arg_test_gradient:
+
+
+ + +stan::gm::categorical_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_test_gradient ()
 
- Public Member Functions inherited from stan::gm::categorical_argument
virtual ~categorical_argument ()
 
void print (std::ostream *s, const int depth, const char prefix)
 
void print_help (std::ostream *s, const int depth, const bool recurse)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
std::vector< argument * > & subarguments ()
 
argumentarg (const std::string name)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
int compute_indent (const int depth)
 
+ + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Attributes inherited from stan::gm::categorical_argument
std::vector< argument * > _subarguments
 
+

Detailed Description

+
+

Definition at line 12 of file arg_test_gradient.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_test_gradient::arg_test_gradient ()
+
+inline
+
+ +

Definition at line 16 of file arg_test_gradient.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__test__gradient.png b/doc/api/html/classstan_1_1gm_1_1arg__test__gradient.png new file mode 100644 index 0000000000000000000000000000000000000000..9d0cbe7f95622983f0029c4abf0d88a12fb0c576 GIT binary patch literal 1069 zcmeAS@N?(olHy`uVBq!ia0vp^JAt@^gBeKngzicMQW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;Y9u@;Z3`0dc2|NZU! zdUy~0xHkEkWLC)0vT}#%tYV+EFPr!}cX>`?3z^_OX?;`7q?)gDY&w?WeuWy(n?*;HI4_u`fA)PFm$PPsP~iE?20IdGO<$@*o+N zmr?vDPyb%CVOu71&K<3-ZM!o)cP%`AbyEKZtG&UWj((bQhvoNH>08#zj6bQY419m) z?JAYn*Zr^dD4LhvUoR5;?%mZ%(FdMaUA_7C=$*9JYL|@fRGr?Y>ACA#`2L00BlrI> z{2{edQ`Ym=%Ue#9@?KY`*Zmc&{4jIk67JfqQ7R{W9rZl-aTR%fy6R)+d)Z_WL!GaF zgQBU<&)23}zcxHE{;}Z2<4NxMj32@#F#pgx!B`{ugaN3YA)eK;VSSU#fpAB@2dfp> zKZK%4H|$-OIjc=%vI_4Ch3P8stUFbHu2S@$^u>7Yu6JVpZ6*ruRFSNmY;)E)v--^I z`Sz(F_inOTb@P1xqpiL*Yp%t2&)@jY^(V{ypcy5mL1y|-x&xn1Q!y^OV;VCz!G7Xi z-GcQqG;XSe|!%;&a$-sJok0sT=OT(-c`38FTJ;Vp>t96JN{Lw z@%QfVb~W#var;f#=d*kBtG&D%8&u}LnD_Ph zt*iHY+AH(sRnB&r)c5twul9N0SG!L7rv~!4)(O><;l@8rd@pw}{V?6j&~|0Rll9kE zyf{4R{DbC2{oZnWSr0^G4Mkjm{LM>qsiG^BL;zIRRnDK&w_R!5$zv`3CdbOJUfr_c zV(zD%k^6qv)a~ijTD^4gGxxudHy&NxyNxUO&@7MD=d&g~zP2)ZIWT#Z_f9arrhIvA zWY^QQsE1Pxd{x(!-CWLh&y#mXp-bGofYzfs|>$Y!E|CoONLiYUKf%X3`R`}(umRNB0R{QmC z&KVom#kezBT;e~sr~mVrM>Ay)_}Q-(YxoZfuB+Gf26<)b{AK5j^Oh`r^w + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_thin Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_thin, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_bad_valuestan::gm::singleton_argument< T >protected
_constrainedstan::gm::singleton_argument< T >protected
_defaultstan::gm::valued_argumentprotected
_default_valuestan::gm::singleton_argument< T >protected
_descriptionstan::gm::argumentprotected
_good_valuestan::gm::singleton_argument< T >protected
_namestan::gm::argumentprotected
_validitystan::gm::singleton_argument< T >protected
_valuestan::gm::singleton_argument< T >protected
_value_typestan::gm::valued_argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_thin()stan::gm::arg_thininline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::singleton_argument< T >inlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::singleton_argument< T >inlinevirtual
is_valid(int value)stan::gm::arg_thininline
stan::gm::singleton_argument::is_valid(T value)stan::gm::singleton_argument< T >inlineprotectedvirtual
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::singleton_argument< T >inlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::valued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::valued_argumentinlinevirtual
print_valid()stan::gm::singleton_argument< T >inlinevirtual
print_value()stan::gm::singleton_argument< T >inlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::singleton_argument< T >inlinevirtual
set_value(const T &value)stan::gm::singleton_argument< T >inline
singleton_argument()stan::gm::singleton_argument< T >inline
singleton_argument(const std::string name)stan::gm::singleton_argument< T >inline
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
value()stan::gm::singleton_argument< T >inline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__thin.html b/doc/api/html/classstan_1_1gm_1_1arg__thin.html new file mode 100644 index 00000000000..af57c8f838a --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__thin.html @@ -0,0 +1,255 @@ + + + + + +Stan: stan::gm::arg_thin Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_thin Class Reference
+
+
+ +

#include <arg_thin.hpp>

+
+Inheritance diagram for stan::gm::arg_thin:
+
+
+ + +stan::gm::singleton_argument< T > +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_thin ()
 
bool is_valid (int value)
 
- Public Member Functions inherited from stan::gm::singleton_argument< T >
 singleton_argument ()
 
 singleton_argument (const std::string name)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
value ()
 
bool set_value (const T &value)
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
- Public Member Functions inherited from stan::gm::valued_argument
virtual void print (std::ostream *s, const int depth, const char prefix)
 
virtual void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Member Functions inherited from stan::gm::singleton_argument< T >
virtual bool is_valid (T value)
 
- Protected Attributes inherited from stan::gm::singleton_argument< T >
std::string _validity
 
_value
 
_default_value
 
bool _constrained
 
_good_value
 
_bad_value
 
+

Detailed Description

+
+

Definition at line 10 of file arg_thin.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_thin::arg_thin ()
+
+inline
+
+ +

Definition at line 14 of file arg_thin.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
bool stan::gm::arg_thin::is_valid (int value)
+
+inline
+
+ +

Definition at line 26 of file arg_thin.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__thin.png b/doc/api/html/classstan_1_1gm_1_1arg__thin.png new file mode 100644 index 0000000000000000000000000000000000000000..28d11347e4ba1b1c61e5f3fe49f67191e0b7e2f6 GIT binary patch literal 1411 zcmaKsc{G%39LHZuTqSWhWExAoN+Zg?UCJ_JCUKBywOyh##y+8>Qe4SsdJ8whIGWKM zG?YC|4P_?gj-AnPsmryEC6S44{04_75cEkytT zlyF!VZ#Z|u&QaI^M^?mzF*s>@9`Ql1udl=9)a(b+?G_4LeRU3pBX@IH2OcWKd3ziM z;HEFu-|k}y0CK807e}82nYjWnREFAy(a^ysuDd#9J@9>bF37Z(+S^zO*~=@s zMv&doh~cYdpyf)|82E}?0{go1{x_ln$`ppM{-=9O4^GUl)T@@HsaGT8Z|hH^BSQQ{ z?}O?JwT$cwweZc!Y}4i15BI$&eO;GaNo63L%j@t8_9-Y!=Hhv6M+S-^a~*LEp5!=4 z%R#e*(Pbp+Be;qE2@7qt4iMxTS5;`@_Zr~rIxb;*PA5$w3j(qt{R^SE7Gb3aB;EM^ zG@+&$Cfqx~M|Ew$*(ASv%p|WT3UjwB@bK97MAnAKSqPayE*S_P!vM9>yMUp3m8-;I z1&(FJ#z2IX>|^rZrmsrUO}It6hkFiv;lw3_ZI&A36p-y2KgAsT+(~Xx+Zi5kl(V|W zN?N@y;E#N>utQ6_O6__%KgaTnywz*+ZAiHc2PVd?FNmg#FRZ4Jq%mlo^2N1~kN67H zUz@?{bVJN4UgMLWG4p=uR7_ysK0?(@I6A%_L`EBl2lAhWR*$=x1P+Z~zELAQNB7#hBvE*AY5|RI>q}|x)TlJZ-zQ3h+h{ z#WLbfM;0H=(y-7Fgj#`Nyw)#d>!WM1-u$^JN#;t38)R&vBME&TdE?Wdoh^F-oVG1g zh(9O>+f*Y!983#WDLA7RoViQpo#Br_T97rJ7i?bqHgk7T^F6NF`&06P$bS(0Kfntr z!I{pE_ZZir;GM|`97NQj>*6Y&ARwJ46?bUG{2HwzY7`5ho<%NK>mgE0EMVB9-(mNz zF4QcD%C_{~%F%w9kmzaSY-3E?Z@;FL-K|=Zj%3W--5oHw#akLD6_St5&i?LaVQFT* z*t4meV1&qcC^C57x})-x6H;HfO+a=X>Kk`+w0kih{dB6KD7v&NLhuU#gC3|U69p}k zb0(OWew2tYr%Ch(395)kRi#8+y&(G7?$ znhFOwujyXAK56L|aIh%j1fNZL*3OTl)->7V5Wv*1oia@vC3*-etd+0$gIZzrOg~C8 z+%WM}ycj<+Xiv{4wZ_!(vauGA7|2nKY(i?|$=uqc-}=qy#mtj*OK}HTwkzn>x%ezC z`iw7$oELjWU+m2~Evs%=y18Y={P^?A0oIj269;5=#A>f1Vz2P0lBhz%aH;$|y=N;~ u9l5I~?*z2jULECqd)KdL&MN3-HeadDN_x`iF-wPkOaO=Wa4B~RO!*5))u`(L literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1gm_1_1arg__tolerance-members.html b/doc/api/html/classstan_1_1gm_1_1arg__tolerance-members.html new file mode 100644 index 00000000000..266d2d7f99c --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__tolerance-members.html @@ -0,0 +1,147 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_tolerance Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_tolerance, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_bad_valuestan::gm::singleton_argument< T >protected
_constrainedstan::gm::singleton_argument< T >protected
_defaultstan::gm::valued_argumentprotected
_default_valuestan::gm::singleton_argument< T >protected
_descriptionstan::gm::argumentprotected
_good_valuestan::gm::singleton_argument< T >protected
_namestan::gm::argumentprotected
_validitystan::gm::singleton_argument< T >protected
_valuestan::gm::singleton_argument< T >protected
_value_typestan::gm::valued_argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_tolerance(const char *name, const char *desc, const char *def_str, double def)stan::gm::arg_toleranceinline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::singleton_argument< T >inlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::singleton_argument< T >inlinevirtual
is_valid(double value)stan::gm::arg_toleranceinline
stan::gm::singleton_argument::is_valid(T value)stan::gm::singleton_argument< T >inlineprotectedvirtual
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::singleton_argument< T >inlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::valued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::valued_argumentinlinevirtual
print_valid()stan::gm::singleton_argument< T >inlinevirtual
print_value()stan::gm::singleton_argument< T >inlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::singleton_argument< T >inlinevirtual
set_value(const T &value)stan::gm::singleton_argument< T >inline
singleton_argument()stan::gm::singleton_argument< T >inline
singleton_argument(const std::string name)stan::gm::singleton_argument< T >inline
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
value()stan::gm::singleton_argument< T >inline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__tolerance.html b/doc/api/html/classstan_1_1gm_1_1arg__tolerance.html new file mode 100644 index 00000000000..52ef9f95b20 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__tolerance.html @@ -0,0 +1,278 @@ + + + + + +Stan: stan::gm::arg_tolerance Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_tolerance Class Reference
+
+
+ +

#include <arg_tolerance.hpp>

+
+Inheritance diagram for stan::gm::arg_tolerance:
+
+
+ + +stan::gm::singleton_argument< T > +stan::gm::valued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_tolerance (const char *name, const char *desc, const char *def_str, double def)
 
bool is_valid (double value)
 
- Public Member Functions inherited from stan::gm::singleton_argument< T >
 singleton_argument ()
 
 singleton_argument (const std::string name)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
value ()
 
bool set_value (const T &value)
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
- Public Member Functions inherited from stan::gm::valued_argument
virtual void print (std::ostream *s, const int depth, const char prefix)
 
virtual void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Member Functions inherited from stan::gm::singleton_argument< T >
virtual bool is_valid (T value)
 
- Protected Attributes inherited from stan::gm::singleton_argument< T >
std::string _validity
 
_value
 
_default_value
 
bool _constrained
 
_good_value
 
_bad_value
 
+

Detailed Description

+
+

Definition at line 10 of file arg_tolerance.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::gm::arg_tolerance::arg_tolerance (const char * name,
const char * desc,
const char * def_str,
double def 
)
+
+inline
+
+ +

Definition at line 14 of file arg_tolerance.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
bool stan::gm::arg_tolerance::is_valid (double value)
+
+inline
+
+ +

Definition at line 26 of file arg_tolerance.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__tolerance.png b/doc/api/html/classstan_1_1gm_1_1arg__tolerance.png new file mode 100644 index 0000000000000000000000000000000000000000..4f0afac7588d300d43a4ad6b94adc2d3aea875f7 GIT binary patch literal 1490 zcmchXeKga19LKjxYfO z8%5Ok%|nGevvQ;?4@Z7v4b>W2=yz$DxVyhPr~mK$=YGz4eczw&Iq!eI@ALV7vVFYW z*6Ew*V=$O?9_}s_R8=Svy_M)mVj0+?V(fDqaMfzHXge{fW^$ffL%VNCBodu$xjA~( zOQd-FVo=l9f;#~_3`Qr+!{soLjGfB=m|JDN0V8~5{Ym@GY8xY6aPu`gH57`i67TJ` zTYGWq<*H2`ph{C<^vzKy=1PQ_RPp5g1n=YlInj@m$+1ML z-G>(CplRR;h`+R)|FF7t!#r?3;6W{<41^CXbOx6LIn9l?o7#EHU)B(Doq^=%qCmeQ zWppro-efl}S)&gzkop8ro!;?sX}WO93v%5rj!TvwQL|cFA-ym#gKGaF~v zzOyNgUcxlPj|nw(Tj2Pt*xurHLKpqk@jkUo6LTQo5k_(23Ln-3n?6Xp6Y$4|jwf%m zz1|Jx*gkvB_uX^LFOnO&40YCqlkK_GQ)KgmpD}mJm>ssQoi&xV9y%4z8h`*yov<>A~mx_ znwuSQxz|&foli?g$hh6wVh^#{`%S}&C^$hV@h=_TRtQzhTO%pNyfO)tbTG-iCGiG( zatS28&r>~0hX#nTOtBGcMW*q$Zr%nGg`WDk?V;?1rpTWsC=eOe*MwQapR znARSh0)xeq%|Q+EQ*LUyEGNbdI+=l$Spe98|3Hho=PosNO@ZzaTmj)LBb4P{YCv0> zx+>FJLaPw<_hb`?*-y^IKedQ$Q0gw&g|naG!c>tL5DnRBv&179FtyytjaTh>7}NJB zbCBotG8{j?R~Q+AG+`yaO%)ASPjNzCH0re`_eVDtHO$*_u*l|5JCHnv71+Tu0IN`^ zKa-9@HdpfRD#~P3@}aKBkY87=SRb*!EfaI;50a8V^J(;#T)a;et-5vPz3~nq9i4tr z47u9|3FwmQHzk&iF2(7ru9GTCLP$rk^p?U!hxW0TGfKmih;4{J+%c45b i&FNj5U3dE(wAh8k94;=2VS_GUjEAeYOU04UOaB10$K%NW literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1gm_1_1arg__unit__e-members.html b/doc/api/html/classstan_1_1gm_1_1arg__unit__e-members.html new file mode 100644 index 00000000000..74313334925 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__unit__e-members.html @@ -0,0 +1,133 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::arg_unit_e Member List
+
+
+ +

This is the complete list of members for stan::gm::arg_unit_e, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + +
_descriptionstan::gm::argumentprotected
_is_presentstan::gm::unvalued_argumentprotected
_namestan::gm::argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
arg_unit_e()stan::gm::arg_unit_einline
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::argumentinlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_present()stan::gm::unvalued_argumentinline
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::unvalued_argumentinlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::unvalued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::unvalued_argumentinlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::argumentinlinevirtual
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
unvalued_argument()stan::gm::unvalued_argumentinline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__unit__e.html b/doc/api/html/classstan_1_1gm_1_1arg__unit__e.html new file mode 100644 index 00000000000..01b3ea6b0b1 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1arg__unit__e.html @@ -0,0 +1,201 @@ + + + + + +Stan: stan::gm::arg_unit_e Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::arg_unit_e Class Reference
+
+
+ +

#include <arg_unit_e.hpp>

+
+Inheritance diagram for stan::gm::arg_unit_e:
+
+
+ + +stan::gm::unvalued_argument +stan::gm::argument + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 arg_unit_e ()
 
- Public Member Functions inherited from stan::gm::unvalued_argument
 unvalued_argument ()
 
void print (std::ostream *s, const int depth, const char prefix)
 
void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
bool is_present ()
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
virtual void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
- Protected Attributes inherited from stan::gm::unvalued_argument
bool _is_present
 
+

Detailed Description

+
+

Definition at line 10 of file arg_unit_e.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::arg_unit_e::arg_unit_e ()
+
+inline
+
+ +

Definition at line 14 of file arg_unit_e.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1arg__unit__e.png b/doc/api/html/classstan_1_1gm_1_1arg__unit__e.png new file mode 100644 index 0000000000000000000000000000000000000000..7ea7f545255ccb79451c829fe086f61db2f27a24 GIT binary patch literal 996 zcmeAS@N?(olHy`uVBq!ia0vp^>wvg}gBeJAsw;d4QW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;Cdfovn#Eg){!BKA&^EQO9$!z^+M8Twi!i5}*G<&9i8+_V52IXD>@x z8Mo}p`t_xsEREx5UA!*;xnQnIW9}v)Jx}#7FVFp)ZLM~)rt4DDCbw$=n{T{Y&#m%u zO5WYCrKWnNHzH=G^4>mhcZ15@&yI#u&Srgk8B*S7bJg_ZJKHRG>7r$`RdOwE#ae57 zF0YB)Egc(t`gm)C*N^h9g)$GWTW02G`bWs-Mjr@Fc+2zE6KL%0x~uE*OZ_kJbG#nX zrt)@2--IP{?{3_E&3FI1w1TJjoe-W$U!+^ssZ z7(Bb054+f(h?~Z@diJu3A^Mm9yw09mbMDM^v!gaq|I9c4NoDuyGJR_V@so2)uG{8+JN9nz&3kkEWB-*^t*-en zr~P#K(G7d{q40*qNd%+tGT8u&P=JUhHS^k&4Gk8!(BSI@3r z_q*iz3I5X4N)6jfWKE-auJ7W!acS#rhUGPZyQS|oTisc4>sIc)3CV_2&KVpx|M#us z>cy?$GtO-|X3qZg+Bt>-uk*eP?;f=8x}Lw`+x2qwmnmEaK3%@McVFOkt^=axBFqQ! kVTot!@g-9(G5lecXmQKFs%`fLm?arJUHx3vIVCg!0Msq=3;+NC literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1gm_1_1argument-members.html b/doc/api/html/classstan_1_1gm_1_1argument-members.html new file mode 100644 index 00000000000..69bbde7b21b --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1argument-members.html @@ -0,0 +1,129 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::argument Member List
+
+
+ +

This is the complete list of members for stan::gm::argument, including all inherited members.

+ + + + + + + + + + + + + + + + + + +
_descriptionstan::gm::argumentprotected
_namestan::gm::argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::argumentinlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::argumentinlinevirtual
print(std::ostream *s, const int depth, const char prefix)=0stan::gm::argumentpure virtual
print_help(std::ostream *s, const int depth, const bool recurse)=0stan::gm::argumentpure virtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::argumentinlinevirtual
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1argument.html b/doc/api/html/classstan_1_1gm_1_1argument.html new file mode 100644 index 00000000000..c9104c3f62e --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1argument.html @@ -0,0 +1,727 @@ + + + + + +Stan: stan::gm::argument Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::argument Class Referenceabstract
+
+
+ +

#include <argument.hpp>

+
+Inheritance diagram for stan::gm::argument:
+
+
+ + +stan::gm::categorical_argument +stan::gm::unvalued_argument +stan::gm::valued_argument +stan::gm::arg_adapt +stan::gm::arg_bfgs +stan::gm::arg_data +stan::gm::arg_diagnose +stan::gm::arg_hmc +stan::gm::arg_nesterov +stan::gm::arg_newton +stan::gm::arg_nuts +stan::gm::arg_optimize +stan::gm::arg_output +stan::gm::arg_random +stan::gm::arg_rwm +stan::gm::arg_sample +stan::gm::arg_static +stan::gm::arg_test_gradient +stan::gm::arg_dense_e +stan::gm::arg_diag_e +stan::gm::arg_fail +stan::gm::arg_unit_e +stan::gm::list_argument +stan::gm::singleton_argument< T > + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual void print (std::ostream *s, const int depth, const char prefix)=0
 
virtual void print_help (std::ostream *s, const int depth, const bool recurse)=0
 
virtual bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
virtual void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + +

+Static Public Member Functions

static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
+ + + + + + + + + +

+Protected Attributes

std::string _name
 
std::string _description
 
int indent_width
 
int help_width
 
+

Detailed Description

+
+

Definition at line 12 of file argument.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::argument::argument ()
+
+inline
+
+ +

Definition at line 15 of file argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
stan::gm::argument::argument (const std::string name)
+
+inline
+
+ +

Definition at line 19 of file argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
virtual stan::gm::argument::~argument ()
+
+inlinevirtual
+
+ +

Definition at line 24 of file argument.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
virtual argument* stan::gm::argument::arg (const std::string name)
+
+inlinevirtual
+
+ +

Reimplemented in stan::gm::list_argument, and stan::gm::categorical_argument.

+ +

Definition at line 67 of file argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
int stan::gm::argument::compute_indent (const int depth)
+
+inline
+
+ +

Definition at line 71 of file argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
std::string stan::gm::argument::description () const
+
+inline
+
+ +

Definition at line 30 of file argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
virtual void stan::gm::argument::find_arg (std::string name,
std::string prefix,
std::vector< std::string > & valid_paths 
)
+
+inlinevirtual
+
+ +

Reimplemented in stan::gm::categorical_argument, stan::gm::list_argument, and stan::gm::singleton_argument< T >.

+ +

Definition at line 46 of file argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
std::string stan::gm::argument::name () const
+
+inline
+
+ +

Definition at line 26 of file argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
virtual bool stan::gm::argument::parse_args (std::vector< std::string > & args,
std::ostream * out,
std::ostream * err,
bool & help_flag 
)
+
+inlinevirtual
+
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
virtual void stan::gm::argument::print (std::ostream * s,
const int depth,
const char prefix 
)
+
+pure virtual
+
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
virtual void stan::gm::argument::print_help (std::ostream * s,
const int depth,
const bool recurse 
)
+
+pure virtual
+
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
virtual void stan::gm::argument::probe_args (argumentbase_arg,
std::stringstream & s 
)
+
+inlinevirtual
+
+ +

Reimplemented in stan::gm::categorical_argument, stan::gm::list_argument, and stan::gm::singleton_argument< T >.

+ +

Definition at line 44 of file argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
static void stan::gm::argument::split_arg (const std::string & arg,
std::string & name,
std::string & value 
)
+
+inlinestatic
+
+ +

Definition at line 54 of file argument.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
std::string stan::gm::argument::_description
+
+protected
+
+ +

Definition at line 77 of file argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
std::string stan::gm::argument::_name
+
+protected
+
+ +

Definition at line 76 of file argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
int stan::gm::argument::help_width
+
+protected
+
+ +

Definition at line 80 of file argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
int stan::gm::argument::indent_width
+
+protected
+
+ +

Definition at line 79 of file argument.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1argument.png b/doc/api/html/classstan_1_1gm_1_1argument.png new file mode 100644 index 0000000000000000000000000000000000000000..a30a0bfeab6bf87d410cb2bafacff74a98e89d3a GIT binary patch literal 13313 zcmeHO30RX?y0)#jSL(Qc3S>G4!JYT9$yQK|_)%r4%V(WH*qAfP^K4B@jpmx##==m)1_FGjs2qd!O<=JPGIj|MQ>a z``+*U-tTaFmy^T0bC%7SHf`FwxKHi&Oq(`cK5g1N7iPT!S`Loj2f>H_uAQH4(`Yo{ ztE6{0B;mo=;2ZM$-FM&VoNh*eKW7E+aoRf#+ysB>9)7ld+O!Y9#@TK8jPjPWMY!iL zIQm0%HsHi9_m#fcq-H0Iu7EujKMnr`}4{IK0 zr?6H~cyIBpOy1GZL2272aKaF7_jTWy%btrZo+lO{BQXrvQ?TiFkF=*iV(3C!#?7uo zhBj*0v*#%BiMK%b^oM9ki%56s_MYxRKe+|LUKUw;vZAcga`YrJufBbWXYe`mOR3>c z)SNjD6DQtHPH1~rLa-XAaE|cXKZxmnH_m9$qD9REmU{+<(>2wE6JY4{N2IJT*y7G` z8ux7;OFLGY&Ek|wS2x&_t8ICX+lDL&c>`RZwYT4}kWYLHn|8hp)_2atOgFHyrWZa( z9{Es6bVF8ppZ3r20FP|AVhM57pffO7Fb# zI}&~Q>Bf+c*G4(bv44cSKey*^p3~D7#a>Q~(yM>#{;bWb^tYJkU~=AxS`fSk-sG`w z=JXYktMI1c{Q0xsGvFqQm*IQx8E{kogUx@2&w!hrp7?imoL_Zwbp?TqKYwtn$McJd zo2%(~6CLcW)fIycA$#(x80fthCQOaX7j3?QUb-bS8I8$tScL=QGcKRCjEfHQve}MX zALaA`Xp$J0&+Xa0odHG*n(Q$+k9`Sy7-0OMX?(9hh%VpE6e(MuVJ5E7M@`jF@jHVC ziZ}w6ruvaYJ>sThR|SCn2`W);oRRfa!SMwfsQnLY=N%dvF+c3&Op=vP2*;lFJ#6iI zR;R{va-1-|u3SxMk<5RXiyuj0PJCa-_JpPGfQg@kNJQ?K>OdpOGh(uvyoq3u>Mk-3vzFT>} zh-V-wUBcg(X)hyJHxQN!uzK8@p^mJF9ahvKBA)is_>}-X+Z^6lo8=D6@{TqlMkAHv zE^R35ida`nxU@TyP4jd%6z~^wOR|1wEqwOO``KAZ8nIE`e^6c(kmoTPd;m2f-F?6^ zFT0?Zl^RVhj_~C(tHEg3vvQF=p7d6#Wn*WMz$Hf9Nl-pVv#*7hsog(PKYlG3VieI>NK*!JXL1 zbBy-9;dee|U~-y^fiYl5JHAvO=Ge>RtzV;cDTjxJWmSD<LhQ51~HVrp;VmO7o2NzV0(d{i0ZlvM{A5hOR z{yIJFGhlRr9SpsC&>Qd<&=lvvD9#7ZE!|?0gkEt-&S*a|42*i#8;sf~P6Qmn0C9!H zznxxFaTDMPFL167Chr%H7!t@%d#{-H3mbDyYA?r{HNl;e;dI3zK(mF z-Z^mo;Kk|IyG?GduDCg8>T^8O8MTYC(@P2Vbnoxo)1LzsJ|d9O?i$%RAf#tFbYUDN z4bd&QTw1tz3A0|~X`Uc@BH2j&2n!zDpP8t{$!Xr^z=Euag{u5bHe7BbjKiwxj0)YW zilnk+MK#-XKE|VuQp`Z>cJEeNEmW?(R6-~+6j;uv$K|Hi4kQZ~4j!dNtIdgokfLSW z7_#~qz6I@?&?cOiATnLk&wIr658e?PCbl27*-rQUgzRwaXic4IV*8G?TIZD^Aq~SR z^mY89^9>8eMXmmFCz-6vk)tMP{_=$-sn>5cs_KVfqh#i8+~B+5aj#GGN{S2}GiNHs zOL6!KWvc=H9#<`zp4fgYPBc(yL(g%K$cUg`oo^=FCZi@~i$QDW$Mp{u7*v&ls&n(K5gu^}9*a?2-trjBNSssT| zC(Xv=RckNHVzU#K zl;Q?YWuc5I84f1H!iDz?D$}H-JD)OG!F#Y5Ys>Uxm9mi$-Gw_Dn2ppjONxdk71vY> zQ^+CnLs=w7O4-ql)->C3im3NUM^W|BvKr>6jObxgb=vH-CGG|}Z4W9I;5Fyb^jf$L zV^4;CYs$u2nrSxo9enFRxN6|htoZu|S{fl3SdLRZ!3{11=waV3MGs?oo)x9r|`KqBj5tI>FK?=$_jcIgfy$ z62{_Y8<#tScsQ7J``BpZ*lQp)&(rT!APS4z0m2{aMR=_M9Obomn=RbPdKK2%OQk86 z0rK+)_dlQJT#ExpmGk!0CtX}PbGnYW?thF%{5~)LPar=3mJ$2v9@>BY;Gg>K(rQ7} z_~6B-!Y1-#-1-w;fB@~h0tpbbjej;gfnbbdFvG<@Lp5p;;o2W!;v_|NEa`}|qkk!9 zr1kvJT)xHeo;ZtW7W(dEiSgZtaiW~Ya|71nO0xtnHUmgDc9L(z#Y&qcc-q=ttU){= zR1F=`-wUf@LQzr8C~@QPd;DYdmK&NkkNt>aU^Y#9s?NE=t+G1$ap&5v9o)1 z>WpLRB?MW)O$zYEm@@G)L0StyE1N2Ts&AeX+nsp^J03igC!Qx8!9-BTZW0^9)66$e zElCes139BR$K-Z~F1CxfJznVYt;@K+v642Ts$m(|D)GR^*m9 zCOS7&lA;OB#awA9Cov zXV8l}irWj9Ml9x9F+J(0L|qRGGiEy9T1j=4wWax`V;K{{8RnwClxkLjMh{)SBAs^b z>1p1^8)8F2^r{w*3DI}yHmfMt+pgAEJ{2ujzfUJ@lc}#e28|Vsjd-20EDw<9#n-Aj zzke?EQ^>mGTKM@mb5vPUG<&4Kt*g?uH}q(0_d-*g(PN1^cR^YMv%c9K^f_@>lACfr z0@m_3xV}dya7zE4=1}?>seZ4#$Ie;;a14flFdjFKsy;L;QPi~~9t1CWN`1BWgpKBk7 z#Of^q^EftdU&vR`EY721C3-XJBsLRBrxvi&83OQnm^&=}4%lk>+yMC`LE~Km?{}@A zyc!lpssxwXPXNr+W)m%WVPLSu`JfLZ*@zKZlIkS@_I`RR{hLI<8usg~ytBGu{p?Xy zdgQswPdS@cnVRm)b(jsZ6_9HC+iZuK)|@#mJ-cB>wQE=YfrLN7^eQT z>N8;;22#S?M#eDT($UEtHify^|KqM~RHg{com#~?-SkZ$t2@yJ_IfW6EgS<7s`0gQU=tadxLzz~`MP!8;suK#zLw{Q&cQBn8I6bpbqGx-~HD*ZCq zsCwcP$(D^&5JjIY&LDFENzuWs|9cDPd+LRlxqAFG(jocNCrXLBFF$YlCA1i5 zGI1g2Mwsew5+NZiv*e+32DzZl%a0M^0G0x!9?7p#0qvoGg-{x*+G&>Xcub=#s}ig% z&lL_gq^vAwTia0KCA)x3h2F{GD-7IVk-ctr1aSCzgKOE|L7fJHJZlHeVpM&?5*tbe zlV+`coDX!C(KTBQuBq2GGS9QKTKL(=Z_~XJ-EHH|bUWMo+e&>pbvhjrA(EoUB$m-3 z5gkR&$jUtg*)~?G+>m2~0gDVhSv(Y7C)rYY>|Cfx`_SH?eFd8$jLT)vFT*F8UO?Db zXn2jKTgJMR2Yl`JL^5nTW_S%9cJB?__$|ovX;;CGAbRZrdH&!E@CuMx9q$J3MFH{x z5-X!x4f)(_6hvp3ZeVOWn)ipR{bN{CZMz+)E{T6L>Aniq(dEl1B_STL1}`OWvPFN# z$$oWrmOV2C=?%F!a5#noz%!_t#4qQsF9wE)iuGWOUk5u)98Z#{gT%Are&cjNh7K4rof#{&w_UCQ|LALlPGmKCT%k4jr- z1M@l3u`%Is>*3<$Zpvj4nD!3R&QyW$&vJS+HqrAg(ZgECKofukrlR;ZH+93^3ELSC z;4v18JERe^*C==0(4F~A>6zLZG&ahJH5>xv3O8tPt^xthPia5mGN# zwB+#(HSI@}(PN)vCbvHuVB3dwrUMzUzLCfl`cg+t(=@*H-sypi=6i(`3F0a~y8NAV zBW*;N*~?_Hz249jz^V@IjxwS4n&J(=wlX=S*smFz{Uo=DJ)yo6F6F4V;s$*SQP)WJ zGE7`AQO;Y+11nXUN&aY>N+T1ehiX7Xo;U$Q^hbHt2B%6A^io=KHt~-{45*!X8trV| zttaY#w4FXMxkTFlelW+B8WqMRLh%$`ej99pk)rLaarp1e$K*oPeUaRBu32>7Xn0A2&+ zjmr=zrhpmd98-?#4`%-Y$-xVz0J~cg^Q!6*rNm}HbyUY0VC^qd>R+m#QU8o&`oHjy zuLB9PbtoQ3WjSDQ*B^oD-Cqkd+;u2u6e~p6z^GQfomO-g^o_DGQ zI94akF9lwh0e5Kf!YN6hX!~uT4TJ>-u!omD z^;g)*zRvQ#I)6dMO1%W{M$y(#7`7I0Ys|8SlM8k-%AmTvHg-z}*}Nt&OSF}8FDOKK zP1WP7g9zhSV&CH)c9K$6)Ya7JBsi{Gb8XPc&LA)SrYwVv3(AI*q1P=*KjbLSdppF0 znu5t>yA9yvE+>#ayg(mY3rGCIp-BHh{gf%U_x87;GT4NRXfX&PU|~+40wLvjkAH5@ z0mk@lWL@-ashrfv^jjroDqGEPG^9pR0vj(Gmz&UThrj{F`i_I8(I7R4-&oR2V6_`z zp+WzLnoKqzZ!>{ruYbP~zUvS3d)@rnu4S@u41Qau8>|nljRo#s4@*j(`mAN#O1C77 ztSq*@^yds}PV>M+6+1guO!{d2V%f1qWMe%xP@_`~Geb}9v$#tE#UdjfEEdH`@TB4B z<>mmPSz04(h!fq#vNzt#Z5R$rCN?lhMX{o2W8C01#4`pm1QpNEWw2Rg8RUIqIJro# zd4kpx*|g~w=DX>IA0K-kecbk)%1@O%PpP)|FV1)1#Z{fvlbvfFvkKL+M41t=*-2K&ld z0*aFZD`Ibk1qxNGw*cc@K?#LrpvzDFkV4s14e$RhI>J4jbA6;2rc_7`&Awj_{1|W$ z;F9(rvIJng z8P(cNag7&Uaq6@;JQhMjY&82)nv44kdE|Y+rm~jA_V*D`ZUb?d%3J-Ut0TJ}-xAst z8fkGiGNRE2(iOOi9-F95sZWMShWE+mn_*9j{IcOZCzc`<9#n&T_uoTt9T{%y9$miS z1blHnrt!hTNE527BWEGEGFc$Z9o6Rwx52mV>`TfdAF8(vBsp{Fu8W(ea&f95t+=xF z{jWL+VgjrvdLF zAngDY^4Q-%CcD7e3QPe^VgnrSzf#itUx?3I3w%>$JUkTo-O9HRzoUZKJO|nQm*L|# z?DL1yqLnzBP}d?50nC?%d-9a%c`mH3yWJQOSLu;m=R51M`skaAi|Mup`-;k1%St-X zV|fVPt@}hif0LEHbl(lfAgx7Cp=O8@(Bo@}!O!~>C=eb5C3Z2ZVO2zO1*Tqel>!GF z``51|2aowT2phZwRyh%9YBaE6Kt*Bf3+1%f)_g0$TSyB4#b{RUm7B9xmLJz%)Q0g( zp;KXe9Ro$$fpBOL1Quifd*to@nLVZ=_SmWnS&-Pi8(AsuQ^1vdd3p8s@{G$-TK{Uz zWLGqG;;eES4FGf^RrR&8pb>G8%mzEzd%QL^5I_+ZC;;W2YB@ztyd?h^;5;$X42(Hn zd+CG;^&=|V@m`$hd4)vk(riac9Pb)<{~U0k!LkES21=)RJ)?&4i)VQ{UU3_Xea%1Zv@$+d<1dR@^i5EfrMbc{-! zTl4A>jc8CAZEzJSn(+6+-p3hD?y2>gnCG#FAW4#ibIA;AgqwK*7U5K#yp40ZG4Q5S zE61H?LSe|{f1_i)rb>`-HC*^rMO#%P2?dpU3$ z#2B{@m!FY+ZeHG@O&DVhxcEX_S^Z?@4u>~t2^%XJ?F*SKtv#*{hW4oS(!amPFLTX5 z?D4mJcVG}6DIyFVZ(05`f(m%!^EEga(=Y!brgut9?8|hr^!N?mX+i0Mz{*Z?A!F?{U}hf zX`n(h)uHTBPGqtO%1s{>O$ox%&Eu4%+@3g*Ua!Yt=)XQJ1B7XwP}-NkY8%2QzIlyl zR=j9Lm?n9WX`X~klZ9OS4fgcXX#ZfEzm*9gOw;322tTigNDw?p_l2qHqCvJMlvl(F zqP$R9H>H<3&Ua-2PB&A_%K)d7JT7pGK6NlLrfl6|nT{39dX4(Ma)pE|K93e_4RXe5 zQP4K`xqI5HvJ|) z4o+fg)9#g^OcSA^`A5M~tOO(x*Pl$p zla&6Yip|NeMh!_%i9IPfyE-vMTOcz;?0N3VI8mMtZtyhA6%z7(XMM;&>Dq4oQI<3y z*H)x~lw#lC3uqD`p*66(H=kGjZL5G$>dmLce;@t(x4lW)gfQjl2vhC?`t7QJL>79f ztm~s;>a(V^QbaqzJ%()fXeXef+1hRz57SV+lR*ZT@N+)NKeG6f? z&)G5Rb#VXr zO&OzH<>kd$400X=usC%C4?8n_mA93=x)4JV6^6Z!2|@DT*T68mwy-6L!3p!fe@tiyn%xIp>i&jtZ%f0#N zl;yw}!#n(?fkxQoOXx|t#`TPcMV1ja(q;*_sPIj`1JxzF{_ym})z3Y}QIlKd6#e + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::argument_parser Member List
+
+
+ +

This is the complete list of members for stan::gm::argument_parser, including all inherited members.

+ + + + + + + + + + + +
_argumentsstan::gm::argument_parserprotected
_help_flagstan::gm::argument_parserprotected
_method_flagstan::gm::argument_parserprotected
arg(std::string name)stan::gm::argument_parserinline
argument_parser(std::vector< argument * > &valid_args)stan::gm::argument_parserinline
help_printed()stan::gm::argument_parserinline
parse_args(int argc, const char *argv[], std::ostream *out=0, std::ostream *err=0)stan::gm::argument_parserinline
print(std::ostream *s, const char prefix= '\0')stan::gm::argument_parserinline
print_help(std::ostream *s, bool recurse)stan::gm::argument_parserinline
print_usage(std::ostream *s, const char *executable)stan::gm::argument_parserinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1argument__parser.html b/doc/api/html/classstan_1_1gm_1_1argument__parser.html new file mode 100644 index 00000000000..8fa21960614 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1argument__parser.html @@ -0,0 +1,450 @@ + + + + + +Stan: stan::gm::argument_parser Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::argument_parser Class Reference
+
+
+ +

#include <argument_parser.hpp>

+ + + + + + + + + + + + + + + + +

+Public Member Functions

 argument_parser (std::vector< argument * > &valid_args)
 
int parse_args (int argc, const char *argv[], std::ostream *out=0, std::ostream *err=0)
 
void print (std::ostream *s, const char prefix= '\0')
 
void print_help (std::ostream *s, bool recurse)
 
void print_usage (std::ostream *s, const char *executable)
 
argumentarg (std::string name)
 
bool help_printed ()
 
+ + + + + + + +

+Protected Attributes

std::vector< argument * > & _arguments
 
bool _help_flag
 
bool _method_flag
 
+

Detailed Description

+
+

Definition at line 17 of file argument_parser.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::gm::argument_parser::argument_parser (std::vector< argument * > & valid_args)
+
+inline
+
+ +

Definition at line 21 of file argument_parser.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
argument* stan::gm::argument_parser::arg (std::string name)
+
+inline
+
+ +

Definition at line 208 of file argument_parser.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
bool stan::gm::argument_parser::help_printed ()
+
+inline
+
+ +

Definition at line 216 of file argument_parser.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
int stan::gm::argument_parser::parse_args (int argc,
const char * argv[],
std::ostream * out = 0,
std::ostream * err = 0 
)
+
+inline
+
+ +

Definition at line 29 of file argument_parser.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::gm::argument_parser::print (std::ostream * s,
const char prefix = '\0' 
)
+
+inline
+
+ +

Definition at line 139 of file argument_parser.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::gm::argument_parser::print_help (std::ostream * s,
bool recurse 
)
+
+inline
+
+ +

Definition at line 149 of file argument_parser.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::gm::argument_parser::print_usage (std::ostream * s,
const char * executable 
)
+
+inline
+
+ +

Definition at line 158 of file argument_parser.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
std::vector<argument*>& stan::gm::argument_parser::_arguments
+
+protected
+
+ +

Definition at line 222 of file argument_parser.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
bool stan::gm::argument_parser::_help_flag
+
+protected
+
+ +

Definition at line 228 of file argument_parser.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
bool stan::gm::argument_parser::_method_flag
+
+protected
+
+ +

Definition at line 229 of file argument_parser.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1argument__probe-members.html b/doc/api/html/classstan_1_1gm_1_1argument__probe-members.html new file mode 100644 index 00000000000..bfd72e9bc00 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1argument__probe-members.html @@ -0,0 +1,115 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::argument_probe Member List
+
+
+ +

This is the complete list of members for stan::gm::argument_probe, including all inherited members.

+ + + + +
_argumentsstan::gm::argument_probeprotected
argument_probe(std::vector< argument * > &valid_args)stan::gm::argument_probeinline
probe_args(std::stringstream &s)stan::gm::argument_probeinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1argument__probe.html b/doc/api/html/classstan_1_1gm_1_1argument__probe.html new file mode 100644 index 00000000000..76688e9990c --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1argument__probe.html @@ -0,0 +1,211 @@ + + + + + +Stan: stan::gm::argument_probe Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::argument_probe Class Reference
+
+
+ +

#include <argument_probe.hpp>

+ + + + + + +

+Public Member Functions

 argument_probe (std::vector< argument * > &valid_args)
 
void probe_args (std::stringstream &s)
 
+ + + +

+Protected Attributes

std::vector< argument * > & _arguments
 
+

Detailed Description

+
+

Definition at line 14 of file argument_probe.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::gm::argument_probe::argument_probe (std::vector< argument * > & valid_args)
+
+inline
+
+ +

Definition at line 18 of file argument_probe.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::argument_probe::probe_args (std::stringstream & s)
+
+inline
+
+ +

Definition at line 21 of file argument_probe.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
std::vector<argument*>& stan::gm::argument_probe::_arguments
+
+protected
+
+ +

Definition at line 31 of file argument_probe.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1categorical__argument-members.html b/doc/api/html/classstan_1_1gm_1_1categorical__argument-members.html new file mode 100644 index 00000000000..c16a36e5676 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1categorical__argument-members.html @@ -0,0 +1,132 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::categorical_argument Member List
+
+
+ +

This is the complete list of members for stan::gm::categorical_argument, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + +
_descriptionstan::gm::argumentprotected
_namestan::gm::argumentprotected
_subargumentsstan::gm::categorical_argumentprotected
arg(const std::string name)stan::gm::categorical_argumentinlinevirtual
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::categorical_argumentinlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::categorical_argumentinlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::categorical_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse)stan::gm::categorical_argumentinlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::categorical_argumentinlinevirtual
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
subarguments()stan::gm::categorical_argumentinline
~argument()stan::gm::argumentinlinevirtual
~categorical_argument()stan::gm::categorical_argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1categorical__argument.html b/doc/api/html/classstan_1_1gm_1_1categorical__argument.html new file mode 100644 index 00000000000..9bcb3e2f79e --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1categorical__argument.html @@ -0,0 +1,521 @@ + + + + + +Stan: stan::gm::categorical_argument Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::categorical_argument Class Reference
+
+
+ +

#include <categorical_argument.hpp>

+
+Inheritance diagram for stan::gm::categorical_argument:
+
+
+ + +stan::gm::argument +stan::gm::arg_adapt +stan::gm::arg_bfgs +stan::gm::arg_data +stan::gm::arg_diagnose +stan::gm::arg_hmc +stan::gm::arg_nesterov +stan::gm::arg_newton +stan::gm::arg_nuts +stan::gm::arg_optimize +stan::gm::arg_output +stan::gm::arg_random +stan::gm::arg_rwm +stan::gm::arg_sample +stan::gm::arg_static +stan::gm::arg_test_gradient + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

virtual ~categorical_argument ()
 
void print (std::ostream *s, const int depth, const char prefix)
 
void print_help (std::ostream *s, const int depth, const bool recurse)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
std::vector< argument * > & subarguments ()
 
argumentarg (const std::string name)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
int compute_indent (const int depth)
 
+ + + + + + + + + + + + +

+Protected Attributes

std::vector< argument * > _subarguments
 
- Protected Attributes inherited from stan::gm::argument
std::string _name
 
std::string _description
 
int indent_width
 
int help_width
 
+ + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
+

Detailed Description

+
+

Definition at line 11 of file categorical_argument.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
virtual stan::gm::categorical_argument::~categorical_argument ()
+
+inlinevirtual
+
+ +

Definition at line 15 of file categorical_argument.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
argument* stan::gm::categorical_argument::arg (const std::string name)
+
+inlinevirtual
+
+ +

Reimplemented from stan::gm::argument.

+ +

Definition at line 143 of file categorical_argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::categorical_argument::find_arg (std::string name,
std::string prefix,
std::vector< std::string > & valid_paths 
)
+
+inlinevirtual
+
+ +

Reimplemented from stan::gm::argument.

+ +

Definition at line 126 of file categorical_argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::gm::categorical_argument::parse_args (std::vector< std::string > & args,
std::ostream * out,
std::ostream * err,
bool & help_flag 
)
+
+inlinevirtual
+
+ +

Reimplemented from stan::gm::argument.

+ +

Definition at line 68 of file categorical_argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::categorical_argument::print (std::ostream * s,
const int depth,
const char prefix 
)
+
+inlinevirtual
+
+ +

Implements stan::gm::argument.

+ +

Definition at line 24 of file categorical_argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::categorical_argument::print_help (std::ostream * s,
const int depth,
const bool recurse 
)
+
+inlinevirtual
+
+ +

Implements stan::gm::argument.

+ +

Definition at line 35 of file categorical_argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
virtual void stan::gm::categorical_argument::probe_args (argumentbase_arg,
std::stringstream & s 
)
+
+inlinevirtual
+
+ +

Reimplemented from stan::gm::argument.

+ +

Definition at line 119 of file categorical_argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
std::vector<argument*>& stan::gm::categorical_argument::subarguments ()
+
+inline
+
+ +

Definition at line 139 of file categorical_argument.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
std::vector<argument*> stan::gm::categorical_argument::_subarguments
+
+protected
+
+ +

Definition at line 153 of file categorical_argument.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1categorical__argument.png b/doc/api/html/classstan_1_1gm_1_1categorical__argument.png new file mode 100644 index 0000000000000000000000000000000000000000..7214143dcc044f09e2fafc22ca1a7f14ddfd9f05 GIT binary patch literal 6971 zcmdU!X;f49+QoxtQx!}rDk?(kvahX0MW_-aK(r3%m9a8e3=t{fKoh2fDI|zh1O)26 zR}mq^T5B{B0)os*7!)jHZH!^c1Z4_=1VhL`hWEswRo->m57!T`ti|F$SSyF~{GYvl zdz0bgV3eM)jl46`wRvHa5*MXU~`*( z0IptqHZ(LW${2tG-+mbPwbx+~@Jq%IPMeb`k2q9U*PiN<8Og8vUE6pG?C! zc?#83W1x9k*f zIy!oV{o6?AWV$_THOL3x37mxPD5%=J)eXssT z1xz-_lp^d?7nbrCuQ#b@2~D5IIq!qsxCLCyghNwOGt(eG0b?eaOWbz(HiAF@LIv8l z2zuj=&~(L0eCkc$ML*ep_hJL7wq(N1A=O)Y*zob&@1Ri13?fvVvN+JvptD?LXvLTl zTs0gTdX6}c(84VZ&zD^fyH#^> zb9RaMC8^Dmsz5t}A?Apj^($eud_NIF)E(?FFk7m2!ija`bz`R$VngVIigUx!x*ALK7AUEsz zis>q^y70tPi<^O-k(d#GM|~D}Ycdw+oJ^3bE=(7*#p9I3!Yu)?um}ed|6nWr5(bHP zAz~z;fvFmzr2ABe++Zq0NG=oiet8ZwHQOVWAC9ZfB0f*fi5;b10il%xVklGY69yI< z=FLE7t}U6U^)_2?5*feX07z=50_`AqJpq5d3AjkbA&bU`O>4LlZ(}8d|jcpoTg8_~`ed^H91tH8!U8s>PLEweFN4;`L z^SFFM(-sv|GnBATL2z$^2DuNIu)7`stL2uOI9w4Iz>wG@&&2!jCXcD)9zl;w>;se7 z;HVuweXgs>XT_%0XvxtF56`KZ+qP(Nxg!+AV*PlWGlSU*t)A@ZZIwR7PAK|OeoE(= z4wMMio$9IWz^7J@wsfr-pZl?IKr%5ZiJOhl+&^xQ+b>PzsZa6n`>8Pa3Z|Gb+ldQs zNooh9kn3ozcg57uN6LR;6F#JsEMbZvwVN~@OE|56v2S^bjri1s+ui@m<@pZ}f8Kd` zV`2H<3zR8_%O>^r;zcyVvA5L#>!I~h2ArZ0^yfJ$*rT4`McFd5<1s!6W$ z&Cz_%>N#00dkSrQA_G7BIKH7GHu_RS9^_ca&MioxpywZo%gZhbIc=38EPUA7nkqJ2{bWPSoP&8h-@TNS4FLSTi^X;{#hC;Rf<4KUfs~1WZ|}J!SxOAT;={| zP?#p^9MkX^6!NT2=8q`-(|wG0=e&_X(ZD-{U0J7O{)QigG`ApS_*1}xj=w2^q8arA zB&!E=lnU5N^ZZq*sNuH$i}o`W61Pjc=42=5bH|IuMLF45oJLP7kM1e_?8TbERawPF z*Wq?82$C0ts~j+`vWCy8NVRB&TbMhRPRnOCVTw!&RQc+L!32V&u$Kv?+E&l*gm?dQ zoV}WfjC8cS2J=t3)hwd%&yc4wf`b)aji@p{#X10w2p}ijr=nMAaT_Ny^cNCk{_j!J^QOlIh<(dh@8B0+L(|LFIlQ5pjVsisn6~Qup zvRGN^3?e8~XkKZw*2zLgt1-BOd8Lpjuh4BNDfp*>*v?i>(rg zrW`A4U6;VxJlS>@=EK_>=KdxQy(jA;)lE18z!us_T+W(XK5;wGjwR1i4=S&S!lP%k z%~2Yyvj{c2nwx9u4;??LGG$-fajdV#X}@skSbfYlwGHGhj|sBojMIAk=8D-`{Cf74 zk?-0oxd`}$Wjk>#R*Ch|@zd#7$muVJBCP?V;kempI2JjjMdhn)wIgdvGgyUcD_~Km zu(cZ>ubH0vq*qmJ)UNSp=aOngoN0Ic5c-&rkDj-y%iSa%$s>0j@3J$v`mNk&0R&r)m~)OXJgZC!-vWh z!{*KOUR}_#R77b`wdrkAR@g!&9wcu&HNJqw6Sr7hrTAgu%(T6s#rFdu1-KM&)qVCe zQtcNiHqV)#mj#z^)t5eBrVnq_jNWFXH)c(HQ`qB*Nw+9&`EdyAFc-;FPZZMyL6;yh zO;O>WqnRixzpifgKGUt=1t9gZAzk(QGq0^h(dvL--}%f!qY4Gcgo3;U4!GmSdotah zQBsRuCuk;8SzM7+oALw&gD_8H-!{=dkoy0p#cu{IKHQa&Eb}K)gfuiKSAN32IA)aQ$Ya2`M)n%+z$k;Z0{m1Pnr7B~oZu01qYnTuT++oH+h@>r+1c&h zBPYJT%OBsSqAL5Ul6D&33-$gb1}9a#x_1=(qXJ?j^EaR8-E}F8@@}V074r zfWsEZOqTz;?rr6NM_J}Cb|=Y#AW-VuKakz$pZ~uZ(;mo}f+@Ajegn+Eh;*DFaY^0xdE!m-sbv>0?H^txk;4 zrgnJzP|j8Ec|hXQUZb$C%#7Rby&p??;qfTxFBGacJB@Xm;SIm1A}oMFLOEp1_toP~ zMS#cixVPI=$aB_!eR2d->yh1nB8a-kVEOFPhJVll}ht4HeMuF zFc7b^mz_mC-keeqY_mc3C<=gJ(*MAeLG_76`|33AjpQxQ94tF%>hCC?6AB!9U9i-b zH|7);QGdA=jsvRZ(A|yw2+v8Lgd>X+PL|x^Z&J;f4#xZh zgFF!$+DI(K`pSTXhN_mF)4Sg*`Eml}tE#SVrcAIL&mnG6QR63=2WrQMmyT(}nW~iV zgd>HnhHZsztjfTxb9mG@Bp=@RE|uxTMfgj5ZwGIq7hdhUmFGH=($4@olT~_`k5=8c z?byM?Bkb&s4$-~uOvP1{eaU}3lv108xTp2ezQ`vKL{wGblqgh+O7uD~cILAZ zY_<#TPQ}%i#g3>6cS@%E03IeW3YqtU%x`xco1%XR80xFy={>RgCcy5W$?L!7Sw-aqc%GE~*va;IoS-`z0&H%hW#^J|Ngn)W?a`pYd{ z;oDp;BJR~^2qI@#4`0TUUth(bi?fkzDP&+7x~F~3IE^)V{#!b(AIkLX!|?tB`;d?_bbM}6<|N!VaKRbh0! zW>Gv!1~8YxzHpv@sQ0XcttqL*9A*fB%ue<_^)j?vLNZFNAE(%n2S9G28<&z&0pK)3GtE4~tRXgLZYjgP*zKH}kY4wA5T za*GSF5=Ay;jfRhn%sX8q@@F7rf%lZBT0cQ(DH`uZEYiW`o2*b9JVy-FuCGr&piW|p zPzkiN$3b=zo+{AdlR59MeEbW;exvYYEH(o71^~FFO@X?Gd3P72B8jt-2jdr_6fht% z1}o4124wTS^RhX%ruR5SgdDm$dbNOtj$ffQIeC1oTh=hpWqod}iF;!iY*h&@p30xt zr7C~iH`?TcJOz{{u1B1aHjRM{^v>lr51|2QVRsmXJ#4RAfmo^$7qn_ZaO0JiAKYnJ;j0biny>%`LvYwix9=GvT>KP|EYzc`F0MB6`MSHoF&y zL(+k_;4+`_Gu_iYWgK-6)S@|4er{&O(;Cki?T1=G%>F5)5j@^2uh?buitDgB%~UT5 z04w=gJSW0=6_DAJfy^HABD3@Q`Ash~dvdunPhQl%#a|ltx%Mpfq4l=Oqw6-vhE1;p zdL811ohUm}9)hj*DZUIK3u08klvZD zM$C;ZH!eosYPPw&#k@YPy90bODMnKGF$+pH@7KKYiRuTv)q+8}FN0eq^Oru5&OQzD zWdzE&ru(sVK(9EY$nOtU>~BO}y6pM{+lGL|ZIS8%X?!ygz z&jH}|G3LXs68I-}e7$v|MY$O!P;pMjYD2YZ?-V2X{@_>VZ>5^B?d(&u#wh}@Zu*&? z8to*)Xdq{aH3``8kbdoLwQINv2#YhCN@#U(mB2VJ?m%}x;@%mlcDBCOB_s;2&Nu+2KJ->{tH=)SEL|=2dPTh+KLSJ=@9` zX)|YA6in&E9nj)#(n_oX3dz^3;w7rhNWOyV9p3>b2G7*2>@Ggc5SId7OYPg`->Yh} chq!n;>d3*orgq>zU7&;ey!MuSbu8_F0V)vWd;kCd literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1gm_1_1function__signatures-members.html b/doc/api/html/classstan_1_1gm_1_1function__signatures-members.html new file mode 100644 index 00000000000..1e003c7ae41 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1function__signatures-members.html @@ -0,0 +1,130 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::function_signatures Member List
+
+
+ +

This is the complete list of members for stan::gm::function_signatures, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
add(const std::string &name, const expr_type &result_type, const std::vector< expr_type > &arg_types)stan::gm::function_signatures
add(const std::string &name, const expr_type &result_type)stan::gm::function_signatures
add(const std::string &name, const expr_type &result_type, const expr_type &arg_type)stan::gm::function_signatures
add(const std::string &name, const expr_type &result_type, const expr_type &arg_type1, const expr_type &arg_type2)stan::gm::function_signatures
add(const std::string &name, const expr_type &result_type, const expr_type &arg_type1, const expr_type &arg_type2, const expr_type &arg_type3)stan::gm::function_signatures
add(const std::string &name, const expr_type &result_type, const expr_type &arg_type1, const expr_type &arg_type2, const expr_type &arg_type3, const expr_type &arg_type4)stan::gm::function_signatures
add(const std::string &name, const expr_type &result_type, const expr_type &arg_type1, const expr_type &arg_type2, const expr_type &arg_type3, const expr_type &arg_type4, const expr_type &arg_type5)stan::gm::function_signatures
add(const std::string &name, const expr_type &result_type, const expr_type &arg_type1, const expr_type &arg_type2, const expr_type &arg_type3, const expr_type &arg_type4, const expr_type &arg_type5, const expr_type &arg_type6)stan::gm::function_signatures
add(const std::string &name, const expr_type &result_type, const expr_type &arg_type1, const expr_type &arg_type2, const expr_type &arg_type3, const expr_type &arg_type4, const expr_type &arg_type5, const expr_type &arg_type6, const expr_type &arg_type7)stan::gm::function_signatures
add_binary(const ::std::string &name)stan::gm::function_signatures
add_nullary(const ::std::string &name)stan::gm::function_signatures
add_quaternary(const ::std::string &name)stan::gm::function_signatures
add_ternary(const ::std::string &name)stan::gm::function_signatures
add_unary(const ::std::string &name)stan::gm::function_signatures
get_result_type(const std::string &name, const std::vector< expr_type > &args, std::ostream &error_msgs)stan::gm::function_signatures
instance()stan::gm::function_signaturesstatic
key_set() const stan::gm::function_signatures
num_promotions(const std::vector< expr_type > &call_args, const std::vector< expr_type > &sig_args)stan::gm::function_signatures
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1function__signatures.html b/doc/api/html/classstan_1_1gm_1_1function__signatures.html new file mode 100644 index 00000000000..eedffc9738a --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1function__signatures.html @@ -0,0 +1,786 @@ + + + + + +Stan: stan::gm::function_signatures Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::function_signatures Class Reference
+
+
+ +

#include <ast.hpp>

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

void add (const std::string &name, const expr_type &result_type, const std::vector< expr_type > &arg_types)
 
void add (const std::string &name, const expr_type &result_type)
 
void add (const std::string &name, const expr_type &result_type, const expr_type &arg_type)
 
void add (const std::string &name, const expr_type &result_type, const expr_type &arg_type1, const expr_type &arg_type2)
 
void add (const std::string &name, const expr_type &result_type, const expr_type &arg_type1, const expr_type &arg_type2, const expr_type &arg_type3)
 
void add (const std::string &name, const expr_type &result_type, const expr_type &arg_type1, const expr_type &arg_type2, const expr_type &arg_type3, const expr_type &arg_type4)
 
void add (const std::string &name, const expr_type &result_type, const expr_type &arg_type1, const expr_type &arg_type2, const expr_type &arg_type3, const expr_type &arg_type4, const expr_type &arg_type5)
 
void add (const std::string &name, const expr_type &result_type, const expr_type &arg_type1, const expr_type &arg_type2, const expr_type &arg_type3, const expr_type &arg_type4, const expr_type &arg_type5, const expr_type &arg_type6)
 
void add (const std::string &name, const expr_type &result_type, const expr_type &arg_type1, const expr_type &arg_type2, const expr_type &arg_type3, const expr_type &arg_type4, const expr_type &arg_type5, const expr_type &arg_type6, const expr_type &arg_type7)
 
void add_nullary (const ::std::string &name)
 
void add_unary (const ::std::string &name)
 
void add_binary (const ::std::string &name)
 
void add_ternary (const ::std::string &name)
 
void add_quaternary (const ::std::string &name)
 
int num_promotions (const std::vector< expr_type > &call_args, const std::vector< expr_type > &sig_args)
 
expr_type get_result_type (const std::string &name, const std::vector< expr_type > &args, std::ostream &error_msgs)
 
std::set< std::string > key_set () const
 
+ + + +

+Static Public Member Functions

static function_signaturesinstance ()
 
+

Detailed Description

+
+

Definition at line 94 of file ast.hpp.

+

Member Function Documentation

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::function_signatures::add (const std::string & name,
const expr_typeresult_type,
const std::vector< expr_type > & arg_types 
)
+
+ +

Definition at line 118 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
void stan::gm::function_signatures::add (const std::string & name,
const expr_typeresult_type 
)
+
+ +

Definition at line 124 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::function_signatures::add (const std::string & name,
const expr_typeresult_type,
const expr_typearg_type 
)
+
+ +

Definition at line 129 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::function_signatures::add (const std::string & name,
const expr_typeresult_type,
const expr_typearg_type1,
const expr_typearg_type2 
)
+
+ +

Definition at line 136 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::function_signatures::add (const std::string & name,
const expr_typeresult_type,
const expr_typearg_type1,
const expr_typearg_type2,
const expr_typearg_type3 
)
+
+ +

Definition at line 145 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::function_signatures::add (const std::string & name,
const expr_typeresult_type,
const expr_typearg_type1,
const expr_typearg_type2,
const expr_typearg_type3,
const expr_typearg_type4 
)
+
+ +

Definition at line 156 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::function_signatures::add (const std::string & name,
const expr_typeresult_type,
const expr_typearg_type1,
const expr_typearg_type2,
const expr_typearg_type3,
const expr_typearg_type4,
const expr_typearg_type5 
)
+
+ +

Definition at line 169 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::function_signatures::add (const std::string & name,
const expr_typeresult_type,
const expr_typearg_type1,
const expr_typearg_type2,
const expr_typearg_type3,
const expr_typearg_type4,
const expr_typearg_type5,
const expr_typearg_type6 
)
+
+ +

Definition at line 184 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::function_signatures::add (const std::string & name,
const expr_typeresult_type,
const expr_typearg_type1,
const expr_typearg_type2,
const expr_typearg_type3,
const expr_typearg_type4,
const expr_typearg_type5,
const expr_typearg_type6,
const expr_typearg_type7 
)
+
+ +

Definition at line 201 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
void stan::gm::function_signatures::add_binary (const ::std::string & name)
+
+ +

Definition at line 226 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
void stan::gm::function_signatures::add_nullary (const ::std::string & name)
+
+ +

Definition at line 220 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
void stan::gm::function_signatures::add_quaternary (const ::std::string & name)
+
+ +

Definition at line 232 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
void stan::gm::function_signatures::add_ternary (const ::std::string & name)
+
+ +

Definition at line 229 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
void stan::gm::function_signatures::add_unary (const ::std::string & name)
+
+ +

Definition at line 223 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
expr_type stan::gm::function_signatures::get_result_type (const std::string & name,
const std::vector< expr_type > & args,
std::ostream & error_msgs 
)
+
+ +

Definition at line 254 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
function_signatures & stan::gm::function_signatures::instance ()
+
+static
+
+ +

Definition at line 112 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + +
std::set< std::string > stan::gm::function_signatures::key_set () const
+
+ +

Definition at line 305 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
int stan::gm::function_signatures::num_promotions (const std::vector< expr_type > & call_args,
const std::vector< expr_type > & sig_args 
)
+
+ +

Definition at line 235 of file ast_def.cpp.

+ +
+
+
The documentation for this class was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1list__argument-members.html b/doc/api/html/classstan_1_1gm_1_1list__argument-members.html new file mode 100644 index 00000000000..9e27b93b038 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1list__argument-members.html @@ -0,0 +1,142 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::list_argument Member List
+
+
+ +

This is the complete list of members for stan::gm::list_argument, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_cursorstan::gm::list_argumentprotected
_defaultstan::gm::valued_argumentprotected
_default_cursorstan::gm::list_argumentprotected
_descriptionstan::gm::argumentprotected
_namestan::gm::argumentprotected
_value_typestan::gm::valued_argumentprotected
_valuesstan::gm::list_argumentprotected
arg(std::string name)stan::gm::list_argumentinlinevirtual
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::list_argumentinlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::list_argumentinlinevirtual
list_argument()stan::gm::list_argumentinline
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::list_argumentinlinevirtual
print(std::ostream *s, int depth, const char prefix)stan::gm::list_argumentinlinevirtual
print_help(std::ostream *s, int depth, bool recurse)stan::gm::list_argumentinlinevirtual
print_valid()stan::gm::list_argumentinlinevirtual
print_value()stan::gm::list_argumentinlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::list_argumentinlinevirtual
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
valid_value(std::string name)stan::gm::list_argumentinline
value()stan::gm::list_argumentinline
values()stan::gm::list_argumentinline
~argument()stan::gm::argumentinlinevirtual
~list_argument()stan::gm::list_argumentinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1list__argument.html b/doc/api/html/classstan_1_1gm_1_1list__argument.html new file mode 100644 index 00000000000..609a2263613 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1list__argument.html @@ -0,0 +1,722 @@ + + + + + +Stan: stan::gm::list_argument Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::list_argument Class Reference
+
+
+ +

#include <list_argument.hpp>

+
+Inheritance diagram for stan::gm::list_argument:
+
+
+ + +stan::gm::valued_argument +stan::gm::argument +stan::gm::arg_engine +stan::gm::arg_method +stan::gm::arg_metric +stan::gm::arg_optimize_algo +stan::gm::arg_sample_algo +stan::gm::arg_test + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 list_argument ()
 
 ~list_argument ()
 
void print (std::ostream *s, int depth, const char prefix)
 
void print_help (std::ostream *s, int depth, bool recurse)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
bool valid_value (std::string name)
 
argumentarg (std::string name)
 
std::vector< argument * > & values ()
 
std::string value ()
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
+ + + + + + + + + + + + + + + + + + + + + +

+Protected Attributes

int _cursor
 
int _default_cursor
 
std::vector< argument * > _values
 
- Protected Attributes inherited from stan::gm::valued_argument
std::string _default
 
std::string _value_type
 
- Protected Attributes inherited from stan::gm::argument
std::string _name
 
std::string _description
 
int indent_width
 
int help_width
 
+ + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
+

Detailed Description

+
+

Definition at line 12 of file list_argument.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::list_argument::list_argument ()
+
+inline
+
+ +

Definition at line 16 of file list_argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::list_argument::~list_argument ()
+
+inline
+
+ +

Definition at line 20 of file list_argument.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
argument* stan::gm::list_argument::arg (std::string name)
+
+inlinevirtual
+
+ +

Reimplemented from stan::gm::argument.

+ +

Definition at line 151 of file list_argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::list_argument::find_arg (std::string name,
std::string prefix,
std::vector< std::string > & valid_paths 
)
+
+inlinevirtual
+
+ +

Reimplemented from stan::gm::argument.

+ +

Definition at line 126 of file list_argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
bool stan::gm::list_argument::is_default ()
+
+inlinevirtual
+
+ +

Implements stan::gm::valued_argument.

+ +

Definition at line 178 of file list_argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::gm::list_argument::parse_args (std::vector< std::string > & args,
std::ostream * out,
std::ostream * err,
bool & help_flag 
)
+
+inlinevirtual
+
+ +

Reimplemented from stan::gm::argument.

+ +

Definition at line 48 of file list_argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::list_argument::print (std::ostream * s,
int depth,
const char prefix 
)
+
+inlinevirtual
+
+ +

Reimplemented from stan::gm::valued_argument.

+ +

Definition at line 31 of file list_argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::list_argument::print_help (std::ostream * s,
int depth,
bool recurse 
)
+
+inlinevirtual
+
+ +

Reimplemented from stan::gm::valued_argument.

+ +

Definition at line 36 of file list_argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
std::string stan::gm::list_argument::print_valid ()
+
+inlinevirtual
+
+ +

Implements stan::gm::valued_argument.

+ +

Definition at line 164 of file list_argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
std::string stan::gm::list_argument::print_value ()
+
+inlinevirtual
+
+ +

Implements stan::gm::valued_argument.

+ +

Definition at line 162 of file list_argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
virtual void stan::gm::list_argument::probe_args (argumentbase_arg,
std::stringstream & s 
)
+
+inlinevirtual
+
+ +

Reimplemented from stan::gm::argument.

+ +

Definition at line 103 of file list_argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
bool stan::gm::list_argument::valid_value (std::string name)
+
+inline
+
+ +

Definition at line 143 of file list_argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
std::string stan::gm::list_argument::value ()
+
+inline
+
+ +

Definition at line 160 of file list_argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
std::vector<argument*>& stan::gm::list_argument::values ()
+
+inline
+
+ +

Definition at line 158 of file list_argument.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
int stan::gm::list_argument::_cursor
+
+protected
+
+ +

Definition at line 182 of file list_argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
int stan::gm::list_argument::_default_cursor
+
+protected
+
+ +

Definition at line 183 of file list_argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
std::vector<argument*> stan::gm::list_argument::_values
+
+protected
+
+ +

Definition at line 185 of file list_argument.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1list__argument.png b/doc/api/html/classstan_1_1gm_1_1list__argument.png new file mode 100644 index 0000000000000000000000000000000000000000..93802d081e535816abe1767907194f4d39e46e50 GIT binary patch literal 3141 zcmd5;eOQv`8h4V)EQ?Mxt(>q%>1M*}SXw$ouXY?YL)Y><&9$~=Db6xQ6o%PY)3Rvl z773lR6*&}Bri>IZ79+yOD)A#g{0!$83MndId*9b{&b8~>**W{`oWpg!ywCkS@AEwO zegA&WbI;pOPRkHLyB!V#{y)2a*bcnBV%~b^4Tr-4G)E_9 zbITO zE2bQbv~{#fZ0tszsjT+o?g%yd#JlFPG{1Rlufc4g`m9~Mwyc4`pr*i{b9Z;mK;a_p z3~zwP#JnbSbzZynEgsFu#pNy(69*gt&I?@HJ>;N`dPUHH}YMja{usVpXXj z{sOj?j}&_o*jSz`#?#`>LYsF$-`6`2^xP?B^=;-3@qZ?WDC5s;DMhqd{<6n1KR>TgE^hwA z;Uhs}QL7_u$E@t!p~ld#C?AV;erUG6{3Y(aHyKe&t5nf0qLqcS`P8F(7@-ew9~T$X zDC^)HP9Z~Mp8XWP5DBGh@gV9wf#n;u*yj>jxfHL?C6ZCr4Ndq>Dvv`Mp0n8OY&RDd z7som`KR>@O;=!e!o(>LN4dgci^z#dKvJYgv4_T>0PVVkopf%;tCOJ?ygxdeC+wr-L zB6jE_A|md1SGhPm-L*%=466MXzd3dAcz1+gNnVO<158M1* z(X#{$buaxOF69Mi%WMTMSd3xMDYDweI;9ugXtzek4*F^EjF!h6L2heyAubS1Lw_!u znWww}Cx#bU3t8EeyEhS@+woC)-J+80C1cI>i6qG~Z1*IL-$Nk&Zoq52`jP4Z2E zVVOkFC#z~?$nGLh)-yUSJ1MJbYq>h%7zlEL9v8gR5OtZ*?hZ;U1qY-TDR zBMYj6BE;3ZNXW^)^0+p^QsowG1LitzKqd1#1er8jY~ici-QDf}D`S8x)PqQMOlE($ z3GlWP@<1R6g{%(968-SpKPBMTQ2q|W|DA5fD=peAv+_)Faq%|$@&{f2uFP10YQf@k z<}}HQ-7r7Z2|Bpq+jP{4hwUH*=Z~A2nPz)?xVY70@gL-?HElD7>I3J7^h5oo&sEPx zqPB8&0xH%|2rWRf%aw7>{NOOPrBfBcyC5CYUkw&lKT2PR=so}vYdVN^s$YM7-(%ht z>o>G2F|Rw6F3G54b_iSV?1j|gw(f*MIj)Sd4A$6lQ7Kzkp0~Hoq7ZRNNMFQrH+!dE zZ%c!haCvi@vf>PAb<~2^Nk5-(GO~RBt!hL+c zDaGshh{VrhSx>_ML+AFtX#j=Pb)}1S27xLkIZL4h4&A2JBU6`$kpfL8pqWh?^!n=~ zTjYKoCFtG+MKmKeDT@Kb@+RZ_9~nw>lVI?!q}<8wpxl@yqN0yyo#waYt}5fst45F& zAzwFgs|)Sx^XkKTwU^9e@$8vVE5SMaE5k>k4u6H63VR8k`ViQRxbQGVf7;zd2|>6PmQUpDVhq<{od=96 zo_KVKu-kL~usUl@vlX$kZtjM|P((uuXA4j(>hc$kFhX;J5U%!-Jh}0^AboRycx6eZ zf16gtOddF!1Y9GMb!)hqXaBi3+oqUujr+571;OLzFXvnu$g0(DjxkR7UO=1DnyqKsmO=3rS%X4tRtQw z!hIN7P5;qLrOMYu)fk;ld)_})mAxC2H_Zh>Y8Ls1RV8AWXeAIAK!ovG_WAtH^_1os ze9m~DYKxq^^A)q~spX1+8eRXC|t)V + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::singleton_argument< T > Member List
+
+
+ +

This is the complete list of members for stan::gm::singleton_argument< T >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_bad_valuestan::gm::singleton_argument< T >protected
_constrainedstan::gm::singleton_argument< T >protected
_defaultstan::gm::valued_argumentprotected
_default_valuestan::gm::singleton_argument< T >protected
_descriptionstan::gm::argumentprotected
_good_valuestan::gm::singleton_argument< T >protected
_namestan::gm::argumentprotected
_validitystan::gm::singleton_argument< T >protected
_valuestan::gm::singleton_argument< T >protected
_value_typestan::gm::valued_argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::singleton_argument< T >inlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()stan::gm::singleton_argument< T >inlinevirtual
is_valid(T value)stan::gm::singleton_argument< T >inlineprotectedvirtual
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::singleton_argument< T >inlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::valued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::valued_argumentinlinevirtual
print_valid()stan::gm::singleton_argument< T >inlinevirtual
print_value()stan::gm::singleton_argument< T >inlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::singleton_argument< T >inlinevirtual
set_value(const T &value)stan::gm::singleton_argument< T >inline
singleton_argument()stan::gm::singleton_argument< T >inline
singleton_argument(const std::string name)stan::gm::singleton_argument< T >inline
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
value()stan::gm::singleton_argument< T >inline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1singleton__argument.html b/doc/api/html/classstan_1_1gm_1_1singleton__argument.html new file mode 100644 index 00000000000..1d1065de150 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1singleton__argument.html @@ -0,0 +1,758 @@ + + + + + +Stan: stan::gm::singleton_argument< T > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::singleton_argument< T > Class Template Reference
+
+
+ +

#include <singleton_argument.hpp>

+
+Inheritance diagram for stan::gm::singleton_argument< T >:
+
+
+ + +stan::gm::valued_argument +stan::gm::argument +stan::gm::arg_adapt_delta +stan::gm::arg_adapt_engaged +stan::gm::arg_adapt_gamma +stan::gm::arg_adapt_init_buffer +stan::gm::arg_adapt_kappa +stan::gm::arg_adapt_t0 +stan::gm::arg_adapt_term_buffer +stan::gm::arg_adapt_window +stan::gm::arg_data_file +stan::gm::arg_diagnostic_file +stan::gm::arg_id +stan::gm::arg_init +stan::gm::arg_init_alpha +stan::gm::arg_int_time +stan::gm::arg_iter +stan::gm::arg_max_depth +stan::gm::arg_num_samples +stan::gm::arg_num_warmup +stan::gm::arg_output_file +stan::gm::arg_refresh +stan::gm::arg_save_iterations +stan::gm::arg_save_warmup +stan::gm::arg_seed +stan::gm::arg_stepsize +stan::gm::arg_stepsize_jitter +stan::gm::arg_test_grad_eps +stan::gm::arg_test_grad_err +stan::gm::arg_thin +stan::gm::arg_tolerance + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 singleton_argument ()
 
 singleton_argument (const std::string name)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
value ()
 
bool set_value (const T &value)
 
std::string print_value ()
 
std::string print_valid ()
 
bool is_default ()
 
- Public Member Functions inherited from stan::gm::valued_argument
virtual void print (std::ostream *s, const int depth, const char prefix)
 
virtual void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + +

+Protected Member Functions

virtual bool is_valid (T value)
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Protected Attributes

std::string _validity
 
_value
 
_default_value
 
bool _constrained
 
_good_value
 
_bad_value
 
- Protected Attributes inherited from stan::gm::valued_argument
std::string _default
 
std::string _value_type
 
- Protected Attributes inherited from stan::gm::argument
std::string _name
 
std::string _description
 
int indent_width
 
int help_width
 
+ + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
+

Detailed Description

+

template<typename T>
+class stan::gm::singleton_argument< T >

+ + +

Definition at line 44 of file singleton_argument.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
stan::gm::singleton_argument< T >::singleton_argument ()
+
+inline
+
+ +

Definition at line 48 of file singleton_argument.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
stan::gm::singleton_argument< T >::singleton_argument (const std::string name)
+
+inline
+
+ +

Definition at line 54 of file singleton_argument.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::singleton_argument< T >::find_arg (std::string name,
std::string prefix,
std::vector< std::string > & valid_paths 
)
+
+inlinevirtual
+
+ +

Reimplemented from stan::gm::argument.

+ +

Definition at line 116 of file singleton_argument.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
bool stan::gm::singleton_argument< T >::is_default ()
+
+inlinevirtual
+
+ +

Implements stan::gm::valued_argument.

+ +

Definition at line 144 of file singleton_argument.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
virtual bool stan::gm::singleton_argument< T >::is_valid (value)
+
+inlineprotectedvirtual
+
+ +

Definition at line 152 of file singleton_argument.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::gm::singleton_argument< T >::parse_args (std::vector< std::string > & args,
std::ostream * out,
std::ostream * err,
bool & help_flag 
)
+
+inlinevirtual
+
+ +

Reimplemented from stan::gm::argument.

+ +

Definition at line 59 of file singleton_argument.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
std::string stan::gm::singleton_argument< T >::print_valid ()
+
+inlinevirtual
+
+ +

Implements stan::gm::valued_argument.

+ +

Definition at line 140 of file singleton_argument.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
std::string stan::gm::singleton_argument< T >::print_value ()
+
+inlinevirtual
+
+ +

Implements stan::gm::valued_argument.

+ +

Definition at line 136 of file singleton_argument.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
virtual void stan::gm::singleton_argument< T >::probe_args (argumentbase_arg,
std::stringstream & s 
)
+
+inlinevirtual
+
+ +

Reimplemented from stan::gm::argument.

+ +

Definition at line 98 of file singleton_argument.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
bool stan::gm::singleton_argument< T >::set_value (const T & value)
+
+inline
+
+ +

Definition at line 126 of file singleton_argument.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
T stan::gm::singleton_argument< T >::value ()
+
+inline
+
+ +

Definition at line 124 of file singleton_argument.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + +
T stan::gm::singleton_argument< T >::_bad_value
+
+protected
+
+ +

Definition at line 160 of file singleton_argument.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + +
bool stan::gm::singleton_argument< T >::_constrained
+
+protected
+
+ +

Definition at line 157 of file singleton_argument.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + +
T stan::gm::singleton_argument< T >::_default_value
+
+protected
+
+ +

Definition at line 155 of file singleton_argument.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + +
T stan::gm::singleton_argument< T >::_good_value
+
+protected
+
+ +

Definition at line 159 of file singleton_argument.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + +
std::string stan::gm::singleton_argument< T >::_validity
+
+protected
+
+ +

Definition at line 151 of file singleton_argument.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + +
T stan::gm::singleton_argument< T >::_value
+
+protected
+
+ +

Definition at line 154 of file singleton_argument.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1singleton__argument.png b/doc/api/html/classstan_1_1gm_1_1singleton__argument.png new file mode 100644 index 0000000000000000000000000000000000000000..3857a3ad7e0cc74309cff158b9aee09800c75911 GIT binary patch literal 14438 zcmdUWc~la3+qM;sSfgc5I+aVKmCY17lct$lOqw;WNcls!xUc(KZj)`T z&1KeZSt}tSA#?PIshxzxDvX507q6jfz*poHBa^{DU)x$bn2AIp@NjIBi%k0?9Xwk8 z`|#mI$>cs&@Ly=SowdCLc#`-J?WMzB2?;&!QB$}>)T*hx!K_l^#xGJ%!Wg2f6>D}$ z|GxKuPksC>I^##H9Pa|nwnfVR)M2#5+l0%dL2w9GVJFIAojkns*W_)qKTOkmF2lL4 z3-CFp9a;`9k=SYjkzu}*p;Kyaw3CSoxV;`Z-Q#4#c(=*by{9Z{Se|Mn(RCGG-_|5G zAK&ikM>_0&s16|l{w(JQC>i_w=f>dx?0imWAmS@pD^(*)J zv_)cGqiMjJ;&kg1D)lQVe zT6wqxc#F>dVY=ant_%!+FfP3(bkBBdB#W07=V zr*EKjvkV;;j2_&`wY81(fM6pg8^}_SDSS;r6814H)}X}0v44jTRSXx4chZAd>|kK zSL3XNZ3c9831$4NLlUO}PQ+ZnlMM$Q0a7}z*8KaB`fol43!5K*|7FnXhx{31k;^Ba z430D^;jJhtjB;Scf767#3`g~#Ib@X~vsJR6vNVcnbbm44kn7RnnRDEur=n)0t;L$8 zRheC)`^p`EI`jo$pu_l9!*oPl90pVSy%qM0v1fJ^3u&q2=Tg zAN;^V^vmPb9iE%2aX6uBq~x@>p0Tbo-U3b54JZiKZsbp+TXVeA6!r0F9ixYFwf_U^7k>sbn zg#BmvN-6xGuO?utRQLEkSS1k=wPj!4k^wm$vZ`;GD(b}Fl^`gktnQh)jg|;pc&i{~ zi~eN10N&tT{{I5+T}@?@SBCdDN&|+ZNMai$KlylaUZB39d5rAzGN}|ENHkcOh1v;V zYS7ovR)~zpCZc=G(;VZ@r`WUco0!i}#}EUZMqlU-SGAo&Wa&+m8pPef)Xt`yt$i)4 z>vc8wYPFbD`>6x?<}Smk6YS8^fnhJnd${gntUDK6HW~an6&9`*ST%Q3{RsC$QLClZ zChjf;D zegoY`JzvAt=pf()!yv=3C*cDOgE#cfgpA4>e)6|z?LX^n! z60fJDaof&H1gC!j_J4|M|1rQ73OcF73p*v2jIaO&N%1r;Cz_hS+rj zqN1J|IBK*_YxO9~pzE^PA7*V^qGb@@k#_b`YLZz6m9hTW0)S+EAy$Zgjdl;q3~xWr zQ*x^esxtm^K^7C?b|z)zivwh zZ2jCbw(J3gT;;+;+8@wVEr74L&dY`OD(Hb>H6vPa_L+=%@3|WGf>~iT?_5fJmM5w+ z{5{z()+IY!fXonROJa>r5)QHs&cD=zjotg#x3 z=v^3-wnnaW{g}34t0KJg>3iMq*Si+EN&JSYfH$;40kT0tcH@6=asC6%kGOY~hI$sF z#DJV7F-K4i4Adtd!bMAX600IKV}_t22QL*_Lsls<8!>~fwSzJG^bp>0MbfcR3vC0z zjpE{oh|~E2+M2tqI+4-VjmAY+9H$m^;9)OBzn##<-jj5rpf##xPP;@4y zeLOton|VouOJ5i~iFkS|Nfe^tM{RyCOHBL%0YPdlmSYl)lEP~?%Yk9Gf7O^eRvs{c zZ9u^3*IGT$3X%HL6{I^4Nb_A<23=Py6lgBS)?ilIB#M-JM0SCXW4}5|_jH`=OZ}k< z2U6_)ihCi+G5L;M6}gUil24}LhFd)|ODZ&jPXPDvD=T}hBKV|ioQ|)O2?c{D{p-z;9)VNo_^ZyJI2Bfhb|Vwb z=5DJD+>N;ib>^qAlx0mzgsVPTVq#OUqOl$_IDT-6Rj;>wG+--e{I5{8JIq&!JYyxX z5bLgagbM?*ADETDNGENRPKoe4z0LIG#HiyCtZ=OyBsl#d>OxqqCFh%3 z&6BfU`T6C&nbB3vHFx)*@MUzet|!=Lwp7=97R?GCQ-5L`B*xbLcKK%Fb}K)c5s=Ex z*AdA%sGzm<>rwWvjLnC!y$@o`CSav?aegUv)wxNi(dS0+_*6Fi3I zQ;Qhf>#+db$Y|4wN*A}zY)ENr-0$0H=7ur1)|(l+yB{ks*@1GBn8#rMR%me@nj-dW)V!8M7i}b-aYy7B zdqq%NA@`p4WR-ura0labR4zL=xKc*M3V9hPj8;XcF5bVHUw9$Gnj%z;Wag{z|W#nfPd=^QQ1t!FFHG z7Q5ez&|eb8%l5K(*)p~^BYH3QtJA;Ao}Aj+KFS)$xBEby(MRml5s&n)c)Jkp&GcU8 zqk5$J48xt$iK#YcLb5M}+ftQkogRqAlwwEmezlU?VeWfn9FD@n*tH;oc!$ByM^KyB z9>FbMV5%J?+jJC&8BY>p3N8|{IRc}u0 zbyt1$^^HXKH0JaaFMWi`O>Nx>5N}i~brFjy3{TtGjf$}Ox$XyZOO2>@RtHkYfC=wt zKTX?eoFHYS)pZU^Gf{(C|EWG#+%BhlS<0*dQig_-Sp5+G?+zgTCrejM^YzZ+%mjo- z^YyOjEEfRjhuG*n6RUpfYb$UJ+{-rnz2E>Z2#|E*=p|t4u>78-)B`2Vq+`9 zP{JXIEfl+yJG@?05R0ZTGrH@{&aF0e)20u);sXli2Vv|sciFW$>hln;KG8#@4+pkq z_DA;G9xa;sikeE!5yfsGLP`eSj{8s#+eYr3TFYZ^?qJkMl5fk8*}L>P+@i$xe(gUn z8!@*xKH1l~&u;Sl97jsxB2Cj-A#4Sf?-LHBl$?y|bq8at6p}DQ5;_E(a2dY6i{=IN zohYBiIe4C>wegd8NIcV@i9k-qa2Ob#!Ch=%hU{bd8$DG8xR!jir74vF$z!mzvnjPP z?c~wSX$D_E^k#l}d|XD5v|EtNUL2=%{X#IDp3@xR{ntVbY~7QArXnXMo680?P{h&p z%}&kku6XhjFlWPUKNN(w8+6|rc(MG1ShyR7LfG}t;Be32goFHMVbe?C3Cn-&BB z;Tuky0;@X8V948KIjVvWab%QxXMv(S7y21fuFY3~a%Gtg7ptb8$vi&C2WbFV$qJ`P zXfmUY78!-r=B8-J2Mmk}arx>%=f>2n(flDBLaCsHN7EU)2X8c}f{7gK)H?6-AEV9#Q0_^SecloBq z?J1#jCc3IF9-+Sbk_M~T2-K~$7BH|MIo)eXU7~{z&koEzT?G(UAMI3B5WVoTR{K8}+xMNqAO|G%X02X~s}APW0%a zpE(4pGP-zfuX!$^14tYbFni=^cP?WFJP=8Kl(KwI=2Gnl@-c=tefLZYBOyl{NbjX< z+mOm~kh{ZV)P;&{L5zMj5~K&k4b-4Z%fvXl*<*{Qb&rl9>f3U#0uj-pDf(Q$W5|ZY7o0zr|3y3k1 zBSipArgFdCs*l#*g^~zdBrE7`irKG-(|W5j@{3;9^X`XBNZ>GJ%)rjd&t5EcF+*O2 z+8G^A{G%lBrh1DDYr=-h0Mn3USi!4^1`kB5KViVnMR|zzrh$JBhk(xQFJ*bEjb#I? ze`(uUb0vA5xQ0p4UqyiaYX8))35S}lQf9*u^UeFLv`J04GAlLO#ki_}1g^1gw=SY* zP5^>h**rUl>fDP+>2!#&e_2-8kl~||z)=WKbBJ#u6F`}@M{CX=gmiikH~Sz6EZITz z-FNS0N2)YY6v~hXra@&bi^(>$;Hu~+vDfwJ+v|qv`cS>#^94mQY1K8@U?zp0m{)n` zQm4w7U>#i2RA?sPLUdCKmtMQQ6LOl_bA z_e0ED^oQ6XC{{lUU+-%d=VNb1b-i13s&}<}VSoO1r=zjV=6uXOH`*FgYW=EFnaX;B zjb!sxldr1#?#7&Tl3uoZ@03?O`(mf8ozW5C2v(ecu8*y=(nI-1#?a_!n5G-yOlMMq z*4vl?Eja?}SYG^Z1C0_X#h5`gWpk4!|7K0NC|5sJ9Un{^W zw|(iyJ5al+#T{@`#r|eAMq!o{faoSYv<^(t}y!Tp`oi44xI?|ok>l`786`lo*S*e4^{vZy`1{6E)mL+7b zz+=AxPq()pzKBJ5E*lfIvY+@MOId#jaB`SljzN3vo&GzEIjZ5>S~_zyUU4)jNl2l{t+HD0LZm&YEg_#Wjje_~5Z zN8qxIUrRhc31#KmTT{ow4>Y8&S#j8*#U6nQ1paP=F{u^%1wKi}-PQLqCUt`#Sauk~ z%p=c7)2|n+)R(#=6e}7U#6N|N_OwK~<;>m#(9%@j)klC@UoUPReDwO?EsZn=To@U1 z>aQYw4JTD4v5yJ1%9RpKsX@5?wAG*Ke8rW3-e2_cRU)|25UPR~ZFC{*j5y3J`Fog2 z|4vJPC!PSiSnUiQ+Sf&I z^JNO+)j&?Iw6VIbhThdSq>>9nyg;r}qr@mFr~kgooDp0O5vAb7KEej@D0^#b?P5h zm%Iln$0oS6<0fN!2O~22YVYy;5jjFI6ZA^mqS{x=8+6QtNf=|e*?T>rA|2y^5&X2C zmF0yBOjDAgUj;5~(DNK#oMX;?=`7DiK7;pr#txW)z^u00vgm~S+j2$y8fA+&uH?mu z&Vz})5w%vq{JV#1{92{f+QmP)9jbiA*64Z0DWGA8Uz`iRvT$IQ8Rmhc3_IeK!JfOp zL>jq9gH@Z(O3ePmg?%p7f(=N0g}Qo2(aD|*JmgX(D1j-48>-_{w$U_l86)B##2W-5 zX48zhWxX$Wxuccd=KZ_0OKACn()k5fIQ=KsudWt^l?Hf9?{G$GbEiR|S}LM2O`!vq zTmFlia^2o?{z(#h>jY>nD6bSE$M;DASwh0hqe+`G`LvSb-RpIw+2^m`~%Bt|~)<3mCp3rJ}^obnw)Cg33fuAVIqThiKDW}vlpBOuo<_O3H98;0}?pN_}gXQ=W=hs1osvm zj~3zlR$?872&yg7Z*?e#w3(lQxsIHV(O2{nn`@`KMAGu*4E{x@=N>e~QZ%+PmSywi%xB?0X%e$P|O+qYJGuYlI3EjG%!FQ|*YGc|qxmV5aI- zg-DWaWLnad+*lvmu;`8<73j;&)%cp)>APBjqMzEIV5W|%Y03Bzp5o9LgoEOU#p^Bc zwM9YsBBmHuHV`WOJ|iqi?iLSiO1*Ov%YKl%k5j->&NnYn*@4O-mKwjFFD;Kr|Aa)v z2I6yp)@SV&2hmos95c4224`uzYWX;Rd{k=W)_cnT&aXQ?wHe!MM@f5-qAzgD1v`B; zo1HO79Sszuv(@lLuIl&~fhKqqsAYwt3``6~YOV9`sN#J8{(1b55AHi6Gw$2a5IJ>( zlBtE~;MUDd%%TQB$!CfsrthIp`nlgo5xkOJStg7sM97tF{A1i)=XOHtMBvZp znGlqNY6!`J3=U2oJw7j2Jx?rSSFOMZR$yebd;4QYC!-@k(K&r;{XUmg02r$z7Gox9 z7OZ@Al!W`k_25F7CB6{O`V`Cw-iSI%2><6eF7hoWOd)~{3{Gkvjr88~0ay*O2^XO( zVq5(;S+E%gP}QmX9>t&PIa(5Pd4)#T!1-6k#kay$M?0rqPGT5_NxFX)0ZB_WPn%)m zuFZk%an0+An=Rf11PFU}pgVihCNYU%Z(m|Q6~GrARY5$`8kLaHB*$!c$1Uc8Sd?X- z?5bKn4pN!b&qEnze9@up$1}_p8E<*nnswBwfq>aSHrm@u9hB`rT^43Pu z?Eno?+3Sw)_V*vFD)}=%33a97cQ4oF5!aAqh|wUWgWYi1axWX($jg&!dCxXi&k?Kl z(+)LF`2<=piO7|c2Q2{$SiKjGYTmI3rVHE2=m~ipkeM9kfwTp8ZTkkW52oMNZ+4q| zA$+6?m#AB6lZ_d;ta2C}S^g6%+Ix?QN~0a9hJ z6}U5WAT}l}rzr*7T@vD&trASu>Wfw<_lor^;T!3MT_`Q|Lg8evsbizr;ukt4r=FvrANx$ z-HynqScL0&CD+fE^(qjy^MAWBh06=7P2BA(>vjw%lx^#OCmQ2BU~!W3d?PfG)8%NWv>Qq-l&Rm3l`YDp?N|8+MQ@~>gf=I zkkizXp*fGMvqxV1z^tK8D+eyb_)3u%<=!Jr59hu-ZC`a?rfru3&&9{K!pMjE3b>2n zFh}C*#PRdctmxw>{A&~y(xxYK5FyTO&esP}UoTSoVt=$tuz>y>S^0&whVGI$Q0kro1v zpB?bGGg5!;#1pP0-J6>8u0OJOGz77SABG%iu@ z#M@5=sSujDQvCRi`txe|a9*~8$d)r%mZIw*(=uCwpe$jmYi%`q=p^k?VMQQW)kbWHk_f5^8ap?f583ZHH9z3Xy zTn83?fZGr?zQ6hfCB%pO{K;)+$xCe?bqb^mh&9`_r(t<*=Q^kj3iw?Hnxg@CbYVhno8$AHq@*d1nu9hbC105NCb=z5| zcMkwjmKbD2NE#U>MMydtCP}!zh;;7jyVk<(`6?>s>uQjp6-6Q&g4|sn=O_?%lFF4P zg9~8bLbugFs@@SRJP(5G!D#s$^*h7Du?SniPH + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::unvalued_argument Member List
+
+
+ +

This is the complete list of members for stan::gm::unvalued_argument, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + +
_descriptionstan::gm::argumentprotected
_is_presentstan::gm::unvalued_argumentprotected
_namestan::gm::argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::argumentinlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_present()stan::gm::unvalued_argumentinline
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::unvalued_argumentinlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::unvalued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::unvalued_argumentinlinevirtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::argumentinlinevirtual
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
unvalued_argument()stan::gm::unvalued_argumentinline
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1unvalued__argument.html b/doc/api/html/classstan_1_1gm_1_1unvalued__argument.html new file mode 100644 index 00000000000..77be2d37b47 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1unvalued__argument.html @@ -0,0 +1,400 @@ + + + + + +Stan: stan::gm::unvalued_argument Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::unvalued_argument Class Reference
+
+
+ +

#include <unvalued_argument.hpp>

+
+Inheritance diagram for stan::gm::unvalued_argument:
+
+
+ + +stan::gm::argument +stan::gm::arg_dense_e +stan::gm::arg_diag_e +stan::gm::arg_fail +stan::gm::arg_unit_e + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 unvalued_argument ()
 
void print (std::ostream *s, const int depth, const char prefix)
 
void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
bool is_present ()
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
virtual void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + + + + + + +

+Protected Attributes

bool _is_present
 
- Protected Attributes inherited from stan::gm::argument
std::string _name
 
std::string _description
 
int indent_width
 
int help_width
 
+ + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
+

Detailed Description

+
+

Definition at line 12 of file unvalued_argument.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::gm::unvalued_argument::unvalued_argument ()
+
+inline
+
+ +

Definition at line 16 of file unvalued_argument.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + +
bool stan::gm::unvalued_argument::is_present ()
+
+inline
+
+ +

Definition at line 50 of file unvalued_argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::gm::unvalued_argument::parse_args (std::vector< std::string > & args,
std::ostream * out,
std::ostream * err,
bool & help_flag 
)
+
+inlinevirtual
+
+ +

Reimplemented from stan::gm::argument.

+ +

Definition at line 34 of file unvalued_argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::unvalued_argument::print (std::ostream * s,
const int depth,
const char prefix 
)
+
+inlinevirtual
+
+ +

Implements stan::gm::argument.

+ +

Definition at line 19 of file unvalued_argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::unvalued_argument::print_help (std::ostream * s,
const int depth,
const bool recurse = false 
)
+
+inlinevirtual
+
+ +

Implements stan::gm::argument.

+ +

Definition at line 21 of file unvalued_argument.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
bool stan::gm::unvalued_argument::_is_present
+
+protected
+
+ +

Definition at line 55 of file unvalued_argument.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1unvalued__argument.png b/doc/api/html/classstan_1_1gm_1_1unvalued__argument.png new file mode 100644 index 0000000000000000000000000000000000000000..442600547ca80c537e6fca71823f9f4ce963e63e GIT binary patch literal 1959 zcmcIlc~BE)6b~LP9^sG{tRjaTjt8P(xQqr6RICuM1q>jbfCP=m6%t5*j({>H9@Pwo zq{RxjaRG-!4uix-aRd>WkfjKMkxN)kVL3ubx}bKPcAWMfcV^%B-f!Ob=J($B-uGSH z=d}yJc*SBI4u|*H?REf%n+Ichs^)x5j>-Hf*s^@z-b3zcwHj03^`lXoKQ3e1+%Fc3 z7hY^N#!St~16~JlnA7Yht2tzY!+mS#;pTFPt}*a>;6|=U-(8+kx4cblVO&ct4tsoc z*vQtKphsAg<<7XOypYhlIlW_Yn{xtAeey1-(9b0-@U^7uNJvkGb$&I&taqs)cnzoH zmGBM#u=NHwu+GtpIpjJl*9-Mqp^2E=jl;Ll zX352j9kTwi0w!U6`+K{{=n?4gB0=0?>le!d5y_1q~b?artxskJ0(DP{hEaIYX4 zS9`ZXA;>+V-~O!PK>-@unG2U3Z&)!eOuP=_Sr`9E(FRa)iHy-5s(q`eXq}F~?Fl#0f0~sW41vLGIidC z<@8b)vm)IvQma1ImKl+N(@>aTWLOS{Z?U2#W8oF@kSI|yt`ZC5?Bf>t`99r$hx%%e z(qO4%Q=GPriI_CC?%+2ydEx53% z8_!)fk%{# zAPv@eV_|zND81bxvt02zDoIkLDBjsK_2GIk)w~;YP*71*FrJccoSB3FU?A zMg=AAD1*p$G;vPo@%MD}h*^fvD@wq_@8*UB$RmQ9StC0~<~r!h67p69TK8dR_=pV!RITS}ok;rwl zQY5B^m>?w%$^CrtI+JHo;g{K8cL}-9G<43)|CfArxIHXTVd;!#IZ+-5pwr-iVpz2 zDLJ4nhevG!^U&!iu0R$0D5a&>cS=>wb0S+eC_SAxqAk1^qa)h43wut#n<@e`jgb6u zmr157@O4qp44Fck)Z{MaI-L=;ov)@j(r#PETL&}uBN0gmyT@XDtn6fYP$fr%zu6_) zvVA=|od|+C#f;3A7pkb6hgcRhfr2)LZl0VE!oxcU^}~Y+aQ*mtXy|(*G|RK0f8(`9 zapQ_@EP=GbV{(mbMQG)K+4D|5$f#pd>>E#Qg^E^+Pd5iB*NtNM~_B<#N&Z=hvGTQx`N|)BsoX&baifoPBlm!6f=8#O1 zmU^({OciCwR-M(=c9=_=y?aTXcB3FzZ5{*2SZ)XicK;8}P-yftT)DzhO2i&N!fc;* bu$0>77G=}NR6o06uPV;N-OH`e^=Q&x(MtFW literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1gm_1_1valued__argument-members.html b/doc/api/html/classstan_1_1gm_1_1valued__argument-members.html new file mode 100644 index 00000000000..cb95a9f1125 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1valued__argument-members.html @@ -0,0 +1,134 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::valued_argument Member List
+
+
+ +

This is the complete list of members for stan::gm::valued_argument, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + +
_defaultstan::gm::valued_argumentprotected
_descriptionstan::gm::argumentprotected
_namestan::gm::argumentprotected
_value_typestan::gm::valued_argumentprotected
arg(const std::string name)stan::gm::argumentinlinevirtual
argument()stan::gm::argumentinline
argument(const std::string name)stan::gm::argumentinline
compute_indent(const int depth)stan::gm::argumentinline
description() const stan::gm::argumentinline
find_arg(std::string name, std::string prefix, std::vector< std::string > &valid_paths)stan::gm::argumentinlinevirtual
help_widthstan::gm::argumentprotected
indent_widthstan::gm::argumentprotected
is_default()=0stan::gm::valued_argumentpure virtual
name() const stan::gm::argumentinline
parse_args(std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)stan::gm::argumentinlinevirtual
print(std::ostream *s, const int depth, const char prefix)stan::gm::valued_argumentinlinevirtual
print_help(std::ostream *s, const int depth, const bool recurse=false)stan::gm::valued_argumentinlinevirtual
print_valid()=0stan::gm::valued_argumentpure virtual
print_value()=0stan::gm::valued_argumentpure virtual
probe_args(argument *base_arg, std::stringstream &s)stan::gm::argumentinlinevirtual
split_arg(const std::string &arg, std::string &name, std::string &value)stan::gm::argumentinlinestatic
~argument()stan::gm::argumentinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1valued__argument.html b/doc/api/html/classstan_1_1gm_1_1valued__argument.html new file mode 100644 index 00000000000..5c51b93e241 --- /dev/null +++ b/doc/api/html/classstan_1_1gm_1_1valued__argument.html @@ -0,0 +1,437 @@ + + + + + +Stan: stan::gm::valued_argument Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::valued_argument Class Referenceabstract
+
+
+ +

#include <valued_argument.hpp>

+
+Inheritance diagram for stan::gm::valued_argument:
+
+
+ + +stan::gm::argument +stan::gm::list_argument +stan::gm::singleton_argument< T > +stan::gm::arg_engine +stan::gm::arg_method +stan::gm::arg_metric +stan::gm::arg_optimize_algo +stan::gm::arg_sample_algo +stan::gm::arg_test +stan::gm::arg_adapt_delta +stan::gm::arg_adapt_engaged +stan::gm::arg_adapt_gamma +stan::gm::arg_adapt_init_buffer +stan::gm::arg_adapt_kappa +stan::gm::arg_adapt_t0 +stan::gm::arg_adapt_term_buffer +stan::gm::arg_adapt_window +stan::gm::arg_data_file +stan::gm::arg_diagnostic_file +stan::gm::arg_id +stan::gm::arg_init +stan::gm::arg_init_alpha +stan::gm::arg_int_time +stan::gm::arg_iter +stan::gm::arg_max_depth +stan::gm::arg_num_samples +stan::gm::arg_num_warmup +stan::gm::arg_output_file +stan::gm::arg_refresh +stan::gm::arg_save_iterations +stan::gm::arg_save_warmup +stan::gm::arg_seed +stan::gm::arg_stepsize +stan::gm::arg_stepsize_jitter +stan::gm::arg_test_grad_eps +stan::gm::arg_test_grad_err +stan::gm::arg_thin +stan::gm::arg_tolerance + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

virtual void print (std::ostream *s, const int depth, const char prefix)
 
virtual void print_help (std::ostream *s, const int depth, const bool recurse=false)
 
virtual std::string print_value ()=0
 
virtual std::string print_valid ()=0
 
virtual bool is_default ()=0
 
- Public Member Functions inherited from stan::gm::argument
 argument ()
 
 argument (const std::string name)
 
virtual ~argument ()
 
std::string name () const
 
std::string description () const
 
virtual bool parse_args (std::vector< std::string > &args, std::ostream *out, std::ostream *err, bool &help_flag)
 
virtual void probe_args (argument *base_arg, std::stringstream &s)
 
virtual void find_arg (std::string name, std::string prefix, std::vector< std::string > &valid_paths)
 
virtual argumentarg (const std::string name)
 
int compute_indent (const int depth)
 
+ + + + + + + + + + + + + + +

+Protected Attributes

std::string _default
 
std::string _value_type
 
- Protected Attributes inherited from stan::gm::argument
std::string _name
 
std::string _description
 
int indent_width
 
int help_width
 
+ + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::gm::argument
static void split_arg (const std::string &arg, std::string &name, std::string &value)
 
+

Detailed Description

+
+

Definition at line 10 of file valued_argument.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + +
virtual bool stan::gm::valued_argument::is_default ()
+
+pure virtual
+
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
virtual void stan::gm::valued_argument::print (std::ostream * s,
const int depth,
const char prefix 
)
+
+inlinevirtual
+
+ +

Implements stan::gm::argument.

+ +

Reimplemented in stan::gm::list_argument.

+ +

Definition at line 14 of file valued_argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
virtual void stan::gm::valued_argument::print_help (std::ostream * s,
const int depth,
const bool recurse = false 
)
+
+inlinevirtual
+
+ +

Implements stan::gm::argument.

+ +

Reimplemented in stan::gm::list_argument.

+ +

Definition at line 26 of file valued_argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
virtual std::string stan::gm::valued_argument::print_valid ()
+
+pure virtual
+
+
+ +
+
+ + + + + +
+ + + + + + + +
virtual std::string stan::gm::valued_argument::print_value ()
+
+pure virtual
+
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
std::string stan::gm::valued_argument::_default
+
+protected
+
+ +

Definition at line 47 of file valued_argument.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
std::string stan::gm::valued_argument::_value_type
+
+protected
+
+ +

Definition at line 48 of file valued_argument.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1gm_1_1valued__argument.png b/doc/api/html/classstan_1_1gm_1_1valued__argument.png new file mode 100644 index 0000000000000000000000000000000000000000..50dd13b6ba954f149d031ce3f0ed65ff669f4f56 GIT binary patch literal 20770 zcmeHv3sh5Q*0vpMo$4qvtzs)mdI{1L0WT;DNa}RFBwS*_8U;eE3d&s|5-uTWbu3dE zpoTyMgxG3`Rv~f?BtWVZDMq19ROA}D1Pqr12oM4!`SuCecG^y7&06#S-+a?yt*$1= zlarJ8ecrvF{p{yGpX~G8vuw%gB?}fTSccpCC$9wy7UCByc;U%!7s8Psk@pDv@0ES- z`*#_QMtJ#jXyR1b?N8yA>Ax?({BqGJ?I?KrTZ)&b_X0Qx`FnVG|E2{C_7&m&v~z## zbHg3OUfuXt&VE~$e|JXQd->04&;Oxp^u+DZq_f$74m{_WreBrUL>J4kFTVBGRM-qU zZi&Z>OALSVK7IQ12k>gi$6Ku4dh3-(tV@>;KR$^Up>^`#-RNXpdO~nOj&Eg3RTI1A zxg7t9nOcFQL9kgS8+zKsR*vX;yKn1`)JxKPCD|{nnEm7J!H)xpGV7Kc%BeuWAV5#YttRW?JcT>S1W!O zg5S4q!wt;Nowsi4>0-u9`}U2n{4c>^nnw6Nd;2gL;}=Y0JmKTz3!}af8FkBVK814* z{@g75e?8b=);1hN_|1|f^fpcVhsf~$JTm$npDYwSz0Wp`$0H~0H{G~a-Pl|r(#QtO zk|NmY5y$g+x~RqVtNhk(t9e@d6=mdPR~)zQ3k}uPfB75)IPDkv>qo-{n-kV7-PSRs zS>ft>^14Vj#w#=rBAK7bF^z4Lu@S|;FuXytyihgTVuiXwnMm!w814|OQJnNfW+u|8 zsv5E=vF-84^Ra8`uHq+E1y$rO%EJzpIUnZZrYooYL&4<7_E$=`Z5JKRk}jXa&-|y= zFZi{8e=i;>bpUpiK+93sdSE|v!i z;S};}@pJs6A1-#O@g+wIioi)nsK)-Br;vj@(37Q-XFd3%#|T{T=60g4DP@Uj8%iV z0~dX$D4&J){f5OnR+sI?4BhD+uWz+#AXfX+Y7D;i?wb;56I|nd{6bE@i0!xBWkW8y zq(17ij`0liQjeh5xSUrGcu!}+r@I&g<>d_H1gp~^Tx0mkopC%SX<;jV>5@#ede#P$$oRc%rEIjPKjGEJ>W7w`_u(eF%JiJXOwqB? zZS=>yrdYP$jzE;E@}@>0yJ6lVqz5r+Lnxf`vz_fz%D&*V`@sfkbXK&t6JuR{TF=-Y z>|DpL`!YtA>ndFu-}JdLp;}i-b7MBmI%AgouDio}`aOJFQ*dR0ZFxmLMfX~MTJU7E zQp2*dcd@4&8aOk$zVma8t@VU{=SA|ELF3Agbmpp?g8v{Dt>=;9*QxY6VUBd-VERyI zxSs2q=K)tX{R&jou~D4dJ&4_Vx4&edkcFnwZeAvP(pgfG_*3HL?fOW!n3DR30<`WP zmMJ}RW?RHM$IqwNbNP+I=CX&4k6DeVx-M@T5?`k_m@STJn5kEs?LX_eisMh!kJVZw zKew*oxFLh2oH?_t=2&K3+;8d$(-p0!;MWZF4H+g_%-%eHxFya!?b~LnhTCGM7qeYc zW=45>)cDzM<_*XN$Xvu-X^wTQ`KRmqD33HIoW_$kj z5&s7Vnst;v-i*&(apU0P=Y7Ay-TLB`%gsgKzdd*Ao&S4p^^+eW3lR6E{lFD?LI3Tn zk)HStZfr%KD;FUOzqA0q8(ighnH$sCurS1tYYf<`KHz6rF*`XeTP3f?=y&6Bo33KE zSov8FdIo7HtsnKel^^R{^M^VUvvCXVuXSh*GFI_`_9uBxh<{anqZMD$neC?qjM zlEox#3>U2{CKHqpP8F*XU9WL+?-yXBQ7U}1IuDJ46*d%@=G!BjjhsH=S0X;BwwR6` zMiy6%jh;}F6|qOXwM?Oe*hW4zRceNk56arab=I-lZo2iQ^<>EEo%OMYLN`iUt~c4c zGx^i?-qX4kcdlPyf}R?mEb;YUcWOyUH zP`@#X<(9u+K_gl(vU&8}Epv+3%_D1nAG-5D`mK1!B@-3=!61-P`~J!N=0qQ6_V!oX z&CnIqdDf``3-pQxqEtiPZ_C)yV0nte)kDx?3K^P7h@j@SU{w zix1##f>Y`uBy2HCI`$;Rc#nK#d<_1QYciz6!#$l(VsM2Wk27i}_SoXWrzThkX`z3+ zIDPutPiWiDD&8lHDnx+s@(YrbTcoY*v=^vT2~%B1)Gurjx!_bYtEgN~-q%CXoLmN5 zDtf(R#uk^EEgenYPCLjaL>SG}UDiCd($tUM4O$^fQya7MGItPSv%l;fLszQF?#eyZ zQLfQ`{T1Ch+d$&|;EQAz<8b4G9QZ=5F4vg5mDy`yXh4!#lJ(fxk8JIAw~+-x8yY|U zHZD8|mRd3_H8l1*#wrU-KlVm{t$^=SQ{S(C44>J|(T<8&z@qBS=Un(&dtj>d&v4;? zytuwwfw7NRNZ8)~!?2z3&b|@S|M7J6Po>a*P3{_l+{K~##DwY?E?f?$L9~)FV4E%F zb6IG4GtAK9Eml)Pb$)4r-i6xFYbIz%hNH%Y?~OY+$4><~(PCZG`Y2rib%LWwXZr`& zHSi1_EPB+s{>_?=?lz5kq7vhMW`i%`qTIZl3?DdQQ;&XaS5hD8z%!eOQs|@#m%yV3 z{U-F-)5cI(X6cgCf&&+;72V^Jqt`!L*Rae(SzM38atE72w|;z`Fy ziJn-+__v;o2fq#30+o-*~J#(W=2L7>|n@-V+$*N)rxf-cRp+6Ec%( zrYenNe-+YGJ^jc!braU1{<{qI-6HyL8v6&C_+OC5Zeg>fb~t+L;OClCYH>Z$xY!to z$6`5D8~^3&>B3X7(-XtJ)kY%BDrdA{SB^B;3m+9nV@ca0v__)QA1@=bWwOEg%|>s{ zw5H2m7Ih}8(8bc##lFcsq)P9?7^OTNk#+N1lw11C0DSjQMnAl+XSNz>mca<08^cWCdXgxP4!{g~m}1Nw~jJcy}R9269q{s@#Tx318mT!|s;=@uSA zlYzLvG&z2bK6c=gop~n{_QPtd$?#%Ij&3iT;Lat*aQ6Ym#iphqygF%`0OXQ7J#p2} z`Ocop*~1%3-W2ur^)$xX^M?w@jg7}gcajfGp}9HU!lDWNb&LmRysI`2sn{-bbbV=; zg-s<|3N9$E`s?zWIp!T!$@QbNp~7VCj>MUYD-1h`f=v%@D}<8L@O%en7d`FJ?9|}6 zEzaCfjpRFL!NeXS&A>!gDrIa#G(r^@YH*tpTs9P-b^E-929}y3<#{|EnJDP;tL}4C z124R1c?LPf?@r9j7b1I4rWvqJc6~pptH5Tru`w~=u!nL~htAp|w7JDjft5Na{V(DC zXGrqDVxiafoiyHVAgwGU`OMAcsL)X6af z*8;EjxVSjoF0Hpvu(>_&8@q-w3&x=97_aptyN-$Q3T$ZCo zx)#PKIvLkGCHf>S6df~c^WUDxlBFfr+1cb;$`aNz-Q&B8dz5V*OoNg|kKZTDlJwK3 zpz;einOu_msx|z)W03!v^f@y&L|V;lB7d5PWM50m2YOk33E3jh8($ntD^Ed+zn2k4 z>gb1JFedudGFZ#+VmDotgi{8;$RB?!7pBcjO|K;D#>F@BaEY|puP(uIB$-`-((b>@ z@t>+${{_o&CrrUv64ON$pLHuBM{3-VlK?5RN?+QRsIvt=wBEsL%68CGxzC$P+v)8? z`)dTJQ>UDG_oC4wUauSJvcz_2zOA*Fb=7Kyrj)&kdbBPxe_T_NW!6_b;cnyKH$Lg@ zy&4kYSBkW6yDsNqQ{UX45;}Q&kfJOQ2eEC^dvmg-#?3i8Ng)xE%F7s%t8mb4tjDhL zO<$TSnN_p#JX*8Idm0s}p{EQ6ZQ<5?WgAYe70jBXlrt<(Yw_l1XGA0H^C538kGf90zbGP74g-@#?WA9*|lr+*sSX`_=Iv;euVzr3hI=lm6UaQHnKgK5y3zQ zLK}~#4z3|qWy?ZOUG*I;IH_yYE(;E6YDl>DWZj;cDZ0*Q+l52buqGRIU(L#R8G@l&uZdGe%`WJ|w zHqXCWG_eYi@m~)5zK!%ZV*Rt;(!aq$y0b~!fese~R9ly``OiOup?KZnMMRW+H~Xdi zFkVRxR##yl&EV(Q;Dgv`>_Epk_Ciio%R^+WZT!m5~cct(2KJBvyNS+=@ zUYN7|H~tK|^X47*Q!VLP%Tam!CilhtHkM5nQyVj51=Hi$ZPk=wnhb`*jgcj#SfC>M zFeyWu64pd-?-)UZ3p;I23jo%yN)hmhY(P`qA7X1;el`F3vP@QElg3x;lu~!+{7^Ba zqi<$q1kZtSh8hvS8K}q}xQ$(S8Aqp7>qBiSbEFhSfheI8U>ks!Sk*A4Lo1=_RS5E5 z)olJQye2^xf*EG|iM(&^5lKakQxszMFbB>^t|zPT$zI`CDD6bm70ToFof#W_M|aya zyRFw&StPf&{wC+82R>fe_-*Z_CJ`cR?eZZg$zl~0A_41fp3}Idd3#|jJ^7H0j4z;a zdnz?KYZyDkpF;;J1B(wOvusIgDKo67;U*BnIu zgMsNW4@}3-BXLi!8;P#}twG6fD{70kL1vjo#vWQFXo;TlrH; z1xA`oy)DD_G0M&w>!G~)Znawk z5+VZ)-M;*a&Ou<{9xn!;!gyG%QS~(Qg6uDpZE4%lw}+5KAo_g|J2UTW6V})_)**6m zt?%@8U={B$X(aE{tq1T_YEsKeeojLhky%A`rD?xFB=zUZibzV0vvDaAjTGbiEZi`- zN6?!5S#-@uiU)FTDYRXho?9|t?*$!kYw6GRK~0u~A2&z;*AD7q@X#PJqAy)CpiRAz zzZ3Rgm0H5j0pA1^zIOtyX_Hkk5sSsTKqO99V;{0E9sVlVJH7+spPT2e*3=5FhaIbA zyAv(VPnjc3{PL@@|@#3`| zPS9Zhc=+yBM){KEy~zoT$U#oD@ZsIiYXB!~Kmo=h=Wc1ky%?4V1CkIfsQdv%DN>l% zr}rN9cyWL^r}a!n;fWS?tGpm5$0X|ScN~v%!PP*>DWDU5SW$0sdnTi-xr*}5Z7r_2 zYoeD{&?G+I5W=1xnI4~vh!mmbL)e4c<2|88l11!Y5urXM3(|X20UHLSWNeDi+3x|( zs+o1EJXacNfn%Dv6RT7kBgnWYi8XKT%uztmf;%tcn0#n>TRR3pR5}%-O#- zb8AXl?+?a^?5k=pJM~K;-SWaoR2RgQVgoT_aQDc-_;|bp1gzngBn3x=W3f{svvlHi zQnb&LsW#=4uKJc!>{Dz$ff)i}APkcm(RuB%aw`W5PMy^zr_Q6>vlEgvQlxD!q{vKH@{@|J#F1&!H-v={ zr)Ld@-gErLOf(sCW;qBiHz2D2ZCd=*K`+b^py#5hxVP~77OSfaS8hEKB2A8akT$+Y z-ALfSy5>jOvE*a(#mrt`m;-a~>^HXOZ{nUO1*RRf<6X2P=Gl|3l)8M1mLq{NTdIre zYzSayttxG21cr-UaWyd0VH>$YW?5UadbVnU@UjfVV}vyo+RF2+J}%7`?gp^Cg#O^; z8162NqnDFvKh?`=XkT(2cy3&R-^F-18eYH9%o8w@%fYb&C4N;@aL9C|Wy>t&FE_|v zrb4-&{l&z)X;D<1e@-;G^UAd7qB2fgt2c&qr)FZiI9%=Ij^W5u+a= zV4mbcZway1Eq?2&crUoR@_Rzlfz6dw8=J;^&$Pk)6?k?oiQ*L^FQWqgU@^d zZ#@D2ySVm%tY*&c=1}}TV+yKP2xZ)7@wrpK=`+Ke)LBe9-PDaG6q;Q0CPplDVBB2Dn9~)*Pl77yzz^tWy;fz@u z13Vu&hH#wICbjd#;4}Z^_wf zKZ9r11KO>DNvV74m%ts~9A5*`HUgmkvx74qBqpfyZj#f}$-rcud}6Xr{;yG$?+u;5 zfIM-o3Ar!6brlO{NN`>Ka>TQ}QtHO6CuPRzl^xm1CAhHwAP^`#ra=K7wkJHuR2^+E zMA74`C1xNDn$1X}(&v==Chg~%O(i|`M>QoSXPLc)01DOL0fi{^k0lTLRwag=fswyX zP)5B=mUouCP#8WP?U}qfaF_p{;-OQcnYbwMXZld_viwb9o9gd(%UJm~;`7ot<#kr- zQmY2i515S)9u@Hl%0!sM@sgvcDk75xG@&42j@d|J#@@r1q$o5jS2`c9gT)J%^?otQ zcNS3;J};>Kh_s2ZhJW$x3-qci>CjY=vYEH*FUdq}&<$P;Rv_9pM?OGqJy??%1Ph;9 z&Xxvg_cGfcrcl`sQ_ZQ267~q@@J$91y^!URQ`Oi-@aVc0R zDiDl(!itG#y91I|BbFw*=rZ)Sq#(e=Yh2_X*@fg5lGaCV&p>m4MELFv64s_^b*$Zp zL#XniPX%H<&XOv!>n!eNPBrcZ$_;E>(N|ORkPt_Dc>WkwF+HL75~?=fYA!+Md7T^N zjbxtGF(mVx!K@`;M3cYyp24WEP|8TO*O3e)Zv`PY8Od=m+`1if;KrV(thp`gG<7VY z&CXlYf^EQ8-rZoT?H%>=%@)sH?${cF@}r6C7JStA#&7^_)&`QJC z+pfd8ZXk^cWmSn*l`i3HAwtBR0}z8ex{xOQP1$-uj`D5~NT8LMTktX+S_dV5S=rA7pMDI9Loj6| z3sXjVLW_Oxo9=*UM^Ln$gJBQBcqG)9ezHc8MF4;L>^5!-Tntcp3OCocOUb8{vF8xd zY;(U{h={H5O{Adr?gF`WewfQz?)**4TRFf~0^j^TLA}-eEJ5uDgSs?l0A_aN(*jsI zTAJloCpICrfz$C{K!(~sm!T|>421${<^gMk7Prk+NRCo(_<$Hp#=p4K{_`vD101B{ zz9rJe?HDQ3hQlI3yxC0$KLC~@(t)6J6cKbR!zUGMv7|T`ux=zp3Qzh(9%>qu>Sn6+ zRkV6^B^Q#zHm))i+o|hlS%L&vZz4BO_Q%6A~eIdWxIj$S@h1V|HVXfDO+ zJji>M1F42T0=sH1JmB;3SU6GWFN8ZL7DPZBNo)W4cGYWCuk2wLV)9zg_Jc!uA*7O; z6Nw0Z!iSo9%1KT~_q^sEw_b7Z-h^Q?hL$B&N(J6Y-`GU}OrBgnZ~^g7=tu_LN?epe zWDhs)>!H*v>nXjpriR&D-DVA-{9Q|H;rItAdBq#JPGCA4j)g#&ar$q13igKd#F-v2 zLY9EVRf*t9aN{j*$Dl`*Gq$=@`fS%j%Y3V)GO1_v;%0m2LK>YTJIijqXtx)7-AEzr z(D6-wTm0K01^|?B!X7H3TrQ>h!TTo!o_3ulC%u{NFkO$bOr?=-q}!8R6{?z^9*T-v z-#H+Z2fU+oMj+=N)Ve?4qpxBoEgK|ifwz;2+^>xT($SHy5dxvxd~4DZ?>PBq0;18M;jnv2L^SUs|r!m^`St ziO)Q!%dq;`wJl=-$pT?jlX9cpEcJLJ+X~!CF9xR|6iBNY532eu$zVo^!Syc4CwKb{(%6ZCz(XIH6XgZ0lSf6 z-+(3X!wpNnz;FMz&U_rfL$pn>ln)Rf%kyAfe@Sl-u7*wmm}|f5p1coUv->BY#hx_v^MNd6T5Ak5hvR=$NU${F=}HlpT)>vSoM$|HFS+O@b7Y=85m z_a5a{GnnmAcpsQ6yk}M7=c7WBWaaa>@za=fEU6KJOufdiW2#wOu7Zs8M@^ zD&K)%6_H>HR$4D1)kYqEgx%ZP44pob7?HFE1t*BY1RJs55QI-!)<=qW^tx+TsTixM z+At^YxCg!cf$)>GoI6zoGP~mSD%upK?v#y$P2%L)j~J>0gVr@bP39AT)MV8bGuJ^v zUX@r3liKQs?+-)c!m|rwI|4c(P<=de9LzmP06el;B<){Bt2~d^ore1+7a_Yk-v565 zezunV72rq@IO^q9`%+>K3le6A2P4`5c+!cFdI-p<1*KrBRc3ro0-vhwYJ1pM)V?$S znfd-yrzdIc1yYQkCdvWl3P^c$QL4*x?Hpt0%uYePx~nvK6$3Z>2G_I}-)UJ%Zo3E^ z_AVHr?llW0yHm;SBkbzFnAeGkTOswmYV#~iC7HsM8JFU>9;X6Tmp$*{C3*=Ho8@k> z2c`905%g6NtvPO9Yc}!e{7v%ELUN)tR|SOVeYoD+T_-P#U90uJ?Y+;syel^#&iI&< zJ`r(G?o4iR+lUK?+;!a(+1NL`TO3_Sd>h9kKvcY+Pic2y_AZpIrWKPj2~2ya zYb08h*NCQ68sY@L3OoYEYLlJNz_E;GU zT;il$r$pbp8h=-uD~J*0H*IY3mFK0AXDZXB9|+Z?=ZfQcB z8HmS%ag$&uI;eVeUNAhu&PX+1+9)3^y*;Xo8dYL9G6E1q<-mFAiiV9D&)WQR4KM|r zTv$34Gk8w6q(w0ntL5xv+5l=!VMwZpL1$w}SPc+zT9E=z^`5@kFA>bO5^Rt%zx*#P z>mnVw%DaeccvYj56|23n3r@z#wYvNM7kXh=#dr7`X1P`*t3mdP8om=lL6oi{zu@xQ zi;bVO*~0vv8pfmKb@g&+x9anvJ0tpta$$Em%iQ;a`TO2~8_}aRyQ730WS<-e(qjkj zjx%*fcp6?xz@ygfjXh`C*9rDn24`!58vr{5;*U!AB;4?5C2lMoK=(21QMH8@8Bi&I zgi4{NW}%Z0l5`mtbZU{Ye|oQJMfl<&a6u{fD=z>aAztJ1?*q6GRDR8WjRDvG)t{Ob z0dIjz8&jLixAPfJWm8ym78XW)+ABM}TT(##OR$Nkcl0~z73T))IvFC*prWrs^)1HN zO(oKGcV!fxak8Jhq_V8~o~PfQiSSzrujG`cwe0UMv^67$v2FMT4j0Nl5Q>(ca%K2T z_SKXf1Of7vqiHW$eww$CY5}4dWWto;r!27i_6$GnntJ#fQ_kKZl6JIB4QmPB!fL2K zX@Ur=mTGF8U*~4iO$@pr^y;HDi#t_+ku9I6S4WCux}Hx2@=l%uxmQ19>(4wk381!d zN3b=OZ z;RFBe=x=2MybRcd5=W$AVj9&A!3#0N(8TWmow5+oDQQ1&FZCyr8aXu}2E0;k_!-T~ z{TEvgCJYNY>?(n zstYmq-E=-C6~WwBMFHS^T)>zoQ+J?oU+Xy@$&%PGd)-VCC0nJL*C%(adDggpG~RQh zs8**F0NvUUx)7=9IL9~q9?xutj(wgLx5pe}&jm<+3?%vS;Ldn0NQWe8DMYQCrO2M% z2srq&%zHj2{R+hF1BjSS&>b$irG;6YS7^6>3XjidL>`~vyzNK$z#bZ!lC*tWOV9}R zG82&C^D}+ZYRYKKk$$(DqG(7t9#<%pC49BU`wt~6GLIJ)R}=2ZEAl&JVr1{Q>OZY~aTe$6HOx=T)QMTYR4+tE> zvk<45mPT)8(CQq|;h6AThX;4Oox<1Q#y*mDMo*d4hDF%G%OYukD|nNri05PE=vF9{ zXW_{ozi2D`&+oYUgu!aoVNmNQN4qp{nm8@EzfBE*B{j!)VTLJFu3Ecewlp?bS*(0OQ=sGcP+4u@VwgwYex_#56?2j>W6KftaQ|dTpN+Li z$;k!sG&DFfyZ@{8XBAo6L+cM@B|5vxY4>N~o6G04p|yuwm!#%=Z8CfaM+x=v!ivs- zMz$rP6CYF_Ws<529t|9Q zvGYCADh~T#p8)neYa`d0j2uf4i&4AA)Jf4!{BYZfz&t^8WWcm`WP^O~Y`YzKP*03x zt%NOm+V;uWKw?Ks49U4FsKHS4>=~1mD zf8Cp7h46X!IP5$5MX~1BVvbA``S-~J_H+tNoD#9ep8nuE4y+%}i1ot}6a+?-4-0~|i7tZ(s&uz0L8o)DwV2?&4F!bm6WbN4yhLQ5cVOiTSN} z3MryAHEFb95aC-7w}MPq1`z(0H}xKxntCLAjj~wIkejlAN%4E308!kBO^SQ_j}`a1 z%?&Mh9%${l6W^v;fcgM>(NEQfN0NXnjXisFN%K8(&M<+u)O?GziSj#nJ7Jrgv*hw- z61s&1y1_(NU0JibwCYI@6Q*%Bq^*TXs6gL49gtM9dzF+ie~enL91|kq<0!IWJx6uL z!CqlL{5ilwzYsxfQ_-D?crg^aGdpz+;_m92TRFD!{qbI?ww!zaE;POknojSXc zX5zK+X7*mO&NXg@mi0DiRQ)(pGLJSAetQj|O=H4J-8rOjtZIKmuIWyI=bt3OB|vaD z0S&6eRHRBIdLDQ6Q}(deH6%b$91UuzqmH6uj>x5ve90PO z{E1uNQ4Z+zLUuK3WFbosq$Rmzrp!5W?d#L{9RDqk-v@2_Al@5Yzdzprd1L}&_eS=v zu@7hRQJt4zIwrjkJUwd*P7LyiAX@<{E!^gsH>GK`OeqBsH;gUFR_ln>?#h8iqp1%F z;b68ZY-oN9!8K$H!Dn;FzSphZIQz_%;*>?Nx&h{fC-tG=NQS3(tiBTuxen;palBHK z67bB@#6cRy!AQdxwcgY)-i$Pifg1eE^#a)IZilm^9_mXnhjRF!3$Rb*VOur?NOa9e zqFeS8k7ExnpwK?Yp6;}nas4~L&`-dST>Z54o=B3J++@F(IRls&0IB@jX07(~ddV>7So9^+GVDus7xy)nbwK zp+ZfCtw(bY6XUYXx$S$E6HOFw@eKF~$PoO z^2D5(OK0}%+~7m&>8_ivZ@{@C#XbR?mI#zY`s5wx2E+%+=pJQxiuN+ww}LmN8oVhD zMr1n*XX+!wD`{vtjR3R&wHGu3Xp`RJzzF_y&r+LOJ7YbHx+3;=?_HB$1`jk`fZOHy Kr@}uTKK(y0Zvlw_ literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1io_1_1cmd__line-members.html b/doc/api/html/classstan_1_1io_1_1cmd__line-members.html new file mode 100644 index 00000000000..49eec75284d --- /dev/null +++ b/doc/api/html/classstan_1_1io_1_1cmd__line-members.html @@ -0,0 +1,120 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::io::cmd_line Member List
+
+
+ +

This is the complete list of members for stan::io::cmd_line, including all inherited members.

+ + + + + + + + + +
bare(size_t n, T &x) const stan::io::cmd_lineinline
bare_size() const stan::io::cmd_lineinline
cmd_line(int argc, const char *argv[])stan::io::cmd_lineinline
command()stan::io::cmd_lineinline
has_flag(const std::string &flag) const stan::io::cmd_lineinline
has_key(const std::string &key) const stan::io::cmd_lineinline
print(std::ostream &out) const stan::io::cmd_lineinline
val(const std::string &key, T &x) const stan::io::cmd_lineinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1io_1_1cmd__line.html b/doc/api/html/classstan_1_1io_1_1cmd__line.html new file mode 100644 index 00000000000..9a89dc21cf7 --- /dev/null +++ b/doc/api/html/classstan_1_1io_1_1cmd__line.html @@ -0,0 +1,478 @@ + + + + + +Stan: stan::io::cmd_line Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::io::cmd_line Class Reference
+
+
+ +

Parses and stores command-line arguments. + More...

+ +

#include <cmd_line.hpp>

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 cmd_line (int argc, const char *argv[])
 Construct a command-line argument object from the specified command-line arguments.
 
std::string command ()
 Returns the name of the command itself.
 
bool has_key (const std::string &key) const
 Return true if the specified key is defined.
 
template<typename T >
bool val (const std::string &key, T &x) const
 Returns the value for the key provided.
 
bool has_flag (const std::string &flag) const
 Return true if the specified flag is defined.
 
size_t bare_size () const
 Return the number of bare arguments.
 
template<typename T >
bool bare (size_t n, T &x) const
 Returns the bare argument.
 
void print (std::ostream &out) const
 Print a human readable parsed form of the command-line arguments to the specified output stream.
 
+

Detailed Description

+

Parses and stores command-line arguments.

+

Command-line arguments are organized into four types.

+

Command: The first argument (at index 0) is just the command itself. There method command() retrieves the command.

+

Key/Value: The second type of argument is a key-value pair, which must be in the form –key=val. Two hyphens are used to separate arguments from negated numbers. The method has_key(const std::string&) indicates if there is a key and val(const std::string&,T&) writes its value into a reference (whose type is templated; any type understand by the output operator >> is acceptable.

+

Flag: Flags are specified as –flag. The method has_flag(const std::string&) tests if a flag is present.

+

Bare Argument: Bare arguments are any arguments that are not prefixed with two hyphens (). The method bare_size() returns the number of bare arguments and they are retrieved with the generic method bare(const std::string&,T&).

+ +

Definition at line 113 of file cmd_line.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
stan::io::cmd_line::cmd_line (int argc,
const char * argv[] 
)
+
+inline
+
+ +

Construct a command-line argument object from the specified command-line arguments.

+
Parameters
+ + + +
argcNumber of arguments.
argvArgument strings.
+
+
+ +

Definition at line 142 of file cmd_line.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::io::cmd_line::bare (size_t n,
T & x 
) const
+
+inline
+
+ +

Returns the bare argument.

+

If the specified index is valid for bare arguments, write the bare argument at the specified index into the specified reference, and otherwise return false without modifying the reference.

+
Parameters
+ + + +
[in]nBare argument position.
[out]xReference to result.
+
+
+
Returns
true if there were enough bare arguments.
+
Template Parameters
+ + +
TType of value returned.
+
+
+ +

Definition at line 230 of file cmd_line.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
size_t stan::io::cmd_line::bare_size () const
+
+inline
+
+ +

Return the number of bare arguments.

+
Returns
Number of bare arguments.
+ +

Definition at line 212 of file cmd_line.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
std::string stan::io::cmd_line::command ()
+
+inline
+
+ +

Returns the name of the command itself.

+

The command is always supplied as the first argument (at index 0).

+
Returns
Name of command.
+ +

Definition at line 155 of file cmd_line.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
bool stan::io::cmd_line::has_flag (const std::string & flag) const
+
+inline
+
+ +

Return true if the specified flag is defined.

+
Parameters
+ + +
flagFlag to test.
+
+
+
Returns
true if flag is defined.
+ +

Definition at line 203 of file cmd_line.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
bool stan::io::cmd_line::has_key (const std::string & key) const
+
+inline
+
+ +

Return true if the specified key is defined.

+
Parameters
+ + +
keyKey to test.
+
+
+
Returns
true if it has a value.
+ +

Definition at line 165 of file cmd_line.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::io::cmd_line::print (std::ostream & out) const
+
+inline
+
+ +

Print a human readable parsed form of the command-line arguments to the specified output stream.

+
Parameters
+ + +
[out]outOutput stream.
+
+
+ +

Definition at line 245 of file cmd_line.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::io::cmd_line::val (const std::string & key,
T & x 
) const
+
+inline
+
+ +

Returns the value for the key provided.

+

If the specified key is defined, write the value of the key into the specified reference and return true, otherwise do not modify the reference and return false.

+

The conversions defined by std::ostream are used to convert the base string value to the specified type. Thus this method will work as long as operator>>() is defined for the specified type.

+
Parameters
+ + + +
[in]keyKey whose value is returned.
[out]xReference to value.
+
+
+
Returns
False if the key is not found, and true if it is found.
+
Template Parameters
+ + +
Typeof value.
+
+
+ +

Definition at line 189 of file cmd_line.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1io_1_1csv__writer-members.html b/doc/api/html/classstan_1_1io_1_1csv__writer-members.html new file mode 100644 index 00000000000..49bb2ae5d93 --- /dev/null +++ b/doc/api/html/classstan_1_1io_1_1csv__writer-members.html @@ -0,0 +1,121 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::io::csv_writer Member List
+
+
+ +

This is the complete list of members for stan::io::csv_writer, including all inherited members.

+ + + + + + + + + + +
comma()stan::io::csv_writerinline
csv_writer(std::ostream &o)stan::io::csv_writerinline
newline()stan::io::csv_writerinline
write(int n)stan::io::csv_writerinline
write(double x)stan::io::csv_writerinline
write(const Eigen::Matrix< double, R, C > &m)stan::io::csv_writerinline
write(const std::string &s)stan::io::csv_writerinline
write_col_major(const Eigen::Matrix< double, R, C > &m)stan::io::csv_writerinline
write_row_major(const Eigen::Matrix< double, R, C > &m)stan::io::csv_writerinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1io_1_1csv__writer.html b/doc/api/html/classstan_1_1io_1_1csv__writer.html new file mode 100644 index 00000000000..8234e7b31f9 --- /dev/null +++ b/doc/api/html/classstan_1_1io_1_1csv__writer.html @@ -0,0 +1,457 @@ + + + + + +Stan: stan::io::csv_writer Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::io::csv_writer Class Reference
+
+
+ +

Writes Stan variables in comma-separated-value format to an output stream. + More...

+ +

#include <csv_writer.hpp>

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

void comma ()
 Write a comma.
 
 csv_writer (std::ostream &o)
 Construct a CSV writer that writes to the specified output stream.
 
void newline ()
 Write a newline character.
 
void write (int n)
 Write a value.
 
void write (double x)
 Write a value.
 
template<int R, int C>
void write_row_major (const Eigen::Matrix< double, R, C > &m)
 Write a value.
 
template<int R, int C>
void write_col_major (const Eigen::Matrix< double, R, C > &m)
 Write a value in column-major order.
 
template<int R, int C>
void write (const Eigen::Matrix< double, R, C > &m)
 
void write (const std::string &s)
 Write a value.
 
+

Detailed Description

+

Writes Stan variables in comma-separated-value format to an output stream.

+

All output is written to the same line and separated by commas. Use the newline() method to advance to the next line of CSV output.

+ +

Definition at line 21 of file csv_writer.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::io::csv_writer::csv_writer (std::ostream & o)
+
+inline
+
+ +

Construct a CSV writer that writes to the specified output stream.

+
Parameters
+ + +
oOutput stream on which to write.
+
+
+ +

Definition at line 49 of file csv_writer.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + +
void stan::io::csv_writer::comma ()
+
+inline
+
+ +

Write a comma.

+

On the first call do nothing, subsequently write a comma.

+ +

Definition at line 34 of file csv_writer.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
void stan::io::csv_writer::newline ()
+
+inline
+
+ +

Write a newline character.

+

End a line of output and start a new line. This method needs to be called rather than writing a newline to the output stream because it resets the comma flag.

+ +

Definition at line 61 of file csv_writer.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::io::csv_writer::write (int n)
+
+inline
+
+ +

Write a value.

+

Write the specified integer to the output stream on the current line.

+
Parameters
+ + +
nInteger to write.
+
+
+ +

Definition at line 74 of file csv_writer.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::io::csv_writer::write (double x)
+
+inline
+
+ +

Write a value.

+

Write the specified double to the output stream on the current line.

+
Parameters
+ + +
xDouble to write.
+
+
+ +

Definition at line 87 of file csv_writer.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + + +
void stan::io::csv_writer::write (const Eigen::Matrix< double, R, C > & m)
+
+inline
+
+ +

Definition at line 125 of file csv_writer.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::io::csv_writer::write (const std::string & s)
+
+inline
+
+ +

Write a value.

+

Write the specified string to the output stream with quotes around it and quotes inside escaped to double quotes.

+
Parameters
+ + +
sString to write.
+
+
+ +

Definition at line 138 of file csv_writer.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + + +
void stan::io::csv_writer::write_col_major (const Eigen::Matrix< double, R, C > & m)
+
+inline
+
+ +

Write a value in column-major order.

+

Write the specified matrix to the output stream in column-major order.

+
Parameters
+ + +
mMatrix of doubles to write.
+
+
+ +

Definition at line 117 of file csv_writer.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + + +
void stan::io::csv_writer::write_row_major (const Eigen::Matrix< double, R, C > & m)
+
+inline
+
+ +

Write a value.

+

Write the specified matrix to the output stream in row-major order.

+
Parameters
+ + +
mMatrix to write.
+
+
+ +

Definition at line 101 of file csv_writer.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1io_1_1dump-members.html b/doc/api/html/classstan_1_1io_1_1dump-members.html new file mode 100644 index 00000000000..0f4bc766e44 --- /dev/null +++ b/doc/api/html/classstan_1_1io_1_1dump-members.html @@ -0,0 +1,133 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::io::dump Member List
+
+
+ +

This is the complete list of members for stan::io::dump, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + +
add_vec(std::stringstream &msg, const std::vector< size_t > &dims) const stan::io::var_contextinline
contains_i(const std::string &name) const stan::io::dumpinlinevirtual
contains_r(const std::string &name) const stan::io::dumpinlinevirtual
dims_i(const std::string &name) const stan::io::dumpinlinevirtual
dims_r(const std::string &name) const stan::io::dumpinlinevirtual
dump(std::istream &in)stan::io::dumpinline
names_i(std::vector< std::string > &names) const stan::io::dumpinlinevirtual
names_r(std::vector< std::string > &names) const stan::io::dumpinlinevirtual
remove(const std::string &name)stan::io::dumpinline
to_vec()stan::io::var_contextinlinestatic
to_vec(size_t n1)stan::io::var_contextinlinestatic
to_vec(size_t n1, size_t n2)stan::io::var_contextinlinestatic
to_vec(size_t n1, size_t n2, size_t n3)stan::io::var_contextinlinestatic
to_vec(size_t n1, size_t n2, size_t n3, size_t n4)stan::io::var_contextinlinestatic
to_vec(size_t n1, size_t n2, size_t n3, size_t n4, size_t n5)stan::io::var_contextinlinestatic
to_vec(size_t n1, size_t n2, size_t n3, size_t n4, size_t n5, size_t n6)stan::io::var_contextinlinestatic
to_vec(size_t n1, size_t n2, size_t n3, size_t n4, size_t n5, size_t n6, size_t n7)stan::io::var_contextinlinestatic
to_vec(size_t n1, size_t n2, size_t n3, size_t n4, size_t n5, size_t n6, size_t n7, size_t n8)stan::io::var_contextinlinestatic
validate_dims(const std::string &stage, const std::string &name, const std::string &base_type, const std::vector< size_t > &dims_declared) const stan::io::var_contextinline
vals_i(const std::string &name) const stan::io::dumpinlinevirtual
vals_r(const std::string &name) const stan::io::dumpinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1io_1_1dump.html b/doc/api/html/classstan_1_1io_1_1dump.html new file mode 100644 index 00000000000..048921a8845 --- /dev/null +++ b/doc/api/html/classstan_1_1io_1_1dump.html @@ -0,0 +1,565 @@ + + + + + +Stan: stan::io::dump Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::io::dump Class Reference
+
+
+ +

Represents named arrays with dimensions. + More...

+ +

#include <dump.hpp>

+
+Inheritance diagram for stan::io::dump:
+
+
+ + +stan::io::var_context + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 dump (std::istream &in)
 Construct a dump object from the specified input stream.
 
bool contains_r (const std::string &name) const
 Return true if this dump contains the specified variable name is defined.
 
bool contains_i (const std::string &name) const
 Return true if this dump contains an integer valued array with the specified name.
 
std::vector< double > vals_r (const std::string &name) const
 Return the double values for the variable with the specified name or null.
 
std::vector< size_t > dims_r (const std::string &name) const
 Return the dimensions for the double variable with the specified name.
 
std::vector< int > vals_i (const std::string &name) const
 Return the integer values for the variable with the specified name.
 
std::vector< size_t > dims_i (const std::string &name) const
 Return the dimensions for the integer variable with the specified name.
 
virtual void names_r (std::vector< std::string > &names) const
 Return a list of the names of the floating point variables in the dump.
 
virtual void names_i (std::vector< std::string > &names) const
 Return a list of the names of the integer variables in the dump.
 
bool remove (const std::string &name)
 Remove variable from the object.
 
- Public Member Functions inherited from stan::io::var_context
void add_vec (std::stringstream &msg, const std::vector< size_t > &dims) const
 
void validate_dims (const std::string &stage, const std::string &name, const std::string &base_type, const std::vector< size_t > &dims_declared) const
 
+ + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::io::var_context
static std::vector< size_t > to_vec ()
 
static std::vector< size_t > to_vec (size_t n1)
 
static std::vector< size_t > to_vec (size_t n1, size_t n2)
 
static std::vector< size_t > to_vec (size_t n1, size_t n2, size_t n3)
 
static std::vector< size_t > to_vec (size_t n1, size_t n2, size_t n3, size_t n4)
 
static std::vector< size_t > to_vec (size_t n1, size_t n2, size_t n3, size_t n4, size_t n5)
 
static std::vector< size_t > to_vec (size_t n1, size_t n2, size_t n3, size_t n4, size_t n5, size_t n6)
 
static std::vector< size_t > to_vec (size_t n1, size_t n2, size_t n3, size_t n4, size_t n5, size_t n6, size_t n7)
 
static std::vector< size_t > to_vec (size_t n1, size_t n2, size_t n3, size_t n4, size_t n5, size_t n6, size_t n7, size_t n8)
 
+

Detailed Description

+

Represents named arrays with dimensions.

+

A dump object represents a dump of named arrays with dimensions. The arrays may have any dimensionality. The values for an array are typed to double or int.

+

See dump_reader for more information on the format.

+

Dump objects are created from reading dump files from an input stream.

+

The dimensions and values of variables may be accessed by name.

+ +

Definition at line 817 of file dump.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::io::dump::dump (std::istream & in)
+
+inline
+
+ +

Construct a dump object from the specified input stream.

+

Warning: This method does not close the input stream.

+
Parameters
+ + +
inInput stream from which to read.
+
+
+ +

Definition at line 849 of file dump.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
bool stan::io::dump::contains_i (const std::string & name) const
+
+inlinevirtual
+
+ +

Return true if this dump contains an integer valued array with the specified name.

+
Parameters
+ + +
nameVariable name to test.
+
+
+
Returns
true if the variable name has an integer array value.
+ +

Implements stan::io::var_context.

+ +

Definition at line 887 of file dump.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
bool stan::io::dump::contains_r (const std::string & name) const
+
+inlinevirtual
+
+ +

Return true if this dump contains the specified variable name is defined.

+

This method returns true even if the values are all integers.

+
Parameters
+ + +
nameVariable name to test.
+
+
+
Returns
true if the variable exists.
+ +

Implements stan::io::var_context.

+ +

Definition at line 875 of file dump.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
std::vector<size_t> stan::io::dump::dims_i (const std::string & name) const
+
+inlinevirtual
+
+ +

Return the dimensions for the integer variable with the specified name.

+
Parameters
+ + +
nameName of variable.
+
+
+
Returns
Dimensions of variable.
+ +

Implements stan::io::var_context.

+ +

Definition at line 949 of file dump.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
std::vector<size_t> stan::io::dump::dims_r (const std::string & name) const
+
+inlinevirtual
+
+ +

Return the dimensions for the double variable with the specified name.

+
Parameters
+ + +
nameName of variable.
+
+
+
Returns
Dimensions of variable.
+ +

Implements stan::io::var_context.

+ +

Definition at line 919 of file dump.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
virtual void stan::io::dump::names_i (std::vector< std::string > & names) const
+
+inlinevirtual
+
+ +

Return a list of the names of the integer variables in the dump.

+
Parameters
+ + +
namesVector to store the list of names in.
+
+
+ +

Implements stan::io::var_context.

+ +

Definition at line 978 of file dump.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
virtual void stan::io::dump::names_r (std::vector< std::string > & names) const
+
+inlinevirtual
+
+ +

Return a list of the names of the floating point variables in the dump.

+
Parameters
+ + +
namesVector to store the list of names in.
+
+
+ +

Implements stan::io::var_context.

+ +

Definition at line 962 of file dump.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
bool stan::io::dump::remove (const std::string & name)
+
+inline
+
+ +

Remove variable from the object.

+
Parameters
+ + +
nameName of the variable to remove.
+
+
+
Returns
If variable is removed returns true, else returns false.
+ +

Definition at line 995 of file dump.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
std::vector<int> stan::io::dump::vals_i (const std::string & name) const
+
+inlinevirtual
+
+ +

Return the integer values for the variable with the specified name.

+
Parameters
+ + +
nameName of variable.
+
+
+
Returns
Values.
+ +

Implements stan::io::var_context.

+ +

Definition at line 935 of file dump.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
std::vector<double> stan::io::dump::vals_r (const std::string & name) const
+
+inlinevirtual
+
+ +

Return the double values for the variable with the specified name or null.

+
Parameters
+ + +
nameName of variable.
+
+
+
Returns
Values of variable.
+ +

Implements stan::io::var_context.

+ +

Definition at line 898 of file dump.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1io_1_1dump.png b/doc/api/html/classstan_1_1io_1_1dump.png new file mode 100644 index 0000000000000000000000000000000000000000..1d2ee422bf589bae7bacf71a953dab3f07766cf6 GIT binary patch literal 531 zcmV+u0_^>XP)vTJkN^MxkN^Mxkifve1&Q1r00008bW%=J0RR90|NsC0)yh;d0004^NklT#Y#ThbJcjw{RfA`@8&}^DTc@(iC8=4<)EvIB=b1b|#Y(m| znX0+hZk5MLWU97h*J`-DXJZ%YYr6KXh;^BVH7|vH#x7OP<$Hx)LJ!#|^}J$xy|C}? z;QYKV*?HT?>|K)O*Sa&eHP0Qn?8|*w%C%ri=;{t_`nTH0wWoFh$7(f$sHbAVtntd{T;u^8nq3Q7^PY|m*K>6g&uU(Z8_nJq zH;jF7u$S!84+hn4o_DT!?(;cty`FL?Ij+8(-RpCJPj#8RvjJk&*#NO>%r-M?qaU|5 V8XA$0o`(Pc002ovPDHLkV1j-H1110f literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1io_1_1dump__reader-members.html b/doc/api/html/classstan_1_1io_1_1dump__reader-members.html new file mode 100644 index 00000000000..fdbfaecd188 --- /dev/null +++ b/doc/api/html/classstan_1_1io_1_1dump__reader-members.html @@ -0,0 +1,121 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::io::dump_reader Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1io_1_1dump__reader.html b/doc/api/html/classstan_1_1io_1_1dump__reader.html new file mode 100644 index 00000000000..1efb687ec06 --- /dev/null +++ b/doc/api/html/classstan_1_1io_1_1dump__reader.html @@ -0,0 +1,428 @@ + + + + + +Stan: stan::io::dump_reader Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::io::dump_reader Class Reference
+
+
+ +

Reads data from S-plus dump format. + More...

+ +

#include <dump.hpp>

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 dump_reader ()
 Construct a reader for standard input.
 
 dump_reader (std::istream &in)
 Construct a reader for the specified input stream.
 
 ~dump_reader ()
 Destroy this reader.
 
std::string name ()
 Return the name of the most recently read variable.
 
std::vector< size_t > dims ()
 Return the dimensions of the most recently read variable.
 
bool is_int ()
 Checks if the last item read is integer.
 
std::vector< int > int_values ()
 Returns the integer values from the last item if the last item read was an integer and the empty vector otherwise.
 
std::vector< double > double_values ()
 Returns the floating point values from the last item if the last item read contained floating point values and the empty vector otherwise.
 
bool next ()
 Read the next value from the input stream, returning true if successful and false if no further input may be read.
 
+

Detailed Description

+

Reads data from S-plus dump format.

+

A dump_reader parses data from the S-plus dump format, a human-readable ASCII representation of arbitrarily dimensioned arrays of integers and arrays of floating point values.

+

Stan's dump reader is limited to reading integers, scalars and arrays of arbitrary dimensionality of integers and scalars. It is able to read from a file consisting of a sequence of dumped variables.

+

There cannot be any NA (i.e., undefined) values, because these cannot be represented as double values.

+

The dump reader class follows a standard scanner pattern. The method next() is called to scan the next input. The type, dimensions, and values of the input is then available through method calls. Here, the type is either double or integer, and the values are the name of the variable and its array of values. If there is a single value, the dimension array is empty. For a list, the dimension array contains a single entry for the number of values. For an array, the dimensions are the dimensions of the array.

+

Reads are performed in an "S-compatible" mode whereby a string such as "1" or "-127" denotes and integer, whereas a string such as "1." or "0.9e-5" represents a floating point value.

+

For dumping, arrays are indexed in last-index major fashion, which corresponds to column-major order for matrices represented as two-dimensional arrays. As a result, the first indices change fastest. For instance, if there is an three-dimensional array x with dimensions [2,2,2], then there are 8 values, provided in the order

+

[0,0,0], [1,0,0], [0,1,0], [1,1,0], [0,0,1], [1,0,1], [0,1,1], [1,1,1].

+

definitions ::= definition+

+

definition ::= name ("->" | '=') value optional_semicolon

+

name ::= char* | ''' char* ''' | '"' char* '"'

+

value ::= value<int> | value<double>

+

value<T> ::= T | seq<T> | 'struct' '(' seq<T> ',' ".Dim" '=' seq<int> ')'

+

seq<int> ::= int ':' int | cseq<int>

+

seq<double> ::= cseq<double>

+

cseq<T> ::= 'c' '(' T % ',' ')'

+ +

Definition at line 427 of file dump.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::io::dump_reader::dump_reader ()
+
+inline
+
+ +

Construct a reader for standard input.

+ +

Definition at line 709 of file dump.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
stan::io::dump_reader::dump_reader (std::istream & in)
+
+inline
+
+ +

Construct a reader for the specified input stream.

+
Parameters
+ + +
inInput stream reference from which to read.
+
+
+ +

Definition at line 716 of file dump.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
stan::io::dump_reader::~dump_reader ()
+
+inline
+
+ +

Destroy this reader.

+ +

Definition at line 721 of file dump.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + +
std::vector<size_t> stan::io::dump_reader::dims ()
+
+inline
+
+ +

Return the dimensions of the most recently read variable.

+
Returns
Last dimensions.
+ +

Definition at line 739 of file dump.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
std::vector<double> stan::io::dump_reader::double_values ()
+
+inline
+
+ +

Returns the floating point values from the last item if the last item read contained floating point values and the empty vector otherwise.

+
Returns
Floating point values of last item.
+ +

Definition at line 771 of file dump.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
std::vector<int> stan::io::dump_reader::int_values ()
+
+inline
+
+ +

Returns the integer values from the last item if the last item read was an integer and the empty vector otherwise.

+
Returns
Integer values of last item.
+ +

Definition at line 760 of file dump.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
bool stan::io::dump_reader::is_int ()
+
+inline
+
+ +

Checks if the last item read is integer.

+

Return true if the value(s) in the most recently read item are integer values and false if they are floating point.

+ +

Definition at line 750 of file dump.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
std::string stan::io::dump_reader::name ()
+
+inline
+
+ +

Return the name of the most recently read variable.

+
Returns
Name of most recently read variable.
+ +

Definition at line 729 of file dump.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
bool stan::io::dump_reader::next ()
+
+inline
+
+ +

Read the next value from the input stream, returning true if successful and false if no further input may be read.

+
Returns
Return true if a fresh variable was read.
+ +

Definition at line 782 of file dump.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1io_1_1dump__writer-members.html b/doc/api/html/classstan_1_1io_1_1dump__writer-members.html new file mode 100644 index 00000000000..575bc782cf9 --- /dev/null +++ b/doc/api/html/classstan_1_1io_1_1dump__writer-members.html @@ -0,0 +1,119 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::io::dump_writer Member List
+
+
+ +

This is the complete list of members for stan::io::dump_writer, including all inherited members.

+ + + + + + + + +
dump_list(std::string name, std::vector< T > xs)stan::io::dump_writerinline
dump_structure(std::string, std::vector< size_t > dims, std::vector< T > xs)stan::io::dump_writerinline
dump_var(std::string name, T x)stan::io::dump_writerinline
dump_writer()stan::io::dump_writerinline
dump_writer(std::ostream &out)stan::io::dump_writerinline
write(const std::string &name, const T &x)stan::io::dump_writerinline
~dump_writer()stan::io::dump_writerinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1io_1_1dump__writer.html b/doc/api/html/classstan_1_1io_1_1dump__writer.html new file mode 100644 index 00000000000..424eb0eae55 --- /dev/null +++ b/doc/api/html/classstan_1_1io_1_1dump__writer.html @@ -0,0 +1,466 @@ + + + + + +Stan: stan::io::dump_writer Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::io::dump_writer Class Reference
+
+
+ +

Writes data into the S-plus dump format. + More...

+ +

#include <dump.hpp>

+ + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 dump_writer ()
 Construct a dump writer writing to standard output.
 
 dump_writer (std::ostream &out)
 Construct a dump writer writing to the specified output stream.
 
 ~dump_writer ()
 Destroy this writer.
 
template<typename T >
void write (const std::string &name, const T &x)
 Write a variable with the specified name and value.
 
template<typename T >
void dump_structure (std::string, std::vector< size_t > dims, std::vector< T > xs)
 Write a structure variable with the specified name, dimensions, and integer or double values.
 
template<typename T >
void dump_list (std::string name, std::vector< T > xs)
 Write a list variable with the specified name and integer or double values.
 
template<typename T >
void dump_var (std::string name, T x)
 Write a list variable with the specified name and integer or double values.
 
+

Detailed Description

+

Writes data into the S-plus dump format.

+

A dump_writer writes data into the S-plus dump format, a human-readable ASCII representation of arbitrarily dimensioned arrays of integers and arrays of floating point values.

+ +

Definition at line 36 of file dump.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::io::dump_writer::dump_writer ()
+
+inline
+
+ +

Construct a dump writer writing to standard output.

+ +

Definition at line 265 of file dump.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
stan::io::dump_writer::dump_writer (std::ostream & out)
+
+inline
+
+ +

Construct a dump writer writing to the specified output stream.

+
Parameters
+ + +
outOutput stream for writing.
+
+
+ +

Definition at line 273 of file dump.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
stan::io::dump_writer::~dump_writer ()
+
+inline
+
+ +

Destroy this writer.

+ +

Definition at line 278 of file dump.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::io::dump_writer::dump_list (std::string name,
std::vector< T > xs 
)
+
+inline
+
+ +

Write a list variable with the specified name and integer or double values.

+
Parameters
+ + + +
nameName of variable.
xsValues of variable.
+
+
+
Template Parameters
+ + +
Tdouble or int.
+
+
+ +

Definition at line 333 of file dump.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::io::dump_writer::dump_structure (std::string ,
std::vector< size_t > dims,
std::vector< T > xs 
)
+
+inline
+
+ +

Write a structure variable with the specified name, dimensions, and integer or double values.

+

name Name of variable.

+
Parameters
+ + + +
dimsDimensions of variable.
xsValues of variable in last-index major format.
+
+
+
Template Parameters
+ + +
Tdouble or int.
+
+
+ +

Definition at line 315 of file dump.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::io::dump_writer::dump_var (std::string name,
x 
)
+
+inline
+
+ +

Write a list variable with the specified name and integer or double values.

+
Parameters
+ + + +
nameName of variable.
xValue of variable.
+
+
+
Template Parameters
+ + +
Tdouble or int.
+
+
+ +

Definition at line 348 of file dump.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::io::dump_writer::write (const std::string & name,
const T & x 
)
+
+inline
+
+ +

Write a variable with the specified name and value.

+

This method will work for basic types consisting of doubles and integers, Eigen types for vectors, row vectors and matrices. If this method works for a type, it will work for a standard vector of that type.

+

Information concerning final type organization into Eigen vectors, row vectors and matrices is lost.

+

All data is written in final-index dominant ordering.

+
Parameters
+ + + +
nameName of variable to write.
xValue of variable.
+
+
+
Template Parameters
+ + +
Typeof variable being written.
+
+
+ +

Definition at line 299 of file dump.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1io_1_1mcmc__writer-members.html b/doc/api/html/classstan_1_1io_1_1mcmc__writer-members.html new file mode 100644 index 00000000000..cc161ed2e7d --- /dev/null +++ b/doc/api/html/classstan_1_1io_1_1mcmc__writer-members.html @@ -0,0 +1,121 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::io::mcmc_writer< M > Member List
+
+
+ +

This is the complete list of members for stan::io::mcmc_writer< M >, including all inherited members.

+ + + + + + + + + + +
mcmc_writer(std::ostream *sample_stream, std::ostream *diagnostic_stream, std::ostream *msg_stream=0)stan::io::mcmc_writer< M >inline
print_adapt_finish(stan::mcmc::base_mcmc *sampler, std::ostream *stream)stan::io::mcmc_writer< M >inline
print_adapt_finish(stan::mcmc::base_mcmc *sampler)stan::io::mcmc_writer< M >inline
print_diagnostic_names(stan::mcmc::sample sample, stan::mcmc::base_mcmc *sampler, M &model)stan::io::mcmc_writer< M >inline
print_diagnostic_params(stan::mcmc::sample &sample, stan::mcmc::base_mcmc *sampler)stan::io::mcmc_writer< M >inline
print_sample_names(stan::mcmc::sample &sample, stan::mcmc::base_mcmc *sampler, M &model)stan::io::mcmc_writer< M >inline
print_sample_params(RNG &rng, stan::mcmc::sample &sample, stan::mcmc::base_mcmc &sampler, M &model)stan::io::mcmc_writer< M >inline
print_timing(double warmDeltaT, double sampleDeltaT, std::ostream *stream, const char prefix= '\0')stan::io::mcmc_writer< M >inline
print_timing(double warmDeltaT, double sampleDeltaT)stan::io::mcmc_writer< M >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1io_1_1mcmc__writer.html b/doc/api/html/classstan_1_1io_1_1mcmc__writer.html new file mode 100644 index 00000000000..15eeb420a31 --- /dev/null +++ b/doc/api/html/classstan_1_1io_1_1mcmc__writer.html @@ -0,0 +1,524 @@ + + + + + +Stan: stan::io::mcmc_writer< M > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::io::mcmc_writer< M > Class Template Reference
+
+
+ +

#include <mcmc_writer.hpp>

+ + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 mcmc_writer (std::ostream *sample_stream, std::ostream *diagnostic_stream, std::ostream *msg_stream=0)
 
void print_sample_names (stan::mcmc::sample &sample, stan::mcmc::base_mcmc *sampler, M &model)
 
template<class RNG >
void print_sample_params (RNG &rng, stan::mcmc::sample &sample, stan::mcmc::base_mcmc &sampler, M &model)
 
void print_adapt_finish (stan::mcmc::base_mcmc *sampler, std::ostream *stream)
 
void print_adapt_finish (stan::mcmc::base_mcmc *sampler)
 
void print_diagnostic_names (stan::mcmc::sample sample, stan::mcmc::base_mcmc *sampler, M &model)
 
void print_diagnostic_params (stan::mcmc::sample &sample, stan::mcmc::base_mcmc *sampler)
 
void print_timing (double warmDeltaT, double sampleDeltaT, std::ostream *stream, const char prefix= '\0')
 
void print_timing (double warmDeltaT, double sampleDeltaT)
 
+

Detailed Description

+

template<class M>
+class stan::io::mcmc_writer< M >

+ + +

Definition at line 18 of file mcmc_writer.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<class M>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
stan::io::mcmc_writer< M >::mcmc_writer (std::ostream * sample_stream,
std::ostream * diagnostic_stream,
std::ostream * msg_stream = 0 
)
+
+inline
+
+ +

Definition at line 22 of file mcmc_writer.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<class M>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::io::mcmc_writer< M >::print_adapt_finish (stan::mcmc::base_mcmcsampler,
std::ostream * stream 
)
+
+inline
+
+ +

Definition at line 82 of file mcmc_writer.hpp.

+ +
+
+ +
+
+
+template<class M>
+ + + + + +
+ + + + + + + + +
void stan::io::mcmc_writer< M >::print_adapt_finish (stan::mcmc::base_mcmcsampler)
+
+inline
+
+ +

Definition at line 91 of file mcmc_writer.hpp.

+ +
+
+ +
+
+
+template<class M>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::io::mcmc_writer< M >::print_diagnostic_names (stan::mcmc::sample sample,
stan::mcmc::base_mcmcsampler,
M & model 
)
+
+inline
+
+ +

Definition at line 96 of file mcmc_writer.hpp.

+ +
+
+ +
+
+
+template<class M>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::io::mcmc_writer< M >::print_diagnostic_params (stan::mcmc::samplesample,
stan::mcmc::base_mcmcsampler 
)
+
+inline
+
+ +

Definition at line 120 of file mcmc_writer.hpp.

+ +
+
+ +
+
+
+template<class M>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::io::mcmc_writer< M >::print_sample_names (stan::mcmc::samplesample,
stan::mcmc::base_mcmcsampler,
M & model 
)
+
+inline
+
+ +

Definition at line 30 of file mcmc_writer.hpp.

+ +
+
+ +
+
+
+template<class M>
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::io::mcmc_writer< M >::print_sample_params (RNG & rng,
stan::mcmc::samplesample,
stan::mcmc::base_mcmcsampler,
M & model 
)
+
+inline
+
+ +

Definition at line 51 of file mcmc_writer.hpp.

+ +
+
+ +
+
+
+template<class M>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::io::mcmc_writer< M >::print_timing (double warmDeltaT,
double sampleDeltaT,
std::ostream * stream,
const char prefix = '\0' 
)
+
+inline
+
+ +

Definition at line 139 of file mcmc_writer.hpp.

+ +
+
+ +
+
+
+template<class M>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::io::mcmc_writer< M >::print_timing (double warmDeltaT,
double sampleDeltaT 
)
+
+inline
+
+ +

Definition at line 156 of file mcmc_writer.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1io_1_1reader-members.html b/doc/api/html/classstan_1_1io_1_1reader-members.html new file mode 100644 index 00000000000..fee47cf0a91 --- /dev/null +++ b/doc/api/html/classstan_1_1io_1_1reader-members.html @@ -0,0 +1,213 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::io::reader< T > Member List
+
+
+ +

This is the complete list of members for stan::io::reader< T >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
available()stan::io::reader< T >inline
available_i()stan::io::reader< T >inline
cholesky_factor(size_t M, size_t N)stan::io::reader< T >inline
cholesky_factor_constrain(size_t M, size_t N)stan::io::reader< T >inline
cholesky_factor_constrain(size_t M, size_t N, T &lp)stan::io::reader< T >inline
corr()stan::io::reader< T >inline
corr_constrain()stan::io::reader< T >inline
corr_constrain(T &lp)stan::io::reader< T >inline
corr_matrix(size_t k)stan::io::reader< T >inline
corr_matrix_constrain(size_t k)stan::io::reader< T >inline
corr_matrix_constrain(size_t k, T &lp)stan::io::reader< T >inline
cov_matrix(size_t k)stan::io::reader< T >inline
cov_matrix_constrain(size_t k)stan::io::reader< T >inline
cov_matrix_constrain(size_t k, T &lp)stan::io::reader< T >inline
integer()stan::io::reader< T >inline
integer_constrain()stan::io::reader< T >inline
integer_constrain(T &)stan::io::reader< T >inline
integer_lb(int lb)stan::io::reader< T >inline
integer_lb_constrain(int lb)stan::io::reader< T >inline
integer_lb_constrain(int lb, T &)stan::io::reader< T >inline
integer_lub(int lb, int ub)stan::io::reader< T >inline
integer_lub_constrain(int lb, int ub)stan::io::reader< T >inline
integer_lub_constrain(int lb, int ub, T &)stan::io::reader< T >inline
integer_ub(int ub)stan::io::reader< T >inline
integer_ub_constrain(int ub)stan::io::reader< T >inline
integer_ub_constrain(int ub, T &)stan::io::reader< T >inline
map_matrix_t typedefstan::io::reader< T >
map_row_vector_t typedefstan::io::reader< T >
map_vector_t typedefstan::io::reader< T >
matrix(size_t m, size_t n)stan::io::reader< T >inline
matrix_constrain(size_t m, size_t n)stan::io::reader< T >inline
matrix_constrain(size_t m, size_t n, T &)stan::io::reader< T >inline
matrix_lb(const TL lb, size_t m, size_t n)stan::io::reader< T >inline
matrix_lb_constrain(const TL lb, size_t m, size_t n)stan::io::reader< T >inline
matrix_lb_constrain(const TL lb, size_t m, size_t n, T &lp)stan::io::reader< T >inline
matrix_lub(const TL lb, const TU ub, size_t m, size_t n)stan::io::reader< T >inline
matrix_lub_constrain(const TL lb, const TU ub, size_t m, size_t n)stan::io::reader< T >inline
matrix_lub_constrain(const TL lb, const TU ub, size_t m, size_t n, T &lp)stan::io::reader< T >inline
matrix_t typedefstan::io::reader< T >
matrix_ub(const TU ub, size_t m, size_t n)stan::io::reader< T >inline
matrix_ub_constrain(const TU ub, size_t m, size_t n)stan::io::reader< T >inline
matrix_ub_constrain(const TU ub, size_t m, size_t n, T &lp)stan::io::reader< T >inline
ordered(size_t k)stan::io::reader< T >inline
ordered_constrain(size_t k)stan::io::reader< T >inline
ordered_constrain(size_t k, T &lp)stan::io::reader< T >inline
positive_ordered(size_t k)stan::io::reader< T >inline
positive_ordered_constrain(size_t k)stan::io::reader< T >inline
positive_ordered_constrain(size_t k, T &lp)stan::io::reader< T >inline
prob()stan::io::reader< T >inline
prob_constrain()stan::io::reader< T >inline
prob_constrain(T &lp)stan::io::reader< T >inline
reader(std::vector< T > &data_r, std::vector< int > &data_i)stan::io::reader< T >inline
row_vector(size_t m)stan::io::reader< T >inline
row_vector_constrain(size_t m)stan::io::reader< T >inline
row_vector_constrain(size_t m, T &)stan::io::reader< T >inline
row_vector_lb(const TL lb, size_t m)stan::io::reader< T >inline
row_vector_lb_constrain(const TL lb, size_t m)stan::io::reader< T >inline
row_vector_lb_constrain(const TL lb, size_t m, T &lp)stan::io::reader< T >inline
row_vector_lub(const TL lb, const TU ub, size_t m)stan::io::reader< T >inline
row_vector_lub_constrain(const TL lb, const TU ub, size_t m)stan::io::reader< T >inline
row_vector_lub_constrain(const TL lb, const TU ub, size_t m, T &lp)stan::io::reader< T >inline
row_vector_t typedefstan::io::reader< T >
row_vector_ub(const TU ub, size_t m)stan::io::reader< T >inline
row_vector_ub_constrain(const TU ub, size_t m)stan::io::reader< T >inline
row_vector_ub_constrain(const TU ub, size_t m, T &lp)stan::io::reader< T >inline
scalar()stan::io::reader< T >inline
scalar_constrain()stan::io::reader< T >inline
scalar_constrain(T &)stan::io::reader< T >inline
scalar_lb(const TL lb)stan::io::reader< T >inline
scalar_lb_constrain(const TL lb)stan::io::reader< T >inline
scalar_lb_constrain(const TL lb, T &lp)stan::io::reader< T >inline
scalar_lub(const TL lb, const TU ub)stan::io::reader< T >inline
scalar_lub_constrain(const TL lb, const TU ub)stan::io::reader< T >inline
scalar_lub_constrain(TL lb, TU ub, T &lp)stan::io::reader< T >inline
scalar_pos()stan::io::reader< T >inline
scalar_pos_constrain()stan::io::reader< T >inline
scalar_pos_constrain(T &lp)stan::io::reader< T >inline
scalar_ub(TU ub)stan::io::reader< T >inline
scalar_ub_constrain(const TU ub)stan::io::reader< T >inline
scalar_ub_constrain(const TU ub, T &lp)stan::io::reader< T >inline
simplex(size_t k)stan::io::reader< T >inline
simplex_constrain(size_t k)stan::io::reader< T >inline
simplex_constrain(size_t k, T &lp)stan::io::reader< T >inline
std_vector(size_t m)stan::io::reader< T >inline
unit_vector(size_t k)stan::io::reader< T >inline
unit_vector_constrain(size_t k)stan::io::reader< T >inline
unit_vector_constrain(size_t k, T &lp)stan::io::reader< T >inline
vector(size_t m)stan::io::reader< T >inline
vector_constrain(size_t m)stan::io::reader< T >inline
vector_constrain(size_t m, T &)stan::io::reader< T >inline
vector_lb(const TL lb, size_t m)stan::io::reader< T >inline
vector_lb_constrain(const TL lb, size_t m)stan::io::reader< T >inline
vector_lb_constrain(const TL lb, size_t m, T &lp)stan::io::reader< T >inline
vector_lub(const TL lb, const TU ub, size_t m)stan::io::reader< T >inline
vector_lub_constrain(const TL lb, const TU ub, size_t m)stan::io::reader< T >inline
vector_lub_constrain(const TL lb, const TU ub, size_t m, T &lp)stan::io::reader< T >inline
vector_t typedefstan::io::reader< T >
vector_ub(const TU ub, size_t m)stan::io::reader< T >inline
vector_ub_constrain(const TU ub, size_t m)stan::io::reader< T >inline
vector_ub_constrain(const TU ub, size_t m, T &lp)stan::io::reader< T >inline
~reader()stan::io::reader< T >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1io_1_1reader.html b/doc/api/html/classstan_1_1io_1_1reader.html new file mode 100644 index 00000000000..f01c3e3b44a --- /dev/null +++ b/doc/api/html/classstan_1_1io_1_1reader.html @@ -0,0 +1,4761 @@ + + + + + +Stan: stan::io::reader< T > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::io::reader< T > Class Template Reference
+
+
+ +

A stream-based reader for integer, scalar, vector, matrix and array data types, with Jacobian calculations. + More...

+ +

#include <reader.hpp>

+ + + + + + + + + + + + + + +

+Public Types

typedef Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
matrix_t
 
typedef Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
vector_t
 
typedef Eigen::Matrix< T,
+1, Eigen::Dynamic > 
row_vector_t
 
typedef Eigen::Map< matrix_tmap_matrix_t
 
typedef Eigen::Map< vector_tmap_vector_t
 
typedef Eigen::Map< row_vector_tmap_row_vector_t
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 reader (std::vector< T > &data_r, std::vector< int > &data_i)
 Construct a variable reader using the specified vectors as the source of scalar and integer values for data.
 
 ~reader ()
 Destroy this variable reader.
 
size_t available ()
 Return the number of scalars remaining to be read.
 
size_t available_i ()
 Return the number of integers remaining to be read.
 
int integer ()
 Return the next integer in the integer sequence.
 
int integer_constrain ()
 Return the next integer in the integer sequence.
 
int integer_constrain (T &)
 Return the next integer in the integer sequence.
 
scalar ()
 Return the next scalar in the sequence.
 
scalar_constrain ()
 Return the next scalar.
 
scalar_constrain (T &)
 Return the next scalar in the sequence, incrementing the specified reference with the log absolute Jacobian determinant.
 
std::vector< T > std_vector (size_t m)
 Return a standard library vector of the specified dimensionality made up of the next scalars.
 
vector_t vector (size_t m)
 Return a column vector of specified dimensionality made up of the next scalars.
 
vector_t vector_constrain (size_t m)
 Return a column vector of specified dimensionality made up of the next scalars.
 
vector_t vector_constrain (size_t m, T &)
 Return a column vector of specified dimensionality made up of the next scalars.
 
row_vector_t row_vector (size_t m)
 Return a row vector of specified dimensionality made up of the next scalars.
 
row_vector_t row_vector_constrain (size_t m)
 Return a row vector of specified dimensionality made up of the next scalars.
 
row_vector_t row_vector_constrain (size_t m, T &)
 Return a row vector of specified dimensionality made up of the next scalars.
 
matrix_t matrix (size_t m, size_t n)
 Return a matrix of the specified dimensionality made up of the next scalars arranged in column-major order.
 
matrix_t matrix_constrain (size_t m, size_t n)
 Return a matrix of the specified dimensionality made up of the next scalars arranged in column-major order.
 
matrix_t matrix_constrain (size_t m, size_t n, T &)
 Return a matrix of the specified dimensionality made up of the next scalars arranged in column-major order.
 
int integer_lb (int lb)
 Return the next integer, checking that it is greater than or equal to the specified lower bound.
 
int integer_lb_constrain (int lb)
 Return the next integer, checking that it is greater than or equal to the specified lower bound.
 
int integer_lb_constrain (int lb, T &)
 Return the next integer, checking that it is greater than or equal to the specified lower bound.
 
int integer_ub (int ub)
 Return the next integer, checking that it is less than or equal to the specified upper bound.
 
int integer_ub_constrain (int ub)
 Return the next integer, checking that it is less than or equal to the specified upper bound.
 
int integer_ub_constrain (int ub, T &)
 Return the next integer, checking that it is less than or equal to the specified upper bound.
 
int integer_lub (int lb, int ub)
 Return the next integer, checking that it is less than or equal to the specified upper bound.
 
int integer_lub_constrain (int lb, int ub)
 Return the next integer, checking that it is less than or equal to the specified upper bound.
 
int integer_lub_constrain (int lb, int ub, T &)
 Return the next integer, checking that it is less than or equal to the specified upper bound.
 
scalar_pos ()
 Return the next scalar, checking that it is positive.
 
scalar_pos_constrain ()
 Return the next scalar, transformed to be positive.
 
scalar_pos_constrain (T &lp)
 Return the next scalar transformed to be positive, incrementing the specified reference with the log absolute determinant of the Jacobian.
 
template<typename TL >
scalar_lb (const TL lb)
 Return the next scalar, checking that it is greater than or equal to the specified lower bound.
 
template<typename TL >
scalar_lb_constrain (const TL lb)
 Return the next scalar transformed to have the specified lower bound.
 
template<typename TL >
scalar_lb_constrain (const TL lb, T &lp)
 Return the next scalar transformed to have the specified lower bound, incrementing the specified reference with the log of the absolute Jacobian determinant of the transform.
 
template<typename TU >
scalar_ub (TU ub)
 Return the next scalar, checking that it is less than or equal to the specified upper bound.
 
template<typename TU >
scalar_ub_constrain (const TU ub)
 Return the next scalar transformed to have the specified upper bound.
 
template<typename TU >
scalar_ub_constrain (const TU ub, T &lp)
 Return the next scalar transformed to have the specified upper bound, incrementing the specified reference with the log of the absolute Jacobian determinant of the transform.
 
template<typename TL , typename TU >
scalar_lub (const TL lb, const TU ub)
 Return the next scalar, checking that it is between the specified lower and upper bound.
 
template<typename TL , typename TU >
scalar_lub_constrain (const TL lb, const TU ub)
 Return the next scalar transformed to be between the specified lower and upper bounds.
 
template<typename TL , typename TU >
scalar_lub_constrain (TL lb, TU ub, T &lp)
 Return the next scalar transformed to be between the the specified lower and upper bounds.
 
prob ()
 Return the next scalar, checking that it is a valid value for a probability, between 0 (inclusive) and 1 (inclusive).
 
prob_constrain ()
 Return the next scalar transformed to be a probability between 0 and 1.
 
prob_constrain (T &lp)
 Return the next scalar transformed to be a probability between 0 and 1, incrementing the specified reference with the log of the absolute Jacobian determinant.
 
corr ()
 Return the next scalar, checking that it is a valid value for a correlation, between -1 (inclusive) and 1 (inclusive).
 
corr_constrain ()
 Return the next scalar transformed to be a correlation between -1 and 1.
 
corr_constrain (T &lp)
 Return the next scalar transformed to be a (partial) correlation between -1 and 1, incrementing the specified reference with the log of the absolute Jacobian determinant.
 
vector_t unit_vector (size_t k)
 Return a unit_vector of the specified size made up of the next scalars.
 
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
unit_vector_constrain (size_t k)
 Return the next unit_vector transformed vector of the specified length.
 
vector_t unit_vector_constrain (size_t k, T &lp)
 Return the next unit_vector of the specified size (using one fewer unconstrained scalars), incrementing the specified reference with the log absolute Jacobian determinant.
 
vector_t simplex (size_t k)
 Return a simplex of the specified size made up of the next scalars.
 
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
simplex_constrain (size_t k)
 Return the next simplex transformed vector of the specified length.
 
vector_t simplex_constrain (size_t k, T &lp)
 Return the next simplex of the specified size (using one fewer unconstrained scalars), incrementing the specified reference with the log absolute Jacobian determinant.
 
vector_t ordered (size_t k)
 Return the next vector of specified size containing values in ascending order.
 
vector_t ordered_constrain (size_t k)
 Return the next ordered vector of the specified length.
 
vector_t ordered_constrain (size_t k, T &lp)
 Return the next ordered vector of the specified size, incrementing the specified reference with the log absolute Jacobian of the determinant.
 
vector_t positive_ordered (size_t k)
 Return the next vector of specified size containing positive values in ascending order.
 
vector_t positive_ordered_constrain (size_t k)
 Return the next positive ordered vector of the specified length.
 
vector_t positive_ordered_constrain (size_t k, T &lp)
 Return the next positive_ordered vector of the specified size, incrementing the specified reference with the log absolute Jacobian of the determinant.
 
matrix_t cholesky_factor (size_t M, size_t N)
 Return the next Cholesky factor with the specified dimensionality, reading it directly without transforms.
 
matrix_t cholesky_factor_constrain (size_t M, size_t N)
 Return the next Cholesky factor with the specified dimensionality, reading from an unconstrained vector of the appropriate size.
 
matrix_t cholesky_factor_constrain (size_t M, size_t N, T &lp)
 Return the next Cholesky factor with the specified dimensionality, reading from an unconstrained vector of the appropriate size, and increment the log probability reference with the log Jacobian adjustment for the transform.
 
matrix_t cov_matrix (size_t k)
 Return the next covariance matrix with the specified dimensionality.
 
matrix_t cov_matrix_constrain (size_t k)
 Return the next covariance matrix of the specified dimensionality.
 
matrix_t cov_matrix_constrain (size_t k, T &lp)
 Return the next covariance matrix of the specified dimensionality, incrementing the specified reference with the log absolute Jacobian determinant.
 
matrix_t corr_matrix (size_t k)
 Returns the next correlation matrix of the specified dimensionality.
 
matrix_t corr_matrix_constrain (size_t k)
 Return the next correlation matrix of the specified dimensionality.
 
matrix_t corr_matrix_constrain (size_t k, T &lp)
 Return the next correlation matrix of the specified dimensionality, incrementing the specified reference with the log absolute Jacobian determinant.
 
template<typename TL >
vector_t vector_lb (const TL lb, size_t m)
 
template<typename TL >
vector_t vector_lb_constrain (const TL lb, size_t m)
 
template<typename TL >
vector_t vector_lb_constrain (const TL lb, size_t m, T &lp)
 
template<typename TL >
row_vector_t row_vector_lb (const TL lb, size_t m)
 
template<typename TL >
row_vector_t row_vector_lb_constrain (const TL lb, size_t m)
 
template<typename TL >
row_vector_t row_vector_lb_constrain (const TL lb, size_t m, T &lp)
 
template<typename TL >
matrix_t matrix_lb (const TL lb, size_t m, size_t n)
 
template<typename TL >
matrix_t matrix_lb_constrain (const TL lb, size_t m, size_t n)
 
template<typename TL >
matrix_t matrix_lb_constrain (const TL lb, size_t m, size_t n, T &lp)
 
template<typename TU >
vector_t vector_ub (const TU ub, size_t m)
 
template<typename TU >
vector_t vector_ub_constrain (const TU ub, size_t m)
 
template<typename TU >
vector_t vector_ub_constrain (const TU ub, size_t m, T &lp)
 
template<typename TU >
row_vector_t row_vector_ub (const TU ub, size_t m)
 
template<typename TU >
row_vector_t row_vector_ub_constrain (const TU ub, size_t m)
 
template<typename TU >
row_vector_t row_vector_ub_constrain (const TU ub, size_t m, T &lp)
 
template<typename TU >
matrix_t matrix_ub (const TU ub, size_t m, size_t n)
 
template<typename TU >
matrix_t matrix_ub_constrain (const TU ub, size_t m, size_t n)
 
template<typename TU >
matrix_t matrix_ub_constrain (const TU ub, size_t m, size_t n, T &lp)
 
template<typename TL , typename TU >
vector_t vector_lub (const TL lb, const TU ub, size_t m)
 
template<typename TL , typename TU >
vector_t vector_lub_constrain (const TL lb, const TU ub, size_t m)
 
template<typename TL , typename TU >
vector_t vector_lub_constrain (const TL lb, const TU ub, size_t m, T &lp)
 
template<typename TL , typename TU >
row_vector_t row_vector_lub (const TL lb, const TU ub, size_t m)
 
template<typename TL , typename TU >
row_vector_t row_vector_lub_constrain (const TL lb, const TU ub, size_t m)
 
template<typename TL , typename TU >
row_vector_t row_vector_lub_constrain (const TL lb, const TU ub, size_t m, T &lp)
 
template<typename TL , typename TU >
matrix_t matrix_lub (const TL lb, const TU ub, size_t m, size_t n)
 
template<typename TL , typename TU >
matrix_t matrix_lub_constrain (const TL lb, const TU ub, size_t m, size_t n)
 
template<typename TL , typename TU >
matrix_t matrix_lub_constrain (const TL lb, const TU ub, size_t m, size_t n, T &lp)
 
+

Detailed Description

+

template<typename T>
+class stan::io::reader< T >

+ +

A stream-based reader for integer, scalar, vector, matrix and array data types, with Jacobian calculations.

+

The template parameter T represents the type of scalars and the values in vectors and matrices. The only requirement on the template type T is that a double can be copied into it, as in

+

T t = 0.0;

+

This includes double itself and the reverse-mode algorithmic differentiation class stan::agrad::var.

+

For transformed values, the scalar type parameter T must support the transforming operations, such as exp(x) for positive-bounded variables. It must also support equality and inequality tests with double values.

+
Template Parameters
+ + +
TBasic scalar type.
+
+
+ +

Definition at line 34 of file reader.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T >
+ + + + +
typedef Eigen::Map<matrix_t> stan::io::reader< T >::map_matrix_t
+
+ +

Definition at line 67 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + +
typedef Eigen::Map<row_vector_t> stan::io::reader< T >::map_row_vector_t
+
+ +

Definition at line 69 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + +
typedef Eigen::Map<vector_t> stan::io::reader< T >::map_vector_t
+
+ +

Definition at line 68 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + +
typedef Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> stan::io::reader< T >::matrix_t
+
+ +

Definition at line 63 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + +
typedef Eigen::Matrix<T,1,Eigen::Dynamic> stan::io::reader< T >::row_vector_t
+
+ +

Definition at line 65 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + +
typedef Eigen::Matrix<T,Eigen::Dynamic,1> stan::io::reader< T >::vector_t
+
+ +

Definition at line 64 of file reader.hpp.

+ +
+
+

Constructor & Destructor Documentation

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
stan::io::reader< T >::reader (std::vector< T > & data_r,
std::vector< int > & data_i 
)
+
+inline
+
+ +

Construct a variable reader using the specified vectors as the source of scalar and integer values for data.

+

This class holds a reference to the specified data vectors.

+

Attempting to read beyond the end of the data or integer value sequences raises a runtime exception.

+
Parameters
+ + + +
data_rSequence of scalar values.
data_iSequence of integer values.
+
+
+ +

Definition at line 83 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
stan::io::reader< T >::~reader ()
+
+inline
+
+ +

Destroy this variable reader.

+ +

Definition at line 94 of file reader.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
size_t stan::io::reader< T >::available ()
+
+inline
+
+ +

Return the number of scalars remaining to be read.

+
Returns
Number of scalars left to read.
+ +

Definition at line 101 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
size_t stan::io::reader< T >::available_i ()
+
+inline
+
+ +

Return the number of integers remaining to be read.

+
Returns
Number of integers left to read.
+ +

Definition at line 110 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
matrix_t stan::io::reader< T >::cholesky_factor (size_t M,
size_t N 
)
+
+inline
+
+ +

Return the next Cholesky factor with the specified dimensionality, reading it directly without transforms.

+
Parameters
+ + + +
MRows of Cholesky factor
NColumns of Cholesky factor
+
+
+
Returns
Next Cholesky factor.
+
Exceptions
+ + +
std::domain_errorif the matrix is not a valid Cholesky factor.
+
+
+ +

Definition at line 945 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
matrix_t stan::io::reader< T >::cholesky_factor_constrain (size_t M,
size_t N 
)
+
+inline
+
+ +

Return the next Cholesky factor with the specified dimensionality, reading from an unconstrained vector of the appropriate size.

+
Parameters
+ + + +
MRows of Cholesky factor
NColumns of Cholesky factor
+
+
+
Returns
Next Cholesky factor.
+
Exceptions
+ + +
std::domain_errorif the matrix is not a valid Cholesky factor.
+
+
+ +

Definition at line 962 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
matrix_t stan::io::reader< T >::cholesky_factor_constrain (size_t M,
size_t N,
T & lp 
)
+
+inline
+
+ +

Return the next Cholesky factor with the specified dimensionality, reading from an unconstrained vector of the appropriate size, and increment the log probability reference with the log Jacobian adjustment for the transform.

+
Parameters
+ + + + +
MRows of Cholesky factor
NColumns of Cholesky factor
[in,out]lplog probability
+
+
+
Returns
Next Cholesky factor.
+
Exceptions
+ + +
std::domain_errorif the matrix is not a valid Cholesky factor.
+
+
+ +

Definition at line 980 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
T stan::io::reader< T >::corr ()
+
+inline
+
+ +

Return the next scalar, checking that it is a valid value for a correlation, between -1 (inclusive) and 1 (inclusive).

+

See stan::math::check_bounded(T).

+
Returns
Next correlation value.
+
Exceptions
+ + +
std::runtime_errorif the value is not valid for a correlation
+
+
+ +

Definition at line 720 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
T stan::io::reader< T >::corr_constrain ()
+
+inline
+
+ +

Return the next scalar transformed to be a correlation between -1 and 1.

+

See stan::prob::corr_constrain(T).

+
Returns
The next scalar transformed to a correlation.
+ +

Definition at line 734 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
T stan::io::reader< T >::corr_constrain (T & lp)
+
+inline
+
+ +

Return the next scalar transformed to be a (partial) correlation between -1 and 1, incrementing the specified reference with the log of the absolute Jacobian determinant.

+

See stan::prob::corr_constrain(T,T&).

+
Parameters
+ + +
lpThe reference to the variable holding the log probability to increment.
+
+
+
Returns
The next scalar transformed to a correlation.
+ +

Definition at line 749 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
matrix_t stan::io::reader< T >::corr_matrix (size_t k)
+
+inline
+
+ +

Returns the next correlation matrix of the specified dimensionality.

+

See stan::math::check_corr_matrix(Matrix).

+
Parameters
+ + +
kDimensionality of correlation matrix.
+
+
+
Returns
Next correlation matrix of the specified dimensionality.
+
Exceptions
+ + +
std::runtime_errorif the matrix is not a correlation matrix
+
+
+ +

Definition at line 1041 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
matrix_t stan::io::reader< T >::corr_matrix_constrain (size_t k)
+
+inline
+
+ +

Return the next correlation matrix of the specified dimensionality.

+

See stan::prob::corr_matrix_constrain(Matrix).

+
Parameters
+ + +
kDimensionality of correlation matrix.
+
+
+
Returns
Next correlation matrix of the specified dimensionality.
+ +

Definition at line 1055 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
matrix_t stan::io::reader< T >::corr_matrix_constrain (size_t k,
T & lp 
)
+
+inline
+
+ +

Return the next correlation matrix of the specified dimensionality, incrementing the specified reference with the log absolute Jacobian determinant.

+

See stan::prob::corr_matrix_constrain(Matrix,T&).

+
Parameters
+ + + +
kDimensionality of the (square) correlation matrix.
lpLog probability reference to increment.
+
+
+
Returns
The next correlation matrix of the specified dimensionality.
+ +

Definition at line 1070 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
matrix_t stan::io::reader< T >::cov_matrix (size_t k)
+
+inline
+
+ +

Return the next covariance matrix with the specified dimensionality.

+

See stan::math::check_cov_matrix(Matrix).

+
Parameters
+ + +
kDimensionality of covariance matrix.
+
+
+
Returns
Next covariance matrix of the specified dimensionality.
+
Exceptions
+ + +
std::runtime_errorif the matrix is not a valid covariance matrix
+
+
+ +

Definition at line 996 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
matrix_t stan::io::reader< T >::cov_matrix_constrain (size_t k)
+
+inline
+
+ +

Return the next covariance matrix of the specified dimensionality.

+

See stan::prob::cov_matrix_constrain(Matrix).

+
Parameters
+ + +
kDimensionality of covariance matrix.
+
+
+
Returns
Next covariance matrix of the specified dimensionality.
+ +

Definition at line 1010 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
matrix_t stan::io::reader< T >::cov_matrix_constrain (size_t k,
T & lp 
)
+
+inline
+
+ +

Return the next covariance matrix of the specified dimensionality, incrementing the specified reference with the log absolute Jacobian determinant.

+

See stan::prob::cov_matrix_constrain(Matrix,T&).

+
Parameters
+ + + +
kDimensionality of the (square) covariance matrix.
lpLog probability reference to increment.
+
+
+
Returns
The next covariance matrix of the specified dimensionality.
+ +

Definition at line 1026 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
int stan::io::reader< T >::integer ()
+
+inline
+
+ +

Return the next integer in the integer sequence.

+
Returns
Next integer value.
+ +

Definition at line 119 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
int stan::io::reader< T >::integer_constrain ()
+
+inline
+
+ +

Return the next integer in the integer sequence.

+

This form is a convenience method to make compiling easier; its behavior is the same as int()

+
Returns
Next integer value.
+ +

Definition at line 133 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
int stan::io::reader< T >::integer_constrain (T & )
+
+inline
+
+ +

Return the next integer in the integer sequence.

+

This form is a convenience method to make compiling easier; its behavior is the same as integer()

+
Returns
Next integer value.
+ +

Definition at line 144 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
int stan::io::reader< T >::integer_lb (int lb)
+
+inline
+
+ +

Return the next integer, checking that it is greater than or equal to the specified lower bound.

+
Parameters
+ + +
lbLower bound.
+
+
+
Returns
Next integer read.
+
Exceptions
+ + +
std::runtime_errorIf the next integer read is not greater than or equal to the lower bound.
+
+
+ +

Definition at line 331 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
int stan::io::reader< T >::integer_lb_constrain (int lb)
+
+inline
+
+ +

Return the next integer, checking that it is greater than or equal to the specified lower bound.

+
Parameters
+ + +
lbLower bound.
+
+
+
Returns
Next integer read.
+
Exceptions
+ + +
std::runtime_errorIf the next integer read is not greater than or equal to the lower bound.
+
+
+ +

Definition at line 347 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
int stan::io::reader< T >::integer_lb_constrain (int lb,
T &  
)
+
+inline
+
+ +

Return the next integer, checking that it is greater than or equal to the specified lower bound.

+
Parameters
+ + +
lbLower bound. lp Log probability (ignored because no Jacobian)
+
+
+
Returns
Next integer read.
+
Exceptions
+ + +
std::runtime_errorIf the next integer read is not greater than or equal to the lower bound.
+
+
+ +

Definition at line 360 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
int stan::io::reader< T >::integer_lub (int lb,
int ub 
)
+
+inline
+
+ +

Return the next integer, checking that it is less than or equal to the specified upper bound.

+

Even if the upper bounds and lower bounds are not consistent, the next integer value will be consumed.

+
Parameters
+ + + +
lbLower bound.
ubUpper bound.
+
+
+
Returns
Next integer read.
+
Exceptions
+ + +
std::runtime_errorIf the next integer read is not less than or equal to the upper bound.
+
+
+ +

Definition at line 419 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
int stan::io::reader< T >::integer_lub_constrain (int lb,
int ub 
)
+
+inline
+
+ +

Return the next integer, checking that it is less than or equal to the specified upper bound.

+
Parameters
+ + + +
lbLower bound.
ubUpper bound.
+
+
+
Returns
Next integer read.
+
Exceptions
+ + +
std::runtime_errorIf the next integer read is not less than or equal to the upper bound.
+
+
+ +

Definition at line 443 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
int stan::io::reader< T >::integer_lub_constrain (int lb,
int ub,
T &  
)
+
+inline
+
+ +

Return the next integer, checking that it is less than or equal to the specified upper bound.

+
Parameters
+ + + +
lbLower bound.
ubUpper bound. lp Log probability (ignored because no Jacobian)
+
+
+
Returns
Next integer read.
+
Exceptions
+ + +
std::runtime_errorIf the next integer read is not less than or equal to the upper bound.
+
+
+ +

Definition at line 457 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
int stan::io::reader< T >::integer_ub (int ub)
+
+inline
+
+ +

Return the next integer, checking that it is less than or equal to the specified upper bound.

+
Parameters
+ + +
ubUpper bound.
+
+
+
Returns
Next integer read.
+
Exceptions
+ + +
std::runtime_errorIf the next integer read is not less than or equal to the upper bound.
+
+
+ +

Definition at line 374 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
int stan::io::reader< T >::integer_ub_constrain (int ub)
+
+inline
+
+ +

Return the next integer, checking that it is less than or equal to the specified upper bound.

+
Parameters
+ + +
ubUpper bound.
+
+
+
Returns
Next integer read.
+
Exceptions
+ + +
std::runtime_errorIf the next integer read is not less than or equal to the upper bound.
+
+
+ +

Definition at line 390 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
int stan::io::reader< T >::integer_ub_constrain (int ub,
T &  
)
+
+inline
+
+ +

Return the next integer, checking that it is less than or equal to the specified upper bound.

+
Parameters
+ + +
ubUpper bound. lp Log probability (ignored because no Jacobian)
+
+
+
Returns
Next integer read.
+
Exceptions
+ + +
std::runtime_errorIf the next integer read is not less than or equal to the upper bound.
+
+
+ +

Definition at line 403 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
matrix_t stan::io::reader< T >::matrix (size_t m,
size_t n 
)
+
+inline
+
+ +

Return a matrix of the specified dimensionality made up of the next scalars arranged in column-major order.

+

Row-major reading means that if a matrix of m=2 rows and n=3 columns is reada and the next scalar values are 1,2,3,4,5,6, the result is

+
 
+a = 1 4
+    2 5
+    3 6
Parameters
+ + + +
mNumber of rows.
nNumber of columns.
+
+
+
Returns
Eigen::Matrix made up of the next scalars.
+ +

Definition at line 287 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
matrix_t stan::io::reader< T >::matrix_constrain (size_t m,
size_t n 
)
+
+inline
+
+ +

Return a matrix of the specified dimensionality made up of the next scalars arranged in column-major order.

+

The constraint is a no-op. See matrix(size_t, size_t) for more information.

+
Parameters
+ + + +
mNumber of rows.
nNumber of columns.
+
+
+
Returns
Matrix made up of the next scalars.
+ +

Definition at line 301 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
matrix_t stan::io::reader< T >::matrix_constrain (size_t m,
size_t n,
T &  
)
+
+inline
+
+ +

Return a matrix of the specified dimensionality made up of the next scalars arranged in column-major order.

+

The constraint is a no-op, hence the log probability is not incremented. See matrix(size_t, size_t) for more information.

+
Parameters
+ + + +
mNumber of rows.
nNumber of columns. lp Log probability to increment.
+
+
+
Returns
Matrix made up of the next scalars.
+ +

Definition at line 317 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TL >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
matrix_t stan::io::reader< T >::matrix_lb (const TL lb,
size_t m,
size_t n 
)
+
+inline
+
+ +

Definition at line 1120 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TL >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
matrix_t stan::io::reader< T >::matrix_lb_constrain (const TL lb,
size_t m,
size_t n 
)
+
+inline
+
+ +

Definition at line 1128 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TL >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
matrix_t stan::io::reader< T >::matrix_lb_constrain (const TL lb,
size_t m,
size_t n,
T & lp 
)
+
+inline
+
+ +

Definition at line 1136 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TL , typename TU >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
matrix_t stan::io::reader< T >::matrix_lub (const TL lb,
const TU ub,
size_t m,
size_t n 
)
+
+inline
+
+ +

Definition at line 1259 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TL , typename TU >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
matrix_t stan::io::reader< T >::matrix_lub_constrain (const TL lb,
const TU ub,
size_t m,
size_t n 
)
+
+inline
+
+ +

Definition at line 1267 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TL , typename TU >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
matrix_t stan::io::reader< T >::matrix_lub_constrain (const TL lb,
const TU ub,
size_t m,
size_t n,
T & lp 
)
+
+inline
+
+ +

Definition at line 1275 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TU >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
matrix_t stan::io::reader< T >::matrix_ub (const TU ub,
size_t m,
size_t n 
)
+
+inline
+
+ +

Definition at line 1189 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TU >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
matrix_t stan::io::reader< T >::matrix_ub_constrain (const TU ub,
size_t m,
size_t n 
)
+
+inline
+
+ +

Definition at line 1197 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TU >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
matrix_t stan::io::reader< T >::matrix_ub_constrain (const TU ub,
size_t m,
size_t n,
T & lp 
)
+
+inline
+
+ +

Definition at line 1205 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
vector_t stan::io::reader< T >::ordered (size_t k)
+
+inline
+
+ +

Return the next vector of specified size containing values in ascending order.

+

See stan::math::check_ordered(T) for behavior on failure.

+
Parameters
+ + +
kSize of returned vector.
+
+
+
Returns
Vector of positive values in ascending order.
+ +

Definition at line 857 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
vector_t stan::io::reader< T >::ordered_constrain (size_t k)
+
+inline
+
+ +

Return the next ordered vector of the specified length.

+

See stan::prob::ordered_constrain(Matrix).

+
Parameters
+ + +
kLength of returned vector.
+
+
+
Returns
Next ordered vector of the specified length.
+ +

Definition at line 872 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
vector_t stan::io::reader< T >::ordered_constrain (size_t k,
T & lp 
)
+
+inline
+
+ +

Return the next ordered vector of the specified size, incrementing the specified reference with the log absolute Jacobian of the determinant.

+

See stan::prob::ordered_constrain(Matrix,T&).

+
Parameters
+ + + +
kSize of vector.
lpLog probability reference to increment.
+
+
+
Returns
Next ordered vector of the specified size.
+ +

Definition at line 887 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
vector_t stan::io::reader< T >::positive_ordered (size_t k)
+
+inline
+
+ +

Return the next vector of specified size containing positive values in ascending order.

+

See stan::math::check_positive_ordered(T) for behavior on failure.

+
Parameters
+ + +
kSize of returned vector.
+
+
+
Returns
Vector of positive values in ascending order.
+ +

Definition at line 901 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
vector_t stan::io::reader< T >::positive_ordered_constrain (size_t k)
+
+inline
+
+ +

Return the next positive ordered vector of the specified length.

+

See stan::prob::positive_ordered_constrain(Matrix).

+
Parameters
+ + +
kLength of returned vector.
+
+
+
Returns
Next positive_ordered vector of the specified length.
+ +

Definition at line 916 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
vector_t stan::io::reader< T >::positive_ordered_constrain (size_t k,
T & lp 
)
+
+inline
+
+ +

Return the next positive_ordered vector of the specified size, incrementing the specified reference with the log absolute Jacobian of the determinant.

+

See stan::prob::positive_ordered_constrain(Matrix,T&).

+
Parameters
+ + + +
kSize of vector.
lpLog probability reference to increment.
+
+
+
Returns
Next positive_ordered vector of the specified size.
+ +

Definition at line 931 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
T stan::io::reader< T >::prob ()
+
+inline
+
+ +

Return the next scalar, checking that it is a valid value for a probability, between 0 (inclusive) and 1 (inclusive).

+

See stan::math::check_bounded(T).

+
Returns
Next probability value.
+ +

Definition at line 674 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
T stan::io::reader< T >::prob_constrain ()
+
+inline
+
+ +

Return the next scalar transformed to be a probability between 0 and 1.

+

See stan::prob::prob_constrain(T).

+
Returns
The next scalar transformed to a probability.
+ +

Definition at line 688 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
T stan::io::reader< T >::prob_constrain (T & lp)
+
+inline
+
+ +

Return the next scalar transformed to be a probability between 0 and 1, incrementing the specified reference with the log of the absolute Jacobian determinant.

+

See stan::prob::prob_constrain(T).

+
Parameters
+ + +
lpReference to log probability variable to increment.
+
+
+
Returns
The next scalar transformed to a probability.
+ +

Definition at line 702 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
row_vector_t stan::io::reader< T >::row_vector (size_t m)
+
+inline
+
+ +

Return a row vector of specified dimensionality made up of the next scalars.

+
Parameters
+ + +
mNumber of rows in the vector to read.
+
+
+
Returns
Column vector made up of the next scalars.
+ +

Definition at line 242 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
row_vector_t stan::io::reader< T >::row_vector_constrain (size_t m)
+
+inline
+
+ +

Return a row vector of specified dimensionality made up of the next scalars.

+

The constraint is a no-op.

+
Parameters
+ + +
mNumber of rows in the vector to read.
+
+
+
Returns
Column vector made up of the next scalars.
+ +

Definition at line 253 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
row_vector_t stan::io::reader< T >::row_vector_constrain (size_t m,
T &  
)
+
+inline
+
+ +

Return a row vector of specified dimensionality made up of the next scalars.

+

The constraint is a no-op, so the log probability is not incremented.

+
Parameters
+ + +
mNumber of rows in the vector to read. lp Log probability to increment.
+
+
+
Returns
Column vector made up of the next scalars.
+ +

Definition at line 266 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TL >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
row_vector_t stan::io::reader< T >::row_vector_lb (const TL lb,
size_t m 
)
+
+inline
+
+ +

Definition at line 1098 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TL >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
row_vector_t stan::io::reader< T >::row_vector_lb_constrain (const TL lb,
size_t m 
)
+
+inline
+
+ +

Definition at line 1105 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TL >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
row_vector_t stan::io::reader< T >::row_vector_lb_constrain (const TL lb,
size_t m,
T & lp 
)
+
+inline
+
+ +

Definition at line 1112 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TL , typename TU >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
row_vector_t stan::io::reader< T >::row_vector_lub (const TL lb,
const TU ub,
size_t m 
)
+
+inline
+
+ +

Definition at line 1237 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TL , typename TU >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
row_vector_t stan::io::reader< T >::row_vector_lub_constrain (const TL lb,
const TU ub,
size_t m 
)
+
+inline
+
+ +

Definition at line 1244 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TL , typename TU >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
row_vector_t stan::io::reader< T >::row_vector_lub_constrain (const TL lb,
const TU ub,
size_t m,
T & lp 
)
+
+inline
+
+ +

Definition at line 1251 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TU >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
row_vector_t stan::io::reader< T >::row_vector_ub (const TU ub,
size_t m 
)
+
+inline
+
+ +

Definition at line 1167 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TU >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
row_vector_t stan::io::reader< T >::row_vector_ub_constrain (const TU ub,
size_t m 
)
+
+inline
+
+ +

Definition at line 1174 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TU >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
row_vector_t stan::io::reader< T >::row_vector_ub_constrain (const TU ub,
size_t m,
T & lp 
)
+
+inline
+
+ +

Definition at line 1181 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
T stan::io::reader< T >::scalar ()
+
+inline
+
+ +

Return the next scalar in the sequence.

+
Returns
Next scalar value.
+ +

Definition at line 155 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
T stan::io::reader< T >::scalar_constrain ()
+
+inline
+
+ +

Return the next scalar.

+

For arbitrary scalars, constraint is a no-op.

+
Returns
Next scalar.
+ +

Definition at line 167 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
T stan::io::reader< T >::scalar_constrain (T & )
+
+inline
+
+ +

Return the next scalar in the sequence, incrementing the specified reference with the log absolute Jacobian determinant.

+

With no transformation, the Jacobian increment is a no-op.

+

See scalar_constrain().

+

log_prob Reference to log probability variable to increment.

+
Returns
Next scalar.
+ +

Definition at line 182 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TL >
+ + + + + +
+ + + + + + + + +
T stan::io::reader< T >::scalar_lb (const TL lb)
+
+inline
+
+ +

Return the next scalar, checking that it is greater than or equal to the specified lower bound.

+

See stan::math::check_greater_or_equal(T,double).

+
Parameters
+ + +
lbLower bound.
+
+
+
Returns
Next scalar value.
+
Template Parameters
+ + +
TLType of lower bound.
+
+
+
Exceptions
+ + +
std::runtime_errorif the scalar is less than the specified lower bound
+
+
+ +

Definition at line 517 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TL >
+ + + + + +
+ + + + + + + + +
T stan::io::reader< T >::scalar_lb_constrain (const TL lb)
+
+inline
+
+ +

Return the next scalar transformed to have the specified lower bound.

+

See stan::prob::lb_constrain(T,double).

+
Template Parameters
+ + +
TLType of lower bound.
+
+
+
Parameters
+ + +
lbLower bound on values.
+
+
+
Returns
Next scalar transformed to have the specified lower bound.
+ +

Definition at line 536 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TL >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
T stan::io::reader< T >::scalar_lb_constrain (const TL lb,
T & lp 
)
+
+inline
+
+ +

Return the next scalar transformed to have the specified lower bound, incrementing the specified reference with the log of the absolute Jacobian determinant of the transform.

+

See stan::prob::lb_constrain(T,double,T&).

+
Template Parameters
+ + +
TLType of lower bound.
+
+
+
Parameters
+ + + +
lbLower bound on result.
lpReference to log probability variable to increment.
+
+
+ +

Definition at line 552 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TL , typename TU >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
T stan::io::reader< T >::scalar_lub (const TL lb,
const TU ub 
)
+
+inline
+
+ +

Return the next scalar, checking that it is between the specified lower and upper bound.

+

See stan::math::check_bounded(T,double,double).

+
Template Parameters
+ + + +
TLType of lower bound.
TUType of upper bound.
+
+
+
Parameters
+ + + +
lbLower bound.
ubUpper bound.
+
+
+
Returns
Next scalar value.
+
Exceptions
+ + +
std::runtime_errorif the scalar is not between the specified lower and upper bounds.
+
+
+ +

Definition at line 624 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TL , typename TU >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
T stan::io::reader< T >::scalar_lub_constrain (const TL lb,
const TU ub 
)
+
+inline
+
+ +

Return the next scalar transformed to be between the specified lower and upper bounds.

+

See stan::prob::lub_constrain(T,double,double).

+
Template Parameters
+ + + +
TLType of lower bound.
TUType of upper bound.
+
+
+
Parameters
+ + + +
lbLower bound.
ubUpper bound.
+
+
+
Returns
Next scalar transformed to fall between the specified bounds.
+ +

Definition at line 644 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TL , typename TU >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
T stan::io::reader< T >::scalar_lub_constrain (TL lb,
TU ub,
T & lp 
)
+
+inline
+
+ +

Return the next scalar transformed to be between the the specified lower and upper bounds.

+

See stan::prob::lub_constrain(T,double,double,T&).

+
Parameters
+ + + + +
lbLower bound.
ubUpper bound.
lpReference to log probability variable to increment.
+
+
+
Template Parameters
+ + + + +
TType of scalar.
TLType of lower bound.
TUType of upper bound.
+
+
+ +

Definition at line 662 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
T stan::io::reader< T >::scalar_pos ()
+
+inline
+
+ +

Return the next scalar, checking that it is positive.

+

See stan::math::check_positive(T).

+
Returns
Next positive scalar.
+
Exceptions
+ + +
std::runtime_errorif x is not positive
+
+
+ +

Definition at line 472 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
T stan::io::reader< T >::scalar_pos_constrain ()
+
+inline
+
+ +

Return the next scalar, transformed to be positive.

+

See stan::prob::positive_constrain(T).

+
Returns
The next scalar transformed to be positive.
+ +

Definition at line 486 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
T stan::io::reader< T >::scalar_pos_constrain (T & lp)
+
+inline
+
+ +

Return the next scalar transformed to be positive, incrementing the specified reference with the log absolute determinant of the Jacobian.

+

See stan::prob::positive_constrain(T,T&).

+
Parameters
+ + +
lpReference to log probability variable to increment.
+
+
+
Returns
The next scalar transformed to be positive.
+ +

Definition at line 500 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TU >
+ + + + + +
+ + + + + + + + +
T stan::io::reader< T >::scalar_ub (TU ub)
+
+inline
+
+ +

Return the next scalar, checking that it is less than or equal to the specified upper bound.

+

See stan::math::check_less_or_equal(T,double).

+
Template Parameters
+ + +
TUType of upper bound.
+
+
+
Parameters
+ + +
ubUpper bound.
+
+
+
Returns
Next scalar value.
+
Exceptions
+ + +
std::runtime_errorif the scalar is greater than the specified upper bound
+
+
+ +

Definition at line 571 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TU >
+ + + + + +
+ + + + + + + + +
T stan::io::reader< T >::scalar_ub_constrain (const TU ub)
+
+inline
+
+ +

Return the next scalar transformed to have the specified upper bound.

+

See stan::prob::ub_constrain(T,double).

+
Template Parameters
+ + +
TUType of upper bound.
+
+
+
Parameters
+ + +
ubUpper bound on values.
+
+
+
Returns
Next scalar transformed to have the specified upper bound.
+ +

Definition at line 589 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TU >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
T stan::io::reader< T >::scalar_ub_constrain (const TU ub,
T & lp 
)
+
+inline
+
+ +

Return the next scalar transformed to have the specified upper bound, incrementing the specified reference with the log of the absolute Jacobian determinant of the transform.

+

See stan::prob::ub_constrain(T,double,T&).

+
Template Parameters
+ + +
TUType of upper bound.
+
+
+
Parameters
+ + + +
ubUpper bound on result.
lpReference to log probability variable to increment.
+
+
+ +

Definition at line 605 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
vector_t stan::io::reader< T >::simplex (size_t k)
+
+inline
+
+ +

Return a simplex of the specified size made up of the next scalars.

+

See stan::math::check_simplex.

+
Parameters
+ + +
kSize of returned simplex.
+
+
+
Returns
Simplex read from the specified size number of scalars.
+
Exceptions
+ + +
std::runtime_errorif the k values is not a simplex.
+
+
+ +

Definition at line 810 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,1> stan::io::reader< T >::simplex_constrain (size_t k)
+
+inline
+
+ +

Return the next simplex transformed vector of the specified length.

+

This operation consumes one less than the specified length number of scalars.

+

See stan::prob::simplex_constrain(Eigen::Matrix).

+
Parameters
+ + +
kNumber of dimensions in resulting simplex.
+
+
+
Returns
Simplex derived from next k-1 scalars.
+ +

Definition at line 827 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
vector_t stan::io::reader< T >::simplex_constrain (size_t k,
T & lp 
)
+
+inline
+
+ +

Return the next simplex of the specified size (using one fewer unconstrained scalars), incrementing the specified reference with the log absolute Jacobian determinant.

+

See stan::prob::simplex_constrain(Eigen::Matrix,T&).

+
Parameters
+ + + +
kSize of simplex.
lpLog probability to increment with log absolute Jacobian determinant.
+
+
+
Returns
The next simplex of the specified size.
+ +

Definition at line 843 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
std::vector<T> stan::io::reader< T >::std_vector (size_t m)
+
+inline
+
+ +

Return a standard library vector of the specified dimensionality made up of the next scalars.

+
Parameters
+ + +
mSize of vector.
+
+
+
Returns
Vector made up of the next scalars.
+ +

Definition at line 194 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
vector_t stan::io::reader< T >::unit_vector (size_t k)
+
+inline
+
+ +

Return a unit_vector of the specified size made up of the next scalars.

+

See stan::math::check_unit_vector.

+
Parameters
+ + +
kSize of returned unit_vector.
+
+
+
Returns
Simplex read from the specified size number of scalars.
+
Exceptions
+ + +
std::runtime_errorif the k values is not a unit_vector.
+
+
+ +

Definition at line 763 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,1> stan::io::reader< T >::unit_vector_constrain (size_t k)
+
+inline
+
+ +

Return the next unit_vector transformed vector of the specified length.

+

This operation consumes one less than the specified length number of scalars.

+

See stan::prob::unit_vector_constrain(Eigen::Matrix).

+
Parameters
+ + +
kNumber of dimensions in resulting unit_vector.
+
+
+
Returns
Simplex derived from next k-1 scalars.
+ +

Definition at line 780 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
vector_t stan::io::reader< T >::unit_vector_constrain (size_t k,
T & lp 
)
+
+inline
+
+ +

Return the next unit_vector of the specified size (using one fewer unconstrained scalars), incrementing the specified reference with the log absolute Jacobian determinant.

+

See stan::prob::unit_vector_constrain(Eigen::Matrix,T&).

+
Parameters
+ + + +
kSize of unit_vector.
lpLog probability to increment with log absolute Jacobian determinant.
+
+
+
Returns
The next unit_vector of the specified size.
+ +

Definition at line 796 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
vector_t stan::io::reader< T >::vector (size_t m)
+
+inline
+
+ +

Return a column vector of specified dimensionality made up of the next scalars.

+
Parameters
+ + +
mNumber of rows in the vector to read.
+
+
+
Returns
Column vector made up of the next scalars.
+ +

Definition at line 208 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
vector_t stan::io::reader< T >::vector_constrain (size_t m)
+
+inline
+
+ +

Return a column vector of specified dimensionality made up of the next scalars.

+

The constraint is a no-op.

+
Parameters
+ + +
mNumber of rows in the vector to read.
+
+
+
Returns
Column vector made up of the next scalars.
+ +

Definition at line 218 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
vector_t stan::io::reader< T >::vector_constrain (size_t m,
T &  
)
+
+inline
+
+ +

Return a column vector of specified dimensionality made up of the next scalars.

+

The constraint and hence Jacobian are no-ops.

+
Parameters
+ + +
mNumber of rows in the vector to read. lp Log probability to increment.
+
+
+
Returns
Column vector made up of the next scalars.
+ +

Definition at line 229 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TL >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
vector_t stan::io::reader< T >::vector_lb (const TL lb,
size_t m 
)
+
+inline
+
+ +

Definition at line 1076 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TL >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
vector_t stan::io::reader< T >::vector_lb_constrain (const TL lb,
size_t m 
)
+
+inline
+
+ +

Definition at line 1083 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TL >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
vector_t stan::io::reader< T >::vector_lb_constrain (const TL lb,
size_t m,
T & lp 
)
+
+inline
+
+ +

Definition at line 1090 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TL , typename TU >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
vector_t stan::io::reader< T >::vector_lub (const TL lb,
const TU ub,
size_t m 
)
+
+inline
+
+ +

Definition at line 1215 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TL , typename TU >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
vector_t stan::io::reader< T >::vector_lub_constrain (const TL lb,
const TU ub,
size_t m 
)
+
+inline
+
+ +

Definition at line 1222 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TL , typename TU >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
vector_t stan::io::reader< T >::vector_lub_constrain (const TL lb,
const TU ub,
size_t m,
T & lp 
)
+
+inline
+
+ +

Definition at line 1229 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TU >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
vector_t stan::io::reader< T >::vector_ub (const TU ub,
size_t m 
)
+
+inline
+
+ +

Definition at line 1145 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TU >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
vector_t stan::io::reader< T >::vector_ub_constrain (const TU ub,
size_t m 
)
+
+inline
+
+ +

Definition at line 1152 of file reader.hpp.

+ +
+
+ +
+
+
+template<typename T >
+
+template<typename TU >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
vector_t stan::io::reader< T >::vector_ub_constrain (const TU ub,
size_t m,
T & lp 
)
+
+inline
+
+ +

Definition at line 1159 of file reader.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1io_1_1stan__csv__reader-members.html b/doc/api/html/classstan_1_1io_1_1stan__csv__reader-members.html new file mode 100644 index 00000000000..5d492bfe730 --- /dev/null +++ b/doc/api/html/classstan_1_1io_1_1stan__csv__reader-members.html @@ -0,0 +1,119 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::io::stan_csv_reader Member List
+
+
+ +

This is the complete list of members for stan::io::stan_csv_reader, including all inherited members.

+ + + + + + + + +
parse(std::istream &in)stan::io::stan_csv_readerinlinestatic
read_adaptation(std::istream &in, stan_csv_adaptation &adaptation)stan::io::stan_csv_readerinlinestatic
read_header(std::istream &in, Eigen::Matrix< std::string, Eigen::Dynamic, 1 > &header)stan::io::stan_csv_readerinlinestatic
read_metadata(std::istream &in, stan_csv_metadata &metadata)stan::io::stan_csv_readerinlinestatic
read_samples(std::istream &in, Eigen::MatrixXd &samples, stan_csv_timing &timing)stan::io::stan_csv_readerinlinestatic
stan_csv_reader()stan::io::stan_csv_readerinline
~stan_csv_reader()stan::io::stan_csv_readerinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1io_1_1stan__csv__reader.html b/doc/api/html/classstan_1_1io_1_1stan__csv__reader.html new file mode 100644 index 00000000000..ba0dd4778ef --- /dev/null +++ b/doc/api/html/classstan_1_1io_1_1stan__csv__reader.html @@ -0,0 +1,377 @@ + + + + + +Stan: stan::io::stan_csv_reader Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::io::stan_csv_reader Class Reference
+
+
+ +

Reads from a Stan output csv file. + More...

+ +

#include <stan_csv_reader.hpp>

+ + + + + + +

+Public Member Functions

 stan_csv_reader ()
 
 ~stan_csv_reader ()
 
+ + + + + + + + + + + + +

+Static Public Member Functions

static bool read_metadata (std::istream &in, stan_csv_metadata &metadata)
 
static bool read_header (std::istream &in, Eigen::Matrix< std::string, Eigen::Dynamic, 1 > &header)
 
static bool read_adaptation (std::istream &in, stan_csv_adaptation &adaptation)
 
static bool read_samples (std::istream &in, Eigen::MatrixXd &samples, stan_csv_timing &timing)
 
static stan_csv parse (std::istream &in)
 Parses the file.
 
+

Detailed Description

+

Reads from a Stan output csv file.

+ +

Definition at line 71 of file stan_csv_reader.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::io::stan_csv_reader::stan_csv_reader ()
+
+inline
+
+ +

Definition at line 75 of file stan_csv_reader.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
stan::io::stan_csv_reader::~stan_csv_reader ()
+
+inline
+
+ +

Definition at line 76 of file stan_csv_reader.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
static stan_csv stan::io::stan_csv_reader::parse (std::istream & in)
+
+inlinestatic
+
+ +

Parses the file.

+ +

Definition at line 319 of file stan_csv_reader.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
static bool stan::io::stan_csv_reader::read_adaptation (std::istream & in,
stan_csv_adaptationadaptation 
)
+
+inlinestatic
+
+ +

Definition at line 183 of file stan_csv_reader.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
static bool stan::io::stan_csv_reader::read_header (std::istream & in,
Eigen::Matrix< std::string, Eigen::Dynamic, 1 > & header 
)
+
+inlinestatic
+
+ +

Definition at line 155 of file stan_csv_reader.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
static bool stan::io::stan_csv_reader::read_metadata (std::istream & in,
stan_csv_metadatametadata 
)
+
+inlinestatic
+
+ +

Definition at line 78 of file stan_csv_reader.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
static bool stan::io::stan_csv_reader::read_samples (std::istream & in,
Eigen::MatrixXd & samples,
stan_csv_timingtiming 
)
+
+inlinestatic
+
+ +

Definition at line 242 of file stan_csv_reader.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1io_1_1var__context-members.html b/doc/api/html/classstan_1_1io_1_1var__context-members.html new file mode 100644 index 00000000000..97f17f128eb --- /dev/null +++ b/doc/api/html/classstan_1_1io_1_1var__context-members.html @@ -0,0 +1,131 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::io::var_context Member List
+
+
+ +

This is the complete list of members for stan::io::var_context, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + +
add_vec(std::stringstream &msg, const std::vector< size_t > &dims) const stan::io::var_contextinline
contains_i(const std::string &name) const =0stan::io::var_contextpure virtual
contains_r(const std::string &name) const =0stan::io::var_contextpure virtual
dims_i(const std::string &name) const =0stan::io::var_contextpure virtual
dims_r(const std::string &name) const =0stan::io::var_contextpure virtual
names_i(std::vector< std::string > &names) const =0stan::io::var_contextpure virtual
names_r(std::vector< std::string > &names) const =0stan::io::var_contextpure virtual
to_vec()stan::io::var_contextinlinestatic
to_vec(size_t n1)stan::io::var_contextinlinestatic
to_vec(size_t n1, size_t n2)stan::io::var_contextinlinestatic
to_vec(size_t n1, size_t n2, size_t n3)stan::io::var_contextinlinestatic
to_vec(size_t n1, size_t n2, size_t n3, size_t n4)stan::io::var_contextinlinestatic
to_vec(size_t n1, size_t n2, size_t n3, size_t n4, size_t n5)stan::io::var_contextinlinestatic
to_vec(size_t n1, size_t n2, size_t n3, size_t n4, size_t n5, size_t n6)stan::io::var_contextinlinestatic
to_vec(size_t n1, size_t n2, size_t n3, size_t n4, size_t n5, size_t n6, size_t n7)stan::io::var_contextinlinestatic
to_vec(size_t n1, size_t n2, size_t n3, size_t n4, size_t n5, size_t n6, size_t n7, size_t n8)stan::io::var_contextinlinestatic
validate_dims(const std::string &stage, const std::string &name, const std::string &base_type, const std::vector< size_t > &dims_declared) const stan::io::var_contextinline
vals_i(const std::string &name) const =0stan::io::var_contextpure virtual
vals_r(const std::string &name) const =0stan::io::var_contextpure virtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1io_1_1var__context.html b/doc/api/html/classstan_1_1io_1_1var__context.html new file mode 100644 index 00000000000..e51f387caac --- /dev/null +++ b/doc/api/html/classstan_1_1io_1_1var__context.html @@ -0,0 +1,987 @@ + + + + + +Stan: stan::io::var_context Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::io::var_context Class Referenceabstract
+
+
+ +

A var_reader reads array variables of integer and floating point type by name and dimension. + More...

+ +

#include <var_context.hpp>

+
+Inheritance diagram for stan::io::var_context:
+
+
+ + +stan::io::dump + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

virtual bool contains_r (const std::string &name) const =0
 Return true if the specified variable name is defined.
 
virtual std::vector< double > vals_r (const std::string &name) const =0
 Return the floating point values for the variable of the specified variable name in last-index-major order.
 
virtual std::vector< size_t > dims_r (const std::string &name) const =0
 Return the dimensions for the specified floating point variable.
 
virtual bool contains_i (const std::string &name) const =0
 Return true if the specified variable name has integer values.
 
virtual std::vector< int > vals_i (const std::string &name) const =0
 Return the integer values for the variable of the specified name in last-index-major order or the empty sequence if the variable is not defined.
 
virtual std::vector< size_t > dims_i (const std::string &name) const =0
 Return the dimensions of the specified floating point variable.
 
virtual void names_r (std::vector< std::string > &names) const =0
 Return a list of the names of the floating point variables in the context.
 
virtual void names_i (std::vector< std::string > &names) const =0
 Return a list of the names of the integer variables in the context.
 
void add_vec (std::stringstream &msg, const std::vector< size_t > &dims) const
 
void validate_dims (const std::string &stage, const std::string &name, const std::string &base_type, const std::vector< size_t > &dims_declared) const
 
+ + + + + + + + + + + + + + + + + + + +

+Static Public Member Functions

static std::vector< size_t > to_vec ()
 
static std::vector< size_t > to_vec (size_t n1)
 
static std::vector< size_t > to_vec (size_t n1, size_t n2)
 
static std::vector< size_t > to_vec (size_t n1, size_t n2, size_t n3)
 
static std::vector< size_t > to_vec (size_t n1, size_t n2, size_t n3, size_t n4)
 
static std::vector< size_t > to_vec (size_t n1, size_t n2, size_t n3, size_t n4, size_t n5)
 
static std::vector< size_t > to_vec (size_t n1, size_t n2, size_t n3, size_t n4, size_t n5, size_t n6)
 
static std::vector< size_t > to_vec (size_t n1, size_t n2, size_t n3, size_t n4, size_t n5, size_t n6, size_t n7)
 
static std::vector< size_t > to_vec (size_t n1, size_t n2, size_t n3, size_t n4, size_t n5, size_t n6, size_t n7, size_t n8)
 
+

Detailed Description

+

A var_reader reads array variables of integer and floating point type by name and dimension.

+

An array's dimensionality is described by a sequence of (unsigned) integers. For instance, (7, 2, 3) picks out a 7 by 2 by 3 array. The empty dimensionality sequence () is used for scalars.

+

Multidimensional arrays are stored in column-major order, meaning the first index changes the most quickly.

+

If a variable has integer variables, it should return those integer values cast to floating point values when accessed through the floating-point methods.

+ +

Definition at line 29 of file var_context.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::io::var_context::add_vec (std::stringstream & msg,
const std::vector< size_t > & dims 
) const
+
+inline
+
+ +

Definition at line 113 of file var_context.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
virtual bool stan::io::var_context::contains_i (const std::string & name) const
+
+pure virtual
+
+ +

Return true if the specified variable name has integer values.

+
Parameters
+ + +
nameName of variable.
+
+
+
Returns
true if an integer variable of the specified name is defined.
+ +

Implemented in stan::io::dump.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
virtual bool stan::io::var_context::contains_r (const std::string & name) const
+
+pure virtual
+
+ +

Return true if the specified variable name is defined.

+

This method should return true even if the values are all integers.

+
Parameters
+ + +
nameName of variable.
+
+
+
Returns
true if the variable exists with real values.
+ +

Implemented in stan::io::dump.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
virtual std::vector<size_t> stan::io::var_context::dims_i (const std::string & name) const
+
+pure virtual
+
+ +

Return the dimensions of the specified floating point variable.

+

If the variable doesn't exist (or if it is a scalar), the return result should be the empty vector.

+
Parameters
+ + +
nameName of variable.
+
+
+
Returns
Sequence of dimensions for the variable.
+ +

Implemented in stan::io::dump.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
virtual std::vector<size_t> stan::io::var_context::dims_r (const std::string & name) const
+
+pure virtual
+
+ +

Return the dimensions for the specified floating point variable.

+

If the variable doesn't exist or if it is a scalar, the return result should be the empty vector.

+
Parameters
+ + +
nameName of variable.
+
+
+
Returns
Sequence of dimensions for the variable.
+ +

Implemented in stan::io::dump.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
virtual void stan::io::var_context::names_i (std::vector< std::string > & names) const
+
+pure virtual
+
+ +

Return a list of the names of the integer variables in the context.

+
Parameters
+ + +
namesVector to store the list of names in.
+
+
+ +

Implemented in stan::io::dump.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
virtual void stan::io::var_context::names_r (std::vector< std::string > & names) const
+
+pure virtual
+
+ +

Return a list of the names of the floating point variables in the context.

+
Parameters
+ + +
namesVector to store the list of names in.
+
+
+ +

Implemented in stan::io::dump.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
static std::vector<size_t> stan::io::var_context::to_vec ()
+
+inlinestatic
+
+ +

Definition at line 178 of file var_context.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
static std::vector<size_t> stan::io::var_context::to_vec (size_t n1)
+
+inlinestatic
+
+ +

Definition at line 181 of file var_context.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
static std::vector<size_t> stan::io::var_context::to_vec (size_t n1,
size_t n2 
)
+
+inlinestatic
+
+ +

Definition at line 186 of file var_context.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
static std::vector<size_t> stan::io::var_context::to_vec (size_t n1,
size_t n2,
size_t n3 
)
+
+inlinestatic
+
+ +

Definition at line 192 of file var_context.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
static std::vector<size_t> stan::io::var_context::to_vec (size_t n1,
size_t n2,
size_t n3,
size_t n4 
)
+
+inlinestatic
+
+ +

Definition at line 200 of file var_context.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
static std::vector<size_t> stan::io::var_context::to_vec (size_t n1,
size_t n2,
size_t n3,
size_t n4,
size_t n5 
)
+
+inlinestatic
+
+ +

Definition at line 209 of file var_context.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
static std::vector<size_t> stan::io::var_context::to_vec (size_t n1,
size_t n2,
size_t n3,
size_t n4,
size_t n5,
size_t n6 
)
+
+inlinestatic
+
+ +

Definition at line 220 of file var_context.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
static std::vector<size_t> stan::io::var_context::to_vec (size_t n1,
size_t n2,
size_t n3,
size_t n4,
size_t n5,
size_t n6,
size_t n7 
)
+
+inlinestatic
+
+ +

Definition at line 232 of file var_context.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
static std::vector<size_t> stan::io::var_context::to_vec (size_t n1,
size_t n2,
size_t n3,
size_t n4,
size_t n5,
size_t n6,
size_t n7,
size_t n8 
)
+
+inlinestatic
+
+ +

Definition at line 246 of file var_context.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::io::var_context::validate_dims (const std::string & stage,
const std::string & name,
const std::string & base_type,
const std::vector< size_t > & dims_declared 
) const
+
+inline
+
+ +

Definition at line 123 of file var_context.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
virtual std::vector<int> stan::io::var_context::vals_i (const std::string & name) const
+
+pure virtual
+
+ +

Return the integer values for the variable of the specified name in last-index-major order or the empty sequence if the variable is not defined.

+
Parameters
+ + +
nameName of variable.
+
+
+
Returns
Sequence of integer values.
+ +

Implemented in stan::io::dump.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
virtual std::vector<double> stan::io::var_context::vals_r (const std::string & name) const
+
+pure virtual
+
+ +

Return the floating point values for the variable of the specified variable name in last-index-major order.

+

This method should cast integers to floating point values if the values of the named variable are all integers.

+

If there is no variable of the specified name, the empty vector is returned.

+
Parameters
+ + +
nameName of variable.
+
+
+
Returns
Sequence of values for the named variable.
+ +

Implemented in stan::io::dump.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1io_1_1var__context.png b/doc/api/html/classstan_1_1io_1_1var__context.png new file mode 100644 index 0000000000000000000000000000000000000000..3566cf75bff5145e40f55e6ca0da5c00056cf02a GIT binary patch literal 534 zcmeAS@N?(olHy`uVBq!ia0vp^)j%A;!3-q%ihk_?QW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;G5m@|46G-W$!*qd&KH_^v!Au`<{EtO6a(F{D!@WDaGp#YrS?f*fcd~ey{Gk$lK?O zE$@DR*HJn1>YU{+`;wPu8rGKIIJxzd-O1;ow_hLI*WbJO^S+ehxz}&DE8JdRn>x+1 zUv%f&(`S8N-r8`ow7k8`>b&ao*EUz5?f)=;*1i)A<)-^o8FEc;FywyS^&%}TmgPf? zu!DMOihry(|vw=}6djsRGEbO>$t$ + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::io::writer< T > Member List
+
+
+ +

This is the complete list of members for stan::io::writer< T >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
array_vec_t typedefstan::io::writer< T >
cholesky_factor_unconstrain(matrix_t &y)stan::io::writer< T >inline
CONSTRAINT_TOLERANCEstan::io::writer< T >
corr_matrix_unconstrain(matrix_t &y)stan::io::writer< T >inline
corr_unconstrain(T &y)stan::io::writer< T >inline
cov_matrix_unconstrain(matrix_t &y)stan::io::writer< T >inline
data_i()stan::io::writer< T >inline
data_r()stan::io::writer< T >inline
integer(int n)stan::io::writer< T >inline
matrix_lb_unconstrain(double lb, matrix_t &y)stan::io::writer< T >inline
matrix_lub_unconstrain(double lb, double ub, matrix_t &y)stan::io::writer< T >inline
matrix_t typedefstan::io::writer< T >
matrix_ub_unconstrain(double ub, matrix_t &y)stan::io::writer< T >inline
matrix_unconstrain(const matrix_t &y)stan::io::writer< T >inline
ordered_unconstrain(vector_t &y)stan::io::writer< T >inline
positive_ordered_unconstrain(vector_t &y)stan::io::writer< T >inline
prob_unconstrain(T &y)stan::io::writer< T >inline
row_vector_lb_unconstrain(double lb, row_vector_t &y)stan::io::writer< T >inline
row_vector_lub_unconstrain(double lb, double ub, row_vector_t &y)stan::io::writer< T >inline
row_vector_t typedefstan::io::writer< T >
row_vector_ub_unconstrain(double ub, row_vector_t &y)stan::io::writer< T >inline
row_vector_unconstrain(const vector_t &y)stan::io::writer< T >inline
scalar_lb_unconstrain(double lb, T &y)stan::io::writer< T >inline
scalar_lub_unconstrain(double lb, double ub, T &y)stan::io::writer< T >inline
scalar_pos_unconstrain(T &y)stan::io::writer< T >inline
scalar_ub_unconstrain(double ub, T &y)stan::io::writer< T >inline
scalar_unconstrain(T &y)stan::io::writer< T >inline
simplex_unconstrain(vector_t &y)stan::io::writer< T >inline
unit_vector_unconstrain(vector_t &y)stan::io::writer< T >inline
vector_lb_unconstrain(double lb, vector_t &y)stan::io::writer< T >inline
vector_lub_unconstrain(double lb, double ub, vector_t &y)stan::io::writer< T >inline
vector_t typedefstan::io::writer< T >
vector_ub_unconstrain(double ub, vector_t &y)stan::io::writer< T >inline
vector_unconstrain(const vector_t &y)stan::io::writer< T >inline
writer(std::vector< T > &data_r, std::vector< int > &data_i)stan::io::writer< T >inline
~writer()stan::io::writer< T >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1io_1_1writer.html b/doc/api/html/classstan_1_1io_1_1writer.html new file mode 100644 index 00000000000..b0bc36e3b01 --- /dev/null +++ b/doc/api/html/classstan_1_1io_1_1writer.html @@ -0,0 +1,1616 @@ + + + + + +Stan: stan::io::writer< T > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::io::writer< T > Class Template Reference
+
+
+ +

A stream-based writer for integer, scalar, vector, matrix and array data types, which transforms from constrained to a sequence of constrained variables. + More...

+ +

#include <writer.hpp>

+ + + + + + + + + + +

+Public Types

typedef Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
matrix_t
 
typedef Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
vector_t
 
typedef Eigen::Matrix< T,
+1, Eigen::Dynamic > 
row_vector_t
 
typedef Eigen::Array< T,
+Eigen::Dynamic, 1 > 
array_vec_t
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 writer (std::vector< T > &data_r, std::vector< int > &data_i)
 Construct a writer that writes to the specified scalar and integer vectors.
 
 ~writer ()
 Destroy this writer.
 
std::vector< T > & data_r ()
 Return a reference to the underlying vector of real values that have been written.
 
std::vector< int > & data_i ()
 Return a reference to the underlying vector of integer values that have been written.
 
void integer (int n)
 Write the specified integer to the sequence of integer values.
 
void scalar_unconstrain (T &y)
 Write the unconstrained value corresponding to the specified scalar.
 
void scalar_pos_unconstrain (T &y)
 Write the unconstrained value corresponding to the specified positive-constrained scalar.
 
void scalar_lb_unconstrain (double lb, T &y)
 Return the unconstrained version of the specified input, which is constrained to be above the specified lower bound.
 
void scalar_ub_unconstrain (double ub, T &y)
 Write the unconstrained value corresponding to the specified lower-bounded value.
 
void scalar_lub_unconstrain (double lb, double ub, T &y)
 Write the unconstrained value corresponding to the specified value with the specified bounds.
 
void corr_unconstrain (T &y)
 Write the unconstrained value corresponding to the specified correlation-constrained variable.
 
void prob_unconstrain (T &y)
 Write the unconstrained value corresponding to the specified probability value.
 
void ordered_unconstrain (vector_t &y)
 Write the unconstrained vector that corresponds to the specified ascendingly ordered vector.
 
void positive_ordered_unconstrain (vector_t &y)
 Write the unconstrained vector that corresponds to the specified postiive ascendingly ordered vector.
 
void vector_unconstrain (const vector_t &y)
 Write the specified unconstrained vector.
 
void row_vector_unconstrain (const vector_t &y)
 Write the specified unconstrained vector.
 
void matrix_unconstrain (const matrix_t &y)
 Write the specified unconstrained matrix.
 
void vector_lb_unconstrain (double lb, vector_t &y)
 
void row_vector_lb_unconstrain (double lb, row_vector_t &y)
 
void matrix_lb_unconstrain (double lb, matrix_t &y)
 
void vector_ub_unconstrain (double ub, vector_t &y)
 
void row_vector_ub_unconstrain (double ub, row_vector_t &y)
 
void matrix_ub_unconstrain (double ub, matrix_t &y)
 
void vector_lub_unconstrain (double lb, double ub, vector_t &y)
 
void row_vector_lub_unconstrain (double lb, double ub, row_vector_t &y)
 
void matrix_lub_unconstrain (double lb, double ub, matrix_t &y)
 
void unit_vector_unconstrain (vector_t &y)
 Write the unconstrained vector corresponding to the specified unit_vector value.
 
void simplex_unconstrain (vector_t &y)
 Write the unconstrained vector corresponding to the specified simplex value.
 
void cholesky_factor_unconstrain (matrix_t &y)
 Writes the unconstrained Cholesky factor corresponding to the specified constrained matrix.
 
void cov_matrix_unconstrain (matrix_t &y)
 Writes the unconstrained covariance matrix corresponding to the specified constrained correlation matrix.
 
void corr_matrix_unconstrain (matrix_t &y)
 Writes the unconstrained correlation matrix corresponding to the specified constrained correlation matrix.
 
+ + + + +

+Public Attributes

const double CONSTRAINT_TOLERANCE
 This is the tolerance for checking arithmetic bounds in rank and in simplexes.
 
+

Detailed Description

+

template<typename T>
+class stan::io::writer< T >

+ +

A stream-based writer for integer, scalar, vector, matrix and array data types, which transforms from constrained to a sequence of constrained variables.

+

This class converts constrained values to unconstrained values with mappings that invert those defined in stan::io::reader to convert unconstrained values to constrained values.

+
Template Parameters
+ + +
TBasic scalar type.
+
+
+ +

Definition at line 24 of file writer.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T >
+ + + + +
typedef Eigen::Array<T,Eigen::Dynamic,1> stan::io::writer< T >::array_vec_t
+
+ +

Definition at line 34 of file writer.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + +
typedef Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> stan::io::writer< T >::matrix_t
+
+ +

Definition at line 30 of file writer.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + +
typedef Eigen::Matrix<T,1,Eigen::Dynamic> stan::io::writer< T >::row_vector_t
+
+ +

Definition at line 32 of file writer.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + +
typedef Eigen::Matrix<T,Eigen::Dynamic,1> stan::io::writer< T >::vector_t
+
+ +

Definition at line 31 of file writer.hpp.

+ +
+
+

Constructor & Destructor Documentation

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
stan::io::writer< T >::writer (std::vector< T > & data_r,
std::vector< int > & data_i 
)
+
+inline
+
+ +

Construct a writer that writes to the specified scalar and integer vectors.

+
Parameters
+ + + +
data_rScalar values.
data_iInteger values.
+
+
+ +

Definition at line 49 of file writer.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
stan::io::writer< T >::~writer ()
+
+inline
+
+ +

Destroy this writer.

+ +

Definition at line 61 of file writer.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
void stan::io::writer< T >::cholesky_factor_unconstrain (matrix_ty)
+
+inline
+
+ +

Writes the unconstrained Cholesky factor corresponding to the specified constrained matrix.

+

The unconstraining operation is the inverse of the constraining operation in cov_matrix_constrain(Matrix<T,Dynamic,Dynamic).

+
Parameters
+ + +
yConstrained covariance matrix.
+
+
+
Exceptions
+ + +
std::runtime_errorif y has no elements or if it is not square
+
+
+ +

Definition at line 375 of file writer.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
void stan::io::writer< T >::corr_matrix_unconstrain (matrix_ty)
+
+inline
+
+ +

Writes the unconstrained correlation matrix corresponding to the specified constrained correlation matrix.

+

The unconstraining operation is the inverse of the constraining operation in corr_matrix_constrain(Matrix<T,Dynamic,Dynamic).

+
Parameters
+ + +
yConstrained correlation matrix.
+
+
+
Exceptions
+ + + +
std::runtime_errorif the correlation matrix has no elements or is not a square matrix.
std::runtime_errorif the correlation matrix cannot be factorized by factor_cov_matrix() or if the sds returned by factor_cov_matrix() on log scale are unconstrained.
+
+
+ +

Definition at line 427 of file writer.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
void stan::io::writer< T >::corr_unconstrain (T & y)
+
+inline
+
+ +

Write the unconstrained value corresponding to the specified correlation-constrained variable.

+

The unconstraining transform is atanh(y), which reverses the transfrom in corr_constrain().

+
Parameters
+ + +
yCorrelation value.
+
+
+
Exceptions
+ + +
std::runtime_errorif y is not between -1.0 and 1.0
+
+
+ +

Definition at line 176 of file writer.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
void stan::io::writer< T >::cov_matrix_unconstrain (matrix_ty)
+
+inline
+
+ +

Writes the unconstrained covariance matrix corresponding to the specified constrained correlation matrix.

+

The unconstraining operation is the inverse of the constraining operation in cov_matrix_constrain(Matrix<T,Dynamic,Dynamic).

+
Parameters
+ + +
yConstrained covariance matrix.
+
+
+
Exceptions
+ + +
std::runtime_errorif y has no elements or if it is not square
+
+
+ +

Definition at line 395 of file writer.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
std::vector<int>& stan::io::writer< T >::data_i ()
+
+inline
+
+ +

Return a reference to the underlying vector of integer values that have been written.

+
Returns
Values that have been written.
+ +

Definition at line 80 of file writer.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
std::vector<T>& stan::io::writer< T >::data_r ()
+
+inline
+
+ +

Return a reference to the underlying vector of real values that have been written.

+
Returns
Values that have been written.
+ +

Definition at line 69 of file writer.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
void stan::io::writer< T >::integer (int n)
+
+inline
+
+ +

Write the specified integer to the sequence of integer values.

+
Parameters
+ + +
nInteger to write.
+
+
+ +

Definition at line 89 of file writer.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::io::writer< T >::matrix_lb_unconstrain (double lb,
matrix_ty 
)
+
+inline
+
+ +

Definition at line 284 of file writer.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::io::writer< T >::matrix_lub_unconstrain (double lb,
double ub,
matrix_ty 
)
+
+inline
+
+ +

Definition at line 313 of file writer.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::io::writer< T >::matrix_ub_unconstrain (double ub,
matrix_ty 
)
+
+inline
+
+ +

Definition at line 298 of file writer.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
void stan::io::writer< T >::matrix_unconstrain (const matrix_ty)
+
+inline
+
+ +

Write the specified unconstrained matrix.

+
Parameters
+ + +
yMatrix to write.
+
+
+ +

Definition at line 270 of file writer.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
void stan::io::writer< T >::ordered_unconstrain (vector_ty)
+
+inline
+
+ +

Write the unconstrained vector that corresponds to the specified ascendingly ordered vector.

+

The unconstraining transform is defined for input vector y to produce an output vector x of the same size, defined by x[0] = log(y[0]) and by x[k] = log(y[k] - y[k-1]) for k > 0. This unconstraining transform inverts the constraining transform specified in ordered_constrain(size_t).

+
Parameters
+ + +
yAscendingly ordered vector.
+
+
+
Returns
Unconstrained vector corresponding to the specified vector.
+
Exceptions
+ + +
std::runtime_errorif vector is not in ascending order.
+
+
+ +

Definition at line 210 of file writer.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
void stan::io::writer< T >::positive_ordered_unconstrain (vector_ty)
+
+inline
+
+ +

Write the unconstrained vector that corresponds to the specified postiive ascendingly ordered vector.

+

The unconstraining transform is defined for input vector y to produce an output vector x of the same size, defined by x[0] = log(y[0]) and by x[k] = log(y[k] - y[k-1]) for k > 0. This unconstraining transform inverts the constraining transform specified in positive_ordered_constrain(size_t).

+
Parameters
+ + +
yPositive ascendingly ordered vector.
+
+
+
Returns
Unconstrained vector corresponding to the specified vector.
+
Exceptions
+ + +
std::runtime_errorif vector is not in ascending order.
+
+
+ +

Definition at line 234 of file writer.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
void stan::io::writer< T >::prob_unconstrain (T & y)
+
+inline
+
+ +

Write the unconstrained value corresponding to the specified probability value.

+

The unconstraining transform is logit(y), which inverts the constraining transform defined in prob_constrain().

+
Parameters
+ + +
yProbability value.
+
+
+
Exceptions
+ + +
std::runtime_errorif y is not between 0.0 and 1.0
+
+
+ +

Definition at line 191 of file writer.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::io::writer< T >::row_vector_lb_unconstrain (double lb,
row_vector_ty 
)
+
+inline
+
+ +

Definition at line 280 of file writer.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::io::writer< T >::row_vector_lub_unconstrain (double lb,
double ub,
row_vector_ty 
)
+
+inline
+
+ +

Definition at line 309 of file writer.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::io::writer< T >::row_vector_ub_unconstrain (double ub,
row_vector_ty 
)
+
+inline
+
+ +

Definition at line 294 of file writer.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
void stan::io::writer< T >::row_vector_unconstrain (const vector_ty)
+
+inline
+
+ +

Write the specified unconstrained vector.

+
Parameters
+ + +
yVector to write.
+
+
+ +

Definition at line 260 of file writer.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::io::writer< T >::scalar_lb_unconstrain (double lb,
T & y 
)
+
+inline
+
+ +

Return the unconstrained version of the specified input, which is constrained to be above the specified lower bound.

+

The unconstraining transform is log(y - lb), which inverts the constraining transform defined in reader::scalar_lb_constrain(double),

+
Parameters
+ + + +
lbLower bound.
yLower-bounded value.
+
+
+
Exceptions
+ + +
std::runtime_errorif y is lower than the lower bound provided.
+
+
+ +

Definition at line 132 of file writer.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::io::writer< T >::scalar_lub_unconstrain (double lb,
double ub,
T & y 
)
+
+inline
+
+ +

Write the unconstrained value corresponding to the specified value with the specified bounds.

+

The unconstraining transform is given by reader::logit((y-L)/(U-L)), which inverts the constraining transform defined in scalar_lub_constrain(double,double).

+
Parameters
+ + + + +
lbLower bound.
ubUpper bound.
yBounded value.
+
+
+
Exceptions
+ + +
std::runtime_errorif y is not between the lower and upper bounds
+
+
+ +

Definition at line 162 of file writer.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
void stan::io::writer< T >::scalar_pos_unconstrain (T & y)
+
+inline
+
+ +

Write the unconstrained value corresponding to the specified positive-constrained scalar.

+

The transformation applied is log(y), which is the inverse of constraining transform specified in reader::scalar_pos_constrain().

+

This method will fail if the argument is not non-negative.

+
Parameters
+ + +
yThe positive value.
+
+
+
Exceptions
+ + +
std::runtime_errorif y is negative.
+
+
+ +

Definition at line 115 of file writer.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::io::writer< T >::scalar_ub_unconstrain (double ub,
T & y 
)
+
+inline
+
+ +

Write the unconstrained value corresponding to the specified lower-bounded value.

+

The unconstraining transform is log(ub - y), which reverses the constraining transform defined in reader::scalar_ub_constrain(double).

+
Parameters
+ + + +
ubUpper bound.
yConstrained value.
+
+
+
Exceptions
+ + +
std::runtime_errorif y is higher than the upper bound provided.
+
+
+ +

Definition at line 146 of file writer.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
void stan::io::writer< T >::scalar_unconstrain (T & y)
+
+inline
+
+ +

Write the unconstrained value corresponding to the specified scalar.

+

Here, the unconstrain operation is a no-op, which matches reader::scalar_constrain().

+
Parameters
+ + +
yThe value.
+
+
+ +

Definition at line 100 of file writer.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
void stan::io::writer< T >::simplex_unconstrain (vector_ty)
+
+inline
+
+ +

Write the unconstrained vector corresponding to the specified simplex value.

+

If the specified constrained simplex is of size K, the returned unconstrained vector is of size K-1.

+

The transform takes y = y[1],...,y[K] and produces the unconstrained vector. This inverts the constraining transform of simplex_constrain(size_t).

+
Parameters
+ + +
ySimplex constrained value.
+
+
+
Returns
Unconstrained value.
+
Exceptions
+ + +
std::runtime_errorif the vector is not a simplex.
+
+
+ +

Definition at line 357 of file writer.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
void stan::io::writer< T >::unit_vector_unconstrain (vector_ty)
+
+inline
+
+ +

Write the unconstrained vector corresponding to the specified unit_vector value.

+

If the specified constrained unit_vector is of size K, the returned unconstrained vector is of size K-1.

+

The transform takes y = y[1],...,y[K] and produces the unconstrained vector. This inverts the constraining transform of unit_vector_constrain(size_t).

+
Parameters
+ + +
ySimplex constrained value.
+
+
+
Returns
Unconstrained value.
+
Exceptions
+ + +
std::runtime_errorif the vector is not a unit_vector.
+
+
+ +

Definition at line 335 of file writer.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::io::writer< T >::vector_lb_unconstrain (double lb,
vector_ty 
)
+
+inline
+
+ +

Definition at line 276 of file writer.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::io::writer< T >::vector_lub_unconstrain (double lb,
double ub,
vector_ty 
)
+
+inline
+
+ +

Definition at line 305 of file writer.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::io::writer< T >::vector_ub_unconstrain (double ub,
vector_ty 
)
+
+inline
+
+ +

Definition at line 290 of file writer.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
void stan::io::writer< T >::vector_unconstrain (const vector_ty)
+
+inline
+
+ +

Write the specified unconstrained vector.

+
Parameters
+ + +
yVector to write.
+
+
+ +

Definition at line 250 of file writer.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+
+template<typename T >
+ + + + +
const double stan::io::writer< T >::CONSTRAINT_TOLERANCE
+
+ +

This is the tolerance for checking arithmetic bounds in rank and in simplexes.

+

The current value is 1E-8.

+ +

Definition at line 40 of file writer.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4-members.html b/doc/api/html/classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4-members.html new file mode 100644 index 00000000000..9c2bfaf235b --- /dev/null +++ b/doc/api/html/classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4-members.html @@ -0,0 +1,125 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::math::LDLT_factor< double, R, C > Member List
+
+
+ +

This is the complete list of members for stan::math::LDLT_factor< double, R, C >, including all inherited members.

+ + + + + + + + + + + + + + +
_ldltPstan::math::LDLT_factor< double, R, C >
cols() const stan::math::LDLT_factor< double, R, C >inline
compute(const Eigen::Matrix< double, R, C > &A)stan::math::LDLT_factor< double, R, C >inline
inverse(Eigen::Matrix< double, R, C > &invA) const stan::math::LDLT_factor< double, R, C >inline
LDLT_factor()stan::math::LDLT_factor< double, R, C >inline
LDLT_factor(const Eigen::Matrix< double, R, C > &A)stan::math::LDLT_factor< double, R, C >inline
log_abs_det() const stan::math::LDLT_factor< double, R, C >inline
N_stan::math::LDLT_factor< double, R, C >
rows() const stan::math::LDLT_factor< double, R, C >inline
size_type typedefstan::math::LDLT_factor< double, R, C >
solve(const Eigen::MatrixBase< Rhs > &b) const stan::math::LDLT_factor< double, R, C >inline
solveRight(const Eigen::Matrix< double, R, C > &B) const stan::math::LDLT_factor< double, R, C >inline
success() const stan::math::LDLT_factor< double, R, C >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4.html b/doc/api/html/classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4.html new file mode 100644 index 00000000000..e389f9cce1d --- /dev/null +++ b/doc/api/html/classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4.html @@ -0,0 +1,495 @@ + + + + + +Stan: stan::math::LDLT_factor< double, R, C > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::math::LDLT_factor< double, R, C > Class Template Reference
+
+
+ +

#include <ldlt.hpp>

+ + + + +

+Public Types

typedef size_t size_type
 
+ + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 LDLT_factor ()
 
 LDLT_factor (const Eigen::Matrix< double, R, C > &A)
 
void compute (const Eigen::Matrix< double, R, C > &A)
 
bool success () const
 
double log_abs_det () const
 
void inverse (Eigen::Matrix< double, R, C > &invA) const
 
template<typename Rhs >
const
+Eigen::internal::solve_retval
+< Eigen::LDLT< Eigen::Matrix
+< double, R, C > >, Rhs > 
solve (const Eigen::MatrixBase< Rhs > &b) const
 
Eigen::Matrix< double, R, C > solveRight (const Eigen::Matrix< double, R, C > &B) const
 
size_t rows () const
 
size_t cols () const
 
+ + + + + +

+Public Attributes

size_t N_
 
boost::shared_ptr< Eigen::LDLT
+< Eigen::Matrix< double, R, C > > > 
_ldltP
 
+

Detailed Description

+

template<int R, int C>
+class stan::math::LDLT_factor< double, R, C >

+ + +

Definition at line 19 of file ldlt.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<int R, int C>
+ + + + +
typedef size_t stan::math::LDLT_factor< double, R, C >::size_type
+
+ +

Definition at line 64 of file ldlt.hpp.

+ +
+
+

Constructor & Destructor Documentation

+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + +
stan::math::LDLT_factor< double, R, C >::LDLT_factor ()
+
+inline
+
+ +

Definition at line 21 of file ldlt.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + + +
stan::math::LDLT_factor< double, R, C >::LDLT_factor (const Eigen::Matrix< double, R, C > & A)
+
+inline
+
+ +

Definition at line 22 of file ldlt.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + +
size_t stan::math::LDLT_factor< double, R, C >::cols () const
+
+inline
+
+ +

Definition at line 62 of file ldlt.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + + +
void stan::math::LDLT_factor< double, R, C >::compute (const Eigen::Matrix< double, R, C > & A)
+
+inline
+
+ +

Definition at line 28 of file ldlt.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + + +
void stan::math::LDLT_factor< double, R, C >::inverse (Eigen::Matrix< double, R, C > & invA) const
+
+inline
+
+ +

Definition at line 46 of file ldlt.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + +
double stan::math::LDLT_factor< double, R, C >::log_abs_det () const
+
+inline
+
+ +

Definition at line 42 of file ldlt.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + +
size_t stan::math::LDLT_factor< double, R, C >::rows () const
+
+inline
+
+ +

Definition at line 61 of file ldlt.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+
+template<typename Rhs >
+ + + + + +
+ + + + + + + + +
const Eigen::internal::solve_retval<Eigen::LDLT< Eigen::Matrix<double,R,C> >, Rhs> stan::math::LDLT_factor< double, R, C >::solve (const Eigen::MatrixBase< Rhs > & b) const
+
+inline
+
+ +

Definition at line 53 of file ldlt.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<double,R,C> stan::math::LDLT_factor< double, R, C >::solveRight (const Eigen::Matrix< double, R, C > & B) const
+
+inline
+
+ +

Definition at line 57 of file ldlt.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + +
bool stan::math::LDLT_factor< double, R, C >::success () const
+
+inline
+
+ +

Definition at line 34 of file ldlt.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+
+template<int R, int C>
+ + + + +
boost::shared_ptr< Eigen::LDLT< Eigen::Matrix<double,R,C> > > stan::math::LDLT_factor< double, R, C >::_ldltP
+
+ +

Definition at line 67 of file ldlt.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+ + + + +
size_t stan::math::LDLT_factor< double, R, C >::N_
+
+ +

Definition at line 66 of file ldlt.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1math_1_1_l_d_l_t__factor_3_01stan_1_1agrad_1_1var_00_01_r_00_01_c_01_4-members.html b/doc/api/html/classstan_1_1math_1_1_l_d_l_t__factor_3_01stan_1_1agrad_1_1var_00_01_r_00_01_c_01_4-members.html new file mode 100644 index 00000000000..083ab45fda7 --- /dev/null +++ b/doc/api/html/classstan_1_1math_1_1_l_d_l_t__factor_3_01stan_1_1agrad_1_1var_00_01_r_00_01_c_01_4-members.html @@ -0,0 +1,121 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::math::LDLT_factor< stan::agrad::var, R, C > Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1math_1_1_l_d_l_t__factor_3_01stan_1_1agrad_1_1var_00_01_r_00_01_c_01_4.html b/doc/api/html/classstan_1_1math_1_1_l_d_l_t__factor_3_01stan_1_1agrad_1_1var_00_01_r_00_01_c_01_4.html new file mode 100644 index 00000000000..18ae1b9b59a --- /dev/null +++ b/doc/api/html/classstan_1_1math_1_1_l_d_l_t__factor_3_01stan_1_1agrad_1_1var_00_01_r_00_01_c_01_4.html @@ -0,0 +1,387 @@ + + + + + +Stan: stan::math::LDLT_factor< stan::agrad::var, R, C > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::math::LDLT_factor< stan::agrad::var, R, C > Class Template Reference
+
+
+ +

#include <ldlt.hpp>

+ + + + +

+Public Types

typedef size_t size_type
 
+ + + + + + + + + + + + + + + + +

+Public Member Functions

 LDLT_factor ()
 
 LDLT_factor (const Eigen::Matrix< stan::agrad::var, R, C > &A)
 
void compute (const Eigen::Matrix< stan::agrad::var, R, C > &A)
 
template<typename Rhs >
const
+Eigen::internal::solve_retval
+< Eigen::LDLT< Eigen::Matrix
+< double, R, C > >, Rhs > 
solve (const Eigen::MatrixBase< Rhs > &b) const
 
bool success () const
 
size_t rows () const
 
size_t cols () const
 
+ + + +

+Public Attributes

stan::agrad::LDLT_alloc< R, C > * _alloc
 
+

Detailed Description

+

template<int R, int C>
+class stan::math::LDLT_factor< stan::agrad::var, R, C >

+ + +

Definition at line 56 of file ldlt.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<int R, int C>
+ + + + +
typedef size_t stan::math::LDLT_factor< stan::agrad::var, R, C >::size_type
+
+ +

Definition at line 84 of file ldlt.hpp.

+ +
+
+

Constructor & Destructor Documentation

+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + +
stan::math::LDLT_factor< stan::agrad::var, R, C >::LDLT_factor ()
+
+inline
+
+ +

Definition at line 58 of file ldlt.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + + +
stan::math::LDLT_factor< stan::agrad::var, R, C >::LDLT_factor (const Eigen::Matrix< stan::agrad::var, R, C > & A)
+
+inline
+
+ +

Definition at line 59 of file ldlt.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + +
size_t stan::math::LDLT_factor< stan::agrad::var, R, C >::cols () const
+
+inline
+
+ +

Definition at line 82 of file ldlt.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + + +
void stan::math::LDLT_factor< stan::agrad::var, R, C >::compute (const Eigen::Matrix< stan::agrad::var, R, C > & A)
+
+inline
+
+ +

Definition at line 61 of file ldlt.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + +
size_t stan::math::LDLT_factor< stan::agrad::var, R, C >::rows () const
+
+inline
+
+ +

Definition at line 81 of file ldlt.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+
+template<typename Rhs >
+ + + + + +
+ + + + + + + + +
const Eigen::internal::solve_retval<Eigen::LDLT< Eigen::Matrix<double,R,C> >, Rhs> stan::math::LDLT_factor< stan::agrad::var, R, C >::solve (const Eigen::MatrixBase< Rhs > & b) const
+
+inline
+
+ +

Definition at line 69 of file ldlt.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + +
bool stan::math::LDLT_factor< stan::agrad::var, R, C >::success () const
+
+inline
+
+ +

Definition at line 73 of file ldlt.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+
+template<int R, int C>
+ + + + +
stan::agrad::LDLT_alloc<R,C>* stan::math::LDLT_factor< stan::agrad::var, R, C >::_alloc
+
+ +

Definition at line 86 of file ldlt.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1math_1_1accumulator-members.html b/doc/api/html/classstan_1_1math_1_1accumulator-members.html new file mode 100644 index 00000000000..304bcc8b9cb --- /dev/null +++ b/doc/api/html/classstan_1_1math_1_1accumulator-members.html @@ -0,0 +1,116 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::math::accumulator< T > Member List
+
+
+ +

This is the complete list of members for stan::math::accumulator< T >, including all inherited members.

+ + + + + +
accumulator()stan::math::accumulator< T >inline
add(const T &x)stan::math::accumulator< T >inline
sum()stan::math::accumulator< T >inline
~accumulator()stan::math::accumulator< T >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1math_1_1accumulator.html b/doc/api/html/classstan_1_1math_1_1accumulator.html new file mode 100644 index 00000000000..78a0ee13642 --- /dev/null +++ b/doc/api/html/classstan_1_1math_1_1accumulator.html @@ -0,0 +1,274 @@ + + + + + +Stan: stan::math::accumulator< T > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::math::accumulator< T > Class Template Reference
+
+
+ +

Class to accumulate values and eventually return their sum. + More...

+ +

#include <accumulator.hpp>

+ + + + + + + + + + + + + +

+Public Member Functions

 accumulator ()
 Construct an accumulator.
 
 ~accumulator ()
 
void add (const T &x)
 Add the specified value to the buffer.
 
sum ()
 Return the sum of the accumulated values.
 
+

Detailed Description

+

template<typename T>
+class stan::math::accumulator< T >

+ +

Class to accumulate values and eventually return their sum.

+

If no values are ever added, the return value is 0.

+

This class is useful for speeding up auto-diff of long sums because it uses the sum() operation (either from stan::math or one defined by argument-dependent lookup.

+
Template Parameters
+ + +
TType of scalar added
+
+
+ +

Definition at line 21 of file accumulator.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
stan::math::accumulator< T >::accumulator ()
+
+inline
+
+ +

Construct an accumulator.

+ +

Definition at line 29 of file accumulator.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
stan::math::accumulator< T >::~accumulator ()
+
+inline
+
+ +

Definition at line 33 of file accumulator.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
void stan::math::accumulator< T >::add (const T & x)
+
+inline
+
+ +

Add the specified value to the buffer.

+
Parameters
+ + +
xValue to add.
+
+
+ +

Definition at line 40 of file accumulator.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
T stan::math::accumulator< T >::sum ()
+
+inline
+
+ +

Return the sum of the accumulated values.

+
Returns
Sum of accumulated values.
+ +

Definition at line 49 of file accumulator.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1math_1_1seq__view-members.html b/doc/api/html/classstan_1_1math_1_1seq__view-members.html new file mode 100644 index 00000000000..04f5d7e72c3 --- /dev/null +++ b/doc/api/html/classstan_1_1math_1_1seq__view-members.html @@ -0,0 +1,115 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::math::seq_view< T, S > Member List
+
+
+ +

This is the complete list of members for stan::math::seq_view< T, S >, including all inherited members.

+ + + + +
operator[](int n) const stan::math::seq_view< T, S >inline
seq_view(typename pass_type< S >::type x)stan::math::seq_view< T, S >inline
size() const stan::math::seq_view< T, S >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1math_1_1seq__view.html b/doc/api/html/classstan_1_1math_1_1seq__view.html new file mode 100644 index 00000000000..eaff5f2d636 --- /dev/null +++ b/doc/api/html/classstan_1_1math_1_1seq__view.html @@ -0,0 +1,218 @@ + + + + + +Stan: stan::math::seq_view< T, S > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::math::seq_view< T, S > Class Template Reference
+
+
+ +

#include <seq_view.hpp>

+ + + + + + + + +

+Public Member Functions

 seq_view (typename pass_type< S >::type x)
 
pass_type< T >::type operator[] (int n) const
 
int size () const
 
+

Detailed Description

+

template<typename T, typename S>
+class stan::math::seq_view< T, S >

+ + +

Definition at line 43 of file seq_view.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename T , typename S >
+ + + + + +
+ + + + + + + + +
stan::math::seq_view< T, S >::seq_view (typename pass_type< S >::type x)
+
+inline
+
+ +

Definition at line 47 of file seq_view.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename T , typename S >
+ + + + + +
+ + + + + + + + +
pass_type<T>::type stan::math::seq_view< T, S >::operator[] (int n) const
+
+inline
+
+ +

Definition at line 51 of file seq_view.hpp.

+ +
+
+ +
+
+
+template<typename T , typename S >
+ + + + + +
+ + + + + + + +
int stan::math::seq_view< T, S >::size () const
+
+inline
+
+ +

Definition at line 54 of file seq_view.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_011_00_01_eigen_1_1_dynamic_01_4_01_4-members.html b/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_011_00_01_eigen_1_1_dynamic_01_4_01_4-members.html new file mode 100644 index 00000000000..d9574f2ab7a --- /dev/null +++ b/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_011_00_01_eigen_1_1_dynamic_01_4_01_4-members.html @@ -0,0 +1,115 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::math::seq_view< T, Eigen::Matrix< S, 1, Eigen::Dynamic > > Member List
+
+
+ +

This is the complete list of members for stan::math::seq_view< T, Eigen::Matrix< S, 1, Eigen::Dynamic > >, including all inherited members.

+ + + + +
operator[](int n) const stan::math::seq_view< T, Eigen::Matrix< S, 1, Eigen::Dynamic > >inline
seq_view(typename pass_type< Eigen::Matrix< S, 1, Eigen::Dynamic > >::type x)stan::math::seq_view< T, Eigen::Matrix< S, 1, Eigen::Dynamic > >inline
size() const stan::math::seq_view< T, Eigen::Matrix< S, 1, Eigen::Dynamic > >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_011_00_01_eigen_1_1_dynamic_01_4_01_4.html b/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_011_00_01_eigen_1_1_dynamic_01_4_01_4.html new file mode 100644 index 00000000000..6368294fff5 --- /dev/null +++ b/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_011_00_01_eigen_1_1_dynamic_01_4_01_4.html @@ -0,0 +1,218 @@ + + + + + +Stan: stan::math::seq_view< T, Eigen::Matrix< S, 1, Eigen::Dynamic > > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::math::seq_view< T, Eigen::Matrix< S, 1, Eigen::Dynamic > > Class Template Reference
+
+
+ +

#include <seq_view.hpp>

+ + + + + + + + +

+Public Member Functions

 seq_view (typename pass_type< Eigen::Matrix< S, 1, Eigen::Dynamic > >::type x)
 
pass_type< T >::type operator[] (int n) const
 
int size () const
 
+

Detailed Description

+

template<typename T, typename S>
+class stan::math::seq_view< T, Eigen::Matrix< S, 1, Eigen::Dynamic > >

+ + +

Definition at line 78 of file seq_view.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename T , typename S >
+ + + + + +
+ + + + + + + + +
stan::math::seq_view< T, Eigen::Matrix< S, 1, Eigen::Dynamic > >::seq_view (typename pass_type< Eigen::Matrix< S, 1, Eigen::Dynamic > >::type x)
+
+inline
+
+ +

Definition at line 82 of file seq_view.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename T , typename S >
+ + + + + +
+ + + + + + + + +
pass_type<T>::type stan::math::seq_view< T, Eigen::Matrix< S, 1, Eigen::Dynamic > >::operator[] (int n) const
+
+inline
+
+ +

Definition at line 86 of file seq_view.hpp.

+ +
+
+ +
+
+
+template<typename T , typename S >
+ + + + + +
+ + + + + + + +
int stan::math::seq_view< T, Eigen::Matrix< S, 1, Eigen::Dynamic > >::size () const
+
+inline
+
+ +

Definition at line 89 of file seq_view.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_01_eigen_1_1_dynamic_00_011_01_4_01_4-members.html b/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_01_eigen_1_1_dynamic_00_011_01_4_01_4-members.html new file mode 100644 index 00000000000..f1672e9297b --- /dev/null +++ b/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_01_eigen_1_1_dynamic_00_011_01_4_01_4-members.html @@ -0,0 +1,115 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::math::seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, 1 > > Member List
+
+
+ +

This is the complete list of members for stan::math::seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, 1 > >, including all inherited members.

+ + + + +
operator[](int n) const stan::math::seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, 1 > >inline
seq_view(typename pass_type< Eigen::Matrix< S, Eigen::Dynamic, 1 > >::type x)stan::math::seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, 1 > >inline
size() const stan::math::seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, 1 > >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_01_eigen_1_1_dynamic_00_011_01_4_01_4.html b/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_01_eigen_1_1_dynamic_00_011_01_4_01_4.html new file mode 100644 index 00000000000..5c8d9b27d8e --- /dev/null +++ b/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_01_eigen_1_1_dynamic_00_011_01_4_01_4.html @@ -0,0 +1,218 @@ + + + + + +Stan: stan::math::seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, 1 > > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::math::seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, 1 > > Class Template Reference
+
+
+ +

#include <seq_view.hpp>

+ + + + + + + + +

+Public Member Functions

 seq_view (typename pass_type< Eigen::Matrix< S, Eigen::Dynamic, 1 > >::type x)
 
pass_type< T >::type operator[] (int n) const
 
int size () const
 
+

Detailed Description

+

template<typename T, typename S>
+class stan::math::seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, 1 > >

+ + +

Definition at line 60 of file seq_view.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename T , typename S >
+ + + + + +
+ + + + + + + + +
stan::math::seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, 1 > >::seq_view (typename pass_type< Eigen::Matrix< S, Eigen::Dynamic, 1 > >::type x)
+
+inline
+
+ +

Definition at line 64 of file seq_view.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename T , typename S >
+ + + + + +
+ + + + + + + + +
pass_type<T>::type stan::math::seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, 1 > >::operator[] (int n) const
+
+inline
+
+ +

Definition at line 68 of file seq_view.hpp.

+ +
+
+ +
+
+
+template<typename T , typename S >
+ + + + + +
+ + + + + + + +
int stan::math::seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, 1 > >::size () const
+
+inline
+
+ +

Definition at line 71 of file seq_view.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4.html b/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4.html new file mode 100644 index 00000000000..2540f41a6e0 --- /dev/null +++ b/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4.html @@ -0,0 +1,218 @@ + + + + + +Stan: stan::math::seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, Eigen::Dynamic > > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::math::seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, Eigen::Dynamic > > Class Template Reference
+
+
+ +

#include <seq_view.hpp>

+ + + + + + + + +

+Public Member Functions

 seq_view (typename pass_type< Eigen::Matrix< S, Eigen::Dynamic, Eigen::Dynamic > >::type x)
 
pass_type< T >::type operator[] (int n) const
 
int size () const
 
+

Detailed Description

+

template<typename T, typename S>
+class stan::math::seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, Eigen::Dynamic > >

+ + +

Definition at line 98 of file seq_view.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename T , typename S >
+ + + + + +
+ + + + + + + + +
stan::math::seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, Eigen::Dynamic > >::seq_view (typename pass_type< Eigen::Matrix< S, Eigen::Dynamic, Eigen::Dynamic > >::type x)
+
+inline
+
+ +

Definition at line 102 of file seq_view.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename T , typename S >
+ + + + + +
+ + + + + + + + +
pass_type<T>::type stan::math::seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, Eigen::Dynamic > >::operator[] (int n) const
+
+inline
+
+ +

Definition at line 106 of file seq_view.hpp.

+ +
+
+ +
+
+
+template<typename T , typename S >
+ + + + + +
+ + + + + + + +
int stan::math::seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, Eigen::Dynamic > >::size () const
+
+inline
+
+ +

Definition at line 109 of file seq_view.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_01_eigen_1_1_dynamic_00_085212abef8028c93e19b6c8ba8c0204d.html b/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_01_eigen_1_1_dynamic_00_085212abef8028c93e19b6c8ba8c0204d.html new file mode 100644 index 00000000000..42bcea9dd80 --- /dev/null +++ b/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_01_eigen_1_1_dynamic_00_085212abef8028c93e19b6c8ba8c0204d.html @@ -0,0 +1,115 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::math::seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, Eigen::Dynamic > > Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01_s_01_4_01_4-members.html b/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01_s_01_4_01_4-members.html new file mode 100644 index 00000000000..273bf6bea83 --- /dev/null +++ b/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01_s_01_4_01_4-members.html @@ -0,0 +1,115 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::math::seq_view< T, std::vector< S > > Member List
+
+
+ +

This is the complete list of members for stan::math::seq_view< T, std::vector< S > >, including all inherited members.

+ + + + +
operator[](int n) const stan::math::seq_view< T, std::vector< S > >inline
seq_view(typename pass_type< std::vector< S > >::type x)stan::math::seq_view< T, std::vector< S > >inline
size() const stan::math::seq_view< T, std::vector< S > >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01_s_01_4_01_4.html b/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01_s_01_4_01_4.html new file mode 100644 index 00000000000..a842f24dd7c --- /dev/null +++ b/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01_s_01_4_01_4.html @@ -0,0 +1,218 @@ + + + + + +Stan: stan::math::seq_view< T, std::vector< S > > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::math::seq_view< T, std::vector< S > > Class Template Reference
+
+
+ +

#include <seq_view.hpp>

+ + + + + + + + +

+Public Member Functions

 seq_view (typename pass_type< std::vector< S > >::type x)
 
pass_type< T >::type operator[] (int n) const
 
int size () const
 
+

Detailed Description

+

template<typename T, typename S>
+class stan::math::seq_view< T, std::vector< S > >

+ + +

Definition at line 116 of file seq_view.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename T , typename S >
+ + + + + +
+ + + + + + + + +
stan::math::seq_view< T, std::vector< S > >::seq_view (typename pass_type< std::vector< S > >::type x)
+
+inline
+
+ +

Definition at line 121 of file seq_view.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename T , typename S >
+ + + + + +
+ + + + + + + + +
pass_type<T>::type stan::math::seq_view< T, std::vector< S > >::operator[] (int n) const
+
+inline
+
+ +

Definition at line 126 of file seq_view.hpp.

+ +
+
+ +
+
+
+template<typename T , typename S >
+ + + + + +
+ + + + + + + +
int stan::math::seq_view< T, std::vector< S > >::size () const
+
+inline
+
+ +

Definition at line 129 of file seq_view.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01_t_01_4_01_4-members.html b/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01_t_01_4_01_4-members.html new file mode 100644 index 00000000000..f454bc0214f --- /dev/null +++ b/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01_t_01_4_01_4-members.html @@ -0,0 +1,115 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::math::seq_view< T, std::vector< T > > Member List
+
+
+ +

This is the complete list of members for stan::math::seq_view< T, std::vector< T > >, including all inherited members.

+ + + + +
operator[](int n) const stan::math::seq_view< T, std::vector< T > >inline
seq_view(typename pass_type< std::vector< T > >::type x)stan::math::seq_view< T, std::vector< T > >inline
size() const stan::math::seq_view< T, std::vector< T > >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01_t_01_4_01_4.html b/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01_t_01_4_01_4.html new file mode 100644 index 00000000000..cb490916b38 --- /dev/null +++ b/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01_t_01_4_01_4.html @@ -0,0 +1,218 @@ + + + + + +Stan: stan::math::seq_view< T, std::vector< T > > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::math::seq_view< T, std::vector< T > > Class Template Reference
+
+
+ +

#include <seq_view.hpp>

+ + + + + + + + +

+Public Member Functions

 seq_view (typename pass_type< std::vector< T > >::type x)
 
pass_type< T >::type operator[] (int n) const
 
int size () const
 
+

Detailed Description

+

template<typename T>
+class stan::math::seq_view< T, std::vector< T > >

+ + +

Definition at line 137 of file seq_view.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
stan::math::seq_view< T, std::vector< T > >::seq_view (typename pass_type< std::vector< T > >::type x)
+
+inline
+
+ +

Definition at line 141 of file seq_view.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
pass_type<T>::type stan::math::seq_view< T, std::vector< T > >::operator[] (int n) const
+
+inline
+
+ +

Definition at line 145 of file seq_view.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
int stan::math::seq_view< T, std::vector< T > >::size () const
+
+inline
+
+ +

Definition at line 148 of file seq_view.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01std_1_1vector_3_01_t_01_4_01_4_01_4-members.html b/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01std_1_1vector_3_01_t_01_4_01_4_01_4-members.html new file mode 100644 index 00000000000..a07411601ec --- /dev/null +++ b/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01std_1_1vector_3_01_t_01_4_01_4_01_4-members.html @@ -0,0 +1,115 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::math::seq_view< T, std::vector< std::vector< T > > > Member List
+
+
+ +

This is the complete list of members for stan::math::seq_view< T, std::vector< std::vector< T > > >, including all inherited members.

+ + + + +
operator[](int n) const stan::math::seq_view< T, std::vector< std::vector< T > > >inline
seq_view(typename pass_type< std::vector< std::vector< T > > >::type x)stan::math::seq_view< T, std::vector< std::vector< T > > >inline
size() const stan::math::seq_view< T, std::vector< std::vector< T > > >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01std_1_1vector_3_01_t_01_4_01_4_01_4.html b/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01std_1_1vector_3_01_t_01_4_01_4_01_4.html new file mode 100644 index 00000000000..3b1ed192fef --- /dev/null +++ b/doc/api/html/classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01std_1_1vector_3_01_t_01_4_01_4_01_4.html @@ -0,0 +1,218 @@ + + + + + +Stan: stan::math::seq_view< T, std::vector< std::vector< T > > > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::math::seq_view< T, std::vector< std::vector< T > > > Class Template Reference
+
+
+ +

#include <seq_view.hpp>

+ + + + + + + + +

+Public Member Functions

 seq_view (typename pass_type< std::vector< std::vector< T > > >::type x)
 
pass_type< T >::type operator[] (int n) const
 
int size () const
 
+

Detailed Description

+

template<typename T>
+class stan::math::seq_view< T, std::vector< std::vector< T > > >

+ + +

Definition at line 156 of file seq_view.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
stan::math::seq_view< T, std::vector< std::vector< T > > >::seq_view (typename pass_type< std::vector< std::vector< T > > >::type x)
+
+inline
+
+ +

Definition at line 161 of file seq_view.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
pass_type<T>::type stan::math::seq_view< T, std::vector< std::vector< T > > >::operator[] (int n) const
+
+inline
+
+ +

Definition at line 165 of file seq_view.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
int stan::math::seq_view< T, std::vector< std::vector< T > > >::size () const
+
+inline
+
+ +

Definition at line 168 of file seq_view.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1math_1_1seq__view_3_01double_00_01std_1_1vector_3_01int_01_4_01_4-members.html b/doc/api/html/classstan_1_1math_1_1seq__view_3_01double_00_01std_1_1vector_3_01int_01_4_01_4-members.html new file mode 100644 index 00000000000..fa147aa07bb --- /dev/null +++ b/doc/api/html/classstan_1_1math_1_1seq__view_3_01double_00_01std_1_1vector_3_01int_01_4_01_4-members.html @@ -0,0 +1,115 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::math::seq_view< double, std::vector< int > > Member List
+
+
+ +

This is the complete list of members for stan::math::seq_view< double, std::vector< int > >, including all inherited members.

+ + + + +
operator[](int n) const stan::math::seq_view< double, std::vector< int > >inline
seq_view(pass_type< std::vector< int > >::type x)stan::math::seq_view< double, std::vector< int > >inline
size() const stan::math::seq_view< double, std::vector< int > >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1math_1_1seq__view_3_01double_00_01std_1_1vector_3_01int_01_4_01_4.html b/doc/api/html/classstan_1_1math_1_1seq__view_3_01double_00_01std_1_1vector_3_01int_01_4_01_4.html new file mode 100644 index 00000000000..4cf633136ad --- /dev/null +++ b/doc/api/html/classstan_1_1math_1_1seq__view_3_01double_00_01std_1_1vector_3_01int_01_4_01_4.html @@ -0,0 +1,212 @@ + + + + + +Stan: stan::math::seq_view< double, std::vector< int > > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::math::seq_view< double, std::vector< int > > Class Template Reference
+
+
+ +

#include <seq_view.hpp>

+ + + + + + + + +

+Public Member Functions

 seq_view (pass_type< std::vector< int > >::type x)
 
pass_type< double >::type operator[] (int n) const
 
int size () const
 
+

Detailed Description

+

template<>
+class stan::math::seq_view< double, std::vector< int > >

+ + +

Definition at line 174 of file seq_view.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::math::seq_view< double, std::vector< int > >::seq_view (pass_type< std::vector< int > >::type x)
+
+inline
+
+ +

Definition at line 178 of file seq_view.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
pass_type<double>::type stan::math::seq_view< double, std::vector< int > >::operator[] (int n) const
+
+inline
+
+ +

Definition at line 181 of file seq_view.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
int stan::math::seq_view< double, std::vector< int > >::size () const
+
+inline
+
+ +

Definition at line 184 of file seq_view.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1adapt__dense__e__nuts-members.html b/doc/api/html/classstan_1_1mcmc_1_1adapt__dense__e__nuts-members.html new file mode 100644 index 00000000000..cc463366a5a --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1adapt__dense__e__nuts-members.html @@ -0,0 +1,170 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::adapt_dense_e_nuts< M, BaseRNG > Member List
+
+
+ +

This is the complete list of members for stan::mcmc::adapt_dense_e_nuts< M, BaseRNG >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_adapt_flagstan::mcmc::base_adapterprotected
_covar_adaptationstan::mcmc::stepsize_covar_adapterprotected
_depthstan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >
_epsilonstan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
_epsilon_jitterstan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
_err_streamstan::mcmc::base_mcmcprotected
_hamiltonianstan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
_integratorstan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
_max_deltastan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >
_max_depthstan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >
_n_divergentstan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >
_namestan::mcmc::base_mcmcprotected
_nom_epsilonstan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
_out_streamstan::mcmc::base_mcmcprotected
_rand_intstan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
_rand_uniformstan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
_stepsize_adaptationstan::mcmc::stepsize_covar_adapterprotected
_zstan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
adapt_dense_e_nuts(M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)stan::mcmc::adapt_dense_e_nuts< M, BaseRNG >inline
adapting()stan::mcmc::base_adapterinline
base_adapter()stan::mcmc::base_adapterinline
base_hmc(M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
base_mcmc(std::ostream *o, std::ostream *e)stan::mcmc::base_mcmcinline
base_nuts(M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)stan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
build_tree(int depth, Eigen::VectorXd &rho, ps_point *z_init_parent, ps_point &z_propose, nuts_util &util)stan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
compute_criterion(ps_point &start, dense_e_point &finish, Eigen::VectorXd &rho)stan::mcmc::dense_e_nuts< M, BaseRNG >inlinevirtual
dense_e_nuts(M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)stan::mcmc::dense_e_nuts< M, BaseRNG >inline
disengage_adaptation()stan::mcmc::adapt_dense_e_nuts< M, BaseRNG >inlinevirtual
engage_adaptation()stan::mcmc::base_adapterinlinevirtual
get_covar_adaptation()stan::mcmc::stepsize_covar_adapterinline
get_current_stepsize()stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
get_max_delta()stan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
get_max_depth()stan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
get_nominal_stepsize()stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
get_sampler_diagnostic_names(std::vector< std::string > &model_names, std::vector< std::string > &names)stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_diagnostics(std::vector< double > &values)stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_param_names(std::vector< std::string > &names)stan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_params(std::vector< double > &values)stan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_stepsize_adaptation()stan::mcmc::stepsize_covar_adapterinline
get_stepsize_jitter()stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
init_stepsize()stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
name()stan::mcmc::base_mcmcinline
sample_stepsize()stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
seed(const Eigen::VectorXd &q)stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
set_max_delta(const double d)stan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
set_max_depth(const int d)stan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
set_nominal_stepsize(const double e)stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
set_stepsize_jitter(const double j)stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
set_window_params(unsigned int num_warmup, unsigned int init_buffer, unsigned int term_buffer, unsigned int base_window, std::ostream *e=0)stan::mcmc::stepsize_covar_adapterinline
stepsize_covar_adapter(int n)stan::mcmc::stepsize_covar_adapterinline
transition(sample &init_sample)stan::mcmc::adapt_dense_e_nuts< M, BaseRNG >inlinevirtual
write_sampler_param_names(std::ostream &o)stan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
write_sampler_params(std::ostream &o)stan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
write_sampler_state(std::ostream *o)stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
z()stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
~adapt_dense_e_nuts()stan::mcmc::adapt_dense_e_nuts< M, BaseRNG >inline
~base_mcmc()stan::mcmc::base_mcmcinlinevirtual
~base_nuts()stan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1adapt__dense__e__nuts.html b/doc/api/html/classstan_1_1mcmc_1_1adapt__dense__e__nuts.html new file mode 100644 index 00000000000..51bd0472289 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1adapt__dense__e__nuts.html @@ -0,0 +1,402 @@ + + + + + +Stan: stan::mcmc::adapt_dense_e_nuts< M, BaseRNG > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::adapt_dense_e_nuts< M, BaseRNG > Class Template Reference
+
+
+ +

#include <adapt_dense_e_nuts.hpp>

+
+Inheritance diagram for stan::mcmc::adapt_dense_e_nuts< M, BaseRNG >:
+
+
+ + +stan::mcmc::dense_e_nuts< M, BaseRNG > +stan::mcmc::stepsize_covar_adapter +stan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_adapter +stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_mcmc + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 adapt_dense_e_nuts (M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)
 
 ~adapt_dense_e_nuts ()
 
sample transition (sample &init_sample)
 
void disengage_adaptation ()
 
- Public Member Functions inherited from stan::mcmc::dense_e_nuts< M, BaseRNG >
 dense_e_nuts (M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)
 
bool compute_criterion (ps_point &start, dense_e_point &finish, Eigen::VectorXd &rho)
 
- Public Member Functions inherited from stan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >
 base_nuts (M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)
 
 ~base_nuts ()
 
void set_max_depth (const int d)
 
void set_max_delta (const double d)
 
int get_max_depth ()
 
double get_max_delta ()
 
sample transition (sample &init_sample)
 
void write_sampler_param_names (std::ostream &o)
 
void write_sampler_params (std::ostream &o)
 
void get_sampler_param_names (std::vector< std::string > &names)
 
void get_sampler_params (std::vector< double > &values)
 
int build_tree (int depth, Eigen::VectorXd &rho, ps_point *z_init_parent, ps_point &z_propose, nuts_util &util)
 
- Public Member Functions inherited from stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >
 base_hmc (M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)
 
void write_sampler_state (std::ostream *o)
 
void get_sampler_diagnostic_names (std::vector< std::string > &model_names, std::vector< std::string > &names)
 
void get_sampler_diagnostics (std::vector< double > &values)
 
void seed (const Eigen::VectorXd &q)
 
void init_stepsize ()
 
dense_e_pointz ()
 
virtual void set_nominal_stepsize (const double e)
 
double get_nominal_stepsize ()
 
double get_current_stepsize ()
 
virtual void set_stepsize_jitter (const double j)
 
double get_stepsize_jitter ()
 
void sample_stepsize ()
 
- Public Member Functions inherited from stan::mcmc::base_mcmc
 base_mcmc (std::ostream *o, std::ostream *e)
 
virtual ~base_mcmc ()
 
std::string name ()
 
- Public Member Functions inherited from stan::mcmc::stepsize_covar_adapter
 stepsize_covar_adapter (int n)
 
stepsize_adaptationget_stepsize_adaptation ()
 
covar_adaptationget_covar_adaptation ()
 
void set_window_params (unsigned int num_warmup, unsigned int init_buffer, unsigned int term_buffer, unsigned int base_window, std::ostream *e=0)
 
- Public Member Functions inherited from stan::mcmc::base_adapter
 base_adapter ()
 
virtual void engage_adaptation ()
 
bool adapting ()
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Public Attributes inherited from stan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >
int _depth
 
int _max_depth
 
double _max_delta
 
int _n_divergent
 
- Protected Attributes inherited from stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >
dense_e_point _z
 
expl_leapfrog< dense_e_metric
+< M, BaseRNG >, dense_e_point
_integrator
 
dense_e_metric< M, BaseRNG > _hamiltonian
 
BaseRNG & _rand_int
 
boost::uniform_01< BaseRNG & > _rand_uniform
 
double _nom_epsilon
 
double _epsilon
 
double _epsilon_jitter
 
- Protected Attributes inherited from stan::mcmc::stepsize_covar_adapter
stepsize_adaptation _stepsize_adaptation
 
covar_adaptation _covar_adaptation
 
+

Detailed Description

+

template<typename M, class BaseRNG>
+class stan::mcmc::adapt_dense_e_nuts< M, BaseRNG >

+ + +

Definition at line 16 of file adapt_dense_e_nuts.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::mcmc::adapt_dense_e_nuts< M, BaseRNG >::adapt_dense_e_nuts (M & m,
BaseRNG & rng,
std::ostream * o = &std::cout,
std::ostream * e = 0 
)
+
+inline
+
+ +

Definition at line 21 of file adapt_dense_e_nuts.hpp.

+ +
+
+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + +
stan::mcmc::adapt_dense_e_nuts< M, BaseRNG >::~adapt_dense_e_nuts ()
+
+inline
+
+ +

Definition at line 27 of file adapt_dense_e_nuts.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + +
void stan::mcmc::adapt_dense_e_nuts< M, BaseRNG >::disengage_adaptation ()
+
+inlinevirtual
+
+ +

Reimplemented from stan::mcmc::base_adapter.

+ +

Definition at line 52 of file adapt_dense_e_nuts.hpp.

+ +
+
+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + + +
sample stan::mcmc::adapt_dense_e_nuts< M, BaseRNG >::transition (sampleinit_sample)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_mcmc.

+ +

Definition at line 29 of file adapt_dense_e_nuts.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1adapt__dense__e__nuts.png b/doc/api/html/classstan_1_1mcmc_1_1adapt__dense__e__nuts.png new file mode 100644 index 0000000000000000000000000000000000000000..4d06280d3c2ce1df3d9a7107c142c8cf2edf05cc GIT binary patch literal 4606 zcmds5X;f25+72O#K_D1yKpTy=K@b6HL>7gh(jp>b;eEm*=VX zy*Hg5&!{TzQU-xQs%ZP~TtOfR1n3L5C<5)-vhGUYrsaIr{j^Lb1G*pQS7V5snLzK? zAC*eobd!Yu9=BX|b#wy(Lh|cfpSuYNwCxu9yOZv53JW8{Sf+*g>90 zDa&HFZ^yZ~OKuS59ZzOC?@Z6R-7O2^ zIVVUe4mzMxxIO9QV@R=NE8Ie-cai_N7tQZ<2RrNIkvp>;Kz(T#&dO+4xtJ)(K*^dL z1Vq~5l4_WjK;Y6(^E9Wxb^XxWlIw&Q6Kzg zZV(q~<_u6;ej8*@H=4xw8J@}?2ec(2DYk#p+jf*DLdZyyh*Ef}D-_vV{6+8IvDTfk zP<^`TIYsa$<@DaKcj!3>82~1A4zd~@{iFPD@%d@D^VSo1aES|`4A|Cn6VNIGF8Hr& z@j$SA*5~C#2f#vIz>fb-ptyt4CVGI&8X%5neoK;-NVk)H{nCx(*?}PiY23%2hytXN zRdSxFW7)Y}ZroI6UH|ejO{oO%AKMYk7~DV{TRm*Q7oGekq7Ki6iV4&0Ed*rtjK)M7 zH^Wn-@~A|TWsxTN{DrqS7R{G$M@6O}8YGuu>ULeR+PDcBU3|Ul8G%)oMK*}*=aiT` zDLWHHszx?OMcj7!>R8OsczQee}7107kgzbCL#sds{rgeA7a!HRdr|X zTa&<Ga@FEu8(nNSYGfSCpZdk-!#uNY6=Nh2u7&7;rVijw-!7b++754g z$5~h;BA;51bI;6UKdcXAjN5oGoQFyhJ~EeD3*+|U-(j`U98?gFZ<9ye5GB`X(sL7= zu=YBjU_-o82(tzgRM-@D^E|ZDly?@)JR&ldX1PgkLXxdlu(o>~I33gBj!PR%X*MKd zG;U-51X!?84Jl?JpX$$*11!)V_U&xktLDk*zS(Avk0VMI0e;$fJ?C&*vR<*aJ%@bC z=6#jYLPGe9<(jJFg0RDOl_f@Jo3f}<@kk1rpshs)oR~#z@Ok}Wt>hwXebpq0?p7hj z;QYY`;d>l{Hm>U8O9MR944)+I{-N$e)L*ME$ z8f3wJ0*W=C1DW2-ECBXs0FW3vo$%}&sc33=#p${u31;CpHW6Hu?mf33jluwCtg+`L zg)gXWAmd-sh=Dzn5!@RmH2>S42U(MrJ?FVaD3z7HYaXDK_x?aQP`<$p?=S2n$ZmI{hDR-fPY{O!nU+BiU+rBJmOY;VjT`+{r%;p@etbx z^PoBwcAQ}T{?Fb-@Al!BY0)LR?@F(O5}9WIphuMxg89Lz@6^!S6*zOiQX>tdHZ31mu9{nU$cW{Jq9yqZ0) zCtZG5XwPBTvNNu)b}K?FpHJ9>1qyRnvL*`IgT#LoBO;tg#oRi73i*WuYdLcQm-AhI4r+YcjYI!|^eki4Xvkv$pV$ zl!GlWg?W3dd4l_`sx*AvSM{aXhN(>d^30)z`0g*P?LCs5EIB4!;1ZG@NJLAu0wm3HPqb|1hhnAL8Nwm7bO(SX ztI5#khX5K{OX@PkNgRlFl4jeiNkt$56IlZdz(Ip@j9CGq>GHIs%MF0tqklKF2>;AS z6SbMt&uJh`>yEjev5BFgR?bDl_3~g4fxkAi(#5G)339)O(<;nWQ0YtL=O=6B=PIN- z)WN#wCaG6Kxj)4DY&O;(K&d$OgX~I&Z;XZRq&_kg8(V!@sAO=yi}z)jzrXAfy7pi2 zGVNoq@j1GCS?ImZKg)ZjR%L)SO#r+h(P+}xBOnoWm#4Xf4tvpd@;rD%4$QHhg4z}`WF_Zpmr7@1G~4PIk5Rrf_jS4;TC(g@f7+Qu+p=}44ue@ z=^O}3ze0e>gU0SoqL6_9nbnsS*I{8vtO0)e`v%_?@QC*w;CqEE#*0-|p z-fblN=HfSa%xpEZ)oeVeKyY<65=YUB(+&!r8W>3!IZYqMj1Rp!1AjlzqB&*@okwON z13NMH99YiF3H3COHIFD^Sk(jKlZfN{(d}Qc?ZMH?&!NMUhss|uj&=Vqgvz9zJQCrv z>I`Pk&o8y7!5a~XGzag^k^^5Y>BEKFOPA^`rUOP^4P#~D?>l@Ko_q?jBPD&^o(3_( zUAde~LkI2Vz+>OmwzS~l{XE)VFI{YEx>~JD@ea8we9_%tOPZ{Rhe9Rz!NwaF1{sNF zu`#s+6ZaPet~^y~YV<{HLGukoX7KlSmbb&-uO|d4W9eY}R;|AQqCq$mZux%A; zzQNP-Ug~$dTw&$3SCASYYOhxbwik5pT@Nv&#je=fRQ-6TBRGd#M#3)y)5>LRoH?y9 zAA6TtAY;UK-EIvKW|Bwei(->hS=hT}hKIayF2i0QRPXZa-cEgz|43@vn~N z-%e{<3j_d0pXoVzoB{GPOkOH(o>o;(Kl=sl#jR~eH;gU50G_}vl$0S}mIZ_U4t>9S ziE;+{&pOs!;67_(o?CCvyjITP2eBv}iHag1lEL9@Kks{v81VTG95gVT@ z6mYR#Bx-}C98VU8UW-B7N*f3V%XuedA?Ks{;8uDqDibMufvhDWZ^WY z9xiu{YjI{+`47vkWV&?StRjXR#{Q)iKIRo#4Aj)8uRXO;OTmC)G@&i@5>eddY8-fG zjO)Kq3&|Mz-sX5FRZ~wccl6rRS$Ta?+v-^ojyQZh{Bmu4k~(fT*M-*<8bQd_6)QsL z+s7qhlz0!f-(6*s-89Cr*jMTPXv%$km80!sKf1Y~rThwS3$UtZ9 Y0;}G_Dz$-+H6Zk9$M3371^wy&0M0pHX#fBK literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1mcmc_1_1adapt__dense__e__static__hmc-members.html b/doc/api/html/classstan_1_1mcmc_1_1adapt__dense__e__static__hmc-members.html new file mode 100644 index 00000000000..35249ac6367 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1adapt__dense__e__static__hmc-members.html @@ -0,0 +1,168 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::adapt_dense_e_static_hmc< M, BaseRNG > Member List
+
+
+ +

This is the complete list of members for stan::mcmc::adapt_dense_e_static_hmc< M, BaseRNG >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_adapt_flagstan::mcmc::base_adapterprotected
_covar_adaptationstan::mcmc::stepsize_covar_adapterprotected
_epsilonstan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
_epsilon_jitterstan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
_err_streamstan::mcmc::base_mcmcprotected
_hamiltonianstan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
_integratorstan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
_namestan::mcmc::base_mcmcprotected
_nom_epsilonstan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
_out_streamstan::mcmc::base_mcmcprotected
_rand_intstan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
_rand_uniformstan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
_stepsize_adaptationstan::mcmc::stepsize_covar_adapterprotected
_update_L()stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlineprotected
_zstan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
adapt_dense_e_static_hmc(M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)stan::mcmc::adapt_dense_e_static_hmc< M, BaseRNG >inline
adapting()stan::mcmc::base_adapterinline
base_adapter()stan::mcmc::base_adapterinline
base_hmc(M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
base_mcmc(std::ostream *o, std::ostream *e)stan::mcmc::base_mcmcinline
base_static_hmc(M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
dense_e_static_hmc(M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)stan::mcmc::dense_e_static_hmc< M, BaseRNG >inline
disengage_adaptation()stan::mcmc::adapt_dense_e_static_hmc< M, BaseRNG >inlinevirtual
engage_adaptation()stan::mcmc::base_adapterinlinevirtual
get_covar_adaptation()stan::mcmc::stepsize_covar_adapterinline
get_current_stepsize()stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
get_L()stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
get_nominal_stepsize()stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
get_sampler_diagnostic_names(std::vector< std::string > &model_names, std::vector< std::string > &names)stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_diagnostics(std::vector< double > &values)stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_param_names(std::vector< std::string > &names)stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_params(std::vector< double > &values)stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_stepsize_adaptation()stan::mcmc::stepsize_covar_adapterinline
get_stepsize_jitter()stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
get_T()stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
init_stepsize()stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
L_stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
name()stan::mcmc::base_mcmcinline
sample_stepsize()stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
seed(const Eigen::VectorXd &q)stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
set_nominal_stepsize(const double e)stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
set_nominal_stepsize_and_L(const double e, const int l)stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
set_nominal_stepsize_and_T(const double e, const double t)stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
set_stepsize_jitter(const double j)stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
set_T(const double t)stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
set_window_params(unsigned int num_warmup, unsigned int init_buffer, unsigned int term_buffer, unsigned int base_window, std::ostream *e=0)stan::mcmc::stepsize_covar_adapterinline
stepsize_covar_adapter(int n)stan::mcmc::stepsize_covar_adapterinline
T_stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
transition(sample &init_sample)stan::mcmc::adapt_dense_e_static_hmc< M, BaseRNG >inlinevirtual
write_sampler_param_names(std::ostream &o)stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
write_sampler_params(std::ostream &o)stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
write_sampler_state(std::ostream *o)stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
z()stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
~adapt_dense_e_static_hmc()stan::mcmc::adapt_dense_e_static_hmc< M, BaseRNG >inline
~base_mcmc()stan::mcmc::base_mcmcinlinevirtual
~base_static_hmc()stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1adapt__dense__e__static__hmc.html b/doc/api/html/classstan_1_1mcmc_1_1adapt__dense__e__static__hmc.html new file mode 100644 index 00000000000..56fc17ba38d --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1adapt__dense__e__static__hmc.html @@ -0,0 +1,381 @@ + + + + + +Stan: stan::mcmc::adapt_dense_e_static_hmc< M, BaseRNG > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::adapt_dense_e_static_hmc< M, BaseRNG > Class Template Reference
+
+
+ +

#include <adapt_dense_e_static_hmc.hpp>

+
+Inheritance diagram for stan::mcmc::adapt_dense_e_static_hmc< M, BaseRNG >:
+
+
+ + +stan::mcmc::dense_e_static_hmc< M, BaseRNG > +stan::mcmc::stepsize_covar_adapter +stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_adapter +stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_mcmc + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 adapt_dense_e_static_hmc (M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)
 
 ~adapt_dense_e_static_hmc ()
 
sample transition (sample &init_sample)
 
void disengage_adaptation ()
 
- Public Member Functions inherited from stan::mcmc::dense_e_static_hmc< M, BaseRNG >
 dense_e_static_hmc (M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)
 
- Public Member Functions inherited from stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >
 base_static_hmc (M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)
 
 ~base_static_hmc ()
 
sample transition (sample &init_sample)
 
void write_sampler_param_names (std::ostream &o)
 
void write_sampler_params (std::ostream &o)
 
void get_sampler_param_names (std::vector< std::string > &names)
 
void get_sampler_params (std::vector< double > &values)
 
void set_nominal_stepsize_and_T (const double e, const double t)
 
void set_nominal_stepsize_and_L (const double e, const int l)
 
void set_T (const double t)
 
void set_nominal_stepsize (const double e)
 
double get_T ()
 
int get_L ()
 
- Public Member Functions inherited from stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >
 base_hmc (M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)
 
void write_sampler_state (std::ostream *o)
 
void get_sampler_diagnostic_names (std::vector< std::string > &model_names, std::vector< std::string > &names)
 
void get_sampler_diagnostics (std::vector< double > &values)
 
void seed (const Eigen::VectorXd &q)
 
void init_stepsize ()
 
dense_e_pointz ()
 
double get_nominal_stepsize ()
 
double get_current_stepsize ()
 
virtual void set_stepsize_jitter (const double j)
 
double get_stepsize_jitter ()
 
void sample_stepsize ()
 
- Public Member Functions inherited from stan::mcmc::base_mcmc
 base_mcmc (std::ostream *o, std::ostream *e)
 
virtual ~base_mcmc ()
 
std::string name ()
 
- Public Member Functions inherited from stan::mcmc::stepsize_covar_adapter
 stepsize_covar_adapter (int n)
 
stepsize_adaptationget_stepsize_adaptation ()
 
covar_adaptationget_covar_adaptation ()
 
void set_window_params (unsigned int num_warmup, unsigned int init_buffer, unsigned int term_buffer, unsigned int base_window, std::ostream *e=0)
 
- Public Member Functions inherited from stan::mcmc::base_adapter
 base_adapter ()
 
virtual void engage_adaptation ()
 
bool adapting ()
 
+ + + + + + + + + + + + + + +

+Additional Inherited Members

- Protected Member Functions inherited from stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >
void _update_L ()
 
- Protected Attributes inherited from stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >
double T_
 
int L_
 
- Protected Attributes inherited from stan::mcmc::stepsize_covar_adapter
stepsize_adaptation _stepsize_adaptation
 
covar_adaptation _covar_adaptation
 
+

Detailed Description

+

template<typename M, class BaseRNG>
+class stan::mcmc::adapt_dense_e_static_hmc< M, BaseRNG >

+ + +

Definition at line 17 of file adapt_dense_e_static_hmc.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::mcmc::adapt_dense_e_static_hmc< M, BaseRNG >::adapt_dense_e_static_hmc (M & m,
BaseRNG & rng,
std::ostream * o = &std::cout,
std::ostream * e = 0 
)
+
+inline
+
+ +

Definition at line 22 of file adapt_dense_e_static_hmc.hpp.

+ +
+
+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + +
stan::mcmc::adapt_dense_e_static_hmc< M, BaseRNG >::~adapt_dense_e_static_hmc ()
+
+inline
+
+ +

Definition at line 28 of file adapt_dense_e_static_hmc.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + +
void stan::mcmc::adapt_dense_e_static_hmc< M, BaseRNG >::disengage_adaptation ()
+
+inlinevirtual
+
+ +

Reimplemented from stan::mcmc::base_adapter.

+ +

Definition at line 55 of file adapt_dense_e_static_hmc.hpp.

+ +
+
+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + + +
sample stan::mcmc::adapt_dense_e_static_hmc< M, BaseRNG >::transition (sampleinit_sample)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_mcmc.

+ +

Definition at line 30 of file adapt_dense_e_static_hmc.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1adapt__dense__e__static__hmc.png b/doc/api/html/classstan_1_1mcmc_1_1adapt__dense__e__static__hmc.png new file mode 100644 index 0000000000000000000000000000000000000000..4e0f2d6bc46ed98893270c79d5a491f20e51ef19 GIT binary patch literal 5169 zcmeI0dsLF!w!rOSwk@-VxvflhMd&Uc_|AM~mPMku%kupoEi+Av0^d+tdfHSLoUIlq zwoR?nP$^AQNQvBtNoh(xF~vurqM#xoa6WL4eY|6wGsgYno;&Uz_hWn?Yw@wxnrp2& ze{0Tp%hThChWb`@6%`c?=+Q$bR8&^Nfb!hx6~MEenK}o2>3G7t4$I|opg1}X|G4BeANjEGSz*M(3l9q;R;a7zKEOQzK4As$<*IMCf}tm% z=B<$HDS;Yz&@<4Mi0lLPFVdhmFWhZQSYC)X4Fuf-b=?Z~EaQ2nF@A>LozHK93X1=H z#~3)D4HWxNqW!ZU1(Ex&N@gCe4Xb#@TC~3~QL)?Y{)6gg|k}aMb)i zS4&`4Bs`8=;GF-r>r@QKfqnz+(%5A9rCr(fJ|M~1g=`RXH{+;cZdNeG@;^~@xVS5d z&9TnQ%j*vf0-kyOWMGn>o|oP+-P%^FtE;aA#&UM9-$3$hwFG9F!irSZo$qWkG&J0& z=tosG9oPk+*=mgkUppzYdSpWNth!FQSuQp3}EBCgS%T!fa zFhJ=}Kr8-RYPV!LUu^;xfov~Og=%S3YhN2_{sUvRIi8DCE)uuaK9?zN5I**Zae|s( zszXs^G6|FiA}hCzg2@iZe2Xa?kUM9C7;0nbjJ|6le>;jR<-HPG)Y6;MhrcLPGlRx0 zo$eEnc$L=vERuo9IQkMg(n=n6x#GOpgbV}=V)aRk&spnW;;Q_sm})#dwe(y}s*ofs zBJi(P$9+TQFr&V5a@oo1!p0;*>ltf83pOS}TEmuu7>fM~VbdVC?4AOFNq3ht&UA`S z9}+)z^QhJr7Fg&->*=vKm-*SURjVI#q9URvP(+qA)k!}=s&cx@KQ;-H+P0K4c zoBK%Ek-j$;74hYq_(|3EGD^L}h9FF4XtQ86>7p$|Y=PD_P^jz-1a^)t3yQ_82ebVs zGK?v#!++u;GdR}2CCXBk`er|f#nbU{ctvxG+Mv@zmJlLd_{dWeKwx_IJ>o`MC)yC^ zY7rE)?FNHps34G<{aQR-5ciki8fAHS`0BEcQHPq&xU(wxm-nr0#F!JEvvs%5*S95< zjd8N3B}C+^7`{Vfxh`_UvSLUln%d3j{wbB~fh$lLV1f=f>v^JSS5=pOiR4OZdso0C zB5&IM?HCuHZA6N02-7=>C44yDh`7<-JM3=Fn_;B|Ib4g+3rH~CA4KC)UWW(A%DxO6 z50hWF2pvah>2<5|lAl=S3j5O+?StXC1hJ>sfboSqf!TKzH>T4EmscM5GYU0?$|wo} z<{v`hIY)k!B;m%yagw1qHaQ3R03>IJ)n&A~XGmnPDN za!gIMFZtDc0)j(XHBxn2$kH~T5o)Cg`q6#E=1p_j#~Z@TI+FL~+eYzGJd`-Zf*0z- zqSlMq;FaH8vf87dE~ERjsf)@uKlHBxM1JA^jMqN52@#v@-Z2QDlA?MmQ1LT60Y@Nl$9 z+~YJSe9YF2K)yjXs#*AGlt-BnJNE?huit-kuCb0!gFLt++(zRDZtt@!DWsa_Bx;zO9oco~2ob zKCemR*01pyPwHO6w(-mICW!b)IwjecaIjn39k<|91yHo2h$Z@abB1rRnzLC~39*v# zGj?#kW|)O3L!2he3a5z8@$13qY3RvA`bHAbZmBFhu%OKh-g5 z2NqJTY5sIR?|W+Yf4{rV=ZLrTSbpxKRaW}#Rrl`U-oEX#BX`};0v zrp!INmVY1n8Q^lpODOQD3cibR==RNmR>as}#o60LUy)3IJ)rrX5<`FrssJPIIR5PyEGzsnZcJeroK~gD%3YK;+xbaZD_7dA;yvJU`6xYD)W5fO65RZs z-ih@ZJirRTQC1+s>S-ryjh2>u$BFAH<)>F`jh%mXp#CG%&26Q6?ggOevllq$UV7z) zjJ`VHx6^YH=BBFt-fxFzS$@HC)r^;pc_BxZ{t{Zc-tfz(rG5R?LCNOjs&;;RJRu$G z*Hg9|Z#LA4ym_GhZl=1{?N{m-ISq>ev{TewAA(PKxE#aJ|{rPWzK zuyLr9f*5aSy2SGmzCkITi(MFnh}W=$_3JTw_wCOrL1Mt$PX)B#X2uQ1?#(isKfB$Fyg^(scJ@nhmvFs3Na)g^$#;S~{%Ra3w7+;XXMaV~OOWFVPrXOaM7 zh-L#DxC`c{r0EJcCqq<`I@PC-k)-e7z)ZE&l4K4i2{Nk-@@ZN1j%v<+kPv+t23fK?Qe` zvmmyl9A?Tq8REO{l3r}(b9Q*D9R>o^W=f@Pry3LM15-k+v*N3p_nVLnp_DF74LsG; zvua1$Ze${r+2!Zjc=k$lj4pQPBTZX7|7a_yz$J+Q@jWZhzrjc_&~bIaNy;fgHCkAC z5Ai1Bya_Wh6(ZLAMR0}2Wv#hj_U`GEXac>kG8100n&@7BSJtC$1V!KGZvb zuplxaUIB`>7T!1MEec)SZ%o`~)Ru^rbtF!8M#bkkz2QX0SJn!X{;meE*a{DXhz`Ae zX_rx(&D;rlaUVeev_s#?5+*z0+?yUJ8J%BFij=p8c>1$7N&YQjDXA;RZD9ZVg1Ox(Rt==o$k&1k!ZxZ@1&=#k$1XHhkvtezP?UwE*-PnY(&sT22PX4!v+Ly7V6@z1h=D*-6PuL1(n z*{hxZ;ed4VhoZJ`UVq-oxbvk?UWj6fZ~TlrA+7V*QUZ;&4Rs=tfs}{#8m-$3VtZp% z)m{DcfpiD+*P)o+IExlRDy^zIHc859aSs{n3hSGmo?Wqm9XZ0|Q;9FrFpn1#1CX-S zn|$VuW(S;rZvY>k4`mND0iX!6{50{KIr^~Lw(ob*O3EmydppJ~4a@9tBNAt_{}fMF9h zL8fi=joTiPEF$b$z`H6jC|a1q1S*1L(z`LtvH2%hA39S=yxA-6G7lSGfu=Vsj{EaR z-hhKCaTmN|ta@K}8lz_F!YLAKl~59rZImgI6cyj)%c%-u8ZTt8_Pf#LO@}I{?Oxto z+2^8YB_&5#`9IbCeVHiKfvTCtI8*Jk2LCA_lf4QqQ2j-b2+*8MIpbUMwg`?mgEsOD zbjq~~B+a)E)sHg2&K5$NpUt#)o0x8Sd{w$ZriN4NIL&1cz0jZDqfB9$0YNuw=JCOQp*6+y z<*K_%HG$O6nd>R{JJf*0Px*oRqr4UBs2q=?lYicAt3J< + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::adapt_diag_e_nuts< M, BaseRNG > Member List
+
+
+ +

This is the complete list of members for stan::mcmc::adapt_diag_e_nuts< M, BaseRNG >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_adapt_flagstan::mcmc::base_adapterprotected
_depthstan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >
_epsilonstan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
_epsilon_jitterstan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
_err_streamstan::mcmc::base_mcmcprotected
_hamiltonianstan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
_integratorstan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
_max_deltastan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >
_max_depthstan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >
_n_divergentstan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >
_namestan::mcmc::base_mcmcprotected
_nom_epsilonstan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
_out_streamstan::mcmc::base_mcmcprotected
_rand_intstan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
_rand_uniformstan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
_stepsize_adaptationstan::mcmc::stepsize_var_adapterprotected
_var_adaptationstan::mcmc::stepsize_var_adapterprotected
_zstan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
adapt_diag_e_nuts(M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)stan::mcmc::adapt_diag_e_nuts< M, BaseRNG >inline
adapting()stan::mcmc::base_adapterinline
base_adapter()stan::mcmc::base_adapterinline
base_hmc(M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
base_mcmc(std::ostream *o, std::ostream *e)stan::mcmc::base_mcmcinline
base_nuts(M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)stan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
build_tree(int depth, Eigen::VectorXd &rho, ps_point *z_init_parent, ps_point &z_propose, nuts_util &util)stan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
compute_criterion(ps_point &start, diag_e_point &finish, Eigen::VectorXd &rho)stan::mcmc::diag_e_nuts< M, BaseRNG >inlinevirtual
diag_e_nuts(M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)stan::mcmc::diag_e_nuts< M, BaseRNG >inline
disengage_adaptation()stan::mcmc::adapt_diag_e_nuts< M, BaseRNG >inlinevirtual
engage_adaptation()stan::mcmc::base_adapterinlinevirtual
get_current_stepsize()stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
get_max_delta()stan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
get_max_depth()stan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
get_nominal_stepsize()stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
get_sampler_diagnostic_names(std::vector< std::string > &model_names, std::vector< std::string > &names)stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_diagnostics(std::vector< double > &values)stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_param_names(std::vector< std::string > &names)stan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_params(std::vector< double > &values)stan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_stepsize_adaptation()stan::mcmc::stepsize_var_adapterinline
get_stepsize_jitter()stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
get_var_adaptation()stan::mcmc::stepsize_var_adapterinline
init_stepsize()stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
name()stan::mcmc::base_mcmcinline
sample_stepsize()stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
seed(const Eigen::VectorXd &q)stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
set_max_delta(const double d)stan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
set_max_depth(const int d)stan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
set_nominal_stepsize(const double e)stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
set_stepsize_jitter(const double j)stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
set_window_params(unsigned int num_warmup, unsigned int init_buffer, unsigned int term_buffer, unsigned int base_window, std::ostream *e=0)stan::mcmc::stepsize_var_adapterinline
stepsize_var_adapter(int n)stan::mcmc::stepsize_var_adapterinline
transition(sample &init_sample)stan::mcmc::adapt_diag_e_nuts< M, BaseRNG >inlinevirtual
write_sampler_param_names(std::ostream &o)stan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
write_sampler_params(std::ostream &o)stan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
write_sampler_state(std::ostream *o)stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
z()stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
~adapt_diag_e_nuts()stan::mcmc::adapt_diag_e_nuts< M, BaseRNG >inline
~base_mcmc()stan::mcmc::base_mcmcinlinevirtual
~base_nuts()stan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1adapt__diag__e__nuts.html b/doc/api/html/classstan_1_1mcmc_1_1adapt__diag__e__nuts.html new file mode 100644 index 00000000000..706bc20989b --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1adapt__diag__e__nuts.html @@ -0,0 +1,402 @@ + + + + + +Stan: stan::mcmc::adapt_diag_e_nuts< M, BaseRNG > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::adapt_diag_e_nuts< M, BaseRNG > Class Template Reference
+
+
+ +

#include <adapt_diag_e_nuts.hpp>

+
+Inheritance diagram for stan::mcmc::adapt_diag_e_nuts< M, BaseRNG >:
+
+
+ + +stan::mcmc::diag_e_nuts< M, BaseRNG > +stan::mcmc::stepsize_var_adapter +stan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_adapter +stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_mcmc + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 adapt_diag_e_nuts (M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)
 
 ~adapt_diag_e_nuts ()
 
sample transition (sample &init_sample)
 
void disengage_adaptation ()
 
- Public Member Functions inherited from stan::mcmc::diag_e_nuts< M, BaseRNG >
 diag_e_nuts (M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)
 
bool compute_criterion (ps_point &start, diag_e_point &finish, Eigen::VectorXd &rho)
 
- Public Member Functions inherited from stan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >
 base_nuts (M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)
 
 ~base_nuts ()
 
void set_max_depth (const int d)
 
void set_max_delta (const double d)
 
int get_max_depth ()
 
double get_max_delta ()
 
sample transition (sample &init_sample)
 
void write_sampler_param_names (std::ostream &o)
 
void write_sampler_params (std::ostream &o)
 
void get_sampler_param_names (std::vector< std::string > &names)
 
void get_sampler_params (std::vector< double > &values)
 
int build_tree (int depth, Eigen::VectorXd &rho, ps_point *z_init_parent, ps_point &z_propose, nuts_util &util)
 
- Public Member Functions inherited from stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >
 base_hmc (M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)
 
void write_sampler_state (std::ostream *o)
 
void get_sampler_diagnostic_names (std::vector< std::string > &model_names, std::vector< std::string > &names)
 
void get_sampler_diagnostics (std::vector< double > &values)
 
void seed (const Eigen::VectorXd &q)
 
void init_stepsize ()
 
diag_e_pointz ()
 
virtual void set_nominal_stepsize (const double e)
 
double get_nominal_stepsize ()
 
double get_current_stepsize ()
 
virtual void set_stepsize_jitter (const double j)
 
double get_stepsize_jitter ()
 
void sample_stepsize ()
 
- Public Member Functions inherited from stan::mcmc::base_mcmc
 base_mcmc (std::ostream *o, std::ostream *e)
 
virtual ~base_mcmc ()
 
std::string name ()
 
- Public Member Functions inherited from stan::mcmc::stepsize_var_adapter
 stepsize_var_adapter (int n)
 
stepsize_adaptationget_stepsize_adaptation ()
 
var_adaptationget_var_adaptation ()
 
void set_window_params (unsigned int num_warmup, unsigned int init_buffer, unsigned int term_buffer, unsigned int base_window, std::ostream *e=0)
 
- Public Member Functions inherited from stan::mcmc::base_adapter
 base_adapter ()
 
virtual void engage_adaptation ()
 
bool adapting ()
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Public Attributes inherited from stan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >
int _depth
 
int _max_depth
 
double _max_delta
 
int _n_divergent
 
- Protected Attributes inherited from stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >
diag_e_point _z
 
expl_leapfrog< diag_e_metric
+< M, BaseRNG >, diag_e_point
_integrator
 
diag_e_metric< M, BaseRNG > _hamiltonian
 
BaseRNG & _rand_int
 
boost::uniform_01< BaseRNG & > _rand_uniform
 
double _nom_epsilon
 
double _epsilon
 
double _epsilon_jitter
 
- Protected Attributes inherited from stan::mcmc::stepsize_var_adapter
stepsize_adaptation _stepsize_adaptation
 
var_adaptation _var_adaptation
 
+

Detailed Description

+

template<typename M, class BaseRNG>
+class stan::mcmc::adapt_diag_e_nuts< M, BaseRNG >

+ + +

Definition at line 16 of file adapt_diag_e_nuts.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::mcmc::adapt_diag_e_nuts< M, BaseRNG >::adapt_diag_e_nuts (M & m,
BaseRNG & rng,
std::ostream * o = &std::cout,
std::ostream * e = 0 
)
+
+inline
+
+ +

Definition at line 21 of file adapt_diag_e_nuts.hpp.

+ +
+
+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + +
stan::mcmc::adapt_diag_e_nuts< M, BaseRNG >::~adapt_diag_e_nuts ()
+
+inline
+
+ +

Definition at line 27 of file adapt_diag_e_nuts.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + +
void stan::mcmc::adapt_diag_e_nuts< M, BaseRNG >::disengage_adaptation ()
+
+inlinevirtual
+
+ +

Reimplemented from stan::mcmc::base_adapter.

+ +

Definition at line 52 of file adapt_diag_e_nuts.hpp.

+ +
+
+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + + +
sample stan::mcmc::adapt_diag_e_nuts< M, BaseRNG >::transition (sampleinit_sample)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_mcmc.

+ +

Definition at line 29 of file adapt_diag_e_nuts.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1adapt__diag__e__nuts.png b/doc/api/html/classstan_1_1mcmc_1_1adapt__diag__e__nuts.png new file mode 100644 index 0000000000000000000000000000000000000000..b6f208e1b80d68d6f1b5e36384bc0844295127d3 GIT binary patch literal 4595 zcmdT|d05iv_E%dhE1j7vn=)-ia;-E+#WkGFytv_(W~OF~=ANLEB2eR`S(b&{m~38|;5rw+j3=2+$&ck8K{VK8`Y(4D3$Li4wA&+yHwY zKdr5;Yckl{;BZ~Mm%FzDI7#06U;3CTD181M{Lr^P=N0EiW)rKdH#&|PU){gFl9e(9 zS&f1x+l^eSi3z1D2CTgkE;V=S^KtDnOHfreQS~OM!+XtlLpL5~6hoxm$o3OCYmR;*R5)7uSIUl_M7W7mXn2$%v& zBWXNMsU%M?2g4n7pdjEFv$E^Y%_eYrep~&UL>|=K7}v6rEY2@Ve7-ax6$%;V_Naz@ zv3n6DN!K}MTV_~}4g3mZ$@0_b?^p$i1;YqJyd!u7!z& zr+oJRzapM#=H?Ba?I$abR!dj77X;4w_wL0AG>hQKC{c28L3m@nhb64DWt&c>D~;lx zK&;-ZY~BOaO1Gv-Aq+(!ty3!G+myM0HlgbRk6hJ`yAtYzrxamU@30ikhVz~l@Wn1* zA7{3Fscj1MoKtz?8ryEn3R`76JqVFUI(P1q^Hm?#MBsM;vx5m8Ur;w;9(2sZ>of+8 zu%;)(5A%cbtEiLo(dO=m$UdtRjBFV zYuw$L^<6Y0^yZ53w6>$;L52wd1rt}54#XDiJ480qEAXVa-bNZy>CnoeMn=YXiOO%!HX_zdc@EP z2Gr2#YibN>=>?Qc;59n}Ml|Du5uKvM0)RHDU;sxJjd~#4FLxn1(+FZdh#VuC zS_01rshuaInIHHXc&-!^yy7|8Lg(#!s>eOB{9qQNjP#pK^Q63_8IGkRiG;?0MfgNf=c&fAFEsfM;R)AcKal8s-Gt zNDXWRFX0Cp;I3)+C6O;tSu1F5RJDI`aK!W%x2-5fz%tLBmpFV@_xMS22rKg82EOaE zb1Sox^j$FPm|GDy=yYUIjr7p`<;7Eh+M)a7%_GG)=GNZp&JEUb`1Qf zw`H$ZNK$%xCI30b2yX$0rML-7aAry)sCrSI~4gPn?BjqcZlFWRd70Lik_ z>LUr?+M`bfKU?u9gT8kS#-?PC|DfE9WoEpJwSx<8)S-E@u@G>r>lL4Pdh{VArP37Pg_P;mg6lCchqDyHgS!1zbej*p~pz-H;3Bqa_b z6iJNK$X!dN7XYFOT=lVRb?3F`rS7pXII=Z`kCaKo-BXi!Vn782{Se@y$AG=%Gq8L6 zR%v99&q|KABHUAgd4N(-jvK)aV9(-+SIRL8zRUy~jLR=sT0|A#vc&?=i7Rwm?{FOM)$bvW)XdL3d%C15-g`t` zup?Zn`gN`F(S_msk*-nq=0=|G)8wbkMsr%_TP&^2pPK@;Y`3DYTrpY&6|k3@8xxKo z=#}PTl1An`V_mxpI_r(*bz7yek2A=FR{GeRGYn_By&D)%8^pa@q9gVIvfv;1cPijuOxysa6nVUS49gh{tv@fFvcaq&i z7q2R-0i)ZqxGNs5N#4PK#UXpC6Vw_Yts+nCr-IsyDJ%)y;6?}wxhZzXFH4}uLwPUp z#^}CjkV-<9=#3o?6xh~tVnLQQAWcAjb-)04ogT=sxgnmm0bqt*f$Qft=)hOZpcFqM zcMNK~d;WE%wN_(&=;#KPHqSRT+UVG$=IFV=pOg`Cy8u0<(Ir!~nXOUcO5@%}?4TJ) zFT>>xxfq!*neH+j zylHOsX(s;#mS;!RErw)0hOKxl&)yRb+H^n|B~FUjqKsz%noD}F(x;EgEoh6*Fltc{wT*hlfZ z0n8a8iOODUx4jrbM}T$=z6%=Gc%l3$boeFZNtesBqFHX|rSe8nI3;0_ zEE_G7++%mDFueo0CC^q;EAdJceEDbB4|e${(}wPxgGUvzbdzRJMmShRR)<0u#4)uO zSa|Q;ggK1-R=hGPxv^VBfNCmM7BB zn1<1I)yBNp(2T|nl;WEZd^-IrKu}L6;<5{h8Z@a)z&$ga5mg>N^wgI(Tg$2Lfk+10 z3Y*D_GVBWRAdjg3{d_IedEn%@XF_$XrtS0E7*%jXoHyWxDkW8_oILTaj+dQf&BU;% zruQ{QQ8qxrrCIN~d}{RiDr@PEWEqx%zx`RvSELO8jK{UySjz?MI$z-?pyD<5Rg)8hLIx}WpuvbrLWq(y%Y9R{|J>pD|PFO_>Z755!CkP$PTcg3Cc{kQ}P7i$x0$yqv*=ry^za z7szx0!3N$UcOyrF?9=+-tS>Ku`m`VaS@g>hUihu@lefw%W4BYl z7=8sDwOkxKe^Kdh=^sE>Xm0koAF}HYsBdhI{L!f2L=|L-i!aSKI^NanxGmTyr;*R^ zxwd=!i9~)?|Hd-^t~v;8SMtFYcR@*ID$6iV|MrFJ`jpZOO4dJug`UdPWx@^>{o6Xu zG5@KeX(Hab_)6b&{EVjl2~ET49$0SJwoGU1_XzHnYs(0#Qtza+wtIIRWIiP!Ccmli zH{TPFp)|s374d^4d6_|u zj2f8nk_6wx*r5^<=VoztbMuvv!O2VIE=1;m88&N6EuWOsoaAyeI#OoOm%qZw9yMz) zW?)bJ;y}sr9g5LV{x*ixVhntdESh7|R#B=@4vMlJ;Qn*#)VK#;YgKs)xuH{u8b^Zz zI_gr{8z?U<)go-(?WCZMNfH{f<&szfW2kPTLLaf8*bbwuSd-24hToyB8=rT81GM|WPcnsapBHdHN21_RWPL=sa66Vl1Dl3Ze9952dV literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1mcmc_1_1adapt__diag__e__static__hmc-members.html b/doc/api/html/classstan_1_1mcmc_1_1adapt__diag__e__static__hmc-members.html new file mode 100644 index 00000000000..73dd60d816a --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1adapt__diag__e__static__hmc-members.html @@ -0,0 +1,168 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::adapt_diag_e_static_hmc< M, BaseRNG > Member List
+
+
+ +

This is the complete list of members for stan::mcmc::adapt_diag_e_static_hmc< M, BaseRNG >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_adapt_flagstan::mcmc::base_adapterprotected
_epsilonstan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
_epsilon_jitterstan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
_err_streamstan::mcmc::base_mcmcprotected
_hamiltonianstan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
_integratorstan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
_namestan::mcmc::base_mcmcprotected
_nom_epsilonstan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
_out_streamstan::mcmc::base_mcmcprotected
_rand_intstan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
_rand_uniformstan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
_stepsize_adaptationstan::mcmc::stepsize_var_adapterprotected
_update_L()stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlineprotected
_var_adaptationstan::mcmc::stepsize_var_adapterprotected
_zstan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
adapt_diag_e_static_hmc(M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)stan::mcmc::adapt_diag_e_static_hmc< M, BaseRNG >inline
adapting()stan::mcmc::base_adapterinline
base_adapter()stan::mcmc::base_adapterinline
base_hmc(M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
base_mcmc(std::ostream *o, std::ostream *e)stan::mcmc::base_mcmcinline
base_static_hmc(M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
diag_e_static_hmc(M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)stan::mcmc::diag_e_static_hmc< M, BaseRNG >inline
disengage_adaptation()stan::mcmc::adapt_diag_e_static_hmc< M, BaseRNG >inlinevirtual
engage_adaptation()stan::mcmc::base_adapterinlinevirtual
get_current_stepsize()stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
get_L()stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
get_nominal_stepsize()stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
get_sampler_diagnostic_names(std::vector< std::string > &model_names, std::vector< std::string > &names)stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_diagnostics(std::vector< double > &values)stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_param_names(std::vector< std::string > &names)stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_params(std::vector< double > &values)stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_stepsize_adaptation()stan::mcmc::stepsize_var_adapterinline
get_stepsize_jitter()stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
get_T()stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
get_var_adaptation()stan::mcmc::stepsize_var_adapterinline
init_stepsize()stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
L_stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
name()stan::mcmc::base_mcmcinline
sample_stepsize()stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
seed(const Eigen::VectorXd &q)stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
set_nominal_stepsize(const double e)stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
set_nominal_stepsize_and_L(const double e, const int l)stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
set_nominal_stepsize_and_T(const double e, const double t)stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
set_stepsize_jitter(const double j)stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
set_T(const double t)stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
set_window_params(unsigned int num_warmup, unsigned int init_buffer, unsigned int term_buffer, unsigned int base_window, std::ostream *e=0)stan::mcmc::stepsize_var_adapterinline
stepsize_var_adapter(int n)stan::mcmc::stepsize_var_adapterinline
T_stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
transition(sample &init_sample)stan::mcmc::adapt_diag_e_static_hmc< M, BaseRNG >inlinevirtual
write_sampler_param_names(std::ostream &o)stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
write_sampler_params(std::ostream &o)stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
write_sampler_state(std::ostream *o)stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
z()stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
~adapt_diag_e_static_hmc()stan::mcmc::adapt_diag_e_static_hmc< M, BaseRNG >inline
~base_mcmc()stan::mcmc::base_mcmcinlinevirtual
~base_static_hmc()stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1adapt__diag__e__static__hmc.html b/doc/api/html/classstan_1_1mcmc_1_1adapt__diag__e__static__hmc.html new file mode 100644 index 00000000000..1f9586efd8e --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1adapt__diag__e__static__hmc.html @@ -0,0 +1,381 @@ + + + + + +Stan: stan::mcmc::adapt_diag_e_static_hmc< M, BaseRNG > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::adapt_diag_e_static_hmc< M, BaseRNG > Class Template Reference
+
+
+ +

#include <adapt_diag_e_static_hmc.hpp>

+
+Inheritance diagram for stan::mcmc::adapt_diag_e_static_hmc< M, BaseRNG >:
+
+
+ + +stan::mcmc::diag_e_static_hmc< M, BaseRNG > +stan::mcmc::stepsize_var_adapter +stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_adapter +stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_mcmc + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 adapt_diag_e_static_hmc (M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)
 
 ~adapt_diag_e_static_hmc ()
 
sample transition (sample &init_sample)
 
void disengage_adaptation ()
 
- Public Member Functions inherited from stan::mcmc::diag_e_static_hmc< M, BaseRNG >
 diag_e_static_hmc (M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)
 
- Public Member Functions inherited from stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >
 base_static_hmc (M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)
 
 ~base_static_hmc ()
 
sample transition (sample &init_sample)
 
void write_sampler_param_names (std::ostream &o)
 
void write_sampler_params (std::ostream &o)
 
void get_sampler_param_names (std::vector< std::string > &names)
 
void get_sampler_params (std::vector< double > &values)
 
void set_nominal_stepsize_and_T (const double e, const double t)
 
void set_nominal_stepsize_and_L (const double e, const int l)
 
void set_T (const double t)
 
void set_nominal_stepsize (const double e)
 
double get_T ()
 
int get_L ()
 
- Public Member Functions inherited from stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >
 base_hmc (M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)
 
void write_sampler_state (std::ostream *o)
 
void get_sampler_diagnostic_names (std::vector< std::string > &model_names, std::vector< std::string > &names)
 
void get_sampler_diagnostics (std::vector< double > &values)
 
void seed (const Eigen::VectorXd &q)
 
void init_stepsize ()
 
diag_e_pointz ()
 
double get_nominal_stepsize ()
 
double get_current_stepsize ()
 
virtual void set_stepsize_jitter (const double j)
 
double get_stepsize_jitter ()
 
void sample_stepsize ()
 
- Public Member Functions inherited from stan::mcmc::base_mcmc
 base_mcmc (std::ostream *o, std::ostream *e)
 
virtual ~base_mcmc ()
 
std::string name ()
 
- Public Member Functions inherited from stan::mcmc::stepsize_var_adapter
 stepsize_var_adapter (int n)
 
stepsize_adaptationget_stepsize_adaptation ()
 
var_adaptationget_var_adaptation ()
 
void set_window_params (unsigned int num_warmup, unsigned int init_buffer, unsigned int term_buffer, unsigned int base_window, std::ostream *e=0)
 
- Public Member Functions inherited from stan::mcmc::base_adapter
 base_adapter ()
 
virtual void engage_adaptation ()
 
bool adapting ()
 
+ + + + + + + + + + + + + + +

+Additional Inherited Members

- Protected Member Functions inherited from stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >
void _update_L ()
 
- Protected Attributes inherited from stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >
double T_
 
int L_
 
- Protected Attributes inherited from stan::mcmc::stepsize_var_adapter
stepsize_adaptation _stepsize_adaptation
 
var_adaptation _var_adaptation
 
+

Detailed Description

+

template<typename M, class BaseRNG>
+class stan::mcmc::adapt_diag_e_static_hmc< M, BaseRNG >

+ + +

Definition at line 17 of file adapt_diag_e_static_hmc.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::mcmc::adapt_diag_e_static_hmc< M, BaseRNG >::adapt_diag_e_static_hmc (M & m,
BaseRNG & rng,
std::ostream * o = &std::cout,
std::ostream * e = 0 
)
+
+inline
+
+ +

Definition at line 22 of file adapt_diag_e_static_hmc.hpp.

+ +
+
+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + +
stan::mcmc::adapt_diag_e_static_hmc< M, BaseRNG >::~adapt_diag_e_static_hmc ()
+
+inline
+
+ +

Definition at line 28 of file adapt_diag_e_static_hmc.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + +
void stan::mcmc::adapt_diag_e_static_hmc< M, BaseRNG >::disengage_adaptation ()
+
+inlinevirtual
+
+ +

Reimplemented from stan::mcmc::base_adapter.

+ +

Definition at line 55 of file adapt_diag_e_static_hmc.hpp.

+ +
+
+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + + +
sample stan::mcmc::adapt_diag_e_static_hmc< M, BaseRNG >::transition (sampleinit_sample)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_mcmc.

+ +

Definition at line 30 of file adapt_diag_e_static_hmc.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1adapt__diag__e__static__hmc.png b/doc/api/html/classstan_1_1mcmc_1_1adapt__diag__e__static__hmc.png new file mode 100644 index 0000000000000000000000000000000000000000..98383b21402718819022a61513eb4e8a4f542bbd GIT binary patch literal 4868 zcmd5=YgiN4)&>=+DAGp68%o6qP(i{?L4?GL3IhlTs3>w#yi^e*a=#=|snS>>G9Vy= zp{0tHDk4IZTRbY0*~#E%xsRv+4z*ehPTvnpV`xvV zg0tD9p`k&G$}<9gzliqr^3woD=;zPp{x%vKm`r&4xBl^(Bk#C-d9?=Hd&@XseKST0 zb4iFroXg@H^Hjz+zhvCPGJ?WCbW}wIzNv~ZU!`v*Y|DnQuu9^O@d^DIaYKCJt>-Vg z8^i8cO)Z1WIfgWXXMU zbVxDqFXif||C!9H2<~%`cQ7#s!pH}Fqv6caS|b*^ZqU@y(ZAvf;?U9eWdFGC*^!0Oe^ic;;Ym-mcw$Ga8-a#juvjjwBhA!W^Ia)fNz&rE_?*EBFOSn}L zN4ZsZPx%yjg7^_go$xt#Fq+V9*bL|v@N(fbkXPWKg+B)N1qS!W(;+W-qO_KvnA>0G zGU*c1O6eaMjZ*nEvg2|gZKwK_>5HOUUS$OMY=iWzVv0LvT9mm6&6kOa1RoTT|7eFN zhLq(O2%E(uxOU$-Zwh{Jwl0<&Y#)^TevLU;KXCx2%sPpiaxbv`k7AsuEaF3ta??rW zDaY$O4ZSJG)SL>=m86mK;l`DWEp^FOWgj!O*fq{-M@ltM-7h%Wai86NAin*C%?Dzs!FvGz#>abtB2M)E^xQ1*=#JFezm65?e)K?d6UFg`tN+n`8qC0^}k zr`MXpuMTqT^2lsIGhCtEis1;t|BM-b>%|N>^UcRlZherWp>0{krYZ9Iq++J>_l@)0 z^2=V>Z^pN=^FVPluw39pjbu(2(M^!Y9a48^vdG-p2(BxM$>%j~#6wiQrM0KW+Pl`l zo*^@C7>1_HtvGCCO+CKr&|5k07#nKQMB63af~q~;-{v8}N1Z4NgFQEsEvZeL5+63Z zLgMlZ(>S#cMsH1@T-@tScEh;p#n#7uO-;RwI*^`<gyRzjLmd*#sEQB9)ZK)p@1wvP);2#Hf0e=XJtI5n zy8B>9o=Gq^lK8f_G>!J1p*8+D&I{faQeLH+oN~E&H$0I)J9GASL>cCkHdXXvo5_rC zBb1QZR5I3?WOKN~15wUau{aJAS1n7gi9%{QLb1pouQa%gKUfRxPuOb(-;8n^m>g`{ zrgt)Ao>(1=_UAEGI)wDmCVokv++~o155W^zvW57SV#=fI&>O#5C^H5C3s0>2mjLAu z+E?7FYiMKV%2A{+o9+9auL$JVXwNss&$fPJbgjeB*(elTDw;)v;XB6vT`2LtgP2u$ z1a~hAlpO(Rs1e-ercc|`m4BiMx+9^Wy#Ldl1p6XKJ|Qgx!^o$ND+6q32C;|(wxw+1 zWs58lrw%kB6+Vx7Mt;BhF<93@GQy*USjgpzGyBf5rMwOhcWi5g8!*%;DpN??{A2g3}58?wxrN?#B-|CO5EW#+vPs{t14DrfLQPJ92l9R*Q}=95s4&dXg+iiHXAwe6_E}!ru1s z*PC_Oq)~tsG4(VEZ{8~DI(jScOQeru<1SEXOwz)p_}U_mZl2{`Z)t%s$K&z!LyRTA zApxh)kmy4_l?CMT9^dzkRn9w(ulS5chrCxAIueval?oHKC}C!dfw0ts*0I|Ay)oF9 z&VCc>+J{7iBCR;_MW0mNR2Y+?=YE(O!Dmrk%Z8S9y<>a33tY6y0-xJWx?$Rdn-Nw- z!y`hSDU~ag_RkVJZ?oem^d$Bavo=uwFLN%T~JyCck55K=^g7L*@szRqn*X^~>#H zPrVO=e$H5-^_9f0&lTy)26OXmR(Iyu;iV~-`#VE^#XoMJ3oExbYI~1;yM%IG0oOP9@p0oW3B7k4?RhkL4hnjinCC4?Lv*V&9S}*9d_dN)TH*s zArZ+}gg=PS2OGVsd*75wfCa&QU)OZIV(3dn*2^UeYb<8!pbRMFYB90r<5Nl8k-*Y-MvKTq+$tjq<=ra z!B%lDw^(nX^Bq$6IMU~h@}L?g(h%sv(oR(f0))PW>|%Xgifgr*DH!?Y=eJ zuH6VqBoXo7wCXI&obBoO4Ay66ngV^MOXmgJ`etcb`kt=s8d}1a0b4hx_PPo+v}8r) z=U&+XuG&23`NltnShO)D#KP2tuP7KNdXdGpPd)0*eFgRurH7n<#w zs~_;4MIkT?{pqja|7|w~%8LIl5LB&z^O3%|_;1E-H;#tUOvr_=VxBpC{5X{fX&)>r zC}Yl$Z5&}dz090S7&kP^k{3K@BBhXmE#C_kkY)oL!zQ40JQ&_cJnmH4wrbtPO{hIs zR+S+r0OeP~+<^%1y3>^|!n%AO<6Vj*iOLb>(Ata^)ySKq!4%ykL=Jxc2nptm9eyPF z5v5Gpb0t`;__!d-UogcF#yh(`Q{H9=9lzWYa5f+;F9T9rsn0>JWg~BeIrgzz_%}zR zBk@M_NAYWlY^wSm@Z)W69}9}edQ$m@21WWSR>Kw;ccg8=++CpeR1`@)bZzqvVQTo> z(U@#xdIdazlK|?YlFM*mvU>m)10Jdhn;YM3k*3=`B=)<&2PgA;EidIBlx10O2y0~0 z^Kk2_gsx%PD*OT*myO)zJxQQ5n6b_!dZ?`8dw)u&ApW zVeL+nl7`u2AB^8BLMDr(7;H@q*GA++m*qbr@)@}&_I4WiH^z;#*{okOV%U!Is2_ci zWL=de?1>v448#L?q8+&O0_lnY#4&q?_CDfKJwbU6Yoc1P!&LFBC`FdA#)=#7L@97iP9}dNOuBL443mGfCGz*T z{T@q=Psc^opprli{P=7 zjGchxQwqG37lypQXxidZ{|jJ2Z4;FEf)K~G-Ts))nVzc35QZYb)(xT3uE5CkF~JY+ zf*F~@VXb$CAAlD^b6Z>@qUEr8(w!GMyc2R`6>3DBib%O_QV zs*O*&0>vDQTDQZW`O>$T&!S|jc&-i#6Ss>_oVy?fIFR2oUKDxm!ZbjY6Dxr_3DfLf zd8t{`Jq&QS&&ct7gPu>Joq>icT05Hf&GPytN;M zp*uh87#hZMpFAxPM(9@b=9BI(n&}6kN^B|PXD4mV-?7*1Qf|F9bT#t*pj7*x6zPba zlKx2{XU|K{f-zPoJ*p-ltjx!q;i3ihLCU(lcTxFasx7Qs%a7#@nK(Xt4cL&2vjdaZ zkmF8Fx#TFkFX^BDVMzY?S#MCCYNZMP^k|E79gaF3w8);6!P@gBr3Ri=ZjT!s;+|9{ z;oc=|;jfIWcA$IP5;H}PP1{_BsYGWzJ}s!(uv=($F}%VE7BudQH=*v>Hcml><`TLk zbvkc)XMW!Mp5(E-%GSf@war)O*D*fSbBM>5bAa@a99GmWVU1JSW&)Rb$t`OdYaf3azVL30<(|OV#W7-_HGG-=zdG*+k zqGB3kB55JvK`T#cA7XKF8Eg@vQpq+=ZzYT`Kox?Z!oD=zC_k877eV)$WOJXoigK=( z?HE0dQ{SFn6CBL$w)DPRTT_}en2L1m>GBZp2Xi82HOrZ8g;kOIN-b20i=8is%ZXxY zx6}jQf$E-QTexB|tG}5#_cvv;?Q=~P kw-5TGMdy!cYEx_EPMw_yaXP^SudFoS9bVh-Z415d4?|M^=>Px# literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1mcmc_1_1adapt__unit__e__nuts-members.html b/doc/api/html/classstan_1_1mcmc_1_1adapt__unit__e__nuts-members.html new file mode 100644 index 00000000000..27d83d4eb80 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1adapt__unit__e__nuts-members.html @@ -0,0 +1,167 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::adapt_unit_e_nuts< M, BaseRNG > Member List
+
+
+ +

This is the complete list of members for stan::mcmc::adapt_unit_e_nuts< M, BaseRNG >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_adapt_flagstan::mcmc::base_adapterprotected
_depthstan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >
_epsilonstan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
_epsilon_jitterstan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
_err_streamstan::mcmc::base_mcmcprotected
_hamiltonianstan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
_integratorstan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
_max_deltastan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >
_max_depthstan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >
_n_divergentstan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >
_namestan::mcmc::base_mcmcprotected
_nom_epsilonstan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
_out_streamstan::mcmc::base_mcmcprotected
_rand_intstan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
_rand_uniformstan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
_stepsize_adaptationstan::mcmc::stepsize_adapterprotected
_zstan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
adapt_unit_e_nuts(M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)stan::mcmc::adapt_unit_e_nuts< M, BaseRNG >inline
adapting()stan::mcmc::base_adapterinline
base_adapter()stan::mcmc::base_adapterinline
base_hmc(M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
base_mcmc(std::ostream *o, std::ostream *e)stan::mcmc::base_mcmcinline
base_nuts(M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)stan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
build_tree(int depth, Eigen::VectorXd &rho, ps_point *z_init_parent, ps_point &z_propose, nuts_util &util)stan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
compute_criterion(ps_point &start, unit_e_point &finish, Eigen::VectorXd &rho)stan::mcmc::unit_e_nuts< M, BaseRNG >inlinevirtual
disengage_adaptation()stan::mcmc::adapt_unit_e_nuts< M, BaseRNG >inlinevirtual
engage_adaptation()stan::mcmc::base_adapterinlinevirtual
get_current_stepsize()stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
get_max_delta()stan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
get_max_depth()stan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
get_nominal_stepsize()stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
get_sampler_diagnostic_names(std::vector< std::string > &model_names, std::vector< std::string > &names)stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_diagnostics(std::vector< double > &values)stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_param_names(std::vector< std::string > &names)stan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_params(std::vector< double > &values)stan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_stepsize_adaptation()stan::mcmc::stepsize_adapterinline
get_stepsize_jitter()stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
init_stepsize()stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
name()stan::mcmc::base_mcmcinline
sample_stepsize()stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
seed(const Eigen::VectorXd &q)stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
set_max_delta(const double d)stan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
set_max_depth(const int d)stan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
set_nominal_stepsize(const double e)stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
set_stepsize_jitter(const double j)stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
stepsize_adapter()stan::mcmc::stepsize_adapterinline
transition(sample &init_sample)stan::mcmc::adapt_unit_e_nuts< M, BaseRNG >inlinevirtual
unit_e_nuts(M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)stan::mcmc::unit_e_nuts< M, BaseRNG >inline
write_sampler_param_names(std::ostream &o)stan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
write_sampler_params(std::ostream &o)stan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
write_sampler_state(std::ostream *o)stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
z()stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
~adapt_unit_e_nuts()stan::mcmc::adapt_unit_e_nuts< M, BaseRNG >inline
~base_mcmc()stan::mcmc::base_mcmcinlinevirtual
~base_nuts()stan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1adapt__unit__e__nuts.html b/doc/api/html/classstan_1_1mcmc_1_1adapt__unit__e__nuts.html new file mode 100644 index 00000000000..5bfb1d6954e --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1adapt__unit__e__nuts.html @@ -0,0 +1,396 @@ + + + + + +Stan: stan::mcmc::adapt_unit_e_nuts< M, BaseRNG > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::adapt_unit_e_nuts< M, BaseRNG > Class Template Reference
+
+
+ +

#include <adapt_unit_e_nuts.hpp>

+
+Inheritance diagram for stan::mcmc::adapt_unit_e_nuts< M, BaseRNG >:
+
+
+ + +stan::mcmc::unit_e_nuts< M, BaseRNG > +stan::mcmc::stepsize_adapter +stan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_adapter +stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_mcmc + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 adapt_unit_e_nuts (M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)
 
 ~adapt_unit_e_nuts ()
 
sample transition (sample &init_sample)
 
void disengage_adaptation ()
 
- Public Member Functions inherited from stan::mcmc::unit_e_nuts< M, BaseRNG >
 unit_e_nuts (M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)
 
bool compute_criterion (ps_point &start, unit_e_point &finish, Eigen::VectorXd &rho)
 
- Public Member Functions inherited from stan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >
 base_nuts (M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)
 
 ~base_nuts ()
 
void set_max_depth (const int d)
 
void set_max_delta (const double d)
 
int get_max_depth ()
 
double get_max_delta ()
 
sample transition (sample &init_sample)
 
void write_sampler_param_names (std::ostream &o)
 
void write_sampler_params (std::ostream &o)
 
void get_sampler_param_names (std::vector< std::string > &names)
 
void get_sampler_params (std::vector< double > &values)
 
int build_tree (int depth, Eigen::VectorXd &rho, ps_point *z_init_parent, ps_point &z_propose, nuts_util &util)
 
- Public Member Functions inherited from stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >
 base_hmc (M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)
 
void write_sampler_state (std::ostream *o)
 
void get_sampler_diagnostic_names (std::vector< std::string > &model_names, std::vector< std::string > &names)
 
void get_sampler_diagnostics (std::vector< double > &values)
 
void seed (const Eigen::VectorXd &q)
 
void init_stepsize ()
 
unit_e_pointz ()
 
virtual void set_nominal_stepsize (const double e)
 
double get_nominal_stepsize ()
 
double get_current_stepsize ()
 
virtual void set_stepsize_jitter (const double j)
 
double get_stepsize_jitter ()
 
void sample_stepsize ()
 
- Public Member Functions inherited from stan::mcmc::base_mcmc
 base_mcmc (std::ostream *o, std::ostream *e)
 
virtual ~base_mcmc ()
 
std::string name ()
 
- Public Member Functions inherited from stan::mcmc::stepsize_adapter
 stepsize_adapter ()
 
stepsize_adaptationget_stepsize_adaptation ()
 
- Public Member Functions inherited from stan::mcmc::base_adapter
 base_adapter ()
 
virtual void engage_adaptation ()
 
bool adapting ()
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Public Attributes inherited from stan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >
int _depth
 
int _max_depth
 
double _max_delta
 
int _n_divergent
 
- Protected Attributes inherited from stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >
unit_e_point _z
 
expl_leapfrog< unit_e_metric
+< M, BaseRNG >, unit_e_point
_integrator
 
unit_e_metric< M, BaseRNG > _hamiltonian
 
BaseRNG & _rand_int
 
boost::uniform_01< BaseRNG & > _rand_uniform
 
double _nom_epsilon
 
double _epsilon
 
double _epsilon_jitter
 
- Protected Attributes inherited from stan::mcmc::stepsize_adapter
stepsize_adaptation _stepsize_adaptation
 
+

Detailed Description

+

template<typename M, class BaseRNG>
+class stan::mcmc::adapt_unit_e_nuts< M, BaseRNG >

+ + +

Definition at line 16 of file adapt_unit_e_nuts.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::mcmc::adapt_unit_e_nuts< M, BaseRNG >::adapt_unit_e_nuts (M & m,
BaseRNG & rng,
std::ostream * o = &std::cout,
std::ostream * e = 0 
)
+
+inline
+
+ +

Definition at line 21 of file adapt_unit_e_nuts.hpp.

+ +
+
+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + +
stan::mcmc::adapt_unit_e_nuts< M, BaseRNG >::~adapt_unit_e_nuts ()
+
+inline
+
+ +

Definition at line 25 of file adapt_unit_e_nuts.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + +
void stan::mcmc::adapt_unit_e_nuts< M, BaseRNG >::disengage_adaptation ()
+
+inlinevirtual
+
+ +

Reimplemented from stan::mcmc::base_adapter.

+ +

Definition at line 38 of file adapt_unit_e_nuts.hpp.

+ +
+
+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + + +
sample stan::mcmc::adapt_unit_e_nuts< M, BaseRNG >::transition (sampleinit_sample)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_mcmc.

+ +

Definition at line 27 of file adapt_unit_e_nuts.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1adapt__unit__e__nuts.png b/doc/api/html/classstan_1_1mcmc_1_1adapt__unit__e__nuts.png new file mode 100644 index 0000000000000000000000000000000000000000..243b8b38ad915fbd778cbc75fac2dd7f78cc9def GIT binary patch literal 4491 zcmdUz2~bnXy2o+Bg+-i!QBgFb6F?S0!!836m(hR%vW{#KWf72|LVyrRR0bTECwd@4 z*a9;mA{Z2e009EbAOuc`imU+aK? z)BXMa{e9=Qv*SrsrJYI&3JR*2Q^#Et6xM-od12E!_;<@JEe^iya6avJLN1rX#j(j* zd`i;;xU~9hXlPKpJ%E7CO;Ik6t_pCcl}}fj8%japi=CL`c5bn2rUqv`iVtu7ZU&3) z7A+wpq2Bg+ueu{^_h7#3bI&|@Bq$ofcAB1PHa+87cx26zi8kgT($@v`%hzcj=AE&& ziONxSHgf6jR%p3Eu7FIBjK2zK-2pT=RP3EpB#Q=5_1k$AP5P<1Zl1;hBwv2m`8m!7b!^SXkxM9s-x39E zr^GyZ1Ufh5!*dvv=C;M#_y0_-Ko=gGt+2$1q^tk2n~HX;U07J2naRqYzAyeTEEcoP zjzpIANMnZoI=@aNpn(zXTwR5M=q0fe5Os{LlIV=m#jw)AgPXJ?f!`hesfvSVI^9lp zn&Oo-oR2uw+O1L4xN_P)Xn)@IVbPq2`LQ*MT8{utrTrhOYMDN(CS}!plh)>ZWX;AW z0m*BXEDvg%XgD|A(4*#GU%TZrTLm8D{OTC%T;YdT)XG@Br6CRczrCgAV&;>gj3*(V zH1_9_pCI*s#}4*EJAMGHFpCB7Ht(mVKF0pt3JO?=l(^cm7Lq=T(^_2lC;f|K;ReizOe3yVg(R3_yfC z9Ugo&MD>Mz7etZMnh6m!hU|6Wd}^SSZ^hz-vb=Ljf+n%c-$P-~jXW6^gSW}Vwu$Xo zR;3%mXd=;7$=q~xX<|=tW-fs_yx8b5F+lH~tLWKYIuuU&4+#y~mk&QpRa<<~tuS{V zhHTU_ogaE7p}rbfXn4}QTl$+9LGWoHmGBkb?A2}7w~f)uJvYO#*CG?8su$*Sv$jrX zij7|Q5cvu7@5DZkjw9?gFIsEe#wz_7Nvv<0`jdEX98>HaIWM2r1)~_ALMg*y<_1{0 zo~bO#Qyof<7L<63{aU9~Go$&FS0@y6TDsNx=)$MCq zw*D57z#00Kp_Tgf~md+xW6{ zA6ZOyh22T^u_GIa{U{%+$B49-YfZ=rEC;}8WtceF%kLmLXa6a^g!%spmfD=PiW+a! zBVb4swNn3tzK+6y?OQM}Fy}@>qx2Q?yc zhYWbZ=$`_N^x#XdJ%rS}39nY%6Zn+ayCMqzqpG(x-X1`Y7H=1J&{*+WlL;dg)(6V# z_x2h%Jqob$tCEfro_4l40h0$)d|z{EYC#B3h-UDb$tL3`kP=;)Ewyx1V%p0X7%y(D zkL~0JE*pM0@fKMfyoXuRd1fM~4;Jfh3$3Z>wvV+8t~Y78Q_3z|5@z#*D)`SGJxrhl z#s%4NXu^z9?D;p^fL+msXqy@Hi}laOsSIm6;&MgD)SYlFF=6J@Ak>o~hb3x@p4dra zIH*hLVxop*;*dfSZQ2c-MF;j zC6RmP$Ju*??cdYug!RO6f>ETp;764F^dVgFNWCGHrpsP)DbUXkFa5}C;(y^k)wFLs zahCThZ<47NFyuGqCEJK%eK~2=nrL2SFB{CB4INUhuCwd3%Cy1N<%xS2_ww-Ba+{~1 zoP3A`Wa=EkTw9MrStP~MZ?nEvxJQ0>MLKrPhn|=V@T(K$ zf{e`*jxryJx3F}xvY@-9C(hWi1Vp>s%j)I5H{}HaS~pHW8xzJRCKx^h&$)S&#qKF? zfMb~!{|%MFocmNj!$U3ewaPOmsPo&RY%0GI=Ua=>`mYDeEPn!vwFxz(!pAn5=cJM5 zm7sJe?k%pOr!w0;j5x`!xru!sX+E#!F>)h1xS)d^-Gs9*puW7{Z+`zdI3E!uWk#hx zZ)-`D@HK`LeD_qYh>FY>7L{_B^v%0mJp}1HYt~&w!f#wKXNCwL_-f+^fRbZd_D7 zwD=UI%QhZvpIDf@DgQ=~c?ivVo2tp@D{s+@1Z3)49^-%#i6)h61JO6@vQ2WIRo}6s zC0xJ&lP?j5nA~!7VR(=9#-3mO`t5=E?XY9c#b)whI7o`DeP5A>sH}RvHd_~tz(o3R zBOHP#!wdy%f*Bg8!rhYdV1{!4QPogj?jJBNK7L5}^JrGzamQkRUW|U%8xxBEj+^#o zQ6SH|V8@0$7gZZq&E&mL-Hx@?>Q=d^EV&jX=N75_veoTbeuO^j;Cf2v7`5%7ie16Z zxF;x;W6uB89IXG#ze96lY|)?V@h^zef;NfmSU~s!GrY63wu=2I$E&9$4UG#x`b3ezuo!V@E z0>!ll_ze#ai|5}refe>?*vh;7=bp{QgNu)P2$M4AeK%MT{3T0$4gl8@fVr)cUEPwB zA#)70wdmwcGi@CJ&#_-dVRoYlUfcd)ng}0)BkeHcE^tERe;EdR$Gm>&ry}$5?J8|E>CcZ;UC}9Y5Hc|L!oleM3H= zy5u5BvU~bxGs(7(k8fdGrmSU=<^47>!5nO5VqprR*MAT59t}+cljU&MwZUJ3imeya zgPsPSDD-Ws6knsNkfqYc`YTbRX&*w7H0=^84%Hx_&+Y8%ki1)`T;xsooTsgn+Y*a@kA$F=NcFI76%({sqkucfcG zw&t?g`)MO<#-&wIC5=DZq)Kq**X0jaQl49Ze$!QH^84e~0-nupwjFg~ct!#har&~g zBo{=WCkjKNA9&xwAtTl;KgGhiY7^I^yX0NL2l;VmmQq~a6M*}6fEqjAm1PufPAE0O z3dsqjoS!+~4WY`?t2rxiIKnZyvt;=cv|Cy~M5QHpr;+TSQAH2#;3|5WN((_GRG$GF zj`)AF@hFE%vx=-=)2-)n1Sw4iM4Z%qN9hrWneMebM6XYhN(R-H#&T%k>XE**A#_K0 zJA2Mj&GsS|Zk;g5R7dU`{w5ryo6k F^DlyH$>jh5 literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1mcmc_1_1adapt__unit__e__static__hmc-members.html b/doc/api/html/classstan_1_1mcmc_1_1adapt__unit__e__static__hmc-members.html new file mode 100644 index 00000000000..53cc19c93e4 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1adapt__unit__e__static__hmc-members.html @@ -0,0 +1,165 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::adapt_unit_e_static_hmc< M, BaseRNG > Member List
+
+
+ +

This is the complete list of members for stan::mcmc::adapt_unit_e_static_hmc< M, BaseRNG >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_adapt_flagstan::mcmc::base_adapterprotected
_epsilonstan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
_epsilon_jitterstan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
_err_streamstan::mcmc::base_mcmcprotected
_hamiltonianstan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
_integratorstan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
_namestan::mcmc::base_mcmcprotected
_nom_epsilonstan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
_out_streamstan::mcmc::base_mcmcprotected
_rand_intstan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
_rand_uniformstan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
_stepsize_adaptationstan::mcmc::stepsize_adapterprotected
_update_L()stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlineprotected
_zstan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
adapt_unit_e_static_hmc(M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)stan::mcmc::adapt_unit_e_static_hmc< M, BaseRNG >inline
adapting()stan::mcmc::base_adapterinline
base_adapter()stan::mcmc::base_adapterinline
base_hmc(M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
base_mcmc(std::ostream *o, std::ostream *e)stan::mcmc::base_mcmcinline
base_static_hmc(M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
disengage_adaptation()stan::mcmc::adapt_unit_e_static_hmc< M, BaseRNG >inlinevirtual
engage_adaptation()stan::mcmc::base_adapterinlinevirtual
get_current_stepsize()stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
get_L()stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
get_nominal_stepsize()stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
get_sampler_diagnostic_names(std::vector< std::string > &model_names, std::vector< std::string > &names)stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_diagnostics(std::vector< double > &values)stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_param_names(std::vector< std::string > &names)stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_params(std::vector< double > &values)stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_stepsize_adaptation()stan::mcmc::stepsize_adapterinline
get_stepsize_jitter()stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
get_T()stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
init_stepsize()stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
L_stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
name()stan::mcmc::base_mcmcinline
sample_stepsize()stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
seed(const Eigen::VectorXd &q)stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
set_nominal_stepsize(const double e)stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
set_nominal_stepsize_and_L(const double e, const int l)stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
set_nominal_stepsize_and_T(const double e, const double t)stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
set_stepsize_jitter(const double j)stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
set_T(const double t)stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
stepsize_adapter()stan::mcmc::stepsize_adapterinline
T_stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
transition(sample &init_sample)stan::mcmc::adapt_unit_e_static_hmc< M, BaseRNG >inlinevirtual
unit_e_static_hmc(M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)stan::mcmc::unit_e_static_hmc< M, BaseRNG >inline
write_sampler_param_names(std::ostream &o)stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
write_sampler_params(std::ostream &o)stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
write_sampler_state(std::ostream *o)stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
z()stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
~adapt_unit_e_static_hmc()stan::mcmc::adapt_unit_e_static_hmc< M, BaseRNG >inline
~base_mcmc()stan::mcmc::base_mcmcinlinevirtual
~base_static_hmc()stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1adapt__unit__e__static__hmc.html b/doc/api/html/classstan_1_1mcmc_1_1adapt__unit__e__static__hmc.html new file mode 100644 index 00000000000..e89696d95cc --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1adapt__unit__e__static__hmc.html @@ -0,0 +1,375 @@ + + + + + +Stan: stan::mcmc::adapt_unit_e_static_hmc< M, BaseRNG > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::adapt_unit_e_static_hmc< M, BaseRNG > Class Template Reference
+
+
+ +

#include <adapt_unit_e_static_hmc.hpp>

+
+Inheritance diagram for stan::mcmc::adapt_unit_e_static_hmc< M, BaseRNG >:
+
+
+ + +stan::mcmc::unit_e_static_hmc< M, BaseRNG > +stan::mcmc::stepsize_adapter +stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_adapter +stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_mcmc + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 adapt_unit_e_static_hmc (M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)
 
 ~adapt_unit_e_static_hmc ()
 
sample transition (sample &init_sample)
 
void disengage_adaptation ()
 
- Public Member Functions inherited from stan::mcmc::unit_e_static_hmc< M, BaseRNG >
 unit_e_static_hmc (M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)
 
- Public Member Functions inherited from stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >
 base_static_hmc (M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)
 
 ~base_static_hmc ()
 
sample transition (sample &init_sample)
 
void write_sampler_param_names (std::ostream &o)
 
void write_sampler_params (std::ostream &o)
 
void get_sampler_param_names (std::vector< std::string > &names)
 
void get_sampler_params (std::vector< double > &values)
 
void set_nominal_stepsize_and_T (const double e, const double t)
 
void set_nominal_stepsize_and_L (const double e, const int l)
 
void set_T (const double t)
 
void set_nominal_stepsize (const double e)
 
double get_T ()
 
int get_L ()
 
- Public Member Functions inherited from stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >
 base_hmc (M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)
 
void write_sampler_state (std::ostream *o)
 
void get_sampler_diagnostic_names (std::vector< std::string > &model_names, std::vector< std::string > &names)
 
void get_sampler_diagnostics (std::vector< double > &values)
 
void seed (const Eigen::VectorXd &q)
 
void init_stepsize ()
 
unit_e_pointz ()
 
double get_nominal_stepsize ()
 
double get_current_stepsize ()
 
virtual void set_stepsize_jitter (const double j)
 
double get_stepsize_jitter ()
 
void sample_stepsize ()
 
- Public Member Functions inherited from stan::mcmc::base_mcmc
 base_mcmc (std::ostream *o, std::ostream *e)
 
virtual ~base_mcmc ()
 
std::string name ()
 
- Public Member Functions inherited from stan::mcmc::stepsize_adapter
 stepsize_adapter ()
 
stepsize_adaptationget_stepsize_adaptation ()
 
- Public Member Functions inherited from stan::mcmc::base_adapter
 base_adapter ()
 
virtual void engage_adaptation ()
 
bool adapting ()
 
+ + + + + + + + + + + + +

+Additional Inherited Members

- Protected Member Functions inherited from stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >
void _update_L ()
 
- Protected Attributes inherited from stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >
double T_
 
int L_
 
- Protected Attributes inherited from stan::mcmc::stepsize_adapter
stepsize_adaptation _stepsize_adaptation
 
+

Detailed Description

+

template<typename M, class BaseRNG>
+class stan::mcmc::adapt_unit_e_static_hmc< M, BaseRNG >

+ + +

Definition at line 17 of file adapt_unit_e_static_hmc.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::mcmc::adapt_unit_e_static_hmc< M, BaseRNG >::adapt_unit_e_static_hmc (M & m,
BaseRNG & rng,
std::ostream * o = &std::cout,
std::ostream * e = 0 
)
+
+inline
+
+ +

Definition at line 22 of file adapt_unit_e_static_hmc.hpp.

+ +
+
+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + +
stan::mcmc::adapt_unit_e_static_hmc< M, BaseRNG >::~adapt_unit_e_static_hmc ()
+
+inline
+
+ +

Definition at line 26 of file adapt_unit_e_static_hmc.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + +
void stan::mcmc::adapt_unit_e_static_hmc< M, BaseRNG >::disengage_adaptation ()
+
+inlinevirtual
+
+ +

Reimplemented from stan::mcmc::base_adapter.

+ +

Definition at line 41 of file adapt_unit_e_static_hmc.hpp.

+ +
+
+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + + +
sample stan::mcmc::adapt_unit_e_static_hmc< M, BaseRNG >::transition (sampleinit_sample)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_mcmc.

+ +

Definition at line 28 of file adapt_unit_e_static_hmc.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1adapt__unit__e__static__hmc.png b/doc/api/html/classstan_1_1mcmc_1_1adapt__unit__e__static__hmc.png new file mode 100644 index 0000000000000000000000000000000000000000..7696d148c6ec000fc21f0d7a0ec3533c5e8f9f30 GIT binary patch literal 4541 zcmbVQ3pktEx(;gE$!I&Xn@&|-PDfnQDxt=m^rjW+GNDyULRHmP;!aSsnyR*_xP%hX zsjyo`QI`;jiCv0fw_2A5sgkDZevP=qSxIL)``OPq&pCU0o+Rr}-v3`~ed~MQ@BJh> z*qz!ARe(YuknL!z6Br0&3k-}`w#k5ZzipN$z=yoUX(!9g%}p@;G`SR(%Dx9il2=nx zlWfwU3b@=Bim`Kq0Fe0aZM%~m1oFda^ogTRky2Ab6XCfgFw2qdJG!f))EEWsJ!E)Z zO|kEXOuh6AN!x$)v)`!J>cC`qyI|!t9fo7G;0W}5r4!WQ01=MJl!nQjqTPd++tMI3 zj1>ukIPzPd6BIrF4gi?BupQ|6lJ(x_==tZ5U?I}>wgVNt8o04k)tnlq zJtbNe`t}k6O;}wDs9ZY>j0T$dQ>Jvrj4IJFB0qZZZ#UunjV8Gkcs%J)m6HzmXJAE(1{Y1UHhf;4sz6}2?mP34lX zklgUU0%a$D`M2=@^5E00m0C6~S>6QCf+NOY&(!tpllP&MOng5y4Sr}33TC`(&!n=f2M_l_nts3?<77#r}m9ps9h zl{rDe0Q%-bO#D2tFfc{f{7B{MOB7}@!SE^$I~@b%tN`BC3M3$7dK zc(2!$)Q#YWTeK0}bhcBN!n-#(s)y;O*Yg@&a7e=WSChjbju-NSD%zr^l3~j~E-E1g z>uSIO8JdyU_ZR)AYqvk^aR{+@PYhpvIfhi^$e~E=$fa178C!-b(dYIMj9zsJml)1} zSwi6SbM`%+=h@CQXVTaSR%<{5;jhvvI!Y>M{+< z6FkINRVuR%65$gS3$z*QkuK?ga3LoerABO&rL=|@20DK$KFUI5b<()huPX|CK^CARQ!hYDl@5`KMAenep(f{UTm#I>wzo* z!R236N)TqvP(h;>vouPcg%v1inV9jW&GknG5 zpB2mOe?;~_$qRdO>i;1Qf8zf|MUYAzm0Cczctl@C@jldc*pM>d1ecQ%StN^#f^)H? zGQh#M#oPz72r36!Ppk+fjsP}5X75MGX8P!0`5WupPD^_y`e`~UtUQo3h%~n$P0of^ z_~dJ~MVSQ&nny8-wN&`Ph+en?O2j<8W{MsuKM@%>j~_BYi+-?hhobf7?!vls(*j75&E{dYts4wrazN?J~UU>;Q+DcFO)r>8I4a`=gxnv zW+97QYE@jvFVf_U8MNnPlkNVW%k7_1HY+Z0i2Z}_&+0b_1~amK+^$q&qg4UfuAYJ( zr_AgpvUZOUru`kX_gj&4+BAtv9eDBuj-qL&o}eS_Q@AA;5xj7$OuhfyW(usOM6ec# z|Dc30bDS)CLGdTt?&!=TJjd^gj!y98D!3Wzta@LGeG#Ojv$FM&-@5>#-nmf9)3b@aA$O!l)`kOwZQ zTtJhhewXY9OkLHB+^gfu!}e%T{40Ki62gtVm}@nHKe4jBH2DoL+RD?lF!5lNRf|`4 zSn-I!pf@oj_(iB2_8)a0Oou9hmXk#@C|(LIUn|__?ew#mil0;C!rKF+4PIuKq;PuA zN`xk2h!b#V&Af27_9rt&VlKIQPbXZ6aiay=bKM||ZiRJp*Tq7^H7agQh z%NgxeII;SL9hQ{{6P>-GbDVsqj~vEa5~Lj?#T>O@tfp$Ops>8(HHgYhVkQA|;JES{ zYDLOnsS-zH!>dL#_NMrJgtxtH{*ihB+ci9110V2Wogg^ps^ zbuSUm09?~~iJFt<#@&iOY%$#lCnSOz97~auA>yTXCCe~O{y>10fXS~VwMbzp ze;~e0-gIIVQVu*ZEvQbU)lr!N6l_mXka(wLBP}$BH0He*L`Myc%>sb}R_o7b0hcEc zGI-kwvGKJ7Z#>{IL0OSQ*_fBrq)gjh{eaeXYoLZ|CPPOY#@An`k4?;uV~iRfF65fvizkBI#(;fcMe`=_L<5F)tE1! zJ#FmszcYN(n^WI_F~X}i*UFQE2Try$-IYa|8sXfbaX%eBpKOm0nwo=8=yIpj6KeOs z+gRPjHY0C-;2Q`RF!E7h0<68Y=U+J;MJ(Z!Co#;P^~|yZITzM-E|1vQjO>Jea=ozD zQq;@*w#O{YC^zCdpl%EkX7JaIW{j1d5+~XmL44$|g7&<+KK>{X2uMujUzqjcSa8M$ z8P7`=R0;!72_V^H?u{QZkD(=AH2dhXv+(KoM|Z@aTgBlh{~_PCelok$*>%&d;UB06 zH*~a#sEh*N-u(lL(Vq2phv~EGaL^&Fgd*}9#_9_2oKIaHrncG9v1V}%QL$5_>Soo` zAF+H+a!5eKYLRcNpfP-zF#Kp<_(PdJJ*n6GENT5aaXcSvDODS`sAsTj%BdPJJ?k0c z9sS0RUNmva-7R0~O27EgPwZE;SnFq5Hi}GdXv#jp+ld7i(%}5dJa~>!c|T|-?zTSc zTSZEI23+_VB+SiGa&&`)*SP;9alf=|paNTYx@6G+4;b1Bf4UK!uAQ1nn2)!E5vsVeJ~|ZgLD{K(8b5I{&H1 z`KN}4w-{oixPupHq$qA;Q^bv+&0z@bTKsD{(6H)%Kl@H!#zA45W+w#nvoccUwud3S zT{3gU(~*vR>LV)9Mu4VRMmji>h(D-XwdBzE-suCJ{9c4Y-8wtFPla3dcsn;m%) z%Ad|JoPGbUqksH*iLynB@j>7dcipO0H=4dhP7c2Okg73JL=RyGRPwD`(Z?yC@93Rf zOI(qhAm@BU)UUNTzk#LSl+C)=Fz2X|k?$vDup$|%CFo=vrGu07(@@uC!S@d|m} z#RtpxbcY#WvbA$>PMg1q)QcKjCY=1%?S8a9G(veZ4Hi%+v#APfc{hn2)#|_Czb~@* zL2*uPSO5)~Mb{wu(>Om4$+_Divj)=GobL6%CzRTGRcW5Qin>`;R4>>44Sk1g zX#?Tc>PdIRl>=93PsM~={rhOdUbmmSuCwew{LagMpswz~1s(-^<2piHhlH0@xO=0J zb6vY<<#0jfU%qyDe>`-fK>vG(`%<8F|3(^{dkJDKBSqT_8u!cp^}gEoo3B4Mj|6Ha gHjm7*kBp$4n|xo$XAyUU|FuBSmUbt~j(J@FZ)+HL%K!iX literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1mcmc_1_1base__adaptation-members.html b/doc/api/html/classstan_1_1mcmc_1_1base__adaptation-members.html new file mode 100644 index 00000000000..b3a64c31965 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1base__adaptation-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::base_adaptation Member List
+
+
+ +

This is the complete list of members for stan::mcmc::base_adaptation, including all inherited members.

+ + +
restart()stan::mcmc::base_adaptationinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1base__adaptation.html b/doc/api/html/classstan_1_1mcmc_1_1base__adaptation.html new file mode 100644 index 00000000000..73bf7e1bbf9 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1base__adaptation.html @@ -0,0 +1,166 @@ + + + + + +Stan: stan::mcmc::base_adaptation Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::base_adaptation Class Reference
+
+
+ +

#include <base_adaptation.hpp>

+
+Inheritance diagram for stan::mcmc::base_adaptation:
+
+
+ + +stan::mcmc::stepsize_adaptation +stan::mcmc::windowed_adaptation +stan::mcmc::covar_adaptation +stan::mcmc::var_adaptation + +
+ + + + +

+Public Member Functions

virtual void restart ()
 
+

Detailed Description

+
+

Definition at line 8 of file base_adaptation.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + +
virtual void stan::mcmc::base_adaptation::restart ()
+
+inlinevirtual
+
+ +

Reimplemented in stan::mcmc::stepsize_adaptation, and stan::mcmc::windowed_adaptation.

+ +

Definition at line 12 of file base_adaptation.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1base__adaptation.png b/doc/api/html/classstan_1_1mcmc_1_1base__adaptation.png new file mode 100644 index 0000000000000000000000000000000000000000..3aa26524f008b3a8f237094ea62827663b7198f9 GIT binary patch literal 1722 zcmdUwc`(~)7{`CvUn7$@>-M>2f=e{%F=Xu_lcjkGX_xa5Grg^wI z$;lj%0RTV_=X}}|0KNdB__p+(bzMUFLJs9|_Ppcn?k*J0Ew0C9v}8ijN3q##c-puo zw3Q}#x_JT6p}jTKao!jJq;R;?_U98}OZi+{xz-_gUU>HIZoBTcM>yP-oR=|GD*iXM zsvrIAOBQB&;u8Qi5H+il6@dWaLlHn|*e9wrO1d=@H_%z!A-UOFg>@Z+k@Lkc1h8{U z9T;t26Z|$iyZQX2KDK`O&NBCgveH(<6EWdlQbPY>Z1+X$^*~$93s3UVcpyYKD{Iq# zF#d90c3UA9eeO`s76+{@GX2n!-dJ4Vyrx$r?E&SEH=eZ%Hoeds`kl_|D;Z^{@8{X9 zrO;{JKn9Nm>}SW%^rl{wx0zv=Q=W0m1`6Q>u483l2m-Ka8y9r_s(^wjUWSvvQJsCqcOv}OjmYuoUkH9MzE}~*D~6{sMsfm%P^Qw9C208WQOO=;%USW6(FsK z)Ckf{Cw-C3Qo67+EV28EYGlM>Q*|50{0*_dJui3*9k?8`)ER`?FtoWPm67yYDl0|6MpxLd%zDhQQ)rpaW_pL|)vtKs4$Rw$RzW&`!7C_+Lz&{xkpkgH zMrZJqdA%4(4<#k$7Zzl(7gSbkY3?t>$`QPDU=tNZm1#;pKOBVm1755J(y7I<8h-i+omSk3Z@nyd_v zwkEej1!;9M|C-z)S^Ek^%Hm6CxbUqK(A(SFoZq7eLy^(v{^w90=R;6pj2EhYeD`6U z_ogC&|DK}0{}uAAJ44%WH9;+ti4_l1*6P-ilc-G%arPwrKV{R!O=(4LF55XLAUfXH7%jWg{s|Gw`V?e?I^KLowzWB<<`rKU(AnG^iNj*hL zK1xq#z-enHGo_9+qF<7dbHDP~VY~uDgU5OAPJ1mjMD)nN+9q$pAXuzeB@i~spT{Oe aQ39$AmlXYxuS$bH8UW|$cDm9bB=v96GXYot literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1mcmc_1_1base__adapter-members.html b/doc/api/html/classstan_1_1mcmc_1_1base__adapter-members.html new file mode 100644 index 00000000000..d28758468f1 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1base__adapter-members.html @@ -0,0 +1,117 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::base_adapter Member List
+
+
+ +

This is the complete list of members for stan::mcmc::base_adapter, including all inherited members.

+ + + + + + +
_adapt_flagstan::mcmc::base_adapterprotected
adapting()stan::mcmc::base_adapterinline
base_adapter()stan::mcmc::base_adapterinline
disengage_adaptation()stan::mcmc::base_adapterinlinevirtual
engage_adaptation()stan::mcmc::base_adapterinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1base__adapter.html b/doc/api/html/classstan_1_1mcmc_1_1base__adapter.html new file mode 100644 index 00000000000..649ca9b33bd --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1base__adapter.html @@ -0,0 +1,282 @@ + + + + + +Stan: stan::mcmc::base_adapter Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::base_adapter Class Reference
+
+
+ +

#include <base_adapter.hpp>

+
+Inheritance diagram for stan::mcmc::base_adapter:
+
+
+ + +stan::mcmc::stepsize_adapter +stan::mcmc::stepsize_covar_adapter +stan::mcmc::stepsize_var_adapter +stan::mcmc::adapt_unit_e_nuts< M, BaseRNG > +stan::mcmc::adapt_unit_e_static_hmc< M, BaseRNG > +stan::mcmc::adapt_dense_e_nuts< M, BaseRNG > +stan::mcmc::adapt_dense_e_static_hmc< M, BaseRNG > +stan::mcmc::adapt_diag_e_nuts< M, BaseRNG > +stan::mcmc::adapt_diag_e_static_hmc< M, BaseRNG > + +
+ + + + + + + + + + +

+Public Member Functions

 base_adapter ()
 
virtual void engage_adaptation ()
 
virtual void disengage_adaptation ()
 
bool adapting ()
 
+ + + +

+Protected Attributes

bool _adapt_flag
 
+

Detailed Description

+
+

Definition at line 8 of file base_adapter.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::mcmc::base_adapter::base_adapter ()
+
+inline
+
+ +

Definition at line 12 of file base_adapter.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + +
bool stan::mcmc::base_adapter::adapting ()
+
+inline
+
+ +

Definition at line 17 of file base_adapter.hpp.

+ +
+
+ + + +
+
+ + + + + +
+ + + + + + + +
virtual void stan::mcmc::base_adapter::engage_adaptation ()
+
+inlinevirtual
+
+ +

Definition at line 14 of file base_adapter.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
bool stan::mcmc::base_adapter::_adapt_flag
+
+protected
+
+ +

Definition at line 21 of file base_adapter.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1base__adapter.png b/doc/api/html/classstan_1_1mcmc_1_1base__adapter.png new file mode 100644 index 0000000000000000000000000000000000000000..2151e42aa40a04b7904908a927f042deb66b3933 GIT binary patch literal 4106 zcmds4c~sNK7KTRwMTOeZDk?-vG+0HDin5sqxTTShf)&{keS*j$$R3CgAE30yg_=}S z*{LEbRwOL4B>^nN6cNf6H3sknNJ4-_NCG5;yb0iTj_;42^WJ&qynD_t!<{?#&i&@j z_nZ8PK_6IQu*N`3OKS!4;9d_cEqwtP|FA>{{GF_JA%ku;=Fs7NYPA{+1*5XqjHaK! zXudTxH0b{L5(55R661mP)B;8t>G|WZjh2?tb>v>>!+7m6t|;oox2r#CIC;2PiI{lJ zZQA4V>la(?c^!7^%Sac>=nM=7BbhQxe^dzCadV4#!T)S%@$A06i!+c$*VsLcacwIN zG-7sF$Dk_o3RnYHVN5X({G-!SG?G4YE@dps+*l({-KKiow_IocOmB~)_fL-%q%WEj zq>niW3JZV?6v|C8>69TOoV%4iK`BcZWKZ=^DW2gc6rrUu0?dkTI8h@!eZA-Ek@RGo znfy;@BVCOcRZdBjiS;T6i3-2A1-8~5r=I>HRm>cz_sYJ%PROO-s7^Io*lCE^S)KGl z{^yDSV;nxorp0U7>^dnwv~*Y%((x$ygME~4S5A}%cQC9ZWdqEMrK$JW@C2D+dKNlb z{LY)UYUBmWb2|Jtn^q4&Ofja?g;P*>YU^@r4=kM9?Z13(4(kllHSMzISbz*r7Y-2|W9j04 zEb!sX6R_R$XKU(dgHsYegGi2Ut{JoE~Sse_H{2`YDeug{IA)-C=5yyp!^}YMlkChU^>gah*3lOp z(-0rhO;P|zS>Bnsi4}Kx^JtN!8)@u?$Lf1She%^S=w~S3EGVb4=mDi_2eK*@b^Jl* zH=wsaZgo1C6b4*jUvxsB-?u#9=<^ixLus^%A|%z{*MJa=A_vq}8S91GgZ?7{!WdCz zq=4)#sM+M9^4)qlhe&?xs3vSnh4kv>LnPl(&dVxexs4R-5acb6I&m6A4q7KgPK26D zCE{O_I$*5TV3d;=07m^I1?fQ*tp$ksv#RvcVv0?@N)gr~Qi=&lVNMAu(MCA7p01QL zWC!3lniDaCpdJV*n$p?C!dSva1EWz8?&FNyBh602SF|h+NNGP81@Y`%I`TZT2`*nP z756AD27FicifOik0X(5-@QlI^_xISJV@(;WswWyV@;0$fX&i;3AbpP~amDdsN85*% z=V{ApDd_Kd)4R(p&nJ!U5HPk#%P|N=rYjw?D$|aEOm-snY++6Dq^A%{;wv4bjZ5oN zf{C>N^5xpKTnj4qWOl2_-#5qirf41Rw&4XvD|D87A*ja@7`en8&U>(8nG0wFVYNI8BFgD zUdymE1MPY+*7~;)^yJDY@tq6H^}zDO@0Lew#78u>c8M5+XXJPeeoQ9(tTckAQs9+i zTye%(h-%U3Bih6h;o!OKxNMT!I+$vGeD`Jbr!zkIR4oecqZ z*xce-BXujvvXvV4iLT?(%)mR~PG2q;P!mjJf<2odeH;)XdE z9`gXq_7T!b^KtuMkyhcc_c>Ccj&d@~hy{(er_qARdwmo%J4543@2U5@eRd(_ruAX- z^Mz|RFYh^c{PunW^Bu_5cds^KE*rm_y3_&HOu5>6yf@`SPJ6d%acar`vBShG2Pxn? z5bu{6c-`OJKQqwe?$vFrQ~(=L1FTx9TU~8CL3I^wMS38qtlAt+hctI16|M;;0W)&I z?fqF$*H}QkODu!l)7W-GfiJ+Trcw=^U55fci<-+jkia$4=CFPe=~71&uz9O_>lj=y z^NJi`^H%dF6xTsugtTdR?!f*sIYC`@0{c=l*(PgwByuPDNovNDl$=Q`IhynhV>AD( zc5(!*LbQTkM|k{DP3zyxZA(wUdzbEWAe{T0A~P!PRFUSg&D$b(sRD0C>)9!}F)y5n zliRJlCV3O?9?Isdd`=%ia;-n#PZpLs_mJsy=Oihox+sf~K1(!_#%~oNwgXo9-L=(W ztiYXwuw`;%H01CwOBJ5@sDS7%l*pvi&JjN>_N>`JG>;`J-3ad^APRdNO1SW+vJ)yc zu7sC!PhP`hV`0MCot5Hp@7yQsMueISCH^zfzId60X+nel7B#bSqIt5${qZiYi}>1j zQCl&4YIz{-Q{kXC8rRFwSLKr7H0tEOVOlo!V$2^}`Mhw2(pgRaogYZ_>t*xC4A49C z=DOPNf4WnGLKh&UZ?P<>dJI zOPU>9IOo-~+lVOUHcOPg@s5Op9i zrA{b22mrMozr}z^VX&#z81TuAq_X*(5`U}ZH)O-h8gahk%C8xJb5eGAhXk#Xsg$Cw zRrCyKjUdFnc)8?T+tL_SMQHpo%~9|=+cxxP1Z@^2+;snR;AJ2!p#!mA*rm!J4o}?J z8LV>_#1reQm|sOu67k-nP4*1&8HZ!Nr3m;;?c=Eu3K140ubGLe5KUtJyZO5&${j=? zHPwl0pz!kfwXaHOq`^&Wbss3a(Mxm+&8H2r<>kh~?C`>PbbPF3KZkhBF~ZwwuS3GQ zE{bf}S^d-6M%G+=)GpeW!k@L_Os@0-sDH<4@`fxZaSW|rs}k=<>Q(!mLryr>~eeK$M=p)Suq#cp#CjMIMZgv+MpObxtxzh9Yvq70p+W zQOz`ZK68blQ2VLzgmLQJ@SeP1?-{L@I_lZ&dpx;ZQ4(2CkH!C5C%mDjl4$XlCZvE( zsLz2F&>5JU=8E>eKBrMp6ZDcuescb!O-Qrh?^5B&Z3HTa*v$j#S(Mq_R322Fso}E^ zxM~F4?Umq7yTE53aFqji9;AV1@B*KGz*U9{s7WDsIe$o$^NvB_{incNc%C{x2$g6e r1(aL4wUyd-H)nC=_HTGurN1LGa;$ONi6-#FT?@Gnz4yM$v6O!Sm{$mj literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1mcmc_1_1base__hamiltonian-members.html b/doc/api/html/classstan_1_1mcmc_1_1base__hamiltonian-members.html new file mode 100644 index 00000000000..51012da4d2a --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1base__hamiltonian-members.html @@ -0,0 +1,128 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::base_hamiltonian< M, P, BaseRNG > Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1base__hamiltonian.html b/doc/api/html/classstan_1_1mcmc_1_1base__hamiltonian.html new file mode 100644 index 00000000000..649e6e8b8e1 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1base__hamiltonian.html @@ -0,0 +1,639 @@ + + + + + +Stan: stan::mcmc::base_hamiltonian< M, P, BaseRNG > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::base_hamiltonian< M, P, BaseRNG > Class Template Referenceabstract
+
+
+ +

#include <base_hamiltonian.hpp>

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 base_hamiltonian (M &m, std::ostream *e)
 
 ~base_hamiltonian ()
 
virtual double T (P &z)=0
 
double V (P &z)
 
virtual double tau (P &z)=0
 
virtual double phi (P &z)=0
 
double H (P &z)
 
virtual const Eigen::VectorXd dtau_dq (P &z)=0
 
virtual const Eigen::VectorXd dtau_dp (P &z)=0
 
virtual const Eigen::VectorXd dphi_dq (P &z)=0
 
virtual void sample_p (P &z, BaseRNG &rng)=0
 
virtual void init (P &z)
 
virtual void update (P &z)
 
+ + + +

+Protected Member Functions

void _write_error_msg (std::ostream *error_msgs, const std::domain_error &e)
 
+ + + + + +

+Protected Attributes

M & _model
 
std::ostream * _err_stream
 
+

Detailed Description

+

template<typename M, typename P, typename BaseRNG>
+class stan::mcmc::base_hamiltonian< M, P, BaseRNG >

+ + +

Definition at line 17 of file base_hamiltonian.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename M, typename P, typename BaseRNG>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
stan::mcmc::base_hamiltonian< M, P, BaseRNG >::base_hamiltonian (M & m,
std::ostream * e 
)
+
+inline
+
+ +

Definition at line 21 of file base_hamiltonian.hpp.

+ +
+
+ +
+
+
+template<typename M, typename P, typename BaseRNG>
+ + + + + +
+ + + + + + + +
stan::mcmc::base_hamiltonian< M, P, BaseRNG >::~base_hamiltonian ()
+
+inline
+
+ +

Definition at line 22 of file base_hamiltonian.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename M, typename P, typename BaseRNG>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::mcmc::base_hamiltonian< M, P, BaseRNG >::_write_error_msg (std::ostream * error_msgs,
const std::domain_error & e 
)
+
+inlineprotected
+
+ +

Definition at line 62 of file base_hamiltonian.hpp.

+ +
+
+ +
+
+
+template<typename M, typename P, typename BaseRNG>
+ + + + + +
+ + + + + + + + +
virtual const Eigen::VectorXd stan::mcmc::base_hamiltonian< M, P, BaseRNG >::dphi_dq (P & z)
+
+pure virtual
+
+
+ +
+
+
+template<typename M, typename P, typename BaseRNG>
+ + + + + +
+ + + + + + + + +
virtual const Eigen::VectorXd stan::mcmc::base_hamiltonian< M, P, BaseRNG >::dtau_dp (P & z)
+
+pure virtual
+
+
+ +
+
+
+template<typename M, typename P, typename BaseRNG>
+ + + + + +
+ + + + + + + + +
virtual const Eigen::VectorXd stan::mcmc::base_hamiltonian< M, P, BaseRNG >::dtau_dq (P & z)
+
+pure virtual
+
+
+ +
+
+
+template<typename M, typename P, typename BaseRNG>
+ + + + + +
+ + + + + + + + +
double stan::mcmc::base_hamiltonian< M, P, BaseRNG >::H (P & z)
+
+inline
+
+ +

Definition at line 30 of file base_hamiltonian.hpp.

+ +
+
+ +
+
+
+template<typename M, typename P, typename BaseRNG>
+ + + + + +
+ + + + + + + + +
virtual void stan::mcmc::base_hamiltonian< M, P, BaseRNG >::init (P & z)
+
+inlinevirtual
+
+ +

Definition at line 41 of file base_hamiltonian.hpp.

+ +
+
+ +
+
+
+template<typename M, typename P, typename BaseRNG>
+ + + + + +
+ + + + + + + + +
virtual double stan::mcmc::base_hamiltonian< M, P, BaseRNG >::phi (P & z)
+
+pure virtual
+
+
+ +
+
+
+template<typename M, typename P, typename BaseRNG>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
virtual void stan::mcmc::base_hamiltonian< M, P, BaseRNG >::sample_p (P & z,
BaseRNG & rng 
)
+
+pure virtual
+
+
+ +
+
+
+template<typename M, typename P, typename BaseRNG>
+ + + + + +
+ + + + + + + + +
virtual double stan::mcmc::base_hamiltonian< M, P, BaseRNG >::T (P & z)
+
+pure virtual
+
+
+ +
+
+
+template<typename M, typename P, typename BaseRNG>
+ + + + + +
+ + + + + + + + +
virtual double stan::mcmc::base_hamiltonian< M, P, BaseRNG >::tau (P & z)
+
+pure virtual
+
+
+ +
+
+
+template<typename M, typename P, typename BaseRNG>
+ + + + + +
+ + + + + + + + +
virtual void stan::mcmc::base_hamiltonian< M, P, BaseRNG >::update (P & z)
+
+inlinevirtual
+
+ +

Definition at line 43 of file base_hamiltonian.hpp.

+ +
+
+ +
+
+
+template<typename M, typename P, typename BaseRNG>
+ + + + + +
+ + + + + + + + +
double stan::mcmc::base_hamiltonian< M, P, BaseRNG >::V (P & z)
+
+inline
+
+ +

Definition at line 25 of file base_hamiltonian.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+
+template<typename M, typename P, typename BaseRNG>
+ + + + + +
+ + + + +
std::ostream* stan::mcmc::base_hamiltonian< M, P, BaseRNG >::_err_stream
+
+protected
+
+ +

Definition at line 60 of file base_hamiltonian.hpp.

+ +
+
+ +
+
+
+template<typename M, typename P, typename BaseRNG>
+ + + + + +
+ + + + +
M& stan::mcmc::base_hamiltonian< M, P, BaseRNG >::_model
+
+protected
+
+ +

Definition at line 58 of file base_hamiltonian.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1base__hmc-members.html b/doc/api/html/classstan_1_1mcmc_1_1base__hmc-members.html new file mode 100644 index 00000000000..1562fdcba54 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1base__hmc-members.html @@ -0,0 +1,144 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::base_hmc< M, P, H, I, BaseRNG > Member List
+
+
+ +

This is the complete list of members for stan::mcmc::base_hmc< M, P, H, I, BaseRNG >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_epsilonstan::mcmc::base_hmc< M, P, H, I, BaseRNG >protected
_epsilon_jitterstan::mcmc::base_hmc< M, P, H, I, BaseRNG >protected
_err_streamstan::mcmc::base_mcmcprotected
_hamiltonianstan::mcmc::base_hmc< M, P, H, I, BaseRNG >protected
_integratorstan::mcmc::base_hmc< M, P, H, I, BaseRNG >protected
_namestan::mcmc::base_mcmcprotected
_nom_epsilonstan::mcmc::base_hmc< M, P, H, I, BaseRNG >protected
_out_streamstan::mcmc::base_mcmcprotected
_rand_intstan::mcmc::base_hmc< M, P, H, I, BaseRNG >protected
_rand_uniformstan::mcmc::base_hmc< M, P, H, I, BaseRNG >protected
_zstan::mcmc::base_hmc< M, P, H, I, BaseRNG >protected
base_hmc(M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inline
base_mcmc(std::ostream *o, std::ostream *e)stan::mcmc::base_mcmcinline
get_current_stepsize()stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inline
get_nominal_stepsize()stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inline
get_sampler_diagnostic_names(std::vector< std::string > &model_names, std::vector< std::string > &names)stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inlinevirtual
get_sampler_diagnostics(std::vector< double > &values)stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inlinevirtual
get_sampler_param_names(std::vector< std::string > &names)stan::mcmc::base_mcmcinlinevirtual
get_sampler_params(std::vector< double > &values)stan::mcmc::base_mcmcinlinevirtual
get_stepsize_jitter()stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inline
init_stepsize()stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inline
name()stan::mcmc::base_mcmcinline
sample_stepsize()stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inline
seed(const Eigen::VectorXd &q)stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inline
set_nominal_stepsize(const double e)stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inlinevirtual
set_stepsize_jitter(const double j)stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inlinevirtual
transition(sample &init_sample)=0stan::mcmc::base_mcmcpure virtual
write_sampler_param_names(std::ostream &o)stan::mcmc::base_mcmcinlinevirtual
write_sampler_params(std::ostream &o)stan::mcmc::base_mcmcinlinevirtual
write_sampler_state(std::ostream *o)stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inlinevirtual
z()stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inline
~base_mcmc()stan::mcmc::base_mcmcinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1base__hmc.html b/doc/api/html/classstan_1_1mcmc_1_1base__hmc.html new file mode 100644 index 00000000000..5026bbc84ce --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1base__hmc.html @@ -0,0 +1,801 @@ + + + + + +Stan: stan::mcmc::base_hmc< M, P, H, I, BaseRNG > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::base_hmc< M, P, H, I, BaseRNG > Class Template Reference
+
+
+ +

#include <base_hmc.hpp>

+
+Inheritance diagram for stan::mcmc::base_hmc< M, P, H, I, BaseRNG >:
+
+
+ + +stan::mcmc::base_mcmc +stan::mcmc::base_nuts< M, P, H, I, BaseRNG > +stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG > + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 base_hmc (M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)
 
void write_sampler_state (std::ostream *o)
 
void get_sampler_diagnostic_names (std::vector< std::string > &model_names, std::vector< std::string > &names)
 
void get_sampler_diagnostics (std::vector< double > &values)
 
void seed (const Eigen::VectorXd &q)
 
void init_stepsize ()
 
P & z ()
 
virtual void set_nominal_stepsize (const double e)
 
double get_nominal_stepsize ()
 
double get_current_stepsize ()
 
virtual void set_stepsize_jitter (const double j)
 
double get_stepsize_jitter ()
 
void sample_stepsize ()
 
- Public Member Functions inherited from stan::mcmc::base_mcmc
 base_mcmc (std::ostream *o, std::ostream *e)
 
virtual ~base_mcmc ()
 
virtual sample transition (sample &init_sample)=0
 
std::string name ()
 
virtual void write_sampler_param_names (std::ostream &o)
 
virtual void write_sampler_params (std::ostream &o)
 
virtual void get_sampler_param_names (std::vector< std::string > &names)
 
virtual void get_sampler_params (std::vector< double > &values)
 
+ + + + + + + + + + + + + + + + + + + + + + + + +

+Protected Attributes

_z
 
I< H< M, BaseRNG >, P > _integrator
 
H< M, BaseRNG > _hamiltonian
 
BaseRNG & _rand_int
 
boost::uniform_01< BaseRNG & > _rand_uniform
 
double _nom_epsilon
 
double _epsilon
 
double _epsilon_jitter
 
- Protected Attributes inherited from stan::mcmc::base_mcmc
std::string _name
 
std::ostream * _out_stream
 
std::ostream * _err_stream
 
+

Detailed Description

+

template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+class stan::mcmc::base_hmc< M, P, H, I, BaseRNG >

+ + +

Definition at line 20 of file base_hmc.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::mcmc::base_hmc< M, P, H, I, BaseRNG >::base_hmc (M & m,
BaseRNG & rng,
std::ostream * o,
std::ostream * e 
)
+
+inline
+
+ +

Definition at line 24 of file base_hmc.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + +
double stan::mcmc::base_hmc< M, P, H, I, BaseRNG >::get_current_stepsize ()
+
+inline
+
+ +

Definition at line 117 of file base_hmc.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + +
double stan::mcmc::base_hmc< M, P, H, I, BaseRNG >::get_nominal_stepsize ()
+
+inline
+
+ +

Definition at line 115 of file base_hmc.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::mcmc::base_hmc< M, P, H, I, BaseRNG >::get_sampler_diagnostic_names (std::vector< std::string > & model_names,
std::vector< std::string > & names 
)
+
+inlinevirtual
+
+ +

Reimplemented from stan::mcmc::base_mcmc.

+ +

Definition at line 42 of file base_hmc.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + + +
void stan::mcmc::base_hmc< M, P, H, I, BaseRNG >::get_sampler_diagnostics (std::vector< double > & values)
+
+inlinevirtual
+
+ +

Reimplemented from stan::mcmc::base_mcmc.

+ +

Definition at line 47 of file base_hmc.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + +
double stan::mcmc::base_hmc< M, P, H, I, BaseRNG >::get_stepsize_jitter ()
+
+inline
+
+ +

Definition at line 123 of file base_hmc.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + +
void stan::mcmc::base_hmc< M, P, H, I, BaseRNG >::init_stepsize ()
+
+inline
+
+ +

Definition at line 55 of file base_hmc.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + +
void stan::mcmc::base_hmc< M, P, H, I, BaseRNG >::sample_stepsize ()
+
+inline
+
+ +

Definition at line 125 of file base_hmc.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + + +
void stan::mcmc::base_hmc< M, P, H, I, BaseRNG >::seed (const Eigen::VectorXd & q)
+
+inline
+
+ +

Definition at line 51 of file base_hmc.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + + +
virtual void stan::mcmc::base_hmc< M, P, H, I, BaseRNG >::set_nominal_stepsize (const double e)
+
+inlinevirtual
+
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + + +
virtual void stan::mcmc::base_hmc< M, P, H, I, BaseRNG >::set_stepsize_jitter (const double j)
+
+inlinevirtual
+
+ +

Definition at line 119 of file base_hmc.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + + +
void stan::mcmc::base_hmc< M, P, H, I, BaseRNG >::write_sampler_state (std::ostream * o)
+
+inlinevirtual
+
+ +

Reimplemented from stan::mcmc::base_mcmc.

+ +

Definition at line 36 of file base_hmc.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + +
P& stan::mcmc::base_hmc< M, P, H, I, BaseRNG >::z ()
+
+inline
+
+ +

Definition at line 109 of file base_hmc.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + +
double stan::mcmc::base_hmc< M, P, H, I, BaseRNG >::_epsilon
+
+protected
+
+ +

Definition at line 143 of file base_hmc.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + +
double stan::mcmc::base_hmc< M, P, H, I, BaseRNG >::_epsilon_jitter
+
+protected
+
+ +

Definition at line 144 of file base_hmc.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + +
H<M, BaseRNG> stan::mcmc::base_hmc< M, P, H, I, BaseRNG >::_hamiltonian
+
+protected
+
+ +

Definition at line 135 of file base_hmc.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + +
I<H<M, BaseRNG>, P> stan::mcmc::base_hmc< M, P, H, I, BaseRNG >::_integrator
+
+protected
+
+ +

Definition at line 134 of file base_hmc.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + +
double stan::mcmc::base_hmc< M, P, H, I, BaseRNG >::_nom_epsilon
+
+protected
+
+ +

Definition at line 142 of file base_hmc.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + +
BaseRNG& stan::mcmc::base_hmc< M, P, H, I, BaseRNG >::_rand_int
+
+protected
+
+ +

Definition at line 137 of file base_hmc.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + +
boost::uniform_01<BaseRNG&> stan::mcmc::base_hmc< M, P, H, I, BaseRNG >::_rand_uniform
+
+protected
+
+ +

Definition at line 140 of file base_hmc.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + +
P stan::mcmc::base_hmc< M, P, H, I, BaseRNG >::_z
+
+protected
+
+ +

Definition at line 133 of file base_hmc.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1base__hmc.png b/doc/api/html/classstan_1_1mcmc_1_1base__hmc.png new file mode 100644 index 0000000000000000000000000000000000000000..72f35d053fd8774e41040a135e715ee28862b470 GIT binary patch literal 2033 zcmc&#dr(v75)V>=P#_whV4y`x0*DYm1?dDqkXHiXZA26a4@DxNBE*0RQW8yl5V#2l zw?a^nhZlvEODh2-5XBH7#S*C$6C&~wlSt$l<<*mRrgP`c^v>;HJu_#|e!F}2e7onj zzwc6bXrQ4!OdkXS8KQ&yB0-=HG(i7GPaBZvUHZ@sh*}Sn6d(hDL#aAk8)SG*6kpsRTPx3Q$j-z1fcaS!lAZk3xsvr zUUWG;y@bZmLL@L-B7lIE0$LoirTOh^c#h3~`e#Zx%bE4<9h5B#t24J=ykALu&OP(I zg8^e(xaI8#W2Rw&tSTHh%)O#gjXO^W2T`RYOQkG;yZHaa8#f)efx1 z585qx_6cPMMP2nDT!SZCgD(os`8$FWwDYPhtuCl@QELdP^u3fT@!CHk{)GBOas-9? z_IRL}ze}iRrrR2~w>8RP`5S(Y@bR@M{XA{&MsRvG zk)ve_Z;AM&ODDScS-??Ui}2r_ovf_~CRSEno7M6RwiqcHP0K#j)}izf{NVeVDJ1YCu2DVnoMh+tM;pvZs=?NDi=9e&{U|pg zX;GmLC)o{H zzE9!924a(fb{*|;zxcH5D(!n?{<)lJMtlh;iDVEUD$0pu*tL(IY8VdSw+q@{=kS*PqL-#o(d@3c=HLL!slqyF7u zF@K*1hTf**e52N^NohY0fWN|cd}(B!^SrABa)tw^In{5yS@_h*{YC-J-2pX}uMZur zSKzfBf{s@=Qw{&i*(h(jC2wogvVV1c5(HGPi?BA~n9=tg)Z3`=Lj$6_jCvF>K{R%o znyn@rVD|rCvC?m8MBjJX!_r8ezX4W1k9RY*X^EWfA~*ybuNj~YMqhn~snKn?V}7#~ z1HnbP`fe}%;%;ps4d<{Y2HUN7FFKd=?d8p}cmC3gqB_CQ5@nrh`LSchyX^9JGs}5y zAK}}W;{pRj2=hyHUI;*3_kam){+8*2j@<@kCA(=TED~xfBw+aP)EamQbI`Mt6U@Zr z<-S*_dxZ%pXUS3s%rIvcx%Q;XBkE6R9RZWZgAS)lUevW;IZ{56RIvIflwI{2`OR|j zXaCOSln2XF*G>?eomS5P*)}%?ske1`F;%36`)y{`y1lCeiGrOPA86QL2&>*)_Mz!S zUKDQUr`%)N!f9O{QIOi=CN?9JY~d+^4{;BXV>l4FXB@FZohDGK^LqYZM^)ehm&9Vx zgtdDQA;UVXIX9+!2C-84?44DD>yXgNYsZiPI+F1frRS3CbSCOa)K$B3;oLiG+u#b( zTQ$skVE*}lYT6e`88e_S#s7Q?$CrVXLipL(!&d9sR0@vae4w#+uDPOjN*Brw7G(vp z`^Zz>^8HC|#d26+_X%h=vyT(bkbOSfhdolF+DWCrNBb6suT9-BaZGXhfWThvcRwg{ zN|x+q4Hgmk@!<4H+jP_@{gdTZOI~@(Z(Mxg?j(^v9hTcF3PZ+TACx9Z*JMAGPw68| z#^S+ByRJ~T53TsBvazUaZ*B!rJa%}ZY`E@FrLFm{V}$c?3<%CGx( zS03!KZwOATtHUzsj@QPPE)vhO<|xMsDo0-1P$`EQtnum?^-W}Dj_@`-HTefiJ7HDQ z3;YsOwQL8>4?+kGkm^2yjA-GRE396ES>sgoc_JVFOX2@OiiYbk0HhiKB;76r0&#PQ p1c2jz0zi012fFzCS?WDy_2s=s`Lky1x4`)fLi>mMHTvQUeg%}Muvq{A literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1mcmc_1_1base__integrator-members.html b/doc/api/html/classstan_1_1mcmc_1_1base__integrator-members.html new file mode 100644 index 00000000000..1e3be2fb30e --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1base__integrator-members.html @@ -0,0 +1,115 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::base_integrator< H, P > Member List
+
+
+ +

This is the complete list of members for stan::mcmc::base_integrator< H, P >, including all inherited members.

+ + + + +
_out_streamstan::mcmc::base_integrator< H, P >protected
base_integrator(std::ostream *o)stan::mcmc::base_integrator< H, P >inline
evolve(P &z, H &hamiltonian, const double epsilon)=0stan::mcmc::base_integrator< H, P >pure virtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1base__integrator.html b/doc/api/html/classstan_1_1mcmc_1_1base__integrator.html new file mode 100644 index 00000000000..0d3ca97820a --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1base__integrator.html @@ -0,0 +1,246 @@ + + + + + +Stan: stan::mcmc::base_integrator< H, P > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::base_integrator< H, P > Class Template Referenceabstract
+
+
+ +

#include <base_integrator.hpp>

+
+Inheritance diagram for stan::mcmc::base_integrator< H, P >:
+
+
+ + +stan::mcmc::base_leapfrog< H, P > +stan::mcmc::expl_leapfrog< H, P > + +
+ + + + + + +

+Public Member Functions

 base_integrator (std::ostream *o)
 
virtual void evolve (P &z, H &hamiltonian, const double epsilon)=0
 
+ + + +

+Protected Attributes

std::ostream * _out_stream
 
+

Detailed Description

+

template<typename H, typename P>
+class stan::mcmc::base_integrator< H, P >

+ + +

Definition at line 11 of file base_integrator.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename H, typename P>
+ + + + + +
+ + + + + + + + +
stan::mcmc::base_integrator< H, P >::base_integrator (std::ostream * o)
+
+inline
+
+ +

Definition at line 15 of file base_integrator.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename H, typename P>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
virtual void stan::mcmc::base_integrator< H, P >::evolve (P & z,
H & hamiltonian,
const double epsilon 
)
+
+pure virtual
+
+
+

Member Data Documentation

+ +
+
+
+template<typename H, typename P>
+ + + + + +
+ + + + +
std::ostream* stan::mcmc::base_integrator< H, P >::_out_stream
+
+protected
+
+ +

Definition at line 21 of file base_integrator.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1base__integrator.png b/doc/api/html/classstan_1_1mcmc_1_1base__integrator.png new file mode 100644 index 0000000000000000000000000000000000000000..168b2ec195510fcdb732ed7b2c08335f0a34441f GIT binary patch literal 1221 zcmeAS@N?(olHy`uVBq!ia0vp^H-Wf=gBeK1ZrUdXq$C1-LR|m<{|{uoc=NTi|Ih>= z3ycpOIKbL@M;^%KC<*clW&kPzfvcxNj2IYLLOfj@Ln;{G&b>Y9u>ue4Z0FE_|0kP& zWEBvT_kj4XuN?D)Uvlohm#-co$-er_T*(%Vu*E5huUo8(^htBv z@3^gP7weuibM{3)GMrpCXXk^C{Z_ladm5zRsBRxVk;(cGmCn*H)jLax-K7-KH}|SBldP-N^k^ zyLs^+%g8Thcu&n?Tz4h#+_@8{=7gTw@AyoiR%o^N_ccW=8)IIjJpaDtf!6B6*Iw1T z4<*jKApQFB4L)blse290Cap1N3%@Mg_(U^5|F!VM^3aCgU;TK}?Y>W#D!cYpAmh4M zSDtbgU2|gl;c!2&mtp@}Pqquw)g&F_t7^sO7UwxI-dV92aJT6wOLusLh@}BH7=~s~FGnJRI zbFIyF@2q^EHDT7y>;99peo1ZOz8!Xg&xZGAcfDoHSCyEmzViq7U9!tOc2KJ}oy~BD zfpod2IPbp5Gw&y_U6{wHAHC%LG>$V%WYhJEy8Jioo_RLr+y2Q%FB#b?o_=Md+}&2` zp?2Yv#mSDy1-@ZLZ8MK(=yrf&AZ^`>V|!!lly8^a`M3G2RNRc%S1HpL&)e)Keagxs z&L@A8>-jqe)_piUXYNGP;;=iL)n-nyzFvLyUPh$q%8;M7lb2YR3dH_it>>w}t9MOK&hfxoQq!i`gdf;v zk$yFK!jkS^)kdDbNCIJ>(^+w{e?jy=^ zx+%?Aby?3jGbn!5L`%L%~re<_~%!185s21uQn-kA1j>CRhBv@ zCH21M!WC;XEf;5R^D0{H^XH~T^6HSsaYp%*a&K=v+0=M8uoaZha z%-3Oo4_f2+jm@S*< st~LL?)jaE$!o#F$Qsw)<9lzLDtO}pdbbz%ISmrQzy85}Sb4q9e03Y64wg3PC literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1mcmc_1_1base__leapfrog-members.html b/doc/api/html/classstan_1_1mcmc_1_1base__leapfrog-members.html new file mode 100644 index 00000000000..fad70db72c2 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1base__leapfrog-members.html @@ -0,0 +1,120 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::base_leapfrog< H, P > Member List
+
+
+ +

This is the complete list of members for stan::mcmc::base_leapfrog< H, P >, including all inherited members.

+ + + + + + + + + +
_out_streamstan::mcmc::base_integrator< H, P >protected
base_integrator(std::ostream *o)stan::mcmc::base_integrator< H, P >inline
base_leapfrog(std::ostream *o)stan::mcmc::base_leapfrog< H, P >inline
begin_update_p(P &z, H &hamiltonian, double epsilon)=0stan::mcmc::base_leapfrog< H, P >pure virtual
end_update_p(P &z, H &hamiltonian, double epsilon)=0stan::mcmc::base_leapfrog< H, P >pure virtual
evolve(P &z, H &hamiltonian, const double epsilon)stan::mcmc::base_leapfrog< H, P >inlinevirtual
update_q(P &z, H &hamiltonian, double epsilon)=0stan::mcmc::base_leapfrog< H, P >pure virtual
verbose_evolve(P &z, H &hamiltonian, const double epsilon)stan::mcmc::base_leapfrog< H, P >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1base__leapfrog.html b/doc/api/html/classstan_1_1mcmc_1_1base__leapfrog.html new file mode 100644 index 00000000000..d1bde162f92 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1base__leapfrog.html @@ -0,0 +1,410 @@ + + + + + +Stan: stan::mcmc::base_leapfrog< H, P > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::base_leapfrog< H, P > Class Template Referenceabstract
+
+
+ +

#include <base_leapfrog.hpp>

+
+Inheritance diagram for stan::mcmc::base_leapfrog< H, P >:
+
+
+ + +stan::mcmc::base_integrator< H, P > +stan::mcmc::expl_leapfrog< H, P > + +
+ + + + + + + + + + + + + + + + + +

+Public Member Functions

 base_leapfrog (std::ostream *o)
 
void evolve (P &z, H &hamiltonian, const double epsilon)
 
void verbose_evolve (P &z, H &hamiltonian, const double epsilon)
 
virtual void begin_update_p (P &z, H &hamiltonian, double epsilon)=0
 
virtual void update_q (P &z, H &hamiltonian, double epsilon)=0
 
virtual void end_update_p (P &z, H &hamiltonian, double epsilon)=0
 
- Public Member Functions inherited from stan::mcmc::base_integrator< H, P >
 base_integrator (std::ostream *o)
 
+ + + + +

+Additional Inherited Members

- Protected Attributes inherited from stan::mcmc::base_integrator< H, P >
std::ostream * _out_stream
 
+

Detailed Description

+

template<typename H, typename P>
+class stan::mcmc::base_leapfrog< H, P >

+ + +

Definition at line 13 of file base_leapfrog.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename H, typename P>
+ + + + + +
+ + + + + + + + +
stan::mcmc::base_leapfrog< H, P >::base_leapfrog (std::ostream * o)
+
+inline
+
+ +

Definition at line 17 of file base_leapfrog.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename H, typename P>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
virtual void stan::mcmc::base_leapfrog< H, P >::begin_update_p (P & z,
H & hamiltonian,
double epsilon 
)
+
+pure virtual
+
+
+ +
+
+
+template<typename H, typename P>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
virtual void stan::mcmc::base_leapfrog< H, P >::end_update_p (P & z,
H & hamiltonian,
double epsilon 
)
+
+pure virtual
+
+
+ +
+
+
+template<typename H, typename P>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::mcmc::base_leapfrog< H, P >::evolve (P & z,
H & hamiltonian,
const double epsilon 
)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_integrator< H, P >.

+ +

Definition at line 19 of file base_leapfrog.hpp.

+ +
+
+ +
+
+
+template<typename H, typename P>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
virtual void stan::mcmc::base_leapfrog< H, P >::update_q (P & z,
H & hamiltonian,
double epsilon 
)
+
+pure virtual
+
+
+ +
+
+
+template<typename H, typename P>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::mcmc::base_leapfrog< H, P >::verbose_evolve (P & z,
H & hamiltonian,
const double epsilon 
)
+
+inline
+
+ +

Definition at line 30 of file base_leapfrog.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1base__leapfrog.png b/doc/api/html/classstan_1_1mcmc_1_1base__leapfrog.png new file mode 100644 index 0000000000000000000000000000000000000000..43a191084598cf65c01e18ed198251972f0da491 GIT binary patch literal 1220 zcmeAS@N?(olHy`uVBq!ia0vp^H-Wf=gBeK1ZrUdXq$C1-LR|m<{|{uoc=NTi|Ih>= z3ycpOIKbL@M;^%KC<*clW&kPzfvcxNj2IYLf<0XvLn;{G&b>Y9u>ue4Z0FE_|0kP& zWEBv*uSa?wbB)(cAMUq>Pnra@Q=3-+n+>{?ME2-*elw{w7SVGoCAOG;4}Q)z`Q zm%U!1_=<^753;x23I8+e+0kFw_cwpoe)d@I>`8B{+jEMy{!RaUbk zkr!8qhE7`ds^paToJj7-Np=^?Qx>cI-3AY&m!8k|eplvtU}nqEc4b3K|M3+WhbP${ zWOJ3Co^#Eu;hxD!hF_Odm|u8L=2@WcYt*ohpuqX3bBdk0*bNq_Njk*ON@1v7sq(wy zOHI+`N0Db3__jzbNz3MC(fDebB7P_A1YereCh`B9IA8nO9Dnp6X~()P{IlvdcSns z@+TdgxwA3$VLLF`ui0#VG|%*;%o5#=zdp>9+|>Pj&BvUOO@-S2uREI8v>JuIKfXyk z$$C}q>HP=hUA>x?yJZc-(o^4g9{9=r$lw2pL48;68l9ZufwyGXCY5PEd2hSF-l2C+8GjSL0^;)}xg&ZE;=NS)-7U2{y~`S#G{%^lVDk;hjZk z=_&2$VLNqsjntQ(jaa)>A*B8F_cIe>_oSaqUp%Wfx-*KoB literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1mcmc_1_1base__mcmc-members.html b/doc/api/html/classstan_1_1mcmc_1_1base__mcmc-members.html new file mode 100644 index 00000000000..c631898b8ca --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1base__mcmc-members.html @@ -0,0 +1,126 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::base_mcmc Member List
+
+
+ +

This is the complete list of members for stan::mcmc::base_mcmc, including all inherited members.

+ + + + + + + + + + + + + + + +
_err_streamstan::mcmc::base_mcmcprotected
_namestan::mcmc::base_mcmcprotected
_out_streamstan::mcmc::base_mcmcprotected
base_mcmc(std::ostream *o, std::ostream *e)stan::mcmc::base_mcmcinline
get_sampler_diagnostic_names(std::vector< std::string > &model_names, std::vector< std::string > &names)stan::mcmc::base_mcmcinlinevirtual
get_sampler_diagnostics(std::vector< double > &values)stan::mcmc::base_mcmcinlinevirtual
get_sampler_param_names(std::vector< std::string > &names)stan::mcmc::base_mcmcinlinevirtual
get_sampler_params(std::vector< double > &values)stan::mcmc::base_mcmcinlinevirtual
name()stan::mcmc::base_mcmcinline
transition(sample &init_sample)=0stan::mcmc::base_mcmcpure virtual
write_sampler_param_names(std::ostream &o)stan::mcmc::base_mcmcinlinevirtual
write_sampler_params(std::ostream &o)stan::mcmc::base_mcmcinlinevirtual
write_sampler_state(std::ostream *o)stan::mcmc::base_mcmcinlinevirtual
~base_mcmc()stan::mcmc::base_mcmcinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1base__mcmc.html b/doc/api/html/classstan_1_1mcmc_1_1base__mcmc.html new file mode 100644 index 00000000000..265cee78970 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1base__mcmc.html @@ -0,0 +1,563 @@ + + + + + +Stan: stan::mcmc::base_mcmc Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::base_mcmc Class Referenceabstract
+
+
+ +

#include <base_mcmc.hpp>

+
+Inheritance diagram for stan::mcmc::base_mcmc:
+
+
+ + +stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_hmc< M, P, H, I, BaseRNG > +stan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_nuts< M, P, H, I, BaseRNG > +stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG > + +
+ + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 base_mcmc (std::ostream *o, std::ostream *e)
 
virtual ~base_mcmc ()
 
virtual sample transition (sample &init_sample)=0
 
std::string name ()
 
virtual void write_sampler_param_names (std::ostream &o)
 
virtual void write_sampler_params (std::ostream &o)
 
virtual void get_sampler_param_names (std::vector< std::string > &names)
 
virtual void get_sampler_params (std::vector< double > &values)
 
virtual void write_sampler_state (std::ostream *o)
 
virtual void get_sampler_diagnostic_names (std::vector< std::string > &model_names, std::vector< std::string > &names)
 
virtual void get_sampler_diagnostics (std::vector< double > &values)
 
+ + + + + + + +

+Protected Attributes

std::string _name
 
std::ostream * _out_stream
 
std::ostream * _err_stream
 
+

Detailed Description

+
+

Definition at line 13 of file base_mcmc.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
stan::mcmc::base_mcmc::base_mcmc (std::ostream * o,
std::ostream * e 
)
+
+inline
+
+ +

Definition at line 17 of file base_mcmc.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
virtual stan::mcmc::base_mcmc::~base_mcmc ()
+
+inlinevirtual
+
+ +

Definition at line 19 of file base_mcmc.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
virtual void stan::mcmc::base_mcmc::get_sampler_diagnostic_names (std::vector< std::string > & model_names,
std::vector< std::string > & names 
)
+
+inlinevirtual
+
+
+ +
+
+ + + + + +
+ + + + + + + + +
virtual void stan::mcmc::base_mcmc::get_sampler_diagnostics (std::vector< double > & values)
+
+inlinevirtual
+
+
+ + + + + +
+
+ + + + + +
+ + + + + + + +
std::string stan::mcmc::base_mcmc::name ()
+
+inline
+
+ +

Definition at line 23 of file base_mcmc.hpp.

+ +
+
+ + + + + + + +
+
+ + + + + +
+ + + + + + + + +
virtual void stan::mcmc::base_mcmc::write_sampler_state (std::ostream * o)
+
+inlinevirtual
+
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
std::ostream* stan::mcmc::base_mcmc::_err_stream
+
+protected
+
+ +

Definition at line 45 of file base_mcmc.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
std::string stan::mcmc::base_mcmc::_name
+
+protected
+
+ +

Definition at line 38 of file base_mcmc.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
std::ostream* stan::mcmc::base_mcmc::_out_stream
+
+protected
+
+ +

Definition at line 44 of file base_mcmc.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1base__mcmc.png b/doc/api/html/classstan_1_1mcmc_1_1base__mcmc.png new file mode 100644 index 0000000000000000000000000000000000000000..ee739441ebe44d165cdcd580cfcb458e112bf42a GIT binary patch literal 10185 zcmeHNc~n!^y4PB@b>g*XX&vBsjo<|&q8AYvQfq}qD4-IMF(@K}Ac!JEAbAdz+aisI zhTsE<)&UKY$UG;Yl?bUsKn)NeCuUf4sNeU8{$6$k}IQ@BQt) zzv1`$zI^NH?y`Kz>Lv5$&0CKA>dXD}=6&Q2p6fnX0RE4c(Jz6IPd(kd_Ndir@c3p# z9EX2+89Zt3y1KfB-*%aR<_D+uyC0Ybz64z_n!L8on`d?q`QgU+3mrgQvlZbS&b! z{?+^Ky6e}2Z}JQ_>0b$l7jN3s{zkH3iT;(_K7YxQ?K0)uam~)Wd)VF%x0JhiH5+0` zJP^>VXA4 zYOp!w24VqQq?S$poyO(`t#d$ZK1r`T`q|<~0TY%shVqtSO=&po0KbJ|vPZSoY0#YVMq}-ss6z}*59wbl)^Xwdn{17Wf zzg)pUJQLwoFjP_{VucZxmCYeD91{J5#Ya-uPJxSa9~Y+>&z<5$-@Jtj*C?@{@6x;K z4edX#|2mbkSh4M&J>~x;<$33@sgGWH&fGCT6X#sH-5Qo=N+VGb~j`u=v6ayvZo}QjDq=xrr8(Z>F zkRsa^ECFWHb=&%v#?RrXUq+4(|8tsmZ(4GFk)`W3V`ivt=1xa&5+v{tfyxZ^z4%9s z-fgY~FYp)nH&f3C=zIc<2-^UTV1z?~AvZRD1x{05YL48G+}cV3t{@!=zIy53h8+(x6{vlw! z-FKS|hFFe9l5o^pd5K3G0jTWT!fJC~wPif)5Yr8J8}4!N2k??U;EF;LT;#d@s!w0N zsCnC=TyIE*;a@^KWqWvhxwAa#OPB7gDz#zwQCn?JxvJv>Zps>yn8 zTzdM4D@WpQnybG=tJ=@anGEU9^?^^|EvGK*0T$4EobE-0C6_q{#PhrMQXC?y+V6`n<_f2w-I!Bo-zg9%pcsX7av2fnY9@nT}&z3w+hc~3ZdzFuRvse=82q9~y+%Zs{W zF8?ICITLu882mbvbbe@M#jUH9k)Txt!`tF7k1bQYPc9SmQRKbVXa*MLr%bc;z%0FWb6{YnZco zQgD*qU|vHLT|@WFjL`-MAw3E#Xu=Cv$2#v&ijLP0Mk0YNN!s@jO}sLN;dzwUQ-xvh zz2F_XxY!&yevDTYkpGcWZOl|Fk30>|8R*xED&vecgJG6!%Ha}T-k_2Zoj!HO89k6> zU!GU!aBUz~X%Xg+A0zw8qPS}-DmUgY@Q}nCR=2IlCk9QmuRVFC$ifyA*Dedn<-n1P zfER8TC84lh=msO(eZ<@!d_aCp)iFx_&t( z8gxwMRz8HbvUP3hkXc=iaBFT5wzW9H1W~1&1oBgwYQ1l?s90>xw-B_U13JtExLC*Y z5nZK|#Ok<{?dE@hPpnO_h_~iOcWGoeg870-5pC=C85w#7~ zQQTWxb_>KI%*fp)_Fq}U6;eu<--vWZoi&PM3-=+sm^$+_F;LY!t2^SX8Y~-){S>FB zuedWBm--a0>X_g(CIkkH`-hK_85rwM!Lgickv8~2i^%4(o=}?}(M`wV$$>@pcZ$pU zhL`2tstIg0JtN?j^@OCX5^)m!CWoIou{hyZ0$+f@8q5%&q{x&+L~oo>TomseDmv%U zsr5^F=7_tNCd6q&RApg%o6&6`J*~qZ@)Xel)C2$7tU3`dt)4YK-d|0TvcV zG9tra3|I{aRb7*`pZc?#WkT1gGA4(W1w+5g`n(?N;Y0MeBcxj=*G*&PT5ph-zn2g& zMq0cTX{Efb)pPZJ6yX-(2m`XV2sh~Q7Nin>MA$vpXTZA!GrTt<&5_Q)P}*t0+3zJ> z`FH!OUuNh%00qEDC4l(VmaL-Z04Qu`6+wJ35a5Fd-^|2oTwi3>ZJveaTb@(uJaqtl z8R+_42hn#IECFpTNbik2?iPI4TH~o2-oFS2jL>*E5Y=vYFTAL8Y{7S-_Ka)GiAw)) znT@GtfGjY_d%FQ}1313~n&aJbo+~b}K6|492KmO-hF}gb;EZ?t-8o~*Y)rR2&(iRU z5HQCtLjV4p&1GN_Cw}U`43o%)>mMn3=q|clTSU)f z;vAvhkhX6x!Br%x?RkX1EUapnof`Ke92Z%i7Y?AGE!fNw4Tk`*-o&oW#|ZNfgrFD{ z*ljcgf;tjQ&SOuy@Kk64W1BX#X%fo?-0w*%(0Q&0 zc>{RY)dR<4iV@@DTq^uRJ~&ID98@2^nV6rP^ODu$OYGL-!-^YVTO3i+flxcwpX660 z-h7KRM~rU2YBl_4fM1m}RBwShrNw9(bqY*x6qGB3)vE2M@`RzL>>eon220H;6SF6X zj^4k*_#Vw=PJJVPi0~`!0YUOn((pOpvG*d7`-~TV@elmhgrk%qj22Y;K$fM2)wKa6 z__A5{p)rp)07Bjgwa?(1jMf{-q|vhQBWxGUmQ&f^R&DPjF-ABX^+;rP8XY&3wlTHf zV69Eppu!z(dJJ>!z`ca1hS})Y#$Z{)A#03v{PVJ<`%n4~+fU56!2^@wvD+lX|rVkn3R603|)XK(V zjFFOSEu_kxW?{IcM_y%sdZM@>C=2~hVt&Xp-~0yk>rQo7XotJN3w2`i)Cl01y%eyS zQ@|@23$sZUjp1u94WVbaNEml4!QmyigQhJ_jTn8B^r@jIX=D+r#cBC;dW)02Gz`G* zvWYlTQcut2mf`#bw1E1@9}66}=YKzLQ}ud6vPdd}1pz;^4$lk$ci%T`%J@y$)|@iH z&HP900P?F_&g>gI2=0VKXcYD@^p5894QY4$;5T8gZ9+4mGjN&)!U=8pqo%@L71DVAkNAqKk7Y;)BR8Qq<0+8NZ zuC>n@sl66>Yqc)PEr>A)KOm7y; z*3bl#T~`k#om$|%3d21ack#gf9;h7 z5!>rzuNW(KaCjta!xk}jqLJetfTILPHhGg$bZRxNHZdM$>MRL^$P=_ZvKy$%<1a3``m1DooDscKP!1pJG)BWi2+6+MSsVjVPFKt14Wsk>`=^z-%Dd19-t9TG}6TWISl{=^p+Kpn5f?i#IV5GA@m!%UiyG$p+8s+pdP<4 zkOJUx^f`z|9(@*~Nghv!=qHr_MDm)9_#bevKY7WYyaf0#eLD)y2Tnkn2Y}K6OFbXF z0MX))_=#7@d*zmZ6zoS9wfuji1*#T8)@1`PpPIiMfcD<87&7mS1ueUR; zaXs>Fsie0J%TNhkUtgDBBP!~S8y<#JEgQqLgJd$4S!12}xLxg-bbl%j4+FV(kyuH> z(MGzp+ZKjO{E^-@G2f}6DJ8x?RTm_y_7lnIOnbtEkUNZ4k_j4=6sQnd%b>s-Zz{WD z122t61W86zi%s?Lp|6`tb6%wMu|3djNBR=gU55gs0ul<(qgkm84A^4XrW3Da0Bxzk ziYlYu=8${EWR4Hqsg0W*?NW+9>%V$m7NA2GNFuN<3GTv+*^bJ^YaFN2FO!1?a+j0|YWK=VAk!Cwqy^ zul4v_IY`o;=h2z)kaDarw5NHNl1z|$xbjOLmBxI@RqoHja=hyC3$#js&Jmt=%rhDQ zi1yagp|Zt6mFJ#*JczkZ8`&##wv{{6y#;^MVlIDFbLtzrSup#VUu=?=J3rfl%DrW2 zL~=Yp>`rs^(b1+u5E99~p25MxxMb>u8gY@JyGiQ0q)*dycw2hBE^ZlIS#Ou}D+09>^nL^`&hsvW)^-dYm z4sY!W3(OYpg<~SWulTBisNU_JS|H*lDpwm;P=R-nP?ERH5Jm7lgDsl+#BNu2Jb(wl zsH^TbWe`K{3l5+vOWRNBP}gc7h^l#(-HF`l^-+)MMa0u;_X+s?cVixE$a z%sT8k!`eh1%cjuN~g|kuF)r2DF>qMsm(Eao46aJ4wutQ1&%L$#<17&_Rv%&v6-~Cznlkj z1=JgWiQ`r55te*DZ4eDr6{oDGS8A(@z{HD+lD%Ggc<~z!d(22307-2UG*j0|?4R9C zwNVD_>UO&r@;cSDuW|0Hsc=L`$Tb@5DhH|sAZpC*^Ts-}<9$L8pT>QmEqk?j@u|Ly zYI9_4DjB6M=iY+~47#$$mD!>RZi8tm$Au738b*fMmE+VCVjj7BTIfOGHn^HK4mQY> zYm(w_SR7Ylr6fcE4LS??8k7_#AKw{;dtgr9oCSEuN7`lK%FWe2zGW8fD1PT*ntUmnMuOFeY zvNfT#vcwW9PHTS&a2w?1=|6%QK&A^6U6S|cGLb90v?;xB_#E)ltux`!c>P~Mb!|N0TCzRU={J(IL}<;oH5c+Sw!+R&}{2>npO pb`G)lEiJC_KSC*AL`9R?s5N;`bF@$e*jP!&j0`b literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1mcmc_1_1base__nuts-members.html b/doc/api/html/classstan_1_1mcmc_1_1base__nuts-members.html new file mode 100644 index 00000000000..90dc3bf3e67 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1base__nuts-members.html @@ -0,0 +1,156 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::base_nuts< M, P, H, I, BaseRNG > Member List
+
+
+ +

This is the complete list of members for stan::mcmc::base_nuts< M, P, H, I, BaseRNG >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_depthstan::mcmc::base_nuts< M, P, H, I, BaseRNG >
_epsilonstan::mcmc::base_hmc< M, P, H, I, BaseRNG >protected
_epsilon_jitterstan::mcmc::base_hmc< M, P, H, I, BaseRNG >protected
_err_streamstan::mcmc::base_mcmcprotected
_hamiltonianstan::mcmc::base_hmc< M, P, H, I, BaseRNG >protected
_integratorstan::mcmc::base_hmc< M, P, H, I, BaseRNG >protected
_max_deltastan::mcmc::base_nuts< M, P, H, I, BaseRNG >
_max_depthstan::mcmc::base_nuts< M, P, H, I, BaseRNG >
_n_divergentstan::mcmc::base_nuts< M, P, H, I, BaseRNG >
_namestan::mcmc::base_mcmcprotected
_nom_epsilonstan::mcmc::base_hmc< M, P, H, I, BaseRNG >protected
_out_streamstan::mcmc::base_mcmcprotected
_rand_intstan::mcmc::base_hmc< M, P, H, I, BaseRNG >protected
_rand_uniformstan::mcmc::base_hmc< M, P, H, I, BaseRNG >protected
_zstan::mcmc::base_hmc< M, P, H, I, BaseRNG >protected
base_hmc(M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inline
base_mcmc(std::ostream *o, std::ostream *e)stan::mcmc::base_mcmcinline
base_nuts(M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)stan::mcmc::base_nuts< M, P, H, I, BaseRNG >inline
build_tree(int depth, Eigen::VectorXd &rho, ps_point *z_init_parent, ps_point &z_propose, nuts_util &util)stan::mcmc::base_nuts< M, P, H, I, BaseRNG >inline
compute_criterion(ps_point &start, P &finish, Eigen::VectorXd &rho)=0stan::mcmc::base_nuts< M, P, H, I, BaseRNG >pure virtual
get_current_stepsize()stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inline
get_max_delta()stan::mcmc::base_nuts< M, P, H, I, BaseRNG >inline
get_max_depth()stan::mcmc::base_nuts< M, P, H, I, BaseRNG >inline
get_nominal_stepsize()stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inline
get_sampler_diagnostic_names(std::vector< std::string > &model_names, std::vector< std::string > &names)stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inlinevirtual
get_sampler_diagnostics(std::vector< double > &values)stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inlinevirtual
get_sampler_param_names(std::vector< std::string > &names)stan::mcmc::base_nuts< M, P, H, I, BaseRNG >inlinevirtual
get_sampler_params(std::vector< double > &values)stan::mcmc::base_nuts< M, P, H, I, BaseRNG >inlinevirtual
get_stepsize_jitter()stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inline
init_stepsize()stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inline
name()stan::mcmc::base_mcmcinline
sample_stepsize()stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inline
seed(const Eigen::VectorXd &q)stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inline
set_max_delta(const double d)stan::mcmc::base_nuts< M, P, H, I, BaseRNG >inline
set_max_depth(const int d)stan::mcmc::base_nuts< M, P, H, I, BaseRNG >inline
set_nominal_stepsize(const double e)stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inlinevirtual
set_stepsize_jitter(const double j)stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inlinevirtual
transition(sample &init_sample)stan::mcmc::base_nuts< M, P, H, I, BaseRNG >inlinevirtual
write_sampler_param_names(std::ostream &o)stan::mcmc::base_nuts< M, P, H, I, BaseRNG >inlinevirtual
write_sampler_params(std::ostream &o)stan::mcmc::base_nuts< M, P, H, I, BaseRNG >inlinevirtual
write_sampler_state(std::ostream *o)stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inlinevirtual
z()stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inline
~base_mcmc()stan::mcmc::base_mcmcinlinevirtual
~base_nuts()stan::mcmc::base_nuts< M, P, H, I, BaseRNG >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1base__nuts.html b/doc/api/html/classstan_1_1mcmc_1_1base__nuts.html new file mode 100644 index 00000000000..a336cbbdfef --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1base__nuts.html @@ -0,0 +1,733 @@ + + + + + +Stan: stan::mcmc::base_nuts< M, P, H, I, BaseRNG > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::base_nuts< M, P, H, I, BaseRNG > Class Template Referenceabstract
+
+
+ +

#include <base_nuts.hpp>

+
+Inheritance diagram for stan::mcmc::base_nuts< M, P, H, I, BaseRNG >:
+
+
+ + +stan::mcmc::base_hmc< M, P, H, I, BaseRNG > +stan::mcmc::base_mcmc + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 base_nuts (M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)
 
 ~base_nuts ()
 
void set_max_depth (const int d)
 
void set_max_delta (const double d)
 
int get_max_depth ()
 
double get_max_delta ()
 
sample transition (sample &init_sample)
 
void write_sampler_param_names (std::ostream &o)
 
void write_sampler_params (std::ostream &o)
 
void get_sampler_param_names (std::vector< std::string > &names)
 
void get_sampler_params (std::vector< double > &values)
 
virtual bool compute_criterion (ps_point &start, P &finish, Eigen::VectorXd &rho)=0
 
int build_tree (int depth, Eigen::VectorXd &rho, ps_point *z_init_parent, ps_point &z_propose, nuts_util &util)
 
- Public Member Functions inherited from stan::mcmc::base_hmc< M, P, H, I, BaseRNG >
 base_hmc (M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)
 
void write_sampler_state (std::ostream *o)
 
void get_sampler_diagnostic_names (std::vector< std::string > &model_names, std::vector< std::string > &names)
 
void get_sampler_diagnostics (std::vector< double > &values)
 
void seed (const Eigen::VectorXd &q)
 
void init_stepsize ()
 
P & z ()
 
virtual void set_nominal_stepsize (const double e)
 
double get_nominal_stepsize ()
 
double get_current_stepsize ()
 
virtual void set_stepsize_jitter (const double j)
 
double get_stepsize_jitter ()
 
void sample_stepsize ()
 
- Public Member Functions inherited from stan::mcmc::base_mcmc
 base_mcmc (std::ostream *o, std::ostream *e)
 
virtual ~base_mcmc ()
 
std::string name ()
 
+ + + + + + + + + +

+Public Attributes

int _depth
 
int _max_depth
 
double _max_delta
 
int _n_divergent
 
+ + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Protected Attributes inherited from stan::mcmc::base_hmc< M, P, H, I, BaseRNG >
_z
 
I< H< M, BaseRNG >, P > _integrator
 
H< M, BaseRNG > _hamiltonian
 
BaseRNG & _rand_int
 
boost::uniform_01< BaseRNG & > _rand_uniform
 
double _nom_epsilon
 
double _epsilon
 
double _epsilon_jitter
 
+

Detailed Description

+

template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+class stan::mcmc::base_nuts< M, P, H, I, BaseRNG >

+ + +

Definition at line 32 of file base_nuts.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::mcmc::base_nuts< M, P, H, I, BaseRNG >::base_nuts (M & m,
BaseRNG & rng,
std::ostream * o,
std::ostream * e 
)
+
+inline
+
+ +

Definition at line 37 of file base_nuts.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + +
stan::mcmc::base_nuts< M, P, H, I, BaseRNG >::~base_nuts ()
+
+inline
+
+ +

Definition at line 42 of file base_nuts.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
int stan::mcmc::base_nuts< M, P, H, I, BaseRNG >::build_tree (int depth,
Eigen::VectorXd & rho,
ps_pointz_init_parent,
ps_pointz_propose,
nuts_utilutil 
)
+
+inline
+
+ +

Definition at line 182 of file base_nuts.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
virtual bool stan::mcmc::base_nuts< M, P, H, I, BaseRNG >::compute_criterion (ps_pointstart,
P & finish,
Eigen::VectorXd & rho 
)
+
+pure virtual
+
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + +
double stan::mcmc::base_nuts< M, P, H, I, BaseRNG >::get_max_delta ()
+
+inline
+
+ +

Definition at line 54 of file base_nuts.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + +
int stan::mcmc::base_nuts< M, P, H, I, BaseRNG >::get_max_depth ()
+
+inline
+
+ +

Definition at line 53 of file base_nuts.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + + +
void stan::mcmc::base_nuts< M, P, H, I, BaseRNG >::get_sampler_param_names (std::vector< std::string > & names)
+
+inlinevirtual
+
+ +

Reimplemented from stan::mcmc::base_mcmc.

+ +

Definition at line 167 of file base_nuts.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + + +
void stan::mcmc::base_nuts< M, P, H, I, BaseRNG >::get_sampler_params (std::vector< double > & values)
+
+inlinevirtual
+
+ +

Reimplemented from stan::mcmc::base_mcmc.

+ +

Definition at line 173 of file base_nuts.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + + +
void stan::mcmc::base_nuts< M, P, H, I, BaseRNG >::set_max_delta (const double d)
+
+inline
+
+ +

Definition at line 49 of file base_nuts.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + + +
void stan::mcmc::base_nuts< M, P, H, I, BaseRNG >::set_max_depth (const int d)
+
+inline
+
+ +

Definition at line 44 of file base_nuts.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + + +
sample stan::mcmc::base_nuts< M, P, H, I, BaseRNG >::transition (sampleinit_sample)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_mcmc.

+ +

Definition at line 56 of file base_nuts.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + + +
void stan::mcmc::base_nuts< M, P, H, I, BaseRNG >::write_sampler_param_names (std::ostream & o)
+
+inlinevirtual
+
+ +

Reimplemented from stan::mcmc::base_mcmc.

+ +

Definition at line 159 of file base_nuts.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + + +
void stan::mcmc::base_nuts< M, P, H, I, BaseRNG >::write_sampler_params (std::ostream & o)
+
+inlinevirtual
+
+ +

Reimplemented from stan::mcmc::base_mcmc.

+ +

Definition at line 163 of file base_nuts.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + +
int stan::mcmc::base_nuts< M, P, H, I, BaseRNG >::_depth
+
+ +

Definition at line 248 of file base_nuts.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + +
double stan::mcmc::base_nuts< M, P, H, I, BaseRNG >::_max_delta
+
+ +

Definition at line 250 of file base_nuts.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + +
int stan::mcmc::base_nuts< M, P, H, I, BaseRNG >::_max_depth
+
+ +

Definition at line 249 of file base_nuts.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + +
int stan::mcmc::base_nuts< M, P, H, I, BaseRNG >::_n_divergent
+
+ +

Definition at line 252 of file base_nuts.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1base__nuts.png b/doc/api/html/classstan_1_1mcmc_1_1base__nuts.png new file mode 100644 index 0000000000000000000000000000000000000000..7e85e2dfa40bee98bc647498e68d2ba6d9175db5 GIT binary patch literal 1380 zcmb`HZA?>F7{@On;uty|Y)}K#XelBlh?fdBP!z#hC|Zk&<0XnZZc{6i7l8?(kP$kn zq)1D&1q-Vd#DO(HD+DayN~+?e%~}SdP%7a?kd`S_YDS^Ej+kZh+p?3KbDnda=gay3 z{?Fl1P7t@a>~H}9U<>JZ6cqp*P)J<1*%4W%N|<@b=1C!+j<(zFNH}YHms9cc4J7(& z_V)HVamLWdaq|`GiFg1h`Y?X&KYaiIHZGB(j-39^!7Li(j^ej%ydIZgxAQB8JKt(s zMRH!Kvx4H=5G-N)X1$MjAZI5synl?L-jHwwl^7y?oVOdoJl_uTrrvLXu3=WI+VQd4 z)V^}eAt^3C-7R1xqMbf&ADyuk7I6~Mx#sYn6vH@HsuwB0B6eV(zmzk+Dzh%|7krk@ z;_KJAO$o6YRiz}LLl0LP1dNbVIs$vvSpYu{=3*32-*wT2&sy)X(jioecSf4+1*9@q zE`mf2z27bo-dEqQ_NNx$PHE=h*vaGC0vp#LtBtd^Hr{!w*SH%A+`ICfCuzFLOw62% zbUcn{vA;A1Wj|EjlDd%aevD&0ub|zee?O~3cwat5VLS*2&`OWPfM*#BP!69N1mHf` z;t4GF5`ew1sn;zK;0hcvkgMGg;1%Tf5~(7>Kq!*h4*u7a=0H5-fp{pn~pweaU?_R?k?{6t6Zo7-)2)#XsW1c zyv~zh>{&JC>Atqs3eD4_ztbRWT|56YYH?GqIqCfK}y%!qkCe zNad@I0HGP&z618P?>WFA$XsmT!zajO}RKiNA6St%# zqDG=kUbuW9S05NGK$Yg^s4!aLA@$QA?mfa3dipV@P3k#^eWV_^E(omiSaPG>Ot|xow3VUSGviJQnwig)xqWa@N8?hFT}1eQ^)+!L)@Zsf^yj zStXojGK^#8qy-=OX9w5Yt+Oo67OpgY`w_Hy9kf4sxG=_`><+&o&PX13q1m;=Ever_ zkjV)P0;TM^)X6F~of0Y~++`I%FDH#)g9XCZ@S-(RgmR<5CSPnWEV6T!lNe(K(4$+- z9<(6Ani27=<&4HfJKseoPyGfP3i4axooa6yH1L)BqHmh{LZ#*%Vxv{?B6Jo^Kbj9Z z>6 + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG > Member List
+
+
+ +

This is the complete list of members for stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_epsilonstan::mcmc::base_hmc< M, P, H, I, BaseRNG >protected
_epsilon_jitterstan::mcmc::base_hmc< M, P, H, I, BaseRNG >protected
_err_streamstan::mcmc::base_mcmcprotected
_hamiltonianstan::mcmc::base_hmc< M, P, H, I, BaseRNG >protected
_integratorstan::mcmc::base_hmc< M, P, H, I, BaseRNG >protected
_namestan::mcmc::base_mcmcprotected
_nom_epsilonstan::mcmc::base_hmc< M, P, H, I, BaseRNG >protected
_out_streamstan::mcmc::base_mcmcprotected
_rand_intstan::mcmc::base_hmc< M, P, H, I, BaseRNG >protected
_rand_uniformstan::mcmc::base_hmc< M, P, H, I, BaseRNG >protected
_update_L()stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >inlineprotected
_zstan::mcmc::base_hmc< M, P, H, I, BaseRNG >protected
base_hmc(M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inline
base_mcmc(std::ostream *o, std::ostream *e)stan::mcmc::base_mcmcinline
base_static_hmc(M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >inline
get_current_stepsize()stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inline
get_L()stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >inline
get_nominal_stepsize()stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inline
get_sampler_diagnostic_names(std::vector< std::string > &model_names, std::vector< std::string > &names)stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inlinevirtual
get_sampler_diagnostics(std::vector< double > &values)stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inlinevirtual
get_sampler_param_names(std::vector< std::string > &names)stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >inlinevirtual
get_sampler_params(std::vector< double > &values)stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >inlinevirtual
get_stepsize_jitter()stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inline
get_T()stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >inline
init_stepsize()stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inline
L_stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >protected
name()stan::mcmc::base_mcmcinline
sample_stepsize()stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inline
seed(const Eigen::VectorXd &q)stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inline
set_nominal_stepsize(const double e)stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >inlinevirtual
set_nominal_stepsize_and_L(const double e, const int l)stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >inline
set_nominal_stepsize_and_T(const double e, const double t)stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >inline
set_stepsize_jitter(const double j)stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inlinevirtual
set_T(const double t)stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >inline
T_stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >protected
transition(sample &init_sample)stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >inlinevirtual
write_sampler_param_names(std::ostream &o)stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >inlinevirtual
write_sampler_params(std::ostream &o)stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >inlinevirtual
write_sampler_state(std::ostream *o)stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inlinevirtual
z()stan::mcmc::base_hmc< M, P, H, I, BaseRNG >inline
~base_mcmc()stan::mcmc::base_mcmcinlinevirtual
~base_static_hmc()stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1base__static__hmc.html b/doc/api/html/classstan_1_1mcmc_1_1base__static__hmc.html new file mode 100644 index 00000000000..675c0c77bfd --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1base__static__hmc.html @@ -0,0 +1,726 @@ + + + + + +Stan: stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG > Class Template Reference
+
+
+ +

#include <base_static_hmc.hpp>

+
+Inheritance diagram for stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >:
+
+
+ + +stan::mcmc::base_hmc< M, P, H, I, BaseRNG > +stan::mcmc::base_mcmc + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 base_static_hmc (M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)
 
 ~base_static_hmc ()
 
sample transition (sample &init_sample)
 
void write_sampler_param_names (std::ostream &o)
 
void write_sampler_params (std::ostream &o)
 
void get_sampler_param_names (std::vector< std::string > &names)
 
void get_sampler_params (std::vector< double > &values)
 
void set_nominal_stepsize_and_T (const double e, const double t)
 
void set_nominal_stepsize_and_L (const double e, const int l)
 
void set_T (const double t)
 
void set_nominal_stepsize (const double e)
 
double get_T ()
 
int get_L ()
 
- Public Member Functions inherited from stan::mcmc::base_hmc< M, P, H, I, BaseRNG >
 base_hmc (M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)
 
void write_sampler_state (std::ostream *o)
 
void get_sampler_diagnostic_names (std::vector< std::string > &model_names, std::vector< std::string > &names)
 
void get_sampler_diagnostics (std::vector< double > &values)
 
void seed (const Eigen::VectorXd &q)
 
void init_stepsize ()
 
P & z ()
 
double get_nominal_stepsize ()
 
double get_current_stepsize ()
 
virtual void set_stepsize_jitter (const double j)
 
double get_stepsize_jitter ()
 
void sample_stepsize ()
 
- Public Member Functions inherited from stan::mcmc::base_mcmc
 base_mcmc (std::ostream *o, std::ostream *e)
 
virtual ~base_mcmc ()
 
std::string name ()
 
+ + + +

+Protected Member Functions

void _update_L ()
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Protected Attributes

double T_
 
int L_
 
- Protected Attributes inherited from stan::mcmc::base_hmc< M, P, H, I, BaseRNG >
_z
 
I< H< M, BaseRNG >, P > _integrator
 
H< M, BaseRNG > _hamiltonian
 
BaseRNG & _rand_int
 
boost::uniform_01< BaseRNG & > _rand_uniform
 
double _nom_epsilon
 
double _epsilon
 
double _epsilon_jitter
 
- Protected Attributes inherited from stan::mcmc::base_mcmc
std::string _name
 
std::ostream * _out_stream
 
std::ostream * _err_stream
 
+

Detailed Description

+

template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+class stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >

+ + +

Definition at line 18 of file base_static_hmc.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >::base_static_hmc (M & m,
BaseRNG & rng,
std::ostream * o,
std::ostream * e 
)
+
+inline
+
+ +

Definition at line 22 of file base_static_hmc.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + +
stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >::~base_static_hmc ()
+
+inline
+
+ +

Definition at line 26 of file base_static_hmc.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + +
void stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >::_update_L ()
+
+inlineprotected
+
+ +

Definition at line 111 of file base_static_hmc.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + +
int stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >::get_L ()
+
+inline
+
+ +

Definition at line 104 of file base_static_hmc.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + + +
void stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >::get_sampler_param_names (std::vector< std::string > & names)
+
+inlinevirtual
+
+ +

Reimplemented from stan::mcmc::base_mcmc.

+ +

Definition at line 68 of file base_static_hmc.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + + +
void stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >::get_sampler_params (std::vector< double > & values)
+
+inlinevirtual
+
+ +

Reimplemented from stan::mcmc::base_mcmc.

+ +

Definition at line 73 of file base_static_hmc.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + +
double stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >::get_T ()
+
+inline
+
+ +

Definition at line 103 of file base_static_hmc.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + + +
void stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >::set_nominal_stepsize (const double e)
+
+inlinevirtual
+
+ +

Reimplemented from stan::mcmc::base_hmc< M, P, H, I, BaseRNG >.

+ +

Definition at line 97 of file base_static_hmc.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >::set_nominal_stepsize_and_L (const double e,
const int l 
)
+
+inline
+
+ +

Definition at line 84 of file base_static_hmc.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >::set_nominal_stepsize_and_T (const double e,
const double t 
)
+
+inline
+
+ +

Definition at line 78 of file base_static_hmc.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + + +
void stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >::set_T (const double t)
+
+inline
+
+ +

Definition at line 90 of file base_static_hmc.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + + +
sample stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >::transition (sampleinit_sample)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_mcmc.

+ +

Definition at line 28 of file base_static_hmc.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + + +
void stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >::write_sampler_param_names (std::ostream & o)
+
+inlinevirtual
+
+ +

Reimplemented from stan::mcmc::base_mcmc.

+ +

Definition at line 60 of file base_static_hmc.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + + + + + +
void stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >::write_sampler_params (std::ostream & o)
+
+inlinevirtual
+
+ +

Reimplemented from stan::mcmc::base_mcmc.

+ +

Definition at line 64 of file base_static_hmc.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + +
int stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >::L_
+
+protected
+
+ +

Definition at line 109 of file base_static_hmc.hpp.

+ +
+
+ +
+
+
+template<class M, class P, template< class, class > class H, template< class, class > class I, class BaseRNG>
+ + + + + +
+ + + + +
double stan::mcmc::base_static_hmc< M, P, H, I, BaseRNG >::T_
+
+protected
+
+ +

Definition at line 108 of file base_static_hmc.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1base__static__hmc.png b/doc/api/html/classstan_1_1mcmc_1_1base__static__hmc.png new file mode 100644 index 0000000000000000000000000000000000000000..087f3ba7d1e956922c9cb4da77ae5136e5cdca17 GIT binary patch literal 1453 zcmbu9Yfw{16vuC*BtiiZ>y%b`Obum}AyyO-LPQkA7(t{FuwVqMRS6A*m`TH}Kt&6p zQ4BAOf-jyy2$IBr;UW(Q1vC^jCcNUKK!`~Q1-%hsNH3js#?#%A~ch326_Wb_4 zr^3TRY^^`H1^~d8xGg9G08j)(XD_rs)@$AmhLO!NdFN3u00n~f6ms{ zR?AaEF354=(TK3G0VHXD$hyg10AT4)3<@OwfYO!3q-b32EiZ1_4c{5jjCYY5eoSq)2b@di7cTXl0zl~JWE_vgM&Nc&EO^Je*V7d)ZF)Gikrydoi8&?&Xsr& z%^vCfN-|#Ad>gC25RDY<0Ast{{(UJLoFetT@2k3pdK=dQEC4d=F>zCGmd*nH?amop zp_Flp`h_5{@r7Nhn-9fT#~4ETN9?);p8Rc)+X#M>-w$Mojdxc6~$G^-UcW3p=X zUZ(*(TQ-|0y~A!^r(X*`o2lT}r(N2=K-@WZ6|M8+HAi{#vgro-;4+&70&y`I2VGKJ zT;i!NJSW)qSXh(Al&G(jnO312x2_u|#b|_-xTJNtcsR^3*#sT4*9mLZ{Dq3ImaL=} zvgd(}UH(`_!RNjl^0-l`4}e)os=B69f!HqDWG;mwJ6dj@JKLkdi=FPT?|cOu86iE& znCA6)(t9bp9~E=x2X)W`CffvGbOgTU4_Z_;?oaw9s9NOE{EtY-TpS$x~7kE0iZFeBeGh`ViU;IpKxfu!bC`>dP#Nh`};%k!O8F4%w!N7*yyBIIuch{0h&b(`ak{{i*U B+s6O^ literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1mcmc_1_1chains-members.html b/doc/api/html/classstan_1_1mcmc_1_1chains-members.html new file mode 100644 index 00000000000..32ce1bfb761 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1chains-members.html @@ -0,0 +1,174 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::chains< RNG > Member List
+
+
+ +

This is the complete list of members for stan::mcmc::chains< RNG >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
add(const int chain, const Eigen::MatrixXd &sample)stan::mcmc::chains< RNG >inline
add(const Eigen::MatrixXd &sample)stan::mcmc::chains< RNG >inline
add(const stan::io::stan_csv &stan_csv)stan::mcmc::chains< RNG >inline
autocorrelation(const int chain, const int index)stan::mcmc::chains< RNG >inline
autocorrelation(const int chain, const std::string &name)stan::mcmc::chains< RNG >inline
autocovariance(const int chain, const int index)stan::mcmc::chains< RNG >inline
autocovariance(const int chain, const std::string &name)stan::mcmc::chains< RNG >inline
central_interval(const int chain, const int index, const double prob)stan::mcmc::chains< RNG >inline
central_interval(const int index, const double prob)stan::mcmc::chains< RNG >inline
central_interval(const int chain, const std::string &name, const double prob)stan::mcmc::chains< RNG >inline
central_interval(const std::string &name, const double prob)stan::mcmc::chains< RNG >inline
chains(const Eigen::Matrix< std::string, Eigen::Dynamic, 1 > &param_names)stan::mcmc::chains< RNG >inline
chains(const stan::io::stan_csv &stan_csv)stan::mcmc::chains< RNG >inline
correlation(const int chain, const int index1, const int index2)stan::mcmc::chains< RNG >inline
correlation(const int index1, const int index2)stan::mcmc::chains< RNG >inline
correlation(const int chain, const std::string &name1, const std::string &name2)stan::mcmc::chains< RNG >inline
correlation(const std::string &name1, const std::string &name2)stan::mcmc::chains< RNG >inline
covariance(const int chain, const int index1, const int index2)stan::mcmc::chains< RNG >inline
covariance(const int index1, const int index2)stan::mcmc::chains< RNG >inline
covariance(const int chain, const std::string &name1, const std::string &name2)stan::mcmc::chains< RNG >inline
covariance(const std::string &name1, const std::string &name2)stan::mcmc::chains< RNG >inline
effective_sample_size(const int index)stan::mcmc::chains< RNG >inline
effective_sample_size(const std::string &name)stan::mcmc::chains< RNG >inline
index(const std::string &name)stan::mcmc::chains< RNG >inline
mean(const int chain, const int index)stan::mcmc::chains< RNG >inline
mean(const int index)stan::mcmc::chains< RNG >inline
mean(const int chain, const std::string &name)stan::mcmc::chains< RNG >inline
mean(const std::string &name)stan::mcmc::chains< RNG >inline
num_chains()stan::mcmc::chains< RNG >inline
num_kept_samples(const int chain)stan::mcmc::chains< RNG >inline
num_kept_samples()stan::mcmc::chains< RNG >inline
num_params()stan::mcmc::chains< RNG >inline
num_samples(const int chain)stan::mcmc::chains< RNG >inline
num_samples()stan::mcmc::chains< RNG >inline
param_name(int j)stan::mcmc::chains< RNG >inline
param_names()stan::mcmc::chains< RNG >inline
quantile(const int chain, const int index, const double prob)stan::mcmc::chains< RNG >inline
quantile(const int index, const double prob)stan::mcmc::chains< RNG >inline
quantile(const int chain, const std::string &name, const double prob)stan::mcmc::chains< RNG >inline
quantile(const std::string &name, const double prob)stan::mcmc::chains< RNG >inline
quantiles(const int chain, const int index, const Eigen::VectorXd &probs)stan::mcmc::chains< RNG >inline
quantiles(const int index, const Eigen::VectorXd &probs)stan::mcmc::chains< RNG >inline
quantiles(const int chain, const std::string &name, const Eigen::VectorXd &probs)stan::mcmc::chains< RNG >inline
quantiles(const std::string &name, const Eigen::VectorXd &probs)stan::mcmc::chains< RNG >inline
samples(const int chain, const int index)stan::mcmc::chains< RNG >inline
samples(const int index)stan::mcmc::chains< RNG >inline
samples(const int chain, const std::string &name)stan::mcmc::chains< RNG >inline
samples(const std::string &name)stan::mcmc::chains< RNG >inline
sd(const int chain, const int index)stan::mcmc::chains< RNG >inline
sd(const int index)stan::mcmc::chains< RNG >inline
sd(const int chain, const std::string &name)stan::mcmc::chains< RNG >inline
sd(const std::string &name)stan::mcmc::chains< RNG >inline
set_warmup(const int chain, const int warmup)stan::mcmc::chains< RNG >inline
set_warmup(const int warmup)stan::mcmc::chains< RNG >inline
split_potential_scale_reduction(const int index)stan::mcmc::chains< RNG >inline
split_potential_scale_reduction(const std::string &name)stan::mcmc::chains< RNG >inline
variance(const int chain, const int index)stan::mcmc::chains< RNG >inline
variance(const int index)stan::mcmc::chains< RNG >inline
variance(const int chain, const std::string &name)stan::mcmc::chains< RNG >inline
variance(const std::string &name)stan::mcmc::chains< RNG >inline
warmup()stan::mcmc::chains< RNG >inline
warmup(const int chain)stan::mcmc::chains< RNG >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1chains.html b/doc/api/html/classstan_1_1mcmc_1_1chains.html new file mode 100644 index 00000000000..6d3f25af321 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1chains.html @@ -0,0 +1,2390 @@ + + + + + +Stan: stan::mcmc::chains< RNG > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::chains< RNG > Class Template Reference
+
+
+ +

An mcmc::chains object stores parameter names and dimensionalities along with samples from multiple chains. + More...

+ +

#include <chains.hpp>

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 chains (const Eigen::Matrix< std::string, Eigen::Dynamic, 1 > &param_names)
 
 chains (const stan::io::stan_csv &stan_csv)
 
const int num_chains ()
 
const int num_params ()
 
const Eigen::Matrix
+< std::string, Eigen::Dynamic, 1 > & 
param_names ()
 
const std::string & param_name (int j)
 
const int index (const std::string &name)
 
void set_warmup (const int chain, const int warmup)
 
void set_warmup (const int warmup)
 
const Eigen::VectorXi & warmup ()
 
const int warmup (const int chain)
 
const int num_samples (const int chain)
 
const int num_samples ()
 
const int num_kept_samples (const int chain)
 
const int num_kept_samples ()
 
void add (const int chain, const Eigen::MatrixXd &sample)
 
void add (const Eigen::MatrixXd &sample)
 
void add (const stan::io::stan_csv &stan_csv)
 
Eigen::VectorXd samples (const int chain, const int index)
 
Eigen::VectorXd samples (const int index)
 
Eigen::VectorXd samples (const int chain, const std::string &name)
 
Eigen::VectorXd samples (const std::string &name)
 
double mean (const int chain, const int index)
 
double mean (const int index)
 
double mean (const int chain, const std::string &name)
 
double mean (const std::string &name)
 
double sd (const int chain, const int index)
 
double sd (const int index)
 
double sd (const int chain, const std::string &name)
 
double sd (const std::string &name)
 
double variance (const int chain, const int index)
 
double variance (const int index)
 
double variance (const int chain, const std::string &name)
 
double variance (const std::string &name)
 
double covariance (const int chain, const int index1, const int index2)
 
double covariance (const int index1, const int index2)
 
double covariance (const int chain, const std::string &name1, const std::string &name2)
 
double covariance (const std::string &name1, const std::string &name2)
 
double correlation (const int chain, const int index1, const int index2)
 
double correlation (const int index1, const int index2)
 
double correlation (const int chain, const std::string &name1, const std::string &name2)
 
double correlation (const std::string &name1, const std::string &name2)
 
double quantile (const int chain, const int index, const double prob)
 
double quantile (const int index, const double prob)
 
double quantile (const int chain, const std::string &name, const double prob)
 
double quantile (const std::string &name, const double prob)
 
Eigen::VectorXd quantiles (const int chain, const int index, const Eigen::VectorXd &probs)
 
Eigen::VectorXd quantiles (const int index, const Eigen::VectorXd &probs)
 
Eigen::VectorXd quantiles (const int chain, const std::string &name, const Eigen::VectorXd &probs)
 
Eigen::VectorXd quantiles (const std::string &name, const Eigen::VectorXd &probs)
 
Eigen::Vector2d central_interval (const int chain, const int index, const double prob)
 
Eigen::Vector2d central_interval (const int index, const double prob)
 
Eigen::Vector2d central_interval (const int chain, const std::string &name, const double prob)
 
Eigen::Vector2d central_interval (const std::string &name, const double prob)
 
Eigen::VectorXd autocorrelation (const int chain, const int index)
 
Eigen::VectorXd autocorrelation (const int chain, const std::string &name)
 
Eigen::VectorXd autocovariance (const int chain, const int index)
 
Eigen::VectorXd autocovariance (const int chain, const std::string &name)
 
double effective_sample_size (const int index)
 
double effective_sample_size (const std::string &name)
 
double split_potential_scale_reduction (const int index)
 
double split_potential_scale_reduction (const std::string &name)
 
+

Detailed Description

+

template<typename RNG = boost::random::ecuyer1988>
+class stan::mcmc::chains< RNG >

+ +

An mcmc::chains object stores parameter names and dimensionalities along with samples from multiple chains.

+

Synchronization: For arbitrary concurrent use, the read and write methods need to be read/write locked. Multiple writers can be used concurrently if they write to different chains. Readers for single chains need only be read/write locked with writers of that chain. For reading across chains, full read/write locking is required. Thus methods will be classified as global or single-chain read or write methods.

+

Storage Order: Storage is column/last-index major.

+ +

Definition at line 55 of file chains.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + +
stan::mcmc::chains< RNG >::chains (const Eigen::Matrix< std::string, Eigen::Dynamic, 1 > & param_names)
+
+inline
+
+ +

Definition at line 307 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + +
stan::mcmc::chains< RNG >::chains (const stan::io::stan_csvstan_csv)
+
+inline
+
+ +

Definition at line 310 of file chains.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::mcmc::chains< RNG >::add (const int chain,
const Eigen::MatrixXd & sample 
)
+
+inline
+
+ +

Definition at line 378 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + +
void stan::mcmc::chains< RNG >::add (const Eigen::MatrixXd & sample)
+
+inline
+
+ +

Definition at line 410 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + +
void stan::mcmc::chains< RNG >::add (const stan::io::stan_csvstan_csv)
+
+inline
+
+ +

Definition at line 418 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::VectorXd stan::mcmc::chains< RNG >::autocorrelation (const int chain,
const int index 
)
+
+inline
+
+ +

Definition at line 592 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::VectorXd stan::mcmc::chains< RNG >::autocorrelation (const int chain,
const std::string & name 
)
+
+inline
+
+ +

Definition at line 596 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::VectorXd stan::mcmc::chains< RNG >::autocovariance (const int chain,
const int index 
)
+
+inline
+
+ +

Definition at line 600 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::VectorXd stan::mcmc::chains< RNG >::autocovariance (const int chain,
const std::string & name 
)
+
+inline
+
+ +

Definition at line 604 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
Eigen::Vector2d stan::mcmc::chains< RNG >::central_interval (const int chain,
const int index,
const double prob 
)
+
+inline
+
+ +

Definition at line 565 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Vector2d stan::mcmc::chains< RNG >::central_interval (const int index,
const double prob 
)
+
+inline
+
+ +

Definition at line 574 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
Eigen::Vector2d stan::mcmc::chains< RNG >::central_interval (const int chain,
const std::string & name,
const double prob 
)
+
+inline
+
+ +

Definition at line 583 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Vector2d stan::mcmc::chains< RNG >::central_interval (const std::string & name,
const double prob 
)
+
+inline
+
+ +

Definition at line 588 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
double stan::mcmc::chains< RNG >::correlation (const int chain,
const int index1,
const int index2 
)
+
+inline
+
+ +

Definition at line 516 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
double stan::mcmc::chains< RNG >::correlation (const int index1,
const int index2 
)
+
+inline
+
+ +

Definition at line 520 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
double stan::mcmc::chains< RNG >::correlation (const int chain,
const std::string & name1,
const std::string & name2 
)
+
+inline
+
+ +

Definition at line 524 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
double stan::mcmc::chains< RNG >::correlation (const std::string & name1,
const std::string & name2 
)
+
+inline
+
+ +

Definition at line 528 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
double stan::mcmc::chains< RNG >::covariance (const int chain,
const int index1,
const int index2 
)
+
+inline
+
+ +

Definition at line 500 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
double stan::mcmc::chains< RNG >::covariance (const int index1,
const int index2 
)
+
+inline
+
+ +

Definition at line 504 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
double stan::mcmc::chains< RNG >::covariance (const int chain,
const std::string & name1,
const std::string & name2 
)
+
+inline
+
+ +

Definition at line 508 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
double stan::mcmc::chains< RNG >::covariance (const std::string & name1,
const std::string & name2 
)
+
+inline
+
+ +

Definition at line 512 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + +
double stan::mcmc::chains< RNG >::effective_sample_size (const int index)
+
+inline
+
+ +

Definition at line 609 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + +
double stan::mcmc::chains< RNG >::effective_sample_size (const std::string & name)
+
+inline
+
+ +

Definition at line 617 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + +
const int stan::mcmc::chains< RNG >::index (const std::string & name)
+
+inline
+
+ +

Definition at line 332 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
double stan::mcmc::chains< RNG >::mean (const int chain,
const int index 
)
+
+inline
+
+ +

Definition at line 452 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + +
double stan::mcmc::chains< RNG >::mean (const int index)
+
+inline
+
+ +

Definition at line 456 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
double stan::mcmc::chains< RNG >::mean (const int chain,
const std::string & name 
)
+
+inline
+
+ +

Definition at line 460 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + +
double stan::mcmc::chains< RNG >::mean (const std::string & name)
+
+inline
+
+ +

Definition at line 464 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + +
const int stan::mcmc::chains< RNG >::num_chains ()
+
+inline
+
+ +

Definition at line 316 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + +
const int stan::mcmc::chains< RNG >::num_kept_samples (const int chain)
+
+inline
+
+ +

Definition at line 367 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + +
const int stan::mcmc::chains< RNG >::num_kept_samples ()
+
+inline
+
+ +

Definition at line 371 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + +
const int stan::mcmc::chains< RNG >::num_params ()
+
+inline
+
+ +

Definition at line 320 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + +
const int stan::mcmc::chains< RNG >::num_samples (const int chain)
+
+inline
+
+ +

Definition at line 356 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + +
const int stan::mcmc::chains< RNG >::num_samples ()
+
+inline
+
+ +

Definition at line 360 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + +
const std::string& stan::mcmc::chains< RNG >::param_name (int j)
+
+inline
+
+ +

Definition at line 328 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + +
const Eigen::Matrix<std::string, Eigen::Dynamic, 1>& stan::mcmc::chains< RNG >::param_names ()
+
+inline
+
+ +

Definition at line 324 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
double stan::mcmc::chains< RNG >::quantile (const int chain,
const int index,
const double prob 
)
+
+inline
+
+ +

Definition at line 532 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
double stan::mcmc::chains< RNG >::quantile (const int index,
const double prob 
)
+
+inline
+
+ +

Definition at line 536 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
double stan::mcmc::chains< RNG >::quantile (const int chain,
const std::string & name,
const double prob 
)
+
+inline
+
+ +

Definition at line 540 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
double stan::mcmc::chains< RNG >::quantile (const std::string & name,
const double prob 
)
+
+inline
+
+ +

Definition at line 544 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
Eigen::VectorXd stan::mcmc::chains< RNG >::quantiles (const int chain,
const int index,
const Eigen::VectorXd & probs 
)
+
+inline
+
+ +

Definition at line 548 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::VectorXd stan::mcmc::chains< RNG >::quantiles (const int index,
const Eigen::VectorXd & probs 
)
+
+inline
+
+ +

Definition at line 552 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
Eigen::VectorXd stan::mcmc::chains< RNG >::quantiles (const int chain,
const std::string & name,
const Eigen::VectorXd & probs 
)
+
+inline
+
+ +

Definition at line 556 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::VectorXd stan::mcmc::chains< RNG >::quantiles (const std::string & name,
const Eigen::VectorXd & probs 
)
+
+inline
+
+ +

Definition at line 561 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::VectorXd stan::mcmc::chains< RNG >::samples (const int chain,
const int index 
)
+
+inline
+
+ +

Definition at line 429 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + +
Eigen::VectorXd stan::mcmc::chains< RNG >::samples (const int index)
+
+inline
+
+ +

Definition at line 433 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::VectorXd stan::mcmc::chains< RNG >::samples (const int chain,
const std::string & name 
)
+
+inline
+
+ +

Definition at line 444 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + +
Eigen::VectorXd stan::mcmc::chains< RNG >::samples (const std::string & name)
+
+inline
+
+ +

Definition at line 448 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
double stan::mcmc::chains< RNG >::sd (const int chain,
const int index 
)
+
+inline
+
+ +

Definition at line 468 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + +
double stan::mcmc::chains< RNG >::sd (const int index)
+
+inline
+
+ +

Definition at line 472 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
double stan::mcmc::chains< RNG >::sd (const int chain,
const std::string & name 
)
+
+inline
+
+ +

Definition at line 476 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + +
double stan::mcmc::chains< RNG >::sd (const std::string & name)
+
+inline
+
+ +

Definition at line 480 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::mcmc::chains< RNG >::set_warmup (const int chain,
const int warmup 
)
+
+inline
+
+ +

Definition at line 340 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + +
void stan::mcmc::chains< RNG >::set_warmup (const int warmup)
+
+inline
+
+ +

Definition at line 344 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + +
double stan::mcmc::chains< RNG >::split_potential_scale_reduction (const int index)
+
+inline
+
+ +

Definition at line 621 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + +
double stan::mcmc::chains< RNG >::split_potential_scale_reduction (const std::string & name)
+
+inline
+
+ +

Definition at line 629 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
double stan::mcmc::chains< RNG >::variance (const int chain,
const int index 
)
+
+inline
+
+ +

Definition at line 484 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + +
double stan::mcmc::chains< RNG >::variance (const int index)
+
+inline
+
+ +

Definition at line 488 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
double stan::mcmc::chains< RNG >::variance (const int chain,
const std::string & name 
)
+
+inline
+
+ +

Definition at line 492 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + +
double stan::mcmc::chains< RNG >::variance (const std::string & name)
+
+inline
+
+ +

Definition at line 496 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + +
const Eigen::VectorXi& stan::mcmc::chains< RNG >::warmup ()
+
+inline
+
+ +

Definition at line 348 of file chains.hpp.

+ +
+
+ +
+
+
+template<typename RNG = boost::random::ecuyer1988>
+ + + + + +
+ + + + + + + + +
const int stan::mcmc::chains< RNG >::warmup (const int chain)
+
+inline
+
+ +

Definition at line 352 of file chains.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1covar__adaptation-members.html b/doc/api/html/classstan_1_1mcmc_1_1covar__adaptation-members.html new file mode 100644 index 00000000000..cd23326fc13 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1covar__adaptation-members.html @@ -0,0 +1,129 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::covar_adaptation Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1covar__adaptation.html b/doc/api/html/classstan_1_1mcmc_1_1covar__adaptation.html new file mode 100644 index 00000000000..f17a816cb37 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1covar__adaptation.html @@ -0,0 +1,261 @@ + + + + + +Stan: stan::mcmc::covar_adaptation Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::covar_adaptation Class Reference
+
+
+ +

#include <covar_adaptation.hpp>

+
+Inheritance diagram for stan::mcmc::covar_adaptation:
+
+
+ + +stan::mcmc::windowed_adaptation +stan::mcmc::base_adaptation + +
+ + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 covar_adaptation (int n)
 
bool learn_covariance (Eigen::MatrixXd &covar, const Eigen::VectorXd &q)
 
- Public Member Functions inherited from stan::mcmc::windowed_adaptation
 windowed_adaptation (std::string name)
 
void restart ()
 
void set_window_params (unsigned int num_warmup, unsigned int init_buffer, unsigned int term_buffer, unsigned int base_window, std::ostream *e=0)
 
bool adaptation_window ()
 
bool end_adaptation_window ()
 
void compute_next_window ()
 
+ + + + + + + + + + + + + + + + + + + + +

+Protected Attributes

prob::welford_covar_estimator _estimator
 
- Protected Attributes inherited from stan::mcmc::windowed_adaptation
std::string _estimator_name
 
unsigned int _num_warmup
 
unsigned int _adapt_init_buffer
 
unsigned int _adapt_term_buffer
 
unsigned int _adapt_base_window
 
unsigned int _adapt_window_counter
 
unsigned int _adapt_next_window
 
unsigned int _adapt_window_size
 
+

Detailed Description

+
+

Definition at line 14 of file covar_adaptation.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::mcmc::covar_adaptation::covar_adaptation (int n)
+
+inline
+
+ +

Definition at line 18 of file covar_adaptation.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::mcmc::covar_adaptation::learn_covariance (Eigen::MatrixXd & covar,
const Eigen::VectorXd & q 
)
+
+inline
+
+ +

Definition at line 20 of file covar_adaptation.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
prob::welford_covar_estimator stan::mcmc::covar_adaptation::_estimator
+
+protected
+
+ +

Definition at line 48 of file covar_adaptation.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1covar__adaptation.png b/doc/api/html/classstan_1_1mcmc_1_1covar__adaptation.png new file mode 100644 index 0000000000000000000000000000000000000000..45d591176a6830edc2e109931e36f55efe5a720a GIT binary patch literal 1083 zcmeAS@N?(olHy`uVBq!ia0vp^CxEzvgBeIpy%%x-NJ#|vgt-3y{~ySF@#br3|Dg#$ z78oBmaDcV*jy#adQ4-`A%m7pb0#{Fk7%?y~pYn8Z45?szJNNCT%{n};;(qH z+9Cl~|J$Fx*lJGJj6NMcsnzhG>hn420+EyU#WN~-&J$6X^u%+zg6E`rSG{NZcfUUH z>AhqyNX9;sWzswLjqzgHuXBy}&b?%p`Rn(pvNI)R>bI|CE&CV}dtd)}q^DID!>5il zN4C$(J|0$_cIg{`^pud>57(T%HCbKt>NUM7Dyt1WzE<`ehC?Rq*>q2JF2`~!ZqpL zn%}86H{9EH_qOAk$;CDn5eOGTiHX#C3ZWW{Wv#e?!U?{yWX-Uw)?A{OZ@WZ z)>gBv+m?SToY2?5I2jn8_6;#}uWeT7zt8FsdtqPb@heiYjgzvZ8)NLgB`zv+w$$0O z{%7Jv{reLOv);BY6fTO^t@_K?q3d|{pBBYmmb!Z` zeZI-xU!_^sMW!A!JC+-}`N6~WY#VA-tS-hh+bC&&T-$bQx72RlT)z4Er5kU5 zDF;UH7Rb2Gu*B}XT7z-w^885;9WL0+xx91k->)( + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::dense_e_metric< M, BaseRNG > Member List
+
+
+ +

This is the complete list of members for stan::mcmc::dense_e_metric< M, BaseRNG >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
_err_streamstan::mcmc::base_hamiltonian< M, dense_e_point, BaseRNG >protected
_modelstan::mcmc::base_hamiltonian< M, dense_e_point, BaseRNG >protected
_write_error_msg(std::ostream *error_msgs, const std::domain_error &e)stan::mcmc::base_hamiltonian< M, dense_e_point, BaseRNG >inlineprotected
base_hamiltonian(M &m, std::ostream *e)stan::mcmc::base_hamiltonian< M, dense_e_point, BaseRNG >inline
dense_e_metric(M &m, std::ostream *e)stan::mcmc::dense_e_metric< M, BaseRNG >inline
dphi_dq(dense_e_point &z)stan::mcmc::dense_e_metric< M, BaseRNG >inlinevirtual
dtau_dp(dense_e_point &z)stan::mcmc::dense_e_metric< M, BaseRNG >inlinevirtual
dtau_dq(dense_e_point &z)stan::mcmc::dense_e_metric< M, BaseRNG >inlinevirtual
H(dense_e_point &z)stan::mcmc::base_hamiltonian< M, dense_e_point, BaseRNG >inline
init(dense_e_point &z)stan::mcmc::base_hamiltonian< M, dense_e_point, BaseRNG >inlinevirtual
phi(dense_e_point &z)stan::mcmc::dense_e_metric< M, BaseRNG >inlinevirtual
sample_p(dense_e_point &z, BaseRNG &rng)stan::mcmc::dense_e_metric< M, BaseRNG >inlinevirtual
T(dense_e_point &z)stan::mcmc::dense_e_metric< M, BaseRNG >inlinevirtual
tau(dense_e_point &z)stan::mcmc::dense_e_metric< M, BaseRNG >inlinevirtual
update(dense_e_point &z)stan::mcmc::base_hamiltonian< M, dense_e_point, BaseRNG >inlinevirtual
V(dense_e_point &z)stan::mcmc::base_hamiltonian< M, dense_e_point, BaseRNG >inline
~base_hamiltonian()stan::mcmc::base_hamiltonian< M, dense_e_point, BaseRNG >inline
~dense_e_metric()stan::mcmc::dense_e_metric< M, BaseRNG >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1dense__e__metric.html b/doc/api/html/classstan_1_1mcmc_1_1dense__e__metric.html new file mode 100644 index 00000000000..07cf00e35fa --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1dense__e__metric.html @@ -0,0 +1,465 @@ + + + + + +Stan: stan::mcmc::dense_e_metric< M, BaseRNG > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::dense_e_metric< M, BaseRNG > Class Template Reference
+
+
+ +

#include <dense_e_metric.hpp>

+
+Inheritance diagram for stan::mcmc::dense_e_metric< M, BaseRNG >:
+
+
+ + +stan::mcmc::base_hamiltonian< M, dense_e_point, BaseRNG > + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 dense_e_metric (M &m, std::ostream *e)
 
 ~dense_e_metric ()
 
double T (dense_e_point &z)
 
double tau (dense_e_point &z)
 
double phi (dense_e_point &z)
 
const Eigen::VectorXd dtau_dq (dense_e_point &z)
 
const Eigen::VectorXd dtau_dp (dense_e_point &z)
 
const Eigen::VectorXd dphi_dq (dense_e_point &z)
 
void sample_p (dense_e_point &z, BaseRNG &rng)
 
- Public Member Functions inherited from stan::mcmc::base_hamiltonian< M, dense_e_point, BaseRNG >
 base_hamiltonian (M &m, std::ostream *e)
 
 ~base_hamiltonian ()
 
double V (dense_e_point &z)
 
double H (dense_e_point &z)
 
virtual void init (dense_e_point &z)
 
virtual void update (dense_e_point &z)
 
+ + + + + + + + + +

+Additional Inherited Members

- Protected Member Functions inherited from stan::mcmc::base_hamiltonian< M, dense_e_point, BaseRNG >
void _write_error_msg (std::ostream *error_msgs, const std::domain_error &e)
 
- Protected Attributes inherited from stan::mcmc::base_hamiltonian< M, dense_e_point, BaseRNG >
M & _model
 
std::ostream * _err_stream
 
+

Detailed Description

+

template<typename M, typename BaseRNG>
+class stan::mcmc::dense_e_metric< M, BaseRNG >

+ + +

Definition at line 19 of file dense_e_metric.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename M , typename BaseRNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
stan::mcmc::dense_e_metric< M, BaseRNG >::dense_e_metric (M & m,
std::ostream * e 
)
+
+inline
+
+ +

Definition at line 23 of file dense_e_metric.hpp.

+ +
+
+ +
+
+
+template<typename M , typename BaseRNG >
+ + + + + +
+ + + + + + + +
stan::mcmc::dense_e_metric< M, BaseRNG >::~dense_e_metric ()
+
+inline
+
+ +

Definition at line 25 of file dense_e_metric.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename M , typename BaseRNG >
+ + + + + +
+ + + + + + + + +
const Eigen::VectorXd stan::mcmc::dense_e_metric< M, BaseRNG >::dphi_dq (dense_e_pointz)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_hamiltonian< M, dense_e_point, BaseRNG >.

+ +

Definition at line 42 of file dense_e_metric.hpp.

+ +
+
+ +
+
+
+template<typename M , typename BaseRNG >
+ + + + + +
+ + + + + + + + +
const Eigen::VectorXd stan::mcmc::dense_e_metric< M, BaseRNG >::dtau_dp (dense_e_pointz)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_hamiltonian< M, dense_e_point, BaseRNG >.

+ +

Definition at line 38 of file dense_e_metric.hpp.

+ +
+
+ +
+
+
+template<typename M , typename BaseRNG >
+ + + + + +
+ + + + + + + + +
const Eigen::VectorXd stan::mcmc::dense_e_metric< M, BaseRNG >::dtau_dq (dense_e_pointz)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_hamiltonian< M, dense_e_point, BaseRNG >.

+ +

Definition at line 34 of file dense_e_metric.hpp.

+ +
+
+ +
+
+
+template<typename M , typename BaseRNG >
+ + + + + +
+ + + + + + + + +
double stan::mcmc::dense_e_metric< M, BaseRNG >::phi (dense_e_pointz)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_hamiltonian< M, dense_e_point, BaseRNG >.

+ +

Definition at line 32 of file dense_e_metric.hpp.

+ +
+
+ +
+
+
+template<typename M , typename BaseRNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::mcmc::dense_e_metric< M, BaseRNG >::sample_p (dense_e_pointz,
BaseRNG & rng 
)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_hamiltonian< M, dense_e_point, BaseRNG >.

+ +

Definition at line 46 of file dense_e_metric.hpp.

+ +
+
+ +
+
+
+template<typename M , typename BaseRNG >
+ + + + + +
+ + + + + + + + +
double stan::mcmc::dense_e_metric< M, BaseRNG >::T (dense_e_pointz)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_hamiltonian< M, dense_e_point, BaseRNG >.

+ +

Definition at line 27 of file dense_e_metric.hpp.

+ +
+
+ +
+
+
+template<typename M , typename BaseRNG >
+ + + + + +
+ + + + + + + + +
double stan::mcmc::dense_e_metric< M, BaseRNG >::tau (dense_e_pointz)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_hamiltonian< M, dense_e_point, BaseRNG >.

+ +

Definition at line 31 of file dense_e_metric.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1dense__e__metric.png b/doc/api/html/classstan_1_1mcmc_1_1dense__e__metric.png new file mode 100644 index 0000000000000000000000000000000000000000..8ae3dcd66a75d7195bb7d2fc62fad9cf7dd987d1 GIT binary patch literal 1197 zcmeAS@N?(olHy`uVBq!ia0y~yV9W)w12~w0)lFX|>;$efGEg zr`*sf4qI%u`ktRNJ2KCjqveTm%YL8BCQFxP&SE;E;;HHRYsaK*Dz2KD-a%8~469qN zlj5#EKFO|}H-EZ&(C0a~R?q#rz*{hadF{%g|C3eRx8}c`f1iEvf39271)fzw*(S~b z(=&fB6Kk7fvg(`ezMMOAFIvC-eWTL-m78hf9jV{TEZ^pa{61^4M{xGkpXo8x*Iu0A zd>frT=gE)4cUONclunj;m3}3Y|5MuHy>p*gE%x|ryguJ5clYc?i~eSwPuqVa?PTY4xy82S?WgSfj&HG^EOt@xtzBcR{kgqW z0iJEG-|X7I&A81jC|_pv^h4*a+KJm%-roChVV?b$$4A~@f3;0lP`z~byxygcwy@sU zba#LIcUc^BdEPgx>>cv2Z`G>aoLhK0Z2SFVE7fuyyT1>$KC*lE>|2jn(lf%JeRGq{ z@V=x!Rd~9J?dr`h#eKcA=1bfvPMh&$(vtF*mAkL?-?EzdKW+N|&O6hVaQ_Ms^OzKR zY1$GE)m+c6AQZ;k41Y+R+vzvNuaIvLacG!i<}jhIPRQJ$2gJ(TAZ+f?0c6dYWa=;l zNYfP8X}=Bf@|+sv)u6$k+0d_@$?T$ugkNgCJzf2^?d&?Wn&7zno&OmvR@Hj{|6?b~ z`(e*N)msdU!vfl_9}-9ic^j>kbLW23Z>G1qtv@fj9+SZ|>+H2X1-Ev0?z}Fs;=P`v z_5AOSr?Y!g&KwH9_4-5E$=)*6zsG`pTfIHne|5I0__uVobYL=*d?9V{^2%1X>|I)23c~ z@OqDa*rZpdOmAH~kaYcyPi(fmMA@SW*K=pdg-)tFc`VBMVxHIm?p-C`yClCw<;`Z1 z>(}34-}mwI9lK?3bu)j<+=@T>cJb$$D=)7+UYBS6Ic}wj^WAsP?W4E9{rNZV?z-do znptn>J_@nfzc;Sz_ja`n+e%8-9-N`+Tx+w + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::dense_e_nuts< M, BaseRNG > Member List
+
+
+ +

This is the complete list of members for stan::mcmc::dense_e_nuts< M, BaseRNG >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_depthstan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >
_epsilonstan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
_epsilon_jitterstan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
_err_streamstan::mcmc::base_mcmcprotected
_hamiltonianstan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
_integratorstan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
_max_deltastan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >
_max_depthstan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >
_n_divergentstan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >
_namestan::mcmc::base_mcmcprotected
_nom_epsilonstan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
_out_streamstan::mcmc::base_mcmcprotected
_rand_intstan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
_rand_uniformstan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
_zstan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
base_hmc(M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
base_mcmc(std::ostream *o, std::ostream *e)stan::mcmc::base_mcmcinline
base_nuts(M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)stan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
build_tree(int depth, Eigen::VectorXd &rho, ps_point *z_init_parent, ps_point &z_propose, nuts_util &util)stan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
compute_criterion(ps_point &start, dense_e_point &finish, Eigen::VectorXd &rho)stan::mcmc::dense_e_nuts< M, BaseRNG >inlinevirtual
dense_e_nuts(M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)stan::mcmc::dense_e_nuts< M, BaseRNG >inline
get_current_stepsize()stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
get_max_delta()stan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
get_max_depth()stan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
get_nominal_stepsize()stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
get_sampler_diagnostic_names(std::vector< std::string > &model_names, std::vector< std::string > &names)stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_diagnostics(std::vector< double > &values)stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_param_names(std::vector< std::string > &names)stan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_params(std::vector< double > &values)stan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_stepsize_jitter()stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
init_stepsize()stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
name()stan::mcmc::base_mcmcinline
sample_stepsize()stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
seed(const Eigen::VectorXd &q)stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
set_max_delta(const double d)stan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
set_max_depth(const int d)stan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
set_nominal_stepsize(const double e)stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
set_stepsize_jitter(const double j)stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
transition(sample &init_sample)stan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
write_sampler_param_names(std::ostream &o)stan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
write_sampler_params(std::ostream &o)stan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
write_sampler_state(std::ostream *o)stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
z()stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
~base_mcmc()stan::mcmc::base_mcmcinlinevirtual
~base_nuts()stan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1dense__e__nuts.html b/doc/api/html/classstan_1_1mcmc_1_1dense__e__nuts.html new file mode 100644 index 00000000000..c41a4c2c4fb --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1dense__e__nuts.html @@ -0,0 +1,330 @@ + + + + + +Stan: stan::mcmc::dense_e_nuts< M, BaseRNG > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::dense_e_nuts< M, BaseRNG > Class Template Reference
+
+
+ +

#include <dense_e_nuts.hpp>

+
+Inheritance diagram for stan::mcmc::dense_e_nuts< M, BaseRNG >:
+
+
+ + +stan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_mcmc +stan::mcmc::adapt_dense_e_nuts< M, BaseRNG > + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 dense_e_nuts (M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)
 
bool compute_criterion (ps_point &start, dense_e_point &finish, Eigen::VectorXd &rho)
 
- Public Member Functions inherited from stan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >
 base_nuts (M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)
 
 ~base_nuts ()
 
void set_max_depth (const int d)
 
void set_max_delta (const double d)
 
int get_max_depth ()
 
double get_max_delta ()
 
sample transition (sample &init_sample)
 
void write_sampler_param_names (std::ostream &o)
 
void write_sampler_params (std::ostream &o)
 
void get_sampler_param_names (std::vector< std::string > &names)
 
void get_sampler_params (std::vector< double > &values)
 
int build_tree (int depth, Eigen::VectorXd &rho, ps_point *z_init_parent, ps_point &z_propose, nuts_util &util)
 
- Public Member Functions inherited from stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >
 base_hmc (M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)
 
void write_sampler_state (std::ostream *o)
 
void get_sampler_diagnostic_names (std::vector< std::string > &model_names, std::vector< std::string > &names)
 
void get_sampler_diagnostics (std::vector< double > &values)
 
void seed (const Eigen::VectorXd &q)
 
void init_stepsize ()
 
dense_e_pointz ()
 
virtual void set_nominal_stepsize (const double e)
 
double get_nominal_stepsize ()
 
double get_current_stepsize ()
 
virtual void set_stepsize_jitter (const double j)
 
double get_stepsize_jitter ()
 
void sample_stepsize ()
 
- Public Member Functions inherited from stan::mcmc::base_mcmc
 base_mcmc (std::ostream *o, std::ostream *e)
 
virtual ~base_mcmc ()
 
std::string name ()
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Public Attributes inherited from stan::mcmc::base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >
int _depth
 
int _max_depth
 
double _max_delta
 
int _n_divergent
 
- Protected Attributes inherited from stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >
dense_e_point _z
 
expl_leapfrog< dense_e_metric
+< M, BaseRNG >, dense_e_point
_integrator
 
dense_e_metric< M, BaseRNG > _hamiltonian
 
BaseRNG & _rand_int
 
boost::uniform_01< BaseRNG & > _rand_uniform
 
double _nom_epsilon
 
double _epsilon
 
double _epsilon_jitter
 
+

Detailed Description

+

template<typename M, class BaseRNG>
+class stan::mcmc::dense_e_nuts< M, BaseRNG >

+ + +

Definition at line 17 of file dense_e_nuts.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::mcmc::dense_e_nuts< M, BaseRNG >::dense_e_nuts (M & m,
BaseRNG & rng,
std::ostream * o = &std::cout,
std::ostream * e = 0 
)
+
+inline
+
+ +

Definition at line 25 of file dense_e_nuts.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::mcmc::dense_e_nuts< M, BaseRNG >::compute_criterion (ps_pointstart,
dense_e_pointfinish,
Eigen::VectorXd & rho 
)
+
+inlinevirtual
+
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1dense__e__nuts.png b/doc/api/html/classstan_1_1mcmc_1_1dense__e__nuts.png new file mode 100644 index 0000000000000000000000000000000000000000..d35615ade3851fd269e9491c56cd5d82ed7d445f GIT binary patch literal 3170 zcmdUyYfzI{9>#-+SSn(%iWM-rtEJ!#P;M#&EJ#7Q$VIRLLIt_VT?hd}@?u#9i+~m= zN`xRtghW6g5blYkLIL4LBwP|gT7hs&K#WOBZf|3Ech(QPJNu;{_RKuz|2s2h=FFM@ z^PG3yo1X5@+FHA{U@(}r%U6zGFqoP`#lLM34$OMF7QR@{2ym#@w|)`cP6e5av1`5_l| z_wMHo(GtuHe6hLL)Lxp(s|vlo_j3Jcvy;VnZD*EWuImTtCq6;cboC=keF3vbgn*)S zC*^cRDq5;Ll(ZCu5*Lf6ME6Hgq%_i-a|TRq&rup8s->@G<(ia6nIJVB#suD@=Pi>giibRPD7Pm`s#I&-L zwW@{sBuADdHmW6(nF=iQz?w|YrQcbny9L;FL5oyuT~Y6xO&_R6{_%_UEi=_hcRaxJ zbMqk@2`G83_xY;`CgQ{Ee8~OJ@y1pAs|s~>G8pM<`(bJ>GMK}<)Kvj9drz%DdnjQ0 zRFvQ%ft^>?KUFtl>Hnn*uHk?eu1Ho2-%LNgNa(U?v}8cG@75msY8rr-Db_j`IH+c; z{}NBSJnyg!HUb18P`&`4@WW-u#H$+jOUWx2mv|Ndl4s?jFsNOC&N`(3NH^X%nh@a` zgk;h!u9Kd($ZjgmF0$(HP3~33Q=8a=tghai2g_D>5j+%THHp$8BD>EmkxIj6%7X^O zEZc_$2}kPN)6W||VG;E?CDWEe;(+;4pXRx`oC3Btec3u727B+Sggl_N64s0w;6$*~ zo8i+soTK(u0o=9VO@Z0XPPUCJ_R%-cAJ}sQfc;4%=nKm9NFI?@yOJB!> zczO+u%0fqlTYd+avT!mmD`;ydJ0X~UG4GC|$pJeC3jFTTi3!Zwpn;XHC;^<$n-};k zrWYsev61zPW!~1efU9*Ns4RFO)37-y>peDcJ!M20(G$aAD3yHpTtj95vjY-FCos|J z9#ZKi$a|h6Q4TB5J^+tFcz|>3RO%}2tXSU3CA}-a0)2);?Wa>+?v|iHYHb2un}_-S zI*doQH=KS&v*6M z*4nh87Pr!EJ=eBg(m8UNX|=x4STEfKDb_FGz8eRX!YpUeR$#L0N=2IE2g!dQmH)el zgrC%5A4Q0Z;szgUzX5b`r=pl@y@``1Ltnaa0kZlJZLLaa>abME=knz6FQl4cU-&Ow z3ancABQo}fwp8tLoM}YoBovF~>>KE**%+Y3{(N`g_ytj%+k?obKcT`?KxI{u;MI%h zZGbh4B@lnfoq0Yi+VBD{tPi9$y&a>RD54OOOL8;QEC`eQ6IO9;9V>60(2OfUY*JL( zs|MR~8;hct*5%i;;?dQ#;fjXNbFEnBWevWEj8WQ8V4G9k}UURKRY;f+mb-x|ZH6pC<(aPtNtOfoIrk!0g?T*=G(& z%8eLS(X>8aa~DUZxJALzOF}z)2F5LgM+MW3^etWKh_!^XiJWgvd5sQ5e+s2jxBqVu ziL;fs%r9i4m($Yi3GYK<&RU-Y%#-MQ!^5GJP3_w}Sn$D?TKx$wQBfI?>|@h1yQf8> z>Gx)38s2pUb10}ok|joI;mXz}vgNSZJ}f{B^_Z5$xFT95#ZzY7Z3BYkP~lWve&t(( zl&zjS&R~9dTah&$N~C4VdrT8LFEi3;(hp#%7FmgMo;;@a5r;H7)v zz$e-}+n>@k7X8`=5fBJ*|f)J_yO+`N);HWzu5d6t%Q$&`K zLQ6=-d(Xi>vbP?wv-kN>b^}Uw;(FYMLx{1WR}wfQqbjzJjxVEb`fcBcou_Sx%qllm zQShrOD&1{5b{O~pbNX~Z6ah96j)^7g@Rz3pfmOCwpq-ER zgg4ReLZfVvHy=Ekgsdi96SVHWV#2=4j5jE^Ne!$qq%}0Lf)3^JSEaT3!eQn7lo~t~ zNF0$ZJvM!68&}owWna@Nj7%7Oofjrh$0<;5=jvt4K^B zfyx0hyMDRCn(a1{6m6x$@DQ4bHT#63My|md98aTp-qi27{_LzY@EPE|$6>$yvhkU(=eTVf-)sh=n%?sNeS7CF z0jieVBSn6vX&>AL)6K|uh|4HX$5r7o?!Kph*+=+{+bU{#h|Q>0)jw5^G?c4x!n#RS zVT-5Fc4quT98-1Pza%eLxQHOe5qDWPyL*fJ-@QUy`lnYeDD+gjy?exQyY*#8-G|YM zS!lTYiIVsf>fAJ5N;k;9vg7D=LHw3}_BU-#ZIW&$IAzN$E7kkB*qR(Wbm3vY>Vm<< z_MN?RNN{y8a`A0Fq5_F7UMHNT9rV>MHXLUEVW#NBsGgNPd2P{>$C~#&ln5Hqsh!g~ z=!3gMkA%{+;C-Z+?yUA2wh%ivKk27EKy0WlskZy-KYgO}A+_u?w|IsAr%9?G0+@@F LyJOwy;BS8i633up literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1mcmc_1_1dense__e__point-members.html b/doc/api/html/classstan_1_1mcmc_1_1dense__e__point-members.html new file mode 100644 index 00000000000..25de2843b75 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1dense__e__point-members.html @@ -0,0 +1,127 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::dense_e_point Member List
+
+
+ +

This is the complete list of members for stan::mcmc::dense_e_point, including all inherited members.

+ + + + + + + + + + + + + + + + +
_fast_matrix_copy(Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &v_to, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &v_from)stan::mcmc::ps_pointinlineprotected
_fast_vector_copy(Eigen::Matrix< T, Eigen::Dynamic, 1 > &v_to, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v_from)stan::mcmc::ps_pointinlineprotected
dense_e_point(int n)stan::mcmc::dense_e_pointinline
dense_e_point(const dense_e_point &z)stan::mcmc::dense_e_pointinline
gstan::mcmc::ps_point
get_param_names(std::vector< std::string > &model_names, std::vector< std::string > &names)stan::mcmc::ps_pointinlinevirtual
get_params(std::vector< double > &values)stan::mcmc::ps_pointinlinevirtual
mInvstan::mcmc::dense_e_point
operator=(const ps_point &z)stan::mcmc::ps_pointinline
pstan::mcmc::ps_point
ps_point(int n)stan::mcmc::ps_pointinline
ps_point(const ps_point &z)stan::mcmc::ps_pointinline
qstan::mcmc::ps_point
Vstan::mcmc::ps_point
write_metric(std::ostream *o)stan::mcmc::dense_e_pointinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1dense__e__point.html b/doc/api/html/classstan_1_1mcmc_1_1dense__e__point.html new file mode 100644 index 00000000000..fbeb0bc037a --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1dense__e__point.html @@ -0,0 +1,272 @@ + + + + + +Stan: stan::mcmc::dense_e_point Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::dense_e_point Class Reference
+
+
+ +

#include <dense_e_point.hpp>

+
+Inheritance diagram for stan::mcmc::dense_e_point:
+
+
+ + +stan::mcmc::ps_point + +
+ + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 dense_e_point (int n)
 
 dense_e_point (const dense_e_point &z)
 
void write_metric (std::ostream *o)
 
- Public Member Functions inherited from stan::mcmc::ps_point
 ps_point (int n)
 
 ps_point (const ps_point &z)
 
ps_pointoperator= (const ps_point &z)
 
virtual void get_param_names (std::vector< std::string > &model_names, std::vector< std::string > &names)
 
virtual void get_params (std::vector< double > &values)
 
+ + + + + + + + + + + + +

+Public Attributes

Eigen::MatrixXd mInv
 
- Public Attributes inherited from stan::mcmc::ps_point
Eigen::VectorXd q
 
Eigen::VectorXd p
 
double V
 
Eigen::VectorXd g
 
+ + + + + + + + +

+Additional Inherited Members

- Protected Member Functions inherited from stan::mcmc::ps_point
template<typename T >
void _fast_vector_copy (Eigen::Matrix< T, Eigen::Dynamic, 1 > &v_to, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v_from)
 
template<typename T >
void _fast_matrix_copy (Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &v_to, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &v_from)
 
+

Detailed Description

+
+

Definition at line 12 of file dense_e_point.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::mcmc::dense_e_point::dense_e_point (int n)
+
+inline
+
+ +

Definition at line 16 of file dense_e_point.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
stan::mcmc::dense_e_point::dense_e_point (const dense_e_pointz)
+
+inline
+
+ +

Definition at line 22 of file dense_e_point.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
void stan::mcmc::dense_e_point::write_metric (std::ostream * o)
+
+inlinevirtual
+
+ +

Reimplemented from stan::mcmc::ps_point.

+ +

Definition at line 26 of file dense_e_point.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
Eigen::MatrixXd stan::mcmc::dense_e_point::mInv
+
+ +

Definition at line 18 of file dense_e_point.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1dense__e__point.png b/doc/api/html/classstan_1_1mcmc_1_1dense__e__point.png new file mode 100644 index 0000000000000000000000000000000000000000..68101c3eb3fe65a801e2a2a985ba10ac9961ced0 GIT binary patch literal 632 zcmeAS@N?(olHy`uVBq!ia0vp^3xPO*gBeJ=IX<-jQW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;kGRgNkp31lJ-T{iwcH7^c7A~8uVmwbcPqX-uY1`cB$70<} z@8)g%9{b~}+@v=MdHyy6n`&FiD^_<^1xy-6p4}VKJUblLBf7`?*ZuY-?U#jl?+w|A;(9*lx zk~}W){{3h?MP)n8#hGezfS!nCh`-95kiqN!qoSwJ!sa25g~g*EEf-HS#IY(i_&ahu z2o_-aA=1KNhnxFFoHN)fGh-qHTNqSrXiMH5eYO+-+mv&h=C*w9POmh7c6w7ne)`Pw z`RDs;+akid8Gc{gG<`SMbkh%=i5%OfSblt!@cf$Z(WFf2<8=+o>W*oB784d-XnWJh zYvRge@y^@x#ap)4Z`{1l^PWfw$}YOPao$U|FLWj!;jEITb=tJ-(EYBgE6YtpQB)* p0?P+Y4#t|OxapcpO*Z^vT(v|g@tl=UIWU + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::dense_e_static_hmc< M, BaseRNG > Member List
+
+
+ +

This is the complete list of members for stan::mcmc::dense_e_static_hmc< M, BaseRNG >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_epsilonstan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
_epsilon_jitterstan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
_err_streamstan::mcmc::base_mcmcprotected
_hamiltonianstan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
_integratorstan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
_namestan::mcmc::base_mcmcprotected
_nom_epsilonstan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
_out_streamstan::mcmc::base_mcmcprotected
_rand_intstan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
_rand_uniformstan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
_update_L()stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlineprotected
_zstan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
base_hmc(M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
base_mcmc(std::ostream *o, std::ostream *e)stan::mcmc::base_mcmcinline
base_static_hmc(M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
dense_e_static_hmc(M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)stan::mcmc::dense_e_static_hmc< M, BaseRNG >inline
get_current_stepsize()stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
get_L()stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
get_nominal_stepsize()stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
get_sampler_diagnostic_names(std::vector< std::string > &model_names, std::vector< std::string > &names)stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_diagnostics(std::vector< double > &values)stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_param_names(std::vector< std::string > &names)stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_params(std::vector< double > &values)stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_stepsize_jitter()stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
get_T()stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
init_stepsize()stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
L_stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
name()stan::mcmc::base_mcmcinline
sample_stepsize()stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
seed(const Eigen::VectorXd &q)stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
set_nominal_stepsize(const double e)stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
set_nominal_stepsize_and_L(const double e, const int l)stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
set_nominal_stepsize_and_T(const double e, const double t)stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
set_stepsize_jitter(const double j)stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
set_T(const double t)stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
T_stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >protected
transition(sample &init_sample)stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
write_sampler_param_names(std::ostream &o)stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
write_sampler_params(std::ostream &o)stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
write_sampler_state(std::ostream *o)stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
z()stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
~base_mcmc()stan::mcmc::base_mcmcinlinevirtual
~base_static_hmc()stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1dense__e__static__hmc.html b/doc/api/html/classstan_1_1mcmc_1_1dense__e__static__hmc.html new file mode 100644 index 00000000000..e3cb7167e66 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1dense__e__static__hmc.html @@ -0,0 +1,262 @@ + + + + + +Stan: stan::mcmc::dense_e_static_hmc< M, BaseRNG > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::dense_e_static_hmc< M, BaseRNG > Class Template Reference
+
+
+ +

#include <dense_e_static_hmc.hpp>

+
+Inheritance diagram for stan::mcmc::dense_e_static_hmc< M, BaseRNG >:
+
+
+ + +stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_mcmc +stan::mcmc::adapt_dense_e_static_hmc< M, BaseRNG > + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 dense_e_static_hmc (M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)
 
- Public Member Functions inherited from stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >
 base_static_hmc (M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)
 
 ~base_static_hmc ()
 
sample transition (sample &init_sample)
 
void write_sampler_param_names (std::ostream &o)
 
void write_sampler_params (std::ostream &o)
 
void get_sampler_param_names (std::vector< std::string > &names)
 
void get_sampler_params (std::vector< double > &values)
 
void set_nominal_stepsize_and_T (const double e, const double t)
 
void set_nominal_stepsize_and_L (const double e, const int l)
 
void set_T (const double t)
 
void set_nominal_stepsize (const double e)
 
double get_T ()
 
int get_L ()
 
- Public Member Functions inherited from stan::mcmc::base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >
 base_hmc (M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)
 
void write_sampler_state (std::ostream *o)
 
void get_sampler_diagnostic_names (std::vector< std::string > &model_names, std::vector< std::string > &names)
 
void get_sampler_diagnostics (std::vector< double > &values)
 
void seed (const Eigen::VectorXd &q)
 
void init_stepsize ()
 
dense_e_pointz ()
 
double get_nominal_stepsize ()
 
double get_current_stepsize ()
 
virtual void set_stepsize_jitter (const double j)
 
double get_stepsize_jitter ()
 
void sample_stepsize ()
 
- Public Member Functions inherited from stan::mcmc::base_mcmc
 base_mcmc (std::ostream *o, std::ostream *e)
 
virtual ~base_mcmc ()
 
std::string name ()
 
+ + + + + + + + + +

+Additional Inherited Members

- Protected Member Functions inherited from stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >
void _update_L ()
 
- Protected Attributes inherited from stan::mcmc::base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >
double T_
 
int L_
 
+

Detailed Description

+

template<typename M, class BaseRNG>
+class stan::mcmc::dense_e_static_hmc< M, BaseRNG >

+ + +

Definition at line 18 of file dense_e_static_hmc.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::mcmc::dense_e_static_hmc< M, BaseRNG >::dense_e_static_hmc (M & m,
BaseRNG & rng,
std::ostream * o = &std::cout,
std::ostream * e = 0 
)
+
+inline
+
+ +

Definition at line 26 of file dense_e_static_hmc.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1dense__e__static__hmc.png b/doc/api/html/classstan_1_1mcmc_1_1dense__e__static__hmc.png new file mode 100644 index 0000000000000000000000000000000000000000..668533a2202cfd690c6f9ae9c700f339a39d76bf GIT binary patch literal 3626 zcmdUyc~DdL7RQ4=1Ze_pMFMDywPHoKAhO6J1`3u!L=u!B0S#dh2}@Xw1gkb6Dx_6W zHW8}`K|sI|)7204&N9n_EbWkzv1v+GJ5Y^tSz^!o&=N5WB9C_}9E6^Q8H8XKAE9hQ4 z1lQ!WPv3n`Wu|D|wps@#(V@+_bJtltxY|;AF;Om)hIZ8xg6zH*GeMWr8r_%X7NW`A z%5lcA!w89>B+D);buu{R;s7Vdp#61$Oq28*bilBcxaVYC2Y>%1r5JME1}CvV80(oa zK<1xl6@sdjt5oXDk0*~a+m3Ft4QB5l(8VSWVhFDHz6V@$vJ{WB87*kq)$hw}{Z)X* z@na{Z#WKWoUi73jUZB=wu&<}Utq_(v9yVz13Fh3A=p{p`rID6Uz8zH#KAwEyVDSYg z)t+A!l0`?wP-3QnaPrSGlpmb|1 z8St+&zh2zp{;w^74UKEg0Ky#>6>H2)6nWQjesDb;uwtJpQ0bp7YL$HaYE5)VsEVtZ zVrv&Z+uHB@y+__f%^g`7-uR>xKAPv-bQ1WE1&0I{qrJ1*EOWq&lm zF$bHaMvBXXRT%qzvM+zqWKz~(J#-~cs#lf3Bk^oH>t}3>h_w)@dA{XaduAqlPwn%D zD2J)-W*}g_ER%S9W%|sWVWvGsR_v<2C;+dEzSLj4;So{bW>*WYau=(u&MlZ7Kcwc z{$1J-#8qGO?Mz-QR0GrNbl5WB=$j?OcJndye9>KPQ;hW4HmR9y%&^xrFKj|9#q6CsnM)OnX&(o)Fuk+%=;D#^E*W_!ZY4OlEJ-xYK^dk za*qCbh#Ykn8~dm}lB}x(W47WJugnZC0vG(o;_choC_}&)sBMt*wfDV;wWh00hsU_q z(7|C3t?9xSLR7%itAw7KtJIouoQD<+LQ4YAB_ssL ziCFrm(U@@_B)H>E&Gm}kW+zAK0H2{3l(N`B=P7=8h3FTSY9~(ut#zG8j|D4{*NJ=i zp|4M{E3v$x+2-!Fv5F%z*%vWoz2~6b6jKw-eHhg)<@(J7w9%82jqoDdyt;;&ft#0Z zAoMtPt+C)pGuekIkDT~~MXkh88?TcbVOJiiy^!@m#bwjjmKgUfD7l5a7kpcyERze* zk0;G9f~Vha{88MnNMBZ#($7Waqw)|;?$EmTf5b0KNtGuAZBdZ6X_>35b@h&G6=bbl zChNH)Wygv&0JUW(Ew+*rYcjPI`HAJc-~v>E==Nnq|H&fo@Smblc`jcYd2Za{lYV{@ z)mDG@ZHX5qr|xp?A}#B~{;Sb!>klq{Q!o$uL~~wRg{Of<8*aivgI1S_{HmMbEf-7u zKG1b;TfIwx&Iu)UCx?8E9mL8vb*6W{3KgK{6quTwt~zvy4~&NpX+hVD2F|!(*BAc* z;q>+?-=6TL8^o&;O+7NOtP)AposA{_SSx?fEFpZEMGxldKUpM(r%wT^K{Xon%`~5$ zY;s$fjcY_iZ47GU`3*^W{n`nvYjau2w4rqA)Rd@lq+;ov_{GdtS9+G-W`EHIbuUv%S^IS2z{YjRU-<;0e6W}{+Otba-3zg+xpwdb^ z(r=LkdegMuov%)9QE8`O;iL5GONo)T*||^%(8j304;-2O*sxIrR0!KFRfEq4vO6;3 zy1X`YCAcOIzOval>KK;j@7Zipj}g8{L>dAYkYh7DD`MXCu zJ{z1lM$_%NP^#}Md7@hZDOnLi5+5UT-}#y=#{TBDpV@%_cS3v0cexx%$E|KI-?jIM zLPY>KlD{Ms3tr^Yme&y~z1uOee#dy|TdO;enz}@Q+V4F2?|x*y7On;dtiqTKGdSm< zdW0Uv!1*M7JH#&#EL-}6k04LX8Sj>44ofn>o-}Br#i~9aA*N;ra|F!F9o{SS<`VGi zgt*-11_~!N7d@Gn0;PXjW7M_8=`Wd32jyUEb&ja?=By*2zB?<%j$13HUQP+HaI2lk zu&^r&;?J(sn^6Z9c|T0LERfH2Q5M>yOPQ|RDQqxX8W=}5?5+>neNSWFLwzn6iR(s5 zGNITr-dudqsAq(5BPc_^$@6^5PE+A@)tiI$+aCiMSrDvqgleJ;2v$#tWd1a1RRDun z!&5E((^L?_+=Y~w-PVc(BmVfhghf# z?`v@zqBY4An1YE}>Dxg%zBQ@5Jmhk$=r>(0nBxslU*&?WNHd;|Gxiq`tK^K?l{Ent z)k&ORW!Hh#jF&u1J{>Sy2V3Pg99taJ_TPr)EOEB(Q)=5^^fuK>XQx%ic;03|=C zWz+R-SlF^RLw@vPk!!c5D2Bn=V2}G zfAOS@4vM2#`=+?36se~MIlIM2 zieJCEC<+#XJ^k4jf6Gm#*XbW=__WEWNO-Ov*@mj?ET*??mrgZcoc9oKc5u zEk8N>o<3ZC^JohtjA|~xu`By$`ZXpz9|m^JM#ShaZ4(h-x;BWY?SV?W6+zp zZE~mTn20LTw^evSAVZ}OeLb-uQ=R8=4Xn1vFdOZ0vNZNjG1e&$ok`%P%PE4WD6Uf> zX`=vzL&_}#b?H>6#aCTO#C#6Il2 g*pU36BbcdtCAy+Ow%Sb+22flF9NipB_WPavHyoLr?EnA( literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1mcmc_1_1diag__e__metric-members.html b/doc/api/html/classstan_1_1mcmc_1_1diag__e__metric-members.html new file mode 100644 index 00000000000..d3d4b6ff2b5 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1diag__e__metric-members.html @@ -0,0 +1,130 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::diag_e_metric< M, BaseRNG > Member List
+
+
+ +

This is the complete list of members for stan::mcmc::diag_e_metric< M, BaseRNG >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
_err_streamstan::mcmc::base_hamiltonian< M, diag_e_point, BaseRNG >protected
_modelstan::mcmc::base_hamiltonian< M, diag_e_point, BaseRNG >protected
_write_error_msg(std::ostream *error_msgs, const std::domain_error &e)stan::mcmc::base_hamiltonian< M, diag_e_point, BaseRNG >inlineprotected
base_hamiltonian(M &m, std::ostream *e)stan::mcmc::base_hamiltonian< M, diag_e_point, BaseRNG >inline
diag_e_metric(M &m, std::ostream *e)stan::mcmc::diag_e_metric< M, BaseRNG >inline
dphi_dq(diag_e_point &z)stan::mcmc::diag_e_metric< M, BaseRNG >inlinevirtual
dtau_dp(diag_e_point &z)stan::mcmc::diag_e_metric< M, BaseRNG >inlinevirtual
dtau_dq(diag_e_point &z)stan::mcmc::diag_e_metric< M, BaseRNG >inlinevirtual
H(diag_e_point &z)stan::mcmc::base_hamiltonian< M, diag_e_point, BaseRNG >inline
init(diag_e_point &z)stan::mcmc::base_hamiltonian< M, diag_e_point, BaseRNG >inlinevirtual
phi(diag_e_point &z)stan::mcmc::diag_e_metric< M, BaseRNG >inlinevirtual
sample_p(diag_e_point &z, BaseRNG &rng)stan::mcmc::diag_e_metric< M, BaseRNG >inlinevirtual
T(diag_e_point &z)stan::mcmc::diag_e_metric< M, BaseRNG >inlinevirtual
tau(diag_e_point &z)stan::mcmc::diag_e_metric< M, BaseRNG >inlinevirtual
update(diag_e_point &z)stan::mcmc::base_hamiltonian< M, diag_e_point, BaseRNG >inlinevirtual
V(diag_e_point &z)stan::mcmc::base_hamiltonian< M, diag_e_point, BaseRNG >inline
~base_hamiltonian()stan::mcmc::base_hamiltonian< M, diag_e_point, BaseRNG >inline
~diag_e_metric()stan::mcmc::diag_e_metric< M, BaseRNG >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1diag__e__metric.html b/doc/api/html/classstan_1_1mcmc_1_1diag__e__metric.html new file mode 100644 index 00000000000..bfaf64c9a8d --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1diag__e__metric.html @@ -0,0 +1,465 @@ + + + + + +Stan: stan::mcmc::diag_e_metric< M, BaseRNG > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::diag_e_metric< M, BaseRNG > Class Template Reference
+
+
+ +

#include <diag_e_metric.hpp>

+
+Inheritance diagram for stan::mcmc::diag_e_metric< M, BaseRNG >:
+
+
+ + +stan::mcmc::base_hamiltonian< M, diag_e_point, BaseRNG > + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 diag_e_metric (M &m, std::ostream *e)
 
 ~diag_e_metric ()
 
double T (diag_e_point &z)
 
double tau (diag_e_point &z)
 
double phi (diag_e_point &z)
 
const Eigen::VectorXd dtau_dq (diag_e_point &z)
 
const Eigen::VectorXd dtau_dp (diag_e_point &z)
 
const Eigen::VectorXd dphi_dq (diag_e_point &z)
 
void sample_p (diag_e_point &z, BaseRNG &rng)
 
- Public Member Functions inherited from stan::mcmc::base_hamiltonian< M, diag_e_point, BaseRNG >
 base_hamiltonian (M &m, std::ostream *e)
 
 ~base_hamiltonian ()
 
double V (diag_e_point &z)
 
double H (diag_e_point &z)
 
virtual void init (diag_e_point &z)
 
virtual void update (diag_e_point &z)
 
+ + + + + + + + + +

+Additional Inherited Members

- Protected Member Functions inherited from stan::mcmc::base_hamiltonian< M, diag_e_point, BaseRNG >
void _write_error_msg (std::ostream *error_msgs, const std::domain_error &e)
 
- Protected Attributes inherited from stan::mcmc::base_hamiltonian< M, diag_e_point, BaseRNG >
M & _model
 
std::ostream * _err_stream
 
+

Detailed Description

+

template<typename M, typename BaseRNG>
+class stan::mcmc::diag_e_metric< M, BaseRNG >

+ + +

Definition at line 16 of file diag_e_metric.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename M , typename BaseRNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
stan::mcmc::diag_e_metric< M, BaseRNG >::diag_e_metric (M & m,
std::ostream * e 
)
+
+inline
+
+ +

Definition at line 20 of file diag_e_metric.hpp.

+ +
+
+ +
+
+
+template<typename M , typename BaseRNG >
+ + + + + +
+ + + + + + + +
stan::mcmc::diag_e_metric< M, BaseRNG >::~diag_e_metric ()
+
+inline
+
+ +

Definition at line 22 of file diag_e_metric.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename M , typename BaseRNG >
+ + + + + +
+ + + + + + + + +
const Eigen::VectorXd stan::mcmc::diag_e_metric< M, BaseRNG >::dphi_dq (diag_e_pointz)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_hamiltonian< M, diag_e_point, BaseRNG >.

+ +

Definition at line 39 of file diag_e_metric.hpp.

+ +
+
+ +
+
+
+template<typename M , typename BaseRNG >
+ + + + + +
+ + + + + + + + +
const Eigen::VectorXd stan::mcmc::diag_e_metric< M, BaseRNG >::dtau_dp (diag_e_pointz)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_hamiltonian< M, diag_e_point, BaseRNG >.

+ +

Definition at line 35 of file diag_e_metric.hpp.

+ +
+
+ +
+
+
+template<typename M , typename BaseRNG >
+ + + + + +
+ + + + + + + + +
const Eigen::VectorXd stan::mcmc::diag_e_metric< M, BaseRNG >::dtau_dq (diag_e_pointz)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_hamiltonian< M, diag_e_point, BaseRNG >.

+ +

Definition at line 31 of file diag_e_metric.hpp.

+ +
+
+ +
+
+
+template<typename M , typename BaseRNG >
+ + + + + +
+ + + + + + + + +
double stan::mcmc::diag_e_metric< M, BaseRNG >::phi (diag_e_pointz)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_hamiltonian< M, diag_e_point, BaseRNG >.

+ +

Definition at line 29 of file diag_e_metric.hpp.

+ +
+
+ +
+
+
+template<typename M , typename BaseRNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::mcmc::diag_e_metric< M, BaseRNG >::sample_p (diag_e_pointz,
BaseRNG & rng 
)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_hamiltonian< M, diag_e_point, BaseRNG >.

+ +

Definition at line 43 of file diag_e_metric.hpp.

+ +
+
+ +
+
+
+template<typename M , typename BaseRNG >
+ + + + + +
+ + + + + + + + +
double stan::mcmc::diag_e_metric< M, BaseRNG >::T (diag_e_pointz)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_hamiltonian< M, diag_e_point, BaseRNG >.

+ +

Definition at line 24 of file diag_e_metric.hpp.

+ +
+
+ +
+
+
+template<typename M , typename BaseRNG >
+ + + + + +
+ + + + + + + + +
double stan::mcmc::diag_e_metric< M, BaseRNG >::tau (diag_e_pointz)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_hamiltonian< M, diag_e_point, BaseRNG >.

+ +

Definition at line 28 of file diag_e_metric.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1diag__e__metric.png b/doc/api/html/classstan_1_1mcmc_1_1diag__e__metric.png new file mode 100644 index 0000000000000000000000000000000000000000..e7094c32b064b351a1cd540f1f6459291c827daa GIT binary patch literal 1200 zcmeAS@N?(olHy`uVBq!ia0y~yU`z(G12~w07U-DvobYun!!eoAg@VHQ+iZ2!%jv_N}38|m>TF! z`m#n&-)=_X>o|MQXVzQ8*^hh9Q}nD_u21n-7bk( zX1Yc3ZJPWqt%4Wc*A1VpVt+AbCA*aR`ScN=LIg8XFossljZTdjk0c93$@~c(5sQ2tusC#g_Im$3j*!Y>j zyw5)r&K-7Ke&^o;x%iYjS07*e@wDpCgpZE4@463o+OGSauvT;11Z&pkEAHOAYrE^^ z+;yv$U0=8N)!(`K=XSJaT0G6Wdo8i6)igo&%f0a6*f|rdj!iB3Z|Bpa`f~cI&etCw z+*}mgJn4)7uX>65pBGkdQh6C_wJrL-*Y4`vxfP$2-2c1Cc~4qDxw+S>(DT*TY$*^tHW~J@+RacQ5~*QJ^z7S+qW)|9tk*kpAOe?bjav%UhdoyDmIe zH~QP!f~;BhxAounmjAq8S9CMy>B^)F_x~>Zw&m;^XXlCQHZ!by>6*q6x8(Zo&+je!AcK|xEW2rd23F#W2> V^!k^rs=(rf!PC{xWt~$(69C}IPjdhO literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1mcmc_1_1diag__e__nuts-members.html b/doc/api/html/classstan_1_1mcmc_1_1diag__e__nuts-members.html new file mode 100644 index 00000000000..2030006136e --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1diag__e__nuts-members.html @@ -0,0 +1,157 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::diag_e_nuts< M, BaseRNG > Member List
+
+
+ +

This is the complete list of members for stan::mcmc::diag_e_nuts< M, BaseRNG >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_depthstan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >
_epsilonstan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
_epsilon_jitterstan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
_err_streamstan::mcmc::base_mcmcprotected
_hamiltonianstan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
_integratorstan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
_max_deltastan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >
_max_depthstan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >
_n_divergentstan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >
_namestan::mcmc::base_mcmcprotected
_nom_epsilonstan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
_out_streamstan::mcmc::base_mcmcprotected
_rand_intstan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
_rand_uniformstan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
_zstan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
base_hmc(M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
base_mcmc(std::ostream *o, std::ostream *e)stan::mcmc::base_mcmcinline
base_nuts(M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)stan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
build_tree(int depth, Eigen::VectorXd &rho, ps_point *z_init_parent, ps_point &z_propose, nuts_util &util)stan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
compute_criterion(ps_point &start, diag_e_point &finish, Eigen::VectorXd &rho)stan::mcmc::diag_e_nuts< M, BaseRNG >inlinevirtual
diag_e_nuts(M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)stan::mcmc::diag_e_nuts< M, BaseRNG >inline
get_current_stepsize()stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
get_max_delta()stan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
get_max_depth()stan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
get_nominal_stepsize()stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
get_sampler_diagnostic_names(std::vector< std::string > &model_names, std::vector< std::string > &names)stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_diagnostics(std::vector< double > &values)stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_param_names(std::vector< std::string > &names)stan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_params(std::vector< double > &values)stan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_stepsize_jitter()stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
init_stepsize()stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
name()stan::mcmc::base_mcmcinline
sample_stepsize()stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
seed(const Eigen::VectorXd &q)stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
set_max_delta(const double d)stan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
set_max_depth(const int d)stan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
set_nominal_stepsize(const double e)stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
set_stepsize_jitter(const double j)stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
transition(sample &init_sample)stan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
write_sampler_param_names(std::ostream &o)stan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
write_sampler_params(std::ostream &o)stan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
write_sampler_state(std::ostream *o)stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
z()stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
~base_mcmc()stan::mcmc::base_mcmcinlinevirtual
~base_nuts()stan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1diag__e__nuts.html b/doc/api/html/classstan_1_1mcmc_1_1diag__e__nuts.html new file mode 100644 index 00000000000..3b3f0e788f1 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1diag__e__nuts.html @@ -0,0 +1,330 @@ + + + + + +Stan: stan::mcmc::diag_e_nuts< M, BaseRNG > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::diag_e_nuts< M, BaseRNG > Class Template Reference
+
+
+ +

#include <diag_e_nuts.hpp>

+
+Inheritance diagram for stan::mcmc::diag_e_nuts< M, BaseRNG >:
+
+
+ + +stan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_mcmc +stan::mcmc::adapt_diag_e_nuts< M, BaseRNG > + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 diag_e_nuts (M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)
 
bool compute_criterion (ps_point &start, diag_e_point &finish, Eigen::VectorXd &rho)
 
- Public Member Functions inherited from stan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >
 base_nuts (M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)
 
 ~base_nuts ()
 
void set_max_depth (const int d)
 
void set_max_delta (const double d)
 
int get_max_depth ()
 
double get_max_delta ()
 
sample transition (sample &init_sample)
 
void write_sampler_param_names (std::ostream &o)
 
void write_sampler_params (std::ostream &o)
 
void get_sampler_param_names (std::vector< std::string > &names)
 
void get_sampler_params (std::vector< double > &values)
 
int build_tree (int depth, Eigen::VectorXd &rho, ps_point *z_init_parent, ps_point &z_propose, nuts_util &util)
 
- Public Member Functions inherited from stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >
 base_hmc (M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)
 
void write_sampler_state (std::ostream *o)
 
void get_sampler_diagnostic_names (std::vector< std::string > &model_names, std::vector< std::string > &names)
 
void get_sampler_diagnostics (std::vector< double > &values)
 
void seed (const Eigen::VectorXd &q)
 
void init_stepsize ()
 
diag_e_pointz ()
 
virtual void set_nominal_stepsize (const double e)
 
double get_nominal_stepsize ()
 
double get_current_stepsize ()
 
virtual void set_stepsize_jitter (const double j)
 
double get_stepsize_jitter ()
 
void sample_stepsize ()
 
- Public Member Functions inherited from stan::mcmc::base_mcmc
 base_mcmc (std::ostream *o, std::ostream *e)
 
virtual ~base_mcmc ()
 
std::string name ()
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Public Attributes inherited from stan::mcmc::base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >
int _depth
 
int _max_depth
 
double _max_delta
 
int _n_divergent
 
- Protected Attributes inherited from stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >
diag_e_point _z
 
expl_leapfrog< diag_e_metric
+< M, BaseRNG >, diag_e_point
_integrator
 
diag_e_metric< M, BaseRNG > _hamiltonian
 
BaseRNG & _rand_int
 
boost::uniform_01< BaseRNG & > _rand_uniform
 
double _nom_epsilon
 
double _epsilon
 
double _epsilon_jitter
 
+

Detailed Description

+

template<typename M, class BaseRNG>
+class stan::mcmc::diag_e_nuts< M, BaseRNG >

+ + +

Definition at line 17 of file diag_e_nuts.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::mcmc::diag_e_nuts< M, BaseRNG >::diag_e_nuts (M & m,
BaseRNG & rng,
std::ostream * o = &std::cout,
std::ostream * e = 0 
)
+
+inline
+
+ +

Definition at line 25 of file diag_e_nuts.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::mcmc::diag_e_nuts< M, BaseRNG >::compute_criterion (ps_pointstart,
diag_e_pointfinish,
Eigen::VectorXd & rho 
)
+
+inlinevirtual
+
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1diag__e__nuts.png b/doc/api/html/classstan_1_1mcmc_1_1diag__e__nuts.png new file mode 100644 index 0000000000000000000000000000000000000000..e5b42fcc07d746ba5468e9cf15440059334f2627 GIT binary patch literal 3177 zcmeH~SyU5Q9>#+xIEn@v6_u9Q&0?d6JrYC~Z5Id-LG~pP0TI&dBoGrML~XSj#Apm_ zBvFmsqftn72NcR9PhzAnR$(+kn$ru#DbrpCs` zEx!*yWS3j9PUoFLvWLDNJ#8*VAkg+N@H3}euF8orr&6+yD4(l_1dpvk7Bw&A)C6S- z0?o<_ngzht-7U92=U*miYd%}ex$T`no|&=c~3J=(FaYqI2Z6Iqh7?xdsXmU4~Bx~ zn~xVYBxt~gUR7u46$(n?w89+qewYMh3adZZbmM00`eOGQPt1O1PJrwhbCsD|Lg%1| zGjJd`Fwel=t{Vaf02=dft0l8%Dt4*Zlrn$t8b(4aT3YQLVL+q1%A+{uhbNDdbnZUq z8pwvAGL%uLrE@zjh(|nbNuR)?~|u-4U_3DbP!?3b}q(Z|A=}$dO}(mBgi zyd63jN$?hdvSZmO4~zp1-oMZu|E}*u^>Vt<{Oa0rvM@$I6?^=CuR|E-Znb^G9s@{4 zfv5$$Ak+YYZ!Rg#&`kO`C=Z~c#2e$>!-U0%BLQtKTbZ2LPHNlyD$!(m^bIB9xbtmg5?3ru0}{b?D_` zR_Gg`Xp2?Nrm8l~u&hf%GD?C^05Rb7otO}{D)pB;2Xv>>Ngd5ze4dAE za|pYrb`i=sQ*{ef6kv4Ly{B-setfR8Sksl7GeSw8fYIub^iKW(`r^HkbF z`H8(BzgSXpP@N3ny04K>uoq<$oIo?sh0A)JGJ1UjI6|t^HYZzQKd5FzK^cU6WUynH z#MgC^M>4(==cCLhc$rbaO~xceS^ZmeE#tgS?x9?&-cGn|xNNAe7sXr_7_IUfkR*gt zI-@E+KZ_&wxef9HwcVFioEk;@ZM#XL{nUh2M_|O7qA<#4tu4l8FHEFg95+|ifKMz| zk`zzWo2(ugo|e6~C_(MT!q2Cs{FdHGSZZ_HhKX_d)E&k@eakt=%9c;P`|FM3^mXM^ z-kVHcx*N^pB@(hBNsL%OvU01f?xX(r&ZGTS;0XU)>!!VVsum{yPu>HZ# z8STzXVHqZoMM5KyMB{*Nh6`PMqR=klSs_garqXX9*fD4=P|JqJ{d7q+XarR3`qE^< zw5~XY^u|J})*2yc7J%?=A|M*%D$!oUsol^KY335h|WV3mUQU%<8DOZezn)gb}(rk}j~YSb57B z08Rsno5X=LL`B`g_*uF*Wn$O@l{c0dYc}!gaUOp=F=9(d@ueRvMRN#;9eir6aN_<^Lxm4jtB2@LP>%9avXx#{(q1B<-Kbe zbS8Qm6P=;AQ$@C%q5s>HmfU%AUL-g|oBPaxh(4Ov3~nSLVZB!IGZhM7q{udC;{`5L zH6U4-c`8aU;2XVmp}^|Jynh`1@F9p&c~jTo*lDAmQk8kjV+$)yk64or%M+U!g^zKF z)LrdGQBIz=kgHlmk`V9v{OQ@1CG$F$_M{u`eLsh;#gx^To+uB81| zIqak|Qx3U{DJRROzZ3zpKmfb#0Vqlhgc|^DA|zy^^H^y7Rc#2q$$jv zx~edHQda*?ksJV>+|eX&TOIsOP55<9RK`ZyZ$N{g1-x7T^&j~@19pMu4oF({L&yGY zV}aI%uN%9=bm7+fX&0%kOq@b%H0Dmv;!ytD1QX)3Ho(X8Xq6n*HVK5vi}d`_LM`32 zst<|s8kI!fj~<@>@M+@6M-&jS+4#vLmy~XZ`h=CCMSPUov)_Ce6AA9g(X2^UOvy;v z^>d=6oL}6P?iiw;mpu?B2}S8^Qv3?oKJ}R1l+k;In^8DM(iVvj!Agn+e%A z-3=cYG<8kZO{St(41#>_7is6AmI865@H=(}CtoeCekolY73dEskXgk(ZwfI}>NcDDZgB<+?}qCIF5x@Ru_9Rpg_9jzN=2)Cf&|MXA5G5T vMeG46yKTDnZY*^hfRlaBue + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::diag_e_point Member List
+
+
+ +

This is the complete list of members for stan::mcmc::diag_e_point, including all inherited members.

+ + + + + + + + + + + + + + + + +
_fast_matrix_copy(Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &v_to, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &v_from)stan::mcmc::ps_pointinlineprotected
_fast_vector_copy(Eigen::Matrix< T, Eigen::Dynamic, 1 > &v_to, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v_from)stan::mcmc::ps_pointinlineprotected
diag_e_point(int n)stan::mcmc::diag_e_pointinline
diag_e_point(const diag_e_point &z)stan::mcmc::diag_e_pointinline
gstan::mcmc::ps_point
get_param_names(std::vector< std::string > &model_names, std::vector< std::string > &names)stan::mcmc::ps_pointinlinevirtual
get_params(std::vector< double > &values)stan::mcmc::ps_pointinlinevirtual
mInvstan::mcmc::diag_e_point
operator=(const ps_point &z)stan::mcmc::ps_pointinline
pstan::mcmc::ps_point
ps_point(int n)stan::mcmc::ps_pointinline
ps_point(const ps_point &z)stan::mcmc::ps_pointinline
qstan::mcmc::ps_point
Vstan::mcmc::ps_point
write_metric(std::ostream *o)stan::mcmc::diag_e_pointinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1diag__e__point.html b/doc/api/html/classstan_1_1mcmc_1_1diag__e__point.html new file mode 100644 index 00000000000..829ca13e95f --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1diag__e__point.html @@ -0,0 +1,272 @@ + + + + + +Stan: stan::mcmc::diag_e_point Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::diag_e_point Class Reference
+
+
+ +

#include <diag_e_point.hpp>

+
+Inheritance diagram for stan::mcmc::diag_e_point:
+
+
+ + +stan::mcmc::ps_point + +
+ + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 diag_e_point (int n)
 
 diag_e_point (const diag_e_point &z)
 
void write_metric (std::ostream *o)
 
- Public Member Functions inherited from stan::mcmc::ps_point
 ps_point (int n)
 
 ps_point (const ps_point &z)
 
ps_pointoperator= (const ps_point &z)
 
virtual void get_param_names (std::vector< std::string > &model_names, std::vector< std::string > &names)
 
virtual void get_params (std::vector< double > &values)
 
+ + + + + + + + + + + + +

+Public Attributes

Eigen::VectorXd mInv
 
- Public Attributes inherited from stan::mcmc::ps_point
Eigen::VectorXd q
 
Eigen::VectorXd p
 
double V
 
Eigen::VectorXd g
 
+ + + + + + + + +

+Additional Inherited Members

- Protected Member Functions inherited from stan::mcmc::ps_point
template<typename T >
void _fast_vector_copy (Eigen::Matrix< T, Eigen::Dynamic, 1 > &v_to, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v_from)
 
template<typename T >
void _fast_matrix_copy (Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &v_to, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &v_from)
 
+

Detailed Description

+
+

Definition at line 12 of file diag_e_point.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::mcmc::diag_e_point::diag_e_point (int n)
+
+inline
+
+ +

Definition at line 16 of file diag_e_point.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
stan::mcmc::diag_e_point::diag_e_point (const diag_e_pointz)
+
+inline
+
+ +

Definition at line 22 of file diag_e_point.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
void stan::mcmc::diag_e_point::write_metric (std::ostream * o)
+
+inlinevirtual
+
+ +

Reimplemented from stan::mcmc::ps_point.

+ +

Definition at line 26 of file diag_e_point.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
Eigen::VectorXd stan::mcmc::diag_e_point::mInv
+
+ +

Definition at line 18 of file diag_e_point.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1diag__e__point.png b/doc/api/html/classstan_1_1mcmc_1_1diag__e__point.png new file mode 100644 index 0000000000000000000000000000000000000000..453f1e9356590d9ace687df3d0cff7ccde240cea GIT binary patch literal 626 zcmeAS@N?(olHy`uVBq!ia0vp^(}6gEgBeIFuMu|#QW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;mzb&p>& zJo@NXLHpv|+q+X=Ih4QAJ=(cmb;=U2fR|_wJ)xch@_w zQ<%E8!|3k%?B_GGQ}ZD+yr)bPc{$Crre9Y+pkAcMuzL>o z0lnu;8&2$Ly8y^^DkA_Wkt) zZHJq$R!Dz;{Y9qOQ>DCN+0>_-H_xs*^EGk(@gl|k{ombR*3bABxbCT}PX3>y+R3Z! rEEi + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::diag_e_static_hmc< M, BaseRNG > Member List
+
+
+ +

This is the complete list of members for stan::mcmc::diag_e_static_hmc< M, BaseRNG >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_epsilonstan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
_epsilon_jitterstan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
_err_streamstan::mcmc::base_mcmcprotected
_hamiltonianstan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
_integratorstan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
_namestan::mcmc::base_mcmcprotected
_nom_epsilonstan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
_out_streamstan::mcmc::base_mcmcprotected
_rand_intstan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
_rand_uniformstan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
_update_L()stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlineprotected
_zstan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
base_hmc(M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
base_mcmc(std::ostream *o, std::ostream *e)stan::mcmc::base_mcmcinline
base_static_hmc(M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
diag_e_static_hmc(M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)stan::mcmc::diag_e_static_hmc< M, BaseRNG >inline
get_current_stepsize()stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
get_L()stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
get_nominal_stepsize()stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
get_sampler_diagnostic_names(std::vector< std::string > &model_names, std::vector< std::string > &names)stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_diagnostics(std::vector< double > &values)stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_param_names(std::vector< std::string > &names)stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_params(std::vector< double > &values)stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_stepsize_jitter()stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
get_T()stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
init_stepsize()stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
L_stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
name()stan::mcmc::base_mcmcinline
sample_stepsize()stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
seed(const Eigen::VectorXd &q)stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
set_nominal_stepsize(const double e)stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
set_nominal_stepsize_and_L(const double e, const int l)stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
set_nominal_stepsize_and_T(const double e, const double t)stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
set_stepsize_jitter(const double j)stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
set_T(const double t)stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
T_stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >protected
transition(sample &init_sample)stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
write_sampler_param_names(std::ostream &o)stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
write_sampler_params(std::ostream &o)stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
write_sampler_state(std::ostream *o)stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
z()stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
~base_mcmc()stan::mcmc::base_mcmcinlinevirtual
~base_static_hmc()stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1diag__e__static__hmc.html b/doc/api/html/classstan_1_1mcmc_1_1diag__e__static__hmc.html new file mode 100644 index 00000000000..78308d3f191 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1diag__e__static__hmc.html @@ -0,0 +1,262 @@ + + + + + +Stan: stan::mcmc::diag_e_static_hmc< M, BaseRNG > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::diag_e_static_hmc< M, BaseRNG > Class Template Reference
+
+
+ +

#include <diag_e_static_hmc.hpp>

+
+Inheritance diagram for stan::mcmc::diag_e_static_hmc< M, BaseRNG >:
+
+
+ + +stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_mcmc +stan::mcmc::adapt_diag_e_static_hmc< M, BaseRNG > + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 diag_e_static_hmc (M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)
 
- Public Member Functions inherited from stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >
 base_static_hmc (M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)
 
 ~base_static_hmc ()
 
sample transition (sample &init_sample)
 
void write_sampler_param_names (std::ostream &o)
 
void write_sampler_params (std::ostream &o)
 
void get_sampler_param_names (std::vector< std::string > &names)
 
void get_sampler_params (std::vector< double > &values)
 
void set_nominal_stepsize_and_T (const double e, const double t)
 
void set_nominal_stepsize_and_L (const double e, const int l)
 
void set_T (const double t)
 
void set_nominal_stepsize (const double e)
 
double get_T ()
 
int get_L ()
 
- Public Member Functions inherited from stan::mcmc::base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >
 base_hmc (M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)
 
void write_sampler_state (std::ostream *o)
 
void get_sampler_diagnostic_names (std::vector< std::string > &model_names, std::vector< std::string > &names)
 
void get_sampler_diagnostics (std::vector< double > &values)
 
void seed (const Eigen::VectorXd &q)
 
void init_stepsize ()
 
diag_e_pointz ()
 
double get_nominal_stepsize ()
 
double get_current_stepsize ()
 
virtual void set_stepsize_jitter (const double j)
 
double get_stepsize_jitter ()
 
void sample_stepsize ()
 
- Public Member Functions inherited from stan::mcmc::base_mcmc
 base_mcmc (std::ostream *o, std::ostream *e)
 
virtual ~base_mcmc ()
 
std::string name ()
 
+ + + + + + + + + +

+Additional Inherited Members

- Protected Member Functions inherited from stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >
void _update_L ()
 
- Protected Attributes inherited from stan::mcmc::base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >
double T_
 
int L_
 
+

Detailed Description

+

template<typename M, class BaseRNG>
+class stan::mcmc::diag_e_static_hmc< M, BaseRNG >

+ + +

Definition at line 18 of file diag_e_static_hmc.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::mcmc::diag_e_static_hmc< M, BaseRNG >::diag_e_static_hmc (M & m,
BaseRNG & rng,
std::ostream * o = &std::cout,
std::ostream * e = 0 
)
+
+inline
+
+ +

Definition at line 26 of file diag_e_static_hmc.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1diag__e__static__hmc.png b/doc/api/html/classstan_1_1mcmc_1_1diag__e__static__hmc.png new file mode 100644 index 0000000000000000000000000000000000000000..7a63181e89c7be317e231f9659bc233e3eb7860a GIT binary patch literal 3332 zcmd6qX;4#H7RSRdhE_8qAVC%p0u(s@{9|p1SAOy>y+?BE6rBHt&yXTe{4fRiK2eA&Qwk=lM~(586^JCdYDn!mav3+FjnL%;COtO^2t zE7nLOAANi&$IF!)r-TkCGs<(bO+yU$UQ*+G_DfCRw04=0)(_>RsPgD!VY3j`A(0wk z-h?vkzLi%$kyDwwFrCm3^bk)v=T}e`*gMA0y~*_!>gc&886|_mR<`GPzx%JLU_SXi z=N@CA?V+;U@;R<@z?`U@WL4yQ({AyOba=n>ZW)s1NB*?C7L+Ne971wJs`{4areG~p z3*A5nG+9Hm z?KbAy7`Mvoty#mfNPckGFT;`YGaRpD!*^Op%!9$(imU4lv)h;8Q3%WL{w4M zd;;Xta43`J-Qam1JpDI8-TmvmWf+Ab!;b+GUL*I?4tP%6q^ZFE@EwW{$#8fe(uenL zE!}8vJ-xD@`8?RGaqV+JtClmpIAThgJdl7hHAnQ9ooowiDu*aqRl?!a=1`AUc}UUT z{xTt0k8t|+dTrcP$0si*x>v(OiDC-?YIQF`J7T}IkvTzcw5Kb%{$H^ z?zQy?r^%$kn}TJBF31ZcKYh$X5$)ML@_6CULmmBH7f4^#rf(Y#8pSR2B~fyCmr>kl zgSskYv2(+kk5bW74}RBfb1dWHDYT9YSNW#g*eTs|sbUN%EYmPR)3iH1(&{#02O{t? z2^zdkSVSl*p^qROBatxlGWbto?8hA}*lA^^3T~X;Vz-GvoXoAhO?B^ZE`y2{pFROd zTTF(S0%q$s1pX!WO(ziS|6_@`sJgj~!V6;J4Icu*OAL&dc2bHMZz9TqH2;gME-N5y z!#~UNj5WCuV={u|L){EWlR~G)HJDj<#2SnlJ9eQ*q=c62qrO>RsP9=GN10+r;~^iY z;Aj;zL+B`hm<}2uhDdxlo=VBCA`HIlj5C^Yr&kF&(=SuX`qPXbxnI}}h4xx)qN&|S ztF80mqqWNH6L!5l(ljOA{h<7X%Tg|RN=af2_vPghi?D7!-hH^Pieo+gzTkL&hK2r6 z6VDS>qCEYqs$WghCaocp17MW$9V5O5JqtCaIL3eZ!M!>k(a=9mh-bd)FEo*?hIh{s zbic-P?zJ7c@__pO-Hx=vSthL(bx-RfQAZH)qw4w-F8;SGz2tBe)0%9|UEZ@v{Dd-_ z=9}NLM$?CtNmmN@6E4$H!I|r4I1+E8cHB&@Tk^P(?Zjn>8nmrS1TZkCVN6TEk%yoq7tDBbORQQ5d`liXwph8&70}n5W}Guk2gDw&H)dy0Y)Az$sR0 zhNuK5u2gBZz~Eh5aGDbn1U8~ZdhQ7%zmwrF310?qD%I`!<4tcD8gcV!$ko{=sGCvw zf}n%{lc}r~R!QehA*RaN1!Kk_5f<8ghqX@~tjx%RzKTyKy}wAD!rwnigbEi`O$yXU zKT}_XE8A5le!TBo!t}1n&9=N|!);;jCrnWN@uPciVXtz*{8B-tDw5Aozt*$Xo^N@6 zOA19-rgrdQ;BR^L{z!hvY63*lxAv+nHmIvIiP90aGJekTBC9*=2%wGp2$EmNYfPP5 z%iREn?N~B0G}$oxztJW92*mUxO3$A%lS{>4BpxAbk3iyeCG| zJU(&lg`+S0f~4T3E50G-eQ7Gwv-q&7xDy9ivL9wXFofGj>bdeW%e!<4bcOhUA)-#4 znoy)*W9FHjH`GWBcI>0uLOntVUr2|1wNK!}x;(?lFtDNnd2V8Eo@FK9uNHf!l~~gT zo3THwAG2WFoegd0zYcVeF$)|Om5N+Zl_SgO=f(oNyF3koztO= z1gYSEtuV$QBQ4Z7it{}q3uTyXf1foTY$7&2TCRlT%dPzssL>o5NT)#*%im>0Q}04( z@POYJ6CgX@snkq9mUoJkhf@_I2hz7bw#T7pS9@aR>y6PU| z=dpA2or|wOzPy@YM695OMI~@PLwSCig5rw>b*ygpO$U12XHj~pBRiXuP}FW~sbABj zZ7KIF(_k-_3=06qzMc1tEo#V~Y$IkJ*xNt5qCK_+#ndMR>IwRuaLsyK`3WJe6eIrN zQ-L>O+lj#I9&}N%tNhNvulMcHv>_y)6@)Ilc6E&cdE6Asvl_^H9TS&xG%|O^Ot7&#w{#Ap)#BZV-of3<#Eh^19R@;pbb0xXE0?F_W z<_ANt=4s(>Dy&IbC}x*b#k1T%{IB~fQB0*91HIPoMDHj&Y|!1(K}Lm%6vP)UbbZvI z;j8HZKH8v*$f?z$I;MTjd=>~V@)!$)quW=}u=N752p>_xW6zfZ*9K&$)c3RfR#l7B iFb + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::expl_leapfrog< H, P > Member List
+
+
+ +

This is the complete list of members for stan::mcmc::expl_leapfrog< H, P >, including all inherited members.

+ + + + + + + + + + +
_out_streamstan::mcmc::base_integrator< H, P >protected
base_integrator(std::ostream *o)stan::mcmc::base_integrator< H, P >inline
base_leapfrog(std::ostream *o)stan::mcmc::base_leapfrog< H, P >inline
begin_update_p(P &z, H &hamiltonian, double epsilon)stan::mcmc::expl_leapfrog< H, P >inlinevirtual
end_update_p(P &z, H &hamiltonian, double epsilon)stan::mcmc::expl_leapfrog< H, P >inlinevirtual
evolve(P &z, H &hamiltonian, const double epsilon)stan::mcmc::base_leapfrog< H, P >inlinevirtual
expl_leapfrog(std::ostream *o=0)stan::mcmc::expl_leapfrog< H, P >inline
update_q(P &z, H &hamiltonian, double epsilon)stan::mcmc::expl_leapfrog< H, P >inlinevirtual
verbose_evolve(P &z, H &hamiltonian, const double epsilon)stan::mcmc::base_leapfrog< H, P >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1expl__leapfrog.html b/doc/api/html/classstan_1_1mcmc_1_1expl__leapfrog.html new file mode 100644 index 00000000000..a64f0723e89 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1expl__leapfrog.html @@ -0,0 +1,329 @@ + + + + + +Stan: stan::mcmc::expl_leapfrog< H, P > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::expl_leapfrog< H, P > Class Template Reference
+
+
+ +

#include <expl_leapfrog.hpp>

+
+Inheritance diagram for stan::mcmc::expl_leapfrog< H, P >:
+
+
+ + +stan::mcmc::base_leapfrog< H, P > +stan::mcmc::base_integrator< H, P > + +
+ + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 expl_leapfrog (std::ostream *o=0)
 
void begin_update_p (P &z, H &hamiltonian, double epsilon)
 
void update_q (P &z, H &hamiltonian, double epsilon)
 
void end_update_p (P &z, H &hamiltonian, double epsilon)
 
- Public Member Functions inherited from stan::mcmc::base_leapfrog< H, P >
 base_leapfrog (std::ostream *o)
 
void evolve (P &z, H &hamiltonian, const double epsilon)
 
void verbose_evolve (P &z, H &hamiltonian, const double epsilon)
 
- Public Member Functions inherited from stan::mcmc::base_integrator< H, P >
 base_integrator (std::ostream *o)
 
+ + + + +

+Additional Inherited Members

- Protected Attributes inherited from stan::mcmc::base_integrator< H, P >
std::ostream * _out_stream
 
+

Detailed Description

+

template<typename H, typename P>
+class stan::mcmc::expl_leapfrog< H, P >

+ + +

Definition at line 12 of file expl_leapfrog.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename H, typename P>
+ + + + + +
+ + + + + + + + +
stan::mcmc::expl_leapfrog< H, P >::expl_leapfrog (std::ostream * o = 0)
+
+inline
+
+ +

Definition at line 16 of file expl_leapfrog.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename H, typename P>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::mcmc::expl_leapfrog< H, P >::begin_update_p (P & z,
H & hamiltonian,
double epsilon 
)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_leapfrog< H, P >.

+ +

Definition at line 18 of file expl_leapfrog.hpp.

+ +
+
+ +
+
+
+template<typename H, typename P>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::mcmc::expl_leapfrog< H, P >::end_update_p (P & z,
H & hamiltonian,
double epsilon 
)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_leapfrog< H, P >.

+ +

Definition at line 27 of file expl_leapfrog.hpp.

+ +
+
+ +
+
+
+template<typename H, typename P>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::mcmc::expl_leapfrog< H, P >::update_q (P & z,
H & hamiltonian,
double epsilon 
)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_leapfrog< H, P >.

+ +

Definition at line 22 of file expl_leapfrog.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1expl__leapfrog.png b/doc/api/html/classstan_1_1mcmc_1_1expl__leapfrog.png new file mode 100644 index 0000000000000000000000000000000000000000..7d2e0b47353b9fdbca1ae69074c2c98d50c331bd GIT binary patch literal 1215 zcmeAS@N?(olHy`uVBq!ia0vp^H-Wf=gBeK1ZrUdXq$C1-LR|m<{|{uoc=NTi|Ih>= z3ycpOIKbL@M;^%KC<*clW&kPzfvcxNj2IYL{5)M8Ln;{G&b{5ItjNRKeL3jg|H z6tOSdDcLKc51c+#meYCM_gCGsMGLOf@a-z?eQY=JXYO;M{^w0+WEQJ>i&c8)&GNF> zeJH+S;?slfZ8hsnvOXvMmEFJj$M*Bb-p)Alaj(<1+^v6~f4+Km%I%Evcbm=>UwMC~ zbz|QRt{~e}^CzpGzq4SEvFE}oH|NGqoLU~{`JZ`{!p*cbd3!gX5?ofYa&qkc%}uM% z99ygP_NkZSx}&!u-Y+kb*t}v*@5%`&TMc*Zx}|Y)%crk$wMv`b&s6!_827U$?q^Ng znl%|$yRG~%vXU7@|T$xc$a#A ztN7A&P4}kon&2&UC*5*cGJKnP7U=RCHEc6E!2s03oZ(GKpd$XViEnI|=On8uAPY=R zsI1hTn&LPq?&{Xh3te}7iRE1rIir43$i?du?%vquRQBlQiL`%D1+Goz_$D)dZtc?A zOJ5gHl`Wnt;xos0_YK#@`C^}6Lt;S;7z+oWv2f;Ho>}qD|7P7cP4+6B{$!-=-3E+< z3tso{bVNUxvF1sS@v#$XM}Aq?rRS|Xam+UMp7QOoJO4ialw!Z5S88-VaR26JqbZ>i zY-Yx(c+cC}82_-nyv((%BK@efwF>v7++(lKmOnd@w{LUvc{f$*?Vq+xTc(hzJ8ff? z{nWh@wPshiWo_=;l~e56RcDs5zv+Iz zriy1$NpQWtn&*FKng+XK%Y~&J46<1h7`H5SWVB<+?6!UFsCd{2bb^fgL36>pSP3CPjTUA+Oy~fLaZpxjK&)-vKZ@qg^Z^!v(hWp*O z9oyo%EhqW-G>tn;-dmqPb3ZrWuHwJkn%r4&6GST`C#XK&;?KJKlKJ*c?^86gva8NL znYA`4Zfdvv>-3zdId_7exo*ncoxCaI!TS|X&n#b+mqoN?y^L9M#{d1AZ9Th}J}P>5 z=cee*mvckoPBTU_+@5oF--|HWcl(Xq%RbMQtutG7bH~&brFst6k~CL;tq+mj+q!mh z`qqn^nXZKVp2zs7Z{2mfjTS4PGlc&Vh>W~(Zt)j$-Wg@a5AyeJer3pT=h}Z&<{#Sd iwEJf%k75hoSN>4%@PrBXBs74f4TGnvpUXO@geCwYn_Z6p literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1mcmc_1_1ps__point-members.html b/doc/api/html/classstan_1_1mcmc_1_1ps__point-members.html new file mode 100644 index 00000000000..03b1cf693aa --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1ps__point-members.html @@ -0,0 +1,124 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::ps_point Member List
+
+
+ +

This is the complete list of members for stan::mcmc::ps_point, including all inherited members.

+ + + + + + + + + + + + + +
_fast_matrix_copy(Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &v_to, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &v_from)stan::mcmc::ps_pointinlineprotected
_fast_vector_copy(Eigen::Matrix< T, Eigen::Dynamic, 1 > &v_to, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v_from)stan::mcmc::ps_pointinlineprotected
gstan::mcmc::ps_point
get_param_names(std::vector< std::string > &model_names, std::vector< std::string > &names)stan::mcmc::ps_pointinlinevirtual
get_params(std::vector< double > &values)stan::mcmc::ps_pointinlinevirtual
operator=(const ps_point &z)stan::mcmc::ps_pointinline
pstan::mcmc::ps_point
ps_point(int n)stan::mcmc::ps_pointinline
ps_point(const ps_point &z)stan::mcmc::ps_pointinline
qstan::mcmc::ps_point
Vstan::mcmc::ps_point
write_metric(std::ostream *o)stan::mcmc::ps_pointinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1ps__point.html b/doc/api/html/classstan_1_1mcmc_1_1ps__point.html new file mode 100644 index 00000000000..c83a678daa3 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1ps__point.html @@ -0,0 +1,472 @@ + + + + + +Stan: stan::mcmc::ps_point Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::ps_point Class Reference
+
+
+ +

#include <ps_point.hpp>

+
+Inheritance diagram for stan::mcmc::ps_point:
+
+
+ + +stan::mcmc::dense_e_point +stan::mcmc::diag_e_point +stan::mcmc::unit_e_point + +
+ + + + + + + + + + + + + + +

+Public Member Functions

 ps_point (int n)
 
 ps_point (const ps_point &z)
 
ps_pointoperator= (const ps_point &z)
 
virtual void get_param_names (std::vector< std::string > &model_names, std::vector< std::string > &names)
 
virtual void get_params (std::vector< double > &values)
 
virtual void write_metric (std::ostream *o)
 
+ + + + + + + + + +

+Public Attributes

Eigen::VectorXd q
 
Eigen::VectorXd p
 
double V
 
Eigen::VectorXd g
 
+ + + + + + + +

+Protected Member Functions

template<typename T >
void _fast_vector_copy (Eigen::Matrix< T, Eigen::Dynamic, 1 > &v_to, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v_from)
 
template<typename T >
void _fast_matrix_copy (Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &v_to, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &v_from)
 
+

Detailed Description

+
+

Definition at line 16 of file ps_point.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::mcmc::ps_point::ps_point (int n)
+
+inline
+
+ +

Definition at line 20 of file ps_point.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
stan::mcmc::ps_point::ps_point (const ps_pointz)
+
+inline
+
+ +

Definition at line 22 of file ps_point.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::mcmc::ps_point::_fast_matrix_copy (Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & v_to,
const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & v_from 
)
+
+inlineprotected
+
+ +

Definition at line 85 of file ps_point.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::mcmc::ps_point::_fast_vector_copy (Eigen::Matrix< T, Eigen::Dynamic, 1 > & v_to,
const Eigen::Matrix< T, Eigen::Dynamic, 1 > & v_from 
)
+
+inlineprotected
+
+ +

Definition at line 79 of file ps_point.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
virtual void stan::mcmc::ps_point::get_param_names (std::vector< std::string > & model_names,
std::vector< std::string > & names 
)
+
+inlinevirtual
+
+ +

Definition at line 52 of file ps_point.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
virtual void stan::mcmc::ps_point::get_params (std::vector< double > & values)
+
+inlinevirtual
+
+ +

Definition at line 62 of file ps_point.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
ps_point& stan::mcmc::ps_point::operator= (const ps_pointz)
+
+inline
+
+ +

Definition at line 30 of file ps_point.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
virtual void stan::mcmc::ps_point::write_metric (std::ostream * o)
+
+inlinevirtual
+
+ +

Reimplemented in stan::mcmc::dense_e_point, and stan::mcmc::diag_e_point.

+ +

Definition at line 71 of file ps_point.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
Eigen::VectorXd stan::mcmc::ps_point::g
+
+ +

Definition at line 50 of file ps_point.hpp.

+ +
+
+ +
+
+ + + + +
Eigen::VectorXd stan::mcmc::ps_point::p
+
+ +

Definition at line 47 of file ps_point.hpp.

+ +
+
+ +
+
+ + + + +
Eigen::VectorXd stan::mcmc::ps_point::q
+
+ +

Definition at line 46 of file ps_point.hpp.

+ +
+
+ +
+
+ + + + +
double stan::mcmc::ps_point::V
+
+ +

Definition at line 49 of file ps_point.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1ps__point.png b/doc/api/html/classstan_1_1mcmc_1_1ps__point.png new file mode 100644 index 0000000000000000000000000000000000000000..cab4bfca1da721f74b1254589e8fc8fef2893c5a GIT binary patch literal 1105 zcmeAS@N?(olHy`uVBq!ia0y~yVEhhb2XHV0N#mnuKpcqxpAgso|NjG-FW!7D?LRaD z$O7X72M(}y-jN4#IZA^3f*F8{K;Y`B5F-W#<_DfGjv*C{Z|A<DVE3{E?%V&BRt$W^ni;77v!e|P;WzPkLS zx%j5?hKhZ!{ z%rNbSwS&#>+PV!!CBHA#0ynkn{UCED4=lidx<^MbPkJ*5s@lSH>^<{Q@=ImuY@>%iy z-QTsplixFhA9!!=P#d#%-8Vjg{=Ljs+L5sPWs|c@84VbwFJm=e2nD+H>cwqh`~lM6 z_yT0-mUXkQ-~on?U^HqdA%_?en`2S#?Q2_dZ?`cOWY)b1*}9=X<2z6mGVdzwE_(G2x#1KX*M1K02Z9k>;^7!^5Ba zCLaHPpmU1KoxdC75ZO(?$}WLzPnpCw-C*RLwl8?P&jI@9n1T_M11qu8_ai z6Rf#^ldC`b*WY@Y)~Di?Jug4}9y`hIgldVNvJ%+;-`d lbv|KdrUdOWvKRTv|KxIdnz6&-WMKYh@O1TaS?83{1OV3M7+3%R literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1mcmc_1_1sample-members.html b/doc/api/html/classstan_1_1mcmc_1_1sample-members.html new file mode 100644 index 00000000000..541738da791 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1sample-members.html @@ -0,0 +1,122 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::sample Member List
+
+
+ +

This is the complete list of members for stan::mcmc::sample, including all inherited members.

+ + + + + + + + + + + +
accept_stat() const stan::mcmc::sampleinline
cont_params(int k) const stan::mcmc::sampleinline
cont_params(Eigen::VectorXd &x) const stan::mcmc::sampleinline
cont_params() const stan::mcmc::sampleinline
get_sample_param_names(std::vector< std::string > &names)stan::mcmc::sampleinline
get_sample_params(std::vector< double > &values)stan::mcmc::sampleinline
log_prob() const stan::mcmc::sampleinline
sample(const Eigen::VectorXd &q, double log_prob, double stat)stan::mcmc::sampleinline
size_cont() const stan::mcmc::sampleinline
~sample()stan::mcmc::sampleinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1sample.html b/doc/api/html/classstan_1_1mcmc_1_1sample.html new file mode 100644 index 00000000000..a388095bf06 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1sample.html @@ -0,0 +1,417 @@ + + + + + +Stan: stan::mcmc::sample Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::sample Class Reference
+
+
+ +

#include <sample.hpp>

+ + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 sample (const Eigen::VectorXd &q, double log_prob, double stat)
 
virtual ~sample ()
 
int size_cont () const
 
double cont_params (int k) const
 
void cont_params (Eigen::VectorXd &x) const
 
const Eigen::VectorXd & cont_params () const
 
double log_prob () const
 
double accept_stat () const
 
void get_sample_param_names (std::vector< std::string > &names)
 
void get_sample_params (std::vector< double > &values)
 
+

Detailed Description

+
+

Definition at line 13 of file sample.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
stan::mcmc::sample::sample (const Eigen::VectorXd & q,
double log_prob,
double stat 
)
+
+inline
+
+ +

Definition at line 23 of file sample.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
virtual stan::mcmc::sample::~sample ()
+
+inlinevirtual
+
+ +

Definition at line 30 of file sample.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + +
double stan::mcmc::sample::accept_stat () const
+
+inline
+
+ +

Definition at line 52 of file sample.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
double stan::mcmc::sample::cont_params (int k) const
+
+inline
+
+ +

Definition at line 36 of file sample.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::mcmc::sample::cont_params (Eigen::VectorXd & x) const
+
+inline
+
+ +

Definition at line 40 of file sample.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
const Eigen::VectorXd& stan::mcmc::sample::cont_params () const
+
+inline
+
+ +

Definition at line 44 of file sample.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::mcmc::sample::get_sample_param_names (std::vector< std::string > & names)
+
+inline
+
+ +

Definition at line 56 of file sample.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::mcmc::sample::get_sample_params (std::vector< double > & values)
+
+inline
+
+ +

Definition at line 61 of file sample.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
double stan::mcmc::sample::log_prob () const
+
+inline
+
+ +

Definition at line 48 of file sample.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
int stan::mcmc::sample::size_cont () const
+
+inline
+
+ +

Definition at line 32 of file sample.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1stepsize__adaptation-members.html b/doc/api/html/classstan_1_1mcmc_1_1stepsize__adaptation-members.html new file mode 100644 index 00000000000..03fea45407c --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1stepsize__adaptation-members.html @@ -0,0 +1,134 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::stepsize_adaptation Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1stepsize__adaptation.html b/doc/api/html/classstan_1_1mcmc_1_1stepsize__adaptation.html new file mode 100644 index 00000000000..90dda077429 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1stepsize__adaptation.html @@ -0,0 +1,729 @@ + + + + + +Stan: stan::mcmc::stepsize_adaptation Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::stepsize_adaptation Class Reference
+
+
+ +

#include <stepsize_adaptation.hpp>

+
+Inheritance diagram for stan::mcmc::stepsize_adaptation:
+
+
+ + +stan::mcmc::base_adaptation + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 stepsize_adaptation ()
 
void set_mu (double m)
 
void set_delta (double d)
 
void set_gamma (double g)
 
void set_kappa (double k)
 
void set_t0 (double t)
 
double get_mu ()
 
double get_delta ()
 
double get_gamma ()
 
double get_kappa ()
 
double get_t0 ()
 
void restart ()
 
void learn_stepsize (double &epsilon, double adapt_stat)
 
void complete_adaptation (double &epsilon)
 
+ + + + + + + + + + + + + + + + + +

+Protected Attributes

double _counter
 
double _s_bar
 
double _x_bar
 
double _mu
 
double _delta
 
double _gamma
 
double _kappa
 
double _t0
 
+

Detailed Description

+
+

Definition at line 11 of file stepsize_adaptation.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::mcmc::stepsize_adaptation::stepsize_adaptation ()
+
+inline
+
+ +

Definition at line 15 of file stepsize_adaptation.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
void stan::mcmc::stepsize_adaptation::complete_adaptation (double & epsilon)
+
+inline
+
+ +

Definition at line 57 of file stepsize_adaptation.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
double stan::mcmc::stepsize_adaptation::get_delta ()
+
+inline
+
+ +

Definition at line 26 of file stepsize_adaptation.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
double stan::mcmc::stepsize_adaptation::get_gamma ()
+
+inline
+
+ +

Definition at line 27 of file stepsize_adaptation.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
double stan::mcmc::stepsize_adaptation::get_kappa ()
+
+inline
+
+ +

Definition at line 28 of file stepsize_adaptation.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
double stan::mcmc::stepsize_adaptation::get_mu ()
+
+inline
+
+ +

Definition at line 25 of file stepsize_adaptation.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
double stan::mcmc::stepsize_adaptation::get_t0 ()
+
+inline
+
+ +

Definition at line 29 of file stepsize_adaptation.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::mcmc::stepsize_adaptation::learn_stepsize (double & epsilon,
double adapt_stat 
)
+
+inline
+
+ +

Definition at line 37 of file stepsize_adaptation.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
void stan::mcmc::stepsize_adaptation::restart ()
+
+inlinevirtual
+
+ +

Reimplemented from stan::mcmc::base_adaptation.

+ +

Definition at line 31 of file stepsize_adaptation.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::mcmc::stepsize_adaptation::set_delta (double d)
+
+inline
+
+ +

Definition at line 20 of file stepsize_adaptation.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::mcmc::stepsize_adaptation::set_gamma (double g)
+
+inline
+
+ +

Definition at line 21 of file stepsize_adaptation.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::mcmc::stepsize_adaptation::set_kappa (double k)
+
+inline
+
+ +

Definition at line 22 of file stepsize_adaptation.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::mcmc::stepsize_adaptation::set_mu (double m)
+
+inline
+
+ +

Definition at line 19 of file stepsize_adaptation.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::mcmc::stepsize_adaptation::set_t0 (double t)
+
+inline
+
+ +

Definition at line 23 of file stepsize_adaptation.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
double stan::mcmc::stepsize_adaptation::_counter
+
+protected
+
+ +

Definition at line 63 of file stepsize_adaptation.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
double stan::mcmc::stepsize_adaptation::_delta
+
+protected
+
+ +

Definition at line 67 of file stepsize_adaptation.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
double stan::mcmc::stepsize_adaptation::_gamma
+
+protected
+
+ +

Definition at line 68 of file stepsize_adaptation.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
double stan::mcmc::stepsize_adaptation::_kappa
+
+protected
+
+ +

Definition at line 69 of file stepsize_adaptation.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
double stan::mcmc::stepsize_adaptation::_mu
+
+protected
+
+ +

Definition at line 66 of file stepsize_adaptation.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
double stan::mcmc::stepsize_adaptation::_s_bar
+
+protected
+
+ +

Definition at line 64 of file stepsize_adaptation.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
double stan::mcmc::stepsize_adaptation::_t0
+
+protected
+
+ +

Definition at line 70 of file stepsize_adaptation.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
double stan::mcmc::stepsize_adaptation::_x_bar
+
+protected
+
+ +

Definition at line 65 of file stepsize_adaptation.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1stepsize__adaptation.png b/doc/api/html/classstan_1_1mcmc_1_1stepsize__adaptation.png new file mode 100644 index 0000000000000000000000000000000000000000..d840627138e454b76b4ce8ea71cf1a8af4e63a36 GIT binary patch literal 732 zcmeAS@N?(olHy`uVBq!ia0vp^dx1EBgBeIxUv7y5QW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;q|C8pP zoCyjqmu-*L7ZRF$En)WMggfEWQX|_$yH$8sdFp%G&H6Iw$ztPQ3ZCy@g%v!Wqkb*_ z`pSP+dsXJHc9!2Ze~w&s*Wbq{%J=kd$$0Z5^qiz}ZjsL0%&xhguH9Z7H#MYZ+P_ZW zh2LbJ-kEn;Cu%oWV1V4!Xw!XX{kTpoE~)XHZ@y}~siyU|MB}B|FK^#z+xc6}dTB|J z1IkV#fS3vKwqI)ZUe?H}DzNcRP z^49k^&5riY6aMY6DJg+5x!P}g5rf^z^QCnS^Y*;>zB`*QQKhOO_%CNw!~3jD%s( + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::stepsize_adapter Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1stepsize__adapter.html b/doc/api/html/classstan_1_1mcmc_1_1stepsize__adapter.html new file mode 100644 index 00000000000..2b2166a1305 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1stepsize__adapter.html @@ -0,0 +1,232 @@ + + + + + +Stan: stan::mcmc::stepsize_adapter Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::stepsize_adapter Class Reference
+
+
+ +

#include <stepsize_adapter.hpp>

+
+Inheritance diagram for stan::mcmc::stepsize_adapter:
+
+
+ + +stan::mcmc::base_adapter +stan::mcmc::adapt_unit_e_nuts< M, BaseRNG > +stan::mcmc::adapt_unit_e_static_hmc< M, BaseRNG > + +
+ + + + + + + + + + + + + + + +

+Public Member Functions

 stepsize_adapter ()
 
stepsize_adaptationget_stepsize_adaptation ()
 
- Public Member Functions inherited from stan::mcmc::base_adapter
 base_adapter ()
 
virtual void engage_adaptation ()
 
virtual void disengage_adaptation ()
 
bool adapting ()
 
+ + + + + + +

+Protected Attributes

stepsize_adaptation _stepsize_adaptation
 
- Protected Attributes inherited from stan::mcmc::base_adapter
bool _adapt_flag
 
+

Detailed Description

+
+

Definition at line 11 of file stepsize_adapter.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::mcmc::stepsize_adapter::stepsize_adapter ()
+
+inline
+
+ +

Definition at line 15 of file stepsize_adapter.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stepsize_adaptation& stan::mcmc::stepsize_adapter::get_stepsize_adaptation ()
+
+inline
+
+ +

Definition at line 17 of file stepsize_adapter.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
stepsize_adaptation stan::mcmc::stepsize_adapter::_stepsize_adaptation
+
+protected
+
+ +

Definition at line 23 of file stepsize_adapter.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1stepsize__adapter.png b/doc/api/html/classstan_1_1mcmc_1_1stepsize__adapter.png new file mode 100644 index 0000000000000000000000000000000000000000..0faeccdddeb6c88504168c7bafae7df03785f0c4 GIT binary patch literal 2039 zcmc&#c~H|y7EU4|fFg$ykwY8}1aUcBN4YOSnQ(<8GlFD5cNo2w_k`6CehGh(P9-DgW52-P+pyYr3jmzpnSXyZXKFeJ{t$ z(?wZHO9=!5DWkq~_5pz)L_oixunmw7)BpG$STw!dF(;)`DWJ{^S8(}#KLOgGlfhs> zb0+nGtwN%Yr!NR_l8uq)n7@NSuxymGBjz%AVQL}ip1bPFnd?u^@TB^^&p7h0oX=!Z z+6^x0mUTzuPt^5_W^!jO;IkGa^fu@xGXvDm2(%C6gt`7%@`G}@tY}vT!rw_zVXA&$G^m0wtn#uw`uVq zF(Lly-jP5m4ZAP?5zdfnQ-lB1m`3g?1g^yA6J07i19hb~Ds*5a;?jla zDf}>M2!Xeiy>}d3UpK@mGHi;qdsTbLY>%jI75n;{B1){~>M;K<&sZ|4`9;nKZlPgQ zj13Tl(l46#3Ha)&c6ZDbEn*(mLVMUWmBPFZytRr6cqRlNuzjnX=rp{KRsHrz9(o}> z*|vKx7ShKQkHXU~Wu-#l7;7BseW0bKebPio`n%BK40Jo2qC!}xaC4A^@;BqR#i?PXGT`@&P9|F(l-Ano!vyEe5%9~_Ez(L&%HR|{8HP1?YyI{{Gz!YL$As8x&>QUn4f6vV%2m z25V;1(;+FCvxnvHDFJ^`_dW*Px?$%#Dvw{iOoQ zBQfj7TBHnK(gLCg$o-anp!RHosW~=qwO=J>4teEAdy>@@jb?8WXZ5)&MG|EFHm!~D zkZ0|A$w*gEpXSE@;RgMOPM>;d#W8OV2F0uS)5TuX(@dJFr2@Lyf_HlLkcpTSzf)$NF*Lqg+ z9q&~}epF0Qiesy9K5g+f>vPM~vC5G8DC^}gS8fKHUA&~bRdw6dL1JNN`)ovz`UQ4a z1{;4y{Zwq1#vP&v?QOmP&w4XD<>#aio5JKaWV`O{s`*dBWtr`8ID)x4EbvSHi>zLn`J}~;LHD`nBg={EF|?uw@<8qpf(<1 zuwu-O2GaALRyC@@y0>)`eZJ|lGP0h(eC46Q1%*WO{HGt6f%;O z3b`5>I@ayxL}=ix^{?Y0Tauy|kPp zg5Zw{GuzHnsdG!{x^Pok5J8dddfm~ZIQ(_w75aKm3@gE4gniJYBKj&uh0;}5cEF&;TtM8m75ZCoep~ zUUsGoecolNk2@ckPfmHA8w1^748T9|ZsFQWrgK&riDNkSXX26pbFG4+vrU|jZx#`z zGv@5ywe1-)m_p!|%j=fLrhZS|Tx{WUZV5@mTaE0z6vBh)c7BM9eG2WH<=J1y?{d&b zdv9VntAyn!f%stODMFN?x&6qp1plQNiQDX;8;y;$2xw9CId7D>u-jOYd7#_>Rjcqv z@OcfMwqO=cLzvFF1VxiSi5FqUZF~gYvKQ`8PGer&(_BfsUivbgLgl5HnV}X%t1(gA zz(HE$E>G9*CNmItq?D^`h6-fLLktE>`D*~!>|OsIXtL&50oXic-O&ZG7Ym^}Un#s& kEmnuwsL6~=yCVfTefwD7kNVLY=+Yq6Nl)jx6K6C20GmOqg#Z8m literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1mcmc_1_1stepsize__covar__adapter-members.html b/doc/api/html/classstan_1_1mcmc_1_1stepsize__covar__adapter-members.html new file mode 100644 index 00000000000..1623c0f1e88 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1stepsize__covar__adapter-members.html @@ -0,0 +1,123 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::stepsize_covar_adapter Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1stepsize__covar__adapter.html b/doc/api/html/classstan_1_1mcmc_1_1stepsize__covar__adapter.html new file mode 100644 index 00000000000..04c40f9aaae --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1stepsize__covar__adapter.html @@ -0,0 +1,340 @@ + + + + + +Stan: stan::mcmc::stepsize_covar_adapter Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::stepsize_covar_adapter Class Reference
+
+
+ +

#include <stepsize_covar_adapter.hpp>

+
+Inheritance diagram for stan::mcmc::stepsize_covar_adapter:
+
+
+ + +stan::mcmc::base_adapter +stan::mcmc::adapt_dense_e_nuts< M, BaseRNG > +stan::mcmc::adapt_dense_e_static_hmc< M, BaseRNG > + +
+ + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 stepsize_covar_adapter (int n)
 
stepsize_adaptationget_stepsize_adaptation ()
 
covar_adaptationget_covar_adaptation ()
 
void set_window_params (unsigned int num_warmup, unsigned int init_buffer, unsigned int term_buffer, unsigned int base_window, std::ostream *e=0)
 
- Public Member Functions inherited from stan::mcmc::base_adapter
 base_adapter ()
 
virtual void engage_adaptation ()
 
virtual void disengage_adaptation ()
 
bool adapting ()
 
+ + + + + + + + +

+Protected Attributes

stepsize_adaptation _stepsize_adaptation
 
covar_adaptation _covar_adaptation
 
- Protected Attributes inherited from stan::mcmc::base_adapter
bool _adapt_flag
 
+

Detailed Description

+
+

Definition at line 12 of file stepsize_covar_adapter.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::mcmc::stepsize_covar_adapter::stepsize_covar_adapter (int n)
+
+inline
+
+ +

Definition at line 16 of file stepsize_covar_adapter.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + +
covar_adaptation& stan::mcmc::stepsize_covar_adapter::get_covar_adaptation ()
+
+inline
+
+ +

Definition at line 23 of file stepsize_covar_adapter.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
stepsize_adaptation& stan::mcmc::stepsize_covar_adapter::get_stepsize_adaptation ()
+
+inline
+
+ +

Definition at line 19 of file stepsize_covar_adapter.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::mcmc::stepsize_covar_adapter::set_window_params (unsigned int num_warmup,
unsigned int init_buffer,
unsigned int term_buffer,
unsigned int base_window,
std::ostream * e = 0 
)
+
+inline
+
+ +

Definition at line 27 of file stepsize_covar_adapter.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
covar_adaptation stan::mcmc::stepsize_covar_adapter::_covar_adaptation
+
+protected
+
+ +

Definition at line 42 of file stepsize_covar_adapter.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
stepsize_adaptation stan::mcmc::stepsize_covar_adapter::_stepsize_adaptation
+
+protected
+
+ +

Definition at line 41 of file stepsize_covar_adapter.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1stepsize__covar__adapter.png b/doc/api/html/classstan_1_1mcmc_1_1stepsize__covar__adapter.png new file mode 100644 index 0000000000000000000000000000000000000000..d317289dab17282ca1e1ff74a25c85f767f7788c GIT binary patch literal 2090 zcmc(gZBSF$8OH<4sw^*VQLze}wFbg_pfHlit6;>?fGz>t@VXT>h`a?PEFjSVTxwAQ z7ndL;Ao3=&7+L}Xq6B5aH9->AAQTDUY6vO`2ocyoAbYa)L%+1s51r|qxzBmdJZH|i z^S{6If3BSj4lp*{XNW)`j0wk&h9D67ERg?Y`xX#$g9cr}u=gY}6tC54LHbs)oWXcf z0(#Yf>bbZoe23OhSM~y61&3^p6O{wr;}FBcb2vDJSP>cLI0ee`fIa_G%9z z>+VY3-kof;Z_0dfUGKg8bjUhJV=_RsD56@x`M!F}y=C>sA^)4K;R?u=P)thmiwhK? zaKVBdH*9fbGOQKatx-mV-slz}OVW=+3rhiP_Zy}`Y*cKctYF|Ki;%{G%=W2baD`mU z{tfZ?4})+Ji!nDAE*avhAHC4Ld@b`9C`Zp$j1#%dt^H_0jt#EXCFKWI!h}r9FH?6E z`4&|Ts=}B?Sr)F6bDh=C+z3^ulsd5a!$?tKz=a?8tSMNSkt*ZAm8W~GM9A4Dgy%PP zM{c&!?eD{~hbGR(ShlBd?Q|h4aye2IAkN4SD;k3DQ3X4AMVZWH zj1Y%X#f>KLhMsk(t<~5GHz(ZBnTuv;HzK0M*@}2<*z1`ud$7Fl4|51^8J=8|Jb5^l zK1*VDtYwP;m3&sc++3f1B2s<`Gsjd9P6RhXt!^qQPr*v4CPKPSuS#Pa`Gu} zg%cfn%vy5#+;xa0(XOAr+2L=`H~JD5?Tmbpyso&;Z#xy9T&ZkH*ho+;U-792kh$5; zbwX+{ocVIjBlaX*l{_!ZvL7Usg{fnWaMQlX{BqW?rLkZ1s4V4acTxvw=#=+@pqp#j zYp3OAfNNoCEL=06v8X^|B8*##C);|zUTt8h9MieQklBN}ugSdfr?AN(XCEi`8aAe| zD>0u`N)KJnVUoM6bER8*9sV3WibkfyMbVkA;3TBw_iHOwkK*!lfDg(v|G+aNZ4$G_ zIkJLSUnMJ5ch~--=%0$uoQ?cljQUe|+Ps>6z13jXu$dKl*YN%(62R%=F#yrWf$^a> zKwFUxxsnhN!1w;QVbd|VNz#mE2RG4t^|m#mYHfGhw%>*d8bj-c^8$ZY8B*%^xg8-s z5O3&s_kUPi^7w-#OjWQY*y6Z_(E2yn;vg4mLMf`SV(=CU4_Vv+PPGR(60iqXLd3~5 zYXS+F+4&=aTc{x5X7vVE6v%Ccgeydy?>onux!NyLn52Tsj=Q8m2~0Y3#@3lUOa%It zrC6r$>I;BXmurX+YX6k^k~T_Ydj+42Y3!Nop>?5uY2a^Qz+nclrK+R@JV;fyiho!2 zj;j`ilQ zQ#*PYKHRAA0}Gt_p#!`U)yt&!o?dG(mAw2~zI5p))l?Qvlz4|CNsLkQ&BocOgg;KYnN;s|lyu`Wlc&kW$HOj-&cFuBJ7q=H9RQm%3(kULB{fRZb&&4qs{=}oI zkslvZOlMTm6*+loLZD>OL{nR&F%Yv mv-8G1lUcx22hfKZi%8Qh!H6{D;C9g15d?hjQI6lYdA|ZMDgg)p literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1mcmc_1_1stepsize__var__adapter-members.html b/doc/api/html/classstan_1_1mcmc_1_1stepsize__var__adapter-members.html new file mode 100644 index 00000000000..9a7832827f1 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1stepsize__var__adapter-members.html @@ -0,0 +1,123 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::stepsize_var_adapter Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1stepsize__var__adapter.html b/doc/api/html/classstan_1_1mcmc_1_1stepsize__var__adapter.html new file mode 100644 index 00000000000..ca8af2f9e72 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1stepsize__var__adapter.html @@ -0,0 +1,340 @@ + + + + + +Stan: stan::mcmc::stepsize_var_adapter Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::stepsize_var_adapter Class Reference
+
+
+ +

#include <stepsize_var_adapter.hpp>

+
+Inheritance diagram for stan::mcmc::stepsize_var_adapter:
+
+
+ + +stan::mcmc::base_adapter +stan::mcmc::adapt_diag_e_nuts< M, BaseRNG > +stan::mcmc::adapt_diag_e_static_hmc< M, BaseRNG > + +
+ + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 stepsize_var_adapter (int n)
 
stepsize_adaptationget_stepsize_adaptation ()
 
var_adaptationget_var_adaptation ()
 
void set_window_params (unsigned int num_warmup, unsigned int init_buffer, unsigned int term_buffer, unsigned int base_window, std::ostream *e=0)
 
- Public Member Functions inherited from stan::mcmc::base_adapter
 base_adapter ()
 
virtual void engage_adaptation ()
 
virtual void disengage_adaptation ()
 
bool adapting ()
 
+ + + + + + + + +

+Protected Attributes

stepsize_adaptation _stepsize_adaptation
 
var_adaptation _var_adaptation
 
- Protected Attributes inherited from stan::mcmc::base_adapter
bool _adapt_flag
 
+

Detailed Description

+
+

Definition at line 12 of file stepsize_var_adapter.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::mcmc::stepsize_var_adapter::stepsize_var_adapter (int n)
+
+inline
+
+ +

Definition at line 16 of file stepsize_var_adapter.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stepsize_adaptation& stan::mcmc::stepsize_var_adapter::get_stepsize_adaptation ()
+
+inline
+
+ +

Definition at line 19 of file stepsize_var_adapter.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
var_adaptation& stan::mcmc::stepsize_var_adapter::get_var_adaptation ()
+
+inline
+
+ +

Definition at line 23 of file stepsize_var_adapter.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::mcmc::stepsize_var_adapter::set_window_params (unsigned int num_warmup,
unsigned int init_buffer,
unsigned int term_buffer,
unsigned int base_window,
std::ostream * e = 0 
)
+
+inline
+
+ +

Definition at line 27 of file stepsize_var_adapter.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
stepsize_adaptation stan::mcmc::stepsize_var_adapter::_stepsize_adaptation
+
+protected
+
+ +

Definition at line 42 of file stepsize_var_adapter.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
var_adaptation stan::mcmc::stepsize_var_adapter::_var_adaptation
+
+protected
+
+ +

Definition at line 43 of file stepsize_var_adapter.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1stepsize__var__adapter.png b/doc/api/html/classstan_1_1mcmc_1_1stepsize__var__adapter.png new file mode 100644 index 0000000000000000000000000000000000000000..94166a5dad2eadd5f1896618b426f7b35dfe143e GIT binary patch literal 2089 zcmc(gXH-*Z8pi`J!XSzP3rJfs0RfQ`LzUuS7zlxcrmjYcIIf@w10ewd2^?jC$TB#g zgkA>_MZh7136T!E7%>n!p-2o;0z-*(BzxnW{kCV%?x(%y+~+>`xzBw*{NLaEe<|*0 zr=#*`U6 zQeuwx{9*RMc-+i#&Rn$7r|3dfyfm4e4|SwQxI;RQyL3Sp$`J|L8Oca4iXwMe51jrB zO$nUn4$(y#>p&D{8X#ySmz}0Nee_^x7`d+Df>3dwWJ8-Xl1&n56iZUJiBB9UDr_J3 zvp{qZG{~$E@^d=BVwNh@rPX|dr4*dP7G+_mGm`delqi^RX{4Vr+gxVoc9-Yt)|0_& zsJqv{;a^!_j9ixoW_KKMd}UQ{{?y}6*<>K&FaGEGU&il;S?EH0^dw(VC{elp0lI5I zdQOIuiVX@ux6HOjsojKhwXjqb{`x z=_qOzAj;~s$J=3C(gBJZsLLaX#jXfBG0?j8=tnVJeEr3t=iU#*T54%6-r19rWEo84|9K4^IUP{FYjn0^;Ea4?yhi z3*_hU!!6YjFs6?hicUCxwPhR^37NtN+q}84|3Y>3wgjDGZmj-862#mriWKNGaxv2U ziufucZ)n^xOZMY~93}8nqP7PE-*CBW&qM9x&hLHLd*dp*A0i$^8i8jXsCeeK>hrtS ziLiSC_y>anvSuu+eFm+XtFY2t2Y^Iu#N7*s*0`wEz|;9DX_C1#Ww42VyV#G(t3ipz zn%UJKF)Swls7~znI}ekHy)jvUHm&F`&OjI*P9F1ubi{a_g?vTFz-7Li`$*e6qYqUs zd->_VQ@sON5>vN5FxX9++K;g_#Ob#}slQktZm!#yrPnkmWt zyKoS8EUB}^QvF!cw6siw$4)!Qz?4hTBE-8Aec-Z|r2m4Gdh2n<^ zWCMGZOETYl@g|$Z%PZ|x?fZjHLO*-`Z$CCFh8NE5q*?*Hqt*1Jz=k6Ny+e9Jk+LYj zk({Z=Bt}(@Lc6)Bk_4@*sA}7!^>S+3RSr52XJkPu z7?^8?j(y-pF4`ZEVb(o-B9tHVnxMuqTT?sNY&32GOd!8yB+re6aEZV6l&`>Na(RuK zL2=-80SgXH?uXHaoX$N)zr;pwJ_fW%fOfK!$+(3%=xeuA3@XF zEXhtBL+V+n!1HdcU7~%EOlb7 z7~bj=tcKZe1B=}O6(%hI8kaqvXogXq9ACI~<9Y4$GX-1c`yL@#oR)c>v(V`*pf1Cd zv4V)bLg%1F7Rm+G*`dETP53JKB=t?PQpKh4+SXC_Ze4B!ZFn+e@?Z-6Q>|I7d+ziF zhAhO+gk>h&=qLN+Vloc|xQgmpT=#TH(Ot4p_^#8d;nsYhU9ss=!JSCCck2Yvqo>Omdov%P(f?rE(=-t3nmjCGukb9Na~nyuje4%U zwn90Nyg@i_iaby~$Ojx>(d%E}6$4 + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::unit_e_metric< M, BaseRNG > Member List
+
+
+ +

This is the complete list of members for stan::mcmc::unit_e_metric< M, BaseRNG >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
_err_streamstan::mcmc::base_hamiltonian< M, unit_e_point, BaseRNG >protected
_modelstan::mcmc::base_hamiltonian< M, unit_e_point, BaseRNG >protected
_write_error_msg(std::ostream *error_msgs, const std::domain_error &e)stan::mcmc::base_hamiltonian< M, unit_e_point, BaseRNG >inlineprotected
base_hamiltonian(M &m, std::ostream *e)stan::mcmc::base_hamiltonian< M, unit_e_point, BaseRNG >inline
dphi_dq(unit_e_point &z)stan::mcmc::unit_e_metric< M, BaseRNG >inlinevirtual
dtau_dp(unit_e_point &z)stan::mcmc::unit_e_metric< M, BaseRNG >inlinevirtual
dtau_dq(unit_e_point &z)stan::mcmc::unit_e_metric< M, BaseRNG >inlinevirtual
H(unit_e_point &z)stan::mcmc::base_hamiltonian< M, unit_e_point, BaseRNG >inline
init(unit_e_point &z)stan::mcmc::base_hamiltonian< M, unit_e_point, BaseRNG >inlinevirtual
phi(unit_e_point &z)stan::mcmc::unit_e_metric< M, BaseRNG >inlinevirtual
sample_p(unit_e_point &z, BaseRNG &rng)stan::mcmc::unit_e_metric< M, BaseRNG >inlinevirtual
T(unit_e_point &z)stan::mcmc::unit_e_metric< M, BaseRNG >inlinevirtual
tau(unit_e_point &z)stan::mcmc::unit_e_metric< M, BaseRNG >inlinevirtual
unit_e_metric(M &m, std::ostream *e)stan::mcmc::unit_e_metric< M, BaseRNG >inline
update(unit_e_point &z)stan::mcmc::base_hamiltonian< M, unit_e_point, BaseRNG >inlinevirtual
V(unit_e_point &z)stan::mcmc::base_hamiltonian< M, unit_e_point, BaseRNG >inline
~base_hamiltonian()stan::mcmc::base_hamiltonian< M, unit_e_point, BaseRNG >inline
~unit_e_metric()stan::mcmc::unit_e_metric< M, BaseRNG >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1unit__e__metric.html b/doc/api/html/classstan_1_1mcmc_1_1unit__e__metric.html new file mode 100644 index 00000000000..e93d6e1ec30 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1unit__e__metric.html @@ -0,0 +1,465 @@ + + + + + +Stan: stan::mcmc::unit_e_metric< M, BaseRNG > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::unit_e_metric< M, BaseRNG > Class Template Reference
+
+
+ +

#include <unit_e_metric.hpp>

+
+Inheritance diagram for stan::mcmc::unit_e_metric< M, BaseRNG >:
+
+
+ + +stan::mcmc::base_hamiltonian< M, unit_e_point, BaseRNG > + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 unit_e_metric (M &m, std::ostream *e)
 
 ~unit_e_metric ()
 
double T (unit_e_point &z)
 
double tau (unit_e_point &z)
 
double phi (unit_e_point &z)
 
const Eigen::VectorXd dtau_dq (unit_e_point &z)
 
const Eigen::VectorXd dtau_dp (unit_e_point &z)
 
const Eigen::VectorXd dphi_dq (unit_e_point &z)
 
void sample_p (unit_e_point &z, BaseRNG &rng)
 
- Public Member Functions inherited from stan::mcmc::base_hamiltonian< M, unit_e_point, BaseRNG >
 base_hamiltonian (M &m, std::ostream *e)
 
 ~base_hamiltonian ()
 
double V (unit_e_point &z)
 
double H (unit_e_point &z)
 
virtual void init (unit_e_point &z)
 
virtual void update (unit_e_point &z)
 
+ + + + + + + + + +

+Additional Inherited Members

- Protected Member Functions inherited from stan::mcmc::base_hamiltonian< M, unit_e_point, BaseRNG >
void _write_error_msg (std::ostream *error_msgs, const std::domain_error &e)
 
- Protected Attributes inherited from stan::mcmc::base_hamiltonian< M, unit_e_point, BaseRNG >
M & _model
 
std::ostream * _err_stream
 
+

Detailed Description

+

template<typename M, typename BaseRNG>
+class stan::mcmc::unit_e_metric< M, BaseRNG >

+ + +

Definition at line 16 of file unit_e_metric.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename M , typename BaseRNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
stan::mcmc::unit_e_metric< M, BaseRNG >::unit_e_metric (M & m,
std::ostream * e 
)
+
+inline
+
+ +

Definition at line 20 of file unit_e_metric.hpp.

+ +
+
+ +
+
+
+template<typename M , typename BaseRNG >
+ + + + + +
+ + + + + + + +
stan::mcmc::unit_e_metric< M, BaseRNG >::~unit_e_metric ()
+
+inline
+
+ +

Definition at line 22 of file unit_e_metric.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename M , typename BaseRNG >
+ + + + + +
+ + + + + + + + +
const Eigen::VectorXd stan::mcmc::unit_e_metric< M, BaseRNG >::dphi_dq (unit_e_pointz)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_hamiltonian< M, unit_e_point, BaseRNG >.

+ +

Definition at line 39 of file unit_e_metric.hpp.

+ +
+
+ +
+
+
+template<typename M , typename BaseRNG >
+ + + + + +
+ + + + + + + + +
const Eigen::VectorXd stan::mcmc::unit_e_metric< M, BaseRNG >::dtau_dp (unit_e_pointz)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_hamiltonian< M, unit_e_point, BaseRNG >.

+ +

Definition at line 35 of file unit_e_metric.hpp.

+ +
+
+ +
+
+
+template<typename M , typename BaseRNG >
+ + + + + +
+ + + + + + + + +
const Eigen::VectorXd stan::mcmc::unit_e_metric< M, BaseRNG >::dtau_dq (unit_e_pointz)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_hamiltonian< M, unit_e_point, BaseRNG >.

+ +

Definition at line 31 of file unit_e_metric.hpp.

+ +
+
+ +
+
+
+template<typename M , typename BaseRNG >
+ + + + + +
+ + + + + + + + +
double stan::mcmc::unit_e_metric< M, BaseRNG >::phi (unit_e_pointz)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_hamiltonian< M, unit_e_point, BaseRNG >.

+ +

Definition at line 29 of file unit_e_metric.hpp.

+ +
+
+ +
+
+
+template<typename M , typename BaseRNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::mcmc::unit_e_metric< M, BaseRNG >::sample_p (unit_e_pointz,
BaseRNG & rng 
)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_hamiltonian< M, unit_e_point, BaseRNG >.

+ +

Definition at line 43 of file unit_e_metric.hpp.

+ +
+
+ +
+
+
+template<typename M , typename BaseRNG >
+ + + + + +
+ + + + + + + + +
double stan::mcmc::unit_e_metric< M, BaseRNG >::T (unit_e_pointz)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_hamiltonian< M, unit_e_point, BaseRNG >.

+ +

Definition at line 24 of file unit_e_metric.hpp.

+ +
+
+ +
+
+
+template<typename M , typename BaseRNG >
+ + + + + +
+ + + + + + + + +
double stan::mcmc::unit_e_metric< M, BaseRNG >::tau (unit_e_pointz)
+
+inlinevirtual
+
+ +

Implements stan::mcmc::base_hamiltonian< M, unit_e_point, BaseRNG >.

+ +

Definition at line 28 of file unit_e_metric.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1unit__e__metric.png b/doc/api/html/classstan_1_1mcmc_1_1unit__e__metric.png new file mode 100644 index 0000000000000000000000000000000000000000..088aad3b3280ff299b600dddebddd8eccd3f8162 GIT binary patch literal 1179 zcmeAS@N?(olHy`uVBq!ia0y~yV2lT{12~w0WT#i#B_Jgc;1lBd|Nnm=^TnI5rTvE{ z09jys;J^Xa&O7ozE=Ng_UoZnu5eQs86=KA|z@p{p;uuoF_;&8wq9s;5F8#At?fI{K zpEDsxa^{(qi)y>WqrapajK8$;&cD-}biA`7r>VN=Oqw!j34?09XIJp2sY@*24Bnb< zmD=!l{&`<2YVOH--YvF_&z)2LY1xz|lcUz}tN-~&-Lo(2_O*Tg{Hp$Q?OT5!L-Sj` z%E^nXUrOw|&bqO+rexOFyc+x8>#75`FXR6E@zS=FmG)I%@1Njbo*P2Pj6*PeU^W|pSQG76}8?USX`K}iKc>m)k$5zIFy|4e%@6UC)KivPdwj1 zD=*Ws&3All7wgG(JIptK-P$yPzYpvz-pjp}IqG@*!`dltV+$T>d)BXKnGzmog1b!WWxoOExgcU0QbUuA}m&N}`R{;KV%ubH)6_2jGnC&MTG>zTA(<*4RQ zub??_hFs0`)W{%UYzs2|nEi!u0ux8zCsvNj$K9FOI)Xqf=6ohL4j`)|rKXmgjp_x7FFJy|`6n zbNIvC^!~pwnbT{&zx%p<`Ofp-pE>`$dvcq_w~TLh^Ut3;V{+^JOONh-g3|5fi(ehg z+gFhDa;Mwguj_x_E9#1_k!GI!Vn)+vyDRUf*T^a{cYplQQ)BIJ>n8iV`by#UE=zBQ z`pkeOujvyK)WrFRuN4cJ0dVSLKgf+uGvy z7w?-pcgD@A*@wTozbY?FOYdDAEA@WwbAI*zvd8UT@BbF^Z_WQ}%G)AC>&-3fp6#Fi z-X>Y#onz+eZOr^%`fcAg-_JStPFwaM&$5_m#ygj1FJt^M_1DWcb<+2@p4+uJ^Sx!m z^e>N3{(b$G`@>|feGG-@xax!M(kUUDOI=>r^D4R@-}h-EsL)~XboFyt=akR{0IFVF A%>V!Z literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1mcmc_1_1unit__e__nuts-members.html b/doc/api/html/classstan_1_1mcmc_1_1unit__e__nuts-members.html new file mode 100644 index 00000000000..fff06b4c482 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1unit__e__nuts-members.html @@ -0,0 +1,157 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::unit_e_nuts< M, BaseRNG > Member List
+
+
+ +

This is the complete list of members for stan::mcmc::unit_e_nuts< M, BaseRNG >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_depthstan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >
_epsilonstan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
_epsilon_jitterstan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
_err_streamstan::mcmc::base_mcmcprotected
_hamiltonianstan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
_integratorstan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
_max_deltastan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >
_max_depthstan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >
_n_divergentstan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >
_namestan::mcmc::base_mcmcprotected
_nom_epsilonstan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
_out_streamstan::mcmc::base_mcmcprotected
_rand_intstan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
_rand_uniformstan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
_zstan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
base_hmc(M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
base_mcmc(std::ostream *o, std::ostream *e)stan::mcmc::base_mcmcinline
base_nuts(M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)stan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
build_tree(int depth, Eigen::VectorXd &rho, ps_point *z_init_parent, ps_point &z_propose, nuts_util &util)stan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
compute_criterion(ps_point &start, unit_e_point &finish, Eigen::VectorXd &rho)stan::mcmc::unit_e_nuts< M, BaseRNG >inlinevirtual
get_current_stepsize()stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
get_max_delta()stan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
get_max_depth()stan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
get_nominal_stepsize()stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
get_sampler_diagnostic_names(std::vector< std::string > &model_names, std::vector< std::string > &names)stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_diagnostics(std::vector< double > &values)stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_param_names(std::vector< std::string > &names)stan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_params(std::vector< double > &values)stan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_stepsize_jitter()stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
init_stepsize()stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
name()stan::mcmc::base_mcmcinline
sample_stepsize()stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
seed(const Eigen::VectorXd &q)stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
set_max_delta(const double d)stan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
set_max_depth(const int d)stan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
set_nominal_stepsize(const double e)stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
set_stepsize_jitter(const double j)stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
transition(sample &init_sample)stan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
unit_e_nuts(M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)stan::mcmc::unit_e_nuts< M, BaseRNG >inline
write_sampler_param_names(std::ostream &o)stan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
write_sampler_params(std::ostream &o)stan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
write_sampler_state(std::ostream *o)stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
z()stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
~base_mcmc()stan::mcmc::base_mcmcinlinevirtual
~base_nuts()stan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1unit__e__nuts.html b/doc/api/html/classstan_1_1mcmc_1_1unit__e__nuts.html new file mode 100644 index 00000000000..e6980fff609 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1unit__e__nuts.html @@ -0,0 +1,330 @@ + + + + + +Stan: stan::mcmc::unit_e_nuts< M, BaseRNG > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::unit_e_nuts< M, BaseRNG > Class Template Reference
+
+
+ +

#include <unit_e_nuts.hpp>

+
+Inheritance diagram for stan::mcmc::unit_e_nuts< M, BaseRNG >:
+
+
+ + +stan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_mcmc +stan::mcmc::adapt_unit_e_nuts< M, BaseRNG > + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 unit_e_nuts (M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)
 
bool compute_criterion (ps_point &start, unit_e_point &finish, Eigen::VectorXd &rho)
 
- Public Member Functions inherited from stan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >
 base_nuts (M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)
 
 ~base_nuts ()
 
void set_max_depth (const int d)
 
void set_max_delta (const double d)
 
int get_max_depth ()
 
double get_max_delta ()
 
sample transition (sample &init_sample)
 
void write_sampler_param_names (std::ostream &o)
 
void write_sampler_params (std::ostream &o)
 
void get_sampler_param_names (std::vector< std::string > &names)
 
void get_sampler_params (std::vector< double > &values)
 
int build_tree (int depth, Eigen::VectorXd &rho, ps_point *z_init_parent, ps_point &z_propose, nuts_util &util)
 
- Public Member Functions inherited from stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >
 base_hmc (M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)
 
void write_sampler_state (std::ostream *o)
 
void get_sampler_diagnostic_names (std::vector< std::string > &model_names, std::vector< std::string > &names)
 
void get_sampler_diagnostics (std::vector< double > &values)
 
void seed (const Eigen::VectorXd &q)
 
void init_stepsize ()
 
unit_e_pointz ()
 
virtual void set_nominal_stepsize (const double e)
 
double get_nominal_stepsize ()
 
double get_current_stepsize ()
 
virtual void set_stepsize_jitter (const double j)
 
double get_stepsize_jitter ()
 
void sample_stepsize ()
 
- Public Member Functions inherited from stan::mcmc::base_mcmc
 base_mcmc (std::ostream *o, std::ostream *e)
 
virtual ~base_mcmc ()
 
std::string name ()
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Public Attributes inherited from stan::mcmc::base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >
int _depth
 
int _max_depth
 
double _max_delta
 
int _n_divergent
 
- Protected Attributes inherited from stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >
unit_e_point _z
 
expl_leapfrog< unit_e_metric
+< M, BaseRNG >, unit_e_point
_integrator
 
unit_e_metric< M, BaseRNG > _hamiltonian
 
BaseRNG & _rand_int
 
boost::uniform_01< BaseRNG & > _rand_uniform
 
double _nom_epsilon
 
double _epsilon
 
double _epsilon_jitter
 
+

Detailed Description

+

template<typename M, class BaseRNG>
+class stan::mcmc::unit_e_nuts< M, BaseRNG >

+ + +

Definition at line 17 of file unit_e_nuts.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::mcmc::unit_e_nuts< M, BaseRNG >::unit_e_nuts (M & m,
BaseRNG & rng,
std::ostream * o = &std::cout,
std::ostream * e = 0 
)
+
+inline
+
+ +

Definition at line 25 of file unit_e_nuts.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::mcmc::unit_e_nuts< M, BaseRNG >::compute_criterion (ps_pointstart,
unit_e_pointfinish,
Eigen::VectorXd & rho 
)
+
+inlinevirtual
+
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1unit__e__nuts.png b/doc/api/html/classstan_1_1mcmc_1_1unit__e__nuts.png new file mode 100644 index 0000000000000000000000000000000000000000..a4c42933ff1674955c5a08dcac73e114baf200a7 GIT binary patch literal 3114 zcmb`J2~ZPh8ioTb;6Vh1ks}JS1`w1x5E8)Xh|4smq8UU{F1b$$h!`MvOc+tFa2W!L zG6axIlr!8K6+tA!5tu+Y0zwQ(h#Yd0jk8r-v*m2nR_%0EcYodecUO1+@AJLyy)zEh z;9V-aKp+qp_`%8v1QO$j>eU?*qU|SS#jt3nbjI%dX`xUkDnEW&j!b!(Dyn{8+uGVB z@3GZHhdUyi9L|A6gT5}z&hthf&~6%Fb@KcTvAMjttkNTLr|S}G7PeC?0EIQVq%U(o zk)v~pIVLmT%2WXdXj2bSGwjp>r$a#2T@N5!Q^uBH>~VpRyOU1%(4}u;0rWbr6?GGq zN_TucF>h=!B56O%xIDOsV~tF%9jJkst^}UnDx=W|)`a5}H{ToN8Sj@A@~p38w7nO0 zEV8E{9F5&Ts{-q~oByDDXKf%t?}GWZiKZ{!2%cCFmew}Abu4!i1D6NEjGb9`-`Oi= z6;KNGpS!_aZ-(^$U!n{ove9H8W>&df3*MkfUtd%U&A2IaG{y}0U_V>(!MO&F*5 z7IS;X=e!0!8p^8^KuW8jl7tAn0ec{UOM$ZF@ERRNgJVGVw_i9CW}_{sP5rR5jWQu6 z2YR>_AM31altsi)dG(t5OcaZ|CLx)-`^tjwSh^~I;NnJ)HTH%ukEEaoPSLCmhA55lIn6oMgJx!_ z4!QKkk=bzAdOyD&8M{XoOtHJ}O06sPAuiwNhMDUQGB~xHs=0KUR2Q@9c$+jeZa&Vz zLaR9BI=HSJLSG*8Z>@e(7RgmOH5LVA8i>R)Zm|L@`3k$3fF^kWA`-`h&B4W8ALZFsoYF_V&un=T3-S4qR78v|p# z%qxA!v&yrm#yNJ(rR@ibnSLe~(z=h|^=Ho_3Jae#&o}rv(PlzN?iD|nR!@dGjFcM#b;{*(L~G=p>ZirwwvQBF&%J4ZTyZ? zYZOY0EPo#U%c2hMBR_4RJnxGwsq>y_V zIq|D=y5U&!LnNSLD1xW`f!9our9*W(mYbSgfE)j1r4o91Lik$|A>!WCdCn~91mViK z_XUDD!2IqTu|?6fsR{)d1T7FQ5pn|LZlfe+FnxXZYfy{G5xn@fPZ`GRiadcN*!>rI z!k-}_GMuh4V+;E}1-m{N@#Wv-Ko>-o^&h^Z=D7-yzUCOIH*BDTDuWcYtF^_mP3urN z*?h6lBnqdG^#-qqPU76jr3LdV8@3Own4eRZww3xYApTNe{(#<2w!+VA?0VXjmZrHj-(Hpl9Gs@V4k;|(LJD66(C z{U(s^pLH~FJ(fX)d{kpcVOOb~ytbBrC46amP1(JsvVmq-Vrb%yHrWMbG?MXd1yb=r zMm+m)zP|Rz?irmt^QkWC4E*4*q`1Iqvx#$(wJ~ZLBUhhe?p-fau6&khYH$F1Bcd`1 z?0Cj4xc{}z2!$2-9UqxznJ^r#zzuVwat{YvN)i1kru-mdsGD`-IY!MaI-=$2ug#o% z{|=*+FkW@?qoX?zyT;{Li(i0Z|@4}lCcWF(X@jX!yU+(bRmFzUr)rM4{5EZMJ0{spn%zewO~=9r#WcF?A_zS5;; zZ0~~tyPzF}Zz9gxPI@{tR)S=Ky*JNbG-H%9)drIKCLIYjV)8HH4EmCN?Js z;h8k_srD4z8^&}W$aZ_8Mp(iLuFw~`dTPyGJ~VRG2&{I+o>7A#6&bT50&`|G;5SbH zu8~pYp)^j^;A|a4Z}HOf)knCnR)jM=x)whR^P-#IiVfz0owWj8!A}%-im&C=DCreL}GJm!q!j;Rcve zY}exZ3Z^gaDgV6HyO>tM9udyMM;ow-txkn-tXccYcMWh?n668w-^{h^lIqq#?{G9W zGpit!8(g(=E(glH|4=!OUw-Xi5NVINhJS+F5wkCqP?t$jtQH4`zICyGHx{9odP0 + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::unit_e_point Member List
+
+
+ +

This is the complete list of members for stan::mcmc::unit_e_point, including all inherited members.

+ + + + + + + + + + + + + + +
_fast_matrix_copy(Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &v_to, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &v_from)stan::mcmc::ps_pointinlineprotected
_fast_vector_copy(Eigen::Matrix< T, Eigen::Dynamic, 1 > &v_to, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v_from)stan::mcmc::ps_pointinlineprotected
gstan::mcmc::ps_point
get_param_names(std::vector< std::string > &model_names, std::vector< std::string > &names)stan::mcmc::ps_pointinlinevirtual
get_params(std::vector< double > &values)stan::mcmc::ps_pointinlinevirtual
operator=(const ps_point &z)stan::mcmc::ps_pointinline
pstan::mcmc::ps_point
ps_point(int n)stan::mcmc::ps_pointinline
ps_point(const ps_point &z)stan::mcmc::ps_pointinline
qstan::mcmc::ps_point
unit_e_point(int n)stan::mcmc::unit_e_pointinline
Vstan::mcmc::ps_point
write_metric(std::ostream *o)stan::mcmc::ps_pointinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1unit__e__point.html b/doc/api/html/classstan_1_1mcmc_1_1unit__e__point.html new file mode 100644 index 00000000000..570681c8dba --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1unit__e__point.html @@ -0,0 +1,194 @@ + + + + + +Stan: stan::mcmc::unit_e_point Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::unit_e_point Class Reference
+
+
+ +

#include <unit_e_point.hpp>

+
+Inheritance diagram for stan::mcmc::unit_e_point:
+
+
+ + +stan::mcmc::ps_point + +
+ + + + + + + + + + + + + + + + + +

+Public Member Functions

 unit_e_point (int n)
 
- Public Member Functions inherited from stan::mcmc::ps_point
 ps_point (int n)
 
 ps_point (const ps_point &z)
 
ps_pointoperator= (const ps_point &z)
 
virtual void get_param_names (std::vector< std::string > &model_names, std::vector< std::string > &names)
 
virtual void get_params (std::vector< double > &values)
 
virtual void write_metric (std::ostream *o)
 
+ + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Public Attributes inherited from stan::mcmc::ps_point
Eigen::VectorXd q
 
Eigen::VectorXd p
 
double V
 
Eigen::VectorXd g
 
- Protected Member Functions inherited from stan::mcmc::ps_point
template<typename T >
void _fast_vector_copy (Eigen::Matrix< T, Eigen::Dynamic, 1 > &v_to, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v_from)
 
template<typename T >
void _fast_matrix_copy (Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &v_to, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &v_from)
 
+

Detailed Description

+
+

Definition at line 12 of file unit_e_point.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::mcmc::unit_e_point::unit_e_point (int n)
+
+inline
+
+ +

Definition at line 16 of file unit_e_point.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1unit__e__point.png b/doc/api/html/classstan_1_1mcmc_1_1unit__e__point.png new file mode 100644 index 0000000000000000000000000000000000000000..8106ad275283cce8e19bbf975986c1d6c57243fa GIT binary patch literal 610 zcmeAS@N?(olHy`uVBq!ia0vp^lYuyZgBeI_xo@`xQW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;6c{lGkfp0lk@hTO1K)ox9jY+xE#xM5;-@jm&GiZGHdag+;btk*ZwAV%*}kd z{kui_t!X8vFEQkO*)F2K&33NJ?R#%y`%YL_%+B0iUZ0r7ayRAH{q?tf+CP7prs=s& za=rKSm*1mX275!F8uQ-Z)Y%-zzWU#^qHXIr&&>F__gUN|(Zi268$DH8dgV<*ZgGHV z#P|Dd*LIZs3N3h=Kl9D2tC8PAr9$6Y?ex(-&USgzgP-%y9-mos>AsQaG5g(qeaY4D z^^8zBVbj}AW n + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::unit_e_static_hmc< M, BaseRNG > Member List
+
+
+ +

This is the complete list of members for stan::mcmc::unit_e_static_hmc< M, BaseRNG >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_epsilonstan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
_epsilon_jitterstan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
_err_streamstan::mcmc::base_mcmcprotected
_hamiltonianstan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
_integratorstan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
_namestan::mcmc::base_mcmcprotected
_nom_epsilonstan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
_out_streamstan::mcmc::base_mcmcprotected
_rand_intstan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
_rand_uniformstan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
_update_L()stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlineprotected
_zstan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
base_hmc(M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
base_mcmc(std::ostream *o, std::ostream *e)stan::mcmc::base_mcmcinline
base_static_hmc(M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
get_current_stepsize()stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
get_L()stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
get_nominal_stepsize()stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
get_sampler_diagnostic_names(std::vector< std::string > &model_names, std::vector< std::string > &names)stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_diagnostics(std::vector< double > &values)stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_param_names(std::vector< std::string > &names)stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_sampler_params(std::vector< double > &values)stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
get_stepsize_jitter()stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
get_T()stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
init_stepsize()stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
L_stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
name()stan::mcmc::base_mcmcinline
sample_stepsize()stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
seed(const Eigen::VectorXd &q)stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
set_nominal_stepsize(const double e)stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
set_nominal_stepsize_and_L(const double e, const int l)stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
set_nominal_stepsize_and_T(const double e, const double t)stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
set_stepsize_jitter(const double j)stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
set_T(const double t)stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
T_stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >protected
transition(sample &init_sample)stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
unit_e_static_hmc(M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)stan::mcmc::unit_e_static_hmc< M, BaseRNG >inline
write_sampler_param_names(std::ostream &o)stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
write_sampler_params(std::ostream &o)stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
write_sampler_state(std::ostream *o)stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inlinevirtual
z()stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
~base_mcmc()stan::mcmc::base_mcmcinlinevirtual
~base_static_hmc()stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1unit__e__static__hmc.html b/doc/api/html/classstan_1_1mcmc_1_1unit__e__static__hmc.html new file mode 100644 index 00000000000..da5c45bd0d3 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1unit__e__static__hmc.html @@ -0,0 +1,262 @@ + + + + + +Stan: stan::mcmc::unit_e_static_hmc< M, BaseRNG > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::unit_e_static_hmc< M, BaseRNG > Class Template Reference
+
+
+ +

#include <unit_e_static_hmc.hpp>

+
+Inheritance diagram for stan::mcmc::unit_e_static_hmc< M, BaseRNG >:
+
+
+ + +stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG > +stan::mcmc::base_mcmc +stan::mcmc::adapt_unit_e_static_hmc< M, BaseRNG > + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 unit_e_static_hmc (M &m, BaseRNG &rng, std::ostream *o=&std::cout, std::ostream *e=0)
 
- Public Member Functions inherited from stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >
 base_static_hmc (M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)
 
 ~base_static_hmc ()
 
sample transition (sample &init_sample)
 
void write_sampler_param_names (std::ostream &o)
 
void write_sampler_params (std::ostream &o)
 
void get_sampler_param_names (std::vector< std::string > &names)
 
void get_sampler_params (std::vector< double > &values)
 
void set_nominal_stepsize_and_T (const double e, const double t)
 
void set_nominal_stepsize_and_L (const double e, const int l)
 
void set_T (const double t)
 
void set_nominal_stepsize (const double e)
 
double get_T ()
 
int get_L ()
 
- Public Member Functions inherited from stan::mcmc::base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >
 base_hmc (M &m, BaseRNG &rng, std::ostream *o, std::ostream *e)
 
void write_sampler_state (std::ostream *o)
 
void get_sampler_diagnostic_names (std::vector< std::string > &model_names, std::vector< std::string > &names)
 
void get_sampler_diagnostics (std::vector< double > &values)
 
void seed (const Eigen::VectorXd &q)
 
void init_stepsize ()
 
unit_e_pointz ()
 
double get_nominal_stepsize ()
 
double get_current_stepsize ()
 
virtual void set_stepsize_jitter (const double j)
 
double get_stepsize_jitter ()
 
void sample_stepsize ()
 
- Public Member Functions inherited from stan::mcmc::base_mcmc
 base_mcmc (std::ostream *o, std::ostream *e)
 
virtual ~base_mcmc ()
 
std::string name ()
 
+ + + + + + + + + +

+Additional Inherited Members

- Protected Member Functions inherited from stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >
void _update_L ()
 
- Protected Attributes inherited from stan::mcmc::base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >
double T_
 
int L_
 
+

Detailed Description

+

template<typename M, class BaseRNG>
+class stan::mcmc::unit_e_static_hmc< M, BaseRNG >

+ + +

Definition at line 18 of file unit_e_static_hmc.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename M , class BaseRNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::mcmc::unit_e_static_hmc< M, BaseRNG >::unit_e_static_hmc (M & m,
BaseRNG & rng,
std::ostream * o = &std::cout,
std::ostream * e = 0 
)
+
+inline
+
+ +

Definition at line 26 of file unit_e_static_hmc.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1unit__e__static__hmc.png b/doc/api/html/classstan_1_1mcmc_1_1unit__e__static__hmc.png new file mode 100644 index 0000000000000000000000000000000000000000..7215e9a88721bc8734e671b21cd19053c941f6ba GIT binary patch literal 3323 zcmcJScT^ME9><5^h!Sa*fCaIvqAmetMUfE7E(l0f1B*Z)Jd_eCLO?pvsHmWzqI3u= z0ul%<^Z*f2qezF)LKQOhcV6g(c1kuD7~|E|Rj4`jK^PSO{2tW$ZGHCa8F+h0 z1v*?8c*g210CoCxVKrkk0boOnnUNtTM1r3&lbEe054@dA4_!4`c@QFLCQDmFaKs%72Gs)6>+a(fg1#cdZ<t2~Wd>U$<)gM+hiaTGZ_=CEhza^$9wygftK@8|tj^O|PEj_w?_ zenXVD8TwLYc|49c%0V9@;U9}nK(})9^%E~!3-6l2G1&=-rzcha_=&!VI}_UbC$!`I zCDye`8NlR|%Yj|mDk}LB2Hst;D`P|7naTh^CLn7evKYm(`3_-Rxk_nO9am)ae{^%YKzlf5%=682n5EmqN8rR^sf zkv>b-oZYjspgT=P^tqJaqKdkUiq!??qffs<~8MLWuChfFDmi6 zU#NYH-MZh2`>%3h(Bh_eWU@-YcC6LlZAMYR$}iIdw0%wUw3|4nYPQCIr)^!%%pKu# zN~C&lVdRIfOG59rZgq*BZOCL;>$v-y%9+wxN@;^%w01R?6ZNI(QC@?tT|4Ozp4IbW z)UIQmh_qk2*SaR0R!caxo3}GokKMn#G=j<`z^%?s*MRKo3c0~qdk?7@OQ$p)zZw<*eAku2g)I#}?PyLO+BW z+-YUCg)|TLpZR>_8tT^S3HTuHE!=@`+D_u#4@VR#^MY50NRRiFZ+F=6y{I73w4x~m zl$vDt8s47_zRf$O9?}X6qBrbP+|l!TIh4O?x-*?Fui?}@HF5(QPp_cxA2z>^ zv~4(}kQ!lg%DLVm=|PAGs0>$Miz;3hPMb_PSP+%B)>{y)=GpyjJUY?m!ZzaUvqv$9 zFBDhkpzN`P=@Yf&{bbnY<2MmKR22LagE#!NEaXIWdSDg5cs! zY|80zF>(A%g-b@D`1FQk}{`xSCX#f>;1A_uxO-;9#qQ~v%WqA znxU#MAv0k0&4n8tngOr>&Lbzk_*x2lI$J(6|Vg0x$@JHQb54TEHz!2!!;sH4r(T z5GUU${|#vTC4CUQZ?xmwa7wnDSS5daVJo-BEb+M_*%9&ZO4atj-OXK`>WdmByf{3P zqO2}OFVhU7tGDQ--`qA!q$np=<}ZH^?O0+WZK&1%X#DDwhjod3sIh+j-II1?2;!2C zBMWWLF1Id_%NR)mMGbOi5m#d@8-~3#gJ%1jIesk5;0H_0y-oujab4th{iMa+Rh^vY zI-mPgQ;42oCpo*K0C95EFg4sa-DHd3w2oVS2~VvV>!U*7>4av_DOqa{;v0LsW_94@ z*my15-zU&P+bgP(;=Y#K_qmTDP3L0&U}ZV&rn ziPtH~+A*wO?aY*f7p-A~Cqh2==K7Mum?G5ytB&54kz5TQ;huu>Ug|n?29btKiC842 z7zQUem1jjtRAM5=$0%A~3qYR|4oJOB^)ReJqT#)=LORjc@U+69rAG9lC6?V(GfA?* zr7FvGJmXBDje>IvSbQ$aw@>jssjb_4J0TGs#~r#6(n%W0?ekHF&)19{sLJRQ)bI82H^1YI1-R0Eh+6hEg`D*QUDmUg zBt9m_O zLn0*X(gM~&eBFB@`8Uhw8(}!5=-peRUDs`pgq)c8N4+iXLqv@4@%^PO+lN|Tq-a+b zc#tkD(!cV}J2Ib!>&T#Wwk-m{IF;h`+L}oTrRMCTIN`XW*CzpDNHqD`T}{KHlpfDQ zYFKll*c|4^i&q{~^$PGsOH4PT0gu?OlxY%35OHX_g3wBrpcTdolGoWuYKluTKP=sh zWk0GCR|uX+EvP$aJkXBG6bGcD;k9s7)tF*W^eC?JvNS)XoI7}etEuQzl9h3hxZkoH z8voIF0&mzSe;mUluEBfc~OuF`xdSu3edRU>AoHTNwwYz{8Bo{Tcy|t*F*PK~}B*?o@f= zR>szH8ct-&7A3|-#Y!^r_E>NT$eIn9KBtpQB2lMM0<&-Yd{JmE#WQ`&r+Scmx@|f4 zwP0hfZQ{$EDe%+w1>0DO1-ClpY<)f$|1<4%4M+J|=J$~Re&oDBQ}Mq9k0CXsXjju{ zSEY9_`Ep5l4Cv)RK1#i*?us0p2;=yW34`t zN9bnI$_y&r#ef2TJ4E^&>|m}$ft-F$<8jAJMBYuo+X9;pY`%LqQb)wTc+?~;@X))> z!;_I26QhinP#%q97r5I0+!u~I*G_;}Zc&6gD~9a*IeQ4DrZw8^0v(rjTrA4)96 zCyTDlXx{}{C6sATV~*v)<|s5LUn6gTHildDKtu%lEL?_HF8c)2(WPzcdtZhtdiWV` zoqSC?*0o}hnk$@2)9rPz!H9!;DBRRd(kROH95ME*fw6t&LIR>^Zvp)xV)M;zZ0BDL zv?pS81P#o1vG5qA3zjX^ZK`In_S7ZA-@@!mW9@=43I80+E5kvWv}d48{=f@2?q=1!lD|3`H$TDqFwA^zDq@{ zIf2?@x6#V3{06!_>vo4ji85!%&(VKT?SlWou>2_0D3mA|>EuB)OPPT`LTL~E0lxF2 zi$1y6QdL>*heXB0ly%F-UCRF;QRUm65!QGw^@E-b8 O0nCi8jEa85k^Tu}#y9u? literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1mcmc_1_1var__adaptation-members.html b/doc/api/html/classstan_1_1mcmc_1_1var__adaptation-members.html new file mode 100644 index 00000000000..e8a701139ad --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1var__adaptation-members.html @@ -0,0 +1,129 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::var_adaptation Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1var__adaptation.html b/doc/api/html/classstan_1_1mcmc_1_1var__adaptation.html new file mode 100644 index 00000000000..1867fba9d93 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1var__adaptation.html @@ -0,0 +1,261 @@ + + + + + +Stan: stan::mcmc::var_adaptation Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::var_adaptation Class Reference
+
+
+ +

#include <var_adaptation.hpp>

+
+Inheritance diagram for stan::mcmc::var_adaptation:
+
+
+ + +stan::mcmc::windowed_adaptation +stan::mcmc::base_adaptation + +
+ + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 var_adaptation (int n)
 
bool learn_variance (Eigen::VectorXd &var, const Eigen::VectorXd &q)
 
- Public Member Functions inherited from stan::mcmc::windowed_adaptation
 windowed_adaptation (std::string name)
 
void restart ()
 
void set_window_params (unsigned int num_warmup, unsigned int init_buffer, unsigned int term_buffer, unsigned int base_window, std::ostream *e=0)
 
bool adaptation_window ()
 
bool end_adaptation_window ()
 
void compute_next_window ()
 
+ + + + + + + + + + + + + + + + + + + + +

+Protected Attributes

prob::welford_var_estimator _estimator
 
- Protected Attributes inherited from stan::mcmc::windowed_adaptation
std::string _estimator_name
 
unsigned int _num_warmup
 
unsigned int _adapt_init_buffer
 
unsigned int _adapt_term_buffer
 
unsigned int _adapt_base_window
 
unsigned int _adapt_window_counter
 
unsigned int _adapt_next_window
 
unsigned int _adapt_window_size
 
+

Detailed Description

+
+

Definition at line 14 of file var_adaptation.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::mcmc::var_adaptation::var_adaptation (int n)
+
+inline
+
+ +

Definition at line 18 of file var_adaptation.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::mcmc::var_adaptation::learn_variance (Eigen::VectorXd & var,
const Eigen::VectorXd & q 
)
+
+inline
+
+ +

Definition at line 20 of file var_adaptation.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
prob::welford_var_estimator stan::mcmc::var_adaptation::_estimator
+
+protected
+
+ +

Definition at line 48 of file var_adaptation.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1var__adaptation.png b/doc/api/html/classstan_1_1mcmc_1_1var__adaptation.png new file mode 100644 index 0000000000000000000000000000000000000000..2afb9f0f5110975f79348c6632b13f438cb13749 GIT binary patch literal 1077 zcmeAS@N?(olHy`uVBq!ia0vp^CxEzvgBeIpy%%x-NJ#|vgt-3y{~ySF@#br3|Dg#$ z78oBmaDcV*jy#adQ4-`A%m7pb0#{Fk7%?y~AMtc?45?szJNK>7Vg(*o{_8XM{a0SU zRm0`Nt+L&-jb;|DeW-jgu%mwFvP>yQpGjYSa|w8UTEZ|<#ovn6bJCY}aZz`C^khHZ z6%Ds%RPsDu!ZPU{f70$V_onT?`t{e8ZH~$Ln_t-_=Qv(lc+^*PWy`+!Z;K~wxz2b( zdGnn6kJi15zBAJ?`~5VHm0Rv^HY=X(;ia{9o`z@GaRt?9cFd3WCeJoGYqnisZT{rC z?~QWrwr*a#b>F4)4sv{(4(Ci+8~W31+RGm-PtF|lR!B|Vto^3v+4|jE<5(?A3wCtB zU9*19MDy*}!c46+uP0M)UZ$emyiP`3C(anMoitDg+{#d+ z>A+w^0$!IjYgs0Xq35Od+Hf1#C#k$lj?{l{w|lW~`pX&bcX{t)Qd*f+FY7W%N_0X= z`dz)xO;7V<_u6&jUbqq6k@dmQAb$G3qlGi4On-V&w>i!8Tkxk{z)%%?BDkXE^u*%m zuo;fo&%bC-sLFl0t-SJz9mnP)%N8!V^s3W(!ly^8j$aQdd$VnO%UjjN-O}Q@QhRrl zt-BlbI{LSjhx#$Q4I6!q3s2a*yj1kbM{7n+;a9<1??<`!J9sXYZJe|3+u`0@zNzLH z&v&;dSitmzr0x8yf(IfpOq8m&N^AEkBmKj4stV}{t??=djHWio~YYv z?o@p1IGQWm=#u%>r6KIO!qc~5FSksQy}eJcdbc&BZ_B*XwKWWj)1$L%x4v&&^G=@c z%#5#@I+s71JDii*%M!HuX4KvNn|Zk|yqaoU#4%|>-tU(4j_c-6b_5$-bgQu&X%Q~loCIAWD=d1t# literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1mcmc_1_1windowed__adaptation-members.html b/doc/api/html/classstan_1_1mcmc_1_1windowed__adaptation-members.html new file mode 100644 index 00000000000..dcd637deae1 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1windowed__adaptation-members.html @@ -0,0 +1,126 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::windowed_adaptation Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1windowed__adaptation.html b/doc/api/html/classstan_1_1mcmc_1_1windowed__adaptation.html new file mode 100644 index 00000000000..7882f1086e7 --- /dev/null +++ b/doc/api/html/classstan_1_1mcmc_1_1windowed__adaptation.html @@ -0,0 +1,528 @@ + + + + + +Stan: stan::mcmc::windowed_adaptation Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::windowed_adaptation Class Reference
+
+
+ +

#include <windowed_adaptation.hpp>

+
+Inheritance diagram for stan::mcmc::windowed_adaptation:
+
+
+ + +stan::mcmc::base_adaptation +stan::mcmc::covar_adaptation +stan::mcmc::var_adaptation + +
+ + + + + + + + + + + + + + +

+Public Member Functions

 windowed_adaptation (std::string name)
 
void restart ()
 
void set_window_params (unsigned int num_warmup, unsigned int init_buffer, unsigned int term_buffer, unsigned int base_window, std::ostream *e=0)
 
bool adaptation_window ()
 
bool end_adaptation_window ()
 
void compute_next_window ()
 
+ + + + + + + + + + + + + + + + + +

+Protected Attributes

std::string _estimator_name
 
unsigned int _num_warmup
 
unsigned int _adapt_init_buffer
 
unsigned int _adapt_term_buffer
 
unsigned int _adapt_base_window
 
unsigned int _adapt_window_counter
 
unsigned int _adapt_next_window
 
unsigned int _adapt_window_size
 
+

Detailed Description

+
+

Definition at line 13 of file windowed_adaptation.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::mcmc::windowed_adaptation::windowed_adaptation (std::string name)
+
+inline
+
+ +

Definition at line 17 of file windowed_adaptation.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + +
bool stan::mcmc::windowed_adaptation::adaptation_window ()
+
+inline
+
+ +

Definition at line 77 of file windowed_adaptation.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
void stan::mcmc::windowed_adaptation::compute_next_window ()
+
+inline
+
+ +

Definition at line 88 of file windowed_adaptation.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
bool stan::mcmc::windowed_adaptation::end_adaptation_window ()
+
+inline
+
+ +

Definition at line 83 of file windowed_adaptation.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
void stan::mcmc::windowed_adaptation::restart ()
+
+inlinevirtual
+
+ +

Reimplemented from stan::mcmc::base_adaptation.

+ +

Definition at line 26 of file windowed_adaptation.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::mcmc::windowed_adaptation::set_window_params (unsigned int num_warmup,
unsigned int init_buffer,
unsigned int term_buffer,
unsigned int base_window,
std::ostream * e = 0 
)
+
+inline
+
+ +

Definition at line 32 of file windowed_adaptation.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
unsigned int stan::mcmc::windowed_adaptation::_adapt_base_window
+
+protected
+
+ +

Definition at line 115 of file windowed_adaptation.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
unsigned int stan::mcmc::windowed_adaptation::_adapt_init_buffer
+
+protected
+
+ +

Definition at line 113 of file windowed_adaptation.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
unsigned int stan::mcmc::windowed_adaptation::_adapt_next_window
+
+protected
+
+ +

Definition at line 118 of file windowed_adaptation.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
unsigned int stan::mcmc::windowed_adaptation::_adapt_term_buffer
+
+protected
+
+ +

Definition at line 114 of file windowed_adaptation.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
unsigned int stan::mcmc::windowed_adaptation::_adapt_window_counter
+
+protected
+
+ +

Definition at line 117 of file windowed_adaptation.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
unsigned int stan::mcmc::windowed_adaptation::_adapt_window_size
+
+protected
+
+ +

Definition at line 119 of file windowed_adaptation.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
std::string stan::mcmc::windowed_adaptation::_estimator_name
+
+protected
+
+ +

Definition at line 110 of file windowed_adaptation.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
unsigned int stan::mcmc::windowed_adaptation::_num_warmup
+
+protected
+
+ +

Definition at line 112 of file windowed_adaptation.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1mcmc_1_1windowed__adaptation.png b/doc/api/html/classstan_1_1mcmc_1_1windowed__adaptation.png new file mode 100644 index 0000000000000000000000000000000000000000..1afa77b3654824a3aeb47dfe15bfeefdea19c754 GIT binary patch literal 1445 zcmeAS@N?(olHy`uVBq!ia0y~yV4MYHcW^KR$(I}NmI5h>0G|-o|Ns93nJ?aaE$u%v z0muU50|ySUcHWT(ayd$Z{DK*Pia_A%sSqOu238YK7srqa#OC|>P#U7WwC!0>1BD8wqk|`0rDoc-Ksc5R& zFIzTw$^K6l&aOVU_0gaA^A@ggoAmB+YnIAOvHgpe?Y3F-`Q;w_zp1y@y!4zW?Ogfp z>b2HGHYcxK;lF$)Wcj{1)7DPf@+AEVPqpp4iv5ncvHKkt8cq}6z9QIG?7j1g-LpLB zzPea8WyuNsl`D7exN~_!y!6uzA0HMAUR`sX&&f=F;%dov+l6jT@t7BE%wxc3A(rKo zeT;8uK%(iSS&x5Bvstq2-p*658;`%*H1oomv~urtb-YRIx7TE^Njqg<8)lh*tgXfH z>5+DuDeZSmc`k@JIZ4l6Hv9Meq*u4HOecN0f8$<-=dI&FzeMWI|Ni4w1n&W^{iY0> zp3B@O{cF1F5#$B*Y)}#`Ok{$5HJ8dTFfe}*P-kGCz`L69#EF+F<_w%0r5bwXoV~&8 zV7G=%K~s!*g3xM4kIt(MOO9kQ0JSq{0u@Y&;C1i-8U8WCD_c-!ikkJok-tg!|)~?f^E#{xQ`Zx8JvF)1T zWR3I8roGOGf8M$NmHE2g0oql=K*B4oBYgbEKyn9;lrCLBLxl-iP zip=+GuYSCLL+WZ<^dqAeE8K5?{E#(mUe=C8Z?jXcZ|#~GeOqdExbvFng>QdGu9JUY zv4u1DlxTkVX2at}j{>+v?U$#$@7x!D_QUPKVCyaM%Tt|pt4-~z`qMY-Zc4G~!~DE= zi;{nJ2mH8Z6=Z#}KP;&I6~XVpu+yyurI zclnS_r5zjU_H0`x zuWxd!Xh-pDq3??&%Zu$wSGnH~4644f_}SCOz3NkHO}}2vzP6Dsf3eKH+pY>{gSX$> z@Ux4L!K%f0e#+_sN-7K&)aEqcbD5m)+$W-+oIe)ree#`iPs5X|X8Nq_?T@y*O}cmXA~1{&KM7IxtUn4W(?CJGQOeV+ m6O_fzWdVbq!30eHVSd(9<8dlc?=rAVW$<+Mb6Mw<&;$UJGNo() literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1memory_1_1chunk__alloc-members.html b/doc/api/html/classstan_1_1memory_1_1chunk__alloc-members.html new file mode 100644 index 00000000000..17d9c484415 --- /dev/null +++ b/doc/api/html/classstan_1_1memory_1_1chunk__alloc-members.html @@ -0,0 +1,117 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::memory::chunk_alloc< T, Tnchunks_per_block > Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1memory_1_1chunk__alloc.html b/doc/api/html/classstan_1_1memory_1_1chunk__alloc.html new file mode 100644 index 00000000000..c6566425652 --- /dev/null +++ b/doc/api/html/classstan_1_1memory_1_1chunk__alloc.html @@ -0,0 +1,299 @@ + + + + + +Stan: stan::memory::chunk_alloc< T, Tnchunks_per_block > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::memory::chunk_alloc< T, Tnchunks_per_block > Class Template Reference
+
+
+ +

#include <chunk_alloc.hpp>

+ + + + + + + + + + + + + + + + + +

+Public Member Functions

 chunk_alloc ()
 Construct a resizable chunk allocator initially holding the specified number of bytes.
 
 ~chunk_alloc ()
 Destroy this memory allocator.
 
void * alloc ()
 Return a newly allocated chunk of memory of the appropriate size managed by the stack allocator.
 
void recover_all ()
 Recover all the memory used by the stack allocator.
 
void free_all ()
 Free all memory used by the stack allocator other than the initial block allocation back to the system.
 
+

Detailed Description

+

template<typename T, size_t Tnchunks_per_block = DEFAULT_INITIAL_NCHUNKS>
+class stan::memory::chunk_alloc< T, Tnchunks_per_block >

+ + +

Definition at line 19 of file chunk_alloc.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename T , size_t Tnchunks_per_block = DEFAULT_INITIAL_NCHUNKS>
+ + + + + +
+ + + + + + + +
stan::memory::chunk_alloc< T, Tnchunks_per_block >::chunk_alloc ()
+
+inline
+
+ +

Construct a resizable chunk allocator initially holding the specified number of bytes.

+
Exceptions
+ + +
std::runtime_errorif the underlying malloc is not 8-byte aligned.
+
+
+ +

Definition at line 34 of file chunk_alloc.hpp.

+ +
+
+ +
+
+
+template<typename T , size_t Tnchunks_per_block = DEFAULT_INITIAL_NCHUNKS>
+ + + + + +
+ + + + + + + +
stan::memory::chunk_alloc< T, Tnchunks_per_block >::~chunk_alloc ()
+
+inline
+
+ +

Destroy this memory allocator.

+

This is implemented as a no-op as there is no destruction required.

+ +

Definition at line 48 of file chunk_alloc.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename T , size_t Tnchunks_per_block = DEFAULT_INITIAL_NCHUNKS>
+ + + + + +
+ + + + + + + +
void* stan::memory::chunk_alloc< T, Tnchunks_per_block >::alloc ()
+
+inline
+
+ +

Return a newly allocated chunk of memory of the appropriate size managed by the stack allocator.

+
Returns
A pointer to the allocated memory.
+ +

Definition at line 61 of file chunk_alloc.hpp.

+ +
+
+ +
+
+
+template<typename T , size_t Tnchunks_per_block = DEFAULT_INITIAL_NCHUNKS>
+ + + + + +
+ + + + + + + +
void stan::memory::chunk_alloc< T, Tnchunks_per_block >::free_all ()
+
+inline
+
+ +

Free all memory used by the stack allocator other than the initial block allocation back to the system.

+

Note: the destructor will free all memory.

+ +

Definition at line 95 of file chunk_alloc.hpp.

+ +
+
+ +
+
+
+template<typename T , size_t Tnchunks_per_block = DEFAULT_INITIAL_NCHUNKS>
+ + + + + +
+ + + + + + + +
void stan::memory::chunk_alloc< T, Tnchunks_per_block >::recover_all ()
+
+inline
+
+ +

Recover all the memory used by the stack allocator.

+

The stack of memory blocks allocated so far will be available for further allocations. To free memory back to the system, use the function free_all().

+ +

Definition at line 85 of file chunk_alloc.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1memory_1_1stack__alloc-members.html b/doc/api/html/classstan_1_1memory_1_1stack__alloc-members.html new file mode 100644 index 00000000000..947a49768d1 --- /dev/null +++ b/doc/api/html/classstan_1_1memory_1_1stack__alloc-members.html @@ -0,0 +1,117 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::memory::stack_alloc Member List
+
+
+ +

This is the complete list of members for stan::memory::stack_alloc, including all inherited members.

+ + + + + + +
alloc(size_t len)stan::memory::stack_allocinline
free_all()stan::memory::stack_allocinline
recover_all()stan::memory::stack_allocinline
stack_alloc(size_t initial_nbytes=DEFAULT_INITIAL_NBYTES)stan::memory::stack_allocinline
~stack_alloc()stan::memory::stack_allocinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1memory_1_1stack__alloc.html b/doc/api/html/classstan_1_1memory_1_1stack__alloc.html new file mode 100644 index 00000000000..b5cd445ca46 --- /dev/null +++ b/doc/api/html/classstan_1_1memory_1_1stack__alloc.html @@ -0,0 +1,309 @@ + + + + + +Stan: stan::memory::stack_alloc Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::memory::stack_alloc Class Reference
+
+
+ +

An instance of this class provides a memory pool through which blocks of raw memory may be allocated and then collected simultaneously. + More...

+ +

#include <stack_alloc.hpp>

+ + + + + + + + + + + + + + + + + +

+Public Member Functions

 stack_alloc (size_t initial_nbytes=DEFAULT_INITIAL_NBYTES)
 Construct a resizable stack allocator initially holding the specified number of bytes.
 
 ~stack_alloc ()
 Destroy this memory allocator.
 
void * alloc (size_t len)
 Return a newly allocated block of memory of the appropriate size managed by the stack allocator.
 
void recover_all ()
 Recover all the memory used by the stack allocator.
 
void free_all ()
 Free all memory used by the stack allocator other than the initial block allocation back to the system.
 
+

Detailed Description

+

An instance of this class provides a memory pool through which blocks of raw memory may be allocated and then collected simultaneously.

+

This class is useful in settings where large numbers of small objects are allocated and then collected all at once. This may include objects whose destructors have no effect.

+

Memory is allocated on a stack of blocks. Each block allocated is twice as large as the previous one. The memory may be recovered, with the blocks being reused, or all blocks may be freed, resetting the stack of blocks to its original state.

+

Alignment up to 8 byte boundaries guaranteed for the first malloc, and after that it's up to the caller. On 64-bit architectures, all struct values should be padded to 8-byte boundaries if they contain an 8-byte member or a virtual function.

+ +

Definition at line 79 of file stack_alloc.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::memory::stack_alloc::stack_alloc (size_t initial_nbytes = DEFAULT_INITIAL_NBYTES)
+
+inline
+
+ +

Construct a resizable stack allocator initially holding the specified number of bytes.

+
Parameters
+ + +
initial_nbytesInitial number of bytes for the allocator. Defaults to (1 << 16) = 64KB initial bytes.
+
+
+
Exceptions
+ + +
std::runtime_errorif the underlying malloc is not 8-byte aligned.
+
+
+ +

Definition at line 130 of file stack_alloc.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
stan::memory::stack_alloc::~stack_alloc ()
+
+inline
+
+ +

Destroy this memory allocator.

+

This is implemented as a no-op as there is no destruction required.

+ +

Definition at line 147 of file stack_alloc.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
void* stan::memory::stack_alloc::alloc (size_t len)
+
+inline
+
+ +

Return a newly allocated block of memory of the appropriate size managed by the stack allocator.

+

The allocated pointer will be 8-byte aligned.

+

This function may call C++'s malloc() function, with any exceptions percolated throught this function.

+
Parameters
+ + +
lenNumber of bytes to allocate.
+
+
+
Returns
A pointer to the allocated memory.
+ +

Definition at line 166 of file stack_alloc.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
void stan::memory::stack_alloc::free_all ()
+
+inline
+
+ +

Free all memory used by the stack allocator other than the initial block allocation back to the system.

+

Note: the destructor will free all memory.

+ +

Definition at line 193 of file stack_alloc.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
void stan::memory::stack_alloc::recover_all ()
+
+inline
+
+ +

Recover all the memory used by the stack allocator.

+

The stack of memory blocks allocated so far will be available for further allocations. To free memory back to the system, use the function free_all().

+ +

Definition at line 182 of file stack_alloc.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1model_1_1prob__grad-members.html b/doc/api/html/classstan_1_1model_1_1prob__grad-members.html new file mode 100644 index 00000000000..e32db038d01 --- /dev/null +++ b/doc/api/html/classstan_1_1model_1_1prob__grad-members.html @@ -0,0 +1,120 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::model::prob_grad Member List
+
+
+ +

This is the complete list of members for stan::model::prob_grad, including all inherited members.

+ + + + + + + + + +
num_params_i() const stan::model::prob_gradinline
num_params_r() const stan::model::prob_gradinline
num_params_r__stan::model::prob_gradprotected
param_range_i(size_t idx) const stan::model::prob_gradinline
param_ranges_i__stan::model::prob_gradprotected
prob_grad(size_t num_params_r)stan::model::prob_gradinline
prob_grad(size_t num_params_r, std::vector< std::pair< int, int > > &param_ranges_i)stan::model::prob_gradinline
~prob_grad()stan::model::prob_gradinlinevirtual
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1model_1_1prob__grad.html b/doc/api/html/classstan_1_1model_1_1prob__grad.html new file mode 100644 index 00000000000..8ea4b1fd30e --- /dev/null +++ b/doc/api/html/classstan_1_1model_1_1prob__grad.html @@ -0,0 +1,360 @@ + + + + + +Stan: stan::model::prob_grad Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::model::prob_grad Class Reference
+
+
+ +

The prob_grad class represents the basic parameter holders for a model. + More...

+ +

#include <prob_grad.hpp>

+ + + + + + + + + + + + + + +

+Public Member Functions

 prob_grad (size_t num_params_r)
 
 prob_grad (size_t num_params_r, std::vector< std::pair< int, int > > &param_ranges_i)
 
virtual ~prob_grad ()
 
size_t num_params_r () const
 
size_t num_params_i () const
 
std::pair< int, int > param_range_i (size_t idx) const
 
+ + + + + +

+Protected Attributes

size_t num_params_r__
 
std::vector< std::pair< int,
+int > > 
param_ranges_i__
 
+

Detailed Description

+

The prob_grad class represents the basic parameter holders for a model.

+

The command bin/stanc builds Models extending this base helper class.

+ +

Definition at line 18 of file prob_grad.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::model::prob_grad::prob_grad (size_t num_params_r)
+
+inline
+
+ +

Definition at line 27 of file prob_grad.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
stan::model::prob_grad::prob_grad (size_t num_params_r,
std::vector< std::pair< int, int > > & param_ranges_i 
)
+
+inline
+
+ +

Definition at line 32 of file prob_grad.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
virtual stan::model::prob_grad::~prob_grad ()
+
+inlinevirtual
+
+ +

Definition at line 38 of file prob_grad.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + +
size_t stan::model::prob_grad::num_params_i () const
+
+inline
+
+ +

Definition at line 44 of file prob_grad.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
size_t stan::model::prob_grad::num_params_r () const
+
+inline
+
+ +

Definition at line 40 of file prob_grad.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
std::pair<int,int> stan::model::prob_grad::param_range_i (size_t idx) const
+
+inline
+
+ +

Definition at line 48 of file prob_grad.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
size_t stan::model::prob_grad::num_params_r__
+
+protected
+
+ +

Definition at line 22 of file prob_grad.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
std::vector<std::pair<int,int> > stan::model::prob_grad::param_ranges_i__
+
+protected
+
+ +

Definition at line 23 of file prob_grad.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1optimization_1_1_b_f_g_s_line_search-members.html b/doc/api/html/classstan_1_1optimization_1_1_b_f_g_s_line_search-members.html new file mode 100644 index 00000000000..ad4bfa907a4 --- /dev/null +++ b/doc/api/html/classstan_1_1optimization_1_1_b_f_g_s_line_search-members.html @@ -0,0 +1,156 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::optimization::BFGSLineSearch< M > Member List
+
+
+ +

This is the complete list of members for stan::optimization::BFGSLineSearch< M >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_alphastan::optimization::BFGSMinimizer< ModelAdaptor< M > >protected
_alpha0stan::optimization::BFGSMinimizer< ModelAdaptor< M > >protected
_alphak_1stan::optimization::BFGSMinimizer< ModelAdaptor< M > >protected
_fkstan::optimization::BFGSMinimizer< ModelAdaptor< M > >protected
_fk_1stan::optimization::BFGSMinimizer< ModelAdaptor< M > >protected
_funcstan::optimization::BFGSMinimizer< ModelAdaptor< M > >protected
_gkstan::optimization::BFGSMinimizer< ModelAdaptor< M > >protected
_gk_1stan::optimization::BFGSMinimizer< ModelAdaptor< M > >protected
_itNumstan::optimization::BFGSMinimizer< ModelAdaptor< M > >protected
_ldltstan::optimization::BFGSMinimizer< ModelAdaptor< M > >protected
_notestan::optimization::BFGSMinimizer< ModelAdaptor< M > >protected
_optsstan::optimization::BFGSMinimizer< ModelAdaptor< M > >
_skstan::optimization::BFGSMinimizer< ModelAdaptor< M > >protected
_sk_1stan::optimization::BFGSMinimizer< ModelAdaptor< M > >protected
_xkstan::optimization::BFGSMinimizer< ModelAdaptor< M > >protected
_xk_1stan::optimization::BFGSMinimizer< ModelAdaptor< M > >protected
alpha() conststan::optimization::BFGSMinimizer< ModelAdaptor< M > >inline
alpha0() conststan::optimization::BFGSMinimizer< ModelAdaptor< M > >inline
BFGSLineSearch(M &model, const std::vector< double > &params_r, const std::vector< int > &params_i, std::ostream *msgs=0)stan::optimization::BFGSLineSearch< M >inline
BFGSMinimizer(ModelAdaptor< M > &f)stan::optimization::BFGSMinimizer< ModelAdaptor< M > >inline
curr_f() conststan::optimization::BFGSMinimizer< ModelAdaptor< M > >inline
curr_g() conststan::optimization::BFGSMinimizer< ModelAdaptor< M > >inline
curr_s() conststan::optimization::BFGSMinimizer< ModelAdaptor< M > >inline
curr_x() conststan::optimization::BFGSMinimizer< ModelAdaptor< M > >inline
get_code_string(int retCode)stan::optimization::BFGSMinimizer< ModelAdaptor< M > >inline
grad(std::vector< double > &g)stan::optimization::BFGSLineSearch< M >inline
grad_evals()stan::optimization::BFGSLineSearch< M >inline
grad_norm()stan::optimization::BFGSLineSearch< M >inline
HessianT typedefstan::optimization::BFGSMinimizer< ModelAdaptor< M > >
idx_t typedefstan::optimization::BFGSLineSearch< M >
initialize(const VectorT &x0)stan::optimization::BFGSMinimizer< ModelAdaptor< M > >inline
iter_num() conststan::optimization::BFGSMinimizer< ModelAdaptor< M > >inline
logp()stan::optimization::BFGSLineSearch< M >inline
minimize(VectorT &x0)stan::optimization::BFGSMinimizer< ModelAdaptor< M > >inline
note() conststan::optimization::BFGSMinimizer< ModelAdaptor< M > >inline
params_r(std::vector< double > &x)stan::optimization::BFGSLineSearch< M >inline
prev_f() conststan::optimization::BFGSMinimizer< ModelAdaptor< M > >inline
prev_g() conststan::optimization::BFGSMinimizer< ModelAdaptor< M > >inline
prev_s() conststan::optimization::BFGSMinimizer< ModelAdaptor< M > >inline
prev_step_size() conststan::optimization::BFGSMinimizer< ModelAdaptor< M > >inline
prev_x() conststan::optimization::BFGSMinimizer< ModelAdaptor< M > >inline
step()stan::optimization::BFGSMinimizer< ModelAdaptor< M > >inline
vector_t typedefstan::optimization::BFGSLineSearch< M >
VectorT typedefstan::optimization::BFGSMinimizer< ModelAdaptor< M > >static
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1optimization_1_1_b_f_g_s_line_search.html b/doc/api/html/classstan_1_1optimization_1_1_b_f_g_s_line_search.html new file mode 100644 index 00000000000..c73e91e9df4 --- /dev/null +++ b/doc/api/html/classstan_1_1optimization_1_1_b_f_g_s_line_search.html @@ -0,0 +1,462 @@ + + + + + +Stan: stan::optimization::BFGSLineSearch< M > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::optimization::BFGSLineSearch< M > Class Template Reference
+
+
+ +

#include <bfgs.hpp>

+
+Inheritance diagram for stan::optimization::BFGSLineSearch< M >:
+
+
+ + +stan::optimization::BFGSMinimizer< ModelAdaptor< M > > + +
+ + + + + + + + + +

+Public Types

typedef BFGSMinimizer
+< ModelAdaptor< M > >::VectorT 
vector_t
 
typedef vector_t::size_type idx_t
 
- Public Types inherited from stan::optimization::BFGSMinimizer< ModelAdaptor< M > >
typedef Eigen::Matrix< double,
+Eigen::Dynamic, Eigen::Dynamic > 
HessianT
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 BFGSLineSearch (M &model, const std::vector< double > &params_r, const std::vector< int > &params_i, std::ostream *msgs=0)
 
size_t grad_evals ()
 
double logp ()
 
double grad_norm ()
 
void grad (std::vector< double > &g)
 
void params_r (std::vector< double > &x)
 
- Public Member Functions inherited from stan::optimization::BFGSMinimizer< ModelAdaptor< M > >
const double & curr_f () const
 
const VectorTcurr_x () const
 
const VectorTcurr_g () const
 
const VectorTcurr_s () const
 
const double & prev_f () const
 
const VectorTprev_x () const
 
const VectorTprev_g () const
 
const VectorTprev_s () const
 
double prev_step_size () const
 
const double & alpha0 () const
 
const double & alpha () const
 
const size_t iter_num () const
 
const std::string & note () const
 
std::string get_code_string (int retCode)
 
 BFGSMinimizer (ModelAdaptor< M > &f)
 
void initialize (const VectorT &x0)
 
int step ()
 
int minimize (VectorT &x0)
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Static Public Member Functions inherited from stan::optimization::BFGSMinimizer< ModelAdaptor< M > >
typedef Eigen::Matrix< double,
+Eigen::Dynamic, 1 > 
VectorT
 
- Public Attributes inherited from stan::optimization::BFGSMinimizer< ModelAdaptor< M > >
struct
+stan::optimization::BFGSMinimizer::BFGSOptions 
_opts
 
- Protected Attributes inherited from stan::optimization::BFGSMinimizer< ModelAdaptor< M > >
ModelAdaptor< M > & _func
 
VectorT _gk
 
VectorT _gk_1
 
VectorT _xk_1
 
VectorT _xk
 
VectorT _sk
 
VectorT _sk_1
 
double _fk
 
double _fk_1
 
double _alphak_1
 
double _alpha
 
double _alpha0
 
Eigen::LDLT< HessianT_ldlt
 
size_t _itNum
 
std::string _note
 
+

Detailed Description

+

template<typename M>
+class stan::optimization::BFGSLineSearch< M >

+ + +

Definition at line 556 of file bfgs.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename M>
+ + + + +
typedef vector_t::size_type stan::optimization::BFGSLineSearch< M >::idx_t
+
+ +

Definition at line 561 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename M>
+ + + + +
typedef BFGSMinimizer<ModelAdaptor<M> >::VectorT stan::optimization::BFGSLineSearch< M >::vector_t
+
+ +

Definition at line 560 of file bfgs.hpp.

+ +
+
+

Constructor & Destructor Documentation

+ +
+
+
+template<typename M>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::optimization::BFGSLineSearch< M >::BFGSLineSearch (M & model,
const std::vector< double > & params_r,
const std::vector< int > & params_i,
std::ostream * msgs = 0 
)
+
+inline
+
+ +

Definition at line 563 of file bfgs.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename M>
+ + + + + +
+ + + + + + + + +
void stan::optimization::BFGSLineSearch< M >::grad (std::vector< double > & g)
+
+inline
+
+ +

Definition at line 581 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename M>
+ + + + + +
+ + + + + + + +
size_t stan::optimization::BFGSLineSearch< M >::grad_evals ()
+
+inline
+
+ +

Definition at line 578 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename M>
+ + + + + +
+ + + + + + + +
double stan::optimization::BFGSLineSearch< M >::grad_norm ()
+
+inline
+
+ +

Definition at line 580 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename M>
+ + + + + +
+ + + + + + + +
double stan::optimization::BFGSLineSearch< M >::logp ()
+
+inline
+
+ +

Definition at line 579 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename M>
+ + + + + +
+ + + + + + + + +
void stan::optimization::BFGSLineSearch< M >::params_r (std::vector< double > & x)
+
+inline
+
+ +

Definition at line 587 of file bfgs.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1optimization_1_1_b_f_g_s_line_search.png b/doc/api/html/classstan_1_1optimization_1_1_b_f_g_s_line_search.png new file mode 100644 index 0000000000000000000000000000000000000000..0038e5d3393cd16316be9c94e06adfc8061efae7 GIT binary patch literal 1152 zcmeAS@N?(olHy`uVBq!ia0y~yU<6`@01jp#S+j*V2}nr<_=LFr|NkGzeDUUMY5$=K zKo%GuIBFXb*fj8#>$XM zPA{j3dG302@x->*ze}!ed-gMY|8=vwWf|9$lSb zUAwkQY+1OK&KaLyrcS-}2Gceh>+HVEU@m_-(!-(aA>E&DEH-uM-09E?>Ki69~)ldJQ?$TwC)&+@Qvc1mkb+^#QZvXP-Tf(dA zy!2yz^cBp#R zPv3BK=_OzU-9PkyamXYgPb+0uBzZ2KB;uttbxDAn7cf320i#rb;UAkk1E+(?N)d%g z{rx3e0v=kd9ZwQX<}w|b=*8INxsU-E&kX@VnhqL3B~wDU1iZ9ZIaH@IwM_D2bn;wE zsq`P&rAwzwniAwCBGSO3(1vFI&qG}K8 zpR=38FP8m^`l{oTe{OZ@@-5$rmv8@fd*8N=?JxiFEnPn~$~)jpx=wWXMV6Ui%M+J* z-Tw4_=MIf+`?SA4j%dAo?%m?OZ@<+py=(Z=@8Xe};->d!zUz6LpLsdShv)G7)@pY1 zr4Qq))%RTbzO?S?qwB79QJJyZtfyR_E9t-Tey`uklittbcdM4Qots%ZXP?^Fzh6q; zJ&Jny<G}7rK5k{T0RPmouitcK=ZAlv_UmE& zAKklpb>276_4}{Z)t(u0)u_%lN-cahC~X{OllT?0O?81GtE{J!KCQ_~Q< zPuJjpz8W;be!4AX_^*T(lb-^jyfi&Em$H16KXAy^=w;?dP|3pJ>FVdQ&MBb@08#lI AkN^Mx literal 0 HcmV?d00001 diff --git a/doc/api/html/classstan_1_1optimization_1_1_b_f_g_s_minimizer-members.html b/doc/api/html/classstan_1_1optimization_1_1_b_f_g_s_minimizer-members.html new file mode 100644 index 00000000000..e311892d13e --- /dev/null +++ b/doc/api/html/classstan_1_1optimization_1_1_b_f_g_s_minimizer-members.html @@ -0,0 +1,148 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod > Member List
+
+
+ +

This is the complete list of members for stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
_alphastan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >protected
_alpha0stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >protected
_alphak_1stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >protected
_fkstan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >protected
_fk_1stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >protected
_funcstan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >protected
_gkstan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >protected
_gk_1stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >protected
_itNumstan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >protected
_ldltstan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >protected
_notestan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >protected
_optsstan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >
_skstan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >protected
_sk_1stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >protected
_xkstan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >protected
_xk_1stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >protected
alpha() const stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >inline
alpha0() const stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >inline
BFGSMinimizer(FunctorType &f)stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >inline
curr_f() const stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >inline
curr_g() const stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >inline
curr_s() const stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >inline
curr_x() const stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >inline
get_code_string(int retCode)stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >inline
HessianT typedefstan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >
initialize(const VectorT &x0)stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >inline
iter_num() const stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >inline
minimize(VectorT &x0)stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >inline
note() const stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >inline
prev_f() const stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >inline
prev_g() const stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >inline
prev_s() const stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >inline
prev_step_size() const stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >inline
prev_x() const stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >inline
step()stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >inline
VectorT typedefstan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >static
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1optimization_1_1_b_f_g_s_minimizer.html b/doc/api/html/classstan_1_1optimization_1_1_b_f_g_s_minimizer.html new file mode 100644 index 00000000000..92ac4816979 --- /dev/null +++ b/doc/api/html/classstan_1_1optimization_1_1_b_f_g_s_minimizer.html @@ -0,0 +1,1132 @@ + + + + + +Stan: stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod > Class Template Reference
+
+
+ +

#include <bfgs.hpp>

+ + + + +

+Classes

struct  BFGSOptions
 
+ + + +

+Public Types

typedef Eigen::Matrix< Scalar,
+DimAtCompile, DimAtCompile > 
HessianT
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

const Scalar & curr_f () const
 
const VectorTcurr_x () const
 
const VectorTcurr_g () const
 
const VectorTcurr_s () const
 
const Scalar & prev_f () const
 
const VectorTprev_x () const
 
const VectorTprev_g () const
 
const VectorTprev_s () const
 
Scalar prev_step_size () const
 
const Scalar & alpha0 () const
 
const Scalar & alpha () const
 
const size_t iter_num () const
 
const std::string & note () const
 
std::string get_code_string (int retCode)
 
 BFGSMinimizer (FunctorType &f)
 
void initialize (const VectorT &x0)
 
int step ()
 
int minimize (VectorT &x0)
 
+ + + +

+Static Public Member Functions

typedef Eigen::Matrix< Scalar,
+DimAtCompile, 1 > 
VectorT
 
+ + + +

+Public Attributes

struct
+stan::optimization::BFGSMinimizer::BFGSOptions 
_opts
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Protected Attributes

FunctorType & _func
 
VectorT _gk
 
VectorT _gk_1
 
VectorT _xk_1
 
VectorT _xk
 
VectorT _sk
 
VectorT _sk_1
 
Scalar _fk
 
Scalar _fk_1
 
Scalar _alphak_1
 
Scalar _alpha
 
Scalar _alpha0
 
Eigen::LDLT< HessianT_ldlt
 
size_t _itNum
 
std::string _note
 
+

Detailed Description

+

template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+class stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >

+ + +

Definition at line 234 of file bfgs.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + +
typedef Eigen::Matrix<Scalar,DimAtCompile,DimAtCompile> stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::HessianT
+
+ +

Definition at line 237 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + +
typedef Eigen::Matrix<Scalar,DimAtCompile,1> stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::VectorT
+
+static
+
+ +

Definition at line 236 of file bfgs.hpp.

+ +
+
+

Constructor & Destructor Documentation

+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + + + + + +
stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::BFGSMinimizer (FunctorType & f)
+
+inline
+
+ +

Definition at line 309 of file bfgs.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + + + + +
const Scalar& stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::alpha () const
+
+inline
+
+ +

Definition at line 261 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + + + + +
const Scalar& stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::alpha0 () const
+
+inline
+
+ +

Definition at line 260 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + + + + +
const Scalar& stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::curr_f () const
+
+inline
+
+ +

Definition at line 249 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + + + + +
const VectorT& stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::curr_g () const
+
+inline
+
+ +

Definition at line 251 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + + + + +
const VectorT& stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::curr_s () const
+
+inline
+
+ +

Definition at line 252 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + + + + +
const VectorT& stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::curr_x () const
+
+inline
+
+ +

Definition at line 250 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + + + + + +
std::string stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::get_code_string (int retCode)
+
+inline
+
+ +

Definition at line 266 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + + + + + +
void stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::initialize (const VectorTx0)
+
+inline
+
+ +

Definition at line 311 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + + + + +
const size_t stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::iter_num () const
+
+inline
+
+ +

Definition at line 262 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + + + + + +
int stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::minimize (VectorTx0)
+
+inline
+
+ +

Definition at line 447 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + + + + +
const std::string& stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::note () const
+
+inline
+
+ +

Definition at line 264 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + + + + +
const Scalar& stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::prev_f () const
+
+inline
+
+ +

Definition at line 254 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + + + + +
const VectorT& stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::prev_g () const
+
+inline
+
+ +

Definition at line 256 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + + + + +
const VectorT& stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::prev_s () const
+
+inline
+
+ +

Definition at line 257 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + + + + +
Scalar stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::prev_step_size () const
+
+inline
+
+ +

Definition at line 258 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + + + + +
const VectorT& stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::prev_x () const
+
+inline
+
+ +

Definition at line 255 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + + + + +
int stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::step ()
+
+inline
+
+ +

Definition at line 323 of file bfgs.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + +
Scalar stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::_alpha
+
+protected
+
+ +

Definition at line 243 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + +
Scalar stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::_alpha0
+
+protected
+
+ +

Definition at line 243 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + +
Scalar stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::_alphak_1
+
+protected
+
+ +

Definition at line 242 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + +
Scalar stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::_fk
+
+protected
+
+ +

Definition at line 242 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + +
Scalar stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::_fk_1
+
+protected
+
+ +

Definition at line 242 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + +
FunctorType& stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::_func
+
+protected
+
+ +

Definition at line 240 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + +
VectorT stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::_gk
+
+protected
+
+ +

Definition at line 241 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + +
VectorT stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::_gk_1
+
+protected
+
+ +

Definition at line 241 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + +
size_t stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::_itNum
+
+protected
+
+ +

Definition at line 245 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + +
Eigen::LDLT< HessianT > stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::_ldlt
+
+protected
+
+ +

Definition at line 244 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + +
std::string stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::_note
+
+protected
+
+ +

Definition at line 246 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + +
struct stan::optimization::BFGSMinimizer::BFGSOptions stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::_opts
+
+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + +
VectorT stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::_sk
+
+protected
+
+ +

Definition at line 241 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + +
VectorT stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::_sk_1
+
+protected
+
+ +

Definition at line 241 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + +
VectorT stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::_xk
+
+protected
+
+ +

Definition at line 241 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + +
VectorT stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::_xk_1
+
+protected
+
+ +

Definition at line 241 of file bfgs.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1optimization_1_1_model_adaptor-members.html b/doc/api/html/classstan_1_1optimization_1_1_model_adaptor-members.html new file mode 100644 index 00000000000..98d6c016991 --- /dev/null +++ b/doc/api/html/classstan_1_1optimization_1_1_model_adaptor-members.html @@ -0,0 +1,117 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::optimization::ModelAdaptor< M > Member List
+
+
+ +

This is the complete list of members for stan::optimization::ModelAdaptor< M >, including all inherited members.

+ + + + + + +
df(const Eigen::Matrix< double, Eigen::Dynamic, 1 > &x, Eigen::Matrix< double, Eigen::Dynamic, 1 > &g)stan::optimization::ModelAdaptor< M >inline
fevals() const stan::optimization::ModelAdaptor< M >inline
ModelAdaptor(M &model, const std::vector< int > &params_i, std::ostream *msgs)stan::optimization::ModelAdaptor< M >inline
operator()(const Eigen::Matrix< double, Eigen::Dynamic, 1 > &x, double &f)stan::optimization::ModelAdaptor< M >inline
operator()(const Eigen::Matrix< double, Eigen::Dynamic, 1 > &x, double &f, Eigen::Matrix< double, Eigen::Dynamic, 1 > &g)stan::optimization::ModelAdaptor< M >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1optimization_1_1_model_adaptor.html b/doc/api/html/classstan_1_1optimization_1_1_model_adaptor.html new file mode 100644 index 00000000000..c22c571f304 --- /dev/null +++ b/doc/api/html/classstan_1_1optimization_1_1_model_adaptor.html @@ -0,0 +1,330 @@ + + + + + +Stan: stan::optimization::ModelAdaptor< M > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::optimization::ModelAdaptor< M > Class Template Reference
+
+
+ +

#include <bfgs.hpp>

+ + + + + + + + + + + + +

+Public Member Functions

 ModelAdaptor (M &model, const std::vector< int > &params_i, std::ostream *msgs)
 
size_t fevals () const
 
int operator() (const Eigen::Matrix< double, Eigen::Dynamic, 1 > &x, double &f)
 
int operator() (const Eigen::Matrix< double, Eigen::Dynamic, 1 > &x, double &f, Eigen::Matrix< double, Eigen::Dynamic, 1 > &g)
 
int df (const Eigen::Matrix< double, Eigen::Dynamic, 1 > &x, Eigen::Matrix< double, Eigen::Dynamic, 1 > &g)
 
+

Detailed Description

+

template<class M>
+class stan::optimization::ModelAdaptor< M >

+ + +

Definition at line 468 of file bfgs.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<class M >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
stan::optimization::ModelAdaptor< M >::ModelAdaptor (M & model,
const std::vector< int > & params_i,
std::ostream * msgs 
)
+
+inline
+
+ +

Definition at line 477 of file bfgs.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<class M >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
int stan::optimization::ModelAdaptor< M >::df (const Eigen::Matrix< double, Eigen::Dynamic, 1 > & x,
Eigen::Matrix< double, Eigen::Dynamic, 1 > & g 
)
+
+inline
+
+ +

Definition at line 548 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<class M >
+ + + + + +
+ + + + + + + +
size_t stan::optimization::ModelAdaptor< M >::fevals () const
+
+inline
+
+ +

Definition at line 482 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<class M >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
int stan::optimization::ModelAdaptor< M >::operator() (const Eigen::Matrix< double, Eigen::Dynamic, 1 > & x,
double & f 
)
+
+inline
+
+ +

Definition at line 483 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<class M >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
int stan::optimization::ModelAdaptor< M >::operator() (const Eigen::Matrix< double, Eigen::Dynamic, 1 > & x,
double & f,
Eigen::Matrix< double, Eigen::Dynamic, 1 > & g 
)
+
+inline
+
+ +

Definition at line 508 of file bfgs.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1optimization_1_1_nesterov_gradient-members.html b/doc/api/html/classstan_1_1optimization_1_1_nesterov_gradient-members.html new file mode 100644 index 00000000000..32ad1ec9bf0 --- /dev/null +++ b/doc/api/html/classstan_1_1optimization_1_1_nesterov_gradient-members.html @@ -0,0 +1,118 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::optimization::NesterovGradient< M > Member List
+
+
+ +

This is the complete list of members for stan::optimization::NesterovGradient< M >, including all inherited members.

+ + + + + + + +
grad(std::vector< double > &g)stan::optimization::NesterovGradient< M >inline
initialize_epsilon()stan::optimization::NesterovGradient< M >inline
logp()stan::optimization::NesterovGradient< M >inline
NesterovGradient(M &model, const std::vector< double > &params_r, const std::vector< int > &params_i, double epsilon=-1, std::ostream *output_stream=0)stan::optimization::NesterovGradient< M >inline
params_r(std::vector< double > &x)stan::optimization::NesterovGradient< M >inline
step()stan::optimization::NesterovGradient< M >inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1optimization_1_1_nesterov_gradient.html b/doc/api/html/classstan_1_1optimization_1_1_nesterov_gradient.html new file mode 100644 index 00000000000..3e689390e61 --- /dev/null +++ b/doc/api/html/classstan_1_1optimization_1_1_nesterov_gradient.html @@ -0,0 +1,334 @@ + + + + + +Stan: stan::optimization::NesterovGradient< M > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::optimization::NesterovGradient< M > Class Template Reference
+
+
+ +

#include <nesterov_gradient.hpp>

+ + + + + + + + + + + + + + +

+Public Member Functions

void initialize_epsilon ()
 
 NesterovGradient (M &model, const std::vector< double > &params_r, const std::vector< int > &params_i, double epsilon=-1, std::ostream *output_stream=0)
 
double logp ()
 
void grad (std::vector< double > &g)
 
void params_r (std::vector< double > &x)
 
double step ()
 
+

Detailed Description

+

template<class M>
+class stan::optimization::NesterovGradient< M >

+ + +

Definition at line 13 of file nesterov_gradient.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<class M>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::optimization::NesterovGradient< M >::NesterovGradient (M & model,
const std::vector< double > & params_r,
const std::vector< int > & params_i,
double epsilon = -1,
std::ostream * output_stream = 0 
)
+
+inline
+
+ +

Definition at line 104 of file nesterov_gradient.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<class M>
+ + + + + +
+ + + + + + + + +
void stan::optimization::NesterovGradient< M >::grad (std::vector< double > & g)
+
+inline
+
+ +

Definition at line 121 of file nesterov_gradient.hpp.

+ +
+
+ +
+
+
+template<class M>
+ + + + + +
+ + + + + + + +
void stan::optimization::NesterovGradient< M >::initialize_epsilon ()
+
+inline
+
+ +

Definition at line 34 of file nesterov_gradient.hpp.

+ +
+
+ +
+
+
+template<class M>
+ + + + + +
+ + + + + + + +
double stan::optimization::NesterovGradient< M >::logp ()
+
+inline
+
+ +

Definition at line 120 of file nesterov_gradient.hpp.

+ +
+
+ +
+
+
+template<class M>
+ + + + + +
+ + + + + + + + +
void stan::optimization::NesterovGradient< M >::params_r (std::vector< double > & x)
+
+inline
+
+ +

Definition at line 122 of file nesterov_gradient.hpp.

+ +
+
+ +
+
+
+template<class M>
+ + + + + +
+ + + + + + + +
double stan::optimization::NesterovGradient< M >::step ()
+
+inline
+
+ +

Definition at line 124 of file nesterov_gradient.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1prob_1_1welford__covar__estimator-members.html b/doc/api/html/classstan_1_1prob_1_1welford__covar__estimator-members.html new file mode 100644 index 00000000000..ad5a3591f54 --- /dev/null +++ b/doc/api/html/classstan_1_1prob_1_1welford__covar__estimator-members.html @@ -0,0 +1,121 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::prob::welford_covar_estimator Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1prob_1_1welford__covar__estimator.html b/doc/api/html/classstan_1_1prob_1_1welford__covar__estimator.html new file mode 100644 index 00000000000..d4ade3b83e1 --- /dev/null +++ b/doc/api/html/classstan_1_1prob_1_1welford__covar__estimator.html @@ -0,0 +1,369 @@ + + + + + +Stan: stan::prob::welford_covar_estimator Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::prob::welford_covar_estimator Class Reference
+
+
+ +

#include <welford_covar_estimator.hpp>

+ + + + + + + + + + + + + + +

+Public Member Functions

 welford_covar_estimator (int n)
 
void restart ()
 
void add_sample (const Eigen::VectorXd &q)
 
int num_samples ()
 
void sample_mean (Eigen::VectorXd &mean)
 
void sample_covariance (Eigen::MatrixXd &covar)
 
+ + + + + + + +

+Protected Attributes

double _num_samples
 
Eigen::VectorXd _m
 
Eigen::MatrixXd _m2
 
+

Detailed Description

+
+

Definition at line 11 of file welford_covar_estimator.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::prob::welford_covar_estimator::welford_covar_estimator (int n)
+
+inline
+
+ +

Definition at line 15 of file welford_covar_estimator.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
void stan::prob::welford_covar_estimator::add_sample (const Eigen::VectorXd & q)
+
+inline
+
+ +

Definition at line 25 of file welford_covar_estimator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
int stan::prob::welford_covar_estimator::num_samples ()
+
+inline
+
+ +

Definition at line 35 of file welford_covar_estimator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
void stan::prob::welford_covar_estimator::restart ()
+
+inline
+
+ +

Definition at line 19 of file welford_covar_estimator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::prob::welford_covar_estimator::sample_covariance (Eigen::MatrixXd & covar)
+
+inline
+
+ +

Definition at line 39 of file welford_covar_estimator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::prob::welford_covar_estimator::sample_mean (Eigen::VectorXd & mean)
+
+inline
+
+ +

Definition at line 37 of file welford_covar_estimator.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
Eigen::VectorXd stan::prob::welford_covar_estimator::_m
+
+protected
+
+ +

Definition at line 48 of file welford_covar_estimator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
Eigen::MatrixXd stan::prob::welford_covar_estimator::_m2
+
+protected
+
+ +

Definition at line 49 of file welford_covar_estimator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
double stan::prob::welford_covar_estimator::_num_samples
+
+protected
+
+ +

Definition at line 46 of file welford_covar_estimator.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1prob_1_1welford__var__estimator-members.html b/doc/api/html/classstan_1_1prob_1_1welford__var__estimator-members.html new file mode 100644 index 00000000000..7769e9ff2ad --- /dev/null +++ b/doc/api/html/classstan_1_1prob_1_1welford__var__estimator-members.html @@ -0,0 +1,121 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::prob::welford_var_estimator Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/classstan_1_1prob_1_1welford__var__estimator.html b/doc/api/html/classstan_1_1prob_1_1welford__var__estimator.html new file mode 100644 index 00000000000..ab72b4b3ba5 --- /dev/null +++ b/doc/api/html/classstan_1_1prob_1_1welford__var__estimator.html @@ -0,0 +1,369 @@ + + + + + +Stan: stan::prob::welford_var_estimator Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::prob::welford_var_estimator Class Reference
+
+
+ +

#include <welford_var_estimator.hpp>

+ + + + + + + + + + + + + + +

+Public Member Functions

 welford_var_estimator (int n)
 
void restart ()
 
void add_sample (const Eigen::VectorXd &q)
 
int num_samples ()
 
void sample_mean (Eigen::VectorXd &mean)
 
void sample_variance (Eigen::VectorXd &var)
 
+ + + + + + + +

+Protected Attributes

double _num_samples
 
Eigen::VectorXd _m
 
Eigen::VectorXd _m2
 
+

Detailed Description

+
+

Definition at line 11 of file welford_var_estimator.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::prob::welford_var_estimator::welford_var_estimator (int n)
+
+inline
+
+ +

Definition at line 15 of file welford_var_estimator.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
void stan::prob::welford_var_estimator::add_sample (const Eigen::VectorXd & q)
+
+inline
+
+ +

Definition at line 25 of file welford_var_estimator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
int stan::prob::welford_var_estimator::num_samples ()
+
+inline
+
+ +

Definition at line 35 of file welford_var_estimator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
void stan::prob::welford_var_estimator::restart ()
+
+inline
+
+ +

Definition at line 19 of file welford_var_estimator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::prob::welford_var_estimator::sample_mean (Eigen::VectorXd & mean)
+
+inline
+
+ +

Definition at line 37 of file welford_var_estimator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::prob::welford_var_estimator::sample_variance (Eigen::VectorXd & var)
+
+inline
+
+ +

Definition at line 39 of file welford_var_estimator.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
Eigen::VectorXd stan::prob::welford_var_estimator::_m
+
+protected
+
+ +

Definition at line 48 of file welford_var_estimator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
Eigen::VectorXd stan::prob::welford_var_estimator::_m2
+
+protected
+
+ +

Definition at line 49 of file welford_var_estimator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
double stan::prob::welford_var_estimator::_num_samples
+
+protected
+
+ +

Definition at line 46 of file welford_var_estimator.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/closed.png b/doc/api/html/closed.png new file mode 100644 index 0000000000000000000000000000000000000000..98cc2c909da37a6df914fbf67780eebd99c597f5 GIT binary patch literal 132 zcmeAS@N?(olHy`uVBq!ia0vp^oFL4>1|%O$WD@{V-kvUwAr*{o@8{^CZMh(5KoB^r_<4^zF@3)Cp&&t3hdujKf f*?bjBoY!V+E))@{xMcbjXe@)LtDnm{r-UW|*e5JT literal 0 HcmV?d00001 diff --git a/doc/api/html/cmd__line_8hpp.html b/doc/api/html/cmd__line_8hpp.html new file mode 100644 index 00000000000..b2f2966e710 --- /dev/null +++ b/doc/api/html/cmd__line_8hpp.html @@ -0,0 +1,153 @@ + + + + + +Stan: src/stan/io/cmd_line.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
cmd_line.hpp File Reference
+
+
+
#include <map>
+#include <ostream>
+#include <set>
+#include <string>
+#include <sstream>
+#include <vector>
+
+

Go to the source code of this file.

+ + + + + +

+Classes

class  stan::io::cmd_line
 Parses and stores command-line arguments. More...
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::io
 Input/output utilities.
 
+ + + + + + + + + + + + + + + + +

+Functions

void stan::io::pad_help_option (std::ostream *o, const std::string &option="", unsigned int width=20)
 Print help option with padding.
 
void stan::io::print_help_helper (std::ostream *o, const std::string &key_val, const std::string &msg, const std::string &note="")
 Prints single print option to output ptr if non-null.
 
void stan::io::print_help_option (std::ostream *o, const std::string &key, const std::string &value_type, const std::string &msg, const std::string &note="")
 Prints single print option to output ptr if non-null.
 
template<>
bool stan::io::cmd_line::bare< std::string > (size_t n, std::string &x) const
 
template<>
bool stan::io::cmd_line::val< std::string > (const std::string &key, std::string &x) const
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/cmd__line_8hpp_source.html b/doc/api/html/cmd__line_8hpp_source.html new file mode 100644 index 00000000000..60c534f7787 --- /dev/null +++ b/doc/api/html/cmd__line_8hpp_source.html @@ -0,0 +1,278 @@ + + + + + +Stan: src/stan/io/cmd_line.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
cmd_line.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__IO__CMD_LINE_HPP__
+
2 #define __STAN__IO__CMD_LINE_HPP__
+
3 
+
4 #include <map>
+
5 #include <ostream>
+
6 #include <set>
+
7 #include <string>
+
8 #include <sstream>
+
9 #include <vector>
+
10 
+
11 namespace stan {
+
12 
+
13  namespace io {
+
14 
+
27  void pad_help_option(std::ostream* o,
+
28  const std::string& option = "",
+
29  unsigned int width = 20) {
+
30  if (!o) return;
+
31  *o << " " << option;
+
32  int padding = width - option.size();
+
33  if (padding < 2) {
+
34  *o << std::endl;
+
35  padding = width + 2; // 2 is
+
36  }
+
37  for (int i = 0; i < padding; ++i)
+
38  *o << ' ';
+
39  }
+
40 
+
49  void print_help_helper(std::ostream* o,
+
50  const std::string& key_val,
+
51  const std::string& msg,
+
52  const std::string& note = "") {
+
53  if (!o) return;
+
54  pad_help_option(o,key_val);
+
55  *o << msg
+
56  << std::endl;
+
57  if (note.size() > 0) {
+
58  pad_help_option(o,"");
+
59  *o << " (" << note << ")"
+
60  << std::endl;
+
61  }
+
62  *o << std::endl;
+
63  }
+
64 
+
74  void print_help_option(std::ostream* o,
+
75  const std::string& key,
+
76  const std::string& value_type,
+
77  const std::string& msg,
+
78  const std::string& note = "") {
+
79  std::stringstream ss;
+
80  ss << "--" << key;
+
81  if (value_type.size() > 0)
+
82  ss << "=<" << value_type << ">";
+
83  print_help_helper(o,ss.str(),msg,note);
+
84  }
+
85 
+
113  class cmd_line {
+
114  private:
+
115  std::string cmd_;
+
116  std::map<std::string,std::string> key_val_;
+
117  std::set<std::string> flag_;
+
118  std::vector<std::string> bare_;
+
119  void parse_arg(const std::string& s) {
+
120  if (s.size() < 2
+
121  || s[0] != '-'
+
122  || s[1] != '-') {
+
123  bare_.push_back(s);
+
124  return;
+
125  }
+
126  for (size_t i = 2; i < s.size(); ++i) {
+
127  if (s[i] == '=') {
+
128  key_val_[s.substr(2,i - 2)] = s.substr(i + 1,s.size() - i - 1);
+
129  return;
+
130  }
+
131  }
+
132  flag_.insert(s.substr(2,s.size()));
+
133  }
+
134  public:
+
142  cmd_line(int argc, const char* argv[])
+
143  : cmd_(argv[0]) {
+
144  for (int i = 1; i < argc; ++i)
+
145  parse_arg(argv[i]);
+
146  }
+
147 
+
155  std::string command() {
+
156  return cmd_;
+
157  }
+
158 
+
165  bool has_key(const std::string& key) const {
+
166  return key_val_.find(key) != key_val_.end();
+
167  }
+
168 
+
188  template <typename T>
+
189  bool val(const std::string& key, T& x) const {
+
190  if (!has_key(key))
+
191  return false;
+
192  std::stringstream s(key_val_.find(key)->second);
+
193  s >> x;
+
194  return true;
+
195  }
+
196 
+
203  bool has_flag(const std::string& flag) const {
+
204  return flag_.find(flag) != flag_.end();
+
205  }
+
206 
+
212  size_t bare_size() const {
+
213  return bare_.size();
+
214  }
+
215 
+
229  template <typename T>
+
230  bool bare(size_t n, T& x) const {
+
231  if (n >= bare_.size())
+
232  return false;
+
233  std::stringstream s(bare_[n]);
+
234  s >> x;
+
235  return true;
+
236  }
+
237 
+
238 
+
245  void print(std::ostream& out) const {
+
246  out << "COMMAND=" << cmd_ << '\n';
+
247  size_t flag_count = 0;
+
248  for (std::set<std::string>::const_iterator it = flag_.begin();
+
249  it != flag_.end();
+
250  ++it) {
+
251  out << "FLAG " << flag_count << "=" << (*it) << '\n';
+
252  ++flag_count;
+
253  }
+
254  size_t key_val_count = 0;
+
255  for (std::map<std::string,std::string>::const_iterator it = key_val_.begin();
+
256  it != key_val_.end();
+
257  ++it) {
+
258  out << "KEY " << key_val_count << "=" << (*it).first;
+
259  out << " VAL " << key_val_count << "=" << (*it).second << '\n';
+
260  ++key_val_count;
+
261  }
+
262  size_t bare_count = 0;
+
263  for (size_t i = 0; i < bare_.size(); ++i) {
+
264  out << "BARE ARG " << bare_count << "=" << bare_[i] << '\n';
+
265  ++bare_count;
+
266  }
+
267  }
+
268 
+
269  };
+
270 
+
271  // explicit instantation for std::string to allow for spaces
+
272  // in bare_[n]
+
273  template <>
+
274  bool cmd_line::bare<std::string>(size_t n, std::string& x) const {
+
275  if (n >= bare_.size())
+
276  return false;
+
277  x = bare_[n];
+
278  return true;
+
279  }
+
280 
+
281  // explicit instantation for std::string to allow for spaces
+
282  // in key_val_
+
283  template <>
+
284  bool cmd_line::val<std::string>(const std::string& key, std::string& x) const {
+
285  if (!has_key(key))
+
286  return false;
+
287  x = key_val_.find(key)->second;
+
288  return true;
+
289  }
+
290 
+
291 
+
292  }
+
293 
+
294 }
+
295 
+
296 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/col_8hpp.html b/doc/api/html/col_8hpp.html new file mode 100644 index 00000000000..ff51e4b68d0 --- /dev/null +++ b/doc/api/html/col_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/math/matrix/col.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
col.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
stan::math::col (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &m, size_t j)
 Return the specified column of the specified matrix using start-at-1 indexing.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/col_8hpp_source.html b/doc/api/html/col_8hpp_source.html new file mode 100644 index 00000000000..9806c29216f --- /dev/null +++ b/doc/api/html/col_8hpp_source.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/math/matrix/col.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
col.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__COL_HPP__
+
2 #define __STAN__MATH__MATRIX__COL_HPP__
+
3 
+ + +
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
21  template <typename T>
+
22  inline
+
23  Eigen::Matrix<T,Eigen::Dynamic,1>
+
24  col(const Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& m,
+
25  size_t j) {
+
26  validate_column_index(m,j,"col");
+
27  return m.col(j - 1);
+
28  }
+
29 
+
30  }
+
31 }
+
32 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/cols_8hpp.html b/doc/api/html/cols_8hpp.html new file mode 100644 index 00000000000..1410325283e --- /dev/null +++ b/doc/api/html/cols_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/matrix/cols.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
cols.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T , int R, int C>
size_t stan::math::cols (const Eigen::Matrix< T, R, C > &m)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/cols_8hpp_source.html b/doc/api/html/cols_8hpp_source.html new file mode 100644 index 00000000000..dcc44917309 --- /dev/null +++ b/doc/api/html/cols_8hpp_source.html @@ -0,0 +1,125 @@ + + + + + +Stan: src/stan/math/matrix/cols.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
cols.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__COLS_HPP__
+
2 #define __STAN__MATH__MATRIX__COLS_HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
9  template <typename T, int R, int C>
+
10  inline
+
11  size_t
+
12  cols(const Eigen::Matrix<T,R,C>& m) {
+
13  return m.cols();
+
14  }
+
15 
+
16  }
+
17 }
+
18 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/command_8hpp.html b/doc/api/html/command_8hpp.html new file mode 100644 index 00000000000..0e2a8f3f22f --- /dev/null +++ b/doc/api/html/command_8hpp.html @@ -0,0 +1,188 @@ + + + + + +Stan: src/stan/gm/command.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
command.hpp File Reference
+
+
+
#include <fstream>
+#include <stdexcept>
+#include <boost/date_time/posix_time/posix_time_types.hpp>
+#include <boost/math/special_functions/fpclassify.hpp>
+#include <boost/random/additive_combine.hpp>
+#include <boost/random/uniform_real_distribution.hpp>
+#include <stan/version.hpp>
+#include <stan/io/cmd_line.hpp>
+#include <stan/io/dump.hpp>
+#include <stan/io/mcmc_writer.hpp>
+#include <stan/gm/arguments/argument_parser.hpp>
+#include <stan/gm/arguments/arg_id.hpp>
+#include <stan/gm/arguments/arg_data.hpp>
+#include <stan/gm/arguments/arg_init.hpp>
+#include <stan/gm/arguments/arg_random.hpp>
+#include <stan/gm/arguments/arg_output.hpp>
+#include <stan/mcmc/hmc/static/adapt_unit_e_static_hmc.hpp>
+#include <stan/mcmc/hmc/static/adapt_diag_e_static_hmc.hpp>
+#include <stan/mcmc/hmc/static/adapt_dense_e_static_hmc.hpp>
+#include <stan/mcmc/hmc/nuts/adapt_unit_e_nuts.hpp>
+#include <stan/mcmc/hmc/nuts/adapt_diag_e_nuts.hpp>
+#include <stan/mcmc/hmc/nuts/adapt_dense_e_nuts.hpp>
+#include <stan/model/util.hpp>
+#include <stan/optimization/newton.hpp>
+#include <stan/optimization/nesterov_gradient.hpp>
+#include <stan/optimization/bfgs.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

void stan::gm::write_stan (std::ostream *s, const char prefix= '\0')
 
void stan::gm::write_model (std::ostream *s, std::string model_name, const char prefix= '\0')
 
void stan::gm::write_error_msg (std::ostream *error_stream, const std::domain_error &e)
 
bool stan::gm::do_print (int n, int refresh)
 
void stan::gm::print_progress (int m, int start, int finish, int refresh, bool warmup)
 
template<class Model , class RNG >
void stan::gm::run_markov_chain (stan::mcmc::base_mcmc *sampler, int num_iterations, int start, int finish, int num_thin, int refresh, bool save, bool warmup, stan::io::mcmc_writer< Model > &writer, stan::mcmc::sample &init_s, Model &model, RNG &base_rng)
 
template<class Model , class RNG >
void stan::gm::warmup (stan::mcmc::base_mcmc *sampler, int num_warmup, int num_samples, int num_thin, int refresh, bool save, stan::io::mcmc_writer< Model > &writer, stan::mcmc::sample &init_s, Model &model, RNG &base_rng)
 
template<class Model , class RNG >
void stan::gm::sample (stan::mcmc::base_mcmc *sampler, int num_warmup, int num_samples, int num_thin, int refresh, bool save, stan::io::mcmc_writer< Model > &writer, stan::mcmc::sample &init_s, Model &model, RNG &base_rng)
 
template<class Sampler >
bool stan::gm::init_static_hmc (stan::mcmc::base_mcmc *sampler, argument *algorithm)
 
template<class Sampler >
bool stan::gm::init_nuts (stan::mcmc::base_mcmc *sampler, argument *algorithm)
 
template<class Sampler >
bool stan::gm::init_adapt (Sampler *sampler, const double delta, const double gamma, const double kappa, const double t0, const Eigen::VectorXd &cont_params)
 
template<class Sampler >
bool stan::gm::init_adapt (stan::mcmc::base_mcmc *sampler, categorical_argument *adapt, const Eigen::VectorXd &cont_params)
 
template<class Sampler >
bool stan::gm::init_windowed_adapt (stan::mcmc::base_mcmc *sampler, categorical_argument *adapt, unsigned int num_warmup, const Eigen::VectorXd &cont_params)
 
template<class Model >
int stan::gm::command (int argc, const char *argv[])
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/command_8hpp_source.html b/doc/api/html/command_8hpp_source.html new file mode 100644 index 00000000000..6cdd121451c --- /dev/null +++ b/doc/api/html/command_8hpp_source.html @@ -0,0 +1,1087 @@ + + + + + +Stan: src/stan/gm/command.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
command.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__COMMAND_HPP__
+
2 #define __STAN__GM__COMMAND_HPP__
+
3 
+
4 #include <fstream>
+
5 #include <stdexcept>
+
6 
+
7 #include <boost/date_time/posix_time/posix_time_types.hpp>
+
8 #include <boost/math/special_functions/fpclassify.hpp>
+
9 #include <boost/random/additive_combine.hpp> // L'Ecuyer RNG
+
10 #include <boost/random/uniform_real_distribution.hpp>
+
11 
+
12 #include <stan/version.hpp>
+
13 #include <stan/io/cmd_line.hpp>
+
14 #include <stan/io/dump.hpp>
+
15 #include <stan/io/mcmc_writer.hpp>
+
16 
+ + + + + + +
23 
+ + + + + + +
30 
+
31 #include <stan/model/util.hpp>
+
32 
+ + + +
36 
+
37 namespace stan {
+
38 
+
39  namespace gm {
+
40 
+
41  void write_stan(std::ostream* s, const char prefix = '\0') {
+
42  if (!s) return;
+
43 
+
44  *s << prefix << " stan_version_major = " << stan::MAJOR_VERSION << std::endl;
+
45  *s << prefix << " stan_version_minor = " << stan::MINOR_VERSION << std::endl;
+
46  *s << prefix << " stan_version_patch = " << stan::PATCH_VERSION << std::endl;
+
47 
+
48  }
+
49 
+
50  void write_model(std::ostream* s, std::string model_name, const char prefix = '\0') {
+
51  if (!s) return;
+
52 
+
53  *s << prefix << " model = " << model_name << std::endl;
+
54 
+
55  }
+
56 
+
57  void write_error_msg(std::ostream* error_stream,
+
58  const std::domain_error& e) {
+
59 
+
60  if (!error_stream) return;
+
61 
+
62  *error_stream << std::endl
+
63  << "Informational Message: The current Metropolis proposal is about to be "
+
64  << "rejected becuase of the following issue:"
+
65  << std::endl
+
66  << e.what() << std::endl
+
67  << "If this warning occurs sporadically, such as for highly constrained "
+
68  << "variable types like covariance matrices, then the sampler is fine,"
+
69  << std::endl
+
70  << "but if this warning occurs often then your model may be either severely "
+
71  << "ill-conditioned or misspecified."
+
72  << std::endl;
+
73 
+
74  }
+
75 
+
76  bool do_print(int n, int refresh) {
+
77  return (refresh > 0) &&
+
78  (n == 0 || ((n + 1) % refresh == 0) );
+
79  }
+
80 
+
81  void print_progress(int m, int start, int finish, int refresh, bool warmup) {
+
82 
+
83  int it_print_width = std::ceil(std::log10(finish));
+
84 
+
85  if (do_print(m, refresh) || (start + m + 1 == finish) ) {
+
86 
+
87  std::cout << "Iteration: ";
+
88  std::cout << std::setw(it_print_width) << m + 1 + start
+
89  << " / " << finish;
+
90 
+
91  std::cout << " [" << std::setw(3)
+
92  << static_cast<int>( (100.0 * (start + m + 1)) / finish )
+
93  << "%] ";
+
94  std::cout << (warmup ? " (Warmup)" : " (Sampling)");
+
95  std::cout << std::endl;
+
96  }
+
97 
+
98  }
+
99 
+
100  template <class Model, class RNG>
+ +
102  int num_iterations,
+
103  int start,
+
104  int finish,
+
105  int num_thin,
+
106  int refresh,
+
107  bool save,
+
108  bool warmup,
+ +
110  stan::mcmc::sample& init_s,
+
111  Model& model,
+
112  RNG& base_rng) {
+
113 
+
114  for (int m = 0; m < num_iterations; ++m) {
+
115 
+
116  print_progress(m, start, finish, refresh, warmup);
+
117 
+
118  init_s = sampler->transition(init_s);
+
119 
+
120  if ( save && ( (m % num_thin) == 0) ) {
+
121  writer.print_sample_params(base_rng, init_s, *sampler, model);
+
122  writer.print_diagnostic_params(init_s, sampler);
+
123  }
+
124 
+
125  }
+
126 
+
127  }
+
128 
+
129  template <class Model, class RNG>
+ +
131  int num_warmup,
+
132  int num_samples,
+
133  int num_thin,
+
134  int refresh,
+
135  bool save,
+ +
137  stan::mcmc::sample& init_s,
+
138  Model& model,
+
139  RNG& base_rng) {
+
140 
+
141  run_markov_chain<Model, RNG>(sampler, num_warmup, 0, num_warmup + num_samples, num_thin,
+
142  refresh, save, true,
+
143  writer,
+
144  init_s, model, base_rng);
+
145 
+
146  }
+
147 
+
148  template <class Model, class RNG>
+ +
150  int num_warmup,
+
151  int num_samples,
+
152  int num_thin,
+
153  int refresh,
+
154  bool save,
+ +
156  stan::mcmc::sample& init_s,
+
157  Model& model,
+
158  RNG& base_rng) {
+
159 
+
160  run_markov_chain<Model, RNG>(sampler, num_samples, num_warmup, num_warmup + num_samples, num_thin,
+
161  refresh, save, false,
+
162  writer,
+
163  init_s, model, base_rng);
+
164 
+
165  }
+
166 
+
167 
+
168  template<class Sampler>
+
169  bool init_static_hmc(stan::mcmc::base_mcmc* sampler, argument* algorithm) {
+
170 
+
171  categorical_argument* hmc = dynamic_cast<categorical_argument*>(
+
172  algorithm->arg("hmc"));
+
173 
+
174  categorical_argument* base = dynamic_cast<categorical_argument*>(
+
175  algorithm->arg("hmc")->arg("engine")->arg("static"));
+
176 
+
177  double epsilon = dynamic_cast<real_argument*>(hmc->arg("stepsize"))->value();
+
178  double epsilon_jitter = dynamic_cast<real_argument*>(hmc->arg("stepsize_jitter"))->value();
+
179  double int_time = dynamic_cast<real_argument*>(base->arg("int_time"))->value();
+
180 
+
181  dynamic_cast<Sampler*>(sampler)->set_nominal_stepsize_and_T(epsilon, int_time);
+
182  dynamic_cast<Sampler*>(sampler)->set_stepsize_jitter(epsilon_jitter);
+
183 
+
184 
+
185  return true;
+
186 
+
187  }
+
188 
+
189  template<class Sampler>
+
190  bool init_nuts(stan::mcmc::base_mcmc* sampler, argument* algorithm) {
+
191 
+
192  categorical_argument* hmc = dynamic_cast<categorical_argument*>(
+
193  algorithm->arg("hmc"));
+
194 
+
195  categorical_argument* base = dynamic_cast<categorical_argument*>(
+
196  algorithm->arg("hmc")->arg("engine")->arg("nuts"));
+
197 
+
198  double epsilon = dynamic_cast<real_argument*>(hmc->arg("stepsize"))->value();
+
199  double epsilon_jitter = dynamic_cast<real_argument*>(hmc->arg("stepsize_jitter"))->value();
+
200  int max_depth = dynamic_cast<int_argument*>(base->arg("max_depth"))->value();
+
201 
+
202  dynamic_cast<Sampler*>(sampler)->set_nominal_stepsize(epsilon);
+
203  dynamic_cast<Sampler*>(sampler)->set_stepsize_jitter(epsilon_jitter);
+
204  dynamic_cast<Sampler*>(sampler)->set_max_depth(max_depth);
+
205 
+
206  return true;
+
207 
+
208  }
+
209 
+
210  template<class Sampler>
+
211  bool init_adapt(Sampler* sampler,
+
212  const double delta,
+
213  const double gamma,
+
214  const double kappa,
+
215  const double t0,
+
216  const Eigen::VectorXd& cont_params) {
+
217  const double epsilon = sampler->get_nominal_stepsize();
+
218 
+
219  sampler->get_stepsize_adaptation().set_mu(log(10 * epsilon));
+
220  sampler->get_stepsize_adaptation().set_delta(delta);
+
221  sampler->get_stepsize_adaptation().set_gamma(gamma);
+
222  sampler->get_stepsize_adaptation().set_kappa(kappa);
+
223  sampler->get_stepsize_adaptation().set_t0(t0);
+
224 
+
225  sampler->engage_adaptation();
+
226 
+
227  try {
+
228  sampler->z().q = cont_params;
+
229  sampler->init_stepsize();
+
230  } catch (std::runtime_error e) {
+
231  std::cout << e.what() << std::endl;
+
232  return false;
+
233  }
+
234 
+
235  return true;
+
236  }
+
237 
+
238  template<class Sampler>
+ +
240  const Eigen::VectorXd& cont_params) {
+
241 
+
242  double delta = dynamic_cast<real_argument*>(adapt->arg("delta"))->value();
+
243  double gamma = dynamic_cast<real_argument*>(adapt->arg("gamma"))->value();
+
244  double kappa = dynamic_cast<real_argument*>(adapt->arg("kappa"))->value();
+
245  double t0 = dynamic_cast<real_argument*>(adapt->arg("t0"))->value();
+
246 
+
247  Sampler* s = dynamic_cast<Sampler*>(sampler);
+
248 
+
249  return init_adapt<Sampler>(s, delta, gamma, kappa, t0, cont_params);
+
250  }
+
251 
+
252  template<class Sampler>
+ +
254  unsigned int num_warmup, const Eigen::VectorXd& cont_params) {
+
255 
+
256  init_adapt<Sampler>(sampler, adapt, cont_params);
+
257 
+
258  unsigned int init_buffer = dynamic_cast<u_int_argument*>(adapt->arg("init_buffer"))->value();
+
259  unsigned int term_buffer = dynamic_cast<u_int_argument*>(adapt->arg("term_buffer"))->value();
+
260  unsigned int window = dynamic_cast<u_int_argument*>(adapt->arg("window"))->value();
+
261 
+
262  dynamic_cast<Sampler*>(sampler)->set_window_params(num_warmup, init_buffer, term_buffer, window, &std::cout);
+
263 
+
264  return true;
+
265 
+
266  }
+
267 
+
268  template <class Model>
+
269  int command(int argc, const char* argv[]) {
+
270 
+
271  std::vector<argument*> valid_arguments;
+
272  valid_arguments.push_back(new arg_id());
+
273  valid_arguments.push_back(new arg_data());
+
274  valid_arguments.push_back(new arg_init());
+
275  valid_arguments.push_back(new arg_random());
+
276  valid_arguments.push_back(new arg_output());
+
277 
+
278  argument_parser parser(valid_arguments);
+
279  int err_code = parser.parse_args(argc, argv, &std::cout, &std::cout);
+
280 
+
281  if (err_code != 0) {
+
282  std::cout << "Failed to parse arguments, terminating Stan" << std::endl;
+
283  return err_code;
+
284  }
+
285 
+
286  if (parser.help_printed())
+
287  return err_code;
+
288 
+
289  parser.print(&std::cout);
+
290  std::cout << std::endl;
+
291 
+
292  // Identification
+
293  unsigned int id = dynamic_cast<int_argument*>(parser.arg("id"))->value();
+
294 
+
296  // Random number generator //
+
298 
+
299  unsigned int random_seed = 0;
+
300  u_int_argument* random_arg = dynamic_cast<u_int_argument*>(parser.arg("random")->arg("seed"));
+
301 
+
302  if (random_arg->is_default()) {
+
303  random_seed = (boost::posix_time::microsec_clock::universal_time() -
+
304  boost::posix_time::ptime(boost::posix_time::min_date_time))
+
305  .total_milliseconds();
+
306 
+
307  random_arg->set_value(random_seed);
+
308 
+
309  } else {
+
310  random_seed = random_arg->value();
+
311  }
+
312 
+
313  typedef boost::ecuyer1988 rng_t; // (2**50 = 1T samples, 1000 chains)
+
314  rng_t base_rng(random_seed);
+
315 
+
316  // Advance generator to avoid process conflicts
+
317  static boost::uintmax_t DISCARD_STRIDE = static_cast<boost::uintmax_t>(1) << 50;
+
318  base_rng.discard(DISCARD_STRIDE * (id - 1));
+
319 
+
321  // Input/Output //
+
323 
+
324  // Data input
+
325  std::string data_file = dynamic_cast<string_argument*>(parser.arg("data")->arg("file"))->value();
+
326 
+
327  std::fstream data_stream(data_file.c_str(),
+
328  std::fstream::in);
+
329  stan::io::dump data_var_context(data_stream);
+
330  data_stream.close();
+
331 
+
332  // Sample output
+
333  std::string output_file = dynamic_cast<string_argument*>(
+
334  parser.arg("output")->arg("file"))->value();
+
335  std::fstream* output_stream = 0;
+
336  if (output_file != "") {
+
337  output_stream = new std::fstream(output_file.c_str(),
+
338  std::fstream::out);
+
339  }
+
340 
+
341  // Diagnostic output
+
342  std::string diagnostic_file = dynamic_cast<string_argument*>(
+
343  parser.arg("output")->arg("diagnostic_file"))->value();
+
344 
+
345  std::fstream* diagnostic_stream = 0;
+
346  if (diagnostic_file != "") {
+
347  diagnostic_stream = new std::fstream(diagnostic_file.c_str(),
+
348  std::fstream::out);
+
349  }
+
350 
+
351  // Refresh rate
+
352  int refresh = dynamic_cast<int_argument*>(
+
353  parser.arg("output")->arg("refresh"))->value();
+
354 
+
356  // Initialize Model //
+
358 
+
359  Model model(data_var_context, &std::cout);
+
360 
+
361  Eigen::VectorXd cont_params = Eigen::VectorXd::Zero(model.num_params_r());
+
362 
+
363  if (output_stream) {
+
364  write_stan(output_stream, '#');
+
365  write_model(output_stream, model.model_name(), '#');
+
366  parser.print(output_stream, '#');
+
367  }
+
368 
+
369  if (diagnostic_stream) {
+
370  write_stan(diagnostic_stream, '#');
+
371  write_model(diagnostic_stream, model.model_name(), '#');
+
372  parser.print(diagnostic_stream, '#');
+
373  }
+
374 
+
375  int num_init_tries = -1;
+
376 
+
377  std::string init = dynamic_cast<string_argument*>(
+
378  parser.arg("init"))->value();
+
379 
+
380  try {
+
381 
+
382  double R = std::fabs(boost::lexical_cast<double>(init));
+
383 
+
384  if (R == 0) {
+
385 
+
386  cont_params.setZero();
+
387 
+
388  double init_log_prob;
+
389  Eigen::VectorXd init_grad = Eigen::VectorXd::Zero(model.num_params_r());
+
390 
+
391  try {
+
392  init_log_prob
+
393  = stan::model::log_prob_grad<true, true>(model, cont_params, init_grad, &std::cout);
+
394  } catch (std::domain_error e) {
+
395  std::cout << "Rejecting initialization at zero because of log_prob_grad failure." << std::endl;
+
396  return error_codes::OK;
+
397  }
+
398 
+
399  if (!boost::math::isfinite(init_log_prob)) {
+
400  std::cout << "Rejecting initialization at zero because of vanishing density." << std::endl;
+
401  return 0;
+
402  }
+
403 
+
404  for (int i = 0; i < init_grad.size(); ++i) {
+
405  if (!boost::math::isfinite(init_grad[i])) {
+
406  std::cout << "Rejecting initialization at zero because of divergent gradient." << std::endl;
+
407  return 0;
+
408  }
+
409  }
+
410 
+
411  } else {
+
412 
+
413  boost::random::uniform_real_distribution<double>
+
414  init_range_distribution(-R, R);
+
415 
+
416  boost::variate_generator<rng_t&,
+
417  boost::random::uniform_real_distribution<double> >
+
418  init_rng(base_rng, init_range_distribution);
+
419 
+
420  cont_params.setZero();
+
421 
+
422  // Random initializations until log_prob is finite
+
423  Eigen::VectorXd init_grad = Eigen::VectorXd::Zero(model.num_params_r());
+
424  static int MAX_INIT_TRIES = 100;
+
425 
+
426  for (num_init_tries = 1; num_init_tries <= MAX_INIT_TRIES; ++num_init_tries) {
+
427 
+
428  for (int i = 0; i < cont_params.size(); ++i)
+
429  cont_params(i) = init_rng();
+
430 
+
431  // FIXME: allow config vs. std::cout
+
432  double init_log_prob;
+
433  try {
+
434  init_log_prob
+
435  = stan::model::log_prob_grad<true, true>(model, cont_params, init_grad, &std::cout);
+
436  } catch (std::domain_error e) {
+
437  write_error_msg(&std::cout, e);
+
438  std::cout << "Rejecting proposed initial value with zero density." << std::endl;
+
439  init_log_prob = -std::numeric_limits<double>::infinity();
+
440  }
+
441 
+
442  if (!boost::math::isfinite(init_log_prob))
+
443  continue;
+
444  for (int i = 0; i < init_grad.size(); ++i)
+
445  if (!boost::math::isfinite(init_grad(i)))
+
446  continue;
+
447  break;
+
448 
+
449  }
+
450 
+
451  if (num_init_tries > MAX_INIT_TRIES) {
+
452  std::cout << std::endl << std::endl
+
453  << "Initialization between (" << -R << ", " << R << ") failed after "
+
454  << MAX_INIT_TRIES << " attempts. " << std::endl;
+
455  std::cout << " Try specifying initial values,"
+
456  << " reducing ranges of constrained values,"
+
457  << " or reparameterizing the model."
+
458  << std::endl;
+
459  return -1;
+
460  }
+
461 
+
462  }
+
463 
+
464  } catch(...) {
+
465 
+
466  try {
+
467 
+
468  std::fstream init_stream(init.c_str(), std::fstream::in);
+
469  if (init_stream.fail()) {
+
470  std::string msg("ERROR: specified initialization file does not exist: ");
+
471  msg += init;
+
472  throw std::invalid_argument(msg);
+
473  }
+
474 
+
475  stan::io::dump init_var_context(init_stream);
+
476  init_stream.close();
+
477  model.transform_inits(init_var_context, cont_params);
+
478 
+
479  } catch (const std::exception& e) {
+
480  std::cerr << "Error during user-specified initialization:"
+
481  << std::endl
+
482  << e.what()
+
483  << std::endl;
+
484  return -5;
+
485  }
+
486 
+
487  double init_log_prob;
+
488  Eigen::VectorXd init_grad = Eigen::VectorXd::Zero(model.num_params_r());
+
489 
+
490  try {
+
491 
+
492  init_log_prob
+
493  = stan::model::log_prob_grad<true, true>(model, cont_params, init_grad, &std::cout);
+
494 
+
495  } catch (std::domain_error e) {
+
496  std::cout << "Rejecting user-specified initialization because of log_prob_grad failure." << std::endl;
+
497  return 0;
+
498  }
+
499 
+
500  if (!boost::math::isfinite(init_log_prob)) {
+
501  std::cout << "Rejecting user-specified initialization because of vanishing density." << std::endl;
+
502  return 0;
+
503  }
+
504 
+
505  for (int i = 0; i < init_grad.size(); ++i) {
+
506  if (!boost::math::isfinite(init_grad[i])) {
+
507  std::cout << "Rejecting user-specified initialization because of divergent gradient." << std::endl;
+
508  return 0;
+
509  }
+
510  }
+
511 
+
512  }
+
513 
+
515  // Model Diagnostics //
+
517 
+
518  if (parser.arg("method")->arg("diagnose")) {
+
519 
+
520  std::vector<double> cont_vector(cont_params.size());
+
521  for (int i = 0; i < cont_params.size(); ++i)
+
522  cont_vector.at(i) = cont_params(i);
+
523  std::vector<int> disc_vector;
+
524 
+
525  list_argument* test = dynamic_cast<list_argument*>
+
526  (parser.arg("method")->arg("diagnose")->arg("test"));
+
527 
+
528  if (test->value() == "gradient") {
+
529  std::cout << std::endl << "TEST GRADIENT MODE" << std::endl;
+
530 
+
531  double epsilon = dynamic_cast<real_argument*>
+
532  (test->arg("gradient")->arg("epsilon"))->value();
+
533 
+
534  double error = dynamic_cast<real_argument*>
+
535  (test->arg("gradient")->arg("error"))->value();
+
536 
+
537  int num_failed
+
538  = stan::model::test_gradients<true,true>(model,cont_vector, disc_vector, epsilon, error, std::cout);
+
539 
+
540  if (output_stream) {
+
541  num_failed
+
542  = stan::model::test_gradients<true,true>(model,cont_vector, disc_vector, epsilon, error, *output_stream);
+
543  }
+
544 
+
545  if (diagnostic_stream) {
+
546  num_failed
+
547  = stan::model::test_gradients<true,true>(model,cont_vector, disc_vector, epsilon, error, *diagnostic_stream);
+
548  }
+
549 
+
550  (void) num_failed; // FIXME: do something with the number failed
+
551 
+
552  return error_codes::OK;
+
553  }
+
554 
+
555  }
+
556 
+
558  // Optimization Algorithms //
+
560 
+
561  if (parser.arg("method")->arg("optimize")) {
+
562 
+
563  std::vector<double> cont_vector(cont_params.size());
+
564  for (int i = 0; i < cont_params.size(); ++i)
+
565  cont_vector.at(i) = cont_params(i);
+
566  std::vector<int> disc_vector;
+
567 
+
568  list_argument* algo = dynamic_cast<list_argument*>
+
569  (parser.arg("method")->arg("optimize")->arg("algorithm"));
+
570 
+
571  int num_iterations = dynamic_cast<int_argument*>(
+
572  parser.arg("method")->arg("optimize")->arg("iter"))->value();
+
573 
+
574  bool save_iterations = dynamic_cast<bool_argument*>(
+
575  parser.arg("method")->arg("optimize")->arg("save_iterations"))->value();
+
576 
+
577  if (output_stream) {
+
578  *output_stream << "lp__,";
+
579  model.write_csv_header(*output_stream);
+
580  }
+
581 
+
582  double lp(0);
+
583  int return_code = error_codes::CONFIG;
+
584  if (algo->value() == "nesterov") {
+
585  bool epsilon = dynamic_cast<real_argument*>(
+
586  algo->arg("nesterov")->arg("stepsize"))->value();
+
587 
+
588 
+
589  stan::optimization::NesterovGradient<Model> ng(model, cont_vector, disc_vector,
+
590  epsilon, &std::cout);
+
591 
+
592  lp = ng.logp();
+
593 
+
594  double lastlp = lp - 1;
+
595  std::cout << "Initial log joint probability = " << lp << std::endl;
+
596  if (output_stream && save_iterations) {
+
597  *output_stream << lp << ',';
+
598  model.write_csv(base_rng, cont_vector, disc_vector,
+
599  *output_stream, &std::cout);
+
600  output_stream->flush();
+
601  }
+
602 
+
603  int m = 0;
+
604  for (int i = 0; i < num_iterations; i++) {
+
605  lastlp = lp;
+
606  lp = ng.step();
+
607  ng.params_r(cont_vector);
+
608  if (do_print(i, refresh)) {
+
609  std::cout << "Iteration ";
+
610  std::cout << std::setw(2) << (m + 1) << ". ";
+
611  std::cout << "Log joint probability = " << std::setw(10) << lp;
+
612  std::cout << ". Improved by " << (lp - lastlp) << ".";
+
613  std::cout << std::endl;
+
614  std::cout.flush();
+
615  }
+
616  m++;
+
617  if (output_stream && save_iterations) {
+
618  *output_stream << lp << ',';
+
619  model.write_csv(base_rng, cont_vector, disc_vector,
+
620  *output_stream, &std::cout);
+
621  output_stream->flush();
+
622  }
+
623 
+
624  }
+
625  return_code = error_codes::OK;
+
626  } else if (algo->value() == "newton") {
+
627 
+
628  std::vector<double> gradient;
+
629  try {
+
630  lp = model.template log_prob<false, false>(cont_vector, disc_vector, &std::cout);
+
631  } catch (std::domain_error e) {
+
632  write_error_msg(&std::cout, e);
+
633  lp = -std::numeric_limits<double>::infinity();
+
634  }
+
635 
+
636  std::cout << "initial log joint probability = " << lp << std::endl;
+
637  if (output_stream && save_iterations) {
+
638  *output_stream << lp << ',';
+
639  model.write_csv(base_rng, cont_vector, disc_vector,
+
640  *output_stream, &std::cout);
+
641  output_stream->flush();
+
642  }
+
643 
+
644  double lastlp = lp - 1;
+
645  int m = 0;
+
646  while ((lp - lastlp) / fabs(lp) > 1e-8) {
+
647 
+
648  lastlp = lp;
+
649  lp = stan::optimization::newton_step(model, cont_vector, disc_vector);
+
650  std::cout << "Iteration ";
+
651  std::cout << std::setw(2) << (m + 1) << ". ";
+
652  std::cout << "Log joint probability = " << std::setw(10) << lp;
+
653  std::cout << ". Improved by " << (lp - lastlp) << ".";
+
654  std::cout << std::endl;
+
655  std::cout.flush();
+
656  m++;
+
657 
+
658  if (output_stream && save_iterations) {
+
659  *output_stream << lp << ',';
+
660  model.write_csv(base_rng, cont_vector, disc_vector,
+
661  *output_stream, &std::cout);
+
662  }
+
663 
+
664  }
+
665  return_code = error_codes::OK;
+
666  } else if (algo->value() == "bfgs") {
+
667 
+
668  stan::optimization::BFGSLineSearch<Model> bfgs(model, cont_vector, disc_vector,
+
669  &std::cout);
+
670  bfgs._opts.alpha0 = dynamic_cast<real_argument*>(
+
671  algo->arg("bfgs")->arg("init_alpha"))->value();
+
672  bfgs._opts.tolF = dynamic_cast<real_argument*>(
+
673  algo->arg("bfgs")->arg("tol_obj"))->value();
+
674  bfgs._opts.tolGrad = dynamic_cast<real_argument*>(
+
675  algo->arg("bfgs")->arg("tol_grad"))->value();
+
676  bfgs._opts.tolX = dynamic_cast<real_argument*>(
+
677  algo->arg("bfgs")->arg("tol_param"))->value();
+
678  bfgs._opts.maxIts = num_iterations;
+
679 
+
680  lp = bfgs.logp();
+
681 
+
682  std::cout << "initial log joint probability = " << lp << std::endl;
+
683  if (output_stream && save_iterations) {
+
684  *output_stream << lp << ',';
+
685  model.write_csv(base_rng, cont_vector, disc_vector,
+
686  *output_stream, &std::cout);
+
687  output_stream->flush();
+
688  }
+
689 
+
690  int ret = 0;
+
691 
+
692  while (ret == 0) {
+
693  if (do_print(bfgs.iter_num(), 50*refresh)) {
+
694  std::cout << " Iter ";
+
695  std::cout << " log prob ";
+
696  std::cout << " ||dx|| ";
+
697  std::cout << " ||grad|| ";
+
698  std::cout << " alpha ";
+
699 // MAB: commented out but left in because it may be useful for debugging in the future
+
700 // std::cout << " alpha0 ";
+
701  std::cout << " # evals ";
+
702  std::cout << " Notes " << std::endl;
+
703  }
+
704 
+
705  ret = bfgs.step();
+
706  lp = bfgs.logp();
+
707  bfgs.params_r(cont_vector);
+
708 
+
709  if (do_print(bfgs.iter_num(), refresh) || ret != 0 || !bfgs.note().empty()) {
+
710  std::cout << " " << std::setw(7) << bfgs.iter_num() << " ";
+
711  std::cout << " " << std::setw(12) << std::setprecision(6) << lp << " ";
+
712  std::cout << " " << std::setw(12) << std::setprecision(6) << bfgs.prev_step_size() << " ";
+
713  std::cout << " " << std::setw(12) << std::setprecision(6) << bfgs.curr_g().norm() << " ";
+
714  std::cout << " " << std::setw(10) << std::setprecision(4) << bfgs.alpha() << " ";
+
715 // std::cout << " " << std::setw(10) << std::setprecision(4) << bfgs.alpha0() << " ";
+
716  std::cout << " " << std::setw(7) << bfgs.grad_evals() << " ";
+
717  std::cout << " " << bfgs.note() << " ";
+
718  std::cout << std::endl;
+
719  }
+
720 
+
721  if (output_stream && save_iterations) {
+
722  *output_stream << lp << ',';
+
723  model.write_csv(base_rng, cont_vector, disc_vector,
+
724  *output_stream, &std::cout);
+
725  output_stream->flush();
+
726  }
+
727  }
+
728 
+
729 
+
730  if (ret >= 0) {
+
731  std::cout << "Optimization terminated normally: " << std::endl;
+
732  return_code = error_codes::OK;
+
733  } else {
+
734  std::cout << "Optimization terminated with error: " << std::endl;
+
735  return_code = error_codes::SOFTWARE;
+
736  }
+
737  std::cout << " " << bfgs.get_code_string(ret) << std::endl;
+
738  } else {
+
739  return_code = error_codes::CONFIG;
+
740  }
+
741 
+
742  if (output_stream) {
+
743  *output_stream << lp << ',';
+
744  model.write_csv(base_rng, cont_vector, disc_vector,
+
745  *output_stream, &std::cout);
+
746  output_stream->flush();
+
747  output_stream->close();
+
748  delete output_stream;
+
749  }
+
750  return return_code;
+
751  }
+
752 
+
754  // Sampling Algorithms //
+
756 
+
757  if (parser.arg("method")->arg("sample")) {
+
758 
+
759 
+
760  // Check timing
+
761  clock_t start_check = clock();
+
762 
+
763  Eigen::VectorXd init_grad = Eigen::VectorXd::Zero(model.num_params_r());
+
764  stan::model::log_prob_grad<true, true>(model, cont_params, init_grad, &std::cout);
+
765 
+
766  clock_t end_check = clock();
+
767  double deltaT = (double)(end_check - start_check) / CLOCKS_PER_SEC;
+
768 
+
769  std::cout << std::endl;
+
770  std::cout << "Gradient evaluation took " << deltaT << " seconds" << std::endl;
+
771  std::cout << "1000 transitions using 10 leapfrog steps per transition would take "
+
772  << 1e4 * deltaT << " seconds." << std::endl;
+
773  std::cout << "Adjust your expectations accordingly!" << std::endl << std::endl;
+
774  std::cout << std::endl;
+
775 
+
776  stan::io::mcmc_writer<Model> writer(output_stream, diagnostic_stream, &std::cout);
+
777 
+
778  // Sampling parameters
+
779  int num_warmup = dynamic_cast<int_argument*>(
+
780  parser.arg("method")->arg("sample")->arg("num_warmup"))->value();
+
781 
+
782  int num_samples = dynamic_cast<int_argument*>(
+
783  parser.arg("method")->arg("sample")->arg("num_samples"))->value();
+
784 
+
785  int num_thin = dynamic_cast<int_argument*>(
+
786  parser.arg("method")->arg("sample")->arg("thin"))->value();
+
787 
+
788  bool save_warmup = dynamic_cast<bool_argument*>(
+
789  parser.arg("method")->arg("sample")->arg("save_warmup"))->value();
+
790 
+
791  stan::mcmc::sample s(cont_params, 0, 0);
+
792 
+
793  double warmDeltaT;
+
794  double sampleDeltaT;
+
795 
+
796  // Sampler
+
797  stan::mcmc::base_mcmc* sampler_ptr = 0;
+
798 
+
799  list_argument* algo = dynamic_cast<list_argument*>
+
800  (parser.arg("method")->arg("sample")->arg("algorithm"));
+
801 
+
802  categorical_argument* adapt = dynamic_cast<categorical_argument*>(
+
803  parser.arg("method")->arg("sample")->arg("adapt"));
+
804  bool adapt_engaged = dynamic_cast<bool_argument*>(adapt->arg("engaged"))->value();
+
805 
+
806  if (algo->value() == "rwm") {
+
807 
+
808  std::cout << algo->arg("rwm")->description() << std::endl;
+
809  return 0;
+
810 
+
811  } else if (algo->value() == "hmc") {
+
812 
+
813  int engine_index = 0;
+
814  list_argument* engine
+
815  = dynamic_cast<list_argument*>(algo->arg("hmc")->arg("engine"));
+
816  if (engine->value() == "static") {
+
817  engine_index = 0;
+
818  } else if (engine->value() == "nuts") {
+
819  engine_index = 1;
+
820  }
+
821 
+
822  int metric_index = 0;
+
823  list_argument* metric
+
824  = dynamic_cast<list_argument*>(algo->arg("hmc")->arg("metric"));
+
825  if (metric->value() == "unit_e") {
+
826  metric_index = 0;
+
827  } else if (metric->value() == "diag_e") {
+
828  metric_index = 1;
+
829  } else if (metric->value() == "dense_e") {
+
830  metric_index = 2;
+
831  }
+
832 
+
833  int sampler_select = engine_index + 10 * metric_index + 100 * static_cast<int>(adapt_engaged);
+
834 
+
835  switch (sampler_select) {
+
836 
+
837  case 0: {
+ +
839  sampler_ptr = new sampler(model, base_rng, &std::cout, &std::cout);
+
840  if (!init_static_hmc<sampler>(sampler_ptr, algo)) return 0;
+
841  break;
+
842  }
+
843 
+
844  case 1: {
+ +
846  sampler_ptr = new sampler(model, base_rng, &std::cout, &std::cout);
+
847  if (!init_nuts<sampler>(sampler_ptr, algo)) return 0;
+
848  break;
+
849  }
+
850 
+
851  case 10: {
+ +
853  sampler_ptr = new sampler(model, base_rng, &std::cout, &std::cout);
+
854  if (!init_static_hmc<sampler>(sampler_ptr, algo)) return 0;
+
855  break;
+
856  }
+
857 
+
858  case 11: {
+ +
860  sampler_ptr = new sampler(model, base_rng, &std::cout, &std::cout);
+
861  if (!init_nuts<sampler>(sampler_ptr, algo)) return 0;
+
862  break;
+
863  }
+
864 
+
865  case 20: {
+ +
867  sampler_ptr = new sampler(model, base_rng, &std::cout, &std::cout);
+
868  if (!init_static_hmc<sampler>(sampler_ptr, algo)) return 0;
+
869  break;
+
870  }
+
871 
+
872  case 21: {
+ +
874  sampler_ptr = new sampler(model, base_rng, &std::cout, &std::cout);
+
875  if (!init_nuts<sampler>(sampler_ptr, algo)) return 0;
+
876  break;
+
877  }
+
878 
+
879  case 100: {
+ +
881  sampler_ptr = new sampler(model, base_rng, &std::cout, &std::cout);
+
882  if (!init_static_hmc<sampler>(sampler_ptr, algo)) return 0;
+
883  if (!init_adapt<sampler>(sampler_ptr, adapt, cont_params)) return 0;
+
884  break;
+
885  }
+
886 
+
887  case 101: {
+ +
889  sampler_ptr = new sampler(model, base_rng, &std::cout, &std::cout);
+
890  if (!init_nuts<sampler>(sampler_ptr, algo)) return 0;
+
891  if (!init_adapt<sampler>(sampler_ptr, adapt, cont_params)) return 0;
+
892  break;
+
893  }
+
894 
+
895  case 110: {
+ +
897  sampler_ptr = new sampler(model, base_rng, &std::cout, &std::cout);
+
898  if (!init_static_hmc<sampler>(sampler_ptr, algo)) return 0;
+
899  if (!init_windowed_adapt<sampler>(sampler_ptr, adapt, num_warmup, cont_params)) return 0;
+
900  break;
+
901  }
+
902 
+
903  case 111: {
+ +
905  sampler_ptr = new sampler(model, base_rng, &std::cout, &std::cout);
+
906  if (!init_nuts<sampler>(sampler_ptr, algo)) return 0;
+
907  if (!init_windowed_adapt<sampler>(sampler_ptr, adapt, num_warmup, cont_params)) return 0;
+
908  break;
+
909  }
+
910 
+
911  case 120: {
+ +
913  sampler_ptr = new sampler(model, base_rng, &std::cout, &std::cout);
+
914  if (!init_static_hmc<sampler>(sampler_ptr, algo)) return 0;
+
915  if (!init_windowed_adapt<sampler>(sampler_ptr, adapt, num_warmup, cont_params)) return 0;
+
916  break;
+
917  }
+
918 
+
919  case 121: {
+ +
921  sampler_ptr = new sampler(model, base_rng, &std::cout, &std::cout);
+
922  if (!init_nuts<sampler>(sampler_ptr, algo)) return 0;
+
923  if (!init_windowed_adapt<sampler>(sampler_ptr, adapt, num_warmup, cont_params)) return 0;
+
924  break;
+
925  }
+
926 
+
927  default:
+
928  std::cout << "No sampler matching HMC specification!" << std::endl;
+
929  return 0;
+
930  }
+
931 
+
932  }
+
933 
+
934  // Headers
+
935  writer.print_sample_names(s, sampler_ptr, model);
+
936  writer.print_diagnostic_names(s, sampler_ptr, model);
+
937 
+
938  // Warm-Up
+
939  clock_t start = clock();
+
940 
+
941  warmup<Model, rng_t>(sampler_ptr, num_warmup, num_samples, num_thin,
+
942  refresh, save_warmup,
+
943  writer,
+
944  s, model, base_rng);
+
945 
+
946  clock_t end = clock();
+
947  warmDeltaT = (double)(end - start) / CLOCKS_PER_SEC;
+
948 
+
949  if (adapt_engaged) {
+
950  dynamic_cast<mcmc::base_adapter*>(sampler_ptr)->disengage_adaptation();
+
951  writer.print_adapt_finish(sampler_ptr);
+
952  }
+
953 
+
954  // Sampling
+
955  start = clock();
+
956 
+
957  stan::gm::sample<Model, rng_t>(sampler_ptr, num_warmup, num_samples, num_thin,
+
958  refresh, true,
+
959  writer,
+
960  s, model, base_rng);
+
961 
+
962  end = clock();
+
963  sampleDeltaT = (double)(end - start) / CLOCKS_PER_SEC;
+
964 
+
965  writer.print_timing(warmDeltaT, sampleDeltaT);
+
966 
+
967  if (sampler_ptr) delete sampler_ptr;
+
968 
+
969  }
+
970 
+
971  if (output_stream) {
+
972  output_stream->close();
+
973  delete output_stream;
+
974  }
+
975 
+
976  if (diagnostic_stream) {
+
977  diagnostic_stream->close();
+
978  delete diagnostic_stream;
+
979  }
+
980 
+
981  for (size_t i = 0; i < valid_arguments.size(); ++i)
+
982  delete valid_arguments.at(i);
+
983 
+
984  return 0;
+
985 
+
986  }
+
987 
+
988  } // namespace gm
+
989 
+
990 } // namespace stan
+
991 
+
992 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/common__adaptors__def_8hpp.html b/doc/api/html/common__adaptors__def_8hpp.html new file mode 100644 index 00000000000..6fe94f69e32 --- /dev/null +++ b/doc/api/html/common__adaptors__def_8hpp.html @@ -0,0 +1,111 @@ + + + + + +Stan: src/stan/gm/grammars/common_adaptors_def.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
common_adaptors_def.hpp File Reference
+
+
+
#include <boost/fusion/include/adapt_struct.hpp>
+#include <stan/gm/ast.hpp>
+
+

Go to the source code of this file.

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/common__adaptors__def_8hpp_source.html b/doc/api/html/common__adaptors__def_8hpp_source.html new file mode 100644 index 00000000000..e240cbc425c --- /dev/null +++ b/doc/api/html/common__adaptors__def_8hpp_source.html @@ -0,0 +1,120 @@ + + + + + +Stan: src/stan/gm/grammars/common_adaptors_def.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
common_adaptors_def.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__PARSER__COMMON_ADAPTORS_DEF__HPP__
+
2 #define __STAN__GM__PARSER__COMMON_ADAPTORS_DEF__HPP__
+
3 
+
4 #include <boost/fusion/include/adapt_struct.hpp>
+
5 
+
6 #include <stan/gm/ast.hpp>
+
7 
+ + +
10  (stan::gm::expression, high_) )
+
11 
+
12 
+
13 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/common__type_8hpp.html b/doc/api/html/common__type_8hpp.html new file mode 100644 index 00000000000..151dd963bce --- /dev/null +++ b/doc/api/html/common__type_8hpp.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/math/matrix/common_type.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
common_type.hpp File Reference
+
+
+
#include <vector>
+#include <stan/math/matrix/Eigen.hpp>
+#include <boost/math/tools/promotion.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Classes

struct  stan::math::common_type< T1, T2 >
 
struct  stan::math::common_type< std::vector< T1 >, std::vector< T2 > >
 
struct  stan::math::common_type< Eigen::Matrix< T1, R, C >, Eigen::Matrix< T2, R, C > >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/common__type_8hpp_source.html b/doc/api/html/common__type_8hpp_source.html new file mode 100644 index 00000000000..795611b23d2 --- /dev/null +++ b/doc/api/html/common__type_8hpp_source.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/math/matrix/common_type.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
common_type.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__COMMON_TYPE_HPP__
+
2 #define __STAN__MATH__MATRIX__COMMON_TYPE_HPP__
+
3 
+
4 #include <vector>
+ +
6 #include <boost/math/tools/promotion.hpp>
+
7 
+
8 namespace stan {
+
9 
+
10  namespace math {
+
11 
+
12  template <typename T1, typename T2>
+
13  struct common_type {
+
14  typedef typename boost::math::tools::promote_args<T1,T2>::type type;
+
15  };
+
16 
+
17  template <typename T1, typename T2>
+
18  struct common_type<std::vector<T1>, std::vector<T2> > {
+
19  typedef std::vector<typename common_type<T1,T2>::type> type;
+
20  };
+
21 
+
22  template <typename T1, typename T2, int R, int C>
+
23  struct common_type<Eigen::Matrix<T1,R,C>, Eigen::Matrix<T2,R,C> > {
+
24  typedef Eigen::Matrix<typename common_type<T1,T2>::type,R,C> type;
+
25  };
+
26 
+
27  }
+
28 }
+
29 
+
30 
+
31 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/compiler_8hpp.html b/doc/api/html/compiler_8hpp.html new file mode 100644 index 00000000000..6f38053540d --- /dev/null +++ b/doc/api/html/compiler_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/gm/compiler.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
compiler.hpp File Reference
+
+
+
#include <stan/gm/ast.hpp>
+#include <stan/gm/generator.hpp>
+#include <stan/gm/parser.hpp>
+#include <iostream>
+#include <string>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+ + + + +

+Functions

bool stan::gm::compile (std::ostream *msgs, std::istream &stan_gm_in, std::ostream &cpp_out, const std::string &model_name, bool include_main=true, const std::string &in_file_name="input")
 Read a Stan model specification from the specified input, parse it, and write the C++ code for it to the specified output.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/compiler_8hpp_source.html b/doc/api/html/compiler_8hpp_source.html new file mode 100644 index 00000000000..7011f0df4ed --- /dev/null +++ b/doc/api/html/compiler_8hpp_source.html @@ -0,0 +1,141 @@ + + + + + +Stan: src/stan/gm/compiler.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
compiler.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__COMPILER_HPP__
+
2 #define __STAN__GM__COMPILER_HPP__
+
3 
+
4 #include <stan/gm/ast.hpp>
+
5 #include <stan/gm/generator.hpp>
+
6 #include <stan/gm/parser.hpp>
+
7 
+
8 #include <iostream>
+
9 #include <string>
+
10 
+
11 namespace stan {
+
12 
+
13  namespace gm {
+
14 
+
38  bool compile(std::ostream* msgs, // for warnings
+
39  std::istream& stan_gm_in,
+
40  std::ostream& cpp_out,
+
41  const std::string& model_name,
+
42  bool include_main = true,
+
43  const std::string& in_file_name = "input") {
+
44  program prog;
+
45  bool parsed_ok = parse(msgs,stan_gm_in,in_file_name,model_name,prog);
+
46  if (!parsed_ok)
+
47  return false; // syntax error in program
+
48  generate_cpp(prog,model_name,cpp_out,include_main);
+
49  return true;
+
50  }
+
51 
+
52 
+
53  }
+
54 
+
55 }
+
56 
+
57 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/constraint__tolerance_8hpp.html b/doc/api/html/constraint__tolerance_8hpp.html new file mode 100644 index 00000000000..7054c153f9f --- /dev/null +++ b/doc/api/html/constraint__tolerance_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/math/error_handling/matrix/constraint_tolerance.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
constraint_tolerance.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Variables

const double stan::math::CONSTRAINT_TOLERANCE = 1E-8
 The tolerance for checking arithmetic bounds In rank and in simplexes.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/constraint__tolerance_8hpp_source.html b/doc/api/html/constraint__tolerance_8hpp_source.html new file mode 100644 index 00000000000..1638b3d6c29 --- /dev/null +++ b/doc/api/html/constraint__tolerance_8hpp_source.html @@ -0,0 +1,118 @@ + + + + + +Stan: src/stan/math/error_handling/matrix/constraint_tolerance.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
constraint_tolerance.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__ERROR_HANDLING__MATRIX__CONSTRAINT_TOLERANCE_HPP__
+
2 #define __STAN__MATH__ERROR_HANDLING__MATRIX__CONSTRAINT_TOLERANCE_HPP__
+
3 
+
4 namespace stan {
+
5  namespace math {
+
6 
+
11  const double CONSTRAINT_TOLERANCE = 1E-8;
+
12 
+
13  }
+
14 }
+
15 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/covar__adaptation_8hpp.html b/doc/api/html/covar__adaptation_8hpp.html new file mode 100644 index 00000000000..0e9e254ace0 --- /dev/null +++ b/doc/api/html/covar__adaptation_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/mcmc/covar_adaptation.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
covar_adaptation.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::covar_adaptation
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/covar__adaptation_8hpp_source.html b/doc/api/html/covar__adaptation_8hpp_source.html new file mode 100644 index 00000000000..731092bc4d1 --- /dev/null +++ b/doc/api/html/covar__adaptation_8hpp_source.html @@ -0,0 +1,163 @@ + + + + + +Stan: src/stan/mcmc/covar_adaptation.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
covar_adaptation.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__COVAR__ADAPTATION__BETA__
+
2 #define __STAN__MCMC__COVAR__ADAPTATION__BETA__
+
3 
+
4 #include <vector>
+ +
6 
+ + +
9 
+
10 namespace stan {
+
11 
+
12  namespace mcmc {
+
13 
+ +
15 
+
16  public:
+
17 
+
18  covar_adaptation(int n): windowed_adaptation("covariance"), _estimator(n) {}
+
19 
+
20  bool learn_covariance(Eigen::MatrixXd& covar, const Eigen::VectorXd& q) {
+
21 
+ +
23 
+
24  if (end_adaptation_window()) {
+
25 
+ +
27 
+ +
29 
+
30  double n = static_cast<double>(_estimator.num_samples());
+
31  covar = (n / (n + 5.0)) * covar
+
32  + 1e-3 * (5.0 / (n + 5.0)) * Eigen::MatrixXd::Identity(covar.rows(), covar.cols());
+
33 
+ +
35 
+ +
37  return true;
+
38 
+
39  }
+
40 
+ +
42  return false;
+
43 
+
44  }
+
45 
+
46  protected:
+
47 
+ +
49 
+
50  };
+
51 
+
52  } // mcmc
+
53 
+
54 } // stan
+
55 
+
56 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/csv__writer_8hpp.html b/doc/api/html/csv__writer_8hpp.html new file mode 100644 index 00000000000..353930c2950 --- /dev/null +++ b/doc/api/html/csv__writer_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/io/csv_writer.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
csv_writer.hpp File Reference
+
+
+
#include <stan/math/matrix.hpp>
+#include <ostream>
+#include <limits>
+#include <iomanip>
+
+

Go to the source code of this file.

+ + + + + +

+Classes

class  stan::io::csv_writer
 Writes Stan variables in comma-separated-value format to an output stream. More...
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::io
 Input/output utilities.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/csv__writer_8hpp_source.html b/doc/api/html/csv__writer_8hpp_source.html new file mode 100644 index 00000000000..4964b93b77a --- /dev/null +++ b/doc/api/html/csv__writer_8hpp_source.html @@ -0,0 +1,197 @@ + + + + + +Stan: src/stan/io/csv_writer.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
csv_writer.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__IO__CSV_WRITER_HPP__
+
2 #define __STAN__IO__CSV_WRITER_HPP__
+
3 
+
4 #include <stan/math/matrix.hpp>
+
5 #include <ostream>
+
6 #include <limits>
+
7 #include <iomanip>
+
8 
+
9 namespace stan {
+
10 
+
11  namespace io {
+
12 
+
21  class csv_writer {
+
22  private:
+
23  std::ostream& o_;
+
24  bool at_bol_;
+
25 
+
26  public:
+
27 
+
34  void comma() {
+
35  if (at_bol_) {
+
36  at_bol_ = false;
+
37  return;
+
38  }
+
39  o_ << ",";
+
40  }
+
41 
+
42 
+
49  csv_writer(std::ostream& o)
+
50  : o_(o), at_bol_(true) {
+
51  }
+
52 
+
61  void newline() {
+
62  o_ << "\n";
+
63  at_bol_ = true;
+
64  }
+
65 
+
74  void write(int n) {
+
75  comma();
+
76  o_ << n;
+
77  }
+
78 
+
87  void write(double x) {
+
88  comma();
+
89  o_ << std::setprecision (std::numeric_limits<double>::digits10 + 1) << x;
+
90  }
+
91 
+
100  template<int R, int C>
+
101  void write_row_major(const Eigen::Matrix<double,R,C>& m) {
+ +
103  for (size_type i = 0; i < m.rows(); ++i)
+
104  for (size_type j = 0; j < m.cols(); ++j)
+
105  write(m(i,j));
+
106  }
+
107 
+
116  template<int R, int C>
+
117  void write_col_major(const Eigen::Matrix<double,R,C>& m) {
+ +
119  for (size_type j = 0; j < m.cols(); ++j)
+
120  for (size_type i = 0; i < m.rows(); ++i)
+
121  write(m(i,j));
+
122  }
+
123 
+
124  template<int R, int C>
+
125  void write(const Eigen::Matrix<double,R,C>& m) {
+
126  write_col_major(m);
+
127  }
+
128 
+
138  void write(const std::string& s) {
+
139  comma();
+
140 
+
141  o_ << '"';
+
142  for (size_t i = 0; i < s.size(); ++i) {
+
143  if (s.at(i) == '"') {
+
144  o_ << '"' << '"'; // double quotes
+
145  } else {
+
146  o_ << s.at(i);
+
147  }
+
148  }
+
149  o_ << '"';
+
150  }
+
151 
+
152 
+
153  };
+
154 
+
155  }
+
156 
+
157 }
+
158 
+
159 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/cumulative__sum_8hpp.html b/doc/api/html/cumulative__sum_8hpp.html new file mode 100644 index 00000000000..0ae28a26c55 --- /dev/null +++ b/doc/api/html/cumulative__sum_8hpp.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/math/matrix/cumulative_sum.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
cumulative_sum.hpp File Reference
+
+
+
#include <vector>
+#include <stan/math/matrix/Eigen.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + +

+Functions

template<typename T >
std::vector< T > stan::math::cumulative_sum (const std::vector< T > &x)
 Return the cumulative sum of the specified vector.
 
template<typename T , int R, int C>
Eigen::Matrix< T, R, C > stan::math::cumulative_sum (const Eigen::Matrix< T, R, C > &m)
 Return the cumulative sum of the specified matrix.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/cumulative__sum_8hpp_source.html b/doc/api/html/cumulative__sum_8hpp_source.html new file mode 100644 index 00000000000..90bf7e2359b --- /dev/null +++ b/doc/api/html/cumulative__sum_8hpp_source.html @@ -0,0 +1,142 @@ + + + + + +Stan: src/stan/math/matrix/cumulative_sum.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
cumulative_sum.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__CUMULATIVE_SUM_HPP__
+
2 #define __STAN__MATH__MATRIX__CUMULATIVE_SUM_HPP__
+
3 
+
4 #include <vector>
+ +
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
21  template <typename T>
+
22  inline std::vector<T>
+
23  cumulative_sum(const std::vector<T>& x) {
+
24  std::vector<T> result(x.size());
+
25  if (x.size() == 0)
+
26  return result;
+
27  result[0] = x[0];
+
28  for (size_t i = 1; i < result.size(); ++i)
+
29  result[i] = x[i] + result[i-1];
+
30  return result;
+
31  }
+
32 
+
47  template <typename T, int R, int C>
+
48  inline Eigen::Matrix<T,R,C>
+
49  cumulative_sum(const Eigen::Matrix<T,R,C>& m) {
+
50  Eigen::Matrix<T,R,C> result(m.rows(),m.cols());
+
51  if (m.size() == 0)
+
52  return result;
+
53  result(0) = m(0);
+
54  for (int i = 1; i < result.size(); ++i)
+
55  result(i) = m(i) + result(i-1);
+
56  return result;
+
57  }
+
58  }
+
59 }
+
60 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/ddv__vari_8hpp.html b/doc/api/html/ddv__vari_8hpp.html new file mode 100644 index 00000000000..cc5673b79d9 --- /dev/null +++ b/doc/api/html/ddv__vari_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/agrad/rev/internal/ddv_vari.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
ddv_vari.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::agrad::op_ddv_vari
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/ddv__vari_8hpp_source.html b/doc/api/html/ddv__vari_8hpp_source.html new file mode 100644 index 00000000000..35d263a01df --- /dev/null +++ b/doc/api/html/ddv__vari_8hpp_source.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/rev/internal/ddv_vari.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
ddv_vari.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__INTERNAL__DDV_VARI_HPP__
+
2 #define __STAN__AGRAD__REV__INTERNAL__DDV_VARI_HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7  namespace agrad {
+
8 
+
9  class op_ddv_vari : public vari {
+
10  protected:
+
11  double ad_;
+
12  double bd_;
+ +
14  public:
+
15  op_ddv_vari(double f, double a, double b, vari* cvi) :
+
16  vari(f),
+
17  ad_(a),
+
18  bd_(b),
+
19  cvi_(cvi) {
+
20  }
+
21  };
+
22 
+
23  }
+
24 }
+
25 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dense__e__metric_8hpp.html b/doc/api/html/dense__e__metric_8hpp.html new file mode 100644 index 00000000000..42abc786744 --- /dev/null +++ b/doc/api/html/dense__e__metric_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/mcmc/hmc/hamiltonians/dense_e_metric.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
dense_e_metric.hpp File Reference
+
+
+
#include <boost/random/variate_generator.hpp>
+#include <boost/random/normal_distribution.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+#include <Eigen/Cholesky>
+#include <stan/mcmc/hmc/hamiltonians/base_hamiltonian.hpp>
+#include <stan/mcmc/hmc/hamiltonians/dense_e_point.hpp>
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::dense_e_metric< M, BaseRNG >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dense__e__metric_8hpp_source.html b/doc/api/html/dense__e__metric_8hpp_source.html new file mode 100644 index 00000000000..590d5e78452 --- /dev/null +++ b/doc/api/html/dense__e__metric_8hpp_source.html @@ -0,0 +1,174 @@ + + + + + +Stan: src/stan/mcmc/hmc/hamiltonians/dense_e_metric.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
dense_e_metric.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__DENSE__E__METRIC__BETA__
+
2 #define __STAN__MCMC__DENSE__E__METRIC__BETA__
+
3 
+
4 #include <boost/random/variate_generator.hpp>
+
5 #include <boost/random/normal_distribution.hpp>
+
6 
+ +
8 #include <Eigen/Cholesky>
+
9 
+ + +
12 
+
13 namespace stan {
+
14 
+
15  namespace mcmc {
+
16 
+
17  // Euclidean manifold with dense metric
+
18  template <typename M, typename BaseRNG>
+
19  class dense_e_metric: public base_hamiltonian<M, dense_e_point, BaseRNG> {
+
20 
+
21  public:
+
22 
+
23  dense_e_metric(M& m, std::ostream* e):
+
24  base_hamiltonian<M, dense_e_point, BaseRNG>(m, e) {};
+ +
26 
+
27  double T(dense_e_point& z) {
+
28  return 0.5 * z.p.transpose() * z.mInv * z.p;
+
29  }
+
30 
+
31  double tau(dense_e_point& z) { return T(z); }
+
32  double phi(dense_e_point& z) { return this->V(z); }
+
33 
+
34  const Eigen::VectorXd dtau_dq(dense_e_point& z) {
+
35  return Eigen::VectorXd::Zero(this->_model.num_params_r());
+
36  }
+
37 
+
38  const Eigen::VectorXd dtau_dp(dense_e_point& z) {
+
39  return z.mInv * z.p;
+
40  }
+
41 
+
42  const Eigen::VectorXd dphi_dq(dense_e_point& z) {
+
43  return z.g;
+
44  }
+
45 
+
46  void sample_p(dense_e_point& z, BaseRNG& rng) {
+
47 
+
48  boost::variate_generator<BaseRNG&, boost::normal_distribution<> >
+
49  _rand_dense_gaus(rng, boost::normal_distribution<>());
+
50 
+
51  Eigen::VectorXd u(z.p.size());
+
52 
+
53  for (Eigen::VectorXd::size_type i = 0; i < u.size(); ++i)
+
54  u(i) = _rand_dense_gaus();
+
55 
+
56  z.p = z.mInv.llt().matrixL().solve(u);
+
57 
+
58  }
+
59 
+
60  };
+
61 
+
62  } // mcmc
+
63 
+
64 } // stan
+
65 
+
66 
+
67 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dense__e__nuts_8hpp.html b/doc/api/html/dense__e__nuts_8hpp.html new file mode 100644 index 00000000000..f4eff4f21a3 --- /dev/null +++ b/doc/api/html/dense__e__nuts_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/mcmc/hmc/nuts/dense_e_nuts.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
dense_e_nuts.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::dense_e_nuts< M, BaseRNG >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dense__e__nuts_8hpp_source.html b/doc/api/html/dense__e__nuts_8hpp_source.html new file mode 100644 index 00000000000..d67847b161a --- /dev/null +++ b/doc/api/html/dense__e__nuts_8hpp_source.html @@ -0,0 +1,151 @@ + + + + + +Stan: src/stan/mcmc/hmc/nuts/dense_e_nuts.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
dense_e_nuts.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__DENSE__E__NUTS__BETA__
+
2 #define __STAN__MCMC__DENSE__E__NUTS__BETA__
+
3 
+ + + + +
8 
+
9 namespace stan {
+
10 
+
11  namespace mcmc {
+
12 
+
13  // The No-U-Turn Sampler (NUTS) on a
+
14  // Euclidean manifold with dense metric
+
15 
+
16  template <typename M, class BaseRNG>
+
17  class dense_e_nuts: public base_nuts<M,
+
18  dense_e_point,
+
19  dense_e_metric,
+
20  expl_leapfrog,
+
21  BaseRNG> {
+
22 
+
23  public:
+
24 
+
25  dense_e_nuts(M &m, BaseRNG& rng, std::ostream* o = &std::cout, std::ostream* e = 0):
+
26  base_nuts<M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG>(m, rng, o, e)
+
27  { this->_name = "NUTS with a dense Euclidean metric"; }
+
28 
+
29  // Note that the points don't need to be swapped
+
30  // here since start.mInv = finish.mInv
+ +
32  dense_e_point& finish,
+
33  Eigen::VectorXd& rho) {
+
34  return finish.p.transpose() * finish.mInv * (rho - finish.p) > 0
+
35  && start.p.transpose() * finish.mInv * (rho - start.p) > 0;
+
36  }
+
37 
+
38  };
+
39 
+
40  } // mcmc
+
41 
+
42 } // stan
+
43 
+
44 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dense__e__point_8hpp.html b/doc/api/html/dense__e__point_8hpp.html new file mode 100644 index 00000000000..81fb2afad31 --- /dev/null +++ b/doc/api/html/dense__e__point_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/mcmc/hmc/hamiltonians/dense_e_point.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
dense_e_point.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::dense_e_point
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dense__e__point_8hpp_source.html b/doc/api/html/dense__e__point_8hpp_source.html new file mode 100644 index 00000000000..5447ed24fd8 --- /dev/null +++ b/doc/api/html/dense__e__point_8hpp_source.html @@ -0,0 +1,151 @@ + + + + + +Stan: src/stan/mcmc/hmc/hamiltonians/dense_e_point.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
dense_e_point.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__DENSE__E__POINT__BETA__
+
2 #define __STAN__MCMC__DENSE__E__POINT__BETA__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace mcmc {
+
9 
+
10  // Point in a phase space with a base
+
11  // Euclidean manifold with dense metric
+
12  class dense_e_point: public ps_point {
+
13 
+
14  public:
+
15 
+
16  dense_e_point(int n): ps_point(n), mInv(n, n) {
+
17  mInv.setIdentity();
+
18  };
+
19 
+
20  Eigen::MatrixXd mInv;
+
21 
+ +
23  _fast_matrix_copy<double>(mInv, z.mInv);
+
24  }
+
25 
+
26  void write_metric(std::ostream* o) {
+
27  if(!o) return;
+
28  *o << "# Elements of inverse mass matrix:" << std::endl;
+
29  for(int i = 0; i < mInv.rows(); ++i) {
+
30  *o << "# " << mInv(i, 0) << std::flush;
+
31  for(int j = 1; j < mInv.cols(); ++j)
+
32  *o << ", " << mInv(i, j) << std::flush;
+
33  *o << std::endl;
+
34  }
+
35  };
+
36 
+
37  };
+
38 
+
39  } // mcmc
+
40 
+
41 } // stan
+
42 
+
43 
+
44 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dense__e__static__hmc_8hpp.html b/doc/api/html/dense__e__static__hmc_8hpp.html new file mode 100644 index 00000000000..9b051dec013 --- /dev/null +++ b/doc/api/html/dense__e__static__hmc_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/mcmc/hmc/static/dense_e_static_hmc.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
dense_e_static_hmc.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::dense_e_static_hmc< M, BaseRNG >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dense__e__static__hmc_8hpp_source.html b/doc/api/html/dense__e__static__hmc_8hpp_source.html new file mode 100644 index 00000000000..353d18395d2 --- /dev/null +++ b/doc/api/html/dense__e__static__hmc_8hpp_source.html @@ -0,0 +1,145 @@ + + + + + +Stan: src/stan/mcmc/hmc/static/dense_e_static_hmc.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
dense_e_static_hmc.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__DENSE__E__STATIC__HMC__BETA__
+
2 #define __STAN__MCMC__DENSE__E__STATIC__HMC__BETA__
+
3 
+ + + + +
8 
+
9 namespace stan {
+
10 
+
11  namespace mcmc {
+
12 
+
13  // Hamiltonian Monte Carlo on a
+
14  // Euclidean manifold with dense metric
+
15  // and static integration time
+
16 
+
17  template <typename M, class BaseRNG>
+ +
19  dense_e_point,
+
20  dense_e_metric,
+
21  expl_leapfrog,
+
22  BaseRNG> {
+
23 
+
24  public:
+
25 
+
26  dense_e_static_hmc(M &m, BaseRNG& rng, std::ostream* o = &std::cout, std::ostream* e = 0):
+ +
28  { this->_name = "Static HMC with a dense Euclidean metric"; }
+
29 
+
30 
+
31  };
+
32 
+
33  } // mcmc
+
34 
+
35 } // stan
+
36 
+
37 
+
38 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/diag__e__metric_8hpp.html b/doc/api/html/diag__e__metric_8hpp.html new file mode 100644 index 00000000000..ffe2303965f --- /dev/null +++ b/doc/api/html/diag__e__metric_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/mcmc/hmc/hamiltonians/diag_e_metric.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
diag_e_metric.hpp File Reference
+
+
+
#include <boost/random/variate_generator.hpp>
+#include <boost/random/normal_distribution.hpp>
+#include <stan/mcmc/hmc/hamiltonians/base_hamiltonian.hpp>
+#include <stan/mcmc/hmc/hamiltonians/diag_e_point.hpp>
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::diag_e_metric< M, BaseRNG >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/diag__e__metric_8hpp_source.html b/doc/api/html/diag__e__metric_8hpp_source.html new file mode 100644 index 00000000000..0299e59c421 --- /dev/null +++ b/doc/api/html/diag__e__metric_8hpp_source.html @@ -0,0 +1,167 @@ + + + + + +Stan: src/stan/mcmc/hmc/hamiltonians/diag_e_metric.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
diag_e_metric.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__DIAG__E__METRIC__BETA__
+
2 #define __STAN__MCMC__DIAG__E__METRIC__BETA__
+
3 
+
4 #include <boost/random/variate_generator.hpp>
+
5 #include <boost/random/normal_distribution.hpp>
+
6 
+ + +
9 
+
10 namespace stan {
+
11 
+
12  namespace mcmc {
+
13 
+
14  // Euclidean manifold with diagonal metric
+
15  template <typename M, typename BaseRNG>
+
16  class diag_e_metric: public base_hamiltonian<M, diag_e_point, BaseRNG> {
+
17 
+
18  public:
+
19 
+
20  diag_e_metric(M& m, std::ostream* e):
+
21  base_hamiltonian<M, diag_e_point, BaseRNG>(m, e) {};
+ +
23 
+
24  double T(diag_e_point& z) {
+
25  return 0.5 * z.p.dot( z.mInv.cwiseProduct(z.p) );
+
26  }
+
27 
+
28  double tau(diag_e_point& z) { return T(z); }
+
29  double phi(diag_e_point& z) { return this->V(z); }
+
30 
+
31  const Eigen::VectorXd dtau_dq(diag_e_point& z) {
+
32  return Eigen::VectorXd::Zero(this->_model.num_params_r());
+
33  }
+
34 
+
35  const Eigen::VectorXd dtau_dp(diag_e_point& z) {
+
36  return z.mInv.cwiseProduct(z.p);
+
37  }
+
38 
+
39  const Eigen::VectorXd dphi_dq(diag_e_point& z) {
+
40  return z.g;
+
41  }
+
42 
+
43  void sample_p(diag_e_point& z, BaseRNG& rng) {
+
44 
+
45  boost::variate_generator<BaseRNG&, boost::normal_distribution<> >
+
46  _rand_diag_gaus(rng, boost::normal_distribution<>());
+
47 
+
48  for (int i = 0; i < z.p.size(); ++i)
+
49  z.p(i) = _rand_diag_gaus() / sqrt(z.mInv(i));
+
50 
+
51  }
+
52 
+
53  };
+
54 
+
55  } // mcmc
+
56 
+
57 } // stan
+
58 
+
59 
+
60 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/diag__e__nuts_8hpp.html b/doc/api/html/diag__e__nuts_8hpp.html new file mode 100644 index 00000000000..a5f6af7a8c8 --- /dev/null +++ b/doc/api/html/diag__e__nuts_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/mcmc/hmc/nuts/diag_e_nuts.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
diag_e_nuts.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::diag_e_nuts< M, BaseRNG >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/diag__e__nuts_8hpp_source.html b/doc/api/html/diag__e__nuts_8hpp_source.html new file mode 100644 index 00000000000..ee3c0acbdd5 --- /dev/null +++ b/doc/api/html/diag__e__nuts_8hpp_source.html @@ -0,0 +1,151 @@ + + + + + +Stan: src/stan/mcmc/hmc/nuts/diag_e_nuts.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
diag_e_nuts.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__DIAG__E__NUTS__BETA__
+
2 #define __STAN__MCMC__DIAG__E__NUTS__BETA__
+
3 
+ + + + +
8 
+
9 namespace stan {
+
10 
+
11  namespace mcmc {
+
12 
+
13  // The No-U-Turn Sampler (NUTS) on a
+
14  // Euclidean manifold with diagonal metric
+
15 
+
16  template <typename M, class BaseRNG>
+
17  class diag_e_nuts: public base_nuts<M,
+
18  diag_e_point,
+
19  diag_e_metric,
+
20  expl_leapfrog,
+
21  BaseRNG> {
+
22 
+
23  public:
+
24 
+
25  diag_e_nuts(M &m, BaseRNG& rng, std::ostream* o = &std::cout, std::ostream* e = 0):
+
26  base_nuts<M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG>(m, rng, o, e)
+
27  { this->_name = "NUTS with a diagonal Euclidean metric"; }
+
28 
+
29  // Note that the points don't need to be swapped
+
30  // here since start.mInv = finish.mInv
+ +
32  diag_e_point& finish,
+
33  Eigen::VectorXd& rho) {
+
34  return finish.mInv.cwiseProduct(finish.p).dot(rho - finish.p) > 0
+
35  && finish.mInv.cwiseProduct(start.p).dot(rho - start.p) > 0;
+
36  }
+
37 
+
38  };
+
39 
+
40  } // mcmc
+
41 
+
42 } // stan
+
43 
+
44 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/diag__e__point_8hpp.html b/doc/api/html/diag__e__point_8hpp.html new file mode 100644 index 00000000000..3383a62bc52 --- /dev/null +++ b/doc/api/html/diag__e__point_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/mcmc/hmc/hamiltonians/diag_e_point.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
diag_e_point.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::diag_e_point
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/diag__e__point_8hpp_source.html b/doc/api/html/diag__e__point_8hpp_source.html new file mode 100644 index 00000000000..f9a442e1094 --- /dev/null +++ b/doc/api/html/diag__e__point_8hpp_source.html @@ -0,0 +1,149 @@ + + + + + +Stan: src/stan/mcmc/hmc/hamiltonians/diag_e_point.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
diag_e_point.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__DIAG__E__POINT__BETA__
+
2 #define __STAN__MCMC__DIAG__E__POINT__BETA__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace mcmc {
+
9 
+
10  // Point in a phase space with a base
+
11  // Euclidean manifold with diagonal metric
+
12  class diag_e_point: public ps_point {
+
13 
+
14  public:
+
15 
+
16  diag_e_point(int n): ps_point(n), mInv(n) {
+
17  mInv.setOnes();
+
18  };
+
19 
+
20  Eigen::VectorXd mInv;
+
21 
+ +
23  _fast_vector_copy<double>(mInv, z.mInv);
+
24  }
+
25 
+
26  void write_metric(std::ostream* o) {
+
27  if(!o) return;
+
28  *o << "# Diagonal elements of inverse mass matrix:" << std::endl;
+
29  *o << "# " << mInv(0) << std::flush;
+
30  for (int i = 1; i < mInv.size(); ++i)
+
31  *o << ", " << mInv(i) << std::flush;
+
32  *o << std::endl;
+
33  };
+
34 
+
35  };
+
36 
+
37  } // mcmc
+
38 
+
39 } // stan
+
40 
+
41 
+
42 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/diag__e__static__hmc_8hpp.html b/doc/api/html/diag__e__static__hmc_8hpp.html new file mode 100644 index 00000000000..d77b4b27c44 --- /dev/null +++ b/doc/api/html/diag__e__static__hmc_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/mcmc/hmc/static/diag_e_static_hmc.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
diag_e_static_hmc.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::diag_e_static_hmc< M, BaseRNG >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/diag__e__static__hmc_8hpp_source.html b/doc/api/html/diag__e__static__hmc_8hpp_source.html new file mode 100644 index 00000000000..c2185b6dccb --- /dev/null +++ b/doc/api/html/diag__e__static__hmc_8hpp_source.html @@ -0,0 +1,145 @@ + + + + + +Stan: src/stan/mcmc/hmc/static/diag_e_static_hmc.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
diag_e_static_hmc.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__DIAG__E__STATIC__HMC__BETA__
+
2 #define __STAN__MCMC__DIAG__E__STATIC__HMC__BETA__
+
3 
+ + + + +
8 
+
9 namespace stan {
+
10 
+
11  namespace mcmc {
+
12 
+
13  // Hamiltonian Monte Carlo on a
+
14  // Euclidean manifold with diagonal metric
+
15  // and static integration time
+
16 
+
17  template <typename M, class BaseRNG>
+ +
19  diag_e_point,
+
20  diag_e_metric,
+
21  expl_leapfrog,
+
22  BaseRNG> {
+
23 
+
24  public:
+
25 
+
26  diag_e_static_hmc(M &m, BaseRNG& rng, std::ostream* o = &std::cout, std::ostream* e = 0):
+
27  base_static_hmc<M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG>(m, rng, o, e)
+
28  { this->_name = "Static HMC with a diagonal Euclidean metric"; }
+
29 
+
30 
+
31  };
+
32 
+
33  } // mcmc
+
34 
+
35 } // stan
+
36 
+
37 
+
38 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/diag__matrix_8hpp.html b/doc/api/html/diag__matrix_8hpp.html new file mode 100644 index 00000000000..524a7fb6a34 --- /dev/null +++ b/doc/api/html/diag__matrix_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/math/matrix/diag_matrix.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
diag_matrix.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
stan::math::diag_matrix (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v)
 Return a square diagonal matrix with the specified vector of coefficients as the diagonal values.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/diag__matrix_8hpp_source.html b/doc/api/html/diag__matrix_8hpp_source.html new file mode 100644 index 00000000000..4a0e3044fa7 --- /dev/null +++ b/doc/api/html/diag__matrix_8hpp_source.html @@ -0,0 +1,125 @@ + + + + + +Stan: src/stan/math/matrix/diag_matrix.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
diag_matrix.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__DIAG_MATRIX_HPP__
+
2 #define __STAN__MATH__MATRIX__DIAG_MATRIX_HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
15  template <typename T>
+
16  inline
+
17  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>
+
18  diag_matrix(const Eigen::Matrix<T,Eigen::Dynamic,1>& v) {
+
19  return v.asDiagonal();
+
20  }
+
21 
+
22  }
+
23 }
+
24 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/diag__post__multiply_8hpp.html b/doc/api/html/diag__post__multiply_8hpp.html new file mode 100644 index 00000000000..bdddd1666ac --- /dev/null +++ b/doc/api/html/diag__post__multiply_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/matrix/diag_post_multiply.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
diag_post_multiply.hpp File Reference
+
+
+
#include <stdexcept>
+#include <boost/math/tools/promotion.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T1 , typename T2 , int R1, int C1, int R2, int C2>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R1, C1 > 
stan::math::diag_post_multiply (const Eigen::Matrix< T1, R1, C1 > &m1, const Eigen::Matrix< T2, R2, C2 > &m2)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/diag__post__multiply_8hpp_source.html b/doc/api/html/diag__post__multiply_8hpp_source.html new file mode 100644 index 00000000000..7056cac97d1 --- /dev/null +++ b/doc/api/html/diag__post__multiply_8hpp_source.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/math/matrix/diag_post_multiply.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
diag_post_multiply.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__DIAG_POST_MULTIPLY_HPP__
+
2 #define __STAN__MATH__MATRIX__DIAG_POST_MULTIPLY_HPP__
+
3 
+
4 #include <stdexcept>
+
5 #include <boost/math/tools/promotion.hpp>
+ +
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
11  template <typename T1, typename T2, int R1,int C1,int R2,int C2>
+
12  Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type, R1, C1>
+
13  diag_post_multiply(const Eigen::Matrix<T1,R1,C1>& m1,
+
14  const Eigen::Matrix<T2,R2,C2>& m2) {
+
15  if (m2.cols() != 1 && m2.rows() != 1)
+
16  throw std::domain_error("m2 must be a vector");
+
17  if (m2.size() != m1.cols())
+
18  throw std::domain_error("m2 must have same length as m1 has columns");
+
19  Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type, R1, C1>
+
20  result(m1.rows(),m1.cols());
+
21  for (int i = 0; i < m1.rows(); ++i)
+
22  for (int j = 0; j < m1.cols(); ++j)
+
23  result(i,j) = m2(i) * m1(i,j);
+
24  return result;
+
25  }
+
26 
+
27  }
+
28 }
+
29 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/diag__pre__multiply_8hpp.html b/doc/api/html/diag__pre__multiply_8hpp.html new file mode 100644 index 00000000000..9338262520c --- /dev/null +++ b/doc/api/html/diag__pre__multiply_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/matrix/diag_pre_multiply.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
diag_pre_multiply.hpp File Reference
+
+
+
#include <stdexcept>
+#include <boost/math/tools/promotion.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T1 , typename T2 , int R1, int C1, int R2, int C2>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R2, C2 > 
stan::math::diag_pre_multiply (const Eigen::Matrix< T1, R1, C1 > &m1, const Eigen::Matrix< T2, R2, C2 > &m2)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/diag__pre__multiply_8hpp_source.html b/doc/api/html/diag__pre__multiply_8hpp_source.html new file mode 100644 index 00000000000..bac4cfe0542 --- /dev/null +++ b/doc/api/html/diag__pre__multiply_8hpp_source.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/math/matrix/diag_pre_multiply.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
diag_pre_multiply.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__DIAG_PRE_MULTIPLY_HPP__
+
2 #define __STAN__MATH__MATRIX__DIAG_PRE_MULTIPLY_HPP__
+
3 
+
4 #include <stdexcept>
+
5 #include <boost/math/tools/promotion.hpp>
+ +
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
11  template <typename T1, typename T2, int R1,int C1,int R2,int C2>
+
12  Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type, R2, C2>
+
13  diag_pre_multiply(const Eigen::Matrix<T1,R1,C1>& m1,
+
14  const Eigen::Matrix<T2,R2,C2>& m2) {
+
15  if (m1.cols() != 1 && m1.rows() != 1)
+
16  throw std::domain_error("m1 must be a vector");
+
17  if (m1.size() != m2.rows())
+
18  throw std::domain_error("m1 must have same length as m2 has rows");
+
19  Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type, R2, C2>
+
20  result(m2.rows(),m2.cols());
+
21  for (int i = 0; i < m2.rows(); ++i)
+
22  for (int j = 0; j < m2.cols(); ++j)
+
23  result(i,j) = m1(i) * m2(i,j);
+
24  return result;
+
25  }
+
26 
+
27  }
+
28 }
+
29 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/diagonal_8hpp.html b/doc/api/html/diagonal_8hpp.html new file mode 100644 index 00000000000..acdfd178c37 --- /dev/null +++ b/doc/api/html/diagonal_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/math/matrix/diagonal.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
diagonal.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
stan::math::diagonal (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &m)
 Return a column vector of the diagonal elements of the specified matrix.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/diagonal_8hpp_source.html b/doc/api/html/diagonal_8hpp_source.html new file mode 100644 index 00000000000..08981f01f3e --- /dev/null +++ b/doc/api/html/diagonal_8hpp_source.html @@ -0,0 +1,125 @@ + + + + + +Stan: src/stan/math/matrix/diagonal.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
diagonal.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__DIAGONAL_HPP__
+
2 #define __STAN__MATH__MATRIX__DIAGONAL_HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
15  template <typename T>
+
16  inline
+
17  Eigen::Matrix<T,Eigen::Dynamic,1>
+
18  diagonal(const Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& m) {
+
19  return m.diagonal();
+
20  }
+
21 
+
22  }
+
23 }
+
24 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dims_8hpp.html b/doc/api/html/dims_8hpp.html new file mode 100644 index 00000000000..e5c34ea7a4f --- /dev/null +++ b/doc/api/html/dims_8hpp.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/math/matrix/dims.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
dims.hpp File Reference
+
+
+
#include <vector>
+#include <stan/math/matrix/Eigen.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + + + + + +

+Functions

template<typename T >
void stan::math::dims (const T &x, std::vector< int > &result)
 
template<typename T , int R, int C>
void stan::math::dims (const Eigen::Matrix< T, R, C > &x, std::vector< int > &result)
 
template<typename T >
void stan::math::dims (const std::vector< T > &x, std::vector< int > &result)
 
template<typename T >
std::vector< int > stan::math::dims (const T &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dims_8hpp_source.html b/doc/api/html/dims_8hpp_source.html new file mode 100644 index 00000000000..8cdf8ac0844 --- /dev/null +++ b/doc/api/html/dims_8hpp_source.html @@ -0,0 +1,149 @@ + + + + + +Stan: src/stan/math/matrix/dims.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
dims.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__DIMS_HPP__
+
2 #define __STAN__MATH__MATRIX__DIMS_HPP__
+
3 
+
4 #include <vector>
+ +
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
10  template <typename T>
+
11  inline
+
12  void
+
13  dims(const T& x, std::vector<int>& result) {
+
14  /* no op */
+
15  }
+
16  template <typename T, int R, int C>
+
17  inline void
+
18  dims(const Eigen::Matrix<T,R,C>& x,
+
19  std::vector<int>& result) {
+
20  result.push_back(x.rows());
+
21  result.push_back(x.cols());
+
22  }
+
23  template <typename T>
+
24  inline void
+
25  dims(const std::vector<T>& x,
+
26  std::vector<int>& result) {
+
27  result.push_back(x.size());
+
28  if (x.size() > 0)
+
29  dims(x[0],result);
+
30  }
+
31 
+
32  template <typename T>
+
33  inline std::vector<int>
+
34  dims(const T& x) {
+
35  std::vector<int> result;
+
36  dims(x,result);
+
37  return result;
+
38  }
+
39 
+
40  }
+
41 }
+
42 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_0c7ba03e05d7755a93c72a387515f18e.html b/doc/api/html/dir_0c7ba03e05d7755a93c72a387515f18e.html new file mode 100644 index 00000000000..cdf3cbf09b1 --- /dev/null +++ b/doc/api/html/dir_0c7ba03e05d7755a93c72a387515f18e.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/agrad/rev/internal Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
internal Directory Reference
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Files

file  ddv_vari.hpp [code]
 
file  dv_vari.hpp [code]
 
file  dvd_vari.hpp [code]
 
file  dvv_vari.hpp [code]
 
file  matrix_vari.hpp [code]
 
file  precomp_v_vari.hpp [code]
 
file  v_vari.hpp [code]
 
file  vd_vari.hpp [code]
 
file  vdd_vari.hpp [code]
 
file  vdv_vari.hpp [code]
 
file  vector_vari.hpp [code]
 
file  vv_vari.hpp [code]
 
file  vvd_vari.hpp [code]
 
file  vvv_vari.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_0f7468ba3d646c35c5f1677a20123edb.html b/doc/api/html/dir_0f7468ba3d646c35c5f1677a20123edb.html new file mode 100644 index 00000000000..0d44f2b6c35 --- /dev/null +++ b/doc/api/html/dir_0f7468ba3d646c35c5f1677a20123edb.html @@ -0,0 +1,118 @@ + + + + + +Stan: src/stan/mcmc/hmc Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
hmc Directory Reference
+
+
+ + + + + + + + + + +

+Directories

directory  hamiltonians
 
directory  integrators
 
directory  nuts
 
directory  static
 
+ + + +

+Files

file  base_hmc.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_139cce78ba5d92491da28703870a60b5.html b/doc/api/html/dir_139cce78ba5d92491da28703870a60b5.html new file mode 100644 index 00000000000..cdf6cdbf6aa --- /dev/null +++ b/doc/api/html/dir_139cce78ba5d92491da28703870a60b5.html @@ -0,0 +1,107 @@ + + + + + +Stan: src/stan/agrad/fwd/prob/univariate Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
univariate Directory Reference
+
+
+ + + + +

+Directories

directory  continuous
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_182af125d00bd279bb48de10042b58c3.html b/doc/api/html/dir_182af125d00bd279bb48de10042b58c3.html new file mode 100644 index 00000000000..d9bf52870de --- /dev/null +++ b/doc/api/html/dir_182af125d00bd279bb48de10042b58c3.html @@ -0,0 +1,127 @@ + + + + + +Stan: src/stan/agrad/fwd/operators Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
operators Directory Reference
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_1ff9d265245893e221d5111ecd1383dc.html b/doc/api/html/dir_1ff9d265245893e221d5111ecd1383dc.html new file mode 100644 index 00000000000..c9ea3c911d2 --- /dev/null +++ b/doc/api/html/dir_1ff9d265245893e221d5111ecd1383dc.html @@ -0,0 +1,229 @@ + + + + + +Stan: src/stan/gm/arguments Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
arguments Directory Reference
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Files

file  arg_adapt.hpp [code]
 
file  arg_adapt_delta.hpp [code]
 
file  arg_adapt_engaged.hpp [code]
 
file  arg_adapt_gamma.hpp [code]
 
file  arg_adapt_init_buffer.hpp [code]
 
file  arg_adapt_kappa.hpp [code]
 
file  arg_adapt_t0.hpp [code]
 
file  arg_adapt_term_buffer.hpp [code]
 
file  arg_adapt_window.hpp [code]
 
file  arg_bfgs.hpp [code]
 
file  arg_data.hpp [code]
 
file  arg_data_file.hpp [code]
 
file  arg_dense_e.hpp [code]
 
file  arg_diag_e.hpp [code]
 
file  arg_diagnose.hpp [code]
 
file  arg_diagnostic_file.hpp [code]
 
file  arg_engine.hpp [code]
 
file  arg_fail.hpp [code]
 
file  arg_hmc.hpp [code]
 
file  arg_id.hpp [code]
 
file  arg_init.hpp [code]
 
file  arg_init_alpha.hpp [code]
 
file  arg_int_time.hpp [code]
 
file  arg_iter.hpp [code]
 
file  arg_max_depth.hpp [code]
 
file  arg_method.hpp [code]
 
file  arg_metric.hpp [code]
 
file  arg_nesterov.hpp [code]
 
file  arg_newton.hpp [code]
 
file  arg_num_samples.hpp [code]
 
file  arg_num_warmup.hpp [code]
 
file  arg_nuts.hpp [code]
 
file  arg_optimize.hpp [code]
 
file  arg_optimize_algo.hpp [code]
 
file  arg_output.hpp [code]
 
file  arg_output_file.hpp [code]
 
file  arg_random.hpp [code]
 
file  arg_refresh.hpp [code]
 
file  arg_rwm.hpp [code]
 
file  arg_sample.hpp [code]
 
file  arg_sample_algo.hpp [code]
 
file  arg_save_iterations.hpp [code]
 
file  arg_save_warmup.hpp [code]
 
file  arg_seed.hpp [code]
 
file  arg_static.hpp [code]
 
file  arg_stepsize.hpp [code]
 
file  arg_stepsize_jitter.hpp [code]
 
file  arg_test.hpp [code]
 
file  arg_test_grad_eps.hpp [code]
 
file  arg_test_grad_err.hpp [code]
 
file  arg_test_gradient.hpp [code]
 
file  arg_thin.hpp [code]
 
file  arg_tolerance.hpp [code]
 
file  arg_unit_e.hpp [code]
 
file  argument.hpp [code]
 
file  argument_parser.hpp [code]
 
file  argument_probe.hpp [code]
 
file  categorical_argument.hpp [code]
 
file  list_argument.hpp [code]
 
file  singleton_argument.hpp [code]
 
file  unvalued_argument.hpp [code]
 
file  valued_argument.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_2199d12d39bf553599a4a7fa2d24fe67.html b/doc/api/html/dir_2199d12d39bf553599a4a7fa2d24fe67.html new file mode 100644 index 00000000000..a7201ca5210 --- /dev/null +++ b/doc/api/html/dir_2199d12d39bf553599a4a7fa2d24fe67.html @@ -0,0 +1,107 @@ + + + + + +Stan: src/stan/agrad/rev/error_handling/matrix Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
matrix Directory Reference
+
+
+ + + + +

+Files

file  check_pos_definite.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_22b468d2bc5e21cba3741edb912cd36a.html b/doc/api/html/dir_22b468d2bc5e21cba3741edb912cd36a.html new file mode 100644 index 00000000000..66f3daf0382 --- /dev/null +++ b/doc/api/html/dir_22b468d2bc5e21cba3741edb912cd36a.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/math/error_handling/matrix Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
matrix Directory Reference
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_29b20cd43524c7f0fc77aef3c7e38f50.html b/doc/api/html/dir_29b20cd43524c7f0fc77aef3c7e38f50.html new file mode 100644 index 00000000000..514718f3f4f --- /dev/null +++ b/doc/api/html/dir_29b20cd43524c7f0fc77aef3c7e38f50.html @@ -0,0 +1,126 @@ + + + + + +Stan: src/stan/gm Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
gm Directory Reference
+
+
+ + + + + + +

+Directories

directory  arguments
 
directory  grammars
 
+ + + + + + + + + + + + + + + +

+Files

file  ast.hpp [code]
 
file  ast_def.cpp [code]
 
file  command.hpp [code]
 
file  compiler.hpp [code]
 
file  error_codes.hpp [code]
 
file  generator.hpp [code]
 
file  parser.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_2e546bda41fe40b59dc00b79d00b50ce.html b/doc/api/html/dir_2e546bda41fe40b59dc00b79d00b50ce.html new file mode 100644 index 00000000000..df3b3fda0cb --- /dev/null +++ b/doc/api/html/dir_2e546bda41fe40b59dc00b79d00b50ce.html @@ -0,0 +1,107 @@ + + + + + +Stan: src/stan/agrad/fwd/prob Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
prob Directory Reference
+
+
+ + + + +

+Directories

directory  univariate
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_2fa10d765296c30bb35aa6c0b0bc0528.html b/doc/api/html/dir_2fa10d765296c30bb35aa6c0b0bc0528.html new file mode 100644 index 00000000000..b171d5a32e7 --- /dev/null +++ b/doc/api/html/dir_2fa10d765296c30bb35aa6c0b0bc0528.html @@ -0,0 +1,116 @@ + + + + + +Stan: src/stan/prob/distributions/univariate Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
univariate Directory Reference
+
+
+ + + + + + +

+Directories

directory  continuous
 
directory  discrete
 
+ + + + + +

+Files

file  continuous.hpp [code]
 
file  discrete.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_3995d5884456238d20884a417bb53c63.html b/doc/api/html/dir_3995d5884456238d20884a417bb53c63.html new file mode 100644 index 00000000000..6307327122e --- /dev/null +++ b/doc/api/html/dir_3995d5884456238d20884a417bb53c63.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/math Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
math Directory Reference
+
+
+ + + + + + + + +

+Directories

directory  error_handling
 
directory  functions
 
directory  matrix
 
+ + + + + + + + + + + + + + + + + + + + + + + +

+Files

file  constants.hpp [code]
 
file  error_handling.hpp [code]
 
file  functions.hpp [code]
 
file  matrix.hpp [code]
 
file  matrix_error_handling.hpp [code]
 
file  rep_array.hpp [code]
 
file  rep_matrix.hpp [code]
 
file  rep_row_vector.hpp [code]
 
file  rep_vector.hpp [code]
 
file  seq_view.hpp [code]
 
file  validate_non_negative_rep.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_3b4610d017c705a4887f638ce7fbc838.html b/doc/api/html/dir_3b4610d017c705a4887f638ce7fbc838.html new file mode 100644 index 00000000000..685bcb7a885 --- /dev/null +++ b/doc/api/html/dir_3b4610d017c705a4887f638ce7fbc838.html @@ -0,0 +1,116 @@ + + + + + +Stan: src/stan/prob/distributions Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
distributions Directory Reference
+
+
+ + + + + + +

+Directories

directory  multivariate
 
directory  univariate
 
+ + + + + +

+Files

file  multivariate.hpp [code]
 
file  univariate.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_3bf5ecbbc2acdb8067d845784c2d4c37.html b/doc/api/html/dir_3bf5ecbbc2acdb8067d845784c2d4c37.html new file mode 100644 index 00000000000..73a94d8f992 --- /dev/null +++ b/doc/api/html/dir_3bf5ecbbc2acdb8067d845784c2d4c37.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/continuous Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
continuous Directory Reference
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + +

+Files

file  dirichlet.hpp [code]
 
file  gaussian_dlm_obs.hpp [code]
 
file  inv_wishart.hpp [code]
 
file  lkj_corr.hpp [code]
 
file  lkj_cov.hpp [code]
 
file  matrix_normal.hpp [code]
 
file  multi_gp.hpp [code]
 
file  multi_normal.hpp [code]
 
file  multi_normal_cholesky.hpp [code]
 
file  multi_normal_prec.hpp [code]
 
file  multi_student_t.hpp [code]
 
file  wishart.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_4169038f84fc0e1ed68b4a7c11130da4.html b/doc/api/html/dir_4169038f84fc0e1ed68b4a7c11130da4.html new file mode 100644 index 00000000000..1951ec93eb3 --- /dev/null +++ b/doc/api/html/dir_4169038f84fc0e1ed68b4a7c11130da4.html @@ -0,0 +1,119 @@ + + + + + +Stan: src/stan/mcmc/hmc/nuts Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
nuts Directory Reference
+
+
+ + + + + + + + + + + + + + + + +

+Files

file  adapt_dense_e_nuts.hpp [code]
 
file  adapt_diag_e_nuts.hpp [code]
 
file  adapt_unit_e_nuts.hpp [code]
 
file  base_nuts.hpp [code]
 
file  dense_e_nuts.hpp [code]
 
file  diag_e_nuts.hpp [code]
 
file  unit_e_nuts.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_44cbf1ed18699f3d3b4fc628a26fcd8e.html b/doc/api/html/dir_44cbf1ed18699f3d3b4fc628a26fcd8e.html new file mode 100644 index 00000000000..260cd189d89 --- /dev/null +++ b/doc/api/html/dir_44cbf1ed18699f3d3b4fc628a26fcd8e.html @@ -0,0 +1,112 @@ + + + + + +Stan: src/stan/agrad/rev/error_handling Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
error_handling Directory Reference
+
+
+ + + + +

+Directories

directory  matrix
 
+ + + +

+Files

file  matrix.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_4ff6d94cb2a0a21decf9fe1d17e36a84.html b/doc/api/html/dir_4ff6d94cb2a0a21decf9fe1d17e36a84.html new file mode 100644 index 00000000000..da6186696b2 --- /dev/null +++ b/doc/api/html/dir_4ff6d94cb2a0a21decf9fe1d17e36a84.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/prob Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
prob Directory Reference
+
+
+ + + + +

+Directories

directory  distributions
 
+ + + + + + + + + + + + + + + + + + + +

+Files

file  autocorrelation.hpp [code]
 
file  autocovariance.hpp [code]
 
file  constants.hpp [code]
 
file  distributions.hpp [code]
 
file  internal_math.hpp [code]
 
file  traits.hpp [code]
 
file  transform.hpp [code]
 
file  welford_covar_estimator.hpp [code]
 
file  welford_var_estimator.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_50f5c6d2b5c0f0cf0dce53a8e04f8433.html b/doc/api/html/dir_50f5c6d2b5c0f0cf0dce53a8e04f8433.html new file mode 100644 index 00000000000..1893a269e3f --- /dev/null +++ b/doc/api/html/dir_50f5c6d2b5c0f0cf0dce53a8e04f8433.html @@ -0,0 +1,143 @@ + + + + + +Stan: src/stan/agrad/rev/operators Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
operators Directory Reference
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_52470340ee5541bea78123d62b747bfc.html b/doc/api/html/dir_52470340ee5541bea78123d62b747bfc.html new file mode 100644 index 00000000000..f03da86f9e9 --- /dev/null +++ b/doc/api/html/dir_52470340ee5541bea78123d62b747bfc.html @@ -0,0 +1,171 @@ + + + + + +Stan: src/stan/agrad/rev/matrix Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
matrix Directory Reference
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Files

file  crossprod.hpp [code]
 
file  determinant.hpp [code]
 
file  divide.hpp [code]
 
file  dot_product.hpp [code]
 
file  dot_self.hpp [code]
 
file  Eigen_NumTraits.hpp [code]
 
file  grad.hpp [code]
 
file  initialize_variable.hpp [code]
 
file  ldlt.hpp [code]
 
file  log_determinant.hpp [code]
 
file  log_determinant_spd.hpp [code]
 
file  log_softmax.hpp [code]
 
file  log_sum_exp.hpp [code]
 
file  mdivide_left.hpp [code]
 
file  mdivide_left_spd.hpp [code]
 
file  mdivide_left_tri.hpp [code]
 
file  multiply.hpp [code]
 
file  multiply_lower_tri_self_transpose.hpp [code]
 
file  quad_form.hpp [code]
 
file  sd.hpp [code]
 
file  softmax.hpp [code]
 
file  sort.hpp [code]
 
file  squared_dist.hpp [code]
 
file  stan_print.hpp [code]
 
file  stored_gradient_vari.hpp [code]
 
file  sum.hpp [code]
 
file  tcrossprod.hpp [code]
 
file  to_var.hpp [code]
 
file  trace_gen_quad_form.hpp [code]
 
file  trace_quad_form.hpp [code]
 
file  typedefs.hpp [code]
 
file  value_of.hpp [code]
 
file  variance.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_52c3c3fe3bff0ba6815d4f34971ed7d3.html b/doc/api/html/dir_52c3c3fe3bff0ba6815d4f34971ed7d3.html new file mode 100644 index 00000000000..2e067d4d4fe --- /dev/null +++ b/doc/api/html/dir_52c3c3fe3bff0ba6815d4f34971ed7d3.html @@ -0,0 +1,124 @@ + + + + + +Stan: src/stan/agrad Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
agrad Directory Reference
+
+
+ + + + + + +

+Directories

directory  fwd
 
directory  rev
 
+ + + + + + + + + + + + + +

+Files

file  agrad_thread_safe.hpp [code]
 
file  autodiff.hpp [code]
 
file  fwd.hpp [code]
 
file  hessian.hpp [code]
 
file  partials_vari.hpp [code]
 
file  rev.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_54e1f17c1ac5ea0adfc355c0b89ee8b2.html b/doc/api/html/dir_54e1f17c1ac5ea0adfc355c0b89ee8b2.html new file mode 100644 index 00000000000..9745cf6e16d --- /dev/null +++ b/doc/api/html/dir_54e1f17c1ac5ea0adfc355c0b89ee8b2.html @@ -0,0 +1,155 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
matrix Directory Reference
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_5a90b97b153f6d877d3f3fe75b024a65.html b/doc/api/html/dir_5a90b97b153f6d877d3f3fe75b024a65.html new file mode 100644 index 00000000000..a595e6bd3be --- /dev/null +++ b/doc/api/html/dir_5a90b97b153f6d877d3f3fe75b024a65.html @@ -0,0 +1,109 @@ + + + + + +Stan: src/stan/memory Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
memory Directory Reference
+
+
+ + + + + + +

+Files

file  chunk_alloc.hpp [code]
 
file  stack_alloc.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_68c25edf9c6d341fdd24c7ac7d0f552b.html b/doc/api/html/dir_68c25edf9c6d341fdd24c7ac7d0f552b.html new file mode 100644 index 00000000000..d3f39d35dc4 --- /dev/null +++ b/doc/api/html/dir_68c25edf9c6d341fdd24c7ac7d0f552b.html @@ -0,0 +1,113 @@ + + + + + +Stan: src/stan/command Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
command Directory Reference
+
+
+ + + + + + + + + + +

+Files

file  print.cpp [code]
 
file  print.hpp [code]
 
file  stanc.cpp [code]
 
file  stanc_helper.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_6b822de55cde49ee6f3a9b01e44fb566.html b/doc/api/html/dir_6b822de55cde49ee6f3a9b01e44fb566.html new file mode 100644 index 00000000000..e4fa65bb9a5 --- /dev/null +++ b/doc/api/html/dir_6b822de55cde49ee6f3a9b01e44fb566.html @@ -0,0 +1,247 @@ + + + + + +Stan: src/stan/agrad/fwd/functions Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
functions Directory Reference
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Files

file  abs.hpp [code]
 
file  acos.hpp [code]
 
file  acosh.hpp [code]
 
file  asin.hpp [code]
 
file  asinh.hpp [code]
 
file  atan.hpp [code]
 
file  atan2.hpp [code]
 
file  atanh.hpp [code]
 
file  bessel_first_kind.hpp [code]
 
file  bessel_second_kind.hpp [code]
 
file  binary_log_loss.hpp [code]
 
file  binomial_coefficient_log.hpp [code]
 
file  cbrt.hpp [code]
 
file  ceil.hpp [code]
 
file  cos.hpp [code]
 
file  cosh.hpp [code]
 
file  digamma.hpp [code]
 
file  erf.hpp [code]
 
file  erfc.hpp [code]
 
file  exp.hpp [code]
 
file  exp2.hpp [code]
 
file  expm1.hpp [code]
 
file  fabs.hpp [code]
 
file  falling_factorial.hpp [code]
 
file  fdim.hpp [code]
 
file  floor.hpp [code]
 
file  fma.hpp [code]
 
file  fmax.hpp [code]
 
file  fmin.hpp [code]
 
file  fmod.hpp [code]
 
file  gamma_p.hpp [code]
 
file  gamma_q.hpp [code]
 
file  hypot.hpp [code]
 
file  inv.hpp [code]
 
file  inv_cloglog.hpp [code]
 
file  inv_logit.hpp [code]
 
file  inv_sqrt.hpp [code]
 
file  inv_square.hpp [code]
 
file  lbeta.hpp [code]
 
file  lgamma.hpp [code]
 
file  lmgamma.hpp [code]
 
file  log.hpp [code]
 
file  log10.hpp [code]
 
file  log1m.hpp [code]
 
file  log1m_exp.hpp [code]
 
file  log1m_inv_logit.hpp [code]
 
file  log1p.hpp [code]
 
file  log1p_exp.hpp [code]
 
file  log2.hpp [code]
 
file  log_diff_exp.hpp [code]
 
file  log_falling_factorial.hpp [code]
 
file  log_inv_logit.hpp [code]
 
file  log_rising_factorial.hpp [code]
 
file  log_sum_exp.hpp [code]
 
file  logit.hpp [code]
 
file  modified_bessel_first_kind.hpp [code]
 
file  modified_bessel_second_kind.hpp [code]
 
file  multiply_log.hpp [code]
 
file  owens_t.hpp [code]
 
file  Phi.hpp [code]
 
file  pow.hpp [code]
 
file  rising_factorial.hpp [code]
 
file  round.hpp [code]
 
file  sin.hpp [code]
 
file  sinh.hpp [code]
 
file  sqrt.hpp [code]
 
file  square.hpp [code]
 
file  tan.hpp [code]
 
file  tanh.hpp [code]
 
file  tgamma.hpp [code]
 
file  trunc.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_7edb90b8895d3ae5eaffb58e5bac252e.html b/doc/api/html/dir_7edb90b8895d3ae5eaffb58e5bac252e.html new file mode 100644 index 00000000000..221b148dc30 --- /dev/null +++ b/doc/api/html/dir_7edb90b8895d3ae5eaffb58e5bac252e.html @@ -0,0 +1,116 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
multivariate Directory Reference
+
+
+ + + + + + +

+Directories

directory  continuous
 
directory  discrete
 
+ + + + + +

+Files

file  continuous.hpp [code]
 
file  discrete.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_7f504516231d3fe329ee42a0c6d09a23.html b/doc/api/html/dir_7f504516231d3fe329ee42a0c6d09a23.html new file mode 100644 index 00000000000..0f00e18fe70 --- /dev/null +++ b/doc/api/html/dir_7f504516231d3fe329ee42a0c6d09a23.html @@ -0,0 +1,119 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/discrete Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
discrete Directory Reference
+
+
+ + + + + + + + + + + + + + + + +

+Files

file  bernoulli.hpp [code]
 
file  beta_binomial.hpp [code]
 
file  binomial.hpp [code]
 
file  hypergeometric.hpp [code]
 
file  neg_binomial.hpp [code]
 
file  ordered_logistic.hpp [code]
 
file  poisson.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_8bbd805b34b7b8cc78ee869a600898c2.html b/doc/api/html/dir_8bbd805b34b7b8cc78ee869a600898c2.html new file mode 100644 index 00000000000..4f4788370b9 --- /dev/null +++ b/doc/api/html/dir_8bbd805b34b7b8cc78ee869a600898c2.html @@ -0,0 +1,111 @@ + + + + + +Stan: src/stan/model Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
model Directory Reference
+
+
+ + + + + + + + +

+Files

file  model_header.hpp [code]
 
file  prob_grad.hpp [code]
 
file  util.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_8c3552022fc3ada5c17e804a5e09b39f.html b/doc/api/html/dir_8c3552022fc3ada5c17e804a5e09b39f.html new file mode 100644 index 00000000000..aedc9506daa --- /dev/null +++ b/doc/api/html/dir_8c3552022fc3ada5c17e804a5e09b39f.html @@ -0,0 +1,107 @@ + + + + + +Stan: src/stan/meta Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
meta Directory Reference
+
+
+ + + + +

+Files

file  traits.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_918f1495a74b4bbbcceda6da05869dad.html b/doc/api/html/dir_918f1495a74b4bbbcceda6da05869dad.html new file mode 100644 index 00000000000..4b1bc7f6a19 --- /dev/null +++ b/doc/api/html/dir_918f1495a74b4bbbcceda6da05869dad.html @@ -0,0 +1,123 @@ + + + + + +Stan: src/stan/io Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
io Directory Reference
+
+
+ + + + + + + + + + + + + + + + + + + + +

+Files

file  cmd_line.hpp [code]
 
file  csv_writer.hpp [code]
 
file  dump.hpp [code]
 
file  mcmc_writer.hpp [code]
 
file  reader.hpp [code]
 
file  stan_csv_reader.hpp [code]
 
file  util.hpp [code]
 
file  var_context.hpp [code]
 
file  writer.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_99762ae463b7309a47de4b14a14d0e0f.html b/doc/api/html/dir_99762ae463b7309a47de4b14a14d0e0f.html new file mode 100644 index 00000000000..c73d481f545 --- /dev/null +++ b/doc/api/html/dir_99762ae463b7309a47de4b14a14d0e0f.html @@ -0,0 +1,309 @@ + + + + + +Stan: src/stan/math/matrix Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
matrix Directory Reference
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Files

file  accumulator.hpp [code]
 
file  add.hpp [code]
 
file  array_builder.hpp [code]
 
file  assign.hpp [code]
 
file  block.hpp [code]
 
file  check_range.hpp [code]
 
file  cholesky_decompose.hpp [code]
 
file  col.hpp [code]
 
file  cols.hpp [code]
 
file  columns_dot_product.hpp [code]
 
file  columns_dot_self.hpp [code]
 
file  common_type.hpp [code]
 
file  crossprod.hpp [code]
 
file  cumulative_sum.hpp [code]
 
file  determinant.hpp [code]
 
file  diag_matrix.hpp [code]
 
file  diag_post_multiply.hpp [code]
 
file  diag_pre_multiply.hpp [code]
 
file  diagonal.hpp [code]
 
file  dims.hpp [code]
 
file  dist.hpp [code]
 
file  divide.hpp [code]
 
file  dot_product.hpp [code]
 
file  dot_self.hpp [code]
 
file  Eigen.hpp [code]
 
file  eigenvalues_sym.hpp [code]
 
file  eigenvectors_sym.hpp [code]
 
file  elt_divide.hpp [code]
 
file  elt_multiply.hpp [code]
 
file  exp.hpp [code]
 
file  fill.hpp [code]
 
file  get_base1.hpp [code]
 
file  get_base1_lhs.hpp [code]
 
file  head.hpp [code]
 
file  initialize.hpp [code]
 
file  inverse.hpp [code]
 
file  inverse_spd.hpp [code]
 
file  ldlt.hpp [code]
 
file  log.hpp [code]
 
file  log_determinant.hpp [code]
 
file  log_determinant_spd.hpp [code]
 
file  log_softmax.hpp [code]
 
file  log_sum_exp.hpp [code]
 
file  max.hpp [code]
 
file  mdivide_left.hpp [code]
 
file  mdivide_left_spd.hpp [code]
 
file  mdivide_left_tri.hpp [code]
 
file  mdivide_left_tri_low.hpp [code]
 
file  mdivide_right.hpp [code]
 
file  mdivide_right_spd.hpp [code]
 
file  mdivide_right_tri.hpp [code]
 
file  mdivide_right_tri_low.hpp [code]
 
file  mean.hpp [code]
 
file  min.hpp [code]
 
file  minus.hpp [code]
 
file  multiply.hpp [code]
 
file  multiply_lower_tri_self_transpose.hpp [code]
 
file  prod.hpp [code]
 
file  promote_common.hpp [code]
 
file  promoter.hpp [code]
 
file  quad_form.hpp [code]
 
file  rank.hpp [code]
 
file  resize.hpp [code]
 
file  row.hpp [code]
 
file  rows.hpp [code]
 
file  rows_dot_product.hpp [code]
 
file  rows_dot_self.hpp [code]
 
file  sd.hpp [code]
 
file  segment.hpp [code]
 
file  singular_values.hpp [code]
 
file  size.hpp [code]
 
file  softmax.hpp [code]
 
file  sort.hpp [code]
 
file  squared_dist.hpp [code]
 
file  stan_print.hpp [code]
 
file  sub_col.hpp [code]
 
file  sub_row.hpp [code]
 
file  subtract.hpp [code]
 
file  sum.hpp [code]
 
file  tail.hpp [code]
 
file  tcrossprod.hpp [code]
 
file  to_vector.hpp [code]
 
file  trace.hpp [code]
 
file  trace_gen_quad_form.hpp [code]
 
file  trace_quad_form.hpp [code]
 
file  transpose.hpp [code]
 
file  typedefs.hpp [code]
 
file  validate_column_index.hpp [code]
 
file  validate_greater.hpp [code]
 
file  validate_greater_or_equal.hpp [code]
 
file  validate_less.hpp [code]
 
file  validate_less_or_equal.hpp [code]
 
file  validate_matching_dims.hpp [code]
 
file  validate_matching_sizes.hpp [code]
 
file  validate_multiplicable.hpp [code]
 
file  validate_nonzero_size.hpp [code]
 
file  validate_row_index.hpp [code]
 
file  validate_square.hpp [code]
 
file  validate_std_vector_index.hpp [code]
 
file  validate_symmetric.hpp [code]
 
file  validate_vector.hpp [code]
 
file  variance.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_99fdd75913c28d151522a8b8afede414.html b/doc/api/html/dir_99fdd75913c28d151522a8b8afede414.html new file mode 100644 index 00000000000..a91b2b69632 --- /dev/null +++ b/doc/api/html/dir_99fdd75913c28d151522a8b8afede414.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/math/error_handling Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
error_handling Directory Reference
+
+
+ + + + +

+Directories

directory  matrix
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Files

file  check_bounded.hpp [code]
 
file  check_consistent_size.hpp [code]
 
file  check_consistent_sizes.hpp [code]
 
file  check_finite.hpp [code]
 
file  check_greater.hpp [code]
 
file  check_greater_or_equal.hpp [code]
 
file  check_less.hpp [code]
 
file  check_less_or_equal.hpp [code]
 
file  check_nonnegative.hpp [code]
 
file  check_not_nan.hpp [code]
 
file  check_positive.hpp [code]
 
file  dom_err.hpp [code]
 
file  dom_err_vec.hpp [code]
 
file  raise_domain_error.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_9c4b002ce8795bbd5dbe2cf3421fe13a.html b/doc/api/html/dir_9c4b002ce8795bbd5dbe2cf3421fe13a.html new file mode 100644 index 00000000000..5b2fc632558 --- /dev/null +++ b/doc/api/html/dir_9c4b002ce8795bbd5dbe2cf3421fe13a.html @@ -0,0 +1,107 @@ + + + + + +Stan: src Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
src Directory Reference
+
+
+ + + + +

+Directories

directory  stan
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_adda0d2b1be4bc1eb47d3b2cf56797af.html b/doc/api/html/dir_adda0d2b1be4bc1eb47d3b2cf56797af.html new file mode 100644 index 00000000000..2956e8c8fc3 --- /dev/null +++ b/doc/api/html/dir_adda0d2b1be4bc1eb47d3b2cf56797af.html @@ -0,0 +1,147 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
continuous Directory Reference
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Files

file  beta.hpp [code]
 
file  cauchy.hpp [code]
 
file  chi_square.hpp [code]
 
file  double_exponential.hpp [code]
 
file  exp_mod_normal.hpp [code]
 
file  exponential.hpp [code]
 
file  gamma.hpp [code]
 
file  gumbel.hpp [code]
 
file  inv_chi_square.hpp [code]
 
file  inv_gamma.hpp [code]
 
file  logistic.hpp [code]
 
file  lognormal.hpp [code]
 
file  normal.hpp [code]
 
file  pareto.hpp [code]
 
file  rayleigh.hpp [code]
 
file  scaled_inv_chi_square.hpp [code]
 
file  skew_normal.hpp [code]
 
file  student_t.hpp [code]
 
file  uniform.hpp [code]
 
file  von_mises.hpp [code]
 
file  weibull.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_ae30097f91ecf0dffad078cd8b901d6c.html b/doc/api/html/dir_ae30097f91ecf0dffad078cd8b901d6c.html new file mode 100644 index 00000000000..26df7347c9d --- /dev/null +++ b/doc/api/html/dir_ae30097f91ecf0dffad078cd8b901d6c.html @@ -0,0 +1,111 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/discrete Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
discrete Directory Reference
+
+
+ + + + + + + + +

+Files

file  categorical.hpp [code]
 
file  categorical_logit.hpp [code]
 
file  multinomial.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_b1c6471129ce395961fd25e68f861508.html b/doc/api/html/dir_b1c6471129ce395961fd25e68f861508.html new file mode 100644 index 00000000000..6f7dec53d2c --- /dev/null +++ b/doc/api/html/dir_b1c6471129ce395961fd25e68f861508.html @@ -0,0 +1,150 @@ + + + + + +Stan: src/stan Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
stan Directory Reference
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + +

+Directories

directory  agrad
 
directory  command
 
directory  gm
 
directory  io
 
directory  math
 
directory  mcmc
 
directory  memory
 
directory  meta
 
directory  model
 
directory  optimization
 
directory  prob
 
+ + + + + + + + + + + + + + + + + + + + + +

+Files

file  agrad.hpp [code]
 
file  gm.hpp [code]
 
file  io.hpp [code]
 
file  math.hpp [code]
 
file  mcmc.hpp [code]
 
file  memory.hpp [code]
 
file  meta.hpp [code]
 
file  model.hpp [code]
 
file  prob.hpp [code]
 
file  version.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_b5faa64c567d6f189426dea685de5e0f.html b/doc/api/html/dir_b5faa64c567d6f189426dea685de5e0f.html new file mode 100644 index 00000000000..1a03e53bd3e --- /dev/null +++ b/doc/api/html/dir_b5faa64c567d6f189426dea685de5e0f.html @@ -0,0 +1,107 @@ + + + + + +Stan: src/stan/agrad/fwd/prob/univariate/continuous Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
continuous Directory Reference
+
+
+ + + + +

+Files

file  normal.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_bfdd916fd7a3310c7c8c32c9dbb4c5dd.html b/doc/api/html/dir_bfdd916fd7a3310c7c8c32c9dbb4c5dd.html new file mode 100644 index 00000000000..9f78e7f0d59 --- /dev/null +++ b/doc/api/html/dir_bfdd916fd7a3310c7c8c32c9dbb4c5dd.html @@ -0,0 +1,151 @@ + + + + + +Stan: src/stan/gm/grammars Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
grammars Directory Reference
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_d06f81619dd9bcc28d70dd2c97937727.html b/doc/api/html/dir_d06f81619dd9bcc28d70dd2c97937727.html new file mode 100644 index 00000000000..0e0656734ec --- /dev/null +++ b/doc/api/html/dir_d06f81619dd9bcc28d70dd2c97937727.html @@ -0,0 +1,237 @@ + + + + + +Stan: src/stan/math/functions Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
functions Directory Reference
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Files

file  abs.hpp [code]
 
file  as_bool.hpp [code]
 
file  bessel_first_kind.hpp [code]
 
file  bessel_second_kind.hpp [code]
 
file  binary_log_loss.hpp [code]
 
file  binomial_coefficient_log.hpp [code]
 
file  digamma.hpp [code]
 
file  dist.hpp [code]
 
file  dot.hpp [code]
 
file  dot_self.hpp [code]
 
file  exp2.hpp [code]
 
file  falling_factorial.hpp [code]
 
file  fdim.hpp [code]
 
file  fma.hpp [code]
 
file  gamma_p.hpp [code]
 
file  gamma_q.hpp [code]
 
file  ibeta.hpp [code]
 
file  if_else.hpp [code]
 
file  int_step.hpp [code]
 
file  inv.hpp [code]
 
file  inv_cloglog.hpp [code]
 
file  inv_logit.hpp [code]
 
file  inv_sqrt.hpp [code]
 
file  inv_square.hpp [code]
 
file  inverse_softmax.hpp [code]
 
file  is_uninitialized.hpp [code]
 
file  lbeta.hpp [code]
 
file  lgamma.hpp [code]
 
file  lmgamma.hpp [code]
 
file  log1m.hpp [code]
 
file  log1m_exp.hpp [code]
 
file  log1m_inv_logit.hpp [code]
 
file  log1p.hpp [code]
 
file  log1p_exp.hpp [code]
 
file  log2.hpp [code]
 
file  log_diff_exp.hpp [code]
 
file  log_falling_factorial.hpp [code]
 
file  log_inv_logit.hpp [code]
 
file  log_rising_factorial.hpp [code]
 
file  log_sum_exp.hpp [code]
 
file  logical_and.hpp [code]
 
file  logical_eq.hpp [code]
 
file  logical_gt.hpp [code]
 
file  logical_gte.hpp [code]
 
file  logical_lt.hpp [code]
 
file  logical_lte.hpp [code]
 
file  logical_negation.hpp [code]
 
file  logical_neq.hpp [code]
 
file  logical_or.hpp [code]
 
file  logit.hpp [code]
 
file  max.hpp [code]
 
file  min.hpp [code]
 
file  modified_bessel_first_kind.hpp [code]
 
file  modified_bessel_second_kind.hpp [code]
 
file  multiply_log.hpp [code]
 
file  owens_t.hpp [code]
 
file  Phi.hpp [code]
 
file  Phi_approx.hpp [code]
 
file  rising_factorial.hpp [code]
 
file  scaled_add.hpp [code]
 
file  square.hpp [code]
 
file  step.hpp [code]
 
file  sub.hpp [code]
 
file  sum.hpp [code]
 
file  trigamma.hpp [code]
 
file  value_of.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_e5fd7b97e7c167e7281b34e17696a6e4.html b/doc/api/html/dir_e5fd7b97e7c167e7281b34e17696a6e4.html new file mode 100644 index 00000000000..e75615491b7 --- /dev/null +++ b/doc/api/html/dir_e5fd7b97e7c167e7281b34e17696a6e4.html @@ -0,0 +1,111 @@ + + + + + +Stan: src/stan/mcmc/hmc/integrators Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
integrators Directory Reference
+
+
+ + + + + + + + +

+Files

file  base_integrator.hpp [code]
 
file  base_leapfrog.hpp [code]
 
file  expl_leapfrog.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_e65b8371bb074abd719c6e80ee5d6469.html b/doc/api/html/dir_e65b8371bb074abd719c6e80ee5d6469.html new file mode 100644 index 00000000000..d08ef5ff4eb --- /dev/null +++ b/doc/api/html/dir_e65b8371bb074abd719c6e80ee5d6469.html @@ -0,0 +1,121 @@ + + + + + +Stan: src/stan/mcmc/hmc/hamiltonians Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
hamiltonians Directory Reference
+
+
+ + + + + + + + + + + + + + + + + + +

+Files

file  base_hamiltonian.hpp [code]
 
file  dense_e_metric.hpp [code]
 
file  dense_e_point.hpp [code]
 
file  diag_e_metric.hpp [code]
 
file  diag_e_point.hpp [code]
 
file  ps_point.hpp [code]
 
file  unit_e_metric.hpp [code]
 
file  unit_e_point.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_e7242831226ee912bf5f374de664968d.html b/doc/api/html/dir_e7242831226ee912bf5f374de664968d.html new file mode 100644 index 00000000000..20a6be1e8c4 --- /dev/null +++ b/doc/api/html/dir_e7242831226ee912bf5f374de664968d.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/mcmc Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
mcmc Directory Reference
+
+
+ + + + +

+Directories

directory  hmc
 
+ + + + + + + + + + + + + + + + + + + + + + + + + +

+Files

file  base_adaptation.hpp [code]
 
file  base_adapter.hpp [code]
 
file  base_mcmc.hpp [code]
 
file  chains.hpp [code]
 
file  covar_adaptation.hpp [code]
 
file  sample.hpp [code]
 
file  stepsize_adaptation.hpp [code]
 
file  stepsize_adapter.hpp [code]
 
file  stepsize_covar_adapter.hpp [code]
 
file  stepsize_var_adapter.hpp [code]
 
file  var_adaptation.hpp [code]
 
file  windowed_adaptation.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_e9c236c76d69ff67463df99eaf9c4820.html b/doc/api/html/dir_e9c236c76d69ff67463df99eaf9c4820.html new file mode 100644 index 00000000000..d4e4d7c8d50 --- /dev/null +++ b/doc/api/html/dir_e9c236c76d69ff67463df99eaf9c4820.html @@ -0,0 +1,119 @@ + + + + + +Stan: src/stan/mcmc/hmc/static Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
static Directory Reference
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_f2ec37f115c79ba754de20300359aed5.html b/doc/api/html/dir_f2ec37f115c79ba754de20300359aed5.html new file mode 100644 index 00000000000..5c0559f844a --- /dev/null +++ b/doc/api/html/dir_f2ec37f115c79ba754de20300359aed5.html @@ -0,0 +1,148 @@ + + + + + +Stan: src/stan/agrad/rev Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
rev Directory Reference
+
+
+ + + + + + + + + + + + +

+Directories

directory  error_handling
 
directory  functions
 
directory  internal
 
directory  matrix
 
directory  operators
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Files

file  boost_fpclassify.hpp [code]
 
file  calculate_chain.hpp [code]
 
file  chainable.hpp [code]
 
file  error_handling.hpp [code]
 
file  functions.hpp [code]
 
file  internal.hpp [code]
 
file  jacobian.hpp [code]
 
file  matrix.hpp [code]
 
file  numeric_limits.hpp [code]
 
file  operators.hpp [code]
 
file  print_stack.hpp [code]
 
file  var.hpp [code]
 
file  var_stack.cpp [code]
 
file  var_stack.hpp [code]
 
file  vari.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_f3e98ab768ca388ef4baecb6d973adcf.html b/doc/api/html/dir_f3e98ab768ca388ef4baecb6d973adcf.html new file mode 100644 index 00000000000..7c6b9c37765 --- /dev/null +++ b/doc/api/html/dir_f3e98ab768ca388ef4baecb6d973adcf.html @@ -0,0 +1,111 @@ + + + + + +Stan: src/stan/optimization Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
optimization Directory Reference
+
+
+ + + + + + + + +

+Files

file  bfgs.hpp [code]
 
file  nesterov_gradient.hpp [code]
 
file  newton.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_f77850045c6d72da1ced64bfc8354271.html b/doc/api/html/dir_f77850045c6d72da1ced64bfc8354271.html new file mode 100644 index 00000000000..8f1302e85bf --- /dev/null +++ b/doc/api/html/dir_f77850045c6d72da1ced64bfc8354271.html @@ -0,0 +1,251 @@ + + + + + +Stan: src/stan/agrad/rev/functions Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
functions Directory Reference
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Files

file  abs.hpp [code]
 
file  acos.hpp [code]
 
file  acosh.hpp [code]
 
file  as_bool.hpp [code]
 
file  asin.hpp [code]
 
file  asinh.hpp [code]
 
file  atan.hpp [code]
 
file  atan2.hpp [code]
 
file  atanh.hpp [code]
 
file  bessel_first_kind.hpp [code]
 
file  bessel_second_kind.hpp [code]
 
file  binary_log_loss.hpp [code]
 
file  cbrt.hpp [code]
 
file  ceil.hpp [code]
 
file  cos.hpp [code]
 
file  cosh.hpp [code]
 
file  digamma.hpp [code]
 
file  erf.hpp [code]
 
file  erfc.hpp [code]
 
file  exp.hpp [code]
 
file  exp2.hpp [code]
 
file  expm1.hpp [code]
 
file  fabs.hpp [code]
 
file  falling_factorial.hpp [code]
 
file  fdim.hpp [code]
 
file  floor.hpp [code]
 
file  fma.hpp [code]
 
file  fmax.hpp [code]
 
file  fmin.hpp [code]
 
file  fmod.hpp [code]
 
file  gamma_p.hpp [code]
 
file  gamma_q.hpp [code]
 
file  hypot.hpp [code]
 
file  ibeta.hpp [code]
 
file  if_else.hpp [code]
 
file  inv.hpp [code]
 
file  inv_cloglog.hpp [code]
 
file  inv_logit.hpp [code]
 
file  inv_sqrt.hpp [code]
 
file  inv_square.hpp [code]
 
file  is_uninitialized.hpp [code]
 
file  lgamma.hpp [code]
 
file  lmgamma.hpp [code]
 
file  log.hpp [code]
 
file  log10.hpp [code]
 
file  log1m.hpp [code]
 
file  log1m_exp.hpp [code]
 
file  log1p.hpp [code]
 
file  log1p_exp.hpp [code]
 
file  log2.hpp [code]
 
file  log_diff_exp.hpp [code]
 
file  log_falling_factorial.hpp [code]
 
file  log_rising_factorial.hpp [code]
 
file  log_sum_exp.hpp [code]
 
file  modified_bessel_first_kind.hpp [code]
 
file  modified_bessel_second_kind.hpp [code]
 
file  multiply_log.hpp [code]
 
file  owens_t.hpp [code]
 
file  Phi.hpp [code]
 
file  Phi_approx.hpp [code]
 
file  pow.hpp [code]
 
file  rising_factorial.hpp [code]
 
file  round.hpp [code]
 
file  sin.hpp [code]
 
file  sinh.hpp [code]
 
file  sqrt.hpp [code]
 
file  square.hpp [code]
 
file  step.hpp [code]
 
file  tan.hpp [code]
 
file  tanh.hpp [code]
 
file  tgamma.hpp [code]
 
file  trunc.hpp [code]
 
file  value_of.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dir_fb5291ba38e4a736e77d8ba78c86369a.html b/doc/api/html/dir_fb5291ba38e4a736e77d8ba78c86369a.html new file mode 100644 index 00000000000..1324ce0d641 --- /dev/null +++ b/doc/api/html/dir_fb5291ba38e4a736e77d8ba78c86369a.html @@ -0,0 +1,126 @@ + + + + + +Stan: src/stan/agrad/fwd Directory Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ + +
+
+
+
fwd Directory Reference
+
+
+ + + + + + + + + + +

+Directories

directory  functions
 
directory  matrix
 
directory  operators
 
directory  prob
 
+ + + + + + + + + + + +

+Files

file  functions.hpp [code]
 
file  fvar.hpp [code]
 
file  matrix.hpp [code]
 
file  numeric_limits.hpp [code]
 
file  operators.hpp [code]
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dirichlet_8hpp.html b/doc/api/html/dirichlet_8hpp.html new file mode 100644 index 00000000000..7a288a8da92 --- /dev/null +++ b/doc/api/html/dirichlet_8hpp.html @@ -0,0 +1,147 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/continuous/dirichlet.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
dirichlet.hpp File Reference
+
+
+
#include <boost/math/special_functions/gamma.hpp>
+#include <boost/random/gamma_distribution.hpp>
+#include <boost/random/variate_generator.hpp>
+#include <stan/prob/constants.hpp>
+#include <stan/math/matrix_error_handling.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/prob/traits.hpp>
+#include <stan/math/functions/multiply_log.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + +

+Functions

template<bool propto, typename T_prob , typename T_prior_sample_size >
boost::math::tools::promote_args
+< T_prob, T_prior_sample_size >
+::type 
stan::prob::dirichlet_log (const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta, const Eigen::Matrix< T_prior_sample_size, Eigen::Dynamic, 1 > &alpha)
 The log of the Dirichlet density for the given theta and a vector of prior sample sizes, alpha.
 
template<typename T_prob , typename T_prior_sample_size >
boost::math::tools::promote_args
+< T_prob, T_prior_sample_size >
+::type 
stan::prob::dirichlet_log (const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta, const Eigen::Matrix< T_prior_sample_size, Eigen::Dynamic, 1 > &alpha)
 
template<class RNG >
Eigen::VectorXd stan::prob::dirichlet_rng (const Eigen::Matrix< double, Eigen::Dynamic, 1 > &alpha, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dirichlet_8hpp_source.html b/doc/api/html/dirichlet_8hpp_source.html new file mode 100644 index 00000000000..f14bef6efb9 --- /dev/null +++ b/doc/api/html/dirichlet_8hpp_source.html @@ -0,0 +1,189 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/continuous/dirichlet.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
dirichlet.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__MULTIVARIATE__CONTINUOUS__DIRICHLET_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__MULTIVARIATE__CONTINUOUS__DIRICHLET_HPP__
+
3 
+
4 #include <boost/math/special_functions/gamma.hpp>
+
5 #include <boost/random/gamma_distribution.hpp>
+
6 #include <boost/random/variate_generator.hpp>
+
7 
+ + + +
11 #include <stan/prob/traits.hpp>
+ +
13 
+
14 namespace stan {
+
15 
+
16  namespace prob {
+
17 
+
43  template <bool propto,
+
44  typename T_prob, typename T_prior_sample_size>
+
45  typename boost::math::tools::promote_args<T_prob,T_prior_sample_size>::type
+
46  dirichlet_log(const Eigen::Matrix<T_prob,Eigen::Dynamic,1>& theta,
+
47  const Eigen::Matrix<T_prior_sample_size,Eigen::Dynamic,1>& alpha) {
+
48  static const char* function = "stan::prob::dirichlet_log(%1%)";
+
49  using boost::math::lgamma;
+
50  using boost::math::tools::promote_args;
+ + + + +
55 
+
56  typename promote_args<T_prob,T_prior_sample_size>::type lp(0.0);
+
57  if (!check_consistent_sizes(function, theta, alpha,
+
58  "probabilities", "prior sample sizes",
+
59  &lp))
+
60  return lp;
+
61  if (!check_positive(function, alpha, "prior sample sizes", &lp))
+
62  return lp;
+
63  if (!check_simplex(function, theta, "probabilities", &lp))
+
64  return lp;
+
65 
+ +
67  lp += lgamma(alpha.sum());
+
68  for (int k = 0; k < alpha.rows(); ++k)
+
69  lp -= lgamma(alpha[k]);
+
70  }
+ +
72  for (int k = 0; k < theta.rows(); ++k)
+
73  lp += multiply_log(alpha[k]-1, theta[k]);
+
74  return lp;
+
75  }
+
76 
+
77  template <typename T_prob, typename T_prior_sample_size>
+
78  inline
+
79  typename boost::math::tools::promote_args<T_prob,T_prior_sample_size>::type
+
80  dirichlet_log(const Eigen::Matrix<T_prob,Eigen::Dynamic,1>& theta,
+
81  const Eigen::Matrix<T_prior_sample_size,Eigen::Dynamic,1>& alpha) {
+
82  return dirichlet_log<false>(theta,alpha);
+
83  }
+
84 
+
85  template <class RNG>
+
86  inline Eigen::VectorXd
+
87  dirichlet_rng(const Eigen::Matrix<double,Eigen::Dynamic,1>& alpha,
+
88  RNG& rng) {
+
89  using boost::variate_generator;
+
90  using boost::gamma_distribution;
+
91 
+
92  double sum = 0;
+
93  Eigen::VectorXd y(alpha.rows());
+
94  for(int i = 0; i < alpha.rows(); i++) {
+
95  variate_generator<RNG&, gamma_distribution<> >
+
96  gamma_rng(rng, gamma_distribution<>(alpha(i,0),1));
+
97  y(i) = gamma_rng();
+
98  sum += y(i);
+
99  }
+
100 
+
101  for(int i = 0; i < alpha.rows(); i++)
+
102  y(i) /= sum;
+
103  return y;
+
104  }
+
105  }
+
106 }
+
107 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/distributions_8hpp.html b/doc/api/html/distributions_8hpp.html new file mode 100644 index 00000000000..e9b2bea24ef --- /dev/null +++ b/doc/api/html/distributions_8hpp.html @@ -0,0 +1,111 @@ + + + + + +Stan: src/stan/prob/distributions.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
distributions.hpp File Reference
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/distributions_8hpp_source.html b/doc/api/html/distributions_8hpp_source.html new file mode 100644 index 00000000000..9f297492aad --- /dev/null +++ b/doc/api/html/distributions_8hpp_source.html @@ -0,0 +1,114 @@ + + + + + +Stan: src/stan/prob/distributions.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
distributions.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS_HPP__
+
3 
+ + +
6 
+
7 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dom__err_8hpp.html b/doc/api/html/dom__err_8hpp.html new file mode 100644 index 00000000000..626441ed637 --- /dev/null +++ b/doc/api/html/dom__err_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/math/error_handling/dom_err.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
dom_err.hpp File Reference
+
+
+
#include <sstream>
+#include <boost/math/policies/policy.hpp>
+#include <stan/math/error_handling/raise_domain_error.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T_y , typename T_result , typename T_msg2 >
bool stan::math::dom_err (const char *function, const T_y &y, const char *name, const char *error_msg, T_msg2 error_msg2, T_result *result)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dom__err_8hpp_source.html b/doc/api/html/dom__err_8hpp_source.html new file mode 100644 index 00000000000..bc184cb3524 --- /dev/null +++ b/doc/api/html/dom__err_8hpp_source.html @@ -0,0 +1,153 @@ + + + + + +Stan: src/stan/math/error_handling/dom_err.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
dom_err.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__ERROR_HANDLING__DOM_ERR_HPP__
+
2 #define __STAN__MATH__ERROR_HANDLING__DOM_ERR_HPP__
+
3 
+
4 #include <sstream>
+
5 #include <boost/math/policies/policy.hpp>
+ +
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
11  namespace {
+
12  // local output stream for pairs
+
13  template <typename T1, typename T2>
+
14  std::ostream& operator<<(std::ostream& o,
+
15  std::pair<T1,T2> xs) {
+
16  o << '(' << xs.first << ", " << xs.second << ')';
+
17  return o;
+
18  }
+
19  }
+
20 
+
21 
+
22  template <typename T_y,
+
23  typename T_result,
+
24  typename T_msg2>
+
25  inline bool dom_err(const char* function,
+
26  const T_y& y,
+
27  const char* name,
+
28  const char* error_msg,
+
29  T_msg2 error_msg2,
+
30  T_result* result) {
+ +
32  std::ostringstream msg_o;
+
33  msg_o << name << error_msg << error_msg2;
+
34  std::string msg(msg_o.str());
+
35  T_result tmp = raise_domain_error<T_result,T_y>(function,
+
36  msg.c_str(),
+
37  y,
+
38  boost::math::policies::policy<>());
+
39  if (result != 0)
+
40  *result = tmp;
+
41  return false;
+
42  }
+
43 
+
44  }
+
45 }
+
46 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dom__err__vec_8hpp.html b/doc/api/html/dom__err__vec_8hpp.html new file mode 100644 index 00000000000..c6e504dfb65 --- /dev/null +++ b/doc/api/html/dom__err__vec_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/math/error_handling/dom_err_vec.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
dom_err_vec.hpp File Reference
+
+
+
#include <sstream>
+#include <boost/math/policies/policy.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/math/error_handling/raise_domain_error.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T_y , typename T_result , typename T_msg2 >
bool stan::math::dom_err_vec (size_t i, const char *function, const T_y &y, const char *name, const char *error_msg, T_msg2 error_msg2, T_result *result)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dom__err__vec_8hpp_source.html b/doc/api/html/dom__err__vec_8hpp_source.html new file mode 100644 index 00000000000..d993e88d12d --- /dev/null +++ b/doc/api/html/dom__err__vec_8hpp_source.html @@ -0,0 +1,147 @@ + + + + + +Stan: src/stan/math/error_handling/dom_err_vec.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
dom_err_vec.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__ERROR_HANDLING__DOM_ERR_VEC_HPP__
+
2 #define __STAN__MATH__ERROR_HANDLING__DOM_ERR_VEC_HPP__
+
3 
+
4 #include <sstream>
+
5 #include <boost/math/policies/policy.hpp>
+
6 #include <stan/meta/traits.hpp>
+ +
8 
+
9 namespace stan {
+
10  namespace math {
+
11 
+
12  template <typename T_y,
+
13  typename T_result,
+
14  typename T_msg2>
+
15  inline bool dom_err_vec(size_t i,
+
16  const char* function,
+
17  const T_y& y,
+
18  const char* name,
+
19  const char* error_msg,
+
20  T_msg2 error_msg2,
+
21  T_result* result) {
+ +
23  std::ostringstream msg_o;
+
24  msg_o << name << "[" << i << "] " << error_msg << error_msg2;
+
25  std::string msg(msg_o.str());
+
26  T_result tmp
+
27  = raise_domain_error<T_result,
+
28  typename T_y::value_type>(function,
+
29  msg.c_str(),
+
30  stan::get(y,i),
+
31  boost::math::policies::policy<>());
+
32  if (result != 0)
+
33  *result = tmp;
+
34  return false;
+
35  }
+
36 
+
37 
+
38  }
+
39 }
+
40 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dot_8hpp.html b/doc/api/html/dot_8hpp.html new file mode 100644 index 00000000000..8d46fb6e198 --- /dev/null +++ b/doc/api/html/dot_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/functions/dot.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
dot.hpp File Reference
+
+
+
#include <vector>
+#include <cstddef>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + +

+Functions

double stan::math::dot (const std::vector< double > &x, const std::vector< double > &y)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dot_8hpp_source.html b/doc/api/html/dot_8hpp_source.html new file mode 100644 index 00000000000..1cd475401c5 --- /dev/null +++ b/doc/api/html/dot_8hpp_source.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/functions/dot.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
dot.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__DOT_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__DOT_HPP__
+
3 
+
4 #include <vector>
+
5 #include <cstddef>
+
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
10  // x' * y
+
11  inline double dot(const std::vector<double>& x,
+
12  const std::vector<double>& y) {
+
13  double sum = 0.0;
+
14  for (size_t i = 0; i < x.size(); ++i)
+
15  sum += x[i] * y[i];
+
16  return sum;
+
17  }
+
18 
+
19  }
+
20 }
+
21 
+
22 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/double__exponential_8hpp.html b/doc/api/html/double__exponential_8hpp.html new file mode 100644 index 00000000000..456070adc92 --- /dev/null +++ b/doc/api/html/double__exponential_8hpp.html @@ -0,0 +1,160 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/double_exponential.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
double_exponential.hpp File Reference
+
+
+
#include <boost/random/uniform_01.hpp>
+#include <boost/random/variate_generator.hpp>
+#include <stan/agrad/partials_vari.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/math/functions/value_of.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/prob/constants.hpp>
+#include <stan/prob/traits.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + + + + + + + + + + +

+Functions

template<typename T >
int stan::prob::sign (const T &z)
 
template<bool propto, typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
stan::prob::double_exponential_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
stan::prob::double_exponential_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
stan::prob::double_exponential_cdf (const T_y &y, const T_loc &mu, const T_scale &sigma)
 Calculates the double exponential cumulative density function.
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
stan::prob::double_exponential_cdf_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
stan::prob::double_exponential_ccdf_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<class RNG >
double stan::prob::double_exponential_rng (const double mu, const double sigma, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/double__exponential_8hpp_source.html b/doc/api/html/double__exponential_8hpp_source.html new file mode 100644 index 00000000000..9ccaf504638 --- /dev/null +++ b/doc/api/html/double__exponential_8hpp_source.html @@ -0,0 +1,522 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/double_exponential.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
double_exponential.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__DOUBLE_EXPONENTIAL_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__DOUBLE_EXPONENTIAL_HPP__
+
3 
+
4 #include <boost/random/uniform_01.hpp>
+
5 #include <boost/random/variate_generator.hpp>
+
6 
+ + + +
10 #include <stan/meta/traits.hpp>
+
11 #include <stan/prob/constants.hpp>
+
12 #include <stan/prob/traits.hpp>
+
13 
+
14 namespace stan {
+
15 
+
16  namespace prob {
+
17  template<typename T>
+
18  inline int sign(const T& z) {
+
19  return (z == 0) ? 0 : z < 0 ? -1 : 1;
+
20  }
+
21 
+
22  // DoubleExponential(y|mu,sigma) [sigma > 0]
+
23  // FIXME: add documentation
+
24  template <bool propto,
+
25  typename T_y, typename T_loc, typename T_scale>
+ +
27  double_exponential_log(const T_y& y,
+
28  const T_loc& mu, const T_scale& sigma) {
+
29  static const char* function
+
30  = "stan::prob::double_exponential_log(%1%)";
+
31 
+ + + + + + +
38  using std::log;
+
39  using std::fabs;
+
40 
+
41  // check if any vectors are zero length
+
42  if (!(stan::length(y)
+
43  && stan::length(mu)
+
44  && stan::length(sigma)))
+
45  return 0.0;
+
46 
+
47  // set up return value accumulator
+
48  double logp(0.0);
+
49  if(!check_finite(function, y, "Random variable", &logp))
+
50  return logp;
+
51  if(!check_finite(function, mu, "Location parameter",
+
52  &logp))
+
53  return logp;
+
54  if(!check_finite(function, sigma, "Scale parameter",
+
55  &logp))
+
56  return logp;
+
57  if(!check_positive(function, sigma, "Scale parameter",
+
58  &logp))
+
59  return logp;
+
60  if (!(check_consistent_sizes(function,
+
61  y,mu,sigma,
+
62  "Random variable","Location parameter","Shape parameter",
+
63  &logp)))
+
64  return logp;
+
65 
+
66  // check if no variables are involved and prop-to
+ +
68  return 0.0;
+
69 
+
70  // set up template expressions wrapping scalars into vector views
+
71  VectorView<const T_y> y_vec(y);
+
72  VectorView<const T_loc> mu_vec(mu);
+
73  VectorView<const T_scale> sigma_vec(sigma);
+
74  size_t N = max_size(y, mu, sigma);
+
75  agrad::OperandsAndPartials<T_y,T_loc,T_scale> operands_and_partials(y, mu, sigma);
+
76 
+ +
78  inv_sigma(length(sigma));
+ +
80  inv_sigma_squared(length(sigma));
+ +
82  log_sigma(length(sigma));
+
83  for (size_t i = 0; i < length(sigma); i++) {
+
84  const double sigma_dbl = value_of(sigma_vec[i]);
+ +
86  inv_sigma[i] = 1.0 / sigma_dbl;
+ +
88  log_sigma[i] = log(value_of(sigma_vec[i]));
+ +
90  inv_sigma_squared[i] = inv_sigma[i] * inv_sigma[i];
+
91  }
+
92 
+
93 
+
94  for (size_t n = 0; n < N; n++) {
+
95  const double y_dbl = value_of(y_vec[n]);
+
96  const double mu_dbl = value_of(mu_vec[n]);
+
97 
+
98  // reusable subexpressions values
+
99  const double y_m_mu = y_dbl - mu_dbl;
+
100  const double fabs_y_m_mu = fabs(y_m_mu);
+
101 
+
102  // log probability
+ +
104  logp += NEG_LOG_TWO;
+ +
106  logp -= log_sigma[n];
+ +
108  logp -= fabs_y_m_mu * inv_sigma[n];
+
109 
+
110  // gradients
+
111  double sign_y_m_mu_times_inv_sigma(0);
+ +
113  sign_y_m_mu_times_inv_sigma = sign(y_m_mu) * inv_sigma[n];
+ +
115  operands_and_partials.d_x1[n] -= sign_y_m_mu_times_inv_sigma;
+
116  }
+ +
118  operands_and_partials.d_x2[n] += sign_y_m_mu_times_inv_sigma;
+
119  }
+ +
121  operands_and_partials.d_x3[n] += -inv_sigma[n] + fabs_y_m_mu * inv_sigma_squared[n];
+
122  }
+
123  return operands_and_partials.to_var(logp);
+
124  }
+
125 
+
126 
+
127  template <typename T_y, typename T_loc, typename T_scale>
+ +
129  double_exponential_log(const T_y& y, const T_loc& mu,
+
130  const T_scale& sigma) {
+
131  return double_exponential_log<false>(y,mu,sigma);
+
132  }
+
133 
+
148  template <typename T_y, typename T_loc, typename T_scale>
+ +
150  double_exponential_cdf(const T_y& y,
+
151  const T_loc& mu, const T_scale& sigma) {
+
152  static const char* function
+
153  = "stan::prob::double_exponential_cdf(%1%)";
+
154 
+
155  // Size checks
+
156  if ( !( stan::length(y) && stan::length(mu)
+
157  && stan::length(sigma) ) )
+
158  return 1.0;
+
159 
+
160  using stan::math::value_of;
+ + + +
164  using boost::math::tools::promote_args;
+
165 
+
166  double cdf(1.0);
+
167  if(!check_not_nan(function, y, "Random variable", &cdf))
+
168  return cdf;
+
169  if(!check_finite(function, mu, "Location parameter", &cdf))
+
170  return cdf;
+
171  if(!check_finite(function, sigma, "Scale parameter", &cdf))
+
172  return cdf;
+
173  if(!check_positive(function, sigma, "Scale parameter", &cdf))
+
174  return cdf;
+
175 
+ +
177  operands_and_partials(y, mu, sigma);
+
178 
+
179  VectorView<const T_y> y_vec(y);
+
180  VectorView<const T_loc> mu_vec(mu);
+
181  VectorView<const T_scale> sigma_vec(sigma);
+
182  size_t N = max_size(y, mu, sigma);
+
183 
+
184  //cdf
+
185  for (size_t n = 0; n < N; n++) {
+
186  const double y_dbl = value_of(y_vec[n]);
+
187  const double mu_dbl = value_of(mu_vec[n]);
+
188  const double sigma_dbl = value_of(sigma_vec[n]);
+
189  const double scaled_diff = (y_dbl - mu_dbl) / (sigma_dbl);
+
190  const double exp_scaled_diff = exp(scaled_diff);
+
191 
+
192  if(y_dbl < mu_dbl) {
+
193  cdf *= exp_scaled_diff * 0.5;
+
194  }
+
195  else
+
196  cdf *= 1.0 - 0.5 / exp_scaled_diff;
+
197  }
+
198 
+
199  //gradients
+
200  for (size_t n = 0; n < N; n++) {
+
201  const double y_dbl = value_of(y_vec[n]);
+
202  const double mu_dbl = value_of(mu_vec[n]);
+
203  const double sigma_dbl = value_of(sigma_vec[n]);
+
204  const double scaled_diff = (y_dbl - mu_dbl) / sigma_dbl;
+
205  const double exp_scaled_diff = exp(scaled_diff);
+
206  const double inv_sigma = 1.0 / sigma_dbl;
+
207 
+
208  if(y_dbl < mu_dbl) {
+ +
210  operands_and_partials.d_x1[n] += inv_sigma * cdf;
+ +
212  operands_and_partials.d_x2[n] -= inv_sigma * cdf;
+ +
214  operands_and_partials.d_x3[n] -= scaled_diff * inv_sigma * cdf;
+
215  }
+
216  else {
+
217  const double rep_deriv = cdf * inv_sigma / (2.0 * exp_scaled_diff
+
218  - 1.0);
+ +
220  operands_and_partials.d_x1[n] += rep_deriv;
+ +
222  operands_and_partials.d_x2[n] -= rep_deriv;
+ +
224  operands_and_partials.d_x3[n] -= rep_deriv * scaled_diff;
+
225  }
+
226  }
+
227  return operands_and_partials.to_var(cdf);
+
228  }
+
229 
+
230  template <typename T_y, typename T_loc, typename T_scale>
+ +
232  double_exponential_cdf_log(const T_y& y, const T_loc& mu,
+
233  const T_scale& sigma) {
+
234  static const char* function
+
235  = "stan::prob::double_exponential_cdf_log(%1%)";
+
236 
+ + + + +
241  using stan::math::value_of;
+
242 
+
243  double cdf_log(0.0);
+
244 
+
245  // check if any vectors are zero length
+
246  if (!(stan::length(y)
+
247  && stan::length(mu)
+
248  && stan::length(sigma)))
+
249  return cdf_log;
+
250 
+
251  if(!check_not_nan(function, y, "Random variable", &cdf_log))
+
252  return cdf_log;
+
253  if(!check_finite(function, mu, "Location parameter", &cdf_log))
+
254  return cdf_log;
+
255  if(!check_finite(function, sigma, "Scale parameter", &cdf_log))
+
256  return cdf_log;
+
257  if(!check_positive(function, sigma, "Scale parameter", &cdf_log))
+
258  return cdf_log;
+
259  if (!(check_consistent_sizes(function, y, mu, sigma,
+
260  "Random variable", "Location parameter",
+
261  "Scale Parameter", &cdf_log)))
+
262  return cdf_log;
+
263 
+
264  using std::log;
+
265  using std::exp;
+
266 
+ +
268  operands_and_partials(y, mu, sigma);
+
269 
+
270  VectorView<const T_y> y_vec(y);
+
271  VectorView<const T_loc> mu_vec(mu);
+
272  VectorView<const T_scale> sigma_vec(sigma);
+
273  const double log_half = std::log(0.5);
+
274  size_t N = max_size(y, mu, sigma);
+
275 
+
276  for (size_t n = 0; n < N; n++) {
+
277  const double y_dbl = value_of(y_vec[n]);
+
278  const double mu_dbl = value_of(mu_vec[n]);
+
279  const double sigma_dbl = value_of(sigma_vec[n]);
+
280  const double scaled_diff = (y_dbl - mu_dbl) / sigma_dbl;
+
281  const double inv_sigma = 1.0 / sigma_dbl;
+
282  if(y_dbl < mu_dbl) {
+
283  // log cdf
+
284  cdf_log += log_half + scaled_diff;
+
285 
+
286  // gradients
+ +
288  operands_and_partials.d_x1[n] += inv_sigma;
+ +
290  operands_and_partials.d_x2[n] -= inv_sigma;
+ +
292  operands_and_partials.d_x3[n] -= scaled_diff * inv_sigma;
+
293  }
+
294  else {
+
295  //log cdf
+
296  cdf_log += log(1.0 - 0.5 * exp(-scaled_diff));
+
297 
+
298  //gradients
+
299  const double rep_deriv = 1.0 / (2.0 * exp(scaled_diff) - 1.0);
+ +
301  operands_and_partials.d_x1[n] += rep_deriv * inv_sigma;
+ +
303  operands_and_partials.d_x2[n] -= rep_deriv * inv_sigma;
+ +
305  operands_and_partials.d_x3[n] -= rep_deriv * scaled_diff
+
306  * inv_sigma;
+
307  }
+
308  }
+
309  return operands_and_partials.to_var(cdf_log);
+
310  }
+
311 
+
312  template <typename T_y, typename T_loc, typename T_scale>
+ +
314  double_exponential_ccdf_log(const T_y& y, const T_loc& mu,
+
315  const T_scale& sigma) {
+
316  static const char* function
+
317  = "stan::prob::double_exponential_ccdf_log(%1%)";
+
318 
+ + + + +
323  using stan::math::value_of;
+
324 
+
325  double ccdf_log(0.0);
+
326 
+
327  // check if any vectors are zero length
+
328  if (!(stan::length(y)
+
329  && stan::length(mu)
+
330  && stan::length(sigma)))
+
331  return ccdf_log;
+
332 
+
333  if(!check_not_nan(function, y, "Random variable", &ccdf_log))
+
334  return ccdf_log;
+
335  if(!check_finite(function, mu, "Location parameter", &ccdf_log))
+
336  return ccdf_log;
+
337  if(!check_finite(function, sigma, "Scale parameter", &ccdf_log))
+
338  return ccdf_log;
+
339  if(!check_positive(function, sigma, "Scale parameter", &ccdf_log))
+
340  return ccdf_log;
+
341  if (!(check_consistent_sizes(function, y, mu, sigma,
+
342  "Random variable", "Location parameter",
+
343  "Scale Parameter", &ccdf_log)))
+
344  return ccdf_log;
+
345 
+
346  using std::log;
+
347  using std::exp;
+
348 
+ +
350  operands_and_partials(y, mu, sigma);
+
351 
+
352  VectorView<const T_y> y_vec(y);
+
353  VectorView<const T_loc> mu_vec(mu);
+
354  VectorView<const T_scale> sigma_vec(sigma);
+
355  const double log_half = std::log(0.5);
+
356  size_t N = max_size(y, mu, sigma);
+
357 
+
358  for (size_t n = 0; n < N; n++) {
+
359  const double y_dbl = value_of(y_vec[n]);
+
360  const double mu_dbl = value_of(mu_vec[n]);
+
361  const double sigma_dbl = value_of(sigma_vec[n]);
+
362  const double scaled_diff = (y_dbl - mu_dbl) / sigma_dbl;
+
363  const double inv_sigma = 1.0 / sigma_dbl;
+
364  if(y_dbl < mu_dbl) {
+
365  //log ccdf
+
366  ccdf_log += log(1.0 - 0.5 * exp(scaled_diff));
+
367 
+
368  //gradients
+
369  const double rep_deriv = 1.0 / (2.0 * exp(-scaled_diff) - 1.0);
+ +
371  operands_and_partials.d_x1[n] -= rep_deriv * inv_sigma;
+ +
373  operands_and_partials.d_x2[n] += rep_deriv * inv_sigma;
+ +
375  operands_and_partials.d_x3[n] += rep_deriv * scaled_diff
+
376  * inv_sigma;
+
377  }
+
378  else {
+
379  // log ccdf
+
380  ccdf_log += log_half - scaled_diff;
+
381 
+
382  // gradients
+ +
384  operands_and_partials.d_x1[n] -= inv_sigma;
+ +
386  operands_and_partials.d_x2[n] += inv_sigma;
+ +
388  operands_and_partials.d_x3[n] += scaled_diff * inv_sigma;
+
389  }
+
390  }
+
391  return operands_and_partials.to_var(ccdf_log);
+
392  }
+
393 
+
394  template <class RNG>
+
395  inline double
+
396  double_exponential_rng(const double mu,
+
397  const double sigma,
+
398  RNG& rng) {
+
399  using boost::variate_generator;
+
400  using boost::random::uniform_01;
+
401  using std::log;
+
402  using std::abs;
+
403 
+
404  static const char* function
+
405  = "stan::prob::double_exponential_rng(%1%)";
+
406 
+ + +
409 
+
410  if(!check_finite(function, mu, "Location parameter"))
+
411  return 0;
+
412  if(!check_finite(function, sigma, "Scale parameter"))
+
413  return 0;
+
414  if(!check_positive(function, sigma, "Scale parameter"))
+
415  return 0;
+
416 
+
417  variate_generator<RNG&, uniform_01<> >
+
418  rng_unit_01(rng, uniform_01<>());
+
419  double a = 0;
+
420  double laplaceRN = rng_unit_01();
+
421  if(0.5 - laplaceRN > 0)
+
422  a = 1.0;
+
423  else if(0.5 - laplaceRN < 0)
+
424  a = -1.0;
+
425  return mu - sigma * a * log(1 - 2 * abs(0.5 - laplaceRN));
+
426  }
+
427  }
+
428 }
+
429 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/doxygen.css b/doc/api/html/doxygen.css new file mode 100644 index 00000000000..2642e8f9ecb --- /dev/null +++ b/doc/api/html/doxygen.css @@ -0,0 +1,1172 @@ +/* The standard CSS for doxygen */ + +body, table, div, p, dl { + font: 400 14px/19px Roboto,sans-serif; +} + +/* @group Heading Levels */ + +h1.groupheader { + font-size: 150%; +} + +.title { + font-size: 150%; + font-weight: bold; + margin: 10px 2px; +} + +h2.groupheader { + border-bottom: 1px solid #879ECB; + color: #354C7B; + font-size: 150%; + font-weight: normal; + margin-top: 1.75em; + padding-top: 8px; + padding-bottom: 4px; + width: 100%; +} + +h3.groupheader { + font-size: 100%; +} + +h1, h2, h3, h4, h5, h6 { + -webkit-transition: text-shadow 0.5s linear; + -moz-transition: text-shadow 0.5s linear; + -ms-transition: text-shadow 0.5s linear; + -o-transition: text-shadow 0.5s linear; + transition: text-shadow 0.5s linear; + margin-right: 15px; +} + +h1.glow, h2.glow, h3.glow, h4.glow, h5.glow, h6.glow { + text-shadow: 0 0 15px cyan; +} + +dt { + font-weight: bold; +} + +div.multicol { + -moz-column-gap: 1em; + -webkit-column-gap: 1em; + -moz-column-count: 3; + -webkit-column-count: 3; +} + +p.startli, p.startdd, p.starttd { + margin-top: 2px; +} + +p.endli { + margin-bottom: 0px; +} + +p.enddd { + margin-bottom: 4px; +} + +p.endtd { + margin-bottom: 2px; +} + +/* @end */ + +caption { + font-weight: bold; +} + +span.legend { + font-size: 70%; + text-align: center; +} + +h3.version { + font-size: 90%; + text-align: center; +} + +div.qindex, div.navtab{ + background-color: #EBEFF6; + border: 1px solid #A3B4D7; + text-align: center; +} + +div.qindex, div.navpath { + width: 100%; + line-height: 140%; +} + +div.navtab { + margin-right: 15px; +} + +/* @group Link Styling */ + +a { + color: #3D578C; + font-weight: normal; + text-decoration: none; +} + +.contents a:visited { + color: #4665A2; +} + +a:hover { + text-decoration: underline; +} + +a.qindex { + font-weight: bold; +} + +a.qindexHL { + font-weight: bold; + background-color: #9CAFD4; + color: #ffffff; + border: 1px double #869DCA; +} + +.contents a.qindexHL:visited { + color: #ffffff; +} + +a.el { + font-weight: bold; +} + +a.elRef { +} + +a.code, a.code:visited { + color: #4665A2; +} + +a.codeRef, a.codeRef:visited { + color: #4665A2; +} + +/* @end */ + +dl.el { + margin-left: -1cm; +} + +pre.fragment { + border: 1px solid #C4CFE5; + background-color: #FBFCFD; + padding: 4px 6px; + margin: 4px 8px 4px 2px; + overflow: auto; + word-wrap: break-word; + font-size: 9pt; + line-height: 125%; + font-family: monospace, fixed; + font-size: 105%; +} + +div.fragment { + padding: 4px; + margin: 4px; + background-color: #FBFCFD; + border: 1px solid #C4CFE5; +} + +div.line { + font-family: monospace, fixed; + font-size: 13px; + min-height: 13px; + line-height: 1.0; + text-wrap: unrestricted; + white-space: -moz-pre-wrap; /* Moz */ + white-space: -pre-wrap; /* Opera 4-6 */ + white-space: -o-pre-wrap; /* Opera 7 */ + white-space: pre-wrap; /* CSS3 */ + word-wrap: break-word; /* IE 5.5+ */ + text-indent: -53px; + padding-left: 53px; + padding-bottom: 0px; + margin: 0px; + -webkit-transition-property: background-color, box-shadow; + -webkit-transition-duration: 0.5s; + -moz-transition-property: background-color, box-shadow; + -moz-transition-duration: 0.5s; + -ms-transition-property: background-color, box-shadow; + -ms-transition-duration: 0.5s; + -o-transition-property: background-color, box-shadow; + -o-transition-duration: 0.5s; + transition-property: background-color, box-shadow; + transition-duration: 0.5s; +} + +div.line.glow { + background-color: cyan; + box-shadow: 0 0 10px cyan; +} + + +span.lineno { + padding-right: 4px; + text-align: right; + border-right: 2px solid #0F0; + background-color: #E8E8E8; + white-space: pre; +} +span.lineno a { + background-color: #D8D8D8; +} + +span.lineno a:hover { + background-color: #C8C8C8; +} + +div.ah { + background-color: black; + font-weight: bold; + color: #ffffff; + margin-bottom: 3px; + margin-top: 3px; + padding: 0.2em; + border: solid thin #333; + border-radius: 0.5em; + -webkit-border-radius: .5em; + -moz-border-radius: .5em; + box-shadow: 2px 2px 3px #999; + -webkit-box-shadow: 2px 2px 3px #999; + -moz-box-shadow: rgba(0, 0, 0, 0.15) 2px 2px 2px; + background-image: -webkit-gradient(linear, left top, left bottom, from(#eee), to(#000),color-stop(0.3, #444)); + background-image: -moz-linear-gradient(center top, #eee 0%, #444 40%, #000); +} + +div.groupHeader { + margin-left: 16px; + margin-top: 12px; + font-weight: bold; +} + +div.groupText { + margin-left: 16px; + font-style: italic; +} + +body { + background-color: white; + color: black; + margin: 0; +} + +div.contents { + margin-top: 10px; + margin-left: 12px; + margin-right: 8px; +} + +td.indexkey { + background-color: #EBEFF6; + font-weight: bold; + border: 1px solid #C4CFE5; + margin: 2px 0px 2px 0; + padding: 2px 10px; + white-space: nowrap; + vertical-align: top; +} + +td.indexvalue { + background-color: #EBEFF6; + border: 1px solid #C4CFE5; + padding: 2px 10px; + margin: 2px 0px; +} + +tr.memlist { + background-color: #EEF1F7; +} + +p.formulaDsp { + text-align: center; +} + +img.formulaDsp { + +} + +img.formulaInl { + vertical-align: middle; +} + +div.center { + text-align: center; + margin-top: 0px; + margin-bottom: 0px; + padding: 0px; +} + +div.center img { + border: 0px; +} + +address.footer { + text-align: right; + padding-right: 12px; +} + +img.footer { + border: 0px; + vertical-align: middle; +} + +/* @group Code Colorization */ + +span.keyword { + color: #008000 +} + +span.keywordtype { + color: #604020 +} + +span.keywordflow { + color: #e08000 +} + +span.comment { + color: #800000 +} + +span.preprocessor { + color: #806020 +} + +span.stringliteral { + color: #002080 +} + +span.charliteral { + color: #008080 +} + +span.vhdldigit { + color: #ff00ff +} + +span.vhdlchar { + color: #000000 +} + +span.vhdlkeyword { + color: #700070 +} + +span.vhdllogic { + color: #ff0000 +} + +blockquote { + background-color: #F7F8FB; + border-left: 2px solid #9CAFD4; + margin: 0 24px 0 4px; + padding: 0 12px 0 16px; +} + +/* @end */ + +/* +.search { + color: #003399; + font-weight: bold; +} + +form.search { + margin-bottom: 0px; + margin-top: 0px; +} + +input.search { + font-size: 75%; + color: #000080; + font-weight: normal; + background-color: #e8eef2; +} +*/ + +td.tiny { + font-size: 75%; +} + +.dirtab { + padding: 4px; + border-collapse: collapse; + border: 1px solid #A3B4D7; +} + +th.dirtab { + background: #EBEFF6; + font-weight: bold; +} + +hr { + height: 0px; + border: none; + border-top: 1px solid #4A6AAA; +} + +hr.footer { + height: 1px; +} + +/* @group Member Descriptions */ + +table.memberdecls { + border-spacing: 0px; + padding: 0px; +} + +.memberdecls td, .fieldtable tr { + -webkit-transition-property: background-color, box-shadow; + -webkit-transition-duration: 0.5s; + -moz-transition-property: background-color, box-shadow; + -moz-transition-duration: 0.5s; + -ms-transition-property: background-color, box-shadow; + -ms-transition-duration: 0.5s; + -o-transition-property: background-color, box-shadow; + -o-transition-duration: 0.5s; + transition-property: background-color, box-shadow; + transition-duration: 0.5s; +} + +.memberdecls td.glow, .fieldtable tr.glow { + background-color: cyan; + box-shadow: 0 0 15px cyan; +} + +.mdescLeft, .mdescRight, +.memItemLeft, .memItemRight, +.memTemplItemLeft, .memTemplItemRight, .memTemplParams { + background-color: #F9FAFC; + border: none; + margin: 4px; + padding: 1px 0 0 8px; +} + +.mdescLeft, .mdescRight { + padding: 0px 8px 4px 8px; + color: #555; +} + +.memSeparator { + border-bottom: 1px solid #DEE4F0; + line-height: 1px; + margin: 0px; + padding: 0px; +} + +.memItemLeft, .memTemplItemLeft { + white-space: nowrap; +} + +.memItemRight { + width: 100%; +} + +.memTemplParams { + color: #4665A2; + white-space: nowrap; + font-size: 80%; +} + +/* @end */ + +/* @group Member Details */ + +/* Styles for detailed member documentation */ + +.memtemplate { + font-size: 80%; + color: #4665A2; + font-weight: normal; + margin-left: 9px; +} + +.memnav { + background-color: #EBEFF6; + border: 1px solid #A3B4D7; + text-align: center; + margin: 2px; + margin-right: 15px; + padding: 2px; +} + +.mempage { + width: 100%; +} + +.memitem { + padding: 0; + margin-bottom: 10px; + margin-right: 5px; + -webkit-transition: box-shadow 0.5s linear; + -moz-transition: box-shadow 0.5s linear; + -ms-transition: box-shadow 0.5s linear; + -o-transition: box-shadow 0.5s linear; + transition: box-shadow 0.5s linear; + display: table !important; + width: 100%; +} + +.memitem.glow { + box-shadow: 0 0 15px cyan; +} + +.memname { + font-weight: bold; + margin-left: 6px; +} + +.memname td { + vertical-align: bottom; +} + +.memproto, dl.reflist dt { + border-top: 1px solid #A8B8D9; + border-left: 1px solid #A8B8D9; + border-right: 1px solid #A8B8D9; + padding: 6px 0px 6px 0px; + color: #253555; + font-weight: bold; + text-shadow: 0px 1px 1px rgba(255, 255, 255, 0.9); + background-image:url('nav_f.png'); + background-repeat:repeat-x; + background-color: #E2E8F2; + /* opera specific markup */ + box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); + border-top-right-radius: 4px; + border-top-left-radius: 4px; + /* firefox specific markup */ + -moz-box-shadow: rgba(0, 0, 0, 0.15) 5px 5px 5px; + -moz-border-radius-topright: 4px; + -moz-border-radius-topleft: 4px; + /* webkit specific markup */ + -webkit-box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); + -webkit-border-top-right-radius: 4px; + -webkit-border-top-left-radius: 4px; + +} + +.memdoc, dl.reflist dd { + border-bottom: 1px solid #A8B8D9; + border-left: 1px solid #A8B8D9; + border-right: 1px solid #A8B8D9; + padding: 6px 10px 2px 10px; + background-color: #FBFCFD; + border-top-width: 0; + background-image:url('nav_g.png'); + background-repeat:repeat-x; + background-color: #FFFFFF; + /* opera specific markup */ + border-bottom-left-radius: 4px; + border-bottom-right-radius: 4px; + box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); + /* firefox specific markup */ + -moz-border-radius-bottomleft: 4px; + -moz-border-radius-bottomright: 4px; + -moz-box-shadow: rgba(0, 0, 0, 0.15) 5px 5px 5px; + /* webkit specific markup */ + -webkit-border-bottom-left-radius: 4px; + -webkit-border-bottom-right-radius: 4px; + -webkit-box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); +} + +dl.reflist dt { + padding: 5px; +} + +dl.reflist dd { + margin: 0px 0px 10px 0px; + padding: 5px; +} + +.paramkey { + text-align: right; +} + +.paramtype { + white-space: nowrap; +} + +.paramname { + color: #602020; + white-space: nowrap; +} +.paramname em { + font-style: normal; +} +.paramname code { + line-height: 14px; +} + +.params, .retval, .exception, .tparams { + margin-left: 0px; + padding-left: 0px; +} + +.params .paramname, .retval .paramname { + font-weight: bold; + vertical-align: top; +} + +.params .paramtype { + font-style: italic; + vertical-align: top; +} + +.params .paramdir { + font-family: "courier new",courier,monospace; + vertical-align: top; +} + +table.mlabels { + border-spacing: 0px; +} + +td.mlabels-left { + width: 100%; + padding: 0px; +} + +td.mlabels-right { + vertical-align: bottom; + padding: 0px; + white-space: nowrap; +} + +span.mlabels { + margin-left: 8px; +} + +span.mlabel { + background-color: #728DC1; + border-top:1px solid #5373B4; + border-left:1px solid #5373B4; + border-right:1px solid #C4CFE5; + border-bottom:1px solid #C4CFE5; + text-shadow: none; + color: white; + margin-right: 4px; + padding: 2px 3px; + border-radius: 3px; + font-size: 7pt; + white-space: nowrap; + vertical-align: middle; +} + + + +/* @end */ + +/* these are for tree view when not used as main index */ + +div.directory { + margin: 10px 0px; + border-top: 1px solid #A8B8D9; + border-bottom: 1px solid #A8B8D9; + width: 100%; +} + +.directory table { + border-collapse:collapse; +} + +.directory td { + margin: 0px; + padding: 0px; + vertical-align: top; +} + +.directory td.entry { + white-space: nowrap; + padding-right: 6px; +} + +.directory td.entry a { + outline:none; +} + +.directory td.entry a img { + border: none; +} + +.directory td.desc { + width: 100%; + padding-left: 6px; + padding-right: 6px; + padding-top: 3px; + border-left: 1px solid rgba(0,0,0,0.05); +} + +.directory tr.even { + padding-left: 6px; + background-color: #F7F8FB; +} + +.directory img { + vertical-align: -30%; +} + +.directory .levels { + white-space: nowrap; + width: 100%; + text-align: right; + font-size: 9pt; +} + +.directory .levels span { + cursor: pointer; + padding-left: 2px; + padding-right: 2px; + color: #3D578C; +} + +div.dynheader { + margin-top: 8px; + -webkit-touch-callout: none; + -webkit-user-select: none; + -khtml-user-select: none; + -moz-user-select: none; + -ms-user-select: none; + user-select: none; +} + +address { + font-style: normal; + color: #2A3D61; +} + +table.doxtable { + border-collapse:collapse; + margin-top: 4px; + margin-bottom: 4px; +} + +table.doxtable td, table.doxtable th { + border: 1px solid #2D4068; + padding: 3px 7px 2px; +} + +table.doxtable th { + background-color: #374F7F; + color: #FFFFFF; + font-size: 110%; + padding-bottom: 4px; + padding-top: 5px; +} + +table.fieldtable { + width: 100%; + margin-bottom: 10px; + border: 1px solid #A8B8D9; + border-spacing: 0px; + -moz-border-radius: 4px; + -webkit-border-radius: 4px; + border-radius: 4px; + -moz-box-shadow: rgba(0, 0, 0, 0.15) 2px 2px 2px; + -webkit-box-shadow: 2px 2px 2px rgba(0, 0, 0, 0.15); + box-shadow: 2px 2px 2px rgba(0, 0, 0, 0.15); +} + +.fieldtable td, .fieldtable th { + padding: 3px 7px 2px; +} + +.fieldtable td.fieldtype, .fieldtable td.fieldname { + white-space: nowrap; + border-right: 1px solid #A8B8D9; + border-bottom: 1px solid #A8B8D9; + vertical-align: top; +} + +.fieldtable td.fielddoc { + border-bottom: 1px solid #A8B8D9; + width: 100%; +} + +.fieldtable tr:last-child td { + border-bottom: none; +} + +.fieldtable th { + background-image:url('nav_f.png'); + background-repeat:repeat-x; + background-color: #E2E8F2; + font-size: 90%; + color: #253555; + padding-bottom: 4px; + padding-top: 5px; + text-align:left; + -moz-border-radius-topleft: 4px; + -moz-border-radius-topright: 4px; + -webkit-border-top-left-radius: 4px; + -webkit-border-top-right-radius: 4px; + border-top-left-radius: 4px; + border-top-right-radius: 4px; + border-bottom: 1px solid #A8B8D9; +} + + +.tabsearch { + top: 0px; + left: 10px; + height: 36px; + background-image: url('tab_b.png'); + z-index: 101; + overflow: hidden; + font-size: 13px; +} + +.navpath ul +{ + font-size: 11px; + background-image:url('tab_b.png'); + background-repeat:repeat-x; + background-position: 0 -5px; + height:30px; + line-height:30px; + color:#8AA0CC; + border:solid 1px #C2CDE4; + overflow:hidden; + margin:0px; + padding:0px; +} + +.navpath li +{ + list-style-type:none; + float:left; + padding-left:10px; + padding-right:15px; + background-image:url('bc_s.png'); + background-repeat:no-repeat; + background-position:right; + color:#364D7C; +} + +.navpath li.navelem a +{ + height:32px; + display:block; + text-decoration: none; + outline: none; + color: #283A5D; + font-family: 'Lucida Grande',Geneva,Helvetica,Arial,sans-serif; + text-shadow: 0px 1px 1px rgba(255, 255, 255, 0.9); + text-decoration: none; +} + +.navpath li.navelem a:hover +{ + color:#6884BD; +} + +.navpath li.footer +{ + list-style-type:none; + float:right; + padding-left:10px; + padding-right:15px; + background-image:none; + background-repeat:no-repeat; + background-position:right; + color:#364D7C; + font-size: 8pt; +} + + +div.summary +{ + float: right; + font-size: 8pt; + padding-right: 5px; + width: 50%; + text-align: right; +} + +div.summary a +{ + white-space: nowrap; +} + +div.ingroups +{ + font-size: 8pt; + width: 50%; + text-align: left; +} + +div.ingroups a +{ + white-space: nowrap; +} + +div.header +{ + background-image:url('nav_h.png'); + background-repeat:repeat-x; + background-color: #F9FAFC; + margin: 0px; + border-bottom: 1px solid #C4CFE5; +} + +div.headertitle +{ + padding: 5px 5px 5px 10px; +} + +dl +{ + padding: 0 0 0 10px; +} + +/* dl.note, dl.warning, dl.attention, dl.pre, dl.post, dl.invariant, dl.deprecated, dl.todo, dl.test, dl.bug */ +dl.section +{ + margin-left: 0px; + padding-left: 0px; +} + +dl.note +{ + margin-left:-7px; + padding-left: 3px; + border-left:4px solid; + border-color: #D0C000; +} + +dl.warning, dl.attention +{ + margin-left:-7px; + padding-left: 3px; + border-left:4px solid; + border-color: #FF0000; +} + +dl.pre, dl.post, dl.invariant +{ + margin-left:-7px; + padding-left: 3px; + border-left:4px solid; + border-color: #00D000; +} + +dl.deprecated +{ + margin-left:-7px; + padding-left: 3px; + border-left:4px solid; + border-color: #505050; +} + +dl.todo +{ + margin-left:-7px; + padding-left: 3px; + border-left:4px solid; + border-color: #00C0E0; +} + +dl.test +{ + margin-left:-7px; + padding-left: 3px; + border-left:4px solid; + border-color: #3030E0; +} + +dl.bug +{ + margin-left:-7px; + padding-left: 3px; + border-left:4px solid; + border-color: #C08050; +} + +dl.section dd { + margin-bottom: 6px; +} + + +#projectlogo +{ + text-align: center; + vertical-align: bottom; + border-collapse: separate; +} + +#projectlogo img +{ + border: 0px none; +} + +#projectname +{ + font: 300% Tahoma, Arial,sans-serif; + margin: 0px; + padding: 2px 0px; +} + +#projectbrief +{ + font: 120% Tahoma, Arial,sans-serif; + margin: 0px; + padding: 0px; +} + +#projectnumber +{ + font: 50% Tahoma, Arial,sans-serif; + margin: 0px; + padding: 0px; +} + +#titlearea +{ + padding: 0px; + margin: 0px; + width: 100%; + border-bottom: 1px solid #5373B4; +} + +.image +{ + text-align: center; +} + +.dotgraph +{ + text-align: center; +} + +.mscgraph +{ + text-align: center; +} + +.caption +{ + font-weight: bold; +} + +div.zoom +{ + border: 1px solid #90A5CE; +} + +dl.citelist { + margin-bottom:50px; +} + +dl.citelist dt { + color:#334975; + float:left; + font-weight:bold; + margin-right:10px; + padding:5px; +} + +dl.citelist dd { + margin:2px 0; + padding:5px 0; +} + +div.toc { + padding: 14px 25px; + background-color: #F4F6FA; + border: 1px solid #D8DFEE; + border-radius: 7px 7px 7px 7px; + float: right; + height: auto; + margin: 0 20px 10px 10px; + width: 200px; +} + +div.toc li { + background: url("bdwn.png") no-repeat scroll 0 5px transparent; + font: 10px/1.2 Verdana,DejaVu Sans,Geneva,sans-serif; + margin-top: 5px; + padding-left: 10px; + padding-top: 2px; +} + +div.toc h3 { + font: bold 12px/1.2 Arial,FreeSans,sans-serif; + color: #4665A2; + border-bottom: 0 none; + margin: 0; +} + +div.toc ul { + list-style: none outside none; + border: medium none; + padding: 0px; +} + +div.toc li.level1 { + margin-left: 0px; +} + +div.toc li.level2 { + margin-left: 15px; +} + +div.toc li.level3 { + margin-left: 30px; +} + +div.toc li.level4 { + margin-left: 45px; +} + +.inherit_header { + font-weight: bold; + color: gray; + cursor: pointer; + -webkit-touch-callout: none; + -webkit-user-select: none; + -khtml-user-select: none; + -moz-user-select: none; + -ms-user-select: none; + user-select: none; +} + +.inherit_header td { + padding: 6px 0px 2px 5px; +} + +.inherit { + display: none; +} + +tr.heading h2 { + margin-top: 12px; + margin-bottom: 4px; +} + +@media print +{ + #top { display: none; } + #side-nav { display: none; } + #nav-path { display: none; } + body { overflow:visible; } + h1, h2, h3, h4, h5, h6 { page-break-after: avoid; } + .summary { display: none; } + .memitem { page-break-inside: avoid; } + #doc-content + { + margin-left:0 !important; + height:auto !important; + width:auto !important; + overflow:inherit; + display:inline; + } +} + diff --git a/doc/api/html/doxygen.png b/doc/api/html/doxygen.png new file mode 100644 index 0000000000000000000000000000000000000000..3ff17d807fd8aa003bed8bb2a69e8f0909592fd1 GIT binary patch literal 3779 zcmV;!4m|ORP)tMIv#Q0*~7*`IBSO7_x;@a8#Zk6_PeKR_s92J&)(m+);m9Iz3blw)z#Gi zP!9lj4$%+*>Hz@HCmM9L9|8c+0u=!H$O3?R0Kgx|#WP<6fKfC8fM-CQZT|_r@`>VO zX^Hgb|9cJqpdJA5$MCEK`F_2@2Y@s>^+;pF`~jdI0Pvr|vl4`=C)EH@1IFe7pdJ8F zH(qGi004~QnF)Ggga~8v08kGAs2hKTATxr7pwfNk|4#_AaT>w8P6TV+R2kbS$v==} zAjf`s0g#V8lB+b3)5oEI*q+{Yt$MZDruD2^;$+(_%Qn+%v0X-bJO=;@kiJ^ygLBnC z?1OVv_%aex1M@jKU|Z~$eI?PoF4Vj>fDzyo zAiLfpXY*a^Sj-S5D0S3@#V$sRW)g)_1e#$%8xdM>Jm7?!h zu0P2X=xoN>^!4DoPRgph2(2va07yfpXF+WH7EOg1GY%Zn z7~1A<(z7Q$ktEXhW_?GMpHp9l_UL18F3KOsxu81pqoBiNbFSGsof-W z6~eloMoz=4?OOnl2J268x5rOY`dCk0us(uS#Ud4yqOr@?=Q57a}tit|BhY>}~frH1sP`ScHS_d)oqH^lYy zZ%VP`#10MlE~P?cE(%(#(AUSv_T{+;t@$U}El}(1ig`vZo`Rm;+5&(AYzJ^Ae=h2X z@Re%vHwZU>|f0NI&%$*4eJweC5OROQrpPMA@*w|o z()A==l}(@bv^&>H1Ob3C=<^|hob?0+xJ?QQ3-ueQC}zy&JQNib!OqSO@-=>XzxlSF zAZ^U*1l6EEmg3r};_HY>&Jo_{dOPEFTWPmt=U&F#+0(O59^UIlHbNX+eF8UzyDR*T z(=5X$VF3!gm@RooS-&iiUYGG^`hMR(07zr_xP`d!^BH?uD>Phl8Rdifx3Af^Zr`Ku ztL+~HkVeL#bJ)7;`=>;{KNRvjmc}1}c58Sr#Treq=4{xo!ATy|c>iRSp4`dzMMVd@ zL8?uwXDY}Wqgh4mH`|$BTXpUIu6A1-cSq%hJw;@^Zr8TP=GMh*p(m(tN7@!^D~sl$ zz^tf4II4|};+irE$Fnm4NTc5%p{PRA`%}Zk`CE5?#h3|xcyQsS#iONZ z6H(@^i9td!$z~bZiJLTax$o>r(p}3o@< zyD7%(>ZYvy=6$U3e!F{Z`uSaYy`xQyl?b{}eg|G3&fz*`QH@mDUn)1%#5u`0m$%D} z?;tZ0u(mWeMV0QtzjgN!lT*pNRj;6510Wwx?Yi_=tYw|J#7@(Xe7ifDzXuK;JB;QO z#bg~K$cgm$@{QiL_3yr}y&~wuv=P=#O&Tj=Sr)aCUlYmZMcw?)T?c%0rUe1cS+o!qs_ zQ6Gp)-{)V!;=q}llyK3|^WeLKyjf%y;xHku;9(vM!j|~<7w1c*Mk-;P{T&yG) z@C-8E?QPynNQ<8f01D`2qexcVEIOU?y}MG)TAE6&VT5`rK8s(4PE;uQ92LTXUQ<>^ ztyQ@=@kRdh@ebUG^Z6NWWIL;_IGJ2ST>$t!$m$qvtj0Qmw8moN6GUV^!QKNK zHBXCtUH8)RY9++gH_TUV4^=-j$t}dD3qsN7GclJ^Zc&(j6&a_!$jCf}%c5ey`pm~1)@{yI3 zTdWyB+*X{JFw#z;PwRr5evb2!ueWF;v`B0HoUu4-(~aL=z;OXUUEtG`_$)Oxw6FKg zEzY`CyKaSBK3xt#8gA|r_|Kehn_HYVBMpEwbn9-fI*!u*eTA1ef8Mkl1=!jV4oYwWYM}i`A>_F4nhmlCIC6WLa zY%;4&@AlnaG11ejl61Jev21|r*m+?Kru3;1tFDl}#!OzUp6c>go4{C|^erwpG*&h6bspUPJag}oOkN2912Y3I?(eRc@U9>z#HPBHC?nps7H5!zP``90!Q1n80jo+B3TWXp!8Pe zwuKuLLI6l3Gv@+QH*Y}2wPLPQ1^EZhT#+Ed8q8Wo z1pTmIBxv14-{l&QVKxAyQF#8Q@NeJwWdKk>?cpiJLkJr+aZ!Me+Cfp!?FWSRf^j2k z73BRR{WSKaMkJ>1Nbx5dan5hg^_}O{Tj6u%iV%#QGz0Q@j{R^Ik)Z*+(YvY2ziBG)?AmJa|JV%4UT$k`hcOg5r9R?5>?o~JzK zJCrj&{i#hG>N7!B4kNX(%igb%kDj0fOQThC-8mtfap82PNRXr1D>lbgg)dYTQ(kbx z`Ee5kXG~Bh+BHQBf|kJEy6(ga%WfhvdQNDuOfQoe377l#ht&DrMGeIsI5C<&ai zWG$|hop2@@q5YDa)_-A?B02W;#fH!%k`daQLEItaJJ8Yf1L%8x;kg?)k)00P-lH+w z)5$QNV6r2$YtnV(4o=0^3{kmaXn*Dm0F*fU(@o)yVVjk|ln8ea6BMy%vZAhW9|wvA z8RoDkVoMEz1d>|5(k0Nw>22ZT){V<3$^C-cN+|~hKt2)){+l-?3m@-$c?-dlzQ)q- zZ)j%n^gerV{|+t}9m1_&&Ly!9$rtG4XX|WQ8`xYzGC~U@nYh~g(z9)bdAl#xH)xd5a=@|qql z|FzEil{P5(@gy!4ek05i$>`E^G~{;pnf6ftpLh$h#W?^#4UkPfa;;?bsIe&kz!+40 zI|6`F2n020)-r`pFaZ38F!S-lJM-o&inOw|66=GMeP@xQU5ghQH{~5Uh~TMTd;I9` z>YhVB`e^EVj*S7JF39ZgNf}A-0DwOcTT63ydN$I3b?yBQtUI*_fae~kPvzoD$zjX3 zoqBe#>12im4WzZ=f^4+u=!lA|#r%1`WB0-6*3BL#at`47#ebPpR|D1b)3BjT34nYY z%Ds%d?5$|{LgOIaRO{{oC&RK`O91$fqwM0(C_TALcozu*fWHb%%q&p-q{_8*2Zsi^ zh1ZCnr^UYa;4vQEtHk{~zi>wwMC5o{S=$P0X681y`SXwFH?Ewn{x-MOZynmc)JT5v zuHLwh;tLfxRrr%|k370}GofLl7thg>ACWWY&msqaVu&ry+`7+Ss>NL^%T1|z{IGMA zW-SKl=V-^{(f!Kf^#3(|T2W47d(%JVCI4JgRrT1pNz>+ietmFToNv^`gzC@&O-)+i zPQ~RwK8%C_vf%;%e>NyTp~dM5;!C|N0Q^6|CEb7Bw=Vz~$1#FA;Z*?mKSC)Hl-20s t8QyHj(g6VK0RYbl8UjE)0O0w=e*@m04r>stuEhWV002ovPDHLkV1hl;dM*F} literal 0 HcmV?d00001 diff --git a/doc/api/html/dump_8hpp.html b/doc/api/html/dump_8hpp.html new file mode 100644 index 00000000000..b4a8239e3cb --- /dev/null +++ b/doc/api/html/dump_8hpp.html @@ -0,0 +1,144 @@ + + + + + +Stan: src/stan/io/dump.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
dump.hpp File Reference
+
+
+
#include <cctype>
+#include <iostream>
+#include <limits>
+#include <map>
+#include <sstream>
+#include <string>
+#include <vector>
+#include <boost/throw_exception.hpp>
+#include <stan/math/matrix.hpp>
+#include <stan/io/var_context.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + + + + +

+Classes

class  stan::io::dump_writer
 Writes data into the S-plus dump format. More...
 
class  stan::io::dump_reader
 Reads data from S-plus dump format. More...
 
class  stan::io::dump
 Represents named arrays with dimensions. More...
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::io
 Input/output utilities.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dump_8hpp_source.html b/doc/api/html/dump_8hpp_source.html new file mode 100644 index 00000000000..b139c3ff346 --- /dev/null +++ b/doc/api/html/dump_8hpp_source.html @@ -0,0 +1,832 @@ + + + + + +Stan: src/stan/io/dump.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
dump.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__IO__DUMP_HPP__
+
2 #define __STAN__IO__DUMP_HPP__
+
3 
+
4 #include <cctype>
+
5 #include <iostream>
+
6 #include <limits>
+
7 #include <map>
+
8 #include <sstream>
+
9 #include <string>
+
10 #include <vector>
+
11 #include <boost/throw_exception.hpp>
+
12 #include <stan/math/matrix.hpp>
+
13 #include <stan/io/var_context.hpp>
+
14 
+
15 namespace stan {
+
16 
+
17  namespace io {
+
18 
+
19  namespace {
+
20  size_t product(std::vector<size_t> dims) {
+
21  size_t y = 1U;
+
22  for (size_t i = 0; i < dims.size(); ++i)
+
23  y *= dims[i];
+
24  return y;
+
25  }
+
26  }
+
27 
+
36  class dump_writer {
+
37  private:
+
38  std::ostream& out_;
+
39 
+
40  // checks doesn't contain quote char
+
41  void write_name_equals(const std::string& name) {
+
42  for (size_t i = 0; i < name.size(); ++i)
+
43  if (name.at(i) == '"')
+
44  BOOST_THROW_EXCEPTION(
+
45  std::invalid_argument ("name can not contain quote char"));
+
46  out_ << '"' << name << '"' << " <- " << '\n';
+
47  }
+
48 
+
49 
+
50  // adds period at end of output if necessary for double
+
51  void write_val(const double& x) {
+
52  std::stringstream ss;
+
53  ss << x;
+
54  std::string s;
+
55  ss >> s;
+
56  for (std::string::iterator it = s.begin();
+
57  it < s.end();
+
58  ++it) {
+
59  if (*it == '.' || *it == 'e' || *it == 'E') {
+
60  out_ << s;
+
61  return;
+
62  }
+
63  }
+
64  out_ << s << ".";
+
65  }
+
66 
+
67  void write_val(const unsigned long long int& n) {
+
68  out_ << n;
+
69  }
+
70 
+
71  void write_val(const unsigned long int& n) {
+
72  out_ << n;
+
73  }
+
74 
+
75  void write_val(const unsigned int& n) {
+
76  out_ << n;
+
77  }
+
78 
+
79  void write_val(const unsigned short& n) {
+
80  out_ << n;
+
81  }
+
82 
+
83  void write_val(const long long& n) {
+
84  out_ << n;
+
85  }
+
86 
+
87  void write_val(const long& n) {
+
88  out_ << n;
+
89  }
+
90 
+
91  void write_val(const int& n) {
+
92  out_ << n;
+
93  }
+
94 
+
95  void write_val(const short& n) {
+
96  out_ << n;
+
97  }
+
98 
+
99  void write_val(const char& n) {
+
100  out_ << n;
+
101  }
+
102 
+
103 
+
104  template <typename T>
+
105  void write_list(T xs) {
+
106  out_ << "c(";
+
107  for (typename T::size_type i = 0; i < xs.size(); ++i) {
+
108  if (i > 0) out_ << ", ";
+
109  write_val(xs[i]);
+
110  }
+
111  out_ << ")";
+
112  }
+
113 
+
114  template <typename T>
+
115  void write_structure(std::vector<T> xs,
+
116  std::vector<size_t> dims) {
+
117  out_ << "structure(";
+
118  write_list(xs);
+
119  out_ << ',' << '\n';
+
120  out_ << ".Dim = ";
+
121  write_list(dims);
+
122  out_ << ")";
+
123  }
+
124 
+
125 
+
126  void dims(double /*x*/, std::vector<size_t> /*ds*/) {
+
127  // no op
+
128  }
+
129 
+
130  void dims(int /*x*/, std::vector<size_t> /*ds*/) {
+
131  // no op
+
132  }
+
133 
+
134  template <typename T>
+
135  void dims(Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> m,
+
136  std::vector<size_t> ds) {
+
137  ds.push_back(m.rows());
+
138  ds.push_back(m.cols());
+
139  }
+
140 
+
141  template <typename T>
+
142  void dims(Eigen::Matrix<T,Eigen::Dynamic,1> v,
+
143  std::vector<size_t> ds) {
+
144  ds.push_back(v.size());
+
145  }
+
146 
+
147  template <typename T>
+
148  void dims(Eigen::Matrix<T,1,Eigen::Dynamic> rv,
+
149  std::vector<size_t> ds) {
+
150  ds.push_back(rv.size());
+
151  }
+
152 
+
153  template <typename T>
+
154  void dims(std::vector<T> x, std::vector<size_t> ds) {
+
155  ds.push_back(x.size());
+
156  if (x.size() > 0)
+
157  dims(x[0],ds);
+
158  }
+
159 
+
160  template <typename T>
+
161  std::vector<size_t> dims(T x) {
+
162  std::vector<size_t> ds;
+
163  dims(x,ds);
+
164  return ds;
+
165  }
+
166 
+
167  bool increment(const std::vector<size_t>& dims,
+
168  std::vector<size_t>& idx) {
+
169  for (size_t i = 0; i < dims.size(); ++i) {
+
170  ++idx[i];
+
171  if (idx[i] < dims[i]) return true;
+
172  idx[i] = 0;
+
173  }
+
174  return false;
+
175  }
+
176 
+
177  template <typename T>
+
178  void write_stan_val(const std::vector<T>& x,
+
179  const std::vector<size_t>& idx,
+
180  const size_t pos) {
+
181  size_t next_pos = pos + 1;
+
182  write_stan_val(x[idx[pos]],idx,next_pos);
+
183  }
+
184  void write_stan_val(const std::vector<double>& x,
+
185  const std::vector<size_t>& idx,
+
186  const size_t pos) {
+
187  write_val(x[idx[pos]]);
+
188  }
+
189  void write_stan_val(const std::vector<int>& x,
+
190  const std::vector<size_t>& idx,
+
191  const size_t pos) {
+
192  write_val(x[idx[pos]]);
+
193  }
+
194  void write_stan_val(const Eigen::Matrix<double,Eigen::Dynamic,Eigen::Dynamic>& x,
+
195  const std::vector<size_t>& idx,
+
196  const size_t pos) {
+
197  size_t next_pos = pos + 1;
+
198  write_val(x(idx[pos],idx[next_pos]));
+
199  }
+
200  void write_stan_val(const Eigen::Matrix<double,1,Eigen::Dynamic>& x,
+
201  const std::vector<size_t>& idx,
+
202  const size_t pos) {
+
203  write_val(x[idx[pos]]);
+
204  }
+
205  void write_stan_val(const Eigen::Matrix<double,Eigen::Dynamic,1>& x,
+
206  const std::vector<size_t>& idx,
+
207  const size_t pos) {
+
208  write_val(x[idx[pos]]);
+
209  }
+
210 
+
211 
+
212  template <typename T>
+
213  void write_stan(const std::vector<T>& x) {
+
214  std::vector<size_t> dims = dims(x);
+
215  out_ << "structure(c(";
+
216  std::vector<size_t> idx(dims.size(),0U);
+
217  for (size_t count = 0; true; ++count) {
+
218  if (count > 0) out_ << ", ";
+
219  write_stan_val(x,idx);
+
220  if (!increment(dims,idx)) break;
+
221  }
+
222  out_ << "), .Dim = ";
+
223  write_list(dims);
+
224  out_ << ")";
+
225  }
+
226  void write_stan(const std::vector<double>& x) {
+
227  write_list(x);
+
228  }
+
229  void write_stan(const std::vector<int>& x) {
+
230  write_list(x);
+
231  }
+
232  void write_stan(double x) {
+
233  write_val(x);
+
234  }
+
235  void write_stan(int x) {
+
236  write_val(x);
+
237  }
+
238  void write_stan(const Eigen::Matrix<double,1,Eigen::Dynamic>& x) {
+
239  write_list(x);
+
240  }
+
241  void write_stan(const Eigen::Matrix<double,Eigen::Dynamic,1>& x) {
+
242  write_list(x);
+
243  }
+
244  void write_stan(const Eigen::Matrix<double,
+
245  Eigen::Dynamic,Eigen::Dynamic>& x) {
+
246  typedef Eigen::Matrix<double,Eigen::Dynamic,Eigen::Dynamic>::Index Index;
+
247  out_ << "structure(c(";
+
248  std::vector<double> vals;
+
249  for (Index m = 0; m < x.cols(); ++m) {
+
250  for (Index n = 0; n < x.rows(); ++n) {
+
251  if (m > 0 || n > 0) out_ << ", ";
+
252  write_val(x(m,n));
+
253  }
+
254  }
+
255  out_ << "), .Dim = c(";
+
256  out_ << x.rows() << ", " << x.cols();
+
257  out_ << "))";
+
258  }
+
259 
+
260  public:
+
261 
+
265  dump_writer() : out_(std::cout) { }
+
266 
+
273  dump_writer(std::ostream& out) : out_(out) { }
+
274 
+ +
279 
+
298  template <typename T>
+
299  void write(const std::string& name,
+
300  const T& x) {
+
301  write_name_equals(name);
+
302  write_stan(x);
+
303  }
+
304 
+
314  template <typename T>
+
315  void dump_structure(std::string /*name*/,
+
316  std::vector<size_t> dims,
+
317  std::vector<T> xs) {
+
318  if (xs.size() != product(dims))
+
319  BOOST_THROW_EXCEPTION(
+
320  std::invalid_argument("xs.size() != product(dims)"));
+
321  write_structure(xs,dims);
+
322  }
+
323 
+
332  template <typename T>
+
333  void dump_list(std::string name,
+
334  std::vector<T> xs) {
+
335  write_name_equals(name);
+
336  write_list(xs);
+
337  }
+
338 
+
347  template <typename T>
+
348  void dump_var(std::string name,
+
349  T x) {
+
350  write_name_equals(name);
+
351  write_val(x);
+
352  }
+
353 
+
354  };
+
355 
+
427  class dump_reader {
+
428  private:
+
429  std::string name_;
+
430  std::vector<int> stack_i_;
+
431  std::vector<double> stack_r_;
+
432  std::vector<size_t> dims_;
+
433  std::istream& in_;
+
434  // stan::io::buffered_stream in_;
+
435 
+
436  bool scan_single_char(char c_expected) {
+
437  int c = in_.peek();
+
438  if (in_.fail()) return false;
+
439  if (c != c_expected)
+
440  return false;
+
441  char c_skip;
+
442  in_.get(c_skip);
+
443  return true;
+
444  }
+
445 
+
446  bool scan_optional_long() {
+
447  if (scan_single_char('l'))
+
448  return true;
+
449  else if (scan_single_char('L'))
+
450  return true;
+
451  else
+
452  return false;
+
453  }
+
454 
+
455  bool scan_char(char c_expected) {
+
456  char c;
+
457  in_ >> c;
+
458  if (in_.fail()) return false;
+
459  if (c != c_expected) {
+
460  in_.putback(c);
+
461  return false;
+
462  }
+
463  return true;
+
464  }
+
465 
+
466  bool scan_name_unquoted() {
+
467  char c;
+
468  in_ >> c; //
+
469  if (in_.fail()) return false;
+
470  if (!std::isalpha(c)) return false;
+
471  name_.push_back(c);
+
472  while (in_.get(c)) { // get turns off auto space skip
+
473  if (std::isalpha(c) || std::isdigit(c) || c == '_' || c == '.') {
+
474  name_.push_back(c);
+
475  } else {
+
476  in_.putback(c);
+
477  return true;
+
478  }
+
479  }
+
480  return true; // but hit eos
+
481  }
+
482 
+
483  bool scan_name() {
+
484  if (scan_char('"')) {
+
485  if (!scan_name_unquoted()) return false;
+
486  if (!scan_char('"')) return false;
+
487  } else if (scan_char('\'')) {
+
488  if (!scan_name_unquoted()) return false;
+
489  if (!scan_char('\'')) return false;
+
490  } else {
+
491  if (!scan_name_unquoted()) return false;
+
492  }
+
493  return true;
+
494  }
+
495 
+
496 
+
497  bool scan_chars(std::string s, bool case_sensitive = true) {
+
498  for (size_t i = 0; i < s.size(); ++i) {
+
499  char c;
+
500  if (!(in_ >> c)) {
+
501  for (size_t j = 1; j < i; ++j)
+
502  in_.putback(s[i-j]);
+
503  return false;
+
504  }
+
505  // all ASCII, so toupper is OK
+
506  if ((case_sensitive && c != s[i])
+
507  || (!case_sensitive && ::toupper(c) != ::toupper(s[i]))) {
+
508  in_.putback(c);
+
509  for (size_t j = 1; j < i; ++j)
+
510  in_.putback(s[i-j]);
+
511  return false;
+
512  }
+
513  }
+
514  return true;
+
515  }
+
516 
+
517  bool scan_number(bool negate_val) {
+
518 
+
519  // must take longest first!
+
520  if (scan_chars("Inf")) {
+
521  scan_chars("inity"); // read past if there
+
522  stack_r_.push_back(negate_val
+
523  ? -std::numeric_limits<double>::infinity()
+
524  : std::numeric_limits<double>::infinity());
+
525  return true;
+
526  }
+
527  if (scan_chars("NaN",false)) {
+
528  stack_r_.push_back(std::numeric_limits<double>::quiet_NaN());
+
529  return true;
+
530  }
+
531 
+
532  char c;
+
533  bool is_double = false;
+
534  std::string buf;
+
535  while (in_.get(c)) {
+
536  if (std::isdigit(c)) { // before pre-scan || c == '-' || c == '+') {
+
537  buf.push_back(c);
+
538  } else if (c == '.'
+
539  || c == 'e'
+
540  || c == 'E'
+
541  || c == '-'
+
542  || c == '+') {
+
543  is_double = true;
+
544  buf.push_back(c);
+
545  } else {
+
546  in_.putback(c);
+
547  break;
+
548  }
+
549  }
+
550  if (!is_double && stack_r_.size() == 0) {
+
551  int n;
+
552  if (!(std::stringstream(buf) >> n))
+
553  return false;
+
554  stack_i_.push_back(negate_val ? -n : n);
+
555  scan_optional_long();
+
556  } else {
+
557  for (size_t j = 0; j < stack_i_.size(); ++j)
+
558  stack_r_.push_back(static_cast<double>(stack_i_[j]));
+
559  // negate_val
+
560  // ? -static_cast<double>(stack_i_[j])
+
561  // : static_cast<double>(stack_i_[j]));
+
562  stack_i_.clear();
+
563  double x;
+
564  if (!(std::stringstream(buf) >> x))
+
565  return false;
+
566  stack_r_.push_back(negate_val ? -x : x);
+
567  }
+
568  return true;
+
569  }
+
570 
+
571  bool scan_number() {
+
572  char c;
+
573  while (in_.get(c)) {
+
574  if (std::isspace(c)) continue;
+
575  in_.putback(c);
+
576  break;
+
577  }
+
578  bool negate_val = scan_char('-');
+
579  if (!negate_val) scan_char('+'); // flush leading +
+
580  return scan_number(negate_val);
+
581  }
+
582 
+
583 
+
584  bool scan_seq_value() {
+
585  if (!scan_char('(')) return false;
+
586  if (scan_char(')')) {
+
587  dims_.push_back(0U);
+
588  return true;
+
589  }
+
590  if (!scan_number()) return false;; // first entry
+
591  while (scan_char(',')) {
+
592  if (!scan_number()) return false;
+
593  }
+
594  dims_.push_back(stack_r_.size() + stack_i_.size());
+
595  return scan_char(')');
+
596  }
+
597 
+
598  bool scan_struct_value() {
+
599  if (!scan_char('(')) return false;
+
600  if (scan_char('c')) {
+
601  scan_seq_value();
+
602  } else {
+
603  size_t start;
+
604  in_ >> start;
+
605  if (!scan_char(':'))
+
606  return false;
+
607  size_t end;
+
608  in_ >> end;
+
609  if (start <= end) {
+
610  for (size_t i = start; i <= end; ++i)
+
611  stack_i_.push_back(i);
+
612  } else {
+
613  for (size_t i = start; i >= end; --i)
+
614  stack_i_.push_back(i);
+
615  }
+
616  }
+
617  dims_.clear();
+
618  if (!scan_char(',')) return false;
+
619  if (!scan_char('.')) return false;
+
620  if (!scan_chars("Dim")) return false;
+
621  if (!scan_char('=')) return false;
+
622  if (scan_char('c')) {
+
623  if (!scan_char('(')) return false;
+
624  size_t dim;
+
625  in_ >> dim;
+
626  scan_optional_long();
+
627  dims_.push_back(dim);
+
628  while (scan_char(',')) {
+
629  in_ >> dim;
+
630  scan_optional_long();
+
631  dims_.push_back(dim);
+
632  }
+
633  if (!scan_char(')')) return false;
+
634  } else {
+
635  size_t start;
+
636  in_ >> start;
+
637  if (!scan_char(':'))
+
638  return false;
+
639  size_t end;
+
640  in_ >> end;
+
641  if (start < end) {
+
642  for (size_t i = start; i <= end; ++i)
+
643  dims_.push_back(i);
+
644  } else {
+
645  for (size_t i = start; i >= end; --i)
+
646  dims_.push_back(i);
+
647  }
+
648  }
+
649  if (!scan_char(')')) return false;
+
650  return true;
+
651  }
+
652 
+
653 
+
654 
+
655  bool scan_value() {
+
656  if (scan_char('c'))
+
657  return scan_seq_value();
+
658  if (scan_chars("structure"))
+
659  return scan_struct_value();
+
660  if (!scan_number())
+
661  return false;
+
662  if (!scan_char(':'))
+
663  return true;
+
664  if (stack_i_.size() != 1)
+
665  return false;
+
666  if (!scan_number())
+
667  return false;
+
668  if (stack_i_.size() != 2)
+
669  return false;
+
670  int start = stack_i_[0];
+
671  int end = stack_i_[1];
+
672  stack_i_.clear();
+
673  if (start <= end) {
+
674  for (int i = start; i <= end; ++i)
+
675  stack_i_.push_back(i);
+
676  } else {
+
677  for (int i = start; i >= end; --i)
+
678  stack_i_.push_back(i);
+
679  }
+
680  dims_.push_back(stack_i_.size());
+
681  return true;
+
682  }
+
683 
+
687  void print() {
+
688  std::cout << "var name=|" << name_ << "|" << std::endl;
+
689  std:: cout << "dims=(";
+
690  for (size_t i = 0; i < dims_.size(); ++i) {
+
691  if (i > 0)
+
692  std::cout << ",";
+
693  std::cout << dims_[i];
+
694  }
+
695  std::cout << ")" << std::endl;
+
696  std::cout << "float stack:" << std::endl;
+
697  for (size_t i = 0; i < stack_r_.size(); ++i)
+
698  std::cout << " [" << i << "] " << stack_r_[i] << std::endl;
+
699  std::cout << "int stack" << std::endl;
+
700  for (size_t i = 0; i < stack_i_.size(); ++i)
+
701  std::cout << " [" << i << "] " << stack_i_[i] << std::endl;
+
702  }
+
703 
+
704 
+
705  public:
+
709  dump_reader() : in_(std::cin) { }
+
710 
+
716  dump_reader(std::istream& in) : in_(in) { }
+
717 
+ +
722 
+
723 
+
729  std::string name() {
+
730  return name_;
+
731  }
+
732 
+
739  std::vector<size_t> dims() {
+
740  return dims_;
+
741  }
+
742 
+
750  bool is_int() {
+
751  return stack_i_.size() > 0;
+
752  }
+
753 
+
760  std::vector<int> int_values() {
+
761  return stack_i_;
+
762  }
+
763 
+
771  std::vector<double> double_values() {
+
772  return stack_r_;
+
773  }
+
774 
+
782  bool next() {
+
783  stack_r_.clear();
+
784  stack_i_.clear();
+
785  dims_.clear();
+
786  name_.erase();
+
787  if (!scan_name()) // set name
+
788  return false;
+
789  if (!scan_char('<')) // set <-
+
790  return false;
+
791  if (!scan_char('-'))
+
792  return false;
+
793  if (!scan_value()) // set stack_r_, stack_i_, dims_
+
794  return false;
+
795  return true;
+
796  }
+
797 
+
798  };
+
799 
+
800 
+
801 
+
817  class dump : public stan::io::var_context {
+
818  private:
+
819  std::map<std::string,
+
820  std::pair<std::vector<double>,
+
821  std::vector<size_t> > > vars_r_;
+
822  std::map<std::string,
+
823  std::pair<std::vector<int>,
+
824  std::vector<size_t> > > vars_i_;
+
825  std::vector<double> const empty_vec_r_;
+
826  std::vector<int> const empty_vec_i_;
+
827  std::vector<size_t> const empty_vec_ui_;
+
837  bool contains_r_only(const std::string& name) const {
+
838  return vars_r_.find(name) != vars_r_.end();
+
839  }
+
840  public:
+
841 
+
849  dump(std::istream& in) {
+
850  dump_reader reader(in);
+
851  while (reader.next()) {
+
852  if (reader.is_int()) {
+
853  vars_i_[reader.name()]
+
854  = std::pair<std::vector<int>,
+
855  std::vector<size_t> >(reader.int_values(),
+
856  reader.dims());
+
857 
+
858  } else {
+
859  vars_r_[reader.name()]
+
860  = std::pair<std::vector<double>,
+
861  std::vector<size_t> >(reader.double_values(),
+
862  reader.dims());
+
863  }
+
864  }
+
865  }
+
866 
+
875  bool contains_r(const std::string& name) const {
+
876  return contains_r_only(name) || contains_i(name);
+
877  }
+
878 
+
887  bool contains_i(const std::string& name) const {
+
888  return vars_i_.find(name) != vars_i_.end();
+
889  }
+
890 
+
898  std::vector<double> vals_r(const std::string& name) const {
+
899  if (contains_r_only(name)) {
+
900  return (vars_r_.find(name)->second).first;
+
901  } else if (contains_i(name)) {
+
902  std::vector<int> vec_int = (vars_i_.find(name)->second).first;
+
903  std::vector<double> vec_r(vec_int.size());
+
904  for (size_t ii = 0; ii < vec_int.size(); ii++) {
+
905  vec_r[ii] = vec_int[ii];
+
906  }
+
907  return vec_r;
+
908  }
+
909  return empty_vec_r_;
+
910  }
+
911 
+
919  std::vector<size_t> dims_r(const std::string& name) const {
+
920  if (contains_r_only(name)) {
+
921  return (vars_r_.find(name)->second).second;
+
922  } else if (contains_i(name)) {
+
923  return (vars_i_.find(name)->second).second;
+
924  }
+
925  return empty_vec_ui_;
+
926  }
+
927 
+
935  std::vector<int> vals_i(const std::string& name) const {
+
936  if (contains_i(name)) {
+
937  return (vars_i_.find(name)->second).first;
+
938  }
+
939  return empty_vec_i_;
+
940  }
+
941 
+
949  std::vector<size_t> dims_i(const std::string& name) const {
+
950  if (contains_i(name)) {
+
951  return (vars_i_.find(name)->second).second;
+
952  }
+
953  return empty_vec_ui_;
+
954  }
+
955 
+
962  virtual void names_r(std::vector<std::string>& names) const {
+
963  names.resize(0);
+
964  for (std::map<std::string,
+
965  std::pair<std::vector<double>,
+
966  std::vector<size_t> > >
+
967  ::const_iterator it = vars_r_.begin();
+
968  it != vars_r_.end(); ++it)
+
969  names.push_back((*it).first);
+
970  }
+
971 
+
978  virtual void names_i(std::vector<std::string>& names) const {
+
979  names.resize(0);
+
980  for (std::map<std::string,
+
981  std::pair<std::vector<int>,
+
982  std::vector<size_t> > >
+
983  ::const_iterator it = vars_i_.begin();
+
984  it != vars_i_.end(); ++it)
+
985  names.push_back((*it).first);
+
986  }
+
987 
+
995  bool remove(const std::string& name) {
+
996  return (vars_i_.erase(name) > 0)
+
997  || (vars_r_.erase(name) > 0);
+
998  }
+
999 
+
1000  };
+
1001 
+
1002  }
+
1003 
+
1004 }
+
1005 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dv__vari_8hpp.html b/doc/api/html/dv__vari_8hpp.html new file mode 100644 index 00000000000..bac8d08f491 --- /dev/null +++ b/doc/api/html/dv__vari_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/agrad/rev/internal/dv_vari.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
dv_vari.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::agrad::op_dv_vari
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dv__vari_8hpp_source.html b/doc/api/html/dv__vari_8hpp_source.html new file mode 100644 index 00000000000..f02910bd8e9 --- /dev/null +++ b/doc/api/html/dv__vari_8hpp_source.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/rev/internal/dv_vari.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
dv_vari.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__INTERNAL__DV_VARI_HPP__
+
2 #define __STAN__AGRAD__REV__INTERNAL__DV_VARI_HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7  namespace agrad {
+
8 
+
9  class op_dv_vari : public vari {
+
10  protected:
+
11  double ad_;
+ +
13  public:
+
14  op_dv_vari(double f, double a, vari* bvi) :
+
15  vari(f),
+
16  ad_(a),
+
17  bvi_(bvi) {
+
18  }
+
19  };
+
20 
+
21  }
+
22 }
+
23 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dvd__vari_8hpp.html b/doc/api/html/dvd__vari_8hpp.html new file mode 100644 index 00000000000..562bb4db0a5 --- /dev/null +++ b/doc/api/html/dvd__vari_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/agrad/rev/internal/dvd_vari.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
dvd_vari.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::agrad::op_dvd_vari
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dvd__vari_8hpp_source.html b/doc/api/html/dvd__vari_8hpp_source.html new file mode 100644 index 00000000000..e7ed44381b8 --- /dev/null +++ b/doc/api/html/dvd__vari_8hpp_source.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/rev/internal/dvd_vari.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
dvd_vari.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__INTERNAL__DVD_VARI_HPP__
+
2 #define __STAN__AGRAD__REV__INTERNAL__DVD_VARI_HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7  namespace agrad {
+
8 
+
9  class op_dvd_vari : public vari {
+
10  protected:
+
11  double ad_;
+ +
13  double cd_;
+
14  public:
+
15  op_dvd_vari(double f, double a, vari* bvi, double c) :
+
16  vari(f),
+
17  ad_(a),
+
18  bvi_(bvi),
+
19  cd_(c) {
+
20  }
+
21  };
+
22 
+
23  }
+
24 }
+
25 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dvv__vari_8hpp.html b/doc/api/html/dvv__vari_8hpp.html new file mode 100644 index 00000000000..5f8f8aa415a --- /dev/null +++ b/doc/api/html/dvv__vari_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/agrad/rev/internal/dvv_vari.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
dvv_vari.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::agrad::op_dvv_vari
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dvv__vari_8hpp_source.html b/doc/api/html/dvv__vari_8hpp_source.html new file mode 100644 index 00000000000..ee0712a1151 --- /dev/null +++ b/doc/api/html/dvv__vari_8hpp_source.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/rev/internal/dvv_vari.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
dvv_vari.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__INTERNAL__DVV_VARI_HPP__
+
2 #define __STAN__AGRAD__REV__INTERNAL__DVV_VARI_HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7  namespace agrad {
+
8 
+
9  class op_dvv_vari : public vari {
+
10  protected:
+
11  double ad_;
+ + +
14  public:
+
15  op_dvv_vari(double f, double a, vari* bvi, vari* cvi) :
+
16  vari(f),
+
17  ad_(a),
+
18  bvi_(bvi),
+
19  cvi_(cvi) {
+
20  }
+
21  };
+
22 
+
23  }
+
24 }
+
25 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/dynsections.js b/doc/api/html/dynsections.js new file mode 100644 index 00000000000..116542f181a --- /dev/null +++ b/doc/api/html/dynsections.js @@ -0,0 +1,78 @@ +function toggleVisibility(linkObj) +{ + var base = $(linkObj).attr('id'); + var summary = $('#'+base+'-summary'); + var content = $('#'+base+'-content'); + var trigger = $('#'+base+'-trigger'); + var src=$(trigger).attr('src'); + if (content.is(':visible')===true) { + content.hide(); + summary.show(); + $(linkObj).addClass('closed').removeClass('opened'); + $(trigger).attr('src',src.substring(0,src.length-8)+'closed.png'); + } else { + content.show(); + summary.hide(); + $(linkObj).removeClass('closed').addClass('opened'); + $(trigger).attr('src',src.substring(0,src.length-10)+'open.png'); + } + return false; +} + +function updateStripes() +{ + $('table.directory tr'). + removeClass('even').filter(':visible:even').addClass('even'); +} +function toggleLevel(level) +{ + $('table.directory tr').each(function(){ + var l = this.id.split('_').length-1; + var i = $('#img'+this.id.substring(3)); + var a = $('#arr'+this.id.substring(3)); + if (l + + + + +Stan: src/stan/math/matrix/eigenvalues_sym.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
eigenvalues_sym.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
stan::math::eigenvalues_sym (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &m)
 Return the eigenvalues of the specified symmetric matrix in descending order of magnitude.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/eigenvalues__sym_8hpp_source.html b/doc/api/html/eigenvalues__sym_8hpp_source.html new file mode 100644 index 00000000000..c9d08f3b091 --- /dev/null +++ b/doc/api/html/eigenvalues__sym_8hpp_source.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/matrix/eigenvalues_sym.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
eigenvalues_sym.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__EIGENVALUES_SYM_HPP__
+
2 #define __STAN__MATH__MATRIX__EIGENVALUES_SYM_HPP__
+
3 
+ + + +
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
20  template <typename T>
+
21  Eigen::Matrix<T,Eigen::Dynamic,1>
+
22  eigenvalues_sym(const Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& m) {
+
23  validate_nonzero_size(m,"eigenvalues_sym");
+
24  validate_symmetric(m,"eigenvalues_sym");
+
25  Eigen::SelfAdjointEigenSolver<Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> >
+
26  solver(m,Eigen::EigenvaluesOnly);
+
27  return solver.eigenvalues();
+
28  }
+
29 
+
30  }
+
31 }
+
32 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/eigenvectors__sym_8hpp.html b/doc/api/html/eigenvectors__sym_8hpp.html new file mode 100644 index 00000000000..5a258bfd8fa --- /dev/null +++ b/doc/api/html/eigenvectors__sym_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/math/matrix/eigenvectors_sym.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
eigenvectors_sym.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
stan::math::eigenvectors_sym (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &m)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/eigenvectors__sym_8hpp_source.html b/doc/api/html/eigenvectors__sym_8hpp_source.html new file mode 100644 index 00000000000..df41600dfa3 --- /dev/null +++ b/doc/api/html/eigenvectors__sym_8hpp_source.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/matrix/eigenvectors_sym.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
eigenvectors_sym.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__EIGENVECTORS_SYM_HPP__
+
2 #define __STAN__MATH__MATRIX__EIGENVECTORS_SYM_HPP__
+
3 
+ + + +
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
11  template <typename T>
+
12  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>
+
13  eigenvectors_sym(const Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& m) {
+
14  validate_nonzero_size(m,"eigenvectors_sym");
+
15  validate_symmetric(m,"eigenvectors_sym");
+
16  Eigen::SelfAdjointEigenSolver<Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> >
+
17  solver(m);
+
18  return solver.eigenvectors();
+
19  }
+
20 
+
21  }
+
22 }
+
23 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/elt__divide_8hpp.html b/doc/api/html/elt__divide_8hpp.html new file mode 100644 index 00000000000..e68b1b192a8 --- /dev/null +++ b/doc/api/html/elt__divide_8hpp.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/math/matrix/elt_divide.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
elt_divide.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/validate_matching_dims.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T1 , typename T2 , int R, int C>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R, C > 
stan::math::elt_divide (const Eigen::Matrix< T1, R, C > &m1, const Eigen::Matrix< T2, R, C > &m2)
 Return the elementwise division of the specified matrices matrices.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/elt__divide_8hpp_source.html b/doc/api/html/elt__divide_8hpp_source.html new file mode 100644 index 00000000000..167645f4530 --- /dev/null +++ b/doc/api/html/elt__divide_8hpp_source.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/math/matrix/elt_divide.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
elt_divide.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__ELT_DIVIDE_HPP__
+
2 #define __STAN__MATH__MATRIX__ELT_DIVIDE_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+ + +
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
23  template <typename T1, typename T2, int R, int C>
+
24  Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type, R, C>
+
25  elt_divide(const Eigen::Matrix<T1,R,C>& m1,
+
26  const Eigen::Matrix<T2,R,C>& m2) {
+
27  stan::math::validate_matching_dims(m1,m2,"elt_multiply");
+
28  Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type, R, C>
+
29  result(m1.rows(),m2.cols());
+
30  for (int i = 0; i < m1.size(); ++i)
+
31  result(i) = m1(i) / m2(i);
+
32  return result;
+
33  }
+
34 
+
35  }
+
36 }
+
37 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/elt__multiply_8hpp.html b/doc/api/html/elt__multiply_8hpp.html new file mode 100644 index 00000000000..56d2dc29a80 --- /dev/null +++ b/doc/api/html/elt__multiply_8hpp.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/math/matrix/elt_multiply.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
elt_multiply.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/validate_matching_dims.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T1 , typename T2 , int R, int C>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R, C > 
stan::math::elt_multiply (const Eigen::Matrix< T1, R, C > &m1, const Eigen::Matrix< T2, R, C > &m2)
 Return the elementwise multiplication of the specified matrices.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/elt__multiply_8hpp_source.html b/doc/api/html/elt__multiply_8hpp_source.html new file mode 100644 index 00000000000..3fa0cdbf138 --- /dev/null +++ b/doc/api/html/elt__multiply_8hpp_source.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/math/matrix/elt_multiply.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
elt_multiply.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__ELT_MULTIPLY_HPP__
+
2 #define __STAN__MATH__MATRIX__ELT_MULTIPLY_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+ + +
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
23  template <typename T1, typename T2, int R, int C>
+
24  Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type, R, C>
+
25  elt_multiply(const Eigen::Matrix<T1,R,C>& m1,
+
26  const Eigen::Matrix<T2,R,C>& m2) {
+
27  stan::math::validate_matching_dims(m1,m2,"elt_multiply");
+
28  Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type, R, C>
+
29  result(m1.rows(),m2.cols());
+
30  for (int i = 0; i < m1.size(); ++i)
+
31  result(i) = m1(i) * m2(i);
+
32  return result;
+
33  }
+
34 
+
35  }
+
36 }
+
37 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/error__codes_8hpp.html b/doc/api/html/error__codes_8hpp.html new file mode 100644 index 00000000000..62de3cf8d42 --- /dev/null +++ b/doc/api/html/error__codes_8hpp.html @@ -0,0 +1,127 @@ + + + + + +Stan: src/stan/gm/error_codes.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
error_codes.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

struct  stan::gm::error_codes
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/error__codes_8hpp_source.html b/doc/api/html/error__codes_8hpp_source.html new file mode 100644 index 00000000000..218537365ad --- /dev/null +++ b/doc/api/html/error__codes_8hpp_source.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/error_codes.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
error_codes.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ERROR_CODES_HPP__
+
2 #define __STAN__GM__ERROR_CODES_HPP__
+
3 
+
4 namespace stan {
+
5  namespace gm {
+
6 
+
7  struct error_codes {
+
8  // defining error codes to follow FreeBSD sysexits conventions
+
9  // http://www.gsp.com/cgi-bin/man.cgi?section=3&topic=sysexits
+
10  enum {
+
11  OK = 0,
+
12  USAGE = 64,
+
13  DATAERR = 65,
+
14  NOINPUT = 66,
+
15  SOFTWARE = 70,
+
16  CONFIG = 78
+
17  };
+
18  };
+
19  }
+
20 }
+
21 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/error__handling_8dox.html b/doc/api/html/error__handling_8dox.html new file mode 100644 index 00000000000..641e7b78ff7 --- /dev/null +++ b/doc/api/html/error__handling_8dox.html @@ -0,0 +1,103 @@ + + + + + +Stan: src/doxygen/error_handling.dox File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ +
+
+
+
src/doxygen/error_handling.dox File Reference
+
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/exp__mod__normal_8hpp.html b/doc/api/html/exp__mod__normal_8hpp.html new file mode 100644 index 00000000000..65fa6a57c53 --- /dev/null +++ b/doc/api/html/exp__mod__normal_8hpp.html @@ -0,0 +1,160 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/exp_mod_normal.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
exp_mod_normal.hpp File Reference
+
+
+
#include <boost/random/normal_distribution.hpp>
+#include <boost/math/special_functions/fpclassify.hpp>
+#include <boost/random/variate_generator.hpp>
+#include <stan/prob/distributions/univariate/continuous/normal.hpp>
+#include <stan/prob/distributions/univariate/continuous/exponential.hpp>
+#include <stan/agrad/partials_vari.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/math/constants.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/prob/constants.hpp>
+#include <stan/prob/traits.hpp>
+#include <stan/math/functions/value_of.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + + + + + + +

+Functions

template<bool propto, typename T_y , typename T_loc , typename T_scale , typename T_inv_scale >
return_type< T_y, T_loc,
+T_scale, T_inv_scale >::type 
stan::prob::exp_mod_normal_log (const T_y &y, const T_loc &mu, const T_scale &sigma, const T_inv_scale &lambda)
 
template<typename T_y , typename T_loc , typename T_scale , typename T_inv_scale >
return_type< T_y, T_loc,
+T_scale, T_inv_scale >::type 
stan::prob::exp_mod_normal_log (const T_y &y, const T_loc &mu, const T_scale &sigma, const T_inv_scale &lambda)
 
template<typename T_y , typename T_loc , typename T_scale , typename T_inv_scale >
return_type< T_y, T_loc,
+T_scale, T_inv_scale >::type 
stan::prob::exp_mod_normal_cdf (const T_y &y, const T_loc &mu, const T_scale &sigma, const T_inv_scale &lambda)
 
template<typename T_y , typename T_loc , typename T_scale , typename T_inv_scale >
return_type< T_y, T_loc,
+T_scale, T_inv_scale >::type 
stan::prob::exp_mod_normal_cdf_log (const T_y &y, const T_loc &mu, const T_scale &sigma, const T_inv_scale &lambda)
 
template<typename T_y , typename T_loc , typename T_scale , typename T_inv_scale >
return_type< T_y, T_loc,
+T_scale, T_inv_scale >::type 
stan::prob::exp_mod_normal_ccdf_log (const T_y &y, const T_loc &mu, const T_scale &sigma, const T_inv_scale &lambda)
 
template<class RNG >
double stan::prob::exp_mod_normal_rng (const double mu, const double sigma, const double lambda, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/exp__mod__normal_8hpp_source.html b/doc/api/html/exp__mod__normal_8hpp_source.html new file mode 100644 index 00000000000..fb14d3e8297 --- /dev/null +++ b/doc/api/html/exp__mod__normal_8hpp_source.html @@ -0,0 +1,635 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/exp_mod_normal.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
exp_mod_normal.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS__EXP__MOD__NORMAL__HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS__EXP__MOD__NORMAL__HPP__
+
3 
+
4 #include <boost/random/normal_distribution.hpp>
+
5 #include <boost/math/special_functions/fpclassify.hpp>
+
6 #include <boost/random/variate_generator.hpp>
+ + +
9 
+ + +
12 #include <stan/math/constants.hpp>
+
13 #include <stan/meta/traits.hpp>
+
14 #include <stan/prob/constants.hpp>
+
15 #include <stan/prob/traits.hpp>
+ +
17 
+
18 namespace stan {
+
19 
+
20  namespace prob {
+
21 
+
22  template <bool propto,
+
23  typename T_y, typename T_loc, typename T_scale,
+
24  typename T_inv_scale>
+
25  typename return_type<T_y,T_loc,T_scale, T_inv_scale>::type
+
26  exp_mod_normal_log(const T_y& y, const T_loc& mu, const T_scale& sigma,
+
27  const T_inv_scale& lambda) {
+
28  static const char* function = "stan::prob::exp_mod_normal_log(%1%)";
+
29 
+ + + + + + + +
37 
+
38  // check if any vectors are zero length
+
39  if (!(stan::length(y)
+
40  && stan::length(mu)
+
41  && stan::length(sigma)
+
42  && stan::length(lambda)))
+
43  return 0.0;
+
44 
+
45  // set up return value accumulator
+
46  double logp(0.0);
+
47 
+
48  // validate args (here done over var, which should be OK)
+
49  if (!check_not_nan(function, y, "Random variable", &logp))
+
50  return logp;
+
51  if (!check_finite(function, mu, "Location parameter",
+
52  &logp))
+
53  return logp;
+
54  if (!check_finite(function, lambda, "Inv_scale parameter",
+
55  &logp))
+
56  return logp;
+
57  if (!check_positive(function, lambda, "Inv_scale parameter",
+
58  &logp))
+
59  return logp;
+
60  if (!check_positive(function, sigma, "Scale parameter",
+
61  &logp))
+
62  return logp;
+
63  if (!(check_consistent_sizes(function,
+
64  y,mu,sigma,lambda,
+
65  "Random variable","Location parameter",
+
66  "Scale parameter", "Inv_scale paramter",
+
67  &logp)))
+
68  return logp;
+
69 
+
70  // check if no variables are involved and prop-to
+ +
72  return 0.0;
+
73 
+
74  // set up template expressions wrapping scalars into vector views
+ +
76  operands_and_partials(y, mu, sigma,lambda);
+
77 
+
78  VectorView<const T_y> y_vec(y);
+
79  VectorView<const T_loc> mu_vec(mu);
+
80  VectorView<const T_scale> sigma_vec(sigma);
+
81  VectorView<const T_inv_scale> lambda_vec(lambda);
+
82  size_t N = max_size(y, mu, sigma, lambda);
+
83 
+
84  for (size_t n = 0; n < N; n++) {
+
85  //pull out values of arguments
+
86  const double y_dbl = value_of(y_vec[n]);
+
87  const double mu_dbl = value_of(mu_vec[n]);
+
88  const double sigma_dbl = value_of(sigma_vec[n]);
+
89  const double lambda_dbl = value_of(lambda_vec[n]);
+
90 
+
91  const double pi_dbl = boost::math::constants::pi<double>();
+
92 
+
93  // log probability
+ +
95  logp -= log(2.0);
+ +
97  logp += log(lambda_dbl);
+ +
99  logp += lambda_dbl
+
100  * (mu_dbl + 0.5 * lambda_dbl * sigma_dbl * sigma_dbl - y_dbl)
+
101  + log(boost::math::erfc((mu_dbl + lambda_dbl * sigma_dbl
+
102  * sigma_dbl - y_dbl)
+
103  / (std::sqrt(2.0) * sigma_dbl)));
+
104 
+
105  // gradients
+
106  const double deriv_logerfc
+
107  = -2.0 / std::sqrt(pi_dbl)
+
108  * exp(-(mu_dbl + lambda_dbl * sigma_dbl * sigma_dbl - y_dbl)
+
109  / (std::sqrt(2.0) * sigma_dbl)
+
110  * (mu_dbl + lambda_dbl * sigma_dbl * sigma_dbl - y_dbl)
+
111  / (sigma_dbl * std::sqrt(2.0)))
+
112  / boost::math::erfc((mu_dbl + lambda_dbl * sigma_dbl * sigma_dbl
+
113  - y_dbl)
+
114  / (sigma_dbl * std::sqrt(2.0)));
+
115 
+ +
117  operands_and_partials.d_x1[n]
+
118  += -lambda_dbl
+
119  + deriv_logerfc * -1.0 / (sigma_dbl * std::sqrt(2.0));
+ +
121  operands_and_partials.d_x2[n]
+
122  += lambda_dbl
+
123  + deriv_logerfc / (sigma_dbl * std::sqrt(2.0));
+ +
125  operands_and_partials.d_x3[n]
+
126  += sigma_dbl * lambda_dbl * lambda_dbl
+
127  + deriv_logerfc
+
128  * (-mu_dbl / (sigma_dbl * sigma_dbl * std::sqrt(2.0))
+
129  + lambda_dbl / std::sqrt(2.0)
+
130  + y_dbl / (sigma_dbl * sigma_dbl * std::sqrt(2.0)));
+ +
132  operands_and_partials.d_x4[n]
+
133  += 1 / lambda_dbl + lambda_dbl * sigma_dbl * sigma_dbl
+
134  + mu_dbl - y_dbl + deriv_logerfc * sigma_dbl / std::sqrt(2.0);
+
135  }
+
136  return operands_and_partials.to_var(logp);
+
137  }
+
138 
+
139  template <typename T_y, typename T_loc, typename T_scale,
+
140  typename T_inv_scale>
+
141  inline
+ +
143  exp_mod_normal_log(const T_y& y, const T_loc& mu, const T_scale& sigma,
+
144  const T_inv_scale& lambda) {
+
145  return exp_mod_normal_log<false>(y,mu,sigma,lambda);
+
146  }
+
147 
+
148  template <typename T_y, typename T_loc, typename T_scale,
+
149  typename T_inv_scale>
+ +
151  exp_mod_normal_cdf(const T_y& y, const T_loc& mu, const T_scale& sigma,
+
152  const T_inv_scale& lambda) {
+
153  static const char* function = "stan::prob::exp_mod_normal_cdf(%1%)";
+
154 
+ + + + +
159  using stan::math::value_of;
+
160 
+
161  double cdf(1.0);
+
162  //check if any vectors are zero length
+
163  if (!(stan::length(y)
+
164  && stan::length(mu)
+
165  && stan::length(sigma)
+
166  && stan::length(lambda)))
+
167  return cdf;
+
168 
+
169  if (!check_not_nan(function, y, "Random variable", &cdf))
+
170  return cdf;
+
171  if (!check_finite(function, mu, "Location parameter", &cdf))
+
172  return cdf;
+
173  if (!check_not_nan(function, sigma, "Scale parameter", &cdf))
+
174  return cdf;
+
175  if (!check_finite(function, sigma, "Scale parameter", &cdf))
+
176  return cdf;
+
177  if (!check_positive(function, sigma, "Scale parameter", &cdf))
+
178  return cdf;
+
179  if (!check_finite(function, lambda, "Inv_scale parameter", &cdf))
+
180  return cdf;
+
181  if (!check_positive(function, lambda, "Inv_scale parameter", &cdf))
+
182  return cdf;
+
183  if (!check_not_nan(function, lambda, "Inv_scale parameter", &cdf))
+
184  return cdf;
+
185  if (!(check_consistent_sizes(function,
+
186  y,mu,sigma,lambda,
+
187  "Random variable","Location parameter",
+
188  "Scale parameter","Inv_scale paramter",
+
189  &cdf)))
+
190  return cdf;
+
191 
+ +
193  operands_and_partials(y, mu, sigma,lambda);
+
194 
+
195  using stan::math::SQRT_2;
+
196 
+
197  VectorView<const T_y> y_vec(y);
+
198  VectorView<const T_loc> mu_vec(mu);
+
199  VectorView<const T_scale> sigma_vec(sigma);
+
200  VectorView<const T_inv_scale> lambda_vec(lambda);
+
201  size_t N = max_size(y, mu, sigma, lambda);
+
202  const double sqrt_pi = std::sqrt(stan::math::pi());
+
203  for (size_t n = 0; n < N; n++) {
+
204 
+
205  if(boost::math::isinf(y_vec[n])) {
+
206  if (y_vec[n] < 0.0)
+
207  return operands_and_partials.to_var(0.0);
+
208  }
+
209 
+
210  const double y_dbl = value_of(y_vec[n]);
+
211  const double mu_dbl = value_of(mu_vec[n]);
+
212  const double sigma_dbl = value_of(sigma_vec[n]);
+
213  const double lambda_dbl = value_of(lambda_vec[n]);
+
214  const double u = lambda_dbl * (y_dbl - mu_dbl);
+
215  const double v = lambda_dbl * sigma_dbl ;
+
216  const double v_sq = v * v;
+
217  const double scaled_diff = (y_dbl - mu_dbl) / (SQRT_2 * sigma_dbl);
+
218  const double scaled_diff_sq = scaled_diff * scaled_diff;
+
219  const double erf_calc = 0.5 * (1 + erf(-v / SQRT_2 + scaled_diff));
+
220  const double deriv_1 = lambda_dbl * exp(0.5 * v_sq - u) * erf_calc;
+
221  const double deriv_2 = SQRT_2 / sqrt_pi * 0.5 * exp(0.5 * v_sq
+
222  - (scaled_diff
+
223  - (v / SQRT_2)) * (scaled_diff
+
224  - (v / SQRT_2)) - u) / sigma_dbl;
+
225  const double deriv_3 = SQRT_2 / sqrt_pi * 0.5 * exp(-scaled_diff_sq)
+
226  / sigma_dbl;
+
227 
+
228  const double cdf_ = 0.5 * (1 + erf(u / (v * SQRT_2)))
+
229  - exp(-u + v_sq * 0.5) * (erf_calc);
+
230 
+
231  cdf *= cdf_;
+
232 
+ +
234  operands_and_partials.d_x1[n] += (deriv_1 - deriv_2 + deriv_3)
+
235  / cdf_;
+ +
237  operands_and_partials.d_x2[n] += (-deriv_1 + deriv_2 - deriv_3)
+
238  / cdf_;
+ +
240  operands_and_partials.d_x3[n] += (-deriv_1 * v - deriv_3
+
241  * scaled_diff * SQRT_2 - deriv_2 * sigma_dbl * SQRT_2 * (-SQRT_2
+
242  * 0.5 * (-lambda_dbl + scaled_diff * SQRT_2 / sigma_dbl) - SQRT_2
+
243  * lambda_dbl)) / cdf_;
+ +
245  operands_and_partials.d_x4[n] += exp(0.5 * v_sq - u) * (SQRT_2
+
246  / sqrt_pi * 0.5 * sigma_dbl * exp(-(v / SQRT_2 - scaled_diff) * (v
+
247  / SQRT_2 - scaled_diff)) - (v * sigma_dbl + mu_dbl - y_dbl)
+
248  * erf_calc) / cdf_;
+
249  }
+
250 
+ +
252  for(size_t n = 0; n < stan::length(y); ++n)
+
253  operands_and_partials.d_x1[n] *= cdf;
+
254  }
+ +
256  for(size_t n = 0; n < stan::length(mu); ++n)
+
257  operands_and_partials.d_x2[n] *= cdf;
+
258  }
+ +
260  for(size_t n = 0; n < stan::length(sigma); ++n)
+
261  operands_and_partials.d_x3[n] *= cdf;
+
262  }
+ +
264  for(size_t n = 0; n < stan::length(lambda); ++n)
+
265  operands_and_partials.d_x4[n] *= cdf;
+
266  }
+
267 
+
268  return operands_and_partials.to_var(cdf);
+
269  }
+
270 
+
271  template <typename T_y, typename T_loc, typename T_scale,
+
272  typename T_inv_scale>
+ +
274  exp_mod_normal_cdf_log(const T_y& y, const T_loc& mu, const T_scale& sigma,
+
275  const T_inv_scale& lambda) {
+
276  static const char* function = "stan::prob::exp_mod_normal_cdf_log(%1%)";
+
277 
+ + + + +
282  using stan::math::value_of;
+
283 
+
284  double cdf_log(0.0);
+
285  //check if any vectors are zero length
+
286  if (!(stan::length(y)
+
287  && stan::length(mu)
+
288  && stan::length(sigma)
+
289  && stan::length(lambda)))
+
290  return cdf_log;
+
291 
+
292  if (!check_not_nan(function, y, "Random variable", &cdf_log))
+
293  return cdf_log;
+
294  if (!check_finite(function, mu, "Location parameter", &cdf_log))
+
295  return cdf_log;
+
296  if (!check_not_nan(function, sigma, "Scale parameter", &cdf_log))
+
297  return cdf_log;
+
298  if (!check_finite(function, sigma, "Scale parameter", &cdf_log))
+
299  return cdf_log;
+
300  if (!check_positive(function, sigma, "Scale parameter", &cdf_log))
+
301  return cdf_log;
+
302  if (!check_finite(function, lambda, "Inv_scale parameter", &cdf_log))
+
303  return cdf_log;
+
304  if (!check_positive(function, lambda, "Inv_scale parameter", &cdf_log))
+
305  return cdf_log;
+
306  if (!check_not_nan(function, lambda, "Inv_scale parameter", &cdf_log))
+
307  return cdf_log;
+
308  if (!(check_consistent_sizes(function,
+
309  y,mu,sigma,lambda,
+
310  "Random variable","Location parameter",
+
311  "Scale parameter","Inv_scale paramter",
+
312  &cdf_log)))
+
313  return cdf_log;
+
314 
+ +
316  operands_and_partials(y, mu, sigma,lambda);
+
317 
+
318  using stan::math::SQRT_2;
+
319  using std::log;
+
320 
+
321  VectorView<const T_y> y_vec(y);
+
322  VectorView<const T_loc> mu_vec(mu);
+
323  VectorView<const T_scale> sigma_vec(sigma);
+
324  VectorView<const T_inv_scale> lambda_vec(lambda);
+
325  size_t N = max_size(y, mu, sigma, lambda);
+
326  const double sqrt_pi = std::sqrt(stan::math::pi());
+
327  for (size_t n = 0; n < N; n++) {
+
328 
+
329  if(boost::math::isinf(y_vec[n])) {
+
330  if (y_vec[n] < 0.0)
+
331  return operands_and_partials.to_var(stan::math::negative_infinity());
+
332  else
+
333  return operands_and_partials.to_var(0.0);
+
334  }
+
335 
+
336  const double y_dbl = value_of(y_vec[n]);
+
337  const double mu_dbl = value_of(mu_vec[n]);
+
338  const double sigma_dbl = value_of(sigma_vec[n]);
+
339  const double lambda_dbl = value_of(lambda_vec[n]);
+
340  const double u = lambda_dbl * (y_dbl - mu_dbl);
+
341  const double v = lambda_dbl * sigma_dbl ;
+
342  const double v_sq = v * v;
+
343  const double scaled_diff = (y_dbl - mu_dbl) / (SQRT_2 * sigma_dbl);
+
344  const double scaled_diff_sq = scaled_diff * scaled_diff;
+
345  const double erf_calc1 = 0.5 * (1 + erf(u / (v * SQRT_2)));
+
346  const double erf_calc2 = 0.5 * (1 + erf(u / (v * SQRT_2) - v / SQRT_2));
+
347  const double deriv_1 = lambda_dbl * exp(0.5 * v_sq - u) * erf_calc2;
+
348  const double deriv_2 = SQRT_2 / sqrt_pi * 0.5
+
349  * exp(0.5 * v_sq - (-scaled_diff + (v / SQRT_2))
+
350  * (-scaled_diff + (v / SQRT_2)) - u) / sigma_dbl;
+
351  const double deriv_3 = SQRT_2 / sqrt_pi * 0.5 * exp(-scaled_diff_sq)
+
352  / sigma_dbl;
+
353 
+
354  const double denom = erf_calc1 - erf_calc2 * exp(0.5 * v_sq - u);
+
355  const double cdf_ = erf_calc1 - exp(-u + v_sq * 0.5) * (erf_calc2);
+
356 
+
357  cdf_log += log(cdf_);
+
358 
+ +
360  operands_and_partials.d_x1[n] += (deriv_1 - deriv_2 + deriv_3)
+
361  / denom;
+ +
363  operands_and_partials.d_x2[n] += (-deriv_1 + deriv_2 - deriv_3)
+
364  / denom;
+ +
366  operands_and_partials.d_x3[n]
+
367  += (-deriv_1 * v - deriv_3 * scaled_diff
+
368  * SQRT_2 - deriv_2 * sigma_dbl * SQRT_2
+
369  * (-SQRT_2 * 0.5 * (-lambda_dbl + scaled_diff * SQRT_2
+
370  / sigma_dbl)
+
371  - SQRT_2 * lambda_dbl))
+
372  / denom;
+ +
374  operands_and_partials.d_x4[n]
+
375  += exp(0.5 * v_sq - u)
+
376  * (SQRT_2 / sqrt_pi * 0.5 * sigma_dbl
+
377  * exp(-(v / SQRT_2 - scaled_diff)
+
378  * (v / SQRT_2 - scaled_diff))
+
379  - (v * sigma_dbl + mu_dbl - y_dbl) * erf_calc2)
+
380  / denom;
+
381  }
+
382 
+
383  return operands_and_partials.to_var(cdf_log);
+
384  }
+
385 
+
386  template <typename T_y, typename T_loc, typename T_scale,
+
387  typename T_inv_scale>
+ +
389  exp_mod_normal_ccdf_log(const T_y& y, const T_loc& mu, const T_scale& sigma,
+
390  const T_inv_scale& lambda) {
+
391  static const char* function = "stan::prob::exp_mod_normal_ccdf_log(%1%)";
+
392 
+ + + + +
397  using stan::math::value_of;
+
398 
+
399  double ccdf_log(0.0);
+
400  //check if any vectors are zero length
+
401  if (!(stan::length(y)
+
402  && stan::length(mu)
+
403  && stan::length(sigma)
+
404  && stan::length(lambda)))
+
405  return ccdf_log;
+
406 
+
407  if (!check_not_nan(function, y, "Random variable", &ccdf_log))
+
408  return ccdf_log;
+
409  if (!check_finite(function, mu, "Location parameter", &ccdf_log))
+
410  return ccdf_log;
+
411  if (!check_not_nan(function, sigma, "Scale parameter", &ccdf_log))
+
412  return ccdf_log;
+
413  if (!check_finite(function, sigma, "Scale parameter", &ccdf_log))
+
414  return ccdf_log;
+
415  if (!check_positive(function, sigma, "Scale parameter", &ccdf_log))
+
416  return ccdf_log;
+
417  if (!check_finite(function, lambda, "Inv_scale parameter", &ccdf_log))
+
418  return ccdf_log;
+
419  if (!check_positive(function, lambda, "Inv_scale parameter", &ccdf_log))
+
420  return ccdf_log;
+
421  if (!check_not_nan(function, lambda, "Inv_scale parameter", &ccdf_log))
+
422  return ccdf_log;
+
423  if (!(check_consistent_sizes(function,
+
424  y,mu,sigma,lambda,
+
425  "Random variable","Location parameter",
+
426  "Scale parameter","Inv_scale paramter",
+
427  &ccdf_log)))
+
428  return ccdf_log;
+
429 
+ +
431  operands_and_partials(y, mu, sigma,lambda);
+
432 
+
433  using stan::math::SQRT_2;
+
434  using std::log;
+
435 
+
436  VectorView<const T_y> y_vec(y);
+
437  VectorView<const T_loc> mu_vec(mu);
+
438  VectorView<const T_scale> sigma_vec(sigma);
+
439  VectorView<const T_inv_scale> lambda_vec(lambda);
+
440  size_t N = max_size(y, mu, sigma, lambda);
+
441  const double sqrt_pi = std::sqrt(stan::math::pi());
+
442  for (size_t n = 0; n < N; n++) {
+
443 
+
444  if(boost::math::isinf(y_vec[n])) {
+
445  if (y_vec[n] > 0.0)
+
446  return operands_and_partials.to_var(stan::math::negative_infinity());
+
447  else
+
448  return operands_and_partials.to_var(0.0);
+
449  }
+
450 
+
451  const double y_dbl = value_of(y_vec[n]);
+
452  const double mu_dbl = value_of(mu_vec[n]);
+
453  const double sigma_dbl = value_of(sigma_vec[n]);
+
454  const double lambda_dbl = value_of(lambda_vec[n]);
+
455  const double u = lambda_dbl * (y_dbl - mu_dbl);
+
456  const double v = lambda_dbl * sigma_dbl ;
+
457  const double v_sq = v * v;
+
458  const double scaled_diff = (y_dbl - mu_dbl) / (SQRT_2 * sigma_dbl);
+
459  const double scaled_diff_sq = scaled_diff * scaled_diff;
+
460  const double erf_calc1 = 0.5 * (1 + erf(u / (v * SQRT_2)));
+
461  const double erf_calc2 = 0.5 * (1 + erf(u / (v * SQRT_2) - v / SQRT_2));
+
462 
+
463  const double deriv_1 = lambda_dbl * exp(0.5 * v_sq - u) * erf_calc2;
+
464  const double deriv_2 = SQRT_2 / sqrt_pi * 0.5
+
465  * exp(0.5 * v_sq
+
466  - (-scaled_diff + (v / SQRT_2)) * (-scaled_diff
+
467  + (v / SQRT_2)) - u)
+
468  / sigma_dbl;
+
469  const double deriv_3 = SQRT_2 / sqrt_pi * 0.5 * exp(-scaled_diff_sq) / sigma_dbl;
+
470 
+
471  const double ccdf_ = 1.0 - erf_calc1 + exp(-u + v_sq * 0.5) * (erf_calc2);
+
472 
+
473  ccdf_log += log(ccdf_);
+
474 
+ +
476  operands_and_partials.d_x1[n]
+
477  -= (deriv_1 - deriv_2 + deriv_3) / ccdf_;
+ +
479  operands_and_partials.d_x2[n]
+
480  -= (-deriv_1 + deriv_2 - deriv_3) / ccdf_;
+ +
482  operands_and_partials.d_x3[n]
+
483  -= (-deriv_1 * v - deriv_3 * scaled_diff * SQRT_2 - deriv_2
+
484  * sigma_dbl * SQRT_2
+
485  * (-SQRT_2 * 0.5 * (-lambda_dbl + scaled_diff * SQRT_2
+
486  / sigma_dbl)
+
487  - SQRT_2 * lambda_dbl))
+
488  / ccdf_;
+ +
490  operands_and_partials.d_x4[n] -= exp(0.5 * v_sq - u)
+
491  * (SQRT_2 / sqrt_pi * 0.5 * sigma_dbl
+
492  * exp(-(v / SQRT_2 - scaled_diff) * (v / SQRT_2 - scaled_diff))
+
493  - (v * sigma_dbl + mu_dbl - y_dbl) * erf_calc2)
+
494  / ccdf_;
+
495  }
+
496 
+
497  return operands_and_partials.to_var(ccdf_log);
+
498  }
+
499 
+
500  template <class RNG>
+
501  inline double
+
502  exp_mod_normal_rng(const double mu,
+
503  const double sigma,
+
504  const double lambda,
+
505  RNG& rng) {
+
506 
+
507  static const char* function = "stan::prob::exp_mod_normal_rng(%1%)";
+
508 
+ + +
511 
+
512  if (!check_finite(function, mu, "Location parameter"))
+
513  return 0;
+
514  if (!check_finite(function, lambda, "Inv_scale parameter"))
+
515  return 0;
+
516  if (!check_positive(function, lambda, "Inv_scale parameter"))
+
517  return 0;
+
518  if (!check_positive(function, sigma, "Scale parameter"))
+
519  return 0;
+
520 
+
521  return stan::prob::normal_rng(mu, sigma,rng) + stan::prob::exponential_rng(lambda, rng);
+
522  }
+
523  }
+
524 }
+
525 #endif
+
526 
+
527 
+
528 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/expl__leapfrog_8hpp.html b/doc/api/html/expl__leapfrog_8hpp.html new file mode 100644 index 00000000000..210a33fbcf6 --- /dev/null +++ b/doc/api/html/expl__leapfrog_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/mcmc/hmc/integrators/expl_leapfrog.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
expl_leapfrog.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::expl_leapfrog< H, P >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/expl__leapfrog_8hpp_source.html b/doc/api/html/expl__leapfrog_8hpp_source.html new file mode 100644 index 00000000000..60aa20e48b6 --- /dev/null +++ b/doc/api/html/expl__leapfrog_8hpp_source.html @@ -0,0 +1,145 @@ + + + + + +Stan: src/stan/mcmc/hmc/integrators/expl_leapfrog.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
expl_leapfrog.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__EXPL__LEAPFROG__BETA__
+
2 #define __STAN__MCMC__EXPL__LEAPFROG__BETA__
+
3 
+ + +
6 
+
7 namespace stan {
+
8 
+
9  namespace mcmc {
+
10 
+
11  template <typename H, typename P>
+
12  class expl_leapfrog: public base_leapfrog<H, P> {
+
13 
+
14  public:
+
15 
+
16  expl_leapfrog(std::ostream* o=0): base_leapfrog<H, P>(o) {};
+
17 
+
18  void begin_update_p(P& z, H& hamiltonian, double epsilon) {
+
19  z.p -= epsilon * hamiltonian.dphi_dq(z);
+
20  }
+
21 
+
22  void update_q(P& z, H& hamiltonian, double epsilon) {
+
23  Eigen::Map<Eigen::VectorXd> q(&(z.q[0]), z.q.size());
+
24  q += epsilon * hamiltonian.dtau_dp(z);
+
25  }
+
26 
+
27  void end_update_p(P& z, H& hamiltonian, double epsilon) {
+
28  z.p -= epsilon * hamiltonian.dphi_dq(z);
+
29  }
+
30 
+
31  };
+
32 
+
33  } // mcmc
+
34 
+
35 } // stan
+
36 
+
37 
+
38 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/exponential_8hpp.html b/doc/api/html/exponential_8hpp.html new file mode 100644 index 00000000000..313ef2fb50a --- /dev/null +++ b/doc/api/html/exponential_8hpp.html @@ -0,0 +1,158 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/exponential.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
exponential.hpp File Reference
+
+
+
#include <boost/random/exponential_distribution.hpp>
+#include <boost/random/variate_generator.hpp>
+#include <stan/agrad/partials_vari.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/math/functions/value_of.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/prob/constants.hpp>
+#include <stan/prob/traits.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + + + + + + + + +

+Functions

template<bool propto, typename T_y , typename T_inv_scale >
return_type< T_y, T_inv_scale >
+::type 
stan::prob::exponential_log (const T_y &y, const T_inv_scale &beta)
 The log of an exponential density for y with the specified inverse scale parameter.
 
template<typename T_y , typename T_inv_scale >
return_type< T_y, T_inv_scale >
+::type 
stan::prob::exponential_log (const T_y &y, const T_inv_scale &beta)
 
template<typename T_y , typename T_inv_scale >
return_type< T_y, T_inv_scale >
+::type 
stan::prob::exponential_cdf (const T_y &y, const T_inv_scale &beta)
 Calculates the exponential cumulative distribution function for the given y and beta.
 
template<typename T_y , typename T_inv_scale >
return_type< T_y, T_inv_scale >
+::type 
stan::prob::exponential_cdf_log (const T_y &y, const T_inv_scale &beta)
 
template<typename T_y , typename T_inv_scale >
return_type< T_y, T_inv_scale >
+::type 
stan::prob::exponential_ccdf_log (const T_y &y, const T_inv_scale &beta)
 
template<class RNG >
double stan::prob::exponential_rng (const double beta, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/exponential_8hpp_source.html b/doc/api/html/exponential_8hpp_source.html new file mode 100644 index 00000000000..f269f09b822 --- /dev/null +++ b/doc/api/html/exponential_8hpp_source.html @@ -0,0 +1,378 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/exponential.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
exponential.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS__EXPONENTIAL_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS__EXPONENTIAL_HPP__
+
3 
+
4 #include <boost/random/exponential_distribution.hpp>
+
5 #include <boost/random/variate_generator.hpp>
+
6 
+ + + +
10 #include <stan/meta/traits.hpp>
+
11 #include <stan/prob/constants.hpp>
+
12 #include <stan/prob/traits.hpp>
+
13 
+
14 namespace stan {
+
15 
+
16  namespace prob {
+
17 
+
44  template <bool propto, typename T_y, typename T_inv_scale>
+
45  typename return_type<T_y,T_inv_scale>::type
+
46  exponential_log(const T_y& y, const T_inv_scale& beta) {
+
47  static const char* function = "stan::prob::exponential_log(%1%)";
+
48 
+
49  // check if any vectors are zero length
+
50  if (!(stan::length(y)
+
51  && stan::length(beta)))
+
52  return 0.0;
+
53 
+ + + + + +
59 
+
60  double logp(0.0);
+
61  if(!check_not_nan(function, y, "Random variable", &logp))
+
62  return logp;
+
63  if(!check_finite(function, beta, "Inverse scale parameter", &logp))
+
64  return logp;
+
65  if(!check_positive(function, beta, "Inverse scale parameter", &logp))
+
66  return logp;
+
67 
+
68  if (!(check_consistent_sizes(function,
+
69  y,beta,
+
70  "Random variable","Inverse scale parameter",
+
71  &logp)))
+
72  return logp;
+
73 
+
74 
+
75  // set up template expressions wrapping scalars into vector views
+
76  VectorView<const T_y> y_vec(y);
+
77  VectorView<const T_inv_scale> beta_vec(beta);
+
78  size_t N = max_size(y, beta);
+
79 
+ + +
82  is_vector<T_inv_scale>::value> log_beta(length(beta));
+
83  for (size_t i = 0; i < length(beta); i++)
+
84  if (include_summand<propto,T_inv_scale>::value)
+
85  log_beta[i] = log(value_of(beta_vec[i]));
+
86 
+
87  agrad::OperandsAndPartials<T_y,T_inv_scale> operands_and_partials(y, beta);
+
88 
+
89  for (size_t n = 0; n < N; n++) {
+
90  const double beta_dbl = value_of(beta_vec[n]);
+
91  const double y_dbl = value_of(y_vec[n]);
+
92  if (include_summand<propto,T_inv_scale>::value)
+
93  logp += log_beta[n];
+ +
95  logp -= beta_dbl * y_dbl;
+
96 
+ +
98  operands_and_partials.d_x1[n] -= beta_dbl;
+ +
100  operands_and_partials.d_x2[n] += 1 / beta_dbl - y_dbl;
+
101  }
+
102  return operands_and_partials.to_var(logp);
+
103  }
+
104 
+
105  template <typename T_y, typename T_inv_scale>
+
106  inline
+ +
108  exponential_log(const T_y& y, const T_inv_scale& beta) {
+
109  return exponential_log<false>(y,beta);
+
110  }
+
111 
+
112 
+
113 
+
127  template <typename T_y, typename T_inv_scale>
+ +
129  exponential_cdf(const T_y& y, const T_inv_scale& beta) {
+
130 
+
131  static const char* function = "stan::prob::exponential_cdf(%1%)";
+
132 
+ + + + +
137  using boost::math::tools::promote_args;
+
138  using stan::math::value_of;
+
139 
+
140  double cdf(1.0);
+
141  // check if any vectors are zero length
+
142  if (!(stan::length(y)
+
143  && stan::length(beta)))
+
144  return cdf;
+
145 
+
146  if(!check_not_nan(function, y, "Random variable", &cdf))
+
147  return cdf;
+
148  if(!check_nonnegative(function, y, "Random variable", &cdf))
+
149  return cdf;
+
150  if(!check_finite(function, beta, "Inverse scale parameter", &cdf))
+
151  return cdf;
+
152  if(!check_positive(function, beta, "Inverse scale parameter", &cdf))
+
153  return cdf;
+
154 
+ +
156  operands_and_partials(y, beta);
+
157 
+
158  VectorView<const T_y> y_vec(y);
+
159  VectorView<const T_inv_scale> beta_vec(beta);
+
160  size_t N = max_size(y, beta);
+
161  for (size_t n = 0; n < N; n++) {
+
162  const double beta_dbl = value_of(beta_vec[n]);
+
163  const double y_dbl = value_of(y_vec[n]);
+
164  const double one_m_exp = 1.0 - exp(-beta_dbl * y_dbl);
+
165 
+
166  // cdf
+
167  cdf *= one_m_exp;
+
168  }
+
169 
+
170  for(size_t n = 0; n < N; n++) {
+
171  const double beta_dbl = value_of(beta_vec[n]);
+
172  const double y_dbl = value_of(y_vec[n]);
+
173  const double one_m_exp = 1.0 - exp(-beta_dbl * y_dbl);
+
174 
+
175  // gradients
+
176  double rep_deriv = exp(-beta_dbl * y_dbl) / one_m_exp;
+ +
178  operands_and_partials.d_x1[n] += rep_deriv * beta_dbl * cdf;
+ +
180  operands_and_partials.d_x2[n] += rep_deriv * y_dbl * cdf;
+
181  }
+
182 
+
183  return operands_and_partials.to_var(cdf);
+
184  }
+
185 
+
186  template <typename T_y, typename T_inv_scale>
+ +
188  exponential_cdf_log(const T_y& y, const T_inv_scale& beta) {
+
189 
+
190  static const char* function = "stan::prob::exponential_cdf_log(%1%)";
+
191 
+ + + + +
196  using boost::math::tools::promote_args;
+
197  using stan::math::value_of;
+
198 
+
199  double cdf_log(0.0);
+
200  // check if any vectors are zero length
+
201  if (!(stan::length(y)
+
202  && stan::length(beta)))
+
203  return cdf_log;
+
204 
+
205  if(!check_not_nan(function, y, "Random variable", &cdf_log))
+
206  return cdf_log;
+
207  if(!check_nonnegative(function, y, "Random variable", &cdf_log))
+
208  return cdf_log;
+
209  if(!check_finite(function, beta, "Inverse scale parameter", &cdf_log))
+
210  return cdf_log;
+
211  if(!check_positive(function, beta, "Inverse scale parameter", &cdf_log))
+
212  return cdf_log;
+
213 
+ +
215  operands_and_partials(y, beta);
+
216 
+
217  VectorView<const T_y> y_vec(y);
+
218  VectorView<const T_inv_scale> beta_vec(beta);
+
219  size_t N = max_size(y, beta);
+
220  for (size_t n = 0; n < N; n++) {
+
221  const double beta_dbl = value_of(beta_vec[n]);
+
222  const double y_dbl = value_of(y_vec[n]);
+
223  double one_m_exp = 1.0 - exp(-beta_dbl * y_dbl);
+
224  // log cdf
+
225  cdf_log += log(one_m_exp);
+
226 
+
227  // gradients
+
228  double rep_deriv = -exp(-beta_dbl * y_dbl) / one_m_exp;
+ +
230  operands_and_partials.d_x1[n] -= rep_deriv * beta_dbl;
+ +
232  operands_and_partials.d_x2[n] -= rep_deriv * y_dbl;
+
233  }
+
234  return operands_and_partials.to_var(cdf_log);
+
235  }
+
236 
+
237  template <typename T_y, typename T_inv_scale>
+ +
239  exponential_ccdf_log(const T_y& y, const T_inv_scale& beta) {
+
240 
+
241  static const char* function = "stan::prob::exponential_ccdf_log(%1%)";
+
242 
+ + + + +
247  using boost::math::tools::promote_args;
+
248  using stan::math::value_of;
+
249 
+
250  double ccdf_log(0.0);
+
251  // check if any vectors are zero length
+
252  if (!(stan::length(y)
+
253  && stan::length(beta)))
+
254  return ccdf_log;
+
255 
+
256  if(!check_not_nan(function, y, "Random variable", &ccdf_log))
+
257  return ccdf_log;
+
258  if(!check_nonnegative(function, y, "Random variable", &ccdf_log))
+
259  return ccdf_log;
+
260  if(!check_finite(function, beta, "Inverse scale parameter", &ccdf_log))
+
261  return ccdf_log;
+
262  if(!check_positive(function, beta, "Inverse scale parameter", &ccdf_log))
+
263  return ccdf_log;
+
264 
+ +
266  operands_and_partials(y, beta);
+
267 
+
268  VectorView<const T_y> y_vec(y);
+
269  VectorView<const T_inv_scale> beta_vec(beta);
+
270  size_t N = max_size(y, beta);
+
271  for (size_t n = 0; n < N; n++) {
+
272  const double beta_dbl = value_of(beta_vec[n]);
+
273  const double y_dbl = value_of(y_vec[n]);
+
274  // log ccdf
+
275  ccdf_log += -beta_dbl * y_dbl;
+
276 
+
277  // gradients
+ +
279  operands_and_partials.d_x1[n] -= beta_dbl;
+ +
281  operands_and_partials.d_x2[n] -= y_dbl;
+
282  }
+
283  return operands_and_partials.to_var(ccdf_log);
+
284  }
+
285 
+
286  template <class RNG>
+
287  inline double
+
288  exponential_rng(const double beta,
+
289  RNG& rng) {
+
290  using boost::variate_generator;
+
291  using boost::exponential_distribution;
+
292 
+
293  static const char* function = "stan::prob::exponential_rng(%1%)";
+
294 
+ + +
297 
+
298  if(!check_finite(function, beta, "Inverse scale parameter"))
+
299  return 0;
+
300  if(!check_positive(function, beta, "Inverse scale parameter"))
+
301  return 0;
+
302 
+
303  variate_generator<RNG&, exponential_distribution<> >
+
304  exp_rng(rng, exponential_distribution<>(beta));
+
305  return exp_rng();
+
306  }
+
307  }
+
308 }
+
309 
+
310 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/expression__grammar_8hpp.html b/doc/api/html/expression__grammar_8hpp.html new file mode 100644 index 00000000000..62e4de6290e --- /dev/null +++ b/doc/api/html/expression__grammar_8hpp.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/gm/grammars/expression_grammar.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
expression_grammar.hpp File Reference
+
+
+
#include <string>
+#include <sstream>
+#include <vector>
+#include <boost/spirit/include/qi.hpp>
+#include <stan/gm/ast.hpp>
+#include <stan/gm/grammars/term_grammar.hpp>
+#include <stan/gm/grammars/whitespace_grammar.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Classes

struct  term_grammar< Iterator >
 
struct  expression_grammar< Iterator >
 
struct  stan::gm::expression_grammar< Iterator >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/expression__grammar_8hpp_source.html b/doc/api/html/expression__grammar_8hpp_source.html new file mode 100644 index 00000000000..4c4494e9812 --- /dev/null +++ b/doc/api/html/expression__grammar_8hpp_source.html @@ -0,0 +1,180 @@ + + + + + +Stan: src/stan/gm/grammars/expression_grammar.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
expression_grammar.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__PARSER__EXPRESSION_GRAMMAR__HPP__
+
2 #define __STAN__GM__PARSER__EXPRESSION_GRAMMAR__HPP__
+
3 
+
4 #include <string>
+
5 #include <sstream>
+
6 #include <vector>
+
7 
+
8 #include <boost/spirit/include/qi.hpp>
+
9 
+
10 #include <stan/gm/ast.hpp>
+ + +
13 
+
14 namespace stan {
+
15 
+
16  namespace gm {
+
17 
+
18  template <typename Iterator>
+
19  struct term_grammar;
+
20 
+
21  template <typename Iterator>
+ +
23 
+
24  template <typename Iterator>
+ +
26  : public boost::spirit::qi::grammar<Iterator,
+
27  expression(var_origin),
+
28  whitespace_grammar<Iterator> > {
+
29 
+ +
31  std::stringstream& error_msgs,
+
32  bool allow_lte = true);
+
33 
+ +
35 
+
36  std::stringstream& error_msgs_;
+
37 
+ +
39 
+
40 
+
41 
+
42  boost::spirit::qi::rule<Iterator,
+ + + +
46 
+
47  boost::spirit::qi::rule<Iterator,
+ + + +
51 
+
52  boost::spirit::qi::rule<Iterator,
+ + + +
56 
+
57  boost::spirit::qi::rule<Iterator,
+ + + +
61 
+
62  boost::spirit::qi::rule<Iterator,
+ + + +
66 
+
67 
+
68  };
+
69 
+
70  }
+
71 }
+
72 
+
73 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/expression__grammar__def_8hpp.html b/doc/api/html/expression__grammar__def_8hpp.html new file mode 100644 index 00000000000..be2a5f0942f --- /dev/null +++ b/doc/api/html/expression__grammar__def_8hpp.html @@ -0,0 +1,196 @@ + + + + + +Stan: src/stan/gm/grammars/expression_grammar_def.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
expression_grammar_def.hpp File Reference
+
+
+
#include <cstddef>
+#include <iomanip>
+#include <iostream>
+#include <istream>
+#include <map>
+#include <set>
+#include <sstream>
+#include <string>
+#include <utility>
+#include <vector>
+#include <stdexcept>
+#include <boost/spirit/include/qi.hpp>
+#include <boost/spirit/include/phoenix_core.hpp>
+#include <boost/spirit/include/phoenix_function.hpp>
+#include <boost/spirit/include/phoenix_fusion.hpp>
+#include <boost/spirit/include/phoenix_object.hpp>
+#include <boost/spirit/include/phoenix_operator.hpp>
+#include <boost/spirit/include/phoenix_stl.hpp>
+#include <boost/lexical_cast.hpp>
+#include <boost/fusion/include/adapt_struct.hpp>
+#include <boost/fusion/include/std_pair.hpp>
+#include <boost/config/warning_disable.hpp>
+#include <boost/spirit/include/qi_numeric.hpp>
+#include <boost/spirit/include/classic_position_iterator.hpp>
+#include <boost/spirit/include/support_multi_pass.hpp>
+#include <boost/tuple/tuple.hpp>
+#include <boost/variant/apply_visitor.hpp>
+#include <boost/variant/recursive_variant.hpp>
+#include <stan/gm/ast.hpp>
+#include <stan/gm/grammars/whitespace_grammar.hpp>
+#include <stan/gm/grammars/term_grammar.hpp>
+#include <stan/gm/grammars/expression_grammar.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + + + + + + + + + + + + + + + +

+Classes

struct  stan::gm::validate_expr_type2
 
struct  stan::gm::validate_expr_type2::result< T1, T2 >
 
struct  stan::gm::set_fun_type2
 
struct  stan::gm::set_fun_type2::result< T1, T2 >
 
struct  stan::gm::binary_op_expr
 
struct  stan::gm::binary_op_expr::result< T1, T2, T3, T4, T5 >
 
struct  stan::gm::addition_expr
 
struct  stan::gm::addition_expr::result< T1, T2, T3 >
 
struct  stan::gm::subtraction_expr
 
struct  stan::gm::subtraction_expr::result< T1, T2, T3 >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+ + + + + + + + + + + +

+Variables

boost::phoenix::function
+< validate_expr_type2 > 
stan::gm::validate_expr_type2_f
 
boost::phoenix::function
+< set_fun_type2 > 
stan::gm::set_fun_type2_f
 
boost::phoenix::function
+< binary_op_expr > 
stan::gm::binary_op_f
 
boost::phoenix::function
+< addition_expr > 
stan::gm::addition
 
boost::phoenix::function
+< subtraction_expr > 
stan::gm::subtraction
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/expression__grammar__def_8hpp_source.html b/doc/api/html/expression__grammar__def_8hpp_source.html new file mode 100644 index 00000000000..17ae98e48d9 --- /dev/null +++ b/doc/api/html/expression__grammar__def_8hpp_source.html @@ -0,0 +1,364 @@ + + + + + +Stan: src/stan/gm/grammars/expression_grammar_def.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
expression_grammar_def.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__PARSER__EXPRESSION_GRAMMAR_DEF__HPP__
+
2 #define __STAN__GM__PARSER__EXPRESSION_GRAMMAR_DEF__HPP__
+
3 
+
4 #include <cstddef>
+
5 #include <iomanip>
+
6 #include <iostream>
+
7 #include <istream>
+
8 #include <map>
+
9 #include <set>
+
10 #include <sstream>
+
11 #include <string>
+
12 #include <utility>
+
13 #include <vector>
+
14 #include <stdexcept>
+
15 
+
16 #include <boost/spirit/include/qi.hpp>
+
17 // FIXME: get rid of unused include
+
18 #include <boost/spirit/include/phoenix_core.hpp>
+
19 #include <boost/spirit/include/phoenix_function.hpp>
+
20 #include <boost/spirit/include/phoenix_fusion.hpp>
+
21 #include <boost/spirit/include/phoenix_object.hpp>
+
22 #include <boost/spirit/include/phoenix_operator.hpp>
+
23 #include <boost/spirit/include/phoenix_stl.hpp>
+
24 
+
25 #include <boost/lexical_cast.hpp>
+
26 #include <boost/fusion/include/adapt_struct.hpp>
+
27 #include <boost/fusion/include/std_pair.hpp>
+
28 #include <boost/config/warning_disable.hpp>
+
29 #include <boost/spirit/include/qi.hpp>
+
30 #include <boost/spirit/include/qi_numeric.hpp>
+
31 #include <boost/spirit/include/classic_position_iterator.hpp>
+
32 #include <boost/spirit/include/phoenix_core.hpp>
+
33 #include <boost/spirit/include/phoenix_function.hpp>
+
34 #include <boost/spirit/include/phoenix_fusion.hpp>
+
35 #include <boost/spirit/include/phoenix_object.hpp>
+
36 #include <boost/spirit/include/phoenix_operator.hpp>
+
37 #include <boost/spirit/include/phoenix_stl.hpp>
+
38 #include <boost/spirit/include/support_multi_pass.hpp>
+
39 #include <boost/tuple/tuple.hpp>
+
40 #include <boost/variant/apply_visitor.hpp>
+
41 #include <boost/variant/recursive_variant.hpp>
+
42 
+
43 #include <stan/gm/ast.hpp>
+ + + +
47 
+
48 
+
49 namespace stan {
+
50 
+
51  namespace gm {
+
52 
+
53  // FIXME: cut and paste from term grammar, having trouble w. includes
+ +
55  template <typename T1, typename T2>
+
56  struct result { typedef bool type; };
+
57 
+
58  bool operator()(const expression& expr,
+
59  std::ostream& error_msgs) const {
+
60  if (expr.expression_type().is_ill_formed()) {
+
61  error_msgs << "expression is ill formed" << std::endl;
+
62  return false;
+
63  }
+
64  return true;
+
65  }
+
66  };
+
67  boost::phoenix::function<validate_expr_type2> validate_expr_type2_f;
+
68 
+
69  // FIXME: cut and paste from term grammar, having trouble w. includes
+
70  struct set_fun_type2 {
+
71  template <typename T1, typename T2>
+
72  struct result { typedef fun type; };
+
73 
+ +
75  std::ostream& error_msgs) const {
+
76  std::vector<expr_type> arg_types;
+
77  for (size_t i = 0; i < fun.args_.size(); ++i)
+
78  arg_types.push_back(fun.args_[i].expression_type());
+ +
80  arg_types,
+
81  error_msgs);
+
82  return fun;
+
83  }
+
84  };
+
85  boost::phoenix::function<set_fun_type2> set_fun_type2_f;
+
86 
+
87  struct binary_op_expr {
+
88  template <typename T1, typename T2, typename T3, typename T4, typename T5>
+
89  struct result { typedef expression type; };
+
90 
+ +
92  const expression& expr2,
+
93  const std::string& op,
+
94  const std::string& fun_name,
+
95  std::ostream& error_msgs) const {
+
96  if (!expr1.expression_type().is_primitive()
+
97  || !expr2.expression_type().is_primitive()) {
+
98  error_msgs << "binary infix operator "
+
99  << op
+
100  << " with functional interpretation "
+
101  << fun_name
+
102  << " requires arguments or primitive type (int or real)"
+
103  << ", found left type=" << expr1.expression_type()
+
104  << ", right arg type=" << expr2.expression_type()
+
105  << "; ";
+
106  }
+
107  std::vector<expression> args;
+
108  args.push_back(expr1);
+
109  args.push_back(expr2);
+
110  set_fun_type2 sft;
+
111  fun f(fun_name,args);
+
112  sft(f,error_msgs);
+
113  return expression(f);
+
114  }
+
115  };
+
116  boost::phoenix::function<binary_op_expr> binary_op_f;
+
117 
+
118 
+
119  struct addition_expr {
+
120  template <typename T1, typename T2, typename T3>
+
121  struct result { typedef expression type; };
+
122 
+ +
124  const expression& expr2,
+
125  std::ostream& error_msgs) const {
+
126  if (expr1.expression_type().is_primitive()
+
127  && expr2.expression_type().is_primitive()) {
+
128  return expr1 += expr2;
+
129  }
+
130  std::vector<expression> args;
+
131  args.push_back(expr1);
+
132  args.push_back(expr2);
+
133  set_fun_type2 sft;
+
134  fun f("add",args);
+
135  sft(f,error_msgs);
+
136  return expression(f);
+
137  return expr1 += expr2;
+
138  }
+
139  };
+
140  boost::phoenix::function<addition_expr> addition;
+
141 
+
142 
+ +
144  template <typename T1, typename T2, typename T3>
+
145  struct result { typedef expression type; };
+
146 
+ +
148  const expression& expr2,
+
149  std::ostream& error_msgs) const {
+
150  if (expr1.expression_type().is_primitive()
+
151  && expr2.expression_type().is_primitive()) {
+
152  return expr1 -= expr2;
+
153  }
+
154  std::vector<expression> args;
+
155  args.push_back(expr1);
+
156  args.push_back(expr2);
+
157  set_fun_type2 sft;
+
158  fun f("subtract",args);
+
159  sft(f,error_msgs);
+
160  return expression(f);
+
161  }
+
162  };
+
163  boost::phoenix::function<subtraction_expr> subtraction;
+
164 
+
165 
+
166 
+
167  template <typename Iterator>
+ +
169  std::stringstream& error_msgs,
+
170  bool allow_lte)
+
171  : expression_grammar::base_type(allow_lte ? expression_r : expression07_r),
+
172  var_map_(var_map),
+
173  error_msgs_(error_msgs),
+
174  term_g(var_map,error_msgs,*this)
+
175  {
+
176  using boost::spirit::qi::_1;
+
177  using boost::spirit::qi::char_;
+
178  using boost::spirit::qi::double_;
+
179  using boost::spirit::qi::eps;
+
180  using boost::spirit::qi::int_;
+
181  using boost::spirit::qi::lexeme;
+
182  using boost::spirit::qi::lit;
+
183  using boost::spirit::qi::_pass;
+
184  using boost::spirit::qi::_val;
+
185  using boost::spirit::qi::labels::_r1;
+
186 
+
187  // _r1 : var_origin
+
188 
+
189  expression_r.name("expression (top level, precedence 15, binary ||");
+ +
191  = expression14_r(_r1) [_val = _1]
+
192  > *( lit("||")
+
193  > expression14_r(_r1) [_val = binary_op_f(_val,_1,"||","logical_or",
+
194  boost::phoenix::ref(error_msgs))]
+
195  );
+
196 
+
197  expression14_r.name("expression, precedence 14, binary &&");
+ +
199  = expression10_r(_r1) [_val = _1]
+
200  > *( lit("&&")
+
201  > expression10_r(_r1) [_val = binary_op_f(_val,_1,"&&","logical_and",
+
202  boost::phoenix::ref(error_msgs))]
+
203  );
+
204 
+
205  expression10_r.name("expression, precedence 10, binary ==, !=");
+ +
207  = expression09_r(_r1) [_val = _1]
+
208  > *( ( lit("==")
+
209  > expression09_r(_r1) [_val = binary_op_f(_val,_1,"==","logical_eq",
+
210  boost::phoenix::ref(error_msgs))] )
+
211  |
+
212  ( lit("!=")
+
213  > expression09_r(_r1) [_val = binary_op_f(_val,_1,"!=","logical_neq",
+
214  boost::phoenix::ref(error_msgs))] )
+
215  );
+
216 
+
217  expression09_r.name("expression, precedence 9, binary <, <=, >, >=");
+ +
219  = expression07_r(_r1) [_val = _1]
+
220  > *( ( lit("<=")
+
221  > expression07_r(_r1) [_val = binary_op_f(_val,_1,"<","logical_lte",
+
222  boost::phoenix::ref(error_msgs))] )
+
223  |
+
224  ( lit("<")
+
225  > expression07_r(_r1) [_val = binary_op_f(_val,_1,"<=","logical_lt",
+
226  boost::phoenix::ref(error_msgs))] )
+
227  |
+
228  ( lit(">=")
+
229  > expression07_r(_r1) [_val = binary_op_f(_val,_1,">","logical_gte",
+
230  boost::phoenix::ref(error_msgs))] )
+
231  |
+
232  ( lit(">")
+
233  > expression07_r(_r1) [_val = binary_op_f(_val,_1,">=","logical_gt",
+
234  boost::phoenix::ref(error_msgs))] )
+
235  );
+
236 
+
237  expression07_r.name("expression, precedence 7, binary +, -");
+ +
239  = term_g(_r1)
+
240  [_val = _1]
+
241  > *( ( lit('+')
+
242  > term_g(_r1) // expression07_r
+
243  [_val = addition(_val,_1,boost::phoenix::ref(error_msgs))] )
+
244  |
+
245  ( lit('-')
+
246  > term_g(_r1) // expression07_r
+
247  [_val = subtraction(_val,_1,boost::phoenix::ref(error_msgs))] )
+
248  )
+
249  > eps[_pass = validate_expr_type2_f(_val,boost::phoenix::ref(error_msgs_))]
+
250  ;
+
251 
+
252 
+
253  }
+
254  }
+
255 }
+
256 
+
257 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/expression__grammar__inst_8cpp.html b/doc/api/html/expression__grammar__inst_8cpp.html new file mode 100644 index 00000000000..ebd8b088f1c --- /dev/null +++ b/doc/api/html/expression__grammar__inst_8cpp.html @@ -0,0 +1,123 @@ + + + + + +Stan: src/stan/gm/grammars/expression_grammar_inst.cpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
expression_grammar_inst.cpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/expression__grammar__inst_8cpp_source.html b/doc/api/html/expression__grammar__inst_8cpp_source.html new file mode 100644 index 00000000000..68d7e199c30 --- /dev/null +++ b/doc/api/html/expression__grammar__inst_8cpp_source.html @@ -0,0 +1,115 @@ + + + + + +Stan: src/stan/gm/grammars/expression_grammar_inst.cpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
expression_grammar_inst.cpp
+
+
+Go to the documentation of this file.
+ +
3 
+
4 namespace stan {
+
5  namespace gm {
+ +
7  }
+
8 }
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/files.html b/doc/api/html/files.html new file mode 100644 index 00000000000..f0ad5b1abbc --- /dev/null +++ b/doc/api/html/files.html @@ -0,0 +1,856 @@ + + + + + +Stan: File List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + +
+ + + + +
+ +
+ +
+
+
File List
+
+
+
Here is a list of all files with brief descriptions:
+
[detail level 12345678]
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
\-src
 \-stan
  o-agrad
  |o+fwd
  |o+rev
  |o*agrad_thread_safe.hpp
  |o*autodiff.hpp
  |o*fwd.hpp
  |o*hessian.hpp
  |o*partials_vari.hpp
  |\*rev.hpp
  o-command
  |o*print.cpp
  |o*print.hpp
  |o*stanc.cpp
  |\*stanc_helper.hpp
  o-gm
  |o+arguments
  |o+grammars
  |o*ast.hpp
  |o*ast_def.cpp
  |o*command.hpp
  |o*compiler.hpp
  |o*error_codes.hpp
  |o*generator.hpp
  |\*parser.hpp
  o-io
  |o*cmd_line.hpp
  |o*csv_writer.hpp
  |o*dump.hpp
  |o*mcmc_writer.hpp
  |o*reader.hpp
  |o*stan_csv_reader.hpp
  |o*util.hpp
  |o*var_context.hpp
  |\*writer.hpp
  o-math
  |o+error_handling
  |o+functions
  |o+matrix
  |o*constants.hpp
  |o*error_handling.hpp
  |o*functions.hpp
  |o*matrix.hpp
  |o*matrix_error_handling.hpp
  |o*rep_array.hpp
  |o*rep_matrix.hpp
  |o*rep_row_vector.hpp
  |o*rep_vector.hpp
  |o*seq_view.hpp
  |\*validate_non_negative_rep.hpp
  o-mcmc
  |o+hmc
  |o*base_adaptation.hpp
  |o*base_adapter.hpp
  |o*base_mcmc.hpp
  |o*chains.hpp
  |o*covar_adaptation.hpp
  |o*sample.hpp
  |o*stepsize_adaptation.hpp
  |o*stepsize_adapter.hpp
  |o*stepsize_covar_adapter.hpp
  |o*stepsize_var_adapter.hpp
  |o*var_adaptation.hpp
  |\*windowed_adaptation.hpp
  o-memory
  |o*chunk_alloc.hpp
  |\*stack_alloc.hpp
  o-meta
  |\*traits.hpp
  o-model
  |o*model_header.hpp
  |o*prob_grad.hpp
  |\*util.hpp
  o-optimization
  |o*bfgs.hpp
  |o*nesterov_gradient.hpp
  |\*newton.hpp
  o-prob
  |o+distributions
  |o*autocorrelation.hpp
  |o*autocovariance.hpp
  |o*constants.hpp
  |o*distributions.hpp
  |o*internal_math.hpp
  |o*traits.hpp
  |o*transform.hpp
  |o*welford_covar_estimator.hpp
  |\*welford_var_estimator.hpp
  o*agrad.hpp
  o*gm.hpp
  o*io.hpp
  o*math.hpp
  o*mcmc.hpp
  o*memory.hpp
  o*meta.hpp
  o*model.hpp
  o*prob.hpp
  \*version.hpp
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fill_8hpp.html b/doc/api/html/fill_8hpp.html new file mode 100644 index 00000000000..4923a7e2b3e --- /dev/null +++ b/doc/api/html/fill_8hpp.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/math/matrix/fill.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
fill.hpp File Reference
+
+
+
#include <vector>
+#include <stan/math/matrix/Eigen.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + + + + + +

+Functions

template<typename T , typename S >
void stan::math::fill (T &x, const S &y)
 Fill the specified container with the specified value.
 
template<typename T , int R, int C, typename S >
void stan::math::fill (Eigen::Matrix< T, R, C > &x, const S &y)
 Fill the specified container with the specified value.
 
template<typename T , typename S >
void stan::math::fill (std::vector< T > &x, const S &y)
 Fill the specified container with the specified value.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fill_8hpp_source.html b/doc/api/html/fill_8hpp_source.html new file mode 100644 index 00000000000..dcb7c1491cf --- /dev/null +++ b/doc/api/html/fill_8hpp_source.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/math/matrix/fill.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
fill.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__FILL_HPP__
+
2 #define __STAN__MATH__MATRIX__FILL_HPP__
+
3 
+
4 #include <vector>
+ +
6 
+
7 namespace stan {
+
8 
+
9  namespace math {
+
10 
+
21  template <typename T, typename S>
+
22  void fill(T& x, const S& y) {
+
23  x = y;
+
24  }
+
25 
+
38  template <typename T, int R, int C, typename S>
+
39  void fill(Eigen::Matrix<T,R,C>& x, const S& y) {
+
40  x.fill(y);
+
41  }
+
42 
+
54  template <typename T, typename S>
+
55  void fill(std::vector<T>& x, const S& y) {
+
56  for (size_t i = 0; i < x.size(); ++i)
+
57  fill(x[i],y);
+
58  }
+
59 
+
60 
+
61 
+
62  }
+
63 }
+
64 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/form_0.png b/doc/api/html/form_0.png new file mode 100644 index 0000000000000000000000000000000000000000..7fe4ed9f252a366bfb92b3601fb432b5c914f3a1 GIT binary patch literal 601 zcmeAS@N?(olHy`uVBq!ia0vp^wLmP+!3-n?4L4{5DT4r?5LX~g5{R;w;Rb3DC<*cl zX3+D9&2Q+Rw`S+jOLt#>`M)ZC!+Qn>#uJ_{jv*C{Z|7dzv{`|t#omEq(X{XNx9wj! zE;wGcWv_*~{p7b-Bu`9A5zb@$$2^m9U(;-+1L_<28{QjKH~1?kA1FV;@ZHd*vZm&J z(O-)=zxi*umL0d-Q$G7^g<);onPs+`>Z$veJFVWnKceh$TVHKq)VJr0zlXe-W?C!0 z`ngrv(s}NTQQ0@yC4D>i9Tx**u_ds&*t5w^>XR@!_dFw#F@qX@aM*s5yB z3zqP!o4p8LoGkdjXp(sC<7EQJlYN-)G_uS*!n;_d-d&fWzPK3B=RY K&t;ucLK6UV-~K-U literal 0 HcmV?d00001 diff --git a/doc/api/html/form_1.png b/doc/api/html/form_1.png new file mode 100644 index 0000000000000000000000000000000000000000..19f59dafad07f03c35dea80e997978eb486b1c3c GIT binary patch literal 416 zcmeAS@N?(olHy`uVBq!ia0vp^Q9vxt!3-q#Y*^6*qznRlLR^6~Ng&Ezh8w6spd`pI zm_g4YHou{N-kP09FWr6l<^QVm4euEk82LS2978G?-_AYVcUXbPmA}7X;e3LkhrBcjYp zwQTdPTU#ct^IQ8awd2i_(Cte&3L5%PvJ^7p-}Fv?#{5C#`NWIU{!~vCW8hzNNokWM zL;s5Kps44*+zsquFXw!IcIV#wX&G`?lK1&@p~ zy$jp?PVdW|V3x9D-LIX882lb?xpMQ>zx}ILNA2iz;ylg6P@>2mSijGEf=K@@jt}iW Y7;{?K<1Vmm+Xf0}Pgg&ebxsLQ00Ri8-v9sr literal 0 HcmV?d00001 diff --git a/doc/api/html/form_10.png b/doc/api/html/form_10.png new file mode 100644 index 0000000000000000000000000000000000000000..5c185fd9c2304a396bb22dce97c985d16a5f9797 GIT binary patch literal 585 zcmeAS@N?(olHy`uVBq!ia0vp^2|z5)!3-o1C+;c+QU(D&A+A80BoJjU!wu9RP!i-9 z%%JBHo8QnsZ_Uo5m+rp&@_$wOhW88%j5|DC978G?-_DKhf2_dMYX5G+vrqs3zrE$a zF?VL!rc2*aRa;hHkjW{oDTrhIC)};6+Tb6l5ukLS{Y*qbzox>0>fMYp+w|?Gmg;Oi z!d#J_#<(LhZ~A=O{wH}8MgKQl3gxcp*<#*s|E<~@C)Jq-UJsThG3?p&^q=6P!>!$y z_8C6Sn6zT`M2n_lZ&F@PJvqHIW=7yfi>aln&mX!q@owTPHg(nBuNSX}gsq)!{p*>H z+h?Q15JSu7nOTNcCQp=EqV-Ap@Vd&kKSIpqzSd85>ostTJ};q|5;-k%9^*0|?N<`J zrf=A`*OHmR=5}kQ2ipVYU1>f`b#B>kCtZH^$>#l!~ZK`MHye#P3BIR$9!2O$=9x@|EZvK{_9}RhDO$;s5{NzGV&Q z^eK9G*rxaRyg+But5><#Gki#A_%L6roZ*KkcUlcY!_J%H41d~MSqn7RHJoJlaIr#@ z;ZEO$aSRn3R3=(3Dl0zoQdw=CWB+v>QPUpXJ;yg?UTs^!wW4#+|N8mvGx2v0v{CsIbNg51H_gr!GnE); zshRHS+04npz*fEdn&R5HdXE)e2i`@$-RJVVR=0Bf+-qB}`OR^7HEA(>(P~q^Q~DKx zE&=YJWp7=*RkOnM*Ev^(MOWf^`1u(swo5MY?LVh8E#kgPz5BOnrzui1C#V;DKll=KHPlJv+{UC%6q#=;oC1R zMjrK6yP_s=%b@y|jPzl_V-t7XuU$LcS%N`st!(#v|Lx}mP8o!LKIDFN$JWPvwzfR& z%nUXWynB7W{e1XM@X%WArOTM*4?LZ=^9DN$Lrr2$-S@@6q|=N$luf%AetGA3Ti`%t zyx%g%3)^>bP0l+XkK D@Hl0n literal 0 HcmV?d00001 diff --git a/doc/api/html/form_101.png b/doc/api/html/form_101.png new file mode 100644 index 0000000000000000000000000000000000000000..43292072ebed86d87c40d30e268656c173130eec GIT binary patch literal 452 zcmeAS@N?(olHy`uVBq!ia0vp^=0GgU!3-p?CboG3DT4r?5LX~g5{R;w;Rb3DC<*cl zX3+D9&2Q+Rw`S+jOLt#>`M)ZC!+Qn>Mq^JG$B+ufx3MQDwJPxBm_^F*{r|uHGG}*B z==v{a%cp26UhrJLxSZify#1M4Muz@6mIF&?Fa|R`SX=+XzUBBlr!%)+SG2UL8rt&i zc^_3?Tqfas`rjmjZAb6<7M?jYt7-DC=7ZOc8-|BzndYgM2+2jd7j6nXw!2g)X=-KX z=iVP);q!vL3+>G#PixJn=(ng;^qex|XWPUTA!j=xgIbPOAGho*;&VDzBvBBWDE8ca z_Dk6nKhsn~ru=-qXepPw=!8%61+V0+RJ|rtxGeL=lBwskE4cLU-Y;18EbNuU%9*Uy z-;y8bRf+rUiq~SiAul>@@%cBwD>D-0eoebO{d`1d-nI}HRXLZnKd;Je(cj^AT7Lpj=0^f&UEuV}=jQe$JWZf9>@*e5rC1O8@r&A0cTx>UR&M#V(^rIp2+ z{KUU&mmFoNNe<;)ad|(t6Q7br5d>yVAx zis%XFc{rWk-`;Ta-R@f}1yXt=Q)e%*Up@Ip^PYkya*{Vd0NCv(`^(ih@k-~TpUt>QSYl=*s{ zVEOf@+VP|GRx!YJN@ zdF%J_FqlhoKL|Et$=lneQd-xwbC0C#0sFjqhV$%vx@9^Bdq4@v)78&qol`;+02{&* A`v3p{ literal 0 HcmV?d00001 diff --git a/doc/api/html/form_103.png b/doc/api/html/form_103.png new file mode 100644 index 0000000000000000000000000000000000000000..320e4654de8152a4bf160c0a46abe5cc571e0168 GIT binary patch literal 211 zcmeAS@N?(olHy`uVBq!ia0vp^+#t-s3?%0jwTl2Lg8-ipS0GIih_aUf86;2=}6v3<9~V9r0@q%HZOX!W&N!+7mRn$E!43wN;;moV&%PfJ7aT(+f{qc8iAbV M>FVdQ&MBb@02)*~>Hq)$ literal 0 HcmV?d00001 diff --git a/doc/api/html/form_104.png b/doc/api/html/form_104.png new file mode 100644 index 0000000000000000000000000000000000000000..c3efb24154d7b81c8e3fc4a1d5cc6693a7f4e12c GIT binary patch literal 294 zcmeAS@N?(olHy`uVBq!ia0vp^vOp}%!3-p$-M{$)DT4r?5LX~g5{R;w;Rb3DC<*cl zX3+D9&2Q+Rw`S+jOLt#>`M)ZC!+W6IR8JSjkP61PbEAct6?k0vb^8-G-u$2EEfEs( z=LOTdf=Zuf2d?HYJn-MYn<4MqE!Kjq+6?}2HV2xerBo~%X7irCr#iRQ=t}*oWi^a? z)4J5wPCla~-S$)~`D%8zVqvx8;g!2?Y|49X%6zlY?;3p%Sj1hP#(3s0^Qz^{RbS+D?|^*k>FVdQ&MBb@00@O*Z2$lO literal 0 HcmV?d00001 diff --git a/doc/api/html/form_105.png b/doc/api/html/form_105.png new file mode 100644 index 0000000000000000000000000000000000000000..53635e7d726b7f481d325da927dbd3cbf612e1f9 GIT binary patch literal 355 zcmeAS@N?(olHy`uVBq!ia0vp^8bB<{!3-pskHqKzDT4r?5LX~g5{R;w;Rb3DC<*cl zX3+D9&2Q+Rw`S+jOLt#>`M)ZC!+W6IB~KT}kP61PvC%?@6*ywz1CyoS)!+7NVtM;` zbG=WQ+M!Jf6$}hNw6$W(7!K&$+)ZWJpm59iCc};Qex8*=Z$2Dc?V)(KW=)f6{+4W0 z)m_^-^7e|lN4a&XO2)mqr(Vdk-9Y&2;bX5Fk9tT;xy1Ya4N;NOSaam>mnW;$L+#y; z`A!jz7#4lo^jd3#82R3+l+VkXo6LWc!nUV%CGZFP_@CN@iHyZz-9!EpKkd zwd)=(O2;iS&aTn_RLbx`c-hyNPZ$y$=fz1d)HI%BV7T{zsp=i8ZH1)iPf$>Ky85}S Ib4q9e0Bw+af&c&j literal 0 HcmV?d00001 diff --git a/doc/api/html/form_106.png b/doc/api/html/form_106.png new file mode 100644 index 0000000000000000000000000000000000000000..28fa2bc5ea5c406abe3c1a0c2e8e9ce143311828 GIT binary patch literal 336 zcmeAS@N?(olHy`uVBq!ia0vp^NavxkKb0MQ4>g#z%?$qYy{%Kjz zf#7@P7dsUnKVJ1TWsZuHeSc*3nLEeIp0_B(tO^Y+{hSzdUV=eyUhdLkUpW}~<9@mC oyFO39t+-14Pm_H;FT;*s`~?-PzOF0Jp96)9r>mdKI;Vst0L>hBjQ{`u literal 0 HcmV?d00001 diff --git a/doc/api/html/form_107.png b/doc/api/html/form_107.png new file mode 100644 index 0000000000000000000000000000000000000000..41af07f896553f5daa8ebc8a4631be1bc29d2f0e GIT binary patch literal 353 zcmeAS@N?(olHy`uVBq!ia0vp^T0kts!3-p&O!lkG8LRASaLR=af> zeevfyC+TMxo6P1k>7QbzdTJk^?EZ_!eT%yH&blZRtiygQKjSOQX310PRsFB-KfA@Y zseVeS`_rDN%+-Is7+grwGY`CW60_mff7+g;a|+s^atf3P~b zC3)>W_8mMg_uYK^bQ;5*P}!_>tA_e3v!|3VNv*C`Wt{hwS1_5aOW95M04Sh5UHx3v IIVCg!0J6}5)c^nh literal 0 HcmV?d00001 diff --git a/doc/api/html/form_108.png b/doc/api/html/form_108.png new file mode 100644 index 0000000000000000000000000000000000000000..124881dbf6815c24ca3d888e5096b855fcacb22d GIT binary patch literal 436 zcmeAS@N?(olHy`uVBq!ia0vp^4nQo-!3-qD*Z$rLqznRlLR^6~Ng&Ezh8w6spd`pI zm_g4YHou{N-kP09FWr6l<^QVm4euEk7?nL;978G?-_E@~>8OB!tGLkgmLLE3%f3}{ z)GJN9_sn%-NanP6xz+4H-Ycs$v@g6Y@R7kkIq>P?9=53PQlk^)`K!4Z_?@3Q2kh(i zx4T`H!5q;$>lRn=EkPaWvtj?DyZ!GlIK0-Y%Fbnv5YtS3J1vIcmRDUnS0Y=K{z4Uo z`S%&;t-0`anCH#8yuE*m9>d!^Pe1Kedo(vc q<;11s)3-B})UIn{j%nK@^plbMEqi1!19vSb>^)umT-G@yGywo+aGdD? literal 0 HcmV?d00001 diff --git a/doc/api/html/form_109.png b/doc/api/html/form_109.png new file mode 100644 index 0000000000000000000000000000000000000000..c4c4b20a108ee96b4d43d7e994107f7fe68ff301 GIT binary patch literal 462 zcmeAS@N?(olHy`uVBq!ia0vp^UO+6&!3-oB`m<|*q(OjBh%1Oo3W&0o;RdP~C<*cl zX3+D9&2Q+Rw`S+jOLt#>`M)ZC!+Qn>Mq5u8$B+ufw{y=EMw=CT*xav4heZ@YFed^mS#xz)0>Dj%Pv zCI{-SXJY72%h=j1t`%8yzWidE@RXmtPlF52^=cgL`}%lYb?c?R*Sw#!gZ{{~njOFN za=#nvg>BPxjZaJbZ@4tgFs`Lz?zXSF56_vVhG~e{v)uCx*EFb4ioH}-9`gP98V#?v z-D{jaU3n1m)~0yoU)HO=*E)lY%G6&?>tf?@_`fAlL!>b^Fg^I%rq4TT&i34Q-zs$~ zux0M2?lUP(`rDpaEPOF-ZqU^|-{xEn^>#jJbzVSpRa}?a`OYre%trx=>_Auv`^wd6Kcqhmpmt1n{{Jx|0 zL2KP7f17ryY?|6Io}No5QhgkH}XBjm&e2hJxdM|RiEmolWf8X14x=E6nkB zyH*{_dArV_zS4M&P{?-1n8JrvGv&lYYm}~dZ8hdCaGbPZtJA+F$_K>Pd_S`2%aaNF zo>dh0yDmR&_4;P-)}5Q?SpB^FS2*vT;qI&7UK_Ic#d?S6h6+P`BTgWMtBuZuqB r)qGt&Q|ISZ{{7{LSAS&u=l+NBqaC+``N4z`P-^gW^>bP0l+XkKq5Ab5 literal 0 HcmV?d00001 diff --git a/doc/api/html/form_110.png b/doc/api/html/form_110.png new file mode 100644 index 0000000000000000000000000000000000000000..a975afbd582e6143c6473f38a8694d401b7e0b7d GIT binary patch literal 798 zcmeAS@N?(olHy`uVBq!ia0vp^vw&EbgBeK1&wFADqznRlLR^6~Ng&Ezh8w6spd`pI zm_g4YHou{N-kP09FWr6l<^QVm4euEkn0h^3978G?-^Si7T4KPH^YdH7$N&G|Zc91G zvqWv>-R-3dr>Ngp8}|BvD8oN#hCkWd3KhgdZz&&hwo+z2d3J$>~c@YhTU0Q=%%e>OqmmRCOnn zxo5w(MxB^BGfd*=iN|ibPXa<;2V{G7FHLs8wbEC_@WSgkk*ts2F3Ya5tUfbKV^788 z(71}P+NPeTG+q~e*(!Ky-#h6jS(PLY;oIMrJU{25y*1(Bw*$h=vHtp}l=NR5ZDjGB z^yZoABIB(pTxPRheKC3Qj+^1$*%vGPid`S>lej0DxpbNSS=p7Acl#Z3lsA_DE`RUy zI&8-EsAv9WpGb_VBfKv=*MdP-c)ic{mFx`jZ!ZaoHk9{Z zC@}T3v=@2j_kYRDE}?7I@50Yi>~}f+rjdnV|Ayr!zuuK*__6RWqtpjs9h3b#dO@k& M)78&qol`;+0Equ*asU7T literal 0 HcmV?d00001 diff --git a/doc/api/html/form_111.png b/doc/api/html/form_111.png new file mode 100644 index 0000000000000000000000000000000000000000..074035ba861a8e4a58f0fc22dbe97eeb39830162 GIT binary patch literal 918 zcmeAS@N?(olHy`uVBq!ia0vp^dx2P(gBeJElK(RYNErn9gt!7}l0cNb3^!1NKuM5a zFoT{)Y<@%kyfr(IUb_48%l}pB8{RW8Ftd8PIEGX(zKuP(>9GMv&fB1r=>Pw>Usi}d zx5%P0-!Is7-Goz03o@ljSR4McG5l|NugIvMqACnLX$)lOyUeR9Xj|L@5X!9%Zty%`d+F0<^d=;!|8vt(0beS4jC z$Lvkw`&8>^EqLRhcY%Meyt_zkS7YkNZ8hCXzdbPf?W33bX`+p~yoOZk^r!Layf@r+ zRlU3p&Db8wyrVvoX@1Q_g?&>b%vbB~b*WdAGU5Dns;uJQ29=_$Ic(c6%{}VK5?8o5 z$zsaPcjsUDid^uVUHNCmapU_+lN2WLZkGCcN9nxm(*4f$(=)#Gz1Ulq7hA~W@b3;w z#;psRShEvkbrL2Xcq&+HB2;kkp5U2%W_|1oalV45Idol5o>+6F&Z&OBhsd7A;YJ5_ z-RyfWzI-9!oc*gf`%3?*H<6Y%mSo7@V76tjiLjJ==py`up+{9%WdhrL=31FJ{m!@x z`K&9CDH+>d*sLw5Xa0QWrD&(Cik4h5-sJ+@YuC@|+b3{rmW#{$o%J3ii?&O3xXNyC za9C|5k-GF*>XD~&lV`WG@=mzva#`Qj@@}gAlGl$vG8|aVTeXd+e9q5~e?CvjzO4J$ z=h2;*?|Sj|E|wWbBn_k^<9BkNh&y`fn%MHiXOnK!z2lGzPmA1>yUMLNfQdnT8K;c1 z%R83COIF8R_EBr7(XOgwIIwtb=b?2=1(aK#1T9*<_D~r2wqmiahR=TQ0`tEdIp@#y z>*x#K)w{Q@Hq6Xm*s*Qi0hgO6G-lqX zw%u5A!E^dsE(ZHe@4P0I0T50_aFbszk;tbJbq!vprP)*{(8 zCABB#b*@Ncs4x<~+|E%@KKG(W5$ijqU!oPio-Yu32qznRlLR^6~Ng&Ezh8w6spd`pI zm_g4YHou{N-kP09FWr6l<^QVm4ex<+mpok@Ln;{G&h@TqQ{XxB|CFWyN5 zUoGm+`zgpWd8Q8sJHwCJM<;EWCd62GyUcfjSi|zQ+otSloD9AFRvfV%&k1(wKVJY zqvNS7zFpg>ED*i#@50Sh=`FYaW*+JPcDqpQ<1A70y*6?U{J)vD9%b=$stH*M3Mx-m KKbLh*2~7ZV$cOO& literal 0 HcmV?d00001 diff --git a/doc/api/html/form_113.png b/doc/api/html/form_113.png new file mode 100644 index 0000000000000000000000000000000000000000..d0d53a49aeb9f6e06ba69d6402c9148144dd8625 GIT binary patch literal 441 zcmeAS@N?(olHy`uVBq!ia0vp^{y;3i!3-o5j4n+BQU(D&A+A80BoJjU!wu9RP!i-9 z%%JBHo8QnsZ_Uo5m+rp&@_$wOhW88%j2fOUjv*C{Z(|QmJFLJVBg`vh`se?By&EfT zlvLli99OZlR)Ozu!h41f?`>O{8U8)dn|i74)ywxGoF7CRe(spU_`sas^2~!LVm;iB z8&{>iICrU<@xbnODc>!v-i&unOby=mNM%R8`{JaFDrJr3nM(gQ-TJU&@zgytv;0$) zwbmUklw6X^Al70cH2rAzt?ZR)J14x)I_@9&)Z*k*&#I^5SyCw`cfLG$wPfC@yiGjE zpQybR^`Acd%#kIBKKYz@Hoenxce-7gYuKJ8{TVq&GFH4|Z@W5WO)KTN^jscS2`Z_;P0+0tQ#(}HuS%H^NHcX y+1fX34E*xT@5lXddcNcAAIGBzgEZKW5>QROE=mS6ak*DelF{r5}E)Mf3+(B literal 0 HcmV?d00001 diff --git a/doc/api/html/form_114.png b/doc/api/html/form_114.png new file mode 100644 index 0000000000000000000000000000000000000000..ae902035f3a8cf80c38ae4fc4fd7f4b42048fcbc GIT binary patch literal 694 zcmeAS@N?(olHy`uVBq!ia0vp^SwJks!3-ob?pme*DT4r?5LX~g5{R;w;Rb3DC<*cl zX3+D9&2Q+Rw`S+jOLt#>`M)ZC!+Qn>CRI-t$B+ufw{vgytuf$n@fVvUuS;jzaj6%Q(GR{1Nsjb-z8rDE2Q8yhqBs9W*0ppUH9E#`M`73+jQ=R%Y0Y8jl%k;EDgPQ zTlztAN?TT?5%ZnIv(9hsOiJC|a>0y~;l4n#g(bHs!<_}j|8$n_IvSyLfLVk0aK@W0 zRuv)E_C8Kq?w75Mn$J+fan@Mp+6moH;-?>9d9>5h;(%o7HPa>Rs<)@TKI&+3>%`aN z$-6l|aBp#9oHKD*<}A6xTy;{XmQT5qoRfP^<->{WKaLCD)(1UbP<-#+fy^6w?(hDz zX!GO1skh}Dgniyj(tEUeRr;*;ejUNDPVKvsa-6ZE_mWln`>E^8md$g2b>Q}el)k5* zwx!?vx#up!>qM3v2hx^Ly0o@^#fqwD!4K^Odu>FoY;nDjs-eleJBs1XgAJ3JLvpKK zE-cjvUON4%!LJM>m9#|uqd9yF#XBRCOLYJ7S$~|rMo6$k^EAuiHT>ti?JiCeoLw+s z%gKvxUatDN%8fB5dHZA*cjGGxf7e-7^LrX?z0A+~^;*cyMW>#m?0oud?*5yW3zyGW z%(W~oe7W4Tn@3-UaW#JQ4Z3>x^#3U;zSpOHy?d^+KA`K@s+G0g`lpn_8t;90`13D& z!LbjY_b|R+Y+}y*zQ@qlm*<4H08ooA#yoj|G2)78&q Iol`;+0A`OhQ2+n{ literal 0 HcmV?d00001 diff --git a/doc/api/html/form_115.png b/doc/api/html/form_115.png new file mode 100644 index 0000000000000000000000000000000000000000..774fd7481a13d913c81942157a28603545d4da08 GIT binary patch literal 1513 zcmV@gy5bk)b&t8~@z``&g z#p3nR_1l0>Q$V$Du%Z+!32Yji8d5p&tkNv8GIi4UniYk5 zwX?QD8B;XAixOE;?lX#K(|`ME3smb><3u&KU0? zv9n!Ny%Q~S0h>Zq^gu663t;6$la-thK(&G?8P6_@bFa`052$$1`pL|5Sv5^oZlM%j z9rNZm=&{<9%i6Cy^1B^PR?h5DRyJYX%Fbh!R%#*#tr|K8OP;FU$KDoLaUw>%o*!cE zm_EF*aySuk>uXkevrOZa@$`9j5$}K+LyPd^E};lB?245;D5X~iD-lIIvgnZKcGqm# z(PZUJdx^dcFETtd6xqN_R%FG-sbNQxm2+2+qALO=p~!)|W(A-UiAq#0 zx>l*WGA)V(P7mq?uh-#(w4i0#SG{*war!M>ho%EhJ$|IJJD?IxtNfo)KT+OUxk4$u zI#@Z9A#}6l$TD*%N|Up+BcSYh%l}`n@>-ZTm(_f~gGJTL3;URTRRtfl5<)ob^^9%T zN@r*v@e(|qv$mNUD(y%?vZOY1Q7bo4O0N!9GH!5a-FsuDVaM0CGK5V@gbWt;tET_P zigo!aJD9$_JiaK@_FRdo_a|_!&RhZblsHQw-dN<%S(d@UFpYOx47tu+0r->>rS$5Y zD>01Pku~QUAxpLMVMlwe z%ed`RE`4=v@ba@Z<=TldUZdTYQQu8v{psZ_Q!wKh#aqMa0xH-#>G9nZKo!cI{=S29 zdS%A_WfMmMW!xl&I(<50rDaEnc-S%JVw;?kjd7ku@33k1Yq4cT8bevhlc_90;9OEW zk_N_kRld%mTM|7 zX@L^{4q1K&<@8FoHE0J)j9~~BKtn$5C|Eh|XwvG#r`#)JVOaO{Ho3AkMh!qMV;C2q zW&tWOb<+aQ)l}ZigAWIf?wS+jv(|rt(($T;0&p$&?a*SyWWu&^aMHFF8c( z0emTwpR^$Ye8}4Ey#Q}g)jU93te--Y0g7d|x9S0C$xW2DSGQ3BuEnO_3(%L?ZDlgg z>!d~Wk&OV~mhU+6Lx*o3|7TDDuH~j8r>P+oGlhY3w^9Ip1>jcz{wMMm!iy@FsetxH P00000NkvXXu0mjfac#pP literal 0 HcmV?d00001 diff --git a/doc/api/html/form_116.png b/doc/api/html/form_116.png new file mode 100644 index 0000000000000000000000000000000000000000..aab805dcdd29bc543282a2c63207824ebd526d53 GIT binary patch literal 792 zcmeAS@N?(olHy`uVBq!ia0vp^^MP23gBeK9+fla@NErn9gt!7}l0cNb3^!1NKuM5a zFoT{)Y<@%kyfr(IUb_48%l}pB8{RW8FtvNSIEGX(zMXq>-4X>6S8-#$6aW9`$~)+; z4M?6{vQ+rczLTzA(|+^pVftf#N$NrPQm1bW*E1P*1iTEgd%c-yho5!4#g1R%XYxP# z-ejDUx_fzE&Evw0wfsNk)$d(#cIT94-G4l}Gj5-YxW-?-zwgrbnp)xOb2%-1$~Or= zh^;-j{M!7p&)Kz}?Rxa?^tuY(4;$}24_;ip_|3K8IqfrY;sS!_wFhUdV!OAYw5PfE z>Zy<<{tq+XOgQfMig`}R53!efqG~4arFY4GJ>Ps_xtFHu9Ot{+e&<{dnaWr&mF4i& zVwQC!4<7w8-X|rhD!-*w-EPeT#idjBT|XzT9WOOg`P9D&$=A5s3|M&Z?pH83k zg%3Nc@SxwP`F@G9A$N~0%)Zwp|2p}%$*l64Ymr;# zEbYA%*e-PRW6u1pTP3&O%zOFIwR*<68|ClW`#zsh->H}=m9}hBh~v+v|Ez)>Rqan- ze=Yeyr*g^E+4JNycKfy2a-5%d{^&?!zw6vX_rnUAGxq47-6nR@ZqDX~Z3cUa&6#5s z`$?@iw$e{=$|mL?(?4Cxh_?FvuD`06@lQjQhJ6eB2Zwrw$6G`e+$yeK3rgRfu6{1- HoD!M1vxubN>Ht_A%g!_p;t&Bipv@Ql^FjOS%jXEZ(x~#V|QOW*l>tof}^M(u$%zaBF*|-_z&8%mb zkr({lDrO#o&iCwHX*`;-$qsM_~r`-wxob|>DQG+GjWcWTm!lLpSpwht-F_&awj5JJtBAS7q>-AL>D`H+iDaVJ@V~*;yL|D`h8jH-aShF zeKor^_FP?$?bz+5N@q*&s;s|iQuHg)>DIkO zon1+(RzIco^rtL(xqa)kUYot&SNcoo&GmnjU+T$LGEsL6vx2G8+wz{hrCYz)tv{S? z`YMQ(d(xB#T^nB{*=Q`kdZM7xYwgN|eShtD`Z@8%_S{{Qo%}mn)35zqd*ke_2f61i zTz$&$*A~9@S1&2&g$v7jEXqDuv3RuyZ|16}3<1*(xQ=Qq?=#=MByG2za9Au;Fjx5J zHF5{9KEBF6r{-evXN3g@oT2yLZ&v@7{XzZF)~Ng3+CrskCD!F#Q<=8b#-r7<1nK( z-fZA`w5*lk!?`K9BXUKkW{kcXCvp0akw z85-=kvxg_XeSfaRBBQWX zlVZ!RY-!q)xx}C0L;2f#jDIebNhC2X2&!2uGo2;9 zW$Tm`^|GnZE<% Nc~4hAmvv4FO#l|OZpQ!s literal 0 HcmV?d00001 diff --git a/doc/api/html/form_119.png b/doc/api/html/form_119.png new file mode 100644 index 0000000000000000000000000000000000000000..bcd93ebd4d360c7f998caa9dd30b01d8a738ca6c GIT binary patch literal 310 zcmeAS@N?(olHy`uVBq!ia0vp^>OjoT!3-n=n$%)|ltF+`h%1mL2}Ie;a04|6lmz(& zGw6B5<~Q`uTeI`%rMoY`{9l#6;XP1psi%u$NCo5Dx!yvD6?mLo&)iqp_dmD$bp5TD ztA1BJI?%0ikd@)V{i8{Y52`1APy1qI&0wLWI%9dh^~}=`nKszEZCBdff9Jl{(hrVo zPjjvd^2vzJ%q$EP%-YwpW0`&0Q={Ugz16p^7wHsT_r5yMR(bdG-#2#NzOM1z?Wob+ zU%Kuq=jgl-{2%>1XlcoUQ)yaxYt-d(?IqZHBhxyU_Die$ejLR3V2!xBD)T?4AO4p? OzV~$Xb6Mw<&;$UM#BB}$ literal 0 HcmV?d00001 diff --git a/doc/api/html/form_12.png b/doc/api/html/form_12.png new file mode 100644 index 0000000000000000000000000000000000000000..47b8e4cf0a3e658a27040c4c22aee68e967d7ecf GIT binary patch literal 571 zcmeAS@N?(olHy`uVBq!ia0vp^u|O=&!3-qhayI`4QU(D&A+A80BoJjU!wu9RP!i-9 z%%JBHo8QnsZ_Uo5m+rp&@_$wOhW88%jH^6d978G?-_AXG?y-VEi@n(9qh{~_Z*$(< znlb55OkMA@h7~7HEL*wmm0Ebif4Otj{2#O}lw8<9NC!xrNw(yDAU%cgMoaItj0o6|q({_TF3Pa_7^_(D~kvENAEx7PzU#)VkcCr4gd?@Rw1K z;Ttc(yJkX85z8k`5)UeBja|)C+xGd*vgbm|T$?3*dJVf4Wu#SI(p*~F_hQkpMLDPT zvZiE*WRO$^JDtH*EOId;OXk;vd$@?2>_w(?+O3_ literal 0 HcmV?d00001 diff --git a/doc/api/html/form_120.png b/doc/api/html/form_120.png new file mode 100644 index 0000000000000000000000000000000000000000..7ca835fed9784073436be649fec016acf8440638 GIT binary patch literal 797 zcmeAS@N?(olHy`uVBq!ia0vp^6+kS_!3-oDZtWHUQU(D&A+A80BoJjU!wu9RP!i-9 z%%JBHo8QnsZ_Uo5m+rp&@_$wOhW88%Og)}1jv*C{Z|A-}w?u)bRsIP7hocYwy)V1X z)V0}a^4VEAn>rU7H=M}yU-(@A!2hIurEClGOW(*G2sT?Lk{q>Eyv#=YY5Kjoq&s3S zPo6gHUCR7nLhJlZOZkuAu{n9(teg8&Qs9|27x`WZ98eZB>AU&yvhdE(1eHfiWKw3^ zt!4ZnZJbaU=T;LDcDH7-JhPbEm%meQ2&Kk zw7@#;4UKELH!s_@rdM;l;kxyk*4J^&i8}M`ow74;#Q#f&5+-U#@#|<_E8XTH9(~IB z+GC6OjRC>N8M7GHtzokEUY*`qwIQr<2a|u*q9fA1`K#85CCvXiwT``D)6qNAJ>H%C z7Ol7YWssw9VE%*(tLIHQamO`Zl&twJ^1!gW-ATSR+f}5*`Bdp z{A8Nf_C}2l8FKBLzHa#y@M5d_a>H%T%pWf9`cz=G{IK0E|CQ%2TeO8rcDkL`SdjHr z`0PF_^DR4f*h|S@Fx@_X(#sg*ym>C*{$g)zub$hvulJl~d1Bp)xq3-)o7UbnTdz=gBQhj^(zA-?R(o$< z4z5)d`Fs05%OVDUseRW(ndfbm;f?1$9&@SZf62uB7AJof+ePo06sLMm$=>Q6wJx~h z^b8l@wj91)rT;bxyvbv_b7N_M$pd|+g{gnH6~u>4&v&}mV9#|VZvX8UA@0Yx|1$KI zX^Qav&=Fur@BXbDe5+w`?bY|(3uioCxBtz){hTZZZsr}{_3*{)0F(CnEKCnHcZ+qg z{ZSKO=)XBNKt|Jwo8`dgvUADukM#r?&fiuPak$Ud$nZn`8+TZtNcrIv>sdgF+|$+1 JWt~$(69C4rTgU(a literal 0 HcmV?d00001 diff --git a/doc/api/html/form_121.png b/doc/api/html/form_121.png new file mode 100644 index 0000000000000000000000000000000000000000..0a5a88d18321c76a039a6c437a4e8bf3e2157cc9 GIT binary patch literal 1337 zcmV-91;+Y`P)v0000mP)t-s00000 z0000000000000000000000000000000000000000000000000000000T0a~M0000G zbW%=J04_*fZ-9@UthvR~-RboIs%Nn8000E2NklEV$muF+9 zmCxb?<^|~sp!AezEj-nRZ>s5@0C1hEYi1Td2tRtITdj|2H;-`<<@rpwABHb~*G{vs zezbu+=fKejeL;E$8cW}!q~he35-EALHVa?k@VdOiroC3c+^f(;j5E%b@|BLvU@diMO{Yd4FiB zsw?VJ7rYkz5~T}%>23@qL$$pOGjc{PsPd5{(PUkzG%3`@Di!QNk{8* z;Zwhzj+)5%r17$9+dlQ)x#-B1`qrK?iVhPs}*J87mSTK!w=Hing4&h9Qo2YyP(T`FqrM&QOlZWW|#!VzrD8>6jzZ;Tg3vzW1<@dC32&Bq%KsS_~j^{K|K>KBQObFjdmNASD$dEkYnV-=lHAoVOiW- z%H)TBcO(G)X!>ygkAO6II-na0n?I!Vb^1-RJq1`bc})epLTprExP9k+-{cIF&1s(JRla4bCL5D7xPVLcOdFisn64%QIEM*TQD^FK zTyG6o-lcJYj5=*mic1@YJV`3`rmjWXaIzU@BRl&l>*tU|F(irqh9p4dASh}#V<726 z9ncMBvBk-*)CA`}t(`-lmD9@6Bb}!NlbWS=MY~4_%f*))HPeRu)eGU!Pp*gd6~VoEi}=-^PaJVD;+qtH1Ot>*rfapnr!n1~R<|e?%GW z!O2ERa#wcgoB?}z?>Hm@;ODur=w2iD$*{S-27r$lRyy*0JLcSZ;wz*Fpzz=}0GE*l z;m4sIh6W5nH`Gf`d?z1gpOZue(2a}Xr$PXr8*}ir!CwyEK)ys817R5o1K=|3fB*m< v=SQ5sJ_mrW=4s$BO|?k=OFLgJFCYB_H$o?iO-k2q00000NkvXXu0mjfwvK2& literal 0 HcmV?d00001 diff --git a/doc/api/html/form_122.png b/doc/api/html/form_122.png new file mode 100644 index 0000000000000000000000000000000000000000..3d72095e3a8f086ba82ee0cc50f4a7c851718038 GIT binary patch literal 363 zcmeAS@N?(olHy`uVBq!ia0vp^T0kt!!3-oXX5{k#DT4r?5LX~g5{R;w;Rb3DC<*cl zX3+D9&2Q+Rw`S+jOLt#>`M)ZC!+W6IEl(H6kP61Pb7PB+DR8*zFG!js^?mC+}*DBXH)zB}h&&^xCi*LO~mud8WQy}RdCetGcpnnkDQ zyEAU+ky+QLH;a8uyUJC;p1JR~>sC+TZc!T0U=-jAEIqc+Kp)=v%3m74f$?Hi++SU306X`r@g@FH26_TxMKy zYRTtA-x%(FY`OJDa@Nbg8k?%W9trFcJs#hk=32(E;jHnlyjbRj{m(CDo9}1zc46fx SnOs~53NlYuKbLh*2~7ZI6^%3i literal 0 HcmV?d00001 diff --git a/doc/api/html/form_123.png b/doc/api/html/form_123.png new file mode 100644 index 0000000000000000000000000000000000000000..ca28c7dc916af0fbd53430be6d12df1b494753bd GIT binary patch literal 226 zcmeAS@N?(olHy`uVBq!ia0vp^{2Hjtne*KIY z4^`&pyl42}J+<z3mv41_=M1>@M}{oi(x z02^XE>F%AGv(ww0C~*LTsw9>E0{j@jj{$rKGph&quGRrunK5s-q_GSD-^}`@*Wby) zxB|^b*XI0ZQ2c2-z_SJOjzNIG%_1sEjY%>k0M(~=x@dFVJal8)uaEVJ+kzRl5#YaT zeHGpAL%wEC9)fyM2F~Q^B33A5-1)JO5M~`q2yxA=BmGVuz?IqeUezD~u5CDSbv#}; zK>H;;yq|+>0$!isKB5Q1qL4Q&Bxk%nJn=K>r9M_5E>G!LbG~&!HZ1;ejlK5Nlwt+A zwgkeQVpRuq*`ua@2o67cnK(eFOt(@casu#V^E^g@>C~Ix`cg{`KfT@|TLyd2 zPcYqVFGF8>It$4FjWvN35GK<3A{9H?V+&gGS+sFccXrTO2{h~THPy2wP?JsoXA6Fg z$8_Sm30~MSJ`Ks=EKag29vI(s;i#d8pBPg+Utf55s(}Y+txnnuqS85lD_e4fiKkn< z*#_Zx2c1u-xX&-x_|wT+*A@%FvqkxtV)+_P(S_BtHJPsvmnD77IF4bw<_F-$4o_VI zzk7JWPX_UdA9-Dv$hj`Q2O&Pl#18s=LUPyj)9jq4*;7BNf)qm7!nO$~Zifz;vDR?Ou2~bjJOq|+F$1dUHpd_Vf*?7kx!L=~X-VJU{wSd&oG&5#%eKkwDb% z$eNCPNu)!CrchZV&1Dx0=;MSTt(2oPy)XFD_F3-B6SojMDY35ArGLdw?V%>5+2pJ2 zJw?BaS~L%ShOEbXb2{@gJL6?<;Ya9ArI>e2TN%Z#s5#4PPylc2#81-?x<}!((w|%l zyN6%VpOSs4zLvC4RY)RvQD4FJR)Fh7m}J4JBe(i2TOUUZ0lr`_^T%{+nLRvJVXZy9 z;3w^U#ZS(@PAV%Ff^xOS0-S4o_DfjOJ`;R;cnE)sADy3+$-a~(Kw~zpxZ72LkJuAG z*0qodKZmEWQM4Xj@S`A1eCIxXS$?$Hxb(cnh8)zLGw9f(S8Yc9lZei>4*2a21N>?;A*5LOki6V%RGmC-_~G#q{rj*Eo0~J$ z`cwwfM=^g09;!-yfpPc1sdS1)+(ck vw7us7;QwJG^Hsh8{Fun9`^gr7zry|jv%wxsWzC@000000NkvXXu0mjf0KY*b literal 0 HcmV?d00001 diff --git a/doc/api/html/form_126.png b/doc/api/html/form_126.png new file mode 100644 index 0000000000000000000000000000000000000000..88a096cd6f5f0e82c57a217ae57626308db17f73 GIT binary patch literal 287 zcmeAS@N?(olHy`uVBq!ia0vp^Qa~)s!3-pK&VFkGqznRlLR^6~Ng&Ezh8w6spd`pI zm_g4YHou{N-kP09FWr6l<^QVm4ex<+eV#6kAr*{o=lY5rR^VtkzCXeA)!+PR6_3le zLgTmFTzp|J@PLKk1G|66IlaiUr(3@#omnb4=kwMxGn&ogb#-_qrhZf7H?3K~E}&n# z$-p%y_1WY29$8aO)(!3AQSxuquasX|MdVsgqd>sIOYccM(|H%o!m0eT#^ci^G zUy=m4w9q}Dc1`m+yb<874b7%70sPKl7Q4@u9r^h;CmR5F1hBIfB*4M083OJ7B}ss5 zD^?PJTEHa%9BsTT^&Vw9^#JhJZdQ@SJHtZ#!O1fLO8_|7hg4oO1lZY^Bmu7N-aPf1 z&jLpC32Uy=m4v|tCzpIcpW8j9&# znbIhoBcYT+S4yAeoW@B7aPVFWCG|EB>-#I@l7xPez2dm&D9hs{o@?+W6@9CW zTPHwsr%{H`6k^`x@>rKxdQ<0q98-G4>Mu-#Kwcq;+IMBNX0N3ja_Y~DDt^ika?X+j z1NkjUfV~}QEq1>BS?h9>^!5_>o*9-P?98VYXv#8H?*t*rBzwXlON;eDl!llrJ6)rp zEo625=tN>8Qwg$H&U7yc>FjLx;wtH{Vp}#R!meIEw^N+&k)(~+o{K|WqUy}OGdD|; zodz-(WR2wz;v)YYb!(k%MgC>I1+cTy>Dooc&;j4yNCNEag_aA~CSUTyXVcOPq1t=? z4=Ip-3QNjbMZ;I*A9vfUizgS_CPxiqbE}*3(pe=f=6oaD8dY8++xwQ)N!Tub&lag@ z-Y@E6dXXQ7&wv`pQFqOf_!WYA5P!}v89RU%i~XPW zd0?5F1&H^LDu7%Tr;4{=GKk$06xLlqdwyntFsi&&2$lk2>bY8E;ZWm>{?$vD>sgYX zvt@S+rW5wL81JE!gUEv(SQ5T>Ef4ZKaAwDSBZI^0<&} zjVkFwMf-4GjymR<)5ANpvVJ%(7C{-x6traqQYx^AV4NP)st7_>(toc1`Y}s8hnk1) zNCNEbNXy5}Hbccv^wZt3g>%$)ECg6)+UCF{NQ=i2v#q?<#ZQ`J7|zzb0BfM z+pW`{9(>BYj6`)?V$@Pj%OLtE?^a<;%G6g7lRaA}Kyz#3styZ@DglSO$Z!qe(bEa+ zAQa|Fa%CVjv0>y1L6vLPNXAgO<|S&@0rs}F^DSB0z9b2-w<9elw9*<11hb)LG^>RWw*HjPLNvV>(-=AH)gDh@S)c&_HI+q65Cf}eRH*Y&9Ky%yV zu+%hVY3d>f#knL-eUC-nCd;YUtO&#>ge7L-q`{40&O~Jna4?Igp+m6^Uy=ma+ksY; z60J|5y?y4WFox658=6|4_0sOxlJurKHtDrwwY+-o*VYNZCtH01?d|1KaXEn86tChu zV+iohz9R{6ZPr!w3ADEg7s2YBUunnNytYi(B~i`|z(+I5tlHW%k^B0o6M!qbX_b>| z*dF9l@mBqLQ&@l#`;sKUr3I5+e*)}GglmO6z2K0ex)rlM$o*M~0gmR9Sy8O%k$L$m zCjgfw!sWuVSDRMx-Z2DtV_%X4xHcD!^HB#p?`xmU*IxubbKpPz<^tCmjfm zOTVZdX~ur^AV=s*mCbBFj2r&zGW|)=W2iZ=*0B8Q+8d8odrW4p*rePvmtpSpkTygl7)QkUNMRkjPP+#R1@nVnaB)Liw#@qH)TisZLy z`3agcS~uRY{I%=Ck?p4(nJ*pH`6sk_-HF6}_RW9fjAT0{+++`_DW+ez+^=ezdN1qw zq!Pm!-}(5&_MO~!^wr@wt>wZVCnc8~zYTw>r?>eCSx+e$3K1>%HJ^!C$XSt4>wDSifbmTFkwN3-pc|XWlSi z-Sp$s^cTB#d}@8MeogncV_BbiZEM<@f84lZJndlI{mZ+5i#^yL_AdPJW~O(!`pkcB rz1x23b5rdy_75{-!}$wlKmKda{*OENVMpe4P-5_O^>bP0l+XkK%Mtnx literal 0 HcmV?d00001 diff --git a/doc/api/html/form_129.png b/doc/api/html/form_129.png new file mode 100644 index 0000000000000000000000000000000000000000..622f1aeb40de5ea2fa7579fad53f68375975ad95 GIT binary patch literal 1792 zcmb7F`8U*y1O3d5Nk)ukH@3+j#*)k+S<_@qCR?)ayHMf1Nz9wP>|yMCWgB9MK?+T> zmTXzRZ>%+zGZ>WhDLmhEzW>1Yo_p@SKivECO~l_c;ejDw008iqnc}Pg090_AMbAP` zb!Y06=BcUSZ`fWx_5TZw1`^z-1HK2=H*Ek_Q5 z+Wrn=yG)bIuAB>=4<(+Qgr>=gH<Z^+KiMd0li6Y+}-?OrFRv{sTBr^-a;%is0sa{_@cEDv;Nr z-dp5!_xb^>3bb(ITeBodr$yAY)i+O$kqie)&v>W+&VxriuMwcl@SW}0=-E9=i(|z{ zFeOAkn-nWAiNXuYFcg(E;2`%#hhYg^ju)@d6bG5(PR zy5VE>v*M86VOxT`2yi?@HI%t|q+87@lQNcu=^KN9iz&Tpx}Abwi}JmeN=+PJ3mFqK z-XEUD@~oIcXDixW!=)&rvnr7aJDXL9k#_6#(oBnFn>T)0F*7N&?~+{Q5VqOeNe5U( z{Tidq#w%$u|2QI9g|`2sKGZ%_iBY#@5#bPks3_>TSVXf2-uFs$*~<9dVCqsV#;ZmB z4wwV0M!Vt2D7t^n0w&hItIayI<6b_~G}6+ezKLKj2h2E`qkYTk5ajoUOrUE94LJ#e!)dwpDiH!f{8V61eoQ|zyA%J*Qc z$iviZs*p#s_pO0E2Kj;T4HJ8oLkEC5LTyq9R1EipWSvW9#`C~NR z<0ZySt*V<>@bIv49L{!Ds7X}|9wuEjnhF7rz|j%_(|-NW+GDQDOh>Ee1%Jm%0XxPe z^D{_PIjzZno{esM*17#*t8XtywXep1_a(ECgQ2cS2D>x%#~ZwKG(297jq3aW{qF74 z=K*h-P5l!w#N{GbvS*SBq35>bNZt)`RF+D=tx`4|ejs$`F;!}OvG!piwo#f`g8#xO zu8g6@)KY%og)_w?gQO$^pI^&TSS;jrd76)HkULNDgTGJPmbuBE-`nQ!i4Biv+7_74d%byX`FNS!EvqCc4IG~?7;6nuolr- zcML_=@g$}Jb0iBG(t{yB8P?#8kUm~pVhLU%#X%PyI*M@Gd78$N(e))^dQ}${ELqU7 zjUzL{tcf{v>BYEbLIIyQRY>)T+&}5KXqLsB2~UOr+?^3KOZvz`p46bo5pt9DGQ{wq zqsyW_xm+vd#(WApngn6qz|y0b8ZETK+VEEbt!~8CXbano88_#wPJ+*b^OKywi2&vW ztBGG37?i&ohReaH+#xjuY5ui1V2{ueLBb3@11}K6wOVcNyYgJ8K-%Y(bK9*#%p^Zw zEmoh^$(B7wZ)5FBl>0}$0*F@Y;LA*1Qc|q7G;$N_PSGN3y9ryi+QO4i1{9DQ8^wr# z>Bz34SA&6r5np5tahpRei8fmO6ka^70|JP-nxM}3 zCR2u^$9`qVU@*Qw^zF!zhDIcTR8Bnny7UW7^wWf#Pb_0|5C{0VO#S39AavS;oza}Q zN6U?*jn=<&#RGAusA`B>$RA6)d=R2eA!xqqd|Slxw3&&heV1D7s1r&D-QKxT9e~hY z-a-fh(f$JIIo+)S0JU=Od&YfzEfk(lDHX?__SD*Z?aanOi`qypWN^b1x?uwd{uQqAZ#+8c4ZD-fL%k6i0 ze&p=ikiyvOi=Y4ewkqXk=rTI8+~kMbm*1~Rl?1-;ohM;i@skh zU7~zmH1gcekiBoG$IX40FZOd=u+eJize#IKs(%>n?ucD|=epdSqdOE=6kW@46K(R^ zcE96Y?o-LVp*!D}etajkLdLRBbLC0)Wyh?vL>{nazN>1B{$8v5V@XNLlepyFdsa7X z+c;^~VK)Zx6@^olJiov0p?4&sd%14&s&JhHrX^}uBB$lpUe*$N;9ao!ipHMkdB4`M nR>ycU+;1uWoIJm(p}tvu(Rr>Jjt2_=f>MH~tDnm{r-UW|L2LYz literal 0 HcmV?d00001 diff --git a/doc/api/html/form_130.png b/doc/api/html/form_130.png new file mode 100644 index 0000000000000000000000000000000000000000..cb95d48f25abc0657730841819e323b91f2e3c21 GIT binary patch literal 414 zcmeAS@N?(olHy`uVBq!ia0vp^4nQo-!3-qD*Z$rLqznRlLR^6~Ng&Ezh8w6spd`pI zm_g4YHou{N-kP09FWr6l<^QVm4euEk7FSodPb%gxALvi_VfYY#EQR5LX82M0E|UhqRsS+{7;I7}@SHk*Z`#MD zaZ95aK2G|d!EkEN^NZ^brZ;roi?U|C7V36$*(7d<-44fg)+I9G__>nVuJ`!$Ep5AA9Oa0)#QNY+x3z?Tc7oXz$plW<=3B0| zvtBZ2_ZwCwyzGC*qj4=YsOFx^T|cdkWiuC~Hf<_*T*mV8q~fCMr+nvKDD>9!lX9>O zPB+;tF1D@n$CG=VyRWk+aIhpCVLy=Ca`^DxwdM?h?{_dJw8Zac(%ByBT^s+8;e#LB U4v#ZW&x1nQ)78&qol`;+0G}?KlK=n! literal 0 HcmV?d00001 diff --git a/doc/api/html/form_131.png b/doc/api/html/form_131.png new file mode 100644 index 0000000000000000000000000000000000000000..3cab5b268f6c889e8d7086ac54fab0863a458161 GIT binary patch literal 884 zcmeAS@N?(olHy`uVBq!ia0vp^lYm%(gBeJkTYm8nkTMAH32_C|B!MV<8E&8kfs!D< zU$2Gm;bBMH@s(HV0!H7;uuoF_;&8?Ni7-zF8o|YmmmKBU&hUP zl>1!H5uf9BI*C$uwL&IM4c)`^hri)JTbq7^-Za4nn2`l0fS^8xFxSl5R8 zt&t3Ig1QHuPcS*4-Ny34aK`+Ur?>BHTRbu3@9au<6ZQ|h%jTB*usz_p>&Ca7x7_mO zm8(jzr+s%Dw4V0Tdh5E~hGk}PQu|qkcW;_^Mz7uVyzS#JC&{L(;q|h&Yyz{E?h@&? z?EEIRlkdC2eZ`X(cYT|hKPBX6)#uqC9jZ&UAN#F*lD+S3QV3^h?v1?rHOrP9N@+5X zTr_)c^d{X9pUvW$=1I-Parwo&_SP>oIhnpwX3zJF%idm2{(bf2MZI5XmD}?*gMUr> z`{dY!Ww{T(ZacYs%`DF;Ddv({8?!p2jyaw@volGp=g+*=`%dfbT2tviCs*?+YnWZp z+Q>YOwVvTlJJare-7{VNDeH_&yOP6?M#?`6om2dd@#u5+N2;IHX1>toO<6lzd+D}$ z`<9!iO|7rL%CEgtu|+^GAa1@!?j+Ur;>l;{t(kI!d+MbAqw7jpH(ycA_nYEUBD&`8 z%JOWfjCG4UPq0j_U9n{0QK9`oLc(WuMqA8pUb(gR{kO1E6Rn>yjEY9vN~>;EPibY4 z+j#r-QdeU=H}=ll$vp=oTn(3KeOmnHtYw6_S8s{*BP-2c7t`1(7X}sZs=nPFyEZdE zb$ar=b&LNW%KJZ`g?U|TU_LYOPPKFp-S2F+L-gC9?>iX!D4Ey_I)f&=kB2+XdE;ePn yGf~>~0DI#7&yV8yq#EoG{=WFTvX`N*qn^R}qsYT*=j7+0yyNNW=d#Wzp$Py~CXCVm literal 0 HcmV?d00001 diff --git a/doc/api/html/form_132.png b/doc/api/html/form_132.png new file mode 100644 index 0000000000000000000000000000000000000000..807c415705c0f523d3e39fe3e422a8684ac9b957 GIT binary patch literal 420 zcmeAS@N?(olHy`uVBq!ia0vp^)<7)8!3-oXMTFG@DT4r?5LX~g5{R;w;Rb3DC<*cl zX3+D9&2Q+Rw`S+jOLt#>`M)ZC!+Qn>Mqy7E$B+ufx3LGOH7oGQaImnL{Qtk*m*ryK z>uv3K7hCPCoWW__P|om!U4Zd`_Mfvqo^q{bIKaJPuRME!T}iO8Il~Xx@>|;&Eacz& z&zrZk?#Q(%`|2loO#gIf;kmTelecZ?KI#^HXGfH@zITSr>Zxn@rr*irO#Eflm*Hov5wJ%($TIg5p&9C=rm5g_8 zS@Ge#kj*de{(XPzPV6s{${T{_QSa2IcyJxhoN1jLwT(0C8ndH|)~l#_uU}?+#hhPj zc`j6#_k?Qt+qXy7?QP@w{(#{Fs@R?S3qIy>FVdQ&MBb@0Om-eyZ`_I literal 0 HcmV?d00001 diff --git a/doc/api/html/form_133.png b/doc/api/html/form_133.png new file mode 100644 index 0000000000000000000000000000000000000000..2cf3a0c098db88b166be9024cd636a22e130debb GIT binary patch literal 1042 zcmeAS@N?(olHy`uVBq!ia0vp^r+`?3gBeKn_)gjfqznRlLR^6~Ng&Ezh8w6spd`pI zm_g4YHou{N-kP09FWr6l<^QVm4euEkm>WG^978G?-_Cu#X{iQJtG&a4(_#1i=c;qA z$hiIP)y!F|=5@RFN&5?3JJq|N;Xn6*{eDSGtPS;>c1%(DxucEufw}Pe-382hPM(^@ z*`s`5{?vuP|4zEIKH*H=mF0#f|0@1vd!SaS^!njzVW$0cuecw$E~_)PVlMfdesOQ} z%&?Ul4c$9dT6|{YE?BqITkwGInVHcV=l;Jio3g0A{gMr{&506Ar(of{O`{PWDz@4-upm><6ie-QI< z^0G(EBm3{-GCbK$v<8+y1Nw z?Ne*C*dFzs;&b!poy4g5>hQYWg^zqAwT)(PdU2!Y>c)-HyC1(~yWzYwZly=mm#vvk zyT3)Gd|*4<=4WnuWj6QkuE`3VqOW`0wb&)jZWFtZxqbWj5N@Ay))m})yPk8f9Pm9? zz;Ng2g(*2FFS4BOH-51C$JMzCnftQ*_oqE&2!8S`W9_9kWqO}Yrf0OynDwdfkX*-c zrrG<0JyUP2^icoru{6!~d6jO(!b{KYIiKiTlacGWTH|)w^|KSjS{8&noi@kh|Fcy2 zF2k+MrFUNnV6dMkbz{?s>_DB{pB$Ec^WutPbA08xLSlEI-nGYzY^qY(lYjPIoL}Z1 zbtoultFigf^YV){&-h=z;P`ayFR7^^PoAcvOuaVATx+%3&Lw+Tmv6jWojT1S|5N2^ z9+A5VFZc}RuaLDXD?4tntsq==W1*!{kGg4t`^|f5rtAKh-_n-iS^se3`>wNPk&Qfy z%Wr;}!eyDJ`og|6K-;4GHK*IN_2P3c^F2^=x7?O{UgCjL)TX<}`K#~ACU-L(C@&21 z+9*5!}#kN)Ljd!Uu~QooN| z|3S>Z!wVQ?m;DN1a(w6V^Y^s`2JxA{RpM3vO<`pIpfY#!^wW3p9fb?dc5P|7SO4-l z-&_C6jWs~2@F(xAd=5`}`fbMZ_%)dg_kFc??l-Jr_|N*2nP-~h{#DC7E`xHmr>mdK II;Vst0AnWO^8f$< literal 0 HcmV?d00001 diff --git a/doc/api/html/form_134.png b/doc/api/html/form_134.png new file mode 100644 index 0000000000000000000000000000000000000000..9698455246b4f63a90045d8fc86a24d0d71b76a9 GIT binary patch literal 605 zcmeAS@N?(olHy`uVBq!ia0vp^SwJkz!3-q*FJ-I&QU(D&A+A80BoJjU!wu9RP!i-9 z%%JBHo8QnsZ_Uo5m+rp&@_$wOhW88%jAuMu978G?-^Sivx5R*_xXM#M;Mf29-G1EF z30pEA*sKdVDfHIF@6nQ(;S4|e1%e`3815<0v6BzjA-aN_VUL?-{;Tr%XIl9TAHRZg$bUS_p82#xa)P&`@BffZDJO0*JJht^TMk;rSzHBiS4h|W|m~@j$K@ky!al|x5W(Xb1x^K z4T*8uc)a@LB(W!o({&E_erhy-Um>?`l1izx{ieuoXO4C3T6T7G>{_StVukYX@FSN+ zl2_C%lPQvj4CFE^YRD*BbZ(KX)W(u))z1`C)H7e1d}H{)={fOxp8O91UWRvy*X*88 zWM+7;Xtjl@q592DnYX`JPc+v4T^n?p<7f6qZ-0glEXycfd81T4UlwZ45^WvTV+w{6h zSXlK1?&&Zko)BcHJ7RN4+aQ(w$RufnZ!95m8obz#gdeq$7R{~`M)ZC!+W4yq^FBxNCo5DxzSul40xE;ca+L;ul{|1o7$A7 z*eVu9#YO#wI~fm@OF4M`XFlo6H0k-8$v*=cbf zFMqT5xly{O{ZtG>Q>DK#)SJIaW%zHn%tn&)So(t9j6arhu)3VG=j)a};Jl>L*V*jC z-RGvul~(V#9k|6w*;@F(@rbzc=8zS07~X2`oj0Z0?m}(m)-L8L(el#j2Xxiu%Ac!T zz0c&@;=Q+w-tn5hsM-AXz)EA&FzJ*%$*xVg-YX-mZ*i|Zz_o3&)%(8&TW&__%RMN* zb1QpWU@;(JP|{k)mB0!!^CSFR0njcuJ)U4L-b=HvWpYBQMi zmfebYafdCSK;*+osdqa9pR9f|_5R`RO@Z4af~zh5O-P^S?Q%!u*r%QG%e|*xW6#*X hl6}km_e_79ey}}_VDD2Eb8!cSxTmY1%Q~loCIDttqqG13 literal 0 HcmV?d00001 diff --git a/doc/api/html/form_138.png b/doc/api/html/form_138.png new file mode 100644 index 0000000000000000000000000000000000000000..1457296e3e18415c25daa0977d91a1313525678a GIT binary patch literal 5512 zcmb7Ic{r5s*MCMt)>0@WC6Nh<$xfy0OHoFQeczeEUw50zx}N*K&pDrS?z7x4?;C1yu=2A40KlQ6eb*QO zjzQ_)P?lr#_tb`wHGQ~#U;p7f`uP8P%+&?i=nGEz85^1aQrec@nApsZ_}2c(g^j~P z=h77bI78LBd;4J^h?21w{Gpyx^Nq~eG!672vQBjTiH5L_vM07eeSP(guo{bw-VWP+ zrvFZ>@`C_6JPMT0kk7E~=@!Dg3JOwP%W?YoWn^~>*MnRHw$=da?E9bp{(lM&cXebS z<=P28yQrA~;bOb~=YYEAweF_)ti%nidvD<^CBnfZb$|(q zH>$E8#^uY*&Jo7lGL}nar>9>7 zN1LZTb19B)k23f&idNSlHa`NtEY@y2s}Ujog~*|b5QNn`;*^4T>e^a;OGhSb?+_-~ z?_4IN@n;B2n0oHoF(2uHIwLlRPBdj$>J6&xIZ*(VLVxO_EN3O;rBBOBAbxdR#+?~8 zJge7`tG6DU>&~uOpzv6b^dKQ7%5&Ie*0JBmloKeV(?NW;1Mx>Q3 zjlteq<8`3Qo$K-PW`FA+g=B|+FZW+vF)p1cq9C; zJ=jEb#wGzy2^w)z%!~*3O#ILj?`DUZk)W0{34?_@)nC4J4QcTB)I<^5f6F`6n(8tk zc?tr>(Pa-!$HX8s5`tE;VM7DM$mr4} ztEy>9agJ)?58NlBskqNr+Dou(&Vklf3T^^MBsc~umB2V7*3Ps=y;oeU03OllkV8?_ zbC?G2>R{NA>f3vfB3+RFEi^&KmzsZbH|Fy`i6$}R0(28H2pu&j=>{)!Vuf=-8} zsUVU#MGbJS-75(@E^_2%hYhJE*`FVNJhIhad;Q;ZfK%csHDOx~`3-~`dNCdyofG~Q zuqbJ*U>>0HffKN;xXE*k&hdgV0$d;zEwhzZd|3{dx;jT+V9#~rU6fSM#@&1<7zXJp z+GSidmezEQW!%1)vQ5clplhNV6B;g#xEHq`B-^piK}xZT;t#E{#Zx~XKVnzE{IuRD zw?x0TikNlfP^=~xR)`{=1~r;K;Fmd4OTN>HY7K_sKWNYK2Mc}QQGhNQM@yD0g~($r z#O*F{fas3-`W59E)L`fP!Xqh$$n(gmP`#+WV$U$;n6Ybv#EM;2B~YWb?`{4gT$L+l zX`PR}M89LRnj^~A`zv8_BENH`f1LK+9dF6^zq+({8|PugKr%6(i~Sc^dAGMh_|AO^ z89RI3E@dd!-NfTnP3N^dlh?wfTBt(MP(eVgxMyzwLKmeFXw)lsDOhs}G5C?PlnTZm zJn`mlQtPDVs#QPQT_b$hOM{I{{=lvq)Q`~7Awdf|Hj#?P;q8gnSGc)JMu~5Fp%`^& zg0Y&|?Af~bz=}rp+q(6y^Y#(An|iJ974j00tF~|m(T=AX{{-|d$j?QPZ_9fr(>3`+$-eUM$H(oQnH%pW51yeceCs!iL zCT_ZvrL|pYGOIx!nROMn1@q`>Kvb#f_x2XiRyIjL9;jVUdlEya+|c}EnkY4kNYk$Y z&-7jmmah4I{Ap)V#fM}}{Ss|&J(h_ci!GEmeCxteZj>hhV}f5w$elTMStY>A@Ax8` z_I+2gx<6OgHQX$Kusq@~STnY=Ncipx>!hNKkFr0sWFj21ukjj4M@Hek?*v>kp!$Yd z;~BR7gW1a%{YN0NQn{@L67Z`r)?GXZ-F7rnpa~c3T*v2)_IpE|7bZcZV{UI|V$1(I z`xCurzF@({$@XKf`|0i95z%c?8HUw2>P_7G=DKdt6}P@j?qtUa$f-nLU=~}-G4sDz zxi9|2AeBFw_xnX;glIl-SB`^ZIr`qH;1lHb3rif}t&1<$7%qbJ%wtJ0%o zN7}%hU$cnr?e`fUHoklPc&2%!g4unsuak#Rk^uKl$cJ!$wM~5I_Pt?2y|>dlMAdx; zEqLceN`CX8!P|s|c%~I+53HWnkIJ)6iBvV;xDvvwpRJUWq3 z`TC*U!4`~9*>5Ulez_Si$v9{&mG)i~Cqh#YcB;(?A`5$zv*yu*TCxdTov z#K9$d+7h?MS}|;gvs~lC_uq+=hS-*aC3q$qvK_@eR@b?hH~!v_?@$n4~r{+Ro^_CIx>j}2gmvl5#%1G^5Kl(*$r zJ-X1Piu(;5Gm_z(XI>j$a^u@1Zc_DObPox7DH{d<&XslJ?xlEvvK=8(!BQQLneL3I zbk0CzOs;Hy`5K{9G1H#Il;<+jmC;T=-d0rssO_4V~Ni8v}QiNA+d=#R=FsNq@ z!x6URx_LpqFS)D2AsYb?bAk=H1;$XxGl6yAKlQd5KA$1Av5%t1iRhq|=iM2U^fbnDA2v~u zelPlI%S5MJ?37U|7dG8!c2fx4P~#_|$z7CuuJf@)SEMv*4j#QN2z9E|DEEcSNxv_E zf%eqMrZ$kW?g?#Ymj0ylc-bI$Eu^61Ergn^G`29YQOihuEX4Dw->@)^a@_d9;b4u2 zq?&YP=r=b-+^8pA;Ic_MQg!U4J&Ua&X4m9Nz&__lhV3hR7L5UN4^3>#95w`#o)3)y z%hYT%@n_Wd`BQCV{Ez5505V0_kAt6FCTy8`Hokes~VrdIf|J8r23vfhG(4(#l9v zJpug}xh*X6&kKWQ3VnNB88-NI-njW(ZAS8v@p_LF_`)8)1>qc=hTnQ!8%OfN76MxC zWgGT!DRO*$m{|X`9Jrjb-S~PqEb;&;_ktvPR=Hw8ZH1KB?#dYU1Qf z|Gj(H7~3TwRn9O5bgbP`?Y`OoA6FtiJIhRw(%Y%~RyU+?6)yhu$v`9^#FM9RRo6A| zlHyh`WM4RHGVex7NSi33I{y${M=!efsD5BUP@TyRTd5)&)PfTv<={n_jbgWSgSJ?^ z3Kls3r!d$5$uyGT#1&UoHaOv-N)TXGwi-XT;#YVM6ly+w?+vldld1QH907dctCfT0FP4!^PLgVh5b52(IuL4%v-=+n$Y0C- zZ?u{PW%KBpmL>2Nj>AC2LEpAf)+|c_QdP`iref#F@D=p8&yG461cakh)w&l5d>^ay zhrHbmn&J_ogL^%zUDgJz*eOe(cCat7~4(A6_~;{Zi+etbriA01nIZ5E!{XqGO6{ECOoiwaU!X8!KhwKo^;cHcT5L3 zd^Ia;4Y?|zMr&q;($0|{uCy+;<_95|M!GWFM58|`MvOsAoYbx9$Yh$`GW6_;{&VRn ztgyLfh}n>B=zL^#LV;vmlBo2hw}*nQIYE<7DSv8I2?cFc|DeBww|!ES=t>tOy3dqQ zrj*4%dkIR>y4upR&{V0vtmH9of@R#aQS?-1h4pnkz5Em`BddN)a0Bg$84k9)-Qg!4 z01L_KsPImc+q6Is5w>cqP{)pSmb_^G&F;JmNm-$4W`)6eneF}tKr1Q#nqkfiFbuQzrw zy$&Mkq{j&LL0{M+AJWEvlB8=c=tW8-ll!uig^JlN{XUDz>c;v^W}k267FKI=5h?F( z@7|u+$h|S00JE&+Bjt-qkh^dV&e`>><1^b8JIt%H@K8lV_M!alUwPm3$ny)?|MYd= z@~r8c0!!M?2f=2hVLjYSX@j{Rm4b_1u>QsMNaK+xM)NQ&F|)!+3)~t)pgt2!N>hKYci z7p~PT#2o}w+K}CJ)lJ#DXOONFRzCje!+ywWV5w@!lvm-kP06lY8N?~Bn(9NjPuvT@ z*Hi_W;Z=S7{k%V994F~h^Bu6(DDPBJncM;#ZcOO}DJ$`=qv6!WtSeG_EJ^%`ISF;G zeXk-f$d=Xi-~K?<*%92OG7+l2h$pAxb{pJGQ(SO3aG>v6tl`HlU6!jEs0KAPZq8|1r6D(5F3wdw#( z=DpJGI*U`9xfd+InZmPm@f)V65(+mOw@U- zor9_sU&jV#^)Hgg2wN)NP8NVV*T`mmEwT5^p@?#oiD$;kXny3e=%yefO z7|o5bLNNK@M4-0%MPt223ywSL)}XE0cJgc)b@|&eUbjz85~XL)i_0vb#}v2E`R>nY zE}uJ-h8aiAY`i^{$-0TPHamxx%VO7wza*rC_&;wH)V3wINgZLttT3Eh^Z^wz@1e_z z`H-A{hHg-!Yx)=JYTXtuW5OQXe5RRJp7Mo!vA2SlGH4MHW$D_pp!jtzK#JeLEz7sH zxYh4qNUk<4XgK!*jkPpk!5*CH?bH13l%&}pFGJF)Pr&1CaY&0BTh}7+29jCzPuvCa zV-fy-D=IIw0K>}YChFxT!z}I{e^GL<)b_LQ=(- zvF5=aRUj*{g|KV3)TqU`LMGAA#%d+J-5I7L8JSIRy)LOTuJufxq(&$bte2^EJ)}ry z*}UbE6Z$WV_98YQ6$w$JF=6HXmsA&7BP5iP&bV3vMvdu6rFsGb2G8e?LA~$IqX#BV zcz2X_w3AtVirMoA4DvMaDr!^sU=%%w)_%IB*T>1HTv@=I!|q`cV&3ofnr2HpjT^ce ztJ9!aDrw!wHtf~rg~FInB0e3Op%V6!g^u|Yp2lXOR+bAh=&8tmG;PB^fmJ^YV{_=y ze7)XJoZznWveW(fnOS=Kmi^%Tie^>d8&$48J12?o3ug2@fs?#mr*gxpvyR)|Z%MYC zy6$5e=;-yB+pN!kk(uVtGCazTsjfO48M2*x)KdGLGy^tlKq3eElGQO&!qYoU?|zbE z>4_Oy*t5C!=xwLX6wSjZjIg`C_lFMW;#h=;OYT22W$w6ROMYrxq&wJ0A<^&7ab;}S z9Vd({`AZX$dNV>P4Sa?S+wJ~Qof?TiqhSy&)*H^={P@0F9X*tuN2-it>rrma%oLRB up7N#b@9AOqx#@_hbQgLnM!y77-RE)@NnzQ6!iE0cr|R4@yomFf{DX`_5qTRm|B#vt@>Bgl)q$yD6d;w##nC6~<4}_{q88`-}MO zMb3HKjMC=()DAWL#HKhc_r{VRvE9-A3%*Qv+st`?)8hKd()zVO)~5aN`e*fG$+-`u z|BD`Y-<H*oKp`gYk=v-^2g`@G+MWBB%a^4p18HoiW! z=YFR}=Q}^y%<{JrXKAL*%}SNHJ$=(l7x@`l$Gq1s|MXSv`P!nVU(^mptrw2@Vo}Sq zBTD_(fh|XFD*komnT3Y+qN@nP$W>}sJizSqqt3eyWeId#g` zFEf=UgidEP)c1HhMJPMDE920H+}jq?7av%x-!!3O`lc%#40dY-eP_IxVP`AVQBxi9 z^!==L38oRB#BmQ);k=dS{iN*Vutl1`XQTw`Ax%h*FX+F8OYRlqYo2|^exqr*qS>DnS z+|Cs|FC;H_S#-Rr_J8?9dB>I*tMEG}=4XW@p0~Vo32F_x)|>D`_;B(XZif50heTAH mxV^pRbAQ|aXBP9HbN?7^-taQ6SK3tzN;;mdelF{r5}E+DT?;n= literal 0 HcmV?d00001 diff --git a/doc/api/html/form_140.png b/doc/api/html/form_140.png new file mode 100644 index 0000000000000000000000000000000000000000..3f40acf9c15d3c1abc044b95c039f7cba851eebf GIT binary patch literal 1752 zcmb7_`8V5nAH_dk3`#9!s>n!fsdcn;(uXpQ+A}pF5<9JG1(Oz!EgX)j)K*oZ7_l{` zw%FH_qGCx0LG2x>wIov>`!Yhceat!Y56nI1-q%m}r}sJUn{1D%Z7dv4 zn0{h&QNfe6Fo+gE!6kcJyyXf1mE2I@{oR!gb->_&o{eW(}*t8RZ{F*bHB*7g)6!arJP9NBB)>fe5y0a|B1` zuK{KVOadHd9LiV6pqCB%eA`Uy)lhX>yA_`ej^xN|?9RvKaxCTJAZfAxIGQ^T%4>f; zPdMFBVUE{0#3axEFA(sfQeFqg#EB3mkcz(@m#a++iX+*-#$c?!fQ8@XCXpJC>wSKy zFyLZaA3gL_ghN^JC~~I!hAqWc%Vj_aT)VVHY1I|b)R8oNI-IY7NQ!yt(6*7we|R4@ zxa9t13R~DHBL&`F>7^wH^v#;~i*PQw5?}Wr-_Tj!!902Poxau*m7McFNor@76Dx_q#$SCMOU7Xs%9;j3sfvrYmQ?{?T1to*JQb*3M?o*U!?Z#e?Y zE{`IKroWDb!Nxt0{Nkzb{w>4>9@))r4e?Ydp5l`_LdYtOP|4Ic7*{Wndegc+$KJ_q zE-1-bS%t8H1GiM4%SnZZ*XiWOJm=&!=QE}lI5iMWAYKB7uE@CEUz&nc!K*wW9-n^d zEe8$?b0?nxFwFZ=*2p7i!ZTgE`%j!Afa|s|AJ`B6^)c|V0C>Bm3I`_5Qh0H2OE9(; zV!i_l4+to#%6p5Mg#EX()FrLkjSsHyp*>Qrn27DJ`b`eTIU{XuyZ#Gj)-dabZgyEe zLZKBtY9GrbQxz(E*$s$Q25y;B8|u-qH0*p+nmZmOlh_lf63Qh%LzZgWYRQC+YA&AJ zY;6=k^q1*{8PnCG=$nFy`SfC#EGvyU5NE&G!5wx|ow_T0H+ceiu7gLNoAjiBt--i1 zi?)Kb9HR!h04D5nwlO=Y#|8a_XqS2ahNnX=DH4qDJ>ZrE*sdr@FJ+%w#b-tHKbJd2D-Xn zDjfT#{=nR?W)npNR5EOv$QH>(D3FE2?K!NTQFXPtQ(Ea;!BpS%Pl;42x!?ZB2A3_eT(hVG<^oV-Sr#Ffx= zz|^_yU&yVzd#xxTJV1b1z{rT+3-DagJL4lo3Q>lbm)VXsqqBj0O)9Em;{)+^`H)Mp zl>y+72)BG&YJ+LS#zD;L@9+1+hdl4O^?4pE(7ZelXhVu+44u|)wW!MplQhAP*==M4 zW}X!t{}c8smijsUgM7~;X&$Ei=ism`%t1wdHY*qRp@g?5X8OPmfo6#~ZHZ}OA3Nyl zc2leOvawcLR-2cDS7B1?2hkZ}MOOM2?NUp7O`kMS#qrL5@osr}icOK031o@E=5&k^ z$B?Jwurlz>s&+Nm*Yx2|#WLUR_9s3q?Ax$MvjZ^sIedru`y=lQua-4PGLEC7|Ft%~ z{>lwWf|3gHX_PD1){#1URE8dG+di(BfrEiKUBH{JYRHMd1&YkMK(d{1dI9Gd9U+jBz!QM`9Q6S0lRn6{X zWP9j_cc3*{mqf1$<0tE@yEsgCS!z*AI>+-g!C3^fHzmrBgy4vZl;V nMBQHGE<&`&HQ#{hB52B3IxYS7_dcO5F%~suUUB~iqX{Z| literal 0 HcmV?d00001 diff --git a/doc/api/html/form_141.png b/doc/api/html/form_141.png new file mode 100644 index 0000000000000000000000000000000000000000..793924f83293ec91a1f8bb74cff1cb0965058bcc GIT binary patch literal 2047 zcmV0{{R3)FB1L0000mP)t-s00000 z0000000000000000000000000000000000000000000000000000000T0a~M0000G zbW%=J04_*fZ-9@UthvR~-RboIs%Nn8000MWNklp*|7}N- zfk2i{diiJOA{<137^ze$$+rL>1NeWm0XUv11N_7ya5($p%}apyEtL}bkAaGYwX8>i zR`f-vqpkvuryCc2>jCbpc!Ic4e^EWTv3~;aQ%h~>@D8rr)SMh;#5aBRGu~DK$J72D zF95d|B~ON?S6GzJWcU3F@B=HUIsLJRY2~O*_ERZ#(}W#c1su<)Fx^95Ej8b$J-4U}88PIS(!3lYQw*8mw=8wVM@@(U4c-yZ0@IhIZmKKO@?g-09id zJ$j)mGg#~N{*p+olxfe`x4D$%7V9!dN>&!}=r6A8Hb`W>v3kgl+`29=`OjSRt5wY@ z&RPBr4`k$*T$`cVi>HpJMh7{s_}b{gve!Ioqg{j{cNl1s&?9nngY}nc#sncu+s&#N z@q7)nD(ujT7acT$$9fMqo>~#73*wfmVIA7gpO=o+X~gSXEt0)cm*pDPo(m{Mnpd`L zL=dH?rC*Dh`?6KI_F!)Nb!`OawQmpg0(fG>MX3=ehe;zPnNMQ(6IB8BC{>58;&w7W zvLxc8{u8Dt3=%ygn^U^w9fn`$rO%oJFkgmMuFr|RDj+3WwQZn^ImpX&YE0j2FX_u- znNEF3MVXJvxp^_fLy_fsbPMprX8FR$Mamo2)*POE zvb0)9jR)|x`DN+4-qr1uy9>@<1QTXE^l52ht?jA$_Eo}|;Lyzb@k}-?tHh1~03Ml} zhcFqQJ$e>l#TKF|)I=ZDpE4AJXA#^^H756mBdC;5SY_5pJ-VA+O#o-pGR=zMm8>Z0 zD$CSJySj~trqkw%)pCwPsbCe{rm^Kzx1pZeqckV$1o4%vXIP!2?xmWVKfqJ7NhDf2 zRM|l0waT&ga|a%EmZ@X}y9;eNb@qAe#FmAHa_AZNOaqQlSJm;`8;r?SJzLpVmDL_+ zR%&Fh+cq=U5WdBl`e$n?QZGn<^Q5utL_`$=GEQo^;1`gOKHp7bzKP$qO^V-G+_Jkw#XgYPkI92 znMra#ow0`v7vO<4mrl`Ftg8k9PUc_jO!@2%;M=BK6~L{fbn4qWjw*_wmjU2xGC=_T zvDLqb@&}{=d<@`Y03QSR7{JE>p4q>cz0dYf;ClK)UJMoBD|1a4Xz%b3@P(D31truT zmX{8r#?{ZR2w#3wr3T?ou+ruYtJ}!}cx0}v7)!i*cvXxhO%VS;13r=@WoPm7sBp^S zQ=Y?+t3CpUbKF86bUp0S1-Q4+rdpfQpaleY%i=Pd+St1?3r^uGTI`~)Gm8+NRF+n^ zW7GE<>>xHQ0MD)H|E)+f4CDJ~htUrgn@YRdluse6m(fN-L}69|WxZR6bfq_FIk)>g z^b6$_apgtkTE3SeyH?O<%;*?*UKONo>3~%p^;R_|o}-MUao1*O>xX_ggnorp!j9s` z=zY7x*7{$z1~IwHF|QDM3R(51?JgtNS6QmTHVv$OB$@1?UyV+wi!L##{AL=6Ts4Pv z5Ls_2M0ukaT=Yt{VhtT{?YL4ngbpuy%S~Yv|5mP_V|BHu7peGKV(T28x2iFB84}aV zYiV5w(;UN~yW2H%ez}44dg|g|OfKind73LlZ?BzzR;q1)3hw?%5>ij0m)HApuZfJu zYik1h%IcEHr?sT=d8T>`!H+ht|EZ{vbncO+7bV+ dpaT4<{RckrF4*US`Az@;002ovPDHLkV1nqW>*N3c literal 0 HcmV?d00001 diff --git a/doc/api/html/form_142.png b/doc/api/html/form_142.png new file mode 100644 index 0000000000000000000000000000000000000000..9e9153bd785242e2a6a9dcafdf0dac27e95051ec GIT binary patch literal 8351 zcmb7~WmH>D)bCHwLXaYDkV0{n5`q?aa47B$ZGqzMTACKO;6+<36nD2&aA}J>X(>*y z;?|o!&${dV@~*qq&4--KoY}MgXV0Ewelv;D(NZBLrXvObfK*LYQ4auc5!lbMcW|-q zJ7R`@*vlgw4Fe_Y_5bT-Ci?)4HMr}er=<@Fs9L&*C*@bR^^PxX9sen}uiXa#CNece zIfDQYCU4_;#Um2sB-cmuJ%1Lg248U4iWFh0xTEUfO)^`8{}3?YB0vLxEdT{*!+TzJ z1%Un*ul;E@a(nw&yXPnKkv)|5_FvQUcXgo$87zzm zs~Jck5@8T(=lp!A!Q#xe|`MPV%gNGT&?o}$UW2$ z0-H>`SLfnsIphzC$9J#(NkuwP`j$Qna&g1`E2#$zsmutWw#7fVlZmJ1aICZ0vb2|{ zAh&1zEWRJQ>{D)7V~zV){jISDB1N#1c)S7z+Ed2gGM_nvPB?Y_nD8h{C1hz}63by; zs*WlUW*P9>v}Kqed(G!UsNd90>U(_xYq&c9I&7PMc06e{F8wzk2eMBM5b0oiRVBK{atp`cNHu|OsVBn z1I_NX-BV2wVNA<{h001n5hIT;Vsm3|4XmdVcvJ(=6cL~2X*E<+y$9fU*iqeo)BN4W z5;vD>>RDuU#w)^F8(!7R>F7?gIotO}AIZIX+?9&dB8>>F+V0eoDDXO|&uhS8<(h4~ zt0`*f3Ad79N^EclX_UW{Gbi$dQ*m%pr+4G;p5`$P>y!~pyil+n?BN+$)PQUJc_9}o zdJ@7rpvBm9ls8Ftc^>DG6C(4keUGru4h5RR4^FLHT9*N%zUQVenXOvm+@&#Uh)~dV z=dhic6{l5c<1y^w2;(JlzoGeWOeXriiyO+Ia1Ed%#0(BqTF`gvPv=7}pI3ON4B0Gr z-c1&U>@y+z=Z zB%I{m-eqFlvZH1hXLkk2RsU9@Kc5quoYDO^IYLsr#F+j~-hUha&wTmciU&nP*eoYO zk-skkZrKbMaBKm_z7uQ}L@yqAnTCxaIu0fg1PF47hs!>>&xSGu|6QBg15whP5FMhgpmZ6_c8FOa=stmUf<92Lw)&u0?F&A3zg1J-50D z2Y`?WjwIFa%sO`uO~M1+$a+56l!g3-B_A5C`8w_VYV3UepdvOC8^Gx=^^ihos!7(_$VR zwy;%`LyC`jxaJBES=husw|V16KWkZldrh+a?E~@6Yq(Fh^py4WU6l1NSNL%Oc2-D5 zflu7Ij5S;5MvkuVOx;Cto85j>gmVT+8J&J`S=yr3W|!$`)Fej+erSC$gJh5KizKD6I?4Cs#K@dAZ)rI$><}}GbxRZ8}yzy z9w~Jhmu!_ETMxaEk>&0T(kt#}5fQUYcfIpbBPUl>g^I14i>mG|*w~u!#KX$|cgy+? zlF+YX!W4V}%ezyF(Ch5!+X?N+QZy3$%)Z1GEB+<4USA%w7V%h;9YvZC`IRg2v?a(gh?vY1IOYl$eB|N{vmma>dT4@~b}P@KYMVEK*-O+E zF;y6}=o*Guj7z%U(^})r7TiYG&l~>=g;NW!K3NE`Ho-^7r+(eGWA!`UR(Il8XG`Rt zT@tDL5q+!LlO;u5U8&DIPXui2CiL@Bj z88_a=ncl&Bv8yLIytn+AF$Lf9o1q+tcAv9J}%OURxQL_#x8$5 z=KvF0h7hay|Dmxu7FWAS{6|f?kJ`|eom3-kT+v#?hrr}4t&O9Po#ACOQ{0c*KU%BL zrlatBPd}Q+2Eb&Bak|)47Y5byip!#>vJwG*uaD(w1W^-3PTAspW@QE z*Jr98IPqliI7rG;*`^?F7c=zD1c}Bk9|i3%oEJ+olG^9tqM=K4bN%>jZ>$B^tS6tk z@Xz`&QtJj4_|66tlgukLUTe;??QeI{v!89b(eF>YmW^%lZuJ=i# z8iVl?T2-*D2BGr&7sRNfpS8yo)cb+Uy+G@%-X+(-#UZ|2h7e3k`cx?8uY7;valVwz z6SvJ@WM;BQHK*A>CQXak{C|))J0uiMi6MVC^d-#C28Xxkne_+QlL^Rt&og& zJW$6DVXPdsq&>u5PV99}I!&&R*Ph?AO;6m2ct~G%Hhi>I@SuV_dn?l2tSYp^SZFz- zl12FFn|!!}!5Gl5c!=3f7VWc;PK3jRgiagDHQ44^$WGrJIq9tm?_fq}^dn-a&AzE>=x z_4N?T*f~)%4i;k1<+fJSS_rIz9u>u>JH5+@881(c>LZLd@9{$#8X2+wvrEe&ReNC>Js^PZNn4@TA zSy!1&Uu-cn+}j26i!en`f5=}?dc2p2Vkur}&S7)onT$W~paoAd^%s#eSu=#$TeI$7 zhuHTC0;GRfQ~@?E1(GsdavlgV#n90z+rVtWP*bm31MyATtBHRq1=)Q!32IfUyb2@b zv#Q!T26{i;9H`nk*iJMiS~^5kC%A8s3X6<%c}^_M|7`L@n#Ubi-_hfrZ}tkWN$ESr z5S5*D8wG0&(A_35l}>vx4a72S=(F$NiH!aJ9iZpuO zztj%NBbLuU=Xy1j%KanV=*MIXvX9L-C!~i` z9*UQ@?L*r4Z6A1$XvSx7czN|C2N_t~%ZV!IoY9>z}%gZ2%Iq+ zZ4G%r1&o#`i)G!v?kRdi$bNs@<6wM!AUD&^Jm6TXR`TZVr0+tl-^~-FhFW64(eQnC8ijpzpecGLasTxO6T2%wf$UcA4}kT@uC%Vv8f6U zD&G+CtZqA!X&Cne=;#uQ2edsD5L1E1KtOH>{@l4I>3a@as@oj+t^#`?eWYD|rvkzp zocSi}u6Onm&An6O6Hlgr72xA77u8_o#+J?CILJ@F`->ARwq zT)RbW2*RGDiz7C zdKvbhw4xcr_)k^2tt)StS*0Z9uUut%f;qQ4ddSE&88@KXn{U9gI-*P-$S;~p8xt`t zOPdbLeB<)@WfarQY7Smo%eOM&l*qA|f}<~L$x7)N>U5I7inUU{ z_!>U9AyJaNwUxVUPUorK79Xy#T2H5=vvdox?j;sXC0L+IubG%8?jVcg(E z+{9F-QZnKLg}OT4VE%|^M38xXVBLTgrQ6pKpE}zK3N+ZI@{$y8+bYD8fajgJ3#ho5 z%^t{t>rHaw6oA>?bi4wq;e%I5EauHVDE+WJK!x(R*=euTr`ocZ5RDrgmCKP-JrDe< zmK-b<2C0;+_^J|n4;|=6Jih$R>|XK6JiQ+zM~94@Wx2O~mdSqF$UA^N}-Q~aloUOX~Vl8-W{KMuG z$6oT)Ya8Mv5K7Vmzp?2(gUTNt@?;&5G2CkX?#^q#AJ!!!#7X~^#VoNGa85jb1=?fI z)g%k=k*BRb6AQ1YMN(k-Q)Ii=F=_t^1O-CwDIsk5Q7bF~ z;WJdqSO)V>TcDovUjw5bEFeea>hf`<-e4XgJWoo^1Fw+R+262imj4+ee?h53$SgiZ z{Dp7WjT@KW!(HFz`HjOH`0iuuLxLS~uxt0gYd5D^@-f6v;@cPVGR&&cP z)?Wx(x_mwYA;1iTOxV?H?)0$&U=>5lkL@`fj~v^O$dbG=xUL5;fND)EyyVP%boZd` zJNbb<*Y9w=0A^0s6dZKV=T6^ioNL`9Yz_Bl{|gqZanHvjEDvW=+yGs!R*zLA z_+M;Z@)7wf+(4odTU6na{EyH7-^l&H+`X0v!9w-lEu@u5hX2qV)uP)(1OBgVchoY( z_y0Cf_)y7>ZHR?-13*lO5gjqB^Ox62P=ZBd{3!KJd5OGU_v%c5b5^{62*O*xO*0ZY z3ZUhxX|9?@K+C-+i#_e8IEx%p_$X_;kZ0)ESij`i*CdC~&-jDel_;E5k& zp7=3UXWljr+TF`g1R($BGtuebmkHR9y!ta&wD#xzFULJ>K6OVx9S*w01hW4a)k)PJOJ4@0%=!mp4KthfyrcDD9v4=O70Pw<4_B^jWZHJAg88TmSx_Gs3CD35z%7Kmfkdhw=BS zWflT<4Q|U?xYj+2i0bN{ps&W=^cCKe#xMyNS1Wa&Lk?*kB7dy`3=ZJFQLd7+X#M*> z+UD9&&Z)6qk80XCP8G<1pX}bthBOe!G=qdKFS8Cn-#jz@G=rh}WV~Irg(9aTP=6ca$f`7 z=QenkAOMaOuG-e6GCDH=v{{pBcod(8ULSiAdGtLv{~4&mdX|X__V}q;brKYd8vNO^tI8+9wi#jI!Xuf zJ=|2bWu|Y_A4KNCoEy(bKhq4sdwI#-CBTtGran1o>5xQPTM*69g*c7qztk_{EYd5@6qS-GtWAML!JR2(%OxWGC6RY zqA!_dIO6NEjunCWJ@b)8(SIfv8qt;#ZJ&$OziunY36xcc!F|>)M-&MyyjUd*lO;)zuZIlg6dOq zuXWX>_@~lXW2$ixly@=un7(4^na~OhqllP*Wq%UtBP`<(8^-C3P>{=Jzh^F&@x5`& z)CX0%Dk|fj{>^U`nm)LF_MVU)e@km&fO^W65(s10rGDY{UEGGpQ|q(+YabCvB_bRPW=+;9KNCYu}pO72FaxT zNjm4bB~;LKxuiy8nNw_4&+%i27tVo53RB)MwwqFfgo!4%pC}RZg#c;qg=u5MxVd-X zzL;1bpL+RKYO7HXp=Etyy;K>D)sPOe$N@qd7Zx5Qc;AQ zgk#i=D*`ob6v;+u=rGX}{^na!sYP2S{%f|ZsuTB+_vv?ari)Umg%rWreSwBi7_gYh zL}YjJ)s`tWf-~B7y)U?>ZP4c7WqD?1sdD4x(jbGW&Ip%&ritiISJKfERxdqQwjJ&{ z4oj^34VQ}UtK@)9tVC~pt|VuE!%%jpDlUR%A>L>-n=GZKor3$cYeryXKAb7s`Jv9|Y%CNxu4~B6 zQ`OphUBjoJlw~A5yxkGwxGuS597>%(dHPeIC&v)6b-BaHXQlBmi&z!o+&?ws`^up9 zXrFKKdm6NxY5kV4FPl0leoTh< zn<1p1cvQnVwqC@n4{DQlJH`v0)mB!83Ubt9o_API@6CulvO~L^G#WxR!!a^oJ@v5D zEfa+G*;64~LDeqHfe`CTsX8-0Nw7bR9bev!bfU%|9xss1DwiM8OJkG&EX#WLH2$CD7h3$)5V|-g*9kySVS4&LeX0dSW-QIobw;q_)Yz<$ zLr;TtY9&N&3`!UfYx|;nHuMjUxRSPg1^5M!USlkd0)dD4_*5;Q9$$ zu90)WeI@b;Z@QUZCK8jr3_Ar@pTP&v#ukFXrsmJpK3c+3_=X0XrD0+vbm;IyCb^&5 z*PephxuHk;`SuK2Gr-qmI4kKdD{Q15XF+4_j7H*;)T7>5b?1Ki{-uUo4dnO{JGJf+ zR?V~5S8S)zNs?L>-1qg0P7?WKm2_yD`_#)tY^W8RrH6c~7;W>OJfqm-s@Z1H*c>)T z#m3)sW8td`Q%YW6h9{D*EGX~e*~vo`t^g|rGNYYys;lWP!l*J+-xXWL<{Kc@Yw*Nb zjPPscH0dQd4XyeIg|BRV56(s7HFz9>)K;&G71 zvcH}2%#lL_8sd%PK^R8UTcE7R`km*w)2}c6>l+K@ZoXQgO*QP#s%sS4wrG8?A*?-d zU!~WTlkC>cW3(b#P8NE(+QgZ$n{Zgwkf%AweE}l&zHr^dQI7YNA8MxDP6n{~?eeSD z+C1pz$2%7K9=(m5>)R6^KTo$rQ2B+9kH zd)}s2To8&goy6&x6;l9-t;f5_Hb|j`#*q0nLF>ngAU;%-&etpTXBeA^V?C*>bCE+C z6sw7AA>glDGRE_I73S}$jQc<*U+ZhbZk5bE&h=a?+}%e`BbuCg9>jS8z=i>o-ihG` z<<{deKjrrJ{D2T@haOO<~hU(FGA^PQXnOuCHO7 zX~^*SXj<$_M7H7wh1~dLw}EtiUsI=-gXEA z#}nmMvfWc&q$PJlBR1q-(tiMz^JboMj@!+7AL$UkiN!cw(TQlh)+Ao+?{LgpxuK3b z<7ptWN8UO&mt%7LpheU|KVD#`==zhgd3}{wg%iFN>8eK_0=sqSYl}J2`_>8TAUE*+{#TPG`zHqJ&BkS z&DpNz^BZYt6mQ*)dTh&$T+p?~Eog6DNtfU} z!snr9*oPg-coCFfpC6z-k%nCufBp3kZDmDm7jCV}d%;DDG8d{RUAme91w1t4zK7B` zC{+2a54$M9dKz~A>&fvm6FusR_GRz}y-JKB_<*D&GUS@sdn@&Vu=VwfA}t#7+-%7y z+}|d<*%b)mS0c$E3?PVk?Evacl7vmbrFkd_u2k6ahxBD=9$R&dpL|ej>7$DkS61b vUCsZ67O}f_tuC4iqJInjop_#;-GVkB|9*TVsU`LIZw6{gT8h>3PvQRuE~SE# literal 0 HcmV?d00001 diff --git a/doc/api/html/form_143.png b/doc/api/html/form_143.png new file mode 100644 index 0000000000000000000000000000000000000000..84e17b5b9a0042b059a02bb7703a489e1cb25184 GIT binary patch literal 8155 zcmb7JWmr^QyWT@eH;A+}3?SX`4j~QFF@%&zm%z|CB1no-(n?FKw8RL4go1$514G9U zLpPk!_dD11{X5s0AG7zq)_T@c_lkQxaS!x0$cXO{0{}p#rKx5F0JtgG_xM}5*nhON zX(0A-?}4s~I`;Yh`dKM6lVAlXpBU*I1Hzg%-cc{}t6F+SksF6M6)ttV0KlfLr3Nv9 zfwuED99rclH4Jc~>sGJkkM-%L)O+Z!X57nT2OPv^yjKPPAz;T%0rde+fEd6Sbwk(l zgCvUd9|Bb919ij4Ph>b<@O@~Z1l&_T_SzYCP)jnDu=A;`x~F^MCGH=g4r-))5r4NO zqYFSTPI^7tI&hPEuz$cwLZ^3X-rwo4^)~Jt?{CMX(X$Vax?8|Nvhip34%=VR8N0s~ zID+u`v+dZz)0}A=+G@L`|Efmw4d^eVG^Tjy%H zCe+S?-f={axWT2cvW!vQs=<))=ilWTq<^Pndrr00k5j+>F(nSgLru1BY;_91J(dHIUjf&ScDb~2D!fi%O`9+P6 z#N!klS~Iwmge4tF&XS4yny2`sY4vjcNe?Eyxshn#BQSyYzWm*%qCWbEs>=1(K{bBY z?2rHtU zVw_;is=lr)h_X>f8j@aD?C)0wj7izt>G1r;{V(!hjP37VpK3fjAdO<%SS8P2g#A6to}PC_3#LMT(H6 zW#9-uY5ui4RcCD{u~+_)9TcHHhU)|jy_+ZR+eG49$wg(3g&u*dQ}Br}{`H|jgoLMT z{-W$hq01kn9s)2~H}qOt=*$`%=Ty{&^%YPy;&pVdqg}yMHNY_hl-qmFRg)-+OD|%<3@}>I(J zKpLHsLV98!o+XMk+bd+cc$;R*xZ>0UY;w#K(bPgOGo=t0d|_R`9cCerilf7m*g$SX z)4l-2YzVtxM8u)Tm;8*^fr6(2N#+Z$j~wA(-O%@)b(9EmY#+Ci!snolgs!R12Q@XX zeVejZzTvq}+)37Gvcf}=9**q2?IDRGJNJwCwv)Vr;9Lh%RcDI^VR6>7S9j6)zY|NG*Gh#P4 zPwi;M!|iS+y;Es7>|PP;n46+=jW<$if6U<#i43TL%XqfzSg$rhRP^2TCiEygl%5wf z0K9jz8Po76P^^JXNLq$&b@Y02)n>u;vjkj)Wmm}D;}n1?=C8&gJB`sf-HXeNG_7h= zhDzt1OJDZq9%Z|O+2PH35$xSxYo$6l1*|)4-@8n`g?Km8KCMv?th{4gBBGIyN=$ev znNI7z4(`x6vZ?}_W6kp`R(Ny7n)ECd1SUOUmFc^&^n|d!RJd*nF6^I^3A`4egu%O6 z=kf@aMQg1wd=#EkwP$mBprqnYqaiV4kxkB;cio4d2NKD&svUpen`ZgaFW1p8M;y0z z)>L#a8W0W3U_3P5){rr+DbVX?zU^^b(P*+H1^rh-5Fw6o>KEJuShs!K#IQe zw+55@q~)o!aP;MH)A`(-Z?8dxWG*8u2n^dE+38Z0vFXvDO|1Qw}pN9UfHg>mQYvA zeyvGJv!Ethj?dQu!tO@U>@6e7cJ#4hVF-v@89pU!4J@DvoA^TbyP8jJ*1c~;N{b($g#>vp*0UtA-V1J#I*3?Y7ekVpa z^DsczVsHBT%g$kW4o~6-Gq{r5NC}66PSSMK*-ANqj?F#T!Pp5}n2BpSvPN)+#E41y zj^i|@7`Z!Vo`;K)LQ+qy;mgL(+f~5SoR8*Y=8IH}UQfKXakhcJFuKYbIP+S>-)I-P z-`~z~RdR?_vF()l|7wOzVpW{;=$ljZqk8L?kvZ>34E z`^_M#g=|es{UU>1mB=*Wl~NmaOCX$T*vx0wp|W0BUY1CDJSzDv$yl93`?;6j{Dp}+ zq;ywL;SwzfiCLJV?^);V)`JWnF+aS|o*aOhORaHG>G(d;Z&GA0b1rEe>Dq7grz=U| z%aWoW6sXHo-qXCaVZ)gjhh}HzEWEzQ*(&q%#{x*$19^u_UK82m)^HN64OyRJXUF3VnneM;=f-lKfbO( zhed>4^(niDbvU@ZQkgweEgLkWtG`Y z#TsKw92`2QO>kX3?&I=O&zZDd^^^dG;h=C%$yJAo)|60pk-<_j2aGXa=Sdvu=A|!!o3mfDn|$Y9Z;P(dpq1GEiq&Xxktl$lrwtD z_kH69k@<(`!W`leCOx$4lrLZeGMaVTSz=YPmH|S2lentsu(L#5=Uit~kyhGI0d=}+ z%Ux}PUGLOu)I|*R(!5SPrbBOE)vA0;4x!hJ_PW$e(YB5lH;z(lm6>KE@*_>UyKb-F zM}3Wq$qKU~%S9!^-U_e{-)-I8r5~0sTCwY}$`!_I%3dpY@Alk@BbQ6ZNYTFg^V7;) zp?Yv(xO$rXKbnU4Xer^+S)0(*#g?=Y4U$oYQjvK-lajH;N4NBCk?iOl zJMfvdj0Gm#U8SUi#$}~F ztTu8#yL%fcB*+FAfcs=Rt*HhE7#eiR<{xU`7*uf3MJtFxaCD~1q9>HzTxpXHXd`M#9cbr&sQ1&~Wt9wyt22R?M`;cp=U!RfyZyiVz%+I5@L&F-*BMiw1jsagT96CsVb|Xg5jG|3Wg< ze{#F|V-~rgy(qpD)$%6u%j?3eQcvObtVP*t4v4nAZ~8{&7p3^6>nX0j@wL7w^yP)6 zl<*JH-pV+}c7DxY5T8026&v&kTpHXOjd?(BgzrK!8Z=<}O7B55txk2$ z!^gQPtA;4Gcn3>bCuSng^6o(86?5$L7T&nAfJo&<>nKQ2Q;tF1pKXSvX)}gh3wu_b zL*{aam>}ataZ~;aS;Sv%Ej<~LLeRh}-KL-kmoAmZc(QSppCQSF@U-{uc3v_?U2Ku~ z<=$^TuSR8l3DQg{)R=!<0o&Xt-QUFgKflA`{sJyo0Po*Aym*&9s|*ZQhn7= zL<{_aV^UgQ`C)scK8cS_ovY^~8#k>|+>+f`9&O)+MhO;EuAAesqAZW`ETue|(iTe2 zbiNEz7fiGW_N{-gBJyLwrp&cVo=pMv{8&hSU;74wkWC)_zAS^yz1+iXF%jelvTI zKV!N2n_-|Jf!yXRYz*r9SjVx$(usj+!v7`YExtBaprgj!ByS9+c1CYg`*~ z%!}8OoR--4*(f0bXO^S)JSH0yfvD5gz6tdGO%(IiosOXF~6AOemCk{9w>2!R{6d?Gpo zvB3^?4D-l=0&HKy7=~&RjE%_< zm?0z_gt2+Y`Pj#X zzY4EgaWaO{_)|exaz(>`s!1a*}Crkm!Jg*_lFlcGVgHipyAC)djfHEcBWx4|F zo(R%RpDZWWx@*lR{ z`A)hd;9oh^Jj$(F``-~H5vpk*8LI6~ECjH2I$BKNKWVyp&x|No3f$QZA;H{PZ3Rw^^beT3jksAW=+WuG!i!13_n(}mn{640!6Fqd3amS1z0mG$WYeK?S3x9@3cn3Q^le$ z5+5IVOJxG)x=-1NqbT0_{|@wGrYWwFC&Rp{Bm->wkz~88N?7!JMsIM(Qw{7_@o$(^ zGihNcjb&|ctVQva;uui481?4lUQx*OlC8BDfHB(fgh`)ZFJQd8-9KPjd;*Ak2udoK z-oALBE3)#l=ZQ7JT>jm@E-Uw@ODE)mJT2=lPEC!${3BC2r{!HNxhZI@-k}gxNod}s z#me=jCH6+*0yDxYSWs7!qmF|ixnn8FC0gp&aTs7a%KS9Fo1QRN?bwzYd}zrcdXN1(%3s!*fgp1fZ& zm-8lhlAR!SP`qXb;;_)6=Jni}9h1*&^;V*mI{39-9=(_!)GY1+9%{Cp07e_@q4G(j zYD#H_Ho@tVM4nqaYj~H30U5@f>zQiOtttwg;eTT~Y5Nv5$xSG9rMPzxYj3=xAOsmlLm?ut!?n1Ua^Vr+lr9ZaxgHmS$5(}n> zRsM~n1iI(JZPEj^Bz39_vprlt?Y+ZQF_}7NXtAk!K}~1*i5;f5HjGveNc96g_jpLd z9%j!aXcEU(BxX#}OSh$_y1#5Bd(y91ckR(8bo{MTU(#d?EUJi`F|6uu9ssIRc5chM zi~#q^YXPS+t8Y#pRPxUy&3GP;%bQE*MV1R!T>Fhs60*dMg%SD0z2?LVvD%%R(>dHt zWYAg}BCeS6KKxkiiu@^&gdUSbaHEMf^g0Z6_~HCA$PXia-|8{V$UWZYMQ#mV=W?Df z5niBaa+!59%xvyXlYE0ot9!4z-l@x?oj2E)Yw*VQ0O#u53tvX2i{+Dab|z^n6PX0X zXCAP7L;zdj3EsnJ$4{H?(A`gI5j}`n8DrTo*tVu@I#Fu&*`2iw*fwh?%IS$efhSG? z(EP1WqB3%t%qUQhF7&(3l^aX4*yX`oFIkgpiy}2B0*<6x&XxO2?PMr4Y~u6wg%=*- z@pt@5$FWdHHJ8pL2_xA{Iaih5e5&Dv%-B=_^I zc6;!R{+o1v^wYqm&F)(Ubh~;lCV);(f->duCHYdDTVi@ew8^3hFSwhhrJg@FR|J$F znWwnv_gJNv-V;(JA%6q2{kHaisQRSJA*<@L<4p?bbqzTj?2wYo1420x6+Y4&{+NcA$2nGd_*WPx!@L_y0dF?EKKw#UH?EIM-<(%ojh-2wWxJbfyD)HlWh%vHwmBrN!h zVhpj1hu}%e3#f5n?GOA(&JZv(JWDNU$!TuP`5#nKOce3y2rY6|A#^aH= z2j5zz`|!_Jg~N8e#QQ*w>RFlBUa^hcyUs}T7-&R|H}- z`RH3-PoW6hoR>}S$o>6BuSd9mOOmZ8r!S6%WScmoSc%FgnqL(1g*Ctm9Gu$di^r;| zJ1l?B2Mx8biSF9O-qzMQ(%u^-4jsI)N)6GS*8B0upYOeJ#3a8Lp?UZ9oIvCLa=jDO}&@kq51-u7{S(F)v(wU(Pe#f!`)ER?ekRX9yk z9ND6)eAcdUAoj8Lr7g3Ce$NyQ{zeH;5J}n63=|TtyE1DUVwWPl^hvkxG=g?{+WXymq*A(6KzzZxv5IxL|NMgGKjM7ymK-XW5_=vw5?T@sa^6fjxPN6 z9{)Ma>ykjKKx}!k^-+hv1a{F&h&H~ksw-T72PS5lShtY0a935Fik7+{ z!$f@w0V8rS`6o?X)3L-GC9uXl_pb0Lm!BPRILw8~d8P#4oOiks2`1mQ=H{DELBj+@ zzPGdyOulUsrO12nh5za+ZgXkI)WfTFLaBlotoj(=?t+!&h-*-wW@=wS4pX-Pxcz49 zRf}}dtn!rf4tDpT8PPxYTq#xqgbnkm-I(O|r=_pNmC*}~kWmZcU`5;BhE`+T^U>6O zfnC7@;e{k`v7mSC$kiGR)xYQNZ5Y~)-A0QqwM@<+igWf=hL!$W`g>^xIInaNQJ=Soe; zYJf=PBE*oPC{6p|pA=D<6O~_Qa=sU#ND0qRJ-vh9m~duM_E?wRY@0|Tls*r$W{1iT z^yHb5`t(yc;$Xake;tA%l4@XPDS&~fm$=#S&LzuL815;H0R?xI`Ci5)F7sM0AMPdO z5E`%A+f|7#+iV{o6RCha2kqDo@!Ot2kQa()gfic?3<*x39hR93A@Ccxu6nSiNq;XL z3Llena% zY~x=$uG@A}Akdg}Bize)tHW|7^;GWxWrX2SoEU80WK{ED8aZGCN6S6;4*aXO=J{jF0C_``*aptu6?MB zgx>sNB#44C4<#qkzje!bRZE<~Z;v27rqk|Hkn<3Scm|M~dr>dsw} zsPU&5i=}iFJ{6^6dwuY~HR@{+B<5hG-t)f-;*nn>QysPuc9~C5e@gUP>iTLmDi7iR E1K`p%P5=M^ literal 0 HcmV?d00001 diff --git a/doc/api/html/form_144.png b/doc/api/html/form_144.png new file mode 100644 index 0000000000000000000000000000000000000000..0bce35a6f6f8930bb81984b66d9b61c056595358 GIT binary patch literal 751 zcmeAS@N?(olHy`uVBq!ia0vp^tw1c!!3-pYR@JxxDT4r?5LX~g5{R;w;Rb3DC<*cl zX3+D9&2Q+Rw`S+jOLt#>`M)ZC!+Qn>rZ`U*$B+ufw{ve#o1-A$Y97ug`tN^!aLk)& za&vwB(^T~nBfTej&$XJP7038b`a_M*0ei!>{p&ZVHssHWW61MmZIBN3{@CyLLs%rb z{n3M+iA%$O7I=jYBG zJzOlYws?Qv=bPE}6Q63mEKCZ`nR?(^rGaI@j49q$W~+3k{>wYTw?aN(#`7g6wQ`v9#u7A8(srI3j z-}B#jP8&~pymWQ_5_>A-2gAOM)83I+cfTp?+Z(#&^T$0FLCU999I6W~81`@9nRIHa zQsv)8`+rVjUY2gHRTW~pp7Gu`i@V%g-`Ko*_3*jztnk>&>qBqrFXcbby7KRu^Sdsd z7R@@pox{NPGQ@ZYu-uM9!S N*3;F`Wt~$(69AL^NR0ph literal 0 HcmV?d00001 diff --git a/doc/api/html/form_145.png b/doc/api/html/form_145.png new file mode 100644 index 0000000000000000000000000000000000000000..4e6fa79b51d8b2864b64dddbb87e82da7b83ffc5 GIT binary patch literal 4210 zcmb7IXEa=0xISZ)gdm9MM6V;F#%PHae0murM(;g@5rT>OX_1(y6Om|Plt_e(k}-&y zAi7`}C8CZVCCDA$kGt0WdC!l%&)(RQ006zdp0+svfSSqg zk(a>ac1mnkirmSV8d~a*`~TNtr@>7}UU2oHxv>Qxtp^W8X1uCu>>MVn?*GMj)@}g+ z22zKAiw*KqH{v_b?&^VD!6CdxL5T#8fSs)-X&IO}Y?FwU-y zY&Dy%@$(|U%VgK0qEx7n6M^ZA-92AG*(_d6u$Wy6F`4vB1C2dlT(`By%Vf zz@RJ##EFx=%QK}Bt6bE|9w{-Hq^Xq*Kk0PM1qhQu$lJMNx5Ui4Jyx4gIVGfI&$sjw zoL_rij1tx3PI%fa95SU(GSKSBCryJaXr`}=6InB%W zr~D<8vnG4hmvq!TNz4|)XgY*`fE@a;5samStUWw3qi}$L93M=%nlL2bb!MVc2+tO(K1F5? z$qx%=`AN?t6BIhHC+?%);W5n-K7jQzV9c&X!giffF{Yc)MFMyQs)bb$4DVao;VQn; z_^1|?3X5*iXUkD@?Er3S{*r$SIk;|Z+0u4S+V?KE6Uu*QqA}|aslpio_I3B#_L-r! z5i4arjcm*axN)64M$m*$CGQGRd1W=qzsQu--Nd|CyXy(%z=K;*%@VBf6~)x0^s?qm zbq0AG8YLYT9ruOl6k-pOqa8@@)_1+1zom^dU=f2TOIcs zcw-=hTXOw8$%AK<39aS4R4m|JO4<+-1sKiL-t_~mH0TA_7q1;$%EPQFgajpZ#;(I9 zXCT%3^2?HVJ}14ZQ1|7H*q^NdU+woFO%a z1A+04UfW#sasKZ2A57(>m8T*}4?Ja8m7Y_DUw<<~nJ4k-epb-3*%!aCiPF`3eG%W| zvlJ~Ow!#@toO51qx0h&5`w9b6Z}obEzuuuPEq2wTq936d;AgvGR`Z)tLnYR2PK%+ z?v>UWE5(iH=t4^l7ahwO@xEAYoB%$_)!ra-S^Ced^mF^+J^e33Q!LbuK@!N;?xU6# zic^j6kY(i%wmrVm{xasOvYdRwq7zxX^L8Pbp7>%72c!`a8EmZo#3trv4wBfQ z_- zbLdgJ33R_v!+rzdD0jL(W7=Ww8-c1wwfjQ&cO9(FWYVmPL>MvLTK9U?V(HWf3S!5^ zRdN$kzt0|7*9GUUe^7EyK$iY}XNG=mGlGr6SF$6w^J|64Qq=8Ux%S)6(!T?7~quY_D?FxO<_dF2nA2%4x z`H(SBUIgV7$2(Z>u^}0?Zmx|)z2*gG5=891fTwo^F{8WvI`UCkP5w`FZkYw^G~DNGD&kdS z_im*vZ?*T-_vj)5s1jG`;1I{_LU2s;;Kwt3%f*5e;VqiH2VLwMYrmk>*(B{#dkZCj z*-Suu<$z?k_mF%sLw_7q9Xx;E@Q~m*(ntLVod!M37C7waLB;m&UYJ4_Jg0l}7ob#|&@4Nsj*^1zmw%|iqG9W5m0h14Scvd{L;m!RKCzn6f?*gx8~yFJ z!|{34=$f6Y99WUoo6~Fg&u{z|L0zMNx!~B9e!lPB5P&IBS4(NswC1jElq>|Re)$5= z^E|XMLv`8S9C=%?!6u4-FB1X|2jozye7i-Sv^hf0#508%%vqF!chnKdDDHw&c+Zo< zMs(K)-5P$m_wyku_R-Fzp1!2MUwdU+V)$?W0eM=Zk*+a=!}?(rGTZVw-1>naN`t{tf~jNl=Wi7xSx0u%>w&;0*cWbl0qojFDUbxK6h~`XJj9Sk6QedC zfqswP3FVFdk``(D<9N@kKJ3(6^3R@B_wdUr{H^;={bB*)7l)bP{O)4tId~nXdJbO2 zp1UdFjPp)cb~sNyUT>7sNLkK^gn!;9!iz&cNg4rLx__U<0^3)+VeJ_@4BOO4CjH{b z$nxk06=Y2OZ>_rKrZ664#=XP1Z{Sn8@GK)FW1RURjWqSPu2^W&`(HXT8HTLLx39%n zap^7PqmPha(~60xqB*#(Kj0Xz=zsD$zH-1&I>W6 zm{t!nee-Yi4*zqemKQIM3ai~$)=Z5)V6tGU$#=&|!Wsf+3Y);D)(L3`yRzKHgf%=gqV&f}Y| zg4%tk2K}2#eQ5O`wHiy9hoT7JUXgFS;62OMby+E7d-sJ>GeQD z?kVX;)xgHl8_Pxc=Pe}(m&syqVkns!)1hxg-*+cVQtxO)0`;r?8RD3L8;3%4KDiq^ zjtQ7{%5SK*yp!j?h(- z?Qt}4K@lbT8F!z~E9AT%3;12~90QTny2mMv%NtMAPvMgS7k>`)b&R!ZG@WAq2hDEL A9{>OV literal 0 HcmV?d00001 diff --git a/doc/api/html/form_146.png b/doc/api/html/form_146.png new file mode 100644 index 0000000000000000000000000000000000000000..a27d885eaff5411f76ef0c81d88f263f0abd5eed GIT binary patch literal 1940 zcmV;F2W$9=P)O001ip0{{R3Wx_m!0000mP)t-s00000 z0000000000000000000000000000000000000000000000000000000T0a~M0000G zbW%=J04_*fZ-9@UthvR~-RboIs%Nn8000LANklvpZG5`;e#6i_Db|F)Y3 zyx>&h+Br#f&R7mBnckqgy1M!=z+V9T1;Fos19*ZS;1V6c{}1#K6~M=E_nE85`~rLq zs)Vd}l^OspG2G{9M+4B}AumJT*|>pz+}}@2DxaggAm(0X0Dp?Xy<}0d=fd7+F#%k` z=lFr2}MWvWZSWA$JjM(K6 z52254~0i*nPwT>`wp z#g|JVmxy#0X+q{DSH|t4=zK_r*oV$O0Pv18UbKt83bLC9=g~em#^CxXTI=SziK*4; zm1=W&^&72o)5KFW=qWC4v}Ulf;+Mtq1|ovC5dqGS)|E)IYOIu1$j`itl6+Nme&;px z!RG+i0#ye{$J&QwL4Z?8x##psO3#Sugy*hmz*fti`k^)Ny&jgAc4gS~vSv_2_EV#- zIqmpS(=`Imn{~aIja~F|Ttq0UZggn7y`XLOcpEMd$xS5y3B3V9*(l2>2^NGpnAs>08 zsI|^cp^FqVFSd!IzCH}Y(BfmgtQnNiHMXvn-C}tPa1C3EV9I7fg@h}-)J4{nWk-B5 z+;u2SYfZO4diTZsXxJq0GP#)-UwA&G4DgP7UX~1Mm4cY(wz+H*yMu@T-cVhvuAG`G zcZ%>L8K~GLc6}ZMGJ}?Z(XYO%mgClUyU|T$nkWfe2Itr@Nz3KeWBDe>4RD9#+NDlq z!6PpmbuMd7RtM=E;bo3Sk1w54i20$KwORUg{KGjNR56xJ zsnIUAek!Vs$rZz7`cRj9WQoiAB`O<(?tQdN@=FFgr`TL3Mr~3`_k*Ez`s&+#_mcJ# zUZUy6Xme?*O{~m^8!4XgGI#qSAs=Uf$)7N&EzU9o_Co8^0qoB8og7tG>RzrjgNB(J ze;1WjsKa^y2WY=GL?4WB^B)-5TOgd4LvP`s=YW+#0%??YmO7et5q%l z?^rSbIO0BTfbWJ0_R$PZq#kT(IMn!7ssO(VE_Ljg9RRf0nQ*!o&B1Us>j(G?fbYkX zfnJ6Iz$3J_0r2ZExXZ}~?9WFQv9!+bC+2$M1H1Fx^YoZ(v0-a8sC?sUaNNubfbT|k zJ$9e+q9=d`qYmh1guFUTx#12*tHnaQ$v+h*z*i%+%1sYEwJdtR6AK(pR7=Ff&KF`b8 z^vj|bGc+H&sE25Zu>6TKu6Ri^G5m;A-|#Z{Xlu>8X>gul3I;zrrf993YuV4zRJ|G+ z*Ln3@a^tJ%mH0xXcCM?aaY}o-y`;?SR_SGNHctV*0C##(YDq?+0QmPjX}cV9;l1}~$obv!lKdpCyc1hLOJl9NODpW30(=SX`e(WoTm$}HlQX(h53vdZt zc^OLf2VP|9#X$OyNIDis#crhy;43iL8103-tCa7Ob03U$3^9c@N8b@9v&JmG1MnEO zPO6Z}=+kiPY|M6E#(wWF4P=f+k1ze@yvWG85~b9!T8Lap3FY1VK^T;|XbXUQ$iOL0 znYWe&_fe?cT^dL<62~`;X@DE}iymn_W$OWe1Eyr(VI3#!%swl-nASRnyLF(IJK0_U zei-JWa5jcr&D_BR8UhWvw#~Zea;?wmZcR6>QdIjPCqx#f2lz=C%efQ|%@-~O)2E?( zkjDiY<=S`UZE7OB);L2b1ZvDT7W({fr$N|6XfPt|gp z5G1iHic|@)bF59P;aEbdReO7#`{Ulzqo_F4vNwYy&oH#Ch8~}h52uoAD zBjg^ri!k^ohNXL@9D%yc4F|I${J+e_NLKWy;B=%N${tX&yd8?mEUs)~j?688`$_h% z*#H0$A%v;10~W+9;zh4ko=k!ESJY~3CpB0IWdB(;S{~P4VZD8vwE&SxHkU>uf!qNs zh$G__^HT};;bGP^_PyWIUiFKdxBWmnq|8rl{|cz^?Me4=ZQ=BD0;ij*`m|6Bvgp*To@iS1 zI2M)30yst{J~<^}(G0n?Qf*XvlV3O*??o7}gY)u6w9`^*zFnDsX01sO zUVZ?czAqc|E6FwIgb}18Q-uQiOAwUuL7FYWe+=zRUNu!rwx{TRVne-^Lx@?Qw|hS^ z=L77A5skR6C>GLw+!)Vw2;M*UBsQuq*?u(GR?;RhgKH$hE1ISlA>NAzom_dS%9_=B#wEbvxm5uI@mDcV--rMPsiYa< zwger0*SQfo`>K^}MFTAS8=Uegv$jE^)xjILVK!v4!;BUQ`)$wy7h{wEjj?uTSzK_( z-14LD>l(nLLkO0Yi;j^E3jDM>}vtyFOw8C@Mqa`QY zPzl%5T-OIUeh=_pG3rfR(-yG76PtNVybL!C=vYeiV|lx{$fDg0gBv2NCQonl2+UF! zFg+33nQyX0gL4vvuoAn)cOpj*LBNuFeWsc-S-1-2u+<-He@j;rE*l?T$V0C{D?&D? z?GS)-u`~`+|IA?$44^cAH%zI{CU2Hnt~EOt`ZdX!Mila#^&Iz0WIop;+rb8@aj+J` zJ{T~3kQZfqLsaU+m^S{l8Z0MsB{cwb&$&yddvHQ=p!xdqNbtx5U-_M}U$%nx_zVBIJG9P4?LhZ_C-}C;;BMrX>qqMbQbz5l$=Aj6uIT%w`Ke+P>UrX9_e0M zJnbmC&(QT=*VMIP7`EQKvwS$4QNuH92e+`ESld}g>7B28R{hM{gRMbAo+X2^F$Hfg0hCjTfdTfh2TB=hyx z3y&S9BB^;(Fny{JGcYOJabRyB23j|+cbe>bp`y}^z{ob~{~@t7TUnjAK2aQ?^hvyJ zBZ&R93^Lf@M3$FU^km(c&^e`gjAcH>+bya&xKUfgZT&bwQY(>x#Rx^pxTdYXsn*E4 z0L*qh@ExjC8E2vDgJIt1WE7Asyaq;V4Q5w`xw6M}7MWGkR7nt?wBwuCHoqlW!owEs z4`$4P2Fx$Hb_WEug@~=xRe)N%2xV1YOHH(77VLpwNMbXY3&w4Hcu!rs1w57Ick$uztU$Az9 zRe19DOL&mx4Y5mbA*9iiLQj;;boS8*im5@Ar7kNRs#)kJ2;XDS=0Jh3ux@R4uZtp= zHS%J?VGog$g3)=oUx!nQoVHh`i(V$a*(s;bE}>&ql&FG@qBDJ5?vSHMp~5Db4J!Q9 zn$Tl*ce=dKKuURPGDR|a#Qu5wO?3Sy?R6jtxHQld!y`Tl{))qI=w#`9Ypc+*Oyvg2KF;MdJszZ=M8p&XZOF9TT*ZVjWvz*F!6#4z2|+DS839 zz>$-Ne{si%txMR7`#v$5 zUpG$u+H#il%lbe%(#NdT;|b_TyZXm}q9EfEl=_ggu~A!}8S?w-5d7meU9_!nBBOaQ zvs|&`*Bi*%PA_?3rCUg4>HgAp&lSBR(&0Z!Y&?_7Fno$$kL2zFdUWLXe}rpRoyvOE z?TXAASKsTsY_u{S+mraZGrTpT*C=5IL&I1P|Er2pGsCJ*ljNip6D1M;a1-F>33`AY zn{2CkY{QuyV=_evyV_RbhVuYk#IHT-d5_NzVhVFkP!+b4?kY&8n-XLqDoI-nMoYS-q$@PRb4MNOzUi0B&I=gIc1y_YXy zhN-;%&XI&dlIV*8mX6-U!$6D1lFEYI0Zx98s9ZC657d$4RYWKn8h18#j$C)i?u~az zJ0sT;<&=2lOu(FDWozHGVZD-{RClGygVA`qdgX<2yWKLfJYjE$cIW&fGiV_{e$n~( zwG9>9fGd(-dE|R+(S>(aY`qrPd2{?e^)F2FmOb4qLSkXGY)_blt!2<>9j(t*{>ryp zy+%u?jd_9%WLho%iLs7KF0G-Z_`tHys!+Mb`|5^M-_@n?oV+dF0plSX?Md9w=9|K$4F6N4!iv`55 z>tC?T(Re}5txn4?h?_ES+)n{N4P&HOhmqJq=4}WEbZ}~!WRToRcpLNge}ynZnNm$W GAO0H@Hl8y8 literal 0 HcmV?d00001 diff --git a/doc/api/html/form_148.png b/doc/api/html/form_148.png new file mode 100644 index 0000000000000000000000000000000000000000..df6de65b76512743b7d4b07938fe11f4488669ab GIT binary patch literal 4112 zcmb7Hc{o(>-#%j*J4uFY{bb9oj3J6jl(p<+OZIgTV?<1a-WF72%UH@98p~itj3q+I zzQr)cmMp{Aci#E_uJ?Mc_kI6+&mZSG=X{>${+x3^pX+nq=hc1FJ6!BS>;M388Qi^X z4geqm{o0?Ek$&dKOi9uQmHWn)di3%Cbv)1!;h--#6Jl;^0Vv&dgrgF(zJ6;Rm|WaC zE%q#50|1_AgWESPksxX&wKn$?F2hEU6zu_Je0rs5%R>)5{<|@>ps)x=aw!2BpF#_$;zTuJ`sA>8 zI4kKb2HIILitpTckMFGXxw_?Rve;rdhKx@Zg&A{a#n{eL7|M0J?Q=fn=We9wB$^4M zLkiDuDitG%st4uqRc?P62ezDHSRJ(FLo#4u4q|g=9pxOhCVCpvU+2$1~>r7m;?iy92;2UVTNHt$$L

{k>UzCGA)92K3@Q zhK|M$@#ywPDXLHLw1ULgq-G4Qkf)0=U*Cz{ZhWp&4Ra7Vi(Pt3L^2||T+ZnEHxT%8 zb~3+L%QzOwcdB%nrAb$}NWh;b6Y>}#PU+4{-D@*k6umD6Lvqhr#*%zV zyW2eFnbI6%u@{t2kYxl>_;ESW0fKI<3lK^!Fx<&y z4=XwQQtO3s7GLa|+%*i`o)WBIE6#J|y-Z(NsFLp6&(aiuw8&k>zf6&~A=zIaSk<9N zSOmcp2B<_`A<^>8R+$pJ5zQJY2)#_$#wixnvZ#AAajBiZ69{`+B%lVM$@y{6SXXnn z{;Q4z044gC{C8oM=~e-!5_zZdGeESWIk4kN(#vgZ{9vZ)_ya`bnqoXug+g%_u-YJ4uOM_+8pj!R9ZV-jC?fDTpJW2*Y!nEfH80?{I91!npN zs#OtMSN&Y6eJXdakn9y1j>2oE?7)=l@0mFa2FlsW1T#*bb*P8WLLMYAEnf^6&za5#Xp(Tw{H4fW> zjGsv$F=;eQr5;uEkf#;XWIJjr!txO7%RK6qsBD)WLJ)L)wctk>eF1jyg( zg-fYaM0RyO=vv(S#b1)e-hS7ern~)Is}*o*@m>nbmvxjBQO+&MHjK{Dx^c5S@l~jI z-mS=vr64iX1)55ciPO?k8*$(sZ|H)ZzNRzxcFKit-zD3QH~nhvNYxbfG(H4|3pLd) z3m<%zwu<=aN``)PV)Qi%v9AJ@DK6&J2WurzP}Gex{%IKHDO!g$!|n`PyL&x}G8NB8 z>CL4+G2)Y)t=2inYo_gXP7;$IYdjR~^-q;_vCz$y|6ys7=p#|$dGd?4DC0Kq3-)neN@FLR3wX4l4&%!=reRri*1+uI<}j-zf1emX^N|I=Ca<% z-FY5_MQr=A+nJQ;+_b2r6+Bx$bj+0v7BQ-AyCR)M^B7^Iu+IAou(ep8wQP-;Q*0B= zzL~<=Ip*L7c>aZ^n90H1>~CF?_hKK3R|-}8qM}YFn`<}8{EIluE`$!KWzzDLH^{u& z?;P)Zgmzg&7rjfHgnW>_X%m0_4;O{ExUE>(XY3b;7%th|u=i88mu!z7I4~|Kq=&z2 z#q-`Mza$5s{#$k1pJ*cbc{dXuvDhMYW`AlvKVUlmk=04EO}|O5j=^u`2#s2nPDWGE zvFavAf`8(P*@}wak{_cY{5bRFaJc4>PLj)^^DNpVl(h@z>F?9Z;E7KOcF6GjDBF+Lm6Q4{N0iOyhzK&7R;%m%C#FDFHeEhJ_qiVrc8FKMRk{Rke23Z>ozaQ-S`>fO_Xm{K z!erNK%q{OLG}fKwQTsz3v|3T=J^kpsg zq`S&UEJ$W$&GiuhPy-0@;RmL;8ceWz`Yz*D5I@KDd8{nlLk+^ND}E$h0+i*B?jK!= zt^IvDRF1lul2PHO*v-vDlgoG_)x`5t3W_RwwtiDq?z~OcgW0=~%kQmBcZpVH!l4jJ zX&6|$6{%4A*xG(#(<8rh^}sXZ`Z0eyBYtpYmKh14r!vn|b_3r|BMFFzg=#S+JwF(tWx z_Df58euk#rzXEu~F}BPYp3EvN#K7vA=QDUcQ+gz9sx!iBNX_+Ip`_WYz@SN}IEd*I7HhHJ6j z%LAJVCN>ZT?uDS7laR{ocdW-P8%%q!43DTD{UU3VpR`LeGR}zxWd`7hD{gt`QkIqA zq(d=^tTAWkqB|s_jnsX+bcL0|ZTRuJA1ehDl)mq6R50izmNJ7blZTsXU_43uQQ|nK zMEQ~6aF5R=x;;j{l^Gidt^OkEHx9!Rbu6U}G*Pce+fB#j-Jaz{w$I+JCJt&aPhnq{ zVTa92GaI3#g8}_r0+s_^G9au^EkxmZeludr-ZpFbh1K5+reb=sc zx1Bdflhv*K>!+{}(2?(cW)TjERN*)TS*nSb1HP#+zW__vDE8MJduZJ`Ba!>|wz4m^ zo#9CPL8Hir`wyeRp$!eHp?&8#eBCE+Y;f z9v2r#RynPOm-KS*Mtzt8)wDO0uD#)IjL&UYN_u%fc=`jQl%tDq1vPLyUL0QW`BQn4 z{EH>tW?O9}Ov-)x)D}HgJD=8dv!V3J%?3HR)%$PMmg406kMd=k?)8=l#m~XV6CO6l zGXc}dgmB35Us!_OYo85w*Wckr%WjX&YOWNS*2FXKJ-xQxArzS5p=yg9Y`=kHGI(C(|Z4#~Z^}sM% zUS2E?sN2kIoNP67E+YGOJsFznoE`Q)c}b)O6R5BmsXjU+rigoP0pJo!wl)h(LwFGJEWrhP(!Zz zip64``K!lpfO|obcMmt|uh10s`TZ8`$0Kh281H!l0ZEQhfu|lFy3}8vxm*GO9-$}4 z<9AaeY5I*~^IaR&Xd6ex2~ASeu%*+`G8;UfExj-NO=6gKW2wXO*PfZqNq>=QO!~P2 zzh4Wb(;0~_!INePa%a zYIaG%XmsAT_H+Fr>ZeR2?O0DDL^)`LhXY3`J6}O-_|q@hjHHj9Ea>tu%r5EhzT5pW zAnfi%XOuu7tPAqeR1%`CzIbQY<}m1dMFR7l{lDTyttDDm5K4GvFpX9G^<>h}&(S7? z*c#@+QEz9hjye=2Vd^>7D$Y07N}VL9?zZnl(i7S|x-g6F23>3SkK^98GQKC}?!-TF zZ+3^TUg;6NU;Q7C{XZZ4?t#JR@so>HV~j`bULO)g>4tu)Wp8RdMX&TYTAi7G8%7g@ z2WW7I*(pUa(A%K_bOgrW%G8YUmlwDhoj-N8e%oK=O)@^XqN{!SMu;WZ&nb?<0oY@j zNW*q@KwZz0KS)T4TZkx2FNW!&?b{&gC6`przui#1(6DBmr9=jzIIwPY%gJZg4W^AJ z1Kv5i-&qxYKJea=*R!vX`kkE==S;e(6GW`|~NZ-4{ zs`x3}!CrSt;28-zFFZFCaX+y}MWF^H8@}8#vb%CjUN6FI?5bP`jWV)srfqmM64U+}1?yj30Z&wssvp6Tt5D2{+BnTLh-lT&_lirII0V5zq z)I-~D``}578Gi%SxId`8~bI#f~T3=V4ftH;X000KKh8h9@KsfUJ z84blbB4U_CHWK>UMi0pLzZw=woOI*^OnwMmLqJT!+7pwISNX0NKeM*~uiUwIo4jNK zS5r0$0&V85Wi<#hMcS&VO}GAQSD3+A+CR=mFUKkhEr2xw{Z0Q+wE|us(%~bJ7|3nLLaUupRXN((3hnmGvsItYO$t^hN4RAzGrS}RI|ING z`$i-3wZ{hz5+}AZdzR3TAFpyR^;A|px0#>^Sb;oH>6!TwX#DR<32jR9>eiHyuV6>Q zU}3S%ilwVgm_9Rk&r^`DRmE*YYcZS;-^c!hgv?asF@qLuUxQgNkHKeqf4^ZOWwKcm zs9dCwR?7DKPVWtS-+7qGU*TL}`491`_FZZ7iwWltSZRE#!FAS` zZN4PVP2j{5o%AI7LMyOSC?So85rwnOVJq!EMmB#8^5NF4epF<}Enju=(-9a4nkeYz z{b@{6@j1nt7N!Rfk~-7=<RF?oTUxfuI}ByvbG!0LPr zL`JB{nLP*OIT+6G-~ppQ2a*hxKJx{(?_U^Y;Ll4`+XnrWng(_NlSi5yA=jV*fPm^h zBD``wWahbt(U=KsVUISf{4?XoI96g)nqj9!!ni_kz^S5g0`2(BvRHi4fCtEdq`9+` z66}XGFZW2*6(DzcDu0jHX_P?%%*{Z$QHh7tJBN>?H8pF{eQ&bX*x1vd0b)+&b^dJt z^osTw4mmmVvM{EinHHF_wGBJkW4f?i$0>uv>=nlyOuJ$(K)}g9}r56u#D}<%)|*v z#I0;T)?OP;2O~Hfa39{(%+!UNzx5U#Cr8>^oU4 zxrzN=;W)}5)?gKWt+M=d(RTN05i(ND&gassUT*t1&S@M!DAtHkl2HAY>K1&{RQtS|DU&}~MhKNM{O@5o8?8`ry& z?!VlUt;Fw;KSfX&F4C>=^rnZy9?$70o5(^1CqD6a% ziPjho_!9=KMbI9?0&7F4wM= z+&C;rEm*U1=Ho&+O*S(xG*=~M4QmBd6R{pilK1Q}vk^YyT6acw=X!>8 zV|z>3ccnurFF$_6UxAKq_i}k7Q7(O#fUY%%_n@aUkeT|$XM^?iW<=BA#6K6XCEqM| z;nFLrM`o9$uWXn&HOoXf$7yp64rvzhmL_X6K|&fUo4q;8eBz#ue$D@2m+Si0@L+?w z)1&*lZeF&Fq?XO`Q2JdgT&FEH!u^)|WBXSWqzk)s@QqPDA$&)Y0v0vZoPYm;Lu!|u zdYXAOEp>4t0+A))LM0d+ntw&+o0q=X9y03G@#R1WGVQHwhUg^FMKLFly*0kZ&!UAA zyIHLMu>%^#-)a;%SDO}aTb$dMW``*`E0v9>HW_c5<&3i<`p*cwewTB##|&Y^v0n+_G=%aY2mPe+SU)2uZO=Cq0U= zDp~wA@L~!;U+o$xh`YJ=RD#mAfvMm7tCfIc&Q7V`H5LOr7N5!iLG3rJWoVy-uTjXW zapm4Ij2jh?_1SL#E6&&c&?<6w>J+sp;WO{eab1{m~=G13K(z))#sEg3BZdiQRkV15{O>!~ttLY`c#c z)|-ZhezLmW^3frSR^Q{?>Saz-RHy?M$XA`wWVbRb)hS;*%Av#PeF)Pdf)wMWoiskz zn%Egi`c|j4J*>Z{BxKR{Ws&@7!F`R7Z8a*CIbQ(V@NFjpxhb=*Uk$^~x1Nab zq9D0NKT9pXSlGnvijZqHi~cw2qf5^{N2R-+AFMW($#75+FZV>DgGX;U~@ zsi0Kr&XYXdu3w$s2XHnYt5{a+)KmoPe{!6>>ocw}3IUCP+fB9^uogsP51hWy;1vc1 zKJ1+`#qNBZa0wk&%$m~my`tQ1D-rZ7xyS2O;+=Cx&`dEXq3MZtkRcj$|5t$*rXd7m;rG>p{jHnLBcCk_zS5>C%0p zYbbVKTqId#jF_4LUsRr~co^GNLF1^KyOz=QSCacE&J6Zjc;fbsul6?- zN4~3Dk%GK*qMqTKHB`_mKOYqEf=K>#EuR0^b^l)*9!Y2elN*1Qi>f=hC3gsmK|nSf zD@$MFzumtF>VTZAN>$YRVpd2WL(SA>qpp*pUhfy@Qpi&aEK7W26~Pdd-*^UjAoPak zcr7<5y6KeZYOaCuuq?iU<%>3PDz`h?k7Y0Y)Z7W8_F^Q&2vbbo&#j1Ypy7c$=^LDjyh3*FZDjl~Nu zDTdx~OG!5s8!XB>%o&&qpGjK-WT4Bnm3vUpi4}wvcbyp~MK$7HD9U233F)`#$mi-7 z-e=U7Kx-oVlYK$T&iZZt4X!Ev2ocV8YJ4cifu{wfG?(GLvv#H^0SE}%KV!x^oh{V5 z69%Z&503iXDCD{LMf(wtfo+ut9gt4EauXt zAB#Yf@3w!YHn|LQZjA|X@>g4>%07pck)P4A;x}Sx8)L&WcnAT4$7Cigu{b@=^H|YI zN8&*||@b{LM{u6ezJ**J*yDPsmRuy(yDw&BP(MGCs^b&1Jy0 zJ+s;u?&#-)m1V#zr`)|lg(4NOE%|~&GxB2XRbw>DIqVXCCfYMmkS;VKJ)mN2i%PU2pj zoaO+YaJspguf)|pto!6XOlH2LslUJ^mjc{=-z5DjQI;cOeTZGY`}%sg@IXW?yPI26 z!^;6t&gIip^j!7OCedFQyLNX?StOIHwb$Vb?EHRB%yg0_u(OmwJW>n1;gMt1(e=9X z;;fx*+8Ti&#xWhm6e(z9c4;wQS8xp^j%?dy$V#%$iiXdxb+=WW$X7IONNS{`U-!dG0a zi>u-ZKHZcXe8w_vcJH$p(Go)E5QRe#V9H~o=!~!FJx9YlWEuiD>78>S1i6NZ{9E4T6MajiX4ub(kJyzsQju0Pb`?uM-yLVsr!IIp+< zvm<Di0)Qjgbn@X0h`*T-R@_D)Zy@i%*cCkO$UGSSteBHb)LKnD9Gj+q& zr4HmP`s_67e)w&VFJqn9(an1@lp5-rB$k!8vi+$4z;3XfukV-0mN}r*>gnp|vd$@? F2>?MsQe*%C literal 0 HcmV?d00001 diff --git a/doc/api/html/form_150.png b/doc/api/html/form_150.png new file mode 100644 index 0000000000000000000000000000000000000000..d651099e52e6d3fcf0a4e1a9e18551a7c0e8065a GIT binary patch literal 989 zcmeAS@N?(olHy`uVBq!ia0vp^yMS1lgBeKvnULB6qznRlLR^6~Ng&Ezh8w6spd`pI zm_g4YHou{N-kP09FWr6l<^QVm4euEkn0-85978G?-_CtGX^90-i~ao>r{DkIrY(P= ztw}2>DJ#u9>28WZY{F!(rAziR{AYe(?kL&tUy1Fxc!NC?YXNujB?f;(jcHYjiWuTu zB-|UgB^It}j;~>=Xc1a6FG}E%jQrv1RKIHToeXx#I~LmAKKk&2w%7x~NguYXn>dx@ z$%}{g>`pz|dhvzakM=wHD|UC@e7?q|Aw6Kyd_`STZ!-@Kw#kPzSMmMa(R{AXZ{J@F zxfn}Z@2k9D4@Ga8u)Bca2ZyolB!#PXxBE(GzbZTDW|dap)4TDl>-75fK0GDYdB29N z@UQE5=sa`Umf10qrgx?_R;`Kqc6YT+Y4&!*zTi*6H;w1-`?zM$yA}5D_|HvO{dZ^2 zM$t^on}4_eDS7i|`l21H@0hJR7QL!@nR>kWCDeR(9lKtyyoYwoN%z^>nf+vqj>1y$0zWkr%}`&T`p$cCBiM z>e4C60=HL`PLiK||LL6-&v$G4q@FfYM zoH^M3ZCAuQm%nopdkpVxHP(!0-r@e%kzxIX_Fs`L9w#rZ{PuQA%+I8+yA)6CHG6v2 z;PJLc+@)Ll9{(tQnVK6r}fULKW*(E&2wd!5;p8*Fw0F+h5O z^aO)7=DYXi-e=#IxbWlVYpbW;J{{a(&p!1^fY4*M@X#Hk_9XC6 zJb;~d2RUF~;7nprQ5ux})kl~Dpa6b@h-0bX!VhsESK1x&fqC#9088mgxks)wOlbwm zeg|o(VtohTTZZhp07+#rWrZ_RJaK=?LFz7 zD;c+;Kf3e)5&#yi?cz+mF&z0otY)tEJOQH8>azBJy8ogjrEP43Me5VrUm`+(L-ms3 zQ7_~u2pA-~a4qp1Y^wVExj6ot>r7+`RPuaY#IK>w&5%p8M4~q1%`@=Yy1mThx8EVV_rdh1kciT8b#*QKi>{`U9S|_P3=d}R>uB* z9pD<6huDLpD{;P-{BnP3?gaBh_D{G;GUiX&-t0F)YBwHlh->c{_0b-6dMly4WKo5& zeKr=G8*}eC^oR&4rZOpATm!X|C;)8+Z=H$9QQeti-w4@8k|?SkhT1tPL&^p-;@=#Z z+m%p9eerloLWqa4b<2(H=lkBc?PCYw%^O8C#6klQP86OVGetp)6Ju>5;|2b^opA>J zEk;<%OWGo$GsY0DWsLk3Xpg!?wpuIv<=rvK3Fu_bwmJ)$>kp7hAj3mkFwSD$u^MQj zMD>P_TArqC{~E4E&gG*!Jo9N()@`Fiw7c5qVZwQ5tT)=C(O5cbLT%%^i!Vj6Pb=LL2n+~*%Y z1L1CcpH)zar73sdXvZs3xiJ@{$BMmbicc?Afa)A0`&{SyPJuAW>)8Xi#PmBk#oDw7 zPhvKde|2*5QORa%rN(k=jxV8EPqd^GcbtZxgmk za!~tJIM~<8BsncgjQg8io475N#Sq zg?Bp3(_-h&<0zEaUt<2YSR+7mMZM+4`XO}YGj0W2@5t09YHS6_;Cj_X;ih*OSg76n zsC>891cEwJ-y@A*6_pJzKY1kq{WGY zfu7o9o6r_oQhdFxP7GQ!*aNwFkO5(jf5gVdb=9kG!zb?7$|m~5=IFIvMLLBi$t}Ig zr%i6rYEQ;|bL@l_cmY% zSxh{c?VHdzz|dZ$uK8CEm+B(ZvWh59naeec6z}h85-)Ixb*i|;?p6E1_d&TGd@$EZ zhTs(By43UFX`ZbQE@%?cNsf)EJHwsVT+2yx+)k65op9ptrw6VBlTL;Df8{`VI@3RP z&%rV)+D9UY_pa5(s>BOhKiNd;Pi4&aJ@?r*G}|t^K_x7z!rKmCNp^9MzeL=kG4`I3 zHjk~5-dFRZ@+2+zQe3BHFo{VUjjFe0(irX#K?;qea%%>Qi;rF$YpSKxVP`WXJL`&v zT|Y&Y%V{`PPTX0r@XY!Zf9@_uhcC_>6IOIH(^~(9iKS=NnWpk(fljCqO*c#%HJ8k+ zlu%s+n~LlD8qzOts%WykxcaGX18vhVz>KTyic4kH>;Ds^x6>H4+SHXRuAOjnf4ea` z*wS!C`7t7X?HePMyH^Dgv>Kh0wKAnSR~`aaf4?ExU4Q)UBQNqq9s63eK{Vi8&T$#m zbT4s>VW>tso!6V!L*&-Mz;TPIoqVgaZL2;@%uG(d5$hcDWKN6#{OXb$Nlwp80Dg1^~Kc0W3 z$-4@ew&cqO({rBlp2dF~277+HeD0JQQ5^hzP6Tr|_AZ2UF&;{Fkmy(&N=y|# zJaN(I6!?~R2(>Ls9R;k~HP)1Uz9;ob^lBFS+@;%OHTe4tSIq`D@+e2wI{rON$~0`* zQD!gcTZm?itao$r=$nN_4re-hdi7;b?k6}N{K^l3g)UMwmQkXGXpc`ugd_ZhK8wXr z!A(c{pNGzi(FkOtbDl+Ntx?6H4LwX@X^9Pz!r}t8Oiul%Bow~t*^qp+Cg{Gyy*5_t;LQEXCR5}eE^Gmysx(0T4ZH`V$I;-YzkOqaG9`O zyE3lvh#vpk5UcA>{>sFC_4b5mJ|ea6BJAE(Y(Miyv)_e38*fzYO+Ti zi6BU=sE7if-_-NfVi-LIqcIUF(C+Rqx%vvDiTUH9(x&TlT+q0^g8*Qqa&$Yqa`A5! zqATWMvs!4*i(s>?k7+6=2WKMw?S{SemYE?Tm6HJ5*QVsJ^G-_`71q_>x@Gs2XeF=5 zt45XHay=&D9$)MC^MAjaCc5&ddR18v7t5a|^p{2re8zAJK^QoZ{7z|9xiyzII%|-2N%(PBDz-c@;g4O(}KN(Y*bpNN? zF6ez!BL|+qA(<7%=F&Y`dn@@h_t-9F4NZNWbr(rP*DCmYWxzNM>!u<3aH8i=F`Fx< z&3wNf?YE-0oa_h0<@s!_%6Ea>FY&&FUp{6eQsCG$z{Qf zS7Q95c8e7OB<&4C-iLiSV%9;OreNX4B7nVJaS0G8io$*2WX`5-Ke4UBRn+jptzA@0 z@7czbF)&YRn?xDT<2m)B&nI-@@~CZMb%3Xuw*7V9TH;@8muF!xQ3CSH(|#I!v7R6W z$aR1qV;;}+8f*+5Fvvt=mK3)gphg0T61t-8x|N& zxe;LIdR0Iaz{ws1p46U$aU#BMj4s?C7rz3!1N?Wx!Ym{t3EC$jcjQ?Pg%n02e#fuH8*DJXLv&ziJr@z>ZHoAY=XxTs_po};Hg=V|d@4#$~NXbj< zXmALT8Q-a`ek@aB$Ss{GtSL6lM7O{!TrT(l3p@7p;M?U1a$Nvbeo zPjruL?{){^zcckvfmoB;0gy$DUG*!?6bw^n*g5wEDuh4F&a|#x>OUlGI{~BSmJh3VPARD z{lrA?2PS;T?G6@P_+Xnox^F>HK2?clB0Zs0z3;G^z9o4!LS(ERN_${7iy7{9dZwB5>T>sOLo?V7VA^l0E}ovup2IT+E`}ONE&x_Y6cDd^>r!lTUU8M zNHougJ{9~B+jE-p+rox9DORSPzq_^SOSzY1^e=Vz`qy|Bm`4Q@#REU>i)$X!;amX066!iPa<}ns zXZvzLwk^K(FjVsEI^f^1)s>bGQA6usfDNTN$&Swwux7$ZIh)~(m23ZAQ>Sv#h5oI0AOM`5cds&$A)50!) zb_Kvhy6-xqAlYQJT6l^M$;{0!#D@>q4{3N>1LOw6)E_gZH-tD0gtCH=cjOycKD{Tx zjEHLqnHHPxiutEFV;gro!@&rxlvpOPYr^)mZ#3QNY&X+}V^h#BEp8?5*kzP|hOmdw zHJIUFH~y=$zlLNOPFCFvdNAl?Yz~CcERE!kmstQ; zf|GCSg8OZ|J8#KXSl+>l;ZyR!GT|*(p1*-GAf3&9Iz!bZlKz+j3_fEK)iGB*7X2HT zC;LiM^K^A6ksS)d44XMUP$BbVQ#svh_aooC$151-ZH{8)fvIyD5$$=G6xF!}6Ur?H zJc@4_AmR1T7Fp+g?tk%u(p6Hw@-#}plt&< zM%P~I7ymihLzj5Pi3s%`VWtfKP?G;G{rq3Q=ke~Xb2toVMj*8|Fg-J_c<3*~#{_L~ z#iGf!s7$go@LUP?gwQGXDsjKviprxsolc&COu__#`TyW z>eK*`F0eOWqM#azhW;CvN5@W@6!^1tm>VUZTk_^%Ib)17y_&MEg9t%Rc#tngZiMUF zl*G}9o#+oqZVWn(bxLSTY$^-3io7(Tnd_sF3cAg5PDfBREqVIyYH9f;&82v3th4LA zlP*ne#9PO|2Jnc&yM=E|1xxp%7=RlnY2vNIBY*^BTgC|4CIshfRqx#94grh=xRL%1 YmhO&;e1Oim_){T-D{CuNC_In&58oVzh5!Hn literal 0 HcmV?d00001 diff --git a/doc/api/html/form_152.png b/doc/api/html/form_152.png new file mode 100644 index 0000000000000000000000000000000000000000..798d455ad86ffb8c721c5053d46f8e162e472156 GIT binary patch literal 6080 zcmb7|c|25K`1tRbn2;rf5bA^MOB%+m2-ybN8B1x#HbeHEk+hIh8q3%|vhVvYq#A`8 zvJA#rwyfhrvgbGY{{Q>FzV~^(?me&jdYPjp8u!IPV+J|&4AtiF5DcDx#QrCP0T85{yaFf{OhE| zwTcP=+_L(&Z&?I`)-#s^YgO2F8h<)aPa1-BIj-PiE{JCP2_>@?oUI@CTa>-YaVnjy zV!gl{nnYIPYj{}xzVfyl`Y;9vgM>kC)ioTmTFq@1cu%Y_O<E2Z$v1bZlNUV&ixnt7$~-#%2}m(swZ8@%=&xfN0>LDd2kSN~3X zJkHgeW%I>FL!X(F5x$@bQKof6C$S&C5zaw>r#rYAZ76e%c{2~6b3StC(nt{h*hbO0 zPBUEL4V{e~oiB0V>3Ca(pGI~HlvQgKA*a9b*o1SCG7O<9!v||C9a$*hqIw~6b~I6T=8DQetC53jlM^a7;qFQ^ zJN@kra*7WY!ZZZz#l8jbGZG`T9ZuH!50z&k&}ked6iGFYXJ-ahz-ktdIyP zNWld|e6_~WiZ|-*8SyfI?T&)D%Kret<(qyvF|Ie9ZXT7+H!Ig4EerEZ7|W*j%VQ$T zbOW87Xlul@$wzbv-;1MIRYQKOpM`90R*zyj_L+BmYTYNMY8JsnB-voej0Hr_F8CJG z?Yh|K-u$2Y`4tZKlOwHDb34VjnMbc--<6vL)z7~WoF zzh{)chC6Q}U=YYQ5Ah?@mX8y-?YXW;W*ag`X}5y2F%`Jn#?UOyba$`I$_wZS?MUI7 zeELoZWk@Os5vQHw()y9@=7g*}q{{3)*F|i1Bywf8S7u@c-+ zN`eDw5=7J{EVE7)mv_y>b0c{TOr!)Mv=z(r3mrU@8+Am$M5T^TR^8T0YMm!Hw+RO> zd>no^+9oPxyO=iH2&ox?|H(&vC+%2ZFg}Lc!tKj{9PBk4NiThy1cWkr)bjw>xEp<# z8B>Qy#GQpNXv-crZ}C-mdi^5hkC(dU0gduM8*QLJf+Ymr*?*o3fzh z)Dclo+R7Y*?kZL^Wddn6oX<%pAXZg4!fnd>*Wu(oqddY>dyj*UT-HEFe~@I(&zq<{u7_I;;gZI z-0ohasx+k86AuuzbJtw4%R~YT&ILb|u;{P0^OQlFSbte$c?7iKx_NUv7pT`!L z4&uI-ESH47Ar31oU~nUuk0-Qk>bI)4M25Z1VI}msMXUMV=igbteBE*f>$hC7=_;9% zb9Z=Ld;grQtwS9W*6=+bI4jD?39yvU%N2`J2Dx`ezyQuK&qc3?k{KLk}$?H zdoOsmDYw>lRR_>@0;tm7w{aBS^W&t3dgFYyHf{{RxP>kKG{0zAluEPUOAEDO2Rtb2 zTa%OVJD%APM!DFD2zxmuwU+9arsi+AT!kZL9@qQw4zNH~m0IiPSCMBLV{Z_6=Js7<^jY0isZl5xv5fXTyu;}*8ZeV1M;0gQNIqTv)t0VP zyY}@x%^?R7kR71w8@_ukz`PeJ$DLn`GZfT9hP|>Whb9gNo@HHZv!TRtRcK=r^aa`6 zE4Wfr#t&=19{cBQg!qNu-eH`5LID$HZKehDmHn=B%%sOl%3OX47YUU@tUd641Y^Ks zk^>HOHnNisa70h-jZ*0eWEIuNKQfKBtcqS>yfe!-TSq=HOZm_ChlgX4D1D zhRR?&;?{3hY?w-RhTvgIsXF&~oU6~jmGxvwIho=sELn+JzOj3qxLpGBT7I?g9EB~k zw7@BOJC5>VE4bn>t3uvQ2868NPhqQYw`_bln6`*!MPF-kKeN*Ek2$k+=uFV6kwfB# z`knvjf^9ea>Q^q-rvro!4lkEu`s}?LKlbm%g471+VtqvB8HiVVL0;m_hbCG8yK zshu(HMz8kN_lGB!=gE#UJj@q~!4jz)T#XR`tR8ht_rvlXFlphEEqxw1;Y-sGsvq%? zk+B~`Ci*>hwQdQG()C-sBI`Qv$$XbI*aD%IJflvMA5_oz$(Sb-znsJZSRvSDr#JFO zOc>edL^wV25b)|*dt=n@w97H;=i&I81L&|snzxixG>GT~j3=}ZhIbxyWi7_0@2j() zFr{$QJSvwbnWJ-qA$XC|I54-J6=K3HO$tV(+HMyPtYqm=YK!ECX+#4J9!@lGCt%EW zsC{i;l0G%PV_5t^h-eU9V5=y`th=IL^&YX^S8_gGsgs0nHG7?GWjn_@8r^D_9A3HB zo$DwSI7;1zx4Nj%v2JGkcua$%V8hQy|IZlzqKmu)%DBCQ3?{>#;H=nFUA?7`q9?Re z;#=Oh;>yGLIIpcWTm)r^@p8@D@#J&3EixbsRY@2shivYb-!ynmy3K;EtX^|ST;$5|DLPBYPCx{NP(tN|zUV~!Zw zu=lJKJgcnmdeZav^L6B4CQ|v7ccrZxxdszqo?HyIq*|fMxBuiC;}tBAAV4B#0@K3* z+YUgqWt3_5^^>a8$YEr=JKGfUcgj`D*iDI8q13^Zoc_M~54a@_a&vhEpFxP+N`RB; zx_aQCKhQ*`1@WA8K(F*uf&2nja>|n%HJBzbNoBgRIK%c%c0}U<1MVQ`W@G*EpLjH! zao2KzVoltVlXt}G+3C?M4e56PkbtWlfJWsHU3Cy`1WP6TT?%5gtNc~_u@Hil3DcL41xwX! zDpdk+PfeTDE;#%S=h=vS!g}KY;AC~k`}B08yfX1O&YuhWbFQ;+=LXcZGJ1S$^w(+p z>m`onZ$W>&S9SwV=^LW}rLhX%0vD}4`o*X?i|+D+p?2U%9(my=4S)z7r;Pr;2@Sca zKxASG?`(Xiz9`Kf_1!yu=}!C7XL9KE(ORlVCJklUlJJd%A@=G7+Hds@{FJNosCs_M zt=ox%8RZ{A=$)VZH0ZPcx$Z`SWSUjOS0Qc{TV^COaQW@B#c3R~2|JO~2)OSGMKEt1 zYT*0!X6J$D6VE{q&6PG)ulCW}k*TYw9&EXJ4~{n$pR0dwBEV1Nw{=5!8=Uea-^#ID z!`uSbg0NA=ZOZ*^Dne}C z;g!XqH;nzJ*rMuIbyEY?!E62soIFrwbLH&Y-^xbU6+(1WDKbWDA8J5>Eo*gXk`KlI zf-S9*6dcffs`yeeyw+#*8;48kXas|j*`$7|)s&?<+rwcc1

-N+e5C=yr?(&=w!J zeN<^^q(CVt;k9;~cicT-`Vx$5_emr&CbHbsF zcc&W6^KUghyTE=@k-}0niY&|@xeijK1PsmW{w{}AUMTux3JT;{LhN3i&Cy~cf zRG+W&OSNm9F)0JhIu$EVXbNgLr5ZBYoGqMC!zTQr6yLI~&?ok3JF7?pDswqz;zAU| z*owczJ=4Sl_?!}B$lW`^zTCN=p8*v+&f|cpL!e65w>D~llHSGH2Dp1*R`uGxT@Ub* zX{bhFB;*Pb0-IQQ@-~0;3{*CkR5ZQXZv$M>(HGp>ef3;wP%7k!0+vUc|@ zG;4y<0V+7TqC(pOpN!k$CJ=tB?yKqBXJ_r$l3A*TkcEX%!ItrxbenB(cUDzRYDkl+ zH1}#MHeg2l5 zIav0-k3?B*usN3U^FHQrmV|Mdb5>A8B)kUFP-#y(Wce~*XFp~&TXpySpj7#_b1_II z*?zI5Q!41`@1T+5+-51sMok?DeUojkuLPpg?(PbGCvNi0VsuZ77$xH$;orviC3gpE zBBQhxlVM{%P8$gR$_untuyd*d4TDuy938q{rbY!-X;s`tA>$%Z*H@MZ>e51wP25>^ z3?qh|Y#Pn8;+PfvC7Smf7&6_nM6XVL&GvDT3YePEoGZs@^7rn-WUDe%CX5{l z!HxkX(4eh~6kUwo4P?!%GhJX+Ly%K87ajI+P&ys*=Ic2Jvw^0%R^#oVjTXisW?C`= zI7h-CZ*?%2?ize|dCMcoA&?Z1()HfSp`2BTwxjx|^)QZEPPe(wL!`F;tZNQx{!>*Me7qrM6l95hNj*L9*cj^j=JlpI$*>i6P8n(HW z;1d2HF=S3}G*^d+~!`| zDxJMcLnc0d=#`dM?c$?wr(k@_6tBPDaLbPVPvpMJnw3j=y`Xs6j1*WI9}uQZeZA^7 zGgKuL%5xLnUs_A1uyH;Wm)n$qy6*b|==#A){d2t@Hp}XTw#T{=OVzN$!ho{}mye{0 zor{eesFY&FK-s6AiXo{yEgr-#N_v-%I=QV689m4Gu@r8Nm&BXNyDbv}Hn!LCXIx(F z-|4MMiGCs@=)dk49X?Am6TKJENca`gE=sh735s5ST@@#osw3zFjMHOojG56#zxF(hrRt47v+#afqsBJ9x|$i4E!jufLUq$Mk(X_}NUL=D zO$N1TcG#HtkkZxBJ~zgRcT-9!G9M3?903jS^(dY%d(rq;oosH?{-DhliuXc4& z+|nV``ChoRbq8nQwm=tn%kSz;-9|b*vv#Mwm_NX4>G)5-8So=J+d%xzC-eVeJUZHM z1ZAu4O+K5>_JBRsfTqvWDGlx0c+u(uiBB_0E`=lQM098Grce(mR%2CW64Wv;Y@!~4 z5O-W&_k)r0a2S&Z=_FVE1iM(NQuZDdiIZ=MSVf1O4YS1oq7_Kz)4OGY^H9< z^ZVS#8AE($6>5RsEeQV3=Zf}WVJv`mPTzu4{`N+o{ST_7_hUftORVM|>Qe%ECL2`2 zX^hnT`TGxhjy6NNZVAzZW9vhW<_7fL7vucVSZYi2>-W>qNF*V$NwwV>KDe9|?pV$` zTZBp7r~u6xzf~~iVH%nKbQDqa8(_mVvrvDl&MLRzIKEl@jv?$WOhZ?D9s0}aq}RV5 zLVEuc4Y81n9bf{f#<18XvCgL@0lt}JA*|zY-n*h*BOe|K_Egl<|=un{3E1to2uD%d9V*k~I?I*~&^Ija{)JJJ!vH z62}a$9kIfz!8bbL`EC8v8lORLutaYqD+}zdnPQvL)Dwm{NL|aX28L6cqNpHOQYhBC z$KVfqw3o!`e|rA8C$b`3vS2^)stW;bGf4Za*7MzCAi|x-ERhK+sy(313jDP+XUL|+ zi1`lt2>Q*LsMS+U9Q)!Q3I)7Nx`7}95b0xIUh%|7!fHVVRL5n>F^ODr&XeuVL6l7*vuy@ zrx0U>%?icF95Uqi+voaSzdyde>-W#^xv%RvT+eeq_jNt5`+nW`ljP)JDJgzL8~^}G zYpaV0005zd^T)eHggslz*i$&1a80(r0o8K=AT?oq@w{skXf|&)=k3|LO9AH8b8!B4h~wp*2R*9mSE4`i*b1T&JHg6& z8f9Bxeb9f)M%`lGW<*bdIPID5a#({Q_$GL@rkI|PQ}juKcFz+Nvea0&4%h=afsUrK zF<2cgTDBc#CHqE(j zJK8npvYQnIh3CQF_xG!XhX%Q9Od`CS3_&;Fs#K{hgzg33MQR@!9#5GmU6JN3-#?w( zdWBcknz`U0a&91%oD42+0Y-@jTyME?Al(=S6i-#->&}RmEzFhYQN`a(zfZdGBC^pi zP`ud#5lQ;9a*xcg!LyNBS$9`n`ts;u6lX{y^EfhYFVCO=Rh0=2ExFCma?sbIJNQItku$qiW&ZzHOUIQBiI-qR>w%l-6%3M-ar8qJgdu}D9ps~=f z0bMQWP+qv?ckn&){OL zYC&pdQ+5gX#0?uW8NH^{aDrB5<05*dKW^&_Rq4@|ej=F;ip$#YdCiYD?K6RJ=n>8@ zp?cn?;O4jABMK7~d%L!IFGW_v6%Z|}zw1gE0*Agy7hGSRD-h*mjOQoz@DFrN9}~zn z&aMRXmO`EuCZ~o~7Yv=CCBq0?5aZJng$Q7~B0`_~ppbNU4NmxWpkk(kO*n4s(QBU5 zQi&KXeT?AONFy}qHup?j(*T{$(#P^ehE|Zy^hMa@wj#Rf{3(pCE-KaciogB*z?AHD z)9{WCmgkA<1bF*g`nP*JZC~Zk@l4DPOzf3PIT|G^W8b$XbF+r*W>IVmW$nheEz;mlP~rfYj0hPh~J-7i|zrZ=$*vDbp^R0+cC z4F86|*+Tu}%H6a(T=#H93EJI6-^nq{N%>jG;zG&1FvIfw+6P0q2pH{tRD>((YbuZFIIrk-0l19pxmqO5k#MP}W zJx{KUrV~u$YJ1#hQkDOt!Z6ApFf>61hV2 zRG5daTYrT|)7z&^Maos>x%?fgny7;w{jFqY>GejEZI5zL;HbPy)%y|Wxz7_q4Ut>? z4h=)gF=IEA(7ZiZ=;BJ*4o=-cn|JkE7IIu)?_g-x*@;|##Zu;7)?rBOJ4H}JvAZvI zzuf1wCcms<$g+^(DV;UOUdzq^G zFzu(0$#Fpd3sYa`S?M+g6%q)oD~$Pf$J!@_fti^wl5AYVMPVef`~2OvQ;w+O#v3ac zRrbtqtSYtvZO~MNIozW;iqkGWRbue-*9|n*%t^7qeJF;0=|ZWqSAW>M$3~;V&SH=DwpS?*eY&{#dCZC2{_wH zm`vw3_9T6B1bPpqLZvv~ZpK9+92-xBK~pPaweSKr9;FIK9Rbb`u3{2E8?&$?{*|Um zhND)jRlJw?Z4EIFvA?SOFrJS%MTH08Cd^w@f7@(6=VMU$gG#u%G#SfMJ!#k&dK_6F z(UEgMVR3yDm|y8YGbK4*Hk3?`)Z1?l>B)bJ>%UvX!;%gYwEgnh9(Xi+6jo~*5cSki zJ#q3n`KNuIBMk9CVqF|L1Xw|Elg;yWuOcOvEPU~B`Lm7to75(B5p8vURp!=L)Vxkh z!f@yGySg_%FhC9}3=_Gi7qZ#p;WZ5bBJn~?@W|EBdTaM~8x+NK@V!OE=3Hg(paFjD zS(T{7i)kf-FpA3=GWTRM35#NAtVu9KAZaU==__9mT|d{Zx=#lrW3W|WBu53}R1w1(yh`9|4p0zHpI$kF zfA%ah8ynj%4!T2D9dMZfU|wTF%PM2-EbB5hGfFgMz5G@1$7VY=@$aTdwcql#!`h(vwp2b}|s5PZyFeaIbGVb67j(?RMll~gzP%rm(Bv7(0`hH$kupA| zFH!EzZJn;KHL~>c_feGZKS+D8spYFFE6gP>>VivO>|a<hY5EQ!?c)N>u;k@fH(KgE&mClJ~K5kqIpQH}o<_yEa zt*^ZPt3<~@fdwT){(S{-HrpxE*6F?o{ZHV`OWwz@Qno06`M5s~(cy3ejWs&h_73^B z(EIEyO@i8dE4NiM)0wg-R7VR^M0(C#pX-908#uJ~=0+-^H0ZZl*M+WIuF%KnHbYsE zC?`$h@1jj+%tQb3Ln`cd{mwtlbQmpiF~?9?P|S7Y24w2mA@)+M#CVvR=OE$xxlps* z11(k*O1^_f|C1^HXGKfYG?N6NHjZ1V}2>_0+;(EB&*FM1~TWByrBWY^J*%BQg7t*6A9)+d3@qqT0T zfE!q)dvu46)roljU1Rnp;aSNbJDM@qb^m#U)E!1uu|rsgJt9@6>dJfg@?v>h$J*4! z{%1--C7XkMucai`1Sl?raRatrc2|F-O5vuVE=;cbN%?UrhorO{&I;0@BiS(w=)cvA z%p)&qNyykWv5&|AQi3nlSq5w19${z^9b^A|*pin^ZCfi{88kWX(59w)REOShCDv|* z4Xgqr`oreE=-V)DS!bmAE~M4hGdQoF_eb*uT=GpEHN=Dqi`SjW8=R#q7shfmzO|Z< zvTrJlM8^{?5+*CZ?gdCyzP!x9)9}5fl5xFGmnz70(yDu06zt8y-O?S4TTin1`mTJ-vx{YzwwJ zcWwMwx@2S8mrdWV$T^U`1CdBP?_{aWy0Tt=f_yW>ito0g!5yc&YZQa8?5X@-)01ug zxfE(+>UNQN=kJbs^I^kjql}(jSFLJ$3cUO@)N$8feVSl#$Z~p8UO9gWHEcP%n4WQY zvUiF6)5m{r&di2Cx9A^Z!anKG5a>A3_I$kdL!Nl-)Rh(#F=(_+`GrdF%LbOpc+pe^ zLngO|XY?-Gz4%tYDE(*0lSWhG#w?`{Iz3^1=SM|ajB#;&8v1Q;r)Q4uv8D{1_yopw zH|Khh;(%YMx{3@U2J^| zW#&FUD~F7hM8fgNzHham#*Da5W(S)16^cq-hm*6KJe1G}b-yj%B^|$9-{YgEgtP^* z)4#$)6g{7L&W11|jb+*G=z^o~w@6oV3B5vwyP6RYv(*DW ne5V;D*2ra9S4a^pm$xBG6mK;gxqI{9&$IO1@c_ zb;n+IURIPUR_HIBC7o?Cf5OuVT*3A;rfpnnrp%|iJ?=!$icgVq6zrcV2Hgu%(w-Xj zUU>N_zgK6EzE9tM^>_Z_<9Azn9kq_sp4@Ek)zweBrR4rek7>VdJn#226Aoh7T4`uz z-%!Xdrlu$~CqsPThTwm7C8eAK}@S|(* z>RE~j%|CXWyHs@k*bZNZ50*>^yf4@J1Wh`AS!=2|!;Yu`h7TFZd)Pjv9eogQ=E(4^ z`g)|vv}v{s6&oZE)LBRVogo|h?&aPz+2cal0`jkqd~#cUe*Tu_(%UC5-gl+*{fjHd zL&7@dUzTLry1ec>`)f}9kDumWmGpOEebjBWcea!0)R-xIa; zg5uvZIJ~aPE;oP5^gQK}!urxz2}eVZ3&h@A6|huuCa=@;qb(YZS$Tc}=dH?*$3FM@ zo1Pi@ZARCm{OWqAi}xSwk&1YA(?wuaKwz{|!VAyrj$5mY{W%UF+U@7ua(nCRD>3CY zdc|vY`ek#jRLz!k5`Wck;&WV3W!noYeSzl3Zg;&pk`5ZLoI2$Nk0OtG^XL98*Tj{1 zHIHsM^FgS8lc>?FEeUD2>sGzJRk}{*zH^!n`-7&%R2oKFx0h6@5r@3FR(cI zx}?gHN#6>5)4eixWTtMsR`t&)-29^F>B#E83(qfZ_G7S+m^j_iU&%CgPX2SAjd5a4 z9Wg47$Td>apkc`$uXwur9v-PpS!(lD#MftmKW=>%uUeZ&`BBF4(oqQWl?j?a958X&i@Vu$Mt}5lBWi~`0;h7RCC19O*%XC zUhJEHx?tIc-p~BfUYofiguV!hsPx;ikZfBCgYncT~ zWgSkLaTY?q;}qt-Dl1v@S4-01Ua*L5u~QevTPxqG3g-VG&uuIHGEr=jpH;uc)zX4P zm3BHu{O`>#Df-lTU*u-F*B7x@UxcrjefV-;q3c`R2HWdbB_D0HXLo0?h!Du#dVQ7O zTpe{YAIm4ZU4yo7a(4d8$!U3$@xff(LnZgl`7^ZdK3jjvPdbdfBfOY{A@A&(Ei1h~ zT`39D4o)sEUST~m=u2*v%&a)JXX#ddeL{S%795`Cy{B5vExGl_G(Rnk`^}wx^PXOs z7xj#XL1v9uZS1KM^CDAC`Ik?^Ua*#>-u2q^v}lG1@1trfcLu%#nR=)EZ!J$OVLZ^w z+fjRi`9S!a0AYrLP1;9xi!yv@TzWFS|3U36xhg4!f6@$pSiiB`N6P$Zxg1~xDiu6k L{an^LB{Ts5-Cph~ literal 0 HcmV?d00001 diff --git a/doc/api/html/form_156.png b/doc/api/html/form_156.png new file mode 100644 index 0000000000000000000000000000000000000000..fc1b5992dc12a57537844ab2fad1310de26528db GIT binary patch literal 227 zcmeAS@N?(olHy`uVBq!ia0vp^{6H+k!3-ofJCxW0DT4r?5LX~g5{R;w;Rb3DC<*cl zX3+D9&2Q+Rw`S+jOLt#>`M)ZC!+W4ykf)1dNCo5DxsE~&3Ovl>f*WPI|Nmcm&quQM z@Usn;DW6yx=6~VZ<1%}d?y8m5MiT8&TVF00i#-=cX*{Q@~#?P3@XWs&L-?=2c e{b>&4k2AbycQD5N&G-}oa;m4RpUXO@geCx`oI)@F literal 0 HcmV?d00001 diff --git a/doc/api/html/form_157.png b/doc/api/html/form_157.png new file mode 100644 index 0000000000000000000000000000000000000000..e11a2fb5e92601238b1d1aa28f53b30acc727f96 GIT binary patch literal 661 zcmeAS@N?(olHy`uVBq!ia0vp^#Xu~~!3-p)WFG1RQU(D&A+A80BoJjU!wu9RP!i-9 z%%JBHo8QnsZ_Uo5m+rp&@_$wOhW88%Oe~%*jv*C{Z|B~=G*^MA)!xCf;>Mo;x6N1z zn)h$JJlii{!l>CR;^Zl%drW`KpCvK!0!c?d|f(y+3!jh8SKy)yv;Gq3izxmY!h4=J;gQ zoX?r!hi3Ck`gpPSeD>8HqFTApJ9Pq;KTa!l=f1WyHA*tY0F^qU?{5EoOQ>u5Y?%Z%ocig{yU+44w zIq4?LcRDVgx9pGhdes9tm!E1JVf=HlhkxO!OK+NkrX7#xKXBHqbgx--gSd3ft54#_ WIy~*4qA#+55|^i|pUXO@geCy9=O9)9 literal 0 HcmV?d00001 diff --git a/doc/api/html/form_158.png b/doc/api/html/form_158.png new file mode 100644 index 0000000000000000000000000000000000000000..b1e098a954e08a3c4cdf513bf39b80c9b1c7cd5d GIT binary patch literal 694 zcmeAS@N?(olHy`uVBq!ia0vp^9Y8G1!3-p8j&6MbqznRlLR^6~Ng&Ezh8w6spd`pI zm_g4YHou{N-kP09FWr6l<^QVm4euEkm{dJo978G?-^QLSJFLJXBewa*jX(eIhY5Kf zRLrc=Utc67?zZ^iAyI~ZybSkd%kIl(_;81fBbDL7#GO03-%srL%JAWeTE~Y*&jnu} zIi^pyWJSj`};S) z+0W2Ze_cD3;YW%&$5E&61$Y0ff4SU6t|&<@df|(jmi{w|^*3)#>%6_r;%rpwgEKpC zYs}Ve;rA2dYPZ!e5xyxlGcdJ!rR?%TIe}dZ)#l9E8d{*sx=U5Vf4(~BzErJ?lWoK~ zs-7eqxoBxIzw^!F2;F_3^iH}RTI%Du^LAL}s`axP4jjDH|9Hck3dRjzoD_CsYnn7l z%suZCrYhtWTK3J?-+2202BEd0)3i=c6XINXLm?~U?#`|)>yDhib#bf9vnT4F>V4K; z!B138_m@sBTsDD=l^Tvv#rfE8WBGYrcm(fBY}+)auiRSR$ryJ=T#F7KcB!Nh;oVM!<5C=rHf zX>Hm?udXZUG5kr@`6Bcv+mkV2Q{gMS{Tc6$?{oXX_*#bdSIP4!LZH;=>FVdQ&MBb@ E0ENFPURWfXvJa@xh)*tx{%Ef0t^L%)J_7=Z@-MXLE((TaGu3N|MqOtk*-_>^+e@*jJ6MP{3xtvW- zzV1YoQ{FhG9gXhmUGjP1x9%TRy-_vN+f&zr8EAsjm{y?1(}x_<4hwO{_Q{0^HQaGQBS`pi#{ zteE2pf4ut0yXdZ%iOj{B8edX6{wNB+e7%CnBHjFQzzegt6`?yiu7662xNGuq;v1(Y z7G5{!zT-Q&u3Ge3sm9w|^8A`RPR~i^vQYhH^CZ$}tLNTK2j!0LC2Llm?g>7-?mdHS zbkd&{FE(@idn4->aixx{$YYD&qn-Q@V=|LcKhE1PeNFy>^lqcQ-w*RD=}wNswPK zgPuohenbDfH9L=9y8H6W|5fQ5-ZL;Te)M#445?sz8+&@vV+EcZIk$$lAO6?x_K;xY z+-yAE@=e&z03jZawRsC;7$5B4;^4yY;dGgb0xQFhSYxq*=OW?>NPZCit7~7LE6XdN=(7qwRebLAi^7PhtTOUdb82fBR?AHK z9hMf!`rE(cKB^#t}hsc1HM3I;s(RLjC>o9lU=7 z3+G#G3tb~}rsHTf*S60^>GiGx?{gmb_+Iv0JmWi)#Ni#AE5b~+&YP%}&-+BV#d!N; zx%5`U<9)er^&Jm=nU~!0WXIjoDH9bYUo8Jo!sGfT)mP_Odr8~2hfz;vRiDe_V_2PA z-M8U|_tS}=F8AEsv3Y)MM%GG(4V!b%PkfcCR=6_dbN#$p=Iuwh5~QM4gqC}G$DF_W zpCw~gs}XBMe$M~%6NOZxUoQAks?OF>fAAkeMH}~_^~)yR0i`5QS3j3^P6* literal 0 HcmV?d00001 diff --git a/doc/api/html/form_161.png b/doc/api/html/form_161.png new file mode 100644 index 0000000000000000000000000000000000000000..559c1e05e0b2abe06e4bda0a2dac88bc9d827ef0 GIT binary patch literal 1398 zcmb7E`!^GM0RK*t=Zd^3UGpAEx*3;pur)@+Od_w4H(exJ9!=LUH+h74=CMc~Q>L)h zQkX*Sl2_E^5!d@oXYQ`fx&OfZ{P21F@Hyx6( zcu&|rbBt1_q1l1}Sgr`(B2)(+2I1c}1%_t=U>3lLOcF`n<)P)88QOMd0ps3)tg5>K zC1zE{Ok^5?%U1=w^r8NcwoC=UHN9fa)4$WL0Y3-{VSvtcq^-_QAk6Gx+m1__!R5t78$Hk7Z=^6fFG9_n6B zqi{glYy_pD4b#4I92AjO&Y@hk{53t0_fKZGl({PBYgQ3!KE>NiIV#ow5AXL-#HC}& z7QSBcderg!g?CBok&0-DRCl2fgJo%7Qlv3C+B9q(G&y>{MI~#~r2&z`_E-ya>zj<- z%VgGngdsAusWS%?OEbIMLby+L%4MUTGQ-sH6O<;yfd%c%I&>H#e=$huaQxlQb! zBDQV3rMWFKwtUr3YSo64gzD-#jADFMBIYE!`h)il)xkiX!;u<}|Bb@qsIZYAk?6sh zYT~Ql#Vj)H@2Y%f<-QNv1$7^v4_N2vCAC_5M?c`Sz;!ZpJN$x?9o4AO8xE)Cx4k1x z0d5JamJ6@_|-8!q4~IB-pGQF2E?I>!uI3qtShI65y(h zU8THHgD*zVr1K}`N}Nn$m3cW5o7@xM>@&o-1ty#1Q!OI|MaQJR*Cdk#dxCCZ^D^YL z10Nl|7JKQ1q}d00w0oQR0f)8ph`Tx{ZWE^)4V@L4y-6> zpoEl&k}}4KE*V1qZa}uG^}7lgzM1Ng#^s?_kM@}_x4WQAnAezZwc~`AUnJ38==1pE zP&Hd`mvfhqZf7kMN+r7K4qso`d0j9?vJ7BpWNG*!muiDUQUgtNz?H6RtU>DZYTN=pOr) zNSlrODw!l!$-D&b9gY&ksDZJL@RSgojbT@FpGLIdA-}f}7C9g&AtVwQWtfRVSrhS0 wZsIhg)>926`iQ$1!5z~rw`uhM{whX+50>z7I;+%a{9y)qznRlLR^6~Ng&Ezh8w6spd`pI zm_g4YHou{N-kP09FWr6l<^QVm4euEkm?}J7978G?-_AWP^jM3>g`bVNEa&t8dh3pM zUd|`WUgf2U>FxTYv?4mIQ}@7ruD9k5`z6zEzux`KoAtx~4NQO9`qzGYHbp+(ZXK`d zH%<3ytA_tg@eI#Ce7yMbXu>_em?qu>o4H)C3dYAVIKSEJ)Zo8H>;d8pVb&KG85V_M&%ii|{cg8g<-^cnQXZLWF zx_f9|w7ebuc=gft$7?@XrYuW|`4f2Ze#rZ_?|+ZY^zGYPxBZ>(+z>t2ZJUnv`R;uB zx%Sz#@8SF@-_G8vot{#yxNeO>@k+0S9NN<~)@g|3wpfY2>tKJi?Y!4Yl@9NThi@2$ zugjIJh)w;XV%`2?gVzgLJ6BDSZq+XBQ-z+-Hx?fI{(OP)Bs=vl(>(WF>)NQH>w4e% z^Tk-7!q@9W7_D5otO7qY+TL2cS+0Ft6Vd`6{L) zoV}lGu4bP2vx1X~4%>}f3j_2x9ojYY_g;CHso8e&z^UsCZY+4Qj@4+JUGBoCho3HI z{^e7J0s-OGyDr=`;i-ZCwSuJqAy)K&Bho}U}l{%hsM>rK7W3?JIKZ}0W5N)q#a z%=AS-|JLvM)y3@Rb}dcI{iyc3>@m~QHOE9WwXcis?!Gy79^QrXul zI2o)~XlQmxznLo5d)50b?+005yOLFW2N;T074FoWHeaGkWdE*(uPS^spYLnQ{_gjg otz>oPlAAs(KLqXD_b&d+D0`WIbI*Zo`#=fW)78&qol`;+0Qo~!-T(jq literal 0 HcmV?d00001 diff --git a/doc/api/html/form_163.png b/doc/api/html/form_163.png new file mode 100644 index 0000000000000000000000000000000000000000..3716fa9c5f33f2754ab3a3d188e5e4e0c94df05b GIT binary patch literal 948 zcmeAS@N?(olHy`uVBq!ia0vp^mw{N6gBeJ^&d_!OQU(D&A+A80BoJjU!wu9RP!i-9 z%%JBHo8QnsZ_Uo5m+rp&@_$wOhW88%%*viFjv*C{Z|B~gv{j3z#h!(~;?dvx-_$#I z9cT?Z8}oM7t!a{_VkK5DRqinT$!GY_TFg*?>R2V)k7%>MD$4@)d}r9dRfyxk-MUw= zx>mlP=h(Jl^{+`@5{z@#M~5Y*SEk;Ny7_(WHOu5zUR~z< zVx=YttaW^@#K|yq=N3EjRg7OxzD}--u~^c)Y1gY(=74*4oWZ_d1-?#tZ@i54#~suA zC+lKfDeMw`a4=?7=&PiUi4GSnRtYiOH=7^0Li>KlNv%~!^h%`iPKDH%|1M-dRb4MR zvvyVem!-$pw#@FgUiio>e9_TRW3{vQduPlKU)x~4|IzN*m$V$eK1-BPPM$LV`SZ4) zOLhoeW?Yi`SuA+r)*Y8-?9%jcvN&SFQ*EBF7@n~zdXqfc%@;jRv)6k^X3MwH zf_vvSU2ROb9y)ivNd55?hl2rsPpkaQ&|RmpEbp{@Bx|L=^MTyTYL9iHhHK+|;AMqoS<%_@R9DS!8)|u{b&F|gIf?Zp#u`c)fwSGeUw!(lT#>snK^_p!W`tx_K`sMju^3~=m?bqVOPm4X=#*uf&F1F&x6TS1U zJ5O8Wd=h={rps|}%C5?#*Msx&7;Y}%$^5j>zU^zc57(6AQ%|?Q|Ge|<^e21!!z^x2 zl@6ZAS$!Zs_FBR1Z8Z_UMXYx{`J}?I!uLz%gX&CmfAeoQOt$7X=ySK{v@TxtJ!f(M z$DJRF?oPYpU3#{(V^Q{7|0v|^1`pR~Y% z-L*S61%E4B$9y&Rn?LKMV^4jyYiD_0V)&rFn~`zP?d!i>fADTM7Fe)p*Cu;~eHXTB zE%>-olp*fzQxS$8(T784{3<&bx>LLDit_!S*X4H^6~Ra>cmp-I{xhE{4|-!m3*$ zUC)Fv*R!tRF95hP%T74&X5o)*2Y{2^C#z!YvoB5#)m4lpKd820wDgpRYA>(M`mQEc zNo*F~%**4#DF=P$IgaVhV`kZiAD8s%Fs2~^;)Hajlr*jGpD=FWRF0{Vk_E>RZl6*w z3@1%ae9pz(Pzi;17#+j7xX_i;7=k*1*RSs}?v~22*Q#=Jm4H>Hl znnV`%_Na{03uCiDPp9a`3CZCGWAL+(6XW8Orlw&efLrS8t{!(#aK&i!l&t&SU_7)i z^OLxYbKsm#DJH*pzX#YYr`W4<^4@c*H3S!u@lw{}q|z{8T*;-Qw;HO#@O8_jHhxOFa~-4Njd6?^fO6|$#ffyEV8eA5vwSPp}0Y5R%)&oqpaK) z##p3W7B9=v-6O_Af%3rJZq59ul`C;!Kb2$ciz(GHU9=!h3Py^9ALfa84BR~4U~Ks& zJ@;+o3F9jvtiE-Zp_ShGEfgG+ujkQgpmMT#8jej1vv6?2NC}>0npccBW3n-#Mezos zP9>_-p)t15_c6wbQ7Mq_a8r-6U77B^0_g9e1)*EEP$ZuHvPkQ`im~r|Lp?^r%jLD6 zd%|clP0_GX8IYn<-uE&;J059x061>R2sQ7`TDNw6XP6!Gzo(^UxygUs5wf%NA>qvw zfXlPN7GXGwovzi=2;=}ryZ!uXv5|9|Eh*79CymyMah4uzL!f`Bl{&H~mGl^`gv)DM z_^vc>zB>E^#!X(>l->xH50|U%F!W4uxyb*_3;l}OIPd8|(+Q@#0=xGCQ{ zf01&W`Zn8oF91B5;Sd4fJ990CUA6k6Kmd5MrOQomVv8hhG4_{Yq%>wKg^6bR(bmkz z&AJQ#zO^4M25{Wn&hjV|=WC2u=CB3C5SF=1skv+80Pri!*DCpr3IO=W?GLrJ97KDN R6H)*G002ovPDHLkV1mwU8C?JX literal 0 HcmV?d00001 diff --git a/doc/api/html/form_165.png b/doc/api/html/form_165.png new file mode 100644 index 0000000000000000000000000000000000000000..af572849ec4f6738f06839effe3980c4e6d1c232 GIT binary patch literal 1260 zcmV#MV+H_z&VD!?0Q_+?e)9nEQ|5gB8)(D&qpSh{ z7i+`e4*)#d(4J)kfKP2_t?^PcwM(@cxIpo|PeWQsPgOHiT7KA-N%N!3&yJ zZKwKywKxWrc$;GKi)Y<-OHKy?vlNf3bQAB$8Vk2R<=D)cCo`)-Sjf@og0Lq4Z7M7` z13DG1n%0*?GHWxXz%^Y0lk2E+IhMaHfqDhnGem(@v^u^e@q5;IS0V~1^=YQ7AaQQl zejD$|n%SSG*QA(BlJnH5B9d&O{&QI)cg5YqGfDJy01q+$>iCDw=!zE=jrQoxuV_(s z*M`1jEs6MNdX2`GS?Y}LO}ys`1;cFEe75N0pQRn}UaIcGsyq>rNMrSw^^Rn{;~<1E)_VeQL!N7e=sLVel^5$j8^3JTOTC%SBK52A~FU}3KL^OH<>rlCzXiOFo8v;v& zy^Jt{G>#hKG7Is_bc;J9ja$%KOjws!chxw2{Lx^EFcb%r$vQjDk0-VaF@V>56Yrii z>OIQB_$W7VpdKuxWY&U?Wk{)%834}4*Em0-hsA>~d+t*C(S<-s+L`yz>9xzRs~}!O zv?l1870t3d)m0sqqP+l`*U$nr_8?r06Mc)>l>BrM036<%cn`Nh3nEvc(Kcn)OgS$A zd}dWvK^+F*^=hN|?r>dtDcWALGbRA^Om%&J$h{x$bJonp`^(kHtfABZ06wyDZy|T$ zhed!!=dwwfT?a2kGg8YdOaSOvn28YgRP}zm&sihCIPy5{tYLac6F~FYX70ji28|CN z)S&e$XwBt)#sq+#x!~iCt~|y2hP5_oNfrP;wZrCX#Rh;oYrGWg4`2d7&wBApjr$91 WS0UYof=Ckp0000` z2q9QINu{<@KjqP4uSVU|n!_!?9|QPf08bVGew+PDQUL$h`e_3AUDow0!2i>RUnn^B zzbtqI@ToOlmsbn$sqKQNr2K@h&iR`j09V@uuc~iIbxRL$u~Flcr?x*g>IdD?>DzRp zc)gU9bEs~R1rOkCo8WEAqcL}10Wy0)R_0&vtxLN%!K;)(Fn3=83RdoqqtXiRS&_n$ zTp^Hr!fHDN^#xF{wpe(r-ckv9SOqH>-sq2JOB6hdW3p|&0%Z1p+zhLw2|#8guXvzZvw}KbFtVQH1#GPGMVg?XbfQuCcAB|6==~jq8&4;bn+T^0^evla*GpWkF`4eN(usgA^1o~MHsO2Ai%G;~; zzN4@ndA;ZQHS9_YOp;XJ*G`W2p`gewsaDOpxz}o`1wIH9jRfFqgB5RAvAkR`FOjrR za^y>3+cXK>S~iFW{JIo zR^DfAAiLlilDJN~#c%mR@cn1!waL4QTtL1Ab``wagW3h(y>`A2g6}^|7R1SN7QEC_ z9ASLZ%)QmE$L?xiEf(Nv-ok^CPlm@O&vb((^U`azUIc$jQ+{=>QxrT(3LKwT6lpKl zA2a+C*hd+@d+mIq;H94884Vm?($|NpP6Kn~pIS=vI{3QaZ9(zclpTWR zlaclxdJu7>{e7sXa|A_xn>H)ersX_Dkz`gjp&(~!Idj*lna z-VXr^7N_BU;daNqJ|iE2U629p?BEMk025m=54aAyZ!fEx?1qy!r4E4~7JVPBNqmz({H0KT>q k$KU@eWPm$MIGjlR1w~3J?^zNy*8l(j07*qoM6N<$f|DM=V*mgE literal 0 HcmV?d00001 diff --git a/doc/api/html/form_167.png b/doc/api/html/form_167.png new file mode 100644 index 0000000000000000000000000000000000000000..df98a4050375f2ec5004925ac657644fb4febbdd GIT binary patch literal 873 zcmeAS@N?(olHy`uVBq!ia0vp^Q-N55gBeI33G%N7QU(D&A+A80BoJjU!wu9RP!i-9 z%%JBHo8QnsZ_Uo5m+rp&@_$wOhW88%OgB7T978G?-_E^T^hArN#h&Nb1N(dbbHkZ( zn$zd_EJ2hI>i-B+r;#D#!}ql`K1*rYfGAay^{k9`kjcoAXPW`L+f}>SleH@|LzO zIO}}7Y{s04K?{~EKD=;z{^_h$_TN>*gc43=?0Ms0eB6EGy^UJYRnBSCbIO0^cW+I! zRmndhh6^8Q;I=6$K`LO8j=&Zp|aRWws~IY0JExwr-8v`o{sA zxNkq<%5a;L9%`o%{&=d-%lnTrR_@%#=aBl8HO<&(wZs-bIW}SOyOVgIwiO><$bCR| z8}IJl8MDJ!Kegk1RC)D20es@Kp>&49pY@72m+XN12pX%C{a&8aP z+cVozSN_rbTfKqlg~GYhlCnaZmniD*j|g@CY;)dUqcS(rvw=ZBVw0h7!prz?`bH5E zM`gGBsU}aIYSXRQkbhy57ys;2dl&y)d;QSF%<0)7?z0{L-e7)c!^*Y#Vu*7PZ>H?h zZ%>Y7ao64F56wCLO3_en`;iG}CTu!z={m!D39-VI?~M9eA6(k@GVt-F50d36*@jEz zP5Bthymo@u2G3i;8|82D9Gtpo*00@*7QWxRC0nlcPTf5%j_*>*?(kd9KGS$-pV^aC zQ_jjo0yecsY{wgYBohRMROb-%_Vu{$R|`P|v=*?eix~*E`8` m=FgITApRl#CF2L>Ka7ty37In literal 0 HcmV?d00001 diff --git a/doc/api/html/form_168.png b/doc/api/html/form_168.png new file mode 100644 index 0000000000000000000000000000000000000000..e75bfaba80ccd1f8243ca07a1e6f812d26752384 GIT binary patch literal 986 zcmeAS@N?(olHy`uVBq!ia0vp^r+`?BgBeI3Y&G5rqznRlLR^6~Ng&Ezh8w6spd`pI zm_g4YHou{N-kP09FWr6l<^QVm4euEkm_0pR978G?-_CtKX|)AUi~VD5@yFlmZ*R?U zE?|-@%39@DmaS=}$fC0K%A|ixfA|}s4H*8jO3W8Ius(t1NB0j?tz&mhOt0wI?C535+lrYFW zuMo<&e&l(>Tj<}VXIX37RrdenkNv%x>ZIBe9Gaj9$8Q$=zQu=WJJR*OlEf?&Y=I{qj|e zx#HM{?Pnjay0Lb@SN4on&E@MP?%lRC&$s0Z4b(io=F)*ZS2qM&&KB*im@)ShPtL+! z+y8cFPKmtTpC``P{&|6Tea)JiSG)ggjFK7353=IPp-R0Fv~ji1Lme|fvi zYH7Ul`Lv_ESSq(B{XUmcR(haNn=n&ej<`pGPJPt*OwnO*dRr@!2o9Z=X4zPxlG;bl|(`=w4tTLrH1ES`Mr($UX4`X`@sZ|e!0t9pvI zS@2`ILHfNfpW~*kx$bGQIyiKl?(KB}g}c<2oqSo9&hRJp3zPTEihC#G)J4SG7oMi9LrqewK61RgP3{du{%Z=B_or%JubX5Vw!i0>A~*{{tI_q$hz^% zAoWW6Y0(GL4?Z!i7Vqz@*u9)_pP=>B`RaTJ_H+DaaAT5K;1GIx4k(9uy85}Sb4q9e E0Gc4slK=n! literal 0 HcmV?d00001 diff --git a/doc/api/html/form_169.png b/doc/api/html/form_169.png new file mode 100644 index 0000000000000000000000000000000000000000..98b4cb436e73e8686fa61fba97dd859741a9382e GIT binary patch literal 781 zcmeAS@N?(olHy`uVBq!ia0vp^wLmP+!3-n?4L4{5DT4r?5LX~g5{R;w;Rb3DC<*cl zX3+D9&2Q+Rw`S+jOLt#>`M)ZC!+Qn>rW#Kd$B+ufw{ve^x~;&|%D+E;WCG6Ty8T$A4cbi*XocH^|#!n~K2Gv|VoO5sTzmn`n$$JeM+@!x`6@Kwm)(LvB z>PCo1o_yrpm(NOfyDD3~u&}$3IsekTFs2J@eZ|u6Z?|leaX0%WYOCtE`|YgwOQr1n zQ+8ZB^+a<<@TMX#FFvkrTB`IOH4?>=LXuK)BUM%`=X@M;(-fpRbH7{bI)l#sZHznXIk*->#{xNUmI(!IbKcqKX=}gbJu3%Ri{mj z^O_m8*!r&A{veBpP@jK|b=_Xu*Hl$F+gqAPUn#2W{o`F)T4ndJJgf2Tm(Um6^PYyi zK2*M%?PmYU#)Z40i^89zKJ)PiH!Q7+crdv^N3nRRY2@hx3wF=aE`tzO{mv8E{Y>s3%FrR4Der?)b`6|~n{8rQ1qRU<0bl%ajan^QKR-f~}Pkf6o9VYEM@`mvv4FO#qa(T_ykk literal 0 HcmV?d00001 diff --git a/doc/api/html/form_17.png b/doc/api/html/form_17.png new file mode 100644 index 0000000000000000000000000000000000000000..2aeb29e90eac5d518c44138775651b7d117549dc GIT binary patch literal 632 zcmeAS@N?(olHy`uVBq!ia0vp^r9dpj!3-q#RXk<{QU(D&A+A80BoJjU!wu9RP!i-9 z%%JBHo8QnsZ_Uo5m+rp&@_$wOhW88%jL$t?978G?-_Cu%X|V#&(fWozffx7vzn#~x z=;F5RW$#M%ze%&W%p@l~$@vf02mYjU4ENg#8>BQDYa}nWhyL7}7Py(?&EXX<3)vs& zirigWv@3PCpYxu#=Y1QbPOg68*3iG;g=)jy*CK`09GMJPZj>K!6J{&W>jhUtZ;&g~Ho+O&Juyt;a?Mgg1o!oFJb_FuxsX86p# z-gG8RqqQLL_4${tcj>5K{c`w9`*O}=?SJi$QrB#})8e&f^PwAWXRe!n*;hbYUs3cqrF;6c&DH(-dvCqf zea61aEWCd&XVj%TtDi^z+jM67uj}{sF4J}NU-uz<7oYL!sWC>ua)(b}e9x%2cg^lu zKIRR=ahLhS!`B`;wBhuFMH|l4#GlE_Dm@vVcP@L^tKg*=l;FLFvcS)z4*}Q$iB}kTf8C literal 0 HcmV?d00001 diff --git a/doc/api/html/form_170.png b/doc/api/html/form_170.png new file mode 100644 index 0000000000000000000000000000000000000000..32334e701f51e9ed3beb4dcb56b4e93e26c18141 GIT binary patch literal 1078 zcmeAS@N?(olHy`uVBq!ia0vp^cY#=xgBeJET`2t#NErn9gt!7}l0cNb3^!1NKuM5a zFoT{)Y<@%kyfr(IUb_48%l}pB8{RW8Ffa9VaSW+od>b1*?X?DvjvQN0@817+<7^oo zvn>C8?##*SPZoHU>#WgIToTXl<37U!^E8GB(ci8n7(C=)_#oSD$$UV3ZB3x;rTszA z*;yLmBf_`ysK3&C(!Z7AgM37|dC-*u;Xh)YFcU!+pa^O=S;h-^-*#;-_sn&v#aF)EngM=PWl_;#*fo>d@f_C*nBhB zOZ{?y)31kzSH3z^>nvt|^!VwdnXX4?Hm4fC+?pMFo+%;1(a3Va*4K-7-OM%8IktDx zig~y9@~lY-{1|vw%U;XwTi0jTxzW4&K4U1xT1D)-`5uXBvz1(*GC zjQt;Zdj9*zt&4XxdzEuv%8ft2Zgn=F@7sGtA-k%ej{`mWf*6^!mn{q>A z{h$868L8-!`HJ`T(|fG{y0w>Cnv`z7seSprzQv1$Hu{(PC1T$e$X_ir+nXL*x;dfq z_q5)k@-6ya%E2k~Og25vTj8d$KV8$h_~JPQ4ZiB8hwN7my6h4wnHE;TEHPaq>Eyg` zE|tArLRTI>*mn7}Dr3X!n`?KRI~HuP%kRrx3AxY4rABobcb?03f4QPFMP%vbAO-Q6 z9d}opWz%xVdVcH5?q>0GXAgQ=n^~za+?i(L=Dk>dg@yLz*uXTA_tS1NGL(P*yN~Y$z zFdaCvgqP>##NkyfLgjq^c?V$p<^kYa2EIaSYr)Y>LS*-md{}$>~y4)_c#P)M^OHcnPh{&rm)7SNDhVZ}?yF zx^<#%lb2Yx21B6u|8guLdK0u(1-h=q-%JqroR)wwb2HKC3~(jAM9D(>(@f1TQCBnB zb~8h)+<>^*g`1x{-8}Jc-Mdnl@BCZ518JMpcR_IkqE8{B6C|2IM;g%&HmCgo+*?@3 z9>9~dyG*Z9waCQ!g`rjiEiR>fZ#T{j|C{@uL*t$Q4X+&ZLtzM3xl=k_aV>hfs+k6( zBqD!8;=DNe$UjC))`2_83;$w8p7!Q);V<(dPy5Jtaev`o8hYX^dByw2zee}Oe@h6n zPg0FH{+On5meybRcjj}ks%lI5mzLJM|C@XN$^GB(?)*ET4*rysb#FgI${|)cXzXxjNCOC}PXjArAKC!a0X`<9y zs1zwHQ(o7FH>7C{c{Ere41Zebp-FD%l}l-~#T>x-vX#q@usew~N}`)Wspa2uUk=N- zIS*2-0C15WUK6MnPzrVVOQNsSK#_vvM@h=EJ<8~Ef%oi8Gs9Ch(zMV4LTCqZFi!Me z%w~|GVq|6kz(v>!KEReiv+N;NWyW95o04?{eY=fG43`sh=e0sw;r{bsL?K zksAmN&@l6u=^ffd>tdDU`p53A0I1)}{nTq>0C1NIF91AvzO`vU?X( zTb<5(puEuF$-C~dhp(EC-8|fFu+Aac`ua#PA?ZPy^#F=4bO$6Ggn_-ooG8} z+v^XLR$K0Jc5Rqmapj>%L&b`|^KEZfE;v7Ywd~W$s{x#!vI51!zdp~**!Os6lw%!J z#Ubr=vtNd{>GdB-j5RS}c~hkR{8jYa$-QsYzRi3cw)J}3vEW&a+pf%*CM>=8#?sEa zKACp%W{DHsJ{`TN@W13|)f(0dVGB*Fq@P4cJby5$&r>jHl2w><-6@qhKi;y>J-Mp* zQf}Bm$8}1a3)UXA?982FpLXHr^Nmv!tJk;I)|iEITvyO35^uR<A0L?2dqpPJq;N*M z;js!QFU_u#cZ1VAa*U>_go>BP_&&5!tI;dCS@$sN)b`XZr$eou-!Z;b(<{5O{gIQ( zhMhM|4eS@?Ng1@pcknF!{`A(39nY>`oxl>f^^3sW$%+lpOU@m;C3Gk_rQprlI}Bfo zU#tyPIye324)w&xudb%8$kB>2>c6*3ifM=I`n|rshpcvl#Jq_6z00&X$Sxkp+r0VJ2 z3m4XP-o5?n!iS#^N^igTJvp*%;i_!Hz<7~YHN85tNY zyt`~uWI+4280G`gE{OqCH*Sv(i)AzDwLk8gdHUGYju|{#1-OkLJ*Z6Mn#Fqb&E^R% z&*C2N#WMccXuhfT_vN17pS0U{J`jGhkaO)c^)=ef(wu3|d@7miUr!RhQyT2oD}Maa zX;Fq6v6Zo@EDZdIO_k333qRl1yt=MHsWg_arKUT`{#{}I)st&zU*A^yHyJ$DRU*=kuP<)?R#@X~yv-*$kg=$T9!1%4>0&{ki@4 zM&a&@o>r}=SAJxScT!b-yHCo`d$aJT*OQtXXGdmDeYZ!6;ZD0`OM%}io`0pkm>$0~ z_A1-U$k6X>bUd*|`IE6k(wCS#8;^kfm36LJk^6MBuH_cAFLze>&dCsQ_{p}@a-BJe zdOyP!`7UacYQFp1@5#zv>!cVeB)^&L>wX#A!^AKxV3Q%w-HDA?dSX94KW>%A(cFKr z!dmgxvGqkvO8fJlEHV1gI8{F5cI3g}Naq-aX$!fo_O7$3UT2`|W`2^-O~ojr-1M*Z zM9w~u?GpkDKil~gde4nlt-vTrQkz20{tw@+L}Sgq;l z#Cz+w=cm1!yC*<2w|arluActoX3u_T&anNZEB@&#M~-1@?aI6@+Kj;yQ{zr^F-+6= z^m5PFOnu?d_IdVQE00?I?%lHXXZ5;T4u(2yjoh0%4uyKRMRl}#D>qFDDSW?tM(wmL z-idb}-z)xZADMmi;iXv&55%3b-oTQS@UGIt8N8Mg-q;sa_FMbU+oiBo-&UTXPGH@{ zU1o)O);nIYt8d9J+xsOt>9_lPS!4gSqB8;emuoWoaLZVotZWlp~~V{D9UhtM#*fr7<%!nD^B)2-`|0 U{=d2)36$eKUHx3vIVCg!09`xF=Kufz literal 0 HcmV?d00001 diff --git a/doc/api/html/form_174.png b/doc/api/html/form_174.png new file mode 100644 index 0000000000000000000000000000000000000000..c78a71dd586cd2d299b3ded4f2d994f3d91bf50c GIT binary patch literal 1042 zcmeAS@N?(olHy`uVBq!ia0vp^FMwE_gBeJgZT{Q_qznRlLR^6~Ng&Ezh8w6spd`pI zm_g4YHou{N-kP09FWr6l<^QVm4euEkm>WG^978G?-^RYq`=Z4o^R6YP;{SHritX0en-_J4~u>Q8q`M<>X#ud4oey{&NI~G38P)C@-X7le{w>;$wwR@}9|M?>o z;Jpc0NRx$R9 zQqxwuM6)n#`Cc|VQSr{Yd;F<}YE}E^XB6LW_}ss7Mz-|do{XL;EAnE^|K__afBbmD ziq$KbFWj5F;@s<9rCYcEzA{DZ%!Am#!k&}=vWosiOGxRoi6lWw9(Ez^={KVcPYWp z%R1~cZ4+0zs=qe+s}wzZXW2rA*_z)r-L9-iy7l+;y1wK^0=*EV|x74ViVnS?{bUZ8kE1v7U~dQC*Z4D zny;@fTKjRA!nO@wN9-@YV88Gxw)5A^8oi{Fi>D^Jh1kV+oVvAl*Sn59k!x?3JD+WS z7IiIqnX~bbstwc6gD(SHq2t`qf_1 zZr97U%3Lo_*go~>H7PS?QH?ED3VGKu8z()>tj%BeNM5i- zg8JHYx6^6Yf2PQrE%s`f!m-1m`cgY*qej)V12S@6{Wxvi zJ+?bm7Jk#8DlhuJVBwse;y5X52Af&EB>{FBPfJ@{l>O(D&# zTZFHk^!l_Y`ccsdZicw6iN?EFLtU5}ynoZB%C!@c!r~wN6uQXw z#e<3A&y<}&=@)TfM>)efy6$zmJiW)#VE$Hgk!{AVZOjZm=4~`&I$*3_zB|z{HOr6v zr31r?mtQS3 z;YgX!q}8`q&s`fey}C_BVdc_kKg1vCGt@~f<9xu&b0EKwmmyy1nuV{1TtdeL;{)#< zV*d5MKE{5{cz*ESM|WT7MV@2&^S)vS+m04a?k%y(c9wYuKJS(Gt)AD;&v5_H)WxL@ zit|?LFsI!UnNWV_cNxpiKBr6nnC88Iv-eZ)ujA*cEUs~Q*tv})of&JavTrh4Bu2fyJX_g&+11CJHgIjfCwe*R z)V6i6s}B9+W3F&D511TnZ1^O(c*gu1pDw@rH{5oU3N_>SB_41nADXZ{HU7tqQ|e+( zEw`(ez5jUcH*;B`{O)vncN2LbAMq2h`KOgNebvKa@BWPFs;OSE@p-Vy4Y`}$vI*bA z>~{2~mdG`EE7;j&;JF?XMTS;*=@ z?jJAa`v&W7?b}<<5SRG)?-@g%g#Wir9m?6PAF6OUBks1*?F}ctrks*_;;^MIvN_gE zXw~X!oh;u)(Z?U3_5Pz38k@JtVDo=6n=c<%nZ%^-kR&sWaK=DqB9^4;4?rMLF`guPui?@d`k(8n32lRn3)S`-$|$=SVHtIZ-q-gBab znGxTw0}{(cA6R=VwY$6S`@37qSF>GsU#@=1E;H+RI(Pn|7?t(iA9Kqkwn!eheq!?O z*!xoa^TYF|r4;ToohTwv+4=UOetFHA-5R}bjEg_74`ut&Kf}IfrOn9}7K=k?&Nmwh zxJ=$1xal$Thvp5-X4t(<_;{zUx=u%a`qRqw?wURyj(_v~Y50WkpMj5gl{@pFp9Y3K h>~;s@8UEP(VV1if74_kcZXqcDdb;|#taD0e0swtG(q;ev literal 0 HcmV?d00001 diff --git a/doc/api/html/form_176.png b/doc/api/html/form_176.png new file mode 100644 index 0000000000000000000000000000000000000000..20058dc54d07835bca3d4a6324381c30bd852655 GIT binary patch literal 568 zcmeAS@N?(olHy`uVBq!ia0vp^5kM@#!3-olg->MxDT4r?5LX~g5{R;w;Rb3DC<*cl zX3+D9&2Q+Rw`S+jOLt#>`M)ZC!+Qn>#^s(ajv*C{Z|C0L)~vwevR&b0(8T}$Z#y#_ zto~hd?bNFq5oagxaMrT^crLNDX7)4l*Gg{~-q_c^VBB{=_h;%;ojOy=L)+4ldp-7l z+of@UdD$HQMLKoHvo&_ztfGzxUY@(_DX1$?jFC`P!_{ zv;CBc6!_Y!e#n@yJm~s&C(~LwOMZTqy!j)${BEfOj72_a`_ooG>XdlUaWXu5@ArRv zzZMw$@mr(S)luW@S*5IZH8d%F^941A9fudISvjgo&)=4^uB&V|`M)ZC!+W6IW=|K#kP61Pv5u1tEARvxFtT&~`M*6|TerX? zU4O4p1zYr{mcL94KlELg8EjnYne@63?qf-~oAl(y1g#0>Dl5%nJG1`YxbpXI{7g^1 z&3Q^&G?w3Hue!^(E@efKkn^%hzgZ6+%hAr*{oW1}Y>QQ*j77BW%0_kUaWF^NAj zYeU|qd#x?ZdC~Taf#Jh--(8Fc_`iMSoN?#K{7-nE`OQ>v5)eFF7V#ynYL(I2yfUeDp+|Os=370lv^_5^65V*~ sdUJk)Pe<0=h;+UKyXSplIPm_vxN;op_8Cm=mY}foboFyt=akR{06kWdMgRZ+ literal 0 HcmV?d00001 diff --git a/doc/api/html/form_18.png b/doc/api/html/form_18.png new file mode 100644 index 0000000000000000000000000000000000000000..6885843dc429cd7a707ec8664fee2f37e42a2c36 GIT binary patch literal 534 zcmeAS@N?(olHy`uVBq!ia0vp^p+GFo!3-pQcYo#wQU(D&A+A80BoJjU!wu9RP!i-9 z%%JBHo8QnsZ_Uo5m+rp&@_$wOhW88%jIEw7jv*C{Z|9yadu+hbW*>WS`-{K#%O+^u zE|M<4VK_~h~X*jniW z`+u}bt@<@o}j@L-?OhkF>%g>)Us+PW~G3VEc-;81s_{##ef7_~(zw^|^%wK02e)VxMoUd6Bb!E$!FFw&)Hty_+(o>tzGUDF`FUFKH0 zJxBV-w;YSE>0HXO&Rr{Z)q3aoHHxcBr#{{jssC(kC~wcUt;%uxT4jTlhhEp4keMnw z_0<`>i?L#d+orFRuHL<)Z-dyM316RS@l4A1m)voqa^@AAF5#ogKGjJu{(E-vbdAC@ tm9li*NOj9!LJy9wQ!1|7s?#w4r@Va&*Vmcf6p}!(>*?y}vd$@?2>>JivY@y9}-yMs%Q6&p?-~bTR`#JmtP+nsBBF0a-Mmr zB4~qB@PxAYde>4bZZSXbI`ts^?|k<;_fALNPUF3QM9BR2an=u^zH7H0w~}bP7_?!> zg6|J=YBHtIo?dNQwEzr1L=qExfS#VA=L z^~{BLGP}PCH@}Zr6!tx<{L)=v@$DMCoWuH^0pCrztBPJ7sdQ$vxpwyPnciLf@8h!c zw(y#WEo`ghkZAt;N9^~Upo^b89rcdM9k{My`RrYa%&KX%A&(0s+HOYaTsyd|$K$Vc uyW#=gufOcpS~b)w$A1nKV7Onkua4nIp3ud^->yCZrBY8)|cuz`_D{Os&#Yi?%K z_E+x|j6U5l=l62xHk!Yh`=(;ixw7npS7EOMl}tp79e+gLU9J}S{l&SjvyN`kDVr}4 zm2P`6A|-UM%qy{p*|{#Uj?6r1okb6u%mgaeC~B8ay|+g9aIxASmnk6uUz~MrFX2z0 zC$wqhNybN0n%+vV*v(tLI!ob8%KrR{+eVziCqoW07;b!fw>bKgwQ0Xqsit#5^aabO z(yor2pNymzxk}90DN?Tar*`(dOilT!xV@*Z`fjv&^zWdR$7R#~ef=u7*B_jI$ns$C z%iY0KAI_SVT-3Ijmod)QDm_wVQWXU87eD+}^f4eG}`C^@3an_B*>aDEhEf9NwbOTfk~R*E6_k7DHc!&82NT z2UO2+mh!Cov+uSIgWVC%t+NvgjPBnm@Spql#H;l#^Mj-xi8LJk=k-N$Yp0zX`aO>g;2ZI9&DqFT-5ZWyZn!Larfux9nbOb9-g=Dy!3dRx9#yiskvE zQ`awg>mxMlZq(NGc1*{A{jrMY6V%8QmlYG=v~z~SBMVN<<}V$XvajlBN1bHxH^~A|2cD$J>#q{IjSlF_ z`HQcbr%?OWy!(~2xbCs?;L@`u2W%Iyge{HA2)F-QD!ehN^^9F+@4*vnJDdu(imhs^ z?|!YlrsBDpez>sSExv@7kZWRnohxU(SghZ&{+ZMPj;+(PFNQ=epIPK~+dlD~&i`ef i80J5I#4r26|06U1U!E`1_GOEJl7XkIpUXO@geCyb66pB= literal 0 HcmV?d00001 diff --git a/doc/api/html/form_21.png b/doc/api/html/form_21.png new file mode 100644 index 0000000000000000000000000000000000000000..ec30a86e7e284caf43e61f6ffaf8dad591b8e9c2 GIT binary patch literal 794 zcmeAS@N?(olHy`uVBq!ia0vp^lYv;AgBeI#NcFx1QU(D&A+A80BoJjU!wu9RP!i-9 z%%JBHo8QnsZ_Uo5m+rp&@_$wOhW88%Or4%Cjv*C{Z|B~=G~0lu#eRNn-~0dDrsgQ9 z@izWnH8)ezOxR&s_$9A>tUvf0+B-B=8}@T7bm(NL7dWQBtbWS_w}$G9hVvix`ZvfQ zytOs{eYbxq(+<}khdLjsFIlAG^zPj&%bl)u(|8KljTvGN+MOv~yhY)==yK1md*@j) z*Btn9H>-r9|G^~(tsQsPmHTZzVQs_xQAXkbC;#3pvAV$%&TM}@H&`atBFpH^qP1#0 zGC>DC1k9dyB;7WCnxS&cxzEa@=iAyyM!Sa_Hm=<9OM&O!8hwwNY( zZI(A@*6r|}u4=tc?Yiz~U%!3k`|%n5W$`~AZ4p~k_2HMX-n`U+lc}QH_;ntInch~q zy2jK}cGcFx{bozwnO(fPtA6&L*|XzvKBq{S@CVf{z8lqfH0#mU_sF-)7b~FXjz51*c9r)0vjAIX}qr z`s`dYyXeX9`l_uXCx<^ymP|hTe_e9J{SBqB4VAM~muy+6`r_A_nwt!F9L|eq`YG_< zdJ^>G)6+i&&tq3dz11m?71q1@dlTah$G5K*U0QodaDQM5#|O!E_AT3e|Ag`UUb?VM zy1_ccZ_n{B|er^a&rgzxpYZ}N#` zXqL=gR(eUvZ|M=wbKh?M5g}eOvD|BZeB&Rq_lC`fa6Vsth~aSsIEbFgDn? zN%5RzVc4$0@PSX1Av$82Oe=T1p+Ufs)Mct*PdVlur;GBE@R_%`&OC^4BGUOE| zo8Fbn{GqV@{?p|VX6y{*9OegqIoz4q7pAXs|LGJjuS8+4rFV`@+2k*HC2B#~ocyZ` zS1#IdsUnNp5at8k4SKS(NwY~kX9sloCpBWXo8A1Fl z7N7ao`<$ssney|?3%N&KW}osVZ-}v<^+%$4BBxEdvUQ@_?cv&)lRh&%kUVo$+w$5HmwyK~dE`Gx zmf5dgXZL2haz{q>kwR62sRx6^wxz7FR=>J;((U&Lw*0)m>9_SXr4tvIYshIgY=3h2 zNvlu!>Z@u06{PsyrXDfkpEgPM(O1>gQDM_I9bQ)C=_6FDaev{v(wtCD-k(d1RCo@# zYpUJidYv)<&c^eeuOfs`C~2sw|BIF7{J&i)NHU+u^?mQ{(+$Q-!?wfdrmetspx zjw2s7u3P*2Y1Nx!o1VCoDzh>aa20FVtWSNu`J}RWxHjVhwmdGkYJCQo1+q&zK76TM z!oYCuf!~zpVyPG2PrNdB+FFJ;@~5xpsL!qL*qu?v@WEWrDE^vIN5J>L91Q#TkH(8= nFx0SWJbACq$?%_%VSktWgasnDtpD5UK{>|L)z4*}Q$iB}PdI=# literal 0 HcmV?d00001 diff --git a/doc/api/html/form_23.png b/doc/api/html/form_23.png new file mode 100644 index 0000000000000000000000000000000000000000..751c07892f687ba474616209fa8fb6f1835f9e9b GIT binary patch literal 772 zcmeAS@N?(olHy`uVBq!ia0vp^{Xi_v!3-o>JKlge1_3@Hu0Wb35M?jJ4b&h|666=m zpyv^r-_SpA&Ca8j?!Nr;e^vU1_Y4e7#hxyXAr*{o=f3Q_ZN<}SuY2v;+rRg>Ey?j+ zQaC52i|PBK6$_JZOmLBVSI_v5@qz9mrVsxc?=t*Tme?=3Al{I9Py1Ge^9GE67U-0QD->kVWwYk-1IX(yLIP5o*(eb?+|7Kuj~W(PSG zT3LF0I)2CVgJsp;>J^MT6pp5-{ND80(CGBRic(a?|bwTCKZ%e1-nc5{Cj%w{L zc8T>dKDE`dVej;v+pj&nWoDq0S~KhaW5a--Px|8sDWN>AP9(z`UqkbUASoxeV31A{H*PZQai>wEBJ zr%chr_IYDXJ)78&qol`;+0Elo-LjV8( literal 0 HcmV?d00001 diff --git a/doc/api/html/form_24.png b/doc/api/html/form_24.png new file mode 100644 index 0000000000000000000000000000000000000000..65d1e82b809a01647731be738e4e662b76022315 GIT binary patch literal 863 zcmeAS@N?(olHy`uVBq!ia0vp^Gk{o%gBeKHq@*4IQU(D&A+A80BoJjU!wu9RP!i-9 z%%JBHo8QnsZ_Uo5m+rp&@_$wOhW88%Oy@jZ978G?-_DILdTqhu!hc^x)9d&Bw+stJ zUjLdobJnUSk2l@fCN$B3Iiq1eLp|dM`3vC<@f}f&b+UV;86OyP9WYK||6srP=qBbG zH|B~yz7Kr+R37GEe4GC!X0PZWh94bLjPsQB81e)Dl>J(HUwPZ^_g-&w|9)IJBX8yM z`R|3Ab@zyzPhGm*^QXj}XBJETc${Irv-ruS(~AH0UEj4PYU7?GQ605cZd4c5`mR|f z;H3R^b@(Zz|7WDaYUZBbGv(EdJ@!j-j%0QEp51aQdY*pFYAu%rb{@;e-#soJyk_j! zmr^MC^ngy-t!L|;EnMZ=g)YzCoD%1$!dgg80(}}6F z)0f_BOG}mQP)ty9#i_DeRAI}gdPFqvneQ{1# z^u#XvCeNRnrfh$^^0$iElPxZh)ms_Uw!Ks9o^0PAvsXzi@z%MRa|JCkW|_IqIx0Ei z{`>aK9UkX9w&n_XKMH&$b$MFJ=`CNEPq~t}^|z1at@q)q*Is7Wl(Y&4cjr#XvSg{t zdU#Fn^-|T|85^Rm?7ucY)@Wn2eb+yAVaaJT3YN!gnU(ZC<;}U$G@s6;uQ|3jtM%2) z?45jL>u1*{^CVkV?v476rMgbSWoMi8zS#y{(7TgflQ=p1@VWEb8OlE>w-r5|YOeUi zjj#I#=k7IEn!&Kj$oEsc5SUU4GTy^X$iG`_0cb+S?s`7xDdug;Iv+ zim`M)ZC!+Qn>##5dyjv*C{Z|B}DT5TZU(l53}a^e5~x4&={ z%#jYC!~Xl1;?hOjoELKLD#tPYv-rgILGB0d1KSg#4|qFN^SKXPe#mrypJUZ`h6=l1 z%Dc1cB=7zUyl30-?)nv(2ks|6Mt$b}YZ|tEhPMva?dLPf6pzKkZgOYnpYZq+$6m+R zhD+6&%_h0%8k={`xNa$Sb^n?lc_l1sKI#XHP2BV|^jePhPCot*`m^SpiWj+`7xSmG zPQ`z}!KIifL3!(bp18NI-f}mbGB@v~e=hq6ZkOqs!|w)f;%c>=_;k+;hW%-;qH|)8df4uL5yQHJ|D^lg ztv6Qwx;=+s9^>T$OMdg(UtDlGdq+&f<fcydWk1RYt^}MU} PKuN^Y)z4*}Q$iB}LInu6 literal 0 HcmV?d00001 diff --git a/doc/api/html/form_26.png b/doc/api/html/form_26.png new file mode 100644 index 0000000000000000000000000000000000000000..a82c461c453738b9e6ebc66669e7c107e117d0ea GIT binary patch literal 590 zcmeAS@N?(olHy`uVBq!ia0vp^xj-z=!3-qL<{KUcQU(D&A+A80BoJjU!wu9RP!i-9 z%%JBHo8QnsZ_Uo5m+rp&@_$wOhW88%jC(y@978G?-_E^#X^8?)i#%ITE=8kJG z&b+zz=FjC>+1-m+Steh|{2=zg-XV^0AM1X`8t$D;HLMGt=rV2B;(PE}AhnQTyOuI@ zja+u!^lj76GSx7|n&jH2$~<5z-Fl5ZU$J#grme!>pCOkQ-ikS@#&B=JvK+?eBHgBj zS2jrNpS-KOqN>8sP9LwLCZNm3spE{wyn+rYsgZ^Kxr<6%Th{b62sO_2Ls2 zXQl_~l}>jrS;72SE$xm~R&w7Q`(&%rj{SNiXWJ#ua8$l1ihgzF!iTiHY1eKoeaG0d zac|Y;&inVx_sY*d=a?*;Y{@j!jNzWsVSeB6Jyoy!m)IKbe5Y2PA1xa5#y#h}q1Swo zdCJln7ya)|^6~n1#RQ7x)8`&h;0X>yIPH-7uE%=hcLAKUw8 zdQ=LR^Kw^QaqSF#`ZRR*s^5jdnqFBE+&|B3n>k;+Gq0}x`CpNIAI}{2&BpoWrFBJI zA6hmPYu)te?%rl=y3BW%#b@0u>)JKHemP#k^v8CJd1&31-LFq@9^gM%VsQD})cC#^ xj*@!f*Gj_q4m`h@bglltB(J?%><{iA(|4T7vq1jo%srq~;pyt_JV^1c87 literal 0 HcmV?d00001 diff --git a/doc/api/html/form_27.png b/doc/api/html/form_27.png new file mode 100644 index 0000000000000000000000000000000000000000..70eda2fcc98002c588b2b67c13e414a03078a9f2 GIT binary patch literal 628 zcmeAS@N?(olHy`uVBq!ia0vp^`M)ZC!+Qn>#>bv6jv*C{Z)0!vJyGD%@sk!h^#A``kta&C zQo^EAej&%3m-<|pC8mt#$Lwc3Zd>GMvOzCUEc_iWvL@8XvWb6DmVvbG*=_o_O#BW%KqPiZ-i z_JuvV>-FJ?+2@e_iIP)%R)=xE+{bfCHE%5GchyS7TE zeY9=OG?LI?C6!v3rZb`Q%m2mCm+>;_`=`lT_+5+?+q(DrFO%MDzpeyx+1xlE|1NdC zPklx5=Jd?4q)u~P#)kWhHy0W>&7RH9#Q31p{sZYd^p@zef mW50Xw6_xYhObmaRe=vP~%eyUN*`%AGwBzaO=d#Wzp$P!Xrv=vl literal 0 HcmV?d00001 diff --git a/doc/api/html/form_28.png b/doc/api/html/form_28.png new file mode 100644 index 0000000000000000000000000000000000000000..0af97768e41c44ae499bd2d88a50175f798e6bfa GIT binary patch literal 716 zcmeAS@N?(olHy`uVBq!ia0vp^-9RkG!3-of{EgQJQU(D&A+A80BoJjU!wu9RP!i-9 z%%JBHo8QnsZ_Uo5m+rp&@_$wOhW88%OxB(*jv*C{Z|A;Vx7dKE#s0aR!jr%E%jRL(VhxukTw{G8d1MJof!rl+J(w;}zezf7kiTO}!KB!l7mKGpP!;#~%dg@6kh|wmQt^qK@x60uuFVX}@`$q9 z+`8h}yn}jnX>+$!Z2uY_6XTTenbFSep4V@#1JNpLuU|{MmSMI;%BR$LM(q3csVj_b z9dotWHp{|$jpf;o=0^ETr@SuBbhZtQjjJ~e|E;XEnl1R~^(Pa|BBxe9t`7Fnod4jM zU$IZ(ruS=CY&)uUQ29&Jl?AoC0v>lpkM6k9%Uu4~I=idlN;>#nU<(@Rrq4_~`B zHS25a$+dA-Wq*zBC+JoFD>)qHrK$grPjUP1S6SCi9Y6J85o_S4ytX+0c+a!izN<_- z>^{0LpOVaQN3lY1;_`y+pTAqjUOW3MX7kC?%$&pT<`&IWTz780+j-%9>-kcbrT((} zy=`K$Idn9j@2hH*?=`o= zFX-7)9t5yeZ zSG+Z6h;P2V(fG9c{*q#bIc<0QkLiS+-+cRbP*WA_1Ct$ADTcRR<)>cQ9Qxh(K&Qkp d)*tR4*x9;;k8J+fy%UrsJzf1=);T3K0RY?SJxTxo literal 0 HcmV?d00001 diff --git a/doc/api/html/form_29.png b/doc/api/html/form_29.png new file mode 100644 index 0000000000000000000000000000000000000000..393275b5a72360cbd2bcbce60f28d1aa2587802b GIT binary patch literal 717 zcmeAS@N?(olHy`uVBq!ia0vp^T|g|w!3-qh?M+01ltF+`h%1mL2}Ie;a04|6lmz(& zGw6B5<~Q`uTeI`%rMoY`{9l#6;XMNblZ~f~V@L(#+qpLJ*C}0a_uHf4UmQx?;Pd>FhgvYQ(JE!4)L$Q|HFNwSB9zIxfWOY#Ogt`}R z+8g?=`JTGQdF&PY{Pf(;JBxYkH8RhrGVN*m_Vmu9*9(kSWtD7=?EbFdbJzN{3nI;kVaIrxfwr zUVglK|9tPrMX%kiOxF1mvZ^#{wNhcW>V|aV(%+@;_u3!ZCw+O_{(RSrlEPB0$8)?k zWxxESJXPavR2=_pJ^7~_?6sFpsm|fO`g7U#P@|_RZ(oFz?3SASG)sO(%Z)`>f9;Cm zZ;*bmVoFf^hF{r#N`j{vN{eS-*|_YQv%RHtN8eh{TRo-%uTp;dCfl^6#Q#Y5c-f+P zKz2$;VsXJ$^#eSo)_q>n(zs{a+jCsO6FsHxZ@YGVdb{qY*7!C~4SU(YCM5^f_&pZV zOkTV0S8g!7g^T~SUt9(KXD_*MB{4r+eC@qer?r-umHg5zj{2W6&dw}}u3Y$-!M@qz z%c?2XTE~ncCHpdGn`^dhar<}n(n&h+yVneZe^_OoT=r49mcgQJRdL{yAHUCJ&P-Zu{+(e5)5BYO b413z^lU0QeEbp3H3QClou6{1-oD!M`M)ZC!+Qn>#$BE+jv*C{Z|C0Kv{*r)#s1&H6?^{Qe%B!Q z@QBK_yvkMI4sG&fX-lh$+QIt6RD!oax#WT!5TP_;PMZVB*TBHc#$|uB;!HHhQr$CZK5OlmT|F+n>)z%5jzO8NEAYkERZBZ({=BejF^AQO z(?J?Ob;p*MnVL!+-J^55(EEm%Ds!;*?un<*KaJFV7?FA>t$&wXL%0do^S$U#eLo0?PZ> ze0eirx8Ju^=`Eg1qd1p&vqzf7|Ll5N{ypf&rkT>)Js+%>of`G*>Y}MP&es@N9*94@ wG-C6&cZHvCTHW;j#_%J(VtQU0!;kon>;cT&_Fuymd;ld0Pgg&ebxsLQ05Kf>F#rGn literal 0 HcmV?d00001 diff --git a/doc/api/html/form_30.png b/doc/api/html/form_30.png new file mode 100644 index 0000000000000000000000000000000000000000..51f3a0e1dcdd6262fada0c69640033840704489c GIT binary patch literal 687 zcmeAS@N?(olHy`uVBq!ia0vp^O+YNc!3-oB6|TMlQU(D&A+A80BoJjU!wu9RP!i-9 z%%JBHo8QnsZ_Uo5m+rp&@_$wOhW88%Omdzsjv*C{Z)0yyTCE_E^NzXe&;R@LVq&<{ zFU;BJn88rc*{#8Jz`Rf?(eJ)z>v@+~E>5LBt>ujztPKAo)rC&jKR4OaF2iUXK7ES$ zaghnPm8>-OS+uPalfJrQd8JvP1sB8hf=i!XHw4{O@T(Np%b#trj6?XUN&2THYQays zm-_DFo>CFp-!)T=Y;K41oY8WezOwZ4E%oM#(gO;P*3Ke~GIH@=n#(OXKAH34$cySzi8PHufMZwMY z+f%1Iw*nHk+z-w>(a>RZV}q7Er)1f>PHpzPCy&@Xxp$Z;v90Qds`}&`g}TM}OqW^S zsnp2WUFq${`{w`D2iF!~JosiE_nHk4c(!ly`W)5!>v*N`WYddL=U%pz+I>oxe0p&) z{|&vw#gBw;i$>P0+@N{w$G-_|4f7vsBrc!y!d%~AYDAA?|BLf?m>3FLybR9meDrg3 zaOTpI?b&f_R~9_ZT`Oc#V!ZJ7AE&1gjb~L3%E(9ZGR!|>C~!VRRps84;3;$Ng&HyZ skx{$8(zuM%Jc#jtDW5AR!+-XF48q<5Pkw~xZUQAcPgg&ebxsLQ0HEs@Qvd(} literal 0 HcmV?d00001 diff --git a/doc/api/html/form_31.png b/doc/api/html/form_31.png new file mode 100644 index 0000000000000000000000000000000000000000..42ff9edbe38373a51c467f0d952b32a64a47609a GIT binary patch literal 795 zcmeAS@N?(olHy`uVBq!ia0vp^-9RkG!3-of{EgQJQU(D&A+A80BoJjU!wu9RP!i-9 z%%JBHo8QnsZ_Uo5m+rp&@_$wOhW88%OkJKXjv*C{Z|A=5TWrA7y8n)_$BEzj-&zPn zWi)DT)_$9@^wjdDY;%%-tNi2s@H>I$zu$$FhqTb&{1z}0O1R^fnL*shX$fvh&Vr>31+t8Ds0=X6&Hi+Aj* zqg&b{c4pKweA}S(_#dOifhCs|KgW38yb+{+vi@9Un*COxom0Jq!bM*hFO1CSmstMD zf9aI9SEIZ&Q`^PvRK7RA#y$CtMRDfWRk5Dj;>IlBPc1!eVVk(-`@Q<+xWwmiUUO5g zRz7X@4sWg45@4}{dxPQk6JNg`*_0S6@nK7^wN$3zhb>y(PY$kV^}fs%RR2&YKhYsZ>ui5r4WCvC9@!HO=raE z=h8b*Z+rg#(B|E))32RasB_xZO0RPJ+O5l$-T7p#pR>gC?>*(xr%xZfy7Ts6=?nc5 zy|{as+jiY%;0UdJ+ZFke@s8t%OZ&T%cd~D{>^r@RTYSCxk$LZyaauZ^VOQ5bAUNfm zpPJAC!>WRt{+}jv8cq{=`okpAFR^g@@mXx`%MKPLzhbuDEm2ncB)7>sd-A;7(O>jf zXQ~*<2P_uxxNmX1arwyydtbe;{;*E`CYlX_Pm|Sw1fNovDKRY#P$>$+WiSx z#Lzxrt^QNC9|GRJH7S28|1q$CSl6rB5N)9NuT+cSzvw=OXQIL&t5B4UTa9Pw~Wu4S7Pi{qp@I+l+dYoI#t-73-I=i%YaTm1s+%7f_vGLNBUmfj# zYI|iIXJF`-Fy#$JhO<)cZ|mOH@J~+i7=wP{mq0Jg_=`5|f!yC6+?`t}86y*Tc~jo|9Spyx&MW^LqcQ2) zJ4TslKA*!ZPCn!h^NhWb)s``%So^?K??o@{rNrwGvTn9LkeDgfe(2lua>>xACzd7M zyuDK@CZ?#M*jGw1SWP`Q!B^_UjtcSDPlB%M|B`#a7E^ppg!4_|L2%K zlWP6i6f3az!R>W%nRlb(ZP&k>`YP4eJwGXXMWRHB-faJu>8qlqWUW#2s@q-7)c(|T zam?ApDW8_KAGhpHDRDoXe(l>fX@;ve+#SRZPpq6{w3!ZZ8)4h zo7;B9>VKQK0`2qrZaMGU-}&<0i)F9wT>gD>d9Lf?Oe4|qLeqxgGewfY^S9Wx{XHOE z_4AFfPwY{lXY!|9`Fo2*gQc5gs&9NKd1Rb@dWYpbyBgb)JxqIg;|{0Wscz9^DUeq? ix;y#9`dX$x;y;*;?~1VX?ygx4O3t3HelF{r5}E*T8&J;x literal 0 HcmV?d00001 diff --git a/doc/api/html/form_33.png b/doc/api/html/form_33.png new file mode 100644 index 0000000000000000000000000000000000000000..9bd74be0a488616ac75a890ae3ed6a541a36a2fd GIT binary patch literal 743 zcmeAS@N?(olHy`uVBq!ia0vp^T|g|s!3-pYzE70{QU(D&A+A80BoJjU!wu9RP!i-9 z%%JBHo8QnsZ_Uo5m+rp&@_$wOhW88%Oktibjv*C{Z|9zz_F93*MPI?q|NsB({+s5q zlqZ${%C+i#7GP<}7CdQH0`~{@2H_`y50oFIH}pHKW7yBHS=q<%pFKWGkN1J?k|3@F z+$_51m{8-YS}8dGab%#^#7Dy856oewZVL2MZ@(OOm>SC#{U_EaB|4jZ|tc#6DgmET;N(%bk^K-^-4j+k4JabLs17O*YwWC2OKn zQy*~v#Gj_ASdbiftM{{XRLhS9R*T3Fr=-%);YG>wa{rqjJP7>$K zl}~ct&a}^eAD#V{Cp~+0-oDhMD|&XHEp?Gs|9bKI8iv^Y8Ue3Ze_C9A75Chf`*Pz{ z*Sk>#(xMxEV-2(}vPwryiV09$wzu}{lxYidllO+DP5pcEtnJh;`Q>j?I>oLpsJa?+ zWac6-v6OW;Q~wH2`?W9EjLCZHrNWQ4Q#Z(MWi0<)pwlQZhizNX6yMM!&T`G_>3go1 zi~X}@srU5S|0ehQ?DqE|IeYidXWr*I`-`RT%io9PAF%#Wc>CzV^pN%xCZD1cUh9lj zyC2G3IZr6-QHJ~fpSsKijgb{991l8Hs0D59jB-6K=#;U@zGLI!ZP6mj_J?ZyeAUNj zaeP%`LvRm2XLPQ6tIbL~jjczY9-8r`jrE6Rn3lNa*=I-pJ&tZHIsSN+*yej@oVC8P zU+1{+eby5t9`lsF$N09zt<0EfV$QI?CYiV@L(#+qpLJAFOZQ%uvsmvt<(FKO43Cj31UK&h_Pdu-$;~f%1)D zU!Q{~lo2*JJAy*uFFT*6iqsrb>KWh`H5d*2RLsr zGT0yTsxJ_IV13K8U%tEc@%miWhV2`JEHgzkHD&#|3{BGZ=>@6zx_`X+bLX@*$22}J z>|3s-)!(~MMc!V~$>!xq*iej9X@abR8jnMwe zdHciEXPF*)wnKc&DuuQ4b_E$)an>52zx8|ZgQ7oT4_K4y=RN<)^?JLb%f7Jw!&4>7 zwAS@K*cIk9aYs;KQ}d|{k5c)})^>HoB>XmON&ma!+I4Hu+nbD5SS-4hVk*Cap*{6m zK)jXXrJD+lpSJ9uF7xjtlh><*Va6mx0z+8Yvp9Tme{Gi zLe6}v#)6Dn3*8Bs{OtIdo1VLuYckk$|*j2yU-!bpuHCOv|`t0m)DKj73 zebl2dd#z$@@`hvAyYE`>jWk_ybz9!siQVt+m~HOQwP^WRwR}_Ml)9wguAttlE}BQg zcQL$oc+;fUQ2atRyfav8>WjR#~9a-SIM(eJL1q6@0A%@OV3I-1kZS}T}j6J#i`_rfgd0CmPy2E`81ecG%k4==(M|% o!LGgAU)=hD^bdPE#(%7T*ehlUXZc%RJ`76Hp00i_>zopr0HYsQPyhe` literal 0 HcmV?d00001 diff --git a/doc/api/html/form_35.png b/doc/api/html/form_35.png new file mode 100644 index 0000000000000000000000000000000000000000..7428bb930a1fa9a30360b18de1d1497358828b93 GIT binary patch literal 655 zcmeAS@N?(olHy`uVBq!ia0vp^^*}7n!3-otk0gizDT4r?5LX~g5{R;w;Rb3DC<*cl zX3+D9&2Q+Rw`S+jOLt#>`M)ZC!+Qn>#($nJjv*C{Z)4x)EivGkQ)6{f=+D3W>cm`CbtQe&vd-O0^RbAQkO z8}0WP9!zCTTF+3B{??3zVUBOQw7x@(&MeLDQ7@Rj^SvwHp||GEFv&yhcHym+ai#1Gd-o_T0VyBWTyHG?9Dm2McRcveJ!;48 QdO^v`)78&qol`;+0Bv3!aR2}S literal 0 HcmV?d00001 diff --git a/doc/api/html/form_36.png b/doc/api/html/form_36.png new file mode 100644 index 0000000000000000000000000000000000000000..af7b640ad9f19ec03c2a972fe51d6241bd3b296c GIT binary patch literal 654 zcmeAS@N?(olHy`uVBq!ia0vp^^*}7n!3-otk0gizDT4r?5LX~g5{R;w;Rb3DC<*cl zX3+D9&2Q+Rw`S+jOLt#>`M)ZC!+Qn>#=o8}jv*C{Z)0yyyQ9D(Jma^+kN^AE^6Y$P zQkil7oy`^*8%{=@Xt6We41cy?Ok!;~KQor$L9v)IL(Pepu5R{%mq~r!FDNnmS?Q_G zP>}BQ&bq;SdR?1NKOe(`i+^VSE?)hy{ONvyN&oobCrfwc{k@o;)C4*DRcX8wrm0FO4|0raC*&^DT_Yy#Qu8aE`CIZs~{`nmZI6`MWQo~ zecktY`Q_M48EHa~CWu9cJ6*bW=gU1^8F4digXM?Z4e#vwb+NJZ2M#<%vajY|45Y2sI_$M2$Cr@yN^aZh4qZoTHyE9oA4_49vN znST6w`fuhNW%e`7*Z02N`#H_>q4t5tv8OM@1hT#Vc=Ds(8T~)sXC7{QpTNxjN%VjA zk4tG6UVE^&>^ki4_Imfug2e3NIkz8Jyl`8WZ0f)`??ZFO50Q&s8RnhuTH5jR#I+;q zHl4n4o%>{tLc!QVhQ8DOX1)=xjTV1a?6|t+ zOKYUn;YJ~Wis-c|%m-#y-d$V1YuRg`9-s8j#`}!dt`&N`XV;|)4QJ^&j0gIqZa&-j zxr*6dg_Yrc(yE@ofBb(Lxxe1>^;wa4-Gt%K3{m-?|G#r-25T^U;J>MV@iPBOHuvjC PL8;2q)z4*}Q$iB}{DmVy literal 0 HcmV?d00001 diff --git a/doc/api/html/form_37.png b/doc/api/html/form_37.png new file mode 100644 index 0000000000000000000000000000000000000000..f0f94795ff61257f88822a842c3103701dff4815 GIT binary patch literal 698 zcmeAS@N?(olHy`uVBq!ia0vp^O+YNp!3-onl%?APDT4r?5LX~g5{R;w;Rb3DC<*cl zX3+D9&2Q+Rw`S+jOLt#>`M)ZC!+Qn>CQVNl$B+ufw{ve6y*A)+?k|hlxc2}5+uSE3 z?_7(#b$d@}@);L7cNWeGRjfY_=S`J-(A&Yl|1i8^`@v^i9|TgFD&*gAwq~UIGVnim z#`<7+g_EL3%eMQ>HI4av585l767}TQCLG^*&ohy8(;>eOYaq+<$^V^HFx%tQ9b#}kExH0W2!#gL&GRa-fw!Xe}CHVf_KW3)0_$H<`JKk?Cj%Qd&?8HH~#Aqcs_M)oGtsEc^hi}tWOdZ zWA*l3{I|i$XN}dXnpvl(m)ZoddH>wKoVi?&sq`s3*GctKCLi5n3f8+WEjkr6$G+Ep zx>Wk&oa0P3uC}k&)iM9*F>p&h5ZhO>l)p2BYxb4dmKCWtic4ReuX|j{{p7vDgQUGP z_@oYBU(r%~(!1`7LBsWj%XM;-Po7eB=S;EmUlngT_w1DAGu9`&uAAH&lz-@XxYYsf z0fjU`wGX-|H?}__1iH|LA>i(GOyBW^+@9$abtDKv?bVu7YzdVkO#*38SS$W0G z(mpmvpO5{A{ga6c{8Th;?XR8}dGe)b_k?V%S-Y0!T;BeNwLm^QWbNTMGn!vY>8+c^ z{q|b<>gY}XxArjZQ*wR!c+#C0&OIxZ#z>tlS-00J_x4}rY$L&4$E(hRQYnL{tDnm{ Hr-UW|a3(M? literal 0 HcmV?d00001 diff --git a/doc/api/html/form_38.png b/doc/api/html/form_38.png new file mode 100644 index 0000000000000000000000000000000000000000..51552f56279f7b66205805c86d7fee5b5f990c62 GIT binary patch literal 622 zcmeAS@N?(olHy`uVBq!ia0vp^=|C*b!3-o7_bvoU7zFr)xB_XCK$N`NswPK zgPuohenbDfH9L=9y8H6W|5fQ5-ZL;T-t}~G45?sz8+$wNsRED8IyII<|NrM6pCjP0 zI^+9_w};oY6nJ~QIr#YCb5VwW!IPO7_UC_NXt-~F^IR*l!E*M7?`Ll9(N|ET0~`F{n;%m;G!72H|*S^b`j&kELk9M5@e`z3Z~OPo#q=ss`l@vqZU7RmQnxG_Zs9>L>#S(^ z!&l2fB=*`oZhyFUpK#EG=md#VwPn4p=dRWg^VHaLcdk1_@xA(9h6m@jJ<4 literal 0 HcmV?d00001 diff --git a/doc/api/html/form_39.png b/doc/api/html/form_39.png new file mode 100644 index 0000000000000000000000000000000000000000..35d93c18b6f6bfd214ce8ec6ff87665df975f6d8 GIT binary patch literal 419 zcmeAS@N?(olHy`uVBq!ia0vp^20$##!3-oHKB?0M2?Y3rxB_XCK$N`NswPK zgPuohenbDfH9L=9y8H6W|5fQ5-ZL;T3VFIXhEy=Vjg8)RM1iAQe@RsP-}m3xvg7TI z=YKz~tjl#!AeMpQ&+@0Yc{v&CA}Sdc>=#_fxZ^n=L;PBIhVN6j81BDeeqh+FtA0&K zx_)-vrfwd+*`IZ5+g5w6=waUGSCZFLc(dwBdWwqvvdK*L%T6-gRb)S4qGYJ9aNZ{U z5$EpXvA)x0alK>`F&1{oyZ-R@x?bjUO`mtDH}G5$iqa0A#(g0?#@}}P)`xpd4{H8m z4R~)NUUTDEPWqIq%3QZ&F6&QTi=V~@F1K5L#?o@FKgME|{qwr$+yAMGskxt@Rex#`3v;fZmshhBeec`WyS;;I+B*)Dzls>$$YljrBR Z{}{DX*mi4w3ETtXL zJmyr(+hno5Yf*6LA)8(4YS9h<+3Hw-D1Bl3;QHg|A3MgHmQaTC3C;KYRy#7+xYfLN zlro$-?{Ck2Mw^B>hPDfd-H)EXTFS!tfc3P(oudpr389ntCY=;A>3UFK-?fX}IoY z+w;Qh;els*f8;7C&u##l@d>uVAQW_|G7#!zJDKNiP%>#h$KyF6*2UngAvY;~W40 literal 0 HcmV?d00001 diff --git a/doc/api/html/form_40.png b/doc/api/html/form_40.png new file mode 100644 index 0000000000000000000000000000000000000000..98dc082e118f8848d269f1ed402c8e8cf83a885a GIT binary patch literal 306 zcmeAS@N?(olHy`uVBq!ia0vp^T0qRt!3-pq)~tO4qznRlLR^6~Ng&Ezh8w6spd`pI zm_g4YHou{N-kP09FWr6l<^QVm4ex<+3q4&NLn;{G&W#m1tiaJSeZ_)F^MBvpX0dF_ zmbuS1`p=AXR+Haxnv>yyzSkKRhVNOtTmGk|?t8Ieu@*y(xarf)$qOoF9-q84Gnzjk z{`2N_&0fb#9FCrHHS524)p4`bMG?IX>qDn!JT)ravM=Ye*7P0kU*t*Fgx!p4usjx| zmaX;daANK~i+?}YwuekDTKDntMvY1C+xEN^N_}^5wTu`O!}ltN6DG`yiWUE7gM9Ak L>gTe~DWM4fcd~9g literal 0 HcmV?d00001 diff --git a/doc/api/html/form_41.png b/doc/api/html/form_41.png new file mode 100644 index 0000000000000000000000000000000000000000..d12dfc3d4511d3b069060f17f55466cd1753c3e8 GIT binary patch literal 302 zcmeAS@N?(olHy`uVBq!ia0vp^ra;Wk!3-peZ`M)ZC!+W6ITu&FrkP61PbEElM6nI?u6C70z{VTU#y5h4} z$)DNt)s}01ythqIjN!w2mzfNC4_Bq1V6byi_H^}gS?83{ F1ON+dWdHyG literal 0 HcmV?d00001 diff --git a/doc/api/html/form_42.png b/doc/api/html/form_42.png new file mode 100644 index 0000000000000000000000000000000000000000..09bc6f43dd0f297ae56a782c72756eb765f829fb GIT binary patch literal 279 zcmeAS@N?(olHy`uVBq!ia0vp^ra;Wk!3-peZ`M)ZC!+W4yo2QFoNCo5Dx!zod4R~DUPdZ^g@z=lYYY%kJ zUUuO~$>p;LnlC1O*{IL(VLMBMp-Qx9gX1&#U~e78CrkyN{++w#Kf1N*&QhKAkCaV+ zZ{aFve;j+0;a!1`?H}=FX}NcoW_;h9?H?(y{Z;oi`Xt>VsA>THQ;YY)5Q3ksQg_8FfWO^7Ll)tlBSI6JQxS%(_ z{sOO<>1+y#PvhoK) zF1>-xPUhAPEzvvw7dLbqw``sfd6Pl%rQ6oMpN*A`{qnc5EuAtYvo|CEN$({FpWBXm z^w0V)JsY^_lD@`-&k?T6t~D|mCEDNKdv)cJ?f>>ScooeQyuBgzeBgv7@|%sal6?(o z-K0+#DVCfo*M8(YWyv-}e?8F~5?(Jn@7*#jU2<~K+PRx>KPanB`e*P?p{?Hmm2Y<_Co{?D-|=N8j}`9Hzw$978G?-_E_+ci4c#b$$7x89)C2FIyq2 ze^MhiICNI!#sylDeGix_*&6C!D>5DskI85Fz{>Ca`}xetuda(f6J@wp?44Mwo3NIR zJs@kQGs9-d;*KS2?kL;scb~2>ca3M&5zR9~cNtVQ4}a{q+2OKy%XUYt({n#vZY|5? zR1Z*CpT(}{xXfVF{0m3<6dtCn@-LgPu&%DTBV!X^(52orfmKFEL4U8LonIjFIAycj zGSg3PnG9{F0$Z0>hTf7;J^b|;%O<|rCqk?)IG)TdX<2JWWTsXLSz306dIShxFoLn@wTF0}so}(%w zROQwEiT;k8iX&N_K5ca`<>0sGV_0vyOX2qZs;IJD#s}yBurFQ6aZ6s@tpgMnp00i_ I>zopr0J^2G@c;k- literal 0 HcmV?d00001 diff --git a/doc/api/html/form_45.png b/doc/api/html/form_45.png new file mode 100644 index 0000000000000000000000000000000000000000..a7c8c8afd9b646e00db13d7104f803fcf453ee5d GIT binary patch literal 299 zcmeAS@N?(olHy`uVBq!ia0vp^+Ca?D!3-q5_8q$fqznRlLR^6~Ng&Ezh8w6spd`pI zm_g4YHou{N-kP09FWr6l<^QVm4ex<+vpiiKLn;{G&h_RytiZ#nUXwIAXvhED*J78J zOj6$3t*3id>67ui1FQ`H+&Tor8Thm1R6WfnS~oPWV?AZ|Txp|zW!=>Br-HRlZ&~fy zW@FAU-DCU0I*Gh(YzLG}JdVYkzxb1T>swQq3t36qZC5PoW?^7Ay=zyxGIi=A&I8FS z7pccKc)yuYbBT3_lg@R!dCUjYZ$#Hf%6{knAkBYe5p&&6jkv`iFMGQBxvX77b{{MgL=@7W; zSmgJoA-TDM-=* zKWSBe`^qbRul5Hd|30Og7mfu=t%b{S?a3^TH~t#w{&#CU*NFPUM3lHL`?XnWC~wJzaWtbPTF!T)_r zHXeVdY`xUZ=e3xh@kT%CDOGl2pBeJ5d+GkxXI#nFlsW0A(x$4L8LQM>cTE0~KGo`* zqC$I?oEDGrsS~>--+oX(QtYd#|4QQVUn|!9xPOyoZBI%GSGspp-gHICQt3&$Qw=Xm zd1QL8zjjlpWF3EC{_V2;YFpp*+ImP8o;+)@#DB9)TJE>4r(a)`Ie&L2mtWb#=a@wMAZ`XR>;1uNze)N?5hIBnZ9acXwM=ILrKD zOz=GGt@rNDI{NOUSC5Zcxc5TKMRyN|S)N{`yglW?m6?vKKa80kHtrtNgO7YvzVp+Pp&>nkX=$5H#p34|c^}kW%-XYk z=a&5!w{)n#-}iT~$K+|gk;;q>={J6Vf2^T+y#3w#8SGn69ErN3fBwr3#s|i6_3MI@ kRz{whb12?``M~}z`Q$!<$VD?HI6$e>)78&qol`;+00jjy3IG5A literal 0 HcmV?d00001 diff --git a/doc/api/html/form_47.png b/doc/api/html/form_47.png new file mode 100644 index 0000000000000000000000000000000000000000..d4dbb97e1f3db7ae8002d2923c2b3e5864274380 GIT binary patch literal 828 zcmeAS@N?(olHy`uVBq!ia0vp^vw&ENgBeIxOx*exNErn9gt!7}l0cNb3^!1NKuM5a zFoT{)Y<@%kyfr(IUb_48%l}pB8{RW8Fs=41Wb)Nja|Lq3n z_n>LYq03h*D=xc`Bjj(B{8{|L1vsLFdi5z-z z_w2oOL9g?!zGptbeC7(1=IqE-!5O{J(yzU>Z^$;udY#gsZ&2*f5WVJe-0MWW6??;) zZ5N2$^Dwh3eC?*2dFJNA<#UtY?P}fj()(TQOqc&YJ*FPhYpyMSyZg%Z;*j`XQx>0# zdVBwL!4-kslbC*p_0Ez^c^YIL&$rhgnO!b#U3O(1^<1-}jOW+q6`y@4h}_ze zH9Kb#>tera)633%-F4=1>j&$s^@TFqcVBBhQW~{*vC2a28LK`RTzH)zx~0#zPgOrf2%-x^G&cw`bwDw$-Zl zR-8@NUGMJbY_X+j{S_0z$`p$<-|f>RZyyie`gV$4qF~9?8cf5q7HXI&o?!vM&-<;%TEJX>@qKJY zU+oXg3tM`UZI8*^_SAfTt8c2I_AIa9B7a?`55^fwcOSExS~P(_+0;WqE}Hj&dZD~^ t^|7_pOn`M)ZC!+Qn>CMQo9$B+ufw{xTO*BJ1$?2kFod;9ZCO!*Mz5$>9z5-8&fm*sWoGcRG(@Kdbua2iyGgdT3hQ(JZA5ivTlvt!(ru6yVKaS0JWe+HyQM}4y;P69B?L(C8N1=S( zcUu`=1auzWk)7XpPY8JJ)nm-GJf;P z)5H^pZugRzg{IAd3d(ll%QQ}mmSrby}C}{W_Fg~cIAwzR$)dj zeWNOJS9{(oFAd&SDLCzOR&dRREBRiU+e-zrW7P}auDb2I^xESqt76_eZ;SUc_@Y$5 z!6tuJdeVMj{YMu%zVGgRGhNu^5&O!<+eNFhY?S7ehJDfs()N8@*gK~urTJP-k9X~w zC&!b|nr-2Jz`1FDT-v0$1?R$YuAcVY(w%K3htscKp+H~<%gzTl?Hdi%Q`7_ED?%boh zucOa!&BIN;4doy9%Fm8FRnER9!xy&lk;nzwBn}!~09?E4%%+h~y?Yt$DNdEAw|#J4;5l6-Uz3QoD+*&MH2&u(`un j$7cEC{S@{Oi+`|J{^0+0sh+PBlr%kE{an^LB{Ts5-dQ}q literal 0 HcmV?d00001 diff --git a/doc/api/html/form_49.png b/doc/api/html/form_49.png new file mode 100644 index 0000000000000000000000000000000000000000..d3528dd5267271083afffbcec042a81862f36323 GIT binary patch literal 809 zcmeAS@N?(olHy`uVBq!ia0vp^(}7rugBeKn=G*xKDT4r?5LX~g5{R;w;Rb3DC<*cl zX3+D9&2Q+Rw`S+jOLt#>`M)ZC!+Qn>rWu|tjv*C{Z|B~ewAg^hwcqd_!{h(|Z%^!r z6moL%_x<|CIas6Rtlb^$$n^~S89zLgP;ZzoZpid!%L|`v?ZOS;1sUR6_ka9kbXu<^ z_kG2KMEPF<+a_yH;d>DJW$6{eOHYM+7|ajxy`JHG-=)+4z6ncCoPUtf;je4972Pyn z_MP)V@tPPnk<7!k#V2E`tDa7tmA>xJxi#C(&&L#s|2V?BIo9|Y+w_@?>mH@Cu8nc* zyPI^uIQ&B*kM8^6nL+crc@vG!`Fp(%mj8NVsl=qBmjR_u1h!{!dhR>^I{EK3A%^K2 ze_B{Qk9*DfruypY6D*5YTq&a{hTrar``|hyrZ#4c-rj=sqK{^@W@UFc}=PvKKwe`B)t;2^t%sMT4%y+%x`Xk3p zxQe8*^@9&p-N~8p@6hpGU#@-G_sEOOpocqX|I@uq7g|-XPhWo3t1_L{>@{0KmvqdT z-EkXJ@`EI;?Zxxkm9&4)c;jUBHBV#Hi(9L_%fe=Uy2SWK$96HF@V;$+F-0>MR6b1g zk=<4o_dB!RVBOve(!td?ABFhFM@C+o{iyWm-gjc_cdXG7^1Z~aXKvurWU6d^pf}^5 zY}5`TU(@Q{oB0@)XT%)q@5_ulAh*M$d5L{j@WZt9%TIIU7hZofX-J`TF+1|V*|p^RY2F9s404b8 YzbFe`oxM(ZBPhXpy85}Sb4q9e0OEph;Q#;t literal 0 HcmV?d00001 diff --git a/doc/api/html/form_5.png b/doc/api/html/form_5.png new file mode 100644 index 0000000000000000000000000000000000000000..d84b473977e08f73d4840ece3a4896b2b9128045 GIT binary patch literal 574 zcmeAS@N?(olHy`uVBq!ia0vp^@jxua!3-pyu@^`HDT4r?5LX~g5{R;w;Rb3DC<*cl zX3+D9&2Q+Rw`S+jOLt#>`M)ZC!+Qn>#-@@OaEETN@4EGM_cCFsURMBgF z!1#veW%rnyb1(I8D_mAOi_uT;S!j1m@3#8*OrCP7pq&LPWPT(T@?ZYjxu*Ev>M0f< zjtjj1xN*N_j^Z(sFPZ-=PPYVH^--TV?-TRyi;MT&HOP*Cc|tySN_WuDyVHcz#n?3zsa zKl=P%^yRo$?&&9w;?if`*A04;TQ{5Y1Fz!R*BZgXtLHk#W#->pmlfpwZ}R`i?~jSt zvIews9lO6Hbz%I3#a~6QzC6bCyNtVBU+{O_{7HZ3EdB2hc06w9vrUD*noV{3 z^;22J85TPp(f80?)q?wD6I j)XC~C^S{LWr~L=h+I3v}Zv?kHf>ME}tDnm{r-UW|PN?~g literal 0 HcmV?d00001 diff --git a/doc/api/html/form_50.png b/doc/api/html/form_50.png new file mode 100644 index 0000000000000000000000000000000000000000..d7109975296379e303bfd41937561916e033b32a GIT binary patch literal 737 zcmeAS@N?(olHy`uVBq!ia0vp^%|I-{!3-qdJ=%8#NErn9gt!7}l0cNb3^!1NKuM5a zFoT{)Y<@%kyfr(IUb_48%l}pB8{RW8Fa>zJIEGX(zMUJ{zs8EEWxq~}vd_Q&`}dYf z9a7rWZuvcN$ztI^riBUNF{z)qKJXu?JIeK8_l9_e{oOMd>zL{*<}v(}ujz{SKeS`% zo6LTh8kUNN3B_x~9x$m}nKa}Z_U5LgFJ67;D67Tc=vlqx)!8*!?B*6{o;!S7x%BMp z!+L&iK6qT3dwA;S>5M=4uK9dE>A`OAXPV#Tm$)^ZFR*gy%KMAvFZs3Z=7i>Vv*JIU zx;MkL_TqL1dBfu|_bc3+a*hWCcBu(Wp7ktZ$+JWLU-jH9JhUpkUo|$R&b(N@~|vo@Oj4f1-a z8!{v4)Wb^>nkpx^=;*Khav^uqTGNRc1p!~KhUM=no-b3qa7xgHx2 zFZdtYw#&u+D)ZAjHSbP%&MM}SzNldSer9^}k+qz`>Qhq7)Xem4HXYSoc_nA%>jQgQ z*mpSmDZDr3S*-o__9cf)GWXs%@;Xlc$nmqYH6EWm^>In%*N(kDm$usN{ZT(>b9T;8 zi5u(JPTz3!^vzrz@AcLPgk#cX?SFg3^stn5Yuz?!zDJH5&oA+3yt+VcP|N48&)As!3m1Y0fc=6qhgN`;ge0;1*=lyGFKb|+A(XT?f zIwNqI#{aXHOa7cqWcbJNKI!?cKO4R=)NB7^c4QWO56^LSMk z&R%jhYw7K3izyQ`oZfD=H%5m2T{9RS*sZzyU5=rS;E<89mxe>oW$?3#2|^)46j+B2nT?j{8r z_ErOR$C*qAcxQBbY_ytqXl_%Uh+MSQuT$GECG^HSFcdWW(9b;b)Hys&W&Xo3&Eh!C zmNkB>U&_xv7~rF};hCoo^8t1pL(yN8_Uqcey*bOc`=E}h@OG7RKCwCTrKd(;eQ-;l zkfrX%qNoz(gL~F)&QQ0%ob>GFOOY%2ntX>A-HcQHv~6XOuGsXATO0mqRC#C{&&kQ& zlaRL0wW#*zp;~t}I}(>Jc%dbgxmPB~?D-u1LM_Er+jc772zboe zYM^oAVK~?I)(@I+U0{^cSi6Hc7VI2tAQi@R5$hc%%tCal<5 z@a@@dgQeQrzfBVJpXw2*nx3Tkao>$?3#EEvzijwac-8ahF2(9rr;ElZEzAz)))E3etHXo=+Bvd2FkFf}lj)9l+w(W`5>Bw#8 zEG5(Y&gYASr1^5)-@W#%(aG8Ois!$RU#t3D@7mm^6YFQ4&{)_l&G0T^(T8O>T~>y% z-OTwJ(eY;SnLDZlR{Px;AE-Z&*gXI8mn9Rr_+lA;{FaDhXsBnZXL!C-$b3%i6h%p=fS?83{1OR*uI8p^J%dYwbpcE{7q>}(yuiNQDQ zrw5hwADwU|tNPUR;+&IjFK>9c)LVX+G1uEPsAcJoIF!>D%i%+ZZ>+ z1*gogn=PFir=!1LXO`<+0iD>AGOcyHzP;>i{pEbPqNh|^_wL-_SJ~!Q`EJK$PK(W+ z^{ZCvrNoSEjw7Ohc6~9)v+}OKHgw&dtJ9L^SNV0_)d%}_bU3|IXWt|D_uWya*O~S5 zYTQB`-}GkW*Z4)vY4bdoS(;b z|BhjSx#j_NH!<7UOTyOgoxdgeYtouTXne94Jkw~UQ((Mt5|yb=MXnB(i%>&n;nch#h68@`@fzopr0AFZ06aWAK literal 0 HcmV?d00001 diff --git a/doc/api/html/form_53.png b/doc/api/html/form_53.png new file mode 100644 index 0000000000000000000000000000000000000000..3ba9848cdda59c7a3865a02e4ae99e8888841bcf GIT binary patch literal 243 zcmeAS@N?(olHy`uVBq!ia0vp^{6H+k!3-ofJCxW0DT4r?5LX~g5{R;w;Rb3DC<*cl zX3+D9&2Q+Rw`S+jOLt#>`M)ZC!+W4ylBbJfNCo5Dxq*B~6*ySjYn^h}-uu7ps)^{W z_2rFclMcKQ=wtZc|8!d1L>ZW~k16{MKJ1XY>EBtnD_xiX;L=XWh7Sd|&JR w)hQ31cX=0A%=-A|QCCQPe+J{3`Jd9Ll83%_;L&;R@9Y6)!1 z@P4~b*zmf(uZHM0F%P57Uh5h5GgNe^vi^`zORy+n`yo)H!&V`8Er;)c{saa+!Q-Y3 zd4`{6)@t3|F2un0V-s^s(xy^-ISbk1)SV1}c$noYZ|D9!FUIKhJnuKy&cKw>3ozIi`l=px5 z`QFv&gQubH%IA?kcUY=iy`@(<_tUi>PoAV#YN*UNd-LRQo(Fq>qyL4~Ve5amb1}So zc=W^d8+Jb;?v_q5nRa8vi5u)l;6jCvW+} z&0O;%xes@>99piW`FYl=7n=gEW$+ez`stMvpRci*TyS&M|LvtOe_fa(D>G}yN0TjC zshwuKCqx!&>ppy}H9uxU_QWisV$Da_Mdd4lpJ|$2D6ct_?0NO|gMy^h`tqHVRKuPk{U596H`ghxi@i1H(DE#yCtGCv zU%uIWtt(^Mre_;Y$!6*&&r4n%SR17~Io|gCGX4hbCygtPOlb&YExKuw`7!b05iv>Q zJk7{&5_eU&y$b%Ev8ptWj)^sU7PP5i%hpw<)g4QNyzSSP8@{;s(DxFrYvjIN*S9^{c$5&cDtrPyT;z%a5F|JRfZ5oVl}=+xW9q$+xg)%^jw) zA9t^-k0|-KO{%ka-TZa8ni=jLIHI~ij@QFPOnQ#W!fgj0?)3HAEyZ5YE4NY0`|2GX zH8Z6ojRVmZs)a85-9n|hJZ?+Qn=E%|w&mH?Y|kp(l^H(B2_4Sso6?{=sYl(p;lJdf z^mosW2$-nrExVn@^&x-aA-h?^#*;J~{2gq5eR^7|S>M<9<@)<9i3j3V{}_t(h0i=Z SySoCEJv?3gT-G@yGywpOt9--& literal 0 HcmV?d00001 diff --git a/doc/api/html/form_55.png b/doc/api/html/form_55.png new file mode 100644 index 0000000000000000000000000000000000000000..11720041fae25aa57dd09a44aec83f97ec24a459 GIT binary patch literal 891 zcmeAS@N?(olHy`uVBq!ia0vp^lYv-@gBeJ+w9GRHQU(D&A+A80BoJjU!wu9RP!i-9 z%%JBHo8QnsZ_Uo5m+rp&@_$wOhW88%Os_m$978G?-^SjawAqFy_?)`az5luOH#K7y zTzFUW`TV=HX>L=59%*dK$zy!L&+s943oAn%^D>45qD5>C@eXI08R8Os%NaiKdoUDq zW-vTZzGJ%l)n&7bZVU~~ew+d|7n4bmi0BAVZ_s-xpQvN}SEwuzklvmNj{wk8-Ogzq6F| zT=nd4(5ZaUbEO|dg1u)SZ=JkavGd)wr%RvMO@I1CJD%(0a=z%Agk3>XIcJuN{5EW| z*=qE7ejh_a_K{uF{J*;Th55

=9I#-MJz+oO`Br#EjWTrgX1(dg3JOY4*rpchwp- z&wrfzDehO^iJK=@cA4v#E2@w1j|<|O_O?9YzkJ};R5_SEf3cK34S%x~X#dEwmIon9B7 zFDMmEaOt$!<(_3{Quy(~iWobi^HQ-7mzhjjAJJ8Q_0Y>}E6?8jeP({7vy7Mi-S13~ z&-u1jRxdlJVi}>rdiH@$_w?%fKh9rT`+4EjX34q9=P&7;d17I|c6U#Q%ZB~W>%S~dF#5~?-S@RdAt93o7nu=*lH1mm`5j0X3wp!jhG?io}Mw= z=Ed#EZ?jw&b{tFF`F2IjRi8O2Gh!Ha99(nL(&qFVZ;`F~(tN3L=ax+_Y299U@pKym%aI9w+U}EnxUie|XBO_|@y# zJ%8W1w^~yFFB3x@&$QCAO^x0^!!-{+DVe~_@Q;DP{0IM>Rx!1U;XfrnS;*7X&t;uc GLK6TOgpxe~ literal 0 HcmV?d00001 diff --git a/doc/api/html/form_56.png b/doc/api/html/form_56.png new file mode 100644 index 0000000000000000000000000000000000000000..9ef5b858a5b1dbde66d864be3bec7a9e6b073aa6 GIT binary patch literal 623 zcmeAS@N?(olHy`uVBq!ia0vp^=|C*O!3-oXycWI>qznRlLR^6~Ng&Ezh8w6spd`pI zm_g4YHou{N-kP09FWr6l<^QVm4euEk81H$yIEGX(zMXse+-d`!mi;jvJ_=9&-v4It zFet-wcHX&1(--mR3RS3myOG2APva3!LBHSvdAS9wzZvvy`yT$4&LNO;Mf-sHj~x;X zY>!rFJpLqB$>h0%bpd;>oc_m+o%U;ckBhLjDKdXqaPqN9x_OrQyo=X9Kl{b}f!BAQ z<-IA-A6(oLYAApC-qFc(r!Akl{ZUiZvZa?fa^+NK9^WCY-*@hK(e_VQ9d38iy0k+HJ5&2tX66`eXe?C)-Fc9AJfd=et3KE`t{grEpG#5 zq6)qzy4~EczB>7YK$iFJhPii^zP;ktuIXH3@%ahs53aAzf2^6NI9=Lw!n`*}7OStg z9#x}%?Z`bp%Tgb^v+mJdyRxQcKHq+F`I=baq8Ia~97vt6cg-i;JNwp0=g!!SIj&`O zYukQRYD|9qxSe?cr+Ma$g!VOygQmr>O#k6r@;Pjh(Yx%*dv-hwe=kVB?0Rr3UNvTI zx8<^#!TCCBT*Vgx89rFA@w&oU^zriS$(IB|PcM-_6Uua;|HG{tnMRYjw(XDNSRkzx k^!50I!@sYv|A_y=u6mr;Af>YQ2q@Wjy85}Sb4q9e0Om~)NB{r; literal 0 HcmV?d00001 diff --git a/doc/api/html/form_57.png b/doc/api/html/form_57.png new file mode 100644 index 0000000000000000000000000000000000000000..02ac2087dc8ddce09b3a3039f6f8b2a985b66d1b GIT binary patch literal 941 zcmeAS@N?(olHy`uVBq!ia0vp^tAJRFgBeH)B$*!tQU(D&A+A80BoJjU!wu9RP!i-9 z%%JBHo8QnsZ_Uo5m+rp&@_$wOhW88%%rc%Xjv*C{Z|A=3Yq8*Iu`goxc>ec(+1r+7 zllLv1Io0i!Ysh(q&gAK*zr{EFXZ)bA7}jvV>HJNGKRjX&1h+B#5t?-LpGAqdQzwJ5 z*kqvt!dosJ)AirRe0lHbS+5xP9nh}6`amVlym`d74c%#}QU|HIaL&#WQ_{S7Y9<5 z^JO^yVVz6Si#_~-;@*D#s+VJG3w*CJ?>YD?=g+Co|8Bk)FKd)LTbQ-iq?xX(+kR>H zwTPzMS$&_D)pzXfb#48;iN)V4Yi)7O>NjzBqKr1CtiJYn*^@VOcYNfkIwuv8t$FvP z_@karS5FzPoa7?D%j@4N*2LoFS##Ro>-^kf_hAor&@9Uy~g!r&rjipm0_sV)0UAY#NEF2ZYZB@EU z{M(*emXWj0sqA>S>Q~+Fl>D-Dof5M)Uc4Gzk{@HL*kZ7F_Q#|U;YU|q9^NHdefP;r zmwfhcuXizT)9*)x+fL(M*Ogb5^<<&$mvF{8S2}k!el$Bi{qUKu4O3>f%`UCq#MQHX z&zv~^?jFDC*{&JKo)i{r^}PIcjTO%=$LpJ-)`=hJ$vLJkepfMUapL7SYJYD&eZKIo z-q8$>;D>#wrIKui)L5lB#6|bUW*bFJ&E4}OVvWs9N%`4V|6Ymk+Hmq#>SA1RMy!q0z zx2rGSdg~i#XTWCQJnhGfPh}=<3A$}*0Xnyj_ za`BjTD&hn~J-3m|?mtI-Ma2%pyRNIBeR|?Gvx^M>7XM%mTr4K`#D7Z&DARem`njxg HN@xNAm^ru? literal 0 HcmV?d00001 diff --git a/doc/api/html/form_58.png b/doc/api/html/form_58.png new file mode 100644 index 0000000000000000000000000000000000000000..3a4074b65cd6063635dce53808c7478ad1bf42de GIT binary patch literal 997 zcmeAS@N?(olHy`uVBq!ia0vp^dx2PrgBeI(6<8YrqznRlLR^6~Ng&Ezh8w6spd`pI zm_g4YHou{N-kP09FWr6l<^QVm4euEkm_s~W978G?-_CtK>5Upsi~WIyjb}gn%a`W7 zf1tQi-7Y0Lf;SA>6?^}f91 zEb{}qKPR$JGT!~HsZ-}WKYx|I^`#%1`mDc&Z`;KCK<&?qJGN_UI!*~}G-ct{pYCME zC!@aKB6C6TnZz01lfHU)EXv&duA{Kf(3|m7*b9d68A^+j?a$QpwOCd!Q@t5;XolFv z-9KM?`YSHsj4#rg`gisTS4~Cr<bDcCCGs$c17_jOLSvCT2@n=3L! zwcK)iv(|b1Y4TZ9w`+2BWNzzC0jG$?Ywo)Le>&&9drn5pkz)~87wS#gHPJR%Rr`_>OIukHR@#KW0-&hmS}I-&QWg^!f4bV^+@%B#yscAEEal0fI1TXSzI-o9+WqaJ>9 zN%|`3vQ63V>^9o>aOny=aoAqFlU}-Hy{XOYn>M+1CTFbGV~agc9IJb}Fm+Gh?PdPo zK9{|TeJ<6ut8Tu5dw{C}!+V3=(^)_D+2?Nwan61deBIwqm3!^vB{QsU-hMhI_>#xz z=O^#2ic~LMzg$90tuXrcwS`fe`5V4-?28S{c0ALi8|C&fnzwg}o-z>@|w2{C;WWH9b*zyEOI5QhV21J-e(b^4xJ%E%Rg`$|wB2>#ylWM2F`0&J+x%~VYnXV=o6`*8J-4?l6I`cfW`1;q zQ@Q`?`*yOj%#+vzrzWqyWP0w^uNvjtnUugwjnG0H%yt<)c zKIw4oTGj`=$KG+(XPstvKk-N+*XBQrHV0MK&I_+&&@0&eXiJt{)$e;dEvFtV6lsXQ zz%3BGyP@-&?B=j9Yvmib&nPl-?!3|yzeT;a_%rjJ)~rI_H!osx!x{Fo9IVd#doX)B z;}1rje%tG;-bP0l+XkKji$bv literal 0 HcmV?d00001 diff --git a/doc/api/html/form_59.png b/doc/api/html/form_59.png new file mode 100644 index 0000000000000000000000000000000000000000..8c858a9e4bc605bd5c181e1fc72c099b59206f17 GIT binary patch literal 691 zcmeAS@N?(olHy`uVBq!ia0vp^r9dps!3-pso_)9vqznRlLR^6~Ng&Ezh8w6spd`pI zm_g4YHou{N-kP09FWr6l<^QVm4ex=bD|xy&hEy=VjlDf>i2=u&J11N(|NOr{)QD`qEnKgPC<@APL<(6^AC}D=i^q||9v*~ zF+7NBYG2LDpm)SlndA3!*$b|ZpF7BGzWvL)?@Gj7m*C93z8->y4VVgYf;*y~uwPnH z?(jZ$^X7w6{hNfWjdC6@b6|L&(%tfYovD$!loa!VeT-I>wqd0)*KB`kd4%qpKZU_3 zx_QsXTSqpi{tLFa$!u`azgWH1lw0-Gz8Pyy*op61eKs_u>yx$;3mOPlW6 zor@VCI3GEb^{#EwkvYQqMN>_9!ovO)@n&@Ei<$*3U7pC2a8I6h)7RcK3tn4>9U^(P zc7~2=kG^L=vG7hm;Hu?rWz%<|?-1jR?IkVKzP5+YwZ3m|$GWuY*Hb(0ncL1DQDLu_ x?_&56yKmaRz{M>m%Fj7z9`AN$W%%FrhtX&q|4yNaAw{61=jrO_vd$@?2>^ooAA0}* literal 0 HcmV?d00001 diff --git a/doc/api/html/form_6.png b/doc/api/html/form_6.png new file mode 100644 index 0000000000000000000000000000000000000000..0d42645f74ad5af34f414d0a1afaf8c1c20c3e84 GIT binary patch literal 574 zcmeAS@N?(olHy`uVBq!ia0vp^NkA;l!3-piPs#EFQU(D&A+A80BoJjU!wu9RP!i-9 z%%JBHo8QnsZ_Uo5m+rp&@_$wOhW88%jB7nz978G?-_DKBUt_@2vOnfT>*;6z|KCn# z=UA9qR=KhyMDtY0fu`d#H{K0zux}AaX8B?3BU!}o!&HJh@1+K#-C>J{^ba?W@7Z=+ zrH4U&;=Q6Tfp@(B?Fq6zTzqofmWJDAg}Q&cvr03UNFOk6Nt_rlySmHw(!5!s`;1v1 z$oj~$y(oWG&)q%yS(*8JtD_=5Q@ogeFiC%@6#ZspeSp`T%jdCQC{Er+v4b5~2=)CltWd+mtHnrn+wek32g;d%IYR%Ca^xvzgkKHGf%z2t&bHv89~ zG3=>gyRT_onQC%?cW=P4yH6}MFYQq3{*tz`K)PT1h<*Py7?Izw!$&$$cy?LXBW&rdBr j6V@m5xgv+@&;B3m@AbH9BTFpjf>ME}tDnm{r-UW|lu-Ju literal 0 HcmV?d00001 diff --git a/doc/api/html/form_60.png b/doc/api/html/form_60.png new file mode 100644 index 0000000000000000000000000000000000000000..1dfe70d8857d1be6f92cafc9de948b2385a54f4e GIT binary patch literal 847 zcmeAS@N?(olHy`uVBq!ia0vp^3xHUhgBeKfzPIHPkTMAH32_C|B!MV<8E&8kfs!D< zU$2Gm;bBMH@s(HVA|*D;uuoF_%`-r*R!7~nGqIk+Zhj7TNif;GQ`dB{H$xi@Hp0Q)vFD&E}s>dbFMFv;X!L; z^ghQ6ehhNkWmlCI`W&=YtP2WUAJg%Nx9KTouBmfl%T6A{{!Z28qH_h7zjrK&ST&jF zjg)U++|!(FhKf!51R{h>`-jaX&zbhIC zig#xkdR}_zXIXU3SnB_^xPs}O))g1tTo0T3$xR@*cvUz@^2~&Bo;RD_ z*Stc3IU?O_I2KmtReZ2K(r>=?ba>O6U+)gKN*!MHVmABK6PJ>A$No}`O%YmkWtWgh zW~7aZw$qCCe1R>6`>VP)Y0ZCeGV0_~zYT&rg|GZEeAT%yfAje{zqYw{^ekPzy6bUf zANQl`l~J3DExZy$^(i?HP`2=N^>bP0 Hl+XkKkDzqi literal 0 HcmV?d00001 diff --git a/doc/api/html/form_61.png b/doc/api/html/form_61.png new file mode 100644 index 0000000000000000000000000000000000000000..40a1e89af618c79dbd82368a1255e83d61a17551 GIT binary patch literal 777 zcmeAS@N?(olHy`uVBq!ia0vp^O+YNp!3-onl%?APDT4r?5LX~g5{R;w;Rb3DC<*cl zX3+D9&2Q+Rw`S+jOLt#>`M)ZC!+Qn>rV39N$B+ufx3PCG-BIAMUE%2a=-0pe=mQx( zv(Ik7JbUiTE1bWDS@~oRL^J%*PcG~cWZ0+f&1S@W;ChS919OHS9&=>a8>AKa8R``k z+h=_Lr~lOH(^j#k&yFprexzfY_~EkJPfLOSllsG7m2TX*%6;XUq>cY1KNjzDQ(-6& z+|Itgyx1~W=vVu+Hq)A^aUxueVhlSt?8V>xejA&ko7!j9V_Ukb=Z2mD!vph5O>c$* z{Sd|nZY#PL)oPs1sbhg(JXKYH%TS+(xp zo`vgJ^X_GHUpV9~9Q7!;mrJYLgYuSY_7R;g|EQ1(z)~5 z4n}*=5pcDnt>mUjZ{=7gW@W|U9<#w)nC zrsq(}7IvoH+#jTs(m1a9d5D;Ne)Y29f;Z#S7sb-Ccn;s;fMND@tHq_@>Liswt^D0r>mdKI;Vst0GlpGDgXcg literal 0 HcmV?d00001 diff --git a/doc/api/html/form_62.png b/doc/api/html/form_62.png new file mode 100644 index 0000000000000000000000000000000000000000..80a5ec5c9423563e4f2b97ed244e7148d14d9efc GIT binary patch literal 317 zcmeAS@N?(olHy`uVBq!ia0vp^+CVJ8!3-pK*pKe+>?13yRlY^mLA`T;T5M VVlIEvcg_hE2%fHfF6*2UngB6UbkP6+ literal 0 HcmV?d00001 diff --git a/doc/api/html/form_63.png b/doc/api/html/form_63.png new file mode 100644 index 0000000000000000000000000000000000000000..76585b895636a8bf5a4c710bce9e545059558250 GIT binary patch literal 769 zcmeAS@N?(olHy`uVBq!ia0vp^O+YNp!3-onl%?APDT4r?5LX~g5{R;w;Rb3DC<*cl zX3+D9&2Q+Rw`S+jOLt#>`M)ZC!+Qn>rUFkF$B+ufw{ve#x}(73($7%*G4;p){k<*h zIqGrmL*lk+iB8{YEiobLmDnDpKifYZnId%H{LPRBE)DX=g%89V`p>*9YLFJ@{~#{r z<&pY!ag5o;`p;>1?(8V>pYzn6NBzyC^PNAY|EqkuuKQ@{XXV>#ule~ND6#gb9lz)1(#2}Wnz3_UM=a(@LkP) z8H4!gtLiy7VmH{NNytO?hfv0*`g{wk@k{5BTU|({bJNcD8-~ir>Oc z-tQ$=-LA-)tjp#2TIFiTibdNjCWW14`{A~Y|H<@d{s%ASWb0LnCcitM@x7YE^7-fA zWr4Zj(P@F^XD{3?`aLHqVyZ_Rf8*|xhtzdv*1Z>8YHuD|F<0Tt=bE~5j(uB?FgniV zU~oce5B8mE#R~IyFgNV!P7liu~Huj&)5lF)Ht&?OKr^y zy#x6j7S0)OU8W^W-R_ak5zCeH-mYw;J@ae6gHpD$rmvNE{kC)GTiNJ6Y$ZOWpIfXt z!!5lo9s03q@1<+n!LQC~w*-7=c3ZyPcI9OK2Vc74vo1J^dcS^Z{Y30aH{0dvLz0TY zJ*S$EJPGDmWZ6;oaoQx_D~Ge5USmG-v~1I!+mS(cmOiK|Wz@TNDrw(ZpGk)J@vZh?ze}t^Y*D(2J;R*{&6O5sb*AR8 eb7-i)RLA)1pb*n$mv1hhgzV|+=d#Wzp$Py8El(=| literal 0 HcmV?d00001 diff --git a/doc/api/html/form_64.png b/doc/api/html/form_64.png new file mode 100644 index 0000000000000000000000000000000000000000..b1a7af4effcea1f6e42ca1fcea2607e504676378 GIT binary patch literal 335 zcmeAS@N?(olHy`uVBq!ia0vp^+CVJC!3-q7e!D&$NErn9gt!7}l0cNb3^!1NKuM5a zFoT{)Y<@%kyfr(IUb_48%l}pB8{Pxu_IbKEhEy=VoqKm(ivmxJ{hAZ~8t?yai?&t0 zcEtDE>|*moq3+~#4LgPd`wO@j_8aCs?XA)kK47fQSa^5ITEDgW`b#XYPchrCnmzZe zp+2kE)>_A^jxgRSd6$B>>(@`6bzHVU`-<5uE?cMlLSb7gL*&{6n{WE?$;|Il_E^2$ z@X4~qYl>&2rl&MLaWBX+&D*|X%cdoh=4w9(%h24tgCTyU@1pK%>2GNlW~8s(^|ws+ o-erSh3(7zGauq!9j(>TGy_+fS|!#}7m{#JBjGi8b6m{DhsMj{DlpIp~UnO=*?jG z$Gj}zkyN==aPFt`I=UUF#doe`D4)TQ_ux@$B2W1B(8F1~6~f=Q>CKvubzblD?XI8I zzEhhb&H2){KIzV!{Jn1HKPwG}nuCcPA9|jy6LBk^y?w%}X@75I`aE}Lkk@G8Ut4@p zq(IVBv*PdO-*JAIBZ{Z(;$OEk^yZQ$Q;z6tUA3q{^Q_vDNN%(8q(%20eV#cXc=i5L0-nq$s_NB*@WlW2k z=T_&W-8^if`gPW!HHW57n-;39w~OWYrw=d6ENA_-6jC)-T{nNqyK;WVo$uA#B%X!s z{lRIs{pj(nt}iE^e0Ah%n2x7)<~q&r^_x>uj;^)i?XQ)6z?muaM@(~Sr0i3R7rr0z zO5M);ecgC*+U?t?UFyG>A3yRDHeG4E-u++pUHuy2O$+OKw;4C^mguYA>dh5dl~ z4)LpHiC2{C<}-$U+Zx3EQnmd0MF#s$h3f}*>|b85%Gxl$vE-4oF7qFYqzUube{eVa bm;BGL%1S8J@~n#}C=GkM`njxgN@xNAYi&)& literal 0 HcmV?d00001 diff --git a/doc/api/html/form_66.png b/doc/api/html/form_66.png new file mode 100644 index 0000000000000000000000000000000000000000..8239a9433e9f8865e8cbcfdb7afaf3d51859cf39 GIT binary patch literal 817 zcmeAS@N?(olHy`uVBq!ia0vp^(}7rugBeKn=G*xKDT4r?5LX~g5{R;w;Rb3DC<*cl zX3+D9&2Q+Rw`S+jOLt#>`M)ZC!+Qn>rUjlZjv*C{Z)0z+TcaSL^UZbQ|Nply^K!g; z@xoK>yPsdunvR^<5dA$&2g;p28Ge{~sOK^?=pSC9&G2Bg!qhKy7NQLI4lo|DT*J_y zKI2xn$BAtxm~QNyELav<{Zz#Gy#LJ$SA<2C8DbJm*%|UTUg_VKxM}6K{)Hlu4SU@F zEef4Gp)<2?>*M=YG4{QekDWf?dQqk%W|pV>U5o4c&v7&Gy%1)6Ao_Bly0m_R+V+^w zv#JB`elRj`%6TNhpm(vta@%#LZ#y>k-dn%K^~A(u&EL{-Sqg%aU`Q z2gB-q880*a9J*0gKY6XJ{(6P#eRC>5D6!p<*mEO3cFiKbzotv|DocY^7rx$dEnL+0 z$Hf`3&n72UUwGXUuE2PF=_`#@fA$#Z+<(_HF=+n><=o}pT-$lN&-k3LoVw*(qdV)# z`%Tl@Z%#GI?5*Bt$MB&mIs(uBTq?q}DA zd=2g{Gu?B_g5l1CY10j&biF>DJtn=KS&P$`_n)TiUd3*?CF!d#CH9&J%g$&kW_%#j z8@|2zNvenb^w!N2y95~SB;IQGE|e?IYJL0mZDmlnd0F|h)2dTim+X)0h3p@6+q$njK2`K{$!CIoA-=ah-6z6;CpoI5GT z^W|DSZGMIt8PmSqcatAU?czG^dG?FO9)<^#cWm@N`Y=KCUf876u c>A?Jh{4&Rc)$ec1+6_whp00i_>zopr0G--m0{{R3 literal 0 HcmV?d00001 diff --git a/doc/api/html/form_67.png b/doc/api/html/form_67.png new file mode 100644 index 0000000000000000000000000000000000000000..7cb7389635fdd542e2f639549dd705d52d14b353 GIT binary patch literal 758 zcmeAS@N?(olHy`uVBq!ia0vp^^*}7e!3-oBN*-Xb#vsc<4S*i8oieI#@|_Fd_Z^8aakF^ zEZ--^A;wGg%cN=9AIR6J=lb;6ef^#GS6VyEn$wN$zL|Jc|HoOj4=u;F&aKk<%HZ=T z-~5rr3W4i8x{J?lR$Vq@n`@8AwykXvn@SVIWH&~qPM_h&S|~QV*{YyTqT;7%deHZq zW&dVhvij2>_EKb}4p{_o*7vwYV( zw*OoH+x{!t(d%Rox>x4=pKiI^+%M1U?^yXYf9sOJ^A*q9{#*U&{NCg5zm^yJRc2(K zn)X#L`_#Rk(SJ1+gWs5{-`TWGb3$%=;xmckQ?Gx%9k*=u4)c5V+fGjlX+1Y3A$aY< zb*3jzJu5Lz)RoC4o zCm*FO3W~N=zoj!}ll=Vh|8w4-e!A1#x;(bx@%neq#i!|fk^aQ|gQ@yV`*M$+#jBUS z+?UE^@N+;YR+aM_x~ksWU!ce0J9J z^=?o7eyIcO6T0TUdSc4+K411gxpKvN+t61(7k^={VRlOTtMiAUUfyik{3Yx^*gtYR X{TDJ{_Nj0KDD`@}`njxgN@xNAQ5aqt literal 0 HcmV?d00001 diff --git a/doc/api/html/form_68.png b/doc/api/html/form_68.png new file mode 100644 index 0000000000000000000000000000000000000000..4e77f59c6f8e1d28185995d3c9abd5a8d1498068 GIT binary patch literal 310 zcmeAS@N?(olHy`uVBq!ia0vp^8bB<-!3-pWInT}qQU(D&A+A80BoJjU!wu9RP!i-9 z%%JBHo8QnsZ_Uo5m+rp&@_$wOhW9|ZrJgR1Ar*{o=X&!UR^V}wmuD_qxbuJRYqnVv z!g9;*D)zP*Jw9oy&hVq(=D^k^X$|~8RnNO+X6|1uq;TZAjfrHR_SX)SjjnU70`&>)+-%eszy2zGt zuZnG|n@q>Gz)R9IFUzWnNp>*Ai}D1%ea~P&b=uphjCxZ(zl>$n`@-yM5&ZQU(D&A+A80BoJjU!wu9RP!i-9 z%%JBHo8QnsZ_Uo5m+rp&@_$wOhW88%Op`rb978G?-_E_=x7vWmRs6{*)hGY|f4iaR zaLehmN3q*y1Houku5X97?_v7G`C!>H$p_(@ZVmBE_IWSc$*?1g!D90N504%`{81Nt z|D!{7kJ*#INqjr6`#ckT^Lg?nw!h*JLWK|TN*cyalg;gQt@$&@FyYd>!WYLLnVhWt z?6_-o_2firhMH?_S2}-Yz2np@_tjjgYtY5=VaXRg>-_&Uu3hdC^Cu=4Mz_{Dyb^2B zzMC_NSMx;v{%Z$?gFYm3ZQavu!`~+09OITF)}ZOOli@0p+6?TFpEjC)=f3!N5R zI-_-g_q`)?_RcJtV%>dpvfZNE zHE)>TmsNLe`j>P}&5Ct*GflZ$WgVMumhR!kwS;YxYmxF}9T)B*hMEB1u+7Zc=VH3H z*vtQ5;9uo2cfQPLs~J%$oqrXo=UnmFvEAAC`023dkg{!lI#bSmiko1jviMxKvx zElb~9pBTja!_%{E-S2LG R%gaG&-P6_2Wt~$(697==Y9{~y literal 0 HcmV?d00001 diff --git a/doc/api/html/form_7.png b/doc/api/html/form_7.png new file mode 100644 index 0000000000000000000000000000000000000000..36442d5b5cd9a224699743a6ac49853ebfe9a8c8 GIT binary patch literal 582 zcmeAS@N?(olHy`uVBq!ia0vp^`9Lhi!3-q(zI;*uQU(D&A+A80BoJjU!wu9RP!i-9 z%%JBHo8QnsZ_Uo5m+rp&@_$wOhW88%j9Wcj978G?-_Cv6_gF!o#XhfR{rCFYxdlAm z&TLRLUc6?D(4t8K3%FPD|6}?iEy4Ri@5O?@EFaX)d}BBey`Z;mW3SAC;tJLeyl4D= zo(+781i`MQU&?y-Wi43Wp7flW_@2RQkif)ONFr~Q8wgC&7)|ay>AzMFWPM( zyP(^8zQ3W_q~ufWM_WoJ@7-o_^1q$+!j()Hj?eWM+4tvO*NRy?HrKqIzo6M;Uz*+K z`Esk)zWQQ%f780`*GZ2J6n8I^GQTxvEsyN%HP(+-%kVu=el=~=@{gA9YhN2x%FUdn zu0LEf^E8#sZRhTuHZAAPmt^%{O%=L&*N?8!y7Fk<^Zgm`DyJ;JvTE*( zS1$1)-%~x0o|DvnmBTQ<@abvxyLzubah`p5D9w5K5~-P1cf{L1IUcR_FI`%6EywL? zQbf*_=}w$0->PpuyZ!u6yKgJEsX*{b~&=(N5casoS|~ z;%m>)Et6+;efLduHGBWdHF0A^+vMTrab`twKSm!PC{xWt~$(69DNs05|{u literal 0 HcmV?d00001 diff --git a/doc/api/html/form_70.png b/doc/api/html/form_70.png new file mode 100644 index 0000000000000000000000000000000000000000..0e2fd991dae924d70cceead75646bc9cdbaebf94 GIT binary patch literal 322 zcmeAS@N?(olHy`uVBq!ia0vp^8bB<>!3-qj4(3b&QU(D&A+A80BoJjU!wu9RP!i-9 z%%JBHo8QnsZ_Uo5m+rp&@_$wOhW9|Zjh-%!Ar*{o=X$R@tia>SugLOQ`}h6ag%iS+ zmkLcb-}0t0_4TuuN30BgvLhSjetODuLv#Kf#tOaUs~4s&*u|>W)!Y6mmaAMlyg|VI z@(!QU)8byUs^>4g&QQL!f6LcD%ky7ymHK$I?aM3&N|?(Mc?`u_y7Ofl^ez9 zloeI|S}LDbqoK~mqPkLGJ;VQv_L+=7TyO9`5TB^lkbf|$L7k;x{(iu(M z>xtWpcM^pUDEG`_usOur9l5-EjmeIg& zQa-2c;f>vyZv_0a|Gt;%eWSE8-h?$N@l}rJ?0oqh)7+n*oE^JPRb|IEUirk+&lm5p z6F6bXpX+~cO`VDG)(F+&+{CTkXMH|R71wLb%8B*r4!|j5D+ptZu8CZ# zzV74BPYlVQ%iqqZe){v^QoWaxAB%61DBsCY#n1uuX8nk8)7D N^>p=fS?83{1OV)LKtKQh literal 0 HcmV?d00001 diff --git a/doc/api/html/form_72.png b/doc/api/html/form_72.png new file mode 100644 index 0000000000000000000000000000000000000000..776d4717373c0ce2f4a0a98a8f457133f8c615b3 GIT binary patch literal 288 zcmeAS@N?(olHy`uVBq!ia0vp^S|BzDGmw0-h37etG6?VqaRt&OfhcpAVP0*}jniIkgd1^;iesV6L$ zd@p^mx^7FCR35{J*~yX*l0%NJoG^V5*)ynnE4-;Vp<8v|U`@11^sGxv(b)r9U$ qvAs86ePAl*z5V69U__N~@N3QtcBYG~V#W4>{ORfH=d#Wzp$PyFXJdZ= literal 0 HcmV?d00001 diff --git a/doc/api/html/form_73.png b/doc/api/html/form_73.png new file mode 100644 index 0000000000000000000000000000000000000000..c46b8bbf0c635f98c48b2f1fbe3ceab9c4072502 GIT binary patch literal 733 zcmeAS@N?(olHy`uVBq!ia0vp^4L~f;!3-q7G;e1DQU(D&A+A80BoJjU!wu9RP!i-9 z%%JBHo8QnsZ_Uo5m+rp&@_$wOhW88%Og^42jv*C{Z|B~;bX$R^)n06K<-@=Cw+Z#- zddxBTn{Rb_W&30ag8~)V&gh2!6*h&8Ke{(aABcB3!w`Qks=?Za!M@SI&{}-?9;u() z*%Ra04Gy_AL`%dn74-M*D6Km7(W0>4)+%w^R@vF98dt-!(;Lh=7$1n4<%;jMym6^^ z*AYLa*M<{Y8Y)Y(D&8~1@)mIC&+`7h_UYL{T3-HX>WW4)+o`c0SUe2iVIhGtXf=pXK1+wq@UKS(id_nlaEXCquryG7HOfO1a ztnw{WG}U6BI=@BWyESa@u0A_+c(q2VdeQ8b(62wNB-NEn0}`J}#*`CKewi$(g-ly^X{DKPzO7!{*7yyb`kW-0#`_ zQB%BOyT;+K24ZQP@(1QST)nFD;cIQqvwaf$Ie*I47{ZH#a#nYCs@g;{7xZu6e(-oU q(*wTLt|IAkicf!3eP#M{`3LLo(}LXlnm1a35~-)FpUXO@geCy?(KIsv literal 0 HcmV?d00001 diff --git a/doc/api/html/form_74.png b/doc/api/html/form_74.png new file mode 100644 index 0000000000000000000000000000000000000000..529f7c9cebe6fccb6c4769c1b01c8f918395a675 GIT binary patch literal 363 zcmeAS@N?(olHy`uVBq!ia0vp^MnEjY!3-qzd~3G?DT4r?5LX~g5{R;w;Rb3DC<*cl zX3+D9&2Q+Rw`S+jOLt#>`M)ZC!+W6IEl(H6kP61Pb7S*b40u}hCv<#f-}yf`TY+Qo zyKT4jeL4Aw<59)2jgy%f{xC0N_#imV^nYW>XO<7jYK(=qF0E3&x$LyH@AHt5aDAn% zXC9j$<=H8*aMg|HH^i2-r>@aEU2D+yMOWyTi;Sc7#Z8RooHN4(7wTVNUdp&#eD&W+ z8_W|gTe~DWM4f#Vm&p literal 0 HcmV?d00001 diff --git a/doc/api/html/form_75.png b/doc/api/html/form_75.png new file mode 100644 index 0000000000000000000000000000000000000000..8f3de687db90d3ffdc3b6089b98392f6c9e4cce3 GIT binary patch literal 669 zcmeAS@N?(olHy`uVBq!ia0vp^)j%xH!3-p2^bh0!DT4r?5LX~g5{R;w;Rb3DC<*cl zX3+D9&2Q+Rw`S+jOLt#>`M)ZC!+Qn>CLT{0$B+ufw{u@lnr*<-Y9IfhHKF4F_O&U^ z$=e!z%dOw~Sj)L6+_0N;ZsH&D2m7}PB(wbBHcLIh_~88PjSu9S^%=f@J0{X_{%pGZ z=S%UEcQ6&Cr?LImw=*;^`<3F}seeCITSSGVNAquEsL6Z0_NCkMZ|?aSNWdo*Wg{K{WbQtwps>DAO(2agMH(-ll-s54u?HRsq(HJ(>mUn7_0 zoXjole&7_Jeg28ejg{gxQMrD-TxyPYipvDezulZ?|4hdB=ew$<1~)EWTIBRecy-Rj zvWXtgZT~K5es@hYE+PB{vzAP9{JN7iFRodfSKLy2>J6)+oY0o`2Q#_$J@w&l6u*%+ z&nt4h)#AH7cdNvOYO}@Kd`yRQr z9xpi6wYGHe*3yK1#cfPA*NggYCdnDL f&n{s6C;OZ6=2xDVJd>BmffAXgtDnm{r-UW|CUGbH literal 0 HcmV?d00001 diff --git a/doc/api/html/form_76.png b/doc/api/html/form_76.png new file mode 100644 index 0000000000000000000000000000000000000000..6e5ff6f219dd4875ebd342264169e5b1370aa546 GIT binary patch literal 671 zcmeAS@N?(olHy`uVBq!ia0vp^)j%x8!3-o9Y`nY)NErn9gt!7}l0cNb3^!1NKuM5a zFoT{)Y<@%kyfr(IUb_48%l}pB8{RW8F!6c1IEGX(zMcDa)?x*o*7zsEE<6A4zN^qw zvVGg!n=@a||M)Rt;{@kPlRt<*__cb!%&n{x8@qamX{GOzD2jB|Edp3q8Gmx)vEvpCxgm^0e&c{nHldmtEgDyC?7M zMiXJh$*UHKCC^!>HN(?sbM|5Wosv6yXaA{@nE$)iLsP zV~e%)ve#V8d1$*#=1$Z)iBp@a6ZEQEZ`g95vU+|l`roRy?*Gg6&Av8@`nH)Atlp$| z^i$5Ae~HcOEOVc|+2MP2N9sAlZ0=h>ov(RriaDfwS}$o|u)I}FmCNpVJvZK0b4wYU zb#2n$>KFE`#B}bq>(kzOuRZ(e-E8w!vFwFPURu_%oDa;7EDV`_?ppq`Xov6S6EoLL zv|RnE?Y8vf&!Lw;&;Gia?{0o-@4YQrH*f8Kt3FHU@Uy(lK~?uI$G(0T|1Rm7)%~Yy z?2L1cPC9>TcgOnMZ)N!&=({AYQ7ljHdjD0fLH&kwR#@<+6MNskJ!mNSX3Lex^`*59 z-fvVxe@*{m*7}=0JwyAhV+O`M)ZC!+Qn>##f#$jv*C{Z)2k;-BIAlF>qr#T=4(4+oRMn zA?tH_S@x3_U6^9Xth+VplRm?r67+!ts6`-70PwHF9b8RPVCpLbXQ_soPKu63t0=5=GTv68aMtlejMZa zO!w2p|0y0zQeKB1)0TUB@bdbGPRq7uD;`>={bMsQ)(_qmd{2l&1FQU0-iGUrEZxCe z{k?Whl6B+Prl$*nLyI>W>gulPc3o_`Eu{Vo*EXBU{Xb2!Sq`-C+$p4X@OIj!BgXH- z+?*M2mSy6 literal 0 HcmV?d00001 diff --git a/doc/api/html/form_78.png b/doc/api/html/form_78.png new file mode 100644 index 0000000000000000000000000000000000000000..c2b93efae910b3ca1d4c586c7d914679844f5703 GIT binary patch literal 666 zcmeAS@N?(olHy`uVBq!ia0vp^RX{Ax!3-onzg-OyFbMDoaRt&OfhcmVRq~!LU9_ z?v&sCr3yB8zD!w{D;aDMI4559<;#{QPnL(rwuzj-psB|E!E(>H4U*!s4J5L4iz7Fw zZ=bH)Bplpo^i}nwYwg2t*%`Ydi`J@q^)3#TQIAUl`Em^uC z)6MGU>0;C8tY7p#-&yeMs)jMw?QKc(o)^kokY6?H`#WXN6W7c|Z>8+q=K5ZBVdf8> z2QsstgbJ^h-#yugz2sHzJhR!sR~tPUq?50QF8}zE{ZQb(=tr*m68!ZdOJ~l%;qtC( zgZJFx$MZ@&V*Q)BUp(69HHrUt>5b9}QLAml1GYz|>oa^Tm~Xr0+?Ge$$yFcX9i$V_ z?zQ57oA>74c|FggGq1k1%;Uc5*SYPI^FrnMzm!c)r!P-YpFLBe-TZ(>PF835@2JUT zkDcpUypDcaq{%<6TQc?Lj~}KIA7p0hr&U^oX^0d)S|hvk_nx2W95YuYh1oOT;op7g zMaVR+G7PC7k%qvxBvgo<=)UZ zr*PW25`Vd8KLR{E9G#Xtv1h`C5$!fH@_!Iaf{y! z6E9qwd;I>7Z<@#68O(S2$KB2O(nQifbEScI-m)0sW{dpV-&zpOC zm~ig-Gi4_KK5o8ly{C-M6^<4kAD;H|E-z>GbynD^-TkS3B-!45*NxnSC z>+`HtBC+49bu4S7D}&C=S8e+A$!}s;X!N&h$1C6eo-qAtLErx4kEWRw7QNWPvoG}C zc8;m{#P53x>mHDQAsAYmmy`MGi*BWT&_>tChZSGDZkqFQV(#@h>zjF=xn(FTv0r@O zm$4yv@rkJ5)n!F(Y0GZMoiDk6Im%8Z-Q-nG-{uO{Yq9zhd>)u}=!Va}8G9oqqh`i8 z?LS%{N*X<+fOfe zv?lQJ;b*Ca5mMfL{ygAoP#t{fjk&xdV&xVgXbm3{D2 z<{wPPOfd&%{JpvN_1n3>PR{ERT_^r4C$Dk*S9Besa<=+^rPYY#qJsA=@(gMEXbLAyEt^MO8AuEUr!{pgV(KjzufMZ zo3x{sXS|W}Y^m!pE6W?0+jgzbKImDdqq(`apW|5JmFsQ_JGaXDv)nx96tSyFn(+Xm zm(t^ZLP^RV)rkzhwDukeYqIWq^|Q(M)`ZA6pPAoh9j){Pnq zopWOK|f>T#YfBEqE zv8psf-bId8#{(}F-~N%fo9##6oaAjY!p}Th9`D;w-*120o^w+}ujyV;RC~JmxvX`M)ZC!+Qn>#)qCRjv*C{Z|B~ewAg^hwO@SC#=rmX_oem( z26Miv7M*zA@JFH#>|Hwynf{n9!%%v8#RsLwexg|4No}aoP`*F)I@mFuIE&uH}|5Dv`pLZwU<^~rm z6X^R}wmIcv(4{XOH>Mh>-;X@@iob1Z-SufLO3OX=Uzx%8_Li!y_w{>mKR3xto+og9 z{x_Z*Jy+#pUN7by&vN26RZ!>Ea|8=$5W`RfSj+WM%#p=CYJmcIIz7?Nu znN_Q&Z98|wpkixok8auO<2`EoX6rWW@_X&P>DrRJKPEgcklD7!m~WTaZv}=QdMN@w z_Nv)U`**hRx&dPa$LDJm%oT0dOxB7{TR829O}H}$gT0gTI;YM{Zt4%G&p*naZd?#+ lc|0fkRZ^WIS3^BhJ;Tq}-2E*K*E~Tf$J5o%Wt~$(69A{O5FG#j literal 0 HcmV?d00001 diff --git a/doc/api/html/form_81.png b/doc/api/html/form_81.png new file mode 100644 index 0000000000000000000000000000000000000000..e06f426e25a1fc76133903c35a81c2cd4276f4dc GIT binary patch literal 626 zcmeAS@N?(olHy`uVBq!ia0vp^6+kS`!3-q7OH}6rDT4r?5LX~g5{R;w;Rb3DC<*cl zX3+D9&2Q+Rw`S+jOLt#>`M)ZC!+Qn>#)qCRjv*C{Z|A=3d#oVPV&7LF`R055?c5ED z73SYk(!v%`4eRJ?VvVg0`JUhKU*ujZ`vHID$P-cz+5;_{rQHjeAF$PH+upl9;qQiD zh8tz4Gukx=$JH`zo%wjl6PAMRFG~+;%-{ZVPp7EuKArbBu2fp>C^ueTY9p-8nK-3_ z^@qUfJukB-u^*5<)M>%?`0$Dko7^8N+m*eZ{3Q0nRtfTu_r*vk&Rh?+iqgC{3 z`)cJ=_8WQ`EON`248VH zkJk6zw+;Pl!cx&%{*EDL@k!OLpcJ1u)~pY>+WQ&eU6sXhUoLs!v{$BLxgp~R*&{Dj jr!{Ln{hi40=kgEMia*?Ir_OX!2c;ZOS3j3^P6`M)ZC!+Qn>#)qCRjv*C{Z|A;Vw_JheNWH@JuI=CJZ|f=@ zD(wH|Up9I3$u@&y8gDQ7amO?Mi#{UxfIT6+LEb^;_HOoyBfq&C$}KvxKdXv85Y%J3 zqo@-r!cZ<@ayGhKjbV?1ZC>852^D>Nk8mH5&WZ1y%=l|(t;SKK6-P?f&Sr?)SeA0S z^~RPjjCY(PpKn|>&1>0Wmdjl0w0|lTW}L25ms2_No6mC1dEIxPKWtjP{PvBM8{gJ9 zryr7iE#7}V$>Z0&8>`t~Z+xgwdL=gO^&1D5TW5Zy=(}Z_c`F)g`etffof6V9Ve;dB z>f5res+g5t$q9S?XI@a&W})X6)(an%9ZB$;@2pt1xKH9hW)QH`ccoTo3uaaSFfpxkA&@n`_grPMNYsVzutF{>vu2C$0;vPWn6D zEx03R#o`xN*6gm!dLH&~ql!8AM;q01V$rg0-&VcbbWQO162|t5+&8Pg3Vx`|;Wb?` zCu#M5=f{69@mnhY^(t&+JG@srp;NN)MJ zwYSF3`M)ZC!+Qn>#{Zr!jv*C{Z|B~gbX!5dh2OkUVA8+;`Nns` zD)wfWPd!pu5V&Qv4vXz&+vYgNdm_A`Hq7wLp|fgU&TMz3%JX@ z_sp^XqEmIIPBV}3-NY+1>^>M==C`%Jn(Y>ogxvK z-kGqu%rH7K$~$0r!S@&QDpKX$Kj%dL&S>229GAzpv{vHh%o)0ksVifAjq<9`g#2tQ zn5OFVG}P@_;^+LI`JW$MxfeWT(^rkm&cqZ}?tG~wMK52Rw5*iznrsp`w|s7D{#hrn z<=^`D-YUs=-111wbloSrrpP@USEN()7ad(+dhYihzqdy|EKJtD`r&5z+%{>g)Jkvm zUDr)%IiGe;=-iQL&pDadg&~iN443 zUk9sy6QAo*zIFNerJFcP6R(H%zOy&*Nxhb|el6?2nDbs&X5E)s`|H`M)ZC!+Qn>#^;_cjv*C{Z|A;Ww?u*GXuaq}`&S?SkTwKrW$ z&ZDRJPO;tVEYJ6z&BE(%<@PF;?&&Z;cEeWc+N{c@9g$mos~MI)^RAN4zhJohPoDgi z9!8soOE%Al`(pXI%qYvQxmIL#s_D&5zqRi5eOr4jt3qnm=B`O|d$+GSwZM1r`r6Q- zjXCQoKF{B6b2!BP^_h9*!6jkGf>!nme%v}Q`>mG{=gKGN%WQ9dcH6yXwgtm^1HGGB zA?a>mb3>P#b*legBk``PGl#`f`2{YYji0)e-dC;Je)c s(>!yAI|?k~Aqn}{zCKf8`my~Z`#U4nA)=YZ0Wr>mdKI;Vst09V};KL7v# literal 0 HcmV?d00001 diff --git a/doc/api/html/form_85.png b/doc/api/html/form_85.png new file mode 100644 index 0000000000000000000000000000000000000000..4b0de871e6d7e381299afb63b2eb4d508b7bb2d2 GIT binary patch literal 650 zcmeAS@N?(olHy`uVBq!ia0vp^6+kS-!3-q5+cGu+DT4r?5LX~g5{R;w;Rb3DC<*cl zX3+D9&2Q+Rw`S+jOLt#>`M)ZC!+Qn>#-E-pjv*C{Z|C0Zd#xbg!f$=-*q{IR&s-ml2M9fQJi+f4>x0V?rOXG?6{miw+auXvEg<%QH==h# z^?e_^bGs_}iwk~E+_fjHf&IpjISdWq6E-dFdp?_wfj{Ay{ac3h3k3349sj@fkiG2I zFMLVTd*pMD_S*b;}@>s=HSIM8@i?tgo-7XZ3C^JCk#_Qv3G)b#cd|9<6@7#bf%V(Bo4LwewTL zCDxXyo_aU+<&NcN`u}>I+&eAe{M%e5y|pj=lrK+y=hJsU^ zTBpiB@Vrttv*iv?<+WNp{Z56iVUkz3mN3q9>|Nkt@_$}w@$~D9G7om1zQ*!FCM9jM zS+& L^>bP0l+XkKkFp-; literal 0 HcmV?d00001 diff --git a/doc/api/html/form_86.png b/doc/api/html/form_86.png new file mode 100644 index 0000000000000000000000000000000000000000..e2cdf1fd16ebb56805715035be6f295b5f7c7ccb GIT binary patch literal 622 zcmeAS@N?(olHy`uVBq!ia0vp^`M)ZC!+Qn>#=D*_jv*C{Z)0y3JyGDvDdej8@V|aH6VEjD z*Js|OX!Cmpo(SF48KN*GvGKRkXF;kQlyi)Y7k}DLyn8*F3i(A@nYISX{ zTwV5k8?hbFm|D5SZ)c}IXquh;sJZ-faqW@Rw5_UJvz2YUuPm%|u+-oA+$P{?%27=J`%$-Cq#rMG7y6NZHsQwC zFY{{44~oWVtenW?@Ye5u!B(jx&U)QD=jV$uF^CI_)$o^GeRgk`)9VQ(TjK<(k1WY$ zve9ZD3i@n(9n|$y8Z*#Bk zJkb1jN0#5Rf88Q)y);he^{@4?z7E(mIL~SE8jEL9q>74SuV`5zgw{@3_Q z&*r?|vTxt(g%ds(3on{CzgD?LATP19-fLx?_x=3P-)l}4tZ@~8I{9?+Z2Q2Z<=rkX zrv&Y4y<0QIGGos4CZ6*}^LHn22-{rYou~a*>8N5$LF?Q8YcDTIEsb82H2dc{5q2Z{ z`HM@8fxzODY>a$>@&+=l#v&z4?p|1_m)KASGHiE84aUc z+RFAv8Lk5*4;`su(qW6)`AcQOoYU{jvKaUEq%!F+Et=aiFU@YPX4p=h2K$3Q<}jH3 z+G6JIJ;9{se|9_59Ovf;=lRZ=xu`qH(s1)I}176)fDbLel z-&bvh?FRSmZ(T4?HtKjD3)^X%O)P(}?)35qZD{^{>*(Z!&kw%&^v*f&?zi>7-R$O$ z5O2>5zrXR$ZrOUZ#LOaeqTO4DWX^RODc8dJ9?t%3=_Dxlv+KA~XUCQeY14|=h3z!y zk$%c9KD%Sys!3leeV!J-m#ba8a?>x#qH{aB-Ls{>$0Y1t!!-BYmD%CfZC}WHJ>FcC z?-lbm+GR;^?PGyA-Ac!crr*v=RrWmkJJk8B+|4L~9nYPhSvG2Cw`PAhwDV>erGzWa<9l3m>l{;xZ~I_`TY z`jzEHfwy&}a(Cw>jkJwFZyl;AZ`s{c7S&MmhINOt>jM9yNsRLZE@eu%E;^hP+jrF@ zGU$A*V{!G|E{6OT*bli!YOLA{^gBZ-p8G`J#hH?Vaa^2!n+gx-cZ$Th|5Ve zd~N$keP)}H!}fq}`r=d8v|p6s*Z;Oex%`zOS3}&9vt30m*^ef%_1v2K@5LN$t5>ph zt5arL>HALm^L!@n2meHQSFg0|llPvvzGA-jHGW?w*6Zt1yx%a`cV0ak&h*hN%};x0 zRYAz#f2GS9Ze8HqAgp2dZ28ZUElFI{XEOZRec|+FY4=-9CQYw5g*41RqBMW)p+39+ oN{y~3%BTHX{ZLkpPgg&ebxsLQ0Oqx%`v3p{ literal 0 HcmV?d00001 diff --git a/doc/api/html/form_89.png b/doc/api/html/form_89.png new file mode 100644 index 0000000000000000000000000000000000000000..ddbab8163dc7311b1210c05e342b3ff9d6cdc5d4 GIT binary patch literal 801 zcmeAS@N?(olHy`uVBq!ia0vp^(}7rugBeKn=G*xKDT4r?5LX~g5{R;w;Rb3DC<*cl zX3+D9&2Q+Rw`S+jOLt#>`M)ZC!+Qn>rU{-djv*C{Z|C0Z`(!21V*j4I@Xx>e-`h6} z%x;mK@IdA)>no=YmY9{R-tA-k(QR;S#&?Dffh}AHO4p)ZS2O(3@L`l#pw{qT)ay8h zfx_*_n|WU@W0-en`E2$I*{F}*?=^Q+?OHnB`}Fe~<_fk-j?nrvzAvJ8beFPx;PLab zRbM=P^~bJae<=wq%b)y=2fPE?PG<6c;5iz9rM#MW)^J{hR+?+_{VKg?3rd z+PLrH`V}u<9&cxFyA&6G=CGnexZ2MvH4J@GmqiYxI89_;{My;-gOR06^SKq}pHhQQ zyzBMbm|b;!^3%0GA>QXUzP~YV`s6!P*Le3-ANQKG{knA{^R8K5n(n%LK0SJ?#d@Z< z>C~rNCi%&>$G`2nBycT4_DS3FvrD}-pQh?G7T){4SgdzeLc2o$+4Z+-gY({>p1RtV zk!S0lW7Y5D4^0#|R@v5-`2E|KqBoZ3=k|ZxqmlRB-Trq)jP}wg-a2(_=bD%#uWI=k zW37An%NzgW+9q*TZ_>8zXJD(?9)BrJbE%x-!xwcX{9P+vZNDg&Cf?O)|H`%Sm_46l zgZG_sw~~K4TYR2ZgnPG|3HSz-h1*{Ldn4_`)egz$NA#oL6=}G+MoxYC-^=4|^wHE$ zEn9b;nsdA6uj#3L-&G&)EcP^i+mg6n`1=Kq{U zb6v6OZyFIdIg9;1owb^>TkPAp&W3w4bIllP7|V|3oYy_|W$va|q5G<=4hWygJGoOU zssC+t&C{tuuU^VA{}9WGR$lvXP0`_mo1aqIH!=Jd{3U59!1hD>2YX9|_|{*?Rc3+` Nx~Hq3%Q~loCIC=eXdwUq literal 0 HcmV?d00001 diff --git a/doc/api/html/form_9.png b/doc/api/html/form_9.png new file mode 100644 index 0000000000000000000000000000000000000000..3dfead41e94331b31d029797aa2c130251210fac GIT binary patch literal 578 zcmeAS@N?(olHy`uVBq!ia0vp^xj-z%!3-q37?os!ltF+`h%1mL2}Ie;a04|6lmz(& zGw6B5<~Q`uTeI`%rMoY`{9l#6;XMNb<3>*x$B+ufw{u_j-BI9awSPCk^U&}8xx6Wy zGw0^K%rl*;rRcXv<3Y0g?GNG);tymre0N}fD|{gO!v&!K^y|i-8 zRKq1w55&UF_8+MT5_y-T)v9E0KvdDQt@da6E5?F;ZRws#Z{EJ#z^-p_WL_2+;|%jIY`>DKKKt{%`N2G9+iI3A zS#R+w;$)NZDr+-SshXfmJ2%RA875Y1dQJ{H)c1O4$i3Lvo3Fk5BzAUdan?4i+pp`o zHf`_F6s!yB{3XFK-*A(t`S--wujlQ1de^^a-F*APC9!2z2aeB44)?drE?azRV|cF2 z_Qu`$v9D*f+`eOK%Jx=e+l0^$-6cWBOaKHeInzZ_#doF!Ca@RkCs0Gr36n`KbLh*2~7aJdHEgy literal 0 HcmV?d00001 diff --git a/doc/api/html/form_90.png b/doc/api/html/form_90.png new file mode 100644 index 0000000000000000000000000000000000000000..a98e312b70362653578048ca6845448b02422098 GIT binary patch literal 887 zcmeAS@N?(olHy`uVBq!ia0vp^vw>KigBeI3pXXlyqznRlLR^6~Ng&Ezh8w6spd`pI zm_g4YHou{N-kP09FWr6l<^QVm4euEkn4WpMIEGX(zMY$Ud9xNzi~bYcAf5mJ@7p=9 zP0HSSZp-sCe;X66rv`G&KKo4jzxTc* zH<@h~?$)h$mghZCU9yp%L0sTSg8w@C#Uc&qUrv{ErZ7}+FFx`-_7h`S;#wmknbitv zZ)6{Ex+%|c-*}_QW6ssvZ|@5vh_luHe=_;f+ta$aFTU~SC;BtK=i*9`f7fPv&W+dh z_w~y@_fBMHC{2w`{dtz1LH)vwNep|ApKafC*rn()TkRG5C^28J+c%n4B(2%^XlX6$ z1Cew0&-=Jg%=hyZ(aWmov!%^8TD}gQ7HMLVo&J35CZ2}v8dvfe%M_Jf%lN-} z_BUn8+3Z8P=L5VVd6)L;UfZ!HtY=@KTWN_K5HIt2VFPR5|Bfw%_CKO)^ADOGVzp>m%Xa-%&ZXz7p6kA^H{J8mTzzW-gPpV8%LTp5)uywV{$l+6B09Ek zeF)?0E!zHDZ!c9=XD};Xc=qJtSq-ITr?oUf*M$3j=e}-P?^pdo|66nGw%>=2sTsa5 z%DotxcXK1x1zk7Rf~JVuYzNXWuzmiqon_<4m8Cns-AY=t=-kq7#y@O-U7~%X#nZW- z-*~n>b>@@guxUvh(^+^6crQ1m?J0Y6H}>|~#m9X&x&~G*N&BgIAt03fgZ7b==|Q3m zms2=vy`)^y*Y4G{O8y#HYN~5~*t;grk0IWre7$J$u}zXv;sviRR2F6W#w=catbnnu z>*50UTPLKVqaB2GmtEofaNqg&7Z+)>ogbuTd;R}*Sc#>gJHTguzIkxYLgo0EwG8pj z6P=@~?#q`eH^eJWOP>C3?=!}4hLzF>bP0l+XkKlJ1BG literal 0 HcmV?d00001 diff --git a/doc/api/html/form_91.png b/doc/api/html/form_91.png new file mode 100644 index 0000000000000000000000000000000000000000..b886d8c0ea6a9505badbfd656f14d4914184893b GIT binary patch literal 1070 zcmeAS@N?(olHy`uVBq!ia0vp^?}1pHgBeI($$#-5NErn9gt!7}l0cNb3^!1NKuM5a zFoT{)Y<@%kyfr(IUb_48%l}pB8-SKD&-HY145?szJNIJI76qPGdq&2{*n9tT|Fe{I zcjay0`|8a53ae<-lb#lyd5r&vU zz0nQlFYaLY!Ls~?I-g$KbGwFkrUQJ3_b|jHpEjTMEb&j^A!~7l`|j$$8kgyr?JD$}2RazA#}8%gl#G3@Kk`(oQ}Ip?-{*{9m;3tqo&=K2$<$*{dbS*1a{ zWbu1Tov>TqFBr^!ZhhlTh}SztlkWvn_zu|i0d;oPeX(WtEStBDYlg|HJKp;a_HUe` zt|lMyWzzc2bz7QeK6>)p&E{D3di|hUu|@K)1kOy~`=YrfG5L#-qSQ>uI`- zn6_2pP~PrW&7L*tFPF+lr2jPPJg?||;cV+^y>C}PUi%_Y``Dpp<4#r4!jz>3lh!ZO zE$eeF(r0`0VCC0oo5Rw-GAEQz*Vx6>;xxA}dd}VmcVsx11{}ZoFZB8H#4pZMjQVa$ z3r?9TpA;OE63H31f?-ZUepTPSq6t>h_P@@MP}iLJIqtcuhMDGxnL3{5-Tn6LN%#3Q zzm56E!Bvxb-sr?LPwV6>IQF3Vs;$~$e|}pv>#4;WdNC%>JF<3HUk?7#*6it5lF$@i zQ~xE|yZueLnfJ*r7auSFy)ag`)|E*nz~yE!V?n?7WvRUn6_h6YG)$UzYa4_6ik71( z_ST1-|J-_a@n&o`|I#Ri_W@Nao-;j=o4(An>agSUvY%!iivd0p)s6S3j3^P6R_k literal 0 HcmV?d00001 diff --git a/doc/api/html/form_92.png b/doc/api/html/form_92.png new file mode 100644 index 0000000000000000000000000000000000000000..7d10fdadea7e082e7851fe68c9af9ec47f607123 GIT binary patch literal 1155 zcmeAS@N?(olHy`uVBq!ia0y~yU{nCI#W|RP|rEhr8z`*>;)5S5Qg7Iza-LfqTJTeZfu@k@7-`3}} zZ|dH?^zXLtuQTSYd*qYmbV!%s4=Y2Bng~OUid{R;f?eztZ}=FP7fwrNY~XK+Jd|%? zvdlrA!9e6+FdO6kqzf~cb~7Ca5c#okRTpD}yt`qB-F)ApTe|oe_Q|_Cx(bWNl=z&J z%RKwc`b+Ii$+~s>3%>L5I;1zxS-0PxUpW5ntJx-zj?TiOCRRLK!%uiD-2B#Ne`wRD zW8H6kK4dW$-21-yja<~EnL;J07w*(7kXN5y=I;GlR4QtFCWQ!0Q{ircG6~ zD<#jy#4nlJzimo4YeU{0r`@klc(PS8T>UGc+?pTs@7#hyR`FRY7F>JC+q>XS+xF({ z-Fpn&@3c*Sx$aXOOM_Y7LVe@NnFgKQg{P-vPrKile`Y~A*E*9x$Fd`;rrMUNKnmmgMi+I`bY*Dqsp`_`FEvldu>*6_G} z)o0q}$#aD7TQ{?b#AHrtieeYtaAm?nd6mZ6rT1ntpWWVR6kPXm-d;b0m;MEAWlnkv z3ZJf8V0*F1Q0m2k-52&uTe#f7a;5rX_kHDTy&4sZI=LqCJ&!3p{=CQSrq6@I&~>ZSjs)Gk6V7KG;QCfH_1ELeqBoPeID4G>1(5CV=DmE&Z`O5-j{oOmGvSO zdGogGMW^;O=u4}8&oSg+n6+SOVAzc47vXG%Np^uZ7Mv-Un$ow_)W0*3)!(Gok>P?% zqkY(o<4T9E4}V{FTKS>KkFTNKqRmnnUK`ox8h@{}ll!9ZdG8%ZXRdh}i<;In@BbF* zUno$;?)hi7xj9pvAzE;c`C>}*tqQB(+OX0Z?TS8dH(5*^?spk z%Tl`(qF)%i)|!2}dR=0~o5U$00fr?uQ?_#6`_g|pku`kQk_T5D@12aF8L(O8PK4NM z`I!1s^Zso*Y5OH2>@CmUX)RmX8{%AEcz()U7;5vA(PaC>b#v#0nY}C1{^|YQ=j%C^ zfV+pmiQwYG?U|o1lzrUvcmA5AMZ2d5AK&&U?B-I24_f=!d~YxKdGj%I!|fkpz99i6 z0naar%w5QD_ljZ8cFPqUS?|SH#c26I|KV-Lzz}!r`U2m@IelOAe=K?M1~aqX!&Wb1(jKZ&C_x9E@YP^2*g~T4zn(;*;)kmWN@_tWekH4Vj0!CY1om^KCDtDX1i~?5XU&zhbh{$J^ph<%2)o zzZ#`7(e>)XzXullY0^m7_`T}t#FVNKrcYwNKfm&%cj9F-tS$BDxOo+q%{+|UBM(5A$jMA6)OE+=4d~k#F zukh}KsR^gvPs%v``Eq)Ib?*$vWjo57r5tuQ3FxKtZmX$07nO5*+76YPPoGa%9INVh zf53Dx!-tHtPdm;gPwcGt@>yf~uae2(jyq8Mn{y&trdC&DceSR%N#nyK@{F~P{?vL5M{KqmU#s~X1)k~J} UE&5<0BnL{op00i_>zopr0I_sfMgRZ+ literal 0 HcmV?d00001 diff --git a/doc/api/html/form_94.png b/doc/api/html/form_94.png new file mode 100644 index 0000000000000000000000000000000000000000..4c38613c59521c9cea004a140fad01f23cee47f0 GIT binary patch literal 708 zcmeAS@N?(olHy`uVBq!ia0vp^Gk{ovgBeH~t~qiVNErn9gt!7}l0cNb3^!1NKuM5a zFoT{)Y<@%kyfr(IUb_48%l}pB8{RW8Fd2KgIEGX(zMcEJZ;g(Ct9ZFf=KcS<{*BYa z*x!6piC44y>G3wjs(I6zTcLkgf5bD?FEn8MGfT%I_!sL3@2+5`3@sjp?XT)ZKk%() zn5S8GAcseP``>_IwjYYy8!{WBmp)ICHBe5S!yh^~IzQ}br0BB4ZVhc;I6ipDZqS^g zdyPffd({>>yJkbF2K84Bsmfxvy>Bu`pL{Hy@UHNbRf3Z#??WcBSdBGR9nJIq)J4eq zv>&_?5Vv?=1N%L}&)Q6XCN#)Q4mq$XWZi*tvrMvlV-EgKV6?vd^nUcI+B?(OUwEBl z@)Jz9Il^Z)r7}B>Q}wy1{JQn;nmo^+stcWMmVbPT@N1?WuX<&HN^afOTw4AnVdp+D&eb{@`_wfba_nktbyOX^ z)#k5NPuMpnK5NIv<6qNWG*t%w$#^Al?_0+HwdW%KmE1kC$6{A%S(oN1Q3cmin@+`S z+NwQOGX3_vpw0aHi(iSa(tjWOdUo^6xf_19rkUz_*#&&NJ*#f|lW?8$*LALlYWjlM*~l@kz0+d_m9AV@DH?bMh1{Udzt#u9VH%xx;XYbL`G3 zQY$$Y+hln~uUg+<+#bnWu$U`t+S2m^M%7~7t=j~BKNQ}~&inP_&s~Q5E1PyMwbv6+ zmEJ5AeuCxihhx!;?e1OEcq*y1(}1-wP{wKba>jqcHxvEbpa0`xIbgrQ{_9(TnG4s+ QJp-jhPgg&ebxsLQ0PNi-1^@s6 literal 0 HcmV?d00001 diff --git a/doc/api/html/form_95.png b/doc/api/html/form_95.png new file mode 100644 index 0000000000000000000000000000000000000000..8e03ed3da11cc082c5f4f6436bee7c10d58a478e GIT binary patch literal 740 zcmeAS@N?(olHy`uVBq!ia0vp^-9RkC!3-q-n*LJ&QU(D&A+A80BoJjU!wu9RP!i-9 z%%JBHo8QnsZ_Uo5m+rp&@_$wOhW88%Ou?Qmjv*C{Z|9yZTcaS*V*gLDwBrBvy}Vt` z#xKsOoqSfLAw1bG;BM&MJjQ>_4}=mKfA~f;D1Kpn@IApfj6u1D^MTm)PKNWj`tKQb z)gC;0>_fp@S6%G`(sz!zGT%|Ebx%8Uw8L)a3X#C?-p;pNlT8bzLj=-{?kLbTfa*r%Oqr@!=+Q$c9>Nkcipk;mgDE;yQXY^w)42S6eCZ< zwb(i8;_>Tr9=%zr^zLSS(Z^*Kr$g+wNxZ#X<>zskBmRottX=aD-PD|>!5kr#IW_cI z>)P5SXXfOJ-zhw4XVbIFbLH&(=sD44hx_|fLgvqYA26vcCNVoUcGC8UUyGha3BQfn z_&x86R!&e$@yy1&76wQ1u<(0Rk{gSs!&t^yu(Q~_|6L4ySg=G9}hoGLU=>}K)*F1ZC z?BbRdhP(y&D|2Gzchm=&iIQpG+hZir} z4{ug5*f(cJmNUNMw{Cs1PtK0PzGFVdQ&MBb@08Iuy AFaQ7m literal 0 HcmV?d00001 diff --git a/doc/api/html/form_96.png b/doc/api/html/form_96.png new file mode 100644 index 0000000000000000000000000000000000000000..50dfb77379790b212e3fdc600ed77ec48c7d3b18 GIT binary patch literal 677 zcmeAS@N?(olHy`uVBq!ia0vp^`M)ZC!+Qn>CJ|2;$B+ufx3M?3%{JhX(Vrx4@aO;ivL_Nu z-_1;NC);dkKdh2-&13P=^$Z{8E3IYtz_x>lfnQLHVUOIb^-M)}=?oRjhgkDHH?`eu z-)6;7A*ff8%GQ@}fAsd3IrsWMvQ3$zS7FQWM^UfB`C`zMGt#S6UNfw$Ja>8Hi-;!G zXX&ToUk81=#Mr<+;ky2|w5G?UR>c7`OmhP-JS>#?!qgC-n78)s`MKNu#BRP~T7TZl zva2qXA-#F+)^DPBodd7_-uZdkE&VGS_jmmi(0rF>71!Ie*)jC$`W>g`&b2zie%IL7e^@_^@d1zh{K?Mu@xb-XjAb**98`R|WX-?y?$CuTgVS=6{F@iH@mTyyQQpXMdorskRU zrC!LZ&6Cof$1k7T;@FaZ^wOU%cW!>3?fYu#w$ux$i5OJF@cLr~$*WECKd$r$^RAaV#C#zBfO_D|sqw2moZA$fHP3bmIIsrq203Z%WNOR$V=tNI}nJY+Dqm$rJocT4-P@sX{kOycs%SR-|EunQuarKPJ z<0Tq^uFqID(j#T-<`M7_0a@MUs0vzrUsiE1SPI2fTI6C;fKD9nHxxA93(6OzS13Wm z!qML`))yxa!8^C)&@+S)sSH_-YOAxiN%yD*c4v5`Nq-k@wRk>LS*ae`D^TL|M7!tX z86T|i&D}#;oVMeI;T79&@(mrdY9AsDul)M6614`ppn`o- z)%eRdNoukREY1j_=bR`umJu$aOe}$ALGfUed!$7(ipvw;@_O3W+4VN9kfuMe5kMO~jFKJlxj@`0tE&1sTt>;X>!jTn7bf)u%2lZdtKFpL2&eAD~bxi27AZM#?Rnn=l zExo%~&w|9|_38BO{K+_&fXeKnKG27RW|zL@zPmK@ZW9}Ce`eGxIqEvTZ4ytFytF2d z<3ql+ZhBM|<+3@0e~j{7W+|NUlFizG;#T?QYobJdW;u@OO6~i6xnP216+RxKShG3Q zqQ3Cg1x+ZqP^S9a*m5Ndk)3m6t!PtS{$f2N#G-6Y82sWW#l9TxvA`Zu~ zl~a}}tw$jnrEyBk>Y_ET1lHr+xgjo`p^0SIt-M^h7tcg@Y4aTIdxsqSSZ4(-u}$-< z>#uA~=(ssg*-MHRSZMZ<(h=HD+&~aqr{BH#rq*j`X1&?91V7AIC!ZdExwlnS!yAzs z6%}tZRt0az)X<4LOPN{9VV>ns9lcB$I0vSEJ0L&@KG{-K^T2Q{1v#{wV(6`|TM~WP zwUEz>QJXto?<(i2U{Gyv=NLvcli+>|VI!n*F-CzlcKx+sywgcwNhAttGB^Lo*>^|T z6i?KRcOYT}mBF3EJQwvwnWV>d3iAm$Q~0Vh>1CX+nq#E2e<>zUWtt#s?EmVhnfxfe ztlMq1MqoE)PQbQ5>axK=#9^xyJ}~siCd!iTdN}F15p1Iuu>qET#CTg7*JXMGGhsGz zGe+m?D Su8IFH)xpli_VtyU$^Qa;QjnSe literal 0 HcmV?d00001 diff --git a/doc/api/html/form_98.png b/doc/api/html/form_98.png new file mode 100644 index 0000000000000000000000000000000000000000..99a3ed3c04b29295c676a572a20d3f6568da1cf7 GIT binary patch literal 655 zcmeAS@N?(olHy`uVBq!ia0vp^`9Lhr!3-pgvL5~eQU(D&A+A80BoJjU!wu9RP!i-9 z%%JBHo8QnsZ_Uo5m+rp&@_$wOhW88%jQ>1c978G?-^QMt_E>>OCoD1N%>Vzn)1RpB zus(UD_{HHfj}?z6xT>yf*}-(6UTG7tc(pzWnUR^=6}`k~$9h4Fi9w?IrzcF; zbh&8XFUTOV%<=7<+YA0S`(GFT(lPU47DK1ooLAZz8(6zj0xzFk76pk z{Fz6zm+}OE|0-zCEX^YIwOh!idvn^^H?x19kSVcf&Rc%|c!f~>+R_=jKQ2~y)v)|N z$Hl92+2`r?ohy07xZ{lcPnqKl+x`4MY|)STaO<4SweLSe+`oS|-;-Z)ujlKAhb#Xz zhM%vQ6mW}AVWDIEdF3~s4ZqbHtnN24lj{)P?Z0cn(L^ItcO&)p>93B@oAbK!-^9on z-)&Dz&Dr@nPA>8MiO-L>TyU+HdaapWY}PTOT&G^&(k0Kj>dc1V&cF`QDcd9VTyEWE zp~88}=6mi4iLpAx#t_#n)^hQ? zxcH>4Q;ky@KBRNL*>%_OyLZ}ph6ZV)JMQxF^`@Nf+bySOY6~#@2!FyIkil=Qktv}M ON>-k(elF{r5}E+J=@kY5 literal 0 HcmV?d00001 diff --git a/doc/api/html/form_99.png b/doc/api/html/form_99.png new file mode 100644 index 0000000000000000000000000000000000000000..2f2b2980b06d533a502c3cf4ef31ac1461a29679 GIT binary patch literal 529 zcmeAS@N?(olHy`uVBq!ia0vp^AS}$m3?xmytx5n=1_3@Hu0Wb35M?jJ4b&h|666=m zpyv^r-_SpA&Ca8j?!Nr;e^vU1_Y4e-4W2HJAr*{o=icmlt-#Y}zimUx!@u{-au#T2 z&VD6x_O6GR-+_(w`Zsp6{Sbb$yq4jIX}jbl_XcURb4;IS`Ks?_vI(!;S`~CoEj1xZ z|G498(ZhKR^KZz0vd}AR&9>kVI(qshL(PLl-%{W9Esi(ZDVI4hIO~~ z7z%G*WU6^U`#smptlQaI+G^{wHg+F<$PsFEW2wl>yT_AmhG!L9PBMJCByN`Ermi!* zvFnv?TGsx~x)Bv{$+|j3RnYELvY(XbOa 0$ +\form#119:$b > 0$ +\form#120:$\mbox{B}(a,b) = \frac{\Gamma(a) \Gamma(b)}{\Gamma(a+b)}$ +\form#121:$\log \mbox{B}(a,b) = \log \Gamma(a) + \log \Gamma(b) - \log \Gamma(a+b)$ +\form#122:$\Gamma_k(x)$ +\form#123:$k$ +\form#124:$x$ +\form#125:$\Gamma_k(x) = \pi^{k(k-1)/4} \, \prod_{j=1}^k \Gamma(x + (1 - j)/2)$ +\form#126:$\Gamma()$ +\form#127:$\log (\exp(a) + \exp(b)) = m + \log(\exp(a-m) + \exp(b-m))$ +\form#128:$m = max(a,b)$ +\form#129:$\log \sum_{n=1}^N \exp(x_n) = \max(x) + \log \sum_{n=1}^N \exp(x_n - \max(x))$ +\form#130:$x \in [0,1]$ +\form#131:$\mbox{logit}(x) = \log \left( \frac{x}{1 - x} \right)$ +\form#132:$ a * \log b $ +\form#133:$\Phi(x) = \int_{-\infty}^x \mbox{\sf Norm}(x|0,1) \ dx$ +\form#134:$\mbox{square}(x) = x^2$ +\form#135:$L$ +\form#136:$A$ +\form#137:$A = L \times L^T$ +\form#138:\begin{eqnarray*} \theta &\sim& \mbox{\sf{Dirichlet}} (\alpha_1, \ldots, \alpha_k) \\ \log (p (\theta \,|\, \alpha_1, \ldots, \alpha_k) ) &=& \log \left( \frac{\Gamma(\alpha_1 + \cdots + \alpha_k)}{\Gamma(\alpha_1) \cdots \Gamma(\alpha_k)} \theta_1^{\alpha_1 - 1} \cdots \theta_k^{\alpha_k - 1} \right) \\ &=& \log (\Gamma(\alpha_1 + \cdots + \alpha_k)) - \log(\Gamma(\alpha_1)) - \cdots - \log(\Gamma(\alpha_k)) + (\alpha_1 - 1) \log (\theta_1) + \cdots + (\alpha_k - 1) \log (\theta_k) \end{eqnarray*} +\form#139:$t = 1:T$ +\form#140:\begin{eqnarray*} y_t & \sim N(F' \theta_t, V) \\ \theta_t & \sim N(G \theta_{t-1}, W) \\ \theta_0 & \sim N(m_0, C_0) \end{eqnarray*} +\form#141:\begin{eqnarray*} y_t & \sim N(F' \theta_t, diag(V)) \\ \theta_t & \sim N(G \theta_{t-1}, W) \\ \theta_0 & \sim N(m_0, C_0) \end{eqnarray*} +\form#142:\begin{eqnarray*} W &\sim& \mbox{\sf{Inv-Wishart}}_{\nu} (S) \\ \log (p (W \,|\, \nu, S) ) &=& \log \left( \left(2^{\nu k/2} \pi^{k (k-1) /4} \prod_{i=1}^k{\Gamma (\frac{\nu + 1 - i}{2})} \right)^{-1} \times \left| S \right|^{\nu/2} \left| W \right|^{-(\nu + k + 1) / 2} \times \exp (-\frac{1}{2} \mbox{tr} (S W^{-1})) \right) \\ &=& -\frac{\nu k}{2}\log(2) - \frac{k (k-1)}{4} \log(\pi) - \sum_{i=1}^{k}{\log (\Gamma (\frac{\nu+1-i}{2}))} +\frac{\nu}{2} \log(\det(S)) - \frac{\nu+k+1}{2}\log (\det(W)) - \frac{1}{2} \mbox{tr}(S W^{-1}) \end{eqnarray*} +\form#143:\begin{eqnarray*} W &\sim& \mbox{\sf{Wishart}}_{\nu} (S) \\ \log (p (W \,|\, \nu, S) ) &=& \log \left( \left(2^{\nu k/2} \pi^{k (k-1) /4} \prod_{i=1}^k{\Gamma (\frac{\nu + 1 - i}{2})} \right)^{-1} \times \left| S \right|^{-\nu/2} \left| W \right|^{(\nu - k - 1) / 2} \times \exp (-\frac{1}{2} \mbox{tr} (S^{-1} W)) \right) \\ &=& -\frac{\nu k}{2}\log(2) - \frac{k (k-1)}{4} \log(\pi) - \sum_{i=1}^{k}{\log (\Gamma (\frac{\nu+1-i}{2}))} -\frac{\nu}{2} \log(\det(S)) + \frac{\nu-k-1}{2}\log (\det(W)) - \frac{1}{2} \mbox{tr} (S^{-1}W) \end{eqnarray*} +\form#144:$\frac{1}{\pi}\arctan\left(\frac{y-\mu}{\sigma}\right) + \frac{1}{2}$ +\form#145:\begin{eqnarray*} y &\sim& \chi^2_\nu \\ \log (p (y \,|\, \nu)) &=& \log \left( \frac{2^{-\nu / 2}}{\Gamma (\nu / 2)} y^{\nu / 2 - 1} \exp^{- y / 2} \right) \\ &=& - \frac{\nu}{2} \log(2) - \log (\Gamma (\nu / 2)) + (\frac{\nu}{2} - 1) \log(y) - \frac{y}{2} \\ & & \mathrm{ where } \; y \ge 0 \end{eqnarray*} +\form#146:$ f(y|\mu,\sigma) = \begin{cases} \ \frac{1}{2} \exp\left(\frac{y-\mu}{\sigma}\right), \mbox{if } y < \mu \\ 1 - \frac{1}{2} \exp\left(-\frac{y-\mu}{\sigma}\right), \mbox{if } y \ge \mu \ \end{cases}$ +\form#147:\begin{eqnarray*} y &\sim& \mbox{\sf{Expon}}(\beta) \\ \log (p (y \,|\, \beta) ) &=& \log \left( \beta \exp^{-\beta y} \right) \\ &=& \log (\beta) - \beta y \\ & & \mathrm{where} \; y > 0 \end{eqnarray*} +\form#148:\begin{eqnarray*} y &\sim& \mbox{\sf{Gamma}}(\alpha, \beta) \\ \log (p (y \,|\, \alpha, \beta) ) &=& \log \left( \frac{\beta^\alpha}{\Gamma(\alpha)} y^{\alpha - 1} \exp^{- \beta y} \right) \\ &=& \alpha \log(\beta) - \log(\Gamma(\alpha)) + (\alpha - 1) \log(y) - \beta y\\ & & \mathrm{where} \; y > 0 \end{eqnarray*} +\form#149:\begin{eqnarray*} y &\sim& \mbox{\sf{Inv-}}\chi^2_\nu \\ \log (p (y \,|\, \nu)) &=& \log \left( \frac{2^{-\nu / 2}}{\Gamma (\nu / 2)} y^{- (\nu / 2 + 1)} \exp^{-1 / (2y)} \right) \\ &=& - \frac{\nu}{2} \log(2) - \log (\Gamma (\nu / 2)) - (\frac{\nu}{2} + 1) \log(y) - \frac{1}{2y} \\ & & \mathrm{ where } \; y > 0 \end{eqnarray*} +\form#150:$\Phi(x) = \frac{1}{\sqrt{2 \pi}} \int_{-\inf}^x e^{-t^2/2} dt$ +\form#151:\begin{eqnarray*} y &\sim& \mbox{\sf{Inv-}}\chi^2(\nu, s^2) \\ \log (p (y \,|\, \nu, s)) &=& \log \left( \frac{(\nu / 2)^{\nu / 2}}{\Gamma (\nu / 2)} s^\nu y^{- (\nu / 2 + 1)} \exp^{-\nu s^2 / (2y)} \right) \\ &=& \frac{\nu}{2} \log(\frac{\nu}{2}) - \log (\Gamma (\nu / 2)) + \nu \log(s) - (\frac{\nu}{2} + 1) \log(y) - \frac{\nu s^2}{2y} \\ & & \mathrm{ where } \; y > 0 \end{eqnarray*} +\form#152:\begin{eqnarray*} y &\sim& t_{\nu} (\mu, \sigma^2) \\ \log (p (y \,|\, \nu, \mu, \sigma) ) &=& \log \left( \frac{\Gamma((\nu + 1) /2)} {\Gamma(\nu/2)\sqrt{\nu \pi} \sigma} \left( 1 + \frac{1}{\nu} (\frac{y - \mu}{\sigma})^2 \right)^{-(\nu + 1)/2} \right) \\ &=& \log( \Gamma( (\nu+1)/2 )) - \log (\Gamma (\nu/2) - \frac{1}{2} \log(\nu \pi) - \log(\sigma) -\frac{\nu + 1}{2} \log (1 + \frac{1}{\nu} (\frac{y - \mu}{\sigma})^2) \end{eqnarray*} +\form#153:\begin{eqnarray*} y &\sim& \mbox{\sf{U}}(\alpha, \beta) \\ \log (p (y \,|\, \alpha, \beta)) &=& \log \left( \frac{1}{\beta-\alpha} \right) \\ &=& \log (1) - \log (\beta - \alpha) \\ &=& -\log (\beta - \alpha) \\ & & \mathrm{ where } \; y \in [\alpha, \beta], \log(0) \; \mathrm{otherwise} \end{eqnarray*} +\form#154:$f(x) = \exp(x)$ +\form#155:$\log | \frac{d}{dx} \mbox{exp}(x) | = \log | \mbox{exp}(x) | = x$ +\form#156:$f$ +\form#157:$f^{-1}(x) = \log(x)$ +\form#158:$f(x) = \exp(x) + L$ +\form#159:$f(x) = U - \exp(x)$ +\form#160:$U$ +\form#161:$ \log | \frac{d}{dx} -\mbox{exp}(x) + U | = \log | -\mbox{exp}(x) + 0 | = x$ +\form#162:$f^{-1}(y) = \log -(y - U)$ +\form#163:$f(x) = L + (U - L) \mbox{logit}^{-1}(x)$ +\form#164:$\log \left| \frac{d}{dx} \left( L + (U-L) \mbox{logit}^{-1}(x) \right) \right|$ +\form#165:$ {} = \log | (U-L) \, (\mbox{logit}^{-1}(x)) \, (1 - \mbox{logit}^{-1}(x)) |$ +\form#166:$ {} = \log (U - L) + \log (\mbox{logit}^{-1}(x)) + \log (1 - \mbox{logit}^{-1}(x))$ +\form#167:$f^{-1}(y) = \mbox{logit}(\frac{y - L}{U - L})$ +\form#168:$f(x) = \mbox{logit}^{-1}(x) = \frac{1}{1 + \exp(x)}$ +\form#169:$\log | \frac{d}{dx} \mbox{logit}^{-1}(x) |$ +\form#170:$\log ((\mbox{logit}^{-1}(x)) (1 - \mbox{logit}^{-1}(x))$ +\form#171:$\log (\mbox{logit}^{-1}(x)) + \log (1 - \mbox{logit}^{-1}(x))$ +\form#172:$f^{-1}(y) = \mbox{logit}(y) = \frac{1 - y}{y}$ +\form#173:$f(x) = \tanh x = \frac{\exp(2x) - 1}{\exp(2x) + 1}$ +\form#174:$\log | \frac{d}{dx} \tanh x | = \log (1 - \tanh^2 x)$ +\form#175:$ f^{-1}(y) = \mbox{atanh}\, y = \frac{1}{2} \log \frac{y + 1}{y - 1}$ +\form#176:${k \choose 2} = \frac{k(k-1)}{2}$ +\form#177:$k \choose 2$ +\form#178:$k \choose 2 + k$ diff --git a/doc/api/html/ftv2blank.png b/doc/api/html/ftv2blank.png new file mode 100644 index 0000000000000000000000000000000000000000..63c605bb4c3d941c921a4b6cfa74951e946bcb48 GIT binary patch literal 86 zcmeAS@N?(olHy`uVBq!ia0vp^0zfRr!3HExu9B$%QnH>djv*C{Z|`mdau^P8_z}#X h?B8GEpdi4(BFDx$je&7RrDQEg&ePS;Wt~$(69Dh@6T1Ka literal 0 HcmV?d00001 diff --git a/doc/api/html/ftv2cl.png b/doc/api/html/ftv2cl.png new file mode 100644 index 0000000000000000000000000000000000000000..132f6577bf7f085344904602815a260d29f55d9b GIT binary patch literal 453 zcmV;$0XqJPP)VBF;ev;toEj8_OB0EQg5eYilIj#JZG_m^33l3^k4mtzx!TVD?g)Y$ zrvwRDSqT!wLIM$dWCIa$vtxE|mzbTzu-y&$FvF6WA2a{Wr1g}`WdPT-0JzEZ0IxAv z-Z+ejZc&H;I5-pb_SUB}04j0^V)3t{`z<7asDl2Tw3w3sP%)0^8$bhEg)IOTBcRXv zFfq~3&gvJ$F-U7mpBW8z1GY~HK&7h4^YI~Orv~wLnC0PP_dAkv;nzX{9Q|8Gv=2ca z@v)c9T;D#h`TZ2X&&$ff2wedmot995de~-s3I)yauahg;7qn*?1n?F$e+PwP37}~; z1NKUk7reVK^7A;$QRW7qAx40HHUZ<|k3U%nz(Ec`#i+q9K!dgcROAlCS?`L= v>#=f?wF5ZND!1uAfQsk;KN^4&*8~0npJiJ%2dj9(00000NkvXXu0mjfWVFf_ literal 0 HcmV?d00001 diff --git a/doc/api/html/ftv2doc.png b/doc/api/html/ftv2doc.png new file mode 100644 index 0000000000000000000000000000000000000000..17edabff95f7b8da13c9516a04efe05493c29501 GIT binary patch literal 746 zcmV7=@pnbNXRFEm&G8P!&WHG=d)>K?YZ1bzou)2{$)) zumDct!>4SyxL;zgaG>wy`^Hv*+}0kUfCrz~BCOViSb$_*&;{TGGn2^x9K*!Sf0=lV zpP=7O;GA0*Jm*tTYj$IoXvimpnV4S1Z5f$p*f$Db2iq2zrVGQUz~yq`ahn7ck(|CE z7Gz;%OP~J6)tEZWDzjhL9h2hdfoU2)Nd%T<5Kt;Y0XLt&<@6pQx!nw*5`@bq#?l*?3z{Hlzoc=Pr>oB5(9i6~_&-}A(4{Q$>c>%rV&E|a(r&;?i5cQB=} zYSDU5nXG)NS4HEs0it2AHe2>shCyr7`6@4*6{r@8fXRbTA?=IFVWAQJL&H5H{)DpM#{W(GL+Idzf^)uRV@oB8u$ z8v{MfJbTiiRg4bza<41NAzrl{=3fl_D+$t+^!xlQ8S}{UtY`e z;;&9UhyZqQRN%2pot{*Ei0*4~hSF_3AH2@fKU!$NSflS>{@tZpDT4`M2WRTTVH+D? z)GFlEGGHe?koB}i|1w45!BF}N_q&^HJ&-tyR{(afC6H7|aml|tBBbv}55C5DNP8p3 z)~jLEO4Z&2hZmP^i-e%(@d!(E|KRafiU8Q5u(wU((j8un3OR*Hvj+t literal 0 HcmV?d00001 diff --git a/doc/api/html/ftv2folderclosed.png b/doc/api/html/ftv2folderclosed.png new file mode 100644 index 0000000000000000000000000000000000000000..bb8ab35edce8e97554e360005ee9fc5bffb36e66 GIT binary patch literal 616 zcmV-u0+;=XP)a9#ETzayK)T~Jw&MMH>OIr#&;dC}is*2Mqdf&akCc=O@`qC+4i z5Iu3w#1M@KqXCz8TIZd1wli&kkl2HVcAiZ8PUn5z_kG@-y;?yK06=cA0U%H0PH+kU zl6dp}OR(|r8-RG+YLu`zbI}5TlOU6ToR41{9=uz^?dGTNL;wIMf|V3`d1Wj3y!#6` zBLZ?xpKR~^2x}?~zA(_NUu3IaDB$tKma*XUdOZN~c=dLt_h_k!dbxm_*ibDM zlFX`g{k$X}yIe%$N)cn1LNu=q9_CS)*>A zsX_mM4L@`(cSNQKMFc$RtYbx{79#j-J7hk*>*+ZZhM4Hw?I?rsXCi#mRWJ=-0LGV5a-WR0Qgt<|Nqf)C-@80`5gIz45^_20000IqP)X=#(TiCT&PiIIVc55T}TU}EUh*{q$|`3@{d>{Tc9Bo>e= zfmF3!f>fbI9#GoEHh0f`i5)wkLpva0ztf%HpZneK?w-7AK@b4Itw{y|Zd3k!fH?q2 zlhckHd_V2M_X7+)U&_Xcfvtw60l;--DgZmLSw-Y?S>)zIqMyJ1#FwLU*%bl38ok+! zh78H87n`ZTS;uhzAR$M`zZ`bVhq=+%u9^$5jDplgxd44}9;IRqUH1YHH|@6oFe%z( zo4)_>E$F&^P-f(#)>(TrnbE>Pefs9~@iN=|)Rz|V`sGfHNrJ)0gJb8xx+SBmRf@1l zvuzt=vGfI)<-F9!o&3l?>9~0QbUDT(wFdnQPv%xdD)m*g%!20>Bc9iYmGAp<9YAa( z0QgYgTWqf1qN++Gqp z8@AYPTB3E|6s=WLG?xw0tm|U!o=&zd+H0oRYE;Dbx+Na9s^STqX|Gnq%H8s(nGDGJ j8vwW|`Ts`)fSK|Kx=IK@RG@g200000NkvXXu0mjfauFEA literal 0 HcmV?d00001 diff --git a/doc/api/html/ftv2lastnode.png b/doc/api/html/ftv2lastnode.png new file mode 100644 index 0000000000000000000000000000000000000000..63c605bb4c3d941c921a4b6cfa74951e946bcb48 GIT binary patch literal 86 zcmeAS@N?(olHy`uVBq!ia0vp^0zfRr!3HExu9B$%QnH>djv*C{Z|`mdau^P8_z}#X h?B8GEpdi4(BFDx$je&7RrDQEg&ePS;Wt~$(69Dh@6T1Ka literal 0 HcmV?d00001 diff --git a/doc/api/html/ftv2link.png b/doc/api/html/ftv2link.png new file mode 100644 index 0000000000000000000000000000000000000000..17edabff95f7b8da13c9516a04efe05493c29501 GIT binary patch literal 746 zcmV7=@pnbNXRFEm&G8P!&WHG=d)>K?YZ1bzou)2{$)) zumDct!>4SyxL;zgaG>wy`^Hv*+}0kUfCrz~BCOViSb$_*&;{TGGn2^x9K*!Sf0=lV zpP=7O;GA0*Jm*tTYj$IoXvimpnV4S1Z5f$p*f$Db2iq2zrVGQUz~yq`ahn7ck(|CE z7Gz;%OP~J6)tEZWDzjhL9h2hdfoU2)Nd%T<5Kt;Y0XLt&<@6pQx!nw*5`@bq#?l*?3z{Hlzoc=Pr>oB5(9i6~_&-}A(4{Q$>c>%rV&E|a(r&;?i5cQB=} zYSDU5nXG)NS4HEs0it2AHe2>shCyr7`6@4*6{r@8fXRbTA?=IFVWAQJL&H5H{)DpM#{W(GL+Idzf^)uRV@oB8u$ z8v{MfJbTiiRg4bza<41NAzrl{=3fl_D+$t+^!xlQ8S}{UtY`e z;;&9UhyZqQRN%2pot{*Ei0*4~hSF_3AH2@fKU!$NSflS>{@tZpDT4`M2WRTTVH+D? z)GFlEGGHe?koB}i|1w45!BF}N_q&^HJ&-tyR{(afC6H7|aml|tBBbv}55C5DNP8p3 z)~jLEO4Z&2hZmP^i-e%(@d!(E|KRafiU8Q5u(wU((j8un3OR*Hvj+t literal 0 HcmV?d00001 diff --git a/doc/api/html/ftv2mlastnode.png b/doc/api/html/ftv2mlastnode.png new file mode 100644 index 0000000000000000000000000000000000000000..0b63f6d38c4b9ec907b820192ebe9724ed6eca22 GIT binary patch literal 246 zcmVkw!R34#Lv2LOS^S2tZA31X++9RY}n zChwn@Z)Wz*WWHH{)HDtJnq&A2hk$b-y(>?@z0iHr41EKCGp#T5?07*qoM6N<$f(V3Pvj6}9 literal 0 HcmV?d00001 diff --git a/doc/api/html/ftv2mnode.png b/doc/api/html/ftv2mnode.png new file mode 100644 index 0000000000000000000000000000000000000000..0b63f6d38c4b9ec907b820192ebe9724ed6eca22 GIT binary patch literal 246 zcmVkw!R34#Lv2LOS^S2tZA31X++9RY}n zChwn@Z)Wz*WWHH{)HDtJnq&A2hk$b-y(>?@z0iHr41EKCGp#T5?07*qoM6N<$f(V3Pvj6}9 literal 0 HcmV?d00001 diff --git a/doc/api/html/ftv2mo.png b/doc/api/html/ftv2mo.png new file mode 100644 index 0000000000000000000000000000000000000000..4bfb80f76e65815989a9350ad79d8ce45380e2b1 GIT binary patch literal 403 zcmV;E0c`$>P)${!fXv7NWJ%@%u4(KapRY>T6_x;E zxE7kt!}Tiw8@d9Sd`rTGum>z#Q14vIm`wm1#-byD1muMi02@YNO5LRF0o!Y{`a!Ya z{^&p0Su|s705&2QxmqdexG+-zNKL3f@8gTQSJrKByfo+oNJ^-{|Mn||Q5SDwjQVsS zr1}7o5-QMs>gYIMD>GRw@$lT`z4r-_m{5U#cR{urD_)TOeY)(UD|qZ^&y`IVijqk~ xs(9-kWFr7E^!lgi8GsFK5kOY_{Xbgf0^etEU%fLevs?fG002ovPDHLkV1nB&vX1}& literal 0 HcmV?d00001 diff --git a/doc/api/html/ftv2node.png b/doc/api/html/ftv2node.png new file mode 100644 index 0000000000000000000000000000000000000000..63c605bb4c3d941c921a4b6cfa74951e946bcb48 GIT binary patch literal 86 zcmeAS@N?(olHy`uVBq!ia0vp^0zfRr!3HExu9B$%QnH>djv*C{Z|`mdau^P8_z}#X h?B8GEpdi4(BFDx$je&7RrDQEg&ePS;Wt~$(69Dh@6T1Ka literal 0 HcmV?d00001 diff --git a/doc/api/html/ftv2ns.png b/doc/api/html/ftv2ns.png new file mode 100644 index 0000000000000000000000000000000000000000..72e3d71c2892d6f00e259facebc88b45f6db2e35 GIT binary patch literal 388 zcmV-~0ek+5P)f+++#cT|!CkD&4pnIkeMEUEM*>`*9>+Juji$!h-mW%M^8s9957{3nvbrz^&=u<~TAUrFROkmt%^F~Ez+-c53Lv%iH3d38!Rv?K zrb&MYAhp;Gf<}wS;9ZZq2@;!uYG;=Z>~GKE^{HD4keu}lnyqhc>kWX^tQn|warJ~h zT+rtMkdz6aHoN%z(o|&wpu@@OpJnF_z{PA)6(FHw02iHslz^(N{4*+K9)QJHR87wT iTyp>aXaF{u2lxRou|^4tux6eB0000^P)R?RzRoKvklcaQ%HF6%rK2&ZgO(-ihJ_C zzrKgp4jgO( fd_(yg|3PpEQb#9`a?Pz_00000NkvXXu0mjftR`5K literal 0 HcmV?d00001 diff --git a/doc/api/html/ftv2pnode.png b/doc/api/html/ftv2pnode.png new file mode 100644 index 0000000000000000000000000000000000000000..c6ee22f937a07d1dbfc27c669d11f8ed13e2f152 GIT binary patch literal 229 zcmV^P)R?RzRoKvklcaQ%HF6%rK2&ZgO(-ihJ_C zzrKgp4jgO( fd_(yg|3PpEQb#9`a?Pz_00000NkvXXu0mjftR`5K literal 0 HcmV?d00001 diff --git a/doc/api/html/ftv2splitbar.png b/doc/api/html/ftv2splitbar.png new file mode 100644 index 0000000000000000000000000000000000000000..fe895f2c58179b471a22d8320b39a4bd7312ec8e GIT binary patch literal 314 zcmeAS@N?(olHy`uVBq!ia0vp^Yzz!63>-{AmhX=Jf(#6djGiuzAr*{o?=JLmPLyc> z_*`QK&+BH@jWrYJ7>r6%keRM@)Qyv8R=enp0jiI>aWlGyB58O zFVR20d+y`K7vDw(hJF3;>dD*3-?v=<8M)@x|EEGLnJsniYK!2U1 Y!`|5biEc?d1`HDhPgg&ebxsLQ02F6;9RL6T literal 0 HcmV?d00001 diff --git a/doc/api/html/ftv2vertline.png b/doc/api/html/ftv2vertline.png new file mode 100644 index 0000000000000000000000000000000000000000..63c605bb4c3d941c921a4b6cfa74951e946bcb48 GIT binary patch literal 86 zcmeAS@N?(olHy`uVBq!ia0vp^0zfRr!3HExu9B$%QnH>djv*C{Z|`mdau^P8_z}#X h?B8GEpdi4(BFDx$je&7RrDQEg&ePS;Wt~$(69Dh@6T1Ka literal 0 HcmV?d00001 diff --git a/doc/api/html/functions.html b/doc/api/html/functions.html new file mode 100644 index 00000000000..7954515d023 --- /dev/null +++ b/doc/api/html/functions.html @@ -0,0 +1,392 @@ + + + + + +Stan: Class Members + + + + + + + + + +

+ + + + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- _ -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_0x61.html b/doc/api/html/functions_0x61.html new file mode 100644 index 00000000000..21e13ba129f --- /dev/null +++ b/doc/api/html/functions_0x61.html @@ -0,0 +1,472 @@ + + + + + +Stan: Class Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- a -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_0x62.html b/doc/api/html/functions_0x62.html new file mode 100644 index 00000000000..e13f92d1776 --- /dev/null +++ b/doc/api/html/functions_0x62.html @@ -0,0 +1,224 @@ + + + + + +Stan: Class Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- b -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_0x63.html b/doc/api/html/functions_0x63.html new file mode 100644 index 00000000000..390ccd6cb71 --- /dev/null +++ b/doc/api/html/functions_0x63.html @@ -0,0 +1,338 @@ + + + + + +Stan: Class Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- c -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_0x64.html b/doc/api/html/functions_0x64.html new file mode 100644 index 00000000000..78d9ffea3bc --- /dev/null +++ b/doc/api/html/functions_0x64.html @@ -0,0 +1,353 @@ + + + + + +Stan: Class Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- d -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_0x65.html b/doc/api/html/functions_0x65.html new file mode 100644 index 00000000000..d71e51b08a8 --- /dev/null +++ b/doc/api/html/functions_0x65.html @@ -0,0 +1,233 @@ + + + + + +Stan: Class Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- e -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_0x66.html b/doc/api/html/functions_0x66.html new file mode 100644 index 00000000000..534a224ecf8 --- /dev/null +++ b/doc/api/html/functions_0x66.html @@ -0,0 +1,185 @@ + + + + + +Stan: Class Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- f -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_0x67.html b/doc/api/html/functions_0x67.html new file mode 100644 index 00000000000..5d96db23e01 --- /dev/null +++ b/doc/api/html/functions_0x67.html @@ -0,0 +1,344 @@ + + + + + +Stan: Class Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- g -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_0x68.html b/doc/api/html/functions_0x68.html new file mode 100644 index 00000000000..a45e0a69263 --- /dev/null +++ b/doc/api/html/functions_0x68.html @@ -0,0 +1,204 @@ + + + + + +Stan: Class Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ + +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_0x69.html b/doc/api/html/functions_0x69.html new file mode 100644 index 00000000000..d77d3d22ed6 --- /dev/null +++ b/doc/api/html/functions_0x69.html @@ -0,0 +1,362 @@ + + + + + +Stan: Class Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- i -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_0x6b.html b/doc/api/html/functions_0x6b.html new file mode 100644 index 00000000000..1e141ca3a5c --- /dev/null +++ b/doc/api/html/functions_0x6b.html @@ -0,0 +1,156 @@ + + + + + +Stan: Class Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- k -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_0x6c.html b/doc/api/html/functions_0x6c.html new file mode 100644 index 00000000000..f54e26f8b45 --- /dev/null +++ b/doc/api/html/functions_0x6c.html @@ -0,0 +1,208 @@ + + + + + +Stan: Class Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- l -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_0x6d.html b/doc/api/html/functions_0x6d.html new file mode 100644 index 00000000000..f8d0c4b44db --- /dev/null +++ b/doc/api/html/functions_0x6d.html @@ -0,0 +1,275 @@ + + + + + +Stan: Class Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- m -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_0x6e.html b/doc/api/html/functions_0x6e.html new file mode 100644 index 00000000000..73a71da6392 --- /dev/null +++ b/doc/api/html/functions_0x6e.html @@ -0,0 +1,256 @@ + + + + + +Stan: Class Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- n -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_0x6f.html b/doc/api/html/functions_0x6f.html new file mode 100644 index 00000000000..798e353571b --- /dev/null +++ b/doc/api/html/functions_0x6f.html @@ -0,0 +1,494 @@ + + + + + +Stan: Class Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- o -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_0x70.html b/doc/api/html/functions_0x70.html new file mode 100644 index 00000000000..37e4f511aca --- /dev/null +++ b/doc/api/html/functions_0x70.html @@ -0,0 +1,348 @@ + + + + + +Stan: Class Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- p -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_0x71.html b/doc/api/html/functions_0x71.html new file mode 100644 index 00000000000..d4d02be6e07 --- /dev/null +++ b/doc/api/html/functions_0x71.html @@ -0,0 +1,158 @@ + + + + + +Stan: Class Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- q -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_0x72.html b/doc/api/html/functions_0x72.html new file mode 100644 index 00000000000..59839a55b9a --- /dev/null +++ b/doc/api/html/functions_0x72.html @@ -0,0 +1,305 @@ + + + + + +Stan: Class Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- r -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_0x73.html b/doc/api/html/functions_0x73.html new file mode 100644 index 00000000000..fc232260ec1 --- /dev/null +++ b/doc/api/html/functions_0x73.html @@ -0,0 +1,488 @@ + + + + + +Stan: Class Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- s -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_0x74.html b/doc/api/html/functions_0x74.html new file mode 100644 index 00000000000..8df4d8a3c47 --- /dev/null +++ b/doc/api/html/functions_0x74.html @@ -0,0 +1,280 @@ + + + + + +Stan: Class Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- t -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_0x75.html b/doc/api/html/functions_0x75.html new file mode 100644 index 00000000000..607612905cc --- /dev/null +++ b/doc/api/html/functions_0x75.html @@ -0,0 +1,191 @@ + + + + + +Stan: Class Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- u -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_0x76.html b/doc/api/html/functions_0x76.html new file mode 100644 index 00000000000..8e79f73d32a --- /dev/null +++ b/doc/api/html/functions_0x76.html @@ -0,0 +1,360 @@ + + + + + +Stan: Class Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- v -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_0x77.html b/doc/api/html/functions_0x77.html new file mode 100644 index 00000000000..9753e8d1801 --- /dev/null +++ b/doc/api/html/functions_0x77.html @@ -0,0 +1,227 @@ + + + + + +Stan: Class Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- w -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_0x78.html b/doc/api/html/functions_0x78.html new file mode 100644 index 00000000000..ef159dcc432 --- /dev/null +++ b/doc/api/html/functions_0x78.html @@ -0,0 +1,148 @@ + + + + + +Stan: Class Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- x -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_0x7a.html b/doc/api/html/functions_0x7a.html new file mode 100644 index 00000000000..78087941ca9 --- /dev/null +++ b/doc/api/html/functions_0x7a.html @@ -0,0 +1,148 @@ + + + + + +Stan: Class Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- z -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_0x7e.html b/doc/api/html/functions_0x7e.html new file mode 100644 index 00000000000..7856359b4d5 --- /dev/null +++ b/doc/api/html/functions_0x7e.html @@ -0,0 +1,232 @@ + + + + + +Stan: Class Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- ~ -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_2dist_8hpp.html b/doc/api/html/functions_2dist_8hpp.html new file mode 100644 index 00000000000..80fcd6a0fe1 --- /dev/null +++ b/doc/api/html/functions_2dist_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/functions/dist.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
dist.hpp File Reference
+
+
+
#include <vector>
+#include <cstddef>
+#include <cmath>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + +

+Functions

double stan::math::dist (const std::vector< double > &x, const std::vector< double > &y)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_2dist_8hpp_source.html b/doc/api/html/functions_2dist_8hpp_source.html new file mode 100644 index 00000000000..e126365bcc0 --- /dev/null +++ b/doc/api/html/functions_2dist_8hpp_source.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/math/functions/dist.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
dist.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__DIST_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__DIST_HPP__
+
3 
+
4 #include <vector>
+
5 #include <cstddef>
+
6 #include <cmath>
+
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
11  inline double dist(const std::vector<double>& x, const std::vector<double>& y) {
+
12  using std::sqrt;
+
13  double result = 0;
+
14  for (size_t i = 0; i < x.size(); ++i) {
+
15  double diff = x[i] - y[i];
+
16  result += diff * diff;
+
17  }
+
18  return sqrt(result);
+
19  }
+
20 
+
21  }
+
22 }
+
23 
+
24 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_2max_8hpp.html b/doc/api/html/functions_2max_8hpp.html new file mode 100644 index 00000000000..6e62725accc --- /dev/null +++ b/doc/api/html/functions_2max_8hpp.html @@ -0,0 +1,127 @@ + + + + + +Stan: src/stan/math/functions/max.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
max.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + +

+Functions

double stan::math::max (const double a, const double b)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_2max_8hpp_source.html b/doc/api/html/functions_2max_8hpp_source.html new file mode 100644 index 00000000000..23607515bfe --- /dev/null +++ b/doc/api/html/functions_2max_8hpp_source.html @@ -0,0 +1,121 @@ + + + + + +Stan: src/stan/math/functions/max.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
max.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__MAX_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__MAX_HPP__
+
3 
+
4 namespace stan {
+
5  namespace math {
+
6 
+
7  inline double max(const double a, const double b) {
+
8  return a > b ? a : b;
+
9  }
+
10 
+
11  }
+
12 }
+
13 
+
14 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_2min_8hpp.html b/doc/api/html/functions_2min_8hpp.html new file mode 100644 index 00000000000..477981399ba --- /dev/null +++ b/doc/api/html/functions_2min_8hpp.html @@ -0,0 +1,127 @@ + + + + + +Stan: src/stan/math/functions/min.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
min.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + +

+Functions

double stan::math::min (const double a, const double b)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_2min_8hpp_source.html b/doc/api/html/functions_2min_8hpp_source.html new file mode 100644 index 00000000000..59a5932616e --- /dev/null +++ b/doc/api/html/functions_2min_8hpp_source.html @@ -0,0 +1,121 @@ + + + + + +Stan: src/stan/math/functions/min.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
min.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__MIN_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__MIN_HPP__
+
3 
+
4 namespace stan {
+
5  namespace math {
+
6 
+
7  inline double min(const double a, const double b) {
+
8  return a < b ? a : b;
+
9  }
+
10 
+
11  }
+
12 }
+
13 
+
14 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_eval.html b/doc/api/html/functions_eval.html new file mode 100644 index 00000000000..02a266c3617 --- /dev/null +++ b/doc/api/html/functions_eval.html @@ -0,0 +1,249 @@ + + + + + +Stan: Class Members - Enumerator + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- a -

+ + +

- c -

+ + +

- d -

+ + +

- h -

+ + +

- i -

+ + +

- l -

+ + +

- m -

+ + +

- n -

+ + +

- o -

+ + +

- r -

+ + +

- s -

+ + +

- u -

+ + +

- v -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_func.html b/doc/api/html/functions_func.html new file mode 100644 index 00000000000..48a321b3268 --- /dev/null +++ b/doc/api/html/functions_func.html @@ -0,0 +1,156 @@ + + + + + +Stan: Class Members - Functions + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- _ -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_func_0x61.html b/doc/api/html/functions_func_0x61.html new file mode 100644 index 00000000000..6b6ea1f368f --- /dev/null +++ b/doc/api/html/functions_func_0x61.html @@ -0,0 +1,421 @@ + + + + + +Stan: Class Members - Functions + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- a -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_func_0x62.html b/doc/api/html/functions_func_0x62.html new file mode 100644 index 00000000000..8fd90acffba --- /dev/null +++ b/doc/api/html/functions_func_0x62.html @@ -0,0 +1,199 @@ + + + + + +Stan: Class Members - Functions + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ + +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_func_0x63.html b/doc/api/html/functions_func_0x63.html new file mode 100644 index 00000000000..27c5c6e5867 --- /dev/null +++ b/doc/api/html/functions_func_0x63.html @@ -0,0 +1,290 @@ + + + + + +Stan: Class Members - Functions + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- c -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_func_0x64.html b/doc/api/html/functions_func_0x64.html new file mode 100644 index 00000000000..84b65462e06 --- /dev/null +++ b/doc/api/html/functions_func_0x64.html @@ -0,0 +1,264 @@ + + + + + +Stan: Class Members - Functions + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- d -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_func_0x65.html b/doc/api/html/functions_func_0x65.html new file mode 100644 index 00000000000..81666761776 --- /dev/null +++ b/doc/api/html/functions_func_0x65.html @@ -0,0 +1,187 @@ + + + + + +Stan: Class Members - Functions + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ + +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_func_0x66.html b/doc/api/html/functions_func_0x66.html new file mode 100644 index 00000000000..dc0a6b267b8 --- /dev/null +++ b/doc/api/html/functions_func_0x66.html @@ -0,0 +1,172 @@ + + + + + +Stan: Class Members - Functions + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ + +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_func_0x67.html b/doc/api/html/functions_func_0x67.html new file mode 100644 index 00000000000..767c3d1f85d --- /dev/null +++ b/doc/api/html/functions_func_0x67.html @@ -0,0 +1,334 @@ + + + + + +Stan: Class Members - Functions + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- g -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_func_0x68.html b/doc/api/html/functions_func_0x68.html new file mode 100644 index 00000000000..364202a4361 --- /dev/null +++ b/doc/api/html/functions_func_0x68.html @@ -0,0 +1,165 @@ + + + + + +Stan: Class Members - Functions + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- h -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_func_0x69.html b/doc/api/html/functions_func_0x69.html new file mode 100644 index 00000000000..989f90d2953 --- /dev/null +++ b/doc/api/html/functions_func_0x69.html @@ -0,0 +1,277 @@ + + + + + +Stan: Class Members - Functions + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- i -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_func_0x6b.html b/doc/api/html/functions_func_0x6b.html new file mode 100644 index 00000000000..e418d3fad70 --- /dev/null +++ b/doc/api/html/functions_func_0x6b.html @@ -0,0 +1,147 @@ + + + + + +Stan: Class Members - Functions + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- k -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_func_0x6c.html b/doc/api/html/functions_func_0x6c.html new file mode 100644 index 00000000000..d2f104ecf2e --- /dev/null +++ b/doc/api/html/functions_func_0x6c.html @@ -0,0 +1,176 @@ + + + + + +Stan: Class Members - Functions + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ + +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_func_0x6d.html b/doc/api/html/functions_func_0x6d.html new file mode 100644 index 00000000000..3d270a565b9 --- /dev/null +++ b/doc/api/html/functions_func_0x6d.html @@ -0,0 +1,206 @@ + + + + + +Stan: Class Members - Functions + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- m -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_func_0x6e.html b/doc/api/html/functions_func_0x6e.html new file mode 100644 index 00000000000..9a817ee3080 --- /dev/null +++ b/doc/api/html/functions_func_0x6e.html @@ -0,0 +1,209 @@ + + + + + +Stan: Class Members - Functions + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ + +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_func_0x6f.html b/doc/api/html/functions_func_0x6f.html new file mode 100644 index 00000000000..22486dc3890 --- /dev/null +++ b/doc/api/html/functions_func_0x6f.html @@ -0,0 +1,462 @@ + + + + + +Stan: Class Members - Functions + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- o -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_func_0x70.html b/doc/api/html/functions_func_0x70.html new file mode 100644 index 00000000000..3d0a2d8df33 --- /dev/null +++ b/doc/api/html/functions_func_0x70.html @@ -0,0 +1,308 @@ + + + + + +Stan: Class Members - Functions + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- p -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_func_0x71.html b/doc/api/html/functions_func_0x71.html new file mode 100644 index 00000000000..22766b6aaf4 --- /dev/null +++ b/doc/api/html/functions_func_0x71.html @@ -0,0 +1,154 @@ + + + + + +Stan: Class Members - Functions + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ + +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_func_0x72.html b/doc/api/html/functions_func_0x72.html new file mode 100644 index 00000000000..38fbfb30b45 --- /dev/null +++ b/doc/api/html/functions_func_0x72.html @@ -0,0 +1,233 @@ + + + + + +Stan: Class Members - Functions + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- r -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_func_0x73.html b/doc/api/html/functions_func_0x73.html new file mode 100644 index 00000000000..b1fb41d59d2 --- /dev/null +++ b/doc/api/html/functions_func_0x73.html @@ -0,0 +1,402 @@ + + + + + +Stan: Class Members - Functions + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- s -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_func_0x74.html b/doc/api/html/functions_func_0x74.html new file mode 100644 index 00000000000..cd4e0ed26fa --- /dev/null +++ b/doc/api/html/functions_func_0x74.html @@ -0,0 +1,182 @@ + + + + + +Stan: Class Members - Functions + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ + +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_func_0x75.html b/doc/api/html/functions_func_0x75.html new file mode 100644 index 00000000000..cd7ad51f310 --- /dev/null +++ b/doc/api/html/functions_func_0x75.html @@ -0,0 +1,184 @@ + + + + + +Stan: Class Members - Functions + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- u -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_func_0x76.html b/doc/api/html/functions_func_0x76.html new file mode 100644 index 00000000000..87004b1e17b --- /dev/null +++ b/doc/api/html/functions_func_0x76.html @@ -0,0 +1,264 @@ + + + + + +Stan: Class Members - Functions + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- v -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_func_0x77.html b/doc/api/html/functions_func_0x77.html new file mode 100644 index 00000000000..14a9b72852e --- /dev/null +++ b/doc/api/html/functions_func_0x77.html @@ -0,0 +1,219 @@ + + + + + +Stan: Class Members - Functions + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- w -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_func_0x7a.html b/doc/api/html/functions_func_0x7a.html new file mode 100644 index 00000000000..1ee1e3c8db6 --- /dev/null +++ b/doc/api/html/functions_func_0x7a.html @@ -0,0 +1,147 @@ + + + + + +Stan: Class Members - Functions + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ + +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_func_0x7e.html b/doc/api/html/functions_func_0x7e.html new file mode 100644 index 00000000000..b984eab6a42 --- /dev/null +++ b/doc/api/html/functions_func_0x7e.html @@ -0,0 +1,231 @@ + + + + + +Stan: Class Members - Functions + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- ~ -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_rela.html b/doc/api/html/functions_rela.html new file mode 100644 index 00000000000..6f69c7d049e --- /dev/null +++ b/doc/api/html/functions_rela.html @@ -0,0 +1,120 @@ + + + + + +Stan: Class Members - Related Functions + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + +
+ + + + +
+ +
+ +
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_type.html b/doc/api/html/functions_type.html new file mode 100644 index 00000000000..39ddf196231 --- /dev/null +++ b/doc/api/html/functions_type.html @@ -0,0 +1,317 @@ + + + + + +Stan: Class Members - Typedefs + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- a -

+ + +

- e -

+ + +

- h -

+ + +

- i -

+ + +

- l -

+ + +

- m -

+ + +

- n -

+ + +

- p -

+ + +

- r -

+ + +

- s -

+ + +

- t -

+ + +

- v -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_vars.html b/doc/api/html/functions_vars.html new file mode 100644 index 00000000000..bb5de1ff1af --- /dev/null +++ b/doc/api/html/functions_vars.html @@ -0,0 +1,378 @@ + + + + + +Stan: Class Members - Variables + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- _ -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_vars_0x61.html b/doc/api/html/functions_vars_0x61.html new file mode 100644 index 00000000000..8ab8a42a168 --- /dev/null +++ b/doc/api/html/functions_vars_0x61.html @@ -0,0 +1,193 @@ + + + + + +Stan: Class Members - Variables + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ + +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_vars_0x62.html b/doc/api/html/functions_vars_0x62.html new file mode 100644 index 00000000000..d84d1c4a601 --- /dev/null +++ b/doc/api/html/functions_vars_0x62.html @@ -0,0 +1,167 @@ + + + + + +Stan: Class Members - Variables + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ + +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_vars_0x63.html b/doc/api/html/functions_vars_0x63.html new file mode 100644 index 00000000000..237f8c33135 --- /dev/null +++ b/doc/api/html/functions_vars_0x63.html @@ -0,0 +1,187 @@ + + + + + +Stan: Class Members - Variables + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ + +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_vars_0x64.html b/doc/api/html/functions_vars_0x64.html new file mode 100644 index 00000000000..5194a945a4b --- /dev/null +++ b/doc/api/html/functions_vars_0x64.html @@ -0,0 +1,230 @@ + + + + + +Stan: Class Members - Variables + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- d -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_vars_0x65.html b/doc/api/html/functions_vars_0x65.html new file mode 100644 index 00000000000..34fa1cf9bbf --- /dev/null +++ b/doc/api/html/functions_vars_0x65.html @@ -0,0 +1,185 @@ + + + + + +Stan: Class Members - Variables + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ + +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_vars_0x66.html b/doc/api/html/functions_vars_0x66.html new file mode 100644 index 00000000000..eae5880e089 --- /dev/null +++ b/doc/api/html/functions_vars_0x66.html @@ -0,0 +1,155 @@ + + + + + +Stan: Class Members - Variables + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ + +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_vars_0x67.html b/doc/api/html/functions_vars_0x67.html new file mode 100644 index 00000000000..411e3f05fba --- /dev/null +++ b/doc/api/html/functions_vars_0x67.html @@ -0,0 +1,152 @@ + + + + + +Stan: Class Members - Variables + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- g -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_vars_0x68.html b/doc/api/html/functions_vars_0x68.html new file mode 100644 index 00000000000..97e82676fa6 --- /dev/null +++ b/doc/api/html/functions_vars_0x68.html @@ -0,0 +1,175 @@ + + + + + +Stan: Class Members - Variables + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ + +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_vars_0x69.html b/doc/api/html/functions_vars_0x69.html new file mode 100644 index 00000000000..adf6da796f5 --- /dev/null +++ b/doc/api/html/functions_vars_0x69.html @@ -0,0 +1,217 @@ + + + + + +Stan: Class Members - Variables + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- i -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_vars_0x6b.html b/doc/api/html/functions_vars_0x6b.html new file mode 100644 index 00000000000..850897c6c57 --- /dev/null +++ b/doc/api/html/functions_vars_0x6b.html @@ -0,0 +1,151 @@ + + + + + +Stan: Class Members - Variables + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ + +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_vars_0x6c.html b/doc/api/html/functions_vars_0x6c.html new file mode 100644 index 00000000000..b996c18c072 --- /dev/null +++ b/doc/api/html/functions_vars_0x6c.html @@ -0,0 +1,164 @@ + + + + + +Stan: Class Members - Variables + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ + +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_vars_0x6d.html b/doc/api/html/functions_vars_0x6d.html new file mode 100644 index 00000000000..9007af3f348 --- /dev/null +++ b/doc/api/html/functions_vars_0x6d.html @@ -0,0 +1,195 @@ + + + + + +Stan: Class Members - Variables + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ + +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_vars_0x6e.html b/doc/api/html/functions_vars_0x6e.html new file mode 100644 index 00000000000..d431ff2fe4a --- /dev/null +++ b/doc/api/html/functions_vars_0x6e.html @@ -0,0 +1,182 @@ + + + + + +Stan: Class Members - Variables + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ + +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_vars_0x6f.html b/doc/api/html/functions_vars_0x6f.html new file mode 100644 index 00000000000..76467105cd8 --- /dev/null +++ b/doc/api/html/functions_vars_0x6f.html @@ -0,0 +1,157 @@ + + + + + +Stan: Class Members - Variables + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ + +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_vars_0x70.html b/doc/api/html/functions_vars_0x70.html new file mode 100644 index 00000000000..fed678f9a20 --- /dev/null +++ b/doc/api/html/functions_vars_0x70.html @@ -0,0 +1,179 @@ + + + + + +Stan: Class Members - Variables + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- p -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_vars_0x71.html b/doc/api/html/functions_vars_0x71.html new file mode 100644 index 00000000000..d192c383946 --- /dev/null +++ b/doc/api/html/functions_vars_0x71.html @@ -0,0 +1,146 @@ + + + + + +Stan: Class Members - Variables + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- q -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_vars_0x72.html b/doc/api/html/functions_vars_0x72.html new file mode 100644 index 00000000000..01c995cf5e4 --- /dev/null +++ b/doc/api/html/functions_vars_0x72.html @@ -0,0 +1,181 @@ + + + + + +Stan: Class Members - Variables + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ + +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_vars_0x73.html b/doc/api/html/functions_vars_0x73.html new file mode 100644 index 00000000000..6d81e071f83 --- /dev/null +++ b/doc/api/html/functions_vars_0x73.html @@ -0,0 +1,214 @@ + + + + + +Stan: Class Members - Variables + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ + +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_vars_0x74.html b/doc/api/html/functions_vars_0x74.html new file mode 100644 index 00000000000..056a3b3a153 --- /dev/null +++ b/doc/api/html/functions_vars_0x74.html @@ -0,0 +1,191 @@ + + + + + +Stan: Class Members - Variables + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ + +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_vars_0x75.html b/doc/api/html/functions_vars_0x75.html new file mode 100644 index 00000000000..47acfc2c542 --- /dev/null +++ b/doc/api/html/functions_vars_0x75.html @@ -0,0 +1,146 @@ + + + + + +Stan: Class Members - Variables + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- u -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_vars_0x76.html b/doc/api/html/functions_vars_0x76.html new file mode 100644 index 00000000000..1ae0672e5f5 --- /dev/null +++ b/doc/api/html/functions_vars_0x76.html @@ -0,0 +1,204 @@ + + + + + +Stan: Class Members - Variables + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ + +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_vars_0x77.html b/doc/api/html/functions_vars_0x77.html new file mode 100644 index 00000000000..32690bcf025 --- /dev/null +++ b/doc/api/html/functions_vars_0x77.html @@ -0,0 +1,152 @@ + + + + + +Stan: Class Members - Variables + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- w -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/functions_vars_0x78.html b/doc/api/html/functions_vars_0x78.html new file mode 100644 index 00000000000..eccc381bbb0 --- /dev/null +++ b/doc/api/html/functions_vars_0x78.html @@ -0,0 +1,146 @@ + + + + + +Stan: Class Members - Variables + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- x -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fvar_8hpp.html b/doc/api/html/fvar_8hpp.html new file mode 100644 index 00000000000..a3fbb6552f0 --- /dev/null +++ b/doc/api/html/fvar_8hpp.html @@ -0,0 +1,127 @@ + + + + + +Stan: src/stan/agrad/fwd/fvar.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
fvar.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

struct  stan::agrad::fvar< T >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fvar_8hpp_source.html b/doc/api/html/fvar_8hpp_source.html new file mode 100644 index 00000000000..09c42c0908a --- /dev/null +++ b/doc/api/html/fvar_8hpp_source.html @@ -0,0 +1,235 @@ + + + + + +Stan: src/stan/agrad/fwd/fvar.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
fvar.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FVAR__HPP__
+
2 #define __STAN__AGRAD__FWD__FVAR__HPP__
+
3 
+
4 namespace stan {
+
5 
+
6  namespace agrad {
+
7 
+
8  template <typename T>
+
9  struct fvar {
+
10 
+
11  T val_; // value
+
12  T d_; // tangent (aka derivative)
+
13 
+
14  T val() { return val_; }
+
15  T tangent() { return d_; }
+
16 
+
17  // TV and TD must be assignable to T
+
18  template <typename TV, typename TD>
+
19  fvar(const TV& val, const TD& deriv) : val_(val), d_(deriv) { }
+
20 
+
21  // TV must be assignable to T
+
22  template <typename TV>
+
23  fvar(const TV& val) : val_(val), d_(0.0) { }
+
24 
+
25  fvar() : val_(0.0), d_(0.0) { }
+
26 
+
27  template <typename T2>
+
28  inline
+
29  fvar<T>&
+
30  operator+=(const fvar<T2>& x2) {
+
31  val_ += x2.val_;
+
32  d_ += x2.d_;
+
33  return *this;
+
34  }
+
35 
+
36  template <typename T2>
+
37  inline
+
38  fvar<T>&
+
39  operator+=(const T2& x2) {
+
40  val_ += x2;
+
41  return *this;
+
42  }
+
43 
+
44  template <typename T2>
+
45  inline
+
46  fvar<T>&
+
47  operator-=(const fvar<T2>& x2) {
+
48  val_ -= x2.val_;
+
49  d_ -= x2.d_;
+
50  return *this;
+
51  }
+
52 
+
53  template <typename T2>
+
54  inline
+
55  fvar<T>&
+
56  operator-=(const T2& x2) {
+
57  val_ -= x2;
+
58  return *this;
+
59  }
+
60 
+
61  template <typename T2>
+
62  inline
+
63  fvar<T>&
+
64  operator*=(const fvar<T2>& x2) {
+
65  d_ = d_ * x2.val_ + val_ * x2.d_;
+
66  val_ *= x2.val_;
+
67  return *this;
+
68  }
+
69 
+
70  template <typename T2>
+
71  inline
+
72  fvar<T>&
+
73  operator*=(const T2& x2) {
+
74  val_ *= x2;
+
75  return *this;
+
76  }
+
77 
+
78  // SPEEDUP: specialize for T2 == var with d_ function
+
79 
+
80  template <typename T2>
+
81  inline
+
82  fvar<T>&
+
83  operator/=(const fvar<T2>& x2) {
+
84  d_ = (d_ * x2.val_ - val_ * x2.d_) / ( x2.val_ * x2.val_);
+
85  val_ /= x2.val_;
+
86  return *this;
+
87  }
+
88 
+
89  template <typename T2>
+
90  inline
+
91  fvar<T>&
+
92  operator/=(const T2& x2) {
+
93  val_ /= x2;
+
94  return *this;
+
95  }
+
96 
+
97  inline
+
98  fvar<T>&
+ +
100  ++val_;
+
101  return *this;
+
102  }
+
103 
+
104  inline
+
105  fvar<T>
+
106  operator++(int /*dummy*/) {
+
107  fvar<T> result(val_,d_);
+
108  ++val_;
+
109  return result;
+
110  }
+
111 
+
112  inline
+
113  fvar<T>&
+ +
115  --val_;
+
116  return *this;
+
117  }
+
118  inline
+
119  fvar<T>
+
120  operator--(int /*dummy*/) {
+
121  fvar<T> result(val_,d_);
+
122  --val_;
+
123  return result;
+
124  }
+
125  };
+
126  }
+
127 }
+
128 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2acos_8hpp.html b/doc/api/html/fwd_2functions_2acos_8hpp.html new file mode 100644 index 00000000000..66da2351d78 --- /dev/null +++ b/doc/api/html/fwd_2functions_2acos_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/acos.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
acos.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::acos (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2acos_8hpp_source.html b/doc/api/html/fwd_2functions_2acos_8hpp_source.html new file mode 100644 index 00000000000..c98215f682f --- /dev/null +++ b/doc/api/html/fwd_2functions_2acos_8hpp_source.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/acos.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
acos.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__ACOS_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__ACOS_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+
15  acos(const fvar<T>& x) {
+
16  using std::acos;
+
17  using std::sqrt;
+
18  using stan::math::square;
+
19 
+
20  return fvar<T>(acos(x.val_), x.d_ / -sqrt(1 - square(x.val_)));
+
21  }
+
22  }
+
23 }
+
24 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2acosh_8hpp.html b/doc/api/html/fwd_2functions_2acosh_8hpp.html new file mode 100644 index 00000000000..6b9829f414d --- /dev/null +++ b/doc/api/html/fwd_2functions_2acosh_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/acosh.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
acosh.hpp File Reference
+
+
+
#include <stan/agrad/fwd/fvar.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/math/constants.hpp>
+#include <boost/math/special_functions/acosh.hpp>
+#include <stan/math/functions/square.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::acosh (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2acosh_8hpp_source.html b/doc/api/html/fwd_2functions_2acosh_8hpp_source.html new file mode 100644 index 00000000000..f61f9925305 --- /dev/null +++ b/doc/api/html/fwd_2functions_2acosh_8hpp_source.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/acosh.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
acosh.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__ACOSH_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__ACOSH_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 #include <boost/math/special_functions/acosh.hpp>
+ +
9 
+
10 namespace stan {
+
11 
+
12  namespace agrad {
+
13 
+
14  template <typename T>
+
15  inline
+
16  fvar<T>
+
17  acosh(const fvar<T>& x) {
+
18  using boost::math::acosh;
+
19  using stan::math::square;
+
20  using std::sqrt;
+ +
22  if(x.val_ < 1)
+ +
24  else
+
25  return fvar<T>(acosh(x.val_),
+
26  x.d_ / sqrt(square(x.val_) - 1));
+
27  }
+
28  }
+
29 }
+
30 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2asin_8hpp.html b/doc/api/html/fwd_2functions_2asin_8hpp.html new file mode 100644 index 00000000000..cada89f2fe5 --- /dev/null +++ b/doc/api/html/fwd_2functions_2asin_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/asin.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
asin.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::asin (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2asin_8hpp_source.html b/doc/api/html/fwd_2functions_2asin_8hpp_source.html new file mode 100644 index 00000000000..a0044d12e1e --- /dev/null +++ b/doc/api/html/fwd_2functions_2asin_8hpp_source.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/asin.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
asin.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__ASIN_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__ASIN_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+
15  asin(const fvar<T>& x) {
+
16  using std::asin;
+
17  using std::sqrt;
+
18  using stan::math::square;
+
19  return fvar<T>(asin(x.val_), x.d_ / sqrt(1 - square(x.val_)));
+
20  }
+
21  }
+
22 }
+
23 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2asinh_8hpp.html b/doc/api/html/fwd_2functions_2asinh_8hpp.html new file mode 100644 index 00000000000..425b1835d6c --- /dev/null +++ b/doc/api/html/fwd_2functions_2asinh_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/asinh.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
asinh.hpp File Reference
+
+
+
#include <stan/agrad/fwd/fvar.hpp>
+#include <stan/meta/traits.hpp>
+#include <boost/math/special_functions/asinh.hpp>
+#include <stan/math/functions/square.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::asinh (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2asinh_8hpp_source.html b/doc/api/html/fwd_2functions_2asinh_8hpp_source.html new file mode 100644 index 00000000000..ff2744680d5 --- /dev/null +++ b/doc/api/html/fwd_2functions_2asinh_8hpp_source.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/asinh.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
asinh.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__ASINH_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__ASINH_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 #include <boost/math/special_functions/asinh.hpp>
+ +
8 
+
9 namespace stan {
+
10 
+
11  namespace agrad {
+
12 
+
13  template <typename T>
+
14  inline
+
15  fvar<T>
+
16  asinh(const fvar<T>& x) {
+
17  using boost::math::asinh;
+
18  using std::sqrt;
+
19  using stan::math::square;
+
20  return fvar<T>(asinh(x.val_), x.d_ / sqrt(square(x.val_) + 1));
+
21  }
+
22  }
+
23 }
+
24 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2atan2_8hpp.html b/doc/api/html/fwd_2functions_2atan2_8hpp.html new file mode 100644 index 00000000000..e7a1065707d --- /dev/null +++ b/doc/api/html/fwd_2functions_2atan2_8hpp.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/atan2.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
atan2.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::atan2 (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > stan::agrad::atan2 (const double x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > stan::agrad::atan2 (const fvar< T > &x1, const double x2)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2atan2_8hpp_source.html b/doc/api/html/fwd_2functions_2atan2_8hpp_source.html new file mode 100644 index 00000000000..fc5ceda97f8 --- /dev/null +++ b/doc/api/html/fwd_2functions_2atan2_8hpp_source.html @@ -0,0 +1,151 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/atan2.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
atan2.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__ATAN2_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__ATAN2_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+
15  atan2(const fvar<T>& x1, const fvar<T>& x2) {
+
16  using std::atan2;
+
17  using stan::math::square;
+
18  return fvar<T>(atan2(x1.val_, x2.val_),
+
19  (x1.d_ * x2.val_ - x1.val_ * x2.d_) /
+
20  (square(x2.val_) + square(x1.val_)));
+
21  }
+
22 
+
23  template <typename T>
+
24  inline
+
25  fvar<T>
+
26  atan2(const double x1, const fvar<T>& x2) {
+
27  using std::atan2;
+
28  using stan::math::square;
+
29  return fvar<T>(atan2(x1, x2.val_),
+
30  (-x1 * x2.d_) / (square(x1) + square(x2.val_)));
+
31  }
+
32 
+
33  template <typename T>
+
34  inline
+
35  fvar<T>
+
36  atan2(const fvar<T>& x1, const double x2) {
+
37  using std::atan2;
+
38  using stan::math::square;
+
39  return fvar<T>(atan2(x1.val_, x2),
+
40  (x1.d_ * x2) / (square(x2) + square(x1.val_)));
+
41  }
+
42  }
+
43 }
+
44 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2atan_8hpp.html b/doc/api/html/fwd_2functions_2atan_8hpp.html new file mode 100644 index 00000000000..8469b16bd1c --- /dev/null +++ b/doc/api/html/fwd_2functions_2atan_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/atan.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
atan.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::atan (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2atan_8hpp_source.html b/doc/api/html/fwd_2functions_2atan_8hpp_source.html new file mode 100644 index 00000000000..ff37969a759 --- /dev/null +++ b/doc/api/html/fwd_2functions_2atan_8hpp_source.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/atan.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
atan.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__ATAN_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__ATAN_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+
15  atan(const fvar<T>& x) {
+
16  using std::atan;
+
17  using stan::math::square;
+
18  return fvar<T>(atan(x.val_), x.d_ / (1 + square(x.val_)));
+
19  }
+
20  }
+
21 }
+
22 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2atanh_8hpp.html b/doc/api/html/fwd_2functions_2atanh_8hpp.html new file mode 100644 index 00000000000..241d5208b27 --- /dev/null +++ b/doc/api/html/fwd_2functions_2atanh_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/atanh.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
atanh.hpp File Reference
+
+
+
#include <stan/agrad/fwd/fvar.hpp>
+#include <stan/meta/traits.hpp>
+#include <boost/math/special_functions/atanh.hpp>
+#include <stan/math/functions/square.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::atanh (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2atanh_8hpp_source.html b/doc/api/html/fwd_2functions_2atanh_8hpp_source.html new file mode 100644 index 00000000000..74cfc6244ba --- /dev/null +++ b/doc/api/html/fwd_2functions_2atanh_8hpp_source.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/atanh.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
atanh.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__ATANH_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__ATANH_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 #include <boost/math/special_functions/atanh.hpp>
+ +
8 
+
9 namespace stan {
+
10 
+
11  namespace agrad {
+
12 
+
13  template <typename T>
+
14  inline
+
15  fvar<T>
+
16  atanh(const fvar<T>& x) {
+
17  using boost::math::atanh;
+
18  using stan::math::square;
+
19  return fvar<T>(atanh(x.val_), x.d_ / (1 - square(x.val_)));
+
20  }
+
21  }
+
22 }
+
23 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2cbrt_8hpp.html b/doc/api/html/fwd_2functions_2cbrt_8hpp.html new file mode 100644 index 00000000000..3ba98383b70 --- /dev/null +++ b/doc/api/html/fwd_2functions_2cbrt_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/cbrt.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
cbrt.hpp File Reference
+
+
+
#include <stan/agrad/fwd/fvar.hpp>
+#include <stan/meta/traits.hpp>
+#include <boost/math/special_functions/cbrt.hpp>
+#include <stan/math/functions/square.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::cbrt (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2cbrt_8hpp_source.html b/doc/api/html/fwd_2functions_2cbrt_8hpp_source.html new file mode 100644 index 00000000000..42036b9beb3 --- /dev/null +++ b/doc/api/html/fwd_2functions_2cbrt_8hpp_source.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/cbrt.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
cbrt.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__CBRT_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__CBRT_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 #include <boost/math/special_functions/cbrt.hpp>
+ +
8 
+
9 namespace stan {
+
10 
+
11  namespace agrad {
+
12 
+
13  template <typename T>
+
14  inline
+
15  fvar<T>
+
16  cbrt(const fvar<T>& x) {
+
17  using boost::math::cbrt;
+
18  using stan::math::square;
+
19  return fvar<T>(cbrt(x.val_),
+
20  x.d_ / (square(cbrt(x.val_)) * 3.0));
+
21  }
+
22  }
+
23 }
+
24 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2ceil_8hpp.html b/doc/api/html/fwd_2functions_2ceil_8hpp.html new file mode 100644 index 00000000000..accc329c348 --- /dev/null +++ b/doc/api/html/fwd_2functions_2ceil_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/ceil.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
ceil.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::ceil (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2ceil_8hpp_source.html b/doc/api/html/fwd_2functions_2ceil_8hpp_source.html new file mode 100644 index 00000000000..ae6b7e4ac9b --- /dev/null +++ b/doc/api/html/fwd_2functions_2ceil_8hpp_source.html @@ -0,0 +1,127 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/ceil.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
ceil.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__CEIL_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__CEIL_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 
+
7 namespace stan {
+
8 
+
9  namespace agrad {
+
10 
+
11  template <typename T>
+
12  inline
+
13  fvar<T>
+
14  ceil(const fvar<T>& x) {
+
15  using std::ceil;
+
16  return fvar<T>(ceil(x.val_), 0);
+
17  }
+
18  }
+
19 }
+
20 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2cos_8hpp.html b/doc/api/html/fwd_2functions_2cos_8hpp.html new file mode 100644 index 00000000000..2ee297e06af --- /dev/null +++ b/doc/api/html/fwd_2functions_2cos_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/cos.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
cos.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::cos (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2cos_8hpp_source.html b/doc/api/html/fwd_2functions_2cos_8hpp_source.html new file mode 100644 index 00000000000..f463d40e71a --- /dev/null +++ b/doc/api/html/fwd_2functions_2cos_8hpp_source.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/cos.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
cos.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__COS_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__COS_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 
+
7 namespace stan {
+
8 
+
9  namespace agrad {
+
10 
+
11  template <typename T>
+
12  inline
+
13  fvar<T>
+
14  cos(const fvar<T>& x) {
+
15  using std::sin;
+
16  using std::cos;
+
17  return fvar<T>(cos(x.val_), x.d_ * -sin(x.val_));
+
18  }
+
19  }
+
20 }
+
21 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2cosh_8hpp.html b/doc/api/html/fwd_2functions_2cosh_8hpp.html new file mode 100644 index 00000000000..12f9f01463e --- /dev/null +++ b/doc/api/html/fwd_2functions_2cosh_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/cosh.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
cosh.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::cosh (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2cosh_8hpp_source.html b/doc/api/html/fwd_2functions_2cosh_8hpp_source.html new file mode 100644 index 00000000000..ab0439c6b00 --- /dev/null +++ b/doc/api/html/fwd_2functions_2cosh_8hpp_source.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/cosh.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
cosh.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__COSH_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__COSH_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 
+
7 namespace stan {
+
8 
+
9  namespace agrad {
+
10 
+
11  template <typename T>
+
12  inline
+
13  fvar<T>
+
14  cosh(const fvar<T>& x) {
+
15  using std::sinh;
+
16  using std::cosh;
+
17  return fvar<T>(cosh(x.val_), x.d_ * sinh(x.val_));
+
18  }
+
19  }
+
20 }
+
21 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2erf_8hpp.html b/doc/api/html/fwd_2functions_2erf_8hpp.html new file mode 100644 index 00000000000..cc57cda3257 --- /dev/null +++ b/doc/api/html/fwd_2functions_2erf_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/erf.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
erf.hpp File Reference
+
+
+
#include <stan/agrad/fwd/fvar.hpp>
+#include <stan/meta/traits.hpp>
+#include <boost/math/special_functions/erf.hpp>
+#include <stan/math/constants.hpp>
+#include <stan/math/functions/square.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::erf (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2erf_8hpp_source.html b/doc/api/html/fwd_2functions_2erf_8hpp_source.html new file mode 100644 index 00000000000..c4599e9d35a --- /dev/null +++ b/doc/api/html/fwd_2functions_2erf_8hpp_source.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/erf.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
erf.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__ERF_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__ERF_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 #include <boost/math/special_functions/erf.hpp>
+ + +
9 
+
10 namespace stan {
+
11 
+
12  namespace agrad {
+
13 
+
14  template <typename T>
+
15  inline
+
16  fvar<T>
+
17  erf(const fvar<T>& x) {
+
18  using boost::math::erf;
+
19  using std::sqrt;
+
20  using std::exp;
+
21  using stan::math::square;
+
22  return fvar<T>(erf(x.val_), x.d_ * exp(-square(x.val_))
+ +
24  }
+
25  }
+
26 }
+
27 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2erfc_8hpp.html b/doc/api/html/fwd_2functions_2erfc_8hpp.html new file mode 100644 index 00000000000..db03da010a5 --- /dev/null +++ b/doc/api/html/fwd_2functions_2erfc_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/erfc.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
erfc.hpp File Reference
+
+
+
#include <stan/agrad/fwd/fvar.hpp>
+#include <stan/meta/traits.hpp>
+#include <boost/math/special_functions/erf.hpp>
+#include <stan/math/constants.hpp>
+#include <stan/math/functions/square.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::erfc (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2erfc_8hpp_source.html b/doc/api/html/fwd_2functions_2erfc_8hpp_source.html new file mode 100644 index 00000000000..180e7b17961 --- /dev/null +++ b/doc/api/html/fwd_2functions_2erfc_8hpp_source.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/erfc.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
erfc.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__ERFC_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__ERFC_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 #include <boost/math/special_functions/erf.hpp>
+ + +
9 
+
10 namespace stan {
+
11 
+
12  namespace agrad {
+
13 
+
14  template <typename T>
+
15  inline
+
16  fvar<T>
+
17  erfc(const fvar<T>& x) {
+
18  using boost::math::erfc;
+
19  using std::sqrt;
+
20  using std::exp;
+
21  using stan::math::square;
+
22  return fvar<T>(erfc(x.val_), -x.d_ * exp(-square(x.val_))
+ +
24  }
+
25  }
+
26 }
+
27 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2expm1_8hpp.html b/doc/api/html/fwd_2functions_2expm1_8hpp.html new file mode 100644 index 00000000000..17b904918b7 --- /dev/null +++ b/doc/api/html/fwd_2functions_2expm1_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/expm1.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
expm1.hpp File Reference
+
+
+
#include <stan/agrad/fwd/fvar.hpp>
+#include <stan/meta/traits.hpp>
+#include <boost/math/special_functions/expm1.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::expm1 (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2expm1_8hpp_source.html b/doc/api/html/fwd_2functions_2expm1_8hpp_source.html new file mode 100644 index 00000000000..fca6f93d32b --- /dev/null +++ b/doc/api/html/fwd_2functions_2expm1_8hpp_source.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/expm1.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
expm1.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__EXPM1_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__EXPM1_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 #include <boost/math/special_functions/expm1.hpp>
+
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+
15  expm1(const fvar<T>& x) {
+
16  using boost::math::expm1;
+
17  using std::exp;
+
18  return fvar<T>(expm1(x.val_), x.d_ * exp(x.val_));
+
19  }
+
20  }
+
21 }
+
22 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2fabs_8hpp.html b/doc/api/html/fwd_2functions_2fabs_8hpp.html new file mode 100644 index 00000000000..26431410ef4 --- /dev/null +++ b/doc/api/html/fwd_2functions_2fabs_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/fabs.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
fabs.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::fabs (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2fabs_8hpp_source.html b/doc/api/html/fwd_2functions_2fabs_8hpp_source.html new file mode 100644 index 00000000000..74a4fd3330b --- /dev/null +++ b/doc/api/html/fwd_2functions_2fabs_8hpp_source.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/fabs.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
fabs.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__FABS_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__FABS_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template<typename T>
+
13  inline
+
14  fvar<T>
+
15  fabs(const fvar<T>& x) {
+ +
17  if (x.val_ > 0.0)
+
18  return x;
+
19  else if (x.val_ < 0.0)
+
20  return fvar<T>(-x.val_, -x.d_);
+
21  else if (x.val_ == 0.0)
+
22  return fvar<T>(0, 0);
+
23  else
+ +
25  }
+
26  }
+
27 }
+
28 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2floor_8hpp.html b/doc/api/html/fwd_2functions_2floor_8hpp.html new file mode 100644 index 00000000000..22ec282a13d --- /dev/null +++ b/doc/api/html/fwd_2functions_2floor_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/floor.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
floor.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::floor (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2floor_8hpp_source.html b/doc/api/html/fwd_2functions_2floor_8hpp_source.html new file mode 100644 index 00000000000..8b7a5c50222 --- /dev/null +++ b/doc/api/html/fwd_2functions_2floor_8hpp_source.html @@ -0,0 +1,127 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/floor.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
floor.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__FLOOR_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__FLOOR_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 
+
7 namespace stan {
+
8 
+
9  namespace agrad {
+
10 
+
11  template <typename T>
+
12  inline
+
13  fvar<T>
+
14  floor(const fvar<T>& x) {
+
15  using std::floor;
+
16  return fvar<T>(floor(x.val_), 0);
+
17  }
+
18  }
+
19 }
+
20 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2fmax_8hpp.html b/doc/api/html/fwd_2functions_2fmax_8hpp.html new file mode 100644 index 00000000000..ab8b713149a --- /dev/null +++ b/doc/api/html/fwd_2functions_2fmax_8hpp.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/fmax.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
fmax.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::fmax (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > stan::agrad::fmax (const double x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > stan::agrad::fmax (const fvar< T > &x1, const double x2)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2fmax_8hpp_source.html b/doc/api/html/fwd_2functions_2fmax_8hpp_source.html new file mode 100644 index 00000000000..34316022865 --- /dev/null +++ b/doc/api/html/fwd_2functions_2fmax_8hpp_source.html @@ -0,0 +1,162 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/fmax.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
fmax.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__FMAX_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__FMAX_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+
15  fmax(const fvar<T>& x1, const fvar<T>& x2) {
+
16  using std::max;
+ +
18  if(x1.val_ > x2.val_)
+
19  return fvar<T>(x1.val_, x1.d_);
+
20  else if(x1.val_ == x2.val_)
+
21  return fvar<T>(x1.val_, NOT_A_NUMBER);
+
22  else
+
23  return fvar<T>(x2.val_, x2.d_);
+
24  }
+
25 
+
26  template <typename T>
+
27  inline
+
28  fvar<T>
+
29  fmax(const double x1, const fvar<T>& x2) {
+
30  using std::max;
+ +
32  if(x1 > x2.val_)
+
33  return fvar<T>(x1, 0.0);
+
34  else if(x1 == x2.val_)
+
35  return fvar<T>(x2.val_, NOT_A_NUMBER);
+
36  else
+
37  return fvar<T>(x2.val_, x2.d_);
+
38  }
+
39 
+
40  template <typename T>
+
41  inline
+
42  fvar<T>
+
43  fmax(const fvar<T>& x1, const double x2) {
+
44  using std::max;
+ +
46  if(x1.val_ > x2)
+
47  return fvar<T>(x1.val_, x1.d_);
+
48  else if(x1.val_ == x2)
+
49  return fvar<T>(x1.val_, NOT_A_NUMBER);
+
50  else
+
51  return fvar<T>(x2, 0.0);
+
52  }
+
53  }
+
54 }
+
55 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2fmin_8hpp.html b/doc/api/html/fwd_2functions_2fmin_8hpp.html new file mode 100644 index 00000000000..006c6b56711 --- /dev/null +++ b/doc/api/html/fwd_2functions_2fmin_8hpp.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/fmin.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
fmin.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::fmin (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > stan::agrad::fmin (const double x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > stan::agrad::fmin (const fvar< T > &x1, const double x2)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2fmin_8hpp_source.html b/doc/api/html/fwd_2functions_2fmin_8hpp_source.html new file mode 100644 index 00000000000..81fcd8691cd --- /dev/null +++ b/doc/api/html/fwd_2functions_2fmin_8hpp_source.html @@ -0,0 +1,162 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/fmin.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
fmin.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__FMIN_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__FMIN_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+
15  fmin(const fvar<T>& x1, const fvar<T>& x2) {
+
16  using std::min;
+ +
18  if(x1.val_ < x2.val_)
+
19  return fvar<T>(x1.val_, x1.d_);
+
20  else if(x1.val_ == x2.val_)
+
21  return fvar<T>(x1.val_, NOT_A_NUMBER);
+
22  else
+
23  return fvar<T>(x2.val_, x2.d_);
+
24  }
+
25 
+
26  template <typename T>
+
27  inline
+
28  fvar<T>
+
29  fmin(const double x1, const fvar<T>& x2) {
+
30  using std::min;
+ +
32  if(x1 < x2.val_)
+
33  return fvar<T>(x1, 0.0);
+
34  else if(x1 == x2.val_)
+
35  return fvar<T>(x2.val_, NOT_A_NUMBER);
+
36  else
+
37  return fvar<T>(x2.val_, x2.d_);
+
38  }
+
39 
+
40  template <typename T>
+
41  inline
+
42  fvar<T>
+
43  fmin(const fvar<T>& x1, const double x2) {
+
44  using std::min;
+ +
46  if(x1.val_ < x2)
+
47  return fvar<T>(x1.val_, x1.d_);
+
48  else if(x1.val_ == x2)
+
49  return fvar<T>(x1.val_, NOT_A_NUMBER);
+
50  else
+
51  return fvar<T>(x2, 0.0);
+
52  }
+
53  }
+
54 }
+
55 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2fmod_8hpp.html b/doc/api/html/fwd_2functions_2fmod_8hpp.html new file mode 100644 index 00000000000..7a20f0c6739 --- /dev/null +++ b/doc/api/html/fwd_2functions_2fmod_8hpp.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/fmod.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
fmod.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::fmod (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > stan::agrad::fmod (const fvar< T > &x1, const double x2)
 
template<typename T >
fvar< T > stan::agrad::fmod (const double x1, const fvar< T > &x2)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2fmod_8hpp_source.html b/doc/api/html/fwd_2functions_2fmod_8hpp_source.html new file mode 100644 index 00000000000..de1462dcbd5 --- /dev/null +++ b/doc/api/html/fwd_2functions_2fmod_8hpp_source.html @@ -0,0 +1,146 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/fmod.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
fmod.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__FMOD_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__FMOD_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 
+
7 namespace stan {
+
8 
+
9  namespace agrad {
+
10 
+
11  template <typename T>
+
12  inline
+
13  fvar<T>
+
14  fmod(const fvar<T>& x1, const fvar<T>& x2) {
+
15  using std::fmod;
+
16  using std::floor;
+
17  return fvar<T>(fmod(x1.val_, x2.val_),
+
18  x1.d_ - x2.d_ * floor(x1.val_ / x2.val_));
+
19  }
+
20 
+
21  template <typename T>
+
22  inline
+
23  fvar<T>
+
24  fmod(const fvar<T>& x1, const double x2) {
+
25  using std::fmod;
+
26  return fvar<T>(fmod(x1.val_, x2), x1.d_ / x2);
+
27  }
+
28 
+
29  template <typename T>
+
30  inline
+
31  fvar<T>
+
32  fmod(const double x1, const fvar<T>& x2) {
+
33  using std::fmod;
+
34  using std::floor;
+
35  return fvar<T>(fmod(x1, x2.val_), -x2.d_ * floor(x1 / x2.val_));
+
36  }
+
37  }
+
38 }
+
39 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2hypot_8hpp.html b/doc/api/html/fwd_2functions_2hypot_8hpp.html new file mode 100644 index 00000000000..73881d1bd6d --- /dev/null +++ b/doc/api/html/fwd_2functions_2hypot_8hpp.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/hypot.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
hypot.hpp File Reference
+
+
+
#include <stan/agrad/fwd/fvar.hpp>
+#include <stan/meta/traits.hpp>
+#include <boost/math/special_functions/hypot.hpp>
+#include <stan/math/functions/inv.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::hypot (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > stan::agrad::hypot (const fvar< T > &x1, const double x2)
 
template<typename T >
fvar< T > stan::agrad::hypot (const double x1, const fvar< T > &x2)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2hypot_8hpp_source.html b/doc/api/html/fwd_2functions_2hypot_8hpp_source.html new file mode 100644 index 00000000000..8f3aa6b8909 --- /dev/null +++ b/doc/api/html/fwd_2functions_2hypot_8hpp_source.html @@ -0,0 +1,154 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/hypot.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
hypot.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__HYPOT_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__HYPOT_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 #include <boost/math/special_functions/hypot.hpp>
+ +
8 
+
9 namespace stan {
+
10 
+
11  namespace agrad {
+
12 
+
13  template <typename T>
+
14  inline
+
15  fvar<T>
+
16  hypot(const fvar<T>& x1, const fvar<T>& x2) {
+
17  using boost::math::hypot;
+
18  using std::sqrt;
+
19  using stan::math::inv;
+
20  T u = hypot(x1.val_, x2.val_);
+
21  return fvar<T>(u, (x1.d_ * x1.val_ + x2.d_ * x2.val_) * inv(u));
+
22  }
+
23 
+
24  template <typename T>
+
25  inline
+
26  fvar<T>
+
27  hypot(const fvar<T>& x1, const double x2) {
+
28  using boost::math::hypot;
+
29  using std::sqrt;
+
30  T u = hypot(x1.val_, x2);
+
31  return fvar<T>(u, (x1.d_ * x1.val_) * inv(u));
+
32  }
+
33 
+
34  template <typename T>
+
35  inline
+
36  fvar<T>
+
37  hypot(const double x1, const fvar<T>& x2) {
+
38  using boost::math::hypot;
+
39  using std::sqrt;
+
40  using stan::math::inv;
+
41  T u = hypot(x1, x2.val_);
+
42  return fvar<T>(u, (x2.d_ * x2.val_) * inv(u));
+
43  }
+
44 
+
45  }
+
46 }
+
47 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2log10_8hpp.html b/doc/api/html/fwd_2functions_2log10_8hpp.html new file mode 100644 index 00000000000..69729b9ecf0 --- /dev/null +++ b/doc/api/html/fwd_2functions_2log10_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/log10.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log10.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::log10 (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2log10_8hpp_source.html b/doc/api/html/fwd_2functions_2log10_8hpp_source.html new file mode 100644 index 00000000000..5394bae1bda --- /dev/null +++ b/doc/api/html/fwd_2functions_2log10_8hpp_source.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/log10.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log10.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__LOG10_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__LOG10_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+
15  log10(const fvar<T>& x) {
+
16  using std::log;
+
17  using std::log10;
+ +
19  if(x.val_ < 0.0)
+ +
21  else
+
22  return fvar<T>(log10(x.val_), x.d_ / (x.val_ * stan::math::LOG_10));
+
23  }
+
24  }
+
25 }
+
26 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2pow_8hpp.html b/doc/api/html/fwd_2functions_2pow_8hpp.html new file mode 100644 index 00000000000..2e15ed3f2b5 --- /dev/null +++ b/doc/api/html/fwd_2functions_2pow_8hpp.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/pow.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
pow.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::pow (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > stan::agrad::pow (const double x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > stan::agrad::pow (const fvar< T > &x1, const double x2)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2pow_8hpp_source.html b/doc/api/html/fwd_2functions_2pow_8hpp_source.html new file mode 100644 index 00000000000..7f65565d325 --- /dev/null +++ b/doc/api/html/fwd_2functions_2pow_8hpp_source.html @@ -0,0 +1,172 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/pow.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
pow.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__POW_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__POW_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ + + +
9 
+
10 namespace stan {
+
11 
+
12  namespace agrad {
+
13 
+
14  template <typename T>
+
15  inline
+
16  fvar<T>
+
17  pow(const fvar<T>& x1, const fvar<T>& x2) {
+
18  using std::pow;
+
19  using std::log;
+
20  T pow_x1_x2(pow(x1.val_,x2.val_));
+
21  return fvar<T>(pow_x1_x2,
+
22  (x2.d_ * log(x1.val_)
+
23  + x2.val_ * x1.d_ / x1.val_) * pow_x1_x2);
+
24  }
+
25 
+
26  template <typename T>
+
27  inline
+
28  fvar<T>
+
29  pow(const double x1, const fvar<T>& x2) {
+
30  using std::pow;
+
31  using std::log;
+
32  T u = pow(x1,x2.val_);
+
33  return fvar<T>(u, x2.d_ * log(x1) * u);
+
34  }
+
35 
+
36  template <typename T>
+
37  inline
+
38  fvar<T>
+
39  pow(const fvar<T>& x1, const double x2) {
+
40  using std::pow;
+
41  using stan::agrad::inv;
+ + +
44  using std::sqrt;
+
45  using stan::math::square;
+
46 
+
47  if (x2 == -2)
+
48  return inv_square(x1);
+
49  if (x2 == -1)
+
50  return inv(x1);
+
51  if (x2 == -0.5)
+
52  return inv_sqrt(x1);
+
53  if (x2 == 0.5)
+
54  return sqrt(x1);
+
55  if (x2 == 1.0)
+
56  return x1;
+
57  if (x2 == 2.0)
+
58  return square(x1);
+
59 
+
60  return fvar<T>(pow(x1.val_, x2),
+
61  x1.d_ * x2 * pow(x1.val_, x2 - 1));
+
62  }
+
63  }
+
64 }
+
65 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2round_8hpp.html b/doc/api/html/fwd_2functions_2round_8hpp.html new file mode 100644 index 00000000000..8beaf9ab724 --- /dev/null +++ b/doc/api/html/fwd_2functions_2round_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/round.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
round.hpp File Reference
+
+
+
#include <boost/math/special_functions/round.hpp>
+#include <stan/agrad/fwd/fvar.hpp>
+#include <stan/meta/traits.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::round (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2round_8hpp_source.html b/doc/api/html/fwd_2functions_2round_8hpp_source.html new file mode 100644 index 00000000000..9c9d424c22e --- /dev/null +++ b/doc/api/html/fwd_2functions_2round_8hpp_source.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/round.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
round.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__ROUND_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__ROUND_HPP__
+
3 
+
4 #include <boost/math/special_functions/round.hpp>
+ +
6 #include <stan/meta/traits.hpp>
+
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+
15  round(const fvar<T>& x) {
+
16  using boost::math::round;
+
17  return fvar<T>(round(x.val_), 0);
+
18  }
+
19 
+
20  }
+
21 }
+
22 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2sin_8hpp.html b/doc/api/html/fwd_2functions_2sin_8hpp.html new file mode 100644 index 00000000000..d8f5985c8c8 --- /dev/null +++ b/doc/api/html/fwd_2functions_2sin_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/sin.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
sin.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::sin (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2sin_8hpp_source.html b/doc/api/html/fwd_2functions_2sin_8hpp_source.html new file mode 100644 index 00000000000..99d8f07dd49 --- /dev/null +++ b/doc/api/html/fwd_2functions_2sin_8hpp_source.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/sin.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
sin.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__SIN_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__SIN_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 
+
7 namespace stan {
+
8 
+
9  namespace agrad {
+
10 
+
11  template <typename T>
+
12  inline
+
13  fvar<T>
+
14  sin(const fvar<T>& x) {
+
15  using std::sin;
+
16  using std::cos;
+
17  return fvar<T>(sin(x.val_),
+
18  x.d_ * cos(x.val_));
+
19  }
+
20  }
+
21 }
+
22 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2sinh_8hpp.html b/doc/api/html/fwd_2functions_2sinh_8hpp.html new file mode 100644 index 00000000000..6ed5b2e8a2a --- /dev/null +++ b/doc/api/html/fwd_2functions_2sinh_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/sinh.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
sinh.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::sinh (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2sinh_8hpp_source.html b/doc/api/html/fwd_2functions_2sinh_8hpp_source.html new file mode 100644 index 00000000000..e4b703e27d6 --- /dev/null +++ b/doc/api/html/fwd_2functions_2sinh_8hpp_source.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/sinh.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
sinh.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__SINH_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__SINH_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 
+
7 namespace stan {
+
8 
+
9  namespace agrad {
+
10 
+
11  template <typename T>
+
12  inline
+
13  fvar<T>
+
14  sinh(const fvar<T>& x) {
+
15  using std::sinh;
+
16  using std::cosh;
+
17  return fvar<T>(sinh(x.val_),
+
18  x.d_ * cosh(x.val_));
+
19  }
+
20  }
+
21 }
+
22 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2sqrt_8hpp.html b/doc/api/html/fwd_2functions_2sqrt_8hpp.html new file mode 100644 index 00000000000..b53906c46df --- /dev/null +++ b/doc/api/html/fwd_2functions_2sqrt_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/sqrt.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
sqrt.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::sqrt (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2sqrt_8hpp_source.html b/doc/api/html/fwd_2functions_2sqrt_8hpp_source.html new file mode 100644 index 00000000000..1db4be14622 --- /dev/null +++ b/doc/api/html/fwd_2functions_2sqrt_8hpp_source.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/sqrt.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
sqrt.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__SQRT_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__SQRT_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+
15  sqrt(const fvar<T>& x) {
+
16  using std::sqrt;
+ +
18  return fvar<T>(sqrt(x.val_), 0.5 * x.d_ * inv_sqrt(x.val_));
+
19  }
+
20  }
+
21 }
+
22 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2tan_8hpp.html b/doc/api/html/fwd_2functions_2tan_8hpp.html new file mode 100644 index 00000000000..a8b8a8f2ce9 --- /dev/null +++ b/doc/api/html/fwd_2functions_2tan_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/tan.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
tan.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::tan (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2tan_8hpp_source.html b/doc/api/html/fwd_2functions_2tan_8hpp_source.html new file mode 100644 index 00000000000..4f26a611c12 --- /dev/null +++ b/doc/api/html/fwd_2functions_2tan_8hpp_source.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/tan.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
tan.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__TAN_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__TAN_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 
+
7 namespace stan {
+
8 
+
9  namespace agrad {
+
10 
+
11  template <typename T>
+
12  inline
+
13  fvar<T>
+
14  tan(const fvar<T>& x) {
+
15  using std::cos;
+
16  using std::tan;
+
17  return fvar<T>(tan(x.val_), x.d_ / (cos(x.val_) * cos(x.val_)));
+
18  }
+
19  }
+
20 }
+
21 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2tanh_8hpp.html b/doc/api/html/fwd_2functions_2tanh_8hpp.html new file mode 100644 index 00000000000..de60a633e52 --- /dev/null +++ b/doc/api/html/fwd_2functions_2tanh_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/tanh.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
tanh.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::tanh (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2tanh_8hpp_source.html b/doc/api/html/fwd_2functions_2tanh_8hpp_source.html new file mode 100644 index 00000000000..95cdc32c26b --- /dev/null +++ b/doc/api/html/fwd_2functions_2tanh_8hpp_source.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/tanh.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
tanh.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__TANH_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__TANH_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 
+
7 namespace stan {
+
8 
+
9  namespace agrad {
+
10 
+
11  template <typename T>
+
12  inline
+
13  fvar<T>
+
14  tanh(const fvar<T>& x) {
+
15  using std::tanh;
+
16  T u = tanh(x.val_);
+
17  return fvar<T>(u, x.d_ * (1 - u * u));
+
18  }
+
19  }
+
20 }
+
21 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2tgamma_8hpp.html b/doc/api/html/fwd_2functions_2tgamma_8hpp.html new file mode 100644 index 00000000000..c1abe8ede4a --- /dev/null +++ b/doc/api/html/fwd_2functions_2tgamma_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/tgamma.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
tgamma.hpp File Reference
+
+
+
#include <stan/agrad/fwd/fvar.hpp>
+#include <stan/meta/traits.hpp>
+#include <boost/math/special_functions/digamma.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::tgamma (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2tgamma_8hpp_source.html b/doc/api/html/fwd_2functions_2tgamma_8hpp_source.html new file mode 100644 index 00000000000..2d1e0a86398 --- /dev/null +++ b/doc/api/html/fwd_2functions_2tgamma_8hpp_source.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/tgamma.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
tgamma.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__TGAMMA_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__TGAMMA_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 #include <boost/math/special_functions/digamma.hpp>
+
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+
15  tgamma(const fvar<T>& x) {
+ +
17  using boost::math::tgamma;
+
18  T u = tgamma(x.val_);
+
19  return fvar<T>(u, x.d_ * u * digamma(x.val_));
+
20  }
+
21  }
+
22 }
+
23 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2trunc_8hpp.html b/doc/api/html/fwd_2functions_2trunc_8hpp.html new file mode 100644 index 00000000000..c9193e58e13 --- /dev/null +++ b/doc/api/html/fwd_2functions_2trunc_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/trunc.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
trunc.hpp File Reference
+
+
+
#include <boost/math/special_functions/trunc.hpp>
+#include <stan/agrad/fwd/fvar.hpp>
+#include <stan/meta/traits.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::trunc (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2functions_2trunc_8hpp_source.html b/doc/api/html/fwd_2functions_2trunc_8hpp_source.html new file mode 100644 index 00000000000..ab17a5cebb4 --- /dev/null +++ b/doc/api/html/fwd_2functions_2trunc_8hpp_source.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/agrad/fwd/functions/trunc.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
trunc.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__FUNCTIONS__TRUNC_HPP__
+
2 #define __STAN__AGRAD__FWD__FUNCTIONS__TRUNC_HPP__
+
3 
+
4 #include <boost/math/special_functions/trunc.hpp>
+ +
6 #include <stan/meta/traits.hpp>
+
7 
+
8 namespace stan {
+
9 
+
10  namespace agrad {
+
11 
+
12  template <typename T>
+
13  inline
+
14  fvar<T>
+
15  trunc(const fvar<T>& x) {
+
16  using boost::math::trunc;
+
17  return fvar<T>(trunc(x.val_), 0);
+
18  }
+
19 
+
20  }
+
21 }
+
22 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2numeric__limits_8hpp.html b/doc/api/html/fwd_2numeric__limits_8hpp.html new file mode 100644 index 00000000000..2e0c7de353a --- /dev/null +++ b/doc/api/html/fwd_2numeric__limits_8hpp.html @@ -0,0 +1,126 @@ + + + + + +Stan: src/stan/agrad/fwd/numeric_limits.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
numeric_limits.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

struct  std::numeric_limits< stan::agrad::fvar< T > >
 
+ + + + +

+Namespaces

namespace  std
 Template specification of functions in std for Stan.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2numeric__limits_8hpp_source.html b/doc/api/html/fwd_2numeric__limits_8hpp_source.html new file mode 100644 index 00000000000..4148fca2704 --- /dev/null +++ b/doc/api/html/fwd_2numeric__limits_8hpp_source.html @@ -0,0 +1,164 @@ + + + + + +Stan: src/stan/agrad/fwd/numeric_limits.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
numeric_limits.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__NUMERIC__LIMITS__HPP__
+
2 #define __STAN__AGRAD__FWD__NUMERIC__LIMITS__HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 
+
7 namespace std {
+
8 
+
9  template <typename T>
+
10 
+
11  struct numeric_limits<stan::agrad::fvar<T> > {
+
12  static const bool is_specialized = true;
+ + +
15  static const int digits = numeric_limits<double>::digits;
+
16  static const int digits10 = numeric_limits<double>::digits10;
+
17  static const bool is_signed = numeric_limits<double>::is_signed;
+
18  static const bool is_integer = numeric_limits<double>::is_integer;
+
19  static const bool is_exact = numeric_limits<double>::is_exact;
+
20  static const int radix = numeric_limits<double>::radix;
+ +
22  return numeric_limits<double>::epsilon(); }
+ +
24  return numeric_limits<double>::round_error(); }
+
25 
+
26  static const int min_exponent = numeric_limits<double>::min_exponent;
+
27  static const int min_exponent10 = numeric_limits<double>::min_exponent10;
+
28  static const int max_exponent = numeric_limits<double>::max_exponent;
+
29  static const int max_exponent10 = numeric_limits<double>::max_exponent10;
+
30 
+
31  static const bool has_infinity = numeric_limits<double>::has_infinity;
+
32  static const bool has_quiet_NaN = numeric_limits<double>::has_quiet_NaN;
+
33  static const bool has_signaling_NaN =
+
34  numeric_limits<double>::has_signaling_NaN;
+
35  static const float_denorm_style has_denorm =
+
36  numeric_limits<double>::has_denorm;
+
37  static const bool has_denorm_loss = numeric_limits<double>::has_denorm_loss;
+ +
39  return numeric_limits<double>::infinity(); }
+ +
41  return numeric_limits<double>::quiet_NaN(); }
+ +
43  return numeric_limits<double>::signaling_NaN(); }
+ +
45  return numeric_limits<double>::denorm_min(); }
+
46 
+
47  static const bool is_iec559 = numeric_limits<double>::is_iec559;
+
48  static const bool is_bounded = numeric_limits<double>::is_bounded;
+
49  static const bool is_modulo = numeric_limits<double>::is_modulo;
+
50 
+
51  static const bool traps = numeric_limits<double>::traps;
+
52  static const bool tinyness_before = numeric_limits<double>::tinyness_before;
+
53  static const float_round_style round_style =
+
54  numeric_limits<double>::round_style;
+
55  };
+
56 }
+
57 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2operators_2operator__addition_8hpp.html b/doc/api/html/fwd_2operators_2operator__addition_8hpp.html new file mode 100644 index 00000000000..ddc768e98f2 --- /dev/null +++ b/doc/api/html/fwd_2operators_2operator__addition_8hpp.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/agrad/fwd/operators/operator_addition.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
operator_addition.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::operator+ (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > stan::agrad::operator+ (const double x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > stan::agrad::operator+ (const fvar< T > &x1, const double x2)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2operators_2operator__addition_8hpp_source.html b/doc/api/html/fwd_2operators_2operator__addition_8hpp_source.html new file mode 100644 index 00000000000..f5034ec78f5 --- /dev/null +++ b/doc/api/html/fwd_2operators_2operator__addition_8hpp_source.html @@ -0,0 +1,140 @@ + + + + + +Stan: src/stan/agrad/fwd/operators/operator_addition.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operator_addition.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__OPERATORS__OPERATOR_ADDITION_HPP__
+
2 #define __STAN__AGRAD__FWD__OPERATORS__OPERATOR_ADDITION_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 
+
7 namespace stan {
+
8 
+
9  namespace agrad {
+
10 
+
11  template <typename T>
+
12  inline
+
13  fvar<T>
+
14  operator+(const fvar<T>& x1, const fvar<T>& x2) {
+
15  return fvar<T>(x1.val_ + x2.val_, x1.d_ + x2.d_);
+
16  }
+
17 
+
18  template <typename T>
+
19  inline
+
20  fvar<T>
+
21  operator+(const double x1, const fvar<T>& x2) {
+
22  return fvar<T>(x1 + x2.val_, x2.d_);
+
23  }
+
24 
+
25  template <typename T>
+
26  inline
+
27  fvar<T>
+
28  operator+(const fvar<T>& x1, const double x2) {
+
29  return fvar<T>(x1.val_ + x2, x1.d_);
+
30  }
+
31  }
+
32 }
+
33 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2operators_2operator__division_8hpp.html b/doc/api/html/fwd_2operators_2operator__division_8hpp.html new file mode 100644 index 00000000000..e0a33c1eb26 --- /dev/null +++ b/doc/api/html/fwd_2operators_2operator__division_8hpp.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/agrad/fwd/operators/operator_division.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
operator_division.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::operator/ (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > stan::agrad::operator/ (const fvar< T > &x1, const double x2)
 
template<typename T >
fvar< T > stan::agrad::operator/ (const double x1, const fvar< T > &x2)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2operators_2operator__division_8hpp_source.html b/doc/api/html/fwd_2operators_2operator__division_8hpp_source.html new file mode 100644 index 00000000000..bb820237ef4 --- /dev/null +++ b/doc/api/html/fwd_2operators_2operator__division_8hpp_source.html @@ -0,0 +1,144 @@ + + + + + +Stan: src/stan/agrad/fwd/operators/operator_division.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operator_division.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__OPERATORS__OPERATOR_DIVISION_HPP__
+
2 #define __STAN__AGRAD__FWD__OPERATORS__OPERATOR_DIVISION_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 
+
7 namespace stan {
+
8 
+
9  namespace agrad {
+
10 
+
11  template <typename T>
+
12  inline
+
13  fvar<T>
+
14  operator/(const fvar<T>& x1, const fvar<T>& x2) {
+
15  return fvar<T>(x1.val_ / x2.val_,
+
16  (x1.d_ * x2.val_ - x1.val_ * x2.d_) / (x2.val_ * x2.val_));
+
17  }
+
18 
+
19  template <typename T>
+
20  inline
+
21  fvar<T>
+
22  operator/(const fvar<T>& x1, const double x2) {
+
23  return fvar<T>(x1.val_ / x2,
+
24  x1.d_ / x2);
+
25  }
+
26 
+
27  template <typename T>
+
28  inline
+
29  fvar<T>
+
30  operator/(const double x1, const fvar<T>& x2) {
+
31  return fvar<T>(x1 / x2.val_,
+
32  - x1 * x2.d_ / (x2.val_ * x2.val_));
+
33 
+
34  }
+
35  }
+
36 }
+
37 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2operators_2operator__equal_8hpp.html b/doc/api/html/fwd_2operators_2operator__equal_8hpp.html new file mode 100644 index 00000000000..d1ac64f4b08 --- /dev/null +++ b/doc/api/html/fwd_2operators_2operator__equal_8hpp.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/agrad/fwd/operators/operator_equal.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
operator_equal.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T >
bool stan::agrad::operator== (const fvar< T > &x, const fvar< T > &y)
 
template<typename T >
bool stan::agrad::operator== (const fvar< T > &x, double y)
 
template<typename T >
bool stan::agrad::operator== (double x, const fvar< T > &y)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2operators_2operator__equal_8hpp_source.html b/doc/api/html/fwd_2operators_2operator__equal_8hpp_source.html new file mode 100644 index 00000000000..a5d3a0d49e9 --- /dev/null +++ b/doc/api/html/fwd_2operators_2operator__equal_8hpp_source.html @@ -0,0 +1,140 @@ + + + + + +Stan: src/stan/agrad/fwd/operators/operator_equal.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operator_equal.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__OPERATORS__OPERATOR_EQUAL_HPP__
+
2 #define __STAN__AGRAD__FWD__OPERATORS__OPERATOR_EQUAL_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 
+
7 namespace stan {
+
8 
+
9  namespace agrad {
+
10 
+
11  template <typename T>
+
12  inline
+
13  bool
+
14  operator==(const fvar<T>& x, const fvar<T>& y) {
+
15  return x.val_ == y.val_;
+
16  }
+
17 
+
18  template <typename T>
+
19  inline
+
20  bool
+
21  operator==(const fvar<T>& x, double y) {
+
22  return x.val_ == y;
+
23  }
+
24 
+
25  template <typename T>
+
26  inline
+
27  bool
+
28  operator==(double x, const fvar<T>& y) {
+
29  return x == y.val_;
+
30  }
+
31  }
+
32 }
+
33 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2operators_2operator__greater__than_8hpp.html b/doc/api/html/fwd_2operators_2operator__greater__than_8hpp.html new file mode 100644 index 00000000000..4b97178b802 --- /dev/null +++ b/doc/api/html/fwd_2operators_2operator__greater__than_8hpp.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/agrad/fwd/operators/operator_greater_than.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
operator_greater_than.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T >
bool stan::agrad::operator> (const fvar< T > &x, const fvar< T > &y)
 
template<typename T >
bool stan::agrad::operator> (const fvar< T > &x, double y)
 
template<typename T >
bool stan::agrad::operator> (double x, const fvar< T > &y)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2operators_2operator__greater__than_8hpp_source.html b/doc/api/html/fwd_2operators_2operator__greater__than_8hpp_source.html new file mode 100644 index 00000000000..b72b9f63365 --- /dev/null +++ b/doc/api/html/fwd_2operators_2operator__greater__than_8hpp_source.html @@ -0,0 +1,140 @@ + + + + + +Stan: src/stan/agrad/fwd/operators/operator_greater_than.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operator_greater_than.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__OPERATORS__OPERATOR__GREATER_THAN_HPP__
+
2 #define __STAN__AGRAD__FWD__OPERATORS__OPERATOR__GREATER_THAN_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 
+
7 namespace stan {
+
8 
+
9  namespace agrad {
+
10 
+
11  template <typename T>
+
12  inline
+
13  bool
+
14  operator>(const fvar<T>& x, const fvar<T>& y) {
+
15  return x.val_ > y.val_;
+
16  }
+
17 
+
18  template <typename T>
+
19  inline
+
20  bool
+
21  operator>(const fvar<T>& x, double y) {
+
22  return x.val_ > y;
+
23  }
+
24 
+
25  template <typename T>
+
26  inline
+
27  bool
+
28  operator>(double x, const fvar<T>& y) {
+
29  return x > y.val_;
+
30  }
+
31  }
+
32 }
+
33 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2operators_2operator__greater__than__or__equal_8hpp.html b/doc/api/html/fwd_2operators_2operator__greater__than__or__equal_8hpp.html new file mode 100644 index 00000000000..fb9abc85984 --- /dev/null +++ b/doc/api/html/fwd_2operators_2operator__greater__than__or__equal_8hpp.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/agrad/fwd/operators/operator_greater_than_or_equal.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
operator_greater_than_or_equal.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T >
bool stan::agrad::operator>= (const fvar< T > &x, const fvar< T > &y)
 
template<typename T >
bool stan::agrad::operator>= (const fvar< T > &x, double y)
 
template<typename T >
bool stan::agrad::operator>= (double x, const fvar< T > &y)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2operators_2operator__greater__than__or__equal_8hpp_source.html b/doc/api/html/fwd_2operators_2operator__greater__than__or__equal_8hpp_source.html new file mode 100644 index 00000000000..4c2987c3ccd --- /dev/null +++ b/doc/api/html/fwd_2operators_2operator__greater__than__or__equal_8hpp_source.html @@ -0,0 +1,140 @@ + + + + + +Stan: src/stan/agrad/fwd/operators/operator_greater_than_or_equal.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operator_greater_than_or_equal.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__OPERATORS__OPERATOR__GREATER_THAN_OR_EQUAL_HPP__
+
2 #define __STAN__AGRAD__FWD__OPERATORS__OPERATOR__GREATER_THAN_OR_EQUAL_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 
+
7 namespace stan {
+
8 
+
9  namespace agrad {
+
10 
+
11  template <typename T>
+
12  inline
+
13  bool
+
14  operator>=(const fvar<T>& x, const fvar<T>& y) {
+
15  return x.val_ >= y.val_;
+
16  }
+
17 
+
18  template <typename T>
+
19  inline
+
20  bool
+
21  operator>=(const fvar<T>& x, double y) {
+
22  return x.val_ >= y;
+
23  }
+
24 
+
25  template <typename T>
+
26  inline
+
27  bool
+
28  operator>=(double x, const fvar<T>& y) {
+
29  return x >= y.val_;
+
30  }
+
31  }
+
32 }
+
33 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2operators_2operator__less__than_8hpp.html b/doc/api/html/fwd_2operators_2operator__less__than_8hpp.html new file mode 100644 index 00000000000..e1e3235e16d --- /dev/null +++ b/doc/api/html/fwd_2operators_2operator__less__than_8hpp.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/agrad/fwd/operators/operator_less_than.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
operator_less_than.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T >
bool stan::agrad::operator< (const fvar< T > &x, double y)
 
template<typename T >
bool stan::agrad::operator< (double x, const fvar< T > &y)
 
template<typename T >
bool stan::agrad::operator< (const fvar< T > &x, const fvar< T > &y)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2operators_2operator__less__than_8hpp_source.html b/doc/api/html/fwd_2operators_2operator__less__than_8hpp_source.html new file mode 100644 index 00000000000..d1893be6f98 --- /dev/null +++ b/doc/api/html/fwd_2operators_2operator__less__than_8hpp_source.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/agrad/fwd/operators/operator_less_than.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operator_less_than.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__OPERATORS__OPERATOR_LESS_THAN_HPP__
+
2 #define __STAN__AGRAD__FWD__OPERATORS__OPERATOR_LESS_THAN_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 
+
7 namespace stan {
+
8 
+
9  namespace agrad {
+
10 
+
11  template <typename T>
+
12  inline bool operator<(const fvar<T>& x,
+
13  double y) {
+
14  return x.val_ < y;
+
15  }
+
16 
+
17  template <typename T>
+
18  inline bool operator<(double x,
+
19  const fvar<T>& y) {
+
20  return x < y.val_;
+
21  }
+
22 
+
23  template <typename T>
+
24  inline bool operator<(const fvar<T>& x,
+
25  const fvar<T>& y) {
+
26  return x.val_ < y.val_;
+
27  }
+
28  }
+
29 }
+
30 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2operators_2operator__less__than__or__equal_8hpp.html b/doc/api/html/fwd_2operators_2operator__less__than__or__equal_8hpp.html new file mode 100644 index 00000000000..1cad15c07f6 --- /dev/null +++ b/doc/api/html/fwd_2operators_2operator__less__than__or__equal_8hpp.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/agrad/fwd/operators/operator_less_than_or_equal.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
operator_less_than_or_equal.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T >
bool stan::agrad::operator<= (const fvar< T > &x, const fvar< T > &y)
 
template<typename T >
bool stan::agrad::operator<= (const fvar< T > &x, double y)
 
template<typename T >
bool stan::agrad::operator<= (double x, const fvar< T > &y)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2operators_2operator__less__than__or__equal_8hpp_source.html b/doc/api/html/fwd_2operators_2operator__less__than__or__equal_8hpp_source.html new file mode 100644 index 00000000000..f880d356bab --- /dev/null +++ b/doc/api/html/fwd_2operators_2operator__less__than__or__equal_8hpp_source.html @@ -0,0 +1,140 @@ + + + + + +Stan: src/stan/agrad/fwd/operators/operator_less_than_or_equal.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operator_less_than_or_equal.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__OPERATORS__OPERATOR_LESS_THAN_OR_EQUAL_HPP__
+
2 #define __STAN__AGRAD__FWD__OPERATORS__OPERATOR_LESS_THAN_OR_EQUAL_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 
+
7 namespace stan {
+
8 
+
9  namespace agrad {
+
10 
+
11  template <typename T>
+
12  inline
+
13  bool
+
14  operator<=(const fvar<T>& x, const fvar<T>& y) {
+
15  return x.val_ <= y.val_;
+
16  }
+
17 
+
18  template <typename T>
+
19  inline
+
20  bool
+
21  operator<=(const fvar<T>& x, double y) {
+
22  return x.val_ <= y;
+
23  }
+
24 
+
25  template <typename T>
+
26  inline
+
27  bool
+
28  operator<=(double x, const fvar<T>& y) {
+
29  return x <= y.val_;
+
30  }
+
31  }
+
32 }
+
33 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2operators_2operator__multiplication_8hpp.html b/doc/api/html/fwd_2operators_2operator__multiplication_8hpp.html new file mode 100644 index 00000000000..076205f7159 --- /dev/null +++ b/doc/api/html/fwd_2operators_2operator__multiplication_8hpp.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/agrad/fwd/operators/operator_multiplication.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
operator_multiplication.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::operator* (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > stan::agrad::operator* (const double x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > stan::agrad::operator* (const fvar< T > &x1, const double x2)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2operators_2operator__multiplication_8hpp_source.html b/doc/api/html/fwd_2operators_2operator__multiplication_8hpp_source.html new file mode 100644 index 00000000000..794086b7b4f --- /dev/null +++ b/doc/api/html/fwd_2operators_2operator__multiplication_8hpp_source.html @@ -0,0 +1,141 @@ + + + + + +Stan: src/stan/agrad/fwd/operators/operator_multiplication.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operator_multiplication.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__OPERATORS__OPERATOR_MULTIPLICATION_HPP__
+
2 #define __STAN__AGRAD__FWD__OPERATORS__OPERATOR_MULTIPLICATION_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 
+
7 namespace stan {
+
8 
+
9  namespace agrad {
+
10 
+
11  template <typename T>
+
12  inline
+
13  fvar<T>
+
14  operator*(const fvar<T>& x1, const fvar<T>& x2) {
+
15  return fvar<T>(x1.val_ * x2.val_,
+
16  x1.d_ * x2.val_ + x1.val_ * x2.d_);
+
17  }
+
18 
+
19  template <typename T>
+
20  inline
+
21  fvar<T>
+
22  operator*(const double x1, const fvar<T>& x2) {
+
23  return fvar<T>(x1 * x2.val_, x1 * x2.d_);
+
24  }
+
25 
+
26  template <typename T>
+
27  inline
+
28  fvar<T>
+
29  operator*(const fvar<T>& x1, const double x2) {
+
30  return fvar<T>(x1.val_ * x2, x1.d_ * x2);
+
31  }
+
32  }
+
33 }
+
34 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2operators_2operator__not__equal_8hpp.html b/doc/api/html/fwd_2operators_2operator__not__equal_8hpp.html new file mode 100644 index 00000000000..afc10557518 --- /dev/null +++ b/doc/api/html/fwd_2operators_2operator__not__equal_8hpp.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/agrad/fwd/operators/operator_not_equal.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
operator_not_equal.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T >
bool stan::agrad::operator!= (const fvar< T > &x, const fvar< T > &y)
 
template<typename T >
bool stan::agrad::operator!= (const fvar< T > &x, double y)
 
template<typename T >
bool stan::agrad::operator!= (double x, const fvar< T > &y)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2operators_2operator__not__equal_8hpp_source.html b/doc/api/html/fwd_2operators_2operator__not__equal_8hpp_source.html new file mode 100644 index 00000000000..070faf1d190 --- /dev/null +++ b/doc/api/html/fwd_2operators_2operator__not__equal_8hpp_source.html @@ -0,0 +1,140 @@ + + + + + +Stan: src/stan/agrad/fwd/operators/operator_not_equal.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operator_not_equal.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__OPERATORS__OPERATOR_NOT_EQUAL_HPP__
+
2 #define __STAN__AGRAD__FWD__OPERATORS__OPERATOR_NOT_EQUAL_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 
+
7 namespace stan {
+
8 
+
9  namespace agrad {
+
10 
+
11  template <typename T>
+
12  inline
+
13  bool
+
14  operator!=(const fvar<T>& x, const fvar<T>& y) {
+
15  return x.val_ != y.val_;
+
16  }
+
17 
+
18  template <typename T>
+
19  inline
+
20  bool
+
21  operator!=(const fvar<T>& x, double y) {
+
22  return x.val_ != y;
+
23  }
+
24 
+
25  template <typename T>
+
26  inline
+
27  bool
+
28  operator!=(double x, const fvar<T>& y) {
+
29  return x != y.val_;
+
30  }
+
31  }
+
32 }
+
33 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2operators_2operator__subtraction_8hpp.html b/doc/api/html/fwd_2operators_2operator__subtraction_8hpp.html new file mode 100644 index 00000000000..f42bb7b64c6 --- /dev/null +++ b/doc/api/html/fwd_2operators_2operator__subtraction_8hpp.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/agrad/fwd/operators/operator_subtraction.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
operator_subtraction.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::operator- (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > stan::agrad::operator- (const double x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > stan::agrad::operator- (const fvar< T > &x1, const double x2)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2operators_2operator__subtraction_8hpp_source.html b/doc/api/html/fwd_2operators_2operator__subtraction_8hpp_source.html new file mode 100644 index 00000000000..f4cf42e2713 --- /dev/null +++ b/doc/api/html/fwd_2operators_2operator__subtraction_8hpp_source.html @@ -0,0 +1,140 @@ + + + + + +Stan: src/stan/agrad/fwd/operators/operator_subtraction.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operator_subtraction.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__OPERATORS__OPERATOR_SUBTRACTION_HPP__
+
2 #define __STAN__AGRAD__FWD__OPERATORS__OPERATOR_SUBTRACTION_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 
+
7 namespace stan {
+
8 
+
9  namespace agrad {
+
10 
+
11  template <typename T>
+
12  inline
+
13  fvar<T>
+
14  operator-(const fvar<T>& x1, const fvar<T>& x2) {
+
15  return fvar<T>(x1.val_ - x2.val_, x1.d_ - x2.d_);
+
16  }
+
17 
+
18  template <typename T>
+
19  inline
+
20  fvar<T>
+
21  operator-(const double x1, const fvar<T>& x2) {
+
22  return fvar<T>(x1 - x2.val_, -x2.d_);
+
23  }
+
24 
+
25  template <typename T>
+
26  inline
+
27  fvar<T>
+
28  operator-(const fvar<T>& x1, const double x2) {
+
29  return fvar<T>(x1.val_ - x2, x1.d_);
+
30  }
+
31  }
+
32 }
+
33 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2operators_8hpp.html b/doc/api/html/fwd_2operators_8hpp.html new file mode 100644 index 00000000000..ae593df4411 --- /dev/null +++ b/doc/api/html/fwd_2operators_8hpp.html @@ -0,0 +1,120 @@ + + + + + +Stan: src/stan/agrad/fwd/operators.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operators.hpp File Reference
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_2operators_8hpp_source.html b/doc/api/html/fwd_2operators_8hpp_source.html new file mode 100644 index 00000000000..9a7294c9c7e --- /dev/null +++ b/doc/api/html/fwd_2operators_8hpp_source.html @@ -0,0 +1,123 @@ + + + + + +Stan: src/stan/agrad/fwd/operators.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operators.hpp
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_8hpp.html b/doc/api/html/fwd_8hpp.html new file mode 100644 index 00000000000..d6263435126 --- /dev/null +++ b/doc/api/html/fwd_8hpp.html @@ -0,0 +1,113 @@ + + + + + +Stan: src/stan/agrad/fwd.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
fwd.hpp File Reference
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/fwd_8hpp_source.html b/doc/api/html/fwd_8hpp_source.html new file mode 100644 index 00000000000..54e59c3ce06 --- /dev/null +++ b/doc/api/html/fwd_8hpp_source.html @@ -0,0 +1,117 @@ + + + + + +Stan: src/stan/agrad/fwd.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
fwd.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD_HPP__
+
2 #define __STAN__AGRAD__FWD_HPP__
+
3 
+
4 //fvar
+ + + + +
9 
+
10 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/gamma_8hpp.html b/doc/api/html/gamma_8hpp.html new file mode 100644 index 00000000000..ff42f16301a --- /dev/null +++ b/doc/api/html/gamma_8hpp.html @@ -0,0 +1,161 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/gamma.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
gamma.hpp File Reference
+
+
+
#include <boost/random/gamma_distribution.hpp>
+#include <boost/random/variate_generator.hpp>
+#include <stan/agrad/partials_vari.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/math/constants.hpp>
+#include <stan/math/functions/multiply_log.hpp>
+#include <stan/math/functions/value_of.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/prob/constants.hpp>
+#include <stan/prob/traits.hpp>
+#include <stan/prob/internal_math.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + + + + + + + + +

+Functions

template<bool propto, typename T_y , typename T_shape , typename T_inv_scale >
return_type< T_y, T_shape,
+T_inv_scale >::type 
stan::prob::gamma_log (const T_y &y, const T_shape &alpha, const T_inv_scale &beta)
 The log of a gamma density for y with the specified shape and inverse scale parameters.
 
template<typename T_y , typename T_shape , typename T_inv_scale >
return_type< T_y, T_shape,
+T_inv_scale >::type 
stan::prob::gamma_log (const T_y &y, const T_shape &alpha, const T_inv_scale &beta)
 
template<typename T_y , typename T_shape , typename T_inv_scale >
return_type< T_y, T_shape,
+T_inv_scale >::type 
stan::prob::gamma_cdf (const T_y &y, const T_shape &alpha, const T_inv_scale &beta)
 The cumulative density function for a gamma distribution for y with the specified shape and inverse scale parameters.
 
template<typename T_y , typename T_shape , typename T_inv_scale >
return_type< T_y, T_shape,
+T_inv_scale >::type 
stan::prob::gamma_cdf_log (const T_y &y, const T_shape &alpha, const T_inv_scale &beta)
 
template<typename T_y , typename T_shape , typename T_inv_scale >
return_type< T_y, T_shape,
+T_inv_scale >::type 
stan::prob::gamma_ccdf_log (const T_y &y, const T_shape &alpha, const T_inv_scale &beta)
 
template<class RNG >
double stan::prob::gamma_rng (const double alpha, const double beta, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/gamma_8hpp_source.html b/doc/api/html/gamma_8hpp_source.html new file mode 100644 index 00000000000..af6cb0f9145 --- /dev/null +++ b/doc/api/html/gamma_8hpp_source.html @@ -0,0 +1,637 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/gamma.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
gamma.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS__GAMMA_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS__GAMMA_HPP__
+
3 
+
4 #include <boost/random/gamma_distribution.hpp>
+
5 #include <boost/random/variate_generator.hpp>
+
6 
+ + + + + +
12 #include <stan/meta/traits.hpp>
+
13 #include <stan/prob/constants.hpp>
+
14 #include <stan/prob/traits.hpp>
+ +
16 
+
17 namespace stan {
+
18 
+
19  namespace prob {
+
20 
+
43  template <bool propto,
+
44  typename T_y, typename T_shape, typename T_inv_scale>
+
45  typename return_type<T_y,T_shape,T_inv_scale>::type
+
46  gamma_log(const T_y& y, const T_shape& alpha, const T_inv_scale& beta) {
+
47  static const char* function = "stan::prob::gamma_log(%1%)";
+
48 
+ + + + + + + +
56 
+
57  // check if any vectors are zero length
+
58  if (!(stan::length(y)
+
59  && stan::length(alpha)
+
60  && stan::length(beta)))
+
61  return 0.0;
+
62 
+
63  // set up return value accumulator
+
64  double logp(0.0);
+
65 
+
66  // validate args (here done over var, which should be OK)
+
67  if (!check_not_nan(function, y, "Random variable", &logp))
+
68  return logp;
+
69  if (!check_finite(function, alpha, "Shape parameter",
+
70  &logp))
+
71  return logp;
+
72  if (!check_positive(function, alpha, "Shape parameter",
+
73  &logp))
+
74  return logp;
+
75  if (!check_finite(function, beta, "Inverse scale parameter",
+
76  &logp))
+
77  return logp;
+
78  if (!check_positive(function, beta, "Inverse scale parameter",
+
79  &logp))
+
80  return logp;
+
81  if (!(check_consistent_sizes(function,
+
82  y,alpha,beta,
+
83  "Random variable","Shape parameter","Inverse scale parameter",
+
84  &logp)))
+
85  return logp;
+
86 
+
87  // check if no variables are involved and prop-to
+ +
89  return 0.0;
+
90 
+
91  // set up template expressions wrapping scalars into vector views
+
92  VectorView<const T_y> y_vec(y);
+
93  VectorView<const T_shape> alpha_vec(alpha);
+
94  VectorView<const T_inv_scale> beta_vec(beta);
+
95 
+
96  for (size_t n = 0; n < length(y); n++) {
+
97  const double y_dbl = value_of(y_vec[n]);
+
98  if (y_dbl < 0)
+
99  return LOG_ZERO;
+
100  }
+
101 
+
102  size_t N = max_size(y, alpha, beta);
+
103  agrad::OperandsAndPartials<T_y, T_shape, T_inv_scale> operands_and_partials(y, alpha, beta);
+
104 
+
105  using boost::math::lgamma;
+ +
107  using boost::math::digamma;
+
108 
+ +
110  log_y(length(y));
+ +
112  for(size_t n = 0; n < length(y); n++) {
+
113  if (value_of(y_vec[n]) > 0)
+
114  log_y[n] = log(value_of(y_vec[n]));
+
115  }
+
116 
+ +
118  lgamma_alpha(length(alpha));
+ +
120  digamma_alpha(length(alpha));
+
121  for (size_t n = 0; n < length(alpha); n++) {
+ +
123  lgamma_alpha[n] = lgamma(value_of(alpha_vec[n]));
+ +
125  digamma_alpha[n] = digamma(value_of(alpha_vec[n]));
+
126  }
+
127 
+ +
129  log_beta(length(beta));
+ +
131  for (size_t n = 0; n < length(beta); n++)
+
132  log_beta[n] = log(value_of(beta_vec[n]));
+
133 
+
134  for (size_t n = 0; n < N; n++) {
+
135  // pull out values of arguments
+
136  const double y_dbl = value_of(y_vec[n]);
+
137  const double alpha_dbl = value_of(alpha_vec[n]);
+
138  const double beta_dbl = value_of(beta_vec[n]);
+
139 
+ +
141  logp -= lgamma_alpha[n];
+ +
143  logp += alpha_dbl * log_beta[n];
+ +
145  logp += (alpha_dbl-1.0) * log_y[n];
+ +
147  logp -= beta_dbl * y_dbl;
+
148 
+
149  // gradients
+ +
151  operands_and_partials.d_x1[n] += (alpha_dbl-1)/y_dbl - beta_dbl;
+ +
153  operands_and_partials.d_x2[n] += -digamma_alpha[n] + log_beta[n] + log_y[n];
+ +
155  operands_and_partials.d_x3[n] += alpha_dbl / beta_dbl - y_dbl;
+
156  }
+
157  return operands_and_partials.to_var(logp);
+
158  }
+
159 
+
160  template <typename T_y, typename T_shape, typename T_inv_scale>
+
161  inline
+ +
163  gamma_log(const T_y& y, const T_shape& alpha, const T_inv_scale& beta) {
+
164  return gamma_log<false>(y,alpha,beta);
+
165  }
+
166 
+
167 
+
182  template <typename T_y, typename T_shape, typename T_inv_scale>
+ +
184  gamma_cdf(const T_y& y, const T_shape& alpha, const T_inv_scale& beta) {
+
185  // Size checks
+
186  if (!(stan::length(y) && stan::length(alpha) && stan::length(beta)))
+
187  return 1.0;
+
188 
+
189  // Error checks
+
190  static const char* function = "stan::prob::gamma_cdf(%1%)";
+
191 
+ + + + + + + +
199  using stan::math::value_of;
+
200  using boost::math::tools::promote_args;
+
201 
+
202  double P(1.0);
+
203 
+
204  if (!check_finite(function, alpha, "Shape parameter", &P))
+
205  return P;
+
206  if (!check_positive(function, alpha, "Shape parameter", &P))
+
207  return P;
+
208  if (!check_finite(function, beta, "Scale parameter", &P))
+
209  return P;
+
210  if (!check_positive(function, beta, "Scale parameter", &P))
+
211  return P;
+
212  if (!check_not_nan(function, y, "Random variable", &P))
+
213  return P;
+
214  if (!check_nonnegative(function, y, "Random variable", &P))
+
215  return P;
+
216  if (!(check_consistent_sizes(function, y, alpha, beta,
+
217  "Random variable", "Shape parameter",
+
218  "Scale Parameter",
+
219  &P)))
+
220  return P;
+
221 
+
222  // Wrap arguments in vectors
+
223  VectorView<const T_y> y_vec(y);
+
224  VectorView<const T_shape> alpha_vec(alpha);
+
225  VectorView<const T_inv_scale> beta_vec(beta);
+
226  size_t N = max_size(y, alpha, beta);
+
227 
+ +
229  operands_and_partials(y, alpha, beta);
+
230 
+
231  // Explicit return for extreme values
+
232  // The gradients are technically ill-defined, but treated as zero
+
233 
+
234  for (size_t i = 0; i < stan::length(y); i++) {
+
235  if (value_of(y_vec[i]) == 0)
+
236  return operands_and_partials.to_var(0.0);
+
237  }
+
238 
+
239  // Compute CDF and its gradients
+
240  using boost::math::gamma_p_derivative;
+
241  using boost::math::gamma_p;
+
242  using boost::math::digamma;
+
243  using boost::math::tgamma;
+
244 
+
245  // Cache a few expensive function calls if nu is a parameter
+ + +
248  gamma_vec(stan::length(alpha));
+ + +
251  digamma_vec(stan::length(alpha));
+
252 
+ +
254  for (size_t i = 0; i < stan::length(alpha); i++) {
+
255  const double alpha_dbl = value_of(alpha_vec[i]);
+
256  gamma_vec[i] = tgamma(alpha_dbl);
+
257  digamma_vec[i] = digamma(alpha_dbl);
+
258  }
+
259  }
+
260 
+
261  // Compute vectorized CDF and gradient
+
262  for (size_t n = 0; n < N; n++) {
+
263  // Explicit results for extreme values
+
264  // The gradients are technically ill-defined, but treated as zero
+
265  if (value_of(y_vec[n]) == std::numeric_limits<double>::infinity())
+
266  continue;
+
267 
+
268  // Pull out values
+
269  const double y_dbl = value_of(y_vec[n]);
+
270  const double alpha_dbl = value_of(alpha_vec[n]);
+
271  const double beta_dbl = value_of(beta_vec[n]);
+
272 
+
273  // Compute
+
274  const double Pn = gamma_p(alpha_dbl, beta_dbl * y_dbl);
+
275 
+
276  P *= Pn;
+
277 
+ +
279  operands_and_partials.d_x1[n]
+
280  += beta_dbl * gamma_p_derivative(alpha_dbl, beta_dbl * y_dbl)
+
281  / Pn;
+ +
283  operands_and_partials.d_x2[n]
+
284  -= stan::math::gradRegIncGamma(alpha_dbl, beta_dbl
+
285  * y_dbl, gamma_vec[n],
+
286  digamma_vec[n]) / Pn;
+ +
288  operands_and_partials.d_x3[n]
+
289  += y_dbl * gamma_p_derivative(alpha_dbl, beta_dbl * y_dbl) / Pn;
+
290  }
+
291 
+ +
293  for (size_t n = 0; n < stan::length(y); ++n)
+
294  operands_and_partials.d_x1[n] *= P;
+ +
296  for (size_t n = 0; n < stan::length(alpha); ++n)
+
297  operands_and_partials.d_x2[n] *= P;
+ +
299  for (size_t n = 0; n < stan::length(beta); ++n)
+
300  operands_and_partials.d_x3[n] *= P;
+
301 
+
302  return operands_and_partials.to_var(P);
+
303  }
+
304 
+
305  template <typename T_y, typename T_shape, typename T_inv_scale>
+ +
307  gamma_cdf_log(const T_y& y, const T_shape& alpha, const T_inv_scale& beta) {
+
308  // Size checks
+
309  if (!(stan::length(y) && stan::length(alpha) && stan::length(beta)))
+
310  return 0.0;
+
311 
+
312  // Error checks
+
313  static const char* function = "stan::prob::gamma_cdf_log(%1%)";
+
314 
+ + + + + + + +
322  using stan::math::value_of;
+
323  using boost::math::tools::promote_args;
+
324 
+
325  double P(0.0);
+
326 
+
327  if (!check_finite(function, alpha, "Shape parameter", &P))
+
328  return P;
+
329  if (!check_positive(function, alpha, "Shape parameter", &P))
+
330  return P;
+
331  if (!check_finite(function, beta, "Scale parameter", &P))
+
332  return P;
+
333  if (!check_positive(function, beta, "Scale parameter", &P))
+
334  return P;
+
335  if (!check_not_nan(function, y, "Random variable", &P))
+
336  return P;
+
337  if (!check_nonnegative(function, y, "Random variable", &P))
+
338  return P;
+
339  if (!(check_consistent_sizes(function, y, alpha, beta,
+
340  "Random variable", "Shape parameter",
+
341  "Scale Parameter",
+
342  &P)))
+
343  return P;
+
344 
+
345  // Wrap arguments in vectors
+
346  VectorView<const T_y> y_vec(y);
+
347  VectorView<const T_shape> alpha_vec(alpha);
+
348  VectorView<const T_inv_scale> beta_vec(beta);
+
349  size_t N = max_size(y, alpha, beta);
+
350 
+ +
352  operands_and_partials(y, alpha, beta);
+
353 
+
354  // Explicit return for extreme values
+
355  // The gradients are technically ill-defined, but treated as zero
+
356 
+
357  for (size_t i = 0; i < stan::length(y); i++) {
+
358  if (value_of(y_vec[i]) == 0)
+
359  return operands_and_partials.to_var(stan::math::negative_infinity());
+
360  }
+
361 
+
362  // Compute cdf_log and its gradients
+
363  using boost::math::gamma_p_derivative;
+
364  using boost::math::gamma_p;
+
365  using boost::math::digamma;
+
366  using boost::math::tgamma;
+
367 
+
368  // Cache a few expensive function calls if nu is a parameter
+ + +
371  gamma_vec(stan::length(alpha));
+ + +
374  digamma_vec(stan::length(alpha));
+
375 
+ +
377  for (size_t i = 0; i < stan::length(alpha); i++) {
+
378  const double alpha_dbl = value_of(alpha_vec[i]);
+
379  gamma_vec[i] = tgamma(alpha_dbl);
+
380  digamma_vec[i] = digamma(alpha_dbl);
+
381  }
+
382  }
+
383 
+
384  // Compute vectorized cdf_log and gradient
+
385  for (size_t n = 0; n < N; n++) {
+
386  // Explicit results for extreme values
+
387  // The gradients are technically ill-defined, but treated as zero
+
388  if (value_of(y_vec[n]) == std::numeric_limits<double>::infinity())
+
389  return operands_and_partials.to_var(0.0);
+
390 
+
391  // Pull out values
+
392  const double y_dbl = value_of(y_vec[n]);
+
393  const double alpha_dbl = value_of(alpha_vec[n]);
+
394  const double beta_dbl = value_of(beta_vec[n]);
+
395 
+
396  // Compute
+
397  const double Pn = gamma_p(alpha_dbl, beta_dbl * y_dbl);
+
398 
+
399  P += log(Pn);
+
400 
+ +
402  operands_and_partials.d_x1[n]
+
403  += beta_dbl * gamma_p_derivative(alpha_dbl, beta_dbl * y_dbl)
+
404  / Pn;
+ +
406  operands_and_partials.d_x2[n]
+
407  -= stan::math::gradRegIncGamma(alpha_dbl, beta_dbl
+
408  * y_dbl, gamma_vec[n],
+
409  digamma_vec[n]) / Pn;
+ +
411  operands_and_partials.d_x3[n]
+
412  += y_dbl * gamma_p_derivative(alpha_dbl, beta_dbl * y_dbl) / Pn;
+
413  }
+
414 
+
415  return operands_and_partials.to_var(P);
+
416  }
+
417 
+
418  template <typename T_y, typename T_shape, typename T_inv_scale>
+ +
420  gamma_ccdf_log(const T_y& y, const T_shape& alpha, const T_inv_scale& beta) {
+
421  // Size checks
+
422  if (!(stan::length(y) && stan::length(alpha) && stan::length(beta)))
+
423  return 0.0;
+
424 
+
425  // Error checks
+
426  static const char* function = "stan::prob::gamma_ccdf_log(%1%)";
+
427 
+ + + + + + + +
435  using stan::math::value_of;
+
436  using boost::math::tools::promote_args;
+
437 
+
438  double P(0.0);
+
439 
+
440  if (!check_finite(function, alpha, "Shape parameter", &P))
+
441  return P;
+
442  if (!check_positive(function, alpha, "Shape parameter", &P))
+
443  return P;
+
444  if (!check_finite(function, beta, "Scale parameter", &P))
+
445  return P;
+
446  if (!check_positive(function, beta, "Scale parameter", &P))
+
447  return P;
+
448  if (!check_not_nan(function, y, "Random variable", &P))
+
449  return P;
+
450  if (!check_nonnegative(function, y, "Random variable", &P))
+
451  return P;
+
452  if (!(check_consistent_sizes(function, y, alpha, beta,
+
453  "Random variable", "Shape parameter",
+
454  "Scale Parameter",
+
455  &P)))
+
456  return P;
+
457 
+
458  // Wrap arguments in vectors
+
459  VectorView<const T_y> y_vec(y);
+
460  VectorView<const T_shape> alpha_vec(alpha);
+
461  VectorView<const T_inv_scale> beta_vec(beta);
+
462  size_t N = max_size(y, alpha, beta);
+
463 
+ +
465  operands_and_partials(y, alpha, beta);
+
466 
+
467  // Explicit return for extreme values
+
468  // The gradients are technically ill-defined, but treated as zero
+
469 
+
470  for (size_t i = 0; i < stan::length(y); i++) {
+
471  if (value_of(y_vec[i]) == 0)
+
472  return operands_and_partials.to_var(0.0);
+
473  }
+
474 
+
475  // Compute ccdf_log and its gradients
+
476  using boost::math::gamma_p_derivative;
+
477  using boost::math::gamma_p;
+
478  using boost::math::digamma;
+
479  using boost::math::tgamma;
+
480 
+
481  // Cache a few expensive function calls if nu is a parameter
+ + +
484  gamma_vec(stan::length(alpha));
+ + +
487  digamma_vec(stan::length(alpha));
+
488 
+ +
490  for (size_t i = 0; i < stan::length(alpha); i++) {
+
491  const double alpha_dbl = value_of(alpha_vec[i]);
+
492  gamma_vec[i] = tgamma(alpha_dbl);
+
493  digamma_vec[i] = digamma(alpha_dbl);
+
494  }
+
495  }
+
496 
+
497  // Compute vectorized ccdf_log and gradient
+
498  for (size_t n = 0; n < N; n++) {
+
499  // Explicit results for extreme values
+
500  // The gradients are technically ill-defined, but treated as zero
+
501  if (value_of(y_vec[n]) == std::numeric_limits<double>::infinity())
+
502  return operands_and_partials.to_var(stan::math::negative_infinity());
+
503 
+
504  // Pull out values
+
505  const double y_dbl = value_of(y_vec[n]);
+
506  const double alpha_dbl = value_of(alpha_vec[n]);
+
507  const double beta_dbl = value_of(beta_vec[n]);
+
508 
+
509  // Compute
+
510  const double Pn = 1.0 - gamma_p(alpha_dbl, beta_dbl * y_dbl);
+
511 
+
512  P += log(Pn);
+
513 
+ +
515  operands_and_partials.d_x1[n]
+
516  -= beta_dbl * gamma_p_derivative(alpha_dbl, beta_dbl * y_dbl)
+
517  / Pn;
+ +
519  operands_and_partials.d_x2[n]
+
520  += stan::math::gradRegIncGamma(alpha_dbl, beta_dbl
+
521  * y_dbl, gamma_vec[n],
+
522  digamma_vec[n]) / Pn;
+ +
524  operands_and_partials.d_x3[n]
+
525  -= y_dbl * gamma_p_derivative(alpha_dbl, beta_dbl * y_dbl) / Pn;
+
526  }
+
527 
+
528  return operands_and_partials.to_var(P);
+
529  }
+
530 
+
531  template <class RNG>
+
532  inline double
+
533  gamma_rng(const double alpha,
+
534  const double beta,
+
535  RNG& rng) {
+
536  using boost::variate_generator;
+
537  using boost::gamma_distribution;
+
538 
+
539  static const char* function = "stan::prob::gamma_rng(%1%)";
+
540 
+ + +
543 
+
544  if (!check_finite(function, alpha, "Shape parameter"))
+
545  return 0;
+
546  if (!check_positive(function, alpha, "Shape parameter"))
+
547  return 0;
+
548  if (!check_finite(function, beta, "Inverse scale parameter"))
+
549  return 0;
+
550  if (!check_positive(function, beta, "Inverse scale parameter"))
+
551  return 0;
+
552 
+
553  /*
+
554  the boost gamma distribution is defined by
+
555  shape and scale, whereas the stan one is defined
+
556  by shape and rate
+
557  */
+
558  variate_generator<RNG&, gamma_distribution<> >
+
559  gamma_rng(rng, gamma_distribution<>(alpha, 1.0 / beta));
+
560  return gamma_rng();
+
561  }
+
562 
+
563  }
+
564 }
+
565 
+
566 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/gaussian__dlm__obs_8hpp.html b/doc/api/html/gaussian__dlm__obs_8hpp.html new file mode 100644 index 00000000000..5dddb4970da --- /dev/null +++ b/doc/api/html/gaussian__dlm__obs_8hpp.html @@ -0,0 +1,174 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/continuous/gaussian_dlm_obs.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
gaussian_dlm_obs.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + + +

+Functions

template<bool propto, typename T_y , typename T_F , typename T_G , typename T_V , typename T_W , typename T_m0 , typename T_C0 >
return_type< T_y, typename
+return_type< T_F, T_G, T_V,
+T_W, T_m0, T_C0 >::type >
+::type 
stan::prob::gaussian_dlm_obs_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_F, Eigen::Dynamic, Eigen::Dynamic > &F, const Eigen::Matrix< T_G, Eigen::Dynamic, Eigen::Dynamic > &G, const Eigen::Matrix< T_V, Eigen::Dynamic, Eigen::Dynamic > &V, const Eigen::Matrix< T_W, Eigen::Dynamic, Eigen::Dynamic > &W, const Eigen::Matrix< T_m0, Eigen::Dynamic, 1 > &m0, const Eigen::Matrix< T_C0, Eigen::Dynamic, Eigen::Dynamic > &C0)
 The log of a Gaussian dynamic linear model (GDLM).
 
template<typename T_y , typename T_F , typename T_G , typename T_V , typename T_W , typename T_m0 , typename T_C0 >
return_type< T_y, typename
+return_type< T_F, T_G, T_V,
+T_W, T_m0, T_C0 >::type >
+::type 
stan::prob::gaussian_dlm_obs_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_F, Eigen::Dynamic, Eigen::Dynamic > &F, const Eigen::Matrix< T_G, Eigen::Dynamic, Eigen::Dynamic > &G, const Eigen::Matrix< T_V, Eigen::Dynamic, Eigen::Dynamic > &V, const Eigen::Matrix< T_W, Eigen::Dynamic, Eigen::Dynamic > &W, const Eigen::Matrix< T_m0, Eigen::Dynamic, 1 > &m0, const Eigen::Matrix< T_C0, Eigen::Dynamic, Eigen::Dynamic > &C0)
 
template<bool propto, typename T_y , typename T_F , typename T_G , typename T_V , typename T_W , typename T_m0 , typename T_C0 >
return_type< T_y, typename
+return_type< T_F, T_G, T_V,
+T_W, T_m0, T_C0 >::type >
+::type 
stan::prob::gaussian_dlm_obs_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_F, Eigen::Dynamic, Eigen::Dynamic > &F, const Eigen::Matrix< T_G, Eigen::Dynamic, Eigen::Dynamic > &G, const Eigen::Matrix< T_V, Eigen::Dynamic, 1 > &V, const Eigen::Matrix< T_W, Eigen::Dynamic, Eigen::Dynamic > &W, const Eigen::Matrix< T_m0, Eigen::Dynamic, 1 > &m0, const Eigen::Matrix< T_C0, Eigen::Dynamic, Eigen::Dynamic > &C0)
 The log of a Gaussian dynamic linear model (GDLM) with uncorrelated observation disturbances.
 
template<typename T_y , typename T_F , typename T_G , typename T_V , typename T_W , typename T_m0 , typename T_C0 >
return_type< T_y, typename
+return_type< T_F, T_G, T_V,
+T_W, T_m0, T_C0 >::type >
+::type 
stan::prob::gaussian_dlm_obs_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_F, Eigen::Dynamic, Eigen::Dynamic > &F, const Eigen::Matrix< T_G, Eigen::Dynamic, Eigen::Dynamic > &G, const Eigen::Matrix< T_V, Eigen::Dynamic, 1 > &V, const Eigen::Matrix< T_W, Eigen::Dynamic, Eigen::Dynamic > &W, const Eigen::Matrix< T_m0, Eigen::Dynamic, 1 > &m0, const Eigen::Matrix< T_C0, Eigen::Dynamic, Eigen::Dynamic > &C0)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/gaussian__dlm__obs_8hpp_source.html b/doc/api/html/gaussian__dlm__obs_8hpp_source.html new file mode 100644 index 00000000000..ce454cb62c6 --- /dev/null +++ b/doc/api/html/gaussian__dlm__obs_8hpp_source.html @@ -0,0 +1,548 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/continuous/gaussian_dlm_obs.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
gaussian_dlm_obs.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__MULTIVARIATE__CONTINUOUS__GAUSSIAN_DLM_OBS_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__MULTIVARIATE__CONTINUOUS__GAUSSIAN_DLM_OBS_HPP__
+
3 
+
4 #include <boost/random/normal_distribution.hpp>
+
5 #include <boost/random/variate_generator.hpp>
+
6 
+ + + +
10 #include <stan/prob/constants.hpp>
+
11 #include <stan/prob/traits.hpp>
+
12 #include <stan/agrad/rev.hpp>
+
13 #include <stan/meta/traits.hpp>
+ + +
16 
+
17 #include <stan/math/matrix/add.hpp>
+ + + +
21 #include <stan/math/matrix/log.hpp>
+ + + + + + + +
29 
+
30 /*
+
31  TODO: time-varying system matrices
+
32  TODO: use sequential processing even for non-diagonal obs
+
33  covariance.
+
34  TODO: add constant terms in observation.
+
35  */
+
36 
+
37 namespace stan {
+
38  namespace prob {
+
72  template <bool propto,
+
73  typename T_y,
+
74  typename T_F, typename T_G,
+
75  typename T_V, typename T_W,
+
76  typename T_m0, typename T_C0
+
77  >
+
78  typename return_type<
+
79  T_y,
+
80  typename return_type<T_F,T_G,T_V,T_W,T_m0,T_C0>::type >::type
+
81  gaussian_dlm_obs_log(const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& y,
+
82  const Eigen::Matrix<T_F,Eigen::Dynamic,Eigen::Dynamic>& F,
+
83  const Eigen::Matrix<T_G,Eigen::Dynamic,Eigen::Dynamic>& G,
+
84  const Eigen::Matrix<T_V,Eigen::Dynamic,Eigen::Dynamic>& V,
+
85  const Eigen::Matrix<T_W,Eigen::Dynamic,Eigen::Dynamic>& W,
+
86  const Eigen::Matrix<T_m0,Eigen::Dynamic,1>& m0,
+
87  const Eigen::Matrix<T_C0,Eigen::Dynamic,Eigen::Dynamic>& C0) {
+
88  static const char* function = "stan::prob::gaussian_dlm_obs_log(%1%)";
+
89  typedef typename return_type<
+
90  T_y,
+ +
92  T_lp lp(0.0);
+
93 
+
94  using stan::math::add;
+ + + + + + + +
102  using stan::math::multiply;
+ +
104  using stan::math::subtract;
+ +
106  using stan::math::transpose;
+
107 
+
108  int r = y.rows(); // number of variables
+
109  int T = y.cols(); // number of observations
+
110  int n = G.rows(); // number of states
+
111 
+
112  // check y
+
113  if (!check_finite(function, y, "y", &lp))
+
114  return lp;
+
115  if (!check_not_nan(function, y, "y", &lp))
+
116  return lp;
+
117  // check F
+
118  if (!check_size_match(function,
+
119  F.cols(), "columns of F",
+
120  y.rows(), "rows of y",
+
121  &lp))
+
122  return lp;
+
123  if (!check_size_match(function,
+
124  F.rows(), "rows of F",
+
125  G.rows(), "rows of G",
+
126  &lp))
+
127  return lp;
+
128  if (!check_finite(function, F, "F", &lp))
+
129  return lp;
+
130  if (!check_not_nan(function, F, "F", &lp))
+
131  return lp;
+
132  // check G
+
133  if (!check_size_match(function,
+
134  G.rows(), "rows of G",
+
135  G.cols(), "columns of G",
+
136  &lp))
+
137  return lp;
+
138  if (!check_finite(function, G, "G", &lp))
+
139  return lp;
+
140  if (!check_not_nan(function, G, "G", &lp))
+
141  return lp;
+
142  // check V
+
143  if (!check_size_match(function,
+
144  V.rows(), "rows of V",
+
145  y.rows(), "rows of y",
+
146  &lp))
+
147  return lp;
+
148  // TODO: incorporate support for infinite V
+
149  if (!check_finite(function, V, "V", &lp))
+
150  return lp;
+
151  if (!check_not_nan(function, V, "V", &lp))
+
152  return lp;
+
153  if (!check_spsd_matrix(function, V, "V", &lp))
+
154  return lp;
+
155  // check W
+
156  if (!check_size_match(function,
+
157  W.rows(), "rows of W",
+
158  G.rows(), "rows of G",
+
159  &lp))
+
160  return lp;
+
161  // TODO: incorporate support for infinite W
+
162  if (!check_finite(function, W, "W", &lp))
+
163  return lp;
+
164  if (!check_not_nan(function, W, "W", &lp))
+
165  return lp;
+
166  if (!check_spsd_matrix(function, W, "W", &lp))
+
167  return lp;
+
168  // check m0
+
169  if (!check_size_match(function,
+
170  m0.size(), "size of m0",
+
171  G.rows(), "rows of G",
+
172  &lp))
+
173  return lp;
+
174  if (!check_finite(function, m0, "m0", &lp))
+
175  return lp;
+
176  if (!check_not_nan(function, m0, "m0", &lp))
+
177  return lp;
+
178  // check C0
+
179  if (!check_size_match(function,
+
180  C0.rows(), "rows of C0",
+
181  G.rows(), "rows of G",
+
182  &lp))
+
183  return lp;
+
184  if (!check_cov_matrix(function, C0, "C0", &lp))
+
185  return lp;
+
186  if (!check_finite(function, C0, "C0", &lp))
+
187  return lp;
+
188  if (!check_not_nan(function, C0, "C0", &lp))
+
189  return lp;
+
190 
+
191  if (y.cols() == 0 || y.rows() == 0)
+
192  return lp;
+
193 
+ +
195  lp -= 0.5 * LOG_TWO_PI * r * T;
+
196  }
+
197 
+ +
199  Eigen::Matrix<T_lp,Eigen::Dynamic, 1> m(n);
+
200  Eigen::Matrix<T_lp,Eigen::Dynamic, Eigen::Dynamic> C(n, n);
+
201 
+
202  // TODO: how to recast matrices
+
203  for (int i = 0; i < m0.size(); i ++ ) {
+
204  m(i) = m0(i);
+
205  }
+
206  for (int i = 0; i < C0.rows(); i ++ ) {
+
207  for (int j = 0; j < C0.cols(); j ++ ) {
+
208  C(i, j) = C0(i, j);
+
209  }
+
210  }
+
211 
+
212  Eigen::Matrix<typename return_type<T_y>::type,
+
213  Eigen::Dynamic, 1> yi(r);
+
214  Eigen::Matrix<T_lp,Eigen::Dynamic, 1> a(n);
+
215  Eigen::Matrix<T_lp,Eigen::Dynamic, Eigen::Dynamic> R(n, n);
+
216  Eigen::Matrix<T_lp,Eigen::Dynamic, 1> f(r);
+
217  Eigen::Matrix<T_lp,Eigen::Dynamic, Eigen::Dynamic> Q(r, r);
+
218  Eigen::Matrix<T_lp,Eigen::Dynamic, Eigen::Dynamic> Q_inv(r, r);
+
219  Eigen::Matrix<T_lp,Eigen::Dynamic, 1> e(r);
+
220  Eigen::Matrix<T_lp,Eigen::Dynamic, Eigen::Dynamic> A(n, r);
+
221 
+
222  for (int i = 0; i < y.cols(); i++) {
+
223  yi = y.col(i);
+
224  // // Predict state
+
225  // a_t = G_t m_{t-1}
+
226  a = multiply(G, m);
+
227  // R_t = G_t C_{t-1} G_t' + W_t
+
228  R = add(quad_form_sym(C, transpose(G)), W);
+
229  // // predict observation
+
230  // f_t = F_t' a_t
+
231  f = multiply(transpose(F), a);
+
232  // Q_t = F'_t R_t F_t + V_t
+
233  Q = add(quad_form_sym(R, F), V);
+
234  Q_inv = inverse_spd(Q);
+
235  // // filtered state
+
236  // e_t = y_t - f_t
+
237  e = subtract(yi, f);
+
238  // A_t = R_t F_t Q^{-1}_t
+
239  A = multiply(multiply(R, F), Q_inv);
+
240  // m_t = a_t + A_t e_t
+
241  m = add(a, multiply(A, e));
+
242  // C = R_t - A_t Q_t A_t'
+
243  C = subtract(R, quad_form_sym(Q, transpose(A)));
+
244  lp -= 0.5 * (log_determinant_spd(Q) + trace_quad_form(Q_inv, e));
+
245  }
+
246  }
+
247  return lp;
+
248  }
+
249 
+
250  template <typename T_y,
+
251  typename T_F, typename T_G,
+
252  typename T_V, typename T_W,
+
253  typename T_m0, typename T_C0
+
254  >
+
255  inline
+
256  typename return_type<
+
257  T_y,
+ +
259  gaussian_dlm_obs_log(const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& y,
+
260  const Eigen::Matrix<T_F,Eigen::Dynamic,Eigen::Dynamic>& F,
+
261  const Eigen::Matrix<T_G,Eigen::Dynamic,Eigen::Dynamic>& G,
+
262  const Eigen::Matrix<T_V,Eigen::Dynamic,Eigen::Dynamic>& V,
+
263  const Eigen::Matrix<T_W,Eigen::Dynamic,Eigen::Dynamic>& W,
+
264  const Eigen::Matrix<T_m0,Eigen::Dynamic,1>& m0,
+
265  const Eigen::Matrix<T_C0,Eigen::Dynamic,Eigen::Dynamic>& C0) {
+
266  return gaussian_dlm_obs_log<false>(y, F, G, V, W, m0, C0);
+
267  }
+
268 
+
304  template <bool propto,
+
305  typename T_y,
+
306  typename T_F, typename T_G,
+
307  typename T_V, typename T_W,
+
308  typename T_m0, typename T_C0
+
309  >
+
310  typename return_type<
+
311  T_y,
+ +
313  gaussian_dlm_obs_log(const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& y,
+
314  const Eigen::Matrix<T_F,Eigen::Dynamic,Eigen::Dynamic>& F,
+
315  const Eigen::Matrix<T_G,Eigen::Dynamic,Eigen::Dynamic>& G,
+
316  const Eigen::Matrix<T_V,Eigen::Dynamic,1>& V,
+
317  const Eigen::Matrix<T_W,Eigen::Dynamic,Eigen::Dynamic>& W,
+
318  const Eigen::Matrix<T_m0,Eigen::Dynamic,1>& m0,
+
319  const Eigen::Matrix<T_C0,Eigen::Dynamic,Eigen::Dynamic>& C0) {
+
320  static const char* function = "stan::prob::gaussian_dlm_obs_log(%1%)";
+
321  typedef typename return_type<
+
322  T_y,
+
323  typename return_type<T_F,T_G,T_V,T_W,T_m0,T_C0>::type >::type T_lp;
+
324  T_lp lp(0.0);
+
325 
+
326  using stan::math::add;
+ + + + + + + +
334  using stan::math::multiply;
+ +
336  using stan::math::subtract;
+ + +
339  using stan::math::transpose;
+
340 
+
341  int r = y.rows(); // number of variables
+
342  int T = y.cols(); // number of observations
+
343  int n = G.rows(); // number of states
+
344 
+
345  // check y
+
346  if (!check_finite(function, y, "y", &lp))
+
347  return lp;
+
348  if (!check_not_nan(function, y, "y", &lp))
+
349  return lp;
+
350  // check F
+
351  if (!check_size_match(function,
+
352  F.cols(), "columns of F",
+
353  y.rows(), "rows of y",
+
354  &lp))
+
355  return lp;
+
356  if (!check_size_match(function,
+
357  F.rows(), "rows of F",
+
358  G.rows(), "rows of G",
+
359  &lp))
+
360  return lp;
+
361  if (!check_finite(function, F, "F", &lp))
+
362  return lp;
+
363  if (!check_not_nan(function, F, "F", &lp))
+
364  return lp;
+
365  // check G
+
366  if (!check_size_match(function,
+
367  G.rows(), "rows of G",
+
368  G.cols(), "columns of G",
+
369  &lp))
+
370  return lp;
+
371  if (!check_finite(function, G, "G", &lp))
+
372  return lp;
+
373  if (!check_not_nan(function, G, "G", &lp))
+
374  return lp;
+
375  // check V
+
376  if (!check_nonnegative(function, V, "V", &lp))
+
377  return lp;
+
378  if (!check_size_match(function,
+
379  V.size(), "size of V",
+
380  y.rows(), "rows of y",
+
381  &lp))
+
382  return lp;
+
383  // TODO: support infinite V
+
384  if (!check_finite(function, V, "V", &lp))
+
385  return lp;
+
386  if (!check_not_nan(function, V, "V", &lp))
+
387  return lp;
+
388  // check W
+
389  if (!check_spsd_matrix(function, W, "W", &lp))
+
390  return lp;
+
391  if (!check_size_match(function,
+
392  W.rows(), "rows of W",
+
393  G.rows(), "rows of G",
+
394  &lp))
+
395  return lp;
+
396  // TODO: support infinite W
+
397  if (!check_finite(function, W, "W", &lp))
+
398  return lp;
+
399  if (!check_not_nan(function, W, "W", &lp))
+
400  return lp;
+
401  // check m0
+
402  if (!check_size_match(function,
+
403  m0.size(), "size of m0",
+
404  G.rows(), "rows of G",
+
405  &lp))
+
406  return lp;
+
407  if (!check_finite(function, m0, "m0", &lp))
+
408  return lp;
+
409  if (!check_not_nan(function, m0, "m0", &lp))
+
410  return lp;
+
411  // check C0
+
412  if (!check_cov_matrix(function, C0, "C0", &lp))
+
413  return lp;
+
414  if (!check_size_match(function,
+
415  C0.rows(), "rows of C0",
+
416  G.rows(), "rows of G",
+
417  &lp))
+
418  return lp;
+
419  if (!check_finite(function, C0, "C0", &lp))
+
420  return lp;
+
421  if (!check_not_nan(function, C0, "C0", &lp))
+
422  return lp;
+
423 
+
424  if (y.cols() == 0 || y.rows() == 0)
+
425  return lp;
+
426 
+ +
428  lp += 0.5 * NEG_LOG_TWO_PI * r * T;
+
429  }
+
430 
+ +
432  T_lp f;
+
433  T_lp Q;
+
434  T_lp Q_inv;
+
435  T_lp e;
+
436  Eigen::Matrix<T_lp, Eigen::Dynamic, 1> A(n);
+
437  Eigen::Matrix<T_lp, Eigen::Dynamic, 1> Fj(n);
+
438  Eigen::Matrix<T_lp, Eigen::Dynamic, 1> m(n);
+
439  Eigen::Matrix<T_lp, Eigen::Dynamic, Eigen::Dynamic> C(n, n);
+
440 
+
441  // TODO: how to recast matrices
+
442  for (int i = 0; i < m0.size(); i ++ ) {
+
443  m(i) = m0(i);
+
444  }
+
445  for (int i = 0; i < C0.rows(); i ++ ) {
+
446  for (int j = 0; j < C0.cols(); j ++ ) {
+
447  C(i, j) = C0(i, j);
+
448  }
+
449  }
+
450 
+
451  for (int i = 0; i < y.cols(); i++) {
+
452  // Predict state
+
453  // reuse m and C instead of using a and R
+
454  m = multiply(G, m);
+
455  C = add(quad_form_sym(C, transpose(G)), W);
+
456  for (int j = 0; j < y.rows(); ++j) {
+
457  // predict observation
+
458  T_lp yij(y(j, i));
+
459  // dim Fj = (n, 1)
+
460  for (int k = 0; k < F.rows(); ++k) {
+
461  Fj(k) = F(k, j);
+
462  }
+
463  // // f_{t,i} = F_{t,i}' m_{t,i-1}
+
464  f = dot_product(Fj, m);
+
465  Q = trace_quad_form(C, Fj) + V(j);
+
466  Q_inv = 1.0 / Q;
+
467  // // filtered observation
+
468  // // e_{t,i} = y_{t,i} - f_{t,i}
+
469  e = yij - f;
+
470  // // A_{t,i} = C_{t,i-1} F_{t,i} Q_{t,i}^{-1}
+
471  A = multiply(multiply(C, Fj), Q_inv);
+
472  // // m_{t,i} = m_{t,i-1} + A_{t,i} e_{t,i}
+
473  m += multiply(A, e);
+
474  // // c_{t,i} = C_{t,i-1} - Q_{t,i} A_{t,i} A_{t,i}'
+
475  // // // tcrossprod throws an error (ambiguous)
+
476  // C = subtract(C, multiply(Q, tcrossprod(A)));
+
477  C -= multiply(Q, multiply(A, transpose(A)));
+
478  C = 0.5 * add(C, transpose(C));
+
479  lp -= 0.5 * (log(Q) + pow(e, 2) * Q_inv);
+
480  }
+
481  }
+
482  }
+
483  return lp;
+
484  }
+
485 
+
486  template <typename T_y,
+
487  typename T_F, typename T_G,
+
488  typename T_V, typename T_W,
+
489  typename T_m0, typename T_C0
+
490  >
+
491  inline
+
492  typename return_type<
+
493  T_y,
+ +
495  >::type
+
496  gaussian_dlm_obs_log(const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& y,
+
497  const Eigen::Matrix<T_F,Eigen::Dynamic,Eigen::Dynamic>& F,
+
498  const Eigen::Matrix<T_G,Eigen::Dynamic,Eigen::Dynamic>& G,
+
499  const Eigen::Matrix<T_V,Eigen::Dynamic,1>& V,
+
500  const Eigen::Matrix<T_W,Eigen::Dynamic,Eigen::Dynamic>& W,
+
501  const Eigen::Matrix<T_m0,Eigen::Dynamic,1>& m0,
+
502  const Eigen::Matrix<T_C0,Eigen::Dynamic,Eigen::Dynamic>& C0) {
+
503  return gaussian_dlm_obs_log<false>(y, F, G, V, W, m0, C0);
+
504  }
+
505  }
+
506 
+
507 }
+
508 
+
509 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/generator_8hpp.html b/doc/api/html/generator_8hpp.html new file mode 100644 index 00000000000..278f40c1fe2 --- /dev/null +++ b/doc/api/html/generator_8hpp.html @@ -0,0 +1,327 @@ + + + + + +Stan: src/stan/gm/generator.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
generator.hpp File Reference
+
+
+
#include <boost/variant/apply_visitor.hpp>
+#include <boost/lexical_cast.hpp>
+#include <cstddef>
+#include <ostream>
+#include <sstream>
+#include <stdexcept>
+#include <string>
+#include <vector>
+#include <stan/version.hpp>
+#include <stan/gm/ast.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Classes

struct  stan::gm::visgen
 generic visitor with output for extension More...
 
struct  stan::gm::expression_visgen
 
struct  stan::gm::printable_visgen
 
struct  stan::gm::var_size_validating_visgen
 
struct  stan::gm::var_resizing_visgen
 
struct  stan::gm::init_local_var_visgen
 
struct  stan::gm::validate_var_decl_visgen
 
struct  stan::gm::member_var_decl_visgen
 
struct  stan::gm::local_var_decl_visgen
 
struct  stan::gm::generate_local_var_init_nan_visgen
 
struct  stan::gm::generate_init_vars_visgen
 
struct  stan::gm::validate_transformed_params_visgen
 
struct  stan::gm::statement_visgen
 
struct  stan::gm::dump_member_var_visgen
 
struct  stan::gm::set_param_ranges_visgen
 
struct  stan::gm::generate_init_visgen
 
struct  stan::gm::write_dims_visgen
 
struct  stan::gm::write_param_names_visgen
 
struct  stan::gm::write_csv_header_visgen
 
struct  stan::gm::constrained_param_names_visgen
 
struct  stan::gm::unconstrained_param_names_visgen
 
struct  stan::gm::write_csv_visgen
 
struct  stan::gm::write_csv_vars_visgen
 
struct  stan::gm::write_array_visgen
 
struct  stan::gm::write_array_vars_visgen
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

const std::string stan::gm::EOL ("\n")
 
const std::string stan::gm::EOL2 ("\n\n")
 
const std::string stan::gm::INDENT (" ")
 
const std::string stan::gm::INDENT2 (" ")
 
const std::string stan::gm::INDENT3 (" ")
 
template<typename D >
bool stan::gm::has_lub (const D &x)
 
template<typename D >
bool stan::gm::has_ub (const D &x)
 
template<typename D >
bool stan::gm::has_lb (const D &x)
 
template<typename T >
std::string stan::gm::to_string (T i)
 
void stan::gm::generate_indent (size_t indent, std::ostream &o)
 
void stan::gm::generate_void_statement (const std::string &name, const size_t indent, std::ostream &o)
 
void stan::gm::generate_start_namespace (std::string name, std::ostream &o)
 
void stan::gm::generate_end_namespace (std::ostream &o)
 
void stan::gm::generate_comment (std::string const &msg, int indent, std::ostream &o)
 
template<bool isLHS>
void stan::gm::generate_indexed_expr (const std::string &expr, const std::vector< expression > indexes, base_expr_type base_type, size_t e_num_dims, std::ostream &o)
 
void stan::gm::generate_type (const std::string &base_type, const std::vector< expression > &, size_t end, std::ostream &o)
 
std::string stan::gm::base_type_to_string (const base_expr_type &bt)
 
void stan::gm::generate_expression (const expression &e, std::ostream &o)
 
static void stan::gm::print_string_literal (std::ostream &o, const std::string &s)
 
static void stan::gm::print_quoted_expression (std::ostream &o, const expression &e)
 
void stan::gm::generate_printable (const printable &p, std::ostream &o)
 
void stan::gm::generate_using (const std::string &type, std::ostream &o)
 
void stan::gm::generate_using_namespace (const std::string &ns, std::ostream &o)
 
void stan::gm::generate_usings (std::ostream &o)
 
void stan::gm::generate_typedef (const std::string &type, const std::string &abbrev, std::ostream &o)
 
void stan::gm::generate_typedefs (std::ostream &o)
 
void stan::gm::generate_include (const std::string &lib_name, std::ostream &o)
 
void stan::gm::generate_includes (std::ostream &o)
 
void stan::gm::generate_version_comment (std::ostream &o)
 
void stan::gm::generate_class_decl (const std::string &model_name, std::ostream &o)
 
void stan::gm::generate_end_class_decl (std::ostream &o)
 
void stan::gm::generate_initializer (std::ostream &o, const std::string &base_type, const std::vector< expression > &dims, const expression &type_arg1=expression(), const expression &type_arg2=expression())
 
void stan::gm::generate_validate_context_size (std::ostream &o, const std::string &stage, const std::string &var_name, const std::string &base_type, const std::vector< expression > &dims, const expression &type_arg1=expression(), const expression &type_arg2=expression())
 
void stan::gm::generate_validate_positive (const std::string &var_name, const expression &expr, std::ostream &o)
 
void stan::gm::generate_initialization (std::ostream &o, const std::string &var_name, const std::string &base_type, const std::vector< expression > &dims, const expression &type_arg1=expression(), const expression &type_arg2=expression())
 
void stan::gm::generate_var_resizing (const std::vector< var_decl > &vs, std::ostream &o)
 
const std::vector< expression > stan::gm::EMPTY_EXP_VECTOR (0)
 
void stan::gm::generate_local_var_inits (std::vector< var_decl > vs, bool is_var, bool declare_vars, std::ostream &o)
 
void stan::gm::generate_public_decl (std::ostream &o)
 
void stan::gm::generate_private_decl (std::ostream &o)
 
void stan::gm::generate_validate_var_decl (const var_decl &decl, int indent, std::ostream &o)
 
void stan::gm::generate_validate_var_decls (const std::vector< var_decl > decls, int indent, std::ostream &o)
 
void stan::gm::generate_member_var_decls (const std::vector< var_decl > &vs, int indent, std::ostream &o)
 
void stan::gm::generate_local_var_decls (const std::vector< var_decl > &vs, int indent, std::ostream &o, bool is_var)
 
void stan::gm::generate_local_var_init_nan (const std::vector< var_decl > &vs, int indent, std::ostream &o, bool is_var)
 
void stan::gm::generate_init_vars (const std::vector< var_decl > &vs, int indent, std::ostream &o)
 
void stan::gm::generate_validate_transformed_params (const std::vector< var_decl > &vs, int indent, std::ostream &o)
 
void stan::gm::generate_statement (statement const &s, int indent, std::ostream &o, bool include_sampling, bool is_var)
 
void stan::gm::generate_statements (const std::vector< statement > &ss, int indent, std::ostream &o, bool include_sampling, bool is_var)
 
void stan::gm::generate_log_prob (program const &p, std::ostream &o)
 
void stan::gm::suppress_warning (const std::string &indent, const std::string &var_name, std::ostream &o)
 
void stan::gm::generate_member_var_inits (const std::vector< var_decl > &vs, std::ostream &o)
 
void stan::gm::generate_destructor (const std::string &model_name, std::ostream &o)
 
void stan::gm::generate_set_param_ranges (const std::vector< var_decl > &var_decls, std::ostream &o)
 
void stan::gm::generate_constructor (const program &prog, const std::string &model_name, std::ostream &o)
 
void stan::gm::generate_init_method (const std::vector< var_decl > &vs, std::ostream &o)
 
void stan::gm::generate_dims_method (const program &prog, std::ostream &o)
 
void stan::gm::generate_param_names_method (const program &prog, std::ostream &o)
 
void stan::gm::generate_write_csv_header_method (const program &prog, std::ostream &o)
 
void stan::gm::generate_constrained_param_names_method (const program &prog, std::ostream &o)
 
void stan::gm::generate_unconstrained_param_names_method (const program &prog, std::ostream &o)
 
void stan::gm::generate_write_csv_method (const program &prog, const std::string &model_name, std::ostream &o)
 
void stan::gm::generate_write_array_method (const program &prog, const std::string &model_name, std::ostream &o)
 
void stan::gm::generate_main (const std::string &model_name, std::ostream &out)
 
void stan::gm::generate_model_name_method (const std::string &model_name, std::ostream &out)
 
void stan::gm::generate_cpp (const program &prog, const std::string &model_name, std::ostream &out, bool include_main=true)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/generator_8hpp_source.html b/doc/api/html/generator_8hpp_source.html new file mode 100644 index 00000000000..7db1695528c --- /dev/null +++ b/doc/api/html/generator_8hpp_source.html @@ -0,0 +1,4105 @@ + + + + + +Stan: src/stan/gm/generator.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
generator.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__GENERATOR_HPP__
+
2 #define __STAN__GM__GENERATOR_HPP__
+
3 
+
4 #include <boost/variant/apply_visitor.hpp>
+
5 #include <boost/lexical_cast.hpp>
+
6 
+
7 #include <cstddef>
+
8 #include <ostream>
+
9 #include <sstream>
+
10 #include <stdexcept>
+
11 #include <string>
+
12 #include <vector>
+
13 
+
14 #include <stan/version.hpp>
+
15 #include <stan/gm/ast.hpp>
+
16 
+
17 namespace stan {
+
18 
+
19  namespace gm {
+
20 
+
21  const std::string EOL("\n");
+
22  const std::string EOL2("\n\n");
+
23  const std::string INDENT(" ");
+
24  const std::string INDENT2(" ");
+
25  const std::string INDENT3(" ");
+
26 
+
27  template <typename D>
+
28  bool has_lub(const D& x) {
+
29  return !is_nil(x.range_.low_.expr_) && !is_nil(x.range_.high_.expr_);
+
30  }
+
31  template <typename D>
+
32  bool has_ub(const D& x) {
+
33  return is_nil(x.range_.low_.expr_) && !is_nil(x.range_.high_.expr_);
+
34  }
+
35  template <typename D>
+
36  bool has_lb(const D& x) {
+
37  return !is_nil(x.range_.low_.expr_) && is_nil(x.range_.high_.expr_);
+
38  }
+
39 
+
40  template <typename T>
+
41  std::string to_string(T i) {
+
42  std::stringstream ss;
+
43  ss << i;
+
44  return ss.str();
+
45  }
+
46 
+
47  void generate_indent(size_t indent, std::ostream& o) {
+
48  for (size_t k = 0; k < indent; ++k)
+
49  o << INDENT;
+
50  }
+
51 
+
52  void generate_void_statement(const std::string& name,
+
53  const size_t indent,
+
54  std::ostream& o) {
+
55  generate_indent(indent, o);
+
56  o << "(void) " << name << "; // dummy to suppress unused var warning";
+
57  o << EOL;
+
58  }
+
59 
+
61  struct visgen {
+
62  typedef void result_type;
+
63  std::ostream& o_;
+
64  visgen(std::ostream& o) : o_(o) { }
+
65  };
+
66 
+
67  void generate_start_namespace(std::string name,
+
68  std::ostream& o) {
+
69  o << "namespace " << name << "_namespace {" << EOL2;
+
70  }
+
71 
+
72  void generate_end_namespace(std::ostream& o) {
+
73  o << "} // namespace" << EOL2;
+
74  }
+
75 
+
76  void generate_comment(std::string const& msg, int indent,
+
77  std::ostream& o) {
+
78  generate_indent(indent,o);
+
79  o << "// " << msg << EOL;
+
80  }
+
81 
+
82 
+
83  template <bool isLHS>
+
84  void generate_indexed_expr(const std::string& expr,
+
85  const std::vector<expression> indexes,
+
86  base_expr_type base_type, // may have more dims
+
87  size_t e_num_dims, // array dims
+
88  std::ostream& o) {
+
89  // FIXME: add more get_base1 functions and fold nested calls into API
+
90  // up to a given size, then default to this behavior
+
91  size_t ai_size = indexes.size();
+
92  if (ai_size == 0) {
+
93  // no indexes
+
94  o << expr;
+
95  return;
+
96  }
+
97  if (ai_size <= (e_num_dims + 1) || base_type != MATRIX_T) {
+
98  for (size_t n = 0; n < ai_size; ++n)
+
99  o << (isLHS ? "get_base1_lhs(" : "get_base1(");
+
100  o << expr;
+
101  for (size_t n = 0; n < ai_size; ++n) {
+
102  o << ',';
+
103  generate_expression(indexes[n],o);
+
104  o << ',' << '"' << expr << '"' << ',' << (n+1) << ')';
+
105  }
+
106  } else {
+
107  for (size_t n = 0; n < ai_size - 1; ++n)
+
108  o << (isLHS ? "get_base1_lhs(" : "get_base1(");
+
109  o << expr;
+
110  for (size_t n = 0; n < ai_size - 2; ++n) {
+
111  o << ',';
+
112  generate_expression(indexes[n],o);
+
113  o << ',' << '"' << expr << '"' << ',' << (n+1) << ')';
+
114  }
+
115  o << ',';
+
116  generate_expression(indexes[ai_size - 2U],o);
+
117  o << ',';
+
118  generate_expression(indexes[ai_size - 1U],o);
+
119  o << ',' << '"' << expr << '"' << ',' << (ai_size-1U) << ')';
+
120  }
+
121  }
+
122 
+
123  void generate_type(const std::string& base_type,
+
124  const std::vector<expression>& /*dims*/,
+
125  size_t end,
+
126  std::ostream& o) {
+
127  for (size_t i = 0; i < end; ++i) o << "std::vector<";
+
128  o << base_type;
+
129  for (size_t i = 0; i < end; ++i) {
+
130  if (i > 0) o << ' ';
+
131  o << '>';
+
132  }
+
133  }
+
134 
+
135  std::string base_type_to_string(const base_expr_type& bt) {
+
136  std::stringstream s;
+
137  s << bt;
+
138  return s.str();
+
139  }
+
140 
+
141 
+
142  struct expression_visgen : public visgen {
+
143  expression_visgen(std::ostream& o) : visgen(o) { }
+
144  void operator()(nil const& /*x*/) const {
+
145  o_ << "nil";
+
146  }
+
147  void operator()(const int_literal& n) const { o_ << n.val_; }
+
148  void operator()(const double_literal& x) const {
+
149  std::string num_str = boost::lexical_cast<std::string>(x.val_);
+
150  o_ << num_str;
+
151  if (num_str.find_first_of("eE.") == std::string::npos)
+
152  o_ << ".0"; // trailing 0 to ensure C++ makes it a double
+
153  }
+
154  void operator()(const array_literal& x) const {
+
155  o_ << "stan::math::new_array<";
+
156  generate_type("foobar", // not enough to use: base_type_to_string(x.type_.base_type_),
+
157  x.args_,
+
158  x.args_.size(),
+
159  o_);
+
160  o_ << ">()";
+
161  for (size_t i = 0; i < x.args_.size(); ++i) {
+
162  o_ << ".add(";
+
163  generate_expression(x.args_[i],o_);
+
164  o_ << ")";
+
165  }
+
166  o_ << ".array()";
+
167  }
+
168  void operator()(const variable& v) const { o_ << v.name_; }
+
169  void operator()(int n) const { o_ << static_cast<long>(n); }
+
170  void operator()(double x) const { o_ << x; }
+
171  void operator()(const std::string& x) const { o_ << x; } // identifiers
+
172  void operator()(const index_op& x) const {
+
173  std::stringstream expr_o;
+
174  generate_expression(x.expr_,expr_o);
+
175  std::string expr_string = expr_o.str();
+
176  std::vector<expression> indexes;
+
177  size_t e_num_dims = x.expr_.expression_type().num_dims_;
+
178  base_expr_type base_type = x.expr_.expression_type().base_type_;
+
179  for (size_t i = 0; i < x.dimss_.size(); ++i)
+
180  for (size_t j = 0; j < x.dimss_[i].size(); ++j)
+
181  indexes.push_back(x.dimss_[i][j]); // wasteful copy, could use refs
+
182  generate_indexed_expr<false>(expr_string,indexes,base_type,e_num_dims,o_);
+
183  }
+
184  void operator()(const fun& fx) const {
+
185  o_ << fx.name_ << '(';
+
186  for (size_t i = 0; i < fx.args_.size(); ++i) {
+
187  if (i > 0) o_ << ',';
+
188  boost::apply_visitor(*this, fx.args_[i].expr_);
+
189  }
+
190  if (has_rng_suffix(fx.name_))
+
191  o_ << ", base_rng__";
+
192  o_ << ')';
+
193  }
+
194  void operator()(const binary_op& expr) const {
+
195  o_ << '(';
+
196  boost::apply_visitor(*this, expr.left.expr_);
+
197  o_ << ' ' << expr.op << ' ';
+
198  boost::apply_visitor(*this, expr.right.expr_);
+
199  o_ << ')';
+
200  }
+
201  void operator()(const unary_op& expr) const {
+
202  o_ << expr.op << '(';
+
203  boost::apply_visitor(*this, expr.subject.expr_);
+
204  o_ << ')';
+
205  }
+
206  };
+
207 
+
208  void generate_expression(const expression& e, std::ostream& o) {
+
209  expression_visgen vis(o);
+
210  boost::apply_visitor(vis, e.expr_);
+
211  }
+
212 
+
213  static void print_string_literal(std::ostream& o,
+
214  const std::string& s) {
+
215  o << '"';
+
216  for (size_t i = 0; i < s.size(); ++i) {
+
217  if (s[i] == '"' || s[i] == '\\' || s[i] == '\'' )
+
218  o << '\\'; // escape
+
219  o << s[i];
+
220  }
+
221  o << '"';
+
222  }
+
223 
+
224  static void print_quoted_expression(std::ostream& o,
+
225  const expression& e) {
+
226  std::stringstream ss;
+
227  generate_expression(e,ss);
+
228  print_string_literal(o,ss.str());
+
229  }
+
230 
+
231  struct printable_visgen : public visgen {
+
232  printable_visgen(std::ostream& o) : visgen(o) { }
+
233  void operator()(const std::string& s) const {
+ +
235  }
+
236  void operator()(const expression& e) const {
+ +
238  // print_quoted_expression(o_,e);
+
239  }
+
240  };
+
241 
+
242  void generate_printable(const printable& p, std::ostream& o) {
+
243  printable_visgen vis(o);
+
244  boost::apply_visitor(vis, p.printable_);
+
245  }
+
246 
+
247  void generate_using(const std::string& type, std::ostream& o) {
+
248  o << "using " << type << ";" << EOL;
+
249  }
+
250 
+
251  void generate_using_namespace(const std::string& ns, std::ostream& o) {
+
252  o << "using namespace " << ns << ";" << EOL;
+
253  }
+
254 
+
255 
+
256  void generate_usings(std::ostream& o) {
+
257  generate_using("std::vector",o);
+
258  generate_using("std::string",o);
+
259  generate_using("std::stringstream",o);
+
260  generate_using("stan::model::prob_grad",o);
+
261  generate_using("stan::math::get_base1",o);
+
262  generate_using("stan::math::initialize",o);
+
263  generate_using("stan::math::stan_print",o);
+
264  generate_using("stan::math::lgamma",o);
+
265  generate_using("stan::io::dump",o);
+
266  generate_using("std::istream",o);
+
267  generate_using_namespace("stan::math",o);
+
268  generate_using_namespace("stan::prob",o);
+
269  o << EOL;
+
270  }
+
271 
+
272  void generate_typedef(const std::string& type,
+
273  const std::string& abbrev,
+
274  std::ostream& o) {
+
275  o << "typedef" << " " << type << " " << abbrev << ";" << EOL;
+
276  }
+
277 
+
278  void generate_typedefs(std::ostream& o) {
+
279  generate_typedef("Eigen::Matrix<double,Eigen::Dynamic,1>","vector_d",o);
+
280  generate_typedef("Eigen::Matrix<double,1,Eigen::Dynamic>","row_vector_d",o);
+
281  generate_typedef("Eigen::Matrix<double,Eigen::Dynamic,Eigen::Dynamic>","matrix_d",o);
+
282  o << EOL;
+
283  }
+
284 
+
285  void generate_include(const std::string& lib_name, std::ostream& o) {
+
286  o << "#include" << " " << "<" << lib_name << ">" << EOL;
+
287  }
+
288 
+
289  void generate_includes(std::ostream& o) {
+
290  generate_include("stan/model/model_header.hpp",o);
+
291  // generate_include("boost/random/linear_congruential.hpp",o);
+
292  o << EOL;
+
293  }
+
294 
+
295  void generate_version_comment(std::ostream& o) {
+
296  o << "// Code generated by Stan version "
+ +
298  }
+
299 
+
300  void generate_class_decl(const std::string& model_name,
+
301  std::ostream& o) {
+
302  o << "class " << model_name << " : public prob_grad {" << EOL;
+
303  }
+
304 
+
305  void generate_end_class_decl(std::ostream& o) {
+
306  o << "}; // model" << EOL2;
+
307  }
+
308 
+
309  void generate_initializer(std::ostream& o,
+
310  const std::string& base_type,
+
311  const std::vector<expression>& dims,
+
312  const expression& type_arg1 = expression(),
+
313  const expression& type_arg2 = expression()) {
+
314  for (size_t i = 0; i < dims.size(); ++i) {
+
315  o << '(';
+
316  generate_expression(dims[i].expr_,o);
+
317  o << ',';
+
318  generate_type(base_type,dims,dims.size()- i - 1,o);
+
319  }
+
320 
+
321  o << '(';
+
322  if (!is_nil(type_arg1)) {
+
323  generate_expression(type_arg1.expr_,o);
+
324  if (!is_nil(type_arg2)) {
+
325  o << ',';
+
326  generate_expression(type_arg2.expr_,o);
+
327  }
+
328  } else if (!is_nil(type_arg2.expr_)) {
+
329  generate_expression(type_arg2.expr_,o);
+
330  } else {
+
331  o << '0';
+
332  }
+
333  o << ')';
+
334 
+
335  for (size_t i = 0; i < dims.size(); ++i)
+
336  o << ')';
+
337  o << ';' << EOL;
+
338  }
+
339 
+
340  // only generates the test
+
341  void generate_validate_context_size(std::ostream& o,
+
342  const std::string& stage,
+
343  const std::string& var_name,
+
344  const std::string& base_type,
+
345  const std::vector<expression>& dims,
+
346  const expression& type_arg1 = expression(),
+
347  const expression& type_arg2 = expression()) {
+
348  o << INDENT2
+
349  << "context__.validate_dims("
+
350  << '"' << stage << '"'
+
351  << ", " << '"' << var_name << '"'
+
352  << ", " << '"' << base_type << '"'
+
353  << ", context__.to_vec(";
+
354  for (size_t i = 0; i < dims.size(); ++i) {
+
355  if (i > 0) o << ",";
+
356  generate_expression(dims[i].expr_,o);
+
357  }
+
358  if (!is_nil(type_arg1)) {
+
359  if (dims.size() > 0) o << ",";
+
360  generate_expression(type_arg1.expr_,o);
+
361  if (!is_nil(type_arg2)) {
+
362  o << ",";
+
363  generate_expression(type_arg2.expr_,o);
+
364  }
+
365  }
+
366  o << "));"
+
367  << EOL;
+
368  }
+
369 
+ +
371  const std::string stage_;
+
372  var_size_validating_visgen(std::ostream& o, const std::string& stage)
+
373  : visgen(o),
+
374  stage_(stage) {
+
375  }
+
376  void operator()(nil const& /*x*/) const { } // dummy
+
377  void operator()(int_var_decl const& x) const {
+ +
379  }
+
380  void operator()(double_var_decl const& x) const {
+ +
382  }
+
383  void operator()(vector_var_decl const& x) const {
+ +
385  }
+
386  void operator()(row_vector_var_decl const& x) const {
+
387  generate_validate_context_size(o_,stage_,x.name_,"row_vector_d",x.dims_,x.N_);
+
388  }
+
389  void operator()(unit_vector_var_decl const& x) const {
+ +
391  }
+
392  void operator()(simplex_var_decl const& x) const {
+ +
394  }
+
395  void operator()(ordered_var_decl const& x) const {
+ +
397  }
+
398  void operator()(positive_ordered_var_decl const& x) const {
+ +
400  }
+
401  void operator()(matrix_var_decl const& x) const {
+ +
403  }
+
404  void operator()(cholesky_factor_var_decl const& x) const {
+ +
406  }
+
407  void operator()(cov_matrix_var_decl const& x) const {
+ +
409  }
+
410  void operator()(corr_matrix_var_decl const& x) const {
+ +
412  }
+
413  };
+
414 
+
415 
+
416  void generate_validate_positive(const std::string& var_name,
+
417  const expression& expr,
+
418  std::ostream& o) {
+
419  o << INDENT2;
+
420  o << "stan::math::validate_non_negative_index(\"" << var_name << "\", ";
+
421  print_quoted_expression(o,expr);
+
422  o << ", ";
+
423  generate_expression(expr,o);
+
424  o << ");" << EOL;
+
425  }
+
426 
+
427  void generate_initialization(std::ostream& o,
+
428  const std::string& var_name,
+
429  const std::string& base_type,
+
430  const std::vector<expression>& dims,
+
431  const expression& type_arg1 = expression(),
+
432  const expression& type_arg2 = expression()) {
+
433  // validate all dims are positive
+
434  for (size_t i = 0; i < dims.size(); ++i)
+
435  generate_validate_positive(var_name,dims[i],o);
+
436  if (!is_nil(type_arg1))
+
437  generate_validate_positive(var_name,type_arg1,o);
+
438  if (!is_nil(type_arg2))
+
439  generate_validate_positive(var_name,type_arg2,o);
+
440 
+
441  // define variable with initializer
+
442  o << INDENT2
+
443  << var_name << " = ";
+
444  generate_type(base_type,dims,dims.size(),o);
+
445  generate_initializer(o,base_type,dims,type_arg1,type_arg2);
+
446 
+
447  }
+
448 
+
449  struct var_resizing_visgen : public visgen {
+
450  var_resizing_visgen(std::ostream& o)
+
451  : visgen(o) {
+
452  }
+
453  void operator()(nil const& /*x*/) const { } // dummy
+
454  void operator()(int_var_decl const& x) const {
+ +
456  }
+
457  void operator()(double_var_decl const& x) const {
+
458  generate_initialization(o_,x.name_,"double",x.dims_);
+
459  }
+
460  void operator()(vector_var_decl const& x) const {
+
461  generate_initialization(o_,x.name_,"vector_d",x.dims_,x.M_);
+
462  }
+
463  void operator()(row_vector_var_decl const& x) const {
+
464  generate_initialization(o_,x.name_,"row_vector_d",x.dims_,x.N_);
+
465  }
+
466  void operator()(unit_vector_var_decl const& x) const {
+
467  generate_initialization(o_,x.name_,"vector_d",x.dims_,x.K_);
+
468  }
+
469  void operator()(simplex_var_decl const& x) const {
+
470  generate_initialization(o_,x.name_,"vector_d",x.dims_,x.K_);
+
471  }
+
472  void operator()(ordered_var_decl const& x) const {
+
473  generate_initialization(o_,x.name_,"vector_d",x.dims_,x.K_);
+
474  }
+
475  void operator()(positive_ordered_var_decl const& x) const {
+
476  generate_initialization(o_,x.name_,"vector_d",x.dims_,x.K_);
+
477  }
+
478  void operator()(matrix_var_decl const& x) const {
+
479  generate_initialization(o_,x.name_,"matrix_d",x.dims_,x.M_,x.N_);
+
480  }
+
481  void operator()(cholesky_factor_var_decl const& x) const {
+
482  generate_initialization(o_,x.name_,"matrix_d",x.dims_,x.M_,x.N_);
+
483  }
+
484  void operator()(cov_matrix_var_decl const& x) const {
+
485  generate_initialization(o_,x.name_,"matrix_d",x.dims_,x.K_,x.K_);
+
486  }
+
487  void operator()(corr_matrix_var_decl const& x) const {
+
488  generate_initialization(o_,x.name_,"matrix_d",x.dims_,x.K_,x.K_);
+
489  }
+
490  };
+
491 
+
492  void generate_var_resizing(const std::vector<var_decl>& vs,
+
493  std::ostream& o) {
+
494  var_resizing_visgen vis(o);
+
495  for (size_t i = 0; i < vs.size(); ++i)
+
496  boost::apply_visitor(vis, vs[i].decl_);
+
497  }
+
498 
+
499  const std::vector<expression> EMPTY_EXP_VECTOR(0);
+
500 
+
501  struct init_local_var_visgen : public visgen {
+
502  const bool declare_vars_;
+
503  const bool is_var_;
+
504  init_local_var_visgen(bool declare_vars,
+
505  bool is_var,
+
506  std::ostream& o)
+
507  : visgen(o),
+
508  declare_vars_(declare_vars),
+
509  is_var_(is_var) {
+
510  }
+
511  template <typename D>
+
512  void generate_initialize_array_bounded(const D& x, const std::string& base_type,
+
513  const std::string& read_fun_prefix,
+
514  const std::vector<expression>& dim_args) const {
+
515  std::vector<expression> read_args;
+
516  std::string read_fun(read_fun_prefix);
+
517  if (has_lub(x)) {
+
518  read_fun += "_lub";
+
519  read_args.push_back(x.range_.low_);
+
520  read_args.push_back(x.range_.high_);
+
521  } else if (has_lb(x)) {
+
522  read_fun += "_lb";
+
523  read_args.push_back(x.range_.low_);
+
524  } else if (has_ub(x)) {
+
525  read_fun += "_ub";
+
526  read_args.push_back(x.range_.high_);
+
527  }
+
528  for (size_t i = 0; i < dim_args.size(); ++i)
+
529  read_args.push_back(dim_args[i]);
+
530  generate_initialize_array(base_type,read_fun,read_args,x.name_,x.dims_);
+
531  }
+
532  void operator()(const nil& /*x*/) const { }
+
533  void operator()(const int_var_decl& x) const {
+ +
535  }
+
536  void operator()(const double_var_decl& x) const {
+
537  std::vector<expression> read_args;
+
538  generate_initialize_array_bounded(x,is_var_?"T__":"double","scalar",read_args);
+
539  }
+
540  void operator()(const vector_var_decl& x) const {
+
541  std::vector<expression> read_args;
+
542  read_args.push_back(x.M_);
+
543  generate_initialize_array_bounded(x,is_var_?"Eigen::Matrix<T__,Eigen::Dynamic,1> ":"vector_d","vector",read_args);
+
544  }
+
545  void operator()(const row_vector_var_decl& x) const {
+
546  std::vector<expression> read_args;
+
547  read_args.push_back(x.N_);
+
548  generate_initialize_array_bounded(x,is_var_?"Eigen::Matrix<T__,1,Eigen::Dynamic> ":"row_vector_d","row_vector",read_args);
+
549  }
+
550  void operator()(const matrix_var_decl& x) const {
+
551  std::vector<expression> read_args;
+
552  read_args.push_back(x.M_);
+
553  read_args.push_back(x.N_);
+
554  generate_initialize_array_bounded(x,is_var_?"Eigen::Matrix<T__,Eigen::Dynamic,Eigen::Dynamic> ":"matrix_d","matrix",read_args);
+
555  }
+
556  void operator()(const unit_vector_var_decl& x) const {
+
557  std::vector<expression> read_args;
+
558  read_args.push_back(x.K_);
+
559  generate_initialize_array(is_var_?"Eigen::Matrix<T__,Eigen::Dynamic,1> ":"vector_d","unit_vector",read_args,x.name_,x.dims_);
+
560  }
+
561  void operator()(const simplex_var_decl& x) const {
+
562  std::vector<expression> read_args;
+
563  read_args.push_back(x.K_);
+
564  generate_initialize_array(is_var_?"Eigen::Matrix<T__,Eigen::Dynamic,1> ":"vector_d","simplex",read_args,x.name_,x.dims_);
+
565  }
+
566  void operator()(const ordered_var_decl& x) const {
+
567  std::vector<expression> read_args;
+
568  read_args.push_back(x.K_);
+
569  generate_initialize_array(is_var_?"Eigen::Matrix<T__,Eigen::Dynamic,1> ":"vector_d","ordered",read_args,x.name_,x.dims_);
+
570  }
+
571  void operator()(const positive_ordered_var_decl& x) const {
+
572  std::vector<expression> read_args;
+
573  read_args.push_back(x.K_);
+
574  generate_initialize_array(is_var_?"Eigen::Matrix<T__,Eigen::Dynamic,1> ":"vector_d","positive_ordered",read_args,x.name_,x.dims_);
+
575  }
+
576  void operator()(const cholesky_factor_var_decl& x) const {
+
577  std::vector<expression> read_args;
+
578  read_args.push_back(x.M_);
+
579  read_args.push_back(x.N_);
+
580  generate_initialize_array(is_var_?"Eigen::Matrix<T__,Eigen::Dynamic,Eigen::Dynamic> ":"matrix_d",
+
581  "cholesky_factor",read_args,x.name_,x.dims_);
+
582  }
+
583  void operator()(const cov_matrix_var_decl& x) const {
+
584  std::vector<expression> read_args;
+
585  read_args.push_back(x.K_);
+
586  generate_initialize_array(is_var_?"Eigen::Matrix<T__,Eigen::Dynamic,Eigen::Dynamic> ":"matrix_d",
+
587  "cov_matrix",read_args,x.name_,x.dims_);
+
588  }
+
589  void operator()(const corr_matrix_var_decl& x) const {
+
590  std::vector<expression> read_args;
+
591  read_args.push_back(x.K_);
+
592  generate_initialize_array(is_var_?"Eigen::Matrix<T__,Eigen::Dynamic,Eigen::Dynamic> ":"matrix_d",
+
593  "corr_matrix",read_args,x.name_,x.dims_);
+
594  }
+
595  void generate_initialize_array(const std::string& var_type,
+
596  const std::string& read_type,
+
597  const std::vector<expression>& read_args,
+
598  const std::string& name,
+
599  const std::vector<expression>& dims) const {
+
600  if (declare_vars_) {
+
601  o_ << INDENT2;
+
602  for (size_t i = 0; i < dims.size(); ++i) o_ << "vector<";
+
603  o_ << var_type;
+
604  for (size_t i = 0; i < dims.size(); ++i) o_ << "> ";
+
605  if (dims.size() == 0) o_ << " ";
+
606  o_ << name << ";" << EOL;
+
607  }
+
608 
+
609  if (dims.size() == 0) {
+
610  generate_void_statement(name, 2, o_);
+
611  o_ << INDENT2 << "if (jacobian__)" << EOL;
+
612 
+
613  // w Jacobian
+
614  generate_indent(3,o_);
+
615  o_ << name << " = in__." << read_type << "_constrain(";
+
616  for (size_t j = 0; j < read_args.size(); ++j) {
+
617  if (j > 0) o_ << ",";
+
618  generate_expression(read_args[j],o_);
+
619  }
+
620  if (read_args.size() > 0)
+
621  o_ << ",";
+
622  o_ << "lp__";
+
623  o_ << ");" << EOL;
+
624 
+
625  o_ << INDENT2 << "else" << EOL;
+
626 
+
627  // w/o Jacobian
+
628  generate_indent(3,o_);
+
629  o_ << name << " = in__." << read_type << "_constrain(";
+
630  for (size_t j = 0; j < read_args.size(); ++j) {
+
631  if (j > 0) o_ << ",";
+
632  generate_expression(read_args[j],o_);
+
633  }
+
634  o_ << ");" << EOL;
+
635 
+
636  } else {
+
637  // dims > 0
+
638  std::string name_dims(name);
+
639  for (size_t i = 0; i < dims.size(); ++i) {
+
640  generate_indent(i + 2, o_);
+
641  o_ << "size_t dim_" << name << "_" << i << "__ = ";
+
642  generate_expression(dims[i],o_);
+
643  o_ << ";" << EOL;
+
644 
+
645  if (i < dims.size() - 1) {
+
646  generate_indent(i + 2, o_);
+
647  o_ << name_dims << ".resize(dim" << "_" << name << "_" << i << "__);"
+
648  << EOL;
+
649  name_dims.append("[k_").append(to_string(i)).append("__]");
+
650  }
+
651 
+
652  generate_indent(i + 2, o_);
+
653  if (i == dims.size() - 1) {
+
654  o_ << name_dims << ".reserve(dim_" << name << "_" << i << "__);" << EOL;
+
655  generate_indent(i + 2, o_);
+
656  }
+
657 
+
658  o_ << "for (size_t k_" << i << "__ = 0;"
+
659  << " k_" << i << "__ < dim_" << name << "_" << i << "__;"
+
660  << " ++k_" << i << "__) {" << EOL;
+
661 
+
662  // if on the last loop, push read element into array
+
663  if (i == dims.size() - 1) {
+
664  generate_indent(i + 3, o_);
+
665  o_ << "if (jacobian__)" << EOL;
+
666 
+
667  // w Jacobian
+
668 
+
669  generate_indent(i + 4, o_);
+
670  o_ << name_dims << ".push_back(in__." << read_type << "_constrain(";
+
671  for (size_t j = 0; j < read_args.size(); ++j) {
+
672  if (j > 0) o_ << ",";
+
673  generate_expression(read_args[j],o_);
+
674  }
+
675  if (read_args.size() > 0)
+
676  o_ << ",";
+
677  o_ << "lp__";
+
678  o_ << "));" << EOL;
+
679 
+
680  generate_indent(i + 3, o_);
+
681  o_ << "else" << EOL;
+
682 
+
683  // w/o Jacobian
+
684 
+
685  generate_indent(i + 4, o_);
+
686  o_ << name_dims << ".push_back(in__." << read_type << "_constrain(";
+
687  for (size_t j = 0; j < read_args.size(); ++j) {
+
688  if (j > 0) o_ << ",";
+
689  generate_expression(read_args[j],o_);
+
690  }
+
691  o_ << "));" << EOL;
+
692  }
+
693  }
+
694 
+
695  for (size_t i = dims.size(); i > 0; --i) {
+
696  generate_indent(i + 1, o_);
+
697  o_ << "}" << EOL;
+
698  }
+
699  }
+
700  o_ << EOL;
+
701  }
+
702  };
+
703 
+
704  void generate_local_var_inits(std::vector<var_decl> vs,
+
705  bool is_var,
+
706  bool declare_vars,
+
707  std::ostream& o) {
+
708  o << INDENT2
+
709  << "stan::io::reader<"
+
710  << (is_var ? "T__" : "double")
+
711  << "> in__(params_r__,params_i__);" << EOL2;
+
712  init_local_var_visgen vis(declare_vars,is_var,o);
+
713  for (size_t i = 0; i < vs.size(); ++i)
+
714  boost::apply_visitor(vis, vs[i].decl_);
+
715  }
+
716 
+
717 
+
718 
+
719 
+
720  void generate_public_decl(std::ostream& o) {
+
721  o << "public:" << EOL;
+
722  }
+
723 
+
724  void generate_private_decl(std::ostream& o) {
+
725  o << "private:" << EOL;
+
726  }
+
727 
+
728 
+ +
730  int indents_;
+ +
732  std::ostream& o)
+
733  : visgen(o),
+
734  indents_(indents) {
+
735  }
+
736  void generate_begin_for_dims(const std::vector<expression>& dims)
+
737  const {
+
738 
+
739  for (size_t i = 0; i < dims.size(); ++i) {
+ +
741  o_ << "for (int k" << i << "__ = 0;"
+
742  << " k" << i << "__ < ";
+
743  generate_expression(dims[i].expr_,o_);
+
744  o_ << ";";
+
745  o_ << " ++k" << i << "__) {" << EOL;
+
746  }
+
747  }
+
748  void generate_end_for_dims(size_t dims_size) const {
+
749  for (size_t i = 0; i < dims_size; ++i) {
+
750  generate_indent(indents_ + dims_size - i - 1, o_);
+
751  o_ << "}" << EOL;
+
752  }
+
753  }
+
754 
+
755  void generate_loop_var(const std::string& name,
+
756  size_t dims_size) const {
+
757  o_ << name;
+
758  for (size_t i = 0; i < dims_size; ++i)
+
759  o_ << "[k" << i << "__]";
+
760  }
+
761  void operator()(nil const& /*x*/) const { }
+
762  template <typename T>
+
763  void basic_validate(T const& x) const {
+
764  if (!(x.range_.has_low() || x.range_.has_high()))
+
765  return; // unconstrained
+
766  generate_begin_for_dims(x.dims_);
+
767  generate_indent(indents_ + x.dims_.size(),o_);
+
768  o_ << "try { " << EOL;
+
769  if (x.range_.has_low()) {
+
770  generate_indent(indents_ + 1 + x.dims_.size(),o_);
+
771  o_ << "check_greater_or_equal(function__,";
+
772  generate_loop_var(x.name_,x.dims_.size());
+
773  o_ << ",";
+
774  generate_expression(x.range_.low_.expr_,o_);
+
775  o_ << ",\"";
+
776  generate_loop_var(x.name_,x.dims_.size());
+
777  o_ << "\");" << EOL;
+
778  }
+
779  if (x.range_.has_high()) {
+
780  generate_indent(indents_ + 1 + x.dims_.size(),o_);
+
781  o_ << "check_less_or_equal(function__,";
+
782  generate_loop_var(x.name_,x.dims_.size());
+
783  o_ << ",";
+
784  generate_expression(x.range_.high_.expr_,o_);
+
785  o_ << ",\"";
+
786  generate_loop_var(x.name_,x.dims_.size());
+
787  o_ << "\");" << EOL;
+
788  }
+
789  generate_indent(indents_ + x.dims_.size(),o_);
+
790  o_ << "} catch (std::domain_error& e) { "
+
791  << EOL;
+
792  generate_indent(indents_ + x.dims_.size() + 1, o_);
+
793  o_ << "throw std::domain_error(std::string(\"Invalid value of " << x.name_ << ": \") + std::string(e.what()));"
+
794  << EOL;
+
795  generate_indent(indents_ + x.dims_.size(), o_);
+
796  o_ << "};" << EOL;
+
797  generate_end_for_dims(x.dims_.size());
+
798  }
+
799  void operator()(int_var_decl const& x) const {
+
800  basic_validate(x);
+
801  }
+
802  void operator()(double_var_decl const& x) const {
+
803  basic_validate(x);
+
804  }
+
805  void operator()(vector_var_decl const& x) const {
+
806  basic_validate(x);
+
807  }
+
808  void operator()(row_vector_var_decl const& x) const {
+
809  basic_validate(x);
+
810  }
+
811  void operator()(matrix_var_decl const& x) const {
+
812  basic_validate(x);
+
813  }
+
814  template <typename T>
+
815  void nonbasic_validate(const T& x,
+
816  const std::string& type_name) const {
+
817  generate_begin_for_dims(x.dims_);
+
818  generate_indent(indents_ + x.dims_.size(),o_);
+
819  o_ << "try { stan::math::check_" << type_name << "(function__,";
+
820  generate_loop_var(x.name_,x.dims_.size());
+
821  o_ << ",\"";
+
822  generate_loop_var(x.name_,x.dims_.size());
+
823  o_ << "\"); } catch (std::domain_error& e) { throw std::domain_error(std::string(\"Invalid value of " << x.name_ << ": \") + std::string(e.what())); };" << EOL;
+
824  generate_end_for_dims(x.dims_.size());
+
825  }
+
826  void operator()(unit_vector_var_decl const& x) const {
+
827  nonbasic_validate(x,"unit_vector");
+
828  }
+
829  void operator()(simplex_var_decl const& x) const {
+
830  nonbasic_validate(x,"simplex");
+
831  }
+
832  void operator()(ordered_var_decl const& x) const {
+
833  nonbasic_validate(x,"ordered");
+
834  }
+
835  void operator()(positive_ordered_var_decl const& x) const {
+
836  nonbasic_validate(x,"positive_ordered");
+
837  }
+
838  void operator()(cholesky_factor_var_decl const& x) const {
+
839  nonbasic_validate(x,"choelsky_factor");
+
840  }
+
841  void operator()(cov_matrix_var_decl const& x) const {
+
842  nonbasic_validate(x,"cov_matrix");
+
843  }
+
844  void operator()(corr_matrix_var_decl const& x) const {
+
845  nonbasic_validate(x,"corr_matrix");
+
846  }
+
847  };
+
848 
+
849 
+ +
851  int indent,
+
852  std::ostream& o) {
+
853  validate_var_decl_visgen vis(indent,o);
+
854  boost::apply_visitor(vis,decl.decl_);
+
855  }
+
856 
+
857  void generate_validate_var_decls(const std::vector<var_decl> decls,
+
858  int indent,
+
859  std::ostream& o) {
+
860  for (size_t i = 0; i < decls.size(); ++i)
+
861  generate_validate_var_decl(decls[i],indent,o);
+
862  }
+
863 
+
864  // see _var_decl_visgen cut & paste
+
865  struct member_var_decl_visgen : public visgen {
+
866  int indents_;
+ +
868  std::ostream& o)
+
869  : visgen(o),
+
870  indents_(indents) {
+
871  }
+
872  void operator()(nil const& /*x*/) const { }
+
873  void operator()(int_var_decl const& x) const {
+
874  declare_array("int",x.name_,x.dims_.size());
+
875  }
+
876  void operator()(double_var_decl const& x) const {
+
877  declare_array("double",x.name_,x.dims_.size());
+
878  }
+
879  void operator()(unit_vector_var_decl const& x) const {
+
880  declare_array(("vector_d"), x.name_, x.dims_.size());
+
881  }
+
882  void operator()(simplex_var_decl const& x) const {
+
883  declare_array(("vector_d"), x.name_, x.dims_.size());
+
884  }
+
885  void operator()(ordered_var_decl const& x) const {
+
886  declare_array(("vector_d"), x.name_, x.dims_.size());
+
887  }
+
888  void operator()(positive_ordered_var_decl const& x) const {
+
889  declare_array(("vector_d"), x.name_, x.dims_.size());
+
890  }
+
891  void operator()(cholesky_factor_var_decl const& x) const {
+
892  declare_array(("matrix_d"), x.name_, x.dims_.size());
+
893  }
+
894  void operator()(cov_matrix_var_decl const& x) const {
+
895  declare_array(("matrix_d"), x.name_, x.dims_.size());
+
896  }
+
897  void operator()(corr_matrix_var_decl const& x) const {
+
898  declare_array(("matrix_d"), x.name_, x.dims_.size());
+
899  }
+
900  void operator()(vector_var_decl const& x) const {
+
901  declare_array(("vector_d"), x.name_, x.dims_.size());
+
902  }
+
903  void operator()(row_vector_var_decl const& x) const {
+
904  declare_array(("row_vector_d"), x.name_, x.dims_.size());
+
905  }
+
906  void operator()(matrix_var_decl const& x) const {
+
907  declare_array(("matrix_d"), x.name_, x.dims_.size());
+
908  }
+
909  void declare_array(std::string const& type, std::string const& name,
+
910  size_t size) const {
+
911  for (int i = 0; i < indents_; ++i)
+
912  o_ << INDENT;
+
913  for (size_t i = 0; i < size; ++i) {
+
914  o_ << "vector<";
+
915  }
+
916  o_ << type;
+
917  if (size > 0) {
+
918  o_ << ">";
+
919  }
+
920  for (size_t i = 1; i < size; ++i) {
+
921  o_ << " >";
+
922  }
+
923  o_ << " " << name << ";" << EOL;
+
924  }
+
925  };
+
926 
+
927  void generate_member_var_decls(const std::vector<var_decl>& vs,
+
928  int indent,
+
929  std::ostream& o) {
+
930  member_var_decl_visgen vis(indent,o);
+
931  for (size_t i = 0; i < vs.size(); ++i)
+
932  boost::apply_visitor(vis,vs[i].decl_);
+
933  }
+
934 
+
935  // see member_var_decl_visgen cut & paste
+
936  struct local_var_decl_visgen : public visgen {
+
937  int indents_;
+
938  bool is_var_;
+ +
940  bool is_var,
+
941  std::ostream& o)
+
942  : visgen(o),
+
943  indents_(indents),
+
944  is_var_(is_var) {
+
945  }
+
946  void operator()(nil const& /*x*/) const { }
+
947  void operator()(int_var_decl const& x) const {
+
948  std::vector<expression> ctor_args;
+
949  declare_array("int",ctor_args,x.name_,x.dims_);
+
950  }
+
951  void operator()(double_var_decl const& x) const {
+
952  std::vector<expression> ctor_args;
+
953  declare_array(is_var_ ? "T__" : "double",
+
954  ctor_args,x.name_,x.dims_);
+
955  }
+
956  void operator()(vector_var_decl const& x) const {
+
957  std::vector<expression> ctor_args;
+
958  ctor_args.push_back(x.M_);
+
959  declare_array(is_var_ ? "Eigen::Matrix<T__,Eigen::Dynamic,1> " : "vector_d",
+
960  ctor_args, x.name_, x.dims_);
+
961  }
+
962  void operator()(row_vector_var_decl const& x) const {
+
963  std::vector<expression> ctor_args;
+
964  ctor_args.push_back(x.N_);
+
965  declare_array(is_var_ ? "Eigen::Matrix<T__,1,Eigen::Dynamic> " : "row_vector_d",
+
966  ctor_args, x.name_, x.dims_);
+
967  }
+
968  void operator()(matrix_var_decl const& x) const {
+
969  std::vector<expression> ctor_args;
+
970  ctor_args.push_back(x.M_);
+
971  ctor_args.push_back(x.N_);
+
972  declare_array(is_var_ ? "Eigen::Matrix<T__,Eigen::Dynamic,Eigen::Dynamic> " : "matrix_d",
+
973  ctor_args, x.name_, x.dims_);
+
974  }
+
975  void operator()(unit_vector_var_decl const& x) const {
+
976  std::vector<expression> ctor_args;
+
977  ctor_args.push_back(x.K_);
+
978  declare_array(is_var_ ? "Eigen::Matrix<T__,Eigen::Dynamic,1> " : "vector_d",
+
979  ctor_args, x.name_, x.dims_);
+
980  }
+
981  void operator()(simplex_var_decl const& x) const {
+
982  std::vector<expression> ctor_args;
+
983  ctor_args.push_back(x.K_);
+
984  declare_array(is_var_ ? "Eigen::Matrix<T__,Eigen::Dynamic,1> " : "vector_d",
+
985  ctor_args, x.name_, x.dims_);
+
986  }
+
987  void operator()(ordered_var_decl const& x) const {
+
988  std::vector<expression> ctor_args;
+
989  ctor_args.push_back(x.K_);
+
990  declare_array(is_var_ ? "Eigen::Matrix<T__,Eigen::Dynamic,1> " : "vector_d",
+
991  ctor_args, x.name_, x.dims_);
+
992  }
+
993  void operator()(positive_ordered_var_decl const& x) const {
+
994  std::vector<expression> ctor_args;
+
995  ctor_args.push_back(x.K_);
+
996  declare_array(is_var_ ? "Eigen::Matrix<T__,Eigen::Dynamic,1> " : "vector_d",
+
997  ctor_args, x.name_, x.dims_);
+
998  }
+
999  void operator()(cholesky_factor_var_decl const& x) const {
+
1000  std::vector<expression> ctor_args;
+
1001  ctor_args.push_back(x.M_);
+
1002  ctor_args.push_back(x.N_);
+
1003  declare_array(is_var_ ? "Eigen::Matrix<T__,Eigen::Dynamic,Eigen::Dynamic> " : "matrix_d",
+
1004  ctor_args, x.name_, x.dims_);
+
1005  }
+
1006  void operator()(cov_matrix_var_decl const& x) const {
+
1007  std::vector<expression> ctor_args;
+
1008  ctor_args.push_back(x.K_);
+
1009  ctor_args.push_back(x.K_);
+
1010  declare_array(is_var_ ? "Eigen::Matrix<T__,Eigen::Dynamic,Eigen::Dynamic> " : "matrix_d",
+
1011  ctor_args, x.name_, x.dims_);
+
1012  }
+
1013  void operator()(corr_matrix_var_decl const& x) const {
+
1014  std::vector<expression> ctor_args;
+
1015  ctor_args.push_back(x.K_);
+
1016  ctor_args.push_back(x.K_);
+
1017  declare_array(is_var_ ? "Eigen::Matrix<T__,Eigen::Dynamic,Eigen::Dynamic> " : "matrix_d",
+
1018  ctor_args, x.name_, x.dims_);
+
1019  }
+
1020  void generate_type(const std::string& type,
+
1021  size_t num_dims) const {
+
1022  for (size_t i = 0; i < num_dims; ++i)
+
1023  o_ << "vector<";
+
1024  o_ << type;
+
1025  for (size_t i = 0; i < num_dims; ++i) {
+
1026  if (i > 0) o_ << " ";
+
1027  o_ << ">";
+
1028  }
+
1029  }
+
1030 
+
1031  void generate_void_statement(const std::string& name) const {
+
1032  o_ << "(void) " << name << "; // dummy to suppress unused var warning";
+
1033  }
+
1034 
+
1035  // var_decl -> type[0] name init_args[0] ;
+
1036  // init_args[k] -> ctor_args if no dims left
+
1037  // init_args[k] -> ( dim[k] , ( type[k+1] init_args[k+1] ) )
+
1038  void generate_init_args(const std::string& type,
+
1039  const std::vector<expression>& ctor_args,
+
1040  const std::vector<expression>& dims,
+
1041  size_t dim) const {
+
1042  if (dim < dims.size()) { // more dims left
+
1043  o_ << '('; // open(1)
+
1044  generate_expression(dims[dim],o_);
+
1045  if ((dim + 1 < dims.size()) || ctor_args.size() > 0) {
+
1046  o_ << ", ("; // open(2)
+
1047  generate_type(type,dims.size() - dim - 1);
+
1048  generate_init_args(type,ctor_args,dims,dim + 1);
+
1049  o_ << ')'; // close(2)
+
1050  } else if (type == "var") {
+
1051  o_ << ", DUMMY_VAR__";
+
1052  } else if (type == "int") {
+
1053  o_ << ", 0";
+
1054  } else if (type == "double") {
+
1055  o_ << ", 0.0";
+
1056  } else {
+
1057  // shouldn't hit this
+
1058  }
+
1059  o_ << ')'; // close(1)
+
1060  } else {
+
1061  if (ctor_args.size() == 0) { // scalar int or real
+
1062  if (type == "int") {
+
1063  o_ << "(0)";
+
1064  } else if (type == "double") {
+
1065  o_ << "(0.0)";
+
1066  } else if (type == "var") {
+
1067  o_ << "(DUMMY_VAR__)";
+
1068  } else {
+
1069  // shouldn't hit this, either
+
1070  }
+
1071  }
+
1072  else if (ctor_args.size() == 1) {// vector
+
1073  o_ << '(';
+
1074  generate_expression(ctor_args[0],o_);
+
1075  o_ << ')';
+
1076  } else if (ctor_args.size() > 1) { // matrix
+
1077  o_ << '(';
+
1078  generate_expression(ctor_args[0],o_);
+
1079  o_ << ',';
+
1080  generate_expression(ctor_args[1],o_);
+
1081  o_ << ')';
+
1082  }
+
1083  }
+
1084  }
+
1085  void declare_array(const std::string& type,
+
1086  const std::vector<expression>& ctor_args,
+
1087  const std::string& name,
+
1088  const std::vector<expression>& dims) const {
+
1089 
+
1090  // require double parens to counter "most vexing parse" problem
+
1091 
+ +
1093  generate_type(type,dims.size());
+
1094  o_ << ' ' << name;
+
1095  generate_init_args(type,ctor_args,dims,0);
+
1096  o_ << ';' << EOL;
+
1097  if (dims.size() == 0) {
+ + +
1100  o_ << EOL;
+
1101  }
+
1102  if (type == "Eigen::Matrix<T__,Eigen::Dynamic,Eigen::Dynamic> "
+
1103  || type == "Eigen::Matrix<T__,1,Eigen::Dynamic> "
+
1104  || type == "Eigen::Matrix<T__,Eigen::Dynamic,1> ") {
+ +
1106  o_ << "stan::math::fill(" << name << ",DUMMY_VAR__);" << EOL;
+
1107  }
+
1108  }
+
1109  };
+
1110 
+
1111  void generate_local_var_decls(const std::vector<var_decl>& vs,
+
1112  int indent,
+
1113  std::ostream& o,
+
1114  bool is_var) {
+
1115  local_var_decl_visgen vis(indent,is_var,o);
+
1116  for (size_t i = 0; i < vs.size(); ++i)
+
1117  boost::apply_visitor(vis,vs[i].decl_);
+
1118  }
+
1119 
+
1120 
+
1121 
+ +
1123  const bool declare_vars_;
+
1124  const bool is_var_;
+
1125  const int indent_;
+ +
1127  bool is_var,
+
1128  int indent,
+
1129  std::ostream& o)
+
1130  : visgen(o),
+
1131  declare_vars_(declare_vars),
+
1132  is_var_(is_var),
+
1133  indent_(indent) {
+
1134  }
+
1135  void operator()(const nil& /*x*/) const {
+
1136  // no-op
+
1137  }
+
1138  void operator()(const int_var_decl& x) const {
+
1139  // no-op; ints need no init to prevent crashes and no NaN available
+
1140  }
+
1141  void operator()(const double_var_decl& x) const {
+
1142  generate_init(x);
+
1143  }
+
1144  void operator()(const vector_var_decl& x) const {
+
1145  generate_init(x);
+
1146  }
+
1147  void operator()(const row_vector_var_decl& x) const {
+
1148  generate_init(x);
+
1149  }
+
1150  void operator()(const matrix_var_decl& x) const {
+
1151  generate_init(x);
+
1152  }
+
1153  void operator()(const unit_vector_var_decl& x) const {
+
1154  generate_init(x);
+
1155  }
+
1156  void operator()(const simplex_var_decl& x) const {
+
1157  generate_init(x);
+
1158  }
+
1159  void operator()(const ordered_var_decl& x) const {
+
1160  generate_init(x);
+
1161  }
+
1162  void operator()(const positive_ordered_var_decl& x) const {
+
1163  generate_init(x);
+
1164  }
+
1165  void operator()(const cholesky_factor_var_decl& x) const {
+
1166  generate_init(x);
+
1167  }
+
1168  void operator()(const cov_matrix_var_decl& x) const {
+
1169  generate_init(x);
+
1170  }
+
1171  void operator()(const corr_matrix_var_decl& x) const {
+
1172  generate_init(x);
+
1173  }
+
1174  template <typename T>
+
1175  void generate_init(const T& x) const {
+ +
1177  o_ << "stan::math::initialize(" << x.name_ << ", "
+
1178  << (is_var_ ? "DUMMY_VAR__" : "std::numeric_limits<double>::quiet_NaN()")
+
1179  << ");"
+
1180  << EOL;
+
1181  }
+
1182  };
+
1183 
+
1184  void generate_local_var_init_nan(const std::vector<var_decl>& vs,
+
1185  int indent,
+
1186  std::ostream& o,
+
1187  bool is_var) {
+
1188  generate_local_var_init_nan_visgen vis(indent,is_var,indent,o);
+
1189  for (size_t i = 0; i < vs.size(); ++i)
+
1190  boost::apply_visitor(vis,vs[i].decl_);
+
1191  }
+
1192 
+
1193 
+
1194  // see member_var_decl_visgen cut & paste
+ +
1196  int indent_;
+ +
1198  std::ostream& o)
+
1199  : visgen(o),
+
1200  indent_(indent) {
+
1201  }
+
1202  void operator()(nil const& /*x*/) const { }
+
1203  void operator()(int_var_decl const& x) const {
+ +
1205  o_ << "stan::math::fill(" << x.name_ << ",DUMMY_VAR__);" << EOL;
+
1206  }
+
1207  void operator()(double_var_decl const& x) const {
+ +
1209  o_ << "stan::math::fill(" << x.name_ << ",DUMMY_VAR__);" << EOL;
+
1210  }
+
1211  void operator()(vector_var_decl const& x) const {
+ +
1213  o_ << "stan::math::fill(" << x.name_ << ",DUMMY_VAR__);" << EOL;
+
1214  }
+
1215  void operator()(row_vector_var_decl const& x) const {
+ +
1217  o_ << "stan::math::fill(" << x.name_ << ",DUMMY_VAR__);" << EOL;
+
1218  }
+
1219  void operator()(matrix_var_decl const& x) const {
+ +
1221  o_ << "stan::math::fill(" << x.name_ << ",DUMMY_VAR__);" << EOL;
+
1222  }
+
1223  void operator()(unit_vector_var_decl const& x) const {
+ +
1225  o_ << "stan::math::fill(" << x.name_ << ",DUMMY_VAR__);" << EOL;
+
1226  }
+
1227  void operator()(simplex_var_decl const& x) const {
+ +
1229  o_ << "stan::math::fill(" << x.name_ << ",DUMMY_VAR__);" << EOL;
+
1230  }
+
1231  void operator()(ordered_var_decl const& x) const {
+ +
1233  o_ << "stan::math::fill(" << x.name_ << ",DUMMY_VAR__);" << EOL;
+
1234  }
+
1235  void operator()(positive_ordered_var_decl const& x) const {
+ +
1237  o_ << "stan::math::fill(" << x.name_ << ",DUMMY_VAR__);" << EOL;
+
1238  }
+
1239  void operator()(cholesky_factor_var_decl const& x) const {
+ +
1241  o_ << "stan::math::fill(" << x.name_ << ",DUMMY_VAR__);" << EOL;
+
1242  }
+
1243  void operator()(cov_matrix_var_decl const& x) const {
+ +
1245  o_ << "stan::math::fill(" << x.name_ << ",DUMMY_VAR__);" << EOL;
+
1246  }
+
1247  void operator()(corr_matrix_var_decl const& x) const {
+ +
1249  o_ << "stan::math::fill(" << x.name_ << ",DUMMY_VAR__);" << EOL;
+
1250  }
+
1251  };
+
1252 
+
1253  void generate_init_vars(const std::vector<var_decl>& vs,
+
1254  int indent,
+
1255  std::ostream& o) {
+
1256  generate_init_vars_visgen vis(indent,o);
+
1257  o << EOL;
+
1258  generate_comment("initialized transformed params to avoid seg fault on val access",
+
1259  indent,o);
+
1260  generate_indent(indent,o);
+
1261  for (size_t i = 0; i < vs.size(); ++i)
+
1262  boost::apply_visitor(vis,vs[i].decl_);
+
1263  }
+
1264 
+
1265 
+ + + +
1269  std::ostream& o)
+
1270  : visgen(o),
+
1271  indents_(indents)
+
1272  { }
+
1273  void operator()(nil const& /*x*/) const { }
+
1274  void operator()(int_var_decl const& x) const {
+
1275  std::vector<expression> dims(x.dims_);
+
1276  validate_array(x.name_,dims,0);
+
1277  }
+
1278  void operator()(double_var_decl const& x) const {
+
1279  std::vector<expression> dims(x.dims_);
+
1280  validate_array(x.name_,dims,0);
+
1281  }
+
1282  void operator()(vector_var_decl const& x) const {
+
1283  std::vector<expression> dims(x.dims_);
+
1284  dims.push_back(x.M_);
+
1285  validate_array(x.name_,dims,1);
+
1286  }
+
1287  void operator()(unit_vector_var_decl const& x) const {
+
1288  std::vector<expression> dims(x.dims_);
+
1289  dims.push_back(x.K_);
+
1290  validate_array(x.name_,dims,1);
+
1291  }
+
1292  void operator()(simplex_var_decl const& x) const {
+
1293  std::vector<expression> dims(x.dims_);
+
1294  dims.push_back(x.K_);
+
1295  validate_array(x.name_,dims,1);
+
1296  }
+
1297  void operator()(ordered_var_decl const& x) const {
+
1298  std::vector<expression> dims(x.dims_);
+
1299  dims.push_back(x.K_);
+
1300  validate_array(x.name_,dims,1);
+
1301  }
+
1302  void operator()(positive_ordered_var_decl const& x) const {
+
1303  std::vector<expression> dims(x.dims_);
+
1304  dims.push_back(x.K_);
+
1305  validate_array(x.name_,dims,1);
+
1306  }
+
1307  void operator()(row_vector_var_decl const& x) const {
+
1308  std::vector<expression> dims(x.dims_);
+
1309  dims.push_back(x.N_);
+
1310  validate_array(x.name_,dims,1);
+
1311  }
+
1312  void operator()(matrix_var_decl const& x) const {
+
1313  std::vector<expression> dims(x.dims_);
+
1314  dims.push_back(x.M_);
+
1315  dims.push_back(x.N_);
+
1316  validate_array(x.name_,dims,2);
+
1317  }
+
1318  void operator()(cholesky_factor_var_decl const& x) const {
+
1319  std::vector<expression> dims(x.dims_);
+
1320  dims.push_back(x.M_);
+
1321  dims.push_back(x.N_);
+
1322  validate_array(x.name_,dims,2);
+
1323  }
+
1324  void operator()(cov_matrix_var_decl const& x) const {
+
1325  std::vector<expression> dims(x.dims_);
+
1326  dims.push_back(x.K_);
+
1327  dims.push_back(x.K_);
+
1328  validate_array(x.name_,dims,2);
+
1329  }
+
1330  void operator()(corr_matrix_var_decl const& x) const {
+
1331  std::vector<expression> dims(x.dims_);
+
1332  dims.push_back(x.K_);
+
1333  dims.push_back(x.K_);
+
1334  validate_array(x.name_,dims,2);
+
1335  }
+
1336  void validate_array(const std::string& name,
+
1337  const std::vector<expression>& dims,
+
1338  size_t matrix_dims) const {
+
1339 
+
1340  size_t non_matrix_dims = dims.size() - matrix_dims;
+
1341 
+
1342  for (size_t k = 0; k < dims.size(); ++k) {
+ +
1344  o_ << "for (int i" << k << "__ = 0; i" << k << "__ < ";
+
1345  generate_expression(dims[k],o_);
+
1346  o_ << "; ++i" << k << "__) {" << EOL;
+
1347  }
+
1348 
+
1349  generate_indent(indents_ + dims.size(), o_);
+
1350  o_ << "if (stan::math::is_uninitialized(" << name;
+
1351  for (size_t k = 0; k < non_matrix_dims; ++k)
+
1352  o_ << "[i" << k << "__]";
+
1353  if (matrix_dims > 0) {
+
1354  o_ << "(i" << non_matrix_dims << "__";
+
1355  if (matrix_dims > 1)
+
1356  o_ << ",i" << (non_matrix_dims + 1) << "__";
+
1357  o_ << ')';
+
1358  }
+
1359  o_ << ")) {" << EOL;
+
1360  generate_indent(indents_ + dims.size() + 1, o_);
+
1361  o_ << "std::stringstream msg__;" << EOL;
+
1362  generate_indent(indents_ + dims.size() + 1, o_);
+
1363  o_ << "msg__ << \"Undefined transformed parameter: "
+
1364  << name << "\"";
+
1365  for (size_t k = 0; k < dims.size(); ++k) {
+
1366  o_ << " << '['";
+
1367  o_ << " << i" << k << "__";
+
1368  o_ << " << ']'";
+
1369  }
+
1370  o_ << ';' << EOL;
+
1371  generate_indent(indents_ + dims.size() + 1, o_);
+
1372  o_ << "throw std::runtime_error(msg__.str());" << EOL;
+
1373 
+
1374  generate_indent(indents_ + dims.size(), o_);
+
1375  o_ << "}" << EOL;
+
1376  for (size_t k = 0; k < dims.size(); ++k) {
+
1377  generate_indent(indents_ + dims.size() - k - 1, o_);
+
1378  o_ << "}" << EOL;
+
1379  }
+
1380  }
+
1381  };
+
1382 
+
1383  void generate_validate_transformed_params(const std::vector<var_decl>& vs,
+
1384  int indent,
+
1385  std::ostream& o) {
+
1386  generate_comment("validate transformed parameters",indent,o);
+
1387  validate_transformed_params_visgen vis(indent,o);
+
1388  for (size_t i = 0; i < vs.size(); ++i)
+
1389  boost::apply_visitor(vis,vs[i].decl_);
+
1390  o << EOL;
+
1391  }
+
1392 
+
1393  void generate_statement(statement const& s, int indent, std::ostream& o,
+
1394  bool include_sampling, bool is_var);
+
1395 
+
1396  struct statement_visgen : public visgen {
+
1397  size_t indent_;
+ +
1399  bool is_var_;
+
1400  statement_visgen(size_t indent,
+
1401  bool include_sampling,
+
1402  bool is_var,
+
1403  std::ostream& o)
+
1404  : visgen(o),
+
1405  indent_(indent),
+
1406  include_sampling_(include_sampling),
+
1407  is_var_(is_var) {
+
1408  }
+
1409  void operator()(nil const& /*x*/) const {
+
1410  }
+
1411  void operator()(assignment const& x) const {
+ +
1413  o_ << "stan::math::assign(";
+
1414  generate_indexed_expr<true>(x.var_dims_.name_,
+
1415  x.var_dims_.dims_,
+ +
1417  x.var_type_.dims_.size(),
+
1418  o_);
+
1419  o_ << ", ";
+
1420  generate_expression(x.expr_,o_);
+
1421  o_ << ");" << EOL;
+
1422  }
+
1423  void operator()(expression const& x) const {
+
1424  throw std::invalid_argument("expression statements not yet supported");
+
1425  }
+
1426  void operator()(sample const& x) const {
+
1427  if (!include_sampling_) return;
+ +
1429  o_ << "lp_accum__.add(" << x.dist_.family_ << "_log<propto__>(";
+ +
1431  for (size_t i = 0; i < x.dist_.args_.size(); ++i) {
+
1432  o_ << ", ";
+ +
1434  }
+
1435  o_ << "));" << EOL;
+
1436  // rest of impl is for truncation
+
1437  // generate bounds test
+
1438  if (x.truncation_.has_low()) {
+ +
1440  o_ << "if (";
+ +
1442  o_ << " < ";
+ +
1444  // bound
+
1445  o_ << ") lp_accum__.add(-std::numeric_limits<double>::infinity());" << EOL;
+
1446  }
+
1447  if (x.truncation_.has_high()) {
+ +
1449  if (x.truncation_.has_low()) o_ << "else ";
+
1450  o_ << "if (";
+ +
1452  o_ << " > ";
+ +
1454  // bound
+
1455  o_ << ") lp_accum__.add(-std::numeric_limits<double>::infinity());" << EOL;
+
1456  }
+
1457  // generate log denominator for case where bounds test pass
+
1458  if (x.truncation_.has_low() || x.truncation_.has_high()) {
+ +
1460  o_ << "else ";
+
1461  }
+
1462  if (x.truncation_.has_low() && x.truncation_.has_high()) {
+
1463  // T[L,U]: -log_diff_exp(Dist_cdf_log(U|params),Dist_cdf_log(L|Params))
+
1464  o_ << "lp_accum__.add(-log_diff_exp(";
+
1465  o_ << x.dist_.family_ << "_cdf_log(";
+ +
1467  for (size_t i = 0; i < x.dist_.args_.size(); ++i) {
+
1468  o_ << ", ";
+ +
1470  }
+
1471  o_ << "), " << x.dist_.family_ << "_cdf_log(";
+ +
1473  for (size_t i = 0; i < x.dist_.args_.size(); ++i) {
+
1474  o_ << ", ";
+ +
1476  }
+
1477  o_ << ")));" << EOL;
+
1478  } else if (!x.truncation_.has_low() && x.truncation_.has_high()) {
+
1479  // T[,U]; -Dist_cdf_log(U)
+
1480  o_ << "lp_accum__.add(-";
+
1481  o_ << x.dist_.family_ << "_cdf_log(";
+ +
1483  for (size_t i = 0; i < x.dist_.args_.size(); ++i) {
+
1484  o_ << ", ";
+ +
1486  }
+
1487  o_ << "));" << EOL;
+
1488  } else if (x.truncation_.has_low() && !x.truncation_.has_high()) {
+
1489  // T[L,]: -Dist_ccdf_log(L)
+
1490  o_ << "lp_accum__.add(-";
+
1491  o_ << x.dist_.family_ << "_ccdf_log(";
+ +
1493  for (size_t i = 0; i < x.dist_.args_.size(); ++i) {
+
1494  o_ << ", ";
+ +
1496  }
+
1497  o_ << "));" << EOL;
+
1498  }
+
1499  }
+ + +
1502  o_ << "lp_accum__.add(";
+ +
1504  o_ << ");" << EOL;
+
1505  }
+
1506  void operator()(const statements& x) const {
+
1507  bool has_local_vars = x.local_decl_.size() > 0;
+
1508  size_t indent = has_local_vars ? (indent_ + 1) : indent_;
+
1509  if (has_local_vars) {
+ +
1511  o_ << "{" << EOL; // need brackets for scope
+ + +
1514  }
+
1515 
+
1516  for (size_t i = 0; i < x.statements_.size(); ++i)
+ +
1518 
+
1519  if (has_local_vars) {
+ +
1521  o_ << "}" << EOL;
+
1522  }
+
1523  }
+
1524  void operator()(const print_statement& ps) const {
+ +
1526  o_ << "if (pstream__) {" << EOL;
+
1527  for (size_t i = 0; i < ps.printables_.size(); ++i) {
+
1528  generate_indent(indent_ + 1,o_);
+
1529  o_ << "stan_print(pstream__,";
+ +
1531  o_ << ");" << EOL;
+
1532  }
+
1533  generate_indent(indent_ + 1,o_);
+
1534  o_ << "*pstream__ << std::endl;" << EOL;
+ +
1536  o_ << '}' << EOL;
+
1537  }
+
1538  void operator()(const for_statement& x) const {
+ +
1540  o_ << "for (int " << x.variable_ << " = ";
+ +
1542  o_ << "; " << x.variable_ << " <= ";
+ +
1544  o_ << "; ++" << x.variable_ << ") {" << EOL;
+ + +
1547  o_ << "}" << EOL;
+
1548  }
+
1549  void operator()(const while_statement& x) const {
+ +
1551  o_ << "while (as_bool(";
+ +
1553  o_ << ")) {" << EOL;
+ + +
1556  o_ << "}" << EOL;
+
1557  }
+
1558  void operator()(const conditional_statement& x) const {
+
1559  for (size_t i = 0; i < x.conditions_.size(); ++i) {
+
1560  if (i == 0)
+ +
1562  else
+
1563  o_ << " else ";
+
1564  o_ << "if (as_bool(";
+ +
1566  o_ << ")) {" << EOL;
+
1567  generate_statement(x.bodies_[i], indent_ + 1,
+ + +
1570  o_ << '}';
+
1571  }
+
1572  if (x.bodies_.size() > x.conditions_.size()) {
+
1573  o_ << " else {" << EOL;
+
1574  generate_statement(x.bodies_[x.bodies_.size()-1], indent_ + 1,
+ +
1576  generate_indent(indent_,o_);
+
1577  o_ << '}';
+
1578  }
+
1579  o_ << EOL;
+
1580  }
+
1581  void operator()(const no_op_statement& /*x*/) const {
+
1582  }
+
1583  };
+
1584 
+ +
1586  int indent,
+
1587  std::ostream& o,
+
1588  bool include_sampling,
+
1589  bool is_var) {
+
1590  statement_visgen vis(indent,include_sampling,is_var,o);
+
1591  boost::apply_visitor(vis,s.statement_);
+
1592  }
+
1593 
+
1594  void generate_statements(const std::vector<statement>& ss,
+
1595  int indent,
+
1596  std::ostream& o,
+
1597  bool include_sampling,
+
1598  bool is_var) {
+
1599  statement_visgen vis(indent,include_sampling,is_var,o);
+
1600  for (size_t i = 0; i < ss.size(); ++i)
+
1601  boost::apply_visitor(vis,ss[i].statement_);
+
1602  }
+
1603 
+
1604 
+ +
1606  std::ostream& o) {
+
1607 
+
1608 
+
1609  o << EOL;
+
1610  o << INDENT << "template <bool propto__, bool jacobian__, typename T__>" << EOL;
+
1611  o << INDENT << "T__ log_prob(vector<T__>& params_r__," << EOL;
+
1612  o << INDENT << " vector<int>& params_i__," << EOL;
+
1613  o << INDENT << " std::ostream* pstream__ = 0) const {" << EOL2;
+
1614 
+
1615  // use this dummy for inits
+
1616  o << INDENT2 << "T__ DUMMY_VAR__(std::numeric_limits<double>::quiet_NaN());" << EOL;
+
1617  o << INDENT2 << "(void) DUMMY_VAR__; // suppress unused var warning" << EOL2;
+
1618 
+
1619  o << INDENT2 << "T__ lp__(0.0);" << EOL;
+
1620  o << INDENT2 << "stan::math::accumulator<T__> lp_accum__;" << EOL2;
+
1621 
+
1622  bool is_var = true;
+
1623 
+
1624  generate_comment("model parameters",2,o);
+
1625  generate_local_var_inits(p.parameter_decl_,is_var,true,o);
+
1626  o << EOL;
+
1627 
+
1628  generate_comment("transformed parameters",2,o);
+
1629  generate_local_var_decls(p.derived_decl_.first,2,o,is_var);
+
1630  generate_init_vars(p.derived_decl_.first,2,o);
+
1631 
+
1632  o << EOL;
+
1633  bool include_sampling = true;
+
1634  generate_statements(p.derived_decl_.second,2,o,include_sampling,is_var);
+
1635  o << EOL;
+
1636 
+ +
1638  o << INDENT2
+
1639  << "const char* function__ = \"validate transformed params %1%\";"
+
1640  << EOL;
+
1641  o << INDENT2
+
1642  << "(void) function__; // dummy to suppress unused var warning"
+
1643  << EOL;
+
1644 
+ +
1646 
+
1647  generate_comment("model body",2,o);
+
1648  generate_statement(p.statement_,2,o,include_sampling,is_var);
+
1649  o << EOL;
+
1650  o << INDENT2 << "lp_accum__.add(lp__);" << EOL;
+
1651  o << INDENT2 << "return lp_accum__.sum();" << EOL2;
+
1652  o << INDENT << "} // log_prob()" << EOL2;
+
1653 
+
1654  o << INDENT << "template <bool propto, bool jacobian, typename T>" << EOL;
+
1655  o << INDENT << "T log_prob(Eigen::Matrix<T,Eigen::Dynamic,1>& params_r," << EOL;
+
1656  o << INDENT << " std::ostream* pstream = 0) const {" << EOL;
+
1657  o << INDENT << " std::vector<T> vec_params_r;" << EOL;
+
1658  o << INDENT << " vec_params_r.reserve(params_r.size());" << EOL;
+
1659  o << INDENT << " for (int i = 0; i < params_r.size(); ++i)" << EOL;
+
1660  o << INDENT << " vec_params_r.push_back(params_r(i));" << EOL;
+
1661  o << INDENT << " std::vector<int> vec_params_i;" << EOL;
+
1662  o << INDENT << " return log_prob<propto,jacobian,T>(vec_params_r, vec_params_i, pstream);" << EOL;
+
1663  o << INDENT << "}" << EOL2;
+
1664  }
+
1665 
+
1666  struct dump_member_var_visgen : public visgen {
+ + +
1669  dump_member_var_visgen(std::ostream& o)
+
1670  : visgen(o),
+ +
1672  var_size_validator_(var_size_validating_visgen(o,"data initialization")) {
+
1673  }
+
1674  void operator()(nil const& /*x*/) const { } // dummy
+
1675  void operator()(int_var_decl const& x) const {
+
1676  std::vector<expression> dims = x.dims_;
+ +
1678  var_resizer_(x);
+
1679  o_ << INDENT2 << "vals_i__ = context__.vals_i(\"" << x.name_ << "\");" << EOL;
+
1680  o_ << INDENT2 << "pos__ = 0;" << EOL;
+
1681  size_t indentation = 1;
+
1682  for (size_t dim_up = 0U; dim_up < dims.size(); ++dim_up) {
+
1683  size_t dim = dims.size() - dim_up - 1U;
+
1684  ++indentation;
+
1685  generate_indent(indentation,o_);
+
1686  o_ << "size_t " << x.name_ << "_limit_" << dim << "__ = ";
+
1687  generate_expression(dims[dim],o_);
+
1688  o_ << ";" << EOL;
+
1689  generate_indent(indentation,o_);
+
1690  o_ << "for (size_t i_" << dim << "__ = 0; i_"
+
1691  << dim << "__ < " << x.name_ << "_limit_" << dim
+
1692  << "__; ++i_" << dim << "__) {" << EOL;
+
1693  }
+
1694  generate_indent(indentation+1,o_);
+
1695  o_ << x.name_;
+
1696  for (size_t dim = 0; dim < dims.size(); ++dim)
+
1697  o_ << "[i_" << dim << "__]";
+
1698  o_ << " = vals_i__[pos__++];" << EOL;
+
1699  for (size_t dim = 0; dim < dims.size(); ++dim) {
+
1700  generate_indent(dims.size() + 1 - dim,o_);
+
1701  o_ << "}" << EOL;
+
1702  }
+
1703  }
+
1704  // minor changes to int_var_decl
+
1705  void operator()(double_var_decl const& x) const {
+
1706  std::vector<expression> dims = x.dims_;
+ +
1708  var_resizer_(x);
+
1709  o_ << INDENT2 << "vals_r__ = context__.vals_r(\"" << x.name_ << "\");" << EOL;
+
1710  o_ << INDENT2 << "pos__ = 0;" << EOL;
+
1711  size_t indentation = 1;
+
1712  for (size_t dim_up = 0U; dim_up < dims.size(); ++dim_up) {
+
1713  size_t dim = dims.size() - dim_up - 1U;
+
1714  ++indentation;
+
1715  generate_indent(indentation,o_);
+
1716  o_ << "size_t " << x.name_ << "_limit_" << dim << "__ = ";
+
1717  generate_expression(dims[dim],o_);
+
1718  o_ << ";" << EOL;
+
1719  generate_indent(indentation,o_);
+
1720  o_ << "for (size_t i_" << dim << "__ = 0; i_" << dim << "__ < " << x.name_ << "_limit_" << dim << "__; ++i_" << dim << "__) {" << EOL;
+
1721  }
+
1722  generate_indent(indentation+1,o_);
+
1723  o_ << x.name_;
+
1724  for (size_t dim = 0; dim < dims.size(); ++dim)
+
1725  o_ << "[i_" << dim << "__]";
+
1726  o_ << " = vals_r__[pos__++];" << EOL;
+
1727  for (size_t dim = 0; dim < dims.size(); ++dim) {
+
1728  generate_indent(dims.size() + 1 - dim,o_);
+
1729  o_ << "}" << EOL;
+
1730  }
+
1731  }
+
1732  // extra outer loop around double_var_decl
+
1733  void operator()(vector_var_decl const& x) const {
+
1734  std::vector<expression> dims = x.dims_;
+
1735  var_resizer_(x);
+ +
1737  o_ << INDENT2 << "vals_r__ = context__.vals_r(\"" << x.name_ << "\");" << EOL;
+
1738  o_ << INDENT2 << "pos__ = 0;" << EOL;
+
1739  o_ << INDENT2 << "size_t " << x.name_ << "_i_vec_lim__ = ";
+ +
1741  o_ << ";" << EOL;
+
1742  o_ << INDENT2 << "for (size_t " << "i_vec__ = 0; " << "i_vec__ < " << x.name_ << "_i_vec_lim__; ++i_vec__) {" << EOL;
+
1743  size_t indentation = 2;
+
1744  for (size_t dim_up = 0U; dim_up < dims.size(); ++dim_up) {
+
1745  size_t dim = dims.size() - dim_up - 1U;
+
1746  ++indentation;
+
1747  generate_indent(indentation,o_);
+
1748  o_ << "size_t " << x.name_ << "_limit_" << dim << "__ = ";
+
1749  generate_expression(dims[dim],o_);
+
1750  o_ << ";" << EOL;
+
1751  generate_indent(indentation,o_);
+
1752  o_ << "for (size_t i_" << dim << "__ = 0; i_" << dim << "__ < " << x.name_ << "_limit_" << dim << "__; ++i_" << dim << "__) {" << EOL;
+
1753  }
+
1754  generate_indent(indentation+1,o_);
+
1755  o_ << x.name_;
+
1756  for (size_t dim = 0; dim < dims.size(); ++dim)
+
1757  o_ << "[i_" << dim << "__]";
+
1758  o_ << "[i_vec__]";
+
1759  o_ << " = vals_r__[pos__++];" << EOL;
+
1760  for (size_t dim = 0; dim < dims.size(); ++dim) {
+
1761  generate_indent(dims.size() + 2 - dim,o_);
+
1762  o_ << "}" << EOL;
+
1763  }
+
1764  o_ << INDENT2 << "}" << EOL;
+
1765  }
+
1766  // change variable name from vector_var_decl
+
1767  void operator()(row_vector_var_decl const& x) const {
+
1768  std::vector<expression> dims = x.dims_;
+ +
1770  var_resizer_(x);
+
1771  o_ << INDENT2 << "vals_r__ = context__.vals_r(\"" << x.name_ << "\");" << EOL;
+
1772  o_ << INDENT2 << "pos__ = 0;" << EOL;
+
1773  o_ << INDENT2 << "size_t " << x.name_ << "_i_vec_lim__ = ";
+ +
1775  o_ << ";" << EOL;
+
1776  o_ << INDENT2 << "for (size_t " << "i_vec__ = 0; " << "i_vec__ < " << x.name_ << "_i_vec_lim__; ++i_vec__) {" << EOL;
+
1777  size_t indentation = 2;
+
1778  for (size_t dim_up = 0U; dim_up < dims.size(); ++dim_up) {
+
1779  size_t dim = dims.size() - dim_up - 1U;
+
1780  ++indentation;
+
1781  generate_indent(indentation,o_);
+
1782  o_ << "size_t " << x.name_ << "_limit_" << dim << "__ = ";
+
1783  generate_expression(dims[dim],o_);
+
1784  o_ << ";" << EOL;
+
1785  generate_indent(indentation,o_);
+
1786  o_ << "for (size_t i_" << dim << "__ = 0; i_" << dim << "__ < " << x.name_ << "_limit_" << dim << "__; ++i_" << dim << "__) {" << EOL;
+
1787  }
+
1788  generate_indent(indentation+1,o_);
+
1789  o_ << x.name_;
+
1790  for (size_t dim = 0; dim < dims.size(); ++dim)
+
1791  o_ << "[i_" << dim << "__]";
+
1792  o_ << "[i_vec__]";
+
1793  o_ << " = vals_r__[pos__++];" << EOL;
+
1794  for (size_t dim = 0; dim < dims.size(); ++dim) {
+
1795  generate_indent(dims.size() + 2 - dim,o_);
+
1796  o_ << "}" << EOL;
+
1797  }
+
1798  o_ << INDENT2 << "}" << EOL;
+
1799  }
+
1800  // same as simplex
+
1801  void operator()(unit_vector_var_decl const& x) const {
+
1802  std::vector<expression> dims = x.dims_;
+ +
1804  var_resizer_(x);
+
1805  o_ << INDENT2 << "vals_r__ = context__.vals_r(\"" << x.name_ << "\");" << EOL;
+
1806  o_ << INDENT2 << "pos__ = 0;" << EOL;
+
1807  o_ << INDENT2 << "size_t " << x.name_ << "_i_vec_lim__ = ";
+ +
1809  o_ << ";" << EOL;
+
1810  o_ << INDENT2 << "for (size_t " << "i_vec__ = 0; " << "i_vec__ < " << x.name_ << "_i_vec_lim__; ++i_vec__) {" << EOL;
+
1811  size_t indentation = 2;
+
1812  for (size_t dim_up = 0U; dim_up < dims.size(); ++dim_up) {
+
1813  size_t dim = dims.size() - dim_up - 1U;
+
1814  ++indentation;
+
1815  generate_indent(indentation,o_);
+
1816  o_ << "size_t " << x.name_ << "_limit_" << dim << "__ = ";
+
1817  generate_expression(dims[dim],o_);
+
1818  o_ << ";" << EOL;
+
1819  generate_indent(indentation,o_);
+
1820  o_ << "for (size_t i_" << dim << "__ = 0; i_" << dim << "__ < " << x.name_ << "_limit_" << dim << "__; ++i_" << dim << "__) {" << EOL;
+
1821  }
+
1822  generate_indent(indentation+1,o_);
+
1823  o_ << x.name_;
+
1824  for (size_t dim = 0; dim < dims.size(); ++dim)
+
1825  o_ << "[i_" << dim << "__]";
+
1826  o_ << "[i_vec__]";
+
1827  o_ << " = vals_r__[pos__++];" << EOL;
+
1828  for (size_t dim = 0; dim < dims.size(); ++dim) {
+
1829  generate_indent(dims.size() + 2 - dim,o_);
+
1830  o_ << "}" << EOL;
+
1831  }
+
1832  o_ << INDENT2 << "}" << EOL;
+
1833  }
+
1834  // diff name of dims from vector
+
1835  void operator()(simplex_var_decl const& x) const {
+
1836  std::vector<expression> dims = x.dims_;
+ +
1838  var_resizer_(x);
+
1839  o_ << INDENT2 << "vals_r__ = context__.vals_r(\"" << x.name_ << "\");" << EOL;
+
1840  o_ << INDENT2 << "pos__ = 0;" << EOL;
+
1841  o_ << INDENT2 << "size_t " << x.name_ << "_i_vec_lim__ = ";
+ +
1843  o_ << ";" << EOL;
+
1844  o_ << INDENT2 << "for (size_t " << "i_vec__ = 0; " << "i_vec__ < " << x.name_ << "_i_vec_lim__; ++i_vec__) {" << EOL;
+
1845  size_t indentation = 2;
+
1846  for (size_t dim_up = 0U; dim_up < dims.size(); ++dim_up) {
+
1847  size_t dim = dims.size() - dim_up - 1U;
+
1848  ++indentation;
+
1849  generate_indent(indentation,o_);
+
1850  o_ << "size_t " << x.name_ << "_limit_" << dim << "__ = ";
+
1851  generate_expression(dims[dim],o_);
+
1852  o_ << ";" << EOL;
+
1853  generate_indent(indentation,o_);
+
1854  o_ << "for (size_t i_" << dim << "__ = 0; i_" << dim << "__ < " << x.name_ << "_limit_" << dim << "__; ++i_" << dim << "__) {" << EOL;
+
1855  }
+
1856  generate_indent(indentation+1,o_);
+
1857  o_ << x.name_;
+
1858  for (size_t dim = 0; dim < dims.size(); ++dim)
+
1859  o_ << "[i_" << dim << "__]";
+
1860  o_ << "[i_vec__]";
+
1861  o_ << " = vals_r__[pos__++];" << EOL;
+
1862  for (size_t dim = 0; dim < dims.size(); ++dim) {
+
1863  generate_indent(dims.size() + 2 - dim,o_);
+
1864  o_ << "}" << EOL;
+
1865  }
+
1866  o_ << INDENT2 << "}" << EOL;
+
1867  }
+
1868  // same as simplex
+
1869  void operator()(ordered_var_decl const& x) const {
+
1870  std::vector<expression> dims = x.dims_;
+ +
1872  var_resizer_(x);
+
1873  o_ << INDENT2 << "vals_r__ = context__.vals_r(\"" << x.name_ << "\");" << EOL;
+
1874  o_ << INDENT2 << "pos__ = 0;" << EOL;
+
1875  o_ << INDENT2 << "size_t " << x.name_ << "_i_vec_lim__ = ";
+ +
1877  o_ << ";" << EOL;
+
1878  o_ << INDENT2 << "for (size_t " << "i_vec__ = 0; " << "i_vec__ < " << x.name_ << "_i_vec_lim__; ++i_vec__) {" << EOL;
+
1879  size_t indentation = 2;
+
1880  for (size_t dim_up = 0U; dim_up < dims.size(); ++dim_up) {
+
1881  size_t dim = dims.size() - dim_up - 1U;
+
1882  ++indentation;
+
1883  generate_indent(indentation,o_);
+
1884  o_ << "size_t " << x.name_ << "_limit_" << dim << "__ = ";
+
1885  generate_expression(dims[dim],o_);
+
1886  o_ << ";" << EOL;
+
1887  generate_indent(indentation,o_);
+
1888  o_ << "for (size_t i_" << dim << "__ = 0; i_" << dim << "__ < " << x.name_ << "_limit_" << dim << "__; ++i_" << dim << "__) {" << EOL;
+
1889  }
+
1890  generate_indent(indentation+1,o_);
+
1891  o_ << x.name_;
+
1892  for (size_t dim = 0; dim < dims.size(); ++dim)
+
1893  o_ << "[i_" << dim << "__]";
+
1894  o_ << "[i_vec__]";
+
1895  o_ << " = vals_r__[pos__++];" << EOL;
+
1896  for (size_t dim = 0; dim < dims.size(); ++dim) {
+
1897  generate_indent(dims.size() + 2 - dim,o_);
+
1898  o_ << "}" << EOL;
+
1899  }
+
1900  o_ << INDENT2 << "}" << EOL;
+
1901  }
+
1902  // same as simplex
+
1903  void operator()(positive_ordered_var_decl const& x) const {
+
1904  std::vector<expression> dims = x.dims_;
+ +
1906  var_resizer_(x);
+
1907  o_ << INDENT2 << "vals_r__ = context__.vals_r(\"" << x.name_ << "\");" << EOL;
+
1908  o_ << INDENT2 << "pos__ = 0;" << EOL;
+
1909  o_ << INDENT2 << "size_t " << x.name_ << "_i_vec_lim__ = ";
+ +
1911  o_ << ";" << EOL;
+
1912  o_ << INDENT2 << "for (size_t " << "i_vec__ = 0; " << "i_vec__ < " << x.name_ << "_i_vec_lim__; ++i_vec__) {" << EOL;
+
1913  size_t indentation = 2;
+
1914  for (size_t dim_up = 0U; dim_up < dims.size(); ++dim_up) {
+
1915  size_t dim = dims.size() - dim_up - 1U;
+
1916  ++indentation;
+
1917  generate_indent(indentation,o_);
+
1918  o_ << "size_t " << x.name_ << "_limit_" << dim << "__ = ";
+
1919  generate_expression(dims[dim],o_);
+
1920  o_ << ";" << EOL;
+
1921  generate_indent(indentation,o_);
+
1922  o_ << "for (size_t i_" << dim << "__ = 0; i_" << dim << "__ < " << x.name_ << "_limit_" << dim << "__; ++i_" << dim << "__) {" << EOL;
+
1923  }
+
1924  generate_indent(indentation+1,o_);
+
1925  o_ << x.name_;
+
1926  for (size_t dim = 0; dim < dims.size(); ++dim)
+
1927  o_ << "[i_" << dim << "__]";
+
1928  o_ << "[i_vec__]";
+
1929  o_ << " = vals_r__[pos__++];" << EOL;
+
1930  for (size_t dim = 0; dim < dims.size(); ++dim) {
+
1931  generate_indent(dims.size() + 2 - dim,o_);
+
1932  o_ << "}" << EOL;
+
1933  }
+
1934  o_ << INDENT2 << "}" << EOL;
+
1935  }
+
1936  // extra loop and different accessor vs. vector
+
1937  void operator()(matrix_var_decl const& x) const {
+
1938  std::vector<expression> dims = x.dims_;
+ +
1940  var_resizer_(x);
+
1941  o_ << INDENT2 << "vals_r__ = context__.vals_r(\"" << x.name_ << "\");" << EOL;
+
1942  o_ << INDENT2 << "pos__ = 0;" << EOL;
+
1943  o_ << INDENT2 << "size_t " << x.name_ << "_m_mat_lim__ = ";
+ +
1945  o_ << ";" << EOL;
+
1946  o_ << INDENT2 << "size_t " << x.name_ << "_n_mat_lim__ = ";
+ +
1948  o_ << ";" << EOL;
+
1949  o_ << INDENT2 << "for (size_t " << "n_mat__ = 0; " << "n_mat__ < " << x.name_ << "_n_mat_lim__; ++n_mat__) {" << EOL;
+
1950  o_ << INDENT3 << "for (size_t " << "m_mat__ = 0; " << "m_mat__ < " << x.name_ << "_m_mat_lim__; ++m_mat__) {" << EOL;
+
1951  size_t indentation = 3;
+
1952  for (size_t dim_up = 0U; dim_up < dims.size(); ++dim_up) {
+
1953  size_t dim = dims.size() - dim_up - 1U;
+
1954  ++indentation;
+
1955  generate_indent(indentation,o_);
+
1956  o_ << "size_t " << x.name_ << "_limit_" << dim << "__ = ";
+
1957  generate_expression(dims[dim],o_);
+
1958  o_ << ";" << EOL;
+
1959  generate_indent(indentation,o_);
+
1960  o_ << "for (size_t i_" << dim << "__ = 0; i_" << dim << "__ < " << x.name_ << "_limit_" << dim << "__; ++i_" << dim << "__) {" << EOL;
+
1961  }
+
1962  generate_indent(indentation+1,o_);
+
1963  o_ << x.name_;
+
1964  for (size_t dim = 0; dim < dims.size(); ++dim)
+
1965  o_ << "[i_" << dim << "__]";
+
1966  o_ << "(m_mat__,n_mat__)";
+
1967  o_ << " = vals_r__[pos__++];" << EOL;
+
1968  for (size_t dim = 0; dim < dims.size(); ++dim) {
+
1969  generate_indent(dims.size() + 2 - dim,o_);
+
1970  o_ << "}" << EOL;
+
1971  }
+
1972  o_ << INDENT3 << "}" << EOL;
+
1973  o_ << INDENT2 << "}" << EOL;
+
1974  }
+
1975  void operator()(corr_matrix_var_decl const& x) const {
+
1976  // FIXME: cut-and-paste of cov_matrix, very slightly different from matrix
+
1977  std::vector<expression> dims = x.dims_;
+ +
1979  var_resizer_(x);
+
1980  o_ << INDENT2 << "vals_r__ = context__.vals_r(\"" << x.name_ << "\");" << EOL;
+
1981  o_ << INDENT2 << "pos__ = 0;" << EOL;
+
1982  o_ << INDENT2 << "size_t " << x.name_ << "_k_mat_lim__ = ";
+ +
1984  o_ << ";" << EOL;
+
1985  o_ << INDENT2 << "for (size_t " << "n_mat__ = 0; " << "n_mat__ < " << x.name_ << "_k_mat_lim__; ++n_mat__) {" << EOL;
+
1986  o_ << INDENT3 << "for (size_t " << "m_mat__ = 0; " << "m_mat__ < " << x.name_ << "_k_mat_lim__; ++m_mat__) {" << EOL;
+
1987  size_t indentation = 3;
+
1988  for (size_t dim_up = 0U; dim_up < dims.size(); ++dim_up) {
+
1989  size_t dim = dims.size() - dim_up - 1U;
+
1990  ++indentation;
+
1991  generate_indent(indentation,o_);
+
1992  o_ << "size_t " << x.name_ << "_limit_" << dim << "__ = ";
+
1993  generate_expression(dims[dim],o_);
+
1994  o_ << ";" << EOL;
+
1995  generate_indent(indentation,o_);
+
1996  o_ << "for (size_t i_" << dim << "__ = 0; i_" << dim << "__ < " << x.name_ << "_limit_" << dim << "__; ++i_" << dim << "__) {" << EOL;
+
1997  }
+
1998  generate_indent(indentation+1,o_);
+
1999  o_ << x.name_;
+
2000  for (size_t dim = 0; dim < dims.size(); ++dim)
+
2001  o_ << "[i_" << dim << "__]";
+
2002  o_ << "(m_mat__,n_mat__)";
+
2003  o_ << " = vals_r__[pos__++];" << EOL;
+
2004  for (size_t dim = 0; dim < dims.size(); ++dim) {
+
2005  generate_indent(dims.size() + 2 - dim,o_);
+
2006  o_ << "}" << EOL;
+
2007  }
+
2008  o_ << INDENT3 << "}" << EOL;
+
2009  o_ << INDENT2 << "}" << EOL;
+
2010  }
+
2011  void operator()(cholesky_factor_var_decl const& x) const {
+
2012  // FIXME: cut and paste of cov_matrix
+
2013  std::vector<expression> dims = x.dims_;
+ +
2015  var_resizer_(x);
+
2016  o_ << INDENT2 << "vals_r__ = context__.vals_r(\"" << x.name_ << "\");" << EOL;
+
2017  o_ << INDENT2 << "pos__ = 0;" << EOL;
+
2018 
+
2019  o_ << INDENT2 << "size_t " << x.name_ << "_m_mat_lim__ = ";
+ +
2021  o_ << ";" << EOL;
+
2022 
+
2023  o_ << INDENT2 << "size_t " << x.name_ << "_n_mat_lim__ = ";
+ +
2025  o_ << ";" << EOL;
+
2026 
+
2027  o_ << INDENT2 << "for (size_t " << "n_mat__ = 0; " << "n_mat__ < " << x.name_ << "_n_mat_lim__; ++n_mat__) {" << EOL;
+
2028  o_ << INDENT3 << "for (size_t " << "m_mat__ = 0; " << "m_mat__ < " << x.name_ << "_m_mat_lim__; ++m_mat__) {" << EOL;
+
2029 
+
2030  size_t indentation = 3;
+
2031  for (size_t dim_up = 0U; dim_up < dims.size(); ++dim_up) {
+
2032  size_t dim = dims.size() - dim_up - 1U;
+
2033  ++indentation;
+
2034  generate_indent(indentation,o_);
+
2035  o_ << "size_t " << x.name_ << "_limit_" << dim << "__ = ";
+
2036  generate_expression(dims[dim],o_);
+
2037  o_ << ";" << EOL;
+
2038  generate_indent(indentation,o_);
+
2039  o_ << "for (size_t i_" << dim << "__ = 0; i_" << dim << "__ < " << x.name_ << "_limit_" << dim << "__; ++i_" << dim << "__) {"
+
2040  << EOL;
+
2041  }
+
2042  generate_indent(indentation+1,o_);
+
2043  o_ << x.name_;
+
2044  for (size_t dim = 0; dim < dims.size(); ++dim)
+
2045  o_ << "[i_" << dim << "__]";
+
2046  o_ << "(m_mat__,n_mat__)";
+
2047  o_ << " = vals_r__[pos__++];" << EOL;
+
2048  for (size_t dim = 0; dim < dims.size(); ++dim) {
+
2049  generate_indent(dims.size() + 2 - dim,o_);
+
2050  o_ << "}" << EOL;
+
2051  }
+
2052 
+
2053  o_ << INDENT3 << "}" << EOL;
+
2054  o_ << INDENT2 << "}" << EOL;
+
2055  }
+
2056  void operator()(cov_matrix_var_decl const& x) const {
+
2057  std::vector<expression> dims = x.dims_;
+ +
2059  var_resizer_(x);
+
2060  o_ << INDENT2 << "vals_r__ = context__.vals_r(\"" << x.name_ << "\");" << EOL;
+
2061  o_ << INDENT2 << "pos__ = 0;" << EOL;
+
2062  o_ << INDENT2 << "size_t " << x.name_ << "_k_mat_lim__ = ";
+ +
2064  o_ << ";" << EOL;
+
2065  o_ << INDENT2 << "for (size_t " << "n_mat__ = 0; " << "n_mat__ < " << x.name_ << "_k_mat_lim__; ++n_mat__) {" << EOL;
+
2066  o_ << INDENT3 << "for (size_t " << "m_mat__ = 0; " << "m_mat__ < " << x.name_ << "_k_mat_lim__; ++m_mat__) {" << EOL;
+
2067  size_t indentation = 3;
+
2068  for (size_t dim_up = 0U; dim_up < dims.size(); ++dim_up) {
+
2069  size_t dim = dims.size() - dim_up - 1U;
+
2070  ++indentation;
+
2071  generate_indent(indentation,o_);
+
2072  o_ << "size_t " << x.name_ << "_limit_" << dim << "__ = ";
+
2073  generate_expression(dims[dim],o_);
+
2074  o_ << ";" << EOL;
+
2075  generate_indent(indentation,o_);
+
2076  o_ << "for (size_t i_" << dim << "__ = 0; i_" << dim << "__ < " << x.name_ << "_limit_" << dim << "__; ++i_" << dim << "__) {" << EOL;
+
2077  }
+
2078  generate_indent(indentation+1,o_);
+
2079  o_ << x.name_;
+
2080  for (size_t dim = 0; dim < dims.size(); ++dim)
+
2081  o_ << "[i_" << dim << "__]";
+
2082  o_ << "(m_mat__,n_mat__)";
+
2083  o_ << " = vals_r__[pos__++];" << EOL;
+
2084  for (size_t dim = 0; dim < dims.size(); ++dim) {
+
2085  generate_indent(dims.size() + 2 - dim,o_);
+
2086  o_ << "}" << EOL;
+
2087  }
+
2088  o_ << INDENT3 << "}" << EOL;
+
2089  o_ << INDENT2 << "}" << EOL;
+
2090  }
+
2091  };
+
2092 
+
2093  void suppress_warning(const std::string& indent,
+
2094  const std::string& var_name,
+
2095  std::ostream& o) {
+
2096  o << indent << "(void) "
+
2097  << var_name << ";"
+
2098  << " // dummy call to supress warning"
+
2099  << EOL;
+
2100  }
+
2101 
+
2102  void generate_member_var_inits(const std::vector<var_decl>& vs,
+
2103  std::ostream& o) {
+
2104  dump_member_var_visgen vis(o);
+
2105  for (size_t i = 0; i < vs.size(); ++i)
+
2106  boost::apply_visitor(vis, vs[i].decl_);
+
2107  }
+
2108 
+
2109  void generate_destructor(const std::string& model_name,
+
2110  std::ostream& o) {
+
2111  o << EOL
+
2112  << INDENT << "~" << model_name << "() { }"
+
2113  << EOL2;
+
2114  }
+
2115 
+
2116  // know all data is set and range expressions only depend on data
+ +
2118  set_param_ranges_visgen(std::ostream& o)
+
2119  : visgen(o) {
+
2120  }
+
2121  void operator()(const nil& /*x*/) const { }
+
2122  void operator()(const int_var_decl& x) const {
+ +
2124  // for loop for ranges
+
2125  for (size_t i = 0; i < x.dims_.size(); ++i) {
+
2126  generate_indent(i + 2, o_);
+
2127  o_ << "for (size_t i_" << i << "__ = 0; ";
+
2128  o_ << "i_" << i << "__ < ";
+ +
2130  o_ << "; ++i_" << i << "__) {" << EOL;
+
2131  }
+
2132  // add range
+
2133  generate_indent(x.dims_.size() + 2,o_);
+
2134  o_ << "param_ranges_i__.push_back(std::pair<int,int>(";
+ +
2136  o_ << ", ";
+ +
2138  o_ << "));" << EOL;
+
2139  // close for loop
+
2140  for (size_t i = 0; i < x.dims_.size(); ++i) {
+
2141  generate_indent(x.dims_.size() + 1 - i, o_);
+
2142  o_ << "}" << EOL;
+
2143  }
+
2144  }
+
2145  void operator()(const double_var_decl& x) const {
+ +
2147  }
+
2148  void operator()(const vector_var_decl& x) const {
+ +
2150  }
+
2151  void operator()(const row_vector_var_decl& x) const {
+ +
2153  }
+
2154  void operator()(const matrix_var_decl& x) const {
+
2155  generate_increment(x.M_,x.N_,x.dims_);
+
2156  }
+
2157  void operator()(const unit_vector_var_decl& x) const {
+
2158  // only K-1 vals
+
2159  o_ << INDENT2 << "num_params_r__ += (";
+ +
2161  o_ << " - 1)";
+
2162  for (size_t i = 0; i < x.dims_.size(); ++i) {
+
2163  o_ << " * ";
+ +
2165  }
+
2166  o_ << ";" << EOL;
+
2167  }
+
2168  void operator()(const simplex_var_decl& x) const {
+
2169  // only K-1 vals
+
2170  o_ << INDENT2 << "num_params_r__ += (";
+ +
2172  o_ << " - 1)";
+
2173  for (size_t i = 0; i < x.dims_.size(); ++i) {
+
2174  o_ << " * ";
+ +
2176  }
+
2177  o_ << ";" << EOL;
+
2178  }
+
2179  void operator()(const ordered_var_decl& x) const {
+ +
2181  }
+
2182  void operator()(const positive_ordered_var_decl& x) const {
+ +
2184  }
+
2185  void operator()(const cholesky_factor_var_decl& x) const {
+
2186  o_ << INDENT2 << "num_params_r__ += ((";
+
2187  // N * (N + 1) / 2 + (M - N) * M
+ +
2189  o_ << " * (";
+ +
2191  o_ << " + 1)) / 2 + (";
+ +
2193  o_ << " - ";
+ +
2195  o_ << ") * ";
+ +
2197  o_ << ")";
+
2198  for (size_t i = 0; i < x.dims_.size(); ++i) {
+
2199  o_ << " * ";
+ +
2201  }
+
2202  o_ << ";" << EOL;
+
2203  }
+
2204  void operator()(const cov_matrix_var_decl& x) const {
+
2205  // (K * (K - 1))/2 + K ?? define fun(K) = ??
+
2206  o_ << INDENT2 << "num_params_r__ += ((";
+ +
2208  o_ << " * (";
+ +
2210  o_ << " - 1)) / 2 + ";
+ +
2212  o_ << ")";
+
2213  for (size_t i = 0; i < x.dims_.size(); ++i) {
+
2214  o_ << " * ";
+ +
2216  }
+
2217  o_ << ";" << EOL;
+
2218  }
+
2219  void operator()(const corr_matrix_var_decl& x) const {
+
2220  o_ << INDENT2 << "num_params_r__ += ((";
+ +
2222  o_ << " * (";
+ +
2224  o_ << " - 1)) / 2)";
+
2225  for (size_t i = 0; i < x.dims_.size(); ++i) {
+
2226  o_ << " * ";
+ +
2228  }
+
2229  o_ << ";" << EOL;
+
2230  }
+
2231  // cut-and-paste from next for r
+
2232  void generate_increment_i(std::vector<expression> dims) const {
+
2233  if (dims.size() == 0) {
+
2234  o_ << INDENT2 << "++num_params_i__;" << EOL;
+
2235  return;
+
2236  }
+
2237  o_ << INDENT2 << "num_params_r__ += ";
+
2238  for (size_t i = 0; i < dims.size(); ++i) {
+
2239  if (i > 0) o_ << " * ";
+
2240  generate_expression(dims[i],o_);
+
2241  }
+
2242  o_ << ";" << EOL;
+
2243  }
+
2244  void generate_increment(std::vector<expression> dims) const {
+
2245  if (dims.size() == 0) {
+
2246  o_ << INDENT2 << "++num_params_r__;" << EOL;
+
2247  return;
+
2248  }
+
2249  o_ << INDENT2 << "num_params_r__ += ";
+
2250  for (size_t i = 0; i < dims.size(); ++i) {
+
2251  if (i > 0) o_ << " * ";
+
2252  generate_expression(dims[i],o_);
+
2253  }
+
2254  o_ << ";" << EOL;
+
2255  }
+ +
2257  std::vector<expression> dims) const {
+
2258  o_ << INDENT2 << "num_params_r__ += ";
+ +
2260  for (size_t i = 0; i < dims.size(); ++i) {
+
2261  o_ << " * ";
+
2262  generate_expression(dims[i],o_);
+
2263  }
+
2264  o_ << ";" << EOL;
+
2265 
+
2266  }
+ +
2268  std::vector<expression> dims) const {
+
2269  o_ << INDENT2 << "num_params_r__ += ";
+ +
2271  o_ << " * ";
+ +
2273  for (size_t i = 0; i < dims.size(); ++i) {
+
2274  o_ << " * ";
+
2275  generate_expression(dims[i],o_);
+
2276  }
+
2277  o_ << ";" << EOL;
+
2278  }
+
2279  };
+
2280 
+
2281  void generate_set_param_ranges(const std::vector<var_decl>& var_decls,
+
2282  std::ostream& o) {
+
2283  // o << EOL;
+
2284  // o << INDENT << "void set_param_ranges() {" << EOL;
+
2285  o << INDENT2 << "num_params_r__ = 0U;" << EOL;
+
2286  o << INDENT2 << "param_ranges_i__.clear();" << EOL;
+
2287  set_param_ranges_visgen vis(o);
+
2288  for (size_t i = 0; i < var_decls.size(); ++i)
+
2289  boost::apply_visitor(vis,var_decls[i].decl_);
+
2290  // o << INDENT << "}" << EOL;
+
2291  }
+
2292 
+
2293  void generate_constructor(const program& prog,
+
2294  const std::string& model_name,
+
2295  std::ostream& o) {
+
2296  o << INDENT << model_name << "(stan::io::var_context& context__," << EOL;
+
2297  o << INDENT << " std::ostream* pstream__ = 0)"
+
2298  << EOL;
+
2299  o << INDENT2 << ": prob_grad::prob_grad(0) {"
+
2300  << EOL; // resize 0 with var_resizing
+
2301  o << INDENT2 << "static const char* function__ = \""
+
2302  << model_name << "_namespace::" << model_name << "(%1%)\";" << EOL;
+
2303  suppress_warning(INDENT2, "function__", o);
+
2304  o << INDENT2 << "size_t pos__;" << EOL;
+
2305  suppress_warning(INDENT2, "pos__", o);
+
2306  o << INDENT2 << "std::vector<int> vals_i__;" << EOL;
+
2307  o << INDENT2 << "std::vector<double> vals_r__;" << EOL;
+
2308 
+ +
2310 
+
2311  o << EOL;
+
2312  generate_comment("validate data",2,o);
+ +
2314 
+ +
2316  o << EOL;
+
2317  bool include_sampling = false;
+
2318  bool is_var = false;
+
2319  for (size_t i = 0; i < prog.derived_data_decl_.second.size(); ++i)
+
2320  generate_statement(prog.derived_data_decl_.second[i],
+
2321  2,o,include_sampling,is_var);
+
2322 
+
2323  o << EOL;
+
2324  generate_comment("validate transformed data",2,o);
+ +
2326 
+
2327  o << EOL;
+
2328  generate_comment("set parameter ranges",2,o);
+ +
2330  // o << EOL << INDENT2 << "set_param_ranges();" << EOL;
+
2331 
+
2332  o << INDENT << "}" << EOL;
+
2333  }
+
2334 
+
2335  struct generate_init_visgen : public visgen {
+ +
2337  generate_init_visgen(std::ostream& o)
+
2338  : visgen(o),
+
2339  var_size_validator_(o,"initialization") {
+
2340  }
+
2341  void operator()(nil const& /*x*/) const { } // dummy
+
2342  void operator()(int_var_decl const& x) const {
+
2343  generate_check_int(x.name_,x.dims_.size());
+ +
2345  generate_declaration(x.name_,"int",x.dims_);
+
2346  generate_buffer_loop("i",x.name_, x.dims_);
+
2347  generate_write_loop("integer(",x.name_,x.dims_);
+
2348  }
+
2349  template <typename D>
+
2350  std::string function_args(const std::string& fun_prefix,
+
2351  const D& x) const {
+
2352  std::stringstream ss;
+
2353  ss << fun_prefix;
+
2354  if (has_lub(x)) {
+
2355  ss << "_lub_unconstrain(";
+
2356  generate_expression(x.range_.low_.expr_,ss);
+
2357  ss << ',';
+
2358  generate_expression(x.range_.high_.expr_,ss);
+
2359  ss << ',';
+
2360  } else if (has_lb(x)) {
+
2361  ss << "_lb_unconstrain(";
+
2362  generate_expression(x.range_.low_.expr_,ss);
+
2363  ss << ',';
+
2364  } else if (has_ub(x)) {
+
2365  ss << "_ub_unconstrain(";
+
2366  generate_expression(x.range_.high_.expr_,ss);
+
2367  ss << ',';
+
2368  } else {
+
2369  ss << "_unconstrain(";
+
2370  }
+
2371  return ss.str();
+
2372  }
+
2373 
+
2374  void operator()(double_var_decl const& x) const {
+
2375  generate_check_double(x.name_,x.dims_.size());
+ +
2377  generate_declaration(x.name_,"double",x.dims_);
+
2378  generate_buffer_loop("r",x.name_,x.dims_);
+
2379  generate_write_loop(function_args("scalar",x),
+
2380  x.name_, x.dims_);
+
2381  }
+
2382  void operator()(vector_var_decl const& x) const {
+
2383  generate_check_double(x.name_,x.dims_.size() + 1);
+ +
2385  generate_declaration(x.name_,"vector_d",x.dims_,x.M_);
+
2386  generate_buffer_loop("r",x.name_,x.dims_,x.M_);
+
2387  generate_write_loop(function_args("vector",x),
+
2388  x.name_,x.dims_);
+
2389  }
+
2390  void operator()(row_vector_var_decl const& x) const {
+
2391  generate_check_double(x.name_,x.dims_.size() + 1);
+ +
2393  generate_declaration(x.name_,"row_vector_d",x.dims_,x.N_);
+
2394  generate_buffer_loop("r",x.name_,x.dims_,x.N_);
+
2395  generate_write_loop(function_args("row_vector",x),
+
2396  x.name_,x.dims_);
+
2397  }
+
2398  void operator()(matrix_var_decl const& x) const {
+
2399  generate_check_double(x.name_,x.dims_.size() + 2);
+ +
2401  generate_declaration(x.name_,"matrix_d",x.dims_,x.M_,x.N_);
+
2402  generate_buffer_loop("r",x.name_,x.dims_,x.M_,x.N_);
+
2403  generate_write_loop(function_args("matrix",x),
+
2404  x.name_,x.dims_);
+
2405  }
+
2406  void operator()(unit_vector_var_decl const& x) const {
+
2407  generate_check_double(x.name_,x.dims_.size() + 1);
+ +
2409  generate_declaration(x.name_,"vector_d",x.dims_,x.K_);
+
2410  generate_buffer_loop("r",x.name_,x.dims_,x.K_);
+
2411  generate_write_loop("unit_vector_unconstrain(",x.name_,x.dims_);
+
2412  }
+
2413  void operator()(simplex_var_decl const& x) const {
+
2414  generate_check_double(x.name_,x.dims_.size() + 1);
+ +
2416  generate_declaration(x.name_,"vector_d",x.dims_,x.K_);
+
2417  generate_buffer_loop("r",x.name_,x.dims_,x.K_);
+
2418  generate_write_loop("simplex_unconstrain(",x.name_,x.dims_);
+
2419  }
+
2420  void operator()(ordered_var_decl const& x) const {
+
2421  generate_check_double(x.name_,x.dims_.size() + 1);
+ +
2423  generate_declaration(x.name_,"vector_d",x.dims_,x.K_);
+
2424  generate_buffer_loop("r",x.name_,x.dims_,x.K_);
+
2425  generate_write_loop("ordered_unconstrain(",x.name_,x.dims_);
+
2426  }
+
2427  void operator()(positive_ordered_var_decl const& x) const {
+
2428  generate_check_double(x.name_,x.dims_.size() + 1);
+ +
2430  generate_declaration(x.name_,"vector_d",x.dims_,x.K_);
+
2431  generate_buffer_loop("r",x.name_,x.dims_,x.K_);
+
2432  generate_write_loop("positive_ordered_unconstrain(",x.name_,x.dims_);
+
2433  }
+
2434  void operator()(cholesky_factor_var_decl const& x) const {
+
2435  generate_check_double(x.name_,x.dims_.size() + 2);
+ +
2437  generate_declaration(x.name_,"matrix_d",x.dims_,x.M_,x.N_);
+
2438  generate_buffer_loop("r",x.name_,x.dims_,x.M_,x.N_);
+
2439  generate_write_loop("cholesky_factor_unconstrain(",x.name_,x.dims_);
+
2440  }
+
2441  void operator()(cov_matrix_var_decl const& x) const {
+
2442  generate_check_double(x.name_,x.dims_.size() + 2);
+ +
2444  generate_declaration(x.name_,"matrix_d",x.dims_,x.K_,x.K_);
+
2445  generate_buffer_loop("r",x.name_,x.dims_,x.K_,x.K_);
+
2446  generate_write_loop("cov_matrix_unconstrain(",x.name_,x.dims_);
+
2447  }
+
2448  void operator()(corr_matrix_var_decl const& x) const {
+
2449  generate_check_double(x.name_,x.dims_.size() + 2);
+ +
2451  generate_declaration(x.name_,"matrix_d",x.dims_,x.K_,x.K_);
+
2452  generate_buffer_loop("r",x.name_,x.dims_,x.K_,x.K_);
+
2453  generate_write_loop("corr_matrix_unconstrain(",x.name_,x.dims_);
+
2454  }
+
2455  void generate_write_loop(const std::string& write_method_name,
+
2456  const std::string& var_name,
+
2457  const std::vector<expression>& dims) const {
+
2458  generate_dims_loop_fwd(dims);
+
2459  o_ << "try { writer__." << write_method_name;
+
2460  generate_name_dims(var_name,dims.size());
+
2461  o_ << "); } catch (std::exception& e) { "
+
2462  " throw std::runtime_error(std::string(\"Error transforming variable "
+
2463  << var_name << ": \") + e.what()); }" << EOL;
+
2464  }
+
2465  void generate_name_dims(const std::string name,
+
2466  size_t num_dims) const {
+
2467  o_ << name;
+
2468  for (size_t i = 0; i < num_dims; ++i)
+
2469  o_ << "[i" << i << "__]";
+
2470  }
+
2471  void generate_declaration(const std::string& name,
+
2472  const std::string& base_type,
+
2473  const std::vector<expression>& dims,
+
2474  const expression& type_arg1 = expression(),
+
2475  const expression& type_arg2 = expression()) const {
+
2476  o_ << INDENT2;
+
2477  generate_type(base_type,dims,dims.size(),o_);
+
2478  o_ << ' ' << name;
+
2479 
+
2480  generate_initializer(o_,base_type,dims,type_arg1,type_arg2);
+
2481  }
+
2482  void generate_indent_num_dims(size_t base_indent,
+
2483  const std::vector<expression>& dims,
+
2484  const expression& dim1,
+
2485  const expression& dim2) const {
+
2486  generate_indent(dims.size() + base_indent,o_);
+
2487  if (!is_nil(dim1)) o_ << INDENT;
+
2488  if (!is_nil(dim2)) o_ << INDENT;
+
2489  }
+
2490  void generate_buffer_loop(const std::string& base_type,
+
2491  const std::string& name,
+
2492  const std::vector<expression>& dims,
+
2493  const expression& dim1 = expression(),
+
2494  const expression& dim2 = expression(),
+
2495  int indent = 2U) const {
+
2496  size_t size = dims.size();
+
2497  bool is_matrix = !is_nil(dim1) && !is_nil(dim2);
+
2498  bool is_vector = !is_nil(dim1) && is_nil(dim2);
+
2499  int extra_indent = is_matrix ? 2U : is_vector ? 1U : 0U;
+
2500  if (is_matrix) {
+
2501  generate_indent(indent,o_);
+
2502  o_ << "for (int j2__ = 0U; j2__ < ";
+
2503  generate_expression(dim2.expr_,o_);
+
2504  o_ << "; ++j2__)" << EOL;
+
2505 
+
2506  generate_indent(indent+1,o_);
+
2507  o_ << "for (int j1__ = 0U; j1__ < ";
+
2508  generate_expression(dim1.expr_,o_);
+
2509  o_ << "; ++j1__)" << EOL;
+
2510  } else if (is_vector) {
+
2511  generate_indent(indent,o_);
+
2512  o_ << "for (int j1__ = 0U; j1__ < ";
+
2513  generate_expression(dim1.expr_,o_);
+
2514  o_ << "; ++j1__)" << EOL;
+
2515  }
+
2516  for (size_t i = 0; i < size; ++i) {
+
2517  size_t idx = size - i - 1;
+
2518  generate_indent(i + indent + extra_indent, o_);
+
2519  o_ << "for (int i" << idx << "__ = 0U; i" << idx << "__ < ";
+
2520  generate_expression(dims[idx].expr_,o_);
+
2521  o_ << "; ++i" << idx << "__)" << EOL;
+
2522  }
+
2523  generate_indent_num_dims(2U,dims,dim1,dim2);
+
2524  o_ << name;
+
2525  for (size_t i = 0; i < dims.size(); ++i)
+
2526  o_ << "[i" << i << "__]";
+
2527  if (is_matrix)
+
2528  o_ << "(j1__,j2__)";
+
2529  else if (is_vector)
+
2530  o_ << "(j1__)";
+
2531  o_ << " = vals_" << base_type << "__[pos__++];" << EOL;
+
2532  }
+
2533  void generate_dims_loop_fwd(const std::vector<expression>& dims,
+
2534  int indent = 2U) const {
+
2535  size_t size = dims.size();
+
2536  for (size_t i = 0; i < size; ++i) {
+
2537  generate_indent(i + indent, o_);
+
2538  o_ << "for (int i" << i << "__ = 0U; i" << i << "__ < ";
+
2539  generate_expression(dims[i].expr_,o_);
+
2540  o_ << "; ++i" << i << "__)" << EOL;
+
2541  }
+
2542  generate_indent(2U + dims.size(),o_);
+
2543  }
+
2544  void generate_check_int(const std::string& name, size_t /*n*/) const {
+
2545  o_ << EOL << INDENT2
+
2546  << "if (!(context__.contains_i(\"" << name << "\")))"
+
2547  << EOL << INDENT3
+
2548  << "throw std::runtime_error(\"variable " << name << " missing\");" << EOL;
+
2549  o_ << INDENT2 << "vals_i__ = context__.vals_i(\"" << name << "\");" << EOL;
+
2550  o_ << INDENT2 << "pos__ = 0U;" << EOL;
+
2551  }
+
2552  void generate_check_double(const std::string& name, size_t /*n*/) const {
+
2553  o_ << EOL << INDENT2
+
2554  << "if (!(context__.contains_r(\"" << name << "\")))"
+
2555  << EOL << INDENT3
+
2556  << "throw std::runtime_error(\"variable " << name << " missing\");" << EOL;
+
2557  o_ << INDENT2 << "vals_r__ = context__.vals_r(\"" << name << "\");" << EOL;
+
2558  o_ << INDENT2 << "pos__ = 0U;" << EOL;
+
2559  }
+
2560  };
+
2561 
+
2562 
+
2563  void generate_init_method(const std::vector<var_decl>& vs,
+
2564  std::ostream& o) {
+
2565  o << EOL;
+
2566  o << INDENT << "void transform_inits(const stan::io::var_context& context__," << EOL;
+
2567  o << INDENT << " std::vector<int>& params_i__," << EOL;
+
2568  o << INDENT << " std::vector<double>& params_r__) const {" << EOL;
+
2569  o << INDENT2 << "stan::io::writer<double> writer__(params_r__,params_i__);" << EOL;
+
2570  o << INDENT2 << "size_t pos__;" << EOL;
+
2571  o << INDENT2 << "(void) pos__; // dummy call to supress warning" << EOL;
+
2572  o << INDENT2 << "std::vector<double> vals_r__;" << EOL;
+
2573  o << INDENT2 << "std::vector<int> vals_i__;" << EOL;
+
2574  o << EOL;
+
2575  generate_init_visgen vis(o);
+
2576  for (size_t i = 0; i < vs.size(); ++i)
+
2577  boost::apply_visitor(vis, vs[i].decl_);
+
2578 
+
2579  o << INDENT2 << "params_r__ = writer__.data_r();" << EOL;
+
2580  o << INDENT2 << "params_i__ = writer__.data_i();" << EOL;
+
2581  o << INDENT << "}" << EOL2;
+
2582 
+
2583  o << INDENT << "void transform_inits(const stan::io::var_context& context," << EOL;
+
2584  o << INDENT << " Eigen::Matrix<double,Eigen::Dynamic,1>& params_r) const {" << EOL;
+
2585  o << INDENT << " std::vector<double> params_r_vec;" << EOL;
+
2586  o << INDENT << " std::vector<int> params_i_vec;" << EOL;
+
2587  o << INDENT << " transform_inits(context, params_i_vec, params_r_vec);" << EOL;
+
2588  o << INDENT << " params_r.resize(params_r_vec.size());" << EOL;
+
2589  o << INDENT << " for (int i = 0; i < params_r.size(); ++i)" << EOL;
+
2590  o << INDENT << " params_r(i) = params_r_vec[i];" << EOL;
+
2591  o << INDENT << "}" << EOL2;
+
2592  }
+
2593 
+
2594  // see write_csv_visgen for similar structure
+
2595  struct write_dims_visgen : public visgen {
+
2596  write_dims_visgen(std::ostream& o)
+
2597  : visgen(o) {
+
2598  }
+
2599  void operator()(const nil& /*x*/) const { }
+
2600  void operator()(const int_var_decl& x) const {
+ +
2602  }
+
2603  void operator()(const double_var_decl& x) const {
+ +
2605  }
+
2606  void operator()(const vector_var_decl& x) const {
+
2607  std::vector<expression> matrix_args;
+
2608  matrix_args.push_back(x.M_);
+
2609  generate_dims_array(matrix_args,x.dims_);
+
2610  }
+
2611  void operator()(const row_vector_var_decl& x) const {
+
2612  std::vector<expression> matrix_args;
+
2613  matrix_args.push_back(x.N_);
+
2614  generate_dims_array(matrix_args,x.dims_);
+
2615  }
+
2616  void operator()(const matrix_var_decl& x) const {
+
2617  std::vector<expression> matrix_args;
+
2618  matrix_args.push_back(x.M_);
+
2619  matrix_args.push_back(x.N_);
+
2620  generate_dims_array(matrix_args,x.dims_);
+
2621  }
+
2622  void operator()(const unit_vector_var_decl& x) const {
+
2623  std::vector<expression> matrix_args;
+
2624  matrix_args.push_back(x.K_);
+
2625  generate_dims_array(matrix_args,x.dims_);
+
2626  }
+
2627  void operator()(const simplex_var_decl& x) const {
+
2628  std::vector<expression> matrix_args;
+
2629  matrix_args.push_back(x.K_);
+
2630  generate_dims_array(matrix_args,x.dims_);
+
2631  }
+
2632  void operator()(const ordered_var_decl& x) const {
+
2633  std::vector<expression> matrix_args;
+
2634  matrix_args.push_back(x.K_);
+
2635  generate_dims_array(matrix_args,x.dims_);
+
2636  }
+
2637  void operator()(const positive_ordered_var_decl& x) const {
+
2638  std::vector<expression> matrix_args;
+
2639  matrix_args.push_back(x.K_);
+
2640  generate_dims_array(matrix_args,x.dims_);
+
2641  }
+
2642  void operator()(const cholesky_factor_var_decl& x) const {
+
2643  std::vector<expression> matrix_args;
+
2644  matrix_args.push_back(x.M_);
+
2645  matrix_args.push_back(x.N_);
+
2646  generate_dims_array(matrix_args,x.dims_);
+
2647  }
+
2648  void operator()(const cov_matrix_var_decl& x) const {
+
2649  std::vector<expression> matrix_args;
+
2650  matrix_args.push_back(x.K_);
+
2651  matrix_args.push_back(x.K_);
+
2652  generate_dims_array(matrix_args,x.dims_);
+
2653  }
+
2654  void operator()(const corr_matrix_var_decl& x) const {
+
2655  std::vector<expression> matrix_args;
+
2656  matrix_args.push_back(x.K_);
+
2657  matrix_args.push_back(x.K_);
+
2658  generate_dims_array(matrix_args,x.dims_);
+
2659  }
+
2660  void
+
2661  generate_dims_array(const std::vector<expression>& matrix_dims_exprs,
+
2662  const std::vector<expression>& array_dims_exprs)
+
2663  const {
+
2664 
+
2665  o_ << INDENT2 << "dims__.resize(0);" << EOL;
+
2666  for (size_t i = 0; i < array_dims_exprs.size(); ++i) {
+
2667  o_ << INDENT2 << "dims__.push_back(";
+
2668  generate_expression(array_dims_exprs[i].expr_, o_);
+
2669  o_ << ");" << EOL;
+
2670  }
+
2671  // cut and paste above with matrix_dims_exprs
+
2672  for (size_t i = 0; i < matrix_dims_exprs.size(); ++i) {
+
2673  o_ << INDENT2 << "dims__.push_back(";
+
2674  generate_expression(matrix_dims_exprs[i].expr_, o_);
+
2675  o_ << ");" << EOL;
+
2676  }
+
2677  o_ << INDENT2 << "dimss__.push_back(dims__);" << EOL;
+
2678  }
+
2679 
+
2680  };
+
2681 
+
2682  void generate_dims_method(const program& prog,
+
2683  std::ostream& o) {
+
2684  write_dims_visgen vis(o);
+
2685  o << EOL << INDENT
+
2686  << "void get_dims(std::vector<std::vector<size_t> >& dimss__) const {"
+
2687  << EOL;
+
2688 
+
2689  o << INDENT2 << "dimss__.resize(0);" << EOL;
+
2690  o << INDENT2 << "std::vector<size_t> dims__;" << EOL;
+
2691 
+
2692  // parameters
+
2693  for (size_t i = 0; i < prog.parameter_decl_.size(); ++i) {
+
2694  boost::apply_visitor(vis,prog.parameter_decl_[i].decl_);
+
2695  }
+
2696  // transformed parameters
+
2697  for (size_t i = 0; i < prog.derived_decl_.first.size(); ++i) {
+
2698  boost::apply_visitor(vis,prog.derived_decl_.first[i].decl_);
+
2699  }
+
2700  // generated quantities
+
2701  for (size_t i = 0; i < prog.generated_decl_.first.size(); ++i) {
+
2702  boost::apply_visitor(vis,prog.generated_decl_.first[i].decl_);
+
2703  }
+
2704  o << INDENT << "}" << EOL2;
+
2705  }
+
2706 
+
2707 
+
2708 
+
2709  // see write_csv_visgen for similar structure
+ +
2711  write_param_names_visgen(std::ostream& o)
+
2712  : visgen(o) {
+
2713  }
+
2714  void operator()(const nil& /*x*/) const { }
+
2715  void operator()(const int_var_decl& x) const {
+ +
2717  }
+
2718  void operator()(const double_var_decl& x) const {
+ +
2720  }
+
2721  void operator()(const vector_var_decl& x) const {
+ +
2723  }
+
2724  void operator()(const row_vector_var_decl& x) const {
+ +
2726  }
+
2727  void operator()(const matrix_var_decl& x) const {
+ +
2729  }
+
2730  void operator()(const unit_vector_var_decl& x) const {
+ +
2732  }
+
2733  void operator()(const simplex_var_decl& x) const {
+ +
2735  }
+
2736  void operator()(const ordered_var_decl& x) const {
+ +
2738  }
+
2739  void operator()(const positive_ordered_var_decl& x) const {
+ +
2741  }
+
2742  void operator()(const cholesky_factor_var_decl& x) const {
+ +
2744  }
+
2745  void operator()(const cov_matrix_var_decl& x) const {
+ +
2747  }
+
2748  void operator()(const corr_matrix_var_decl& x) const {
+ +
2750  }
+
2751  void
+
2752  generate_param_names(const std::string& name) const {
+
2753  o_ << INDENT2
+
2754  << "names__.push_back(\"" << name << "\");"
+
2755  << EOL;
+
2756  }
+
2757  };
+
2758 
+
2759 
+ +
2761  std::ostream& o) {
+
2762  write_param_names_visgen vis(o);
+
2763  o << EOL << INDENT
+
2764  << "void get_param_names(std::vector<std::string>& names__) const {"
+
2765  << EOL;
+
2766 
+
2767  o << INDENT2
+
2768  << "names__.resize(0);"
+
2769  << EOL;
+
2770 
+
2771  // parameters
+
2772  for (size_t i = 0; i < prog.parameter_decl_.size(); ++i) {
+
2773  boost::apply_visitor(vis,prog.parameter_decl_[i].decl_);
+
2774  }
+
2775  // transformed parameters
+
2776  for (size_t i = 0; i < prog.derived_decl_.first.size(); ++i) {
+
2777  boost::apply_visitor(vis,prog.derived_decl_.first[i].decl_);
+
2778  }
+
2779  // generated quantities
+
2780  for (size_t i = 0; i < prog.generated_decl_.first.size(); ++i) {
+
2781  boost::apply_visitor(vis,prog.generated_decl_.first[i].decl_);
+
2782  }
+
2783 
+
2784  o << INDENT << "}" << EOL2;
+
2785  }
+
2786 
+
2787 
+
2788 
+
2789  // see write_csv_visgen for similar structure
+ +
2791  write_csv_header_visgen(std::ostream& o)
+
2792  : visgen(o) {
+
2793  }
+
2794  void operator()(const nil& /*x*/) const { }
+
2795  void operator()(const int_var_decl& x) const {
+ +
2797  }
+
2798  void operator()(const double_var_decl& x) const {
+ +
2800  }
+
2801  void operator()(const vector_var_decl& x) const {
+
2802  std::vector<expression> matrix_args;
+
2803  matrix_args.push_back(x.M_);
+
2804  generate_csv_header_array(matrix_args,x.name_,x.dims_);
+
2805  }
+
2806  void operator()(const row_vector_var_decl& x) const {
+
2807  std::vector<expression> matrix_args;
+
2808  matrix_args.push_back(x.N_);
+
2809  generate_csv_header_array(matrix_args,x.name_,x.dims_);
+
2810  }
+
2811  void operator()(const matrix_var_decl& x) const {
+
2812  std::vector<expression> matrix_args;
+
2813  matrix_args.push_back(x.M_);
+
2814  matrix_args.push_back(x.N_);
+
2815  generate_csv_header_array(matrix_args,x.name_,x.dims_);
+
2816  }
+
2817  void operator()(const unit_vector_var_decl& x) const {
+
2818  std::vector<expression> matrix_args;
+
2819  matrix_args.push_back(x.K_);
+
2820  generate_csv_header_array(matrix_args,x.name_,x.dims_);
+
2821  }
+
2822  void operator()(const simplex_var_decl& x) const {
+
2823  std::vector<expression> matrix_args;
+
2824  matrix_args.push_back(x.K_);
+
2825  generate_csv_header_array(matrix_args,x.name_,x.dims_);
+
2826  }
+
2827  void operator()(const ordered_var_decl& x) const {
+
2828  std::vector<expression> matrix_args;
+
2829  matrix_args.push_back(x.K_);
+
2830  generate_csv_header_array(matrix_args,x.name_,x.dims_);
+
2831  }
+
2832  void operator()(const positive_ordered_var_decl& x) const {
+
2833  std::vector<expression> matrix_args;
+
2834  matrix_args.push_back(x.K_);
+
2835  generate_csv_header_array(matrix_args,x.name_,x.dims_);
+
2836  }
+
2837  void operator()(const cholesky_factor_var_decl& x) const {
+
2838  std::vector<expression> matrix_args;
+
2839  matrix_args.push_back(x.M_);
+
2840  matrix_args.push_back(x.N_);
+
2841  generate_csv_header_array(matrix_args,x.name_,x.dims_);
+
2842  }
+
2843  void operator()(const cov_matrix_var_decl& x) const {
+
2844  std::vector<expression> matrix_args;
+
2845  matrix_args.push_back(x.K_);
+
2846  matrix_args.push_back(x.K_);
+
2847  generate_csv_header_array(matrix_args,x.name_,x.dims_);
+
2848  }
+
2849  void operator()(const corr_matrix_var_decl& x) const {
+
2850  std::vector<expression> matrix_args;
+
2851  matrix_args.push_back(x.K_);
+
2852  matrix_args.push_back(x.K_);
+
2853  generate_csv_header_array(matrix_args,x.name_,x.dims_);
+
2854  }
+
2855  void
+
2856  generate_csv_header_array(const std::vector<expression>& matrix_dims,
+
2857  const std::string& name,
+
2858  const std::vector<expression>& dims) const {
+
2859 
+
2860  // begin for loop dims
+
2861  std::vector<expression> combo_dims(dims);
+
2862  for (size_t i = 0; i < matrix_dims.size(); ++i)
+
2863  combo_dims.push_back(matrix_dims[i]);
+
2864 
+
2865  for (size_t i = combo_dims.size(); i-- > 0; ) {
+
2866  generate_indent(1 + combo_dims.size() - i,o_);
+
2867  o_ << "for (int k_" << i << "__ = 1;"
+
2868  << " k_" << i << "__ <= ";
+
2869  generate_expression(combo_dims[i].expr_,o_);
+
2870  o_ << "; ++k_" << i << "__) {" << EOL; // begin (1)
+
2871  }
+
2872 
+
2873  // variable + indices
+
2874  generate_indent(2 + combo_dims.size(),o_);
+
2875  o_ << "writer__.comma();" << EOL; // only writes comma after first call
+
2876 
+
2877  generate_indent(2 + combo_dims.size(),o_);
+
2878  o_ << "o__ << \"" << name << '"';
+
2879  for (size_t i = 0; i < combo_dims.size(); ++i)
+
2880  o_ << " << '.' << k_" << i << "__";
+
2881  o_ << ';' << EOL;
+
2882 
+
2883  // end for loop dims
+
2884  for (size_t i = 0; i < combo_dims.size(); ++i) {
+
2885  generate_indent(1 + combo_dims.size() - i,o_);
+
2886  o_ << "}" << EOL; // end (1)
+
2887  }
+
2888  }
+
2889  // void
+
2890  // generate_csv_header_array(const std::vector<expression>& matrix_dims,
+
2891  // const std::string& name,
+
2892  // const std::vector<expression>& dims) const {
+
2893 
+
2894  // // begin for loop dims
+
2895  // std::vector<expression> combo_dims(dims);
+
2896  // for (size_t i = 0; i < matrix_dims.size(); ++i)
+
2897  // combo_dims.push_back(matrix_dims[i]);
+
2898 
+
2899  // for (size_t i = 0; i < combo_dims.size(); ++i) {
+
2900  // generate_indent(2 + i,o_);
+
2901  // o_ << "for (int k_" << i << "__ = 1;"
+
2902  // << " k_" << i << "__ <= ";
+
2903  // generate_expression(combo_dims[i].expr_,o_);
+
2904  // o_ << "; ++k_" << i << "__) {" << EOL; // begin (1)
+
2905  // }
+
2906 
+
2907  // // variable + indices
+
2908  // generate_indent(2 + combo_dims.size(),o_);
+
2909  // o_ << "writer__.comma();" << EOL; // only writes comma after first call
+
2910 
+
2911  // generate_indent(2 + combo_dims.size(),o_);
+
2912  // o_ << "o__ << \"" << name << '"';
+
2913  // for (size_t i = 0; i < combo_dims.size(); ++i)
+
2914  // o_ << " << '.' << k_" << i << "__";
+
2915  // o_ << ';' << EOL;
+
2916 
+
2917  // // end for loop dims
+
2918  // for (size_t i = 0; i < combo_dims.size(); ++i) {
+
2919  // generate_indent(1 + combo_dims.size() - i,o_);
+
2920  // o_ << "}" << EOL; // end (1)
+
2921  // }
+
2922  // }
+
2923  };
+
2924 
+
2925 
+ +
2927  std::ostream& o) {
+
2928  write_csv_header_visgen vis(o);
+
2929  o << EOL << INDENT << "void write_csv_header(std::ostream& o__) const {" << EOL;
+
2930  o << INDENT2 << "stan::io::csv_writer writer__(o__);" << EOL;
+
2931 
+
2932  // parameters
+
2933  for (size_t i = 0; i < prog.parameter_decl_.size(); ++i) {
+
2934  boost::apply_visitor(vis,prog.parameter_decl_[i].decl_);
+
2935  }
+
2936  // transformed parameters
+
2937  for (size_t i = 0; i < prog.derived_decl_.first.size(); ++i) {
+
2938  boost::apply_visitor(vis,prog.derived_decl_.first[i].decl_);
+
2939  }
+
2940  // generated quantities
+
2941  for (size_t i = 0; i < prog.generated_decl_.first.size(); ++i) {
+
2942  boost::apply_visitor(vis,prog.generated_decl_.first[i].decl_);
+
2943  }
+
2944  o << INDENT2 << "writer__.newline();" << EOL;
+
2945  o << INDENT << "}" << EOL2;
+
2946  }
+
2947 
+
2948  // see write_csv_visgen for similar structure
+ + +
2951  : visgen(o) {
+
2952  }
+
2953  void operator()(const nil& /*x*/) const { }
+
2954  void operator()(const int_var_decl& x) const {
+ +
2956  }
+
2957  void operator()(const double_var_decl& x) const {
+ +
2959  }
+
2960  void operator()(const vector_var_decl& x) const {
+
2961  std::vector<expression> matrix_args;
+
2962  matrix_args.push_back(x.M_);
+
2963  generate_param_names_array(matrix_args,x.name_,x.dims_);
+
2964  }
+
2965  void operator()(const row_vector_var_decl& x) const {
+
2966  std::vector<expression> matrix_args;
+
2967  matrix_args.push_back(x.N_);
+
2968  generate_param_names_array(matrix_args,x.name_,x.dims_);
+
2969  }
+
2970  void operator()(const matrix_var_decl& x) const {
+
2971  std::vector<expression> matrix_args;
+
2972  matrix_args.push_back(x.M_);
+
2973  matrix_args.push_back(x.N_);
+
2974  generate_param_names_array(matrix_args,x.name_,x.dims_);
+
2975  }
+
2976  void operator()(const unit_vector_var_decl& x) const {
+
2977  std::vector<expression> matrix_args;
+
2978  matrix_args.push_back(x.K_);
+
2979  generate_param_names_array(matrix_args,x.name_,x.dims_);
+
2980  }
+
2981  void operator()(const simplex_var_decl& x) const {
+
2982  std::vector<expression> matrix_args;
+
2983  matrix_args.push_back(x.K_);
+
2984  generate_param_names_array(matrix_args,x.name_,x.dims_);
+
2985  }
+
2986  void operator()(const ordered_var_decl& x) const {
+
2987  std::vector<expression> matrix_args;
+
2988  matrix_args.push_back(x.K_);
+
2989  generate_param_names_array(matrix_args,x.name_,x.dims_);
+
2990  }
+
2991  void operator()(const positive_ordered_var_decl& x) const {
+
2992  std::vector<expression> matrix_args;
+
2993  matrix_args.push_back(x.K_);
+
2994  generate_param_names_array(matrix_args,x.name_,x.dims_);
+
2995  }
+
2996  void operator()(const cholesky_factor_var_decl& x) const {
+
2997  std::vector<expression> matrix_args;
+
2998  matrix_args.push_back(x.M_);
+
2999  matrix_args.push_back(x.N_);
+
3000  generate_param_names_array(matrix_args,x.name_,x.dims_);
+
3001  }
+
3002  void operator()(const cov_matrix_var_decl& x) const {
+
3003  std::vector<expression> matrix_args;
+
3004  matrix_args.push_back(x.K_);
+
3005  matrix_args.push_back(x.K_);
+
3006  generate_param_names_array(matrix_args,x.name_,x.dims_);
+
3007  }
+
3008  void operator()(const corr_matrix_var_decl& x) const {
+
3009  std::vector<expression> matrix_args;
+
3010  matrix_args.push_back(x.K_);
+
3011  matrix_args.push_back(x.K_);
+
3012  generate_param_names_array(matrix_args,x.name_,x.dims_);
+
3013  }
+
3014  void
+
3015  generate_param_names_array(const std::vector<expression>& matrix_dims,
+
3016  const std::string& name,
+
3017  const std::vector<expression>& dims) const {
+
3018 
+
3019  // begin for loop dims
+
3020  std::vector<expression> combo_dims(dims);
+
3021  for (size_t i = 0; i < matrix_dims.size(); ++i)
+
3022  combo_dims.push_back(matrix_dims[i]);
+
3023 
+
3024  for (size_t i = combo_dims.size(); i-- > 0; ) {
+
3025  generate_indent(1 + combo_dims.size() - i,o_);
+
3026  o_ << "for (int k_" << i << "__ = 1;"
+
3027  << " k_" << i << "__ <= ";
+
3028  generate_expression(combo_dims[i].expr_,o_);
+
3029  o_ << "; ++k_" << i << "__) {" << EOL; // begin (1)
+
3030  }
+
3031 
+
3032  generate_indent(2 + combo_dims.size(),o_);
+
3033  o_ << "param_name_stream__.str(std::string());" << EOL;
+
3034 
+
3035  generate_indent(2 + combo_dims.size(),o_);
+
3036  o_ << "param_name_stream__ << \"" << name << '"';
+
3037 
+
3038  for (size_t i = 0; i < combo_dims.size(); ++i)
+
3039  o_ << " << '.' << k_" << i << "__";
+
3040  o_ << ';' << EOL;
+
3041 
+
3042  generate_indent(2 + combo_dims.size(),o_);
+
3043  o_ << "param_names__.push_back(param_name_stream__.str());" << EOL;
+
3044 
+
3045  // end for loop dims
+
3046  for (size_t i = 0; i < combo_dims.size(); ++i) {
+
3047  generate_indent(1 + combo_dims.size() - i,o_);
+
3048  o_ << "}" << EOL; // end (1)
+
3049  }
+
3050  }
+
3051 
+
3052  };
+
3053 
+
3054 
+ +
3056  std::ostream& o) {
+
3057  o << EOL << INDENT
+
3058  << "void constrained_param_names(std::vector<std::string>& param_names__,"
+
3059  << EOL << INDENT
+
3060  << " bool include_tparams__ = true,"
+
3061  << EOL << INDENT
+
3062  << " bool include_gqs__ = true) const {"
+
3063  << EOL << INDENT2
+
3064  << "std::stringstream param_name_stream__;" << EOL;
+
3065 
+ +
3067  // parameters
+
3068  for (size_t i = 0; i < prog.parameter_decl_.size(); ++i) {
+
3069  boost::apply_visitor(vis,prog.parameter_decl_[i].decl_);
+
3070  }
+
3071 
+
3072  o << EOL << INDENT2
+
3073  << "if (!include_gqs__ && !include_tparams__) return;"
+
3074  << EOL;
+
3075 
+
3076  // transformed parameters
+
3077  for (size_t i = 0; i < prog.derived_decl_.first.size(); ++i) {
+
3078  boost::apply_visitor(vis,prog.derived_decl_.first[i].decl_);
+
3079  }
+
3080 
+
3081  o << EOL << INDENT2
+
3082  << "if (!include_gqs__) return;"
+
3083  << EOL;
+
3084 
+
3085  // generated quantities
+
3086  for (size_t i = 0; i < prog.generated_decl_.first.size(); ++i) {
+
3087  boost::apply_visitor(vis,prog.generated_decl_.first[i].decl_);
+
3088  }
+
3089 
+
3090  o << INDENT << "}" << EOL2;
+
3091  }
+
3092 
+
3093  // see write_csv_visgen for similar structure
+ + +
3096  : visgen(o) {
+
3097  }
+
3098  void operator()(const nil& /*x*/) const { }
+
3099  void operator()(const int_var_decl& x) const {
+ +
3101  }
+
3102  void operator()(const double_var_decl& x) const {
+ +
3104  }
+
3105  void operator()(const vector_var_decl& x) const {
+
3106  std::vector<expression> matrix_args;
+
3107  matrix_args.push_back(x.M_);
+
3108  generate_param_names_array(matrix_args,x.name_,x.dims_);
+
3109  }
+
3110  void operator()(const row_vector_var_decl& x) const {
+
3111  std::vector<expression> matrix_args;
+
3112  matrix_args.push_back(x.N_);
+
3113  generate_param_names_array(matrix_args,x.name_,x.dims_);
+
3114  }
+
3115  void operator()(const matrix_var_decl& x) const {
+
3116  std::vector<expression> matrix_args;
+
3117  matrix_args.push_back(x.M_);
+
3118  matrix_args.push_back(x.N_);
+
3119  generate_param_names_array(matrix_args,x.name_,x.dims_);
+
3120  }
+
3121  void operator()(const unit_vector_var_decl& x) const {
+
3122  std::vector<expression> matrix_args;
+
3123  matrix_args.push_back(binary_op(x.K_,"-",int_literal(1)));
+
3124  generate_param_names_array(matrix_args,x.name_,x.dims_);
+
3125  }
+
3126  void operator()(const simplex_var_decl& x) const {
+
3127  std::vector<expression> matrix_args;
+
3128  matrix_args.push_back(binary_op(x.K_,"-",int_literal(1)));
+
3129  generate_param_names_array(matrix_args,x.name_,x.dims_);
+
3130  }
+
3131  void operator()(const ordered_var_decl& x) const {
+
3132  std::vector<expression> matrix_args;
+
3133  matrix_args.push_back(x.K_);
+
3134  generate_param_names_array(matrix_args,x.name_,x.dims_);
+
3135  }
+
3136  void operator()(const positive_ordered_var_decl& x) const {
+
3137  std::vector<expression> matrix_args;
+
3138  matrix_args.push_back(x.K_);
+
3139  generate_param_names_array(matrix_args,x.name_,x.dims_);
+
3140  }
+
3141  void operator()(const cholesky_factor_var_decl& x) const {
+
3142  // FIXME: cut-and-paste of cov_matrix
+
3143  std::vector<expression> matrix_args;
+
3144  // (N * (N + 1)) / 2 + (M - N) * N
+
3145  matrix_args.push_back(binary_op(binary_op(binary_op(x.N_,
+
3146  "*",
+
3147  binary_op(x.N_,
+
3148  "+",
+
3149  int_literal(1))),
+
3150  "/",
+
3151  int_literal(2)),
+
3152  "+",
+ +
3154  "-",
+
3155  x.N_),
+
3156  "*",
+
3157  x.N_)));
+
3158  generate_param_names_array(matrix_args,x.name_,x.dims_);
+
3159  }
+
3160  void operator()(const cov_matrix_var_decl& x) const {
+
3161  std::vector<expression> matrix_args;
+
3162  matrix_args.push_back(binary_op(x.K_,
+
3163  "+",
+ +
3165  "*",
+
3166  binary_op(x.K_,
+
3167  "-",
+
3168  int_literal(1))),
+
3169  "/",
+
3170  int_literal(2))));
+
3171  generate_param_names_array(matrix_args,x.name_,x.dims_);
+
3172  }
+
3173  void operator()(const corr_matrix_var_decl& x) const {
+
3174  std::vector<expression> matrix_args;
+
3175  matrix_args.push_back(binary_op(binary_op(x.K_,
+
3176  "*",
+
3177  binary_op(x.K_,
+
3178  "-",
+
3179  int_literal(1))),
+
3180  "/",
+
3181  int_literal(2)));
+
3182  generate_param_names_array(matrix_args,x.name_,x.dims_);
+
3183  }
+
3184  // FIXME: sharing instead of cut-and-paste from constrained
+
3185  void
+
3186  generate_param_names_array(const std::vector<expression>& matrix_dims,
+
3187  const std::string& name,
+
3188  const std::vector<expression>& dims) const {
+
3189 
+
3190  // begin for loop dims
+
3191  std::vector<expression> combo_dims(dims);
+
3192  for (size_t i = 0; i < matrix_dims.size(); ++i)
+
3193  combo_dims.push_back(matrix_dims[i]);
+
3194 
+
3195  for (size_t i = combo_dims.size(); i-- > 0; ) {
+
3196  generate_indent(1 + combo_dims.size() - i,o_);
+
3197  o_ << "for (int k_" << i << "__ = 1;"
+
3198  << " k_" << i << "__ <= ";
+
3199  generate_expression(combo_dims[i].expr_,o_);
+
3200  o_ << "; ++k_" << i << "__) {" << EOL; // begin (1)
+
3201  }
+
3202 
+
3203  generate_indent(2 + combo_dims.size(),o_);
+
3204  o_ << "param_name_stream__.str(std::string());" << EOL;
+
3205 
+
3206  generate_indent(2 + combo_dims.size(),o_);
+
3207  o_ << "param_name_stream__ << \"" << name << '"';
+
3208 
+
3209  for (size_t i = 0; i < combo_dims.size(); ++i)
+
3210  o_ << " << '.' << k_" << i << "__";
+
3211  o_ << ';' << EOL;
+
3212 
+
3213  generate_indent(2 + combo_dims.size(),o_);
+
3214  o_ << "param_names__.push_back(param_name_stream__.str());" << EOL;
+
3215 
+
3216  // end for loop dims
+
3217  for (size_t i = 0; i < combo_dims.size(); ++i) {
+
3218  generate_indent(1 + combo_dims.size() - i,o_);
+
3219  o_ << "}" << EOL; // end (1)
+
3220  }
+
3221  }
+
3222  };
+
3223 
+
3224 
+ +
3226  std::ostream& o) {
+
3227  o << EOL << INDENT
+
3228  << "void unconstrained_param_names(std::vector<std::string>& param_names__,"
+
3229  << EOL << INDENT
+
3230  << " bool include_tparams__ = true,"
+
3231  << EOL << INDENT
+
3232  << " bool include_gqs__ = true) const {"
+
3233  << EOL << INDENT2
+
3234  << "std::stringstream param_name_stream__;" << EOL;
+
3235 
+ +
3237  // parameters
+
3238  for (size_t i = 0; i < prog.parameter_decl_.size(); ++i) {
+
3239  boost::apply_visitor(vis,prog.parameter_decl_[i].decl_);
+
3240  }
+
3241 
+
3242  o << EOL << INDENT2
+
3243  << "if (!include_gqs__ && !include_tparams__) return;"
+
3244  << EOL;
+
3245 
+
3246  // transformed parameters
+
3247  for (size_t i = 0; i < prog.derived_decl_.first.size(); ++i) {
+
3248  boost::apply_visitor(vis,prog.derived_decl_.first[i].decl_);
+
3249  }
+
3250 
+
3251  o << EOL << INDENT2
+
3252  << "if (!include_gqs__) return;"
+
3253  << EOL;
+
3254 
+
3255  // generated quantities
+
3256  for (size_t i = 0; i < prog.generated_decl_.first.size(); ++i) {
+
3257  boost::apply_visitor(vis,prog.generated_decl_.first[i].decl_);
+
3258  }
+
3259 
+
3260  o << INDENT << "}" << EOL2;
+
3261  }
+
3262 
+
3263 
+
3264  // see init_member_var_visgen for cut & paste
+
3265  struct write_csv_visgen : public visgen {
+
3266  write_csv_visgen(std::ostream& o)
+
3267  : visgen(o) {
+
3268  }
+
3269  template <typename D>
+
3270  void generate_initialize_array_bounded(const D& x, const std::string& base_type,
+
3271  const std::string& read_fun_prefix,
+
3272  const std::vector<expression>& dim_args) const {
+
3273  std::vector<expression> read_args;
+
3274  std::string read_fun(read_fun_prefix);
+
3275  if (has_lub(x)) {
+
3276  read_fun += "_lub";
+
3277  read_args.push_back(x.range_.low_);
+
3278  read_args.push_back(x.range_.high_);
+
3279  } else if (has_lb(x)) {
+
3280  read_fun += "_lb";
+
3281  read_args.push_back(x.range_.low_);
+
3282  } else if (has_ub(x)) {
+
3283  read_fun += "_ub";
+
3284  read_args.push_back(x.range_.high_);
+
3285  }
+
3286  for (size_t i = 0; i < dim_args.size(); ++i)
+
3287  read_args.push_back(dim_args[i]);
+
3288  generate_initialize_array(base_type,read_fun,read_args,x.name_,x.dims_);
+
3289  }
+
3290  void operator()(const nil& /*x*/) const { }
+
3291  void operator()(const int_var_decl& x) const {
+ +
3293  x.name_,x.dims_);
+
3294  }
+
3295  void operator()(const double_var_decl& x) const {
+
3296  std::vector<expression> read_args;
+
3297  generate_initialize_array_bounded(x,"double","scalar",read_args);
+
3298  }
+
3299  void operator()(const vector_var_decl& x) const {
+
3300  std::vector<expression> read_args;
+
3301  read_args.push_back(x.M_);
+
3302  generate_initialize_array_bounded(x,"vector_d","vector",read_args);
+
3303  }
+
3304  void operator()(const row_vector_var_decl& x) const {
+
3305  std::vector<expression> read_args;
+
3306  read_args.push_back(x.N_);
+
3307  generate_initialize_array_bounded(x,"row_vector_d","row_vector",read_args);
+
3308  }
+
3309  void operator()(const matrix_var_decl& x) const {
+
3310  std::vector<expression> read_args;
+
3311  read_args.push_back(x.M_);
+
3312  read_args.push_back(x.N_);
+
3313  generate_initialize_array_bounded(x,"matrix_d","matrix",read_args);
+
3314  }
+
3315  void operator()(const unit_vector_var_decl& x) const {
+
3316  std::vector<expression> read_args;
+
3317  read_args.push_back(x.K_);
+
3318  generate_initialize_array("vector_d","unit_vector",read_args,x.name_,x.dims_);
+
3319  }
+
3320  void operator()(const simplex_var_decl& x) const {
+
3321  std::vector<expression> read_args;
+
3322  read_args.push_back(x.K_);
+
3323  generate_initialize_array("vector_d","simplex",read_args,x.name_,x.dims_);
+
3324  }
+
3325  void operator()(const ordered_var_decl& x) const {
+
3326  std::vector<expression> read_args;
+
3327  read_args.push_back(x.K_);
+
3328  generate_initialize_array("vector_d","ordered",read_args,x.name_,x.dims_);
+
3329  }
+
3330  void operator()(const positive_ordered_var_decl& x) const {
+
3331  std::vector<expression> read_args;
+
3332  read_args.push_back(x.K_);
+
3333  generate_initialize_array("vector_d","positive_ordered",read_args,x.name_,x.dims_);
+
3334  }
+
3335  void operator()(const cholesky_factor_var_decl& x) const {
+
3336  std::vector<expression> read_args;
+
3337  read_args.push_back(x.M_);
+
3338  read_args.push_back(x.N_);
+
3339  generate_initialize_array("matrix_d","cholesky_factor",read_args,x.name_,x.dims_);
+
3340  }
+
3341  void operator()(const cov_matrix_var_decl& x) const {
+
3342  std::vector<expression> read_args;
+
3343  read_args.push_back(x.K_);
+
3344  generate_initialize_array("matrix_d","cov_matrix",read_args,x.name_,x.dims_);
+
3345  }
+
3346  void operator()(const corr_matrix_var_decl& x) const {
+
3347  std::vector<expression> read_args;
+
3348  read_args.push_back(x.K_);
+
3349  generate_initialize_array("matrix_d","corr_matrix",read_args,x.name_,x.dims_);
+
3350  }
+
3351  void generate_initialize_array(const std::string& var_type,
+
3352  const std::string& read_type,
+
3353  const std::vector<expression>& read_args,
+
3354  const std::string& name,
+
3355  const std::vector<expression>& dims) const {
+
3356  if (dims.size() == 0) {
+
3357  generate_indent(2,o_);
+
3358  o_ << var_type << " ";
+
3359  o_ << name << " = in__." << read_type << "_constrain(";
+
3360  for (size_t j = 0; j < read_args.size(); ++j) {
+
3361  if (j > 0) o_ << ",";
+
3362  generate_expression(read_args[j],o_);
+
3363  }
+
3364  o_ << ");" << EOL;
+
3365  o_ << INDENT2 << "writer__.write(" << name << ");" << EOL;
+
3366  return;
+
3367  }
+
3368  o_ << INDENT2;
+
3369  for (size_t i = 0; i < dims.size(); ++i) o_ << "vector<";
+
3370  o_ << var_type;
+
3371  for (size_t i = 0; i < dims.size(); ++i) o_ << "> ";
+
3372  o_ << name << ";" << EOL;
+
3373  std::string name_dims(name);
+
3374  for (size_t i = 0; i < dims.size(); ++i) {
+
3375  generate_indent(i + 2, o_);
+
3376  o_ << "size_t dim_" << name << "_" << i << "__ = ";
+
3377  generate_expression(dims[i],o_);
+
3378  o_ << ";" << EOL;
+
3379  if (i < dims.size() - 1) {
+
3380  generate_indent(i + 2, o_);
+
3381  o_ << name_dims << ".resize(dim_" << name << "_" << i << "__);"
+
3382  << EOL;
+
3383  name_dims.append("[k_").append(to_string(i)).append("__]");
+
3384  }
+
3385  generate_indent(i + 2, o_);
+
3386  o_ << "for (size_t k_" << i << "__ = 0;"
+
3387  << " k_" << i << "__ < dim_" << name << "_" << i << "__;"
+
3388  << " ++k_" << i << "__) {" << EOL;
+
3389  if (i == dims.size() - 1) {
+
3390  generate_indent(i + 3, o_);
+
3391  o_ << name_dims << ".push_back(in__." << read_type << "_constrain(";
+
3392  for (size_t j = 0; j < read_args.size(); ++j) {
+
3393  if (j > 0) o_ << ",";
+
3394  generate_expression(read_args[j],o_);
+
3395  }
+
3396  o_ << "));" << EOL;
+
3397  }
+
3398  }
+
3399  generate_indent(dims.size() + 2, o_);
+
3400  o_ << "writer__.write(" << name;
+
3401  if (dims.size() > 0) {
+
3402  o_ << '[';
+
3403  for (size_t i = 0; i < dims.size(); ++i) {
+
3404  if (i > 0) o_ << "][";
+
3405  o_ << "k_" << i << "__";
+
3406  }
+
3407  o_ << ']';
+
3408  }
+
3409  o_ << ");" << EOL;
+
3410 
+
3411  for (size_t i = dims.size(); i > 0; --i) {
+
3412  generate_indent(i + 1, o_);
+
3413  o_ << "}" << EOL;
+
3414  }
+
3415  }
+
3416  };
+
3417 
+
3418 
+
3419 
+
3420 
+
3421  struct write_csv_vars_visgen : public visgen {
+
3422  write_csv_vars_visgen(std::ostream& o)
+
3423  : visgen(o) {
+
3424  }
+
3425  void operator()(const nil& /*x*/) const { }
+
3426  // FIXME: template these out
+
3427  void operator()(const int_var_decl& x) const {
+
3428  write_array(x.name_,x.dims_);
+
3429  }
+
3430  void operator()(const double_var_decl& x) const {
+
3431  write_array(x.name_,x.dims_);
+
3432  }
+
3433  void operator()(const vector_var_decl& x) const {
+
3434  write_array(x.name_,x.dims_);
+
3435  }
+
3436  void operator()(const row_vector_var_decl& x) const {
+
3437  write_array(x.name_,x.dims_);
+
3438  }
+
3439  void operator()(const matrix_var_decl& x) const {
+
3440  write_array(x.name_,x.dims_);
+
3441  }
+
3442  void operator()(const unit_vector_var_decl& x) const {
+
3443  write_array(x.name_,x.dims_);
+
3444  }
+
3445  void operator()(const simplex_var_decl& x) const {
+
3446  write_array(x.name_,x.dims_);
+
3447  }
+
3448  void operator()(const ordered_var_decl& x) const {
+
3449  write_array(x.name_,x.dims_);
+
3450  }
+
3451  void operator()(const positive_ordered_var_decl& x) const {
+
3452  write_array(x.name_,x.dims_);
+
3453  }
+
3454  void operator()(const cholesky_factor_var_decl& x) const {
+
3455  write_array(x.name_,x.dims_);
+
3456  }
+
3457  void operator()(const cov_matrix_var_decl& x) const {
+
3458  write_array(x.name_,x.dims_);
+
3459  }
+
3460  void operator()(const corr_matrix_var_decl& x) const {
+
3461  write_array(x.name_,x.dims_);
+
3462  }
+
3463  void write_array(const std::string& name,
+
3464  const std::vector<expression>& dims) const {
+
3465  if (dims.size() == 0) {
+
3466  o_ << INDENT2 << "writer__.write(" << name << ");" << EOL;
+
3467  return;
+
3468  }
+
3469  for (size_t i = 0; i < dims.size(); ++i) {
+
3470  generate_indent(i + 2, o_);
+
3471  o_ << "for (int k_" << i << "__ = 0;"
+
3472  << " k_" << i << "__ < ";
+
3473  generate_expression(dims[i],o_);
+
3474  o_ << "; ++k_" << i << "__) {" << EOL;
+
3475  }
+
3476 
+
3477  generate_indent(dims.size() + 2, o_);
+
3478  o_ << "writer__.write(" << name;
+
3479  if (dims.size() > 0) {
+
3480  o_ << '[';
+
3481  for (size_t i = 0; i < dims.size(); ++i) {
+
3482  if (i > 0) o_ << "][";
+
3483  o_ << "k_" << i << "__";
+
3484  }
+
3485  o_ << ']';
+
3486  }
+
3487  o_ << ");" << EOL;
+
3488 
+
3489  for (size_t i = dims.size(); i > 0; --i) {
+
3490  generate_indent(i + 1, o_);
+
3491  o_ << "}" << EOL;
+
3492  }
+
3493  }
+
3494  };
+
3495 
+
3496 
+ +
3498  const std::string& model_name,
+
3499  std::ostream& o) {
+
3500  o << INDENT << "template <typename RNG>" << EOL;
+
3501  o << INDENT << "void write_csv(RNG& base_rng__," << EOL;
+
3502  o << INDENT << " std::vector<double>& params_r__," << EOL;
+
3503  o << INDENT << " std::vector<int>& params_i__," << EOL;
+
3504  o << INDENT << " std::ostream& o__," << EOL;
+
3505  o << INDENT << " std::ostream* pstream__ = 0) const {" << EOL;
+
3506  o << INDENT2 << "stan::io::reader<double> in__(params_r__,params_i__);"
+
3507  << EOL;
+
3508  o << INDENT2 << "stan::io::csv_writer writer__(o__);" << EOL;
+
3509  o << INDENT2 << "static const char* function__ = \""
+
3510  << model_name << "_namespace::write_csv(%1%)\";" << EOL;
+
3511  suppress_warning(INDENT2, "function__", o);
+
3512 
+
3513  // declares, reads, and writes parameters
+
3514  generate_comment("read-transform, write parameters",2,o);
+
3515  write_csv_visgen vis(o);
+
3516  for (size_t i = 0; i < prog.parameter_decl_.size(); ++i)
+
3517  boost::apply_visitor(vis,prog.parameter_decl_[i].decl_);
+
3518 
+
3519  // this is for all other values
+
3520  write_csv_vars_visgen vis_writer(o);
+
3521 
+
3522  // parameters are guaranteed to satisfy constraints
+
3523 
+
3524  o << EOL;
+
3525  generate_comment("declare, define and validate transformed parameters",
+
3526  2,o);
+
3527  o << INDENT2 << "double lp__ = 0.0;" << EOL;
+
3528  suppress_warning(INDENT2, "lp__", o);
+
3529  o << INDENT2 << "stan::math::accumulator<double> lp_accum__;" << EOL2;
+
3530  bool is_var = false;
+
3531  generate_local_var_decls(prog.derived_decl_.first,2,o,is_var);
+
3532  o << EOL;
+
3533  bool include_sampling = false;
+
3534  generate_statements(prog.derived_decl_.second,2,o,include_sampling,is_var);
+
3535  o << EOL;
+
3536 
+ +
3538  o << EOL;
+
3539 
+
3540  generate_comment("write transformed parameters",2,o);
+
3541  for (size_t i = 0; i < prog.derived_decl_.first.size(); ++i)
+
3542  boost::apply_visitor(vis_writer, prog.derived_decl_.first[i].decl_);
+
3543  o << EOL;
+
3544 
+
3545  generate_comment("declare and define generated quantities",2,o);
+
3546  generate_local_var_decls(prog.generated_decl_.first,2,o,is_var);
+
3547  o << EOL;
+
3548  generate_statements(prog.generated_decl_.second,2,o,include_sampling,is_var);
+
3549  o << EOL;
+
3550 
+
3551  generate_comment("validate generated quantities",2,o);
+ +
3553  o << EOL;
+
3554 
+
3555  generate_comment("write generated quantities",2,o);
+
3556  for (size_t i = 0; i < prog.generated_decl_.first.size(); ++i)
+
3557  boost::apply_visitor(vis_writer, prog.generated_decl_.first[i].decl_);
+
3558  if (prog.generated_decl_.first.size() > 0)
+
3559  o << EOL;
+
3560 
+
3561  o << INDENT2 << "writer__.newline();" << EOL;
+
3562  o << INDENT << "}" << EOL2;
+
3563 
+
3564  o << INDENT << "template <typename RNG>" << EOL;
+
3565  o << INDENT << "void write_csv(RNG& base_rng," << EOL;
+
3566  o << INDENT << " Eigen::Matrix<double,Eigen::Dynamic,1>& params_r," << EOL;
+
3567  o << INDENT << " std::ostream& o," << EOL;
+
3568  o << INDENT << " std::ostream* pstream = 0) const {" << EOL;
+
3569  o << INDENT << " std::vector<double> params_r_vec(params_r.size());" << EOL;
+
3570  o << INDENT << " for (int i = 0; i < params_r.size(); ++i)" << EOL;
+
3571  o << INDENT << " params_r_vec[i] = params_r(i);" << EOL;
+
3572  o << INDENT << " std::vector<int> params_i_vec; // dummy" << EOL;
+
3573  o << INDENT << " write_csv(base_rng, params_r_vec, params_i_vec, o, pstream);" << EOL;
+
3574  o << INDENT << "}" << EOL2;
+
3575  }
+
3576 
+
3577 
+
3578  // see init_member_var_visgen for cut & paste
+
3579  struct write_array_visgen : public visgen {
+
3580  write_array_visgen(std::ostream& o)
+
3581  : visgen(o) {
+
3582  }
+
3583  void operator()(const nil& /*x*/) const { }
+
3584  void operator()(const int_var_decl& x) const {
+ +
3586  x.name_,x.dims_);
+
3587  }
+
3588  // fixme -- reuse cut-and-pasted from other lub reader case
+
3589  template <typename D>
+
3590  void generate_initialize_array_bounded(const D& x, const std::string& base_type,
+
3591  const std::string& read_fun_prefix,
+
3592  const std::vector<expression>& dim_args) const {
+
3593  std::vector<expression> read_args;
+
3594  std::string read_fun(read_fun_prefix);
+
3595  if (has_lub(x)) {
+
3596  read_fun += "_lub";
+
3597  read_args.push_back(x.range_.low_);
+
3598  read_args.push_back(x.range_.high_);
+
3599  } else if (has_lb(x)) {
+
3600  read_fun += "_lb";
+
3601  read_args.push_back(x.range_.low_);
+
3602  } else if (has_ub(x)) {
+
3603  read_fun += "_ub";
+
3604  read_args.push_back(x.range_.high_);
+
3605  }
+
3606  for (size_t i = 0; i < dim_args.size(); ++i)
+
3607  read_args.push_back(dim_args[i]);
+
3608  generate_initialize_array(base_type,read_fun,read_args,x.name_,x.dims_);
+
3609  }
+
3610 
+
3611  void operator()(const double_var_decl& x) const {
+
3612  std::vector<expression> read_args;
+
3613  generate_initialize_array_bounded(x,"double","scalar",read_args);
+
3614  }
+
3615  void operator()(const vector_var_decl& x) const {
+
3616  std::vector<expression> read_args;
+
3617  read_args.push_back(x.M_);
+
3618  generate_initialize_array_bounded(x,"vector_d","vector",read_args);
+
3619  }
+
3620  void operator()(const row_vector_var_decl& x) const {
+
3621  std::vector<expression> read_args;
+
3622  read_args.push_back(x.N_);
+
3623  generate_initialize_array_bounded(x,"row_vector_d","row_vector",read_args);
+
3624  }
+
3625  void operator()(const matrix_var_decl& x) const {
+
3626  std::vector<expression> read_args;
+
3627  read_args.push_back(x.M_);
+
3628  read_args.push_back(x.N_);
+
3629  generate_initialize_array_bounded(x,"matrix_d","matrix",read_args);
+
3630  }
+
3631  void operator()(const unit_vector_var_decl& x) const {
+
3632  std::vector<expression> read_args;
+
3633  read_args.push_back(x.K_);
+
3634  generate_initialize_array("vector_d","unit_vector",read_args,x.name_,x.dims_);
+
3635  }
+
3636  void operator()(const simplex_var_decl& x) const {
+
3637  std::vector<expression> read_args;
+
3638  read_args.push_back(x.K_);
+
3639  generate_initialize_array("vector_d","simplex",read_args,x.name_,x.dims_);
+
3640  }
+
3641  void operator()(const ordered_var_decl& x) const {
+
3642  std::vector<expression> read_args;
+
3643  read_args.push_back(x.K_);
+
3644  generate_initialize_array("vector_d","ordered",read_args,x.name_,x.dims_);
+
3645  }
+
3646  void operator()(const positive_ordered_var_decl& x) const {
+
3647  std::vector<expression> read_args;
+
3648  read_args.push_back(x.K_);
+
3649  generate_initialize_array("vector_d","positive_ordered",read_args,x.name_,x.dims_);
+
3650  }
+
3651  void operator()(const cholesky_factor_var_decl& x) const {
+
3652  std::vector<expression> read_args;
+
3653  read_args.push_back(x.M_);
+
3654  read_args.push_back(x.N_);
+
3655  generate_initialize_array("matrix_d","cholesky_factor",read_args,x.name_,x.dims_);
+
3656  }
+
3657  void operator()(const cov_matrix_var_decl& x) const {
+
3658  std::vector<expression> read_args;
+
3659  read_args.push_back(x.K_);
+
3660  generate_initialize_array("matrix_d","cov_matrix",read_args,x.name_,x.dims_);
+
3661  }
+
3662  void operator()(const corr_matrix_var_decl& x) const {
+
3663  std::vector<expression> read_args;
+
3664  read_args.push_back(x.K_);
+
3665  generate_initialize_array("matrix_d","corr_matrix",read_args,x.name_,x.dims_);
+
3666  }
+
3667  void generate_initialize_array(const std::string& var_type,
+
3668  const std::string& read_type,
+
3669  const std::vector<expression>& read_args,
+
3670  const std::string& name,
+
3671  const std::vector<expression>& dims) const {
+
3672  if (dims.size() == 0) {
+
3673  generate_indent(2,o_);
+
3674  o_ << var_type << " ";
+
3675  o_ << name << " = in__." << read_type << "_constrain(";
+
3676  for (size_t j = 0; j < read_args.size(); ++j) {
+
3677  if (j > 0) o_ << ",";
+
3678  generate_expression(read_args[j],o_);
+
3679  }
+
3680  o_ << ");" << EOL;
+
3681  return;
+
3682  }
+
3683  o_ << INDENT2;
+
3684  for (size_t i = 0; i < dims.size(); ++i) o_ << "vector<";
+
3685  o_ << var_type;
+
3686  for (size_t i = 0; i < dims.size(); ++i) o_ << "> ";
+
3687  o_ << name << ";" << EOL;
+
3688  std::string name_dims(name);
+
3689  for (size_t i = 0; i < dims.size(); ++i) {
+
3690  generate_indent(i + 2, o_);
+
3691  o_ << "size_t dim_" << name << "_" << i << "__ = ";
+
3692  generate_expression(dims[i],o_);
+
3693  o_ << ";" << EOL;
+
3694  if (i < dims.size() - 1) {
+
3695  generate_indent(i + 2, o_);
+
3696  o_ << name_dims << ".resize(dim_" << name << "_" << i << "__);"
+
3697  << EOL;
+
3698  name_dims.append("[k_").append(to_string(i)).append("__]");
+
3699  }
+
3700  generate_indent(i + 2, o_);
+
3701  o_ << "for (size_t k_" << i << "__ = 0;"
+
3702  << " k_" << i << "__ < dim_" << name << "_" << i << "__;"
+
3703  << " ++k_" << i << "__) {" << EOL;
+
3704  if (i == dims.size() - 1) {
+
3705  generate_indent(i + 3, o_);
+
3706  o_ << name_dims << ".push_back(in__." << read_type << "_constrain(";
+
3707  for (size_t j = 0; j < read_args.size(); ++j) {
+
3708  if (j > 0) o_ << ",";
+
3709  generate_expression(read_args[j],o_);
+
3710  }
+
3711  o_ << "));" << EOL;
+
3712  }
+
3713  }
+
3714 
+
3715  for (size_t i = dims.size(); i > 0; --i) {
+
3716  generate_indent(i + 1, o_);
+
3717  o_ << "}" << EOL;
+
3718  }
+
3719 
+
3720 
+
3721  }
+
3722  };
+
3723 
+
3724 
+
3725 
+
3726 
+ +
3728  write_array_vars_visgen(std::ostream& o)
+
3729  : visgen(o) {
+
3730  }
+
3731  void operator()(const nil& /*x*/) const { }
+
3732  // FIXME: template these out
+
3733  void operator()(const int_var_decl& x) const {
+ +
3735  }
+
3736  void operator()(const double_var_decl& x) const {
+ +
3738  }
+
3739  void operator()(const vector_var_decl& x) const {
+
3740  std::vector<expression> dims(x.dims_);
+
3741  dims.push_back(x.M_);
+ +
3743  }
+
3744  void operator()(const row_vector_var_decl& x) const {
+
3745  std::vector<expression> dims(x.dims_);
+
3746  dims.push_back(x.N_);
+ +
3748  }
+
3749  void operator()(const matrix_var_decl& x) const {
+
3750  std::vector<expression> matdims;
+
3751  matdims.push_back(x.M_);
+
3752  matdims.push_back(x.N_);
+
3753  write_array(x.name_,x.dims_,matdims);
+
3754  }
+
3755  void operator()(const unit_vector_var_decl& x) const {
+
3756  std::vector<expression> dims(x.dims_);
+
3757  dims.push_back(x.K_);
+ +
3759  }
+
3760  void operator()(const simplex_var_decl& x) const {
+
3761  std::vector<expression> dims(x.dims_);
+
3762  dims.push_back(x.K_);
+ +
3764  }
+
3765  void operator()(const ordered_var_decl& x) const {
+
3766  std::vector<expression> dims(x.dims_);
+
3767  dims.push_back(x.K_);
+ +
3769  }
+
3770  void operator()(const positive_ordered_var_decl& x) const {
+
3771  std::vector<expression> dims(x.dims_);
+
3772  dims.push_back(x.K_);
+ +
3774  }
+
3775  void operator()(const cholesky_factor_var_decl& x) const {
+
3776  std::vector<expression> matdims;
+
3777  matdims.push_back(x.M_);
+
3778  matdims.push_back(x.N_);
+
3779  write_array(x.name_,x.dims_,matdims);
+
3780  }
+
3781  void operator()(const cov_matrix_var_decl& x) const {
+
3782  std::vector<expression> matdims;
+
3783  matdims.push_back(x.K_);
+
3784  matdims.push_back(x.K_);
+
3785  write_array(x.name_,x.dims_,matdims);
+
3786  }
+
3787  void operator()(const corr_matrix_var_decl& x) const {
+
3788  std::vector<expression> matdims;
+
3789  matdims.push_back(x.K_);
+
3790  matdims.push_back(x.K_);
+
3791  write_array(x.name_,x.dims_,matdims);
+
3792  }
+
3793  void write_array(const std::string& name,
+
3794  const std::vector<expression>& arraydims,
+
3795  const std::vector<expression>& matdims) const {
+
3796 
+
3797  std::vector<expression> dims(arraydims);
+
3798  for (size_t i = 0; i < matdims.size(); ++i)
+
3799  dims.push_back(matdims[i]);
+
3800 
+
3801  if (dims.size() == 0) {
+
3802  o_ << INDENT2 << "vars__.push_back(" << name << ");" << EOL;
+
3803  return;
+
3804  }
+
3805 
+
3806  // for (size_t i = 0; i < dims.size(); ++i) {
+
3807  for (size_t i = dims.size(); i > 0; ) {
+
3808  --i;
+
3809  generate_indent((dims.size() - i) + 1, o_);
+
3810  o_ << "for (int k_" << i << "__ = 0;"
+
3811  << " k_" << i << "__ < ";
+
3812  generate_expression(dims[i],o_);
+
3813  o_ << "; ++k_" << i << "__) {" << EOL;
+
3814  }
+
3815 
+
3816  generate_indent(dims.size() + 2, o_);
+
3817  o_ << "vars__.push_back(" << name;
+
3818  if (arraydims.size() > 0) {
+
3819  o_ << '[';
+
3820  for (size_t i = 0; i < arraydims.size(); ++i) {
+
3821  if (i > 0) o_ << "][";
+
3822  o_ << "k_" << i << "__";
+
3823  }
+
3824  o_ << ']';
+
3825  }
+
3826  if (matdims.size() > 0) {
+
3827  o_ << "(k_" << arraydims.size() << "__";
+
3828  if (matdims.size() > 1)
+
3829  o_ << ", k_" << (arraydims.size() + 1) << "__";
+
3830  o_ << ")";
+
3831  }
+
3832  o_ << ");" << EOL;
+
3833 
+
3834  for (size_t i = dims.size(); i > 0; --i) {
+
3835  generate_indent(i + 1, o_);
+
3836  o_ << "}" << EOL;
+
3837  }
+
3838  }
+
3839  };
+
3840 
+
3841 
+ +
3843  const std::string& model_name,
+
3844  std::ostream& o) {
+
3845  o << INDENT << "template <typename RNG>" << EOL;
+
3846  o << INDENT << "void write_array(RNG& base_rng__," << EOL;
+
3847  o << INDENT << " std::vector<double>& params_r__," << EOL;
+
3848  o << INDENT << " std::vector<int>& params_i__," << EOL;
+
3849  o << INDENT << " std::vector<double>& vars__," << EOL;
+
3850  o << INDENT << " bool include_tparams__ = true," << EOL;
+
3851  o << INDENT << " bool include_gqs__ = true," << EOL;
+
3852  o << INDENT << " std::ostream* pstream__ = 0) const {" << EOL;
+
3853  o << INDENT2 << "vars__.resize(0);" << EOL;
+
3854  o << INDENT2 << "stan::io::reader<double> in__(params_r__,params_i__);" << EOL;
+
3855  o << INDENT2 << "static const char* function__ = \""
+
3856  << model_name << "_namespace::write_array(%1%)\";" << EOL;
+
3857  suppress_warning(INDENT2, "function__", o);
+
3858 
+
3859  // declares, reads, and sets parameters
+
3860  generate_comment("read-transform, write parameters",2,o);
+
3861  write_array_visgen vis(o);
+
3862  for (size_t i = 0; i < prog.parameter_decl_.size(); ++i)
+
3863  boost::apply_visitor(vis,prog.parameter_decl_[i].decl_);
+
3864 
+
3865  // this is for all other values
+
3866  write_array_vars_visgen vis_writer(o);
+
3867 
+
3868  // writes parameters
+
3869  for (size_t i = 0; i < prog.parameter_decl_.size(); ++i)
+
3870  boost::apply_visitor(vis_writer,prog.parameter_decl_[i].decl_);
+
3871  o << EOL;
+
3872 
+
3873  o << INDENT2 << "if (!include_tparams__) return;"
+
3874  << EOL;
+
3875  generate_comment("declare and define transformed parameters",2,o);
+
3876  o << INDENT2 << "double lp__ = 0.0;" << EOL;
+
3877  suppress_warning(INDENT2, "lp__", o);
+
3878  o << INDENT2 << "stan::math::accumulator<double> lp_accum__;" << EOL2;
+
3879  bool is_var = false;
+
3880  generate_local_var_decls(prog.derived_decl_.first,2,o,is_var);
+
3881  o << EOL;
+
3882  bool include_sampling = false;
+
3883  generate_statements(prog.derived_decl_.second,2,o,include_sampling,is_var);
+
3884  o << EOL;
+
3885 
+
3886  generate_comment("validate transformed parameters",2,o);
+ +
3888  o << EOL;
+
3889 
+
3890  generate_comment("write transformed parameters",2,o);
+
3891  for (size_t i = 0; i < prog.derived_decl_.first.size(); ++i)
+
3892  boost::apply_visitor(vis_writer, prog.derived_decl_.first[i].decl_);
+
3893  o << EOL;
+
3894 
+
3895  o << INDENT2 << "if (!include_gqs__) return;"
+
3896  << EOL;
+
3897  generate_comment("declare and define generated quantities",2,o);
+
3898  generate_local_var_decls(prog.generated_decl_.first,2,o,is_var);
+
3899  o << EOL;
+
3900  generate_statements(prog.generated_decl_.second,2,o,include_sampling,is_var);
+
3901  o << EOL;
+
3902 
+
3903  generate_comment("validate generated quantities",2,o);
+ +
3905  o << EOL;
+
3906 
+
3907  generate_comment("write generated quantities",2,o);
+
3908  for (size_t i = 0; i < prog.generated_decl_.first.size(); ++i)
+
3909  boost::apply_visitor(vis_writer, prog.generated_decl_.first[i].decl_);
+
3910  if (prog.generated_decl_.first.size() > 0)
+
3911  o << EOL;
+
3912 
+
3913  o << INDENT << "}" << EOL2;
+
3914 
+
3915  o << INDENT << "template <typename RNG>" << EOL;
+
3916  o << INDENT << "void write_array(RNG& base_rng," << EOL;
+
3917  o << INDENT << " Eigen::Matrix<double,Eigen::Dynamic,1>& params_r," << EOL;
+
3918  o << INDENT << " Eigen::Matrix<double,Eigen::Dynamic,1>& vars," << EOL;
+
3919  o << INDENT << " bool include_tparams = true," << EOL;
+
3920  o << INDENT << " bool include_gqs = true," << EOL;
+
3921  o << INDENT << " std::ostream* pstream = 0) const {" << EOL;
+
3922  o << INDENT << " std::vector<double> params_r_vec(params_r.size());" << EOL;
+
3923  o << INDENT << " for (int i = 0; i < params_r.size(); ++i)" << EOL;
+
3924  o << INDENT << " params_r_vec[i] = params_r(i);" << EOL;
+
3925  o << INDENT << " std::vector<double> vars_vec;" << EOL;
+
3926  o << INDENT << " std::vector<int> params_i_vec;" << EOL;
+
3927  o << INDENT << " write_array(base_rng,params_r_vec,params_i_vec,vars_vec,include_tparams,include_gqs,pstream);" << EOL;
+
3928  o << INDENT << " vars.resize(vars_vec.size());" << EOL;
+
3929  o << INDENT << " for (int i = 0; i < vars.size(); ++i)" << EOL;
+
3930  o << INDENT << " vars(i) = vars_vec[i];" << EOL;
+
3931  o << INDENT << "}" << EOL2;
+
3932 
+
3933  }
+
3934 
+
3935 
+
3936  void generate_main(const std::string& model_name,
+
3937  std::ostream& out) {
+
3938  out << "int main(int argc, const char* argv[]) {" << EOL;
+
3939  out << INDENT << "try {" << EOL;
+
3940  out << INDENT2 << "return stan::gm::command<" << model_name
+
3941  << "_namespace::" << model_name << ">(argc,argv);" << EOL;
+
3942  out << INDENT << "} catch (std::exception& e) {" << EOL;
+
3943  out << INDENT2
+
3944  << "std::cerr << std::endl << \"Exception: \" << e.what() << std::endl;"
+
3945  << EOL;
+
3946  out << INDENT2
+
3947  << "std::cerr << \"Diagnostic information: \" << std::endl << boost::diagnostic_information(e) << std::endl;"
+
3948  << EOL;
+
3949  out << INDENT2 << "return -1;" << EOL;
+
3950  out << INDENT << "}" << EOL;
+
3951 
+
3952  out << "}" << EOL2;
+
3953  }
+
3954 
+
3955  void generate_model_name_method(const std::string& model_name,
+
3956  std::ostream& out) {
+
3957  out << INDENT << "static std::string model_name() {" << EOL
+
3958  << INDENT2 << "return \"" << model_name << "\";" << EOL
+
3959  << INDENT << "}" << EOL2;
+
3960  }
+
3961 
+
3962  void generate_cpp(const program& prog,
+
3963  const std::string& model_name,
+
3964  std::ostream& out,
+
3965  bool include_main = true) {
+ +
3967  generate_includes(out);
+
3968  generate_start_namespace(model_name,out);
+
3969  generate_usings(out);
+
3970  generate_typedefs(out);
+
3971  generate_class_decl(model_name,out);
+
3972  generate_private_decl(out);
+ + +
3975  generate_public_decl(out);
+
3976  generate_constructor(prog,model_name,out);
+
3977  generate_destructor(model_name,out);
+
3978  // generate_set_param_ranges(prog.parameter_decl_,out);
+ +
3980  generate_log_prob(prog,out);
+
3981  generate_param_names_method(prog,out);
+
3982  generate_dims_method(prog,out);
+
3983  generate_write_array_method(prog,model_name,out);
+ +
3985  generate_write_csv_method(prog,model_name,out);
+
3986  generate_model_name_method(model_name,out);
+ + + + +
3991  if (include_main)
+
3992  generate_main(model_name,out);
+
3993  }
+
3994 
+
3995  }
+
3996 
+
3997 }
+
3998 
+
3999 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/get__base1_8hpp.html b/doc/api/html/get__base1_8hpp.html new file mode 100644 index 00000000000..eeab6faac64 --- /dev/null +++ b/doc/api/html/get__base1_8hpp.html @@ -0,0 +1,177 @@ + + + + + +Stan: src/stan/math/matrix/get_base1.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
get_base1.hpp File Reference
+
+
+
#include <vector>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/check_range.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

template<typename T >
const T & stan::math::get_base1 (const std::vector< T > &x, size_t i, const char *error_msg, size_t idx)
 Return a reference to the value of the specified vector at the specified base-one index.
 
template<typename T >
const T & stan::math::get_base1 (const std::vector< std::vector< T > > &x, size_t i1, size_t i2, const char *error_msg, size_t idx)
 Return a reference to the value of the specified vector at the specified base-one indexes.
 
template<typename T >
const T & stan::math::get_base1 (const std::vector< std::vector< std::vector< T > > > &x, size_t i1, size_t i2, size_t i3, const char *error_msg, size_t idx)
 Return a reference to the value of the specified vector at the specified base-one indexes.
 
template<typename T >
const T & stan::math::get_base1 (const std::vector< std::vector< std::vector< std::vector< T > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, const char *error_msg, size_t idx)
 Return a reference to the value of the specified vector at the specified base-one indexes.
 
template<typename T >
const T & stan::math::get_base1 (const std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, size_t i5, const char *error_msg, size_t idx)
 Return a reference to the value of the specified vector at the specified base-one indexes.
 
template<typename T >
const T & stan::math::get_base1 (const std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, size_t i5, size_t i6, const char *error_msg, size_t idx)
 Return a reference to the value of the specified vector at the specified base-one indexes.
 
template<typename T >
const T & stan::math::get_base1 (const std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, size_t i5, size_t i6, size_t i7, const char *error_msg, size_t idx)
 Return a reference to the value of the specified vector at the specified base-one indexes.
 
template<typename T >
const T & stan::math::get_base1 (const std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, size_t i5, size_t i6, size_t i7, size_t i8, const char *error_msg, size_t idx)
 Return a reference to the value of the specified vector at the specified base-one indexes.
 
template<typename T >
Eigen::Matrix< T,
+1, Eigen::Dynamic > 
stan::math::get_base1 (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &x, size_t m, const char *error_msg, size_t idx)
 Return a copy of the row of the specified vector at the specified base-one row index.
 
template<typename T >
const T & stan::math::get_base1 (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &x, size_t m, size_t n, const char *error_msg, size_t idx)
 Return a reference to the value of the specified matrix at the specified base-one row and column indexes.
 
template<typename T >
const T & stan::math::get_base1 (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, size_t m, const char *error_msg, size_t idx)
 Return a reference to the value of the specified column vector at the specified base-one index.
 
template<typename T >
const T & stan::math::get_base1 (const Eigen::Matrix< T, 1, Eigen::Dynamic > &x, size_t n, const char *error_msg, size_t idx)
 Return a reference to the value of the specified row vector at the specified base-one index.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/get__base1_8hpp_source.html b/doc/api/html/get__base1_8hpp_source.html new file mode 100644 index 00000000000..56f0874e393 --- /dev/null +++ b/doc/api/html/get__base1_8hpp_source.html @@ -0,0 +1,274 @@ + + + + + +Stan: src/stan/math/matrix/get_base1.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
get_base1.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__GET_BASE1_HPP__
+
2 #define __STAN__MATH__MATRIX__GET_BASE1_HPP__
+
3 
+
4 #include <vector>
+ + +
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
25  template <typename T>
+
26  inline const T&
+
27  get_base1(const std::vector<T>& x,
+
28  size_t i,
+
29  const char* error_msg,
+
30  size_t idx) {
+
31  check_range(x.size(),i,error_msg,idx);
+
32  return x[i - 1];
+
33  }
+
34 
+
50  template <typename T>
+
51  inline const T&
+
52  get_base1(const std::vector<std::vector<T> >& x,
+
53  size_t i1,
+
54  size_t i2,
+
55  const char* error_msg,
+
56  size_t idx) {
+
57  check_range(x.size(),i1,error_msg,idx);
+
58  return get_base1(x[i1 - 1],i2,error_msg,idx+1);
+
59  }
+
60 
+
77  template <typename T>
+
78  inline const T&
+
79  get_base1(const std::vector<std::vector<std::vector<T> > >& x,
+
80  size_t i1,
+
81  size_t i2,
+
82  size_t i3,
+
83  const char* error_msg,
+
84  size_t idx) {
+
85  check_range(x.size(),i1,error_msg,idx);
+
86  return get_base1(x[i1 - 1],i2,i3,error_msg,idx+1);
+
87  }
+
88 
+
106  template <typename T>
+
107  inline const T&
+
108  get_base1(const std::vector<std::vector<std::vector<std::vector<T> > > >& x,
+
109  size_t i1,
+
110  size_t i2,
+
111  size_t i3,
+
112  size_t i4,
+
113  const char* error_msg,
+
114  size_t idx) {
+
115  check_range(x.size(),i1,error_msg,idx);
+
116  return get_base1(x[i1 - 1],i2,i3,i4,error_msg,idx+1);
+
117  }
+
118 
+
137  template <typename T>
+
138  inline const T&
+
139  get_base1(const std::vector<std::vector<std::vector<std::vector<std::vector<T> > > > >& x,
+
140  size_t i1,
+
141  size_t i2,
+
142  size_t i3,
+
143  size_t i4,
+
144  size_t i5,
+
145  const char* error_msg,
+
146  size_t idx) {
+
147  check_range(x.size(),i1,error_msg,idx);
+
148  return get_base1(x[i1 - 1],i2,i3,i4,i5,error_msg,idx+1);
+
149  }
+
150 
+
170  template <typename T>
+
171  inline const T&
+
172  get_base1(const std::vector<std::vector<std::vector<std::vector<std::vector<std::vector<T> > > > > >& x,
+
173  size_t i1,
+
174  size_t i2,
+
175  size_t i3,
+
176  size_t i4,
+
177  size_t i5,
+
178  size_t i6,
+
179  const char* error_msg,
+
180  size_t idx) {
+
181  check_range(x.size(),i1,error_msg,idx);
+
182  return get_base1(x[i1 - 1],i2,i3,i4,i5,i6,error_msg,idx+1);
+
183  }
+
184 
+
185 
+
206  template <typename T>
+
207  inline const T&
+
208  get_base1(const std::vector<std::vector<std::vector<std::vector<std::vector<std::vector<std::vector<T> > > > > > >& x,
+
209  size_t i1,
+
210  size_t i2,
+
211  size_t i3,
+
212  size_t i4,
+
213  size_t i5,
+
214  size_t i6,
+
215  size_t i7,
+
216  const char* error_msg,
+
217  size_t idx) {
+
218  check_range(x.size(),i1,error_msg,idx);
+
219  return get_base1(x[i1 - 1],i2,i3,i4,i5,i6,i7,error_msg,idx+1);
+
220  }
+
221 
+
222 
+
244  template <typename T>
+
245  inline const T&
+
246  get_base1(const std::vector<std::vector<std::vector<std::vector<std::vector<std::vector<std::vector<std::vector<T> > > > > > > >& x,
+
247  size_t i1,
+
248  size_t i2,
+
249  size_t i3,
+
250  size_t i4,
+
251  size_t i5,
+
252  size_t i6,
+
253  size_t i7,
+
254  size_t i8,
+
255  const char* error_msg,
+
256  size_t idx) {
+
257  check_range(x.size(),i1,error_msg,idx);
+
258  return get_base1(x[i1 - 1],i2,i3,i4,i5,i6,i7,i8,error_msg,idx+1);
+
259  }
+
260 
+
261 
+
262 
+
282  template <typename T>
+
283  inline Eigen::Matrix<T,1,Eigen::Dynamic>
+
284  get_base1(const Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& x,
+
285  size_t m,
+
286  const char* error_msg,
+
287  size_t idx) {
+
288  check_range(x.rows(),m,error_msg,idx);
+
289  return x.block(m-1,0,1,x.cols());
+
290  }
+
291 
+
308  template <typename T>
+
309  inline const T&
+
310  get_base1(const Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& x,
+
311  size_t m,
+
312  size_t n,
+
313  const char* error_msg,
+
314  size_t idx) {
+
315  check_range(x.rows(),m,error_msg,idx);
+
316  check_range(x.cols(),n,error_msg,idx + 1);
+
317  return x(m - 1, n - 1);
+
318  }
+
319 
+
334  template <typename T>
+
335  inline
+
336  const T& get_base1(const Eigen::Matrix<T,Eigen::Dynamic,1>& x,
+
337  size_t m,
+
338  const char* error_msg,
+
339  size_t idx) {
+
340  check_range(x.size(),m,error_msg,idx);
+
341  return x(m - 1);
+
342  }
+
343 
+
358  template <typename T>
+
359  inline const T&
+
360  get_base1(const Eigen::Matrix<T,1,Eigen::Dynamic>& x,
+
361  size_t n,
+
362  const char* error_msg,
+
363  size_t idx) {
+
364  check_range(x.size(),n,error_msg,idx);
+
365  return x(n - 1);
+
366  }
+
367 
+
368  }
+
369 }
+
370 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/get__base1__lhs_8hpp.html b/doc/api/html/get__base1__lhs_8hpp.html new file mode 100644 index 00000000000..85b43cf2924 --- /dev/null +++ b/doc/api/html/get__base1__lhs_8hpp.html @@ -0,0 +1,177 @@ + + + + + +Stan: src/stan/math/matrix/get_base1_lhs.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
get_base1_lhs.hpp File Reference
+
+
+
#include <vector>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/check_range.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

template<typename T >
T & stan::math::get_base1_lhs (std::vector< T > &x, size_t i, const char *error_msg, size_t idx)
 Return a reference to the value of the specified vector at the specified base-one index.
 
template<typename T >
T & stan::math::get_base1_lhs (std::vector< std::vector< T > > &x, size_t i1, size_t i2, const char *error_msg, size_t idx)
 Return a reference to the value of the specified vector at the specified base-one indexes.
 
template<typename T >
T & stan::math::get_base1_lhs (std::vector< std::vector< std::vector< T > > > &x, size_t i1, size_t i2, size_t i3, const char *error_msg, size_t idx)
 Return a reference to the value of the specified vector at the specified base-one indexes.
 
template<typename T >
T & stan::math::get_base1_lhs (std::vector< std::vector< std::vector< std::vector< T > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, const char *error_msg, size_t idx)
 Return a reference to the value of the specified vector at the specified base-one indexes.
 
template<typename T >
T & stan::math::get_base1_lhs (std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, size_t i5, const char *error_msg, size_t idx)
 Return a reference to the value of the specified vector at the specified base-one indexes.
 
template<typename T >
T & stan::math::get_base1_lhs (std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, size_t i5, size_t i6, const char *error_msg, size_t idx)
 Return a reference to the value of the specified vector at the specified base-one indexes.
 
template<typename T >
T & stan::math::get_base1_lhs (std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, size_t i5, size_t i6, size_t i7, const char *error_msg, size_t idx)
 Return a reference to the value of the specified vector at the specified base-one indexes.
 
template<typename T >
T & stan::math::get_base1_lhs (std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, size_t i5, size_t i6, size_t i7, size_t i8, const char *error_msg, size_t idx)
 Return a reference to the value of the specified vector at the specified base-one indexes.
 
template<typename T >
Eigen::Block< Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > > 
stan::math::get_base1_lhs (Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &x, size_t m, const char *error_msg, size_t idx)
 Return a copy of the row of the specified vector at the specified base-one row index.
 
template<typename T >
T & stan::math::get_base1_lhs (Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &x, size_t m, size_t n, const char *error_msg, size_t idx)
 Return a reference to the value of the specified matrix at the specified base-one row and column indexes.
 
template<typename T >
T & stan::math::get_base1_lhs (Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, size_t m, const char *error_msg, size_t idx)
 Return a reference to the value of the specified column vector at the specified base-one index.
 
template<typename T >
T & stan::math::get_base1_lhs (Eigen::Matrix< T, 1, Eigen::Dynamic > &x, size_t n, const char *error_msg, size_t idx)
 Return a reference to the value of the specified row vector at the specified base-one index.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/get__base1__lhs_8hpp_source.html b/doc/api/html/get__base1__lhs_8hpp_source.html new file mode 100644 index 00000000000..d103abd5452 --- /dev/null +++ b/doc/api/html/get__base1__lhs_8hpp_source.html @@ -0,0 +1,276 @@ + + + + + +Stan: src/stan/math/matrix/get_base1_lhs.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
get_base1_lhs.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__GET_BASE1_LHS_HPP__
+
2 #define __STAN__MATH__MATRIX__GET_BASE1_LHS_HPP__
+
3 
+
4 #include <vector>
+ + +
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
25  template <typename T>
+
26  inline
+
27  T& get_base1_lhs(std::vector<T>& x,
+
28  size_t i,
+
29  const char* error_msg,
+
30  size_t idx) {
+
31  check_range(x.size(),i,error_msg,idx);
+
32  return x[i - 1];
+
33  }
+
34 
+
50  template <typename T>
+
51  inline
+
52  T& get_base1_lhs(std::vector<std::vector<T> >& x,
+
53  size_t i1,
+
54  size_t i2,
+
55  const char* error_msg,
+
56  size_t idx) {
+
57  check_range(x.size(),i1,error_msg,idx);
+
58  return get_base1_lhs(x[i1 - 1],i2,error_msg,idx+1);
+
59  }
+
60 
+
77  template <typename T>
+
78  inline
+
79  T& get_base1_lhs(std::vector<std::vector<std::vector<T> > >& x,
+
80  size_t i1,
+
81  size_t i2,
+
82  size_t i3,
+
83  const char* error_msg,
+
84  size_t idx) {
+
85  check_range(x.size(),i1,error_msg,idx);
+
86  return get_base1_lhs(x[i1 - 1],i2,i3,error_msg,idx+1);
+
87  }
+
88 
+
106  template <typename T>
+
107  inline
+
108  T& get_base1_lhs(std::vector<std::vector<std::vector<std::vector<T> > > >& x,
+
109  size_t i1,
+
110  size_t i2,
+
111  size_t i3,
+
112  size_t i4,
+
113  const char* error_msg,
+
114  size_t idx) {
+
115  check_range(x.size(),i1,error_msg,idx);
+
116  return get_base1_lhs(x[i1 - 1],i2,i3,i4,error_msg,idx+1);
+
117  }
+
118 
+
137  template <typename T>
+
138  inline
+
139  T& get_base1_lhs(std::vector<std::vector<std::vector<std::vector<std::vector<T> > > > >& x,
+
140  size_t i1,
+
141  size_t i2,
+
142  size_t i3,
+
143  size_t i4,
+
144  size_t i5,
+
145  const char* error_msg,
+
146  size_t idx) {
+
147  check_range(x.size(),i1,error_msg,idx);
+
148  return get_base1_lhs(x[i1 - 1],i2,i3,i4,i5,error_msg,idx+1);
+
149  }
+
150 
+
170  template <typename T>
+
171  inline
+
172  T& get_base1_lhs(std::vector<std::vector<std::vector<std::vector<std::vector<std::vector<T> > > > > >& x,
+
173  size_t i1,
+
174  size_t i2,
+
175  size_t i3,
+
176  size_t i4,
+
177  size_t i5,
+
178  size_t i6,
+
179  const char* error_msg,
+
180  size_t idx) {
+
181  check_range(x.size(),i1,error_msg,idx);
+
182  return get_base1_lhs(x[i1 - 1],i2,i3,i4,i5,i6,error_msg,idx+1);
+
183  }
+
184 
+
185 
+
206  template <typename T>
+
207  inline
+
208  T& get_base1_lhs(std::vector<std::vector<std::vector<std::vector<std::vector<std::vector<std::vector<T> > > > > > >& x,
+
209  size_t i1,
+
210  size_t i2,
+
211  size_t i3,
+
212  size_t i4,
+
213  size_t i5,
+
214  size_t i6,
+
215  size_t i7,
+
216  const char* error_msg,
+
217  size_t idx) {
+
218  check_range(x.size(),i1,error_msg,idx);
+
219  return get_base1_lhs(x[i1 - 1],i2,i3,i4,i5,i6,i7,error_msg,idx+1);
+
220  }
+
221 
+
222 
+
244  template <typename T>
+
245  inline
+
246  T& get_base1_lhs(std::vector<std::vector<std::vector<std::vector<std::vector<std::vector<std::vector<std::vector<T> > > > > > > >& x,
+
247  size_t i1,
+
248  size_t i2,
+
249  size_t i3,
+
250  size_t i4,
+
251  size_t i5,
+
252  size_t i6,
+
253  size_t i7,
+
254  size_t i8,
+
255  const char* error_msg,
+
256  size_t idx) {
+
257  check_range(x.size(),i1,error_msg,idx);
+
258  return get_base1_lhs(x[i1 - 1],i2,i3,i4,i5,i6,i7,i8,error_msg,idx+1);
+
259  }
+
260 
+
261 
+
262 
+
282  template <typename T>
+
283  inline
+
284  Eigen::Block<Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> >
+
285  get_base1_lhs(Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& x,
+
286  size_t m,
+
287  const char* error_msg,
+
288  size_t idx) {
+
289  check_range(x.rows(),m,error_msg,idx);
+
290  return x.block(m-1,0,1,x.cols());
+
291  }
+
292 
+
309  template <typename T>
+
310  inline
+
311  T& get_base1_lhs(Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& x,
+
312  size_t m,
+
313  size_t n,
+
314  const char* error_msg,
+
315  size_t idx) {
+
316  check_range(x.rows(),m,error_msg,idx);
+
317  check_range(x.cols(),n,error_msg,idx + 1);
+
318  return x(m - 1, n - 1);
+
319  }
+
320 
+
335  template <typename T>
+
336  inline
+
337  T& get_base1_lhs(Eigen::Matrix<T,Eigen::Dynamic,1>& x,
+
338  size_t m,
+
339  const char* error_msg,
+
340  size_t idx) {
+
341  check_range(x.size(),m,error_msg,idx);
+
342  return x(m - 1);
+
343 
+
344  }
+
345 
+
360  template <typename T>
+
361  inline
+
362  T& get_base1_lhs(Eigen::Matrix<T,1,Eigen::Dynamic>& x,
+
363  size_t n,
+
364  const char* error_msg,
+
365  size_t idx) {
+
366  check_range(x.size(),n,error_msg,idx);
+
367  return x(n - 1);
+
368  }
+
369 
+
370  }
+
371 }
+
372 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/globals.html b/doc/api/html/globals.html new file mode 100644 index 00000000000..76264aeda73 --- /dev/null +++ b/doc/api/html/globals.html @@ -0,0 +1,443 @@ + + + + + +Stan: File Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- _ -

+ + +

- a -

+ + +

- b -

+ + +

- c -

+ + +

- d -

+ + +

- e -

+ + +

- i -

+ + +

- l -

+ + +

- m -

+ + +

- n -

+ + +

- p -

+ + +

- s -

+ + +

- u -

+ + +

- v -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/globals_defs.html b/doc/api/html/globals_defs.html new file mode 100644 index 00000000000..74b200f9bfa --- /dev/null +++ b/doc/api/html/globals_defs.html @@ -0,0 +1,127 @@ + + + + + +Stan: File Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + +
+ + + + +
+ +
+ +
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/globals_func.html b/doc/api/html/globals_func.html new file mode 100644 index 00000000000..ea6f451c797 --- /dev/null +++ b/doc/api/html/globals_func.html @@ -0,0 +1,164 @@ + + + + + +Stan: File Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + +
+ + + + +
+ +
+ +
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/globals_vars.html b/doc/api/html/globals_vars.html new file mode 100644 index 00000000000..545fafcdaef --- /dev/null +++ b/doc/api/html/globals_vars.html @@ -0,0 +1,356 @@ + + + + + +Stan: File Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- _ -

+ + +

- a -

+ + +

- b -

+ + +

- c -

+ + +

- d -

+ + +

- e -

+ + +

- i -

+ + +

- l -

+ + +

- m -

+ + +

- n -

+ + +

- s -

+ + +

- v -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/gm_8hpp.html b/doc/api/html/gm_8hpp.html new file mode 100644 index 00000000000..aba30dd434c --- /dev/null +++ b/doc/api/html/gm_8hpp.html @@ -0,0 +1,111 @@ + + + + + +Stan: src/stan/gm.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
gm.hpp File Reference
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/gm_8hpp_source.html b/doc/api/html/gm_8hpp_source.html new file mode 100644 index 00000000000..a5bf7e7151f --- /dev/null +++ b/doc/api/html/gm_8hpp_source.html @@ -0,0 +1,114 @@ + + + + + +Stan: src/stan/gm.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
gm.hpp
+
+
+Go to the documentation of this file.
1 #ifndef STAN_GM_HPP
+
2 #define STAN_GM_HPP
+
3 
+
4 #include <stan/gm/ast.hpp>
+
5 #include <stan/gm/command.hpp>
+
6 
+
7 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/grad_8hpp.html b/doc/api/html/grad_8hpp.html new file mode 100644 index 00000000000..cdabfcbdc52 --- /dev/null +++ b/doc/api/html/grad_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/grad.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
grad.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + +

+Functions

void stan::agrad::grad (var &v, Eigen::Matrix< var, Eigen::Dynamic, 1 > &x, Eigen::VectorXd &g)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/grad_8hpp_source.html b/doc/api/html/grad_8hpp_source.html new file mode 100644 index 00000000000..89dd7358da4 --- /dev/null +++ b/doc/api/html/grad_8hpp_source.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/grad.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
grad.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__GRAD_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__GRAD_HPP__
+
3 
+
4 
+ + +
7 #include <stan/agrad/rev/var.hpp>
+
8 
+
9 namespace stan {
+
10 
+
11  namespace agrad {
+
12 
+
13  void grad(var& v,
+
14  Eigen::Matrix<var,Eigen::Dynamic,1>& x,
+
15  Eigen::VectorXd& g) {
+ +
17  g.resize(x.size());
+
18  for (int i = 0; i < x.size(); ++i)
+
19  g(i) = x(i).vi_->adj_;
+ +
21  }
+
22 
+
23  }
+
24 }
+
25 
+
26 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/gumbel_8hpp.html b/doc/api/html/gumbel_8hpp.html new file mode 100644 index 00000000000..1b6fba476e8 --- /dev/null +++ b/doc/api/html/gumbel_8hpp.html @@ -0,0 +1,157 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/gumbel.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
gumbel.hpp File Reference
+
+
+
#include <boost/random/uniform_01.hpp>
+#include <boost/random/variate_generator.hpp>
+#include <stan/agrad/partials_vari.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/prob/constants.hpp>
+#include <stan/prob/traits.hpp>
+#include <stan/prob/internal_math.hpp>
+#include <stan/math/functions/value_of.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + + + + + + +

+Functions

template<bool propto, typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
stan::prob::gumbel_log (const T_y &y, const T_loc &mu, const T_scale &beta)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
stan::prob::gumbel_log (const T_y &y, const T_loc &mu, const T_scale &beta)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
stan::prob::gumbel_cdf (const T_y &y, const T_loc &mu, const T_scale &beta)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
stan::prob::gumbel_cdf_log (const T_y &y, const T_loc &mu, const T_scale &beta)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
stan::prob::gumbel_ccdf_log (const T_y &y, const T_loc &mu, const T_scale &beta)
 
template<class RNG >
double stan::prob::gumbel_rng (const double mu, const double beta, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/gumbel_8hpp_source.html b/doc/api/html/gumbel_8hpp_source.html new file mode 100644 index 00000000000..bdf8668ce94 --- /dev/null +++ b/doc/api/html/gumbel_8hpp_source.html @@ -0,0 +1,440 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/gumbel.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
gumbel.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS__GUMBEL_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS__GUMBEL_HPP__
+
3 
+
4 #include <boost/random/uniform_01.hpp>
+
5 #include <boost/random/variate_generator.hpp>
+
6 
+ + +
9 #include <stan/meta/traits.hpp>
+
10 #include <stan/prob/constants.hpp>
+
11 #include <stan/prob/traits.hpp>
+ + +
14 
+
15 namespace stan {
+
16 
+
17  namespace prob {
+
18 
+
19  template <bool propto, typename T_y, typename T_loc, typename T_scale>
+
20  typename return_type<T_y,T_loc,T_scale>::type
+
21  gumbel_log(const T_y& y, const T_loc& mu, const T_scale& beta) {
+
22  static const char* function = "stan::prob::gumbel_log(%1%)";
+
23 
+
24  using std::log;
+
25  using std::exp;
+ + + + + + + +
33 
+
34  // check if any vectors are zero length
+
35  if (!(stan::length(y)
+
36  && stan::length(mu)
+
37  && stan::length(beta)))
+
38  return 0.0;
+
39 
+
40  // set up return value accumulator
+
41  double logp(0.0);
+
42 
+
43  // validate args (here done over var, which should be OK)
+
44  if (!check_not_nan(function, y, "Random variable", &logp))
+
45  return logp;
+
46  if (!check_finite(function, mu, "Location parameter",
+
47  &logp))
+
48  return logp;
+
49  if (!check_positive(function, beta, "Scale parameter",
+
50  &logp))
+
51  return logp;
+
52  if (!(check_consistent_sizes(function,
+
53  y,mu,beta,
+
54  "Random variable","Location parameter","Scale parameter",
+
55  &logp)))
+
56  return logp;
+
57 
+
58  // check if no variables are involved and prop-to
+ +
60  return 0.0;
+
61 
+
62  // set up template expressions wrapping scalars into vector views
+ +
64  operands_and_partials(y, mu, beta);
+
65 
+
66  VectorView<const T_y> y_vec(y);
+
67  VectorView<const T_loc> mu_vec(mu);
+
68  VectorView<const T_scale> beta_vec(beta);
+
69  size_t N = max_size(y, mu, beta);
+
70 
+ + +
73  is_vector<T_scale>::value> log_beta(length(beta));
+
74  for (size_t i = 0; i < length(beta); i++) {
+
75  inv_beta[i] = 1.0 / value_of(beta_vec[i]);
+ +
77  log_beta[i] = log(value_of(beta_vec[i]));
+
78  }
+
79 
+
80  for (size_t n = 0; n < N; n++) {
+
81  // pull out values of arguments
+
82  const double y_dbl = value_of(y_vec[n]);
+
83  const double mu_dbl = value_of(mu_vec[n]);
+
84 
+
85  // reusable subexpression values
+
86  const double y_minus_mu_over_beta
+
87  = (y_dbl - mu_dbl) * inv_beta[n];
+
88 
+
89  // log probability
+ +
91  logp -= log_beta[n];
+ +
93  logp += -y_minus_mu_over_beta - exp(-y_minus_mu_over_beta);
+
94 
+
95  // gradients
+
96  double scaled_diff = inv_beta[n] * exp(-y_minus_mu_over_beta);
+ +
98  operands_and_partials.d_x1[n] -= inv_beta[n] - scaled_diff;
+ +
100  operands_and_partials.d_x2[n] += inv_beta[n] - scaled_diff;
+ +
102  operands_and_partials.d_x3[n]
+
103  += -inv_beta[n] + y_minus_mu_over_beta * inv_beta[n]
+
104  - scaled_diff * y_minus_mu_over_beta;
+
105  }
+
106  return operands_and_partials.to_var(logp);
+
107  }
+
108 
+
109  template <typename T_y, typename T_loc, typename T_scale>
+
110  inline
+ +
112  gumbel_log(const T_y& y, const T_loc& mu, const T_scale& beta) {
+
113  return gumbel_log<false>(y,mu,beta);
+
114  }
+
115 
+
116  template <typename T_y, typename T_loc, typename T_scale>
+ +
118  gumbel_cdf(const T_y& y, const T_loc& mu, const T_scale& beta) {
+
119  static const char* function = "stan::prob::gumbel_cdf(%1%)";
+
120 
+ + + + +
125  using stan::math::value_of;
+
126 
+
127  double cdf(1.0);
+
128  // check if any vectors are zero length
+
129  if (!(stan::length(y)
+
130  && stan::length(mu)
+
131  && stan::length(beta)))
+
132  return cdf;
+
133 
+
134  if (!check_not_nan(function, y, "Random variable", &cdf))
+
135  return cdf;
+
136  if (!check_finite(function, mu, "Location parameter", &cdf))
+
137  return cdf;
+
138  if (!check_not_nan(function, beta, "Scale parameter", &cdf))
+
139  return cdf;
+
140  if (!check_positive(function, beta, "Scale parameter", &cdf))
+
141  return cdf;
+
142  if (!(check_consistent_sizes(function, y,mu,beta,
+
143  "Random variable","Location parameter",
+
144  "Scale parameter", &cdf)))
+
145  return cdf;
+
146 
+ +
148  operands_and_partials(y, mu, beta);
+
149 
+
150  VectorView<const T_y> y_vec(y);
+
151  VectorView<const T_loc> mu_vec(mu);
+
152  VectorView<const T_scale> beta_vec(beta);
+
153  size_t N = max_size(y, mu, beta);
+
154 
+
155  for (size_t n = 0; n < N; n++) {
+
156  const double y_dbl = value_of(y_vec[n]);
+
157  const double mu_dbl = value_of(mu_vec[n]);
+
158  const double beta_dbl = value_of(beta_vec[n]);
+
159  const double scaled_diff = (y_dbl - mu_dbl) / beta_dbl;
+
160  const double rep_deriv = exp(-scaled_diff - exp(-scaled_diff))
+
161  / beta_dbl;
+
162  const double cdf_ = exp(-exp(-scaled_diff));
+
163  cdf *= cdf_;
+
164 
+ +
166  operands_and_partials.d_x1[n] += rep_deriv / cdf_;
+ +
168  operands_and_partials.d_x2[n] -= rep_deriv / cdf_;
+ +
170  operands_and_partials.d_x3[n] -= rep_deriv * scaled_diff / cdf_;
+
171  }
+
172 
+ +
174  for(size_t n = 0; n < stan::length(y); ++n)
+
175  operands_and_partials.d_x1[n] *= cdf;
+
176  }
+ +
178  for(size_t n = 0; n < stan::length(mu); ++n)
+
179  operands_and_partials.d_x2[n] *= cdf;
+
180  }
+ +
182  for(size_t n = 0; n < stan::length(beta); ++n)
+
183  operands_and_partials.d_x3[n] *= cdf;
+
184  }
+
185 
+
186  return operands_and_partials.to_var(cdf);
+
187  }
+
188 
+
189  template <typename T_y, typename T_loc, typename T_scale>
+ +
191  gumbel_cdf_log(const T_y& y, const T_loc& mu, const T_scale& beta) {
+
192  static const char* function = "stan::prob::gumbel_cdf_log(%1%)";
+
193 
+ + + + +
198  using stan::math::value_of;
+
199 
+
200  double cdf_log(0.0);
+
201  // check if any vectors are zero length
+
202  if (!(stan::length(y)
+
203  && stan::length(mu)
+
204  && stan::length(beta)))
+
205  return cdf_log;
+
206 
+
207  if (!check_not_nan(function, y, "Random variable", &cdf_log))
+
208  return cdf_log;
+
209  if (!check_finite(function, mu, "Location parameter", &cdf_log))
+
210  return cdf_log;
+
211  if (!check_not_nan(function, beta, "Scale parameter", &cdf_log))
+
212  return cdf_log;
+
213  if (!check_positive(function, beta, "Scale parameter", &cdf_log))
+
214  return cdf_log;
+
215  if (!(check_consistent_sizes(function, y,mu,beta,
+
216  "Random variable","Location parameter",
+
217  "Scale parameter", &cdf_log)))
+
218  return cdf_log;
+
219 
+ +
221  operands_and_partials(y, mu, beta);
+
222 
+
223  VectorView<const T_y> y_vec(y);
+
224  VectorView<const T_loc> mu_vec(mu);
+
225  VectorView<const T_scale> beta_vec(beta);
+
226  size_t N = max_size(y, mu, beta);
+
227 
+
228  for (size_t n = 0; n < N; n++) {
+
229  const double y_dbl = value_of(y_vec[n]);
+
230  const double mu_dbl = value_of(mu_vec[n]);
+
231  const double beta_dbl = value_of(beta_vec[n]);
+
232  const double scaled_diff = (y_dbl - mu_dbl) / beta_dbl;
+
233  const double rep_deriv = exp(-scaled_diff) / beta_dbl;
+
234  cdf_log -= exp(-scaled_diff);
+
235 
+ +
237  operands_and_partials.d_x1[n] += rep_deriv;
+ +
239  operands_and_partials.d_x2[n] -= rep_deriv;
+ +
241  operands_and_partials.d_x3[n] -= rep_deriv * scaled_diff;
+
242  }
+
243 
+
244  return operands_and_partials.to_var(cdf_log);
+
245  }
+
246 
+
247  template <typename T_y, typename T_loc, typename T_scale>
+ +
249  gumbel_ccdf_log(const T_y& y, const T_loc& mu, const T_scale& beta) {
+
250  static const char* function = "stan::prob::gumbel_ccdf_log(%1%)";
+
251 
+ + + + +
256  using stan::math::value_of;
+
257 
+
258  double ccdf_log(0.0);
+
259  // check if any vectors are zero length
+
260  if (!(stan::length(y)
+
261  && stan::length(mu)
+
262  && stan::length(beta)))
+
263  return ccdf_log;
+
264 
+
265  if (!check_not_nan(function, y, "Random variable", &ccdf_log))
+
266  return ccdf_log;
+
267  if (!check_finite(function, mu, "Location parameter", &ccdf_log))
+
268  return ccdf_log;
+
269  if (!check_not_nan(function, beta, "Scale parameter", &ccdf_log))
+
270  return ccdf_log;
+
271  if (!check_positive(function, beta, "Scale parameter", &ccdf_log))
+
272  return ccdf_log;
+
273  if (!(check_consistent_sizes(function, y,mu,beta,
+
274  "Random variable","Location parameter",
+
275  "Scale parameter", &ccdf_log)))
+
276  return ccdf_log;
+
277 
+ +
279  operands_and_partials(y, mu, beta);
+
280 
+
281  VectorView<const T_y> y_vec(y);
+
282  VectorView<const T_loc> mu_vec(mu);
+
283  VectorView<const T_scale> beta_vec(beta);
+
284  size_t N = max_size(y, mu, beta);
+
285 
+
286  for (size_t n = 0; n < N; n++) {
+
287  const double y_dbl = value_of(y_vec[n]);
+
288  const double mu_dbl = value_of(mu_vec[n]);
+
289  const double beta_dbl = value_of(beta_vec[n]);
+
290  const double scaled_diff = (y_dbl - mu_dbl) / beta_dbl;
+
291  const double rep_deriv = exp(-scaled_diff - exp(-scaled_diff))
+
292  / beta_dbl;
+
293  const double ccdf_log_ = 1.0 - exp(-exp(-scaled_diff));
+
294  ccdf_log += log(ccdf_log_);
+
295 
+ +
297  operands_and_partials.d_x1[n] -= rep_deriv / ccdf_log_;
+ +
299  operands_and_partials.d_x2[n] += rep_deriv / ccdf_log_;
+ +
301  operands_and_partials.d_x3[n] += rep_deriv * scaled_diff / ccdf_log_;
+
302  }
+
303 
+
304  return operands_and_partials.to_var(ccdf_log);
+
305  }
+
306 
+
307  template <class RNG>
+
308  inline double
+
309  gumbel_rng(const double mu,
+
310  const double beta,
+
311  RNG& rng) {
+
312  using boost::variate_generator;
+
313  using boost::uniform_01;
+
314 
+
315  static const char* function = "stan::prob::gumbel_rng(%1%)";
+
316 
+ + +
319 
+
320 
+
321  if (!check_finite(function, mu, "Location parameter"))
+
322  return 0;
+
323  if (!check_positive(function, beta, "Scale parameter"))
+
324  return 0;
+
325 
+
326  variate_generator<RNG&, uniform_01<> >
+
327  uniform01_rng(rng, uniform_01<>());
+
328  return mu - beta * std::log(-std::log(uniform01_rng()));
+
329  }
+
330  }
+
331 }
+
332 #endif
+
333 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/head_8hpp.html b/doc/api/html/head_8hpp.html new file mode 100644 index 00000000000..1bf51bb01ca --- /dev/null +++ b/doc/api/html/head_8hpp.html @@ -0,0 +1,144 @@ + + + + + +Stan: src/stan/math/matrix/head.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
head.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + + + + + +

+Functions

template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
stan::math::head (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v, size_t n)
 Return the specified number of elements as a vector from the front of the specified vector.
 
template<typename T >
Eigen::Matrix< T,
+1, Eigen::Dynamic > 
stan::math::head (const Eigen::Matrix< T, 1, Eigen::Dynamic > &rv, size_t n)
 Return the specified number of elements as a row vector from the front of the specified row vector.
 
template<typename T >
std::vector< T > stan::math::head (const std::vector< T > &sv, size_t n)
 Return the specified number of elements as a standard vector from the front of the specified standard vector.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/head_8hpp_source.html b/doc/api/html/head_8hpp_source.html new file mode 100644 index 00000000000..068a8d78e98 --- /dev/null +++ b/doc/api/html/head_8hpp_source.html @@ -0,0 +1,156 @@ + + + + + +Stan: src/stan/math/matrix/head.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
head.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__HEAD_HPP__
+
2 #define __STAN__MATH__MATRIX__HEAD_HPP__
+
3 
+
4 #include <vector>
+
5 
+ + + + +
10 
+
11 namespace stan {
+
12  namespace math {
+
13 
+
22  template <typename T>
+
23  inline
+
24  Eigen::Matrix<T,Eigen::Dynamic,1>
+
25  head(const Eigen::Matrix<T,Eigen::Dynamic,1>& v,
+
26  size_t n) {
+
27  if (n != 0)
+
28  validate_row_index(v, n, "head");
+
29  return v.head(n);
+
30  }
+
31 
+
40  template <typename T>
+
41  inline
+
42  Eigen::Matrix<T,1,Eigen::Dynamic>
+
43  head(const Eigen::Matrix<T,1,Eigen::Dynamic>& rv,
+
44  size_t n) {
+
45  if (n != 0)
+
46  validate_column_index(rv, n, "head");
+
47  return rv.head(n);
+
48  }
+
49 
+
58  template <typename T>
+
59  std::vector<T> head(const std::vector<T>& sv,
+
60  size_t n) {
+
61  if (n != 0)
+
62  validate_std_vector_index(sv, n, "head");
+
63  std::vector<T> s;
+
64  for (size_t i = 0; i < n; ++i)
+
65  s.push_back(sv[i]);
+
66  return s;
+
67  }
+
68 
+
69 
+
70  }
+
71 }
+
72 
+
73 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/hessian_8hpp.html b/doc/api/html/hessian_8hpp.html new file mode 100644 index 00000000000..4460ac95ae1 --- /dev/null +++ b/doc/api/html/hessian_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/hessian.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
hessian.hpp File Reference
+
+
+
#include <vector>
+#include <stan/agrad/rev.hpp>
+#include <stan/agrad/fwd.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<class F >
double stan::agrad::hessian (const F &f, const std::vector< double > &x, const std::vector< double > &v, std::vector< double > &Hv)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/hessian_8hpp_source.html b/doc/api/html/hessian_8hpp_source.html new file mode 100644 index 00000000000..4967bb65d2e --- /dev/null +++ b/doc/api/html/hessian_8hpp_source.html @@ -0,0 +1,151 @@ + + + + + +Stan: src/stan/agrad/hessian.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
hessian.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__HESSIAN_HPP__
+
2 #define __STAN__AGRAD__HESSIAN_HPP__
+
3 
+
4 #include <vector>
+
5 
+
6 #include <stan/agrad/rev.hpp>
+
7 #include <stan/agrad/fwd.hpp>
+
8 
+ +
10 
+
11 namespace stan {
+
12 
+
13  namespace agrad {
+
14 
+
15  // f: vector<T> -> T
+
16  // Hv = H(f(x)) * v; return f(x)
+
17 
+
18  template <class F>
+
19  double
+
20  hessian(const F& f,
+
21  const std::vector<double>& x,
+
22  const std::vector<double>& v,
+
23  std::vector<double>& Hv) {
+
24 
+
25  using stan::agrad::var;
+
26  using stan::agrad::fvar;
+
27 
+
28  std::vector<var> x_var(x.size());
+
29  for (int i = 0; i < x_var.size(); ++i)
+
30  x_var[i] = x[i];
+
31 
+
32  std::vector<fvar<var> > x_fvar(x.size());
+
33  for (int i = 0; i < x_fvar.size(); ++i)
+
34  x_fvar[i] = fvar<var>(x_var[i], v[i]);
+
35  fvar<var> y = f(x_fvar);
+
36  y.d_.grad(x_var,Hv);
+
37  return y.val_.val();
+
38  }
+
39 
+
40  }
+
41 }
+
42 
+
43 
+
44 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/hierarchy.html b/doc/api/html/hierarchy.html new file mode 100644 index 00000000000..221c8c200b0 --- /dev/null +++ b/doc/api/html/hierarchy.html @@ -0,0 +1,534 @@ + + + + + +Stan: Class Hierarchy + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + +
+ + + + +
+ +
+ +
+
+
Class Hierarchy
+
+
+
This inheritance list is sorted roughly, but not completely, alphabetically:
+
[detail level 12345]
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
oCstan::math::accumulator< T >Class to accumulate values and eventually return their sum
oCstan::gm::add_conditional_body
oCstan::gm::add_conditional_condition
oCstan::gm::add_expression_dimss
oCstan::gm::add_loop_identifier
oCstan::gm::add_while_body
oCstan::gm::add_while_condition
oCstan::gm::addition_expr
oCstan::gm::argument
oCstan::gm::argument_parser
oCstan::gm::argument_probe
oCstan::math::array_builder< T >Structure for building up arrays in an expression (rather than in statements) using an argumentchaining add() method and a getter method array() to return the result
oCstan::gm::array_literal
oCstan::gm::assignment
oCstan::mcmc::base_adaptation
oCstan::mcmc::base_adapter
oCstan::mcmc::base_hamiltonian< M, P, BaseRNG >
oCstan::mcmc::base_hamiltonian< M, dense_e_point, BaseRNG >
oCstan::mcmc::base_hamiltonian< M, diag_e_point, BaseRNG >
oCstan::mcmc::base_hamiltonian< M, unit_e_point, BaseRNG >
oCstan::mcmc::base_integrator< H, P >
oCstan::mcmc::base_integrator< dense_e_metric< M, BaseRNG >, dense_e_point >
oCstan::mcmc::base_integrator< diag_e_metric< M, BaseRNG >, diag_e_point >
oCstan::mcmc::base_integrator< unit_e_metric< M, BaseRNG >, unit_e_point >
oCstan::mcmc::base_mcmc
oCstan::gm::base_var_decl
oCstan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >
oCstan::optimization::BFGSMinimizer< ModelAdaptor< M > >
oCstan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::BFGSOptions
oCstan::gm::binary_op
oCstan::gm::binary_op_expr
oCstan::agrad::chainableAbstract base class for variable implementations that handles memory management and applying the chain rule
oCstan::agrad::chainable_allocA chainable_alloc is an object which is constructed and destructed normally but the memory lifespan is managed along with the arena allocator for the gradient calculation
oCstan::mcmc::chains< RNG >An mcmc::chains object stores parameter names and dimensionalities along with samples from multiple chains
oCstan::memory::chunk_alloc< T, Tnchunks_per_block >
oCstan::io::cmd_lineParses and stores command-line arguments
oCstan::math::common_type< T1, T2 >
oCstan::math::common_type< Eigen::Matrix< T1, R, C >, Eigen::Matrix< T2, R, C > >
oCstan::math::common_type< std::vector< T1 >, std::vector< T2 > >
oCstan::gm::conditional_statement
oCstan::contains_fvar< T1, T2, T3, T4, T5, T6 >Metaprogram to calculate the base scalar return type resulting from promoting all the scalar types of the template parameters
oCstan::io::csv_writerWrites Stan variables in comma-separated-value format to an output stream
oCstan::gm::distribution
oCstan::gm::division_expr
oCdot_product_store_type< T >
oCstan::gm::double_literal
oCstan::DoubleVectorView< used, is_vec >DoubleVectorView allocates double values to be used as intermediate values
oCstan::DoubleVectorView< true, false >
oCstan::DoubleVectorView< true, true >
oCstan::io::dump_readerReads data from S-plus dump format
oCstan::io::dump_writerWrites data into the S-plus dump format
oCstan::gm::elt_division_expr
oCstan::gm::elt_multiplication_expr
oCstan::gm::error_codes
oCstan::gm::expr_type
oCstan::gm::expression
oCstan::gm::expression_as_statement
oCexpression_grammar< Iterator >
oCstan::gm::for_statement
oCstan::gm::fun
oCstan::gm::function_signatures
oCstan::agrad::fvar< T >
oCEigen::internal::general_matrix_matrix_product< Index, stan::agrad::var, LhsStorageOrder, ConjugateLhs, stan::agrad::var, RhsStorageOrder, ConjugateRhs, ColMajor >
oCEigen::internal::general_matrix_vector_product< Index, stan::agrad::var, ColMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >Override matrix-vector and matrix-matrix products to use more efficient implementation
oCEigen::internal::general_matrix_vector_product< Index, stan::agrad::var, RowMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >
oCgrammar
oCstan::prob::include_summand< propto, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10 >Template metaprogram to calculate whether a summand needs to be included in a proportional (log) probability calculation
oCstan::gm::increment_log_prob_statement
oCstan::gm::index_op
oCstan::gm::int_literal
oCstan::is_constant< T >Metaprogramming struct to detect whether a given type is constant in the mathematical sense (not the C++ const sense)
oCstan::is_constant_struct< T >Metaprogram to determine if a type has a base scalar type that can be assigned to type double
oCstan::is_constant_struct< Eigen::Block< T > >
oCstan::is_constant_struct< Eigen::Matrix< T, R, C > >
oCstan::is_constant_struct< std::vector< T > >
oCstan::is_fvar< T >
oCstan::is_fvar< stan::agrad::fvar< T > >
oCstan::is_var< T >
oCstan::is_var< stan::agrad::var >
oCstan::is_var_or_arithmetic< T1, T2, T3, T4, T5, T6 >
oCstan::is_vector< T >
oCstan::is_vector< const T >
oCstan::is_vector< Eigen::Matrix< T, 1, Eigen::Dynamic > >
oCstan::is_vector< Eigen::Matrix< T, Eigen::Dynamic, 1 > >
oCstan::is_vector< std::vector< T > >
oCstan::is_vector_like< T >
oCstan::is_vector_like< const T >
oCstan::is_vector_like< Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > >
oCstan::is_vector_like< T * >
oCLDLT_factor< T, R, C >
oCstan::math::LDLT_factor< double, R, C >
oCstan::math::LDLT_factor< stan::agrad::var, R, C >
oCstan::gm::left_division_expr
oCstan::gm::logical_negate_expr
oCstan::io::mcmc_writer< M >
oCstan::optimization::ModelAdaptor< M >
oCstan::gm::multiplication_expr
oCstan::gm::negate_expr
oCstan::optimization::NesterovGradient< M >
oCstan::gm::nilPlaceholder struct for boost::variant default ctors
oCstan::gm::no_op_statement
oCstd::numeric_limits< stan::agrad::fvar< T > >
oCstd::numeric_limits< stan::agrad::var >Specialization of numeric limits for var objects
oCEigen::NumTraits< stan::agrad::var >Numerical traits template override for Eigen for automatic gradient variables
oCstan::mcmc::nuts_util
oCstan::agrad::OperandsAndPartials< T1, T2, T3, T4, T5, T6, T_return_type >A variable implementation that stores operands and derivatives with respect to the variable
oCstan::math::pass_type< T >
oCstan::math::pass_type< double >
oCstan::math::pass_type< int >
oCstan::agrad::precomp_v_vari
oCstan::gm::print_statement
oCstan::gm::printable
oCstan::model::prob_gradThe prob_grad class represents the basic parameter holders for a model
oCstan::gm::program
oCstan::math::promoter< F, T >
oCstan::math::promoter< Eigen::Matrix< F, R, C >, Eigen::Matrix< T, R, C > >
oCstan::math::promoter< Eigen::Matrix< T, R, C >, Eigen::Matrix< T, R, C > >
oCstan::math::promoter< std::vector< F >, std::vector< T > >
oCstan::math::promoter< std::vector< T >, std::vector< T > >
oCstan::math::promoter< T, T >
oCstan::mcmc::ps_point
oCstan::gm::range
oCstan::io::reader< T >A stream-based reader for integer, scalar, vector, matrix and array data types, with Jacobian calculations
oCstan::gm::remove_loop_identifier
oCstan::gm::add_while_body::result< T1, T2 >
oCstan::gm::validate_allow_sample::result< T1, T2 >
oCstan::gm::set_fun_type_named::result< T1, T2, T3, T4 >
oCstan::gm::expression_as_statement::result< T1, T2, T3 >
oCstan::gm::division_expr::result< T1, T2, T3 >
oCstan::gm::validate_expr_type::result< T1, T2 >
oCstan::gm::set_fun_type2::result< T1, T2 >
oCstan::gm::binary_op_expr::result< T1, T2, T3, T4, T5 >
oCstan::gm::add_while_condition::result< T1, T2, T3 >
oCstan::gm::addition_expr::result< T1, T2, T3 >
oCstan::gm::add_conditional_condition::result< T1, T2, T3 >
oCstan::gm::add_conditional_body::result< T1, T2 >
oCstan::gm::unscope_locals::result< T1, T2 >
oCstan::gm::remove_loop_identifier::result< T1, T2 >
oCstan::gm::validate_expr_type2::result< T1, T2 >
oCstan::gm::set_fun_type::result< T1, T2 >
oCstan::gm::subtraction_expr::result< T1, T2, T3 >
oCstan::gm::negate_expr::result< T1, T2 >
oCstan::gm::validate_sample::result< T1, T2, T3 >
oCstan::gm::multiplication_expr::result< T1, T2, T3 >
oCstan::gm::validate_assignment::result< T1, T2, T3, T4 >
oCstan::gm::validate_int_expr2::result< T1, T2 >
oCstan::gm::elt_multiplication_expr::result< T1, T2, T3 >
oCstan::gm::elt_division_expr::result< T1, T2, T3 >
oCstan::gm::logical_negate_expr::result< T1, T2 >
oCstan::gm::add_expression_dimss::result< T1, T2, T3, T4 >
oCstan::gm::set_var_type::result< T1, T2, T3, T4 >
oCstan::gm::validate_int_expr3::result< T1, T2 >
oCstan::gm::add_loop_identifier::result< T1, T2, T3, T4 >
oCstan::gm::left_division_expr::result< T1, T2, T3 >
oCstan::gm::transpose_expr::result< T1, T2 >
oCstan::return_type< T1, T2, T3, T4, T5, T6 >Metaprogram to calculate the base scalar return type resulting from promoting all the scalar types of the template parameters
oCstan::gm::sample
oCstan::mcmc::sample
oCEigen::internal::scalar_product_traits< double, stan::agrad::var >Scalar product traits override for Eigen for automatic gradient variables
oCEigen::internal::scalar_product_traits< stan::agrad::var, double >Scalar product traits override for Eigen for automatic gradient variables
oCstan::scalar_type< T >Metaprogram structure to determine the base scalar type of a template argument
oCstan::scalar_type< Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > >
oCstan::scalar_type< T * >
oCstan::math::seq_view< T, S >
oCstan::math::seq_view< double, std::vector< int > >
oCstan::math::seq_view< T, Eigen::Matrix< S, 1, Eigen::Dynamic > >
oCstan::math::seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, 1 > >
oCstan::math::seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, Eigen::Dynamic > >
oCstan::math::seq_view< T, std::vector< S > >
oCstan::math::seq_view< T, std::vector< std::vector< T > > >
oCstan::math::seq_view< T, std::vector< T > >
oCstan::gm::set_fun_type
oCstan::gm::set_fun_type2
oCstan::gm::set_fun_type_named
oCstan::gm::set_var_type
oCEigen::internal::significant_decimals_default_impl< stan::agrad::var, false >Implemented this for printing to stream
oCstan::size_of_helper< T, is_vec >
oCstan::size_of_helper< T, true >
oCstan::memory::stack_allocAn instance of this class provides a memory pool through which blocks of raw memory may be allocated and then collected simultaneously
oCstan::io::stan_csv
oCstan::io::stan_csv_adaptation
oCstan::io::stan_csv_metadata
oCstan::io::stan_csv_readerReads from a Stan output csv file
oCstan::io::stan_csv_timing
oCstan::gm::statement
oCstatement_grammar< Iterator >
oCstan::gm::statements
oCstatic_visitor
oCstan::math::store_type< T >
oCstan::math::store_type< double >
oCstan::math::store_type< Eigen::Matrix< S, 1, Eigen::Dynamic > >
oCstan::math::store_type< Eigen::Matrix< S, Eigen::Dynamic, 1 > >
oCstan::math::store_type< Eigen::Matrix< S, Eigen::Dynamic, Eigen::Dynamic > >
oCstan::math::store_type< int >
oCstan::math::store_type< S >
oCstan::math::store_type< std::vector< int > >
oCstan::math::store_type< std::vector< S > >
oCstan::math::store_type< std::vector< std::vector< T > > >
oCstan::math::store_type< std::vector< T > >
oCstan::gm::subtraction_expr
oCterm_grammar< Iterator >
oCterm_grammar< Iterator >
oCstan::gm::transpose_expr
oCstan::gm::type_name< T >
oCstan::gm::type_name< bool >
oCstan::gm::type_name< double >
oCstan::gm::type_name< int >
oCstan::gm::type_name< std::string >
oCstan::gm::type_name< unsigned int >
oCstan::gm::unary_op
oCstan::gm::unscope_locals
oCstan::gm::validate_allow_sample
oCstan::gm::validate_assignment
oCstan::gm::validate_expr_type
oCstan::gm::validate_expr_type2
oCstan::gm::validate_int_expr2
oCstan::gm::validate_int_expr3
oCstan::gm::validate_sample
oCstan::agrad::varIndependent (input) and dependent (output) variables for gradients
oCstan::io::var_contextA var_reader reads array variables of integer and floating point type by name and dimension
oCstan::gm::var_decl
oCstan::gm::variable
oCstan::gm::variable_dims
oCstan::gm::variable_map
oCstan::VectorView< T, is_array, throw_if_accessed >VectorView is a template metaprogram that takes its argument and allows it to be used like a vector
oCstan::VectorView< const double, false, false >
oCstan::VectorView< const T, is_array, throw_if_accessed >VectorView that has const correctness
oCstan::VectorView< double *, is_vector< T1 >::value, is_constant_struct< T1 >::value >
oCstan::VectorView< double *, is_vector< T2 >::value, is_constant_struct< T2 >::value >
oCstan::VectorView< double *, is_vector< T3 >::value, is_constant_struct< T3 >::value >
oCstan::VectorView< double *, is_vector< T4 >::value, is_constant_struct< T4 >::value >
oCstan::VectorView< double *, is_vector< T5 >::value, is_constant_struct< T5 >::value >
oCstan::VectorView< double *, is_vector< T6 >::value, is_constant_struct< T6 >::value >
oCstan::gm::visgenGeneric visitor with output for extension
oCstan::prob::welford_covar_estimator
oCstan::prob::welford_var_estimator
oCstan::gm::while_statement
\Cstan::io::writer< T >A stream-based writer for integer, scalar, vector, matrix and array data types, which transforms from constrained to a sequence of constrained variables
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/hypergeometric_8hpp.html b/doc/api/html/hypergeometric_8hpp.html new file mode 100644 index 00000000000..4d24359522c --- /dev/null +++ b/doc/api/html/hypergeometric_8hpp.html @@ -0,0 +1,143 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/discrete/hypergeometric.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
hypergeometric.hpp File Reference
+
+
+
#include <boost/math/distributions.hpp>
+#include <stan/prob/distributions/univariate/continuous/uniform.hpp>
+#include <stan/agrad/partials_vari.hpp>
+#include <stan/math.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/prob/traits.hpp>
+#include <stan/prob/constants.hpp>
+#include <vector>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + +

+Functions

template<bool propto, typename T_n , typename T_N , typename T_a , typename T_b >
double stan::prob::hypergeometric_log (const T_n &n, const T_N &N, const T_a &a, const T_b &b)
 
template<typename T_n , typename T_N , typename T_a , typename T_b >
double stan::prob::hypergeometric_log (const T_n &n, const T_N &N, const T_a &a, const T_b &b)
 
template<class RNG >
int stan::prob::hypergeometric_rng (const int N, const int a, const int b, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/hypergeometric_8hpp_source.html b/doc/api/html/hypergeometric_8hpp_source.html new file mode 100644 index 00000000000..1045cfc68a4 --- /dev/null +++ b/doc/api/html/hypergeometric_8hpp_source.html @@ -0,0 +1,240 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/discrete/hypergeometric.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
hypergeometric.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__DISCRETE__HYPERGEOMETRIC_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__DISCRETE__HYPERGEOMETRIC_HPP__
+
3 
+
4 #include <boost/math/distributions.hpp>
+ + +
7 #include <stan/math.hpp>
+ +
9 #include <stan/meta/traits.hpp>
+
10 #include <stan/prob/traits.hpp>
+
11 #include <stan/prob/constants.hpp>
+
12 #include <vector>
+
13 
+
14 namespace stan {
+
15 
+
16  namespace prob {
+
17 
+
18  // Hypergeometric(n|N,a,b) [0 <= n <= a; 0 <= N-n <= b; 0 <= N <= a+b]
+
19  // n: #white balls drawn; N: #balls drawn;
+
20  // a: #white balls; b: #black balls
+
21  template <bool propto,
+
22  typename T_n, typename T_N,
+
23  typename T_a, typename T_b>
+
24  double
+
25  hypergeometric_log(const T_n& n, const T_N& N,
+
26  const T_a& a, const T_b& b) {
+
27  static const char* function = "stan::prob::hypergeometric_log(%1%)";
+
28 
+ + + + + +
34 
+
35  // check if any vectors are zero length
+
36  if (!(stan::length(n)
+
37  && stan::length(N)
+
38  && stan::length(a)
+
39  && stan::length(b)))
+
40  return 0.0;
+
41 
+
42 
+
43  VectorView<const T_n> n_vec(n);
+
44  VectorView<const T_N> N_vec(N);
+
45  VectorView<const T_a> a_vec(a);
+
46  VectorView<const T_b> b_vec(b);
+
47  size_t size = max_size(n, N, a, b);
+
48 
+
49  double logp(0.0);
+
50  if (!check_bounded(function, n, 0, a, "Successes variable", &logp))
+
51  return logp;
+
52  if (!check_greater(function, N, n, "Draws parameter", &logp))
+
53  return logp;
+
54  for (size_t i = 0; i < size; i++) {
+
55  if (!check_bounded(function, N_vec[i]-n_vec[i], 0, b_vec[i], "Draws parameter minus successes variable", &logp))
+
56  return logp;
+
57  if (!check_bounded(function, N_vec[i], 0, a_vec[i]+b_vec[i], "Draws parameter", &logp))
+
58  return logp;
+
59  }
+
60  if (!(check_consistent_sizes(function,
+
61  n,N,a,b,
+
62  "Successes variable","Draws parameter","Successes in population parameter","Failures in population parameter",
+
63  &logp)))
+
64  return logp;
+
65 
+
66  // check if no variables are involved and prop-to
+ +
68  return 0.0;
+
69 
+
70 
+
71  for (size_t i = 0; i < size; i++)
+
72  logp += math::binomial_coefficient_log(a_vec[i],n_vec[i])
+
73  + math::binomial_coefficient_log(b_vec[i],N_vec[i]-n_vec[i])
+
74  - math::binomial_coefficient_log(a_vec[i]+b_vec[i],N_vec[i]);
+
75  return logp;
+
76  }
+
77 
+
78  template <typename T_n,
+
79  typename T_N,
+
80  typename T_a,
+
81  typename T_b>
+
82  inline
+
83  double
+
84  hypergeometric_log(const T_n& n,
+
85  const T_N& N,
+
86  const T_a& a,
+
87  const T_b& b) {
+
88  return hypergeometric_log<false>(n,N,a,b);
+
89  }
+
90 
+
91  template <class RNG>
+
92  inline int
+
93  hypergeometric_rng(const int N,
+
94  const int a,
+
95  const int b,
+
96  RNG& rng) {
+
97  using boost::variate_generator;
+
98 
+
99  static const char* function = "stan::prob::hypergeometric_rng(%1%)";
+
100 
+ + +
103 
+
104  if (!check_bounded(function, N, 0, a+b, "Draws parameter"))
+
105  return 0;
+
106  if (!check_positive(function,N,"Draws parameter"))
+
107  return 0;
+
108  if (!check_positive(function,a,"Successes in population parameter"))
+
109  return 0;
+
110  if (!check_positive(function,b,"Failures in population parameter"))
+
111  return 0;
+
112 
+
113  boost::math::hypergeometric_distribution<>dist (b, N, a + b);
+
114  std::vector<double> index(a);
+
115  for(int i = 0; i < a; i++)
+
116  index[i] = cdf(dist, i + 1);
+
117 
+
118  double c = uniform_rng(0.0, 1.0, rng);
+
119  int min = 0;
+
120  int max = a - 1;
+
121  int mid = 0;
+
122  while(min < max) {
+
123  mid = (min + max) / 2;
+
124  if(index[mid] > c)
+
125  max = mid;
+
126  else
+
127  min = mid + 1;
+
128  }
+
129  return min + 1;
+
130  }
+
131  }
+
132 }
+
133 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/index.html b/doc/api/html/index.html new file mode 100644 index 00000000000..ce677dbbd2d --- /dev/null +++ b/doc/api/html/index.html @@ -0,0 +1,104 @@ + + + + + +Stan: Main Page + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + +
+ + + + +
+ +
+ +
+
+
Stan Documentation
+
+
+

This is the API documentation for Stan's C++ code.

+

What is Stan?

+
Stan is a C++ library for computations involving probability, sampling, and optimization.
Stan includes full algorithmic differentiation for gradients implementing a library of matrix, linear algebra, and probability mass, density, and distribution functions, along with code for adaptive Hamiltonian Monte Carlo sampling.

More Information

+
For more information, including pointers to narrative documentation, please visit Stan's home page at:

http://mc-stan.org/

+

Stan's home page is also available in the source distribution at

+

web/mc-stan.org/index.html

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/initialize_8hpp.html b/doc/api/html/initialize_8hpp.html new file mode 100644 index 00000000000..67ee61a856d --- /dev/null +++ b/doc/api/html/initialize_8hpp.html @@ -0,0 +1,143 @@ + + + + + +Stan: src/stan/math/matrix/initialize.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
initialize.hpp File Reference
+
+
+
#include <vector>
+#include <boost/type_traits/is_arithmetic.hpp>
+#include <boost/utility/enable_if.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + + + + + +

+Functions

template<typename T >
void stan::math::initialize (T &x, const T &v)
 
template<typename T , typename V >
boost::enable_if_c
+< boost::is_arithmetic< V >
+::value, void > 
stan::math::initialize (T &x, V v)
 
template<typename T , int R, int C>
void stan::math::initialize (Eigen::Matrix< T, R, C > &x, const T &v)
 
template<typename T , typename V >
void stan::math::initialize (std::vector< T > &x, const V &v)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/initialize_8hpp_source.html b/doc/api/html/initialize_8hpp_source.html new file mode 100644 index 00000000000..3cfc6f64113 --- /dev/null +++ b/doc/api/html/initialize_8hpp_source.html @@ -0,0 +1,145 @@ + + + + + +Stan: src/stan/math/matrix/initialize.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
initialize.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__INITIALIZE_HPP__
+
2 #define __STAN__MATH__MATRIX__INITIALIZE_HPP__
+
3 
+
4 #include <vector>
+
5 #include <boost/type_traits/is_arithmetic.hpp>
+
6 #include <boost/utility/enable_if.hpp>
+ +
8 
+
9 namespace stan {
+
10  namespace math {
+
11 
+
12  // initializations called for local variables generate in Stan
+
13  // code; fills in all cells in first arg with second arg
+
14 
+
15  template <typename T>
+
16  inline void initialize(T& x, const T& v) {
+
17  x = v;
+
18  }
+
19  template <typename T, typename V>
+
20  inline
+
21  typename boost::enable_if_c<boost::is_arithmetic<V>::value, void>
+
22  initialize(T& x, V v) {
+
23  x = v;
+
24  }
+
25  template <typename T, int R, int C>
+
26  inline void initialize(Eigen::Matrix<T,R,C>& x, const T& v) {
+
27  for (int i = 0; i < x.size(); ++i)
+
28  initialize(x(i),v);
+
29  }
+
30  template <typename T, typename V>
+
31  inline void initialize(std::vector<T>& x, const V& v) {
+
32  for (size_t i = 0; i < x.size(); ++i)
+
33  initialize(x[i],v);
+
34  }
+
35 
+
36  }
+
37 }
+
38 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/initialize__variable_8hpp.html b/doc/api/html/initialize__variable_8hpp.html new file mode 100644 index 00000000000..61c02db21eb --- /dev/null +++ b/doc/api/html/initialize__variable_8hpp.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/initialize_variable.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
initialize_variable.hpp File Reference
+
+
+
#include <vector>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/agrad/rev/var.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + + + +

+Functions

void stan::agrad::initialize_variable (var &variable, const var &value)
 Initialize variable to value.
 
template<int R, int C>
void stan::agrad::initialize_variable (Eigen::Matrix< var, R, C > &matrix, const var &value)
 Initialize every cell in the matrix to the specified value.
 
template<typename T >
void stan::agrad::initialize_variable (std::vector< T > &variables, const var &value)
 Initialize the variables in the standard vector recursively.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/initialize__variable_8hpp_source.html b/doc/api/html/initialize__variable_8hpp_source.html new file mode 100644 index 00000000000..b1c740ed59c --- /dev/null +++ b/doc/api/html/initialize__variable_8hpp_source.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/initialize_variable.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
initialize_variable.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__INITIALIZE_VARIABLE_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__INITIALIZE_VARIABLE_HPP__
+
3 
+
4 #include <vector>
+ +
6 #include <stan/agrad/rev/var.hpp>
+
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
15  inline void initialize_variable(var& variable, const var& value) {
+
16  variable = value;
+
17  }
+
18 
+
23  template <int R, int C>
+
24  inline void initialize_variable(Eigen::Matrix<var,R,C>& matrix, const var& value) {
+
25  for (int i = 0; i < matrix.size(); ++i)
+
26  matrix(i) = value;
+
27  }
+
28 
+
32  template <typename T>
+
33  inline void initialize_variable(std::vector<T>& variables, const var& value) {
+
34  for (size_t i = 0; i < variables.size(); ++i)
+
35  initialize_variable(variables[i],value);
+
36  }
+
37 
+
38  }
+
39 }
+
40 
+
41 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/int__step_8hpp.html b/doc/api/html/int__step_8hpp.html new file mode 100644 index 00000000000..a3379a59244 --- /dev/null +++ b/doc/api/html/int__step_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/functions/int_step.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
int_step.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
unsigned int stan::math::int_step (const T y)
 The integer step, or Heaviside, function.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/int__step_8hpp_source.html b/doc/api/html/int__step_8hpp_source.html new file mode 100644 index 00000000000..83f02e5f8a1 --- /dev/null +++ b/doc/api/html/int__step_8hpp_source.html @@ -0,0 +1,120 @@ + + + + + +Stan: src/stan/math/functions/int_step.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
int_step.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__INT_STEP_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__INT_STEP_HPP__
+
3 
+
4 namespace stan {
+
5  namespace math {
+
13  template <typename T>
+
14  unsigned int int_step(const T y) {
+
15  return y > 0;
+
16  }
+
17  }
+
18 }
+
19 
+
20 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/internal_8hpp.html b/doc/api/html/internal_8hpp.html new file mode 100644 index 00000000000..ae3aa98befa --- /dev/null +++ b/doc/api/html/internal_8hpp.html @@ -0,0 +1,123 @@ + + + + + +Stan: src/stan/agrad/rev/internal.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
internal.hpp File Reference
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/internal_8hpp_source.html b/doc/api/html/internal_8hpp_source.html new file mode 100644 index 00000000000..cc9906dee6f --- /dev/null +++ b/doc/api/html/internal_8hpp_source.html @@ -0,0 +1,126 @@ + + + + + +Stan: src/stan/agrad/rev/internal.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
internal.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__INTERNAL_HPP__
+
2 #define __STAN__AGRAD__REV__INTERNAL_HPP__
+
3 
+ + + + + + + + + + + + + + +
18 
+
19 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/internal__math_8hpp.html b/doc/api/html/internal__math_8hpp.html new file mode 100644 index 00000000000..64afce62cf3 --- /dev/null +++ b/doc/api/html/internal__math_8hpp.html @@ -0,0 +1,141 @@ + + + + + +Stan: src/stan/prob/internal_math.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
internal_math.hpp File Reference
+
+
+
#include <math.h>
+#include <boost/math/special_functions/gamma.hpp>
+#include <boost/math/special_functions/beta.hpp>
+#include <boost/math/special_functions/fpclassify.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + + + + + +

+Functions

double stan::math::F32 (double a, double b, double c, double d, double e, double z, double precision=1e-6)
 
void stan::math::gradF32 (double *g, double a, double b, double c, double d, double e, double z, double precision=1e-6)
 
void stan::math::grad2F1 (double &gradA, double &gradC, double a, double b, double c, double z, double precision=1e-6)
 
void stan::math::gradIncBeta (double &g1, double &g2, double a, double b, double z)
 
void stan::math::gradRegIncBeta (double &g1, double &g2, double a, double b, double z, double digammaA, double digammaB, double digammaSum, double betaAB)
 
double stan::math::gradRegIncGamma (double a, double z, double g, double dig, double precision=1e-6)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/internal__math_8hpp_source.html b/doc/api/html/internal__math_8hpp_source.html new file mode 100644 index 00000000000..00885f843f1 --- /dev/null +++ b/doc/api/html/internal__math_8hpp_source.html @@ -0,0 +1,314 @@ + + + + + +Stan: src/stan/prob/internal_math.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
internal_math.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__INTERNAL_MATH_HPP__
+
2 #define __STAN__PROB__INTERNAL_MATH_HPP__
+
3 
+
4 #include <math.h>
+
5 #include <boost/math/special_functions/gamma.hpp>
+
6 #include <boost/math/special_functions/beta.hpp>
+
7 #include <boost/math/special_functions/fpclassify.hpp>
+
8 
+
9 namespace stan {
+
10 
+
11  namespace math {
+
12 
+
13 
+
14  double F32(double a, double b, double c, double d, double e, double z, double precision = 1e-6)
+
15  {
+
16 
+
17  double F = 1;
+
18 
+
19  double tNew = 0;
+
20 
+
21  double logT = 0;
+
22 
+
23  double logZ = std::log(z);
+
24 
+
25  int k = 0;
+
26 
+
27  while( (fabs(tNew) > precision) || (k == 0) )
+
28  {
+
29 
+
30  double p = (a + k) * (b + k) * (c + k) / ( (d + k) * (e + k) * (k + 1) );
+
31 
+
32  // If a, b, or c is a negative integer then the series terminates
+
33  // after a finite number of interations
+
34  if(p == 0) break;
+
35 
+
36  logT += (p > 0 ? 1 : -1) * std::log(fabs(p)) + logZ;
+
37 
+
38  tNew = std::exp(logT);
+
39 
+
40  F += tNew;
+
41 
+
42  ++k;
+
43 
+
44  }
+
45 
+
46  return F;
+
47 
+
48  }
+
49 
+
50  void gradF32(double* g, double a, double b, double c, double d, double e, double z, double precision = 1e-6)
+
51  {
+
52 
+
53  double gOld[6];
+
54 
+
55  for(double *p = g; p != g + 6; ++p) *p = 0;
+
56  for(double *p = gOld; p != gOld + 6; ++p) *p = 0;
+
57 
+
58  double tOld = 1;
+
59  double tNew = 0;
+
60 
+
61  double logT = 0;
+
62 
+
63  double logZ = std::log(z);
+
64 
+
65  int k = 0;
+
66 
+
67  while( (fabs(tNew) > precision) || (k == 0) )
+
68  {
+
69 
+
70  double C = (a + k) / (d + k);
+
71  C *= (b + k) / (e + k);
+
72  C *= (c + k) / (1 + k);
+
73 
+
74  // If a, b, or c is a negative integer then the series terminates
+
75  // after a finite number of interations
+
76  if(C == 0) break;
+
77 
+
78  logT += (C > 0 ? 1 : -1) * std::log(fabs(C)) + logZ;
+
79 
+
80  tNew = std::exp(logT);
+
81 
+
82  gOld[0] = tNew * (gOld[0] / tOld + 1.0 / (a + k) );
+
83  gOld[1] = tNew * (gOld[1] / tOld + 1.0 / (b + k) );
+
84  gOld[2] = tNew * (gOld[2] / tOld + 1.0 / (c + k) );
+
85 
+
86  gOld[3] = tNew * (gOld[3] / tOld - 1.0 / (d + k) );
+
87  gOld[4] = tNew * (gOld[4] / tOld - 1.0 / (e + k) );
+
88 
+
89  gOld[5] = tNew * ( gOld[5] / tOld + 1.0 / z );
+
90 
+
91  for(int i = 0; i < 6; ++i) g[i] += gOld[i];
+
92 
+
93  tOld = tNew;
+
94 
+
95  ++k;
+
96 
+
97  }
+
98 
+
99  }
+
100 
+
101  // Gradient of the hypergeometric function 2F1(a, b | c | z) with respect to a and c
+
102  void grad2F1(double& gradA, double& gradC, double a, double b, double c, double z, double precision = 1e-6)
+
103  {
+
104 
+
105  gradA = 0;
+
106  gradC = 0;
+
107 
+
108  double gradAold = 0;
+
109  double gradCold = 0;
+
110 
+
111  int k = 0;
+
112  double tDak = 1.0 / (a - 1);
+
113 
+
114  while( (fabs(tDak * (a + (k - 1)) ) > precision) || (k == 0) )
+
115  {
+
116 
+
117  const double r = ( (a + k) / (c + k) ) * ( (b + k) / (double)(k + 1) ) * z;
+
118  tDak = r * tDak * (a + (k - 1)) / (a + k);
+
119 
+
120  if(r == 0) break;
+
121 
+
122  gradAold = r * gradAold + tDak;
+
123  gradCold = r * gradCold - tDak * ((a + k) / (c + k));
+
124 
+
125  gradA += gradAold;
+
126  gradC += gradCold;
+
127 
+
128  ++k;
+
129 
+
130  if(k > 200) break;
+
131 
+
132  }
+
133 
+
134  }
+
135 
+
136  // Gradient of the incomplete beta function beta(a, b, z)
+
137  // with respect to the first two arguments, using the
+
138  // equivalence to a hypergeometric function.
+
139  // See http://dlmf.nist.gov/8.17#ii
+
140  void gradIncBeta(double& g1, double& g2, double a, double b, double z)
+
141  {
+
142 
+
143  double c1 = std::log(z);
+
144  double c2 = std::log(1 - z);
+
145  double c3 = boost::math::beta(a, b, z);
+
146 
+
147  double C = std::exp( a * c1 + b * c2 ) / a;
+
148 
+
149  double dF1 = 0;
+
150  double dF2 = 0;
+
151 
+
152  if(C) grad2F1(dF1, dF2, a + b, 1, a + 1, z);
+
153 
+
154 
+
155  g1 = (c1 - 1.0 / a) * c3 + C * (dF1 + dF2);
+
156  g2 = c2 * c3 + C * dF1;
+
157 
+
158  }
+
159 
+
160  // Gradient of the regularized incomplete beta function ibeta(a, b, z)
+
161  void gradRegIncBeta(double& g1, double& g2, double a, double b, double z,
+
162  double digammaA, double digammaB, double digammaSum, double betaAB)
+
163  {
+
164 
+
165  double dBda = 0;
+
166  double dBdb = 0;
+
167 
+
168  gradIncBeta(dBda, dBdb, a, b, z);
+
169 
+
170  double b1 = boost::math::beta(a, b, z);
+
171 
+
172  g1 = ( dBda - b1 * (digammaA - digammaSum) ) / betaAB;
+
173  g2 = ( dBdb - b1 * (digammaB - digammaSum) ) / betaAB;
+
174 
+
175  }
+
176 
+
177  // Gradient of the regularized incomplete gamma functions igamma(a, g)
+
178  // Precomputed values
+
179  // g = boost::math::tgamma(a)
+
180  // dig = boost::math::digamma(a)
+
181  double gradRegIncGamma(double a, double z, double g, double dig,
+
182  double precision = 1e-6) {
+
183  using boost::math::gamma_p;
+
184 
+
185  double S = 0;
+
186  double s = 1;
+
187  double l = std::log(z);
+
188 
+
189  int k = 0;
+
190  double delta = s / (a * a);
+
191 
+
192  while (fabs(delta) > precision) {
+
193  S += delta;
+
194  ++k;
+
195  s *= - z / k;
+
196  delta = s / ((k + a) * (k + a));
+
197  if (boost::math::isinf(delta))
+
198  throw std::domain_error("stan::math::gradRegIncGamma not converging");
+
199  }
+
200  return gamma_p(a, z) * ( dig - l ) + std::exp( a * l ) * S / g;
+
201  }
+
202 
+
203  }
+
204 
+
205 }
+
206 
+
207 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/inv__chi__square_8hpp.html b/doc/api/html/inv__chi__square_8hpp.html new file mode 100644 index 00000000000..c157d69402f --- /dev/null +++ b/doc/api/html/inv__chi__square_8hpp.html @@ -0,0 +1,155 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/inv_chi_square.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
inv_chi_square.hpp File Reference
+
+
+
#include <boost/random/chi_squared_distribution.hpp>
+#include <boost/random/variate_generator.hpp>
+#include <stan/agrad/partials_vari.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/math/constants.hpp>
+#include <stan/math/functions/multiply_log.hpp>
+#include <stan/math/functions/value_of.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/prob/constants.hpp>
+#include <stan/prob/traits.hpp>
+#include <stan/prob/internal_math.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + + + + + + + +

+Functions

template<bool propto, typename T_y , typename T_dof >
return_type< T_y, T_dof >::type stan::prob::inv_chi_square_log (const T_y &y, const T_dof &nu)
 The log of an inverse chi-squared density for y with the specified degrees of freedom parameter.
 
template<typename T_y , typename T_dof >
return_type< T_y, T_dof >::type stan::prob::inv_chi_square_log (const T_y &y, const T_dof &nu)
 
template<typename T_y , typename T_dof >
return_type< T_y, T_dof >::type stan::prob::inv_chi_square_cdf (const T_y &y, const T_dof &nu)
 
template<typename T_y , typename T_dof >
return_type< T_y, T_dof >::type stan::prob::inv_chi_square_cdf_log (const T_y &y, const T_dof &nu)
 
template<typename T_y , typename T_dof >
return_type< T_y, T_dof >::type stan::prob::inv_chi_square_ccdf_log (const T_y &y, const T_dof &nu)
 
template<class RNG >
double stan::prob::inv_chi_square_rng (const double nu, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/inv__chi__square_8hpp_source.html b/doc/api/html/inv__chi__square_8hpp_source.html new file mode 100644 index 00000000000..27b8b1ba68c --- /dev/null +++ b/doc/api/html/inv__chi__square_8hpp_source.html @@ -0,0 +1,563 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/inv_chi_square.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
inv_chi_square.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DIST__UNI__CONTINUOUS__INV_CHI_SQUARE_HPP__
+
2 #define __STAN__PROB__DIST__UNI__CONTINUOUS__INV_CHI_SQUARE_HPP__
+
3 
+
4 #include <boost/random/chi_squared_distribution.hpp>
+
5 #include <boost/random/variate_generator.hpp>
+
6 
+ + + + + +
12 #include <stan/meta/traits.hpp>
+
13 #include <stan/prob/constants.hpp>
+
14 #include <stan/prob/traits.hpp>
+ +
16 
+
17 namespace stan {
+
18 
+
19  namespace prob {
+
20 
+
40  template <bool propto,
+
41  typename T_y, typename T_dof>
+
42  typename return_type<T_y,T_dof>::type
+
43  inv_chi_square_log(const T_y& y, const T_dof& nu) {
+
44  static const char* function = "stan::prob::inv_chi_square_log(%1%)";
+
45 
+
46  // check if any vectors are zero length
+
47  if (!(stan::length(y)
+
48  && stan::length(nu)))
+
49  return 0.0;
+
50 
+ + + + + +
56 
+
57  double logp(0.0);
+
58  if (!check_finite(function, nu, "Degrees of freedom parameter", &logp))
+
59  return logp;
+
60  if (!check_positive(function, nu, "Degrees of freedom parameter", &logp))
+
61  return logp;
+
62  if (!check_not_nan(function, y, "Random variable", &logp))
+
63  return logp;
+
64  if (!(check_consistent_sizes(function,
+
65  y,nu,
+
66  "Random variable","Degrees of freedom parameter",
+
67  &logp)))
+
68  return logp;
+
69 
+
70 
+
71  // set up template expressions wrapping scalars into vector views
+
72  VectorView<const T_y> y_vec(y);
+
73  VectorView<const T_dof> nu_vec(nu);
+
74  size_t N = max_size(y, nu);
+
75 
+
76  for (size_t n = 0; n < length(y); n++)
+
77  if (value_of(y_vec[n]) <= 0)
+
78  return LOG_ZERO;
+
79 
+ +
81  using boost::math::lgamma;
+ +
83 
+ +
85  is_vector<T_y>::value> log_y(length(y));
+
86  for (size_t i = 0; i < length(y); i++)
+ +
88  log_y[i] = log(value_of(y_vec[i]));
+
89 
+ +
91  is_vector<T_y>::value> inv_y(length(y));
+
92  for (size_t i = 0; i < length(y); i++)
+ +
94  inv_y[i] = 1.0 / value_of(y_vec[i]);
+
95 
+ +
97  is_vector<T_dof>::value> lgamma_half_nu(length(nu));
+ +
99  is_vector<T_dof>::value> digamma_half_nu_over_two(length(nu));
+
100  for (size_t i = 0; i < length(nu); i++) {
+
101  double half_nu = 0.5 * value_of(nu_vec[i]);
+ +
103  lgamma_half_nu[i] = lgamma(half_nu);
+ +
105  digamma_half_nu_over_two[i] = digamma(half_nu) * 0.5;
+
106  }
+
107 
+
108  agrad::OperandsAndPartials<T_y, T_dof> operands_and_partials(y, nu);
+
109  for (size_t n = 0; n < N; n++) {
+
110  const double nu_dbl = value_of(nu_vec[n]);
+
111  const double half_nu = 0.5 * nu_dbl;
+
112 
+ +
114  logp += nu_dbl * NEG_LOG_TWO_OVER_TWO - lgamma_half_nu[n];
+ +
116  logp -= (half_nu+1.0) * log_y[n];
+ +
118  logp -= 0.5 * inv_y[n];
+
119 
+ +
121  operands_and_partials.d_x1[n]
+
122  += -(half_nu+1.0) * inv_y[n] + 0.5 * inv_y[n] * inv_y[n];
+
123  }
+ +
125  operands_and_partials.d_x2[n]
+
126  += NEG_LOG_TWO_OVER_TWO - digamma_half_nu_over_two[n]
+
127  - 0.5*log_y[n];
+
128  }
+
129  }
+
130  return operands_and_partials.to_var(logp);
+
131  }
+
132 
+
133  template <typename T_y, typename T_dof>
+
134  inline
+ +
136  inv_chi_square_log(const T_y& y, const T_dof& nu) {
+
137  return inv_chi_square_log<false>(y,nu);
+
138  }
+
139 
+
140  template <typename T_y, typename T_dof>
+ +
142  inv_chi_square_cdf(const T_y& y, const T_dof& nu) {
+
143 
+
144  // Size checks
+
145  if ( !( stan::length(y) && stan::length(nu) ) ) return 1.0;
+
146 
+
147  // Error checks
+
148  static const char* function = "stan::prob::inv_chi_square_cdf(%1%)";
+
149 
+ + + + + +
155  using boost::math::tools::promote_args;
+
156  using stan::math::value_of;
+
157 
+
158  double P(1.0);
+
159 
+
160  if (!check_finite(function, nu, "Degrees of freedom parameter", &P))
+
161  return P;
+
162  if (!check_positive(function, nu, "Degrees of freedom parameter", &P))
+
163  return P;
+
164  if (!check_not_nan(function, y, "Random variable", &P))
+
165  return P;
+
166  if (!check_nonnegative(function, y, "Random variable", &P))
+
167  return P;
+
168  if (!(check_consistent_sizes(function, y, nu,
+
169  "Random variable",
+
170  "Degrees of freedom parameter",
+
171  &P)))
+
172  return P;
+
173 
+
174  // Wrap arguments in vectors
+
175  VectorView<const T_y> y_vec(y);
+
176  VectorView<const T_dof> nu_vec(nu);
+
177  size_t N = max_size(y, nu);
+
178 
+
179  agrad::OperandsAndPartials<T_y, T_dof> operands_and_partials(y, nu);
+
180 
+
181  // Explicit return for extreme values
+
182  // The gradients are technically ill-defined, but treated as zero
+
183 
+
184  for (size_t i = 0; i < stan::length(y); i++)
+
185  if (value_of(y_vec[i]) == 0)
+
186  return operands_and_partials.to_var(0.0);
+
187 
+
188  // Compute CDF and its gradients
+
189  using boost::math::gamma_p_derivative;
+
190  using boost::math::gamma_q;
+
191  using boost::math::tgamma;
+
192  using boost::math::digamma;
+
193 
+
194  // Cache a few expensive function calls if nu is a parameter
+ +
196  is_vector<T_dof>::value> gamma_vec(stan::length(nu));
+ +
198  is_vector<T_dof>::value> digamma_vec(stan::length(nu));
+
199 
+ +
201  for (size_t i = 0; i < stan::length(nu); i++) {
+
202  const double nu_dbl = value_of(nu_vec[i]);
+
203  gamma_vec[i] = tgamma(0.5 * nu_dbl);
+
204  digamma_vec[i] = digamma(0.5 * nu_dbl);
+
205  }
+
206  }
+
207 
+
208  // Compute vectorized CDF and gradient
+
209  for (size_t n = 0; n < N; n++) {
+
210 
+
211  // Explicit results for extreme values
+
212  // The gradients are technically ill-defined, but treated as zero
+
213  if (value_of(y_vec[n]) == std::numeric_limits<double>::infinity()) {
+
214  continue;
+
215  }
+
216 
+
217  // Pull out values
+
218  const double y_dbl = value_of(y_vec[n]);
+
219  const double y_inv_dbl = 1.0 / y_dbl;
+
220  const double nu_dbl = value_of(nu_vec[n]);
+
221 
+
222  // Compute
+
223  const double Pn = gamma_q(0.5 * nu_dbl, 0.5 * y_inv_dbl);
+
224 
+
225  P *= Pn;
+
226 
+ +
228  operands_and_partials.d_x1[n]
+
229  += 0.5 * y_inv_dbl * y_inv_dbl
+
230  * gamma_p_derivative(0.5 * nu_dbl, 0.5 * y_inv_dbl) / Pn;
+ +
232  operands_and_partials.d_x2[n]
+
233  += 0.5 * stan::math::gradRegIncGamma(0.5 * nu_dbl,
+
234  0.5 * y_inv_dbl,
+
235  gamma_vec[n],
+
236  digamma_vec[n]) / Pn;
+
237  }
+
238 
+ +
240  for (size_t n = 0; n < stan::length(y); ++n)
+
241  operands_and_partials.d_x1[n] *= P;
+ +
243  for (size_t n = 0; n < stan::length(nu); ++n)
+
244  operands_and_partials.d_x2[n] *= P;
+
245 
+
246  return operands_and_partials.to_var(P);
+
247  }
+
248 
+
249  template <typename T_y, typename T_dof>
+ +
251  inv_chi_square_cdf_log(const T_y& y, const T_dof& nu) {
+
252 
+
253  // Size checks
+
254  if ( !( stan::length(y) && stan::length(nu) ) ) return 0.0;
+
255 
+
256  // Error checks
+
257  static const char* function = "stan::prob::inv_chi_square_cdf_log(%1%)";
+
258 
+ + + + + +
264  using boost::math::tools::promote_args;
+
265  using stan::math::value_of;
+
266 
+
267  double P(0.0);
+
268 
+
269  if (!check_finite(function, nu, "Degrees of freedom parameter", &P))
+
270  return P;
+
271  if (!check_positive(function, nu, "Degrees of freedom parameter", &P))
+
272  return P;
+
273  if (!check_not_nan(function, y, "Random variable", &P))
+
274  return P;
+
275  if (!check_nonnegative(function, y, "Random variable", &P))
+
276  return P;
+
277  if (!(check_consistent_sizes(function, y, nu,
+
278  "Random variable",
+
279  "Degrees of freedom parameter", &P)))
+
280  return P;
+
281 
+
282  // Wrap arguments in vectors
+
283  VectorView<const T_y> y_vec(y);
+
284  VectorView<const T_dof> nu_vec(nu);
+
285  size_t N = max_size(y, nu);
+
286 
+
287  agrad::OperandsAndPartials<T_y, T_dof> operands_and_partials(y, nu);
+
288 
+
289  // Explicit return for extreme values
+
290  // The gradients are technically ill-defined, but treated as zero
+
291 
+
292  for (size_t i = 0; i < stan::length(y); i++)
+
293  if (value_of(y_vec[i]) == 0)
+
294  return operands_and_partials.to_var(stan::math::negative_infinity());
+
295 
+
296  // Compute cdf_log and its gradients
+
297  using boost::math::gamma_p_derivative;
+
298  using boost::math::gamma_q;
+
299  using boost::math::tgamma;
+
300  using boost::math::digamma;
+
301 
+
302  // Cache a few expensive function calls if nu is a parameter
+ +
304  is_vector<T_dof>::value> gamma_vec(stan::length(nu));
+ +
306  is_vector<T_dof>::value> digamma_vec(stan::length(nu));
+
307 
+ +
309  for (size_t i = 0; i < stan::length(nu); i++) {
+
310  const double nu_dbl = value_of(nu_vec[i]);
+
311  gamma_vec[i] = tgamma(0.5 * nu_dbl);
+
312  digamma_vec[i] = digamma(0.5 * nu_dbl);
+
313  }
+
314  }
+
315 
+
316  // Compute vectorized cdf_log and gradient
+
317  for (size_t n = 0; n < N; n++) {
+
318 
+
319  // Explicit results for extreme values
+
320  // The gradients are technically ill-defined, but treated as zero
+
321  if (value_of(y_vec[n]) == std::numeric_limits<double>::infinity()) {
+
322  continue;
+
323  }
+
324 
+
325  // Pull out values
+
326  const double y_dbl = value_of(y_vec[n]);
+
327  const double y_inv_dbl = 1.0 / y_dbl;
+
328  const double nu_dbl = value_of(nu_vec[n]);
+
329 
+
330  // Compute
+
331  const double Pn = gamma_q(0.5 * nu_dbl, 0.5 * y_inv_dbl);
+
332 
+
333  P += log(Pn);
+
334 
+ +
336  operands_and_partials.d_x1[n] += 0.5 * y_inv_dbl * y_inv_dbl
+
337  * gamma_p_derivative(0.5 * nu_dbl, 0.5 * y_inv_dbl) / Pn;
+ +
339  operands_and_partials.d_x2[n]
+
340  += 0.5 * stan::math::gradRegIncGamma(0.5 * nu_dbl,
+
341  0.5 * y_inv_dbl,
+
342  gamma_vec[n],
+
343  digamma_vec[n]) / Pn;
+
344  }
+
345 
+
346  return operands_and_partials.to_var(P);
+
347  }
+
348 
+
349  template <typename T_y, typename T_dof>
+ +
351  inv_chi_square_ccdf_log(const T_y& y, const T_dof& nu) {
+
352 
+
353  // Size checks
+
354  if ( !( stan::length(y) && stan::length(nu) ) ) return 0.0;
+
355 
+
356  // Error checks
+
357  static const char* function = "stan::prob::inv_chi_square_ccdf_log(%1%)";
+
358 
+ + + + + +
364  using boost::math::tools::promote_args;
+
365  using stan::math::value_of;
+
366 
+
367  double P(0.0);
+
368 
+
369  if (!check_finite(function, nu, "Degrees of freedom parameter", &P))
+
370  return P;
+
371  if (!check_positive(function, nu, "Degrees of freedom parameter", &P))
+
372  return P;
+
373  if (!check_not_nan(function, y, "Random variable", &P))
+
374  return P;
+
375  if (!check_nonnegative(function, y, "Random variable", &P))
+
376  return P;
+
377  if (!(check_consistent_sizes(function, y, nu,
+
378  "Random variable",
+
379  "Degrees of freedom parameter", &P)))
+
380  return P;
+
381 
+
382  // Wrap arguments in vectors
+
383  VectorView<const T_y> y_vec(y);
+
384  VectorView<const T_dof> nu_vec(nu);
+
385  size_t N = max_size(y, nu);
+
386 
+
387  agrad::OperandsAndPartials<T_y, T_dof> operands_and_partials(y, nu);
+
388 
+
389  // Explicit return for extreme values
+
390  // The gradients are technically ill-defined, but treated as zero
+
391 
+
392  for (size_t i = 0; i < stan::length(y); i++)
+
393  if (value_of(y_vec[i]) == 0)
+
394  return operands_and_partials.to_var(0.0);
+
395 
+
396  // Compute ccdf_log and its gradients
+
397  using boost::math::gamma_p_derivative;
+
398  using boost::math::gamma_q;
+
399  using boost::math::tgamma;
+
400  using boost::math::digamma;
+
401 
+
402  // Cache a few expensive function calls if nu is a parameter
+ +
404  is_vector<T_dof>::value> gamma_vec(stan::length(nu));
+ +
406  is_vector<T_dof>::value> digamma_vec(stan::length(nu));
+
407 
+ +
409  for (size_t i = 0; i < stan::length(nu); i++) {
+
410  const double nu_dbl = value_of(nu_vec[i]);
+
411  gamma_vec[i] = tgamma(0.5 * nu_dbl);
+
412  digamma_vec[i] = digamma(0.5 * nu_dbl);
+
413  }
+
414  }
+
415 
+
416  // Compute vectorized ccdf_log and gradient
+
417  for (size_t n = 0; n < N; n++) {
+
418 
+
419  // Explicit results for extreme values
+
420  // The gradients are technically ill-defined, but treated as zero
+
421  if (value_of(y_vec[n]) == std::numeric_limits<double>::infinity()) {
+
422  return operands_and_partials.to_var(stan::math::negative_infinity());
+
423  }
+
424 
+
425  // Pull out values
+
426  const double y_dbl = value_of(y_vec[n]);
+
427  const double y_inv_dbl = 1.0 / y_dbl;
+
428  const double nu_dbl = value_of(nu_vec[n]);
+
429 
+
430  // Compute
+
431  const double Pn = 1.0 - gamma_q(0.5 * nu_dbl, 0.5 * y_inv_dbl);
+
432 
+
433  P += log(Pn);
+
434 
+ +
436  operands_and_partials.d_x1[n] -= 0.5 * y_inv_dbl * y_inv_dbl
+
437  * gamma_p_derivative(0.5 * nu_dbl, 0.5 * y_inv_dbl) / Pn;
+ +
439  operands_and_partials.d_x2[n]
+
440  -= 0.5 * stan::math::gradRegIncGamma(0.5 * nu_dbl,
+
441  0.5 * y_inv_dbl,
+
442  gamma_vec[n],
+
443  digamma_vec[n]) / Pn;
+
444  }
+
445 
+
446  return operands_and_partials.to_var(P);
+
447  }
+
448 
+
449  template <class RNG>
+
450  inline double
+
451  inv_chi_square_rng(const double nu,
+
452  RNG& rng) {
+
453  using boost::variate_generator;
+
454  using boost::random::chi_squared_distribution;
+
455 
+
456  static const char* function = "stan::prob::inv_chi_square_rng(%1%)";
+
457 
+ + +
460 
+
461  if (!check_finite(function, nu, "Degrees of freedom parameter"))
+
462  return 0;
+
463  if (!check_positive(function, nu, "Degrees of freedom parameter"))
+
464  return 0;
+
465 
+
466  variate_generator<RNG&, chi_squared_distribution<> >
+
467  chi_square_rng(rng, chi_squared_distribution<>(nu));
+
468  return 1 / chi_square_rng();
+
469  }
+
470 
+
471  }
+
472 }
+
473 
+
474 #endif
+
475 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/inv__gamma_8hpp.html b/doc/api/html/inv__gamma_8hpp.html new file mode 100644 index 00000000000..2eea079e051 --- /dev/null +++ b/doc/api/html/inv__gamma_8hpp.html @@ -0,0 +1,161 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/inv_gamma.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
inv_gamma.hpp File Reference
+
+
+
#include <boost/random/gamma_distribution.hpp>
+#include <boost/random/variate_generator.hpp>
+#include <stan/agrad/partials_vari.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/math/constants.hpp>
+#include <stan/math/functions/multiply_log.hpp>
+#include <stan/math/functions/value_of.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/prob/constants.hpp>
+#include <stan/prob/traits.hpp>
+#include <stan/prob/internal_math.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + + + + + + + + +

+Functions

template<bool propto, typename T_y , typename T_shape , typename T_scale >
return_type< T_y, T_shape,
+T_scale >::type 
stan::prob::inv_gamma_log (const T_y &y, const T_shape &alpha, const T_scale &beta)
 The log of an inverse gamma density for y with the specified shape and scale parameters.
 
template<typename T_y , typename T_shape , typename T_scale >
return_type< T_y, T_shape,
+T_scale >::type 
stan::prob::inv_gamma_log (const T_y &y, const T_shape &alpha, const T_scale &beta)
 
template<typename T_y , typename T_shape , typename T_scale >
return_type< T_y, T_shape,
+T_scale >::type 
stan::prob::inv_gamma_cdf (const T_y &y, const T_shape &alpha, const T_scale &beta)
 The CDF of an inverse gamma density for y with the specified shape and scale parameters.
 
template<typename T_y , typename T_shape , typename T_scale >
return_type< T_y, T_shape,
+T_scale >::type 
stan::prob::inv_gamma_cdf_log (const T_y &y, const T_shape &alpha, const T_scale &beta)
 
template<typename T_y , typename T_shape , typename T_scale >
return_type< T_y, T_shape,
+T_scale >::type 
stan::prob::inv_gamma_ccdf_log (const T_y &y, const T_shape &alpha, const T_scale &beta)
 
template<class RNG >
double stan::prob::inv_gamma_rng (const double alpha, const double beta, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/inv__gamma_8hpp_source.html b/doc/api/html/inv__gamma_8hpp_source.html new file mode 100644 index 00000000000..c45037f4307 --- /dev/null +++ b/doc/api/html/inv__gamma_8hpp_source.html @@ -0,0 +1,653 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/inv_gamma.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
inv_gamma.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS__INV_GAMMA_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS__INV_GAMMA_HPP__
+
3 
+
4 #include <boost/random/gamma_distribution.hpp>
+
5 #include <boost/random/variate_generator.hpp>
+
6 
+ + + + + +
12 #include <stan/meta/traits.hpp>
+
13 #include <stan/prob/constants.hpp>
+
14 #include <stan/prob/traits.hpp>
+ +
16 
+
17 namespace stan {
+
18 
+
19  namespace prob {
+
20 
+
37  template <bool propto,
+
38  typename T_y, typename T_shape, typename T_scale>
+
39  typename return_type<T_y,T_shape,T_scale>::type
+
40  inv_gamma_log(const T_y& y, const T_shape& alpha, const T_scale& beta) {
+
41  static const char* function = "stan::prob::inv_gamma_log(%1%)";
+
42 
+ + + + +
47  using boost::math::tools::promote_args;
+ + +
50 
+
51  // check if any vectors are zero length
+
52  if (!(stan::length(y)
+
53  && stan::length(alpha)
+
54  && stan::length(beta)))
+
55  return 0.0;
+
56 
+
57  // set up return value accumulator
+
58  double logp(0.0);
+
59 
+
60  if (!check_not_nan(function, y, "Random variable", &logp))
+
61  return logp;
+
62  if (!check_finite(function, alpha, "Shape parameter",
+
63  &logp))
+
64  return logp;
+
65  if (!check_positive(function, alpha, "Shape parameter",
+
66  &logp))
+
67  return logp;
+
68  if (!check_finite(function, beta, "Scale parameter",
+
69  &logp))
+
70  return logp;
+
71  if (!check_positive(function, beta, "Scale parameter",
+
72  &logp))
+
73  return logp;
+
74  if (!(check_consistent_sizes(function,
+
75  y,alpha,beta,
+
76  "Random variable","Shape parameter",
+
77  "Scale parameter",
+
78  &logp)))
+
79  return logp;
+
80 
+
81  // check if no variables are involved and prop-to
+ +
83  return 0.0;
+
84 
+
85  // set up template expressions wrapping scalars into vector views
+
86  VectorView<const T_y> y_vec(y);
+
87  VectorView<const T_shape> alpha_vec(alpha);
+
88  VectorView<const T_scale> beta_vec(beta);
+
89 
+
90  for (size_t n = 0; n < length(y); n++) {
+
91  const double y_dbl = value_of(y_vec[n]);
+
92  if (y_dbl <= 0)
+
93  return LOG_ZERO;
+
94  }
+
95 
+
96  size_t N = max_size(y, alpha, beta);
+ +
98  operands_and_partials(y, alpha, beta);
+
99 
+
100  using boost::math::lgamma;
+ +
102  using boost::math::digamma;
+
103 
+ + +
106  log_y(length(y));
+ + +
109  inv_y(length(y));
+
110  for(size_t n = 0; n < length(y); n++) {
+ +
112  if (value_of(y_vec[n]) > 0)
+
113  log_y[n] = log(value_of(y_vec[n]));
+ +
115  inv_y[n] = 1.0 / value_of(y_vec[n]);
+
116  }
+
117 
+ + +
120  lgamma_alpha(length(alpha));
+ + +
123  digamma_alpha(length(alpha));
+
124  for (size_t n = 0; n < length(alpha); n++) {
+ +
126  lgamma_alpha[n] = lgamma(value_of(alpha_vec[n]));
+ +
128  digamma_alpha[n] = digamma(value_of(alpha_vec[n]));
+
129  }
+
130 
+ + +
133  log_beta(length(beta));
+ +
135  for (size_t n = 0; n < length(beta); n++)
+
136  log_beta[n] = log(value_of(beta_vec[n]));
+
137 
+
138  for (size_t n = 0; n < N; n++) {
+
139  // pull out values of arguments
+
140  const double alpha_dbl = value_of(alpha_vec[n]);
+
141  const double beta_dbl = value_of(beta_vec[n]);
+
142 
+ +
144  logp -= lgamma_alpha[n];
+ +
146  logp += alpha_dbl * log_beta[n];
+ +
148  logp -= (alpha_dbl+1.0) * log_y[n];
+ +
150  logp -= beta_dbl * inv_y[n];
+
151 
+
152  // gradients
+
153  if (!is_constant<typename is_vector<T_y>::type>::value)
+
154  operands_and_partials.d_x1[n]
+
155  += -(alpha_dbl+1) * inv_y[n] + beta_dbl * inv_y[n] * inv_y[n];
+
156  if (!is_constant<typename is_vector<T_shape>::type>::value)
+
157  operands_and_partials.d_x2[n]
+
158  += -digamma_alpha[n] + log_beta[n] - log_y[n];
+
159  if (!is_constant<typename is_vector<T_scale>::type>::value)
+
160  operands_and_partials.d_x3[n] += alpha_dbl / beta_dbl - inv_y[n];
+
161  }
+
162  return operands_and_partials.to_var(logp);
+
163  }
+
164 
+
165  template <typename T_y, typename T_shape, typename T_scale>
+
166  inline
+ +
168  inv_gamma_log(const T_y& y, const T_shape& alpha, const T_scale& beta) {
+
169  return inv_gamma_log<false>(y,alpha,beta);
+
170  }
+
171 
+
188  template <typename T_y, typename T_shape, typename T_scale>
+ +
190  inv_gamma_cdf(const T_y& y, const T_shape& alpha, const T_scale& beta) {
+
191 
+
192  // Size checks
+
193  if (!(stan::length(y) && stan::length(alpha) && stan::length(beta)))
+
194  return 1.0;
+
195 
+
196  // Error checks
+
197  static const char* function = "stan::prob::inv_gamma_cdf(%1%)";
+
198 
+ + + + + + + +
206  using stan::math::value_of;
+
207  using boost::math::tools::promote_args;
+
208 
+
209  double P(1.0);
+
210 
+
211  if (!check_finite(function, alpha, "Shape parameter", &P))
+
212  return P;
+
213  if (!check_positive(function, alpha, "Shape parameter", &P))
+
214  return P;
+
215  if (!check_finite(function, beta, "Scale parameter", &P))
+
216  return P;
+
217  if (!check_positive(function, beta, "Scale parameter", &P))
+
218  return P;
+
219  if (!check_not_nan(function, y, "Random variable", &P))
+
220  return P;
+
221  if (!check_nonnegative(function, y, "Random variable", &P))
+
222  return P;
+
223  if (!(check_consistent_sizes(function, y, alpha, beta,
+
224  "Random variable", "Shape parameter",
+
225  "Scale Parameter",
+
226  &P)))
+
227  return P;
+
228 
+
229  // Wrap arguments in vectors
+
230  VectorView<const T_y> y_vec(y);
+
231  VectorView<const T_shape> alpha_vec(alpha);
+
232  VectorView<const T_scale> beta_vec(beta);
+
233  size_t N = max_size(y, alpha, beta);
+
234 
+ +
236  operands_and_partials(y, alpha, beta);
+
237 
+
238  // Explicit return for extreme values
+
239  // The gradients are technically ill-defined, but treated as zero
+
240 
+
241  for (size_t i = 0; i < stan::length(y); i++) {
+
242  if (value_of(y_vec[i]) == 0)
+
243  return operands_and_partials.to_var(0.0);
+
244  }
+
245 
+
246  // Compute CDF and its gradients
+
247  using boost::math::gamma_p_derivative;
+
248  using boost::math::gamma_q;
+
249  using boost::math::digamma;
+
250  using boost::math::tgamma;
+
251 
+
252  // Cache a few expensive function calls if nu is a parameter
+ + +
255  gamma_vec(stan::length(alpha));
+ + +
258  digamma_vec(stan::length(alpha));
+
259 
+ +
261  for (size_t i = 0; i < stan::length(alpha); i++) {
+
262  const double alpha_dbl = value_of(alpha_vec[i]);
+
263  gamma_vec[i] = tgamma(alpha_dbl);
+
264  digamma_vec[i] = digamma(alpha_dbl);
+
265  }
+
266  }
+
267 
+
268  // Compute vectorized CDF and gradient
+
269  for (size_t n = 0; n < N; n++) {
+
270  // Explicit results for extreme values
+
271  // The gradients are technically ill-defined, but treated as zero
+
272  if (value_of(y_vec[n]) == std::numeric_limits<double>::infinity())
+
273  continue;
+
274 
+
275  // Pull out values
+
276  const double y_dbl = value_of(y_vec[n]);
+
277  const double y_inv_dbl = 1.0 / y_dbl;
+
278  const double alpha_dbl = value_of(alpha_vec[n]);
+
279  const double beta_dbl = value_of(beta_vec[n]);
+
280 
+
281  // Compute
+
282  const double Pn = gamma_q(alpha_dbl, beta_dbl * y_inv_dbl);
+
283 
+
284  P *= Pn;
+
285 
+ +
287  operands_and_partials.d_x1[n]
+
288  += beta_dbl * y_inv_dbl * y_inv_dbl
+
289  * gamma_p_derivative(alpha_dbl, beta_dbl * y_inv_dbl)
+
290  / Pn;
+ +
292  operands_and_partials.d_x2[n]
+
293  += stan::math::gradRegIncGamma(alpha_dbl, beta_dbl
+
294  * y_inv_dbl, gamma_vec[n],
+
295  digamma_vec[n]) / Pn;
+ +
297  operands_and_partials.d_x3[n]
+
298  += - y_inv_dbl * gamma_p_derivative(alpha_dbl,
+
299  beta_dbl * y_inv_dbl) / Pn;
+
300  }
+
301 
+ +
303  for (size_t n = 0; n < stan::length(y); ++n)
+
304  operands_and_partials.d_x1[n] *= P;
+ +
306  for (size_t n = 0; n < stan::length(alpha); ++n)
+
307  operands_and_partials.d_x2[n] *= P;
+ +
309  for (size_t n = 0; n < stan::length(beta); ++n)
+
310  operands_and_partials.d_x3[n] *= P;
+
311 
+
312  return operands_and_partials.to_var(P);
+
313  }
+
314 
+
315  template <typename T_y, typename T_shape, typename T_scale>
+ +
317  inv_gamma_cdf_log(const T_y& y, const T_shape& alpha, const T_scale& beta) {
+
318 
+
319  // Size checks
+
320  if (!(stan::length(y) && stan::length(alpha) && stan::length(beta)))
+
321  return 0.0;
+
322 
+
323  // Error checks
+
324  static const char* function = "stan::prob::inv_gamma_cdf_log(%1%)";
+
325 
+ + + + + + + +
333  using stan::math::value_of;
+
334  using boost::math::tools::promote_args;
+
335 
+
336  double P(0.0);
+
337 
+
338  if (!check_finite(function, alpha, "Shape parameter", &P))
+
339  return P;
+
340  if (!check_positive(function, alpha, "Shape parameter", &P))
+
341  return P;
+
342  if (!check_finite(function, beta, "Scale parameter", &P))
+
343  return P;
+
344  if (!check_positive(function, beta, "Scale parameter", &P))
+
345  return P;
+
346  if (!check_not_nan(function, y, "Random variable", &P))
+
347  return P;
+
348  if (!check_nonnegative(function, y, "Random variable", &P))
+
349  return P;
+
350  if (!(check_consistent_sizes(function, y, alpha, beta,
+
351  "Random variable", "Shape parameter",
+
352  "Scale Parameter",
+
353  &P)))
+
354  return P;
+
355 
+
356  // Wrap arguments in vectors
+
357  VectorView<const T_y> y_vec(y);
+
358  VectorView<const T_shape> alpha_vec(alpha);
+
359  VectorView<const T_scale> beta_vec(beta);
+
360  size_t N = max_size(y, alpha, beta);
+
361 
+ +
363  operands_and_partials(y, alpha, beta);
+
364 
+
365  // Explicit return for extreme values
+
366  // The gradients are technically ill-defined, but treated as zero
+
367 
+
368  for (size_t i = 0; i < stan::length(y); i++) {
+
369  if (value_of(y_vec[i]) == 0)
+
370  return operands_and_partials.to_var(stan::math::negative_infinity());
+
371  }
+
372 
+
373  // Compute cdf_log and its gradients
+
374  using boost::math::gamma_p_derivative;
+
375  using boost::math::gamma_q;
+
376  using boost::math::digamma;
+
377  using boost::math::tgamma;
+
378 
+
379  // Cache a few expensive function calls if nu is a parameter
+ + +
382  gamma_vec(stan::length(alpha));
+ + +
385  digamma_vec(stan::length(alpha));
+
386 
+ +
388  for (size_t i = 0; i < stan::length(alpha); i++) {
+
389  const double alpha_dbl = value_of(alpha_vec[i]);
+
390  gamma_vec[i] = tgamma(alpha_dbl);
+
391  digamma_vec[i] = digamma(alpha_dbl);
+
392  }
+
393  }
+
394 
+
395  // Compute vectorized cdf_log and gradient
+
396  for (size_t n = 0; n < N; n++) {
+
397  // Explicit results for extreme values
+
398  // The gradients are technically ill-defined, but treated as zero
+
399  if (value_of(y_vec[n]) == std::numeric_limits<double>::infinity())
+
400  continue;
+
401 
+
402  // Pull out values
+
403  const double y_dbl = value_of(y_vec[n]);
+
404  const double y_inv_dbl = 1.0 / y_dbl;
+
405  const double alpha_dbl = value_of(alpha_vec[n]);
+
406  const double beta_dbl = value_of(beta_vec[n]);
+
407 
+
408  // Compute
+
409  const double Pn = gamma_q(alpha_dbl, beta_dbl * y_inv_dbl);
+
410 
+
411  P += log(Pn);
+
412 
+ +
414  operands_and_partials.d_x1[n]
+
415  += beta_dbl * y_inv_dbl * y_inv_dbl
+
416  * gamma_p_derivative(alpha_dbl, beta_dbl * y_inv_dbl)
+
417  / Pn;
+ +
419  operands_and_partials.d_x2[n]
+
420  += stan::math::gradRegIncGamma(alpha_dbl, beta_dbl
+
421  * y_inv_dbl, gamma_vec[n],
+
422  digamma_vec[n]) / Pn;
+ +
424  operands_and_partials.d_x3[n]
+
425  += - y_inv_dbl * gamma_p_derivative(alpha_dbl,
+
426  beta_dbl * y_inv_dbl) / Pn;
+
427  }
+
428 
+
429  return operands_and_partials.to_var(P);
+
430  }
+
431 
+
432  template <typename T_y, typename T_shape, typename T_scale>
+ +
434  inv_gamma_ccdf_log(const T_y& y, const T_shape& alpha, const T_scale& beta) {
+
435 
+
436  // Size checks
+
437  if (!(stan::length(y) && stan::length(alpha) && stan::length(beta)))
+
438  return 0.0;
+
439 
+
440  // Error checks
+
441  static const char* function = "stan::prob::inv_gamma_ccdf_log(%1%)";
+
442 
+ + + + + + + +
450  using stan::math::value_of;
+
451  using boost::math::tools::promote_args;
+
452 
+
453  double P(0.0);
+
454 
+
455  if (!check_finite(function, alpha, "Shape parameter", &P))
+
456  return P;
+
457  if (!check_positive(function, alpha, "Shape parameter", &P))
+
458  return P;
+
459  if (!check_finite(function, beta, "Scale parameter", &P))
+
460  return P;
+
461  if (!check_positive(function, beta, "Scale parameter", &P))
+
462  return P;
+
463  if (!check_not_nan(function, y, "Random variable", &P))
+
464  return P;
+
465  if (!check_nonnegative(function, y, "Random variable", &P))
+
466  return P;
+
467  if (!(check_consistent_sizes(function, y, alpha, beta,
+
468  "Random variable", "Shape parameter",
+
469  "Scale Parameter",
+
470  &P)))
+
471  return P;
+
472 
+
473  // Wrap arguments in vectors
+
474  VectorView<const T_y> y_vec(y);
+
475  VectorView<const T_shape> alpha_vec(alpha);
+
476  VectorView<const T_scale> beta_vec(beta);
+
477  size_t N = max_size(y, alpha, beta);
+
478 
+ +
480  operands_and_partials(y, alpha, beta);
+
481 
+
482  // Explicit return for extreme values
+
483  // The gradients are technically ill-defined, but treated as zero
+
484 
+
485  for (size_t i = 0; i < stan::length(y); i++) {
+
486  if (value_of(y_vec[i]) == 0)
+
487  return operands_and_partials.to_var(0.0);
+
488  }
+
489 
+
490  // Compute ccdf_log and its gradients
+
491  using boost::math::gamma_p_derivative;
+
492  using boost::math::gamma_q;
+
493  using boost::math::digamma;
+
494  using boost::math::tgamma;
+
495 
+
496  // Cache a few expensive function calls if nu is a parameter
+ + +
499  gamma_vec(stan::length(alpha));
+ + +
502  digamma_vec(stan::length(alpha));
+
503 
+ +
505  for (size_t i = 0; i < stan::length(alpha); i++) {
+
506  const double alpha_dbl = value_of(alpha_vec[i]);
+
507  gamma_vec[i] = tgamma(alpha_dbl);
+
508  digamma_vec[i] = digamma(alpha_dbl);
+
509  }
+
510  }
+
511 
+
512  // Compute vectorized ccdf_log and gradient
+
513  for (size_t n = 0; n < N; n++) {
+
514  // Explicit results for extreme values
+
515  // The gradients are technically ill-defined, but treated as zero
+
516  if (value_of(y_vec[n]) == std::numeric_limits<double>::infinity())
+
517  return operands_and_partials.to_var(stan::math::negative_infinity());
+
518 
+
519  // Pull out values
+
520  const double y_dbl = value_of(y_vec[n]);
+
521  const double y_inv_dbl = 1.0 / y_dbl;
+
522  const double alpha_dbl = value_of(alpha_vec[n]);
+
523  const double beta_dbl = value_of(beta_vec[n]);
+
524 
+
525  // Compute
+
526  const double Pn = 1.0 - gamma_q(alpha_dbl, beta_dbl * y_inv_dbl);
+
527 
+
528  P += log(Pn);
+
529 
+ +
531  operands_and_partials.d_x1[n]
+
532  -= beta_dbl * y_inv_dbl * y_inv_dbl
+
533  * gamma_p_derivative(alpha_dbl, beta_dbl * y_inv_dbl)
+
534  / Pn;
+ +
536  operands_and_partials.d_x2[n]
+
537  -= stan::math::gradRegIncGamma(alpha_dbl, beta_dbl
+
538  * y_inv_dbl, gamma_vec[n],
+
539  digamma_vec[n]) / Pn;
+ +
541  operands_and_partials.d_x3[n]
+
542  -= - y_inv_dbl * gamma_p_derivative(alpha_dbl,
+
543  beta_dbl * y_inv_dbl) / Pn;
+
544  }
+
545 
+
546  return operands_and_partials.to_var(P);
+
547  }
+
548 
+
549  template <class RNG>
+
550  inline double
+
551  inv_gamma_rng(const double alpha,
+
552  const double beta,
+
553  RNG& rng) {
+
554  using boost::variate_generator;
+
555  using boost::random::gamma_distribution;
+
556 
+
557  static const char* function = "stan::prob::inv_gamma_rng(%1%)";
+
558 
+ + +
561 
+
562  if (!check_finite(function, alpha, "Shape parameter"))
+
563  return 0;
+
564  if (!check_positive(function, alpha, "Shape parameter"))
+
565  return 0;
+
566  if (!check_finite(function, beta, "Scale parameter"))
+
567  return 0;
+
568  if (!check_positive(function, beta, "Scale parameter"))
+
569  return 0;
+
570 
+
571  variate_generator<RNG&, gamma_distribution<> >
+
572  gamma_rng(rng, gamma_distribution<>(alpha, 1 / beta));
+
573  return 1 / gamma_rng();
+
574  }
+
575  }
+
576 }
+
577 
+
578 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/inv__wishart_8hpp.html b/doc/api/html/inv__wishart_8hpp.html new file mode 100644 index 00000000000..2f6f6843aeb --- /dev/null +++ b/doc/api/html/inv__wishart_8hpp.html @@ -0,0 +1,147 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/continuous/inv_wishart.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
inv_wishart.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + +

+Functions

template<bool propto, typename T_y , typename T_dof , typename T_scale >
boost::math::tools::promote_args
+< T_y, T_dof, T_scale >::type 
stan::prob::inv_wishart_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &W, const T_dof &nu, const Eigen::Matrix< T_scale, Eigen::Dynamic, Eigen::Dynamic > &S)
 The log of the Inverse-Wishart density for the given W, degrees of freedom, and scale matrix.
 
template<typename T_y , typename T_dof , typename T_scale >
boost::math::tools::promote_args
+< T_y, T_dof, T_scale >::type 
stan::prob::inv_wishart_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &W, const T_dof &nu, const Eigen::Matrix< T_scale, Eigen::Dynamic, Eigen::Dynamic > &S)
 
template<class RNG >
Eigen::Matrix< double,
+Eigen::Dynamic, Eigen::Dynamic > 
stan::prob::inv_wishart_rng (const double nu, const Eigen::Matrix< double, Eigen::Dynamic, Eigen::Dynamic > &S, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/inv__wishart_8hpp_source.html b/doc/api/html/inv__wishart_8hpp_source.html new file mode 100644 index 00000000000..a2a5ca02872 --- /dev/null +++ b/doc/api/html/inv__wishart_8hpp_source.html @@ -0,0 +1,242 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/continuous/inv_wishart.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
inv_wishart.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__MULTIVARIATE__CONTINUOUS__INV_WISHART_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__MULTIVARIATE__CONTINUOUS__INV_WISHART_HPP__
+
3 
+ + + +
7 #include <stan/prob/traits.hpp>
+
8 #include <stan/meta/traits.hpp>
+
9 #include <stan/agrad/rev.hpp>
+ + + +
13 
+
14 namespace stan {
+
15  namespace prob {
+
16  // InvWishart(Sigma|n,Omega) [W, S symmetric, non-neg, definite;
+
17  // W.dims() = S.dims();
+
18  // n > S.rows() - 1]
+
46  template <bool propto,
+
47  typename T_y, typename T_dof, typename T_scale>
+
48  typename boost::math::tools::promote_args<T_y,T_dof,T_scale>::type
+
49  inv_wishart_log(const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& W,
+
50  const T_dof& nu,
+
51  const Eigen::Matrix<T_scale,Eigen::Dynamic,Eigen::Dynamic>& S) {
+
52  static const char* function = "stan::prob::inv_wishart_log(%1%)";
+
53 
+ + +
56  using boost::math::tools::promote_args;
+
57 
+ +
59  typename promote_args<T_y,T_dof,T_scale>::type lp(0.0);
+
60  if(!check_greater(function, nu, k-1, "Degrees of freedom parameter",
+
61  &lp))
+
62  return lp;
+
63  if (!check_size_match(function,
+
64  W.rows(), "Rows of random variable",
+
65  W.cols(), "columns of random variable",
+
66  &lp))
+
67  return lp;
+
68  if (!check_size_match(function,
+
69  S.rows(), "Rows of scale parameter",
+
70  S.cols(), "columns of scale parameter",
+
71  &lp))
+
72  return lp;
+
73  if (!check_size_match(function,
+
74  W.rows(), "Rows of random variable",
+
75  S.rows(), "columns of scale parameter",
+
76  &lp))
+
77  return lp;
+
78  // FIXME: domain checks
+
79 
+
80  using stan::math::lmgamma;
+ + +
83  using stan::math::trace;
+
84  using stan::math::LDLT_factor;
+
85 
+ +
87  if (!ldlt_W.success()) {
+
88  std::ostringstream message;
+
89  message << "W is not positive definite (%1%).";
+
90  std::string str(message.str());
+
91  stan::math::dom_err(function,W(0,0),"W",str.c_str(),"",&lp);
+
92  return lp;
+
93  }
+ +
95  if (!ldlt_S.success()) {
+
96  std::ostringstream message;
+
97  message << "S is not positive definite (%1%).";
+
98  std::string str(message.str());
+
99  stan::math::dom_err(function,S(0,0),"S",str.c_str(),"",&lp);
+
100  return lp;
+
101  }
+
102 
+ +
104  lp -= lmgamma(k, 0.5 * nu);
+ +
106  lp += 0.5 * nu * log_determinant_ldlt(ldlt_S);
+
107  }
+ +
109  lp -= 0.5 * (nu + k + 1.0) * log_determinant_ldlt(ldlt_W);
+
110  }
+ +
112 // L = crossprod(mdivide_left_tri_low(L));
+
113 // Eigen::Matrix<T_y,Eigen::Dynamic,1> W_inv_vec = Eigen::Map<
+
114 // const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic> >(
+
115 // &L(0), L.size(), 1);
+
116 // Eigen::Matrix<T_scale,Eigen::Dynamic,1> S_vec = Eigen::Map<
+
117 // const Eigen::Matrix<T_scale,Eigen::Dynamic,Eigen::Dynamic> >(
+
118 // &S(0), S.size(), 1);
+
119 // lp -= 0.5 * dot_product(S_vec, W_inv_vec); // trace(S * W^-1)
+
120  Eigen::Matrix<typename promote_args<T_y,T_scale>::type,Eigen::Dynamic,Eigen::Dynamic> Winv_S(mdivide_left_ldlt(ldlt_W,S));
+
121  lp -= 0.5*trace(Winv_S);
+
122  }
+ +
124  lp += nu * k * NEG_LOG_TWO_OVER_TWO;
+
125  return lp;
+
126  }
+
127 
+
128  template <typename T_y, typename T_dof, typename T_scale>
+
129  inline
+
130  typename boost::math::tools::promote_args<T_y,T_dof,T_scale>::type
+
131  inv_wishart_log(const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& W,
+
132  const T_dof& nu,
+
133  const Eigen::Matrix<T_scale,Eigen::Dynamic,Eigen::Dynamic>& S) {
+
134  return inv_wishart_log<false>(W,nu,S);
+
135  }
+
136 
+
137  template <class RNG>
+
138  inline Eigen::Matrix<double, Eigen::Dynamic, Eigen::Dynamic>
+
139  inv_wishart_rng(const double nu,
+
140  const Eigen::Matrix<double,Eigen::Dynamic,Eigen::Dynamic>& S,
+
141  RNG& rng) {
+
142 
+
143  static const char* function = "stan::prob::inv_wishart_rng(%1%)";
+
144 
+ + +
147 
+ +
149  check_greater(function, nu, k-1, "Degrees of freedom parameter");
+
150  check_size_match(function,
+
151  S.rows(), "Rows of scale parameter",
+
152  S.cols(), "columns of scale parameter");
+
153 
+
154  Eigen::Matrix<double,Eigen::Dynamic,Eigen::Dynamic> S_inv(S.rows(), S.cols());
+
155  S_inv = Eigen::MatrixXd::Identity(S.cols(),S.cols());
+
156  S_inv = S.ldlt().solve(S_inv);
+
157 
+
158  return wishart_rng(nu, S_inv, rng).inverse();
+
159  }
+
160  }
+
161 }
+
162 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/inverse__softmax_8hpp.html b/doc/api/html/inverse__softmax_8hpp.html new file mode 100644 index 00000000000..c022de1e769 --- /dev/null +++ b/doc/api/html/inverse__softmax_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/math/functions/inverse_softmax.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
inverse_softmax.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+#include <stdexcept>
+#include <boost/throw_exception.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename Vector >
void stan::math::inverse_softmax (const Vector &simplex, Vector &y)
 Writes the inverse softmax of the simplex argument into the second argument.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/inverse__softmax_8hpp_source.html b/doc/api/html/inverse__softmax_8hpp_source.html new file mode 100644 index 00000000000..5f7e6a53f2c --- /dev/null +++ b/doc/api/html/inverse__softmax_8hpp_source.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/functions/inverse_softmax.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
inverse_softmax.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__INVERSE_SOFTMAX_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__INVERSE_SOFTMAX_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+
5 #include <stdexcept>
+
6 #include <boost/throw_exception.hpp>
+
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
33  template <typename Vector>
+
34  void inverse_softmax(const Vector& simplex, Vector& y) {
+
35  using std::log;
+
36  if(simplex.size() != y.size())
+
37  BOOST_THROW_EXCEPTION(std::invalid_argument ("simplex.size() != y.size()"));
+
38  for (size_t i = 0; i < simplex.size(); ++i)
+
39  y[i] = log(simplex[i]);
+
40  }
+
41 
+
42  }
+
43 }
+
44 
+
45 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/inverse__spd_8hpp.html b/doc/api/html/inverse__spd_8hpp.html new file mode 100644 index 00000000000..931359a51dc --- /dev/null +++ b/doc/api/html/inverse__spd_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/matrix/inverse_spd.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
inverse_spd.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
stan::math::inverse_spd (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &m)
 Returns the inverse of the specified symmetric, pos/neg-definite matrix.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/inverse__spd_8hpp_source.html b/doc/api/html/inverse__spd_8hpp_source.html new file mode 100644 index 00000000000..b64a4d2528d --- /dev/null +++ b/doc/api/html/inverse__spd_8hpp_source.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/math/matrix/inverse_spd.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
inverse_spd.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__INVERSE_SPD_HPP__
+
2 #define __STAN__MATH__MATRIX__INVERSE_SPD_HPP__
+
3 
+ + + +
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
16  template <typename T>
+
17  inline
+
18  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>
+
19  inverse_spd(const Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& m) {
+
20  validate_square(m,"inverse_spd");
+
21  validate_symmetric(m,"inverse_spd");
+
22  Eigen::LDLT< Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> > ldlt(0.5*(m+m.transpose()));
+
23  if (ldlt.info() != Eigen::Success)
+
24  throw std::domain_error("Error in inverse_spd, LDLT factorization failed");
+
25  if (!ldlt.isPositive() || (ldlt.vectorD().array() <= 0).any())
+
26  throw std::domain_error("Error in inverse_spd, matrix not positive definite");
+
27  return ldlt.solve(Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>::Identity(m.rows(),m.cols()));
+
28  }
+
29 
+
30  }
+
31 }
+
32 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/io_2util_8hpp.html b/doc/api/html/io_2util_8hpp.html new file mode 100644 index 00000000000..6be3b7d421d --- /dev/null +++ b/doc/api/html/io_2util_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/io/util.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
util.hpp File Reference
+
+
+
#include <string>
+#include <ctime>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::io
 Input/output utilities.
 
+ + + + +

+Functions

std::string stan::io::utc_time_string ()
 Return the current coordinated universal time (UTC) as a string.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/io_2util_8hpp_source.html b/doc/api/html/io_2util_8hpp_source.html new file mode 100644 index 00000000000..d6632ed7923 --- /dev/null +++ b/doc/api/html/io_2util_8hpp_source.html @@ -0,0 +1,140 @@ + + + + + +Stan: src/stan/io/util.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
util.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__IO__UTIL_HPP__
+
2 #define __STAN__IO__UTIL_HPP__
+
3 
+
4 #include <string>
+
5 #include <ctime>
+
6 
+
7 namespace stan {
+
8 
+
9  namespace io {
+
10 
+
18  std::string utc_time_string() {
+
19  // FIXME: use std::strftime
+
20 
+
21  // original with asctime
+
22  // std::time_t rawtime = time(0);
+
23  // std::tm *time = gmtime(&rawtime);
+
24  // return std::string(asctime(time));
+
25 
+
26  // new with strfitime
+
27  time_t rawtime;
+
28  std::time(&rawtime);
+
29 
+
30  char cbuf[80];
+
31  std::strftime(cbuf,80,"%a %b %d %Y %H:%M:%S",
+
32  std::localtime(&rawtime));
+
33 
+
34  return std::string(cbuf);
+
35  }
+
36 
+
37  }
+
38 }
+
39 
+
40 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/io_8hpp.html b/doc/api/html/io_8hpp.html new file mode 100644 index 00000000000..bdbc746f3e0 --- /dev/null +++ b/doc/api/html/io_8hpp.html @@ -0,0 +1,115 @@ + + + + + +Stan: src/stan/io.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
io.hpp File Reference
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/io_8hpp_source.html b/doc/api/html/io_8hpp_source.html new file mode 100644 index 00000000000..ca2eb8066a0 --- /dev/null +++ b/doc/api/html/io_8hpp_source.html @@ -0,0 +1,118 @@ + + + + + +Stan: src/stan/io.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
io.hpp
+
+
+Go to the documentation of this file.
1 #ifndef STAN_IO_HPP
+
2 #define STAN_IO_HPP
+
3 
+
4 #include "stan/io/cmd_line.hpp"
+
5 #include "stan/io/csv_writer.hpp"
+
6 #include "stan/io/dump.hpp"
+
7 #include "stan/io/reader.hpp"
+ +
9 #include "stan/io/writer.hpp"
+
10 
+
11 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/iterator__typedefs_8hpp.html b/doc/api/html/iterator__typedefs_8hpp.html new file mode 100644 index 00000000000..9cc41e5c2ba --- /dev/null +++ b/doc/api/html/iterator__typedefs_8hpp.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/gm/grammars/iterator_typedefs.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
iterator_typedefs.hpp File Reference
+
+
+
#include <boost/spirit/include/support_multi_pass.hpp>
+#include <boost/spirit/include/classic_position_iterator.hpp>
+#include <iterator>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+ + + + + + + +

+Typedefs

typedef
+std::istreambuf_iterator< char > 
stan::gm::base_iterator_t
 
typedef
+boost::spirit::multi_pass
+< base_iterator_t > 
stan::gm::forward_iterator_t
 
typedef
+boost::spirit::classic::position_iterator2
+< forward_iterator_t > 
stan::gm::pos_iterator_t
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/iterator__typedefs_8hpp_source.html b/doc/api/html/iterator__typedefs_8hpp_source.html new file mode 100644 index 00000000000..ee07409b4d6 --- /dev/null +++ b/doc/api/html/iterator__typedefs_8hpp_source.html @@ -0,0 +1,122 @@ + + + + + +Stan: src/stan/gm/grammars/iterator_typedefs.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
iterator_typedefs.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__PARSER__PARSER__ITERATOR_TYPEDEFS__HPP__
+
2 #define __STAN__GM__PARSER__PARSER__ITERATOR_TYPEDEFS__HPP__
+
3 
+
4 #include <boost/spirit/include/support_multi_pass.hpp>
+
5 #include <boost/spirit/include/classic_position_iterator.hpp>
+
6 #include <iterator>
+
7 
+
8 namespace stan {
+
9  namespace gm {
+
10  typedef std::istreambuf_iterator<char> base_iterator_t;
+
11  typedef boost::spirit::multi_pass<base_iterator_t> forward_iterator_t;
+
12  typedef boost::spirit::classic::position_iterator2<forward_iterator_t> pos_iterator_t;
+
13  }
+
14 }
+
15 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/jacobian_8hpp.html b/doc/api/html/jacobian_8hpp.html new file mode 100644 index 00000000000..85bd71edebb --- /dev/null +++ b/doc/api/html/jacobian_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/rev/jacobian.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
jacobian.hpp File Reference
+
+
+
#include <vector>
+#include <stan/agrad/rev/var.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

void stan::agrad::jacobian (std::vector< var > &dependents, std::vector< var > &independents, std::vector< std::vector< double > > &jacobian)
 Return the Jacobian of the function producing the specified dependent variables with respect to the specified independent variables.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/jacobian_8hpp_source.html b/doc/api/html/jacobian_8hpp_source.html new file mode 100644 index 00000000000..9e431d867b3 --- /dev/null +++ b/doc/api/html/jacobian_8hpp_source.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/agrad/rev/jacobian.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
jacobian.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__JACOBIAN_HPP__
+
2 #define __STAN__AGRAD__REV__JACOBIAN_HPP__
+
3 
+
4 #include <vector>
+
5 #include <stan/agrad/rev/var.hpp>
+
6 
+
7 namespace stan {
+
8  namespace agrad {
+
9 
+
36  inline void jacobian(std::vector<var>& dependents,
+
37  std::vector<var>& independents,
+
38  std::vector<std::vector<double> >& jacobian) {
+
39  jacobian.resize(dependents.size());
+
40  for (size_t i = 0; i < dependents.size(); ++i) {
+
41  jacobian[i].resize(independents.size());
+
42  if (i > 0)
+ +
44  jacobian.push_back(std::vector<double>(0));
+
45  grad(dependents[i].vi_);
+
46  for (size_t j = 0; j < independents.size(); ++j)
+
47  jacobian[i][j] = independents[j].adj();
+
48  }
+
49  }
+
50 
+
51  }
+
52 }
+
53 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/jquery.js b/doc/api/html/jquery.js new file mode 100644 index 00000000000..63939e76dd2 --- /dev/null +++ b/doc/api/html/jquery.js @@ -0,0 +1,8 @@ +/*! jQuery v1.7.1 jquery.com | jquery.org/license */ +(function(a,b){function cy(a){return f.isWindow(a)?a:a.nodeType===9?a.defaultView||a.parentWindow:!1}function cv(a){if(!ck[a]){var b=c.body,d=f("<"+a+">").appendTo(b),e=d.css("display");d.remove();if(e==="none"||e===""){cl||(cl=c.createElement("iframe"),cl.frameBorder=cl.width=cl.height=0),b.appendChild(cl);if(!cm||!cl.createElement)cm=(cl.contentWindow||cl.contentDocument).document,cm.write((c.compatMode==="CSS1Compat"?"":"")+""),cm.close();d=cm.createElement(a),cm.body.appendChild(d),e=f.css(d,"display"),b.removeChild(cl)}ck[a]=e}return ck[a]}function cu(a,b){var c={};f.each(cq.concat.apply([],cq.slice(0,b)),function(){c[this]=a});return c}function ct(){cr=b}function cs(){setTimeout(ct,0);return cr=f.now()}function cj(){try{return new a.ActiveXObject("Microsoft.XMLHTTP")}catch(b){}}function ci(){try{return new a.XMLHttpRequest}catch(b){}}function cc(a,c){a.dataFilter&&(c=a.dataFilter(c,a.dataType));var d=a.dataTypes,e={},g,h,i=d.length,j,k=d[0],l,m,n,o,p;for(g=1;g0){if(c!=="border")for(;g=0===c})}function S(a){return!a||!a.parentNode||a.parentNode.nodeType===11}function K(){return!0}function J(){return!1}function n(a,b,c){var d=b+"defer",e=b+"queue",g=b+"mark",h=f._data(a,d);h&&(c==="queue"||!f._data(a,e))&&(c==="mark"||!f._data(a,g))&&setTimeout(function(){!f._data(a,e)&&!f._data(a,g)&&(f.removeData(a,d,!0),h.fire())},0)}function m(a){for(var b in a){if(b==="data"&&f.isEmptyObject(a[b]))continue;if(b!=="toJSON")return!1}return!0}function l(a,c,d){if(d===b&&a.nodeType===1){var e="data-"+c.replace(k,"-$1").toLowerCase();d=a.getAttribute(e);if(typeof d=="string"){try{d=d==="true"?!0:d==="false"?!1:d==="null"?null:f.isNumeric(d)?parseFloat(d):j.test(d)?f.parseJSON(d):d}catch(g){}f.data(a,c,d)}else d=b}return d}function h(a){var b=g[a]={},c,d;a=a.split(/\s+/);for(c=0,d=a.length;c)[^>]*$|#([\w\-]*)$)/,j=/\S/,k=/^\s+/,l=/\s+$/,m=/^<(\w+)\s*\/?>(?:<\/\1>)?$/,n=/^[\],:{}\s]*$/,o=/\\(?:["\\\/bfnrt]|u[0-9a-fA-F]{4})/g,p=/"[^"\\\n\r]*"|true|false|null|-?\d+(?:\.\d*)?(?:[eE][+\-]?\d+)?/g,q=/(?:^|:|,)(?:\s*\[)+/g,r=/(webkit)[ \/]([\w.]+)/,s=/(opera)(?:.*version)?[ \/]([\w.]+)/,t=/(msie) ([\w.]+)/,u=/(mozilla)(?:.*? rv:([\w.]+))?/,v=/-([a-z]|[0-9])/ig,w=/^-ms-/,x=function(a,b){return(b+"").toUpperCase()},y=d.userAgent,z,A,B,C=Object.prototype.toString,D=Object.prototype.hasOwnProperty,E=Array.prototype.push,F=Array.prototype.slice,G=String.prototype.trim,H=Array.prototype.indexOf,I={};e.fn=e.prototype={constructor:e,init:function(a,d,f){var g,h,j,k;if(!a)return this;if(a.nodeType){this.context=this[0]=a,this.length=1;return this}if(a==="body"&&!d&&c.body){this.context=c,this[0]=c.body,this.selector=a,this.length=1;return this}if(typeof a=="string"){a.charAt(0)!=="<"||a.charAt(a.length-1)!==">"||a.length<3?g=i.exec(a):g=[null,a,null];if(g&&(g[1]||!d)){if(g[1]){d=d instanceof e?d[0]:d,k=d?d.ownerDocument||d:c,j=m.exec(a),j?e.isPlainObject(d)?(a=[c.createElement(j[1])],e.fn.attr.call(a,d,!0)):a=[k.createElement(j[1])]:(j=e.buildFragment([g[1]],[k]),a=(j.cacheable?e.clone(j.fragment):j.fragment).childNodes);return e.merge(this,a)}h=c.getElementById(g[2]);if(h&&h.parentNode){if(h.id!==g[2])return f.find(a);this.length=1,this[0]=h}this.context=c,this.selector=a;return this}return!d||d.jquery?(d||f).find(a):this.constructor(d).find(a)}if(e.isFunction(a))return f.ready(a);a.selector!==b&&(this.selector=a.selector,this.context=a.context);return e.makeArray(a,this)},selector:"",jquery:"1.7.1",length:0,size:function(){return this.length},toArray:function(){return F.call(this,0)},get:function(a){return a==null?this.toArray():a<0?this[this.length+a]:this[a]},pushStack:function(a,b,c){var d=this.constructor();e.isArray(a)?E.apply(d,a):e.merge(d,a),d.prevObject=this,d.context=this.context,b==="find"?d.selector=this.selector+(this.selector?" ":"")+c:b&&(d.selector=this.selector+"."+b+"("+c+")");return d},each:function(a,b){return e.each(this,a,b)},ready:function(a){e.bindReady(),A.add(a);return this},eq:function(a){a=+a;return a===-1?this.slice(a):this.slice(a,a+1)},first:function(){return this.eq(0)},last:function(){return this.eq(-1)},slice:function(){return this.pushStack(F.apply(this,arguments),"slice",F.call(arguments).join(","))},map:function(a){return this.pushStack(e.map(this,function(b,c){return a.call(b,c,b)}))},end:function(){return this.prevObject||this.constructor(null)},push:E,sort:[].sort,splice:[].splice},e.fn.init.prototype=e.fn,e.extend=e.fn.extend=function(){var a,c,d,f,g,h,i=arguments[0]||{},j=1,k=arguments.length,l=!1;typeof i=="boolean"&&(l=i,i=arguments[1]||{},j=2),typeof i!="object"&&!e.isFunction(i)&&(i={}),k===j&&(i=this,--j);for(;j0)return;A.fireWith(c,[e]),e.fn.trigger&&e(c).trigger("ready").off("ready")}},bindReady:function(){if(!A){A=e.Callbacks("once memory");if(c.readyState==="complete")return setTimeout(e.ready,1);if(c.addEventListener)c.addEventListener("DOMContentLoaded",B,!1),a.addEventListener("load",e.ready,!1);else if(c.attachEvent){c.attachEvent("onreadystatechange",B),a.attachEvent("onload",e.ready);var b=!1;try{b=a.frameElement==null}catch(d){}c.documentElement.doScroll&&b&&J()}}},isFunction:function(a){return e.type(a)==="function"},isArray:Array.isArray||function(a){return e.type(a)==="array"},isWindow:function(a){return a&&typeof a=="object"&&"setInterval"in a},isNumeric:function(a){return!isNaN(parseFloat(a))&&isFinite(a)},type:function(a){return a==null?String(a):I[C.call(a)]||"object"},isPlainObject:function(a){if(!a||e.type(a)!=="object"||a.nodeType||e.isWindow(a))return!1;try{if(a.constructor&&!D.call(a,"constructor")&&!D.call(a.constructor.prototype,"isPrototypeOf"))return!1}catch(c){return!1}var d;for(d in a);return d===b||D.call(a,d)},isEmptyObject:function(a){for(var b in a)return!1;return!0},error:function(a){throw new Error(a)},parseJSON:function(b){if(typeof b!="string"||!b)return null;b=e.trim(b);if(a.JSON&&a.JSON.parse)return a.JSON.parse(b);if(n.test(b.replace(o,"@").replace(p,"]").replace(q,"")))return(new Function("return "+b))();e.error("Invalid JSON: "+b)},parseXML:function(c){var d,f;try{a.DOMParser?(f=new DOMParser,d=f.parseFromString(c,"text/xml")):(d=new ActiveXObject("Microsoft.XMLDOM"),d.async="false",d.loadXML(c))}catch(g){d=b}(!d||!d.documentElement||d.getElementsByTagName("parsererror").length)&&e.error("Invalid XML: "+c);return d},noop:function(){},globalEval:function(b){b&&j.test(b)&&(a.execScript||function(b){a.eval.call(a,b)})(b)},camelCase:function(a){return a.replace(w,"ms-").replace(v,x)},nodeName:function(a,b){return a.nodeName&&a.nodeName.toUpperCase()===b.toUpperCase()},each:function(a,c,d){var f,g=0,h=a.length,i=h===b||e.isFunction(a);if(d){if(i){for(f in a)if(c.apply(a[f],d)===!1)break}else for(;g0&&a[0]&&a[j-1]||j===0||e.isArray(a));if(k)for(;i1?i.call(arguments,0):b,j.notifyWith(k,e)}}function l(a){return function(c){b[a]=arguments.length>1?i.call(arguments,0):c,--g||j.resolveWith(j,b)}}var b=i.call(arguments,0),c=0,d=b.length,e=Array(d),g=d,h=d,j=d<=1&&a&&f.isFunction(a.promise)?a:f.Deferred(),k=j.promise();if(d>1){for(;c
a",d=q.getElementsByTagName("*"),e=q.getElementsByTagName("a")[0];if(!d||!d.length||!e)return{};g=c.createElement("select"),h=g.appendChild(c.createElement("option")),i=q.getElementsByTagName("input")[0],b={leadingWhitespace:q.firstChild.nodeType===3,tbody:!q.getElementsByTagName("tbody").length,htmlSerialize:!!q.getElementsByTagName("link").length,style:/top/.test(e.getAttribute("style")),hrefNormalized:e.getAttribute("href")==="/a",opacity:/^0.55/.test(e.style.opacity),cssFloat:!!e.style.cssFloat,checkOn:i.value==="on",optSelected:h.selected,getSetAttribute:q.className!=="t",enctype:!!c.createElement("form").enctype,html5Clone:c.createElement("nav").cloneNode(!0).outerHTML!=="<:nav>",submitBubbles:!0,changeBubbles:!0,focusinBubbles:!1,deleteExpando:!0,noCloneEvent:!0,inlineBlockNeedsLayout:!1,shrinkWrapBlocks:!1,reliableMarginRight:!0},i.checked=!0,b.noCloneChecked=i.cloneNode(!0).checked,g.disabled=!0,b.optDisabled=!h.disabled;try{delete q.test}catch(s){b.deleteExpando=!1}!q.addEventListener&&q.attachEvent&&q.fireEvent&&(q.attachEvent("onclick",function(){b.noCloneEvent=!1}),q.cloneNode(!0).fireEvent("onclick")),i=c.createElement("input"),i.value="t",i.setAttribute("type","radio"),b.radioValue=i.value==="t",i.setAttribute("checked","checked"),q.appendChild(i),k=c.createDocumentFragment(),k.appendChild(q.lastChild),b.checkClone=k.cloneNode(!0).cloneNode(!0).lastChild.checked,b.appendChecked=i.checked,k.removeChild(i),k.appendChild(q),q.innerHTML="",a.getComputedStyle&&(j=c.createElement("div"),j.style.width="0",j.style.marginRight="0",q.style.width="2px",q.appendChild(j),b.reliableMarginRight=(parseInt((a.getComputedStyle(j,null)||{marginRight:0}).marginRight,10)||0)===0);if(q.attachEvent)for(o in{submit:1,change:1,focusin:1})n="on"+o,p=n in q,p||(q.setAttribute(n,"return;"),p=typeof q[n]=="function"),b[o+"Bubbles"]=p;k.removeChild(q),k=g=h=j=q=i=null,f(function(){var a,d,e,g,h,i,j,k,m,n,o,r=c.getElementsByTagName("body")[0];!r||(j=1,k="position:absolute;top:0;left:0;width:1px;height:1px;margin:0;",m="visibility:hidden;border:0;",n="style='"+k+"border:5px solid #000;padding:0;'",o="
"+""+"
",a=c.createElement("div"),a.style.cssText=m+"width:0;height:0;position:static;top:0;margin-top:"+j+"px",r.insertBefore(a,r.firstChild),q=c.createElement("div"),a.appendChild(q),q.innerHTML="
t
",l=q.getElementsByTagName("td"),p=l[0].offsetHeight===0,l[0].style.display="",l[1].style.display="none",b.reliableHiddenOffsets=p&&l[0].offsetHeight===0,q.innerHTML="",q.style.width=q.style.paddingLeft="1px",f.boxModel=b.boxModel=q.offsetWidth===2,typeof q.style.zoom!="undefined"&&(q.style.display="inline",q.style.zoom=1,b.inlineBlockNeedsLayout=q.offsetWidth===2,q.style.display="",q.innerHTML="
",b.shrinkWrapBlocks=q.offsetWidth!==2),q.style.cssText=k+m,q.innerHTML=o,d=q.firstChild,e=d.firstChild,h=d.nextSibling.firstChild.firstChild,i={doesNotAddBorder:e.offsetTop!==5,doesAddBorderForTableAndCells:h.offsetTop===5},e.style.position="fixed",e.style.top="20px",i.fixedPosition=e.offsetTop===20||e.offsetTop===15,e.style.position=e.style.top="",d.style.overflow="hidden",d.style.position="relative",i.subtractsBorderForOverflowNotVisible=e.offsetTop===-5,i.doesNotIncludeMarginInBodyOffset=r.offsetTop!==j,r.removeChild(a),q=a=null,f.extend(b,i))});return b}();var j=/^(?:\{.*\}|\[.*\])$/,k=/([A-Z])/g;f.extend({cache:{},uuid:0,expando:"jQuery"+(f.fn.jquery+Math.random()).replace(/\D/g,""),noData:{embed:!0,object:"clsid:D27CDB6E-AE6D-11cf-96B8-444553540000",applet:!0},hasData:function(a){a=a.nodeType?f.cache[a[f.expando]]:a[f.expando];return!!a&&!m(a)},data:function(a,c,d,e){if(!!f.acceptData(a)){var g,h,i,j=f.expando,k=typeof c=="string",l=a.nodeType,m=l?f.cache:a,n=l?a[j]:a[j]&&j,o=c==="events";if((!n||!m[n]||!o&&!e&&!m[n].data)&&k&&d===b)return;n||(l?a[j]=n=++f.uuid:n=j),m[n]||(m[n]={},l||(m[n].toJSON=f.noop));if(typeof c=="object"||typeof c=="function")e?m[n]=f.extend(m[n],c):m[n].data=f.extend(m[n].data,c);g=h=m[n],e||(h.data||(h.data={}),h=h.data),d!==b&&(h[f.camelCase(c)]=d);if(o&&!h[c])return g.events;k?(i=h[c],i==null&&(i=h[f.camelCase(c)])):i=h;return i}},removeData:function(a,b,c){if(!!f.acceptData(a)){var d,e,g,h=f.expando,i=a.nodeType,j=i?f.cache:a,k=i?a[h]:h;if(!j[k])return;if(b){d=c?j[k]:j[k].data;if(d){f.isArray(b)||(b in d?b=[b]:(b=f.camelCase(b),b in d?b=[b]:b=b.split(" ")));for(e=0,g=b.length;e-1)return!0;return!1},val:function(a){var c,d,e,g=this[0];{if(!!arguments.length){e=f.isFunction(a);return this.each(function(d){var g=f(this),h;if(this.nodeType===1){e?h=a.call(this,d,g.val()):h=a,h==null?h="":typeof h=="number"?h+="":f.isArray(h)&&(h=f.map(h,function(a){return a==null?"":a+""})),c=f.valHooks[this.nodeName.toLowerCase()]||f.valHooks[this.type];if(!c||!("set"in c)||c.set(this,h,"value")===b)this.value=h}})}if(g){c=f.valHooks[g.nodeName.toLowerCase()]||f.valHooks[g.type];if(c&&"get"in c&&(d=c.get(g,"value"))!==b)return d;d=g.value;return typeof d=="string"?d.replace(q,""):d==null?"":d}}}}),f.extend({valHooks:{option:{get:function(a){var b=a.attributes.value;return!b||b.specified?a.value:a.text}},select:{get:function(a){var b,c,d,e,g=a.selectedIndex,h=[],i=a.options,j=a.type==="select-one";if(g<0)return null;c=j?g:0,d=j?g+1:i.length;for(;c=0}),c.length||(a.selectedIndex=-1);return c}}},attrFn:{val:!0,css:!0,html:!0,text:!0,data:!0,width:!0,height:!0,offset:!0},attr:function(a,c,d,e){var g,h,i,j=a.nodeType;if(!!a&&j!==3&&j!==8&&j!==2){if(e&&c in f.attrFn)return f(a)[c](d);if(typeof a.getAttribute=="undefined")return f.prop(a,c,d);i=j!==1||!f.isXMLDoc(a),i&&(c=c.toLowerCase(),h=f.attrHooks[c]||(u.test(c)?x:w));if(d!==b){if(d===null){f.removeAttr(a,c);return}if(h&&"set"in h&&i&&(g=h.set(a,d,c))!==b)return g;a.setAttribute(c,""+d);return d}if(h&&"get"in h&&i&&(g=h.get(a,c))!==null)return g;g=a.getAttribute(c);return g===null?b:g}},removeAttr:function(a,b){var c,d,e,g,h=0;if(b&&a.nodeType===1){d=b.toLowerCase().split(p),g=d.length;for(;h=0}})});var z=/^(?:textarea|input|select)$/i,A=/^([^\.]*)?(?:\.(.+))?$/,B=/\bhover(\.\S+)?\b/,C=/^key/,D=/^(?:mouse|contextmenu)|click/,E=/^(?:focusinfocus|focusoutblur)$/,F=/^(\w*)(?:#([\w\-]+))?(?:\.([\w\-]+))?$/,G=function(a){var b=F.exec(a);b&&(b[1]=(b[1]||"").toLowerCase(),b[3]=b[3]&&new RegExp("(?:^|\\s)"+b[3]+"(?:\\s|$)"));return b},H=function(a,b){var c=a.attributes||{};return(!b[1]||a.nodeName.toLowerCase()===b[1])&&(!b[2]||(c.id||{}).value===b[2])&&(!b[3]||b[3].test((c["class"]||{}).value))},I=function(a){return f.event.special.hover?a:a.replace(B,"mouseenter$1 mouseleave$1")}; +f.event={add:function(a,c,d,e,g){var h,i,j,k,l,m,n,o,p,q,r,s;if(!(a.nodeType===3||a.nodeType===8||!c||!d||!(h=f._data(a)))){d.handler&&(p=d,d=p.handler),d.guid||(d.guid=f.guid++),j=h.events,j||(h.events=j={}),i=h.handle,i||(h.handle=i=function(a){return typeof f!="undefined"&&(!a||f.event.triggered!==a.type)?f.event.dispatch.apply(i.elem,arguments):b},i.elem=a),c=f.trim(I(c)).split(" ");for(k=0;k=0&&(h=h.slice(0,-1),k=!0),h.indexOf(".")>=0&&(i=h.split("."),h=i.shift(),i.sort());if((!e||f.event.customEvent[h])&&!f.event.global[h])return;c=typeof c=="object"?c[f.expando]?c:new f.Event(h,c):new f.Event(h),c.type=h,c.isTrigger=!0,c.exclusive=k,c.namespace=i.join("."),c.namespace_re=c.namespace?new RegExp("(^|\\.)"+i.join("\\.(?:.*\\.)?")+"(\\.|$)"):null,o=h.indexOf(":")<0?"on"+h:"";if(!e){j=f.cache;for(l in j)j[l].events&&j[l].events[h]&&f.event.trigger(c,d,j[l].handle.elem,!0);return}c.result=b,c.target||(c.target=e),d=d!=null?f.makeArray(d):[],d.unshift(c),p=f.event.special[h]||{};if(p.trigger&&p.trigger.apply(e,d)===!1)return;r=[[e,p.bindType||h]];if(!g&&!p.noBubble&&!f.isWindow(e)){s=p.delegateType||h,m=E.test(s+h)?e:e.parentNode,n=null;for(;m;m=m.parentNode)r.push([m,s]),n=m;n&&n===e.ownerDocument&&r.push([n.defaultView||n.parentWindow||a,s])}for(l=0;le&&i.push({elem:this,matches:d.slice(e)});for(j=0;j0?this.on(b,null,a,c):this.trigger(b)},f.attrFn&&(f.attrFn[b]=!0),C.test(b)&&(f.event.fixHooks[b]=f.event.keyHooks),D.test(b)&&(f.event.fixHooks[b]=f.event.mouseHooks)}),function(){function x(a,b,c,e,f,g){for(var h=0,i=e.length;h0){k=j;break}}j=j[a]}e[h]=k}}}function w(a,b,c,e,f,g){for(var h=0,i=e.length;h+~,(\[\\]+)+|[>+~])(\s*,\s*)?((?:.|\r|\n)*)/g,d="sizcache"+(Math.random()+"").replace(".",""),e=0,g=Object.prototype.toString,h=!1,i=!0,j=/\\/g,k=/\r\n/g,l=/\W/;[0,0].sort(function(){i=!1;return 0});var m=function(b,d,e,f){e=e||[],d=d||c;var h=d;if(d.nodeType!==1&&d.nodeType!==9)return[];if(!b||typeof b!="string")return e;var i,j,k,l,n,q,r,t,u=!0,v=m.isXML(d),w=[],x=b;do{a.exec(""),i=a.exec(x);if(i){x=i[3],w.push(i[1]);if(i[2]){l=i[3];break}}}while(i);if(w.length>1&&p.exec(b))if(w.length===2&&o.relative[w[0]])j=y(w[0]+w[1],d,f);else{j=o.relative[w[0]]?[d]:m(w.shift(),d);while(w.length)b=w.shift(),o.relative[b]&&(b+=w.shift()),j=y(b,j,f)}else{!f&&w.length>1&&d.nodeType===9&&!v&&o.match.ID.test(w[0])&&!o.match.ID.test(w[w.length-1])&&(n=m.find(w.shift(),d,v),d=n.expr?m.filter(n.expr,n.set)[0]:n.set[0]);if(d){n=f?{expr:w.pop(),set:s(f)}:m.find(w.pop(),w.length===1&&(w[0]==="~"||w[0]==="+")&&d.parentNode?d.parentNode:d,v),j=n.expr?m.filter(n.expr,n.set):n.set,w.length>0?k=s(j):u=!1;while(w.length)q=w.pop(),r=q,o.relative[q]?r=w.pop():q="",r==null&&(r=d),o.relative[q](k,r,v)}else k=w=[]}k||(k=j),k||m.error(q||b);if(g.call(k)==="[object Array]")if(!u)e.push.apply(e,k);else if(d&&d.nodeType===1)for(t=0;k[t]!=null;t++)k[t]&&(k[t]===!0||k[t].nodeType===1&&m.contains(d,k[t]))&&e.push(j[t]);else for(t=0;k[t]!=null;t++)k[t]&&k[t].nodeType===1&&e.push(j[t]);else s(k,e);l&&(m(l,h,e,f),m.uniqueSort(e));return e};m.uniqueSort=function(a){if(u){h=i,a.sort(u);if(h)for(var b=1;b0},m.find=function(a,b,c){var d,e,f,g,h,i;if(!a)return[];for(e=0,f=o.order.length;e":function(a,b){var c,d=typeof b=="string",e=0,f=a.length;if(d&&!l.test(b)){b=b.toLowerCase();for(;e=0)?c||d.push(h):c&&(b[g]=!1));return!1},ID:function(a){return a[1].replace(j,"")},TAG:function(a,b){return a[1].replace(j,"").toLowerCase()},CHILD:function(a){if(a[1]==="nth"){a[2]||m.error(a[0]),a[2]=a[2].replace(/^\+|\s*/g,"");var b=/(-?)(\d*)(?:n([+\-]?\d*))?/.exec(a[2]==="even"&&"2n"||a[2]==="odd"&&"2n+1"||!/\D/.test(a[2])&&"0n+"+a[2]||a[2]);a[2]=b[1]+(b[2]||1)-0,a[3]=b[3]-0}else a[2]&&m.error(a[0]);a[0]=e++;return a},ATTR:function(a,b,c,d,e,f){var g=a[1]=a[1].replace(j,"");!f&&o.attrMap[g]&&(a[1]=o.attrMap[g]),a[4]=(a[4]||a[5]||"").replace(j,""),a[2]==="~="&&(a[4]=" "+a[4]+" ");return a},PSEUDO:function(b,c,d,e,f){if(b[1]==="not")if((a.exec(b[3])||"").length>1||/^\w/.test(b[3]))b[3]=m(b[3],null,null,c);else{var g=m.filter(b[3],c,d,!0^f);d||e.push.apply(e,g);return!1}else if(o.match.POS.test(b[0])||o.match.CHILD.test(b[0]))return!0;return b},POS:function(a){a.unshift(!0);return a}},filters:{enabled:function(a){return a.disabled===!1&&a.type!=="hidden"},disabled:function(a){return a.disabled===!0},checked:function(a){return a.checked===!0},selected:function(a){a.parentNode&&a.parentNode.selectedIndex;return a.selected===!0},parent:function(a){return!!a.firstChild},empty:function(a){return!a.firstChild},has:function(a,b,c){return!!m(c[3],a).length},header:function(a){return/h\d/i.test(a.nodeName)},text:function(a){var b=a.getAttribute("type"),c=a.type;return a.nodeName.toLowerCase()==="input"&&"text"===c&&(b===c||b===null)},radio:function(a){return a.nodeName.toLowerCase()==="input"&&"radio"===a.type},checkbox:function(a){return a.nodeName.toLowerCase()==="input"&&"checkbox"===a.type},file:function(a){return a.nodeName.toLowerCase()==="input"&&"file"===a.type},password:function(a){return a.nodeName.toLowerCase()==="input"&&"password"===a.type},submit:function(a){var b=a.nodeName.toLowerCase();return(b==="input"||b==="button")&&"submit"===a.type},image:function(a){return a.nodeName.toLowerCase()==="input"&&"image"===a.type},reset:function(a){var b=a.nodeName.toLowerCase();return(b==="input"||b==="button")&&"reset"===a.type},button:function(a){var b=a.nodeName.toLowerCase();return b==="input"&&"button"===a.type||b==="button"},input:function(a){return/input|select|textarea|button/i.test(a.nodeName)},focus:function(a){return a===a.ownerDocument.activeElement}},setFilters:{first:function(a,b){return b===0},last:function(a,b,c,d){return b===d.length-1},even:function(a,b){return b%2===0},odd:function(a,b){return b%2===1},lt:function(a,b,c){return bc[3]-0},nth:function(a,b,c){return c[3]-0===b},eq:function(a,b,c){return c[3]-0===b}},filter:{PSEUDO:function(a,b,c,d){var e=b[1],f=o.filters[e];if(f)return f(a,c,b,d);if(e==="contains")return(a.textContent||a.innerText||n([a])||"").indexOf(b[3])>=0;if(e==="not"){var g=b[3];for(var h=0,i=g.length;h=0}},ID:function(a,b){return a.nodeType===1&&a.getAttribute("id")===b},TAG:function(a,b){return b==="*"&&a.nodeType===1||!!a.nodeName&&a.nodeName.toLowerCase()===b},CLASS:function(a,b){return(" "+(a.className||a.getAttribute("class"))+" ").indexOf(b)>-1},ATTR:function(a,b){var c=b[1],d=m.attr?m.attr(a,c):o.attrHandle[c]?o.attrHandle[c](a):a[c]!=null?a[c]:a.getAttribute(c),e=d+"",f=b[2],g=b[4];return d==null?f==="!=":!f&&m.attr?d!=null:f==="="?e===g:f==="*="?e.indexOf(g)>=0:f==="~="?(" "+e+" ").indexOf(g)>=0:g?f==="!="?e!==g:f==="^="?e.indexOf(g)===0:f==="$="?e.substr(e.length-g.length)===g:f==="|="?e===g||e.substr(0,g.length+1)===g+"-":!1:e&&d!==!1},POS:function(a,b,c,d){var e=b[2],f=o.setFilters[e];if(f)return f(a,c,b,d)}}},p=o.match.POS,q=function(a,b){return"\\"+(b-0+1)};for(var r in o.match)o.match[r]=new RegExp(o.match[r].source+/(?![^\[]*\])(?![^\(]*\))/.source),o.leftMatch[r]=new RegExp(/(^(?:.|\r|\n)*?)/.source+o.match[r].source.replace(/\\(\d+)/g,q));var s=function(a,b){a=Array.prototype.slice.call(a,0);if(b){b.push.apply(b,a);return b}return a};try{Array.prototype.slice.call(c.documentElement.childNodes,0)[0].nodeType}catch(t){s=function(a,b){var c=0,d=b||[];if(g.call(a)==="[object Array]")Array.prototype.push.apply(d,a);else if(typeof a.length=="number")for(var e=a.length;c",e.insertBefore(a,e.firstChild),c.getElementById(d)&&(o.find.ID=function(a,c,d){if(typeof c.getElementById!="undefined"&&!d){var e=c.getElementById(a[1]);return e?e.id===a[1]||typeof e.getAttributeNode!="undefined"&&e.getAttributeNode("id").nodeValue===a[1]?[e]:b:[]}},o.filter.ID=function(a,b){var c=typeof a.getAttributeNode!="undefined"&&a.getAttributeNode("id");return a.nodeType===1&&c&&c.nodeValue===b}),e.removeChild(a),e=a=null}(),function(){var a=c.createElement("div");a.appendChild(c.createComment("")),a.getElementsByTagName("*").length>0&&(o.find.TAG=function(a,b){var c=b.getElementsByTagName(a[1]);if(a[1]==="*"){var d=[];for(var e=0;c[e];e++)c[e].nodeType===1&&d.push(c[e]);c=d}return c}),a.innerHTML="",a.firstChild&&typeof a.firstChild.getAttribute!="undefined"&&a.firstChild.getAttribute("href")!=="#"&&(o.attrHandle.href=function(a){return a.getAttribute("href",2)}),a=null}(),c.querySelectorAll&&function(){var a=m,b=c.createElement("div"),d="__sizzle__";b.innerHTML="

";if(!b.querySelectorAll||b.querySelectorAll(".TEST").length!==0){m=function(b,e,f,g){e=e||c;if(!g&&!m.isXML(e)){var h=/^(\w+$)|^\.([\w\-]+$)|^#([\w\-]+$)/.exec(b);if(h&&(e.nodeType===1||e.nodeType===9)){if(h[1])return s(e.getElementsByTagName(b),f);if(h[2]&&o.find.CLASS&&e.getElementsByClassName)return s(e.getElementsByClassName(h[2]),f)}if(e.nodeType===9){if(b==="body"&&e.body)return s([e.body],f);if(h&&h[3]){var i=e.getElementById(h[3]);if(!i||!i.parentNode)return s([],f);if(i.id===h[3])return s([i],f)}try{return s(e.querySelectorAll(b),f)}catch(j){}}else if(e.nodeType===1&&e.nodeName.toLowerCase()!=="object"){var k=e,l=e.getAttribute("id"),n=l||d,p=e.parentNode,q=/^\s*[+~]/.test(b);l?n=n.replace(/'/g,"\\$&"):e.setAttribute("id",n),q&&p&&(e=e.parentNode);try{if(!q||p)return s(e.querySelectorAll("[id='"+n+"'] "+b),f)}catch(r){}finally{l||k.removeAttribute("id")}}}return a(b,e,f,g)};for(var e in a)m[e]=a[e];b=null}}(),function(){var a=c.documentElement,b=a.matchesSelector||a.mozMatchesSelector||a.webkitMatchesSelector||a.msMatchesSelector;if(b){var d=!b.call(c.createElement("div"),"div"),e=!1;try{b.call(c.documentElement,"[test!='']:sizzle")}catch(f){e=!0}m.matchesSelector=function(a,c){c=c.replace(/\=\s*([^'"\]]*)\s*\]/g,"='$1']");if(!m.isXML(a))try{if(e||!o.match.PSEUDO.test(c)&&!/!=/.test(c)){var f=b.call(a,c);if(f||!d||a.document&&a.document.nodeType!==11)return f}}catch(g){}return m(c,null,null,[a]).length>0}}}(),function(){var a=c.createElement("div");a.innerHTML="
";if(!!a.getElementsByClassName&&a.getElementsByClassName("e").length!==0){a.lastChild.className="e";if(a.getElementsByClassName("e").length===1)return;o.order.splice(1,0,"CLASS"),o.find.CLASS=function(a,b,c){if(typeof b.getElementsByClassName!="undefined"&&!c)return b.getElementsByClassName(a[1])},a=null}}(),c.documentElement.contains?m.contains=function(a,b){return a!==b&&(a.contains?a.contains(b):!0)}:c.documentElement.compareDocumentPosition?m.contains=function(a,b){return!!(a.compareDocumentPosition(b)&16)}:m.contains=function(){return!1},m.isXML=function(a){var b=(a?a.ownerDocument||a:0).documentElement;return b?b.nodeName!=="HTML":!1};var y=function(a,b,c){var d,e=[],f="",g=b.nodeType?[b]:b;while(d=o.match.PSEUDO.exec(a))f+=d[0],a=a.replace(o.match.PSEUDO,"");a=o.relative[a]?a+"*":a;for(var h=0,i=g.length;h0)for(h=g;h=0:f.filter(a,this).length>0:this.filter(a).length>0)},closest:function(a,b){var c=[],d,e,g=this[0];if(f.isArray(a)){var h=1;while(g&&g.ownerDocument&&g!==b){for(d=0;d-1:f.find.matchesSelector(g,a)){c.push(g);break}g=g.parentNode;if(!g||!g.ownerDocument||g===b||g.nodeType===11)break}}c=c.length>1?f.unique(c):c;return this.pushStack(c,"closest",a)},index:function(a){if(!a)return this[0]&&this[0].parentNode?this.prevAll().length:-1;if(typeof a=="string")return f.inArray(this[0],f(a));return f.inArray(a.jquery?a[0]:a,this)},add:function(a,b){var c=typeof a=="string"?f(a,b):f.makeArray(a&&a.nodeType?[a]:a),d=f.merge(this.get(),c);return this.pushStack(S(c[0])||S(d[0])?d:f.unique(d))},andSelf:function(){return this.add(this.prevObject)}}),f.each({parent:function(a){var b=a.parentNode;return b&&b.nodeType!==11?b:null},parents:function(a){return f.dir(a,"parentNode")},parentsUntil:function(a,b,c){return f.dir(a,"parentNode",c)},next:function(a){return f.nth(a,2,"nextSibling")},prev:function(a){return f.nth(a,2,"previousSibling")},nextAll:function(a){return f.dir(a,"nextSibling")},prevAll:function(a){return f.dir(a,"previousSibling")},nextUntil:function(a,b,c){return f.dir(a,"nextSibling",c)},prevUntil:function(a,b,c){return f.dir(a,"previousSibling",c)},siblings:function(a){return f.sibling(a.parentNode.firstChild,a)},children:function(a){return f.sibling(a.firstChild)},contents:function(a){return f.nodeName(a,"iframe")?a.contentDocument||a.contentWindow.document:f.makeArray(a.childNodes)}},function(a,b){f.fn[a]=function(c,d){var e=f.map(this,b,c);L.test(a)||(d=c),d&&typeof d=="string"&&(e=f.filter(d,e)),e=this.length>1&&!R[a]?f.unique(e):e,(this.length>1||N.test(d))&&M.test(a)&&(e=e.reverse());return this.pushStack(e,a,P.call(arguments).join(","))}}),f.extend({filter:function(a,b,c){c&&(a=":not("+a+")");return b.length===1?f.find.matchesSelector(b[0],a)?[b[0]]:[]:f.find.matches(a,b)},dir:function(a,c,d){var e=[],g=a[c];while(g&&g.nodeType!==9&&(d===b||g.nodeType!==1||!f(g).is(d)))g.nodeType===1&&e.push(g),g=g[c];return e},nth:function(a,b,c,d){b=b||1;var e=0;for(;a;a=a[c])if(a.nodeType===1&&++e===b)break;return a},sibling:function(a,b){var c=[];for(;a;a=a.nextSibling)a.nodeType===1&&a!==b&&c.push(a);return c}});var V="abbr|article|aside|audio|canvas|datalist|details|figcaption|figure|footer|header|hgroup|mark|meter|nav|output|progress|section|summary|time|video",W=/ jQuery\d+="(?:\d+|null)"/g,X=/^\s+/,Y=/<(?!area|br|col|embed|hr|img|input|link|meta|param)(([\w:]+)[^>]*)\/>/ig,Z=/<([\w:]+)/,$=/",""],legend:[1,"
","
"],thead:[1,"","
"],tr:[2,"","
"],td:[3,"","
"],col:[2,"","
"],area:[1,"",""],_default:[0,"",""]},bh=U(c);bg.optgroup=bg.option,bg.tbody=bg.tfoot=bg.colgroup=bg.caption=bg.thead,bg.th=bg.td,f.support.htmlSerialize||(bg._default=[1,"div
","
"]),f.fn.extend({text:function(a){if(f.isFunction(a))return this.each(function(b){var c=f(this);c.text(a.call(this,b,c.text()))});if(typeof a!="object"&&a!==b)return this.empty().append((this[0]&&this[0].ownerDocument||c).createTextNode(a));return f.text(this)},wrapAll:function(a){if(f.isFunction(a))return this.each(function(b){f(this).wrapAll(a.call(this,b))});if(this[0]){var b=f(a,this[0].ownerDocument).eq(0).clone(!0);this[0].parentNode&&b.insertBefore(this[0]),b.map(function(){var a=this;while(a.firstChild&&a.firstChild.nodeType===1)a=a.firstChild;return a}).append(this)}return this},wrapInner:function(a){if(f.isFunction(a))return this.each(function(b){f(this).wrapInner(a.call(this,b))});return this.each(function(){var b=f(this),c=b.contents();c.length?c.wrapAll(a):b.append(a)})},wrap:function(a){var b=f.isFunction(a);return this.each(function(c){f(this).wrapAll(b?a.call(this,c):a)})},unwrap:function(){return this.parent().each(function(){f.nodeName(this,"body")||f(this).replaceWith(this.childNodes)}).end()},append:function(){return this.domManip(arguments,!0,function(a){this.nodeType===1&&this.appendChild(a)})},prepend:function(){return this.domManip(arguments,!0,function(a){this.nodeType===1&&this.insertBefore(a,this.firstChild)})},before:function(){if(this[0]&&this[0].parentNode)return this.domManip(arguments,!1,function(a){this.parentNode.insertBefore(a,this)});if(arguments.length){var a=f.clean(arguments);a.push.apply(a,this.toArray());return this.pushStack(a,"before",arguments)}},after:function(){if(this[0]&&this[0].parentNode)return this.domManip(arguments,!1,function(a){this.parentNode.insertBefore(a,this.nextSibling)});if(arguments.length){var a=this.pushStack(this,"after",arguments);a.push.apply(a,f.clean(arguments));return a}},remove:function(a,b){for(var c=0,d;(d=this[c])!=null;c++)if(!a||f.filter(a,[d]).length)!b&&d.nodeType===1&&(f.cleanData(d.getElementsByTagName("*")), +f.cleanData([d])),d.parentNode&&d.parentNode.removeChild(d);return this},empty:function() +{for(var a=0,b;(b=this[a])!=null;a++){b.nodeType===1&&f.cleanData(b.getElementsByTagName("*"));while(b.firstChild)b.removeChild(b.firstChild)}return this},clone:function(a,b){a=a==null?!1:a,b=b==null?a:b;return this.map(function(){return f.clone(this,a,b)})},html:function(a){if(a===b)return this[0]&&this[0].nodeType===1?this[0].innerHTML.replace(W,""):null;if(typeof a=="string"&&!ba.test(a)&&(f.support.leadingWhitespace||!X.test(a))&&!bg[(Z.exec(a)||["",""])[1].toLowerCase()]){a=a.replace(Y,"<$1>");try{for(var c=0,d=this.length;c1&&l0?this.clone(!0):this).get();f(e[h])[b](j),d=d.concat(j)}return this.pushStack(d,a,e.selector)}}),f.extend({clone:function(a,b,c){var d,e,g,h=f.support.html5Clone||!bc.test("<"+a.nodeName)?a.cloneNode(!0):bo(a);if((!f.support.noCloneEvent||!f.support.noCloneChecked)&&(a.nodeType===1||a.nodeType===11)&&!f.isXMLDoc(a)){bk(a,h),d=bl(a),e=bl(h);for(g=0;d[g];++g)e[g]&&bk(d[g],e[g])}if(b){bj(a,h);if(c){d=bl(a),e=bl(h);for(g=0;d[g];++g)bj(d[g],e[g])}}d=e=null;return h},clean:function(a,b,d,e){var g;b=b||c,typeof b.createElement=="undefined"&&(b=b.ownerDocument||b[0]&&b[0].ownerDocument||c);var h=[],i;for(var j=0,k;(k=a[j])!=null;j++){typeof k=="number"&&(k+="");if(!k)continue;if(typeof k=="string")if(!_.test(k))k=b.createTextNode(k);else{k=k.replace(Y,"<$1>");var l=(Z.exec(k)||["",""])[1].toLowerCase(),m=bg[l]||bg._default,n=m[0],o=b.createElement("div");b===c?bh.appendChild(o):U(b).appendChild(o),o.innerHTML=m[1]+k+m[2];while(n--)o=o.lastChild;if(!f.support.tbody){var p=$.test(k),q=l==="table"&&!p?o.firstChild&&o.firstChild.childNodes:m[1]===""&&!p?o.childNodes:[];for(i=q.length-1;i>=0;--i)f.nodeName(q[i],"tbody")&&!q[i].childNodes.length&&q[i].parentNode.removeChild(q[i])}!f.support.leadingWhitespace&&X.test(k)&&o.insertBefore(b.createTextNode(X.exec(k)[0]),o.firstChild),k=o.childNodes}var r;if(!f.support.appendChecked)if(k[0]&&typeof (r=k.length)=="number")for(i=0;i=0)return b+"px"}}}),f.support.opacity||(f.cssHooks.opacity={get:function(a,b){return br.test((b&&a.currentStyle?a.currentStyle.filter:a.style.filter)||"")?parseFloat(RegExp.$1)/100+"":b?"1":""},set:function(a,b){var c=a.style,d=a.currentStyle,e=f.isNumeric(b)?"alpha(opacity="+b*100+")":"",g=d&&d.filter||c.filter||"";c.zoom=1;if(b>=1&&f.trim(g.replace(bq,""))===""){c.removeAttribute("filter");if(d&&!d.filter)return}c.filter=bq.test(g)?g.replace(bq,e):g+" "+e}}),f(function(){f.support.reliableMarginRight||(f.cssHooks.marginRight={get:function(a,b){var c;f.swap(a,{display:"inline-block"},function(){b?c=bz(a,"margin-right","marginRight"):c=a.style.marginRight});return c}})}),c.defaultView&&c.defaultView.getComputedStyle&&(bA=function(a,b){var c,d,e;b=b.replace(bs,"-$1").toLowerCase(),(d=a.ownerDocument.defaultView)&&(e=d.getComputedStyle(a,null))&&(c=e.getPropertyValue(b),c===""&&!f.contains(a.ownerDocument.documentElement,a)&&(c=f.style(a,b)));return c}),c.documentElement.currentStyle&&(bB=function(a,b){var c,d,e,f=a.currentStyle&&a.currentStyle[b],g=a.style;f===null&&g&&(e=g[b])&&(f=e),!bt.test(f)&&bu.test(f)&&(c=g.left,d=a.runtimeStyle&&a.runtimeStyle.left,d&&(a.runtimeStyle.left=a.currentStyle.left),g.left=b==="fontSize"?"1em":f||0,f=g.pixelLeft+"px",g.left=c,d&&(a.runtimeStyle.left=d));return f===""?"auto":f}),bz=bA||bB,f.expr&&f.expr.filters&&(f.expr.filters.hidden=function(a){var b=a.offsetWidth,c=a.offsetHeight;return b===0&&c===0||!f.support.reliableHiddenOffsets&&(a.style&&a.style.display||f.css(a,"display"))==="none"},f.expr.filters.visible=function(a){return!f.expr.filters.hidden(a)});var bD=/%20/g,bE=/\[\]$/,bF=/\r?\n/g,bG=/#.*$/,bH=/^(.*?):[ \t]*([^\r\n]*)\r?$/mg,bI=/^(?:color|date|datetime|datetime-local|email|hidden|month|number|password|range|search|tel|text|time|url|week)$/i,bJ=/^(?:about|app|app\-storage|.+\-extension|file|res|widget):$/,bK=/^(?:GET|HEAD)$/,bL=/^\/\//,bM=/\?/,bN=/)<[^<]*)*<\/script>/gi,bO=/^(?:select|textarea)/i,bP=/\s+/,bQ=/([?&])_=[^&]*/,bR=/^([\w\+\.\-]+:)(?:\/\/([^\/?#:]*)(?::(\d+))?)?/,bS=f.fn.load,bT={},bU={},bV,bW,bX=["*/"]+["*"];try{bV=e.href}catch(bY){bV=c.createElement("a"),bV.href="",bV=bV.href}bW=bR.exec(bV.toLowerCase())||[],f.fn.extend({load:function(a,c,d){if(typeof a!="string"&&bS)return bS.apply(this,arguments);if(!this.length)return this;var e=a.indexOf(" ");if(e>=0){var g=a.slice(e,a.length);a=a.slice(0,e)}var h="GET";c&&(f.isFunction(c)?(d=c,c=b):typeof c=="object"&&(c=f.param(c,f.ajaxSettings.traditional),h="POST"));var i=this;f.ajax({url:a,type:h,dataType:"html",data:c,complete:function(a,b,c){c=a.responseText,a.isResolved()&&(a.done(function(a){c=a}),i.html(g?f("
").append(c.replace(bN,"")).find(g):c)),d&&i.each(d,[c,b,a])}});return this},serialize:function(){return f.param(this.serializeArray())},serializeArray:function(){return this.map(function(){return this.elements?f.makeArray(this.elements):this}).filter(function(){return this.name&&!this.disabled&&(this.checked||bO.test(this.nodeName)||bI.test(this.type))}).map(function(a,b){var c=f(this).val();return c==null?null:f.isArray(c)?f.map(c,function(a,c){return{name:b.name,value:a.replace(bF,"\r\n")}}):{name:b.name,value:c.replace(bF,"\r\n")}}).get()}}),f.each("ajaxStart ajaxStop ajaxComplete ajaxError ajaxSuccess ajaxSend".split(" "),function(a,b){f.fn[b]=function(a){return this.on(b,a)}}),f.each(["get","post"],function(a,c){f[c]=function(a,d,e,g){f.isFunction(d)&&(g=g||e,e=d,d=b);return f.ajax({type:c,url:a,data:d,success:e,dataType:g})}}),f.extend({getScript:function(a,c){return f.get(a,b,c,"script")},getJSON:function(a,b,c){return f.get(a,b,c,"json")},ajaxSetup:function(a,b){b?b_(a,f.ajaxSettings):(b=a,a=f.ajaxSettings),b_(a,b);return a},ajaxSettings:{url:bV,isLocal:bJ.test(bW[1]),global:!0,type:"GET",contentType:"application/x-www-form-urlencoded",processData:!0,async:!0,accepts:{xml:"application/xml, text/xml",html:"text/html",text:"text/plain",json:"application/json, text/javascript","*":bX},contents:{xml:/xml/,html:/html/,json:/json/},responseFields:{xml:"responseXML",text:"responseText"},converters:{"* text":a.String,"text html":!0,"text json":f.parseJSON,"text xml":f.parseXML},flatOptions:{context:!0,url:!0}},ajaxPrefilter:bZ(bT),ajaxTransport:bZ(bU),ajax:function(a,c){function w(a,c,l,m){if(s!==2){s=2,q&&clearTimeout(q),p=b,n=m||"",v.readyState=a>0?4:0;var o,r,u,w=c,x=l?cb(d,v,l):b,y,z;if(a>=200&&a<300||a===304){if(d.ifModified){if(y=v.getResponseHeader("Last-Modified"))f.lastModified[k]=y;if(z=v.getResponseHeader("Etag"))f.etag[k]=z}if(a===304)w="notmodified",o=!0;else try{r=cc(d,x),w="success",o=!0}catch(A){w="parsererror",u=A}}else{u=w;if(!w||a)w="error",a<0&&(a=0)}v.status=a,v.statusText=""+(c||w),o?h.resolveWith(e,[r,w,v]):h.rejectWith(e,[v,w,u]),v.statusCode(j),j=b,t&&g.trigger("ajax"+(o?"Success":"Error"),[v,d,o?r:u]),i.fireWith(e,[v,w]),t&&(g.trigger("ajaxComplete",[v,d]),--f.active||f.event.trigger("ajaxStop"))}}typeof a=="object"&&(c=a,a=b),c=c||{};var d=f.ajaxSetup({},c),e=d.context||d,g=e!==d&&(e.nodeType||e instanceof f)?f(e):f.event,h=f.Deferred(),i=f.Callbacks("once memory"),j=d.statusCode||{},k,l={},m={},n,o,p,q,r,s=0,t,u,v={readyState:0,setRequestHeader:function(a,b){if(!s){var c=a.toLowerCase();a=m[c]=m[c]||a,l[a]=b}return this},getAllResponseHeaders:function(){return s===2?n:null},getResponseHeader:function(a){var c;if(s===2){if(!o){o={};while(c=bH.exec(n))o[c[1].toLowerCase()]=c[2]}c=o[a.toLowerCase()]}return c===b?null:c},overrideMimeType:function(a){s||(d.mimeType=a);return this},abort:function(a){a=a||"abort",p&&p.abort(a),w(0,a);return this}};h.promise(v),v.success=v.done,v.error=v.fail,v.complete=i.add,v.statusCode=function(a){if(a){var b;if(s<2)for(b in a)j[b]=[j[b],a[b]];else b=a[v.status],v.then(b,b)}return this},d.url=((a||d.url)+"").replace(bG,"").replace(bL,bW[1]+"//"),d.dataTypes=f.trim(d.dataType||"*").toLowerCase().split(bP),d.crossDomain==null&&(r=bR.exec(d.url.toLowerCase()),d.crossDomain=!(!r||r[1]==bW[1]&&r[2]==bW[2]&&(r[3]||(r[1]==="http:"?80:443))==(bW[3]||(bW[1]==="http:"?80:443)))),d.data&&d.processData&&typeof d.data!="string"&&(d.data=f.param(d.data,d.traditional)),b$(bT,d,c,v);if(s===2)return!1;t=d.global,d.type=d.type.toUpperCase(),d.hasContent=!bK.test(d.type),t&&f.active++===0&&f.event.trigger("ajaxStart");if(!d.hasContent){d.data&&(d.url+=(bM.test(d.url)?"&":"?")+d.data,delete d.data),k=d.url;if(d.cache===!1){var x=f.now(),y=d.url.replace(bQ,"$1_="+x);d.url=y+(y===d.url?(bM.test(d.url)?"&":"?")+"_="+x:"")}}(d.data&&d.hasContent&&d.contentType!==!1||c.contentType)&&v.setRequestHeader("Content-Type",d.contentType),d.ifModified&&(k=k||d.url,f.lastModified[k]&&v.setRequestHeader("If-Modified-Since",f.lastModified[k]),f.etag[k]&&v.setRequestHeader("If-None-Match",f.etag[k])),v.setRequestHeader("Accept",d.dataTypes[0]&&d.accepts[d.dataTypes[0]]?d.accepts[d.dataTypes[0]]+(d.dataTypes[0]!=="*"?", "+bX+"; q=0.01":""):d.accepts["*"]);for(u in d.headers)v.setRequestHeader(u,d.headers[u]);if(d.beforeSend&&(d.beforeSend.call(e,v,d)===!1||s===2)){v.abort();return!1}for(u in{success:1,error:1,complete:1})v[u](d[u]);p=b$(bU,d,c,v);if(!p)w(-1,"No Transport");else{v.readyState=1,t&&g.trigger("ajaxSend",[v,d]),d.async&&d.timeout>0&&(q=setTimeout(function(){v.abort("timeout")},d.timeout));try{s=1,p.send(l,w)}catch(z){if(s<2)w(-1,z);else throw z}}return v},param:function(a,c){var d=[],e=function(a,b){b=f.isFunction(b)?b():b,d[d.length]=encodeURIComponent(a)+"="+encodeURIComponent(b)};c===b&&(c=f.ajaxSettings.traditional);if(f.isArray(a)||a.jquery&&!f.isPlainObject(a))f.each(a,function(){e(this.name,this.value)});else for(var g in a)ca(g,a[g],c,e);return d.join("&").replace(bD,"+")}}),f.extend({active:0,lastModified:{},etag:{}});var cd=f.now(),ce=/(\=)\?(&|$)|\?\?/i;f.ajaxSetup({jsonp:"callback",jsonpCallback:function(){return f.expando+"_"+cd++}}),f.ajaxPrefilter("json jsonp",function(b,c,d){var e=b.contentType==="application/x-www-form-urlencoded"&&typeof b.data=="string";if(b.dataTypes[0]==="jsonp"||b.jsonp!==!1&&(ce.test(b.url)||e&&ce.test(b.data))){var g,h=b.jsonpCallback=f.isFunction(b.jsonpCallback)?b.jsonpCallback():b.jsonpCallback,i=a[h],j=b.url,k=b.data,l="$1"+h+"$2";b.jsonp!==!1&&(j=j.replace(ce,l),b.url===j&&(e&&(k=k.replace(ce,l)),b.data===k&&(j+=(/\?/.test(j)?"&":"?")+b.jsonp+"="+h))),b.url=j,b.data=k,a[h]=function(a){g=[a]},d.always(function(){a[h]=i,g&&f.isFunction(i)&&a[h](g[0])}),b.converters["script json"]=function(){g||f.error(h+" was not called");return g[0]},b.dataTypes[0]="json";return"script"}}),f.ajaxSetup({accepts:{script:"text/javascript, application/javascript, application/ecmascript, application/x-ecmascript"},contents:{script:/javascript|ecmascript/},converters:{"text script":function(a){f.globalEval(a);return a}}}),f.ajaxPrefilter("script",function(a){a.cache===b&&(a.cache=!1),a.crossDomain&&(a.type="GET",a.global=!1)}),f.ajaxTransport("script",function(a){if(a.crossDomain){var d,e=c.head||c.getElementsByTagName("head")[0]||c.documentElement;return{send:function(f,g){d=c.createElement("script"),d.async="async",a.scriptCharset&&(d.charset=a.scriptCharset),d.src=a.url,d.onload=d.onreadystatechange=function(a,c){if(c||!d.readyState||/loaded|complete/.test(d.readyState))d.onload=d.onreadystatechange=null,e&&d.parentNode&&e.removeChild(d),d=b,c||g(200,"success")},e.insertBefore(d,e.firstChild)},abort:function(){d&&d.onload(0,1)}}}});var cf=a.ActiveXObject?function(){for(var a in ch)ch[a](0,1)}:!1,cg=0,ch;f.ajaxSettings.xhr=a.ActiveXObject?function(){return!this.isLocal&&ci()||cj()}:ci,function(a){f.extend(f.support,{ajax:!!a,cors:!!a&&"withCredentials"in a})}(f.ajaxSettings.xhr()),f.support.ajax&&f.ajaxTransport(function(c) +{if(!c.crossDomain||f.support.cors){var d;return{send:function(e,g){var h=c.xhr(),i,j;c.username?h.open(c.type,c.url,c.async,c.username,c.password):h.open(c.type,c.url,c.async);if(c.xhrFields)for(j in c.xhrFields)h[j]=c.xhrFields[j];c.mimeType&&h.overrideMimeType&&h.overrideMimeType(c.mimeType),!c.crossDomain&&!e["X-Requested-With"]&&(e["X-Requested-With"]="XMLHttpRequest");try{for(j in e)h.setRequestHeader(j,e[j])}catch(k){}h.send(c.hasContent&&c.data||null),d=function(a,e){var j,k,l,m,n;try{if(d&&(e||h.readyState===4)){d=b,i&&(h.onreadystatechange=f.noop,cf&&delete ch[i]);if(e)h.readyState!==4&&h.abort();else{j=h.status,l=h.getAllResponseHeaders(),m={},n=h.responseXML,n&&n.documentElement&&(m.xml=n),m.text=h.responseText;try{k=h.statusText}catch(o){k=""}!j&&c.isLocal&&!c.crossDomain?j=m.text?200:404:j===1223&&(j=204)}}}catch(p){e||g(-1,p)}m&&g(j,k,m,l)},!c.async||h.readyState===4?d():(i=++cg,cf&&(ch||(ch={},f(a).unload(cf)),ch[i]=d),h.onreadystatechange=d)},abort:function(){d&&d(0,1)}}}});var ck={},cl,cm,cn=/^(?:toggle|show|hide)$/,co=/^([+\-]=)?([\d+.\-]+)([a-z%]*)$/i,cp,cq=[["height","marginTop","marginBottom","paddingTop","paddingBottom"],["width","marginLeft","marginRight","paddingLeft","paddingRight"],["opacity"]],cr;f.fn.extend({show:function(a,b,c){var d,e;if(a||a===0)return this.animate(cu("show",3),a,b,c);for(var g=0,h=this.length;g=i.duration+this.startTime){this.now=this.end,this.pos=this.state=1,this.update(),i.animatedProperties[this.prop]=!0;for(b in i.animatedProperties)i.animatedProperties[b]!==!0&&(g=!1);if(g){i.overflow!=null&&!f.support.shrinkWrapBlocks&&f.each(["","X","Y"],function(a,b){h.style["overflow"+b]=i.overflow[a]}),i.hide&&f(h).hide();if(i.hide||i.show)for(b in i.animatedProperties)f.style(h,b,i.orig[b]),f.removeData(h,"fxshow"+b,!0),f.removeData(h,"toggle"+b,!0);d=i.complete,d&&(i.complete=!1,d.call(h))}return!1}i.duration==Infinity?this.now=e:(c=e-this.startTime,this.state=c/i.duration,this.pos=f.easing[i.animatedProperties[this.prop]](this.state,c,0,1,i.duration),this.now=this.start+(this.end-this.start)*this.pos),this.update();return!0}},f.extend(f.fx,{tick:function(){var a,b=f.timers,c=0;for(;c-1,k={},l={},m,n;j?(l=e.position(),m=l.top,n=l.left):(m=parseFloat(h)||0,n=parseFloat(i)||0),f.isFunction(b)&&(b=b.call(a,c,g)),b.top!=null&&(k.top=b.top-g.top+m),b.left!=null&&(k.left=b.left-g.left+n),"using"in b?b.using.call(a,k):e.css(k)}},f.fn.extend({position:function(){if(!this[0])return null;var a=this[0],b=this.offsetParent(),c=this.offset(),d=cx.test(b[0].nodeName)?{top:0,left:0}:b.offset();c.top-=parseFloat(f.css(a,"marginTop"))||0,c.left-=parseFloat(f.css(a,"marginLeft"))||0,d.top+=parseFloat(f.css(b[0],"borderTopWidth"))||0,d.left+=parseFloat(f.css(b[0],"borderLeftWidth"))||0;return{top:c.top-d.top,left:c.left-d.left}},offsetParent:function(){return this.map(function(){var a=this.offsetParent||c.body;while(a&&!cx.test(a.nodeName)&&f.css(a,"position")==="static")a=a.offsetParent;return a})}}),f.each(["Left","Top"],function(a,c){var d="scroll"+c;f.fn[d]=function(c){var e,g;if(c===b){e=this[0];if(!e)return null;g=cy(e);return g?"pageXOffset"in g?g[a?"pageYOffset":"pageXOffset"]:f.support.boxModel&&g.document.documentElement[d]||g.document.body[d]:e[d]}return this.each(function(){g=cy(this),g?g.scrollTo(a?f(g).scrollLeft():c,a?c:f(g).scrollTop()):this[d]=c})}}),f.each(["Height","Width"],function(a,c){var d=c.toLowerCase();f.fn["inner"+c]=function(){var a=this[0];return a?a.style?parseFloat(f.css(a,d,"padding")):this[d]():null},f.fn["outer"+c]=function(a){var b=this[0];return b?b.style?parseFloat(f.css(b,d,a?"margin":"border")):this[d]():null},f.fn[d]=function(a){var e=this[0];if(!e)return a==null?null:this;if(f.isFunction(a))return this.each(function(b){var c=f(this);c[d](a.call(this,b,c[d]()))});if(f.isWindow(e)){var g=e.document.documentElement["client"+c],h=e.document.body;return e.document.compatMode==="CSS1Compat"&&g||h&&h["client"+c]||g}if(e.nodeType===9)return Math.max(e.documentElement["client"+c],e.body["scroll"+c],e.documentElement["scroll"+c],e.body["offset"+c],e.documentElement["offset"+c]);if(a===b){var i=f.css(e,d),j=parseFloat(i);return f.isNumeric(j)?j:i}return this.css(d,typeof a=="string"?a:a+"px")}}),a.jQuery=a.$=f,typeof define=="function"&&define.amd&&define.amd.jQuery&&define("jquery",[],function(){return f})})(window); diff --git a/doc/api/html/list__argument_8hpp.html b/doc/api/html/list__argument_8hpp.html new file mode 100644 index 00000000000..eaa543ccf04 --- /dev/null +++ b/doc/api/html/list__argument_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/gm/arguments/list_argument.hpp File Reference + + + + + + + + + +
+
+
+ + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+ + + + + + + + + + +
+ +
+ + + +
+ +
+
list_argument.hpp File Reference
+
+
+
#include <iostream>
+#include <stan/gm/arguments/valued_argument.hpp>
+#include <stan/gm/arguments/arg_fail.hpp>
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::list_argument
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/list__argument_8hpp_source.html b/doc/api/html/list__argument_8hpp_source.html new file mode 100644 index 00000000000..08d415e681b --- /dev/null +++ b/doc/api/html/list__argument_8hpp_source.html @@ -0,0 +1,300 @@ + + + + + +Stan: src/stan/gm/arguments/list_argument.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
list_argument.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__LIST__ARGUMENT__BETA__
+
2 #define __STAN__GM__ARGUMENTS__LIST__ARGUMENT__BETA__
+
3 
+
4 #include <iostream>
+ + +
7 
+
8 namespace stan {
+
9 
+
10  namespace gm {
+
11 
+ +
13 
+
14  public:
+
15 
+ +
17  _value_type = "list element";
+
18  }
+
19 
+ +
21 
+
22  for (std::vector<argument*>::iterator it = _values.begin();
+
23  it != _values.end(); ++it) {
+
24  delete *it;
+
25  }
+
26 
+
27  _values.clear();
+
28 
+
29  }
+
30 
+
31  void print(std::ostream* s, int depth, const char prefix) {
+
32  valued_argument::print(s, depth, prefix);
+
33  _values.at(_cursor)->print(s, depth + 1, prefix);
+
34  }
+
35 
+
36  void print_help(std::ostream* s, int depth, bool recurse) {
+
37  _default = _values.at(_default_cursor)->name();
+
38 
+ +
40 
+
41  if (recurse) {
+
42  for (std::vector<argument*>::iterator it = _values.begin();
+
43  it != _values.end(); ++it)
+
44  (*it)->print_help(s, depth + 1, true);
+
45  }
+
46  }
+
47 
+
48  bool parse_args(std::vector<std::string>& args, std::ostream* out,
+
49  std::ostream* err, bool& help_flag) {
+
50 
+
51  if(args.size() == 0) return true;
+
52 
+
53  std::string name;
+
54  std::string value;
+
55  split_arg(args.back(), name, value);
+
56 
+
57  if(_name == "help") {
+
58  print_help(out, 0, false);
+
59  help_flag |= true;
+
60  args.clear();
+
61  return false;
+
62  }
+
63  else if(_name == "help-all") {
+
64  print_help(out, 0, true);
+
65  help_flag |= true;
+
66  args.clear();
+
67  return false;
+
68  }
+
69  else if(_name == name) {
+
70 
+
71  args.pop_back();
+
72 
+
73  bool good_arg = false;
+
74  bool valid_arg = true;
+
75 
+
76  for (size_t i = 0; i < _values.size(); ++i) {
+
77  if( _values.at(i)->name() != value) continue;
+
78 
+
79  _cursor = i;
+
80  valid_arg &= _values.at(_cursor)->parse_args(args, out, err, help_flag);
+
81  good_arg = true;
+
82  break;
+
83  }
+
84 
+
85  if(!good_arg) {
+
86 
+
87  if(err) {
+
88  *err << value << " is not a valid value for \"" << _name << "\"" << std::endl;
+
89  *err << std::string(indent_width, ' ') << "Valid values:" << print_valid() << std::endl;
+
90  }
+
91 
+
92  args.clear();
+
93  }
+
94 
+
95  return valid_arg && good_arg;
+
96 
+
97  }
+
98 
+
99  return true;
+
100 
+
101  };
+
102 
+
103  virtual void probe_args(argument* base_arg, std::stringstream& s) {
+
104 
+
105  for (size_t i = 0; i < _values.size(); ++i) {
+
106  _cursor = i;
+
107 
+
108  s << "good" << std::endl;
+
109  base_arg->print(&s, 0, '\0');
+
110  s << std::endl;
+
111 
+
112  _values.at(i)->probe_args(base_arg, s);
+
113  }
+
114 
+
115  _values.push_back(new arg_fail);
+
116  _cursor = _values.size() - 1;
+
117  s << "bad" << std::endl;
+
118  base_arg->print(&s, 0, '\0');
+
119  s << std::endl;
+
120 
+
121  _values.pop_back();
+ +
123 
+
124  }
+
125 
+
126  void find_arg(std::string name,
+
127  std::string prefix,
+
128  std::vector<std::string>& valid_paths) {
+
129 
+
130  if (name == _name) {
+
131  valid_paths.push_back(prefix + _name + "=<list_element>");
+
132  }
+
133 
+
134  prefix += _name + "=";
+
135  for (std::vector<argument*>::iterator it = _values.begin();
+
136  it != _values.end(); ++it) {
+
137  std::string value_prefix = prefix + (*it)->name() + " ";
+
138  (*it)->find_arg(name, prefix, valid_paths);
+
139  }
+
140 
+
141  }
+
142 
+
143  bool valid_value(std::string name) {
+
144  for (std::vector<argument*>::iterator it = _values.begin();
+
145  it != _values.end(); ++it)
+
146  if (name == (*it)->name())
+
147  return true;
+
148  return false;
+
149  }
+
150 
+
151  argument* arg(std::string name) {
+
152  if(name == _values.at(_cursor)->name())
+
153  return _values.at(_cursor);
+
154  else
+
155  return 0;
+
156  }
+
157 
+
158  std::vector<argument*>& values() { return _values; }
+
159 
+
160  std::string value() { return _values.at(_cursor)->name(); }
+
161 
+
162  std::string print_value() { return _values.at(_cursor)->name(); }
+
163 
+
164  std::string print_valid() {
+
165  std::string valid_values;
+
166 
+
167  std::vector<argument*>::iterator it = _values.begin();
+
168  valid_values += " " + (*it)->name();
+
169  ++it;
+
170 
+
171  for (; it != _values.end(); ++it)
+
172  valid_values += ", " + (*it)->name();
+
173 
+
174  return valid_values;
+
175 
+
176  }
+
177 
+
178  bool is_default() { return _cursor == _default_cursor; }
+
179 
+
180  protected:
+
181 
+
182  int _cursor;
+ +
184 
+
185  std::vector<argument*> _values;
+
186 
+
187  };
+
188 
+
189  } // gm
+
190 
+
191 } // stan
+
192 
+
193 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/lkj__corr_8hpp.html b/doc/api/html/lkj__corr_8hpp.html new file mode 100644 index 00000000000..e45be7c61fc --- /dev/null +++ b/doc/api/html/lkj__corr_8hpp.html @@ -0,0 +1,156 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/continuous/lkj_corr.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
lkj_corr.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + + + + + + + + + +

+Functions

template<typename T_shape >
T_shape stan::prob::do_lkj_constant (const T_shape &eta, const unsigned int &K)
 
template<bool propto, typename T_covar , typename T_shape >
boost::math::tools::promote_args
+< T_covar, T_shape >::type 
stan::prob::lkj_corr_cholesky_log (const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &L, const T_shape &eta)
 
template<typename T_covar , typename T_shape >
boost::math::tools::promote_args
+< T_covar, T_shape >::type 
stan::prob::lkj_corr_cholesky_log (const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &L, const T_shape &eta)
 
template<bool propto, typename T_y , typename T_shape >
boost::math::tools::promote_args
+< T_y, T_shape >::type 
stan::prob::lkj_corr_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const T_shape &eta)
 
template<typename T_y , typename T_shape >
boost::math::tools::promote_args
+< T_y, T_shape >::type 
stan::prob::lkj_corr_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const T_shape &eta)
 
template<class RNG >
Eigen::MatrixXd stan::prob::lkj_corr_cholesky_rng (const size_t K, const double eta, RNG &rng)
 
template<class RNG >
Eigen::MatrixXd stan::prob::lkj_corr_rng (const size_t K, const double eta, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/lkj__corr_8hpp_source.html b/doc/api/html/lkj__corr_8hpp_source.html new file mode 100644 index 00000000000..47771348c6c --- /dev/null +++ b/doc/api/html/lkj__corr_8hpp_source.html @@ -0,0 +1,291 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/continuous/lkj_corr.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
lkj_corr.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__MULTIVARIATE__CONTINUOUS__LKJ_CORR_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__MULTIVARIATE__CONTINUOUS__LKJ_CORR_HPP__
+
3 
+ + + +
7 #include <stan/prob/traits.hpp>
+ + +
10 
+
11 namespace stan {
+
12  namespace prob {
+
13 
+
14  template <typename T_shape>
+
15  T_shape do_lkj_constant(const T_shape& eta, const unsigned int& K) {
+
16 
+
17  // Lewandowski, Kurowicka, and Joe (2009) equations 15 and 16
+
18 
+
19  if (stan::is_constant<typename stan::scalar_type<T_shape> >::value
+
20  && eta == 1.0) {
+
21  double sum = 0.0;
+
22  double constant = 0.0;
+
23  double beta_arg = 0.0;
+
24  for (unsigned int k = 1; k < K; k++) { // yes, go from 1 to K - 1
+
25  beta_arg = 0.5 * (k + 1.0);
+
26  constant += k * (2.0 * lgamma(beta_arg) - lgamma(2.0 * beta_arg));
+
27  sum += pow(static_cast<double>(k),2.0);
+
28  }
+
29  constant += sum * LOG_TWO;
+
30  return constant;
+
31  }
+
32  T_shape sum = 0.0;
+
33  T_shape constant = 0.0;
+
34  T_shape beta_arg;
+
35  for (unsigned int k = 1; k < K; k++) { // yes, go from 1 to K - 1
+
36  unsigned int diff = K - k;
+
37  beta_arg = eta + 0.5 * (diff - 1);
+
38  constant += diff * (2.0 * lgamma(beta_arg) - lgamma(2.0 * beta_arg));
+
39  sum += (2.0 * eta - 2.0 + diff) * diff;
+
40  }
+
41  constant += sum * LOG_TWO;
+
42  return constant;
+
43  }
+
44 
+
45  // LKJ_Corr(L|eta) [ L Cholesky factor of correlation matrix
+
46  // eta > 0; eta == 1 <-> uniform]
+
47  template <bool propto,
+
48  typename T_covar, typename T_shape>
+
49  typename boost::math::tools::promote_args<T_covar, T_shape>::type
+ +
51  const Eigen::Matrix<T_covar,Eigen::Dynamic,Eigen::Dynamic>& L,
+
52  const T_shape& eta) {
+
53 
+
54  static const char* function
+
55  = "stan::prob::lkj_corr_cholesky_log(%1%)";
+
56 
+
57  using boost::math::tools::promote_args;
+ +
59 
+
60  typename promote_args<T_covar,T_shape>::type lp(0.0);
+
61  if (!check_positive(function, eta, "Shape parameter", &lp))
+
62  return lp;
+
63 
+
64  const unsigned int K = L.rows();
+
65  if (K == 0)
+
66  return 0.0;
+
67 
+ +
69  lp += do_lkj_constant(eta, K);
+ +
71  if ( (eta == 1.0) &&
+ +
73  return lp;
+
74  lp += (eta - 1.0) * 2.0 * L.diagonal().array().log().sum();
+
75  }
+
76 
+
77  return lp;
+
78  }
+
79 
+
80  template <typename T_covar, typename T_shape>
+
81  inline
+
82  typename boost::math::tools::promote_args<T_covar, T_shape>::type
+ +
84  const Eigen::Matrix<T_covar,Eigen::Dynamic,Eigen::Dynamic>& L,
+
85  const T_shape& eta) {
+
86  return lkj_corr_cholesky_log<false>(L,eta);
+
87  }
+
88 
+
89  // LKJ_Corr(y|eta) [ y correlation matrix (not covariance matrix)
+
90  // eta > 0; eta == 1 <-> uniform]
+
91  template <bool propto,
+
92  typename T_y, typename T_shape>
+
93  typename boost::math::tools::promote_args<T_y, T_shape>::type
+
94  lkj_corr_log(const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& y,
+
95  const T_shape& eta) {
+
96  static const char* function = "stan::prob::lkj_corr_log(%1%)";
+
97 
+ + + + +
102  using boost::math::tools::promote_args;
+
103 
+
104  typename promote_args<T_y,T_shape>::type lp;
+
105  if (!check_positive(function, eta, "Shape parameter", &lp))
+
106  return lp;
+
107  if (!check_size_match(function,
+
108  y.rows(), "Rows of correlation matrix",
+
109  y.cols(), "columns of correlation matrix",
+
110  &lp))
+
111  return lp;
+
112  if (!check_not_nan(function, y, "Correlation matrix", &lp))
+
113  return lp;
+
114  if (!check_corr_matrix(function, y, "Correlation matrix", &lp)) {
+
115  return lp;
+
116  }
+
117 
+
118  const unsigned int K = y.rows();
+
119  if (K == 0)
+
120  return 0.0;
+
121 
+
122  Eigen::LLT< Eigen::Matrix<T_y, Eigen::Dynamic, Eigen::Dynamic> > Cholesky = y.llt();
+
123  // FIXME: check_numerical_issue function?
+
124  if (Cholesky.info() == Eigen::NumericalIssue)
+
125  return lp;
+
126 
+
127  Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic> L = Cholesky.matrixL();
+
128  return lkj_corr_cholesky_log<propto>(L, eta);
+
129  }
+
130 
+
131  template <typename T_y, typename T_shape>
+
132  inline
+
133  typename boost::math::tools::promote_args<T_y, T_shape>::type
+
134  lkj_corr_log(const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& y,
+
135  const T_shape& eta) {
+
136  return lkj_corr_log<false>(y,eta);
+
137  }
+
138 
+
139  template <class RNG>
+
140  inline Eigen::MatrixXd
+
141  lkj_corr_cholesky_rng(const size_t K,
+
142  const double eta,
+
143  RNG& rng) {
+
144  static const char* function
+
145  = "stan::prob::lkj_corr_cholesky_rng(%1%)";
+
146 
+ +
148 
+
149  check_positive(function, eta, "Shape parameter");
+
150 
+
151  Eigen::ArrayXd CPCs( (K * (K - 1)) / 2 );
+
152  double alpha = eta + 0.5 * (K - 1);
+
153  unsigned int count = 0;
+
154  for (size_t i = 0; i < (K - 1); i++) {
+
155  alpha -= 0.5;
+
156  for (size_t j = i + 1; j < K; j++) {
+
157  CPCs(count) = 2.0 * stan::prob::beta_rng(alpha,alpha,rng) - 1.0;
+
158  count++;
+
159  }
+
160  }
+
161  return stan::prob::read_corr_L(CPCs, K);
+
162  }
+
163 
+
164  template <class RNG>
+
165  inline Eigen::MatrixXd
+
166  lkj_corr_rng(const size_t K,
+
167  const double eta,
+
168  RNG& rng) {
+
169 
+
170  static const char* function
+
171  = "stan::prob::lkj_corr_rng(%1%)";
+
172 
+ +
174 
+
175  check_positive(function, eta, "Shape parameter");
+
176 
+ + +
179  lkj_corr_cholesky_rng(K, eta, rng) );
+
180  }
+
181 
+
182  }
+
183 }
+
184 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/lkj__cov_8hpp.html b/doc/api/html/lkj__cov_8hpp.html new file mode 100644 index 00000000000..8af418acad0 --- /dev/null +++ b/doc/api/html/lkj__cov_8hpp.html @@ -0,0 +1,153 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/continuous/lkj_cov.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
lkj_cov.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + +

+Functions

template<bool propto, typename T_y , typename T_loc , typename T_scale , typename T_shape >
boost::math::tools::promote_args
+< T_y, T_loc, T_scale, T_shape >
+::type 
stan::prob::lkj_cov_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_scale, Eigen::Dynamic, 1 > &sigma, const T_shape &eta)
 
template<typename T_y , typename T_loc , typename T_scale , typename T_shape >
boost::math::tools::promote_args
+< T_y, T_loc, T_scale, T_shape >
+::type 
stan::prob::lkj_cov_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_scale, Eigen::Dynamic, 1 > &sigma, const T_shape &eta)
 
template<bool propto, typename T_y , typename T_loc , typename T_scale , typename T_shape >
boost::math::tools::promote_args
+< T_y, T_loc, T_scale, T_shape >
+::type 
stan::prob::lkj_cov_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const T_loc &mu, const T_scale &sigma, const T_shape &eta)
 
template<typename T_y , typename T_loc , typename T_scale , typename T_shape >
boost::math::tools::promote_args
+< T_y, T_loc, T_scale, T_shape >
+::type 
stan::prob::lkj_cov_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const T_loc &mu, const T_scale &sigma, const T_shape &eta)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/lkj__cov_8hpp_source.html b/doc/api/html/lkj__cov_8hpp_source.html new file mode 100644 index 00000000000..1dbcb12a278 --- /dev/null +++ b/doc/api/html/lkj__cov_8hpp_source.html @@ -0,0 +1,252 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/continuous/lkj_cov.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
lkj_cov.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__MULTIVARIATE__CONTINUOUS__LKJ_COV_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__MULTIVARIATE__CONTINUOUS__LKJ_COV_HPP__
+
3 
+ +
5 #include <stan/math/matrix.hpp>
+ + +
8 #include <stan/meta/traits.hpp>
+
9 #include <stan/prob/traits.hpp>
+
10 
+ + +
13 
+
14 namespace stan {
+
15 
+
16  namespace prob {
+
17 
+
18  // LKJ_cov(y|mu,sigma,eta) [ y covariance matrix (not correlation matrix)
+
19  // mu vector, sigma > 0 vector, eta > 0 ]
+
20  template <bool propto,
+
21  typename T_y, typename T_loc, typename T_scale, typename T_shape>
+
22  typename boost::math::tools::promote_args<T_y,T_loc,T_scale,T_shape>::type
+
23  lkj_cov_log(const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& y,
+
24  const Eigen::Matrix<T_loc,Eigen::Dynamic,1>& mu,
+
25  const Eigen::Matrix<T_scale,Eigen::Dynamic,1>& sigma,
+
26  const T_shape& eta) {
+
27  static const char* function = "stan::prob::lkj_cov_log(%1%)";
+
28 
+ + + +
32  using boost::math::tools::promote_args;
+
33 
+
34  typename promote_args<T_y,T_loc,T_scale,T_shape>::type lp(0.0);
+
35  if (!check_size_match(function,
+
36  mu.rows(), "Rows of location parameter",
+
37  sigma.rows(), "columns of scale parameter",
+
38  &lp))
+
39  return lp;
+
40  if (!check_size_match(function,
+
41  y.rows(), "Rows of random variable",
+
42  y.cols(), "columns of random variable",
+
43  &lp))
+
44  return lp;
+
45  if (!check_size_match(function,
+
46  y.rows(), "Rows of random variable",
+
47  mu.rows(), "rows of location parameter",
+
48  &lp))
+
49  return lp;
+
50  if (!check_positive(function, eta, "Shape parameter", &lp))
+
51  return lp;
+
52  if (!check_finite(function, mu, "Location parameter", &lp))
+
53  return lp;
+
54  if (!check_finite(function, sigma, "Scale parameter", &lp))
+
55  return lp;
+
56  // FIXME: build vectorized versions
+
57  for (int m = 0; m < y.rows(); ++m)
+
58  for (int n = 0; n < y.cols(); ++n)
+
59  if (!check_finite(function, y(m,n), "Covariance matrix", &lp))
+
60  return lp;
+
61 
+
62  const unsigned int K = y.rows();
+
63  const Eigen::Array<T_y,Eigen::Dynamic,1> sds
+
64  = y.diagonal().array().sqrt();
+
65  for (unsigned int k = 0; k < K; k++) {
+
66  lp += lognormal_log<propto>(sds(k), mu(k), sigma(k));
+
67  }
+
68  if (stan::is_constant<typename stan::scalar_type<T_shape> >::value
+
69  && eta == 1.0) {
+
70  // no need to rescale y into a correlation matrix
+
71  lp += lkj_corr_log<propto,T_y,T_shape>(y, eta);
+
72  return lp;
+
73  }
+
74  Eigen::DiagonalMatrix<T_y,Eigen::Dynamic> D(K);
+
75  D.diagonal() = sds.inverse();
+
76  lp += lkj_corr_log<propto,T_y,T_shape>(D * y * D, eta);
+
77  return lp;
+
78  }
+
79 
+
80  template <typename T_y, typename T_loc, typename T_scale, typename T_shape>
+
81  inline
+
82  typename boost::math::tools::promote_args<T_y,T_loc,T_scale,T_shape>::type
+
83  lkj_cov_log(const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& y,
+
84  const Eigen::Matrix<T_loc,Eigen::Dynamic,1>& mu,
+
85  const Eigen::Matrix<T_scale,Eigen::Dynamic,1>& sigma,
+
86  const T_shape& eta) {
+
87  return lkj_cov_log<false>(y,mu,sigma,eta);
+
88  }
+
89 
+
90  // LKJ_Cov(y|mu,sigma,eta) [ y covariance matrix (not correlation matrix)
+
91  // mu scalar, sigma > 0 scalar, eta > 0 ]
+
92  template <bool propto,
+
93  typename T_y, typename T_loc, typename T_scale, typename T_shape>
+
94  typename boost::math::tools::promote_args<T_y,T_loc,T_scale,T_shape>::type
+
95  lkj_cov_log(const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& y,
+
96  const T_loc& mu,
+
97  const T_scale& sigma,
+
98  const T_shape& eta) {
+
99  static const char* function = "stan::prob::lkj_cov_log(%1%)";
+
100 
+ + +
103  using boost::math::tools::promote_args;
+
104 
+
105  typename promote_args<T_y,T_loc,T_scale,T_shape>::type lp(0.0);
+
106  if (!check_positive(function, eta, "Shape parameter", &lp))
+
107  return lp;
+
108  if (!check_finite(function, mu, "Location parameter", &lp))
+
109  return lp;
+
110  if (!check_finite(function, sigma, "Scale parameter",
+
111  &lp))
+
112  return lp;
+
113 
+
114  const unsigned int K = y.rows();
+
115  const Eigen::Array<T_y,Eigen::Dynamic,1> sds
+
116  = y.diagonal().array().sqrt();
+
117  for (unsigned int k = 0; k < K; k++) {
+
118  lp += lognormal_log<propto>(sds(k), mu, sigma);
+
119  }
+
120  if (stan::is_constant<typename stan::scalar_type<T_shape> >::value
+
121  && eta == 1.0) {
+
122  // no need to rescale y into a correlation matrix
+
123  lp += lkj_corr_log<propto>(y,eta);
+
124  return lp;
+
125  }
+
126  Eigen::DiagonalMatrix<T_y,Eigen::Dynamic> D(K);
+
127  D.diagonal() = sds.inverse();
+
128  lp += lkj_corr_log<propto,T_y,T_shape>(D * y * D, eta);
+
129  return lp;
+
130  }
+
131 
+
132  template <typename T_y, typename T_loc, typename T_scale, typename T_shape>
+
133  inline
+
134  typename boost::math::tools::promote_args<T_y,T_loc,T_scale,T_shape>::type
+
135  lkj_cov_log(const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& y,
+
136  const T_loc& mu,
+
137  const T_scale& sigma,
+
138  const T_shape& eta) {
+
139  return lkj_cov_log<false>(y,mu,sigma,eta);
+
140  }
+
141 
+
142 
+
143  }
+
144 }
+
145 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/logical__and_8hpp.html b/doc/api/html/logical__and_8hpp.html new file mode 100644 index 00000000000..6efbf446436 --- /dev/null +++ b/doc/api/html/logical__and_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/functions/logical_and.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
logical_and.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T1 , typename T2 >
int stan::math::logical_and (const T1 x1, const T2 x2)
 The logical and function which returns 1 if both arguments are unequal to zero and 0 otherwise.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/logical__and_8hpp_source.html b/doc/api/html/logical__and_8hpp_source.html new file mode 100644 index 00000000000..fae9021658a --- /dev/null +++ b/doc/api/html/logical__and_8hpp_source.html @@ -0,0 +1,123 @@ + + + + + +Stan: src/stan/math/functions/logical_and.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
logical_and.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__LOGICAL_AND_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__LOGICAL_AND_HPP__
+
3 
+
4 namespace stan {
+
5  namespace math {
+
6 
+
19  template <typename T1, typename T2>
+
20  inline int
+
21  logical_and(const T1 x1, const T2 x2) {
+
22  return (x1 != 0) && (x2 != 0);
+
23  }
+
24 
+
25  }
+
26 }
+
27 
+
28 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/logical__eq_8hpp.html b/doc/api/html/logical__eq_8hpp.html new file mode 100644 index 00000000000..2994ccaa797 --- /dev/null +++ b/doc/api/html/logical__eq_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/functions/logical_eq.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
logical_eq.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T1 , typename T2 >
int stan::math::logical_eq (const T1 x1, const T2 x2)
 Return 1 if the first argument is equal to the second.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/logical__eq_8hpp_source.html b/doc/api/html/logical__eq_8hpp_source.html new file mode 100644 index 00000000000..620a75d92c8 --- /dev/null +++ b/doc/api/html/logical__eq_8hpp_source.html @@ -0,0 +1,123 @@ + + + + + +Stan: src/stan/math/functions/logical_eq.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
logical_eq.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__LOGICAL_EQ_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__LOGICAL_EQ_HPP__
+
3 
+
4 namespace stan {
+
5  namespace math {
+
6 
+
17  template <typename T1, typename T2>
+
18  inline int
+
19  logical_eq(const T1 x1, const T2 x2) {
+
20  return x1 == x2;
+
21  }
+
22 
+
23  }
+
24 }
+
25 
+
26 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/logical__gt_8hpp.html b/doc/api/html/logical__gt_8hpp.html new file mode 100644 index 00000000000..77c9679343a --- /dev/null +++ b/doc/api/html/logical__gt_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/functions/logical_gt.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
logical_gt.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T1 , typename T2 >
int stan::math::logical_gt (const T1 x1, const T2 x2)
 Return 1 if the first argument is strictly greater than the second.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/logical__gt_8hpp_source.html b/doc/api/html/logical__gt_8hpp_source.html new file mode 100644 index 00000000000..215a7c98d2d --- /dev/null +++ b/doc/api/html/logical__gt_8hpp_source.html @@ -0,0 +1,123 @@ + + + + + +Stan: src/stan/math/functions/logical_gt.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
logical_gt.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__LOGICAL_GT_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__LOGICAL_GT_HPP__
+
3 
+
4 namespace stan {
+
5  namespace math {
+
6 
+
17  template <typename T1, typename T2>
+
18  inline int
+
19  logical_gt(const T1 x1, const T2 x2) {
+
20  return x1 > x2;
+
21  }
+
22 
+
23  }
+
24 }
+
25 
+
26 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/logical__gte_8hpp.html b/doc/api/html/logical__gte_8hpp.html new file mode 100644 index 00000000000..291f1df3921 --- /dev/null +++ b/doc/api/html/logical__gte_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/functions/logical_gte.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
logical_gte.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T1 , typename T2 >
int stan::math::logical_gte (const T1 x1, const T2 x2)
 Return 1 if the first argument is greater than or equal to the second.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/logical__gte_8hpp_source.html b/doc/api/html/logical__gte_8hpp_source.html new file mode 100644 index 00000000000..9dfa6a6342f --- /dev/null +++ b/doc/api/html/logical__gte_8hpp_source.html @@ -0,0 +1,123 @@ + + + + + +Stan: src/stan/math/functions/logical_gte.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
logical_gte.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__LOGICAL_GTE_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__LOGICAL_GTE_HPP__
+
3 
+
4 namespace stan {
+
5  namespace math {
+
6 
+
17  template <typename T1, typename T2>
+
18  inline int
+
19  logical_gte(const T1 x1, const T2 x2) {
+
20  return x1 >= x2;
+
21  }
+
22 
+
23  }
+
24 }
+
25 
+
26 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/logical__lt_8hpp.html b/doc/api/html/logical__lt_8hpp.html new file mode 100644 index 00000000000..ea88de941a1 --- /dev/null +++ b/doc/api/html/logical__lt_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/functions/logical_lt.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
logical_lt.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T1 , typename T2 >
int stan::math::logical_lt (T1 x1, T2 x2)
 Return 1 if the first argument is strictly less than the second.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/logical__lt_8hpp_source.html b/doc/api/html/logical__lt_8hpp_source.html new file mode 100644 index 00000000000..6c38f3b3121 --- /dev/null +++ b/doc/api/html/logical__lt_8hpp_source.html @@ -0,0 +1,124 @@ + + + + + +Stan: src/stan/math/functions/logical_lt.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
logical_lt.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__LOGICAL_LT_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__LOGICAL_LT_HPP__
+
3 
+
4 namespace stan {
+
5  namespace math {
+
6 
+
17  template <typename T1, typename T2>
+
18  inline
+
19  int
+
20  logical_lt(T1 x1, T2 x2) {
+
21  return x1 < x2;
+
22  }
+
23 
+
24  }
+
25 }
+
26 
+
27 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/logical__lte_8hpp.html b/doc/api/html/logical__lte_8hpp.html new file mode 100644 index 00000000000..89e03ec0529 --- /dev/null +++ b/doc/api/html/logical__lte_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/functions/logical_lte.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
logical_lte.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T1 , typename T2 >
int stan::math::logical_lte (const T1 x1, const T2 x2)
 Return 1 if the first argument is less than or equal to the second.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/logical__lte_8hpp_source.html b/doc/api/html/logical__lte_8hpp_source.html new file mode 100644 index 00000000000..115fb2bb22f --- /dev/null +++ b/doc/api/html/logical__lte_8hpp_source.html @@ -0,0 +1,123 @@ + + + + + +Stan: src/stan/math/functions/logical_lte.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
logical_lte.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__LOGICAL_LTE_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__LOGICAL_LTE_HPP__
+
3 
+
4 namespace stan {
+
5  namespace math {
+
6 
+
17  template <typename T1, typename T2>
+
18  inline int
+
19  logical_lte(const T1 x1, const T2 x2) {
+
20  return x1 <= x2;
+
21  }
+
22 
+
23  }
+
24 }
+
25 
+
26 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/logical__negation_8hpp.html b/doc/api/html/logical__negation_8hpp.html new file mode 100644 index 00000000000..57938a03b9a --- /dev/null +++ b/doc/api/html/logical__negation_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/functions/logical_negation.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
logical_negation.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
int stan::math::logical_negation (const T x)
 The logical negation function which returns 1 if the input is equal to zero and 0 otherwise.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/logical__negation_8hpp_source.html b/doc/api/html/logical__negation_8hpp_source.html new file mode 100644 index 00000000000..bbb5d970ffd --- /dev/null +++ b/doc/api/html/logical__negation_8hpp_source.html @@ -0,0 +1,123 @@ + + + + + +Stan: src/stan/math/functions/logical_negation.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
logical_negation.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__LOGICAL_NEGATION_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__LOGICAL_NEGATION_HPP__
+
3 
+
4 namespace stan {
+
5  namespace math {
+
6 
+
15  template <typename T>
+
16  inline int
+
17  logical_negation(const T x) {
+
18  return (x == 0);
+
19  }
+
20 
+
21  }
+
22 }
+
23 
+
24 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/logical__neq_8hpp.html b/doc/api/html/logical__neq_8hpp.html new file mode 100644 index 00000000000..3157d7b9ffd --- /dev/null +++ b/doc/api/html/logical__neq_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/functions/logical_neq.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
logical_neq.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T1 , typename T2 >
int stan::math::logical_neq (const T1 x1, const T2 x2)
 Return 1 if the first argument is unequal to the second.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/logical__neq_8hpp_source.html b/doc/api/html/logical__neq_8hpp_source.html new file mode 100644 index 00000000000..c62ebdf789f --- /dev/null +++ b/doc/api/html/logical__neq_8hpp_source.html @@ -0,0 +1,122 @@ + + + + + +Stan: src/stan/math/functions/logical_neq.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
logical_neq.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__LOGICAL_NEQ_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__LOGICAL_NEQ_HPP__
+
3 
+
4 namespace stan {
+
5  namespace math {
+
6 
+
17  template <typename T1, typename T2>
+
18  inline int
+
19  logical_neq(const T1 x1, const T2 x2) {
+
20  return x1 != x2;
+
21  }
+
22 
+
23  }
+
24 }
+
25 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/logical__or_8hpp.html b/doc/api/html/logical__or_8hpp.html new file mode 100644 index 00000000000..29a57671f8a --- /dev/null +++ b/doc/api/html/logical__or_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/functions/logical_or.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
logical_or.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T1 , typename T2 >
int stan::math::logical_or (T1 x1, T2 x2)
 The logical or function which returns 1 if either argument is unequal to zero and 0 otherwise.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/logical__or_8hpp_source.html b/doc/api/html/logical__or_8hpp_source.html new file mode 100644 index 00000000000..b5fff1d0a57 --- /dev/null +++ b/doc/api/html/logical__or_8hpp_source.html @@ -0,0 +1,123 @@ + + + + + +Stan: src/stan/math/functions/logical_or.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
logical_or.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__LOGICAL_OR_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__LOGICAL_OR_HPP__
+
3 
+
4 namespace stan {
+
5  namespace math {
+
6 
+
18  template <typename T1, typename T2>
+
19  inline int
+
20  logical_or(T1 x1, T2 x2) {
+
21  return (x1 != 0) || (x2 != 0);
+
22  }
+
23 
+
24  }
+
25 }
+
26 
+
27 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/logistic_8hpp.html b/doc/api/html/logistic_8hpp.html new file mode 100644 index 00000000000..fab0bd14da6 --- /dev/null +++ b/doc/api/html/logistic_8hpp.html @@ -0,0 +1,157 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/logistic.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
logistic.hpp File Reference
+
+
+
#include <boost/random/exponential_distribution.hpp>
+#include <boost/random/variate_generator.hpp>
+#include <stan/agrad/partials_vari.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/math/constants.hpp>
+#include <stan/math/functions/value_of.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/prob/constants.hpp>
+#include <stan/prob/traits.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + + + + + + +

+Functions

template<bool propto, typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
stan::prob::logistic_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
stan::prob::logistic_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
stan::prob::logistic_cdf (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
stan::prob::logistic_cdf_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
stan::prob::logistic_ccdf_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<class RNG >
double stan::prob::logistic_rng (const double mu, const double sigma, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/logistic_8hpp_source.html b/doc/api/html/logistic_8hpp_source.html new file mode 100644 index 00000000000..af2ce1ce689 --- /dev/null +++ b/doc/api/html/logistic_8hpp_source.html @@ -0,0 +1,546 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/logistic.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
logistic.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS__LOGISTIC_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS__LOGISTIC_HPP__
+
3 
+
4 #include <boost/random/exponential_distribution.hpp>
+
5 #include <boost/random/variate_generator.hpp>
+
6 
+ + + + +
11 #include <stan/meta/traits.hpp>
+
12 #include <stan/prob/constants.hpp>
+
13 #include <stan/prob/traits.hpp>
+
14 
+
15 namespace stan {
+
16  namespace prob {
+
17 
+
18  // Logistic(y|mu,sigma) [sigma > 0]
+
19  // FIXME: document
+
20  template <bool propto,
+
21  typename T_y, typename T_loc, typename T_scale>
+
22  typename return_type<T_y,T_loc,T_scale>::type
+
23  logistic_log(const T_y& y, const T_loc& mu, const T_scale& sigma) {
+
24  static const char* function = "stan::prob::logistic_log(%1%)";
+
25 
+ + + + + +
31 
+
32  // check if any vectors are zero length
+
33  if (!(stan::length(y)
+
34  && stan::length(mu)
+
35  && stan::length(sigma)))
+
36  return 0.0;
+
37 
+
38 
+
39  // set up return value accumulator
+
40  double logp(0.0);
+
41 
+
42  // validate args (here done over var, which should be OK)
+
43  if (!check_finite(function, y, "Random variable", &logp))
+
44  return logp;
+
45  if (!check_finite(function, mu, "Location parameter",
+
46  &logp))
+
47  return logp;
+
48  if (!check_finite(function, sigma, "Scale parameter", &logp))
+
49  return logp;
+
50  if (!check_positive(function, sigma, "Scale parameter",
+
51  &logp))
+
52  return logp;
+
53  if (!(check_consistent_sizes(function,
+
54  y,mu,sigma,
+
55  "Random variable","Location parameter",
+
56  "Scale parameter",
+
57  &logp)))
+
58  return logp;
+
59 
+
60  // check if no variables are involved and prop-to
+ +
62  return 0.0;
+
63 
+
64 
+
65  // set up template expressions wrapping scalars into vector views
+ +
67  operands_and_partials(y, mu, sigma);
+
68 
+
69  VectorView<const T_y> y_vec(y);
+
70  VectorView<const T_loc> mu_vec(mu);
+
71  VectorView<const T_scale> sigma_vec(sigma);
+
72  size_t N = max_size(y, mu, sigma);
+
73 
+ +
75  inv_sigma(length(sigma));
+ +
77  is_vector<T_scale>::value> log_sigma(length(sigma));
+
78  for (size_t i = 0; i < length(sigma); i++) {
+
79  inv_sigma[i] = 1.0 / value_of(sigma_vec[i]);
+ +
81  log_sigma[i] = log(value_of(sigma_vec[i]));
+
82  }
+
83 
+ + +
86  exp_mu_div_sigma(max_size(mu,sigma));
+ + +
89  exp_y_div_sigma(max_size(y,sigma));
+ +
91  for (size_t n = 0; n < max_size(mu,sigma); n++)
+
92  exp_mu_div_sigma[n] = exp(value_of(mu_vec[n])
+
93  / value_of(sigma_vec[n]));
+
94  for (size_t n = 0; n < max_size(y,sigma); n++)
+
95  exp_y_div_sigma[n] = exp(value_of(y_vec[n])
+
96  / value_of(sigma_vec[n]));
+
97  }
+
98 
+
99  using stan::math::log1p;
+
100  for (size_t n = 0; n < N; n++) {
+
101  const double y_dbl = value_of(y_vec[n]);
+
102  const double mu_dbl = value_of(mu_vec[n]);
+
103 
+
104  const double y_minus_mu = y_dbl - mu_dbl;
+
105  const double y_minus_mu_div_sigma = y_minus_mu * inv_sigma[n];
+
106  double exp_m_y_minus_mu_div_sigma(0);
+ +
108  exp_m_y_minus_mu_div_sigma = exp(-y_minus_mu_div_sigma);
+
109  double inv_1p_exp_y_minus_mu_div_sigma(0);
+ + +
112  inv_1p_exp_y_minus_mu_div_sigma = 1 / (1 + exp(y_minus_mu_div_sigma));
+
113 
+ +
115  logp -= y_minus_mu_div_sigma;
+ +
117  logp -= log_sigma[n];
+ +
119  logp -= 2.0 * log1p(exp_m_y_minus_mu_div_sigma);
+
120 
+ +
122  operands_and_partials.d_x1[n]
+
123  += (2 * inv_1p_exp_y_minus_mu_div_sigma - 1) * inv_sigma[n];
+ +
125  operands_and_partials.d_x2[n] +=
+
126  (1 - 2 * exp_mu_div_sigma[n] / (exp_mu_div_sigma[n]
+
127  + exp_y_div_sigma[n]))
+
128  * inv_sigma[n];
+ +
130  operands_and_partials.d_x3[n] +=
+
131  ((1 - 2 * inv_1p_exp_y_minus_mu_div_sigma)
+
132  *y_minus_mu*inv_sigma[n] - 1) * inv_sigma[n];
+
133  }
+
134  return operands_and_partials.to_var(logp);
+
135  }
+
136 
+
137  template <typename T_y, typename T_loc, typename T_scale>
+
138  inline
+ +
140  logistic_log(const T_y& y, const T_loc& mu, const T_scale& sigma) {
+
141  return logistic_log<false>(y,mu,sigma);
+
142  }
+
143 
+
144  // Logistic(y|mu,sigma) [sigma > 0]
+
145  template <typename T_y, typename T_loc, typename T_scale>
+ +
147  logistic_cdf(const T_y& y, const T_loc& mu, const T_scale& sigma) {
+
148 
+
149  // Size checks
+
150  if ( !( stan::length(y) && stan::length(mu)
+
151  && stan::length(sigma) ) )
+
152  return 1.0;
+
153 
+
154  // Error checks
+
155  static const char* function = "stan::prob::logistic_cdf(%1%)";
+
156 
+ + + + +
161  using stan::math::value_of;
+
162  using boost::math::tools::promote_args;
+
163 
+
164  double P(1.0);
+
165 
+
166  if (!check_not_nan(function, y, "Random variable", &P))
+
167  return P;
+
168  if (!check_finite(function, mu, "Location parameter", &P))
+
169  return P;
+
170  if (!check_finite(function, sigma, "Scale parameter", &P))
+
171  return P;
+
172  if (!check_positive(function, sigma, "Scale parameter", &P))
+
173  return P;
+
174  if (!(check_consistent_sizes(function, y, mu, sigma,
+
175  "Random variable", "Location parameter",
+
176  "Scale parameter", &P)))
+
177  return P;
+
178 
+
179  // Wrap arguments in vectors
+
180  VectorView<const T_y> y_vec(y);
+
181  VectorView<const T_loc> mu_vec(mu);
+
182  VectorView<const T_scale> sigma_vec(sigma);
+
183  size_t N = max_size(y, mu, sigma);
+
184 
+ +
186  operands_and_partials(y, mu, sigma);
+
187 
+
188  // Explicit return for extreme values
+
189  // The gradients are technically ill-defined, but treated as zero
+
190 
+
191  for (size_t i = 0; i < stan::length(y); i++) {
+
192  if (value_of(y_vec[i]) == -std::numeric_limits<double>::infinity())
+
193  return operands_and_partials.to_var(0.0);
+
194  }
+
195 
+
196  // Compute vectorized CDF and its gradients
+
197  for (size_t n = 0; n < N; n++) {
+
198 
+
199  // Explicit results for extreme values
+
200  // The gradients are technically ill-defined, but treated as zero
+
201  if (value_of(y_vec[n]) == std::numeric_limits<double>::infinity()) {
+
202  continue;
+
203  }
+
204 
+
205  // Pull out values
+
206  const double y_dbl = value_of(y_vec[n]);
+
207  const double mu_dbl = value_of(mu_vec[n]);
+
208  const double sigma_dbl = value_of(sigma_vec[n]);
+
209  const double sigma_inv_vec = 1.0 / value_of(sigma_vec[n]);
+
210 
+
211  // Compute
+
212  const double Pn = 1.0 / ( 1.0 + exp( - (y_dbl - mu_dbl)
+
213  * sigma_inv_vec ) );
+
214 
+
215  P *= Pn;
+
216 
+ +
218  operands_and_partials.d_x1[n]
+
219  += exp(logistic_log(y_dbl, mu_dbl, sigma_dbl)) / Pn;
+ +
221  operands_and_partials.d_x2[n]
+
222  += - exp(logistic_log(y_dbl, mu_dbl, sigma_dbl)) / Pn;
+ +
224  operands_and_partials.d_x3[n] += - (y_dbl - mu_dbl) * sigma_inv_vec
+
225  * exp(logistic_log(y_dbl, mu_dbl, sigma_dbl)) / Pn;
+
226  }
+
227 
+ +
229  for(size_t n = 0; n < stan::length(y); ++n)
+
230  operands_and_partials.d_x1[n] *= P;
+
231  }
+ +
233  for(size_t n = 0; n < stan::length(mu); ++n)
+
234  operands_and_partials.d_x2[n] *= P;
+
235  }
+ +
237  for(size_t n = 0; n < stan::length(sigma); ++n)
+
238  operands_and_partials.d_x3[n] *= P;
+
239  }
+
240 
+
241  return operands_and_partials.to_var(P);
+
242 
+
243  }
+
244 
+
245  template <typename T_y, typename T_loc, typename T_scale>
+ +
247  logistic_cdf_log(const T_y& y, const T_loc& mu, const T_scale& sigma) {
+
248 
+
249  // Size checks
+
250  if ( !( stan::length(y) && stan::length(mu) && stan::length(sigma) ) )
+
251  return 0.0;
+
252 
+
253  // Error checks
+
254  static const char* function = "stan::prob::logistic_cdf_log(%1%)";
+
255 
+ + + + +
260  using stan::math::value_of;
+
261  using boost::math::tools::promote_args;
+
262 
+
263  double P(0.0);
+
264 
+
265  if (!check_not_nan(function, y, "Random variable", &P))
+
266  return P;
+
267  if (!check_finite(function, mu, "Location parameter", &P))
+
268  return P;
+
269  if (!check_finite(function, sigma, "Scale parameter", &P))
+
270  return P;
+
271  if (!check_positive(function, sigma, "Scale parameter", &P))
+
272  return P;
+
273  if (!(check_consistent_sizes(function, y, mu, sigma,
+
274  "Random variable", "Location parameter",
+
275  "Scale parameter", &P)))
+
276  return P;
+
277 
+
278  // Wrap arguments in vectors
+
279  VectorView<const T_y> y_vec(y);
+
280  VectorView<const T_loc> mu_vec(mu);
+
281  VectorView<const T_scale> sigma_vec(sigma);
+
282  size_t N = max_size(y, mu, sigma);
+
283 
+ +
285  operands_and_partials(y, mu, sigma);
+
286 
+
287  // Explicit return for extreme values
+
288  // The gradients are technically ill-defined, but treated as zero
+
289 
+
290  for (size_t i = 0; i < stan::length(y); i++) {
+
291  if (value_of(y_vec[i]) == -std::numeric_limits<double>::infinity())
+
292  return operands_and_partials.to_var(-std::numeric_limits<double>::infinity());
+
293  }
+
294 
+
295  // Compute vectorized cdf_log and its gradients
+
296  for (size_t n = 0; n < N; n++) {
+
297 
+
298  // Explicit results for extreme values
+
299  // The gradients are technically ill-defined, but treated as zero
+
300  if (value_of(y_vec[n]) == std::numeric_limits<double>::infinity()) {
+
301  continue;
+
302  }
+
303 
+
304  // Pull out values
+
305  const double y_dbl = value_of(y_vec[n]);
+
306  const double mu_dbl = value_of(mu_vec[n]);
+
307  const double sigma_dbl = value_of(sigma_vec[n]);
+
308  const double sigma_inv_vec = 1.0 / value_of(sigma_vec[n]);
+
309 
+
310  // Compute
+
311  const double Pn = 1.0 / ( 1.0 + exp( - (y_dbl - mu_dbl)
+
312  * sigma_inv_vec ) );
+
313  P += log(Pn);
+
314 
+ +
316  operands_and_partials.d_x1[n]
+
317  += exp(logistic_log(y_dbl, mu_dbl, sigma_dbl)) / Pn;
+ +
319  operands_and_partials.d_x2[n]
+
320  += - exp(logistic_log(y_dbl, mu_dbl, sigma_dbl)) / Pn;
+ +
322  operands_and_partials.d_x3[n] += - (y_dbl - mu_dbl) * sigma_inv_vec
+
323  * exp(logistic_log(y_dbl, mu_dbl, sigma_dbl)) / Pn;
+
324  }
+
325 
+
326  return operands_and_partials.to_var(P);
+
327  }
+
328 
+
329  template <typename T_y, typename T_loc, typename T_scale>
+ +
331  logistic_ccdf_log(const T_y& y, const T_loc& mu, const T_scale& sigma) {
+
332 
+
333  // Size checks
+
334  if ( !( stan::length(y) && stan::length(mu) && stan::length(sigma) ) )
+
335  return 0.0;
+
336 
+
337  // Error checks
+
338  static const char* function = "stan::prob::logistic_cdf_log(%1%)";
+
339 
+ + + + +
344  using stan::math::value_of;
+
345  using boost::math::tools::promote_args;
+
346 
+
347  double P(0.0);
+
348 
+
349  if (!check_not_nan(function, y, "Random variable", &P))
+
350  return P;
+
351  if (!check_finite(function, mu, "Location parameter", &P))
+
352  return P;
+
353  if (!check_finite(function, sigma, "Scale parameter", &P))
+
354  return P;
+
355  if (!check_positive(function, sigma, "Scale parameter", &P))
+
356  return P;
+
357  if (!(check_consistent_sizes(function, y, mu, sigma,
+
358  "Random variable", "Location parameter",
+
359  "Scale parameter", &P)))
+
360  return P;
+
361 
+
362  // Wrap arguments in vectors
+
363  VectorView<const T_y> y_vec(y);
+
364  VectorView<const T_loc> mu_vec(mu);
+
365  VectorView<const T_scale> sigma_vec(sigma);
+
366  size_t N = max_size(y, mu, sigma);
+
367 
+ +
369  operands_and_partials(y, mu, sigma);
+
370 
+
371  // Explicit return for extreme values
+
372  // The gradients are technically ill-defined, but treated as zero
+
373 
+
374  for (size_t i = 0; i < stan::length(y); i++) {
+
375  if (value_of(y_vec[i]) == -std::numeric_limits<double>::infinity())
+
376  return operands_and_partials.to_var(0.0);
+
377  }
+
378 
+
379  // Compute vectorized cdf_log and its gradients
+
380  for (size_t n = 0; n < N; n++) {
+
381 
+
382  // Explicit results for extreme values
+
383  // The gradients are technically ill-defined, but treated as zero
+
384  if (value_of(y_vec[n]) == std::numeric_limits<double>::infinity()) {
+
385  return operands_and_partials.to_var(stan::math::negative_infinity());
+
386  }
+
387 
+
388  // Pull out values
+
389  const double y_dbl = value_of(y_vec[n]);
+
390  const double mu_dbl = value_of(mu_vec[n]);
+
391  const double sigma_dbl = value_of(sigma_vec[n]);
+
392  const double sigma_inv_vec = 1.0 / value_of(sigma_vec[n]);
+
393 
+
394  // Compute
+
395  const double Pn = 1.0 - 1.0 / ( 1.0 + exp( - (y_dbl - mu_dbl)
+
396  * sigma_inv_vec ) );
+
397  P += log(Pn);
+
398 
+ +
400  operands_and_partials.d_x1[n]
+
401  -= exp(logistic_log(y_dbl, mu_dbl, sigma_dbl)) / Pn;
+ +
403  operands_and_partials.d_x2[n]
+
404  -= - exp(logistic_log(y_dbl, mu_dbl, sigma_dbl)) / Pn;
+ +
406  operands_and_partials.d_x3[n] -= - (y_dbl - mu_dbl) * sigma_inv_vec
+
407  * exp(logistic_log(y_dbl, mu_dbl, sigma_dbl)) / Pn;
+
408  }
+
409 
+
410  return operands_and_partials.to_var(P);
+
411  }
+
412 
+
413  template <class RNG>
+
414  inline double
+
415  logistic_rng(const double mu,
+
416  const double sigma,
+
417  RNG& rng) {
+
418  using boost::variate_generator;
+
419  using boost::random::exponential_distribution;
+
420 
+
421  static const char* function = "stan::prob::logistic_rng(%1%)";
+
422 
+ + +
425 
+
426  if (!check_finite(function, mu, "Location parameter"))
+
427  return 0;
+
428  if (!check_finite(function, sigma, "Scale parameter"))
+
429  return 0;
+
430  if (!check_positive(function, sigma, "Scale parameter"))
+
431  return 0;
+
432 
+
433  variate_generator<RNG&, exponential_distribution<> >
+
434  exp_rng(rng, exponential_distribution<>(1));
+
435  return mu - sigma * std::log(exp_rng() / exp_rng());
+
436  }
+
437  }
+
438 }
+
439 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/lognormal_8hpp.html b/doc/api/html/lognormal_8hpp.html new file mode 100644 index 00000000000..e61cf00bb0c --- /dev/null +++ b/doc/api/html/lognormal_8hpp.html @@ -0,0 +1,158 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/lognormal.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
lognormal.hpp File Reference
+
+
+
#include <boost/random/lognormal_distribution.hpp>
+#include <boost/random/variate_generator.hpp>
+#include <stan/agrad/partials_vari.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/math/constants.hpp>
+#include <stan/math/functions/value_of.hpp>
+#include <stan/math/functions/square.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/prob/constants.hpp>
+#include <stan/prob/traits.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + + + + + + +

+Functions

template<bool propto, typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
stan::prob::lognormal_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
stan::prob::lognormal_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
stan::prob::lognormal_cdf (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
stan::prob::lognormal_cdf_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
stan::prob::lognormal_ccdf_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<class RNG >
double stan::prob::lognormal_rng (const double mu, const double sigma, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/lognormal_8hpp_source.html b/doc/api/html/lognormal_8hpp_source.html new file mode 100644 index 00000000000..6232ea4bd62 --- /dev/null +++ b/doc/api/html/lognormal_8hpp_source.html @@ -0,0 +1,519 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/lognormal.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
lognormal.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS__LOGNORMAL_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS__LOGNORMAL_HPP__
+
3 
+
4 #include <boost/random/lognormal_distribution.hpp>
+
5 #include <boost/random/variate_generator.hpp>
+
6 
+ + + + + +
12 #include <stan/meta/traits.hpp>
+
13 #include <stan/prob/constants.hpp>
+
14 #include <stan/prob/traits.hpp>
+
15 
+
16 namespace stan {
+
17  namespace prob {
+
18 
+
19  // LogNormal(y|mu,sigma) [y >= 0; sigma > 0]
+
20  // FIXME: document
+
21  template <bool propto,
+
22  typename T_y, typename T_loc, typename T_scale>
+
23  typename return_type<T_y,T_loc,T_scale>::type
+
24  lognormal_log(const T_y& y, const T_loc& mu, const T_scale& sigma) {
+
25  static const char* function = "stan::prob::lognormal_log(%1%)";
+
26 
+ + + + + + + + +
35 
+
36 
+
37  // check if any vectors are zero length
+
38  if (!(stan::length(y)
+
39  && stan::length(mu)
+
40  && stan::length(sigma)))
+
41  return 0.0;
+
42 
+
43  // set up return value accumulator
+
44  double logp(0.0);
+
45 
+
46  // validate args (here done over var, which should be OK)
+
47  if (!check_not_nan(function, y, "Random variable", &logp))
+
48  return logp;
+
49  if (!check_nonnegative(function, y, "Random variable", &logp))
+
50  return logp;
+
51  if (!check_finite(function, mu, "Location parameter",
+
52  &logp))
+
53  return logp;
+
54  if (!check_finite(function, sigma, "Scale parameter",
+
55  &logp))
+
56  return logp;
+
57  if (!check_positive(function, sigma, "Scale parameter",
+
58  &logp))
+
59  return logp;
+
60  if (!(check_consistent_sizes(function,
+
61  y,mu,sigma,
+
62  "Random variable","Location parameter","Scale parameter",
+
63  &logp)))
+
64  return logp;
+
65 
+
66 
+
67  VectorView<const T_y> y_vec(y);
+
68  VectorView<const T_loc> mu_vec(mu);
+
69  VectorView<const T_scale> sigma_vec(sigma);
+
70  size_t N = max_size(y, mu, sigma);
+
71 
+
72  for (size_t n = 0; n < length(y); n++)
+
73  if (value_of(y_vec[n]) <= 0)
+
74  return LOG_ZERO;
+
75 
+ +
77  operands_and_partials(y, mu, sigma);
+
78 
+
79  using stan::math::square;
+
80  using std::log;
+
81  using stan::prob::NEG_LOG_SQRT_TWO_PI;
+
82 
+
83 
+ +
85  is_vector<T_scale>::value> log_sigma(length(sigma));
+ +
87  for (size_t n = 0; n < length(sigma); n++)
+
88  log_sigma[n] = log(value_of(sigma_vec[n]));
+ +
90  is_vector<T_scale>::value> inv_sigma(length(sigma));
+ +
92  is_vector<T_scale>::value> inv_sigma_sq(length(sigma));
+ +
94  for (size_t n = 0; n < length(sigma); n++)
+
95  inv_sigma[n] = 1 / value_of(sigma_vec[n]);
+ +
97  for (size_t n = 0; n < length(sigma); n++)
+
98  inv_sigma_sq[n] = inv_sigma[n] * inv_sigma[n];
+
99 
+ +
101  is_vector<T_y>::value> log_y(length(y));
+ +
103  for (size_t n = 0; n < length(y); n++)
+
104  log_y[n] = log(value_of(y_vec[n]));
+ +
106  is_vector<T_y>::value> inv_y(length(y));
+ +
108  for (size_t n = 0; n < length(y); n++)
+
109  inv_y[n] = 1 / value_of(y_vec[n]);
+
110 
+ +
112  logp += N * NEG_LOG_SQRT_TWO_PI;
+
113 
+
114  for (size_t n = 0; n < N; n++) {
+
115  const double mu_dbl = value_of(mu_vec[n]);
+
116 
+
117  double logy_m_mu(0);
+ + +
120  logy_m_mu = log_y[n] - mu_dbl;
+
121 
+
122  double logy_m_mu_sq = logy_m_mu * logy_m_mu;
+
123  double logy_m_mu_div_sigma(0);
+ + + +
127  logy_m_mu_div_sigma = logy_m_mu * inv_sigma_sq[n];
+
128 
+
129 
+
130  // log probability
+ +
132  logp -= log_sigma[n];
+ +
134  logp -= log_y[n];
+ +
136  logp -= 0.5 * logy_m_mu_sq * inv_sigma_sq[n];
+
137 
+
138  // gradients
+ +
140  operands_and_partials.d_x1[n] -= (1 + logy_m_mu_div_sigma) * inv_y[n];
+ +
142  operands_and_partials.d_x2[n] += logy_m_mu_div_sigma;
+ +
144  operands_and_partials.d_x3[n]
+
145  += (logy_m_mu_div_sigma * logy_m_mu - 1) * inv_sigma[n];
+
146  }
+
147  return operands_and_partials.to_var(logp);
+
148  }
+
149 
+
150  template <typename T_y, typename T_loc, typename T_scale>
+
151  inline
+ +
153  lognormal_log(const T_y& y, const T_loc& mu, const T_scale& sigma) {
+
154  return lognormal_log<false>(y,mu,sigma);
+
155  }
+
156 
+
157 
+
158  template <typename T_y, typename T_loc, typename T_scale>
+ +
160  lognormal_cdf(const T_y& y, const T_loc& mu, const T_scale& sigma) {
+
161  static const char* function = "stan::prob::lognormal_cdf(%1%)";
+
162 
+
163  double cdf = 1.0;
+
164 
+ + + + +
169  using boost::math::tools::promote_args;
+
170  using stan::math::value_of;
+
171 
+
172  // check if any vectors are zero length
+
173  if (!(stan::length(y)
+
174  && stan::length(mu)
+
175  && stan::length(sigma)))
+
176  return cdf;
+
177 
+
178  if (!check_not_nan(function, y, "Random variable", &cdf))
+
179  return cdf;
+
180  if (!check_nonnegative(function, y, "Random variable", &cdf))
+
181  return cdf;
+
182  if (!check_finite(function, mu, "Location parameter", &cdf))
+
183  return cdf;
+
184  if (!check_finite(function, sigma, "Scale parameter", &cdf))
+
185  return cdf;
+
186  if (!check_positive(function, sigma, "Scale parameter", &cdf))
+
187  return cdf;
+
188 
+ +
190  operands_and_partials(y, mu, sigma);
+
191 
+
192  VectorView<const T_y> y_vec(y);
+
193  VectorView<const T_loc> mu_vec(mu);
+
194  VectorView<const T_scale> sigma_vec(sigma);
+
195  size_t N = max_size(y, mu, sigma);
+
196 
+
197  const double sqrt_pi = std::sqrt(stan::math::pi());
+
198 
+
199  for (size_t i = 0; i < stan::length(y); i++) {
+
200  if (value_of(y_vec[i]) == 0.0)
+
201  return operands_and_partials.to_var(0.0);
+
202  }
+
203 
+
204  for (size_t n = 0; n < N; n++) {
+
205  const double y_dbl = value_of(y_vec[n]);
+
206  const double mu_dbl = value_of(mu_vec[n]);
+
207  const double sigma_dbl = value_of(sigma_vec[n]);
+
208  const double scaled_diff = (log(y_dbl) - mu_dbl) / (sigma_dbl * SQRT_2);
+
209  const double rep_deriv = SQRT_2 * 0.5 / sqrt_pi
+
210  * exp(-scaled_diff * scaled_diff) / sigma_dbl;
+
211 
+
212  //cdf
+
213  const double cdf_ = 0.5 * erfc(-scaled_diff);
+
214  cdf *= cdf_;
+
215 
+
216  //gradients
+ +
218  operands_and_partials.d_x1[n] += rep_deriv / cdf_ / y_dbl ;
+ +
220  operands_and_partials.d_x2[n] -= rep_deriv / cdf_ ;
+ +
222  operands_and_partials.d_x3[n] -= rep_deriv * scaled_diff * SQRT_2
+
223  / cdf_;
+
224  }
+
225 
+ +
227  for (size_t n = 0; n < stan::length(y); ++n)
+
228  operands_and_partials.d_x1[n] *= cdf;
+ +
230  for (size_t n = 0; n < stan::length(mu); ++n)
+
231  operands_and_partials.d_x2[n] *= cdf;
+ +
233  for (size_t n = 0; n < stan::length(sigma); ++n)
+
234  operands_and_partials.d_x3[n] *= cdf;
+
235 
+
236  return operands_and_partials.to_var(cdf);
+
237  }
+
238 
+
239  template <typename T_y, typename T_loc, typename T_scale>
+ +
241  lognormal_cdf_log(const T_y& y, const T_loc& mu, const T_scale& sigma) {
+
242  static const char* function = "stan::prob::lognormal_cdf_log(%1%)";
+
243 
+
244  double cdf_log = 0.0;
+
245 
+ + + + +
250  using boost::math::tools::promote_args;
+
251  using stan::math::value_of;
+
252 
+
253  // check if any vectors are zero length
+
254  if (!(stan::length(y)
+
255  && stan::length(mu)
+
256  && stan::length(sigma)))
+
257  return cdf_log;
+
258 
+
259  if (!check_not_nan(function, y, "Random variable", &cdf_log))
+
260  return cdf_log;
+
261  if (!check_nonnegative(function, y, "Random variable", &cdf_log))
+
262  return cdf_log;
+
263  if (!check_finite(function, mu, "Location parameter", &cdf_log))
+
264  return cdf_log;
+
265  if (!check_finite(function, sigma, "Scale parameter", &cdf_log))
+
266  return cdf_log;
+
267  if (!check_positive(function, sigma, "Scale parameter", &cdf_log))
+
268  return cdf_log;
+
269 
+ +
271  operands_and_partials(y, mu, sigma);
+
272 
+
273  VectorView<const T_y> y_vec(y);
+
274  VectorView<const T_loc> mu_vec(mu);
+
275  VectorView<const T_scale> sigma_vec(sigma);
+
276  size_t N = max_size(y, mu, sigma);
+
277 
+
278  const double sqrt_pi = std::sqrt(stan::math::pi());
+
279 
+
280  for (size_t i = 0; i < stan::length(y); i++) {
+
281  if (value_of(y_vec[i]) == 0.0)
+
282  return operands_and_partials.to_var(stan::math::negative_infinity());
+
283  }
+
284 
+
285  const double log_half = std::log(0.5);
+
286 
+
287  for (size_t n = 0; n < N; n++) {
+
288  const double y_dbl = value_of(y_vec[n]);
+
289  const double mu_dbl = value_of(mu_vec[n]);
+
290  const double sigma_dbl = value_of(sigma_vec[n]);
+
291  const double scaled_diff = (log(y_dbl) - mu_dbl) / (sigma_dbl * SQRT_2);
+
292  const double rep_deriv = SQRT_2 / sqrt_pi
+
293  * exp(-scaled_diff * scaled_diff) / sigma_dbl;
+
294 
+
295  //cdf_log
+
296  const double erfc_calc = erfc(-scaled_diff);
+
297  cdf_log += log_half + log(erfc_calc);
+
298 
+
299  //gradients
+ +
301  operands_and_partials.d_x1[n] += rep_deriv / erfc_calc / y_dbl ;
+ +
303  operands_and_partials.d_x2[n] -= rep_deriv / erfc_calc;
+ +
305  operands_and_partials.d_x3[n] -= rep_deriv * scaled_diff * SQRT_2
+
306  / erfc_calc;
+
307  }
+
308 
+
309  return operands_and_partials.to_var(cdf_log);
+
310  }
+
311 
+
312  template <typename T_y, typename T_loc, typename T_scale>
+ +
314  lognormal_ccdf_log(const T_y& y, const T_loc& mu, const T_scale& sigma) {
+
315  static const char* function = "stan::prob::lognormal_ccdf_log(%1%)";
+
316 
+
317  double ccdf_log = 0.0;
+
318 
+ + + + +
323  using boost::math::tools::promote_args;
+
324  using stan::math::value_of;
+
325 
+
326  // check if any vectors are zero length
+
327  if (!(stan::length(y)
+
328  && stan::length(mu)
+
329  && stan::length(sigma)))
+
330  return ccdf_log;
+
331 
+
332  if (!check_not_nan(function, y, "Random variable", &ccdf_log))
+
333  return ccdf_log;
+
334  if (!check_nonnegative(function, y, "Random variable", &ccdf_log))
+
335  return ccdf_log;
+
336  if (!check_finite(function, mu, "Location parameter", &ccdf_log))
+
337  return ccdf_log;
+
338  if (!check_finite(function, sigma, "Scale parameter", &ccdf_log))
+
339  return ccdf_log;
+
340  if (!check_positive(function, sigma, "Scale parameter", &ccdf_log))
+
341  return ccdf_log;
+
342 
+ +
344  operands_and_partials(y, mu, sigma);
+
345 
+
346  VectorView<const T_y> y_vec(y);
+
347  VectorView<const T_loc> mu_vec(mu);
+
348  VectorView<const T_scale> sigma_vec(sigma);
+
349  size_t N = max_size(y, mu, sigma);
+
350 
+
351  const double sqrt_pi = std::sqrt(stan::math::pi());
+
352 
+
353  for (size_t i = 0; i < stan::length(y); i++) {
+
354  if (value_of(y_vec[i]) == 0.0)
+
355  return operands_and_partials.to_var(0.0);
+
356  }
+
357 
+
358  const double log_half = std::log(0.5);
+
359 
+
360  for (size_t n = 0; n < N; n++) {
+
361  const double y_dbl = value_of(y_vec[n]);
+
362  const double mu_dbl = value_of(mu_vec[n]);
+
363  const double sigma_dbl = value_of(sigma_vec[n]);
+
364  const double scaled_diff = (log(y_dbl) - mu_dbl) / (sigma_dbl * SQRT_2);
+
365  const double rep_deriv = SQRT_2 / sqrt_pi
+
366  * exp(-scaled_diff * scaled_diff) / sigma_dbl;
+
367 
+
368  //ccdf_log
+
369  const double erfc_calc = erfc(scaled_diff);
+
370  ccdf_log += log_half + log(erfc_calc);
+
371 
+
372  //gradients
+ +
374  operands_and_partials.d_x1[n] -= rep_deriv / erfc_calc / y_dbl ;
+ +
376  operands_and_partials.d_x2[n] += rep_deriv / erfc_calc;
+ +
378  operands_and_partials.d_x3[n] += rep_deriv * scaled_diff * SQRT_2
+
379  / erfc_calc;
+
380  }
+
381 
+
382  return operands_and_partials.to_var(ccdf_log);
+
383  }
+
384 
+
385 
+
386  template <class RNG>
+
387  inline double
+
388  lognormal_rng(const double mu,
+
389  const double sigma,
+
390  RNG& rng) {
+
391  using boost::variate_generator;
+
392  using boost::random::lognormal_distribution;
+
393 
+
394  static const char* function = "stan::prob::lognormal_rng(%1%)";
+
395 
+ + +
398 
+
399  if (!check_finite(function, mu, "Location parameter"))
+
400  return 0;
+
401  if (!check_finite(function, sigma, "Scale parameter"))
+
402  return 0;
+
403  if (!check_positive(function, sigma, "Scale parameter"))
+
404  return 0;
+
405 
+
406  variate_generator<RNG&, lognormal_distribution<> >
+
407  lognorm_rng(rng, lognormal_distribution<>(mu, sigma));
+
408  return lognorm_rng();
+
409  }
+
410  }
+
411 }
+
412 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/mainpage_8dox.html b/doc/api/html/mainpage_8dox.html new file mode 100644 index 00000000000..f576c7a0f28 --- /dev/null +++ b/doc/api/html/mainpage_8dox.html @@ -0,0 +1,103 @@ + + + + + +Stan: src/doxygen/mainpage.dox File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ +
+
+
+
src/doxygen/mainpage.dox File Reference
+
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2constants_8hpp.html b/doc/api/html/math_2constants_8hpp.html new file mode 100644 index 00000000000..2b37063a721 --- /dev/null +++ b/doc/api/html/math_2constants_8hpp.html @@ -0,0 +1,192 @@ + + + + + +Stan: src/stan/math/constants.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
constants.hpp File Reference
+
+
+
#include <boost/math/constants/constants.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

double stan::math::pi ()
 Return the value of pi.
 
double stan::math::e ()
 Return the base of the natural logarithm.
 
double stan::math::sqrt2 ()
 Return the square root of two.
 
double stan::math::log10 ()
 Return natural logarithm of ten.
 
double stan::math::positive_infinity ()
 Return positive infinity.
 
double stan::math::negative_infinity ()
 Return negative infinity.
 
double stan::math::not_a_number ()
 Return (quiet) not-a-number.
 
double stan::math::machine_precision ()
 Returns the difference between 1.0 and the next value representable.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Variables

const double stan::math::E = boost::math::constants::e<double>()
 The base of the natural logarithm, $ e $.
 
const double stan::math::SQRT_2 = std::sqrt(2.0)
 The value of the square root of 2, $ \sqrt{2} $.
 
const double stan::math::INV_SQRT_2 = 1.0 / SQRT_2
 The value of 1 over the square root of 2, $ 1 / \sqrt{2} $.
 
const double stan::math::LOG_2 = std::log(2.0)
 The natural logarithm of 2, $ \log 2 $.
 
const double stan::math::LOG_10 = std::log(10.0)
 The natural logarithm of 10, $ \log 10 $.
 
const double stan::math::INFTY = std::numeric_limits<double>::infinity()
 Positive infinity.
 
const double stan::math::NEGATIVE_INFTY = - std::numeric_limits<double>::infinity()
 Negative infinity.
 
const double stan::math::NOT_A_NUMBER = std::numeric_limits<double>::quiet_NaN()
 (Quiet) not-a-number value.
 
const double stan::math::EPSILON = std::numeric_limits<double>::epsilon()
 Smallest positive value.
 
const double stan::math::NEGATIVE_EPSILON = - std::numeric_limits<double>::epsilon()
 Largest negative value (i.e., smallest absolute value).
 
const double stan::math::LOG_PI_OVER_FOUR = std::log(boost::math::constants::pi<double>()) / 4.0
 
const double stan::math::TWO_OVER_SQRT_PI = 2.0 / std::sqrt(boost::math::constants::pi<double>())
 
const double stan::math::NEG_TWO_OVER_SQRT_PI = -TWO_OVER_SQRT_PI
 
const double stan::math::INV_SQRT_TWO_PI = 1.0 / std::sqrt(2.0 * boost::math::constants::pi<double>())
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2constants_8hpp_source.html b/doc/api/html/math_2constants_8hpp_source.html new file mode 100644 index 00000000000..30a3fb5fb0d --- /dev/null +++ b/doc/api/html/math_2constants_8hpp_source.html @@ -0,0 +1,186 @@ + + + + + +Stan: src/stan/math/constants.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
constants.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__CONSTANTS_HPP__
+
2 #define __STAN__MATH__CONSTANTS_HPP__
+
3 
+
4 #include <boost/math/constants/constants.hpp>
+
5 
+
6 namespace stan {
+
7 
+
8  namespace math {
+
9 
+
14  const double E = boost::math::constants::e<double>();
+
15 
+
20  const double SQRT_2 = std::sqrt(2.0);
+
21 
+
26  const double INV_SQRT_2 = 1.0 / SQRT_2;
+
27 
+
32  const double LOG_2 = std::log(2.0);
+
33 
+
38  const double LOG_10 = std::log(10.0);
+
39 
+
43  const double INFTY = std::numeric_limits<double>::infinity();
+
44 
+
48  const double NEGATIVE_INFTY = - std::numeric_limits<double>::infinity();
+
49 
+
53  const double NOT_A_NUMBER = std::numeric_limits<double>::quiet_NaN();
+
54 
+
58  const double EPSILON = std::numeric_limits<double>::epsilon();
+
59 
+
63  const double NEGATIVE_EPSILON = - std::numeric_limits<double>::epsilon();
+
64 
+
65 
+
66  /*
+
67  * Log pi divided by 4
+
68  * \f$ \log \pi / 4 \f$
+
69  */
+
70  const double LOG_PI_OVER_FOUR = std::log(boost::math::constants::pi<double>()) / 4.0;
+
71 
+
77  inline double pi() {
+
78  return boost::math::constants::pi<double>();
+
79  }
+
80 
+
86  inline double e() {
+
87  return E;
+
88  }
+
89 
+
95  inline double sqrt2() {
+
96  return SQRT_2;
+
97  }
+
98 
+
99 
+
105  inline double log10() {
+
106  return LOG_10;
+
107  }
+
108 
+
114  inline double positive_infinity() {
+
115  return INFTY;
+
116  }
+
117 
+
123  inline double negative_infinity() {
+
124  return NEGATIVE_INFTY;
+
125  }
+
126 
+
132  inline double not_a_number() {
+
133  return NOT_A_NUMBER;
+
134  }
+
135 
+
142  inline double machine_precision() {
+
143  return EPSILON;
+
144  }
+
145 
+
146  const double TWO_OVER_SQRT_PI = 2.0 / std::sqrt(boost::math::constants::pi<double>());
+
147 
+ +
149 
+
150  const double INV_SQRT_TWO_PI = 1.0 / std::sqrt(2.0 * boost::math::constants::pi<double>());
+
151 
+
152  }
+
153 }
+
154 
+
155 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2error__handling_2matrix_2check__pos__definite_8hpp.html b/doc/api/html/math_2error__handling_2matrix_2check__pos__definite_8hpp.html new file mode 100644 index 00000000000..8dcbd600d48 --- /dev/null +++ b/doc/api/html/math_2error__handling_2matrix_2check__pos__definite_8hpp.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/math/error_handling/matrix/check_pos_definite.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
check_pos_definite.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + +

+Functions

template<typename T_y , typename T_result >
bool stan::math::check_pos_definite (const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)
 Return true if the specified matrix is positive definite.
 
template<typename T >
bool stan::math::check_pos_definite (const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2error__handling_2matrix_2check__pos__definite_8hpp_source.html b/doc/api/html/math_2error__handling_2matrix_2check__pos__definite_8hpp_source.html new file mode 100644 index 00000000000..913428aec1c --- /dev/null +++ b/doc/api/html/math_2error__handling_2matrix_2check__pos__definite_8hpp_source.html @@ -0,0 +1,159 @@ + + + + + +Stan: src/stan/math/error_handling/matrix/check_pos_definite.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
check_pos_definite.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__ERROR_HANDLING__MATRIX__CHECK_POS_DEFINITE_HPP__
+
2 #define __STAN__MATH__ERROR_HANDLING__MATRIX__CHECK_POS_DEFINITE_HPP__
+
3 
+
4 #include <sstream>
+ + + +
8 
+
9 namespace stan {
+
10  namespace math {
+
11 
+
24  // FIXME: update warnings (message has (0,0) item)
+
25  template <typename T_y, typename T_result>
+
26  inline bool check_pos_definite(const char* function,
+
27  const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& y,
+
28  const char* name,
+
29  T_result* result) {
+
30  typedef
+ +
32  size_type;
+
33  if (y.rows() == 1 && y(0,0) <= CONSTRAINT_TOLERANCE) {
+
34  std::ostringstream message;
+
35  message << name << " is not positive definite. "
+
36  << name << "(0,0) is %1%.";
+
37  std::string msg(message.str());
+
38  return dom_err(function,y(0,0),name,msg.c_str(),"",result);
+
39  }
+
40  Eigen::LDLT< Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic> > cholesky
+
41  = y.ldlt();
+
42  if(cholesky.info() != Eigen::Success ||
+
43  cholesky.isNegative() ||
+
44  (cholesky.vectorD().array() <= CONSTRAINT_TOLERANCE).any()) {
+
45  std::ostringstream message;
+
46  message << name << " is not positive definite. "
+
47  << name << "(0,0) is %1%.";
+
48  std::string msg(message.str());
+
49  return dom_err(function,y(0,0),name,msg.c_str(),"",result);
+
50  }
+
51  return true;
+
52  }
+
53 
+
54  template <typename T>
+
55  inline bool check_pos_definite(const char* function,
+
56  const Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& y,
+
57  const char* name,
+
58  T* result = 0) {
+
59  return check_pos_definite<T,T>(function,y,name,result);
+
60  }
+
61 
+
62  }
+
63 }
+
64 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2error__handling_8hpp.html b/doc/api/html/math_2error__handling_8hpp.html new file mode 100644 index 00000000000..0d60b63aa76 --- /dev/null +++ b/doc/api/html/math_2error__handling_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/error_handling.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
error_handling.hpp File Reference
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2error__handling_8hpp_source.html b/doc/api/html/math_2error__handling_8hpp_source.html new file mode 100644 index 00000000000..0a7753860ac --- /dev/null +++ b/doc/api/html/math_2error__handling_8hpp_source.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/math/error_handling.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
error_handling.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__ERROR_HANDLING_HPP__
+
2 #define __STAN__MATH__ERROR_HANDLING_HPP__
+
3 
+
4 #include <algorithm>
+
5 #include <cstddef>
+
6 #include <limits>
+
7 #include <utility>
+
8 #include <iostream>
+
9 
+
10 #include <boost/type_traits/is_unsigned.hpp>
+
11 
+
12 #include <stan/meta/traits.hpp>
+ + + + + + + + + + + + + + +
27 
+
28 #endif
+
29 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2_phi_8hpp.html b/doc/api/html/math_2functions_2_phi_8hpp.html new file mode 100644 index 00000000000..5cb94d27dd5 --- /dev/null +++ b/doc/api/html/math_2functions_2_phi_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/functions/Phi.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
Phi.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+#include <boost/math/special_functions/erf.hpp>
+#include <stan/math/constants.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
boost::math::tools::promote_args
+< T >::type 
stan::math::Phi (const T x)
 The unit normal cumulative distribution function.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2_phi_8hpp_source.html b/doc/api/html/math_2functions_2_phi_8hpp_source.html new file mode 100644 index 00000000000..7e1d621a7e4 --- /dev/null +++ b/doc/api/html/math_2functions_2_phi_8hpp_source.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/math/functions/Phi.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
Phi.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__PHI_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__PHI_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+
5 #include <boost/math/special_functions/erf.hpp>
+ +
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
28  template <typename T>
+
29  inline typename boost::math::tools::promote_args<T>::type
+
30  Phi(const T x) {
+
31  // overridden in fvar and var, so can hard-code boost versions
+
32  // here for scalars only
+
33  if (x < -37.5)
+
34  return 0;
+
35  else if (x < -5.0)
+
36  return 0.5 * boost::math::erfc(-INV_SQRT_2 * x);
+
37  else if (x > 8.25)
+
38  return 1;
+
39  else
+
40  return 0.5 * (1.0 + boost::math::erf(INV_SQRT_2 * x));
+
41  }
+
42 
+
43  }
+
44 }
+
45 
+
46 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2_phi__approx_8hpp.html b/doc/api/html/math_2functions_2_phi__approx_8hpp.html new file mode 100644 index 00000000000..5057006c785 --- /dev/null +++ b/doc/api/html/math_2functions_2_phi__approx_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/math/functions/Phi_approx.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
Phi_approx.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+#include <stan/math/functions/inv_logit.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
boost::math::tools::promote_args
+< T >::type 
stan::math::Phi_approx (T x)
 Approximation of the unit normal CDF.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2_phi__approx_8hpp_source.html b/doc/api/html/math_2functions_2_phi__approx_8hpp_source.html new file mode 100644 index 00000000000..267be93cd93 --- /dev/null +++ b/doc/api/html/math_2functions_2_phi__approx_8hpp_source.html @@ -0,0 +1,126 @@ + + + + + +Stan: src/stan/math/functions/Phi_approx.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
Phi_approx.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__PHI_APPROX_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__PHI_APPROX_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+ +
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
21  template <typename T>
+
22  inline typename boost::math::tools::promote_args<T>::type
+
23  Phi_approx(T x) {
+
24  return inv_logit(0.07056 * std::pow(x,3.0) + 1.5976 * x);
+
25  }
+
26 
+
27  }
+
28 }
+
29 
+
30 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2abs_8hpp.html b/doc/api/html/math_2functions_2abs_8hpp.html new file mode 100644 index 00000000000..3caee741024 --- /dev/null +++ b/doc/api/html/math_2functions_2abs_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/functions/abs.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
abs.hpp File Reference
+
+
+
#include <cmath>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

double stan::math::abs (double x)
 Return floating-point absolute value.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2abs_8hpp_source.html b/doc/api/html/math_2functions_2abs_8hpp_source.html new file mode 100644 index 00000000000..80a56964345 --- /dev/null +++ b/doc/api/html/math_2functions_2abs_8hpp_source.html @@ -0,0 +1,124 @@ + + + + + +Stan: src/stan/math/functions/abs.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
abs.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__ABS_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__ABS_HPP__
+
3 
+
4 #include <cmath>
+
5 
+
6 namespace stan {
+
7 
+
8  namespace math {
+
9 
+
19  double abs(double x) {
+
20  return std::fabs(x);
+
21  }
+
22 
+
23  }
+
24 }
+
25 
+
26 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2as__bool_8hpp.html b/doc/api/html/math_2functions_2as__bool_8hpp.html new file mode 100644 index 00000000000..1fd50a51787 --- /dev/null +++ b/doc/api/html/math_2functions_2as__bool_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/functions/as_bool.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
as_bool.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + +

+Functions

template<typename T >
int stan::math::as_bool (const T x)
 Return 1 if the argument is unequal to zero and 0 otherwise.
 
template<>
int stan::math::as_bool< int > (const int x)
 Return an integer with an equivalent boolean value to specified input.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2as__bool_8hpp_source.html b/doc/api/html/math_2functions_2as__bool_8hpp_source.html new file mode 100644 index 00000000000..673347e4dbf --- /dev/null +++ b/doc/api/html/math_2functions_2as__bool_8hpp_source.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/math/functions/as_bool.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
as_bool.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__AS_BOOL_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__AS_BOOL_HPP__
+
3 
+
4 namespace stan {
+
5  namespace math {
+
6 
+
13  template <typename T>
+
14  inline int as_bool(const T x) {
+
15  return x != 0.0;
+
16  }
+
17 
+
25  template <>
+
26  inline int as_bool<int>(const int x) {
+
27  return x;
+
28  }
+
29 
+
30 
+
31  }
+
32 }
+
33 
+
34 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2bessel__first__kind_8hpp.html b/doc/api/html/math_2functions_2bessel__first__kind_8hpp.html new file mode 100644 index 00000000000..fbe910fabac --- /dev/null +++ b/doc/api/html/math_2functions_2bessel__first__kind_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/functions/bessel_first_kind.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
bessel_first_kind.hpp File Reference
+
+
+
#include <boost/math/special_functions/bessel.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T2 >
T2 stan::math::bessel_first_kind (const int v, const T2 z)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2bessel__first__kind_8hpp_source.html b/doc/api/html/math_2functions_2bessel__first__kind_8hpp_source.html new file mode 100644 index 00000000000..a3f93ea5f73 --- /dev/null +++ b/doc/api/html/math_2functions_2bessel__first__kind_8hpp_source.html @@ -0,0 +1,125 @@ + + + + + +Stan: src/stan/math/functions/bessel_first_kind.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
bessel_first_kind.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__BESSEL_FIRST_KIND_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__BESSEL_FIRST_KIND_HPP__
+
3 
+
4 #include <boost/math/special_functions/bessel.hpp>
+
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
9  template<typename T2>
+
10  inline T2
+
11  bessel_first_kind(const int v, const T2 z) {
+
12  return boost::math::cyl_bessel_j(v,z);
+
13  }
+
14 
+
15  }
+
16 }
+
17 
+
18 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2bessel__second__kind_8hpp.html b/doc/api/html/math_2functions_2bessel__second__kind_8hpp.html new file mode 100644 index 00000000000..8d62b718a28 --- /dev/null +++ b/doc/api/html/math_2functions_2bessel__second__kind_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/functions/bessel_second_kind.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
bessel_second_kind.hpp File Reference
+
+
+
#include <boost/math/special_functions/bessel.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T2 >
T2 stan::math::bessel_second_kind (const int v, const T2 z)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2bessel__second__kind_8hpp_source.html b/doc/api/html/math_2functions_2bessel__second__kind_8hpp_source.html new file mode 100644 index 00000000000..7a191fdda29 --- /dev/null +++ b/doc/api/html/math_2functions_2bessel__second__kind_8hpp_source.html @@ -0,0 +1,125 @@ + + + + + +Stan: src/stan/math/functions/bessel_second_kind.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
bessel_second_kind.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__BESSEL_SECOND_KIND_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__BESSEL_SECOND_KIND_HPP__
+
3 
+
4 #include <boost/math/special_functions/bessel.hpp>
+
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
9  template <typename T2>
+
10  inline T2
+
11  bessel_second_kind(const int v, const T2 z) {
+
12  return boost::math::cyl_neumann(v,z);
+
13  }
+
14 
+
15  }
+
16 }
+
17 
+
18 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2binary__log__loss_8hpp.html b/doc/api/html/math_2functions_2binary__log__loss_8hpp.html new file mode 100644 index 00000000000..9b07579452e --- /dev/null +++ b/doc/api/html/math_2functions_2binary__log__loss_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/math/functions/binary_log_loss.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
binary_log_loss.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
boost::math::tools::promote_args
+< T >::type 
stan::math::binary_log_loss (const int y, const T y_hat)
 Returns the log loss function for binary classification with specified reference and response values.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2binary__log__loss_8hpp_source.html b/doc/api/html/math_2functions_2binary__log__loss_8hpp_source.html new file mode 100644 index 00000000000..cb7019ac2f1 --- /dev/null +++ b/doc/api/html/math_2functions_2binary__log__loss_8hpp_source.html @@ -0,0 +1,126 @@ + + + + + +Stan: src/stan/math/functions/binary_log_loss.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
binary_log_loss.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__BINARY_LOG_LOSS_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__BINARY_LOG_LOSS_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
24  template <typename T>
+
25  inline typename boost::math::tools::promote_args<T>::type
+
26  binary_log_loss(const int y, const T y_hat) {
+
27  using std::log;
+
28  return -log(y ? y_hat : (1.0 - y_hat));
+
29  }
+
30 
+
31  }
+
32 }
+
33 
+
34 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2binomial__coefficient__log_8hpp.html b/doc/api/html/math_2functions_2binomial__coefficient__log_8hpp.html new file mode 100644 index 00000000000..ccaf0383351 --- /dev/null +++ b/doc/api/html/math_2functions_2binomial__coefficient__log_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/math/functions/binomial_coefficient_log.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
binomial_coefficient_log.hpp File Reference
+
+
+
#include <boost/math/special_functions/gamma.hpp>
+#include <boost/math/tools/promotion.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T_N , typename T_n >
boost::math::tools::promote_args
+< T_N, T_n >::type 
stan::math::binomial_coefficient_log (const T_N N, const T_n n)
 Return the log of the binomial coefficient for the specified arguments.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2binomial__coefficient__log_8hpp_source.html b/doc/api/html/math_2functions_2binomial__coefficient__log_8hpp_source.html new file mode 100644 index 00000000000..7d6660b44f1 --- /dev/null +++ b/doc/api/html/math_2functions_2binomial__coefficient__log_8hpp_source.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/math/functions/binomial_coefficient_log.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
binomial_coefficient_log.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__BINOMIAL_COEFFICIENT_LOG_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__BINOMIAL_COEFFICIENT_LOG_HPP__
+
3 
+
4 #include <boost/math/special_functions/gamma.hpp>
+
5 #include <boost/math/tools/promotion.hpp>
+
6 
+
7 namespace stan {
+
8 
+
9  namespace math {
+
10 
+
29  template <typename T_N, typename T_n>
+
30  inline typename boost::math::tools::promote_args<T_N, T_n>::type
+
31  binomial_coefficient_log(const T_N N, const T_n n) {
+
32  using std::log;
+
33  using boost::math::lgamma;
+
34 
+
35  const double cutoff = 1000;
+
36  if ((N < cutoff) || (N - n < cutoff)) {
+
37  return lgamma(N + 1.0) - lgamma(n + 1.0) - lgamma(N - n + 1.0);
+
38  } else {
+
39  return n * log(N - n) + (N + 0.5) * log(N/(N-n))
+
40  + 1/(12*N) - n - 1/(12*(N-n)) - lgamma(n + 1.0);
+
41  }
+
42  }
+
43 
+
44  }
+
45 }
+
46 
+
47 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2digamma_8hpp.html b/doc/api/html/math_2functions_2digamma_8hpp.html new file mode 100644 index 00000000000..bd8a8d05d11 --- /dev/null +++ b/doc/api/html/math_2functions_2digamma_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/math/functions/digamma.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
digamma.hpp File Reference
+
+
+
#include <boost/math/special_functions/digamma.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + +

+Functions

double stan::math::digamma (double x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2digamma_8hpp_source.html b/doc/api/html/math_2functions_2digamma_8hpp_source.html new file mode 100644 index 00000000000..a8044a4468f --- /dev/null +++ b/doc/api/html/math_2functions_2digamma_8hpp_source.html @@ -0,0 +1,124 @@ + + + + + +Stan: src/stan/math/functions/digamma.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
digamma.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__DIGAMMA_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__DIGAMMA_HPP__
+
3 
+
4 #include <boost/math/special_functions/digamma.hpp>
+
5 
+
6 namespace stan {
+
7 
+
8  namespace math {
+
9 
+
10  double digamma(double x) {
+
11  return boost::math::digamma(x);
+
12  }
+
13 
+
14  }
+
15 }
+
16 
+
17 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2dot__self_8hpp.html b/doc/api/html/math_2functions_2dot__self_8hpp.html new file mode 100644 index 00000000000..dec748deabd --- /dev/null +++ b/doc/api/html/math_2functions_2dot__self_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/functions/dot_self.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
dot_self.hpp File Reference
+
+
+
#include <vector>
+#include <cstddef>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + +

+Functions

double stan::math::dot_self (const std::vector< double > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2dot__self_8hpp_source.html b/doc/api/html/math_2functions_2dot__self_8hpp_source.html new file mode 100644 index 00000000000..fc14a2483c6 --- /dev/null +++ b/doc/api/html/math_2functions_2dot__self_8hpp_source.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/math/functions/dot_self.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
dot_self.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__DOT_SELF_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__DOT_SELF_HPP__
+
3 
+
4 #include <vector>
+
5 #include <cstddef>
+
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
10  // x' * x
+
11  inline double dot_self(const std::vector<double>& x) {
+
12  double sum = 0.0;
+
13  for (size_t i = 0; i < x.size(); ++i)
+
14  sum += x[i] * x[i];
+
15  return sum;
+
16  }
+
17 
+
18  }
+
19 }
+
20 
+
21 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2exp2_8hpp.html b/doc/api/html/math_2functions_2exp2_8hpp.html new file mode 100644 index 00000000000..e0e2dd2e455 --- /dev/null +++ b/doc/api/html/math_2functions_2exp2_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/math/functions/exp2.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
exp2.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
boost::math::tools::promote_args
+< T >::type 
stan::math::exp2 (const T y)
 Return the exponent base 2 of the specified argument (C99).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2exp2_8hpp_source.html b/doc/api/html/math_2functions_2exp2_8hpp_source.html new file mode 100644 index 00000000000..24deb0f7773 --- /dev/null +++ b/doc/api/html/math_2functions_2exp2_8hpp_source.html @@ -0,0 +1,126 @@ + + + + + +Stan: src/stan/math/functions/exp2.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
exp2.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__EXP2_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__EXP2_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+
5 
+
6 namespace stan {
+
7 
+
8  namespace math {
+
9 
+
21  template <typename T>
+
22  inline typename boost::math::tools::promote_args<T>::type
+
23  exp2(const T y) {
+
24  using std::pow;
+
25  return pow(2.0,y);
+
26  }
+
27  }
+
28 }
+
29 
+
30 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2falling__factorial_8hpp.html b/doc/api/html/math_2functions_2falling__factorial_8hpp.html new file mode 100644 index 00000000000..1cc81a8b757 --- /dev/null +++ b/doc/api/html/math_2functions_2falling__factorial_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/functions/falling_factorial.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
falling_factorial.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T1 , typename T2 >
boost::math::tools::promote_args
+< T1, T2 >::type 
stan::math::falling_factorial (const T1 x, const T2 n)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2falling__factorial_8hpp_source.html b/doc/api/html/math_2functions_2falling__factorial_8hpp_source.html new file mode 100644 index 00000000000..6f0bb9f103c --- /dev/null +++ b/doc/api/html/math_2functions_2falling__factorial_8hpp_source.html @@ -0,0 +1,125 @@ + + + + + +Stan: src/stan/math/functions/falling_factorial.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
falling_factorial.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__FALLING_FACTORIAL_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__FALLING_FACTORIAL_HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
9  template<typename T1, typename T2>
+
10  inline typename boost::math::tools::promote_args<T1,T2>::type
+
11  falling_factorial(const T1 x, const T2 n) {
+ +
13  }
+
14 
+
15  }
+
16 }
+
17 
+
18 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2fdim_8hpp.html b/doc/api/html/math_2functions_2fdim_8hpp.html new file mode 100644 index 00000000000..23676ca3bf6 --- /dev/null +++ b/doc/api/html/math_2functions_2fdim_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/math/functions/fdim.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
fdim.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T1 , typename T2 >
boost::math::tools::promote_args
+< T1, T2 >::type 
stan::math::fdim (T1 a, T2 b)
 The positive difference function (C99).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2fdim_8hpp_source.html b/doc/api/html/math_2functions_2fdim_8hpp_source.html new file mode 100644 index 00000000000..61a664f298f --- /dev/null +++ b/doc/api/html/math_2functions_2fdim_8hpp_source.html @@ -0,0 +1,123 @@ + + + + + +Stan: src/stan/math/functions/fdim.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
fdim.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__FDIM_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__FDIM_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+
5 
+
6 namespace stan {
+
7  namespace math {
+
19  template <typename T1, typename T2>
+
20  inline typename boost::math::tools::promote_args<T1, T2>::type
+
21  fdim(T1 a, T2 b) {
+
22  return (a > b) ? (a - b) : 0.0;
+
23  }
+
24  }
+
25 }
+
26 
+
27 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2fma_8hpp.html b/doc/api/html/math_2functions_2fma_8hpp.html new file mode 100644 index 00000000000..5b4d049840d --- /dev/null +++ b/doc/api/html/math_2functions_2fma_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/math/functions/fma.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
fma.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T1 , typename T2 , typename T3 >
boost::math::tools::promote_args
+< T1, T2, T3 >::type 
stan::math::fma (const T1 a, const T2 b, const T3 c)
 The fused multiply-add operation (C99).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2fma_8hpp_source.html b/doc/api/html/math_2functions_2fma_8hpp_source.html new file mode 100644 index 00000000000..c43232f5930 --- /dev/null +++ b/doc/api/html/math_2functions_2fma_8hpp_source.html @@ -0,0 +1,124 @@ + + + + + +Stan: src/stan/math/functions/fma.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
fma.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__FMA_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__FMA_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
21  template <typename T1, typename T2, typename T3>
+
22  inline typename boost::math::tools::promote_args<T1,T2,T3>::type
+
23  fma(const T1 a, const T2 b, const T3 c) {
+
24  return (a * b) + c;
+
25  }
+
26 
+
27  }
+
28 }
+
29 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2gamma__p_8hpp.html b/doc/api/html/math_2functions_2gamma__p_8hpp.html new file mode 100644 index 00000000000..2778e87ae89 --- /dev/null +++ b/doc/api/html/math_2functions_2gamma__p_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/math/functions/gamma_p.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
gamma_p.hpp File Reference
+
+
+
#include <boost/math/special_functions/gamma.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + +

+Functions

double stan::math::gamma_p (double x, double a)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2gamma__p_8hpp_source.html b/doc/api/html/math_2functions_2gamma__p_8hpp_source.html new file mode 100644 index 00000000000..e061b6e2e90 --- /dev/null +++ b/doc/api/html/math_2functions_2gamma__p_8hpp_source.html @@ -0,0 +1,125 @@ + + + + + +Stan: src/stan/math/functions/gamma_p.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
gamma_p.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__GAMMA_P_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__GAMMA_P_HPP__
+
3 
+
4 #include <boost/math/special_functions/gamma.hpp>
+
5 
+
6 namespace stan {
+
7 
+
8  namespace math {
+
9 
+
10  // throws domain_error if x is at pole
+
11  double gamma_p(double x, double a) {
+
12  return boost::math::gamma_p(x,a);
+
13  }
+
14 
+
15  }
+
16 }
+
17 
+
18 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2gamma__q_8hpp.html b/doc/api/html/math_2functions_2gamma__q_8hpp.html new file mode 100644 index 00000000000..3bd6e2d427b --- /dev/null +++ b/doc/api/html/math_2functions_2gamma__q_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/math/functions/gamma_q.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
gamma_q.hpp File Reference
+
+
+
#include <boost/math/special_functions/gamma.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + +

+Functions

double stan::math::gamma_q (double x, double a)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2gamma__q_8hpp_source.html b/doc/api/html/math_2functions_2gamma__q_8hpp_source.html new file mode 100644 index 00000000000..607f52c726e --- /dev/null +++ b/doc/api/html/math_2functions_2gamma__q_8hpp_source.html @@ -0,0 +1,125 @@ + + + + + +Stan: src/stan/math/functions/gamma_q.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
gamma_q.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__GAMMA_Q_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__GAMMA_Q_HPP__
+
3 
+
4 #include <boost/math/special_functions/gamma.hpp>
+
5 
+
6 namespace stan {
+
7 
+
8  namespace math {
+
9 
+
10  // throws domain_error if x is at pole
+
11  double gamma_q(double x, double a) {
+
12  return boost::math::gamma_q(x,a);
+
13  }
+
14 
+
15  }
+
16 }
+
17 
+
18 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2ibeta_8hpp.html b/doc/api/html/math_2functions_2ibeta_8hpp.html new file mode 100644 index 00000000000..e1027422f90 --- /dev/null +++ b/doc/api/html/math_2functions_2ibeta_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/functions/ibeta.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
ibeta.hpp File Reference
+
+
+
#include <boost/math/special_functions/beta.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

double stan::math::ibeta (const double a, const double b, const double x)
 The normalized incomplete beta function of a, b, and x.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2ibeta_8hpp_source.html b/doc/api/html/math_2functions_2ibeta_8hpp_source.html new file mode 100644 index 00000000000..37f90b49eb2 --- /dev/null +++ b/doc/api/html/math_2functions_2ibeta_8hpp_source.html @@ -0,0 +1,125 @@ + + + + + +Stan: src/stan/math/functions/ibeta.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
ibeta.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__IBETA_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__IBETA_HPP__
+
3 
+
4 #include <boost/math/special_functions/beta.hpp>
+
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
21  inline double ibeta(const double a,
+
22  const double b,
+
23  const double x) {
+
24  return boost::math::ibeta(a, b, x);
+
25  }
+
26 
+
27  }
+
28 }
+
29 
+
30 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2if__else_8hpp.html b/doc/api/html/math_2functions_2if__else_8hpp.html new file mode 100644 index 00000000000..93b5fc68465 --- /dev/null +++ b/doc/api/html/math_2functions_2if__else_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/math/functions/if_else.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
if_else.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T_true , typename T_false >
boost::math::tools::promote_args
+< T_true, T_false >::type 
stan::math::if_else (const bool c, const T_true y_true, const T_false y_false)
 Return the second argument if the first argument is true and otherwise return the second argument.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2if__else_8hpp_source.html b/doc/api/html/math_2functions_2if__else_8hpp_source.html new file mode 100644 index 00000000000..f542e07adf4 --- /dev/null +++ b/doc/api/html/math_2functions_2if__else_8hpp_source.html @@ -0,0 +1,125 @@ + + + + + +Stan: src/stan/math/functions/if_else.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
if_else.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__IF_ELSE_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__IF_ELSE_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
23  template <typename T_true, typename T_false>
+
24  inline typename boost::math::tools::promote_args<T_true,T_false>::type
+
25  if_else(const bool c, const T_true y_true, const T_false y_false) {
+
26  return c ? y_true : y_false;
+
27  }
+
28 
+
29  }
+
30 }
+
31 
+
32 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2inv_8hpp.html b/doc/api/html/math_2functions_2inv_8hpp.html new file mode 100644 index 00000000000..ab4446898c0 --- /dev/null +++ b/doc/api/html/math_2functions_2inv_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/functions/inv.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
inv.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T >
boost::math::tools::promote_args
+< T >::type 
stan::math::inv (const T x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2inv_8hpp_source.html b/doc/api/html/math_2functions_2inv_8hpp_source.html new file mode 100644 index 00000000000..ad7535e83c0 --- /dev/null +++ b/doc/api/html/math_2functions_2inv_8hpp_source.html @@ -0,0 +1,126 @@ + + + + + +Stan: src/stan/math/functions/inv.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
inv.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__INV_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__INV_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
9  template <typename T>
+
10  inline
+
11  typename boost::math::tools::promote_args<T>::type
+
12  inv(const T x) {
+
13  return 1.0 / x;
+
14  }
+
15 
+
16  }
+
17 }
+
18 
+
19 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2inv__cloglog_8hpp.html b/doc/api/html/math_2functions_2inv__cloglog_8hpp.html new file mode 100644 index 00000000000..6abb84faf54 --- /dev/null +++ b/doc/api/html/math_2functions_2inv__cloglog_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/math/functions/inv_cloglog.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
inv_cloglog.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
boost::math::tools::promote_args
+< T >::type 
stan::math::inv_cloglog (T x)
 The inverse complementary log-log function.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2inv__cloglog_8hpp_source.html b/doc/api/html/math_2functions_2inv__cloglog_8hpp_source.html new file mode 100644 index 00000000000..1d2bf5591ec --- /dev/null +++ b/doc/api/html/math_2functions_2inv__cloglog_8hpp_source.html @@ -0,0 +1,126 @@ + + + + + +Stan: src/stan/math/functions/inv_cloglog.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
inv_cloglog.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__INV_CLOGLOG_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__INV_CLOGLOG_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
22  template <typename T>
+
23  inline typename boost::math::tools::promote_args<T>::type
+
24  inv_cloglog(T x) {
+
25  using std::exp;
+
26  return 1 - exp(-exp(x));
+
27  }
+
28 
+
29  }
+
30 }
+
31 
+
32 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2inv__logit_8hpp.html b/doc/api/html/math_2functions_2inv__logit_8hpp.html new file mode 100644 index 00000000000..4594f5a2958 --- /dev/null +++ b/doc/api/html/math_2functions_2inv__logit_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/math/functions/inv_logit.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
inv_logit.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
boost::math::tools::promote_args
+< T >::type 
stan::math::inv_logit (const T a)
 Returns the inverse logit function applied to the argument.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2inv__logit_8hpp_source.html b/doc/api/html/math_2functions_2inv__logit_8hpp_source.html new file mode 100644 index 00000000000..4354089ac5d --- /dev/null +++ b/doc/api/html/math_2functions_2inv__logit_8hpp_source.html @@ -0,0 +1,127 @@ + + + + + +Stan: src/stan/math/functions/inv_logit.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
inv_logit.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__INV_LOGIT_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__INV_LOGIT_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+
5 
+
6 namespace stan {
+
7 
+
8  namespace math {
+
9 
+
25  template <typename T>
+
26  inline typename boost::math::tools::promote_args<T>::type
+
27  inv_logit(const T a) {
+
28  using std::exp;
+
29  return 1.0 / (1.0 + exp(-a));
+
30  }
+
31 
+
32  }
+
33 }
+
34 
+
35 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2inv__sqrt_8hpp.html b/doc/api/html/math_2functions_2inv__sqrt_8hpp.html new file mode 100644 index 00000000000..58a6a92cd76 --- /dev/null +++ b/doc/api/html/math_2functions_2inv__sqrt_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/functions/inv_sqrt.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
inv_sqrt.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T >
boost::math::tools::promote_args
+< T >::type 
stan::math::inv_sqrt (const T x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2inv__sqrt_8hpp_source.html b/doc/api/html/math_2functions_2inv__sqrt_8hpp_source.html new file mode 100644 index 00000000000..6ab5139916e --- /dev/null +++ b/doc/api/html/math_2functions_2inv__sqrt_8hpp_source.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/math/functions/inv_sqrt.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
inv_sqrt.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__INV_SQRT_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__INV_SQRT_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
9  template <typename T>
+
10  inline
+
11  typename boost::math::tools::promote_args<T>::type
+
12  inv_sqrt(const T x) {
+
13  using std::sqrt;
+
14 
+
15  return 1.0 / sqrt(x);
+
16  }
+
17 
+
18  }
+
19 }
+
20 
+
21 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2inv__square_8hpp.html b/doc/api/html/math_2functions_2inv__square_8hpp.html new file mode 100644 index 00000000000..3a2dbef6bc7 --- /dev/null +++ b/doc/api/html/math_2functions_2inv__square_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/functions/inv_square.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
inv_square.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T >
boost::math::tools::promote_args
+< T >::type 
stan::math::inv_square (const T x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2inv__square_8hpp_source.html b/doc/api/html/math_2functions_2inv__square_8hpp_source.html new file mode 100644 index 00000000000..ce192d27964 --- /dev/null +++ b/doc/api/html/math_2functions_2inv__square_8hpp_source.html @@ -0,0 +1,125 @@ + + + + + +Stan: src/stan/math/functions/inv_square.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
inv_square.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__INV_SQUARE_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__INV_SQUARE_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
9  template <typename T>
+
10  inline
+
11  typename boost::math::tools::promote_args<T>::type
+
12  inv_square(const T x) {
+
13  return 1.0 / (x * x);
+
14  }
+
15  }
+
16 }
+
17 
+
18 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2is__uninitialized_8hpp.html b/doc/api/html/math_2functions_2is__uninitialized_8hpp.html new file mode 100644 index 00000000000..64995d01c52 --- /dev/null +++ b/doc/api/html/math_2functions_2is__uninitialized_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/functions/is_uninitialized.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
is_uninitialized.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
bool stan::math::is_uninitialized (T x)
 Returns true if the specified variable is uninitialized.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2is__uninitialized_8hpp_source.html b/doc/api/html/math_2functions_2is__uninitialized_8hpp_source.html new file mode 100644 index 00000000000..56e875203d5 --- /dev/null +++ b/doc/api/html/math_2functions_2is__uninitialized_8hpp_source.html @@ -0,0 +1,122 @@ + + + + + +Stan: src/stan/math/functions/is_uninitialized.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
is_uninitialized.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__IS_UNINITIALIZED_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__IS_UNINITIALIZED_HPP__
+
3 
+
4 namespace stan {
+
5 
+
6  namespace math {
+
7 
+
17  template <typename T>
+
18  inline bool is_uninitialized(T x) {
+
19  return false;
+
20  }
+
21 
+
22  }
+
23 }
+
24 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2lbeta_8hpp.html b/doc/api/html/math_2functions_2lbeta_8hpp.html new file mode 100644 index 00000000000..a374ea0d94c --- /dev/null +++ b/doc/api/html/math_2functions_2lbeta_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/math/functions/lbeta.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
lbeta.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+#include <boost/math/special_functions/gamma.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T1 , typename T2 >
boost::math::tools::promote_args
+< T1, T2 >::type 
stan::math::lbeta (const T1 a, const T2 b)
 Return the log of the beta function applied to the specified arguments.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2lbeta_8hpp_source.html b/doc/api/html/math_2functions_2lbeta_8hpp_source.html new file mode 100644 index 00000000000..90ccae44e34 --- /dev/null +++ b/doc/api/html/math_2functions_2lbeta_8hpp_source.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/functions/lbeta.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
lbeta.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__LBETA_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__LBETA_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+
5 
+
6 #include <boost/math/special_functions/gamma.hpp>
+
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
32  template <typename T1, typename T2>
+
33  inline typename boost::math::tools::promote_args<T1,T2>::type
+
34  lbeta(const T1 a, const T2 b) {
+
35  using boost::math::lgamma;
+
36  return lgamma(a)
+
37  + lgamma(b)
+
38  - lgamma(a + b);
+
39  }
+
40 
+
41  }
+
42 }
+
43 
+
44 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2lgamma_8hpp.html b/doc/api/html/math_2functions_2lgamma_8hpp.html new file mode 100644 index 00000000000..7f100793fb9 --- /dev/null +++ b/doc/api/html/math_2functions_2lgamma_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/math/functions/lgamma.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
lgamma.hpp File Reference
+
+
+
#include <boost/math/special_functions/gamma.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + +

+Functions

double stan::math::lgamma (double x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2lgamma_8hpp_source.html b/doc/api/html/math_2functions_2lgamma_8hpp_source.html new file mode 100644 index 00000000000..d01ff49d04d --- /dev/null +++ b/doc/api/html/math_2functions_2lgamma_8hpp_source.html @@ -0,0 +1,125 @@ + + + + + +Stan: src/stan/math/functions/lgamma.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
lgamma.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__LGAMMA_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__LGAMMA_HPP__
+
3 
+
4 #include <boost/math/special_functions/gamma.hpp>
+
5 
+
6 namespace stan {
+
7 
+
8  namespace math {
+
9 
+
10  // throws domain_error if x is at pole
+
11  double lgamma(double x) {
+
12  return boost::math::lgamma(x);
+
13  }
+
14 
+
15  }
+
16 }
+
17 
+
18 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2lmgamma_8hpp.html b/doc/api/html/math_2functions_2lmgamma_8hpp.html new file mode 100644 index 00000000000..f2c112317f7 --- /dev/null +++ b/doc/api/html/math_2functions_2lmgamma_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/functions/lmgamma.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
lmgamma.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+#include <stan/math/constants.hpp>
+#include <boost/math/special_functions/gamma.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
boost::math::tools::promote_args
+< T >::type 
stan::math::lmgamma (const int k, T x)
 Return the natural logarithm of the multivariate gamma function with the speciifed dimensions and argument.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2lmgamma_8hpp_source.html b/doc/api/html/math_2functions_2lmgamma_8hpp_source.html new file mode 100644 index 00000000000..41c81248b7d --- /dev/null +++ b/doc/api/html/math_2functions_2lmgamma_8hpp_source.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/functions/lmgamma.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
lmgamma.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__LMGAMMA_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__LMGAMMA_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+ +
6 #include <boost/math/special_functions/gamma.hpp>
+
7 
+
8 namespace stan {
+
9 
+
10  namespace math {
+
11 
+
28  template <typename T>
+
29  inline typename boost::math::tools::promote_args<T>::type
+
30  lmgamma(const int k, T x) {
+
31  using boost::math::lgamma;
+
32  typename boost::math::tools::promote_args<T>::type result
+
33  = k * (k - 1) * LOG_PI_OVER_FOUR;
+
34 
+
35  for (int j = 1; j <= k; ++j)
+
36  result += lgamma(x + (1.0 - j) / 2.0);
+
37  return result;
+
38  }
+
39 
+
40  }
+
41 }
+
42 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2log1m_8hpp.html b/doc/api/html/math_2functions_2log1m_8hpp.html new file mode 100644 index 00000000000..e6e371b507c --- /dev/null +++ b/doc/api/html/math_2functions_2log1m_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/math/functions/log1m.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log1m.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+#include <stan/math/functions/log1p.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
boost::math::tools::promote_args
+< T >::type 
stan::math::log1m (T x)
 Return the natural logarithm of one minus the specified value.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2log1m_8hpp_source.html b/doc/api/html/math_2functions_2log1m_8hpp_source.html new file mode 100644 index 00000000000..f2283e7fba2 --- /dev/null +++ b/doc/api/html/math_2functions_2log1m_8hpp_source.html @@ -0,0 +1,126 @@ + + + + + +Stan: src/stan/math/functions/log1m.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log1m.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__LOG1M_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__LOG1M_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+ +
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
19  template <typename T>
+
20  inline typename boost::math::tools::promote_args<T>::type
+
21  log1m(T x) {
+
22  return log1p(-x);
+
23  }
+
24 
+
25  }
+
26 }
+
27 
+
28 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2log1m__exp_8hpp.html b/doc/api/html/math_2functions_2log1m__exp_8hpp.html new file mode 100644 index 00000000000..8e1a8ed299f --- /dev/null +++ b/doc/api/html/math_2functions_2log1m__exp_8hpp.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/math/functions/log1m_exp.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log1m_exp.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+#include <stdexcept>
+#include <boost/throw_exception.hpp>
+#include <boost/math/special_functions/expm1.hpp>
+#include <stan/math/functions/log1m.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
boost::math::tools::promote_args
+< T >::type 
stan::math::log1m_exp (const T a)
 Calculates the log of 1 minus the exponential of the specified value without overflow log1m_exp(x) = log(1-exp(x)).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2log1m__exp_8hpp_source.html b/doc/api/html/math_2functions_2log1m__exp_8hpp_source.html new file mode 100644 index 00000000000..5cf7e13866b --- /dev/null +++ b/doc/api/html/math_2functions_2log1m__exp_8hpp_source.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/math/functions/log1m_exp.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log1m_exp.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__LOG1M_EXP_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__LOG1M_EXP_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+
5 #include <stdexcept>
+
6 #include <boost/throw_exception.hpp>
+
7 #include <boost/math/special_functions/expm1.hpp>
+ +
9 
+
10 namespace stan {
+
11  namespace math {
+
12 
+
20  template <typename T>
+
21  inline typename boost::math::tools::promote_args<T>::type
+
22  log1m_exp(const T a) {
+
23  if (a >= 0)
+
24  return std::numeric_limits<double>::quiet_NaN();
+
25  else if (a > -0.693147)
+
26  return std::log(-boost::math::expm1(a)); //0.693147 is approximatelly equal to log(2)
+
27  else
+
28  return log1m(std::exp(a));
+
29  }
+
30 
+
31  }
+
32 }
+
33 
+
34 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2log1m__inv__logit_8hpp.html b/doc/api/html/math_2functions_2log1m__inv__logit_8hpp.html new file mode 100644 index 00000000000..be4ea02847b --- /dev/null +++ b/doc/api/html/math_2functions_2log1m__inv__logit_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/math/functions/log1m_inv_logit.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log1m_inv_logit.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
boost::math::tools::promote_args
+< T >::type 
stan::math::log1m_inv_logit (const T u)
 Returns the natural logarithm of 1 minus the inverse logit of the specified argument.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2log1m__inv__logit_8hpp_source.html b/doc/api/html/math_2functions_2log1m__inv__logit_8hpp_source.html new file mode 100644 index 00000000000..e9cf1746d2b --- /dev/null +++ b/doc/api/html/math_2functions_2log1m__inv__logit_8hpp_source.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/math/functions/log1m_inv_logit.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log1m_inv_logit.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__LOG1M_INV_LOGIT_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__LOG1M_INV_LOGIT_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
17  template <typename T>
+
18  inline typename boost::math::tools::promote_args<T>::type
+
19  log1m_inv_logit(const T u) {
+
20  using std::exp;
+
21  if (u > 0.0)
+
22  return -u - log1p(exp(-u)); // prevent underflow
+
23  return -log1p(exp(u));
+
24  }
+
25 
+
26  }
+
27 }
+
28 
+
29 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2log1p_8hpp.html b/doc/api/html/math_2functions_2log1p_8hpp.html new file mode 100644 index 00000000000..8f38d6f3f4c --- /dev/null +++ b/doc/api/html/math_2functions_2log1p_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/math/functions/log1p.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log1p.hpp File Reference
+
+
+
#include <limits>
+#include <boost/math/tools/promotion.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
boost::math::tools::promote_args
+< T >::type 
stan::math::log1p (const T x)
 Return the natural logarithm of one plus the specified value.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2log1p_8hpp_source.html b/doc/api/html/math_2functions_2log1p_8hpp_source.html new file mode 100644 index 00000000000..ec03d8b33c9 --- /dev/null +++ b/doc/api/html/math_2functions_2log1p_8hpp_source.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/math/functions/log1p.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log1p.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__LOG1P_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__LOG1P_HPP__
+
3 
+
4 #include <limits>
+
5 #include <boost/math/tools/promotion.hpp>
+
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
19  template <typename T>
+
20  inline typename boost::math::tools::promote_args<T>::type
+
21  log1p(const T x) {
+
22  using std::log;
+
23  if (!(x >= -1.0))
+
24  return std::numeric_limits<double>::quiet_NaN();
+
25 
+
26  if (x > 1e-9 || x < -1e-9)
+
27  return log(1.0 + x); // direct, if distant from 1
+
28  else if (x > 1e-16 || x < -1e-16)
+
29  return x - 0.5 * x * x; // 2nd order Taylor, if close to 1
+
30  else
+
31  return x; // 1st order Taylor, if very close to 1
+
32  }
+
33 
+
34  }
+
35 }
+
36 
+
37 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2log1p__exp_8hpp.html b/doc/api/html/math_2functions_2log1p__exp_8hpp.html new file mode 100644 index 00000000000..973246db327 --- /dev/null +++ b/doc/api/html/math_2functions_2log1p__exp_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/math/functions/log1p_exp.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log1p_exp.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+#include <stan/math/functions/log1p.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
boost::math::tools::promote_args
+< T >::type 
stan::math::log1p_exp (const T a)
 Calculates the log of 1 plus the exponential of the specified value without overflow.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2log1p__exp_8hpp_source.html b/doc/api/html/math_2functions_2log1p__exp_8hpp_source.html new file mode 100644 index 00000000000..eb5df9c2885 --- /dev/null +++ b/doc/api/html/math_2functions_2log1p__exp_8hpp_source.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/functions/log1p_exp.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log1p_exp.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__LOG1P_EXP_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__LOG1P_EXP_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+ +
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
24  template <typename T>
+
25  inline typename boost::math::tools::promote_args<T>::type
+
26  log1p_exp(const T a) {
+
27  using std::exp;
+
28  // like log_sum_exp below with b=0.0; prevents underflow
+
29  if (a > 0.0)
+
30  return a + log1p(exp(-a));
+
31  return log1p(exp(a));
+
32  }
+
33 
+
34  }
+
35 }
+
36 
+
37 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2log2_8hpp.html b/doc/api/html/math_2functions_2log2_8hpp.html new file mode 100644 index 00000000000..93f2c33d278 --- /dev/null +++ b/doc/api/html/math_2functions_2log2_8hpp.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/math/functions/log2.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log2.hpp File Reference
+
+
+
#include <stdexcept>
+#include <boost/math/tools/promotion.hpp>
+#include <stan/math/constants.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + +

+Functions

template<typename T >
boost::math::tools::promote_args
+< T >::type 
stan::math::log2 (const T a)
 Returns the base 2 logarithm of the argument (C99).
 
double stan::math::log2 ()
 Return natural logarithm of two.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2log2_8hpp_source.html b/doc/api/html/math_2functions_2log2_8hpp_source.html new file mode 100644 index 00000000000..7ec0f1ff1ec --- /dev/null +++ b/doc/api/html/math_2functions_2log2_8hpp_source.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/functions/log2.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log2.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__LOG2_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__LOG2_HPP__
+
3 
+
4 #include <stdexcept>
+
5 #include <boost/math/tools/promotion.hpp>
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace math {
+
11 
+
23  template <typename T>
+
24  inline typename boost::math::tools::promote_args<T>::type
+
25  log2(const T a) {
+
26  using std::log;
+
27  return log(a) / LOG_2;
+
28  }
+
29 
+
35  inline double log2() {
+
36  return LOG_2;
+
37  }
+
38 
+
39  }
+
40 }
+
41 
+
42 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2log__diff__exp_8hpp.html b/doc/api/html/math_2functions_2log__diff__exp_8hpp.html new file mode 100644 index 00000000000..4ee251a53c1 --- /dev/null +++ b/doc/api/html/math_2functions_2log__diff__exp_8hpp.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/math/functions/log_diff_exp.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log_diff_exp.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+#include <stdexcept>
+#include <boost/throw_exception.hpp>
+#include <stan/math/functions/log1m_exp.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T1 , typename T2 >
boost::math::tools::promote_args
+< T1, T2 >::type 
stan::math::log_diff_exp (const T1 x, const T2 y)
 The natural logarithm of the difference of the natural exponentiation of x1 and the natural exponentiation of x2.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2log__diff__exp_8hpp_source.html b/doc/api/html/math_2functions_2log__diff__exp_8hpp_source.html new file mode 100644 index 00000000000..ec11492f484 --- /dev/null +++ b/doc/api/html/math_2functions_2log__diff__exp_8hpp_source.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/functions/log_diff_exp.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log_diff_exp.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__LOG_DIFF_EXP_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__LOG_DIFF_EXP_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+
5 #include <stdexcept>
+
6 #include <boost/throw_exception.hpp>
+ +
8 
+
9 namespace stan {
+
10  namespace math {
+
11 
+
19  template <typename T1, typename T2>
+
20  inline typename boost::math::tools::promote_args<T1,T2>::type
+
21  log_diff_exp(const T1 x, const T2 y) {
+
22  if (x <= y)
+
23  return std::numeric_limits<double>::quiet_NaN();
+
24  return x + log1m_exp(y - x);
+
25  }
+
26 
+
27  }
+
28 }
+
29 
+
30 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2log__falling__factorial_8hpp.html b/doc/api/html/math_2functions_2log__falling__factorial_8hpp.html new file mode 100644 index 00000000000..66f8f209416 --- /dev/null +++ b/doc/api/html/math_2functions_2log__falling__factorial_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/functions/log_falling_factorial.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log_falling_factorial.hpp File Reference
+
+
+
#include <boost/math/special_functions/gamma.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T1 , typename T2 >
boost::math::tools::promote_args
+< T1, T2 >::type 
stan::math::log_falling_factorial (const T1 x, const T2 n)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2log__falling__factorial_8hpp_source.html b/doc/api/html/math_2functions_2log__falling__factorial_8hpp_source.html new file mode 100644 index 00000000000..2342d1e111e --- /dev/null +++ b/doc/api/html/math_2functions_2log__falling__factorial_8hpp_source.html @@ -0,0 +1,126 @@ + + + + + +Stan: src/stan/math/functions/log_falling_factorial.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log_falling_factorial.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__LOG_FALLING_FACTORIAL_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__LOG_FALLING_FACTORIAL_HPP__
+
3 
+
4 #include <boost/math/special_functions/gamma.hpp>
+
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
9  template<typename T1, typename T2>
+
10  inline typename boost::math::tools::promote_args<T1,T2>::type
+
11  log_falling_factorial(const T1 x, const T2 n) {
+
12  using boost::math::lgamma;
+
13  return lgamma(x + 1) - lgamma(n + 1);
+
14  }
+
15 
+
16  }
+
17 }
+
18 
+
19 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2log__inv__logit_8hpp.html b/doc/api/html/math_2functions_2log__inv__logit_8hpp.html new file mode 100644 index 00000000000..9e7761237af --- /dev/null +++ b/doc/api/html/math_2functions_2log__inv__logit_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/math/functions/log_inv_logit.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log_inv_logit.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
boost::math::tools::promote_args
+< T >::type 
stan::math::log_inv_logit (const T &u)
 Returns the natural logarithm of the inverse logit of the specified argument.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2log__inv__logit_8hpp_source.html b/doc/api/html/math_2functions_2log__inv__logit_8hpp_source.html new file mode 100644 index 00000000000..76f243f0547 --- /dev/null +++ b/doc/api/html/math_2functions_2log__inv__logit_8hpp_source.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/math/functions/log_inv_logit.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log_inv_logit.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__LOG_INV_LOGIT_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__LOG_INV_LOGIT_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
17  template <typename T>
+
18  inline typename boost::math::tools::promote_args<T>::type
+
19  log_inv_logit(const T& u) {
+
20  using std::exp;
+
21  if (u < 0.0)
+
22  return u - log1p(exp(u)); // prevent underflow
+
23  return -log1p(exp(-u));
+
24  }
+
25 
+
26  }
+
27 }
+
28 
+
29 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2log__rising__factorial_8hpp.html b/doc/api/html/math_2functions_2log__rising__factorial_8hpp.html new file mode 100644 index 00000000000..8bdc012bc84 --- /dev/null +++ b/doc/api/html/math_2functions_2log__rising__factorial_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/functions/log_rising_factorial.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log_rising_factorial.hpp File Reference
+
+
+
#include <boost/math/special_functions/gamma.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T1 , typename T2 >
boost::math::tools::promote_args
+< T1, T2 >::type 
stan::math::log_rising_factorial (const T1 x, const T2 n)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2log__rising__factorial_8hpp_source.html b/doc/api/html/math_2functions_2log__rising__factorial_8hpp_source.html new file mode 100644 index 00000000000..bf07e7a8c7f --- /dev/null +++ b/doc/api/html/math_2functions_2log__rising__factorial_8hpp_source.html @@ -0,0 +1,126 @@ + + + + + +Stan: src/stan/math/functions/log_rising_factorial.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log_rising_factorial.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__LOG_RISING_FACTORIAL_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__LOG_RISING_FACTORIAL_HPP__
+
3 
+
4 #include <boost/math/special_functions/gamma.hpp>
+
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
9  template<typename T1, typename T2>
+
10  inline typename boost::math::tools::promote_args<T1,T2>::type
+
11  log_rising_factorial(const T1 x, const T2 n) {
+
12  using boost::math::lgamma;
+
13  return lgamma(x + n) - lgamma(x);
+
14  }
+
15 
+
16  }
+
17 }
+
18 
+
19 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2log__sum__exp_8hpp.html b/doc/api/html/math_2functions_2log__sum__exp_8hpp.html new file mode 100644 index 00000000000..383ab2fa82c --- /dev/null +++ b/doc/api/html/math_2functions_2log__sum__exp_8hpp.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/math/functions/log_sum_exp.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log_sum_exp.hpp File Reference
+
+
+
#include <stan/math/functions/log1p.hpp>
+#include <vector>
+#include <boost/math/tools/promotion.hpp>
+#include <limits>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + +

+Functions

template<typename T1 , typename T2 >
boost::math::tools::promote_args
+< T1, T2 >::type 
stan::math::log_sum_exp (const T2 &a, const T1 &b)
 Calculates the log sum of exponetials without overflow.
 
template<typename T >
stan::math::log_sum_exp (const std::vector< T > &x)
 Return the log of the sum of the exponentiated values of the specified sequence of values.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2log__sum__exp_8hpp_source.html b/doc/api/html/math_2functions_2log__sum__exp_8hpp_source.html new file mode 100644 index 00000000000..295cfa1c83c --- /dev/null +++ b/doc/api/html/math_2functions_2log__sum__exp_8hpp_source.html @@ -0,0 +1,150 @@ + + + + + +Stan: src/stan/math/functions/log_sum_exp.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log_sum_exp.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__LOG_SUM_EXP_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__LOG_SUM_EXP_HPP__
+
3 
+ +
5 #include <vector>
+
6 #include <boost/math/tools/promotion.hpp>
+
7 #include <limits>
+
8 
+
9 namespace stan {
+
10  namespace math {
+
11 
+
22  template <typename T1, typename T2>
+
23  inline typename boost::math::tools::promote_args<T1,T2>::type
+
24  log_sum_exp(const T2& a, const T1& b) {
+
25  using std::exp;
+
26  if (a > b)
+
27  return a + log1p(exp(b - a));
+
28  return b + log1p(exp(a - b));
+
29  }
+
30 
+
43  template <typename T>
+
44  T log_sum_exp(const std::vector<T>& x) {
+
45  using std::numeric_limits;
+
46  using std::log;
+
47  using std::exp;
+
48  T max = -numeric_limits<T>::infinity();
+
49  for (size_t ii = 0; ii < x.size(); ii++)
+
50  if (x[ii] > max)
+
51  max = x[ii];
+
52 
+
53  T sum = 0.0;
+
54  for (size_t ii = 0; ii < x.size(); ii++)
+
55  if (x[ii] != -numeric_limits<double>::infinity())
+
56  sum += exp(x[ii] - max);
+
57 
+
58  return max + log(sum);
+
59  }
+
60 
+
61 
+
62  }
+
63 }
+
64 
+
65 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2logit_8hpp.html b/doc/api/html/math_2functions_2logit_8hpp.html new file mode 100644 index 00000000000..892461480cb --- /dev/null +++ b/doc/api/html/math_2functions_2logit_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/math/functions/logit.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
logit.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
boost::math::tools::promote_args
+< T >::type 
stan::math::logit (const T a)
 Returns the logit function applied to the argument.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2logit_8hpp_source.html b/doc/api/html/math_2functions_2logit_8hpp_source.html new file mode 100644 index 00000000000..e9e5eeba60c --- /dev/null +++ b/doc/api/html/math_2functions_2logit_8hpp_source.html @@ -0,0 +1,126 @@ + + + + + +Stan: src/stan/math/functions/logit.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
logit.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__LOGIT_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__LOGIT_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
23  template <typename T>
+
24  inline typename boost::math::tools::promote_args<T>::type
+
25  logit(const T a) {
+
26  using std::log;
+
27  return log(a / (1.0 - a));
+
28  }
+
29 
+
30  }
+
31 }
+
32 
+
33 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2modified__bessel__first__kind_8hpp.html b/doc/api/html/math_2functions_2modified__bessel__first__kind_8hpp.html new file mode 100644 index 00000000000..4bc5390dfe3 --- /dev/null +++ b/doc/api/html/math_2functions_2modified__bessel__first__kind_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/functions/modified_bessel_first_kind.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
modified_bessel_first_kind.hpp File Reference
+
+
+
#include <boost/math/special_functions/bessel.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T2 >
T2 stan::math::modified_bessel_first_kind (const int v, const T2 z)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2modified__bessel__first__kind_8hpp_source.html b/doc/api/html/math_2functions_2modified__bessel__first__kind_8hpp_source.html new file mode 100644 index 00000000000..46cab74eed3 --- /dev/null +++ b/doc/api/html/math_2functions_2modified__bessel__first__kind_8hpp_source.html @@ -0,0 +1,125 @@ + + + + + +Stan: src/stan/math/functions/modified_bessel_first_kind.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
modified_bessel_first_kind.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__MODIFIED_BESSEL_FIRST_KIND_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__MODIFIED_BESSEL_FIRST_KIND_HPP__
+
3 
+
4 #include <boost/math/special_functions/bessel.hpp>
+
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
9  template<typename T2>
+
10  inline T2
+
11  modified_bessel_first_kind(const int v, const T2 z) {
+
12  return boost::math::cyl_bessel_i(v,z);
+
13  }
+
14 
+
15  }
+
16 }
+
17 
+
18 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2modified__bessel__second__kind_8hpp.html b/doc/api/html/math_2functions_2modified__bessel__second__kind_8hpp.html new file mode 100644 index 00000000000..199866bbac8 --- /dev/null +++ b/doc/api/html/math_2functions_2modified__bessel__second__kind_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/functions/modified_bessel_second_kind.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
modified_bessel_second_kind.hpp File Reference
+
+
+
#include <boost/math/special_functions/bessel.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T2 >
T2 stan::math::modified_bessel_second_kind (const int v, const T2 z)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2modified__bessel__second__kind_8hpp_source.html b/doc/api/html/math_2functions_2modified__bessel__second__kind_8hpp_source.html new file mode 100644 index 00000000000..4d569ec27f0 --- /dev/null +++ b/doc/api/html/math_2functions_2modified__bessel__second__kind_8hpp_source.html @@ -0,0 +1,125 @@ + + + + + +Stan: src/stan/math/functions/modified_bessel_second_kind.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
modified_bessel_second_kind.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__MODIFIED_BESSEL_SECOND_KIND_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__MODIFIED_BESSEL_SECOND_KIND_HPP__
+
3 
+
4 #include <boost/math/special_functions/bessel.hpp>
+
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
9  template<typename T2>
+
10  inline T2
+
11  modified_bessel_second_kind(const int v, const T2 z) {
+
12  return boost::math::cyl_bessel_k(v,z);
+
13  }
+
14 
+
15  }
+
16 }
+
17 
+
18 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2multiply__log_8hpp.html b/doc/api/html/math_2functions_2multiply__log_8hpp.html new file mode 100644 index 00000000000..3ed5c267039 --- /dev/null +++ b/doc/api/html/math_2functions_2multiply__log_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/math/functions/multiply_log.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
multiply_log.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T_a , typename T_b >
boost::math::tools::promote_args
+< T_a, T_b >::type 
stan::math::multiply_log (const T_a a, const T_b b)
 Calculated the value of the first argument times log of the second argument while behaving properly with 0 inputs.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2multiply__log_8hpp_source.html b/doc/api/html/math_2functions_2multiply__log_8hpp_source.html new file mode 100644 index 00000000000..e1ff978add1 --- /dev/null +++ b/doc/api/html/math_2functions_2multiply__log_8hpp_source.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/math/functions/multiply_log.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
multiply_log.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__MULTIPLY_LOG_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__MULTIPLY_LOG_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
21  template <typename T_a, typename T_b>
+
22  inline typename boost::math::tools::promote_args<T_a,T_b>::type
+
23  multiply_log(const T_a a, const T_b b) {
+
24  using std::log;
+
25  if (b == 0.0 && a == 0.0)
+
26  return 0.0;
+
27  return a * log(b);
+
28  }
+
29 
+
30  }
+
31 }
+
32 
+
33 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2owens__t_8hpp.html b/doc/api/html/math_2functions_2owens__t_8hpp.html new file mode 100644 index 00000000000..477e5e286db --- /dev/null +++ b/doc/api/html/math_2functions_2owens__t_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/math/functions/owens_t.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
owens_t.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+#include <boost/math/special_functions/owens_t.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T1 , typename T2 >
boost::math::tools::promote_args
+< T1, T2 >::type 
stan::math::owens_t (const T1 &h, const T2 &a)
 The Owen's T function of h and a.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2owens__t_8hpp_source.html b/doc/api/html/math_2functions_2owens__t_8hpp_source.html new file mode 100644 index 00000000000..95a85d31402 --- /dev/null +++ b/doc/api/html/math_2functions_2owens__t_8hpp_source.html @@ -0,0 +1,126 @@ + + + + + +Stan: src/stan/math/functions/owens_t.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
owens_t.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__OWENS__T_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__OWENS__T_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+
5 #include <boost/math/special_functions/owens_t.hpp>
+
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
10 
+
23  template <typename T1, typename T2>
+
24  inline typename boost::math::tools::promote_args<T1,T2>::type
+
25  owens_t(const T1& h, const T2& a) {
+
26  return boost::math::owens_t(h, a);
+
27  }
+
28  }
+
29 }
+
30 
+
31 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2rising__factorial_8hpp.html b/doc/api/html/math_2functions_2rising__factorial_8hpp.html new file mode 100644 index 00000000000..a6ace67b793 --- /dev/null +++ b/doc/api/html/math_2functions_2rising__factorial_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/functions/rising_factorial.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
rising_factorial.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T1 , typename T2 >
boost::math::tools::promote_args
+< T1, T2 >::type 
stan::math::rising_factorial (const T1 x, const T2 n)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2rising__factorial_8hpp_source.html b/doc/api/html/math_2functions_2rising__factorial_8hpp_source.html new file mode 100644 index 00000000000..f56aa04d730 --- /dev/null +++ b/doc/api/html/math_2functions_2rising__factorial_8hpp_source.html @@ -0,0 +1,125 @@ + + + + + +Stan: src/stan/math/functions/rising_factorial.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
rising_factorial.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__RISING_FACTORIAL_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__RISING_FACTORIAL_HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
9  template<typename T1, typename T2>
+
10  inline typename boost::math::tools::promote_args<T1,T2>::type
+
11  rising_factorial(const T1 x, const T2 n) {
+ +
13  }
+
14 
+
15  }
+
16 }
+
17 
+
18 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2square_8hpp.html b/doc/api/html/math_2functions_2square_8hpp.html new file mode 100644 index 00000000000..47382d80cf6 --- /dev/null +++ b/doc/api/html/math_2functions_2square_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/functions/square.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
square.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
stan::math::square (const T x)
 Return the square of the specified argument.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2square_8hpp_source.html b/doc/api/html/math_2functions_2square_8hpp_source.html new file mode 100644 index 00000000000..13e3af30d09 --- /dev/null +++ b/doc/api/html/math_2functions_2square_8hpp_source.html @@ -0,0 +1,122 @@ + + + + + +Stan: src/stan/math/functions/square.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
square.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__SQUARE_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__SQUARE_HPP__
+
3 
+
4 namespace stan {
+
5  namespace math {
+
6 
+
21  template <typename T>
+
22  inline T square(const T x) {
+
23  return x * x;
+
24  }
+
25 
+
26  }
+
27 }
+
28 
+
29 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2step_8hpp.html b/doc/api/html/math_2functions_2step_8hpp.html new file mode 100644 index 00000000000..916a69a0c21 --- /dev/null +++ b/doc/api/html/math_2functions_2step_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/functions/step.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
step.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
int stan::math::step (const T y)
 The step, or Heaviside, function.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2step_8hpp_source.html b/doc/api/html/math_2functions_2step_8hpp_source.html new file mode 100644 index 00000000000..05058cf7583 --- /dev/null +++ b/doc/api/html/math_2functions_2step_8hpp_source.html @@ -0,0 +1,122 @@ + + + + + +Stan: src/stan/math/functions/step.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
step.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__STEP_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__STEP_HPP__
+
3 
+
4 namespace stan {
+
5  namespace math {
+
6 
+
19  template <typename T>
+
20  inline int step(const T y) {
+
21  return y < 0.0 ? 0 : 1;
+
22  }
+
23 
+
24  }
+
25 }
+
26 
+
27 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2sum_8hpp.html b/doc/api/html/math_2functions_2sum_8hpp.html new file mode 100644 index 00000000000..041f564fa1a --- /dev/null +++ b/doc/api/html/math_2functions_2sum_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/functions/sum.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
sum.hpp File Reference
+
+
+
#include <vector>
+#include <cstddef>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + +

+Functions

double stan::math::sum (std::vector< double > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2sum_8hpp_source.html b/doc/api/html/math_2functions_2sum_8hpp_source.html new file mode 100644 index 00000000000..89f364c4dba --- /dev/null +++ b/doc/api/html/math_2functions_2sum_8hpp_source.html @@ -0,0 +1,127 @@ + + + + + +Stan: src/stan/math/functions/sum.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
sum.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__SUM_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__SUM_HPP__
+
3 
+
4 #include <vector>
+
5 #include <cstddef>
+
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
10  inline double sum(std::vector<double>& x) {
+
11  double sum = x[0];
+
12  for (size_t i = 1; i < x.size(); ++i)
+
13  sum += x[i];
+
14  return sum;
+
15  }
+
16 
+
17  }
+
18 }
+
19 
+
20 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2value__of_8hpp.html b/doc/api/html/math_2functions_2value__of_8hpp.html new file mode 100644 index 00000000000..91010363a4b --- /dev/null +++ b/doc/api/html/math_2functions_2value__of_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/functions/value_of.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
value_of.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + +

+Functions

template<typename T >
double stan::math::value_of (const T x)
 Return the value of the specified scalar argument converted to a double value.
 
template<>
double stan::math::value_of< double > (const double x)
 Return the specified argument.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_2value__of_8hpp_source.html b/doc/api/html/math_2functions_2value__of_8hpp_source.html new file mode 100644 index 00000000000..ca0860e570e --- /dev/null +++ b/doc/api/html/math_2functions_2value__of_8hpp_source.html @@ -0,0 +1,127 @@ + + + + + +Stan: src/stan/math/functions/value_of.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
value_of.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__VALUE_OF_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__VALUE_OF_HPP__
+
3 
+
4 namespace stan {
+
5  namespace math {
+
6 
+
19  template <typename T>
+
20  inline double value_of(const T x) {
+
21  return static_cast<double>(x);
+
22  }
+
23 
+
35  template <>
+
36  inline double value_of<double>(const double x) {
+
37  return x;
+
38  }
+
39 
+
40  }
+
41 }
+
42 
+
43 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_8hpp.html b/doc/api/html/math_2functions_8hpp.html new file mode 100644 index 00000000000..c6bb4a3888c --- /dev/null +++ b/doc/api/html/math_2functions_8hpp.html @@ -0,0 +1,175 @@ + + + + + +Stan: src/stan/math/functions.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
functions.hpp File Reference
+
+
+
#include <stan/math/functions/Phi.hpp>
+#include <stan/math/functions/Phi_approx.hpp>
+#include <stan/math/functions/abs.hpp>
+#include <stan/math/functions/as_bool.hpp>
+#include <stan/math/functions/bessel_first_kind.hpp>
+#include <stan/math/functions/bessel_second_kind.hpp>
+#include <stan/math/functions/binary_log_loss.hpp>
+#include <stan/math/functions/binomial_coefficient_log.hpp>
+#include <stan/math/functions/digamma.hpp>
+#include <stan/math/functions/dist.hpp>
+#include <stan/math/functions/dot.hpp>
+#include <stan/math/functions/dot_self.hpp>
+#include <stan/math/functions/exp2.hpp>
+#include <stan/math/functions/falling_factorial.hpp>
+#include <stan/math/functions/fdim.hpp>
+#include <stan/math/functions/fma.hpp>
+#include <stan/math/functions/gamma_p.hpp>
+#include <stan/math/functions/gamma_q.hpp>
+#include <stan/math/functions/ibeta.hpp>
+#include <stan/math/functions/if_else.hpp>
+#include <stan/math/functions/int_step.hpp>
+#include <stan/math/functions/inv.hpp>
+#include <stan/math/functions/inv_cloglog.hpp>
+#include <stan/math/functions/inv_logit.hpp>
+#include <stan/math/functions/inv_sqrt.hpp>
+#include <stan/math/functions/inv_square.hpp>
+#include <stan/math/functions/inverse_softmax.hpp>
+#include <stan/math/functions/is_uninitialized.hpp>
+#include <stan/math/functions/lbeta.hpp>
+#include <stan/math/functions/lgamma.hpp>
+#include <stan/math/functions/lmgamma.hpp>
+#include <stan/math/functions/log1m.hpp>
+#include <stan/math/functions/log1m_exp.hpp>
+#include <stan/math/functions/log1m_inv_logit.hpp>
+#include <stan/math/functions/log1p.hpp>
+#include <stan/math/functions/log1p_exp.hpp>
+#include <stan/math/functions/log2.hpp>
+#include <stan/math/functions/log_diff_exp.hpp>
+#include <stan/math/functions/log_falling_factorial.hpp>
+#include <stan/math/functions/log_inv_logit.hpp>
+#include <stan/math/functions/log_rising_factorial.hpp>
+#include <stan/math/functions/log_sum_exp.hpp>
+#include <stan/math/functions/logical_and.hpp>
+#include <stan/math/functions/logical_eq.hpp>
+#include <stan/math/functions/logical_gt.hpp>
+#include <stan/math/functions/logical_gte.hpp>
+#include <stan/math/functions/logical_lt.hpp>
+#include <stan/math/functions/logical_lte.hpp>
+#include <stan/math/functions/logical_negation.hpp>
+#include <stan/math/functions/logical_neq.hpp>
+#include <stan/math/functions/logical_or.hpp>
+#include <stan/math/functions/logit.hpp>
+#include <stan/math/functions/max.hpp>
+#include <stan/math/functions/min.hpp>
+#include <stan/math/functions/modified_bessel_first_kind.hpp>
+#include <stan/math/functions/modified_bessel_second_kind.hpp>
+#include <stan/math/functions/multiply_log.hpp>
+#include <stan/math/functions/owens_t.hpp>
+#include <stan/math/functions/rising_factorial.hpp>
+#include <stan/math/functions/scaled_add.hpp>
+#include <stan/math/functions/square.hpp>
+#include <stan/math/functions/step.hpp>
+#include <stan/math/functions/sub.hpp>
+#include <stan/math/functions/sum.hpp>
+#include <stan/math/functions/trigamma.hpp>
+#include <stan/math/functions/value_of.hpp>
+
+

Go to the source code of this file.

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2functions_8hpp_source.html b/doc/api/html/math_2functions_8hpp_source.html new file mode 100644 index 00000000000..1faf395dedf --- /dev/null +++ b/doc/api/html/math_2functions_8hpp_source.html @@ -0,0 +1,178 @@ + + + + + +Stan: src/stan/math/functions.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
functions.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS_HPP__
+
2 #define __STAN__MATH__FUNCTIONS_HPP__
+
3 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
70 
+
71 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2columns__dot__product_8hpp.html b/doc/api/html/math_2matrix_2columns__dot__product_8hpp.html new file mode 100644 index 00000000000..b3c542b3bda --- /dev/null +++ b/doc/api/html/math_2matrix_2columns__dot__product_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/math/matrix/columns_dot_product.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
columns_dot_product.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<int R1, int C1, int R2, int C2>
Eigen::Matrix< double, 1, C1 > stan::math::columns_dot_product (const Eigen::Matrix< double, R1, C1 > &v1, const Eigen::Matrix< double, R2, C2 > &v2)
 Returns the dot product of the specified vectors.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2columns__dot__product_8hpp_source.html b/doc/api/html/math_2matrix_2columns__dot__product_8hpp_source.html new file mode 100644 index 00000000000..96dbcbc1012 --- /dev/null +++ b/doc/api/html/math_2matrix_2columns__dot__product_8hpp_source.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/math/matrix/columns_dot_product.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
columns_dot_product.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__COLUMNS_DOT_PRODUCT_HPP__
+
2 #define __STAN__MATH__MATRIX__COLUMNS_DOT_PRODUCT_HPP__
+
3 
+ + + +
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
20  template<int R1,int C1,int R2, int C2>
+
21  inline Eigen::Matrix<double, 1, C1>
+
22  columns_dot_product(const Eigen::Matrix<double, R1, C1>& v1,
+
23  const Eigen::Matrix<double, R2, C2>& v2) {
+
24  validate_matching_sizes(v1,v2,"columns_dot_product");
+
25  Eigen::Matrix<double, 1, C1> ret(1,v1.cols());
+
26  for (size_type j = 0; j < v1.cols(); ++j) {
+
27  ret(j) = v1.col(j).dot(v2.col(j));
+
28  }
+
29  return ret;
+
30  }
+
31 
+
32  }
+
33 }
+
34 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2columns__dot__self_8hpp.html b/doc/api/html/math_2matrix_2columns__dot__self_8hpp.html new file mode 100644 index 00000000000..7c9c3301b8b --- /dev/null +++ b/doc/api/html/math_2matrix_2columns__dot__self_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/matrix/columns_dot_self.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
columns_dot_self.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T , int R, int C>
Eigen::Matrix< T, 1, C > stan::math::columns_dot_self (const Eigen::Matrix< T, R, C > &x)
 Returns the dot product of each column of a matrix with itself.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2columns__dot__self_8hpp_source.html b/doc/api/html/math_2matrix_2columns__dot__self_8hpp_source.html new file mode 100644 index 00000000000..fd26cf7cf1f --- /dev/null +++ b/doc/api/html/math_2matrix_2columns__dot__self_8hpp_source.html @@ -0,0 +1,124 @@ + + + + + +Stan: src/stan/math/matrix/columns_dot_self.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
columns_dot_self.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__COLUMNS_DOT_SELF_HPP__
+
2 #define __STAN__MATH__MATRIX__COLUMNS_DOT_SELF_HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
14  template<typename T,int R,int C>
+
15  inline Eigen::Matrix<T,1,C>
+
16  columns_dot_self(const Eigen::Matrix<T,R,C>& x) {
+
17  return x.colwise().squaredNorm();
+
18  }
+
19 
+
20  }
+
21 }
+
22 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2crossprod_8hpp.html b/doc/api/html/math_2matrix_2crossprod_8hpp.html new file mode 100644 index 00000000000..0e55035e36b --- /dev/null +++ b/doc/api/html/math_2matrix_2crossprod_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/matrix/crossprod.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
crossprod.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

matrix_d stan::math::crossprod (const matrix_d &M)
 Returns the result of pre-multiplying a matrix by its own transpose.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2crossprod_8hpp_source.html b/doc/api/html/math_2matrix_2crossprod_8hpp_source.html new file mode 100644 index 00000000000..1c97980c426 --- /dev/null +++ b/doc/api/html/math_2matrix_2crossprod_8hpp_source.html @@ -0,0 +1,124 @@ + + + + + +Stan: src/stan/math/matrix/crossprod.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
crossprod.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__CROSSPROD_HPP__
+
2 #define __STAN__MATH__MATRIX__CROSSPROD_HPP__
+
3 
+ + +
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
16  inline matrix_d
+
17  crossprod(const matrix_d& M) {
+
18  return tcrossprod(M.transpose());
+
19  }
+
20 
+
21  }
+
22 }
+
23 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2determinant_8hpp.html b/doc/api/html/math_2matrix_2determinant_8hpp.html new file mode 100644 index 00000000000..ae0e00909c9 --- /dev/null +++ b/doc/api/html/math_2matrix_2determinant_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/math/matrix/determinant.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
determinant.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T , int R, int C>
stan::math::determinant (const Eigen::Matrix< T, R, C > &m)
 Returns the determinant of the specified square matrix.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2determinant_8hpp_source.html b/doc/api/html/math_2matrix_2determinant_8hpp_source.html new file mode 100644 index 00000000000..181d9cccb4e --- /dev/null +++ b/doc/api/html/math_2matrix_2determinant_8hpp_source.html @@ -0,0 +1,125 @@ + + + + + +Stan: src/stan/math/matrix/determinant.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
determinant.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__DETERMINANT_HPP__
+
2 #define __STAN__MATH__MATRIX__DETERMINANT_HPP__
+
3 
+ + +
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
17  template <typename T,int R, int C>
+
18  inline T determinant(const Eigen::Matrix<T,R,C>& m) {
+
19  stan::math::validate_square(m,"determinant");
+
20  return m.determinant();
+
21  }
+
22 
+
23  }
+
24 }
+
25 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2divide_8hpp.html b/doc/api/html/math_2matrix_2divide_8hpp.html new file mode 100644 index 00000000000..ede9be74a44 --- /dev/null +++ b/doc/api/html/math_2matrix_2divide_8hpp.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/math/matrix/divide.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
divide.hpp File Reference
+
+
+
#include <boost/type_traits/is_arithmetic.hpp>
+#include <boost/utility/enable_if.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<int R, int C, typename T >
boost::enable_if_c
+< boost::is_arithmetic< T >
+::value, Eigen::Matrix< double,
+R, C > >::type 
stan::math::divide (const Eigen::Matrix< double, R, C > &m, T c)
 Return specified matrix divided by specified scalar.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2divide_8hpp_source.html b/doc/api/html/math_2matrix_2divide_8hpp_source.html new file mode 100644 index 00000000000..92f64d95a88 --- /dev/null +++ b/doc/api/html/math_2matrix_2divide_8hpp_source.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/matrix/divide.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
divide.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__DIVIDE_HPP__
+
2 #define __STAN__MATH__MATRIX__DIVIDE_HPP__
+
3 
+
4 #include <boost/type_traits/is_arithmetic.hpp>
+
5 #include <boost/utility/enable_if.hpp>
+ +
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
19  template <int R, int C, typename T>
+
20  inline
+
21  typename boost::enable_if_c<boost::is_arithmetic<T>::value,
+
22  Eigen::Matrix<double, R, C> >::type
+
23  divide(const Eigen::Matrix<double,R,C>& m,
+
24  T c) {
+
25  return m / c;
+
26  }
+
27 
+
28  }
+
29 }
+
30 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2dot__product_8hpp.html b/doc/api/html/math_2matrix_2dot__product_8hpp.html new file mode 100644 index 00000000000..aaa3403487a --- /dev/null +++ b/doc/api/html/math_2matrix_2dot__product_8hpp.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/math/matrix/dot_product.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
dot_product.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + + + +

+Functions

template<int R1, int C1, int R2, int C2>
double stan::math::dot_product (const Eigen::Matrix< double, R1, C1 > &v1, const Eigen::Matrix< double, R2, C2 > &v2)
 Returns the dot product of the specified vectors.
 
double stan::math::dot_product (const double *v1, const double *v2, size_t length)
 Returns the dot product of the specified arrays of doubles.
 
double stan::math::dot_product (const std::vector< double > &v1, const std::vector< double > &v2)
 Returns the dot product of the specified arrays of doubles.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2dot__product_8hpp_source.html b/doc/api/html/math_2matrix_2dot__product_8hpp_source.html new file mode 100644 index 00000000000..2607d769498 --- /dev/null +++ b/doc/api/html/math_2matrix_2dot__product_8hpp_source.html @@ -0,0 +1,142 @@ + + + + + +Stan: src/stan/math/matrix/dot_product.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
dot_product.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__DOT_PRODUCT_HPP__
+
2 #define __STAN__MATH__MATRIX__DOT_PRODUCT_HPP__
+
3 
+
4 #include <vector>
+ + + +
8 
+
9 namespace stan {
+
10  namespace math {
+
11 
+
21  template<int R1,int C1,int R2, int C2>
+
22  inline double dot_product(const Eigen::Matrix<double, R1, C1>& v1,
+
23  const Eigen::Matrix<double, R2, C2>& v2) {
+
24  validate_vector(v1,"dot_product");
+
25  validate_vector(v2,"dot_product");
+
26  validate_matching_sizes(v1,v2,"dot_product");
+
27  return v1.dot(v2);
+
28  }
+
35  inline double dot_product(const double* v1, const double* v2,
+
36  size_t length) {
+
37  double result = 0;
+
38  for (size_t i = 0; i < length; i++)
+
39  result += v1[i] * v2[i];
+
40  return result;
+
41  }
+
48  inline double dot_product(const std::vector<double>& v1,
+
49  const std::vector<double>& v2) {
+
50  validate_matching_sizes(v1,v2,"dot_product");
+
51  return dot_product(&v1[0], &v2[0], v1.size());
+
52  }
+
53 
+
54  }
+
55 }
+
56 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2dot__self_8hpp.html b/doc/api/html/math_2matrix_2dot__self_8hpp.html new file mode 100644 index 00000000000..3846ef9de39 --- /dev/null +++ b/doc/api/html/math_2matrix_2dot__self_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/math/matrix/dot_self.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
dot_self.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<int R, int C>
double stan::math::dot_self (const Eigen::Matrix< double, R, C > &v)
 Returns the dot product of the specified vector with itself.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2dot__self_8hpp_source.html b/doc/api/html/math_2matrix_2dot__self_8hpp_source.html new file mode 100644 index 00000000000..2b9f16ecae4 --- /dev/null +++ b/doc/api/html/math_2matrix_2dot__self_8hpp_source.html @@ -0,0 +1,125 @@ + + + + + +Stan: src/stan/math/matrix/dot_self.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
dot_self.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__DOT_SELF_HPP__
+
2 #define __STAN__MATH__MATRIX__DOT_SELF_HPP__
+
3 
+ + +
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
17  template <int R, int C>
+
18  inline double dot_self(const Eigen::Matrix<double, R, C>& v) {
+
19  validate_vector(v,"dot_self");
+
20  return v.squaredNorm();
+
21  }
+
22 
+
23  }
+
24 }
+
25 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2exp_8hpp.html b/doc/api/html/math_2matrix_2exp_8hpp.html new file mode 100644 index 00000000000..fdf4bab19fa --- /dev/null +++ b/doc/api/html/math_2matrix_2exp_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/matrix/exp.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
exp.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T , int Rows, int Cols>
Eigen::Matrix< T, Rows, Cols > stan::math::exp (const Eigen::Matrix< T, Rows, Cols > &m)
 Return the element-wise exponentiation of the matrix or vector.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2exp_8hpp_source.html b/doc/api/html/math_2matrix_2exp_8hpp_source.html new file mode 100644 index 00000000000..d334ff9f4cb --- /dev/null +++ b/doc/api/html/math_2matrix_2exp_8hpp_source.html @@ -0,0 +1,123 @@ + + + + + +Stan: src/stan/math/matrix/exp.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
exp.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__EXP_HPP__
+
2 #define __STAN__MATH__MATRIX__EXP_HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
15  template<typename T, int Rows, int Cols>
+
16  inline Eigen::Matrix<T,Rows,Cols> exp(const Eigen::Matrix<T,Rows,Cols>& m) {
+
17  return m.array().exp().matrix();
+
18  }
+
19 
+
20  }
+
21 }
+
22 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2inverse_8hpp.html b/doc/api/html/math_2matrix_2inverse_8hpp.html new file mode 100644 index 00000000000..fd66da3fb04 --- /dev/null +++ b/doc/api/html/math_2matrix_2inverse_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/math/matrix/inverse.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
inverse.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
stan::math::inverse (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &m)
 Returns the inverse of the specified matrix.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2inverse_8hpp_source.html b/doc/api/html/math_2matrix_2inverse_8hpp_source.html new file mode 100644 index 00000000000..cacb8ae1534 --- /dev/null +++ b/doc/api/html/math_2matrix_2inverse_8hpp_source.html @@ -0,0 +1,127 @@ + + + + + +Stan: src/stan/math/matrix/inverse.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
inverse.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__INVERSE_HPP__
+
2 #define __STAN__MATH__MATRIX__INVERSE_HPP__
+
3 
+ + +
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
15  template <typename T>
+
16  inline
+
17  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>
+
18  inverse(const Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& m) {
+
19  validate_square(m,"matrix inverse");
+
20  return m.inverse();
+
21  }
+
22 
+
23  }
+
24 }
+
25 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2ldlt_8hpp.html b/doc/api/html/math_2matrix_2ldlt_8hpp.html new file mode 100644 index 00000000000..3ffa4b00a84 --- /dev/null +++ b/doc/api/html/math_2matrix_2ldlt_8hpp.html @@ -0,0 +1,159 @@ + + + + + +Stan: src/stan/math/matrix/ldlt.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
ldlt.hpp File Reference
+
+
+
#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/transpose.hpp>
+#include <stan/math/matrix/validate_multiplicable.hpp>
+#include <stan/math/matrix/validate_square.hpp>
+#include <boost/shared_ptr.hpp>
+#include <boost/math/tools/promotion.hpp>
+
+

Go to the source code of this file.

+ + + + + + +

+Classes

class  LDLT_factor< T, R, C >
 
class  stan::math::LDLT_factor< double, R, C >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + + + + + + + + + + + +

+Functions

template<int R1, int C1, int R2, int C2>
Eigen::Matrix< double, R1, C2 > stan::math::mdivide_left_ldlt (const stan::math::LDLT_factor< double, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)
 
template<typename T1 , typename T2 , int R1, int C1, int R2, int C2>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R1, C2 > 
stan::math::mdivide_right_ldlt (const Eigen::Matrix< T1, R1, C1 > &b, const stan::math::LDLT_factor< T2, R2, C2 > &A)
 
template<int R1, int C1, int R2, int C2>
Eigen::Matrix< double, R1, C2 > stan::math::mdivide_right_ldlt (const Eigen::Matrix< double, R1, C1 > &b, const stan::math::LDLT_factor< double, R2, C2 > &A)
 
template<int R, int C>
double stan::math::log_determinant_ldlt (stan::math::LDLT_factor< double, R, C > &A)
 
template<int R1, int C1, int R2, int C2, int R3, int C3>
double stan::math::trace_inv_quad_form_ldlt (const Eigen::Matrix< double, R1, C1 > &D, const stan::math::LDLT_factor< double, R2, C2 > &A, const Eigen::Matrix< double, R3, C3 > &B)
 
template<int R2, int C2, int R3, int C3>
double stan::math::trace_inv_quad_form_ldlt (const stan::math::LDLT_factor< double, R2, C2 > &A, const Eigen::Matrix< double, R3, C3 > &B)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2ldlt_8hpp_source.html b/doc/api/html/math_2matrix_2ldlt_8hpp_source.html new file mode 100644 index 00000000000..a770145c718 --- /dev/null +++ b/doc/api/html/math_2matrix_2ldlt_8hpp_source.html @@ -0,0 +1,245 @@ + + + + + +Stan: src/stan/math/matrix/ldlt.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
ldlt.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__LDLT_HPP__
+
2 #define __STAN__MATH__MATRIX__LDLT_HPP__
+
3 
+ + + + +
8 
+
9 #include <boost/shared_ptr.hpp>
+
10 #include <boost/math/tools/promotion.hpp>
+
11 
+
12 namespace stan {
+
13  namespace math {
+
14 
+
15  template<typename T, int R, int C>
+
16  class LDLT_factor;
+
17 
+
18  template<int R, int C>
+
19  class LDLT_factor<double,R,C> {
+
20  public:
+
21  LDLT_factor() : N_(0) {}
+
22  LDLT_factor(const Eigen::Matrix<double,R,C> &A)
+
23  : N_(0), _ldltP(new Eigen::LDLT< Eigen::Matrix<double,R,C> >())
+
24  {
+
25  compute(A);
+
26  }
+
27 
+
28  inline void compute(const Eigen::Matrix<double,R,C> &A) {
+
29  stan::math::validate_square(A,"LDLT_factor<double>::compute");
+
30  N_ = A.rows();
+
31  _ldltP->compute(A);
+
32  }
+
33 
+
34  inline bool success() const {
+
35  bool ret;
+
36  ret = _ldltP->info() == Eigen::Success;
+
37  ret = ret && _ldltP->isPositive();
+
38  ret = ret && (_ldltP->vectorD().array() > 0).all();
+
39  return ret;
+
40  }
+
41 
+
42  inline double log_abs_det() const {
+
43  return _ldltP->vectorD().array().log().sum();
+
44  }
+
45 
+
46  inline void inverse(Eigen::Matrix<double,R,C> &invA) const {
+
47  invA.setIdentity(N_);
+
48  _ldltP->solveInPlace(invA);
+
49  }
+
50 
+
51  template<typename Rhs>
+
52  inline const Eigen::internal::solve_retval<Eigen::LDLT< Eigen::Matrix<double,R,C> >, Rhs>
+
53  solve(const Eigen::MatrixBase<Rhs>& b) const {
+
54  return _ldltP->solve(b);
+
55  }
+
56 
+
57  inline Eigen::Matrix<double,R,C> solveRight(const Eigen::Matrix<double,R,C> &B) const {
+
58  return _ldltP->solve(B.transpose()).transpose();
+
59  }
+
60 
+
61  inline size_t rows() const { return N_; }
+
62  inline size_t cols() const { return N_; }
+
63 
+
64  typedef size_t size_type;
+
65 
+
66  size_t N_;
+
67  boost::shared_ptr< Eigen::LDLT< Eigen::Matrix<double,R,C> > > _ldltP;
+
68  };
+
69 
+
70  template <int R1,int C1,int R2,int C2>
+
71  inline Eigen::Matrix<double,R1,C2>
+
72  mdivide_left_ldlt(const stan::math::LDLT_factor<double,R1,C1> &A,
+
73  const Eigen::Matrix<double,R2,C2> &b) {
+
74  stan::math::validate_multiplicable(A,b,"mdivide_left_ldlt");
+
75 
+
76  return A.solve(b);
+
77  }
+
78 
+
79  template <typename T1, typename T2, int R1, int C1, int R2, int C2>
+
80  inline
+
81  Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type,R1,C2>
+
82  mdivide_right_ldlt(const Eigen::Matrix<T1,R1,C1> &b,
+
83  const stan::math::LDLT_factor<T2,R2,C2> &A) {
+
84  stan::math::validate_multiplicable(b,A,"mdivide_right_ldlt");
+
85 
+ +
87  }
+
88 
+
89  template <int R1, int C1, int R2, int C2>
+
90  inline Eigen::Matrix<double,R1,C2>
+
91  mdivide_right_ldlt(const Eigen::Matrix<double,R1,C1> &b,
+
92  const stan::math::LDLT_factor<double,R2,C2> &A) {
+
93  stan::math::validate_multiplicable(b,A,"mdivide_right_ldlt");
+
94 
+
95  return A.solveRight(b);
+
96  }
+
97 
+
98  template<int R, int C>
+
99  inline double
+ +
101  return A.log_abs_det();
+
102  }
+
103 
+
104  /*
+
105  * Compute the trace of an inverse quadratic form. I.E., this computes
+
106  * trace(D B^T A^-1 B)
+
107  * where D is a square matrix and the LDLT_factor of A is provided.
+
108  */
+
109  template <int R1,int C1,int R2,int C2,int R3,int C3>
+
110  inline double
+
111  trace_inv_quad_form_ldlt(const Eigen::Matrix<double,R1,C1> &D,
+
112  const stan::math::LDLT_factor<double,R2,C2> &A,
+
113  const Eigen::Matrix<double,R3,C3> &B)
+
114  {
+
115  stan::math::validate_square(D,"trace_inv_quad_form_ldlt");
+
116  stan::math::validate_multiplicable(A,B,"trace_inv_quad_form_ldlt");
+
117  stan::math::validate_multiplicable(B,D,"trace_inv_quad_form_ldlt");
+
118 
+
119  return (D*B.transpose()*A._ldltP->solve(B)).trace();
+
120  }
+
121 
+
122  /*
+
123  * Compute the trace of an inverse quadratic form. I.E., this computes
+
124  * trace(B^T A^-1 B)
+
125  * where the LDLT_factor of A is provided.
+
126  */
+
127  template <int R2,int C2,int R3,int C3>
+
128  inline double
+
129  trace_inv_quad_form_ldlt(const stan::math::LDLT_factor<double,R2,C2> &A,
+
130  const Eigen::Matrix<double,R3,C3> &B)
+
131  {
+
132  stan::math::validate_multiplicable(A,B,"trace_inv_quad_form_ldlt");
+
133 
+
134  return (B.transpose()*A._ldltP->solve(B)).trace();
+
135  }
+
136  }
+
137 }
+
138 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2log_8hpp.html b/doc/api/html/math_2matrix_2log_8hpp.html new file mode 100644 index 00000000000..267951672c6 --- /dev/null +++ b/doc/api/html/math_2matrix_2log_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/matrix/log.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T , int Rows, int Cols>
Eigen::Matrix< T, Rows, Cols > stan::math::log (const Eigen::Matrix< T, Rows, Cols > &m)
 Return the element-wise logarithm of the matrix or vector.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2log_8hpp_source.html b/doc/api/html/math_2matrix_2log_8hpp_source.html new file mode 100644 index 00000000000..7a9c39fc06c --- /dev/null +++ b/doc/api/html/math_2matrix_2log_8hpp_source.html @@ -0,0 +1,124 @@ + + + + + +Stan: src/stan/math/matrix/log.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__LOG_HPP__
+
2 #define __STAN__MATH__MATRIX__LOG_HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
15  template<typename T, int Rows, int Cols>
+
16  inline Eigen::Matrix<T,Rows,Cols> log(const Eigen::Matrix<T,Rows,Cols>& m) {
+
17  return m.array().log().matrix();
+
18  }
+
19 
+
20 
+
21  }
+
22 }
+
23 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2log__determinant_8hpp.html b/doc/api/html/math_2matrix_2log__determinant_8hpp.html new file mode 100644 index 00000000000..13d562ee52f --- /dev/null +++ b/doc/api/html/math_2matrix_2log__determinant_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/math/matrix/log_determinant.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log_determinant.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T , int R, int C>
stan::math::log_determinant (const Eigen::Matrix< T, R, C > &m)
 Returns the log absolute determinant of the specified square matrix.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2log__determinant_8hpp_source.html b/doc/api/html/math_2matrix_2log__determinant_8hpp_source.html new file mode 100644 index 00000000000..6ee864340a0 --- /dev/null +++ b/doc/api/html/math_2matrix_2log__determinant_8hpp_source.html @@ -0,0 +1,125 @@ + + + + + +Stan: src/stan/math/matrix/log_determinant.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log_determinant.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__LOG_DETERMINANT_HPP__
+
2 #define __STAN__MATH__MATRIX__LOG_DETERMINANT_HPP__
+
3 
+ + +
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
17  template <typename T,int R, int C>
+
18  inline T log_determinant(const Eigen::Matrix<T,R,C>& m) {
+
19  stan::math::validate_square(m,"log_determinant");
+
20  return m.colPivHouseholderQr().logAbsDeterminant();
+
21  }
+
22 
+
23  }
+
24 }
+
25 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2log__determinant__spd_8hpp.html b/doc/api/html/math_2matrix_2log__determinant__spd_8hpp.html new file mode 100644 index 00000000000..a1074fe40a7 --- /dev/null +++ b/doc/api/html/math_2matrix_2log__determinant__spd_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/math/matrix/log_determinant_spd.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log_determinant_spd.hpp File Reference
+
+
+
#include <cmath>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/validate_square.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T , int R, int C>
stan::math::log_determinant_spd (const Eigen::Matrix< T, R, C > &m)
 Returns the log absolute determinant of the specified square matrix.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2log__determinant__spd_8hpp_source.html b/doc/api/html/math_2matrix_2log__determinant__spd_8hpp_source.html new file mode 100644 index 00000000000..3ebfa561c34 --- /dev/null +++ b/doc/api/html/math_2matrix_2log__determinant__spd_8hpp_source.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/matrix/log_determinant_spd.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log_determinant_spd.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__LOG_DETERMINANT_SPD_HPP__
+
2 #define __STAN__MATH__MATRIX__LOG_DETERMINANT_SPD_HPP__
+
3 
+
4 
+
5 #include <cmath>
+ + +
8 
+
9 namespace stan {
+
10  namespace math {
+
11 
+
19  template <typename T,int R, int C>
+
20  inline T log_determinant_spd(const Eigen::Matrix<T,R,C>& m) {
+
21  using std::log;
+
22  stan::math::validate_square(m,"log_determinant_spd");
+
23 // Eigen::TriangularView< Eigen::Matrix<T,R,C>, Eigen::Lower > L(m.llt().matrixL());
+
24 // T ret(0.0);
+
25 // for (size_t i = 0; i < L.rows(); i++)
+
26 // ret += log(L(i,i));
+
27 // return 2*ret;
+
28  return m.ldlt().vectorD().array().log().sum();
+
29  }
+
30 
+
31  }
+
32 }
+
33 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2log__softmax_8hpp.html b/doc/api/html/math_2matrix_2log__softmax_8hpp.html new file mode 100644 index 00000000000..3c3d60d77c9 --- /dev/null +++ b/doc/api/html/math_2matrix_2log__softmax_8hpp.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/math/matrix/log_softmax.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log_softmax.hpp File Reference
+
+
+
#include <cmath>
+#include <sstream>
+#include <stdexcept>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/log_sum_exp.hpp>
+#include <stan/math/matrix/validate_nonzero_size.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
stan::math::log_softmax (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v)
 Return the natural logarithm of the softmax of the specified vector.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2log__softmax_8hpp_source.html b/doc/api/html/math_2matrix_2log__softmax_8hpp_source.html new file mode 100644 index 00000000000..3c41b7170e7 --- /dev/null +++ b/doc/api/html/math_2matrix_2log__softmax_8hpp_source.html @@ -0,0 +1,145 @@ + + + + + +Stan: src/stan/math/matrix/log_softmax.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log_softmax.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__LOG_SOFTMAX_HPP__
+
2 #define __STAN__MATH__MATRIX__LOG_SOFTMAX_HPP__
+
3 
+
4 #include <cmath>
+
5 #include <sstream>
+
6 #include <stdexcept>
+ + + +
10 
+
11 namespace stan {
+
12  namespace math {
+
13 
+
21  template <typename T>
+
22  inline Eigen::Matrix<T,Eigen::Dynamic,1>
+
23  log_softmax(const Eigen::Matrix<T,Eigen::Dynamic,1>& v) {
+
24  using std::exp;
+
25  using std::log;
+ +
27  stan::math::validate_nonzero_size(v,"vector softmax");
+
28  Eigen::Matrix<T,Eigen::Dynamic,1> theta(v.size());
+
29  T z = log_sum_exp(v);
+
30  for (int i = 0; i < v.size(); ++i)
+
31  theta(i) = v(i) - z;
+
32  return theta;
+
33  // T sum(0.0);
+
34  // T max_v = v.maxCoeff();
+
35  // for (int i = 0; i < v.size(); ++i)
+
36  // sum += exp(v(i) - max_v); // log_sum_exp trick
+
37  // T log_sum = log(sum);
+
38  // for (int i = 0; i < v.size(); ++i)
+
39  // theta(i) = (v(i) - max_v) - log_sum;
+
40  // return theta;
+
41  }
+
42 
+
43  }
+
44 }
+
45 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2log__sum__exp_8hpp.html b/doc/api/html/math_2matrix_2log__sum__exp_8hpp.html new file mode 100644 index 00000000000..087ccee7bbd --- /dev/null +++ b/doc/api/html/math_2matrix_2log__sum__exp_8hpp.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/math/matrix/log_sum_exp.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log_sum_exp.hpp File Reference
+
+
+
#include <limits>
+#include <vector>
+#include <boost/math/tools/promotion.hpp>
+#include <stan/math/functions/log1p.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T , int R, int C>
stan::math::log_sum_exp (const Eigen::Matrix< T, R, C > &x)
 Return the log of the sum of the exponentiated values of the specified matrix of values.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2log__sum__exp_8hpp_source.html b/doc/api/html/math_2matrix_2log__sum__exp_8hpp_source.html new file mode 100644 index 00000000000..d62f7e2cda1 --- /dev/null +++ b/doc/api/html/math_2matrix_2log__sum__exp_8hpp_source.html @@ -0,0 +1,143 @@ + + + + + +Stan: src/stan/math/matrix/log_sum_exp.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log_sum_exp.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__LOG_SUM_EXP_HPP__
+
2 #define __STAN__MATH__MATRIX__LOG_SUM_EXP_HPP__
+
3 
+
4 #include <limits>
+
5 #include <vector>
+
6 #include <boost/math/tools/promotion.hpp>
+ + +
9 
+
10 
+
11 namespace stan {
+
12 
+
13  namespace math {
+
14 
+
28  template <typename T, int R, int C>
+
29  T log_sum_exp(const Eigen::Matrix<T,R,C>& x) {
+
30  using std::numeric_limits;
+
31  using std::log;
+
32  using std::exp;
+
33  T max = -numeric_limits<T>::infinity();
+
34  for (int i = 0; i < x.size(); i++)
+
35  if (x(i) > max)
+
36  max = x(i);
+
37 
+
38  T sum = 0.0;
+
39  for (int i = 0; i < x.size(); i++)
+
40  if (x(i) != -numeric_limits<double>::infinity())
+
41  sum += exp(x(i) - max);
+
42 
+
43  return max + log(sum);
+
44  }
+
45 
+
46  }
+
47 }
+
48 
+
49 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2mdivide__left_8hpp.html b/doc/api/html/math_2matrix_2mdivide__left_8hpp.html new file mode 100644 index 00000000000..92a21fdd580 --- /dev/null +++ b/doc/api/html/math_2matrix_2mdivide__left_8hpp.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/math/matrix/mdivide_left.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
mdivide_left.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/promote_common.hpp>
+#include <stan/math/matrix/validate_multiplicable.hpp>
+#include <stan/math/matrix/validate_square.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T1 , typename T2 , int R1, int C1, int R2, int C2>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R1, C2 > 
stan::math::mdivide_left (const Eigen::Matrix< T1, R1, C1 > &A, const Eigen::Matrix< T2, R2, C2 > &b)
 Returns the solution of the system Ax=b.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2mdivide__left_8hpp_source.html b/doc/api/html/math_2matrix_2mdivide__left_8hpp_source.html new file mode 100644 index 00000000000..0149f7b64e1 --- /dev/null +++ b/doc/api/html/math_2matrix_2mdivide__left_8hpp_source.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/math/matrix/mdivide_left.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
mdivide_left.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__MDIVIDE_LEFT_HPP__
+
2 #define __STAN__MATH__MATRIX__MDIVIDE_LEFT_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+ + + + +
9 
+
10 namespace stan {
+
11  namespace math {
+
12 
+
21  template <typename T1, typename T2, int R1, int C1, int R2, int C2>
+
22  inline
+
23  Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type,R1,C2>
+
24  mdivide_left(const Eigen::Matrix<T1,R1,C1> &A,
+
25  const Eigen::Matrix<T2,R2,C2> &b) {
+
26  stan::math::validate_square(A,"mdivide_left");
+
27  stan::math::validate_multiplicable(A,b,"mdivide_left");
+
28  return promote_common<Eigen::Matrix<T1,R1,C1>,
+
29  Eigen::Matrix<T2,R1,C1> >(A)
+
30  .lu()
+
31  .solve( promote_common<Eigen::Matrix<T1,R2,C2>,
+
32  Eigen::Matrix<T2,R2,C2> >(b) );
+
33  }
+
34 
+
35  }
+
36 }
+
37 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2mdivide__left__spd_8hpp.html b/doc/api/html/math_2matrix_2mdivide__left__spd_8hpp.html new file mode 100644 index 00000000000..ff624eb22ad --- /dev/null +++ b/doc/api/html/math_2matrix_2mdivide__left__spd_8hpp.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/math/matrix/mdivide_left_spd.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
mdivide_left_spd.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/promote_common.hpp>
+#include <stan/math/matrix/validate_multiplicable.hpp>
+#include <stan/math/matrix/validate_square.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T1 , typename T2 , int R1, int C1, int R2, int C2>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R1, C2 > 
stan::math::mdivide_left_spd (const Eigen::Matrix< T1, R1, C1 > &A, const Eigen::Matrix< T2, R2, C2 > &b)
 Returns the solution of the system Ax=b where A is symmetric positive definite.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2mdivide__left__spd_8hpp_source.html b/doc/api/html/math_2matrix_2mdivide__left__spd_8hpp_source.html new file mode 100644 index 00000000000..88976ccea8e --- /dev/null +++ b/doc/api/html/math_2matrix_2mdivide__left__spd_8hpp_source.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/math/matrix/mdivide_left_spd.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
mdivide_left_spd.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__MDIVIDE_LEFT_SPD_HPP__
+
2 #define __STAN__MATH__MATRIX__MDIVIDE_LEFT_SPD_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+ + + + +
9 
+
10 namespace stan {
+
11  namespace math {
+
12 
+
22  template <typename T1, typename T2, int R1, int C1, int R2, int C2>
+
23  inline
+
24  Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type,R1,C2>
+
25  mdivide_left_spd(const Eigen::Matrix<T1,R1,C1> &A,
+
26  const Eigen::Matrix<T2,R2,C2> &b) {
+
27  stan::math::validate_square(A,"mdivide_left_spd");
+
28  stan::math::validate_multiplicable(A,b,"mdivide_left_spd");
+
29  return promote_common<Eigen::Matrix<T1,R1,C1>,
+
30  Eigen::Matrix<T2,R1,C1> >(A)
+
31  .llt()
+
32  .solve( promote_common<Eigen::Matrix<T1,R2,C2>,
+
33  Eigen::Matrix<T2,R2,C2> >(b) );
+
34  }
+
35 
+
36  }
+
37 }
+
38 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2mdivide__left__tri_8hpp.html b/doc/api/html/math_2matrix_2mdivide__left__tri_8hpp.html new file mode 100644 index 00000000000..e9706b3f2b6 --- /dev/null +++ b/doc/api/html/math_2matrix_2mdivide__left__tri_8hpp.html @@ -0,0 +1,140 @@ + + + + + +Stan: src/stan/math/matrix/mdivide_left_tri.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
mdivide_left_tri.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/promote_common.hpp>
+#include <stan/math/matrix/validate_multiplicable.hpp>
+#include <stan/math/matrix/validate_square.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + +

+Functions

template<int TriView, typename T1 , typename T2 , int R1, int C1, int R2, int C2>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R1, C2 > 
stan::math::mdivide_left_tri (const Eigen::Matrix< T1, R1, C1 > &A, const Eigen::Matrix< T2, R2, C2 > &b)
 Returns the solution of the system Ax=b when A is triangular.
 
template<int TriView, typename T , int R1, int C1>
Eigen::Matrix< T, R1, C1 > stan::math::mdivide_left_tri (const Eigen::Matrix< T, R1, C1 > &A)
 Returns the solution of the system Ax=b when A is triangular and b=I.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2mdivide__left__tri_8hpp_source.html b/doc/api/html/math_2matrix_2mdivide__left__tri_8hpp_source.html new file mode 100644 index 00000000000..1cb729d39f5 --- /dev/null +++ b/doc/api/html/math_2matrix_2mdivide__left__tri_8hpp_source.html @@ -0,0 +1,149 @@ + + + + + +Stan: src/stan/math/matrix/mdivide_left_tri.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
mdivide_left_tri.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__MDIVIDE_LEFT_TRI_HPP__
+
2 #define __STAN__MATH__MATRIX__MDIVIDE_LEFT_TRI_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+ + + + +
9 
+
10 namespace stan {
+
11  namespace math {
+
12 
+
22  template <int TriView, typename T1, typename T2,
+
23  int R1, int C1, int R2, int C2>
+
24  inline
+
25  Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type,
+
26  R1,C2>
+
27  mdivide_left_tri(const Eigen::Matrix<T1,R1,C1> &A,
+
28  const Eigen::Matrix<T2,R2,C2> &b) {
+
29  stan::math::validate_square(A,"mdivide_left_tri");
+
30  stan::math::validate_multiplicable(A,b,"mdivide_left_tri");
+
31  return promote_common<Eigen::Matrix<T1,R1,C1>,Eigen::Matrix<T2,R1,C1> >(A)
+
32  .template triangularView<TriView>()
+
33  .solve( promote_common<Eigen::Matrix<T1,R2,C2>,
+
34  Eigen::Matrix<T2,R2,C2> >(b) );
+
35  }
+
36 
+
44  template<int TriView, typename T,int R1, int C1>
+
45  inline
+
46  Eigen::Matrix<T,R1,C1>
+
47  mdivide_left_tri(const Eigen::Matrix<T,R1,C1> &A) {
+
48  stan::math::validate_square(A,"mdivide_left_tri");
+
49  int n = A.rows();
+
50  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> b;
+
51  b.setIdentity(n,n);
+
52  A.template triangularView<TriView>().solveInPlace(b);
+
53  return b;
+
54  }
+
55 
+
56  }
+
57 }
+
58 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2mdivide__left__tri__low_8hpp.html b/doc/api/html/math_2matrix_2mdivide__left__tri__low_8hpp.html new file mode 100644 index 00000000000..693f782ae54 --- /dev/null +++ b/doc/api/html/math_2matrix_2mdivide__left__tri__low_8hpp.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/math/matrix/mdivide_left_tri_low.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
mdivide_left_tri_low.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/mdivide_left_tri.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + +

+Functions

template<typename T1 , typename T2 , int R1, int C1, int R2, int C2>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R1, C2 > 
stan::math::mdivide_left_tri_low (const Eigen::Matrix< T1, R1, C1 > &A, const Eigen::Matrix< T2, R2, C2 > &b)
 
template<typename T , int R1, int C1>
Eigen::Matrix< T, R1, C1 > stan::math::mdivide_left_tri_low (const Eigen::Matrix< T, R1, C1 > &A)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2mdivide__left__tri__low_8hpp_source.html b/doc/api/html/math_2matrix_2mdivide__left__tri__low_8hpp_source.html new file mode 100644 index 00000000000..96a46a61f1b --- /dev/null +++ b/doc/api/html/math_2matrix_2mdivide__left__tri__low_8hpp_source.html @@ -0,0 +1,149 @@ + + + + + +Stan: src/stan/math/matrix/mdivide_left_tri_low.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
mdivide_left_tri_low.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__MDIVIDE_LEFT_TRI_LOW_HPP__
+
2 #define __STAN__MATH__MATRIX__MDIVIDE_LEFT_TRI_LOW_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+ + +
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
11  template <typename T1, typename T2, int R1,int C1,int R2,int C2>
+
12  inline
+
13  Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type,
+
14  R1,C2>
+
15  mdivide_left_tri_low(const Eigen::Matrix<T1,R1,C1> &A,
+
16  const Eigen::Matrix<T2,R2,C2> &b) {
+
17 // stan::math::validate_square(A,"mdivide_left_tri_low/2");
+
18 // stan::math::validate_multiplicable(A,b,"mdivide_left_tri_low");
+
19 // return promote_common<Eigen::Matrix<T1,R1,C1>,
+
20 // Eigen::Matrix<T2,R1,C1> >(A)
+
21 // .template triangularView<Eigen::Lower>()
+
22 // .solve( promote_common<Eigen::Matrix<T1,R2,C2>,
+
23 // Eigen::Matrix<T2,R2,C2> >(b) );
+
24  return mdivide_left_tri<Eigen::Lower,T1,T2,R1,C1,R2,C2>(A,b);
+
25  }
+
26  template <typename T,int R1, int C1>
+
27  inline
+
28  Eigen::Matrix<T,R1,C1>
+ +
30  Eigen::Matrix<T,R1,C1> &A) {
+
31 // stan::math::validate_square(A,"mdivide_left_tri_low/1");
+
32 // int n = A.rows();
+
33 // Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> b;
+
34 // b.setIdentity(n,n);
+
35 // A.template triangularView<Eigen::Lower>().solveInPlace(b);
+
36 // return b;
+
37  return mdivide_left_tri<Eigen::Lower,T,R1,C1>(A);
+
38  }
+
39 
+
40  }
+
41 }
+
42 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2mdivide__right_8hpp.html b/doc/api/html/math_2matrix_2mdivide__right_8hpp.html new file mode 100644 index 00000000000..cda1b32264c --- /dev/null +++ b/doc/api/html/math_2matrix_2mdivide__right_8hpp.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/math/matrix/mdivide_right.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
mdivide_right.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T1 , typename T2 , int R1, int C1, int R2, int C2>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R1, C2 > 
stan::math::mdivide_right (const Eigen::Matrix< T1, R1, C1 > &b, const Eigen::Matrix< T2, R2, C2 > &A)
 Returns the solution of the system Ax=b.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2mdivide__right_8hpp_source.html b/doc/api/html/math_2matrix_2mdivide__right_8hpp_source.html new file mode 100644 index 00000000000..62556706dd0 --- /dev/null +++ b/doc/api/html/math_2matrix_2mdivide__right_8hpp_source.html @@ -0,0 +1,142 @@ + + + + + +Stan: src/stan/math/matrix/mdivide_right.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
mdivide_right.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__MDIVIDE_RIGHT_HPP__
+
2 #define __STAN__MATH__MATRIX__MDIVIDE_RIGHT_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+ + + + + +
10 
+
11 namespace stan {
+
12  namespace math {
+
13 
+
22  template <typename T1, typename T2, int R1, int C1, int R2, int C2>
+
23  inline
+
24  Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type,R1,C2>
+
25  mdivide_right(const Eigen::Matrix<T1,R1,C1> &b,
+
26  const Eigen::Matrix<T2,R2,C2> &A) {
+
27  stan::math::validate_square(A,"mdivide_right");
+
28  stan::math::validate_multiplicable(b,A,"mdivide_right");
+
29  // FIXME: This is nice and general but likely slow.
+ +
31 // return promote_common<Eigen::Matrix<T1,R2,C2>,
+
32 // Eigen::Matrix<T2,R2,C2> >(A)
+
33 // .transpose()
+
34 // .lu()
+
35 // .solve(promote_common<Eigen::Matrix<T1,R1,C1>,
+
36 // Eigen::Matrix<T2,R1,C1> >(b)
+
37 // .transpose())
+
38 // .transpose();
+
39  }
+
40 
+
41  }
+
42 }
+
43 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2mdivide__right__tri__low_8hpp.html b/doc/api/html/math_2matrix_2mdivide__right__tri__low_8hpp.html new file mode 100644 index 00000000000..0974e445398 --- /dev/null +++ b/doc/api/html/math_2matrix_2mdivide__right__tri__low_8hpp.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/math/matrix/mdivide_right_tri_low.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
mdivide_right_tri_low.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/mdivide_right_tri.hpp>
+#include <stan/math/matrix/promote_common.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T1 , typename T2 , int R1, int C1, int R2, int C2>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R1, C2 > 
stan::math::mdivide_right_tri_low (const Eigen::Matrix< T1, R1, C1 > &b, const Eigen::Matrix< T2, R2, C2 > &A)
 Returns the solution of the system tri(A)x=b when tri(A) is a lower triangular view of the matrix A.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2mdivide__right__tri__low_8hpp_source.html b/doc/api/html/math_2matrix_2mdivide__right__tri__low_8hpp_source.html new file mode 100644 index 00000000000..0357289c2b7 --- /dev/null +++ b/doc/api/html/math_2matrix_2mdivide__right__tri__low_8hpp_source.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/matrix/mdivide_right_tri_low.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
mdivide_right_tri_low.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__MDIVIDE_RIGHT_TRI_LOW_HPP__
+
2 #define __STAN__MATH__MATRIX__MDIVIDE_RIGHT_TRI_LOW_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+ + + +
8 
+
9 namespace stan {
+
10  namespace math {
+
11 
+
21  template <typename T1, typename T2, int R1,int C1,int R2,int C2>
+
22  inline
+
23  Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type,R1,C2>
+
24  mdivide_right_tri_low(const Eigen::Matrix<T1,R1,C1> &b,
+
25  const Eigen::Matrix<T2,R2,C2> &A) {
+
26  return mdivide_right_tri<Eigen::Lower>
+
27  (promote_common<Eigen::Matrix<T1,R1,C1>,
+
28  Eigen::Matrix<T2,R1,C1> >(b),
+
29  promote_common<Eigen::Matrix<T1,R2,C2>,
+
30  Eigen::Matrix<T2,R2,C2> >(A));
+
31  }
+
32 
+
33  }
+
34 }
+
35 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2multiply_8hpp.html b/doc/api/html/math_2matrix_2multiply_8hpp.html new file mode 100644 index 00000000000..42f563d9084 --- /dev/null +++ b/doc/api/html/math_2matrix_2multiply_8hpp.html @@ -0,0 +1,152 @@ + + + + + +Stan: src/stan/math/matrix/multiply.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
multiply.hpp File Reference
+
+
+
#include <boost/type_traits/is_arithmetic.hpp>
+#include <boost/utility/enable_if.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/validate_matching_sizes.hpp>
+#include <stan/math/matrix/validate_multiplicable.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + + + + + + + + + +

+Functions

template<int R, int C, typename T >
boost::enable_if_c
+< boost::is_arithmetic< T >
+::value, Eigen::Matrix< double,
+R, C > >::type 
stan::math::multiply (const Eigen::Matrix< double, R, C > &m, T c)
 Return specified matrix multiplied by specified scalar.
 
template<int R, int C, typename T >
boost::enable_if_c
+< boost::is_arithmetic< T >
+::value, Eigen::Matrix< double,
+R, C > >::type 
stan::math::multiply (T c, const Eigen::Matrix< double, R, C > &m)
 Return specified scalar multiplied by specified matrix.
 
template<int R1, int C1, int R2, int C2>
Eigen::Matrix< double, R1, C2 > stan::math::multiply (const Eigen::Matrix< double, R1, C1 > &m1, const Eigen::Matrix< double, R2, C2 > &m2)
 Return the product of the specified matrices.
 
template<int C1, int R2>
double stan::math::multiply (const Eigen::Matrix< double, 1, C1 > &rv, const Eigen::Matrix< double, R2, 1 > &v)
 Return the scalar product of the specified row vector and specified column vector.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2multiply_8hpp_source.html b/doc/api/html/math_2matrix_2multiply_8hpp_source.html new file mode 100644 index 00000000000..52abcc07304 --- /dev/null +++ b/doc/api/html/math_2matrix_2multiply_8hpp_source.html @@ -0,0 +1,160 @@ + + + + + +Stan: src/stan/math/matrix/multiply.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
multiply.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__MULTIPLY_HPP__
+
2 #define __STAN__MATH__MATRIX__MULTIPLY_HPP__
+
3 
+
4 #include <boost/type_traits/is_arithmetic.hpp>
+
5 #include <boost/utility/enable_if.hpp>
+ + + +
9 
+
10 namespace stan {
+
11  namespace math {
+
12 
+
21  template <int R, int C, typename T>
+
22  inline
+
23  typename boost::enable_if_c<boost::is_arithmetic<T>::value,
+
24  Eigen::Matrix<double, R, C> >::type
+
25  multiply(const Eigen::Matrix<double, R, C>& m,
+
26  T c) {
+
27  return c * m;
+
28  }
+
29 
+
30  // FIXME: apply above pattern everywhere below to remove
+
31  // extra defs, etc.
+
32 
+
41  template <int R, int C, typename T>
+
42  inline
+
43  typename boost::enable_if_c<boost::is_arithmetic<T>::value,
+
44  Eigen::Matrix<double, R, C> >::type
+
45  multiply(T c,
+
46  const Eigen::Matrix<double,R,C>& m) {
+
47  return c * m;
+
48  }
+
49 
+
60  template<int R1,int C1,int R2,int C2>
+
61  inline Eigen::Matrix<double,R1,C2> multiply(const Eigen::Matrix<double,R1,C1>& m1,
+
62  const Eigen::Matrix<double,R2,C2>& m2) {
+
63 
+
64  validate_multiplicable(m1,m2,"multiply");
+
65  return m1*m2;
+
66  }
+
67 
+
77  template<int C1,int R2>
+
78  inline double multiply(const Eigen::Matrix<double,1,C1>& rv,
+
79  const Eigen::Matrix<double,R2,1>& v) {
+
80  stan::math::validate_matching_sizes(rv,v,"multiply");
+
81  if (rv.size() != v.size())
+
82  throw std::domain_error("rv.size() != v.size()");
+
83  return rv.dot(v);
+
84  }
+
85 
+
86  }
+
87 }
+
88 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2multiply__lower__tri__self__transpose_8hpp.html b/doc/api/html/math_2matrix_2multiply__lower__tri__self__transpose_8hpp.html new file mode 100644 index 00000000000..eec031cd03f --- /dev/null +++ b/doc/api/html/math_2matrix_2multiply__lower__tri__self__transpose_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/matrix/multiply_lower_tri_self_transpose.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
multiply_lower_tri_self_transpose.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

matrix_d stan::math::multiply_lower_tri_self_transpose (const matrix_d &L)
 Returns the result of multiplying the lower triangular portion of the input matrix by its own transpose.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2multiply__lower__tri__self__transpose_8hpp_source.html b/doc/api/html/math_2matrix_2multiply__lower__tri__self__transpose_8hpp_source.html new file mode 100644 index 00000000000..6bddbbe228d --- /dev/null +++ b/doc/api/html/math_2matrix_2multiply__lower__tri__self__transpose_8hpp_source.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/matrix/multiply_lower_tri_self_transpose.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
multiply_lower_tri_self_transpose.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__MULTIPLY_LOWER_TRI_SELF_HPP__
+
2 #define __STAN__MATH__MATRIX__MULTIPLY_LOWER_TRI_SELF_HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
17  inline matrix_d
+ +
19  if (L.rows() == 0)
+
20  return matrix_d(0,0);
+
21  if (L.rows() == 1) {
+
22  matrix_d result(1,1);
+
23  result(0,0) = L(0,0) * L(0,0);
+
24  return result;
+
25  }
+
26  // FIXME: write custom following agrad/matrix because can't get L_tri into
+
27  // multiplication as no template support for tri * tri
+
28  matrix_d L_tri = L.transpose().triangularView<Eigen::Upper>();
+
29  return L.triangularView<Eigen::Lower>() * L_tri;
+
30  }
+
31 
+
32  }
+
33 }
+
34 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2quad__form_8hpp.html b/doc/api/html/math_2matrix_2quad__form_8hpp.html new file mode 100644 index 00000000000..1b3059d0aed --- /dev/null +++ b/doc/api/html/math_2matrix_2quad__form_8hpp.html @@ -0,0 +1,144 @@ + + + + + +Stan: src/stan/math/matrix/quad_form.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
quad_form.hpp File Reference
+
+
+
#include <boost/utility/enable_if.hpp>
+#include <boost/type_traits.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/validate_multiplicable.hpp>
+#include <stan/math/matrix/validate_square.hpp>
+#include <stan/math/matrix/validate_symmetric.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + + + + + + +

+Functions

template<int RA, int CA, int RB, int CB>
Eigen::Matrix< double, CB, CB > stan::math::quad_form (const Eigen::Matrix< double, RA, CA > &A, const Eigen::Matrix< double, RB, CB > &B)
 Compute B^T A B.
 
template<int RA, int CA, int RB>
double stan::math::quad_form (const Eigen::Matrix< double, RA, CA > &A, const Eigen::Matrix< double, RB, 1 > &B)
 
template<int RA, int CA, int RB, int CB>
Eigen::Matrix< double, CB, CB > stan::math::quad_form_sym (const Eigen::Matrix< double, RA, CA > &A, const Eigen::Matrix< double, RB, CB > &B)
 
template<int RA, int CA, int RB>
double stan::math::quad_form_sym (const Eigen::Matrix< double, RA, CA > &A, const Eigen::Matrix< double, RB, 1 > &B)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2quad__form_8hpp_source.html b/doc/api/html/math_2matrix_2quad__form_8hpp_source.html new file mode 100644 index 00000000000..e352afe6d65 --- /dev/null +++ b/doc/api/html/math_2matrix_2quad__form_8hpp_source.html @@ -0,0 +1,166 @@ + + + + + +Stan: src/stan/math/matrix/quad_form.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
quad_form.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__QUAD_FORM_HPP__
+
2 #define __STAN__MATH__MATRIX__QUAD_FORM_HPP__
+
3 
+
4 #include <boost/utility/enable_if.hpp>
+
5 #include <boost/type_traits.hpp>
+ + + + +
10 
+
11 namespace stan {
+
12  namespace math {
+
16  template<int RA,int CA,int RB,int CB>
+
17  inline Eigen::Matrix<double,CB,CB>
+
18  quad_form(const Eigen::Matrix<double,RA,CA> &A,
+
19  const Eigen::Matrix<double,RB,CB> &B)
+
20  {
+
21  validate_square(A,"quad_form");
+
22  validate_multiplicable(A,B,"quad_form");
+
23  return B.transpose()*A*B;
+
24  }
+
25 
+
26  template<int RA,int CA,int RB>
+
27  inline double
+
28  quad_form(const Eigen::Matrix<double,RA,CA> &A,
+
29  const Eigen::Matrix<double,RB,1> &B)
+
30  {
+
31  validate_square(A,"quad_form");
+
32  validate_multiplicable(A,B,"quad_form");
+
33  return B.dot(A*B);
+
34  }
+
35 
+
36  template<int RA,int CA,int RB,int CB>
+
37  inline Eigen::Matrix<double,CB,CB>
+
38  quad_form_sym(const Eigen::Matrix<double,RA,CA> &A,
+
39  const Eigen::Matrix<double,RB,CB> &B)
+
40  {
+
41  validate_square(A,"quad_form_sym");
+
42  validate_multiplicable(A,B,"quad_form_sym");
+
43  validate_symmetric(A,"quad_form_sym");
+
44  Eigen::Matrix<double,CB,CB> ret(B.transpose()*A*B);
+
45  return 0.5*(ret + ret.transpose());
+
46  }
+
47 
+
48  template<int RA,int CA,int RB>
+
49  inline double
+
50  quad_form_sym(const Eigen::Matrix<double,RA,CA> &A,
+
51  const Eigen::Matrix<double,RB,1> &B)
+
52  {
+
53  validate_square(A,"quad_form_sym");
+
54  validate_multiplicable(A,B,"quad_form_sym");
+
55  validate_symmetric(A,"quad_form_sym");
+
56  return B.dot(A*B);
+
57  }
+
58  }
+
59 }
+
60 
+
61 #endif
+
62 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2rows__dot__product_8hpp.html b/doc/api/html/math_2matrix_2rows__dot__product_8hpp.html new file mode 100644 index 00000000000..58308baff38 --- /dev/null +++ b/doc/api/html/math_2matrix_2rows__dot__product_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/math/matrix/rows_dot_product.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
rows_dot_product.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<int R1, int C1, int R2, int C2>
Eigen::Matrix< double, R1, 1 > stan::math::rows_dot_product (const Eigen::Matrix< double, R1, C1 > &v1, const Eigen::Matrix< double, R2, C2 > &v2)
 Returns the dot product of the specified vectors.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2rows__dot__product_8hpp_source.html b/doc/api/html/math_2matrix_2rows__dot__product_8hpp_source.html new file mode 100644 index 00000000000..a136de003d0 --- /dev/null +++ b/doc/api/html/math_2matrix_2rows__dot__product_8hpp_source.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/math/matrix/rows_dot_product.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
rows_dot_product.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__ROWS_DOT_PRODUCT_HPP__
+
2 #define __STAN__MATH__MATRIX__ROWS_DOT_PRODUCT_HPP__
+
3 
+ + + +
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
20  template<int R1,int C1,int R2, int C2>
+
21  inline Eigen::Matrix<double, R1, 1>
+
22  rows_dot_product(const Eigen::Matrix<double, R1, C1>& v1,
+
23  const Eigen::Matrix<double, R2, C2>& v2) {
+
24  validate_matching_sizes(v1,v2,"rows_dot_product");
+
25  Eigen::Matrix<double, R1, 1> ret(v1.rows(),1);
+
26  for (size_type j = 0; j < v1.rows(); ++j) {
+
27  ret(j) = v1.row(j).dot(v2.row(j));
+
28  }
+
29  return ret;
+
30  }
+
31 
+
32  }
+
33 }
+
34 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2rows__dot__self_8hpp.html b/doc/api/html/math_2matrix_2rows__dot__self_8hpp.html new file mode 100644 index 00000000000..0e69d0e8936 --- /dev/null +++ b/doc/api/html/math_2matrix_2rows__dot__self_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/matrix/rows_dot_self.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
rows_dot_self.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T , int R, int C>
Eigen::Matrix< T, R, 1 > stan::math::rows_dot_self (const Eigen::Matrix< T, R, C > &x)
 Returns the dot product of each row of a matrix with itself.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2rows__dot__self_8hpp_source.html b/doc/api/html/math_2matrix_2rows__dot__self_8hpp_source.html new file mode 100644 index 00000000000..ea2874ef2f3 --- /dev/null +++ b/doc/api/html/math_2matrix_2rows__dot__self_8hpp_source.html @@ -0,0 +1,124 @@ + + + + + +Stan: src/stan/math/matrix/rows_dot_self.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
rows_dot_self.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__ROWS_DOT_SELF_HPP__
+
2 #define __STAN__MATH__MATRIX__ROWS_DOT_SELF_HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
14  template<typename T,int R,int C>
+
15  inline Eigen::Matrix<T,R,1>
+
16  rows_dot_self(const Eigen::Matrix<T,R,C>& x) {
+
17  return x.rowwise().squaredNorm();
+
18  }
+
19 
+
20  }
+
21 }
+
22 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2sd_8hpp.html b/doc/api/html/math_2matrix_2sd_8hpp.html new file mode 100644 index 00000000000..1ec96016a3e --- /dev/null +++ b/doc/api/html/math_2matrix_2sd_8hpp.html @@ -0,0 +1,140 @@ + + + + + +Stan: src/stan/math/matrix/sd.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
sd.hpp File Reference
+
+
+
#include <vector>
+#include <boost/math/tools/promotion.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/variance.hpp>
+#include <stan/math/matrix/validate_nonzero_size.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + +

+Functions

template<typename T >
boost::math::tools::promote_args
+< T >::type 
stan::math::sd (const std::vector< T > &v)
 Returns the unbiased sample standard deviation of the coefficients in the specified column vector.
 
template<typename T , int R, int C>
boost::math::tools::promote_args
+< T >::type 
stan::math::sd (const Eigen::Matrix< T, R, C > &m)
 Returns the unbiased sample standard deviation of the coefficients in the specified vector, row vector, or matrix.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2sd_8hpp_source.html b/doc/api/html/math_2matrix_2sd_8hpp_source.html new file mode 100644 index 00000000000..d8506bdf4c8 --- /dev/null +++ b/doc/api/html/math_2matrix_2sd_8hpp_source.html @@ -0,0 +1,141 @@ + + + + + +Stan: src/stan/math/matrix/sd.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
sd.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__SD_HPP__
+
2 #define __STAN__MATH__MATRIX__SD_HPP__
+
3 
+
4 #include <vector>
+
5 #include <boost/math/tools/promotion.hpp>
+ + + +
9 
+
10 namespace stan {
+
11  namespace math {
+
12 
+
19  template <typename T>
+
20  inline
+
21  typename boost::math::tools::promote_args<T>::type
+
22  sd(const std::vector<T>& v) {
+
23  validate_nonzero_size(v,"sd");
+
24  if (v.size() == 1) return 0.0;
+
25  return sqrt(variance(v));
+
26  }
+
27 
+
34  template <typename T, int R, int C>
+
35  inline
+
36  typename boost::math::tools::promote_args<T>::type
+
37  sd(const Eigen::Matrix<T,R,C>& m) {
+
38  // FIXME: redundant with test in variance; second line saves sqrt
+
39  validate_nonzero_size(m,"sd");
+
40  if (m.size() == 1) return 0.0;
+
41  return sqrt(variance(m));
+
42  }
+
43 
+
44  }
+
45 }
+
46 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2softmax_8hpp.html b/doc/api/html/math_2matrix_2softmax_8hpp.html new file mode 100644 index 00000000000..0cf2bfdb475 --- /dev/null +++ b/doc/api/html/math_2matrix_2softmax_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/matrix/softmax.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
softmax.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
stan::math::softmax (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v)
 Return the softmax of the specified vector.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2softmax_8hpp_source.html b/doc/api/html/math_2matrix_2softmax_8hpp_source.html new file mode 100644 index 00000000000..3d8926b2f7e --- /dev/null +++ b/doc/api/html/math_2matrix_2softmax_8hpp_source.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/math/matrix/softmax.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
softmax.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__SOFTMAX_HPP__
+
2 #define __STAN__MATH__MATRIX__SOFTMAX_HPP__
+
3 
+
4 #include <cmath>
+ + +
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
18  template <typename T>
+
19  inline Eigen::Matrix<T,Eigen::Dynamic,1>
+
20  softmax(const Eigen::Matrix<T,Eigen::Dynamic,1>& v) {
+
21  using std::exp;
+
22  stan::math::validate_nonzero_size(v,"vector softmax");
+
23  Eigen::Matrix<T,Eigen::Dynamic,1> theta(v.size());
+
24  T sum(0.0);
+
25  T max_v = v.maxCoeff();
+
26  for (int i = 0; i < v.size(); ++i) {
+
27  theta(i) = exp(v(i) - max_v); // extra work for (v[i] == max_v)
+
28  sum += theta(i); // extra work vs. sum() w. auto-diff
+
29  }
+
30  for (int i = 0; i < v.size(); ++i)
+
31  theta(i) /= sum;
+
32  return theta;
+
33  }
+
34 
+
35  }
+
36 }
+
37 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2sort_8hpp.html b/doc/api/html/math_2matrix_2sort_8hpp.html new file mode 100644 index 00000000000..1650dcec9ec --- /dev/null +++ b/doc/api/html/math_2matrix_2sort_8hpp.html @@ -0,0 +1,145 @@ + + + + + +Stan: src/stan/math/matrix/sort.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
sort.hpp File Reference
+
+
+
#include <stan/math/matrix/Eigen.hpp>
+#include <vector>
+#include <algorithm>
+#include <functional>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + + + + + + + + + +

+Functions

template<typename T >
std::vector< T > stan::math::sort_asc (std::vector< T > xs)
 Return the specified standard vector in ascending order.
 
template<typename T >
std::vector< T > stan::math::sort_desc (std::vector< T > xs)
 Return the specified standard vector in descending order.
 
template<typename T , int R, int C>
Eigen::Matrix< T, R, C > stan::math::sort_asc (Eigen::Matrix< T, R, C > xs)
 Return the specified eigen vector in ascending order.
 
template<typename T , int R, int C>
Eigen::Matrix< T, R, C > stan::math::sort_desc (Eigen::Matrix< T, R, C > xs)
 Return the specified eigen vector in descending order.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2sort_8hpp_source.html b/doc/api/html/math_2matrix_2sort_8hpp_source.html new file mode 100644 index 00000000000..2a50555ff0d --- /dev/null +++ b/doc/api/html/math_2matrix_2sort_8hpp_source.html @@ -0,0 +1,145 @@ + + + + + +Stan: src/stan/math/matrix/sort.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
sort.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__SORT_HPP__
+
2 #define __STAN__MATH__MATRIX__SORT_HPP__
+
3 
+ +
5 #include <vector>
+
6 #include <algorithm> // std::sort
+
7 #include <functional> // std::greater
+
8 
+
9 namespace stan {
+
10  namespace math {
+
11 
+
19  template <typename T>
+
20  inline typename std::vector<T> sort_asc(std::vector<T> xs) {
+
21  std::sort(xs.begin(), xs.end());
+
22  return xs;
+
23  }
+
24 
+
32  template <typename T>
+
33  inline typename std::vector<T> sort_desc(std::vector<T> xs) {
+
34  std::sort(xs.begin(), xs.end(), std::greater<T>());
+
35  return xs;
+
36  }
+
37 
+
45  template <typename T, int R, int C>
+
46  inline typename Eigen::Matrix<T,R,C> sort_asc(Eigen::Matrix<T,R,C> xs) {
+
47  std::sort(xs.data(), xs.data()+xs.size());
+
48  return xs;
+
49  }
+
50 
+
58  template <typename T, int R, int C>
+
59  inline typename Eigen::Matrix<T,R,C> sort_desc(Eigen::Matrix<T,R,C> xs) {
+
60  std::sort(xs.data(), xs.data()+xs.size(), std::greater<T>());
+
61  return xs;
+
62  }
+
63 
+
64  }
+
65 }
+
66 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2squared__dist_8hpp.html b/doc/api/html/math_2matrix_2squared__dist_8hpp.html new file mode 100644 index 00000000000..52552e59657 --- /dev/null +++ b/doc/api/html/math_2matrix_2squared__dist_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/math/matrix/squared_dist.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
squared_dist.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<int R1, int C1, int R2, int C2>
double stan::math::squared_dist (const Eigen::Matrix< double, R1, C1 > &v1, const Eigen::Matrix< double, R2, C2 > &v2)
 Returns the squared distance between the specified vectors.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2squared__dist_8hpp_source.html b/doc/api/html/math_2matrix_2squared__dist_8hpp_source.html new file mode 100644 index 00000000000..794b5f921ee --- /dev/null +++ b/doc/api/html/math_2matrix_2squared__dist_8hpp_source.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/math/matrix/squared_dist.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
squared_dist.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__SQUARED_DIST_HPP__
+
2 #define __STAN__MATH__MATRIX__SQUARED_DIST_HPP__
+
3 
+ + + +
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
20  template<int R1,int C1,int R2, int C2>
+
21  inline double squared_dist(const Eigen::Matrix<double, R1, C1>& v1,
+
22  const Eigen::Matrix<double, R2, C2>& v2) {
+
23  validate_vector(v1,"squared_dist");
+
24  validate_vector(v2,"squared_dist");
+
25  validate_matching_sizes(v1,v2,"squared_dist");
+
26  if (v1.rows() != v2.rows())
+
27  return (v1.transpose()-v2).squaredNorm();
+
28  else
+
29  return (v1-v2).squaredNorm();
+
30  }
+
31  }
+
32 }
+
33 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2stan__print_8hpp.html b/doc/api/html/math_2matrix_2stan__print_8hpp.html new file mode 100644 index 00000000000..a540d7a835a --- /dev/null +++ b/doc/api/html/math_2matrix_2stan__print_8hpp.html @@ -0,0 +1,142 @@ + + + + + +Stan: src/stan/math/matrix/stan_print.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan_print.hpp File Reference
+
+
+
#include <vector>
+#include <stan/math/matrix/Eigen.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + + + + + + + + +

+Functions

template<typename T >
void stan::math::stan_print (std::ostream *o, const T &x)
 
template<typename T >
void stan::math::stan_print (std::ostream *o, const std::vector< T > &x)
 
template<typename T >
void stan::math::stan_print (std::ostream *o, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x)
 
template<typename T >
void stan::math::stan_print (std::ostream *o, const Eigen::Matrix< T, 1, Eigen::Dynamic > &x)
 
template<typename T >
void stan::math::stan_print (std::ostream *o, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2stan__print_8hpp_source.html b/doc/api/html/math_2matrix_2stan__print_8hpp_source.html new file mode 100644 index 00000000000..c442b638620 --- /dev/null +++ b/doc/api/html/math_2matrix_2stan__print_8hpp_source.html @@ -0,0 +1,166 @@ + + + + + +Stan: src/stan/math/matrix/stan_print.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan_print.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__STAN_PRINT_HPP__
+
2 #define __STAN__MATH__MATRIX__STAN_PRINT_HPP__
+
3 
+
4 #include <vector>
+ +
6 
+
7 namespace stan {
+
8  namespace math {
+
9  // prints used in generator for print() statements in modeling language
+
10 
+
11  template <typename T>
+
12  void stan_print(std::ostream* o, const T& x) {
+
13  *o << x;
+
14  }
+
15 
+
16  template <typename T>
+
17  void stan_print(std::ostream* o, const std::vector<T>& x) {
+
18  *o << '[';
+
19  for (int i = 0; i < x.size(); ++i) {
+
20  if (i > 0) *o << ',';
+
21  stan_print(o,x[i]);
+
22  }
+
23  *o << ']';
+
24  }
+
25 
+
26  template <typename T>
+
27  void stan_print(std::ostream* o, const Eigen::Matrix<T,Eigen::Dynamic,1>& x) {
+
28  *o << '[';
+
29  for (int i = 0; i < x.size(); ++i) {
+
30  if (i > 0) *o << ',';
+
31  stan_print(o,x(i));
+
32  }
+
33  *o << ']';
+
34  }
+
35 
+
36  template <typename T>
+
37  void stan_print(std::ostream* o, const Eigen::Matrix<T,1,Eigen::Dynamic>& x) {
+
38  *o << '[';
+
39  for (int i = 0; i < x.size(); ++i) {
+
40  if (i > 0) *o << ',';
+
41  stan_print(o,x(i));
+
42  }
+
43  *o << ']';
+
44  }
+
45 
+
46  template <typename T>
+
47  void stan_print(std::ostream* o,
+
48  const Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& x) {
+
49  *o << '[';
+
50  for (int i = 0; i < x.rows(); ++i) {
+
51  if (i > 0) *o << ',';
+
52  stan_print(o,x.row(i));
+
53  }
+
54  *o << ']';
+
55  }
+
56 
+
57  }
+
58 }
+
59 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2sum_8hpp.html b/doc/api/html/math_2matrix_2sum_8hpp.html new file mode 100644 index 00000000000..8f0edae9c43 --- /dev/null +++ b/doc/api/html/math_2matrix_2sum_8hpp.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/math/matrix/sum.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
sum.hpp File Reference
+
+
+
#include <vector>
+#include <stan/math/matrix/Eigen.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + +

+Functions

template<typename T >
stan::math::sum (const std::vector< T > &xs)
 Return the sum of the values in the specified standard vector.
 
template<typename T , int R, int C>
double stan::math::sum (const Eigen::Matrix< T, R, C > &v)
 Returns the sum of the coefficients of the specified column vector.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2sum_8hpp_source.html b/doc/api/html/math_2matrix_2sum_8hpp_source.html new file mode 100644 index 00000000000..e46bb369d29 --- /dev/null +++ b/doc/api/html/math_2matrix_2sum_8hpp_source.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/matrix/sum.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
sum.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__SUM_HPP__
+
2 #define __STAN__MATH__MATRIX__SUM_HPP__
+
3 
+
4 #include <vector>
+ +
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
18  template <typename T>
+
19  inline T sum(const std::vector<T>& xs) {
+
20  if (xs.size() == 0) return 0;
+
21  T sum(xs[0]);
+
22  for (size_t i = 1; i < xs.size(); ++i)
+
23  sum += xs[i];
+
24  return sum;
+
25  }
+
26 
+
33  template <typename T, int R, int C>
+
34  inline double sum(const Eigen::Matrix<T,R,C>& v) {
+
35  return v.sum();
+
36  }
+
37 
+
38  }
+
39 }
+
40 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2tcrossprod_8hpp.html b/doc/api/html/math_2matrix_2tcrossprod_8hpp.html new file mode 100644 index 00000000000..859f22232fd --- /dev/null +++ b/doc/api/html/math_2matrix_2tcrossprod_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/matrix/tcrossprod.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
tcrossprod.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

matrix_d stan::math::tcrossprod (const matrix_d &M)
 Returns the result of post-multiplying a matrix by its own transpose.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2tcrossprod_8hpp_source.html b/doc/api/html/math_2matrix_2tcrossprod_8hpp_source.html new file mode 100644 index 00000000000..d4436100d03 --- /dev/null +++ b/doc/api/html/math_2matrix_2tcrossprod_8hpp_source.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/math/matrix/tcrossprod.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
tcrossprod.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__TCROSSPROD_HPP__
+
2 #define __STAN__MATH__MATRIX__TCROSSPROD_HPP__
+
3 
+ + +
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
16  inline matrix_d
+
17  tcrossprod(const matrix_d& M) {
+
18  if (M.rows() == 0)
+
19  return matrix_d(0,0);
+
20  if (M.rows() == 1)
+
21  return M * M.transpose();
+
22  matrix_d result(M.rows(),M.rows());
+
23  return result
+
24  .setZero()
+
25  .selfadjointView<Eigen::Upper>()
+
26  .rankUpdate(M);
+
27  }
+
28 
+
29  }
+
30 }
+
31 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2trace__gen__quad__form_8hpp.html b/doc/api/html/math_2matrix_2trace__gen__quad__form_8hpp.html new file mode 100644 index 00000000000..127178c4a91 --- /dev/null +++ b/doc/api/html/math_2matrix_2trace__gen__quad__form_8hpp.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/math/matrix/trace_gen_quad_form.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
trace_gen_quad_form.hpp File Reference
+
+
+
#include <boost/utility/enable_if.hpp>
+#include <boost/type_traits.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/validate_multiplicable.hpp>
+#include <stan/math/matrix/validate_square.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<int RD, int CD, int RA, int CA, int RB, int CB>
double stan::math::trace_gen_quad_form (const Eigen::Matrix< double, RD, CD > &D, const Eigen::Matrix< double, RA, CA > &A, const Eigen::Matrix< double, RB, CB > &B)
 Compute trace(D B^T A B).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2trace__gen__quad__form_8hpp_source.html b/doc/api/html/math_2matrix_2trace__gen__quad__form_8hpp_source.html new file mode 100644 index 00000000000..593e9ddd9f7 --- /dev/null +++ b/doc/api/html/math_2matrix_2trace__gen__quad__form_8hpp_source.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/math/matrix/trace_gen_quad_form.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
trace_gen_quad_form.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__TRACE_GEN_QUAD_FORM_HPP__
+
2 #define __STAN__MATH__MATRIX__TRACE_GEN_QUAD_FORM_HPP__
+
3 
+
4 #include <boost/utility/enable_if.hpp>
+
5 #include <boost/type_traits.hpp>
+ + + +
9 
+
10 namespace stan {
+
11  namespace math {
+
15  template<int RD,int CD,int RA,int CA,int RB,int CB>
+
16  inline double
+
17  trace_gen_quad_form(const Eigen::Matrix<double,RD,CD> &D,
+
18  const Eigen::Matrix<double,RA,CA> &A,
+
19  const Eigen::Matrix<double,RB,CB> &B)
+
20  {
+
21  validate_square(A,"trace_gen_quad_form");
+
22  validate_square(D,"trace_gen_quad_form");
+
23  validate_multiplicable(A,B,"trace_gen_quad_form");
+
24  validate_multiplicable(B,D,"trace_gen_quad_form");
+
25  return (D*B.transpose()*A*B).trace();
+
26  }
+
27  }
+
28 }
+
29 
+
30 #endif
+
31 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2trace__quad__form_8hpp.html b/doc/api/html/math_2matrix_2trace__quad__form_8hpp.html new file mode 100644 index 00000000000..4b3620d0d53 --- /dev/null +++ b/doc/api/html/math_2matrix_2trace__quad__form_8hpp.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/math/matrix/trace_quad_form.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
trace_quad_form.hpp File Reference
+
+
+
#include <boost/utility/enable_if.hpp>
+#include <boost/type_traits.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/validate_multiplicable.hpp>
+#include <stan/math/matrix/validate_square.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<int RA, int CA, int RB, int CB>
double stan::math::trace_quad_form (const Eigen::Matrix< double, RA, CA > &A, const Eigen::Matrix< double, RB, CB > &B)
 Compute trace(B^T A B).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2trace__quad__form_8hpp_source.html b/doc/api/html/math_2matrix_2trace__quad__form_8hpp_source.html new file mode 100644 index 00000000000..89b23a28d2e --- /dev/null +++ b/doc/api/html/math_2matrix_2trace__quad__form_8hpp_source.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/math/matrix/trace_quad_form.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
trace_quad_form.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__TRACE_QUAD_FORM_HPP__
+
2 #define __STAN__MATH__MATRIX__TRACE_QUAD_FORM_HPP__
+
3 
+
4 #include <boost/utility/enable_if.hpp>
+
5 #include <boost/type_traits.hpp>
+ + + +
9 
+
10 namespace stan {
+
11  namespace math {
+
15  template<int RA,int CA,int RB,int CB>
+
16  inline double
+
17  trace_quad_form(const Eigen::Matrix<double,RA,CA> &A,
+
18  const Eigen::Matrix<double,RB,CB> &B)
+
19  {
+
20  validate_square(A,"trace_quad_form");
+
21  validate_multiplicable(A,B,"trace_quad_form");
+
22  return (B.transpose()*A*B).trace();
+
23  }
+
24  }
+
25 }
+
26 
+
27 #endif
+
28 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2typedefs_8hpp.html b/doc/api/html/math_2matrix_2typedefs_8hpp.html new file mode 100644 index 00000000000..48188bfbe83 --- /dev/null +++ b/doc/api/html/math_2matrix_2typedefs_8hpp.html @@ -0,0 +1,142 @@ + + + + + +Stan: src/stan/math/matrix/typedefs.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
typedefs.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + + + + +

+Typedefs

typedef Eigen::Matrix< double,
+Eigen::Dynamic, Eigen::Dynamic >
+::Index 
stan::math::size_type
 
typedef Eigen::Matrix< double,
+Eigen::Dynamic, Eigen::Dynamic > 
stan::math::matrix_d
 Type for matrix of double values.
 
typedef Eigen::Matrix< double,
+Eigen::Dynamic, 1 > 
stan::math::vector_d
 Type for (column) vector of double values.
 
typedef Eigen::Matrix< double,
+1, Eigen::Dynamic > 
stan::math::row_vector_d
 Type for (row) vector of double values.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2typedefs_8hpp_source.html b/doc/api/html/math_2matrix_2typedefs_8hpp_source.html new file mode 100644 index 00000000000..bbd241811ba --- /dev/null +++ b/doc/api/html/math_2matrix_2typedefs_8hpp_source.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/math/matrix/typedefs.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
typedefs.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__TYPEDEFS_HPP__
+
2 #define __STAN__MATH__MATRIX__TYPEDEFS_HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
9  // typedef Eigen::Matrix<double,Eigen::Dynamic,Eigen::Dynamic>::size_type size_type;
+
10  typedef Eigen::Matrix<double,Eigen::Dynamic,Eigen::Dynamic>::Index size_type;
+
11 
+
15  typedef
+
16  Eigen::Matrix<double,Eigen::Dynamic,Eigen::Dynamic>
+ +
18 
+
22  typedef
+
23  Eigen::Matrix<double,Eigen::Dynamic,1>
+ +
25 
+
29  typedef
+
30  Eigen::Matrix<double,1,Eigen::Dynamic>
+ +
32 
+
33  }
+
34 }
+
35 
+
36 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2variance_8hpp.html b/doc/api/html/math_2matrix_2variance_8hpp.html new file mode 100644 index 00000000000..51faddea6d8 --- /dev/null +++ b/doc/api/html/math_2matrix_2variance_8hpp.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/math/matrix/variance.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
variance.hpp File Reference
+
+
+
#include <vector>
+#include <boost/math/tools/promotion.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/mean.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + +

+Functions

template<typename T >
boost::math::tools::promote_args
+< T >::type 
stan::math::variance (const std::vector< T > &v)
 Returns the sample variance (divide by length - 1) of the coefficients in the specified standard vector.
 
template<typename T , int R, int C>
boost::math::tools::promote_args
+< T >::type 
stan::math::variance (const Eigen::Matrix< T, R, C > &m)
 Returns the sample variance (divide by length - 1) of the coefficients in the specified column vector.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_2variance_8hpp_source.html b/doc/api/html/math_2matrix_2variance_8hpp_source.html new file mode 100644 index 00000000000..d13a1abf8a8 --- /dev/null +++ b/doc/api/html/math_2matrix_2variance_8hpp_source.html @@ -0,0 +1,156 @@ + + + + + +Stan: src/stan/math/matrix/variance.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
variance.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__VARIANCE_HPP__
+
2 #define __STAN__MATH__MATRIX__VARIANCE_HPP__
+
3 
+
4 #include <vector>
+
5 #include <boost/math/tools/promotion.hpp>
+ + +
8 
+
9 namespace stan {
+
10  namespace math {
+
11 
+
20  template <typename T>
+
21  inline
+
22  typename boost::math::tools::promote_args<T>::type
+
23  variance(const std::vector<T>& v) {
+
24  validate_nonzero_size(v,"variance");
+
25  if (v.size() == 1)
+
26  return 0.0;
+
27  T v_mean(mean(v));
+
28  T sum_sq_diff(0);
+
29  for (size_t i = 0; i < v.size(); ++i) {
+
30  T diff = v[i] - v_mean;
+
31  sum_sq_diff += diff * diff;
+
32  }
+
33  return sum_sq_diff / (v.size() - 1);
+
34  }
+
35 
+
42  template <typename T, int R, int C>
+
43  inline
+
44  typename boost::math::tools::promote_args<T>::type
+
45  variance(const Eigen::Matrix<T,R,C>& m) {
+
46  validate_nonzero_size(m,"variance");
+
47  if (m.size() == 1)
+
48  return 0.0;
+
49  typename boost::math::tools::promote_args<T>::type
+
50  mn(mean(m));
+
51  typename boost::math::tools::promote_args<T>::type
+
52  sum_sq_diff(0);
+
53  for (int i = 0; i < m.size(); ++i) {
+
54  typename boost::math::tools::promote_args<T>::type
+
55  diff = m(i) - mn;
+
56  sum_sq_diff += diff * diff;
+
57  }
+
58  return sum_sq_diff / (m.size() - 1);
+
59  }
+
60 
+
61  }
+
62 }
+
63 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_8hpp.html b/doc/api/html/math_2matrix_8hpp.html new file mode 100644 index 00000000000..fc6ff2912c7 --- /dev/null +++ b/doc/api/html/math_2matrix_8hpp.html @@ -0,0 +1,209 @@ + + + + + +Stan: src/stan/math/matrix.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
matrix.hpp File Reference
+
+
+
#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/accumulator.hpp>
+#include <stan/math/matrix/add.hpp>
+#include <stan/math/matrix/array_builder.hpp>
+#include <stan/math/matrix/assign.hpp>
+#include <stan/math/matrix/block.hpp>
+#include <stan/math/matrix/check_range.hpp>
+#include <stan/math/matrix/cholesky_decompose.hpp>
+#include <stan/math/matrix/col.hpp>
+#include <stan/math/matrix/cols.hpp>
+#include <stan/math/matrix/columns_dot_product.hpp>
+#include <stan/math/matrix/columns_dot_self.hpp>
+#include <stan/math/matrix/common_type.hpp>
+#include <stan/math/matrix/crossprod.hpp>
+#include <stan/math/matrix/cumulative_sum.hpp>
+#include <stan/math/matrix/determinant.hpp>
+#include <stan/math/matrix/diag_matrix.hpp>
+#include <stan/math/matrix/diag_post_multiply.hpp>
+#include <stan/math/matrix/diag_pre_multiply.hpp>
+#include <stan/math/matrix/diagonal.hpp>
+#include <stan/math/matrix/dims.hpp>
+#include <stan/math/matrix/dist.hpp>
+#include <stan/math/matrix/squared_dist.hpp>
+#include <stan/math/matrix/divide.hpp>
+#include <stan/math/matrix/dot_product.hpp>
+#include <stan/math/matrix/dot_self.hpp>
+#include <stan/math/matrix/eigenvalues_sym.hpp>
+#include <stan/math/matrix/eigenvectors_sym.hpp>
+#include <stan/math/matrix/elt_divide.hpp>
+#include <stan/math/matrix/elt_multiply.hpp>
+#include <stan/math/matrix/exp.hpp>
+#include <stan/math/matrix/fill.hpp>
+#include <stan/math/matrix/get_base1.hpp>
+#include <stan/math/matrix/get_base1_lhs.hpp>
+#include <stan/math/matrix/head.hpp>
+#include <stan/math/matrix/initialize.hpp>
+#include <stan/math/matrix/inverse.hpp>
+#include <stan/math/matrix/inverse_spd.hpp>
+#include <stan/math/matrix/ldlt.hpp>
+#include <stan/math/matrix/log.hpp>
+#include <stan/math/matrix/log_determinant.hpp>
+#include <stan/math/matrix/log_determinant_spd.hpp>
+#include <stan/math/matrix/log_softmax.hpp>
+#include <stan/math/matrix/log_sum_exp.hpp>
+#include <stan/math/matrix/max.hpp>
+#include <stan/math/matrix/mdivide_left.hpp>
+#include <stan/math/matrix/mdivide_left_tri.hpp>
+#include <stan/math/matrix/mdivide_left_tri_low.hpp>
+#include <stan/math/matrix/mdivide_right.hpp>
+#include <stan/math/matrix/mdivide_right_tri.hpp>
+#include <stan/math/matrix/mdivide_right_tri_low.hpp>
+#include <stan/math/matrix/mean.hpp>
+#include <stan/math/matrix/min.hpp>
+#include <stan/math/matrix/minus.hpp>
+#include <stan/math/matrix/multiply.hpp>
+#include <stan/math/matrix/multiply_lower_tri_self_transpose.hpp>
+#include <stan/math/matrix/prod.hpp>
+#include <stan/math/matrix/promote_common.hpp>
+#include <stan/math/matrix/promoter.hpp>
+#include <stan/math/matrix/quad_form.hpp>
+#include <stan/math/matrix/rank.hpp>
+#include <stan/math/matrix/resize.hpp>
+#include <stan/math/matrix/row.hpp>
+#include <stan/math/matrix/rows.hpp>
+#include <stan/math/matrix/rows_dot_product.hpp>
+#include <stan/math/matrix/rows_dot_self.hpp>
+#include <stan/math/matrix/sd.hpp>
+#include <stan/math/matrix/segment.hpp>
+#include <stan/math/matrix/singular_values.hpp>
+#include <stan/math/matrix/size.hpp>
+#include <stan/math/matrix/softmax.hpp>
+#include <stan/math/matrix/sort.hpp>
+#include <stan/math/matrix/stan_print.hpp>
+#include <stan/math/matrix/sub_col.hpp>
+#include <stan/math/matrix/sub_row.hpp>
+#include <stan/math/matrix/subtract.hpp>
+#include <stan/math/matrix/sum.hpp>
+#include <stan/math/matrix/tail.hpp>
+#include <stan/math/matrix/tcrossprod.hpp>
+#include <stan/math/matrix/to_vector.hpp>
+#include <stan/math/matrix/trace.hpp>
+#include <stan/math/matrix/trace_quad_form.hpp>
+#include <stan/math/matrix/trace_gen_quad_form.hpp>
+#include <stan/math/matrix/transpose.hpp>
+#include <stan/math/matrix/typedefs.hpp>
+#include <stan/math/matrix/validate_column_index.hpp>
+#include <stan/math/matrix/validate_greater.hpp>
+#include <stan/math/matrix/validate_greater_or_equal.hpp>
+#include <stan/math/matrix/validate_less.hpp>
+#include <stan/math/matrix/validate_less_or_equal.hpp>
+#include <stan/math/matrix/validate_matching_dims.hpp>
+#include <stan/math/matrix/validate_matching_sizes.hpp>
+#include <stan/math/matrix/validate_multiplicable.hpp>
+#include <stan/math/matrix/validate_nonzero_size.hpp>
+#include <stan/math/matrix/validate_row_index.hpp>
+#include <stan/math/matrix/validate_square.hpp>
+#include <stan/math/matrix/validate_std_vector_index.hpp>
+#include <stan/math/matrix/validate_symmetric.hpp>
+#include <stan/math/matrix/validate_vector.hpp>
+#include <stan/math/matrix/variance.hpp>
+
+

Go to the source code of this file.

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_2matrix_8hpp_source.html b/doc/api/html/math_2matrix_8hpp_source.html new file mode 100644 index 00000000000..c8f8150483d --- /dev/null +++ b/doc/api/html/math_2matrix_8hpp_source.html @@ -0,0 +1,213 @@ + + + + + +Stan: src/stan/math/matrix.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
matrix.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX_HPP__
+
2 #define __STAN__MATH__MATRIX_HPP__
+
3 
+ + + + + + + + +
12 #include <stan/math/matrix/col.hpp>
+ + + + + + + + + + + + + + + + + + + + + +
34 #include <stan/math/matrix/exp.hpp>
+ + + + + + + + +
43 #include <stan/math/matrix/log.hpp>
+ + + + +
48 #include <stan/math/matrix/max.hpp>
+ + + + + + + +
56 #include <stan/math/matrix/min.hpp>
+ + + + + + + + + +
66 #include <stan/math/matrix/row.hpp>
+ + + +
70 #include <stan/math/matrix/sd.hpp>
+ + + + + + + + + +
80 #include <stan/math/matrix/sum.hpp>
+ + + + + + + + + + + + + + + + + + + + + + + +
104 
+
105 #endif
+
106 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_8hpp.html b/doc/api/html/math_8hpp.html new file mode 100644 index 00000000000..a29c9065437 --- /dev/null +++ b/doc/api/html/math_8hpp.html @@ -0,0 +1,115 @@ + + + + + +Stan: src/stan/math.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
math.hpp File Reference
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/math_8hpp_source.html b/doc/api/html/math_8hpp_source.html new file mode 100644 index 00000000000..06385a714be --- /dev/null +++ b/doc/api/html/math_8hpp_source.html @@ -0,0 +1,118 @@ + + + + + +Stan: src/stan/math.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
math.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH_HPP__
+
2 #define __STAN__MATH_HPP__
+
3 
+ + + + + + +
10 
+
11 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/matrix_2dist_8hpp.html b/doc/api/html/matrix_2dist_8hpp.html new file mode 100644 index 00000000000..b03182a72ad --- /dev/null +++ b/doc/api/html/matrix_2dist_8hpp.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/math/matrix/dist.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
dist.hpp File Reference
+
+
+
#include <stan/math/matrix/Eigen.hpp>
+#include <stan/meta/traits.hpp>
+#include <boost/math/tools/promotion.hpp>
+#include <stan/math/matrix/squared_dist.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T1 , int R1, int C1, typename T2 , int R2, int C2>
boost::math::tools::promote_args
+< T1, T1 >::type 
stan::math::dist (const Eigen::Matrix< T1, R1, C1 > &v1, const Eigen::Matrix< T2, R2, C2 > &v2)
 Returns the distance between the specified vectors.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/matrix_2dist_8hpp_source.html b/doc/api/html/matrix_2dist_8hpp_source.html new file mode 100644 index 00000000000..7c41736569b --- /dev/null +++ b/doc/api/html/matrix_2dist_8hpp_source.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/math/matrix/dist.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
dist.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__DIST_HPP__
+
2 #define __STAN__MATH__MATRIX__DIST_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 #include <boost/math/tools/promotion.hpp>
+ +
8 
+
9 namespace stan {
+
10  namespace math {
+
11 
+
21  template<typename T1, int R1,int C1, typename T2, int R2, int C2>
+
22  inline typename boost::math::tools::promote_args<T1,T1>::type
+
23  dist(const Eigen::Matrix<T1, R1, C1>& v1,
+
24  const Eigen::Matrix<T2, R2, C2>& v2) {
+
25  using std::sqrt;
+
26  return sqrt(squared_dist(v1,v2));
+
27  }
+
28  }
+
29 }
+
30 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/matrix_2max_8hpp.html b/doc/api/html/matrix_2max_8hpp.html new file mode 100644 index 00000000000..cccd2964702 --- /dev/null +++ b/doc/api/html/matrix_2max_8hpp.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/math/matrix/max.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
max.hpp File Reference
+
+
+
#include <stdexcept>
+#include <vector>
+#include <stan/math/matrix/Eigen.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + + + + +

+Functions

int stan::math::max (const std::vector< int > &x)
 Returns the maximum coefficient in the specified column vector.
 
template<typename T >
stan::math::max (const std::vector< T > &x)
 Returns the maximum coefficient in the specified column vector.
 
template<typename T , int R, int C>
stan::math::max (const Eigen::Matrix< T, R, C > &m)
 Returns the maximum coefficient in the specified vector, row vector, or matrix.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/matrix_2max_8hpp_source.html b/doc/api/html/matrix_2max_8hpp_source.html new file mode 100644 index 00000000000..5093281d2f2 --- /dev/null +++ b/doc/api/html/matrix_2max_8hpp_source.html @@ -0,0 +1,148 @@ + + + + + +Stan: src/stan/math/matrix/max.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
max.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__MAX_HPP__
+
2 #define __STAN__MATH__MATRIX__MAX_HPP__
+
3 
+
4 #include <stdexcept>
+
5 #include <vector>
+ +
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
19  inline int max(const std::vector<int>& x) {
+
20  if (x.size() == 0)
+
21  throw std::domain_error("error: cannot take max of empty int vector");
+
22  int max = x[0];
+
23  for (size_t i = 1; i < x.size(); ++i)
+
24  if (x[i] > max)
+
25  max = x[i];
+
26  return max;
+
27  }
+
28 
+
36  template <typename T>
+
37  inline T max(const std::vector<T>& x) {
+
38  if (x.size() == 0)
+
39  return -std::numeric_limits<T>::infinity();
+
40  T max = x[0];
+
41  for (size_t i = 1; i < x.size(); ++i)
+
42  if (x[i] > max)
+
43  max = x[i];
+
44  return max;
+
45  }
+
46 
+
53  template <typename T, int R, int C>
+
54  inline T max(const Eigen::Matrix<T,R,C>& m) {
+
55  if (m.size() == 0)
+
56  return -std::numeric_limits<double>::infinity();
+
57  return m.maxCoeff();
+
58  }
+
59 
+
60  }
+
61 }
+
62 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/matrix_2min_8hpp.html b/doc/api/html/matrix_2min_8hpp.html new file mode 100644 index 00000000000..c40461c6ed2 --- /dev/null +++ b/doc/api/html/matrix_2min_8hpp.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/math/matrix/min.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
min.hpp File Reference
+
+
+
#include <stdexcept>
+#include <vector>
+#include <stan/math/matrix/Eigen.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + + + + +

+Functions

int stan::math::min (const std::vector< int > &x)
 Returns the minimum coefficient in the specified column vector.
 
template<typename T >
stan::math::min (const std::vector< T > &x)
 Returns the minimum coefficient in the specified column vector.
 
template<typename T , int R, int C>
stan::math::min (const Eigen::Matrix< T, R, C > &m)
 Returns the minimum coefficient in the specified matrix, vector, or row vector.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/matrix_2min_8hpp_source.html b/doc/api/html/matrix_2min_8hpp_source.html new file mode 100644 index 00000000000..33b649e4db9 --- /dev/null +++ b/doc/api/html/matrix_2min_8hpp_source.html @@ -0,0 +1,148 @@ + + + + + +Stan: src/stan/math/matrix/min.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
min.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__MIN_HPP__
+
2 #define __STAN__MATH__MATRIX__MIN_HPP__
+
3 
+
4 #include <stdexcept>
+
5 #include <vector>
+ +
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
18  inline int min(const std::vector<int>& x) {
+
19  if (x.size() == 0)
+
20  throw std::domain_error("error: cannot take min of empty int vector");
+
21  int min = x[0];
+
22  for (size_t i = 1; i < x.size(); ++i)
+
23  if (x[i] < min)
+
24  min = x[i];
+
25  return min;
+
26  }
+
27 
+
35  template <typename T>
+
36  inline T min(const std::vector<T>& x) {
+
37  if (x.size() == 0)
+
38  return std::numeric_limits<T>::infinity();
+
39  T min = x[0];
+
40  for (size_t i = 1; i < x.size(); ++i)
+
41  if (x[i] < min)
+
42  min = x[i];
+
43  return min;
+
44  }
+
45 
+
52  template <typename T, int R, int C>
+
53  inline T min(const Eigen::Matrix<T,R,C>& m) {
+
54  if (m.size() == 0)
+
55  return std::numeric_limits<double>::infinity();
+
56  return m.minCoeff();
+
57  }
+
58 
+
59  }
+
60 }
+
61 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/matrix__error__handling_8hpp.html b/doc/api/html/matrix__error__handling_8hpp.html new file mode 100644 index 00000000000..d50e5ba96d2 --- /dev/null +++ b/doc/api/html/matrix__error__handling_8hpp.html @@ -0,0 +1,125 @@ + + + + + +Stan: src/stan/math/matrix_error_handling.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
matrix_error_handling.hpp File Reference
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/matrix__error__handling_8hpp_source.html b/doc/api/html/matrix__error__handling_8hpp_source.html new file mode 100644 index 00000000000..b12b9bf607d --- /dev/null +++ b/doc/api/html/matrix__error__handling_8hpp_source.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/math/matrix_error_handling.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
matrix_error_handling.hpp
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/matrix__normal_8hpp.html b/doc/api/html/matrix__normal_8hpp.html new file mode 100644 index 00000000000..bd34da39f5f --- /dev/null +++ b/doc/api/html/matrix__normal_8hpp.html @@ -0,0 +1,148 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/continuous/matrix_normal.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
matrix_normal.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + +

+Functions

template<bool propto, typename T_y , typename T_Mu , typename T_Sigma , typename T_D >
boost::math::tools::promote_args
+< T_y, T_Mu, T_Sigma, T_D >
+::type 
stan::prob::matrix_normal_prec_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_Mu, Eigen::Dynamic, Eigen::Dynamic > &Mu, const Eigen::Matrix< T_Sigma, Eigen::Dynamic, Eigen::Dynamic > &Sigma, const Eigen::Matrix< T_D, Eigen::Dynamic, Eigen::Dynamic > &D)
 The log of the matrix normal density for the given y, mu, Sigma and D where Sigma and D are given as precision matrices, not covariance matrices.
 
template<typename T_y , typename T_Mu , typename T_Sigma , typename T_D >
boost::math::tools::promote_args
+< T_y, T_Mu, T_Sigma, T_D >
+::type 
stan::prob::matrix_normal_prec_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_Mu, Eigen::Dynamic, Eigen::Dynamic > &Mu, const Eigen::Matrix< T_Sigma, Eigen::Dynamic, Eigen::Dynamic > &Sigma, const Eigen::Matrix< T_D, Eigen::Dynamic, Eigen::Dynamic > &D)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/matrix__normal_8hpp_source.html b/doc/api/html/matrix__normal_8hpp_source.html new file mode 100644 index 00000000000..c6453c1f326 --- /dev/null +++ b/doc/api/html/matrix__normal_8hpp_source.html @@ -0,0 +1,244 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/continuous/matrix_normal.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
matrix_normal.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__MULTIVARIATE__CONTINUOUS__MATRIX_NORMAL_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__MULTIVARIATE__CONTINUOUS__MATRIX_NORMAL_HPP__
+
3 
+ + + +
7 #include <stan/prob/traits.hpp>
+
8 #include <stan/agrad/rev.hpp>
+
9 #include <stan/meta/traits.hpp>
+ +
11 #include <stan/math/matrix/log.hpp>
+ + + +
15 
+ +
17 
+
18 namespace stan {
+
19  namespace prob {
+
38  template <bool propto,
+
39  typename T_y, typename T_Mu, typename T_Sigma, typename T_D>
+
40  typename boost::math::tools::promote_args<T_y,T_Mu,T_Sigma,T_D>::type
+
41  matrix_normal_prec_log(const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& y,
+
42  const Eigen::Matrix<T_Mu,Eigen::Dynamic,Eigen::Dynamic>& Mu,
+
43  const Eigen::Matrix<T_Sigma,Eigen::Dynamic,Eigen::Dynamic>& Sigma,
+
44  const Eigen::Matrix<T_D,Eigen::Dynamic,Eigen::Dynamic>& D) {
+
45  static const char* function = "stan::prob::matrix_normal_prec_log(%1%)";
+
46  typename boost::math::tools::promote_args<T_y,T_Mu,T_Sigma,T_D>::type lp(0.0);
+
47 
+ + + + + + + + +
56  using stan::math::LDLT_factor;
+
57 
+
58  if (!check_size_match(function,
+
59  Sigma.rows(), "Rows of Sigma",
+
60  Sigma.cols(), "columns of Sigma",
+
61  &lp))
+
62  return lp;
+
63  if (!check_positive(function, Sigma.rows(), "Sigma rows", &lp))
+
64  return lp;
+
65  if (!check_finite(function, Sigma, "Sigma", &lp))
+
66  return lp;
+
67  if (!check_symmetric(function, Sigma, "Sigma", &lp))
+
68  return lp;
+
69 
+ +
71  if (!ldlt_Sigma.success()) {
+
72  std::ostringstream message;
+
73  message << "Sigma is not positive definite. "
+
74  << "Sigma(0,0) is %1%.";
+
75  std::string str(message.str());
+
76  stan::math::dom_err(function,Sigma(0,0),"Sigma",str.c_str(),"",&lp);
+
77  return lp;
+
78  }
+
79 
+
80  if (!check_size_match(function,
+
81  D.rows(), "Rows of D",
+
82  D.cols(), "Columns of D",
+
83  &lp))
+
84  return lp;
+
85  if (!check_positive(function, D.rows(), "D rows", &lp))
+
86  return lp;
+
87  if (!check_finite(function, D, "D", &lp))
+
88  return lp;
+
89  if (!check_symmetric(function, D, "Sigma", &lp))
+
90  return lp;
+
91 
+ +
93  if (!ldlt_D.success()) {
+
94  std::ostringstream message;
+
95  message << "D is not positive definite. "
+
96  << "D(0,0) is %1%.";
+
97  std::string str(message.str());
+
98  stan::math::dom_err(function,Sigma(0,0),"",str.c_str(),"",&lp);
+
99  return lp;
+
100  }
+
101 
+
102  if (!check_size_match(function,
+
103  y.rows(), "Rows of random variable",
+
104  Mu.rows(), "Rows of location parameter",
+
105  &lp))
+
106  return lp;
+
107  if (!check_size_match(function,
+
108  y.cols(), "Columns of random variable",
+
109  Mu.cols(), "Columns of location parameter",
+
110  &lp))
+
111  return lp;
+
112  if (!check_size_match(function,
+
113  y.rows(), "Rows of random variable",
+
114  Sigma.rows(), "Rows of Sigma",
+
115  &lp))
+
116  return lp;
+
117  if (!check_size_match(function,
+
118  y.cols(), "Columns of random variable",
+
119  D.rows(), "Rows of D",
+
120  &lp))
+
121  return lp;
+
122  if (!check_finite(function, Mu, "Location parameter", &lp))
+
123  return lp;
+
124  if (!check_finite(function, y, "Random variable", &lp))
+
125  return lp;
+
126 
+ +
128  lp += NEG_LOG_SQRT_TWO_PI * y.cols() * y.rows();
+
129 
+ +
131  lp += log_determinant_ldlt(ldlt_Sigma) * (0.5 * y.rows());
+
132  }
+
133 
+ +
135  lp += log_determinant_ldlt(ldlt_D) * (0.5 * y.cols());
+
136  }
+
137 
+ +
139  lp -= 0.5 * trace_gen_quad_form(D,Sigma,subtract(y,Mu));
+
140  }
+
141  return lp;
+
142  }
+
143 
+
144  template <typename T_y, typename T_Mu, typename T_Sigma, typename T_D>
+
145  typename boost::math::tools::promote_args<T_y,T_Mu,T_Sigma,T_D>::type
+
146  matrix_normal_prec_log(const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& y,
+
147  const Eigen::Matrix<T_Mu,Eigen::Dynamic,Eigen::Dynamic>& Mu,
+
148  const Eigen::Matrix<T_Sigma,Eigen::Dynamic,Eigen::Dynamic>& Sigma,
+
149  const Eigen::Matrix<T_D,Eigen::Dynamic,Eigen::Dynamic>& D) {
+
150  return matrix_normal_prec_log<false>(y,Mu,Sigma,D);
+
151  }
+
152  }
+
153 }
+
154 
+
155 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/matrix__vari_8hpp.html b/doc/api/html/matrix__vari_8hpp.html new file mode 100644 index 00000000000..45437bb5ef4 --- /dev/null +++ b/doc/api/html/matrix__vari_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/rev/internal/matrix_vari.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
matrix_vari.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::agrad::op_matrix_vari
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/matrix__vari_8hpp_source.html b/doc/api/html/matrix__vari_8hpp_source.html new file mode 100644 index 00000000000..acba4c547e3 --- /dev/null +++ b/doc/api/html/matrix__vari_8hpp_source.html @@ -0,0 +1,142 @@ + + + + + +Stan: src/stan/agrad/rev/internal/matrix_vari.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
matrix_vari.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__INTERNAL__MATRIX_VARI_HPP__
+
2 #define __STAN__AGRAD__REV__INTERNAL__MATRIX_VARI_HPP__
+
3 
+ +
5 #include <stan/agrad/rev/var.hpp>
+ +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  class op_matrix_vari : public vari {
+
12  protected:
+
13  const size_t size_;
+ +
15  public:
+
16  template <int R, int C>
+
17  op_matrix_vari(double f, const Eigen::Matrix<stan::agrad::var,R,C>& vs) :
+
18  vari(f),
+
19  size_(vs.size()) {
+
20 
+
21  vis_ = (vari**) operator new(sizeof(vari*) * vs.size());
+
22  for (int i = 0; i < vs.size(); ++i)
+
23  vis_[i] = vs(i).vi_;
+
24  }
+
25  vari* operator[](size_t n) const {
+
26  return vis_[n];
+
27  }
+
28  size_t size() {
+
29  return size_;
+
30  }
+
31  };
+
32 
+
33  }
+
34 }
+
35 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/mcmc_8hpp.html b/doc/api/html/mcmc_8hpp.html new file mode 100644 index 00000000000..9513d7e5cdc --- /dev/null +++ b/doc/api/html/mcmc_8hpp.html @@ -0,0 +1,123 @@ + + + + + +Stan: src/stan/mcmc.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
mcmc.hpp File Reference
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/mcmc_8hpp_source.html b/doc/api/html/mcmc_8hpp_source.html new file mode 100644 index 00000000000..433bc244960 --- /dev/null +++ b/doc/api/html/mcmc_8hpp_source.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/mcmc.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
mcmc.hpp
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/mcmc__writer_8hpp.html b/doc/api/html/mcmc__writer_8hpp.html new file mode 100644 index 00000000000..3886fdc5734 --- /dev/null +++ b/doc/api/html/mcmc__writer_8hpp.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/io/mcmc_writer.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
mcmc_writer.hpp File Reference
+
+
+
#include <ostream>
+#include <iomanip>
+#include <string>
+#include <vector>
+#include <stan/mcmc/base_mcmc.hpp>
+#include <stan/mcmc/sample.hpp>
+#include <stan/model/prob_grad.hpp>
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  stan::io::mcmc_writer< M >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::io
 Input/output utilities.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/mcmc__writer_8hpp_source.html b/doc/api/html/mcmc__writer_8hpp_source.html new file mode 100644 index 00000000000..dbef8870da6 --- /dev/null +++ b/doc/api/html/mcmc__writer_8hpp_source.html @@ -0,0 +1,281 @@ + + + + + +Stan: src/stan/io/mcmc_writer.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
mcmc_writer.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__IO__MCMC__WRITER__HPP
+
2 #define __STAN__IO__MCMC__WRITER__HPP
+
3 
+
4 #include <ostream>
+
5 #include <iomanip>
+
6 #include <string>
+
7 #include <vector>
+
8 
+ +
10 #include <stan/mcmc/sample.hpp>
+
11 #include <stan/model/prob_grad.hpp>
+
12 
+
13 namespace stan {
+
14 
+
15  namespace io {
+
16 
+
17  template <class M>
+
18  class mcmc_writer {
+
19 
+
20  public:
+
21 
+
22  mcmc_writer(std::ostream* sample_stream,
+
23  std::ostream* diagnostic_stream,
+
24  std::ostream* msg_stream = 0)
+
25  : sample_stream_(sample_stream),
+
26  diagnostic_stream_(diagnostic_stream),
+
27  msg_stream_(msg_stream) {
+
28  }
+
29 
+ +
31  stan::mcmc::base_mcmc* sampler,
+
32  M& model) {
+
33 
+
34  if (!sample_stream_) return;
+
35 
+
36  std::vector<std::string> names;
+
37 
+
38  sample.get_sample_param_names(names);
+
39  sampler->get_sampler_param_names(names);
+
40  model.constrained_param_names(names, true, true);
+
41 
+
42  (*sample_stream_) << names.at(0);
+
43  for (size_t i = 1; i < names.size(); ++i) {
+
44  (*sample_stream_) << "," << names.at(i);
+
45  }
+
46  (*sample_stream_) << std::endl;
+
47 
+
48  }
+
49 
+
50  template <class RNG>
+
51  void print_sample_params(RNG& rng,
+ +
53  stan::mcmc::base_mcmc& sampler,
+
54  M& model) {
+
55 
+
56  if (!sample_stream_) return;
+
57 
+
58  std::vector<double> values;
+
59 
+
60  sample.get_sample_params(values);
+
61  sampler.get_sampler_params(values);
+
62 
+
63  Eigen::VectorXd model_values;
+
64 
+
65  model.write_array(rng,
+
66  const_cast<Eigen::VectorXd&>(sample.cont_params()),
+
67  model_values,
+
68  true, true,
+
69  msg_stream_);
+
70 
+
71  for (int i = 0; i < model_values.size(); ++i)
+
72  values.push_back(model_values(i));
+
73 
+
74  (*sample_stream_) << values.at(0);
+
75  for (size_t i = 1; i < values.size(); ++i) {
+
76  (*sample_stream_) << "," << values.at(i);
+
77  }
+
78  (*sample_stream_) << std::endl;
+
79 
+
80  }
+
81 
+
82  void print_adapt_finish(stan::mcmc::base_mcmc* sampler, std::ostream* stream) {
+
83 
+
84  if (!stream) return;
+
85 
+
86  *stream << "# Adaptation terminated" << std::endl;
+
87  sampler->write_sampler_state(stream);
+
88 
+
89  }
+
90 
+ +
92  print_adapt_finish(sampler, sample_stream_);
+
93  print_adapt_finish(sampler, diagnostic_stream_);
+
94  }
+
95 
+ +
97  stan::mcmc::base_mcmc* sampler,
+
98  M& model) {
+
99 
+
100  if (!diagnostic_stream_) return;
+
101 
+
102  std::vector<std::string> names;
+
103 
+
104  sample.get_sample_param_names(names);
+
105  sampler->get_sampler_param_names(names);
+
106 
+
107  std::vector<std::string> model_names;
+
108  model.unconstrained_param_names(model_names, false, false);
+
109 
+
110  sampler->get_sampler_diagnostic_names(model_names, names);
+
111 
+
112  for (size_t i = 0; i < names.size(); ++i) {
+
113  if (i > 0) *diagnostic_stream_ << ",";
+
114  *diagnostic_stream_ << names.at(i);
+
115  }
+
116  *diagnostic_stream_ << std::endl;
+
117 
+
118  }
+
119 
+ +
121  stan::mcmc::base_mcmc* sampler) {
+
122 
+
123  if (!diagnostic_stream_) return;
+
124 
+
125  std::vector<double> values;
+
126 
+
127  sample.get_sample_params(values);
+
128  sampler->get_sampler_params(values);
+
129  sampler->get_sampler_diagnostics(values);
+
130 
+
131  (*diagnostic_stream_) << values.at(0);
+
132  for (size_t i = 1; i < values.size(); ++i) {
+
133  (*diagnostic_stream_) << "," << values.at(i);
+
134  }
+
135  (*diagnostic_stream_) << std::endl;
+
136 
+
137  }
+
138 
+
139  void print_timing(double warmDeltaT, double sampleDeltaT,
+
140  std::ostream* stream, const char prefix = '\0') {
+
141  if (!stream) return;
+
142 
+
143  std::string title(" Elapsed Time: ");
+
144 
+
145  *stream << std::endl
+
146  << prefix << " " << title << warmDeltaT
+
147  << " seconds (Warm-up)" << std::endl
+
148  << prefix << " " << std::string(title.size(), ' ') << sampleDeltaT
+
149  << " seconds (Sampling)" << std::endl
+
150  << prefix << " " << std::string(title.size(), ' ')
+
151  << warmDeltaT + sampleDeltaT
+
152  << " seconds (Total)" << std::endl
+
153  << std::endl;
+
154  }
+
155 
+
156  void print_timing(double warmDeltaT, double sampleDeltaT) {
+
157  print_timing(warmDeltaT, sampleDeltaT, sample_stream_, '#');
+
158  print_timing(warmDeltaT, sampleDeltaT, diagnostic_stream_, '#');
+
159  print_timing(warmDeltaT, sampleDeltaT, &std::cout);
+
160  }
+
161 
+
162  private:
+
163 
+
164  std::ostream* sample_stream_;
+
165  std::ostream* diagnostic_stream_;
+
166  std::ostream* msg_stream_;
+
167 
+
168  };
+
169 
+
170  } //io
+
171 
+
172 } // stan
+
173 
+
174 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/mdivide__right__spd_8hpp.html b/doc/api/html/mdivide__right__spd_8hpp.html new file mode 100644 index 00000000000..304bc1304b3 --- /dev/null +++ b/doc/api/html/mdivide__right__spd_8hpp.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/math/matrix/mdivide_right_spd.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
mdivide_right_spd.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T1 , typename T2 , int R1, int C1, int R2, int C2>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R1, C2 > 
stan::math::mdivide_right_spd (const Eigen::Matrix< T1, R1, C1 > &b, const Eigen::Matrix< T2, R2, C2 > &A)
 Returns the solution of the system Ax=b where A is symmetric positive definite.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/mdivide__right__spd_8hpp_source.html b/doc/api/html/mdivide__right__spd_8hpp_source.html new file mode 100644 index 00000000000..4d9418e8271 --- /dev/null +++ b/doc/api/html/mdivide__right__spd_8hpp_source.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/math/matrix/mdivide_right_spd.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
mdivide_right_spd.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__MDIVIDE_RIGHT_SPD_HPP__
+
2 #define __STAN__MATH__MATRIX__MDIVIDE_RIGHT_SPD_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+ + + + + +
10 
+
11 namespace stan {
+
12  namespace math {
+
13 
+
23  template <typename T1, typename T2, int R1, int C1, int R2, int C2>
+
24  inline
+
25  Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type,R1,C2>
+
26  mdivide_right_spd(const Eigen::Matrix<T1,R1,C1> &b,
+
27  const Eigen::Matrix<T2,R2,C2> &A) {
+
28  stan::math::validate_square(A,"mdivide_right_spd");
+
29  stan::math::validate_multiplicable(b,A,"mdivide_right_spd");
+
30  // FIXME: This is nice and general but likely slow.
+
31  return transpose(mdivide_left_spd(A,transpose(b)));
+
32  }
+
33 
+
34  }
+
35 }
+
36 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/mdivide__right__tri_8hpp.html b/doc/api/html/mdivide__right__tri_8hpp.html new file mode 100644 index 00000000000..5d3f84f8b07 --- /dev/null +++ b/doc/api/html/mdivide__right__tri_8hpp.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/math/matrix/mdivide_right_tri.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
mdivide_right_tri.hpp File Reference
+
+
+
#include <stdexcept>
+#include <boost/math/tools/promotion.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/mdivide_left_tri.hpp>
+#include <stan/math/matrix/transpose.hpp>
+#include <stan/math/matrix/validate_multiplicable.hpp>
+#include <stan/math/matrix/validate_square.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<int TriView, typename T1 , typename T2 , int R1, int C1, int R2, int C2>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R1, C2 > 
stan::math::mdivide_right_tri (const Eigen::Matrix< T1, R1, C1 > &b, const Eigen::Matrix< T2, R2, C2 > &A)
 Returns the solution of the system Ax=b when A is triangular.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/mdivide__right__tri_8hpp_source.html b/doc/api/html/mdivide__right__tri_8hpp_source.html new file mode 100644 index 00000000000..9d41f4732a2 --- /dev/null +++ b/doc/api/html/mdivide__right__tri_8hpp_source.html @@ -0,0 +1,144 @@ + + + + + +Stan: src/stan/math/matrix/mdivide_right_tri.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
mdivide_right_tri.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__MDIVIDE_RIGHT_TRI_HPP__
+
2 #define __STAN__MATH__MATRIX__MDIVIDE_RIGHT_TRI_HPP__
+
3 
+
4 #include <stdexcept>
+
5 #include <boost/math/tools/promotion.hpp>
+ + + + + +
11 
+
12 namespace stan {
+
13  namespace math {
+
14 
+
24  template <int TriView, typename T1, typename T2,
+
25  int R1, int C1, int R2, int C2>
+
26  inline
+
27  Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type,R1,C2>
+
28  mdivide_right_tri(const Eigen::Matrix<T1,R1,C1> &b,
+
29  const Eigen::Matrix<T2,R2,C2> &A) {
+
30  stan::math::validate_square(A,"mdivide_left_tri_low");
+
31  stan::math::validate_multiplicable(b,A,"mdivide_right_tri");
+
32  // FIXME: This is nice and general but requires some extra memory and copying.
+
33  if (TriView == Eigen::Lower) {
+
34  return transpose(mdivide_left_tri<Eigen::Upper>(transpose(A),transpose(b)));
+
35  }
+
36  else if (TriView == Eigen::Upper) {
+
37  return transpose(mdivide_left_tri<Eigen::Lower>(transpose(A),transpose(b)));
+
38  }
+
39  else {
+
40  throw std::domain_error("triangular view must be Eigen::Lower or Eigen::Upper");
+
41  }
+
42  }
+
43 
+
44  }
+
45 }
+
46 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/mean_8hpp.html b/doc/api/html/mean_8hpp.html new file mode 100644 index 00000000000..e901a099268 --- /dev/null +++ b/doc/api/html/mean_8hpp.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/math/matrix/mean.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
mean.hpp File Reference
+
+
+
#include <vector>
+#include <boost/math/tools/promotion.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/validate_nonzero_size.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + +

+Functions

template<typename T >
boost::math::tools::promote_args
+< T >::type 
stan::math::mean (const std::vector< T > &v)
 Returns the sample mean (i.e., average) of the coefficients in the specified standard vector.
 
template<typename T , int R, int C>
boost::math::tools::promote_args
+< T >::type 
stan::math::mean (const Eigen::Matrix< T, R, C > &m)
 Returns the sample mean (i.e., average) of the coefficients in the specified vector, row vector, or matrix.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/mean_8hpp_source.html b/doc/api/html/mean_8hpp_source.html new file mode 100644 index 00000000000..39e09fa67ad --- /dev/null +++ b/doc/api/html/mean_8hpp_source.html @@ -0,0 +1,140 @@ + + + + + +Stan: src/stan/math/matrix/mean.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
mean.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__MEAN_HPP__
+
2 #define __STAN__MATH__MATRIX__MEAN_HPP__
+
3 
+
4 #include <vector>
+
5 #include <boost/math/tools/promotion.hpp>
+ + +
8 
+
9 namespace stan {
+
10  namespace math {
+
11 
+
20  template <typename T>
+
21  inline
+
22  typename boost::math::tools::promote_args<T>::type
+
23  mean(const std::vector<T>& v) {
+
24  validate_nonzero_size(v,"mean");
+
25  T sum(v[0]);
+
26  for (size_t i = 1; i < v.size(); ++i)
+
27  sum += v[i];
+
28  return sum / v.size();
+
29  }
+
30 
+
37  template <typename T, int R, int C>
+
38  inline
+
39  typename boost::math::tools::promote_args<T>::type
+
40  mean(const Eigen::Matrix<T,R,C>& m) {
+
41  validate_nonzero_size(m,"mean");
+
42  return m.mean();
+
43  }
+
44 
+
45  }
+
46 }
+
47 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/memory_8hpp.html b/doc/api/html/memory_8hpp.html new file mode 100644 index 00000000000..5c32fbcad8c --- /dev/null +++ b/doc/api/html/memory_8hpp.html @@ -0,0 +1,110 @@ + + + + + +Stan: src/stan/memory.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
memory.hpp File Reference
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/memory_8hpp_source.html b/doc/api/html/memory_8hpp_source.html new file mode 100644 index 00000000000..23ee87f5488 --- /dev/null +++ b/doc/api/html/memory_8hpp_source.html @@ -0,0 +1,114 @@ + + + + + +Stan: src/stan/memory.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
memory.hpp
+
+
+Go to the documentation of this file.
1 #ifndef STAN_MEMORY_HPP
+
2 #define STAN_MEMORY_HPP
+
3 
+ +
5 
+
6 #endif
+
7 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/meta_2traits_8hpp.html b/doc/api/html/meta_2traits_8hpp.html new file mode 100644 index 00000000000..1e03c496672 --- /dev/null +++ b/doc/api/html/meta_2traits_8hpp.html @@ -0,0 +1,235 @@ + + + + + +Stan: src/stan/meta/traits.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
traits.hpp File Reference
+
+
+
#include <stan/agrad/fwd/fvar.hpp>
+#include <stan/agrad/rev/var.hpp>
+#include <vector>
+#include <boost/type_traits.hpp>
+#include <boost/type_traits/is_arithmetic.hpp>
+#include <boost/math/tools/promotion.hpp>
+#include <stan/math/matrix.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Classes

struct  stan::is_constant< T >
 Metaprogramming struct to detect whether a given type is constant in the mathematical sense (not the C++ const sense). More...
 
struct  stan::is_constant_struct< T >
 Metaprogram to determine if a type has a base scalar type that can be assigned to type double. More...
 
struct  stan::is_constant_struct< std::vector< T > >
 
struct  stan::is_constant_struct< Eigen::Matrix< T, R, C > >
 
struct  stan::is_constant_struct< Eigen::Block< T > >
 
struct  stan::is_vector< T >
 
struct  stan::is_vector< const T >
 
struct  stan::is_vector< std::vector< T > >
 
struct  stan::is_vector< Eigen::Matrix< T, Eigen::Dynamic, 1 > >
 
struct  stan::is_vector< Eigen::Matrix< T, 1, Eigen::Dynamic > >
 
struct  stan::scalar_type< T >
 Metaprogram structure to determine the base scalar type of a template argument. More...
 
struct  stan::size_of_helper< T, is_vec >
 
struct  stan::size_of_helper< T, true >
 
struct  stan::scalar_type< Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > >
 
struct  stan::scalar_type< T * >
 
struct  stan::is_vector_like< T >
 
struct  stan::is_vector_like< T * >
 
struct  stan::is_vector_like< const T >
 
struct  stan::is_vector_like< Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > >
 
class  stan::VectorView< T, is_array, throw_if_accessed >
 VectorView is a template metaprogram that takes its argument and allows it to be used like a vector. More...
 
class  stan::VectorView< const T, is_array, throw_if_accessed >
 VectorView that has const correctness. More...
 
class  stan::VectorView< const double, false, false >
 
class  stan::DoubleVectorView< used, is_vec >
 DoubleVectorView allocates double values to be used as intermediate values. More...
 
class  stan::DoubleVectorView< true, false >
 
class  stan::DoubleVectorView< true, true >
 
struct  stan::return_type< T1, T2, T3, T4, T5, T6 >
 Metaprogram to calculate the base scalar return type resulting from promoting all the scalar types of the template parameters. More...
 
struct  stan::is_fvar< T >
 
struct  stan::is_fvar< stan::agrad::fvar< T > >
 
struct  stan::is_var< T >
 
struct  stan::is_var< stan::agrad::var >
 
struct  stan::contains_fvar< T1, T2, T3, T4, T5, T6 >
 Metaprogram to calculate the base scalar return type resulting from promoting all the scalar types of the template parameters. More...
 
struct  stan::is_var_or_arithmetic< T1, T2, T3, T4, T5, T6 >
 
+ + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

template<typename T >
stan::get (const T &x, size_t n)
 
template<typename T >
stan::get (const std::vector< T > &x, size_t n)
 
template<typename T , int R, int C>
stan::get (const Eigen::Matrix< T, R, C > &m, size_t n)
 
template<typename T >
size_t stan::length (const T &)
 
template<typename T >
size_t stan::length (const std::vector< T > &x)
 
template<typename T , int R, int C>
size_t stan::length (const Eigen::Matrix< T, R, C > &m)
 
template<typename T >
size_t stan::size_of (const T &x)
 
template<typename T1 , typename T2 >
size_t stan::max_size (const T1 &x1, const T2 &x2)
 
template<typename T1 , typename T2 , typename T3 >
size_t stan::max_size (const T1 &x1, const T2 &x2, const T3 &x3)
 
template<typename T1 , typename T2 , typename T3 , typename T4 >
size_t stan::max_size (const T1 &x1, const T2 &x2, const T3 &x3, const T4 &x4)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/meta_2traits_8hpp_source.html b/doc/api/html/meta_2traits_8hpp_source.html new file mode 100644 index 00000000000..652621de453 --- /dev/null +++ b/doc/api/html/meta_2traits_8hpp_source.html @@ -0,0 +1,482 @@ + + + + + +Stan: src/stan/meta/traits.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
traits.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__META__TRAITS_HPP__
+
2 #define __STAN__META__TRAITS_HPP__
+
3 
+ +
5 // #include <stan/agrad/partials_vari.hpp>
+
6 #include <stan/agrad/rev/var.hpp>
+
7 #include <vector>
+
8 #include <boost/type_traits.hpp>
+
9 #include <boost/type_traits/is_arithmetic.hpp>
+
10 
+
11 #include <boost/math/tools/promotion.hpp>
+
12 #include <stan/math/matrix.hpp>
+
13 
+
14 namespace stan {
+
15 
+
29  template <typename T>
+
30  struct is_constant {
+
35  enum { value = boost::is_convertible<T,double>::value };
+
36  };
+
37 
+
38 
+
43  template <typename T>
+ + +
46  };
+
47 
+
48 
+
49  template <typename T>
+
50  struct is_constant_struct<std::vector<T> > {
+ +
52  };
+
53 
+
54  template <typename T, int R, int C>
+
55  struct is_constant_struct<Eigen::Matrix<T,R,C> > {
+ +
57  };
+
58 
+
59  template <typename T>
+
60  struct is_constant_struct<Eigen::Block<T> > {
+ +
62  };
+
63 
+
64 
+
65 
+
66 
+
67  // FIXME: use boost::type_traits::remove_all_extents to extend to array/ptr types
+
68 
+
69  template <typename T>
+
70  struct is_vector {
+
71  enum { value = 0 };
+
72  typedef T type;
+
73  };
+
74  template <typename T>
+
75  struct is_vector<const T> {
+ +
77  typedef T type;
+
78  };
+
79  template <typename T>
+
80  struct is_vector<std::vector<T> > {
+
81  enum { value = 1 };
+
82  typedef T type;
+
83  };
+
84 
+
85  template <typename T>
+
86  struct is_vector<Eigen::Matrix<T,Eigen::Dynamic,1> > {
+
87  enum { value = 1 };
+
88  typedef T type;
+
89  };
+
90  template <typename T>
+
91  struct is_vector<Eigen::Matrix<T,1,Eigen::Dynamic> > {
+
92  enum { value = 1 };
+
93  typedef T type;
+
94  };
+
95 
+
96  namespace {
+
97  template <bool is_vec, typename T>
+
98  struct scalar_type_helper {
+
99  typedef T type;
+
100  };
+
101 
+
102  template <typename T>
+
103  struct scalar_type_helper<true, T> {
+
104  typedef typename scalar_type_helper<is_vector<typename T::value_type>::value, typename T::value_type>::type type;
+
105  };
+
106  }
+
115  template <typename T>
+
116  struct scalar_type {
+
117  typedef typename scalar_type_helper<is_vector<T>::value, T>::type type;
+
118  };
+
119 
+
120  template <typename T>
+
121  inline T get(const T& x, size_t n) {
+
122  return x;
+
123  }
+
124  template <typename T>
+
125  inline T get(const std::vector<T>& x, size_t n) {
+
126  return x[n];
+
127  }
+
128  template <typename T, int R, int C>
+
129  inline T get(const Eigen::Matrix<T,R,C>& m, size_t n) {
+
130  return m(static_cast<int>(n));
+
131  }
+
132 
+
133 
+
134 
+
135  // length() should only be applied to primitive or std vector or Eigen vector
+
136  template <typename T>
+
137  size_t length(const T& /*x*/) {
+
138  return 1U;
+
139  }
+
140  template <typename T>
+
141  size_t length(const std::vector<T>& x) {
+
142  return x.size();
+
143  }
+
144  template <typename T, int R, int C>
+
145  size_t length(const Eigen::Matrix<T,R,C>& m) {
+
146  return m.size();
+
147  }
+
148 
+
149  template<typename T, bool is_vec>
+
150  struct size_of_helper {
+
151  static size_t size_of(const T& /*x*/) {
+
152  return 1U;
+
153  }
+
154  };
+
155 
+
156  template<typename T>
+
157  struct size_of_helper<T, true> {
+
158  static size_t size_of(const T& x) {
+
159  return x.size();
+
160  }
+
161  };
+
162 
+
163  template <typename T>
+
164  size_t size_of(const T& x) {
+ +
166  }
+
167 
+
168  template <typename T1, typename T2>
+
169  size_t max_size(const T1& x1, const T2& x2) {
+
170  size_t result = length(x1);
+
171  result = result > length(x2) ? result : length(x2);
+
172  return result;
+
173  }
+
174 
+
175  template <typename T1, typename T2, typename T3>
+
176  size_t max_size(const T1& x1, const T2& x2, const T3& x3) {
+
177  size_t result = length(x1);
+
178  result = result > length(x2) ? result : length(x2);
+
179  result = result > length(x3) ? result : length(x3);
+
180  return result;
+
181  }
+
182 
+
183  template <typename T1, typename T2, typename T3, typename T4>
+
184  size_t max_size(const T1& x1, const T2& x2, const T3& x3, const T4& x4) {
+
185  size_t result = length(x1);
+
186  result = result > length(x2) ? result : length(x2);
+
187  result = result > length(x3) ? result : length(x3);
+
188  result = result > length(x4) ? result : length(x4);
+
189  return result;
+
190  }
+
191 
+
192  // ****************** additions for new VV *************************
+
193  template <typename T>
+
194  struct scalar_type<Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> > {
+
195  typedef typename scalar_type<T>::type type;
+
196  };
+
197 
+
198  template <typename T>
+
199  struct scalar_type<T*> {
+
200  typedef typename scalar_type<T>::type type;
+
201  };
+
202 
+
203 
+
204  // handles scalar, eigen vec, eigen row vec, std vec
+
205  template <typename T>
+
206  struct is_vector_like {
+ +
208  };
+
209  template <typename T>
+
210  struct is_vector_like<T*> {
+
211  enum { value = true };
+
212  };
+
213  // handles const
+
214  template <typename T>
+
215  struct is_vector_like<const T> {
+ +
217  };
+
218  // handles eigen matrix
+
219  template <typename T>
+
220  struct is_vector_like<Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> > {
+
221  enum { value = true };
+
222  };
+
223 
+
224 
+
250  template <typename T,
+
251  bool is_array = stan::is_vector_like<T>::value,
+
252  bool throw_if_accessed = false>
+
253  class VectorView {
+
254  public:
+
255  typedef typename scalar_type<T>::type scalar_t;
+
256 
+
257  VectorView(scalar_t& c) : x_(&c) { }
+
258 
+
259  VectorView(std::vector<scalar_t>& v) : x_(&v[0]) { }
+
260 
+
261  template <int R, int C>
+
262  VectorView(Eigen::Matrix<scalar_t,R,C>& m) : x_(&m(0)) { }
+
263 
+
264  VectorView(scalar_t* x) : x_(x) { }
+
265 
+ +
267  if (throw_if_accessed)
+
268  throw std::out_of_range("VectorView: this cannot be accessed");
+
269  if (is_array)
+
270  return x_[i];
+
271  else
+
272  return x_[0];
+
273  }
+
274  private:
+
275  scalar_t* x_;
+
276  };
+
277 
+
282  template <typename T, bool is_array, bool throw_if_accessed>
+
283  class VectorView<const T, is_array, throw_if_accessed> {
+
284  public:
+
285  typedef typename scalar_type<T>::type scalar_t;
+
286 
+
287  VectorView(const scalar_t& c) : x_(&c) { }
+
288 
+
289  VectorView(const scalar_t* x) : x_(x) { }
+
290 
+
291  VectorView(const std::vector<scalar_t>& v) : x_(&v[0]) { }
+
292 
+
293  template <int R, int C>
+
294  VectorView(const Eigen::Matrix<scalar_t,R,C>& m) : x_(&m(0)) { }
+
295 
+
296  const scalar_t& operator[](int i) const {
+
297  if (throw_if_accessed)
+
298  throw std::out_of_range("VectorView: this cannot be accessed");
+
299  if (is_array)
+
300  return x_[i];
+
301  else
+
302  return x_[0];
+
303  }
+
304  private:
+
305  const scalar_t* x_;
+
306  };
+
307 
+
308  // simplify to hold value in common case where it's more efficient
+
309  template <>
+
310  class VectorView<const double, false, false> {
+
311  public:
+
312  VectorView(double x) : x_(x) { }
+
313  double operator[](int /* i */) const {
+
314  return x_;
+
315  }
+
316  private:
+
317  const double x_;
+
318  };
+
319 
+
320 
+
335  template<bool used, bool is_vec>
+ +
337  public:
+
338  DoubleVectorView(size_t /* n */) { }
+
339  double& operator[](size_t /* i */) {
+
340  throw std::runtime_error("used is false. this should never be called");
+
341  }
+
342  };
+
343 
+
344  template<>
+
345  class DoubleVectorView<true, false> {
+
346  private:
+
347  double x_;
+
348  public:
+
349  DoubleVectorView(size_t /* n */) : x_(0.0) { }
+
350  double& operator[](size_t /* i */) {
+
351  return x_;
+
352  }
+
353  };
+
354 
+
355  template<>
+
356  class DoubleVectorView<true, true> {
+
357  private:
+
358  std::vector<double> x_;
+
359  public:
+
360  DoubleVectorView(size_t n) : x_(n) { }
+
361  double& operator[](size_t i) {
+
362  return x_[i];
+
363  }
+
364  };
+
365 
+
370  template <typename T1,
+
371  typename T2 = double,
+
372  typename T3 = double,
+
373  typename T4 = double,
+
374  typename T5 = double,
+
375  typename T6 = double>
+
376  struct return_type {
+
377  typedef typename
+
378  boost::math::tools::promote_args<typename scalar_type<T1>::type,
+
379  typename scalar_type<T2>::type,
+
380  typename scalar_type<T3>::type,
+
381  typename scalar_type<T4>::type,
+
382  typename scalar_type<T5>::type,
+ + +
385  };
+
386 
+
387 
+
388  template <typename T>
+
389  struct is_fvar {
+
390  enum { value = false };
+
391  };
+
392  template <typename T>
+
393  struct is_fvar<stan::agrad::fvar<T> > {
+
394  enum { value = true };
+
395  };
+
396 
+
397 
+
398  template <typename T>
+
399  struct is_var {
+
400  enum { value = false };
+
401  };
+
402  template <>
+
403  struct is_var<stan::agrad::var> {
+
404  enum { value = true };
+
405  };
+
406 
+
407 
+
408 
+
409  // FIXME: pull out scalar types
+
410 
+
415  template <typename T1,
+
416  typename T2 = double,
+
417  typename T3 = double,
+
418  typename T4 = double,
+
419  typename T5 = double,
+
420  typename T6 = double>
+
421  struct contains_fvar {
+
422  enum {
+ + + + + + +
429  };
+
430  };
+
431 
+
432 
+
433  template <typename T1,
+
434  typename T2 = double,
+
435  typename T3 = double,
+
436  typename T4 = double,
+
437  typename T5 = double,
+
438  typename T6 = double>
+ +
440  enum {
+
441  value = (is_var<typename scalar_type<T1>::type>::value || boost::is_arithmetic<typename scalar_type<T1>::type>::value)
+
442  && (is_var<typename scalar_type<T2>::type>::value || boost::is_arithmetic<typename scalar_type<T2>::type>::value)
+
443  && (is_var<typename scalar_type<T3>::type>::value || boost::is_arithmetic<typename scalar_type<T3>::type>::value)
+
444  && (is_var<typename scalar_type<T4>::type>::value || boost::is_arithmetic<typename scalar_type<T4>::type>::value)
+
445  && (is_var<typename scalar_type<T5>::type>::value || boost::is_arithmetic<typename scalar_type<T5>::type>::value)
+
446  && (is_var<typename scalar_type<T6>::type>::value || boost::is_arithmetic<typename scalar_type<T6>::type>::value)
+
447  };
+
448  };
+
449 
+
450 
+
451 
+
452 
+
453 }
+
454 
+
455 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/meta_8hpp.html b/doc/api/html/meta_8hpp.html new file mode 100644 index 00000000000..532ece1bb0f --- /dev/null +++ b/doc/api/html/meta_8hpp.html @@ -0,0 +1,110 @@ + + + + + +Stan: src/stan/meta.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
meta.hpp File Reference
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/meta_8hpp_source.html b/doc/api/html/meta_8hpp_source.html new file mode 100644 index 00000000000..0b8077de7a4 --- /dev/null +++ b/doc/api/html/meta_8hpp_source.html @@ -0,0 +1,113 @@ + + + + + +Stan: src/stan/meta.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
meta.hpp
+
+
+Go to the documentation of this file.
1 #ifndef STAN_META_HPP
+
2 #define STAN_META_HPP
+
3 
+
4 #include "stan/meta/traits.hpp"
+
5 
+
6 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/minus_8hpp.html b/doc/api/html/minus_8hpp.html new file mode 100644 index 00000000000..5ea703a9e7b --- /dev/null +++ b/doc/api/html/minus_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/matrix/minus.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
minus.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
stan::math::minus (const T &x)
 Returns the negation of the specified scalar or matrix.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/minus_8hpp_source.html b/doc/api/html/minus_8hpp_source.html new file mode 100644 index 00000000000..cee6425da90 --- /dev/null +++ b/doc/api/html/minus_8hpp_source.html @@ -0,0 +1,122 @@ + + + + + +Stan: src/stan/math/matrix/minus.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
minus.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__MINUS_HPP__
+
2 #define __STAN__MATH__MATRIX__MINUS_HPP__
+
3 
+
4 namespace stan {
+
5  namespace math {
+
6 
+
14  template <typename T>
+
15  inline
+
16  T minus(const T& x) {
+
17  return -x;
+
18  }
+
19 
+
20  }
+
21 }
+
22 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/model_2util_8hpp.html b/doc/api/html/model_2util_8hpp.html new file mode 100644 index 00000000000..b6ca1aa89c8 --- /dev/null +++ b/doc/api/html/model_2util_8hpp.html @@ -0,0 +1,160 @@ + + + + + +Stan: src/stan/model/util.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
util.hpp File Reference
+
+
+
#include <cmath>
+#include <iomanip>
+#include <iostream>
+#include <vector>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/agrad/rev/matrix/grad.hpp>
+#include <stan/agrad/rev/var.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::model
 For compiling models.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

template<bool jacobian_adjust_transform, class M >
double stan::model::log_prob_propto (const M &model, std::vector< double > &params_r, std::vector< int > &params_i, std::ostream *msgs=0)
 Helper function to calculate log probability for double scalars up to a proportion.
 
template<bool propto, bool jacobian_adjust_transform, class M >
double stan::model::log_prob_grad (const M &model, std::vector< double > &params_r, std::vector< int > &params_i, std::vector< double > &gradient, std::ostream *msgs=0)
 Compute the gradient using reverse-mode automatic differentiation, writing the result into the specified gradient, using the specified perturbation.
 
template<bool jacobian_adjust_transform, class M >
double stan::model::log_prob_propto (const M &model, Eigen::VectorXd &params_r, std::ostream *msgs=0)
 Helper function to calculate log probability for double scalars up to a proportion.
 
template<bool propto, bool jacobian_adjust_transform, class M >
double stan::model::log_prob_grad (const M &model, Eigen::VectorXd &params_r, Eigen::VectorXd &gradient, std::ostream *msgs=0)
 Compute the gradient using reverse-mode automatic differentiation, writing the result into the specified gradient, using the specified perturbation.
 
template<bool propto, bool jacobian_adjust_transform, class M >
void stan::model::finite_diff_grad (const M &model, std::vector< double > &params_r, std::vector< int > &params_i, std::vector< double > &grad, double epsilon=1e-6, std::ostream *msgs=0)
 Compute the gradient using finite differences for the specified parameters, writing the result into the specified gradient, using the specified perturbation.
 
template<bool propto, bool jacobian_adjust_transform, class M >
int stan::model::test_gradients (const M &model, std::vector< double > &params_r, std::vector< int > &params_i, double epsilon=1e-6, double error=1e-6, std::ostream &o=std::cout, std::ostream *msgs=0)
 Test the log_prob_grad() function's ability to produce accurate gradients using finite differences.
 
template<bool propto, bool jacobian_adjust_transform, class M >
double stan::model::grad_hess_log_prob (const M &model, std::vector< double > &params_r, std::vector< int > &params_i, std::vector< double > &gradient, std::vector< double > &hessian, std::ostream *msgs=0)
 Evaluate the log-probability, its gradient, and its Hessian at params_r.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/model_2util_8hpp_source.html b/doc/api/html/model_2util_8hpp_source.html new file mode 100644 index 00000000000..2fbb312d59a --- /dev/null +++ b/doc/api/html/model_2util_8hpp_source.html @@ -0,0 +1,358 @@ + + + + + +Stan: src/stan/model/util.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
util.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MODEL__UTIL_HPP__
+
2 #define __STAN__MODEL__UTIL_HPP__
+
3 
+
4 #include <cmath>
+
5 #include <iomanip>
+
6 #include <iostream>
+
7 #include <vector>
+
8 
+ + +
11 #include <stan/agrad/rev/var.hpp>
+
12 
+
13 namespace stan {
+
14 
+
15  namespace model {
+
16 
+
38  template <bool jacobian_adjust_transform, class M>
+
39  double log_prob_propto(const M& model,
+
40  std::vector<double>& params_r,
+
41  std::vector<int>& params_i,
+
42  std::ostream* msgs = 0) {
+
43  using stan::agrad::var;
+
44  using std::vector;
+
45  vector<var> ad_params_r;
+
46  for (size_t i = 0; i < model.num_params_r(); ++i)
+
47  ad_params_r.push_back(params_r[i]);
+
48  try {
+
49  double lp
+
50  = model
+
51  .template log_prob<true,
+
52  jacobian_adjust_transform>(ad_params_r,params_i,
+
53  msgs)
+
54  .val();
+ +
56  return lp;
+
57  } catch (std::exception &ex) {
+ +
59  throw;
+
60  }
+
61  }
+
62 
+
80  template <bool propto, bool jacobian_adjust_transform, class M>
+
81  double log_prob_grad(const M& model,
+
82  std::vector<double>& params_r,
+
83  std::vector<int>& params_i,
+
84  std::vector<double>& gradient,
+
85  std::ostream* msgs = 0) {
+
86  using std::vector;
+
87  using stan::agrad::var;
+
88  vector<var> ad_params_r(params_r.size());
+
89  for (size_t i = 0; i < model.num_params_r(); ++i) {
+
90  stan::agrad::var var_i(params_r[i]);
+
91  ad_params_r[i] = var_i;
+
92  }
+
93  try {
+
94  var adLogProb
+
95  = model
+
96  .template log_prob<propto,
+
97  jacobian_adjust_transform>(ad_params_r,
+
98  params_i,msgs);
+
99  double val = adLogProb.val();
+
100  adLogProb.grad(ad_params_r,gradient);
+
101  return val;
+
102  } catch (std::exception &ex) {
+ +
104  throw;
+
105  }
+
106  }
+
107 
+
128  template <bool jacobian_adjust_transform, class M>
+
129  double log_prob_propto(const M& model,
+
130  Eigen::VectorXd& params_r,
+
131  std::ostream* msgs = 0) {
+
132  using stan::agrad::var;
+
133  using std::vector;
+
134  vector<var> ad_params_r;
+
135  for (size_t i = 0; i < model.num_params_r(); ++i)
+
136  ad_params_r.push_back(params_r(i));
+
137  try {
+
138  double lp
+
139  = model
+
140  .template log_prob<true,
+
141  jacobian_adjust_transform>(ad_params_r, msgs)
+
142  .val();
+ +
144  return lp;
+
145  } catch (std::exception &ex) {
+ +
147  throw;
+
148  }
+
149  }
+
150 
+
167  template <bool propto, bool jacobian_adjust_transform, class M>
+
168  double log_prob_grad(const M& model,
+
169  Eigen::VectorXd& params_r,
+
170  Eigen::VectorXd& gradient,
+
171  std::ostream* msgs = 0) {
+
172  using std::vector;
+
173  using stan::agrad::var;
+
174  Eigen::Matrix<var,Eigen::Dynamic,1> ad_params_r(params_r.size());
+
175  for (size_t i = 0; i < model.num_params_r(); ++i) {
+
176  stan::agrad::var var_i(params_r[i]);
+
177  ad_params_r[i] = var_i;
+
178  }
+
179  try {
+
180  var adLogProb
+
181  = model
+
182  .template log_prob<propto,
+
183  jacobian_adjust_transform>(ad_params_r, msgs);
+
184  double val = adLogProb.val();
+
185  stan::agrad::grad(adLogProb, ad_params_r, gradient);
+
186  return val;
+
187  } catch (std::exception &ex) {
+ +
189  throw;
+
190  }
+
191  }
+
192 
+
211  template <bool propto, bool jacobian_adjust_transform, class M>
+
212  void finite_diff_grad(const M& model,
+
213  std::vector<double>& params_r,
+
214  std::vector<int>& params_i,
+
215  std::vector<double>& grad,
+
216  double epsilon = 1e-6,
+
217  std::ostream* msgs = 0) {
+
218  std::vector<double> perturbed(params_r);
+
219  grad.resize(params_r.size());
+
220  for (size_t k = 0; k < params_r.size(); k++) {
+
221  perturbed[k] += epsilon;
+
222  double logp_plus
+
223  = model
+
224  .template log_prob<propto,
+
225  jacobian_adjust_transform>(perturbed, params_i,
+
226  msgs);
+
227  perturbed[k] = params_r[k] - epsilon;
+
228  double logp_minus
+
229  = model
+
230  .template log_prob<propto,
+
231  jacobian_adjust_transform>(perturbed, params_i,
+
232  msgs);
+
233  double gradest = (logp_plus - logp_minus) / (2*epsilon);
+
234  grad[k] = gradest;
+
235  perturbed[k] = params_r[k];
+
236  }
+
237  }
+
238 
+
239 
+
262  template <bool propto, bool jacobian_adjust_transform, class M>
+
263  int test_gradients(const M& model,
+
264  std::vector<double>& params_r,
+
265  std::vector<int>& params_i,
+
266  double epsilon = 1e-6,
+
267  double error = 1e-6,
+
268  std::ostream& o = std::cout,
+
269  std::ostream* msgs = 0) {
+
270  std::vector<double> grad;
+
271  double lp
+ +
273  jacobian_adjust_transform>(model,
+
274  params_r,
+
275  params_i,
+
276  grad,msgs);
+
277 
+
278  std::vector<double> grad_fd;
+
279  finite_diff_grad<false,
+
280  true,
+
281  M>(model,
+
282  params_r, params_i,
+
283  grad_fd, epsilon,
+
284  msgs);
+
285 
+
286  int num_failed = 0;
+
287 
+
288  o << std::endl
+
289  << " Log probability=" << lp
+
290  << std::endl;
+
291 
+
292  o << std::endl
+
293  << std::setw(10) << "param idx"
+
294  << std::setw(16) << "value"
+
295  << std::setw(16) << "model"
+
296  << std::setw(16) << "finite diff"
+
297  << std::setw(16) << "error"
+
298  << std::endl;
+
299  for (size_t k = 0; k < params_r.size(); k++) {
+
300  o << std::setw(10) << k
+
301  << std::setw(16) << params_r[k]
+
302  << std::setw(16) << grad[k]
+
303  << std::setw(16) << grad_fd[k]
+
304  << std::setw(16) << (grad[k] - grad_fd[k])
+
305  << std::endl;
+
306  if (std::fabs(grad[k] - grad_fd[k]) > error)
+
307  num_failed++;
+
308  }
+
309  return num_failed;
+
310  }
+
311 
+
312 
+
335  template <bool propto, bool jacobian_adjust_transform, class M>
+
336  double grad_hess_log_prob(const M& model,
+
337  std::vector<double>& params_r,
+
338  std::vector<int>& params_i,
+
339  std::vector<double>& gradient,
+
340  std::vector<double>& hessian,
+
341  std::ostream* msgs = 0) {
+
342  const double epsilon = 1e-3;
+
343  const int order = 4;
+
344  const double perturbations[order]
+
345  = {-2*epsilon, -1*epsilon, epsilon, 2*epsilon};
+
346  const double coefficients[order]
+
347  = { 1.0 / 12.0,
+
348  -2.0 / 3.0,
+
349  2.0 / 3.0,
+
350  -1.0 / 12.0 };
+
351 
+
352  double result
+ +
354  jacobian_adjust_transform>(model,
+
355  params_r,
+
356  params_i,
+
357  gradient,
+
358  msgs);
+
359  hessian.assign(params_r.size() * params_r.size(), 0);
+
360  std::vector<double> temp_grad(params_r.size());
+
361  std::vector<double> perturbed_params(params_r.begin(), params_r.end());
+
362  for (size_t d = 0; d < params_r.size(); d++) {
+
363  double* row = &hessian[d*params_r.size()];
+
364  for (int i = 0; i < order; i++) {
+
365  perturbed_params[d] = params_r[d] + perturbations[i];
+ +
367  jacobian_adjust_transform>(model,
+
368  perturbed_params,
+
369  params_i,
+
370  temp_grad);
+
371  for (size_t dd = 0; dd < params_r.size(); dd++) {
+
372  row[dd] += 0.5 * coefficients[i] * temp_grad[dd] / epsilon;
+
373  hessian[d + dd*params_r.size()]
+
374  += 0.5 * coefficients[i] * temp_grad[dd] / epsilon;
+
375  }
+
376  }
+
377  perturbed_params[d] = params_r[d];
+
378  }
+
379  return result;
+
380  }
+
381 
+
382  }
+
383 }
+
384 
+
385 
+
386 
+
387 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/model_8hpp.html b/doc/api/html/model_8hpp.html new file mode 100644 index 00000000000..f717ebb8f01 --- /dev/null +++ b/doc/api/html/model_8hpp.html @@ -0,0 +1,111 @@ + + + + + +Stan: src/stan/model.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
model.hpp File Reference
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/model_8hpp_source.html b/doc/api/html/model_8hpp_source.html new file mode 100644 index 00000000000..01831081b58 --- /dev/null +++ b/doc/api/html/model_8hpp_source.html @@ -0,0 +1,114 @@ + + + + + +Stan: src/stan/model.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
model.hpp
+
+
+Go to the documentation of this file.
1 #ifndef STAN_MODEL_HPP
+
2 #define STAN_MODEL_HPP
+
3 
+ +
5 #include "stan/model/util.hpp"
+
6 
+
7 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/model__header_8hpp.html b/doc/api/html/model__header_8hpp.html new file mode 100644 index 00000000000..e4a8f70d35b --- /dev/null +++ b/doc/api/html/model__header_8hpp.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/model/model_header.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
model_header.hpp File Reference
+
+
+
#include <cmath>
+#include <cstddef>
+#include <fstream>
+#include <iostream>
+#include <sstream>
+#include <stdexcept>
+#include <utility>
+#include <vector>
+#include <boost/exception/all.hpp>
+#include <boost/random/linear_congruential.hpp>
+#include <stan/agrad/rev.hpp>
+#include <stan/agrad/rev/matrix.hpp>
+#include <stan/gm/command.hpp>
+#include <stan/io/cmd_line.hpp>
+#include <stan/io/dump.hpp>
+#include <stan/io/reader.hpp>
+#include <stan/io/writer.hpp>
+#include <stan/io/csv_writer.hpp>
+#include <stan/math/matrix.hpp>
+#include <stan/math.hpp>
+#include <stan/math/rep_array.hpp>
+#include <stan/math/rep_vector.hpp>
+#include <stan/math/rep_row_vector.hpp>
+#include <stan/math/rep_matrix.hpp>
+#include <stan/model/prob_grad.hpp>
+#include <stan/prob/distributions.hpp>
+
+

Go to the source code of this file.

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/model__header_8hpp_source.html b/doc/api/html/model__header_8hpp_source.html new file mode 100644 index 00000000000..cfa948c4fc3 --- /dev/null +++ b/doc/api/html/model__header_8hpp_source.html @@ -0,0 +1,144 @@ + + + + + +Stan: src/stan/model/model_header.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
model_header.hpp
+
+
+Go to the documentation of this file.
1 #ifndef STAN__MODEL__MODEL__HEADER_HPP__
+
2 #define STAN__MODEL__MODEL__HEADER_HPP__
+
3 
+
4 #include <cmath>
+
5 #include <cstddef>
+
6 #include <fstream>
+
7 #include <iostream>
+
8 #include <sstream>
+
9 #include <stdexcept>
+
10 #include <utility>
+
11 #include <vector>
+
12 
+
13 #include <boost/exception/all.hpp>
+
14 #include <boost/random/linear_congruential.hpp>
+
15 
+
16 #include <stan/agrad/rev.hpp>
+ +
18 
+
19 #include <stan/gm/command.hpp>
+
20 #include <stan/io/cmd_line.hpp>
+
21 #include <stan/io/dump.hpp>
+
22 #include <stan/io/reader.hpp>
+
23 #include <stan/io/writer.hpp>
+
24 #include <stan/io/csv_writer.hpp>
+
25 
+
26 #include <stan/math/matrix.hpp>
+
27 #include <stan/math.hpp>
+
28 
+
29 #include <stan/math/rep_array.hpp>
+
30 #include <stan/math/rep_vector.hpp>
+ +
32 #include <stan/math/rep_matrix.hpp>
+
33 
+
34 #include <stan/model/prob_grad.hpp>
+ +
36 
+
37 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/multi__gp_8hpp.html b/doc/api/html/multi__gp_8hpp.html new file mode 100644 index 00000000000..98d005e1bf2 --- /dev/null +++ b/doc/api/html/multi__gp_8hpp.html @@ -0,0 +1,151 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/continuous/multi_gp.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
multi_gp.hpp File Reference
+
+
+
#include <boost/random/normal_distribution.hpp>
+#include <boost/random/variate_generator.hpp>
+#include <stan/math/matrix_error_handling.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/math/error_handling/dom_err.hpp>
+#include <stan/prob/constants.hpp>
+#include <stan/prob/traits.hpp>
+#include <stan/agrad/rev.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/agrad/rev/matrix.hpp>
+#include <stan/math/matrix/dot_product.hpp>
+#include <stan/math/matrix/log.hpp>
+#include <stan/math/matrix/multiply.hpp>
+#include <stan/math/matrix/rows_dot_product.hpp>
+#include <stan/math/matrix/subtract.hpp>
+#include <stan/math/matrix/sum.hpp>
+#include <stan/math/matrix/ldlt.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + +

+Functions

template<bool propto, typename T_y , typename T_covar , typename T_w >
boost::math::tools::promote_args
+< T_y, T_w, T_covar >::type 
stan::prob::multi_gp_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma, const Eigen::Matrix< T_w, Eigen::Dynamic, 1 > &w)
 The log of a multivariate Gaussian Process for the given y, Sigma, and w.
 
template<typename T_y , typename T_loc , typename T_covar >
boost::math::tools::promote_args
+< T_y, T_loc, T_covar >::type 
stan::prob::multi_gp_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &w)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/multi__gp_8hpp_source.html b/doc/api/html/multi__gp_8hpp_source.html new file mode 100644 index 00000000000..3f9e8ffe682 --- /dev/null +++ b/doc/api/html/multi__gp_8hpp_source.html @@ -0,0 +1,233 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/continuous/multi_gp.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
multi_gp.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__MULTIVARIATE__CONTINUOUS__MULTI_GP_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__MULTIVARIATE__CONTINUOUS__MULTI_GP_HPP__
+
3 
+
4 #include <boost/random/normal_distribution.hpp>
+
5 #include <boost/random/variate_generator.hpp>
+
6 
+ + + +
10 #include <stan/prob/constants.hpp>
+
11 #include <stan/prob/traits.hpp>
+
12 #include <stan/agrad/rev.hpp>
+
13 #include <stan/meta/traits.hpp>
+ + +
16 #include <stan/math/matrix/log.hpp>
+ + + +
20 #include <stan/math/matrix/sum.hpp>
+
21 
+ +
23 
+
24 namespace stan {
+
25  namespace prob {
+
26  // MultiGP(y|Sigma,w) [y.rows() = w.size(), y.cols() = Sigma.rows();
+
27  // Sigma symmetric, non-negative, definite]
+
46  template <bool propto,
+
47  typename T_y, typename T_covar, typename T_w>
+
48  typename boost::math::tools::promote_args<T_y,T_w,T_covar>::type
+
49  multi_gp_log(const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& y,
+
50  const Eigen::Matrix<T_covar,Eigen::Dynamic,Eigen::Dynamic>& Sigma,
+
51  const Eigen::Matrix<T_w,Eigen::Dynamic,1>& w) {
+
52  static const char* function = "stan::prob::multi_gp_log(%1%)";
+
53  typedef typename boost::math::tools::promote_args<T_y,T_w,T_covar>::type T_lp;
+
54  T_lp lp(0.0);
+
55 
+
56  using stan::math::log;
+
57  using stan::math::sum;
+ + + + + + + + + + +
68  using stan::math::LDLT_factor;
+
69 
+
70  if (!check_size_match(function,
+
71  Sigma.rows(), "Rows of kernel matrix",
+
72  Sigma.cols(), "columns of kernel matrix",
+
73  &lp))
+
74  return lp;
+
75  if (!check_positive(function, Sigma.rows(), "Kernel rows", &lp))
+
76  return lp;
+
77  if (!check_finite(function, Sigma, "Kernel", &lp))
+
78  return lp;
+
79  if (!check_symmetric(function, Sigma, "Kernel", &lp))
+
80  return lp;
+
81 
+ +
83  if (!ldlt_Sigma.success()) {
+
84  std::ostringstream message;
+
85  message << "Kernel matrix is not positive definite. "
+
86  << "K[1,1] is %1%.";
+
87  std::string str(message.str());
+
88  stan::math::dom_err(function,Sigma(0,0),"",str.c_str(),"",&lp);
+
89  return lp;
+
90  }
+
91 
+
92  if (!check_size_match(function,
+
93  y.rows(), "Size of random variable (rows y)",
+
94  w.size(), "Size of kernel scales (w)",
+
95  &lp))
+
96  return lp;
+
97  if (!check_size_match(function,
+
98  y.cols(), "Size of random variable",
+
99  Sigma.rows(), "rows of covariance parameter",
+
100  &lp))
+
101  return lp;
+
102  if (!check_finite(function, w, "Kernel scales", &lp))
+
103  return lp;
+
104  if (!check_positive(function, w, "Kernel scales", &lp))
+
105  return lp;
+
106  if (!check_finite(function, y, "Random variable", &lp))
+
107  return lp;
+
108 
+
109  if (y.rows() == 0)
+
110  return lp;
+
111 
+ +
113  lp += NEG_LOG_SQRT_TWO_PI * y.rows() * y.cols();
+
114  }
+
115 
+ +
117  lp -= (0.5 * y.rows()) * log_determinant_ldlt(ldlt_Sigma);
+
118  }
+
119 
+ +
121  lp += (0.5 * y.cols()) * sum(log(w));
+
122  }
+
123 
+ +
125  Eigen::Matrix<T_w,Eigen::Dynamic,Eigen::Dynamic> w_mat(w.asDiagonal());
+
126  Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic> yT(y.transpose());
+
127  lp -= 0.5 * trace_inv_quad_form_ldlt(w_mat,ldlt_Sigma,yT);
+
128  }
+
129 
+
130  return lp;
+
131  }
+
132 
+
133  template <typename T_y, typename T_loc, typename T_covar>
+
134  inline
+
135  typename boost::math::tools::promote_args<T_y,T_loc,T_covar>::type
+
136  multi_gp_log(const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& y,
+
137  const Eigen::Matrix<T_covar,Eigen::Dynamic,Eigen::Dynamic>& Sigma,
+
138  const Eigen::Matrix<T_loc,Eigen::Dynamic,1>& w) {
+
139  return multi_gp_log<false>(y,Sigma,w);
+
140  }
+
141  }
+
142 }
+
143 
+
144 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/multi__normal_8hpp.html b/doc/api/html/multi__normal_8hpp.html new file mode 100644 index 00000000000..da94de576ec --- /dev/null +++ b/doc/api/html/multi__normal_8hpp.html @@ -0,0 +1,166 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/continuous/multi_normal.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
multi_normal.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + + + +

+Functions

template<bool propto, typename T_y , typename T_loc , typename T_covar >
boost::math::tools::promote_args
+< T_y, T_loc, T_covar >::type 
stan::prob::multi_normal_log (const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma)
 
template<typename T_y , typename T_loc , typename T_covar >
boost::math::tools::promote_args
+< T_y, T_loc, T_covar >::type 
stan::prob::multi_normal_log (const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma)
 
template<bool propto, typename T_y , typename T_loc , typename T_covar >
boost::math::tools::promote_args
+< T_y, T_loc, T_covar >::type 
stan::prob::multi_normal_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma)
 
template<typename T_y , typename T_loc , typename T_covar >
boost::math::tools::promote_args
+< T_y, T_loc, T_covar >::type 
stan::prob::multi_normal_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma)
 
template<class RNG >
Eigen::VectorXd stan::prob::multi_normal_rng (const Eigen::Matrix< double, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< double, Eigen::Dynamic, Eigen::Dynamic > &S, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/multi__normal_8hpp_source.html b/doc/api/html/multi__normal_8hpp_source.html new file mode 100644 index 00000000000..dfb05c32863 --- /dev/null +++ b/doc/api/html/multi__normal_8hpp_source.html @@ -0,0 +1,360 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/continuous/multi_normal.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
multi_normal.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__MULTIVARIATE__CONTINUOUS__MULTI_NORMAL_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__MULTIVARIATE__CONTINUOUS__MULTI_NORMAL_HPP__
+
3 
+
4 #include <boost/random/normal_distribution.hpp>
+
5 #include <boost/random/variate_generator.hpp>
+
6 
+
7 #include <stan/agrad/rev.hpp>
+ + + + + + + + +
16 #include <stan/math/matrix/log.hpp>
+ + + + + +
22 #include <stan/math/matrix/sum.hpp>
+ +
24 #include <stan/meta/traits.hpp>
+
25 #include <stan/prob/constants.hpp>
+
26 #include <stan/prob/traits.hpp>
+
27 
+
28 namespace stan {
+
29 
+
30  namespace prob {
+
31 
+
32  template <bool propto,
+
33  typename T_y, typename T_loc, typename T_covar>
+
34  typename boost::math::tools::promote_args<T_y,T_loc,T_covar>::type
+
35  multi_normal_log(const Eigen::Matrix<T_y,Eigen::Dynamic,1>& y,
+
36  const Eigen::Matrix<T_loc,Eigen::Dynamic,1>& mu,
+
37  const Eigen::Matrix<T_covar,Eigen::Dynamic,Eigen::Dynamic>& Sigma) {
+
38  static const char* function = "stan::prob::multi_normal_log(%1%)";
+
39  typename boost::math::tools::promote_args<T_y,T_loc,T_covar>::type lp(0.0);
+
40 
+ + + + + + + + + +
50 
+
51  if (!check_size_match(function,
+
52  Sigma.rows(), "Rows of covariance parameter",
+
53  Sigma.cols(), "columns of covariance parameter",
+
54  &lp))
+
55  return lp;
+
56  if (!check_positive(function, Sigma.rows(), "Covariance matrix rows", &lp))
+
57  return lp;
+
58  if (!check_symmetric(function, Sigma, "Covariance matrix", &lp))
+
59  return lp;
+
60  if (!check_pos_definite(function, Sigma, "Covariance matrix", &lp))
+
61  return lp;
+
62  if (!check_size_match(function,
+
63  y.size(), "Size of random variable",
+
64  mu.size(), "size of location parameter",
+
65  &lp))
+
66  return lp;
+
67  if (!check_size_match(function,
+
68  y.size(), "Size of random variable",
+
69  Sigma.rows(), "rows of covariance parameter",
+
70  &lp))
+
71  return lp;
+
72  if (!check_size_match(function,
+
73  y.size(), "Size of random variable",
+
74  Sigma.cols(), "columns of covariance parameter",
+
75  &lp))
+
76  return lp;
+
77  if (!check_finite(function, mu, "Location parameter", &lp))
+
78  return lp;
+
79  if (!check_not_nan(function, y, "Random variable", &lp))
+
80  return lp;
+
81 
+
82  if (y.rows() == 0)
+
83  return lp;
+
84 
+ +
86  lp += NEG_LOG_SQRT_TWO_PI * y.rows();
+
87 
+ +
89  lp -= 0.5 * log_determinant(Sigma);
+
90  }
+
91 
+ +
93  Eigen::Matrix<typename
+
94  boost::math::tools::promote_args<T_y,T_loc>::type,
+
95  Eigen::Dynamic, 1> y_minus_mu(y.size());
+
96  for (int i = 0; i < y.size(); i++)
+
97  y_minus_mu(i) = y(i)-mu(i);
+
98  Eigen::Matrix<typename
+
99  boost::math::tools::promote_args<T_covar,T_loc,T_y>::type,
+
100  Eigen::Dynamic, 1> Sinv_y_minus_mu(mdivide_left_spd(Sigma,y_minus_mu));
+
101  lp -= 0.5 * dot_product(y_minus_mu,Sinv_y_minus_mu);
+
102  }
+
103  return lp;
+
104  }
+
105 
+
106  template <typename T_y, typename T_loc, typename T_covar>
+
107  inline
+
108  typename boost::math::tools::promote_args<T_y,T_loc,T_covar>::type
+
109  multi_normal_log(const Eigen::Matrix<T_y,Eigen::Dynamic,1>& y,
+
110  const Eigen::Matrix<T_loc,Eigen::Dynamic,1>& mu,
+
111  const Eigen::Matrix<T_covar,Eigen::Dynamic,Eigen::Dynamic>& Sigma) {
+
112  return multi_normal_log<false>(y,mu,Sigma);
+
113  }
+
114 
+
115 
+
116 
+
117 
+
118  template <bool propto,
+
119  typename T_y, typename T_loc, typename T_covar>
+
120  typename boost::math::tools::promote_args<T_y,T_loc,T_covar>::type
+
121  multi_normal_log(const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& y,
+
122  const Eigen::Matrix<T_loc,Eigen::Dynamic,1>& mu,
+
123  const Eigen::Matrix<T_covar,Eigen::Dynamic,Eigen::Dynamic>& Sigma) {
+
124  static const char* function = "stan::prob::multi_normal_log(%1%)";
+
125  typename boost::math::tools::promote_args<T_y,T_loc,T_covar>::type lp(0.0);
+
126 
+ + + + + + +
133  using stan::math::sum;
+ + + +
137 
+
138  if (!check_size_match(function,
+
139  Sigma.rows(), "Rows of covariance matrix",
+
140  Sigma.cols(), "columns of covariance matrix",
+
141  &lp))
+
142  return lp;
+
143  if (!check_positive(function, Sigma.rows(), "Covariance matrix rows", &lp))
+
144  return lp;
+
145  if (!check_symmetric(function, Sigma, "Covariance matrix", &lp))
+
146  return lp;
+
147  if (!check_pos_definite(function, Sigma, "Covariance matrix", &lp))
+
148  return lp;
+
149  if (!check_size_match(function,
+
150  y.cols(), "Columns of random variable",
+
151  mu.rows(), "rows of location parameter",
+
152  &lp))
+
153  return lp;
+
154  if (!check_size_match(function,
+
155  y.cols(), "Columns of random variable",
+
156  Sigma.rows(), "rows of covariance parameter",
+
157  &lp))
+
158  return lp;
+
159  if (!check_size_match(function,
+
160  y.cols(), "Columns of random variable",
+
161  Sigma.cols(), "columns of covariance parameter",
+
162  &lp))
+
163  return lp;
+
164  if (!check_finite(function, mu, "Location parameter", &lp))
+
165  return lp;
+
166  if (!check_not_nan(function, y, "Random variable", &lp))
+
167  return lp;
+
168 
+
169  if (y.cols() == 0)
+
170  return lp;
+
171 
+ +
173  lp += NEG_LOG_SQRT_TWO_PI * y.cols() * y.rows();
+
174 
+ +
176  lp -= 0.5 * log_determinant(Sigma) * y.rows();
+
177  }
+
178 
+ +
180  Eigen::Matrix<T_loc, Eigen::Dynamic, Eigen::Dynamic> MU(y.rows(),y.cols());
+ +
182  i < y.rows();
+
183  i++)
+
184  MU.row(i) = mu;
+
185 
+
186  Eigen::Matrix<typename
+
187  boost::math::tools::promote_args<T_loc,T_y>::type,
+
188  Eigen::Dynamic,Eigen::Dynamic> y_minus_MU(y.rows(), y.cols());
+
189 
+
190  for (int i = 0; i < y.size(); i++)
+
191  y_minus_MU(i) = y(i)-MU(i);
+
192 
+
193  Eigen::Matrix<typename
+
194  boost::math::tools::promote_args<T_loc,T_y>::type,
+
195  Eigen::Dynamic,Eigen::Dynamic> z(y_minus_MU.transpose()); // was =
+
196 
+
197  // FIXME: revert this code when subtract() is fixed.
+
198  // Eigen::Matrix<typename
+
199  // boost::math::tools::promote_args<T_loc,T_y>::type,
+
200  // Eigen::Dynamic,Eigen::Dynamic>
+
201  // z(subtract(y,MU).transpose()); // was =
+
202 
+
203  Eigen::Matrix<typename
+
204  boost::math::tools::promote_args<T_covar,T_loc,T_y>::type,
+
205  Eigen::Dynamic,Eigen::Dynamic> Sinv_z(mdivide_left_spd(Sigma,z));
+
206 
+
207  lp -= 0.5 * sum(columns_dot_product(z,Sinv_z));
+
208  }
+
209  return lp;
+
210  }
+
211 
+
212  template <typename T_y, typename T_loc, typename T_covar>
+
213  inline
+
214  typename boost::math::tools::promote_args<T_y,T_loc,T_covar>::type
+
215  multi_normal_log(const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& y,
+
216  const Eigen::Matrix<T_loc,Eigen::Dynamic,1>& mu,
+
217  const Eigen::Matrix<T_covar,Eigen::Dynamic,Eigen::Dynamic>& Sigma) {
+
218  return multi_normal_log<false>(y,mu,Sigma);
+
219  }
+
220 
+
221 
+
222  template <class RNG>
+
223  inline Eigen::VectorXd
+
224  multi_normal_rng(const Eigen::Matrix<double,Eigen::Dynamic,1>& mu,
+
225  const Eigen::Matrix<double,Eigen::Dynamic,Eigen::Dynamic>& S,
+
226  RNG& rng) {
+
227  using boost::variate_generator;
+
228  using boost::normal_distribution;
+
229 
+
230  static const char* function = "stan::prob::multi_normal_rng(%1%)";
+
231 
+ + + +
235 
+
236  check_positive(function, S.rows(), "Covariance matrix rows");
+
237  check_symmetric(function, S, "Covariance matrix");
+
238  check_finite(function, mu, "Location parameter");
+
239 
+
240  variate_generator<RNG&, normal_distribution<> >
+
241  std_normal_rng(rng, normal_distribution<>(0,1));
+
242 
+
243  Eigen::VectorXd z(S.cols());
+
244  for(int i = 0; i < S.cols(); i++)
+
245  z(i) = std_normal_rng();
+
246 
+
247  return mu + S.llt().matrixL() * z;
+
248  }
+
249  }
+
250 }
+
251 
+
252 #endif
+
253 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/multi__normal__cholesky_8hpp.html b/doc/api/html/multi__normal__cholesky_8hpp.html new file mode 100644 index 00000000000..99879000c94 --- /dev/null +++ b/doc/api/html/multi__normal__cholesky_8hpp.html @@ -0,0 +1,163 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/continuous/multi_normal_cholesky.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
multi_normal_cholesky.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + + +

+Functions

template<bool propto, typename T_y , typename T_loc , typename T_covar >
boost::math::tools::promote_args
+< T_y, T_loc, T_covar >::type 
stan::prob::multi_normal_cholesky_log (const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &L)
 The log of the multivariate normal density for the given y, mu, and a Cholesky factor L of the variance matrix.
 
template<typename T_y , typename T_loc , typename T_covar >
boost::math::tools::promote_args
+< T_y, T_loc, T_covar >::type 
stan::prob::multi_normal_cholesky_log (const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &L)
 
template<bool propto, typename T_y , typename T_loc , typename T_covar >
boost::math::tools::promote_args
+< T_y, T_loc, T_covar >::type 
stan::prob::multi_normal_cholesky_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &L)
 y can have multiple rows (observations) and columns (on variables)
 
template<typename T_y , typename T_loc , typename T_covar >
boost::math::tools::promote_args
+< T_y, T_loc, T_covar >::type 
stan::prob::multi_normal_cholesky_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &L)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/multi__normal__cholesky_8hpp_source.html b/doc/api/html/multi__normal__cholesky_8hpp_source.html new file mode 100644 index 00000000000..287f5db8e7e --- /dev/null +++ b/doc/api/html/multi__normal__cholesky_8hpp_source.html @@ -0,0 +1,318 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/continuous/multi_normal_cholesky.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
multi_normal_cholesky.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__MULTIVARIATE__CONTINUOUS__MULTI_NORMAL_CHOLESKY_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__MULTIVARIATE__CONTINUOUS__MULTI_NORMAL_CHOLESKY_HPP__
+
3 
+
4 #include <stan/agrad/rev.hpp>
+ + + + + + + + +
13 #include <stan/math/matrix/log.hpp>
+ + + + + +
19 #include <stan/math/matrix/sum.hpp>
+ +
21 #include <stan/meta/traits.hpp>
+
22 #include <stan/prob/constants.hpp>
+
23 #include <stan/prob/traits.hpp>
+
24 
+
25 namespace stan {
+
26 
+
27  namespace prob {
+
28 
+
46  template <bool propto,
+
47  typename T_y, typename T_loc, typename T_covar>
+
48  typename boost::math::tools::promote_args<T_y,T_loc,T_covar>::type
+
49  multi_normal_cholesky_log(const Eigen::Matrix<T_y,Eigen::Dynamic,1>& y,
+
50  const Eigen::Matrix<T_loc,Eigen::Dynamic,1>& mu,
+
51  const Eigen::Matrix<T_covar,Eigen::Dynamic,Eigen::Dynamic>& L) {
+
52  static const char* function = "stan::prob::multi_normal_cholesky_log(%1%)";
+
53 
+ + + + +
58  using stan::math::sum;
+
59 
+ + + + +
64  using boost::math::tools::promote_args;
+
65 
+
66  typename promote_args<T_y,T_loc,T_covar>::type lp(0.0);
+
67 
+
68  if (!check_size_match(function,
+
69  y.size(), "Size of random variable",
+
70  mu.size(), "size of location parameter",
+
71  &lp))
+
72  return lp;
+
73  if (!check_size_match(function,
+
74  y.size(), "Size of random variable",
+
75  L.rows(), "rows of covariance parameter",
+
76  &lp))
+
77  return lp;
+
78  if (!check_size_match(function,
+
79  y.size(), "Size of random variable",
+
80  L.cols(), "columns of covariance parameter",
+
81  &lp))
+
82  return lp;
+
83  if (!check_finite(function, mu, "Location parameter", &lp))
+
84  return lp;
+
85  if (!check_not_nan(function, y, "Random variable", &lp))
+
86  return lp;
+
87 
+
88  if (y.rows() == 0)
+
89  return lp;
+
90 
+ +
92  lp += NEG_LOG_SQRT_TWO_PI * y.rows();
+
93 
+ +
95  Eigen::Matrix<T_covar,Eigen::Dynamic,1> L_log_diag = L.diagonal().array().log().matrix();
+
96  lp -= sum(L_log_diag);
+
97  }
+
98 
+ +
100  Eigen::Matrix<typename
+
101  boost::math::tools::promote_args<T_y,T_loc>::type,
+
102  Eigen::Dynamic, 1> y_minus_mu(y.size());
+
103  for (int i = 0; i < y.size(); i++)
+
104  y_minus_mu(i) = y(i)-mu(i);
+
105  Eigen::Matrix<typename
+
106  boost::math::tools::promote_args<T_covar,T_loc,T_y>::type,
+
107  Eigen::Dynamic, 1>
+
108  half(mdivide_left_tri_low(L,y_minus_mu));
+
109  // FIXME: this code does not compile. revert after fixing subtract()
+
110  // Eigen::Matrix<typename
+
111  // boost::math::tools::promote_args<T_covar,T_loc,T_y>::type,
+
112  // Eigen::Dynamic, 1>
+
113  // half(mdivide_left_tri_low(L,subtract(y,mu)));
+
114  lp -= 0.5 * dot_self(half);
+
115  }
+
116  return lp;
+
117  }
+
118 
+
119  template <typename T_y, typename T_loc, typename T_covar>
+
120  inline
+
121  typename boost::math::tools::promote_args<T_y,T_loc,T_covar>::type
+
122  multi_normal_cholesky_log(const Eigen::Matrix<T_y,Eigen::Dynamic,1>& y,
+
123  const Eigen::Matrix<T_loc,Eigen::Dynamic,1>& mu,
+
124  const Eigen::Matrix<T_covar,Eigen::Dynamic,Eigen::Dynamic>& L) {
+
125  return multi_normal_cholesky_log<false>(y,mu,L);
+
126  }
+
127 
+
130  template <bool propto,
+
131  typename T_y, typename T_loc, typename T_covar>
+
132  typename boost::math::tools::promote_args<T_y,T_loc,T_covar>::type
+
133  multi_normal_cholesky_log(const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& y,
+
134  const Eigen::Matrix<T_loc,Eigen::Dynamic,1>& mu,
+
135  const Eigen::Matrix<T_covar,Eigen::Dynamic,Eigen::Dynamic>& L) {
+
136  static const char* function = "stan::prob::multi_normal_cholesky_log(%1%)";
+
137 
+ + +
140  using stan::math::multiply;
+
141  using stan::math::subtract;
+
142  using stan::math::sum;
+
143  using stan::math::log;
+
144 
+ + + + +
149  using boost::math::tools::promote_args;
+
150 
+
151  typename promote_args<T_y,T_loc,T_covar>::type lp(0.0);
+
152 
+
153  if (!check_size_match(function,
+
154  y.cols(), "Columns of random variable",
+
155  mu.rows(), "rows of location parameter",
+
156  &lp))
+
157  return lp;
+
158  if (!check_size_match(function,
+
159  y.cols(), "Columns of random variable",
+
160  L.rows(), "rows of covariance parameter",
+
161  &lp))
+
162  return lp;
+
163  if (!check_size_match(function,
+
164  y.cols(), "Columns of random variable",
+
165  L.cols(), "columns of covariance parameter",
+
166  &lp))
+
167  return lp;
+
168  if (!check_finite(function, mu, "Location parameter", &lp))
+
169  return lp;
+
170  if (!check_not_nan(function, y, "Random variable", &lp))
+
171  return lp;
+
172 
+
173  if (y.cols() == 0)
+
174  return lp;
+
175 
+ +
177  lp += NEG_LOG_SQRT_TWO_PI * y.cols() * y.rows();
+
178 
+ +
180  Eigen::Matrix<T_covar,Eigen::Dynamic,1> L_log_diag = L.diagonal().array().log().matrix();
+
181  lp -= sum(L_log_diag) * y.rows();
+
182  }
+
183 
+ +
185  Eigen::Matrix<T_loc, Eigen::Dynamic, Eigen::Dynamic> MU(y.rows(),y.cols());
+ +
187  i < y.rows(); i++)
+
188  MU.row(i) = mu;
+
189 
+
190  Eigen::Matrix<typename
+
191  boost::math::tools::promote_args<T_loc,T_y>::type,
+
192  Eigen::Dynamic,Eigen::Dynamic>
+
193  y_minus_MU(y.rows(), y.cols());
+
194  for (int i = 0; i < y.size(); i++)
+
195  y_minus_MU(i) = y(i)-MU(i);
+
196 
+
197  Eigen::Matrix<typename
+
198  boost::math::tools::promote_args<T_loc,T_y>::type,
+
199  Eigen::Dynamic,Eigen::Dynamic>
+
200  z(y_minus_MU.transpose()); // was =
+
201 
+
202  // FIXME: revert this code when subtract() is fixed.
+
203  // Eigen::Matrix<typename
+
204  // boost::math::tools::promote_args<T_loc,T_y>::type,
+
205  // Eigen::Dynamic,Eigen::Dynamic>
+
206  // z(subtract(y,MU).transpose()); // was =
+
207 
+
208  Eigen::Matrix<typename
+
209  boost::math::tools::promote_args<T_covar,T_loc,T_y>::type,
+
210  Eigen::Dynamic,Eigen::Dynamic>
+
211  half(mdivide_left_tri_low(L,z));
+
212 
+
213  lp -= 0.5 * sum(columns_dot_self(half));
+
214  }
+
215  return lp;
+
216  }
+
217 
+
218  template <typename T_y, typename T_loc, typename T_covar>
+
219  inline
+
220  typename boost::math::tools::promote_args<T_y,T_loc,T_covar>::type
+
221  multi_normal_cholesky_log(const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& y,
+
222  const Eigen::Matrix<T_loc,Eigen::Dynamic,1>& mu,
+
223  const Eigen::Matrix<T_covar,Eigen::Dynamic,Eigen::Dynamic>& L) {
+
224  return multi_normal_cholesky_log<false>(y,mu,L);
+
225  }
+
226 
+
227  }
+
228 }
+
229 
+
230 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/multi__normal__prec_8hpp.html b/doc/api/html/multi__normal__prec_8hpp.html new file mode 100644 index 00000000000..6d15cafe2ee --- /dev/null +++ b/doc/api/html/multi__normal__prec_8hpp.html @@ -0,0 +1,162 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/continuous/multi_normal_prec.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
multi_normal_prec.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + +

+Functions

template<bool propto, typename T_y , typename T_loc , typename T_covar >
boost::math::tools::promote_args
+< T_y, T_loc, T_covar >::type 
stan::prob::multi_normal_prec_log (const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma)
 
template<typename T_y , typename T_loc , typename T_covar >
boost::math::tools::promote_args
+< T_y, T_loc, T_covar >::type 
stan::prob::multi_normal_prec_log (const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma)
 
template<bool propto, typename T_y , typename T_loc , typename T_covar >
boost::math::tools::promote_args
+< T_y, T_loc, T_covar >::type 
stan::prob::multi_normal_prec_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma)
 y can have multiple rows (observations) and columns (on variables)
 
template<typename T_y , typename T_loc , typename T_covar >
boost::math::tools::promote_args
+< T_y, T_loc, T_covar >::type 
stan::prob::multi_normal_prec_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/multi__normal__prec_8hpp_source.html b/doc/api/html/multi__normal__prec_8hpp_source.html new file mode 100644 index 00000000000..b04a25c6e50 --- /dev/null +++ b/doc/api/html/multi__normal__prec_8hpp_source.html @@ -0,0 +1,327 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/continuous/multi_normal_prec.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
multi_normal_prec.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__MULTIVARIATE__CONTINUOUS__MULTI_NORMAL_PREC_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__MULTIVARIATE__CONTINUOUS__MULTI_NORMAL_PREC_HPP__
+
3 
+
4 #include <stan/agrad/rev.hpp>
+ + + + + + + + +
13 #include <stan/math/matrix/log.hpp>
+ + + + + +
19 #include <stan/math/matrix/sum.hpp>
+ +
21 #include <stan/meta/traits.hpp>
+
22 #include <stan/prob/constants.hpp>
+
23 #include <stan/prob/traits.hpp>
+
24 
+
25 namespace stan {
+
26 
+
27  namespace prob {
+
28 
+
29  template <bool propto,
+
30  typename T_y, typename T_loc, typename T_covar>
+
31  typename boost::math::tools::promote_args<T_y,T_loc,T_covar>::type
+
32  multi_normal_prec_log(const Eigen::Matrix<T_y,Eigen::Dynamic,1>& y,
+
33  const Eigen::Matrix<T_loc,Eigen::Dynamic,1>& mu,
+
34  const Eigen::Matrix<T_covar,Eigen::Dynamic,Eigen::Dynamic>& Sigma) {
+
35  static const char* function = "stan::prob::multi_normal_prec_log(%1%)";
+
36  typename boost::math::tools::promote_args<T_y,T_loc,T_covar>::type lp(0.0);
+
37 
+ + + + + +
43  using stan::math::sum;
+ + +
46  using stan::math::LDLT_factor;
+
47 
+
48  if (!check_size_match(function,
+
49  Sigma.rows(), "Rows of covariance parameter",
+
50  Sigma.cols(), "columns of covariance parameter",
+
51  &lp))
+
52  return lp;
+
53  if (!check_positive(function, Sigma.rows(), "Precision matrix rows", &lp))
+
54  return lp;
+
55  if (!check_symmetric(function, Sigma, "Precision matrix", &lp))
+
56  return lp;
+
57 
+ +
59  if (!ldlt_Sigma.success()) {
+
60  std::ostringstream message;
+
61  message << "Precision matrix is not positive definite. "
+
62  << "Sigma[1,1] is %1%.";
+
63  std::string str(message.str());
+
64  stan::math::dom_err(function,Sigma(0,0),"",str.c_str(),"",&lp);
+
65  return lp;
+
66  }
+
67 
+
68  if (!check_size_match(function,
+
69  y.size(), "Size of random variable",
+
70  mu.size(), "size of location parameter",
+
71  &lp))
+
72  return lp;
+
73  if (!check_size_match(function,
+
74  y.size(), "Size of random variable",
+
75  Sigma.rows(), "rows of covariance parameter",
+
76  &lp))
+
77  return lp;
+
78  if (!check_size_match(function,
+
79  y.size(), "Size of random variable",
+
80  Sigma.cols(), "columns of covariance parameter",
+
81  &lp))
+
82  return lp;
+
83  if (!check_finite(function, mu, "Location parameter", &lp))
+
84  return lp;
+
85  if (!check_not_nan(function, y, "Random variable", &lp))
+
86  return lp;
+
87 
+
88  if (y.rows() == 0)
+
89  return lp;
+
90 
+ +
92  lp += NEG_LOG_SQRT_TWO_PI * y.rows();
+
93 
+ +
95  lp += 0.5*log_determinant_ldlt(ldlt_Sigma);
+
96 
+ +
98  Eigen::Matrix<typename
+
99  boost::math::tools::promote_args<T_y,T_loc>::type,
+
100  Eigen::Dynamic, 1> y_minus_mu(y.size());
+
101  for (int i = 0; i < y.size(); i++)
+
102  y_minus_mu(i) = y(i)-mu(i);
+
103  lp -= 0.5 * trace_quad_form(Sigma,y_minus_mu);
+
104  }
+
105  return lp;
+
106  }
+
107 
+
108  template <typename T_y, typename T_loc, typename T_covar>
+
109  inline
+
110  typename boost::math::tools::promote_args<T_y,T_loc,T_covar>::type
+
111  multi_normal_prec_log(const Eigen::Matrix<T_y,Eigen::Dynamic,1>& y,
+
112  const Eigen::Matrix<T_loc,Eigen::Dynamic,1>& mu,
+
113  const Eigen::Matrix<T_covar,Eigen::Dynamic,Eigen::Dynamic>& Sigma) {
+
114  return multi_normal_prec_log<false>(y,mu,Sigma);
+
115  }
+
116 
+
120  template <bool propto,
+
121  typename T_y, typename T_loc, typename T_covar>
+
122  typename boost::math::tools::promote_args<T_y,T_loc,T_covar>::type
+
123  multi_normal_prec_log(const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& y,
+
124  const Eigen::Matrix<T_loc,Eigen::Dynamic,1>& mu,
+
125  const Eigen::Matrix<T_covar,Eigen::Dynamic,Eigen::Dynamic>& Sigma) {
+
126  static const char* function = "stan::prob::multi_normal_prec_log(%1%)";
+
127  typename boost::math::tools::promote_args<T_y,T_loc,T_covar>::type lp(0.0);
+
128 
+ + + + + +
134  using stan::math::sum;
+ + +
137  using stan::math::LDLT_factor;
+
138 
+
139  if (!check_size_match(function,
+
140  Sigma.rows(), "Rows of covariance matrix",
+
141  Sigma.cols(), "columns of covariance matrix",
+
142  &lp))
+
143  return lp;
+
144  if (!check_positive(function, Sigma.rows(), "Precision matrix rows", &lp))
+
145  return lp;
+
146  if (!check_symmetric(function, Sigma, "Precision matrix", &lp))
+
147  return lp;
+
148 
+ +
150  if (!ldlt_Sigma.success()) {
+
151  std::ostringstream message;
+
152  message << "Precision matrix is not positive definite. "
+
153  << "Sigma[1,1] is %1%.";
+
154  std::string str(message.str());
+
155  stan::math::dom_err(function,Sigma(0,0),"",str.c_str(),"",&lp);
+
156  return lp;
+
157  }
+
158 
+
159  if (!check_size_match(function,
+
160  y.cols(), "Columns of random variable",
+
161  mu.rows(), "rows of location parameter",
+
162  &lp))
+
163  return lp;
+
164  if (!check_size_match(function,
+
165  y.cols(), "Columns of random variable",
+
166  Sigma.rows(), "rows of covariance parameter",
+
167  &lp))
+
168  return lp;
+
169  if (!check_size_match(function,
+
170  y.cols(), "Columns of random variable",
+
171  Sigma.cols(), "columns of covariance parameter",
+
172  &lp))
+
173  return lp;
+
174  if (!check_finite(function, mu, "Location parameter", &lp))
+
175  return lp;
+
176  if (!check_not_nan(function, y, "Random variable", &lp))
+
177  return lp;
+
178 
+
179  if (y.cols() == 0)
+
180  return lp;
+
181 
+ +
183  lp += NEG_LOG_SQRT_TWO_PI * y.cols() * y.rows();
+
184 
+ +
186  lp += log_determinant_ldlt(ldlt_Sigma) * (0.5 * y.cols());
+
187  }
+
188 
+ +
190  Eigen::Matrix<T_loc, Eigen::Dynamic, Eigen::Dynamic> MU(y.rows(),y.cols());
+ +
192  i < y.rows(); i++)
+
193  MU.row(i) = mu;
+
194 
+
195  Eigen::Matrix<typename
+
196  boost::math::tools::promote_args<T_loc,T_y>::type,
+
197  Eigen::Dynamic,Eigen::Dynamic> y_minus_MU(y.rows(), y.cols());
+
198 
+
199  for (int i = 0; i < y.size(); i++)
+
200  y_minus_MU(i) = y(i)-MU(i);
+
201 
+
202  Eigen::Matrix<typename
+
203  boost::math::tools::promote_args<T_loc,T_y>::type,
+
204  Eigen::Dynamic,Eigen::Dynamic> z(y_minus_MU.transpose()); // was =
+
205 
+
206  lp -= 0.5 * trace_quad_form(Sigma,z);
+
207  }
+
208  return lp;
+
209  }
+
210 
+
211  template <typename T_y, typename T_loc, typename T_covar>
+
212  inline
+
213  typename boost::math::tools::promote_args<T_y,T_loc,T_covar>::type
+
214  multi_normal_prec_log(const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& y,
+
215  const Eigen::Matrix<T_loc,Eigen::Dynamic,1>& mu,
+
216  const Eigen::Matrix<T_covar,Eigen::Dynamic,Eigen::Dynamic>& Sigma) {
+
217  return multi_normal_prec_log<false>(y,mu,Sigma);
+
218  }
+
219 
+
220  }
+
221 }
+
222 #endif
+
223 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/multi__student__t_8hpp.html b/doc/api/html/multi__student__t_8hpp.html new file mode 100644 index 00000000000..221271d8721 --- /dev/null +++ b/doc/api/html/multi__student__t_8hpp.html @@ -0,0 +1,149 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/continuous/multi_student_t.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
multi_student_t.hpp File Reference
+
+
+
#include <cstdlib>
+#include <boost/math/special_functions/gamma.hpp>
+#include <boost/math/special_functions/fpclassify.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/math/matrix_error_handling.hpp>
+#include <stan/prob/constants.hpp>
+#include <stan/prob/traits.hpp>
+#include <stan/prob/distributions/multivariate/continuous/multi_normal.hpp>
+#include <stan/prob/distributions/univariate/continuous/inv_gamma.hpp>
+#include <boost/random/variate_generator.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + +

+Functions

template<bool propto, typename T_y , typename T_dof , typename T_loc , typename T_scale >
boost::math::tools::promote_args
+< T_y, T_dof, T_loc, T_scale >
+::type 
stan::prob::multi_student_t_log (const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const T_dof &nu, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_scale, Eigen::Dynamic, Eigen::Dynamic > &Sigma)
 Return the log of the multivariate Student t distribution at the specified arguments.
 
template<typename T_y , typename T_dof , typename T_loc , typename T_scale >
boost::math::tools::promote_args
+< T_y, T_dof, T_loc, T_scale >
+::type 
stan::prob::multi_student_t_log (const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const T_dof &nu, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_scale, Eigen::Dynamic, Eigen::Dynamic > &Sigma)
 
template<class RNG >
Eigen::VectorXd stan::prob::multi_student_t_rng (const double nu, const Eigen::Matrix< double, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< double, Eigen::Dynamic, Eigen::Dynamic > &s, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/multi__student__t_8hpp_source.html b/doc/api/html/multi__student__t_8hpp_source.html new file mode 100644 index 00000000000..fbc211e4415 --- /dev/null +++ b/doc/api/html/multi__student__t_8hpp_source.html @@ -0,0 +1,275 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/continuous/multi_student_t.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
multi_student_t.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__MULTI_STUDENT_T_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__MULTI_STUDENT_T_HPP__
+
3 
+
4 #include <cstdlib>
+
5 
+
6 #include <boost/math/special_functions/gamma.hpp>
+
7 #include <boost/math/special_functions/fpclassify.hpp>
+
8 
+ + +
11 #include <stan/prob/constants.hpp>
+
12 #include <stan/prob/traits.hpp>
+ + +
15 
+
16 #include <boost/random/variate_generator.hpp>
+
17 
+
18 namespace stan {
+
19 
+
20  namespace prob {
+
21 
+
28  template <bool propto,
+
29  typename T_y, typename T_dof, typename T_loc, typename T_scale>
+
30  typename boost::math::tools::promote_args<T_y,T_dof,T_loc,T_scale>::type
+
31  multi_student_t_log(const Eigen::Matrix<T_y,Eigen::Dynamic,1>& y,
+
32  const T_dof& nu,
+
33  const Eigen::Matrix<T_loc,Eigen::Dynamic,1>& mu,
+
34  const
+
35  Eigen::Matrix<T_scale,
+
36  Eigen::Dynamic,Eigen::Dynamic>& Sigma) {
+
37  static const char* function = "stan::prob::multi_student_t(%1%)";
+
38 
+ + + + + +
44  using boost::math::tools::promote_args;
+
45  using boost::math::lgamma;
+ + +
48  using stan::math::LDLT_factor;
+
49 
+
50  typename promote_args<T_y,T_dof,T_loc,T_scale>::type lp(0.0);
+
51  if (!check_size_match(function,
+
52  y.size(), "Size of random variable",
+
53  mu.size(), "size of location parameter",
+
54  &lp))
+
55  return lp;
+
56  if (!check_size_match(function,
+
57  y.size(), "Size of random variable",
+
58  Sigma.rows(), "rows of scale parameter",
+
59  &lp))
+
60  return lp;
+
61  if (!check_size_match(function,
+
62  y.size(), "Size of random variable",
+
63  Sigma.cols(), "columns of scale parameter",
+
64  &lp))
+
65  return lp;
+
66  if (!check_finite(function, mu, "Location parameter", &lp))
+
67  return lp;
+
68  if (!check_not_nan(function, y, "Random variable", &lp))
+
69  return lp;
+
70  if (!check_symmetric(function, Sigma, "Scale parameter", &lp))
+
71  return lp;
+
72 
+ +
74  if (!ldlt_Sigma.success()) {
+
75  std::ostringstream message;
+
76  message << "Scale matrix is not positive definite. "
+
77  << "Sigma(0,0) is %1%.";
+
78  std::string str(message.str());
+
79  stan::math::dom_err(function,Sigma(0,0),"Scale matrix",str.c_str(),"",&lp);
+
80  return lp;
+
81  }
+
82 
+
83  // allows infinities
+
84  if (!check_not_nan(function, nu,
+
85  "Degrees of freedom parameter", &lp))
+
86  return lp;
+
87  if (!check_positive(function, nu,
+
88  "Degrees of freedom parameter", &lp))
+
89  return lp;
+
90 
+
91  using boost::math::isinf;
+
92 
+
93  if (isinf(nu)) // already checked nu > 0
+
94  return multi_normal_log(y,mu,Sigma);
+
95 
+
96  double d = y.size();
+
97 
+ +
99  lp += lgamma(0.5 * (nu + d));
+
100  lp -= lgamma(0.5 * nu);
+
101  lp -= (0.5 * d) * log(nu);
+
102  }
+
103 
+ +
105  lp -= (0.5 * d) * LOG_PI;
+
106 
+
107  using stan::math::multiply;
+ +
109  using stan::math::subtract;
+
110  using Eigen::Array;
+
111 
+
112 
+ +
114  lp -= 0.5*log_determinant_ldlt(ldlt_Sigma);
+
115  }
+
116 
+ +
118 
+
119  Eigen::Matrix<typename promote_args<T_y,T_loc>::type,
+
120  Eigen::Dynamic,
+
121  1> y_minus_mu = subtract(y,mu);
+
122  Eigen::Matrix<typename promote_args<T_scale,T_y,T_loc>::type,
+
123  Eigen::Dynamic,
+
124  1> invSigma_dy = mdivide_left_ldlt(ldlt_Sigma, y_minus_mu);
+
125  lp -= 0.5
+
126  * (nu + d)
+
127  * log(1.0 + dot_product(y_minus_mu,invSigma_dy) / nu);
+
128  }
+
129  return lp;
+
130  }
+
131 
+
132  template <typename T_y, typename T_dof, typename T_loc, typename T_scale>
+
133  inline
+
134  typename boost::math::tools::promote_args<T_y,T_dof,T_loc,T_scale>::type
+
135  multi_student_t_log(const Eigen::Matrix<T_y,Eigen::Dynamic,1>& y,
+
136  const T_dof& nu,
+
137  const Eigen::Matrix<T_loc,Eigen::Dynamic,1>& mu,
+
138  const
+
139  Eigen::Matrix<T_scale,
+
140  Eigen::Dynamic,Eigen::Dynamic>& Sigma) {
+
141  return multi_student_t_log<false>(y,nu,mu,Sigma);
+
142  }
+
143 
+
144 
+
145  template <class RNG>
+
146  inline Eigen::VectorXd
+
147  multi_student_t_rng(const double nu,
+
148  const Eigen::Matrix<double,Eigen::Dynamic,1>& mu,
+
149  const Eigen::Matrix<double,Eigen::Dynamic,Eigen::Dynamic>& s,
+
150  RNG& rng) {
+
151 
+
152  static const char* function = "stan::prob::multi_student_t_rng(%1%)";
+
153 
+ + + + +
158 
+
159  check_finite(function, mu, "Location parameter");
+
160  check_symmetric(function, s, "Scale parameter");
+
161  check_not_nan(function, nu,
+
162  "Degrees of freedom parameter");
+
163  check_positive(function, nu,
+
164  "Degrees of freedom parameter");
+
165 
+
166  Eigen::VectorXd z(s.cols());
+
167  z.setZero();
+
168 
+
169  double w = stan::prob::inv_gamma_rng(nu / 2, nu / 2, rng);
+
170  return mu + std::sqrt(w) * stan::prob::multi_normal_rng(z, s, rng);
+
171  }
+
172  }
+
173 }
+
174 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/multinomial_8hpp.html b/doc/api/html/multinomial_8hpp.html new file mode 100644 index 00000000000..2d340878d62 --- /dev/null +++ b/doc/api/html/multinomial_8hpp.html @@ -0,0 +1,146 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/discrete/multinomial.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
multinomial.hpp File Reference
+
+
+
#include <boost/math/special_functions/gamma.hpp>
+#include <boost/random/uniform_01.hpp>
+#include <boost/random/variate_generator.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/math/functions/multiply_log.hpp>
+#include <stan/math/matrix_error_handling.hpp>
+#include <stan/prob/constants.hpp>
+#include <stan/prob/distributions/univariate/discrete/binomial.hpp>
+#include <stan/prob/distributions/multivariate/discrete/categorical.hpp>
+#include <stan/prob/traits.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + +

+Functions

template<bool propto, typename T_prob >
boost::math::tools::promote_args
+< T_prob >::type 
stan::prob::multinomial_log (const std::vector< int > &ns, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta)
 
template<typename T_prob >
boost::math::tools::promote_args
+< T_prob >::type 
stan::prob::multinomial_log (const std::vector< int > &ns, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta)
 
template<class RNG >
std::vector< int > stan::prob::multinomial_rng (const Eigen::Matrix< double, Eigen::Dynamic, 1 > &theta, const int N, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/multinomial_8hpp_source.html b/doc/api/html/multinomial_8hpp_source.html new file mode 100644 index 00000000000..3c40439356e --- /dev/null +++ b/doc/api/html/multinomial_8hpp_source.html @@ -0,0 +1,204 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/discrete/multinomial.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
multinomial.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__MULTIVARIATE__DISCRETE__MULTINOMIAL_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__MULTIVARIATE__DISCRETE__MULTINOMIAL_HPP__
+
3 
+
4 #include <boost/math/special_functions/gamma.hpp>
+
5 #include <boost/random/uniform_01.hpp>
+
6 #include <boost/random/variate_generator.hpp>
+
7 
+ + + + +
12 #include <stan/prob/constants.hpp>
+ + +
15 #include <stan/prob/traits.hpp>
+
16 
+
17 namespace stan {
+
18 
+
19  namespace prob {
+
20  // Multinomial(ns|N,theta) [0 <= n <= N; SUM ns = N;
+
21  // 0 <= theta[n] <= 1; SUM theta = 1]
+
22  template <bool propto,
+
23  typename T_prob>
+
24  typename boost::math::tools::promote_args<T_prob>::type
+
25  multinomial_log(const std::vector<int>& ns,
+
26  const Eigen::Matrix<T_prob,Eigen::Dynamic,1>& theta) {
+
27  static const char* function = "stan::prob::multinomial_log(%1%)";
+
28 
+ + + +
32  using boost::math::tools::promote_args;
+
33  using boost::math::lgamma;
+
34 
+
35  typename promote_args<T_prob>::type lp(0.0);
+
36  if (!check_nonnegative(function, ns, "Number of trials variable", &lp))
+
37  return lp;
+
38  if (!check_simplex(function, theta, "Probabilites parameter",
+
39  &lp))
+
40  return lp;
+
41  if (!check_size_match(function,
+
42  ns.size(), "Size of number of trials variable",
+
43  theta.rows(), "rows of probabilities parameter",
+
44  &lp))
+
45  return lp;
+ +
47 
+ +
49  double sum = 1.0;
+
50  for (unsigned int i = 0; i < ns.size(); ++i)
+
51  sum += ns[i];
+
52  lp += lgamma(sum);
+
53  for (unsigned int i = 0; i < ns.size(); ++i)
+
54  lp -= lgamma(ns[i] + 1.0);
+
55  }
+ +
57  for (unsigned int i = 0; i < ns.size(); ++i)
+
58  lp += multiply_log(ns[i], theta[i]);
+
59  return lp;
+
60  }
+
61 
+
62  template <typename T_prob>
+
63  typename boost::math::tools::promote_args<T_prob>::type
+
64  multinomial_log(const std::vector<int>& ns,
+
65  const Eigen::Matrix<T_prob,Eigen::Dynamic,1>& theta) {
+
66  return multinomial_log<false>(ns,theta);
+
67  }
+
68 
+
69  template <class RNG>
+
70  inline std::vector<int>
+
71  multinomial_rng(const Eigen::Matrix<double,Eigen::Dynamic,1>& theta,
+
72  const int N,
+
73  RNG& rng) {
+
74  static const char* function = "stan::prob::multinomial_rng(%1%)";
+ + +
77 
+
78  check_simplex(function, theta, "Probabilites parameter");
+
79  check_positive(function,N,"number of trials variables");
+
80 
+
81  std::vector<int> result(N,0);
+
82  double mass_left = 1.0;
+
83  int n_left = N;
+
84  for (int k = 0; n_left > 0 && k < theta.size(); ++k) {
+
85  result[k] = binomial_rng(n_left,theta[k] / mass_left,rng);
+
86  n_left -= result[k];
+
87  mass_left -= theta[k];
+
88  }
+
89  // for (int n = 0; n < N; ++n)
+
90  // ++result[categorical_rng(theta,rng) - 1];
+
91  return result;
+
92  }
+
93 
+
94 
+
95  }
+
96 }
+
97 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/multivariate_2continuous_8hpp.html b/doc/api/html/multivariate_2continuous_8hpp.html new file mode 100644 index 00000000000..2f75d321385 --- /dev/null +++ b/doc/api/html/multivariate_2continuous_8hpp.html @@ -0,0 +1,121 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/continuous.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
continuous.hpp File Reference
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/multivariate_2continuous_8hpp_source.html b/doc/api/html/multivariate_2continuous_8hpp_source.html new file mode 100644 index 00000000000..1ec34637be6 --- /dev/null +++ b/doc/api/html/multivariate_2continuous_8hpp_source.html @@ -0,0 +1,124 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/continuous.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
continuous.hpp
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/multivariate_2discrete_8hpp.html b/doc/api/html/multivariate_2discrete_8hpp.html new file mode 100644 index 00000000000..e30ed94804a --- /dev/null +++ b/doc/api/html/multivariate_2discrete_8hpp.html @@ -0,0 +1,112 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/discrete.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
discrete.hpp File Reference
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/multivariate_2discrete_8hpp_source.html b/doc/api/html/multivariate_2discrete_8hpp_source.html new file mode 100644 index 00000000000..31b7ea4a88d --- /dev/null +++ b/doc/api/html/multivariate_2discrete_8hpp_source.html @@ -0,0 +1,114 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/discrete.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
discrete.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__MULTIVARIATE__DISCRETE_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__MULTIVARIATE__DISCRETE_HPP__
+
3 
+ + + +
7 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/multivariate_8hpp.html b/doc/api/html/multivariate_8hpp.html new file mode 100644 index 00000000000..e0535452052 --- /dev/null +++ b/doc/api/html/multivariate_8hpp.html @@ -0,0 +1,111 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
multivariate.hpp File Reference
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/multivariate_8hpp_source.html b/doc/api/html/multivariate_8hpp_source.html new file mode 100644 index 00000000000..ba0cb4a60e9 --- /dev/null +++ b/doc/api/html/multivariate_8hpp_source.html @@ -0,0 +1,114 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
multivariate.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__MULTIVARIATE_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__MULTIVARIATE_HPP__
+
3 
+ + +
6 
+
7 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespace_eigen.html b/doc/api/html/namespace_eigen.html new file mode 100644 index 00000000000..5fb88f1ee65 --- /dev/null +++ b/doc/api/html/namespace_eigen.html @@ -0,0 +1,124 @@ + + + + + +Stan: Eigen Namespace Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ +
+
+ +
+
Eigen Namespace Reference
+
+
+ +

(Expert) Numerical traits for algorithmic differentiation variables. +More...

+ + + + + +

+Namespaces

namespace  internal
 (Expert) Product traits for algorithmic differentiation variables.
 
+ + + + +

+Classes

struct  NumTraits< stan::agrad::var >
 Numerical traits template override for Eigen for automatic gradient variables. More...
 
+

Detailed Description

+

(Expert) Numerical traits for algorithmic differentiation variables.

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespace_eigen_1_1internal.html b/doc/api/html/namespace_eigen_1_1internal.html new file mode 100644 index 00000000000..dce9a9c8135 --- /dev/null +++ b/doc/api/html/namespace_eigen_1_1internal.html @@ -0,0 +1,134 @@ + + + + + +Stan: Eigen::internal Namespace Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
Eigen::internal Namespace Reference
+
+
+ +

(Expert) Product traits for algorithmic differentiation variables. +More...

+ + + + + + + + + + + + + + + + + + +

+Classes

struct  significant_decimals_default_impl< stan::agrad::var, false >
 Implemented this for printing to stream. More...
 
struct  scalar_product_traits< stan::agrad::var, double >
 Scalar product traits override for Eigen for automatic gradient variables. More...
 
struct  scalar_product_traits< double, stan::agrad::var >
 Scalar product traits override for Eigen for automatic gradient variables. More...
 
struct  general_matrix_vector_product< Index, stan::agrad::var, ColMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >
 Override matrix-vector and matrix-matrix products to use more efficient implementation. More...
 
struct  general_matrix_vector_product< Index, stan::agrad::var, RowMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >
 
struct  general_matrix_matrix_product< Index, stan::agrad::var, LhsStorageOrder, ConjugateLhs, stan::agrad::var, RhsStorageOrder, ConjugateRhs, ColMajor >
 
+

Detailed Description

+

(Expert) Product traits for algorithmic differentiation variables.

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespaceboost.html b/doc/api/html/namespaceboost.html new file mode 100644 index 00000000000..fc53e71959f --- /dev/null +++ b/doc/api/html/namespaceboost.html @@ -0,0 +1,117 @@ + + + + + +Stan: boost Namespace Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ +
+
+ +
+
boost Namespace Reference
+
+
+ +

Reimplementing boost functionality. +More...

+ + + + + +

+Namespaces

namespace  math
 Reimplmeneting boost functionality for stan::agrad::var and and bugs in classification of integer types.
 
+

Detailed Description

+

Reimplementing boost functionality.

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespaceboost_1_1math.html b/doc/api/html/namespaceboost_1_1math.html new file mode 100644 index 00000000000..e2c6c21e339 --- /dev/null +++ b/doc/api/html/namespaceboost_1_1math.html @@ -0,0 +1,330 @@ + + + + + +Stan: boost::math Namespace Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
boost::math Namespace Reference
+
+
+ +

Reimplmeneting boost functionality for stan::agrad::var and and bugs in classification of integer types. +More...

+ + + + + + + + + + + + + + + + + + + + + + +

+Functions

template<>
int fpclassify (const stan::agrad::var &v)
 Categorizes the given stan::agrad::var value.
 
template<>
bool isfinite (const stan::agrad::var &v)
 Checks if the given number has finite value.
 
template<>
bool isinf (const stan::agrad::var &v)
 Checks if the given number is infinite.
 
template<>
bool isnan (const stan::agrad::var &v)
 Checks if the given number is NaN.
 
template<>
bool isnormal (const stan::agrad::var &v)
 Checks if the given number is normal.
 
+

Detailed Description

+

Reimplmeneting boost functionality for stan::agrad::var and and bugs in classification of integer types.

+

FIXME: remove when BOOST fixes isfinite(). See ticket #6517. (Boost 1.48.0) https://svn.boost.org/trac/boost/ticket/6517

+

Function Documentation

+ +
+
+
+template<>
+ + + + + +
+ + + + + + + + +
int boost::math::fpclassify (const stan::agrad::varv)
+
+inline
+
+ +

Categorizes the given stan::agrad::var value.

+

Categorizes the stan::agrad::var value, v, into the following categories: zero, subnormal, normal, infinite, or NAN.

+
Parameters
+ + +
vVariable to classify.
+
+
+
Returns
One of FP_ZERO, FP_NORMAL, FP_FINITE, FP_INFINITE, FP_NAN, or FP_SUBZERO, specifying the category of v.
+ +

Definition at line 24 of file boost_fpclassify.hpp.

+ +
+
+ +
+
+
+template<>
+ + + + + +
+ + + + + + + + +
bool boost::math::isfinite (const stan::agrad::varv)
+
+inline
+
+ +

Checks if the given number has finite value.

+

Return true if the specified variable's value is finite.

+
Parameters
+ + +
vVariable to test.
+
+
+
Returns
true if variable is finite.
+ +

Definition at line 39 of file boost_fpclassify.hpp.

+ +
+
+ +
+
+
+template<>
+ + + + + +
+ + + + + + + + +
bool boost::math::isinf (const stan::agrad::varv)
+
+inline
+
+ +

Checks if the given number is infinite.

+

Return true if the specified variable's value is infinite.

+
Parameters
+ + +
vVariable to test.
+
+
+
Returns
true if variable is infinite.
+ +

Definition at line 54 of file boost_fpclassify.hpp.

+ +
+
+ +
+
+
+template<>
+ + + + + +
+ + + + + + + + +
bool boost::math::isnan (const stan::agrad::varv)
+
+inline
+
+ +

Checks if the given number is NaN.

+

Return true if the specified variable has a value that is NaN.

+
Parameters
+ + +
vVariable to test.
+
+
+
Returns
true if variable is NaN.
+ +

Definition at line 69 of file boost_fpclassify.hpp.

+ +
+
+ +
+
+
+template<>
+ + + + + +
+ + + + + + + + +
bool boost::math::isnormal (const stan::agrad::varv)
+
+inline
+
+ +

Checks if the given number is normal.

+

Return true if the specified variable has a value that is normal.

+
Parameters
+ + +
vVariable to test.
+
+
+
Returns
true if variable is normal.
+ +

Definition at line 84 of file boost_fpclassify.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers.html b/doc/api/html/namespacemembers.html new file mode 100644 index 00000000000..68221218d1d --- /dev/null +++ b/doc/api/html/namespacemembers.html @@ -0,0 +1,202 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all namespace members with links to the namespace documentation for each member:
+ +

- a -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_0x62.html b/doc/api/html/namespacemembers_0x62.html new file mode 100644 index 00000000000..3a61c9d0e9b --- /dev/null +++ b/doc/api/html/namespacemembers_0x62.html @@ -0,0 +1,240 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all namespace members with links to the namespace documentation for each member:
+ +

- b -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_0x63.html b/doc/api/html/namespacemembers_0x63.html new file mode 100644 index 00000000000..7da8ec082b6 --- /dev/null +++ b/doc/api/html/namespacemembers_0x63.html @@ -0,0 +1,343 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all namespace members with links to the namespace documentation for each member:
+ +

- c -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_0x64.html b/doc/api/html/namespacemembers_0x64.html new file mode 100644 index 00000000000..276172719a3 --- /dev/null +++ b/doc/api/html/namespacemembers_0x64.html @@ -0,0 +1,228 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all namespace members with links to the namespace documentation for each member:
+ +

- d -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_0x65.html b/doc/api/html/namespacemembers_0x65.html new file mode 100644 index 00000000000..baaa2e99f68 --- /dev/null +++ b/doc/api/html/namespacemembers_0x65.html @@ -0,0 +1,223 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all namespace members with links to the namespace documentation for each member:
+ +

- e -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_0x66.html b/doc/api/html/namespacemembers_0x66.html new file mode 100644 index 00000000000..0b22949d1a3 --- /dev/null +++ b/doc/api/html/namespacemembers_0x66.html @@ -0,0 +1,191 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all namespace members with links to the namespace documentation for each member:
+ +

- f -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_0x67.html b/doc/api/html/namespacemembers_0x67.html new file mode 100644 index 00000000000..449c93eb4f7 --- /dev/null +++ b/doc/api/html/namespacemembers_0x67.html @@ -0,0 +1,375 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all namespace members with links to the namespace documentation for each member:
+ +

- g -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_0x68.html b/doc/api/html/namespacemembers_0x68.html new file mode 100644 index 00000000000..4c5dfc857fb --- /dev/null +++ b/doc/api/html/namespacemembers_0x68.html @@ -0,0 +1,173 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all namespace members with links to the namespace documentation for each member:
+ +

- h -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_0x69.html b/doc/api/html/namespacemembers_0x69.html new file mode 100644 index 00000000000..2fe076ded77 --- /dev/null +++ b/doc/api/html/namespacemembers_0x69.html @@ -0,0 +1,300 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all namespace members with links to the namespace documentation for each member:
+ +

- i -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_0x6a.html b/doc/api/html/namespacemembers_0x6a.html new file mode 100644 index 00000000000..b5b2bf9b328 --- /dev/null +++ b/doc/api/html/namespacemembers_0x6a.html @@ -0,0 +1,140 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all namespace members with links to the namespace documentation for each member:
+ +

- j -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_0x6c.html b/doc/api/html/namespacemembers_0x6c.html new file mode 100644 index 00000000000..ff12737cdb6 --- /dev/null +++ b/doc/api/html/namespacemembers_0x6c.html @@ -0,0 +1,343 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all namespace members with links to the namespace documentation for each member:
+ +

- l -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_0x6d.html b/doc/api/html/namespacemembers_0x6d.html new file mode 100644 index 00000000000..071ee98c3b1 --- /dev/null +++ b/doc/api/html/namespacemembers_0x6d.html @@ -0,0 +1,286 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all namespace members with links to the namespace documentation for each member:
+ +

- m -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_0x6e.html b/doc/api/html/namespacemembers_0x6e.html new file mode 100644 index 00000000000..ca6d25ac995 --- /dev/null +++ b/doc/api/html/namespacemembers_0x6e.html @@ -0,0 +1,191 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all namespace members with links to the namespace documentation for each member:
+ +

- n -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_0x6f.html b/doc/api/html/namespacemembers_0x6f.html new file mode 100644 index 00000000000..96a3fb5f17d --- /dev/null +++ b/doc/api/html/namespacemembers_0x6f.html @@ -0,0 +1,195 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all namespace members with links to the namespace documentation for each member:
+ +

- o -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_0x70.html b/doc/api/html/namespacemembers_0x70.html new file mode 100644 index 00000000000..2baa3bd5098 --- /dev/null +++ b/doc/api/html/namespacemembers_0x70.html @@ -0,0 +1,253 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all namespace members with links to the namespace documentation for each member:
+ +

- p -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_0x71.html b/doc/api/html/namespacemembers_0x71.html new file mode 100644 index 00000000000..db20104c698 --- /dev/null +++ b/doc/api/html/namespacemembers_0x71.html @@ -0,0 +1,147 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all namespace members with links to the namespace documentation for each member:
+ +

- q -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_0x72.html b/doc/api/html/namespacemembers_0x72.html new file mode 100644 index 00000000000..7f37fb0cdcd --- /dev/null +++ b/doc/api/html/namespacemembers_0x72.html @@ -0,0 +1,242 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all namespace members with links to the namespace documentation for each member:
+ +

- r -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_0x73.html b/doc/api/html/namespacemembers_0x73.html new file mode 100644 index 00000000000..04500492ec0 --- /dev/null +++ b/doc/api/html/namespacemembers_0x73.html @@ -0,0 +1,303 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all namespace members with links to the namespace documentation for each member:
+ +

- s -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_0x74.html b/doc/api/html/namespacemembers_0x74.html new file mode 100644 index 00000000000..6611c9c2e91 --- /dev/null +++ b/doc/api/html/namespacemembers_0x74.html @@ -0,0 +1,208 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all namespace members with links to the namespace documentation for each member:
+ +

- t -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_0x75.html b/doc/api/html/namespacemembers_0x75.html new file mode 100644 index 00000000000..ae50c4765e9 --- /dev/null +++ b/doc/api/html/namespacemembers_0x75.html @@ -0,0 +1,173 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all namespace members with links to the namespace documentation for each member:
+ +

- u -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_0x76.html b/doc/api/html/namespacemembers_0x76.html new file mode 100644 index 00000000000..1091b06babd --- /dev/null +++ b/doc/api/html/namespacemembers_0x76.html @@ -0,0 +1,255 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all namespace members with links to the namespace documentation for each member:
+ +

- v -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_0x77.html b/doc/api/html/namespacemembers_0x77.html new file mode 100644 index 00000000000..ad9a4266306 --- /dev/null +++ b/doc/api/html/namespacemembers_0x77.html @@ -0,0 +1,173 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+
Here is a list of all namespace members with links to the namespace documentation for each member:
+ +

- w -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_func.html b/doc/api/html/namespacemembers_func.html new file mode 100644 index 00000000000..02dde905842 --- /dev/null +++ b/doc/api/html/namespacemembers_func.html @@ -0,0 +1,181 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- a -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_func_0x62.html b/doc/api/html/namespacemembers_func_0x62.html new file mode 100644 index 00000000000..1c01b688118 --- /dev/null +++ b/doc/api/html/namespacemembers_func_0x62.html @@ -0,0 +1,226 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- b -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_func_0x63.html b/doc/api/html/namespacemembers_func_0x63.html new file mode 100644 index 00000000000..e2e8b80b187 --- /dev/null +++ b/doc/api/html/namespacemembers_func_0x63.html @@ -0,0 +1,338 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- c -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_func_0x64.html b/doc/api/html/namespacemembers_func_0x64.html new file mode 100644 index 00000000000..bcd1d3be99d --- /dev/null +++ b/doc/api/html/namespacemembers_func_0x64.html @@ -0,0 +1,218 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- d -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_func_0x65.html b/doc/api/html/namespacemembers_func_0x65.html new file mode 100644 index 00000000000..8ccd700c7e9 --- /dev/null +++ b/doc/api/html/namespacemembers_func_0x65.html @@ -0,0 +1,208 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- e -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_func_0x66.html b/doc/api/html/namespacemembers_func_0x66.html new file mode 100644 index 00000000000..25a9cffb729 --- /dev/null +++ b/doc/api/html/namespacemembers_func_0x66.html @@ -0,0 +1,185 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- f -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_func_0x67.html b/doc/api/html/namespacemembers_func_0x67.html new file mode 100644 index 00000000000..73368145dfd --- /dev/null +++ b/doc/api/html/namespacemembers_func_0x67.html @@ -0,0 +1,375 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- g -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_func_0x68.html b/doc/api/html/namespacemembers_func_0x68.html new file mode 100644 index 00000000000..0295d45681f --- /dev/null +++ b/doc/api/html/namespacemembers_func_0x68.html @@ -0,0 +1,173 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- h -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_func_0x69.html b/doc/api/html/namespacemembers_func_0x69.html new file mode 100644 index 00000000000..c17809cc768 --- /dev/null +++ b/doc/api/html/namespacemembers_func_0x69.html @@ -0,0 +1,282 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- i -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_func_0x6a.html b/doc/api/html/namespacemembers_func_0x6a.html new file mode 100644 index 00000000000..9e7d6e3acf8 --- /dev/null +++ b/doc/api/html/namespacemembers_func_0x6a.html @@ -0,0 +1,140 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- j -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_func_0x6c.html b/doc/api/html/namespacemembers_func_0x6c.html new file mode 100644 index 00000000000..a4e888769f3 --- /dev/null +++ b/doc/api/html/namespacemembers_func_0x6c.html @@ -0,0 +1,324 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- l -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_func_0x6d.html b/doc/api/html/namespacemembers_func_0x6d.html new file mode 100644 index 00000000000..a99f6fa39dd --- /dev/null +++ b/doc/api/html/namespacemembers_func_0x6d.html @@ -0,0 +1,251 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- m -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_func_0x6e.html b/doc/api/html/namespacemembers_func_0x6e.html new file mode 100644 index 00000000000..ac5ff884c3d --- /dev/null +++ b/doc/api/html/namespacemembers_func_0x6e.html @@ -0,0 +1,176 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- n -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_func_0x6f.html b/doc/api/html/namespacemembers_func_0x6f.html new file mode 100644 index 00000000000..23d2b0c4c1b --- /dev/null +++ b/doc/api/html/namespacemembers_func_0x6f.html @@ -0,0 +1,195 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- o -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_func_0x70.html b/doc/api/html/namespacemembers_func_0x70.html new file mode 100644 index 00000000000..93de023290f --- /dev/null +++ b/doc/api/html/namespacemembers_func_0x70.html @@ -0,0 +1,244 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- p -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_func_0x71.html b/doc/api/html/namespacemembers_func_0x71.html new file mode 100644 index 00000000000..55849cb7f23 --- /dev/null +++ b/doc/api/html/namespacemembers_func_0x71.html @@ -0,0 +1,147 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- q -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_func_0x72.html b/doc/api/html/namespacemembers_func_0x72.html new file mode 100644 index 00000000000..6a7c4609bc7 --- /dev/null +++ b/doc/api/html/namespacemembers_func_0x72.html @@ -0,0 +1,216 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- r -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_func_0x73.html b/doc/api/html/namespacemembers_func_0x73.html new file mode 100644 index 00000000000..bb7ad4ee218 --- /dev/null +++ b/doc/api/html/namespacemembers_func_0x73.html @@ -0,0 +1,277 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- s -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_func_0x74.html b/doc/api/html/namespacemembers_func_0x74.html new file mode 100644 index 00000000000..2e114bd17f3 --- /dev/null +++ b/doc/api/html/namespacemembers_func_0x74.html @@ -0,0 +1,197 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- t -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_func_0x75.html b/doc/api/html/namespacemembers_func_0x75.html new file mode 100644 index 00000000000..3b525a1bf47 --- /dev/null +++ b/doc/api/html/namespacemembers_func_0x75.html @@ -0,0 +1,167 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- u -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_func_0x76.html b/doc/api/html/namespacemembers_func_0x76.html new file mode 100644 index 00000000000..4ba7a41005e --- /dev/null +++ b/doc/api/html/namespacemembers_func_0x76.html @@ -0,0 +1,199 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- v -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_func_0x77.html b/doc/api/html/namespacemembers_func_0x77.html new file mode 100644 index 00000000000..a8bd3ffd41a --- /dev/null +++ b/doc/api/html/namespacemembers_func_0x77.html @@ -0,0 +1,173 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- w -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_type.html b/doc/api/html/namespacemembers_type.html new file mode 100644 index 00000000000..01d61d97931 --- /dev/null +++ b/doc/api/html/namespacemembers_type.html @@ -0,0 +1,249 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- b -

+ + +

- f -

+ + +

- i -

+ + +

- m -

+ + +

- p -

+ + +

- r -

+ + +

- s -

+ + +

- u -

+ + +

- v -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacemembers_vars.html b/doc/api/html/namespacemembers_vars.html new file mode 100644 index 00000000000..c3e45f35eaa --- /dev/null +++ b/doc/api/html/namespacemembers_vars.html @@ -0,0 +1,385 @@ + + + + + +Stan: Namespace Members + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + +
+ + + + +
+ +
+ +
+  + +

- a -

+ + +

- b -

+ + +

- c -

+ + +

- d -

+ + +

- e -

+ + +

- i -

+ + +

- l -

+ + +

- m -

+ + +

- n -

+ + +

- p -

+ + +

- r -

+ + +

- s -

+ + +

- t -

+ + +

- u -

+ + +

- v -

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespaces.html b/doc/api/html/namespaces.html new file mode 100644 index 00000000000..060102527d7 --- /dev/null +++ b/doc/api/html/namespaces.html @@ -0,0 +1,124 @@ + + + + + +Stan: Namespace List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + +
+ + + + +
+ +
+ +
+
+
Namespace List
+
+
+
Here is a list of all namespaces with brief descriptions:
+
[detail level 1234]
+ + + + + + + + + + + + + + + + + +
oNboostReimplementing boost functionality
|\NmathReimplmeneting boost functionality for stan::agrad::var and and bugs in classification of integer types
oNEigen(Expert) Numerical traits for algorithmic differentiation variables
|\Ninternal(Expert) Product traits for algorithmic differentiation variables
oNstanProbability, optimization and sampling library
|oNagradFunction gradients via reverse-mode automatic differentiation
|oNgmDirected graphical model compiler
|oNioInput/output utilities
|oNmathMatrices and templated mathematical functions
||\NpoliciesExtending boost functionality
|| \NdetailReimplementing boost::math::policies::detail::raise_domain_error
|oNmcmcMarkov chain Monte Carlo samplers
|oNmemory(Expert) Allocate, free, and manage underlying system memory
|oNmodelFor compiling models
|oNoptimization
|\NprobTemplated probability distributions
\NstdTemplate specification of functions in std for Stan
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacestan.html b/doc/api/html/namespacestan.html new file mode 100644 index 00000000000..a8b18816b91 --- /dev/null +++ b/doc/api/html/namespacestan.html @@ -0,0 +1,615 @@ + + + + + +Stan: stan Namespace Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ +
+
+ +
+
stan Namespace Reference
+
+
+ +

Probability, optimization and sampling library. +More...

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Namespaces

namespace  agrad
 Function gradients via reverse-mode automatic differentiation.
 
namespace  gm
 Directed graphical model compiler.
 
namespace  io
 Input/output utilities.
 
namespace  math
 Matrices and templated mathematical functions.
 
namespace  mcmc
 Markov chain Monte Carlo samplers.
 
namespace  memory
 (Expert) Allocate, free, and manage underlying system memory.
 
namespace  model
 For compiling models.
 
namespace  optimization
 
namespace  prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Classes

struct  is_constant
 Metaprogramming struct to detect whether a given type is constant in the mathematical sense (not the C++ const sense). More...
 
struct  is_constant_struct
 Metaprogram to determine if a type has a base scalar type that can be assigned to type double. More...
 
struct  is_constant_struct< std::vector< T > >
 
struct  is_constant_struct< Eigen::Matrix< T, R, C > >
 
struct  is_constant_struct< Eigen::Block< T > >
 
struct  is_vector
 
struct  is_vector< const T >
 
struct  is_vector< std::vector< T > >
 
struct  is_vector< Eigen::Matrix< T, Eigen::Dynamic, 1 > >
 
struct  is_vector< Eigen::Matrix< T, 1, Eigen::Dynamic > >
 
struct  scalar_type
 Metaprogram structure to determine the base scalar type of a template argument. More...
 
struct  size_of_helper
 
struct  size_of_helper< T, true >
 
struct  scalar_type< Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > >
 
struct  scalar_type< T * >
 
struct  is_vector_like
 
struct  is_vector_like< T * >
 
struct  is_vector_like< const T >
 
struct  is_vector_like< Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > >
 
class  VectorView
 VectorView is a template metaprogram that takes its argument and allows it to be used like a vector. More...
 
class  VectorView< const T, is_array, throw_if_accessed >
 VectorView that has const correctness. More...
 
class  VectorView< const double, false, false >
 
class  DoubleVectorView
 DoubleVectorView allocates double values to be used as intermediate values. More...
 
class  DoubleVectorView< true, false >
 
class  DoubleVectorView< true, true >
 
struct  return_type
 Metaprogram to calculate the base scalar return type resulting from promoting all the scalar types of the template parameters. More...
 
struct  is_fvar
 
struct  is_fvar< stan::agrad::fvar< T > >
 
struct  is_var
 
struct  is_var< stan::agrad::var >
 
struct  contains_fvar
 Metaprogram to calculate the base scalar return type resulting from promoting all the scalar types of the template parameters. More...
 
struct  is_var_or_arithmetic
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

template<typename T >
get (const T &x, size_t n)
 
template<typename T >
get (const std::vector< T > &x, size_t n)
 
template<typename T , int R, int C>
get (const Eigen::Matrix< T, R, C > &m, size_t n)
 
template<typename T >
size_t length (const T &)
 
template<typename T >
size_t length (const std::vector< T > &x)
 
template<typename T , int R, int C>
size_t length (const Eigen::Matrix< T, R, C > &m)
 
template<typename T >
size_t size_of (const T &x)
 
template<typename T1 , typename T2 >
size_t max_size (const T1 &x1, const T2 &x2)
 
template<typename T1 , typename T2 , typename T3 >
size_t max_size (const T1 &x1, const T2 &x2, const T3 &x3)
 
template<typename T1 , typename T2 , typename T3 , typename T4 >
size_t max_size (const T1 &x1, const T2 &x2, const T3 &x3, const T4 &x4)
 
+ + + + + + + + + + +

+Variables

const std::string MAJOR_VERSION = "2"
 Major version number for Stan package.
 
const std::string MINOR_VERSION = "1"
 Minor version number for Stan package.
 
const std::string PATCH_VERSION = "0"
 Patch version for Stan package.
 
+

Detailed Description

+

Probability, optimization and sampling library.

+

Function Documentation

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
T stan::get (const T & x,
size_t n 
)
+
+inline
+
+ +

Definition at line 121 of file traits.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
T stan::get (const std::vector< T > & x,
size_t n 
)
+
+inline
+
+ +

Definition at line 125 of file traits.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
T stan::get (const Eigen::Matrix< T, R, C > & m,
size_t n 
)
+
+inline
+
+ +

Definition at line 129 of file traits.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + +
size_t stan::length (const T & )
+
+ +

Definition at line 137 of file traits.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + +
size_t stan::length (const std::vector< T > & x)
+
+ +

Definition at line 141 of file traits.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + + + + +
size_t stan::length (const Eigen::Matrix< T, R, C > & m)
+
+ +

Definition at line 145 of file traits.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 >
+ + + + + + + + + + + + + + + + + + +
size_t stan::max_size (const T1 & x1,
const T2 & x2 
)
+
+ +

Definition at line 169 of file traits.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , typename T3 >
+ + + + + + + + + + + + + + + + + + + + + + + + +
size_t stan::max_size (const T1 & x1,
const T2 & x2,
const T3 & x3 
)
+
+ +

Definition at line 176 of file traits.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , typename T3 , typename T4 >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
size_t stan::max_size (const T1 & x1,
const T2 & x2,
const T3 & x3,
const T4 & x4 
)
+
+ +

Definition at line 184 of file traits.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + +
size_t stan::size_of (const T & x)
+
+ +

Definition at line 164 of file traits.hpp.

+ +
+
+

Variable Documentation

+ +
+
+ + + + +
const std::string stan::MAJOR_VERSION = "2"
+
+ +

Major version number for Stan package.

+ +

Definition at line 9 of file version.hpp.

+ +
+
+ +
+
+ + + + +
const std::string stan::MINOR_VERSION = "1"
+
+ +

Minor version number for Stan package.

+ +

Definition at line 12 of file version.hpp.

+ +
+
+ +
+
+ + + + +
const std::string stan::PATCH_VERSION = "0"
+
+ +

Patch version for Stan package.

+ +

Definition at line 15 of file version.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacestan_1_1agrad.html b/doc/api/html/namespacestan_1_1agrad.html new file mode 100644 index 00000000000..99ff43e82fa --- /dev/null +++ b/doc/api/html/namespacestan_1_1agrad.html @@ -0,0 +1,21482 @@ + + + + + +Stan: stan::agrad Namespace Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::agrad Namespace Reference
+
+
+ +

Function gradients via reverse-mode automatic differentiation. +More...

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Classes

class  vari
 The variable implementation base class. More...
 
class  var
 Independent (input) and dependent (output) variables for gradients. More...
 
struct  fvar
 
class  partials_vari
 
struct  OperandsAndPartials
 A variable implementation that stores operands and derivatives with respect to the variable. More...
 
class  chainable
 Abstract base class for variable implementations that handles memory management and applying the chain rule. More...
 
class  op_ddv_vari
 
class  op_dv_vari
 
class  op_dvd_vari
 
class  op_dvv_vari
 
class  op_matrix_vari
 
class  precomp_v_vari
 
class  op_v_vari
 
class  op_vd_vari
 
class  op_vdd_vari
 
class  op_vdv_vari
 
class  op_vector_vari
 
class  op_vv_vari
 
class  op_vvd_vari
 
class  op_vvv_vari
 
class  stored_gradient_vari
 A var implementation that stores the daughter variable implementation pointers and the partial derivative with respect to the result explicitly in arrays constructed on the auto-diff memory stack. More...
 
class  chainable_alloc
 A chainable_alloc is an object which is constructed and destructed normally but the memory lifespan is managed along with the arena allocator for the gradient calculation. More...
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Typedefs

typedef Eigen::Matrix< double,
+Eigen::Dynamic, Eigen::Dynamic >
+::Index 
size_type
 
typedef Eigen::Matrix< fvar
+< double >, Eigen::Dynamic,
+Eigen::Dynamic > 
matrix_fd
 
typedef Eigen::Matrix< fvar
+< var >, Eigen::Dynamic,
+Eigen::Dynamic > 
matrix_fv
 
typedef Eigen::Matrix< fvar
+< fvar< double >
+ >, Eigen::Dynamic,
+Eigen::Dynamic > 
matrix_ffd
 
typedef Eigen::Matrix< fvar
+< fvar< var >
+ >, Eigen::Dynamic,
+Eigen::Dynamic > 
matrix_ffv
 
typedef Eigen::Matrix< fvar
+< double >, Eigen::Dynamic, 1 > 
vector_fd
 
typedef Eigen::Matrix< fvar
+< var >, Eigen::Dynamic, 1 > 
vector_fv
 
typedef Eigen::Matrix< fvar
+< fvar< double >
+ >, Eigen::Dynamic, 1 > 
vector_ffd
 
typedef Eigen::Matrix< fvar
+< fvar< var >
+ >, Eigen::Dynamic, 1 > 
vector_ffv
 
typedef Eigen::Matrix< fvar
+< double >, 1, Eigen::Dynamic > 
row_vector_fd
 
typedef Eigen::Matrix< fvar
+< var >, 1, Eigen::Dynamic > 
row_vector_fv
 
typedef Eigen::Matrix< fvar
+< fvar< double >
+ >, 1, Eigen::Dynamic > 
row_vector_ffd
 
typedef Eigen::Matrix< fvar
+< fvar< var >
+ >, 1, Eigen::Dynamic > 
row_vector_ffv
 
typedef Eigen::Matrix< var,
+Eigen::Dynamic, Eigen::Dynamic > 
matrix_v
 The type of a matrix holding stan::agrad::var values.
 
typedef Eigen::Matrix< var,
+Eigen::Dynamic, 1 > 
vector_v
 The type of a (column) vector holding stan::agrad::var values.
 
typedef Eigen::Matrix< var,
+1, Eigen::Dynamic > 
row_vector_v
 The type of a row vector holding stan::agrad::var values.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

bool operator== (const var &a, const var &b)
 Equality operator comparing two variables' values (C++).
 
bool operator== (const var &a, const double &b)
 Equality operator comparing a variable's value and a double (C++).
 
bool operator== (const double &a, const var &b)
 Equality operator comparing a scalar and a variable's value (C++).
 
bool operator!= (const var &a, const var &b)
 Inequality operator comparing two variables' values (C++).
 
bool operator!= (const var &a, const double &b)
 Inequality operator comparing a variable's value and a double (C++).
 
bool operator!= (const double &a, const var &b)
 Inequality operator comparing a double and a variable's value (C++).
 
bool operator< (const var &a, const var &b)
 Less than operator comparing variables' values (C++).
 
bool operator< (const var &a, const double &b)
 Less than operator comparing variable's value and a double (C++).
 
bool operator< (const double &a, const var &b)
 Less than operator comparing a double and variable's value (C++).
 
bool operator> (const var &a, const var &b)
 Greater than operator comparing variables' values (C++).
 
bool operator> (const var &a, const double &b)
 Greater than operator comparing variable's value and double (C++).
 
bool operator> (const double &a, const var &b)
 Greater than operator comparing a double and a variable's value (C++).
 
bool operator<= (const var &a, const var &b)
 Less than or equal operator comparing two variables' values (C++).
 
bool operator<= (const var &a, const double &b)
 Less than or equal operator comparing a variable's value and a scalar (C++).
 
bool operator<= (const double &a, const var &b)
 Less than or equal operator comparing a double and variable's value (C++).
 
bool operator>= (const var &a, const var &b)
 Greater than or equal operator comparing two variables' values (C++).
 
bool operator>= (const var &a, const double &b)
 Greater than or equal operator comparing variable's value and double (C++).
 
bool operator>= (const double &a, const var &b)
 Greater than or equal operator comparing double and variable's value (C++).
 
bool operator! (const var &a)
 Prefix logical negation for the value of variables (C++).
 
var operator+ (const var &a)
 Unary plus operator for variables (C++).
 
var operator- (const var &a)
 Unary negation operator for variables (C++).
 
var operator+ (const var &a, const var &b)
 Addition operator for variables (C++).
 
var operator+ (const var &a, const double &b)
 Addition operator for variable and scalar (C++).
 
var operator+ (const double &a, const var &b)
 Addition operator for scalar and variable (C++).
 
var operator- (const var &a, const var &b)
 Subtraction operator for variables (C++).
 
var operator- (const var &a, const double &b)
 Subtraction operator for variable and scalar (C++).
 
var operator- (const double &a, const var &b)
 Subtraction operator for scalar and variable (C++).
 
var operator* (const var &a, const var &b)
 Multiplication operator for two variables (C++).
 
var operator* (const var &a, const double &b)
 Multiplication operator for a variable and a scalar (C++).
 
var operator* (const double &a, const var &b)
 Multiplication operator for a scalar and a variable (C++).
 
var operator/ (const var &a, const var &b)
 Division operator for two variables (C++).
 
var operator/ (const var &a, const double &b)
 Division operator for dividing a variable by a scalar (C++).
 
var operator/ (const double &a, const var &b)
 Division operator for dividing a scalar by a variable (C++).
 
varoperator++ (var &a)
 Prefix increment operator for variables (C++).
 
var operator++ (var &a, int)
 Postfix increment operator for variables (C++).
 
varoperator-- (var &a)
 Prefix decrement operator for variables (C++).
 
var operator-- (var &a, int)
 Postfix decrement operator for variables (C++).
 
var exp (const var &a)
 Return the exponentiation of the specified variable (cmath).
 
var log (const var &a)
 Return the natural log of the specified variable (cmath).
 
var log10 (const var &a)
 Return the base 10 log of the specified variable (cmath).
 
var sqrt (const var &a)
 Return the square root of the specified variable (cmath).
 
var pow (const var &base, const var &exponent)
 Return the base raised to the power of the exponent (cmath).
 
var pow (const var &base, const double &exponent)
 Return the base variable raised to the power of the exponent scalar (cmath).
 
var pow (const double &base, const var &exponent)
 Return the base scalar raised to the power of the exponent variable (cmath).
 
var cos (const var &a)
 Return the cosine of a radian-scaled variable (cmath).
 
var sin (const var &a)
 Return the sine of a radian-scaled variable (cmath).
 
var tan (const var &a)
 Return the tangent of a radian-scaled variable (cmath).
 
var acos (const var &a)
 Return the principal value of the arc cosine of a variable, in radians (cmath).
 
var asin (const var &a)
 Return the principal value of the arc sine, in radians, of the specified variable (cmath).
 
var atan (const var &a)
 Return the principal value of the arc tangent, in radians, of the specified variable (cmath).
 
var atan2 (const var &a, const var &b)
 Return the principal value of the arc tangent, in radians, of the first variable divided by the second (cmath).
 
var atan2 (const var &a, const double &b)
 Return the principal value of the arc tangent, in radians, of the first variable divided by the second scalar (cmath).
 
var atan2 (const double &a, const var &b)
 Return the principal value of the arc tangent, in radians, of the first scalar divided by the second variable (cmath).
 
var cosh (const var &a)
 Return the hyperbolic cosine of the specified variable (cmath).
 
var sinh (const var &a)
 Return the hyperbolic sine of the specified variable (cmath).
 
var tanh (const var &a)
 Return the hyperbolic tangent of the specified variable (cmath).
 
var fabs (const var &a)
 Return the absolute value of the variable (cmath).
 
var floor (const var &a)
 Return the floor of the specified variable (cmath).
 
var ceil (const var &a)
 Return the ceiling of the specified variable (cmath).
 
var fmod (const var &a, const var &b)
 Return the floating point remainder after dividing the first variable by the second (cmath).
 
var fmod (const var &a, const double &b)
 Return the floating point remainder after dividing the the first variable by the second scalar (cmath).
 
var fmod (const double &a, const var &b)
 Return the floating point remainder after dividing the first scalar by the second variable (cmath).
 
var abs (const var &a)
 Return the absolute value of the variable (std).
 
template<typename T , typename F >
void derivative (const F &f, const T &x, T &fx, T &dfx_dx)
 
template<typename T , typename F >
void partial_derivative (const F &f, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, int n, T &fx, T &dfx_dxn)
 
template<typename F >
void gradient (const F &f, const Eigen::Matrix< double, Eigen::Dynamic, 1 > &x, double &fx, Eigen::Matrix< double, Eigen::Dynamic, 1 > &grad_fx)
 Calculate the value and the gradient of the specified function at the specified argument.
 
template<typename T , typename F >
void gradient (const F &f, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, T &fx, Eigen::Matrix< T, Eigen::Dynamic, 1 > &grad_fx)
 
template<typename F >
void jacobian (const F &f, const Eigen::Matrix< double, Eigen::Dynamic, 1 > &x, Eigen::Matrix< double, Eigen::Dynamic, 1 > &fx, Eigen::Matrix< double, Eigen::Dynamic, Eigen::Dynamic > &J)
 
template<typename T , typename F >
void jacobian (const F &f, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, Eigen::Matrix< T, Eigen::Dynamic, 1 > &fx, Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &J)
 
template<typename F >
void hessian (const F &f, const Eigen::Matrix< double, Eigen::Dynamic, 1 > &x, double &fx, Eigen::Matrix< double, Eigen::Dynamic, 1 > &grad, Eigen::Matrix< double, Eigen::Dynamic, Eigen::Dynamic > &H)
 
template<typename T , typename F >
void hessian (const F &f, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, T &fx, Eigen::Matrix< T, Eigen::Dynamic, 1 > &grad, Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &H)
 
template<typename T1 , typename T2 , typename F >
void gradient_dot_vector (const F &f, const Eigen::Matrix< T1, Eigen::Dynamic, 1 > &x, const Eigen::Matrix< T2, Eigen::Dynamic, 1 > &v, T1 &fx, T1 &grad_fx_dot_v)
 
template<typename F >
void hessian_times_vector (const F &f, const Eigen::Matrix< double, Eigen::Dynamic, 1 > &x, const Eigen::Matrix< double, Eigen::Dynamic, 1 > &v, double &fx, Eigen::Matrix< double, Eigen::Dynamic, 1 > &Hv)
 
template<typename T , typename F >
void hessian_times_vector (const F &f, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v, T &fx, Eigen::Matrix< T, Eigen::Dynamic, 1 > &Hv)
 
template<typename F >
void grad_tr_mat_times_hessian (const F &f, const Eigen::Matrix< double, Eigen::Dynamic, 1 > &x, const Eigen::Matrix< double, Eigen::Dynamic, Eigen::Dynamic > &M, Eigen::Matrix< double, Eigen::Dynamic, 1 > &grad_tr_MH)
 
template<typename T >
fvar< T > abs (const fvar< T > &x)
 
template<typename T >
fvar< T > acos (const fvar< T > &x)
 
template<typename T >
fvar< T > acosh (const fvar< T > &x)
 
template<typename T >
fvar< T > asin (const fvar< T > &x)
 
template<typename T >
fvar< T > asinh (const fvar< T > &x)
 
template<typename T >
fvar< T > atan (const fvar< T > &x)
 
template<typename T >
fvar< T > atan2 (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > atan2 (const double x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > atan2 (const fvar< T > &x1, const double x2)
 
template<typename T >
fvar< T > atanh (const fvar< T > &x)
 
template<typename T >
fvar< T > bessel_first_kind (int v, const fvar< T > &z)
 
template<typename T >
fvar< T > bessel_second_kind (int v, const fvar< T > &z)
 
template<typename T >
fvar< T > binary_log_loss (const int y, const fvar< T > &y_hat)
 
template<typename T >
fvar< T > binomial_coefficient_log (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > binomial_coefficient_log (const fvar< T > &x1, const double x2)
 
template<typename T >
fvar< T > binomial_coefficient_log (const double x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > cbrt (const fvar< T > &x)
 
template<typename T >
fvar< T > ceil (const fvar< T > &x)
 
template<typename T >
fvar< T > cos (const fvar< T > &x)
 
template<typename T >
fvar< T > cosh (const fvar< T > &x)
 
template<typename T >
fvar< T > digamma (const fvar< T > &x)
 
template<typename T >
fvar< T > erf (const fvar< T > &x)
 
template<typename T >
fvar< T > erfc (const fvar< T > &x)
 
template<typename T >
fvar< T > exp (const fvar< T > &x)
 
template<typename T >
fvar< T > exp2 (const fvar< T > &x)
 
template<typename T >
fvar< T > expm1 (const fvar< T > &x)
 
template<typename T >
fvar< T > fabs (const fvar< T > &x)
 
template<typename T >
fvar< T > falling_factorial (const fvar< T > &x, const fvar< T > &n)
 
template<typename T >
fvar< T > falling_factorial (const fvar< T > &x, const double n)
 
template<typename T >
fvar< T > falling_factorial (const double x, const fvar< T > &n)
 
template<typename T >
fvar< T > fdim (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > fdim (const fvar< T > &x1, const double x2)
 
template<typename T >
fvar< T > fdim (const double x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > floor (const fvar< T > &x)
 
template<typename T1 , typename T2 , typename T3 >
fvar< typename
+stan::return_type< T1, T2, T3 >
+::type > 
fma (const fvar< T1 > &x1, const fvar< T2 > &x2, const fvar< T3 > &x3)
 
template<typename T1 , typename T2 , typename T3 >
fvar< typename
+stan::return_type< T1, T2, T3 >
+::type > 
fma (const T1 &x1, const fvar< T2 > &x2, const fvar< T3 > &x3)
 
template<typename T1 , typename T2 , typename T3 >
fvar< typename
+stan::return_type< T1, T2, T3 >
+::type > 
fma (const fvar< T1 > &x1, const T2 &x2, const fvar< T3 > &x3)
 
template<typename T1 , typename T2 , typename T3 >
fvar< typename
+stan::return_type< T1, T2, T3 >
+::type > 
fma (const fvar< T1 > &x1, const fvar< T2 > &x2, const T3 &x3)
 
template<typename T1 , typename T2 , typename T3 >
fvar< typename
+stan::return_type< T1, T2, T3 >
+::type > 
fma (const T1 &x1, const T2 &x2, const fvar< T3 > &x3)
 
template<typename T1 , typename T2 , typename T3 >
fvar< typename
+stan::return_type< T1, T2, T3 >
+::type > 
fma (const fvar< T1 > &x1, const T2 &x2, const T3 &x3)
 
template<typename T1 , typename T2 , typename T3 >
fvar< typename
+stan::return_type< T1, T2, T3 >
+::type > 
fma (const T1 &x1, const fvar< T2 > &x2, const T3 &x3)
 
template<typename T >
fvar< T > fmax (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > fmax (const double x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > fmax (const fvar< T > &x1, const double x2)
 
template<typename T >
fvar< T > fmin (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > fmin (const double x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > fmin (const fvar< T > &x1, const double x2)
 
template<typename T >
fvar< T > fmod (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > fmod (const fvar< T > &x1, const double x2)
 
template<typename T >
fvar< T > fmod (const double x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > gamma_p (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > gamma_p (const fvar< T > &x1, const double x2)
 
template<typename T >
fvar< T > gamma_p (const double x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > gamma_q (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > gamma_q (const fvar< T > &x1, const double x2)
 
template<typename T >
fvar< T > gamma_q (const double x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > hypot (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > hypot (const fvar< T > &x1, const double x2)
 
template<typename T >
fvar< T > hypot (const double x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > inv (const fvar< T > &x)
 
template<typename T >
fvar< T > inv_cloglog (const fvar< T > &x)
 
template<typename T >
fvar< T > inv_logit (const fvar< T > &x)
 
template<typename T >
fvar< T > inv_sqrt (const fvar< T > &x)
 
template<typename T >
fvar< T > inv_square (const fvar< T > &x)
 
template<typename T >
fvar< T > lbeta (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > lbeta (const double x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > lbeta (const fvar< T > &x1, const double x2)
 
template<typename T >
fvar< T > lgamma (const fvar< T > &x)
 
template<typename T >
fvar< typename
+stan::return_type< T, int >
+::type > 
lmgamma (int x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > log (const fvar< T > &x)
 
template<typename T >
fvar< T > log10 (const fvar< T > &x)
 
template<typename T >
fvar< T > log1m (const fvar< T > &x)
 
template<typename T >
fvar< T > log1m_exp (const fvar< T > &x)
 
template<typename T >
fvar< T > log1m_inv_logit (const fvar< T > &x)
 
template<typename T >
fvar< T > log1p (const fvar< T > &x)
 
template<typename T >
fvar< T > log1p_exp (const fvar< T > &x)
 
template<typename T >
fvar< T > log2 (const fvar< T > &x)
 
template<typename T >
fvar< T > log_diff_exp (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T1 , typename T2 >
fvar< T2 > log_diff_exp (const T1 &x1, const fvar< T2 > &x2)
 
template<typename T1 , typename T2 >
fvar< T1 > log_diff_exp (const fvar< T1 > &x1, const T2 &x2)
 
template<typename T >
fvar< T > log_falling_factorial (const fvar< T > &x, const fvar< T > &n)
 
template<typename T >
fvar< T > log_falling_factorial (const double x, const fvar< T > &n)
 
template<typename T >
fvar< T > log_falling_factorial (const fvar< T > &x, const double n)
 
template<typename T >
fvar< T > log_inv_logit (const fvar< T > &x)
 
template<typename T >
fvar< T > log_rising_factorial (const fvar< T > &x, const fvar< T > &n)
 
template<typename T >
fvar< T > log_rising_factorial (const fvar< T > &x, const double n)
 
template<typename T >
fvar< T > log_rising_factorial (const double x, const fvar< T > &n)
 
template<typename T >
fvar< T > log_sum_exp (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > log_sum_exp (const double x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > log_sum_exp (const fvar< T > &x1, const double x2)
 
template<typename T >
fvar< T > log_sum_exp (const std::vector< fvar< T > > &v)
 
template<typename T >
fvar< T > logit (const fvar< T > &x)
 
template<typename T >
fvar< T > modified_bessel_first_kind (int v, const fvar< T > &z)
 
template<typename T >
fvar< T > modified_bessel_second_kind (int v, const fvar< T > &z)
 
template<typename T >
fvar< T > multiply_log (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > multiply_log (const double x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > multiply_log (const fvar< T > &x1, const double x2)
 
template<typename T >
fvar< T > owens_t (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > owens_t (const double x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > owens_t (const fvar< T > &x1, const double x2)
 
template<typename T >
fvar< T > Phi (const fvar< T > &x)
 
template<typename T >
fvar< T > pow (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > pow (const double x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > pow (const fvar< T > &x1, const double x2)
 
template<typename T >
fvar< T > rising_factorial (const fvar< T > &x, const fvar< T > &n)
 
template<typename T >
fvar< T > rising_factorial (const fvar< T > &x, const double n)
 
template<typename T >
fvar< T > rising_factorial (const double x, const fvar< T > &n)
 
template<typename T >
fvar< T > round (const fvar< T > &x)
 
template<typename T >
fvar< T > sin (const fvar< T > &x)
 
template<typename T >
fvar< T > sinh (const fvar< T > &x)
 
template<typename T >
fvar< T > sqrt (const fvar< T > &x)
 
template<typename T >
fvar< T > square (const fvar< T > &x)
 
template<typename T >
fvar< T > tan (const fvar< T > &x)
 
template<typename T >
fvar< T > tanh (const fvar< T > &x)
 
template<typename T >
fvar< T > tgamma (const fvar< T > &x)
 
template<typename T >
fvar< T > trunc (const fvar< T > &x)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, 1, C1 > columns_dot_product (const Eigen::Matrix< fvar< T >, R1, C1 > &v1, const Eigen::Matrix< fvar< T >, R2, C2 > &v2)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, 1, C1 > columns_dot_product (const Eigen::Matrix< fvar< T >, R1, C1 > &v1, const Eigen::Matrix< double, R2, C2 > &v2)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, 1, C1 > columns_dot_product (const Eigen::Matrix< double, R1, C1 > &v1, const Eigen::Matrix< fvar< T >, R2, C2 > &v2)
 
template<typename T , int R, int C>
Eigen::Matrix< fvar< T >, 1, C > columns_dot_self (const Eigen::Matrix< fvar< T >, R, C > &x)
 
template<typename T , int R, int C>
Eigen::Matrix< fvar< T >, C, C > crossprod (const Eigen::Matrix< fvar< T >, R, C > &m)
 
template<typename T , int R, int C>
fvar< T > determinant (const Eigen::Matrix< fvar< T >, R, C > &m)
 
template<typename T1 , typename T2 >
stan::return_type< T1, T2 >::type divide (const T1 &v, const T2 &c)
 
template<typename T , int R, int C>
Eigen::Matrix< fvar< T >, R, C > divide (const Eigen::Matrix< fvar< T >, R, C > &v, const fvar< T > &c)
 
template<typename T , int R, int C>
Eigen::Matrix< fvar< T >, R, C > divide (const Eigen::Matrix< fvar< T >, R, C > &v, const double c)
 
template<typename T , int R, int C>
Eigen::Matrix< fvar< T >, R, C > divide (const Eigen::Matrix< double, R, C > &v, const fvar< T > &c)
 
template<typename T , int R, int C>
Eigen::Matrix< fvar< T >, R, C > operator/ (const Eigen::Matrix< fvar< T >, R, C > &v, const fvar< T > &c)
 
template<typename T , int R, int C>
Eigen::Matrix< fvar< T >, R, C > operator/ (const Eigen::Matrix< fvar< T >, R, C > &v, const double c)
 
template<typename T , int R, int C>
Eigen::Matrix< fvar< T >, R, C > operator/ (const Eigen::Matrix< double, R, C > &v, const fvar< T > &c)
 
template<typename T , int R1, int C1, int R2, int C2>
fvar< T > dot_product (const Eigen::Matrix< fvar< T >, R1, C1 > &v1, const Eigen::Matrix< fvar< T >, R2, C2 > &v2)
 
template<typename T , int R1, int C1, int R2, int C2>
fvar< T > dot_product (const Eigen::Matrix< fvar< T >, R1, C1 > &v1, const Eigen::Matrix< double, R2, C2 > &v2)
 
template<typename T , int R1, int C1, int R2, int C2>
fvar< T > dot_product (const Eigen::Matrix< double, R1, C1 > &v1, const Eigen::Matrix< fvar< T >, R2, C2 > &v2)
 
template<typename T , int R1, int C1, int R2, int C2>
fvar< T > dot_product (const Eigen::Matrix< fvar< T >, R1, C1 > &v1, const Eigen::Matrix< fvar< T >, R2, C2 > &v2, size_type &length)
 
template<typename T , int R1, int C1, int R2, int C2>
fvar< T > dot_product (const Eigen::Matrix< fvar< T >, R1, C1 > &v1, const Eigen::Matrix< double, R2, C2 > &v2, size_type &length)
 
template<typename T , int R1, int C1, int R2, int C2>
fvar< T > dot_product (const Eigen::Matrix< double, R1, C1 > &v1, const Eigen::Matrix< fvar< T >, R2, C2 > &v2, size_type &length)
 
template<typename T >
fvar< T > dot_product (const std::vector< fvar< T > > &v1, const std::vector< fvar< T > > &v2)
 
template<typename T >
fvar< T > dot_product (const std::vector< double > &v1, const std::vector< fvar< T > > &v2)
 
template<typename T >
fvar< T > dot_product (const std::vector< fvar< T > > &v1, const std::vector< double > &v2)
 
template<typename T >
fvar< T > dot_product (const std::vector< fvar< T > > &v1, const std::vector< fvar< T > > &v2, size_type &length)
 
template<typename T >
fvar< T > dot_product (const std::vector< double > &v1, const std::vector< fvar< T > > &v2, size_type &length)
 
template<typename T >
fvar< T > dot_product (const std::vector< fvar< T > > &v1, const std::vector< double > &v2, size_type &length)
 
template<typename T , int R, int C>
fvar< T > dot_self (const Eigen::Matrix< fvar< T >, R, C > &v)
 
template<typename T , int R, int C>
Eigen::Matrix< fvar< T >, R, C > inverse (const Eigen::Matrix< fvar< T >, R, C > &m)
 
template<typename T , int R, int C>
fvar< T > log_determinant (const Eigen::Matrix< fvar< T >, R, C > &m)
 
template<typename T >
Eigen::Matrix< fvar< T >
+, Eigen::Dynamic, 1 > 
log_softmax (const Eigen::Matrix< fvar< T >, Eigen::Dynamic, 1 > &alpha)
 
template<typename T , int R, int C>
fvar< T > log_sum_exp (const Eigen::Matrix< fvar< T >, R, C > &v)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, C2 > mdivide_left (const Eigen::Matrix< fvar< T >, R1, C1 > &A, const Eigen::Matrix< fvar< T >, R2, C2 > &b)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, C2 > mdivide_left (const Eigen::Matrix< double, R1, C1 > &A, const Eigen::Matrix< fvar< T >, R2, C2 > &b)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, C2 > mdivide_left (const Eigen::Matrix< fvar< T >, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, C1 > mdivide_left_tri_low (const Eigen::Matrix< fvar< T >, R1, C1 > &A, const Eigen::Matrix< fvar< T >, R2, C2 > &b)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, C1 > mdivide_left_tri_low (const Eigen::Matrix< double, R1, C1 > &A, const Eigen::Matrix< fvar< T >, R2, C2 > &b)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, C1 > mdivide_left_tri_low (const Eigen::Matrix< fvar< T >, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, C2 > mdivide_right (const Eigen::Matrix< fvar< T >, R1, C1 > &A, const Eigen::Matrix< fvar< T >, R2, C2 > &b)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, C2 > mdivide_right (const Eigen::Matrix< fvar< T >, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, C2 > mdivide_right (const Eigen::Matrix< double, R1, C1 > &A, const Eigen::Matrix< fvar< T >, R2, C2 > &b)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, C1 > mdivide_right_tri_low (const Eigen::Matrix< fvar< T >, R1, C1 > &A, const Eigen::Matrix< fvar< T >, R2, C2 > &b)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, C2 > mdivide_right_tri_low (const Eigen::Matrix< fvar< T >, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, C2 > mdivide_right_tri_low (const Eigen::Matrix< double, R1, C1 > &A, const Eigen::Matrix< fvar< T >, R2, C2 > &b)
 
template<typename T , int R1, int C1>
Eigen::Matrix< fvar< T >, R1, C1 > multiply (const Eigen::Matrix< fvar< T >, R1, C1 > &m, const fvar< T > &c)
 
template<typename T , int R2, int C2>
Eigen::Matrix< fvar< T >, R2, C2 > multiply (const Eigen::Matrix< fvar< T >, R2, C2 > &m, const double c)
 
template<typename T , int R1, int C1>
Eigen::Matrix< fvar< T >, R1, C1 > multiply (const Eigen::Matrix< double, R1, C1 > &m, const fvar< T > &c)
 
template<typename T , int R1, int C1>
Eigen::Matrix< fvar< T >, R1, C1 > multiply (const fvar< T > &c, const Eigen::Matrix< fvar< T >, R1, C1 > &m)
 
template<typename T , int R1, int C1>
Eigen::Matrix< fvar< T >, R1, C1 > multiply (const double c, const Eigen::Matrix< fvar< T >, R1, C1 > &m)
 
template<typename T , int R1, int C1>
Eigen::Matrix< fvar< T >, R1, C1 > multiply (const fvar< T > &c, const Eigen::Matrix< double, R1, C1 > &m)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, C2 > multiply (const Eigen::Matrix< fvar< T >, R1, C1 > &m1, const Eigen::Matrix< fvar< T >, R2, C2 > &m2)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, C2 > multiply (const Eigen::Matrix< fvar< T >, R1, C1 > &m1, const Eigen::Matrix< double, R2, C2 > &m2)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, C2 > multiply (const Eigen::Matrix< double, R1, C1 > &m1, const Eigen::Matrix< fvar< T >, R2, C2 > &m2)
 
template<typename T , int C1, int R2>
fvar< T > multiply (const Eigen::Matrix< fvar< T >, 1, C1 > &rv, const Eigen::Matrix< fvar< T >, R2, 1 > &v)
 
template<typename T , int C1, int R2>
fvar< T > multiply (const Eigen::Matrix< fvar< T >, 1, C1 > &rv, const Eigen::Matrix< double, R2, 1 > &v)
 
template<typename T , int C1, int R2>
fvar< T > multiply (const Eigen::Matrix< double, 1, C1 > &rv, const Eigen::Matrix< fvar< T >, R2, 1 > &v)
 
template<typename T , int R, int C>
Eigen::Matrix< fvar< T >, R, R > multiply_lower_tri_self_transpose (const Eigen::Matrix< fvar< T >, R, C > &m)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, 1 > rows_dot_product (const Eigen::Matrix< fvar< T >, R1, C1 > &v1, const Eigen::Matrix< fvar< T >, R2, C2 > &v2)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, 1 > rows_dot_product (const Eigen::Matrix< double, R1, C1 > &v1, const Eigen::Matrix< fvar< T >, R2, C2 > &v2)
 
template<typename T , int R1, int C1, int R2, int C2>
Eigen::Matrix< fvar< T >, R1, 1 > rows_dot_product (const Eigen::Matrix< fvar< T >, R1, C1 > &v1, const Eigen::Matrix< double, R2, C2 > &v2)
 
template<typename T , int R, int C>
Eigen::Matrix< fvar< T >, R, 1 > rows_dot_self (const Eigen::Matrix< fvar< T >, R, C > &x)
 
template<typename T >
Eigen::Matrix< fvar< T >
+, Eigen::Dynamic, 1 > 
softmax (const Eigen::Matrix< fvar< T >, Eigen::Dynamic, 1 > &alpha)
 
template<typename T >
std::vector< fvar< T > > sort_asc (std::vector< fvar< T > > xs)
 
template<typename T >
std::vector< fvar< T > > sort_desc (std::vector< fvar< T > > xs)
 
template<typename T , int R, int C>
Eigen::Matrix< fvar< T >, R, C > sort_asc (Eigen::Matrix< fvar< T >, R, C > xs)
 
template<typename T , int R, int C>
Eigen::Matrix< fvar< T >, R, C > sort_desc (Eigen::Matrix< fvar< T >, R, C > xs)
 
template<typename T , int R, int C>
fvar< T > sum (const Eigen::Matrix< fvar< T >, R, C > &m)
 
template<typename T , int R, int C>
Eigen::Matrix< fvar< T >, R, R > tcrossprod (const Eigen::Matrix< fvar< T >, R, C > &m)
 
template<typename T >
fvar< T > to_fvar (const T &x)
 
template<typename T >
fvar< T > to_fvar (const fvar< T > &x)
 
matrix_fd to_fvar (const stan::math::matrix_d &m)
 
matrix_fd to_fvar (const matrix_fd &m)
 
matrix_fv to_fvar (const matrix_fv &m)
 
matrix_ffd to_fvar (const matrix_ffd &m)
 
matrix_ffv to_fvar (const matrix_ffv &m)
 
vector_fd to_fvar (const stan::math::vector_d &v)
 
vector_fd to_fvar (const vector_fd &v)
 
vector_fv to_fvar (const vector_fv &v)
 
vector_ffd to_fvar (const vector_ffd &v)
 
vector_ffv to_fvar (const vector_ffv &v)
 
row_vector_fd to_fvar (const stan::math::row_vector_d &rv)
 
row_vector_fd to_fvar (const row_vector_fd &rv)
 
row_vector_fv to_fvar (const row_vector_fv &rv)
 
row_vector_ffd to_fvar (const row_vector_ffd &rv)
 
row_vector_ffv to_fvar (const row_vector_ffv &rv)
 
template<typename T , int R, int C>
Eigen::Matrix< fvar< T >, R, C > to_fvar (const Eigen::Matrix< T, R, C > &val, const Eigen::Matrix< T, R, C > &deriv)
 
template<typename T >
fvar< T > operator+ (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > operator+ (const double x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > operator+ (const fvar< T > &x1, const double x2)
 
template<typename T >
fvar< T > operator/ (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > operator/ (const fvar< T > &x1, const double x2)
 
template<typename T >
fvar< T > operator/ (const double x1, const fvar< T > &x2)
 
template<typename T >
bool operator== (const fvar< T > &x, const fvar< T > &y)
 
template<typename T >
bool operator== (const fvar< T > &x, double y)
 
template<typename T >
bool operator== (double x, const fvar< T > &y)
 
template<typename T >
bool operator> (const fvar< T > &x, const fvar< T > &y)
 
template<typename T >
bool operator> (const fvar< T > &x, double y)
 
template<typename T >
bool operator> (double x, const fvar< T > &y)
 
template<typename T >
bool operator>= (const fvar< T > &x, const fvar< T > &y)
 
template<typename T >
bool operator>= (const fvar< T > &x, double y)
 
template<typename T >
bool operator>= (double x, const fvar< T > &y)
 
template<typename T >
bool operator< (const fvar< T > &x, double y)
 
template<typename T >
bool operator< (double x, const fvar< T > &y)
 
template<typename T >
bool operator< (const fvar< T > &x, const fvar< T > &y)
 
template<typename T >
bool operator<= (const fvar< T > &x, const fvar< T > &y)
 
template<typename T >
bool operator<= (const fvar< T > &x, double y)
 
template<typename T >
bool operator<= (double x, const fvar< T > &y)
 
template<typename T >
fvar< T > operator* (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > operator* (const double x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > operator* (const fvar< T > &x1, const double x2)
 
template<typename T >
bool operator!= (const fvar< T > &x, const fvar< T > &y)
 
template<typename T >
bool operator!= (const fvar< T > &x, double y)
 
template<typename T >
bool operator!= (double x, const fvar< T > &y)
 
template<typename T >
fvar< T > operator- (const fvar< T > &x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > operator- (const double x1, const fvar< T > &x2)
 
template<typename T >
fvar< T > operator- (const fvar< T > &x1, const double x2)
 
template<typename T >
fvar< T > operator- (const fvar< T > &x)
 
template<class F >
double hessian (const F &f, const std::vector< double > &x, const std::vector< double > &v, std::vector< double > &Hv)
 
double calculate_chain (const double &x, const double &val)
 
static void set_zero_all_adjoints ()
 Reset all adjoint values in the stack to zero.
 
static void grad (chainable *vi)
 Compute the gradient for all variables starting from the specified root variable implementation.
 
template<typename T_result , class Policy >
bool check_pos_definite (const char *function, const Eigen::Matrix< var, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result, const Policy &)
 
var acosh (const stan::agrad::var &a)
 The inverse hyperbolic cosine function for variables (C99).
 
int as_bool (const agrad::var &v)
 Return 1 if the argument is unequal to zero and 0 otherwise.
 
var asinh (const stan::agrad::var &a)
 The inverse hyperbolic sine function for variables (C99).
 
var atan2 (const var &a, const double b)
 Return the principal value of the arc tangent, in radians, of the first variable divided by the second scalar (cmath).
 
var atan2 (const double a, const var &b)
 Return the principal value of the arc tangent, in radians, of the first scalar divided by the second variable (cmath).
 
var atanh (const stan::agrad::var &a)
 The inverse hyperbolic tangent function for variables (C99).
 
var bessel_first_kind (const int &v, const var &a)
 
var bessel_second_kind (const int &v, const var &a)
 
var binary_log_loss (const int y, const stan::agrad::var &y_hat)
 The log loss function for variables (stan).
 
var cbrt (const stan::agrad::var &a)
 Returns the cube root of the specified variable (C99).
 
var digamma (const stan::agrad::var &a)
 
var erf (const stan::agrad::var &a)
 The error function for variables (C99).
 
var erfc (const stan::agrad::var &a)
 The complementary error function for variables (C99).
 
var exp2 (const stan::agrad::var &a)
 Exponentiation base 2 function for variables (C99).
 
var expm1 (const stan::agrad::var &a)
 The exponentiation of the specified variable minus 1 (C99).
 
var falling_factorial (const var &a, const double &b)
 
var falling_factorial (const var &a, const var &b)
 
var falling_factorial (const double &a, const var &b)
 
var fdim (const stan::agrad::var &a, const stan::agrad::var &b)
 Return the positive difference between the first variable's the value and the second's (C99).
 
var fdim (const double &a, const stan::agrad::var &b)
 Return the positive difference between the first value and the value of the second variable (C99).
 
var fdim (const stan::agrad::var &a, const double &b)
 Return the positive difference between the first variable's value and the second value (C99).
 
var fma (const stan::agrad::var &a, const stan::agrad::var &b, const stan::agrad::var &c)
 The fused multiply-add function for three variables (C99).
 
var fma (const stan::agrad::var &a, const stan::agrad::var &b, const double &c)
 The fused multiply-add function for two variables and a value (C99).
 
var fma (const stan::agrad::var &a, const double &b, const stan::agrad::var &c)
 The fused multiply-add function for a variable, value, and variable (C99).
 
var fma (const stan::agrad::var &a, const double &b, const double &c)
 The fused multiply-add function for a variable and two values (C99).
 
var fma (const double &a, const stan::agrad::var &b, const double &c)
 The fused multiply-add function for a value, variable, and value (C99).
 
var fma (const double &a, const double &b, const stan::agrad::var &c)
 The fused multiply-add function for two values and a variable, and value (C99).
 
var fma (const double &a, const stan::agrad::var &b, const stan::agrad::var &c)
 The fused multiply-add function for a value and two variables (C99).
 
var fmax (const stan::agrad::var &a, const stan::agrad::var &b)
 Returns the maximum of the two variable arguments (C99).
 
var fmax (const stan::agrad::var &a, const double &b)
 Returns the maximum of the variable and scalar, promoting the scalar to a variable if it is larger (C99).
 
var fmax (const double &a, const stan::agrad::var &b)
 Returns the maximum of a scalar and variable, promoting the scalar to a variable if it is larger (C99).
 
var fmin (const stan::agrad::var &a, const stan::agrad::var &b)
 Returns the minimum of the two variable arguments (C99).
 
var fmin (const stan::agrad::var &a, const double &b)
 Returns the minimum of the variable and scalar, promoting the scalar to a variable if it is larger (C99).
 
var fmin (const double &a, const stan::agrad::var &b)
 Returns the minimum of a scalar and variable, promoting the scalar to a variable if it is larger (C99).
 
var fmod (const var &a, const double b)
 Return the floating point remainder after dividing the the first variable by the second scalar (cmath).
 
var fmod (const double a, const var &b)
 Return the floating point remainder after dividing the first scalar by the second variable (cmath).
 
var gamma_p (const stan::agrad::var &a, const stan::agrad::var &b)
 
var gamma_p (const stan::agrad::var &a, const double &b)
 
var gamma_p (const double &a, const stan::agrad::var &b)
 
var gamma_q (const stan::agrad::var &a, const stan::agrad::var &b)
 
var gamma_q (const stan::agrad::var &a, const double &b)
 
var gamma_q (const double &a, const stan::agrad::var &b)
 
var hypot (const stan::agrad::var &a, const stan::agrad::var &b)
 Returns the length of the hypoteneuse of a right triangle with sides of the specified lengths (C99).
 
var hypot (const stan::agrad::var &a, const double &b)
 Returns the length of the hypoteneuse of a right triangle with sides of the specified lengths (C99).
 
var hypot (const double &a, const stan::agrad::var &b)
 Returns the length of the hypoteneuse of a right triangle with sides of the specified lengths (C99).
 
var ibeta (const var &a, const var &b, const var &x)
 The normalized incomplete beta function of a, b, and x.
 
var if_else (bool c, const var &y_true, const var &y_false)
 If the specified condition is true, return the first variable, otherwise return the second variable.
 
var if_else (bool c, double y_true, const var &y_false)
 If the specified condition is true, return a new variable constructed from the first scalar, otherwise return the second variable.
 
var if_else (bool c, const var &y_true, const double y_false)
 If the specified condition is true, return the first variable, otherwise return a new variable constructed from the second scalar.
 
var inv (const var &a)
 
var inv_cloglog (const stan::agrad::var &a)
 Return the inverse complementary log-log function applied specified variable (stan).
 
var inv_logit (const stan::agrad::var &a)
 The inverse logit function for variables (stan).
 
var inv_sqrt (const var &a)
 
var inv_square (const var &a)
 
bool is_uninitialized (var x)
 Returns true if the specified variable is uninitialized.
 
var lgamma (const stan::agrad::var &a)
 The log gamma function for variables (C99).
 
var lmgamma (int a, const stan::agrad::var &b)
 
var log1m (const stan::agrad::var &a)
 The log (1 - x) function for variables.
 
var log1m_exp (const stan::agrad::var &a)
 Return the log of 1 minus the exponential of the specified variable.
 
var log1p (const stan::agrad::var &a)
 The log (1 + x) function for variables (C99).
 
var log1p_exp (const stan::agrad::var &a)
 Return the log of 1 plus the exponential of the specified variable.
 
var log2 (const stan::agrad::var &a)
 Returns the base 2 logarithm of the specified variable (C99).
 
var log_diff_exp (const stan::agrad::var &a, const stan::agrad::var &b)
 Returns the log sum of exponentials.
 
var log_diff_exp (const stan::agrad::var &a, const double &b)
 Returns the log sum of exponentials.
 
var log_diff_exp (const double &a, const stan::agrad::var &b)
 Returns the log sum of exponentials.
 
var log_falling_factorial (const var &a, const double &b)
 
var log_falling_factorial (const var &a, const var &b)
 
var log_falling_factorial (const double &a, const var &b)
 
var log_rising_factorial (const var &a, const double &b)
 
var log_rising_factorial (const var &a, const var &b)
 
var log_rising_factorial (const double &a, const var &b)
 
var log_sum_exp (const stan::agrad::var &a, const stan::agrad::var &b)
 Returns the log sum of exponentials.
 
var log_sum_exp (const stan::agrad::var &a, const double &b)
 Returns the log sum of exponentials.
 
var log_sum_exp (const double &a, const stan::agrad::var &b)
 Returns the log sum of exponentials.
 
var log_sum_exp (const std::vector< var > &x)
 Returns the log sum of exponentials.
 
var modified_bessel_first_kind (const int &v, const var &a)
 
var modified_bessel_second_kind (const int &v, const var &a)
 
var multiply_log (const var &a, const var &b)
 Return the value of a*log(b).
 
var multiply_log (const var &a, const double b)
 Return the value of a*log(b).
 
var multiply_log (const double a, const var &b)
 Return the value of a*log(b).
 
var owens_t (const var &h, const var &a)
 The Owen's T function of h and a.
 
var owens_t (const var &h, const double &a)
 The Owen's T function of h and a.
 
var owens_t (const double &h, const var &a)
 The Owen's T function of h and a.
 
var Phi (const stan::agrad::var &a)
 The unit normal cumulative density function for variables (stan).
 
var Phi_approx (const stan::agrad::var &a)
 Approximation of the unit normal CDF for variables (stan).
 
var pow (const var &base, const double exponent)
 Return the base variable raised to the power of the exponent scalar (cmath).
 
var pow (const double base, const var &exponent)
 Return the base scalar raised to the power of the exponent variable (cmath).
 
var rising_factorial (const var &a, const double &b)
 
var rising_factorial (const var &a, const var &b)
 
var rising_factorial (const double &a, const var &b)
 
var round (const stan::agrad::var &a)
 Returns the rounded form of the specified variable (C99).
 
var square (const var &x)
 Return the square of the input variable.
 
var step (const stan::agrad::var &a)
 Return the step, or heaviside, function applied to the specified variable (stan).
 
var tgamma (const stan::agrad::var &a)
 Return the Gamma function applied to the specified variable (C99).
 
var trunc (const stan::agrad::var &a)
 Returns the truncatation of the specified variable (C99).
 
double value_of (const agrad::var &v)
 Return the value of the specified variable.
 
void jacobian (std::vector< var > &dependents, std::vector< var > &independents, std::vector< std::vector< double > > &jacobian)
 Return the Jacobian of the function producing the specified dependent variables with respect to the specified independent variables.
 
matrix_v crossprod (const matrix_v &M)
 Returns the result of pre-multiplying a matrix by its own transpose.
 
template<int R, int C>
var determinant (const Eigen::Matrix< var, R, C > &m)
 
double divide (double x, double y)
 Return the division of the first scalar by the second scalar.
 
template<typename T1 , typename T2 , int R, int C>
Eigen::Matrix< var, R, C > divide (const Eigen::Matrix< T1, R, C > &v, const T2 &c)
 Return the division of the specified column vector by the specified scalar.
 
template<typename T1 , int R1, int C1, typename T2 , int R2, int C2>
boost::enable_if_c
+< boost::is_same< T1, var >
+::value||boost::is_same< T2,
+var >::value, var >::type 
dot_product (const Eigen::Matrix< T1, R1, C1 > &v1, const Eigen::Matrix< T2, R2, C2 > &v2)
 Returns the dot product.
 
template<typename T1 , typename T2 >
boost::enable_if_c
+< boost::is_same< T1, var >
+::value||boost::is_same< T2,
+var >::value, var >::type 
dot_product (const T1 *v1, const T2 *v2, size_t length)
 Returns the dot product.
 
template<typename T1 , typename T2 >
boost::enable_if_c
+< boost::is_same< T1, var >
+::value||boost::is_same< T2,
+var >::value, var >::type 
dot_product (const std::vector< T1 > &v1, const std::vector< T2 > &v2)
 Returns the dot product.
 
template<typename T1 , int R1, int C1, typename T2 , int R2, int C2>
boost::enable_if_c
+< boost::is_same< T1, var >
+::value||boost::is_same< T2,
+var >::value, Eigen::Matrix
+< var, 1, C1 > >::type 
columns_dot_product (const Eigen::Matrix< T1, R1, C1 > &v1, const Eigen::Matrix< T2, R2, C2 > &v2)
 
template<typename T1 , int R1, int C1, typename T2 , int R2, int C2>
boost::enable_if_c
+< boost::is_same< T1, var >
+::value||boost::is_same< T2,
+var >::value, Eigen::Matrix
+< var, R1, 1 > >::type 
rows_dot_product (const Eigen::Matrix< T1, R1, C1 > &v1, const Eigen::Matrix< T2, R2, C2 > &v2)
 
template<int R, int C>
var dot_self (const Eigen::Matrix< var, R, C > &v)
 Returns the dot product of a vector with itself.
 
template<int R, int C>
Eigen::Matrix< var, 1, C > columns_dot_self (const Eigen::Matrix< var, R, C > &x)
 Returns the dot product of each column of a matrix with itself.
 
void grad (var &v, Eigen::Matrix< var, Eigen::Dynamic, 1 > &x, Eigen::VectorXd &g)
 
void initialize_variable (var &variable, const var &value)
 Initialize variable to value.
 
template<int R, int C>
void initialize_variable (Eigen::Matrix< var, R, C > &matrix, const var &value)
 Initialize every cell in the matrix to the specified value.
 
template<typename T >
void initialize_variable (std::vector< T > &variables, const var &value)
 Initialize the variables in the standard vector recursively.
 
template<int R, int C>
var log_determinant_ldlt (stan::math::LDLT_factor< var, R, C > &A)
 
template<int R1, int C1, int R2, int C2>
Eigen::Matrix< var, R1, C2 > mdivide_left_ldlt (const stan::math::LDLT_factor< var, R1, C1 > &A, const Eigen::Matrix< var, R2, C2 > &b)
 
template<int R1, int C1, int R2, int C2>
Eigen::Matrix< var, R1, C2 > mdivide_left_ldlt (const stan::math::LDLT_factor< var, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)
 
template<int R1, int C1, int R2, int C2>
Eigen::Matrix< var, R1, C2 > mdivide_left_ldlt (const stan::math::LDLT_factor< double, R1, C1 > &A, const Eigen::Matrix< var, R2, C2 > &b)
 
template<typename T1 , int R1, int C1, typename T2 , int R2, int C2, typename T3 , int R3, int C3>
boost::enable_if_c
+< boost::is_same< T1, var >
+::value||boost::is_same< T2,
+var >::value||boost::is_same
+< T3, var >::value, var >
+::type 
trace_inv_quad_form_ldlt (const Eigen::Matrix< T1, R1, C1 > &D, const stan::math::LDLT_factor< T2, R2, C2 > &A, const Eigen::Matrix< T3, R3, C3 > &B)
 Compute the trace of an inverse quadratic form.
 
template<typename T2 , int R2, int C2, typename T3 , int R3, int C3>
boost::enable_if_c
+< boost::is_same< T2, var >
+::value||boost::is_same< T3,
+var >::value, var >::type 
trace_inv_quad_form_ldlt (const stan::math::LDLT_factor< T2, R2, C2 > &A, const Eigen::Matrix< T3, R3, C3 > &B)
 Compute the trace of an inverse quadratic form.
 
template<int R, int C>
var log_determinant (const Eigen::Matrix< var, R, C > &m)
 
template<int R, int C>
var log_determinant_spd (const Eigen::Matrix< var, R, C > &m)
 
Eigen::Matrix< var,
+Eigen::Dynamic, 1 > 
log_softmax (const Eigen::Matrix< var, Eigen::Dynamic, 1 > &alpha)
 Return the softmax of the specified Eigen vector.
 
template<int R, int C>
var log_sum_exp (const Eigen::Matrix< var, R, C > &x)
 Returns the log sum of exponentials.
 
template<int R1, int C1, int R2, int C2>
Eigen::Matrix< var, R1, C2 > mdivide_left (const Eigen::Matrix< var, R1, C1 > &A, const Eigen::Matrix< var, R2, C2 > &b)
 
template<int R1, int C1, int R2, int C2>
Eigen::Matrix< var, R1, C2 > mdivide_left (const Eigen::Matrix< var, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)
 
template<int R1, int C1, int R2, int C2>
Eigen::Matrix< var, R1, C2 > mdivide_left (const Eigen::Matrix< double, R1, C1 > &A, const Eigen::Matrix< var, R2, C2 > &b)
 
template<int R1, int C1, int R2, int C2>
Eigen::Matrix< var, R1, C2 > mdivide_left_spd (const Eigen::Matrix< var, R1, C1 > &A, const Eigen::Matrix< var, R2, C2 > &b)
 
template<int R1, int C1, int R2, int C2>
Eigen::Matrix< var, R1, C2 > mdivide_left_spd (const Eigen::Matrix< var, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)
 
template<int R1, int C1, int R2, int C2>
Eigen::Matrix< var, R1, C2 > mdivide_left_spd (const Eigen::Matrix< double, R1, C1 > &A, const Eigen::Matrix< var, R2, C2 > &b)
 
template<int TriView, int R1, int C1, int R2, int C2>
Eigen::Matrix< var, R1, C2 > mdivide_left_tri (const Eigen::Matrix< var, R1, C1 > &A, const Eigen::Matrix< var, R2, C2 > &b)
 
template<int TriView, int R1, int C1, int R2, int C2>
Eigen::Matrix< var, R1, C2 > mdivide_left_tri (const Eigen::Matrix< double, R1, C1 > &A, const Eigen::Matrix< var, R2, C2 > &b)
 
template<int TriView, int R1, int C1, int R2, int C2>
Eigen::Matrix< var, R1, C2 > mdivide_left_tri (const Eigen::Matrix< var, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)
 
template<typename T1 , typename T2 >
boost::enable_if_c
+< (boost::is_scalar< T1 >
+::value||boost::is_same< T1,
+var >::value)&&(boost::is_scalar
+< T2 >::value||boost::is_same
+< T2, var >::value), typename
+boost::math::tools::promote_args
+< T1, T2 >::type >::type 
multiply (const T1 &v, const T2 &c)
 Return the product of two scalars.
 
template<typename T1 , typename T2 , int R2, int C2>
Eigen::Matrix< var, R2, C2 > multiply (const T1 &c, const Eigen::Matrix< T2, R2, C2 > &m)
 Return the product of scalar and matrix.
 
template<typename T1 , int R1, int C1, typename T2 >
Eigen::Matrix< var, R1, C1 > multiply (const Eigen::Matrix< T1, R1, C1 > &m, const T2 &c)
 Return the product of scalar and matrix.
 
template<typename T1 , int R1, int C1, typename T2 , int R2, int C2>
boost::enable_if_c
+< boost::is_same< T1, var >
+::value||boost::is_same< T2,
+var >::value, Eigen::Matrix
+< var, R1, C2 > >::type 
multiply (const Eigen::Matrix< T1, R1, C1 > &m1, const Eigen::Matrix< T2, R2, C2 > &m2)
 Return the product of the specified matrices.
 
template<typename T1 , int C1, typename T2 , int R2>
boost::enable_if_c
+< boost::is_same< T1, var >
+::value||boost::is_same< T2,
+var >::value, var >::type 
multiply (const Eigen::Matrix< T1, 1, C1 > &rv, const Eigen::Matrix< T2, R2, 1 > &v)
 Return the scalar product of the specified row vector and specified column vector.
 
matrix_v multiply_lower_tri_self_transpose (const matrix_v &L)
 
template<typename TA , int RA, int CA, typename TB , int RB, int CB>
boost::enable_if_c
+< boost::is_same< TA, var >
+::value||boost::is_same< TB,
+var >::value, Eigen::Matrix
+< var, CB, CB > >::type 
quad_form (const Eigen::Matrix< TA, RA, CA > &A, const Eigen::Matrix< TB, RB, CB > &B)
 
template<typename TA , int RA, int CA, typename TB , int RB>
boost::enable_if_c
+< boost::is_same< TA, var >
+::value||boost::is_same< TB,
+var >::value, var >::type 
quad_form (const Eigen::Matrix< TA, RA, CA > &A, const Eigen::Matrix< TB, RB, 1 > &B)
 
template<typename TA , int RA, int CA, typename TB , int RB, int CB>
boost::enable_if_c
+< boost::is_same< TA, var >
+::value||boost::is_same< TB,
+var >::value, Eigen::Matrix
+< var, CB, CB > >::type 
quad_form_sym (const Eigen::Matrix< TA, RA, CA > &A, const Eigen::Matrix< TB, RB, CB > &B)
 
template<typename TA , int RA, int CA, typename TB , int RB>
boost::enable_if_c
+< boost::is_same< TA, var >
+::value||boost::is_same< TB,
+var >::value, var >::type 
quad_form_sym (const Eigen::Matrix< TA, RA, CA > &A, const Eigen::Matrix< TB, RB, 1 > &B)
 
var sd (const std::vector< var > &v)
 Return the sample standard deviation of the specified standard vector.
 
template<int R, int C>
var sd (const Eigen::Matrix< var, R, C > &m)
 
Eigen::Matrix< var,
+Eigen::Dynamic, 1 > 
softmax (const Eigen::Matrix< var, Eigen::Dynamic, 1 > &alpha)
 Return the softmax of the specified Eigen vector.
 
std::vector< varsort_asc (std::vector< var > xs)
 Return the specified standard vector in ascending order with gradients kept.
 
std::vector< varsort_desc (std::vector< var > xs)
 Return the specified standard vector in descending order with gradients kept.
 
template<int R, int C>
Eigen::Matrix< var, R, C > sort_asc (Eigen::Matrix< var, R, C > xs)
 Return the specified eigen vector in ascending order with gradients kept.
 
template<int R, int C>
Eigen::Matrix< var, R, C > sort_desc (Eigen::Matrix< var, R, C > xs)
 Return the specified eigen vector in descending order with gradients kept.
 
template<int R1, int C1, int R2, int C2>
var squared_dist (const Eigen::Matrix< var, R1, C1 > &v1, const Eigen::Matrix< var, R2, C2 > &v2)
 
template<int R1, int C1, int R2, int C2>
var squared_dist (const Eigen::Matrix< var, R1, C1 > &v1, const Eigen::Matrix< double, R2, C2 > &v2)
 
template<int R1, int C1, int R2, int C2>
var squared_dist (const Eigen::Matrix< double, R1, C1 > &v1, const Eigen::Matrix< var, R2, C2 > &v2)
 
void stan_print (std::ostream *o, const var &x)
 
template<int R, int C>
var sum (const Eigen::Matrix< var, R, C > &m)
 Returns the sum of the coefficients of the specified matrix, column vector or row vector.
 
matrix_v tcrossprod (const matrix_v &M)
 Returns the result of post-multiplying a matrix by its own transpose.
 
var to_var (const double &x)
 Converts argument to an automatic differentiation variable.
 
var to_var (const var &x)
 Converts argument to an automatic differentiation variable.
 
matrix_v to_var (const stan::math::matrix_d &m)
 Converts argument to an automatic differentiation variable.
 
matrix_v to_var (const matrix_v &m)
 Converts argument to an automatic differentiation variable.
 
vector_v to_var (const stan::math::vector_d &v)
 Converts argument to an automatic differentiation variable.
 
vector_v to_var (const vector_v &v)
 Converts argument to an automatic differentiation variable.
 
row_vector_v to_var (const stan::math::row_vector_d &rv)
 Converts argument to an automatic differentiation variable.
 
row_vector_v to_var (const row_vector_v &rv)
 Converts argument to an automatic differentiation variable.
 
template<typename TD , int RD, int CD, typename TA , int RA, int CA, typename TB , int RB, int CB>
boost::enable_if_c
+< boost::is_same< TD, var >
+::value||boost::is_same< TA,
+var >::value||boost::is_same
+< TB, var >::value, var >
+::type 
trace_gen_quad_form (const Eigen::Matrix< TD, RD, CD > &D, const Eigen::Matrix< TA, RA, CA > &A, const Eigen::Matrix< TB, RB, CB > &B)
 
template<typename TA , int RA, int CA, typename TB , int RB, int CB>
boost::enable_if_c
+< boost::is_same< TA, var >
+::value||boost::is_same< TB,
+var >::value, var >::type 
trace_quad_form (const Eigen::Matrix< TA, RA, CA > &A, const Eigen::Matrix< TB, RB, CB > &B)
 
template<int R, int C>
const Eigen::Matrix< double, R,
+C > & 
value_of (const Eigen::Matrix< double, R, C > &M)
 Convert a matrix to a matrix of doubles.
 
template<int R, int C>
Eigen::Matrix< double, R, C > value_of (const Eigen::Matrix< var, R, C > &M)
 Convert a matrix to a matrix of doubles.
 
var variance (const std::vector< var > &v)
 Return the sample variance of the specified standard vector.
 
template<int R, int C>
var variance (const Eigen::Matrix< var, R, C > &m)
 
var operator+ (const var &a, const double b)
 Addition operator for variable and scalar (C++).
 
var operator+ (const double a, const var &b)
 Addition operator for scalar and variable (C++).
 
var operator/ (const var &a, const double b)
 Division operator for dividing a variable by a scalar (C++).
 
var operator/ (const double a, const var &b)
 Division operator for dividing a scalar by a variable (C++).
 
bool operator== (const var &a, const double b)
 Equality operator comparing a variable's value and a double (C++).
 
bool operator== (const double a, const var &b)
 Equality operator comparing a scalar and a variable's value (C++).
 
bool operator> (const var &a, const double b)
 Greater than operator comparing variable's value and double (C++).
 
bool operator> (const double a, const var &b)
 Greater than operator comparing a double and a variable's value (C++).
 
bool operator>= (const var &a, const double b)
 Greater than or equal operator comparing variable's value and double (C++).
 
bool operator>= (const double a, const var &b)
 Greater than or equal operator comparing double and variable's value (C++).
 
bool operator< (const var &a, const double b)
 Less than operator comparing variable's value and a double (C++).
 
bool operator< (const double a, const var &b)
 Less than operator comparing a double and variable's value (C++).
 
bool operator<= (const var &a, const double b)
 Less than or equal operator comparing a variable's value and a scalar (C++).
 
bool operator<= (const double a, const var &b)
 Less than or equal operator comparing a double and variable's value (C++).
 
var operator* (const var &a, const double b)
 Multiplication operator for a variable and a scalar (C++).
 
var operator* (const double a, const var &b)
 Multiplication operator for a scalar and a variable (C++).
 
bool operator!= (const var &a, const double b)
 Inequality operator comparing a variable's value and a double (C++).
 
bool operator!= (const double a, const var &b)
 Inequality operator comparing a double and a variable's value (C++).
 
var operator- (const var &a, const double b)
 Subtraction operator for variable and scalar (C++).
 
var operator- (const double a, const var &b)
 Subtraction operator for scalar and variable (C++).
 
void print_stack (std::ostream &o)
 Prints the auto-dif variable stack.
 
static void recover_memory ()
 
static void grad (chainable *vi)
 
static void recover_memory ()
 Recover memory used for all variables for reuse.
 
static void free_memory ()
 Return all memory used for gradients back to the system.
 
+ + + + + + + + + +

+Variables

std::vector< chainable * > var_stack_
 
std::vector< chainable * > var_nochain_stack_
 
std::vector< chainable_alloc * > var_alloc_stack_
 
memory::stack_alloc memalloc_
 
+

Detailed Description

+

Function gradients via reverse-mode automatic differentiation.

+

Typedef Documentation

+ +
+
+ + + + +
typedef Eigen::Matrix<fvar<double>,Eigen::Dynamic,Eigen::Dynamic> stan::agrad::matrix_fd
+
+ +

Definition at line 18 of file typedefs.hpp.

+ +
+
+ +
+
+ + + + +
typedef Eigen::Matrix<fvar<fvar<double> >,Eigen::Dynamic,Eigen::Dynamic> stan::agrad::matrix_ffd
+
+ +

Definition at line 26 of file typedefs.hpp.

+ +
+
+ +
+
+ + + + +
typedef Eigen::Matrix<fvar<fvar<var> >,Eigen::Dynamic,Eigen::Dynamic> stan::agrad::matrix_ffv
+
+ +

Definition at line 30 of file typedefs.hpp.

+ +
+
+ +
+
+ + + + +
typedef Eigen::Matrix<fvar<var>,Eigen::Dynamic,Eigen::Dynamic> stan::agrad::matrix_fv
+
+ +

Definition at line 22 of file typedefs.hpp.

+ +
+
+ +
+
+ + + + +
typedef Eigen::Matrix<var,Eigen::Dynamic,Eigen::Dynamic> stan::agrad::matrix_v
+
+ +

The type of a matrix holding stan::agrad::var values.

+ +

Definition at line 17 of file typedefs.hpp.

+ +
+
+ +
+
+ + + + +
typedef Eigen::Matrix<fvar<double>,1,Eigen::Dynamic> stan::agrad::row_vector_fd
+
+ +

Definition at line 50 of file typedefs.hpp.

+ +
+
+ +
+
+ + + + +
typedef Eigen::Matrix<fvar<fvar<double> >,1,Eigen::Dynamic> stan::agrad::row_vector_ffd
+
+ +

Definition at line 58 of file typedefs.hpp.

+ +
+
+ +
+
+ + + + +
typedef Eigen::Matrix<fvar<fvar<var> >,1,Eigen::Dynamic> stan::agrad::row_vector_ffv
+
+ +

Definition at line 62 of file typedefs.hpp.

+ +
+
+ +
+
+ + + + +
typedef Eigen::Matrix<fvar<var>,1,Eigen::Dynamic> stan::agrad::row_vector_fv
+
+ +

Definition at line 54 of file typedefs.hpp.

+ +
+
+ +
+
+ + + + +
typedef Eigen::Matrix<var,1,Eigen::Dynamic> stan::agrad::row_vector_v
+
+ +

The type of a row vector holding stan::agrad::var values.

+ +

Definition at line 33 of file typedefs.hpp.

+ +
+
+ +
+
+ + + + +
typedef Eigen::Matrix< double, Eigen::Dynamic, Eigen::Dynamic >::size_type stan::agrad::size_type
+
+ +

Definition at line 14 of file typedefs.hpp.

+ +
+
+ +
+
+ + + + +
typedef Eigen::Matrix<fvar<double>,Eigen::Dynamic,1> stan::agrad::vector_fd
+
+ +

Definition at line 34 of file typedefs.hpp.

+ +
+
+ +
+
+ + + + +
typedef Eigen::Matrix<fvar<fvar<double> >,Eigen::Dynamic,1> stan::agrad::vector_ffd
+
+ +

Definition at line 42 of file typedefs.hpp.

+ +
+
+ +
+
+ + + + +
typedef Eigen::Matrix<fvar<fvar<var> >,Eigen::Dynamic,1> stan::agrad::vector_ffv
+
+ +

Definition at line 46 of file typedefs.hpp.

+ +
+
+ +
+
+ + + + +
typedef Eigen::Matrix<fvar<var>,Eigen::Dynamic,1> stan::agrad::vector_fv
+
+ +

Definition at line 38 of file typedefs.hpp.

+ +
+
+ +
+
+ + + + +
typedef Eigen::Matrix<var,Eigen::Dynamic,1> stan::agrad::vector_v
+
+ +

The type of a (column) vector holding stan::agrad::var values.

+ +

Definition at line 25 of file typedefs.hpp.

+ +
+
+

Function Documentation

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::abs (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 15 of file abs.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::abs (const var & a)
+
+inline
+
+ +

Return the absolute value of the variable (std).

+

The value at the undifferentiable point 0 is conveniently set 0, so that

+

$\frac{d}{dx}|x| = \mbox{sgn}(x)$.

+

The function fabs() provides identical behavior, with abs() defined in stdlib.h and fabs() defined in cmath.

+
Parameters
+ + +
aVariable input.
+
+
+
Returns
Absolute value of variable.
+

Delegates to fabs() (see for doc).

+
Parameters
+ + +
aVariable input.
+
+
+
Returns
Absolute value of variable.
+ +

Definition at line 1998 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::acos (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 15 of file acos.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::acos (const var & a)
+
+inline
+
+ +

Return the principal value of the arc cosine of a variable, in radians (cmath).

+

The derivative is defined by

+

$\frac{d}{dx} \arccos x = \frac{-1}{\sqrt{1 - x^2}}$.

+
Parameters
+ + +
aVariable in range [-1,1].
+
+
+
Returns
Arc cosine of variable, in radians.
+ +

Definition at line 1725 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::acosh (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 17 of file acosh.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::acosh (const stan::agrad::vara)
+
+inline
+
+ +

The inverse hyperbolic cosine function for variables (C99).

+

For non-variable function, see boost::math::acosh().

+

The derivative is defined by

+

$\frac{d}{dx} \mbox{acosh}(x) = \frac{x}{x^2 - 1}$.

+
Parameters
+ + +
aThe variable.
+
+
+
Returns
Inverse hyperbolic cosine of the variable.
+ +

Definition at line 40 of file acosh.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
int stan::agrad::as_bool (const agrad::var & v)
+
+inline
+
+ +

Return 1 if the argument is unequal to zero and 0 otherwise.

+
Parameters
+ + +
vValue.
+
+
+
Returns
1 if argument is equal to zero and 0 otherwise.
+ +

Definition at line 15 of file as_bool.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::asin (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 15 of file asin.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::asin (const var & a)
+
+inline
+
+ +

Return the principal value of the arc sine, in radians, of the specified variable (cmath).

+

The derivative is defined by

+

$\frac{d}{dx} \arcsin x = \frac{1}{\sqrt{1 - x^2}}$.

+
Parameters
+ + +
aVariable in range [-1,1].
+
+
+
Returns
Arc sine of variable, in radians.
+ +

Definition at line 1740 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::asinh (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 16 of file asinh.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::asinh (const stan::agrad::vara)
+
+inline
+
+ +

The inverse hyperbolic sine function for variables (C99).

+

For non-variable function, see boost::math::asinh().

+

The derivative is defined by

+

$\frac{d}{dx} \mbox{asinh}(x) = \frac{x}{x^2 + 1}$.

+
Parameters
+ + +
aThe variable.
+
+
+
Returns
Inverse hyperbolic sine of the variable.
+ +

Definition at line 40 of file asinh.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::atan (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 15 of file atan.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::atan (const var & a)
+
+inline
+
+ +

Return the principal value of the arc tangent, in radians, of the specified variable (cmath).

+

The derivative is defined by

+

$\frac{d}{dx} \arctan x = \frac{1}{1 + x^2}$.

+
Parameters
+ + +
aVariable in range [-1,1].
+
+
+
Returns
Arc tangent of variable, in radians.
+ +

Definition at line 1755 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::atan2 (const fvar< T > & x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 15 of file atan2.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::atan2 (const double x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 26 of file atan2.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::atan2 (const fvar< T > & x1,
const double x2 
)
+
+inline
+
+ +

Definition at line 36 of file atan2.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::atan2 (const var & a,
const double b 
)
+
+inline
+
+ +

Return the principal value of the arc tangent, in radians, of the first variable divided by the second scalar (cmath).

+

The derivative with respect to the variable is

+

$ $ \frac{d}{d x} \arctan \frac{x}{c} = \frac{c}{x^2 + c^2}$.

+
Parameters
+ + + +
aNumerator variable.
bDenominator scalar.
+
+
+
Returns
The arc tangent of the fraction, in radians.
+ +

Definition at line 79 of file atan2.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::atan2 (const double a,
const var & b 
)
+
+inline
+
+ +

Return the principal value of the arc tangent, in radians, of the first scalar divided by the second variable (cmath).

+

The derivative with respect to the variable is

+

$ $ \frac{\partial}{\partial y} \arctan \frac{c}{y} = \frac{-c}{c^2 + y^2}$.

+
Parameters
+ + + +
aNumerator scalar.
bDenominator variable.
+
+
+
Returns
The arc tangent of the fraction, in radians.
+ +

Definition at line 95 of file atan2.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::atan2 (const var & a,
const var & b 
)
+
+inline
+
+ +

Return the principal value of the arc tangent, in radians, of the first variable divided by the second (cmath).

+

The partial derivatives are defined by

+

$ $ \frac{\partial}{\partial x} \arctan \frac{x}{y} = \frac{y}{x^2 + y^2}$, and

+

$ $ \frac{\partial}{\partial y} \arctan \frac{x}{y} = \frac{-x}{x^2 + y^2}$.

+
Parameters
+ + + +
aNumerator variable.
bDenominator variable.
+
+
+
Returns
The arc tangent of the fraction, in radians.
+ +

Definition at line 1774 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::atan2 (const var & a,
const double & b 
)
+
+inline
+
+ +

Return the principal value of the arc tangent, in radians, of the first variable divided by the second scalar (cmath).

+

The derivative with respect to the variable is

+

$ $ \frac{d}{d x} \arctan \frac{x}{c} = \frac{c}{x^2 + c^2}$.

+
Parameters
+ + + +
aNumerator variable.
bDenominator scalar.
+
+
+
Returns
The arc tangent of the fraction, in radians.
+ +

Definition at line 1790 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::atan2 (const double & a,
const var & b 
)
+
+inline
+
+ +

Return the principal value of the arc tangent, in radians, of the first scalar divided by the second variable (cmath).

+

The derivative with respect to the variable is

+

$ $ \frac{\partial}{\partial y} \arctan \frac{c}{y} = \frac{-c}{c^2 + y^2}$.

+
Parameters
+ + + +
aNumerator scalar.
bDenominator variable.
+
+
+
Returns
The arc tangent of the fraction, in radians.
+ +

Definition at line 1806 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::atanh (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 16 of file atanh.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::atanh (const stan::agrad::vara)
+
+inline
+
+ +

The inverse hyperbolic tangent function for variables (C99).

+

For non-variable function, see boost::math::atanh().

+

The derivative is defined by

+

$\frac{d}{dx} \mbox{atanh}(x) = \frac{1}{1 - x^2}$.

+
Parameters
+ + +
aThe variable.
+
+
+
Returns
Inverse hyperbolic tangent of the variable.
+ +

Definition at line 36 of file atanh.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::bessel_first_kind (int v,
const fvar< T > & z 
)
+
+inline
+
+ +

Definition at line 15 of file bessel_first_kind.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::bessel_first_kind (const int & v,
const var & a 
)
+
+inline
+
+ +

Definition at line 27 of file bessel_first_kind.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::bessel_second_kind (int v,
const fvar< T > & z 
)
+
+inline
+
+ +

Definition at line 15 of file bessel_second_kind.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::bessel_second_kind (const int & v,
const var & a 
)
+
+inline
+
+ +

Definition at line 27 of file bessel_second_kind.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::binary_log_loss (const int y,
const fvar< T > & y_hat 
)
+
+inline
+
+ +

Definition at line 15 of file binary_log_loss.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::binary_log_loss (const int y,
const stan::agrad::vary_hat 
)
+
+inline
+
+ +

The log loss function for variables (stan).

+

See stan::math::binary_log_loss() for the double-based version.

+

The derivative with respect to the variable $\hat{y}$ is

+

$\frac{d}{d\hat{y}} \mbox{logloss}(1,\hat{y}) = - \frac{1}{\hat{y}}$, and

+

$\frac{d}{d\hat{y}} \mbox{logloss}(0,\hat{y}) = \frac{1}{1 - \hat{y}}$.

+
Parameters
+ + + +
yReference value.
y_hatResponse variable.
+
+
+
Returns
Log loss of response versus reference value.
+ +

Definition at line 50 of file binary_log_loss.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::binomial_coefficient_log (const fvar< T > & x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 16 of file binomial_coefficient_log.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::binomial_coefficient_log (const fvar< T > & x1,
const double x2 
)
+
+inline
+
+ +

Definition at line 45 of file binomial_coefficient_log.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::binomial_coefficient_log (const double x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 69 of file binomial_coefficient_log.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
double stan::agrad::calculate_chain (const double & x,
const double & val 
)
+
+inline
+
+ +

Definition at line 8 of file calculate_chain.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::cbrt (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 16 of file cbrt.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::cbrt (const stan::agrad::vara)
+
+inline
+
+ +

Returns the cube root of the specified variable (C99).

+

See boost::math::cbrt() for the double-based version.

+

The derivative is

+

$\frac{d}{dx} x^{1/3} = \frac{1}{3 x^{2/3}}$.

+
Parameters
+ + +
aSpecified variable.
+
+
+
Returns
Cube root of the variable.
+ +

Definition at line 35 of file cbrt.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::ceil (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 14 of file ceil.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::ceil (const var & a)
+
+inline
+
+ +

Return the ceiling of the specified variable (cmath).

+

The derivative of the ceiling function is defined and zero everywhere but at integers, and we set them to zero for convenience,

+

$\frac{d}{dx} {\lceil x \rceil} = 0$.

+

The ceiling function rounds up. For double values, this is the smallest integral value that is not less than the specified value. Although this function is not differentiable because it is discontinuous at integral values, its gradient is returned as zero everywhere.

+
Parameters
+ + +
aInput variable.
+
+
+
Returns
Ceiling of the variable.
+ +

Definition at line 1922 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+
+template<typename T_result , class Policy >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::agrad::check_pos_definite (const char * function,
const Eigen::Matrix< var, Eigen::Dynamic, Eigen::Dynamic > & y,
const char * name,
T_result * result,
const Policy &  
)
+
+inline
+
+ +

Definition at line 14 of file check_pos_definite.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>, 1, C1> stan::agrad::columns_dot_product (const Eigen::Matrix< fvar< T >, R1, C1 > & v1,
const Eigen::Matrix< fvar< T >, R2, C2 > & v2 
)
+
+inline
+
+ +

Definition at line 18 of file columns_dot_product.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>, 1, C1> stan::agrad::columns_dot_product (const Eigen::Matrix< fvar< T >, R1, C1 > & v1,
const Eigen::Matrix< double, R2, C2 > & v2 
)
+
+inline
+
+ +

Definition at line 33 of file columns_dot_product.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>, 1, C1> stan::agrad::columns_dot_product (const Eigen::Matrix< double, R1, C1 > & v1,
const Eigen::Matrix< fvar< T >, R2, C2 > & v2 
)
+
+inline
+
+ +

Definition at line 49 of file columns_dot_product.hpp.

+ +
+
+ +
+
+
+template<typename T1 , int R1, int C1, typename T2 , int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::enable_if_c<boost::is_same<T1,var>::value || boost::is_same<T2,var>::value, Eigen::Matrix<var, 1, C1> >::type stan::agrad::columns_dot_product (const Eigen::Matrix< T1, R1, C1 > & v1,
const Eigen::Matrix< T2, R2, C2 > & v2 
)
+
+inline
+
+ +

Definition at line 259 of file dot_product.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<fvar<T>,1,C> stan::agrad::columns_dot_self (const Eigen::Matrix< fvar< T >, R, C > & x)
+
+inline
+
+ +

Definition at line 16 of file columns_dot_self.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<var,1,C> stan::agrad::columns_dot_self (const Eigen::Matrix< var, R, C > & x)
+
+inline
+
+ +

Returns the dot product of each column of a matrix with itself.

+
Parameters
+ + +
xMatrix.
+
+
+
Template Parameters
+ + +
Tscalar type
+
+
+ +

Definition at line 89 of file dot_self.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::cos (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 14 of file cos.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::cos (const var & a)
+
+inline
+
+ +

Return the cosine of a radian-scaled variable (cmath).

+

The derivative is defined by

+

$\frac{d}{dx} \cos x = - \sin x$.

+
Parameters
+ + +
aVariable for radians of angle.
+
+
+
Returns
Cosine of variable.
+ +

Definition at line 1682 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::cosh (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 14 of file cosh.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::cosh (const var & a)
+
+inline
+
+ +

Return the hyperbolic cosine of the specified variable (cmath).

+

The derivative is defined by

+

$\frac{d}{dx} \cosh x = \sinh x$.

+
Parameters
+ + +
aVariable.
+
+
+
Returns
Hyperbolic cosine of variable.
+ +

Definition at line 1822 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<fvar<T>,C,C> stan::agrad::crossprod (const Eigen::Matrix< fvar< T >, R, C > & m)
+
+inline
+
+ +

Definition at line 17 of file crossprod.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
matrix_v stan::agrad::crossprod (const matrix_v & M)
+
+inline
+
+ +

Returns the result of pre-multiplying a matrix by its own transpose.

+
Parameters
+ + +
MMatrix to multiply.
+
+
+
Returns
Transpose of M times M
+ +

Definition at line 17 of file crossprod.hpp.

+ +
+
+ +
+
+
+template<typename T , typename F >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::agrad::derivative (const F & f,
const T & x,
T & fx,
T & dfx_dx 
)
+
+ +

Definition at line 15 of file autodiff.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::determinant (const Eigen::Matrix< fvar< T >, R, C > & m)
+
+inline
+
+ +

Definition at line 20 of file determinant.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + + +
var stan::agrad::determinant (const Eigen::Matrix< var, R, C > & m)
+
+inline
+
+ +

Definition at line 68 of file determinant.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::digamma (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 16 of file digamma.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::digamma (const stan::agrad::vara)
+
+inline
+
+ +

Definition at line 25 of file digamma.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::divide (const T1 & v,
const T2 & c 
)
+
+inline
+
+ +

Definition at line 17 of file divide.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>,R,C> stan::agrad::divide (const Eigen::Matrix< fvar< T >, R, C > & v,
const fvar< T > & c 
)
+
+inline
+
+ +

Definition at line 23 of file divide.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
double stan::agrad::divide (double x,
double y 
)
+
+inline
+
+ +

Return the division of the first scalar by the second scalar.

+
Parameters
+ + + +
[in]xSpecified vector.
[in]ySpecified scalar.
+
+
+
Returns
Vector divided by the scalar.
+ +

Definition at line 25 of file divide.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>,R,C> stan::agrad::divide (const Eigen::Matrix< fvar< T >, R, C > & v,
const double c 
)
+
+inline
+
+ +

Definition at line 34 of file divide.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , int R, int C>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<var,R,C> stan::agrad::divide (const Eigen::Matrix< T1, R, C > & v,
const T2 & c 
)
+
+inline
+
+ +

Return the division of the specified column vector by the specified scalar.

+
Parameters
+ + + +
[in]vSpecified vector.
[in]cSpecified scalar.
+
+
+
Returns
Vector divided by the scalar.
+ +

Definition at line 42 of file divide.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>,R,C> stan::agrad::divide (const Eigen::Matrix< double, R, C > & v,
const fvar< T > & c 
)
+
+inline
+
+ +

Definition at line 46 of file divide.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::dot_product (const Eigen::Matrix< fvar< T >, R1, C1 > & v1,
const Eigen::Matrix< fvar< T >, R2, C2 > & v2 
)
+
+inline
+
+ +

Definition at line 20 of file dot_product.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::dot_product (const Eigen::Matrix< fvar< T >, R1, C1 > & v1,
const Eigen::Matrix< double, R2, C2 > & v2 
)
+
+inline
+
+ +

Definition at line 35 of file dot_product.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::dot_product (const Eigen::Matrix< double, R1, C1 > & v1,
const Eigen::Matrix< fvar< T >, R2, C2 > & v2 
)
+
+inline
+
+ +

Definition at line 50 of file dot_product.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::dot_product (const Eigen::Matrix< fvar< T >, R1, C1 > & v1,
const Eigen::Matrix< fvar< T >, R2, C2 > & v2,
size_type & length 
)
+
+inline
+
+ +

Definition at line 65 of file dot_product.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::dot_product (const Eigen::Matrix< fvar< T >, R1, C1 > & v1,
const Eigen::Matrix< double, R2, C2 > & v2,
size_type & length 
)
+
+inline
+
+ +

Definition at line 80 of file dot_product.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::dot_product (const Eigen::Matrix< double, R1, C1 > & v1,
const Eigen::Matrix< fvar< T >, R2, C2 > & v2,
size_type & length 
)
+
+inline
+
+ +

Definition at line 95 of file dot_product.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::dot_product (const std::vector< fvar< T > > & v1,
const std::vector< fvar< T > > & v2 
)
+
+inline
+
+ +

Definition at line 110 of file dot_product.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::dot_product (const std::vector< double > & v1,
const std::vector< fvar< T > > & v2 
)
+
+inline
+
+ +

Definition at line 122 of file dot_product.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::dot_product (const std::vector< fvar< T > > & v1,
const std::vector< double > & v2 
)
+
+inline
+
+ +

Definition at line 134 of file dot_product.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::dot_product (const std::vector< fvar< T > > & v1,
const std::vector< fvar< T > > & v2,
size_type & length 
)
+
+inline
+
+ +

Definition at line 146 of file dot_product.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::dot_product (const std::vector< double > & v1,
const std::vector< fvar< T > > & v2,
size_type & length 
)
+
+inline
+
+ +

Definition at line 158 of file dot_product.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::dot_product (const std::vector< fvar< T > > & v1,
const std::vector< double > & v2,
size_type & length 
)
+
+inline
+
+ +

Definition at line 170 of file dot_product.hpp.

+ +
+
+ +
+
+
+template<typename T1 , int R1, int C1, typename T2 , int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::enable_if_c<boost::is_same<T1,var>::value || boost::is_same<T2,var>::value, var>::type stan::agrad::dot_product (const Eigen::Matrix< T1, R1, C1 > & v1,
const Eigen::Matrix< T2, R2, C2 > & v2 
)
+
+inline
+
+ +

Returns the dot product.

+
Parameters
+ + + +
[in]v1First column vector.
[in]v2Second column vector.
+
+
+
Returns
Dot product of the vectors.
+
Exceptions
+ + +
std::domain_errorif length of v1 is not equal to length of v2.
+
+
+ +

Definition at line 213 of file dot_product.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
boost::enable_if_c<boost::is_same<T1,var>::value || boost::is_same<T2,var>::value, var>::type stan::agrad::dot_product (const T1 * v1,
const T2 * v2,
size_t length 
)
+
+inline
+
+ +

Returns the dot product.

+
Parameters
+ + + + +
[in]v1First array.
[in]v2Second array.
[in]lengthLength of both arrays.
+
+
+
Returns
Dot product of the arrays.
+ +

Definition at line 232 of file dot_product.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::enable_if_c<boost::is_same<T1,var>::value || boost::is_same<T2,var>::value, var>::type stan::agrad::dot_product (const std::vector< T1 > & v1,
const std::vector< T2 > & v2 
)
+
+inline
+
+ +

Returns the dot product.

+
Parameters
+ + + +
[in]v1First vector.
[in]v2Second vector.
+
+
+
Returns
Dot product of the vectors.
+
Exceptions
+ + +
std::domain_errorif sizes of v1 and v2 do not match.
+
+
+ +

Definition at line 248 of file dot_product.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::dot_self (const Eigen::Matrix< fvar< T >, R, C > & v)
+
+inline
+
+ +

Definition at line 16 of file dot_self.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + + +
var stan::agrad::dot_self (const Eigen::Matrix< var, R, C > & v)
+
+inline
+
+ +

Returns the dot product of a vector with itself.

+
Parameters
+ + +
[in]vVector.
+
+
+
Returns
Dot product of the vector with itself.
+
Template Parameters
+ + + +
Rnumber of rows or Eigen::Dynamic for dynamic; one of R or C must be 1
Cnumber of rows or Eigen::Dyanmic for dynamic; one of R or C must be 1
+
+
+ +

Definition at line 77 of file dot_self.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::erf (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 17 of file erf.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::erf (const stan::agrad::vara)
+
+inline
+
+ +

The error function for variables (C99).

+

For non-variable function, see boost::math::erf()

+

The derivative is

+

$\frac{d}{dx} \mbox{erf}(x) = \frac{2}{\sqrt{\pi}} \exp(-x^2)$.

+
Parameters
+ + +
aThe variable.
+
+
+
Returns
Error function applied to the variable.
+ +

Definition at line 37 of file erf.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::erfc (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 17 of file erfc.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::erfc (const stan::agrad::vara)
+
+inline
+
+ +

The complementary error function for variables (C99).

+

For non-variable function, see boost::math::erfc().

+

The derivative is

+

$\frac{d}{dx} \mbox{erfc}(x) = - \frac{2}{\sqrt{\pi}} \exp(-x^2)$.

+
Parameters
+ + +
aThe variable.
+
+
+
Returns
Complementary error function applied to the variable.
+ +

Definition at line 37 of file erfc.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::exp (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 15 of file exp.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::exp (const var & a)
+
+inline
+
+ +

Return the exponentiation of the specified variable (cmath).

+
Parameters
+ + +
aVariable to exponentiate.
+
+
+
Returns
Exponentiated variable.
+ +

Definition at line 1571 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::exp2 (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 16 of file exp2.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::exp2 (const stan::agrad::vara)
+
+inline
+
+ +

Exponentiation base 2 function for variables (C99).

+

For non-variable function, see boost::math::exp2().

+

The derivatie is

+

$\frac{d}{dx} 2^x = (\log 2) 2^x$.

+
Parameters
+ + +
aThe variable.
+
+
+
Returns
Two to the power of the specified variable.
+ +

Definition at line 36 of file exp2.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::expm1 (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 15 of file expm1.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::expm1 (const stan::agrad::vara)
+
+inline
+
+ +

The exponentiation of the specified variable minus 1 (C99).

+

For non-variable function, see boost::math::expm1().

+

The derivative is given by

+

$\frac{d}{dx} \exp(a) - 1 = \exp(a)$.

+
Parameters
+ + +
aThe variable.
+
+
+
Returns
Two to the power of the specified variable.
+ +

Definition at line 36 of file expm1.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::fabs (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 15 of file fabs.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::fabs (const var & a)
+
+inline
+
+ +

Return the absolute value of the variable (cmath).

+

Choosing an arbitrary value at the non-differentiable point 0,

+

$\frac{d}{dx}|x| = \mbox{sgn}(x)$.

+

where $\mbox{sgn}(x)$ is the signum function, taking values -1 if $x < 0$, 0 if $x == 0$, and 1 if $x == 1$.

+

The function abs() provides the same behavior, with abs() defined in stdlib.h and fabs() defined in cmath.

+
Parameters
+ + +
aInput variable.
+
+
+
Returns
Absolute value of variable.
+

Choosing an arbitrary value at the non-differentiable point 0,

+

$\frac{d}{dx}|x| = \mbox{sgn}(x)$.

+

where $\mbox{sgn}(x)$ is the signum function, taking values -1 if $x < 0$, 0 if $x == 0$, and 1 if $x == 1$.

+

The function abs() provides the same behavior, with abs() defined in stdlib.h and fabs() defined in cmath. The derivative is 0 if the input is 0.

+

Returns std::numeric_limits<double>::quiet_NaN() for NaN inputs.

+
Parameters
+ + +
aInput variable.
+
+
+
Returns
Absolute value of variable.
+ +

Definition at line 1873 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::falling_factorial (const fvar< T > & x,
const fvar< T > & n 
)
+
+inline
+
+ +

Definition at line 15 of file falling_factorial.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::falling_factorial (const fvar< T > & x,
const double n 
)
+
+inline
+
+ +

Definition at line 26 of file falling_factorial.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::falling_factorial (const double x,
const fvar< T > & n 
)
+
+inline
+
+ +

Definition at line 37 of file falling_factorial.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::falling_factorial (const var & a,
const double & b 
)
+
+inline
+
+ +

Definition at line 48 of file falling_factorial.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::falling_factorial (const var & a,
const var & b 
)
+
+inline
+
+ +

Definition at line 53 of file falling_factorial.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::falling_factorial (const double & a,
const var & b 
)
+
+inline
+
+ +

Definition at line 58 of file falling_factorial.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::fdim (const fvar< T > & x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 15 of file fdim.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::fdim (const fvar< T > & x1,
const double x2 
)
+
+inline
+
+ +

Definition at line 28 of file fdim.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::fdim (const double x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 40 of file fdim.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::fdim (const stan::agrad::vara,
const stan::agrad::varb 
)
+
+inline
+
+ +

Return the positive difference between the first variable's the value and the second's (C99).

+

See stan::math::fdim() for the double-based version.

+

The partial derivative with respect to the first argument is

+

$\frac{\partial}{\partial x} \mbox{fdim}(x,y) = 0.0$ if $x < y$, and

+

$\frac{\partial}{\partial x} \mbox{fdim}(x,y) = 1.0$ if $x \geq y$.

+

With respect to the second argument, the partial is

+

$\frac{\partial}{\partial y} \mbox{fdim}(x,y) = 0.0$ if $x < y$, and

+

$\frac{\partial}{\partial y} \mbox{fdim}(x,y) = -\lfloor\frac{x}{y}\rfloor$ if $x \geq y$.

+
Parameters
+ + + +
aFirst variable.
bSecond variable.
+
+
+
Returns
The positive difference between the first and second variable.
+ +

Definition at line 68 of file fdim.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::fdim (const double & a,
const stan::agrad::varb 
)
+
+inline
+
+ +

Return the positive difference between the first value and the value of the second variable (C99).

+

See fdim(var,var) for definitions of values and derivatives.

+

The derivative with respect to the variable is

+

$\frac{d}{d y} \mbox{fdim}(c,y) = 0.0$ if $c < y$, and

+

$\frac{d}{d y} \mbox{fdim}(c,y) = -\lfloor\frac{c}{y}\rfloor$ if $c \geq y$.

+
Parameters
+ + + +
aFirst value.
bSecond variable.
+
+
+
Returns
The positive difference between the first and second arguments.
+ +

Definition at line 93 of file fdim.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::fdim (const stan::agrad::vara,
const double & b 
)
+
+inline
+
+ +

Return the positive difference between the first variable's value and the second value (C99).

+

See fdim(var,var) for definitions of values and derivatives.

+

The derivative with respect to the variable is

+

$\frac{d}{d x} \mbox{fdim}(x,c) = 0.0$ if $x < c$, and

+

$\frac{d}{d x} \mbox{fdim}(x,c) = 1.0$ if $x \geq yc$.

+
Parameters
+ + + +
aFirst value.
bSecond variable.
+
+
+
Returns
The positive difference between the first and second arguments.
+ +

Definition at line 116 of file fdim.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::floor (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 14 of file floor.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::floor (const var & a)
+
+inline
+
+ +

Return the floor of the specified variable (cmath).

+

The derivative of the floor function is defined and zero everywhere but at integers, so we set these derivatives to zero for convenience,

+

$\frac{d}{dx} {\lfloor x \rfloor} = 0$.

+

The floor function rounds down. For double values, this is the largest integral value that is not greater than the specified value. Although this function is not differentiable because it is discontinuous at integral values, its gradient is returned as zero everywhere.

+
Parameters
+ + +
aInput variable.
+
+
+
Returns
Floor of the variable.
+ +

Definition at line 1900 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , typename T3 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
fvar<typename stan::return_type<T1,T2,T3>::type> stan::agrad::fma (const fvar< T1 > & x1,
const fvar< T2 > & x2,
const fvar< T3 > & x3 
)
+
+inline
+
+ +

Definition at line 15 of file fma.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , typename T3 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
fvar<typename stan::return_type<T1,T2,T3>::type> stan::agrad::fma (const T1 & x1,
const fvar< T2 > & x2,
const fvar< T3 > & x3 
)
+
+inline
+
+ +

Definition at line 25 of file fma.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , typename T3 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
fvar<typename stan::return_type<T1,T2,T3>::type> stan::agrad::fma (const fvar< T1 > & x1,
const T2 & x2,
const fvar< T3 > & x3 
)
+
+inline
+
+ +

Definition at line 35 of file fma.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , typename T3 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
fvar<typename stan::return_type<T1,T2,T3>::type> stan::agrad::fma (const fvar< T1 > & x1,
const fvar< T2 > & x2,
const T3 & x3 
)
+
+inline
+
+ +

Definition at line 45 of file fma.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , typename T3 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
fvar<typename stan::return_type<T1,T2,T3>::type> stan::agrad::fma (const T1 & x1,
const T2 & x2,
const fvar< T3 > & x3 
)
+
+inline
+
+ +

Definition at line 55 of file fma.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , typename T3 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
fvar<typename stan::return_type<T1,T2,T3>::type> stan::agrad::fma (const fvar< T1 > & x1,
const T2 & x2,
const T3 & x3 
)
+
+inline
+
+ +

Definition at line 65 of file fma.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , typename T3 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
fvar<typename stan::return_type<T1,T2,T3>::type> stan::agrad::fma (const T1 & x1,
const fvar< T2 > & x2,
const T3 & x3 
)
+
+inline
+
+ +

Definition at line 75 of file fma.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
var stan::agrad::fma (const stan::agrad::vara,
const stan::agrad::varb,
const stan::agrad::varc 
)
+
+inline
+
+ +

The fused multiply-add function for three variables (C99).

+

This function returns the product of the first two arguments plus the third argument.

+

See boost::math::fma() for the double-based version.

+

The partial derivatives are

+

$\frac{\partial}{\partial x} (x * y) + z = y$, and

+

$\frac{\partial}{\partial y} (x * y) + z = x$, and

+

$\frac{\partial}{\partial z} (x * y) + z = 1$.

+
Parameters
+ + + + +
aFirst multiplicand.
bSecond multiplicand.
cSummand.
+
+
+
Returns
Product of the multiplicands plus the summand, ($a * $b) + $c.
+ +

Definition at line 98 of file fma.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
var stan::agrad::fma (const stan::agrad::vara,
const stan::agrad::varb,
const double & c 
)
+
+inline
+
+ +

The fused multiply-add function for two variables and a value (C99).

+

This function returns the product of the first two arguments plus the third argument.

+

See boost::math::fma() for the double-based version.

+

The partial derivatives are

+

$\frac{\partial}{\partial x} (x * y) + c = y$, and

+

$\frac{\partial}{\partial y} (x * y) + c = x$.

+
Parameters
+ + + + +
aFirst multiplicand.
bSecond multiplicand.
cSummand.
+
+
+
Returns
Product of the multiplicands plus the summand, ($a * $b) + $c.
+ +

Definition at line 122 of file fma.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
var stan::agrad::fma (const stan::agrad::vara,
const double & b,
const stan::agrad::varc 
)
+
+inline
+
+ +

The fused multiply-add function for a variable, value, and variable (C99).

+

This function returns the product of the first two arguments plus the third argument.

+

See boost::math::fma() for the double-based version.

+

The partial derivatives are

+

$\frac{\partial}{\partial x} (x * c) + z = c$, and

+

$\frac{\partial}{\partial z} (x * c) + z = 1$.

+
Parameters
+ + + + +
aFirst multiplicand.
bSecond multiplicand.
cSummand.
+
+
+
Returns
Product of the multiplicands plus the summand, ($a * $b) + $c.
+ +

Definition at line 146 of file fma.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
var stan::agrad::fma (const stan::agrad::vara,
const double & b,
const double & c 
)
+
+inline
+
+ +

The fused multiply-add function for a variable and two values (C99).

+

This function returns the product of the first two arguments plus the third argument.

+

See boost::math::fma() for the double-based version.

+

The derivative is

+

$\frac{d}{d x} (x * c) + d = c$.

+
Parameters
+ + + + +
aFirst multiplicand.
bSecond multiplicand.
cSummand.
+
+
+
Returns
Product of the multiplicands plus the summand, ($a * $b) + $c.
+ +

Definition at line 168 of file fma.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
var stan::agrad::fma (const double & a,
const stan::agrad::varb,
const double & c 
)
+
+inline
+
+ +

The fused multiply-add function for a value, variable, and value (C99).

+

This function returns the product of the first two arguments plus the third argument.

+

See boost::math::fma() for the double-based version.

+

The derivative is

+

$\frac{d}{d y} (c * y) + d = c$, and

+
Parameters
+ + + + +
aFirst multiplicand.
bSecond multiplicand.
cSummand.
+
+
+
Returns
Product of the multiplicands plus the summand, ($a * $b) + $c.
+ +

Definition at line 190 of file fma.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
var stan::agrad::fma (const double & a,
const double & b,
const stan::agrad::varc 
)
+
+inline
+
+ +

The fused multiply-add function for two values and a variable, and value (C99).

+

This function returns the product of the first two arguments plus the third argument.

+

See boost::math::fma() for the double-based version.

+

The derivative is

+

$\frac{\partial}{\partial z} (c * d) + z = 1$.

+
Parameters
+ + + + +
aFirst multiplicand.
bSecond multiplicand.
cSummand.
+
+
+
Returns
Product of the multiplicands plus the summand, ($a * $b) + $c.
+ +

Definition at line 212 of file fma.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
var stan::agrad::fma (const double & a,
const stan::agrad::varb,
const stan::agrad::varc 
)
+
+inline
+
+ +

The fused multiply-add function for a value and two variables (C99).

+

This function returns the product of the first two arguments plus the third argument.

+

See boost::math::fma() for the double-based version.

+

The partial derivaties are

+

$\frac{\partial}{\partial y} (c * y) + z = c$, and

+

$\frac{\partial}{\partial z} (c * y) + z = 1$.

+
Parameters
+ + + + +
aFirst multiplicand.
bSecond multiplicand.
cSummand.
+
+
+
Returns
Product of the multiplicands plus the summand, ($a * $b) + $c.
+ +

Definition at line 236 of file fma.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::fmax (const fvar< T > & x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 15 of file fmax.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::fmax (const stan::agrad::vara,
const stan::agrad::varb 
)
+
+inline
+
+ +

Returns the maximum of the two variable arguments (C99).

+

See boost::math::fmax() for the double-based version.

+

No new variable implementations are created, with this function defined as if by

+

fmax(a,b) = a if a's value is greater than b's, and .

+

fmax(a,b) = b if b's value is greater than or equal to a's.

+
Parameters
+ + + +
aFirst variable.
bSecond variable.
+
+
+
Returns
If the first variable's value is larger than the second's, the first variable, otherwise the second variable.
+ +

Definition at line 26 of file fmax.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::fmax (const double x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 29 of file fmax.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::fmax (const fvar< T > & x1,
const double x2 
)
+
+inline
+
+ +

Definition at line 43 of file fmax.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::fmax (const stan::agrad::vara,
const double & b 
)
+
+inline
+
+ +

Returns the maximum of the variable and scalar, promoting the scalar to a variable if it is larger (C99).

+

See boost::math::fmax() for the double-based version.

+

For fmax(a,b), if a's value is greater than b, then a is returned, otherwise a fesh variable implementation wrapping the value b is returned.

+
Parameters
+ + + +
aFirst variable.
bSecond value
+
+
+
Returns
If the first variable's value is larger than or equal to the second value, the first variable, otherwise the second value promoted to a fresh variable.
+ +

Definition at line 47 of file fmax.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::fmax (const double & a,
const stan::agrad::varb 
)
+
+inline
+
+ +

Returns the maximum of a scalar and variable, promoting the scalar to a variable if it is larger (C99).

+

See boost::math::fmax() for the double-based version.

+

For fmax(a,b), if a is greater than b's value, then a fresh variable implementation wrapping a is returned, otherwise b is returned.

+
Parameters
+ + + +
aFirst value.
bSecond variable.
+
+
+
Returns
If the first value is larger than the second variable's value, return the first value promoted to a variable, otherwise return the second variable.
+ +

Definition at line 68 of file fmax.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::fmin (const fvar< T > & x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 15 of file fmin.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::fmin (const stan::agrad::vara,
const stan::agrad::varb 
)
+
+inline
+
+ +

Returns the minimum of the two variable arguments (C99).

+

See boost::math::fmin() for the double-based version.

+

For fmin(a,b), if a's value is less than b's, then a is returned, otherwise b is returned.

+
Parameters
+ + + +
aFirst variable.
bSecond variable.
+
+
+
Returns
If the first variable's value is smaller than the second's, the first variable, otherwise the second variable.
+ +

Definition at line 22 of file fmin.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::fmin (const double x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 29 of file fmin.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::fmin (const stan::agrad::vara,
const double & b 
)
+
+inline
+
+ +

Returns the minimum of the variable and scalar, promoting the scalar to a variable if it is larger (C99).

+

See boost::math::fmin() for the double-based version.

+

For fmin(a,b), if a's value is less than b, then a is returned, otherwise a fresh variable wrapping b is returned.

+
Parameters
+ + + +
aFirst variable.
bSecond value
+
+
+
Returns
If the first variable's value is less than or equal to the second value, the first variable, otherwise the second value promoted to a fresh variable.
+ +

Definition at line 41 of file fmin.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::fmin (const fvar< T > & x1,
const double x2 
)
+
+inline
+
+ +

Definition at line 43 of file fmin.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::fmin (const double & a,
const stan::agrad::varb 
)
+
+inline
+
+ +

Returns the minimum of a scalar and variable, promoting the scalar to a variable if it is larger (C99).

+

See boost::math::fmin() for the double-based version.

+

For fmin(a,b), if a is less than b's value, then a fresh variable implementation wrapping a is returned, otherwise b is returned.

+
Parameters
+ + + +
aFirst value.
bSecond variable.
+
+
+
Returns
If the first value is smaller than the second variable's value, return the first value promoted to a variable, otherwise return the second variable.
+ +

Definition at line 62 of file fmin.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::fmod (const fvar< T > & x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 14 of file fmod.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::fmod (const fvar< T > & x1,
const double x2 
)
+
+inline
+
+ +

Definition at line 24 of file fmod.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::fmod (const double x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 32 of file fmod.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::fmod (const var & a,
const double b 
)
+
+inline
+
+ +

Return the floating point remainder after dividing the the first variable by the second scalar (cmath).

+

The derivative with respect to the variable is

+

$\frac{d}{d x} \mbox{fmod}(x,c) = \frac{1}{c}$.

+
Parameters
+ + + +
aFirst variable.
bSecond scalar.
+
+
+
Returns
Floating pointer remainder of dividing the first variable by the second scalar.
+ +

Definition at line 81 of file fmod.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::fmod (const double a,
const var & b 
)
+
+inline
+
+ +

Return the floating point remainder after dividing the first scalar by the second variable (cmath).

+

The derivative with respect to the variable is

+

$\frac{d}{d y} \mbox{fmod}(c,y) = -\lfloor \frac{c}{y} \rfloor$.

+
Parameters
+ + + +
aFirst scalar.
bSecond variable.
+
+
+
Returns
Floating pointer remainder of dividing first scalar by the second variable.
+ +

Definition at line 98 of file fmod.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::fmod (const var & a,
const var & b 
)
+
+inline
+
+ +

Return the floating point remainder after dividing the first variable by the second (cmath).

+

The partial derivatives with respect to the variables are defined everywhere but where $x = y$, but we set these to match other values, with

+

$\frac{\partial}{\partial x} \mbox{fmod}(x,y) = 1$, and

+

$\frac{\partial}{\partial y} \mbox{fmod}(x,y) = -\lfloor \frac{x}{y} \rfloor$.

+
Parameters
+ + + +
aFirst variable.
bSecond variable.
+
+
+
Returns
Floating pointer remainder of dividing the first variable by the second.
+ +

Definition at line 1943 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::fmod (const var & a,
const double & b 
)
+
+inline
+
+ +

Return the floating point remainder after dividing the the first variable by the second scalar (cmath).

+

The derivative with respect to the variable is

+

$\frac{d}{d x} \mbox{fmod}(x,c) = \frac{1}{c}$.

+
Parameters
+ + + +
aFirst variable.
bSecond scalar.
+
+
+
Returns
Floating pointer remainder of dividing the first variable by the second scalar.
+ +

Definition at line 1960 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::fmod (const double & a,
const var & b 
)
+
+inline
+
+ +

Return the floating point remainder after dividing the first scalar by the second variable (cmath).

+

The derivative with respect to the variable is

+

$\frac{d}{d y} \mbox{fmod}(c,y) = -\lfloor \frac{c}{y} \rfloor$.

+
Parameters
+ + + +
aFirst scalar.
bSecond variable.
+
+
+
Returns
Floating pointer remainder of dividing first scalar by the second variable.
+ +

Definition at line 1977 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
static void stan::agrad::free_memory ()
+
+static
+
+ +

Return all memory used for gradients back to the system.

+ +

Definition at line 49 of file var_stack.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::gamma_p (const fvar< T > & x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 16 of file gamma_p.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::gamma_p (const fvar< T > & x1,
const double x2 
)
+
+inline
+
+ +

Definition at line 52 of file gamma_p.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::gamma_p (const double x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 87 of file gamma_p.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::gamma_p (const stan::agrad::vara,
const stan::agrad::varb 
)
+
+inline
+
+ +

Definition at line 91 of file gamma_p.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::gamma_p (const stan::agrad::vara,
const double & b 
)
+
+inline
+
+ +

Definition at line 96 of file gamma_p.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::gamma_p (const double & a,
const stan::agrad::varb 
)
+
+inline
+
+ +

Definition at line 101 of file gamma_p.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::gamma_q (const fvar< T > & x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 15 of file gamma_q.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::gamma_q (const fvar< T > & x1,
const double x2 
)
+
+inline
+
+ +

Definition at line 51 of file gamma_q.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::gamma_q (const stan::agrad::vara,
const stan::agrad::varb 
)
+
+inline
+
+ +

Definition at line 61 of file gamma_q.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::gamma_q (const stan::agrad::vara,
const double & b 
)
+
+inline
+
+ +

Definition at line 66 of file gamma_q.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::gamma_q (const double & a,
const stan::agrad::varb 
)
+
+inline
+
+ +

Definition at line 71 of file gamma_q.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::gamma_q (const double x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 86 of file gamma_q.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
static void stan::agrad::grad (chainable * vi)
+
+static
+
+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::agrad::grad (var & v,
Eigen::Matrix< var, Eigen::Dynamic, 1 > & x,
Eigen::VectorXd & g 
)
+
+ +

Definition at line 13 of file grad.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
static void stan::agrad::grad (chainable * vi)
+
+static
+
+ +

Compute the gradient for all variables starting from the specified root variable implementation.

+

Does not recover memory. This chainable variable's adjoint is initialized using the method init_dependent() and then the chain rule is applied working down the stack from this chainable and calling each chainable's chain() method in turn.

+
Parameters
+ + +
viVariable implementation for root of partial derivative propagation.
+
+
+ +

Definition at line 106 of file chainable.hpp.

+ +
+
+ +
+
+
+template<typename F >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::agrad::grad_tr_mat_times_hessian (const F & f,
const Eigen::Matrix< double, Eigen::Dynamic, 1 > & x,
const Eigen::Matrix< double, Eigen::Dynamic, Eigen::Dynamic > & M,
Eigen::Matrix< double, Eigen::Dynamic, 1 > & grad_tr_MH 
)
+
+ +

Definition at line 272 of file autodiff.hpp.

+ +
+
+ +
+
+
+template<typename F >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::agrad::gradient (const F & f,
const Eigen::Matrix< double, Eigen::Dynamic, 1 > & x,
double & fx,
Eigen::Matrix< double, Eigen::Dynamic, 1 > & grad_fx 
)
+
+ +

Calculate the value and the gradient of the specified function at the specified argument.

+

The functor must implement

+

stan::agrad::var operator()(const Eigen::Matrix<stan::agrad::var,Eigen::Dynamic,1>&)

+

using only operations that are defined for stan::agrad::var. This latter constraint usually requires the functions to be defined in terms of the libraries defined in Stan or in terms of functions with appropriately general namespace imports that eventually depend on functions defined in Stan.

+

Time and memory usage is on the order of the size of the fully unfolded expression for the function applied to the argument, independently of dimension.

+
Template Parameters
+ + +
FType of function
+
+
+
Parameters
+ + + + + +
[in]fFunction
[in]xArgument to function
[out]fxFunction applied to argument
[out]grad_fxGradient of function at argument
+
+
+ +

Definition at line 71 of file autodiff.hpp.

+ +
+
+ +
+
+
+template<typename T , typename F >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::agrad::gradient (const F & f,
const Eigen::Matrix< T, Eigen::Dynamic, 1 > & x,
T & fx,
Eigen::Matrix< T, Eigen::Dynamic, 1 > & grad_fx 
)
+
+ +

Definition at line 90 of file autodiff.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , typename F >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::agrad::gradient_dot_vector (const F & f,
const Eigen::Matrix< T1, Eigen::Dynamic, 1 > & x,
const Eigen::Matrix< T2, Eigen::Dynamic, 1 > & v,
T1 & fx,
T1 & grad_fx_dot_v 
)
+
+ +

Definition at line 210 of file autodiff.hpp.

+ +
+
+ +
+
+
+template<class F >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
double stan::agrad::hessian (const F & f,
const std::vector< double > & x,
const std::vector< double > & v,
std::vector< double > & Hv 
)
+
+ +

Definition at line 20 of file hessian.hpp.

+ +
+
+ +
+
+
+template<typename F >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::agrad::hessian (const F & f,
const Eigen::Matrix< double, Eigen::Dynamic, 1 > & x,
double & fx,
Eigen::Matrix< double, Eigen::Dynamic, 1 > & grad,
Eigen::Matrix< double, Eigen::Dynamic, Eigen::Dynamic > & H 
)
+
+ +

Definition at line 159 of file autodiff.hpp.

+ +
+
+ +
+
+
+template<typename T , typename F >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::agrad::hessian (const F & f,
const Eigen::Matrix< T, Eigen::Dynamic, 1 > & x,
T & fx,
Eigen::Matrix< T, Eigen::Dynamic, 1 > & grad,
Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & H 
)
+
+ +

Definition at line 181 of file autodiff.hpp.

+ +
+
+ +
+
+
+template<typename F >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::agrad::hessian_times_vector (const F & f,
const Eigen::Matrix< double, Eigen::Dynamic, 1 > & x,
const Eigen::Matrix< double, Eigen::Dynamic, 1 > & v,
double & fx,
Eigen::Matrix< double, Eigen::Dynamic, 1 > & Hv 
)
+
+ +

Definition at line 232 of file autodiff.hpp.

+ +
+
+ +
+
+
+template<typename T , typename F >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::agrad::hessian_times_vector (const F & f,
const Eigen::Matrix< T, Eigen::Dynamic, 1 > & x,
const Eigen::Matrix< T, Eigen::Dynamic, 1 > & v,
T & fx,
Eigen::Matrix< T, Eigen::Dynamic, 1 > & Hv 
)
+
+ +

Definition at line 255 of file autodiff.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::hypot (const fvar< T > & x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 16 of file hypot.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::hypot (const fvar< T > & x1,
const double x2 
)
+
+inline
+
+ +

Definition at line 27 of file hypot.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::hypot (const double x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 37 of file hypot.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::hypot (const stan::agrad::vara,
const stan::agrad::varb 
)
+
+inline
+
+ +

Returns the length of the hypoteneuse of a right triangle with sides of the specified lengths (C99).

+

See boost::math::hypot() for double-based function.

+

The partial derivatives are given by

+

$\frac{\partial}{\partial x} \sqrt{x^2 + y^2} = \frac{x}{\sqrt{x^2 + y^2}}$, and

+

$\frac{\partial}{\partial y} \sqrt{x^2 + y^2} = \frac{y}{\sqrt{x^2 + y^2}}$.

+
Parameters
+ + + +
aLength of first side.
bLength of second side.
+
+
+
Returns
Length of hypoteneuse.
+ +

Definition at line 54 of file hypot.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::hypot (const stan::agrad::vara,
const double & b 
)
+
+inline
+
+ +

Returns the length of the hypoteneuse of a right triangle with sides of the specified lengths (C99).

+

See boost::math::hypot() for double-based function.

+

The derivative is

+

$\frac{d}{d x} \sqrt{x^2 + c^2} = \frac{x}{\sqrt{x^2 + c^2}}$.

+
Parameters
+ + + +
aLength of first side.
bLength of second side.
+
+
+
Returns
Length of hypoteneuse.
+ +

Definition at line 73 of file hypot.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::hypot (const double & a,
const stan::agrad::varb 
)
+
+inline
+
+ +

Returns the length of the hypoteneuse of a right triangle with sides of the specified lengths (C99).

+

See boost::math::hypot() for double-based function.

+

The derivative is

+

$\frac{d}{d y} \sqrt{c^2 + y^2} = \frac{y}{\sqrt{c^2 + y^2}}$.

+
Parameters
+ + + +
aLength of first side.
bLength of second side.
+
+
+
Returns
Length of hypoteneuse.
+ +

Definition at line 92 of file hypot.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
var stan::agrad::ibeta (const var & a,
const var & b,
const var & x 
)
+
+inline
+
+ +

The normalized incomplete beta function of a, b, and x.

+

Used to compute the cumulative density function for the beta distribution.

+

Partial derivatives are those specified by wolfram alpha. The values were checked using both finite differences and by independent code for calculating the derivatives found in JSS (paper by Boik and Robison-Cox).

+
Parameters
+ + + + +
aShape parameter.
bShape parameter.
xRandom variate.
+
+
+
Returns
The normalized incomplete beta function.
+ +

Definition at line 222 of file ibeta.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
var stan::agrad::if_else (bool c,
const var & y_true,
const var & y_false 
)
+
+inline
+
+ +

If the specified condition is true, return the first variable, otherwise return the second variable.

+
Parameters
+ + + + +
cBoolean condition.
y_trueVariable to return if condition is true.
y_falseVariable to return if condition is false.
+
+
+ +

Definition at line 17 of file if_else.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
var stan::agrad::if_else (bool c,
double y_true,
const var & y_false 
)
+
+inline
+
+ +

If the specified condition is true, return a new variable constructed from the first scalar, otherwise return the second variable.

+
Parameters
+ + + + +
cBoolean condition.
y_trueValue to promote to variable and return if condition is true.
y_falseVariable to return if condition is false.
+
+
+ +

Definition at line 29 of file if_else.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
var stan::agrad::if_else (bool c,
const var & y_true,
const double y_false 
)
+
+inline
+
+ +

If the specified condition is true, return the first variable, otherwise return a new variable constructed from the second scalar.

+
Parameters
+ + + + +
cBoolean condition.
y_trueVariable to return if condition is true.
y_falseValue to promote to variable and return if condition is false.
+
+
+ +

Definition at line 44 of file if_else.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::agrad::initialize_variable (var & variable,
const var & value 
)
+
+inline
+
+ +

Initialize variable to value.

+

(Function may look pointless, but its needed to bottom out recursion.)

+ +

Definition at line 15 of file initialize_variable.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::agrad::initialize_variable (Eigen::Matrix< var, R, C > & matrix,
const var & value 
)
+
+inline
+
+ +

Initialize every cell in the matrix to the specified value.

+ +

Definition at line 24 of file initialize_variable.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::agrad::initialize_variable (std::vector< T > & variables,
const var & value 
)
+
+inline
+
+ +

Initialize the variables in the standard vector recursively.

+ +

Definition at line 33 of file initialize_variable.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::inv (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 15 of file inv.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::inv (const var & a)
+
+inline
+
+ +

Definition at line 24 of file inv.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::inv_cloglog (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 15 of file inv_cloglog.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::inv_cloglog (const stan::agrad::vara)
+
+inline
+
+ +

Return the inverse complementary log-log function applied specified variable (stan).

+

See stan::math::inv_cloglog() for the double-based version.

+

The derivative is given by

+

$\frac{d}{dx} \mbox{cloglog}^{-1}(x) = \exp (x - \exp (x))$.

+
Parameters
+ + +
aVariable argument.
+
+
+
Returns
The inverse complementary log-log of the specified argument.
+ +

Definition at line 37 of file inv_cloglog.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::inv_logit (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 15 of file inv_logit.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::inv_logit (const stan::agrad::vara)
+
+inline
+
+ +

The inverse logit function for variables (stan).

+

See stan::math::inv_logit() for the double-based version.

+

The derivative of inverse logit is

+

$\frac{d}{dx} \mbox{logit}^{-1}(x) = \mbox{logit}^{-1}(x) (1 - \mbox{logit}^{-1}(x))$.

+
Parameters
+ + +
aArgument variable.
+
+
+
Returns
Inverse logit of argument.
+ +

Definition at line 35 of file inv_logit.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::inv_sqrt (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 15 of file inv_sqrt.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::inv_sqrt (const var & a)
+
+inline
+
+ +

Definition at line 24 of file inv_sqrt.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::inv_square (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 15 of file inv_square.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::inv_square (const var & a)
+
+inline
+
+ +

Definition at line 24 of file inv_square.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<fvar<T>,R,C> stan::agrad::inverse (const Eigen::Matrix< fvar< T >, R, C > & m)
+
+inline
+
+ +

Definition at line 21 of file inverse.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
bool stan::agrad::is_uninitialized (var x)
+
+inline
+
+ +

Returns true if the specified variable is uninitialized.

+

This overload of the stan::math::is_uninitialized() function delegates the return to the is_uninitialized() method on the specified variable.

+
Parameters
+ + +
xObject to test.
+
+
+
Returns
true if the specified object is uninitialized.
+ +

Definition at line 25 of file is_uninitialized.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::agrad::jacobian (std::vector< var > & dependents,
std::vector< var > & independents,
std::vector< std::vector< double > > & jacobian 
)
+
+inline
+
+ +

Return the Jacobian of the function producing the specified dependent variables with respect to the specified independent variables.

+

A typical use case would be to take the Jacobian of a function from independent variables to dependentant variables. For instance,

+
+std::vector<var> f(std::vector<var>& x) { ... }
+std::vector<var> x = ...;
+std::vector<var> y = f(x);
+std::vector<std::vector<double> > J;
+jacobian(y,x,J);
+

After executing this code, J will contain the Jacobian, stored as a standard vector of gradients. Specifically, J[m] will be the gradient of y[m] with respect to x, and thus J[m][n] will be dy[m]/dx[n].

+
Parameters
+ + + + +
[in]dependentsDependent (output) variables.
[in]independentsIndepent (input) variables.
[out]jacobianJacobian of the transform.
+
+
+ +

Definition at line 36 of file jacobian.hpp.

+ +
+
+ +
+
+
+template<typename F >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::agrad::jacobian (const F & f,
const Eigen::Matrix< double, Eigen::Dynamic, 1 > & x,
Eigen::Matrix< double, Eigen::Dynamic, 1 > & fx,
Eigen::Matrix< double, Eigen::Dynamic, Eigen::Dynamic > & J 
)
+
+ +

Definition at line 108 of file autodiff.hpp.

+ +
+
+ +
+
+
+template<typename T , typename F >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::agrad::jacobian (const F & f,
const Eigen::Matrix< T, Eigen::Dynamic, 1 > & x,
Eigen::Matrix< T, Eigen::Dynamic, 1 > & fx,
Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & J 
)
+
+ +

Definition at line 132 of file autodiff.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::lbeta (const fvar< T > & x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 16 of file lbeta.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::lbeta (const double x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 28 of file lbeta.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::lbeta (const fvar< T > & x1,
const double x2 
)
+
+inline
+
+ +

Definition at line 38 of file lbeta.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::lgamma (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 15 of file lgamma.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::lgamma (const stan::agrad::vara)
+
+inline
+
+ +

The log gamma function for variables (C99).

+

The derivatie is the digamma function,

+

$\frac{d}{dx} \Gamma(x) = \psi^{(0)}(x)$.

+
Parameters
+ + +
aThe variable.
+
+
+
Returns
Log gamma of the variable.
+ +

Definition at line 36 of file lgamma.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<typename stan::return_type<T,int>::type> stan::agrad::lmgamma (int x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 16 of file lmgamma.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::lmgamma (int a,
const stan::agrad::varb 
)
+
+inline
+
+ +

Definition at line 29 of file lmgamma.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::log (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 15 of file log.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::log (const var & a)
+
+inline
+
+ +

Return the natural log of the specified variable (cmath).

+

The derivative is defined by

+

$\frac{d}{dx} \log x = \frac{1}{x}$.

+
Parameters
+ + +
aVariable whose log is taken.
+
+
+
Returns
Natural log of variable.
+ +

Definition at line 1585 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::log10 (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 15 of file log10.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::log10 (const var & a)
+
+inline
+
+ +

Return the base 10 log of the specified variable (cmath).

+

The derivative is defined by

+

$\frac{d}{dx} \log_{10} x = \frac{1}{x \log 10}$.

+
Parameters
+ + +
aVariable whose log is taken.
+
+
+
Returns
Base 10 log of variable.
+ +

Definition at line 1599 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::log1m (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 16 of file log1m.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::log1m (const stan::agrad::vara)
+
+inline
+
+ +

The log (1 - x) function for variables.

+

The derivative is given by

+

$\frac{d}{dx} \log (1 - x) = -\frac{1}{1 - x}$.

+
Parameters
+ + +
aThe variable.
+
+
+
Returns
The variable representing log of 1 minus the variable.
+ +

Definition at line 33 of file log1m.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::log1m_exp (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 17 of file log1m_exp.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::log1m_exp (const stan::agrad::vara)
+
+inline
+
+ +

Return the log of 1 minus the exponential of the specified variable.

+ +

Definition at line 31 of file log1m_exp.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::log1m_inv_logit (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 15 of file log1m_inv_logit.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::log1p (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 16 of file log1p.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::log1p (const stan::agrad::vara)
+
+inline
+
+ +

The log (1 + x) function for variables (C99).

+

The derivative is given by

+

$\frac{d}{dx} \log (1 + x) = \frac{1}{1 + x}$.

+
Parameters
+ + +
aThe variable.
+
+
+
Returns
The log of 1 plus the variable.
+ +

Definition at line 35 of file log1p.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::log1p_exp (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 15 of file log1p_exp.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::log1p_exp (const stan::agrad::vara)
+
+inline
+
+ +

Return the log of 1 plus the exponential of the specified variable.

+ +

Definition at line 29 of file log1p_exp.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::log2 (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 17 of file log2.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::log2 (const stan::agrad::vara)
+
+inline
+
+ +

Returns the base 2 logarithm of the specified variable (C99).

+

See stan::math::log2() for the double-based version.

+

The derivative is

+

$\frac{d}{dx} \log_2 x = \frac{1}{x \log 2}$.

+
Parameters
+ + +
aSpecified variable.
+
+
+
Returns
Base 2 logarithm of the variable.
+ +

Definition at line 36 of file log2.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::log_determinant (const Eigen::Matrix< fvar< T >, R, C > & m)
+
+inline
+
+ +

Definition at line 19 of file log_determinant.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + + +
var stan::agrad::log_determinant (const Eigen::Matrix< var, R, C > & m)
+
+inline
+
+ +

Definition at line 70 of file log_determinant.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+ + + + + + + + +
var stan::agrad::log_determinant_ldlt (stan::math::LDLT_factor< var, R, C > & A)
+
+ +

Definition at line 305 of file ldlt.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + + +
var stan::agrad::log_determinant_spd (const Eigen::Matrix< var, R, C > & m)
+
+inline
+
+ +

Definition at line 117 of file log_determinant_spd.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::log_diff_exp (const fvar< T > & x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 14 of file log_diff_exp.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T2> stan::agrad::log_diff_exp (const T1 & x1,
const fvar< T2 > & x2 
)
+
+inline
+
+ +

Definition at line 25 of file log_diff_exp.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T1> stan::agrad::log_diff_exp (const fvar< T1 > & x1,
const T2 & x2 
)
+
+inline
+
+ +

Definition at line 36 of file log_diff_exp.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::log_diff_exp (const stan::agrad::vara,
const stan::agrad::varb 
)
+
+inline
+
+ +

Returns the log sum of exponentials.

+ +

Definition at line 55 of file log_diff_exp.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::log_diff_exp (const stan::agrad::vara,
const double & b 
)
+
+inline
+
+ +

Returns the log sum of exponentials.

+ +

Definition at line 62 of file log_diff_exp.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::log_diff_exp (const double & a,
const stan::agrad::varb 
)
+
+inline
+
+ +

Returns the log sum of exponentials.

+ +

Definition at line 69 of file log_diff_exp.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::log_falling_factorial (const fvar< T > & x,
const fvar< T > & n 
)
+
+inline
+
+ +

Definition at line 15 of file log_falling_factorial.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::log_falling_factorial (const double x,
const fvar< T > & n 
)
+
+inline
+
+ +

Definition at line 25 of file log_falling_factorial.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::log_falling_factorial (const fvar< T > & x,
const double n 
)
+
+inline
+
+ +

Definition at line 35 of file log_falling_factorial.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::log_falling_factorial (const var & a,
const double & b 
)
+
+inline
+
+ +

Definition at line 48 of file log_falling_factorial.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::log_falling_factorial (const var & a,
const var & b 
)
+
+inline
+
+ +

Definition at line 53 of file log_falling_factorial.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::log_falling_factorial (const double & a,
const var & b 
)
+
+inline
+
+ +

Definition at line 58 of file log_falling_factorial.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::log_inv_logit (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 15 of file log_inv_logit.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::log_rising_factorial (const fvar< T > & x,
const fvar< T > & n 
)
+
+inline
+
+ +

Definition at line 16 of file log_rising_factorial.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::log_rising_factorial (const fvar< T > & x,
const double n 
)
+
+inline
+
+ +

Definition at line 27 of file log_rising_factorial.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::log_rising_factorial (const double x,
const fvar< T > & n 
)
+
+inline
+
+ +

Definition at line 39 of file log_rising_factorial.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::log_rising_factorial (const var & a,
const double & b 
)
+
+inline
+
+ +

Definition at line 49 of file log_rising_factorial.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::log_rising_factorial (const var & a,
const var & b 
)
+
+inline
+
+ +

Definition at line 54 of file log_rising_factorial.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::log_rising_factorial (const double & a,
const var & b 
)
+
+inline
+
+ +

Definition at line 59 of file log_rising_factorial.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<fvar<T>,Eigen::Dynamic,1> stan::agrad::log_softmax (const Eigen::Matrix< fvar< T >, Eigen::Dynamic, 1 > & alpha)
+
+inline
+
+ +

Definition at line 16 of file log_softmax.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<var,Eigen::Dynamic,1> stan::agrad::log_softmax (const Eigen::Matrix< var, Eigen::Dynamic, 1 > & alpha)
+
+inline
+
+ +

Return the softmax of the specified Eigen vector.

+

Softmax is guaranteed to return a simplex.

+

The gradient calculations are unfolded.

+
Parameters
+ + +
alphaUnconstrained input vector.
+
+
+
Returns
Softmax of the input.
+
Exceptions
+ + +
std::domain_errorIf the input vector is size 0.
+
+
+ +

Definition at line 59 of file log_softmax.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::log_sum_exp (const fvar< T > & x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 15 of file log_sum_exp.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + + + + +
fvar<T> stan::agrad::log_sum_exp (const Eigen::Matrix< fvar< T >, R, C > & v)
+
+ +

Definition at line 17 of file log_sum_exp.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::log_sum_exp (const double x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 26 of file log_sum_exp.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::log_sum_exp (const fvar< T > & x1,
const double x2 
)
+
+inline
+
+ +

Definition at line 36 of file log_sum_exp.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + +
fvar<T> stan::agrad::log_sum_exp (const std::vector< fvar< T > > & v)
+
+ +

Definition at line 45 of file log_sum_exp.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + + +
var stan::agrad::log_sum_exp (const Eigen::Matrix< var, R, C > & x)
+
+inline
+
+ +

Returns the log sum of exponentials.

+
Parameters
+ + +
xmatrix
+
+
+ +

Definition at line 59 of file log_sum_exp.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::log_sum_exp (const stan::agrad::vara,
const stan::agrad::varb 
)
+
+inline
+
+ +

Returns the log sum of exponentials.

+ +

Definition at line 81 of file log_sum_exp.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::log_sum_exp (const stan::agrad::vara,
const double & b 
)
+
+inline
+
+ +

Returns the log sum of exponentials.

+ +

Definition at line 88 of file log_sum_exp.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::log_sum_exp (const double & a,
const stan::agrad::varb 
)
+
+inline
+
+ +

Returns the log sum of exponentials.

+ +

Definition at line 95 of file log_sum_exp.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::log_sum_exp (const std::vector< var > & x)
+
+inline
+
+ +

Returns the log sum of exponentials.

+ +

Definition at line 102 of file log_sum_exp.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::logit (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 17 of file logit.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>,R1,C2> stan::agrad::mdivide_left (const Eigen::Matrix< fvar< T >, R1, C1 > & A,
const Eigen::Matrix< fvar< T >, R2, C2 > & b 
)
+
+inline
+
+ +

Definition at line 25 of file mdivide_left.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>,R1,C2> stan::agrad::mdivide_left (const Eigen::Matrix< double, R1, C1 > & A,
const Eigen::Matrix< fvar< T >, R2, C2 > & b 
)
+
+inline
+
+ +

Definition at line 68 of file mdivide_left.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>,R1,C2> stan::agrad::mdivide_left (const Eigen::Matrix< fvar< T >, R1, C1 > & A,
const Eigen::Matrix< double, R2, C2 > & b 
)
+
+inline
+
+ +

Definition at line 93 of file mdivide_left.hpp.

+ +
+
+ +
+
+
+template<int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<var,R1,C2> stan::agrad::mdivide_left (const Eigen::Matrix< var, R1, C1 > & A,
const Eigen::Matrix< var, R2, C2 > & b 
)
+
+inline
+
+ +

Definition at line 264 of file mdivide_left.hpp.

+ +
+
+ +
+
+
+template<int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<var,R1,C2> stan::agrad::mdivide_left (const Eigen::Matrix< var, R1, C1 > & A,
const Eigen::Matrix< double, R2, C2 > & b 
)
+
+inline
+
+ +

Definition at line 287 of file mdivide_left.hpp.

+ +
+
+ +
+
+
+template<int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<var,R1,C2> stan::agrad::mdivide_left (const Eigen::Matrix< double, R1, C1 > & A,
const Eigen::Matrix< var, R2, C2 > & b 
)
+
+inline
+
+ +

Definition at line 310 of file mdivide_left.hpp.

+ +
+
+ +
+
+
+template<int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<var,R1,C2> stan::agrad::mdivide_left_ldlt (const stan::math::LDLT_factor< var, R1, C1 > & A,
const Eigen::Matrix< var, R2, C2 > & b 
)
+
+inline
+
+ +

Definition at line 311 of file ldlt.hpp.

+ +
+
+ +
+
+
+template<int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<var,R1,C2> stan::agrad::mdivide_left_ldlt (const stan::math::LDLT_factor< var, R1, C1 > & A,
const Eigen::Matrix< double, R2, C2 > & b 
)
+
+inline
+
+ +

Definition at line 329 of file ldlt.hpp.

+ +
+
+ +
+
+
+template<int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<var,R1,C2> stan::agrad::mdivide_left_ldlt (const stan::math::LDLT_factor< double, R1, C1 > & A,
const Eigen::Matrix< var, R2, C2 > & b 
)
+
+inline
+
+ +

Definition at line 347 of file ldlt.hpp.

+ +
+
+ +
+
+
+template<int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<var,R1,C2> stan::agrad::mdivide_left_spd (const Eigen::Matrix< var, R1, C1 > & A,
const Eigen::Matrix< var, R2, C2 > & b 
)
+
+inline
+
+ +

Definition at line 244 of file mdivide_left_spd.hpp.

+ +
+
+ +
+
+
+template<int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<var,R1,C2> stan::agrad::mdivide_left_spd (const Eigen::Matrix< var, R1, C1 > & A,
const Eigen::Matrix< double, R2, C2 > & b 
)
+
+inline
+
+ +

Definition at line 267 of file mdivide_left_spd.hpp.

+ +
+
+ +
+
+
+template<int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<var,R1,C2> stan::agrad::mdivide_left_spd (const Eigen::Matrix< double, R1, C1 > & A,
const Eigen::Matrix< var, R2, C2 > & b 
)
+
+inline
+
+ +

Definition at line 290 of file mdivide_left_spd.hpp.

+ +
+
+ +
+
+
+template<int TriView, int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<var,R1,C2> stan::agrad::mdivide_left_tri (const Eigen::Matrix< var, R1, C1 > & A,
const Eigen::Matrix< var, R2, C2 > & b 
)
+
+inline
+
+ +

Definition at line 296 of file mdivide_left_tri.hpp.

+ +
+
+ +
+
+
+template<int TriView, int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<var,R1,C2> stan::agrad::mdivide_left_tri (const Eigen::Matrix< double, R1, C1 > & A,
const Eigen::Matrix< var, R2, C2 > & b 
)
+
+inline
+
+ +

Definition at line 318 of file mdivide_left_tri.hpp.

+ +
+
+ +
+
+
+template<int TriView, int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<var,R1,C2> stan::agrad::mdivide_left_tri (const Eigen::Matrix< var, R1, C1 > & A,
const Eigen::Matrix< double, R2, C2 > & b 
)
+
+inline
+
+ +

Definition at line 340 of file mdivide_left_tri.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>,R1,C1> stan::agrad::mdivide_left_tri_low (const Eigen::Matrix< fvar< T >, R1, C1 > & A,
const Eigen::Matrix< fvar< T >, R2, C2 > & b 
)
+
+inline
+
+ +

Definition at line 21 of file mdivide_left_tri_low.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>,R1,C1> stan::agrad::mdivide_left_tri_low (const Eigen::Matrix< double, R1, C1 > & A,
const Eigen::Matrix< fvar< T >, R2, C2 > & b 
)
+
+inline
+
+ +

Definition at line 65 of file mdivide_left_tri_low.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>,R1,C1> stan::agrad::mdivide_left_tri_low (const Eigen::Matrix< fvar< T >, R1, C1 > & A,
const Eigen::Matrix< double, R2, C2 > & b 
)
+
+inline
+
+ +

Definition at line 104 of file mdivide_left_tri_low.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>,R1,C2> stan::agrad::mdivide_right (const Eigen::Matrix< fvar< T >, R1, C1 > & A,
const Eigen::Matrix< fvar< T >, R2, C2 > & b 
)
+
+inline
+
+ +

Definition at line 20 of file mdivide_right.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>,R1,C2> stan::agrad::mdivide_right (const Eigen::Matrix< fvar< T >, R1, C1 > & A,
const Eigen::Matrix< double, R2, C2 > & b 
)
+
+inline
+
+ +

Definition at line 63 of file mdivide_right.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>,R1,C2> stan::agrad::mdivide_right (const Eigen::Matrix< double, R1, C1 > & A,
const Eigen::Matrix< fvar< T >, R2, C2 > & b 
)
+
+inline
+
+ +

Definition at line 89 of file mdivide_right.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>,R1,C1> stan::agrad::mdivide_right_tri_low (const Eigen::Matrix< fvar< T >, R1, C1 > & A,
const Eigen::Matrix< fvar< T >, R2, C2 > & b 
)
+
+inline
+
+ +

Definition at line 21 of file mdivide_right_tri_low.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>,R1,C2> stan::agrad::mdivide_right_tri_low (const Eigen::Matrix< fvar< T >, R1, C1 > & A,
const Eigen::Matrix< double, R2, C2 > & b 
)
+
+inline
+
+ +

Definition at line 65 of file mdivide_right_tri_low.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>,R1,C2> stan::agrad::mdivide_right_tri_low (const Eigen::Matrix< double, R1, C1 > & A,
const Eigen::Matrix< fvar< T >, R2, C2 > & b 
)
+
+inline
+
+ +

Definition at line 99 of file mdivide_right_tri_low.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::modified_bessel_first_kind (int v,
const fvar< T > & z 
)
+
+inline
+
+ +

Definition at line 15 of file modified_bessel_first_kind.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::modified_bessel_first_kind (const int & v,
const var & a 
)
+
+inline
+
+ +

Definition at line 24 of file modified_bessel_first_kind.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::modified_bessel_second_kind (int v,
const fvar< T > & z 
)
+
+inline
+
+ +

Definition at line 15 of file modified_bessel_second_kind.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::modified_bessel_second_kind (const int & v,
const var & a 
)
+
+inline
+
+ +

Definition at line 24 of file modified_bessel_second_kind.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>,R1,C1> stan::agrad::multiply (const Eigen::Matrix< fvar< T >, R1, C1 > & m,
const fvar< T > & c 
)
+
+inline
+
+ +

Definition at line 21 of file multiply.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::enable_if_c< (boost::is_scalar<T1>::value || boost::is_same<T1,var>::value) && (boost::is_scalar<T2>::value || boost::is_same<T2,var>::value), typename boost::math::tools::promote_args<T1,T2>::type>::type stan::agrad::multiply (const T1 & v,
const T2 & c 
)
+
+inline
+
+ +

Return the product of two scalars.

+
Parameters
+ + + +
[in]vFirst scalar.
[in]cSpecified scalar.
+
+
+
Returns
Product of scalars.
+ +

Definition at line 32 of file multiply.hpp.

+ +
+
+ +
+
+
+template<typename T , int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>, R2, C2> stan::agrad::multiply (const Eigen::Matrix< fvar< T >, R2, C2 > & m,
const double c 
)
+
+inline
+
+ +

Definition at line 33 of file multiply.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<var,R2,C2> stan::agrad::multiply (const T1 & c,
const Eigen::Matrix< T2, R2, C2 > & m 
)
+
+inline
+
+ +

Return the product of scalar and matrix.

+
Parameters
+ + + +
[in]cSpecified scalar.
[in]mMatrix.
+
+
+
Returns
Product of scalar and matrix.
+ +

Definition at line 43 of file multiply.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>,R1,C1> stan::agrad::multiply (const Eigen::Matrix< double, R1, C1 > & m,
const fvar< T > & c 
)
+
+inline
+
+ +

Definition at line 46 of file multiply.hpp.

+ +
+
+ +
+
+
+template<typename T1 , int R1, int C1, typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<var,R1,C1> stan::agrad::multiply (const Eigen::Matrix< T1, R1, C1 > & m,
const T2 & c 
)
+
+inline
+
+ +

Return the product of scalar and matrix.

+
Parameters
+ + + +
[in]mMatrix.
[in]cSpecified scalar.
+
+
+
Returns
Product of scalar and matrix.
+ +

Definition at line 57 of file multiply.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>,R1,C1> stan::agrad::multiply (const fvar< T > & c,
const Eigen::Matrix< fvar< T >, R1, C1 > & m 
)
+
+inline
+
+ +

Definition at line 59 of file multiply.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>,R1,C1> stan::agrad::multiply (const double c,
const Eigen::Matrix< fvar< T >, R1, C1 > & m 
)
+
+inline
+
+ +

Definition at line 66 of file multiply.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>,R1,C1> stan::agrad::multiply (const fvar< T > & c,
const Eigen::Matrix< double, R1, C1 > & m 
)
+
+inline
+
+ +

Definition at line 73 of file multiply.hpp.

+ +
+
+ +
+
+
+template<typename T1 , int R1, int C1, typename T2 , int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::enable_if_c< boost::is_same<T1,var>::value || boost::is_same<T2,var>::value, Eigen::Matrix<var,R1,C2> >::type stan::agrad::multiply (const Eigen::Matrix< T1, R1, C1 > & m1,
const Eigen::Matrix< T2, R2, C2 > & m2 
)
+
+inline
+
+ +

Return the product of the specified matrices.

+

The number of columns in the first matrix must be the same as the number of rows in the second matrix.

+
Parameters
+ + + +
[in]m1First matrix.
[in]m2Second matrix.
+
+
+
Returns
The product of the first and second matrices.
+
Exceptions
+ + +
std::domain_errorif the number of columns of m1 does not match the number of rows of m2.
+
+
+ +

Definition at line 77 of file multiply.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>,R1,C2> stan::agrad::multiply (const Eigen::Matrix< fvar< T >, R1, C1 > & m1,
const Eigen::Matrix< fvar< T >, R2, C2 > & m2 
)
+
+inline
+
+ +

Definition at line 80 of file multiply.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>,R1,C2> stan::agrad::multiply (const Eigen::Matrix< fvar< T >, R1, C1 > & m1,
const Eigen::Matrix< double, R2, C2 > & m2 
)
+
+inline
+
+ +

Definition at line 97 of file multiply.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>,R1,C2> stan::agrad::multiply (const Eigen::Matrix< double, R1, C1 > & m1,
const Eigen::Matrix< fvar< T >, R2, C2 > & m2 
)
+
+inline
+
+ +

Definition at line 115 of file multiply.hpp.

+ +
+
+ +
+
+
+template<typename T1 , int C1, typename T2 , int R2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::enable_if_c< boost::is_same<T1,var>::value || boost::is_same<T2,var>::value, var >::type stan::agrad::multiply (const Eigen::Matrix< T1, 1, C1 > & rv,
const Eigen::Matrix< T2, R2, 1 > & v 
)
+
+inline
+
+ +

Return the scalar product of the specified row vector and specified column vector.

+

The return is the same as the dot product. The two vectors must be the same size.

+
Parameters
+ + + +
[in]rvRow vector.
[in]vColumn vector.
+
+
+
Returns
Scalar result of multiplying row vector by column vector.
+
Exceptions
+ + +
std::domain_errorif rv and v are not the same size
+
+
+ +

Definition at line 123 of file multiply.hpp.

+ +
+
+ +
+
+
+template<typename T , int C1, int R2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::multiply (const Eigen::Matrix< fvar< T >, 1, C1 > & rv,
const Eigen::Matrix< fvar< T >, R2, 1 > & v 
)
+
+inline
+
+ +

Definition at line 133 of file multiply.hpp.

+ +
+
+ +
+
+
+template<typename T , int C1, int R2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::multiply (const Eigen::Matrix< fvar< T >, 1, C1 > & rv,
const Eigen::Matrix< double, R2, 1 > & v 
)
+
+inline
+
+ +

Definition at line 143 of file multiply.hpp.

+ +
+
+ +
+
+
+template<typename T , int C1, int R2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::multiply (const Eigen::Matrix< double, 1, C1 > & rv,
const Eigen::Matrix< fvar< T >, R2, 1 > & v 
)
+
+inline
+
+ +

Definition at line 153 of file multiply.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::multiply_log (const fvar< T > & x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 15 of file multiply_log.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::multiply_log (const double x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 25 of file multiply_log.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::multiply_log (const fvar< T > & x1,
const double x2 
)
+
+inline
+
+ +

Definition at line 35 of file multiply_log.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::multiply_log (const var & a,
const var & b 
)
+
+inline
+
+ +

Return the value of a*log(b).

+

When both a and b are 0, the value returned is 0. The partial deriviative with respect to a is log(b). The partial deriviative with respect to b is a/b. When a and b are both 0, this is set to Inf.

+
Parameters
+ + + +
aFirst variable.
bSecond variable.
+
+
+
Returns
Value of a*log(b)
+ +

Definition at line 66 of file multiply_log.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::multiply_log (const var & a,
const double b 
)
+
+inline
+
+ +

Return the value of a*log(b).

+

When both a and b are 0, the value returned is 0. The partial deriviative with respect to a is log(b).

+
Parameters
+ + + +
aFirst variable.
bSecond scalar.
+
+
+
Returns
Value of a*log(b)
+ +

Definition at line 79 of file multiply_log.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::multiply_log (const double a,
const var & b 
)
+
+inline
+
+ +

Return the value of a*log(b).

+

When both a and b are 0, the value returned is 0. The partial deriviative with respect to b is a/b. When a and b are both 0, this is set to Inf.

+
Parameters
+ + + +
aFirst scalar.
bSecond variable.
+
+
+
Returns
Value of a*log(b)
+ +

Definition at line 93 of file multiply_log.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<fvar<T>,R,R> stan::agrad::multiply_lower_tri_self_transpose (const Eigen::Matrix< fvar< T >, R, C > & m)
+
+inline
+
+ +

Definition at line 17 of file multiply_lower_tri_self_transpose.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
matrix_v stan::agrad::multiply_lower_tri_self_transpose (const matrix_v & L)
+
+inline
+
+ +

Definition at line 21 of file multiply_lower_tri_self_transpose.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
bool stan::agrad::operator! (const var & a)
+
+inline
+
+ +

Prefix logical negation for the value of variables (C++).

+

The expression (!a) is equivalent to negating the scalar value of the variable a.

+

Note that this is the only logical operator defined for variables. Overridden logical conjunction (&&) and disjunction (||) operators do not apply the same "short circuit" rules as the built-in logical operators.

+
Parameters
+ + +
aVariable to negate.
+
+
+
Returns
True if variable is non-zero.
+ +

Definition at line 1265 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator!= (const fvar< T > & x,
const fvar< T > & y 
)
+
+inline
+
+ +

Definition at line 14 of file operator_not_equal.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator!= (const fvar< T > & x,
double y 
)
+
+inline
+
+ +

Definition at line 21 of file operator_not_equal.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator!= (double x,
const fvar< T > & y 
)
+
+inline
+
+ +

Definition at line 28 of file operator_not_equal.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator!= (const var & a,
const double b 
)
+
+inline
+
+ +

Inequality operator comparing a variable's value and a double (C++).

+
Parameters
+ + + +
aFirst variable.
bSecond value.
+
+
+
Returns
True if the first variable's value is not the same as the second value.
+ +

Definition at line 30 of file operator_not_equal.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator!= (const double a,
const var & b 
)
+
+inline
+
+ +

Inequality operator comparing a double and a variable's value (C++).

+
Parameters
+ + + +
aFirst value.
bSecond variable.
+
+
+
Returns
True if the first value is not the same as the second variable's value.
+ +

Definition at line 43 of file operator_not_equal.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator!= (const var & a,
const var & b 
)
+
+inline
+
+ +

Inequality operator comparing two variables' values (C++).

+
Parameters
+ + + +
aFirst variable.
bSecond variable.
+
+
+
Returns
True if the first variable's value is not the same as the second's.
+ +

Definition at line 1072 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator!= (const var & a,
const double & b 
)
+
+inline
+
+ +

Inequality operator comparing a variable's value and a double (C++).

+
Parameters
+ + + +
aFirst variable.
bSecond value.
+
+
+
Returns
True if the first variable's value is not the same as the second value.
+ +

Definition at line 1085 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator!= (const double & a,
const var & b 
)
+
+inline
+
+ +

Inequality operator comparing a double and a variable's value (C++).

+
Parameters
+ + + +
aFirst value.
bSecond variable.
+
+
+
Returns
True if the first value is not the same as the second variable's value.
+ +

Definition at line 1098 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::operator* (const fvar< T > & x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 14 of file operator_multiplication.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::operator* (const double x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 22 of file operator_multiplication.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::operator* (const fvar< T > & x1,
const double x2 
)
+
+inline
+
+ +

Definition at line 29 of file operator_multiplication.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::operator* (const var & a,
const double b 
)
+
+inline
+
+ +

Multiplication operator for a variable and a scalar (C++).

+

The partial derivative for the variable is

+

$\frac{\partial}{\partial x} (x * c) = c$, and

+
Parameters
+ + + +
aVariable operand.
bScalar operand.
+
+
+
Returns
Variable result of multiplying operands.
+ +

Definition at line 62 of file operator_multiplication.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::operator* (const double a,
const var & b 
)
+
+inline
+
+ +

Multiplication operator for a scalar and a variable (C++).

+

The partial derivative for the variable is

+

$\frac{\partial}{\partial y} (c * y) = c$.

+
Parameters
+ + + +
aScalar operand.
bVariable operand.
+
+
+
Returns
Variable result of multiplying the operands.
+ +

Definition at line 79 of file operator_multiplication.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::operator* (const var & a,
const var & b 
)
+
+inline
+
+ +

Multiplication operator for two variables (C++).

+

The partial derivatives are

+

$\frac{\partial}{\partial x} (x * y) = y$, and

+

$\frac{\partial}{\partial y} (x * y) = x$.

+
Parameters
+ + + +
aFirst variable operand.
bSecond variable operand.
+
+
+
Returns
Variable result of multiplying operands.
+ +

Definition at line 1411 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::operator* (const var & a,
const double & b 
)
+
+inline
+
+ +

Multiplication operator for a variable and a scalar (C++).

+

The partial derivative for the variable is

+

$\frac{\partial}{\partial x} (x * c) = c$, and

+
Parameters
+ + + +
aVariable operand.
bScalar operand.
+
+
+
Returns
Variable result of multiplying operands.
+ +

Definition at line 1426 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::operator* (const double & a,
const var & b 
)
+
+inline
+
+ +

Multiplication operator for a scalar and a variable (C++).

+

The partial derivative for the variable is

+

$\frac{\partial}{\partial y} (c * y) = c$.

+
Parameters
+ + + +
aScalar operand.
bVariable operand.
+
+
+
Returns
Variable result of multiplying the operands.
+ +

Definition at line 1441 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::operator+ (const fvar< T > & x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 14 of file operator_addition.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::operator+ (const double x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 21 of file operator_addition.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::operator+ (const fvar< T > & x1,
const double x2 
)
+
+inline
+
+ +

Definition at line 28 of file operator_addition.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::operator+ (const var & a,
const double b 
)
+
+inline
+
+ +

Addition operator for variable and scalar (C++).

+

The derivative with respect to the variable is

+

$\frac{d}{dx} (x + c) = 1$.

+
Parameters
+ + + +
aFirst variable operand.
bSecond scalar operand.
+
+
+
Returns
Result of adding variable and scalar.
+ +

Definition at line 62 of file operator_addition.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::operator+ (const double a,
const var & b 
)
+
+inline
+
+ +

Addition operator for scalar and variable (C++).

+

The derivative with respect to the variable is

+

$\frac{d}{dy} (c + y) = 1$.

+
Parameters
+ + + +
aFirst scalar operand.
bSecond variable operand.
+
+
+
Returns
Result of adding variable and scalar.
+ +

Definition at line 79 of file operator_addition.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::operator+ (const var & a)
+
+inline
+
+ +

Unary plus operator for variables (C++).

+

The function simply returns its input, because

+

$\frac{d}{dx} +x = \frac{d}{dx} x = 1$.

+

The effect of unary plus on a built-in C++ scalar type is integer promotion. Because variables are all double-precision floating point already, promotion is not necessary.

+
Parameters
+ + +
aArgument variable.
+
+
+
Returns
The input reference.
+ +

Definition at line 1286 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::operator+ (const var & a,
const var & b 
)
+
+inline
+
+ +

Addition operator for variables (C++).

+

The partial derivatives are defined by

+

$\frac{\partial}{\partial x} (x+y) = 1$, and

+

$\frac{\partial}{\partial y} (x+y) = 1$.

+
Parameters
+ + + +
aFirst variable operand.
bSecond variable operand.
+
+
+
Returns
Variable result of adding two variables.
+ +

Definition at line 1315 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::operator+ (const var & a,
const double & b 
)
+
+inline
+
+ +

Addition operator for variable and scalar (C++).

+

The derivative with respect to the variable is

+

$\frac{d}{dx} (x + c) = 1$.

+
Parameters
+ + + +
aFirst variable operand.
bSecond scalar operand.
+
+
+
Returns
Result of adding variable and scalar.
+ +

Definition at line 1331 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::operator+ (const double & a,
const var & b 
)
+
+inline
+
+ +

Addition operator for scalar and variable (C++).

+

The derivative with respect to the variable is

+

$\frac{d}{dy} (c + y) = 1$.

+
Parameters
+ + + +
aFirst scalar operand.
bSecond variable operand.
+
+
+
Returns
Result of adding variable and scalar.
+ +

Definition at line 1346 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var & stan::agrad::operator++ (var & a)
+
+inline
+
+ +

Prefix increment operator for variables (C++).

+

Following C++, (++a) is defined to behave exactly as (a = a + 1.0) does, but is faster and uses less memory. In particular, the result is an assignable lvalue.

+
Parameters
+ + +
aVariable to increment.
+
+
+
Returns
Reference the result of incrementing this input variable.
+ +

Definition at line 1502 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::operator++ (var & a,
int  
)
+
+inline
+
+ +

Postfix increment operator for variables (C++).

+

Following C++, the expression (a++) i s defined to behave like the sequence of operations

+

var temp = a; a = a + 1.0; return temp;

+
Parameters
+ + + +
aVariable to increment.
dummyUnused dummy variable used to distinguish postfix operator from prefix operator.
+
+
+
Returns
Input variable.
+

Following C++, the expression (a++) is defined to behave like the sequence of operations

+

var temp = a; a = a + 1.0; return temp;

+
Parameters
+ + +
aVariable to increment.
+
+
+
Returns
Input variable.
+ +

Definition at line 1520 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::operator- (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 14 of file operator_unary_minus.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::operator- (const fvar< T > & x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 14 of file operator_subtraction.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::operator- (const double x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 21 of file operator_subtraction.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::operator- (const fvar< T > & x1,
const double x2 
)
+
+inline
+
+ +

Definition at line 28 of file operator_subtraction.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::operator- (const var & a,
const double b 
)
+
+inline
+
+ +

Subtraction operator for variable and scalar (C++).

+

The derivative for the variable is

+

$\frac{\partial}{\partial x} (x-c) = 1$, and

+
Parameters
+ + + +
aFirst variable operand.
bSecond scalar operand.
+
+
+
Returns
Result of subtracting the scalar from the variable.
+ +

Definition at line 74 of file operator_subtraction.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::operator- (const double a,
const var & b 
)
+
+inline
+
+ +

Subtraction operator for scalar and variable (C++).

+

The derivative for the variable is

+

$\frac{\partial}{\partial y} (c-y) = -1$, and

+
Parameters
+ + + +
aFirst scalar operand.
bSecond variable operand.
+
+
+
Returns
Result of sutracting a variable from a scalar.
+ +

Definition at line 91 of file operator_subtraction.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::operator- (const var & a)
+
+inline
+
+ +

Unary negation operator for variables (C++).

+

$\frac{d}{dx} -x = -1$.

+
Parameters
+ + +
aArgument variable.
+
+
+
Returns
Negation of variable.
+ +

Definition at line 1298 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::operator- (const var & a,
const var & b 
)
+
+inline
+
+ +

Subtraction operator for variables (C++).

+

The partial derivatives are defined by

+

$\frac{\partial}{\partial x} (x-y) = 1$, and

+

$\frac{\partial}{\partial y} (x-y) = -1$.

+
Parameters
+ + + +
aFirst variable operand.
bSecond variable operand.
+
+
+
Returns
Variable result of subtracting the second variable from the first.
+ +

Definition at line 1364 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::operator- (const var & a,
const double & b 
)
+
+inline
+
+ +

Subtraction operator for variable and scalar (C++).

+

The derivative for the variable is

+

$\frac{\partial}{\partial x} (x-c) = 1$, and

+
Parameters
+ + + +
aFirst variable operand.
bSecond scalar operand.
+
+
+
Returns
Result of subtracting the scalar from the variable.
+ +

Definition at line 1379 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::operator- (const double & a,
const var & b 
)
+
+inline
+
+ +

Subtraction operator for scalar and variable (C++).

+

The derivative for the variable is

+

$\frac{\partial}{\partial y} (c-y) = -1$, and

+
Parameters
+ + + +
aFirst scalar operand.
bSecond variable operand.
+
+
+
Returns
Result of sutracting a variable from a scalar.
+ +

Definition at line 1394 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var & stan::agrad::operator-- (var & a)
+
+inline
+
+ +

Prefix decrement operator for variables (C++).

+

Following C++, (–a) is defined to behave exactly as

+

a = a - 1.0)

+

does, but is faster and uses less memory. In particular, the result is an assignable lvalue.

+
Parameters
+ + +
aVariable to decrement.
+
+
+
Returns
Reference the result of decrementing this input variable.
+ +

Definition at line 1539 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::operator-- (var & a,
int  
)
+
+inline
+
+ +

Postfix decrement operator for variables (C++).

+

Following C++, the expression (a–) is defined to behave like the sequence of operations

+

var temp = a; a = a - 1.0; return temp;

+
Parameters
+ + + +
aVariable to decrement.
dummyUnused dummy variable used to distinguish suffix operator from prefix operator.
+
+
+
Returns
Input variable.
+

Following C++, the expression (a–) is defined to behave like the sequence of operations

+

var temp = a; a = a - 1.0; return temp;

+
Parameters
+ + +
aVariable to decrement.
+
+
+
Returns
Input variable.
+ +

Definition at line 1557 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::operator/ (const fvar< T > & x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 14 of file operator_division.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::operator/ (const fvar< T > & x1,
const double x2 
)
+
+inline
+
+ +

Definition at line 22 of file operator_division.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::operator/ (const double x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 30 of file operator_division.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>,R,C> stan::agrad::operator/ (const Eigen::Matrix< fvar< T >, R, C > & v,
const fvar< T > & c 
)
+
+inline
+
+ +

Definition at line 58 of file divide.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>,R,C> stan::agrad::operator/ (const Eigen::Matrix< fvar< T >, R, C > & v,
const double c 
)
+
+inline
+
+ +

Definition at line 64 of file divide.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>,R,C> stan::agrad::operator/ (const Eigen::Matrix< double, R, C > & v,
const fvar< T > & c 
)
+
+inline
+
+ +

Definition at line 70 of file divide.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::operator/ (const var & a,
const double b 
)
+
+inline
+
+ +

Division operator for dividing a variable by a scalar (C++).

+

The derivative with respect to the variable is

+

$\frac{\partial}{\partial x} (x/c) = 1/c$.

+
Parameters
+ + + +
aVariable operand.
bScalar operand.
+
+
+
Returns
Variable result of dividing the variable by the scalar.
+ +

Definition at line 75 of file operator_division.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::operator/ (const double a,
const var & b 
)
+
+inline
+
+ +

Division operator for dividing a scalar by a variable (C++).

+

The derivative with respect to the variable is

+

$\frac{d}{d y} (c/y) = -c / y^2$.

+
Parameters
+ + + +
aScalar operand.
bVariable operand.
+
+
+
Returns
Variable result of dividing the scalar by the variable.
+ +

Definition at line 92 of file operator_division.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::operator/ (const var & a,
const var & b 
)
+
+inline
+
+ +

Division operator for two variables (C++).

+

The partial derivatives for the variables are

+

$\frac{\partial}{\partial x} (x/y) = 1/y$, and

+

$\frac{\partial}{\partial y} (x/y) = -x / y^2$.

+
Parameters
+ + + +
aFirst variable operand.
bSecond variable operand.
+
+
+
Returns
Variable result of dividing the first variable by the second.
+ +

Definition at line 1459 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::operator/ (const var & a,
const double & b 
)
+
+inline
+
+ +

Division operator for dividing a variable by a scalar (C++).

+

The derivative with respect to the variable is

+

$\frac{\partial}{\partial x} (x/c) = 1/c$.

+
Parameters
+ + + +
aVariable operand.
bScalar operand.
+
+
+
Returns
Variable result of dividing the variable by the scalar.
+ +

Definition at line 1474 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::operator/ (const double & a,
const var & b 
)
+
+inline
+
+ +

Division operator for dividing a scalar by a variable (C++).

+

The derivative with respect to the variable is

+

$\frac{d}{d y} (c/y) = -c / y^2$.

+
Parameters
+ + + +
aScalar operand.
bVariable operand.
+
+
+
Returns
Variable result of dividing the scalar by the variable.
+ +

Definition at line 1489 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator< (const fvar< T > & x,
double y 
)
+
+inline
+
+ +

Definition at line 12 of file operator_less_than.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator< (double x,
const fvar< T > & y 
)
+
+inline
+
+ +

Definition at line 18 of file operator_less_than.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator< (const fvar< T > & x,
const fvar< T > & y 
)
+
+inline
+
+ +

Definition at line 24 of file operator_less_than.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator< (const var & a,
const double b 
)
+
+inline
+
+ +

Less than operator comparing variable's value and a double (C++).

+
Parameters
+ + + +
aFirst variable.
bSecond value.
+
+
+
Returns
True if first variable's value is less than second value.
+ +

Definition at line 28 of file operator_less_than.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator< (const double a,
const var & b 
)
+
+inline
+
+ +

Less than operator comparing a double and variable's value (C++).

+
Parameters
+ + + +
aFirst value.
bSecond variable.
+
+
+
Returns
True if first value is less than second variable's value.
+ +

Definition at line 40 of file operator_less_than.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator< (const var & a,
const var & b 
)
+
+inline
+
+ +

Less than operator comparing variables' values (C++).

+
Parameters
+ + + +
aFirst variable.
bSecond variable.
+
+
+
Returns
True if first variable's value is less than second's.
+ +

Definition at line 1109 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator< (const var & a,
const double & b 
)
+
+inline
+
+ +

Less than operator comparing variable's value and a double (C++).

+
Parameters
+ + + +
aFirst variable.
bSecond value.
+
+
+
Returns
True if first variable's value is less than second value.
+ +

Definition at line 1121 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator< (const double & a,
const var & b 
)
+
+inline
+
+ +

Less than operator comparing a double and variable's value (C++).

+
Parameters
+ + + +
aFirst value.
bSecond variable.
+
+
+
Returns
True if first value is less than second variable's value.
+ +

Definition at line 1133 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator<= (const fvar< T > & x,
const fvar< T > & y 
)
+
+inline
+
+ +

Definition at line 14 of file operator_less_than_or_equal.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator<= (const fvar< T > & x,
double y 
)
+
+inline
+
+ +

Definition at line 21 of file operator_less_than_or_equal.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator<= (double x,
const fvar< T > & y 
)
+
+inline
+
+ +

Definition at line 28 of file operator_less_than_or_equal.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator<= (const var & a,
const double b 
)
+
+inline
+
+ +

Less than or equal operator comparing a variable's value and a scalar (C++).

+
Parameters
+ + + +
aFirst variable.
bSecond value.
+
+
+
Returns
True if first variable's value is less than or equal to the second value.
+ +

Definition at line 31 of file operator_less_than_or_equal.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator<= (const double a,
const var & b 
)
+
+inline
+
+ +

Less than or equal operator comparing a double and variable's value (C++).

+
Parameters
+ + + +
aFirst value.
bSecond variable.
+
+
+
Returns
True if first value is less than or equal to the second variable's value.
+ +

Definition at line 44 of file operator_less_than_or_equal.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator<= (const var & a,
const var & b 
)
+
+inline
+
+ +

Less than or equal operator comparing two variables' values (C++).

+
Parameters
+ + + +
aFirst variable.
bSecond variable.
+
+
+
Returns
True if first variable's value is less than or equal to the second's.
+ +

Definition at line 1181 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator<= (const var & a,
const double & b 
)
+
+inline
+
+ +

Less than or equal operator comparing a variable's value and a scalar (C++).

+
Parameters
+ + + +
aFirst variable.
bSecond value.
+
+
+
Returns
True if first variable's value is less than or equal to the second value.
+ +

Definition at line 1194 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator<= (const double & a,
const var & b 
)
+
+inline
+
+ +

Less than or equal operator comparing a double and variable's value (C++).

+
Parameters
+ + + +
aFirst value.
bSecond variable.
+
+
+
Returns
True if first value is less than or equal to the second variable's value.
+ +

Definition at line 1207 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator== (const fvar< T > & x,
const fvar< T > & y 
)
+
+inline
+
+ +

Definition at line 14 of file operator_equal.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator== (const fvar< T > & x,
double y 
)
+
+inline
+
+ +

Definition at line 21 of file operator_equal.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator== (double x,
const fvar< T > & y 
)
+
+inline
+
+ +

Definition at line 28 of file operator_equal.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator== (const var & a,
const double b 
)
+
+inline
+
+ +

Equality operator comparing a variable's value and a double (C++).

+
Parameters
+ + + +
aFirst variable.
bSecond value.
+
+
+
Returns
True if the first variable's value is the same as the second value.
+ +

Definition at line 30 of file operator_equal.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator== (const double a,
const var & b 
)
+
+inline
+
+ +

Equality operator comparing a scalar and a variable's value (C++).

+
Parameters
+ + + +
aFirst scalar.
bSecond variable.
+
+
+
Returns
True if the variable's value is equal to the scalar.
+ +

Definition at line 42 of file operator_equal.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator== (const var & a,
const var & b 
)
+
+inline
+
+ +

Equality operator comparing two variables' values (C++).

+
Parameters
+ + + +
aFirst variable.
bSecond variable.
+
+
+
Returns
True if the first variable's value is the same as the second's.
+ +

Definition at line 1035 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator== (const var & a,
const double & b 
)
+
+inline
+
+ +

Equality operator comparing a variable's value and a double (C++).

+
Parameters
+ + + +
aFirst variable.
bSecond value.
+
+
+
Returns
True if the first variable's value is the same as the second value.
+ +

Definition at line 1048 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator== (const double & a,
const var & b 
)
+
+inline
+
+ +

Equality operator comparing a scalar and a variable's value (C++).

+
Parameters
+ + + +
aFirst scalar.
bSecond variable.
+
+
+
Returns
True if the variable's value is equal to the scalar.
+ +

Definition at line 1060 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator> (const fvar< T > & x,
const fvar< T > & y 
)
+
+inline
+
+ +

Definition at line 14 of file operator_greater_than.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator> (const fvar< T > & x,
double y 
)
+
+inline
+
+ +

Definition at line 21 of file operator_greater_than.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator> (double x,
const fvar< T > & y 
)
+
+inline
+
+ +

Definition at line 28 of file operator_greater_than.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator> (const var & a,
const double b 
)
+
+inline
+
+ +

Greater than operator comparing variable's value and double (C++).

+
Parameters
+ + + +
aFirst variable.
bSecond value.
+
+
+
Returns
True if first variable's value is greater than second value.
+ +

Definition at line 28 of file operator_greater_than.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator> (const double a,
const var & b 
)
+
+inline
+
+ +

Greater than operator comparing a double and a variable's value (C++).

+
Parameters
+ + + +
aFirst value.
bSecond variable.
+
+
+
Returns
True if first value is greater than second variable's value.
+ +

Definition at line 40 of file operator_greater_than.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator> (const var & a,
const var & b 
)
+
+inline
+
+ +

Greater than operator comparing variables' values (C++).

+
Parameters
+ + + +
aFirst variable.
bSecond variable.
+
+
+
Returns
True if first variable's value is greater than second's.
+ +

Definition at line 1144 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator> (const var & a,
const double & b 
)
+
+inline
+
+ +

Greater than operator comparing variable's value and double (C++).

+
Parameters
+ + + +
aFirst variable.
bSecond value.
+
+
+
Returns
True if first variable's value is greater than second value.
+ +

Definition at line 1156 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator> (const double & a,
const var & b 
)
+
+inline
+
+ +

Greater than operator comparing a double and a variable's value (C++).

+
Parameters
+ + + +
aFirst value.
bSecond variable.
+
+
+
Returns
True if first value is greater than second variable's value.
+ +

Definition at line 1168 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator>= (const fvar< T > & x,
const fvar< T > & y 
)
+
+inline
+
+ +

Definition at line 14 of file operator_greater_than_or_equal.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator>= (const fvar< T > & x,
double y 
)
+
+inline
+
+ +

Definition at line 21 of file operator_greater_than_or_equal.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator>= (double x,
const fvar< T > & y 
)
+
+inline
+
+ +

Definition at line 28 of file operator_greater_than_or_equal.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator>= (const var & a,
const double b 
)
+
+inline
+
+ +

Greater than or equal operator comparing variable's value and double (C++).

+
Parameters
+ + + +
aFirst variable.
bSecond value.
+
+
+
Returns
True if first variable's value is greater than or equal to second value.
+ +

Definition at line 31 of file operator_greater_than_or_equal.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator>= (const double a,
const var & b 
)
+
+inline
+
+ +

Greater than or equal operator comparing double and variable's value (C++).

+
Parameters
+ + + +
aFirst value.
bSecond variable.
+
+
+
Returns
True if the first value is greater than or equal to the second variable's value.
+ +

Definition at line 44 of file operator_greater_than_or_equal.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator>= (const var & a,
const var & b 
)
+
+inline
+
+ +

Greater than or equal operator comparing two variables' values (C++).

+
Parameters
+ + + +
aFirst variable.
bSecond variable.
+
+
+
Returns
True if first variable's value is greater than or equal to the second's.
+ +

Definition at line 1220 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator>= (const var & a,
const double & b 
)
+
+inline
+
+ +

Greater than or equal operator comparing variable's value and double (C++).

+
Parameters
+ + + +
aFirst variable.
bSecond value.
+
+
+
Returns
True if first variable's value is greater than or equal to second value.
+ +

Definition at line 1233 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::agrad::operator>= (const double & a,
const var & b 
)
+
+inline
+
+ +

Greater than or equal operator comparing double and variable's value (C++).

+
Parameters
+ + + +
aFirst value.
bSecond variable.
+
+
+
Returns
True if the first value is greater than or equal to the second variable's value.
+ +

Definition at line 1246 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::owens_t (const fvar< T > & x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 15 of file owens_t.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::owens_t (const double x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 35 of file owens_t.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::owens_t (const fvar< T > & x1,
const double x2 
)
+
+inline
+
+ +

Definition at line 52 of file owens_t.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::owens_t (const var & h,
const var & a 
)
+
+inline
+
+ +

The Owen's T function of h and a.

+

Used to compute the cumulative density function for the skew normal distribution.

+
Parameters
+ + + +
hvar parameter.
avar parameter.
+
+
+
Returns
The Owen's T function.
+ +

Definition at line 60 of file owens_t.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::owens_t (const var & h,
const double & a 
)
+
+inline
+
+ +

The Owen's T function of h and a.

+

Used to compute the cumulative density function for the skew normal distribution.

+
Parameters
+ + + +
hvar parameter.
adouble parameter.
+
+
+
Returns
The Owen's T function.
+ +

Definition at line 76 of file owens_t.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::owens_t (const double & h,
const var & a 
)
+
+inline
+
+ +

The Owen's T function of h and a.

+

Used to compute the cumulative density function for the skew normal distribution.

+
Parameters
+ + + +
hdouble parameter.
avar parameter.
+
+
+
Returns
The Owen's T function.
+ +

Definition at line 92 of file owens_t.hpp.

+ +
+
+ +
+
+
+template<typename T , typename F >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::agrad::partial_derivative (const F & f,
const Eigen::Matrix< T, Eigen::Dynamic, 1 > & x,
int n,
T & fx,
T & dfx_dxn 
)
+
+ +

Definition at line 27 of file autodiff.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::Phi (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 14 of file Phi.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::Phi (const stan::agrad::vara)
+
+inline
+
+ +

The unit normal cumulative density function for variables (stan).

+

See stan::math::Phi() for the double-based version.

+

The derivative is the unit normal density function,

+

$\frac{d}{dx} \Phi(x) = \mbox{\sf Norm}(x|0,1) = \frac{1}{\sqrt{2\pi}} \exp(-\frac{1}{2} x^2)$.

+
Parameters
+ + +
aVariable argument.
+
+
+
Returns
The unit normal cdf evaluated at the specified argument.
+ +

Definition at line 37 of file Phi.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::Phi_approx (const stan::agrad::vara)
+
+inline
+
+ +

Approximation of the unit normal CDF for variables (stan).

+

http://www.jiem.org/index.php/jiem/article/download/60/27

+
Parameters
+ + +
aVariable argument.
+
+
+
Returns
The corresponding unit normal cdf approximation.
+ +

Definition at line 19 of file Phi_approx.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::pow (const fvar< T > & x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 17 of file pow.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::pow (const double x1,
const fvar< T > & x2 
)
+
+inline
+
+ +

Definition at line 29 of file pow.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::pow (const fvar< T > & x1,
const double x2 
)
+
+inline
+
+ +

Definition at line 39 of file pow.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::pow (const var & base,
const double exponent 
)
+
+inline
+
+ +

Return the base variable raised to the power of the exponent scalar (cmath).

+

The derivative for the variable is

+

$\frac{d}{dx} \mbox{pow}(x,c) = c x^{c-1}$.

+
Parameters
+ + + +
baseBase variable.
exponentExponent scalar.
+
+
+
Returns
Base raised to the exponent.
+ +

Definition at line 80 of file pow.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::pow (const double base,
const var & exponent 
)
+
+inline
+
+ +

Return the base scalar raised to the power of the exponent variable (cmath).

+

The derivative for the variable is

+

$\frac{d}{d y} \mbox{pow}(c,y) = c^y \log c $.

+
Parameters
+ + + +
baseBase scalar.
exponentExponent variable.
+
+
+
Returns
Base raised to the exponent.
+ +

Definition at line 102 of file pow.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::pow (const var & base,
const var & exponent 
)
+
+inline
+
+ +

Return the base raised to the power of the exponent (cmath).

+

The partial derivatives are

+

$\frac{\partial}{\partial x} \mbox{pow}(x,y) = y x^{y-1}$, and

+

$\frac{\partial}{\partial y} \mbox{pow}(x,y) = x^y \ \log x$.

+
Parameters
+ + + +
baseBase variable.
exponentExponent variable.
+
+
+
Returns
Base raised to the exponent.
+ +

Definition at line 1633 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::pow (const var & base,
const double & exponent 
)
+
+inline
+
+ +

Return the base variable raised to the power of the exponent scalar (cmath).

+

The derivative for the variable is

+

$\frac{d}{dx} \mbox{pow}(x,c) = c x^{c-1}$.

+
Parameters
+ + + +
baseBase variable.
exponentExponent scalar.
+
+
+
Returns
Base raised to the exponent.
+ +

Definition at line 1649 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::pow (const double & base,
const var & exponent 
)
+
+inline
+
+ +

Return the base scalar raised to the power of the exponent variable (cmath).

+

The derivative for the variable is

+

$\frac{d}{d y} \mbox{pow}(c,y) = c^y \log c $.

+
Parameters
+ + + +
baseBase scalar.
exponentExponent variable.
+
+
+
Returns
Base raised to the exponent.
+ +

Definition at line 1665 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::agrad::print_stack (std::ostream & o)
+
+inline
+
+ +

Prints the auto-dif variable stack.

+

This function is used for debugging purposes.

+

Only works if all members of stack are vari* as it casts to vari*.

+
Parameters
+ + +
oostream to modify
+
+
+ +

Definition at line 20 of file print_stack.hpp.

+ +
+
+ +
+
+
+template<typename TA , int RA, int CA, typename TB , int RB, int CB>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::enable_if_c< boost::is_same<TA,var>::value || boost::is_same<TB,var>::value, Eigen::Matrix<var,CB,CB> >::type stan::agrad::quad_form (const Eigen::Matrix< TA, RA, CA > & A,
const Eigen::Matrix< TB, RB, CB > & B 
)
+
+inline
+
+ +

Definition at line 129 of file quad_form.hpp.

+ +
+
+ +
+
+
+template<typename TA , int RA, int CA, typename TB , int RB>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::enable_if_c< boost::is_same<TA,var>::value || boost::is_same<TB,var>::value, var >::type stan::agrad::quad_form (const Eigen::Matrix< TA, RA, CA > & A,
const Eigen::Matrix< TB, RB, 1 > & B 
)
+
+inline
+
+ +

Definition at line 144 of file quad_form.hpp.

+ +
+
+ +
+
+
+template<typename TA , int RA, int CA, typename TB , int RB, int CB>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::enable_if_c< boost::is_same<TA,var>::value || boost::is_same<TB,var>::value, Eigen::Matrix<var,CB,CB> >::type stan::agrad::quad_form_sym (const Eigen::Matrix< TA, RA, CA > & A,
const Eigen::Matrix< TB, RB, CB > & B 
)
+
+inline
+
+ +

Definition at line 160 of file quad_form.hpp.

+ +
+
+ +
+
+
+template<typename TA , int RA, int CA, typename TB , int RB>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::enable_if_c< boost::is_same<TA,var>::value || boost::is_same<TB,var>::value, var >::type stan::agrad::quad_form_sym (const Eigen::Matrix< TA, RA, CA > & A,
const Eigen::Matrix< TB, RB, 1 > & B 
)
+
+inline
+
+ +

Definition at line 176 of file quad_form.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
static void stan::agrad::recover_memory ()
+
+static
+
+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
static void stan::agrad::recover_memory ()
+
+static
+
+ +

Recover memory used for all variables for reuse.

+ +

Definition at line 37 of file var_stack.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::rising_factorial (const fvar< T > & x,
const fvar< T > & n 
)
+
+inline
+
+ +

Definition at line 16 of file rising_factorial.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::rising_factorial (const fvar< T > & x,
const double n 
)
+
+inline
+
+ +

Definition at line 28 of file rising_factorial.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fvar<T> stan::agrad::rising_factorial (const double x,
const fvar< T > & n 
)
+
+inline
+
+ +

Definition at line 40 of file rising_factorial.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::rising_factorial (const var & a,
const double & b 
)
+
+inline
+
+ +

Definition at line 48 of file rising_factorial.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::rising_factorial (const var & a,
const var & b 
)
+
+inline
+
+ +

Definition at line 53 of file rising_factorial.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::rising_factorial (const double & a,
const var & b 
)
+
+inline
+
+ +

Definition at line 58 of file rising_factorial.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::round (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 15 of file round.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::round (const stan::agrad::vara)
+
+inline
+
+ +

Returns the rounded form of the specified variable (C99).

+

See boost::math::round() for the double-based version.

+

The derivative is zero everywhere but numbers half way between whole numbers, so for convenience the derivative is defined to be everywhere zero,

+

$\frac{d}{dx} \mbox{round}(x) = 0$.

+
Parameters
+ + +
aSpecified variable.
+
+
+
Returns
Rounded variable.
+ +

Definition at line 35 of file round.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>, R1, 1> stan::agrad::rows_dot_product (const Eigen::Matrix< fvar< T >, R1, C1 > & v1,
const Eigen::Matrix< fvar< T >, R2, C2 > & v2 
)
+
+inline
+
+ +

Definition at line 19 of file rows_dot_product.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>, R1, 1> stan::agrad::rows_dot_product (const Eigen::Matrix< double, R1, C1 > & v1,
const Eigen::Matrix< fvar< T >, R2, C2 > & v2 
)
+
+inline
+
+ +

Definition at line 34 of file rows_dot_product.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>, R1, 1> stan::agrad::rows_dot_product (const Eigen::Matrix< fvar< T >, R1, C1 > & v1,
const Eigen::Matrix< double, R2, C2 > & v2 
)
+
+inline
+
+ +

Definition at line 50 of file rows_dot_product.hpp.

+ +
+
+ +
+
+
+template<typename T1 , int R1, int C1, typename T2 , int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::enable_if_c<boost::is_same<T1,var>::value || boost::is_same<T2,var>::value, Eigen::Matrix<var, R1, 1> >::type stan::agrad::rows_dot_product (const Eigen::Matrix< T1, R1, C1 > & v1,
const Eigen::Matrix< T2, R2, C2 > & v2 
)
+
+inline
+
+ +

Definition at line 274 of file dot_product.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<fvar<T>,R,1> stan::agrad::rows_dot_self (const Eigen::Matrix< fvar< T >, R, C > & x)
+
+inline
+
+ +

Definition at line 16 of file rows_dot_self.hpp.

+ +
+
+ +
+
+ + + + + + + + +
var stan::agrad::sd (const std::vector< var > & v)
+
+ +

Return the sample standard deviation of the specified standard vector.

+

Raise domain error if size is not greater than zero.

+
Parameters
+ + +
[in]va vector
+
+
+
Returns
sample standard deviation of specified vector
+ +

Definition at line 62 of file sd.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+ + + + + + + + +
var stan::agrad::sd (const Eigen::Matrix< var, R, C > & m)
+
+ +

Definition at line 79 of file sd.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
static void stan::agrad::set_zero_all_adjoints ()
+
+static
+
+ +

Reset all adjoint values in the stack to zero.

+ +

Definition at line 87 of file chainable.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::sin (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 14 of file sin.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::sin (const var & a)
+
+inline
+
+ +

Return the sine of a radian-scaled variable (cmath).

+

The derivative is defined by

+

$\frac{d}{dx} \sin x = \cos x$.

+
Parameters
+ + +
aVariable for radians of angle.
+
+
+
Returns
Sine of variable.
+ +

Definition at line 1696 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::sinh (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 14 of file sinh.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::sinh (const var & a)
+
+inline
+
+ +

Return the hyperbolic sine of the specified variable (cmath).

+

The derivative is defined by

+

$\frac{d}{dx} \sinh x = \cosh x$.

+
Parameters
+ + +
aVariable.
+
+
+
Returns
Hyperbolic sine of variable.
+ +

Definition at line 1836 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<fvar<T>,Eigen::Dynamic,1> stan::agrad::softmax (const Eigen::Matrix< fvar< T >, Eigen::Dynamic, 1 > & alpha)
+
+inline
+
+ +

Definition at line 14 of file softmax.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<var,Eigen::Dynamic,1> stan::agrad::softmax (const Eigen::Matrix< var, Eigen::Dynamic, 1 > & alpha)
+
+inline
+
+ +

Return the softmax of the specified Eigen vector.

+

Softmax is guaranteed to return a simplex.

+

The gradient calculations are unfolded.

+
Parameters
+ + +
alphaUnconstrained input vector.
+
+
+
Returns
Softmax of the input.
+
Exceptions
+ + +
std::domain_errorIf the input vector is size 0.
+
+
+ +

Definition at line 57 of file softmax.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
std::vector< fvar<T> > stan::agrad::sort_asc (std::vector< fvar< T > > xs)
+
+inline
+
+ +

Definition at line 18 of file sort.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
std::vector<var> stan::agrad::sort_asc (std::vector< var > xs)
+
+inline
+
+ +

Return the specified standard vector in ascending order with gradients kept.

+
Parameters
+ + +
xsStandard vector to order.
+
+
+
Returns
Standard vector ordered.
+
Template Parameters
+ + +
TType of elements of the vector.
+
+
+ +

Definition at line 24 of file sort.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<fvar<T>,R,C> stan::agrad::sort_asc (Eigen::Matrix< fvar< T >, R, C > xs)
+
+inline
+
+ +

Definition at line 34 of file sort.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<var,R,C> stan::agrad::sort_asc (Eigen::Matrix< var, R, C > xs)
+
+inline
+
+ +

Return the specified eigen vector in ascending order with gradients kept.

+
Parameters
+ + +
xsEigen vector to order.
+
+
+
Returns
Eigen vector ordered.
+
Template Parameters
+ + +
TType of elements of the vector.
+
+
+ +

Definition at line 49 of file sort.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
std::vector< fvar<T> > stan::agrad::sort_desc (std::vector< fvar< T > > xs)
+
+inline
+
+ +

Definition at line 26 of file sort.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
std::vector<var> stan::agrad::sort_desc (std::vector< var > xs)
+
+inline
+
+ +

Return the specified standard vector in descending order with gradients kept.

+
Parameters
+ + +
xsStandard vector to order.
+
+
+
Returns
Standard vector ordered.
+
Template Parameters
+ + +
TType of elements of the vector.
+
+
+ +

Definition at line 36 of file sort.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<fvar<T>,R,C> stan::agrad::sort_desc (Eigen::Matrix< fvar< T >, R, C > xs)
+
+inline
+
+ +

Definition at line 42 of file sort.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<var,R,C> stan::agrad::sort_desc (Eigen::Matrix< var, R, C > xs)
+
+inline
+
+ +

Return the specified eigen vector in descending order with gradients kept.

+
Parameters
+ + +
xsEigen vector to order.
+
+
+
Returns
Eigen vector ordered.
+
Template Parameters
+ + +
TType of elements of the vector.
+
+
+ +

Definition at line 62 of file sort.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::sqrt (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 15 of file sqrt.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::sqrt (const var & a)
+
+inline
+
+ +

Return the square root of the specified variable (cmath).

+

The derivative is defined by

+

$\frac{d}{dx} \sqrt{x} = \frac{1}{2 \sqrt{x}}$.

+
Parameters
+ + +
aVariable whose square root is taken.
+
+
+
Returns
Square root of variable.
+ +

Definition at line 1616 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::square (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 15 of file square.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::square (const var & x)
+
+inline
+
+ +

Return the square of the input variable.

+

Using square(x) is more efficient than using x * x.

+
Parameters
+ + +
xVariable to square.
+
+
+
Returns
Square of variable.
+ +

Definition at line 31 of file square.hpp.

+ +
+
+ +
+
+
+template<int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::squared_dist (const Eigen::Matrix< var, R1, C1 > & v1,
const Eigen::Matrix< var, R2, C2 > & v2 
)
+
+inline
+
+ +

Definition at line 96 of file squared_dist.hpp.

+ +
+
+ +
+
+
+template<int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::squared_dist (const Eigen::Matrix< var, R1, C1 > & v1,
const Eigen::Matrix< double, R2, C2 > & v2 
)
+
+inline
+
+ +

Definition at line 104 of file squared_dist.hpp.

+ +
+
+ +
+
+
+template<int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
var stan::agrad::squared_dist (const Eigen::Matrix< double, R1, C1 > & v1,
const Eigen::Matrix< var, R2, C2 > & v2 
)
+
+inline
+
+ +

Definition at line 112 of file squared_dist.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
void stan::agrad::stan_print (std::ostream * o,
const var & x 
)
+
+ +

Definition at line 10 of file stan_print.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::step (const stan::agrad::vara)
+
+inline
+
+ +

Return the step, or heaviside, function applied to the specified variable (stan).

+

See stan::math::step() for the double-based version.

+

The derivative of the step function is zero everywhere but at 0, so for convenience, it is taken to be everywhere zero,

+

$\mbox{step}(x) = 0$.

+
Parameters
+ + +
aVariable argument.
+
+
+
Returns
The constant variable with value 1.0 if the argument's value is greater than or equal to 0.0, and value 0.0 otherwise.
+ +

Definition at line 25 of file step.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::sum (const Eigen::Matrix< fvar< T >, R, C > & m)
+
+inline
+
+ +

Definition at line 14 of file sum.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + + +
var stan::agrad::sum (const Eigen::Matrix< var, R, C > & m)
+
+inline
+
+ +

Returns the sum of the coefficients of the specified matrix, column vector or row vector.

+
Parameters
+ + +
mSpecified matrix or vector.
+
+
+
Returns
Sum of coefficients of matrix.
+ +

Definition at line 68 of file sum.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::tan (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 14 of file tan.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::tan (const var & a)
+
+inline
+
+ +

Return the tangent of a radian-scaled variable (cmath).

+

The derivative is defined by

+

$\frac{d}{dx} \tan x = \sec^2 x$.

+
Parameters
+ + +
aVariable for radians of angle.
+
+
+
Returns
Tangent of variable.
+ +

Definition at line 1710 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::tanh (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 14 of file tanh.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::tanh (const var & a)
+
+inline
+
+ +

Return the hyperbolic tangent of the specified variable (cmath).

+

The derivative is defined by

+

$\frac{d}{dx} \tanh x = \frac{1}{\cosh^2 x}$.

+
Parameters
+ + +
aVariable.
+
+
+
Returns
Hyperbolic tangent of variable.
+ +

Definition at line 1850 of file agrad_thread_safe.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<fvar<T>,R,R> stan::agrad::tcrossprod (const Eigen::Matrix< fvar< T >, R, C > & m)
+
+inline
+
+ +

Definition at line 17 of file tcrossprod.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
matrix_v stan::agrad::tcrossprod (const matrix_v & M)
+
+inline
+
+ +

Returns the result of post-multiplying a matrix by its own transpose.

+
Parameters
+ + +
MMatrix to multiply.
+
+
+
Returns
M times its transpose.
+ +

Definition at line 27 of file tcrossprod.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::tgamma (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 15 of file tgamma.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::tgamma (const stan::agrad::vara)
+
+inline
+
+ +

Return the Gamma function applied to the specified variable (C99).

+

See boost::math::tgamma() for the double-based version.

+

The derivative with respect to the argument is

+

$\frac{d}{dx} \Gamma(x) = \Gamma(x) \Psi^{(0)}(x)$

+

where $\Psi^{(0)}(x)$ is the digamma function.

+

See boost::math::digamma() for the double-based version.

+
Parameters
+ + +
aArgument to function.
+
+
+
Returns
The Gamma function applied to the specified argument.
+ +

Definition at line 39 of file tgamma.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::to_fvar (const T & x)
+
+inline
+
+ +

Definition at line 17 of file to_fvar.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::to_fvar (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 24 of file to_fvar.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
matrix_fd stan::agrad::to_fvar (const stan::math::matrix_dm)
+
+inline
+
+ +

Definition at line 30 of file to_fvar.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
matrix_fd stan::agrad::to_fvar (const matrix_fd & m)
+
+inline
+
+ +

Definition at line 40 of file to_fvar.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
matrix_fv stan::agrad::to_fvar (const matrix_fv & m)
+
+inline
+
+ +

Definition at line 46 of file to_fvar.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
matrix_ffd stan::agrad::to_fvar (const matrix_ffd & m)
+
+inline
+
+ +

Definition at line 52 of file to_fvar.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
matrix_ffv stan::agrad::to_fvar (const matrix_ffv & m)
+
+inline
+
+ +

Definition at line 58 of file to_fvar.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
vector_fd stan::agrad::to_fvar (const stan::math::vector_dv)
+
+inline
+
+ +

Definition at line 64 of file to_fvar.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
vector_fd stan::agrad::to_fvar (const vector_fd & v)
+
+inline
+
+ +

Definition at line 73 of file to_fvar.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
vector_fv stan::agrad::to_fvar (const vector_fv & v)
+
+inline
+
+ +

Definition at line 79 of file to_fvar.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
vector_ffd stan::agrad::to_fvar (const vector_ffd & v)
+
+inline
+
+ +

Definition at line 85 of file to_fvar.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
vector_ffv stan::agrad::to_fvar (const vector_ffv & v)
+
+inline
+
+ +

Definition at line 91 of file to_fvar.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
row_vector_fd stan::agrad::to_fvar (const stan::math::row_vector_drv)
+
+inline
+
+ +

Definition at line 97 of file to_fvar.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
row_vector_fd stan::agrad::to_fvar (const row_vector_fd & rv)
+
+inline
+
+ +

Definition at line 106 of file to_fvar.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
row_vector_fv stan::agrad::to_fvar (const row_vector_fv & rv)
+
+inline
+
+ +

Definition at line 112 of file to_fvar.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
row_vector_ffd stan::agrad::to_fvar (const row_vector_ffd & rv)
+
+inline
+
+ +

Definition at line 118 of file to_fvar.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
row_vector_ffv stan::agrad::to_fvar (const row_vector_ffv & rv)
+
+inline
+
+ +

Definition at line 124 of file to_fvar.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<fvar<T>, R, C> stan::agrad::to_fvar (const Eigen::Matrix< T, R, C > & val,
const Eigen::Matrix< T, R, C > & deriv 
)
+
+inline
+
+ +

Definition at line 131 of file to_fvar.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::to_var (const double & x)
+
+inline
+
+ +

Converts argument to an automatic differentiation variable.

+

Returns a stan::agrad::var variable with the input value.

+
Parameters
+ + +
[in]xA scalar value
+
+
+
Returns
An automatic differentiation variable with the input value.
+ +

Definition at line 21 of file to_var.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::to_var (const var & x)
+
+inline
+
+ +

Converts argument to an automatic differentiation variable.

+

Returns a stan::agrad::var variable with the input value.

+
Parameters
+ + +
[in]xAn automatic differentiation variable.
+
+
+
Returns
An automatic differentiation variable with the input value.
+ +

Definition at line 32 of file to_var.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
matrix_v stan::agrad::to_var (const stan::math::matrix_dm)
+
+inline
+
+ +

Converts argument to an automatic differentiation variable.

+

Returns a stan::agrad::var variable with the input value.

+
Parameters
+ + +
[in]mA Matrix with scalars
+
+
+
Returns
A Matrix with automatic differentiation variables
+ +

Definition at line 43 of file to_var.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
matrix_v stan::agrad::to_var (const matrix_v & m)
+
+inline
+
+ +

Converts argument to an automatic differentiation variable.

+

Returns a stan::agrad::var variable with the input value.

+
Parameters
+ + +
[in]mA Matrix with automatic differentiation variables.
+
+
+
Returns
A Matrix with automatic differentiation variables.
+ +

Definition at line 58 of file to_var.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
vector_v stan::agrad::to_var (const stan::math::vector_dv)
+
+inline
+
+ +

Converts argument to an automatic differentiation variable.

+

Returns a stan::agrad::var variable with the input value.

+
Parameters
+ + +
[in]vA Vector of scalars
+
+
+
Returns
A Vector of automatic differentiation variables with values of v
+ +

Definition at line 70 of file to_var.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
vector_v stan::agrad::to_var (const vector_v & v)
+
+inline
+
+ +

Converts argument to an automatic differentiation variable.

+

Returns a stan::agrad::var variable with the input value.

+
Parameters
+ + +
[in]vA Vector of automatic differentiation variables
+
+
+
Returns
A Vector of automatic differentiation variables with values of v
+ +

Definition at line 85 of file to_var.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
row_vector_v stan::agrad::to_var (const stan::math::row_vector_drv)
+
+inline
+
+ +

Converts argument to an automatic differentiation variable.

+

Returns a stan::agrad::var variable with the input value.

+
Parameters
+ + +
[in]rvA row vector of scalars
+
+
+
Returns
A row vector of automatic differentation variables with values of rv.
+ +

Definition at line 97 of file to_var.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
row_vector_v stan::agrad::to_var (const row_vector_v & rv)
+
+inline
+
+ +

Converts argument to an automatic differentiation variable.

+

Returns a stan::agrad::var variable with the input value.

+
Parameters
+ + +
[in]rvA row vector with automatic differentiation variables
+
+
+
Returns
A row vector with automatic differentiation variables with values of rv.
+ +

Definition at line 112 of file to_var.hpp.

+ +
+
+ +
+
+
+template<typename TD , int RD, int CD, typename TA , int RA, int CA, typename TB , int RB, int CB>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
boost::enable_if_c< boost::is_same<TD,var>::value || boost::is_same<TA,var>::value || boost::is_same<TB,var>::value, var >::type stan::agrad::trace_gen_quad_form (const Eigen::Matrix< TD, RD, CD > & D,
const Eigen::Matrix< TA, RA, CA > & A,
const Eigen::Matrix< TB, RB, CB > & B 
)
+
+inline
+
+ +

Definition at line 111 of file trace_gen_quad_form.hpp.

+ +
+
+ +
+
+
+template<typename T1 , int R1, int C1, typename T2 , int R2, int C2, typename T3 , int R3, int C3>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
boost::enable_if_c<boost::is_same<T1,var>::value || boost::is_same<T2,var>::value || boost::is_same<T3,var>::value, var>::type stan::agrad::trace_inv_quad_form_ldlt (const Eigen::Matrix< T1, R1, C1 > & D,
const stan::math::LDLT_factor< T2, R2, C2 > & A,
const Eigen::Matrix< T3, R3, C3 > & B 
)
+
+inline
+
+ +

Compute the trace of an inverse quadratic form.

+

I.E., this computes trace(D B^T A^-1 B) where D is a square matrix and the LDLT_factor of A is provided.

+ +

Definition at line 506 of file ldlt.hpp.

+ +
+
+ +
+
+
+template<typename T2 , int R2, int C2, typename T3 , int R3, int C3>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::enable_if_c<boost::is_same<T2,var>::value || boost::is_same<T3,var>::value, var>::type stan::agrad::trace_inv_quad_form_ldlt (const stan::math::LDLT_factor< T2, R2, C2 > & A,
const Eigen::Matrix< T3, R3, C3 > & B 
)
+
+inline
+
+ +

Compute the trace of an inverse quadratic form.

+

I.E., this computes trace(B^T A^-1 B) where the LDLT_factor of A is provided.

+ +

Definition at line 528 of file ldlt.hpp.

+ +
+
+ +
+
+
+template<typename TA , int RA, int CA, typename TB , int RB, int CB>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::enable_if_c< boost::is_same<TA,var>::value || boost::is_same<TB,var>::value, var >::type stan::agrad::trace_quad_form (const Eigen::Matrix< TA, RA, CA > & A,
const Eigen::Matrix< TB, RB, CB > & B 
)
+
+inline
+
+ +

Definition at line 99 of file trace_quad_form.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::trunc (const fvar< T > & x)
+
+inline
+
+ +

Definition at line 15 of file trunc.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
var stan::agrad::trunc (const stan::agrad::vara)
+
+inline
+
+ +

Returns the truncatation of the specified variable (C99).

+

See boost::math::trunc() for the double-based version.

+

The derivative is zero everywhere but at integer values, so for convenience the derivative is defined to be everywhere zero,

+

$\frac{d}{dx} \mbox{trunc}(x) = 0$.

+
Parameters
+ + +
aSpecified variable.
+
+
+
Returns
Truncation of the variable.
+ +

Definition at line 34 of file trunc.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + + +
const Eigen::Matrix<double,R,C>& stan::agrad::value_of (const Eigen::Matrix< double, R, C > & M)
+
+inline
+
+ +

Convert a matrix to a matrix of doubles.

+

When the input is already a matrix of doubles a reference is returned.

+

This is used as a convenience function for implementing varis of matrix operations.

+ +

Definition at line 16 of file value_of.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
double stan::agrad::value_of (const agrad::var & v)
+
+inline
+
+ +

Return the value of the specified variable.

+

This function is used internally by auto-dif functions along with stan::math::value_of(T x) to extract the double value of either a scalar or an auto-dif variable. This function will be called when the argument is a stan::agrad::var even if the function is not referred to by namespace because of argument-dependent lookup.

+
Parameters
+ + +
vVariable.
+
+
+
Returns
Value of variable.
+ +

Definition at line 22 of file value_of.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<double,R,C> stan::agrad::value_of (const Eigen::Matrix< var, R, C > & M)
+
+inline
+
+ +

Convert a matrix to a matrix of doubles.

+

When the input is already a matrix of vars a new matrix is returned with the value of the constituent vars.

+

This is used as a convenience function for implementing varis of matrix operations.

+ +

Definition at line 27 of file value_of.hpp.

+ +
+
+ +
+
+ + + + + + + + +
var stan::agrad::variance (const std::vector< var > & v)
+
+ +

Return the sample variance of the specified standard vector.

+

Raise domain error if size is not greater than zero.

+
Parameters
+ + +
[in]va vector
+
+
+
Returns
sample variance of specified vector
+ +

Definition at line 50 of file variance.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+ + + + + + + + +
var stan::agrad::variance (const Eigen::Matrix< var, R, C > & m)
+
+ +

Definition at line 67 of file variance.hpp.

+ +
+
+

Variable Documentation

+ +
+
+ + + + +
memory::stack_alloc stan::agrad::memalloc_
+
+ +

Definition at line 13 of file var_stack.cpp.

+ +
+
+ +
+
+ + + + +
std::vector< chainable_alloc * > stan::agrad::var_alloc_stack_
+
+ +

Definition at line 12 of file var_stack.cpp.

+ +
+
+ +
+
+ + + + +
std::vector< chainable * > stan::agrad::var_nochain_stack_
+
+ +

Definition at line 11 of file var_stack.cpp.

+ +
+
+ +
+
+ + + + +
std::vector< chainable * > stan::agrad::var_stack_
+
+ +

Definition at line 10 of file var_stack.cpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacestan_1_1gm.html b/doc/api/html/namespacestan_1_1gm.html new file mode 100644 index 00000000000..2e888f63353 --- /dev/null +++ b/doc/api/html/namespacestan_1_1gm.html @@ -0,0 +1,4657 @@ + + + + + +Stan: stan::gm Namespace Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm Namespace Reference
+
+
+ +

Directed graphical model compiler. +More...

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Classes

class  arg_adapt
 
class  arg_adapt_delta
 
class  arg_adapt_engaged
 
class  arg_adapt_gamma
 
class  arg_adapt_init_buffer
 
class  arg_adapt_kappa
 
class  arg_adapt_t0
 
class  arg_adapt_term_buffer
 
class  arg_adapt_window
 
class  arg_bfgs
 
class  arg_data
 
class  arg_data_file
 
class  arg_dense_e
 
class  arg_diag_e
 
class  arg_diagnose
 
class  arg_diagnostic_file
 
class  arg_engine
 
class  arg_fail
 
class  arg_hmc
 
class  arg_id
 
class  arg_init
 
class  arg_init_alpha
 
class  arg_int_time
 
class  arg_iter
 
class  arg_max_depth
 
class  arg_method
 
class  arg_metric
 
class  arg_nesterov
 
class  arg_newton
 
class  arg_num_samples
 
class  arg_num_warmup
 
class  arg_nuts
 
class  arg_optimize
 
class  arg_optimize_algo
 
class  arg_output
 
class  arg_output_file
 
class  arg_random
 
class  arg_refresh
 
class  arg_rwm
 
class  arg_sample
 
class  arg_sample_algo
 
class  arg_save_iterations
 
class  arg_save_warmup
 
class  arg_seed
 
class  arg_static
 
class  arg_stepsize
 
class  arg_stepsize_jitter
 
class  arg_test
 
class  arg_test_grad_eps
 
class  arg_test_grad_err
 
class  arg_test_gradient
 
class  arg_thin
 
class  arg_tolerance
 
class  arg_unit_e
 
class  argument
 
class  argument_parser
 
class  argument_probe
 
class  categorical_argument
 
class  list_argument
 
struct  type_name
 
struct  type_name< int >
 
struct  type_name< unsigned int >
 
struct  type_name< double >
 
struct  type_name< bool >
 
struct  type_name< std::string >
 
class  singleton_argument
 
class  unvalued_argument
 
class  valued_argument
 
struct  nil
 Placeholder struct for boost::variant default ctors. More...
 
struct  expr_type
 
class  function_signatures
 
struct  statements
 
struct  distribution
 
struct  expression_type_vis
 
struct  expression
 
struct  printable
 
struct  is_nil_op
 
struct  variable_dims
 
struct  int_literal
 
struct  double_literal
 
struct  array_literal
 
struct  variable
 
struct  fun
 
struct  index_op
 
struct  binary_op
 
struct  unary_op
 
struct  range
 
struct  base_var_decl
 
struct  variable_map
 
struct  int_var_decl
 
struct  double_var_decl
 
struct  unit_vector_var_decl
 
struct  simplex_var_decl
 
struct  ordered_var_decl
 
struct  positive_ordered_var_decl
 
struct  vector_var_decl
 
struct  row_vector_var_decl
 
struct  matrix_var_decl
 
struct  cholesky_factor_var_decl
 
struct  cov_matrix_var_decl
 
struct  corr_matrix_var_decl
 
struct  name_vis
 
struct  var_decl
 
struct  statement
 
struct  increment_log_prob_statement
 
struct  for_statement
 
struct  conditional_statement
 
struct  while_statement
 
struct  print_statement
 
struct  no_op_statement
 
struct  program
 
struct  sample
 
struct  assignment
 
struct  contains_var
 
struct  contains_nonparam_var
 
struct  error_codes
 
struct  visgen
 generic visitor with output for extension More...
 
struct  expression_visgen
 
struct  printable_visgen
 
struct  var_size_validating_visgen
 
struct  var_resizing_visgen
 
struct  init_local_var_visgen
 
struct  validate_var_decl_visgen
 
struct  member_var_decl_visgen
 
struct  local_var_decl_visgen
 
struct  generate_local_var_init_nan_visgen
 
struct  generate_init_vars_visgen
 
struct  validate_transformed_params_visgen
 
struct  statement_visgen
 
struct  dump_member_var_visgen
 
struct  set_param_ranges_visgen
 
struct  generate_init_visgen
 
struct  write_dims_visgen
 
struct  write_param_names_visgen
 
struct  write_csv_header_visgen
 
struct  constrained_param_names_visgen
 
struct  unconstrained_param_names_visgen
 
struct  write_csv_visgen
 
struct  write_csv_vars_visgen
 
struct  write_array_visgen
 
struct  write_array_vars_visgen
 
struct  expression_grammar
 
struct  validate_expr_type2
 
struct  set_fun_type2
 
struct  binary_op_expr
 
struct  addition_expr
 
struct  subtraction_expr
 
struct  program_grammar
 
struct  statement_2_grammar
 
struct  add_conditional_condition
 
struct  add_conditional_body
 
struct  statement_grammar
 
struct  validate_assignment
 
struct  validate_sample
 
struct  expression_as_statement
 
struct  unscope_locals
 
struct  add_while_condition
 
struct  add_while_body
 
struct  add_loop_identifier
 
struct  remove_loop_identifier
 
struct  validate_int_expr2
 
struct  validate_allow_sample
 
struct  term_grammar
 
struct  set_fun_type
 
struct  set_fun_type_named
 
struct  multiplication_expr
 
struct  division_expr
 
struct  left_division_expr
 
struct  elt_multiplication_expr
 
struct  elt_division_expr
 
struct  negate_expr
 
struct  logical_negate_expr
 
struct  transpose_expr
 
struct  add_expression_dimss
 
struct  set_var_type
 
struct  validate_int_expr3
 
struct  validate_expr_type
 
struct  var_decls_grammar
 
struct  whitespace_grammar
 
+ + + + + + + + + + + + + + + + + + + + + + + +

+Typedefs

typedef singleton_argument
+< double > 
real_argument
 
typedef singleton_argument< int > int_argument
 
typedef singleton_argument
+< unsigned int > 
u_int_argument
 
typedef singleton_argument< bool > bool_argument
 
typedef singleton_argument
+< std::string > 
string_argument
 
typedef int base_expr_type
 
typedef std::pair< expr_type,
+std::vector< expr_type > > 
function_signature_t
 
typedef int var_origin
 
typedef
+std::istreambuf_iterator< char > 
base_iterator_t
 
typedef
+boost::spirit::multi_pass
+< base_iterator_t
forward_iterator_t
 
typedef
+boost::spirit::classic::position_iterator2
+< forward_iterator_t
pos_iterator_t
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

std::ostream & write_base_expr_type (std::ostream &o, base_expr_type type)
 
std::ostream & operator<< (std::ostream &o, const expr_type &et)
 
expr_type promote_primitive (const expr_type &et)
 
expr_type promote_primitive (const expr_type &et1, const expr_type &et2)
 
bool is_nil (const expression &e)
 
size_t total_dims (const std::vector< std::vector< expression > > &dimss)
 
expr_type infer_type_indexing (const base_expr_type &expr_base_type, size_t num_expr_dims, size_t num_index_dims)
 
expr_type infer_type_indexing (const expression &expr, size_t num_index_dims)
 
void print_var_origin (std::ostream &o, const var_origin &vo)
 
void generate_expression (const expression &e, std::ostream &o)
 
bool has_rng_suffix (const std::string &s)
 
bool has_var (const expression &e, const variable_map &var_map)
 
bool has_non_param_var (const expression &e, const variable_map &var_map)
 
void write_stan (std::ostream *s, const char prefix= '\0')
 
void write_model (std::ostream *s, std::string model_name, const char prefix= '\0')
 
void write_error_msg (std::ostream *error_stream, const std::domain_error &e)
 
bool do_print (int n, int refresh)
 
void print_progress (int m, int start, int finish, int refresh, bool warmup)
 
template<class Model , class RNG >
void run_markov_chain (stan::mcmc::base_mcmc *sampler, int num_iterations, int start, int finish, int num_thin, int refresh, bool save, bool warmup, stan::io::mcmc_writer< Model > &writer, stan::mcmc::sample &init_s, Model &model, RNG &base_rng)
 
template<class Model , class RNG >
void warmup (stan::mcmc::base_mcmc *sampler, int num_warmup, int num_samples, int num_thin, int refresh, bool save, stan::io::mcmc_writer< Model > &writer, stan::mcmc::sample &init_s, Model &model, RNG &base_rng)
 
template<class Model , class RNG >
void sample (stan::mcmc::base_mcmc *sampler, int num_warmup, int num_samples, int num_thin, int refresh, bool save, stan::io::mcmc_writer< Model > &writer, stan::mcmc::sample &init_s, Model &model, RNG &base_rng)
 
template<class Sampler >
bool init_static_hmc (stan::mcmc::base_mcmc *sampler, argument *algorithm)
 
template<class Sampler >
bool init_nuts (stan::mcmc::base_mcmc *sampler, argument *algorithm)
 
template<class Sampler >
bool init_adapt (Sampler *sampler, const double delta, const double gamma, const double kappa, const double t0, const Eigen::VectorXd &cont_params)
 
template<class Sampler >
bool init_adapt (stan::mcmc::base_mcmc *sampler, categorical_argument *adapt, const Eigen::VectorXd &cont_params)
 
template<class Sampler >
bool init_windowed_adapt (stan::mcmc::base_mcmc *sampler, categorical_argument *adapt, unsigned int num_warmup, const Eigen::VectorXd &cont_params)
 
template<class Model >
int command (int argc, const char *argv[])
 
bool compile (std::ostream *msgs, std::istream &stan_gm_in, std::ostream &cpp_out, const std::string &model_name, bool include_main=true, const std::string &in_file_name="input")
 Read a Stan model specification from the specified input, parse it, and write the C++ code for it to the specified output.
 
const std::string EOL ("\n")
 
const std::string EOL2 ("\n\n")
 
const std::string INDENT (" ")
 
const std::string INDENT2 (" ")
 
const std::string INDENT3 (" ")
 
template<typename D >
bool has_lub (const D &x)
 
template<typename D >
bool has_ub (const D &x)
 
template<typename D >
bool has_lb (const D &x)
 
template<typename T >
std::string to_string (T i)
 
void generate_indent (size_t indent, std::ostream &o)
 
void generate_void_statement (const std::string &name, const size_t indent, std::ostream &o)
 
void generate_start_namespace (std::string name, std::ostream &o)
 
void generate_end_namespace (std::ostream &o)
 
void generate_comment (std::string const &msg, int indent, std::ostream &o)
 
template<bool isLHS>
void generate_indexed_expr (const std::string &expr, const std::vector< expression > indexes, base_expr_type base_type, size_t e_num_dims, std::ostream &o)
 
void generate_type (const std::string &base_type, const std::vector< expression > &, size_t end, std::ostream &o)
 
std::string base_type_to_string (const base_expr_type &bt)
 
static void print_string_literal (std::ostream &o, const std::string &s)
 
static void print_quoted_expression (std::ostream &o, const expression &e)
 
void generate_printable (const printable &p, std::ostream &o)
 
void generate_using (const std::string &type, std::ostream &o)
 
void generate_using_namespace (const std::string &ns, std::ostream &o)
 
void generate_usings (std::ostream &o)
 
void generate_typedef (const std::string &type, const std::string &abbrev, std::ostream &o)
 
void generate_typedefs (std::ostream &o)
 
void generate_include (const std::string &lib_name, std::ostream &o)
 
void generate_includes (std::ostream &o)
 
void generate_version_comment (std::ostream &o)
 
void generate_class_decl (const std::string &model_name, std::ostream &o)
 
void generate_end_class_decl (std::ostream &o)
 
void generate_initializer (std::ostream &o, const std::string &base_type, const std::vector< expression > &dims, const expression &type_arg1=expression(), const expression &type_arg2=expression())
 
void generate_validate_context_size (std::ostream &o, const std::string &stage, const std::string &var_name, const std::string &base_type, const std::vector< expression > &dims, const expression &type_arg1=expression(), const expression &type_arg2=expression())
 
void generate_validate_positive (const std::string &var_name, const expression &expr, std::ostream &o)
 
void generate_initialization (std::ostream &o, const std::string &var_name, const std::string &base_type, const std::vector< expression > &dims, const expression &type_arg1=expression(), const expression &type_arg2=expression())
 
void generate_var_resizing (const std::vector< var_decl > &vs, std::ostream &o)
 
const std::vector< expressionEMPTY_EXP_VECTOR (0)
 
void generate_local_var_inits (std::vector< var_decl > vs, bool is_var, bool declare_vars, std::ostream &o)
 
void generate_public_decl (std::ostream &o)
 
void generate_private_decl (std::ostream &o)
 
void generate_validate_var_decl (const var_decl &decl, int indent, std::ostream &o)
 
void generate_validate_var_decls (const std::vector< var_decl > decls, int indent, std::ostream &o)
 
void generate_member_var_decls (const std::vector< var_decl > &vs, int indent, std::ostream &o)
 
void generate_local_var_decls (const std::vector< var_decl > &vs, int indent, std::ostream &o, bool is_var)
 
void generate_local_var_init_nan (const std::vector< var_decl > &vs, int indent, std::ostream &o, bool is_var)
 
void generate_init_vars (const std::vector< var_decl > &vs, int indent, std::ostream &o)
 
void generate_validate_transformed_params (const std::vector< var_decl > &vs, int indent, std::ostream &o)
 
void generate_statement (statement const &s, int indent, std::ostream &o, bool include_sampling, bool is_var)
 
void generate_statements (const std::vector< statement > &ss, int indent, std::ostream &o, bool include_sampling, bool is_var)
 
void generate_log_prob (program const &p, std::ostream &o)
 
void suppress_warning (const std::string &indent, const std::string &var_name, std::ostream &o)
 
void generate_member_var_inits (const std::vector< var_decl > &vs, std::ostream &o)
 
void generate_destructor (const std::string &model_name, std::ostream &o)
 
void generate_set_param_ranges (const std::vector< var_decl > &var_decls, std::ostream &o)
 
void generate_constructor (const program &prog, const std::string &model_name, std::ostream &o)
 
void generate_init_method (const std::vector< var_decl > &vs, std::ostream &o)
 
void generate_dims_method (const program &prog, std::ostream &o)
 
void generate_param_names_method (const program &prog, std::ostream &o)
 
void generate_write_csv_header_method (const program &prog, std::ostream &o)
 
void generate_constrained_param_names_method (const program &prog, std::ostream &o)
 
void generate_unconstrained_param_names_method (const program &prog, std::ostream &o)
 
void generate_write_csv_method (const program &prog, const std::string &model_name, std::ostream &o)
 
void generate_write_array_method (const program &prog, const std::string &model_name, std::ostream &o)
 
void generate_main (const std::string &model_name, std::ostream &out)
 
void generate_model_name_method (const std::string &model_name, std::ostream &out)
 
void generate_cpp (const program &prog, const std::string &model_name, std::ostream &out, bool include_main=true)
 
bool is_space (char c)
 
bool is_nonempty (std::string &s)
 
bool parse (std::ostream *output_stream, std::istream &input, const std::string &filename, const std::string &model_name, program &result)
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Variables

const int INT_T = 1
 
const int DOUBLE_T = 2
 
const int VECTOR_T = 3
 
const int ROW_VECTOR_T = 4
 
const int MATRIX_T = 5
 
const int ILL_FORMED_T = 6
 
const int model_name_origin = 0
 
const int data_origin = 1
 
const int transformed_data_origin = 2
 
const int parameter_origin = 3
 
const int transformed_parameter_origin = 4
 
const int derived_origin = 5
 
const int local_origin = 6
 
boost::phoenix::function
+< validate_expr_type2
validate_expr_type2_f
 
boost::phoenix::function
+< set_fun_type2
set_fun_type2_f
 
boost::phoenix::function
+< binary_op_expr
binary_op_f
 
boost::phoenix::function
+< addition_expr
addition
 
boost::phoenix::function
+< subtraction_expr
subtraction
 
boost::phoenix::function
+< add_conditional_condition
add_conditional_condition_f
 
boost::phoenix::function
+< add_conditional_body
add_conditional_body_f
 
boost::phoenix::function
+< validate_assignment
validate_assignment_f
 
boost::phoenix::function
+< validate_sample
validate_sample_f
 
boost::phoenix::function
+< expression_as_statement
expression_as_statement_f
 
boost::phoenix::function
+< unscope_locals
unscope_locals_f
 
boost::phoenix::function
+< add_while_condition
add_while_condition_f
 
boost::phoenix::function
+< add_while_body
add_while_body_f
 
boost::phoenix::function
+< add_loop_identifier
add_loop_identifier_f
 
boost::phoenix::function
+< remove_loop_identifier
remove_loop_identifier_f
 
boost::phoenix::function
+< validate_int_expr2
validate_int_expr2_f
 
boost::phoenix::function
+< validate_allow_sample
validate_allow_sample_f
 
boost::phoenix::function
+< set_fun_type
set_fun_type_f
 
boost::phoenix::function
+< set_fun_type_named
set_fun_type_named_f
 
boost::phoenix::function
+< multiplication_expr
multiplication
 
boost::phoenix::function
+< division_expr
division
 
boost::phoenix::function
+< left_division_expr
left_division
 
boost::phoenix::function
+< elt_multiplication_expr
elt_multiplication
 
boost::phoenix::function
+< elt_division_expr
elt_division
 
boost::phoenix::function
+< negate_expr
negate_expr_f
 
boost::phoenix::function
+< logical_negate_expr
logical_negate_expr_f
 
boost::phoenix::function
+< transpose_expr
transpose_f
 
boost::phoenix::function
+< add_expression_dimss
add_expression_dimss_f
 
boost::phoenix::function
+< set_var_type
set_var_type_f
 
boost::phoenix::function
+< validate_int_expr3
validate_int_expr3_f
 
boost::phoenix::function
+< validate_expr_type
validate_expr_type_f
 
+

Detailed Description

+

Directed graphical model compiler.

+

Typedef Documentation

+ +
+
+ + + + +
typedef int stan::gm::base_expr_type
+
+ +

Definition at line 55 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
typedef std::istreambuf_iterator<char> stan::gm::base_iterator_t
+
+ +

Definition at line 10 of file iterator_typedefs.hpp.

+ +
+
+ +
+
+ + + + +
typedef singleton_argument<bool> stan::gm::bool_argument
+
+ +

Definition at line 167 of file singleton_argument.hpp.

+ +
+
+ +
+
+ + + + +
typedef boost::spirit::multi_pass<base_iterator_t> stan::gm::forward_iterator_t
+
+ +

Definition at line 11 of file iterator_typedefs.hpp.

+ +
+
+ +
+
+ + + + +
typedef std::pair<expr_type, std::vector<expr_type> > stan::gm::function_signature_t
+
+ +

Definition at line 92 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
typedef singleton_argument<int> stan::gm::int_argument
+
+ +

Definition at line 165 of file singleton_argument.hpp.

+ +
+
+ +
+
+ + + + +
typedef boost::spirit::classic::position_iterator2<forward_iterator_t> stan::gm::pos_iterator_t
+
+ +

Definition at line 12 of file iterator_typedefs.hpp.

+ +
+
+ +
+
+ + + + +
typedef singleton_argument<double> stan::gm::real_argument
+
+ +

Definition at line 164 of file singleton_argument.hpp.

+ +
+
+ +
+
+ + + + +
typedef singleton_argument<std::string> stan::gm::string_argument
+
+ +

Definition at line 168 of file singleton_argument.hpp.

+ +
+
+ +
+
+ + + + +
typedef singleton_argument<unsigned int> stan::gm::u_int_argument
+
+ +

Definition at line 166 of file singleton_argument.hpp.

+ +
+
+ +
+
+ + + + +
typedef int stan::gm::var_origin
+
+ +

Definition at line 368 of file ast.hpp.

+ +
+
+

Function Documentation

+ +
+
+ + + + + + + + +
std::string stan::gm::base_type_to_string (const base_expr_type & bt)
+
+ +

Definition at line 135 of file generator.hpp.

+ +
+
+ +
+
+
+template<class Model >
+ + + + + + + + + + + + + + + + + + +
int stan::gm::command (int argc,
const char * argv[] 
)
+
+ +

Definition at line 269 of file command.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::gm::compile (std::ostream * msgs,
std::istream & stan_gm_in,
std::ostream & cpp_out,
const std::string & model_name,
bool include_main = true,
const std::string & in_file_name = "input" 
)
+
+ +

Read a Stan model specification from the specified input, parse it, and write the C++ code for it to the specified output.

+
Parameters
+ + + + + + + +
msgsOutput stream for warning messages
stan_gm_inStan model specification
cpp_outC++ code output stream
model_nameName of model class
include_mainIndicates whether to generate a main function
in_file_nameName of input file to use in error messages; defaults to input.
+
+
+
Returns
false if code could not be generated due to syntax error in the Stan model; true otherwise.
+
Parameters
+ + + + + + + +
msgs
stan_gm_in
cpp_out
model_name
include_main
in_file_name
+
+
+ +

Definition at line 38 of file compiler.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
bool stan::gm::do_print (int n,
int refresh 
)
+
+ +

Definition at line 76 of file command.hpp.

+ +
+
+ +
+
+ + + + + + + + +
const std::vector<expression> stan::gm::EMPTY_EXP_VECTOR ()
+
+ +
+
+ +
+
+ + + + + + + + +
const std::string stan::gm::EOL ("\n" )
+
+ +
+
+ +
+
+ + + + + + + + +
const std::string stan::gm::EOL2 ("\n\n" )
+
+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
void stan::gm::generate_class_decl (const std::string & model_name,
std::ostream & o 
)
+
+ +

Definition at line 300 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::generate_comment (std::string const & msg,
int indent,
std::ostream & o 
)
+
+ +

Definition at line 76 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
void stan::gm::generate_constrained_param_names_method (const program & prog,
std::ostream & o 
)
+
+ +

Definition at line 3055 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::generate_constructor (const program & prog,
const std::string & model_name,
std::ostream & o 
)
+
+ +

Definition at line 2293 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::generate_cpp (const program & prog,
const std::string & model_name,
std::ostream & out,
bool include_main = true 
)
+
+ +

Definition at line 3962 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
void stan::gm::generate_destructor (const std::string & model_name,
std::ostream & o 
)
+
+ +

Definition at line 2109 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
void stan::gm::generate_dims_method (const program & prog,
std::ostream & o 
)
+
+ +

Definition at line 2682 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + +
void stan::gm::generate_end_class_decl (std::ostream & o)
+
+ +

Definition at line 305 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + +
void stan::gm::generate_end_namespace (std::ostream & o)
+
+ +

Definition at line 72 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
void stan::gm::generate_expression (const expression & e,
std::ostream & o 
)
+
+ +

Definition at line 208 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
void stan::gm::generate_include (const std::string & lib_name,
std::ostream & o 
)
+
+ +

Definition at line 285 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + +
void stan::gm::generate_includes (std::ostream & o)
+
+ +

Definition at line 289 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
void stan::gm::generate_indent (size_t indent,
std::ostream & o 
)
+
+ +

Definition at line 47 of file generator.hpp.

+ +
+
+ +
+
+
+template<bool isLHS>
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::generate_indexed_expr (const std::string & expr,
const std::vector< expression > indexes,
base_expr_type base_type,
size_t e_num_dims,
std::ostream & o 
)
+
+ +

Definition at line 84 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
void stan::gm::generate_init_method (const std::vector< var_decl > & vs,
std::ostream & o 
)
+
+ +

Definition at line 2563 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::generate_init_vars (const std::vector< var_decl > & vs,
int indent,
std::ostream & o 
)
+
+ +

Definition at line 1253 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::generate_initialization (std::ostream & o,
const std::string & var_name,
const std::string & base_type,
const std::vector< expression > & dims,
const expression & type_arg1 = expression(),
const expression & type_arg2 = expression() 
)
+
+ +

Definition at line 427 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::generate_initializer (std::ostream & o,
const std::string & base_type,
const std::vector< expression > & dims,
const expression & type_arg1 = expression(),
const expression & type_arg2 = expression() 
)
+
+ +

Definition at line 309 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::generate_local_var_decls (const std::vector< var_decl > & vs,
int indent,
std::ostream & o,
bool is_var 
)
+
+ +

Definition at line 1111 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::generate_local_var_init_nan (const std::vector< var_decl > & vs,
int indent,
std::ostream & o,
bool is_var 
)
+
+ +

Definition at line 1184 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::generate_local_var_inits (std::vector< var_decl > vs,
bool is_var,
bool declare_vars,
std::ostream & o 
)
+
+ +

Definition at line 704 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
void stan::gm::generate_log_prob (program const & p,
std::ostream & o 
)
+
+ +

Definition at line 1605 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
void stan::gm::generate_main (const std::string & model_name,
std::ostream & out 
)
+
+ +

Definition at line 3936 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::generate_member_var_decls (const std::vector< var_decl > & vs,
int indent,
std::ostream & o 
)
+
+ +

Definition at line 927 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
void stan::gm::generate_member_var_inits (const std::vector< var_decl > & vs,
std::ostream & o 
)
+
+ +

Definition at line 2102 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
void stan::gm::generate_model_name_method (const std::string & model_name,
std::ostream & out 
)
+
+ +

Definition at line 3955 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
void stan::gm::generate_param_names_method (const program & prog,
std::ostream & o 
)
+
+ +

Definition at line 2760 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
void stan::gm::generate_printable (const printable & p,
std::ostream & o 
)
+
+ +

Definition at line 242 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + +
void stan::gm::generate_private_decl (std::ostream & o)
+
+ +

Definition at line 724 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + +
void stan::gm::generate_public_decl (std::ostream & o)
+
+ +

Definition at line 720 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
void stan::gm::generate_set_param_ranges (const std::vector< var_decl > & var_decls,
std::ostream & o 
)
+
+ +

Definition at line 2281 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
void stan::gm::generate_start_namespace (std::string name,
std::ostream & o 
)
+
+ +

Definition at line 67 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::generate_statement (statement const & s,
int indent,
std::ostream & o,
bool include_sampling,
bool is_var 
)
+
+ +

Definition at line 1585 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::generate_statements (const std::vector< statement > & ss,
int indent,
std::ostream & o,
bool include_sampling,
bool is_var 
)
+
+ +

Definition at line 1594 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::generate_type (const std::string & base_type,
const std::vector< expression > & ,
size_t end,
std::ostream & o 
)
+
+ +

Definition at line 123 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::generate_typedef (const std::string & type,
const std::string & abbrev,
std::ostream & o 
)
+
+ +

Definition at line 272 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + +
void stan::gm::generate_typedefs (std::ostream & o)
+
+ +

Definition at line 278 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
void stan::gm::generate_unconstrained_param_names_method (const program & prog,
std::ostream & o 
)
+
+ +

Definition at line 3225 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
void stan::gm::generate_using (const std::string & type,
std::ostream & o 
)
+
+ +

Definition at line 247 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
void stan::gm::generate_using_namespace (const std::string & ns,
std::ostream & o 
)
+
+ +

Definition at line 251 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + +
void stan::gm::generate_usings (std::ostream & o)
+
+ +

Definition at line 256 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::generate_validate_context_size (std::ostream & o,
const std::string & stage,
const std::string & var_name,
const std::string & base_type,
const std::vector< expression > & dims,
const expression & type_arg1 = expression(),
const expression & type_arg2 = expression() 
)
+
+ +

Definition at line 341 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::generate_validate_positive (const std::string & var_name,
const expression & expr,
std::ostream & o 
)
+
+ +

Definition at line 416 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::generate_validate_transformed_params (const std::vector< var_decl > & vs,
int indent,
std::ostream & o 
)
+
+ +

Definition at line 1383 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::generate_validate_var_decl (const var_decl & decl,
int indent,
std::ostream & o 
)
+
+ +

Definition at line 850 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::generate_validate_var_decls (const std::vector< var_decl > decls,
int indent,
std::ostream & o 
)
+
+ +

Definition at line 857 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
void stan::gm::generate_var_resizing (const std::vector< var_decl > & vs,
std::ostream & o 
)
+
+ +

Definition at line 492 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + +
void stan::gm::generate_version_comment (std::ostream & o)
+
+ +

Definition at line 295 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::generate_void_statement (const std::string & name,
const size_t indent,
std::ostream & o 
)
+
+ +

Definition at line 52 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::generate_write_array_method (const program & prog,
const std::string & model_name,
std::ostream & o 
)
+
+ +

Definition at line 3842 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
void stan::gm::generate_write_csv_header_method (const program & prog,
std::ostream & o 
)
+
+ +

Definition at line 2926 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::generate_write_csv_method (const program & prog,
const std::string & model_name,
std::ostream & o 
)
+
+ +

Definition at line 3497 of file generator.hpp.

+ +
+
+ +
+
+
+template<typename D >
+ + + + + + + + +
bool stan::gm::has_lb (const D & x)
+
+ +

Definition at line 36 of file generator.hpp.

+ +
+
+ +
+
+
+template<typename D >
+ + + + + + + + +
bool stan::gm::has_lub (const D & x)
+
+ +

Definition at line 28 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
bool stan::gm::has_non_param_var (const expression & e,
const variable_map & var_map 
)
+
+ +

Definition at line 481 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
bool stan::gm::has_rng_suffix (const std::string & s)
+
+ +

Definition at line 1039 of file ast_def.cpp.

+ +
+
+ +
+
+
+template<typename D >
+ + + + + + + + +
bool stan::gm::has_ub (const D & x)
+
+ +

Definition at line 32 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
bool stan::gm::has_var (const expression & e,
const variable_map & var_map 
)
+
+ +

Definition at line 435 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
const std::string stan::gm::INDENT (" " )
+
+ +
+
+ +
+
+ + + + + + + + +
const std::string stan::gm::INDENT2 (" " )
+
+ +
+
+ +
+
+ + + + + + + + +
const std::string stan::gm::INDENT3 (" " )
+
+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
expr_type stan::gm::infer_type_indexing (const base_expr_type & expr_base_type,
size_t num_expr_dims,
size_t num_index_dims 
)
+
+ +

Definition at line 587 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
expr_type stan::gm::infer_type_indexing (const expression & expr,
size_t num_index_dims 
)
+
+ +

Definition at line 606 of file ast_def.cpp.

+ +
+
+ +
+
+
+template<class Sampler >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::gm::init_adapt (Sampler * sampler,
const double delta,
const double gamma,
const double kappa,
const double t0,
const Eigen::VectorXd & cont_params 
)
+
+ +

Definition at line 211 of file command.hpp.

+ +
+
+ +
+
+
+template<class Sampler >
+ + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::gm::init_adapt (stan::mcmc::base_mcmcsampler,
categorical_argument * adapt,
const Eigen::VectorXd & cont_params 
)
+
+ +

Definition at line 239 of file command.hpp.

+ +
+
+ +
+
+
+template<class Sampler >
+ + + + + + + + + + + + + + + + + + +
bool stan::gm::init_nuts (stan::mcmc::base_mcmcsampler,
argument * algorithm 
)
+
+ +

Definition at line 190 of file command.hpp.

+ +
+
+ +
+
+
+template<class Sampler >
+ + + + + + + + + + + + + + + + + + +
bool stan::gm::init_static_hmc (stan::mcmc::base_mcmcsampler,
argument * algorithm 
)
+
+ +

Definition at line 169 of file command.hpp.

+ +
+
+ +
+
+
+template<class Sampler >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::gm::init_windowed_adapt (stan::mcmc::base_mcmcsampler,
categorical_argument * adapt,
unsigned int num_warmup,
const Eigen::VectorXd & cont_params 
)
+
+ +

Definition at line 253 of file command.hpp.

+ +
+
+ +
+
+ + + + + + + + +
bool stan::gm::is_nil (const expression & e)
+
+ +

Definition at line 500 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
bool stan::gm::is_nonempty (std::string & s)
+
+ +

Definition at line 50 of file parser.hpp.

+ +
+
+ +
+
+ + + + + + + + +
bool stan::gm::is_space (char c)
+
+ +

Definition at line 46 of file parser.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
std::ostream & stan::gm::operator<< (std::ostream & o,
const expr_type & et 
)
+
+ +

Definition at line 92 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::gm::parse (std::ostream * output_stream,
std::istream & input,
const std::string & filename,
const std::string & model_name,
program & result 
)
+
+inline
+
+ +

Definition at line 62 of file parser.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::print_progress (int m,
int start,
int finish,
int refresh,
bool warmup 
)
+
+ +

Definition at line 81 of file command.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
static void stan::gm::print_quoted_expression (std::ostream & o,
const expression & e 
)
+
+static
+
+ +

Definition at line 224 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
static void stan::gm::print_string_literal (std::ostream & o,
const std::string & s 
)
+
+static
+
+ +

Definition at line 213 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
void stan::gm::print_var_origin (std::ostream & o,
const var_origin & vo 
)
+
+ +

Definition at line 658 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
expr_type stan::gm::promote_primitive (const expr_type & et)
+
+ +

Definition at line 99 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
expr_type stan::gm::promote_primitive (const expr_type & et1,
const expr_type & et2 
)
+
+ +

Definition at line 105 of file ast_def.cpp.

+ +
+
+ +
+
+
+template<class Model , class RNG >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::run_markov_chain (stan::mcmc::base_mcmcsampler,
int num_iterations,
int start,
int finish,
int num_thin,
int refresh,
bool save,
bool warmup,
stan::io::mcmc_writer< Model > & writer,
stan::mcmc::sampleinit_s,
Model & model,
RNG & base_rng 
)
+
+ +

Definition at line 101 of file command.hpp.

+ +
+
+ +
+
+
+template<class Model , class RNG >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::sample (stan::mcmc::base_mcmcsampler,
int num_warmup,
int num_samples,
int num_thin,
int refresh,
bool save,
stan::io::mcmc_writer< Model > & writer,
stan::mcmc::sampleinit_s,
Model & model,
RNG & base_rng 
)
+
+ +

Definition at line 149 of file command.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::suppress_warning (const std::string & indent,
const std::string & var_name,
std::ostream & o 
)
+
+ +

Definition at line 2093 of file generator.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + +
std::string stan::gm::to_string (i)
+
+ +

Definition at line 41 of file generator.hpp.

+ +
+
+ +
+
+ + + + + + + + +
size_t stan::gm::total_dims (const std::vector< std::vector< expression > > & dimss)
+
+ +

Definition at line 579 of file ast_def.cpp.

+ +
+
+ +
+
+
+template<class Model , class RNG >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::warmup (stan::mcmc::base_mcmcsampler,
int num_warmup,
int num_samples,
int num_thin,
int refresh,
bool save,
stan::io::mcmc_writer< Model > & writer,
stan::mcmc::sampleinit_s,
Model & model,
RNG & base_rng 
)
+
+ +

Definition at line 130 of file command.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
std::ostream & stan::gm::write_base_expr_type (std::ostream & o,
base_expr_type type 
)
+
+ +

Definition at line 23 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
void stan::gm::write_error_msg (std::ostream * error_stream,
const std::domain_error & e 
)
+
+ +

Definition at line 57 of file command.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::write_model (std::ostream * s,
std::string model_name,
const char prefix = '\0' 
)
+
+ +

Definition at line 50 of file command.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
void stan::gm::write_stan (std::ostream * s,
const char prefix = '\0' 
)
+
+ +

Definition at line 41 of file command.hpp.

+ +
+
+

Variable Documentation

+ +
+
+ + + + +
boost::phoenix::function<add_conditional_body> stan::gm::add_conditional_body_f
+
+ +

Definition at line 83 of file statement_2_grammar_def.hpp.

+ +
+
+ +
+
+ + + + +
boost::phoenix::function<add_conditional_condition> stan::gm::add_conditional_condition_f
+
+ +

Definition at line 73 of file statement_2_grammar_def.hpp.

+ +
+
+ +
+
+ + + + +
boost::phoenix::function<add_expression_dimss> stan::gm::add_expression_dimss_f
+
+ +

Definition at line 361 of file term_grammar_def.hpp.

+ +
+
+ +
+
+ + + + +
boost::phoenix::function<add_loop_identifier> stan::gm::add_loop_identifier_f
+
+ +

Definition at line 383 of file statement_grammar_def.hpp.

+ +
+
+ +
+
+ + + + +
boost::phoenix::function<add_while_body> stan::gm::add_while_body_f
+
+ +

Definition at line 361 of file statement_grammar_def.hpp.

+ +
+
+ +
+
+ + + + +
boost::phoenix::function<add_while_condition> stan::gm::add_while_condition_f
+
+ +

Definition at line 351 of file statement_grammar_def.hpp.

+ +
+
+ +
+
+ + + + +
boost::phoenix::function<addition_expr> stan::gm::addition
+
+ +

Definition at line 140 of file expression_grammar_def.hpp.

+ +
+
+ +
+
+ + + + +
boost::phoenix::function<binary_op_expr> stan::gm::binary_op_f
+
+ +

Definition at line 116 of file expression_grammar_def.hpp.

+ +
+
+ +
+
+ + + + +
const int stan::gm::data_origin = 1
+
+ +

Definition at line 370 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
const int stan::gm::derived_origin = 5
+
+ +

Definition at line 374 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
boost::phoenix::function<division_expr> stan::gm::division
+
+ +

Definition at line 200 of file term_grammar_def.hpp.

+ +
+
+ +
+
+ + + + +
const int stan::gm::DOUBLE_T = 2
+
+ +

Definition at line 60 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
boost::phoenix::function<elt_division_expr> stan::gm::elt_division
+
+ +

Definition at line 278 of file term_grammar_def.hpp.

+ +
+
+ +
+
+ + + + +
boost::phoenix::function<elt_multiplication_expr> stan::gm::elt_multiplication
+
+ +

Definition at line 254 of file term_grammar_def.hpp.

+ +
+
+ +
+
+ + + + +
boost::phoenix::function<expression_as_statement> stan::gm::expression_as_statement_f
+
+ +

Definition at line 323 of file statement_grammar_def.hpp.

+ +
+
+ +
+
+ + + + +
const int stan::gm::ILL_FORMED_T = 6
+
+ +

Definition at line 64 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
const int stan::gm::INT_T = 1
+
+ +

Definition at line 59 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
boost::phoenix::function<left_division_expr> stan::gm::left_division
+
+ +

Definition at line 230 of file term_grammar_def.hpp.

+ +
+
+ +
+
+ + + + +
const int stan::gm::local_origin = 6
+
+ +

Definition at line 375 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
boost::phoenix::function<logical_negate_expr> stan::gm::logical_negate_expr_f
+
+ +

Definition at line 322 of file term_grammar_def.hpp.

+ +
+
+ +
+
+ + + + +
const int stan::gm::MATRIX_T = 5
+
+ +

Definition at line 63 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
const int stan::gm::model_name_origin = 0
+
+ +

Definition at line 369 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
boost::phoenix::function<multiplication_expr> stan::gm::multiplication
+
+ +

Definition at line 154 of file term_grammar_def.hpp.

+ +
+
+ +
+
+ + + + +
boost::phoenix::function<negate_expr> stan::gm::negate_expr_f
+
+ +

Definition at line 302 of file term_grammar_def.hpp.

+ +
+
+ +
+
+ + + + +
const int stan::gm::parameter_origin = 3
+
+ +

Definition at line 372 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
boost::phoenix::function<remove_loop_identifier> stan::gm::remove_loop_identifier_f
+
+ +

Definition at line 393 of file statement_grammar_def.hpp.

+ +
+
+ +
+
+ + + + +
const int stan::gm::ROW_VECTOR_T = 4
+
+ +

Definition at line 62 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
boost::phoenix::function<set_fun_type2> stan::gm::set_fun_type2_f
+
+ +

Definition at line 85 of file expression_grammar_def.hpp.

+ +
+
+ +
+
+ + + + +
boost::phoenix::function<set_fun_type> stan::gm::set_fun_type_f
+
+ +

Definition at line 88 of file term_grammar_def.hpp.

+ +
+
+ +
+
+ + + + +
boost::phoenix::function<set_fun_type_named> stan::gm::set_fun_type_named_f
+
+ +

Definition at line 129 of file term_grammar_def.hpp.

+ +
+
+ +
+
+ + + + +
boost::phoenix::function<set_var_type> stan::gm::set_var_type_f
+
+ +

Definition at line 391 of file term_grammar_def.hpp.

+ +
+
+ +
+
+ + + + +
boost::phoenix::function<subtraction_expr> stan::gm::subtraction
+
+ +

Definition at line 163 of file expression_grammar_def.hpp.

+ +
+
+ +
+
+ + + + +
const int stan::gm::transformed_data_origin = 2
+
+ +

Definition at line 371 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
const int stan::gm::transformed_parameter_origin = 4
+
+ +

Definition at line 373 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
boost::phoenix::function<transpose_expr> stan::gm::transpose_f
+
+ +

Definition at line 341 of file term_grammar_def.hpp.

+ +
+
+ +
+
+ + + + +
boost::phoenix::function<unscope_locals> stan::gm::unscope_locals_f
+
+ +

Definition at line 334 of file statement_grammar_def.hpp.

+ +
+
+ +
+
+ + + + +
boost::phoenix::function<validate_allow_sample> stan::gm::validate_allow_sample_f
+
+ +

Definition at line 425 of file statement_grammar_def.hpp.

+ +
+
+ +
+
+ + + + +
boost::phoenix::function<validate_assignment> stan::gm::validate_assignment_f
+
+ +

Definition at line 158 of file statement_grammar_def.hpp.

+ +
+
+ +
+
+ + + + +
boost::phoenix::function<validate_expr_type2> stan::gm::validate_expr_type2_f
+
+ +

Definition at line 67 of file expression_grammar_def.hpp.

+ +
+
+ +
+
+ + + + +
boost::phoenix::function<validate_expr_type> stan::gm::validate_expr_type_f
+
+ +

Definition at line 423 of file term_grammar_def.hpp.

+ +
+
+ +
+
+ + + + +
boost::phoenix::function<validate_int_expr2> stan::gm::validate_int_expr2_f
+
+ +

Definition at line 409 of file statement_grammar_def.hpp.

+ +
+
+ +
+
+ + + + +
boost::phoenix::function<validate_int_expr3> stan::gm::validate_int_expr3_f
+
+ +

Definition at line 407 of file term_grammar_def.hpp.

+ +
+
+ +
+
+ + + + +
boost::phoenix::function<validate_sample> stan::gm::validate_sample_f
+
+ +

Definition at line 295 of file statement_grammar_def.hpp.

+ +
+
+ +
+
+ + + + +
const int stan::gm::VECTOR_T = 3
+
+ +

Definition at line 61 of file ast.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacestan_1_1io.html b/doc/api/html/namespacestan_1_1io.html new file mode 100644 index 00000000000..a0f8218dcc6 --- /dev/null +++ b/doc/api/html/namespacestan_1_1io.html @@ -0,0 +1,413 @@ + + + + + +Stan: stan::io Namespace Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::io Namespace Reference
+
+
+ +

Input/output utilities. +More...

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Classes

class  cmd_line
 Parses and stores command-line arguments. More...
 
class  csv_writer
 Writes Stan variables in comma-separated-value format to an output stream. More...
 
class  dump_writer
 Writes data into the S-plus dump format. More...
 
class  dump_reader
 Reads data from S-plus dump format. More...
 
class  dump
 Represents named arrays with dimensions. More...
 
class  mcmc_writer
 
class  reader
 A stream-based reader for integer, scalar, vector, matrix and array data types, with Jacobian calculations. More...
 
struct  stan_csv_metadata
 
struct  stan_csv_adaptation
 
struct  stan_csv_timing
 
struct  stan_csv
 
class  stan_csv_reader
 Reads from a Stan output csv file. More...
 
class  var_context
 A var_reader reads array variables of integer and floating point type by name and dimension. More...
 
class  writer
 A stream-based writer for integer, scalar, vector, matrix and array data types, which transforms from constrained to a sequence of constrained variables. More...
 
+ + + + + + + + + + + + + + + + + + + +

+Functions

void pad_help_option (std::ostream *o, const std::string &option="", unsigned int width=20)
 Print help option with padding.
 
void print_help_helper (std::ostream *o, const std::string &key_val, const std::string &msg, const std::string &note="")
 Prints single print option to output ptr if non-null.
 
void print_help_option (std::ostream *o, const std::string &key, const std::string &value_type, const std::string &msg, const std::string &note="")
 Prints single print option to output ptr if non-null.
 
template<>
bool cmd_line::bare< std::string > (size_t n, std::string &x) const
 
template<>
bool cmd_line::val< std::string > (const std::string &key, std::string &x) const
 
std::string utc_time_string ()
 Return the current coordinated universal time (UTC) as a string.
 
+

Detailed Description

+

Input/output utilities.

+

Function Documentation

+ +
+
+
+template<>
+ + + + + + + + + + + + + + + + + + +
bool stan::io::cmd_line::bare< std::string > (size_t n,
std::string & x 
) const
+
+ +

Definition at line 274 of file cmd_line.hpp.

+ +
+
+ +
+
+
+template<>
+ + + + + + + + + + + + + + + + + + +
bool stan::io::cmd_line::val< std::string > (const std::string & key,
std::string & x 
) const
+
+ +

Definition at line 284 of file cmd_line.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::io::pad_help_option (std::ostream * o,
const std::string & option = "",
unsigned int width = 20 
)
+
+ +

Print help option with padding.

+

Print 2 spaces, the specified help option, then pad to the specified width with spaces. If there is not room for at least 2 padding spaces, start a new line and pad out to width.

+
Parameters
+ + + + +
optionOption to print (default to empty string).
widthWidth of option (defaults to 20).
oOutput stream ptr, default to null
+
+
+ +

Definition at line 27 of file cmd_line.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::io::print_help_helper (std::ostream * o,
const std::string & key_val,
const std::string & msg,
const std::string & note = "" 
)
+
+ +

Prints single print option to output ptr if non-null.

+
Parameters
+ + + + + +
o
key_val
msg
note
+
+
+ +

Definition at line 49 of file cmd_line.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::io::print_help_option (std::ostream * o,
const std::string & key,
const std::string & value_type,
const std::string & msg,
const std::string & note = "" 
)
+
+ +

Prints single print option to output ptr if non-null.

+
Parameters
+ + + + + + +
o
key
value_type
msg
note
+
+
+ +

Definition at line 74 of file cmd_line.hpp.

+ +
+
+ +
+
+ + + + + + + +
std::string stan::io::utc_time_string ()
+
+ +

Return the current coordinated universal time (UTC) as a string.

+

Output is of the form "Fri Feb 24 21:15:36 2012"

+
Returns
String representation of current UTC.
+ +

Definition at line 18 of file util.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacestan_1_1math.html b/doc/api/html/namespacestan_1_1math.html new file mode 100644 index 00000000000..41ad3e1472b --- /dev/null +++ b/doc/api/html/namespacestan_1_1math.html @@ -0,0 +1,17498 @@ + + + + + +Stan: stan::math Namespace Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::math Namespace Reference
+
+
+ +

Matrices and templated mathematical functions. +More...

+ + + + + +

+Namespaces

namespace  policies
 Extending boost functionality.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Classes

class  LDLT_factor< stan::agrad::var, R, C >
 
class  accumulator
 Class to accumulate values and eventually return their sum. More...
 
struct  array_builder
 Structure for building up arrays in an expression (rather than in statements) using an argumentchaining add() method and a getter method array() to return the result. More...
 
struct  common_type
 
struct  common_type< std::vector< T1 >, std::vector< T2 > >
 
struct  common_type< Eigen::Matrix< T1, R, C >, Eigen::Matrix< T2, R, C > >
 
class  LDLT_factor< double, R, C >
 
struct  promoter
 
struct  promoter< T, T >
 
struct  promoter< std::vector< F >, std::vector< T > >
 
struct  promoter< std::vector< T >, std::vector< T > >
 
struct  promoter< Eigen::Matrix< F, R, C >, Eigen::Matrix< T, R, C > >
 
struct  promoter< Eigen::Matrix< T, R, C >, Eigen::Matrix< T, R, C > >
 
struct  store_type
 
struct  store_type< double >
 
struct  store_type< int >
 
struct  pass_type
 
struct  pass_type< double >
 
struct  pass_type< int >
 
class  seq_view
 
class  seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, 1 > >
 
class  seq_view< T, Eigen::Matrix< S, 1, Eigen::Dynamic > >
 
class  seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, Eigen::Dynamic > >
 
class  seq_view< T, std::vector< S > >
 
class  seq_view< T, std::vector< T > >
 
class  seq_view< T, std::vector< std::vector< T > > >
 
class  seq_view< double, std::vector< int > >
 
+ + + + + + + + + + + + +

+Typedefs

typedef Eigen::Matrix< double,
+Eigen::Dynamic, Eigen::Dynamic >
+::Index 
size_type
 
typedef Eigen::Matrix< double,
+Eigen::Dynamic, Eigen::Dynamic > 
matrix_d
 Type for matrix of double values.
 
typedef Eigen::Matrix< double,
+Eigen::Dynamic, 1 > 
vector_d
 Type for (column) vector of double values.
 
typedef Eigen::Matrix< double,
+1, Eigen::Dynamic > 
row_vector_d
 Type for (row) vector of double values.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

double pi ()
 Return the value of pi.
 
double e ()
 Return the base of the natural logarithm.
 
double sqrt2 ()
 Return the square root of two.
 
double log10 ()
 Return natural logarithm of ten.
 
double positive_infinity ()
 Return positive infinity.
 
double negative_infinity ()
 Return negative infinity.
 
double not_a_number ()
 Return (quiet) not-a-number.
 
double machine_precision ()
 Returns the difference between 1.0 and the next value representable.
 
template<typename T_y , typename T_low , typename T_high , typename T_result >
bool check_bounded (const char *function, const T_y &y, const T_low &low, const T_high &high, const char *name, T_result *result)
 
template<typename T_y , typename T_low , typename T_high >
bool check_bounded (const char *function, const T_y &y, const T_low &low, const T_high &high, const char *name)
 
template<typename T , typename T_result >
bool check_consistent_size (size_t max_size, const char *function, const T &x, const char *name, T_result *result)
 
template<typename T1 , typename T2 , typename T_result >
bool check_consistent_sizes (const char *function, const T1 &x1, const T2 &x2, const char *name1, const char *name2, T_result *result)
 
template<typename T1 , typename T2 , typename T3 , typename T_result >
bool check_consistent_sizes (const char *function, const T1 &x1, const T2 &x2, const T3 &x3, const char *name1, const char *name2, const char *name3, T_result *result)
 
template<typename T1 , typename T2 , typename T3 , typename T4 , typename T_result >
bool check_consistent_sizes (const char *function, const T1 &x1, const T2 &x2, const T3 &x3, const T4 &x4, const char *name1, const char *name2, const char *name3, const char *name4, T_result *result)
 
template<typename T_y , typename T_result >
bool check_finite (const char *function, const T_y &y, const char *name, T_result *result)
 Checks if the variable y is finite.
 
template<typename T >
bool check_finite (const char *function, const T &y, const char *name)
 
template<typename T_y , typename T_low , typename T_result >
bool check_greater (const char *function, const T_y &y, const T_low &low, const char *name, T_result *result)
 
template<typename T_y , typename T_low >
bool check_greater (const char *function, const T_y &y, const T_low &low, const char *name)
 
template<typename T_y , typename T_low , typename T_result >
bool check_greater_or_equal (const char *function, const T_y &y, const T_low &low, const char *name, T_result *result)
 
template<typename T_y , typename T_low >
bool check_greater_or_equal (const char *function, const T_y &y, const T_low &low, const char *name)
 
template<typename T_y , typename T_high , typename T_result >
bool check_less (const char *function, const T_y &y, const T_high &high, const char *name, T_result *result)
 
template<typename T_y , typename T_high >
bool check_less (const char *function, const T_y &y, const T_high &high, const char *name)
 
template<typename T_y , typename T_high , typename T_result >
bool check_less_or_equal (const char *function, const T_y &y, const T_high &high, const char *name, T_result *result)
 
template<typename T_y , typename T_high >
bool check_less_or_equal (const char *function, const T_y &y, const T_high &high, const char *name)
 
template<typename T_y , typename T_result >
bool check_nonnegative (const char *function, const T_y &y, const char *name, T_result *result)
 
template<typename T_y >
bool check_nonnegative (const char *function, const T_y &y, const char *name)
 
template<typename T_y , typename T_result >
bool check_not_nan (const char *function, const T_y &y, const char *name, T_result *result=0)
 Checks if the variable y is nan.
 
template<typename T >
bool check_not_nan (const char *function, const T &y, const char *name)
 
template<typename T_y , typename T_result >
bool check_positive (const char *function, const T_y &y, const char *name, T_result *result)
 
template<typename T >
bool check_positive (const char *function, const T &x, const char *name)
 
template<typename T_y , typename T_result , typename T_msg2 >
bool dom_err (const char *function, const T_y &y, const char *name, const char *error_msg, T_msg2 error_msg2, T_result *result)
 
template<typename T_y , typename T_result , typename T_msg2 >
bool dom_err_vec (size_t i, const char *function, const T_y &y, const char *name, const char *error_msg, T_msg2 error_msg2, T_result *result)
 
template<typename T_y , typename T_result >
bool check_cholesky_factor (const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)
 Return true if the specified matrix is a valid Cholesky factor.
 
template<typename T >
bool check_cholesky_factor (const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)
 
template<typename T_y , typename T_result >
bool check_cholesky_factor (const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, T_result *result)
 Return true if the specified matrix is a valid Cholesky factor (lower triangular, positive diagonal).
 
template<typename T >
bool check_cholesky_factor (const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, T *result=0)
 
template<typename T_y , typename T_result >
bool check_corr_matrix (const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)
 Return true if the specified matrix is a valid correlation matrix.
 
template<typename T >
bool check_corr_matrix (const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)
 
template<typename T_y , typename T_result >
bool check_cov_matrix (const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)
 Return true if the specified matrix is a valid covariance matrix.
 
template<typename T >
bool check_cov_matrix (const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)
 
template<typename T_covar , typename T_result >
bool check_cov_matrix (const char *function, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma, T_result *result)
 Return true if the specified matrix is a valid covariance matrix.
 
template<typename T >
bool check_cov_matrix (const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &Sigma, T *result=0)
 
template<typename T_y , typename T_result >
bool check_lower_triangular (const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)
 Return true if the specified matrix is lower triangular.
 
template<typename T >
bool check_lower_triangular (const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)
 
template<typename T_y , typename T_result >
bool check_ordered (const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const char *name, T_result *result)
 Return true if the specified vector is sorted into increasing order.
 
template<typename T >
bool check_ordered (const char *function, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &y, const char *name, T *result=0)
 
template<typename T_y , typename T_result >
bool check_pos_definite (const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)
 Return true if the specified matrix is positive definite.
 
template<typename T >
bool check_pos_definite (const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)
 
template<typename T_y , typename T_result >
bool check_pos_semidefinite (const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)
 Return true if the specified matrix is positive definite.
 
template<typename T >
bool check_pos_semidefinite (const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)
 
template<typename T_y , typename T_result >
bool check_positive_ordered (const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const char *name, T_result *result)
 Return true if the specified vector contains only non-negative values and is sorted into increasing order.
 
template<typename T >
bool check_positive_ordered (const char *function, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &y, const char *name, T *result=0)
 
template<typename T_prob , typename T_result >
bool check_simplex (const char *function, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta, const char *name, T_result *result)
 Return true if the specified vector is simplex.
 
template<typename T >
bool check_simplex (const char *function, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &theta, const char *name, T *result=0)
 
template<typename T_size1 , typename T_size2 , typename T_result >
bool check_size_match (const char *function, T_size1 i, const char *name_i, T_size2 j, const char *name_j, T_result *result)
 
template<typename T_size1 , typename T_size2 >
bool check_size_match (const char *function, T_size1 i, const char *name_i, T_size2 j, const char *name_j, T_size1 *result=0)
 
template<typename T_y , typename T_result >
bool check_spsd_matrix (const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)
 Return true if the specified matrix is a square, symmetric, and positive semi-definite.
 
template<typename T >
bool check_spsd_matrix (const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)
 
template<typename T_y , typename T_result >
bool check_square (const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)
 Return true if the specified matrix is square.
 
template<typename T >
bool check_square (const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)
 
template<typename T_y , typename T_result >
bool check_symmetric (const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)
 Return true if the specified matrix is symmetric.
 
template<typename T >
bool check_symmetric (const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)
 
template<typename T_prob , typename T_result >
bool check_unit_vector (const char *function, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta, const char *name, T_result *result)
 Return true if the specified vector is unit vector.
 
template<typename T >
bool check_unit_vector (const char *function, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &theta, const char *name, T *result=0)
 
void validate_non_negative_index (const std::string &var_name, const std::string &expr, int val)
 
double abs (double x)
 Return floating-point absolute value.
 
template<typename T >
int as_bool (const T x)
 Return 1 if the argument is unequal to zero and 0 otherwise.
 
template<>
int as_bool< int > (const int x)
 Return an integer with an equivalent boolean value to specified input.
 
template<typename T2 >
T2 bessel_first_kind (const int v, const T2 z)
 
template<typename T2 >
T2 bessel_second_kind (const int v, const T2 z)
 
template<typename T >
boost::math::tools::promote_args
+< T >::type 
binary_log_loss (const int y, const T y_hat)
 Returns the log loss function for binary classification with specified reference and response values.
 
template<typename T_N , typename T_n >
boost::math::tools::promote_args
+< T_N, T_n >::type 
binomial_coefficient_log (const T_N N, const T_n n)
 Return the log of the binomial coefficient for the specified arguments.
 
double digamma (double x)
 
double dist (const std::vector< double > &x, const std::vector< double > &y)
 
double dot (const std::vector< double > &x, const std::vector< double > &y)
 
double dot_self (const std::vector< double > &x)
 
template<typename T >
boost::math::tools::promote_args
+< T >::type 
exp2 (const T y)
 Return the exponent base 2 of the specified argument (C99).
 
template<typename T1 , typename T2 >
boost::math::tools::promote_args
+< T1, T2 >::type 
falling_factorial (const T1 x, const T2 n)
 
template<typename T1 , typename T2 >
boost::math::tools::promote_args
+< T1, T2 >::type 
fdim (T1 a, T2 b)
 The positive difference function (C99).
 
template<typename T1 , typename T2 , typename T3 >
boost::math::tools::promote_args
+< T1, T2, T3 >::type 
fma (const T1 a, const T2 b, const T3 c)
 The fused multiply-add operation (C99).
 
double gamma_p (double x, double a)
 
double gamma_q (double x, double a)
 
double ibeta (const double a, const double b, const double x)
 The normalized incomplete beta function of a, b, and x.
 
template<typename T_true , typename T_false >
boost::math::tools::promote_args
+< T_true, T_false >::type 
if_else (const bool c, const T_true y_true, const T_false y_false)
 Return the second argument if the first argument is true and otherwise return the second argument.
 
template<typename T >
unsigned int int_step (const T y)
 The integer step, or Heaviside, function.
 
template<typename T >
boost::math::tools::promote_args
+< T >::type 
inv (const T x)
 
template<typename T >
boost::math::tools::promote_args
+< T >::type 
inv_cloglog (T x)
 The inverse complementary log-log function.
 
template<typename T >
boost::math::tools::promote_args
+< T >::type 
inv_logit (const T a)
 Returns the inverse logit function applied to the argument.
 
template<typename T >
boost::math::tools::promote_args
+< T >::type 
inv_sqrt (const T x)
 
template<typename T >
boost::math::tools::promote_args
+< T >::type 
inv_square (const T x)
 
template<typename Vector >
void inverse_softmax (const Vector &simplex, Vector &y)
 Writes the inverse softmax of the simplex argument into the second argument.
 
template<typename T >
bool is_uninitialized (T x)
 Returns true if the specified variable is uninitialized.
 
template<typename T1 , typename T2 >
boost::math::tools::promote_args
+< T1, T2 >::type 
lbeta (const T1 a, const T2 b)
 Return the log of the beta function applied to the specified arguments.
 
double lgamma (double x)
 
template<typename T >
boost::math::tools::promote_args
+< T >::type 
lmgamma (const int k, T x)
 Return the natural logarithm of the multivariate gamma function with the speciifed dimensions and argument.
 
template<typename T >
boost::math::tools::promote_args
+< T >::type 
log1m (T x)
 Return the natural logarithm of one minus the specified value.
 
template<typename T >
boost::math::tools::promote_args
+< T >::type 
log1m_exp (const T a)
 Calculates the log of 1 minus the exponential of the specified value without overflow log1m_exp(x) = log(1-exp(x)).
 
template<typename T >
boost::math::tools::promote_args
+< T >::type 
log1m_inv_logit (const T u)
 Returns the natural logarithm of 1 minus the inverse logit of the specified argument.
 
template<typename T >
boost::math::tools::promote_args
+< T >::type 
log1p (const T x)
 Return the natural logarithm of one plus the specified value.
 
template<typename T >
boost::math::tools::promote_args
+< T >::type 
log1p_exp (const T a)
 Calculates the log of 1 plus the exponential of the specified value without overflow.
 
template<typename T >
boost::math::tools::promote_args
+< T >::type 
log2 (const T a)
 Returns the base 2 logarithm of the argument (C99).
 
double log2 ()
 Return natural logarithm of two.
 
template<typename T1 , typename T2 >
boost::math::tools::promote_args
+< T1, T2 >::type 
log_diff_exp (const T1 x, const T2 y)
 The natural logarithm of the difference of the natural exponentiation of x1 and the natural exponentiation of x2.
 
template<typename T1 , typename T2 >
boost::math::tools::promote_args
+< T1, T2 >::type 
log_falling_factorial (const T1 x, const T2 n)
 
template<typename T >
boost::math::tools::promote_args
+< T >::type 
log_inv_logit (const T &u)
 Returns the natural logarithm of the inverse logit of the specified argument.
 
template<typename T1 , typename T2 >
boost::math::tools::promote_args
+< T1, T2 >::type 
log_rising_factorial (const T1 x, const T2 n)
 
template<typename T1 , typename T2 >
boost::math::tools::promote_args
+< T1, T2 >::type 
log_sum_exp (const T2 &a, const T1 &b)
 Calculates the log sum of exponetials without overflow.
 
template<typename T >
log_sum_exp (const std::vector< T > &x)
 Return the log of the sum of the exponentiated values of the specified sequence of values.
 
template<typename T1 , typename T2 >
int logical_and (const T1 x1, const T2 x2)
 The logical and function which returns 1 if both arguments are unequal to zero and 0 otherwise.
 
template<typename T1 , typename T2 >
int logical_eq (const T1 x1, const T2 x2)
 Return 1 if the first argument is equal to the second.
 
template<typename T1 , typename T2 >
int logical_gt (const T1 x1, const T2 x2)
 Return 1 if the first argument is strictly greater than the second.
 
template<typename T1 , typename T2 >
int logical_gte (const T1 x1, const T2 x2)
 Return 1 if the first argument is greater than or equal to the second.
 
template<typename T1 , typename T2 >
int logical_lt (T1 x1, T2 x2)
 Return 1 if the first argument is strictly less than the second.
 
template<typename T1 , typename T2 >
int logical_lte (const T1 x1, const T2 x2)
 Return 1 if the first argument is less than or equal to the second.
 
template<typename T >
int logical_negation (const T x)
 The logical negation function which returns 1 if the input is equal to zero and 0 otherwise.
 
template<typename T1 , typename T2 >
int logical_neq (const T1 x1, const T2 x2)
 Return 1 if the first argument is unequal to the second.
 
template<typename T1 , typename T2 >
int logical_or (T1 x1, T2 x2)
 The logical or function which returns 1 if either argument is unequal to zero and 0 otherwise.
 
template<typename T >
boost::math::tools::promote_args
+< T >::type 
logit (const T a)
 Returns the logit function applied to the argument.
 
double max (const double a, const double b)
 
double min (const double a, const double b)
 
template<typename T2 >
T2 modified_bessel_first_kind (const int v, const T2 z)
 
template<typename T2 >
T2 modified_bessel_second_kind (const int v, const T2 z)
 
template<typename T_a , typename T_b >
boost::math::tools::promote_args
+< T_a, T_b >::type 
multiply_log (const T_a a, const T_b b)
 Calculated the value of the first argument times log of the second argument while behaving properly with 0 inputs.
 
template<typename T1 , typename T2 >
boost::math::tools::promote_args
+< T1, T2 >::type 
owens_t (const T1 &h, const T2 &a)
 The Owen's T function of h and a.
 
template<typename T >
boost::math::tools::promote_args
+< T >::type 
Phi (const T x)
 The unit normal cumulative distribution function.
 
template<typename T >
boost::math::tools::promote_args
+< T >::type 
Phi_approx (T x)
 Approximation of the unit normal CDF.
 
template<typename T1 , typename T2 >
boost::math::tools::promote_args
+< T1, T2 >::type 
rising_factorial (const T1 x, const T2 n)
 
void scaled_add (std::vector< double > &x, const std::vector< double > &y, const double lambda)
 
template<typename T >
square (const T x)
 Return the square of the specified argument.
 
template<typename T >
int step (const T y)
 The step, or Heaviside, function.
 
void sub (std::vector< double > &x, std::vector< double > &y, std::vector< double > &result)
 
double sum (std::vector< double > &x)
 
template<typename T >
trigamma (T x)
 
template<typename T >
double value_of (const T x)
 Return the value of the specified scalar argument converted to a double value.
 
template<>
double value_of< double > (const double x)
 Return the specified argument.
 
template<typename T1 , typename T2 , int R, int C>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R, C > 
add (const Eigen::Matrix< T1, R, C > &m1, const Eigen::Matrix< T2, R, C > &m2)
 Return the sum of the specified matrices.
 
template<typename T1 , typename T2 , int R, int C>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R, C > 
add (const Eigen::Matrix< T1, R, C > &m, const T2 &c)
 Return the sum of the specified matrix and specified scalar.
 
template<typename T1 , typename T2 , int R, int C>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R, C > 
add (const T1 &c, const Eigen::Matrix< T2, R, C > &m)
 Return the sum of the specified scalar and specified matrix.
 
template<typename LHS , typename RHS >
void assign (LHS &lhs, const RHS &rhs)
 Copy the right-hand side's value to the left-hand side variable.
 
template<typename LHS , typename RHS , int R1, int C1, int R2, int C2>
void assign (Eigen::Matrix< LHS, R1, C1 > &x, const Eigen::Matrix< RHS, R2, C2 > &y)
 Copy the right-hand side's value to the left-hand side variable.
 
template<typename LHS , typename RHS , int R, int C>
void assign (Eigen::Matrix< LHS, R, C > &x, const Eigen::Matrix< RHS, R, C > &y)
 Copy the right-hand side's value to the left-hand side variable.
 
template<typename LHS , typename RHS , int R, int C>
void assign (Eigen::Block< LHS > x, const Eigen::Matrix< RHS, R, C > &y)
 Copy the right-hand side's value to the left-hand side variable.
 
template<typename LHS , typename RHS >
void assign (std::vector< LHS > &x, const std::vector< RHS > &y)
 Copy the right-hand side's value to the left-hand side variable.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
block (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &m, size_t i, size_t j, size_t nrows, size_t ncols)
 Return a nrows x ncols submatrix starting at (i-1,j-1).
 
void check_range (size_t max, size_t i, const char *msg, size_t idx)
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
cholesky_decompose (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &m)
 Return the lower-triangular Cholesky factor (i.e., matrix square root) of the specified square, symmetric matrix.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
col (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &m, size_t j)
 Return the specified column of the specified matrix using start-at-1 indexing.
 
template<typename T , int R, int C>
size_t cols (const Eigen::Matrix< T, R, C > &m)
 
template<int R1, int C1, int R2, int C2>
Eigen::Matrix< double, 1, C1 > columns_dot_product (const Eigen::Matrix< double, R1, C1 > &v1, const Eigen::Matrix< double, R2, C2 > &v2)
 Returns the dot product of the specified vectors.
 
template<typename T , int R, int C>
Eigen::Matrix< T, 1, C > columns_dot_self (const Eigen::Matrix< T, R, C > &x)
 Returns the dot product of each column of a matrix with itself.
 
matrix_d crossprod (const matrix_d &M)
 Returns the result of pre-multiplying a matrix by its own transpose.
 
template<typename T >
std::vector< T > cumulative_sum (const std::vector< T > &x)
 Return the cumulative sum of the specified vector.
 
template<typename T , int R, int C>
Eigen::Matrix< T, R, C > cumulative_sum (const Eigen::Matrix< T, R, C > &m)
 Return the cumulative sum of the specified matrix.
 
template<typename T , int R, int C>
determinant (const Eigen::Matrix< T, R, C > &m)
 Returns the determinant of the specified square matrix.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
diag_matrix (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v)
 Return a square diagonal matrix with the specified vector of coefficients as the diagonal values.
 
template<typename T1 , typename T2 , int R1, int C1, int R2, int C2>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R1, C1 > 
diag_post_multiply (const Eigen::Matrix< T1, R1, C1 > &m1, const Eigen::Matrix< T2, R2, C2 > &m2)
 
template<typename T1 , typename T2 , int R1, int C1, int R2, int C2>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R2, C2 > 
diag_pre_multiply (const Eigen::Matrix< T1, R1, C1 > &m1, const Eigen::Matrix< T2, R2, C2 > &m2)
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
diagonal (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &m)
 Return a column vector of the diagonal elements of the specified matrix.
 
template<typename T >
void dims (const T &x, std::vector< int > &result)
 
template<typename T , int R, int C>
void dims (const Eigen::Matrix< T, R, C > &x, std::vector< int > &result)
 
template<typename T >
void dims (const std::vector< T > &x, std::vector< int > &result)
 
template<typename T >
std::vector< int > dims (const T &x)
 
template<typename T1 , int R1, int C1, typename T2 , int R2, int C2>
boost::math::tools::promote_args
+< T1, T1 >::type 
dist (const Eigen::Matrix< T1, R1, C1 > &v1, const Eigen::Matrix< T2, R2, C2 > &v2)
 Returns the distance between the specified vectors.
 
template<int R, int C, typename T >
boost::enable_if_c
+< boost::is_arithmetic< T >
+::value, Eigen::Matrix< double,
+R, C > >::type 
divide (const Eigen::Matrix< double, R, C > &m, T c)
 Return specified matrix divided by specified scalar.
 
template<int R1, int C1, int R2, int C2>
double dot_product (const Eigen::Matrix< double, R1, C1 > &v1, const Eigen::Matrix< double, R2, C2 > &v2)
 Returns the dot product of the specified vectors.
 
double dot_product (const double *v1, const double *v2, size_t length)
 Returns the dot product of the specified arrays of doubles.
 
double dot_product (const std::vector< double > &v1, const std::vector< double > &v2)
 Returns the dot product of the specified arrays of doubles.
 
template<int R, int C>
double dot_self (const Eigen::Matrix< double, R, C > &v)
 Returns the dot product of the specified vector with itself.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
eigenvalues_sym (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &m)
 Return the eigenvalues of the specified symmetric matrix in descending order of magnitude.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
eigenvectors_sym (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &m)
 
template<typename T1 , typename T2 , int R, int C>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R, C > 
elt_divide (const Eigen::Matrix< T1, R, C > &m1, const Eigen::Matrix< T2, R, C > &m2)
 Return the elementwise division of the specified matrices matrices.
 
template<typename T1 , typename T2 , int R, int C>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R, C > 
elt_multiply (const Eigen::Matrix< T1, R, C > &m1, const Eigen::Matrix< T2, R, C > &m2)
 Return the elementwise multiplication of the specified matrices.
 
template<typename T , int Rows, int Cols>
Eigen::Matrix< T, Rows, Cols > exp (const Eigen::Matrix< T, Rows, Cols > &m)
 Return the element-wise exponentiation of the matrix or vector.
 
template<typename T , typename S >
void fill (T &x, const S &y)
 Fill the specified container with the specified value.
 
template<typename T , int R, int C, typename S >
void fill (Eigen::Matrix< T, R, C > &x, const S &y)
 Fill the specified container with the specified value.
 
template<typename T , typename S >
void fill (std::vector< T > &x, const S &y)
 Fill the specified container with the specified value.
 
template<typename T >
const T & get_base1 (const std::vector< T > &x, size_t i, const char *error_msg, size_t idx)
 Return a reference to the value of the specified vector at the specified base-one index.
 
template<typename T >
const T & get_base1 (const std::vector< std::vector< T > > &x, size_t i1, size_t i2, const char *error_msg, size_t idx)
 Return a reference to the value of the specified vector at the specified base-one indexes.
 
template<typename T >
const T & get_base1 (const std::vector< std::vector< std::vector< T > > > &x, size_t i1, size_t i2, size_t i3, const char *error_msg, size_t idx)
 Return a reference to the value of the specified vector at the specified base-one indexes.
 
template<typename T >
const T & get_base1 (const std::vector< std::vector< std::vector< std::vector< T > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, const char *error_msg, size_t idx)
 Return a reference to the value of the specified vector at the specified base-one indexes.
 
template<typename T >
const T & get_base1 (const std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, size_t i5, const char *error_msg, size_t idx)
 Return a reference to the value of the specified vector at the specified base-one indexes.
 
template<typename T >
const T & get_base1 (const std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, size_t i5, size_t i6, const char *error_msg, size_t idx)
 Return a reference to the value of the specified vector at the specified base-one indexes.
 
template<typename T >
const T & get_base1 (const std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, size_t i5, size_t i6, size_t i7, const char *error_msg, size_t idx)
 Return a reference to the value of the specified vector at the specified base-one indexes.
 
template<typename T >
const T & get_base1 (const std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, size_t i5, size_t i6, size_t i7, size_t i8, const char *error_msg, size_t idx)
 Return a reference to the value of the specified vector at the specified base-one indexes.
 
template<typename T >
Eigen::Matrix< T,
+1, Eigen::Dynamic > 
get_base1 (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &x, size_t m, const char *error_msg, size_t idx)
 Return a copy of the row of the specified vector at the specified base-one row index.
 
template<typename T >
const T & get_base1 (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &x, size_t m, size_t n, const char *error_msg, size_t idx)
 Return a reference to the value of the specified matrix at the specified base-one row and column indexes.
 
template<typename T >
const T & get_base1 (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, size_t m, const char *error_msg, size_t idx)
 Return a reference to the value of the specified column vector at the specified base-one index.
 
template<typename T >
const T & get_base1 (const Eigen::Matrix< T, 1, Eigen::Dynamic > &x, size_t n, const char *error_msg, size_t idx)
 Return a reference to the value of the specified row vector at the specified base-one index.
 
template<typename T >
T & get_base1_lhs (std::vector< T > &x, size_t i, const char *error_msg, size_t idx)
 Return a reference to the value of the specified vector at the specified base-one index.
 
template<typename T >
T & get_base1_lhs (std::vector< std::vector< T > > &x, size_t i1, size_t i2, const char *error_msg, size_t idx)
 Return a reference to the value of the specified vector at the specified base-one indexes.
 
template<typename T >
T & get_base1_lhs (std::vector< std::vector< std::vector< T > > > &x, size_t i1, size_t i2, size_t i3, const char *error_msg, size_t idx)
 Return a reference to the value of the specified vector at the specified base-one indexes.
 
template<typename T >
T & get_base1_lhs (std::vector< std::vector< std::vector< std::vector< T > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, const char *error_msg, size_t idx)
 Return a reference to the value of the specified vector at the specified base-one indexes.
 
template<typename T >
T & get_base1_lhs (std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, size_t i5, const char *error_msg, size_t idx)
 Return a reference to the value of the specified vector at the specified base-one indexes.
 
template<typename T >
T & get_base1_lhs (std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, size_t i5, size_t i6, const char *error_msg, size_t idx)
 Return a reference to the value of the specified vector at the specified base-one indexes.
 
template<typename T >
T & get_base1_lhs (std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, size_t i5, size_t i6, size_t i7, const char *error_msg, size_t idx)
 Return a reference to the value of the specified vector at the specified base-one indexes.
 
template<typename T >
T & get_base1_lhs (std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, size_t i5, size_t i6, size_t i7, size_t i8, const char *error_msg, size_t idx)
 Return a reference to the value of the specified vector at the specified base-one indexes.
 
template<typename T >
Eigen::Block< Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > > 
get_base1_lhs (Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &x, size_t m, const char *error_msg, size_t idx)
 Return a copy of the row of the specified vector at the specified base-one row index.
 
template<typename T >
T & get_base1_lhs (Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &x, size_t m, size_t n, const char *error_msg, size_t idx)
 Return a reference to the value of the specified matrix at the specified base-one row and column indexes.
 
template<typename T >
T & get_base1_lhs (Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, size_t m, const char *error_msg, size_t idx)
 Return a reference to the value of the specified column vector at the specified base-one index.
 
template<typename T >
T & get_base1_lhs (Eigen::Matrix< T, 1, Eigen::Dynamic > &x, size_t n, const char *error_msg, size_t idx)
 Return a reference to the value of the specified row vector at the specified base-one index.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
head (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v, size_t n)
 Return the specified number of elements as a vector from the front of the specified vector.
 
template<typename T >
Eigen::Matrix< T,
+1, Eigen::Dynamic > 
head (const Eigen::Matrix< T, 1, Eigen::Dynamic > &rv, size_t n)
 Return the specified number of elements as a row vector from the front of the specified row vector.
 
template<typename T >
std::vector< T > head (const std::vector< T > &sv, size_t n)
 Return the specified number of elements as a standard vector from the front of the specified standard vector.
 
template<typename T >
void initialize (T &x, const T &v)
 
template<typename T , typename V >
boost::enable_if_c
+< boost::is_arithmetic< V >
+::value, void > 
initialize (T &x, V v)
 
template<typename T , int R, int C>
void initialize (Eigen::Matrix< T, R, C > &x, const T &v)
 
template<typename T , typename V >
void initialize (std::vector< T > &x, const V &v)
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
inverse (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &m)
 Returns the inverse of the specified matrix.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
inverse_spd (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &m)
 Returns the inverse of the specified symmetric, pos/neg-definite matrix.
 
template<int R1, int C1, int R2, int C2>
Eigen::Matrix< double, R1, C2 > mdivide_left_ldlt (const stan::math::LDLT_factor< double, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)
 
template<typename T1 , typename T2 , int R1, int C1, int R2, int C2>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R1, C2 > 
mdivide_right_ldlt (const Eigen::Matrix< T1, R1, C1 > &b, const stan::math::LDLT_factor< T2, R2, C2 > &A)
 
template<int R1, int C1, int R2, int C2>
Eigen::Matrix< double, R1, C2 > mdivide_right_ldlt (const Eigen::Matrix< double, R1, C1 > &b, const stan::math::LDLT_factor< double, R2, C2 > &A)
 
template<int R, int C>
double log_determinant_ldlt (stan::math::LDLT_factor< double, R, C > &A)
 
template<int R1, int C1, int R2, int C2, int R3, int C3>
double trace_inv_quad_form_ldlt (const Eigen::Matrix< double, R1, C1 > &D, const stan::math::LDLT_factor< double, R2, C2 > &A, const Eigen::Matrix< double, R3, C3 > &B)
 
template<int R2, int C2, int R3, int C3>
double trace_inv_quad_form_ldlt (const stan::math::LDLT_factor< double, R2, C2 > &A, const Eigen::Matrix< double, R3, C3 > &B)
 
template<typename T , int Rows, int Cols>
Eigen::Matrix< T, Rows, Cols > log (const Eigen::Matrix< T, Rows, Cols > &m)
 Return the element-wise logarithm of the matrix or vector.
 
template<typename T , int R, int C>
log_determinant (const Eigen::Matrix< T, R, C > &m)
 Returns the log absolute determinant of the specified square matrix.
 
template<typename T , int R, int C>
log_determinant_spd (const Eigen::Matrix< T, R, C > &m)
 Returns the log absolute determinant of the specified square matrix.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
log_softmax (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v)
 Return the natural logarithm of the softmax of the specified vector.
 
template<typename T , int R, int C>
log_sum_exp (const Eigen::Matrix< T, R, C > &x)
 Return the log of the sum of the exponentiated values of the specified matrix of values.
 
int max (const std::vector< int > &x)
 Returns the maximum coefficient in the specified column vector.
 
template<typename T >
max (const std::vector< T > &x)
 Returns the maximum coefficient in the specified column vector.
 
template<typename T , int R, int C>
max (const Eigen::Matrix< T, R, C > &m)
 Returns the maximum coefficient in the specified vector, row vector, or matrix.
 
template<typename T1 , typename T2 , int R1, int C1, int R2, int C2>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R1, C2 > 
mdivide_left (const Eigen::Matrix< T1, R1, C1 > &A, const Eigen::Matrix< T2, R2, C2 > &b)
 Returns the solution of the system Ax=b.
 
template<typename T1 , typename T2 , int R1, int C1, int R2, int C2>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R1, C2 > 
mdivide_left_spd (const Eigen::Matrix< T1, R1, C1 > &A, const Eigen::Matrix< T2, R2, C2 > &b)
 Returns the solution of the system Ax=b where A is symmetric positive definite.
 
template<int TriView, typename T1 , typename T2 , int R1, int C1, int R2, int C2>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R1, C2 > 
mdivide_left_tri (const Eigen::Matrix< T1, R1, C1 > &A, const Eigen::Matrix< T2, R2, C2 > &b)
 Returns the solution of the system Ax=b when A is triangular.
 
template<int TriView, typename T , int R1, int C1>
Eigen::Matrix< T, R1, C1 > mdivide_left_tri (const Eigen::Matrix< T, R1, C1 > &A)
 Returns the solution of the system Ax=b when A is triangular and b=I.
 
template<typename T1 , typename T2 , int R1, int C1, int R2, int C2>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R1, C2 > 
mdivide_left_tri_low (const Eigen::Matrix< T1, R1, C1 > &A, const Eigen::Matrix< T2, R2, C2 > &b)
 
template<typename T , int R1, int C1>
Eigen::Matrix< T, R1, C1 > mdivide_left_tri_low (const Eigen::Matrix< T, R1, C1 > &A)
 
template<typename T1 , typename T2 , int R1, int C1, int R2, int C2>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R1, C2 > 
mdivide_right (const Eigen::Matrix< T1, R1, C1 > &b, const Eigen::Matrix< T2, R2, C2 > &A)
 Returns the solution of the system Ax=b.
 
template<typename T1 , typename T2 , int R1, int C1, int R2, int C2>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R1, C2 > 
mdivide_right_spd (const Eigen::Matrix< T1, R1, C1 > &b, const Eigen::Matrix< T2, R2, C2 > &A)
 Returns the solution of the system Ax=b where A is symmetric positive definite.
 
template<int TriView, typename T1 , typename T2 , int R1, int C1, int R2, int C2>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R1, C2 > 
mdivide_right_tri (const Eigen::Matrix< T1, R1, C1 > &b, const Eigen::Matrix< T2, R2, C2 > &A)
 Returns the solution of the system Ax=b when A is triangular.
 
template<typename T1 , typename T2 , int R1, int C1, int R2, int C2>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R1, C2 > 
mdivide_right_tri_low (const Eigen::Matrix< T1, R1, C1 > &b, const Eigen::Matrix< T2, R2, C2 > &A)
 Returns the solution of the system tri(A)x=b when tri(A) is a lower triangular view of the matrix A.
 
template<typename T >
boost::math::tools::promote_args
+< T >::type 
mean (const std::vector< T > &v)
 Returns the sample mean (i.e., average) of the coefficients in the specified standard vector.
 
template<typename T , int R, int C>
boost::math::tools::promote_args
+< T >::type 
mean (const Eigen::Matrix< T, R, C > &m)
 Returns the sample mean (i.e., average) of the coefficients in the specified vector, row vector, or matrix.
 
int min (const std::vector< int > &x)
 Returns the minimum coefficient in the specified column vector.
 
template<typename T >
min (const std::vector< T > &x)
 Returns the minimum coefficient in the specified column vector.
 
template<typename T , int R, int C>
min (const Eigen::Matrix< T, R, C > &m)
 Returns the minimum coefficient in the specified matrix, vector, or row vector.
 
template<typename T >
minus (const T &x)
 Returns the negation of the specified scalar or matrix.
 
template<int R, int C, typename T >
boost::enable_if_c
+< boost::is_arithmetic< T >
+::value, Eigen::Matrix< double,
+R, C > >::type 
multiply (const Eigen::Matrix< double, R, C > &m, T c)
 Return specified matrix multiplied by specified scalar.
 
template<int R, int C, typename T >
boost::enable_if_c
+< boost::is_arithmetic< T >
+::value, Eigen::Matrix< double,
+R, C > >::type 
multiply (T c, const Eigen::Matrix< double, R, C > &m)
 Return specified scalar multiplied by specified matrix.
 
template<int R1, int C1, int R2, int C2>
Eigen::Matrix< double, R1, C2 > multiply (const Eigen::Matrix< double, R1, C1 > &m1, const Eigen::Matrix< double, R2, C2 > &m2)
 Return the product of the specified matrices.
 
template<int C1, int R2>
double multiply (const Eigen::Matrix< double, 1, C1 > &rv, const Eigen::Matrix< double, R2, 1 > &v)
 Return the scalar product of the specified row vector and specified column vector.
 
matrix_d multiply_lower_tri_self_transpose (const matrix_d &L)
 Returns the result of multiplying the lower triangular portion of the input matrix by its own transpose.
 
template<typename T >
prod (const std::vector< T > &v)
 Returns the product of the coefficients of the specified standard vector.
 
template<typename T , int R, int C>
prod (const Eigen::Matrix< T, R, C > &v)
 Returns the product of the coefficients of the specified column vector.
 
template<typename T1 , typename T2 , typename F >
common_type< T1, T2 >::type promote_common (const F &u)
 
template<int RA, int CA, int RB, int CB>
Eigen::Matrix< double, CB, CB > quad_form (const Eigen::Matrix< double, RA, CA > &A, const Eigen::Matrix< double, RB, CB > &B)
 Compute B^T A B.
 
template<int RA, int CA, int RB>
double quad_form (const Eigen::Matrix< double, RA, CA > &A, const Eigen::Matrix< double, RB, 1 > &B)
 
template<int RA, int CA, int RB, int CB>
Eigen::Matrix< double, CB, CB > quad_form_sym (const Eigen::Matrix< double, RA, CA > &A, const Eigen::Matrix< double, RB, CB > &B)
 
template<int RA, int CA, int RB>
double quad_form_sym (const Eigen::Matrix< double, RA, CA > &A, const Eigen::Matrix< double, RB, 1 > &B)
 
template<typename T >
size_t rank (const std::vector< T > &v, int s)
 Return the number of components of v less than v[s].
 
template<typename T , int R, int C>
size_t rank (const Eigen::Matrix< T, R, C > &v, int s)
 Return the number of components of v less than v[s].
 
template<typename T >
void resize (T &x, std::vector< size_t > dims)
 Recursively resize the specified vector of vectors, which must bottom out at scalar values, Eigen vectors or Eigen matrices.
 
template<typename T >
Eigen::Matrix< T,
+1, Eigen::Dynamic > 
row (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &m, size_t i)
 Return the specified row of the specified matrix, using start-at-1 indexing.
 
template<typename T , int R, int C>
size_t rows (const Eigen::Matrix< T, R, C > &m)
 
template<int R1, int C1, int R2, int C2>
Eigen::Matrix< double, R1, 1 > rows_dot_product (const Eigen::Matrix< double, R1, C1 > &v1, const Eigen::Matrix< double, R2, C2 > &v2)
 Returns the dot product of the specified vectors.
 
template<typename T , int R, int C>
Eigen::Matrix< T, R, 1 > rows_dot_self (const Eigen::Matrix< T, R, C > &x)
 Returns the dot product of each row of a matrix with itself.
 
template<typename T >
boost::math::tools::promote_args
+< T >::type 
sd (const std::vector< T > &v)
 Returns the unbiased sample standard deviation of the coefficients in the specified column vector.
 
template<typename T , int R, int C>
boost::math::tools::promote_args
+< T >::type 
sd (const Eigen::Matrix< T, R, C > &m)
 Returns the unbiased sample standard deviation of the coefficients in the specified vector, row vector, or matrix.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
segment (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v, size_t i, size_t n)
 Return the specified number of elements as a vector starting from the specified element - 1 of the specified vector.
 
template<typename T >
Eigen::Matrix< T,
+1, Eigen::Dynamic > 
segment (const Eigen::Matrix< T, 1, Eigen::Dynamic > &v, size_t i, size_t n)
 
template<typename T >
std::vector< T > segment (const std::vector< T > &sv, size_t i, size_t n)
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
singular_values (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &m)
 Return the vector of the singular values of the specified matrix in decreasing order of magnitude.
 
template<typename T >
int size (const std::vector< T > &x)
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
softmax (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v)
 Return the softmax of the specified vector.
 
template<typename T >
std::vector< T > sort_asc (std::vector< T > xs)
 Return the specified standard vector in ascending order.
 
template<typename T >
std::vector< T > sort_desc (std::vector< T > xs)
 Return the specified standard vector in descending order.
 
template<typename T , int R, int C>
Eigen::Matrix< T, R, C > sort_asc (Eigen::Matrix< T, R, C > xs)
 Return the specified eigen vector in ascending order.
 
template<typename T , int R, int C>
Eigen::Matrix< T, R, C > sort_desc (Eigen::Matrix< T, R, C > xs)
 Return the specified eigen vector in descending order.
 
template<int R1, int C1, int R2, int C2>
double squared_dist (const Eigen::Matrix< double, R1, C1 > &v1, const Eigen::Matrix< double, R2, C2 > &v2)
 Returns the squared distance between the specified vectors.
 
template<typename T >
void stan_print (std::ostream *o, const T &x)
 
template<typename T >
void stan_print (std::ostream *o, const std::vector< T > &x)
 
template<typename T >
void stan_print (std::ostream *o, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x)
 
template<typename T >
void stan_print (std::ostream *o, const Eigen::Matrix< T, 1, Eigen::Dynamic > &x)
 
template<typename T >
void stan_print (std::ostream *o, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &x)
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
sub_col (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &m, size_t i, size_t j, size_t nrows)
 Return a nrows x 1 subcolumn starting at (i-1,j-1).
 
template<typename T >
Eigen::Matrix< T,
+1, Eigen::Dynamic > 
sub_row (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &m, size_t i, size_t j, size_t ncols)
 Return a 1 x nrows subrow starting at (i-1,j-1).
 
template<typename T1 , typename T2 , int R, int C>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R, C > 
subtract (const Eigen::Matrix< T1, R, C > &m1, const Eigen::Matrix< T2, R, C > &m2)
 Return the result of subtracting the second specified matrix from the first specified matrix.
 
template<typename T1 , typename T2 , int R, int C>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R, C > 
subtract (const T1 &c, const Eigen::Matrix< T2, R, C > &m)
 
template<typename T1 , typename T2 , int R, int C>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R, C > 
subtract (const Eigen::Matrix< T1, R, C > &m, const T2 &c)
 
template<typename T >
sum (const std::vector< T > &xs)
 Return the sum of the values in the specified standard vector.
 
template<typename T , int R, int C>
double sum (const Eigen::Matrix< T, R, C > &v)
 Returns the sum of the coefficients of the specified column vector.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
tail (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v, size_t n)
 Return the specified number of elements as a vector from the back of the specified vector.
 
template<typename T >
Eigen::Matrix< T,
+1, Eigen::Dynamic > 
tail (const Eigen::Matrix< T, 1, Eigen::Dynamic > &rv, size_t n)
 Return the specified number of elements as a row vector from the back of the specified row vector.
 
template<typename T >
std::vector< T > tail (const std::vector< T > &sv, size_t n)
 
matrix_d tcrossprod (const matrix_d &M)
 Returns the result of post-multiplying a matrix by its own transpose.
 
template<typename T , int R1, int R2>
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
to_vector (const Eigen::Matrix< T, R1, R2 > &m)
 
template<typename T >
trace (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &m)
 Returns the trace of the specified matrix.
 
template<int RD, int CD, int RA, int CA, int RB, int CB>
double trace_gen_quad_form (const Eigen::Matrix< double, RD, CD > &D, const Eigen::Matrix< double, RA, CA > &A, const Eigen::Matrix< double, RB, CB > &B)
 Compute trace(D B^T A B).
 
template<int RA, int CA, int RB, int CB>
double trace_quad_form (const Eigen::Matrix< double, RA, CA > &A, const Eigen::Matrix< double, RB, CB > &B)
 Compute trace(B^T A B).
 
template<typename T , int R, int C>
Eigen::Matrix< T, C, R > transpose (const Eigen::Matrix< T, R, C > &m)
 
template<typename T , int R, int C>
void validate_column_index (const Eigen::Matrix< T, R, C > &m, size_t j, const char *msg)
 
template<typename T1 , typename T2 >
void validate_greater (const T1 &x, const T2 &y, const char *x_name, const char *y_name, const char *fun_name)
 
template<typename T1 , typename T2 >
void validate_greater_or_equal (const T1 &x, const T2 &y, const char *x_name, const char *y_name, const char *fun_name)
 
template<typename T1 , typename T2 >
void validate_less (const T1 &x, const T2 &y, const char *x_name, const char *y_name, const char *fun_name)
 
template<typename T1 , typename T2 >
void validate_less_or_equal (const T1 &x, const T2 &y, const char *x_name, const char *y_name, const char *fun_name)
 
template<typename T1 , int R1, int C1, typename T2 , int R2, int C2>
void validate_matching_dims (const Eigen::Matrix< T1, R1, C1 > &x1, const Eigen::Matrix< T2, R2, C2 > &x2, const char *msg)
 
template<typename T1 , typename T2 >
void validate_matching_sizes (const std::vector< T1 > &x1, const std::vector< T2 > &x2, const char *msg)
 
template<typename T1 , int R1, int C1, typename T2 , int R2, int C2>
void validate_matching_sizes (const Eigen::Matrix< T1, R1, C1 > &x1, const Eigen::Matrix< T2, R2, C2 > &x2, const char *msg)
 
template<typename Derived , typename T2 , int R2, int C2>
void validate_matching_sizes (const Eigen::Block< Derived > &x1, const Eigen::Matrix< T2, R2, C2 > &x2, const char *msg)
 
template<typename T1 , int R1, int C1, typename Derived >
void validate_matching_sizes (const Eigen::Matrix< T1, R1, C1 > &x1, const Eigen::Block< Derived > &x2, const char *msg)
 
template<typename Derived1 , typename Derived2 >
void validate_matching_sizes (const Eigen::Block< Derived1 > &x1, const Eigen::Block< Derived2 > &x2, const char *msg)
 
template<typename T1 , typename T2 >
void validate_multiplicable (const T1 &x1, const T2 &x2, const char *msg)
 
template<typename T >
void validate_nonzero_size (const T &x, const char *msg)
 
template<typename T , int R, int C>
void validate_row_index (const Eigen::Matrix< T, R, C > &m, size_t i, const char *msg)
 
template<typename T , int R, int C>
void validate_square (const Eigen::Matrix< T, R, C > &x, const char *msg)
 
template<typename T >
void validate_std_vector_index (const std::vector< T > &sv, size_t j, const char *msg)
 
template<typename T , int R, int C>
void validate_symmetric (const Eigen::Matrix< T, R, C > &x, const char *msg)
 
template<typename T , int R, int C>
void validate_vector (const Eigen::Matrix< T, R, C > &x, const char *msg)
 
template<typename T >
boost::math::tools::promote_args
+< T >::type 
variance (const std::vector< T > &v)
 Returns the sample variance (divide by length - 1) of the coefficients in the specified standard vector.
 
template<typename T , int R, int C>
boost::math::tools::promote_args
+< T >::type 
variance (const Eigen::Matrix< T, R, C > &m)
 Returns the sample variance (divide by length - 1) of the coefficients in the specified column vector.
 
template<typename T >
std::vector< T > rep_array (const T &x, int n)
 
template<typename T >
std::vector< std::vector< T > > rep_array (const T &x, int m, int n)
 
template<typename T >
std::vector< std::vector
+< std::vector< T > > > 
rep_array (const T &x, int k, int m, int n)
 
template<typename T >
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T >::type, Eigen::Dynamic,
+Eigen::Dynamic > 
rep_matrix (const T &x, int m, int n)
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
rep_matrix (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v, int n)
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
rep_matrix (const Eigen::Matrix< T, 1, Eigen::Dynamic > &rv, int m)
 
template<typename T >
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T >::type, 1, Eigen::Dynamic > 
rep_row_vector (const T &x, int m)
 
template<typename T >
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T >::type, Eigen::Dynamic, 1 > 
rep_vector (const T &x, int n)
 
void validate_non_negative_rep (int n, const std::string &fun)
 If argument is negative, throw a domain error indicating the function with the specified name.
 
double F32 (double a, double b, double c, double d, double e, double z, double precision=1e-6)
 
void gradF32 (double *g, double a, double b, double c, double d, double e, double z, double precision=1e-6)
 
void grad2F1 (double &gradA, double &gradC, double a, double b, double c, double z, double precision=1e-6)
 
void gradIncBeta (double &g1, double &g2, double a, double b, double z)
 
void gradRegIncBeta (double &g1, double &g2, double a, double b, double z, double digammaA, double digammaB, double digammaSum, double betaAB)
 
double gradRegIncGamma (double a, double z, double g, double dig, double precision=1e-6)
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Variables

const double E = boost::math::constants::e<double>()
 The base of the natural logarithm, $ e $.
 
const double SQRT_2 = std::sqrt(2.0)
 The value of the square root of 2, $ \sqrt{2} $.
 
const double INV_SQRT_2 = 1.0 / SQRT_2
 The value of 1 over the square root of 2, $ 1 / \sqrt{2} $.
 
const double LOG_2 = std::log(2.0)
 The natural logarithm of 2, $ \log 2 $.
 
const double LOG_10 = std::log(10.0)
 The natural logarithm of 10, $ \log 10 $.
 
const double INFTY = std::numeric_limits<double>::infinity()
 Positive infinity.
 
const double NEGATIVE_INFTY = - std::numeric_limits<double>::infinity()
 Negative infinity.
 
const double NOT_A_NUMBER = std::numeric_limits<double>::quiet_NaN()
 (Quiet) not-a-number value.
 
const double EPSILON = std::numeric_limits<double>::epsilon()
 Smallest positive value.
 
const double NEGATIVE_EPSILON = - std::numeric_limits<double>::epsilon()
 Largest negative value (i.e., smallest absolute value).
 
const double LOG_PI_OVER_FOUR = std::log(boost::math::constants::pi<double>()) / 4.0
 
const double TWO_OVER_SQRT_PI = 2.0 / std::sqrt(boost::math::constants::pi<double>())
 
const double NEG_TWO_OVER_SQRT_PI = -TWO_OVER_SQRT_PI
 
const double INV_SQRT_TWO_PI = 1.0 / std::sqrt(2.0 * boost::math::constants::pi<double>())
 
const double CONSTRAINT_TOLERANCE = 1E-8
 The tolerance for checking arithmetic bounds In rank and in simplexes.
 
+

Detailed Description

+

Matrices and templated mathematical functions.

+

Typedef Documentation

+ +
+
+ + + + +
typedef Eigen::Matrix<double,Eigen::Dynamic,Eigen::Dynamic> stan::math::matrix_d
+
+ +

Type for matrix of double values.

+ +

Definition at line 17 of file typedefs.hpp.

+ +
+
+ +
+
+ + + + +
typedef Eigen::Matrix<double,1,Eigen::Dynamic> stan::math::row_vector_d
+
+ +

Type for (row) vector of double values.

+ +

Definition at line 31 of file typedefs.hpp.

+ +
+
+ +
+
+ + + + +
typedef Eigen::Matrix<double,Eigen::Dynamic,Eigen::Dynamic>::Index stan::math::size_type
+
+ +

Definition at line 10 of file typedefs.hpp.

+ +
+
+ +
+
+ + + + +
typedef Eigen::Matrix<double,Eigen::Dynamic,1> stan::math::vector_d
+
+ +

Type for (column) vector of double values.

+ +

Definition at line 24 of file typedefs.hpp.

+ +
+
+

Function Documentation

+ +
+
+ + + + + + + + +
double stan::math::abs (double x)
+
+ +

Return floating-point absolute value.

+

Delegates to fabs(double) rather than std::abs(int).

+
Parameters
+ + +
xscalar
+
+
+
Returns
absolute value of scalar
+ +

Definition at line 19 of file abs.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , int R, int C>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type,R,C> stan::math::add (const Eigen::Matrix< T1, R, C > & m1,
const Eigen::Matrix< T2, R, C > & m2 
)
+
+inline
+
+ +

Return the sum of the specified matrices.

+

The two matrices must have the same dimensions.

+
Template Parameters
+ + + + + +
T1Scalar type of first matrix.
T2Scalar type of second matrix.
RRow type of matrices.
CColumn type of matrices.
+
+
+
Parameters
+ + + +
m1First matrix.
m2Second matrix.
+
+
+
Returns
Sum of the matrices.
+
Exceptions
+ + +
std::domain_errorif m1 and m2 do not have the same dimensions.
+
+
+ +

Definition at line 27 of file add.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , int R, int C>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type,R,C> stan::math::add (const Eigen::Matrix< T1, R, C > & m,
const T2 & c 
)
+
+inline
+
+ +

Return the sum of the specified matrix and specified scalar.

+
Template Parameters
+ + + +
T1Scalar type of matrix.
T2Type of scalar.
+
+
+
Parameters
+ + + +
mMatrix.
cScalar.
+
+
+
Returns
The matrix plus the scalar.
+ +

Definition at line 49 of file add.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , int R, int C>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type,R,C> stan::math::add (const T1 & c,
const Eigen::Matrix< T2, R, C > & m 
)
+
+inline
+
+ +

Return the sum of the specified scalar and specified matrix.

+
Template Parameters
+ + + +
T1Type of scalar.
T2Scalar type of matrix.
+
+
+
Parameters
+ + + +
cScalar.
mMatrix.
+
+
+
Returns
The scalar plus the matrix.
+ +

Definition at line 70 of file add.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
int stan::math::as_bool (const T x)
+
+inline
+
+ +

Return 1 if the argument is unequal to zero and 0 otherwise.

+
Parameters
+ + +
xValue.
+
+
+
Returns
1 if argument is equal to zero and 0 otherwise.
+ +

Definition at line 14 of file as_bool.hpp.

+ +
+
+ +
+
+
+template<>
+ + + + + +
+ + + + + + + + +
int stan::math::as_bool< int > (const int x)
+
+inline
+
+ +

Return an integer with an equivalent boolean value to specified input.

+

For integers, this reduces to the identity function.

+
Parameters
+ + +
xvalue.
+
+
+
Returns
The value.
+ +

Definition at line 26 of file as_bool.hpp.

+ +
+
+ +
+
+
+template<typename LHS , typename RHS >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::math::assign (LHS & lhs,
const RHS & rhs 
)
+
+inline
+
+ +

Copy the right-hand side's value to the left-hand side variable.

+

The assign() function is overloaded. This instance will match arguments where the right-hand side is assignable to the left and they are not both std::vector or Eigen::Matrix types.

+
Template Parameters
+ + + +
LHSType of left-hand side.
RHSType of right-hand side.
+
+
+
Parameters
+ + + +
lhsLeft-hand side.
rhsRight-hand side.
+
+
+ +

Definition at line 39 of file assign.hpp.

+ +
+
+ +
+
+
+template<typename LHS , typename RHS , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::math::assign (Eigen::Matrix< LHS, R1, C1 > & x,
const Eigen::Matrix< RHS, R2, C2 > & y 
)
+
+inline
+
+ +

Copy the right-hand side's value to the left-hand side variable.

+

The assign() function is overloaded. This instance will be called for arguments that are both Eigen::Matrix types, but whose shapes are not compatible. The shapes are specified in the row and column template parameters.

+
Template Parameters
+ + + + + + + +
LHSType of left-hand side matrix elements.
RHSType of right-hand side matrix elements.
R1Row shape of left-hand side matrix.
C1Column shape of left-hand side matrix.
R2Row shape of right-hand side matrix.
C2Column shape of right-hand side matrix.
+
+
+
Parameters
+ + + +
xLeft-hand side matrix.
yRight-hand side matrix.
+
+
+
Exceptions
+ + +
std::domain_errorif sizes do not match.
+
+
+ +

Definition at line 65 of file assign.hpp.

+ +
+
+ +
+
+
+template<typename LHS , typename RHS , int R, int C>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::math::assign (Eigen::Matrix< LHS, R, C > & x,
const Eigen::Matrix< RHS, R, C > & y 
)
+
+inline
+
+ +

Copy the right-hand side's value to the left-hand side variable.

+

The assign() function is overloaded. This instance will be called for arguments that are both Eigen::Matrix types and whose shapes match. The shapes are specified in the row and column template parameters.

+
Template Parameters
+ + + + + +
LHSType of left-hand side matrix elements.
RHSType of right-hand side matrix elements.
RRow shape of both matrices.
CColumn shape of both mtarices.
+
+
+
Parameters
+ + + +
xLeft-hand side matrix.
yRight-hand side matrix.
+
+
+
Exceptions
+ + +
std::domain_errorif sizes do not match.
+
+
+ +

Definition at line 96 of file assign.hpp.

+ +
+
+ +
+
+
+template<typename LHS , typename RHS , int R, int C>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::math::assign (Eigen::Block< LHS > x,
const Eigen::Matrix< RHS, R, C > & y 
)
+
+inline
+
+ +

Copy the right-hand side's value to the left-hand side variable.

+

The assign() function is overloaded. This instance will be called for arguments that are both Eigen::Matrix types and whose shapes match. The shape of the right-hand side matrix is specified in the row and column shape template parameters.

+
Template Parameters
+ + + + + +
LHSType of matrix block elements.
RHSType of right-hand side matrix elements.
RRow shape for right-hand side matrix.
CColumn shape for right-hand side matrix.
+
+
+
Parameters
+ + + +
xLeft-hand side block view of matrix.
yRight-hand side matrix.
+
+
+
Exceptions
+ + +
std::domain_errorif sizes do not match.
+
+
+ +

Definition at line 123 of file assign.hpp.

+ +
+
+ +
+
+
+template<typename LHS , typename RHS >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::math::assign (std::vector< LHS > & x,
const std::vector< RHS > & y 
)
+
+inline
+
+ +

Copy the right-hand side's value to the left-hand side variable.

+

The assign() function is overloaded. This instance will be called for arguments that are both std::vector, and will call assign() element-by element.

+

For example, a std::vector<int> can be assigned to a std::vector<double> using this function.

+
Template Parameters
+ + + +
LHSType of left-hand side vector elements.
RHSType of right-hand side vector elements.
+
+
+
Parameters
+ + + +
xLeft-hand side vector.
yRight-hand side vector.
+
+
+
Exceptions
+ + +
std::domain_errorif sizes do not match.
+
+
+ +

Definition at line 153 of file assign.hpp.

+ +
+
+ +
+
+
+template<typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
T2 stan::math::bessel_first_kind (const int v,
const T2 z 
)
+
+inline
+
+ +

Definition at line 11 of file bessel_first_kind.hpp.

+ +
+
+ +
+
+
+template<typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
T2 stan::math::bessel_second_kind (const int v,
const T2 z 
)
+
+inline
+
+ +

Definition at line 11 of file bessel_second_kind.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T>::type stan::math::binary_log_loss (const int y,
const T y_hat 
)
+
+inline
+
+ +

Returns the log loss function for binary classification with specified reference and response values.

+

The log loss function for prediction $\hat{y} \in [0, 1]$ given outcome $y \in \{ 0, 1 \}$ is

+

$\mbox{logloss}(1,\hat{y}) = -\log \hat{y} $, and

+

$\mbox{logloss}(0,\hat{y}) = -\log (1 - \hat{y}) $.

+
Parameters
+ + + +
yReference value in { 0 , 1 }.
y_hatResponse value in [0,1].
+
+
+
Returns
Log loss for response given reference value.
+ +

Definition at line 26 of file binary_log_loss.hpp.

+ +
+
+ +
+
+
+template<typename T_N , typename T_n >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_N, T_n>::type stan::math::binomial_coefficient_log (const T_N N,
const T_n n 
)
+
+inline
+
+ +

Return the log of the binomial coefficient for the specified arguments.

+

The binomial coefficient, ${N \choose n}$, read "N choose n", is defined for $0 \leq n \leq N$ by

+

${N \choose n} = \frac{N!}{n! (N-n)!}$.

+

This function uses Gamma functions to define the log and generalize the arguments to continuous N and n.

+

$ \log {N \choose n} = \log \ \Gamma(N+1) - \log \Gamma(n+1) - \log \Gamma(N-n+1)$.

+
Parameters
+ + + +
Ntotal number of objects.
nnumber of objects chosen.
+
+
+
Returns
log (N choose n).
+ +

Definition at line 31 of file binomial_coefficient_log.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> stan::math::block (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & m,
size_t i,
size_t j,
size_t nrows,
size_t ncols 
)
+
+inline
+
+ +

Return a nrows x ncols submatrix starting at (i-1,j-1).

+
Parameters
+ + + + + + +
mMatrix
iStarting row
jStarting column
nrowsNumber of rows in block
ncolsNumber of columns in block
+
+
+ +

Definition at line 23 of file block.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_low , typename T_high , typename T_result >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_bounded (const char * function,
const T_y & y,
const T_low & low,
const T_high & high,
const char * name,
T_result * result 
)
+
+inline
+
+ +

Definition at line 68 of file check_bounded.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_low , typename T_high >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_bounded (const char * function,
const T_y & y,
const T_low & low,
const T_high & high,
const char * name 
)
+
+inline
+
+ +

Definition at line 79 of file check_bounded.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_result >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_cholesky_factor (const char * function,
const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & y,
const char * name,
T_result * result 
)
+
+inline
+
+ +

Return true if the specified matrix is a valid Cholesky factor.

+

A Cholesky factor is a lower triangular matrix whose diagonal elements are all positive. Note that Cholesky factors need not be square, but require at least as many rows M as columns N (i.e., M >= N).

+
Parameters
+ + + + + +
function
yMatrix to test.
name
result
+
+
+
Returns
true if the matrix is a valid Cholesky factor.
+
Template Parameters
+ + + +
T_yType of elements of Cholesky factor
T_resultType of result.
+
+
+ +

Definition at line 30 of file check_cholesky_factor.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_cholesky_factor (const char * function,
const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & y,
const char * name,
T * result = 0 
)
+
+inline
+
+ +

Definition at line 51 of file check_cholesky_factor.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_result >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_cholesky_factor (const char * function,
const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & y,
T_result * result 
)
+
+inline
+
+ +

Return true if the specified matrix is a valid Cholesky factor (lower triangular, positive diagonal).

+
Parameters
+ + + + +
functionName of function.
yMatrix to test.
resultPointer into which to write result.
+
+
+
Returns
true if the matrix is a valid Cholesky factor.
+
Template Parameters
+ + + +
T_yType of elements of Cholesky factor
T_resultType of result.
+
+
+ +

Definition at line 71 of file check_cholesky_factor.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_cholesky_factor (const char * function,
const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & y,
T * result = 0 
)
+
+inline
+
+ +

Definition at line 78 of file check_cholesky_factor.hpp.

+ +
+
+ +
+
+
+template<typename T , typename T_result >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_consistent_size (size_t max_size,
const char * function,
const T & x,
const char * name,
T_result * result 
)
+
+inline
+
+ +

Definition at line 11 of file check_consistent_size.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , typename T_result >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_consistent_sizes (const char * function,
const T1 & x1,
const T2 & x2,
const char * name1,
const char * name2,
T_result * result 
)
+
+inline
+
+ +

Definition at line 12 of file check_consistent_sizes.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , typename T3 , typename T_result >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_consistent_sizes (const char * function,
const T1 & x1,
const T2 & x2,
const T3 & x3,
const char * name1,
const char * name2,
const char * name3,
T_result * result 
)
+
+inline
+
+ +

Definition at line 25 of file check_consistent_sizes.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , typename T3 , typename T4 , typename T_result >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_consistent_sizes (const char * function,
const T1 & x1,
const T2 & x2,
const T3 & x3,
const T4 & x4,
const char * name1,
const char * name2,
const char * name3,
const char * name4,
T_result * result 
)
+
+inline
+
+ +

Definition at line 40 of file check_consistent_sizes.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_result >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_corr_matrix (const char * function,
const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & y,
const char * name,
T_result * result 
)
+
+inline
+
+ +

Return true if the specified matrix is a valid correlation matrix.

+

A valid correlation matrix is symmetric, has a unit diagonal (all 1 values), and has all values between -1 and 1 (inclussive).

+
Parameters
+ + + + + +
function
yMatrix to test.
name
result
+
+
+
Returns
true if the specified matrix is a valid correlation matrix.
+
Template Parameters
+ + +
TType of scalar.
+
+
+ +

Definition at line 32 of file check_corr_matrix.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_corr_matrix (const char * function,
const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & y,
const char * name,
T * result = 0 
)
+
+inline
+
+ +

Definition at line 62 of file check_corr_matrix.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_result >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_cov_matrix (const char * function,
const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & y,
const char * name,
T_result * result 
)
+
+inline
+
+ +

Return true if the specified matrix is a valid covariance matrix.

+

A valid covariance matrix must be square, symmetric, and positive definite.

+
Parameters
+ + + + + +
function
yMatrix to test.
name
result
+
+
+
Returns
true if the matrix is a valid covariance matrix.
+
Template Parameters
+ + +
TType of scalar.
+
+
+ +

Definition at line 29 of file check_cov_matrix.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_cov_matrix (const char * function,
const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & y,
const char * name,
T * result = 0 
)
+
+inline
+
+ +

Definition at line 48 of file check_cov_matrix.hpp.

+ +
+
+ +
+
+
+template<typename T_covar , typename T_result >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_cov_matrix (const char * function,
const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > & Sigma,
T_result * result 
)
+
+inline
+
+ +

Return true if the specified matrix is a valid covariance matrix.

+

A valid covariance matrix must be symmetric and positive definite.

+
Parameters
+ + + + +
function
SigmaMatrix to test.
result
+
+
+
Returns
true if the matrix is a valid covariance matrix.
+
Template Parameters
+ + +
TType of scalar.
+
+
+ +

Definition at line 70 of file check_cov_matrix.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_cov_matrix (const char * function,
const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & Sigma,
T * result = 0 
)
+
+inline
+
+ +

Definition at line 85 of file check_cov_matrix.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_result >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_finite (const char * function,
const T_y & y,
const char * name,
T_result * result 
)
+
+inline
+
+ +

Checks if the variable y is finite.

+ +

Definition at line 49 of file check_finite.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_finite (const char * function,
const T & y,
const char * name 
)
+
+inline
+
+ +

Definition at line 58 of file check_finite.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_low , typename T_result >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_greater (const char * function,
const T_y & y,
const T_low & low,
const char * name,
T_result * result 
)
+
+inline
+
+ +

Definition at line 56 of file check_greater.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_low >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_greater (const char * function,
const T_y & y,
const T_low & low,
const char * name 
)
+
+inline
+
+ +

Definition at line 65 of file check_greater.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_low , typename T_result >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_greater_or_equal (const char * function,
const T_y & y,
const T_low & low,
const char * name,
T_result * result 
)
+
+inline
+
+ +

Definition at line 56 of file check_greater_or_equal.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_low >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_greater_or_equal (const char * function,
const T_y & y,
const T_low & low,
const char * name 
)
+
+inline
+
+ +

Definition at line 65 of file check_greater_or_equal.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_high , typename T_result >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_less (const char * function,
const T_y & y,
const T_high & high,
const char * name,
T_result * result 
)
+
+inline
+
+ +

Definition at line 55 of file check_less.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_high >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_less (const char * function,
const T_y & y,
const T_high & high,
const char * name 
)
+
+inline
+
+ +

Definition at line 64 of file check_less.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_high , typename T_result >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_less_or_equal (const char * function,
const T_y & y,
const T_high & high,
const char * name,
T_result * result 
)
+
+inline
+
+ +

Definition at line 50 of file check_less_or_equal.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_high >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_less_or_equal (const char * function,
const T_y & y,
const T_high & high,
const char * name 
)
+
+inline
+
+ +

Definition at line 59 of file check_less_or_equal.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_result >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_lower_triangular (const char * function,
const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & y,
const char * name,
T_result * result 
)
+
+inline
+
+ +

Return true if the specified matrix is lower triangular.

+

A matrix x is not lower triangular if there is a non-zero entry x[m,n] with m < n.

+
Parameters
+ + + + + +
function
yMatrix to test.
name
result
+
+
+
Returns
true if the matrix is symmetric.
+
Template Parameters
+ + +
TType of scalar.
+
+
+ +

Definition at line 26 of file check_lower_triangular.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_lower_triangular (const char * function,
const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & y,
const char * name,
T * result = 0 
)
+
+inline
+
+ +

Definition at line 46 of file check_lower_triangular.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_result >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_nonnegative (const char * function,
const T_y & y,
const char * name,
T_result * result 
)
+
+inline
+
+ +

Definition at line 46 of file check_nonnegative.hpp.

+ +
+
+ +
+
+
+template<typename T_y >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_nonnegative (const char * function,
const T_y & y,
const char * name 
)
+
+inline
+
+ +

Definition at line 54 of file check_nonnegative.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_result >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_not_nan (const char * function,
const T_y & y,
const char * name,
T_result * result = 0 
)
+
+inline
+
+ +

Checks if the variable y is nan.

+
Parameters
+ + + + + +
functionName of function being invoked.
yReference to variable being tested.
nameName of variable being tested.
resultPointer to resulting value after test.
+
+
+
Template Parameters
+ + + +
T_yType of variable being tested.
T_resultType of result returned.
+
+
+ +

Definition at line 54 of file check_not_nan.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_not_nan (const char * function,
const T & y,
const char * name 
)
+
+inline
+
+ +

Definition at line 64 of file check_not_nan.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_result >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_ordered (const char * function,
const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > & y,
const char * name,
T_result * result 
)
+
+ +

Return true if the specified vector is sorted into increasing order.

+

There may be duplicate values. Otherwise, raise a domain error according to the specified policy.

+
Parameters
+ + + + + +
function
yVector to test.
name
result
+
+
+
Returns
true if the vector has positive, ordered values.
+ +

Definition at line 25 of file check_ordered.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_ordered (const char * function,
const Eigen::Matrix< T, Eigen::Dynamic, 1 > & y,
const char * name,
T * result = 0 
)
+
+ +

Definition at line 50 of file check_ordered.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_result >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_pos_definite (const char * function,
const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & y,
const char * name,
T_result * result 
)
+
+inline
+
+ +

Return true if the specified matrix is positive definite.

+

NOTE: symmetry is NOT checked by this function

+
Parameters
+ + + + + +
function
yMatrix to test.
name
result
+
+
+
Returns
true if the matrix is positive definite.
+
Template Parameters
+ + +
TType of scalar.
+
+
+ +

Definition at line 26 of file check_pos_definite.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_pos_definite (const char * function,
const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & y,
const char * name,
T * result = 0 
)
+
+inline
+
+ +

Definition at line 55 of file check_pos_definite.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_result >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_pos_semidefinite (const char * function,
const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & y,
const char * name,
T_result * result 
)
+
+inline
+
+ +

Return true if the specified matrix is positive definite.

+

NOTE: symmetry is NOT checked by this function

+
Parameters
+ + + + + +
function
yMatrix to test.
name
result
+
+
+
Returns
true if the matrix is positive semi-definite.
+
Template Parameters
+ + +
TType of scalar.
+
+
+ +

Definition at line 26 of file check_pos_semidefinite.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_pos_semidefinite (const char * function,
const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & y,
const char * name,
T * result = 0 
)
+
+inline
+
+ +

Definition at line 53 of file check_pos_semidefinite.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_result >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_positive (const char * function,
const T_y & y,
const char * name,
T_result * result 
)
+
+inline
+
+ +

Definition at line 48 of file check_positive.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_positive (const char * function,
const T & x,
const char * name 
)
+
+inline
+
+ +

Definition at line 56 of file check_positive.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_result >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_positive_ordered (const char * function,
const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > & y,
const char * name,
T_result * result 
)
+
+ +

Return true if the specified vector contains only non-negative values and is sorted into increasing order.

+

There may be duplicate values. Otherwise, raise a domain error according to the specified policy.

+
Parameters
+ + + + + +
function
yVector to test.
name
result
+
+
+
Returns
true if the vector has positive, ordered values.
+ +

Definition at line 25 of file check_positive_ordered.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_positive_ordered (const char * function,
const Eigen::Matrix< T, Eigen::Dynamic, 1 > & y,
const char * name,
T * result = 0 
)
+
+ +

Definition at line 59 of file check_positive_ordered.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::math::check_range (size_t max,
size_t i,
const char * msg,
size_t idx 
)
+
+inline
+
+ +

Definition at line 30 of file check_range.hpp.

+ +
+
+ +
+
+
+template<typename T_prob , typename T_result >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_simplex (const char * function,
const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > & theta,
const char * name,
T_result * result 
)
+
+ +

Return true if the specified vector is simplex.

+

To be a simplex, all values must be greater than or equal to 0 and the values must sum to 1.

+

The test that the values sum to 1 is done to within the tolerance specified by CONSTRAINT_TOLERANCE.

+
Parameters
+ + + + + +
function
thetaVector to test.
name
result
+
+
+
Returns
true if the vector is a simplex.
+ +

Definition at line 27 of file check_simplex.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_simplex (const char * function,
const Eigen::Matrix< T, Eigen::Dynamic, 1 > & theta,
const char * name,
T * result = 0 
)
+
+inline
+
+ +

Definition at line 67 of file check_simplex.hpp.

+ +
+
+ +
+
+
+template<typename T_size1 , typename T_size2 , typename T_result >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_size_match (const char * function,
T_size1 i,
const char * name_i,
T_size2 j,
const char * name_j,
T_result * result 
)
+
+inline
+
+ +

Definition at line 13 of file check_size_match.hpp.

+ +
+
+ +
+
+
+template<typename T_size1 , typename T_size2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_size_match (const char * function,
T_size1 i,
const char * name_i,
T_size2 j,
const char * name_j,
T_size1 * result = 0 
)
+
+inline
+
+ +

Definition at line 34 of file check_size_match.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_result >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_spsd_matrix (const char * function,
const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & y,
const char * name,
T_result * result 
)
+
+inline
+
+ +

Return true if the specified matrix is a square, symmetric, and positive semi-definite.

+
Parameters
+ + + + + +
function
yMatrix to test.
name
result
+
+
+
Returns
true if the matrix is a square, symmetric, and positive semi-definite.
+
Template Parameters
+ + +
TType of scalar.
+
+
+ +

Definition at line 29 of file check_spsd_matrix.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_spsd_matrix (const char * function,
const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & y,
const char * name,
T * result = 0 
)
+
+inline
+
+ +

Definition at line 45 of file check_spsd_matrix.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_result >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_square (const char * function,
const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & y,
const char * name,
T_result * result 
)
+
+inline
+
+ +

Return true if the specified matrix is square.

+
Parameters
+ + + + + +
function
yMatrix to test.
name
result
+
+
+
Returns
true if the matrix is a square matrix.
+
Template Parameters
+ + +
TType of scalar.
+
+
+ +

Definition at line 26 of file check_square.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_square (const char * function,
const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & y,
const char * name,
T * result = 0 
)
+
+inline
+
+ +

Definition at line 39 of file check_square.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_result >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_symmetric (const char * function,
const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & y,
const char * name,
T_result * result 
)
+
+inline
+
+ +

Return true if the specified matrix is symmetric.

+

NOTE: squareness is not checked by this function

+
Parameters
+ + + + + +
function
yMatrix to test.
name
result
+
+
+
Returns
true if the matrix is symmetric.
+
Template Parameters
+ + +
TType of scalar.
+
+
+ +

Definition at line 26 of file check_symmetric.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_symmetric (const char * function,
const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & y,
const char * name,
T * result = 0 
)
+
+inline
+
+ +

Definition at line 55 of file check_symmetric.hpp.

+ +
+
+ +
+
+
+template<typename T_prob , typename T_result >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_unit_vector (const char * function,
const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > & theta,
const char * name,
T_result * result 
)
+
+ +

Return true if the specified vector is unit vector.

+

The test that the values sum to 1 is done to within the tolerance specified by CONSTRAINT_TOLERANCE.

+
Parameters
+ + + + + +
function
thetaVector to test.
name
result
+
+
+
Returns
true if the vector is a unit vector.
+ +

Definition at line 25 of file check_unit_vector.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::check_unit_vector (const char * function,
const Eigen::Matrix< T, Eigen::Dynamic, 1 > & theta,
const char * name,
T * result = 0 
)
+
+inline
+
+ +

Definition at line 52 of file check_unit_vector.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> stan::math::cholesky_decompose (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & m)
+
+ +

Return the lower-triangular Cholesky factor (i.e., matrix square root) of the specified square, symmetric matrix.

+

The return value $L$ will be a lower-traingular matrix such that the original matrix $A$ is given by

+

$A = L \times L^T$.

+
Parameters
+ + +
mSymmetrix matrix.
+
+
+
Returns
Square root of matrix.
+
Exceptions
+ + +
std::domain_errorif m is not a symmetric matrix.
+
+
+ +

Definition at line 22 of file cholesky_decompose.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,1> stan::math::col (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & m,
size_t j 
)
+
+inline
+
+ +

Return the specified column of the specified matrix using start-at-1 indexing.

+

This is equivalent to calling m.col(i - 1) and assigning the resulting template expression to a column vector.

+
Parameters
+ + + +
mMatrix.
jColumn index (count from 1).
+
+
+
Returns
Specified column of the matrix.
+ +

Definition at line 24 of file col.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + +
size_t stan::math::cols (const Eigen::Matrix< T, R, C > & m)
+
+inline
+
+ +

Definition at line 12 of file cols.hpp.

+ +
+
+ +
+
+
+template<int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<double, 1, C1> stan::math::columns_dot_product (const Eigen::Matrix< double, R1, C1 > & v1,
const Eigen::Matrix< double, R2, C2 > & v2 
)
+
+inline
+
+ +

Returns the dot product of the specified vectors.

+
Parameters
+ + + +
v1First vector.
v2Second vector.
+
+
+
Returns
Dot product of the vectors.
+
Exceptions
+ + +
std::domain_errorIf the vectors are not the same size or if they are both not vector dimensioned.
+
+
+ +

Definition at line 22 of file columns_dot_product.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<T,1,C> stan::math::columns_dot_self (const Eigen::Matrix< T, R, C > & x)
+
+inline
+
+ +

Returns the dot product of each column of a matrix with itself.

+
Parameters
+ + +
xMatrix.
+
+
+
Template Parameters
+ + +
Tscalar type
+
+
+ +

Definition at line 16 of file columns_dot_self.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
matrix_d stan::math::crossprod (const matrix_d & M)
+
+inline
+
+ +

Returns the result of pre-multiplying a matrix by its own transpose.

+
Parameters
+ + +
MMatrix to multiply.
+
+
+
Returns
Transpose of M times M
+ +

Definition at line 17 of file crossprod.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
std::vector<T> stan::math::cumulative_sum (const std::vector< T > & x)
+
+inline
+
+ +

Return the cumulative sum of the specified vector.

+

The cumulative sum of a vector of values

+
is the
+
+
@code x[0], x[1] + x[2], ..., x[1] + ,..., + x[x.size()-1]
+
Template Parameters
+ + +
TScalar type of vector.
+
+
+
Parameters
+ + +
xVector of values.
+
+
+
Returns
Cumulative sum of values.
+ +

Definition at line 23 of file cumulative_sum.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<T,R,C> stan::math::cumulative_sum (const Eigen::Matrix< T, R, C > & m)
+
+inline
+
+ +

Return the cumulative sum of the specified matrix.

+

The cumulative sum is of the same type as the input and has values defined by

+
x(0), x(1) + x(2), ..., x(1) + ,..., + x(x.size()-1)
+
Template Parameters
+ + + + +
TScalar type of matrix.
RRow type of matrix.
CColumn type of matrix.
+
+
+
Parameters
+ + +
mMatrix of values.
+
+
+
Returns
Cumulative sum of values.
+ +

Definition at line 49 of file cumulative_sum.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + +
T stan::math::determinant (const Eigen::Matrix< T, R, C > & m)
+
+inline
+
+ +

Returns the determinant of the specified square matrix.

+
Parameters
+ + +
mSpecified matrix.
+
+
+
Returns
Determinant of the matrix.
+
Exceptions
+ + +
std::domain_errorif matrix is not square.
+
+
+ +

Definition at line 18 of file determinant.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> stan::math::diag_matrix (const Eigen::Matrix< T, Eigen::Dynamic, 1 > & v)
+
+inline
+
+ +

Return a square diagonal matrix with the specified vector of coefficients as the diagonal values.

+
Parameters
+ + +
[in]vSpecified vector.
+
+
+
Returns
Diagonal matrix with vector as diagonal values.
+ +

Definition at line 18 of file diag_matrix.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , int R1, int C1, int R2, int C2>
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type, R1, C1> stan::math::diag_post_multiply (const Eigen::Matrix< T1, R1, C1 > & m1,
const Eigen::Matrix< T2, R2, C2 > & m2 
)
+
+ +

Definition at line 13 of file diag_post_multiply.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , int R1, int C1, int R2, int C2>
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type, R2, C2> stan::math::diag_pre_multiply (const Eigen::Matrix< T1, R1, C1 > & m1,
const Eigen::Matrix< T2, R2, C2 > & m2 
)
+
+ +

Definition at line 13 of file diag_pre_multiply.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,1> stan::math::diagonal (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & m)
+
+inline
+
+ +

Return a column vector of the diagonal elements of the specified matrix.

+

The matrix is not required to be square.

+
Parameters
+ + +
mSpecified matrix.
+
+
+
Returns
Diagonal of the matrix.
+ +

Definition at line 18 of file diagonal.hpp.

+ +
+
+ +
+
+ + + + + + + + +
double stan::math::digamma (double x)
+
+ +

Definition at line 10 of file digamma.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::math::dims (const T & x,
std::vector< int > & result 
)
+
+inline
+
+ +

Definition at line 13 of file dims.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::math::dims (const Eigen::Matrix< T, R, C > & x,
std::vector< int > & result 
)
+
+inline
+
+ +

Definition at line 18 of file dims.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::math::dims (const std::vector< T > & x,
std::vector< int > & result 
)
+
+inline
+
+ +

Definition at line 25 of file dims.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
std::vector<int> stan::math::dims (const T & x)
+
+inline
+
+ +

Definition at line 34 of file dims.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
double stan::math::dist (const std::vector< double > & x,
const std::vector< double > & y 
)
+
+inline
+
+ +

Definition at line 11 of file dist.hpp.

+ +
+
+ +
+
+
+template<typename T1 , int R1, int C1, typename T2 , int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T1,T1>::type stan::math::dist (const Eigen::Matrix< T1, R1, C1 > & v1,
const Eigen::Matrix< T2, R2, C2 > & v2 
)
+
+inline
+
+ +

Returns the distance between the specified vectors.

+
Parameters
+ + + +
v1First vector.
v2Second vector.
+
+
+
Returns
Dot product of the vectors.
+
Exceptions
+ + +
std::domain_errorIf the vectors are not the same size or if they are both not vector dimensioned.
+
+
+ +

Definition at line 23 of file dist.hpp.

+ +
+
+ +
+
+
+template<int R, int C, typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::enable_if_c<boost::is_arithmetic<T>::value, Eigen::Matrix<double, R, C> >::type stan::math::divide (const Eigen::Matrix< double, R, C > & m,
c 
)
+
+inline
+
+ +

Return specified matrix divided by specified scalar.

+
Template Parameters
+ + + +
RRow type for matrix.
CColumn type for matrix.
+
+
+
Parameters
+ + + +
mMatrix.
cScalar.
+
+
+
Returns
Matrix divided by scalar.
+ +

Definition at line 23 of file divide.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_result , typename T_msg2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::dom_err (const char * function,
const T_y & y,
const char * name,
const char * error_msg,
T_msg2 error_msg2,
T_result * result 
)
+
+inline
+
+ +

Definition at line 25 of file dom_err.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_result , typename T_msg2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::math::dom_err_vec (size_t i,
const char * function,
const T_y & y,
const char * name,
const char * error_msg,
T_msg2 error_msg2,
T_result * result 
)
+
+inline
+
+ +

Definition at line 15 of file dom_err_vec.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
double stan::math::dot (const std::vector< double > & x,
const std::vector< double > & y 
)
+
+inline
+
+ +

Definition at line 11 of file dot.hpp.

+ +
+
+ +
+
+
+template<int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
double stan::math::dot_product (const Eigen::Matrix< double, R1, C1 > & v1,
const Eigen::Matrix< double, R2, C2 > & v2 
)
+
+inline
+
+ +

Returns the dot product of the specified vectors.

+
Parameters
+ + + +
v1First vector.
v2Second vector.
+
+
+
Returns
Dot product of the vectors.
+
Exceptions
+ + +
std::domain_errorIf the vectors are not the same size or if they are both not vector dimensioned.
+
+
+ +

Definition at line 22 of file dot_product.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
double stan::math::dot_product (const double * v1,
const double * v2,
size_t length 
)
+
+inline
+
+ +

Returns the dot product of the specified arrays of doubles.

+
Parameters
+ + + + +
v1First array.
v2Second array.
lengthLength of both arrays.
+
+
+ +

Definition at line 35 of file dot_product.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
double stan::math::dot_product (const std::vector< double > & v1,
const std::vector< double > & v2 
)
+
+inline
+
+ +

Returns the dot product of the specified arrays of doubles.

+
Parameters
+ + + +
v1First array.
v2Second array.
+
+
+
Exceptions
+ + +
std::domain_errorif the vectors are not the same size.
+
+
+ +

Definition at line 48 of file dot_product.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
double stan::math::dot_self (const std::vector< double > & x)
+
+inline
+
+ +

Definition at line 11 of file dot_self.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + + +
double stan::math::dot_self (const Eigen::Matrix< double, R, C > & v)
+
+inline
+
+ +

Returns the dot product of the specified vector with itself.

+
Parameters
+ + +
vVector.
+
+
+
Template Parameters
+ + + +
Rnumber of rows or Eigen::Dynamic for dynamic
Cnumber of rows or Eigen::Dyanmic for dynamic
+
+
+
Exceptions
+ + +
std::domain_errorIf v is not vector dimensioned.
+
+
+ +

Definition at line 18 of file dot_self.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
double stan::math::e ()
+
+inline
+
+ +

Return the base of the natural logarithm.

+
Returns
Base of natural logarithm.
+ +

Definition at line 86 of file constants.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,1> stan::math::eigenvalues_sym (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & m)
+
+ +

Return the eigenvalues of the specified symmetric matrix in descending order of magnitude.

+

This function is more efficient than the general eigenvalues function for symmetric matrices.

+

See eigen_decompose() for more information.

+
Parameters
+ + +
mSpecified matrix.
+
+
+
Returns
Eigenvalues of matrix.
+ +

Definition at line 22 of file eigenvalues_sym.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> stan::math::eigenvectors_sym (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & m)
+
+ +

Definition at line 13 of file eigenvectors_sym.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , int R, int C>
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type, R, C> stan::math::elt_divide (const Eigen::Matrix< T1, R, C > & m1,
const Eigen::Matrix< T2, R, C > & m2 
)
+
+ +

Return the elementwise division of the specified matrices matrices.

+
Template Parameters
+ + + + + +
T1Type of scalars in first matrix.
T2Type of scalars in second matrix.
RRow type of both matrices.
CColumn type of both matrices.
+
+
+
Parameters
+ + + +
m1First matrix
m2Second matrix
+
+
+
Returns
Elementwise division of matrices.
+ +

Definition at line 25 of file elt_divide.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , int R, int C>
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type, R, C> stan::math::elt_multiply (const Eigen::Matrix< T1, R, C > & m1,
const Eigen::Matrix< T2, R, C > & m2 
)
+
+ +

Return the elementwise multiplication of the specified matrices.

+
Template Parameters
+ + + + + +
T1Type of scalars in first matrix.
T2Type of scalars in second matrix.
RRow type of both matrices.
CColumn type of both matrices.
+
+
+
Parameters
+ + + +
m1First matrix
m2Second matrix
+
+
+
Returns
Elementwise product of matrices.
+ +

Definition at line 25 of file elt_multiply.hpp.

+ +
+
+ +
+
+
+template<typename T , int Rows, int Cols>
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<T,Rows,Cols> stan::math::exp (const Eigen::Matrix< T, Rows, Cols > & m)
+
+inline
+
+ +

Return the element-wise exponentiation of the matrix or vector.

+
Parameters
+ + +
mThe matrix or vector.
+
+
+
Returns
ret(i,j) = exp(m(i,j))
+ +

Definition at line 16 of file exp.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
boost::math::tools::promote_args<T>::type stan::math::exp2 (const T y)
+
+inline
+
+ +

Return the exponent base 2 of the specified argument (C99).

+

The exponent base 2 function is defined by

+

exp2(y) = pow(2.0,y).

+
Parameters
+ + +
yValue.
+
+
+
Template Parameters
+ + +
TType of scalar.
+
+
+
Returns
Exponent base 2 of value.
+ +

Definition at line 23 of file exp2.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
double stan::math::F32 (double a,
double b,
double c,
double d,
double e,
double z,
double precision = 1e-6 
)
+
+ +

Definition at line 14 of file internal_math.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T1,T2>::type stan::math::falling_factorial (const T1 x,
const T2 n 
)
+
+inline
+
+ +

Definition at line 11 of file falling_factorial.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T1, T2>::type stan::math::fdim (T1 a,
T2 b 
)
+
+inline
+
+ +

The positive difference function (C99).

+

The function is defined by

+

fdim(a,b) = (a > b) ? (a - b) : 0.0.

+
Parameters
+ + + +
aFirst value.
bSecond value.
+
+
+
Returns
Returns min(a - b, 0.0).
+ +

Definition at line 21 of file fdim.hpp.

+ +
+
+ +
+
+
+template<typename T , typename S >
+ + + + + + + + + + + + + + + + + + +
void stan::math::fill (T & x,
const S & y 
)
+
+ +

Fill the specified container with the specified value.

+

This base case simply assigns the value to the container.

+
Template Parameters
+ + + +
TType of reference container.
SType of value.
+
+
+
Parameters
+ + + +
xContainer.
yValue.
+
+
+ +

Definition at line 22 of file fill.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C, typename S >
+ + + + + + + + + + + + + + + + + + +
void stan::math::fill (Eigen::Matrix< T, R, C > & x,
const S & y 
)
+
+ +

Fill the specified container with the specified value.

+

The specified matrix is filled by element.

+
Template Parameters
+ + + + + +
TType of scalar for matrix container.
RRow type of matrix.
CColumn type of matrix.
SType of value.
+
+
+
Parameters
+ + + +
xContainer.
yValue.
+
+
+ +

Definition at line 39 of file fill.hpp.

+ +
+
+ +
+
+
+template<typename T , typename S >
+ + + + + + + + + + + + + + + + + + +
void stan::math::fill (std::vector< T > & x,
const S & y 
)
+
+ +

Fill the specified container with the specified value.

+

Each container in the specified standard vector is filled recursively by calling fill.

+
Template Parameters
+ + + +
TType of container in vector.
SType of value.
+
+
+
Parameters
+ + + +
xContainer.
yValue.
+
+
+ +

Definition at line 55 of file fill.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , typename T3 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T1,T2,T3>::type stan::math::fma (const T1 a,
const T2 b,
const T3 c 
)
+
+inline
+
+ +

The fused multiply-add operation (C99).

+

The function is defined by

+

fma(a,b,c) = (a * b) + c.

+
Parameters
+ + + + +
aFirst value.
bSecond value.
cThird value.
+
+
+
Returns
Product of the first two values plust the third.
+ +

Definition at line 23 of file fma.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
double stan::math::gamma_p (double x,
double a 
)
+
+ +

Definition at line 11 of file gamma_p.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
double stan::math::gamma_q (double x,
double a 
)
+
+ +

Definition at line 11 of file gamma_q.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
const T& stan::math::get_base1 (const std::vector< T > & x,
size_t i,
const char * error_msg,
size_t idx 
)
+
+inline
+
+ +

Return a reference to the value of the specified vector at the specified base-one index.

+

If the index is out of range, throw a std::out_of_range exception with the specified error message and index indicated.

+
Parameters
+ + + + + +
xVector from which to get a value.
iIndex into vector plus 1.
error_msgError message if the index is out of range.
idxNested index level to report in error message if the index is out of range.
+
+
+
Returns
Value of vector at i - 1
+
Template Parameters
+ + +
Ttype of value.
+
+
+ +

Definition at line 27 of file get_base1.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
const T& stan::math::get_base1 (const std::vector< std::vector< T > > & x,
size_t i1,
size_t i2,
const char * error_msg,
size_t idx 
)
+
+inline
+
+ +

Return a reference to the value of the specified vector at the specified base-one indexes.

+

If an index is out of range, throw a std::out_of_range exception with the specified error message and index indicated.

+
Parameters
+ + + + + + +
xVector from which to get a value.
i1First index plus 1.
i2Second index plus 1.
error_msgError message if an index is out of range.
idxNested index level to report in error message if the index is out of range.
+
+
+
Returns
Value of vector at indexes.
+
Template Parameters
+ + +
Ttype of value.
+
+
+ +

Definition at line 52 of file get_base1.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
const T& stan::math::get_base1 (const std::vector< std::vector< std::vector< T > > > & x,
size_t i1,
size_t i2,
size_t i3,
const char * error_msg,
size_t idx 
)
+
+inline
+
+ +

Return a reference to the value of the specified vector at the specified base-one indexes.

+

If an index is out of range, throw a std::out_of_range exception with the specified error message and index indicated.

+
Parameters
+ + + + + + + +
xVector from which to get a value.
i1First index plus 1.
i2Second index plus 1.
i3Third index plus 1.
error_msgError message if an index is out of range.
idxNested index level to report in error message if the index is out of range.
+
+
+
Returns
Value of vector at indexes.
+
Template Parameters
+ + +
Ttype of value.
+
+
+ +

Definition at line 79 of file get_base1.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
const T& stan::math::get_base1 (const std::vector< std::vector< std::vector< std::vector< T > > > > & x,
size_t i1,
size_t i2,
size_t i3,
size_t i4,
const char * error_msg,
size_t idx 
)
+
+inline
+
+ +

Return a reference to the value of the specified vector at the specified base-one indexes.

+

If an index is out of range, throw a std::out_of_range exception with the specified error message and index indicated.

+
Parameters
+ + + + + + + + +
xVector from which to get a value.
i1First index plus 1.
i2Second index plus 1.
i3Third index plus 1.
i4Fourth index plus 1.
error_msgError message if an index is out of range.
idxNested index level to report in error message if the index is out of range.
+
+
+
Returns
Value of vector at indexes.
+
Template Parameters
+ + +
Ttype of value.
+
+
+ +

Definition at line 108 of file get_base1.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
const T& stan::math::get_base1 (const std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > & x,
size_t i1,
size_t i2,
size_t i3,
size_t i4,
size_t i5,
const char * error_msg,
size_t idx 
)
+
+inline
+
+ +

Return a reference to the value of the specified vector at the specified base-one indexes.

+

If an index is out of range, throw a std::out_of_range exception with the specified error message and index indicated.

+
Parameters
+ + + + + + + + + +
xVector from which to get a value.
i1First index plus 1.
i2Second index plus 1.
i3Third index plus 1.
i4Fourth index plus 1.
i5Fifth index plus 1.
error_msgError message if an index is out of range.
idxNested index level to report in error message if the index is out of range.
+
+
+
Returns
Value of vector at indexes.
+
Template Parameters
+ + +
Ttype of value.
+
+
+ +

Definition at line 139 of file get_base1.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
const T& stan::math::get_base1 (const std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > > & x,
size_t i1,
size_t i2,
size_t i3,
size_t i4,
size_t i5,
size_t i6,
const char * error_msg,
size_t idx 
)
+
+inline
+
+ +

Return a reference to the value of the specified vector at the specified base-one indexes.

+

If an index is out of range, throw a std::out_of_range exception with the specified error message and index indicated.

+
Parameters
+ + + + + + + + + + +
xVector from which to get a value.
i1First index plus 1.
i2Second index plus 1.
i3Third index plus 1.
i4Fourth index plus 1.
i5Fifth index plus 1.
i6Sixth index plus 1.
error_msgError message if an index is out of range.
idxNested index level to report in error message if the index is out of range.
+
+
+
Returns
Value of vector at indexes.
+
Template Parameters
+ + +
Ttype of value.
+
+
+ +

Definition at line 172 of file get_base1.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
const T& stan::math::get_base1 (const std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > > > & x,
size_t i1,
size_t i2,
size_t i3,
size_t i4,
size_t i5,
size_t i6,
size_t i7,
const char * error_msg,
size_t idx 
)
+
+inline
+
+ +

Return a reference to the value of the specified vector at the specified base-one indexes.

+

If an index is out of range, throw a std::out_of_range exception with the specified error message and index indicated.

+
Parameters
+ + + + + + + + + + + +
xVector from which to get a value.
i1First index plus 1.
i2Second index plus 1.
i3Third index plus 1.
i4Fourth index plus 1.
i5Fifth index plus 1.
i6Sixth index plus 1.
i7Seventh index plus 1.
error_msgError message if an index is out of range.
idxNested index level to report in error message if the index is out of range.
+
+
+
Returns
Value of vector at indexes.
+
Template Parameters
+ + +
Ttype of value.
+
+
+ +

Definition at line 208 of file get_base1.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
const T& stan::math::get_base1 (const std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > > > > & x,
size_t i1,
size_t i2,
size_t i3,
size_t i4,
size_t i5,
size_t i6,
size_t i7,
size_t i8,
const char * error_msg,
size_t idx 
)
+
+inline
+
+ +

Return a reference to the value of the specified vector at the specified base-one indexes.

+

If an index is out of range, throw a std::out_of_range exception with the specified error message and index indicated.

+
Parameters
+ + + + + + + + + + + + +
xVector from which to get a value.
i1First index plus 1.
i2Second index plus 1.
i3Third index plus 1.
i4Fourth index plus 1.
i5Fifth index plus 1.
i6Sixth index plus 1.
i7Seventh index plus 1.
i8Eigth index plus 1.
error_msgError message if an index is out of range.
idxNested index level to report in error message if the index is out of range.
+
+
+
Returns
Value of vector at indexes.
+
Template Parameters
+ + +
Ttype of value.
+
+
+ +

Definition at line 246 of file get_base1.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,1,Eigen::Dynamic> stan::math::get_base1 (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & x,
size_t m,
const char * error_msg,
size_t idx 
)
+
+inline
+
+ +

Return a copy of the row of the specified vector at the specified base-one row index.

+

If the index is out of range, throw a std::out_of_range exception with the specified error message and index indicated.

+

Warning: Because a copy is involved, it is inefficient to access element of matrices by first using this method to get a row then using a second call to get the value at a specified column.

+
Parameters
+ + + + + +
xMatrix from which to get a row
mIndex into matrix plus 1.
error_msgError message if the index is out of range.
idxNested index level to report in error message if the index is out of range.
+
+
+
Returns
Row of matrix at i - 1.
+
Template Parameters
+ + +
Ttype of value.
+
+
+ +

Definition at line 284 of file get_base1.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
const T& stan::math::get_base1 (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & x,
size_t m,
size_t n,
const char * error_msg,
size_t idx 
)
+
+inline
+
+ +

Return a reference to the value of the specified matrix at the specified base-one row and column indexes.

+

If either index is out of range, throw a std::out_of_range exception with the specified error message and index indicated.

+
Parameters
+ + + + + + +
xMatrix from which to get a row
mRow index plus 1.
nColumn index plus 1.
error_msgError message if either index is out of range.
idxNested index level to report in error message if either index is out of range.
+
+
+
Returns
Value of matrix at row m - 1 and column n - 1.
+
Template Parameters
+ + +
Ttype of value.
+
+
+ +

Definition at line 310 of file get_base1.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
const T& stan::math::get_base1 (const Eigen::Matrix< T, Eigen::Dynamic, 1 > & x,
size_t m,
const char * error_msg,
size_t idx 
)
+
+inline
+
+ +

Return a reference to the value of the specified column vector at the specified base-one index.

+

If the index is out of range, throw a std::out_of_range exception with the specified error message and index indicated.

+
Parameters
+ + + + + +
xColumn vector from which to get a value.
mRow index plus 1.
error_msgError message if the index is out of range.
idxNested index level to report in error message if the index is out of range.
+
+
+
Returns
Value of column vector at row m - 1.
+
Template Parameters
+ + +
Ttype of value.
+
+
+ +

Definition at line 336 of file get_base1.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
const T& stan::math::get_base1 (const Eigen::Matrix< T, 1, Eigen::Dynamic > & x,
size_t n,
const char * error_msg,
size_t idx 
)
+
+inline
+
+ +

Return a reference to the value of the specified row vector at the specified base-one index.

+

If the index is out of range, throw a std::out_of_range exception with the specified error message and index indicated.

+
Parameters
+ + + + + +
xRow vector from which to get a value.
nColumn index plus 1.
error_msgError message if the index is out of range.
idxNested index level to report in error message if the index is out of range.
+
+
+
Returns
Value of row vector at column n - 1.
+
Template Parameters
+ + +
Ttype of value.
+
+
+ +

Definition at line 360 of file get_base1.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
T& stan::math::get_base1_lhs (std::vector< T > & x,
size_t i,
const char * error_msg,
size_t idx 
)
+
+inline
+
+ +

Return a reference to the value of the specified vector at the specified base-one index.

+

If the index is out of range, throw a std::out_of_range exception with the specified error message and index indicated.

+
Parameters
+ + + + + +
xVector from which to get a value.
iIndex into vector plus 1.
error_msgError message if the index is out of range.
idxNested index level to report in error message if the index is out of range.
+
+
+
Returns
Value of vector at i - 1
+
Template Parameters
+ + +
Ttype of value.
+
+
+ +

Definition at line 27 of file get_base1_lhs.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
T& stan::math::get_base1_lhs (std::vector< std::vector< T > > & x,
size_t i1,
size_t i2,
const char * error_msg,
size_t idx 
)
+
+inline
+
+ +

Return a reference to the value of the specified vector at the specified base-one indexes.

+

If an index is out of range, throw a std::out_of_range exception with the specified error message and index indicated.

+
Parameters
+ + + + + + +
xVector from which to get a value.
i1First index plus 1.
i2Second index plus 1.
error_msgError message if an index is out of range.
idxNested index level to report in error message if the index is out of range.
+
+
+
Returns
Value of vector at indexes.
+
Template Parameters
+ + +
Ttype of value.
+
+
+ +

Definition at line 52 of file get_base1_lhs.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
T& stan::math::get_base1_lhs (std::vector< std::vector< std::vector< T > > > & x,
size_t i1,
size_t i2,
size_t i3,
const char * error_msg,
size_t idx 
)
+
+inline
+
+ +

Return a reference to the value of the specified vector at the specified base-one indexes.

+

If an index is out of range, throw a std::out_of_range exception with the specified error message and index indicated.

+
Parameters
+ + + + + + + +
xVector from which to get a value.
i1First index plus 1.
i2Second index plus 1.
i3Third index plus 1.
error_msgError message if an index is out of range.
idxNested index level to report in error message if the index is out of range.
+
+
+
Returns
Value of vector at indexes.
+
Template Parameters
+ + +
Ttype of value.
+
+
+ +

Definition at line 79 of file get_base1_lhs.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
T& stan::math::get_base1_lhs (std::vector< std::vector< std::vector< std::vector< T > > > > & x,
size_t i1,
size_t i2,
size_t i3,
size_t i4,
const char * error_msg,
size_t idx 
)
+
+inline
+
+ +

Return a reference to the value of the specified vector at the specified base-one indexes.

+

If an index is out of range, throw a std::out_of_range exception with the specified error message and index indicated.

+
Parameters
+ + + + + + + + +
xVector from which to get a value.
i1First index plus 1.
i2Second index plus 1.
i3Third index plus 1.
i4Fourth index plus 1.
error_msgError message if an index is out of range.
idxNested index level to report in error message if the index is out of range.
+
+
+
Returns
Value of vector at indexes.
+
Template Parameters
+ + +
Ttype of value.
+
+
+ +

Definition at line 108 of file get_base1_lhs.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
T& stan::math::get_base1_lhs (std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > & x,
size_t i1,
size_t i2,
size_t i3,
size_t i4,
size_t i5,
const char * error_msg,
size_t idx 
)
+
+inline
+
+ +

Return a reference to the value of the specified vector at the specified base-one indexes.

+

If an index is out of range, throw a std::out_of_range exception with the specified error message and index indicated.

+
Parameters
+ + + + + + + + + +
xVector from which to get a value.
i1First index plus 1.
i2Second index plus 1.
i3Third index plus 1.
i4Fourth index plus 1.
i5Fifth index plus 1.
error_msgError message if an index is out of range.
idxNested index level to report in error message if the index is out of range.
+
+
+
Returns
Value of vector at indexes.
+
Template Parameters
+ + +
Ttype of value.
+
+
+ +

Definition at line 139 of file get_base1_lhs.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
T& stan::math::get_base1_lhs (std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > > & x,
size_t i1,
size_t i2,
size_t i3,
size_t i4,
size_t i5,
size_t i6,
const char * error_msg,
size_t idx 
)
+
+inline
+
+ +

Return a reference to the value of the specified vector at the specified base-one indexes.

+

If an index is out of range, throw a std::out_of_range exception with the specified error message and index indicated.

+
Parameters
+ + + + + + + + + + +
xVector from which to get a value.
i1First index plus 1.
i2Second index plus 1.
i3Third index plus 1.
i4Fourth index plus 1.
i5Fifth index plus 1.
i6Sixth index plus 1.
error_msgError message if an index is out of range.
idxNested index level to report in error message if the index is out of range.
+
+
+
Returns
Value of vector at indexes.
+
Template Parameters
+ + +
Ttype of value.
+
+
+ +

Definition at line 172 of file get_base1_lhs.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
T& stan::math::get_base1_lhs (std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > > > & x,
size_t i1,
size_t i2,
size_t i3,
size_t i4,
size_t i5,
size_t i6,
size_t i7,
const char * error_msg,
size_t idx 
)
+
+inline
+
+ +

Return a reference to the value of the specified vector at the specified base-one indexes.

+

If an index is out of range, throw a std::out_of_range exception with the specified error message and index indicated.

+
Parameters
+ + + + + + + + + + + +
xVector from which to get a value.
i1First index plus 1.
i2Second index plus 1.
i3Third index plus 1.
i4Fourth index plus 1.
i5Fifth index plus 1.
i6Sixth index plus 1.
i7Seventh index plus 1.
error_msgError message if an index is out of range.
idxNested index level to report in error message if the index is out of range.
+
+
+
Returns
Value of vector at indexes.
+
Template Parameters
+ + +
Ttype of value.
+
+
+ +

Definition at line 208 of file get_base1_lhs.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
T& stan::math::get_base1_lhs (std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > > > > & x,
size_t i1,
size_t i2,
size_t i3,
size_t i4,
size_t i5,
size_t i6,
size_t i7,
size_t i8,
const char * error_msg,
size_t idx 
)
+
+inline
+
+ +

Return a reference to the value of the specified vector at the specified base-one indexes.

+

If an index is out of range, throw a std::out_of_range exception with the specified error message and index indicated.

+
Parameters
+ + + + + + + + + + + + +
xVector from which to get a value.
i1First index plus 1.
i2Second index plus 1.
i3Third index plus 1.
i4Fourth index plus 1.
i5Fifth index plus 1.
i6Sixth index plus 1.
i7Seventh index plus 1.
i8Eigth index plus 1.
error_msgError message if an index is out of range.
idxNested index level to report in error message if the index is out of range.
+
+
+
Returns
Value of vector at indexes.
+
Template Parameters
+ + +
Ttype of value.
+
+
+ +

Definition at line 246 of file get_base1_lhs.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Eigen::Block<Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> > stan::math::get_base1_lhs (Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & x,
size_t m,
const char * error_msg,
size_t idx 
)
+
+inline
+
+ +

Return a copy of the row of the specified vector at the specified base-one row index.

+

If the index is out of range, throw a std::out_of_range exception with the specified error message and index indicated.

+

Warning: Because a copy is involved, it is inefficient to access element of matrices by first using this method to get a row then using a second call to get the value at a specified column.

+
Parameters
+ + + + + +
xMatrix from which to get a row
mIndex into matrix plus 1.
error_msgError message if the index is out of range.
idxNested index level to report in error message if the index is out of range.
+
+
+
Returns
Row of matrix at i - 1.
+
Template Parameters
+ + +
Ttype of value.
+
+
+ +

Definition at line 285 of file get_base1_lhs.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
T& stan::math::get_base1_lhs (Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & x,
size_t m,
size_t n,
const char * error_msg,
size_t idx 
)
+
+inline
+
+ +

Return a reference to the value of the specified matrix at the specified base-one row and column indexes.

+

If either index is out of range, throw a std::out_of_range exception with the specified error message and index indicated.

+
Parameters
+ + + + + + +
xMatrix from which to get a row
mRow index plus 1.
nColumn index plus 1.
error_msgError message if either index is out of range.
idxNested index level to report in error message if either index is out of range.
+
+
+
Returns
Value of matrix at row m - 1 and column n - 1.
+
Template Parameters
+ + +
Ttype of value.
+
+
+ +

Definition at line 311 of file get_base1_lhs.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
T& stan::math::get_base1_lhs (Eigen::Matrix< T, Eigen::Dynamic, 1 > & x,
size_t m,
const char * error_msg,
size_t idx 
)
+
+inline
+
+ +

Return a reference to the value of the specified column vector at the specified base-one index.

+

If the index is out of range, throw a std::out_of_range exception with the specified error message and index indicated.

+
Parameters
+ + + + + +
xColumn vector from which to get a value.
mRow index plus 1.
error_msgError message if the index is out of range.
idxNested index level to report in error message if the index is out of range.
+
+
+
Returns
Value of column vector at row m - 1.
+
Template Parameters
+ + +
Ttype of value.
+
+
+ +

Definition at line 337 of file get_base1_lhs.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
T& stan::math::get_base1_lhs (Eigen::Matrix< T, 1, Eigen::Dynamic > & x,
size_t n,
const char * error_msg,
size_t idx 
)
+
+inline
+
+ +

Return a reference to the value of the specified row vector at the specified base-one index.

+

If the index is out of range, throw a std::out_of_range exception with the specified error message and index indicated.

+
Parameters
+ + + + + +
xRow vector from which to get a value.
nColumn index plus 1.
error_msgError message if the index is out of range.
idxNested index level to report in error message if the index is out of range.
+
+
+
Returns
Value of row vector at column n - 1.
+
Template Parameters
+ + +
Ttype of value.
+
+
+ +

Definition at line 362 of file get_base1_lhs.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::math::grad2F1 (double & gradA,
double & gradC,
double a,
double b,
double c,
double z,
double precision = 1e-6 
)
+
+ +

Definition at line 102 of file internal_math.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::math::gradF32 (double * g,
double a,
double b,
double c,
double d,
double e,
double z,
double precision = 1e-6 
)
+
+ +

Definition at line 50 of file internal_math.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::math::gradIncBeta (double & g1,
double & g2,
double a,
double b,
double z 
)
+
+ +

Definition at line 140 of file internal_math.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::math::gradRegIncBeta (double & g1,
double & g2,
double a,
double b,
double z,
double digammaA,
double digammaB,
double digammaSum,
double betaAB 
)
+
+ +

Definition at line 161 of file internal_math.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
double stan::math::gradRegIncGamma (double a,
double z,
double g,
double dig,
double precision = 1e-6 
)
+
+ +

Definition at line 181 of file internal_math.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,1> stan::math::head (const Eigen::Matrix< T, Eigen::Dynamic, 1 > & v,
size_t n 
)
+
+inline
+
+ +

Return the specified number of elements as a vector from the front of the specified vector.

+
Template Parameters
+ + +
TType of value in vector
+
+
+
Parameters
+ + + +
vVector input
nSize of return
+
+
+
Returns
The first n elements of v
+ +

Definition at line 25 of file head.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,1,Eigen::Dynamic> stan::math::head (const Eigen::Matrix< T, 1, Eigen::Dynamic > & rv,
size_t n 
)
+
+inline
+
+ +

Return the specified number of elements as a row vector from the front of the specified row vector.

+
Template Parameters
+ + +
TType of value in vector
+
+
+
Parameters
+ + + +
rvRow vector
nSize of return row vector
+
+
+
Returns
The first n elements of rv
+ +

Definition at line 43 of file head.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
std::vector<T> stan::math::head (const std::vector< T > & sv,
size_t n 
)
+
+ +

Return the specified number of elements as a standard vector from the front of the specified standard vector.

+
Template Parameters
+ + +
TType of value in vector
+
+
+
Parameters
+ + + +
svStandard vector
nSize of return
+
+
+
Returns
The first n elements of sv
+ +

Definition at line 59 of file head.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
double stan::math::ibeta (const double a,
const double b,
const double x 
)
+
+inline
+
+ +

The normalized incomplete beta function of a, b, and x.

+

Used to compute the cumulative density function for the beta distribution.

+
Parameters
+ + + + +
aShape parameter.
bShape parameter.
xRandom variate.
+
+
+
Returns
The normalized incomplete beta function.
+ +

Definition at line 21 of file ibeta.hpp.

+ +
+
+ +
+
+
+template<typename T_true , typename T_false >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_true,T_false>::type stan::math::if_else (const bool c,
const T_true y_true,
const T_false y_false 
)
+
+inline
+
+ +

Return the second argument if the first argument is true and otherwise return the second argument.

+

This is just a convenience method to provide a function with the same behavior as the built-in ternary operator. In general, this function behaves as if defined by

+

if_else(c,y1,y0) = c ? y1 : y0.

+
Parameters
+ + + + +
cBoolean condition value.
y_trueValue to return if condition is true.
y_falseValue to return if condition is false.
+
+
+ +

Definition at line 25 of file if_else.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::math::initialize (T & x,
const T & v 
)
+
+inline
+
+ +

Definition at line 16 of file initialize.hpp.

+ +
+
+ +
+
+
+template<typename T , typename V >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::enable_if_c<boost::is_arithmetic<V>::value, void> stan::math::initialize (T & x,
v 
)
+
+inline
+
+ +

Definition at line 22 of file initialize.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::math::initialize (Eigen::Matrix< T, R, C > & x,
const T & v 
)
+
+inline
+
+ +

Definition at line 26 of file initialize.hpp.

+ +
+
+ +
+
+
+template<typename T , typename V >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::math::initialize (std::vector< T > & x,
const V & v 
)
+
+inline
+
+ +

Definition at line 31 of file initialize.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + +
unsigned int stan::math::int_step (const T y)
+
+ +

The integer step, or Heaviside, function.

+
Parameters
+ + +
yValue to test.
+
+
+
Returns
1 if value is greater than 0 and 0 otherwise
+
Template Parameters
+ + +
TScalar argument type.
+
+
+ +

Definition at line 14 of file int_step.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
boost::math::tools::promote_args<T>::type stan::math::inv (const T x)
+
+inline
+
+ +

Definition at line 12 of file inv.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
boost::math::tools::promote_args<T>::type stan::math::inv_cloglog (x)
+
+inline
+
+ +

The inverse complementary log-log function.

+

The function is defined by

+

inv_cloglog(x) = 1 - exp(-exp(x)).

+

This function can be used to implement the inverse link function for complementary-log-log regression.

+
Parameters
+ + +
xArgument.
+
+
+
Returns
Inverse complementary log-log of the argument.
+ +

Definition at line 24 of file inv_cloglog.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
boost::math::tools::promote_args<T>::type stan::math::inv_logit (const T a)
+
+inline
+
+ +

Returns the inverse logit function applied to the argument.

+

The inverse logit function is defined by

+

$\mbox{logit}^{-1}(x) = \frac{1}{1 + \exp(-x)}$.

+

This function can be used to implement the inverse link function for logistic regression.

+

The inverse to this function is stan::math::logit.

+
Parameters
+ + +
aArgument.
+
+
+
Returns
Inverse logit of argument.
+ +

Definition at line 27 of file inv_logit.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
boost::math::tools::promote_args<T>::type stan::math::inv_sqrt (const T x)
+
+inline
+
+ +

Definition at line 12 of file inv_sqrt.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
boost::math::tools::promote_args<T>::type stan::math::inv_square (const T x)
+
+inline
+
+ +

Definition at line 12 of file inv_square.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> stan::math::inverse (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & m)
+
+inline
+
+ +

Returns the inverse of the specified matrix.

+
Parameters
+ + +
mSpecified matrix.
+
+
+
Returns
Inverse of the matrix.
+ +

Definition at line 18 of file inverse.hpp.

+ +
+
+ +
+
+
+template<typename Vector >
+ + + + + + + + + + + + + + + + + + +
void stan::math::inverse_softmax (const Vector & simplex,
Vector & y 
)
+
+ +

Writes the inverse softmax of the simplex argument into the second argument.

+

See stan::math::softmax for the inverse function and a definition of the relation.

+

The inverse softmax function is defined by

+

$\mbox{inverse\_softmax}(x)[i] = \log x[i]$.

+

This function defines the inverse of stan::math::softmax up to a scaling factor.

+

Because of the definition, values of 0.0 in the simplex are converted to negative infinity, and values of 1.0 are converted to 0.0.

+

There is no check that the input vector is a valid simplex vector.

+
Parameters
+ + + +
simplexSimplex vector input.
yVector into which the inverse softmax is written.
+
+
+
Exceptions
+ + +
std::invalid_argumentif size of the input and output vectors differ.
+
+
+ +

Definition at line 34 of file inverse_softmax.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> stan::math::inverse_spd (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & m)
+
+inline
+
+ +

Returns the inverse of the specified symmetric, pos/neg-definite matrix.

+
Parameters
+ + +
mSpecified matrix.
+
+
+
Returns
Inverse of the matrix.
+ +

Definition at line 19 of file inverse_spd.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
bool stan::math::is_uninitialized (x)
+
+inline
+
+ +

Returns true if the specified variable is uninitialized.

+

Arithmetic types are always initialized by definition (the value is not specified).

+
Template Parameters
+ + +
TType of object to test.
+
+
+
Parameters
+ + +
xObject to test.
+
+
+
Returns
true if the specified object is uninitialized.
+ +

Definition at line 18 of file is_uninitialized.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T1,T2>::type stan::math::lbeta (const T1 a,
const T2 b 
)
+
+inline
+
+ +

Return the log of the beta function applied to the specified arguments.

+

The beta function is defined for $a > 0$ and $b > 0$ by

+

$\mbox{B}(a,b) = \frac{\Gamma(a) \Gamma(b)}{\Gamma(a+b)}$.

+

This function returns its log,

+

$\log \mbox{B}(a,b) = \log \Gamma(a) + \log \Gamma(b) - \log \Gamma(a+b)$.

+

See boost::math::lgamma() for the double-based and stan::agrad for the variable-based log Gamma function.

+
Parameters
+ + + +
aFirst value
bSecond value
+
+
+
Returns
Log of the beta function applied to the two values.
+
Template Parameters
+ + + +
T1Type of first value.
T2Type of second value.
+
+
+ +

Definition at line 34 of file lbeta.hpp.

+ +
+
+ +
+
+ + + + + + + + +
double stan::math::lgamma (double x)
+
+ +

Definition at line 11 of file lgamma.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T>::type stan::math::lmgamma (const int k,
x 
)
+
+inline
+
+ +

Return the natural logarithm of the multivariate gamma function with the speciifed dimensions and argument.

+

The multivariate gamma function $\Gamma_k(x)$ for dimensionality $k$ and argument $x$ is defined by

+

$\Gamma_k(x) = \pi^{k(k-1)/4} \, \prod_{j=1}^k \Gamma(x + (1 - j)/2)$,

+

where $\Gamma()$ is the gamma function.

+
Parameters
+ + + +
kNumber of dimensions.
xFunction argument.
+
+
+
Returns
Natural log of the multivariate gamma function.
+
Template Parameters
+ + +
TType of scalar.
+
+
+ +

Definition at line 30 of file lmgamma.hpp.

+ +
+
+ +
+
+
+template<typename T , int Rows, int Cols>
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<T,Rows,Cols> stan::math::log (const Eigen::Matrix< T, Rows, Cols > & m)
+
+inline
+
+ +

Return the element-wise logarithm of the matrix or vector.

+
Parameters
+ + +
mThe matrix or vector.
+
+
+
Returns
ret(i,j) = log(m(i,j))
+ +

Definition at line 16 of file log.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
double stan::math::log10 ()
+
+inline
+
+ +

Return natural logarithm of ten.

+
Returns
Natural logarithm of ten.
+ +

Definition at line 105 of file constants.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
boost::math::tools::promote_args<T>::type stan::math::log1m (x)
+
+inline
+
+ +

Return the natural logarithm of one minus the specified value.

+

The main use of this function is to cut down on intermediate values during algorithmic differentiation.

+
Parameters
+ + +
xSpecified value.
+
+
+
Returns
Natural log of one minus x.
+ +

Definition at line 21 of file log1m.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
boost::math::tools::promote_args<T>::type stan::math::log1m_exp (const T a)
+
+inline
+
+ +

Calculates the log of 1 minus the exponential of the specified value without overflow log1m_exp(x) = log(1-exp(x)).

+

This function is only defined for x<0

+ +

Definition at line 22 of file log1m_exp.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
boost::math::tools::promote_args<T>::type stan::math::log1m_inv_logit (const T u)
+
+inline
+
+ +

Returns the natural logarithm of 1 minus the inverse logit of the specified argument.

+
Template Parameters
+ + +
TScalar type
+
+
+
Parameters
+ + +
uInput.
+
+
+
Returns
log of 1 minus the inverse logit of the input.
+ +

Definition at line 19 of file log1m_inv_logit.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
boost::math::tools::promote_args<T>::type stan::math::log1p (const T x)
+
+inline
+
+ +

Return the natural logarithm of one plus the specified value.

+

The main use of this function is to cut down on intermediate values during algorithmic differentiation.

+
Parameters
+ + +
xSpecified value.
+
+
+
Returns
Natural log of one plus x.
+ +

Definition at line 21 of file log1p.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
boost::math::tools::promote_args<T>::type stan::math::log1p_exp (const T a)
+
+inline
+
+ +

Calculates the log of 1 plus the exponential of the specified value without overflow.

+

This function is related to other special functions by:

+

log1p_exp(x)

+

= log1p(exp(a))

+

= log(1 + exp(x))

+

= log_sum_exp(0,x).

+ +

Definition at line 26 of file log1p_exp.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
boost::math::tools::promote_args<T>::type stan::math::log2 (const T a)
+
+inline
+
+ +

Returns the base 2 logarithm of the argument (C99).

+

The function is defined by:

+

log2(a) = log(a) / std::log(2.0).

+
Template Parameters
+ + +
Ttype of scalar
+
+
+
Parameters
+ + +
aValue.
+
+
+
Returns
Base 2 logarithm of the value.
+ +

Definition at line 25 of file log2.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
double stan::math::log2 ()
+
+inline
+
+ +

Return natural logarithm of two.

+
Returns
Natural logarithm of two.
+ +

Definition at line 35 of file log2.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + +
T stan::math::log_determinant (const Eigen::Matrix< T, R, C > & m)
+
+inline
+
+ +

Returns the log absolute determinant of the specified square matrix.

+
Parameters
+ + +
mSpecified matrix.
+
+
+
Returns
log absolute determinant of the matrix.
+
Exceptions
+ + +
std::domain_errorif matrix is not square.
+
+
+ +

Definition at line 18 of file log_determinant.hpp.

+ +
+
+ +
+
+
+template<int R, int C>
+ + + + + +
+ + + + + + + + +
double stan::math::log_determinant_ldlt (stan::math::LDLT_factor< double, R, C > & A)
+
+inline
+
+ +

Definition at line 100 of file ldlt.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + +
T stan::math::log_determinant_spd (const Eigen::Matrix< T, R, C > & m)
+
+inline
+
+ +

Returns the log absolute determinant of the specified square matrix.

+
Parameters
+ + +
mSpecified matrix.
+
+
+
Returns
log absolute determinant of the matrix.
+
Exceptions
+ + +
std::domain_errorif matrix is not square.
+
+
+ +

Definition at line 20 of file log_determinant_spd.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T1,T2>::type stan::math::log_diff_exp (const T1 x,
const T2 y 
)
+
+inline
+
+ +

The natural logarithm of the difference of the natural exponentiation of x1 and the natural exponentiation of x2.

+

This function is only defined for x<0

+ +

Definition at line 21 of file log_diff_exp.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T1,T2>::type stan::math::log_falling_factorial (const T1 x,
const T2 n 
)
+
+inline
+
+ +

Definition at line 11 of file log_falling_factorial.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
boost::math::tools::promote_args<T>::type stan::math::log_inv_logit (const T & u)
+
+inline
+
+ +

Returns the natural logarithm of the inverse logit of the specified argument.

+
Template Parameters
+ + +
TScalar type
+
+
+
Parameters
+ + +
uInput.
+
+
+
Returns
log of the inverse logit of the input.
+ +

Definition at line 19 of file log_inv_logit.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T1,T2>::type stan::math::log_rising_factorial (const T1 x,
const T2 n 
)
+
+inline
+
+ +

Definition at line 11 of file log_rising_factorial.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,1> stan::math::log_softmax (const Eigen::Matrix< T, Eigen::Dynamic, 1 > & v)
+
+inline
+
+ +

Return the natural logarithm of the softmax of the specified vector.

+
Template Parameters
+ + +
TScalar type of values in vector.
+
+
+
Parameters
+ + +
[in]vVector to transform.
+
+
+
Returns
Unit simplex result of the softmax transform of the vector.
+ +

Definition at line 23 of file log_softmax.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T1,T2>::type stan::math::log_sum_exp (const T2 & a,
const T1 & b 
)
+
+inline
+
+ +

Calculates the log sum of exponetials without overflow.

+

$\log (\exp(a) + \exp(b)) = m + \log(\exp(a-m) + \exp(b-m))$,

+

where $m = max(a,b)$.

+
Parameters
+ + + +
athe first variable
bthe second variable
+
+
+ +

Definition at line 24 of file log_sum_exp.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + + + + +
T stan::math::log_sum_exp (const Eigen::Matrix< T, R, C > & x)
+
+ +

Return the log of the sum of the exponentiated values of the specified matrix of values.

+

The matrix may be a full matrix, a vector, or a row vector.

+

The function is defined as follows to prevent overflow in exponential calculations.

+

$\log \sum_{n=1}^N \exp(x_n) = \max(x) + \log \sum_{n=1}^N \exp(x_n - \max(x))$.

+
Parameters
+ + +
[in]xMatrix of specified values
+
+
+
Returns
The log of the sum of the exponentiated vector values.
+ +

Definition at line 29 of file log_sum_exp.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + +
T stan::math::log_sum_exp (const std::vector< T > & x)
+
+ +

Return the log of the sum of the exponentiated values of the specified sequence of values.

+

The function is defined as follows to prevent overflow in exponential calculations.

+

$\log \sum_{n=1}^N \exp(x_n) = \max(x) + \log \sum_{n=1}^N \exp(x_n - \max(x))$.

+
Parameters
+ + +
[in]xarray of specified values
+
+
+
Returns
The log of the sum of the exponentiated vector values.
+ +

Definition at line 44 of file log_sum_exp.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
int stan::math::logical_and (const T1 x1,
const T2 x2 
)
+
+inline
+
+ +

The logical and function which returns 1 if both arguments are unequal to zero and 0 otherwise.

+

Equivalent to x1 != 0 && x2 != 0.

+
Template Parameters
+ + + +
T1Type of first argument.
T2Type of second argument.
+
+
+
Parameters
+ + + +
x1First argument
x2Second argument
+
+
+
Returns
true if both x1 and x2 are not equal to 0.
+ +

Definition at line 21 of file logical_and.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
int stan::math::logical_eq (const T1 x1,
const T2 x2 
)
+
+inline
+
+ +

Return 1 if the first argument is equal to the second.

+

Equivalent to x1 == x2.

+
Template Parameters
+ + + +
T1Type of first argument.
T2Type of second argument.
+
+
+
Parameters
+ + + +
x1First argument
x2Second argument
+
+
+
Returns
true iff x1 == x2
+ +

Definition at line 19 of file logical_eq.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
int stan::math::logical_gt (const T1 x1,
const T2 x2 
)
+
+inline
+
+ +

Return 1 if the first argument is strictly greater than the second.

+

Equivalent to x1 < x2.

+
Template Parameters
+ + + +
T1Type of first argument.
T2Type of second argument.
+
+
+
Parameters
+ + + +
x1First argument
x2Second argument
+
+
+
Returns
true iff x1 > x2
+ +

Definition at line 19 of file logical_gt.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
int stan::math::logical_gte (const T1 x1,
const T2 x2 
)
+
+inline
+
+ +

Return 1 if the first argument is greater than or equal to the second.

+

Equivalent to x1 >= x2.

+
Template Parameters
+ + + +
T1Type of first argument.
T2Type of second argument.
+
+
+
Parameters
+ + + +
x1First argument
x2Second argument
+
+
+
Returns
true iff x1 >= x2
+ +

Definition at line 19 of file logical_gte.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
int stan::math::logical_lt (T1 x1,
T2 x2 
)
+
+inline
+
+ +

Return 1 if the first argument is strictly less than the second.

+

Equivalent to x1 < x2.

+
Template Parameters
+ + + +
T1Type of first argument.
T2Type of second argument.
+
+
+
Parameters
+ + + +
x1First argument
x2Second argument
+
+
+
Returns
true iff x1 < x2
+ +

Definition at line 20 of file logical_lt.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
int stan::math::logical_lte (const T1 x1,
const T2 x2 
)
+
+inline
+
+ +

Return 1 if the first argument is less than or equal to the second.

+

Equivalent to x1 <= x2.

+
Template Parameters
+ + + +
T1Type of first argument.
T2Type of second argument.
+
+
+
Parameters
+ + + +
x1First argument
x2Second argument
+
+
+
Returns
true iff x1 <= x2
+ +

Definition at line 19 of file logical_lte.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
int stan::math::logical_negation (const T x)
+
+inline
+
+ +

The logical negation function which returns 1 if the input is equal to zero and 0 otherwise.

+
Template Parameters
+ + +
TType to compare to zero.
+
+
+
Parameters
+ + +
xValue to compare to zero.
+
+
+
Returns
1 if input is equal to zero.
+ +

Definition at line 17 of file logical_negation.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
int stan::math::logical_neq (const T1 x1,
const T2 x2 
)
+
+inline
+
+ +

Return 1 if the first argument is unequal to the second.

+

Equivalent to x1 != x2.

+
Template Parameters
+ + + +
T1Type of first argument.
T2Type of second argument.
+
+
+
Parameters
+ + + +
x1First argument
x2Second argument
+
+
+
Returns
true iff x1 != x2
+ +

Definition at line 19 of file logical_neq.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
int stan::math::logical_or (T1 x1,
T2 x2 
)
+
+inline
+
+ +

The logical or function which returns 1 if either argument is unequal to zero and 0 otherwise.

+

Equivalent to x1 != 0 || x2 != 0.

+
Template Parameters
+ + + +
T1Type of first argument.
T2Type of second argument.
+
+
+
Parameters
+ + + +
x1First argument
x2Second argument
+
+
+
Returns
true if either x1 or x2 is not equal to 0.
+ +

Definition at line 20 of file logical_or.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
boost::math::tools::promote_args<T>::type stan::math::logit (const T a)
+
+inline
+
+ +

Returns the logit function applied to the argument.

+

The logit function is defined as for $x \in [0,1]$ by returning the log odds of $x$ treated as a probability,

+

$\mbox{logit}(x) = \log \left( \frac{x}{1 - x} \right)$.

+

The inverse to this function is stan::math::inv_logit.

+
Parameters
+ + +
aArgument.
+
+
+
Returns
Logit of the argument.
+ +

Definition at line 25 of file logit.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
double stan::math::machine_precision ()
+
+inline
+
+ +

Returns the difference between 1.0 and the next value representable.

+
Returns
Minimum positive number.
+ +

Definition at line 142 of file constants.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
double stan::math::max (const double a,
const double b 
)
+
+inline
+
+ +

Definition at line 7 of file max.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
int stan::math::max (const std::vector< int > & x)
+
+inline
+
+ +

Returns the maximum coefficient in the specified column vector.

+
Parameters
+ + +
xSpecified vector.
+
+
+
Returns
Maximum coefficient value in the vector.
+
Template Parameters
+ + +
Typeof values being compared and returned
+
+
+
Exceptions
+ + +
std::domain_errorIf the size of the vector is zero.
+
+
+ +

Definition at line 19 of file max.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
T stan::math::max (const std::vector< T > & x)
+
+inline
+
+ +

Returns the maximum coefficient in the specified column vector.

+
Parameters
+ + +
xSpecified vector.
+
+
+
Returns
Maximum coefficient value in the vector.
+
Template Parameters
+ + +
TType of values being compared and returned
+
+
+ +

Definition at line 37 of file max.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + +
T stan::math::max (const Eigen::Matrix< T, R, C > & m)
+
+inline
+
+ +

Returns the maximum coefficient in the specified vector, row vector, or matrix.

+
Parameters
+ + +
mSpecified vector, row vector, or matrix.
+
+
+
Returns
Maximum coefficient value in the vector.
+ +

Definition at line 54 of file max.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type,R1,C2> stan::math::mdivide_left (const Eigen::Matrix< T1, R1, C1 > & A,
const Eigen::Matrix< T2, R2, C2 > & b 
)
+
+inline
+
+ +

Returns the solution of the system Ax=b.

+
Parameters
+ + + +
AMatrix.
bRight hand side matrix or vector.
+
+
+
Returns
x = A^-1 b, solution of the linear system.
+
Exceptions
+ + +
std::domain_errorif A is not square or the rows of b don't match the size of A.
+
+
+ +

Definition at line 24 of file mdivide_left.hpp.

+ +
+
+ +
+
+
+template<int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<double,R1,C2> stan::math::mdivide_left_ldlt (const stan::math::LDLT_factor< double, R1, C1 > & A,
const Eigen::Matrix< double, R2, C2 > & b 
)
+
+inline
+
+ +

Definition at line 72 of file ldlt.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type,R1,C2> stan::math::mdivide_left_spd (const Eigen::Matrix< T1, R1, C1 > & A,
const Eigen::Matrix< T2, R2, C2 > & b 
)
+
+inline
+
+ +

Returns the solution of the system Ax=b where A is symmetric positive definite.

+
Parameters
+ + + +
AMatrix.
bRight hand side matrix or vector.
+
+
+
Returns
x = A^-1 b, solution of the linear system.
+
Exceptions
+ + +
std::domain_errorif A is not square or the rows of b don't match the size of A.
+
+
+ +

Definition at line 25 of file mdivide_left_spd.hpp.

+ +
+
+ +
+
+
+template<int TriView, typename T1 , typename T2 , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type, R1,C2> stan::math::mdivide_left_tri (const Eigen::Matrix< T1, R1, C1 > & A,
const Eigen::Matrix< T2, R2, C2 > & b 
)
+
+inline
+
+ +

Returns the solution of the system Ax=b when A is triangular.

+
Parameters
+ + + +
ATriangular matrix. Specify upper or lower with TriView being Eigen::Upper or Eigen::Lower.
bRight hand side matrix or vector.
+
+
+
Returns
x = A^-1 b, solution of the linear system.
+
Exceptions
+ + +
std::domain_errorif A is not square or the rows of b don't match the size of A.
+
+
+ +

Definition at line 27 of file mdivide_left_tri.hpp.

+ +
+
+ +
+
+
+template<int TriView, typename T , int R1, int C1>
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<T,R1,C1> stan::math::mdivide_left_tri (const Eigen::Matrix< T, R1, C1 > & A)
+
+inline
+
+ +

Returns the solution of the system Ax=b when A is triangular and b=I.

+
Parameters
+ + +
ATriangular matrix. Specify upper or lower with TriView being Eigen::Upper or Eigen::Lower.
+
+
+
Returns
x = A^-1 .
+
Exceptions
+ + +
std::domain_errorif A is not square
+
+
+ +

Definition at line 47 of file mdivide_left_tri.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type, R1,C2> stan::math::mdivide_left_tri_low (const Eigen::Matrix< T1, R1, C1 > & A,
const Eigen::Matrix< T2, R2, C2 > & b 
)
+
+inline
+
+ +

Definition at line 15 of file mdivide_left_tri_low.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int C1>
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<T,R1,C1> stan::math::mdivide_left_tri_low (const Eigen::Matrix< T, R1, C1 > & A)
+
+inline
+
+ +

Definition at line 29 of file mdivide_left_tri_low.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type,R1,C2> stan::math::mdivide_right (const Eigen::Matrix< T1, R1, C1 > & b,
const Eigen::Matrix< T2, R2, C2 > & A 
)
+
+inline
+
+ +

Returns the solution of the system Ax=b.

+
Parameters
+ + + +
AMatrix.
bRight hand side matrix or vector.
+
+
+
Returns
x = b A^-1, solution of the linear system.
+
Exceptions
+ + +
std::domain_errorif A is not square or the rows of b don't match the size of A.
+
+
+ +

Definition at line 25 of file mdivide_right.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type,R1,C2> stan::math::mdivide_right_ldlt (const Eigen::Matrix< T1, R1, C1 > & b,
const stan::math::LDLT_factor< T2, R2, C2 > & A 
)
+
+inline
+
+ +

Definition at line 82 of file ldlt.hpp.

+ +
+
+ +
+
+
+template<int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<double,R1,C2> stan::math::mdivide_right_ldlt (const Eigen::Matrix< double, R1, C1 > & b,
const stan::math::LDLT_factor< double, R2, C2 > & A 
)
+
+inline
+
+ +

Definition at line 91 of file ldlt.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type,R1,C2> stan::math::mdivide_right_spd (const Eigen::Matrix< T1, R1, C1 > & b,
const Eigen::Matrix< T2, R2, C2 > & A 
)
+
+inline
+
+ +

Returns the solution of the system Ax=b where A is symmetric positive definite.

+
Parameters
+ + + +
AMatrix.
bRight hand side matrix or vector.
+
+
+
Returns
x = b A^-1, solution of the linear system.
+
Exceptions
+ + +
std::domain_errorif A is not square or the rows of b don't match the size of A.
+
+
+ +

Definition at line 26 of file mdivide_right_spd.hpp.

+ +
+
+ +
+
+
+template<int TriView, typename T1 , typename T2 , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type,R1,C2> stan::math::mdivide_right_tri (const Eigen::Matrix< T1, R1, C1 > & b,
const Eigen::Matrix< T2, R2, C2 > & A 
)
+
+inline
+
+ +

Returns the solution of the system Ax=b when A is triangular.

+
Parameters
+ + + +
ATriangular matrix. Specify upper or lower with TriView being Eigen::Upper or Eigen::Lower.
bRight hand side matrix or vector.
+
+
+
Returns
x = b A^-1, solution of the linear system.
+
Exceptions
+ + +
std::domain_errorif A is not square or the rows of b don't match the size of A.
+
+
+ +

Definition at line 28 of file mdivide_right_tri.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type,R1,C2> stan::math::mdivide_right_tri_low (const Eigen::Matrix< T1, R1, C1 > & b,
const Eigen::Matrix< T2, R2, C2 > & A 
)
+
+inline
+
+ +

Returns the solution of the system tri(A)x=b when tri(A) is a lower triangular view of the matrix A.

+
Parameters
+ + + +
AMatrix.
bRight hand side matrix or vector.
+
+
+
Returns
x = b * tri(A)^-1, solution of the linear system.
+
Exceptions
+ + +
std::domain_errorif A is not square or the rows of b don't match the size of A.
+
+
+ +

Definition at line 24 of file mdivide_right_tri_low.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
boost::math::tools::promote_args<T>::type stan::math::mean (const std::vector< T > & v)
+
+inline
+
+ +

Returns the sample mean (i.e., average) of the coefficients in the specified standard vector.

+
Parameters
+ + +
vSpecified vector.
+
+
+
Returns
Sample mean of vector coefficients.
+
Exceptions
+ + +
std::domain_errorif the size of the vector is less than 1.
+
+
+ +

Definition at line 23 of file mean.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + +
boost::math::tools::promote_args<T>::type stan::math::mean (const Eigen::Matrix< T, R, C > & m)
+
+inline
+
+ +

Returns the sample mean (i.e., average) of the coefficients in the specified vector, row vector, or matrix.

+
Parameters
+ + +
mSpecified vector, row vector, or matrix.
+
+
+
Returns
Sample mean of vector coefficients.
+ +

Definition at line 40 of file mean.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
double stan::math::min (const double a,
const double b 
)
+
+inline
+
+ +

Definition at line 7 of file min.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
int stan::math::min (const std::vector< int > & x)
+
+inline
+
+ +

Returns the minimum coefficient in the specified column vector.

+
Parameters
+ + +
xSpecified vector.
+
+
+
Returns
Minimum coefficient value in the vector.
+
Template Parameters
+ + +
Typeof values being compared and returned
+
+
+ +

Definition at line 18 of file min.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
T stan::math::min (const std::vector< T > & x)
+
+inline
+
+ +

Returns the minimum coefficient in the specified column vector.

+
Parameters
+ + +
xSpecified vector.
+
+
+
Returns
Minimum coefficient value in the vector.
+
Template Parameters
+ + +
Typeof values being compared and returned
+
+
+ +

Definition at line 36 of file min.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + +
T stan::math::min (const Eigen::Matrix< T, R, C > & m)
+
+inline
+
+ +

Returns the minimum coefficient in the specified matrix, vector, or row vector.

+
Parameters
+ + +
mSpecified matrix, vector, or row vector.
+
+
+
Returns
Minimum coefficient value in the vector.
+ +

Definition at line 53 of file min.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
T stan::math::minus (const T & x)
+
+inline
+
+ +

Returns the negation of the specified scalar or matrix.

+
Template Parameters
+ + +
TType of subtrahend.
+
+
+
Parameters
+ + +
xSubtrahend.
+
+
+
Returns
Negation of subtrahend.
+ +

Definition at line 16 of file minus.hpp.

+ +
+
+ +
+
+
+template<typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
T2 stan::math::modified_bessel_first_kind (const int v,
const T2 z 
)
+
+inline
+
+ +

Definition at line 11 of file modified_bessel_first_kind.hpp.

+ +
+
+ +
+
+
+template<typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
T2 stan::math::modified_bessel_second_kind (const int v,
const T2 z 
)
+
+inline
+
+ +

Definition at line 11 of file modified_bessel_second_kind.hpp.

+ +
+
+ +
+
+
+template<int R, int C, typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::enable_if_c<boost::is_arithmetic<T>::value, Eigen::Matrix<double, R, C> >::type stan::math::multiply (const Eigen::Matrix< double, R, C > & m,
c 
)
+
+inline
+
+ +

Return specified matrix multiplied by specified scalar.

+
Template Parameters
+ + + +
RRow type for matrix.
CColumn type for matrix.
+
+
+
Parameters
+ + + +
mMatrix.
cScalar.
+
+
+
Returns
Product of matrix and scalar.
+ +

Definition at line 25 of file multiply.hpp.

+ +
+
+ +
+
+
+template<int R, int C, typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::enable_if_c<boost::is_arithmetic<T>::value, Eigen::Matrix<double, R, C> >::type stan::math::multiply (c,
const Eigen::Matrix< double, R, C > & m 
)
+
+inline
+
+ +

Return specified scalar multiplied by specified matrix.

+
Template Parameters
+ + + +
RRow type for matrix.
CColumn type for matrix.
+
+
+
Parameters
+ + + +
cScalar.
mMatrix.
+
+
+
Returns
Product of scalar and matrix.
+ +

Definition at line 45 of file multiply.hpp.

+ +
+
+ +
+
+
+template<int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<double,R1,C2> stan::math::multiply (const Eigen::Matrix< double, R1, C1 > & m1,
const Eigen::Matrix< double, R2, C2 > & m2 
)
+
+inline
+
+ +

Return the product of the specified matrices.

+

The number of columns in the first matrix must be the same as the number of rows in the second matrix.

+
Parameters
+ + + +
m1First matrix.
m2Second matrix.
+
+
+
Returns
The product of the first and second matrices.
+
Exceptions
+ + +
std::domain_errorif the number of columns of m1 does not match the number of rows of m2.
+
+
+ +

Definition at line 61 of file multiply.hpp.

+ +
+
+ +
+
+
+template<int C1, int R2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
double stan::math::multiply (const Eigen::Matrix< double, 1, C1 > & rv,
const Eigen::Matrix< double, R2, 1 > & v 
)
+
+inline
+
+ +

Return the scalar product of the specified row vector and specified column vector.

+

The return is the same as the dot product. The two vectors must be the same size.

+
Parameters
+ + + +
rvRow vector.
vColumn vector.
+
+
+
Returns
Scalar result of multiplying row vector by column vector.
+
Exceptions
+ + +
std::domain_errorif rv and v are not the same size.
+
+
+ +

Definition at line 78 of file multiply.hpp.

+ +
+
+ +
+
+
+template<typename T_a , typename T_b >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_a,T_b>::type stan::math::multiply_log (const T_a a,
const T_b b 
)
+
+inline
+
+ +

Calculated the value of the first argument times log of the second argument while behaving properly with 0 inputs.

+

$ a * \log b $.

+
Parameters
+ + + +
athe first variable
bthe second variable
+
+
+
Returns
a * log(b)
+ +

Definition at line 23 of file multiply_log.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
matrix_d stan::math::multiply_lower_tri_self_transpose (const matrix_d & L)
+
+inline
+
+ +

Returns the result of multiplying the lower triangular portion of the input matrix by its own transpose.

+
Parameters
+ + +
LMatrix to multiply.
+
+
+
Returns
The lower triangular values in L times their own transpose.
+
Exceptions
+ + +
std::domain_errorIf the input matrix is not square.
+
+
+ +

Definition at line 18 of file multiply_lower_tri_self_transpose.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
double stan::math::negative_infinity ()
+
+inline
+
+ +

Return negative infinity.

+
Returns
Negative infinity.
+ +

Definition at line 123 of file constants.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
double stan::math::not_a_number ()
+
+inline
+
+ +

Return (quiet) not-a-number.

+
Returns
Quiet not-a-number.
+ +

Definition at line 132 of file constants.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T1,T2>::type stan::math::owens_t (const T1 & h,
const T2 & a 
)
+
+inline
+
+ +

The Owen's T function of h and a.

+

Used to compute the cumulative density function for the skew normal distribution.

+
Template Parameters
+ + + +
T1Type of first argument.
T2Type of second argument.
+
+
+
Parameters
+ + + +
hFirst argument
aSecond argument
+
+
+
Returns
The Owen's T function.
+ +

Definition at line 25 of file owens_t.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
boost::math::tools::promote_args<T>::type stan::math::Phi (const T x)
+
+inline
+
+ +

The unit normal cumulative distribution function.

+

The return value for a specified input is the probability that a random unit normal variate is less than or equal to the specified value, defined by

+

$\Phi(x) = \int_{-\infty}^x \mbox{\sf Norm}(x|0,1) \ dx$

+

This function can be used to implement the inverse link function for probit regression.

+

Phi will underflow to 0 below -37.5 and overflow to 1 above 8

+
Parameters
+ + +
xArgument.
+
+
+
Returns
Probability random sample is less than or equal to argument.
+ +

Definition at line 30 of file Phi.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
boost::math::tools::promote_args<T>::type stan::math::Phi_approx (x)
+
+inline
+
+ +

Approximation of the unit normal CDF.

+

http://www.jiem.org/index.php/jiem/article/download/60/27

+

This function can be used to implement the inverse link function for probit regression.

+
Parameters
+ + +
xArgument.
+
+
+
Returns
Probability random sample is less than or equal to argument.
+ +

Definition at line 23 of file Phi_approx.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
double stan::math::pi ()
+
+inline
+
+ +

Return the value of pi.

+
Returns
Pi.
+ +

Definition at line 77 of file constants.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
double stan::math::positive_infinity ()
+
+inline
+
+ +

Return positive infinity.

+
Returns
Positive infinity.
+ +

Definition at line 114 of file constants.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
T stan::math::prod (const std::vector< T > & v)
+
+inline
+
+ +

Returns the product of the coefficients of the specified standard vector.

+
Parameters
+ + +
vSpecified vector.
+
+
+
Returns
Product of coefficients of vector.
+ +

Definition at line 17 of file prod.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + +
T stan::math::prod (const Eigen::Matrix< T, R, C > & v)
+
+inline
+
+ +

Returns the product of the coefficients of the specified column vector.

+
Parameters
+ + +
vSpecified vector.
+
+
+
Returns
Product of coefficients of vector.
+ +

Definition at line 32 of file prod.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , typename F >
+ + + + + +
+ + + + + + + + +
common_type<T1,T2>::type stan::math::promote_common (const F & u)
+
+inline
+
+ +

Definition at line 14 of file promote_common.hpp.

+ +
+
+ +
+
+
+template<int RA, int CA, int RB, int CB>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<double,CB,CB> stan::math::quad_form (const Eigen::Matrix< double, RA, CA > & A,
const Eigen::Matrix< double, RB, CB > & B 
)
+
+inline
+
+ +

Compute B^T A B.

+ +

Definition at line 18 of file quad_form.hpp.

+ +
+
+ +
+
+
+template<int RA, int CA, int RB>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
double stan::math::quad_form (const Eigen::Matrix< double, RA, CA > & A,
const Eigen::Matrix< double, RB, 1 > & B 
)
+
+inline
+
+ +

Definition at line 28 of file quad_form.hpp.

+ +
+
+ +
+
+
+template<int RA, int CA, int RB, int CB>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<double,CB,CB> stan::math::quad_form_sym (const Eigen::Matrix< double, RA, CA > & A,
const Eigen::Matrix< double, RB, CB > & B 
)
+
+inline
+
+ +

Definition at line 38 of file quad_form.hpp.

+ +
+
+ +
+
+
+template<int RA, int CA, int RB>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
double stan::math::quad_form_sym (const Eigen::Matrix< double, RA, CA > & A,
const Eigen::Matrix< double, RB, 1 > & B 
)
+
+inline
+
+ +

Definition at line 50 of file quad_form.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
size_t stan::math::rank (const std::vector< T > & v,
int s 
)
+
+inline
+
+ +

Return the number of components of v less than v[s].

+
Returns
Number of components of v less than v[s].
+
Template Parameters
+ + +
TType of elements of the vector.
+
+
+ +

Definition at line 18 of file rank.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
size_t stan::math::rank (const Eigen::Matrix< T, R, C > & v,
int s 
)
+
+inline
+
+ +

Return the number of components of v less than v[s].

+
Returns
Number of components of v less than v[s].
+
Template Parameters
+ + +
TType of elements of the vector.
+
+
+ +

Definition at line 36 of file rank.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
std::vector<T> stan::math::rep_array (const T & x,
int n 
)
+
+inline
+
+ +

Definition at line 14 of file rep_array.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
std::vector<std::vector<T> > stan::math::rep_array (const T & x,
int m,
int n 
)
+
+inline
+
+ +

Definition at line 21 of file rep_array.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
std::vector<std::vector<std::vector<T> > > stan::math::rep_array (const T & x,
int k,
int m,
int n 
)
+
+inline
+
+ +

Definition at line 30 of file rep_array.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
Eigen::Matrix<typename boost::math::tools::promote_args<T>::type, Eigen::Dynamic,Eigen::Dynamic> stan::math::rep_matrix (const T & x,
int m,
int n 
)
+
+inline
+
+ +

Definition at line 16 of file rep_matrix.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> stan::math::rep_matrix (const Eigen::Matrix< T, Eigen::Dynamic, 1 > & v,
int n 
)
+
+inline
+
+ +

Definition at line 25 of file rep_matrix.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> stan::math::rep_matrix (const Eigen::Matrix< T, 1, Eigen::Dynamic > & rv,
int m 
)
+
+inline
+
+ +

Definition at line 34 of file rep_matrix.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<typename boost::math::tools::promote_args<T>::type, 1,Eigen::Dynamic> stan::math::rep_row_vector (const T & x,
int m 
)
+
+inline
+
+ +

Definition at line 15 of file rep_row_vector.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<typename boost::math::tools::promote_args<T>::type, Eigen::Dynamic,1> stan::math::rep_vector (const T & x,
int n 
)
+
+inline
+
+ +

Definition at line 16 of file rep_vector.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::math::resize (T & x,
std::vector< size_t > dims 
)
+
+inline
+
+ +

Recursively resize the specified vector of vectors, which must bottom out at scalar values, Eigen vectors or Eigen matrices.

+
Parameters
+ + + +
xArray-like object to resize.
dimsNew dimensions.
+
+
+
Template Parameters
+ + +
TType of object being resized.
+
+
+ +

Definition at line 63 of file resize.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T1,T2>::type stan::math::rising_factorial (const T1 x,
const T2 n 
)
+
+inline
+
+ +

Definition at line 11 of file rising_factorial.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,1,Eigen::Dynamic> stan::math::row (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & m,
size_t i 
)
+
+inline
+
+ +

Return the specified row of the specified matrix, using start-at-1 indexing.

+

This is equivalent to calling m.row(i - 1) and assigning the resulting template expression to a row vector.

+
Template Parameters
+ + +
TScalar value type for matrix.
+
+
+
Parameters
+ + + +
mMatrix.
iRow index (count from 1).
+
+
+
Returns
Specified row of the matrix.
+ +

Definition at line 25 of file row.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + +
size_t stan::math::rows (const Eigen::Matrix< T, R, C > & m)
+
+inline
+
+ +

Definition at line 12 of file rows.hpp.

+ +
+
+ +
+
+
+template<int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<double, R1, 1> stan::math::rows_dot_product (const Eigen::Matrix< double, R1, C1 > & v1,
const Eigen::Matrix< double, R2, C2 > & v2 
)
+
+inline
+
+ +

Returns the dot product of the specified vectors.

+
Parameters
+ + + +
v1First vector.
v2Second vector.
+
+
+
Returns
Dot product of the vectors.
+
Exceptions
+ + +
std::domain_errorIf the vectors are not the same size or if they are both not vector dimensioned.
+
+
+ +

Definition at line 22 of file rows_dot_product.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<T,R,1> stan::math::rows_dot_self (const Eigen::Matrix< T, R, C > & x)
+
+inline
+
+ +

Returns the dot product of each row of a matrix with itself.

+
Parameters
+ + +
xMatrix.
+
+
+
Template Parameters
+ + +
Tscalar type
+
+
+ +

Definition at line 16 of file rows_dot_self.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::math::scaled_add (std::vector< double > & x,
const std::vector< double > & y,
const double lambda 
)
+
+inline
+
+ +

Definition at line 11 of file scaled_add.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
boost::math::tools::promote_args<T>::type stan::math::sd (const std::vector< T > & v)
+
+inline
+
+ +

Returns the unbiased sample standard deviation of the coefficients in the specified column vector.

+
Parameters
+ + +
vSpecified vector.
+
+
+
Returns
Sample variance of vector.
+ +

Definition at line 22 of file sd.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + +
boost::math::tools::promote_args<T>::type stan::math::sd (const Eigen::Matrix< T, R, C > & m)
+
+inline
+
+ +

Returns the unbiased sample standard deviation of the coefficients in the specified vector, row vector, or matrix.

+
Parameters
+ + +
mSpecified vector, row vector or matrix.
+
+
+
Returns
Sample variance.
+ +

Definition at line 37 of file sd.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,1> stan::math::segment (const Eigen::Matrix< T, Eigen::Dynamic, 1 > & v,
size_t i,
size_t n 
)
+
+inline
+
+ +

Return the specified number of elements as a vector starting from the specified element - 1 of the specified vector.

+ +

Definition at line 20 of file segment.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,1,Eigen::Dynamic> stan::math::segment (const Eigen::Matrix< T, 1, Eigen::Dynamic > & v,
size_t i,
size_t n 
)
+
+inline
+
+ +

Definition at line 30 of file segment.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + + + + + + + +
std::vector<T> stan::math::segment (const std::vector< T > & sv,
size_t i,
size_t n 
)
+
+ +

Definition at line 40 of file segment.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,1> stan::math::singular_values (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & m)
+
+ +

Return the vector of the singular values of the specified matrix in decreasing order of magnitude.

+

See the documentation for svd() for information on the signular values.

+
Parameters
+ + +
mSpecified matrix.
+
+
+
Returns
Singular values of the matrix.
+ +

Definition at line 19 of file singular_values.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
int stan::math::size (const std::vector< T > & x)
+
+inline
+
+ +

Definition at line 11 of file size.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,1> stan::math::softmax (const Eigen::Matrix< T, Eigen::Dynamic, 1 > & v)
+
+inline
+
+ +

Return the softmax of the specified vector.

+
Template Parameters
+ + +
TScalar type of values in vector.
+
+
+
Parameters
+ + +
[in]vVector to transform.
+
+
+
Returns
Unit simplex result of the softmax transform of the vector.
+ +

Definition at line 20 of file softmax.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
std::vector<T> stan::math::sort_asc (std::vector< T > xs)
+
+inline
+
+ +

Return the specified standard vector in ascending order.

+
Parameters
+ + +
xsStandard vector to order.
+
+
+
Returns
Standard vector ordered.
+
Template Parameters
+ + +
TType of elements of the vector.
+
+
+ +

Definition at line 20 of file sort.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<T,R,C> stan::math::sort_asc (Eigen::Matrix< T, R, C > xs)
+
+inline
+
+ +

Return the specified eigen vector in ascending order.

+
Parameters
+ + +
xsEigen vector to order.
+
+
+
Returns
Eigen vector ordered.
+
Template Parameters
+ + +
TType of elements of the vector.
+
+
+ +

Definition at line 46 of file sort.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
std::vector<T> stan::math::sort_desc (std::vector< T > xs)
+
+inline
+
+ +

Return the specified standard vector in descending order.

+
Parameters
+ + +
xsStandard vector to order.
+
+
+
Returns
Standard vector ordered.
+
Template Parameters
+ + +
TType of elements of the vector.
+
+
+ +

Definition at line 33 of file sort.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<T,R,C> stan::math::sort_desc (Eigen::Matrix< T, R, C > xs)
+
+inline
+
+ +

Return the specified eigen vector in descending order.

+
Parameters
+ + +
xsEigen vector to order.
+
+
+
Returns
Eigen vector ordered.
+
Template Parameters
+ + +
TType of elements of the vector.
+
+
+ +

Definition at line 59 of file sort.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
double stan::math::sqrt2 ()
+
+inline
+
+ +

Return the square root of two.

+
Returns
Square root of two.
+ +

Definition at line 95 of file constants.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
T stan::math::square (const T x)
+
+inline
+
+ +

Return the square of the specified argument.

+

$\mbox{square}(x) = x^2$.

+

The implementation of square(x) is just x * x. Given this, this method is mainly useful in cases where x is not a simple primitive type, particularly when it is an auto-dif type.

+
Parameters
+ + +
xInput to square.
+
+
+
Returns
Square of input.
+
Template Parameters
+ + +
TType of scalar.
+
+
+ +

Definition at line 22 of file square.hpp.

+ +
+
+ +
+
+
+template<int R1, int C1, int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
double stan::math::squared_dist (const Eigen::Matrix< double, R1, C1 > & v1,
const Eigen::Matrix< double, R2, C2 > & v2 
)
+
+inline
+
+ +

Returns the squared distance between the specified vectors.

+
Parameters
+ + + +
v1First vector.
v2Second vector.
+
+
+
Returns
Dot product of the vectors.
+
Exceptions
+ + +
std::domain_errorIf the vectors are not the same size or if they are both not vector dimensioned.
+
+
+ +

Definition at line 21 of file squared_dist.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
void stan::math::stan_print (std::ostream * o,
const T & x 
)
+
+ +

Definition at line 12 of file stan_print.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
void stan::math::stan_print (std::ostream * o,
const std::vector< T > & x 
)
+
+ +

Definition at line 17 of file stan_print.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
void stan::math::stan_print (std::ostream * o,
const Eigen::Matrix< T, Eigen::Dynamic, 1 > & x 
)
+
+ +

Definition at line 27 of file stan_print.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
void stan::math::stan_print (std::ostream * o,
const Eigen::Matrix< T, 1, Eigen::Dynamic > & x 
)
+
+ +

Definition at line 37 of file stan_print.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
void stan::math::stan_print (std::ostream * o,
const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & x 
)
+
+ +

Definition at line 47 of file stan_print.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
int stan::math::step (const T y)
+
+inline
+
+ +

The step, or Heaviside, function.

+

The function is defined by

+

step(y) = (y < 0.0) ? 0 : 1.

+
Parameters
+ + +
yScalar argument.
+
+
+
Returns
1 if the specified argument is greater than or equal to 0.0, and 0 otherwise.
+ +

Definition at line 20 of file step.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::math::sub (std::vector< double > & x,
std::vector< double > & y,
std::vector< double > & result 
)
+
+inline
+
+ +

Definition at line 10 of file sub.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,1> stan::math::sub_col (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & m,
size_t i,
size_t j,
size_t nrows 
)
+
+inline
+
+ +

Return a nrows x 1 subcolumn starting at (i-1,j-1).

+
Parameters
+ + + + + +
mMatrix
iStarting row + 1
jStarting column + 1
nrowsNumber of rows in block
+
+
+ +

Definition at line 22 of file sub_col.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,1,Eigen::Dynamic> stan::math::sub_row (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & m,
size_t i,
size_t j,
size_t ncols 
)
+
+inline
+
+ +

Return a 1 x nrows subrow starting at (i-1,j-1).

+
Parameters
+ + + + + +
mMatrix
iStarting row + 1
jStarting column + 1
ncolsNumber of columns in block
+
+
+ +

Definition at line 23 of file sub_row.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , int R, int C>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type, R, C> stan::math::subtract (const Eigen::Matrix< T1, R, C > & m1,
const Eigen::Matrix< T2, R, C > & m2 
)
+
+inline
+
+ +

Return the result of subtracting the second specified matrix from the first specified matrix.

+

The return scalar type is the promotion of the input types.

+
Template Parameters
+ + + + + +
T1Scalar type of first matrix.
T2Scalar type of second matrix.
RRow type of matrices.
CColumn type of matrices.
+
+
+
Parameters
+ + + +
m1First matrix.
m2Second matrix.
+
+
+
Returns
Difference between first matrix and second matrix.
+ +

Definition at line 27 of file subtract.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , int R, int C>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type, R, C> stan::math::subtract (const T1 & c,
const Eigen::Matrix< T2, R, C > & m 
)
+
+inline
+
+ +

Definition at line 40 of file subtract.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 , int R, int C>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type, R, C> stan::math::subtract (const Eigen::Matrix< T1, R, C > & m,
const T2 & c 
)
+
+inline
+
+ +

Definition at line 52 of file subtract.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
double stan::math::sum (std::vector< double > & x)
+
+inline
+
+ +

Definition at line 10 of file sum.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
T stan::math::sum (const std::vector< T > & xs)
+
+inline
+
+ +

Return the sum of the values in the specified standard vector.

+
Parameters
+ + +
xsStandard vector to sum.
+
+
+
Returns
Sum of elements.
+
Template Parameters
+ + +
TType of elements summed.
+
+
+ +

Definition at line 19 of file sum.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + +
double stan::math::sum (const Eigen::Matrix< T, R, C > & v)
+
+inline
+
+ +

Returns the sum of the coefficients of the specified column vector.

+
Parameters
+ + +
vSpecified vector.
+
+
+
Returns
Sum of coefficients of vector.
+ +

Definition at line 34 of file sum.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,1> stan::math::tail (const Eigen::Matrix< T, Eigen::Dynamic, 1 > & v,
size_t n 
)
+
+inline
+
+ +

Return the specified number of elements as a vector from the back of the specified vector.

+ +

Definition at line 20 of file tail.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,1,Eigen::Dynamic> stan::math::tail (const Eigen::Matrix< T, 1, Eigen::Dynamic > & rv,
size_t n 
)
+
+inline
+
+ +

Return the specified number of elements as a row vector from the back of the specified row vector.

+ +

Definition at line 35 of file tail.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
std::vector<T> stan::math::tail (const std::vector< T > & sv,
size_t n 
)
+
+ +

Definition at line 43 of file tail.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
matrix_d stan::math::tcrossprod (const matrix_d & M)
+
+inline
+
+ +

Returns the result of post-multiplying a matrix by its own transpose.

+
Parameters
+ + +
MMatrix to multiply.
+
+
+
Returns
M times its transpose.
+ +

Definition at line 17 of file tcrossprod.hpp.

+ +
+
+ +
+
+
+template<typename T , int R1, int R2>
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,1> stan::math::to_vector (const Eigen::Matrix< T, R1, R2 > & m)
+
+inline
+
+ +

Definition at line 12 of file to_vector.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
T stan::math::trace (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & m)
+
+inline
+
+ +

Returns the trace of the specified matrix.

+

The trace is defined as the sum of the elements on the diagonal. The matrix is not required to be square. Returns 0 if matrix is empty.

+
Parameters
+ + +
[in]mSpecified matrix.
+
+
+
Returns
Trace of the matrix.
+ +

Definition at line 19 of file trace.hpp.

+ +
+
+ +
+
+
+template<int RD, int CD, int RA, int CA, int RB, int CB>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
double stan::math::trace_gen_quad_form (const Eigen::Matrix< double, RD, CD > & D,
const Eigen::Matrix< double, RA, CA > & A,
const Eigen::Matrix< double, RB, CB > & B 
)
+
+inline
+
+ +

Compute trace(D B^T A B).

+ +

Definition at line 17 of file trace_gen_quad_form.hpp.

+ +
+
+ +
+
+
+template<int R1, int C1, int R2, int C2, int R3, int C3>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
double stan::math::trace_inv_quad_form_ldlt (const Eigen::Matrix< double, R1, C1 > & D,
const stan::math::LDLT_factor< double, R2, C2 > & A,
const Eigen::Matrix< double, R3, C3 > & B 
)
+
+inline
+
+ +

Definition at line 111 of file ldlt.hpp.

+ +
+
+ +
+
+
+template<int R2, int C2, int R3, int C3>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
double stan::math::trace_inv_quad_form_ldlt (const stan::math::LDLT_factor< double, R2, C2 > & A,
const Eigen::Matrix< double, R3, C3 > & B 
)
+
+inline
+
+ +

Definition at line 129 of file ldlt.hpp.

+ +
+
+ +
+
+
+template<int RA, int CA, int RB, int CB>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
double stan::math::trace_quad_form (const Eigen::Matrix< double, RA, CA > & A,
const Eigen::Matrix< double, RB, CB > & B 
)
+
+inline
+
+ +

Compute trace(B^T A B).

+ +

Definition at line 17 of file trace_quad_form.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + +
Eigen::Matrix<T,C,R> stan::math::transpose (const Eigen::Matrix< T, R, C > & m)
+
+inline
+
+ +

Definition at line 12 of file transpose.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
T stan::math::trigamma (x)
+
+inline
+
+ +

Definition at line 20 of file trigamma.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::math::validate_column_index (const Eigen::Matrix< T, R, C > & m,
size_t j,
const char * msg 
)
+
+ +

Definition at line 12 of file validate_column_index.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::math::validate_greater (const T1 & x,
const T2 & y,
const char * x_name,
const char * y_name,
const char * fun_name 
)
+
+inline
+
+ +

Definition at line 12 of file validate_greater.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::math::validate_greater_or_equal (const T1 & x,
const T2 & y,
const char * x_name,
const char * y_name,
const char * fun_name 
)
+
+inline
+
+ +

Definition at line 12 of file validate_greater_or_equal.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::math::validate_less (const T1 & x,
const T2 & y,
const char * x_name,
const char * y_name,
const char * fun_name 
)
+
+inline
+
+ +

Definition at line 12 of file validate_less.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::math::validate_less_or_equal (const T1 & x,
const T2 & y,
const char * x_name,
const char * y_name,
const char * fun_name 
)
+
+inline
+
+ +

Definition at line 12 of file validate_less_or_equal.hpp.

+ +
+
+ +
+
+
+template<typename T1 , int R1, int C1, typename T2 , int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::math::validate_matching_dims (const Eigen::Matrix< T1, R1, C1 > & x1,
const Eigen::Matrix< T2, R2, C2 > & x2,
const char * msg 
)
+
+inline
+
+ +

Definition at line 12 of file validate_matching_dims.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::math::validate_matching_sizes (const std::vector< T1 > & x1,
const std::vector< T2 > & x2,
const char * msg 
)
+
+inline
+
+ +

Definition at line 13 of file validate_matching_sizes.hpp.

+ +
+
+ +
+
+
+template<typename T1 , int R1, int C1, typename T2 , int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::math::validate_matching_sizes (const Eigen::Matrix< T1, R1, C1 > & x1,
const Eigen::Matrix< T2, R2, C2 > & x2,
const char * msg 
)
+
+inline
+
+ +

Definition at line 26 of file validate_matching_sizes.hpp.

+ +
+
+ +
+
+
+template<typename Derived , typename T2 , int R2, int C2>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::math::validate_matching_sizes (const Eigen::Block< Derived > & x1,
const Eigen::Matrix< T2, R2, C2 > & x2,
const char * msg 
)
+
+inline
+
+ +

Definition at line 41 of file validate_matching_sizes.hpp.

+ +
+
+ +
+
+
+template<typename T1 , int R1, int C1, typename Derived >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::math::validate_matching_sizes (const Eigen::Matrix< T1, R1, C1 > & x1,
const Eigen::Block< Derived > & x2,
const char * msg 
)
+
+inline
+
+ +

Definition at line 56 of file validate_matching_sizes.hpp.

+ +
+
+ +
+
+
+template<typename Derived1 , typename Derived2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::math::validate_matching_sizes (const Eigen::Block< Derived1 > & x1,
const Eigen::Block< Derived2 > & x2,
const char * msg 
)
+
+inline
+
+ +

Definition at line 71 of file validate_matching_sizes.hpp.

+ +
+
+ +
+
+
+template<typename T1 , typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::math::validate_multiplicable (const T1 & x1,
const T2 & x2,
const char * msg 
)
+
+inline
+
+ +

Definition at line 12 of file validate_multiplicable.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::math::validate_non_negative_index (const std::string & var_name,
const std::string & expr,
int val 
)
+
+inline
+
+ +

Definition at line 12 of file validate_non_negative_index.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::math::validate_non_negative_rep (int n,
const std::string & fun 
)
+
+inline
+
+ +

If argument is negative, throw a domain error indicating the function with the specified name.

+
Parameters
+ + + +
nInteger to test for non-negativity.
funName of function in which test is being done.
+
+
+
Exceptions
+ + +
std::domain_errorIf integer is negative.
+
+
+ +

Definition at line 20 of file validate_non_negative_rep.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::math::validate_nonzero_size (const T & x,
const char * msg 
)
+
+inline
+
+ +

Definition at line 11 of file validate_nonzero_size.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::math::validate_row_index (const Eigen::Matrix< T, R, C > & m,
size_t i,
const char * msg 
)
+
+ +

Definition at line 13 of file validate_row_index.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + + + + + + + + + + + + + + +
void stan::math::validate_square (const Eigen::Matrix< T, R, C > & x,
const char * msg 
)
+
+ +

Definition at line 12 of file validate_square.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::math::validate_std_vector_index (const std::vector< T > & sv,
size_t j,
const char * msg 
)
+
+ +

Definition at line 12 of file validate_std_vector_index.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + + + + + + + + + + + + + + +
void stan::math::validate_symmetric (const Eigen::Matrix< T, R, C > & x,
const char * msg 
)
+
+ +

Definition at line 13 of file validate_symmetric.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::math::validate_vector (const Eigen::Matrix< T, R, C > & x,
const char * msg 
)
+
+inline
+
+ +

Definition at line 12 of file validate_vector.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
double stan::math::value_of (const T x)
+
+inline
+
+ +

Return the value of the specified scalar argument converted to a double value.

+

This function is meant to cover the primitive types. For types requiring pass-by-reference, this template function should be specialized.

+
Template Parameters
+ + +
TType of scalar.
+
+
+
Parameters
+ + +
xScalar to convert to double.
+
+
+
Returns
Value of scalar cast to a double.
+ +

Definition at line 20 of file value_of.hpp.

+ +
+
+ +
+
+
+template<>
+ + + + + +
+ + + + + + + + +
double stan::math::value_of< double > (const double x)
+
+inline
+
+ +

Return the specified argument.

+

See value_of(T) for a polymorphic implementation using static casts.

+

This inline pass-through no-op should be compiled away.

+
Parameters
+ + +
xSpecified value.
+
+
+
Returns
Specified value.
+ +

Definition at line 36 of file value_of.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
boost::math::tools::promote_args<T>::type stan::math::variance (const std::vector< T > & v)
+
+inline
+
+ +

Returns the sample variance (divide by length - 1) of the coefficients in the specified standard vector.

+
Parameters
+ + +
vSpecified vector.
+
+
+
Returns
Sample variance of vector.
+
Exceptions
+ + +
std::domain_errorif the size of the vector is less than 1.
+
+
+ +

Definition at line 23 of file variance.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + +
boost::math::tools::promote_args<T>::type stan::math::variance (const Eigen::Matrix< T, R, C > & m)
+
+inline
+
+ +

Returns the sample variance (divide by length - 1) of the coefficients in the specified column vector.

+
Parameters
+ + +
mSpecified vector.
+
+
+
Returns
Sample variance of vector.
+ +

Definition at line 45 of file variance.hpp.

+ +
+
+

Variable Documentation

+ +
+
+ + + + +
const double stan::math::CONSTRAINT_TOLERANCE = 1E-8
+
+ +

The tolerance for checking arithmetic bounds In rank and in simplexes.

+

The default value is 1E-8.

+ +

Definition at line 11 of file constraint_tolerance.hpp.

+ +
+
+ +
+
+ + + + +
const double stan::math::E = boost::math::constants::e<double>()
+
+ +

The base of the natural logarithm, $ e $.

+ +

Definition at line 14 of file constants.hpp.

+ +
+
+ +
+
+ + + + +
const double stan::math::EPSILON = std::numeric_limits<double>::epsilon()
+
+ +

Smallest positive value.

+ +

Definition at line 58 of file constants.hpp.

+ +
+
+ +
+
+ + + + +
const double stan::math::INFTY = std::numeric_limits<double>::infinity()
+
+ +

Positive infinity.

+ +

Definition at line 43 of file constants.hpp.

+ +
+
+ +
+
+ + + + +
const double stan::math::INV_SQRT_2 = 1.0 / SQRT_2
+
+ +

The value of 1 over the square root of 2, $ 1 / \sqrt{2} $.

+ +

Definition at line 26 of file constants.hpp.

+ +
+
+ +
+
+ + + + +
const double stan::math::INV_SQRT_TWO_PI = 1.0 / std::sqrt(2.0 * boost::math::constants::pi<double>())
+
+ +

Definition at line 150 of file constants.hpp.

+ +
+
+ +
+
+ + + + +
const double stan::math::LOG_10 = std::log(10.0)
+
+ +

The natural logarithm of 10, $ \log 10 $.

+ +

Definition at line 38 of file constants.hpp.

+ +
+
+ +
+
+ + + + +
const double stan::math::LOG_2 = std::log(2.0)
+
+ +

The natural logarithm of 2, $ \log 2 $.

+ +

Definition at line 32 of file constants.hpp.

+ +
+
+ +
+
+ + + + +
const double stan::math::LOG_PI_OVER_FOUR = std::log(boost::math::constants::pi<double>()) / 4.0
+
+ +

Definition at line 70 of file constants.hpp.

+ +
+
+ +
+
+ + + + +
const double stan::math::NEG_TWO_OVER_SQRT_PI = -TWO_OVER_SQRT_PI
+
+ +

Definition at line 148 of file constants.hpp.

+ +
+
+ +
+
+ + + + +
const double stan::math::NEGATIVE_EPSILON = - std::numeric_limits<double>::epsilon()
+
+ +

Largest negative value (i.e., smallest absolute value).

+ +

Definition at line 63 of file constants.hpp.

+ +
+
+ +
+
+ + + + +
const double stan::math::NEGATIVE_INFTY = - std::numeric_limits<double>::infinity()
+
+ +

Negative infinity.

+ +

Definition at line 48 of file constants.hpp.

+ +
+
+ +
+
+ + + + +
const double stan::math::NOT_A_NUMBER = std::numeric_limits<double>::quiet_NaN()
+
+ +

(Quiet) not-a-number value.

+ +

Definition at line 53 of file constants.hpp.

+ +
+
+ +
+
+ + + + +
const double stan::math::SQRT_2 = std::sqrt(2.0)
+
+ +

The value of the square root of 2, $ \sqrt{2} $.

+ +

Definition at line 20 of file constants.hpp.

+ +
+
+ +
+
+ + + + +
const double stan::math::TWO_OVER_SQRT_PI = 2.0 / std::sqrt(boost::math::constants::pi<double>())
+
+ +

Definition at line 146 of file constants.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacestan_1_1math_1_1policies.html b/doc/api/html/namespacestan_1_1math_1_1policies.html new file mode 100644 index 00000000000..8d0daf358f2 --- /dev/null +++ b/doc/api/html/namespacestan_1_1math_1_1policies.html @@ -0,0 +1,179 @@ + + + + + +Stan: stan::math::policies Namespace Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::math::policies Namespace Reference
+
+
+ +

Extending boost functionality. +More...

+ + + + + +

+Namespaces

namespace  detail
 Reimplementing boost::math::policies::detail::raise_domain_error.
 
+ + + + +

+Functions

template<class T_result , class T_val , class Policy >
T_result raise_domain_error (const char *function, const char *message, const T_val &val, const Policy &)
 
+

Detailed Description

+

Extending boost functionality.

+

Function Documentation

+ +
+
+
+template<class T_result , class T_val , class Policy >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
T_result stan::math::policies::raise_domain_error (const char * function,
const char * message,
const T_val & val,
const Policy &  
)
+
+inline
+
+ +

Definition at line 55 of file raise_domain_error.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacestan_1_1math_1_1policies_1_1detail.html b/doc/api/html/namespacestan_1_1math_1_1policies_1_1detail.html new file mode 100644 index 00000000000..62a502da722 --- /dev/null +++ b/doc/api/html/namespacestan_1_1math_1_1policies_1_1detail.html @@ -0,0 +1,335 @@ + + + + + +Stan: stan::math::policies::detail Namespace Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::math::policies::detail Namespace Reference
+
+
+ +

Reimplementing boost::math::policies::detail::raise_domain_error. +More...

+ + + + + + + + + + + + + + +

+Functions

template<class T_result , class T_val >
T_result raise_domain_error (const char *function, const char *message, const T_val &val, const ::boost::math::policies::domain_error< ::boost::math::policies::throw_on_error > &)
 
template<class T_result , class T_val >
T_result raise_domain_error (const char *, const char *, const T_val &, const ::boost::math::policies::domain_error< ::boost::math::policies::ignore_error > &)
 
template<class T_result , class T_val >
T_result raise_domain_error (const char *, const char *, const T_val &, const ::boost::math::policies::domain_error< ::boost::math::policies::errno_on_error > &)
 
template<class T_result , class T_val >
T_result raise_domain_error (const char *function, const char *message, const T_val &val, const ::boost::math::policies::domain_error< ::boost::math::policies::user_error > &)
 
+

Detailed Description

+

Reimplementing boost::math::policies::detail::raise_domain_error.

+

For error handling, Stan requires raise_domain_error to handle two template parameters, one for the return type and the other for the input type.

+

In boost, these functions are in namespace boost::math::policies:details. Since reimplementing these functions in that namespace could lead to ambiguous functions calls, they are placed in stan::math::policies::details.

+

These functions still rely on boost::math::policies::detail::raise_error.

+

TODO: user_error may need to be refactored to include the two template parameters.

+

Function Documentation

+ +
+
+
+template<class T_result , class T_val >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
T_result stan::math::policies::detail::raise_domain_error (const char * function,
const char * message,
const T_val & val,
const ::boost::math::policies::domain_error< ::boost::math::policies::throw_on_error > &  
)
+
+inline
+
+ +

Definition at line 14 of file raise_domain_error.hpp.

+ +
+
+ +
+
+
+template<class T_result , class T_val >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
T_result stan::math::policies::detail::raise_domain_error (const char * ,
const char * ,
const T_val & ,
const ::boost::math::policies::domain_error< ::boost::math::policies::ignore_error > &  
)
+
+inline
+
+ +

Definition at line 24 of file raise_domain_error.hpp.

+ +
+
+ +
+
+
+template<class T_result , class T_val >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
T_result stan::math::policies::detail::raise_domain_error (const char * ,
const char * ,
const T_val & ,
const ::boost::math::policies::domain_error< ::boost::math::policies::errno_on_error > &  
)
+
+inline
+
+ +

Definition at line 34 of file raise_domain_error.hpp.

+ +
+
+ +
+
+
+template<class T_result , class T_val >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
T_result stan::math::policies::detail::raise_domain_error (const char * function,
const char * message,
const T_val & val,
const ::boost::math::policies::domain_error< ::boost::math::policies::user_error > &  
)
+
+inline
+
+ +

Definition at line 45 of file raise_domain_error.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacestan_1_1mcmc.html b/doc/api/html/namespacestan_1_1mcmc.html new file mode 100644 index 00000000000..1da4ad6a126 --- /dev/null +++ b/doc/api/html/namespacestan_1_1mcmc.html @@ -0,0 +1,197 @@ + + + + + +Stan: stan::mcmc Namespace Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc Namespace Reference
+
+
+ +

Markov chain Monte Carlo samplers. +More...

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Classes

class  base_adaptation
 
class  base_adapter
 
class  base_mcmc
 
class  chains
 An mcmc::chains object stores parameter names and dimensionalities along with samples from multiple chains. More...
 
class  covar_adaptation
 
class  base_hmc
 
class  base_hamiltonian
 
class  dense_e_metric
 
class  dense_e_point
 
class  diag_e_metric
 
class  diag_e_point
 
class  ps_point
 
class  unit_e_metric
 
class  unit_e_point
 
class  base_integrator
 
class  base_leapfrog
 
class  expl_leapfrog
 
class  adapt_dense_e_nuts
 
class  adapt_diag_e_nuts
 
class  adapt_unit_e_nuts
 
struct  nuts_util
 
class  base_nuts
 
class  dense_e_nuts
 
class  diag_e_nuts
 
class  unit_e_nuts
 
class  adapt_dense_e_static_hmc
 
class  adapt_diag_e_static_hmc
 
class  adapt_unit_e_static_hmc
 
class  base_static_hmc
 
class  dense_e_static_hmc
 
class  diag_e_static_hmc
 
class  unit_e_static_hmc
 
class  sample
 
class  stepsize_adaptation
 
class  stepsize_adapter
 
class  stepsize_covar_adapter
 
class  stepsize_var_adapter
 
class  var_adaptation
 
class  windowed_adaptation
 
+

Detailed Description

+

Markov chain Monte Carlo samplers.

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacestan_1_1memory.html b/doc/api/html/namespacestan_1_1memory.html new file mode 100644 index 00000000000..06110c14fdc --- /dev/null +++ b/doc/api/html/namespacestan_1_1memory.html @@ -0,0 +1,179 @@ + + + + + +Stan: stan::memory Namespace Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::memory Namespace Reference
+
+
+ +

(Expert) Allocate, free, and manage underlying system memory. +More...

+ + + + + + + +

+Classes

class  chunk_alloc
 
class  stack_alloc
 An instance of this class provides a memory pool through which blocks of raw memory may be allocated and then collected simultaneously. More...
 
+ + + + + +

+Functions

template<typename T >
bool is_aligned (T *ptr, unsigned int bytes_aligned)
 Return true if the specified pointer is aligned on the number of bytes.
 
+

Detailed Description

+

(Expert) Allocate, free, and manage underlying system memory.

+

Function Documentation

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
bool stan::memory::is_aligned (T * ptr,
unsigned int bytes_aligned 
)
+
+ +

Return true if the specified pointer is aligned on the number of bytes.

+

This doesn't really make sense other than for powers of 2.

+
Parameters
+ + + +
ptrPointer to test.
bytes_alignedNumber of bytes of alignment required.
+
+
+
Returns
true if pointer is aligned.
+
Template Parameters
+ + +
Typeof object to which pointer points.
+
+
+ +

Definition at line 35 of file stack_alloc.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacestan_1_1model.html b/doc/api/html/namespacestan_1_1model.html new file mode 100644 index 00000000000..b9f969df531 --- /dev/null +++ b/doc/api/html/namespacestan_1_1model.html @@ -0,0 +1,635 @@ + + + + + +Stan: stan::model Namespace Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::model Namespace Reference
+
+
+ +

For compiling models. +More...

+ + + + + +

+Classes

class  prob_grad
 The prob_grad class represents the basic parameter holders for a model. More...
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

template<bool jacobian_adjust_transform, class M >
double log_prob_propto (const M &model, std::vector< double > &params_r, std::vector< int > &params_i, std::ostream *msgs=0)
 Helper function to calculate log probability for double scalars up to a proportion.
 
template<bool propto, bool jacobian_adjust_transform, class M >
double log_prob_grad (const M &model, std::vector< double > &params_r, std::vector< int > &params_i, std::vector< double > &gradient, std::ostream *msgs=0)
 Compute the gradient using reverse-mode automatic differentiation, writing the result into the specified gradient, using the specified perturbation.
 
template<bool jacobian_adjust_transform, class M >
double log_prob_propto (const M &model, Eigen::VectorXd &params_r, std::ostream *msgs=0)
 Helper function to calculate log probability for double scalars up to a proportion.
 
template<bool propto, bool jacobian_adjust_transform, class M >
double log_prob_grad (const M &model, Eigen::VectorXd &params_r, Eigen::VectorXd &gradient, std::ostream *msgs=0)
 Compute the gradient using reverse-mode automatic differentiation, writing the result into the specified gradient, using the specified perturbation.
 
template<bool propto, bool jacobian_adjust_transform, class M >
void finite_diff_grad (const M &model, std::vector< double > &params_r, std::vector< int > &params_i, std::vector< double > &grad, double epsilon=1e-6, std::ostream *msgs=0)
 Compute the gradient using finite differences for the specified parameters, writing the result into the specified gradient, using the specified perturbation.
 
template<bool propto, bool jacobian_adjust_transform, class M >
int test_gradients (const M &model, std::vector< double > &params_r, std::vector< int > &params_i, double epsilon=1e-6, double error=1e-6, std::ostream &o=std::cout, std::ostream *msgs=0)
 Test the log_prob_grad() function's ability to produce accurate gradients using finite differences.
 
template<bool propto, bool jacobian_adjust_transform, class M >
double grad_hess_log_prob (const M &model, std::vector< double > &params_r, std::vector< int > &params_i, std::vector< double > &gradient, std::vector< double > &hessian, std::ostream *msgs=0)
 Evaluate the log-probability, its gradient, and its Hessian at params_r.
 
+

Detailed Description

+

For compiling models.

+

Function Documentation

+ +
+
+
+template<bool propto, bool jacobian_adjust_transform, class M >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::model::finite_diff_grad (const M & model,
std::vector< double > & params_r,
std::vector< int > & params_i,
std::vector< double > & grad,
double epsilon = 1e-6,
std::ostream * msgs = 0 
)
+
+ +

Compute the gradient using finite differences for the specified parameters, writing the result into the specified gradient, using the specified perturbation.

+
Template Parameters
+ + + + +
proptoTrue if calculation is up to proportion (double-only terms dropped).
jacobian_adjust_transformTrue if the log absolute Jacobian determinant of inverse parameter transforms is added to the log probability.
MClass of model.
+
+
+
Parameters
+ + + + + + + +
modelModel.
params_rReal-valued parameters.
params_iInteger-valued parameters.
[out]gradVector into which gradient is written.
epsilon
[in,out]msgs
+
+
+ +

Definition at line 212 of file util.hpp.

+ +
+
+ +
+
+
+template<bool propto, bool jacobian_adjust_transform, class M >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
double stan::model::grad_hess_log_prob (const M & model,
std::vector< double > & params_r,
std::vector< int > & params_i,
std::vector< double > & gradient,
std::vector< double > & hessian,
std::ostream * msgs = 0 
)
+
+ +

Evaluate the log-probability, its gradient, and its Hessian at params_r.

+

This default version computes the Hessian numerically by finite-differencing the gradient, at a cost of O(params_r.size()^2).

+
Template Parameters
+ + + + +
proptoTrue if calculation is up to proportion (double-only terms dropped).
jacobian_adjust_transformTrue if the log absolute Jacobian determinant of inverse parameter transforms is added to the log probability.
MClass of model.
+
+
+
Parameters
+ + + + + + + +
modelModel.
params_rReal-valued parameter vector.
params_iInteger-valued parameter vector.
gradientVector to write gradient to.
hessianVector to write gradient to. hessian[i*D + j] gives the element at the ith row and jth column of the Hessian (where D=params_r.size()).
msgsStream to which print statements in Stan programs are written, default is 0
+
+
+ +

Definition at line 336 of file util.hpp.

+ +
+
+ +
+
+
+template<bool propto, bool jacobian_adjust_transform, class M >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
double stan::model::log_prob_grad (const M & model,
std::vector< double > & params_r,
std::vector< int > & params_i,
std::vector< double > & gradient,
std::ostream * msgs = 0 
)
+
+ +

Compute the gradient using reverse-mode automatic differentiation, writing the result into the specified gradient, using the specified perturbation.

+
Template Parameters
+ + + + +
proptoTrue if calculation is up to proportion (double-only terms dropped).
jacobian_adjust_transformTrue if the log absolute Jacobian determinant of inverse parameter transforms is added to the log probability.
MClass of model.
+
+
+
Parameters
+ + + + + + +
[in]modelModel.
[in]params_rReal-valued parameters.
[in]params_iInteger-valued parameters.
[out]gradientVector into which gradient is written.
[in,out]msgs
+
+
+ +

Definition at line 81 of file util.hpp.

+ +
+
+ +
+
+
+template<bool propto, bool jacobian_adjust_transform, class M >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
double stan::model::log_prob_grad (const M & model,
Eigen::VectorXd & params_r,
Eigen::VectorXd & gradient,
std::ostream * msgs = 0 
)
+
+ +

Compute the gradient using reverse-mode automatic differentiation, writing the result into the specified gradient, using the specified perturbation.

+
Template Parameters
+ + + + +
proptoTrue if calculation is up to proportion (double-only terms dropped).
jacobian_adjust_transformTrue if the log absolute Jacobian determinant of inverse parameter transforms is added to the log probability.
MClass of model.
+
+
+
Parameters
+ + + + + +
[in]modelModel.
[in]params_rReal-valued parameters.
[out]gradientVector into which gradient is written.
[in,out]msgs
+
+
+ +

Definition at line 168 of file util.hpp.

+ +
+
+ +
+
+
+template<bool jacobian_adjust_transform, class M >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
double stan::model::log_prob_propto (const M & model,
std::vector< double > & params_r,
std::vector< int > & params_i,
std::ostream * msgs = 0 
)
+
+ +

Helper function to calculate log probability for double scalars up to a proportion.

+

This implementation wraps the double values in stan::agrad::var and calls the model's log_prob() function with propto=true and the specified parameter for applying the Jacobian adjustment for transformed parameters.

+
Template Parameters
+ + + + +
proptoTrue if calculation is up to proportion (double-only terms dropped).
jacobian_adjust_transformTrue if the log absolute Jacobian determinant of inverse parameter transforms is added to the log probability.
MClass of model.
+
+
+
Parameters
+ + + + + +
[in]modelModel.
[in]params_rReal-valued parameters.
[in]params_iInteger-valued parameters.
[in,out]msgs
+
+
+ +

Definition at line 39 of file util.hpp.

+ +
+
+ +
+
+
+template<bool jacobian_adjust_transform, class M >
+ + + + + + + + + + + + + + + + + + + + + + + + +
double stan::model::log_prob_propto (const M & model,
Eigen::VectorXd & params_r,
std::ostream * msgs = 0 
)
+
+ +

Helper function to calculate log probability for double scalars up to a proportion.

+

This implementation wraps the double values in stan::agrad::var and calls the model's log_prob() function with propto=true and the specified parameter for applying the Jacobian adjustment for transformed parameters.

+
Template Parameters
+ + + + +
proptoTrue if calculation is up to proportion (double-only terms dropped).
jacobian_adjust_transformTrue if the log absolute Jacobian determinant of inverse parameter transforms is added to the log probability.
MClass of model.
+
+
+
Parameters
+ + + + +
[in]modelModel.
[in]params_rReal-valued parameters.
[in,out]msgs
+
+
+ +

Definition at line 129 of file util.hpp.

+ +
+
+ +
+
+
+template<bool propto, bool jacobian_adjust_transform, class M >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
int stan::model::test_gradients (const M & model,
std::vector< double > & params_r,
std::vector< int > & params_i,
double epsilon = 1e-6,
double error = 1e-6,
std::ostream & o = std::cout,
std::ostream * msgs = 0 
)
+
+ +

Test the log_prob_grad() function's ability to produce accurate gradients using finite differences.

+

This shouldn't be necessary when using autodiff, but is useful for finding bugs in hand-written code (or agrad).

+
Template Parameters
+ + + + +
proptoTrue if calculation is up to proportion (double-only terms dropped).
jacobian_adjust_transformTrue if the log absolute Jacobian determinant of inverse parameter transforms is added to the log probability.
MClass of model.
+
+
+
Parameters
+ + + + + + + + +
modelModel.
params_rReal-valued parameter vector.
params_iInteger-valued parameter vector.
epsilonReal-valued scalar saying how much to perturb. Defaults to 1e-6.
errorReal-valued scalar saying how much error to allow. Defaults to 1e-6.
oOutput stream for messages. Defaults to std::cout.
msgsStream to which Stan programs write. Defaults to 0.
+
+
+
Returns
number of failed gradient comparisons versus allowed error, so 0 if all gradients pass
+ +

Definition at line 263 of file util.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacestan_1_1optimization.html b/doc/api/html/namespacestan_1_1optimization.html new file mode 100644 index 00000000000..7c4fb33f58c --- /dev/null +++ b/doc/api/html/namespacestan_1_1optimization.html @@ -0,0 +1,255 @@ + + + + + +Stan: stan::optimization Namespace Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::optimization Namespace Reference
+
+
+ + + + + + + + + + +

+Classes

class  BFGSMinimizer
 
class  ModelAdaptor
 
class  BFGSLineSearch
 
class  NesterovGradient
 
+ + + + + +

+Typedefs

typedef Eigen::Matrix< double,
+Eigen::Dynamic, Eigen::Dynamic > 
matrix_d
 
typedef Eigen::Matrix< double,
+Eigen::Dynamic, 1 > 
vector_d
 
+ + + + + + + +

+Functions

template<typename M >
double lp_no_jacobian (const M &model, std::vector< double > &params_r, std::vector< int > &params_i, std::ostream *o=0)
 
template<typename M >
double newton_step (M &model, std::vector< double > &params_r, std::vector< int > &params_i, std::ostream *output_stream=0)
 
+

Typedef Documentation

+ +
+
+ + + + +
typedef Eigen::Matrix<double, Eigen::Dynamic, Eigen::Dynamic> stan::optimization::matrix_d
+
+ +

Definition at line 14 of file newton.hpp.

+ +
+
+ +
+
+ + + + +
typedef Eigen::Matrix<double, Eigen::Dynamic, 1> stan::optimization::vector_d
+
+ +

Definition at line 15 of file newton.hpp.

+ +
+
+

Function Documentation

+ +
+
+
+template<typename M >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
double stan::optimization::lp_no_jacobian (const M & model,
std::vector< double > & params_r,
std::vector< int > & params_i,
std::ostream * o = 0 
)
+
+ +

Definition at line 459 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename M >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
double stan::optimization::newton_step (M & model,
std::vector< double > & params_r,
std::vector< int > & params_i,
std::ostream * output_stream = 0 
)
+
+ +

Definition at line 34 of file newton.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacestan_1_1prob.html b/doc/api/html/namespacestan_1_1prob.html new file mode 100644 index 00000000000..98be5f0cf83 --- /dev/null +++ b/doc/api/html/namespacestan_1_1prob.html @@ -0,0 +1,13569 @@ + + + + + +Stan: stan::prob Namespace Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::prob Namespace Reference
+
+
+ +

Templated probability distributions. +More...

+ + + + + + + + + +

+Classes

struct  include_summand
 Template metaprogram to calculate whether a summand needs to be included in a proportional (log) probability calculation. More...
 
class  welford_covar_estimator
 
class  welford_var_estimator
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

template<bool propto, typename T_y , typename T_loc , typename T_scale >
boost::enable_if_c
+< contains_fvar< T_y, T_loc,
+T_scale >::value, typename
+return_type< T_y, T_loc,
+T_scale >::type >::type 
normal_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 The log of the normal density for the specified scalar(s) given the specified mean(s) and deviation(s).
 
template<typename T >
void autocorrelation (const std::vector< T > &y, std::vector< T > &ac, Eigen::FFT< T > &fft)
 Write autocorrelation estimates for every lag for the specified input sequence into the specified result using the specified FFT engine.
 
template<typename T >
void autocorrelation (const std::vector< T > &y, std::vector< T > &ac)
 Write autocorrelation estimates for every lag for the specified input sequence into the specified result.
 
template<typename T >
void autocovariance (const std::vector< T > &y, std::vector< T > &acov, Eigen::FFT< T > &fft)
 Write autocovariance estimates for every lag for the specified input sequence into the specified result using the specified FFT engine.
 
template<typename T >
void autocovariance (const std::vector< T > &y, std::vector< T > &acov)
 Write autocovariance estimates for every lag for the specified input sequence into the specified result.
 
template<bool propto, typename T_prob , typename T_prior_sample_size >
boost::math::tools::promote_args
+< T_prob, T_prior_sample_size >
+::type 
dirichlet_log (const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta, const Eigen::Matrix< T_prior_sample_size, Eigen::Dynamic, 1 > &alpha)
 The log of the Dirichlet density for the given theta and a vector of prior sample sizes, alpha.
 
template<typename T_prob , typename T_prior_sample_size >
boost::math::tools::promote_args
+< T_prob, T_prior_sample_size >
+::type 
dirichlet_log (const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta, const Eigen::Matrix< T_prior_sample_size, Eigen::Dynamic, 1 > &alpha)
 
template<class RNG >
Eigen::VectorXd dirichlet_rng (const Eigen::Matrix< double, Eigen::Dynamic, 1 > &alpha, RNG &rng)
 
template<bool propto, typename T_y , typename T_F , typename T_G , typename T_V , typename T_W , typename T_m0 , typename T_C0 >
return_type< T_y, typename
+return_type< T_F, T_G, T_V,
+T_W, T_m0, T_C0 >::type >
+::type 
gaussian_dlm_obs_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_F, Eigen::Dynamic, Eigen::Dynamic > &F, const Eigen::Matrix< T_G, Eigen::Dynamic, Eigen::Dynamic > &G, const Eigen::Matrix< T_V, Eigen::Dynamic, Eigen::Dynamic > &V, const Eigen::Matrix< T_W, Eigen::Dynamic, Eigen::Dynamic > &W, const Eigen::Matrix< T_m0, Eigen::Dynamic, 1 > &m0, const Eigen::Matrix< T_C0, Eigen::Dynamic, Eigen::Dynamic > &C0)
 The log of a Gaussian dynamic linear model (GDLM).
 
template<typename T_y , typename T_F , typename T_G , typename T_V , typename T_W , typename T_m0 , typename T_C0 >
return_type< T_y, typename
+return_type< T_F, T_G, T_V,
+T_W, T_m0, T_C0 >::type >
+::type 
gaussian_dlm_obs_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_F, Eigen::Dynamic, Eigen::Dynamic > &F, const Eigen::Matrix< T_G, Eigen::Dynamic, Eigen::Dynamic > &G, const Eigen::Matrix< T_V, Eigen::Dynamic, Eigen::Dynamic > &V, const Eigen::Matrix< T_W, Eigen::Dynamic, Eigen::Dynamic > &W, const Eigen::Matrix< T_m0, Eigen::Dynamic, 1 > &m0, const Eigen::Matrix< T_C0, Eigen::Dynamic, Eigen::Dynamic > &C0)
 
template<bool propto, typename T_y , typename T_F , typename T_G , typename T_V , typename T_W , typename T_m0 , typename T_C0 >
return_type< T_y, typename
+return_type< T_F, T_G, T_V,
+T_W, T_m0, T_C0 >::type >
+::type 
gaussian_dlm_obs_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_F, Eigen::Dynamic, Eigen::Dynamic > &F, const Eigen::Matrix< T_G, Eigen::Dynamic, Eigen::Dynamic > &G, const Eigen::Matrix< T_V, Eigen::Dynamic, 1 > &V, const Eigen::Matrix< T_W, Eigen::Dynamic, Eigen::Dynamic > &W, const Eigen::Matrix< T_m0, Eigen::Dynamic, 1 > &m0, const Eigen::Matrix< T_C0, Eigen::Dynamic, Eigen::Dynamic > &C0)
 The log of a Gaussian dynamic linear model (GDLM) with uncorrelated observation disturbances.
 
template<typename T_y , typename T_F , typename T_G , typename T_V , typename T_W , typename T_m0 , typename T_C0 >
return_type< T_y, typename
+return_type< T_F, T_G, T_V,
+T_W, T_m0, T_C0 >::type >
+::type 
gaussian_dlm_obs_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_F, Eigen::Dynamic, Eigen::Dynamic > &F, const Eigen::Matrix< T_G, Eigen::Dynamic, Eigen::Dynamic > &G, const Eigen::Matrix< T_V, Eigen::Dynamic, 1 > &V, const Eigen::Matrix< T_W, Eigen::Dynamic, Eigen::Dynamic > &W, const Eigen::Matrix< T_m0, Eigen::Dynamic, 1 > &m0, const Eigen::Matrix< T_C0, Eigen::Dynamic, Eigen::Dynamic > &C0)
 
template<bool propto, typename T_y , typename T_dof , typename T_scale >
boost::math::tools::promote_args
+< T_y, T_dof, T_scale >::type 
inv_wishart_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &W, const T_dof &nu, const Eigen::Matrix< T_scale, Eigen::Dynamic, Eigen::Dynamic > &S)
 The log of the Inverse-Wishart density for the given W, degrees of freedom, and scale matrix.
 
template<typename T_y , typename T_dof , typename T_scale >
boost::math::tools::promote_args
+< T_y, T_dof, T_scale >::type 
inv_wishart_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &W, const T_dof &nu, const Eigen::Matrix< T_scale, Eigen::Dynamic, Eigen::Dynamic > &S)
 
template<class RNG >
Eigen::Matrix< double,
+Eigen::Dynamic, Eigen::Dynamic > 
inv_wishart_rng (const double nu, const Eigen::Matrix< double, Eigen::Dynamic, Eigen::Dynamic > &S, RNG &rng)
 
template<typename T_shape >
T_shape do_lkj_constant (const T_shape &eta, const unsigned int &K)
 
template<bool propto, typename T_covar , typename T_shape >
boost::math::tools::promote_args
+< T_covar, T_shape >::type 
lkj_corr_cholesky_log (const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &L, const T_shape &eta)
 
template<typename T_covar , typename T_shape >
boost::math::tools::promote_args
+< T_covar, T_shape >::type 
lkj_corr_cholesky_log (const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &L, const T_shape &eta)
 
template<bool propto, typename T_y , typename T_shape >
boost::math::tools::promote_args
+< T_y, T_shape >::type 
lkj_corr_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const T_shape &eta)
 
template<typename T_y , typename T_shape >
boost::math::tools::promote_args
+< T_y, T_shape >::type 
lkj_corr_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const T_shape &eta)
 
template<class RNG >
Eigen::MatrixXd lkj_corr_cholesky_rng (const size_t K, const double eta, RNG &rng)
 
template<class RNG >
Eigen::MatrixXd lkj_corr_rng (const size_t K, const double eta, RNG &rng)
 
template<bool propto, typename T_y , typename T_loc , typename T_scale , typename T_shape >
boost::math::tools::promote_args
+< T_y, T_loc, T_scale, T_shape >
+::type 
lkj_cov_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_scale, Eigen::Dynamic, 1 > &sigma, const T_shape &eta)
 
template<typename T_y , typename T_loc , typename T_scale , typename T_shape >
boost::math::tools::promote_args
+< T_y, T_loc, T_scale, T_shape >
+::type 
lkj_cov_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_scale, Eigen::Dynamic, 1 > &sigma, const T_shape &eta)
 
template<bool propto, typename T_y , typename T_loc , typename T_scale , typename T_shape >
boost::math::tools::promote_args
+< T_y, T_loc, T_scale, T_shape >
+::type 
lkj_cov_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const T_loc &mu, const T_scale &sigma, const T_shape &eta)
 
template<typename T_y , typename T_loc , typename T_scale , typename T_shape >
boost::math::tools::promote_args
+< T_y, T_loc, T_scale, T_shape >
+::type 
lkj_cov_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const T_loc &mu, const T_scale &sigma, const T_shape &eta)
 
template<bool propto, typename T_y , typename T_Mu , typename T_Sigma , typename T_D >
boost::math::tools::promote_args
+< T_y, T_Mu, T_Sigma, T_D >
+::type 
matrix_normal_prec_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_Mu, Eigen::Dynamic, Eigen::Dynamic > &Mu, const Eigen::Matrix< T_Sigma, Eigen::Dynamic, Eigen::Dynamic > &Sigma, const Eigen::Matrix< T_D, Eigen::Dynamic, Eigen::Dynamic > &D)
 The log of the matrix normal density for the given y, mu, Sigma and D where Sigma and D are given as precision matrices, not covariance matrices.
 
template<typename T_y , typename T_Mu , typename T_Sigma , typename T_D >
boost::math::tools::promote_args
+< T_y, T_Mu, T_Sigma, T_D >
+::type 
matrix_normal_prec_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_Mu, Eigen::Dynamic, Eigen::Dynamic > &Mu, const Eigen::Matrix< T_Sigma, Eigen::Dynamic, Eigen::Dynamic > &Sigma, const Eigen::Matrix< T_D, Eigen::Dynamic, Eigen::Dynamic > &D)
 
template<bool propto, typename T_y , typename T_covar , typename T_w >
boost::math::tools::promote_args
+< T_y, T_w, T_covar >::type 
multi_gp_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma, const Eigen::Matrix< T_w, Eigen::Dynamic, 1 > &w)
 The log of a multivariate Gaussian Process for the given y, Sigma, and w.
 
template<typename T_y , typename T_loc , typename T_covar >
boost::math::tools::promote_args
+< T_y, T_loc, T_covar >::type 
multi_gp_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &w)
 
template<bool propto, typename T_y , typename T_loc , typename T_covar >
boost::math::tools::promote_args
+< T_y, T_loc, T_covar >::type 
multi_normal_log (const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma)
 
template<typename T_y , typename T_loc , typename T_covar >
boost::math::tools::promote_args
+< T_y, T_loc, T_covar >::type 
multi_normal_log (const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma)
 
template<bool propto, typename T_y , typename T_loc , typename T_covar >
boost::math::tools::promote_args
+< T_y, T_loc, T_covar >::type 
multi_normal_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma)
 
template<typename T_y , typename T_loc , typename T_covar >
boost::math::tools::promote_args
+< T_y, T_loc, T_covar >::type 
multi_normal_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma)
 
template<class RNG >
Eigen::VectorXd multi_normal_rng (const Eigen::Matrix< double, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< double, Eigen::Dynamic, Eigen::Dynamic > &S, RNG &rng)
 
template<bool propto, typename T_y , typename T_loc , typename T_covar >
boost::math::tools::promote_args
+< T_y, T_loc, T_covar >::type 
multi_normal_cholesky_log (const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &L)
 The log of the multivariate normal density for the given y, mu, and a Cholesky factor L of the variance matrix.
 
template<typename T_y , typename T_loc , typename T_covar >
boost::math::tools::promote_args
+< T_y, T_loc, T_covar >::type 
multi_normal_cholesky_log (const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &L)
 
template<bool propto, typename T_y , typename T_loc , typename T_covar >
boost::math::tools::promote_args
+< T_y, T_loc, T_covar >::type 
multi_normal_cholesky_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &L)
 y can have multiple rows (observations) and columns (on variables)
 
template<typename T_y , typename T_loc , typename T_covar >
boost::math::tools::promote_args
+< T_y, T_loc, T_covar >::type 
multi_normal_cholesky_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &L)
 
template<bool propto, typename T_y , typename T_loc , typename T_covar >
boost::math::tools::promote_args
+< T_y, T_loc, T_covar >::type 
multi_normal_prec_log (const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma)
 
template<typename T_y , typename T_loc , typename T_covar >
boost::math::tools::promote_args
+< T_y, T_loc, T_covar >::type 
multi_normal_prec_log (const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma)
 
template<bool propto, typename T_y , typename T_loc , typename T_covar >
boost::math::tools::promote_args
+< T_y, T_loc, T_covar >::type 
multi_normal_prec_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma)
 y can have multiple rows (observations) and columns (on variables)
 
template<typename T_y , typename T_loc , typename T_covar >
boost::math::tools::promote_args
+< T_y, T_loc, T_covar >::type 
multi_normal_prec_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma)
 
template<bool propto, typename T_y , typename T_dof , typename T_loc , typename T_scale >
boost::math::tools::promote_args
+< T_y, T_dof, T_loc, T_scale >
+::type 
multi_student_t_log (const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const T_dof &nu, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_scale, Eigen::Dynamic, Eigen::Dynamic > &Sigma)
 Return the log of the multivariate Student t distribution at the specified arguments.
 
template<typename T_y , typename T_dof , typename T_loc , typename T_scale >
boost::math::tools::promote_args
+< T_y, T_dof, T_loc, T_scale >
+::type 
multi_student_t_log (const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const T_dof &nu, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_scale, Eigen::Dynamic, Eigen::Dynamic > &Sigma)
 
template<class RNG >
Eigen::VectorXd multi_student_t_rng (const double nu, const Eigen::Matrix< double, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< double, Eigen::Dynamic, Eigen::Dynamic > &s, RNG &rng)
 
template<bool propto, typename T_y , typename T_dof , typename T_scale >
boost::math::tools::promote_args
+< T_y, T_dof, T_scale >::type 
wishart_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &W, const T_dof &nu, const Eigen::Matrix< T_scale, Eigen::Dynamic, Eigen::Dynamic > &S)
 The log of the Wishart density for the given W, degrees of freedom, and scale matrix.
 
template<typename T_y , typename T_dof , typename T_scale >
boost::math::tools::promote_args
+< T_y, T_dof, T_scale >::type 
wishart_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &W, const T_dof &nu, const Eigen::Matrix< T_scale, Eigen::Dynamic, Eigen::Dynamic > &S)
 
template<class RNG >
Eigen::Matrix< double,
+Eigen::Dynamic, Eigen::Dynamic > 
wishart_rng (const double nu, const Eigen::Matrix< double, Eigen::Dynamic, Eigen::Dynamic > &S, RNG &rng)
 
template<bool propto, typename T_prob >
boost::math::tools::promote_args
+< T_prob >::type 
categorical_log (int n, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta)
 
template<typename T_prob >
boost::math::tools::promote_args
+< T_prob >::type 
categorical_log (const typename Eigen::Matrix< T_prob, Eigen::Dynamic, 1 >::size_type n, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta)
 
template<bool propto, typename T_prob >
boost::math::tools::promote_args
+< T_prob >::type 
categorical_log (const std::vector< int > &ns, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta)
 
template<typename T_prob >
boost::math::tools::promote_args
+< T_prob >::type 
categorical_log (const std::vector< int > &ns, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta)
 
template<class RNG >
int categorical_rng (const Eigen::Matrix< double, Eigen::Dynamic, 1 > &theta, RNG &rng)
 
template<bool propto, typename T_prob >
boost::math::tools::promote_args
+< T_prob >::type 
categorical_logit_log (int n, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &beta)
 
template<typename T_prob >
boost::math::tools::promote_args
+< T_prob >::type 
categorical_logit_log (int n, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &beta)
 
template<bool propto, typename T_prob >
boost::math::tools::promote_args
+< T_prob >::type 
categorical_logit_log (const std::vector< int > &ns, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &beta)
 
template<typename T_prob >
boost::math::tools::promote_args
+< T_prob >::type 
categorical_logit_log (const std::vector< int > &ns, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &beta)
 
template<bool propto, typename T_prob >
boost::math::tools::promote_args
+< T_prob >::type 
multinomial_log (const std::vector< int > &ns, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta)
 
template<typename T_prob >
boost::math::tools::promote_args
+< T_prob >::type 
multinomial_log (const std::vector< int > &ns, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta)
 
template<class RNG >
std::vector< int > multinomial_rng (const Eigen::Matrix< double, Eigen::Dynamic, 1 > &theta, const int N, RNG &rng)
 
template<bool propto, typename T_y , typename T_scale_succ , typename T_scale_fail >
return_type< T_y, T_scale_succ,
+T_scale_fail >::type 
beta_log (const T_y &y, const T_scale_succ &alpha, const T_scale_fail &beta)
 The log of the beta density for the specified scalar(s) given the specified sample size(s).
 
template<typename T_y , typename T_scale_succ , typename T_scale_fail >
return_type< T_y, T_scale_succ,
+T_scale_fail >::type 
beta_log (const T_y &y, const T_scale_succ &alpha, const T_scale_fail &beta)
 
template<typename T_y , typename T_scale_succ , typename T_scale_fail >
return_type< T_y, T_scale_succ,
+T_scale_fail >::type 
beta_cdf (const T_y &y, const T_scale_succ &alpha, const T_scale_fail &beta)
 Calculates the beta cumulative distribution function for the given variate and scale variables.
 
template<typename T_y , typename T_scale_succ , typename T_scale_fail >
return_type< T_y, T_scale_succ,
+T_scale_fail >::type 
beta_cdf_log (const T_y &y, const T_scale_succ &alpha, const T_scale_fail &beta)
 
template<typename T_y , typename T_scale_succ , typename T_scale_fail >
return_type< T_y, T_scale_succ,
+T_scale_fail >::type 
beta_ccdf_log (const T_y &y, const T_scale_succ &alpha, const T_scale_fail &beta)
 
template<class RNG >
double beta_rng (const double alpha, const double beta, RNG &rng)
 
template<bool propto, typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
cauchy_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 The log of the Cauchy density for the specified scalar(s) given the specified location parameter(s) and scale parameter(s).
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
cauchy_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
cauchy_cdf (const T_y &y, const T_loc &mu, const T_scale &sigma)
 Calculates the cauchy cumulative distribution function for the given variate, location, and scale.
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
cauchy_cdf_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
cauchy_ccdf_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<class RNG >
double cauchy_rng (const double mu, const double sigma, RNG &rng)
 
template<bool propto, typename T_y , typename T_dof >
return_type< T_y, T_dof >::type chi_square_log (const T_y &y, const T_dof &nu)
 The log of a chi-squared density for y with the specified degrees of freedom parameter.
 
template<typename T_y , typename T_dof >
return_type< T_y, T_dof >::type chi_square_log (const T_y &y, const T_dof &nu)
 
template<typename T_y , typename T_dof >
return_type< T_y, T_dof >::type chi_square_cdf (const T_y &y, const T_dof &nu)
 Calculates the chi square cumulative distribution function for the given variate and degrees of freedom.
 
template<typename T_y , typename T_dof >
return_type< T_y, T_dof >::type chi_square_cdf_log (const T_y &y, const T_dof &nu)
 
template<typename T_y , typename T_dof >
return_type< T_y, T_dof >::type chi_square_ccdf_log (const T_y &y, const T_dof &nu)
 
template<class RNG >
double chi_square_rng (const double nu, RNG &rng)
 
template<typename T >
int sign (const T &z)
 
template<bool propto, typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
double_exponential_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
double_exponential_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
double_exponential_cdf (const T_y &y, const T_loc &mu, const T_scale &sigma)
 Calculates the double exponential cumulative density function.
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
double_exponential_cdf_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
double_exponential_ccdf_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<class RNG >
double double_exponential_rng (const double mu, const double sigma, RNG &rng)
 
template<bool propto, typename T_y , typename T_loc , typename T_scale , typename T_inv_scale >
return_type< T_y, T_loc,
+T_scale, T_inv_scale >::type 
exp_mod_normal_log (const T_y &y, const T_loc &mu, const T_scale &sigma, const T_inv_scale &lambda)
 
template<typename T_y , typename T_loc , typename T_scale , typename T_inv_scale >
return_type< T_y, T_loc,
+T_scale, T_inv_scale >::type 
exp_mod_normal_log (const T_y &y, const T_loc &mu, const T_scale &sigma, const T_inv_scale &lambda)
 
template<typename T_y , typename T_loc , typename T_scale , typename T_inv_scale >
return_type< T_y, T_loc,
+T_scale, T_inv_scale >::type 
exp_mod_normal_cdf (const T_y &y, const T_loc &mu, const T_scale &sigma, const T_inv_scale &lambda)
 
template<typename T_y , typename T_loc , typename T_scale , typename T_inv_scale >
return_type< T_y, T_loc,
+T_scale, T_inv_scale >::type 
exp_mod_normal_cdf_log (const T_y &y, const T_loc &mu, const T_scale &sigma, const T_inv_scale &lambda)
 
template<typename T_y , typename T_loc , typename T_scale , typename T_inv_scale >
return_type< T_y, T_loc,
+T_scale, T_inv_scale >::type 
exp_mod_normal_ccdf_log (const T_y &y, const T_loc &mu, const T_scale &sigma, const T_inv_scale &lambda)
 
template<class RNG >
double exp_mod_normal_rng (const double mu, const double sigma, const double lambda, RNG &rng)
 
template<bool propto, typename T_y , typename T_inv_scale >
return_type< T_y, T_inv_scale >
+::type 
exponential_log (const T_y &y, const T_inv_scale &beta)
 The log of an exponential density for y with the specified inverse scale parameter.
 
template<typename T_y , typename T_inv_scale >
return_type< T_y, T_inv_scale >
+::type 
exponential_log (const T_y &y, const T_inv_scale &beta)
 
template<typename T_y , typename T_inv_scale >
return_type< T_y, T_inv_scale >
+::type 
exponential_cdf (const T_y &y, const T_inv_scale &beta)
 Calculates the exponential cumulative distribution function for the given y and beta.
 
template<typename T_y , typename T_inv_scale >
return_type< T_y, T_inv_scale >
+::type 
exponential_cdf_log (const T_y &y, const T_inv_scale &beta)
 
template<typename T_y , typename T_inv_scale >
return_type< T_y, T_inv_scale >
+::type 
exponential_ccdf_log (const T_y &y, const T_inv_scale &beta)
 
template<class RNG >
double exponential_rng (const double beta, RNG &rng)
 
template<bool propto, typename T_y , typename T_shape , typename T_inv_scale >
return_type< T_y, T_shape,
+T_inv_scale >::type 
gamma_log (const T_y &y, const T_shape &alpha, const T_inv_scale &beta)
 The log of a gamma density for y with the specified shape and inverse scale parameters.
 
template<typename T_y , typename T_shape , typename T_inv_scale >
return_type< T_y, T_shape,
+T_inv_scale >::type 
gamma_log (const T_y &y, const T_shape &alpha, const T_inv_scale &beta)
 
template<typename T_y , typename T_shape , typename T_inv_scale >
return_type< T_y, T_shape,
+T_inv_scale >::type 
gamma_cdf (const T_y &y, const T_shape &alpha, const T_inv_scale &beta)
 The cumulative density function for a gamma distribution for y with the specified shape and inverse scale parameters.
 
template<typename T_y , typename T_shape , typename T_inv_scale >
return_type< T_y, T_shape,
+T_inv_scale >::type 
gamma_cdf_log (const T_y &y, const T_shape &alpha, const T_inv_scale &beta)
 
template<typename T_y , typename T_shape , typename T_inv_scale >
return_type< T_y, T_shape,
+T_inv_scale >::type 
gamma_ccdf_log (const T_y &y, const T_shape &alpha, const T_inv_scale &beta)
 
template<class RNG >
double gamma_rng (const double alpha, const double beta, RNG &rng)
 
template<bool propto, typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
gumbel_log (const T_y &y, const T_loc &mu, const T_scale &beta)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
gumbel_log (const T_y &y, const T_loc &mu, const T_scale &beta)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
gumbel_cdf (const T_y &y, const T_loc &mu, const T_scale &beta)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
gumbel_cdf_log (const T_y &y, const T_loc &mu, const T_scale &beta)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
gumbel_ccdf_log (const T_y &y, const T_loc &mu, const T_scale &beta)
 
template<class RNG >
double gumbel_rng (const double mu, const double beta, RNG &rng)
 
template<bool propto, typename T_y , typename T_dof >
return_type< T_y, T_dof >::type inv_chi_square_log (const T_y &y, const T_dof &nu)
 The log of an inverse chi-squared density for y with the specified degrees of freedom parameter.
 
template<typename T_y , typename T_dof >
return_type< T_y, T_dof >::type inv_chi_square_log (const T_y &y, const T_dof &nu)
 
template<typename T_y , typename T_dof >
return_type< T_y, T_dof >::type inv_chi_square_cdf (const T_y &y, const T_dof &nu)
 
template<typename T_y , typename T_dof >
return_type< T_y, T_dof >::type inv_chi_square_cdf_log (const T_y &y, const T_dof &nu)
 
template<typename T_y , typename T_dof >
return_type< T_y, T_dof >::type inv_chi_square_ccdf_log (const T_y &y, const T_dof &nu)
 
template<class RNG >
double inv_chi_square_rng (const double nu, RNG &rng)
 
template<bool propto, typename T_y , typename T_shape , typename T_scale >
return_type< T_y, T_shape,
+T_scale >::type 
inv_gamma_log (const T_y &y, const T_shape &alpha, const T_scale &beta)
 The log of an inverse gamma density for y with the specified shape and scale parameters.
 
template<typename T_y , typename T_shape , typename T_scale >
return_type< T_y, T_shape,
+T_scale >::type 
inv_gamma_log (const T_y &y, const T_shape &alpha, const T_scale &beta)
 
template<typename T_y , typename T_shape , typename T_scale >
return_type< T_y, T_shape,
+T_scale >::type 
inv_gamma_cdf (const T_y &y, const T_shape &alpha, const T_scale &beta)
 The CDF of an inverse gamma density for y with the specified shape and scale parameters.
 
template<typename T_y , typename T_shape , typename T_scale >
return_type< T_y, T_shape,
+T_scale >::type 
inv_gamma_cdf_log (const T_y &y, const T_shape &alpha, const T_scale &beta)
 
template<typename T_y , typename T_shape , typename T_scale >
return_type< T_y, T_shape,
+T_scale >::type 
inv_gamma_ccdf_log (const T_y &y, const T_shape &alpha, const T_scale &beta)
 
template<class RNG >
double inv_gamma_rng (const double alpha, const double beta, RNG &rng)
 
template<bool propto, typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
logistic_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
logistic_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
logistic_cdf (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
logistic_cdf_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
logistic_ccdf_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<class RNG >
double logistic_rng (const double mu, const double sigma, RNG &rng)
 
template<bool propto, typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
lognormal_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
lognormal_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
lognormal_cdf (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
lognormal_cdf_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
lognormal_ccdf_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<class RNG >
double lognormal_rng (const double mu, const double sigma, RNG &rng)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
normal_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
normal_cdf (const T_y &y, const T_loc &mu, const T_scale &sigma)
 Calculates the normal cumulative distribution function for the given variate, location, and scale.
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
normal_cdf_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
normal_ccdf_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<class RNG >
double normal_rng (const double mu, const double sigma, RNG &rng)
 
template<bool propto, typename T_y , typename T_scale , typename T_shape >
return_type< T_y, T_scale,
+T_shape >::type 
pareto_log (const T_y &y, const T_scale &y_min, const T_shape &alpha)
 
template<typename T_y , typename T_scale , typename T_shape >
return_type< T_y, T_scale,
+T_shape >::type 
pareto_log (const T_y &y, const T_scale &y_min, const T_shape &alpha)
 
template<typename T_y , typename T_scale , typename T_shape >
return_type< T_y, T_scale,
+T_shape >::type 
pareto_cdf (const T_y &y, const T_scale &y_min, const T_shape &alpha)
 
template<typename T_y , typename T_scale , typename T_shape >
return_type< T_y, T_scale,
+T_shape >::type 
pareto_cdf_log (const T_y &y, const T_scale &y_min, const T_shape &alpha)
 
template<typename T_y , typename T_scale , typename T_shape >
return_type< T_y, T_scale,
+T_shape >::type 
pareto_ccdf_log (const T_y &y, const T_scale &y_min, const T_shape &alpha)
 
template<class RNG >
double pareto_rng (const double y_min, const double alpha, RNG &rng)
 
template<bool propto, typename T_y , typename T_scale >
return_type< T_y, T_scale >::type rayleigh_log (const T_y &y, const T_scale &sigma)
 
template<typename T_y , typename T_scale >
return_type< T_y, T_scale >::type rayleigh_log (const T_y &y, const T_scale &sigma)
 
template<typename T_y , typename T_scale >
return_type< T_y, T_scale >::type rayleigh_cdf (const T_y &y, const T_scale &sigma)
 
template<typename T_y , typename T_scale >
return_type< T_y, T_scale >::type rayleigh_cdf_log (const T_y &y, const T_scale &sigma)
 
template<typename T_y , typename T_scale >
return_type< T_y, T_scale >::type rayleigh_ccdf_log (const T_y &y, const T_scale &sigma)
 
template<class RNG >
double rayleigh_rng (const double sigma, RNG &rng)
 
template<bool propto, typename T_y , typename T_dof , typename T_scale >
return_type< T_y, T_dof,
+T_scale >::type 
scaled_inv_chi_square_log (const T_y &y, const T_dof &nu, const T_scale &s)
 The log of a scaled inverse chi-squared density for y with the specified degrees of freedom parameter and scale parameter.
 
template<typename T_y , typename T_dof , typename T_scale >
return_type< T_y, T_dof,
+T_scale >::type 
scaled_inv_chi_square_log (const T_y &y, const T_dof &nu, const T_scale &s)
 
template<typename T_y , typename T_dof , typename T_scale >
return_type< T_y, T_dof,
+T_scale >::type 
scaled_inv_chi_square_cdf (const T_y &y, const T_dof &nu, const T_scale &s)
 The CDF of a scaled inverse chi-squared density for y with the specified degrees of freedom parameter and scale parameter.
 
template<typename T_y , typename T_dof , typename T_scale >
return_type< T_y, T_dof,
+T_scale >::type 
scaled_inv_chi_square_cdf_log (const T_y &y, const T_dof &nu, const T_scale &s)
 
template<typename T_y , typename T_dof , typename T_scale >
return_type< T_y, T_dof,
+T_scale >::type 
scaled_inv_chi_square_ccdf_log (const T_y &y, const T_dof &nu, const T_scale &s)
 
template<class RNG >
double scaled_inv_chi_square_rng (const double nu, const double s, RNG &rng)
 
template<bool propto, typename T_y , typename T_loc , typename T_scale , typename T_shape >
return_type< T_y, T_loc,
+T_scale, T_shape >::type 
skew_normal_log (const T_y &y, const T_loc &mu, const T_scale &sigma, const T_shape &alpha)
 
template<typename T_y , typename T_loc , typename T_scale , typename T_shape >
return_type< T_y, T_loc,
+T_scale, T_shape >::type 
skew_normal_log (const T_y &y, const T_loc &mu, const T_scale &sigma, const T_shape &alpha)
 
template<typename T_y , typename T_loc , typename T_scale , typename T_shape >
return_type< T_y, T_loc,
+T_scale, T_shape >::type 
skew_normal_cdf (const T_y &y, const T_loc &mu, const T_scale &sigma, const T_shape &alpha)
 
template<typename T_y , typename T_loc , typename T_scale , typename T_shape >
return_type< T_y, T_loc,
+T_scale, T_shape >::type 
skew_normal_cdf_log (const T_y &y, const T_loc &mu, const T_scale &sigma, const T_shape &alpha)
 
template<typename T_y , typename T_loc , typename T_scale , typename T_shape >
return_type< T_y, T_loc,
+T_scale, T_shape >::type 
skew_normal_ccdf_log (const T_y &y, const T_loc &mu, const T_scale &sigma, const T_shape &alpha)
 
template<class RNG >
double skew_normal_rng (const double mu, const double sigma, const double alpha, RNG &rng)
 
template<bool propto, typename T_y , typename T_dof , typename T_loc , typename T_scale >
return_type< T_y, T_dof, T_loc,
+T_scale >::type 
student_t_log (const T_y &y, const T_dof &nu, const T_loc &mu, const T_scale &sigma)
 The log of the Student-t density for the given y, nu, mean, and scale parameter.
 
template<typename T_y , typename T_dof , typename T_loc , typename T_scale >
return_type< T_y, T_dof, T_loc,
+T_scale >::type 
student_t_log (const T_y &y, const T_dof &nu, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_dof , typename T_loc , typename T_scale >
return_type< T_y, T_dof, T_loc,
+T_scale >::type 
student_t_cdf (const T_y &y, const T_dof &nu, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_dof , typename T_loc , typename T_scale >
return_type< T_y, T_dof, T_loc,
+T_scale >::type 
student_t_cdf_log (const T_y &y, const T_dof &nu, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_dof , typename T_loc , typename T_scale >
return_type< T_y, T_dof, T_loc,
+T_scale >::type 
student_t_ccdf_log (const T_y &y, const T_dof &nu, const T_loc &mu, const T_scale &sigma)
 
template<class RNG >
double student_t_rng (const double nu, const double mu, const double sigma, RNG &rng)
 
template<bool propto, typename T_y , typename T_low , typename T_high >
return_type< T_y, T_low,
+T_high >::type 
uniform_log (const T_y &y, const T_low &alpha, const T_high &beta)
 The log of a uniform density for the given y, lower, and upper bound.
 
template<typename T_y , typename T_low , typename T_high >
return_type< T_y, T_low,
+T_high >::type 
uniform_log (const T_y &y, const T_low &alpha, const T_high &beta)
 
template<typename T_y , typename T_low , typename T_high >
return_type< T_y, T_low,
+T_high >::type 
uniform_cdf (const T_y &y, const T_low &alpha, const T_high &beta)
 
template<typename T_y , typename T_low , typename T_high >
return_type< T_y, T_low,
+T_high >::type 
uniform_cdf_log (const T_y &y, const T_low &alpha, const T_high &beta)
 
template<typename T_y , typename T_low , typename T_high >
return_type< T_y, T_low,
+T_high >::type 
uniform_ccdf_log (const T_y &y, const T_low &alpha, const T_high &beta)
 
template<class RNG >
double uniform_rng (const double alpha, const double beta, RNG &rng)
 
template<bool propto, typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
von_mises_log (T_y const &y, T_loc const &mu, T_scale const &kappa)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
von_mises_log (T_y const &y, T_loc const &mu, T_scale const &kappa)
 
template<bool propto, typename T_y , typename T_shape , typename T_scale >
return_type< T_y, T_shape,
+T_scale >::type 
weibull_log (const T_y &y, const T_shape &alpha, const T_scale &sigma)
 
template<typename T_y , typename T_shape , typename T_scale >
return_type< T_y, T_shape,
+T_scale >::type 
weibull_log (const T_y &y, const T_shape &alpha, const T_scale &sigma)
 
template<typename T_y , typename T_shape , typename T_scale >
return_type< T_y, T_shape,
+T_scale >::type 
weibull_cdf (const T_y &y, const T_shape &alpha, const T_scale &sigma)
 
template<typename T_y , typename T_shape , typename T_scale >
return_type< T_y, T_shape,
+T_scale >::type 
weibull_cdf_log (const T_y &y, const T_shape &alpha, const T_scale &sigma)
 
template<typename T_y , typename T_shape , typename T_scale >
return_type< T_y, T_shape,
+T_scale >::type 
weibull_ccdf_log (const T_y &y, const T_shape &alpha, const T_scale &sigma)
 
template<class RNG >
double weibull_rng (const double alpha, const double sigma, RNG &rng)
 
template<bool propto, typename T_n , typename T_prob >
return_type< T_prob >::type bernoulli_log (const T_n &n, const T_prob &theta)
 
template<typename T_y , typename T_prob >
return_type< T_prob >::type bernoulli_log (const T_y &n, const T_prob &theta)
 
template<bool propto, typename T_n , typename T_prob >
return_type< T_prob >::type bernoulli_logit_log (const T_n &n, const T_prob &theta)
 
template<typename T_n , typename T_prob >
return_type< T_prob >::type bernoulli_logit_log (const T_n &n, const T_prob &theta)
 
template<typename T_n , typename T_prob >
return_type< T_prob >::type bernoulli_cdf (const T_n &n, const T_prob &theta)
 
template<typename T_n , typename T_prob >
return_type< T_prob >::type bernoulli_cdf_log (const T_n &n, const T_prob &theta)
 
template<typename T_n , typename T_prob >
return_type< T_prob >::type bernoulli_ccdf_log (const T_n &n, const T_prob &theta)
 
template<class RNG >
int bernoulli_rng (const double theta, RNG &rng)
 
template<bool propto, typename T_n , typename T_N , typename T_size1 , typename T_size2 >
return_type< T_size1, T_size2 >
+::type 
beta_binomial_log (const T_n &n, const T_N &N, const T_size1 &alpha, const T_size2 &beta)
 
template<typename T_n , typename T_N , typename T_size1 , typename T_size2 >
return_type< T_size1, T_size2 >
+::type 
beta_binomial_log (const T_n &n, const T_N &N, const T_size1 &alpha, const T_size2 &beta)
 
template<typename T_n , typename T_N , typename T_size1 , typename T_size2 >
return_type< T_size1, T_size2 >
+::type 
beta_binomial_cdf (const T_n &n, const T_N &N, const T_size1 &alpha, const T_size2 &beta)
 
template<typename T_n , typename T_N , typename T_size1 , typename T_size2 >
return_type< T_size1, T_size2 >
+::type 
beta_binomial_cdf_log (const T_n &n, const T_N &N, const T_size1 &alpha, const T_size2 &beta)
 
template<typename T_n , typename T_N , typename T_size1 , typename T_size2 >
return_type< T_size1, T_size2 >
+::type 
beta_binomial_ccdf_log (const T_n &n, const T_N &N, const T_size1 &alpha, const T_size2 &beta)
 
template<class RNG >
int beta_binomial_rng (const int N, const double alpha, const double beta, RNG &rng)
 
template<bool propto, typename T_n , typename T_N , typename T_prob >
return_type< T_prob >::type binomial_log (const T_n &n, const T_N &N, const T_prob &theta)
 
template<typename T_n , typename T_N , typename T_prob >
return_type< T_prob >::type binomial_log (const T_n &n, const T_N &N, const T_prob &theta)
 
template<bool propto, typename T_n , typename T_N , typename T_prob >
return_type< T_prob >::type binomial_logit_log (const T_n &n, const T_N &N, const T_prob &alpha)
 
template<typename T_n , typename T_N , typename T_prob >
return_type< T_prob >::type binomial_logit_log (const T_n &n, const T_N &N, const T_prob &alpha)
 
template<typename T_n , typename T_N , typename T_prob >
return_type< T_prob >::type binomial_cdf (const T_n &n, const T_N &N, const T_prob &theta)
 
template<typename T_n , typename T_N , typename T_prob >
return_type< T_prob >::type binomial_cdf_log (const T_n &n, const T_N &N, const T_prob &theta)
 
template<typename T_n , typename T_N , typename T_prob >
return_type< T_prob >::type binomial_ccdf_log (const T_n &n, const T_N &N, const T_prob &theta)
 
template<class RNG >
int binomial_rng (const int N, const double theta, RNG &rng)
 
template<bool propto, typename T_n , typename T_N , typename T_a , typename T_b >
double hypergeometric_log (const T_n &n, const T_N &N, const T_a &a, const T_b &b)
 
template<typename T_n , typename T_N , typename T_a , typename T_b >
double hypergeometric_log (const T_n &n, const T_N &N, const T_a &a, const T_b &b)
 
template<class RNG >
int hypergeometric_rng (const int N, const int a, const int b, RNG &rng)
 
template<bool propto, typename T_n , typename T_shape , typename T_inv_scale >
return_type< T_shape,
+T_inv_scale >::type 
neg_binomial_log (const T_n &n, const T_shape &alpha, const T_inv_scale &beta)
 
template<typename T_n , typename T_shape , typename T_inv_scale >
return_type< T_shape,
+T_inv_scale >::type 
neg_binomial_log (const T_n &n, const T_shape &alpha, const T_inv_scale &beta)
 
template<typename T_n , typename T_shape , typename T_inv_scale >
return_type< T_shape,
+T_inv_scale >::type 
neg_binomial_cdf (const T_n &n, const T_shape &alpha, const T_inv_scale &beta)
 
template<typename T_n , typename T_shape , typename T_inv_scale >
return_type< T_shape,
+T_inv_scale >::type 
neg_binomial_cdf_log (const T_n &n, const T_shape &alpha, const T_inv_scale &beta)
 
template<typename T_n , typename T_shape , typename T_inv_scale >
return_type< T_shape,
+T_inv_scale >::type 
neg_binomial_ccdf_log (const T_n &n, const T_shape &alpha, const T_inv_scale &beta)
 
template<class RNG >
int neg_binomial_rng (const double alpha, const double beta, RNG &rng)
 
template<typename T >
log_inv_logit_diff (const T &alpha, const T &beta)
 
template<bool propto, typename T_lambda , typename T_cut >
boost::math::tools::promote_args
+< T_lambda, T_cut >::type 
ordered_logistic_log (int y, const T_lambda &lambda, const Eigen::Matrix< T_cut, Eigen::Dynamic, 1 > &c)
 Returns the (natural) log probability of the specified integer outcome given the continuous location and specified cutpoints in an ordered logistic model.
 
template<typename T_lambda , typename T_cut >
boost::math::tools::promote_args
+< T_lambda, T_cut >::type 
ordered_logistic_log (int y, const T_lambda &lambda, const Eigen::Matrix< T_cut, Eigen::Dynamic, 1 > &c)
 
template<class RNG >
int ordered_logistic_rng (const double eta, const Eigen::Matrix< double, Eigen::Dynamic, 1 > &c, RNG &rng)
 
template<bool propto, typename T_n , typename T_rate >
return_type< T_rate >::type poisson_log (const T_n &n, const T_rate &lambda)
 
template<typename T_n , typename T_rate >
return_type< T_rate >::type poisson_log (const T_n &n, const T_rate &lambda)
 
template<bool propto, typename T_n , typename T_log_rate >
return_type< T_log_rate >::type poisson_log_log (const T_n &n, const T_log_rate &alpha)
 
template<typename T_n , typename T_log_rate >
return_type< T_log_rate >::type poisson_log_log (const T_n &n, const T_log_rate &alpha)
 
template<typename T_n , typename T_rate >
return_type< T_rate >::type poisson_cdf (const T_n &n, const T_rate &lambda)
 
template<typename T_n , typename T_rate >
return_type< T_rate >::type poisson_cdf_log (const T_n &n, const T_rate &lambda)
 
template<typename T_n , typename T_rate >
return_type< T_rate >::type poisson_ccdf_log (const T_n &n, const T_rate &lambda)
 
template<class RNG >
int poisson_rng (const double lambda, RNG &rng)
 
template<typename T >
bool factor_cov_matrix (Eigen::Array< T, Eigen::Dynamic, 1 > &CPCs, Eigen::Array< T, Eigen::Dynamic, 1 > &sds, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &Sigma)
 This function is intended to make starting values, given a covariance matrix Sigma.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
read_corr_L (const Eigen::Array< T, Eigen::Dynamic, 1 > &CPCs, const size_t K)
 Return the Cholesky factor of the correlation matrix of the specified dimensionality corresponding to the specified canonical partial correlations.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
read_corr_matrix (const Eigen::Array< T, Eigen::Dynamic, 1 > &CPCs, const size_t K)
 Return the correlation matrix of the specified dimensionality corresponding to the specified canonical partial correlations.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
read_corr_L (const Eigen::Array< T, Eigen::Dynamic, 1 > &CPCs, const size_t K, T &log_prob)
 Return the Cholesky factor of the correlation matrix of the specified dimensionality corresponding to the specified canonical partial correlations, incrementing the specified scalar reference with the log absolute determinant of the Jacobian of the transformation.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
read_corr_matrix (const Eigen::Array< T, Eigen::Dynamic, 1 > &CPCs, const size_t K, T &log_prob)
 Return the correlation matrix of the specified dimensionality corresponding to the specified canonical partial correlations, incrementing the specified scalar reference with the log absolute determinant of the Jacobian of the transformation.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
read_cov_L (const Eigen::Array< T, Eigen::Dynamic, 1 > &CPCs, const Eigen::Array< T, Eigen::Dynamic, 1 > &sds, T &log_prob)
 This is the function that should be called prior to evaluating the density of any elliptical distribution.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
read_cov_matrix (const Eigen::Array< T, Eigen::Dynamic, 1 > &CPCs, const Eigen::Array< T, Eigen::Dynamic, 1 > &sds, T &log_prob)
 A generally worse alternative to call prior to evaluating the density of an elliptical distribution.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
read_cov_matrix (const Eigen::Array< T, Eigen::Dynamic, 1 > &CPCs, const Eigen::Array< T, Eigen::Dynamic, 1 > &sds)
 Builds a covariance matrix from CPCs and standard deviations.
 
template<typename T >
const Eigen::Array< T,
+Eigen::Dynamic, 1 > 
make_nu (const T eta, const size_t K)
 This function calculates the degrees of freedom for the t distribution that corresponds to the shape parameter in the Lewandowski et.
 
template<typename T >
identity_constrain (T x)
 Returns the result of applying the identity constraint transform to the input.
 
template<typename T >
identity_constrain (const T x, T &)
 Returns the result of applying the identity constraint transform to the input and increments the log probability reference with the log absolute Jacobian determinant.
 
template<typename T >
identity_free (const T y)
 Returns the result of applying the inverse of the identity constraint transform to the input.
 
template<typename T >
positive_constrain (const T x)
 Return the positive value for the specified unconstrained input.
 
template<typename T >
positive_constrain (const T x, T &lp)
 Return the positive value for the specified unconstrained input, incrementing the scalar reference with the log absolute Jacobian determinant.
 
template<typename T >
positive_free (const T y)
 Return the unconstrained value corresponding to the specified positive-constrained value.
 
template<typename T , typename TL >
lb_constrain (const T x, const TL lb)
 Return the lower-bounded value for the specified unconstrained input and specified lower bound.
 
template<typename T , typename TL >
boost::math::tools::promote_args
+< T, TL >::type 
lb_constrain (const T x, const TL lb, T &lp)
 Return the lower-bounded value for the speicifed unconstrained input and specified lower bound, incrementing the specified reference with the log absolute Jacobian determinant of the transform.
 
template<typename T , typename TL >
boost::math::tools::promote_args
+< T, TL >::type 
lb_free (const T y, const TL lb)
 Return the unconstrained value that produces the specified lower-bound constrained value.
 
template<typename T , typename TU >
boost::math::tools::promote_args
+< T, TU >::type 
ub_constrain (const T x, const TU ub)
 Return the upper-bounded value for the specified unconstrained scalar and upper bound.
 
template<typename T , typename TU >
boost::math::tools::promote_args
+< T, TU >::type 
ub_constrain (const T x, const TU ub, T &lp)
 Return the upper-bounded value for the specified unconstrained scalar and upper bound and increment the specified log probability reference with the log absolute Jacobian determinant of the transform.
 
template<typename T , typename TU >
boost::math::tools::promote_args
+< T, TU >::type 
ub_free (const T y, const TU ub)
 Return the free scalar that corresponds to the specified upper-bounded value with respect to the specified upper bound.
 
template<typename T , typename TL , typename TU >
boost::math::tools::promote_args
+< T, TL, TU >::type 
lub_constrain (const T x, TL lb, TU ub)
 Return the lower- and upper-bounded scalar derived by transforming the specified free scalar given the specified lower and upper bounds.
 
template<typename T , typename TL , typename TU >
boost::math::tools::promote_args
+< T, TL, TU >::type 
lub_constrain (const T x, const TL lb, const TU ub, T &lp)
 Return the lower- and upper-bounded scalar derived by transforming the specified free scalar given the specified lower and upper bounds and increment the specified log probability with the log absolute Jacobian determinant.
 
template<typename T , typename TL , typename TU >
boost::math::tools::promote_args
+< T, TL, TU >::type 
lub_free (const T y, TL lb, TU ub)
 Return the unconstrained scalar that transforms to the specified lower- and upper-bounded scalar given the specified bounds.
 
template<typename T >
prob_constrain (const T x)
 Return a probability value constrained to fall between 0 and 1 (inclusive) for the specified free scalar.
 
template<typename T >
prob_constrain (const T x, T &lp)
 Return a probability value constrained to fall between 0 and 1 (inclusive) for the specified free scalar and increment the specified log probability reference with the log absolute Jacobian determinant of the transform.
 
template<typename T >
prob_free (const T y)
 Return the free scalar that when transformed to a probability produces the specified scalar.
 
template<typename T >
corr_constrain (const T x)
 Return the result of transforming the specified scalar to have a valid correlation value between -1 and 1 (inclusive).
 
template<typename T >
corr_constrain (const T x, T &lp)
 Return the result of transforming the specified scalar to have a valid correlation value between -1 and 1 (inclusive).
 
template<typename T >
corr_free (const T y)
 Return the unconstrained scalar that when transformed to a valid correlation produces the specified value.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
unit_vector_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &y)
 Return the unit length vector corresponding to the free vector y.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
unit_vector_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &y, T &lp)
 Return the unit length vector corresponding to the free vector y.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
unit_vector_free (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x)
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
simplex_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &y)
 Return the simplex corresponding to the specified free vector.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
simplex_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &y, T &lp)
 Return the simplex corresponding to the specified free vector and increment the specified log probability reference with the log absolute Jacobian determinant of the transform.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
simplex_free (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x)
 Return an unconstrained vector that when transformed produces the specified simplex.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
ordered_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x)
 Return an increasing ordered vector derived from the specified free vector.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
ordered_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, T &lp)
 Return a positive valued, increasing ordered vector derived from the specified free vector and increment the specified log probability reference with the log absolute Jacobian determinant of the transform.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
ordered_free (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &y)
 Return the vector of unconstrained scalars that transform to the specified positive ordered vector.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
positive_ordered_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x)
 Return an increasing positive ordered vector derived from the specified free vector.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
positive_ordered_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, T &lp)
 Return a positive valued, increasing positive ordered vector derived from the specified free vector and increment the specified log probability reference with the log absolute Jacobian determinant of the transform.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
positive_ordered_free (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &y)
 Return the vector of unconstrained scalars that transform to the specified positive ordered vector.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
cholesky_factor_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, int M, int N)
 Return the Cholesky factor of the specified size read from the specified vector.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
cholesky_factor_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, int M, int N, T &lp)
 Return the Cholesky factor of the specified size read from the specified vector and increment the specified log probability reference with the log Jacobian adjustment of the transform.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
cholesky_factor_free (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y)
 Return the unconstrained vector of parameters correspdonding to the specified Cholesky factor.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
corr_matrix_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, typename Eigen::Matrix< T, Eigen::Dynamic, 1 >::size_type k)
 Return the correlation matrix of the specified dimensionality derived from the specified vector of unconstrained values.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
corr_matrix_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, typename Eigen::Matrix< T, Eigen::Dynamic, 1 >::size_type k, T &lp)
 Return the correlation matrix of the specified dimensionality derived from the specified vector of unconstrained values.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
corr_matrix_free (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y)
 Return the vector of unconstrained partial correlations that define the specified correlation matrix when transformed.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
cov_matrix_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, typename Eigen::Matrix< T, Eigen::Dynamic, 1 >::size_type K)
 Return the symmetric, positive-definite matrix of dimensions K by K resulting from transforming the specified finite vector of size K plus (K choose 2).
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
cov_matrix_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, typename Eigen::Matrix< T, Eigen::Dynamic, 1 >::size_type K, T &lp)
 Return the symmetric, positive-definite matrix of dimensions K by K resulting from transforming the specified finite vector of size K plus (K choose 2).
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
cov_matrix_free (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y)
 The covariance matrix derived from the symmetric view of the lower-triangular view of the K by K specified matrix is freed to return a vector of size K + (K choose 2).
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
cov_matrix_constrain_lkj (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, size_t k)
 Return the covariance matrix of the specified dimensionality derived from constraining the specified vector of unconstrained values.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
cov_matrix_constrain_lkj (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, size_t k, T &lp)
 Return the covariance matrix of the specified dimensionality derived from constraining the specified vector of unconstrained values and increment the specified log probability reference with the log absolute Jacobian determinant.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
cov_matrix_free_lkj (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y)
 Return the vector of unconstrained partial correlations and deviations that transform to the specified covariance matrix.
 
+ + + +

+Variables

const double CONSTRAINT_TOLERANCE = 1E-8
 
+

Detailed Description

+

Templated probability distributions.

+

All paramaterizations are based on Bayesian Data Analysis. Error handling for the distributions is described in Error Handling Policies.

+

Function Documentation

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::prob::autocorrelation (const std::vector< T > & y,
std::vector< T > & ac,
Eigen::FFT< T > & fft 
)
+
+ +

Write autocorrelation estimates for every lag for the specified input sequence into the specified result using the specified FFT engine.

+

The return vector be resized to the same length as the input sequence with lags given by array index.

+

The implementation involves a fast Fourier transform, followed by a normalization, followed by an inverse transform.

+

An FFT engine can be created for reuse for type double with:

+
+    Eigen::FFT<double> fft;
+
Template Parameters
+ + +
TScalar type.
+
+
+
Parameters
+ + + + +
yInput sequence.
acAutocorrelations.
fftFFT engine instance.
+
+
+ +

Definition at line 56 of file autocorrelation.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
void stan::prob::autocorrelation (const std::vector< T > & y,
std::vector< T > & ac 
)
+
+ +

Write autocorrelation estimates for every lag for the specified input sequence into the specified result.

+

The return vector be resized to the same length as the input sequence with lags given by array index.

+

The implementation involves a fast Fourier transform, followed by a normalization, followed by an inverse transform.

+

This method is just a light wrapper around the three-argument autocorrelation function

+
Template Parameters
+ + +
TScalar type.
+
+
+
Parameters
+ + + +
yInput sequence.
acAutocorrelations.
+
+
+ +

Definition at line 126 of file autocorrelation.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::prob::autocovariance (const std::vector< T > & y,
std::vector< T > & acov,
Eigen::FFT< T > & fft 
)
+
+ +

Write autocovariance estimates for every lag for the specified input sequence into the specified result using the specified FFT engine.

+

The return vector be resized to the same length as the input sequence with lags given by array index.

+

The implementation involves a fast Fourier transform, followed by a normalization, followed by an inverse transform.

+

An FFT engine can be created for reuse for type double with:

+
+    Eigen::FFT<double> fft;
+
Template Parameters
+ + +
TScalar type.
+
+
+
Parameters
+ + + + +
yInput sequence.
acovAutocovariance.
fftFFT engine instance.
+
+
+ +

Definition at line 33 of file autocovariance.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
void stan::prob::autocovariance (const std::vector< T > & y,
std::vector< T > & acov 
)
+
+ +

Write autocovariance estimates for every lag for the specified input sequence into the specified result.

+

The return vector be resized to the same length as the input sequence with lags given by array index.

+

The implementation involves a fast Fourier transform, followed by a normalization, followed by an inverse transform.

+

This method is just a light wrapper around the three-argument autocovariance function

+
Template Parameters
+ + +
TScalar type.
+
+
+
Parameters
+ + + +
yInput sequence.
acovAutocovariances.
+
+
+ +

Definition at line 62 of file autocovariance.hpp.

+ +
+
+ +
+
+
+template<typename T_n , typename T_prob >
+ + + + + + + + + + + + + + + + + + +
return_type<T_prob>::type stan::prob::bernoulli_ccdf_log (const T_n & n,
const T_prob & theta 
)
+
+ +

Definition at line 346 of file bernoulli.hpp.

+ +
+
+ +
+
+
+template<typename T_n , typename T_prob >
+ + + + + + + + + + + + + + + + + + +
return_type<T_prob>::type stan::prob::bernoulli_cdf (const T_n & n,
const T_prob & theta 
)
+
+ +

Definition at line 219 of file bernoulli.hpp.

+ +
+
+ +
+
+
+template<typename T_n , typename T_prob >
+ + + + + + + + + + + + + + + + + + +
return_type<T_prob>::type stan::prob::bernoulli_cdf_log (const T_n & n,
const T_prob & theta 
)
+
+ +

Definition at line 284 of file bernoulli.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_n , typename T_prob >
+ + + + + + + + + + + + + + + + + + +
return_type<T_prob>::type stan::prob::bernoulli_log (const T_n & n,
const T_prob & theta 
)
+
+ +

Definition at line 25 of file bernoulli.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_prob >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
return_type<T_prob>::type stan::prob::bernoulli_log (const T_y & n,
const T_prob & theta 
)
+
+inline
+
+ +

Definition at line 122 of file bernoulli.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_n , typename T_prob >
+ + + + + + + + + + + + + + + + + + +
return_type<T_prob>::type stan::prob::bernoulli_logit_log (const T_n & n,
const T_prob & theta 
)
+
+ +

Definition at line 132 of file bernoulli.hpp.

+ +
+
+ +
+
+
+template<typename T_n , typename T_prob >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
return_type<T_prob>::type stan::prob::bernoulli_logit_log (const T_n & n,
const T_prob & theta 
)
+
+inline
+
+ +

Definition at line 211 of file bernoulli.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
int stan::prob::bernoulli_rng (const double theta,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 410 of file bernoulli.hpp.

+ +
+
+ +
+
+
+template<typename T_n , typename T_N , typename T_size1 , typename T_size2 >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_size1,T_size2>::type stan::prob::beta_binomial_ccdf_log (const T_n & n,
const T_N & N,
const T_size1 & alpha,
const T_size2 & beta 
)
+
+ +

Definition at line 452 of file beta_binomial.hpp.

+ +
+
+ +
+
+
+template<typename T_n , typename T_N , typename T_size1 , typename T_size2 >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_size1,T_size2>::type stan::prob::beta_binomial_cdf (const T_n & n,
const T_N & N,
const T_size1 & alpha,
const T_size2 & beta 
)
+
+ +

Definition at line 196 of file beta_binomial.hpp.

+ +
+
+ +
+
+
+template<typename T_n , typename T_N , typename T_size1 , typename T_size2 >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_size1,T_size2>::type stan::prob::beta_binomial_cdf_log (const T_n & n,
const T_N & N,
const T_size1 & alpha,
const T_size2 & beta 
)
+
+ +

Definition at line 331 of file beta_binomial.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_n , typename T_N , typename T_size1 , typename T_size2 >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_size1,T_size2>::type stan::prob::beta_binomial_log (const T_n & n,
const T_N & N,
const T_size1 & alpha,
const T_size2 & beta 
)
+
+ +

Definition at line 28 of file beta_binomial.hpp.

+ +
+
+ +
+
+
+template<typename T_n , typename T_N , typename T_size1 , typename T_size2 >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_size1,T_size2>::type stan::prob::beta_binomial_log (const T_n & n,
const T_N & N,
const T_size1 & alpha,
const T_size2 & beta 
)
+
+ +

Definition at line 187 of file beta_binomial.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
int stan::prob::beta_binomial_rng (const int N,
const double alpha,
const double beta,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 572 of file beta_binomial.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_scale_succ , typename T_scale_fail >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_scale_succ,T_scale_fail>::type stan::prob::beta_ccdf_log (const T_y & y,
const T_scale_succ & alpha,
const T_scale_fail & beta 
)
+
+ +

Definition at line 509 of file beta.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_scale_succ , typename T_scale_fail >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_scale_succ,T_scale_fail>::type stan::prob::beta_cdf (const T_y & y,
const T_scale_succ & alpha,
const T_scale_fail & beta 
)
+
+ +

Calculates the beta cumulative distribution function for the given variate and scale variables.

+
Parameters
+ + + + +
yA scalar variate.
alphaPrior sample size.
betaPrior sample size.
+
+
+
Returns
The beta cdf evaluated at the specified arguments.
+
Template Parameters
+ + + + +
T_yType of y.
T_scale_succType of alpha.
T_scale_failType of beta.
+
+
+ +

Definition at line 224 of file beta.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_scale_succ , typename T_scale_fail >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_scale_succ,T_scale_fail>::type stan::prob::beta_cdf_log (const T_y & y,
const T_scale_succ & alpha,
const T_scale_fail & beta 
)
+
+ +

Definition at line 380 of file beta.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_scale_succ , typename T_scale_fail >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_scale_succ,T_scale_fail>::type stan::prob::beta_log (const T_y & y,
const T_scale_succ & alpha,
const T_scale_fail & beta 
)
+
+ +

The log of the beta density for the specified scalar(s) given the specified sample size(s).

+

y, alpha, or beta can each either be scalar or std::vector. Any vector inputs must be the same length.

+

The result log probability is defined to be the sum of the log probabilities for each observation/alpha/beta triple.

+

Prior sample sizes, alpha and beta, must be greater than 0.

+
Parameters
+ + + + +
y(Sequence of) scalar(s).
alpha(Sequence of) prior sample size(s).
beta(Sequence of) prior sample size(s).
+
+
+
Returns
The log of the product of densities.
+
Template Parameters
+ + + + +
T_yType of scalar outcome.
T_scale_succType of prior scale for successes.
T_scale_failType of prior scale for failures.
+
+
+
Error Policy:
See Error Handling Policies for details. Conditions:
    +
  • All parameters must not be NaN.
  • +
  • alpha must be positive and finite.
  • +
  • beta must be positive and finite.
  • +
+
+ +

Definition at line 46 of file beta.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_scale_succ , typename T_scale_fail >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_scale_succ,T_scale_fail>::type stan::prob::beta_log (const T_y & y,
const T_scale_succ & alpha,
const T_scale_fail & beta 
)
+
+inline
+
+ +

Definition at line 205 of file beta.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
double stan::prob::beta_rng (const double alpha,
const double beta,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 635 of file beta.hpp.

+ +
+
+ +
+
+
+template<typename T_n , typename T_N , typename T_prob >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_prob>::type stan::prob::binomial_ccdf_log (const T_n & n,
const T_N & N,
const T_prob & theta 
)
+
+ +

Definition at line 417 of file binomial.hpp.

+ +
+
+ +
+
+
+template<typename T_n , typename T_N , typename T_prob >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_prob>::type stan::prob::binomial_cdf (const T_n & n,
const T_N & N,
const T_prob & theta 
)
+
+ +

Definition at line 258 of file binomial.hpp.

+ +
+
+ +
+
+
+template<typename T_n , typename T_N , typename T_prob >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_prob>::type stan::prob::binomial_cdf_log (const T_n & n,
const T_N & N,
const T_prob & theta 
)
+
+ +

Definition at line 344 of file binomial.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_n , typename T_N , typename T_prob >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_prob>::type stan::prob::binomial_log (const T_n & n,
const T_N & N,
const T_prob & theta 
)
+
+ +

Definition at line 31 of file binomial.hpp.

+ +
+
+ +
+
+
+template<typename T_n , typename T_N , typename T_prob >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_prob>::type stan::prob::binomial_log (const T_n & n,
const T_N & N,
const T_prob & theta 
)
+
+inline
+
+ +

Definition at line 134 of file binomial.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_n , typename T_N , typename T_prob >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_prob>::type stan::prob::binomial_logit_log (const T_n & n,
const T_N & N,
const T_prob & alpha 
)
+
+ +

Definition at line 147 of file binomial.hpp.

+ +
+
+ +
+
+
+template<typename T_n , typename T_N , typename T_prob >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_prob>::type stan::prob::binomial_logit_log (const T_n & n,
const T_N & N,
const T_prob & alpha 
)
+
+inline
+
+ +

Definition at line 248 of file binomial.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
int stan::prob::binomial_rng (const int N,
const double theta,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 491 of file binomial.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_prob >
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_prob>::type stan::prob::categorical_log (int n,
const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > & theta 
)
+
+ +

Definition at line 22 of file categorical.hpp.

+ +
+
+ +
+
+
+template<typename T_prob >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_prob>::type stan::prob::categorical_log (const typename Eigen::Matrix< T_prob, Eigen::Dynamic, 1 >::size_type n,
const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > & theta 
)
+
+inline
+
+ +

Definition at line 62 of file categorical.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_prob >
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_prob>::type stan::prob::categorical_log (const std::vector< int > & ns,
const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > & theta 
)
+
+ +

Definition at line 72 of file categorical.hpp.

+ +
+
+ +
+
+
+template<typename T_prob >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_prob>::type stan::prob::categorical_log (const std::vector< int > & ns,
const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > & theta 
)
+
+inline
+
+ +

Definition at line 128 of file categorical.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_prob >
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_prob>::type stan::prob::categorical_logit_log (int n,
const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > & beta 
)
+
+ +

Definition at line 21 of file categorical_logit.hpp.

+ +
+
+ +
+
+
+template<typename T_prob >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_prob>::type stan::prob::categorical_logit_log (int n,
const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > & beta 
)
+
+inline
+
+ +

Definition at line 48 of file categorical_logit.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_prob >
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_prob>::type stan::prob::categorical_logit_log (const std::vector< int > & ns,
const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > & beta 
)
+
+ +

Definition at line 56 of file categorical_logit.hpp.

+ +
+
+ +
+
+
+template<typename T_prob >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_prob>::type stan::prob::categorical_logit_log (const std::vector< int > & ns,
const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > & beta 
)
+
+inline
+
+ +

Definition at line 95 of file categorical_logit.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
int stan::prob::categorical_rng (const Eigen::Matrix< double, Eigen::Dynamic, 1 > & theta,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 135 of file categorical.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale>::type stan::prob::cauchy_ccdf_log (const T_y & y,
const T_loc & mu,
const T_scale & sigma 
)
+
+ +

Definition at line 338 of file cauchy.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale>::type stan::prob::cauchy_cdf (const T_y & y,
const T_loc & mu,
const T_scale & sigma 
)
+
+ +

Calculates the cauchy cumulative distribution function for the given variate, location, and scale.

+

$\frac{1}{\pi}\arctan\left(\frac{y-\mu}{\sigma}\right) + \frac{1}{2}$

+

Errors are configured by policy. All variables must be finite and the scale must be strictly greater than zero.

+
Parameters
+ + + + +
yA scalar variate.
muThe location parameter.
sigmaThe scale parameter.
+
+
+
Returns
+ +

Definition at line 162 of file cauchy.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale>::type stan::prob::cauchy_cdf_log (const T_y & y,
const T_loc & mu,
const T_scale & sigma 
)
+
+ +

Definition at line 265 of file cauchy.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_loc , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale>::type stan::prob::cauchy_log (const T_y & y,
const T_loc & mu,
const T_scale & sigma 
)
+
+ +

The log of the Cauchy density for the specified scalar(s) given the specified location parameter(s) and scale parameter(s).

+

y, mu, or sigma can each either be scalar or std::vector. Any vector inputs must be the same length.

+

The result log probability is defined to be the sum of the log probabilities for each observation/mu/sigma triple.

+
Parameters
+ + + + +
y(Sequence of) scalar(s).
mu(Sequence of) location(s).
sigma(Sequence of) scale(s).
+
+
+
Returns
The log of the product of densities.
+
Template Parameters
+ + + + +
T_yType of scalar outcome.
T_locType of location.
T_scaleType of scale.
+
+
+
Error Policy:
See Error Handling Policies for details. Conditions:
    +
  • All parameters must not be NaN.
  • +
  • sigma must be positive.
  • +
+
+ +

Definition at line 40 of file cauchy.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale>::type stan::prob::cauchy_log (const T_y & y,
const T_loc & mu,
const T_scale & sigma 
)
+
+inline
+
+ +

Definition at line 140 of file cauchy.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
double stan::prob::cauchy_rng (const double mu,
const double sigma,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 410 of file cauchy.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_dof >
+ + + + + + + + + + + + + + + + + + +
return_type<T_y,T_dof>::type stan::prob::chi_square_ccdf_log (const T_y & y,
const T_dof & nu 
)
+
+ +

Definition at line 367 of file chi_square.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_dof >
+ + + + + + + + + + + + + + + + + + +
return_type<T_y,T_dof>::type stan::prob::chi_square_cdf (const T_y & y,
const T_dof & nu 
)
+
+ +

Calculates the chi square cumulative distribution function for the given variate and degrees of freedom.

+

y A scalar variate. nu Degrees of freedom.

+
Returns
The cdf of the chi square distribution
+ +

Definition at line 160 of file chi_square.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_dof >
+ + + + + + + + + + + + + + + + + + +
return_type<T_y,T_dof>::type stan::prob::chi_square_cdf_log (const T_y & y,
const T_dof & nu 
)
+
+ +

Definition at line 267 of file chi_square.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_dof >
+ + + + + + + + + + + + + + + + + + +
return_type<T_y,T_dof>::type stan::prob::chi_square_log (const T_y & y,
const T_dof & nu 
)
+
+ +

The log of a chi-squared density for y with the specified degrees of freedom parameter.

+

The degrees of freedom prarameter must be greater than 0. y must be greater than or equal to 0.

+

+\begin{eqnarray*} y &\sim& \chi^2_\nu \\ \log (p (y \,|\, \nu)) &=& \log \left( \frac{2^{-\nu / 2}}{\Gamma (\nu / 2)} y^{\nu / 2 - 1} \exp^{- y / 2} \right) \\ &=& - \frac{\nu}{2} \log(2) - \log (\Gamma (\nu / 2)) + (\frac{\nu}{2} - 1) \log(y) - \frac{y}{2} \\ & & \mathrm{ where } \; y \ge 0 \end{eqnarray*} +

+
Parameters
+ + + +
yA scalar variable.
nuDegrees of freedom.
+
+
+
Exceptions
+ + + +
std::domain_errorif nu is not greater than or equal to 0
std::domain_errorif y is not greater than or equal to 0.
+
+
+
Template Parameters
+ + + +
T_yType of scalar.
T_dofType of degrees of freedom.
+
+
+ +

Definition at line 43 of file chi_square.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_dof >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
return_type<T_y,T_dof>::type stan::prob::chi_square_log (const T_y & y,
const T_dof & nu 
)
+
+inline
+
+ +

Definition at line 145 of file chi_square.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
double stan::prob::chi_square_rng (const double nu,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 467 of file chi_square.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> stan::prob::cholesky_factor_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > & x,
int M,
int N 
)
+
+ +

Return the Cholesky factor of the specified size read from the specified vector.

+

A total of (N choose 2) + N + (M - N) * N elements are required to read an M by N Cholesky factor.

+
Template Parameters
+ + +
TType of scalars in matrix
+
+
+
Parameters
+ + + + +
xVector of unconstrained values
MNumber of rows
NNumber of columns
+
+
+
Returns
Cholesky factor
+ +

Definition at line 1334 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> stan::prob::cholesky_factor_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > & x,
int M,
int N,
T & lp 
)
+
+ +

Return the Cholesky factor of the specified size read from the specified vector and increment the specified log probability reference with the log Jacobian adjustment of the transform.

+

A total of (N choose 2) + N + N * (M - N) free parameters are required to read an M by N Cholesky factor.

+
Template Parameters
+ + +
TType of scalars in matrix
+
+
+
Parameters
+ + + + + +
xVector of unconstrained values
MNumber of rows
NNumber of columns
lpLog probability that is incremented with the log Jacobian
+
+
+
Returns
Cholesky factor
+ +

Definition at line 1376 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,1> stan::prob::cholesky_factor_free (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & y)
+
+ +

Return the unconstrained vector of parameters correspdonding to the specified Cholesky factor.

+

A Cholesky factor must be lower triangular and have positive diagonal elements.

+
Parameters
+ + +
yCholesky factor.
+
+
+
Returns
Unconstrained parameters for Cholesky factor.
+
Exceptions
+ + +
std::domain_errorIf the matrix is not a Cholesky factor.
+
+
+ +

Definition at line 1406 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
T stan::prob::corr_constrain (const T x)
+
+inline
+
+ +

Return the result of transforming the specified scalar to have a valid correlation value between -1 and 1 (inclusive).

+

The transform used is the hyperbolic tangent function,

+

$f(x) = \tanh x = \frac{\exp(2x) - 1}{\exp(2x) + 1}$.

+
Parameters
+ + +
xScalar input.
+
+
+
Returns
Result of transforming the input to fall between -1 and 1.
+
Template Parameters
+ + +
TType of scalar.
+
+
+ +

Definition at line 929 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
T stan::prob::corr_constrain (const T x,
T & lp 
)
+
+inline
+
+ +

Return the result of transforming the specified scalar to have a valid correlation value between -1 and 1 (inclusive).

+

The transform used is as specified for corr_constrain(T). The log absolute Jacobian determinant is

+

$\log | \frac{d}{dx} \tanh x | = \log (1 - \tanh^2 x)$.

+
Template Parameters
+ + +
TType of scalar.
+
+
+ +

Definition at line 947 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
T stan::prob::corr_free (const T y)
+
+inline
+
+ +

Return the unconstrained scalar that when transformed to a valid correlation produces the specified value.

+

This function inverts the transform defined for corr_constrain(T), which is the inverse hyperbolic tangent,

+

$ f^{-1}(y) = \mbox{atanh}\, y = \frac{1}{2} \log \frac{y + 1}{y - 1}$.

+
Parameters
+ + +
yCorrelation scalar input.
+
+
+
Returns
Free scalar that transforms to the specified input.
+
Template Parameters
+ + +
TType of scalar.
+
+
+ +

Definition at line 972 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> stan::prob::corr_matrix_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > & x,
typename Eigen::Matrix< T, Eigen::Dynamic, 1 >::size_type k 
)
+
+ +

Return the correlation matrix of the specified dimensionality derived from the specified vector of unconstrained values.

+

The input vector must be of length ${k \choose 2} = \frac{k(k-1)}{2}$. The values in the input vector represent unconstrained (partial) correlations among the dimensions.

+

The transform based on partial correlations is as specified in

+
    +
  • +Lewandowski, Daniel, Dorota Kurowicka, and Harry Joe. 2009. Generating random correlation matrices based on vines and extended onion method. Journal of Multivariate Analysis 100:1989–-2001.
  • +
+

The free vector entries are first constrained to be valid correlation values using corr_constrain(T).

+
Parameters
+ + + +
xVector of unconstrained partial correlations.
kDimensionality of returned correlation matrix.
+
+
+
Template Parameters
+ + +
TType of scalar.
+
+
+
Exceptions
+ + +
std::invalid_argumentif x is not a valid correlation matrix.
+
+
+ +

Definition at line 1456 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> stan::prob::corr_matrix_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > & x,
typename Eigen::Matrix< T, Eigen::Dynamic, 1 >::size_type k,
T & lp 
)
+
+ +

Return the correlation matrix of the specified dimensionality derived from the specified vector of unconstrained values.

+

The input vector must be of length ${k \choose 2} = \frac{k(k-1)}{2}$. The values in the input vector represent unconstrained (partial) correlations among the dimensions.

+

The transform is as specified for corr_matrix_constrain(Matrix,size_t); the paper it cites also defines the Jacobians for correlation inputs, which are composed with the correlation constrained Jacobians defined in corr_constrain(T,double) for this function.

+
Parameters
+ + + + +
xVector of unconstrained partial correlations.
kDimensionality of returned correlation matrix.
lpLog probability reference to increment.
+
+
+
Template Parameters
+ + +
TType of scalar.
+
+
+ +

Definition at line 1489 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,1> stan::prob::corr_matrix_free (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & y)
+
+ +

Return the vector of unconstrained partial correlations that define the specified correlation matrix when transformed.

+

The constraining transform is defined as for corr_matrix_constrain(Matrix,size_t). The inverse transform in this function is simpler in that it only needs to compute the $k \choose 2$ partial correlations and then free those.

+
Parameters
+ + +
yThe correlation matrix to free.
+
+
+
Returns
Vector of unconstrained values that produce the specified correlation matrix when transformed.
+
Template Parameters
+ + +
TType of scalar.
+
+
+
Exceptions
+ + + +
std::domain_errorif the correlation matrix has no elements or is not a square matrix.
std::runtime_errorif the correlation matrix cannot be factorized by factor_cov_matrix() or if the sds returned by factor_cov_matrix() on log scale are unconstrained.
+
+
+ +

Definition at line 1524 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> stan::prob::cov_matrix_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > & x,
typename Eigen::Matrix< T, Eigen::Dynamic, 1 >::size_type K 
)
+
+ +

Return the symmetric, positive-definite matrix of dimensions K by K resulting from transforming the specified finite vector of size K plus (K choose 2).

+

See cov_matrix_free() for the inverse transform.

+
Parameters
+ + + +
xThe vector to convert to a covariance matrix.
KThe number of rows and columns of the resulting covariance matrix.
+
+
+
Exceptions
+ + +
std::domain_errorif (x.size() != K + (K choose 2)).
+
+
+ +

Definition at line 1567 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> stan::prob::cov_matrix_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > & x,
typename Eigen::Matrix< T, Eigen::Dynamic, 1 >::size_type K,
T & lp 
)
+
+ +

Return the symmetric, positive-definite matrix of dimensions K by K resulting from transforming the specified finite vector of size K plus (K choose 2).

+

See cov_matrix_free() for the inverse transform.

+
Parameters
+ + + + +
xThe vector to convert to a covariance matrix.
KThe dimensions of the resulting covariance matrix.
lpReference
+
+
+
Exceptions
+ + +
std::domain_errorif (x.size() != K + (K choose 2)).
+
+
+ +

Definition at line 1601 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> stan::prob::cov_matrix_constrain_lkj (const Eigen::Matrix< T, Eigen::Dynamic, 1 > & x,
size_t k 
)
+
+ +

Return the covariance matrix of the specified dimensionality derived from constraining the specified vector of unconstrained values.

+

The input vector must be of length $k \choose 2 + k$. The first $k \choose 2$ values in the input represent unconstrained (partial) correlations and the last $k$ are unconstrained standard deviations of the dimensions.

+

The transform scales the correlation matrix transform defined in corr_matrix_constrain(Matrix,size_t) with the constrained deviations.

+
Parameters
+ + + +
xInput vector of unconstrained partial correlations and standard deviations.
kDimensionality of returned covariance matrix.
+
+
+
Returns
Covariance matrix derived from the unconstrained partial correlations and deviations.
+
Template Parameters
+ + +
TType of scalar.
+
+
+ +

Definition at line 1696 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> stan::prob::cov_matrix_constrain_lkj (const Eigen::Matrix< T, Eigen::Dynamic, 1 > & x,
size_t k,
T & lp 
)
+
+ +

Return the covariance matrix of the specified dimensionality derived from constraining the specified vector of unconstrained values and increment the specified log probability reference with the log absolute Jacobian determinant.

+

The transform is defined as for cov_matrix_constrain(Matrix,size_t).

+

The log absolute Jacobian determinant is derived by composing the log absolute Jacobian determinant for the underlying correlation matrix as defined in cov_matrix_constrain(Matrix,size_t,T&) with the Jacobian of the transfrom of the correlation matrix into a covariance matrix by scaling by standard deviations.

+
Parameters
+ + + + +
xInput vector of unconstrained partial correlations and standard deviations.
kDimensionality of returned covariance matrix.
lpLog probability reference to increment.
+
+
+
Returns
Covariance matrix derived from the unconstrained partial correlations and deviations.
+
Template Parameters
+ + +
TType of scalar.
+
+
+ +

Definition at line 1735 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,1> stan::prob::cov_matrix_free (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & y)
+
+ +

The covariance matrix derived from the symmetric view of the lower-triangular view of the K by K specified matrix is freed to return a vector of size K + (K choose 2).

+

This is the inverse of the cov_matrix_constrain() function so that for any finite vector x of size K

+
    +
  • (K choose 2),
  • +
+

x == cov_matrix_free(cov_matrix_constrain(x,K)).

+

In order for this round-trip to work (and really for this function to work), the symmetric view of its lower-triangular view must be positive definite.

+
Parameters
+ + +
yMatrix of dimensions K by K such that he symmetric view of the lower-triangular view is positive definite.
+
+
+
Returns
Vector of size K plus (K choose 2) in (-inf,inf) that produces
+
Exceptions
+ + +
std::domain_errorif y is not square, has zero dimensionality, or has a non-positive diagonal element.
+
+
+ +

Definition at line 1649 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,1> stan::prob::cov_matrix_free_lkj (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & y)
+
+ +

Return the vector of unconstrained partial correlations and deviations that transform to the specified covariance matrix.

+

The constraining transform is defined as for cov_matrix_constrain(Matrix,size_t). The inverse first factors out the deviations, then applies the freeing transfrom of corr_matrix_free(Matrix&).

+
Parameters
+ + +
yCovariance matrix to free.
+
+
+
Returns
Vector of unconstrained values that transforms to the specified covariance matrix.
+
Template Parameters
+ + +
TType of scalar.
+
+
+
Exceptions
+ + + +
std::domain_errorif the correlation matrix has no elements or is not a square matrix.
std::runtime_errorif the correlation matrix cannot be factorized by factor_cov_matrix()
+
+
+ +

Definition at line 1769 of file transform.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_prob , typename T_prior_sample_size >
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_prob,T_prior_sample_size>::type stan::prob::dirichlet_log (const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > & theta,
const Eigen::Matrix< T_prior_sample_size, Eigen::Dynamic, 1 > & alpha 
)
+
+ +

The log of the Dirichlet density for the given theta and a vector of prior sample sizes, alpha.

+

Each element of alpha must be greater than 0. Each element of theta must be greater than or 0. Theta sums to 1.

+

+\begin{eqnarray*} \theta &\sim& \mbox{\sf{Dirichlet}} (\alpha_1, \ldots, \alpha_k) \\ \log (p (\theta \,|\, \alpha_1, \ldots, \alpha_k) ) &=& \log \left( \frac{\Gamma(\alpha_1 + \cdots + \alpha_k)}{\Gamma(\alpha_1) \cdots \Gamma(\alpha_k)} \theta_1^{\alpha_1 - 1} \cdots \theta_k^{\alpha_k - 1} \right) \\ &=& \log (\Gamma(\alpha_1 + \cdots + \alpha_k)) - \log(\Gamma(\alpha_1)) - \cdots - \log(\Gamma(\alpha_k)) + (\alpha_1 - 1) \log (\theta_1) + \cdots + (\alpha_k - 1) \log (\theta_k) \end{eqnarray*} +

+
Parameters
+ + + +
thetaA scalar vector.
alphaPrior sample sizes.
+
+
+
Returns
The log of the Dirichlet density.
+
Exceptions
+ + + + +
std::domain_errorif any element of alpha is less than or equal to 0.
std::domain_errorif any element of theta is less than 0.
std::domain_errorif the sum of theta is not 1.
+
+
+
Template Parameters
+ + + +
T_probType of scalar.
T_prior_sample_sizeType of prior sample sizes.
+
+
+ +

Definition at line 46 of file dirichlet.hpp.

+ +
+
+ +
+
+
+template<typename T_prob , typename T_prior_sample_size >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_prob,T_prior_sample_size>::type stan::prob::dirichlet_log (const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > & theta,
const Eigen::Matrix< T_prior_sample_size, Eigen::Dynamic, 1 > & alpha 
)
+
+inline
+
+ +

Definition at line 80 of file dirichlet.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::VectorXd stan::prob::dirichlet_rng (const Eigen::Matrix< double, Eigen::Dynamic, 1 > & alpha,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 87 of file dirichlet.hpp.

+ +
+
+ +
+
+
+template<typename T_shape >
+ + + + + + + + + + + + + + + + + + +
T_shape stan::prob::do_lkj_constant (const T_shape & eta,
const unsigned int & K 
)
+
+ +

Definition at line 15 of file lkj_corr.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale>::type stan::prob::double_exponential_ccdf_log (const T_y & y,
const T_loc & mu,
const T_scale & sigma 
)
+
+ +

Definition at line 314 of file double_exponential.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale>::type stan::prob::double_exponential_cdf (const T_y & y,
const T_loc & mu,
const T_scale & sigma 
)
+
+ +

Calculates the double exponential cumulative density function.

+

$ f(y|\mu,\sigma) = \begin{cases} \ \frac{1}{2} \exp\left(\frac{y-\mu}{\sigma}\right), \mbox{if } y < \mu \\ 1 - \frac{1}{2} \exp\left(-\frac{y-\mu}{\sigma}\right), \mbox{if } y \ge \mu \ \end{cases}$

+
Parameters
+ + + + +
yA scalar variate.
muThe location parameter.
sigmaThe scale parameter.
+
+
+
Returns
The cumulative density function.
+ +

Definition at line 150 of file double_exponential.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale>::type stan::prob::double_exponential_cdf_log (const T_y & y,
const T_loc & mu,
const T_scale & sigma 
)
+
+ +

Definition at line 232 of file double_exponential.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_loc , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale>::type stan::prob::double_exponential_log (const T_y & y,
const T_loc & mu,
const T_scale & sigma 
)
+
+ +

Definition at line 27 of file double_exponential.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale>::type stan::prob::double_exponential_log (const T_y & y,
const T_loc & mu,
const T_scale & sigma 
)
+
+ +

Definition at line 129 of file double_exponential.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
double stan::prob::double_exponential_rng (const double mu,
const double sigma,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 396 of file double_exponential.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale , typename T_inv_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale,T_inv_scale>::type stan::prob::exp_mod_normal_ccdf_log (const T_y & y,
const T_loc & mu,
const T_scale & sigma,
const T_inv_scale & lambda 
)
+
+ +

Definition at line 389 of file exp_mod_normal.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale , typename T_inv_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale,T_inv_scale>::type stan::prob::exp_mod_normal_cdf (const T_y & y,
const T_loc & mu,
const T_scale & sigma,
const T_inv_scale & lambda 
)
+
+ +

Definition at line 151 of file exp_mod_normal.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale , typename T_inv_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale,T_inv_scale>::type stan::prob::exp_mod_normal_cdf_log (const T_y & y,
const T_loc & mu,
const T_scale & sigma,
const T_inv_scale & lambda 
)
+
+ +

Definition at line 274 of file exp_mod_normal.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_loc , typename T_scale , typename T_inv_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale, T_inv_scale>::type stan::prob::exp_mod_normal_log (const T_y & y,
const T_loc & mu,
const T_scale & sigma,
const T_inv_scale & lambda 
)
+
+ +

Definition at line 26 of file exp_mod_normal.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale , typename T_inv_scale >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale, T_inv_scale>::type stan::prob::exp_mod_normal_log (const T_y & y,
const T_loc & mu,
const T_scale & sigma,
const T_inv_scale & lambda 
)
+
+inline
+
+ +

Definition at line 143 of file exp_mod_normal.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
double stan::prob::exp_mod_normal_rng (const double mu,
const double sigma,
const double lambda,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 502 of file exp_mod_normal.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_inv_scale >
+ + + + + + + + + + + + + + + + + + +
return_type<T_y,T_inv_scale>::type stan::prob::exponential_ccdf_log (const T_y & y,
const T_inv_scale & beta 
)
+
+ +

Definition at line 239 of file exponential.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_inv_scale >
+ + + + + + + + + + + + + + + + + + +
return_type<T_y,T_inv_scale>::type stan::prob::exponential_cdf (const T_y & y,
const T_inv_scale & beta 
)
+
+ +

Calculates the exponential cumulative distribution function for the given y and beta.

+

Inverse scale parameter must be greater than 0. y must be greater than or equal to 0.

+
Parameters
+ + + +
yA scalar variable.
betaInverse scale parameter.
+
+
+
Template Parameters
+ + + + +
T_yType of scalar.
T_inv_scaleType of inverse scale.
PolicyError-handling policy.
+
+
+ +

Definition at line 129 of file exponential.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_inv_scale >
+ + + + + + + + + + + + + + + + + + +
return_type<T_y,T_inv_scale>::type stan::prob::exponential_cdf_log (const T_y & y,
const T_inv_scale & beta 
)
+
+ +

Definition at line 188 of file exponential.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_inv_scale >
+ + + + + + + + + + + + + + + + + + +
return_type<T_y,T_inv_scale>::type stan::prob::exponential_log (const T_y & y,
const T_inv_scale & beta 
)
+
+ +

The log of an exponential density for y with the specified inverse scale parameter.

+

Inverse scale parameter must be greater than 0. y must be greater than or equal to 0.

+

+\begin{eqnarray*} y &\sim& \mbox{\sf{Expon}}(\beta) \\ \log (p (y \,|\, \beta) ) &=& \log \left( \beta \exp^{-\beta y} \right) \\ &=& \log (\beta) - \beta y \\ & & \mathrm{where} \; y > 0 \end{eqnarray*} +

+
Parameters
+ + + +
yA scalar variable.
betaInverse scale parameter.
+
+
+
Exceptions
+ + + +
std::domain_errorif beta is not greater than 0.
std::domain_errorif y is not greater than or equal to 0.
+
+
+
Template Parameters
+ + + +
T_yType of scalar.
T_inv_scaleType of inverse scale.
+
+
+ +

Definition at line 46 of file exponential.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_inv_scale >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
return_type<T_y,T_inv_scale>::type stan::prob::exponential_log (const T_y & y,
const T_inv_scale & beta 
)
+
+inline
+
+ +

Definition at line 108 of file exponential.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
double stan::prob::exponential_rng (const double beta,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 288 of file exponential.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::prob::factor_cov_matrix (Eigen::Array< T, Eigen::Dynamic, 1 > & CPCs,
Eigen::Array< T, Eigen::Dynamic, 1 > & sds,
const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > & Sigma 
)
+
+ +

This function is intended to make starting values, given a covariance matrix Sigma.

+

The transformations are hard coded as log for standard deviations and Fisher transformations (atanh()) of CPCs

+
Parameters
+ + + + +
CPCsfill this unbounded
sdsfill this unbounded
Sigmacovariance matrix
+
+
+
Returns
false if any of the diagonals of Sigma are 0
+ +

Definition at line 45 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_shape , typename T_inv_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_shape,T_inv_scale>::type stan::prob::gamma_ccdf_log (const T_y & y,
const T_shape & alpha,
const T_inv_scale & beta 
)
+
+ +

Definition at line 420 of file gamma.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_shape , typename T_inv_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_shape,T_inv_scale>::type stan::prob::gamma_cdf (const T_y & y,
const T_shape & alpha,
const T_inv_scale & beta 
)
+
+ +

The cumulative density function for a gamma distribution for y with the specified shape and inverse scale parameters.

+
Parameters
+ + + + +
yA scalar variable.
alphaShape parameter.
betaInverse scale parameter.
+
+
+
Exceptions
+ + + + +
std::domain_errorif alpha is not greater than 0.
std::domain_errorif beta is not greater than 0.
std::domain_errorif y is not greater than or equal to 0.
+
+
+
Template Parameters
+ + + + +
T_yType of scalar.
T_shapeType of shape.
T_inv_scaleType of inverse scale.
+
+
+ +

Definition at line 184 of file gamma.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_shape , typename T_inv_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_shape,T_inv_scale>::type stan::prob::gamma_cdf_log (const T_y & y,
const T_shape & alpha,
const T_inv_scale & beta 
)
+
+ +

Definition at line 307 of file gamma.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_shape , typename T_inv_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_shape,T_inv_scale>::type stan::prob::gamma_log (const T_y & y,
const T_shape & alpha,
const T_inv_scale & beta 
)
+
+ +

The log of a gamma density for y with the specified shape and inverse scale parameters.

+

Shape and inverse scale parameters must be greater than 0. y must be greater than or equal to 0.

+

+\begin{eqnarray*} y &\sim& \mbox{\sf{Gamma}}(\alpha, \beta) \\ \log (p (y \,|\, \alpha, \beta) ) &=& \log \left( \frac{\beta^\alpha}{\Gamma(\alpha)} y^{\alpha - 1} \exp^{- \beta y} \right) \\ &=& \alpha \log(\beta) - \log(\Gamma(\alpha)) + (\alpha - 1) \log(y) - \beta y\\ & & \mathrm{where} \; y > 0 \end{eqnarray*} +

+
Parameters
+ + + + +
yA scalar variable.
alphaShape parameter.
betaInverse scale parameter.
+
+
+
Exceptions
+ + + + +
std::domain_errorif alpha is not greater than 0.
std::domain_errorif beta is not greater than 0.
std::domain_errorif y is not greater than or equal to 0.
+
+
+
Template Parameters
+ + + + +
T_yType of scalar.
T_shapeType of shape.
T_inv_scaleType of inverse scale.
+
+
+ +

Definition at line 46 of file gamma.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_shape , typename T_inv_scale >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_shape,T_inv_scale>::type stan::prob::gamma_log (const T_y & y,
const T_shape & alpha,
const T_inv_scale & beta 
)
+
+inline
+
+ +

Definition at line 163 of file gamma.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
double stan::prob::gamma_rng (const double alpha,
const double beta,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 533 of file gamma.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_F , typename T_G , typename T_V , typename T_W , typename T_m0 , typename T_C0 >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
return_type< T_y, typename return_type<T_F,T_G,T_V,T_W,T_m0,T_C0>::type >::type stan::prob::gaussian_dlm_obs_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & y,
const Eigen::Matrix< T_F, Eigen::Dynamic, Eigen::Dynamic > & F,
const Eigen::Matrix< T_G, Eigen::Dynamic, Eigen::Dynamic > & G,
const Eigen::Matrix< T_V, Eigen::Dynamic, Eigen::Dynamic > & V,
const Eigen::Matrix< T_W, Eigen::Dynamic, Eigen::Dynamic > & W,
const Eigen::Matrix< T_m0, Eigen::Dynamic, 1 > & m0,
const Eigen::Matrix< T_C0, Eigen::Dynamic, Eigen::Dynamic > & C0 
)
+
+ +

The log of a Gaussian dynamic linear model (GDLM).

+

This distribution is equivalent to, for $t = 1:T$,

+

+\begin{eqnarray*} y_t & \sim N(F' \theta_t, V) \\ \theta_t & \sim N(G \theta_{t-1}, W) \\ \theta_0 & \sim N(m_0, C_0) \end{eqnarray*} +

+

If V is a vector, then the Kalman filter is applied sequentially.

+
Parameters
+ + + + + + + + +
yA r x T matrix of observations. Rows are variables, columns are observations.
FA n x r matrix. The design matrix.
GA n x n matrix. The transition matrix.
VA r x r matrix. The observation covariance matrix.
WA n x n matrix. The state covariance matrix.
m0A n x 1 matrix. The mean vector of the distribution of the initial state.
C0A n x n matrix. The covariance matrix of the distribution of the initial state.
+
+
+
Returns
The log of the joint density of the GDLM.
+
Exceptions
+ + +
std::domain_errorif a matrix in the Kalman filter is not positive semi-definite.
+
+
+
Template Parameters
+ + + + + + + + +
T_yType of scalar.
T_FType of design matrix.
T_GType of transition matrix.
T_VType of observation covariance matrix.
T_WType of state covariance matrix.
T_m0Type of initial state mean vector.
T_C0Type of initial state covariance matrix.
+
+
+ +

Definition at line 81 of file gaussian_dlm_obs.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_F , typename T_G , typename T_V , typename T_W , typename T_m0 , typename T_C0 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
return_type< T_y, typename return_type<T_F,T_G,T_V,T_W,T_m0,T_C0>::type >::type stan::prob::gaussian_dlm_obs_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & y,
const Eigen::Matrix< T_F, Eigen::Dynamic, Eigen::Dynamic > & F,
const Eigen::Matrix< T_G, Eigen::Dynamic, Eigen::Dynamic > & G,
const Eigen::Matrix< T_V, Eigen::Dynamic, Eigen::Dynamic > & V,
const Eigen::Matrix< T_W, Eigen::Dynamic, Eigen::Dynamic > & W,
const Eigen::Matrix< T_m0, Eigen::Dynamic, 1 > & m0,
const Eigen::Matrix< T_C0, Eigen::Dynamic, Eigen::Dynamic > & C0 
)
+
+inline
+
+ +

Definition at line 259 of file gaussian_dlm_obs.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_F , typename T_G , typename T_V , typename T_W , typename T_m0 , typename T_C0 >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
return_type< T_y, typename return_type<T_F,T_G,T_V,T_W,T_m0,T_C0>::type >::type stan::prob::gaussian_dlm_obs_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & y,
const Eigen::Matrix< T_F, Eigen::Dynamic, Eigen::Dynamic > & F,
const Eigen::Matrix< T_G, Eigen::Dynamic, Eigen::Dynamic > & G,
const Eigen::Matrix< T_V, Eigen::Dynamic, 1 > & V,
const Eigen::Matrix< T_W, Eigen::Dynamic, Eigen::Dynamic > & W,
const Eigen::Matrix< T_m0, Eigen::Dynamic, 1 > & m0,
const Eigen::Matrix< T_C0, Eigen::Dynamic, Eigen::Dynamic > & C0 
)
+
+ +

The log of a Gaussian dynamic linear model (GDLM) with uncorrelated observation disturbances.

+

This distribution is equivalent to, for $t = 1:T$,

+

+\begin{eqnarray*} y_t & \sim N(F' \theta_t, diag(V)) \\ \theta_t & \sim N(G \theta_{t-1}, W) \\ \theta_0 & \sim N(m_0, C_0) \end{eqnarray*} +

+

If V is a vector, then the Kalman filter is applied sequentially.

+
Parameters
+ + + + + + + + +
yA r x T matrix of observations. Rows are variables, columns are observations.
FA n x r matrix. The design matrix.
GA n x n matrix. The transition matrix.
VA size r vector. The diagonal of the observation covariance matrix.
WA n x n matrix. The state covariance matrix.
m0A n x 1 matrix. The mean vector of the distribution of the initial state.
C0A n x n matrix. The covariance matrix of the distribution of the initial state.
+
+
+
Returns
The log of the joint density of the GDLM.
+
Exceptions
+ + +
std::domain_errorif a matrix in the Kalman filter is not semi-positive definite.
+
+
+
Template Parameters
+ + + + + + + + +
T_yType of scalar.
T_FType of design matrix.
T_GType of transition matrix.
T_VType of observation variances
T_WType of state covariance matrix.
T_m0Type of initial state mean vector.
T_C0Type of initial state covariance matrix.
+
+
+ +

Definition at line 313 of file gaussian_dlm_obs.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_F , typename T_G , typename T_V , typename T_W , typename T_m0 , typename T_C0 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
return_type< T_y, typename return_type<T_F,T_G,T_V,T_W,T_m0,T_C0>::type >::type stan::prob::gaussian_dlm_obs_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & y,
const Eigen::Matrix< T_F, Eigen::Dynamic, Eigen::Dynamic > & F,
const Eigen::Matrix< T_G, Eigen::Dynamic, Eigen::Dynamic > & G,
const Eigen::Matrix< T_V, Eigen::Dynamic, 1 > & V,
const Eigen::Matrix< T_W, Eigen::Dynamic, Eigen::Dynamic > & W,
const Eigen::Matrix< T_m0, Eigen::Dynamic, 1 > & m0,
const Eigen::Matrix< T_C0, Eigen::Dynamic, Eigen::Dynamic > & C0 
)
+
+inline
+
+ +

Definition at line 496 of file gaussian_dlm_obs.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale>::type stan::prob::gumbel_ccdf_log (const T_y & y,
const T_loc & mu,
const T_scale & beta 
)
+
+ +

Definition at line 249 of file gumbel.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale>::type stan::prob::gumbel_cdf (const T_y & y,
const T_loc & mu,
const T_scale & beta 
)
+
+ +

Definition at line 118 of file gumbel.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale>::type stan::prob::gumbel_cdf_log (const T_y & y,
const T_loc & mu,
const T_scale & beta 
)
+
+ +

Definition at line 191 of file gumbel.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_loc , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale>::type stan::prob::gumbel_log (const T_y & y,
const T_loc & mu,
const T_scale & beta 
)
+
+ +

Definition at line 21 of file gumbel.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale>::type stan::prob::gumbel_log (const T_y & y,
const T_loc & mu,
const T_scale & beta 
)
+
+inline
+
+ +

Definition at line 112 of file gumbel.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
double stan::prob::gumbel_rng (const double mu,
const double beta,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 309 of file gumbel.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_n , typename T_N , typename T_a , typename T_b >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
double stan::prob::hypergeometric_log (const T_n & n,
const T_N & N,
const T_a & a,
const T_b & b 
)
+
+ +

Definition at line 25 of file hypergeometric.hpp.

+ +
+
+ +
+
+
+template<typename T_n , typename T_N , typename T_a , typename T_b >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
double stan::prob::hypergeometric_log (const T_n & n,
const T_N & N,
const T_a & a,
const T_b & b 
)
+
+inline
+
+ +

Definition at line 84 of file hypergeometric.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
int stan::prob::hypergeometric_rng (const int N,
const int a,
const int b,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 93 of file hypergeometric.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
T stan::prob::identity_constrain (x)
+
+inline
+
+ +

Returns the result of applying the identity constraint transform to the input.

+

This method is effectively a no-op and is mainly useful as a placeholder in auto-generated code.

+
Parameters
+ + +
xFree scalar.
+
+
+
Returns
Transformed input.
+
Template Parameters
+ + +
TType of scalar.
+
+
+ +

Definition at line 373 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
T stan::prob::identity_constrain (const T x,
T &  
)
+
+inline
+
+ +

Returns the result of applying the identity constraint transform to the input and increments the log probability reference with the log absolute Jacobian determinant.

+

This method is effectively a no-op and mainly useful as a placeholder in auto-generated code.

+
Parameters
+ + +
xFree scalar. lp Reference to log probability.
+
+
+
Returns
Transformed input.
+
Template Parameters
+ + +
TType of scalar.
+
+
+ +

Definition at line 392 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
T stan::prob::identity_free (const T y)
+
+inline
+
+ +

Returns the result of applying the inverse of the identity constraint transform to the input.

+

This method is effectively a no-op and mainly useful as a placeholder in auto-generated code.

+
Parameters
+ + +
yConstrained scalar.
+
+
+
Returns
The input.
+
Template Parameters
+ + +
TType of scalar.
+
+
+ +

Definition at line 409 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_dof >
+ + + + + + + + + + + + + + + + + + +
return_type<T_y,T_dof>::type stan::prob::inv_chi_square_ccdf_log (const T_y & y,
const T_dof & nu 
)
+
+ +

Definition at line 351 of file inv_chi_square.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_dof >
+ + + + + + + + + + + + + + + + + + +
return_type<T_y,T_dof>::type stan::prob::inv_chi_square_cdf (const T_y & y,
const T_dof & nu 
)
+
+ +

Definition at line 142 of file inv_chi_square.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_dof >
+ + + + + + + + + + + + + + + + + + +
return_type<T_y,T_dof>::type stan::prob::inv_chi_square_cdf_log (const T_y & y,
const T_dof & nu 
)
+
+ +

Definition at line 251 of file inv_chi_square.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_dof >
+ + + + + + + + + + + + + + + + + + +
return_type<T_y,T_dof>::type stan::prob::inv_chi_square_log (const T_y & y,
const T_dof & nu 
)
+
+ +

The log of an inverse chi-squared density for y with the specified degrees of freedom parameter.

+

The degrees of freedom prarameter must be greater than 0. y must be greater than 0.

+

+\begin{eqnarray*} y &\sim& \mbox{\sf{Inv-}}\chi^2_\nu \\ \log (p (y \,|\, \nu)) &=& \log \left( \frac{2^{-\nu / 2}}{\Gamma (\nu / 2)} y^{- (\nu / 2 + 1)} \exp^{-1 / (2y)} \right) \\ &=& - \frac{\nu}{2} \log(2) - \log (\Gamma (\nu / 2)) - (\frac{\nu}{2} + 1) \log(y) - \frac{1}{2y} \\ & & \mathrm{ where } \; y > 0 \end{eqnarray*} +

+
Parameters
+ + + +
yA scalar variable.
nuDegrees of freedom.
+
+
+
Exceptions
+ + + +
std::domain_errorif nu is not greater than or equal to 0
std::domain_errorif y is not greater than or equal to 0.
+
+
+
Template Parameters
+ + + +
T_yType of scalar.
T_dofType of degrees of freedom.
+
+
+ +

Definition at line 43 of file inv_chi_square.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_dof >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
return_type<T_y,T_dof>::type stan::prob::inv_chi_square_log (const T_y & y,
const T_dof & nu 
)
+
+inline
+
+ +

Definition at line 136 of file inv_chi_square.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
double stan::prob::inv_chi_square_rng (const double nu,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 451 of file inv_chi_square.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_shape , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_shape,T_scale>::type stan::prob::inv_gamma_ccdf_log (const T_y & y,
const T_shape & alpha,
const T_scale & beta 
)
+
+ +

Definition at line 434 of file inv_gamma.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_shape , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_shape,T_scale>::type stan::prob::inv_gamma_cdf (const T_y & y,
const T_shape & alpha,
const T_scale & beta 
)
+
+ +

The CDF of an inverse gamma density for y with the specified shape and scale parameters.

+

y, shape, and scale parameters must be greater than 0.

+
Parameters
+ + + + +
yA scalar variable.
alphaShape parameter.
betaScale parameter.
+
+
+
Exceptions
+ + + + +
std::domain_errorif alpha is not greater than 0.
std::domain_errorif beta is not greater than 0.
std::domain_errorif y is not greater than 0.
+
+
+
Template Parameters
+ + + + +
T_yType of scalar.
T_shapeType of shape.
T_scaleType of scale.
+
+
+ +

Definition at line 190 of file inv_gamma.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_shape , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_shape,T_scale>::type stan::prob::inv_gamma_cdf_log (const T_y & y,
const T_shape & alpha,
const T_scale & beta 
)
+
+ +

Definition at line 317 of file inv_gamma.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_shape , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_shape,T_scale>::type stan::prob::inv_gamma_log (const T_y & y,
const T_shape & alpha,
const T_scale & beta 
)
+
+ +

The log of an inverse gamma density for y with the specified shape and scale parameters.

+

Shape and scale parameters must be greater than 0. y must be greater than 0.

+
Parameters
+ + + + +
yA scalar variable.
alphaShape parameter.
betaScale parameter.
+
+
+
Exceptions
+ + + + +
std::domain_errorif alpha is not greater than 0.
std::domain_errorif beta is not greater than 0.
std::domain_errorif y is not greater than 0.
+
+
+
Template Parameters
+ + + + +
T_yType of scalar.
T_shapeType of shape.
T_scaleType of scale.
+
+
+ +

Definition at line 40 of file inv_gamma.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_shape , typename T_scale >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_shape,T_scale>::type stan::prob::inv_gamma_log (const T_y & y,
const T_shape & alpha,
const T_scale & beta 
)
+
+inline
+
+ +

Definition at line 168 of file inv_gamma.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
double stan::prob::inv_gamma_rng (const double alpha,
const double beta,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 551 of file inv_gamma.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_dof , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_y,T_dof,T_scale>::type stan::prob::inv_wishart_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & W,
const T_dof & nu,
const Eigen::Matrix< T_scale, Eigen::Dynamic, Eigen::Dynamic > & S 
)
+
+ +

The log of the Inverse-Wishart density for the given W, degrees of freedom, and scale matrix.

+

The scale matrix, S, must be k x k, symmetric, and semi-positive definite.

+

+\begin{eqnarray*} W &\sim& \mbox{\sf{Inv-Wishart}}_{\nu} (S) \\ \log (p (W \,|\, \nu, S) ) &=& \log \left( \left(2^{\nu k/2} \pi^{k (k-1) /4} \prod_{i=1}^k{\Gamma (\frac{\nu + 1 - i}{2})} \right)^{-1} \times \left| S \right|^{\nu/2} \left| W \right|^{-(\nu + k + 1) / 2} \times \exp (-\frac{1}{2} \mbox{tr} (S W^{-1})) \right) \\ &=& -\frac{\nu k}{2}\log(2) - \frac{k (k-1)}{4} \log(\pi) - \sum_{i=1}^{k}{\log (\Gamma (\frac{\nu+1-i}{2}))} +\frac{\nu}{2} \log(\det(S)) - \frac{\nu+k+1}{2}\log (\det(W)) - \frac{1}{2} \mbox{tr}(S W^{-1}) \end{eqnarray*} +

+
Parameters
+ + + + +
WA scalar matrix
nuDegrees of freedom
SThe scale matrix
+
+
+
Returns
The log of the Inverse-Wishart density at W given nu and S.
+
Exceptions
+ + + +
std::domain_errorif nu is not greater than k-1
std::domain_errorif S is not square, not symmetric, or not semi-positive definite.
+
+
+
Template Parameters
+ + + + +
T_yType of scalar.
T_dofType of degrees of freedom.
T_scaleType of scale.
+
+
+ +

Definition at line 49 of file inv_wishart.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_dof , typename T_scale >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_y,T_dof,T_scale>::type stan::prob::inv_wishart_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & W,
const T_dof & nu,
const Eigen::Matrix< T_scale, Eigen::Dynamic, Eigen::Dynamic > & S 
)
+
+inline
+
+ +

Definition at line 131 of file inv_wishart.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
Eigen::Matrix<double, Eigen::Dynamic, Eigen::Dynamic> stan::prob::inv_wishart_rng (const double nu,
const Eigen::Matrix< double, Eigen::Dynamic, Eigen::Dynamic > & S,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 139 of file inv_wishart.hpp.

+ +
+
+ +
+
+
+template<typename T , typename TL >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
T stan::prob::lb_constrain (const T x,
const TL lb 
)
+
+inline
+
+ +

Return the lower-bounded value for the specified unconstrained input and specified lower bound.

+

The transform applied is

+

$f(x) = \exp(x) + L$

+

where $L$ is the constant lower bound.

+

If the lower bound is negative infinity, this function reduces to identity_constrain(x).

+
Parameters
+ + + +
xUnconstrained scalar input.
lbLower-bound on constrained ouptut.
+
+
+
Returns
Lower-bound constrained value correspdonding to inputs.
+
Template Parameters
+ + + +
TType of scalar.
TLType of lower bound.
+
+
+ +

Definition at line 501 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T , typename TL >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T,TL>::type stan::prob::lb_constrain (const T x,
const TL lb,
T & lp 
)
+
+inline
+
+ +

Return the lower-bounded value for the speicifed unconstrained input and specified lower bound, incrementing the specified reference with the log absolute Jacobian determinant of the transform.

+

If the lower bound is negative infinity, this function reduces to identity_constraint(x,lp).

+
Parameters
+ + + + +
xUnconstrained scalar input.
lbLower-bound on output.
lpReference to log probability to increment.
+
+
+
Returns
Loer-bound constrained value corresponding to inputs.
+
Template Parameters
+ + + +
TType of scalar.
TLType of lower bound.
+
+
+ +

Definition at line 526 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T , typename TL >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T,TL>::type stan::prob::lb_free (const T y,
const TL lb 
)
+
+inline
+
+ +

Return the unconstrained value that produces the specified lower-bound constrained value.

+

If the lower bound is negative infinity, it is ignored and the function reduces to identity_free(y).

+
Parameters
+ + + +
yInput scalar.
lbLower bound.
+
+
+
Returns
Unconstrained value that produces the input when constrained.
+
Template Parameters
+ + + +
TType of scalar.
TLType of lower bound.
+
+
+
Exceptions
+ + +
std::domain_errorif y is lower than the lower bound.
+
+
+ +

Definition at line 551 of file transform.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_covar , typename T_shape >
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_covar, T_shape>::type stan::prob::lkj_corr_cholesky_log (const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > & L,
const T_shape & eta 
)
+
+ +

Definition at line 50 of file lkj_corr.hpp.

+ +
+
+ +
+
+
+template<typename T_covar , typename T_shape >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_covar, T_shape>::type stan::prob::lkj_corr_cholesky_log (const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > & L,
const T_shape & eta 
)
+
+inline
+
+ +

Definition at line 83 of file lkj_corr.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
Eigen::MatrixXd stan::prob::lkj_corr_cholesky_rng (const size_t K,
const double eta,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 141 of file lkj_corr.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_shape >
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_y, T_shape>::type stan::prob::lkj_corr_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & y,
const T_shape & eta 
)
+
+ +

Definition at line 94 of file lkj_corr.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_shape >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_y, T_shape>::type stan::prob::lkj_corr_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & y,
const T_shape & eta 
)
+
+inline
+
+ +

Definition at line 134 of file lkj_corr.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
Eigen::MatrixXd stan::prob::lkj_corr_rng (const size_t K,
const double eta,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 166 of file lkj_corr.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_loc , typename T_scale , typename T_shape >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_y,T_loc,T_scale,T_shape>::type stan::prob::lkj_cov_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & y,
const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > & mu,
const Eigen::Matrix< T_scale, Eigen::Dynamic, 1 > & sigma,
const T_shape & eta 
)
+
+ +

Definition at line 23 of file lkj_cov.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale , typename T_shape >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_y,T_loc,T_scale,T_shape>::type stan::prob::lkj_cov_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & y,
const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > & mu,
const Eigen::Matrix< T_scale, Eigen::Dynamic, 1 > & sigma,
const T_shape & eta 
)
+
+inline
+
+ +

Definition at line 83 of file lkj_cov.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_loc , typename T_scale , typename T_shape >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_y,T_loc,T_scale,T_shape>::type stan::prob::lkj_cov_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & y,
const T_loc & mu,
const T_scale & sigma,
const T_shape & eta 
)
+
+ +

Definition at line 95 of file lkj_cov.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale , typename T_shape >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_y,T_loc,T_scale,T_shape>::type stan::prob::lkj_cov_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & y,
const T_loc & mu,
const T_scale & sigma,
const T_shape & eta 
)
+
+inline
+
+ +

Definition at line 135 of file lkj_cov.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
T stan::prob::log_inv_logit_diff (const T & alpha,
const T & beta 
)
+
+inline
+
+ +

Definition at line 24 of file ordered_logistic.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y, T_loc, T_scale>::type stan::prob::logistic_ccdf_log (const T_y & y,
const T_loc & mu,
const T_scale & sigma 
)
+
+ +

Definition at line 331 of file logistic.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y, T_loc, T_scale>::type stan::prob::logistic_cdf (const T_y & y,
const T_loc & mu,
const T_scale & sigma 
)
+
+ +

Definition at line 147 of file logistic.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y, T_loc, T_scale>::type stan::prob::logistic_cdf_log (const T_y & y,
const T_loc & mu,
const T_scale & sigma 
)
+
+ +

Definition at line 247 of file logistic.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_loc , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale>::type stan::prob::logistic_log (const T_y & y,
const T_loc & mu,
const T_scale & sigma 
)
+
+ +

Definition at line 23 of file logistic.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale>::type stan::prob::logistic_log (const T_y & y,
const T_loc & mu,
const T_scale & sigma 
)
+
+inline
+
+ +

Definition at line 140 of file logistic.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
double stan::prob::logistic_rng (const double mu,
const double sigma,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 415 of file logistic.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale>::type stan::prob::lognormal_ccdf_log (const T_y & y,
const T_loc & mu,
const T_scale & sigma 
)
+
+ +

Definition at line 314 of file lognormal.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale>::type stan::prob::lognormal_cdf (const T_y & y,
const T_loc & mu,
const T_scale & sigma 
)
+
+ +

Definition at line 160 of file lognormal.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale>::type stan::prob::lognormal_cdf_log (const T_y & y,
const T_loc & mu,
const T_scale & sigma 
)
+
+ +

Definition at line 241 of file lognormal.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_loc , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale>::type stan::prob::lognormal_log (const T_y & y,
const T_loc & mu,
const T_scale & sigma 
)
+
+ +

Definition at line 24 of file lognormal.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale>::type stan::prob::lognormal_log (const T_y & y,
const T_loc & mu,
const T_scale & sigma 
)
+
+inline
+
+ +

Definition at line 153 of file lognormal.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
double stan::prob::lognormal_rng (const double mu,
const double sigma,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 388 of file lognormal.hpp.

+ +
+
+ +
+
+
+template<typename T , typename TL , typename TU >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T,TL,TU>::type stan::prob::lub_constrain (const T x,
TL lb,
TU ub 
)
+
+inline
+
+ +

Return the lower- and upper-bounded scalar derived by transforming the specified free scalar given the specified lower and upper bounds.

+

The transform is the transformed and scaled inverse logit,

+

$f(x) = L + (U - L) \mbox{logit}^{-1}(x)$

+

If the lower bound is negative infinity and upper bound finite, this function reduces to ub_constrain(x,ub). If the upper bound is positive infinity and the lower bound finite, this function reduces to lb_constrain(x,lb). If the upper bound is positive infinity and the lower bound negative infinity, this function reduces to identity_constrain(x).

+
Parameters
+ + + + +
xFree scalar to transform.
lbLower bound.
ubUpper bound.
+
+
+
Returns
Lower- and upper-bounded scalar derived from transforming the free scalar.
+
Template Parameters
+ + + + +
TType of scalar.
TLType of lower bound.
TUType of upper bound.
+
+
+
Exceptions
+ + +
std::domain_errorif ub <= lb
+
+
+ +

Definition at line 689 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T , typename TL , typename TU >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T,TL,TU>::type stan::prob::lub_constrain (const T x,
const TL lb,
const TU ub,
T & lp 
)
+
+ +

Return the lower- and upper-bounded scalar derived by transforming the specified free scalar given the specified lower and upper bounds and increment the specified log probability with the log absolute Jacobian determinant.

+

The transform is as defined in lub_constrain(T,double,double). The log absolute Jacobian determinant is given by

+

$\log \left| \frac{d}{dx} \left( L + (U-L) \mbox{logit}^{-1}(x) \right) \right|$

+

$ {} = \log | (U-L) \, (\mbox{logit}^{-1}(x)) \, (1 - \mbox{logit}^{-1}(x)) |$

+

$ {} = \log (U - L) + \log (\mbox{logit}^{-1}(x)) + \log (1 - \mbox{logit}^{-1}(x))$

+

If the lower bound is negative infinity and upper bound finite, this function reduces to ub_constrain(x,ub,lp). If the upper bound is positive infinity and the lower bound finite, this function reduces to lb_constrain(x,lb,lp). If the upper bound is positive infinity and the lower bound negative infinity, this function reduces to identity_constrain(x,lp).

+
Parameters
+ + + + + +
xFree scalar to transform.
lbLower bound.
ubUpper bound.
lpLog probability scalar reference.
+
+
+
Returns
Lower- and upper-bounded scalar derived from transforming the free scalar.
+
Template Parameters
+ + + + +
TType of scalar.
TLType of lower bound.
TUType of upper bound.
+
+
+
Exceptions
+ + +
std::domain_errorif ub <= lb
+
+
+ +

Definition at line 759 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T , typename TL , typename TU >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T,TL,TU>::type stan::prob::lub_free (const T y,
TL lb,
TU ub 
)
+
+inline
+
+ +

Return the unconstrained scalar that transforms to the specified lower- and upper-bounded scalar given the specified bounds.

+

The transfrom in lub_constrain(T,double,double), is reversed by a transformed and scaled logit,

+

$f^{-1}(y) = \mbox{logit}(\frac{y - L}{U - L})$

+

where $U$ and $L$ are the lower and upper bounds.

+

If the lower bound is negative infinity and upper bound finite, this function reduces to ub_free(y,ub). If the upper bound is positive infinity and the lower bound finite, this function reduces to lb_free(x,lb). If the upper bound is positive infinity and the lower bound negative infinity, this function reduces to identity_free(y).

+
Template Parameters
+ + +
TType of scalar.
+
+
+
Parameters
+ + + + +
yScalar input.
lbLower bound.
ubUpper bound.
+
+
+
Returns
The free scalar that transforms to the input scalar given the bounds.
+
Exceptions
+ + +
std::invalid_argumentif the lower bound is greater than the upper bound, y is less than the lower bound, or y is greater than the upper bound
+
+
+ +

Definition at line 824 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
const Eigen::Array<T,Eigen::Dynamic,1> stan::prob::make_nu (const T eta,
const size_t K 
)
+
+ +

This function calculates the degrees of freedom for the t distribution that corresponds to the shape parameter in the Lewandowski et.

+

al. distribution

+
Parameters
+ + + +
etahyperparameter on (0,inf), eta = 1 <-> correlation matrix is uniform
Knumber of variables in covariance matrix
+
+
+ +

Definition at line 328 of file transform.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_Mu , typename T_Sigma , typename T_D >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_y,T_Mu,T_Sigma,T_D>::type stan::prob::matrix_normal_prec_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & y,
const Eigen::Matrix< T_Mu, Eigen::Dynamic, Eigen::Dynamic > & Mu,
const Eigen::Matrix< T_Sigma, Eigen::Dynamic, Eigen::Dynamic > & Sigma,
const Eigen::Matrix< T_D, Eigen::Dynamic, Eigen::Dynamic > & D 
)
+
+ +

The log of the matrix normal density for the given y, mu, Sigma and D where Sigma and D are given as precision matrices, not covariance matrices.

+
Parameters
+ + + + + +
yAn mxn matrix.
MuThe mean matrix.
SigmaThe mxm inverse covariance matrix (i.e., the precision matrix) of the rows of y.
DThe nxn inverse covariance matrix (i.e., the precision matrix) of the columns of y.
+
+
+
Returns
The log of the matrix normal density.
+
Exceptions
+ + +
std::domain_errorif Sigma or D are not square, not symmetric, or not semi-positive definite.
+
+
+
Template Parameters
+ + + + + +
T_yType of scalar.
T_MuType of location.
T_SigmaType of Sigma.
T_DType of D.
+
+
+ +

Definition at line 41 of file matrix_normal.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_Mu , typename T_Sigma , typename T_D >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_y,T_Mu,T_Sigma,T_D>::type stan::prob::matrix_normal_prec_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & y,
const Eigen::Matrix< T_Mu, Eigen::Dynamic, Eigen::Dynamic > & Mu,
const Eigen::Matrix< T_Sigma, Eigen::Dynamic, Eigen::Dynamic > & Sigma,
const Eigen::Matrix< T_D, Eigen::Dynamic, Eigen::Dynamic > & D 
)
+
+ +

Definition at line 146 of file matrix_normal.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_covar , typename T_w >
+ + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_y,T_w,T_covar>::type stan::prob::multi_gp_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & y,
const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > & Sigma,
const Eigen::Matrix< T_w, Eigen::Dynamic, 1 > & w 
)
+
+ +

The log of a multivariate Gaussian Process for the given y, Sigma, and w.

+

y is a dxN matrix, where each column is a different observation and each row is a different output dimension. The Gaussian Process is assumed to have a scaled kernel matrix with a different scale for each output dimension. This distribution is equivalent to: for (i in 1:d) row(y,i) ~ multi_normal(0,(1/w[i])*Sigma).

+
Parameters
+ + + + +
yA dxN matrix
SigmaThe NxN kernel matrix
wA d-dimensional vector of positve inverse scale parameters for each output.
+
+
+
Returns
The log of the multivariate GP density.
+
Exceptions
+ + +
std::domain_errorif Sigma is not square, not symmetric, or not semi-positive definite.
+
+
+
Template Parameters
+ + + + +
T_yType of scalar.
T_covarType of kernel.
T_wType of weight.
+
+
+ +

Definition at line 49 of file multi_gp.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_covar >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_y,T_loc,T_covar>::type stan::prob::multi_gp_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & y,
const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > & Sigma,
const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > & w 
)
+
+inline
+
+ +

Definition at line 136 of file multi_gp.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_loc , typename T_covar >
+ + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_y,T_loc,T_covar>::type stan::prob::multi_normal_cholesky_log (const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > & y,
const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > & mu,
const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > & L 
)
+
+ +

The log of the multivariate normal density for the given y, mu, and a Cholesky factor L of the variance matrix.

+

Sigma = LL', a square, semi-positive definite matrix.

+
Parameters
+ + + + +
yA scalar vector
muThe mean vector of the multivariate normal distribution.
LThe Cholesky decomposition of a variance matrix of the multivariate normal distribution
+
+
+
Returns
The log of the multivariate normal density.
+
Exceptions
+ + +
std::domain_errorif LL' is not square, not symmetric, or not semi-positive definite.
+
+
+
Template Parameters
+ + + + +
T_yType of scalar.
T_locType of location.
T_covarType of scale.
+
+
+ +

Definition at line 49 of file multi_normal_cholesky.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_covar >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_y,T_loc,T_covar>::type stan::prob::multi_normal_cholesky_log (const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > & y,
const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > & mu,
const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > & L 
)
+
+inline
+
+ +

Definition at line 122 of file multi_normal_cholesky.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_loc , typename T_covar >
+ + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_y,T_loc,T_covar>::type stan::prob::multi_normal_cholesky_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & y,
const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > & mu,
const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > & L 
)
+
+ +

y can have multiple rows (observations) and columns (on variables)

+ +

Definition at line 133 of file multi_normal_cholesky.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_covar >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_y,T_loc,T_covar>::type stan::prob::multi_normal_cholesky_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & y,
const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > & mu,
const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > & L 
)
+
+inline
+
+ +

Definition at line 221 of file multi_normal_cholesky.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_loc , typename T_covar >
+ + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_y,T_loc,T_covar>::type stan::prob::multi_normal_log (const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > & y,
const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > & mu,
const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > & Sigma 
)
+
+ +

Definition at line 35 of file multi_normal.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_covar >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_y,T_loc,T_covar>::type stan::prob::multi_normal_log (const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > & y,
const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > & mu,
const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > & Sigma 
)
+
+inline
+
+ +

Definition at line 109 of file multi_normal.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_loc , typename T_covar >
+ + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_y,T_loc,T_covar>::type stan::prob::multi_normal_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & y,
const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > & mu,
const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > & Sigma 
)
+
+ +

Definition at line 121 of file multi_normal.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_covar >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_y,T_loc,T_covar>::type stan::prob::multi_normal_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & y,
const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > & mu,
const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > & Sigma 
)
+
+inline
+
+ +

Definition at line 215 of file multi_normal.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_loc , typename T_covar >
+ + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_y,T_loc,T_covar>::type stan::prob::multi_normal_prec_log (const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > & y,
const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > & mu,
const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > & Sigma 
)
+
+ +

Definition at line 32 of file multi_normal_prec.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_covar >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_y,T_loc,T_covar>::type stan::prob::multi_normal_prec_log (const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > & y,
const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > & mu,
const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > & Sigma 
)
+
+inline
+
+ +

Definition at line 111 of file multi_normal_prec.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_loc , typename T_covar >
+ + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_y,T_loc,T_covar>::type stan::prob::multi_normal_prec_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & y,
const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > & mu,
const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > & Sigma 
)
+
+ +

y can have multiple rows (observations) and columns (on variables)

+ +

Definition at line 123 of file multi_normal_prec.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_covar >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_y,T_loc,T_covar>::type stan::prob::multi_normal_prec_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & y,
const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > & mu,
const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > & Sigma 
)
+
+inline
+
+ +

Definition at line 214 of file multi_normal_prec.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
Eigen::VectorXd stan::prob::multi_normal_rng (const Eigen::Matrix< double, Eigen::Dynamic, 1 > & mu,
const Eigen::Matrix< double, Eigen::Dynamic, Eigen::Dynamic > & S,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 224 of file multi_normal.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_dof , typename T_loc , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_y,T_dof,T_loc,T_scale>::type stan::prob::multi_student_t_log (const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > & y,
const T_dof & nu,
const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > & mu,
const Eigen::Matrix< T_scale, Eigen::Dynamic, Eigen::Dynamic > & Sigma 
)
+
+ +

Return the log of the multivariate Student t distribution at the specified arguments.

+
Template Parameters
+ + +
proptoCarry out calculations up to a proportion
+
+
+ +

Definition at line 31 of file multi_student_t.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_dof , typename T_loc , typename T_scale >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_y,T_dof,T_loc,T_scale>::type stan::prob::multi_student_t_log (const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > & y,
const T_dof & nu,
const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > & mu,
const Eigen::Matrix< T_scale, Eigen::Dynamic, Eigen::Dynamic > & Sigma 
)
+
+inline
+
+ +

Definition at line 135 of file multi_student_t.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Eigen::VectorXd stan::prob::multi_student_t_rng (const double nu,
const Eigen::Matrix< double, Eigen::Dynamic, 1 > & mu,
const Eigen::Matrix< double, Eigen::Dynamic, Eigen::Dynamic > & s,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 147 of file multi_student_t.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_prob >
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_prob>::type stan::prob::multinomial_log (const std::vector< int > & ns,
const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > & theta 
)
+
+ +

Definition at line 25 of file multinomial.hpp.

+ +
+
+ +
+
+
+template<typename T_prob >
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_prob>::type stan::prob::multinomial_log (const std::vector< int > & ns,
const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > & theta 
)
+
+ +

Definition at line 64 of file multinomial.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
std::vector<int> stan::prob::multinomial_rng (const Eigen::Matrix< double, Eigen::Dynamic, 1 > & theta,
const int N,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 71 of file multinomial.hpp.

+ +
+
+ +
+
+
+template<typename T_n , typename T_shape , typename T_inv_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_shape, T_inv_scale>::type stan::prob::neg_binomial_ccdf_log (const T_n & n,
const T_shape & alpha,
const T_inv_scale & beta 
)
+
+ +

Definition at line 461 of file neg_binomial.hpp.

+ +
+
+ +
+
+
+template<typename T_n , typename T_shape , typename T_inv_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_shape, T_inv_scale>::type stan::prob::neg_binomial_cdf (const T_n & n,
const T_shape & alpha,
const T_inv_scale & beta 
)
+
+ +

Definition at line 192 of file neg_binomial.hpp.

+ +
+
+ +
+
+
+template<typename T_n , typename T_shape , typename T_inv_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_shape, T_inv_scale>::type stan::prob::neg_binomial_cdf_log (const T_n & n,
const T_shape & alpha,
const T_inv_scale & beta 
)
+
+ +

Definition at line 339 of file neg_binomial.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_n , typename T_shape , typename T_inv_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_shape, T_inv_scale>::type stan::prob::neg_binomial_log (const T_n & n,
const T_shape & alpha,
const T_inv_scale & beta 
)
+
+ +

Definition at line 30 of file neg_binomial.hpp.

+ +
+
+ +
+
+
+template<typename T_n , typename T_shape , typename T_inv_scale >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_shape, T_inv_scale>::type stan::prob::neg_binomial_log (const T_n & n,
const T_shape & alpha,
const T_inv_scale & beta 
)
+
+inline
+
+ +

Definition at line 182 of file neg_binomial.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
int stan::prob::neg_binomial_rng (const double alpha,
const double beta,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 582 of file neg_binomial.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale>::type stan::prob::normal_ccdf_log (const T_y & y,
const T_loc & mu,
const T_scale & sigma 
)
+
+ +

Definition at line 306 of file normal.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale>::type stan::prob::normal_cdf (const T_y & y,
const T_loc & mu,
const T_scale & sigma 
)
+
+ +

Calculates the normal cumulative distribution function for the given variate, location, and scale.

+

$\Phi(x) = \frac{1}{\sqrt{2 \pi}} \int_{-\inf}^x e^{-t^2/2} dt$.

+

Errors are configured by policy. All variables must be finite and the scale must be strictly greater than zero.

+
Parameters
+ + + + +
yA scalar variate.
muThe location of the normal distribution.
sigmaThe scale of the normal distriubtion
+
+
+
Returns
The unit normal cdf evaluated at the specified arguments.
+
Template Parameters
+ + + + + +
T_yType of y.
T_locType of mean parameter.
T_scaleType of standard deviation paramater.
PolicyError-handling policy.
+
+
+ +

Definition at line 158 of file normal.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale>::type stan::prob::normal_cdf_log (const T_y & y,
const T_loc & mu,
const T_scale & sigma 
)
+
+ +

Definition at line 237 of file normal.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_loc , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
boost::enable_if_c< is_var_or_arithmetic< T_y, T_loc, T_scale >::value, typename return_type< T_y, T_loc, T_scale >::type >::type stan::prob::normal_log (const T_y & y,
const T_loc & mu,
const T_scale & sigma 
)
+
+ +

The log of the normal density for the specified scalar(s) given the specified mean(s) and deviation(s).

+

y, mu, or sigma can each be either a scalar or a std::vector. Any vector inputs must be the same length.

+

The result log probability is defined to be the sum of the log probabilities for each observation/mean/deviation triple.

+
Parameters
+ + + + +
y(Sequence of) scalar(s).
mu(Sequence of) location parameter(s) for the normal distribution.
sigma(Sequence of) scale parameters for the normal distribution.
+
+
+
Returns
The log of the product of the densities.
+
Exceptions
+ + +
std::domain_errorif the scale is not positive.
+
+
+
Template Parameters
+ + + +
T_yUnderlying type of scalar in sequence.
T_locType of location parameter.
+
+
+ +

Definition at line 22 of file normal.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale>::type stan::prob::normal_log (const T_y & y,
const T_loc & mu,
const T_scale & sigma 
)
+
+inline
+
+ +

Definition at line 134 of file normal.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
double stan::prob::normal_rng (const double mu,
const double sigma,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 375 of file normal.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,1> stan::prob::ordered_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > & x)
+
+ +

Return an increasing ordered vector derived from the specified free vector.

+

The returned constrained vector will have the same dimensionality as the specified free vector.

+
Parameters
+ + +
xFree vector of scalars.
+
+
+
Returns
Positive, increasing ordered vector.
+
Template Parameters
+ + +
TType of scalar.
+
+
+ +

Definition at line 1170 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,1> stan::prob::ordered_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > & x,
T & lp 
)
+
+inline
+
+ +

Return a positive valued, increasing ordered vector derived from the specified free vector and increment the specified log probability reference with the log absolute Jacobian determinant of the transform.

+

The returned constrained vector will have the same dimensionality as the specified free vector.

+
Parameters
+ + + +
xFree vector of scalars.
lpLog probability reference.
+
+
+
Returns
Positive, increasing ordered vector.
+
Template Parameters
+ + +
TType of scalar.
+
+
+ +

Definition at line 1199 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,1> stan::prob::ordered_free (const Eigen::Matrix< T, Eigen::Dynamic, 1 > & y)
+
+ +

Return the vector of unconstrained scalars that transform to the specified positive ordered vector.

+

This function inverts the constraining operation defined in ordered_constrain(Matrix),

+
Parameters
+ + +
yVector of positive, ordered scalars.
+
+
+
Returns
Free vector that transforms into the input vector.
+
Template Parameters
+ + +
TType of scalar.
+
+
+
Exceptions
+ + +
std::domain_errorif y is not a vector of positive, ordered scalars.
+
+
+ +

Definition at line 1223 of file transform.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_lambda , typename T_cut >
+ + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_lambda,T_cut>::type stan::prob::ordered_logistic_log (int y,
const T_lambda & lambda,
const Eigen::Matrix< T_cut, Eigen::Dynamic, 1 > & c 
)
+
+ +

Returns the (natural) log probability of the specified integer outcome given the continuous location and specified cutpoints in an ordered logistic model.

+

Typically the continous location will be the dot product of a vector of regression coefficients and a vector of predictors for the outcome.

+
Template Parameters
+ + + + + +
proptoTrue if calculating up to a proportion.
T_locLocation type.
T_cutCut-point type.
PolicyError policy (only its type matters).
+
+
+
Parameters
+ + + + +
yOutcome.
lambdaLocation.
cPositive increasing vector of cutpoints.
+
+
+
Returns
Log probability of outcome given location and cutpoints.
+
Exceptions
+ + +
std::domain_errorIf the outcome is not between 1 and the number of cutpoints plus 2; if the cutpoint vector is empty; if the cutpoint vector contains a non-positive, non-finite value; or if the cutpoint vector is not sorted in ascending order.
+
+
+ +

Definition at line 60 of file ordered_logistic.hpp.

+ +
+
+ +
+
+
+template<typename T_lambda , typename T_cut >
+ + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_lambda,T_cut>::type stan::prob::ordered_logistic_log (int y,
const T_lambda & lambda,
const Eigen::Matrix< T_cut, Eigen::Dynamic, 1 > & c 
)
+
+ +

Definition at line 131 of file ordered_logistic.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
int stan::prob::ordered_logistic_rng (const double eta,
const Eigen::Matrix< double, Eigen::Dynamic, 1 > & c,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 138 of file ordered_logistic.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_scale , typename T_shape >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y, T_scale, T_shape>::type stan::prob::pareto_ccdf_log (const T_y & y,
const T_scale & y_min,
const T_shape & alpha 
)
+
+ +

Definition at line 337 of file pareto.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_scale , typename T_shape >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y, T_scale, T_shape>::type stan::prob::pareto_cdf (const T_y & y,
const T_scale & y_min,
const T_shape & alpha 
)
+
+ +

Definition at line 142 of file pareto.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_scale , typename T_shape >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y, T_scale, T_shape>::type stan::prob::pareto_cdf_log (const T_y & y,
const T_scale & y_min,
const T_shape & alpha 
)
+
+ +

Definition at line 247 of file pareto.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_scale , typename T_shape >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_scale,T_shape>::type stan::prob::pareto_log (const T_y & y,
const T_scale & y_min,
const T_shape & alpha 
)
+
+ +

Definition at line 24 of file pareto.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_scale , typename T_shape >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_scale,T_shape>::type stan::prob::pareto_log (const T_y & y,
const T_scale & y_min,
const T_shape & alpha 
)
+
+inline
+
+ +

Definition at line 136 of file pareto.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
double stan::prob::pareto_rng (const double y_min,
const double alpha,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 423 of file pareto.hpp.

+ +
+
+ +
+
+
+template<typename T_n , typename T_rate >
+ + + + + + + + + + + + + + + + + + +
return_type<T_rate>::type stan::prob::poisson_ccdf_log (const T_n & n,
const T_rate & lambda 
)
+
+ +

Definition at line 335 of file poisson.hpp.

+ +
+
+ +
+
+
+template<typename T_n , typename T_rate >
+ + + + + + + + + + + + + + + + + + +
return_type<T_rate>::type stan::prob::poisson_cdf (const T_n & n,
const T_rate & lambda 
)
+
+ +

Definition at line 201 of file poisson.hpp.

+ +
+
+ +
+
+
+template<typename T_n , typename T_rate >
+ + + + + + + + + + + + + + + + + + +
return_type<T_rate>::type stan::prob::poisson_cdf_log (const T_n & n,
const T_rate & lambda 
)
+
+ +

Definition at line 270 of file poisson.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_n , typename T_rate >
+ + + + + + + + + + + + + + + + + + +
return_type<T_rate>::type stan::prob::poisson_log (const T_n & n,
const T_rate & lambda 
)
+
+ +

Definition at line 27 of file poisson.hpp.

+ +
+
+ +
+
+
+template<typename T_n , typename T_rate >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
return_type<T_rate>::type stan::prob::poisson_log (const T_n & n,
const T_rate & lambda 
)
+
+inline
+
+ +

Definition at line 105 of file poisson.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_n , typename T_log_rate >
+ + + + + + + + + + + + + + + + + + +
return_type<T_log_rate>::type stan::prob::poisson_log_log (const T_n & n,
const T_log_rate & alpha 
)
+
+ +

Definition at line 113 of file poisson.hpp.

+ +
+
+ +
+
+
+template<typename T_n , typename T_log_rate >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
return_type<T_log_rate>::type stan::prob::poisson_log_log (const T_n & n,
const T_log_rate & alpha 
)
+
+inline
+
+ +

Definition at line 194 of file poisson.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
int stan::prob::poisson_rng (const double lambda,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 400 of file poisson.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
T stan::prob::positive_constrain (const T x)
+
+inline
+
+ +

Return the positive value for the specified unconstrained input.

+

The transform applied is

+

$f(x) = \exp(x)$.

+
Parameters
+ + +
xArbitrary input scalar.
+
+
+
Returns
Input transformed to be positive.
+ +

Definition at line 428 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
T stan::prob::positive_constrain (const T x,
T & lp 
)
+
+inline
+
+ +

Return the positive value for the specified unconstrained input, incrementing the scalar reference with the log absolute Jacobian determinant.

+

See positive_constrain(T) for details of the transform. The log absolute Jacobian determinant is

+

$\log | \frac{d}{dx} \mbox{exp}(x) | = \log | \mbox{exp}(x) | = x$.

+
Parameters
+ + + +
xArbitrary input scalar.
lpLog probability reference.
+
+
+
Returns
Input transformed to be positive.
+
Template Parameters
+ + +
TType of scalar.
+
+
+ +

Definition at line 450 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
T stan::prob::positive_free (const T y)
+
+inline
+
+ +

Return the unconstrained value corresponding to the specified positive-constrained value.

+

The transform is the inverse of the transform $f$ applied by positive_constrain(T), namely

+

$f^{-1}(x) = \log(x)$.

+

The input is validated using stan::math::check_positive().

+
Parameters
+ + +
yInput scalar.
+
+
+
Returns
Unconstrained value that produces the input when constrained.
+
Template Parameters
+ + +
TType of scalar.
+
+
+
Exceptions
+ + +
std::domain_errorif the variable is negative.
+
+
+ +

Definition at line 473 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,1> stan::prob::positive_ordered_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > & x)
+
+ +

Return an increasing positive ordered vector derived from the specified free vector.

+

The returned constrained vector will have the same dimensionality as the specified free vector.

+
Parameters
+ + +
xFree vector of scalars.
+
+
+
Returns
Positive, increasing ordered vector.
+
Template Parameters
+ + +
TType of scalar.
+
+
+ +

Definition at line 1251 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,1> stan::prob::positive_ordered_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > & x,
T & lp 
)
+
+inline
+
+ +

Return a positive valued, increasing positive ordered vector derived from the specified free vector and increment the specified log probability reference with the log absolute Jacobian determinant of the transform.

+

The returned constrained vector will have the same dimensionality as the specified free vector.

+
Parameters
+ + + +
xFree vector of scalars.
lpLog probability reference.
+
+
+
Returns
Positive, increasing ordered vector.
+
Template Parameters
+ + +
TType of scalar.
+
+
+ +

Definition at line 1280 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,1> stan::prob::positive_ordered_free (const Eigen::Matrix< T, Eigen::Dynamic, 1 > & y)
+
+ +

Return the vector of unconstrained scalars that transform to the specified positive ordered vector.

+

This function inverts the constraining operation defined in positive_ordered_constrain(Matrix),

+
Parameters
+ + +
yVector of positive, ordered scalars.
+
+
+
Returns
Free vector that transforms into the input vector.
+
Template Parameters
+ + +
TType of scalar.
+
+
+
Exceptions
+ + +
std::domain_errorif y is not a vector of positive, ordered scalars.
+
+
+ +

Definition at line 1304 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
T stan::prob::prob_constrain (const T x)
+
+inline
+
+ +

Return a probability value constrained to fall between 0 and 1 (inclusive) for the specified free scalar.

+

The transform is the inverse logit,

+

$f(x) = \mbox{logit}^{-1}(x) = \frac{1}{1 + \exp(x)}$.

+
Parameters
+ + +
xFree scalar.
+
+
+
Returns
Probability-constrained result of transforming the free scalar.
+
Template Parameters
+ + +
TType of scalar.
+
+
+ +

Definition at line 853 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
T stan::prob::prob_constrain (const T x,
T & lp 
)
+
+inline
+
+ +

Return a probability value constrained to fall between 0 and 1 (inclusive) for the specified free scalar and increment the specified log probability reference with the log absolute Jacobian determinant of the transform.

+

The transform is as defined for prob_constrain(T). The log absolute Jacobian determinant is

+

The log absolute Jacobian determinant is

+

$\log | \frac{d}{dx} \mbox{logit}^{-1}(x) |$

+

$\log ((\mbox{logit}^{-1}(x)) (1 - \mbox{logit}^{-1}(x))$

+

$\log (\mbox{logit}^{-1}(x)) + \log (1 - \mbox{logit}^{-1}(x))$.

+
Parameters
+ + + +
xFree scalar.
lpLog probability reference.
+
+
+
Returns
Probability-constrained result of transforming the free scalar.
+
Template Parameters
+ + +
TType of scalar.
+
+
+ +

Definition at line 881 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
T stan::prob::prob_free (const T y)
+
+inline
+
+ +

Return the free scalar that when transformed to a probability produces the specified scalar.

+

The function that reverses the constraining transform specified in prob_constrain(T) is the logit function,

+

$f^{-1}(y) = \mbox{logit}(y) = \frac{1 - y}{y}$.

+
Parameters
+ + +
yScalar input.
+
+
+
Template Parameters
+ + +
TType of scalar.
+
+
+
Exceptions
+ + +
std::domain_errorif y is less than 0 or greater than 1.
+
+
+ +

Definition at line 905 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_scale >
+ + + + + + + + + + + + + + + + + + +
return_type<T_y,T_scale>::type stan::prob::rayleigh_ccdf_log (const T_y & y,
const T_scale & sigma 
)
+
+ +

Definition at line 256 of file rayleigh.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_scale >
+ + + + + + + + + + + + + + + + + + +
return_type<T_y,T_scale>::type stan::prob::rayleigh_cdf (const T_y & y,
const T_scale & sigma 
)
+
+ +

Definition at line 110 of file rayleigh.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_scale >
+ + + + + + + + + + + + + + + + + + +
return_type<T_y,T_scale>::type stan::prob::rayleigh_cdf_log (const T_y & y,
const T_scale & sigma 
)
+
+ +

Definition at line 187 of file rayleigh.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_scale >
+ + + + + + + + + + + + + + + + + + +
return_type<T_y,T_scale>::type stan::prob::rayleigh_log (const T_y & y,
const T_scale & sigma 
)
+
+ +

Definition at line 21 of file rayleigh.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_scale >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
return_type<T_y,T_scale>::type stan::prob::rayleigh_log (const T_y & y,
const T_scale & sigma 
)
+
+inline
+
+ +

Definition at line 104 of file rayleigh.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
double stan::prob::rayleigh_rng (const double sigma,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 322 of file rayleigh.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> stan::prob::read_corr_L (const Eigen::Array< T, Eigen::Dynamic, 1 > & CPCs,
const size_t K 
)
+
+ +

Return the Cholesky factor of the correlation matrix of the specified dimensionality corresponding to the specified canonical partial correlations.

+

It is generally better to work with the Cholesky factor rather than the correlation matrix itself when the determinant, inverse, etc. of the correlation matrix is needed for some statistical calculation.

+

See read_corr_matrix(Array,size_t,T) for more information.

+
Parameters
+ + + +
CPCsThe (K choose 2) canonical partial correlations in (-1,1).
KDimensionality of correlation matrix.
+
+
+
Returns
Cholesky factor of correlation matrix for specified canonical partial correlations.
+
Template Parameters
+ + +
TType of underlying scalar.
+
+
+ +

Definition at line 115 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> stan::prob::read_corr_L (const Eigen::Array< T, Eigen::Dynamic, 1 > & CPCs,
const size_t K,
T & log_prob 
)
+
+ +

Return the Cholesky factor of the correlation matrix of the specified dimensionality corresponding to the specified canonical partial correlations, incrementing the specified scalar reference with the log absolute determinant of the Jacobian of the transformation.

+

The implementation is Ben Goodrich's Cholesky factor-based approach to the C-vine method of:

+
    +
  • +Daniel Lewandowski, Dorota Kurowicka, and Harry Joe, Generating random correlation matrices based on vines and extended onion method Journal of Multivariate Analysis 100 (2009) 1989–2001
  • +
+

// FIXME: explain which CPCs we're dealing with

+
Parameters
+ + + + +
CPCsThe (K choose 2) canonical partial correlations in (-1,1).
KDimensionality of correlation matrix.
log_probReference to variable to increment with the log Jacobian determinant.
+
+
+
Returns
Cholesky factor of correlation matrix for specified partial correlations.
+
Template Parameters
+ + +
TType of underlying scalar.
+
+
+ +

Definition at line 193 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> stan::prob::read_corr_matrix (const Eigen::Array< T, Eigen::Dynamic, 1 > & CPCs,
const size_t K 
)
+
+ +

Return the correlation matrix of the specified dimensionality corresponding to the specified canonical partial correlations.

+

See read_corr_matrix(Array,size_t,T) for more information.

+
Parameters
+ + + +
CPCsThe (K choose 2) canonical partial correlations in (-1,1).
KDimensionality of correlation matrix.
+
+
+
Returns
Cholesky factor of correlation matrix for specified canonical partial correlations.
+
Template Parameters
+ + +
TType of underlying scalar.
+
+
+ +

Definition at line 157 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> stan::prob::read_corr_matrix (const Eigen::Array< T, Eigen::Dynamic, 1 > & CPCs,
const size_t K,
T & log_prob 
)
+
+ +

Return the correlation matrix of the specified dimensionality corresponding to the specified canonical partial correlations, incrementing the specified scalar reference with the log absolute determinant of the Jacobian of the transformation.

+

It is usually preferable to utilize the version that returns the Cholesky factor of the correlation matrix rather than the correlation matrix itself in statistical calculations.

+
Parameters
+ + + + +
CPCsThe (K choose 2) canonical partial correlations in (-1,1).
KDimensionality of correlation matrix.
log_probReference to variable to increment with the log Jacobian determinant.
+
+
+
Returns
Correlation matrix for specified partial correlations.
+
Template Parameters
+ + +
TType of underlying scalar.
+
+
+ +

Definition at line 243 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> stan::prob::read_cov_L (const Eigen::Array< T, Eigen::Dynamic, 1 > & CPCs,
const Eigen::Array< T, Eigen::Dynamic, 1 > & sds,
T & log_prob 
)
+
+ +

This is the function that should be called prior to evaluating the density of any elliptical distribution.

+
Parameters
+ + + + +
CPCson (-1,1)
sdson (0,inf)
log_probthe log probability value to increment with the Jacobian
+
+
+
Returns
Cholesky factor of covariance matrix for specified partial correlations.
+ +

Definition at line 265 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> stan::prob::read_cov_matrix (const Eigen::Array< T, Eigen::Dynamic, 1 > & CPCs,
const Eigen::Array< T, Eigen::Dynamic, 1 > & sds,
T & log_prob 
)
+
+ +

A generally worse alternative to call prior to evaluating the density of an elliptical distribution.

+
Parameters
+ + + + +
CPCson (-1,1)
sdson (0,inf)
log_probthe log probability value to increment with the Jacobian
+
+
+
Returns
Covariance matrix for specified partial correlations.
+ +

Definition at line 285 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> stan::prob::read_cov_matrix (const Eigen::Array< T, Eigen::Dynamic, 1 > & CPCs,
const Eigen::Array< T, Eigen::Dynamic, 1 > & sds 
)
+
+ +

Builds a covariance matrix from CPCs and standard deviations.

+
Parameters
+ + + +
CPCsin (-1,1)
sdsin (0,inf)
+
+
+ +

Definition at line 304 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_dof , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y, T_dof, T_scale>::type stan::prob::scaled_inv_chi_square_ccdf_log (const T_y & y,
const T_dof & nu,
const T_scale & s 
)
+
+ +

Definition at line 449 of file scaled_inv_chi_square.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_dof , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y, T_dof, T_scale>::type stan::prob::scaled_inv_chi_square_cdf (const T_y & y,
const T_dof & nu,
const T_scale & s 
)
+
+ +

The CDF of a scaled inverse chi-squared density for y with the specified degrees of freedom parameter and scale parameter.

+
Parameters
+ + + + +
yA scalar variable.
nuDegrees of freedom.
sScale parameter.
+
+
+
Exceptions
+ + + + +
std::domain_errorif nu is not greater than 0
std::domain_errorif s is not greater than 0.
std::domain_errorif y is not greater than 0.
+
+
+
Template Parameters
+ + + +
T_yType of scalar.
T_dofType of degrees of freedom.
+
+
+ +

Definition at line 197 of file scaled_inv_chi_square.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_dof , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y, T_dof, T_scale>::type stan::prob::scaled_inv_chi_square_cdf_log (const T_y & y,
const T_dof & nu,
const T_scale & s 
)
+
+ +

Definition at line 330 of file scaled_inv_chi_square.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_dof , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_dof,T_scale>::type stan::prob::scaled_inv_chi_square_log (const T_y & y,
const T_dof & nu,
const T_scale & s 
)
+
+ +

The log of a scaled inverse chi-squared density for y with the specified degrees of freedom parameter and scale parameter.

+

+\begin{eqnarray*} y &\sim& \mbox{\sf{Inv-}}\chi^2(\nu, s^2) \\ \log (p (y \,|\, \nu, s)) &=& \log \left( \frac{(\nu / 2)^{\nu / 2}}{\Gamma (\nu / 2)} s^\nu y^{- (\nu / 2 + 1)} \exp^{-\nu s^2 / (2y)} \right) \\ &=& \frac{\nu}{2} \log(\frac{\nu}{2}) - \log (\Gamma (\nu / 2)) + \nu \log(s) - (\frac{\nu}{2} + 1) \log(y) - \frac{\nu s^2}{2y} \\ & & \mathrm{ where } \; y > 0 \end{eqnarray*} +

+
Parameters
+ + + + +
yA scalar variable.
nuDegrees of freedom.
sScale parameter.
+
+
+
Exceptions
+ + + + +
std::domain_errorif nu is not greater than 0
std::domain_errorif s is not greater than 0.
std::domain_errorif y is not greater than 0.
+
+
+
Template Parameters
+ + + +
T_yType of scalar.
T_dofType of degrees of freedom.
+
+
+ +

Definition at line 44 of file scaled_inv_chi_square.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_dof , typename T_scale >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_dof,T_scale>::type stan::prob::scaled_inv_chi_square_log (const T_y & y,
const T_dof & nu,
const T_scale & s 
)
+
+inline
+
+ +

Definition at line 177 of file scaled_inv_chi_square.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
double stan::prob::scaled_inv_chi_square_rng (const double nu,
const double s,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 568 of file scaled_inv_chi_square.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
int stan::prob::sign (const T & z)
+
+inline
+
+ +

Definition at line 18 of file double_exponential.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,1> stan::prob::simplex_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > & y)
+
+ +

Return the simplex corresponding to the specified free vector.

+

A simplex is a vector containing values greater than or equal to 0 that sum to 1. A vector with (K-1) unconstrained values will produce a simplex of size K.

+

The transform is based on a centered stick-breaking process.

+
Parameters
+ + +
yFree vector input of dimensionality K - 1.
+
+
+
Returns
Simplex of dimensionality K.
+
Template Parameters
+ + +
TType of scalar.
+
+
+ +

Definition at line 1067 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,1> stan::prob::simplex_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > & y,
T & lp 
)
+
+ +

Return the simplex corresponding to the specified free vector and increment the specified log probability reference with the log absolute Jacobian determinant of the transform.

+

The simplex transform is defined through a centered stick-breaking process.

+
Parameters
+ + + +
yFree vector input of dimensionality K - 1.
lpLog probability reference to increment.
+
+
+
Returns
Simplex of dimensionality K.
+
Template Parameters
+ + +
TType of scalar.
+
+
+ +

Definition at line 1100 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,1> stan::prob::simplex_free (const Eigen::Matrix< T, Eigen::Dynamic, 1 > & x)
+
+ +

Return an unconstrained vector that when transformed produces the specified simplex.

+

It applies to a simplex of dimensionality K and produces an unconstrained vector of dimensionality (K-1).

+

The simplex transform is defined through a centered stick-breaking process.

+
Parameters
+ + +
xSimplex of dimensionality K.
+
+
+
Returns
Free vector of dimensionality (K-1) that transfroms to the simplex.
+
Template Parameters
+ + +
TType of scalar.
+
+
+
Exceptions
+ + +
std::domain_errorif x is not a valid simplex
+
+
+ +

Definition at line 1140 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale , typename T_shape >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale,T_shape>::type stan::prob::skew_normal_ccdf_log (const T_y & y,
const T_loc & mu,
const T_scale & sigma,
const T_shape & alpha 
)
+
+ +

Definition at line 342 of file skew_normal.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale , typename T_shape >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale,T_shape>::type stan::prob::skew_normal_cdf (const T_y & y,
const T_loc & mu,
const T_scale & sigma,
const T_shape & alpha 
)
+
+ +

Definition at line 149 of file skew_normal.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale , typename T_shape >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale,T_shape>::type stan::prob::skew_normal_cdf_log (const T_y & y,
const T_loc & mu,
const T_scale & sigma,
const T_shape & alpha 
)
+
+ +

Definition at line 252 of file skew_normal.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_loc , typename T_scale , typename T_shape >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale,T_shape>::type stan::prob::skew_normal_log (const T_y & y,
const T_loc & mu,
const T_scale & sigma,
const T_shape & alpha 
)
+
+ +

Definition at line 23 of file skew_normal.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale , typename T_shape >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale, T_shape>::type stan::prob::skew_normal_log (const T_y & y,
const T_loc & mu,
const T_scale & sigma,
const T_shape & alpha 
)
+
+inline
+
+ +

Definition at line 142 of file skew_normal.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
double stan::prob::skew_normal_rng (const double mu,
const double sigma,
const double alpha,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 432 of file skew_normal.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_dof , typename T_loc , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y, T_dof, T_loc, T_scale>::type stan::prob::student_t_ccdf_log (const T_y & y,
const T_dof & nu,
const T_loc & mu,
const T_scale & sigma 
)
+
+ +

Definition at line 584 of file student_t.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_dof , typename T_loc , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y, T_dof, T_loc, T_scale>::type stan::prob::student_t_cdf (const T_y & y,
const T_dof & nu,
const T_loc & mu,
const T_scale & sigma 
)
+
+ +

Definition at line 232 of file student_t.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_dof , typename T_loc , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y, T_dof, T_loc, T_scale>::type stan::prob::student_t_cdf_log (const T_y & y,
const T_dof & nu,
const T_loc & mu,
const T_scale & sigma 
)
+
+ +

Definition at line 414 of file student_t.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_dof , typename T_loc , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_dof,T_loc,T_scale>::type stan::prob::student_t_log (const T_y & y,
const T_dof & nu,
const T_loc & mu,
const T_scale & sigma 
)
+
+ +

The log of the Student-t density for the given y, nu, mean, and scale parameter.

+

The scale parameter must be greater than 0.

+

+\begin{eqnarray*} y &\sim& t_{\nu} (\mu, \sigma^2) \\ \log (p (y \,|\, \nu, \mu, \sigma) ) &=& \log \left( \frac{\Gamma((\nu + 1) /2)} {\Gamma(\nu/2)\sqrt{\nu \pi} \sigma} \left( 1 + \frac{1}{\nu} (\frac{y - \mu}{\sigma})^2 \right)^{-(\nu + 1)/2} \right) \\ &=& \log( \Gamma( (\nu+1)/2 )) - \log (\Gamma (\nu/2) - \frac{1}{2} \log(\nu \pi) - \log(\sigma) -\frac{\nu + 1}{2} \log (1 + \frac{1}{\nu} (\frac{y - \mu}{\sigma})^2) \end{eqnarray*} +

+
Parameters
+ + + + + +
yA scalar variable.
nuDegrees of freedom.
muThe mean of the Student-t distribution.
sigmaThe scale parameter of the Student-t distribution.
+
+
+
Returns
The log of the Student-t density at y.
+
Exceptions
+ + + +
std::domain_errorif sigma is not greater than 0.
std::domain_errorif nu is not greater than 0.
+
+
+
Template Parameters
+ + + + + +
T_yType of scalar.
T_dofType of degrees of freedom.
T_locType of location.
T_scaleType of scale.
+
+
+ +

Definition at line 49 of file student_t.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_dof , typename T_loc , typename T_scale >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_dof,T_loc,T_scale>::type stan::prob::student_t_log (const T_y & y,
const T_dof & nu,
const T_loc & mu,
const T_scale & sigma 
)
+
+inline
+
+ +

Definition at line 225 of file student_t.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
double stan::prob::student_t_rng (const double nu,
const double mu,
const double sigma,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 754 of file student_t.hpp.

+ +
+
+ +
+
+
+template<typename T , typename TU >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T,TU>::type stan::prob::ub_constrain (const T x,
const TU ub 
)
+
+inline
+
+ +

Return the upper-bounded value for the specified unconstrained scalar and upper bound.

+

The transform is

+

$f(x) = U - \exp(x)$

+

where $U$ is the upper bound.

+

If the upper bound is positive infinity, this function reduces to identity_constrain(x).

+
Parameters
+ + + +
xFree scalar.
ubUpper bound.
+
+
+
Returns
Transformed scalar with specified upper bound.
+
Template Parameters
+ + + +
TType of scalar.
TUType of upper bound.
+
+
+ +

Definition at line 584 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T , typename TU >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T,TU>::type stan::prob::ub_constrain (const T x,
const TU ub,
T & lp 
)
+
+inline
+
+ +

Return the upper-bounded value for the specified unconstrained scalar and upper bound and increment the specified log probability reference with the log absolute Jacobian determinant of the transform.

+

The transform is as specified for ub_constrain(T,double). The log absolute Jacobian determinant is

+

$ \log | \frac{d}{dx} -\mbox{exp}(x) + U | = \log | -\mbox{exp}(x) + 0 | = x$.

+

If the upper bound is positive infinity, this function reduces to identity_constrain(x,lp).

+
Parameters
+ + + + +
xFree scalar.
ubUpper bound.
lpLog probability reference.
+
+
+
Returns
Transformed scalar with specified upper bound.
+
Template Parameters
+ + + +
TType of scalar.
TUType of upper bound.
+
+
+ +

Definition at line 616 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T , typename TU >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T,TU>::type stan::prob::ub_free (const T y,
const TU ub 
)
+
+inline
+
+ +

Return the free scalar that corresponds to the specified upper-bounded value with respect to the specified upper bound.

+

The transform is the reverse of the ub_constrain(T,double) transform,

+

$f^{-1}(y) = \log -(y - U)$

+

where $U$ is the upper bound.

+

If the upper bound is positive infinity, this function reduces to identity_free(y).

+
Parameters
+ + + +
yUpper-bounded scalar.
ubUpper bound.
+
+
+
Returns
Free scalar corresponding to upper-bounded scalar.
+
Template Parameters
+ + + +
TType of scalar.
TUType of upper bound.
+
+
+
Exceptions
+ + +
std::invalid_argumentif y is greater than the upper bound.
+
+
+ +

Definition at line 648 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_low , typename T_high >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_low,T_high>::type stan::prob::uniform_ccdf_log (const T_y & y,
const T_low & alpha,
const T_high & beta 
)
+
+ +

Definition at line 288 of file uniform.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_low , typename T_high >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_low,T_high>::type stan::prob::uniform_cdf (const T_y & y,
const T_low & alpha,
const T_high & beta 
)
+
+ +

Definition at line 132 of file uniform.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_low , typename T_high >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_low,T_high>::type stan::prob::uniform_cdf_log (const T_y & y,
const T_low & alpha,
const T_high & beta 
)
+
+ +

Definition at line 213 of file uniform.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_low , typename T_high >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_low,T_high>::type stan::prob::uniform_log (const T_y & y,
const T_low & alpha,
const T_high & beta 
)
+
+ +

The log of a uniform density for the given y, lower, and upper bound.

+

+\begin{eqnarray*} y &\sim& \mbox{\sf{U}}(\alpha, \beta) \\ \log (p (y \,|\, \alpha, \beta)) &=& \log \left( \frac{1}{\beta-\alpha} \right) \\ &=& \log (1) - \log (\beta - \alpha) \\ &=& -\log (\beta - \alpha) \\ & & \mathrm{ where } \; y \in [\alpha, \beta], \log(0) \; \mathrm{otherwise} \end{eqnarray*} +

+
Parameters
+ + + + +
yA scalar variable.
alphaLower bound.
betaUpper bound.
+
+
+
Exceptions
+ + +
std::invalid_argumentif the lower bound is greater than or equal to the lower bound
+
+
+
Template Parameters
+ + + + +
T_yType of scalar.
T_lowType of lower bound.
T_highType of upper bound.
+
+
+ +

Definition at line 44 of file uniform.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_low , typename T_high >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_low,T_high>::type stan::prob::uniform_log (const T_y & y,
const T_low & alpha,
const T_high & beta 
)
+
+inline
+
+ +

Definition at line 126 of file uniform.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
double stan::prob::uniform_rng (const double alpha,
const double beta,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 363 of file uniform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,1> stan::prob::unit_vector_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > & y)
+
+ +

Return the unit length vector corresponding to the free vector y.

+

The free vector contains K-1 spherical coordinates.

+
Parameters
+ + +
yof K - 1 spherical coordinates
+
+
+
Returns
Unit length vector of dimension K
+
Template Parameters
+ + +
TScalar type.
+
+
+ +

Definition at line 991 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,1> stan::prob::unit_vector_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > & y,
T & lp 
)
+
+ +

Return the unit length vector corresponding to the free vector y.

+

The free vector contains K-1 spherical coordinates.

+
Parameters
+ + +
yof K - 1 spherical coordinates
+
+
+
Returns
Unit length vector of dimension K
+
Parameters
+ + +
lpLog probability reference to increment.
+
+
+
Template Parameters
+ + +
TScalar type.
+
+
+ +

Definition at line 1017 of file transform.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + + + + +
Eigen::Matrix<T,Eigen::Dynamic,1> stan::prob::unit_vector_free (const Eigen::Matrix< T, Eigen::Dynamic, 1 > & x)
+
+ +

Definition at line 1036 of file transform.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_loc , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale>::type stan::prob::von_mises_log (T_y const & y,
T_loc const & mu,
T_scale const & kappa 
)
+
+ +

Definition at line 18 of file von_mises.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_loc , typename T_scale >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_loc,T_scale>::type stan::prob::von_mises_log (T_y const & y,
T_loc const & mu,
T_scale const & kappa 
)
+
+inline
+
+ +

Definition at line 120 of file von_mises.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_shape , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_shape,T_scale>::type stan::prob::weibull_ccdf_log (const T_y & y,
const T_shape & alpha,
const T_scale & sigma 
)
+
+ +

Definition at line 282 of file weibull.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_shape , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_shape,T_scale>::type stan::prob::weibull_cdf (const T_y & y,
const T_shape & alpha,
const T_scale & sigma 
)
+
+ +

Definition at line 150 of file weibull.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_shape , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_shape,T_scale>::type stan::prob::weibull_cdf_log (const T_y & y,
const T_shape & alpha,
const T_scale & sigma 
)
+
+ +

Definition at line 221 of file weibull.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_shape , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_shape,T_scale>::type stan::prob::weibull_log (const T_y & y,
const T_shape & alpha,
const T_scale & sigma 
)
+
+ +

Definition at line 24 of file weibull.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_shape , typename T_scale >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
return_type<T_y,T_shape,T_scale>::type stan::prob::weibull_log (const T_y & y,
const T_shape & alpha,
const T_scale & sigma 
)
+
+inline
+
+ +

Definition at line 144 of file weibull.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
double stan::prob::weibull_rng (const double alpha,
const double sigma,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 340 of file weibull.hpp.

+ +
+
+ +
+
+
+template<bool propto, typename T_y , typename T_dof , typename T_scale >
+ + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_y,T_dof,T_scale>::type stan::prob::wishart_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & W,
const T_dof & nu,
const Eigen::Matrix< T_scale, Eigen::Dynamic, Eigen::Dynamic > & S 
)
+
+ +

The log of the Wishart density for the given W, degrees of freedom, and scale matrix.

+

The scale matrix, S, must be k x k, symmetric, and semi-positive definite. Dimension, k, is implicit. nu must be greater than k-1

+

+\begin{eqnarray*} W &\sim& \mbox{\sf{Wishart}}_{\nu} (S) \\ \log (p (W \,|\, \nu, S) ) &=& \log \left( \left(2^{\nu k/2} \pi^{k (k-1) /4} \prod_{i=1}^k{\Gamma (\frac{\nu + 1 - i}{2})} \right)^{-1} \times \left| S \right|^{-\nu/2} \left| W \right|^{(\nu - k - 1) / 2} \times \exp (-\frac{1}{2} \mbox{tr} (S^{-1} W)) \right) \\ &=& -\frac{\nu k}{2}\log(2) - \frac{k (k-1)}{4} \log(\pi) - \sum_{i=1}^{k}{\log (\Gamma (\frac{\nu+1-i}{2}))} -\frac{\nu}{2} \log(\det(S)) + \frac{\nu-k-1}{2}\log (\det(W)) - \frac{1}{2} \mbox{tr} (S^{-1}W) \end{eqnarray*} +

+
Parameters
+ + + + +
WA scalar matrix
nuDegrees of freedom
SThe scale matrix
+
+
+
Returns
The log of the Wishart density at W given nu and S.
+
Exceptions
+ + + +
std::domain_errorif nu is not greater than k-1
std::domain_errorif S is not square, not symmetric, or not semi-positive definite.
+
+
+
Template Parameters
+ + + + +
T_yType of scalar.
T_dofType of degrees of freedom.
T_scaleType of scale.
+
+
+ +

Definition at line 57 of file wishart.hpp.

+ +
+
+ +
+
+
+template<typename T_y , typename T_dof , typename T_scale >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
boost::math::tools::promote_args<T_y,T_dof,T_scale>::type stan::prob::wishart_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > & W,
const T_dof & nu,
const Eigen::Matrix< T_scale, Eigen::Dynamic, Eigen::Dynamic > & S 
)
+
+inline
+
+ +

Definition at line 141 of file wishart.hpp.

+ +
+
+ +
+
+
+template<class RNG >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
Eigen::Matrix<double, Eigen::Dynamic, Eigen::Dynamic> stan::prob::wishart_rng (const double nu,
const Eigen::Matrix< double, Eigen::Dynamic, Eigen::Dynamic > & S,
RNG & rng 
)
+
+inline
+
+ +

Definition at line 149 of file wishart.hpp.

+ +
+
+

Variable Documentation

+ +
+
+ + + + +
const double stan::prob::CONSTRAINT_TOLERANCE = 1E-8
+
+ +

Definition at line 28 of file transform.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/namespacestd.html b/doc/api/html/namespacestd.html new file mode 100644 index 00000000000..a76cd31deda --- /dev/null +++ b/doc/api/html/namespacestd.html @@ -0,0 +1,202 @@ + + + + + +Stan: std Namespace Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ +
+
+ +
+
std Namespace Reference
+
+
+ +

Template specification of functions in std for Stan. +More...

+ + + + + + + +

+Classes

struct  numeric_limits< stan::agrad::fvar< T > >
 
struct  numeric_limits< stan::agrad::var >
 Specialization of numeric limits for var objects. More...
 
+ + + + + + + +

+Functions

int isnan (const stan::agrad::var &a)
 Checks if the given number is NaN.
 
int isinf (const stan::agrad::var &a)
 Checks if the given number is infinite.
 
+

Detailed Description

+

Template specification of functions in std for Stan.

+

Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
int std::isinf (const stan::agrad::vara)
+
+inline
+
+ +

Checks if the given number is infinite.

+

Return true if the value of the a is positive or negative infinity.

+
Parameters
+ + +
aVariable to test.
+
+
+
Returns
true if value is infinite.
+ +

Definition at line 75 of file numeric_limits.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
int std::isnan (const stan::agrad::vara)
+
+inline
+
+ +

Checks if the given number is NaN.

+

Return true if the value of the specified variable is not a number.

+
Parameters
+ + +
aVariable to test.
+
+
+
Returns
true if value is not a number.
+ +

Definition at line 62 of file numeric_limits.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/nav_f.png b/doc/api/html/nav_f.png new file mode 100644 index 0000000000000000000000000000000000000000..72a58a529ed3a9ed6aa0c51a79cf207e026deee2 GIT binary patch literal 153 zcmeAS@N?(olHy`uVBq!ia0vp^j6iI`!2~2XGqLUlQVE_ejv*C{Z|{2ZH7M}7UYxc) zn!W8uqtnIQ>_z8U literal 0 HcmV?d00001 diff --git a/doc/api/html/nav_g.png b/doc/api/html/nav_g.png new file mode 100644 index 0000000000000000000000000000000000000000..2093a237a94f6c83e19ec6e5fd42f7ddabdafa81 GIT binary patch literal 95 zcmeAS@N?(olHy`uVBq!ia0vp^j6lrB!3HFm1ilyoDK$?Q$B+ufw|5PB85lU25BhtE tr?otc=hd~V+ws&_A@j8Fiv!KF$B+ufw|5=67#uj90@pIL wZ=Q8~_Ju`#59=RjDrmm`tMD@M=!-l18IR?&vFVdQ&MBb@0HFXL + + + + +Stan: src/stan/prob/distributions/univariate/discrete/neg_binomial.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
neg_binomial.hpp File Reference
+
+
+
#include <boost/random/negative_binomial_distribution.hpp>
+#include <boost/random/variate_generator.hpp>
+#include <boost/math/special_functions/digamma.hpp>
+#include <stan/agrad/partials_vari.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/math/constants.hpp>
+#include <stan/math/functions/multiply_log.hpp>
+#include <stan/math/functions/value_of.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/prob/traits.hpp>
+#include <stan/prob/constants.hpp>
+#include <stan/prob/internal_math.hpp>
+#include <stan/prob/distributions/univariate/continuous/gamma.hpp>
+#include <stan/prob/distributions/univariate/discrete/poisson.hpp>
+#include <stan/math/functions/binomial_coefficient_log.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + + + + + + +

+Functions

template<bool propto, typename T_n , typename T_shape , typename T_inv_scale >
return_type< T_shape,
+T_inv_scale >::type 
stan::prob::neg_binomial_log (const T_n &n, const T_shape &alpha, const T_inv_scale &beta)
 
template<typename T_n , typename T_shape , typename T_inv_scale >
return_type< T_shape,
+T_inv_scale >::type 
stan::prob::neg_binomial_log (const T_n &n, const T_shape &alpha, const T_inv_scale &beta)
 
template<typename T_n , typename T_shape , typename T_inv_scale >
return_type< T_shape,
+T_inv_scale >::type 
stan::prob::neg_binomial_cdf (const T_n &n, const T_shape &alpha, const T_inv_scale &beta)
 
template<typename T_n , typename T_shape , typename T_inv_scale >
return_type< T_shape,
+T_inv_scale >::type 
stan::prob::neg_binomial_cdf_log (const T_n &n, const T_shape &alpha, const T_inv_scale &beta)
 
template<typename T_n , typename T_shape , typename T_inv_scale >
return_type< T_shape,
+T_inv_scale >::type 
stan::prob::neg_binomial_ccdf_log (const T_n &n, const T_shape &alpha, const T_inv_scale &beta)
 
template<class RNG >
int stan::prob::neg_binomial_rng (const double alpha, const double beta, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/neg__binomial_8hpp_source.html b/doc/api/html/neg__binomial_8hpp_source.html new file mode 100644 index 00000000000..fe5cd220eb2 --- /dev/null +++ b/doc/api/html/neg__binomial_8hpp_source.html @@ -0,0 +1,714 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/discrete/neg_binomial.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
neg_binomial.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__DISCRETE__NEG_BINOMIAL_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__DISCRETE__NEG_BINOMIAL_HPP__
+
3 
+
4 #include <boost/random/negative_binomial_distribution.hpp>
+
5 #include <boost/random/variate_generator.hpp>
+
6 
+
7 #include <boost/math/special_functions/digamma.hpp>
+ + +
10 #include <stan/math/constants.hpp>
+ + +
13 #include <stan/meta/traits.hpp>
+
14 #include <stan/prob/traits.hpp>
+
15 #include <stan/prob/constants.hpp>
+ + + + +
20 
+
21 namespace stan {
+
22 
+
23  namespace prob {
+
24 
+
25  // NegBinomial(n|alpha,beta) [alpha > 0; beta > 0; n >= 0]
+
26  template <bool propto,
+
27  typename T_n,
+
28  typename T_shape, typename T_inv_scale>
+
29  typename return_type<T_shape, T_inv_scale>::type
+
30  neg_binomial_log(const T_n& n,
+
31  const T_shape& alpha,
+
32  const T_inv_scale& beta) {
+
33 
+
34  static const char* function = "stan::prob::neg_binomial_log(%1%)";
+
35 
+ + + + + + +
42 
+
43  // check if any vectors are zero length
+
44  if (!(stan::length(n)
+
45  && stan::length(alpha)
+
46  && stan::length(beta)))
+
47  return 0.0;
+
48 
+
49  double logp(0.0);
+
50  if (!check_nonnegative(function, n, "Failures variable", &logp))
+
51  return logp;
+
52  if (!check_finite(function, alpha, "Shape parameter", &logp))
+
53  return logp;
+
54  if (!check_positive(function, alpha, "Shape parameter", &logp))
+
55  return logp;
+
56  if (!check_finite(function, beta, "Inverse scale parameter",
+
57  &logp))
+
58  return logp;
+
59  if (!check_positive(function, beta, "Inverse scale parameter",
+
60  &logp))
+
61  return logp;
+
62  if (!(check_consistent_sizes(function,
+
63  n,alpha,beta,
+
64  "Failures variable",
+
65  "Shape parameter","Inverse scale parameter",
+
66  &logp)))
+
67  return logp;
+
68 
+
69  // check if no variables are involved and prop-to
+ +
71  return 0.0;
+
72 
+ + + +
76  using boost::math::lgamma;
+
77 
+
78  // set up template expressions wrapping scalars into vector views
+
79  VectorView<const T_n> n_vec(n);
+
80  VectorView<const T_shape> alpha_vec(alpha);
+
81  VectorView<const T_inv_scale> beta_vec(beta);
+
82  size_t size = max_size(n, alpha, beta);
+
83 
+ +
85  operands_and_partials(alpha,beta);
+
86 
+
87  size_t len_ab = max_size(alpha,beta);
+ + +
90  lambda(len_ab);
+
91  for (size_t i = 0; i < len_ab; ++i)
+
92  lambda[i] = value_of(alpha_vec[i]) / value_of(beta_vec[i]);
+
93 
+ +
95  log1p_beta(length(beta));
+
96  for (size_t i = 0; i < length(beta); ++i)
+
97  log1p_beta[i] = log1p(value_of(beta_vec[i]));
+
98 
+ +
100  log_beta_m_log1p_beta(length(beta));
+
101  for (size_t i = 0; i < length(beta); ++i)
+
102  log_beta_m_log1p_beta[i] = log(value_of(beta_vec[i])) - log1p_beta[i];
+
103 
+ + +
106  alpha_times_log_beta_over_1p_beta(len_ab);
+
107  for (size_t i = 0; i < len_ab; ++i)
+
108  alpha_times_log_beta_over_1p_beta[i]
+
109  = value_of(alpha_vec[i])
+
110  * log(value_of(beta_vec[i])
+
111  / (1.0 + value_of(beta_vec[i])));
+
112 
+ + +
115  digamma_alpha(length(alpha));
+ +
117  for (size_t i = 0; i < length(alpha); ++i)
+
118  digamma_alpha[i] = digamma(value_of(alpha_vec[i]));
+
119 
+ + +
122  log_beta(length(beta));
+ +
124  for (size_t i = 0; i < length(beta); ++i)
+
125  log_beta[i] = log(value_of(beta_vec[i]));
+
126 
+ + + +
130  lambda_m_alpha_over_1p_beta(len_ab);
+ +
132  for (size_t i = 0; i < len_ab; ++i)
+
133  lambda_m_alpha_over_1p_beta[i] =
+
134  lambda[i]
+
135  - ( value_of(alpha_vec[i])
+
136  / (1.0 + value_of(beta_vec[i])) );
+
137 
+
138  for (size_t i = 0; i < size; i++) {
+
139  if (alpha_vec[i] > 1e10) { // reduces numerically to Poisson
+ +
141  logp -= lgamma(n_vec[i] + 1.0);
+ +
143  logp += multiply_log(n_vec[i], lambda[i]) - lambda[i];
+
144 
+ +
146  operands_and_partials.d_x1[i]
+
147  += n_vec[i] / value_of(alpha_vec[i])
+
148  - 1.0 / value_of(beta_vec[i]);
+ +
150  operands_and_partials.d_x2[i]
+
151  += (lambda[i] - n_vec[i]) / value_of(beta_vec[i]) ;
+
152  } else { // standard density definition
+ +
154  if (n_vec[i] != 0)
+
155  logp += binomial_coefficient_log<double>(n_vec[i]
+
156  + value_of(alpha_vec[i])
+
157  - 1.0,
+
158  n_vec[i]);
+ +
160  logp +=
+
161  alpha_times_log_beta_over_1p_beta[i]
+
162  - n_vec[i] * log1p_beta[i];
+
163 
+ +
165  operands_and_partials.d_x1[i]
+
166  += digamma(value_of(alpha_vec[i]) + n_vec[i])
+
167  - digamma_alpha[i]
+
168  + log_beta_m_log1p_beta[i];
+ +
170  operands_and_partials.d_x2[i]
+
171  += lambda_m_alpha_over_1p_beta[i]
+
172  - n_vec[i] / (value_of(beta_vec[i]) + 1.0);
+
173  }
+
174  }
+
175  return operands_and_partials.to_var(logp);
+
176  }
+
177 
+
178  template <typename T_n,
+
179  typename T_shape, typename T_inv_scale>
+
180  inline
+ +
182  neg_binomial_log(const T_n& n,
+
183  const T_shape& alpha,
+
184  const T_inv_scale& beta) {
+
185  return neg_binomial_log<false>(n,alpha,beta);
+
186  }
+
187 
+
188  // Negative Binomial CDF
+
189  template <typename T_n, typename T_shape,
+
190  typename T_inv_scale>
+ +
192  neg_binomial_cdf(const T_n& n, const T_shape& alpha,
+
193  const T_inv_scale& beta) {
+
194  static const char* function = "stan::prob::neg_binomial_cdf(%1%)";
+
195 
+ + + + + +
201 
+
202  // Ensure non-zero arugment lengths
+
203  if (!(stan::length(n) && stan::length(alpha) && stan::length(beta)))
+
204  return 1.0;
+
205 
+
206  double P(1.0);
+
207 
+
208  // Validate arguments
+
209  if (!check_finite(function, alpha, "Shape parameter", &P))
+
210  return P;
+
211 
+
212  if (!check_positive(function, alpha, "Shape parameter", &P))
+
213  return P;
+
214 
+
215  if (!check_finite(function, beta, "Inverse scale parameter",
+
216  &P))
+
217  return P;
+
218 
+
219  if (!check_positive(function, beta, "Inverse scale parameter",
+
220  &P))
+
221  return P;
+
222 
+
223  if (!(check_consistent_sizes(function,
+
224  n, alpha, beta,
+
225  "Failures variable",
+
226  "Shape parameter",
+
227  "Inverse scale parameter",
+
228  &P)))
+
229  return P;
+
230 
+
231  // Wrap arguments in vector views
+
232  VectorView<const T_n> n_vec(n);
+
233  VectorView<const T_shape> alpha_vec(alpha);
+
234  VectorView<const T_inv_scale> beta_vec(beta);
+
235  size_t size = max_size(n, alpha, beta);
+
236 
+
237  // Compute vectorized CDF and gradient
+
238  using stan::math::value_of;
+
239  using boost::math::ibeta;
+
240  using boost::math::ibeta_derivative;
+
241 
+
242  using boost::math::digamma;
+
243 
+ +
245  operands_and_partials(alpha, beta);
+
246 
+
247  // Explicit return for extreme values
+
248  // The gradients are technically ill-defined, but treated as zero
+
249  for (size_t i = 0; i < stan::length(n); i++) {
+
250  if (value_of(n_vec[i]) <= 0)
+
251  return operands_and_partials.to_var(0.0);
+
252  }
+
253 
+
254  // Cache a few expensive function calls if alpha is a parameter
+ + +
257  digammaN_vec(stan::length(alpha));
+ + +
260  digammaAlpha_vec(stan::length(alpha));
+ + +
263  digammaSum_vec(stan::length(alpha));
+ + +
266  betaFunc_vec(stan::length(alpha));
+
267 
+ +
269 
+
270  for (size_t i = 0; i < stan::length(alpha); i++) {
+
271  const double n_dbl = value_of(n_vec[i]);
+
272  const double alpha_dbl = value_of(alpha_vec[i]);
+
273 
+
274  digammaN_vec[i] = digamma(n_dbl + 1);
+
275  digammaAlpha_vec[i] = digamma(alpha_dbl);
+
276  digammaSum_vec[i] = digamma(n_dbl + alpha_dbl + 1);
+
277  betaFunc_vec[i] = boost::math::beta(n_dbl + 1, alpha_dbl);
+
278  }
+
279  }
+
280 
+
281  for (size_t i = 0; i < size; i++) {
+
282 
+
283  // Explicit results for extreme values
+
284  // The gradients are technically ill-defined, but treated as zero
+
285  if (value_of(n_vec[i])
+
286  == std::numeric_limits<double>::infinity())
+
287  continue;
+
288 
+
289  const double n_dbl = value_of(n_vec[i]);
+
290  const double alpha_dbl = value_of(alpha_vec[i]);
+
291  const double beta_dbl = value_of(beta_vec[i]);
+
292 
+
293  const double p_dbl = beta_dbl / (1.0 + beta_dbl);
+
294  const double d_dbl = 1.0 / ( (1.0 + beta_dbl)
+
295  * (1.0 + beta_dbl) );
+
296 
+
297  const double Pi = ibeta(alpha_dbl, n_dbl + 1.0, p_dbl);
+
298 
+
299  P *= Pi;
+
300 
+ +
302 
+
303  double g1 = 0;
+
304  double g2 = 0;
+
305 
+
306  stan::math::gradRegIncBeta(g1, g2, alpha_dbl,
+
307  n_dbl + 1, p_dbl,
+
308  digammaAlpha_vec[i],
+
309  digammaN_vec[i],
+
310  digammaSum_vec[i],
+
311  betaFunc_vec[i]);
+
312 
+
313  operands_and_partials.d_x1[i]
+
314  += g1 / Pi;
+
315  }
+
316 
+ +
318  operands_and_partials.d_x2[i]
+
319  += d_dbl * ibeta_derivative(alpha_dbl, n_dbl + 1, p_dbl)
+
320  / Pi;
+
321 
+
322  }
+
323 
+ +
325  for(size_t i = 0; i < stan::length(alpha); ++i)
+
326  operands_and_partials.d_x1[i] *= P;
+
327 
+ +
329  for(size_t i = 0; i < stan::length(beta); ++i)
+
330  operands_and_partials.d_x2[i] *= P;
+
331 
+
332  return operands_and_partials.to_var(P);
+
333 
+
334  }
+
335 
+
336  template <typename T_n, typename T_shape,
+
337  typename T_inv_scale>
+ +
339  neg_binomial_cdf_log(const T_n& n, const T_shape& alpha,
+
340  const T_inv_scale& beta) {
+
341  static const char* function = "stan::prob::neg_binomial_cdf_log(%1%)";
+
342 
+ + + + + +
348 
+
349  // Ensure non-zero arugment lengths
+
350  if (!(stan::length(n) && stan::length(alpha) && stan::length(beta)))
+
351  return 0.0;
+
352 
+
353  double P(0.0);
+
354 
+
355  // Validate arguments
+
356  if (!check_finite(function, alpha, "Shape parameter", &P))
+
357  return P;
+
358  if (!check_positive(function, alpha, "Shape parameter", &P))
+
359  return P;
+
360  if (!check_finite(function, beta, "Inverse scale parameter", &P))
+
361  return P;
+
362  if (!check_positive(function, beta, "Inverse scale parameter", &P))
+
363  return P;
+
364  if (!(check_consistent_sizes(function,
+
365  n, alpha, beta,
+
366  "Failures variable",
+
367  "Shape parameter",
+
368  "Inverse scale parameter",
+
369  &P)))
+
370  return P;
+
371 
+
372  // Wrap arguments in vector views
+
373  VectorView<const T_n> n_vec(n);
+
374  VectorView<const T_shape> alpha_vec(alpha);
+
375  VectorView<const T_inv_scale> beta_vec(beta);
+
376  size_t size = max_size(n, alpha, beta);
+
377 
+
378  // Compute vectorized cdf_log and gradient
+
379  using stan::math::value_of;
+
380  using boost::math::ibeta;
+
381  using boost::math::ibeta_derivative;
+
382 
+
383  using boost::math::digamma;
+
384 
+ +
386  operands_and_partials(alpha, beta);
+
387 
+
388  // Explicit return for extreme values
+
389  // The gradients are technically ill-defined, but treated as zero
+
390  for (size_t i = 0; i < stan::length(n); i++) {
+
391  if (value_of(n_vec[i]) <= 0)
+
392  return operands_and_partials.to_var(stan::math::negative_infinity());
+
393  }
+
394 
+
395  // Cache a few expensive function calls if alpha is a parameter
+ + +
398  digammaN_vec(stan::length(alpha));
+ + +
401  digammaAlpha_vec(stan::length(alpha));
+ + +
404  digammaSum_vec(stan::length(alpha));
+ + +
407  betaFunc_vec(stan::length(alpha));
+
408 
+ +
410  for (size_t i = 0; i < stan::length(alpha); i++) {
+
411  const double n_dbl = value_of(n_vec[i]);
+
412  const double alpha_dbl = value_of(alpha_vec[i]);
+
413 
+
414  digammaN_vec[i] = digamma(n_dbl + 1);
+
415  digammaAlpha_vec[i] = digamma(alpha_dbl);
+
416  digammaSum_vec[i] = digamma(n_dbl + alpha_dbl + 1);
+
417  betaFunc_vec[i] = boost::math::beta(n_dbl + 1, alpha_dbl);
+
418  }
+
419  }
+
420 
+
421  for (size_t i = 0; i < size; i++) {
+
422  // Explicit results for extreme values
+
423  // The gradients are technically ill-defined, but treated as zero
+
424  if (value_of(n_vec[i])
+
425  == std::numeric_limits<double>::infinity())
+
426  continue;
+
427 
+
428  const double n_dbl = value_of(n_vec[i]);
+
429  const double alpha_dbl = value_of(alpha_vec[i]);
+
430  const double beta_dbl = value_of(beta_vec[i]);
+
431  const double p_dbl = beta_dbl / (1.0 + beta_dbl);
+
432  const double d_dbl = 1.0 / ( (1.0 + beta_dbl)
+
433  * (1.0 + beta_dbl) );
+
434  const double Pi = ibeta(alpha_dbl, n_dbl + 1.0, p_dbl);
+
435 
+
436  P += log(Pi);
+
437 
+ +
439  double g1 = 0;
+
440  double g2 = 0;
+
441 
+
442  stan::math::gradRegIncBeta(g1, g2, alpha_dbl,
+
443  n_dbl + 1, p_dbl,
+
444  digammaAlpha_vec[i],
+
445  digammaN_vec[i],
+
446  digammaSum_vec[i],
+
447  betaFunc_vec[i]);
+
448  operands_and_partials.d_x1[i] += g1 / Pi;
+
449  }
+ +
451  operands_and_partials.d_x2[i]
+
452  += d_dbl * ibeta_derivative(alpha_dbl, n_dbl + 1, p_dbl) / Pi;
+
453  }
+
454 
+
455  return operands_and_partials.to_var(P);
+
456  }
+
457 
+
458  template <typename T_n, typename T_shape,
+
459  typename T_inv_scale>
+ +
461  neg_binomial_ccdf_log(const T_n& n, const T_shape& alpha,
+
462  const T_inv_scale& beta) {
+
463  static const char* function = "stan::prob::neg_binomial_ccdf_log(%1%)";
+
464 
+ + + + + +
470 
+
471  // Ensure non-zero arugment lengths
+
472  if (!(stan::length(n) && stan::length(alpha) && stan::length(beta)))
+
473  return 0.0;
+
474 
+
475  double P(0.0);
+
476 
+
477  // Validate arguments
+
478  if (!check_finite(function, alpha, "Shape parameter", &P))
+
479  return P;
+
480  if (!check_positive(function, alpha, "Shape parameter", &P))
+
481  return P;
+
482  if (!check_finite(function, beta, "Inverse scale parameter", &P))
+
483  return P;
+
484  if (!check_positive(function, beta, "Inverse scale parameter", &P))
+
485  return P;
+
486  if (!(check_consistent_sizes(function,
+
487  n, alpha, beta,
+
488  "Failures variable",
+
489  "Shape parameter",
+
490  "Inverse scale parameter",
+
491  &P)))
+
492  return P;
+
493 
+
494  // Wrap arguments in vector views
+
495  VectorView<const T_n> n_vec(n);
+
496  VectorView<const T_shape> alpha_vec(alpha);
+
497  VectorView<const T_inv_scale> beta_vec(beta);
+
498  size_t size = max_size(n, alpha, beta);
+
499 
+
500  // Compute vectorized cdf_log and gradient
+
501  using stan::math::value_of;
+
502  using boost::math::ibeta;
+
503  using boost::math::ibeta_derivative;
+
504 
+
505  using boost::math::digamma;
+
506 
+ +
508  operands_and_partials(alpha, beta);
+
509 
+
510  // Explicit return for extreme values
+
511  // The gradients are technically ill-defined, but treated as zero
+
512  for (size_t i = 0; i < stan::length(n); i++) {
+
513  if (value_of(n_vec[i]) <= 0)
+
514  return operands_and_partials.to_var(0.0);
+
515  }
+
516 
+
517  // Cache a few expensive function calls if alpha is a parameter
+ + +
520  digammaN_vec(stan::length(alpha));
+ + +
523  digammaAlpha_vec(stan::length(alpha));
+ + +
526  digammaSum_vec(stan::length(alpha));
+ + +
529  betaFunc_vec(stan::length(alpha));
+
530 
+ +
532  for (size_t i = 0; i < stan::length(alpha); i++) {
+
533  const double n_dbl = value_of(n_vec[i]);
+
534  const double alpha_dbl = value_of(alpha_vec[i]);
+
535 
+
536  digammaN_vec[i] = digamma(n_dbl + 1);
+
537  digammaAlpha_vec[i] = digamma(alpha_dbl);
+
538  digammaSum_vec[i] = digamma(n_dbl + alpha_dbl + 1);
+
539  betaFunc_vec[i] = boost::math::beta(n_dbl + 1, alpha_dbl);
+
540  }
+
541  }
+
542 
+
543  for (size_t i = 0; i < size; i++) {
+
544  // Explicit results for extreme values
+
545  // The gradients are technically ill-defined, but treated as zero
+
546  if (value_of(n_vec[i])
+
547  == std::numeric_limits<double>::infinity())
+
548  return operands_and_partials.to_var(stan::math::negative_infinity());
+
549 
+
550  const double n_dbl = value_of(n_vec[i]);
+
551  const double alpha_dbl = value_of(alpha_vec[i]);
+
552  const double beta_dbl = value_of(beta_vec[i]);
+
553  const double p_dbl = beta_dbl / (1.0 + beta_dbl);
+
554  const double d_dbl = 1.0 / ( (1.0 + beta_dbl)
+
555  * (1.0 + beta_dbl) );
+
556  const double Pi = 1.0 - ibeta(alpha_dbl, n_dbl + 1.0, p_dbl);
+
557 
+
558  P += log(Pi);
+
559 
+ +
561  double g1 = 0;
+
562  double g2 = 0;
+
563 
+
564  stan::math::gradRegIncBeta(g1, g2, alpha_dbl,
+
565  n_dbl + 1, p_dbl,
+
566  digammaAlpha_vec[i],
+
567  digammaN_vec[i],
+
568  digammaSum_vec[i],
+
569  betaFunc_vec[i]);
+
570  operands_and_partials.d_x1[i] -= g1 / Pi;
+
571  }
+ +
573  operands_and_partials.d_x2[i]
+
574  -= d_dbl * ibeta_derivative(alpha_dbl, n_dbl + 1, p_dbl) / Pi;
+
575  }
+
576 
+
577  return operands_and_partials.to_var(P);
+
578  }
+
579 
+
580  template <class RNG>
+
581  inline int
+
582  neg_binomial_rng(const double alpha,
+
583  const double beta,
+
584  RNG& rng) {
+
585  using boost::variate_generator;
+
586  using boost::random::negative_binomial_distribution;
+
587 
+
588  static const char* function = "stan::prob::neg_binomial_rng(%1%)";
+
589 
+ + +
592 
+
593  if (!check_finite(function, alpha, "Shape parameter"))
+
594  return 0;
+
595  if (!check_positive(function, alpha, "Shape parameter"))
+
596  return 0;
+
597  if (!check_finite(function, beta, "Inverse scale parameter"))
+
598  return 0;
+
599  if (!check_positive(function, beta, "Inverse scale parameter"))
+
600  return 0;
+
601 
+
602  return stan::prob::poisson_rng(stan::prob::gamma_rng(alpha,1.0 / beta,
+
603  rng),rng);
+
604  }
+
605  }
+
606 }
+
607 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/nesterov__gradient_8hpp.html b/doc/api/html/nesterov__gradient_8hpp.html new file mode 100644 index 00000000000..7a1d49804b7 --- /dev/null +++ b/doc/api/html/nesterov__gradient_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/optimization/nesterov_gradient.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
nesterov_gradient.hpp File Reference
+
+
+
#include <vector>
+#include <stan/model/util.hpp>
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  stan::optimization::NesterovGradient< M >
 
+ + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::optimization
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/nesterov__gradient_8hpp_source.html b/doc/api/html/nesterov__gradient_8hpp_source.html new file mode 100644 index 00000000000..385ab22ab5c --- /dev/null +++ b/doc/api/html/nesterov__gradient_8hpp_source.html @@ -0,0 +1,258 @@ + + + + + +Stan: src/stan/optimization/nesterov_gradient.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
nesterov_gradient.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__OPTIMIZATION__NESTEROV__GRADIENT_HPP__
+
2 #define __STAN__OPTIMIZATION__NESTEROV__GRADIENT_HPP__
+
3 
+
4 #include <vector>
+
5 
+
6 #include <stan/model/util.hpp>
+
7 
+
8 namespace stan {
+
9 
+
10  namespace optimization {
+
11 
+
12  template <class M>
+ +
14 
+
15  private:
+
16 
+
17  M& model_;
+
18 
+
19  std::vector<double> x_;
+
20  std::vector<double> y_;
+
21  std::vector<int> z_;
+
22 
+
23  double logp_;
+
24  std::vector<double> grad_;
+
25 
+
26  double epsilon_;
+
27  double gamma_;
+
28  double lambda_;
+
29 
+
30  std::ostream* output_stream_;
+
31 
+
32  public:
+
33 
+ +
35 
+
36  if (epsilon_ <= 0)
+
37  epsilon_ = 1;
+
38 
+
39  bool valid = true;
+
40  double old_logp = logp_;
+
41  std::vector<double> old_x = x_;
+
42  std::vector<double> old_grad = grad_;
+
43 
+
44  for (size_t i = 0; i < x_.size(); i++)
+
45  x_[i] += epsilon_ * old_grad[i];
+
46 
+
47  try {
+
48  logp_ = stan::model::log_prob_grad<true,false>(model_,x_, z_,
+
49  grad_, output_stream_);
+
50  valid = true;
+
51  }
+
52  catch (std::exception &ex) {
+
53  valid = false;
+
54  }
+
55 
+
56  if (valid && (logp_ > old_logp) ) {
+
57 
+
58  while (valid && logp_ > old_logp) {
+
59 
+
60  epsilon_ *= 2;
+
61  x_ = old_x;
+
62 
+
63  for (size_t i = 0; i < x_.size(); i++)
+
64  x_[i] += epsilon_ * old_grad[i];
+
65 
+
66  try {
+
67  logp_ = stan::model::log_prob_grad<true,false>(model_, x_, z_,
+
68  grad_, output_stream_);
+
69  }
+
70  catch (std::exception &ex) {
+
71  valid = false;
+
72  }
+
73  }
+
74 
+
75  epsilon_ /= 2;
+
76 
+
77  } else {
+
78 
+
79 
+
80  while (!valid || !(logp_ > old_logp)) {
+
81 
+
82  epsilon_ /= 2;
+
83  x_ = old_x;
+
84 
+
85  for (size_t i = 0; i < x_.size(); i++)
+
86  x_[i] += epsilon_ * old_grad[i];
+
87 
+
88  try {
+
89  logp_ = stan::model::log_prob_grad<true,false>(model_,x_, z_,
+
90  grad_, output_stream_);
+
91  valid = true;
+
92  }
+
93  catch (std::exception &ex) {
+
94  valid = false;
+
95  }
+
96  }
+
97  }
+
98 
+
99  x_ = old_x;
+
100  grad_ = old_grad;
+
101 
+
102  }
+
103 
+ +
105  const std::vector<double>& params_r,
+
106  const std::vector<int>& params_i,
+
107  double epsilon = -1,
+
108  std::ostream* output_stream = 0) :
+
109  model_(model),
+
110  x_(params_r), y_(params_r), z_(params_i),
+
111  epsilon_(epsilon), gamma_(0.0), lambda_(0.0),
+
112  output_stream_(output_stream) {
+
113 
+
114  logp_ = stan::model::log_prob_grad<true,false>(model_,x_, z_,
+
115  grad_, output_stream_);
+ +
117 
+
118  }
+
119 
+
120  double logp() { return logp_; }
+
121  void grad(std::vector<double>& g) { g = grad_; }
+
122  void params_r(std::vector<double>& x) { x = x_; }
+
123 
+
124  double step() {
+
125 
+
126  std::vector<double> old_y = y_;
+
127  double old_lambda = lambda_;
+
128 
+
129  lambda_ = 0.5 * ( 1 + std::sqrt(1.0 + 4.0 * old_lambda * old_lambda) );
+
130  gamma_ = (old_lambda - 1.0) / lambda_;
+
131 
+
132  for (size_t i = 0; i < x_.size(); i++)
+
133  y_[i] = x_[i] + epsilon_ * grad_[i];
+
134 
+
135  for (size_t i = 0; i < x_.size(); i++)
+
136  x_[i] = (1 - gamma_) * y_[i] + gamma_ * old_y[i];
+
137 
+
138  logp_ = stan::model::log_prob_grad<true,false>(model_, x_, z_,
+
139  grad_, output_stream_);
+
140 
+
141  return logp_;
+
142 
+
143  }
+
144 
+
145  };
+
146 
+
147  }
+
148 
+
149 }
+
150 
+
151 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/newton_8hpp.html b/doc/api/html/newton_8hpp.html new file mode 100644 index 00000000000..c34c08c2ca2 --- /dev/null +++ b/doc/api/html/newton_8hpp.html @@ -0,0 +1,141 @@ + + + + + +Stan: src/stan/optimization/newton.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
newton.hpp File Reference
+
+
+
#include <Eigen/Dense>
+#include <Eigen/Cholesky>
+#include <Eigen/Eigenvalues>
+#include <stan/model/util.hpp>
+
+

Go to the source code of this file.

+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::optimization
 
+ + + + + +

+Typedefs

typedef Eigen::Matrix< double,
+Eigen::Dynamic, Eigen::Dynamic > 
stan::optimization::matrix_d
 
typedef Eigen::Matrix< double,
+Eigen::Dynamic, 1 > 
stan::optimization::vector_d
 
+ + + + +

+Functions

template<typename M >
double stan::optimization::newton_step (M &model, std::vector< double > &params_r, std::vector< int > &params_i, std::ostream *output_stream=0)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/newton_8hpp_source.html b/doc/api/html/newton_8hpp_source.html new file mode 100644 index 00000000000..6baf1f46ba8 --- /dev/null +++ b/doc/api/html/newton_8hpp_source.html @@ -0,0 +1,193 @@ + + + + + +Stan: src/stan/optimization/newton.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
newton.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__OPTIMIZATION__NEWTON_HPP__
+
2 #define __STAN__OPTIMIZATION__NEWTON_HPP__
+
3 
+
4 #include <Eigen/Dense>
+
5 #include <Eigen/Cholesky>
+
6 #include <Eigen/Eigenvalues>
+
7 
+
8 #include <stan/model/util.hpp>
+
9 
+
10 namespace stan {
+
11 
+
12  namespace optimization {
+
13 
+
14  typedef Eigen::Matrix<double, Eigen::Dynamic, Eigen::Dynamic> matrix_d;
+
15  typedef Eigen::Matrix<double, Eigen::Dynamic, 1> vector_d;
+
16 
+
17  namespace {
+
18  // Negates any positive eigenvalues in H so that H is negative
+
19  // definite, and then solves Hu = g and stores the result into
+
20  // g. Avoids problems due to non-log-concave distributions.
+
21  void make_negative_definite_and_solve(matrix_d& H, vector_d& g) {
+
22  Eigen::SelfAdjointEigenSolver<matrix_d> solver(H);
+
23  matrix_d eigenvectors = solver.eigenvectors();
+
24  vector_d eigenvalues = solver.eigenvalues();
+
25  vector_d eigenprojections = eigenvectors.transpose() * g;
+
26  for (int i = 0; i < g.size(); i++) {
+
27  eigenprojections[i] = -eigenprojections[i] / fabs(eigenvalues[i]);
+
28  }
+
29  g = eigenvectors * eigenprojections;
+
30  }
+
31  }
+
32 
+
33  template <typename M>
+
34  double newton_step(M& model,
+
35  std::vector<double>& params_r,
+
36  std::vector<int>& params_i,
+
37  std::ostream* output_stream = 0) {
+
38  std::vector<double> gradient;
+
39  std::vector<double> hessian;
+
40 
+
41  double f0
+
42  = stan::model::grad_hess_log_prob<true,false>(model,
+
43  params_r, params_i,
+
44  gradient, hessian);
+
45  matrix_d H(params_r.size(), params_r.size());
+
46  for (size_t i = 0; i < hessian.size(); i++) {
+
47  H(i) = hessian[i];
+
48  }
+
49  vector_d g(params_r.size());
+
50  for (size_t i = 0; i < gradient.size(); i++)
+
51  g(i) = gradient[i];
+
52  make_negative_definite_and_solve(H, g);
+
53 // H.ldlt().solveInPlace(g);
+
54 
+
55  std::vector<double> new_params_r(params_r.size());
+
56  double step_size = 2;
+
57  double min_step_size = 1e-50;
+
58  double f1 = -1e100;
+
59 
+
60  while (f1 < f0) {
+
61  step_size *= 0.5;
+
62  if (step_size < min_step_size)
+
63  return f0;
+
64 
+
65  for (size_t i = 0; i < params_r.size(); i++)
+
66  new_params_r[i] = params_r[i] - step_size * g[i];
+
67  try {
+
68  f1 = stan::model::log_prob_grad<true,false>(model,
+
69  new_params_r,
+
70  params_i, gradient);
+
71  } catch (std::exception& e) {
+
72  // FIXME: this is not a good way to handle a general exception
+
73  f1 = -1e100;
+
74  }
+
75  }
+
76  for (size_t i = 0; i < params_r.size(); i++)
+
77  params_r[i] = new_params_r[i];
+
78 
+
79  return f1;
+
80  }
+
81 
+
82  }
+
83 
+
84 }
+
85 
+
86 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/open.png b/doc/api/html/open.png new file mode 100644 index 0000000000000000000000000000000000000000..30f75c7efe2dd0c9e956e35b69777a02751f048b GIT binary patch literal 123 zcmeAS@N?(olHy`uVBq!ia0vp^oFL4>1|%O$WD@{VPM$7~Ar*{o?;hlAFyLXmaDC0y znK1_#cQqJWPES%4Uujug^TE?jMft$}Eq^WaR~)%f)vSNs&gek&x%A9X9sM + + + + +Stan: src/stan/agrad/rev/operators/operator_divide_equal.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
operator_divide_equal.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/operator__divide__equal_8hpp_source.html b/doc/api/html/operator__divide__equal_8hpp_source.html new file mode 100644 index 00000000000..71fc8bb74ba --- /dev/null +++ b/doc/api/html/operator__divide__equal_8hpp_source.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_divide_equal.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operator_divide_equal.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__OPERATORS__OPERATOR_DIVIDE_EQUAL_HPP__
+
2 #define __STAN__AGRAD__REV__OPERATORS__OPERATOR_DIVIDE_EQUAL_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ +
6 
+
7 namespace stan {
+
8  namespace agrad {
+
9 
+
10  inline var& var::operator/=(const var& b) {
+
11  vi_ = new divide_vv_vari(vi_,b.vi_);
+
12  return *this;
+
13  }
+
14 
+
15  inline var& var::operator/=(const double b) {
+
16  if (b == 1.0)
+
17  return *this;
+
18  vi_ = new divide_vd_vari(vi_,b);
+
19  return *this;
+
20  }
+
21 
+
22  }
+
23 }
+
24 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/operator__minus__equal_8hpp.html b/doc/api/html/operator__minus__equal_8hpp.html new file mode 100644 index 00000000000..3c3cc7d68c6 --- /dev/null +++ b/doc/api/html/operator__minus__equal_8hpp.html @@ -0,0 +1,123 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_minus_equal.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
operator_minus_equal.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/operator__minus__equal_8hpp_source.html b/doc/api/html/operator__minus__equal_8hpp_source.html new file mode 100644 index 00000000000..af0d0146a1f --- /dev/null +++ b/doc/api/html/operator__minus__equal_8hpp_source.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_minus_equal.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operator_minus_equal.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__OPERATORS__OPERATOR_MINUS_EQUAL_HPP__
+
2 #define __STAN__AGRAD__REV__OPERATORS__OPERATOR_MINUS_EQUAL_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ +
6 
+
7 namespace stan {
+
8  namespace agrad {
+
9 
+
10  inline var& var::operator-=(const var& b) {
+
11  vi_ = new subtract_vv_vari(vi_,b.vi_);
+
12  return *this;
+
13  }
+
14 
+
15  inline var& var::operator-=(const double b) {
+
16  if (b == 0.0)
+
17  return *this;
+
18  vi_ = new subtract_vd_vari(vi_,b);
+
19  return *this;
+
20  }
+
21 
+
22  }
+
23 }
+
24 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/operator__multiply__equal_8hpp.html b/doc/api/html/operator__multiply__equal_8hpp.html new file mode 100644 index 00000000000..fbcd591f75e --- /dev/null +++ b/doc/api/html/operator__multiply__equal_8hpp.html @@ -0,0 +1,123 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_multiply_equal.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
operator_multiply_equal.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/operator__multiply__equal_8hpp_source.html b/doc/api/html/operator__multiply__equal_8hpp_source.html new file mode 100644 index 00000000000..4dc6ebbe71e --- /dev/null +++ b/doc/api/html/operator__multiply__equal_8hpp_source.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_multiply_equal.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operator_multiply_equal.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__OPERATORS__OPERATOR_MULTIPLY_EQUAL_HPP__
+
2 #define __STAN__AGRAD__REV__OPERATORS__OPERATOR_MULTIPLY_EQUAL_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ +
6 
+
7 namespace stan {
+
8  namespace agrad {
+
9 
+
10  inline var& var::operator*=(const var& b) {
+
11  vi_ = new multiply_vv_vari(vi_,b.vi_);
+
12  return *this;
+
13  }
+
14 
+
15  inline var& var::operator*=(const double b) {
+
16  if (b == 1.0)
+
17  return *this;
+
18  vi_ = new multiply_vd_vari(vi_,b);
+
19  return *this;
+
20  }
+
21 
+
22  }
+
23 }
+
24 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/operator__plus__equal_8hpp.html b/doc/api/html/operator__plus__equal_8hpp.html new file mode 100644 index 00000000000..3c3f5b3df0a --- /dev/null +++ b/doc/api/html/operator__plus__equal_8hpp.html @@ -0,0 +1,123 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_plus_equal.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
operator_plus_equal.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/operator__plus__equal_8hpp_source.html b/doc/api/html/operator__plus__equal_8hpp_source.html new file mode 100644 index 00000000000..b4710992a22 --- /dev/null +++ b/doc/api/html/operator__plus__equal_8hpp_source.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_plus_equal.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operator_plus_equal.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__OPERATORS__OPERATOR_PLUS_EQUAL_HPP__
+
2 #define __STAN__AGRAD__REV__OPERATORS__OPERATOR_PLUS_EQUAL_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ +
6 
+
7 namespace stan {
+
8  namespace agrad {
+
9 
+
10  inline var& var::operator+=(const var& b) {
+
11  vi_ = new add_vv_vari(vi_,b.vi_);
+
12  return *this;
+
13  }
+
14 
+
15  inline var& var::operator+=(const double b) {
+
16  if (b == 0.0)
+
17  return *this;
+
18  vi_ = new add_vd_vari(vi_,b);
+
19  return *this;
+
20  }
+
21 
+
22  }
+
23 }
+
24 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/operator__unary__decrement_8hpp.html b/doc/api/html/operator__unary__decrement_8hpp.html new file mode 100644 index 00000000000..0d8c91b356f --- /dev/null +++ b/doc/api/html/operator__unary__decrement_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_unary_decrement.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
operator_unary_decrement.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + +

+Functions

var & stan::agrad::operator-- (var &a)
 Prefix decrement operator for variables (C++).
 
var stan::agrad::operator-- (var &a, int)
 Postfix decrement operator for variables (C++).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/operator__unary__decrement_8hpp_source.html b/doc/api/html/operator__unary__decrement_8hpp_source.html new file mode 100644 index 00000000000..487300f8539 --- /dev/null +++ b/doc/api/html/operator__unary__decrement_8hpp_source.html @@ -0,0 +1,142 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_unary_decrement.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operator_unary_decrement.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__OPERATORS__OPERATOR_UNARY_DECREMENT_HPP__
+
2 #define __STAN__AGRAD__REV__OPERATORS__OPERATOR_UNARY_DECREMENT_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ +
6 
+
7 namespace stan {
+
8  namespace agrad {
+
9 
+
10  namespace {
+
11  class decrement_vari : public op_v_vari {
+
12  public:
+
13  decrement_vari(vari* avi) :
+
14  op_v_vari(avi->val_ - 1.0, avi) {
+
15  }
+
16  void chain() {
+
17  avi_->adj_ += adj_;
+
18  }
+
19  };
+
20  }
+
21 
+
35  inline var& operator--(var& a) {
+
36  a.vi_ = new decrement_vari(a.vi_);
+
37  return a;
+
38  }
+
39 
+
51  inline var operator--(var& a, int /*dummy*/) {
+
52  var temp(a);
+
53  a.vi_ = new decrement_vari(a.vi_);
+
54  return temp;
+
55  }
+
56 
+
57  }
+
58 }
+
59 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/operator__unary__increment_8hpp.html b/doc/api/html/operator__unary__increment_8hpp.html new file mode 100644 index 00000000000..43542b23faf --- /dev/null +++ b/doc/api/html/operator__unary__increment_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_unary_increment.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
operator_unary_increment.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + +

+Functions

var & stan::agrad::operator++ (var &a)
 Prefix increment operator for variables (C++).
 
var stan::agrad::operator++ (var &a, int)
 Postfix increment operator for variables (C++).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/operator__unary__increment_8hpp_source.html b/doc/api/html/operator__unary__increment_8hpp_source.html new file mode 100644 index 00000000000..e3e28ebf220 --- /dev/null +++ b/doc/api/html/operator__unary__increment_8hpp_source.html @@ -0,0 +1,142 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_unary_increment.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operator_unary_increment.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__OPERATORS__OPERATOR_UNARY_INCREMENT_HPP__
+
2 #define __STAN__AGRAD__REV__OPERATORS__OPERATOR_UNARY_INCREMENT_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ +
6 
+
7 namespace stan {
+
8  namespace agrad {
+
9 
+
10  namespace {
+
11  class increment_vari : public op_v_vari {
+
12  public:
+
13  increment_vari(vari* avi) :
+
14  op_v_vari(avi->val_ + 1.0, avi) {
+
15  }
+
16  void chain() {
+
17  avi_->adj_ += adj_;
+
18  }
+
19  };
+
20  }
+
21 
+
31  inline var& operator++(var& a) {
+
32  a.vi_ = new increment_vari(a.vi_);
+
33  return a;
+
34  }
+
35 
+
47  inline var operator++(var& a, int /*dummy*/) {
+
48  var temp(a);
+
49  a.vi_ = new increment_vari(a.vi_);
+
50  return temp;
+
51  }
+
52 
+
53  }
+
54 }
+
55 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/operator__unary__minus_8hpp.html b/doc/api/html/operator__unary__minus_8hpp.html new file mode 100644 index 00000000000..f2b8e26ebad --- /dev/null +++ b/doc/api/html/operator__unary__minus_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/fwd/operators/operator_unary_minus.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
operator_unary_minus.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::operator- (const fvar< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/operator__unary__minus_8hpp_source.html b/doc/api/html/operator__unary__minus_8hpp_source.html new file mode 100644 index 00000000000..f467a18c8aa --- /dev/null +++ b/doc/api/html/operator__unary__minus_8hpp_source.html @@ -0,0 +1,126 @@ + + + + + +Stan: src/stan/agrad/fwd/operators/operator_unary_minus.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operator_unary_minus.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__OPERATORS__OPERATOR_UNARY_NEGATIVE_HPP__
+
2 #define __STAN__AGRAD__FWD__OPERATORS__OPERATOR_UNARY_NEGATIVE_HPP__
+
3 
+ +
5 #include <stan/meta/traits.hpp>
+
6 
+
7 namespace stan {
+
8 
+
9  namespace agrad {
+
10 
+
11  template <typename T>
+
12  inline
+
13  fvar<T>
+
14  operator-(const fvar<T>& x) {
+
15  return fvar<T>(-x.val_, -x.d_);
+
16  }
+
17  }
+
18 }
+
19 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/operator__unary__negative_8hpp.html b/doc/api/html/operator__unary__negative_8hpp.html new file mode 100644 index 00000000000..90e6038f803 --- /dev/null +++ b/doc/api/html/operator__unary__negative_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_unary_negative.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
operator_unary_negative.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::operator- (const var &a)
 Unary negation operator for variables (C++).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/operator__unary__negative_8hpp_source.html b/doc/api/html/operator__unary__negative_8hpp_source.html new file mode 100644 index 00000000000..972a4f03536 --- /dev/null +++ b/doc/api/html/operator__unary__negative_8hpp_source.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_unary_negative.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operator_unary_negative.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__OPERATORS__OPERATOR_UNARY_NEGATIVE_HPP__
+
2 #define __STAN__AGRAD__REV__OPERATORS__OPERATOR_UNARY_NEGATIVE_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ +
6 
+
7 namespace stan {
+
8  namespace agrad {
+
9 
+
10  namespace {
+
11  class neg_vari : public op_v_vari {
+
12  public:
+
13  neg_vari(vari* avi) :
+
14  op_v_vari(-(avi->val_), avi) {
+
15  }
+
16  void chain() {
+
17  avi_->adj_ -= adj_;
+
18  }
+
19  };
+
20  }
+
21 
+
30  inline var operator-(const var& a) {
+
31  return var(new neg_vari(a.vi_));
+
32  }
+
33 
+
34  }
+
35 }
+
36 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/operator__unary__not_8hpp.html b/doc/api/html/operator__unary__not_8hpp.html new file mode 100644 index 00000000000..4b36666b734 --- /dev/null +++ b/doc/api/html/operator__unary__not_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_unary_not.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
operator_unary_not.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

bool stan::agrad::operator! (const var &a)
 Prefix logical negation for the value of variables (C++).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/operator__unary__not_8hpp_source.html b/doc/api/html/operator__unary__not_8hpp_source.html new file mode 100644 index 00000000000..8a4dab70126 --- /dev/null +++ b/doc/api/html/operator__unary__not_8hpp_source.html @@ -0,0 +1,122 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_unary_not.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operator_unary_not.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__OPERATORS__OPERATOR_UNARY_NOT_HPP__
+
2 #define __STAN__AGRAD__REV__OPERATORS__OPERATOR_UNARY_NOT_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+
5 
+
6 namespace stan {
+
7  namespace agrad {
+
8 
+
22  inline bool operator!(const var& a) {
+
23  return !a.val();
+
24  }
+
25 
+
26  }
+
27 }
+
28 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/operator__unary__plus_8hpp.html b/doc/api/html/operator__unary__plus_8hpp.html new file mode 100644 index 00000000000..9de027790db --- /dev/null +++ b/doc/api/html/operator__unary__plus_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_unary_plus.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
operator_unary_plus.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::operator+ (const var &a)
 Unary plus operator for variables (C++).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/operator__unary__plus_8hpp_source.html b/doc/api/html/operator__unary__plus_8hpp_source.html new file mode 100644 index 00000000000..07d47db7aff --- /dev/null +++ b/doc/api/html/operator__unary__plus_8hpp_source.html @@ -0,0 +1,122 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_unary_plus.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operator_unary_plus.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__OPERATORS__OPERATOR_UNARY_PLUS_HPP__
+
2 #define __STAN__AGRAD__REV__OPERATORS__OPERATOR_UNARY_PLUS_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+
5 
+
6 namespace stan {
+
7  namespace agrad {
+
8 
+
24  inline var operator+(const var& a) {
+
25  return a;
+
26  }
+
27 
+
28  }
+
29 }
+
30 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/ordered__logistic_8hpp.html b/doc/api/html/ordered__logistic_8hpp.html new file mode 100644 index 00000000000..c9ffb481f4a --- /dev/null +++ b/doc/api/html/ordered__logistic_8hpp.html @@ -0,0 +1,151 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/discrete/ordered_logistic.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
ordered_logistic.hpp File Reference
+
+
+
#include <boost/random/uniform_01.hpp>
+#include <boost/random/variate_generator.hpp>
+#include <stan/prob/distributions/multivariate/discrete/categorical.hpp>
+#include <stan/prob/traits.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/math/functions/inv_logit.hpp>
+#include <stan/math/functions/log1m.hpp>
+#include <stan/math/functions/log1m_exp.hpp>
+#include <stan/math/functions/log1p_exp.hpp>
+#include <stan/math/matrix_error_handling.hpp>
+#include <stan/prob/constants.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + +

+Functions

template<typename T >
stan::prob::log_inv_logit_diff (const T &alpha, const T &beta)
 
template<bool propto, typename T_lambda , typename T_cut >
boost::math::tools::promote_args
+< T_lambda, T_cut >::type 
stan::prob::ordered_logistic_log (int y, const T_lambda &lambda, const Eigen::Matrix< T_cut, Eigen::Dynamic, 1 > &c)
 Returns the (natural) log probability of the specified integer outcome given the continuous location and specified cutpoints in an ordered logistic model.
 
template<typename T_lambda , typename T_cut >
boost::math::tools::promote_args
+< T_lambda, T_cut >::type 
stan::prob::ordered_logistic_log (int y, const T_lambda &lambda, const Eigen::Matrix< T_cut, Eigen::Dynamic, 1 > &c)
 
template<class RNG >
int stan::prob::ordered_logistic_rng (const double eta, const Eigen::Matrix< double, Eigen::Dynamic, 1 > &c, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/ordered__logistic_8hpp_source.html b/doc/api/html/ordered__logistic_8hpp_source.html new file mode 100644 index 00000000000..1e5ee20ba28 --- /dev/null +++ b/doc/api/html/ordered__logistic_8hpp_source.html @@ -0,0 +1,264 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/discrete/ordered_logistic.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
ordered_logistic.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__DISCRETE__ORDERED_LOGISTIC_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__DISCRETE__ORDERED_LOGISTIC_HPP__
+
3 
+
4 #include <boost/random/uniform_01.hpp>
+
5 #include <boost/random/variate_generator.hpp>
+ +
7 
+
8 #include <stan/prob/traits.hpp>
+ + + + + + + +
16 #include <stan/prob/constants.hpp>
+
17 
+
18 
+
19 namespace stan {
+
20 
+
21  namespace prob {
+
22 
+
23  template <typename T>
+
24  inline T log_inv_logit_diff(const T& alpha, const T& beta) {
+
25  using std::exp;
+ + +
28  return beta + log1m_exp(alpha - beta) - log1p_exp(alpha) - log1p_exp(beta);
+
29  }
+
30 
+
31  // y in 0,...,K-1; c.size()==K-2, c increasing, lambda finite
+
58  template <bool propto, typename T_lambda, typename T_cut>
+
59  typename boost::math::tools::promote_args<T_lambda,T_cut>::type
+
60  ordered_logistic_log(int y, const T_lambda& lambda,
+
61  const Eigen::Matrix<T_cut,Eigen::Dynamic,1>& c) {
+
62  using std::exp;
+
63  using std::log;
+ +
65  using stan::math::log1m;
+ +
67 
+
68  static const char* function = "stan::prob::ordered_logistic(%1%)";
+
69 
+ + + + + + + +
77 
+
78  int K = c.size() + 1;
+
79 
+
80  typename boost::math::tools::promote_args<T_lambda,T_cut>::type lp(0.0);
+
81  if (!check_bounded(function, y, 1, K,
+
82  "Random variable",
+
83  &lp))
+
84  return lp;
+
85 
+
86  if (!check_finite(function, lambda,
+
87  "Location parameter", &lp))
+
88  return lp;
+
89 
+
90  if (!check_greater(function, c.size(), 0,
+
91  "Size of cut points parameter",
+
92  &lp))
+
93  return lp;
+
94 
+
95 
+
96  for (int i = 1; i < c.size(); ++i) {
+
97  if (!check_greater(function, c(i), c(i - 1),
+
98  "Cut points parameter",
+
99  &lp))
+
100  return lp;
+
101  }
+
102 
+
103  if (!check_finite(function, c(c.size()-1),
+
104  "Cut points parameter",
+
105  &lp))
+
106  return lp;
+
107 
+
108  if (!check_finite(function, c(0),
+
109  "Cut points parameter",
+
110  &lp))
+
111  return lp;
+
112 
+
113  // log(1 - inv_logit(lambda))
+
114  if (y == 1)
+
115  return -log1p_exp(lambda - c(0));
+
116 
+
117  // log(inv_logit(lambda - c(K-3)));
+
118  if (y == K) {
+
119  return -log1p_exp(c(K-2) - lambda);
+
120  }
+
121 
+
122  // if (2 < y < K) { ... }
+
123  // log(inv_logit(lambda - c(y-2)) - inv_logit(lambda - c(y-1)))
+
124  return log_inv_logit_diff(c(y-2) - lambda,
+
125  c(y-1) - lambda);
+
126 
+
127  }
+
128 
+
129  template <typename T_lambda, typename T_cut>
+
130  typename boost::math::tools::promote_args<T_lambda,T_cut>::type
+
131  ordered_logistic_log(int y, const T_lambda& lambda,
+
132  const Eigen::Matrix<T_cut,Eigen::Dynamic,1>& c) {
+
133  return ordered_logistic_log<false>(y,lambda,c);
+
134  }
+
135 
+
136  template <class RNG>
+
137  inline int
+
138  ordered_logistic_rng(const double eta,
+
139  const Eigen::Matrix<double,Eigen::Dynamic,1>& c,
+
140  RNG& rng) {
+
141  using boost::variate_generator;
+
142  using stan::math::inv_logit;
+
143 
+
144  static const char* function = "stan::prob::ordered_logistic(%1%)";
+
145 
+ + + + + + + +
153 
+
154  if (!check_finite(function, eta,
+
155  "Location parameter"))
+
156  return 0;
+
157  if (!check_greater(function, c.size(), 0,
+
158  "Size of cut points parameter"))
+
159  return 0;
+
160  for (int i = 1; i < c.size(); ++i) {
+
161  if (!check_greater(function, c(i), c(i - 1),
+
162  "Cut points parameter"))
+
163  return 0;
+
164  }
+
165  if (!check_finite(function, c(c.size()-1),
+
166  "Cut points parameter"))
+
167  return 0;
+
168  if (!check_finite(function, c(0),
+
169  "Cut points parameter"))
+
170  return 0;
+
171 
+
172  Eigen::VectorXd cut(c.rows());
+
173  cut(0) = 1 - inv_logit(eta - c(0));
+
174  for(int j = 1; j < c.rows() - 1; j++)
+
175  cut(j) = inv_logit(eta - c(j - 1)) - inv_logit(eta - c(j));
+
176  cut(c.rows() - 1) = inv_logit(eta - c(c.rows() - 2));
+
177 
+
178  return stan::prob::categorical_rng(cut, rng);
+
179  }
+
180  }
+
181 }
+
182 
+
183 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/pages.html b/doc/api/html/pages.html new file mode 100644 index 00000000000..48e5643419e --- /dev/null +++ b/doc/api/html/pages.html @@ -0,0 +1,102 @@ + + + + + +Stan: Related Pages + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + +
+ + + + +
+ +
+ +
+
+
Related Pages
+
+
+
Here is a list of all related documentation pages:
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/pareto_8hpp.html b/doc/api/html/pareto_8hpp.html new file mode 100644 index 00000000000..c6012d00021 --- /dev/null +++ b/doc/api/html/pareto_8hpp.html @@ -0,0 +1,158 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/pareto.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
pareto.hpp File Reference
+
+
+
#include <boost/random/exponential_distribution.hpp>
+#include <boost/random/variate_generator.hpp>
+#include <stan/agrad/partials_vari.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/math/constants.hpp>
+#include <stan/math/functions/multiply_log.hpp>
+#include <stan/math/functions/value_of.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/prob/constants.hpp>
+#include <stan/prob/traits.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + + + + + + +

+Functions

template<bool propto, typename T_y , typename T_scale , typename T_shape >
return_type< T_y, T_scale,
+T_shape >::type 
stan::prob::pareto_log (const T_y &y, const T_scale &y_min, const T_shape &alpha)
 
template<typename T_y , typename T_scale , typename T_shape >
return_type< T_y, T_scale,
+T_shape >::type 
stan::prob::pareto_log (const T_y &y, const T_scale &y_min, const T_shape &alpha)
 
template<typename T_y , typename T_scale , typename T_shape >
return_type< T_y, T_scale,
+T_shape >::type 
stan::prob::pareto_cdf (const T_y &y, const T_scale &y_min, const T_shape &alpha)
 
template<typename T_y , typename T_scale , typename T_shape >
return_type< T_y, T_scale,
+T_shape >::type 
stan::prob::pareto_cdf_log (const T_y &y, const T_scale &y_min, const T_shape &alpha)
 
template<typename T_y , typename T_scale , typename T_shape >
return_type< T_y, T_scale,
+T_shape >::type 
stan::prob::pareto_ccdf_log (const T_y &y, const T_scale &y_min, const T_shape &alpha)
 
template<class RNG >
double stan::prob::pareto_rng (const double y_min, const double alpha, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/pareto_8hpp_source.html b/doc/api/html/pareto_8hpp_source.html new file mode 100644 index 00000000000..41403924bac --- /dev/null +++ b/doc/api/html/pareto_8hpp_source.html @@ -0,0 +1,556 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/pareto.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
pareto.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__PARETO_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__PARETO_HPP__
+
3 
+
4 #include <boost/random/exponential_distribution.hpp>
+
5 #include <boost/random/variate_generator.hpp>
+
6 
+ + + + + +
12 #include <stan/meta/traits.hpp>
+
13 #include <stan/prob/constants.hpp>
+
14 #include <stan/prob/traits.hpp>
+
15 
+
16 
+
17 namespace stan {
+
18  namespace prob {
+
19 
+
20  // Pareto(y|y_m,alpha) [y > y_m; y_m > 0; alpha > 0]
+
21  template <bool propto,
+
22  typename T_y, typename T_scale, typename T_shape>
+
23  typename return_type<T_y,T_scale,T_shape>::type
+
24  pareto_log(const T_y& y, const T_scale& y_min, const T_shape& alpha) {
+
25  static const char* function = "stan::prob::pareto_log(%1%)";
+
26 
+ + + + + +
32 
+
33  // check if any vectors are zero length
+
34  if (!(stan::length(y)
+
35  && stan::length(y_min)
+
36  && stan::length(alpha)))
+
37  return 0.0;
+
38 
+
39  // set up return value accumulator
+
40  double logp(0.0);
+
41 
+
42  // validate args (here done over var, which should be OK)
+
43  if (!check_not_nan(function, y, "Random variable", &logp))
+
44  return logp;
+
45  if (!check_finite(function, y_min, "Scale parameter", &logp))
+
46  return logp;
+
47  if (!check_positive(function, y_min, "Scale parameter", &logp))
+
48  return logp;
+
49  if (!check_finite(function, alpha, "Shape parameter", &logp))
+
50  return logp;
+
51  if (!check_positive(function, alpha, "Shape parameter", &logp))
+
52  return logp;
+
53  if (!(check_consistent_sizes(function,
+
54  y,y_min,alpha,
+
55  "Random variable","Scale parameter","Shape parameter",
+
56  &logp)))
+
57  return logp;
+
58 
+
59  // check if no variables are involved and prop-to
+ +
61  return 0.0;
+
62 
+
63  VectorView<const T_y> y_vec(y);
+
64  VectorView<const T_scale> y_min_vec(y_min);
+
65  VectorView<const T_shape> alpha_vec(alpha);
+
66  size_t N = max_size(y, y_min, alpha);
+
67 
+
68  for (size_t n = 0; n < N; n++) {
+
69  if (y_vec[n] < y_min_vec[n])
+
70  return LOG_ZERO;
+
71  }
+
72 
+
73  // set up template expressions wrapping scalars into vector views
+ +
75  operands_and_partials(y, y_min, alpha);
+
76 
+ +
78  is_vector<T_y>::value> log_y(length(y));
+ +
80  for (size_t n = 0; n < length(y); n++)
+
81  log_y[n] = log(value_of(y_vec[n]));
+
82 
+ + +
85  is_vector<T_y>::value> inv_y(length(y));
+ +
87  for (size_t n = 0; n < length(y); n++)
+
88  inv_y[n] = 1 / value_of(y_vec[n]);
+
89 
+ + +
92  log_y_min(length(y_min));
+ +
94  for (size_t n = 0; n < length(y_min); n++)
+
95  log_y_min[n] = log(value_of(y_min_vec[n]));
+
96 
+ +
98  is_vector<T_shape>::value> log_alpha(length(alpha));
+ +
100  for (size_t n = 0; n < length(alpha); n++)
+
101  log_alpha[n] = log(value_of(alpha_vec[n]));
+
102 
+ +
104  is_vector<T_shape>::value> inv_alpha(length(alpha));
+ +
106  for (size_t n = 0; n < length(alpha); n++)
+
107  inv_alpha[n] = 1 / value_of(alpha_vec[n]);
+
108 
+ +
110 
+
111  for (size_t n = 0; n < N; n++) {
+
112  const double alpha_dbl = value_of(alpha_vec[n]);
+
113  // log probability
+ +
115  logp += log_alpha[n];
+ +
117  logp += alpha_dbl * log_y_min[n];
+ +
119  logp -= alpha_dbl * log_y[n] + log_y[n];
+
120 
+
121  // gradients
+ +
123  operands_and_partials.d_x1[n] -= alpha_dbl * inv_y[n] + inv_y[n];
+ +
125  operands_and_partials.d_x2[n] += alpha_dbl / value_of(y_min_vec[n]);
+ +
127  operands_and_partials.d_x3[n]
+
128  += 1 / alpha_dbl + log_y_min[n] - log_y[n];
+
129  }
+
130  return operands_and_partials.to_var(logp);
+
131  }
+
132 
+
133  template <typename T_y, typename T_scale, typename T_shape>
+
134  inline
+ +
136  pareto_log(const T_y& y, const T_scale& y_min, const T_shape& alpha) {
+
137  return pareto_log<false>(y,y_min,alpha);
+
138  }
+
139 
+
140  template <typename T_y, typename T_scale, typename T_shape>
+ +
142  pareto_cdf(const T_y& y, const T_scale& y_min, const T_shape& alpha) {
+
143 
+
144  // Check sizes
+
145  // Size checks
+
146  if ( !( stan::length(y) && stan::length(y_min) && stan::length(alpha) ) )
+
147  return 1.0;
+
148 
+
149  // Check errors
+
150  static const char* function = "stan::prob::pareto_cdf(%1%)";
+
151 
+ + + + + + +
158  using stan::math::value_of;
+
159 
+
160  double P(1.0);
+
161 
+
162  if (!check_not_nan(function, y, "Random variable", &P))
+
163  return P;
+
164  if (!check_nonnegative(function, y, "Random variable", &P))
+
165  return P;
+
166  if (!check_finite(function, y_min, "Scale parameter", &P))
+
167  return P;
+
168  if (!check_positive(function, y_min, "Scale parameter", &P))
+
169  return P;
+
170  if (!check_finite(function, alpha, "Shape parameter", &P))
+
171  return P;
+
172  if (!check_positive(function, alpha, "Shape parameter", &P))
+
173  return P;
+
174  if (!(check_consistent_sizes(function, y, y_min, alpha,
+
175  "Random variable", "Scale parameter",
+
176  "Shape parameter", &P)))
+
177  return P;
+
178 
+
179  // Wrap arguments in vectors
+
180  VectorView<const T_y> y_vec(y);
+
181  VectorView<const T_scale> y_min_vec(y_min);
+
182  VectorView<const T_shape> alpha_vec(alpha);
+
183  size_t N = max_size(y, y_min, alpha);
+
184 
+ +
186  operands_and_partials(y, y_min, alpha);
+
187 
+
188  // Explicit return for extreme values
+
189  // The gradients are technically ill-defined, but treated as zero
+
190 
+
191  for (size_t i = 0; i < stan::length(y); i++) {
+
192  if (value_of(y_vec[i]) < value_of(y_min_vec[i]))
+
193  return operands_and_partials.to_var(0.0);
+
194  }
+
195 
+
196  // Compute vectorized CDF and its gradients
+
197 
+
198  for (size_t n = 0; n < N; n++) {
+
199 
+
200  // Explicit results for extreme values
+
201  // The gradients are technically ill-defined, but treated as zero
+
202  if (value_of(y_vec[n]) == std::numeric_limits<double>::infinity()) {
+
203  continue;
+
204  }
+
205 
+
206  // Pull out values
+
207  const double log_dbl = log( value_of(y_min_vec[n])
+
208  / value_of(y_vec[n]) );
+
209  const double y_min_inv_dbl = 1.0 / value_of(y_min_vec[n]);
+
210  const double alpha_dbl = value_of(alpha_vec[n]);
+
211 
+
212  // Compute
+
213  const double Pn = 1.0 - exp( alpha_dbl * log_dbl );
+
214 
+
215  P *= Pn;
+
216 
+ +
218  operands_and_partials.d_x1[n]
+
219  += alpha_dbl * y_min_inv_dbl * exp( (alpha_dbl + 1) * log_dbl )
+
220  / Pn;
+ +
222  operands_and_partials.d_x2[n]
+
223  += - alpha_dbl * y_min_inv_dbl * exp( alpha_dbl * log_dbl ) / Pn;
+ +
225  operands_and_partials.d_x3[n]
+
226  += - exp( alpha_dbl * log_dbl ) * log_dbl / Pn;
+
227  }
+
228 
+ +
230  for(size_t n = 0; n < stan::length(y); ++n)
+
231  operands_and_partials.d_x1[n] *= P;
+
232  }
+ +
234  for(size_t n = 0; n < stan::length(y_min); ++n)
+
235  operands_and_partials.d_x2[n] *= P;
+
236  }
+ +
238  for(size_t n = 0; n < stan::length(alpha); ++n)
+
239  operands_and_partials.d_x3[n] *= P;
+
240  }
+
241 
+
242  return operands_and_partials.to_var(P);
+
243  }
+
244 
+
245  template <typename T_y, typename T_scale, typename T_shape>
+ +
247  pareto_cdf_log(const T_y& y, const T_scale& y_min, const T_shape& alpha) {
+
248 
+
249  // Size checks
+
250  if ( !( stan::length(y) && stan::length(y_min) && stan::length(alpha) ) )
+
251  return 0.0;
+
252 
+
253  // Check errors
+
254  static const char* function = "stan::prob::pareto_cdf_log(%1%)";
+
255 
+ + + + + + +
262  using stan::math::value_of;
+
263 
+
264  double P(0.0);
+
265 
+
266  if (!check_not_nan(function, y, "Random variable", &P))
+
267  return P;
+
268  if (!check_nonnegative(function, y, "Random variable", &P))
+
269  return P;
+
270  if (!check_finite(function, y_min, "Scale parameter", &P))
+
271  return P;
+
272  if (!check_positive(function, y_min, "Scale parameter", &P))
+
273  return P;
+
274  if (!check_finite(function, alpha, "Shape parameter", &P))
+
275  return P;
+
276  if (!check_positive(function, alpha, "Shape parameter", &P))
+
277  return P;
+
278  if (!(check_consistent_sizes(function, y, y_min, alpha,
+
279  "Random variable", "Scale parameter",
+
280  "Shape parameter", &P)))
+
281  return P;
+
282 
+
283  // Wrap arguments in vectors
+
284  VectorView<const T_y> y_vec(y);
+
285  VectorView<const T_scale> y_min_vec(y_min);
+
286  VectorView<const T_shape> alpha_vec(alpha);
+
287  size_t N = max_size(y, y_min, alpha);
+
288 
+ +
290  operands_and_partials(y, y_min, alpha);
+
291 
+
292  // Explicit return for extreme values
+
293  // The gradients are technically ill-defined, but treated as zero
+
294 
+
295  for (size_t i = 0; i < stan::length(y); i++) {
+
296  if (value_of(y_vec[i]) < value_of(y_min_vec[i]))
+
297  return operands_and_partials.to_var(stan::math::negative_infinity());
+
298  }
+
299 
+
300  // Compute vectorized cdf_log and its gradients
+
301 
+
302  for (size_t n = 0; n < N; n++) {
+
303 
+
304  // Explicit results for extreme values
+
305  // The gradients are technically ill-defined, but treated as zero
+
306  if (value_of(y_vec[n]) == std::numeric_limits<double>::infinity()) {
+
307  return operands_and_partials.to_var(0.0);
+
308  }
+
309 
+
310  // Pull out values
+
311  const double log_dbl = log( value_of(y_min_vec[n])
+
312  / value_of(y_vec[n]) );
+
313  const double y_min_inv_dbl = 1.0 / value_of(y_min_vec[n]);
+
314  const double alpha_dbl = value_of(alpha_vec[n]);
+
315 
+
316  // Compute
+
317  const double Pn = 1.0 - exp(alpha_dbl * log_dbl );
+
318 
+
319  P += log(Pn);
+
320 
+ +
322  operands_and_partials.d_x1[n]
+
323  += alpha_dbl * y_min_inv_dbl * exp((alpha_dbl + 1) * log_dbl) / Pn;
+ +
325  operands_and_partials.d_x2[n]
+
326  -= alpha_dbl * y_min_inv_dbl * exp( alpha_dbl * log_dbl ) / Pn;
+ +
328  operands_and_partials.d_x3[n]
+
329  -= exp( alpha_dbl * log_dbl ) * log_dbl / Pn;
+
330  }
+
331 
+
332  return operands_and_partials.to_var(P);
+
333  }
+
334 
+
335  template <typename T_y, typename T_scale, typename T_shape>
+ +
337  pareto_ccdf_log(const T_y& y, const T_scale& y_min,
+
338  const T_shape& alpha) {
+
339 
+
340  // Size checks
+
341  if ( !( stan::length(y) && stan::length(y_min) && stan::length(alpha) ) )
+
342  return 0.0;
+
343 
+
344  // Check errors
+
345  static const char* function = "stan::prob::pareto_ccdf_log(%1%)";
+
346 
+ + + + + + +
353  using stan::math::value_of;
+
354 
+
355  double P(0.0);
+
356 
+
357  if (!check_not_nan(function, y, "Random variable", &P))
+
358  return P;
+
359  if (!check_nonnegative(function, y, "Random variable", &P))
+
360  return P;
+
361  if (!check_finite(function, y_min, "Scale parameter", &P))
+
362  return P;
+
363  if (!check_positive(function, y_min, "Scale parameter", &P))
+
364  return P;
+
365  if (!check_finite(function, alpha, "Shape parameter", &P))
+
366  return P;
+
367  if (!check_positive(function, alpha, "Shape parameter", &P))
+
368  return P;
+
369  if (!(check_consistent_sizes(function, y, y_min, alpha,
+
370  "Random variable", "Scale parameter",
+
371  "Shape parameter", &P)))
+
372  return P;
+
373 
+
374  // Wrap arguments in vectors
+
375  VectorView<const T_y> y_vec(y);
+
376  VectorView<const T_scale> y_min_vec(y_min);
+
377  VectorView<const T_shape> alpha_vec(alpha);
+
378  size_t N = max_size(y, y_min, alpha);
+
379 
+ +
381  operands_and_partials(y, y_min, alpha);
+
382 
+
383  // Explicit return for extreme values
+
384  // The gradients are technically ill-defined, but treated as zero
+
385 
+
386  for (size_t i = 0; i < stan::length(y); i++) {
+
387  if (value_of(y_vec[i]) < value_of(y_min_vec[i]))
+
388  return operands_and_partials.to_var(0.0);
+
389  }
+
390 
+
391  // Compute vectorized cdf_log and its gradients
+
392 
+
393  for (size_t n = 0; n < N; n++) {
+
394 
+
395  // Explicit results for extreme values
+
396  // The gradients are technically ill-defined, but treated as zero
+
397  if (value_of(y_vec[n]) == std::numeric_limits<double>::infinity()) {
+
398  return operands_and_partials.to_var(stan::math::negative_infinity());
+
399  }
+
400 
+
401  // Pull out values
+
402  const double log_dbl = log( value_of(y_min_vec[n])
+
403  / value_of(y_vec[n]) );
+
404  const double y_min_inv_dbl = 1.0 / value_of(y_min_vec[n]);
+
405  const double alpha_dbl = value_of(alpha_vec[n]);
+
406 
+
407  P += alpha_dbl * log_dbl;
+
408 
+ +
410  operands_and_partials.d_x1[n] -= alpha_dbl * y_min_inv_dbl
+
411  * exp(log_dbl);
+ +
413  operands_and_partials.d_x2[n] += alpha_dbl * y_min_inv_dbl;
+ +
415  operands_and_partials.d_x3[n] += log_dbl;
+
416  }
+
417 
+
418  return operands_and_partials.to_var(P);
+
419  }
+
420 
+
421  template <class RNG>
+
422  inline double
+
423  pareto_rng(const double y_min,
+
424  const double alpha,
+
425  RNG& rng) {
+
426  using boost::variate_generator;
+
427  using boost::exponential_distribution;
+
428 
+
429  static const char* function = "stan::prob::pareto_rng(%1%)";
+
430 
+ + +
433 
+
434  if (!check_finite(function, y_min, "Scale parameter"))
+
435  return 0;
+
436  if (!check_positive(function, y_min, "Scale parameter"))
+
437  return 0;
+
438  if (!check_finite(function, alpha, "Shape parameter"))
+
439  return 0;
+
440  if (!check_positive(function, alpha, "Shape parameter"))
+
441  return 0;
+
442 
+
443  variate_generator<RNG&, exponential_distribution<> >
+
444  exp_rng(rng, exponential_distribution<>(alpha));
+
445  return y_min * std::exp(exp_rng());
+
446  }
+
447  }
+
448 }
+
449 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/parser_8hpp.html b/doc/api/html/parser_8hpp.html new file mode 100644 index 00000000000..6c0f3ce96ac --- /dev/null +++ b/doc/api/html/parser_8hpp.html @@ -0,0 +1,165 @@ + + + + + +Stan: src/stan/gm/parser.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
parser.hpp File Reference
+
+
+
#include <boost/lexical_cast.hpp>
+#include <boost/fusion/include/adapt_struct.hpp>
+#include <boost/fusion/include/std_pair.hpp>
+#include <boost/config/warning_disable.hpp>
+#include <boost/spirit/include/qi.hpp>
+#include <boost/spirit/include/qi_numeric.hpp>
+#include <boost/spirit/include/classic_position_iterator.hpp>
+#include <boost/spirit/include/phoenix_core.hpp>
+#include <boost/spirit/include/phoenix_function.hpp>
+#include <boost/spirit/include/phoenix_fusion.hpp>
+#include <boost/spirit/include/phoenix_object.hpp>
+#include <boost/spirit/include/phoenix_operator.hpp>
+#include <boost/spirit/include/phoenix_stl.hpp>
+#include <boost/spirit/include/support_multi_pass.hpp>
+#include <boost/tuple/tuple.hpp>
+#include <boost/variant/apply_visitor.hpp>
+#include <boost/variant/recursive_variant.hpp>
+#include <cstddef>
+#include <iomanip>
+#include <iostream>
+#include <istream>
+#include <map>
+#include <set>
+#include <sstream>
+#include <string>
+#include <utility>
+#include <vector>
+#include <stdexcept>
+#include <stan/gm/ast.hpp>
+#include <stan/gm/grammars/program_grammar.hpp>
+#include <stan/gm/grammars/whitespace_grammar.hpp>
+#include <stan/gm/grammars/expression_grammar.hpp>
+#include <stan/gm/grammars/statement_grammar.hpp>
+#include <stan/gm/grammars/var_decls_grammar.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+ + + + + + + +

+Functions

bool stan::gm::is_space (char c)
 
bool stan::gm::is_nonempty (std::string &s)
 
bool stan::gm::parse (std::ostream *output_stream, std::istream &input, const std::string &filename, const std::string &model_name, program &result)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/parser_8hpp_source.html b/doc/api/html/parser_8hpp_source.html new file mode 100644 index 00000000000..f947de7b0f7 --- /dev/null +++ b/doc/api/html/parser_8hpp_source.html @@ -0,0 +1,282 @@ + + + + + +Stan: src/stan/gm/parser.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
parser.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__PARSER__PARSER__HPP__
+
2 #define __STAN__GM__PARSER__PARSER__HPP__
+
3 
+
4 #include <boost/lexical_cast.hpp>
+
5 #include <boost/fusion/include/adapt_struct.hpp>
+
6 #include <boost/fusion/include/std_pair.hpp>
+
7 #include <boost/config/warning_disable.hpp>
+
8 #include <boost/spirit/include/qi.hpp>
+
9 #include <boost/spirit/include/qi_numeric.hpp>
+
10 #include <boost/spirit/include/classic_position_iterator.hpp>
+
11 #include <boost/spirit/include/phoenix_core.hpp>
+
12 #include <boost/spirit/include/phoenix_function.hpp>
+
13 #include <boost/spirit/include/phoenix_fusion.hpp>
+
14 #include <boost/spirit/include/phoenix_object.hpp>
+
15 #include <boost/spirit/include/phoenix_operator.hpp>
+
16 #include <boost/spirit/include/phoenix_stl.hpp>
+
17 #include <boost/spirit/include/support_multi_pass.hpp>
+
18 #include <boost/tuple/tuple.hpp>
+
19 #include <boost/variant/apply_visitor.hpp>
+
20 #include <boost/variant/recursive_variant.hpp>
+
21 
+
22 #include <cstddef>
+
23 #include <iomanip>
+
24 #include <iostream>
+
25 #include <istream>
+
26 #include <map>
+
27 #include <set>
+
28 #include <sstream>
+
29 #include <string>
+
30 #include <utility>
+
31 #include <vector>
+
32 #include <stdexcept>
+
33 
+
34 #include <stan/gm/ast.hpp>
+
35 
+ + + + + +
41 
+
42 namespace stan {
+
43 
+
44  namespace gm {
+
45 
+
46  bool is_space(char c) {
+
47  return c == ' ' || c == '\n' || c == '\r' || c == '\t';
+
48  }
+
49 
+
50  bool is_nonempty(std::string& s) {
+
51  for (size_t i = 0; i < s.size(); ++i)
+
52  if (!is_space(s[i]))
+
53  return true;
+
54  return false;
+
55  }
+
56 
+
57  // Cut and paste source for iterator & reporting pattern:
+
58  // http://boost-spirit.com/home/articles/qi-example
+
59  // /tracking-the-input-position-while-parsing/
+
60  // http://boost-spirit.com/dl_more/parsing_tracking_position
+
61  // /stream_iterator_errorposition_parsing.cpp
+
62  inline bool parse(std::ostream* output_stream,
+
63  std::istream& input,
+
64  const std::string& filename,
+
65  const std::string& model_name,
+
66  program& result) {
+
67  namespace classic = boost::spirit::classic;
+
68 
+
69  using boost::spirit::classic::position_iterator2;
+
70  using boost::spirit::multi_pass;
+
71  using boost::spirit::make_default_multi_pass;
+
72  using std::istreambuf_iterator;
+
73 
+
74  using boost::spirit::qi::expectation_failure;
+
75  using boost::spirit::classic::file_position_base;
+
76  using boost::spirit::qi::phrase_parse;
+
77 
+
78 
+
79  // iterate over stream input
+
80  typedef istreambuf_iterator<char> base_iterator_type;
+
81  typedef multi_pass<base_iterator_type> forward_iterator_type;
+
82  typedef position_iterator2<forward_iterator_type> pos_iterator_type;
+
83 
+
84  base_iterator_type in_begin(input);
+
85 
+
86  forward_iterator_type fwd_begin = make_default_multi_pass(in_begin);
+
87  forward_iterator_type fwd_end;
+
88 
+
89  pos_iterator_type position_begin(fwd_begin, fwd_end, filename);
+
90  pos_iterator_type position_end;
+
91 
+
92  program_grammar<pos_iterator_type> prog_grammar(model_name);
+ +
94 
+
95  bool parse_succeeded = false;
+
96  try {
+
97  parse_succeeded = phrase_parse(position_begin,
+
98  position_end,
+
99  prog_grammar,
+
100  whitesp_grammar,
+
101  result);
+
102  std::string diagnostics = prog_grammar.error_msgs_.str();
+
103  if (output_stream && is_nonempty(diagnostics)) {
+
104  *output_stream << "DIAGNOSTIC(S) FROM PARSER:"
+
105  << std::endl
+
106  << diagnostics
+
107  << std::endl;
+
108  }
+
109  } catch (const expectation_failure<pos_iterator_type>& e) {
+
110  const file_position_base<std::string>& pos = e.first.get_position();
+
111  std::stringstream msg;
+
112  msg << "EXPECTATION FAILURE LOCATION: file=" << pos.file
+
113  << "; line=" << pos.line
+
114  << ", column=" << pos.column
+
115  << std::endl;
+
116  msg << std::endl << e.first.get_currentline()
+
117  << std::endl;
+
118  for (int i = 2; i < pos.column; ++i)
+
119  msg << ' ';
+
120  msg << " ^-- here"
+
121  << std::endl << std::endl;
+
122  std::string diagnostics = prog_grammar.error_msgs_.str();
+
123  if (output_stream && is_nonempty(diagnostics)) {
+
124  msg << std::endl
+
125  << "DIAGNOSTIC(S) FROM PARSER:"
+
126  << diagnostics
+
127  << std::endl;
+
128  }
+
129  throw std::invalid_argument(msg.str());
+
130 
+
131  } catch (const std::runtime_error& e) {
+
132  std::stringstream msg;
+
133  msg << "LOCATION: unknown" << std::endl;
+
134 
+
135  msg << "DIAGNOSTICS FROM PARSER:" << std::endl;
+
136  msg << prog_grammar.error_msgs_.str() << std::endl << std::endl;
+
137  throw std::invalid_argument(msg.str());
+
138  }
+
139 
+
140  bool consumed_all_input = (position_begin == position_end);
+
141  bool success = parse_succeeded && consumed_all_input;
+
142 
+
143  if (!success) {
+
144  std::stringstream msg;
+
145  if (!parse_succeeded)
+
146  msg << "PARSE DID NOT SUCCEED." << std::endl;
+
147  if (!consumed_all_input)
+
148  msg << "ERROR: non-whitespace beyond end of program:" << std::endl;
+
149 
+
150  const file_position_base<std::string>& pos
+
151  = position_begin.get_position();
+
152  msg << "LOCATION: file=" << pos.file
+
153  << "; line=" << pos.line
+
154  << ", column=" << pos.column
+
155  << std::endl;
+
156  msg << position_begin.get_currentline()
+
157  << std::endl;
+
158  for (int i = 2; i < pos.column; ++i)
+
159  msg << ' ';
+
160  msg << " ^-- starting here"
+
161  << std::endl << std::endl;
+
162 
+
163  msg << "DIAGNOSTICS FROM PARSER:" << std::endl;
+
164  msg << prog_grammar.error_msgs_.str() << std::endl << std::endl;
+
165 
+
166  throw std::invalid_argument(msg.str());
+
167  }
+
168  return true;
+
169  }
+
170 
+
171 
+
172  }
+
173 }
+
174 
+
175 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/partials__vari_8hpp.html b/doc/api/html/partials__vari_8hpp.html new file mode 100644 index 00000000000..0fab6929912 --- /dev/null +++ b/doc/api/html/partials__vari_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/agrad/partials_vari.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
partials_vari.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + +

+Classes

class  stan::agrad::partials_vari
 
struct  stan::agrad::OperandsAndPartials< T1, T2, T3, T4, T5, T6, T_return_type >
 A variable implementation that stores operands and derivatives with respect to the variable. More...
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/partials__vari_8hpp_source.html b/doc/api/html/partials__vari_8hpp_source.html new file mode 100644 index 00000000000..cb34cfd886d --- /dev/null +++ b/doc/api/html/partials__vari_8hpp_source.html @@ -0,0 +1,250 @@ + + + + + +Stan: src/stan/agrad/partials_vari.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
partials_vari.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__PARTIALS_VARI_HPP__
+
2 #define __STAN__AGRAD__PARTIALS_VARI_HPP__
+
3 
+
4 #include <stan/meta/traits.hpp>
+
5 #include <stan/agrad/rev/var.hpp>
+ +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  class partials_vari : public vari {
+
12  private:
+
13  const size_t N_;
+
14  vari** operands_;
+
15  double* partials_;
+
16  public:
+
17  partials_vari(double value,
+
18  size_t N,
+
19  vari** operands, double* partials)
+
20  : vari(value),
+
21  N_(N),
+
22  operands_(operands),
+
23  partials_(partials) { }
+
24  void chain() {
+
25  for (size_t n = 0; n < N_; ++n)
+
26  operands_[n]->adj_ += adj_ * partials_[n];
+
27  }
+
28  };
+
29 
+
30  namespace {
+
31  template<typename T>
+
32  T partials_to_var(double logp, size_t /* nvaris */,
+
33  agrad::vari** /* all_varis */,
+
34  double* /* all_partials */) {
+
35  return logp;
+
36  }
+
37  template<>
+
38  var partials_to_var<var>(double logp, size_t nvaris,
+
39  agrad::vari** all_varis,
+
40  double* all_partials) {
+
41  return var(new agrad::partials_vari(logp, nvaris, all_varis, all_partials));
+
42  }
+
43 
+
44  template<typename T,
+
45  bool is_vec = is_vector<T>::value,
+
46  bool is_const = is_constant_struct<T>::value>
+
47  struct set_varis {
+
48  inline size_t set(agrad::vari** /*varis*/, const T& /*x*/) {
+
49  return 0U;
+
50  }
+
51  };
+
52  template<typename T>
+
53  struct set_varis <T,true,false>{
+
54  inline size_t set(agrad::vari** varis, const T& x) {
+
55  for (size_t n = 0; n < length(x); n++)
+
56  varis[n] = x[n].vi_;
+
57  return length(x);
+
58  }
+
59  };
+
60  template<>
+
61  struct set_varis<agrad::var, false, false> {
+
62  inline size_t set(agrad::vari** varis, const agrad::var& x) {
+
63  varis[0] = x.vi_;
+
64  return (1);
+
65  }
+
66  };
+
67  }
+
68 
+
73  template<typename T1=double, typename T2=double, typename T3=double,
+
74  typename T4=double, typename T5=double, typename T6=double,
+
75  typename T_return_type=typename return_type<T1,T2,T3,T4,T5,T6>::type>
+ + +
78  size_t nvaris;
+ +
80  double* all_partials;
+
81 
+ + + + + + +
88 
+
89  OperandsAndPartials(const T1& x1=0, const T2& x2=0, const T3& x3=0,
+
90  const T4& x4=0, const T5& x5=0, const T6& x6=0)
+
91  : nvaris(!is_constant_struct<T1>::value * length(x1) +
+
92  !is_constant_struct<T2>::value * length(x2) +
+
93  !is_constant_struct<T3>::value * length(x3) +
+
94  !is_constant_struct<T4>::value * length(x4) +
+
95  !is_constant_struct<T5>::value * length(x5) +
+
96  !is_constant_struct<T6>::value * length(x6)),
+
97  all_varis((agrad::vari**)agrad::chainable::operator new(sizeof(agrad::vari*) * nvaris)),
+
98  all_partials((double*)agrad::chainable::operator new(sizeof(double) * nvaris)),
+ + +
101  + (!is_constant_struct<T1>::value) * length(x1)),
+ +
103  + (!is_constant_struct<T1>::value) * length(x1)
+
104  + (!is_constant_struct<T2>::value) * length(x2)),
+ +
106  + (!is_constant_struct<T1>::value) * length(x1)
+
107  + (!is_constant_struct<T2>::value) * length(x2)
+
108  + (!is_constant_struct<T3>::value) * length(x3)),
+ +
110  + (!is_constant_struct<T1>::value) * length(x1)
+
111  + (!is_constant_struct<T2>::value) * length(x2)
+
112  + (!is_constant_struct<T3>::value) * length(x3)
+
113  + (!is_constant_struct<T4>::value) * length(x4)),
+ +
115  + (!is_constant_struct<T1>::value) * length(x1)
+
116  + (!is_constant_struct<T2>::value) * length(x2)
+
117  + (!is_constant_struct<T3>::value) * length(x3)
+
118  + (!is_constant_struct<T4>::value) * length(x4)
+
119  + (!is_constant_struct<T5>::value) * length(x5))
+
120  {
+
121  size_t base = 0;
+ +
123  base += set_varis<T1>().set(&all_varis[base], x1);
+ +
125  base += set_varis<T2>().set(&all_varis[base], x2);
+ +
127  base += set_varis<T3>().set(&all_varis[base], x3);
+ +
129  base += set_varis<T4>().set(&all_varis[base], x4);
+ +
131  base += set_varis<T5>().set(&all_varis[base], x5);
+ +
133  set_varis<T6>().set(&all_varis[base], x6);
+
134  std::fill(all_partials, all_partials+nvaris, 0);
+
135  }
+
136 
+
137  T_return_type
+
138  to_var(double logp) {
+
139  return partials_to_var<T_return_type>(logp, nvaris, all_varis, all_partials);
+
140  }
+
141  };
+
142 
+
143  }
+
144 }
+
145 
+
146 
+
147 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/poisson_8hpp.html b/doc/api/html/poisson_8hpp.html new file mode 100644 index 00000000000..804b21fa7e4 --- /dev/null +++ b/doc/api/html/poisson_8hpp.html @@ -0,0 +1,161 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/discrete/poisson.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
poisson.hpp File Reference
+
+
+
#include <boost/random/poisson_distribution.hpp>
+#include <boost/random/variate_generator.hpp>
+#include <limits>
+#include <boost/math/special_functions/fpclassify.hpp>
+#include <stan/agrad/partials_vari.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/math/constants.hpp>
+#include <stan/math/functions/multiply_log.hpp>
+#include <stan/math/functions/value_of.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/prob/traits.hpp>
+#include <stan/prob/constants.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

template<bool propto, typename T_n , typename T_rate >
return_type< T_rate >::type stan::prob::poisson_log (const T_n &n, const T_rate &lambda)
 
template<typename T_n , typename T_rate >
return_type< T_rate >::type stan::prob::poisson_log (const T_n &n, const T_rate &lambda)
 
template<bool propto, typename T_n , typename T_log_rate >
return_type< T_log_rate >::type stan::prob::poisson_log_log (const T_n &n, const T_log_rate &alpha)
 
template<typename T_n , typename T_log_rate >
return_type< T_log_rate >::type stan::prob::poisson_log_log (const T_n &n, const T_log_rate &alpha)
 
template<typename T_n , typename T_rate >
return_type< T_rate >::type stan::prob::poisson_cdf (const T_n &n, const T_rate &lambda)
 
template<typename T_n , typename T_rate >
return_type< T_rate >::type stan::prob::poisson_cdf_log (const T_n &n, const T_rate &lambda)
 
template<typename T_n , typename T_rate >
return_type< T_rate >::type stan::prob::poisson_ccdf_log (const T_n &n, const T_rate &lambda)
 
template<class RNG >
int stan::prob::poisson_rng (const double lambda, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/poisson_8hpp_source.html b/doc/api/html/poisson_8hpp_source.html new file mode 100644 index 00000000000..2e8fbbb6f50 --- /dev/null +++ b/doc/api/html/poisson_8hpp_source.html @@ -0,0 +1,531 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/discrete/poisson.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
poisson.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__DISCRETE__POISSON_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__DISCRETE__POISSON_HPP__
+
3 
+
4 #include <boost/random/poisson_distribution.hpp>
+
5 #include <boost/random/variate_generator.hpp>
+
6 
+
7 #include <limits>
+
8 #include <boost/math/special_functions/fpclassify.hpp>
+
9 
+ + +
12 #include <stan/math/constants.hpp>
+ + +
15 #include <stan/meta/traits.hpp>
+
16 #include <stan/prob/traits.hpp>
+
17 #include <stan/prob/constants.hpp>
+
18 
+
19 namespace stan {
+
20 
+
21  namespace prob {
+
22 
+
23  // Poisson(n|lambda) [lambda > 0; n >= 0]
+
24  template <bool propto,
+
25  typename T_n, typename T_rate>
+
26  typename return_type<T_rate>::type
+
27  poisson_log(const T_n& n, const T_rate& lambda) {
+
28 
+
29  static const char* function = "stan::prob::poisson_log(%1%)";
+
30 
+
31  using boost::math::lgamma;
+ + + + + +
37 
+
38  // check if any vectors are zero length
+
39  if (!(stan::length(n)
+
40  && stan::length(lambda)))
+
41  return 0.0;
+
42 
+
43  // set up return value accumulator
+
44  double logp(0.0);
+
45 
+
46  // validate args
+
47  if (!check_nonnegative(function, n, "Random variable", &logp))
+
48  return logp;
+
49  if (!check_not_nan(function, lambda,
+
50  "Rate parameter", &logp))
+
51  return logp;
+
52  if (!check_nonnegative(function, lambda,
+
53  "Rate parameter", &logp))
+
54  return logp;
+
55  if (!(check_consistent_sizes(function,
+
56  n,lambda,
+
57  "Random variable","Rate parameter",
+
58  &logp)))
+
59  return logp;
+
60 
+
61  // check if no variables are involved and prop-to
+ +
63  return 0.0;
+
64 
+
65  // set up expression templates wrapping scalars/vecs into vector views
+
66  VectorView<const T_n> n_vec(n);
+
67  VectorView<const T_rate> lambda_vec(lambda);
+
68  size_t size = max_size(n, lambda);
+
69 
+
70  for (size_t i = 0; i < size; i++)
+
71  if (boost::math::isinf(lambda_vec[i]))
+
72  return LOG_ZERO;
+
73  for (size_t i = 0; i < size; i++)
+
74  if (lambda_vec[i] == 0 && n_vec[i] != 0)
+
75  return LOG_ZERO;
+
76 
+
77  // return accumulator with gradients
+
78  agrad::OperandsAndPartials<T_rate> operands_and_partials(lambda);
+
79 
+ +
81  for (size_t i = 0; i < size; i++) {
+
82  if (!(lambda_vec[i] == 0 && n_vec[i] == 0)) {
+ +
84  logp -= lgamma(n_vec[i] + 1.0);
+ +
86  logp += multiply_log(n_vec[i], value_of(lambda_vec[i]))
+
87  - value_of(lambda_vec[i]);
+
88  }
+
89 
+
90  // gradients
+ +
92  operands_and_partials.d_x1[i]
+
93  += n_vec[i] / value_of(lambda_vec[i]) - 1.0;
+
94 
+
95  }
+
96 
+
97 
+
98  return operands_and_partials.to_var(logp);
+
99  }
+
100 
+
101  template <typename T_n,
+
102  typename T_rate>
+
103  inline
+ +
105  poisson_log(const T_n& n, const T_rate& lambda) {
+
106  return poisson_log<false>(n,lambda);
+
107  }
+
108 
+
109  // PoissonLog(n|alpha) [n >= 0] = Poisson(n|exp(alpha))
+
110  template <bool propto,
+
111  typename T_n, typename T_log_rate>
+ +
113  poisson_log_log(const T_n& n, const T_log_rate& alpha) {
+
114 
+
115  static const char* function = "stan::prob::poisson_log_log(%1%)";
+
116 
+
117  using boost::math::lgamma;
+ + +
120  using stan::math::value_of;
+ + +
123  using std::exp;
+
124 
+
125  // check if any vectors are zero length
+
126  if (!(stan::length(n)
+
127  && stan::length(alpha)))
+
128  return 0.0;
+
129 
+
130  // set up return value accumulator
+
131  double logp(0.0);
+
132 
+
133  // validate args
+
134  if (!check_nonnegative(function, n, "Random variable", &logp))
+
135  return logp;
+
136  if (!check_not_nan(function, alpha,
+
137  "Log rate parameter", &logp))
+
138  return logp;
+
139  if (!(check_consistent_sizes(function,
+
140  n,alpha,
+
141  "Random variable","Log rate parameter",
+
142  &logp)))
+
143  return logp;
+
144 
+
145  // check if no variables are involved and prop-to
+ +
147  return 0.0;
+
148 
+
149  // set up expression templates wrapping scalars/vecs into vector views
+
150  VectorView<const T_n> n_vec(n);
+
151  VectorView<const T_log_rate> alpha_vec(alpha);
+
152  size_t size = max_size(n, alpha);
+
153 
+
154  // FIXME: first loop size of alpha_vec, second loop if-ed for size==1
+
155  for (size_t i = 0; i < size; i++)
+
156  if (std::numeric_limits<double>::infinity() == alpha_vec[i])
+
157  return LOG_ZERO;
+
158  for (size_t i = 0; i < size; i++)
+
159  if (-std::numeric_limits<double>::infinity() == alpha_vec[i]
+
160  && n_vec[i] != 0)
+
161  return LOG_ZERO;
+
162 
+
163  // return accumulator with gradients
+
164  agrad::OperandsAndPartials<T_log_rate> operands_and_partials(alpha);
+
165 
+
166  // FIXME: cache value_of for alpha_vec? faster if only one?
+ + +
169  exp_alpha(length(alpha));
+
170  for (size_t i = 0; i < length(alpha); i++)
+ +
172  exp_alpha[i] = exp(value_of(alpha_vec[i]));
+ +
174  for (size_t i = 0; i < size; i++) {
+
175  if (!(alpha_vec[i] == -std::numeric_limits<double>::infinity()
+
176  && n_vec[i] == 0)) {
+ +
178  logp -= lgamma(n_vec[i] + 1.0);
+ +
180  logp += n_vec[i] * value_of(alpha_vec[i]) - exp_alpha[i];
+
181  }
+
182 
+
183  // gradients
+ +
185  operands_and_partials.d_x1[i] += n_vec[i] - exp_alpha[i];
+
186  }
+
187  return operands_and_partials.to_var(logp);
+
188  }
+
189 
+
190  template <typename T_n,
+
191  typename T_log_rate>
+
192  inline
+ +
194  poisson_log_log(const T_n& n, const T_log_rate& alpha) {
+
195  return poisson_log_log<false>(n,alpha);
+
196  }
+
197 
+
198  // Poisson CDF
+
199  template <typename T_n, typename T_rate>
+ +
201  poisson_cdf(const T_n& n, const T_rate& lambda) {
+
202  static const char* function = "stan::prob::poisson_cdf(%1%)";
+
203 
+ + +
206  using stan::math::value_of;
+ +
208 
+
209  // Ensure non-zero argument slengths
+
210  if (!(stan::length(n) && stan::length(lambda)))
+
211  return 1.0;
+
212 
+
213  double P(1.0);
+
214 
+
215  // Validate arguments
+
216  if (!check_not_nan(function, lambda, "Rate parameter", &P))
+
217  return P;
+
218  if (!check_nonnegative(function, lambda, "Rate parameter", &P))
+
219  return P;
+
220  if (!(check_consistent_sizes(function, n,lambda,
+
221  "Random variable","Rate parameter",
+
222  &P)))
+
223  return P;
+
224 
+
225  // Wrap arguments into vector views
+
226  VectorView<const T_n> n_vec(n);
+
227  VectorView<const T_rate> lambda_vec(lambda);
+
228  size_t size = max_size(n, lambda);
+
229 
+
230  // Compute vectorized CDF and gradient
+
231  using stan::math::value_of;
+
232  using boost::math::gamma_p_derivative;
+
233  using boost::math::gamma_q;
+
234 
+
235  agrad::OperandsAndPartials<T_rate> operands_and_partials(lambda);
+
236 
+
237  // Explicit return for extreme values
+
238  // The gradients are technically ill-defined, but treated as zero
+
239  for (size_t i = 0; i < stan::length(n); i++) {
+
240  if (value_of(n_vec[i]) < 0)
+
241  return operands_and_partials.to_var(0.0);
+
242  }
+
243 
+
244  for (size_t i = 0; i < size; i++) {
+
245  // Explicit results for extreme values
+
246  // The gradients are technically ill-defined, but treated as zero
+
247  if (value_of(n_vec[i]) == std::numeric_limits<double>::infinity())
+
248  continue;
+
249 
+
250  const double n_dbl = value_of(n_vec[i]);
+
251  const double lambda_dbl = value_of(lambda_vec[i]);
+
252  const double Pi = gamma_q(n_dbl+1, lambda_dbl);
+
253 
+
254  P *= Pi;
+
255 
+ +
257  operands_and_partials.d_x1[i]
+
258  -= gamma_p_derivative(n_dbl + 1, lambda_dbl) / Pi;
+
259  }
+
260 
+ +
262  for(size_t i = 0; i < stan::length(lambda); ++i)
+
263  operands_and_partials.d_x1[i] *= P;
+
264 
+
265  return operands_and_partials.to_var(P);
+
266  }
+
267 
+
268  template <typename T_n, typename T_rate>
+ +
270  poisson_cdf_log(const T_n& n, const T_rate& lambda) {
+
271  static const char* function = "stan::prob::poisson_cdf_log(%1%)";
+
272 
+ + +
275  using stan::math::value_of;
+ +
277 
+
278  // Ensure non-zero argument slengths
+
279  if (!(stan::length(n) && stan::length(lambda)))
+
280  return 0.0;
+
281 
+
282  double P(0.0);
+
283 
+
284  // Validate arguments
+
285  if (!check_not_nan(function, lambda, "Rate parameter", &P))
+
286  return P;
+
287  if (!check_nonnegative(function, lambda, "Rate parameter", &P))
+
288  return P;
+
289  if (!(check_consistent_sizes(function, n,lambda,
+
290  "Random variable","Rate parameter",
+
291  &P)))
+
292  return P;
+
293 
+
294  // Wrap arguments into vector views
+
295  VectorView<const T_n> n_vec(n);
+
296  VectorView<const T_rate> lambda_vec(lambda);
+
297  size_t size = max_size(n, lambda);
+
298 
+
299  // Compute vectorized cdf_log and gradient
+
300  using stan::math::value_of;
+
301  using boost::math::gamma_p_derivative;
+
302  using boost::math::gamma_q;
+
303 
+
304  agrad::OperandsAndPartials<T_rate> operands_and_partials(lambda);
+
305 
+
306  // Explicit return for extreme values
+
307  // The gradients are technically ill-defined, but treated as neg infinity
+
308  for (size_t i = 0; i < stan::length(n); i++) {
+
309  if (value_of(n_vec[i]) < 0)
+
310  return operands_and_partials.to_var(stan::math::negative_infinity());
+
311  }
+
312 
+
313  for (size_t i = 0; i < size; i++) {
+
314  // Explicit results for extreme values
+
315  // The gradients are technically ill-defined, but treated as zero
+
316  if (value_of(n_vec[i]) == std::numeric_limits<double>::infinity())
+
317  continue;
+
318 
+
319  const double n_dbl = value_of(n_vec[i]);
+
320  const double lambda_dbl = value_of(lambda_vec[i]);
+
321  const double Pi = gamma_q(n_dbl+1, lambda_dbl);
+
322 
+
323  P += log(Pi);
+
324 
+ +
326  operands_and_partials.d_x1[i]
+
327  -= gamma_p_derivative(n_dbl + 1, lambda_dbl) / Pi;
+
328  }
+
329 
+
330  return operands_and_partials.to_var(P);
+
331  }
+
332 
+
333  template <typename T_n, typename T_rate>
+ +
335  poisson_ccdf_log(const T_n& n, const T_rate& lambda) {
+
336  static const char* function = "stan::prob::poisson_ccdf_log(%1%)";
+
337 
+ + +
340  using stan::math::value_of;
+ +
342 
+
343  // Ensure non-zero argument slengths
+
344  if (!(stan::length(n) && stan::length(lambda)))
+
345  return 0.0;
+
346 
+
347  double P(0.0);
+
348 
+
349  // Validate arguments
+
350  if (!check_not_nan(function, lambda, "Rate parameter", &P))
+
351  return P;
+
352  if (!check_nonnegative(function, lambda, "Rate parameter", &P))
+
353  return P;
+
354  if (!(check_consistent_sizes(function, n,lambda,
+
355  "Random variable","Rate parameter",
+
356  &P)))
+
357  return P;
+
358 
+
359  // Wrap arguments into vector views
+
360  VectorView<const T_n> n_vec(n);
+
361  VectorView<const T_rate> lambda_vec(lambda);
+
362  size_t size = max_size(n, lambda);
+
363 
+
364  // Compute vectorized cdf_log and gradient
+
365  using stan::math::value_of;
+
366  using boost::math::gamma_p_derivative;
+
367  using boost::math::gamma_q;
+
368 
+
369  agrad::OperandsAndPartials<T_rate> operands_and_partials(lambda);
+
370 
+
371  // Explicit return for extreme values
+
372  // The gradients are technically ill-defined, but treated as neg infinity
+
373  for (size_t i = 0; i < stan::length(n); i++) {
+
374  if (value_of(n_vec[i]) < 0)
+
375  return operands_and_partials.to_var(0.0);
+
376  }
+
377 
+
378  for (size_t i = 0; i < size; i++) {
+
379  // Explicit results for extreme values
+
380  // The gradients are technically ill-defined, but treated as zero
+
381  if (value_of(n_vec[i]) == std::numeric_limits<double>::infinity())
+
382  return operands_and_partials.to_var(stan::math::negative_infinity());
+
383 
+
384  const double n_dbl = value_of(n_vec[i]);
+
385  const double lambda_dbl = value_of(lambda_vec[i]);
+
386  const double Pi = 1.0 - gamma_q(n_dbl+1, lambda_dbl);
+
387 
+
388  P += log(Pi);
+
389 
+ +
391  operands_and_partials.d_x1[i]
+
392  += gamma_p_derivative(n_dbl + 1, lambda_dbl) / Pi;
+
393  }
+
394 
+
395  return operands_and_partials.to_var(P);
+
396  }
+
397 
+
398  template <class RNG>
+
399  inline int
+
400  poisson_rng(const double lambda,
+
401  RNG& rng) {
+
402  using boost::variate_generator;
+
403  using boost::random::poisson_distribution;
+
404 
+
405  static const char* function = "stan::prob::poisson_rng(%1%)";
+
406 
+ + +
409 
+
410  if (!check_not_nan(function, lambda,
+
411  "Rate parameter"))
+
412  return 0;
+
413  if (!check_nonnegative(function, lambda,
+
414  "Rate parameter"))
+
415  return 0;
+
416 
+
417  variate_generator<RNG&, poisson_distribution<> >
+
418  poisson_rng(rng, poisson_distribution<>(lambda));
+
419  return poisson_rng();
+
420  }
+
421 
+
422  }
+
423 }
+
424 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/policy_page.html b/doc/api/html/policy_page.html new file mode 100644 index 00000000000..ca06458fddd --- /dev/null +++ b/doc/api/html/policy_page.html @@ -0,0 +1,98 @@ + + + + + +Stan: Error Handling Policies + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + +
+ +
+ +
+
+
+
Error Handling Policies
+
+
+

Describe the error handling policies for stan::prob here.

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/precomp__v__vari_8hpp.html b/doc/api/html/precomp__v__vari_8hpp.html new file mode 100644 index 00000000000..d0a0f7e36b5 --- /dev/null +++ b/doc/api/html/precomp__v__vari_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/agrad/rev/internal/precomp_v_vari.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
precomp_v_vari.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::agrad::precomp_v_vari
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/precomp__v__vari_8hpp_source.html b/doc/api/html/precomp__v__vari_8hpp_source.html new file mode 100644 index 00000000000..3613adedb91 --- /dev/null +++ b/doc/api/html/precomp__v__vari_8hpp_source.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/agrad/rev/internal/precomp_v_vari.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
precomp_v_vari.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__INTERNAL__PRECOMP_V_VARI_HPP__
+
2 #define __STAN__AGRAD__REV__INTERNAL__PRECOMP_V_VARI_HPP__
+
3 
+ + +
6 
+
7 namespace stan {
+
8  namespace agrad {
+
9 
+
10  // use for single precomputed partials
+
11  class precomp_v_vari : public op_v_vari {
+
12  protected:
+
13  double da_;
+
14  public:
+
15  precomp_v_vari(double val, vari* avi, double da)
+
16  : op_v_vari(val,avi),
+
17  da_(da) {
+
18  }
+
19  void chain() {
+
20  avi_->adj_ += adj_ * da_;
+
21  }
+
22  };
+
23 
+
24  }
+
25 }
+
26 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/print_8cpp.html b/doc/api/html/print_8cpp.html new file mode 100644 index 00000000000..d24aa8d663e --- /dev/null +++ b/doc/api/html/print_8cpp.html @@ -0,0 +1,164 @@ + + + + + +Stan: src/stan/command/print.cpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
print.cpp File Reference
+
+
+
#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <ios>
+#include <stan/mcmc/chains.hpp>
+#include <stan/command/print.hpp>
+
+

Go to the source code of this file.

+ + + + + +

+Functions

int main (int argc, const char *argv[])
 The Stan print function.
 
+

Function Documentation

+ +
+
+ + + + + + + + + + + + + + + + + + +
int main (int argc,
const char * argv[] 
)
+
+ +

The Stan print function.

+
Parameters
+ + + +
argcNumber of arguments
argvArguments
+
+
+
Returns
0 for success, non-zero otherwise
+

Footer output

+ +

Definition at line 17 of file print.cpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/print_8cpp_source.html b/doc/api/html/print_8cpp_source.html new file mode 100644 index 00000000000..dcb94b5b93d --- /dev/null +++ b/doc/api/html/print_8cpp_source.html @@ -0,0 +1,419 @@ + + + + + +Stan: src/stan/command/print.cpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
print.cpp
+
+
+Go to the documentation of this file.
1 #include <algorithm>
+
2 #include <iostream>
+
3 #include <iomanip>
+
4 #include <ios>
+
5 #include <stan/mcmc/chains.hpp>
+
6 #include <stan/command/print.hpp>
+
7 
+
17 int main(int argc, const char* argv[]) {
+
18 
+
19  if (argc == 1) {
+
20  print_usage();
+
21  return 0;
+
22  }
+
23 
+
24  // Parse any arguments specifying filenames
+
25  std::ifstream ifstream;
+
26  std::vector<std::string> filenames;
+
27 
+
28  for (int i = 1; i < argc; i++) {
+
29 
+
30  if (std::string(argv[i]).find("--autocorr=") != std::string::npos)
+
31  continue;
+
32 
+
33  if (std::string(argv[i]).find("--sig_figs=") != std::string::npos)
+
34  continue;
+
35 
+
36  if (std::string("--help") == std::string(argv[i])) {
+
37  print_usage();
+
38  return 0;
+
39  }
+
40 
+
41  ifstream.open(argv[i]);
+
42 
+
43  if (ifstream.good()) {
+
44  filenames.push_back(argv[i]);
+
45  ifstream.close();
+
46  } else {
+
47  std::cout << "File " << argv[i] << " not found" << std::endl;
+
48  }
+
49 
+
50  }
+
51 
+
52  if (!filenames.size()) {
+
53  std::cout << "No valid input files, exiting." << std::endl;
+
54  return 0;
+
55  }
+
56 
+
57  // Parse specified files
+
58  Eigen::VectorXd warmup_times(filenames.size());
+
59  Eigen::VectorXd sampling_times(filenames.size());
+
60 
+
61  Eigen::VectorXi thin(filenames.size());
+
62 
+
63  ifstream.open(filenames[0].c_str());
+
64 
+ +
66  warmup_times(0) = stan_csv.timing.warmup;
+
67  sampling_times(0) = stan_csv.timing.sampling;
+
68 
+
69  stan::mcmc::chains<> chains(stan_csv);
+
70  ifstream.close();
+
71 
+
72  thin(0) = stan_csv.metadata.thin;
+
73 
+ +
75  chain < filenames.size(); chain++) {
+
76  ifstream.open(filenames[chain].c_str());
+
77  stan_csv = stan::io::stan_csv_reader::parse(ifstream);
+
78  chains.add(stan_csv);
+
79  ifstream.close();
+
80  thin(chain) = stan_csv.metadata.thin;
+
81 
+
82  warmup_times(chain) = stan_csv.timing.warmup;
+
83  sampling_times(chain) = stan_csv.timing.sampling;
+
84 
+
85  }
+
86 
+
87  double total_warmup_time = warmup_times.sum();
+
88  double total_sampling_time = sampling_times.sum();
+
89 
+
90  // Compute largest variable name length
+
91  const int skip = 0;
+
92  std::string model_name = stan_csv.metadata.model;
+
93  size_t max_name_length = 0;
+
94  for (int i = skip; i < chains.num_params(); i++)
+
95  if (chains.param_name(i).length() > max_name_length)
+
96  max_name_length = chains.param_name(i).length();
+
97  for (int i = 0; i < 2; i++)
+
98  if (chains.param_name(i).length() > max_name_length)
+
99  max_name_length = chains.param_name(i).length();
+
100 
+
101 
+
102  // Prepare values
+
103  int n = 9;
+
104 
+
105  Eigen::MatrixXd values(chains.num_params(), n);
+
106  values.setZero();
+
107  Eigen::VectorXd probs(3);
+
108  probs << 0.05, 0.5, 0.95;
+
109 
+
110  for (int i = 0; i < chains.num_params(); i++) {
+
111  double sd = chains.sd(i);
+
112  double n_eff = chains.effective_sample_size(i);
+
113  values(i,0) = chains.mean(i);
+
114  values(i,1) = sd / sqrt(n_eff);
+
115  values(i,2) = sd;
+
116  Eigen::VectorXd quantiles = chains.quantiles(i,probs);
+
117  for (int j = 0; j < 3; j++)
+
118  values(i,3+j) = quantiles(j);
+
119  values(i,6) = n_eff;
+
120  values(i,7) = n_eff / total_sampling_time;
+
121  values(i,8) = chains.split_potential_scale_reduction(i);
+
122  }
+
123 
+
124  // Prepare header
+
125  Eigen::Matrix<std::string, Eigen::Dynamic, 1> headers(n);
+
126  headers <<
+
127  "Mean", "MCSE", "StdDev",
+
128  "5%", "50%", "95%",
+
129  "N_Eff", "N_Eff/s", "R_hat";
+
130 
+
131  // Set sig figs
+
132  Eigen::VectorXi column_sig_figs(n);
+
133 
+
134  int sig_figs = 2;
+
135 
+
136  for (int k = 1; k < argc; k++)
+
137  if (std::string(argv[k]).find("--sig_figs=") != std::string::npos)
+
138  sig_figs = atoi(std::string(argv[k]).substr(11).c_str());
+
139 
+
140  // Compute column widths
+
141  Eigen::VectorXi column_widths(n);
+
142  Eigen::Matrix<std::ios_base::fmtflags, Eigen::Dynamic, 1> formats(n);
+
143  column_widths = calculate_column_widths(values, headers, sig_figs, formats);
+
144 
+
145  // Initial output
+
146  std::cout << "Inference for Stan model: " << model_name << std::endl
+
147  << chains.num_chains() << " chains: each with iter=(" << chains.num_kept_samples(0);
+
148  for (int chain = 1; chain < chains.num_chains(); chain++)
+
149  std::cout << "," << chains.num_kept_samples(chain);
+
150  std::cout << ")";
+
151 
+
152  // Timing output
+
153  std::cout << "; warmup=(" << chains.warmup(0);
+
154  for (int chain = 1; chain < chains.num_chains(); chain++)
+
155  std::cout << "," << chains.warmup(chain);
+
156  std::cout << ")";
+
157 
+
158  std::cout << "; thin=(" << thin(0);
+
159 
+
160  for (int chain = 1; chain < chains.num_chains(); chain++)
+
161  std::cout << "," << thin(chain);
+
162  std::cout << ")";
+
163 
+
164  std::cout << "; " << chains.num_samples() << " iterations saved."
+
165  << std::endl << std::endl;
+
166 
+
167  std::string warmup_unit = "seconds";
+
168 
+
169  if (total_warmup_time / 3600 > 1) {
+
170  total_warmup_time /= 3600;
+
171  warmup_unit = "hours";
+
172  } else if (total_warmup_time / 60 > 1) {
+
173  total_warmup_time /= 60;
+
174  warmup_unit = "minutes";
+
175  }
+
176 
+
177  std::cout << "Warmup took ("
+
178  << std::fixed
+
179  << std::setprecision(compute_precision(warmup_times(0), sig_figs, false))
+
180  << warmup_times(0);
+
181  for (int chain = 1; chain < chains.num_chains(); chain++)
+
182  std::cout << ", " << std::fixed
+
183  << std::setprecision(compute_precision(warmup_times(chain), sig_figs, false))
+
184  << warmup_times(chain);
+
185  std::cout << ") seconds, ";
+
186  std::cout << std::fixed
+
187  << std::setprecision(compute_precision(total_warmup_time, sig_figs, false))
+
188  << total_warmup_time << " " << warmup_unit << " total" << std::endl;
+
189 
+
190  std::string sampling_unit = "seconds";
+
191 
+
192  if (total_sampling_time / 3600 > 1) {
+
193  total_sampling_time /= 3600;
+
194  sampling_unit = "hours";
+
195  } else if (total_sampling_time / 60 > 1) {
+
196  total_sampling_time /= 60;
+
197  sampling_unit = "minutes";
+
198  }
+
199 
+
200  std::cout << "Sampling took ("
+
201  << std::fixed
+
202  << std::setprecision(compute_precision(sampling_times(0), sig_figs, false))
+
203  << sampling_times(0);
+
204  for (int chain = 1; chain < chains.num_chains(); chain++)
+
205  std::cout << ", " << std::fixed
+
206  << std::setprecision(compute_precision(sampling_times(chain), sig_figs, false))
+
207  << sampling_times(chain);
+
208  std::cout << ") seconds, ";
+
209  std::cout << std::fixed
+
210  << std::setprecision(compute_precision(total_sampling_time, sig_figs, false))
+
211  << total_sampling_time << " " << sampling_unit << " total" << std::endl;
+
212  std::cout << std::endl;
+
213 
+
214  // Header output
+
215  std::cout << std::setw(max_name_length + 1) << "";
+
216  for (int i = 0; i < n; i++) {
+
217  std::cout << std::setw(column_widths(i)) << headers(i);
+
218  }
+
219  std::cout << std::endl;
+
220 
+
221  // Value output
+
222  for (int i = skip; i < chains.num_params(); i++) {
+
223  if (!is_matrix(chains.param_name(i))) {
+
224  std::cout << std::setw(max_name_length + 1) << std::left << chains.param_name(i);
+
225  std::cout << std::right;
+
226  for (int j = 0; j < n; j++) {
+
227  std::cout.setf(formats(j), std::ios::floatfield);
+
228  std::cout << std::setprecision(
+
229  compute_precision(values(i,j), sig_figs, formats(j) == std::ios_base::scientific))
+
230  << std::setw(column_widths(j)) << values(i, j);
+
231  }
+
232  std::cout << std::endl;
+
233  } else {
+
234  std::vector<int> dims = dimensions(chains, i);
+
235  std::vector<int> index(dims.size(), 1);
+
236  int max = 1;
+
237  for (size_t j = 0; j < dims.size(); j++)
+
238  max *= dims[j];
+
239 
+
240  for (int k = 0; k < max; k++) {
+
241  int param_index = i + matrix_index(index, dims);
+
242  std::cout << std::setw(max_name_length + 1) << std::left
+
243  << chains.param_name(param_index);
+
244  std::cout << std::right;
+
245  for (int j = 0; j < n; j++) {
+
246  std::cout.setf(formats(j), std::ios::floatfield);
+
247  std::cout
+
248  << std::setprecision(compute_precision(values(param_index,j),
+
249  sig_figs,
+
250  formats(j) == std::ios_base::scientific))
+
251  << std::setw(column_widths(j)) << values(param_index, j);
+
252  }
+
253  std::cout << std::endl;
+
254  if (k < max-1)
+
255  next_index(index, dims);
+
256  }
+
257  i += max-1;
+
258  }
+
259  }
+
260 
+
262  std::cout << std::endl;
+
263  std::cout << "Samples were drawn using " << stan_csv.metadata.algorithm
+
264  << " with " << stan_csv.metadata.engine << "." << std::endl
+
265  << "For each parameter, N_Eff is a crude measure of effective sample size," << std::endl
+
266  << "and R_hat is the potential scale reduction factor on split chains (at " << std::endl
+
267  << "convergence, R_hat=1)." << std::endl
+
268  << std::endl;
+
269 
+
270  // Print autocorrelation, if desired
+
271  for (int k = 1; k < argc; k++) {
+
272 
+
273  if (std::string(argv[k]).find("--autocorr=") != std::string::npos) {
+
274 
+
275  const int c = atoi(std::string(argv[k]).substr(11).c_str());
+
276 
+
277  if (c < 0 || c >= chains.num_chains()) {
+
278  std::cout << "Bad chain index " << c << ", aborting autocorrelation display." << std::endl;
+
279  break;
+
280  }
+
281 
+
282  Eigen::MatrixXd autocorr(chains.num_params(), chains.num_samples(c));
+
283 
+
284  for (int i = 0; i < chains.num_params(); i++) {
+
285  autocorr.row(i) = chains.autocorrelation(c, i);
+
286  }
+
287 
+
288  // Format and print header
+
289  std::cout << "Displaying the autocorrelations for chain " << c << ":" << std::endl;
+
290  std::cout << std::endl;
+
291 
+
292  const int n_autocorr = autocorr.row(0).size();
+
293 
+
294  int lag_width = 1;
+
295  int number = n_autocorr;
+
296  while ( number != 0) { number /= 10; lag_width++; }
+
297 
+
298  std::cout << std::setw(lag_width > 4 ? lag_width : 4) << "Lag";
+
299  for (int i = 0; i < chains.num_params(); ++i) {
+
300  std::cout << std::setw(max_name_length + 1) << std::right << chains.param_name(i);
+
301  }
+
302  std::cout << std::endl;
+
303 
+
304  // Print body
+
305  for (int n = 0; n < n_autocorr; ++n) {
+
306  std::cout << std::setw(lag_width) << std::right << n;
+
307  for (int i = 0; i < chains.num_params(); ++i) {
+
308  std::cout << std::setw(max_name_length + 1) << std::right << autocorr(i, n);
+
309  }
+
310  std::cout << std::endl;
+
311  }
+
312 
+
313  }
+
314 
+
315  }
+
316 
+
317  return 0;
+
318 
+
319 }
+
320 
+
321 
+
322 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/print_8hpp.html b/doc/api/html/print_8hpp.html new file mode 100644 index 00000000000..0a5b90285a3 --- /dev/null +++ b/doc/api/html/print_8hpp.html @@ -0,0 +1,502 @@ + + + + + +Stan: src/stan/command/print.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
print.hpp File Reference
+
+
+
#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <ios>
+#include <stan/mcmc/chains.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

void compute_width_and_precision (double value, int sig_figs, int &width, int &precision)
 
int compute_width (double value, int sig_figs)
 
int compute_precision (double value, int sig_figs, bool scientific)
 
int calculate_column_width (const Eigen::VectorXd &x, const std::string &name, const int sig_figs, std::ios_base::fmtflags &format)
 
Eigen::VectorXi calculate_column_widths (const Eigen::MatrixXd &values, const Eigen::Matrix< std::string, Eigen::Dynamic, 1 > &headers, const int sig_figs, Eigen::Matrix< std::ios_base::fmtflags, Eigen::Dynamic, 1 > &formats)
 
void print_usage ()
 
bool is_matrix (const std::string &parameter_name)
 
std::string base_param_name (stan::mcmc::chains<> &chains, const int index)
 
std::string matrix_index (stan::mcmc::chains<> &chains, const int index)
 
std::vector< int > dimensions (stan::mcmc::chains<> &chains, const int start_index)
 
void next_index (std::vector< int > &index, const std::vector< int > &dims)
 
int matrix_index (std::vector< int > &index, const std::vector< int > &dims)
 
+

Function Documentation

+ +
+
+ + + + + + + + + + + + + + + + + + +
std::string base_param_name (stan::mcmc::chains<> & chains,
const int index 
)
+
+ +

Definition at line 120 of file print.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
int calculate_column_width (const Eigen::VectorXd & x,
const std::string & name,
const int sig_figs,
std::ios_base::fmtflags & format 
)
+
+ +

Definition at line 54 of file print.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Eigen::VectorXi calculate_column_widths (const Eigen::MatrixXd & values,
const Eigen::Matrix< std::string, Eigen::Dynamic, 1 > & headers,
const int sig_figs,
Eigen::Matrix< std::ios_base::fmtflags, Eigen::Dynamic, 1 > & formats 
)
+
+ +

Definition at line 87 of file print.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
int compute_precision (double value,
int sig_figs,
bool scientific 
)
+
+ +

Definition at line 40 of file print.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
int compute_width (double value,
int sig_figs 
)
+
+ +

Definition at line 33 of file print.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void compute_width_and_precision (double value,
int sig_figs,
int & width,
int & precision 
)
+
+ +

Definition at line 10 of file print.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
std::vector<int> dimensions (stan::mcmc::chains<> & chains,
const int start_index 
)
+
+ +

Definition at line 130 of file print.hpp.

+ +
+
+ +
+
+ + + + + + + + +
bool is_matrix (const std::string & parameter_name)
+
+ +

Definition at line 116 of file print.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
std::string matrix_index (stan::mcmc::chains<> & chains,
const int index 
)
+
+ +

Definition at line 125 of file print.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
int matrix_index (std::vector< int > & index,
const std::vector< int > & dims 
)
+
+ +

Definition at line 183 of file print.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
void next_index (std::vector< int > & index,
const std::vector< int > & dims 
)
+
+ +

Definition at line 156 of file print.hpp.

+ +
+
+ +
+
+ + + + + + + +
void print_usage ()
+
+ +

Definition at line 100 of file print.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/print_8hpp_source.html b/doc/api/html/print_8hpp_source.html new file mode 100644 index 00000000000..56bfc351a4c --- /dev/null +++ b/doc/api/html/print_8hpp_source.html @@ -0,0 +1,314 @@ + + + + + +Stan: src/stan/command/print.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
print.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__COMMAND__PRINT_HPP__
+
2 #define __STAN__COMMAND__PRINT_HPP__
+
3 
+
4 #include <algorithm>
+
5 #include <iostream>
+
6 #include <iomanip>
+
7 #include <ios>
+
8 #include <stan/mcmc/chains.hpp>
+
9 
+
10 void compute_width_and_precision(double value, int sig_figs, int& width, int& precision) {
+
11 
+
12  double abs_value = std::fabs(value);
+
13 
+
14  if (value == 0) {
+
15  width = sig_figs;
+
16  precision = sig_figs;
+
17  }
+
18  else if (abs_value >= 1) {
+
19  int int_part = std::ceil(log10(abs_value) + 1e-6);
+
20  width = int_part >= sig_figs ? int_part : sig_figs + 1;
+
21  precision = int_part >= sig_figs ? 0 : sig_figs - int_part;
+
22  }
+
23  else {
+
24  int frac_part = std::fabs(std::floor(log10(abs_value)));
+
25  width = 1 + frac_part + sig_figs;
+
26  precision = frac_part + sig_figs - 1;
+
27  }
+
28 
+
29  if (value < 0) ++width;
+
30 
+
31 }
+
32 
+
33 int compute_width(double value, int sig_figs) {
+
34  int width;
+
35  int precision;
+
36  compute_width_and_precision(value, sig_figs, width, precision);
+
37  return width;
+
38 }
+
39 
+
40 int compute_precision(double value, int sig_figs, bool scientific) {
+
41 
+
42  if (scientific) {
+
43  return sig_figs - 1;
+
44  }
+
45  else {
+
46  int width;
+
47  int precision;
+
48  compute_width_and_precision(value, sig_figs, width, precision);
+
49  return precision;
+
50  }
+
51 
+
52 }
+
53 
+
54 int calculate_column_width(const Eigen::VectorXd& x,
+
55  const std::string& name,
+
56  const int sig_figs,
+
57  std::ios_base::fmtflags& format) {
+
58 
+
59  int padding = 2;
+
60 
+
61  // Fixed Precision
+
62  size_t fixed_threshold = 8;
+
63  size_t max_fixed_width = 0;
+
64 
+
65  for (int i = 0; i < x.size(); ++i) {
+
66  size_t width = compute_width(x[i], sig_figs);
+
67  max_fixed_width = width > max_fixed_width ? width : max_fixed_width;
+
68  }
+
69 
+
70  if (max_fixed_width + padding < fixed_threshold) {
+
71  format = std::ios_base::fixed;
+
72  max_fixed_width = name.length() > max_fixed_width ? name.length() : max_fixed_width;
+
73  return max_fixed_width + padding;
+
74  }
+
75 
+
76  // Scientific Notation
+
77  size_t scientific_width = sig_figs + 1 + 4; // Decimal place + exponent
+
78  if (x.minCoeff() < 0) ++scientific_width;
+
79 
+
80  scientific_width = name.length() > scientific_width ? name.length() : scientific_width;
+
81 
+
82  format = std::ios_base::scientific;
+
83  return scientific_width + padding;
+
84 
+
85 }
+
86 
+
87 Eigen::VectorXi calculate_column_widths(const Eigen::MatrixXd& values,
+
88  const Eigen::Matrix<std::string, Eigen::Dynamic, 1>& headers,
+
89  const int sig_figs,
+
90  Eigen::Matrix<std::ios_base::fmtflags, Eigen::Dynamic, 1>& formats) {
+
91  int n = values.cols();
+
92  Eigen::VectorXi column_widths(n);
+
93  formats.resize(n);
+
94  for (int i = 0; i < n; i++) {
+
95  column_widths(i) = calculate_column_width(values.col(i), headers(i), sig_figs, formats(i));
+
96  }
+
97  return column_widths;
+
98 }
+
99 
+
100 void print_usage() {
+
101 
+
102  std::cout << "USAGE: print <filename 1> [<filename 2> ... <filename N>]"
+
103  << std::endl
+
104  << std::endl;
+
105 
+
106  std::cout << "OPTIONS:" << std::endl << std::endl;
+
107  std::cout << " --autocorr=<chain_index>\tAppend the autocorrelations for the given chain"
+
108  << std::endl
+
109  << std::endl;
+
110  std::cout << " --sig_figs=<int>\tSet significant figures of output (Defaults to 2)"
+
111  << std::endl
+
112  << std::endl;
+
113 
+
114 }
+
115 
+
116 bool is_matrix(const std::string& parameter_name) {
+
117  return (parameter_name.find("[") != std::string::npos);
+
118 }
+
119 
+
120 std::string base_param_name(stan::mcmc::chains<>& chains, const int index) {
+
121  std::string name = chains.param_name(index);
+
122  return name.substr(0, name.find("["));
+
123 }
+
124 
+
125 std::string matrix_index(stan::mcmc::chains<>& chains, const int index) {
+
126  std::string name = chains.param_name(index);
+
127  return name.substr(name.find("["));
+
128 }
+
129 
+
130 std::vector<int> dimensions(stan::mcmc::chains<>& chains, const int start_index) {
+
131  std::vector<int> dims;
+
132  int dim;
+
133 
+
134  std::string name = base_param_name(chains, start_index);
+
135  int last_matrix_element = start_index;
+
136  while (last_matrix_element+1 < chains.num_params()) {
+
137  if (base_param_name(chains, last_matrix_element+1) == name)
+
138  last_matrix_element++;
+
139  else
+
140  break;
+
141  }
+
142 
+
143  std::stringstream ss(matrix_index(chains, last_matrix_element));
+
144  ss.get();
+
145  ss >> dim;
+
146 
+
147  dims.push_back(dim);
+
148  while (ss.get() == ',') {
+
149  ss >> dim;
+
150  dims.push_back(dim);
+
151  }
+
152  return dims;
+
153 }
+
154 
+
155 // next 1-based index in row major order
+
156 void next_index(std::vector<int>& index, const std::vector<int>& dims) {
+
157  if (dims.size() != index.size())
+
158  throw std::domain_error("next_index: size mismatch");
+
159  if (dims.size() == 0)
+
160  return;
+
161  index[index.size()-1]++;
+
162 
+
163  for (int i = index.size()-1; i > 0; i--) {
+
164  if (index[i] > dims[i]) {
+
165  index[i-1]++;
+
166  index[i] = 1;
+
167  }
+
168  }
+
169 
+
170  for (size_t n = 0; n < dims.size(); n++) {
+
171  if (index[n] <= 0 || index[n] > dims[n]) {
+
172  std::stringstream message_stream("");
+
173  message_stream << "next_index: index[" << n << "] out of bounds. "
+
174  << "dims[" << n << "] = " << dims[n] << "; "
+
175  << "index[" << n << "] = " << index[n];
+
176  throw std::domain_error(message_stream.str());
+
177  }
+
178  }
+
179 }
+
180 
+
181 // return the flat 0-based index of a column major order matrix based on the
+
182 // 1-based index
+
183 int matrix_index(std::vector<int>& index, const std::vector<int>& dims) {
+
184  if (dims.size() != index.size())
+
185  throw std::domain_error("next_index: size mismatch");
+
186  if (dims.size() == 0)
+
187  return 0;
+
188  for (size_t n = 0; n < dims.size(); n++) {
+
189  if (index[n] <= 0 || index[n] > dims[n]) {
+
190  std::stringstream message_stream("");
+
191  message_stream << "matrix_index: index[" << n << "] out of bounds. "
+
192  << "dims[" << n << "] = " << dims[n] << "; "
+
193  << "index[" << n << "] = " << index[n];
+
194  throw std::domain_error(message_stream.str());
+
195  }
+
196  }
+
197 
+
198  int offset = 0;
+
199  int prod = 1;
+
200  for (size_t i = 0; i < dims.size(); i++) {
+
201  offset += (index[i]-1) * prod;
+
202  prod *= dims[i];
+
203  }
+
204  return offset;
+
205 }
+
206 
+
207 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/print__stack_8hpp.html b/doc/api/html/print__stack_8hpp.html new file mode 100644 index 00000000000..80d9a362d38 --- /dev/null +++ b/doc/api/html/print__stack_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/print_stack.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
print_stack.hpp File Reference
+
+
+
#include <ostream>
+#include <stan/agrad/rev/var_stack.hpp>
+#include <stan/agrad/rev/vari.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

void stan::agrad::print_stack (std::ostream &o)
 Prints the auto-dif variable stack.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/print__stack_8hpp_source.html b/doc/api/html/print__stack_8hpp_source.html new file mode 100644 index 00000000000..f280c09d004 --- /dev/null +++ b/doc/api/html/print__stack_8hpp_source.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/rev/print_stack.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
print_stack.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__PRINT_STACK_HPP__
+
2 #define __STAN__AGRAD__PRINT_STACK_HPP__
+
3 
+
4 #include <ostream>
+ + +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
20  inline void print_stack(std::ostream& o) {
+
21  o << "STACK, size=" << var_stack_.size() << std::endl;
+
22  for (size_t i = 0; i < var_stack_.size(); ++i)
+
23  o << i
+
24  << " " << var_stack_[i]
+
25  << " " << (static_cast<vari*>(var_stack_[i]))->val_
+
26  << " : " << (static_cast<vari*>(var_stack_[i]))->adj_
+
27  << std::endl;
+
28  }
+
29 
+
30  }
+
31 }
+
32 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/prob_2constants_8hpp.html b/doc/api/html/prob_2constants_8hpp.html new file mode 100644 index 00000000000..687778c6f46 --- /dev/null +++ b/doc/api/html/prob_2constants_8hpp.html @@ -0,0 +1,122 @@ + + + + + +Stan: src/stan/prob/constants.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
constants.hpp File Reference
+
+
+
#include <boost/math/constants/constants.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/prob_2constants_8hpp_source.html b/doc/api/html/prob_2constants_8hpp_source.html new file mode 100644 index 00000000000..df67971e175 --- /dev/null +++ b/doc/api/html/prob_2constants_8hpp_source.html @@ -0,0 +1,149 @@ + + + + + +Stan: src/stan/prob/constants.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
constants.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS_CONSTANTS_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS_CONSTANTS_HPP__
+
3 
+
4 #include <boost/math/constants/constants.hpp>
+
5 
+
6 namespace stan {
+
7 
+
8  namespace prob {
+
9 
+
10 
+
11  namespace {
+
12 
+
13  const double LOG_PI = std::log(boost::math::constants::pi<double>());
+
14 
+
15  const double LOG_ZERO = std::log(0.0);
+
16 
+
17  const double LOG_TWO = std::log(2.0);
+
18 
+
19  const double NEG_LOG_TWO = - LOG_TWO;
+
20 
+
21  const double NEG_LOG_SQRT_TWO_PI
+
22  = - std::log(std::sqrt(2.0 * boost::math::constants::pi<double>()));
+
23 
+
24  const double NEG_LOG_PI = - LOG_PI;
+
25 
+
26  const double NEG_LOG_SQRT_PI
+
27  = -std::log(std::sqrt(boost::math::constants::pi<double>()));
+
28 
+
29  const double NEG_LOG_TWO_OVER_TWO = - LOG_TWO / 2.0;
+
30 
+
31  const double SQRT_2 = std::sqrt(2.0);
+
32 
+
33  const double LOG_TWO_PI = LOG_TWO + LOG_PI;
+
34 
+
35  const double NEG_LOG_TWO_PI = - LOG_TWO_PI;
+
36  }
+
37 
+
38  }
+
39 
+
40 }
+
41 
+
42 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/prob_2distributions_2univariate_2continuous_2normal_8hpp.html b/doc/api/html/prob_2distributions_2univariate_2continuous_2normal_8hpp.html new file mode 100644 index 00000000000..a4a402db848 --- /dev/null +++ b/doc/api/html/prob_2distributions_2univariate_2continuous_2normal_8hpp.html @@ -0,0 +1,162 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/normal.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
normal.hpp File Reference
+
+
+
#include <boost/random/normal_distribution.hpp>
+#include <boost/random/variate_generator.hpp>
+#include <boost/utility/enable_if.hpp>
+#include <stan/agrad/partials_vari.hpp>
+#include <stan/math.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/prob/constants.hpp>
+#include <stan/prob/traits.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + + + + + + + + +

+Functions

template<bool propto, typename T_y , typename T_loc , typename T_scale >
boost::enable_if_c
+< contains_fvar< T_y, T_loc,
+T_scale >::value, typename
+return_type< T_y, T_loc,
+T_scale >::type >::type 
stan::prob::normal_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 The log of the normal density for the specified scalar(s) given the specified mean(s) and deviation(s).
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
stan::prob::normal_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
stan::prob::normal_cdf (const T_y &y, const T_loc &mu, const T_scale &sigma)
 Calculates the normal cumulative distribution function for the given variate, location, and scale.
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
stan::prob::normal_cdf_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
stan::prob::normal_ccdf_log (const T_y &y, const T_loc &mu, const T_scale &sigma)
 
template<class RNG >
double stan::prob::normal_rng (const double mu, const double sigma, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/prob_2distributions_2univariate_2continuous_2normal_8hpp_source.html b/doc/api/html/prob_2distributions_2univariate_2continuous_2normal_8hpp_source.html new file mode 100644 index 00000000000..b64e517344a --- /dev/null +++ b/doc/api/html/prob_2distributions_2univariate_2continuous_2normal_8hpp_source.html @@ -0,0 +1,472 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/normal.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
normal.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS__NORMAL_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS__NORMAL_HPP__
+
3 
+
4 #include <boost/random/normal_distribution.hpp>
+
5 #include <boost/random/variate_generator.hpp>
+
6 #include <boost/utility/enable_if.hpp>
+
7 
+ +
9 #include <stan/math.hpp>
+ +
11 #include <stan/meta/traits.hpp>
+
12 #include <stan/prob/constants.hpp>
+
13 #include <stan/prob/traits.hpp>
+
14 
+
15 namespace stan {
+
16 
+
17  namespace prob {
+
18 
+
37  template <bool propto,
+
38  typename T_y, typename T_loc, typename T_scale>
+
39  typename boost::enable_if_c<is_var_or_arithmetic<T_y,T_loc,T_scale>::value,
+
40  typename return_type<T_y,T_loc,T_scale>::type>::type
+
41  normal_log(const T_y& y, const T_loc& mu, const T_scale& sigma) {
+
42  static const char* function = "stan::prob::normal_log(%1%)";
+
43 
+
44  using std::log;
+ + + + + + + +
52 
+
53  // check if any vectors are zero length
+
54  if (!(stan::length(y)
+
55  && stan::length(mu)
+
56  && stan::length(sigma)))
+
57  return 0.0;
+
58 
+
59  // set up return value accumulator
+
60  double logp(0.0);
+
61 
+
62  // validate args (here done over var, which should be OK)
+
63  if (!check_not_nan(function, y, "Random variable", &logp))
+
64  return logp;
+
65  if (!check_finite(function, mu, "Location parameter",
+
66  &logp))
+
67  return logp;
+
68  if (!check_positive(function, sigma, "Scale parameter",
+
69  &logp))
+
70  return logp;
+
71  if (!(check_consistent_sizes(function,
+
72  y,mu,sigma,
+
73  "Random variable","Location parameter","Scale parameter",
+
74  &logp)))
+
75  return logp;
+
76 
+
77  // check if no variables are involved and prop-to
+
78  if (!include_summand<propto,T_y,T_loc,T_scale>::value)
+
79  return 0.0;
+
80 
+
81  // set up template expressions wrapping scalars into vector views
+
82  agrad::OperandsAndPartials<T_y, T_loc, T_scale> operands_and_partials(y, mu, sigma);
+
83 
+
84  VectorView<const T_y> y_vec(y);
+
85  VectorView<const T_loc> mu_vec(mu);
+
86  VectorView<const T_scale> sigma_vec(sigma);
+
87  size_t N = max_size(y, mu, sigma);
+
88 
+
89  DoubleVectorView<true,is_vector<T_scale>::value> inv_sigma(length(sigma));
+
90  DoubleVectorView<include_summand<propto,T_scale>::value,is_vector<T_scale>::value> log_sigma(length(sigma));
+
91  for (size_t i = 0; i < length(sigma); i++) {
+
92  inv_sigma[i] = 1.0 / value_of(sigma_vec[i]);
+
93  if (include_summand<propto,T_scale>::value)
+
94  log_sigma[i] = log(value_of(sigma_vec[i]));
+
95  }
+
96 
+
97  for (size_t n = 0; n < N; n++) {
+
98  // pull out values of arguments
+
99  const double y_dbl = value_of(y_vec[n]);
+
100  const double mu_dbl = value_of(mu_vec[n]);
+
101 
+
102  // reusable subexpression values
+
103  const double y_minus_mu_over_sigma
+
104  = (y_dbl - mu_dbl) * inv_sigma[n];
+
105  const double y_minus_mu_over_sigma_squared
+
106  = y_minus_mu_over_sigma * y_minus_mu_over_sigma;
+
107 
+
108  static double NEGATIVE_HALF = - 0.5;
+
109 
+
110  // log probability
+
111  if (include_summand<propto>::value)
+
112  logp += NEG_LOG_SQRT_TWO_PI;
+
113  if (include_summand<propto,T_scale>::value)
+
114  logp -= log_sigma[n];
+
115  if (include_summand<propto,T_y,T_loc,T_scale>::value)
+
116  logp += NEGATIVE_HALF * y_minus_mu_over_sigma_squared;
+
117 
+
118  // gradients
+
119  double scaled_diff = inv_sigma[n] * y_minus_mu_over_sigma;
+
120  if (!is_constant_struct<T_y>::value)
+
121  operands_and_partials.d_x1[n] -= scaled_diff;
+
122  if (!is_constant_struct<T_loc>::value)
+
123  operands_and_partials.d_x2[n] += scaled_diff;
+
124  if (!is_constant_struct<T_scale>::value)
+
125  operands_and_partials.d_x3[n]
+
126  += -inv_sigma[n] + inv_sigma[n] * y_minus_mu_over_sigma_squared;
+
127  }
+
128  return operands_and_partials.to_var(logp);
+
129  }
+
130 
+
131  template <typename T_y, typename T_loc, typename T_scale>
+
132  inline
+
133  typename return_type<T_y,T_loc,T_scale>::type
+
134  normal_log(const T_y& y, const T_loc& mu, const T_scale& sigma) {
+
135  return normal_log<false>(y,mu,sigma);
+
136  }
+
137 
+
156  template <typename T_y, typename T_loc, typename T_scale>
+ +
158  normal_cdf(const T_y& y, const T_loc& mu, const T_scale& sigma) {
+
159  static const char* function = "stan::prob::normal_cdf(%1%)";
+
160 
+ + + +
164  using stan::math::value_of;
+ +
166 
+
167  double cdf(1.0);
+
168 
+
169  // check if any vectors are zero length
+
170  if (!(stan::length(y)
+
171  && stan::length(mu)
+
172  && stan::length(sigma)))
+
173  return cdf;
+
174 
+
175  if (!check_not_nan(function, y, "Random variable", &cdf))
+
176  return cdf;
+
177  if (!check_finite(function, mu, "Location parameter", &cdf))
+
178  return cdf;
+
179  if (!check_not_nan(function, sigma, "Scale parameter",
+
180  &cdf))
+
181  return cdf;
+
182  if (!check_positive(function, sigma, "Scale parameter",
+
183  &cdf))
+
184  return cdf;
+
185  if (!(check_consistent_sizes(function,
+
186  y,mu,sigma,
+
187  "Random variable","Location parameter",
+
188  "Scale parameter",
+
189  &cdf)))
+
190  return cdf;
+
191 
+ +
193  operands_and_partials(y, mu, sigma);
+
194 
+
195  VectorView<const T_y> y_vec(y);
+
196  VectorView<const T_loc> mu_vec(mu);
+
197  VectorView<const T_scale> sigma_vec(sigma);
+
198  size_t N = max_size(y, mu, sigma);
+
199  const double SQRT_TWO_OVER_PI = std::sqrt(2.0 / stan::math::pi());
+
200 
+
201  for (size_t n = 0; n < N; n++) {
+
202  const double y_dbl = value_of(y_vec[n]);
+
203  const double mu_dbl = value_of(mu_vec[n]);
+
204  const double sigma_dbl = value_of(sigma_vec[n]);
+
205  const double scaled_diff = (y_dbl - mu_dbl) / (sigma_dbl * SQRT_2);
+
206  const double cdf_ = 0.5 * (1.0 + erf(scaled_diff));
+
207 
+
208  // cdf
+
209  cdf *= cdf_;
+
210 
+
211  // gradients
+
212  const double rep_deriv = SQRT_TWO_OVER_PI * 0.5
+
213  * exp(-scaled_diff * scaled_diff) / cdf_ / sigma_dbl;
+ +
215  operands_and_partials.d_x1[n] += rep_deriv;
+ +
217  operands_and_partials.d_x2[n] -= rep_deriv;
+ +
219  operands_and_partials.d_x3[n] -= rep_deriv * scaled_diff * SQRT_2;
+
220  }
+
221 
+ +
223  for (size_t n = 0; n < stan::length(y); ++n)
+
224  operands_and_partials.d_x1[n] *= cdf;
+ +
226  for (size_t n = 0; n < stan::length(mu); ++n)
+
227  operands_and_partials.d_x2[n] *= cdf;
+ +
229  for (size_t n = 0; n < stan::length(sigma); ++n)
+
230  operands_and_partials.d_x3[n] *= cdf;
+
231 
+
232  return operands_and_partials.to_var(cdf);
+
233  }
+
234 
+
235  template <typename T_y, typename T_loc, typename T_scale>
+ +
237  normal_cdf_log(const T_y& y, const T_loc& mu, const T_scale& sigma) {
+
238  static const char* function = "stan::prob::normal_cdf_log(%1%)";
+
239 
+ + + + +
244  using stan::math::value_of;
+
245 
+
246  double cdf_log(0.0);
+
247  // check if any vectors are zero length
+
248  if (!(stan::length(y)
+
249  && stan::length(mu)
+
250  && stan::length(sigma)))
+
251  return cdf_log;
+
252 
+
253  if (!check_not_nan(function, y, "Random variable", &cdf_log))
+
254  return cdf_log;
+
255  if (!check_finite(function, mu, "Location parameter", &cdf_log))
+
256  return cdf_log;
+
257  if (!check_not_nan(function, sigma, "Scale parameter",
+
258  &cdf_log))
+
259  return cdf_log;
+
260  if (!check_positive(function, sigma, "Scale parameter",
+
261  &cdf_log))
+
262  return cdf_log;
+
263  if (!(check_consistent_sizes(function,
+
264  y,mu,sigma,
+
265  "Random variable","Location parameter",
+
266  "Scale parameter", &cdf_log)))
+
267  return cdf_log;
+
268 
+ +
270  operands_and_partials(y, mu, sigma);
+
271 
+
272  VectorView<const T_y> y_vec(y);
+
273  VectorView<const T_loc> mu_vec(mu);
+
274  VectorView<const T_scale> sigma_vec(sigma);
+
275  size_t N = max_size(y, mu, sigma);
+
276  double log_half = std::log(0.5);
+
277 
+
278  const double SQRT_TWO_OVER_PI = std::sqrt(2.0 / stan::math::pi());
+
279  for (size_t n = 0; n < N; n++) {
+
280  const double y_dbl = value_of(y_vec[n]);
+
281  const double mu_dbl = value_of(mu_vec[n]);
+
282  const double sigma_dbl = value_of(sigma_vec[n]);
+
283 
+
284  const double scaled_diff = (y_dbl - mu_dbl) / (sigma_dbl * SQRT_2);
+
285 
+
286  const double one_p_erf = 1.0 + erf(scaled_diff);
+
287  // log cdf
+
288  cdf_log += log_half + log(one_p_erf);
+
289 
+
290  // gradients
+
291  const double rep_deriv = SQRT_TWO_OVER_PI
+
292  * exp(-scaled_diff * scaled_diff) / one_p_erf;
+ +
294  operands_and_partials.d_x1[n] += rep_deriv / sigma_dbl;
+ +
296  operands_and_partials.d_x2[n] -= rep_deriv / sigma_dbl;
+ +
298  operands_and_partials.d_x3[n] -= rep_deriv * scaled_diff
+
299  * stan::math::SQRT_2 / sigma_dbl;
+
300  }
+
301  return operands_and_partials.to_var(cdf_log);
+
302  }
+
303 
+
304  template <typename T_y, typename T_loc, typename T_scale>
+ +
306  normal_ccdf_log(const T_y& y, const T_loc& mu, const T_scale& sigma) {
+
307  static const char* function = "stan::prob::normal_ccdf_log(%1%)";
+
308 
+ + + + +
313  using stan::math::value_of;
+
314 
+
315  double ccdf_log(0.0);
+
316  // check if any vectors are zero length
+
317  if (!(stan::length(y)
+
318  && stan::length(mu)
+
319  && stan::length(sigma)))
+
320  return ccdf_log;
+
321 
+
322  if (!check_not_nan(function, y, "Random variable", &ccdf_log))
+
323  return ccdf_log;
+
324  if (!check_finite(function, mu, "Location parameter", &ccdf_log))
+
325  return ccdf_log;
+
326  if (!check_not_nan(function, sigma, "Scale parameter",
+
327  &ccdf_log))
+
328  return ccdf_log;
+
329  if (!check_positive(function, sigma, "Scale parameter",
+
330  &ccdf_log))
+
331  return ccdf_log;
+
332  if (!(check_consistent_sizes(function,
+
333  y,mu,sigma,
+
334  "Random variable","Location parameter",
+
335  "Scale parameter", &ccdf_log)))
+
336  return ccdf_log;
+
337 
+ +
339  operands_and_partials(y, mu, sigma);
+
340 
+
341  VectorView<const T_y> y_vec(y);
+
342  VectorView<const T_loc> mu_vec(mu);
+
343  VectorView<const T_scale> sigma_vec(sigma);
+
344  size_t N = max_size(y, mu, sigma);
+
345  double log_half = std::log(0.5);
+
346 
+
347  const double SQRT_TWO_OVER_PI = std::sqrt(2.0 / stan::math::pi());
+
348  for (size_t n = 0; n < N; n++) {
+
349  const double y_dbl = value_of(y_vec[n]);
+
350  const double mu_dbl = value_of(mu_vec[n]);
+
351  const double sigma_dbl = value_of(sigma_vec[n]);
+
352 
+
353  const double scaled_diff = (y_dbl - mu_dbl) / (sigma_dbl * SQRT_2);
+
354 
+
355  const double one_m_erf = 1.0 - erf(scaled_diff);
+
356  // log ccdf
+
357  ccdf_log += log_half + log(one_m_erf);
+
358 
+
359  // gradients
+
360  const double rep_deriv = SQRT_TWO_OVER_PI
+
361  * exp(-scaled_diff * scaled_diff) / one_m_erf;
+ +
363  operands_and_partials.d_x1[n] -= rep_deriv / sigma_dbl;
+ +
365  operands_and_partials.d_x2[n] += rep_deriv / sigma_dbl;
+ +
367  operands_and_partials.d_x3[n] += rep_deriv * scaled_diff
+
368  * stan::math::SQRT_2 / sigma_dbl;
+
369  }
+
370  return operands_and_partials.to_var(ccdf_log);
+
371  }
+
372 
+
373  template <class RNG>
+
374  inline double
+
375  normal_rng(const double mu,
+
376  const double sigma,
+
377  RNG& rng) {
+
378  using boost::variate_generator;
+
379  using boost::normal_distribution;
+ + + +
383 
+
384  static const char* function = "stan::prob::normal_rng(%1%)";
+
385 
+
386  if (!check_finite(function, mu, "Location parameter"))
+
387  return 0;
+
388  if (!check_not_nan(function, mu, "Location parameter"))
+
389  return 0;
+
390  if (!check_positive(function, sigma, "Scale parameter"))
+
391  return 0;
+
392  if (!check_not_nan(function, sigma, "Scale parameter"))
+
393  return 0;
+
394 
+
395  variate_generator<RNG&, normal_distribution<> >
+
396  norm_rng(rng, normal_distribution<>(mu, sigma));
+
397  return norm_rng();
+
398  }
+
399  }
+
400 }
+
401 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/prob_2traits_8hpp.html b/doc/api/html/prob_2traits_8hpp.html new file mode 100644 index 00000000000..89fcdd7010a --- /dev/null +++ b/doc/api/html/prob_2traits_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/prob/traits.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
traits.hpp File Reference
+
+
+
#include <stan/meta/traits.hpp>
+#include <boost/math/tools/promotion.hpp>
+
+

Go to the source code of this file.

+ + + + + +

+Classes

struct  stan::prob::include_summand< propto, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10 >
 Template metaprogram to calculate whether a summand needs to be included in a proportional (log) probability calculation. More...
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/prob_2traits_8hpp_source.html b/doc/api/html/prob_2traits_8hpp_source.html new file mode 100644 index 00000000000..74af289329c --- /dev/null +++ b/doc/api/html/prob_2traits_8hpp_source.html @@ -0,0 +1,149 @@ + + + + + +Stan: src/stan/prob/traits.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
traits.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__TRAITS_HPP__
+
2 #define __STAN__PROB__TRAITS_HPP__
+
3 
+
4 #include <stan/meta/traits.hpp>
+
5 #include <boost/math/tools/promotion.hpp>
+
6 
+
7 namespace stan {
+
8 
+
9  namespace prob {
+
10 
+
29  template <bool propto,
+
30  typename T1=double, typename T2=double,
+
31  typename T3=double, typename T4=double,
+
32  typename T5=double, typename T6=double,
+
33  typename T7=double, typename T8=double,
+
34  typename T9=double, typename T10=double>
+
35  struct include_summand {
+
36 
+
42  enum {
+
43  value = ( !propto
+ + + + + + + + + + +
54  )
+
55 
+
56  };
+
57 
+
58  };
+
59 
+
60 
+
61  }
+
62 
+
63 }
+
64 
+
65 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/prob_8hpp.html b/doc/api/html/prob_8hpp.html new file mode 100644 index 00000000000..6f533c616d7 --- /dev/null +++ b/doc/api/html/prob_8hpp.html @@ -0,0 +1,115 @@ + + + + + +Stan: src/stan/prob.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
prob.hpp File Reference
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/prob_8hpp_source.html b/doc/api/html/prob_8hpp_source.html new file mode 100644 index 00000000000..f065b6ec511 --- /dev/null +++ b/doc/api/html/prob_8hpp_source.html @@ -0,0 +1,117 @@ + + + + + +Stan: src/stan/prob.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
prob.hpp
+
+
+Go to the documentation of this file.
1 #ifndef STAN_PROB_HPP
+
2 #define STAN_PROB_HPP
+
3 
+ + +
6 #include "stan/prob/traits.hpp"
+ + + +
10 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/prob__grad_8hpp.html b/doc/api/html/prob__grad_8hpp.html new file mode 100644 index 00000000000..40678e81d76 --- /dev/null +++ b/doc/api/html/prob__grad_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/model/prob_grad.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
prob_grad.hpp File Reference
+
+
+
#include <utility>
+#include <vector>
+#include <stan/io/csv_writer.hpp>
+
+

Go to the source code of this file.

+ + + + + +

+Classes

class  stan::model::prob_grad
 The prob_grad class represents the basic parameter holders for a model. More...
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::model
 For compiling models.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/prob__grad_8hpp_source.html b/doc/api/html/prob__grad_8hpp_source.html new file mode 100644 index 00000000000..4a99f344daf --- /dev/null +++ b/doc/api/html/prob__grad_8hpp_source.html @@ -0,0 +1,158 @@ + + + + + +Stan: src/stan/model/prob_grad.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
prob_grad.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MODEL__PROB_GRAD_HPP__
+
2 #define __STAN__MODEL__PROB_GRAD_HPP__
+
3 
+
4 #include <utility>
+
5 #include <vector>
+
6 
+
7 #include <stan/io/csv_writer.hpp>
+
8 
+
9 namespace stan {
+
10 
+
11  namespace model {
+
12 
+
18  class prob_grad {
+
19 
+
20  protected:
+
21 
+ +
23  std::vector<std::pair<int,int> > param_ranges_i__;
+
24 
+
25  public:
+
26 
+ +
28  : num_params_r__(num_params_r),
+
29  param_ranges_i__(std::vector<std::pair<int,int> >(0)) {
+
30  }
+
31 
+ +
33  std::vector<std::pair<int,int> >& param_ranges_i)
+
34  : num_params_r__(num_params_r),
+
35  param_ranges_i__(param_ranges_i) {
+
36  }
+
37 
+
38  virtual ~prob_grad() { }
+
39 
+
40  inline size_t num_params_r() const {
+
41  return num_params_r__;
+
42  }
+
43 
+
44  inline size_t num_params_i() const {
+
45  return param_ranges_i__.size();
+
46  }
+
47 
+
48  inline std::pair<int,int> param_range_i(size_t idx) const {
+
49  return param_ranges_i__[idx];
+
50  }
+
51 
+
52  };
+
53  }
+
54 }
+
55 
+
56 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/prod_8hpp.html b/doc/api/html/prod_8hpp.html new file mode 100644 index 00000000000..8fe97c9fdf1 --- /dev/null +++ b/doc/api/html/prod_8hpp.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/math/matrix/prod.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
prod.hpp File Reference
+
+
+
#include <vector>
+#include <stan/math/matrix/Eigen.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + +

+Functions

template<typename T >
stan::math::prod (const std::vector< T > &v)
 Returns the product of the coefficients of the specified standard vector.
 
template<typename T , int R, int C>
stan::math::prod (const Eigen::Matrix< T, R, C > &v)
 Returns the product of the coefficients of the specified column vector.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/prod_8hpp_source.html b/doc/api/html/prod_8hpp_source.html new file mode 100644 index 00000000000..7879931de8d --- /dev/null +++ b/doc/api/html/prod_8hpp_source.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/math/matrix/prod.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
prod.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__PROD_HPP__
+
2 #define __STAN__MATH__MATRIX__PROD_HPP__
+
3 
+
4 #include <vector>
+ +
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
16  template <typename T>
+
17  inline T prod(const std::vector<T>& v) {
+
18  if (v.size() == 0) return 1;
+
19  T product = v[0];
+
20  for (size_t i = 1; i < v.size(); ++i)
+
21  product *= v[i];
+
22  return product;
+
23  }
+
24 
+
31  template <typename T, int R, int C>
+
32  inline T prod(const Eigen::Matrix<T,R,C>& v) {
+
33  if (v.size() == 0) return 1.0;
+
34  return v.prod();
+
35  }
+
36 
+
37  }
+
38 }
+
39 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/program__grammar_8hpp.html b/doc/api/html/program__grammar_8hpp.html new file mode 100644 index 00000000000..265bdc80d35 --- /dev/null +++ b/doc/api/html/program__grammar_8hpp.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/gm/grammars/program_grammar.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
program_grammar.hpp File Reference
+
+
+
#include <string>
+#include <sstream>
+#include <vector>
+#include <boost/spirit/include/qi.hpp>
+#include <stan/gm/ast.hpp>
+#include <stan/gm/grammars/whitespace_grammar.hpp>
+#include <stan/gm/grammars/expression_grammar.hpp>
+#include <stan/gm/grammars/var_decls_grammar.hpp>
+#include <stan/gm/grammars/statement_grammar.hpp>
+
+

Go to the source code of this file.

+ + + + +

+Classes

struct  stan::gm::program_grammar< Iterator >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/program__grammar_8hpp_source.html b/doc/api/html/program__grammar_8hpp_source.html new file mode 100644 index 00000000000..66d8217b503 --- /dev/null +++ b/doc/api/html/program__grammar_8hpp_source.html @@ -0,0 +1,191 @@ + + + + + +Stan: src/stan/gm/grammars/program_grammar.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
program_grammar.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__PARSER__PROGRAM_GRAMMAR__HPP__
+
2 #define __STAN__GM__PARSER__PROGRAM_GRAMMAR__HPP__
+
3 
+
4 #include <string>
+
5 #include <sstream>
+
6 #include <vector>
+
7 
+
8 #include <boost/spirit/include/qi.hpp>
+
9 
+
10 #include <stan/gm/ast.hpp>
+ + + + +
15 
+
16 namespace stan {
+
17 
+
18  namespace gm {
+
19 
+
20  template <typename Iterator>
+ +
22  : boost::spirit::qi::grammar<Iterator,
+
23  program(),
+
24  whitespace_grammar<Iterator> > {
+
25 
+
26  program_grammar(const std::string& model_name);
+
27 
+
28  // global info for parses
+
29  std::string model_name_;
+ +
31  std::stringstream error_msgs_;
+
32 
+
33  // grammars
+ + + +
37 
+
38  // rules
+
39 
+
40  boost::spirit::qi::rule<Iterator,
+
41  std::vector<var_decl>(),
+ + +
44 
+
45  boost::spirit::qi::rule<Iterator,
+
46  std::pair<std::vector<var_decl>,
+
47  std::vector<statement> >(),
+ + +
50 
+
51  boost::spirit::qi::rule<Iterator,
+
52  std::pair<std::vector<var_decl>,
+
53  std::vector<statement> >(),
+ + +
56 
+
57  boost::spirit::qi::rule<Iterator,
+
58  std::pair<std::vector<var_decl>,
+
59  std::vector<statement> >(),
+ + +
62 
+
63  boost::spirit::qi::rule<Iterator,
+
64  statement(),
+ + +
67 
+
68  boost::spirit::qi::rule<Iterator,
+
69  std::vector<var_decl>(),
+ + +
72 
+
73  boost::spirit::qi::rule<Iterator,
+
74  program(),
+ + +
77 
+
78  };
+
79 
+
80 
+
81  }
+
82 }
+
83 
+
84 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/program__grammar__def_8hpp.html b/doc/api/html/program__grammar__def_8hpp.html new file mode 100644 index 00000000000..94cf53021dd --- /dev/null +++ b/doc/api/html/program__grammar__def_8hpp.html @@ -0,0 +1,180 @@ + + + + + +Stan: src/stan/gm/grammars/program_grammar_def.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
program_grammar_def.hpp File Reference
+
+
+
#include <cstddef>
+#include <iomanip>
+#include <iostream>
+#include <istream>
+#include <map>
+#include <set>
+#include <sstream>
+#include <string>
+#include <utility>
+#include <vector>
+#include <stdexcept>
+#include <boost/spirit/include/qi.hpp>
+#include <boost/spirit/include/phoenix_core.hpp>
+#include <boost/spirit/include/phoenix_function.hpp>
+#include <boost/spirit/include/phoenix_fusion.hpp>
+#include <boost/spirit/include/phoenix_object.hpp>
+#include <boost/spirit/include/phoenix_operator.hpp>
+#include <boost/spirit/include/phoenix_stl.hpp>
+#include <boost/lexical_cast.hpp>
+#include <boost/fusion/include/adapt_struct.hpp>
+#include <boost/fusion/include/std_pair.hpp>
+#include <boost/config/warning_disable.hpp>
+#include <boost/spirit/include/qi_numeric.hpp>
+#include <boost/spirit/include/classic_position_iterator.hpp>
+#include <boost/spirit/include/support_multi_pass.hpp>
+#include <boost/tuple/tuple.hpp>
+#include <boost/variant/apply_visitor.hpp>
+#include <boost/variant/recursive_variant.hpp>
+#include <stan/gm/ast.hpp>
+#include <stan/gm/grammars/whitespace_grammar.hpp>
+#include <stan/gm/grammars/expression_grammar.hpp>
+#include <stan/gm/grammars/var_decls_grammar.hpp>
+#include <stan/gm/grammars/statement_grammar.hpp>
+#include <stan/gm/grammars/program_grammar.hpp>
+
+

Go to the source code of this file.

+ + + + +

+Functions

 BOOST_FUSION_ADAPT_STRUCT (stan::gm::program,(std::vector< stan::gm::var_decl >, data_decl_)(DUMMY_STRUCT::type, derived_data_decl_)(std::vector< stan::gm::var_decl >, parameter_decl_)(DUMMY_STRUCT::type, derived_decl_)(stan::gm::statement, statement_)(DUMMY_STRUCT::type, generated_decl_)) namespace stan
 
+

Function Documentation

+ +
+
+ + + + + + + + + + + + + + + + + + +
BOOST_FUSION_ADAPT_STRUCT (stan::gm::program ,
(std::vector< stan::gm::var_decl >, data_decl_)(DUMMY_STRUCT::type, derived_data_decl_)(std::vector< stan::gm::var_decl >, parameter_decl_)(DUMMY_STRUCT::type, derived_decl_)(stan::gm::statement, statement_)(DUMMY_STRUCT::type, generated_decl_)  
)
+
+ +

Definition at line 59 of file program_grammar_def.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/program__grammar__def_8hpp_source.html b/doc/api/html/program__grammar__def_8hpp_source.html new file mode 100644 index 00000000000..cff96740705 --- /dev/null +++ b/doc/api/html/program__grammar__def_8hpp_source.html @@ -0,0 +1,290 @@ + + + + + +Stan: src/stan/gm/grammars/program_grammar_def.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
program_grammar_def.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__PARSER__PROGRAM_GRAMMAR_DEF__HPP__
+
2 #define __STAN__GM__PARSER__PROGRAM_GRAMMAR_DEF__HPP__
+
3 
+
4 #include <cstddef>
+
5 #include <iomanip>
+
6 #include <iostream>
+
7 #include <istream>
+
8 #include <map>
+
9 #include <set>
+
10 #include <sstream>
+
11 #include <string>
+
12 #include <utility>
+
13 #include <vector>
+
14 #include <stdexcept>
+
15 
+
16 #include <boost/spirit/include/qi.hpp>
+
17 // FIXME: get rid of unused include
+
18 #include <boost/spirit/include/phoenix_core.hpp>
+
19 #include <boost/spirit/include/phoenix_function.hpp>
+
20 #include <boost/spirit/include/phoenix_fusion.hpp>
+
21 #include <boost/spirit/include/phoenix_object.hpp>
+
22 #include <boost/spirit/include/phoenix_operator.hpp>
+
23 #include <boost/spirit/include/phoenix_stl.hpp>
+
24 
+
25 #include <boost/lexical_cast.hpp>
+
26 #include <boost/fusion/include/adapt_struct.hpp>
+
27 #include <boost/fusion/include/std_pair.hpp>
+
28 #include <boost/config/warning_disable.hpp>
+
29 #include <boost/spirit/include/qi.hpp>
+
30 #include <boost/spirit/include/qi_numeric.hpp>
+
31 #include <boost/spirit/include/classic_position_iterator.hpp>
+
32 #include <boost/spirit/include/phoenix_core.hpp>
+
33 #include <boost/spirit/include/phoenix_function.hpp>
+
34 #include <boost/spirit/include/phoenix_fusion.hpp>
+
35 #include <boost/spirit/include/phoenix_object.hpp>
+
36 #include <boost/spirit/include/phoenix_operator.hpp>
+
37 #include <boost/spirit/include/phoenix_stl.hpp>
+
38 #include <boost/spirit/include/support_multi_pass.hpp>
+
39 #include <boost/tuple/tuple.hpp>
+
40 #include <boost/variant/apply_visitor.hpp>
+
41 #include <boost/variant/recursive_variant.hpp>
+
42 
+
43 #include <stan/gm/ast.hpp>
+ + + + + +
49 
+
50 namespace {
+
51  // hack to pass pair into macro below to adapt; in namespace to hide
+
52  struct DUMMY_STRUCT {
+
53  typedef std::pair<std::vector<stan::gm::var_decl>,
+
54  std::vector<stan::gm::statement> > type;
+
55  };
+
56 }
+
57 
+
58 
+ +
60  (std::vector<stan::gm::var_decl>, data_decl_)
+
61  (DUMMY_STRUCT::type, derived_data_decl_)
+
62  (std::vector<stan::gm::var_decl>, parameter_decl_)
+
63  (DUMMY_STRUCT::type, derived_decl_)
+
64  (stan::gm::statement, statement_)
+
65  (DUMMY_STRUCT::type, generated_decl_) )
+
66 
+
67 
+
68 namespace stan {
+
69 
+
70  namespace gm {
+
71 
+
72  struct add_lp_var {
+
73  template <typename T>
+
74  struct result { typedef void type; };
+
75  void operator()(variable_map& vm) const {
+
76  vm.add("lp__",
+
77  base_var_decl("lp__",std::vector<expression>(),DOUBLE_T),
+
78  local_origin); // lp acts as a local where defined
+
79  }
+
80  };
+
81  boost::phoenix::function<add_lp_var> add_lp_var_f;
+
82 
+
83  struct remove_lp_var {
+
84  template <typename T>
+
85  struct result { typedef void type; };
+
86  void operator()(variable_map& vm) const {
+
87  vm.remove("lp__");
+
88  }
+
89  };
+
90  boost::phoenix::function<remove_lp_var> remove_lp_var_f;
+
91 
+
92 
+
93  template <typename Iterator>
+
94  program_grammar<Iterator>::program_grammar(const std::string& model_name)
+
95  : program_grammar::base_type(program_r),
+
96  model_name_(model_name),
+
97  var_map_(),
+
98  error_msgs_(),
+
99  expression_g(var_map_,error_msgs_),
+
100  var_decls_g(var_map_,error_msgs_),
+
101  statement_g(var_map_,error_msgs_) {
+
102 
+
103  using boost::spirit::qi::eps;
+
104  using boost::spirit::qi::lit;
+
105 
+
106  // add model_name to var_map with special origin and no
+
107  var_map_.add(model_name,
+
108  base_var_decl(),
+ +
110 
+
111  program_r.name("program");
+
112  program_r
+
113  %= -data_var_decls_r
+
114  > -derived_data_var_decls_r
+
115  > -param_var_decls_r
+
116  // scope lp__ to "transformed params" and "model" only
+
117  > eps[add_lp_var_f(boost::phoenix::ref(var_map_))]
+
118  > -derived_var_decls_r
+
119  > model_r
+
120  > eps[remove_lp_var_f(boost::phoenix::ref(var_map_))]
+
121  > -generated_var_decls_r
+
122  ;
+
123 
+
124  model_r.name("model declaration");
+
125  model_r
+
126  %= lit("model")
+
127  > statement_g(true,local_origin) // assign only to locals
+
128  ;
+
129 
+
130  data_var_decls_r.name("data variable declarations");
+
131  data_var_decls_r
+
132  %= lit("data")
+
133  > lit('{')
+
134  > var_decls_g(true,data_origin) // +constraints
+
135  > lit('}');
+
136 
+
137  derived_data_var_decls_r.name("transformed data block");
+
138  derived_data_var_decls_r
+
139  %= ( lit("transformed")
+
140  >> lit("data") )
+
141  > lit('{')
+
142  > var_decls_g(true,transformed_data_origin) // -constraints
+
143  > *statement_g(false,transformed_data_origin) // -sampling
+
144  > lit('}');
+
145 
+
146  param_var_decls_r.name("parameter variable declarations");
+
147  param_var_decls_r
+
148  %= lit("parameters")
+
149  > lit('{')
+
150  > var_decls_g(true,parameter_origin) // +constraints
+
151  > lit('}');
+
152 
+
153  derived_var_decls_r.name("derived variable declarations");
+
154  derived_var_decls_r
+
155  %= ( lit("transformed")
+
156  >> lit("parameters") )
+
157  > lit('{')
+
158  > var_decls_g(true,transformed_parameter_origin) // -constraints
+
159  > *statement_g(false,transformed_parameter_origin) // -sampling
+
160  > lit('}');
+
161 
+
162  generated_var_decls_r.name("generated variable declarations");
+
163  generated_var_decls_r
+
164  %= lit("generated")
+
165  > lit("quantities")
+
166  > lit('{')
+
167  > var_decls_g(true,derived_origin) // -constraints
+
168  > *statement_g(false,derived_origin) // -sampling
+
169  > lit('}');
+
170 
+
171  using boost::spirit::qi::on_error;
+
172  using boost::spirit::qi::rethrow;
+
173  on_error<rethrow>(program_r,
+
174  (std::ostream&)error_msgs_
+
175  << std::endl
+
176  << boost::phoenix::val("Parser expecting: ")
+
177  << boost::spirit::qi::labels::_4);
+
178  }
+
179 
+
180  }
+
181 }
+
182 
+
183 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/program__grammar__inst_8cpp.html b/doc/api/html/program__grammar__inst_8cpp.html new file mode 100644 index 00000000000..747000e96e7 --- /dev/null +++ b/doc/api/html/program__grammar__inst_8cpp.html @@ -0,0 +1,123 @@ + + + + + +Stan: src/stan/gm/grammars/program_grammar_inst.cpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
program_grammar_inst.cpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/program__grammar__inst_8cpp_source.html b/doc/api/html/program__grammar__inst_8cpp_source.html new file mode 100644 index 00000000000..5a99a4a7bad --- /dev/null +++ b/doc/api/html/program__grammar__inst_8cpp_source.html @@ -0,0 +1,115 @@ + + + + + +Stan: src/stan/gm/grammars/program_grammar_inst.cpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
program_grammar_inst.cpp
+
+
+Go to the documentation of this file.
+ +
3 
+
4 namespace stan {
+
5  namespace gm {
+
6  template struct program_grammar<pos_iterator_t>;
+
7  }
+
8 }
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/promote__common_8hpp.html b/doc/api/html/promote__common_8hpp.html new file mode 100644 index 00000000000..0100680451f --- /dev/null +++ b/doc/api/html/promote__common_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/matrix/promote_common.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
promote_common.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T1 , typename T2 , typename F >
common_type< T1, T2 >::type stan::math::promote_common (const F &u)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/promote__common_8hpp_source.html b/doc/api/html/promote__common_8hpp_source.html new file mode 100644 index 00000000000..9959c9d373f --- /dev/null +++ b/doc/api/html/promote__common_8hpp_source.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/matrix/promote_common.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
promote_common.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__PROMOTE_COMMON_HPP__
+
2 #define __STAN__MATH__MATRIX__PROMOTE_COMMON_HPP__
+
3 
+ + +
6 
+
7 namespace stan {
+
8 
+
9  namespace math {
+
10 
+
11  template <typename T1, typename T2, typename F>
+
12  inline
+
13  typename common_type<T1,T2>::type
+
14  promote_common(const F& u) {
+ +
16  ::promote_to(u);
+
17  }
+
18 
+
19  }
+
20 }
+
21 
+
22 
+
23 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/promoter_8hpp.html b/doc/api/html/promoter_8hpp.html new file mode 100644 index 00000000000..12ba628d161 --- /dev/null +++ b/doc/api/html/promoter_8hpp.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/math/matrix/promoter.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
promoter.hpp File Reference
+
+
+
#include <vector>
+#include <stan/math/matrix/Eigen.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + + + + + + + +

+Classes

struct  stan::math::promoter< F, T >
 
struct  stan::math::promoter< T, T >
 
struct  stan::math::promoter< std::vector< F >, std::vector< T > >
 
struct  stan::math::promoter< std::vector< T >, std::vector< T > >
 
struct  stan::math::promoter< Eigen::Matrix< F, R, C >, Eigen::Matrix< T, R, C > >
 
struct  stan::math::promoter< Eigen::Matrix< T, R, C >, Eigen::Matrix< T, R, C > >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/promoter_8hpp_source.html b/doc/api/html/promoter_8hpp_source.html new file mode 100644 index 00000000000..edda767353c --- /dev/null +++ b/doc/api/html/promoter_8hpp_source.html @@ -0,0 +1,200 @@ + + + + + +Stan: src/stan/math/matrix/promoter.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
promoter.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__PROMOTER_HPP__
+
2 #define __STAN__MATH__MATRIX__PROMOTER_HPP__
+
3 
+
4 #include <vector>
+ +
6 
+
7 namespace stan {
+
8 
+
9  namespace math {
+
10  // from input type F to output type T
+
11 
+
12  // scalar, F != T (base template)
+
13  template <typename F, typename T>
+
14  struct promoter {
+
15  inline static void promote(const F& u, T& t) {
+
16  t = u;
+
17  }
+
18  inline static T promote_to(const F& u) {
+
19  return u;
+
20  }
+
21  };
+
22  // scalar, F == T
+
23  template <typename T>
+
24  struct promoter<T,T> {
+
25  inline static void promote(const T& u, T& t) {
+
26  t = u;
+
27  }
+
28  inline static T promote_to(const T& u) {
+
29  return u;
+
30  }
+
31  };
+
32 
+
33  // std::vector, F != T
+
34  template <typename F, typename T>
+
35  struct promoter<std::vector<F>, std::vector<T> > {
+
36  inline static void promote(const std::vector<F>& u,
+
37  std::vector<T>& t) {
+
38  t.resize(u.size());
+
39  for (size_t i = 0; i < u.size(); ++i)
+
40  promoter<F,T>::promote(u[i],t[i]);
+
41  }
+
42  inline static std::vector<T>
+
43  promote_to(const std::vector<F>& u) {
+
44  std::vector<T> t;
+
45  promoter<std::vector<F>,std::vector<T> >::promote(u,t);
+
46  return t;
+
47  }
+
48  };
+
49  // std::vector, F == T
+
50  template <typename T>
+
51  struct promoter<std::vector<T>, std::vector<T> > {
+
52  inline static void promote(const std::vector<T>& u,
+
53  std::vector<T>& t) {
+
54  t = u;
+
55  }
+
56  inline static std::vector<T> promote_to(const std::vector<T>& u) {
+
57  return u;
+
58  }
+
59  };
+
60 
+
61  // Eigen::Matrix, F != T
+
62  template <typename F, typename T, int R, int C>
+
63  struct promoter<Eigen::Matrix<F,R,C>, Eigen::Matrix<T,R,C> > {
+
64  inline static void promote(const Eigen::Matrix<F,R,C>& u,
+
65  Eigen::Matrix<T,R,C>& t) {
+
66  t.resize(u.rows(), u.cols());
+
67  for (int i = 0; i < u.size(); ++i)
+
68  promoter<F,T>::promote(u(i),t(i));
+
69  }
+
70  inline static Eigen::Matrix<T,R,C>
+
71  promote_to(const Eigen::Matrix<F,R,C>& u) {
+
72  Eigen::Matrix<T,R,C> t;
+
73  promoter<Eigen::Matrix<F,R,C>,Eigen::Matrix<T,R,C> >::promote(u,t);
+
74  return t;
+
75  }
+
76  };
+
77  // Eigen::Matrix, F == T
+
78  template <typename T, int R, int C>
+
79  struct promoter<Eigen::Matrix<T,R,C>, Eigen::Matrix<T,R,C> > {
+
80  inline static void promote(const Eigen::Matrix<T,R,C>& u,
+
81  Eigen::Matrix<T,R,C>& t) {
+
82  t = u;
+
83  }
+
84  inline static Eigen::Matrix<T,R,C> promote_to(const Eigen::Matrix<T,R,C>& u) {
+
85  return u;
+
86  }
+
87  };
+
88 
+
89  }
+
90 }
+
91 
+
92 
+
93 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/ps__point_8hpp.html b/doc/api/html/ps__point_8hpp.html new file mode 100644 index 00000000000..3cba3c49489 --- /dev/null +++ b/doc/api/html/ps__point_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/mcmc/hmc/hamiltonians/ps_point.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
ps_point.hpp File Reference
+
+
+
#include <fstream>
+#include <string>
+#include <boost/lexical_cast.hpp>
+#include <vector>
+#include <stan/math/matrix/Eigen.hpp>
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::ps_point
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/ps__point_8hpp_source.html b/doc/api/html/ps__point_8hpp_source.html new file mode 100644 index 00000000000..56e1a67b53d --- /dev/null +++ b/doc/api/html/ps__point_8hpp_source.html @@ -0,0 +1,205 @@ + + + + + +Stan: src/stan/mcmc/hmc/hamiltonians/ps_point.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
ps_point.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__PS_POINT__BETA__
+
2 #define __STAN__MCMC__PS_POINT__BETA__
+
3 
+
4 #include <fstream>
+
5 #include <string>
+
6 #include <boost/lexical_cast.hpp>
+
7 
+
8 #include <vector>
+ +
10 
+
11 namespace stan {
+
12 
+
13  namespace mcmc {
+
14 
+
15  // Point in a generic phase space
+
16  class ps_point {
+
17 
+
18  public:
+
19 
+
20  ps_point(int n): q(n), p(n), V(0), g(n) {};
+
21 
+
22  ps_point(const ps_point& z): q(z.q.size()), p(z.p.size()), V(z.V), g(z.g.size())
+
23  {
+
24  _fast_vector_copy<double>(q, z.q);
+
25  _fast_vector_copy<double>(p, z.p);
+
26  _fast_vector_copy<double>(g, z.g);
+
27  }
+
28 
+
29 
+ +
31  {
+
32 
+
33  if(this == &z) return *this;
+
34 
+
35  _fast_vector_copy<double>(q, z.q);
+
36 
+
37  V = z.V;
+
38 
+
39  _fast_vector_copy<double>(p, z.p);
+
40  _fast_vector_copy<double>(g, z.g);
+
41 
+
42  return *this;
+
43 
+
44  }
+
45 
+
46  Eigen::VectorXd q;
+
47  Eigen::VectorXd p;
+
48 
+
49  double V;
+
50  Eigen::VectorXd g;
+
51 
+
52  virtual void get_param_names(std::vector<std::string>& model_names,
+
53  std::vector<std::string>& names) {
+
54  for(int i = 0; i < q.size(); ++i)
+
55  names.push_back(model_names.at(i));
+
56  for(int i = 0; i < q.size(); ++i)
+
57  names.push_back(std::string("p_") + model_names.at(i));
+
58  for(int i = 0; i < q.size(); ++i)
+
59  names.push_back(std::string("g_") + model_names.at(i));
+
60  }
+
61 
+
62  virtual void get_params(std::vector<double>& values) {
+
63  for(int i = 0; i < q.size(); ++i)
+
64  values.push_back(q(i));
+
65  for(int i = 0; i < q.size(); ++i)
+
66  values.push_back(p(i));
+
67  for(int i = 0; i < q.size(); ++i)
+
68  values.push_back(g(i));
+
69  }
+
70 
+
71  virtual void write_metric(std::ostream* o) {
+
72  if(!o) return;
+
73  *o << "# No free parameters for unit metric" << std::endl;
+
74  }
+
75 
+
76  protected:
+
77 
+
78  template <typename T>
+
79  inline void _fast_vector_copy(Eigen::Matrix<T, Eigen::Dynamic, 1>& v_to, const Eigen::Matrix<T, Eigen::Dynamic, 1>& v_from) {
+
80  v_to.resize(v_from.size());
+
81  std::memcpy(&v_to(0), &v_from(0), v_from.size() * sizeof(double));
+
82  }
+
83 
+
84  template <typename T>
+
85  inline void _fast_matrix_copy(Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic>& v_to,
+
86  const Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic>& v_from) {
+
87  v_to.resize(v_from.rows(), v_from.cols());
+
88  std::memcpy(&v_to(0), &v_from(0), v_from.size() * sizeof(double));
+
89  }
+
90 
+
91  };
+
92 
+
93  } // mcmc
+
94 
+
95 } // stan
+
96 
+
97 
+
98 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/raise__domain__error_8hpp.html b/doc/api/html/raise__domain__error_8hpp.html new file mode 100644 index 00000000000..dd60defc346 --- /dev/null +++ b/doc/api/html/raise__domain__error_8hpp.html @@ -0,0 +1,149 @@ + + + + + +Stan: src/stan/math/error_handling/raise_domain_error.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
raise_domain_error.hpp File Reference
+
+
+
#include <boost/math/policies/policy.hpp>
+#include <boost/math/policies/error_handling.hpp>
+#include <boost/math/distributions/detail/common_error_handling.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
namespace  stan::math::policies
 Extending boost functionality.
 
namespace  stan::math::policies::detail
 Reimplementing boost::math::policies::detail::raise_domain_error.
 
+ + + + + + + + + + + + + + + + +

+Functions

template<class T_result , class T_val >
T_result stan::math::policies::detail::raise_domain_error (const char *function, const char *message, const T_val &val, const ::boost::math::policies::domain_error< ::boost::math::policies::throw_on_error > &)
 
template<class T_result , class T_val >
T_result stan::math::policies::detail::raise_domain_error (const char *, const char *, const T_val &, const ::boost::math::policies::domain_error< ::boost::math::policies::ignore_error > &)
 
template<class T_result , class T_val >
T_result stan::math::policies::detail::raise_domain_error (const char *, const char *, const T_val &, const ::boost::math::policies::domain_error< ::boost::math::policies::errno_on_error > &)
 
template<class T_result , class T_val >
T_result stan::math::policies::detail::raise_domain_error (const char *function, const char *message, const T_val &val, const ::boost::math::policies::domain_error< ::boost::math::policies::user_error > &)
 
template<class T_result , class T_val , class Policy >
T_result stan::math::policies::raise_domain_error (const char *function, const char *message, const T_val &val, const Policy &)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/raise__domain__error_8hpp_source.html b/doc/api/html/raise__domain__error_8hpp_source.html new file mode 100644 index 00000000000..f476b578078 --- /dev/null +++ b/doc/api/html/raise__domain__error_8hpp_source.html @@ -0,0 +1,179 @@ + + + + + +Stan: src/stan/math/error_handling/raise_domain_error.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
raise_domain_error.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__ERROR_HANDLING__RAISE_DOMAIN_ERROR_HPP__
+
2 #define __STAN__MATH__ERROR_HANDLING__RAISE_DOMAIN_ERROR_HPP__
+
3 
+
4 #include <boost/math/policies/policy.hpp>
+
5 #include <boost/math/policies/error_handling.hpp>
+
6 #include <boost/math/distributions/detail/common_error_handling.hpp>
+
7 
+
8 namespace stan {
+
9  namespace math {
+
10  namespace policies {
+
11  namespace detail {
+
12  using boost::math::policies::detail::raise_error;
+
13  template <class T_result, class T_val>
+
14  inline T_result raise_domain_error(const char* function,
+
15  const char* message,
+
16  const T_val& val,
+
17  const ::boost::math::policies::domain_error< ::boost::math::policies::throw_on_error>&) {
+
18  raise_error<std::domain_error, T_val>(function, message, val);
+
19  // we never get here:
+
20  return std::numeric_limits<T_result>::quiet_NaN();
+
21  }
+
22 
+
23  template <class T_result, class T_val>
+
24  inline T_result raise_domain_error(const char* ,
+
25  const char* ,
+
26  const T_val& ,
+
27  const ::boost::math::policies::domain_error< ::boost::math::policies::ignore_error>&) {
+
28  // This may or may not do the right thing, but the user asked for the error
+
29  // to be ignored so here we go anyway:
+
30  return std::numeric_limits<T_result>::quiet_NaN();
+
31  }
+
32 
+
33  template <class T_result, class T_val>
+
34  inline T_result raise_domain_error(const char* ,
+
35  const char* ,
+
36  const T_val& ,
+
37  const ::boost::math::policies::domain_error< ::boost::math::policies::errno_on_error>&) {
+
38  errno = EDOM;
+
39  // This may or may not do the right thing, but the user asked for the error
+
40  // to be silent so here we go anyway:
+
41  return std::numeric_limits<T_result>::quiet_NaN();
+
42  }
+
43 
+
44  template <class T_result, class T_val>
+
45  inline T_result raise_domain_error(const char* function,
+
46  const char* message,
+
47  const T_val& val,
+
48  const ::boost::math::policies::domain_error< ::boost::math::policies::user_error>&) {
+
49  return user_domain_error(function, message, val);
+
50  }
+
51 
+
52  }
+
53 
+
54  template <class T_result, class T_val, class Policy>
+
55  inline T_result raise_domain_error(const char* function,
+
56  const char* message,
+
57  const T_val& val,
+
58  const Policy&) {
+
59  typedef typename Policy::domain_error_type policy_type;
+
60  return detail::raise_domain_error<T_result,T_val>(function,
+
61  message ? message : "Domain Error evaluating function at %1%",
+
62  val,
+
63  policy_type());
+
64 
+
65  }
+
66  }
+
67  }
+
68 
+
69 }
+
70 
+
71 
+
72 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rank_8hpp.html b/doc/api/html/rank_8hpp.html new file mode 100644 index 00000000000..db8b1d3447a --- /dev/null +++ b/doc/api/html/rank_8hpp.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/math/matrix/rank.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
rank.hpp File Reference
+
+
+
#include <vector>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/check_range.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + +

+Functions

template<typename T >
size_t stan::math::rank (const std::vector< T > &v, int s)
 Return the number of components of v less than v[s].
 
template<typename T , int R, int C>
size_t stan::math::rank (const Eigen::Matrix< T, R, C > &v, int s)
 Return the number of components of v less than v[s].
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rank_8hpp_source.html b/doc/api/html/rank_8hpp_source.html new file mode 100644 index 00000000000..c6b23381719 --- /dev/null +++ b/doc/api/html/rank_8hpp_source.html @@ -0,0 +1,145 @@ + + + + + +Stan: src/stan/math/matrix/rank.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
rank.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__RANK_HPP__
+
2 #define __STAN__MATH__MATRIX__RANK_HPP__
+
3 
+
4 #include <vector>
+ + +
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
17  template <typename T>
+
18  inline size_t rank(const std::vector<T> & v, int s) {
+
19  size_t size = v.size();
+
20  check_range(size,s,"in the function rank(v,s)",s);
+
21  s--;
+
22  size_t count(0U);
+
23  T compare(v[s]);
+
24  for (size_t i = 0U; i < size; ++i)
+
25  if (v[i]<compare) count++;
+
26  return count;
+
27  }
+
28 
+
35  template <typename T, int R, int C>
+
36  inline size_t rank(const Eigen::Matrix<T,R,C> & v, int s) {
+
37  size_t size = v.size();
+
38  check_range(size,s,"in the function rank(v,s)",s);
+
39  s--;
+
40  const T * vv = v.data();
+
41  size_t count(0U);
+
42  T compare(vv[s]);
+
43  for (size_t i = 0U; i < size; ++i)
+
44  if (vv[i]<compare) count++;
+
45  return count;
+
46  }
+
47 
+
48  }
+
49 }
+
50 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rayleigh_8hpp.html b/doc/api/html/rayleigh_8hpp.html new file mode 100644 index 00000000000..ceff050f8dc --- /dev/null +++ b/doc/api/html/rayleigh_8hpp.html @@ -0,0 +1,151 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/rayleigh.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
rayleigh.hpp File Reference
+
+
+
#include <boost/random/uniform_real_distribution.hpp>
+#include <boost/random/variate_generator.hpp>
+#include <stan/agrad/partials_vari.hpp>
+#include <stan/math.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/prob/constants.hpp>
+#include <stan/prob/traits.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + + + + + + +

+Functions

template<bool propto, typename T_y , typename T_scale >
return_type< T_y, T_scale >::type stan::prob::rayleigh_log (const T_y &y, const T_scale &sigma)
 
template<typename T_y , typename T_scale >
return_type< T_y, T_scale >::type stan::prob::rayleigh_log (const T_y &y, const T_scale &sigma)
 
template<typename T_y , typename T_scale >
return_type< T_y, T_scale >::type stan::prob::rayleigh_cdf (const T_y &y, const T_scale &sigma)
 
template<typename T_y , typename T_scale >
return_type< T_y, T_scale >::type stan::prob::rayleigh_cdf_log (const T_y &y, const T_scale &sigma)
 
template<typename T_y , typename T_scale >
return_type< T_y, T_scale >::type stan::prob::rayleigh_ccdf_log (const T_y &y, const T_scale &sigma)
 
template<class RNG >
double stan::prob::rayleigh_rng (const double sigma, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rayleigh_8hpp_source.html b/doc/api/html/rayleigh_8hpp_source.html new file mode 100644 index 00000000000..36a1572ae89 --- /dev/null +++ b/doc/api/html/rayleigh_8hpp_source.html @@ -0,0 +1,447 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/rayleigh.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
rayleigh.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS__RAYLEIGH_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS__RAYLEIGH_HPP__
+
3 
+
4 #include <boost/random/uniform_real_distribution.hpp>
+
5 #include <boost/random/variate_generator.hpp>
+
6 
+ +
8 #include <stan/math.hpp>
+ +
10 #include <stan/meta/traits.hpp>
+
11 #include <stan/prob/constants.hpp>
+
12 #include <stan/prob/traits.hpp>
+
13 
+
14 namespace stan {
+
15 
+
16  namespace prob {
+
17 
+
18  template <bool propto,
+
19  typename T_y, typename T_scale>
+
20  typename return_type<T_y,T_scale>::type
+
21  rayleigh_log(const T_y& y, const T_scale& sigma) {
+
22  static const char* function = "stan::prob::rayleigh_log(%1%)";
+
23 
+
24  using std::log;
+ + + + + + + +
32 
+
33  // check if any vectors are zero length
+
34  if (!(stan::length(y) && stan::length(sigma)))
+
35  return 0.0;
+
36 
+
37  // set up return value accumulator
+
38  double logp(0.0);
+
39 
+
40  // validate args (here done over var, which should be OK)
+
41  if (!check_not_nan(function, y, "Random variable", &logp))
+
42  return logp;
+
43  if (!check_positive(function, sigma, "Scale parameter", &logp))
+
44  return logp;
+
45  if (!check_positive(function, y, "Random variable", &logp))
+
46  return logp;
+
47  if (!(check_consistent_sizes(function,
+
48  y,sigma,
+
49  "Random variable","Scale parameter",
+
50  &logp)))
+
51  return logp;
+
52 
+
53  // check if no variables are involved and prop-to
+ +
55  return 0.0;
+
56 
+
57  // set up template expressions wrapping scalars into vector views
+
58  agrad::OperandsAndPartials<T_y, T_scale> operands_and_partials(y, sigma);
+
59 
+
60  VectorView<const T_y> y_vec(y);
+
61  VectorView<const T_scale> sigma_vec(sigma);
+
62  size_t N = max_size(y, sigma);
+
63 
+ + +
66  is_vector<T_scale>::value> log_sigma(length(sigma));
+
67  for (size_t i = 0; i < length(sigma); i++) {
+
68  inv_sigma[i] = 1.0 / value_of(sigma_vec[i]);
+ +
70  log_sigma[i] = log(value_of(sigma_vec[i]));
+
71  }
+
72 
+
73  for (size_t n = 0; n < N; n++) {
+
74  // pull out values of arguments
+
75  const double y_dbl = value_of(y_vec[n]);
+
76 
+
77  // reusable subexpression values
+
78  const double y_over_sigma = y_dbl * inv_sigma[n];
+
79 
+
80  static double NEGATIVE_HALF = -0.5;
+
81 
+
82  // log probability
+ +
84  logp -= 2.0 * log_sigma[n];
+ +
86  logp += log(y_dbl);
+
87  // if (include_summand<propto,T_y,T_scale>::value)
+
88  logp += NEGATIVE_HALF * y_over_sigma * y_over_sigma;
+
89 
+
90  // gradients
+
91  double scaled_diff = inv_sigma[n] * y_over_sigma;
+ +
93  operands_and_partials.d_x1[n] += 1.0 / y_dbl - scaled_diff;
+ +
95  operands_and_partials.d_x2[n]
+
96  += y_over_sigma * scaled_diff - 2.0 * inv_sigma[n];
+
97  }
+
98  return operands_and_partials.to_var(logp);
+
99  }
+
100 
+
101  template <typename T_y, typename T_scale>
+
102  inline
+ +
104  rayleigh_log(const T_y& y, const T_scale& sigma) {
+
105  return rayleigh_log<false>(y,sigma);
+
106  }
+
107 
+
108  template <typename T_y, typename T_scale>
+ +
110  rayleigh_cdf(const T_y& y, const T_scale& sigma) {
+
111  static const char* function = "stan::prob::rayleigh_cdf(%1%)";
+
112 
+ + + + + + + +
120  using stan::math::square;
+
121  using stan::math::value_of;
+
122 
+
123  double cdf(1.0);
+
124 
+
125  // check if any vectors are zero length
+
126  if (!(stan::length(y) && stan::length(sigma)))
+
127  return cdf;
+
128 
+
129  if (!check_not_nan(function, y, "Random variable", &cdf))
+
130  return cdf;
+
131  if (!check_nonnegative(function, y, "Random variable", &cdf))
+
132  return cdf;
+
133  if (!check_not_nan(function, sigma, "Scale parameter", &cdf))
+
134  return cdf;
+
135  if (!check_positive(function, sigma, "Scale parameter", &cdf))
+
136  return cdf;
+
137  if (!(check_consistent_sizes(function,
+
138  y,sigma,
+
139  "Random variable","Scale parameter",
+
140  &cdf)))
+
141  return cdf;
+
142 
+
143 
+
144  // set up template expressions wrapping scalars into vector views
+
145  agrad::OperandsAndPartials<T_y, T_scale> operands_and_partials(y, sigma);
+
146 
+
147  VectorView<const T_y> y_vec(y);
+
148  VectorView<const T_scale> sigma_vec(sigma);
+
149  size_t N = max_size(y, sigma);
+
150 
+ +
152  for (size_t i = 0; i < length(sigma); i++) {
+
153  inv_sigma[i] = 1.0 / value_of(sigma_vec[i]);
+
154  }
+
155 
+
156  for (size_t n = 0; n < N; n++) {
+
157  const double y_dbl = value_of(y_vec[n]);
+
158  const double y_sqr = y_dbl * y_dbl;
+
159  const double inv_sigma_sqr = inv_sigma[n] * inv_sigma[n];
+
160  const double exp_val = exp(-0.5 * y_sqr * inv_sigma_sqr);
+
161 
+ +
163  cdf *= (1.0 - exp_val);
+
164  }
+
165 
+
166  //gradients
+
167  for (size_t n = 0; n < N; n++) {
+
168  const double y_dbl = value_of(y_vec[n]);
+
169  const double y_sqr = square(y_dbl);
+
170  const double inv_sigma_sqr = square(inv_sigma[n]);
+
171  const double exp_val = exp(-0.5 * y_sqr * inv_sigma_sqr);
+
172  const double exp_div_1m_exp = exp_val / (1.0 - exp_val);
+
173 
+ +
175  operands_and_partials.d_x1[n] += y_dbl * inv_sigma_sqr
+
176  * exp_div_1m_exp * cdf;
+ +
178  operands_and_partials.d_x2[n] -= y_sqr * inv_sigma_sqr
+
179  * inv_sigma[n] * exp_div_1m_exp * cdf;
+
180  }
+
181 
+
182  return operands_and_partials.to_var(cdf);
+
183  }
+
184 
+
185  template <typename T_y, typename T_scale>
+ +
187  rayleigh_cdf_log(const T_y& y, const T_scale& sigma) {
+
188  static const char* function = "stan::prob::rayleigh_cdf_log(%1%)";
+
189 
+ + + + + + + +
197  using stan::math::square;
+
198  using stan::math::value_of;
+
199 
+
200  double cdf_log(0.0);
+
201 
+
202  // check if any vectors are zero length
+
203  if (!(stan::length(y) && stan::length(sigma)))
+
204  return cdf_log;
+
205 
+
206  if (!check_not_nan(function, y, "Random variable", &cdf_log))
+
207  return cdf_log;
+
208  if (!check_nonnegative(function, y, "Random variable", &cdf_log))
+
209  return cdf_log;
+
210  if (!check_not_nan(function, sigma, "Scale parameter", &cdf_log))
+
211  return cdf_log;
+
212  if (!check_positive(function, sigma, "Scale parameter", &cdf_log))
+
213  return cdf_log;
+
214  if (!(check_consistent_sizes(function,
+
215  y,sigma,
+
216  "Random variable","Scale parameter",
+
217  &cdf_log)))
+
218  return cdf_log;
+
219 
+
220 
+
221  // set up template expressions wrapping scalars into vector views
+
222  agrad::OperandsAndPartials<T_y, T_scale> operands_and_partials(y, sigma);
+
223 
+
224  VectorView<const T_y> y_vec(y);
+
225  VectorView<const T_scale> sigma_vec(sigma);
+
226  size_t N = max_size(y, sigma);
+
227 
+ +
229  for (size_t i = 0; i < length(sigma); i++) {
+
230  inv_sigma[i] = 1.0 / value_of(sigma_vec[i]);
+
231  }
+
232 
+
233  for (size_t n = 0; n < N; n++) {
+
234  const double y_dbl = value_of(y_vec[n]);
+
235  const double y_sqr = y_dbl * y_dbl;
+
236  const double inv_sigma_sqr = inv_sigma[n] * inv_sigma[n];
+
237  const double exp_val = exp(-0.5 * y_sqr * inv_sigma_sqr);
+
238  const double exp_div_1m_exp = exp_val / (1.0 - exp_val);
+
239 
+ +
241  cdf_log += log(1.0 - exp_val);
+
242 
+ +
244  operands_and_partials.d_x1[n] += y_dbl * inv_sigma_sqr
+
245  * exp_div_1m_exp;
+ +
247  operands_and_partials.d_x2[n] -= y_sqr * inv_sigma_sqr
+
248  * inv_sigma[n] * exp_div_1m_exp;
+
249  }
+
250 
+
251  return operands_and_partials.to_var(cdf_log);
+
252  }
+
253 
+
254  template <typename T_y, typename T_scale>
+ +
256  rayleigh_ccdf_log(const T_y& y, const T_scale& sigma) {
+
257  static const char* function = "stan::prob::rayleigh_ccdf_log(%1%)";
+
258 
+ + + + + + + +
266  using stan::math::square;
+
267  using stan::math::value_of;
+
268 
+
269  double ccdf_log(0.0);
+
270 
+
271  // check if any vectors are zero length
+
272  if (!(stan::length(y) && stan::length(sigma)))
+
273  return ccdf_log;
+
274 
+
275  if (!check_not_nan(function, y, "Random variable", &ccdf_log))
+
276  return ccdf_log;
+
277  if (!check_nonnegative(function, y, "Random variable", &ccdf_log))
+
278  return ccdf_log;
+
279  if (!check_not_nan(function, sigma, "Scale parameter", &ccdf_log))
+
280  return ccdf_log;
+
281  if (!check_positive(function, sigma, "Scale parameter", &ccdf_log))
+
282  return ccdf_log;
+
283  if (!(check_consistent_sizes(function,
+
284  y,sigma,
+
285  "Random variable","Scale parameter",
+
286  &ccdf_log)))
+
287  return ccdf_log;
+
288 
+
289 
+
290  // set up template expressions wrapping scalars into vector views
+
291  agrad::OperandsAndPartials<T_y, T_scale> operands_and_partials(y, sigma);
+
292 
+
293  VectorView<const T_y> y_vec(y);
+
294  VectorView<const T_scale> sigma_vec(sigma);
+
295  size_t N = max_size(y, sigma);
+
296 
+ +
298  for (size_t i = 0; i < length(sigma); i++) {
+
299  inv_sigma[i] = 1.0 / value_of(sigma_vec[i]);
+
300  }
+
301 
+
302  for (size_t n = 0; n < N; n++) {
+
303  const double y_dbl = value_of(y_vec[n]);
+
304  const double y_sqr = y_dbl * y_dbl;
+
305  const double inv_sigma_sqr = inv_sigma[n] * inv_sigma[n];
+
306 
+ +
308  ccdf_log += -0.5 * y_sqr * inv_sigma_sqr;
+
309 
+ +
311  operands_and_partials.d_x1[n] -= y_dbl * inv_sigma_sqr;
+ +
313  operands_and_partials.d_x2[n] += y_sqr * inv_sigma_sqr
+
314  * inv_sigma[n];
+
315  }
+
316 
+
317  return operands_and_partials.to_var(ccdf_log);
+
318  }
+
319 
+
320  template <class RNG>
+
321  inline double
+
322  rayleigh_rng(const double sigma,
+
323  RNG& rng) {
+
324  using boost::variate_generator;
+
325  using boost::random::uniform_real_distribution;
+
326 
+
327  static const char* function = "stan::prob::rayleigh_rng(%1%)";
+
328 
+ +
330 
+
331  if (!check_positive(function, sigma, "Scale parameter"))
+
332  return 0;
+
333 
+
334  variate_generator<RNG&, uniform_real_distribution<> >
+
335  uniform_rng(rng, uniform_real_distribution<>(0.0, 1.0));
+
336  return sigma * std::sqrt(-2.0 * std::log(uniform_rng()));
+
337  }
+
338  }
+
339 }
+
340 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/reader_8hpp.html b/doc/api/html/reader_8hpp.html new file mode 100644 index 00000000000..b3c86c2563c --- /dev/null +++ b/doc/api/html/reader_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/io/reader.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
reader.hpp File Reference
+
+
+
#include <boost/throw_exception.hpp>
+#include <stan/prob/transform.hpp>
+
+

Go to the source code of this file.

+ + + + + +

+Classes

class  stan::io::reader< T >
 A stream-based reader for integer, scalar, vector, matrix and array data types, with Jacobian calculations. More...
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::io
 Input/output utilities.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/reader_8hpp_source.html b/doc/api/html/reader_8hpp_source.html new file mode 100644 index 00000000000..d6d975a0b1b --- /dev/null +++ b/doc/api/html/reader_8hpp_source.html @@ -0,0 +1,726 @@ + + + + + +Stan: src/stan/io/reader.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
reader.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__IO__READER_HPP__
+
2 #define __STAN__IO__READER_HPP__
+
3 
+
4 #include <boost/throw_exception.hpp>
+ +
6 
+
7 namespace stan {
+
8 
+
9  namespace io {
+
10 
+
11 
+
33  template <typename T>
+
34  class reader {
+
35 
+
36  private:
+
37 
+
38  std::vector<T>& data_r_;
+
39  std::vector<int>& data_i_;
+
40  size_t pos_;
+
41  size_t int_pos_;
+
42 
+
43  inline T& scalar_ptr() {
+
44  return data_r_.at(pos_);
+
45  }
+
46 
+
47  inline T& scalar_ptr_increment(size_t m) {
+
48  pos_ += m;
+
49  return data_r_.at(pos_ - m);
+
50  }
+
51 
+
52  inline int& int_ptr() {
+
53  return data_i_.at(int_pos_);
+
54  }
+
55 
+
56  inline int& int_ptr_increment(size_t m) {
+
57  int_pos_ += m;
+
58  return data_i_.at(int_pos_ - m);
+
59  }
+
60 
+
61  public:
+
62 
+
63  typedef Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> matrix_t;
+
64  typedef Eigen::Matrix<T,Eigen::Dynamic,1> vector_t;
+
65  typedef Eigen::Matrix<T,1,Eigen::Dynamic> row_vector_t;
+
66 
+
67  typedef Eigen::Map<matrix_t> map_matrix_t;
+
68  typedef Eigen::Map<vector_t> map_vector_t;
+
69  typedef Eigen::Map<row_vector_t> map_row_vector_t;
+
70 
+
71 
+
83  reader(std::vector<T>& data_r,
+
84  std::vector<int>& data_i)
+
85  : data_r_(data_r),
+
86  data_i_(data_i),
+
87  pos_(0),
+
88  int_pos_(0) {
+
89  }
+
90 
+
94  ~reader() { }
+
95 
+
101  inline size_t available() {
+
102  return data_r_.size() - pos_;
+
103  }
+
104 
+
110  inline size_t available_i() {
+
111  return data_i_.size() - int_pos_;
+
112  }
+
113 
+
119  inline int integer() {
+
120  if (int_pos_ >= data_i_.size())
+
121  BOOST_THROW_EXCEPTION(
+
122  std::runtime_error("no more integers to read."));
+
123  return data_i_[int_pos_++];
+
124  }
+
125 
+
133  inline int integer_constrain() {
+
134  return integer();
+
135  }
+
136 
+
144  inline int integer_constrain(T& /*log_prob*/) {
+
145  return integer();
+
146  }
+
147 
+
148 
+
149 
+
155  inline T scalar() {
+
156  if (pos_ >= data_r_.size())
+
157  BOOST_THROW_EXCEPTION(std::runtime_error("no more scalars to read"));
+
158  return data_r_[pos_++];
+
159  }
+
160 
+
167  inline T scalar_constrain() {
+
168  return scalar();
+
169  }
+
170 
+
182  T scalar_constrain(T& /*log_prob*/) {
+
183  return scalar();
+
184  }
+
185 
+
186 
+
194  inline std::vector<T> std_vector(size_t m) {
+
195  std::vector<T> vec;
+
196  T& start = scalar_ptr_increment(m);
+
197  vec.insert(vec.begin(), &start, &scalar_ptr());
+
198  return vec;
+
199  }
+
200 
+
208  inline vector_t vector(size_t m) {
+
209  return map_vector_t(&scalar_ptr_increment(m),m);
+
210  }
+
218  inline vector_t vector_constrain(size_t m) {
+
219  return map_vector_t(&scalar_ptr_increment(m),m);
+
220  }
+
229  inline vector_t vector_constrain(size_t m, T& /*lp*/) {
+
230  return map_vector_t(&scalar_ptr_increment(m),m);
+
231  }
+
232 
+
233 
+
234 
+
242  inline row_vector_t row_vector(size_t m) {
+
243  return map_row_vector_t(&scalar_ptr_increment(m),m);
+
244  }
+
245 
+ +
254  return map_row_vector_t(&scalar_ptr_increment(m),m);
+
255  }
+
256 
+
266  inline row_vector_t row_vector_constrain(size_t m, T& /*lp*/) {
+
267  return map_row_vector_t(&scalar_ptr_increment(m),m);
+
268  }
+
269 
+
287  inline matrix_t matrix(size_t m, size_t n) {
+
288  return map_matrix_t(&scalar_ptr_increment(m*n),m,n);
+
289  }
+
290 
+
301  inline matrix_t matrix_constrain(size_t m, size_t n) {
+
302  return map_matrix_t(&scalar_ptr_increment(m*n),m,n);
+
303  }
+
304 
+
317  inline matrix_t matrix_constrain(size_t m, size_t n, T& /*lp*/) {
+
318  return map_matrix_t(&scalar_ptr_increment(m*n),m,n);
+
319  }
+
320 
+
321 
+
331  inline int integer_lb(int lb) {
+
332  int i = integer();
+
333  if (!(i >= lb))
+
334  BOOST_THROW_EXCEPTION(
+
335  std::runtime_error("required value greater than or equal to lb"));
+
336  return i;
+
337  }
+
347  inline int integer_lb_constrain(int lb) {
+
348  return integer_lb(lb);
+
349  }
+
360  inline int integer_lb_constrain(int lb, T& /*lp*/) {
+
361  return integer_lb(lb);
+
362  }
+
363 
+
364 
+
374  inline int integer_ub(int ub) {
+
375  int i = integer();
+
376  if (!(i <= ub))
+
377  BOOST_THROW_EXCEPTION(
+
378  std::runtime_error("required value less than or equal to ub"));
+
379  return i;
+
380  }
+
390  inline int integer_ub_constrain(int ub) {
+
391  return integer_ub(ub);
+
392  }
+
403  int integer_ub_constrain(int ub, T& /*lp*/) {
+
404  return integer_ub(ub);
+
405  }
+
406 
+
419  inline int integer_lub(int lb, int ub) {
+
420  // read first to make position deterministic [arbitrary choice]
+
421  int i = integer();
+
422  if (lb > ub)
+
423  BOOST_THROW_EXCEPTION(
+
424  std::runtime_error("lower bound must be less than or equal to ub"));
+
425  if (!(i >= lb))
+
426  BOOST_THROW_EXCEPTION(
+
427  std::runtime_error("required value greater than or equal to lb"));
+
428  if (!(i <= ub))
+
429  BOOST_THROW_EXCEPTION(
+
430  std::runtime_error("required value less than or equal to ub"));
+
431  return i;
+
432  }
+
443  inline int integer_lub_constrain(int lb, int ub) {
+
444  return integer_lub(lb,ub);
+
445  }
+
457  inline int integer_lub_constrain(int lb, int ub, T& /*lp*/) {
+
458  return integer_lub(lb,ub);
+
459  }
+
460 
+
461 
+
462 
+
472  inline T scalar_pos() {
+
473  T x(scalar());
+
474  stan::math::check_positive("stan::io::scalar_pos(%1%)", x,
+
475  "Constrained scalar");
+
476  return x;
+
477  }
+
478 
+
486  inline T scalar_pos_constrain() {
+ +
488  }
+
489 
+
500  inline T scalar_pos_constrain(T& lp) {
+ +
502  }
+
503 
+
516  template <typename TL>
+
517  inline T scalar_lb(const TL lb) {
+
518  T x(scalar());
+
519  stan::math::check_greater_or_equal("stan::io::scalar_lb(%1%)",
+
520  x, lb, "Constrained scalar");
+
521  return x;
+
522  }
+
523 
+
535  template <typename TL>
+
536  inline T scalar_lb_constrain(const TL lb) {
+
537  return stan::prob::lb_constrain(scalar(),lb);
+
538  }
+
539 
+
551  template <typename TL>
+
552  inline T scalar_lb_constrain(const TL lb, T& lp) {
+
553  return stan::prob::lb_constrain(scalar(),lb,lp);
+
554  }
+
555 
+
556 
+
557 
+
570  template <typename TU>
+
571  inline T scalar_ub(TU ub) {
+
572  T x(scalar());
+
573  stan::math::check_less_or_equal("stan::io::scalar_ub(%1%)", x, ub, "Constrained scalar");
+
574  return x;
+
575  }
+
576 
+
588  template <typename TU>
+
589  inline T scalar_ub_constrain(const TU ub) {
+
590  return stan::prob::ub_constrain(scalar(),ub);
+
591  }
+
592 
+
604  template <typename TU>
+
605  inline T scalar_ub_constrain(const TU ub, T& lp) {
+
606  return stan::prob::ub_constrain(scalar(),ub,lp);
+
607  }
+
608 
+
623  template <typename TL, typename TU>
+
624  inline T scalar_lub(const TL lb, const TU ub) {
+
625  T x(scalar());
+
626  stan::math::check_bounded("stan::io::scalar_lub(%1%)", x, lb, ub, "Constrained scalar");
+
627  return x;
+
628  }
+
629 
+
643  template <typename TL, typename TU>
+
644  inline T scalar_lub_constrain(const TL lb, const TU ub) {
+
645  return stan::prob::lub_constrain(scalar(),lb,ub);
+
646  }
+
647 
+
661  template <typename TL, typename TU>
+
662  inline T scalar_lub_constrain(TL lb, TU ub, T& lp) {
+
663  return stan::prob::lub_constrain(scalar(),lb,ub,lp);
+
664  }
+
665 
+
674  inline T prob() {
+
675  T x(scalar());
+
676  stan::math::check_bounded("stan::io::prob(%1%)", x, 0, 1, "Constrained probability");
+
677  return x;
+
678  }
+
679 
+
688  inline T prob_constrain() {
+ +
690  }
+
691 
+
702  inline T prob_constrain(T& lp) {
+
703  return stan::prob::prob_constrain(scalar(),lp);
+
704  }
+
705 
+
706 
+
707 
+
708 
+
720  inline T corr() {
+
721  T x(scalar());
+
722  stan::math::check_bounded("stan::io::corr(%1%)", x, -1, 1, "Correlation value");
+
723  return x;
+
724  }
+
725 
+
734  inline T corr_constrain() {
+ +
736  }
+
737 
+
749  inline T corr_constrain(T& lp) {
+
750  return stan::prob::corr_constrain(scalar(),lp);
+
751  }
+
752 
+
763  inline vector_t unit_vector(size_t k) {
+
764  vector_t theta(vector(k));
+
765  stan::math::check_unit_vector("stan::io::unit_vector(%1%)", theta, "Constrained vector");
+
766  return theta;
+
767  }
+
768 
+
779  inline
+
780  Eigen::Matrix<T,Eigen::Dynamic,1> unit_vector_constrain(size_t k) {
+ +
782  }
+
783 
+
796  inline vector_t unit_vector_constrain(size_t k, T& lp) {
+ +
798  }
+
799 
+
810  inline vector_t simplex(size_t k) {
+
811  vector_t theta(vector(k));
+
812  stan::math::check_simplex("stan::io::simplex(%1%)", theta, "Constrained vector");
+
813  return theta;
+
814  }
+
815 
+
826  inline
+
827  Eigen::Matrix<T,Eigen::Dynamic,1> simplex_constrain(size_t k) {
+ +
829  }
+
830 
+
843  inline vector_t simplex_constrain(size_t k, T& lp) {
+
844  return stan::prob::simplex_constrain(vector(k-1),lp);
+
845  }
+
846 
+
857  inline vector_t ordered(size_t k) {
+
858  vector_t x(vector(k));
+
859  stan::math::check_ordered("stan::io::ordered(%1%)", x, "Constrained vector");
+
860  return x;
+
861  }
+
862 
+
872  inline vector_t ordered_constrain(size_t k) {
+ +
874  }
+
875 
+
887  inline vector_t ordered_constrain(size_t k, T& lp) {
+ +
889  }
+
890 
+
901  inline vector_t positive_ordered(size_t k) {
+
902  vector_t x(vector(k));
+
903  stan::math::check_positive_ordered("stan::io::positive_ordered(%1%)", x, "Constrained vector");
+
904  return x;
+
905  }
+
906 
+ + +
918  }
+
919 
+
931  inline vector_t positive_ordered_constrain(size_t k, T& lp) {
+ +
933  }
+
934 
+
945  inline matrix_t cholesky_factor(size_t M, size_t N) {
+
946  matrix_t y(matrix(M,N));
+
947  stan::math::check_cholesky_factor("stan::io::cholesky_factor(%1%)", y, "Constrained matrix");
+
948  return y;
+
949  }
+
950 
+
962  inline matrix_t cholesky_factor_constrain(size_t M, size_t N) {
+
963  return stan::prob::cholesky_factor_constrain(vector((N * (N + 1)) / 2 + (M - N) * N),
+
964  M,N);
+
965  }
+
966 
+
980  inline matrix_t cholesky_factor_constrain(size_t M, size_t N, T& lp) {
+
981  return stan::prob::cholesky_factor_constrain(vector((N * (N + 1)) / 2 + (M - N) * N),
+
982  M,N,lp);
+
983  }
+
984 
+
996  inline matrix_t cov_matrix(size_t k) {
+
997  matrix_t y(matrix(k,k));
+
998  stan::math::check_cov_matrix("stan::io::cov_matrix(%1%)", y, "Constrained matrix");
+
999  return y;
+
1000  }
+
1001 
+
1010  inline matrix_t cov_matrix_constrain(size_t k) {
+
1011  return stan::prob::cov_matrix_constrain(vector(k + (k * (k - 1)) / 2),
+
1012  k);
+
1013  }
+
1014 
+
1026  inline matrix_t cov_matrix_constrain(size_t k, T& lp) {
+
1027  return stan::prob::cov_matrix_constrain(vector(k + (k * (k - 1)) / 2),
+
1028  k,lp);
+
1029  }
+
1030 
+
1031 
+
1041  inline matrix_t corr_matrix(size_t k) {
+
1042  matrix_t x(matrix(k,k));
+
1043  stan::math::check_corr_matrix("stan::math::corr_matrix(%1%)", x, "Constrained matrix");
+
1044  return x;
+
1045  }
+
1046 
+
1055  inline matrix_t corr_matrix_constrain(size_t k) {
+
1056  return stan::prob::corr_matrix_constrain(vector((k * (k - 1)) / 2),k);
+
1057  }
+
1058 
+
1070  inline matrix_t corr_matrix_constrain(size_t k, T& lp) {
+
1071  return stan::prob::corr_matrix_constrain(vector((k * (k - 1)) / 2),
+
1072  k,lp);
+
1073  }
+
1074 
+
1075  template <typename TL>
+
1076  inline vector_t vector_lb(const TL lb, size_t m) {
+
1077  vector_t v(m);
+
1078  for (size_t i = 0; i < m; ++i)
+
1079  v(i) = scalar_lb(lb);
+
1080  return v;
+
1081  }
+
1082  template <typename TL>
+
1083  inline vector_t vector_lb_constrain(const TL lb, size_t m) {
+
1084  vector_t v(m);
+
1085  for (size_t i = 0; i < m; ++i)
+
1086  v(i) = scalar_lb_constrain(lb);
+
1087  return v;
+
1088  }
+
1089  template <typename TL>
+
1090  inline vector_t vector_lb_constrain(const TL lb, size_t m, T& lp) {
+
1091  vector_t v(m);
+
1092  for (size_t i = 0; i < m; ++i)
+
1093  v(i) = scalar_lb_constrain(lb,lp);
+
1094  return v;
+
1095  }
+
1096 
+
1097  template <typename TL>
+
1098  inline row_vector_t row_vector_lb(const TL lb, size_t m) {
+
1099  row_vector_t v(m);
+
1100  for (size_t i = 0; i < m; ++i)
+
1101  v(i) = scalar_lb(lb);
+
1102  return v;
+
1103  }
+
1104  template <typename TL>
+
1105  inline row_vector_t row_vector_lb_constrain(const TL lb, size_t m) {
+
1106  row_vector_t v(m);
+
1107  for (size_t i = 0; i < m; ++i)
+
1108  v(i) = scalar_lb_constrain(lb);
+
1109  return v;
+
1110  }
+
1111  template <typename TL>
+
1112  inline row_vector_t row_vector_lb_constrain(const TL lb, size_t m, T& lp) {
+
1113  row_vector_t v(m);
+
1114  for (size_t i = 0; i < m; ++i)
+
1115  v(i) = scalar_lb_constrain(lb,lp);
+
1116  return v;
+
1117  }
+
1118 
+
1119  template <typename TL>
+
1120  inline matrix_t matrix_lb(const TL lb, size_t m, size_t n) {
+
1121  matrix_t v(m,n);
+
1122  for (size_t j = 0; j < n; ++j)
+
1123  for (size_t i = 0; i < m; ++i)
+
1124  v(i,j) = scalar_lb(lb);
+
1125  return v;
+
1126  }
+
1127  template <typename TL>
+
1128  inline matrix_t matrix_lb_constrain(const TL lb, size_t m, size_t n) {
+
1129  matrix_t v(m,n);
+
1130  for (size_t j = 0; j < n; ++j)
+
1131  for (size_t i = 0; i < m; ++i)
+
1132  v(i,j) = scalar_lb_constrain(lb);
+
1133  return v;
+
1134  }
+
1135  template <typename TL>
+
1136  inline matrix_t matrix_lb_constrain(const TL lb, size_t m, size_t n, T& lp) {
+
1137  matrix_t v(m,n);
+
1138  for (size_t j = 0; j < n; ++j)
+
1139  for (size_t i = 0; i < m; ++i)
+
1140  v(i,j) = scalar_lb_constrain(lb,lp);
+
1141  return v;
+
1142  }
+
1143 
+
1144  template <typename TU>
+
1145  inline vector_t vector_ub(const TU ub, size_t m) {
+
1146  vector_t v(m);
+
1147  for (size_t i = 0; i < m; ++i)
+
1148  v(i) = scalar_ub(ub);
+
1149  return v;
+
1150  }
+
1151  template <typename TU>
+
1152  inline vector_t vector_ub_constrain(const TU ub, size_t m) {
+
1153  vector_t v(m);
+
1154  for (size_t i = 0; i < m; ++i)
+
1155  v(i) = scalar_ub_constrain(ub);
+
1156  return v;
+
1157  }
+
1158  template <typename TU>
+
1159  inline vector_t vector_ub_constrain(const TU ub, size_t m, T& lp) {
+
1160  vector_t v(m);
+
1161  for (size_t i = 0; i < m; ++i)
+
1162  v(i) = scalar_ub_constrain(ub,lp);
+
1163  return v;
+
1164  }
+
1165 
+
1166  template <typename TU>
+
1167  inline row_vector_t row_vector_ub(const TU ub, size_t m) {
+
1168  row_vector_t v(m);
+
1169  for (size_t i = 0; i < m; ++i)
+
1170  v(i) = scalar_ub(ub);
+
1171  return v;
+
1172  }
+
1173  template <typename TU>
+
1174  inline row_vector_t row_vector_ub_constrain(const TU ub, size_t m) {
+
1175  row_vector_t v(m);
+
1176  for (size_t i = 0; i < m; ++i)
+
1177  v(i) = scalar_ub_constrain(ub);
+
1178  return v;
+
1179  }
+
1180  template <typename TU>
+
1181  inline row_vector_t row_vector_ub_constrain(const TU ub, size_t m, T& lp) {
+
1182  row_vector_t v(m);
+
1183  for (size_t i = 0; i < m; ++i)
+
1184  v(i) = scalar_ub_constrain(ub,lp);
+
1185  return v;
+
1186  }
+
1187 
+
1188  template <typename TU>
+
1189  inline matrix_t matrix_ub(const TU ub, size_t m, size_t n) {
+
1190  matrix_t v(m,n);
+
1191  for (size_t j = 0; j < n; ++j)
+
1192  for (size_t i = 0; i < m; ++i)
+
1193  v(i,j) = scalar_ub(ub);
+
1194  return v;
+
1195  }
+
1196  template <typename TU>
+
1197  inline matrix_t matrix_ub_constrain(const TU ub, size_t m, size_t n) {
+
1198  matrix_t v(m,n);
+
1199  for (size_t j = 0; j < n; ++j)
+
1200  for (size_t i = 0; i < m; ++i)
+
1201  v(i,j) = scalar_ub_constrain(ub);
+
1202  return v;
+
1203  }
+
1204  template <typename TU>
+
1205  inline matrix_t matrix_ub_constrain(const TU ub, size_t m, size_t n, T& lp) {
+
1206  matrix_t v(m,n);
+
1207  for (size_t j = 0; j < n; ++j)
+
1208  for (size_t i = 0; i < m; ++i)
+
1209  v(i,j) = scalar_ub_constrain(ub,lp);
+
1210  return v;
+
1211  }
+
1212 
+
1213 
+
1214  template <typename TL, typename TU>
+
1215  inline vector_t vector_lub(const TL lb, const TU ub, size_t m) {
+
1216  vector_t v(m);
+
1217  for (size_t i = 0; i < m; ++i)
+
1218  v(i) = scalar_lub(lb,ub);
+
1219  return v;
+
1220  }
+
1221  template <typename TL, typename TU>
+
1222  inline vector_t vector_lub_constrain(const TL lb, const TU ub, size_t m) {
+
1223  vector_t v(m);
+
1224  for (size_t i = 0; i < m; ++i)
+
1225  v(i) = scalar_lub_constrain(lb,ub);
+
1226  return v;
+
1227  }
+
1228  template <typename TL, typename TU>
+
1229  inline vector_t vector_lub_constrain(const TL lb, const TU ub, size_t m, T& lp) {
+
1230  vector_t v(m);
+
1231  for (size_t i = 0; i < m; ++i)
+
1232  v(i) = scalar_lub_constrain(lb,ub,lp);
+
1233  return v;
+
1234  }
+
1235 
+
1236  template <typename TL, typename TU>
+
1237  inline row_vector_t row_vector_lub(const TL lb, const TU ub, size_t m) {
+
1238  row_vector_t v(m);
+
1239  for (size_t i = 0; i < m; ++i)
+
1240  v(i) = scalar_lub(lb,ub);
+
1241  return v;
+
1242  }
+
1243  template <typename TL, typename TU>
+
1244  inline row_vector_t row_vector_lub_constrain(const TL lb, const TU ub, size_t m) {
+
1245  row_vector_t v(m);
+
1246  for (size_t i = 0; i < m; ++i)
+
1247  v(i) = scalar_lub_constrain(lb,ub);
+
1248  return v;
+
1249  }
+
1250  template <typename TL, typename TU>
+
1251  inline row_vector_t row_vector_lub_constrain(const TL lb, const TU ub, size_t m, T& lp) {
+
1252  row_vector_t v(m);
+
1253  for (size_t i = 0; i < m; ++i)
+
1254  v(i) = scalar_lub_constrain(lb,ub,lp);
+
1255  return v;
+
1256  }
+
1257 
+
1258  template <typename TL, typename TU>
+
1259  inline matrix_t matrix_lub(const TL lb, const TU ub, size_t m, size_t n) {
+
1260  matrix_t v(m,n);
+
1261  for (size_t j = 0; j < n; ++j)
+
1262  for (size_t i = 0; i < m; ++i)
+
1263  v(i,j) = scalar_lub(lb,ub);
+
1264  return v;
+
1265  }
+
1266  template <typename TL, typename TU>
+
1267  inline matrix_t matrix_lub_constrain(const TL lb, const TU ub, size_t m, size_t n) {
+
1268  matrix_t v(m,n);
+
1269  for (size_t j = 0; j < n; ++j)
+
1270  for (size_t i = 0; i < m; ++i)
+
1271  v(i,j) = scalar_lub_constrain(lb,ub);
+
1272  return v;
+
1273  }
+
1274  template <typename TL, typename TU>
+
1275  inline matrix_t matrix_lub_constrain(const TL lb, const TU ub, size_t m, size_t n, T& lp) {
+
1276  matrix_t v(m,n);
+
1277  for (size_t j = 0; j < n; ++j)
+
1278  for (size_t i = 0; i < m; ++i)
+
1279  v(i,j) = scalar_lub_constrain(lb,ub,lp);
+
1280  return v;
+
1281  }
+
1282 
+
1283 
+
1284 
+
1285  };
+
1286 
+
1287  }
+
1288 
+
1289 }
+
1290 
+
1291 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rep__array_8hpp.html b/doc/api/html/rep__array_8hpp.html new file mode 100644 index 00000000000..bb30fc2644f --- /dev/null +++ b/doc/api/html/rep__array_8hpp.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/math/rep_array.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
rep_array.hpp File Reference
+
+
+
#include <vector>
+#include <stan/math/validate_non_negative_rep.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + + +

+Functions

template<typename T >
std::vector< T > stan::math::rep_array (const T &x, int n)
 
template<typename T >
std::vector< std::vector< T > > stan::math::rep_array (const T &x, int m, int n)
 
template<typename T >
std::vector< std::vector
+< std::vector< T > > > 
stan::math::rep_array (const T &x, int k, int m, int n)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rep__array_8hpp_source.html b/doc/api/html/rep__array_8hpp_source.html new file mode 100644 index 00000000000..9f0ee0119f0 --- /dev/null +++ b/doc/api/html/rep__array_8hpp_source.html @@ -0,0 +1,150 @@ + + + + + +Stan: src/stan/math/rep_array.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
rep_array.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__REP_ARRAY_HPP__
+
2 #define __STAN__MATH__REP_ARRAY_HPP__
+
3 
+
4 #include <vector>
+
5 
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace math {
+
11 
+
12  template <typename T>
+
13  inline std::vector<T>
+
14  rep_array(const T& x, int n) {
+
15  validate_non_negative_rep(n,"rep_array 1D");
+
16  return std::vector<T>(n,x);
+
17  }
+
18 
+
19  template <typename T>
+
20  inline std::vector<std::vector<T> >
+
21  rep_array(const T& x, int m, int n) {
+
22  using std::vector;
+
23  validate_non_negative_rep(m,"rep_array 2D rows");
+
24  validate_non_negative_rep(n,"rep_array 2D cols");
+
25  return vector<vector<T> >(m, vector<T>(n, x));
+
26  }
+
27 
+
28  template <typename T>
+
29  inline std::vector<std::vector<std::vector<T> > >
+
30  rep_array(const T& x, int k, int m, int n) {
+
31  using std::vector;
+
32  validate_non_negative_rep(k,"rep_array 2D shelfs");
+
33  validate_non_negative_rep(m,"rep_array 2D rows");
+
34  validate_non_negative_rep(n,"rep_array 2D cols");
+
35  return vector<vector<vector<T> > >(k,
+
36  vector<vector<T> >(m,
+
37  vector<T>(n, x)));
+
38  }
+
39 
+
40  }
+
41 }
+
42 
+
43 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rep__matrix_8hpp.html b/doc/api/html/rep__matrix_8hpp.html new file mode 100644 index 00000000000..5b042f8d930 --- /dev/null +++ b/doc/api/html/rep__matrix_8hpp.html @@ -0,0 +1,142 @@ + + + + + +Stan: src/stan/math/rep_matrix.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
rep_matrix.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+#include <stan/math/validate_non_negative_rep.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + + +

+Functions

template<typename T >
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T >::type, Eigen::Dynamic,
+Eigen::Dynamic > 
stan::math::rep_matrix (const T &x, int m, int n)
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
stan::math::rep_matrix (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v, int n)
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
stan::math::rep_matrix (const Eigen::Matrix< T, 1, Eigen::Dynamic > &rv, int m)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rep__matrix_8hpp_source.html b/doc/api/html/rep__matrix_8hpp_source.html new file mode 100644 index 00000000000..e221a7fb2c5 --- /dev/null +++ b/doc/api/html/rep__matrix_8hpp_source.html @@ -0,0 +1,150 @@ + + + + + +Stan: src/stan/math/rep_matrix.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
rep_matrix.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__REP_MATRIX_HPP__
+
2 #define __STAN__MATH__REP_MATRIX_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+ + +
7 
+
8 namespace stan {
+
9 
+
10  namespace math {
+
11 
+
12  template <typename T>
+
13  inline
+
14  Eigen::Matrix<typename boost::math::tools::promote_args<T>::type,
+
15  Eigen::Dynamic,Eigen::Dynamic>
+
16  rep_matrix(const T& x, int m, int n) {
+
17  validate_non_negative_rep(m,"rep_matrix rows");
+
18  validate_non_negative_rep(n,"rep_matrix cols");
+
19  return Eigen::Matrix<typename boost::math::tools::promote_args<T>::type,
+
20  Eigen::Dynamic,Eigen::Dynamic>::Constant(m,n,x);
+
21  }
+
22 
+
23  template <typename T>
+
24  inline Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>
+
25  rep_matrix(const Eigen::Matrix<T,Eigen::Dynamic,1>& v, int n) {
+
26  validate_non_negative_rep(n,"rep_matrix of vector, num rows");
+
27  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> result(v.size(),n);
+
28  result.colwise() = v;
+
29  return result;
+
30  }
+
31 
+
32  template <typename T>
+
33  inline Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>
+
34  rep_matrix(const Eigen::Matrix<T,1,Eigen::Dynamic>& rv, int m) {
+
35  validate_non_negative_rep(m,"rep_matrix of row vector, num cols");
+
36  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> result(m,rv.size());
+
37  result.rowwise() = rv;
+
38  return result;
+
39  }
+
40  }
+
41 }
+
42 
+
43 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rep__row__vector_8hpp.html b/doc/api/html/rep__row__vector_8hpp.html new file mode 100644 index 00000000000..691a2a1955b --- /dev/null +++ b/doc/api/html/rep__row__vector_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/rep_row_vector.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
rep_row_vector.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+#include <stan/math/validate_non_negative_rep.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T >
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T >::type, 1, Eigen::Dynamic > 
stan::math::rep_row_vector (const T &x, int m)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rep__row__vector_8hpp_source.html b/doc/api/html/rep__row__vector_8hpp_source.html new file mode 100644 index 00000000000..e126bad4f95 --- /dev/null +++ b/doc/api/html/rep__row__vector_8hpp_source.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/math/rep_row_vector.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
rep_row_vector.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__REP_ROW_VECTOR_HPP__
+
2 #define __STAN__MATH__REP_ROW_VECTOR_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+ + +
7 
+
8 namespace stan {
+
9 
+
10  namespace math {
+
11 
+
12  template <typename T>
+
13  inline Eigen::Matrix<typename boost::math::tools::promote_args<T>::type,
+
14  1,Eigen::Dynamic>
+
15  rep_row_vector(const T& x, int m) {
+
16  validate_non_negative_rep(m,"rep_row_vector");
+
17  return Eigen::Matrix<typename boost::math::tools::promote_args<T>::type,
+
18  1,Eigen::Dynamic>::Constant(m,x);
+
19  }
+
20 
+
21  }
+
22 }
+
23 
+
24 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rep__vector_8hpp.html b/doc/api/html/rep__vector_8hpp.html new file mode 100644 index 00000000000..86a1dcc57a7 --- /dev/null +++ b/doc/api/html/rep__vector_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/rep_vector.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
rep_vector.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+#include <stan/math/validate_non_negative_rep.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T >
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T >::type, Eigen::Dynamic, 1 > 
stan::math::rep_vector (const T &x, int n)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rep__vector_8hpp_source.html b/doc/api/html/rep__vector_8hpp_source.html new file mode 100644 index 00000000000..04b158a960f --- /dev/null +++ b/doc/api/html/rep__vector_8hpp_source.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/rep_vector.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
rep_vector.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__REP_VECTOR_HPP__
+
2 #define __STAN__MATH__REP_VECTOR_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+ + +
7 
+
8 namespace stan {
+
9 
+
10  namespace math {
+
11 
+
12  template <typename T>
+
13  inline
+
14  Eigen::Matrix<typename boost::math::tools::promote_args<T>::type,
+
15  Eigen::Dynamic,1>
+
16  rep_vector(const T& x, int n) {
+
17  validate_non_negative_rep(n,"rep_vector");
+
18  return Eigen::Matrix<typename boost::math::tools::promote_args<T>::type,
+
19  Eigen::Dynamic,1>::Constant(n,x);
+
20  }
+
21 
+
22 
+
23  }
+
24 }
+
25 
+
26 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/resize_8hpp.html b/doc/api/html/resize_8hpp.html new file mode 100644 index 00000000000..d9583f45696 --- /dev/null +++ b/doc/api/html/resize_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/math/matrix/resize.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
resize.hpp File Reference
+
+
+
#include <vector>
+#include <stan/math/matrix/Eigen.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
void stan::math::resize (T &x, std::vector< size_t > dims)
 Recursively resize the specified vector of vectors, which must bottom out at scalar values, Eigen vectors or Eigen matrices.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/resize_8hpp_source.html b/doc/api/html/resize_8hpp_source.html new file mode 100644 index 00000000000..80fad15d05a --- /dev/null +++ b/doc/api/html/resize_8hpp_source.html @@ -0,0 +1,167 @@ + + + + + +Stan: src/stan/math/matrix/resize.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
resize.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__RESIZE_HPP__
+
2 #define __STAN__MATH__MATRIX__RESIZE_HPP__
+
3 
+
4 #include <vector>
+ +
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
10  namespace {
+
11 
+
12  template <typename T>
+
13  void resize(Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& x,
+
14  const std::vector<size_t>& dims,
+
15  size_t pos) {
+
16  x.resize(dims[pos],dims[pos+1]);
+
17  }
+
18 
+
19  template <typename T>
+
20  void resize(Eigen::Matrix<T,Eigen::Dynamic,1>& x,
+
21  const std::vector<size_t>& dims,
+
22  size_t pos) {
+
23  x.resize(dims[pos]);
+
24  }
+
25 
+
26  template <typename T>
+
27  void resize(Eigen::Matrix<T,1,Eigen::Dynamic>& x,
+
28  const std::vector<size_t>& dims,
+
29  size_t pos) {
+
30  x.resize(dims[pos]);
+
31  }
+
32 
+
33 
+
34  void resize(double /*x*/,
+
35  const std::vector<size_t>& /*dims*/,
+
36  size_t /*pos*/) {
+
37  // no-op
+
38  }
+
39 
+
40  template <typename T>
+
41  void resize(std::vector<T>& x,
+
42  const std::vector<size_t>& dims,
+
43  size_t pos) {
+
44  x.resize(dims[pos]);
+
45  ++pos;
+
46  if (pos >= dims.size()) return; // skips lowest loop to scalar
+
47  for (size_t i = 0; i < x.size(); ++i)
+
48  resize(x[i],dims,pos);
+
49  }
+
50 
+
51  }
+
52 
+
62  template <typename T>
+
63  inline void resize(T& x, std::vector<size_t> dims) {
+
64  resize(x,dims,0U);
+
65  }
+
66 
+
67  }
+
68 }
+
69 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2acos_8hpp.html b/doc/api/html/rev_2functions_2acos_8hpp.html new file mode 100644 index 00000000000..caceafa9855 --- /dev/null +++ b/doc/api/html/rev_2functions_2acos_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/functions/acos.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
acos.hpp File Reference
+
+
+
#include <valarray>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::acos (const var &a)
 Return the principal value of the arc cosine of a variable, in radians (cmath).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2acos_8hpp_source.html b/doc/api/html/rev_2functions_2acos_8hpp_source.html new file mode 100644 index 00000000000..af0274fac56 --- /dev/null +++ b/doc/api/html/rev_2functions_2acos_8hpp_source.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/agrad/rev/functions/acos.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
acos.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__ACOS_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__ACOS_HPP__
+
3 
+
4 #include <valarray>
+
5 #include <stan/agrad/rev/var.hpp>
+ +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  namespace {
+
12  class acos_vari : public op_v_vari {
+
13  public:
+
14  acos_vari(vari* avi) :
+
15  op_v_vari(std::acos(avi->val_),avi) {
+
16  }
+
17  void chain() {
+
18  avi_->adj_ -= adj_ / std::sqrt(1.0 - (avi_->val_ * avi_->val_));
+
19  }
+
20  };
+
21  }
+
22 
+
34  inline var acos(const var& a) {
+
35  return var(new acos_vari(a.vi_));
+
36  }
+
37 
+
38  }
+
39 }
+
40 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2acosh_8hpp.html b/doc/api/html/rev_2functions_2acosh_8hpp.html new file mode 100644 index 00000000000..557126699c5 --- /dev/null +++ b/doc/api/html/rev_2functions_2acosh_8hpp.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/agrad/rev/functions/acosh.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
acosh.hpp File Reference
+
+
+
#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+#include <boost/math/special_functions/acosh.hpp>
+#include <boost/math/special_functions/fpclassify.hpp>
+#include <stan/agrad/rev/numeric_limits.hpp>
+#include <stan/agrad/rev/operators/operator_greater_than.hpp>
+#include <stan/agrad/rev/operators/operator_equal.hpp>
+#include <stan/agrad/rev/operators/operator_unary_negative.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::acosh (const stan::agrad::var &a)
 The inverse hyperbolic cosine function for variables (C99).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2acosh_8hpp_source.html b/doc/api/html/rev_2functions_2acosh_8hpp_source.html new file mode 100644 index 00000000000..73f2afe836d --- /dev/null +++ b/doc/api/html/rev_2functions_2acosh_8hpp_source.html @@ -0,0 +1,144 @@ + + + + + +Stan: src/stan/agrad/rev/functions/acosh.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
acosh.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__ACOSH_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__ACOSH_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ +
6 #include <boost/math/special_functions/acosh.hpp>
+
7 #include <boost/math/special_functions/fpclassify.hpp>
+ + + + +
12 
+
13 namespace stan {
+
14  namespace agrad {
+
15 
+
16  namespace {
+
17  class acosh_vari : public op_v_vari {
+
18  public:
+
19  acosh_vari(double val, vari* avi) :
+
20  op_v_vari(val,avi) {
+
21  }
+
22  void chain() {
+
23  avi_->adj_ += adj_ / std::sqrt(avi_->val_ * avi_->val_ - 1.0);
+
24  }
+
25  };
+
26  }
+
27 
+
40  inline var acosh(const stan::agrad::var& a) {
+
41  if (boost::math::isinf(a) && a > 0.0)
+
42  return var(new acosh_vari(a.val(),a.vi_));
+
43  return var(new acosh_vari(boost::math::acosh(a.val()),a.vi_));
+
44  }
+
45 
+
46  }
+
47 }
+
48 
+
49 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2asin_8hpp.html b/doc/api/html/rev_2functions_2asin_8hpp.html new file mode 100644 index 00000000000..c229ee4e403 --- /dev/null +++ b/doc/api/html/rev_2functions_2asin_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/functions/asin.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
asin.hpp File Reference
+
+
+
#include <cmath>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::asin (const var &a)
 Return the principal value of the arc sine, in radians, of the specified variable (cmath).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2asin_8hpp_source.html b/doc/api/html/rev_2functions_2asin_8hpp_source.html new file mode 100644 index 00000000000..047c82858a1 --- /dev/null +++ b/doc/api/html/rev_2functions_2asin_8hpp_source.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/agrad/rev/functions/asin.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
asin.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__ASIN_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__ASIN_HPP__
+
3 
+
4 #include <cmath>
+
5 #include <stan/agrad/rev/var.hpp>
+ +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  namespace {
+
12  class asin_vari : public op_v_vari {
+
13  public:
+
14  asin_vari(vari* avi) :
+
15  op_v_vari(std::asin(avi->val_),avi) {
+
16  }
+
17  void chain() {
+
18  avi_->adj_ += adj_ / std::sqrt(1.0 - (avi_->val_ * avi_->val_));
+
19  }
+
20  };
+
21  }
+
22 
+
34  inline var asin(const var& a) {
+
35  return var(new asin_vari(a.vi_));
+
36  }
+
37 
+
38  }
+
39 }
+
40 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2asinh_8hpp.html b/doc/api/html/rev_2functions_2asinh_8hpp.html new file mode 100644 index 00000000000..e0e5b3deaee --- /dev/null +++ b/doc/api/html/rev_2functions_2asinh_8hpp.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/agrad/rev/functions/asinh.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
asinh.hpp File Reference
+
+
+
#include <valarray>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+#include <boost/math/special_functions/asinh.hpp>
+#include <boost/math/special_functions/fpclassify.hpp>
+#include <stan/agrad/rev/numeric_limits.hpp>
+#include <stan/agrad/rev/operators/operator_equal.hpp>
+#include <stan/agrad/rev/operators/operator_unary_negative.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::asinh (const stan::agrad::var &a)
 The inverse hyperbolic sine function for variables (C99).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2asinh_8hpp_source.html b/doc/api/html/rev_2functions_2asinh_8hpp_source.html new file mode 100644 index 00000000000..56cfb846dff --- /dev/null +++ b/doc/api/html/rev_2functions_2asinh_8hpp_source.html @@ -0,0 +1,143 @@ + + + + + +Stan: src/stan/agrad/rev/functions/asinh.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
asinh.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__ASINH_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__ASINH_HPP__
+
3 
+
4 #include <valarray>
+
5 #include <stan/agrad/rev/var.hpp>
+ +
7 #include <boost/math/special_functions/asinh.hpp>
+
8 #include <boost/math/special_functions/fpclassify.hpp>
+ + + +
12 
+
13 namespace stan {
+
14  namespace agrad {
+
15 
+
16  namespace {
+
17  class asinh_vari : public op_v_vari {
+
18  public:
+
19  asinh_vari(double val, vari* avi) :
+
20  op_v_vari(val,avi) {
+
21  }
+
22  void chain() {
+
23  avi_->adj_ += adj_ / std::sqrt(avi_->val_ * avi_->val_ + 1.0);
+
24  }
+
25  };
+
26  }
+
27 
+
40  inline var asinh(const stan::agrad::var& a) {
+
41  if (boost::math::isinf(a))
+
42  return var(new asinh_vari(a.val(), a.vi_));
+
43  return var(new asinh_vari(boost::math::asinh(a.val()),a.vi_));
+
44  }
+
45 
+
46  }
+
47 }
+
48 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2atan2_8hpp.html b/doc/api/html/rev_2functions_2atan2_8hpp.html new file mode 100644 index 00000000000..e4606dda984 --- /dev/null +++ b/doc/api/html/rev_2functions_2atan2_8hpp.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/agrad/rev/functions/atan2.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
atan2.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

var stan::agrad::atan2 (const var &a, const var &b)
 Return the principal value of the arc tangent, in radians, of the first variable divided by the second (cmath).
 
var stan::agrad::atan2 (const var &a, const double b)
 Return the principal value of the arc tangent, in radians, of the first variable divided by the second scalar (cmath).
 
var stan::agrad::atan2 (const double a, const var &b)
 Return the principal value of the arc tangent, in radians, of the first scalar divided by the second variable (cmath).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2atan2_8hpp_source.html b/doc/api/html/rev_2functions_2atan2_8hpp_source.html new file mode 100644 index 00000000000..b49f199e141 --- /dev/null +++ b/doc/api/html/rev_2functions_2atan2_8hpp_source.html @@ -0,0 +1,170 @@ + + + + + +Stan: src/stan/agrad/rev/functions/atan2.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
atan2.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__ATAN2_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__ATAN2_HPP__
+
3 
+
4 #include <valarray>
+
5 #include <stan/agrad/rev/var.hpp>
+ + + +
9 
+
10 namespace stan {
+
11  namespace agrad {
+
12 
+
13  namespace {
+
14  class atan2_vv_vari : public op_vv_vari {
+
15  public:
+
16  atan2_vv_vari(vari* avi, vari* bvi) :
+
17  op_vv_vari(std::atan2(avi->val_,bvi->val_),avi,bvi) {
+
18  }
+
19  void chain() {
+
20  double a_sq_plus_b_sq = (avi_->val_ * avi_->val_) + (bvi_->val_ * bvi_->val_);
+
21  avi_->adj_ += adj_ * bvi_->val_ / a_sq_plus_b_sq;
+
22  bvi_->adj_ -= adj_ * avi_->val_ / a_sq_plus_b_sq;
+
23  }
+
24  };
+
25 
+
26  class atan2_vd_vari : public op_vd_vari {
+
27  public:
+
28  atan2_vd_vari(vari* avi, double b) :
+
29  op_vd_vari(std::atan2(avi->val_,b),avi,b) {
+
30  }
+
31  void chain() {
+
32  double a_sq_plus_b_sq = (avi_->val_ * avi_->val_) + (bd_ * bd_);
+
33  avi_->adj_ += adj_ * bd_ / a_sq_plus_b_sq;
+
34  }
+
35  };
+
36 
+
37  class atan2_dv_vari : public op_dv_vari {
+
38  public:
+
39  atan2_dv_vari(double a, vari* bvi) :
+
40  op_dv_vari(std::atan2(a,bvi->val_),a,bvi) {
+
41  }
+
42  void chain() {
+
43  double a_sq_plus_b_sq = (ad_ * ad_) + (bvi_->val_ * bvi_->val_);
+
44  bvi_->adj_ -= adj_ * ad_ / a_sq_plus_b_sq;
+
45  }
+
46  };
+
47  }
+
48 
+
63  inline var atan2(const var& a, const var& b) {
+
64  return var(new atan2_vv_vari(a.vi_,b.vi_));
+
65  }
+
66 
+
79  inline var atan2(const var& a, const double b) {
+
80  return var(new atan2_vd_vari(a.vi_,b));
+
81  }
+
82 
+
95  inline var atan2(const double a, const var& b) {
+
96  return var(new atan2_dv_vari(a,b.vi_));
+
97  }
+
98 
+
99  }
+
100 }
+
101 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2atan_8hpp.html b/doc/api/html/rev_2functions_2atan_8hpp.html new file mode 100644 index 00000000000..d80831f3738 --- /dev/null +++ b/doc/api/html/rev_2functions_2atan_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/functions/atan.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
atan.hpp File Reference
+
+
+
#include <valarray>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::atan (const var &a)
 Return the principal value of the arc tangent, in radians, of the specified variable (cmath).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2atan_8hpp_source.html b/doc/api/html/rev_2functions_2atan_8hpp_source.html new file mode 100644 index 00000000000..084e30c7c10 --- /dev/null +++ b/doc/api/html/rev_2functions_2atan_8hpp_source.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/agrad/rev/functions/atan.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
atan.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__ATAN_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__ATAN_HPP__
+
3 
+
4 #include <valarray>
+
5 #include <stan/agrad/rev/var.hpp>
+ +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  namespace {
+
12  class atan_vari : public op_v_vari {
+
13  public:
+
14  atan_vari(vari* avi) :
+
15  op_v_vari(std::atan(avi->val_),avi) {
+
16  }
+
17  void chain() {
+
18  avi_->adj_ += adj_ / (1.0 + (avi_->val_ * avi_->val_));
+
19  }
+
20  };
+
21  }
+
22 
+
34  inline var atan(const var& a) {
+
35  return var(new atan_vari(a.vi_));
+
36  }
+
37 
+
38  }
+
39 }
+
40 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2atanh_8hpp.html b/doc/api/html/rev_2functions_2atanh_8hpp.html new file mode 100644 index 00000000000..53416056b58 --- /dev/null +++ b/doc/api/html/rev_2functions_2atanh_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/rev/functions/atanh.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
atanh.hpp File Reference
+
+
+
#include <boost/math/special_functions/atanh.hpp>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+#include <stan/agrad/rev/operators/operator_equal.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::atanh (const stan::agrad::var &a)
 The inverse hyperbolic tangent function for variables (C99).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2atanh_8hpp_source.html b/doc/api/html/rev_2functions_2atanh_8hpp_source.html new file mode 100644 index 00000000000..7c9699900f5 --- /dev/null +++ b/doc/api/html/rev_2functions_2atanh_8hpp_source.html @@ -0,0 +1,141 @@ + + + + + +Stan: src/stan/agrad/rev/functions/atanh.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
atanh.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__ATANH_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__ATANH_HPP__
+
3 
+
4 #include <boost/math/special_functions/atanh.hpp>
+
5 #include <stan/agrad/rev/var.hpp>
+ + +
8 
+
9 namespace stan {
+
10  namespace agrad {
+
11 
+
12  namespace {
+
13  class atanh_vari : public op_v_vari {
+
14  public:
+
15  atanh_vari(double val, vari* avi) :
+
16  op_v_vari(val,avi) {
+
17  }
+
18  void chain() {
+
19  avi_->adj_ += adj_ / (1.0 - avi_->val_ * avi_->val_);
+
20  }
+
21  };
+
22  }
+
23 
+
36  inline var atanh(const stan::agrad::var& a) {
+
37  if (a == 1.0)
+
38  return var(new atanh_vari(std::numeric_limits<double>::infinity(),a.vi_));
+
39  if (a == -1.0)
+
40  return var(new atanh_vari(-std::numeric_limits<double>::infinity(),a.vi_));
+
41  return var(new atanh_vari(boost::math::atanh(a.val()),a.vi_));
+
42  }
+
43 
+
44  }
+
45 }
+
46 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2cbrt_8hpp.html b/doc/api/html/rev_2functions_2cbrt_8hpp.html new file mode 100644 index 00000000000..a0a1f02bfd3 --- /dev/null +++ b/doc/api/html/rev_2functions_2cbrt_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/functions/cbrt.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
cbrt.hpp File Reference
+
+
+
#include <boost/math/special_functions/cbrt.hpp>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::cbrt (const stan::agrad::var &a)
 Returns the cube root of the specified variable (C99).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2cbrt_8hpp_source.html b/doc/api/html/rev_2functions_2cbrt_8hpp_source.html new file mode 100644 index 00000000000..30cdb9b4c9b --- /dev/null +++ b/doc/api/html/rev_2functions_2cbrt_8hpp_source.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/agrad/rev/functions/cbrt.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
cbrt.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__CBRT_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__CBRT_HPP__
+
3 
+
4 #include <boost/math/special_functions/cbrt.hpp>
+
5 #include <stan/agrad/rev/var.hpp>
+ +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  namespace {
+
12  class cbrt_vari : public op_v_vari {
+
13  public:
+
14  cbrt_vari(vari* avi) :
+
15  op_v_vari(boost::math::cbrt(avi->val_),avi) {
+
16  }
+
17  void chain() {
+
18  avi_->adj_ += adj_ / (3.0 * val_ * val_);
+
19  }
+
20  };
+
21  }
+
22 
+
35  inline var cbrt(const stan::agrad::var& a) {
+
36  return var(new cbrt_vari(a.vi_));
+
37  }
+
38 
+
39  }
+
40 }
+
41 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2ceil_8hpp.html b/doc/api/html/rev_2functions_2ceil_8hpp.html new file mode 100644 index 00000000000..e77c9b9ee6c --- /dev/null +++ b/doc/api/html/rev_2functions_2ceil_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/functions/ceil.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
ceil.hpp File Reference
+
+
+
#include <cmath>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::ceil (const var &a)
 Return the ceiling of the specified variable (cmath).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2ceil_8hpp_source.html b/doc/api/html/rev_2functions_2ceil_8hpp_source.html new file mode 100644 index 00000000000..19907d32300 --- /dev/null +++ b/doc/api/html/rev_2functions_2ceil_8hpp_source.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/agrad/rev/functions/ceil.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
ceil.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__CEIL_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__CEIL_HPP__
+
3 
+
4 #include <cmath>
+
5 #include <stan/agrad/rev/var.hpp>
+ +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  namespace {
+
12  class ceil_vari : public vari {
+
13  public:
+
14  ceil_vari(vari* avi) :
+
15  vari(std::ceil(avi->val_)) {
+
16  }
+
17  };
+
18  }
+
19 
+
38  inline var ceil(const var& a) {
+
39  return var(new ceil_vari(a.vi_));
+
40  }
+
41 
+
42  }
+
43 }
+
44 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2cos_8hpp.html b/doc/api/html/rev_2functions_2cos_8hpp.html new file mode 100644 index 00000000000..26c193af533 --- /dev/null +++ b/doc/api/html/rev_2functions_2cos_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/functions/cos.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
cos.hpp File Reference
+
+
+
#include <cmath>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::cos (const var &a)
 Return the cosine of a radian-scaled variable (cmath).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2cos_8hpp_source.html b/doc/api/html/rev_2functions_2cos_8hpp_source.html new file mode 100644 index 00000000000..d1cd67549c6 --- /dev/null +++ b/doc/api/html/rev_2functions_2cos_8hpp_source.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/agrad/rev/functions/cos.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
cos.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__COS_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__COS_HPP__
+
3 
+
4 #include <cmath>
+
5 #include <stan/agrad/rev/var.hpp>
+ +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  namespace {
+
12  class cos_vari : public op_v_vari {
+
13  public:
+
14  cos_vari(vari* avi) :
+
15  op_v_vari(std::cos(avi->val_),avi) {
+
16  }
+
17  void chain() {
+
18  avi_->adj_ -= adj_ * std::sin(avi_->val_);
+
19  }
+
20  };
+
21  }
+
22 
+
33  inline var cos(const var& a) {
+
34  return var(new cos_vari(a.vi_));
+
35  }
+
36 
+
37  }
+
38 }
+
39 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2cosh_8hpp.html b/doc/api/html/rev_2functions_2cosh_8hpp.html new file mode 100644 index 00000000000..9047aa8a7f7 --- /dev/null +++ b/doc/api/html/rev_2functions_2cosh_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/functions/cosh.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
cosh.hpp File Reference
+
+
+
#include <valarray>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::cosh (const var &a)
 Return the hyperbolic cosine of the specified variable (cmath).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2cosh_8hpp_source.html b/doc/api/html/rev_2functions_2cosh_8hpp_source.html new file mode 100644 index 00000000000..5dea6a50db3 --- /dev/null +++ b/doc/api/html/rev_2functions_2cosh_8hpp_source.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/agrad/rev/functions/cosh.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
cosh.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__COSH_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__COSH_HPP__
+
3 
+
4 #include <valarray>
+
5 #include <stan/agrad/rev/var.hpp>
+ +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  namespace {
+
12  class cosh_vari : public op_v_vari {
+
13  public:
+
14  cosh_vari(vari* avi) :
+
15  op_v_vari(std::cosh(avi->val_),avi) {
+
16  }
+
17  void chain() {
+
18  avi_->adj_ += adj_ * std::sinh(avi_->val_);
+
19  }
+
20  };
+
21  }
+
22 
+
33  inline var cosh(const var& a) {
+
34  return var(new cosh_vari(a.vi_));
+
35  }
+
36 
+
37  }
+
38 }
+
39 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2erf_8hpp.html b/doc/api/html/rev_2functions_2erf_8hpp.html new file mode 100644 index 00000000000..bbb0c68352f --- /dev/null +++ b/doc/api/html/rev_2functions_2erf_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/agrad/rev/functions/erf.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
erf.hpp File Reference
+
+
+
#include <valarray>
+#include <boost/math/special_functions/erf.hpp>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+#include <stan/math/constants.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::erf (const stan::agrad::var &a)
 The error function for variables (C99).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2erf_8hpp_source.html b/doc/api/html/rev_2functions_2erf_8hpp_source.html new file mode 100644 index 00000000000..d3c36ac720f --- /dev/null +++ b/doc/api/html/rev_2functions_2erf_8hpp_source.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/agrad/rev/functions/erf.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
erf.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__ERF_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__ERF_HPP__
+
3 
+
4 #include <valarray>
+
5 #include <boost/math/special_functions/erf.hpp>
+
6 #include <stan/agrad/rev/var.hpp>
+ + +
9 
+
10 namespace stan {
+
11  namespace agrad {
+
12 
+
13  namespace {
+
14  class erf_vari : public op_v_vari {
+
15  public:
+
16  erf_vari(vari* avi) :
+
17  op_v_vari(boost::math::erf(avi->val_),avi) {
+
18  }
+
19  void chain() {
+
20  avi_->adj_ += adj_ * stan::math::TWO_OVER_SQRT_PI * std::exp(- avi_->val_ * avi_->val_);
+
21  }
+
22  };
+
23  }
+
24 
+
37  inline var erf(const stan::agrad::var& a) {
+
38  return var(new erf_vari(a.vi_));
+
39  }
+
40 
+
41  }
+
42 }
+
43 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2erfc_8hpp.html b/doc/api/html/rev_2functions_2erfc_8hpp.html new file mode 100644 index 00000000000..e9a79c952ab --- /dev/null +++ b/doc/api/html/rev_2functions_2erfc_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/agrad/rev/functions/erfc.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
erfc.hpp File Reference
+
+
+
#include <valarray>
+#include <boost/math/special_functions/erf.hpp>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+#include <stan/math/constants.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::erfc (const stan::agrad::var &a)
 The complementary error function for variables (C99).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2erfc_8hpp_source.html b/doc/api/html/rev_2functions_2erfc_8hpp_source.html new file mode 100644 index 00000000000..ae79bafa9d4 --- /dev/null +++ b/doc/api/html/rev_2functions_2erfc_8hpp_source.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/agrad/rev/functions/erfc.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
erfc.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__ERFC_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__ERFC_HPP__
+
3 
+
4 #include <valarray>
+
5 #include <boost/math/special_functions/erf.hpp>
+
6 #include <stan/agrad/rev/var.hpp>
+ + +
9 
+
10 namespace stan {
+
11  namespace agrad {
+
12 
+
13  namespace {
+
14  class erfc_vari : public op_v_vari {
+
15  public:
+
16  erfc_vari(vari* avi) :
+
17  op_v_vari(boost::math::erfc(avi->val_),avi) {
+
18  }
+
19  void chain() {
+
20  avi_->adj_ += adj_ * stan::math::NEG_TWO_OVER_SQRT_PI * std::exp(- avi_->val_ * avi_->val_);
+
21  }
+
22  };
+
23  }
+
24 
+
37  inline var erfc(const stan::agrad::var& a) {
+
38  return var(new erfc_vari(a.vi_));
+
39  }
+
40 
+
41  }
+
42 }
+
43 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2expm1_8hpp.html b/doc/api/html/rev_2functions_2expm1_8hpp.html new file mode 100644 index 00000000000..64b8079e9ee --- /dev/null +++ b/doc/api/html/rev_2functions_2expm1_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/rev/functions/expm1.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
expm1.hpp File Reference
+
+
+
#include <valarray>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+#include <stan/math/constants.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::expm1 (const stan::agrad::var &a)
 The exponentiation of the specified variable minus 1 (C99).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2expm1_8hpp_source.html b/doc/api/html/rev_2functions_2expm1_8hpp_source.html new file mode 100644 index 00000000000..106434a6566 --- /dev/null +++ b/doc/api/html/rev_2functions_2expm1_8hpp_source.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/agrad/rev/functions/expm1.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
expm1.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__EXPM1_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__EXPM1_HPP__
+
3 
+
4 #include <valarray>
+
5 #include <stan/agrad/rev/var.hpp>
+ + +
8 
+
9 namespace stan {
+
10  namespace agrad {
+
11 
+
12  namespace {
+
13  class expm1_vari : public op_v_vari {
+
14  public:
+
15  expm1_vari(vari* avi) :
+
16  op_v_vari(std::exp(avi->val_) - 1.0,avi) {
+
17  }
+
18  void chain() {
+
19  avi_->adj_ += adj_ * (val_ + 1.0);
+
20  }
+
21  };
+
22  }
+
23 
+
36  inline var expm1(const stan::agrad::var& a) {
+
37  return var(new expm1_vari(a.vi_));
+
38  }
+
39 
+
40  }
+
41 }
+
42 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2fabs_8hpp.html b/doc/api/html/rev_2functions_2fabs_8hpp.html new file mode 100644 index 00000000000..b8c03ad30e8 --- /dev/null +++ b/doc/api/html/rev_2functions_2fabs_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/agrad/rev/functions/fabs.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
fabs.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::fabs (const var &a)
 Return the absolute value of the variable (cmath).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2fabs_8hpp_source.html b/doc/api/html/rev_2functions_2fabs_8hpp_source.html new file mode 100644 index 00000000000..4983715590f --- /dev/null +++ b/doc/api/html/rev_2functions_2fabs_8hpp_source.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/agrad/rev/functions/fabs.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
fabs.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__FABS_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__FABS_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ + + + +
9 
+
10 
+
11 namespace stan {
+
12  namespace agrad {
+
13 
+
34  inline var fabs(const var& a) {
+ +
36  // cut-and-paste from abs()
+
37  if (a.val() > 0.0)
+
38  return a;
+
39  else if (a.val() < 0.0)
+
40  return var(new neg_vari(a.vi_));
+
41  else if (a.val() == 0)
+
42  return var(new vari(0));
+
43  else
+
44  return var(new precomp_v_vari(NOT_A_NUMBER,a.vi_,NOT_A_NUMBER));
+
45  }
+
46 
+
47  }
+
48 }
+
49 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2floor_8hpp.html b/doc/api/html/rev_2functions_2floor_8hpp.html new file mode 100644 index 00000000000..ed1bacce84b --- /dev/null +++ b/doc/api/html/rev_2functions_2floor_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/functions/floor.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
floor.hpp File Reference
+
+
+
#include <cmath>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::floor (const var &a)
 Return the floor of the specified variable (cmath).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2floor_8hpp_source.html b/doc/api/html/rev_2functions_2floor_8hpp_source.html new file mode 100644 index 00000000000..750a2de7c4d --- /dev/null +++ b/doc/api/html/rev_2functions_2floor_8hpp_source.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/agrad/rev/functions/floor.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
floor.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__FLOOR_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__FLOOR_HPP__
+
3 
+
4 #include <cmath>
+
5 #include <stan/agrad/rev/var.hpp>
+ +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  namespace {
+
12  class floor_vari : public vari {
+
13  public:
+
14  floor_vari(vari* avi) :
+
15  vari(std::floor(avi->val_)) {
+
16  }
+
17  };
+
18  }
+
19 
+
38  inline var floor(const var& a) {
+
39  return var(new floor_vari(a.vi_));
+
40  }
+
41 
+
42  }
+
43 }
+
44 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2fmax_8hpp.html b/doc/api/html/rev_2functions_2fmax_8hpp.html new file mode 100644 index 00000000000..16a9bfed5f1 --- /dev/null +++ b/doc/api/html/rev_2functions_2fmax_8hpp.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/agrad/rev/functions/fmax.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
fmax.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

var stan::agrad::fmax (const stan::agrad::var &a, const stan::agrad::var &b)
 Returns the maximum of the two variable arguments (C99).
 
var stan::agrad::fmax (const stan::agrad::var &a, const double &b)
 Returns the maximum of the variable and scalar, promoting the scalar to a variable if it is larger (C99).
 
var stan::agrad::fmax (const double &a, const stan::agrad::var &b)
 Returns the maximum of a scalar and variable, promoting the scalar to a variable if it is larger (C99).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2fmax_8hpp_source.html b/doc/api/html/rev_2functions_2fmax_8hpp_source.html new file mode 100644 index 00000000000..11bfe3f0137 --- /dev/null +++ b/doc/api/html/rev_2functions_2fmax_8hpp_source.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/agrad/rev/functions/fmax.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
fmax.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__FMAX_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__FMAX_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+
5 
+
6 namespace stan {
+
7  namespace agrad {
+
8 
+
26  inline var fmax(const stan::agrad::var& a,
+
27  const stan::agrad::var& b) {
+
28  return a.vi_->val_ > b.vi_->val_ ? a : b;
+
29  }
+
30 
+
47  inline var fmax(const stan::agrad::var& a,
+
48  const double& b) {
+
49  return a.vi_->val_ >= b ? a : var(b);
+
50  }
+
51 
+
68  inline var fmax(const double& a,
+
69  const stan::agrad::var& b) {
+
70  return a > b.vi_->val_ ? var(a) : b;
+
71  }
+
72 
+
73  }
+
74 }
+
75 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2fmin_8hpp.html b/doc/api/html/rev_2functions_2fmin_8hpp.html new file mode 100644 index 00000000000..7fb8e575a88 --- /dev/null +++ b/doc/api/html/rev_2functions_2fmin_8hpp.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/agrad/rev/functions/fmin.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
fmin.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

var stan::agrad::fmin (const stan::agrad::var &a, const stan::agrad::var &b)
 Returns the minimum of the two variable arguments (C99).
 
var stan::agrad::fmin (const stan::agrad::var &a, const double &b)
 Returns the minimum of the variable and scalar, promoting the scalar to a variable if it is larger (C99).
 
var stan::agrad::fmin (const double &a, const stan::agrad::var &b)
 Returns the minimum of a scalar and variable, promoting the scalar to a variable if it is larger (C99).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2fmin_8hpp_source.html b/doc/api/html/rev_2functions_2fmin_8hpp_source.html new file mode 100644 index 00000000000..7ef0902584e --- /dev/null +++ b/doc/api/html/rev_2functions_2fmin_8hpp_source.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/agrad/rev/functions/fmin.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
fmin.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__FMIN_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__FMIN_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+
5 
+
6 namespace stan {
+
7  namespace agrad {
+
8 
+
22  inline var fmin(const stan::agrad::var& a,
+
23  const stan::agrad::var& b) {
+
24  return a.vi_->val_ < b.vi_->val_ ? a : b;
+
25  }
+
26 
+
41  inline var fmin(const stan::agrad::var& a,
+
42  const double& b) {
+
43  return a.vi_->val_ <= b ? a : var(b);
+
44  }
+
45 
+
62  inline var fmin(const double& a,
+
63  const stan::agrad::var& b) {
+
64  return a < b.vi_->val_ ? var(a) : b;
+
65  }
+
66 
+
67  }
+
68 }
+
69 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2fmod_8hpp.html b/doc/api/html/rev_2functions_2fmod_8hpp.html new file mode 100644 index 00000000000..5f503b1fc73 --- /dev/null +++ b/doc/api/html/rev_2functions_2fmod_8hpp.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/agrad/rev/functions/fmod.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
fmod.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

var stan::agrad::fmod (const var &a, const var &b)
 Return the floating point remainder after dividing the first variable by the second (cmath).
 
var stan::agrad::fmod (const var &a, const double b)
 Return the floating point remainder after dividing the the first variable by the second scalar (cmath).
 
var stan::agrad::fmod (const double a, const var &b)
 Return the floating point remainder after dividing the first scalar by the second variable (cmath).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2fmod_8hpp_source.html b/doc/api/html/rev_2functions_2fmod_8hpp_source.html new file mode 100644 index 00000000000..5d9a0ae82b4 --- /dev/null +++ b/doc/api/html/rev_2functions_2fmod_8hpp_source.html @@ -0,0 +1,168 @@ + + + + + +Stan: src/stan/agrad/rev/functions/fmod.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
fmod.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__FMOD_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__FMOD_HPP__
+
3 
+
4 #include <cmath>
+
5 #include <stan/agrad/rev/var.hpp>
+ + + +
9 
+
10 namespace stan {
+
11  namespace agrad {
+
12 
+
13  namespace {
+
14  class fmod_vv_vari : public op_vv_vari {
+
15  public:
+
16  fmod_vv_vari(vari* avi, vari* bvi) :
+
17  op_vv_vari(std::fmod(avi->val_,bvi->val_),avi,bvi) {
+
18  }
+
19  void chain() {
+
20  avi_->adj_ += adj_;
+
21  bvi_->adj_ -= adj_ * static_cast<int>(avi_->val_ / bvi_->val_);
+
22  }
+
23  };
+
24 
+
25  class fmod_vd_vari : public op_v_vari {
+
26  public:
+
27  fmod_vd_vari(vari* avi, double b) :
+
28  op_v_vari(std::fmod(avi->val_,b),avi) {
+
29  }
+
30  void chain() {
+
31  avi_->adj_ += adj_;
+
32  }
+
33  };
+
34 
+
35  class fmod_dv_vari : public op_dv_vari {
+
36  public:
+
37  fmod_dv_vari(double a, vari* bvi) :
+
38  op_dv_vari(std::fmod(a,bvi->val_),a,bvi) {
+
39  }
+
40  void chain() {
+
41  int d = static_cast<int>(ad_ / bvi_->val_);
+
42  bvi_->adj_ -= adj_ * d;
+
43  }
+
44  };
+
45  }
+
46 
+
64  inline var fmod(const var& a, const var& b) {
+
65  return var(new fmod_vv_vari(a.vi_,b.vi_));
+
66  }
+
67 
+
81  inline var fmod(const var& a, const double b) {
+
82  return var(new fmod_vd_vari(a.vi_,b));
+
83  }
+
84 
+
98  inline var fmod(const double a, const var& b) {
+
99  return var(new fmod_dv_vari(a,b.vi_));
+
100  }
+
101 
+
102  }
+
103 }
+
104 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2hypot_8hpp.html b/doc/api/html/rev_2functions_2hypot_8hpp.html new file mode 100644 index 00000000000..c1a48bbc973 --- /dev/null +++ b/doc/api/html/rev_2functions_2hypot_8hpp.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/agrad/rev/functions/hypot.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
hypot.hpp File Reference
+
+
+
#include <valarray>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/vv_vari.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+#include <boost/math/special_functions/hypot.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

var stan::agrad::hypot (const stan::agrad::var &a, const stan::agrad::var &b)
 Returns the length of the hypoteneuse of a right triangle with sides of the specified lengths (C99).
 
var stan::agrad::hypot (const stan::agrad::var &a, const double &b)
 Returns the length of the hypoteneuse of a right triangle with sides of the specified lengths (C99).
 
var stan::agrad::hypot (const double &a, const stan::agrad::var &b)
 Returns the length of the hypoteneuse of a right triangle with sides of the specified lengths (C99).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2hypot_8hpp_source.html b/doc/api/html/rev_2functions_2hypot_8hpp_source.html new file mode 100644 index 00000000000..f1d0e6fca3d --- /dev/null +++ b/doc/api/html/rev_2functions_2hypot_8hpp_source.html @@ -0,0 +1,162 @@ + + + + + +Stan: src/stan/agrad/rev/functions/hypot.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
hypot.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__HYPOT_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__HYPOT_HPP__
+
3 
+
4 #include <valarray>
+
5 #include <stan/agrad/rev/var.hpp>
+ + +
8 #include <boost/math/special_functions/hypot.hpp>
+
9 
+
10 namespace stan {
+
11  namespace agrad {
+
12 
+
13  namespace {
+
14  class hypot_vv_vari : public op_vv_vari {
+
15  public:
+
16  hypot_vv_vari(vari* avi, vari* bvi) :
+
17  op_vv_vari(boost::math::hypot(avi->val_,bvi->val_),
+
18  avi,bvi) {
+
19  }
+
20  void chain() {
+
21  avi_->adj_ += adj_ * avi_->val_ / val_;
+
22  bvi_->adj_ += adj_ * bvi_->val_ / val_;
+
23  }
+
24  };
+
25 
+
26  class hypot_vd_vari : public op_v_vari {
+
27  public:
+
28  hypot_vd_vari(vari* avi, double b) :
+
29  op_v_vari(boost::math::hypot(avi->val_,b),
+
30  avi) {
+
31  }
+
32  void chain() {
+
33  avi_->adj_ += adj_ * avi_->val_ / val_;
+
34  }
+
35  };
+
36  }
+
37 
+
54  inline var hypot(const stan::agrad::var& a,
+
55  const stan::agrad::var& b) {
+
56  return var(new hypot_vv_vari(a.vi_,b.vi_));
+
57  }
+
58 
+
73  inline var hypot(const stan::agrad::var& a,
+
74  const double& b) {
+
75  return var(new hypot_vd_vari(a.vi_,b));
+
76  }
+
77 
+
92  inline var hypot(const double& a,
+
93  const stan::agrad::var& b) {
+
94  return var(new hypot_vd_vari(b.vi_,a));
+
95  }
+
96 
+
97  }
+
98 }
+
99 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2log10_8hpp.html b/doc/api/html/rev_2functions_2log10_8hpp.html new file mode 100644 index 00000000000..39e28463744 --- /dev/null +++ b/doc/api/html/rev_2functions_2log10_8hpp.html @@ -0,0 +1,155 @@ + + + + + +Stan: src/stan/agrad/rev/functions/log10.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
log10.hpp File Reference
+
+
+
#include <cmath>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+#include <stan/math/constants.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::log10 (const var &a)
 Return the base 10 log of the specified variable (cmath).
 
+

Variable Documentation

+ +
+
+ + + + + +
+ + + + +
const double exp_val_
+
+static
+
+ +

Definition at line 15 of file log10.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2log10_8hpp_source.html b/doc/api/html/rev_2functions_2log10_8hpp_source.html new file mode 100644 index 00000000000..bc23919bcf3 --- /dev/null +++ b/doc/api/html/rev_2functions_2log10_8hpp_source.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/agrad/rev/functions/log10.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
log10.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__LOG10_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__LOG10_HPP__
+
3 
+
4 #include <cmath>
+
5 #include <stan/agrad/rev/var.hpp>
+ + +
8 
+
9 namespace stan {
+
10  namespace agrad {
+
11 
+
12  namespace {
+
13  class log10_vari : public op_v_vari {
+
14  public:
+
15  const double exp_val_;
+
16  log10_vari(vari* avi) :
+
17  op_v_vari(std::log10(avi->val_),avi),
+
18  exp_val_(avi->val_) {
+
19  }
+
20  void chain() {
+
21  avi_->adj_ += adj_ / (stan::math::LOG_10 * exp_val_);
+
22  }
+
23  };
+
24  }
+
25 
+
36  inline var log10(const var& a) {
+
37  return var(new log10_vari(a.vi_));
+
38  }
+
39 
+
40  }
+
41 }
+
42 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2pow_8hpp.html b/doc/api/html/rev_2functions_2pow_8hpp.html new file mode 100644 index 00000000000..6f8a6796db0 --- /dev/null +++ b/doc/api/html/rev_2functions_2pow_8hpp.html @@ -0,0 +1,141 @@ + + + + + +Stan: src/stan/agrad/rev/functions/pow.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
pow.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

var stan::agrad::pow (const var &base, const var &exponent)
 Return the base raised to the power of the exponent (cmath).
 
var stan::agrad::pow (const var &base, const double exponent)
 Return the base variable raised to the power of the exponent scalar (cmath).
 
var stan::agrad::pow (const double base, const var &exponent)
 Return the base scalar raised to the power of the exponent variable (cmath).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2pow_8hpp_source.html b/doc/api/html/rev_2functions_2pow_8hpp_source.html new file mode 100644 index 00000000000..438eedccd07 --- /dev/null +++ b/doc/api/html/rev_2functions_2pow_8hpp_source.html @@ -0,0 +1,178 @@ + + + + + +Stan: src/stan/agrad/rev/functions/pow.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
pow.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__POW_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__POW_HPP__
+
3 
+
4 #include <cmath>
+
5 #include <stan/agrad/rev/var.hpp>
+ + + + + +
11 
+
12 namespace stan {
+
13  namespace agrad {
+
14 
+
15  namespace {
+
16  class pow_vv_vari : public op_vv_vari {
+
17  public:
+
18  pow_vv_vari(vari* avi, vari* bvi) :
+
19  op_vv_vari(std::pow(avi->val_,bvi->val_),avi,bvi) {
+
20  }
+
21  void chain() {
+
22  if (avi_->val_ == 0.0) return; // partials zero, avoids 0 & log(0)
+
23  avi_->adj_ += adj_ * bvi_->val_ * val_ / avi_->val_;
+
24  bvi_->adj_ += adj_ * std::log(avi_->val_) * val_;
+
25  }
+
26  };
+
27 
+
28  class pow_vd_vari : public op_vd_vari {
+
29  public:
+
30  pow_vd_vari(vari* avi, double b) :
+
31  op_vd_vari(std::pow(avi->val_,b),avi,b) {
+
32  }
+
33  void chain() {
+
34  if (avi_->val_ == 0.0) return; // partials zero, avoids 0 & log(0)
+
35  avi_->adj_ += adj_ * bd_ * val_ / avi_->val_;
+
36  }
+
37  };
+
38 
+
39  class pow_dv_vari : public op_dv_vari {
+
40  public:
+
41  pow_dv_vari(double a, vari* bvi) :
+
42  op_dv_vari(std::pow(a,bvi->val_),a,bvi) {
+
43  }
+
44  void chain() {
+
45  if (ad_ == 0.0) return; // partials zero, avoids 0 & log(0)
+
46  bvi_->adj_ += adj_ * std::log(ad_) * val_;
+
47  }
+
48  };
+
49  }
+
50 
+
64  inline var pow(const var& base, const var& exponent) {
+
65  return var(new pow_vv_vari(base.vi_,exponent.vi_));
+
66  }
+
67 
+
80  inline var pow(const var& base, const double exponent) {
+
81  if (exponent == 0.5)
+
82  return sqrt(base);
+
83  if (exponent == 1.0)
+
84  return base;
+
85  if (exponent == 2.0)
+
86  return base * base; // FIXME: square() functionality from special_functions
+
87  return var(new pow_vd_vari(base.vi_,exponent));
+
88  }
+
89 
+
102  inline var pow(const double base, const var& exponent) {
+
103  return var(new pow_dv_vari(base,exponent.vi_));
+
104  }
+
105 
+
106  }
+
107 }
+
108 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2round_8hpp.html b/doc/api/html/rev_2functions_2round_8hpp.html new file mode 100644 index 00000000000..3caaad044a0 --- /dev/null +++ b/doc/api/html/rev_2functions_2round_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/functions/round.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
round.hpp File Reference
+
+
+
#include <boost/math/special_functions/round.hpp>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/vari.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::round (const stan::agrad::var &a)
 Returns the rounded form of the specified variable (C99).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2round_8hpp_source.html b/doc/api/html/rev_2functions_2round_8hpp_source.html new file mode 100644 index 00000000000..b8d65fdaa5f --- /dev/null +++ b/doc/api/html/rev_2functions_2round_8hpp_source.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/agrad/rev/functions/round.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
round.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__ROUND_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__ROUND_HPP__
+
3 
+
4 #include <boost/math/special_functions/round.hpp>
+
5 #include <stan/agrad/rev/var.hpp>
+ +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  namespace {
+
12  // derivative 0 almost everywhere
+
13  class round_vari : public vari {
+
14  public:
+
15  round_vari(vari* avi) :
+
16  vari(boost::math::round(avi->val_)) {
+
17  }
+
18  };
+
19  }
+
20 
+
35  inline var round(const stan::agrad::var& a) {
+
36  return var(new round_vari(a.vi_));
+
37  }
+
38 
+
39  }
+
40 }
+
41 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2sin_8hpp.html b/doc/api/html/rev_2functions_2sin_8hpp.html new file mode 100644 index 00000000000..3d538b4951b --- /dev/null +++ b/doc/api/html/rev_2functions_2sin_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/functions/sin.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
sin.hpp File Reference
+
+
+
#include <cmath>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::sin (const var &a)
 Return the sine of a radian-scaled variable (cmath).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2sin_8hpp_source.html b/doc/api/html/rev_2functions_2sin_8hpp_source.html new file mode 100644 index 00000000000..f2b9ab43405 --- /dev/null +++ b/doc/api/html/rev_2functions_2sin_8hpp_source.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/agrad/rev/functions/sin.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
sin.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__SIN_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__SIN_HPP__
+
3 
+
4 #include <cmath>
+
5 #include <stan/agrad/rev/var.hpp>
+ +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  namespace {
+
12  class sin_vari : public op_v_vari {
+
13  public:
+
14  sin_vari(vari* avi) :
+
15  op_v_vari(std::sin(avi->val_),avi) {
+
16  }
+
17  void chain() {
+
18  avi_->adj_ += adj_ * std::cos(avi_->val_);
+
19  }
+
20  };
+
21  }
+
22 
+
33  inline var sin(const var& a) {
+
34  return var(new sin_vari(a.vi_));
+
35  }
+
36 
+
37  }
+
38 }
+
39 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2sinh_8hpp.html b/doc/api/html/rev_2functions_2sinh_8hpp.html new file mode 100644 index 00000000000..312b30ad8f8 --- /dev/null +++ b/doc/api/html/rev_2functions_2sinh_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/functions/sinh.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
sinh.hpp File Reference
+
+
+
#include <valarray>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::sinh (const var &a)
 Return the hyperbolic sine of the specified variable (cmath).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2sinh_8hpp_source.html b/doc/api/html/rev_2functions_2sinh_8hpp_source.html new file mode 100644 index 00000000000..7cb7a4167b4 --- /dev/null +++ b/doc/api/html/rev_2functions_2sinh_8hpp_source.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/agrad/rev/functions/sinh.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
sinh.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__SINH_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__SINH_HPP__
+
3 
+
4 #include <valarray>
+
5 #include <stan/agrad/rev/var.hpp>
+ +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  namespace {
+
12  class sinh_vari : public op_v_vari {
+
13  public:
+
14  sinh_vari(vari* avi) :
+
15  op_v_vari(std::sinh(avi->val_),avi) {
+
16  }
+
17  void chain() {
+
18  avi_->adj_ += adj_ * std::cosh(avi_->val_);
+
19  }
+
20  };
+
21  }
+
22 
+
33  inline var sinh(const var& a) {
+
34  return var(new sinh_vari(a.vi_));
+
35  }
+
36 
+
37  }
+
38 }
+
39 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2sqrt_8hpp.html b/doc/api/html/rev_2functions_2sqrt_8hpp.html new file mode 100644 index 00000000000..9efd639cda7 --- /dev/null +++ b/doc/api/html/rev_2functions_2sqrt_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/functions/sqrt.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
sqrt.hpp File Reference
+
+
+
#include <cmath>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::sqrt (const var &a)
 Return the square root of the specified variable (cmath).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2sqrt_8hpp_source.html b/doc/api/html/rev_2functions_2sqrt_8hpp_source.html new file mode 100644 index 00000000000..715ca8d05cb --- /dev/null +++ b/doc/api/html/rev_2functions_2sqrt_8hpp_source.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/agrad/rev/functions/sqrt.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
sqrt.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__SQRT_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__SQRT_HPP__
+
3 
+
4 #include <cmath>
+
5 #include <stan/agrad/rev/var.hpp>
+ +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  namespace {
+
12  class sqrt_vari : public op_v_vari {
+
13  public:
+
14  sqrt_vari(vari* avi) :
+
15  op_v_vari(std::sqrt(avi->val_),avi) {
+
16  }
+
17  void chain() {
+
18  avi_->adj_ += adj_ / (2.0 * val_);
+
19  }
+
20  };
+
21  }
+
22 
+
33  inline var sqrt(const var& a) {
+
34  return var(new sqrt_vari(a.vi_));
+
35  }
+
36 
+
37  }
+
38 }
+
39 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2tan_8hpp.html b/doc/api/html/rev_2functions_2tan_8hpp.html new file mode 100644 index 00000000000..ddbb89aa33b --- /dev/null +++ b/doc/api/html/rev_2functions_2tan_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/functions/tan.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
tan.hpp File Reference
+
+
+
#include <cmath>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::tan (const var &a)
 Return the tangent of a radian-scaled variable (cmath).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2tan_8hpp_source.html b/doc/api/html/rev_2functions_2tan_8hpp_source.html new file mode 100644 index 00000000000..22fb22a215e --- /dev/null +++ b/doc/api/html/rev_2functions_2tan_8hpp_source.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/agrad/rev/functions/tan.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
tan.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__TAN_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__TAN_HPP__
+
3 
+
4 #include <cmath>
+
5 #include <stan/agrad/rev/var.hpp>
+ +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  namespace {
+
12  class tan_vari : public op_v_vari {
+
13  public:
+
14  tan_vari(vari* avi) :
+
15  op_v_vari(std::tan(avi->val_),avi) {
+
16  }
+
17  void chain() {
+
18  avi_->adj_ += adj_ * (1.0 + val_ * val_);
+
19  }
+
20  };
+
21  }
+
22 
+
33  inline var tan(const var& a) {
+
34  return var(new tan_vari(a.vi_));
+
35  }
+
36 
+
37  }
+
38 }
+
39 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2tanh_8hpp.html b/doc/api/html/rev_2functions_2tanh_8hpp.html new file mode 100644 index 00000000000..b2241bcfe8c --- /dev/null +++ b/doc/api/html/rev_2functions_2tanh_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/functions/tanh.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
tanh.hpp File Reference
+
+
+
#include <cmath>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::tanh (const var &a)
 Return the hyperbolic tangent of the specified variable (cmath).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2tanh_8hpp_source.html b/doc/api/html/rev_2functions_2tanh_8hpp_source.html new file mode 100644 index 00000000000..55e4b8bc57f --- /dev/null +++ b/doc/api/html/rev_2functions_2tanh_8hpp_source.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/agrad/rev/functions/tanh.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
tanh.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__TANH_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__TANH_HPP__
+
3 
+
4 #include <cmath>
+
5 #include <stan/agrad/rev/var.hpp>
+ +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  namespace {
+
12  class tanh_vari : public op_v_vari {
+
13  public:
+
14  tanh_vari(vari* avi) :
+
15  op_v_vari(std::tanh(avi->val_),avi) {
+
16  }
+
17  void chain() {
+
18  double cosh = std::cosh(avi_->val_);
+
19  avi_->adj_ += adj_ / (cosh * cosh);
+
20  }
+
21  };
+
22  }
+
23 
+
34  inline var tanh(const var& a) {
+
35  return var(new tanh_vari(a.vi_));
+
36  }
+
37 
+
38  }
+
39 }
+
40 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2tgamma_8hpp.html b/doc/api/html/rev_2functions_2tgamma_8hpp.html new file mode 100644 index 00000000000..a5207153fe6 --- /dev/null +++ b/doc/api/html/rev_2functions_2tgamma_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/functions/tgamma.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
tgamma.hpp File Reference
+
+
+
#include <boost/math/special_functions/digamma.hpp>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/internal/v_vari.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::tgamma (const stan::agrad::var &a)
 Return the Gamma function applied to the specified variable (C99).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2tgamma_8hpp_source.html b/doc/api/html/rev_2functions_2tgamma_8hpp_source.html new file mode 100644 index 00000000000..42f8e366455 --- /dev/null +++ b/doc/api/html/rev_2functions_2tgamma_8hpp_source.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/agrad/rev/functions/tgamma.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
tgamma.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__TGAMMA_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__TGAMMA_HPP__
+
3 
+
4 #include <boost/math/special_functions/digamma.hpp>
+
5 #include <stan/agrad/rev/var.hpp>
+ +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  namespace {
+
12  class tgamma_vari : public op_v_vari {
+
13  public:
+
14  tgamma_vari(vari* avi) :
+
15  op_v_vari(boost::math::tgamma(avi->val_), avi) {
+
16  }
+
17  void chain() {
+
18  avi_->adj_ += adj_ * val_ * boost::math::digamma(avi_->val_);
+
19  }
+
20  };
+
21  }
+
22 
+
39  inline var tgamma(const stan::agrad::var& a) {
+
40  return var(new tgamma_vari(a.vi_));
+
41  }
+
42 
+
43  }
+
44 }
+
45 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2trunc_8hpp.html b/doc/api/html/rev_2functions_2trunc_8hpp.html new file mode 100644 index 00000000000..0213a6a8465 --- /dev/null +++ b/doc/api/html/rev_2functions_2trunc_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/functions/trunc.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
trunc.hpp File Reference
+
+
+
#include <boost/math/special_functions/trunc.hpp>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/vari.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + +

+Functions

var stan::agrad::trunc (const stan::agrad::var &a)
 Returns the truncatation of the specified variable (C99).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2functions_2trunc_8hpp_source.html b/doc/api/html/rev_2functions_2trunc_8hpp_source.html new file mode 100644 index 00000000000..f401b6bb5d2 --- /dev/null +++ b/doc/api/html/rev_2functions_2trunc_8hpp_source.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/agrad/rev/functions/trunc.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
trunc.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__FUNCTIONS__TRUNC_HPP__
+
2 #define __STAN__AGRAD__REV__FUNCTIONS__TRUNC_HPP__
+
3 
+
4 #include <boost/math/special_functions/trunc.hpp>
+
5 #include <stan/agrad/rev/var.hpp>
+ +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  namespace {
+
12  // derivative 0 almost everywhere
+
13  class trunc_vari : public vari {
+
14  public:
+
15  trunc_vari(vari* avi) :
+
16  vari(boost::math::trunc(avi->val_)) {
+
17  }
+
18  };
+
19  }
+
20 
+
34  inline var trunc(const stan::agrad::var& a) {
+
35  return var(new trunc_vari(a.vi_));
+
36  }
+
37 
+
38  }
+
39 }
+
40 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2numeric__limits_8hpp.html b/doc/api/html/rev_2numeric__limits_8hpp.html new file mode 100644 index 00000000000..4de1b1857fc --- /dev/null +++ b/doc/api/html/rev_2numeric__limits_8hpp.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/agrad/rev/numeric_limits.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
numeric_limits.hpp File Reference
+
+
+
#include <limits>
+#include <stan/agrad/rev/var.hpp>
+
+

Go to the source code of this file.

+ + + + + +

+Classes

struct  std::numeric_limits< stan::agrad::var >
 Specialization of numeric limits for var objects. More...
 
+ + + + +

+Namespaces

namespace  std
 Template specification of functions in std for Stan.
 
+ + + + + + + +

+Functions

int std::isnan (const stan::agrad::var &a)
 Checks if the given number is NaN.
 
int std::isinf (const stan::agrad::var &a)
 Checks if the given number is infinite.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2numeric__limits_8hpp_source.html b/doc/api/html/rev_2numeric__limits_8hpp_source.html new file mode 100644 index 00000000000..374ff8decd8 --- /dev/null +++ b/doc/api/html/rev_2numeric__limits_8hpp_source.html @@ -0,0 +1,163 @@ + + + + + +Stan: src/stan/agrad/rev/numeric_limits.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
numeric_limits.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__NUMERIC_LIMITS_HPP__
+
2 #define __STAN__AGRAD__REV__NUMERIC_LIMITS_HPP__
+
3 
+
4 #include <limits>
+
5 #include <stan/agrad/rev/var.hpp>
+
6 
+
7 namespace std {
+
8 
+
15  template<>
+
16  struct numeric_limits<stan::agrad::var> {
+
17  static const bool is_specialized = true;
+ + +
20  static const int digits = numeric_limits<double>::digits;
+
21  static const int digits10 = numeric_limits<double>::digits10;
+
22  static const bool is_signed = numeric_limits<double>::is_signed;
+
23  static const bool is_integer = numeric_limits<double>::is_integer;
+
24  static const bool is_exact = numeric_limits<double>::is_exact;
+
25  static const int radix = numeric_limits<double>::radix;
+
26  static stan::agrad::var epsilon() { return numeric_limits<double>::epsilon(); }
+
27  static stan::agrad::var round_error() { return numeric_limits<double>::round_error(); }
+
28 
+
29  static const int min_exponent = numeric_limits<double>::min_exponent;
+
30  static const int min_exponent10 = numeric_limits<double>::min_exponent10;
+
31  static const int max_exponent = numeric_limits<double>::max_exponent;
+
32  static const int max_exponent10 = numeric_limits<double>::max_exponent10;
+
33 
+
34  static const bool has_infinity = numeric_limits<double>::has_infinity;
+
35  static const bool has_quiet_NaN = numeric_limits<double>::has_quiet_NaN;
+
36  static const bool has_signaling_NaN = numeric_limits<double>::has_signaling_NaN;
+
37  static const float_denorm_style has_denorm = numeric_limits<double>::has_denorm;
+
38  static const bool has_denorm_loss = numeric_limits<double>::has_denorm_loss;
+
39  static stan::agrad::var infinity() { return numeric_limits<double>::infinity(); }
+
40  static stan::agrad::var quiet_NaN() { return numeric_limits<double>::quiet_NaN(); }
+
41  static stan::agrad::var signaling_NaN() { return numeric_limits<double>::signaling_NaN(); }
+
42  static stan::agrad::var denorm_min() { return numeric_limits<double>::denorm_min(); }
+
43 
+
44  static const bool is_iec559 = numeric_limits<double>::is_iec559;
+
45  static const bool is_bounded = numeric_limits<double>::is_bounded;
+
46  static const bool is_modulo = numeric_limits<double>::is_modulo;
+
47 
+
48  static const bool traps = numeric_limits<double>::traps;
+
49  static const bool tinyness_before = numeric_limits<double>::tinyness_before;
+
50  static const float_round_style round_style = numeric_limits<double>::round_style;
+
51  };
+
52 
+
62  inline int isnan(const stan::agrad::var& a) {
+
63  return isnan(a.val());
+
64  }
+
65 
+
75  inline int isinf(const stan::agrad::var& a) {
+
76  return isinf(a.val());
+
77  }
+
78 
+
79 }
+
80 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2operators_2operator__addition_8hpp.html b/doc/api/html/rev_2operators_2operator__addition_8hpp.html new file mode 100644 index 00000000000..59cf6d5540a --- /dev/null +++ b/doc/api/html/rev_2operators_2operator__addition_8hpp.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_addition.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
operator_addition.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

var stan::agrad::operator+ (const var &a, const var &b)
 Addition operator for variables (C++).
 
var stan::agrad::operator+ (const var &a, const double b)
 Addition operator for variable and scalar (C++).
 
var stan::agrad::operator+ (const double a, const var &b)
 Addition operator for scalar and variable (C++).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2operators_2operator__addition_8hpp_source.html b/doc/api/html/rev_2operators_2operator__addition_8hpp_source.html new file mode 100644 index 00000000000..93c104074a2 --- /dev/null +++ b/doc/api/html/rev_2operators_2operator__addition_8hpp_source.html @@ -0,0 +1,159 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_addition.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operator_addition.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__OPERATORS__OPERATOR_ADDITION_HPP__
+
2 #define __STAN__AGRAD__REV__OPERATORS__OPERATOR_ADDITION_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ + +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  namespace {
+
12  class add_vv_vari : public op_vv_vari {
+
13  public:
+
14  add_vv_vari(vari* avi, vari* bvi) :
+
15  op_vv_vari(avi->val_ + bvi->val_, avi, bvi) {
+
16  }
+
17  void chain() {
+
18  avi_->adj_ += adj_;
+
19  bvi_->adj_ += adj_;
+
20  }
+
21  };
+
22 
+
23  class add_vd_vari : public op_vd_vari {
+
24  public:
+
25  add_vd_vari(vari* avi, double b) :
+
26  op_vd_vari(avi->val_ + b, avi, b) {
+
27  }
+
28  void chain() {
+
29  avi_->adj_ += adj_;
+
30  }
+
31  };
+
32  }
+
33 
+
47  inline var operator+(const var& a, const var& b) {
+
48  return var(new add_vv_vari(a.vi_,b.vi_));
+
49  }
+
50 
+
62  inline var operator+(const var& a, const double b) {
+
63  if (b == 0.0)
+
64  return a;
+
65  return var(new add_vd_vari(a.vi_,b));
+
66  }
+
67 
+
79  inline var operator+(const double a, const var& b) {
+
80  if (a == 0.0)
+
81  return b;
+
82  return var(new add_vd_vari(b.vi_,a)); // by symmetry
+
83  }
+
84 
+
85  }
+
86 }
+
87 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2operators_2operator__division_8hpp.html b/doc/api/html/rev_2operators_2operator__division_8hpp.html new file mode 100644 index 00000000000..1aaabb734cb --- /dev/null +++ b/doc/api/html/rev_2operators_2operator__division_8hpp.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_division.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
operator_division.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

var stan::agrad::operator/ (const var &a, const var &b)
 Division operator for two variables (C++).
 
var stan::agrad::operator/ (const var &a, const double b)
 Division operator for dividing a variable by a scalar (C++).
 
var stan::agrad::operator/ (const double a, const var &b)
 Division operator for dividing a scalar by a variable (C++).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2operators_2operator__division_8hpp_source.html b/doc/api/html/rev_2operators_2operator__division_8hpp_source.html new file mode 100644 index 00000000000..c605f168b0b --- /dev/null +++ b/doc/api/html/rev_2operators_2operator__division_8hpp_source.html @@ -0,0 +1,169 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_division.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operator_division.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__OPERATORS__OPERATOR_DIVISION_HPP__
+
2 #define __STAN__AGRAD__REV__OPERATORS__OPERATOR_DIVISION_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ + + +
8 
+
9 namespace stan {
+
10  namespace agrad {
+
11 
+
12  namespace {
+
13  // (a/b)' = a' * (1 / b) - b' * (a / [b * b])
+
14  class divide_vv_vari : public op_vv_vari {
+
15  public:
+
16  divide_vv_vari(vari* avi, vari* bvi) :
+
17  op_vv_vari(avi->val_ / bvi->val_, avi, bvi) {
+
18  }
+
19  void chain() {
+
20  avi_->adj_ += adj_ / bvi_->val_;
+
21  bvi_->adj_ -= adj_ * avi_->val_ / (bvi_->val_ * bvi_->val_);
+
22  }
+
23  };
+
24 
+
25  class divide_vd_vari : public op_vd_vari {
+
26  public:
+
27  divide_vd_vari(vari* avi, double b) :
+
28  op_vd_vari(avi->val_ / b, avi, b) {
+
29  }
+
30  void chain() {
+
31  avi_->adj_ += adj_ / bd_;
+
32  }
+
33  };
+
34 
+
35  class divide_dv_vari : public op_dv_vari {
+
36  public:
+
37  divide_dv_vari(double a, vari* bvi) :
+
38  op_dv_vari(a / bvi->val_, a, bvi) {
+
39  }
+
40  void chain() {
+
41  bvi_->adj_ -= adj_ * ad_ / (bvi_->val_ * bvi_->val_);
+
42  }
+
43  };
+
44  }
+
45 
+
60  inline var operator/(const var& a, const var& b) {
+
61  return var(new divide_vv_vari(a.vi_,b.vi_));
+
62  }
+
63 
+
75  inline var operator/(const var& a, const double b) {
+
76  if (b == 1.0)
+
77  return a;
+
78  return var(new divide_vd_vari(a.vi_,b));
+
79  }
+
80 
+
92  inline var operator/(const double a, const var& b) {
+
93  return var(new divide_dv_vari(a,b.vi_));
+
94  }
+
95 
+
96  }
+
97 }
+
98 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2operators_2operator__equal_8hpp.html b/doc/api/html/rev_2operators_2operator__equal_8hpp.html new file mode 100644 index 00000000000..6f12f6c9b92 --- /dev/null +++ b/doc/api/html/rev_2operators_2operator__equal_8hpp.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_equal.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
operator_equal.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

bool stan::agrad::operator== (const var &a, const var &b)
 Equality operator comparing two variables' values (C++).
 
bool stan::agrad::operator== (const var &a, const double b)
 Equality operator comparing a variable's value and a double (C++).
 
bool stan::agrad::operator== (const double a, const var &b)
 Equality operator comparing a scalar and a variable's value (C++).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2operators_2operator__equal_8hpp_source.html b/doc/api/html/rev_2operators_2operator__equal_8hpp_source.html new file mode 100644 index 00000000000..e9c2e87cacd --- /dev/null +++ b/doc/api/html/rev_2operators_2operator__equal_8hpp_source.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_equal.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operator_equal.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__OPERATORS__OPERATOR_EQUAL_HPP__
+
2 #define __STAN__AGRAD__REV__OPERATORS__OPERATOR_EQUAL_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+
5 
+
6 namespace stan {
+
7  namespace agrad {
+
8 
+
17  inline bool operator==(const var& a, const var& b) {
+
18  return a.val() == b.val();
+
19  }
+
20 
+
30  inline bool operator==(const var& a, const double b) {
+
31  return a.val() == b;
+
32  }
+
33 
+
42  inline bool operator==(const double a, const var& b) {
+
43  return a == b.val();
+
44  }
+
45 
+
46  }
+
47 }
+
48 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2operators_2operator__greater__than_8hpp.html b/doc/api/html/rev_2operators_2operator__greater__than_8hpp.html new file mode 100644 index 00000000000..dde9e858c01 --- /dev/null +++ b/doc/api/html/rev_2operators_2operator__greater__than_8hpp.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_greater_than.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
operator_greater_than.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

bool stan::agrad::operator> (const var &a, const var &b)
 Greater than operator comparing variables' values (C++).
 
bool stan::agrad::operator> (const var &a, const double b)
 Greater than operator comparing variable's value and double (C++).
 
bool stan::agrad::operator> (const double a, const var &b)
 Greater than operator comparing a double and a variable's value (C++).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2operators_2operator__greater__than_8hpp_source.html b/doc/api/html/rev_2operators_2operator__greater__than_8hpp_source.html new file mode 100644 index 00000000000..c0b59051e9a --- /dev/null +++ b/doc/api/html/rev_2operators_2operator__greater__than_8hpp_source.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_greater_than.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operator_greater_than.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__OPERATORS__OPERATOR_GREATER_THAN_HPP__
+
2 #define __STAN__AGRAD__REV__OPERATORS__OPERATOR_GREATER_THAN_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+
5 
+
6 namespace stan {
+
7  namespace agrad {
+
8 
+
16  inline bool operator>(const var& a, const var& b) {
+
17  return a.val() > b.val();
+
18  }
+
19 
+
28  inline bool operator>(const var& a, const double b) {
+
29  return a.val() > b;
+
30  }
+
31 
+
40  inline bool operator>(const double a, const var& b) {
+
41  return a > b.val();
+
42  }
+
43 
+
44  }
+
45 }
+
46 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2operators_2operator__greater__than__or__equal_8hpp.html b/doc/api/html/rev_2operators_2operator__greater__than__or__equal_8hpp.html new file mode 100644 index 00000000000..513866a879d --- /dev/null +++ b/doc/api/html/rev_2operators_2operator__greater__than__or__equal_8hpp.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_greater_than_or_equal.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
operator_greater_than_or_equal.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

bool stan::agrad::operator>= (const var &a, const var &b)
 Greater than or equal operator comparing two variables' values (C++).
 
bool stan::agrad::operator>= (const var &a, const double b)
 Greater than or equal operator comparing variable's value and double (C++).
 
bool stan::agrad::operator>= (const double a, const var &b)
 Greater than or equal operator comparing double and variable's value (C++).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2operators_2operator__greater__than__or__equal_8hpp_source.html b/doc/api/html/rev_2operators_2operator__greater__than__or__equal_8hpp_source.html new file mode 100644 index 00000000000..9ea105ab316 --- /dev/null +++ b/doc/api/html/rev_2operators_2operator__greater__than__or__equal_8hpp_source.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_greater_than_or_equal.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operator_greater_than_or_equal.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__OPERATORS__OPERATOR_GREATER_THAN_OR_EQUAL_HPP__
+
2 #define __STAN__AGRAD__REV__OPERATORS__OPERATOR_GREATER_THAN_OR_EQUAL_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+
5 
+
6 namespace stan {
+
7  namespace agrad {
+
8 
+
18  inline bool operator>=(const var& a, const var& b) {
+
19  return a.val() >= b.val();
+
20  }
+
21 
+
31  inline bool operator>=(const var& a, const double b) {
+
32  return a.val() >= b;
+
33  }
+
34 
+
44  inline bool operator>=(const double a, const var& b) {
+
45  return a >= b.val();
+
46  }
+
47 
+
48  }
+
49 }
+
50 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2operators_2operator__less__than_8hpp.html b/doc/api/html/rev_2operators_2operator__less__than_8hpp.html new file mode 100644 index 00000000000..d2e160c34b7 --- /dev/null +++ b/doc/api/html/rev_2operators_2operator__less__than_8hpp.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_less_than.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
operator_less_than.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

bool stan::agrad::operator< (const var &a, const var &b)
 Less than operator comparing variables' values (C++).
 
bool stan::agrad::operator< (const var &a, const double b)
 Less than operator comparing variable's value and a double (C++).
 
bool stan::agrad::operator< (const double a, const var &b)
 Less than operator comparing a double and variable's value (C++).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2operators_2operator__less__than_8hpp_source.html b/doc/api/html/rev_2operators_2operator__less__than_8hpp_source.html new file mode 100644 index 00000000000..f77d503cadc --- /dev/null +++ b/doc/api/html/rev_2operators_2operator__less__than_8hpp_source.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_less_than.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operator_less_than.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__OPERATORS__OPERATOR_LESS_THAN_HPP__
+
2 #define __STAN__AGRAD__REV__OPERATORS__OPERATOR_LESS_THAN_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+
5 
+
6 namespace stan {
+
7  namespace agrad {
+
8 
+
16  inline bool operator<(const var& a, const var& b) {
+
17  return a.val() < b.val();
+
18  }
+
19 
+
28  inline bool operator<(const var& a, const double b) {
+
29  return a.val() < b;
+
30  }
+
31 
+
40  inline bool operator<(const double a, const var& b) {
+
41  return a < b.val();
+
42  }
+
43 
+
44  }
+
45 }
+
46 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2operators_2operator__less__than__or__equal_8hpp.html b/doc/api/html/rev_2operators_2operator__less__than__or__equal_8hpp.html new file mode 100644 index 00000000000..b0843b9565f --- /dev/null +++ b/doc/api/html/rev_2operators_2operator__less__than__or__equal_8hpp.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_less_than_or_equal.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
operator_less_than_or_equal.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

bool stan::agrad::operator<= (const var &a, const var &b)
 Less than or equal operator comparing two variables' values (C++).
 
bool stan::agrad::operator<= (const var &a, const double b)
 Less than or equal operator comparing a variable's value and a scalar (C++).
 
bool stan::agrad::operator<= (const double a, const var &b)
 Less than or equal operator comparing a double and variable's value (C++).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2operators_2operator__less__than__or__equal_8hpp_source.html b/doc/api/html/rev_2operators_2operator__less__than__or__equal_8hpp_source.html new file mode 100644 index 00000000000..c33224059e0 --- /dev/null +++ b/doc/api/html/rev_2operators_2operator__less__than__or__equal_8hpp_source.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_less_than_or_equal.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operator_less_than_or_equal.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__OPERATORS__OPERATOR_LESS_THAN_OR_EQUAL_HPP__
+
2 #define __STAN__AGRAD__REV__OPERATORS__OPERATOR_LESS_THAN_OR_EQUAL_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+
5 
+
6 namespace stan {
+
7  namespace agrad {
+
8 
+
18  inline bool operator<=(const var& a, const var& b) {
+
19  return a.val() <= b.val();
+
20  }
+
21 
+
31  inline bool operator<=(const var& a, const double b) {
+
32  return a.val() <= b;
+
33  }
+
34 
+
44  inline bool operator<=(const double a, const var& b) {
+
45  return a <= b.val();
+
46  }
+
47 
+
48  }
+
49 }
+
50 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2operators_2operator__multiplication_8hpp.html b/doc/api/html/rev_2operators_2operator__multiplication_8hpp.html new file mode 100644 index 00000000000..672eacfe58a --- /dev/null +++ b/doc/api/html/rev_2operators_2operator__multiplication_8hpp.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_multiplication.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
operator_multiplication.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

var stan::agrad::operator* (const var &a, const var &b)
 Multiplication operator for two variables (C++).
 
var stan::agrad::operator* (const var &a, const double b)
 Multiplication operator for a variable and a scalar (C++).
 
var stan::agrad::operator* (const double a, const var &b)
 Multiplication operator for a scalar and a variable (C++).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2operators_2operator__multiplication_8hpp_source.html b/doc/api/html/rev_2operators_2operator__multiplication_8hpp_source.html new file mode 100644 index 00000000000..53269336f95 --- /dev/null +++ b/doc/api/html/rev_2operators_2operator__multiplication_8hpp_source.html @@ -0,0 +1,159 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_multiplication.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operator_multiplication.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__OPERATORS__OPERATOR_MULTIPLICATION_HPP__
+
2 #define __STAN__AGRAD__REV__OPERATORS__OPERATOR_MULTIPLICATION_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ + +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  namespace {
+
12  class multiply_vv_vari : public op_vv_vari {
+
13  public:
+
14  multiply_vv_vari(vari* avi, vari* bvi) :
+
15  op_vv_vari(avi->val_ * bvi->val_, avi, bvi) {
+
16  }
+
17  void chain() {
+
18  avi_->adj_ += bvi_->val_ * adj_;
+
19  bvi_->adj_ += avi_->val_ * adj_;
+
20  }
+
21  };
+
22 
+
23  class multiply_vd_vari : public op_vd_vari {
+
24  public:
+
25  multiply_vd_vari(vari* avi, double b) :
+
26  op_vd_vari(avi->val_ * b, avi, b) {
+
27  }
+
28  void chain() {
+
29  avi_->adj_ += adj_ * bd_;
+
30  }
+
31  };
+
32  }
+
33 
+
47  inline var operator*(const var& a, const var& b) {
+
48  return var(new multiply_vv_vari(a.vi_,b.vi_));
+
49  }
+
50 
+
62  inline var operator*(const var& a, const double b) {
+
63  if (b == 1.0)
+
64  return a;
+
65  return var(new multiply_vd_vari(a.vi_,b));
+
66  }
+
67 
+
79  inline var operator*(const double a, const var& b) {
+
80  if (a == 1.0)
+
81  return b;
+
82  return var(new multiply_vd_vari(b.vi_,a)); // by symmetry
+
83  }
+
84 
+
85  }
+
86 }
+
87 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2operators_2operator__not__equal_8hpp.html b/doc/api/html/rev_2operators_2operator__not__equal_8hpp.html new file mode 100644 index 00000000000..31cfa281c4f --- /dev/null +++ b/doc/api/html/rev_2operators_2operator__not__equal_8hpp.html @@ -0,0 +1,135 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_not_equal.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
operator_not_equal.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

bool stan::agrad::operator!= (const var &a, const var &b)
 Inequality operator comparing two variables' values (C++).
 
bool stan::agrad::operator!= (const var &a, const double b)
 Inequality operator comparing a variable's value and a double (C++).
 
bool stan::agrad::operator!= (const double a, const var &b)
 Inequality operator comparing a double and a variable's value (C++).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2operators_2operator__not__equal_8hpp_source.html b/doc/api/html/rev_2operators_2operator__not__equal_8hpp_source.html new file mode 100644 index 00000000000..8cccd302ced --- /dev/null +++ b/doc/api/html/rev_2operators_2operator__not__equal_8hpp_source.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_not_equal.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operator_not_equal.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__OPERATORS__OPERATOR_NOT_EQUAL_HPP__
+
2 #define __STAN__AGRAD__REV__OPERATORS__OPERATOR_NOT_EQUAL_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+
5 
+
6 namespace stan {
+
7  namespace agrad {
+
8 
+
17  inline bool operator!=(const var& a, const var& b) {
+
18  return a.val() != b.val();
+
19  }
+
20 
+
30  inline bool operator!=(const var& a, const double b) {
+
31  return a.val() != b;
+
32  }
+
33 
+
43  inline bool operator!=(const double a, const var& b) {
+
44  return a != b.val();
+
45  }
+
46 
+
47  }
+
48 }
+
49 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2operators_2operator__subtraction_8hpp.html b/doc/api/html/rev_2operators_2operator__subtraction_8hpp.html new file mode 100644 index 00000000000..558ec6e7b4a --- /dev/null +++ b/doc/api/html/rev_2operators_2operator__subtraction_8hpp.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_subtraction.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
operator_subtraction.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + +

+Functions

var stan::agrad::operator- (const var &a, const var &b)
 Subtraction operator for variables (C++).
 
var stan::agrad::operator- (const var &a, const double b)
 Subtraction operator for variable and scalar (C++).
 
var stan::agrad::operator- (const double a, const var &b)
 Subtraction operator for scalar and variable (C++).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2operators_2operator__subtraction_8hpp_source.html b/doc/api/html/rev_2operators_2operator__subtraction_8hpp_source.html new file mode 100644 index 00000000000..5309e25a099 --- /dev/null +++ b/doc/api/html/rev_2operators_2operator__subtraction_8hpp_source.html @@ -0,0 +1,168 @@ + + + + + +Stan: src/stan/agrad/rev/operators/operator_subtraction.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operator_subtraction.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__OPERATORS__OPERATOR_SUBTRACTION_HPP__
+
2 #define __STAN__AGRAD__REV__OPERATORS__OPERATOR_SUBTRACTION_HPP__
+
3 
+
4 #include <stan/agrad/rev/var.hpp>
+ + + +
8 
+
9 namespace stan {
+
10  namespace agrad {
+
11 
+
12  namespace {
+
13  class subtract_vv_vari : public op_vv_vari {
+
14  public:
+
15  subtract_vv_vari(vari* avi, vari* bvi) :
+
16  op_vv_vari(avi->val_ - bvi->val_, avi, bvi) {
+
17  }
+
18  void chain() {
+
19  avi_->adj_ += adj_;
+
20  bvi_->adj_ -= adj_;
+
21  }
+
22  };
+
23 
+
24  class subtract_vd_vari : public op_vd_vari {
+
25  public:
+
26  subtract_vd_vari(vari* avi, double b) :
+
27  op_vd_vari(avi->val_ - b, avi, b) {
+
28  }
+
29  void chain() {
+
30  avi_->adj_ += adj_;
+
31  }
+
32  };
+
33 
+
34  class subtract_dv_vari : public op_dv_vari {
+
35  public:
+
36  subtract_dv_vari(double a, vari* bvi) :
+
37  op_dv_vari(a - bvi->val_, a, bvi) {
+
38  }
+
39  void chain() {
+
40  bvi_->adj_ -= adj_;
+
41  }
+
42  };
+
43  }
+
44 
+
59  inline var operator-(const var& a, const var& b) {
+
60  return var(new subtract_vv_vari(a.vi_,b.vi_));
+
61  }
+
62 
+
74  inline var operator-(const var& a, const double b) {
+
75  if (b == 0.0)
+
76  return a;
+
77  return var(new subtract_vd_vari(a.vi_,b));
+
78  }
+
79 
+
91  inline var operator-(const double a, const var& b) {
+
92  return var(new subtract_dv_vari(a,b.vi_));
+
93  }
+
94 
+
95  }
+
96 }
+
97 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2operators_8hpp.html b/doc/api/html/rev_2operators_8hpp.html new file mode 100644 index 00000000000..b8d58cb4293 --- /dev/null +++ b/doc/api/html/rev_2operators_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/agrad/rev/operators.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operators.hpp File Reference
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_2operators_8hpp_source.html b/doc/api/html/rev_2operators_8hpp_source.html new file mode 100644 index 00000000000..966d1ca45d1 --- /dev/null +++ b/doc/api/html/rev_2operators_8hpp_source.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/operators.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
operators.hpp
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_8hpp.html b/doc/api/html/rev_8hpp.html new file mode 100644 index 00000000000..9dd7fa31ca7 --- /dev/null +++ b/doc/api/html/rev_8hpp.html @@ -0,0 +1,120 @@ + + + + + +Stan: src/stan/agrad/rev.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
rev.hpp File Reference
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rev_8hpp_source.html b/doc/api/html/rev_8hpp_source.html new file mode 100644 index 00000000000..7d52403a400 --- /dev/null +++ b/doc/api/html/rev_8hpp_source.html @@ -0,0 +1,124 @@ + + + + + +Stan: src/stan/agrad/rev.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
rev.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV_HPP__
+
2 #define __STAN__AGRAD__REV_HPP__
+
3 
+ + + +
7 #include <stan/agrad/rev/var.hpp>
+ + + +
11 
+ + + + +
16 
+
17 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/row_8hpp.html b/doc/api/html/row_8hpp.html new file mode 100644 index 00000000000..80c5808977d --- /dev/null +++ b/doc/api/html/row_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/math/matrix/row.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
row.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
Eigen::Matrix< T,
+1, Eigen::Dynamic > 
stan::math::row (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &m, size_t i)
 Return the specified row of the specified matrix, using start-at-1 indexing.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/row_8hpp_source.html b/doc/api/html/row_8hpp_source.html new file mode 100644 index 00000000000..82f3d71d8c7 --- /dev/null +++ b/doc/api/html/row_8hpp_source.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/math/matrix/row.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
row.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__ROW_HPP__
+
2 #define __STAN__MATH__MATRIX__ROW_HPP__
+
3 
+ + +
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
22  template <typename T>
+
23  inline
+
24  Eigen::Matrix<T,1,Eigen::Dynamic>
+
25  row(const Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& m,
+
26  size_t i) {
+
27  validate_row_index(m,i,"row");
+
28  return m.row(i - 1);
+
29  }
+
30 
+
31  }
+
32 }
+
33 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rows_8hpp.html b/doc/api/html/rows_8hpp.html new file mode 100644 index 00000000000..cd1191e5a4a --- /dev/null +++ b/doc/api/html/rows_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/matrix/rows.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
rows.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T , int R, int C>
size_t stan::math::rows (const Eigen::Matrix< T, R, C > &m)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/rows_8hpp_source.html b/doc/api/html/rows_8hpp_source.html new file mode 100644 index 00000000000..189897d9ac4 --- /dev/null +++ b/doc/api/html/rows_8hpp_source.html @@ -0,0 +1,125 @@ + + + + + +Stan: src/stan/math/matrix/rows.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
rows.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__ROWS_HPP__
+
2 #define __STAN__MATH__MATRIX__ROWS_HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
9  template <typename T, int R, int C>
+
10  inline
+
11  size_t
+
12  rows(const Eigen::Matrix<T,R,C>& m) {
+
13  return m.rows();
+
14  }
+
15 
+
16  }
+
17 }
+
18 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/sample_8hpp.html b/doc/api/html/sample_8hpp.html new file mode 100644 index 00000000000..82b513d3bc4 --- /dev/null +++ b/doc/api/html/sample_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/mcmc/sample.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
sample.hpp File Reference
+
+
+
#include <vector>
+#include <string>
+#include <stan/math/matrix/Eigen.hpp>
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::sample
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/sample_8hpp_source.html b/doc/api/html/sample_8hpp_source.html new file mode 100644 index 00000000000..20549cbec28 --- /dev/null +++ b/doc/api/html/sample_8hpp_source.html @@ -0,0 +1,180 @@ + + + + + +Stan: src/stan/mcmc/sample.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
sample.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__SAMPLE__HPP__
+
2 #define __STAN__MCMC__SAMPLE__HPP__
+
3 
+
4 #include <vector>
+
5 #include <string>
+
6 
+ +
8 
+
9 namespace stan {
+
10 
+
11  namespace mcmc {
+
12 
+
13  class sample {
+
14 
+
15  private:
+
16 
+
17  Eigen::VectorXd _cont_params; // Continuous coordinates of sample
+
18  double _log_prob; // Log probability of sample
+
19  double _accept_stat; // Acceptance statistic of transition
+
20 
+
21  public:
+
22 
+
23  sample(const Eigen::VectorXd& q,
+
24  double log_prob,
+
25  double stat) :
+
26  _cont_params(q),
+
27  _log_prob(log_prob),
+
28  _accept_stat(stat) {};
+
29 
+
30  virtual ~sample() {}; // No-op
+
31 
+
32  int size_cont() const {
+
33  return _cont_params.size();
+
34  }
+
35 
+
36  double cont_params(int k) const {
+
37  return _cont_params(k);
+
38  }
+
39 
+
40  void cont_params(Eigen::VectorXd& x) const {
+
41  x = _cont_params;
+
42  }
+
43 
+
44  const Eigen::VectorXd& cont_params() const {
+
45  return _cont_params;
+
46  }
+
47 
+
48  inline double log_prob() const {
+
49  return _log_prob;
+
50  }
+
51 
+
52  inline double accept_stat() const {
+
53  return _accept_stat;
+
54  }
+
55 
+
56  void get_sample_param_names(std::vector<std::string>& names) {
+
57  names.push_back("lp__");
+
58  names.push_back("accept_stat__");
+
59  }
+
60 
+
61  void get_sample_params(std::vector<double>& values) {
+
62  values.push_back(_log_prob);
+
63  values.push_back(_accept_stat);
+
64  }
+
65 
+
66  };
+
67 
+
68  } // mcmc
+
69 
+
70 } // stan
+
71 
+
72 #endif
+
73 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/scaled__add_8hpp.html b/doc/api/html/scaled__add_8hpp.html new file mode 100644 index 00000000000..df366789176 --- /dev/null +++ b/doc/api/html/scaled__add_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/functions/scaled_add.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
scaled_add.hpp File Reference
+
+
+
#include <vector>
+#include <cstddef>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + +

+Functions

void stan::math::scaled_add (std::vector< double > &x, const std::vector< double > &y, const double lambda)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/scaled__add_8hpp_source.html b/doc/api/html/scaled__add_8hpp_source.html new file mode 100644 index 00000000000..88f63d71e75 --- /dev/null +++ b/doc/api/html/scaled__add_8hpp_source.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/math/functions/scaled_add.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
scaled_add.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__SCALED_ADD_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__SCALED_ADD_HPP__
+
3 
+
4 #include <vector>
+
5 #include <cstddef>
+
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
10  // x <- x + lambda * y
+
11  inline void scaled_add(std::vector<double>& x,
+
12  const std::vector<double>& y,
+
13  const double lambda) {
+
14  for (size_t i = 0; i < x.size(); ++i)
+
15  x[i] += lambda * y[i];
+
16  }
+
17 
+
18  }
+
19 }
+
20 
+
21 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/scaled__inv__chi__square_8hpp.html b/doc/api/html/scaled__inv__chi__square_8hpp.html new file mode 100644 index 00000000000..3360983d628 --- /dev/null +++ b/doc/api/html/scaled__inv__chi__square_8hpp.html @@ -0,0 +1,162 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/scaled_inv_chi_square.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
scaled_inv_chi_square.hpp File Reference
+
+
+
#include <boost/random/chi_squared_distribution.hpp>
+#include <boost/random/variate_generator.hpp>
+#include <stan/agrad/partials_vari.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/math/constants.hpp>
+#include <stan/math/functions/square.hpp>
+#include <stan/math/functions/multiply_log.hpp>
+#include <stan/math/functions/value_of.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/prob/constants.hpp>
+#include <stan/prob/traits.hpp>
+#include <stan/prob/internal_math.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + + + + + + + + +

+Functions

template<bool propto, typename T_y , typename T_dof , typename T_scale >
return_type< T_y, T_dof,
+T_scale >::type 
stan::prob::scaled_inv_chi_square_log (const T_y &y, const T_dof &nu, const T_scale &s)
 The log of a scaled inverse chi-squared density for y with the specified degrees of freedom parameter and scale parameter.
 
template<typename T_y , typename T_dof , typename T_scale >
return_type< T_y, T_dof,
+T_scale >::type 
stan::prob::scaled_inv_chi_square_log (const T_y &y, const T_dof &nu, const T_scale &s)
 
template<typename T_y , typename T_dof , typename T_scale >
return_type< T_y, T_dof,
+T_scale >::type 
stan::prob::scaled_inv_chi_square_cdf (const T_y &y, const T_dof &nu, const T_scale &s)
 The CDF of a scaled inverse chi-squared density for y with the specified degrees of freedom parameter and scale parameter.
 
template<typename T_y , typename T_dof , typename T_scale >
return_type< T_y, T_dof,
+T_scale >::type 
stan::prob::scaled_inv_chi_square_cdf_log (const T_y &y, const T_dof &nu, const T_scale &s)
 
template<typename T_y , typename T_dof , typename T_scale >
return_type< T_y, T_dof,
+T_scale >::type 
stan::prob::scaled_inv_chi_square_ccdf_log (const T_y &y, const T_dof &nu, const T_scale &s)
 
template<class RNG >
double stan::prob::scaled_inv_chi_square_rng (const double nu, const double s, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/scaled__inv__chi__square_8hpp_source.html b/doc/api/html/scaled__inv__chi__square_8hpp_source.html new file mode 100644 index 00000000000..a8a9f182519 --- /dev/null +++ b/doc/api/html/scaled__inv__chi__square_8hpp_source.html @@ -0,0 +1,670 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/scaled_inv_chi_square.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
scaled_inv_chi_square.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS__SCALED_INV_CHI_SQUARE_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS__SCALED_INV_CHI_SQUARE_HPP__
+
3 
+
4 #include <boost/random/chi_squared_distribution.hpp>
+
5 #include <boost/random/variate_generator.hpp>
+
6 
+ + + + + + +
13 #include <stan/meta/traits.hpp>
+
14 #include <stan/prob/constants.hpp>
+
15 #include <stan/prob/traits.hpp>
+ +
17 
+
18 namespace stan {
+
19 
+
20  namespace prob {
+
21 
+
41  template <bool propto,
+
42  typename T_y, typename T_dof, typename T_scale>
+
43  typename return_type<T_y,T_dof,T_scale>::type
+
44  scaled_inv_chi_square_log(const T_y& y, const T_dof& nu, const T_scale& s) {
+
45  static const char* function
+
46  = "stan::prob::scaled_inv_chi_square_log(%1%)";
+
47 
+ + + + + +
53 
+
54  // check if any vectors are zero length
+
55  if (!(stan::length(y)
+
56  && stan::length(nu)
+
57  && stan::length(s)))
+
58  return 0.0;
+
59 
+
60  double logp(0.0);
+
61  if (!check_not_nan(function, y, "Random variable", &logp))
+
62  return logp;
+
63  if (!check_finite(function, nu, "Degrees of freedom parameter",
+
64  &logp))
+
65  return logp;
+
66  if (!check_positive(function, nu, "Degrees of freedom parameter",
+
67  &logp))
+
68  return logp;
+
69  if (!check_finite(function, s, "Scale parameter", &logp))
+
70  return logp;
+
71  if (!check_positive(function, s, "Scale parameter", &logp))
+
72  return logp;
+
73  if (!(check_consistent_sizes(function,
+
74  y,nu,s,
+
75  "Random variable",
+
76  "Degrees of freedom parameter",
+
77  "Scale parameter",
+
78  &logp)))
+
79  return logp;
+
80 
+
81  // check if no variables are involved and prop-to
+ +
83  return 0.0;
+
84 
+
85  VectorView<const T_y> y_vec(y);
+
86  VectorView<const T_dof> nu_vec(nu);
+ +
88  size_t N = max_size(y, nu, s);
+
89 
+
90  for (size_t n = 0; n < N; n++) {
+
91  if (value_of(y_vec[n]) <= 0)
+
92  return LOG_ZERO;
+
93  }
+
94 
+
95  using boost::math::lgamma;
+ + +
98  using stan::math::square;
+
99 
+ +
101  is_vector<T_dof>::value> half_nu(length(nu));
+
102  for (size_t i = 0; i < length(nu); i++)
+ +
104  half_nu[i] = 0.5 * value_of(nu_vec[i]);
+
105 
+ +
107  is_vector<T_y>::value> log_y(length(y));
+
108  for (size_t i = 0; i < length(y); i++)
+ +
110  log_y[i] = log(value_of(y_vec[i]));
+
111 
+ +
113  is_vector<T_y>::value> inv_y(length(y));
+
114  for (size_t i = 0; i < length(y); i++)
+ +
116  inv_y[i] = 1.0 / value_of(y_vec[i]);
+
117 
+ + +
120  for (size_t i = 0; i < length(s); i++)
+ +
122  log_s[i] = log(value_of(s_vec[i]));
+
123 
+ +
125  is_vector<T_dof>::value> log_half_nu(length(nu));
+ +
127  is_vector<T_dof>::value> lgamma_half_nu(length(nu));
+ +
129  is_vector<T_dof>::value> digamma_half_nu_over_two(length(nu));
+
130  for (size_t i = 0; i < length(nu); i++) {
+ +
132  lgamma_half_nu[i] = lgamma(half_nu[i]);
+ +
134  log_half_nu[i] = log(half_nu[i]);
+ +
136  digamma_half_nu_over_two[i] = digamma(half_nu[i]) * 0.5;
+
137  }
+
138 
+ +
140  operands_and_partials(y, nu, s);
+
141  for (size_t n = 0; n < N; n++) {
+
142  const double s_dbl = value_of(s_vec[n]);
+
143  const double nu_dbl = value_of(nu_vec[n]);
+ +
145  logp += half_nu[n] * log_half_nu[n] - lgamma_half_nu[n];
+ +
147  logp += nu_dbl * log_s[n];
+ +
149  logp -= (half_nu[n]+1.0) * log_y[n];
+ +
151  logp -= half_nu[n] * s_dbl*s_dbl * inv_y[n];
+
152 
+ +
154  operands_and_partials.d_x1[n]
+
155  += -(half_nu[n] + 1.0) * inv_y[n]
+
156  + half_nu[n] * s_dbl*s_dbl * inv_y[n]*inv_y[n];
+
157  }
+ +
159  operands_and_partials.d_x2[n]
+
160  += 0.5 * log_half_nu[n] + 0.5
+
161  - digamma_half_nu_over_two[n]
+
162  + log_s[n]
+
163  - 0.5 * log_y[n]
+
164  - 0.5* s_dbl*s_dbl * inv_y[n];
+
165  }
+ +
167  operands_and_partials.d_x3[n]
+
168  += nu_dbl / s_dbl - nu_dbl * inv_y[n] * s_dbl;
+
169  }
+
170  }
+
171  return operands_and_partials.to_var(logp);
+
172  }
+
173 
+
174  template <typename T_y, typename T_dof, typename T_scale>
+
175  inline
+ +
177  scaled_inv_chi_square_log(const T_y& y, const T_dof& nu, const T_scale& s) {
+
178  return scaled_inv_chi_square_log<false>(y,nu,s);
+
179  }
+
180 
+
195  template <typename T_y, typename T_dof, typename T_scale>
+ +
197  scaled_inv_chi_square_cdf(const T_y& y, const T_dof& nu,
+
198  const T_scale& s) {
+
199  // Size checks
+
200  if (!(stan::length(y) && stan::length(nu) && stan::length(s)))
+
201  return 1.0;
+
202 
+
203  static const char* function
+
204  = "stan::prob::scaled_inv_chi_square_cdf(%1%)";
+
205 
+ + + + + +
211  using stan::math::value_of;
+
212 
+
213  double P(1.0);
+
214 
+
215  if (!check_not_nan(function, y, "Random variable", &P))
+
216  return P;
+
217  if (!check_nonnegative(function, y, "Random variable", &P))
+
218  return P;
+
219  if (!check_finite(function, nu, "Degrees of freedom parameter", &P))
+
220  return P;
+
221  if (!check_positive(function, nu, "Degrees of freedom parameter", &P))
+
222  return P;
+
223  if (!check_finite(function, s, "Scale parameter", &P))
+
224  return P;
+
225  if (!check_positive(function, s, "Scale parameter", &P))
+
226  return P;
+
227  if (!(check_consistent_sizes(function, y, nu, s,
+
228  "Random variable",
+
229  "Degrees of freedom parameter",
+
230  "Scale parameter",
+
231  &P)))
+
232  return P;
+
233 
+
234  // Wrap arguments in vectors
+
235  VectorView<const T_y> y_vec(y);
+
236  VectorView<const T_dof> nu_vec(nu);
+
237  VectorView<const T_scale> s_vec(s);
+
238  size_t N = max_size(y, nu, s);
+
239 
+ +
241  operands_and_partials(y, nu, s);
+
242 
+
243  // Explicit return for extreme values
+
244  // The gradients are technically ill-defined, but treated as zero
+
245 
+
246  for (size_t i = 0; i < stan::length(y); i++) {
+
247  if (value_of(y_vec[i]) == 0)
+
248  return operands_and_partials.to_var(0.0);
+
249  }
+
250 
+
251  // Compute CDF and its gradients
+
252  using boost::math::gamma_p_derivative;
+
253  using boost::math::gamma_q;
+
254  using boost::math::digamma;
+
255  using boost::math::tgamma;
+
256 
+
257  // Cache a few expensive function calls if nu is a parameter
+ +
259  is_vector<T_dof>::value> gamma_vec(stan::length(nu));
+ +
261  is_vector<T_dof>::value> digamma_vec(stan::length(nu));
+
262 
+ +
264  for (size_t i = 0; i < stan::length(nu); i++) {
+
265  const double half_nu_dbl = 0.5 * value_of(nu_vec[i]);
+
266  gamma_vec[i] = tgamma(half_nu_dbl);
+
267  digamma_vec[i] = digamma(half_nu_dbl);
+
268  }
+
269  }
+
270 
+
271  // Compute vectorized CDF and gradient
+
272  for (size_t n = 0; n < N; n++) {
+
273 
+
274  // Explicit results for extreme values
+
275  // The gradients are technically ill-defined, but treated as zero
+
276  if (value_of(y_vec[n]) == std::numeric_limits<double>::infinity()) {
+
277  continue;
+
278  }
+
279 
+
280  // Pull out values
+
281  const double y_dbl = value_of(y_vec[n]);
+
282  const double y_inv_dbl = 1.0 / y_dbl;
+
283  const double half_nu_dbl = 0.5 * value_of(nu_vec[n]);
+
284  const double s_dbl = value_of(s_vec[n]);
+
285  const double half_s2_overx_dbl = 0.5 * s_dbl * s_dbl * y_inv_dbl;
+
286  const double half_nu_s2_overx_dbl
+
287  = 2.0 * half_nu_dbl * half_s2_overx_dbl;
+
288 
+
289  // Compute
+
290  const double Pn = gamma_q(half_nu_dbl, half_nu_s2_overx_dbl);
+
291 
+
292  P *= Pn;
+
293 
+ +
295  operands_and_partials.d_x1[n]
+
296  += half_nu_s2_overx_dbl * y_inv_dbl
+
297  * gamma_p_derivative(half_nu_dbl, half_nu_s2_overx_dbl) / Pn;
+
298 
+ +
300  operands_and_partials.d_x2[n]
+
301  += (0.5 * stan::math::gradRegIncGamma(half_nu_dbl,
+
302  half_nu_s2_overx_dbl,
+
303  gamma_vec[n], digamma_vec[n])
+
304  - half_s2_overx_dbl
+
305  * gamma_p_derivative(half_nu_dbl, half_nu_s2_overx_dbl) )
+
306  / Pn;
+
307 
+ +
309  operands_and_partials.d_x3[n]
+
310  += - 2.0 * half_nu_dbl * s_dbl * y_inv_dbl
+
311  * gamma_p_derivative(half_nu_dbl, half_nu_s2_overx_dbl) / Pn;
+
312 
+
313  }
+
314 
+ +
316  for(size_t n = 0; n < stan::length(y); ++n)
+
317  operands_and_partials.d_x1[n] *= P;
+ +
319  for(size_t n = 0; n < stan::length(nu); ++n)
+
320  operands_and_partials.d_x2[n] *= P;
+ +
322  for(size_t n = 0; n < stan::length(s); ++n)
+
323  operands_and_partials.d_x3[n] *= P;
+
324 
+
325  return operands_and_partials.to_var(P);
+
326  }
+
327 
+
328  template <typename T_y, typename T_dof, typename T_scale>
+ +
330  scaled_inv_chi_square_cdf_log(const T_y& y, const T_dof& nu,
+
331  const T_scale& s) {
+
332  // Size checks
+
333  if (!(stan::length(y) && stan::length(nu) && stan::length(s)))
+
334  return 0.0;
+
335 
+
336  static const char* function
+
337  = "stan::prob::scaled_inv_chi_square_cdf_log(%1%)";
+
338 
+ + + + + +
344  using stan::math::value_of;
+
345 
+
346  double P(0.0);
+
347 
+
348  if (!check_not_nan(function, y, "Random variable", &P))
+
349  return P;
+
350  if (!check_nonnegative(function, y, "Random variable", &P))
+
351  return P;
+
352  if (!check_finite(function, nu, "Degrees of freedom parameter", &P))
+
353  return P;
+
354  if (!check_positive(function, nu, "Degrees of freedom parameter", &P))
+
355  return P;
+
356  if (!check_finite(function, s, "Scale parameter", &P))
+
357  return P;
+
358  if (!check_positive(function, s, "Scale parameter", &P))
+
359  return P;
+
360  if (!(check_consistent_sizes(function, y, nu, s,
+
361  "Random variable",
+
362  "Degrees of freedom parameter",
+
363  "Scale parameter",
+
364  &P)))
+
365  return P;
+
366 
+
367  // Wrap arguments in vectors
+
368  VectorView<const T_y> y_vec(y);
+
369  VectorView<const T_dof> nu_vec(nu);
+
370  VectorView<const T_scale> s_vec(s);
+
371  size_t N = max_size(y, nu, s);
+
372 
+ +
374  operands_and_partials(y, nu, s);
+
375 
+
376  // Explicit return for extreme values
+
377  // The gradients are technically ill-defined, but treated as zero
+
378  for (size_t i = 0; i < stan::length(y); i++) {
+
379  if (value_of(y_vec[i]) == 0)
+
380  return operands_and_partials.to_var(stan::math::negative_infinity());
+
381  }
+
382 
+
383  // Compute cdf_log and its gradients
+
384  using boost::math::gamma_p_derivative;
+
385  using boost::math::gamma_q;
+
386  using boost::math::digamma;
+
387  using boost::math::tgamma;
+
388 
+
389  // Cache a few expensive function calls if nu is a parameter
+ +
391  is_vector<T_dof>::value> gamma_vec(stan::length(nu));
+ +
393  is_vector<T_dof>::value> digamma_vec(stan::length(nu));
+
394 
+ +
396  for (size_t i = 0; i < stan::length(nu); i++) {
+
397  const double half_nu_dbl = 0.5 * value_of(nu_vec[i]);
+
398  gamma_vec[i] = tgamma(half_nu_dbl);
+
399  digamma_vec[i] = digamma(half_nu_dbl);
+
400  }
+
401  }
+
402 
+
403  // Compute vectorized cdf_log and gradient
+
404  for (size_t n = 0; n < N; n++) {
+
405 
+
406  // Explicit results for extreme values
+
407  // The gradients are technically ill-defined, but treated as zero
+
408  if (value_of(y_vec[n]) == std::numeric_limits<double>::infinity()) {
+
409  continue;
+
410  }
+
411 
+
412  // Pull out values
+
413  const double y_dbl = value_of(y_vec[n]);
+
414  const double y_inv_dbl = 1.0 / y_dbl;
+
415  const double half_nu_dbl = 0.5 * value_of(nu_vec[n]);
+
416  const double s_dbl = value_of(s_vec[n]);
+
417  const double half_s2_overx_dbl = 0.5 * s_dbl * s_dbl * y_inv_dbl;
+
418  const double half_nu_s2_overx_dbl
+
419  = 2.0 * half_nu_dbl * half_s2_overx_dbl;
+
420 
+
421  // Compute
+
422  const double Pn = gamma_q(half_nu_dbl, half_nu_s2_overx_dbl);
+
423 
+
424  P += log(Pn);
+
425 
+ +
427  operands_and_partials.d_x1[n]
+
428  += half_nu_s2_overx_dbl * y_inv_dbl
+
429  * gamma_p_derivative(half_nu_dbl, half_nu_s2_overx_dbl) / Pn;
+ +
431  operands_and_partials.d_x2[n]
+
432  += (0.5 * stan::math::gradRegIncGamma(half_nu_dbl,
+
433  half_nu_s2_overx_dbl,
+
434  gamma_vec[n], digamma_vec[n])
+
435  - half_s2_overx_dbl
+
436  * gamma_p_derivative(half_nu_dbl, half_nu_s2_overx_dbl) )
+
437  / Pn;
+ +
439  operands_and_partials.d_x3[n]
+
440  += - 2.0 * half_nu_dbl * s_dbl * y_inv_dbl
+
441  * gamma_p_derivative(half_nu_dbl, half_nu_s2_overx_dbl) / Pn;
+
442  }
+
443 
+
444  return operands_and_partials.to_var(P);
+
445  }
+
446 
+
447  template <typename T_y, typename T_dof, typename T_scale>
+ +
449  scaled_inv_chi_square_ccdf_log(const T_y& y, const T_dof& nu,
+
450  const T_scale& s) {
+
451  // Size checks
+
452  if (!(stan::length(y) && stan::length(nu) && stan::length(s)))
+
453  return 0.0;
+
454 
+
455  static const char* function
+
456  = "stan::prob::scaled_inv_chi_square_ccdf_log(%1%)";
+
457 
+ + + + + +
463  using stan::math::value_of;
+
464 
+
465  double P(0.0);
+
466 
+
467  if (!check_not_nan(function, y, "Random variable", &P))
+
468  return P;
+
469  if (!check_nonnegative(function, y, "Random variable", &P))
+
470  return P;
+
471  if (!check_finite(function, nu, "Degrees of freedom parameter", &P))
+
472  return P;
+
473  if (!check_positive(function, nu, "Degrees of freedom parameter", &P))
+
474  return P;
+
475  if (!check_finite(function, s, "Scale parameter", &P))
+
476  return P;
+
477  if (!check_positive(function, s, "Scale parameter", &P))
+
478  return P;
+
479  if (!(check_consistent_sizes(function, y, nu, s,
+
480  "Random variable",
+
481  "Degrees of freedom parameter",
+
482  "Scale parameter",
+
483  &P)))
+
484  return P;
+
485 
+
486  // Wrap arguments in vectors
+
487  VectorView<const T_y> y_vec(y);
+
488  VectorView<const T_dof> nu_vec(nu);
+
489  VectorView<const T_scale> s_vec(s);
+
490  size_t N = max_size(y, nu, s);
+
491 
+ +
493  operands_and_partials(y, nu, s);
+
494 
+
495  // Explicit return for extreme values
+
496  // The gradients are technically ill-defined, but treated as zero
+
497  for (size_t i = 0; i < stan::length(y); i++) {
+
498  if (value_of(y_vec[i]) == 0)
+
499  return operands_and_partials.to_var(0.0);
+
500  }
+
501 
+
502  // Compute cdf_log and its gradients
+
503  using boost::math::gamma_p_derivative;
+
504  using boost::math::gamma_q;
+
505  using boost::math::digamma;
+
506  using boost::math::tgamma;
+
507 
+
508  // Cache a few expensive function calls if nu is a parameter
+ +
510  is_vector<T_dof>::value> gamma_vec(stan::length(nu));
+ +
512  is_vector<T_dof>::value> digamma_vec(stan::length(nu));
+
513 
+ +
515  for (size_t i = 0; i < stan::length(nu); i++) {
+
516  const double half_nu_dbl = 0.5 * value_of(nu_vec[i]);
+
517  gamma_vec[i] = tgamma(half_nu_dbl);
+
518  digamma_vec[i] = digamma(half_nu_dbl);
+
519  }
+
520  }
+
521 
+
522  // Compute vectorized cdf_log and gradient
+
523  for (size_t n = 0; n < N; n++) {
+
524 
+
525  // Explicit results for extreme values
+
526  // The gradients are technically ill-defined, but treated as zero
+
527  if (value_of(y_vec[n]) == std::numeric_limits<double>::infinity()) {
+
528  return operands_and_partials.to_var(stan::math::negative_infinity());
+
529  }
+
530 
+
531  // Pull out values
+
532  const double y_dbl = value_of(y_vec[n]);
+
533  const double y_inv_dbl = 1.0 / y_dbl;
+
534  const double half_nu_dbl = 0.5 * value_of(nu_vec[n]);
+
535  const double s_dbl = value_of(s_vec[n]);
+
536  const double half_s2_overx_dbl = 0.5 * s_dbl * s_dbl * y_inv_dbl;
+
537  const double half_nu_s2_overx_dbl
+
538  = 2.0 * half_nu_dbl * half_s2_overx_dbl;
+
539 
+
540  // Compute
+
541  const double Pn = 1.0 - gamma_q(half_nu_dbl, half_nu_s2_overx_dbl);
+
542 
+
543  P += log(Pn);
+
544 
+ +
546  operands_and_partials.d_x1[n]
+
547  -= half_nu_s2_overx_dbl * y_inv_dbl
+
548  * gamma_p_derivative(half_nu_dbl, half_nu_s2_overx_dbl) / Pn;
+ +
550  operands_and_partials.d_x2[n]
+
551  -= (0.5 * stan::math::gradRegIncGamma(half_nu_dbl,
+
552  half_nu_s2_overx_dbl,
+
553  gamma_vec[n], digamma_vec[n])
+
554  - half_s2_overx_dbl
+
555  * gamma_p_derivative(half_nu_dbl, half_nu_s2_overx_dbl) )
+
556  / Pn;
+ +
558  operands_and_partials.d_x3[n]
+
559  += 2.0 * half_nu_dbl * s_dbl * y_inv_dbl
+
560  * gamma_p_derivative(half_nu_dbl, half_nu_s2_overx_dbl) / Pn;
+
561  }
+
562 
+
563  return operands_and_partials.to_var(P);
+
564  }
+
565 
+
566  template <class RNG>
+
567  inline double
+
568  scaled_inv_chi_square_rng(const double nu,
+
569  const double s,
+
570  RNG& rng) {
+
571  using boost::variate_generator;
+
572  using boost::random::chi_squared_distribution;
+
573 
+
574  static const char* function
+
575  = "stan::prob::scaled_inv_chi_square_rng(%1%)";
+
576 
+ + +
579 
+
580  if (!check_finite(function, nu, "Degrees of freedom parameter"))
+
581  return 0;
+
582  if (!check_positive(function, nu, "Degrees of freedom parameter"))
+
583  return 0;
+
584  if (!check_finite(function, s, "Scale parameter"))
+
585  return 0;
+
586  if (!check_positive(function, s, "Scale parameter"))
+
587  return 0;
+
588 
+
589  variate_generator<RNG&, chi_squared_distribution<> >
+
590  chi_square_rng(rng, chi_squared_distribution<>(nu));
+
591  return nu * s / chi_square_rng();
+
592  }
+
593  }
+
594 }
+
595 #endif
+
596 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/search/all_5f.html b/doc/api/html/search/all_5f.html new file mode 100644 index 00000000000..1f27755abcc --- /dev/null +++ b/doc/api/html/search/all_5f.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/all_5f.js b/doc/api/html/search/all_5f.js new file mode 100644 index 00000000000..359bb2fa4f3 --- /dev/null +++ b/doc/api/html/search/all_5f.js @@ -0,0 +1,98 @@ +var searchData= +[ + ['_5f_5fstan_5f_5fagrad_5f_5frev_5f_5fvar_5fstack_5fcpp_5f_5f',['__STAN__AGRAD__REV__VAR_STACK_CPP__',['../var__stack_8cpp.html#a3ecef594fdb031601452cf4e8ab29953',1,'var_stack.cpp']]], + ['_5f_5fstan_5f_5fgm_5f_5fast_5fdef_5fhpp_5f_5f',['__STAN__GM__AST_DEF_HPP__',['../ast__def_8cpp.html#a8d8277f93d7f31b96e2609f6388d6409',1,'ast_def.cpp']]], + ['_5fadapt_5fbase_5fwindow',['_adapt_base_window',['../classstan_1_1mcmc_1_1windowed__adaptation.html#ae25e5dc1480c6e553d65e24beb964dec',1,'stan::mcmc::windowed_adaptation']]], + ['_5fadapt_5fflag',['_adapt_flag',['../classstan_1_1mcmc_1_1base__adapter.html#aef437ec008b42d9364f0165bd783a4de',1,'stan::mcmc::base_adapter']]], + ['_5fadapt_5finit_5fbuffer',['_adapt_init_buffer',['../classstan_1_1mcmc_1_1windowed__adaptation.html#a7a79530d16f82b9d8beb0961b4bb1018',1,'stan::mcmc::windowed_adaptation']]], + ['_5fadapt_5fnext_5fwindow',['_adapt_next_window',['../classstan_1_1mcmc_1_1windowed__adaptation.html#a0b3771ea39bc3fd60c43aea960b2df98',1,'stan::mcmc::windowed_adaptation']]], + ['_5fadapt_5fterm_5fbuffer',['_adapt_term_buffer',['../classstan_1_1mcmc_1_1windowed__adaptation.html#a81191d64fdfb010c997a538d479a270a',1,'stan::mcmc::windowed_adaptation']]], + ['_5fadapt_5fwindow_5fcounter',['_adapt_window_counter',['../classstan_1_1mcmc_1_1windowed__adaptation.html#ab589266e966065c3088e6b02c73ad1e3',1,'stan::mcmc::windowed_adaptation']]], + ['_5fadapt_5fwindow_5fsize',['_adapt_window_size',['../classstan_1_1mcmc_1_1windowed__adaptation.html#a9b669ff236cb187f69901064ce4835d3',1,'stan::mcmc::windowed_adaptation']]], + ['_5fadjaref',['_adjARef',['../agrad_2rev_2matrix_2determinant_8hpp.html#ac289fdc094f4376437157416320ac3bd',1,'_adjARef(): determinant.hpp'],['../agrad_2rev_2matrix_2log__determinant_8hpp.html#ac289fdc094f4376437157416320ac3bd',1,'_adjARef(): log_determinant.hpp'],['../agrad_2rev_2matrix_2log__determinant__spd_8hpp.html#ac289fdc094f4376437157416320ac3bd',1,'_adjARef(): log_determinant_spd.hpp']]], + ['_5falloc',['_alloc',['../classstan_1_1math_1_1_l_d_l_t__factor_3_01stan_1_1agrad_1_1var_00_01_r_00_01_c_01_4.html#ac161188fa80c04c2affb499c81e8b3bd',1,'stan::math::LDLT_factor< stan::agrad::var, R, C >::_alloc()'],['../agrad_2rev_2matrix_2ldlt_8hpp.html#ac8fd1d052b1749cdac48e692c69b01e4',1,'_alloc(): ldlt.hpp'],['../agrad_2rev_2matrix_2log__determinant__spd_8hpp.html#a6a66022aa2c567d6be6ecc6a4818e36d',1,'_alloc(): log_determinant_spd.hpp'],['../agrad_2rev_2matrix_2mdivide__left__spd_8hpp.html#af33a1ef9d6061ad644079483e4811d9c',1,'_alloc(): mdivide_left_spd.hpp']]], + ['_5falloc_5fldlt',['_alloc_ldlt',['../agrad_2rev_2matrix_2ldlt_8hpp.html#acb7147b3011bb4bb4d08ed4da2dd9ed6',1,'ldlt.hpp']]], + ['_5falpha',['_alpha',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#ad45ecfae1cf522aeccd74690e3ca5ab1',1,'stan::optimization::BFGSMinimizer']]], + ['_5falpha0',['_alpha0',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#ace039fd8789a6eba09a0fbc15584f003',1,'stan::optimization::BFGSMinimizer']]], + ['_5falphak_5f1',['_alphak_1',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#afc093ad16e0b1c8668463303ccc03429',1,'stan::optimization::BFGSMinimizer']]], + ['_5farguments',['_arguments',['../classstan_1_1gm_1_1argument__parser.html#a123bcf0183cb6bbe71068ff187a67e67',1,'stan::gm::argument_parser::_arguments()'],['../classstan_1_1gm_1_1argument__probe.html#a92cda768d0cd100860a9de7e3b1b6838',1,'stan::gm::argument_probe::_arguments()']]], + ['_5fbad_5fvalue',['_bad_value',['../classstan_1_1gm_1_1singleton__argument.html#a6c77999833a1f8e580fb13f76af3c4be',1,'stan::gm::singleton_argument']]], + ['_5fcols',['_cols',['../agrad_2rev_2matrix_2determinant_8hpp.html#a9c07cb6acc3ea9dc957ef6874d075e7b',1,'_cols(): determinant.hpp'],['../agrad_2rev_2matrix_2log__determinant_8hpp.html#a9c07cb6acc3ea9dc957ef6874d075e7b',1,'_cols(): log_determinant.hpp'],['../agrad_2rev_2matrix_2log__determinant__spd_8hpp.html#a9c07cb6acc3ea9dc957ef6874d075e7b',1,'_cols(): log_determinant_spd.hpp']]], + ['_5fconstrained',['_constrained',['../classstan_1_1gm_1_1singleton__argument.html#a3fb0b88831bbc32580be800e735654ef',1,'stan::gm::singleton_argument']]], + ['_5fcounter',['_counter',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#ade5951f7ef5e42f0571838b2932408ee',1,'stan::mcmc::stepsize_adaptation']]], + ['_5fcovar_5fadaptation',['_covar_adaptation',['../classstan_1_1mcmc_1_1stepsize__covar__adapter.html#a81e2e0c870bf71ae803ed7bc29e7c10d',1,'stan::mcmc::stepsize_covar_adapter']]], + ['_5fcursor',['_cursor',['../classstan_1_1gm_1_1list__argument.html#ad55e26c7c3dad56b1755e7ff48ad105a',1,'stan::gm::list_argument']]], + ['_5fdefault',['_default',['../classstan_1_1gm_1_1valued__argument.html#abca552e2f3f5a60700aef0fb4b7e2982',1,'stan::gm::valued_argument']]], + ['_5fdefault_5fcursor',['_default_cursor',['../classstan_1_1gm_1_1list__argument.html#ad83ee16d6f572997bd75a2e573ebad6b',1,'stan::gm::list_argument']]], + ['_5fdefault_5fvalue',['_default_value',['../classstan_1_1gm_1_1singleton__argument.html#a09f10b878343aa0cce9e33a5cf7f8032',1,'stan::gm::singleton_argument']]], + ['_5fdelta',['_delta',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#adceaf56188458666a1d2c9e390f03a74',1,'stan::mcmc::stepsize_adaptation']]], + ['_5fdepth',['_depth',['../classstan_1_1mcmc_1_1base__nuts.html#acb7e67dd254cab229429fcead7f18248',1,'stan::mcmc::base_nuts']]], + ['_5fdescription',['_description',['../classstan_1_1gm_1_1argument.html#aa0d6c7ba1141afefb7e78b829bc556a7',1,'stan::gm::argument']]], + ['_5fepsilon',['_epsilon',['../classstan_1_1mcmc_1_1base__hmc.html#a0d4321fe558ad0295196d79c5525a777',1,'stan::mcmc::base_hmc']]], + ['_5fepsilon_5fjitter',['_epsilon_jitter',['../classstan_1_1mcmc_1_1base__hmc.html#a1eb0217fe58fa1a2e4d0691831f062d6',1,'stan::mcmc::base_hmc']]], + ['_5ferr_5fstream',['_err_stream',['../classstan_1_1mcmc_1_1base__mcmc.html#a38c1899ffa57046d3da3ac5496ac4a8e',1,'stan::mcmc::base_mcmc::_err_stream()'],['../classstan_1_1mcmc_1_1base__hamiltonian.html#a7db84e905cea2560e6a223656594c393',1,'stan::mcmc::base_hamiltonian::_err_stream()']]], + ['_5festimator',['_estimator',['../classstan_1_1mcmc_1_1covar__adaptation.html#a58ed3f592a8a0ef46f440c9174ec439d',1,'stan::mcmc::covar_adaptation::_estimator()'],['../classstan_1_1mcmc_1_1var__adaptation.html#ac7cca0e0ab1286b812f2d890049a09e4',1,'stan::mcmc::var_adaptation::_estimator()']]], + ['_5festimator_5fname',['_estimator_name',['../classstan_1_1mcmc_1_1windowed__adaptation.html#a3a5f0f2df10b1e0e5431a97d9edc0a83',1,'stan::mcmc::windowed_adaptation']]], + ['_5ffast_5fmatrix_5fcopy',['_fast_matrix_copy',['../classstan_1_1mcmc_1_1ps__point.html#aa701eacefbab10b9cac8273267bbf39d',1,'stan::mcmc::ps_point']]], + ['_5ffast_5fvector_5fcopy',['_fast_vector_copy',['../classstan_1_1mcmc_1_1ps__point.html#a685e73353f2931b3afbfccd4acbe598d',1,'stan::mcmc::ps_point']]], + ['_5ffk',['_fk',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a75288a0a0783ca985d0539f82a47a800',1,'stan::optimization::BFGSMinimizer']]], + ['_5ffk_5f1',['_fk_1',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a244de3265b928cb15d10069931641a83',1,'stan::optimization::BFGSMinimizer']]], + ['_5ffunc',['_func',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a02a192467c7706cf70db60141a3615f6',1,'stan::optimization::BFGSMinimizer']]], + ['_5fgamma',['_gamma',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#a4747f034cf8440b500e76aada963ab41',1,'stan::mcmc::stepsize_adaptation']]], + ['_5fgk',['_gk',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a8bf1d09f17e9a5665d3dcc821f153d33',1,'stan::optimization::BFGSMinimizer']]], + ['_5fgk_5f1',['_gk_1',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#aef94fd725067fd7fede3bc48a3b62c7b',1,'stan::optimization::BFGSMinimizer']]], + ['_5fgood_5fvalue',['_good_value',['../classstan_1_1gm_1_1singleton__argument.html#a69fa41809718b5093ddff19c515beeee',1,'stan::gm::singleton_argument']]], + ['_5fhamiltonian',['_hamiltonian',['../classstan_1_1mcmc_1_1base__hmc.html#a1181763cca26e4cde7db08023709bceb',1,'stan::mcmc::base_hmc']]], + ['_5fhelp_5fflag',['_help_flag',['../classstan_1_1gm_1_1argument__parser.html#a8756ce3f3d1e6a9ee3076439d5af15a7',1,'stan::gm::argument_parser']]], + ['_5fimpl',['_impl',['../agrad_2rev_2matrix_2ldlt_8hpp.html#ab89158b8e67137e7d7693f9d285e6a6b',1,'_impl(): ldlt.hpp'],['../agrad_2rev_2matrix_2quad__form_8hpp.html#aba5296c623c71f7372cb23517d7a9cfa',1,'_impl(): quad_form.hpp'],['../agrad_2rev_2matrix_2trace__gen__quad__form_8hpp.html#afd17a8260936f41e3700b767282501fa',1,'_impl(): trace_gen_quad_form.hpp'],['../agrad_2rev_2matrix_2trace__quad__form_8hpp.html#a0b5bde925768070ceaa12322cd5da836',1,'_impl(): trace_quad_form.hpp']]], + ['_5fintegrator',['_integrator',['../classstan_1_1mcmc_1_1base__hmc.html#a2f9b84971fc6b6ef1e46ff480b514240',1,'stan::mcmc::base_hmc']]], + ['_5finva',['_invA',['../agrad_2rev_2matrix_2log__determinant__spd_8hpp.html#ac62e1300d96ac0909e7fe11f8d8166ef',1,'log_determinant_spd.hpp']]], + ['_5fis_5fpresent',['_is_present',['../classstan_1_1gm_1_1unvalued__argument.html#a6b227464109b7ecf60f8a9093b92ee50',1,'stan::gm::unvalued_argument']]], + ['_5fitnum',['_itNum',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a6a7e635b790a21bf66419b240c08936f',1,'stan::optimization::BFGSMinimizer']]], + ['_5fkappa',['_kappa',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#abfa89219ff2a4b2895627b305fa9f83e',1,'stan::mcmc::stepsize_adaptation']]], + ['_5fldlt',['_ldlt',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a8b5218fc992daacb2748f6ea34a437b6',1,'stan::optimization::BFGSMinimizer::_ldlt()'],['../agrad_2rev_2matrix_2ldlt_8hpp.html#a8ff5c08d7409eec748e7d3c88ec37eda',1,'_ldlt(): ldlt.hpp']]], + ['_5fldltp',['_ldltP',['../classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4.html#aa41484403512f2b107922d0d7fc5c63d',1,'stan::math::LDLT_factor< double, R, C >::_ldltP()'],['../agrad_2rev_2matrix_2ldlt_8hpp.html#a65ac506e2dfa234b42d90ed38b481b50',1,'_ldltP(): ldlt.hpp']]], + ['_5fllt',['_llt',['../agrad_2rev_2matrix_2mdivide__left__spd_8hpp.html#a9443c5162b5e88a4425734a7c46ed32a',1,'mdivide_left_spd.hpp']]], + ['_5fm',['_m',['../classstan_1_1prob_1_1welford__covar__estimator.html#a7cb4d78c9a9496b27f719eb93c56436d',1,'stan::prob::welford_covar_estimator::_m()'],['../classstan_1_1prob_1_1welford__var__estimator.html#a97a3e57c6fd9781409f061b9f2937284',1,'stan::prob::welford_var_estimator::_m()']]], + ['_5fm2',['_m2',['../classstan_1_1prob_1_1welford__covar__estimator.html#a9ebe972e6e8ea3e680031c36f59bc3c5',1,'stan::prob::welford_covar_estimator::_m2()'],['../classstan_1_1prob_1_1welford__var__estimator.html#aa805b2a914cff1c8326b2b9037cdbcec',1,'stan::prob::welford_var_estimator::_m2()']]], + ['_5fmax_5fdelta',['_max_delta',['../classstan_1_1mcmc_1_1base__nuts.html#a32c5b1250b06867e5bfad17cb33943b7',1,'stan::mcmc::base_nuts']]], + ['_5fmax_5fdepth',['_max_depth',['../classstan_1_1mcmc_1_1base__nuts.html#aca7e01df1dadea953191cb0818e45e2f',1,'stan::mcmc::base_nuts']]], + ['_5fmethod_5fflag',['_method_flag',['../classstan_1_1gm_1_1argument__parser.html#a0d7e3677a25c3602d9491c5876cb398c',1,'stan::gm::argument_parser']]], + ['_5fmodel',['_model',['../classstan_1_1mcmc_1_1base__hamiltonian.html#a7c187e854abd5b0aca8726cbfab86a21',1,'stan::mcmc::base_hamiltonian']]], + ['_5fmu',['_mu',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#a3ba1ba74a735ae0c6826b49e7bd284df',1,'stan::mcmc::stepsize_adaptation']]], + ['_5fn_5fdivergent',['_n_divergent',['../classstan_1_1mcmc_1_1base__nuts.html#a103b33df985e433f37a56ee0626a7861',1,'stan::mcmc::base_nuts']]], + ['_5fname',['_name',['../classstan_1_1gm_1_1argument.html#a23946e8de0291c9868b0e5430ff71cf0',1,'stan::gm::argument::_name()'],['../classstan_1_1mcmc_1_1base__mcmc.html#ad2c7124c9b80002735c5db2b7aecf482',1,'stan::mcmc::base_mcmc::_name()']]], + ['_5fnom_5fepsilon',['_nom_epsilon',['../classstan_1_1mcmc_1_1base__hmc.html#a514b2e6f2d9481218709b1a16747f8a6',1,'stan::mcmc::base_hmc']]], + ['_5fnote',['_note',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a85128ba7124ddd7e9e604df71a9c71c5',1,'stan::optimization::BFGSMinimizer']]], + ['_5fnum_5fsamples',['_num_samples',['../classstan_1_1prob_1_1welford__covar__estimator.html#ac3239162bce3b35ff653b8072aa8e7e3',1,'stan::prob::welford_covar_estimator::_num_samples()'],['../classstan_1_1prob_1_1welford__var__estimator.html#a8b378660396e184e69b5cd7152f4e094',1,'stan::prob::welford_var_estimator::_num_samples()']]], + ['_5fnum_5fwarmup',['_num_warmup',['../classstan_1_1mcmc_1_1windowed__adaptation.html#a49833a6e927a0e7dec9a82d756626e16',1,'stan::mcmc::windowed_adaptation']]], + ['_5fopts',['_opts',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a2f69cfce2ab1a2004dd6687df21b565a',1,'stan::optimization::BFGSMinimizer']]], + ['_5fout_5fstream',['_out_stream',['../classstan_1_1mcmc_1_1base__mcmc.html#ab021a0550faee8630a30990d7ebf7b88',1,'stan::mcmc::base_mcmc::_out_stream()'],['../classstan_1_1mcmc_1_1base__integrator.html#a4cc219f3069be428aa6a74c01d08d333',1,'stan::mcmc::base_integrator::_out_stream()']]], + ['_5frand_5fint',['_rand_int',['../classstan_1_1mcmc_1_1base__hmc.html#a06d0bc3d17266ca80823487f6a6e1180',1,'stan::mcmc::base_hmc']]], + ['_5frand_5funiform',['_rand_uniform',['../classstan_1_1mcmc_1_1base__hmc.html#a5970ff139255992393ebd05cd8cc68f0',1,'stan::mcmc::base_hmc']]], + ['_5frows',['_rows',['../agrad_2rev_2matrix_2determinant_8hpp.html#a3e8959363f536b448785cdfdb1dd461a',1,'_rows(): determinant.hpp'],['../agrad_2rev_2matrix_2log__determinant_8hpp.html#a3e8959363f536b448785cdfdb1dd461a',1,'_rows(): log_determinant.hpp'],['../agrad_2rev_2matrix_2log__determinant__spd_8hpp.html#a3e8959363f536b448785cdfdb1dd461a',1,'_rows(): log_determinant_spd.hpp']]], + ['_5fs_5fbar',['_s_bar',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#a0a3fe27836b539b99e81b5ba3b7e36e1',1,'stan::mcmc::stepsize_adaptation']]], + ['_5fsk',['_sk',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a7cef3ef923dfd139bb8bb6990b6d47f1',1,'stan::optimization::BFGSMinimizer']]], + ['_5fsk_5f1',['_sk_1',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a972b1176a858cd4c3209c6d1629953af',1,'stan::optimization::BFGSMinimizer']]], + ['_5fstepsize_5fadaptation',['_stepsize_adaptation',['../classstan_1_1mcmc_1_1stepsize__adapter.html#a560cd9f56401167b284e7eb36e58cbec',1,'stan::mcmc::stepsize_adapter::_stepsize_adaptation()'],['../classstan_1_1mcmc_1_1stepsize__covar__adapter.html#a50045d3383df82e4c3dda971ed0ddf38',1,'stan::mcmc::stepsize_covar_adapter::_stepsize_adaptation()'],['../classstan_1_1mcmc_1_1stepsize__var__adapter.html#aed1abeb55985ad65b435e7a7ced9d4d5',1,'stan::mcmc::stepsize_var_adapter::_stepsize_adaptation()']]], + ['_5fsubarguments',['_subarguments',['../classstan_1_1gm_1_1categorical__argument.html#ae906b6761d356c568023f68020647240',1,'stan::gm::categorical_argument']]], + ['_5fsym',['_sym',['../agrad_2rev_2matrix_2quad__form_8hpp.html#a0f0c3a82aa9cb1ecd7d97fce67fea63d',1,'quad_form.hpp']]], + ['_5ft0',['_t0',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#a9343ca729fb8566cde5b102d391d7003',1,'stan::mcmc::stepsize_adaptation']]], + ['_5fupdate_5fl',['_update_L',['../classstan_1_1mcmc_1_1base__static__hmc.html#a99f17a731044a9880298f5e254b94a69',1,'stan::mcmc::base_static_hmc']]], + ['_5fvalidity',['_validity',['../classstan_1_1gm_1_1singleton__argument.html#a74d2460a6fd7de8d3d05b191856f5468',1,'stan::gm::singleton_argument']]], + ['_5fvalue',['_value',['../classstan_1_1gm_1_1singleton__argument.html#a841db6c125379f5a359f3049f532f53b',1,'stan::gm::singleton_argument::_value()'],['../agrad_2rev_2matrix_2ldlt_8hpp.html#a3e78e92b9e102f837e1433ff78edd53c',1,'_value(): ldlt.hpp']]], + ['_5fvalue_5ftype',['_value_type',['../classstan_1_1gm_1_1valued__argument.html#a8a47f35a2b7426e96bbed0739714b767',1,'stan::gm::valued_argument']]], + ['_5fvalues',['_values',['../classstan_1_1gm_1_1list__argument.html#a784a4d1f183a4404936d25136e27b0f7',1,'stan::gm::list_argument']]], + ['_5fvar_5fadaptation',['_var_adaptation',['../classstan_1_1mcmc_1_1stepsize__var__adapter.html#a4b0e0a10b281ecbc17a22731cabd5032',1,'stan::mcmc::stepsize_var_adapter']]], + ['_5fvaria',['_variA',['../agrad_2rev_2matrix_2ldlt_8hpp.html#a67f87b0fba11a247523af8e89ea39331',1,'ldlt.hpp']]], + ['_5fvarib',['_variB',['../agrad_2rev_2matrix_2ldlt_8hpp.html#a6d2efaefd09e1eb3e1a9a28f2b3a509b',1,'ldlt.hpp']]], + ['_5fvarid',['_variD',['../agrad_2rev_2matrix_2ldlt_8hpp.html#ad7f5a226630b241aa90441b387c06c41',1,'ldlt.hpp']]], + ['_5fvarirefa',['_variRefA',['../agrad_2rev_2matrix_2mdivide__left_8hpp.html#aea7df605462946b48f6c8200fe67a467',1,'_variRefA(): mdivide_left.hpp'],['../agrad_2rev_2matrix_2mdivide__left__spd_8hpp.html#aea7df605462946b48f6c8200fe67a467',1,'_variRefA(): mdivide_left_spd.hpp'],['../agrad_2rev_2matrix_2mdivide__left__tri_8hpp.html#aea7df605462946b48f6c8200fe67a467',1,'_variRefA(): mdivide_left_tri.hpp']]], + ['_5fvarirefb',['_variRefB',['../agrad_2rev_2matrix_2ldlt_8hpp.html#aa2a293603982ac5da732ef1c85aabcd4',1,'_variRefB(): ldlt.hpp'],['../agrad_2rev_2matrix_2mdivide__left_8hpp.html#aa2a293603982ac5da732ef1c85aabcd4',1,'_variRefB(): mdivide_left.hpp'],['../agrad_2rev_2matrix_2mdivide__left__spd_8hpp.html#aa2a293603982ac5da732ef1c85aabcd4',1,'_variRefB(): mdivide_left_spd.hpp'],['../agrad_2rev_2matrix_2mdivide__left__tri_8hpp.html#aa2a293603982ac5da732ef1c85aabcd4',1,'_variRefB(): mdivide_left_tri.hpp']]], + ['_5fvarirefc',['_variRefC',['../agrad_2rev_2matrix_2ldlt_8hpp.html#ab81845acdc3a00d1a9358f95da0d560e',1,'_variRefC(): ldlt.hpp'],['../agrad_2rev_2matrix_2mdivide__left_8hpp.html#ab81845acdc3a00d1a9358f95da0d560e',1,'_variRefC(): mdivide_left.hpp'],['../agrad_2rev_2matrix_2mdivide__left__spd_8hpp.html#ab81845acdc3a00d1a9358f95da0d560e',1,'_variRefC(): mdivide_left_spd.hpp'],['../agrad_2rev_2matrix_2mdivide__left__tri_8hpp.html#ab81845acdc3a00d1a9358f95da0d560e',1,'_variRefC(): mdivide_left_tri.hpp']]], + ['_5fwrite_5ferror_5fmsg',['_write_error_msg',['../classstan_1_1mcmc_1_1base__hamiltonian.html#a119fab9e5829911ccfb31a5f7ec1f30b',1,'stan::mcmc::base_hamiltonian']]], + ['_5fx_5fbar',['_x_bar',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#a0091180522b7f03d801a6f8ec46c7f21',1,'stan::mcmc::stepsize_adaptation']]], + ['_5fxk',['_xk',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a6107a86ad15de26b4dd7c8877a892331',1,'stan::optimization::BFGSMinimizer']]], + ['_5fxk_5f1',['_xk_1',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a5659d96d4d5d37d72cb62ab6b747eb7a',1,'stan::optimization::BFGSMinimizer']]], + ['_5fz',['_z',['../classstan_1_1mcmc_1_1base__hmc.html#abaa8c5f40b664481b188c8342f3917db',1,'stan::mcmc::base_hmc']]] +]; diff --git a/doc/api/html/search/all_61.html b/doc/api/html/search/all_61.html new file mode 100644 index 00000000000..a3164d5530c --- /dev/null +++ b/doc/api/html/search/all_61.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/all_61.js b/doc/api/html/search/all_61.js new file mode 100644 index 00000000000..0ab09858885 --- /dev/null +++ b/doc/api/html/search/all_61.js @@ -0,0 +1,293 @@ +var searchData= +[ + ['a_5f',['A_',['../agrad_2rev_2matrix_2determinant_8hpp.html#a11b6b3ab6459db606ab7f4bfd4ad2823',1,'A_(): determinant.hpp'],['../agrad_2rev_2matrix_2log__determinant_8hpp.html#a11b6b3ab6459db606ab7f4bfd4ad2823',1,'A_(): log_determinant.hpp'],['../agrad_2rev_2matrix_2mdivide__left_8hpp.html#a11b6b3ab6459db606ab7f4bfd4ad2823',1,'A_(): mdivide_left.hpp'],['../agrad_2rev_2matrix_2mdivide__left__tri_8hpp.html#a11b6b3ab6459db606ab7f4bfd4ad2823',1,'A_(): mdivide_left_tri.hpp'],['../agrad_2rev_2matrix_2quad__form_8hpp.html#a74fc8e511e9ed21b74f2b3e281ff4c72',1,'A_(): quad_form.hpp'],['../agrad_2rev_2matrix_2trace__gen__quad__form_8hpp.html#a74fc8e511e9ed21b74f2b3e281ff4c72',1,'A_(): trace_gen_quad_form.hpp'],['../agrad_2rev_2matrix_2trace__quad__form_8hpp.html#a74fc8e511e9ed21b74f2b3e281ff4c72',1,'A_(): trace_quad_form.hpp']]], + ['abs',['abs',['../namespacestan_1_1agrad.html#a2d5337cd9cddc3807cb3b3740221ace1',1,'stan::agrad::abs(const var &a)'],['../namespacestan_1_1agrad.html#a16237ddae626928422d7c63f7f02ae6f',1,'stan::agrad::abs(const fvar< T > &x)'],['../namespacestan_1_1math.html#aeb4764556637084eee528b45d8eaa767',1,'stan::math::abs()']]], + ['abs_2ehpp',['abs.hpp',['../agrad_2fwd_2functions_2abs_8hpp.html',1,'']]], + ['abs_2ehpp',['abs.hpp',['../agrad_2rev_2functions_2abs_8hpp.html',1,'']]], + ['abs_2ehpp',['abs.hpp',['../math_2functions_2abs_8hpp.html',1,'']]], + ['accept_5fstat',['accept_stat',['../classstan_1_1mcmc_1_1sample.html#ab427230e7e2d5cb3b541c3b7040d0fb7',1,'stan::mcmc::sample']]], + ['accumulator',['accumulator',['../classstan_1_1math_1_1accumulator.html',1,'stan::math']]], + ['accumulator',['accumulator',['../classstan_1_1math_1_1accumulator.html#afb44f3c753ac1373482e123df612a266',1,'stan::math::accumulator']]], + ['accumulator_2ehpp',['accumulator.hpp',['../accumulator_8hpp.html',1,'']]], + ['acos',['acos',['../namespacestan_1_1agrad.html#a3d7b4b9ba0df66c3ae59a4478fecdc2b',1,'stan::agrad::acos(const var &a)'],['../namespacestan_1_1agrad.html#a8d58f71cd77c7447a63eb336f9b29857',1,'stan::agrad::acos(const fvar< T > &x)']]], + ['acos_2ehpp',['acos.hpp',['../rev_2functions_2acos_8hpp.html',1,'']]], + ['acos_2ehpp',['acos.hpp',['../fwd_2functions_2acos_8hpp.html',1,'']]], + ['acosh',['acosh',['../namespacestan_1_1agrad.html#a7f0ba2a81fb92e3f18d75fd4da3f5b67',1,'stan::agrad::acosh(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#a55d6c606ed591f3aa617ccf6ef912d17',1,'stan::agrad::acosh(const stan::agrad::var &a)']]], + ['acosh_2ehpp',['acosh.hpp',['../fwd_2functions_2acosh_8hpp.html',1,'']]], + ['acosh_2ehpp',['acosh.hpp',['../rev_2functions_2acosh_8hpp.html',1,'']]], + ['ad_5f',['ad_',['../classstan_1_1agrad_1_1op__ddv__vari.html#ab8049b0e5cba4646440a2a1c1cd04df8',1,'stan::agrad::op_ddv_vari::ad_()'],['../classstan_1_1agrad_1_1op__dv__vari.html#ad87be470866f04643d2f34067ae4b772',1,'stan::agrad::op_dv_vari::ad_()'],['../classstan_1_1agrad_1_1op__dvd__vari.html#ab2a01176a41145a445de4a77f2a5e733',1,'stan::agrad::op_dvd_vari::ad_()'],['../classstan_1_1agrad_1_1op__dvv__vari.html#a73736e271f0a642a887c75903729c76d',1,'stan::agrad::op_dvv_vari::ad_()'],['../agrad__thread__safe_8hpp.html#a7e82ab18118812301f1d7f89468aab1f',1,'ad_(): agrad_thread_safe.hpp']]], + ['adapt_5fdense_5fe_5fnuts',['adapt_dense_e_nuts',['../classstan_1_1mcmc_1_1adapt__dense__e__nuts.html',1,'stan::mcmc']]], + ['adapt_5fdense_5fe_5fnuts',['adapt_dense_e_nuts',['../classstan_1_1mcmc_1_1adapt__dense__e__nuts.html#a7f2a7a4f48cbc0f7667f01e9045e069a',1,'stan::mcmc::adapt_dense_e_nuts']]], + ['adapt_5fdense_5fe_5fnuts_2ehpp',['adapt_dense_e_nuts.hpp',['../adapt__dense__e__nuts_8hpp.html',1,'']]], + ['adapt_5fdense_5fe_5fstatic_5fhmc',['adapt_dense_e_static_hmc',['../classstan_1_1mcmc_1_1adapt__dense__e__static__hmc.html#a7d57f187b6877982cf329800e47b5370',1,'stan::mcmc::adapt_dense_e_static_hmc']]], + ['adapt_5fdense_5fe_5fstatic_5fhmc',['adapt_dense_e_static_hmc',['../classstan_1_1mcmc_1_1adapt__dense__e__static__hmc.html',1,'stan::mcmc']]], + ['adapt_5fdense_5fe_5fstatic_5fhmc_2ehpp',['adapt_dense_e_static_hmc.hpp',['../adapt__dense__e__static__hmc_8hpp.html',1,'']]], + ['adapt_5fdiag_5fe_5fnuts',['adapt_diag_e_nuts',['../classstan_1_1mcmc_1_1adapt__diag__e__nuts.html',1,'stan::mcmc']]], + ['adapt_5fdiag_5fe_5fnuts',['adapt_diag_e_nuts',['../classstan_1_1mcmc_1_1adapt__diag__e__nuts.html#a8e2eb81bdeed65fb1cdf8512643c5247',1,'stan::mcmc::adapt_diag_e_nuts']]], + ['adapt_5fdiag_5fe_5fnuts_2ehpp',['adapt_diag_e_nuts.hpp',['../adapt__diag__e__nuts_8hpp.html',1,'']]], + ['adapt_5fdiag_5fe_5fstatic_5fhmc',['adapt_diag_e_static_hmc',['../classstan_1_1mcmc_1_1adapt__diag__e__static__hmc.html',1,'stan::mcmc']]], + ['adapt_5fdiag_5fe_5fstatic_5fhmc',['adapt_diag_e_static_hmc',['../classstan_1_1mcmc_1_1adapt__diag__e__static__hmc.html#a08c8c79cc0a4c5fcfc8a2be30b9ab858',1,'stan::mcmc::adapt_diag_e_static_hmc']]], + ['adapt_5fdiag_5fe_5fstatic_5fhmc_2ehpp',['adapt_diag_e_static_hmc.hpp',['../adapt__diag__e__static__hmc_8hpp.html',1,'']]], + ['adapt_5funit_5fe_5fnuts',['adapt_unit_e_nuts',['../classstan_1_1mcmc_1_1adapt__unit__e__nuts.html#a65a0e3a8ff345164784d1c411c1d685f',1,'stan::mcmc::adapt_unit_e_nuts']]], + ['adapt_5funit_5fe_5fnuts',['adapt_unit_e_nuts',['../classstan_1_1mcmc_1_1adapt__unit__e__nuts.html',1,'stan::mcmc']]], + ['adapt_5funit_5fe_5fnuts_2ehpp',['adapt_unit_e_nuts.hpp',['../adapt__unit__e__nuts_8hpp.html',1,'']]], + ['adapt_5funit_5fe_5fstatic_5fhmc',['adapt_unit_e_static_hmc',['../classstan_1_1mcmc_1_1adapt__unit__e__static__hmc.html#ab6e501da21dace8ba4deb0378df2e74f',1,'stan::mcmc::adapt_unit_e_static_hmc']]], + ['adapt_5funit_5fe_5fstatic_5fhmc',['adapt_unit_e_static_hmc',['../classstan_1_1mcmc_1_1adapt__unit__e__static__hmc.html',1,'stan::mcmc']]], + ['adapt_5funit_5fe_5fstatic_5fhmc_2ehpp',['adapt_unit_e_static_hmc.hpp',['../adapt__unit__e__static__hmc_8hpp.html',1,'']]], + ['adaptation',['adaptation',['../structstan_1_1io_1_1stan__csv.html#aef8315d92141f9f96c832340b7d6553d',1,'stan::io::stan_csv']]], + ['adaptation_5fwindow',['adaptation_window',['../classstan_1_1mcmc_1_1windowed__adaptation.html#a8e82facfbdd25e23a6dc04dfb47f6f55',1,'stan::mcmc::windowed_adaptation']]], + ['adapting',['adapting',['../classstan_1_1mcmc_1_1base__adapter.html#a56b7bacc5a6d31b2e0d0d2dc8f096cb7',1,'stan::mcmc::base_adapter']]], + ['add',['add',['../classstan_1_1gm_1_1function__signatures.html#a2cd5e6592f8f0839d0744d0ac6c889a6',1,'stan::gm::function_signatures::add(const std::string &name, const expr_type &result_type, const std::vector< expr_type > &arg_types)'],['../classstan_1_1gm_1_1function__signatures.html#a155a6d04ca2dd66396558e55afee2ac9',1,'stan::gm::function_signatures::add(const std::string &name, const expr_type &result_type)'],['../classstan_1_1gm_1_1function__signatures.html#a7030b5e710a69202f33055d64f506aac',1,'stan::gm::function_signatures::add(const std::string &name, const expr_type &result_type, const expr_type &arg_type)'],['../classstan_1_1gm_1_1function__signatures.html#aa0947100246ba8239f476a6b337c7a45',1,'stan::gm::function_signatures::add(const std::string &name, const expr_type &result_type, const expr_type &arg_type1, const expr_type &arg_type2)'],['../classstan_1_1gm_1_1function__signatures.html#a827e5f55c134829c58dc20924ba02d8e',1,'stan::gm::function_signatures::add(const std::string &name, const expr_type &result_type, const expr_type &arg_type1, const expr_type &arg_type2, const expr_type &arg_type3)'],['../classstan_1_1gm_1_1function__signatures.html#a029bfb7842b41f1c3cd853ca9806a6c9',1,'stan::gm::function_signatures::add(const std::string &name, const expr_type &result_type, const expr_type &arg_type1, const expr_type &arg_type2, const expr_type &arg_type3, const expr_type &arg_type4)'],['../classstan_1_1gm_1_1function__signatures.html#acb2e2b50157a56f5a924cf9d8c134025',1,'stan::gm::function_signatures::add(const std::string &name, const expr_type &result_type, const expr_type &arg_type1, const expr_type &arg_type2, const expr_type &arg_type3, const expr_type &arg_type4, const expr_type &arg_type5)'],['../classstan_1_1gm_1_1function__signatures.html#a59a3c6beef4febbc41c38a7ed92e4b8a',1,'stan::gm::function_signatures::add(const std::string &name, const expr_type &result_type, const expr_type &arg_type1, const expr_type &arg_type2, const expr_type &arg_type3, const expr_type &arg_type4, const expr_type &arg_type5, const expr_type &arg_type6)'],['../classstan_1_1gm_1_1function__signatures.html#ab8b4feffbf25d433f7f4545a28fed897',1,'stan::gm::function_signatures::add(const std::string &name, const expr_type &result_type, const expr_type &arg_type1, const expr_type &arg_type2, const expr_type &arg_type3, const expr_type &arg_type4, const expr_type &arg_type5, const expr_type &arg_type6, const expr_type &arg_type7)'],['../structstan_1_1gm_1_1variable__map.html#a2a1c8d42745d2ba940577f8f9d4da17e',1,'stan::gm::variable_map::add()'],['../classstan_1_1math_1_1accumulator.html#ad18efaeb75a21c93ea9ca77ca99a8747',1,'stan::math::accumulator::add()'],['../structstan_1_1math_1_1array__builder.html#a085e0190d7a41c4e33bfa9f542b1d62a',1,'stan::math::array_builder::add()'],['../classstan_1_1mcmc_1_1chains.html#af47331852814d5853f769cfb5d71fbe2',1,'stan::mcmc::chains::add(const int chain, const Eigen::MatrixXd &sample)'],['../classstan_1_1mcmc_1_1chains.html#a87a66fd3d8395bd6b44e8e9fba8e4068',1,'stan::mcmc::chains::add(const Eigen::MatrixXd &sample)'],['../classstan_1_1mcmc_1_1chains.html#a0c7ad1958670871f1d080d8feb8233b6',1,'stan::mcmc::chains::add(const stan::io::stan_csv &stan_csv)'],['../namespacestan_1_1math.html#a3d4b97f71328d3de40de286ec6e3754e',1,'stan::math::add(const Eigen::Matrix< T1, R, C > &m1, const Eigen::Matrix< T2, R, C > &m2)'],['../namespacestan_1_1math.html#aa92ade0aeac74c8366b8c210446324a1',1,'stan::math::add(const Eigen::Matrix< T1, R, C > &m, const T2 &c)'],['../namespacestan_1_1math.html#ac4cbcb4a48d3284e93afe13093412683',1,'stan::math::add(const T1 &c, const Eigen::Matrix< T2, R, C > &m)']]], + ['add_2ehpp',['add.hpp',['../add_8hpp.html',1,'']]], + ['add_5fbinary',['add_binary',['../classstan_1_1gm_1_1function__signatures.html#a3cac5b9cb17575d88d76286fcff64344',1,'stan::gm::function_signatures']]], + ['add_5fconditional_5fbody',['add_conditional_body',['../structstan_1_1gm_1_1add__conditional__body.html',1,'stan::gm']]], + ['add_5fconditional_5fbody_5ff',['add_conditional_body_f',['../namespacestan_1_1gm.html#ad78f054e040e1e50bbca1c359bdfb212',1,'stan::gm']]], + ['add_5fconditional_5fcondition',['add_conditional_condition',['../structstan_1_1gm_1_1add__conditional__condition.html',1,'stan::gm']]], + ['add_5fconditional_5fcondition_5ff',['add_conditional_condition_f',['../namespacestan_1_1gm.html#ac933d49bf64b047878de0a9cd6bee469',1,'stan::gm']]], + ['add_5fexpression_5fdimss',['add_expression_dimss',['../structstan_1_1gm_1_1add__expression__dimss.html',1,'stan::gm']]], + ['add_5fexpression_5fdimss_5ff',['add_expression_dimss_f',['../namespacestan_1_1gm.html#a59538d290878f4de9cd33e6d21f57a3c',1,'stan::gm']]], + ['add_5floop_5fidentifier',['add_loop_identifier',['../structstan_1_1gm_1_1add__loop__identifier.html',1,'stan::gm']]], + ['add_5floop_5fidentifier_5ff',['add_loop_identifier_f',['../namespacestan_1_1gm.html#aa52cffaf304fc09f5936e0fe6a708a15',1,'stan::gm']]], + ['add_5fnullary',['add_nullary',['../classstan_1_1gm_1_1function__signatures.html#a5ef070db4552215d2de0ebdcf2298481',1,'stan::gm::function_signatures']]], + ['add_5fquaternary',['add_quaternary',['../classstan_1_1gm_1_1function__signatures.html#a7e6eae9e711df2373c8f624c7d9da53c',1,'stan::gm::function_signatures']]], + ['add_5fsample',['add_sample',['../classstan_1_1prob_1_1welford__covar__estimator.html#a3446b92b64b15d105b399c1723fcad57',1,'stan::prob::welford_covar_estimator::add_sample()'],['../classstan_1_1prob_1_1welford__var__estimator.html#a3706c5c31c545bafd3dee6fa1dcce816',1,'stan::prob::welford_var_estimator::add_sample()']]], + ['add_5fternary',['add_ternary',['../classstan_1_1gm_1_1function__signatures.html#a028061fc0bf4b4842aacd64be3fcc89e',1,'stan::gm::function_signatures']]], + ['add_5funary',['add_unary',['../classstan_1_1gm_1_1function__signatures.html#a9ce2dcdafcd2370053c4eb0c9be10042',1,'stan::gm::function_signatures']]], + ['add_5fvec',['add_vec',['../classstan_1_1io_1_1var__context.html#a4cdc64bb5dbdc26f15885fc34737752e',1,'stan::io::var_context']]], + ['add_5fwhile_5fbody',['add_while_body',['../structstan_1_1gm_1_1add__while__body.html',1,'stan::gm']]], + ['add_5fwhile_5fbody_5ff',['add_while_body_f',['../namespacestan_1_1gm.html#a6cd03a1b864b365878417733f67b523e',1,'stan::gm']]], + ['add_5fwhile_5fcondition',['add_while_condition',['../structstan_1_1gm_1_1add__while__condition.html',1,'stan::gm']]], + ['add_5fwhile_5fcondition_5ff',['add_while_condition_f',['../namespacestan_1_1gm.html#adb748e38743964139413d8a31c622474',1,'stan::gm']]], + ['addcost',['AddCost',['../struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html#a932a61195daad3e89711cfb02521cac9ad567631af797962bfa1646b3228b1d8d',1,'Eigen::NumTraits< stan::agrad::var >']]], + ['addition',['addition',['../namespacestan_1_1gm.html#a66dd9d718181d0b71df757b512a9e7b6',1,'stan::gm']]], + ['addition_5fexpr',['addition_expr',['../structstan_1_1gm_1_1addition__expr.html',1,'stan::gm']]], + ['adj',['adj',['../classstan_1_1agrad_1_1var.html#a44db5cfbac5b6858bc26cbb2518a6826',1,'stan::agrad::var']]], + ['adj_5f',['adj_',['../classstan_1_1agrad_1_1vari.html#a23c19b981f1a4f850e840884b76d08a0',1,'stan::agrad::vari']]], + ['agrad_2ehpp',['agrad.hpp',['../agrad_8hpp.html',1,'']]], + ['agrad_5fthread_5fsafe_2ehpp',['agrad_thread_safe.hpp',['../agrad__thread__safe_8hpp.html',1,'']]], + ['ainvb_5f',['AinvB_',['../agrad_2rev_2matrix_2ldlt_8hpp.html#ab94d72eb089cbdafd7d658f9f21e2749',1,'ldlt.hpp']]], + ['algorithm',['algorithm',['../structstan_1_1io_1_1stan__csv__metadata.html#ade7047cd16512c5a03c4d1dc9b6a3282',1,'stan::io::stan_csv_metadata']]], + ['all_5fconstant',['all_constant',['../structstan_1_1agrad_1_1_operands_and_partials.html#af8cdd957e2c7d02ea713440ae2ff0d5c',1,'stan::agrad::OperandsAndPartials']]], + ['all_5fpartials',['all_partials',['../structstan_1_1agrad_1_1_operands_and_partials.html#a72bcc7c3e6fb628355b1d147660dd1c1',1,'stan::agrad::OperandsAndPartials']]], + ['all_5fvaris',['all_varis',['../structstan_1_1agrad_1_1_operands_and_partials.html#a3af6956efe05f1ae634bcff64224b25f',1,'stan::agrad::OperandsAndPartials']]], + ['alloc',['alloc',['../classstan_1_1memory_1_1chunk__alloc.html#a220d04d5ca74562e28a6c01111d8fd22',1,'stan::memory::chunk_alloc::alloc()'],['../classstan_1_1memory_1_1stack__alloc.html#a90eb1978d8bbc20e4357b1ea2c686f5b',1,'stan::memory::stack_alloc::alloc()']]], + ['alpha',['alpha',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a2efb26e144b4d4d29f982df93e761823',1,'stan::optimization::BFGSMinimizer']]], + ['alpha0',['alpha0',['../structstan_1_1optimization_1_1_b_f_g_s_minimizer_1_1_b_f_g_s_options.html#a07597137b348a11f639d2c9eb9dd7207',1,'stan::optimization::BFGSMinimizer::BFGSOptions::alpha0()'],['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#ae534c5316049196626b103bb461f428c',1,'stan::optimization::BFGSMinimizer::alpha0()']]], + ['alpha_5f',['alpha_',['../_eigen___num_traits_8hpp.html#a1b79ed4274c457ae581283a7fc8e51af',1,'alpha_(): Eigen_NumTraits.hpp'],['../agrad_2rev_2matrix_2log__softmax_8hpp.html#acd28daa1fad3aaa17c91e2ca90526175',1,'alpha_(): log_softmax.hpp'],['../agrad_2rev_2matrix_2softmax_8hpp.html#acd28daa1fad3aaa17c91e2ca90526175',1,'alpha_(): softmax.hpp']]], + ['append_5fsamples',['append_samples',['../structstan_1_1io_1_1stan__csv__metadata.html#a5dd804a343d097dabe18f8a48701accb',1,'stan::io::stan_csv_metadata']]], + ['arg',['arg',['../classstan_1_1gm_1_1argument.html#a30ba1fe18d6f4016b030835969039e9d',1,'stan::gm::argument::arg()'],['../classstan_1_1gm_1_1argument__parser.html#a3e40d509ada7d1ea9def28f819f54ee9',1,'stan::gm::argument_parser::arg()'],['../classstan_1_1gm_1_1categorical__argument.html#a5ae28cffcf6579400a8736fc581c6ab5',1,'stan::gm::categorical_argument::arg()'],['../classstan_1_1gm_1_1list__argument.html#a649267bc16e4863f507aaeecb9cbf2f1',1,'stan::gm::list_argument::arg()']]], + ['arg_5fadapt',['arg_adapt',['../classstan_1_1gm_1_1arg__adapt.html#a7db5d900f8ce94a610cbb2f129d02763',1,'stan::gm::arg_adapt']]], + ['arg_5fadapt',['arg_adapt',['../classstan_1_1gm_1_1arg__adapt.html',1,'stan::gm']]], + ['arg_5fadapt_2ehpp',['arg_adapt.hpp',['../arg__adapt_8hpp.html',1,'']]], + ['arg_5fadapt_5fdelta',['arg_adapt_delta',['../classstan_1_1gm_1_1arg__adapt__delta.html',1,'stan::gm']]], + ['arg_5fadapt_5fdelta',['arg_adapt_delta',['../classstan_1_1gm_1_1arg__adapt__delta.html#ab994caa2d7658bd6548f17b18cd5efaf',1,'stan::gm::arg_adapt_delta']]], + ['arg_5fadapt_5fdelta_2ehpp',['arg_adapt_delta.hpp',['../arg__adapt__delta_8hpp.html',1,'']]], + ['arg_5fadapt_5fengaged',['arg_adapt_engaged',['../classstan_1_1gm_1_1arg__adapt__engaged.html',1,'stan::gm']]], + ['arg_5fadapt_5fengaged',['arg_adapt_engaged',['../classstan_1_1gm_1_1arg__adapt__engaged.html#a93164af8cdf69db14252d54d654278f2',1,'stan::gm::arg_adapt_engaged']]], + ['arg_5fadapt_5fengaged_2ehpp',['arg_adapt_engaged.hpp',['../arg__adapt__engaged_8hpp.html',1,'']]], + ['arg_5fadapt_5fgamma',['arg_adapt_gamma',['../classstan_1_1gm_1_1arg__adapt__gamma.html',1,'stan::gm']]], + ['arg_5fadapt_5fgamma',['arg_adapt_gamma',['../classstan_1_1gm_1_1arg__adapt__gamma.html#a1e89fd146d9a20e98c550321d03aa674',1,'stan::gm::arg_adapt_gamma']]], + ['arg_5fadapt_5fgamma_2ehpp',['arg_adapt_gamma.hpp',['../arg__adapt__gamma_8hpp.html',1,'']]], + ['arg_5fadapt_5finit_5fbuffer',['arg_adapt_init_buffer',['../classstan_1_1gm_1_1arg__adapt__init__buffer.html',1,'stan::gm']]], + ['arg_5fadapt_5finit_5fbuffer',['arg_adapt_init_buffer',['../classstan_1_1gm_1_1arg__adapt__init__buffer.html#a458117f29f2665be1b17d7ce3fc2728b',1,'stan::gm::arg_adapt_init_buffer']]], + ['arg_5fadapt_5finit_5fbuffer_2ehpp',['arg_adapt_init_buffer.hpp',['../arg__adapt__init__buffer_8hpp.html',1,'']]], + ['arg_5fadapt_5fkappa',['arg_adapt_kappa',['../classstan_1_1gm_1_1arg__adapt__kappa.html',1,'stan::gm']]], + ['arg_5fadapt_5fkappa',['arg_adapt_kappa',['../classstan_1_1gm_1_1arg__adapt__kappa.html#a69a930fe17bcb920dd1beaa31d47ac20',1,'stan::gm::arg_adapt_kappa']]], + ['arg_5fadapt_5fkappa_2ehpp',['arg_adapt_kappa.hpp',['../arg__adapt__kappa_8hpp.html',1,'']]], + ['arg_5fadapt_5ft0',['arg_adapt_t0',['../classstan_1_1gm_1_1arg__adapt__t0.html',1,'stan::gm']]], + ['arg_5fadapt_5ft0',['arg_adapt_t0',['../classstan_1_1gm_1_1arg__adapt__t0.html#a92a0c0524b5f854828cb6e22c4119e8b',1,'stan::gm::arg_adapt_t0']]], + ['arg_5fadapt_5ft0_2ehpp',['arg_adapt_t0.hpp',['../arg__adapt__t0_8hpp.html',1,'']]], + ['arg_5fadapt_5fterm_5fbuffer',['arg_adapt_term_buffer',['../classstan_1_1gm_1_1arg__adapt__term__buffer.html',1,'stan::gm']]], + ['arg_5fadapt_5fterm_5fbuffer',['arg_adapt_term_buffer',['../classstan_1_1gm_1_1arg__adapt__term__buffer.html#a8e4699ec0baa6885ba9c34430b6d83b2',1,'stan::gm::arg_adapt_term_buffer']]], + ['arg_5fadapt_5fterm_5fbuffer_2ehpp',['arg_adapt_term_buffer.hpp',['../arg__adapt__term__buffer_8hpp.html',1,'']]], + ['arg_5fadapt_5fwindow',['arg_adapt_window',['../classstan_1_1gm_1_1arg__adapt__window.html',1,'stan::gm']]], + ['arg_5fadapt_5fwindow',['arg_adapt_window',['../classstan_1_1gm_1_1arg__adapt__window.html#a95facd1874bc025735aeb9bc0b4297fe',1,'stan::gm::arg_adapt_window']]], + ['arg_5fadapt_5fwindow_2ehpp',['arg_adapt_window.hpp',['../arg__adapt__window_8hpp.html',1,'']]], + ['arg_5fbfgs',['arg_bfgs',['../classstan_1_1gm_1_1arg__bfgs.html',1,'stan::gm']]], + ['arg_5fbfgs',['arg_bfgs',['../classstan_1_1gm_1_1arg__bfgs.html#a0c1429d90a7c7f0943730e16cde44fac',1,'stan::gm::arg_bfgs']]], + ['arg_5fbfgs_2ehpp',['arg_bfgs.hpp',['../arg__bfgs_8hpp.html',1,'']]], + ['arg_5fdata',['arg_data',['../classstan_1_1gm_1_1arg__data.html',1,'stan::gm']]], + ['arg_5fdata',['arg_data',['../classstan_1_1gm_1_1arg__data.html#af14bc033277233421428ef9fde504b07',1,'stan::gm::arg_data']]], + ['arg_5fdata_2ehpp',['arg_data.hpp',['../arg__data_8hpp.html',1,'']]], + ['arg_5fdata_5ffile',['arg_data_file',['../classstan_1_1gm_1_1arg__data__file.html#a2432968effc35f8973394e91b941cf86',1,'stan::gm::arg_data_file']]], + ['arg_5fdata_5ffile',['arg_data_file',['../classstan_1_1gm_1_1arg__data__file.html',1,'stan::gm']]], + ['arg_5fdata_5ffile_2ehpp',['arg_data_file.hpp',['../arg__data__file_8hpp.html',1,'']]], + ['arg_5fdense_5fe',['arg_dense_e',['../classstan_1_1gm_1_1arg__dense__e.html#af591c90b48c64017b2eed129e7fd2de6',1,'stan::gm::arg_dense_e']]], + ['arg_5fdense_5fe',['arg_dense_e',['../classstan_1_1gm_1_1arg__dense__e.html',1,'stan::gm']]], + ['arg_5fdense_5fe_2ehpp',['arg_dense_e.hpp',['../arg__dense__e_8hpp.html',1,'']]], + ['arg_5fdiag_5fe',['arg_diag_e',['../classstan_1_1gm_1_1arg__diag__e.html#a090d24faf43dccdb255de369c396947f',1,'stan::gm::arg_diag_e']]], + ['arg_5fdiag_5fe',['arg_diag_e',['../classstan_1_1gm_1_1arg__diag__e.html',1,'stan::gm']]], + ['arg_5fdiag_5fe_2ehpp',['arg_diag_e.hpp',['../arg__diag__e_8hpp.html',1,'']]], + ['arg_5fdiagnose',['arg_diagnose',['../classstan_1_1gm_1_1arg__diagnose.html#a29fa2b3eb2a85d31f3de053e7ab4a7cb',1,'stan::gm::arg_diagnose']]], + ['arg_5fdiagnose',['arg_diagnose',['../classstan_1_1gm_1_1arg__diagnose.html',1,'stan::gm']]], + ['arg_5fdiagnose_2ehpp',['arg_diagnose.hpp',['../arg__diagnose_8hpp.html',1,'']]], + ['arg_5fdiagnostic_5ffile',['arg_diagnostic_file',['../classstan_1_1gm_1_1arg__diagnostic__file.html#a59b7ff8a694fa099456fc6c4466eb300',1,'stan::gm::arg_diagnostic_file']]], + ['arg_5fdiagnostic_5ffile',['arg_diagnostic_file',['../classstan_1_1gm_1_1arg__diagnostic__file.html',1,'stan::gm']]], + ['arg_5fdiagnostic_5ffile_2ehpp',['arg_diagnostic_file.hpp',['../arg__diagnostic__file_8hpp.html',1,'']]], + ['arg_5fengine',['arg_engine',['../classstan_1_1gm_1_1arg__engine.html#a565b15c3703faddc7346db01b5a7fa3d',1,'stan::gm::arg_engine']]], + ['arg_5fengine',['arg_engine',['../classstan_1_1gm_1_1arg__engine.html',1,'stan::gm']]], + ['arg_5fengine_2ehpp',['arg_engine.hpp',['../arg__engine_8hpp.html',1,'']]], + ['arg_5ffail',['arg_fail',['../classstan_1_1gm_1_1arg__fail.html',1,'stan::gm']]], + ['arg_5ffail',['arg_fail',['../classstan_1_1gm_1_1arg__fail.html#a09c9ceb2645fafb62b79172287ce0797',1,'stan::gm::arg_fail']]], + ['arg_5ffail_2ehpp',['arg_fail.hpp',['../arg__fail_8hpp.html',1,'']]], + ['arg_5fhmc',['arg_hmc',['../classstan_1_1gm_1_1arg__hmc.html#a21bce37da4a429c509a142d2989c9e25',1,'stan::gm::arg_hmc']]], + ['arg_5fhmc',['arg_hmc',['../classstan_1_1gm_1_1arg__hmc.html',1,'stan::gm']]], + ['arg_5fhmc_2ehpp',['arg_hmc.hpp',['../arg__hmc_8hpp.html',1,'']]], + ['arg_5fid',['arg_id',['../classstan_1_1gm_1_1arg__id.html',1,'stan::gm']]], + ['arg_5fid',['arg_id',['../classstan_1_1gm_1_1arg__id.html#a9db2f80b010bff893370ae4b230bd966',1,'stan::gm::arg_id']]], + ['arg_5fid_2ehpp',['arg_id.hpp',['../arg__id_8hpp.html',1,'']]], + ['arg_5finit',['arg_init',['../classstan_1_1gm_1_1arg__init.html',1,'stan::gm']]], + ['arg_5finit',['arg_init',['../classstan_1_1gm_1_1arg__init.html#acfb9b2317ca874c9c9c266c03ac1368f',1,'stan::gm::arg_init']]], + ['arg_5finit_2ehpp',['arg_init.hpp',['../arg__init_8hpp.html',1,'']]], + ['arg_5finit_5falpha',['arg_init_alpha',['../classstan_1_1gm_1_1arg__init__alpha.html',1,'stan::gm']]], + ['arg_5finit_5falpha',['arg_init_alpha',['../classstan_1_1gm_1_1arg__init__alpha.html#a62422aee45bcf245c6707a75ad762f4a',1,'stan::gm::arg_init_alpha']]], + ['arg_5finit_5falpha_2ehpp',['arg_init_alpha.hpp',['../arg__init__alpha_8hpp.html',1,'']]], + ['arg_5fint_5ftime',['arg_int_time',['../classstan_1_1gm_1_1arg__int__time.html',1,'stan::gm']]], + ['arg_5fint_5ftime',['arg_int_time',['../classstan_1_1gm_1_1arg__int__time.html#a8374ed135e25d27819e08b474b6170c4',1,'stan::gm::arg_int_time']]], + ['arg_5fint_5ftime_2ehpp',['arg_int_time.hpp',['../arg__int__time_8hpp.html',1,'']]], + ['arg_5fiter',['arg_iter',['../classstan_1_1gm_1_1arg__iter.html',1,'stan::gm']]], + ['arg_5fiter',['arg_iter',['../classstan_1_1gm_1_1arg__iter.html#addc4d554b12927d3e099cb78e84b4c69',1,'stan::gm::arg_iter']]], + ['arg_5fiter_2ehpp',['arg_iter.hpp',['../arg__iter_8hpp.html',1,'']]], + ['arg_5fmax_5fdepth',['arg_max_depth',['../classstan_1_1gm_1_1arg__max__depth.html',1,'stan::gm']]], + ['arg_5fmax_5fdepth',['arg_max_depth',['../classstan_1_1gm_1_1arg__max__depth.html#aa43e5f69ecea1ab64a93d0544f5b2204',1,'stan::gm::arg_max_depth']]], + ['arg_5fmax_5fdepth_2ehpp',['arg_max_depth.hpp',['../arg__max__depth_8hpp.html',1,'']]], + ['arg_5fmethod',['arg_method',['../classstan_1_1gm_1_1arg__method.html#a0ab921dbf66c5b63669cb77f07d797e9',1,'stan::gm::arg_method']]], + ['arg_5fmethod',['arg_method',['../classstan_1_1gm_1_1arg__method.html',1,'stan::gm']]], + ['arg_5fmethod_2ehpp',['arg_method.hpp',['../arg__method_8hpp.html',1,'']]], + ['arg_5fmetric',['arg_metric',['../classstan_1_1gm_1_1arg__metric.html',1,'stan::gm']]], + ['arg_5fmetric',['arg_metric',['../classstan_1_1gm_1_1arg__metric.html#a8f59bf4d98051c730af026865135958d',1,'stan::gm::arg_metric']]], + ['arg_5fmetric_2ehpp',['arg_metric.hpp',['../arg__metric_8hpp.html',1,'']]], + ['arg_5fnesterov',['arg_nesterov',['../classstan_1_1gm_1_1arg__nesterov.html#aff8818db928802f6e048d6a3dcf080ea',1,'stan::gm::arg_nesterov']]], + ['arg_5fnesterov',['arg_nesterov',['../classstan_1_1gm_1_1arg__nesterov.html',1,'stan::gm']]], + ['arg_5fnesterov_2ehpp',['arg_nesterov.hpp',['../arg__nesterov_8hpp.html',1,'']]], + ['arg_5fnewton',['arg_newton',['../classstan_1_1gm_1_1arg__newton.html',1,'stan::gm']]], + ['arg_5fnewton',['arg_newton',['../classstan_1_1gm_1_1arg__newton.html#a40a307722a2f91f3c1507261183fd4a2',1,'stan::gm::arg_newton']]], + ['arg_5fnewton_2ehpp',['arg_newton.hpp',['../arg__newton_8hpp.html',1,'']]], + ['arg_5fnum_5fsamples',['arg_num_samples',['../classstan_1_1gm_1_1arg__num__samples.html#af03561fdb3d19b14fa8ce33db4bfbb92',1,'stan::gm::arg_num_samples']]], + ['arg_5fnum_5fsamples',['arg_num_samples',['../classstan_1_1gm_1_1arg__num__samples.html',1,'stan::gm']]], + ['arg_5fnum_5fsamples_2ehpp',['arg_num_samples.hpp',['../arg__num__samples_8hpp.html',1,'']]], + ['arg_5fnum_5fwarmup',['arg_num_warmup',['../classstan_1_1gm_1_1arg__num__warmup.html#a12b94f117fb965fee31d2a53d946a3b9',1,'stan::gm::arg_num_warmup']]], + ['arg_5fnum_5fwarmup',['arg_num_warmup',['../classstan_1_1gm_1_1arg__num__warmup.html',1,'stan::gm']]], + ['arg_5fnum_5fwarmup_2ehpp',['arg_num_warmup.hpp',['../arg__num__warmup_8hpp.html',1,'']]], + ['arg_5fnuts',['arg_nuts',['../classstan_1_1gm_1_1arg__nuts.html',1,'stan::gm']]], + ['arg_5fnuts',['arg_nuts',['../classstan_1_1gm_1_1arg__nuts.html#a54338616bb4ea3c6cdaa922fe60f6279',1,'stan::gm::arg_nuts']]], + ['arg_5fnuts_2ehpp',['arg_nuts.hpp',['../arg__nuts_8hpp.html',1,'']]], + ['arg_5foptimize',['arg_optimize',['../classstan_1_1gm_1_1arg__optimize.html',1,'stan::gm']]], + ['arg_5foptimize',['arg_optimize',['../classstan_1_1gm_1_1arg__optimize.html#a212f9e1a9ea25739e42913cd99f6cfa3',1,'stan::gm::arg_optimize']]], + ['arg_5foptimize_2ehpp',['arg_optimize.hpp',['../arg__optimize_8hpp.html',1,'']]], + ['arg_5foptimize_5falgo',['arg_optimize_algo',['../classstan_1_1gm_1_1arg__optimize__algo.html#a6c60961805502a27dd60db458155b30e',1,'stan::gm::arg_optimize_algo']]], + ['arg_5foptimize_5falgo',['arg_optimize_algo',['../classstan_1_1gm_1_1arg__optimize__algo.html',1,'stan::gm']]], + ['arg_5foptimize_5falgo_2ehpp',['arg_optimize_algo.hpp',['../arg__optimize__algo_8hpp.html',1,'']]], + ['arg_5foutput',['arg_output',['../classstan_1_1gm_1_1arg__output.html#a00b3df35f243cba8de0e50cacff5f9f8',1,'stan::gm::arg_output']]], + ['arg_5foutput',['arg_output',['../classstan_1_1gm_1_1arg__output.html',1,'stan::gm']]], + ['arg_5foutput_2ehpp',['arg_output.hpp',['../arg__output_8hpp.html',1,'']]], + ['arg_5foutput_5ffile',['arg_output_file',['../classstan_1_1gm_1_1arg__output__file.html',1,'stan::gm']]], + ['arg_5foutput_5ffile',['arg_output_file',['../classstan_1_1gm_1_1arg__output__file.html#a7653a338dae46687a0cd46607cb8df30',1,'stan::gm::arg_output_file']]], + ['arg_5foutput_5ffile_2ehpp',['arg_output_file.hpp',['../arg__output__file_8hpp.html',1,'']]], + ['arg_5frandom',['arg_random',['../classstan_1_1gm_1_1arg__random.html',1,'stan::gm']]], + ['arg_5frandom',['arg_random',['../classstan_1_1gm_1_1arg__random.html#a04356fb8dd2badb38de8d957d89ccd25',1,'stan::gm::arg_random']]], + ['arg_5frandom_2ehpp',['arg_random.hpp',['../arg__random_8hpp.html',1,'']]], + ['arg_5frefresh',['arg_refresh',['../classstan_1_1gm_1_1arg__refresh.html#a1055e8b9beac79398a5efd25106bef73',1,'stan::gm::arg_refresh']]], + ['arg_5frefresh',['arg_refresh',['../classstan_1_1gm_1_1arg__refresh.html',1,'stan::gm']]], + ['arg_5frefresh_2ehpp',['arg_refresh.hpp',['../arg__refresh_8hpp.html',1,'']]], + ['arg_5frwm',['arg_rwm',['../classstan_1_1gm_1_1arg__rwm.html#a7e6e4430b6cc5d35128899c2d7e7f4c1',1,'stan::gm::arg_rwm']]], + ['arg_5frwm',['arg_rwm',['../classstan_1_1gm_1_1arg__rwm.html',1,'stan::gm']]], + ['arg_5frwm_2ehpp',['arg_rwm.hpp',['../arg__rwm_8hpp.html',1,'']]], + ['arg_5fsample',['arg_sample',['../classstan_1_1gm_1_1arg__sample.html#a76e9dba4b18fff10db3938783e4bbc84',1,'stan::gm::arg_sample']]], + ['arg_5fsample',['arg_sample',['../classstan_1_1gm_1_1arg__sample.html',1,'stan::gm']]], + ['arg_5fsample_2ehpp',['arg_sample.hpp',['../arg__sample_8hpp.html',1,'']]], + ['arg_5fsample_5falgo',['arg_sample_algo',['../classstan_1_1gm_1_1arg__sample__algo.html',1,'stan::gm']]], + ['arg_5fsample_5falgo',['arg_sample_algo',['../classstan_1_1gm_1_1arg__sample__algo.html#a677c78a97f6e522c2b532d5ec8cdc436',1,'stan::gm::arg_sample_algo']]], + ['arg_5fsample_5falgo_2ehpp',['arg_sample_algo.hpp',['../arg__sample__algo_8hpp.html',1,'']]], + ['arg_5fsave_5fiterations',['arg_save_iterations',['../classstan_1_1gm_1_1arg__save__iterations.html',1,'stan::gm']]], + ['arg_5fsave_5fiterations',['arg_save_iterations',['../classstan_1_1gm_1_1arg__save__iterations.html#ac3c6147547688bf229a5a229b761891f',1,'stan::gm::arg_save_iterations']]], + ['arg_5fsave_5fiterations_2ehpp',['arg_save_iterations.hpp',['../arg__save__iterations_8hpp.html',1,'']]], + ['arg_5fsave_5fwarmup',['arg_save_warmup',['../classstan_1_1gm_1_1arg__save__warmup.html',1,'stan::gm']]], + ['arg_5fsave_5fwarmup',['arg_save_warmup',['../classstan_1_1gm_1_1arg__save__warmup.html#abc63cf780ff0ec05b668034557e66e5a',1,'stan::gm::arg_save_warmup']]], + ['arg_5fsave_5fwarmup_2ehpp',['arg_save_warmup.hpp',['../arg__save__warmup_8hpp.html',1,'']]], + ['arg_5fseed',['arg_seed',['../classstan_1_1gm_1_1arg__seed.html#a49ef4eab0312fb9eebdaf8901a24a50f',1,'stan::gm::arg_seed']]], + ['arg_5fseed',['arg_seed',['../classstan_1_1gm_1_1arg__seed.html',1,'stan::gm']]], + ['arg_5fseed_2ehpp',['arg_seed.hpp',['../arg__seed_8hpp.html',1,'']]], + ['arg_5fstatic',['arg_static',['../classstan_1_1gm_1_1arg__static.html',1,'stan::gm']]], + ['arg_5fstatic',['arg_static',['../classstan_1_1gm_1_1arg__static.html#aad5c9ed706c879ffc39b2f44b4ce9aef',1,'stan::gm::arg_static']]], + ['arg_5fstatic_2ehpp',['arg_static.hpp',['../arg__static_8hpp.html',1,'']]], + ['arg_5fstepsize',['arg_stepsize',['../classstan_1_1gm_1_1arg__stepsize.html',1,'stan::gm']]], + ['arg_5fstepsize',['arg_stepsize',['../classstan_1_1gm_1_1arg__stepsize.html#ab10f7c015e43cae0bd66ebd7d2ea60bb',1,'stan::gm::arg_stepsize']]], + ['arg_5fstepsize_2ehpp',['arg_stepsize.hpp',['../arg__stepsize_8hpp.html',1,'']]], + ['arg_5fstepsize_5fjitter',['arg_stepsize_jitter',['../classstan_1_1gm_1_1arg__stepsize__jitter.html#af57b445faa0178cddfc60633a0452e02',1,'stan::gm::arg_stepsize_jitter']]], + ['arg_5fstepsize_5fjitter',['arg_stepsize_jitter',['../classstan_1_1gm_1_1arg__stepsize__jitter.html',1,'stan::gm']]], + ['arg_5fstepsize_5fjitter_2ehpp',['arg_stepsize_jitter.hpp',['../arg__stepsize__jitter_8hpp.html',1,'']]], + ['arg_5ftest',['arg_test',['../classstan_1_1gm_1_1arg__test.html#a09019b7ca0e874ecc2946309b1032acd',1,'stan::gm::arg_test']]], + ['arg_5ftest',['arg_test',['../classstan_1_1gm_1_1arg__test.html',1,'stan::gm']]], + ['arg_5ftest_2ehpp',['arg_test.hpp',['../arg__test_8hpp.html',1,'']]], + ['arg_5ftest_5fgrad_5feps',['arg_test_grad_eps',['../classstan_1_1gm_1_1arg__test__grad__eps.html#a1105ef70c0defa9892e9bd5993fd24cf',1,'stan::gm::arg_test_grad_eps']]], + ['arg_5ftest_5fgrad_5feps',['arg_test_grad_eps',['../classstan_1_1gm_1_1arg__test__grad__eps.html',1,'stan::gm']]], + ['arg_5ftest_5fgrad_5feps_2ehpp',['arg_test_grad_eps.hpp',['../arg__test__grad__eps_8hpp.html',1,'']]], + ['arg_5ftest_5fgrad_5ferr',['arg_test_grad_err',['../classstan_1_1gm_1_1arg__test__grad__err.html',1,'stan::gm']]], + ['arg_5ftest_5fgrad_5ferr',['arg_test_grad_err',['../classstan_1_1gm_1_1arg__test__grad__err.html#a3c862ad4e9f4ae7010ca45c77da8d380',1,'stan::gm::arg_test_grad_err']]], + ['arg_5ftest_5fgrad_5ferr_2ehpp',['arg_test_grad_err.hpp',['../arg__test__grad__err_8hpp.html',1,'']]], + ['arg_5ftest_5fgradient',['arg_test_gradient',['../classstan_1_1gm_1_1arg__test__gradient.html#aa61549ae85bb062c3cc5f76668b3e1dd',1,'stan::gm::arg_test_gradient']]], + ['arg_5ftest_5fgradient',['arg_test_gradient',['../classstan_1_1gm_1_1arg__test__gradient.html',1,'stan::gm']]], + ['arg_5ftest_5fgradient_2ehpp',['arg_test_gradient.hpp',['../arg__test__gradient_8hpp.html',1,'']]], + ['arg_5fthin',['arg_thin',['../classstan_1_1gm_1_1arg__thin.html#a968a02a29a6fc8097ce610f3be4e5ac9',1,'stan::gm::arg_thin']]], + ['arg_5fthin',['arg_thin',['../classstan_1_1gm_1_1arg__thin.html',1,'stan::gm']]], + ['arg_5fthin_2ehpp',['arg_thin.hpp',['../arg__thin_8hpp.html',1,'']]], + ['arg_5ftolerance',['arg_tolerance',['../classstan_1_1gm_1_1arg__tolerance.html',1,'stan::gm']]], + ['arg_5ftolerance',['arg_tolerance',['../classstan_1_1gm_1_1arg__tolerance.html#aba6a7ae537bca04e284af54e9a231e3f',1,'stan::gm::arg_tolerance']]], + ['arg_5ftolerance_2ehpp',['arg_tolerance.hpp',['../arg__tolerance_8hpp.html',1,'']]], + ['arg_5funit_5fe',['arg_unit_e',['../classstan_1_1gm_1_1arg__unit__e.html',1,'stan::gm']]], + ['arg_5funit_5fe',['arg_unit_e',['../classstan_1_1gm_1_1arg__unit__e.html#a6772c5923ce0c23db100e1157aa232c5',1,'stan::gm::arg_unit_e']]], + ['arg_5funit_5fe_2ehpp',['arg_unit_e.hpp',['../arg__unit__e_8hpp.html',1,'']]], + ['args_5f',['args_',['../structstan_1_1gm_1_1distribution.html#aab595ee25d571021f9c27db31b187f6b',1,'stan::gm::distribution::args_()'],['../structstan_1_1gm_1_1array__literal.html#a26de2c2e4c1319f282766524f991d065',1,'stan::gm::array_literal::args_()'],['../structstan_1_1gm_1_1fun.html#a7c4dc2f722ef80460d8171d6bcab8d00',1,'stan::gm::fun::args_()']]], + ['args_5fr',['args_r',['../structstan_1_1gm_1_1term__grammar.html#a6e06cb76720538efdb14c0c2ada2d370',1,'stan::gm::term_grammar']]], + ['argument',['argument',['../classstan_1_1gm_1_1argument.html',1,'stan::gm']]], + ['argument',['argument',['../classstan_1_1gm_1_1argument.html#ad3b825604d30e95f4e66eef6cbadf533',1,'stan::gm::argument::argument()'],['../classstan_1_1gm_1_1argument.html#af5c733afb4fdc0f55795f8cdd2891d7f',1,'stan::gm::argument::argument(const std::string name)']]], + ['argument_2ehpp',['argument.hpp',['../argument_8hpp.html',1,'']]], + ['argument_5fparser',['argument_parser',['../classstan_1_1gm_1_1argument__parser.html',1,'stan::gm']]], + ['argument_5fparser',['argument_parser',['../classstan_1_1gm_1_1argument__parser.html#a540ddee5190ee5dd85a8773d98a5cb83',1,'stan::gm::argument_parser']]], + ['argument_5fparser_2ehpp',['argument_parser.hpp',['../argument__parser_8hpp.html',1,'']]], + ['argument_5fprobe',['argument_probe',['../classstan_1_1gm_1_1argument__probe.html#a82b991e17fd517f1a04ba905acb545be',1,'stan::gm::argument_probe']]], + ['argument_5fprobe',['argument_probe',['../classstan_1_1gm_1_1argument__probe.html',1,'stan::gm']]], + ['argument_5fprobe_2ehpp',['argument_probe.hpp',['../argument__probe_8hpp.html',1,'']]], + ['array',['array',['../structstan_1_1math_1_1array__builder.html#a725410c59aa282c6b23c52fd252aa1a3',1,'stan::math::array_builder']]], + ['array_5fbuilder',['array_builder',['../structstan_1_1math_1_1array__builder.html',1,'stan::math']]], + ['array_5fbuilder',['array_builder',['../structstan_1_1math_1_1array__builder.html#a8e2649b71c980137fa5d86433d2be50c',1,'stan::math::array_builder']]], + ['array_5fbuilder_2ehpp',['array_builder.hpp',['../array__builder_8hpp.html',1,'']]], + ['array_5fliteral',['array_literal',['../structstan_1_1gm_1_1array__literal.html',1,'stan::gm']]], + ['array_5fliteral',['array_literal',['../structstan_1_1gm_1_1array__literal.html#a462b152d7868e7d588994d215e81b26d',1,'stan::gm::array_literal::array_literal()'],['../structstan_1_1gm_1_1array__literal.html#a08529fbee87e23323340317b11f4a71c',1,'stan::gm::array_literal::array_literal(const std::vector< expression > &args)']]], + ['array_5fvec_5ft',['array_vec_t',['../classstan_1_1io_1_1writer.html#a897e6e5d45368b1c69a5f773f71f03e7',1,'stan::io::writer']]], + ['as_5fbool',['as_bool',['../namespacestan_1_1agrad.html#a0e0e98b7b8248f6303a3ae565a46305c',1,'stan::agrad::as_bool()'],['../namespacestan_1_1math.html#a6ad1c484220022b3abfb79c16d1d7f72',1,'stan::math::as_bool()']]], + ['as_5fbool_2ehpp',['as_bool.hpp',['../agrad_2rev_2functions_2as__bool_8hpp.html',1,'']]], + ['as_5fbool_2ehpp',['as_bool.hpp',['../math_2functions_2as__bool_8hpp.html',1,'']]], + ['as_5fbool_3c_20int_20_3e',['as_bool< int >',['../namespacestan_1_1math.html#a86b5156aa25d21592dbd3624aae1ea39',1,'stan::math']]], + ['asin',['asin',['../namespacestan_1_1agrad.html#a376ec296a189c47edee18e50ba72b2f5',1,'stan::agrad::asin(const var &a)'],['../namespacestan_1_1agrad.html#afd98c31d8d43e552287de2dc9170ff3e',1,'stan::agrad::asin(const fvar< T > &x)']]], + ['asin_2ehpp',['asin.hpp',['../rev_2functions_2asin_8hpp.html',1,'']]], + ['asin_2ehpp',['asin.hpp',['../fwd_2functions_2asin_8hpp.html',1,'']]], + ['asinh',['asinh',['../namespacestan_1_1agrad.html#aaf137922ce743a1f63adfaed2630dfe6',1,'stan::agrad::asinh(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#a0fd3a2e895d3c03de0b670b3ba8b3b3c',1,'stan::agrad::asinh(const stan::agrad::var &a)']]], + ['asinh_2ehpp',['asinh.hpp',['../fwd_2functions_2asinh_8hpp.html',1,'']]], + ['asinh_2ehpp',['asinh.hpp',['../rev_2functions_2asinh_8hpp.html',1,'']]], + ['assign',['assign',['../namespacestan_1_1math.html#a5f394c15ea3eb97743382631f91801cf',1,'stan::math::assign(LHS &lhs, const RHS &rhs)'],['../namespacestan_1_1math.html#a5371f0f914e9b79a0700577e5557c0b7',1,'stan::math::assign(Eigen::Matrix< LHS, R1, C1 > &x, const Eigen::Matrix< RHS, R2, C2 > &y)'],['../namespacestan_1_1math.html#a0a80c719463c4e3caa03df731e2c2cb9',1,'stan::math::assign(Eigen::Matrix< LHS, R, C > &x, const Eigen::Matrix< RHS, R, C > &y)'],['../namespacestan_1_1math.html#aa4af3a90ad3b5ec1507dfc1823fdb8da',1,'stan::math::assign(Eigen::Block< LHS > x, const Eigen::Matrix< RHS, R, C > &y)'],['../namespacestan_1_1math.html#a2c6dec98c71fd478c2ee16bc274b464d',1,'stan::math::assign(std::vector< LHS > &x, const std::vector< RHS > &y)']]], + ['assign_2ehpp',['assign.hpp',['../assign_8hpp.html',1,'']]], + ['assignment',['assignment',['../structstan_1_1gm_1_1assignment.html#ad3690469ab15526cf947f92e2ae9aef3',1,'stan::gm::assignment::assignment()'],['../structstan_1_1gm_1_1assignment.html#a5f93f2431c52a23bab7288491a6f02b7',1,'stan::gm::assignment::assignment(variable_dims &var_dims, expression &expr)']]], + ['assignment',['assignment',['../structstan_1_1gm_1_1assignment.html',1,'stan::gm']]], + ['assignment_5fr',['assignment_r',['../structstan_1_1gm_1_1statement__grammar.html#aa3deabcf92016a9afde6ce09215288ff',1,'stan::gm::statement_grammar']]], + ['ast_2ehpp',['ast.hpp',['../ast_8hpp.html',1,'']]], + ['ast_5fdef_2ecpp',['ast_def.cpp',['../ast__def_8cpp.html',1,'']]], + ['atan',['atan',['../namespacestan_1_1agrad.html#a0dfbfab0e6051aa349a6090f102f6742',1,'stan::agrad::atan(const var &a)'],['../namespacestan_1_1agrad.html#a6546708d4dc0f19756f4e2380eb9b9e4',1,'stan::agrad::atan(const fvar< T > &x)']]], + ['atan_2ehpp',['atan.hpp',['../rev_2functions_2atan_8hpp.html',1,'']]], + ['atan_2ehpp',['atan.hpp',['../fwd_2functions_2atan_8hpp.html',1,'']]], + ['atan2',['atan2',['../namespacestan_1_1agrad.html#ae76a1cfac43312edacb47fd87fc2393a',1,'stan::agrad::atan2(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#a8d5bc116190d363cc639326df5e04aea',1,'stan::agrad::atan2(const var &a, const double &b)'],['../namespacestan_1_1agrad.html#ad1a44f881f4e456e06374ee511387769',1,'stan::agrad::atan2(const double &a, const var &b)'],['../namespacestan_1_1agrad.html#aed06ff6c2ea34535f6c75ea7582aa203',1,'stan::agrad::atan2(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#aa982d2dff799ce857c3c0853628d3f1f',1,'stan::agrad::atan2(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#ac193d89ea00a38466c89eff9c13bcd48',1,'stan::agrad::atan2(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#a675cbb776b5402953bd180b4d6e1d90b',1,'stan::agrad::atan2(const var &a, const double b)'],['../namespacestan_1_1agrad.html#a9963689c927130aef845582a1160678b',1,'stan::agrad::atan2(const double a, const var &b)']]], + ['atan2_2ehpp',['atan2.hpp',['../rev_2functions_2atan2_8hpp.html',1,'']]], + ['atan2_2ehpp',['atan2.hpp',['../fwd_2functions_2atan2_8hpp.html',1,'']]], + ['atanh',['atanh',['../namespacestan_1_1agrad.html#a5063c907c581ab5a2e735f8cccd7aad3',1,'stan::agrad::atanh(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#af87034c9a4d6edfc1df46d96069fd68c',1,'stan::agrad::atanh(const stan::agrad::var &a)']]], + ['atanh_2ehpp',['atanh.hpp',['../rev_2functions_2atanh_8hpp.html',1,'']]], + ['atanh_2ehpp',['atanh.hpp',['../fwd_2functions_2atanh_8hpp.html',1,'']]], + ['autocorrelation',['autocorrelation',['../classstan_1_1mcmc_1_1chains.html#a4f666226faa6abbf0083da66da0a8d10',1,'stan::mcmc::chains::autocorrelation(const int chain, const int index)'],['../classstan_1_1mcmc_1_1chains.html#ab1de31b2bda945c27829ac7823bef3f2',1,'stan::mcmc::chains::autocorrelation(const int chain, const std::string &name)'],['../namespacestan_1_1prob.html#afca2f21cad2a74d9d5ff27c4ae47d6cf',1,'stan::prob::autocorrelation(const std::vector< T > &y, std::vector< T > &ac, Eigen::FFT< T > &fft)'],['../namespacestan_1_1prob.html#a426d883667d0707d0d6d6337831e41c4',1,'stan::prob::autocorrelation(const std::vector< T > &y, std::vector< T > &ac)']]], + ['autocorrelation_2ehpp',['autocorrelation.hpp',['../autocorrelation_8hpp.html',1,'']]], + ['autocovariance',['autocovariance',['../classstan_1_1mcmc_1_1chains.html#a24f75bd6ba8e24fe99b54c9226a18320',1,'stan::mcmc::chains::autocovariance(const int chain, const int index)'],['../classstan_1_1mcmc_1_1chains.html#a3d2a87745cfded05b30a8b517c4e5a88',1,'stan::mcmc::chains::autocovariance(const int chain, const std::string &name)'],['../namespacestan_1_1prob.html#ac4390e4cb6742ab59c9d6c401cd7a188',1,'stan::prob::autocovariance(const std::vector< T > &y, std::vector< T > &acov, Eigen::FFT< T > &fft)'],['../namespacestan_1_1prob.html#a73aec38db728d2f43f80fbdcc314b3db',1,'stan::prob::autocovariance(const std::vector< T > &y, std::vector< T > &acov)']]], + ['autocovariance_2ehpp',['autocovariance.hpp',['../autocovariance_8hpp.html',1,'']]], + ['autodiff_2ehpp',['autodiff.hpp',['../autodiff_8hpp.html',1,'']]], + ['available',['available',['../classstan_1_1io_1_1reader.html#a581d87c0d6f4fbcc889fcda61d9da129',1,'stan::io::reader']]], + ['available_5fi',['available_i',['../classstan_1_1io_1_1reader.html#a69f82bd5d88795b0012d04b239685858',1,'stan::io::reader']]], + ['avi_5f',['avi_',['../classstan_1_1agrad_1_1op__v__vari.html#ae8e93664ac7970bf32c2289f6b8d23fd',1,'stan::agrad::op_v_vari::avi_()'],['../classstan_1_1agrad_1_1op__vd__vari.html#a0bcd38664a8c961ccae91a7c4a5af468',1,'stan::agrad::op_vd_vari::avi_()'],['../classstan_1_1agrad_1_1op__vdd__vari.html#ac48a55ac9e4fe37c975bc0da3795e5cc',1,'stan::agrad::op_vdd_vari::avi_()'],['../classstan_1_1agrad_1_1op__vdv__vari.html#aedb9c63989ef1592cdf387c3a655b772',1,'stan::agrad::op_vdv_vari::avi_()'],['../classstan_1_1agrad_1_1op__vv__vari.html#acdd44b7d08e9f182c70ad91c782f8c79',1,'stan::agrad::op_vv_vari::avi_()'],['../classstan_1_1agrad_1_1op__vvd__vari.html#a16e916a50bb457803ab104e014f07419',1,'stan::agrad::op_vvd_vari::avi_()'],['../classstan_1_1agrad_1_1op__vvv__vari.html#ae8912106d3514178b27ee59f6e964654',1,'stan::agrad::op_vvv_vari::avi_()'],['../agrad__thread__safe_8hpp.html#a7ed9dc49639747c6e4466603cb99f37a',1,'avi_(): agrad_thread_safe.hpp']]] +]; diff --git a/doc/api/html/search/all_62.html b/doc/api/html/search/all_62.html new file mode 100644 index 00000000000..ee8871cb35a --- /dev/null +++ b/doc/api/html/search/all_62.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/all_62.js b/doc/api/html/search/all_62.js new file mode 100644 index 00000000000..90f99b4773c --- /dev/null +++ b/doc/api/html/search/all_62.js @@ -0,0 +1,125 @@ +var searchData= +[ + ['b_5f',['B_',['../agrad_2rev_2matrix_2quad__form_8hpp.html#a9e12a47e6a37454b96cc03670779ebf0',1,'B_(): quad_form.hpp'],['../agrad_2rev_2matrix_2trace__gen__quad__form_8hpp.html#a9e12a47e6a37454b96cc03670779ebf0',1,'B_(): trace_gen_quad_form.hpp'],['../agrad_2rev_2matrix_2trace__quad__form_8hpp.html#a9e12a47e6a37454b96cc03670779ebf0',1,'B_(): trace_quad_form.hpp']]], + ['bare',['bare',['../classstan_1_1io_1_1cmd__line.html#a3879e1290c19f6580ee0285dc1625675',1,'stan::io::cmd_line']]], + ['bare_5fsize',['bare_size',['../classstan_1_1io_1_1cmd__line.html#a5cfdf91b7237b7db7cd9ea0b7de571b6',1,'stan::io::cmd_line']]], + ['base_5fadaptation',['base_adaptation',['../classstan_1_1mcmc_1_1base__adaptation.html',1,'stan::mcmc']]], + ['base_5fadaptation_2ehpp',['base_adaptation.hpp',['../base__adaptation_8hpp.html',1,'']]], + ['base_5fadapter',['base_adapter',['../classstan_1_1mcmc_1_1base__adapter.html',1,'stan::mcmc']]], + ['base_5fadapter',['base_adapter',['../classstan_1_1mcmc_1_1base__adapter.html#ac1d2bf71f98f15445b607766f5451bba',1,'stan::mcmc::base_adapter']]], + ['base_5fadapter_2ehpp',['base_adapter.hpp',['../base__adapter_8hpp.html',1,'']]], + ['base_5fexpr_5ftype',['base_expr_type',['../namespacestan_1_1gm.html#acf4d6f01fec7bb88dc578ad058392b78',1,'stan::gm']]], + ['base_5fhamiltonian',['base_hamiltonian',['../classstan_1_1mcmc_1_1base__hamiltonian.html#aff93f8e3e83acfe9b8e6f88ed1a63c85',1,'stan::mcmc::base_hamiltonian']]], + ['base_5fhamiltonian',['base_hamiltonian',['../classstan_1_1mcmc_1_1base__hamiltonian.html',1,'stan::mcmc']]], + ['base_5fhamiltonian_2ehpp',['base_hamiltonian.hpp',['../base__hamiltonian_8hpp.html',1,'']]], + ['base_5fhamiltonian_3c_20m_2c_20dense_5fe_5fpoint_2c_20baserng_20_3e',['base_hamiltonian< M, dense_e_point, BaseRNG >',['../classstan_1_1mcmc_1_1base__hamiltonian.html',1,'stan::mcmc']]], + ['base_5fhamiltonian_3c_20m_2c_20diag_5fe_5fpoint_2c_20baserng_20_3e',['base_hamiltonian< M, diag_e_point, BaseRNG >',['../classstan_1_1mcmc_1_1base__hamiltonian.html',1,'stan::mcmc']]], + ['base_5fhamiltonian_3c_20m_2c_20unit_5fe_5fpoint_2c_20baserng_20_3e',['base_hamiltonian< M, unit_e_point, BaseRNG >',['../classstan_1_1mcmc_1_1base__hamiltonian.html',1,'stan::mcmc']]], + ['base_5fhmc',['base_hmc',['../classstan_1_1mcmc_1_1base__hmc.html#a8c414cb92694b17a02b3d2a799499870',1,'stan::mcmc::base_hmc']]], + ['base_5fhmc',['base_hmc',['../classstan_1_1mcmc_1_1base__hmc.html',1,'stan::mcmc']]], + ['base_5fhmc_2ehpp',['base_hmc.hpp',['../base__hmc_8hpp.html',1,'']]], + ['base_5fhmc_3c_20m_2c_20dense_5fe_5fpoint_2c_20dense_5fe_5fmetric_2c_20expl_5fleapfrog_2c_20baserng_20_3e',['base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >',['../classstan_1_1mcmc_1_1base__hmc.html',1,'stan::mcmc']]], + ['base_5fhmc_3c_20m_2c_20diag_5fe_5fpoint_2c_20diag_5fe_5fmetric_2c_20expl_5fleapfrog_2c_20baserng_20_3e',['base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >',['../classstan_1_1mcmc_1_1base__hmc.html',1,'stan::mcmc']]], + ['base_5fhmc_3c_20m_2c_20unit_5fe_5fpoint_2c_20unit_5fe_5fmetric_2c_20expl_5fleapfrog_2c_20baserng_20_3e',['base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >',['../classstan_1_1mcmc_1_1base__hmc.html',1,'stan::mcmc']]], + ['base_5fintegrator',['base_integrator',['../classstan_1_1mcmc_1_1base__integrator.html#aca59e40275dc1404de7077455e267d3d',1,'stan::mcmc::base_integrator']]], + ['base_5fintegrator',['base_integrator',['../classstan_1_1mcmc_1_1base__integrator.html',1,'stan::mcmc']]], + ['base_5fintegrator_2ehpp',['base_integrator.hpp',['../base__integrator_8hpp.html',1,'']]], + ['base_5fintegrator_3c_20dense_5fe_5fmetric_3c_20m_2c_20baserng_20_3e_2c_20dense_5fe_5fpoint_20_3e',['base_integrator< dense_e_metric< M, BaseRNG >, dense_e_point >',['../classstan_1_1mcmc_1_1base__integrator.html',1,'stan::mcmc']]], + ['base_5fintegrator_3c_20diag_5fe_5fmetric_3c_20m_2c_20baserng_20_3e_2c_20diag_5fe_5fpoint_20_3e',['base_integrator< diag_e_metric< M, BaseRNG >, diag_e_point >',['../classstan_1_1mcmc_1_1base__integrator.html',1,'stan::mcmc']]], + ['base_5fintegrator_3c_20unit_5fe_5fmetric_3c_20m_2c_20baserng_20_3e_2c_20unit_5fe_5fpoint_20_3e',['base_integrator< unit_e_metric< M, BaseRNG >, unit_e_point >',['../classstan_1_1mcmc_1_1base__integrator.html',1,'stan::mcmc']]], + ['base_5fiterator_5ft',['base_iterator_t',['../namespacestan_1_1gm.html#a48761b304b8039f53b3a6fc76e4efc87',1,'stan::gm']]], + ['base_5fleapfrog',['base_leapfrog',['../classstan_1_1mcmc_1_1base__leapfrog.html#a633d75fe0c95602fe6546e5a2cb217ae',1,'stan::mcmc::base_leapfrog']]], + ['base_5fleapfrog',['base_leapfrog',['../classstan_1_1mcmc_1_1base__leapfrog.html',1,'stan::mcmc']]], + ['base_5fleapfrog_2ehpp',['base_leapfrog.hpp',['../base__leapfrog_8hpp.html',1,'']]], + ['base_5fleapfrog_3c_20dense_5fe_5fmetric_3c_20m_2c_20baserng_20_3e_2c_20dense_5fe_5fpoint_20_3e',['base_leapfrog< dense_e_metric< M, BaseRNG >, dense_e_point >',['../classstan_1_1mcmc_1_1base__leapfrog.html',1,'stan::mcmc']]], + ['base_5fleapfrog_3c_20diag_5fe_5fmetric_3c_20m_2c_20baserng_20_3e_2c_20diag_5fe_5fpoint_20_3e',['base_leapfrog< diag_e_metric< M, BaseRNG >, diag_e_point >',['../classstan_1_1mcmc_1_1base__leapfrog.html',1,'stan::mcmc']]], + ['base_5fleapfrog_3c_20unit_5fe_5fmetric_3c_20m_2c_20baserng_20_3e_2c_20unit_5fe_5fpoint_20_3e',['base_leapfrog< unit_e_metric< M, BaseRNG >, unit_e_point >',['../classstan_1_1mcmc_1_1base__leapfrog.html',1,'stan::mcmc']]], + ['base_5fmcmc',['base_mcmc',['../classstan_1_1mcmc_1_1base__mcmc.html#a4fb817f487dc4fe86a91acca8109ac2a',1,'stan::mcmc::base_mcmc']]], + ['base_5fmcmc',['base_mcmc',['../classstan_1_1mcmc_1_1base__mcmc.html',1,'stan::mcmc']]], + ['base_5fmcmc_2ehpp',['base_mcmc.hpp',['../base__mcmc_8hpp.html',1,'']]], + ['base_5fnuts',['base_nuts',['../classstan_1_1mcmc_1_1base__nuts.html#a553804373eddffd3b7079fe7cf25a611',1,'stan::mcmc::base_nuts']]], + ['base_5fnuts',['base_nuts',['../classstan_1_1mcmc_1_1base__nuts.html',1,'stan::mcmc']]], + ['base_5fnuts_2ehpp',['base_nuts.hpp',['../base__nuts_8hpp.html',1,'']]], + ['base_5fnuts_3c_20m_2c_20dense_5fe_5fpoint_2c_20dense_5fe_5fmetric_2c_20expl_5fleapfrog_2c_20baserng_20_3e',['base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >',['../classstan_1_1mcmc_1_1base__nuts.html',1,'stan::mcmc']]], + ['base_5fnuts_3c_20m_2c_20diag_5fe_5fpoint_2c_20diag_5fe_5fmetric_2c_20expl_5fleapfrog_2c_20baserng_20_3e',['base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >',['../classstan_1_1mcmc_1_1base__nuts.html',1,'stan::mcmc']]], + ['base_5fnuts_3c_20m_2c_20unit_5fe_5fpoint_2c_20unit_5fe_5fmetric_2c_20expl_5fleapfrog_2c_20baserng_20_3e',['base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >',['../classstan_1_1mcmc_1_1base__nuts.html',1,'stan::mcmc']]], + ['base_5fparam_5fname',['base_param_name',['../print_8hpp.html#a44680d963f2fac28eca89f94f3eb99dc',1,'print.hpp']]], + ['base_5fstatic_5fhmc',['base_static_hmc',['../classstan_1_1mcmc_1_1base__static__hmc.html#adc496c9b987be1297a40fa0e07e44fdf',1,'stan::mcmc::base_static_hmc']]], + ['base_5fstatic_5fhmc',['base_static_hmc',['../classstan_1_1mcmc_1_1base__static__hmc.html',1,'stan::mcmc']]], + ['base_5fstatic_5fhmc_2ehpp',['base_static_hmc.hpp',['../base__static__hmc_8hpp.html',1,'']]], + ['base_5fstatic_5fhmc_3c_20m_2c_20dense_5fe_5fpoint_2c_20dense_5fe_5fmetric_2c_20expl_5fleapfrog_2c_20baserng_20_3e',['base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >',['../classstan_1_1mcmc_1_1base__static__hmc.html',1,'stan::mcmc']]], + ['base_5fstatic_5fhmc_3c_20m_2c_20diag_5fe_5fpoint_2c_20diag_5fe_5fmetric_2c_20expl_5fleapfrog_2c_20baserng_20_3e',['base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >',['../classstan_1_1mcmc_1_1base__static__hmc.html',1,'stan::mcmc']]], + ['base_5fstatic_5fhmc_3c_20m_2c_20unit_5fe_5fpoint_2c_20unit_5fe_5fmetric_2c_20expl_5fleapfrog_2c_20baserng_20_3e',['base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >',['../classstan_1_1mcmc_1_1base__static__hmc.html',1,'stan::mcmc']]], + ['base_5ftype_5f',['base_type_',['../structstan_1_1gm_1_1expr__type.html#aefee7b86134990f92cce19ef8e88f800',1,'stan::gm::expr_type::base_type_()'],['../structstan_1_1gm_1_1base__var__decl.html#a55f45e9a1c2aec254ab96335f85b9399',1,'stan::gm::base_var_decl::base_type_()']]], + ['base_5ftype_5fto_5fstring',['base_type_to_string',['../namespacestan_1_1gm.html#a9c695724226e13246eefc23216841ffc',1,'stan::gm']]], + ['base_5fvar_5fdecl',['base_var_decl',['../structstan_1_1gm_1_1base__var__decl.html#afbf37085102e8852cc11bf7d3cc4e07a',1,'stan::gm::base_var_decl::base_var_decl()'],['../structstan_1_1gm_1_1base__var__decl.html#af89f3d0b355688ee0099f6300c045c19',1,'stan::gm::base_var_decl::base_var_decl(const base_expr_type &base_type)'],['../structstan_1_1gm_1_1base__var__decl.html#ad83579cb2af06544b1367d91d041b2ab',1,'stan::gm::base_var_decl::base_var_decl(const std::string &name, const std::vector< expression > &dims, const base_expr_type &base_type)']]], + ['base_5fvar_5fdecl',['base_var_decl',['../structstan_1_1gm_1_1base__var__decl.html',1,'stan::gm']]], + ['basic_5fvalidate',['basic_validate',['../structstan_1_1gm_1_1validate__var__decl__visgen.html#aee960e3728540789c2da4b55b95a6a14',1,'stan::gm::validate_var_decl_visgen']]], + ['bd_5f',['bd_',['../classstan_1_1agrad_1_1op__ddv__vari.html#ae35305f4cfd7182e903c8bc40b83e1e4',1,'stan::agrad::op_ddv_vari::bd_()'],['../classstan_1_1agrad_1_1op__vd__vari.html#aeb6e24f98c7ea9a0861d2651e78fba0f',1,'stan::agrad::op_vd_vari::bd_()'],['../classstan_1_1agrad_1_1op__vdd__vari.html#a287e3ff89d946a2eb877abbc525ed132',1,'stan::agrad::op_vdd_vari::bd_()'],['../classstan_1_1agrad_1_1op__vdv__vari.html#ac7de165236d121d5ee5dea22c131aa7f',1,'stan::agrad::op_vdv_vari::bd_()'],['../agrad__thread__safe_8hpp.html#a6bc687cb96fe2e6f4d9f4db190eb789f',1,'bd_(): agrad_thread_safe.hpp']]], + ['begin_5fupdate_5fp',['begin_update_p',['../classstan_1_1mcmc_1_1base__leapfrog.html#a32f9d6a2fdca2ac0b81941bece5ada93',1,'stan::mcmc::base_leapfrog::begin_update_p()'],['../classstan_1_1mcmc_1_1expl__leapfrog.html#a8db6aa8c6efa80ced2123390d02d1079',1,'stan::mcmc::expl_leapfrog::begin_update_p()']]], + ['bernoulli_2ehpp',['bernoulli.hpp',['../bernoulli_8hpp.html',1,'']]], + ['bernoulli_5fccdf_5flog',['bernoulli_ccdf_log',['../namespacestan_1_1prob.html#a726363482ee79c9eec5168e0662878ee',1,'stan::prob']]], + ['bernoulli_5fcdf',['bernoulli_cdf',['../namespacestan_1_1prob.html#acc2b8587b0d9e02ae857a2b3f5cba35d',1,'stan::prob']]], + ['bernoulli_5fcdf_5flog',['bernoulli_cdf_log',['../namespacestan_1_1prob.html#aba32173189278464e98a8126eb552cde',1,'stan::prob']]], + ['bernoulli_5flog',['bernoulli_log',['../namespacestan_1_1prob.html#a0bc33fe590391b82dab751bdadaf7b62',1,'stan::prob::bernoulli_log(const T_n &n, const T_prob &theta)'],['../namespacestan_1_1prob.html#a219ad54841aea16fc57524fca232f2e7',1,'stan::prob::bernoulli_log(const T_y &n, const T_prob &theta)']]], + ['bernoulli_5flogit_5flog',['bernoulli_logit_log',['../namespacestan_1_1prob.html#a5c8219bcfefefbfb4035de576837ab45',1,'stan::prob::bernoulli_logit_log(const T_n &n, const T_prob &theta)'],['../namespacestan_1_1prob.html#a41019ebe0811bb5c4dab0b3c2c836680',1,'stan::prob::bernoulli_logit_log(const T_n &n, const T_prob &theta)']]], + ['bernoulli_5frng',['bernoulli_rng',['../namespacestan_1_1prob.html#afea2d4a81899214550a87b8a09220620',1,'stan::prob']]], + ['bessel_5ffirst_5fkind',['bessel_first_kind',['../namespacestan_1_1agrad.html#a15ef0c83a99d3629e9ea8eb982ffe91c',1,'stan::agrad::bessel_first_kind(int v, const fvar< T > &z)'],['../namespacestan_1_1agrad.html#afc6ca13242211e5b43d3fcfb3bc8f3a7',1,'stan::agrad::bessel_first_kind(const int &v, const var &a)'],['../namespacestan_1_1math.html#aebfb3835848bd8550192cd5e090d3b5a',1,'stan::math::bessel_first_kind()']]], + ['bessel_5ffirst_5fkind_2ehpp',['bessel_first_kind.hpp',['../agrad_2fwd_2functions_2bessel__first__kind_8hpp.html',1,'']]], + ['bessel_5ffirst_5fkind_2ehpp',['bessel_first_kind.hpp',['../math_2functions_2bessel__first__kind_8hpp.html',1,'']]], + ['bessel_5ffirst_5fkind_2ehpp',['bessel_first_kind.hpp',['../agrad_2rev_2functions_2bessel__first__kind_8hpp.html',1,'']]], + ['bessel_5fsecond_5fkind',['bessel_second_kind',['../namespacestan_1_1agrad.html#a70cd3f5b630e4cae786470b8a7d70c62',1,'stan::agrad::bessel_second_kind(int v, const fvar< T > &z)'],['../namespacestan_1_1agrad.html#a17fd5151af2e0e715f84fbdcdea202cd',1,'stan::agrad::bessel_second_kind(const int &v, const var &a)'],['../namespacestan_1_1math.html#a645ce13c6454913ec39be807751604dc',1,'stan::math::bessel_second_kind()']]], + ['bessel_5fsecond_5fkind_2ehpp',['bessel_second_kind.hpp',['../agrad_2fwd_2functions_2bessel__second__kind_8hpp.html',1,'']]], + ['bessel_5fsecond_5fkind_2ehpp',['bessel_second_kind.hpp',['../agrad_2rev_2functions_2bessel__second__kind_8hpp.html',1,'']]], + ['bessel_5fsecond_5fkind_2ehpp',['bessel_second_kind.hpp',['../math_2functions_2bessel__second__kind_8hpp.html',1,'']]], + ['beta_2ehpp',['beta.hpp',['../beta_8hpp.html',1,'']]], + ['beta_5fbinomial_2ehpp',['beta_binomial.hpp',['../beta__binomial_8hpp.html',1,'']]], + ['beta_5fbinomial_5fccdf_5flog',['beta_binomial_ccdf_log',['../namespacestan_1_1prob.html#a5d2307b3b214c6a219dc1ae47cbba4d0',1,'stan::prob']]], + ['beta_5fbinomial_5fcdf',['beta_binomial_cdf',['../namespacestan_1_1prob.html#a6549c9b89bee939a79c35a797977e48e',1,'stan::prob']]], + ['beta_5fbinomial_5fcdf_5flog',['beta_binomial_cdf_log',['../namespacestan_1_1prob.html#a260dee97213ab1ea2bcb345f2e5699f8',1,'stan::prob']]], + ['beta_5fbinomial_5flog',['beta_binomial_log',['../namespacestan_1_1prob.html#a6b05e0ee6a8e83b15ab01a8bd2f75621',1,'stan::prob::beta_binomial_log(const T_n &n, const T_N &N, const T_size1 &alpha, const T_size2 &beta)'],['../namespacestan_1_1prob.html#a08bb45fa7fefa94d7e243b4df5686909',1,'stan::prob::beta_binomial_log(const T_n &n, const T_N &N, const T_size1 &alpha, const T_size2 &beta)']]], + ['beta_5fbinomial_5frng',['beta_binomial_rng',['../namespacestan_1_1prob.html#a0ab5a0632c3782b2feed87f13731a3cb',1,'stan::prob']]], + ['beta_5fccdf_5flog',['beta_ccdf_log',['../namespacestan_1_1prob.html#a2cf7120d50b02585fd722748e624b13e',1,'stan::prob']]], + ['beta_5fcdf',['beta_cdf',['../namespacestan_1_1prob.html#ae99fab56f54c2e0f879345eee28b82ca',1,'stan::prob']]], + ['beta_5fcdf_5flog',['beta_cdf_log',['../namespacestan_1_1prob.html#ab63ea302e7cd29f7a5f3f23152b3de1f',1,'stan::prob']]], + ['beta_5flog',['beta_log',['../namespacestan_1_1prob.html#adcb4e073c7510ab55a2fd6f310168559',1,'stan::prob::beta_log(const T_y &y, const T_scale_succ &alpha, const T_scale_fail &beta)'],['../namespacestan_1_1prob.html#a76da5fc9b833aaf3844f98e9d032bb83',1,'stan::prob::beta_log(const T_y &y, const T_scale_succ &alpha, const T_scale_fail &beta)']]], + ['beta_5frng',['beta_rng',['../namespacestan_1_1prob.html#af9ffa205c1948b93323a12b13954558b',1,'stan::prob']]], + ['bfgs_2ehpp',['bfgs.hpp',['../bfgs_8hpp.html',1,'']]], + ['bfgslinesearch',['BFGSLineSearch',['../classstan_1_1optimization_1_1_b_f_g_s_line_search.html#a4979246eff3a7ea7e456ff6a78b9f947',1,'stan::optimization::BFGSLineSearch']]], + ['bfgslinesearch',['BFGSLineSearch',['../classstan_1_1optimization_1_1_b_f_g_s_line_search.html',1,'stan::optimization']]], + ['bfgsminimizer',['BFGSMinimizer',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a49e517b4678f438f201bea8576ca1b2f',1,'stan::optimization::BFGSMinimizer']]], + ['bfgsminimizer',['BFGSMinimizer',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html',1,'stan::optimization']]], + ['bfgsminimizer_3c_20modeladaptor_3c_20m_20_3e_20_3e',['BFGSMinimizer< ModelAdaptor< M > >',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html',1,'stan::optimization']]], + ['bfgsoptions',['BFGSOptions',['../structstan_1_1optimization_1_1_b_f_g_s_minimizer_1_1_b_f_g_s_options.html',1,'stan::optimization::BFGSMinimizer']]], + ['bfgsoptions',['BFGSOptions',['../structstan_1_1optimization_1_1_b_f_g_s_minimizer_1_1_b_f_g_s_options.html#a73b45c4d12854633eaa946de5c3def7b',1,'stan::optimization::BFGSMinimizer::BFGSOptions']]], + ['binary_5flog_5floss',['binary_log_loss',['../namespacestan_1_1agrad.html#af5d9abde22a78da0378d464f1ce24544',1,'stan::agrad::binary_log_loss(const int y, const fvar< T > &y_hat)'],['../namespacestan_1_1agrad.html#acbbcd95da81df518f28454f7d2cb8772',1,'stan::agrad::binary_log_loss(const int y, const stan::agrad::var &y_hat)'],['../namespacestan_1_1math.html#add2a043f562537b8cc57bb35780ac5b5',1,'stan::math::binary_log_loss()']]], + ['binary_5flog_5floss_2ehpp',['binary_log_loss.hpp',['../agrad_2fwd_2functions_2binary__log__loss_8hpp.html',1,'']]], + ['binary_5flog_5floss_2ehpp',['binary_log_loss.hpp',['../math_2functions_2binary__log__loss_8hpp.html',1,'']]], + ['binary_5flog_5floss_2ehpp',['binary_log_loss.hpp',['../agrad_2rev_2functions_2binary__log__loss_8hpp.html',1,'']]], + ['binary_5fop',['binary_op',['../structstan_1_1gm_1_1binary__op.html',1,'stan::gm']]], + ['binary_5fop',['binary_op',['../structstan_1_1gm_1_1binary__op.html#a65335603651a7ea889960d4cddebcac4',1,'stan::gm::binary_op::binary_op()'],['../structstan_1_1gm_1_1binary__op.html#a78c4a1e12c510a73c172bc8155118678',1,'stan::gm::binary_op::binary_op(const expression &left, const std::string &op, const expression &right)']]], + ['binary_5fop_5fexpr',['binary_op_expr',['../structstan_1_1gm_1_1binary__op__expr.html',1,'stan::gm']]], + ['binary_5fop_5ff',['binary_op_f',['../namespacestan_1_1gm.html#ac468cb2fce622382db58f8e9f2f6c628',1,'stan::gm']]], + ['binomial_2ehpp',['binomial.hpp',['../binomial_8hpp.html',1,'']]], + ['binomial_5fccdf_5flog',['binomial_ccdf_log',['../namespacestan_1_1prob.html#a6a5c4f320e9c4fd342a2bc95cd5cab06',1,'stan::prob']]], + ['binomial_5fcdf',['binomial_cdf',['../namespacestan_1_1prob.html#aeed3ba1a20bc8adb20b6a15d35945533',1,'stan::prob']]], + ['binomial_5fcdf_5flog',['binomial_cdf_log',['../namespacestan_1_1prob.html#ab5b95dc562c6fc2d9474debaae03903c',1,'stan::prob']]], + ['binomial_5fcoefficient_5flog',['binomial_coefficient_log',['../namespacestan_1_1agrad.html#a4ec7cdb5d5ad2c9b0a0257398570e55b',1,'stan::agrad::binomial_coefficient_log(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a02695b9403bc2bd772610aec257b71ab',1,'stan::agrad::binomial_coefficient_log(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#a9b9e7ad2199a7cbcf958b4bab56eb5ba',1,'stan::agrad::binomial_coefficient_log(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1math.html#a27dad23d38c6d5e74c65e7571c70272e',1,'stan::math::binomial_coefficient_log()']]], + ['binomial_5fcoefficient_5flog_2ehpp',['binomial_coefficient_log.hpp',['../math_2functions_2binomial__coefficient__log_8hpp.html',1,'']]], + ['binomial_5fcoefficient_5flog_2ehpp',['binomial_coefficient_log.hpp',['../agrad_2fwd_2functions_2binomial__coefficient__log_8hpp.html',1,'']]], + ['binomial_5flog',['binomial_log',['../namespacestan_1_1prob.html#ad12aae68875554db5a4e4934bfa1e24a',1,'stan::prob::binomial_log(const T_n &n, const T_N &N, const T_prob &theta)'],['../namespacestan_1_1prob.html#a255338df1c9dc1edcaf556ec019e70f9',1,'stan::prob::binomial_log(const T_n &n, const T_N &N, const T_prob &theta)']]], + ['binomial_5flogit_5flog',['binomial_logit_log',['../namespacestan_1_1prob.html#aeec51733f46d26326f271edaeb2c85fd',1,'stan::prob::binomial_logit_log(const T_n &n, const T_N &N, const T_prob &alpha)'],['../namespacestan_1_1prob.html#a36b4660673caceb27df26e36771d3b82',1,'stan::prob::binomial_logit_log(const T_n &n, const T_N &N, const T_prob &alpha)']]], + ['binomial_5frng',['binomial_rng',['../namespacestan_1_1prob.html#a4fedb58fc6bbe6d006bab9fe0b72c2d2',1,'stan::prob']]], + ['block',['block',['../namespacestan_1_1math.html#af163dfd071f1cff0297b7418156563a8',1,'stan::math']]], + ['block_2ehpp',['block.hpp',['../block_8hpp.html',1,'']]], + ['bodies_5f',['bodies_',['../structstan_1_1gm_1_1conditional__statement.html#aa050a0eba5609aba1a82615cab5be84b',1,'stan::gm::conditional_statement']]], + ['body_5f',['body_',['../structstan_1_1gm_1_1while__statement.html#a02751b1da71e77005c2e31df9c901997',1,'stan::gm::while_statement']]], + ['bool_5fargument',['bool_argument',['../namespacestan_1_1gm.html#adb787df02fb46fca9c39b4d8f2438a28',1,'stan::gm']]], + ['boost',['boost',['../namespaceboost.html',1,'']]], + ['boost_2edox',['boost.dox',['../boost_8dox.html',1,'']]], + ['boost_5ffpclassify_2ehpp',['boost_fpclassify.hpp',['../boost__fpclassify_8hpp.html',1,'']]], + ['boost_5ffusion_5fadapt_5fstruct',['BOOST_FUSION_ADAPT_STRUCT',['../program__grammar__def_8hpp.html#ada0ff5807ec701c3ec7f2ecc0d99aaf4',1,'BOOST_FUSION_ADAPT_STRUCT(stan::gm::program,(std::vector< stan::gm::var_decl >, data_decl_)(DUMMY_STRUCT::type, derived_data_decl_)(std::vector< stan::gm::var_decl >, parameter_decl_)(DUMMY_STRUCT::type, derived_decl_)(stan::gm::statement, statement_)(DUMMY_STRUCT::type, generated_decl_)) namespace stan: program_grammar_def.hpp'],['../statement__grammar__def_8hpp.html#a7bcb20f801376d20d08e7bbf352e88b8',1,'BOOST_FUSION_ADAPT_STRUCT(stan::gm::assignment,(stan::gm::variable_dims, var_dims_)(stan::gm::expression, expr_)): statement_grammar_def.hpp'],['../statement__grammar__def_8hpp.html#aaa7e207109145caa601bf2d96667b5a8',1,'BOOST_FUSION_ADAPT_STRUCT(stan::gm::variable_dims,(std::string, name_)(std::vector< stan::gm::expression >, dims_)): statement_grammar_def.hpp'],['../statement__grammar__def_8hpp.html#a6961e24e92dd0d1f84976386c45cc1b6',1,'BOOST_FUSION_ADAPT_STRUCT(stan::gm::distribution,(std::string, family_)(std::vector< stan::gm::expression >, args_)): statement_grammar_def.hpp'],['../statement__grammar__def_8hpp.html#a1cae61dafe9d4dd9285b7b6f76d05f92',1,'BOOST_FUSION_ADAPT_STRUCT(stan::gm::for_statement,(std::string, variable_)(stan::gm::range, range_)(stan::gm::statement, statement_)): statement_grammar_def.hpp'],['../statement__grammar__def_8hpp.html#af7c34bfed453a4a6d29961f3abe165cf',1,'BOOST_FUSION_ADAPT_STRUCT(stan::gm::print_statement,(std::vector< stan::gm::printable >, printables_)): statement_grammar_def.hpp'],['../statement__grammar__def_8hpp.html#a2495608d80afb728361556d665a415c4',1,'BOOST_FUSION_ADAPT_STRUCT(stan::gm::statements,(std::vector< stan::gm::var_decl >, local_decl_)(std::vector< stan::gm::statement >, statements_)): statement_grammar_def.hpp'],['../term__grammar__def_8hpp.html#a2aa48ab7197d456209104ec48170e6e7',1,'BOOST_FUSION_ADAPT_STRUCT(stan::gm::index_op,(stan::gm::expression, expr_)(std::vector< std::vector< stan::gm::expression > >, dimss_)): term_grammar_def.hpp'],['../term__grammar__def_8hpp.html#a480456e9da4c14c5519988cdc778facc',1,'BOOST_FUSION_ADAPT_STRUCT(stan::gm::fun,(std::string, name_)(std::vector< stan::gm::expression >, args_)): term_grammar_def.hpp'],['../term__grammar__def_8hpp.html#a1e81a41b83af331d2ab9038c3ab22c8e',1,'BOOST_FUSION_ADAPT_STRUCT(stan::gm::int_literal,(int, val_)(stan::gm::expr_type, type_)): term_grammar_def.hpp'],['../term__grammar__def_8hpp.html#a449100aff0b5136c9793061cb929bec8',1,'BOOST_FUSION_ADAPT_STRUCT(stan::gm::double_literal,(double, val_)(stan::gm::expr_type, type_)): term_grammar_def.hpp'],['../var__decls__grammar__def_8hpp.html#a1bf1e318d7e36dbd7a26eb65a05fcd13',1,'BOOST_FUSION_ADAPT_STRUCT(stan::gm::int_var_decl,(stan::gm::range, range_)(std::string, name_)(std::vector< stan::gm::expression >, dims_)) BOOST_FUSION_ADAPT_STRUCT(stan: var_decls_grammar_def.hpp']]], + ['build_5ftree',['build_tree',['../classstan_1_1mcmc_1_1base__nuts.html#abfa3f7a87c96c0021bbd4e9a87ad9f4b',1,'stan::mcmc::base_nuts']]], + ['bvi_5f',['bvi_',['../classstan_1_1agrad_1_1op__dv__vari.html#a98d635e1f027bdfc2b334b4e1c37c3ac',1,'stan::agrad::op_dv_vari::bvi_()'],['../classstan_1_1agrad_1_1op__dvd__vari.html#ac260097674d6178986ce2bca1bf06f18',1,'stan::agrad::op_dvd_vari::bvi_()'],['../classstan_1_1agrad_1_1op__dvv__vari.html#a7e8348772bd3a834702dbaf107102fcf',1,'stan::agrad::op_dvv_vari::bvi_()'],['../classstan_1_1agrad_1_1op__vv__vari.html#ad5479c2e11d97e789b12555069856f64',1,'stan::agrad::op_vv_vari::bvi_()'],['../classstan_1_1agrad_1_1op__vvd__vari.html#a641c2f4fdf8fb63130bf1ac50705ca11',1,'stan::agrad::op_vvd_vari::bvi_()'],['../classstan_1_1agrad_1_1op__vvv__vari.html#a3bff8e5ca6a08bba14b5383ee5af0526',1,'stan::agrad::op_vvv_vari::bvi_()'],['../agrad__thread__safe_8hpp.html#adf2a9af952f9152b9565cce4349b3dbc',1,'bvi_(): agrad_thread_safe.hpp']]], + ['math',['math',['../namespaceboost_1_1math.html',1,'boost']]] +]; diff --git a/doc/api/html/search/all_63.html b/doc/api/html/search/all_63.html new file mode 100644 index 00000000000..56b5ad1e9ea --- /dev/null +++ b/doc/api/html/search/all_63.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/all_63.js b/doc/api/html/search/all_63.js new file mode 100644 index 00000000000..0174e124c0c --- /dev/null +++ b/doc/api/html/search/all_63.js @@ -0,0 +1,213 @@ +var searchData= +[ + ['bare_3c_20std_3a_3astring_20_3e',['bare< std::string >',['../namespacestan_1_1io.html#aec5638401c1a9174c2a1755dbb9b9a1c',1,'stan::io']]], + ['c1',['c1',['../structstan_1_1optimization_1_1_b_f_g_s_minimizer_1_1_b_f_g_s_options.html#a77d9e5ac3274c6810e1aacc63df5dbe1',1,'stan::optimization::BFGSMinimizer::BFGSOptions']]], + ['c2',['c2',['../structstan_1_1optimization_1_1_b_f_g_s_minimizer_1_1_b_f_g_s_options.html#a6379b29a858127f1ef3cc0ab5426cc82',1,'stan::optimization::BFGSMinimizer::BFGSOptions']]], + ['c_5f',['C_',['../agrad_2rev_2matrix_2ldlt_8hpp.html#aaed1328a1a8dc253591d2941edfec676',1,'C_(): ldlt.hpp'],['../agrad_2rev_2matrix_2mdivide__left_8hpp.html#a03e9f8989e0f5a0117b426e2b204933a',1,'C_(): mdivide_left.hpp'],['../agrad_2rev_2matrix_2mdivide__left__spd_8hpp.html#a71042c83f662a5f71b52b6e6c2ae4915',1,'C_(): mdivide_left_spd.hpp'],['../agrad_2rev_2matrix_2mdivide__left__tri_8hpp.html#a03e9f8989e0f5a0117b426e2b204933a',1,'C_(): mdivide_left_tri.hpp'],['../agrad_2rev_2matrix_2quad__form_8hpp.html#a55687fe74d2b370950b50b750657c48e',1,'C_(): quad_form.hpp']]], + ['calculate_5fchain',['calculate_chain',['../namespacestan_1_1agrad.html#aa16e752d268f0240dab6f484fe0026da',1,'stan::agrad']]], + ['calculate_5fchain_2ehpp',['calculate_chain.hpp',['../calculate__chain_8hpp.html',1,'']]], + ['calculate_5fcolumn_5fwidth',['calculate_column_width',['../print_8hpp.html#a5e7bd64dd538b38c24f0950e20336b9e',1,'print.hpp']]], + ['calculate_5fcolumn_5fwidths',['calculate_column_widths',['../print_8hpp.html#aca6645f28f92ff465e290fef0fefa9bc',1,'print.hpp']]], + ['categorical_2ehpp',['categorical.hpp',['../categorical_8hpp.html',1,'']]], + ['categorical_5fargument',['categorical_argument',['../classstan_1_1gm_1_1categorical__argument.html',1,'stan::gm']]], + ['categorical_5fargument_2ehpp',['categorical_argument.hpp',['../categorical__argument_8hpp.html',1,'']]], + ['categorical_5flog',['categorical_log',['../namespacestan_1_1prob.html#af95a794f03919aea39098f278d2c59d6',1,'stan::prob::categorical_log(int n, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta)'],['../namespacestan_1_1prob.html#a246986bd8f60af47c1f81ebb814dd563',1,'stan::prob::categorical_log(const typename Eigen::Matrix< T_prob, Eigen::Dynamic, 1 >::size_type n, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta)'],['../namespacestan_1_1prob.html#a02f82adf130605305c98f4e011bbe9ac',1,'stan::prob::categorical_log(const std::vector< int > &ns, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta)'],['../namespacestan_1_1prob.html#a16675570c76e20595a8a6b7b1beeabea',1,'stan::prob::categorical_log(const std::vector< int > &ns, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta)']]], + ['categorical_5flogit_2ehpp',['categorical_logit.hpp',['../categorical__logit_8hpp.html',1,'']]], + ['categorical_5flogit_5flog',['categorical_logit_log',['../namespacestan_1_1prob.html#a2a925c941d407c44cac03cfdee07c20f',1,'stan::prob::categorical_logit_log(int n, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &beta)'],['../namespacestan_1_1prob.html#a56b41ad5a9d6c90837fe573771174921',1,'stan::prob::categorical_logit_log(int n, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &beta)'],['../namespacestan_1_1prob.html#a3fa98ec586dbbbceafb56261324b5170',1,'stan::prob::categorical_logit_log(const std::vector< int > &ns, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &beta)'],['../namespacestan_1_1prob.html#a9195250cdb8eb73cbfc24e6b78ce8fcb',1,'stan::prob::categorical_logit_log(const std::vector< int > &ns, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &beta)']]], + ['categorical_5frng',['categorical_rng',['../namespacestan_1_1prob.html#a4c3ca0ee1deca1cacd5211bbc995152e',1,'stan::prob']]], + ['cauchy_2ehpp',['cauchy.hpp',['../cauchy_8hpp.html',1,'']]], + ['cauchy_5fccdf_5flog',['cauchy_ccdf_log',['../namespacestan_1_1prob.html#ac70c31a88a9078a1abe3b7404504f1fe',1,'stan::prob']]], + ['cauchy_5fcdf',['cauchy_cdf',['../namespacestan_1_1prob.html#a47c7985de17346e84f8d63941d094c6f',1,'stan::prob']]], + ['cauchy_5fcdf_5flog',['cauchy_cdf_log',['../namespacestan_1_1prob.html#a438076c7412e6cc425b59489fd2288c3',1,'stan::prob']]], + ['cauchy_5flog',['cauchy_log',['../namespacestan_1_1prob.html#a336c31f3968917b4cb73fdd6bcb7dbda',1,'stan::prob::cauchy_log(const T_y &y, const T_loc &mu, const T_scale &sigma)'],['../namespacestan_1_1prob.html#adeee6144ac19be6775669835d4b0a544',1,'stan::prob::cauchy_log(const T_y &y, const T_loc &mu, const T_scale &sigma)']]], + ['cauchy_5frng',['cauchy_rng',['../namespacestan_1_1prob.html#a018d09865f9ab743ec78422a4e69d2d0',1,'stan::prob']]], + ['cbrt',['cbrt',['../namespacestan_1_1agrad.html#a183eb686f1c72d5de6a1997e53bd2b49',1,'stan::agrad::cbrt(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#a56daa2a3973305eca89f54b45b215b08',1,'stan::agrad::cbrt(const stan::agrad::var &a)']]], + ['cbrt_2ehpp',['cbrt.hpp',['../fwd_2functions_2cbrt_8hpp.html',1,'']]], + ['cbrt_2ehpp',['cbrt.hpp',['../rev_2functions_2cbrt_8hpp.html',1,'']]], + ['cd_5f',['cd_',['../classstan_1_1agrad_1_1op__dvd__vari.html#afb19614ab6249ef02fd7b25cffc08025',1,'stan::agrad::op_dvd_vari::cd_()'],['../classstan_1_1agrad_1_1op__vdd__vari.html#a07feae28b7d06e95a4c5221728eaeb59',1,'stan::agrad::op_vdd_vari::cd_()'],['../classstan_1_1agrad_1_1op__vvd__vari.html#a77be8bf88a35750ac9bb0d6c7bd77d1a',1,'stan::agrad::op_vvd_vari::cd_()'],['../agrad__thread__safe_8hpp.html#a1671afec9ddeea25855e744cb53988f4',1,'cd_(): agrad_thread_safe.hpp']]], + ['ceil',['ceil',['../namespacestan_1_1agrad.html#a3edfb95b57f8b42c6c68968628ba0158',1,'stan::agrad::ceil(const var &a)'],['../namespacestan_1_1agrad.html#ab5aa6d910a8a47ea9fc1b6199d710069',1,'stan::agrad::ceil(const fvar< T > &x)']]], + ['ceil_2ehpp',['ceil.hpp',['../fwd_2functions_2ceil_8hpp.html',1,'']]], + ['ceil_2ehpp',['ceil.hpp',['../rev_2functions_2ceil_8hpp.html',1,'']]], + ['central_5finterval',['central_interval',['../classstan_1_1mcmc_1_1chains.html#afc466fb86c162616dc6db2d4a6904e81',1,'stan::mcmc::chains::central_interval(const int chain, const int index, const double prob)'],['../classstan_1_1mcmc_1_1chains.html#a819d8aff3c3b7c40de79e493850deba3',1,'stan::mcmc::chains::central_interval(const int index, const double prob)'],['../classstan_1_1mcmc_1_1chains.html#a3c52c722eb9f5d1bde7b27307602f592',1,'stan::mcmc::chains::central_interval(const int chain, const std::string &name, const double prob)'],['../classstan_1_1mcmc_1_1chains.html#a7dcc333dfe0d01bf595700bd72e5999f',1,'stan::mcmc::chains::central_interval(const std::string &name, const double prob)']]], + ['chain',['chain',['../classstan_1_1agrad_1_1vari.html#aa0a84901028b116fad7020b30b926b98',1,'stan::agrad::vari::chain()'],['../classstan_1_1agrad_1_1partials__vari.html#a0fa792b38fdadfd389dcffcea597deeb',1,'stan::agrad::partials_vari::chain()'],['../classstan_1_1agrad_1_1chainable.html#a4d1b4d61c1b10d6da4ababce3d276592',1,'stan::agrad::chainable::chain()'],['../classstan_1_1agrad_1_1precomp__v__vari.html#a009196476cbeca0b4721a2615e275d10',1,'stan::agrad::precomp_v_vari::chain()'],['../classstan_1_1agrad_1_1stored__gradient__vari.html#ae97f9740598ac7be4c3af5769a54ac19',1,'stan::agrad::stored_gradient_vari::chain()']]], + ['chain_5fid',['chain_id',['../structstan_1_1io_1_1stan__csv__metadata.html#ad18cd985fe4d6c8c451950cc158438e4',1,'stan::io::stan_csv_metadata']]], + ['chainable',['chainable',['../classstan_1_1agrad_1_1chainable.html',1,'stan::agrad']]], + ['chainable',['chainable',['../classstan_1_1agrad_1_1chainable.html#a7a645b2e90197e1d6a0431707b7fad59',1,'stan::agrad::chainable']]], + ['chainable_2ehpp',['chainable.hpp',['../chainable_8hpp.html',1,'']]], + ['chainable_5falloc',['chainable_alloc',['../classstan_1_1agrad_1_1chainable__alloc.html#a0e5e6212324cb2453fd58b961aa1f098',1,'stan::agrad::chainable_alloc']]], + ['chainable_5falloc',['chainable_alloc',['../classstan_1_1agrad_1_1chainable__alloc.html',1,'stan::agrad']]], + ['chains',['chains',['../classstan_1_1mcmc_1_1chains.html',1,'stan::mcmc']]], + ['chains',['chains',['../classstan_1_1mcmc_1_1chains.html#ac3aa526b28133ca5e40369f1267abd51',1,'stan::mcmc::chains::chains(const Eigen::Matrix< std::string, Eigen::Dynamic, 1 > &param_names)'],['../classstan_1_1mcmc_1_1chains.html#a9155b524e66935f9e30bac5d6ae31a53',1,'stan::mcmc::chains::chains(const stan::io::stan_csv &stan_csv)']]], + ['chains_2ehpp',['chains.hpp',['../chains_8hpp.html',1,'']]], + ['check_5fbounded',['check_bounded',['../namespacestan_1_1math.html#a244fb67601cb568b79137450f934047b',1,'stan::math::check_bounded(const char *function, const T_y &y, const T_low &low, const T_high &high, const char *name, T_result *result)'],['../namespacestan_1_1math.html#a1e00f0db84045333d946bb2a49b924ac',1,'stan::math::check_bounded(const char *function, const T_y &y, const T_low &low, const T_high &high, const char *name)']]], + ['check_5fbounded_2ehpp',['check_bounded.hpp',['../check__bounded_8hpp.html',1,'']]], + ['check_5fcholesky_5ffactor',['check_cholesky_factor',['../namespacestan_1_1math.html#a6ea62b7ae38dc4b6a84bfe90f72b1fc9',1,'stan::math::check_cholesky_factor(const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)'],['../namespacestan_1_1math.html#ab78172933a2bd63bdd511f062564a505',1,'stan::math::check_cholesky_factor(const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)'],['../namespacestan_1_1math.html#a63e498bfd9699c99b57b207e2869023a',1,'stan::math::check_cholesky_factor(const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, T_result *result)'],['../namespacestan_1_1math.html#a1bba6a9591ff4834950d8819d17ec105',1,'stan::math::check_cholesky_factor(const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, T *result=0)']]], + ['check_5fcholesky_5ffactor_2ehpp',['check_cholesky_factor.hpp',['../check__cholesky__factor_8hpp.html',1,'']]], + ['check_5fconsistent_5fsize',['check_consistent_size',['../namespacestan_1_1math.html#a8987da44a92a90edb79fd84fd39e39d3',1,'stan::math']]], + ['check_5fconsistent_5fsize_2ehpp',['check_consistent_size.hpp',['../check__consistent__size_8hpp.html',1,'']]], + ['check_5fconsistent_5fsizes',['check_consistent_sizes',['../namespacestan_1_1math.html#ac0e0ad1687b604c6f0667a12922a2545',1,'stan::math::check_consistent_sizes(const char *function, const T1 &x1, const T2 &x2, const char *name1, const char *name2, T_result *result)'],['../namespacestan_1_1math.html#a0a4c9f7aec5e75731b7e3d0c33a758b6',1,'stan::math::check_consistent_sizes(const char *function, const T1 &x1, const T2 &x2, const T3 &x3, const char *name1, const char *name2, const char *name3, T_result *result)'],['../namespacestan_1_1math.html#a1244db32f5cb1447091b8f7965fe09d6',1,'stan::math::check_consistent_sizes(const char *function, const T1 &x1, const T2 &x2, const T3 &x3, const T4 &x4, const char *name1, const char *name2, const char *name3, const char *name4, T_result *result)']]], + ['check_5fconsistent_5fsizes_2ehpp',['check_consistent_sizes.hpp',['../check__consistent__sizes_8hpp.html',1,'']]], + ['check_5fcorr_5fmatrix',['check_corr_matrix',['../namespacestan_1_1math.html#a19892bf98f113034430413117fddd012',1,'stan::math::check_corr_matrix(const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)'],['../namespacestan_1_1math.html#ad32dc573d6046854e39913596554961b',1,'stan::math::check_corr_matrix(const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)']]], + ['check_5fcorr_5fmatrix_2ehpp',['check_corr_matrix.hpp',['../check__corr__matrix_8hpp.html',1,'']]], + ['check_5fcov_5fmatrix',['check_cov_matrix',['../namespacestan_1_1math.html#a90326b7bfecdcd28d2555c001ca7cf0f',1,'stan::math::check_cov_matrix(const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)'],['../namespacestan_1_1math.html#adf9d505abaaf8ae26ad366f51d71fbd8',1,'stan::math::check_cov_matrix(const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)'],['../namespacestan_1_1math.html#aea06d3b49639cdd7f4eee1a9e21d01a0',1,'stan::math::check_cov_matrix(const char *function, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma, T_result *result)'],['../namespacestan_1_1math.html#ac60a94eb57a3b80ccdb54d75a38d5aa4',1,'stan::math::check_cov_matrix(const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &Sigma, T *result=0)']]], + ['check_5fcov_5fmatrix_2ehpp',['check_cov_matrix.hpp',['../check__cov__matrix_8hpp.html',1,'']]], + ['check_5ffinite',['check_finite',['../namespacestan_1_1math.html#af6feab878b8ff447121df2e6a9461680',1,'stan::math::check_finite(const char *function, const T_y &y, const char *name, T_result *result)'],['../namespacestan_1_1math.html#a46c87d5d26732e2860ae58d00f4fdff2',1,'stan::math::check_finite(const char *function, const T &y, const char *name)']]], + ['check_5ffinite_2ehpp',['check_finite.hpp',['../check__finite_8hpp.html',1,'']]], + ['check_5fgreater',['check_greater',['../namespacestan_1_1math.html#aada3014caf18d49104f7d63d0d6ea15e',1,'stan::math::check_greater(const char *function, const T_y &y, const T_low &low, const char *name, T_result *result)'],['../namespacestan_1_1math.html#aaaf1c4b2de4ed60a01fe919a0b3655fd',1,'stan::math::check_greater(const char *function, const T_y &y, const T_low &low, const char *name)']]], + ['check_5fgreater_2ehpp',['check_greater.hpp',['../check__greater_8hpp.html',1,'']]], + ['check_5fgreater_5for_5fequal',['check_greater_or_equal',['../namespacestan_1_1math.html#adbb58d3f6d9657f8488bc74a6db0a056',1,'stan::math::check_greater_or_equal(const char *function, const T_y &y, const T_low &low, const char *name, T_result *result)'],['../namespacestan_1_1math.html#abe66408d89f69a9d59b13d7c3d73423b',1,'stan::math::check_greater_or_equal(const char *function, const T_y &y, const T_low &low, const char *name)']]], + ['check_5fgreater_5for_5fequal_2ehpp',['check_greater_or_equal.hpp',['../check__greater__or__equal_8hpp.html',1,'']]], + ['check_5fless',['check_less',['../namespacestan_1_1math.html#a7187754b7dfb0727664c3bed40ccf7b4',1,'stan::math::check_less(const char *function, const T_y &y, const T_high &high, const char *name, T_result *result)'],['../namespacestan_1_1math.html#a359cf57677ad750cbe12441ba34df391',1,'stan::math::check_less(const char *function, const T_y &y, const T_high &high, const char *name)']]], + ['check_5fless_2ehpp',['check_less.hpp',['../check__less_8hpp.html',1,'']]], + ['check_5fless_5for_5fequal',['check_less_or_equal',['../namespacestan_1_1math.html#a1c5a1e6a543017c50d64bcdd9d53bd83',1,'stan::math::check_less_or_equal(const char *function, const T_y &y, const T_high &high, const char *name, T_result *result)'],['../namespacestan_1_1math.html#adaaa5ed482610e1a8c0477cdd60e8033',1,'stan::math::check_less_or_equal(const char *function, const T_y &y, const T_high &high, const char *name)']]], + ['check_5fless_5for_5fequal_2ehpp',['check_less_or_equal.hpp',['../check__less__or__equal_8hpp.html',1,'']]], + ['check_5flower_5ftriangular',['check_lower_triangular',['../namespacestan_1_1math.html#a54f45f5cee19ad65fdd516e1b855d0fe',1,'stan::math::check_lower_triangular(const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)'],['../namespacestan_1_1math.html#a5cd9fc9fd09527b5b8adf811d3d5b5e5',1,'stan::math::check_lower_triangular(const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)']]], + ['check_5flower_5ftriangular_2ehpp',['check_lower_triangular.hpp',['../check__lower__triangular_8hpp.html',1,'']]], + ['check_5fnonnegative',['check_nonnegative',['../namespacestan_1_1math.html#a68e2e1e4423183dabe9e5cdad6bee6c2',1,'stan::math::check_nonnegative(const char *function, const T_y &y, const char *name, T_result *result)'],['../namespacestan_1_1math.html#a88d0fc72c0c2a6612f355cd48ddffab8',1,'stan::math::check_nonnegative(const char *function, const T_y &y, const char *name)']]], + ['check_5fnonnegative_2ehpp',['check_nonnegative.hpp',['../check__nonnegative_8hpp.html',1,'']]], + ['check_5fnot_5fnan',['check_not_nan',['../namespacestan_1_1math.html#aee36bc9bba89bed1d1568d20046cd3da',1,'stan::math::check_not_nan(const char *function, const T_y &y, const char *name, T_result *result=0)'],['../namespacestan_1_1math.html#a4d490dd2ffa3a5775cfd4f5347111505',1,'stan::math::check_not_nan(const char *function, const T &y, const char *name)']]], + ['check_5fnot_5fnan_2ehpp',['check_not_nan.hpp',['../check__not__nan_8hpp.html',1,'']]], + ['check_5fordered',['check_ordered',['../namespacestan_1_1math.html#a55bd442a2e6c56c40d7b60d0079ac8a7',1,'stan::math::check_ordered(const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const char *name, T_result *result)'],['../namespacestan_1_1math.html#a69935f4ef1aad90e6a48c49ba945efc2',1,'stan::math::check_ordered(const char *function, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &y, const char *name, T *result=0)']]], + ['check_5fordered_2ehpp',['check_ordered.hpp',['../check__ordered_8hpp.html',1,'']]], + ['check_5fpos_5fdefinite',['check_pos_definite',['../namespacestan_1_1agrad.html#a5f647d8ef1686ba2b85035726e395f40',1,'stan::agrad::check_pos_definite()'],['../namespacestan_1_1math.html#aa543443cb0c96a44613255c83d593a86',1,'stan::math::check_pos_definite(const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)'],['../namespacestan_1_1math.html#aa38f7f1aacfd755763e5b00af14ff9b6',1,'stan::math::check_pos_definite(const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)']]], + ['check_5fpos_5fdefinite_2ehpp',['check_pos_definite.hpp',['../agrad_2rev_2error__handling_2matrix_2check__pos__definite_8hpp.html',1,'']]], + ['check_5fpos_5fdefinite_2ehpp',['check_pos_definite.hpp',['../math_2error__handling_2matrix_2check__pos__definite_8hpp.html',1,'']]], + ['check_5fpos_5fsemidefinite',['check_pos_semidefinite',['../namespacestan_1_1math.html#a7341142ee291b13f1ad04152a37f974f',1,'stan::math::check_pos_semidefinite(const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)'],['../namespacestan_1_1math.html#af9a161786def6581011502056d92c021',1,'stan::math::check_pos_semidefinite(const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)']]], + ['check_5fpos_5fsemidefinite_2ehpp',['check_pos_semidefinite.hpp',['../check__pos__semidefinite_8hpp.html',1,'']]], + ['check_5fpositive',['check_positive',['../namespacestan_1_1math.html#a573ec8402d9e6928596057ee179a96a9',1,'stan::math::check_positive(const char *function, const T_y &y, const char *name, T_result *result)'],['../namespacestan_1_1math.html#ac07e0ff96981b93a266298e6c9343395',1,'stan::math::check_positive(const char *function, const T &x, const char *name)']]], + ['check_5fpositive_2ehpp',['check_positive.hpp',['../check__positive_8hpp.html',1,'']]], + ['check_5fpositive_5fordered',['check_positive_ordered',['../namespacestan_1_1math.html#a953ca730fb62ef45047f2a73c0f84a88',1,'stan::math::check_positive_ordered(const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const char *name, T_result *result)'],['../namespacestan_1_1math.html#a153b3fac80bd9f9739f87cfccb7eb870',1,'stan::math::check_positive_ordered(const char *function, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &y, const char *name, T *result=0)']]], + ['check_5fpositive_5fordered_2ehpp',['check_positive_ordered.hpp',['../check__positive__ordered_8hpp.html',1,'']]], + ['check_5frange',['check_range',['../namespacestan_1_1math.html#a1220906f5cf5892f9867a4b9bcec08c9',1,'stan::math']]], + ['check_5frange_2ehpp',['check_range.hpp',['../check__range_8hpp.html',1,'']]], + ['check_5fsimplex',['check_simplex',['../namespacestan_1_1math.html#a4cbbf2c5799c876b8b5a40a6be59fad4',1,'stan::math::check_simplex(const char *function, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta, const char *name, T_result *result)'],['../namespacestan_1_1math.html#ac5371fc49b7503afbe9a49867fc5d075',1,'stan::math::check_simplex(const char *function, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &theta, const char *name, T *result=0)']]], + ['check_5fsimplex_2ehpp',['check_simplex.hpp',['../check__simplex_8hpp.html',1,'']]], + ['check_5fsize_5fmatch',['check_size_match',['../namespacestan_1_1math.html#aa604267d7189b6fde0be2c83f03f60f8',1,'stan::math::check_size_match(const char *function, T_size1 i, const char *name_i, T_size2 j, const char *name_j, T_result *result)'],['../namespacestan_1_1math.html#a7db9ba4076101c008a4164d1f4f0881d',1,'stan::math::check_size_match(const char *function, T_size1 i, const char *name_i, T_size2 j, const char *name_j, T_size1 *result=0)']]], + ['check_5fsize_5fmatch_2ehpp',['check_size_match.hpp',['../check__size__match_8hpp.html',1,'']]], + ['check_5fspsd_5fmatrix',['check_spsd_matrix',['../namespacestan_1_1math.html#a1f953f345a5fc4d4258d65c9fd494d0d',1,'stan::math::check_spsd_matrix(const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)'],['../namespacestan_1_1math.html#a919b0ac7be6e9129159dcd57b5aaa229',1,'stan::math::check_spsd_matrix(const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)']]], + ['check_5fspsd_5fmatrix_2ehpp',['check_spsd_matrix.hpp',['../check__spsd__matrix_8hpp.html',1,'']]], + ['check_5fsquare',['check_square',['../namespacestan_1_1math.html#aaa8e58058a05567645f7589f90f5acaf',1,'stan::math::check_square(const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)'],['../namespacestan_1_1math.html#a354049e8dec929a4b054b7e8db06a4fb',1,'stan::math::check_square(const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)']]], + ['check_5fsquare_2ehpp',['check_square.hpp',['../check__square_8hpp.html',1,'']]], + ['check_5fsymmetric',['check_symmetric',['../namespacestan_1_1math.html#a7d97aebea4cf628724dfd08030284bb2',1,'stan::math::check_symmetric(const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)'],['../namespacestan_1_1math.html#a8aebef4c723a2963977653559ebd2374',1,'stan::math::check_symmetric(const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)']]], + ['check_5fsymmetric_2ehpp',['check_symmetric.hpp',['../check__symmetric_8hpp.html',1,'']]], + ['check_5funit_5fvector',['check_unit_vector',['../namespacestan_1_1math.html#ab722ab154aebf9a162df8e9bd4e3e42f',1,'stan::math::check_unit_vector(const char *function, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta, const char *name, T_result *result)'],['../namespacestan_1_1math.html#a7496b0022b662c358931d1ab0458f60e',1,'stan::math::check_unit_vector(const char *function, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &theta, const char *name, T *result=0)']]], + ['check_5funit_5fvector_2ehpp',['check_unit_vector.hpp',['../check__unit__vector_8hpp.html',1,'']]], + ['chi_5fsquare_2ehpp',['chi_square.hpp',['../chi__square_8hpp.html',1,'']]], + ['chi_5fsquare_5fccdf_5flog',['chi_square_ccdf_log',['../namespacestan_1_1prob.html#a3053cf28f5702b2b815e90f6e13a0931',1,'stan::prob']]], + ['chi_5fsquare_5fcdf',['chi_square_cdf',['../namespacestan_1_1prob.html#a200487188f204a155be81bcf76e3e578',1,'stan::prob']]], + ['chi_5fsquare_5fcdf_5flog',['chi_square_cdf_log',['../namespacestan_1_1prob.html#abec586221c76c3d3da9654cba160b35d',1,'stan::prob']]], + ['chi_5fsquare_5flog',['chi_square_log',['../namespacestan_1_1prob.html#ab7eb2d6575574aa8b2838532bb81832d',1,'stan::prob::chi_square_log(const T_y &y, const T_dof &nu)'],['../namespacestan_1_1prob.html#ab08231831678e188d428e0bd78c900f0',1,'stan::prob::chi_square_log(const T_y &y, const T_dof &nu)']]], + ['chi_5fsquare_5frng',['chi_square_rng',['../namespacestan_1_1prob.html#a367304c7727de79fa5d8660f1406754b',1,'stan::prob']]], + ['cholesky_5fdecompose',['cholesky_decompose',['../namespacestan_1_1math.html#abbcc91ff24e86fa318fe0f8a9111b4c5',1,'stan::math']]], + ['cholesky_5fdecompose_2ehpp',['cholesky_decompose.hpp',['../cholesky__decompose_8hpp.html',1,'']]], + ['cholesky_5ffactor',['cholesky_factor',['../classstan_1_1io_1_1reader.html#a9572cd028cf0d073c45ab83ae6f4477e',1,'stan::io::reader']]], + ['cholesky_5ffactor_5fconstrain',['cholesky_factor_constrain',['../classstan_1_1io_1_1reader.html#a6c6bee8c526c8d114c95646f171413cc',1,'stan::io::reader::cholesky_factor_constrain(size_t M, size_t N)'],['../classstan_1_1io_1_1reader.html#ac49f77d0cd4d89f3d06ac62515cfa809',1,'stan::io::reader::cholesky_factor_constrain(size_t M, size_t N, T &lp)'],['../namespacestan_1_1prob.html#a1fed06bde5073fb875496b5a680c39ca',1,'stan::prob::cholesky_factor_constrain(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, int M, int N)'],['../namespacestan_1_1prob.html#aaac795244dbcd9bb3fa44d2275ddc3c1',1,'stan::prob::cholesky_factor_constrain(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, int M, int N, T &lp)']]], + ['cholesky_5ffactor_5fdecl_5fr',['cholesky_factor_decl_r',['../structstan_1_1gm_1_1var__decls__grammar.html#af6c3b1a0eb00517659faa2f659d0abd0',1,'stan::gm::var_decls_grammar']]], + ['cholesky_5ffactor_5ffree',['cholesky_factor_free',['../namespacestan_1_1prob.html#a74157f1d9c708df760d602d6adb53712',1,'stan::prob']]], + ['cholesky_5ffactor_5funconstrain',['cholesky_factor_unconstrain',['../classstan_1_1io_1_1writer.html#ae96ed09cbcd87375c712e20503894264',1,'stan::io::writer']]], + ['cholesky_5ffactor_5fvar_5fdecl',['cholesky_factor_var_decl',['../structstan_1_1gm_1_1cholesky__factor__var__decl.html',1,'stan::gm']]], + ['cholesky_5ffactor_5fvar_5fdecl',['cholesky_factor_var_decl',['../structstan_1_1gm_1_1cholesky__factor__var__decl.html#ae19a9b374feff362b4f32d0d8cb8a4df',1,'stan::gm::cholesky_factor_var_decl::cholesky_factor_var_decl()'],['../structstan_1_1gm_1_1cholesky__factor__var__decl.html#a661cb5898a5139eba744d9d53309584f',1,'stan::gm::cholesky_factor_var_decl::cholesky_factor_var_decl(expression const &M, expression const &N, std::string const &name, std::vector< expression > const &dims)']]], + ['chunk_5falloc',['chunk_alloc',['../classstan_1_1memory_1_1chunk__alloc.html',1,'stan::memory']]], + ['chunk_5falloc',['chunk_alloc',['../classstan_1_1memory_1_1chunk__alloc.html#a51cecbbac945e0b108229b21ecd6abf7',1,'stan::memory::chunk_alloc']]], + ['chunk_5falloc_2ehpp',['chunk_alloc.hpp',['../chunk__alloc_8hpp.html',1,'']]], + ['cmd_5fline',['cmd_line',['../classstan_1_1io_1_1cmd__line.html#a8b00f5947e12e84d1740116a05a4ca16',1,'stan::io::cmd_line']]], + ['cmd_5fline',['cmd_line',['../classstan_1_1io_1_1cmd__line.html',1,'stan::io']]], + ['cmd_5fline_2ehpp',['cmd_line.hpp',['../cmd__line_8hpp.html',1,'']]], + ['col',['col',['../namespacestan_1_1math.html#ae497ca37fd7867fd11c4cd095c8aaa71',1,'stan::math']]], + ['col_2ehpp',['col.hpp',['../col_8hpp.html',1,'']]], + ['cols',['cols',['../classstan_1_1math_1_1_l_d_l_t__factor_3_01stan_1_1agrad_1_1var_00_01_r_00_01_c_01_4.html#a00df49ca9dbf61b2f6b1fc6c991c1fb9',1,'stan::math::LDLT_factor< stan::agrad::var, R, C >::cols()'],['../classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4.html#adf662c7112e7274e630e07d7ac14c78a',1,'stan::math::LDLT_factor< double, R, C >::cols()'],['../namespacestan_1_1math.html#a871bccc233a4dcd764ffece5a3f9a399',1,'stan::math::cols()']]], + ['cols_2ehpp',['cols.hpp',['../cols_8hpp.html',1,'']]], + ['columns_5fdot_5fproduct',['columns_dot_product',['../namespacestan_1_1agrad.html#a4690cc81441d5be35328e09c11b6d0bb',1,'stan::agrad::columns_dot_product(const Eigen::Matrix< fvar< T >, R1, C1 > &v1, const Eigen::Matrix< fvar< T >, R2, C2 > &v2)'],['../namespacestan_1_1agrad.html#ad72bd7f6e164cb2341d055ace67c32af',1,'stan::agrad::columns_dot_product(const Eigen::Matrix< fvar< T >, R1, C1 > &v1, const Eigen::Matrix< double, R2, C2 > &v2)'],['../namespacestan_1_1agrad.html#ad2c2338e972cab17e0f8cbcaa190d90b',1,'stan::agrad::columns_dot_product(const Eigen::Matrix< double, R1, C1 > &v1, const Eigen::Matrix< fvar< T >, R2, C2 > &v2)'],['../namespacestan_1_1agrad.html#a3d6da62972dd8c1d717b7e99838c84bc',1,'stan::agrad::columns_dot_product(const Eigen::Matrix< T1, R1, C1 > &v1, const Eigen::Matrix< T2, R2, C2 > &v2)'],['../namespacestan_1_1math.html#a6d03b34aa7329a68f31d1c7bc500c5c8',1,'stan::math::columns_dot_product()']]], + ['columns_5fdot_5fproduct_2ehpp',['columns_dot_product.hpp',['../agrad_2fwd_2matrix_2columns__dot__product_8hpp.html',1,'']]], + ['columns_5fdot_5fproduct_2ehpp',['columns_dot_product.hpp',['../math_2matrix_2columns__dot__product_8hpp.html',1,'']]], + ['columns_5fdot_5fself',['columns_dot_self',['../namespacestan_1_1agrad.html#aa4910329638fc8776c1568e9c41ae014',1,'stan::agrad::columns_dot_self(const Eigen::Matrix< fvar< T >, R, C > &x)'],['../namespacestan_1_1agrad.html#a6b316428660dff0e79e67e804ad1cbce',1,'stan::agrad::columns_dot_self(const Eigen::Matrix< var, R, C > &x)'],['../namespacestan_1_1math.html#af03701ff6420231890468e9881eb9245',1,'stan::math::columns_dot_self()']]], + ['columns_5fdot_5fself_2ehpp',['columns_dot_self.hpp',['../agrad_2fwd_2matrix_2columns__dot__self_8hpp.html',1,'']]], + ['columns_5fdot_5fself_2ehpp',['columns_dot_self.hpp',['../math_2matrix_2columns__dot__self_8hpp.html',1,'']]], + ['comma',['comma',['../classstan_1_1io_1_1csv__writer.html#a3b3dd2236e6e62005bad3a4dfbea6596',1,'stan::io::csv_writer']]], + ['command',['command',['../classstan_1_1io_1_1cmd__line.html#acffdc087dbbe052e4827b281e2c388f7',1,'stan::io::cmd_line::command()'],['../namespacestan_1_1gm.html#a4f99fc7285080014068543c8d5ab71b1',1,'stan::gm::command()']]], + ['command_2ehpp',['command.hpp',['../command_8hpp.html',1,'']]], + ['common_5fadaptors_5fdef_2ehpp',['common_adaptors_def.hpp',['../common__adaptors__def_8hpp.html',1,'']]], + ['common_5ftype',['common_type',['../structstan_1_1math_1_1common__type.html',1,'stan::math']]], + ['common_5ftype_2ehpp',['common_type.hpp',['../common__type_8hpp.html',1,'']]], + ['common_5ftype_3c_20eigen_3a_3amatrix_3c_20t1_2c_20r_2c_20c_20_3e_2c_20eigen_3a_3amatrix_3c_20t2_2c_20r_2c_20c_20_3e_20_3e',['common_type< Eigen::Matrix< T1, R, C >, Eigen::Matrix< T2, R, C > >',['../structstan_1_1math_1_1common__type_3_01_eigen_1_1_matrix_3_01_t1_00_01_r_00_01_c_01_4_00_01_eiged8accfa00e73f240c58ad02ac582ba93.html',1,'stan::math']]], + ['common_5ftype_3c_20std_3a_3avector_3c_20t1_20_3e_2c_20std_3a_3avector_3c_20t2_20_3e_20_3e',['common_type< std::vector< T1 >, std::vector< T2 > >',['../structstan_1_1math_1_1common__type_3_01std_1_1vector_3_01_t1_01_4_00_01std_1_1vector_3_01_t2_01_4_01_4.html',1,'stan::math']]], + ['compile',['compile',['../namespacestan_1_1gm.html#afa03c3de30429fab595ea53c97b9edc8',1,'stan::gm']]], + ['compiler_2ehpp',['compiler.hpp',['../compiler_8hpp.html',1,'']]], + ['complete_5fadaptation',['complete_adaptation',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#a6a58fb8dd3f3b90c16ac9f86299c7da3',1,'stan::mcmc::stepsize_adaptation']]], + ['compute',['compute',['../classstan_1_1math_1_1_l_d_l_t__factor_3_01stan_1_1agrad_1_1var_00_01_r_00_01_c_01_4.html#adea90c563014600ac9d7aa05056db56d',1,'stan::math::LDLT_factor< stan::agrad::var, R, C >::compute()'],['../classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4.html#add76e21a65bdd840ca67d24531612573',1,'stan::math::LDLT_factor< double, R, C >::compute()']]], + ['compute_5fcriterion',['compute_criterion',['../classstan_1_1mcmc_1_1base__nuts.html#ac2961f3ce35af570405291a8011e1064',1,'stan::mcmc::base_nuts::compute_criterion()'],['../classstan_1_1mcmc_1_1dense__e__nuts.html#aa23ebe0b61e0ed91a9a94457e69e08da',1,'stan::mcmc::dense_e_nuts::compute_criterion()'],['../classstan_1_1mcmc_1_1diag__e__nuts.html#a61f9db95ebdc67274cdea0f479dc0a5e',1,'stan::mcmc::diag_e_nuts::compute_criterion()'],['../classstan_1_1mcmc_1_1unit__e__nuts.html#ab61a9ee4db3845a88adc78249e35c170',1,'stan::mcmc::unit_e_nuts::compute_criterion()']]], + ['compute_5findent',['compute_indent',['../classstan_1_1gm_1_1argument.html#a1df06fb3f558fc0eecfce30d38f77359',1,'stan::gm::argument']]], + ['compute_5fnext_5fwindow',['compute_next_window',['../classstan_1_1mcmc_1_1windowed__adaptation.html#a99adff4a3380c627160d995b5584bf8e',1,'stan::mcmc::windowed_adaptation']]], + ['compute_5fprecision',['compute_precision',['../print_8hpp.html#a0fc6b77bb6e90f0e770af8b3fe5ac44d',1,'print.hpp']]], + ['compute_5fwidth',['compute_width',['../print_8hpp.html#a78042a12545744a3a7978b458faea92c',1,'print.hpp']]], + ['compute_5fwidth_5fand_5fprecision',['compute_width_and_precision',['../print_8hpp.html#a16acdd9987d7a0e6d03b905f9c6cc65b',1,'print.hpp']]], + ['condition_5f',['condition_',['../structstan_1_1gm_1_1while__statement.html#ac28766c928629d492f3cb633a70d446d',1,'stan::gm::while_statement']]], + ['conditional_5fstatement',['conditional_statement',['../structstan_1_1gm_1_1conditional__statement.html',1,'stan::gm']]], + ['conditional_5fstatement',['conditional_statement',['../structstan_1_1gm_1_1conditional__statement.html#a1abc13ef1fe45721706610334a3fc111',1,'stan::gm::conditional_statement::conditional_statement()'],['../structstan_1_1gm_1_1conditional__statement.html#a9ee4cb8e757e7be347cb40f870b77494',1,'stan::gm::conditional_statement::conditional_statement(const std::vector< expression > &conditions, const std::vector< statement > &statements)']]], + ['conditional_5fstatement_5fr',['conditional_statement_r',['../structstan_1_1gm_1_1statement__2__grammar.html#a5d6a2f57ba3e3e2d05f9aad72fcbc97c',1,'stan::gm::statement_2_grammar']]], + ['conditions_5f',['conditions_',['../structstan_1_1gm_1_1conditional__statement.html#a1afeedc0d7f192d1fac3cda264918a22',1,'stan::gm::conditional_statement']]], + ['config',['CONFIG',['../structstan_1_1gm_1_1error__codes.html#aa63873e8f7e9dd7f8af3502e4003292fa06ec7fc9f65aafc74d415edaba0a63bc',1,'stan::gm::error_codes']]], + ['constants_2ehpp',['constants.hpp',['../prob_2constants_8hpp.html',1,'']]], + ['constants_2ehpp',['constants.hpp',['../math_2constants_8hpp.html',1,'']]], + ['constrained_5fparam_5fnames_5fvisgen',['constrained_param_names_visgen',['../structstan_1_1gm_1_1constrained__param__names__visgen.html',1,'stan::gm']]], + ['constrained_5fparam_5fnames_5fvisgen',['constrained_param_names_visgen',['../structstan_1_1gm_1_1constrained__param__names__visgen.html#ab1fef3623722eef039191cf79b87e84b',1,'stan::gm::constrained_param_names_visgen']]], + ['constraint_5ftolerance',['CONSTRAINT_TOLERANCE',['../classstan_1_1io_1_1writer.html#a028f6ddc6fd884c8be9cdb5e17d49d73',1,'stan::io::writer::CONSTRAINT_TOLERANCE()'],['../namespacestan_1_1math.html#aece739c5a2672028f0c7848045b89f08',1,'stan::math::CONSTRAINT_TOLERANCE()'],['../namespacestan_1_1prob.html#a42d98044ad33e2fe147c7edcf09282f6',1,'stan::prob::CONSTRAINT_TOLERANCE()']]], + ['constraint_5ftolerance_2ehpp',['constraint_tolerance.hpp',['../constraint__tolerance_8hpp.html',1,'']]], + ['cont_5fparams',['cont_params',['../classstan_1_1mcmc_1_1sample.html#aa6dbff10de92bcd52e156ac8ca8eba6e',1,'stan::mcmc::sample::cont_params(int k) const '],['../classstan_1_1mcmc_1_1sample.html#ae659b68fe8ac4a7a87fcd53549133c90',1,'stan::mcmc::sample::cont_params(Eigen::VectorXd &x) const '],['../classstan_1_1mcmc_1_1sample.html#afa5f116f5b79a757bfb7d68931bd3c17',1,'stan::mcmc::sample::cont_params() const ']]], + ['contains_5ffvar',['contains_fvar',['../structstan_1_1contains__fvar.html',1,'stan']]], + ['contains_5fi',['contains_i',['../classstan_1_1io_1_1dump.html#a1865fdffc3451dd6460a5540c8e0912e',1,'stan::io::dump::contains_i()'],['../classstan_1_1io_1_1var__context.html#a57b4df63029aa81a4ee3e93899722068',1,'stan::io::var_context::contains_i()']]], + ['contains_5fnonparam_5fvar',['contains_nonparam_var',['../structstan_1_1gm_1_1contains__nonparam__var.html',1,'stan::gm']]], + ['contains_5fnonparam_5fvar',['contains_nonparam_var',['../structstan_1_1gm_1_1contains__nonparam__var.html#a6beb41e5c41785733e1cc6881eba82a9',1,'stan::gm::contains_nonparam_var']]], + ['contains_5fr',['contains_r',['../classstan_1_1io_1_1dump.html#ac531d67fb8a74300ebbe014dfe367706',1,'stan::io::dump::contains_r()'],['../classstan_1_1io_1_1var__context.html#abaa6a87ecb4d45c29386f0de57b330f4',1,'stan::io::var_context::contains_r()']]], + ['contains_5fvar',['contains_var',['../structstan_1_1gm_1_1contains__var.html',1,'stan::gm']]], + ['contains_5fvar',['contains_var',['../structstan_1_1gm_1_1contains__var.html#a8d00ba5b2f7fcecec2baca23d1ddb200',1,'stan::gm::contains_var']]], + ['continuous_2ehpp',['continuous.hpp',['../multivariate_2continuous_8hpp.html',1,'']]], + ['continuous_2ehpp',['continuous.hpp',['../univariate_2continuous_8hpp.html',1,'']]], + ['corr',['corr',['../classstan_1_1io_1_1reader.html#af409911d7c4b3996291884fbebecfd85',1,'stan::io::reader']]], + ['corr_5fconstrain',['corr_constrain',['../classstan_1_1io_1_1reader.html#aeaafba520a6ad5ae7654e24d46ffbb39',1,'stan::io::reader::corr_constrain()'],['../classstan_1_1io_1_1reader.html#a83d52f9f5ffec50991cf3224f1caad9c',1,'stan::io::reader::corr_constrain(T &lp)'],['../namespacestan_1_1prob.html#a1a965b7e5c7fc2ef6bbd3a436ae17b99',1,'stan::prob::corr_constrain(const T x)'],['../namespacestan_1_1prob.html#a845c7b8687f4e6b588820b815e464729',1,'stan::prob::corr_constrain(const T x, T &lp)']]], + ['corr_5ffree',['corr_free',['../namespacestan_1_1prob.html#ade592c3579e0e7a685b7e2ec5bb0218b',1,'stan::prob']]], + ['corr_5fmatrix',['corr_matrix',['../classstan_1_1io_1_1reader.html#aa410515341701109fb937c14b101e20d',1,'stan::io::reader']]], + ['corr_5fmatrix_5fconstrain',['corr_matrix_constrain',['../classstan_1_1io_1_1reader.html#a75eb056f8f7b1032865feb97f506e3e6',1,'stan::io::reader::corr_matrix_constrain(size_t k)'],['../classstan_1_1io_1_1reader.html#ab23e0b88e39d354121b66e6823e1cac9',1,'stan::io::reader::corr_matrix_constrain(size_t k, T &lp)'],['../namespacestan_1_1prob.html#ad9af41714d33fbe0e5e29aab85553ccc',1,'stan::prob::corr_matrix_constrain(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, typename Eigen::Matrix< T, Eigen::Dynamic, 1 >::size_type k)'],['../namespacestan_1_1prob.html#a2767379e92ce98f2f7016b47e7aeec47',1,'stan::prob::corr_matrix_constrain(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, typename Eigen::Matrix< T, Eigen::Dynamic, 1 >::size_type k, T &lp)']]], + ['corr_5fmatrix_5fdecl_5fr',['corr_matrix_decl_r',['../structstan_1_1gm_1_1var__decls__grammar.html#a8a1a3bc0f32b4484648ba7ed1cc1e6ec',1,'stan::gm::var_decls_grammar']]], + ['corr_5fmatrix_5ffree',['corr_matrix_free',['../namespacestan_1_1prob.html#acc2abdf331f1cc4b3f36b15a66088ab2',1,'stan::prob']]], + ['corr_5fmatrix_5funconstrain',['corr_matrix_unconstrain',['../classstan_1_1io_1_1writer.html#af26ec20d15ff3a57ab0e1a87579decbb',1,'stan::io::writer']]], + ['corr_5fmatrix_5fvar_5fdecl',['corr_matrix_var_decl',['../structstan_1_1gm_1_1corr__matrix__var__decl.html#acb8f9bbb7cbfcc2a5cae3b6b6e5aa3a3',1,'stan::gm::corr_matrix_var_decl::corr_matrix_var_decl()'],['../structstan_1_1gm_1_1corr__matrix__var__decl.html#a208b78416bf4d23b7b093014c19c03d2',1,'stan::gm::corr_matrix_var_decl::corr_matrix_var_decl(expression const &K, std::string const &name, std::vector< expression > const &dims)']]], + ['corr_5fmatrix_5fvar_5fdecl',['corr_matrix_var_decl',['../structstan_1_1gm_1_1corr__matrix__var__decl.html',1,'stan::gm']]], + ['corr_5funconstrain',['corr_unconstrain',['../classstan_1_1io_1_1writer.html#a00cb858ddd90f1af498f1dfe552f2658',1,'stan::io::writer']]], + ['correlation',['correlation',['../classstan_1_1mcmc_1_1chains.html#aaf76107a82d21ec2a1b49e436faa459b',1,'stan::mcmc::chains::correlation(const int chain, const int index1, const int index2)'],['../classstan_1_1mcmc_1_1chains.html#a2cf11cd1b7b928ebf87d6708a0bada74',1,'stan::mcmc::chains::correlation(const int index1, const int index2)'],['../classstan_1_1mcmc_1_1chains.html#ab581e93f8ad9222927be0ab55de4e83c',1,'stan::mcmc::chains::correlation(const int chain, const std::string &name1, const std::string &name2)'],['../classstan_1_1mcmc_1_1chains.html#aa5f25ea09b915b3c768947c3e3e03bf5',1,'stan::mcmc::chains::correlation(const std::string &name1, const std::string &name2)']]], + ['cos',['cos',['../namespacestan_1_1agrad.html#a6f03b0ce8e8e381865f09baa3036d48d',1,'stan::agrad::cos(const var &a)'],['../namespacestan_1_1agrad.html#a1768b39c559d7c8e0f467ea1916b625f',1,'stan::agrad::cos(const fvar< T > &x)']]], + ['cos_2ehpp',['cos.hpp',['../fwd_2functions_2cos_8hpp.html',1,'']]], + ['cos_2ehpp',['cos.hpp',['../rev_2functions_2cos_8hpp.html',1,'']]], + ['cosh',['cosh',['../namespacestan_1_1agrad.html#a0c2536220a01717d9efc8aa9b993d46b',1,'stan::agrad::cosh(const var &a)'],['../namespacestan_1_1agrad.html#a2401e1b775fc8f3ba201a30d66022d09',1,'stan::agrad::cosh(const fvar< T > &x)']]], + ['cosh_2ehpp',['cosh.hpp',['../fwd_2functions_2cosh_8hpp.html',1,'']]], + ['cosh_2ehpp',['cosh.hpp',['../rev_2functions_2cosh_8hpp.html',1,'']]], + ['cov_5fmatrix',['cov_matrix',['../classstan_1_1io_1_1reader.html#a6b0b034457a37f2eb7c27cec9b8e600d',1,'stan::io::reader']]], + ['cov_5fmatrix_5fconstrain',['cov_matrix_constrain',['../classstan_1_1io_1_1reader.html#ab8ada631ae87ef2de7978a33299e872e',1,'stan::io::reader::cov_matrix_constrain(size_t k)'],['../classstan_1_1io_1_1reader.html#a1ea7077509503ff9bf2777430cb70fcf',1,'stan::io::reader::cov_matrix_constrain(size_t k, T &lp)'],['../namespacestan_1_1prob.html#afe73ba3027bcb8e30424b81a5460828b',1,'stan::prob::cov_matrix_constrain(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, typename Eigen::Matrix< T, Eigen::Dynamic, 1 >::size_type K)'],['../namespacestan_1_1prob.html#af8bbcd6e6f8239799dc9b2661059801b',1,'stan::prob::cov_matrix_constrain(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, typename Eigen::Matrix< T, Eigen::Dynamic, 1 >::size_type K, T &lp)']]], + ['cov_5fmatrix_5fconstrain_5flkj',['cov_matrix_constrain_lkj',['../namespacestan_1_1prob.html#ae151aa1645e82ec7cb298466edcbbb0b',1,'stan::prob::cov_matrix_constrain_lkj(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, size_t k)'],['../namespacestan_1_1prob.html#a26ee45f1dd50ceaca0eea65cab7e85b3',1,'stan::prob::cov_matrix_constrain_lkj(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, size_t k, T &lp)']]], + ['cov_5fmatrix_5fdecl_5fr',['cov_matrix_decl_r',['../structstan_1_1gm_1_1var__decls__grammar.html#af7029c6e49af878a50f5717713430798',1,'stan::gm::var_decls_grammar']]], + ['cov_5fmatrix_5ffree',['cov_matrix_free',['../namespacestan_1_1prob.html#a402fcdcfe19b2a5c25f4729d1cf31678',1,'stan::prob']]], + ['cov_5fmatrix_5ffree_5flkj',['cov_matrix_free_lkj',['../namespacestan_1_1prob.html#a7f6a575490d3de6839a6f544781bf464',1,'stan::prob']]], + ['cov_5fmatrix_5funconstrain',['cov_matrix_unconstrain',['../classstan_1_1io_1_1writer.html#a2f9bb2387b552311a613cc00391e6bb4',1,'stan::io::writer']]], + ['cov_5fmatrix_5fvar_5fdecl',['cov_matrix_var_decl',['../structstan_1_1gm_1_1cov__matrix__var__decl.html#aebf75d147fbbf2ee7e8d52aa48a0fd76',1,'stan::gm::cov_matrix_var_decl::cov_matrix_var_decl()'],['../structstan_1_1gm_1_1cov__matrix__var__decl.html#aedec8ffe9e2f319afd7eb903e3b17dc6',1,'stan::gm::cov_matrix_var_decl::cov_matrix_var_decl(expression const &K, std::string const &name, std::vector< expression > const &dims)']]], + ['cov_5fmatrix_5fvar_5fdecl',['cov_matrix_var_decl',['../structstan_1_1gm_1_1cov__matrix__var__decl.html',1,'stan::gm']]], + ['covar_5fadaptation',['covar_adaptation',['../classstan_1_1mcmc_1_1covar__adaptation.html#a32edd1badb6af5fad1348168ab4d5d91',1,'stan::mcmc::covar_adaptation']]], + ['covar_5fadaptation',['covar_adaptation',['../classstan_1_1mcmc_1_1covar__adaptation.html',1,'stan::mcmc']]], + ['covar_5fadaptation_2ehpp',['covar_adaptation.hpp',['../covar__adaptation_8hpp.html',1,'']]], + ['covariance',['covariance',['../classstan_1_1mcmc_1_1chains.html#a1611771bf5fa3c15e528d26836aa2ac5',1,'stan::mcmc::chains::covariance(const int chain, const int index1, const int index2)'],['../classstan_1_1mcmc_1_1chains.html#a5bc40586bfcc5bfef6e5b6bf651608ec',1,'stan::mcmc::chains::covariance(const int index1, const int index2)'],['../classstan_1_1mcmc_1_1chains.html#a99a0247f578644538745f03510f0f268',1,'stan::mcmc::chains::covariance(const int chain, const std::string &name1, const std::string &name2)'],['../classstan_1_1mcmc_1_1chains.html#a2920dbf4b733612596fc7b306043aceb',1,'stan::mcmc::chains::covariance(const std::string &name1, const std::string &name2)']]], + ['criterion',['criterion',['../structstan_1_1mcmc_1_1nuts__util.html#ad957f342afb9aa4d0e838486885f31d3',1,'stan::mcmc::nuts_util']]], + ['crossprod',['crossprod',['../namespacestan_1_1agrad.html#a5091c4a9b716a75406b9cbee072a27c1',1,'stan::agrad::crossprod(const Eigen::Matrix< fvar< T >, R, C > &m)'],['../namespacestan_1_1agrad.html#a704fdafdbf6fd44b9b3a382bc23a026e',1,'stan::agrad::crossprod(const matrix_v &M)'],['../namespacestan_1_1math.html#a62cc3a137ff3220bdd0137a52a4b9714',1,'stan::math::crossprod()']]], + ['crossprod_2ehpp',['crossprod.hpp',['../agrad_2fwd_2matrix_2crossprod_8hpp.html',1,'']]], + ['crossprod_2ehpp',['crossprod.hpp',['../math_2matrix_2crossprod_8hpp.html',1,'']]], + ['crossprod_2ehpp',['crossprod.hpp',['../agrad_2rev_2matrix_2crossprod_8hpp.html',1,'']]], + ['csv_5fwriter',['csv_writer',['../classstan_1_1io_1_1csv__writer.html#a50ab9dce7685e32f9e7575a4aac66e0f',1,'stan::io::csv_writer']]], + ['csv_5fwriter',['csv_writer',['../classstan_1_1io_1_1csv__writer.html',1,'stan::io']]], + ['csv_5fwriter_2ehpp',['csv_writer.hpp',['../csv__writer_8hpp.html',1,'']]], + ['cumulative_5fsum',['cumulative_sum',['../namespacestan_1_1math.html#a7340f6be8ae1e121c6d854005560fef5',1,'stan::math::cumulative_sum(const std::vector< T > &x)'],['../namespacestan_1_1math.html#affab469ac332306aa00947f4a7c5d30b',1,'stan::math::cumulative_sum(const Eigen::Matrix< T, R, C > &m)']]], + ['cumulative_5fsum_2ehpp',['cumulative_sum.hpp',['../cumulative__sum_8hpp.html',1,'']]], + ['curr_5ff',['curr_f',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#afaba4589a2a29fd201c3642f06cc11c3',1,'stan::optimization::BFGSMinimizer']]], + ['curr_5fg',['curr_g',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a9010c566033a5a18b1f7ece46811f552',1,'stan::optimization::BFGSMinimizer']]], + ['curr_5fs',['curr_s',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a76bc647acbfdad3f5f593ec940df8d84',1,'stan::optimization::BFGSMinimizer']]], + ['curr_5fx',['curr_x',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a23c0ccc29dcf6eed8995300a8642f887',1,'stan::optimization::BFGSMinimizer']]], + ['cvi_5f',['cvi_',['../classstan_1_1agrad_1_1op__ddv__vari.html#a9fa975086d0c27cd1506fc76f0a826a1',1,'stan::agrad::op_ddv_vari::cvi_()'],['../classstan_1_1agrad_1_1op__dvv__vari.html#a7b45480bb231853d2849a225e98395b0',1,'stan::agrad::op_dvv_vari::cvi_()'],['../classstan_1_1agrad_1_1op__vdv__vari.html#a35aaa74843a75c3e340eaa2be01428fb',1,'stan::agrad::op_vdv_vari::cvi_()'],['../classstan_1_1agrad_1_1op__vvv__vari.html#a9f790058e86519dd043af8799e5269ff',1,'stan::agrad::op_vvv_vari::cvi_()'],['../agrad__thread__safe_8hpp.html#a85cb3e45be84a247edd670178d7585b1',1,'cvi_(): agrad_thread_safe.hpp']]], + ['val_3c_20std_3a_3astring_20_3e',['val< std::string >',['../namespacestan_1_1io.html#a6717f7e0267a49b9c35e24aa6183236a',1,'stan::io']]] +]; diff --git a/doc/api/html/search/all_64.html b/doc/api/html/search/all_64.html new file mode 100644 index 00000000000..b53ff083e50 --- /dev/null +++ b/doc/api/html/search/all_64.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/all_64.js b/doc/api/html/search/all_64.js new file mode 100644 index 00000000000..c9767aa6bcc --- /dev/null +++ b/doc/api/html/search/all_64.js @@ -0,0 +1,159 @@ +var searchData= +[ + ['d_5f',['d_',['../structstan_1_1agrad_1_1fvar.html#a189f3e99b3716c92b73b43e709245787',1,'stan::agrad::fvar::d_()'],['../agrad_2rev_2matrix_2ldlt_8hpp.html#a924a423d56557fce1ab298532ab03bb8',1,'D_(): ldlt.hpp'],['../agrad_2rev_2matrix_2trace__gen__quad__form_8hpp.html#ab8b790d54b5b04c9c5dd60e063ed40bc',1,'D_(): trace_gen_quad_form.hpp']]], + ['d_5fx1',['d_x1',['../structstan_1_1agrad_1_1_operands_and_partials.html#a3c0b97cb24df6cf073c7585a2ced93ea',1,'stan::agrad::OperandsAndPartials']]], + ['d_5fx2',['d_x2',['../structstan_1_1agrad_1_1_operands_and_partials.html#ae36664450bb09392fe8e0dae036ebfa1',1,'stan::agrad::OperandsAndPartials']]], + ['d_5fx3',['d_x3',['../structstan_1_1agrad_1_1_operands_and_partials.html#a1858e4f3e9bc2dee0f3bd25b72ac7862',1,'stan::agrad::OperandsAndPartials']]], + ['d_5fx4',['d_x4',['../structstan_1_1agrad_1_1_operands_and_partials.html#a1ca64b9b641bf4fe7a34bf2a6804c50a',1,'stan::agrad::OperandsAndPartials']]], + ['d_5fx5',['d_x5',['../structstan_1_1agrad_1_1_operands_and_partials.html#a99c7a29399d12adf8c55f31a60cbf6aa',1,'stan::agrad::OperandsAndPartials']]], + ['d_5fx6',['d_x6',['../structstan_1_1agrad_1_1_operands_and_partials.html#acd4f4706460ff63b51e987d343cd8bbf',1,'stan::agrad::OperandsAndPartials']]], + ['da_5f',['da_',['../classstan_1_1agrad_1_1precomp__v__vari.html#af0cd4c5436b3bdc84f0d5c499a628be3',1,'stan::agrad::precomp_v_vari']]], + ['data',['data',['../structstan_1_1io_1_1stan__csv__metadata.html#ab98a28bde3ef2a0c2a04588d527902da',1,'stan::io::stan_csv_metadata']]], + ['data_5fdecl_5f',['data_decl_',['../structstan_1_1gm_1_1program.html#a6703cdf4c559cfdf4675c68eeff40fa5',1,'stan::gm::program']]], + ['data_5fi',['data_i',['../classstan_1_1io_1_1writer.html#a6cf35dda98f2d8d322f337fa5e4db8c5',1,'stan::io::writer']]], + ['data_5forigin',['data_origin',['../namespacestan_1_1gm.html#aa21145a91e4c8dd4d9495868c6f729a7',1,'stan::gm']]], + ['data_5fr',['data_r',['../classstan_1_1io_1_1writer.html#afc520ab8c7f1a351ba7b8955d7045a73',1,'stan::io::writer']]], + ['data_5fvar_5fdecls_5fr',['data_var_decls_r',['../structstan_1_1gm_1_1program__grammar.html#a739949e8b7237c5a60f4968d75bf9058',1,'stan::gm::program_grammar']]], + ['dataerr',['DATAERR',['../structstan_1_1gm_1_1error__codes.html#aa63873e8f7e9dd7f8af3502e4003292fa6b2a96b1b804a9792a1355d28cc9c44d',1,'stan::gm::error_codes']]], + ['ddv_5fvari_2ehpp',['ddv_vari.hpp',['../ddv__vari_8hpp.html',1,'']]], + ['decl_5f',['decl_',['../structstan_1_1gm_1_1var__decl.html#a9d23fb1315d50ec89c135e1ccfd60a6c',1,'stan::gm::var_decl']]], + ['declare_5farray',['declare_array',['../structstan_1_1gm_1_1member__var__decl__visgen.html#a7cd6cbe9a4e154a4b47437ec8506b4a0',1,'stan::gm::member_var_decl_visgen::declare_array()'],['../structstan_1_1gm_1_1local__var__decl__visgen.html#aa021dda326a4032145da713d78091b30',1,'stan::gm::local_var_decl_visgen::declare_array()']]], + ['declare_5fvars_5f',['declare_vars_',['../structstan_1_1gm_1_1init__local__var__visgen.html#a2c9f12770f32bb4cffe9444898a89ddf',1,'stan::gm::init_local_var_visgen::declare_vars_()'],['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#ae1f7b8e29eb89aff4c1b2394e27a051c',1,'stan::gm::generate_local_var_init_nan_visgen::declare_vars_()']]], + ['default_5finitial_5fnchunks',['DEFAULT_INITIAL_NCHUNKS',['../chunk__alloc_8hpp.html#a5f845c774e340bc6030d5ce15487812a',1,'chunk_alloc.hpp']]], + ['delete_5ffile',['delete_file',['../stanc__helper_8hpp.html#a018575b1df2fee775b6583718a7ddc18',1,'stanc_helper.hpp']]], + ['denorm_5fmin',['denorm_min',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a60e936662fc9da655a32defc4b13c305',1,'std::numeric_limits< stan::agrad::fvar< T > >::denorm_min()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#afc66e528e2fad364eb324e672d49fe86',1,'std::numeric_limits< stan::agrad::var >::denorm_min()']]], + ['dense_5fe_5fmetric',['dense_e_metric',['../classstan_1_1mcmc_1_1dense__e__metric.html',1,'stan::mcmc']]], + ['dense_5fe_5fmetric',['dense_e_metric',['../classstan_1_1mcmc_1_1dense__e__metric.html#aacbf4525e5660fd18eaea038e54e10e2',1,'stan::mcmc::dense_e_metric']]], + ['dense_5fe_5fmetric_2ehpp',['dense_e_metric.hpp',['../dense__e__metric_8hpp.html',1,'']]], + ['dense_5fe_5fnuts',['dense_e_nuts',['../classstan_1_1mcmc_1_1dense__e__nuts.html',1,'stan::mcmc']]], + ['dense_5fe_5fnuts',['dense_e_nuts',['../classstan_1_1mcmc_1_1dense__e__nuts.html#a556e5c4e0ddf32b50ccd4bae8cb54e22',1,'stan::mcmc::dense_e_nuts']]], + ['dense_5fe_5fnuts_2ehpp',['dense_e_nuts.hpp',['../dense__e__nuts_8hpp.html',1,'']]], + ['dense_5fe_5fpoint',['dense_e_point',['../classstan_1_1mcmc_1_1dense__e__point.html#a3b437b07a44c6994c669ee8ae673e975',1,'stan::mcmc::dense_e_point::dense_e_point(int n)'],['../classstan_1_1mcmc_1_1dense__e__point.html#a493b3745174b5d6dcc50dd2ec6b5e422',1,'stan::mcmc::dense_e_point::dense_e_point(const dense_e_point &z)']]], + ['dense_5fe_5fpoint',['dense_e_point',['../classstan_1_1mcmc_1_1dense__e__point.html',1,'stan::mcmc']]], + ['dense_5fe_5fpoint_2ehpp',['dense_e_point.hpp',['../dense__e__point_8hpp.html',1,'']]], + ['dense_5fe_5fstatic_5fhmc',['dense_e_static_hmc',['../classstan_1_1mcmc_1_1dense__e__static__hmc.html',1,'stan::mcmc']]], + ['dense_5fe_5fstatic_5fhmc',['dense_e_static_hmc',['../classstan_1_1mcmc_1_1dense__e__static__hmc.html#a8eae1f2e8a48c368ecd5d013099b692e',1,'stan::mcmc::dense_e_static_hmc']]], + ['dense_5fe_5fstatic_5fhmc_2ehpp',['dense_e_static_hmc.hpp',['../dense__e__static__hmc_8hpp.html',1,'']]], + ['derivative',['derivative',['../namespacestan_1_1agrad.html#adf138af35c36b51a588f35e10dfa6e06',1,'stan::agrad']]], + ['derived_5fdata_5fdecl_5f',['derived_data_decl_',['../structstan_1_1gm_1_1program.html#abb7b64b4d14faf7c161d6fc0c73a859d',1,'stan::gm::program']]], + ['derived_5fdata_5fvar_5fdecls_5fr',['derived_data_var_decls_r',['../structstan_1_1gm_1_1program__grammar.html#acf4498316a5b25d57a2391749f4a82fc',1,'stan::gm::program_grammar']]], + ['derived_5fdecl_5f',['derived_decl_',['../structstan_1_1gm_1_1program.html#a24e02f27c716fefbf3ec7c3a766778f5',1,'stan::gm::program']]], + ['derived_5forigin',['derived_origin',['../namespacestan_1_1gm.html#af2cb1df6a23d138782246a8304ad7d86',1,'stan::gm']]], + ['derived_5fvar_5fdecls_5fr',['derived_var_decls_r',['../structstan_1_1gm_1_1program__grammar.html#a3dd0e48430d1ef2e41b8bb670ed872e6',1,'stan::gm::program_grammar']]], + ['description',['description',['../classstan_1_1gm_1_1argument.html#a49d0e69d3fbade5ba476bac73f68cb24',1,'stan::gm::argument']]], + ['determinant',['determinant',['../namespacestan_1_1agrad.html#aa27b1abc14538bd9946ad1d6d1e8e60a',1,'stan::agrad::determinant(const Eigen::Matrix< fvar< T >, R, C > &m)'],['../namespacestan_1_1agrad.html#a6d1cf84909394145bb264afb9fee64ac',1,'stan::agrad::determinant(const Eigen::Matrix< var, R, C > &m)'],['../namespacestan_1_1math.html#ab65e9ab0e6f725c7e11068b0be2af84f',1,'stan::math::determinant()']]], + ['determinant_2ehpp',['determinant.hpp',['../agrad_2rev_2matrix_2determinant_8hpp.html',1,'']]], + ['determinant_2ehpp',['determinant.hpp',['../agrad_2fwd_2matrix_2determinant_8hpp.html',1,'']]], + ['determinant_2ehpp',['determinant.hpp',['../math_2matrix_2determinant_8hpp.html',1,'']]], + ['df',['df',['../classstan_1_1optimization_1_1_model_adaptor.html#a5c832385e9d4792ccf2c4375e2b1ade3',1,'stan::optimization::ModelAdaptor']]], + ['diag_5fe_5fmetric',['diag_e_metric',['../classstan_1_1mcmc_1_1diag__e__metric.html',1,'stan::mcmc']]], + ['diag_5fe_5fmetric',['diag_e_metric',['../classstan_1_1mcmc_1_1diag__e__metric.html#aa85e6a49b53531d5cd722666394fbd70',1,'stan::mcmc::diag_e_metric']]], + ['diag_5fe_5fmetric_2ehpp',['diag_e_metric.hpp',['../diag__e__metric_8hpp.html',1,'']]], + ['diag_5fe_5fnuts',['diag_e_nuts',['../classstan_1_1mcmc_1_1diag__e__nuts.html#a2adb4853ab835ff95474e593750cc4f7',1,'stan::mcmc::diag_e_nuts']]], + ['diag_5fe_5fnuts',['diag_e_nuts',['../classstan_1_1mcmc_1_1diag__e__nuts.html',1,'stan::mcmc']]], + ['diag_5fe_5fnuts_2ehpp',['diag_e_nuts.hpp',['../diag__e__nuts_8hpp.html',1,'']]], + ['diag_5fe_5fpoint',['diag_e_point',['../classstan_1_1mcmc_1_1diag__e__point.html#a5cfefc79d93c982528c7cf957fdc20a2',1,'stan::mcmc::diag_e_point::diag_e_point(int n)'],['../classstan_1_1mcmc_1_1diag__e__point.html#a7fd76371128c831232948273a46c50b2',1,'stan::mcmc::diag_e_point::diag_e_point(const diag_e_point &z)']]], + ['diag_5fe_5fpoint',['diag_e_point',['../classstan_1_1mcmc_1_1diag__e__point.html',1,'stan::mcmc']]], + ['diag_5fe_5fpoint_2ehpp',['diag_e_point.hpp',['../diag__e__point_8hpp.html',1,'']]], + ['diag_5fe_5fstatic_5fhmc',['diag_e_static_hmc',['../classstan_1_1mcmc_1_1diag__e__static__hmc.html',1,'stan::mcmc']]], + ['diag_5fe_5fstatic_5fhmc',['diag_e_static_hmc',['../classstan_1_1mcmc_1_1diag__e__static__hmc.html#a3188ee6bf11965a9e5a582302483f8fc',1,'stan::mcmc::diag_e_static_hmc']]], + ['diag_5fe_5fstatic_5fhmc_2ehpp',['diag_e_static_hmc.hpp',['../diag__e__static__hmc_8hpp.html',1,'']]], + ['diag_5fmatrix',['diag_matrix',['../namespacestan_1_1math.html#af970bc3201f476e84259e7ba2d4eb276',1,'stan::math']]], + ['diag_5fmatrix_2ehpp',['diag_matrix.hpp',['../diag__matrix_8hpp.html',1,'']]], + ['diag_5fpost_5fmultiply',['diag_post_multiply',['../namespacestan_1_1math.html#a00896827d3247350178c86c0aed533f6',1,'stan::math']]], + ['diag_5fpost_5fmultiply_2ehpp',['diag_post_multiply.hpp',['../diag__post__multiply_8hpp.html',1,'']]], + ['diag_5fpre_5fmultiply',['diag_pre_multiply',['../namespacestan_1_1math.html#a6159f8ffb5a37c394dff93781622f504',1,'stan::math']]], + ['diag_5fpre_5fmultiply_2ehpp',['diag_pre_multiply.hpp',['../diag__pre__multiply_8hpp.html',1,'']]], + ['diagonal',['diagonal',['../namespacestan_1_1math.html#a877aa9df52c3a3f300a3d214c7bde64a',1,'stan::math']]], + ['diagonal_2ehpp',['diagonal.hpp',['../diagonal_8hpp.html',1,'']]], + ['digamma',['digamma',['../namespacestan_1_1agrad.html#a253104e7f6fed46947b23b3e9515b668',1,'stan::agrad::digamma(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#aec8af996186baacdbb3e707fa02d80ea',1,'stan::agrad::digamma(const stan::agrad::var &a)'],['../namespacestan_1_1math.html#a5eb54ce92709046c6d168e851d2481c7',1,'stan::math::digamma()']]], + ['digamma_2ehpp',['digamma.hpp',['../agrad_2fwd_2functions_2digamma_8hpp.html',1,'']]], + ['digamma_2ehpp',['digamma.hpp',['../agrad_2rev_2functions_2digamma_8hpp.html',1,'']]], + ['digamma_2ehpp',['digamma.hpp',['../math_2functions_2digamma_8hpp.html',1,'']]], + ['digits',['digits',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#ab7fc728472be7d381bf47674c5d158db',1,'std::numeric_limits< stan::agrad::fvar< T > >::digits()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a98f7189075cd866db3f13c1d8bc8f210',1,'std::numeric_limits< stan::agrad::var >::digits()']]], + ['digits10',['digits10',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a82bc6dd47767407e075cfbc04a9872d4',1,'std::numeric_limits< stan::agrad::fvar< T > >::digits10()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#afa394a3a7449a6a03d19176378ae5ea4',1,'std::numeric_limits< stan::agrad::var >::digits10()']]], + ['dimensions',['dimensions',['../print_8hpp.html#aca9cbff882a3a995d9d4bc69d0f693da',1,'print.hpp']]], + ['dims',['dims',['../classstan_1_1io_1_1dump__reader.html#a6ada826cbef5e7ab4213efe629945d95',1,'stan::io::dump_reader::dims()'],['../namespacestan_1_1math.html#a2b9073e39033e56eb31344091f0170fd',1,'stan::math::dims(const T &x, std::vector< int > &result)'],['../namespacestan_1_1math.html#af95a2dcde478c06e3543511821618902',1,'stan::math::dims(const Eigen::Matrix< T, R, C > &x, std::vector< int > &result)'],['../namespacestan_1_1math.html#a467589eef4220a87d457c8a268a1fd5d',1,'stan::math::dims(const std::vector< T > &x, std::vector< int > &result)'],['../namespacestan_1_1math.html#a33777ee768c7032331ca8b92e5323384',1,'stan::math::dims(const T &x)']]], + ['dims_2ehpp',['dims.hpp',['../dims_8hpp.html',1,'']]], + ['dims_5f',['dims_',['../structstan_1_1gm_1_1variable__dims.html#a70f46c11bdd84865ec1b65c37f9ad23c',1,'stan::gm::variable_dims::dims_()'],['../structstan_1_1gm_1_1base__var__decl.html#a34df8ccee8d884095d1b95ea2503a42c',1,'stan::gm::base_var_decl::dims_()']]], + ['dims_5fi',['dims_i',['../classstan_1_1io_1_1dump.html#a1bdf386abd7e81a9a287c6a59a48eac9',1,'stan::io::dump::dims_i()'],['../classstan_1_1io_1_1var__context.html#a445c05ee5f0fbe9548cdbdc7b08d31f1',1,'stan::io::var_context::dims_i()']]], + ['dims_5fr',['dims_r',['../structstan_1_1gm_1_1statement__grammar.html#a894de01f7a57cb4f67c157e12faf33ad',1,'stan::gm::statement_grammar::dims_r()'],['../structstan_1_1gm_1_1term__grammar.html#a572196c88493b512a11e7995fe201505',1,'stan::gm::term_grammar::dims_r()'],['../structstan_1_1gm_1_1var__decls__grammar.html#a18dc853a54fc1727eea828ef99f36e01',1,'stan::gm::var_decls_grammar::dims_r()'],['../classstan_1_1io_1_1dump.html#ad1a19a706880befca7fe4a3c4dc4a39f',1,'stan::io::dump::dims_r()'],['../classstan_1_1io_1_1var__context.html#ae1e90fd2b90b43267a5ab1c1b5cf880a',1,'stan::io::var_context::dims_r()']]], + ['dimss_5f',['dimss_',['../structstan_1_1gm_1_1index__op.html#a8a7e436ba365c1e1f4bafee5a3be34a9',1,'stan::gm::index_op']]], + ['dirichlet_2ehpp',['dirichlet.hpp',['../dirichlet_8hpp.html',1,'']]], + ['dirichlet_5flog',['dirichlet_log',['../namespacestan_1_1prob.html#a788f709440fd4c6189fa6d40a32cc328',1,'stan::prob::dirichlet_log(const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta, const Eigen::Matrix< T_prior_sample_size, Eigen::Dynamic, 1 > &alpha)'],['../namespacestan_1_1prob.html#a91bcdf333694f9c1f685de29105d9bf5',1,'stan::prob::dirichlet_log(const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta, const Eigen::Matrix< T_prior_sample_size, Eigen::Dynamic, 1 > &alpha)']]], + ['dirichlet_5frng',['dirichlet_rng',['../namespacestan_1_1prob.html#a4324e10af97b35a6b667f7b02ddbb7e2',1,'stan::prob']]], + ['discrete_2ehpp',['discrete.hpp',['../multivariate_2discrete_8hpp.html',1,'']]], + ['discrete_2ehpp',['discrete.hpp',['../univariate_2discrete_8hpp.html',1,'']]], + ['disengage_5fadaptation',['disengage_adaptation',['../classstan_1_1mcmc_1_1base__adapter.html#af8eb7f179d54f984c61aa945ceb56492',1,'stan::mcmc::base_adapter::disengage_adaptation()'],['../classstan_1_1mcmc_1_1adapt__dense__e__nuts.html#aac70c0c7dc28e85fa793176e0f05b2e0',1,'stan::mcmc::adapt_dense_e_nuts::disengage_adaptation()'],['../classstan_1_1mcmc_1_1adapt__diag__e__nuts.html#a6b7d857c9b602525cbdddf78f18f5f52',1,'stan::mcmc::adapt_diag_e_nuts::disengage_adaptation()'],['../classstan_1_1mcmc_1_1adapt__unit__e__nuts.html#a7024d8a1794d7d3afa01a7cc92e1a734',1,'stan::mcmc::adapt_unit_e_nuts::disengage_adaptation()'],['../classstan_1_1mcmc_1_1adapt__dense__e__static__hmc.html#a82b0383814a0aa603f06651c562ac649',1,'stan::mcmc::adapt_dense_e_static_hmc::disengage_adaptation()'],['../classstan_1_1mcmc_1_1adapt__diag__e__static__hmc.html#afcc9890fefe667daf023826a054324b3',1,'stan::mcmc::adapt_diag_e_static_hmc::disengage_adaptation()'],['../classstan_1_1mcmc_1_1adapt__unit__e__static__hmc.html#a3b2afe0cec71096e356ac100014c9073',1,'stan::mcmc::adapt_unit_e_static_hmc::disengage_adaptation()']]], + ['dist',['dist',['../namespacestan_1_1math.html#ae86020a972c6efc6b3407c3cfc30f4a6',1,'stan::math::dist(const std::vector< double > &x, const std::vector< double > &y)'],['../namespacestan_1_1math.html#a5b7a051fb294f63774525cb76bfb3fb9',1,'stan::math::dist(const Eigen::Matrix< T1, R1, C1 > &v1, const Eigen::Matrix< T2, R2, C2 > &v2)']]], + ['dist_2ehpp',['dist.hpp',['../functions_2dist_8hpp.html',1,'']]], + ['dist_2ehpp',['dist.hpp',['../matrix_2dist_8hpp.html',1,'']]], + ['dist_5f',['dist_',['../structstan_1_1gm_1_1sample.html#a516dbdf8e9b0deee39b6ff63c8d5cde1',1,'stan::gm::sample']]], + ['distribution',['distribution',['../structstan_1_1gm_1_1distribution.html',1,'stan::gm']]], + ['distribution_5fr',['distribution_r',['../structstan_1_1gm_1_1statement__grammar.html#ad54fcb7f586876e0dbbf146d8aa7099b',1,'stan::gm::statement_grammar']]], + ['distributions_2ehpp',['distributions.hpp',['../distributions_8hpp.html',1,'']]], + ['divide',['divide',['../namespacestan_1_1agrad.html#a8834a2f7763f46dd14e765d6c3287d23',1,'stan::agrad::divide(const T1 &v, const T2 &c)'],['../namespacestan_1_1agrad.html#a8bfe03ac15191df9f6777217e8d698b8',1,'stan::agrad::divide(const Eigen::Matrix< fvar< T >, R, C > &v, const fvar< T > &c)'],['../namespacestan_1_1agrad.html#a1897f84d86b89b5485b10f20e30a2613',1,'stan::agrad::divide(const Eigen::Matrix< fvar< T >, R, C > &v, const double c)'],['../namespacestan_1_1agrad.html#a9e95e534e22aad48cd9a29584958f7a2',1,'stan::agrad::divide(const Eigen::Matrix< double, R, C > &v, const fvar< T > &c)'],['../namespacestan_1_1agrad.html#af3abe6f014b50c5873fa84734cad4131',1,'stan::agrad::divide(double x, double y)'],['../namespacestan_1_1agrad.html#a6b7cb944896ee4923018198ea3946773',1,'stan::agrad::divide(const Eigen::Matrix< T1, R, C > &v, const T2 &c)'],['../namespacestan_1_1math.html#a082ee76b34a2ea656d2c8ab9186c1a2b',1,'stan::math::divide()']]], + ['divide_2ehpp',['divide.hpp',['../agrad_2fwd_2matrix_2divide_8hpp.html',1,'']]], + ['divide_2ehpp',['divide.hpp',['../agrad_2rev_2matrix_2divide_8hpp.html',1,'']]], + ['divide_2ehpp',['divide.hpp',['../math_2matrix_2divide_8hpp.html',1,'']]], + ['division',['division',['../namespacestan_1_1gm.html#aba4de316e472e23ea0f375d1e1a7cc33',1,'stan::gm']]], + ['division_5fexpr',['division_expr',['../structstan_1_1gm_1_1division__expr.html',1,'stan::gm']]], + ['do_5flkj_5fconstant',['do_lkj_constant',['../namespacestan_1_1prob.html#a3e884a06b4337008b72a3e75c1aee386',1,'stan::prob']]], + ['do_5fprint',['do_print',['../namespacestan_1_1gm.html#a0505a5edd8692d9113977c9cd19bc778',1,'stan::gm']]], + ['dom_5ferr',['dom_err',['../namespacestan_1_1math.html#a5af45491b0f1852295f1c7ec0730294c',1,'stan::math']]], + ['dom_5ferr_2ehpp',['dom_err.hpp',['../dom__err_8hpp.html',1,'']]], + ['dom_5ferr_5fvec',['dom_err_vec',['../namespacestan_1_1math.html#a5114bd4a8397e21dd60cc596d24022fe',1,'stan::math']]], + ['dom_5ferr_5fvec_2ehpp',['dom_err_vec.hpp',['../dom__err__vec_8hpp.html',1,'']]], + ['dot',['dot',['../namespacestan_1_1math.html#afd3b73319bd8df9dad1d3902997d8e89',1,'stan::math']]], + ['dot_2ehpp',['dot.hpp',['../dot_8hpp.html',1,'']]], + ['dot_5fproduct',['dot_product',['../namespacestan_1_1agrad.html#a6ab5996a680002f996384f7f7cc2ba86',1,'stan::agrad::dot_product(const Eigen::Matrix< fvar< T >, R1, C1 > &v1, const Eigen::Matrix< fvar< T >, R2, C2 > &v2)'],['../namespacestan_1_1agrad.html#a516128a11f53f55e533ed1d0bcd07b1d',1,'stan::agrad::dot_product(const Eigen::Matrix< fvar< T >, R1, C1 > &v1, const Eigen::Matrix< double, R2, C2 > &v2)'],['../namespacestan_1_1agrad.html#a2e18b595e821acf4af3bd9615b51eeff',1,'stan::agrad::dot_product(const Eigen::Matrix< double, R1, C1 > &v1, const Eigen::Matrix< fvar< T >, R2, C2 > &v2)'],['../namespacestan_1_1agrad.html#aaf1dc132cacae954cde8a4bd94d3d33e',1,'stan::agrad::dot_product(const Eigen::Matrix< fvar< T >, R1, C1 > &v1, const Eigen::Matrix< fvar< T >, R2, C2 > &v2, size_type &length)'],['../namespacestan_1_1agrad.html#a48ed77a6a9982642731d22f05f729281',1,'stan::agrad::dot_product(const Eigen::Matrix< fvar< T >, R1, C1 > &v1, const Eigen::Matrix< double, R2, C2 > &v2, size_type &length)'],['../namespacestan_1_1agrad.html#a2588ccae6e0c5bd5cfa50c08477025c9',1,'stan::agrad::dot_product(const Eigen::Matrix< double, R1, C1 > &v1, const Eigen::Matrix< fvar< T >, R2, C2 > &v2, size_type &length)'],['../namespacestan_1_1agrad.html#adc99c244a2cd1ac8e60ba4a14874d874',1,'stan::agrad::dot_product(const std::vector< fvar< T > > &v1, const std::vector< fvar< T > > &v2)'],['../namespacestan_1_1agrad.html#a427294fe7f03d86b0d13c588de3056f6',1,'stan::agrad::dot_product(const std::vector< double > &v1, const std::vector< fvar< T > > &v2)'],['../namespacestan_1_1agrad.html#aa01ea6a323474c7fbb9be783a9f805ff',1,'stan::agrad::dot_product(const std::vector< fvar< T > > &v1, const std::vector< double > &v2)'],['../namespacestan_1_1agrad.html#aba1e86a65c31342dc920bec07eeeac1b',1,'stan::agrad::dot_product(const std::vector< fvar< T > > &v1, const std::vector< fvar< T > > &v2, size_type &length)'],['../namespacestan_1_1agrad.html#ab66e08f88fa7d6a448082ade1153cac3',1,'stan::agrad::dot_product(const std::vector< double > &v1, const std::vector< fvar< T > > &v2, size_type &length)'],['../namespacestan_1_1agrad.html#ae8dea21d83c52cfdd1a0d6114633f2d3',1,'stan::agrad::dot_product(const std::vector< fvar< T > > &v1, const std::vector< double > &v2, size_type &length)'],['../namespacestan_1_1agrad.html#a4011d7bf9c85f3408ed0139436bcc958',1,'stan::agrad::dot_product(const Eigen::Matrix< T1, R1, C1 > &v1, const Eigen::Matrix< T2, R2, C2 > &v2)'],['../namespacestan_1_1agrad.html#ad390f00556d047ae51e5a6a8dd5842a5',1,'stan::agrad::dot_product(const T1 *v1, const T2 *v2, size_t length)'],['../namespacestan_1_1agrad.html#a349c89cb994774063fd7fb561d130ad5',1,'stan::agrad::dot_product(const std::vector< T1 > &v1, const std::vector< T2 > &v2)'],['../namespacestan_1_1math.html#af8d73851895fb151fdf79e55bf33e98e',1,'stan::math::dot_product(const Eigen::Matrix< double, R1, C1 > &v1, const Eigen::Matrix< double, R2, C2 > &v2)'],['../namespacestan_1_1math.html#a58da447df259e9e092e8fd910b338e1f',1,'stan::math::dot_product(const double *v1, const double *v2, size_t length)'],['../namespacestan_1_1math.html#ab7cd93708bf432b3bd3d284958972ede',1,'stan::math::dot_product(const std::vector< double > &v1, const std::vector< double > &v2)']]], + ['dot_5fproduct_2ehpp',['dot_product.hpp',['../math_2matrix_2dot__product_8hpp.html',1,'']]], + ['dot_5fproduct_2ehpp',['dot_product.hpp',['../agrad_2fwd_2matrix_2dot__product_8hpp.html',1,'']]], + ['dot_5fproduct_2ehpp',['dot_product.hpp',['../agrad_2rev_2matrix_2dot__product_8hpp.html',1,'']]], + ['dot_5fproduct_5fstore_5ftype',['dot_product_store_type',['../structdot__product__store__type.html',1,'']]], + ['dot_5fself',['dot_self',['../namespacestan_1_1agrad.html#a4c1836521010bd6f18b5a58061cc3198',1,'stan::agrad::dot_self(const Eigen::Matrix< fvar< T >, R, C > &v)'],['../namespacestan_1_1agrad.html#a88446fe7bdc500d280a66cd8b58bf475',1,'stan::agrad::dot_self(const Eigen::Matrix< var, R, C > &v)'],['../namespacestan_1_1math.html#a8a6a4ef7c701db7984297d153580c8d4',1,'stan::math::dot_self(const std::vector< double > &x)'],['../namespacestan_1_1math.html#ac81ab85d390fcb594884773a85fac657',1,'stan::math::dot_self(const Eigen::Matrix< double, R, C > &v)']]], + ['dot_5fself_2ehpp',['dot_self.hpp',['../agrad_2rev_2matrix_2dot__self_8hpp.html',1,'']]], + ['dot_5fself_2ehpp',['dot_self.hpp',['../math_2functions_2dot__self_8hpp.html',1,'']]], + ['dot_5fself_2ehpp',['dot_self.hpp',['../agrad_2fwd_2matrix_2dot__self_8hpp.html',1,'']]], + ['dot_5fself_2ehpp',['dot_self.hpp',['../math_2matrix_2dot__self_8hpp.html',1,'']]], + ['dotval_5f',['dotval_',['../_eigen___num_traits_8hpp.html#a7616b0eef5b3dc26e5a5b62a3ead2035',1,'Eigen_NumTraits.hpp']]], + ['double_5fdecl_5fr',['double_decl_r',['../structstan_1_1gm_1_1var__decls__grammar.html#aaa761edc4a269b040365070ae0e1b38b',1,'stan::gm::var_decls_grammar']]], + ['double_5fexponential_2ehpp',['double_exponential.hpp',['../double__exponential_8hpp.html',1,'']]], + ['double_5fexponential_5fccdf_5flog',['double_exponential_ccdf_log',['../namespacestan_1_1prob.html#a799d82a35ad39823a27340bb57656643',1,'stan::prob']]], + ['double_5fexponential_5fcdf',['double_exponential_cdf',['../namespacestan_1_1prob.html#acb5d3e2870190b33cb60f9165820a07b',1,'stan::prob']]], + ['double_5fexponential_5fcdf_5flog',['double_exponential_cdf_log',['../namespacestan_1_1prob.html#a9f090972ba99ef96684475140e8d7e39',1,'stan::prob']]], + ['double_5fexponential_5flog',['double_exponential_log',['../namespacestan_1_1prob.html#a7621036746361ce33a182006375fcf56',1,'stan::prob::double_exponential_log(const T_y &y, const T_loc &mu, const T_scale &sigma)'],['../namespacestan_1_1prob.html#a2fd04507640d7df4025cdf22bc1940e1',1,'stan::prob::double_exponential_log(const T_y &y, const T_loc &mu, const T_scale &sigma)']]], + ['double_5fexponential_5frng',['double_exponential_rng',['../namespacestan_1_1prob.html#aced8b51bafb8aa39773b8f278559ec09',1,'stan::prob']]], + ['double_5fliteral',['double_literal',['../structstan_1_1gm_1_1double__literal.html#abab56647c315a43fdb62b7b2f1ff3ce2',1,'stan::gm::double_literal::double_literal()'],['../structstan_1_1gm_1_1double__literal.html#a99fefae4612adf8c085e2ce158bba7b3',1,'stan::gm::double_literal::double_literal(double val)']]], + ['double_5fliteral',['double_literal',['../structstan_1_1gm_1_1double__literal.html',1,'stan::gm']]], + ['double_5fliteral_5fr',['double_literal_r',['../structstan_1_1gm_1_1term__grammar.html#a91f8666c8899032d59c1ad4f54a9c0c3',1,'stan::gm::term_grammar']]], + ['double_5ft',['DOUBLE_T',['../namespacestan_1_1gm.html#a903b745f5e5ae0c05b667e45e5d62e66',1,'stan::gm']]], + ['double_5fvalues',['double_values',['../classstan_1_1io_1_1dump__reader.html#ac275a400d67c89a01d980fa2ea093ed3',1,'stan::io::dump_reader']]], + ['double_5fvar_5fdecl',['double_var_decl',['../structstan_1_1gm_1_1double__var__decl.html',1,'stan::gm']]], + ['double_5fvar_5fdecl',['double_var_decl',['../structstan_1_1gm_1_1double__var__decl.html#ac777d487174edeba42d587ff70ebbf38',1,'stan::gm::double_var_decl::double_var_decl()'],['../structstan_1_1gm_1_1double__var__decl.html#a0f4506bf06efcfc3bdec5db3aad51f80',1,'stan::gm::double_var_decl::double_var_decl(range const &range, std::string const &name, std::vector< expression > const &dims)']]], + ['doublevectorview',['DoubleVectorView',['../classstan_1_1_double_vector_view.html',1,'stan']]], + ['doublevectorview',['DoubleVectorView',['../classstan_1_1_double_vector_view.html#a574803fc6d532f052ffcce6b8cefac58',1,'stan::DoubleVectorView::DoubleVectorView()'],['../classstan_1_1_double_vector_view_3_01true_00_01false_01_4.html#a73f42b82f90108127bcd8e4952328618',1,'stan::DoubleVectorView< true, false >::DoubleVectorView()'],['../classstan_1_1_double_vector_view_3_01true_00_01true_01_4.html#a2ed705a71ac46654258500ecdff057aa',1,'stan::DoubleVectorView< true, true >::DoubleVectorView()']]], + ['doublevectorview_3c_20true_2c_20false_20_3e',['DoubleVectorView< true, false >',['../classstan_1_1_double_vector_view_3_01true_00_01false_01_4.html',1,'stan']]], + ['doublevectorview_3c_20true_2c_20true_20_3e',['DoubleVectorView< true, true >',['../classstan_1_1_double_vector_view_3_01true_00_01true_01_4.html',1,'stan']]], + ['dphi_5fdq',['dphi_dq',['../classstan_1_1mcmc_1_1base__hamiltonian.html#a4ac1d9af0360d98a5f5725752d784d26',1,'stan::mcmc::base_hamiltonian::dphi_dq()'],['../classstan_1_1mcmc_1_1dense__e__metric.html#a1172afcf9fdfe07704c6fde165d2c65d',1,'stan::mcmc::dense_e_metric::dphi_dq()'],['../classstan_1_1mcmc_1_1diag__e__metric.html#afdc9e9ca146ec4afc943f1643d1abf5c',1,'stan::mcmc::diag_e_metric::dphi_dq()'],['../classstan_1_1mcmc_1_1unit__e__metric.html#aa309e8c017d1d65eb4c1996ec52375a1',1,'stan::mcmc::unit_e_metric::dphi_dq()']]], + ['dtau_5fdp',['dtau_dp',['../classstan_1_1mcmc_1_1base__hamiltonian.html#a52f1eecd0e71160cbe496af89ecb163e',1,'stan::mcmc::base_hamiltonian::dtau_dp()'],['../classstan_1_1mcmc_1_1dense__e__metric.html#a42125a6efb109bad98202343bd4f16dc',1,'stan::mcmc::dense_e_metric::dtau_dp()'],['../classstan_1_1mcmc_1_1diag__e__metric.html#a02386e255cd255f066f9620d3dbb41f3',1,'stan::mcmc::diag_e_metric::dtau_dp()'],['../classstan_1_1mcmc_1_1unit__e__metric.html#a7f21e1814aac56a2be51674b07f70744',1,'stan::mcmc::unit_e_metric::dtau_dp()']]], + ['dtau_5fdq',['dtau_dq',['../classstan_1_1mcmc_1_1base__hamiltonian.html#af61e96b9766092a3c161a020f440785d',1,'stan::mcmc::base_hamiltonian::dtau_dq()'],['../classstan_1_1mcmc_1_1dense__e__metric.html#acb07208943a4c9a73baa825e5c164b5c',1,'stan::mcmc::dense_e_metric::dtau_dq()'],['../classstan_1_1mcmc_1_1diag__e__metric.html#af03722a421a4b8f8a21fb2f4ae65d98e',1,'stan::mcmc::diag_e_metric::dtau_dq()'],['../classstan_1_1mcmc_1_1unit__e__metric.html#a87728dc744116e7e7b90ca0ffbc3c186',1,'stan::mcmc::unit_e_metric::dtau_dq()']]], + ['dtrs_5f',['dtrs_',['../classstan_1_1agrad_1_1stored__gradient__vari.html#afb98edd9fb9584921e7ef283e5c9478e',1,'stan::agrad::stored_gradient_vari']]], + ['dtype_5f',['Dtype_',['../agrad_2rev_2matrix_2ldlt_8hpp.html#a7c830ea3da654e2c30a3e8d4c41610e8',1,'ldlt.hpp']]], + ['dummy_5fprecision',['dummy_precision',['../struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html#ae1b9c4f662ce5e4087ff27b4374116cf',1,'Eigen::NumTraits< stan::agrad::var >']]], + ['dump',['dump',['../classstan_1_1io_1_1dump.html#a05c2de349bdf89ef97e2940dfabe3064',1,'stan::io::dump']]], + ['dump',['dump',['../classstan_1_1io_1_1dump.html',1,'stan::io']]], + ['dump_2ehpp',['dump.hpp',['../dump_8hpp.html',1,'']]], + ['dump_5flist',['dump_list',['../classstan_1_1io_1_1dump__writer.html#adeb591bec98817e4e2d3c049d672137f',1,'stan::io::dump_writer']]], + ['dump_5fmember_5fvar_5fvisgen',['dump_member_var_visgen',['../structstan_1_1gm_1_1dump__member__var__visgen.html',1,'stan::gm']]], + ['dump_5fmember_5fvar_5fvisgen',['dump_member_var_visgen',['../structstan_1_1gm_1_1dump__member__var__visgen.html#a4c22ce134acbfefce374269220cfd1d0',1,'stan::gm::dump_member_var_visgen']]], + ['dump_5freader',['dump_reader',['../classstan_1_1io_1_1dump__reader.html#a60f0c45b98358118444362c4a954068f',1,'stan::io::dump_reader::dump_reader()'],['../classstan_1_1io_1_1dump__reader.html#a5a2d82e204b9dc1b0af62fc902a17e37',1,'stan::io::dump_reader::dump_reader(std::istream &in)']]], + ['dump_5freader',['dump_reader',['../classstan_1_1io_1_1dump__reader.html',1,'stan::io']]], + ['dump_5fstructure',['dump_structure',['../classstan_1_1io_1_1dump__writer.html#aeffcdc7277269597f6f9e0bbd6110ef8',1,'stan::io::dump_writer']]], + ['dump_5fvar',['dump_var',['../classstan_1_1io_1_1dump__writer.html#a7f58183f74acada75a5dd61a83234502',1,'stan::io::dump_writer']]], + ['dump_5fwriter',['dump_writer',['../classstan_1_1io_1_1dump__writer.html',1,'stan::io']]], + ['dump_5fwriter',['dump_writer',['../classstan_1_1io_1_1dump__writer.html#ad5f0fd7ec8b1fc78d6719cabb6caa0d9',1,'stan::io::dump_writer::dump_writer()'],['../classstan_1_1io_1_1dump__writer.html#a783a19484fcba2bf776369f012a30509',1,'stan::io::dump_writer::dump_writer(std::ostream &out)']]], + ['dv_5fvari_2ehpp',['dv_vari.hpp',['../dv__vari_8hpp.html',1,'']]], + ['dvd_5fvari_2ehpp',['dvd_vari.hpp',['../dvd__vari_8hpp.html',1,'']]], + ['dvv_5fvari_2ehpp',['dvv_vari.hpp',['../dvv__vari_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/all_65.html b/doc/api/html/search/all_65.html new file mode 100644 index 00000000000..66cc8348793 --- /dev/null +++ b/doc/api/html/search/all_65.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/all_65.js b/doc/api/html/search/all_65.js new file mode 100644 index 00000000000..1c344bb432a --- /dev/null +++ b/doc/api/html/search/all_65.js @@ -0,0 +1,100 @@ +var searchData= +[ + ['e',['e',['../namespacestan_1_1math.html#a3b650a0131d41167ef4837ecc7d02be5',1,'stan::math::e()'],['../namespacestan_1_1math.html#a66f94e47c6dc073bbd3929903b4431fe',1,'stan::math::E()']]], + ['effective_5fsample_5fsize',['effective_sample_size',['../classstan_1_1mcmc_1_1chains.html#a37b1a6f5c8aa8cc7ecbce3008c4638b7',1,'stan::mcmc::chains::effective_sample_size(const int index)'],['../classstan_1_1mcmc_1_1chains.html#a02a748353706e1b811639d35021bfe7c',1,'stan::mcmc::chains::effective_sample_size(const std::string &name)']]], + ['eigen',['Eigen',['../namespace_eigen.html',1,'']]], + ['eigen_2edox',['Eigen.dox',['../_eigen_8dox.html',1,'']]], + ['eigen_2ehpp',['Eigen.hpp',['../_eigen_8hpp.html',1,'']]], + ['eigen_5fdensebase_5fplugin',['EIGEN_DENSEBASE_PLUGIN',['../_eigen_8hpp.html#a90ac195153d63737038c5b747962f4df',1,'Eigen.hpp']]], + ['eigen_5fnumtraits_2ehpp',['Eigen_NumTraits.hpp',['../_eigen___num_traits_8hpp.html',1,'']]], + ['eigenvalues_5fsym',['eigenvalues_sym',['../namespacestan_1_1math.html#aa37c65f508af7ad1d0b010aa5c932cbe',1,'stan::math']]], + ['eigenvalues_5fsym_2ehpp',['eigenvalues_sym.hpp',['../eigenvalues__sym_8hpp.html',1,'']]], + ['eigenvectors_5fsym',['eigenvectors_sym',['../namespacestan_1_1math.html#a9bd4729756e6ed00a35f1e4531444c13',1,'stan::math']]], + ['eigenvectors_5fsym_2ehpp',['eigenvectors_sym.hpp',['../eigenvectors__sym_8hpp.html',1,'']]], + ['elt_5fdivide',['elt_divide',['../namespacestan_1_1math.html#a3c9262da41fbf44fefc9a66141a0759d',1,'stan::math']]], + ['elt_5fdivide_2ehpp',['elt_divide.hpp',['../elt__divide_8hpp.html',1,'']]], + ['elt_5fdivision',['elt_division',['../namespacestan_1_1gm.html#a754bafd927243560d1f783d46ecb34a9',1,'stan::gm']]], + ['elt_5fdivision_5fexpr',['elt_division_expr',['../structstan_1_1gm_1_1elt__division__expr.html',1,'stan::gm']]], + ['elt_5fmultiplication',['elt_multiplication',['../namespacestan_1_1gm.html#a0953feed6c7def5c5a3e9326007e81ea',1,'stan::gm']]], + ['elt_5fmultiplication_5fexpr',['elt_multiplication_expr',['../structstan_1_1gm_1_1elt__multiplication__expr.html',1,'stan::gm']]], + ['elt_5fmultiply',['elt_multiply',['../namespacestan_1_1math.html#a998e2dce5971bba8c059995797e22ba0',1,'stan::math']]], + ['elt_5fmultiply_2ehpp',['elt_multiply.hpp',['../elt__multiply_8hpp.html',1,'']]], + ['empty_5fexp_5fvector',['EMPTY_EXP_VECTOR',['../namespacestan_1_1gm.html#a7b75153f298993fbca07d0e128a75771',1,'stan::gm']]], + ['end_5fadaptation_5fwindow',['end_adaptation_window',['../classstan_1_1mcmc_1_1windowed__adaptation.html#ae4b5c1e4712c89086d7f7e2c0463e245',1,'stan::mcmc::windowed_adaptation']]], + ['end_5fupdate_5fp',['end_update_p',['../classstan_1_1mcmc_1_1base__leapfrog.html#a4e043d1858bcbdaa2d84af24fadf0958',1,'stan::mcmc::base_leapfrog::end_update_p()'],['../classstan_1_1mcmc_1_1expl__leapfrog.html#a512ff7eeb698eb2aa276d10c77a25a2b',1,'stan::mcmc::expl_leapfrog::end_update_p()']]], + ['engage_5fadaptation',['engage_adaptation',['../classstan_1_1mcmc_1_1base__adapter.html#a7e1c264d6a6091938373903c813b6a0b',1,'stan::mcmc::base_adapter']]], + ['engine',['engine',['../structstan_1_1io_1_1stan__csv__metadata.html#af9275dd04e87640591d6f365ae2416cc',1,'stan::io::stan_csv_metadata']]], + ['eol',['EOL',['../namespacestan_1_1gm.html#a24fe8f1f728798f3f4e922ae086c2473',1,'stan::gm']]], + ['eol2',['EOL2',['../namespacestan_1_1gm.html#affc181dd85ce73c82cfbd0cde2321c6b',1,'stan::gm']]], + ['epsilon',['epsilon',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a5080115d295c7180feb653a44bfb0724',1,'std::numeric_limits< stan::agrad::fvar< T > >::epsilon()'],['../struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html#a9d192c3e8fe70d6ea68998877103ff6b',1,'Eigen::NumTraits< stan::agrad::var >::epsilon()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a2f80ac604bf9bb4fd6d42d720264c803',1,'std::numeric_limits< stan::agrad::var >::epsilon()'],['../namespacestan_1_1math.html#a5ffd625c2083751d7ccabb7dbe39cbe0',1,'stan::math::EPSILON()']]], + ['erf',['erf',['../namespacestan_1_1agrad.html#ac4d0f7557b5cea3a8e3a4ca05b5967fa',1,'stan::agrad::erf(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#aa84c9d13118bbeb0d8838e79edb33406',1,'stan::agrad::erf(const stan::agrad::var &a)']]], + ['erf_2ehpp',['erf.hpp',['../fwd_2functions_2erf_8hpp.html',1,'']]], + ['erf_2ehpp',['erf.hpp',['../rev_2functions_2erf_8hpp.html',1,'']]], + ['erfc',['erfc',['../namespacestan_1_1agrad.html#ad43010d593e90d2e8fffe7d314fc78a1',1,'stan::agrad::erfc(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#a5e56afd5e6984624acdf4e6b0aebc251',1,'stan::agrad::erfc(const stan::agrad::var &a)']]], + ['erfc_2ehpp',['erfc.hpp',['../fwd_2functions_2erfc_8hpp.html',1,'']]], + ['erfc_2ehpp',['erfc.hpp',['../rev_2functions_2erfc_8hpp.html',1,'']]], + ['error_5fcodes',['error_codes',['../structstan_1_1gm_1_1error__codes.html',1,'stan::gm']]], + ['error_5fcodes_2ehpp',['error_codes.hpp',['../error__codes_8hpp.html',1,'']]], + ['error_5fhandling_2edox',['error_handling.dox',['../error__handling_8dox.html',1,'']]], + ['error_5fhandling_2ehpp',['error_handling.hpp',['../math_2error__handling_8hpp.html',1,'']]], + ['error_5fhandling_2ehpp',['error_handling.hpp',['../agrad_2rev_2error__handling_8hpp.html',1,'']]], + ['error_5fmsgs_5f',['error_msgs_',['../structstan_1_1gm_1_1expression__grammar.html#ad7c2d0065b399be4677ff2a934880bab',1,'stan::gm::expression_grammar::error_msgs_()'],['../structstan_1_1gm_1_1program__grammar.html#abdcce1575595284876756bbccc1d782d',1,'stan::gm::program_grammar::error_msgs_()'],['../structstan_1_1gm_1_1statement__2__grammar.html#acd1c878d999eb7e0b296b8171effcff5',1,'stan::gm::statement_2_grammar::error_msgs_()'],['../structstan_1_1gm_1_1statement__grammar.html#a778922e661a8179a719c1c4f148a8e89',1,'stan::gm::statement_grammar::error_msgs_()'],['../structstan_1_1gm_1_1term__grammar.html#af0c016d0b7ee4d1a637697956fb1903b',1,'stan::gm::term_grammar::error_msgs_()'],['../structstan_1_1gm_1_1var__decls__grammar.html#a0de9ad5f258a7bd55322ee06caa43559',1,'stan::gm::var_decls_grammar::error_msgs_()']]], + ['evolve',['evolve',['../classstan_1_1mcmc_1_1base__integrator.html#a9462d1729356a62c9d3264c81bfe2ea8',1,'stan::mcmc::base_integrator::evolve()'],['../classstan_1_1mcmc_1_1base__leapfrog.html#aeaa5e375882c8792817432d5fb83cf1b',1,'stan::mcmc::base_leapfrog::evolve()']]], + ['exists',['exists',['../structstan_1_1gm_1_1variable__map.html#a29d85bf3018b2393c737dbb7d641ad32',1,'stan::gm::variable_map']]], + ['exp',['exp',['../namespacestan_1_1agrad.html#af8dbb5923cb5c5e94b80b21e1263e0e7',1,'stan::agrad::exp(const var &a)'],['../namespacestan_1_1agrad.html#a3953dfa2629b70db4117da64e77a1ba6',1,'stan::agrad::exp(const fvar< T > &x)'],['../namespacestan_1_1math.html#ac38f1fab5fe3e9b45c8c6e78ac3cc749',1,'stan::math::exp()']]], + ['exp_2ehpp',['exp.hpp',['../agrad_2fwd_2functions_2exp_8hpp.html',1,'']]], + ['exp_2ehpp',['exp.hpp',['../agrad_2rev_2functions_2exp_8hpp.html',1,'']]], + ['exp_2ehpp',['exp.hpp',['../math_2matrix_2exp_8hpp.html',1,'']]], + ['exp2',['exp2',['../namespacestan_1_1agrad.html#a4bb4a54d8488b2d7ca364037c7495cf8',1,'stan::agrad::exp2(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#a3c7b9522635566471bd40c9b994bd8b8',1,'stan::agrad::exp2(const stan::agrad::var &a)'],['../namespacestan_1_1math.html#a0ef734d7c3b8ebd689012295bf826e94',1,'stan::math::exp2()']]], + ['exp2_2ehpp',['exp2.hpp',['../agrad_2fwd_2functions_2exp2_8hpp.html',1,'']]], + ['exp2_2ehpp',['exp2.hpp',['../agrad_2rev_2functions_2exp2_8hpp.html',1,'']]], + ['exp2_2ehpp',['exp2.hpp',['../math_2functions_2exp2_8hpp.html',1,'']]], + ['exp_5fmod_5fnormal_2ehpp',['exp_mod_normal.hpp',['../exp__mod__normal_8hpp.html',1,'']]], + ['exp_5fmod_5fnormal_5fccdf_5flog',['exp_mod_normal_ccdf_log',['../namespacestan_1_1prob.html#acda3771d153ce0b6699db1bcabc7f994',1,'stan::prob']]], + ['exp_5fmod_5fnormal_5fcdf',['exp_mod_normal_cdf',['../namespacestan_1_1prob.html#a829c8e7a571893d48ee513be108162ac',1,'stan::prob']]], + ['exp_5fmod_5fnormal_5fcdf_5flog',['exp_mod_normal_cdf_log',['../namespacestan_1_1prob.html#a292d6dc1426b3aecc6a6415b0a5d9851',1,'stan::prob']]], + ['exp_5fmod_5fnormal_5flog',['exp_mod_normal_log',['../namespacestan_1_1prob.html#a95e73a8689e52bd28a8bb88f8ef0131b',1,'stan::prob::exp_mod_normal_log(const T_y &y, const T_loc &mu, const T_scale &sigma, const T_inv_scale &lambda)'],['../namespacestan_1_1prob.html#a0c333035ef21be05f6124919256ca7df',1,'stan::prob::exp_mod_normal_log(const T_y &y, const T_loc &mu, const T_scale &sigma, const T_inv_scale &lambda)']]], + ['exp_5fmod_5fnormal_5frng',['exp_mod_normal_rng',['../namespacestan_1_1prob.html#ad44443eca9be898e4a2fc013353a0f3c',1,'stan::prob']]], + ['exp_5fval_5f',['exp_val_',['../agrad__thread__safe_8hpp.html#ad5fa8da685c6b471f471d6ed4fc99ebd',1,'exp_val_(): agrad_thread_safe.hpp'],['../rev_2functions_2log10_8hpp.html#ad5fa8da685c6b471f471d6ed4fc99ebd',1,'exp_val_(): log10.hpp']]], + ['expl_5fleapfrog',['expl_leapfrog',['../classstan_1_1mcmc_1_1expl__leapfrog.html',1,'stan::mcmc']]], + ['expl_5fleapfrog',['expl_leapfrog',['../classstan_1_1mcmc_1_1expl__leapfrog.html#a2e93db18fb24e447931497904ae42421',1,'stan::mcmc::expl_leapfrog']]], + ['expl_5fleapfrog_2ehpp',['expl_leapfrog.hpp',['../expl__leapfrog_8hpp.html',1,'']]], + ['expl_5fleapfrog_3c_20dense_5fe_5fmetric_3c_20m_2c_20baserng_20_3e_2c_20dense_5fe_5fpoint_20_3e',['expl_leapfrog< dense_e_metric< M, BaseRNG >, dense_e_point >',['../classstan_1_1mcmc_1_1expl__leapfrog.html',1,'stan::mcmc']]], + ['expl_5fleapfrog_3c_20diag_5fe_5fmetric_3c_20m_2c_20baserng_20_3e_2c_20diag_5fe_5fpoint_20_3e',['expl_leapfrog< diag_e_metric< M, BaseRNG >, diag_e_point >',['../classstan_1_1mcmc_1_1expl__leapfrog.html',1,'stan::mcmc']]], + ['expl_5fleapfrog_3c_20unit_5fe_5fmetric_3c_20m_2c_20baserng_20_3e_2c_20unit_5fe_5fpoint_20_3e',['expl_leapfrog< unit_e_metric< M, BaseRNG >, unit_e_point >',['../classstan_1_1mcmc_1_1expl__leapfrog.html',1,'stan::mcmc']]], + ['expm1',['expm1',['../namespacestan_1_1agrad.html#a0ebbcc9d6368c357c1daba678d71beec',1,'stan::agrad::expm1(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#a0d2243d6b4d61aa41c095622e61e7a3e',1,'stan::agrad::expm1(const stan::agrad::var &a)']]], + ['expm1_2ehpp',['expm1.hpp',['../fwd_2functions_2expm1_8hpp.html',1,'']]], + ['expm1_2ehpp',['expm1.hpp',['../rev_2functions_2expm1_8hpp.html',1,'']]], + ['exponential_2ehpp',['exponential.hpp',['../exponential_8hpp.html',1,'']]], + ['exponential_5fccdf_5flog',['exponential_ccdf_log',['../namespacestan_1_1prob.html#a3ec6b8d579b4f186acb357692219d08e',1,'stan::prob']]], + ['exponential_5fcdf',['exponential_cdf',['../namespacestan_1_1prob.html#a3ed11c9b495e23976817f9c37b1f2af7',1,'stan::prob']]], + ['exponential_5fcdf_5flog',['exponential_cdf_log',['../namespacestan_1_1prob.html#a1f2a5189acae75f0eee599d604e872ab',1,'stan::prob']]], + ['exponential_5flog',['exponential_log',['../namespacestan_1_1prob.html#a6b5f560921b5b09edfe2f55ee909b17e',1,'stan::prob::exponential_log(const T_y &y, const T_inv_scale &beta)'],['../namespacestan_1_1prob.html#ae71620681df03e43f03002634a3c1855',1,'stan::prob::exponential_log(const T_y &y, const T_inv_scale &beta)']]], + ['exponential_5frng',['exponential_rng',['../namespacestan_1_1prob.html#a87460d0e1f55ec9fa5df01d59ef55bc0',1,'stan::prob']]], + ['expr_5f',['expr_',['../structstan_1_1gm_1_1expression.html#aea4b4bd3a099e637be3b6495cacf7a38',1,'stan::gm::expression::expr_()'],['../structstan_1_1gm_1_1index__op.html#acff80ac7b92703b3fc8e0e26d8ffa4ea',1,'stan::gm::index_op::expr_()'],['../structstan_1_1gm_1_1sample.html#a29225bfbf5c3cc9b6f259782ac957891',1,'stan::gm::sample::expr_()'],['../structstan_1_1gm_1_1assignment.html#a5b4337392501b66b3d72f1561e969fed',1,'stan::gm::assignment::expr_()']]], + ['expr_5ftype',['expr_type',['../structstan_1_1gm_1_1expr__type.html',1,'stan::gm']]], + ['expr_5ftype',['expr_type',['../structstan_1_1gm_1_1expr__type.html#a1ff96386c9bd4174c1a20d805238a992',1,'stan::gm::expr_type::expr_type()'],['../structstan_1_1gm_1_1expr__type.html#aa5e743430fd9c3891c635c3a23c038b1',1,'stan::gm::expr_type::expr_type(const base_expr_type base_type)'],['../structstan_1_1gm_1_1expr__type.html#a3c5bf10403a3eeb277f097f4c596ab92',1,'stan::gm::expr_type::expr_type(const base_expr_type base_type, size_t num_dims)']]], + ['expression',['expression',['../structstan_1_1gm_1_1expression.html',1,'stan::gm']]], + ['expression',['expression',['../structstan_1_1gm_1_1expression.html#ab361d5eb3d8bb5fe05e601760781fdce',1,'stan::gm::expression::expression()'],['../structstan_1_1gm_1_1expression.html#a192ef1829feee7075f4d3490d025948c',1,'stan::gm::expression::expression(const expression &e)'],['../structstan_1_1gm_1_1expression.html#a865d7dc525a001c8168f4d171922cd1b',1,'stan::gm::expression::expression(const nil &expr)'],['../structstan_1_1gm_1_1expression.html#a1c8a3f8fb8bbe3d29f8dfe561926a757',1,'stan::gm::expression::expression(const int_literal &expr)'],['../structstan_1_1gm_1_1expression.html#a07b50b75a888a4cc0e04b11697448178',1,'stan::gm::expression::expression(const double_literal &expr)'],['../structstan_1_1gm_1_1expression.html#ab9dfe0c525980b4e33a6f635dd5a5201',1,'stan::gm::expression::expression(const array_literal &expr)'],['../structstan_1_1gm_1_1expression.html#ad6d7cf87fda52077b952285867864bca',1,'stan::gm::expression::expression(const variable &expr)'],['../structstan_1_1gm_1_1expression.html#a54c0b18de4561bf0cbfa866e95516b75',1,'stan::gm::expression::expression(const fun &expr)'],['../structstan_1_1gm_1_1expression.html#a369b4548b7c22bb6e5c9011009ed1689',1,'stan::gm::expression::expression(const index_op &expr)'],['../structstan_1_1gm_1_1expression.html#af033e3bb265198db64040977ef64ff2e',1,'stan::gm::expression::expression(const binary_op &expr)'],['../structstan_1_1gm_1_1expression.html#a51c9181abfa94bdc35c586b15cd65e8f',1,'stan::gm::expression::expression(const unary_op &expr)'],['../structstan_1_1gm_1_1expression.html#a9b2fb897812c6d640bc8eff392afcbb0',1,'stan::gm::expression::expression(const expression_t &expr_)']]], + ['expression07_5fg',['expression07_g',['../structstan_1_1gm_1_1var__decls__grammar.html#a873990473ac21516e6aef9eeb17516b7',1,'stan::gm::var_decls_grammar']]], + ['expression07_5fr',['expression07_r',['../structstan_1_1gm_1_1expression__grammar.html#a039d451d73377c293b768acc290f4fe0',1,'stan::gm::expression_grammar']]], + ['expression09_5fr',['expression09_r',['../structstan_1_1gm_1_1expression__grammar.html#a49f5da4ddf11067e5f9234850f0246b7',1,'stan::gm::expression_grammar']]], + ['expression10_5fr',['expression10_r',['../structstan_1_1gm_1_1expression__grammar.html#a842a2f82871c9b725a4e01408412dfef',1,'stan::gm::expression_grammar']]], + ['expression14_5fr',['expression14_r',['../structstan_1_1gm_1_1expression__grammar.html#ad8c1a56d832543048c8c8ce78af686f6',1,'stan::gm::expression_grammar']]], + ['expression_5fas_5fstatement',['expression_as_statement',['../structstan_1_1gm_1_1expression__as__statement.html',1,'stan::gm']]], + ['expression_5fas_5fstatement_5ff',['expression_as_statement_f',['../namespacestan_1_1gm.html#a235997d18cc5a475e44e279951e7e96e',1,'stan::gm']]], + ['expression_5fg',['expression_g',['../structstan_1_1gm_1_1program__grammar.html#a57e35e3566d20e80fbfdaecd4035e850',1,'stan::gm::program_grammar::expression_g()'],['../structstan_1_1gm_1_1statement__2__grammar.html#ab1dd748c47712014575913b6d6d94b78',1,'stan::gm::statement_2_grammar::expression_g()'],['../structstan_1_1gm_1_1statement__grammar.html#ab7be40f62219856f74ad71670614c078',1,'stan::gm::statement_grammar::expression_g()'],['../structstan_1_1gm_1_1term__grammar.html#adc0324028be557cb8d639c30ffb4fe6d',1,'stan::gm::term_grammar::expression_g()'],['../structstan_1_1gm_1_1var__decls__grammar.html#a53b96dbd7fc4bf896e0e56c0087727cf',1,'stan::gm::var_decls_grammar::expression_g()']]], + ['expression_5fgrammar',['expression_grammar',['../structstan_1_1gm_1_1expression__grammar.html',1,'stan::gm']]], + ['expression_5fgrammar',['expression_grammar',['../structexpression__grammar.html',1,'expression_grammar< Iterator >'],['../structstan_1_1gm_1_1expression__grammar.html#a9a1dcf37552e3ba1eecc18cd4fe88528',1,'stan::gm::expression_grammar::expression_grammar()']]], + ['expression_5fgrammar_2ehpp',['expression_grammar.hpp',['../expression__grammar_8hpp.html',1,'']]], + ['expression_5fgrammar_5fdef_2ehpp',['expression_grammar_def.hpp',['../expression__grammar__def_8hpp.html',1,'']]], + ['expression_5fgrammar_5finst_2ecpp',['expression_grammar_inst.cpp',['../expression__grammar__inst_8cpp.html',1,'']]], + ['expression_5fr',['expression_r',['../structstan_1_1gm_1_1expression__grammar.html#a86d9c1c1655244e6ba1bfe2cb68d4bde',1,'stan::gm::expression_grammar']]], + ['expression_5ft',['expression_t',['../structstan_1_1gm_1_1expression.html#abae5cb68846d118c4e78e11afbaa4826',1,'stan::gm::expression']]], + ['expression_5ftype',['expression_type',['../structstan_1_1gm_1_1expression.html#a61fc6d63842363ebf2c501286874a159',1,'stan::gm::expression']]], + ['expression_5ftype_5fvis',['expression_type_vis',['../structstan_1_1gm_1_1expression__type__vis.html',1,'stan::gm']]], + ['expression_5fvisgen',['expression_visgen',['../structstan_1_1gm_1_1expression__visgen.html',1,'stan::gm']]], + ['expression_5fvisgen',['expression_visgen',['../structstan_1_1gm_1_1expression__visgen.html#a216c5cae399487b3a82c0e9005eb063c',1,'stan::gm::expression_visgen']]], + ['internal',['internal',['../namespace_eigen_1_1internal.html',1,'Eigen']]], + ['error_20handling_20policies',['Error Handling Policies',['../policy_page.html',1,'']]] +]; diff --git a/doc/api/html/search/all_66.html b/doc/api/html/search/all_66.html new file mode 100644 index 00000000000..3d1f8b35e89 --- /dev/null +++ b/doc/api/html/search/all_66.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/all_66.js b/doc/api/html/search/all_66.js new file mode 100644 index 00000000000..1ca0b177f5f --- /dev/null +++ b/doc/api/html/search/all_66.js @@ -0,0 +1,59 @@ +var searchData= +[ + ['f32',['F32',['../namespacestan_1_1math.html#a582d3c65ec66505882d2d1b740887ae8',1,'stan::math']]], + ['fabs',['fabs',['../namespacestan_1_1agrad.html#a16b719a6d38dc2ccc9eeae9ecbdc6cce',1,'stan::agrad::fabs(const var &a)'],['../namespacestan_1_1agrad.html#ae8cb1fd9f1e72fef6e442c1e566006b9',1,'stan::agrad::fabs(const fvar< T > &x)']]], + ['fabs_2ehpp',['fabs.hpp',['../fwd_2functions_2fabs_8hpp.html',1,'']]], + ['fabs_2ehpp',['fabs.hpp',['../rev_2functions_2fabs_8hpp.html',1,'']]], + ['factor_5fcov_5fmatrix',['factor_cov_matrix',['../namespacestan_1_1prob.html#a12303c67d7416a48497afe8b59913d13',1,'stan::prob']]], + ['factor_5fr',['factor_r',['../structstan_1_1gm_1_1term__grammar.html#a9d446cacd531a1f58fbd26edf3465065',1,'stan::gm::term_grammar']]], + ['falling_5ffactorial',['falling_factorial',['../namespacestan_1_1agrad.html#afd34f7d31e0b8259abb0f61fac5e6fcd',1,'stan::agrad::falling_factorial(const fvar< T > &x, const fvar< T > &n)'],['../namespacestan_1_1agrad.html#a22978d7897d2c1b62f9faa70b69969bb',1,'stan::agrad::falling_factorial(const fvar< T > &x, const double n)'],['../namespacestan_1_1agrad.html#a371442e647e39bf957ec3c9c58454d03',1,'stan::agrad::falling_factorial(const double x, const fvar< T > &n)'],['../namespacestan_1_1agrad.html#a3fe9336533c29b3f48381f31e5b2f34d',1,'stan::agrad::falling_factorial(const var &a, const double &b)'],['../namespacestan_1_1agrad.html#ac91a3d31a2220937ca9052d66c12292b',1,'stan::agrad::falling_factorial(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#a9dee7426dac152938bbdb79b70395106',1,'stan::agrad::falling_factorial(const double &a, const var &b)'],['../namespacestan_1_1math.html#ac2df2a7019f7f68a915b3edab21921a1',1,'stan::math::falling_factorial()']]], + ['falling_5ffactorial_2ehpp',['falling_factorial.hpp',['../agrad_2fwd_2functions_2falling__factorial_8hpp.html',1,'']]], + ['falling_5ffactorial_2ehpp',['falling_factorial.hpp',['../math_2functions_2falling__factorial_8hpp.html',1,'']]], + ['falling_5ffactorial_2ehpp',['falling_factorial.hpp',['../agrad_2rev_2functions_2falling__factorial_8hpp.html',1,'']]], + ['family_5f',['family_',['../structstan_1_1gm_1_1distribution.html#ab09553687b34895debe5818c548f26b8',1,'stan::gm::distribution']]], + ['fdim',['fdim',['../namespacestan_1_1agrad.html#a3602c7867931bfd2085509c75596ce09',1,'stan::agrad::fdim(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a0be65ebed198f4ea8dbc5b7b1cd7126f',1,'stan::agrad::fdim(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#a1035a00ecb52c988bab0a77698c00f44',1,'stan::agrad::fdim(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a8b11e04370013c6df527524463f9ca74',1,'stan::agrad::fdim(const stan::agrad::var &a, const stan::agrad::var &b)'],['../namespacestan_1_1agrad.html#a3cbb5f05f4a177ad199188f3be030b3e',1,'stan::agrad::fdim(const double &a, const stan::agrad::var &b)'],['../namespacestan_1_1agrad.html#ace71dd32d041a962cb481242ecacab0b',1,'stan::agrad::fdim(const stan::agrad::var &a, const double &b)'],['../namespacestan_1_1math.html#a7d2db622c0f83134b7f3ebd1eec3c1d6',1,'stan::math::fdim()']]], + ['fdim_2ehpp',['fdim.hpp',['../math_2functions_2fdim_8hpp.html',1,'']]], + ['fdim_2ehpp',['fdim.hpp',['../agrad_2rev_2functions_2fdim_8hpp.html',1,'']]], + ['fdim_2ehpp',['fdim.hpp',['../agrad_2fwd_2functions_2fdim_8hpp.html',1,'']]], + ['fevals',['fevals',['../classstan_1_1optimization_1_1_model_adaptor.html#a77cd72166cb46c21e16c82f24dd84caf',1,'stan::optimization::ModelAdaptor']]], + ['fill',['fill',['../namespacestan_1_1math.html#a6d362e53d3d40b61e68fdd08dc5eb38b',1,'stan::math::fill(T &x, const S &y)'],['../namespacestan_1_1math.html#a73e791042ed648602eed1754679feff4',1,'stan::math::fill(Eigen::Matrix< T, R, C > &x, const S &y)'],['../namespacestan_1_1math.html#aa7f5d81c4d45f2407096def8810ffe00',1,'stan::math::fill(std::vector< T > &x, const S &y)']]], + ['fill_2ehpp',['fill.hpp',['../fill_8hpp.html',1,'']]], + ['find_5farg',['find_arg',['../classstan_1_1gm_1_1argument.html#af6212284d6fbf9ee71cdc0563d9bf891',1,'stan::gm::argument::find_arg()'],['../classstan_1_1gm_1_1categorical__argument.html#a24aa833497801c7a66c8ef8c599181ce',1,'stan::gm::categorical_argument::find_arg()'],['../classstan_1_1gm_1_1list__argument.html#a2428856fc920f6d7b4f50c1408bd9c9a',1,'stan::gm::list_argument::find_arg()'],['../classstan_1_1gm_1_1singleton__argument.html#a343a60ef80e0dd3eafe685141a6c3fa8',1,'stan::gm::singleton_argument::find_arg()']]], + ['finite_5fdiff_5fgrad',['finite_diff_grad',['../namespacestan_1_1model.html#a2660b5de2ccd8322d61f077d43289d18',1,'stan::model']]], + ['floor',['floor',['../namespacestan_1_1agrad.html#aa9046719ea83cad7cf7dace32ede78ce',1,'stan::agrad::floor(const var &a)'],['../namespacestan_1_1agrad.html#a266dcbe1451957c1fc2c32b2ae2870f3',1,'stan::agrad::floor(const fvar< T > &x)']]], + ['floor_2ehpp',['floor.hpp',['../fwd_2functions_2floor_8hpp.html',1,'']]], + ['floor_2ehpp',['floor.hpp',['../rev_2functions_2floor_8hpp.html',1,'']]], + ['fma',['fma',['../namespacestan_1_1agrad.html#a5f77bec24d717ec5f98b996f0be4cab4',1,'stan::agrad::fma(const fvar< T1 > &x1, const fvar< T2 > &x2, const fvar< T3 > &x3)'],['../namespacestan_1_1agrad.html#a86c32e534514f635bf641508b30804bb',1,'stan::agrad::fma(const T1 &x1, const fvar< T2 > &x2, const fvar< T3 > &x3)'],['../namespacestan_1_1agrad.html#ab0b96f19fcab78ceea15a6c0a95f8d7d',1,'stan::agrad::fma(const fvar< T1 > &x1, const T2 &x2, const fvar< T3 > &x3)'],['../namespacestan_1_1agrad.html#a663c1cc77abf57686013dbb666bf1ed0',1,'stan::agrad::fma(const fvar< T1 > &x1, const fvar< T2 > &x2, const T3 &x3)'],['../namespacestan_1_1agrad.html#a48956c680d59182a8b63d9e52f2ee2d8',1,'stan::agrad::fma(const T1 &x1, const T2 &x2, const fvar< T3 > &x3)'],['../namespacestan_1_1agrad.html#a2f1cefa8d0717c47703394f7724f86d8',1,'stan::agrad::fma(const fvar< T1 > &x1, const T2 &x2, const T3 &x3)'],['../namespacestan_1_1agrad.html#a1116b96b95098db023b128fa810a3828',1,'stan::agrad::fma(const T1 &x1, const fvar< T2 > &x2, const T3 &x3)'],['../namespacestan_1_1agrad.html#a236c6ba1684b8993ab0ca0d4319ebc15',1,'stan::agrad::fma(const stan::agrad::var &a, const stan::agrad::var &b, const stan::agrad::var &c)'],['../namespacestan_1_1agrad.html#a60d474fe443809433d909f153e326f63',1,'stan::agrad::fma(const stan::agrad::var &a, const stan::agrad::var &b, const double &c)'],['../namespacestan_1_1agrad.html#a4a8f1b59063836f79f91e61aa37e7f24',1,'stan::agrad::fma(const stan::agrad::var &a, const double &b, const stan::agrad::var &c)'],['../namespacestan_1_1agrad.html#afbff5da93a0ea4d23fc83faf70d866c0',1,'stan::agrad::fma(const stan::agrad::var &a, const double &b, const double &c)'],['../namespacestan_1_1agrad.html#a114089c3582069352ec3055927da54b3',1,'stan::agrad::fma(const double &a, const stan::agrad::var &b, const double &c)'],['../namespacestan_1_1agrad.html#a2858845a5ac98800b708c7c42ccaac35',1,'stan::agrad::fma(const double &a, const double &b, const stan::agrad::var &c)'],['../namespacestan_1_1agrad.html#aba5953fcb09dca0142b23409bd6c2766',1,'stan::agrad::fma(const double &a, const stan::agrad::var &b, const stan::agrad::var &c)'],['../namespacestan_1_1math.html#ad8ac3f1f4f177645d84a1d6480f70d96',1,'stan::math::fma()']]], + ['fma_2ehpp',['fma.hpp',['../agrad_2fwd_2functions_2fma_8hpp.html',1,'']]], + ['fma_2ehpp',['fma.hpp',['../math_2functions_2fma_8hpp.html',1,'']]], + ['fma_2ehpp',['fma.hpp',['../agrad_2rev_2functions_2fma_8hpp.html',1,'']]], + ['fmax',['fmax',['../namespacestan_1_1agrad.html#a2cf89150207e0d529ffd68744593a2bc',1,'stan::agrad::fmax(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a2cf4931ad43b37de539770207eb9e531',1,'stan::agrad::fmax(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a3f3435dc40e6c86fd4fd495357fbf6a9',1,'stan::agrad::fmax(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#a6bfbbbe6a55f984d587261a0d7213936',1,'stan::agrad::fmax(const stan::agrad::var &a, const stan::agrad::var &b)'],['../namespacestan_1_1agrad.html#ae46ecdd6d3cfa395ddfe12b425ae292a',1,'stan::agrad::fmax(const stan::agrad::var &a, const double &b)'],['../namespacestan_1_1agrad.html#adc9389efdd26ce3ba31890e70620026b',1,'stan::agrad::fmax(const double &a, const stan::agrad::var &b)']]], + ['fmax_2ehpp',['fmax.hpp',['../fwd_2functions_2fmax_8hpp.html',1,'']]], + ['fmax_2ehpp',['fmax.hpp',['../rev_2functions_2fmax_8hpp.html',1,'']]], + ['fmin',['fmin',['../namespacestan_1_1agrad.html#aac4bc7dd96a78ed7ba7a03d268ead9eb',1,'stan::agrad::fmin(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a855b36ac5868d163a4501b77359560ab',1,'stan::agrad::fmin(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a3f0537c9981801bd4c0f04d6580b9385',1,'stan::agrad::fmin(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#af9ad06d7c50e65542e3a83c1d7bf8bcc',1,'stan::agrad::fmin(const stan::agrad::var &a, const stan::agrad::var &b)'],['../namespacestan_1_1agrad.html#a46d5b1c42b386e876cadf5948cdf8256',1,'stan::agrad::fmin(const stan::agrad::var &a, const double &b)'],['../namespacestan_1_1agrad.html#a3afd698a7b861deeca2539c60ce89743',1,'stan::agrad::fmin(const double &a, const stan::agrad::var &b)']]], + ['fmin_2ehpp',['fmin.hpp',['../rev_2functions_2fmin_8hpp.html',1,'']]], + ['fmin_2ehpp',['fmin.hpp',['../fwd_2functions_2fmin_8hpp.html',1,'']]], + ['fmod',['fmod',['../namespacestan_1_1agrad.html#ad475182b7f8b4849bb596e2529838bb6',1,'stan::agrad::fmod(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#af96a5057c49216f1bda2be3a906b93f3',1,'stan::agrad::fmod(const var &a, const double &b)'],['../namespacestan_1_1agrad.html#adf82aceb2eca59a1fa422ea6dcfad435',1,'stan::agrad::fmod(const double &a, const var &b)'],['../namespacestan_1_1agrad.html#a4f6323825127dbf709facbed66f9e788',1,'stan::agrad::fmod(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#ad974df65ff640e773ea32c6061d732f9',1,'stan::agrad::fmod(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#a419533f3ed45a0fd5c77673e0db37915',1,'stan::agrad::fmod(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a48a712f23dfb6e5fe484fdda678bdff9',1,'stan::agrad::fmod(const var &a, const double b)'],['../namespacestan_1_1agrad.html#a478d71eb2e0aeb0df8fdba5c6933a2e6',1,'stan::agrad::fmod(const double a, const var &b)']]], + ['fmod_2ehpp',['fmod.hpp',['../rev_2functions_2fmod_8hpp.html',1,'']]], + ['fmod_2ehpp',['fmod.hpp',['../fwd_2functions_2fmod_8hpp.html',1,'']]], + ['for_5fstatement',['for_statement',['../structstan_1_1gm_1_1for__statement.html#a34c29e8875104ecab7481e308626666e',1,'stan::gm::for_statement::for_statement()'],['../structstan_1_1gm_1_1for__statement.html#acc3bc5c944315988c6b7724b170e77b3',1,'stan::gm::for_statement::for_statement(std::string &variable, range &range, statement &stmt)']]], + ['for_5fstatement',['for_statement',['../structstan_1_1gm_1_1for__statement.html',1,'stan::gm']]], + ['for_5fstatement_5fr',['for_statement_r',['../structstan_1_1gm_1_1statement__grammar.html#a5b68ed64ef9f0602474270b4de26c268',1,'stan::gm::statement_grammar']]], + ['forward_5fiterator_5ft',['forward_iterator_t',['../namespacestan_1_1gm.html#aa1c432dd6520c6f137b092953345f7d5',1,'stan::gm']]], + ['fpclassify',['fpclassify',['../namespaceboost_1_1math.html#a81d6724493d3ad55a65f18a3e780ddf7',1,'boost::math']]], + ['free_5fall',['free_all',['../classstan_1_1memory_1_1chunk__alloc.html#aa313a74350df2c4dabf4b61d63e4a2a9',1,'stan::memory::chunk_alloc::free_all()'],['../classstan_1_1memory_1_1stack__alloc.html#a02e126e827732287d7f4ede17316089a',1,'stan::memory::stack_alloc::free_all()']]], + ['free_5fmemory',['free_memory',['../classstan_1_1agrad_1_1vari.html#a7f23c079bd16b3183a46bb250ec231ac',1,'stan::agrad::vari::free_memory()'],['../namespacestan_1_1agrad.html#a97c8b13e0b24beeb9a67b880ac34b48c',1,'stan::agrad::free_memory()']]], + ['fun',['fun',['../structstan_1_1gm_1_1fun.html#ac61c1007763bc47ad4bbf7142de638fb',1,'stan::gm::fun::fun()'],['../structstan_1_1gm_1_1fun.html#ae988678efe42ba4871f47c7d30879feb',1,'stan::gm::fun::fun(std::string const &name, std::vector< expression > const &args)']]], + ['fun',['fun',['../structstan_1_1gm_1_1fun.html',1,'stan::gm']]], + ['fun_5fr',['fun_r',['../structstan_1_1gm_1_1term__grammar.html#a8b08e0616ee62cfba37e6db5e22fa63f',1,'stan::gm::term_grammar']]], + ['function_5fargs',['function_args',['../structstan_1_1gm_1_1generate__init__visgen.html#aa4efef315371d95e3fe70fd042da3705',1,'stan::gm::generate_init_visgen']]], + ['function_5fsignature_5ft',['function_signature_t',['../namespacestan_1_1gm.html#ab969833a2ffdf92a759238a5d9ba5859',1,'stan::gm']]], + ['function_5fsignatures',['function_signatures',['../classstan_1_1gm_1_1function__signatures.html',1,'stan::gm']]], + ['functions_2ehpp',['functions.hpp',['../agrad_2rev_2functions_8hpp.html',1,'']]], + ['functions_2ehpp',['functions.hpp',['../agrad_2fwd_2functions_8hpp.html',1,'']]], + ['functions_2ehpp',['functions.hpp',['../math_2functions_8hpp.html',1,'']]], + ['fvar',['fvar',['../structstan_1_1agrad_1_1fvar.html',1,'stan::agrad']]], + ['fvar',['fvar',['../structstan_1_1agrad_1_1fvar.html#a289970c8de6526ad9e5e8b323f26c7b5',1,'stan::agrad::fvar::fvar(const TV &val, const TD &deriv)'],['../structstan_1_1agrad_1_1fvar.html#a8aa84b5da53f24362d9b04f6e248d3d9',1,'stan::agrad::fvar::fvar(const TV &val)'],['../structstan_1_1agrad_1_1fvar.html#a18f9e0f72bd845ef6445ca616acbffcd',1,'stan::agrad::fvar::fvar()']]], + ['fvar_2ehpp',['fvar.hpp',['../fvar_8hpp.html',1,'']]], + ['fwd_2ehpp',['fwd.hpp',['../fwd_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/all_67.html b/doc/api/html/search/all_67.html new file mode 100644 index 00000000000..41a459ae7d0 --- /dev/null +++ b/doc/api/html/search/all_67.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/all_67.js b/doc/api/html/search/all_67.js new file mode 100644 index 00000000000..ea5a83325d1 --- /dev/null +++ b/doc/api/html/search/all_67.js @@ -0,0 +1,158 @@ +var searchData= +[ + ['g',['g',['../classstan_1_1mcmc_1_1ps__point.html#a651cacb5446e2c6c9931ec23ffe547d3',1,'stan::mcmc::ps_point']]], + ['gamma_2ehpp',['gamma.hpp',['../gamma_8hpp.html',1,'']]], + ['gamma_5fccdf_5flog',['gamma_ccdf_log',['../namespacestan_1_1prob.html#ad7ee96f7433a8a2213f6c00d053fcc98',1,'stan::prob']]], + ['gamma_5fcdf',['gamma_cdf',['../namespacestan_1_1prob.html#a0056f042d18ab321812adae932f7788e',1,'stan::prob']]], + ['gamma_5fcdf_5flog',['gamma_cdf_log',['../namespacestan_1_1prob.html#a74f0bab3925e33a3f4d41ad844172b27',1,'stan::prob']]], + ['gamma_5flog',['gamma_log',['../namespacestan_1_1prob.html#a79b5cdb98cde395af01ceeb3e643788b',1,'stan::prob::gamma_log(const T_y &y, const T_shape &alpha, const T_inv_scale &beta)'],['../namespacestan_1_1prob.html#a762b08e1b594764a002a4503042a1782',1,'stan::prob::gamma_log(const T_y &y, const T_shape &alpha, const T_inv_scale &beta)']]], + ['gamma_5fp',['gamma_p',['../namespacestan_1_1agrad.html#af866ffae5b244d1e6e93bd7ed85452c9',1,'stan::agrad::gamma_p(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a8448454064a4337b6358d60e2d6820ff',1,'stan::agrad::gamma_p(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#a0b6a1689e89d7de041e7bc4e57bcd1c7',1,'stan::agrad::gamma_p(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a998c50e583b44604ded2c213ed565b72',1,'stan::agrad::gamma_p(const stan::agrad::var &a, const stan::agrad::var &b)'],['../namespacestan_1_1agrad.html#a27226e41e865a880d1d5628d7b7aeba5',1,'stan::agrad::gamma_p(const stan::agrad::var &a, const double &b)'],['../namespacestan_1_1agrad.html#a1be9111ad018e40e8388d628e527255d',1,'stan::agrad::gamma_p(const double &a, const stan::agrad::var &b)'],['../namespacestan_1_1math.html#aed411d626d4ae01a76584c454a83673f',1,'stan::math::gamma_p()']]], + ['gamma_5fp_2ehpp',['gamma_p.hpp',['../agrad_2rev_2functions_2gamma__p_8hpp.html',1,'']]], + ['gamma_5fp_2ehpp',['gamma_p.hpp',['../math_2functions_2gamma__p_8hpp.html',1,'']]], + ['gamma_5fp_2ehpp',['gamma_p.hpp',['../agrad_2fwd_2functions_2gamma__p_8hpp.html',1,'']]], + ['gamma_5fq',['gamma_q',['../namespacestan_1_1agrad.html#a11135a2ea60dac802a560b6d650df60f',1,'stan::agrad::gamma_q(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a032ac91edd3d7ca00478b937353fd63f',1,'stan::agrad::gamma_q(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#ad8bb1c38eb8ba69d50c8ccb3452719e3',1,'stan::agrad::gamma_q(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#abbfd6400f96010759da0a7f20a0e6991',1,'stan::agrad::gamma_q(const stan::agrad::var &a, const stan::agrad::var &b)'],['../namespacestan_1_1agrad.html#af9f89bf49133aa1ef45e6b3257b84c63',1,'stan::agrad::gamma_q(const stan::agrad::var &a, const double &b)'],['../namespacestan_1_1agrad.html#a5df71efbadd34735e269ce904160ceb9',1,'stan::agrad::gamma_q(const double &a, const stan::agrad::var &b)'],['../namespacestan_1_1math.html#a0830ba049b81bc98ea9fbcf1eb7b4bd6',1,'stan::math::gamma_q()']]], + ['gamma_5fq_2ehpp',['gamma_q.hpp',['../agrad_2fwd_2functions_2gamma__q_8hpp.html',1,'']]], + ['gamma_5fq_2ehpp',['gamma_q.hpp',['../agrad_2rev_2functions_2gamma__q_8hpp.html',1,'']]], + ['gamma_5fq_2ehpp',['gamma_q.hpp',['../math_2functions_2gamma__q_8hpp.html',1,'']]], + ['gamma_5frng',['gamma_rng',['../namespacestan_1_1prob.html#ae48a407db43161a34812a8ed250de25c',1,'stan::prob']]], + ['gaussian_5fdlm_5fobs_2ehpp',['gaussian_dlm_obs.hpp',['../gaussian__dlm__obs_8hpp.html',1,'']]], + ['gaussian_5fdlm_5fobs_5flog',['gaussian_dlm_obs_log',['../namespacestan_1_1prob.html#a2788e0ec29af261204d5a071a9ac6abb',1,'stan::prob::gaussian_dlm_obs_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_F, Eigen::Dynamic, Eigen::Dynamic > &F, const Eigen::Matrix< T_G, Eigen::Dynamic, Eigen::Dynamic > &G, const Eigen::Matrix< T_V, Eigen::Dynamic, Eigen::Dynamic > &V, const Eigen::Matrix< T_W, Eigen::Dynamic, Eigen::Dynamic > &W, const Eigen::Matrix< T_m0, Eigen::Dynamic, 1 > &m0, const Eigen::Matrix< T_C0, Eigen::Dynamic, Eigen::Dynamic > &C0)'],['../namespacestan_1_1prob.html#abe03afe63c5a16f0900578622143fe11',1,'stan::prob::gaussian_dlm_obs_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_F, Eigen::Dynamic, Eigen::Dynamic > &F, const Eigen::Matrix< T_G, Eigen::Dynamic, Eigen::Dynamic > &G, const Eigen::Matrix< T_V, Eigen::Dynamic, Eigen::Dynamic > &V, const Eigen::Matrix< T_W, Eigen::Dynamic, Eigen::Dynamic > &W, const Eigen::Matrix< T_m0, Eigen::Dynamic, 1 > &m0, const Eigen::Matrix< T_C0, Eigen::Dynamic, Eigen::Dynamic > &C0)'],['../namespacestan_1_1prob.html#a7205d695b5a1a8358299908ab943c812',1,'stan::prob::gaussian_dlm_obs_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_F, Eigen::Dynamic, Eigen::Dynamic > &F, const Eigen::Matrix< T_G, Eigen::Dynamic, Eigen::Dynamic > &G, const Eigen::Matrix< T_V, Eigen::Dynamic, 1 > &V, const Eigen::Matrix< T_W, Eigen::Dynamic, Eigen::Dynamic > &W, const Eigen::Matrix< T_m0, Eigen::Dynamic, 1 > &m0, const Eigen::Matrix< T_C0, Eigen::Dynamic, Eigen::Dynamic > &C0)'],['../namespacestan_1_1prob.html#ab2f8f2486dabf18bc892a59326aabba6',1,'stan::prob::gaussian_dlm_obs_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_F, Eigen::Dynamic, Eigen::Dynamic > &F, const Eigen::Matrix< T_G, Eigen::Dynamic, Eigen::Dynamic > &G, const Eigen::Matrix< T_V, Eigen::Dynamic, 1 > &V, const Eigen::Matrix< T_W, Eigen::Dynamic, Eigen::Dynamic > &W, const Eigen::Matrix< T_m0, Eigen::Dynamic, 1 > &m0, const Eigen::Matrix< T_C0, Eigen::Dynamic, Eigen::Dynamic > &C0)']]], + ['general_5fmatrix_5fmatrix_5fproduct_3c_20index_2c_20stan_3a_3aagrad_3a_3avar_2c_20lhsstorageorder_2c_20conjugatelhs_2c_20stan_3a_3aagrad_3a_3avar_2c_20rhsstorageorder_2c_20conjugaterhs_2c_20colmajor_20_3e',['general_matrix_matrix_product< Index, stan::agrad::var, LhsStorageOrder, ConjugateLhs, stan::agrad::var, RhsStorageOrder, ConjugateRhs, ColMajor >',['../struct_eigen_1_1internal_1_1general__matrix__matrix__product_3_01_index_00_01stan_1_1agrad_1_1va9b485de9571b6e46d7a64aff43a6d9d3.html',1,'Eigen::internal']]], + ['general_5fmatrix_5fvector_5fproduct_3c_20index_2c_20stan_3a_3aagrad_3a_3avar_2c_20colmajor_2c_20conjugatelhs_2c_20stan_3a_3aagrad_3a_3avar_2c_20conjugaterhs_20_3e',['general_matrix_vector_product< Index, stan::agrad::var, ColMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >',['../struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1va44da5f98e1caea9523bacbd5bdc025fe.html',1,'Eigen::internal']]], + ['general_5fmatrix_5fvector_5fproduct_3c_20index_2c_20stan_3a_3aagrad_3a_3avar_2c_20rowmajor_2c_20conjugatelhs_2c_20stan_3a_3aagrad_3a_3avar_2c_20conjugaterhs_20_3e',['general_matrix_vector_product< Index, stan::agrad::var, RowMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >',['../struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1vacd54cabc78c49ca719650381b68b105e.html',1,'Eigen::internal']]], + ['generate_5fbegin_5ffor_5fdims',['generate_begin_for_dims',['../structstan_1_1gm_1_1validate__var__decl__visgen.html#aff830ed631f54eff36b9a643d14d0223',1,'stan::gm::validate_var_decl_visgen']]], + ['generate_5fbuffer_5floop',['generate_buffer_loop',['../structstan_1_1gm_1_1generate__init__visgen.html#a05aa9ddaf49b4e575bf8c8ddd1c9caa8',1,'stan::gm::generate_init_visgen']]], + ['generate_5fcheck_5fdouble',['generate_check_double',['../structstan_1_1gm_1_1generate__init__visgen.html#adb02e4312d893d26819ea0535e72a395',1,'stan::gm::generate_init_visgen']]], + ['generate_5fcheck_5fint',['generate_check_int',['../structstan_1_1gm_1_1generate__init__visgen.html#ad97c800e8b97eb5e99e15be9e731856e',1,'stan::gm::generate_init_visgen']]], + ['generate_5fclass_5fdecl',['generate_class_decl',['../namespacestan_1_1gm.html#af08d462ee1f0e163d614e9ed03fe53c0',1,'stan::gm']]], + ['generate_5fcomment',['generate_comment',['../namespacestan_1_1gm.html#abba632c440fa0d045a469d12a7cef474',1,'stan::gm']]], + ['generate_5fconstrained_5fparam_5fnames_5fmethod',['generate_constrained_param_names_method',['../namespacestan_1_1gm.html#a5064d8f1632c7557de53ab9af11342f3',1,'stan::gm']]], + ['generate_5fconstructor',['generate_constructor',['../namespacestan_1_1gm.html#aa582396b750dabd6768f4adb30508349',1,'stan::gm']]], + ['generate_5fcpp',['generate_cpp',['../namespacestan_1_1gm.html#a668b578a61c97daacf978986469d1af1',1,'stan::gm']]], + ['generate_5fcsv_5fheader_5farray',['generate_csv_header_array',['../structstan_1_1gm_1_1write__csv__header__visgen.html#a8b2bffaeddce0015c69d6a300ce624de',1,'stan::gm::write_csv_header_visgen']]], + ['generate_5fdeclaration',['generate_declaration',['../structstan_1_1gm_1_1generate__init__visgen.html#a1d115ad0f68566f36cb724b45a67c6a0',1,'stan::gm::generate_init_visgen']]], + ['generate_5fdestructor',['generate_destructor',['../namespacestan_1_1gm.html#a2547842ef250f715e7121eab59f2263c',1,'stan::gm']]], + ['generate_5fdims_5farray',['generate_dims_array',['../structstan_1_1gm_1_1write__dims__visgen.html#ab1da381e42f08f05b968b62ff8ed8df0',1,'stan::gm::write_dims_visgen']]], + ['generate_5fdims_5floop_5ffwd',['generate_dims_loop_fwd',['../structstan_1_1gm_1_1generate__init__visgen.html#a793258abd85f441fd2ca1a15d06e81a3',1,'stan::gm::generate_init_visgen']]], + ['generate_5fdims_5fmethod',['generate_dims_method',['../namespacestan_1_1gm.html#ad25e6e8b2a6244b38ce779887bb4c17f',1,'stan::gm']]], + ['generate_5fend_5fclass_5fdecl',['generate_end_class_decl',['../namespacestan_1_1gm.html#adc6eed04035b3dd32a5e04d227d4cf68',1,'stan::gm']]], + ['generate_5fend_5ffor_5fdims',['generate_end_for_dims',['../structstan_1_1gm_1_1validate__var__decl__visgen.html#a84366f1b6aca2e4e6ce0dffbb65fd523',1,'stan::gm::validate_var_decl_visgen']]], + ['generate_5fend_5fnamespace',['generate_end_namespace',['../namespacestan_1_1gm.html#a9771868cf777556e7ea3dfabbfcccecb',1,'stan::gm']]], + ['generate_5fexpression',['generate_expression',['../namespacestan_1_1gm.html#a6d7cbee2be927cee628328a4e879294a',1,'stan::gm']]], + ['generate_5finclude',['generate_include',['../namespacestan_1_1gm.html#ab12d33faf3ee33c50995679a53496706',1,'stan::gm']]], + ['generate_5fincludes',['generate_includes',['../namespacestan_1_1gm.html#a6a9d6cf24f2051d0804f641525a36f8a',1,'stan::gm']]], + ['generate_5fincrement',['generate_increment',['../structstan_1_1gm_1_1set__param__ranges__visgen.html#a03bf3d67902d7addab06e8348fcad034',1,'stan::gm::set_param_ranges_visgen::generate_increment(std::vector< expression > dims) const '],['../structstan_1_1gm_1_1set__param__ranges__visgen.html#a643b15f7e1aebb50457c29795d98dbba',1,'stan::gm::set_param_ranges_visgen::generate_increment(expression K, std::vector< expression > dims) const '],['../structstan_1_1gm_1_1set__param__ranges__visgen.html#a02f19b449b05e3cc0c265dec2310bbcb',1,'stan::gm::set_param_ranges_visgen::generate_increment(expression M, expression N, std::vector< expression > dims) const ']]], + ['generate_5fincrement_5fi',['generate_increment_i',['../structstan_1_1gm_1_1set__param__ranges__visgen.html#a80cc6bdadbd3cfb04fb75d3674d3d74a',1,'stan::gm::set_param_ranges_visgen']]], + ['generate_5findent',['generate_indent',['../namespacestan_1_1gm.html#a5dfdee531df2c1a3fa39c3c5d9ee5edd',1,'stan::gm']]], + ['generate_5findent_5fnum_5fdims',['generate_indent_num_dims',['../structstan_1_1gm_1_1generate__init__visgen.html#a39fe228dfb30354fddb0bc9c3076fe78',1,'stan::gm::generate_init_visgen']]], + ['generate_5findexed_5fexpr',['generate_indexed_expr',['../namespacestan_1_1gm.html#acd8d56cc6cd4afabfb2b65f2e721be01',1,'stan::gm']]], + ['generate_5finit',['generate_init',['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#a90bfb805ab0dc6b9612a05254d86dbe5',1,'stan::gm::generate_local_var_init_nan_visgen']]], + ['generate_5finit_5fargs',['generate_init_args',['../structstan_1_1gm_1_1local__var__decl__visgen.html#ac57a75ce0bdc9749ed24792421119511',1,'stan::gm::local_var_decl_visgen']]], + ['generate_5finit_5fmethod',['generate_init_method',['../namespacestan_1_1gm.html#a208a651630210246d1cff43ebd3e7d0e',1,'stan::gm']]], + ['generate_5finit_5fvars',['generate_init_vars',['../namespacestan_1_1gm.html#a5e4c218a7d9e607732925c5a266a8f79',1,'stan::gm']]], + ['generate_5finit_5fvars_5fvisgen',['generate_init_vars_visgen',['../structstan_1_1gm_1_1generate__init__vars__visgen.html',1,'stan::gm']]], + ['generate_5finit_5fvars_5fvisgen',['generate_init_vars_visgen',['../structstan_1_1gm_1_1generate__init__vars__visgen.html#a74161c591ed31e81372e5adbf9ae48d3',1,'stan::gm::generate_init_vars_visgen']]], + ['generate_5finit_5fvisgen',['generate_init_visgen',['../structstan_1_1gm_1_1generate__init__visgen.html#a245dc3d8b132021896c5f17d90901dc4',1,'stan::gm::generate_init_visgen']]], + ['generate_5finit_5fvisgen',['generate_init_visgen',['../structstan_1_1gm_1_1generate__init__visgen.html',1,'stan::gm']]], + ['generate_5finitialization',['generate_initialization',['../namespacestan_1_1gm.html#a2a09040ccbbc3628b80d4b17278a9d02',1,'stan::gm']]], + ['generate_5finitialize_5farray',['generate_initialize_array',['../structstan_1_1gm_1_1init__local__var__visgen.html#a5779f760dc12ada7971f2d8c009d45f3',1,'stan::gm::init_local_var_visgen::generate_initialize_array()'],['../structstan_1_1gm_1_1write__csv__visgen.html#a2a171b9ce86cbc005df39f73a0914db3',1,'stan::gm::write_csv_visgen::generate_initialize_array()'],['../structstan_1_1gm_1_1write__array__visgen.html#a58d0d5f31f9a489b4cc23f5256f0b56f',1,'stan::gm::write_array_visgen::generate_initialize_array()']]], + ['generate_5finitialize_5farray_5fbounded',['generate_initialize_array_bounded',['../structstan_1_1gm_1_1init__local__var__visgen.html#a7efee35863c753717d4831e51d2f2419',1,'stan::gm::init_local_var_visgen::generate_initialize_array_bounded()'],['../structstan_1_1gm_1_1write__csv__visgen.html#adfabff813b3be4aa0d56dfe894ab1da4',1,'stan::gm::write_csv_visgen::generate_initialize_array_bounded()'],['../structstan_1_1gm_1_1write__array__visgen.html#a149aa727af8bfdd53d2e494eb75c9201',1,'stan::gm::write_array_visgen::generate_initialize_array_bounded()']]], + ['generate_5finitializer',['generate_initializer',['../namespacestan_1_1gm.html#ac3b48b7ab230ddd3d882103245827857',1,'stan::gm']]], + ['generate_5flocal_5fvar_5fdecls',['generate_local_var_decls',['../namespacestan_1_1gm.html#a258ce4643ff39bb93d455f8ae8698a8e',1,'stan::gm']]], + ['generate_5flocal_5fvar_5finit_5fnan',['generate_local_var_init_nan',['../namespacestan_1_1gm.html#a6b6842504d267f2ec759ad7b25e7fac3',1,'stan::gm']]], + ['generate_5flocal_5fvar_5finit_5fnan_5fvisgen',['generate_local_var_init_nan_visgen',['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#a49fb5d91eaa967066d5f5c39a64fa972',1,'stan::gm::generate_local_var_init_nan_visgen']]], + ['generate_5flocal_5fvar_5finit_5fnan_5fvisgen',['generate_local_var_init_nan_visgen',['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html',1,'stan::gm']]], + ['generate_5flocal_5fvar_5finits',['generate_local_var_inits',['../namespacestan_1_1gm.html#a890d6d9cd0b21a64327ccf76a9a7e824',1,'stan::gm']]], + ['generate_5flog_5fprob',['generate_log_prob',['../namespacestan_1_1gm.html#a4d93a678fb6ead7a8554de1758f36034',1,'stan::gm']]], + ['generate_5floop_5fvar',['generate_loop_var',['../structstan_1_1gm_1_1validate__var__decl__visgen.html#ad480023da77dc0a07bd592377dde6479',1,'stan::gm::validate_var_decl_visgen']]], + ['generate_5fmain',['generate_main',['../namespacestan_1_1gm.html#a425cf99f39ca9123446a5192eeee83e0',1,'stan::gm']]], + ['generate_5fmember_5fvar_5fdecls',['generate_member_var_decls',['../namespacestan_1_1gm.html#a63d43e75db4c7e7ff2dda2d1036df363',1,'stan::gm']]], + ['generate_5fmember_5fvar_5finits',['generate_member_var_inits',['../namespacestan_1_1gm.html#adc65399d7375f831d8d4d806b62b6293',1,'stan::gm']]], + ['generate_5fmodel_5fname_5fmethod',['generate_model_name_method',['../namespacestan_1_1gm.html#a06761a1392734570a22e5a492141bce8',1,'stan::gm']]], + ['generate_5fname_5fdims',['generate_name_dims',['../structstan_1_1gm_1_1generate__init__visgen.html#aeb5f4afc816218d11e8e76222d766a08',1,'stan::gm::generate_init_visgen']]], + ['generate_5fparam_5fnames',['generate_param_names',['../structstan_1_1gm_1_1write__param__names__visgen.html#a2532b08b83077c52daedb50fc6864f44',1,'stan::gm::write_param_names_visgen']]], + ['generate_5fparam_5fnames_5farray',['generate_param_names_array',['../structstan_1_1gm_1_1constrained__param__names__visgen.html#a797d0bdd948219ece7f55b13d9ab5bff',1,'stan::gm::constrained_param_names_visgen::generate_param_names_array()'],['../structstan_1_1gm_1_1unconstrained__param__names__visgen.html#aa147cbae3df22ef747f281ccb73e8f4f',1,'stan::gm::unconstrained_param_names_visgen::generate_param_names_array()']]], + ['generate_5fparam_5fnames_5fmethod',['generate_param_names_method',['../namespacestan_1_1gm.html#a4c248f99b9df350026ff05c604181358',1,'stan::gm']]], + ['generate_5fprintable',['generate_printable',['../namespacestan_1_1gm.html#ae27bbd9b3b5dbc0f93bbcd9f198a46eb',1,'stan::gm']]], + ['generate_5fprivate_5fdecl',['generate_private_decl',['../namespacestan_1_1gm.html#a8c0b83999d50ab15f1c8503f33a3d47c',1,'stan::gm']]], + ['generate_5fpublic_5fdecl',['generate_public_decl',['../namespacestan_1_1gm.html#a30e9216cd9f5d025bcb3dde6aa0c86b0',1,'stan::gm']]], + ['generate_5fset_5fparam_5franges',['generate_set_param_ranges',['../namespacestan_1_1gm.html#a7ce48f574b608d4ecebac5dc7c3fe21e',1,'stan::gm']]], + ['generate_5fstart_5fnamespace',['generate_start_namespace',['../namespacestan_1_1gm.html#a297a49a54728e0866002eeb4350f46dd',1,'stan::gm']]], + ['generate_5fstatement',['generate_statement',['../namespacestan_1_1gm.html#ad06f7d19c1a004ec456362bd32369cc9',1,'stan::gm']]], + ['generate_5fstatements',['generate_statements',['../namespacestan_1_1gm.html#a09382dd26edd6d5095555b7b1dea2c6d',1,'stan::gm']]], + ['generate_5ftype',['generate_type',['../structstan_1_1gm_1_1local__var__decl__visgen.html#a9eac0e6e7549ecf508f56097b8beaaa5',1,'stan::gm::local_var_decl_visgen::generate_type()'],['../namespacestan_1_1gm.html#a513a251d0b3d2e80bc0b9e32ecfeea0d',1,'stan::gm::generate_type()']]], + ['generate_5ftypedef',['generate_typedef',['../namespacestan_1_1gm.html#a6150f8826fdd1742c1287552966cb6d0',1,'stan::gm']]], + ['generate_5ftypedefs',['generate_typedefs',['../namespacestan_1_1gm.html#a1515682780f226a7001d930fd2c1e1d0',1,'stan::gm']]], + ['generate_5funconstrained_5fparam_5fnames_5fmethod',['generate_unconstrained_param_names_method',['../namespacestan_1_1gm.html#a7caf37b3f443d37d400f9f647a5d4f7b',1,'stan::gm']]], + ['generate_5fusing',['generate_using',['../namespacestan_1_1gm.html#a8669bcb4fa524c442de23cedeb7aaa23',1,'stan::gm']]], + ['generate_5fusing_5fnamespace',['generate_using_namespace',['../namespacestan_1_1gm.html#aab6c7437ec473e5dbe083f86b1b059ae',1,'stan::gm']]], + ['generate_5fusings',['generate_usings',['../namespacestan_1_1gm.html#aa985aaef054c7f1af4a9628ef6a9155d',1,'stan::gm']]], + ['generate_5fvalidate_5fcontext_5fsize',['generate_validate_context_size',['../namespacestan_1_1gm.html#a33b21b6ece1a626d859d7d0e16bc0914',1,'stan::gm']]], + ['generate_5fvalidate_5fpositive',['generate_validate_positive',['../namespacestan_1_1gm.html#ae5e451a20922d72237b17635a04629c6',1,'stan::gm']]], + ['generate_5fvalidate_5ftransformed_5fparams',['generate_validate_transformed_params',['../namespacestan_1_1gm.html#ae40fee02e525b4599929a3898b14493a',1,'stan::gm']]], + ['generate_5fvalidate_5fvar_5fdecl',['generate_validate_var_decl',['../namespacestan_1_1gm.html#a52bae0dc2622d9a571205c83441d1bce',1,'stan::gm']]], + ['generate_5fvalidate_5fvar_5fdecls',['generate_validate_var_decls',['../namespacestan_1_1gm.html#a43655ffe4072e69181e20c6e5e3254cf',1,'stan::gm']]], + ['generate_5fvar_5fresizing',['generate_var_resizing',['../namespacestan_1_1gm.html#a3d65cdc4d78792bed25979830e67b9eb',1,'stan::gm']]], + ['generate_5fversion_5fcomment',['generate_version_comment',['../namespacestan_1_1gm.html#ad46a7bc5909963f3af53bb69c764c415',1,'stan::gm']]], + ['generate_5fvoid_5fstatement',['generate_void_statement',['../structstan_1_1gm_1_1local__var__decl__visgen.html#aa2abf6410868390e087ab93c583a5eaf',1,'stan::gm::local_var_decl_visgen::generate_void_statement()'],['../namespacestan_1_1gm.html#aa1deb42499e1aeaf64a3f66f7e08220e',1,'stan::gm::generate_void_statement()']]], + ['generate_5fwrite_5farray_5fmethod',['generate_write_array_method',['../namespacestan_1_1gm.html#a56f6bed9b4ff736ba8282d9cb81ff0c2',1,'stan::gm']]], + ['generate_5fwrite_5fcsv_5fheader_5fmethod',['generate_write_csv_header_method',['../namespacestan_1_1gm.html#a175fe5ebc2de7986e91d335a0f973642',1,'stan::gm']]], + ['generate_5fwrite_5fcsv_5fmethod',['generate_write_csv_method',['../namespacestan_1_1gm.html#a8576715fcf1c68be750ae6f9b5928923',1,'stan::gm']]], + ['generate_5fwrite_5floop',['generate_write_loop',['../structstan_1_1gm_1_1generate__init__visgen.html#a6a491ca19f67492859f69414e65c2859',1,'stan::gm::generate_init_visgen']]], + ['generated_5fdecl_5f',['generated_decl_',['../structstan_1_1gm_1_1program.html#a8317c188381639e8751e651c0cabccb3',1,'stan::gm::program']]], + ['generated_5fvar_5fdecls_5fr',['generated_var_decls_r',['../structstan_1_1gm_1_1program__grammar.html#a3cc3698f28d843ac60b46504c2171243',1,'stan::gm::program_grammar']]], + ['generator_2ehpp',['generator.hpp',['../generator_8hpp.html',1,'']]], + ['get',['get',['../structstan_1_1gm_1_1variable__map.html#af16b9b2424cf92cd3804908986d53ff1',1,'stan::gm::variable_map::get()'],['../namespacestan.html#a2e926e5518c0c2f289f79d23010815d3',1,'stan::get(const T &x, size_t n)'],['../namespacestan.html#a431bd201f09a215cccb16cda10a1e840',1,'stan::get(const std::vector< T > &x, size_t n)'],['../namespacestan.html#aa0b8055d979ee18e43048b99eccb5640',1,'stan::get(const Eigen::Matrix< T, R, C > &m, size_t n)']]], + ['get_5fbase1',['get_base1',['../namespacestan_1_1math.html#a7535c86e2c9ee9d5391a8cc63187317e',1,'stan::math::get_base1(const std::vector< T > &x, size_t i, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#aca7c84b936da0d3422507927cf9a68cc',1,'stan::math::get_base1(const std::vector< std::vector< T > > &x, size_t i1, size_t i2, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#a714e39ba9fcbbd90c787a51d511c9af1',1,'stan::math::get_base1(const std::vector< std::vector< std::vector< T > > > &x, size_t i1, size_t i2, size_t i3, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#aa23b355397df347249da513307fd6667',1,'stan::math::get_base1(const std::vector< std::vector< std::vector< std::vector< T > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#a25c1fac0445beea55c521c94f360e13e',1,'stan::math::get_base1(const std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, size_t i5, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#a20a82151947fc8816c5ce5b7bc6d8abd',1,'stan::math::get_base1(const std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, size_t i5, size_t i6, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#a6fb72caff19c8ce19dc6e3c25c79f7b8',1,'stan::math::get_base1(const std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, size_t i5, size_t i6, size_t i7, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#accc97dd76490d575638ebb22da233a53',1,'stan::math::get_base1(const std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, size_t i5, size_t i6, size_t i7, size_t i8, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#ae72208605f731144cab862feecb456a2',1,'stan::math::get_base1(const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &x, size_t m, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#a51091bb67549e42c241f4e08e7d291d6',1,'stan::math::get_base1(const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &x, size_t m, size_t n, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#ab0dbeed50ff3f8630ea3cd54f9ecb804',1,'stan::math::get_base1(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, size_t m, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#abf9dcd5236495d3f581b31dd05b9a227',1,'stan::math::get_base1(const Eigen::Matrix< T, 1, Eigen::Dynamic > &x, size_t n, const char *error_msg, size_t idx)']]], + ['get_5fbase1_2ehpp',['get_base1.hpp',['../get__base1_8hpp.html',1,'']]], + ['get_5fbase1_5flhs',['get_base1_lhs',['../namespacestan_1_1math.html#ac54b1427fd9d0765f0200dc9caa830f9',1,'stan::math::get_base1_lhs(std::vector< T > &x, size_t i, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#a4d5711f99869d05a6263218f3256e582',1,'stan::math::get_base1_lhs(std::vector< std::vector< T > > &x, size_t i1, size_t i2, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#a37f3ceaa6197904ef662f1edc8245e1a',1,'stan::math::get_base1_lhs(std::vector< std::vector< std::vector< T > > > &x, size_t i1, size_t i2, size_t i3, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#a3132eb36eaf861cfbd119b38e0a85a15',1,'stan::math::get_base1_lhs(std::vector< std::vector< std::vector< std::vector< T > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#afbcc061003aabcaf675f4415adc80c0a',1,'stan::math::get_base1_lhs(std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, size_t i5, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#a1958245532761be08be7ac9bc781f3a7',1,'stan::math::get_base1_lhs(std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, size_t i5, size_t i6, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#aedc7fc712ebe439bec1892c8f69447cd',1,'stan::math::get_base1_lhs(std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, size_t i5, size_t i6, size_t i7, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#a64467731d9abfaf97ea8d541d528142c',1,'stan::math::get_base1_lhs(std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, size_t i5, size_t i6, size_t i7, size_t i8, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#abbdd7246170c1c0cade6c7be73f436e0',1,'stan::math::get_base1_lhs(Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &x, size_t m, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#af8cb7e6e670cddcdf5527ec92fa3ff37',1,'stan::math::get_base1_lhs(Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &x, size_t m, size_t n, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#adffeab694f7588c92dc97b6736e5be7b',1,'stan::math::get_base1_lhs(Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, size_t m, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#a6133d90708e16760b6394c6ca6a305ff',1,'stan::math::get_base1_lhs(Eigen::Matrix< T, 1, Eigen::Dynamic > &x, size_t n, const char *error_msg, size_t idx)']]], + ['get_5fbase1_5flhs_2ehpp',['get_base1_lhs.hpp',['../get__base1__lhs_8hpp.html',1,'']]], + ['get_5fbase_5ftype',['get_base_type',['../structstan_1_1gm_1_1variable__map.html#aca8dd3f11c916e9f3e960da5a54fabcd',1,'stan::gm::variable_map']]], + ['get_5fcode_5fstring',['get_code_string',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#adc021871519f45628bdd50446e3d4075',1,'stan::optimization::BFGSMinimizer']]], + ['get_5fcovar_5fadaptation',['get_covar_adaptation',['../classstan_1_1mcmc_1_1stepsize__covar__adapter.html#a78b53fec4bef5a7ba2e7531f416ba3a1',1,'stan::mcmc::stepsize_covar_adapter']]], + ['get_5fcurrent_5fstepsize',['get_current_stepsize',['../classstan_1_1mcmc_1_1base__hmc.html#a6e9333e00268e9ea5e0145a17bfbe4d2',1,'stan::mcmc::base_hmc']]], + ['get_5fdelta',['get_delta',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#a9b009709850567a0c8859c6184b79099',1,'stan::mcmc::stepsize_adaptation']]], + ['get_5fgamma',['get_gamma',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#af73d1fae6249bec73f9a1b5d9993ff2f',1,'stan::mcmc::stepsize_adaptation']]], + ['get_5fkappa',['get_kappa',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#aef3ef49e43ab17cd2d8c10a101603971',1,'stan::mcmc::stepsize_adaptation']]], + ['get_5fl',['get_L',['../classstan_1_1mcmc_1_1base__static__hmc.html#a0f7bee31ab516375f70c8b1857ecc095',1,'stan::mcmc::base_static_hmc']]], + ['get_5fmax_5fdelta',['get_max_delta',['../classstan_1_1mcmc_1_1base__nuts.html#a29db7ce203e322ba14d06fe99d05806e',1,'stan::mcmc::base_nuts']]], + ['get_5fmax_5fdepth',['get_max_depth',['../classstan_1_1mcmc_1_1base__nuts.html#aef3fb41adbe18bbd10f31be06075d0f8',1,'stan::mcmc::base_nuts']]], + ['get_5fmu',['get_mu',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#ad39004ce73f47a9a08ad523333a142dc',1,'stan::mcmc::stepsize_adaptation']]], + ['get_5fnominal_5fstepsize',['get_nominal_stepsize',['../classstan_1_1mcmc_1_1base__hmc.html#a33aa7f0e7d733ca915e5bb4b77117fd1',1,'stan::mcmc::base_hmc']]], + ['get_5fnum_5fdims',['get_num_dims',['../structstan_1_1gm_1_1variable__map.html#a0aacb56aae39f1ee43126951336876ee',1,'stan::gm::variable_map']]], + ['get_5forigin',['get_origin',['../structstan_1_1gm_1_1variable__map.html#a489c5362720bcea3520b36b8fbf139c3',1,'stan::gm::variable_map']]], + ['get_5fparam_5fnames',['get_param_names',['../classstan_1_1mcmc_1_1ps__point.html#a3e1b059004a82c80200402ae840df17c',1,'stan::mcmc::ps_point']]], + ['get_5fparams',['get_params',['../classstan_1_1mcmc_1_1ps__point.html#a90335d3f5df5ffd758b7282ac55e2239',1,'stan::mcmc::ps_point']]], + ['get_5fresult_5ftype',['get_result_type',['../classstan_1_1gm_1_1function__signatures.html#ae14f96665097dc1c77f89750e73e8af9',1,'stan::gm::function_signatures']]], + ['get_5fsample_5fparam_5fnames',['get_sample_param_names',['../classstan_1_1mcmc_1_1sample.html#af9d0b064b26b744a8a3416726ed64ad0',1,'stan::mcmc::sample']]], + ['get_5fsample_5fparams',['get_sample_params',['../classstan_1_1mcmc_1_1sample.html#a0a0f69f242625c8f7d033cefae3b066c',1,'stan::mcmc::sample']]], + ['get_5fsampler_5fdiagnostic_5fnames',['get_sampler_diagnostic_names',['../classstan_1_1mcmc_1_1base__mcmc.html#a439ab0edaa1e186e5c0639dd30a367c7',1,'stan::mcmc::base_mcmc::get_sampler_diagnostic_names()'],['../classstan_1_1mcmc_1_1base__hmc.html#ab03fa8ffe91879f8bd8b364641c4de5a',1,'stan::mcmc::base_hmc::get_sampler_diagnostic_names()']]], + ['get_5fsampler_5fdiagnostics',['get_sampler_diagnostics',['../classstan_1_1mcmc_1_1base__mcmc.html#a0d3f7f318891d813a1b3f78a194aa060',1,'stan::mcmc::base_mcmc::get_sampler_diagnostics()'],['../classstan_1_1mcmc_1_1base__hmc.html#abcf75357ef756a2c74f9855386b3be47',1,'stan::mcmc::base_hmc::get_sampler_diagnostics()']]], + ['get_5fsampler_5fparam_5fnames',['get_sampler_param_names',['../classstan_1_1mcmc_1_1base__mcmc.html#aca923f3231a9487745a999d95b5923ce',1,'stan::mcmc::base_mcmc::get_sampler_param_names()'],['../classstan_1_1mcmc_1_1base__nuts.html#a1f1085f2b4bd6b4e94fbce9f43243a6c',1,'stan::mcmc::base_nuts::get_sampler_param_names()'],['../classstan_1_1mcmc_1_1base__static__hmc.html#a101e66c9b73da1301847477ace7caebb',1,'stan::mcmc::base_static_hmc::get_sampler_param_names()']]], + ['get_5fsampler_5fparams',['get_sampler_params',['../classstan_1_1mcmc_1_1base__mcmc.html#af599911f5d38fbf91c4a475b0d27c1b6',1,'stan::mcmc::base_mcmc::get_sampler_params()'],['../classstan_1_1mcmc_1_1base__nuts.html#a7b804d04e40e371e8d543e78a6b1fc12',1,'stan::mcmc::base_nuts::get_sampler_params()'],['../classstan_1_1mcmc_1_1base__static__hmc.html#a743d29144c3d7f6159995f71524abff9',1,'stan::mcmc::base_static_hmc::get_sampler_params()']]], + ['get_5fstepsize_5fadaptation',['get_stepsize_adaptation',['../classstan_1_1mcmc_1_1stepsize__adapter.html#afc1a82938cba4951ea63cc983ae77844',1,'stan::mcmc::stepsize_adapter::get_stepsize_adaptation()'],['../classstan_1_1mcmc_1_1stepsize__covar__adapter.html#a84390e298b70ce828d8e04ebdad63d56',1,'stan::mcmc::stepsize_covar_adapter::get_stepsize_adaptation()'],['../classstan_1_1mcmc_1_1stepsize__var__adapter.html#af38b99277aa2cf9af8bbf69c1e683c0a',1,'stan::mcmc::stepsize_var_adapter::get_stepsize_adaptation()']]], + ['get_5fstepsize_5fjitter',['get_stepsize_jitter',['../classstan_1_1mcmc_1_1base__hmc.html#a17660d32d37d39df87f49ed0e8f97262',1,'stan::mcmc::base_hmc']]], + ['get_5ft',['get_T',['../classstan_1_1mcmc_1_1base__static__hmc.html#a2c983e383003ed37eccb11bcaef22179',1,'stan::mcmc::base_static_hmc']]], + ['get_5ft0',['get_t0',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#a12f4547328cdc7a469d3369568954d14',1,'stan::mcmc::stepsize_adaptation']]], + ['get_5fvar_5fadaptation',['get_var_adaptation',['../classstan_1_1mcmc_1_1stepsize__var__adapter.html#a63d086dbff4db90650091784bd48e54a',1,'stan::mcmc::stepsize_var_adapter']]], + ['gm_2ehpp',['gm.hpp',['../gm_8hpp.html',1,'']]], + ['grad',['grad',['../classstan_1_1agrad_1_1var.html#adafe2731ffff76ed74a84299633d70ac',1,'stan::agrad::var::grad(std::vector< var > &x, std::vector< double > &g)'],['../classstan_1_1agrad_1_1var.html#a14d0349fa31df6ae544165b40cd01d94',1,'stan::agrad::var::grad()'],['../classstan_1_1agrad_1_1var.html#adafe2731ffff76ed74a84299633d70ac',1,'stan::agrad::var::grad(std::vector< var > &x, std::vector< double > &g)'],['../classstan_1_1agrad_1_1var.html#a14d0349fa31df6ae544165b40cd01d94',1,'stan::agrad::var::grad()'],['../classstan_1_1optimization_1_1_b_f_g_s_line_search.html#a800198f26824c242a030d7ab838b0a2c',1,'stan::optimization::BFGSLineSearch::grad()'],['../classstan_1_1optimization_1_1_nesterov_gradient.html#a0b4971e472f7ab5708535a9a87d8fc9c',1,'stan::optimization::NesterovGradient::grad()'],['../namespacestan_1_1agrad.html#a1fb22c831a12e8fea76ef7ee0bd32cb3',1,'stan::agrad::grad(chainable *vi)'],['../namespacestan_1_1agrad.html#aab9a3ff45fadad49e4797f3687ab7e8a',1,'stan::agrad::grad(var &v, Eigen::Matrix< var, Eigen::Dynamic, 1 > &x, Eigen::VectorXd &g)'],['../namespacestan_1_1agrad.html#a1fb22c831a12e8fea76ef7ee0bd32cb3',1,'stan::agrad::grad(chainable *vi)']]], + ['grad_2ehpp',['grad.hpp',['../grad_8hpp.html',1,'']]], + ['grad2f1',['grad2F1',['../namespacestan_1_1math.html#a71aed6cfebd1e7a926130982018cfefe',1,'stan::math']]], + ['grad_5fevals',['grad_evals',['../classstan_1_1optimization_1_1_b_f_g_s_line_search.html#aa39e8aa1b28762bd358986c11c67838a',1,'stan::optimization::BFGSLineSearch']]], + ['grad_5fhess_5flog_5fprob',['grad_hess_log_prob',['../namespacestan_1_1model.html#ad83f35a2e6e0b78d505d8128dee49588',1,'stan::model']]], + ['grad_5fnorm',['grad_norm',['../classstan_1_1optimization_1_1_b_f_g_s_line_search.html#ae9f74939356da68cdb2763647fe5f1b7',1,'stan::optimization::BFGSLineSearch']]], + ['grad_5ftr_5fmat_5ftimes_5fhessian',['grad_tr_mat_times_hessian',['../namespacestan_1_1agrad.html#acba3577a92618529775046335dc015ac',1,'stan::agrad']]], + ['gradf32',['gradF32',['../namespacestan_1_1math.html#a8db199c237a3b502dccc197db9dfcd7d',1,'stan::math']]], + ['gradient',['gradient',['../namespacestan_1_1agrad.html#a3a0d7a65cb491249a40ce309b4c74433',1,'stan::agrad::gradient(const F &f, const Eigen::Matrix< double, Eigen::Dynamic, 1 > &x, double &fx, Eigen::Matrix< double, Eigen::Dynamic, 1 > &grad_fx)'],['../namespacestan_1_1agrad.html#a90556a6034444a74ac3859ab41d79334',1,'stan::agrad::gradient(const F &f, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, T &fx, Eigen::Matrix< T, Eigen::Dynamic, 1 > &grad_fx)']]], + ['gradient_5fdot_5fvector',['gradient_dot_vector',['../namespacestan_1_1agrad.html#a193936962d2fceadcf578dd09b127776',1,'stan::agrad']]], + ['gradincbeta',['gradIncBeta',['../namespacestan_1_1math.html#a6e61bf2a2523eac620649be1b836f6af',1,'stan::math']]], + ['gradregincbeta',['gradRegIncBeta',['../namespacestan_1_1math.html#a748e297c3c711bde9cd125cdc873dc8d',1,'stan::math']]], + ['gradregincgamma',['gradRegIncGamma',['../namespacestan_1_1math.html#a55877c24977357ef441acc0b37f6b337',1,'stan::math']]], + ['gumbel_2ehpp',['gumbel.hpp',['../gumbel_8hpp.html',1,'']]], + ['gumbel_5fccdf_5flog',['gumbel_ccdf_log',['../namespacestan_1_1prob.html#a7031408cb549ef6e62d05a0e23050913',1,'stan::prob']]], + ['gumbel_5fcdf',['gumbel_cdf',['../namespacestan_1_1prob.html#a51c9e75ef3d9f0aa113b1dff27bfd5f8',1,'stan::prob']]], + ['gumbel_5fcdf_5flog',['gumbel_cdf_log',['../namespacestan_1_1prob.html#af3a4abf9379ede54947a4a46c520a286',1,'stan::prob']]], + ['gumbel_5flog',['gumbel_log',['../namespacestan_1_1prob.html#ad56fe89a003692852a43ed83e9020ade',1,'stan::prob::gumbel_log(const T_y &y, const T_loc &mu, const T_scale &beta)'],['../namespacestan_1_1prob.html#a09ae16a393bdb54599b3e0794e626df0',1,'stan::prob::gumbel_log(const T_y &y, const T_loc &mu, const T_scale &beta)']]], + ['gumbel_5frng',['gumbel_rng',['../namespacestan_1_1prob.html#a717c41a1a31ff84f523df17a4e894c23',1,'stan::prob']]] +]; diff --git a/doc/api/html/search/all_68.html b/doc/api/html/search/all_68.html new file mode 100644 index 00000000000..6df9097825d --- /dev/null +++ b/doc/api/html/search/all_68.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/all_68.js b/doc/api/html/search/all_68.js new file mode 100644 index 00000000000..a2bdf9439df --- /dev/null +++ b/doc/api/html/search/all_68.js @@ -0,0 +1,38 @@ +var searchData= +[ + ['h',['H',['../classstan_1_1mcmc_1_1base__hamiltonian.html#abb069ceb36c44afad1ba03f97e8a097d',1,'stan::mcmc::base_hamiltonian']]], + ['h0',['H0',['../structstan_1_1mcmc_1_1nuts__util.html#a083059897da783bc5a50a483b3d1a183',1,'stan::mcmc::nuts_util']]], + ['has_5fdenorm',['has_denorm',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#ab74374d12ef2fd157e9da0da9bca17aa',1,'std::numeric_limits< stan::agrad::fvar< T > >::has_denorm()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a39f58441200febe35d15375e04002318',1,'std::numeric_limits< stan::agrad::var >::has_denorm()']]], + ['has_5fdenorm_5floss',['has_denorm_loss',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#ac1de307325406b40bd2aa6753c8b77a4',1,'std::numeric_limits< stan::agrad::fvar< T > >::has_denorm_loss()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a07a601c0d75d68be0894f1ec263261ee',1,'std::numeric_limits< stan::agrad::var >::has_denorm_loss()']]], + ['has_5fflag',['has_flag',['../classstan_1_1io_1_1cmd__line.html#a2d24eb7b0df0df0f9237e722c9935344',1,'stan::io::cmd_line']]], + ['has_5fhigh',['has_high',['../structstan_1_1gm_1_1range.html#a4fd2933ba84accb4d4df4fa7af5570b8',1,'stan::gm::range']]], + ['has_5finfinity',['has_infinity',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a4900fc01499241dbb808e1ab376c8f20',1,'std::numeric_limits< stan::agrad::fvar< T > >::has_infinity()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#ac994e94ce600838a8387132c7b11e481',1,'std::numeric_limits< stan::agrad::var >::has_infinity()']]], + ['has_5fkey',['has_key',['../classstan_1_1io_1_1cmd__line.html#a6d18234501f15e832c610807519091bc',1,'stan::io::cmd_line']]], + ['has_5flb',['has_lb',['../namespacestan_1_1gm.html#a5f8f794036a1282d39160c8005350fb6',1,'stan::gm']]], + ['has_5flow',['has_low',['../structstan_1_1gm_1_1range.html#a5602af4e9ea366a5c256798a372f7d26',1,'stan::gm::range']]], + ['has_5flub',['has_lub',['../namespacestan_1_1gm.html#a354abd99f7fd052b3be9e590a90f51af',1,'stan::gm']]], + ['has_5fnon_5fparam_5fvar',['has_non_param_var',['../namespacestan_1_1gm.html#a5cd24fa3880414fae68b9f140341781c',1,'stan::gm']]], + ['has_5fquiet_5fnan',['has_quiet_NaN',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a3d523ce5c3189091d5a7e108cdc4d0fa',1,'std::numeric_limits< stan::agrad::fvar< T > >::has_quiet_NaN()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a636301ed6183639045a28156565e7d98',1,'std::numeric_limits< stan::agrad::var >::has_quiet_NaN()']]], + ['has_5frng_5fsuffix',['has_rng_suffix',['../namespacestan_1_1gm.html#adbc7bd18dc8464af8d3deee3dc1119de',1,'stan::gm']]], + ['has_5fsignaling_5fnan',['has_signaling_NaN',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a9e18e0a8ae010b0eab03652a91df9073',1,'std::numeric_limits< stan::agrad::fvar< T > >::has_signaling_NaN()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#af303ec0e4b68e63d6d0a3c5962af28f0',1,'std::numeric_limits< stan::agrad::var >::has_signaling_NaN()']]], + ['has_5fub',['has_ub',['../namespacestan_1_1gm.html#af96a2f3903f1feab3fce868fefee250b',1,'stan::gm']]], + ['has_5fvar',['has_var',['../namespacestan_1_1gm.html#a2fd9d0472225916eae17d19fde00fe30',1,'stan::gm']]], + ['hasfloatingpoint',['HasFloatingPoint',['../struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html#a932a61195daad3e89711cfb02521cac9a60d738ff8c60f58fe3a03d2909498a6e',1,'Eigen::NumTraits< stan::agrad::var >']]], + ['head',['head',['../namespacestan_1_1math.html#a140b54b11069aed039f67c6dd172256b',1,'stan::math::head(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v, size_t n)'],['../namespacestan_1_1math.html#a4d7964d83597ea54cd7ba63bee50409f',1,'stan::math::head(const Eigen::Matrix< T, 1, Eigen::Dynamic > &rv, size_t n)'],['../namespacestan_1_1math.html#a5e746ba14994b318a0a192a97a0a28db',1,'stan::math::head(const std::vector< T > &sv, size_t n)']]], + ['head_2ehpp',['head.hpp',['../head_8hpp.html',1,'']]], + ['header',['header',['../structstan_1_1io_1_1stan__csv.html#afacde95dde068821de91fc137eb86515',1,'stan::io::stan_csv']]], + ['help_5fprinted',['help_printed',['../classstan_1_1gm_1_1argument__parser.html#a97217b4fce24caa4f13f01366ba7eede',1,'stan::gm::argument_parser']]], + ['help_5fwidth',['help_width',['../classstan_1_1gm_1_1argument.html#a1604ff4589c7f92728663ce1c4709c3b',1,'stan::gm::argument']]], + ['hessian',['hessian',['../namespacestan_1_1agrad.html#a757135302068c250c2379b0c13a28e2e',1,'stan::agrad::hessian(const F &f, const Eigen::Matrix< double, Eigen::Dynamic, 1 > &x, double &fx, Eigen::Matrix< double, Eigen::Dynamic, 1 > &grad, Eigen::Matrix< double, Eigen::Dynamic, Eigen::Dynamic > &H)'],['../namespacestan_1_1agrad.html#ae0c1250f021e0a792f89308da1798c52',1,'stan::agrad::hessian(const F &f, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, T &fx, Eigen::Matrix< T, Eigen::Dynamic, 1 > &grad, Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &H)'],['../namespacestan_1_1agrad.html#a7bb9b2db82474a079e4fe1cfe980f41b',1,'stan::agrad::hessian(const F &f, const std::vector< double > &x, const std::vector< double > &v, std::vector< double > &Hv)']]], + ['hessian_2ehpp',['hessian.hpp',['../hessian_8hpp.html',1,'']]], + ['hessian_5ftimes_5fvector',['hessian_times_vector',['../namespacestan_1_1agrad.html#a65e3ff9debccf35476fd084b965c3eb1',1,'stan::agrad::hessian_times_vector(const F &f, const Eigen::Matrix< double, Eigen::Dynamic, 1 > &x, const Eigen::Matrix< double, Eigen::Dynamic, 1 > &v, double &fx, Eigen::Matrix< double, Eigen::Dynamic, 1 > &Hv)'],['../namespacestan_1_1agrad.html#a410d4227fbb881a70b80ae5d110dafe9',1,'stan::agrad::hessian_times_vector(const F &f, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v, T &fx, Eigen::Matrix< T, Eigen::Dynamic, 1 > &Hv)']]], + ['hessiant',['HessianT',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a80b2c5e6ef5839aa3a580a9a9a37de64',1,'stan::optimization::BFGSMinimizer']]], + ['high_5f',['high_',['../structstan_1_1gm_1_1range.html#a1b2c5b66107277bccac20593700fce54',1,'stan::gm::range']]], + ['highest',['highest',['../struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html#a91c90fce61fb31c3a9bc079ff8a07d35',1,'Eigen::NumTraits< stan::agrad::var >']]], + ['hypergeometric_2ehpp',['hypergeometric.hpp',['../hypergeometric_8hpp.html',1,'']]], + ['hypergeometric_5flog',['hypergeometric_log',['../namespacestan_1_1prob.html#a66e4f57cee9af34a961de0ff06cbd778',1,'stan::prob::hypergeometric_log(const T_n &n, const T_N &N, const T_a &a, const T_b &b)'],['../namespacestan_1_1prob.html#aa8045ba7d2d74aa5142128b020ef91f9',1,'stan::prob::hypergeometric_log(const T_n &n, const T_N &N, const T_a &a, const T_b &b)']]], + ['hypergeometric_5frng',['hypergeometric_rng',['../namespacestan_1_1prob.html#ac1f5eb0ed8be3298f817d5f5b976144d',1,'stan::prob']]], + ['hypot',['hypot',['../namespacestan_1_1agrad.html#abefe7efd440d029f4ae53c723c1835cf',1,'stan::agrad::hypot(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#afaa49a34b4a0d6977cacc4eed74aa276',1,'stan::agrad::hypot(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#a8ec2045c8ca3af2bc0f411819e287108',1,'stan::agrad::hypot(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#aca9ecbd3c8db717865343fe7dc363490',1,'stan::agrad::hypot(const stan::agrad::var &a, const stan::agrad::var &b)'],['../namespacestan_1_1agrad.html#a4671da443c63a084e9511fc3dad810c6',1,'stan::agrad::hypot(const stan::agrad::var &a, const double &b)'],['../namespacestan_1_1agrad.html#a6b4379c4eaaa6367836430274d82a06b',1,'stan::agrad::hypot(const double &a, const stan::agrad::var &b)']]], + ['hypot_2ehpp',['hypot.hpp',['../fwd_2functions_2hypot_8hpp.html',1,'']]], + ['hypot_2ehpp',['hypot.hpp',['../rev_2functions_2hypot_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/all_69.html b/doc/api/html/search/all_69.html new file mode 100644 index 00000000000..1a00b554d45 --- /dev/null +++ b/doc/api/html/search/all_69.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/all_69.js b/doc/api/html/search/all_69.js new file mode 100644 index 00000000000..1b4dd5340aa --- /dev/null +++ b/doc/api/html/search/all_69.js @@ -0,0 +1,171 @@ +var searchData= +[ + ['ibeta',['ibeta',['../namespacestan_1_1agrad.html#a54d4bc3e46a75315a2c098c3d4e0b3f4',1,'stan::agrad::ibeta()'],['../namespacestan_1_1math.html#af7b430ac57e75ba2d55843cd868506e1',1,'stan::math::ibeta()']]], + ['ibeta_2ehpp',['ibeta.hpp',['../math_2functions_2ibeta_8hpp.html',1,'']]], + ['ibeta_2ehpp',['ibeta.hpp',['../agrad_2rev_2functions_2ibeta_8hpp.html',1,'']]], + ['identifier_5fname_5fr',['identifier_name_r',['../structstan_1_1gm_1_1var__decls__grammar.html#abe3a037eddfdf6c101755e4fc09436f9',1,'stan::gm::var_decls_grammar']]], + ['identifier_5fr',['identifier_r',['../structstan_1_1gm_1_1statement__grammar.html#a416d3908d9a67cf4d3a9b5774475fee1',1,'stan::gm::statement_grammar::identifier_r()'],['../structstan_1_1gm_1_1term__grammar.html#a58df34f539d1aa793e3cc607350bd9f3',1,'stan::gm::term_grammar::identifier_r()'],['../structstan_1_1gm_1_1var__decls__grammar.html#a633a9520c7d6578925fe33bc0106db7f',1,'stan::gm::var_decls_grammar::identifier_r()']]], + ['identity_5fconstrain',['identity_constrain',['../namespacestan_1_1prob.html#ad85151d68bb1f8edbdc64960cf14a86e',1,'stan::prob::identity_constrain(T x)'],['../namespacestan_1_1prob.html#a2efcd423525f2b20c28888283eb41079',1,'stan::prob::identity_constrain(const T x, T &)']]], + ['identity_5ffree',['identity_free',['../namespacestan_1_1prob.html#ae9e2475641a356dc2b0b103f5152eb84',1,'stan::prob']]], + ['idx_5f',['idx_',['../agrad_2rev_2matrix_2log__softmax_8hpp.html#a48e1ddf96b6a9b19ecead9aca544bb31',1,'idx_(): log_softmax.hpp'],['../agrad_2rev_2matrix_2softmax_8hpp.html#a48e1ddf96b6a9b19ecead9aca544bb31',1,'idx_(): softmax.hpp']]], + ['idx_5ft',['idx_t',['../classstan_1_1optimization_1_1_b_f_g_s_line_search.html#afa2cfdf9357f5d63982f8ff00b4c6916',1,'stan::optimization::BFGSLineSearch']]], + ['if_5felse',['if_else',['../namespacestan_1_1agrad.html#a2a018c9770257f38d93125db6c7eda5f',1,'stan::agrad::if_else(bool c, const var &y_true, const var &y_false)'],['../namespacestan_1_1agrad.html#a2b19777661eada4e32b7d84b64c9f4db',1,'stan::agrad::if_else(bool c, double y_true, const var &y_false)'],['../namespacestan_1_1agrad.html#a86ce2dc25f73176ea45b300a9cfd63eb',1,'stan::agrad::if_else(bool c, const var &y_true, const double y_false)'],['../namespacestan_1_1math.html#aa732732442d65936275d718b7286cb51',1,'stan::math::if_else()']]], + ['if_5felse_2ehpp',['if_else.hpp',['../agrad_2rev_2functions_2if__else_8hpp.html',1,'']]], + ['if_5felse_2ehpp',['if_else.hpp',['../math_2functions_2if__else_8hpp.html',1,'']]], + ['ill_5fformed_5ft',['ILL_FORMED_T',['../namespacestan_1_1gm.html#a41679a8cc9b047f5ce5aea48a4d6800a',1,'stan::gm']]], + ['include_5fsampling_5f',['include_sampling_',['../structstan_1_1gm_1_1statement__visgen.html#a021d7d6fb6d86d0d05f91fead1b7beaf',1,'stan::gm::statement_visgen']]], + ['include_5fsummand',['include_summand',['../structstan_1_1prob_1_1include__summand.html',1,'stan::prob']]], + ['increment_5flog_5fprob_5fstatement',['increment_log_prob_statement',['../structstan_1_1gm_1_1increment__log__prob__statement.html#a7cac1e4c4bf79fce11fc836ab1ea0cc1',1,'stan::gm::increment_log_prob_statement::increment_log_prob_statement()'],['../structstan_1_1gm_1_1increment__log__prob__statement.html#ab828f581d60e699e3fa1ea4f82fa24eb',1,'stan::gm::increment_log_prob_statement::increment_log_prob_statement(const expression &log_prob)']]], + ['increment_5flog_5fprob_5fstatement',['increment_log_prob_statement',['../structstan_1_1gm_1_1increment__log__prob__statement.html',1,'stan::gm']]], + ['increment_5flog_5fprob_5fstatement_5fr',['increment_log_prob_statement_r',['../structstan_1_1gm_1_1statement__grammar.html#a63ae1e77864d40c126f8f5f2ea389c92',1,'stan::gm::statement_grammar']]], + ['indent',['INDENT',['../namespacestan_1_1gm.html#a0c2dcd808a0d9ba32a552d5da9449dad',1,'stan::gm']]], + ['indent2',['INDENT2',['../namespacestan_1_1gm.html#ac233ed8139ded7c35ee0583d7840914a',1,'stan::gm']]], + ['indent3',['INDENT3',['../namespacestan_1_1gm.html#a6ff34cca044609d9dd669dcc9c992c60',1,'stan::gm']]], + ['indent_5f',['indent_',['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#a74906d451df5f65a04ae1d0125ed7e76',1,'stan::gm::generate_local_var_init_nan_visgen::indent_()'],['../structstan_1_1gm_1_1generate__init__vars__visgen.html#a647f2748887eb08a54ae5c79617ef662',1,'stan::gm::generate_init_vars_visgen::indent_()'],['../structstan_1_1gm_1_1statement__visgen.html#ae4c1610db98461ae144b353bcee4ef0c',1,'stan::gm::statement_visgen::indent_()']]], + ['indent_5fwidth',['indent_width',['../classstan_1_1gm_1_1argument.html#a63234e5b668b59bda3c18c3ade793332',1,'stan::gm::argument']]], + ['indents_5f',['indents_',['../structstan_1_1gm_1_1validate__var__decl__visgen.html#a68936cf8226f63807082c4c9201b659c',1,'stan::gm::validate_var_decl_visgen::indents_()'],['../structstan_1_1gm_1_1member__var__decl__visgen.html#a4e3a93b4b15745447bcc0f25c71c2818',1,'stan::gm::member_var_decl_visgen::indents_()'],['../structstan_1_1gm_1_1local__var__decl__visgen.html#a684598c909a697b029cbd625574b473a',1,'stan::gm::local_var_decl_visgen::indents_()'],['../structstan_1_1gm_1_1validate__transformed__params__visgen.html#abbc7f7f70068b351832f9ed884bd700e',1,'stan::gm::validate_transformed_params_visgen::indents_()']]], + ['index',['index',['../classstan_1_1mcmc_1_1chains.html#ab87d44365c2f2a83afc9351020bfc3ed',1,'stan::mcmc::chains']]], + ['index_5fop',['index_op',['../structstan_1_1gm_1_1index__op.html#a862956865d36615fa28089dea1d1217d',1,'stan::gm::index_op::index_op()'],['../structstan_1_1gm_1_1index__op.html#a12f574d13a3b1d3d34c536cb8d7d6aa2',1,'stan::gm::index_op::index_op(const expression &expr, const std::vector< std::vector< expression > > &dimss)']]], + ['index_5fop',['index_op',['../structstan_1_1gm_1_1index__op.html',1,'stan::gm']]], + ['indexed_5ffactor_5fr',['indexed_factor_r',['../structstan_1_1gm_1_1term__grammar.html#a2423c5db80eac040aa5a28db10db99cf',1,'stan::gm::term_grammar']]], + ['infer_5ftype',['infer_type',['../structstan_1_1gm_1_1fun.html#a20f538c7866f306aa80274fddebf727d',1,'stan::gm::fun::infer_type()'],['../structstan_1_1gm_1_1index__op.html#a529d7cb01f9d404a881fda27c82dc460',1,'stan::gm::index_op::infer_type()']]], + ['infer_5ftype_5findexing',['infer_type_indexing',['../namespacestan_1_1gm.html#a17574edb8e226bfd71f69da1d4f97168',1,'stan::gm::infer_type_indexing(const base_expr_type &expr_base_type, size_t num_expr_dims, size_t num_index_dims)'],['../namespacestan_1_1gm.html#a46f979229875f1d6d427dbbe87fa8a59',1,'stan::gm::infer_type_indexing(const expression &expr, size_t num_index_dims)']]], + ['infinity',['infinity',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#ad148a929c21b1747b25cecd70cf212cf',1,'std::numeric_limits< stan::agrad::fvar< T > >::infinity()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#ad4b150d32c6d506c86f20072a9bcfa57',1,'std::numeric_limits< stan::agrad::var >::infinity()']]], + ['infty',['INFTY',['../namespacestan_1_1math.html#a7f2ac8ebf3095e9934715bb34f0669b3',1,'stan::math']]], + ['init',['init',['../structstan_1_1io_1_1stan__csv__metadata.html#ad962db2e20c7b01804ed3e2553cca168',1,'stan::io::stan_csv_metadata::init()'],['../classstan_1_1mcmc_1_1base__hamiltonian.html#a43a6071f6c711fc9e2980515c3223d10',1,'stan::mcmc::base_hamiltonian::init()']]], + ['init_5fadapt',['init_adapt',['../namespacestan_1_1gm.html#ab49a5fee3bf2cacd63f0ce7e252a6a93',1,'stan::gm::init_adapt(Sampler *sampler, const double delta, const double gamma, const double kappa, const double t0, const Eigen::VectorXd &cont_params)'],['../namespacestan_1_1gm.html#ae3483b7eb32848c5bee0ee48b431f46e',1,'stan::gm::init_adapt(stan::mcmc::base_mcmc *sampler, categorical_argument *adapt, const Eigen::VectorXd &cont_params)']]], + ['init_5fdependent',['init_dependent',['../classstan_1_1agrad_1_1chainable.html#a9ef6020dcc949b73c1c3dfb1d4623bae',1,'stan::agrad::chainable::init_dependent()'],['../classstan_1_1agrad_1_1vari.html#ac668b532eb7eb33af863dfb035c0b8dc',1,'stan::agrad::vari::init_dependent()']]], + ['init_5flocal_5fvar_5fvisgen',['init_local_var_visgen',['../structstan_1_1gm_1_1init__local__var__visgen.html',1,'stan::gm']]], + ['init_5flocal_5fvar_5fvisgen',['init_local_var_visgen',['../structstan_1_1gm_1_1init__local__var__visgen.html#a25c03b95d95240b52cf0b06801478a87',1,'stan::gm::init_local_var_visgen']]], + ['init_5fnuts',['init_nuts',['../namespacestan_1_1gm.html#aaa8e6ed991ef6bf3b5afc96b953e18ca',1,'stan::gm']]], + ['init_5fstatic_5fhmc',['init_static_hmc',['../namespacestan_1_1gm.html#ad9e999952303f4c193f24b063ff55d91',1,'stan::gm']]], + ['init_5fstepsize',['init_stepsize',['../classstan_1_1mcmc_1_1base__hmc.html#a6ec1af08b215fda50b23dade2aa615a8',1,'stan::mcmc::base_hmc']]], + ['init_5fwindowed_5fadapt',['init_windowed_adapt',['../namespacestan_1_1gm.html#a5121125c3b419aa099ab6fca8cb9d1c6',1,'stan::gm']]], + ['initialize',['initialize',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a1b31f5b47ab4af27c17ab8f620aaf914',1,'stan::optimization::BFGSMinimizer::initialize()'],['../namespacestan_1_1math.html#af81e05dfd6918524dafff10715f21a8d',1,'stan::math::initialize(T &x, const T &v)'],['../namespacestan_1_1math.html#a067af584ff2d244d2041c9b13f6d9247',1,'stan::math::initialize(T &x, V v)'],['../namespacestan_1_1math.html#aa2d6d42a356af95988b3a7005b5cf408',1,'stan::math::initialize(Eigen::Matrix< T, R, C > &x, const T &v)'],['../namespacestan_1_1math.html#ad27706378f77dc22746ad74721d495d4',1,'stan::math::initialize(std::vector< T > &x, const V &v)']]], + ['initialize_2ehpp',['initialize.hpp',['../initialize_8hpp.html',1,'']]], + ['initialize_5fepsilon',['initialize_epsilon',['../classstan_1_1optimization_1_1_nesterov_gradient.html#af4dd5e1558ecf25c7a0bb57cb4e71c90',1,'stan::optimization::NesterovGradient']]], + ['initialize_5fvariable',['initialize_variable',['../namespacestan_1_1agrad.html#ae4df62fded6cf60ac4928f942190f39d',1,'stan::agrad::initialize_variable(var &variable, const var &value)'],['../namespacestan_1_1agrad.html#a6de2168e9cf12f2dad32a9a823b385a6',1,'stan::agrad::initialize_variable(Eigen::Matrix< var, R, C > &matrix, const var &value)'],['../namespacestan_1_1agrad.html#a15a79398931d22105e55c92dc3b8c6be',1,'stan::agrad::initialize_variable(std::vector< T > &variables, const var &value)']]], + ['initialize_5fvariable_2ehpp',['initialize_variable.hpp',['../initialize__variable_8hpp.html',1,'']]], + ['instance',['instance',['../classstan_1_1gm_1_1function__signatures.html#a7f9782621df19462a0f088d0cf1542ff',1,'stan::gm::function_signatures']]], + ['int_5fargument',['int_argument',['../namespacestan_1_1gm.html#ab772327341c716a591776dda31107ee7',1,'stan::gm']]], + ['int_5fdecl_5fr',['int_decl_r',['../structstan_1_1gm_1_1var__decls__grammar.html#a95017547beb96098c7578e64b8b278eb',1,'stan::gm::var_decls_grammar']]], + ['int_5fliteral',['int_literal',['../structstan_1_1gm_1_1int__literal.html#a621c688b553f3f113f9b8ec9dc007ac8',1,'stan::gm::int_literal::int_literal()'],['../structstan_1_1gm_1_1int__literal.html#ae1dde9e342981c83edcc3832b10a19ca',1,'stan::gm::int_literal::int_literal(int val)'],['../structstan_1_1gm_1_1int__literal.html#aad91821fd816aa1be8b6313a12898141',1,'stan::gm::int_literal::int_literal(const int_literal &il)']]], + ['int_5fliteral',['int_literal',['../structstan_1_1gm_1_1int__literal.html',1,'stan::gm']]], + ['int_5fliteral_5fr',['int_literal_r',['../structstan_1_1gm_1_1term__grammar.html#a74cece98c11632b9d78665d719908735',1,'stan::gm::term_grammar']]], + ['int_5fstep',['int_step',['../namespacestan_1_1math.html#a8c507cff4b7b473cd86e1d428fb03136',1,'stan::math']]], + ['int_5fstep_2ehpp',['int_step.hpp',['../int__step_8hpp.html',1,'']]], + ['int_5ft',['INT_T',['../namespacestan_1_1gm.html#a2da21cb21d76a1fbafe6857e23e37b5b',1,'stan::gm']]], + ['int_5fvalues',['int_values',['../classstan_1_1io_1_1dump__reader.html#a595a2345787b84d1cb763c5f45a2c749',1,'stan::io::dump_reader']]], + ['int_5fvar_5fdecl',['int_var_decl',['../structstan_1_1gm_1_1int__var__decl.html#a47be885b904c190c2cdeae110ff4ca1c',1,'stan::gm::int_var_decl::int_var_decl()'],['../structstan_1_1gm_1_1int__var__decl.html#a8f08077bdf5b897c09ee679149eebd8a',1,'stan::gm::int_var_decl::int_var_decl(range const &range, std::string const &name, std::vector< expression > const &dims)']]], + ['int_5fvar_5fdecl',['int_var_decl',['../structstan_1_1gm_1_1int__var__decl.html',1,'stan::gm']]], + ['integer',['integer',['../classstan_1_1io_1_1reader.html#af1a2b111d918d34bfebf6bb3b821495f',1,'stan::io::reader::integer()'],['../classstan_1_1io_1_1writer.html#a5614adc99ab468fdc3957c6444df46c7',1,'stan::io::writer::integer()']]], + ['integer_5fconstrain',['integer_constrain',['../classstan_1_1io_1_1reader.html#aeccd55003bc47a1eade2c75c20d0d13f',1,'stan::io::reader::integer_constrain()'],['../classstan_1_1io_1_1reader.html#a41d16a67c77fa38a5da05da6b4eb563f',1,'stan::io::reader::integer_constrain(T &)']]], + ['integer_5flb',['integer_lb',['../classstan_1_1io_1_1reader.html#a1535fc6c26ecedd2aa25989853a09261',1,'stan::io::reader']]], + ['integer_5flb_5fconstrain',['integer_lb_constrain',['../classstan_1_1io_1_1reader.html#a9287c3669f5eea0a5b2f22708d26da67',1,'stan::io::reader::integer_lb_constrain(int lb)'],['../classstan_1_1io_1_1reader.html#a786ee459470898a8fbc8a240dec6f269',1,'stan::io::reader::integer_lb_constrain(int lb, T &)']]], + ['integer_5flub',['integer_lub',['../classstan_1_1io_1_1reader.html#af9be53bcf3f435d5c25b07774853afa3',1,'stan::io::reader']]], + ['integer_5flub_5fconstrain',['integer_lub_constrain',['../classstan_1_1io_1_1reader.html#aa73203544d85c8e7f4a6e682edb8db4f',1,'stan::io::reader::integer_lub_constrain(int lb, int ub)'],['../classstan_1_1io_1_1reader.html#a0934519cf50d98a616b4e3a0bc9539fc',1,'stan::io::reader::integer_lub_constrain(int lb, int ub, T &)']]], + ['integer_5fub',['integer_ub',['../classstan_1_1io_1_1reader.html#a5dce1d461bcef2fda9d996fb07bb6782',1,'stan::io::reader']]], + ['integer_5fub_5fconstrain',['integer_ub_constrain',['../classstan_1_1io_1_1reader.html#aa492d17e0aeaba5a082fc554d248048e',1,'stan::io::reader::integer_ub_constrain(int ub)'],['../classstan_1_1io_1_1reader.html#ad23ce5d0b04667272770eb04eff2bfd4',1,'stan::io::reader::integer_ub_constrain(int ub, T &)']]], + ['internal_2ehpp',['internal.hpp',['../internal_8hpp.html',1,'']]], + ['internal_5fmath_2ehpp',['internal_math.hpp',['../internal__math_8hpp.html',1,'']]], + ['inv',['inv',['../namespacestan_1_1agrad.html#a08b011331905f0a026fa4270582fe5d5',1,'stan::agrad::inv(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#ab3034b6e4ac96bb83a5b6f40c310d64d',1,'stan::agrad::inv(const var &a)'],['../namespacestan_1_1math.html#ab64935e0bdac8227bfd9608285d4e699',1,'stan::math::inv()']]], + ['inv_2ehpp',['inv.hpp',['../agrad_2fwd_2functions_2inv_8hpp.html',1,'']]], + ['inv_2ehpp',['inv.hpp',['../agrad_2rev_2functions_2inv_8hpp.html',1,'']]], + ['inv_2ehpp',['inv.hpp',['../math_2functions_2inv_8hpp.html',1,'']]], + ['inv_5fchi_5fsquare_2ehpp',['inv_chi_square.hpp',['../inv__chi__square_8hpp.html',1,'']]], + ['inv_5fchi_5fsquare_5fccdf_5flog',['inv_chi_square_ccdf_log',['../namespacestan_1_1prob.html#a51e89cc15295d67eba75dfb4ccdbe27c',1,'stan::prob']]], + ['inv_5fchi_5fsquare_5fcdf',['inv_chi_square_cdf',['../namespacestan_1_1prob.html#ad68b6e115796a534a753491eae9744cb',1,'stan::prob']]], + ['inv_5fchi_5fsquare_5fcdf_5flog',['inv_chi_square_cdf_log',['../namespacestan_1_1prob.html#a624df4d53f7a8d24a4014e1e57ccaf3c',1,'stan::prob']]], + ['inv_5fchi_5fsquare_5flog',['inv_chi_square_log',['../namespacestan_1_1prob.html#ad6fd48ecb4e2a0cc22225cff5a7997e2',1,'stan::prob::inv_chi_square_log(const T_y &y, const T_dof &nu)'],['../namespacestan_1_1prob.html#a4c772dff5074551415e50920347b83cd',1,'stan::prob::inv_chi_square_log(const T_y &y, const T_dof &nu)']]], + ['inv_5fchi_5fsquare_5frng',['inv_chi_square_rng',['../namespacestan_1_1prob.html#ad7d3c06abef9546ac2f0a9174f1446fa',1,'stan::prob']]], + ['inv_5fcloglog',['inv_cloglog',['../namespacestan_1_1agrad.html#a14ec5b6590b42a6405fa06a34105ce84',1,'stan::agrad::inv_cloglog(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#afa07068a7659049c1404ff6e380176ef',1,'stan::agrad::inv_cloglog(const stan::agrad::var &a)'],['../namespacestan_1_1math.html#a008bf0b6c2ab38d088b0aba5d7b10c8d',1,'stan::math::inv_cloglog()']]], + ['inv_5fcloglog_2ehpp',['inv_cloglog.hpp',['../math_2functions_2inv__cloglog_8hpp.html',1,'']]], + ['inv_5fcloglog_2ehpp',['inv_cloglog.hpp',['../agrad_2fwd_2functions_2inv__cloglog_8hpp.html',1,'']]], + ['inv_5fcloglog_2ehpp',['inv_cloglog.hpp',['../agrad_2rev_2functions_2inv__cloglog_8hpp.html',1,'']]], + ['inv_5fgamma_2ehpp',['inv_gamma.hpp',['../inv__gamma_8hpp.html',1,'']]], + ['inv_5fgamma_5fccdf_5flog',['inv_gamma_ccdf_log',['../namespacestan_1_1prob.html#ac95b1a5f812a121f1fce3120f54caabc',1,'stan::prob']]], + ['inv_5fgamma_5fcdf',['inv_gamma_cdf',['../namespacestan_1_1prob.html#a9295ef95ac9022168eff6748495294bf',1,'stan::prob']]], + ['inv_5fgamma_5fcdf_5flog',['inv_gamma_cdf_log',['../namespacestan_1_1prob.html#af5bc8f367605c27867cc93ec4f7b19d9',1,'stan::prob']]], + ['inv_5fgamma_5flog',['inv_gamma_log',['../namespacestan_1_1prob.html#a94f9022a58b4d16ac6eac9edc8c1cecc',1,'stan::prob::inv_gamma_log(const T_y &y, const T_shape &alpha, const T_scale &beta)'],['../namespacestan_1_1prob.html#a5aada55fa2a26ebfc6d38a1c5a2dc956',1,'stan::prob::inv_gamma_log(const T_y &y, const T_shape &alpha, const T_scale &beta)']]], + ['inv_5fgamma_5frng',['inv_gamma_rng',['../namespacestan_1_1prob.html#af588e525e8543ac66f21b5273196deaf',1,'stan::prob']]], + ['inv_5flogit',['inv_logit',['../namespacestan_1_1agrad.html#ab812d33218848139b280e30cd8863ac2',1,'stan::agrad::inv_logit(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#a015c1e0733bd9a3d7c26175d7072a759',1,'stan::agrad::inv_logit(const stan::agrad::var &a)'],['../namespacestan_1_1math.html#ad2c4834fc581f55acf8491ec3f80ecb7',1,'stan::math::inv_logit()']]], + ['inv_5flogit_2ehpp',['inv_logit.hpp',['../agrad_2fwd_2functions_2inv__logit_8hpp.html',1,'']]], + ['inv_5flogit_2ehpp',['inv_logit.hpp',['../math_2functions_2inv__logit_8hpp.html',1,'']]], + ['inv_5flogit_2ehpp',['inv_logit.hpp',['../agrad_2rev_2functions_2inv__logit_8hpp.html',1,'']]], + ['inv_5fsqrt',['inv_sqrt',['../namespacestan_1_1agrad.html#a17ce517fb5ec226947603b3dfbbc235b',1,'stan::agrad::inv_sqrt(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#aac8f303b29b23f9952c2ad5ada543319',1,'stan::agrad::inv_sqrt(const var &a)'],['../namespacestan_1_1math.html#a4b4db5e98585c71cc7c14319f96e0c04',1,'stan::math::inv_sqrt()']]], + ['inv_5fsqrt_2ehpp',['inv_sqrt.hpp',['../agrad_2fwd_2functions_2inv__sqrt_8hpp.html',1,'']]], + ['inv_5fsqrt_2ehpp',['inv_sqrt.hpp',['../agrad_2rev_2functions_2inv__sqrt_8hpp.html',1,'']]], + ['inv_5fsqrt_2ehpp',['inv_sqrt.hpp',['../math_2functions_2inv__sqrt_8hpp.html',1,'']]], + ['inv_5fsqrt_5f2',['INV_SQRT_2',['../namespacestan_1_1math.html#a5491e346d5a812af988f8de4a5948c88',1,'stan::math']]], + ['inv_5fsqrt_5ftwo_5fpi',['INV_SQRT_TWO_PI',['../namespacestan_1_1math.html#a44d54686aa26009d0e9101be42afd877',1,'stan::math']]], + ['inv_5fsquare',['inv_square',['../namespacestan_1_1agrad.html#ad0cd65a6699f1fa471523ecef19102b4',1,'stan::agrad::inv_square(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#ab283916863ab97eab6aed628480f8a8b',1,'stan::agrad::inv_square(const var &a)'],['../namespacestan_1_1math.html#a3d2e922aa13e2dfae510fc13d86eaea3',1,'stan::math::inv_square()']]], + ['inv_5fsquare_2ehpp',['inv_square.hpp',['../agrad_2fwd_2functions_2inv__square_8hpp.html',1,'']]], + ['inv_5fsquare_2ehpp',['inv_square.hpp',['../agrad_2rev_2functions_2inv__square_8hpp.html',1,'']]], + ['inv_5fsquare_2ehpp',['inv_square.hpp',['../math_2functions_2inv__square_8hpp.html',1,'']]], + ['inv_5fwishart_2ehpp',['inv_wishart.hpp',['../inv__wishart_8hpp.html',1,'']]], + ['inv_5fwishart_5flog',['inv_wishart_log',['../namespacestan_1_1prob.html#a3052d1f67722328b643b7adb1fbae485',1,'stan::prob::inv_wishart_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &W, const T_dof &nu, const Eigen::Matrix< T_scale, Eigen::Dynamic, Eigen::Dynamic > &S)'],['../namespacestan_1_1prob.html#ad6efba06df0f3ccf2455b60bc7bbbdef',1,'stan::prob::inv_wishart_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &W, const T_dof &nu, const Eigen::Matrix< T_scale, Eigen::Dynamic, Eigen::Dynamic > &S)']]], + ['inv_5fwishart_5frng',['inv_wishart_rng',['../namespacestan_1_1prob.html#a6c0745153ef776d59ddac99f480972e5',1,'stan::prob']]], + ['inverse',['inverse',['../classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4.html#ac4f64ce4ad745b09bbb59113697760f4',1,'stan::math::LDLT_factor< double, R, C >::inverse()'],['../namespacestan_1_1agrad.html#ad04d66a7b2f44ae630c904534a43687a',1,'stan::agrad::inverse()'],['../namespacestan_1_1math.html#a461598c914f5634fa5057da7a817803d',1,'stan::math::inverse()']]], + ['inverse_2ehpp',['inverse.hpp',['../agrad_2fwd_2matrix_2inverse_8hpp.html',1,'']]], + ['inverse_2ehpp',['inverse.hpp',['../math_2matrix_2inverse_8hpp.html',1,'']]], + ['inverse_5fsoftmax',['inverse_softmax',['../namespacestan_1_1math.html#a1edc35cc581dda178263f6a4a4fd1158',1,'stan::math']]], + ['inverse_5fsoftmax_2ehpp',['inverse_softmax.hpp',['../inverse__softmax_8hpp.html',1,'']]], + ['inverse_5fspd',['inverse_spd',['../namespacestan_1_1math.html#a989989548db02c34cd6134790bd93478',1,'stan::math']]], + ['inverse_5fspd_2ehpp',['inverse_spd.hpp',['../inverse__spd_8hpp.html',1,'']]], + ['io_2ehpp',['io.hpp',['../io_8hpp.html',1,'']]], + ['is_5faligned',['is_aligned',['../namespacestan_1_1memory.html#a952ba61b6936bdcad3955ec1f5e6ef8f',1,'stan::memory']]], + ['is_5fbounded',['is_bounded',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a00d51ca94f9c0e1b616831de051cbb5d',1,'std::numeric_limits< stan::agrad::fvar< T > >::is_bounded()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a0e9247bdf394e889d350e1440ec16838',1,'std::numeric_limits< stan::agrad::var >::is_bounded()']]], + ['is_5fconstant',['is_constant',['../structstan_1_1is__constant.html',1,'stan']]], + ['is_5fconstant_5fstruct',['is_constant_struct',['../structstan_1_1is__constant__struct.html',1,'stan']]], + ['is_5fconstant_5fstruct_3c_20eigen_3a_3ablock_3c_20t_20_3e_20_3e',['is_constant_struct< Eigen::Block< T > >',['../structstan_1_1is__constant__struct_3_01_eigen_1_1_block_3_01_t_01_4_01_4.html',1,'stan']]], + ['is_5fconstant_5fstruct_3c_20eigen_3a_3amatrix_3c_20t_2c_20r_2c_20c_20_3e_20_3e',['is_constant_struct< Eigen::Matrix< T, R, C > >',['../structstan_1_1is__constant__struct_3_01_eigen_1_1_matrix_3_01_t_00_01_r_00_01_c_01_4_01_4.html',1,'stan']]], + ['is_5fconstant_5fstruct_3c_20std_3a_3avector_3c_20t_20_3e_20_3e',['is_constant_struct< std::vector< T > >',['../structstan_1_1is__constant__struct_3_01std_1_1vector_3_01_t_01_4_01_4.html',1,'stan']]], + ['is_5fdefault',['is_default',['../classstan_1_1gm_1_1list__argument.html#a1f1d85337d7e4d67ef688997d8418dbd',1,'stan::gm::list_argument::is_default()'],['../classstan_1_1gm_1_1singleton__argument.html#a6ea5538fe5533addc1f6795a4ac1eb49',1,'stan::gm::singleton_argument::is_default()'],['../classstan_1_1gm_1_1valued__argument.html#af72ce3805416a25c51304b5448dae967',1,'stan::gm::valued_argument::is_default()']]], + ['is_5fdouble_5freturn',['is_double_return',['../structstan_1_1gm_1_1validate__sample.html#a457fa512cf1ad5c13e3c1fb0e02e9adf',1,'stan::gm::validate_sample']]], + ['is_5fexact',['is_exact',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#aad19ba909c19a94944d95dd1b08d1710',1,'std::numeric_limits< stan::agrad::fvar< T > >::is_exact()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#aaf190bf85cc7519a8a1b14e14c97da00',1,'std::numeric_limits< stan::agrad::var >::is_exact()']]], + ['is_5ffvar',['is_fvar',['../structstan_1_1is__fvar.html',1,'stan']]], + ['is_5ffvar_3c_20stan_3a_3aagrad_3a_3afvar_3c_20t_20_3e_20_3e',['is_fvar< stan::agrad::fvar< T > >',['../structstan_1_1is__fvar_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html',1,'stan']]], + ['is_5fiec559',['is_iec559',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#ade091447063275d7c0b78ee66ff60cf5',1,'std::numeric_limits< stan::agrad::fvar< T > >::is_iec559()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#ae82edc8f86c529ccf0160b314a551d2f',1,'std::numeric_limits< stan::agrad::var >::is_iec559()']]], + ['is_5fill_5fformed',['is_ill_formed',['../structstan_1_1gm_1_1expr__type.html#af9a85e43e814f13ccadd9640308b86de',1,'stan::gm::expr_type::is_ill_formed()'],['../structstan_1_1gm_1_1sample.html#ab2f55c7ff636a10cc46e1d86c401041d',1,'stan::gm::sample::is_ill_formed()']]], + ['is_5fint',['is_int',['../classstan_1_1io_1_1dump__reader.html#a17c0c96ad8cb3c3c362fa74384b45bb7',1,'stan::io::dump_reader']]], + ['is_5finteger',['is_integer',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a0bab63fa64809576a620da21303d0811',1,'std::numeric_limits< stan::agrad::fvar< T > >::is_integer()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a0fa54365a3bc3ca63ad1eeb4ca90aa99',1,'std::numeric_limits< stan::agrad::var >::is_integer()']]], + ['is_5fmatrix',['is_matrix',['../print_8hpp.html#a4405283b10c32553e10a7273d2a4f9d8',1,'print.hpp']]], + ['is_5fmodulo',['is_modulo',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#ad516d6dd56d51063f07ba00a55a40c61',1,'std::numeric_limits< stan::agrad::fvar< T > >::is_modulo()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a03869da904ea370a26159a4b5b44552c',1,'std::numeric_limits< stan::agrad::var >::is_modulo()']]], + ['is_5fnil',['is_nil',['../namespacestan_1_1gm.html#a90e5f154350b02c39f381659672f9581',1,'stan::gm']]], + ['is_5fnil_5fop',['is_nil_op',['../structstan_1_1gm_1_1is__nil__op.html',1,'stan::gm']]], + ['is_5fnonempty',['is_nonempty',['../namespacestan_1_1gm.html#a9cb045831aff85e2a5bc5d51bfc6584a',1,'stan::gm']]], + ['is_5fpresent',['is_present',['../classstan_1_1gm_1_1unvalued__argument.html#a87b246d97afb366e67ae99984dc4540e',1,'stan::gm::unvalued_argument']]], + ['is_5fprimitive',['is_primitive',['../structstan_1_1gm_1_1expr__type.html#a28728288384b1c9510ffe1a3cbb5efa3',1,'stan::gm::expr_type']]], + ['is_5fprimitive_5fdouble',['is_primitive_double',['../structstan_1_1gm_1_1expr__type.html#a01d1300672955a943b60f1f7220371a7',1,'stan::gm::expr_type']]], + ['is_5fprimitive_5fint',['is_primitive_int',['../structstan_1_1gm_1_1expr__type.html#a745e55e1e245badd91138475f8f7bddb',1,'stan::gm::expr_type']]], + ['is_5fsigned',['is_signed',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a233290aa081cce7372665d112465e6aa',1,'std::numeric_limits< stan::agrad::fvar< T > >::is_signed()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a4c82808a270534c93824fa6ad9d03654',1,'std::numeric_limits< stan::agrad::var >::is_signed()']]], + ['is_5fspace',['is_space',['../namespacestan_1_1gm.html#a68fe0b83fbaa4ec1300a89f5097127b3',1,'stan::gm']]], + ['is_5fspecialized',['is_specialized',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a1376e2f62fedbf5cabaa9ee991faaca4',1,'std::numeric_limits< stan::agrad::fvar< T > >::is_specialized()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#ae66652be3cbe3f3b88a06b3a036e47cf',1,'std::numeric_limits< stan::agrad::var >::is_specialized()']]], + ['is_5funinitialized',['is_uninitialized',['../classstan_1_1agrad_1_1var.html#ab7764c9ed32774d35c18d512d5c96f96',1,'stan::agrad::var::is_uninitialized()'],['../namespacestan_1_1agrad.html#a72761c1c17a04122ee2dbb0c56cbb9c0',1,'stan::agrad::is_uninitialized()'],['../namespacestan_1_1math.html#a40c14c26dc55a985e05695b3ff1eeef2',1,'stan::math::is_uninitialized()']]], + ['is_5funinitialized_2ehpp',['is_uninitialized.hpp',['../agrad_2rev_2functions_2is__uninitialized_8hpp.html',1,'']]], + ['is_5funinitialized_2ehpp',['is_uninitialized.hpp',['../math_2functions_2is__uninitialized_8hpp.html',1,'']]], + ['is_5funivariate',['is_univariate',['../structstan_1_1gm_1_1validate__sample.html#aca344bafbf0b16055bc48307645f4c81',1,'stan::gm::validate_sample']]], + ['is_5fvalid',['is_valid',['../classstan_1_1gm_1_1arg__adapt__delta.html#a916005859f965aabc1d829a7062ec424',1,'stan::gm::arg_adapt_delta::is_valid()'],['../classstan_1_1gm_1_1arg__adapt__gamma.html#a6fe8d59b8c1315ee5c6dc6b466698e19',1,'stan::gm::arg_adapt_gamma::is_valid()'],['../classstan_1_1gm_1_1arg__adapt__kappa.html#a1b03b095c18343b8932d36aca1211e12',1,'stan::gm::arg_adapt_kappa::is_valid()'],['../classstan_1_1gm_1_1arg__adapt__t0.html#a98cacbc166aa6b2ceb14094dddc7fad6',1,'stan::gm::arg_adapt_t0::is_valid()'],['../classstan_1_1gm_1_1arg__id.html#a477cdfd1a053c2e7b63bdadada63ff60',1,'stan::gm::arg_id::is_valid()'],['../classstan_1_1gm_1_1arg__init__alpha.html#ac40372ef2c1cbe5d9ede053b1014c003',1,'stan::gm::arg_init_alpha::is_valid()'],['../classstan_1_1gm_1_1arg__int__time.html#a71716eb472c59395c6de8cbca1755c00',1,'stan::gm::arg_int_time::is_valid()'],['../classstan_1_1gm_1_1arg__iter.html#a390a002c014d9d88c41ab5b224b0e771',1,'stan::gm::arg_iter::is_valid()'],['../classstan_1_1gm_1_1arg__max__depth.html#a30a8bb165ba3b981ab802337641bbe60',1,'stan::gm::arg_max_depth::is_valid()'],['../classstan_1_1gm_1_1arg__num__samples.html#aeca6a105ba2ef2e80ec02969bd581af2',1,'stan::gm::arg_num_samples::is_valid()'],['../classstan_1_1gm_1_1arg__num__warmup.html#a3671f012b8c32dbc0cc470db0be437ff',1,'stan::gm::arg_num_warmup::is_valid()'],['../classstan_1_1gm_1_1arg__refresh.html#a2ea73528686bcd3386826638346a7173',1,'stan::gm::arg_refresh::is_valid()'],['../classstan_1_1gm_1_1arg__stepsize.html#a39d1b37895f28567618958d5b7df849d',1,'stan::gm::arg_stepsize::is_valid()'],['../classstan_1_1gm_1_1arg__stepsize__jitter.html#acf9b3e56f3f411ecf82e0af58f05517d',1,'stan::gm::arg_stepsize_jitter::is_valid()'],['../classstan_1_1gm_1_1arg__test__grad__eps.html#aa547cb6de6ea0e76098b79cce8e94cf7',1,'stan::gm::arg_test_grad_eps::is_valid()'],['../classstan_1_1gm_1_1arg__test__grad__err.html#a449f28acf765be6f6998f1fabebc7b40',1,'stan::gm::arg_test_grad_err::is_valid()'],['../classstan_1_1gm_1_1arg__thin.html#a98ba3e88a6641e25ca08d3c35ca68e68',1,'stan::gm::arg_thin::is_valid()'],['../classstan_1_1gm_1_1arg__tolerance.html#a003c31f5f93a8a7f77ec46b7c9e2420c',1,'stan::gm::arg_tolerance::is_valid()'],['../classstan_1_1gm_1_1singleton__argument.html#a007c5b0d3f9498c45089075bb0c3c390',1,'stan::gm::singleton_argument::is_valid()']]], + ['is_5fvar',['is_var',['../structstan_1_1is__var.html',1,'stan']]], + ['is_5fvar_3c_20stan_3a_3aagrad_3a_3avar_20_3e',['is_var< stan::agrad::var >',['../structstan_1_1is__var_3_01stan_1_1agrad_1_1var_01_4.html',1,'stan']]], + ['is_5fvar_5f',['is_var_',['../structstan_1_1gm_1_1init__local__var__visgen.html#a06307f8a9f7b1ef4c6d8823d23e355e8',1,'stan::gm::init_local_var_visgen::is_var_()'],['../structstan_1_1gm_1_1local__var__decl__visgen.html#abe44f6bbd4ad19111fd011c02dd228bb',1,'stan::gm::local_var_decl_visgen::is_var_()'],['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#af0d41615f91253c476b881ee7e90134e',1,'stan::gm::generate_local_var_init_nan_visgen::is_var_()'],['../structstan_1_1gm_1_1statement__visgen.html#ad951339b35d33e87ee6900f7423c1592',1,'stan::gm::statement_visgen::is_var_()']]], + ['is_5fvar_5for_5farithmetic',['is_var_or_arithmetic',['../structstan_1_1is__var__or__arithmetic.html',1,'stan']]], + ['is_5fvector',['is_vector',['../structstan_1_1is__vector.html',1,'stan']]], + ['is_5fvector_3c_20const_20t_20_3e',['is_vector< const T >',['../structstan_1_1is__vector_3_01const_01_t_01_4.html',1,'stan']]], + ['is_5fvector_3c_20eigen_3a_3amatrix_3c_20t_2c_201_2c_20eigen_3a_3adynamic_20_3e_20_3e',['is_vector< Eigen::Matrix< T, 1, Eigen::Dynamic > >',['../structstan_1_1is__vector_3_01_eigen_1_1_matrix_3_01_t_00_011_00_01_eigen_1_1_dynamic_01_4_01_4.html',1,'stan']]], + ['is_5fvector_3c_20eigen_3a_3amatrix_3c_20t_2c_20eigen_3a_3adynamic_2c_201_20_3e_20_3e',['is_vector< Eigen::Matrix< T, Eigen::Dynamic, 1 > >',['../structstan_1_1is__vector_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_011_01_4_01_4.html',1,'stan']]], + ['is_5fvector_3c_20std_3a_3avector_3c_20t_20_3e_20_3e',['is_vector< std::vector< T > >',['../structstan_1_1is__vector_3_01std_1_1vector_3_01_t_01_4_01_4.html',1,'stan']]], + ['is_5fvector_5flike',['is_vector_like',['../structstan_1_1is__vector__like.html',1,'stan']]], + ['is_5fvector_5flike_3c_20const_20t_20_3e',['is_vector_like< const T >',['../structstan_1_1is__vector__like_3_01const_01_t_01_4.html',1,'stan']]], + ['is_5fvector_5flike_3c_20eigen_3a_3amatrix_3c_20t_2c_20eigen_3a_3adynamic_2c_20eigen_3a_3adynamic_20_3e_20_3e',['is_vector_like< Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > >',['../structstan_1_1is__vector__like_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4.html',1,'stan']]], + ['is_5fvector_5flike_3c_20t_20_2a_20_3e',['is_vector_like< T * >',['../structstan_1_1is__vector__like_3_01_t_01_5_01_4.html',1,'stan']]], + ['iscomplex',['IsComplex',['../struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html#a932a61195daad3e89711cfb02521cac9a12cf0c95d1a09bb4805e148f3ced38ab',1,'Eigen::NumTraits< stan::agrad::var >']]], + ['isfinite',['isfinite',['../namespaceboost_1_1math.html#aacb94b2d8f46034875d78e4260274709',1,'boost::math']]], + ['isinf',['isinf',['../namespaceboost_1_1math.html#ad274b0c69c7bd9e4ca76ac7519fd9f74',1,'boost::math::isinf()'],['../namespacestd.html#a458a0f3c809188e7fb9a9e10d335ac60',1,'std::isinf()']]], + ['isinteger',['IsInteger',['../struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html#a932a61195daad3e89711cfb02521cac9a1355527a3b8071883fdbc70b00a30b80',1,'Eigen::NumTraits< stan::agrad::var >']]], + ['isnan',['isnan',['../namespaceboost_1_1math.html#a3987c91e5ae7f757baf28ae8efc0fbbe',1,'boost::math::isnan()'],['../namespacestd.html#a197a4417fc07456e4f2d545e176dc97a',1,'std::isnan()']]], + ['isnormal',['isnormal',['../namespaceboost_1_1math.html#a66748d24fc22dc865ef9b64d17ed4d66',1,'boost::math']]], + ['issigned',['IsSigned',['../struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html#a932a61195daad3e89711cfb02521cac9ae9afee549e8ec17d1bc544ae785ac96f',1,'Eigen::NumTraits< stan::agrad::var >']]], + ['iter_5fnum',['iter_num',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a7c686dded117ef891b9a0aff363a511d',1,'stan::optimization::BFGSMinimizer']]], + ['iterator_5ftypedefs_2ehpp',['iterator_typedefs.hpp',['../iterator__typedefs_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/all_6a.html b/doc/api/html/search/all_6a.html new file mode 100644 index 00000000000..969ef1e506e --- /dev/null +++ b/doc/api/html/search/all_6a.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/all_6a.js b/doc/api/html/search/all_6a.js new file mode 100644 index 00000000000..df31335ea56 --- /dev/null +++ b/doc/api/html/search/all_6a.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['jacobian',['jacobian',['../namespacestan_1_1agrad.html#a660e1cd77e3dcb11faf98da2521ee0f8',1,'stan::agrad::jacobian(const F &f, const Eigen::Matrix< double, Eigen::Dynamic, 1 > &x, Eigen::Matrix< double, Eigen::Dynamic, 1 > &fx, Eigen::Matrix< double, Eigen::Dynamic, Eigen::Dynamic > &J)'],['../namespacestan_1_1agrad.html#a7d496770e4f01fa73a4adf17e2ea1313',1,'stan::agrad::jacobian(const F &f, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, Eigen::Matrix< T, Eigen::Dynamic, 1 > &fx, Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &J)'],['../namespacestan_1_1agrad.html#a4121d2877f4a3569f878b8e9207af3c1',1,'stan::agrad::jacobian(std::vector< var > &dependents, std::vector< var > &independents, std::vector< std::vector< double > > &jacobian)']]], + ['jacobian_2ehpp',['jacobian.hpp',['../jacobian_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/all_6b.html b/doc/api/html/search/all_6b.html new file mode 100644 index 00000000000..571dadb1f1b --- /dev/null +++ b/doc/api/html/search/all_6b.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/all_6b.js b/doc/api/html/search/all_6b.js new file mode 100644 index 00000000000..d1819945d36 --- /dev/null +++ b/doc/api/html/search/all_6b.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['k_5f',['K_',['../structstan_1_1gm_1_1unit__vector__var__decl.html#a5e60137ec4a7b3f0ccfd0e6841ebb46f',1,'stan::gm::unit_vector_var_decl::K_()'],['../structstan_1_1gm_1_1simplex__var__decl.html#ac395e69af88b82ab0dd6f17413bf9552',1,'stan::gm::simplex_var_decl::K_()'],['../structstan_1_1gm_1_1ordered__var__decl.html#aa3a7d1133246c773a8a23825cf6a71b9',1,'stan::gm::ordered_var_decl::K_()'],['../structstan_1_1gm_1_1positive__ordered__var__decl.html#a46cd009bcd34cae3f1a1eac88ffb9df9',1,'stan::gm::positive_ordered_var_decl::K_()'],['../structstan_1_1gm_1_1cov__matrix__var__decl.html#a015b2522873880fbe7788f3b2627f6ac',1,'stan::gm::cov_matrix_var_decl::K_()'],['../structstan_1_1gm_1_1corr__matrix__var__decl.html#aed341a4b3496c14fe2e12ec4c4ae6389',1,'stan::gm::corr_matrix_var_decl::K_()']]], + ['key_5fset',['key_set',['../classstan_1_1gm_1_1function__signatures.html#a6b48032da5b50b100fdb4ebcba899197',1,'stan::gm::function_signatures']]] +]; diff --git a/doc/api/html/search/all_6c.html b/doc/api/html/search/all_6c.html new file mode 100644 index 00000000000..f6383cc2277 --- /dev/null +++ b/doc/api/html/search/all_6c.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/all_6c.js b/doc/api/html/search/all_6c.js new file mode 100644 index 00000000000..d9cf905cdc9 --- /dev/null +++ b/doc/api/html/search/all_6c.js @@ -0,0 +1,163 @@ +var searchData= +[ + ['l_5f',['L_',['../classstan_1_1mcmc_1_1base__static__hmc.html#a90fa0670ef5e51de2534f25c0a34a2c7',1,'stan::mcmc::base_static_hmc']]], + ['lb_5fconstrain',['lb_constrain',['../namespacestan_1_1prob.html#a680c6f47862a16f0b45c85ce534e8211',1,'stan::prob::lb_constrain(const T x, const TL lb)'],['../namespacestan_1_1prob.html#a76b59a59ddaad0ad5a82226192ffd843',1,'stan::prob::lb_constrain(const T x, const TL lb, T &lp)']]], + ['lb_5ffree',['lb_free',['../namespacestan_1_1prob.html#a5f8562f1f72bf02ac21b36ef8dcfe3d7',1,'stan::prob']]], + ['lbeta',['lbeta',['../namespacestan_1_1agrad.html#ab7f20a5b3ac5abeef9b69b629c64f075',1,'stan::agrad::lbeta(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#ae4c9ce80559602ab8d0ec6f5ae3e7d3b',1,'stan::agrad::lbeta(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a2f095ba758cbca01594b6b7be1513ce4',1,'stan::agrad::lbeta(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1math.html#a3ccdb3f505b7db61c510e59e97b947b6',1,'stan::math::lbeta()']]], + ['lbeta_2ehpp',['lbeta.hpp',['../agrad_2fwd_2functions_2lbeta_8hpp.html',1,'']]], + ['lbeta_2ehpp',['lbeta.hpp',['../math_2functions_2lbeta_8hpp.html',1,'']]], + ['ldlt_2ehpp',['ldlt.hpp',['../math_2matrix_2ldlt_8hpp.html',1,'']]], + ['ldlt_2ehpp',['ldlt.hpp',['../agrad_2rev_2matrix_2ldlt_8hpp.html',1,'']]], + ['ldlt_5ffactor',['LDLT_factor',['../class_l_d_l_t__factor.html',1,'LDLT_factor< T, R, C >'],['../classstan_1_1math_1_1_l_d_l_t__factor_3_01stan_1_1agrad_1_1var_00_01_r_00_01_c_01_4.html#abdc7a01f87ac33c781d58a2d5ed2fd26',1,'stan::math::LDLT_factor< stan::agrad::var, R, C >::LDLT_factor()'],['../classstan_1_1math_1_1_l_d_l_t__factor_3_01stan_1_1agrad_1_1var_00_01_r_00_01_c_01_4.html#a86525804bc537ac3a74297484626d45a',1,'stan::math::LDLT_factor< stan::agrad::var, R, C >::LDLT_factor(const Eigen::Matrix< stan::agrad::var, R, C > &A)'],['../classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4.html#ab710d201cf60112e05283a2b57c3547c',1,'stan::math::LDLT_factor< double, R, C >::LDLT_factor()'],['../classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4.html#a88d83ef1c8b2536fc47c2e822aabaee2',1,'stan::math::LDLT_factor< double, R, C >::LDLT_factor(const Eigen::Matrix< double, R, C > &A)']]], + ['ldlt_5ffactor_3c_20double_2c_20r_2c_20c_20_3e',['LDLT_factor< double, R, C >',['../classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4.html',1,'stan::math']]], + ['ldlt_5ffactor_3c_20stan_3a_3aagrad_3a_3avar_2c_20r_2c_20c_20_3e',['LDLT_factor< stan::agrad::var, R, C >',['../classstan_1_1math_1_1_l_d_l_t__factor_3_01stan_1_1agrad_1_1var_00_01_r_00_01_c_01_4.html',1,'stan::math']]], + ['learn_5fcovariance',['learn_covariance',['../classstan_1_1mcmc_1_1covar__adaptation.html#a6c50cab9f1bebe465e8c28db2a9581f4',1,'stan::mcmc::covar_adaptation']]], + ['learn_5fstepsize',['learn_stepsize',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#a29b24c73369c15114624b44b703d100e',1,'stan::mcmc::stepsize_adaptation']]], + ['learn_5fvariance',['learn_variance',['../classstan_1_1mcmc_1_1var__adaptation.html#a52f68d10bf0c8628b395bf18a00ba34e',1,'stan::mcmc::var_adaptation']]], + ['left',['left',['../structstan_1_1gm_1_1binary__op.html#a08aaf31f8a247550eac0475e4a260a10',1,'stan::gm::binary_op']]], + ['left_5fdivision',['left_division',['../namespacestan_1_1gm.html#a7ce0894487b3983ccf7f1d1ed59a1f4b',1,'stan::gm']]], + ['left_5fdivision_5fexpr',['left_division_expr',['../structstan_1_1gm_1_1left__division__expr.html',1,'stan::gm']]], + ['length',['length',['../namespacestan.html#a59c48c2ee48c5a6e8048fa2d6a035445',1,'stan::length(const T &)'],['../namespacestan.html#adb2e0700b1ec87a5e080cd50026b0182',1,'stan::length(const std::vector< T > &x)'],['../namespacestan.html#a12b8544448f77da1a773c7b7c0ebdc01',1,'stan::length(const Eigen::Matrix< T, R, C > &m)']]], + ['length_5f',['length_',['../agrad_2rev_2matrix_2dot__product_8hpp.html#af0c9b7dcc98dce1d0edf7cb6ce49103b',1,'length_(): dot_product.hpp'],['../_eigen___num_traits_8hpp.html#af0c9b7dcc98dce1d0edf7cb6ce49103b',1,'length_(): Eigen_NumTraits.hpp'],['../agrad_2rev_2matrix_2squared__dist_8hpp.html#af0c9b7dcc98dce1d0edf7cb6ce49103b',1,'length_(): squared_dist.hpp'],['../agrad_2rev_2matrix_2sum_8hpp.html#af0c9b7dcc98dce1d0edf7cb6ce49103b',1,'length_(): sum.hpp']]], + ['lgamma',['lgamma',['../namespacestan_1_1agrad.html#acb8b7366b1ecbe633d2c96f1c8dc62b8',1,'stan::agrad::lgamma(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#a9d1f65093166797ec93ec580abc77d15',1,'stan::agrad::lgamma(const stan::agrad::var &a)'],['../namespacestan_1_1math.html#a836f46d7f63f5118a32cad11382c0551',1,'stan::math::lgamma()']]], + ['lgamma_2ehpp',['lgamma.hpp',['../agrad_2fwd_2functions_2lgamma_8hpp.html',1,'']]], + ['lgamma_2ehpp',['lgamma.hpp',['../agrad_2rev_2functions_2lgamma_8hpp.html',1,'']]], + ['lgamma_2ehpp',['lgamma.hpp',['../math_2functions_2lgamma_8hpp.html',1,'']]], + ['lhsscalar',['LhsScalar',['../struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1va44da5f98e1caea9523bacbd5bdc025fe.html#a53b8b1e508aa14de16ac804960453975',1,'Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, ColMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >::LhsScalar()'],['../struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1vacd54cabc78c49ca719650381b68b105e.html#a8b1863097b547b5a7f2d24b8ccfe5796',1,'Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, RowMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >::LhsScalar()'],['../struct_eigen_1_1internal_1_1general__matrix__matrix__product_3_01_index_00_01stan_1_1agrad_1_1va9b485de9571b6e46d7a64aff43a6d9d3.html#a4b77e4f22ba05c8daaa850af323db4c5',1,'Eigen::internal::general_matrix_matrix_product< Index, stan::agrad::var, LhsStorageOrder, ConjugateLhs, stan::agrad::var, RhsStorageOrder, ConjugateRhs, ColMajor >::LhsScalar()']]], + ['lhsstorageorder',['LhsStorageOrder',['../struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1va44da5f98e1caea9523bacbd5bdc025fe.html#a1a45ecc02e193d7a8d978fc11b7bf753a4568cff436d678b2cb8e936b209fced9',1,'Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, ColMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >::LhsStorageOrder()'],['../struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1vacd54cabc78c49ca719650381b68b105e.html#a2b766d523420f3934c8e5bd00078d9f4a2a6d617ef050b14291315944cee7c382',1,'Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, RowMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >::LhsStorageOrder()']]], + ['likely',['likely',['../stack__alloc_8hpp.html#a217a0bd562b98ae8c2ffce44935351e1',1,'stack_alloc.hpp']]], + ['list_5fargument',['list_argument',['../classstan_1_1gm_1_1list__argument.html',1,'stan::gm']]], + ['list_5fargument',['list_argument',['../classstan_1_1gm_1_1list__argument.html#ac0e9e2d2392255d5d6576390c7560b89',1,'stan::gm::list_argument']]], + ['list_5fargument_2ehpp',['list_argument.hpp',['../list__argument_8hpp.html',1,'']]], + ['lkj_5fcorr_2ehpp',['lkj_corr.hpp',['../lkj__corr_8hpp.html',1,'']]], + ['lkj_5fcorr_5fcholesky_5flog',['lkj_corr_cholesky_log',['../namespacestan_1_1prob.html#a547d5d6ea7f2a985488c75eb2788d7c4',1,'stan::prob::lkj_corr_cholesky_log(const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &L, const T_shape &eta)'],['../namespacestan_1_1prob.html#afa5ff4715e294327b88666b1f9639e55',1,'stan::prob::lkj_corr_cholesky_log(const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &L, const T_shape &eta)']]], + ['lkj_5fcorr_5fcholesky_5frng',['lkj_corr_cholesky_rng',['../namespacestan_1_1prob.html#ab6923f0ee88a517f5be6ac8780e5842c',1,'stan::prob']]], + ['lkj_5fcorr_5flog',['lkj_corr_log',['../namespacestan_1_1prob.html#a89375117dd56efcdf32c2e8d7bb593a9',1,'stan::prob::lkj_corr_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const T_shape &eta)'],['../namespacestan_1_1prob.html#a35b120723f2e595892c2d86d00a9cf3e',1,'stan::prob::lkj_corr_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const T_shape &eta)']]], + ['lkj_5fcorr_5frng',['lkj_corr_rng',['../namespacestan_1_1prob.html#a54800d037a32da9ecfb59c87152bfbcc',1,'stan::prob']]], + ['lkj_5fcov_2ehpp',['lkj_cov.hpp',['../lkj__cov_8hpp.html',1,'']]], + ['lkj_5fcov_5flog',['lkj_cov_log',['../namespacestan_1_1prob.html#a96a69b926127ce2349d86bcbedac81d7',1,'stan::prob::lkj_cov_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_scale, Eigen::Dynamic, 1 > &sigma, const T_shape &eta)'],['../namespacestan_1_1prob.html#a60be4ec8b4e9dd29b73d49139c489e51',1,'stan::prob::lkj_cov_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_scale, Eigen::Dynamic, 1 > &sigma, const T_shape &eta)'],['../namespacestan_1_1prob.html#a8d134366536efce845a8f64527e86ff9',1,'stan::prob::lkj_cov_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const T_loc &mu, const T_scale &sigma, const T_shape &eta)'],['../namespacestan_1_1prob.html#a78c42178310c4085d186abfb85c97db1',1,'stan::prob::lkj_cov_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const T_loc &mu, const T_scale &sigma, const T_shape &eta)']]], + ['lmgamma',['lmgamma',['../namespacestan_1_1agrad.html#abcf5c1dacc44b491a46040004177e1ad',1,'stan::agrad::lmgamma(int x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#af080723d19e8d4fa6dbe74cab69ee3f2',1,'stan::agrad::lmgamma(int a, const stan::agrad::var &b)'],['../namespacestan_1_1math.html#a0ee0706b2cb6d2e1da2c3b6041c06a56',1,'stan::math::lmgamma()']]], + ['lmgamma_2ehpp',['lmgamma.hpp',['../agrad_2fwd_2functions_2lmgamma_8hpp.html',1,'']]], + ['lmgamma_2ehpp',['lmgamma.hpp',['../agrad_2rev_2functions_2lmgamma_8hpp.html',1,'']]], + ['lmgamma_2ehpp',['lmgamma.hpp',['../math_2functions_2lmgamma_8hpp.html',1,'']]], + ['local_5fdecl_5f',['local_decl_',['../structstan_1_1gm_1_1statements.html#a277fff5acdb257537ee927d68d7fa139',1,'stan::gm::statements']]], + ['local_5forigin',['local_origin',['../namespacestan_1_1gm.html#ae5497a13c6ad9d782269f4b25fc7608a',1,'stan::gm']]], + ['local_5fvar_5fdecl_5fvisgen',['local_var_decl_visgen',['../structstan_1_1gm_1_1local__var__decl__visgen.html#a64a2e460136e91077c77fccef2b34c0d',1,'stan::gm::local_var_decl_visgen']]], + ['local_5fvar_5fdecl_5fvisgen',['local_var_decl_visgen',['../structstan_1_1gm_1_1local__var__decl__visgen.html',1,'stan::gm']]], + ['local_5fvar_5fdecls_5fr',['local_var_decls_r',['../structstan_1_1gm_1_1statement__grammar.html#ac5e7f4b79105a972ddfae455a7f28709',1,'stan::gm::statement_grammar']]], + ['log',['log',['../namespacestan_1_1agrad.html#ac98c1c298301701efe36438130bac705',1,'stan::agrad::log(const var &a)'],['../namespacestan_1_1agrad.html#a43089bcc90b7c1aaff44406aaa426e85',1,'stan::agrad::log(const fvar< T > &x)'],['../namespacestan_1_1math.html#ae3e7ce33064686ec2a2591fa5d4227cf',1,'stan::math::log()']]], + ['log_2ehpp',['log.hpp',['../agrad_2fwd_2functions_2log_8hpp.html',1,'']]], + ['log_2ehpp',['log.hpp',['../agrad_2rev_2functions_2log_8hpp.html',1,'']]], + ['log_2ehpp',['log.hpp',['../math_2matrix_2log_8hpp.html',1,'']]], + ['log10',['log10',['../namespacestan_1_1agrad.html#a6eb95bc79aff1cd13c794525c5a907e8',1,'stan::agrad::log10(const var &a)'],['../namespacestan_1_1agrad.html#aa63c2c14dbdb19b7edf2834b287a4676',1,'stan::agrad::log10(const fvar< T > &x)'],['../namespacestan_1_1math.html#a21f4f7c092e2bc9a089885628b86c004',1,'stan::math::log10()']]], + ['log10_2ehpp',['log10.hpp',['../fwd_2functions_2log10_8hpp.html',1,'']]], + ['log10_2ehpp',['log10.hpp',['../rev_2functions_2log10_8hpp.html',1,'']]], + ['log1m',['log1m',['../namespacestan_1_1agrad.html#af4be9cece7a9094512941604d195fafc',1,'stan::agrad::log1m(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#a428e6958e002b027bdbfe4a844a267a4',1,'stan::agrad::log1m(const stan::agrad::var &a)'],['../namespacestan_1_1math.html#a4f92092fb8a70b31d00898bbbe769612',1,'stan::math::log1m()']]], + ['log1m_2ehpp',['log1m.hpp',['../agrad_2fwd_2functions_2log1m_8hpp.html',1,'']]], + ['log1m_2ehpp',['log1m.hpp',['../agrad_2rev_2functions_2log1m_8hpp.html',1,'']]], + ['log1m_2ehpp',['log1m.hpp',['../math_2functions_2log1m_8hpp.html',1,'']]], + ['log1m_5fexp',['log1m_exp',['../namespacestan_1_1agrad.html#a501a03587bc86f5ec3745e9fbee6636a',1,'stan::agrad::log1m_exp(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#ab8a7bcd350916b80b3bd0e6633344861',1,'stan::agrad::log1m_exp(const stan::agrad::var &a)'],['../namespacestan_1_1math.html#a3ce261caf05bd371c430e82a0e6389a5',1,'stan::math::log1m_exp()']]], + ['log1m_5fexp_2ehpp',['log1m_exp.hpp',['../agrad_2fwd_2functions_2log1m__exp_8hpp.html',1,'']]], + ['log1m_5fexp_2ehpp',['log1m_exp.hpp',['../agrad_2rev_2functions_2log1m__exp_8hpp.html',1,'']]], + ['log1m_5fexp_2ehpp',['log1m_exp.hpp',['../math_2functions_2log1m__exp_8hpp.html',1,'']]], + ['log1m_5finv_5flogit',['log1m_inv_logit',['../namespacestan_1_1agrad.html#a4ef1d069b2a0b0e79e6a96096ced05a5',1,'stan::agrad::log1m_inv_logit()'],['../namespacestan_1_1math.html#ac7f71c696a5e0da4daab30e5f3704842',1,'stan::math::log1m_inv_logit()']]], + ['log1m_5finv_5flogit_2ehpp',['log1m_inv_logit.hpp',['../agrad_2fwd_2functions_2log1m__inv__logit_8hpp.html',1,'']]], + ['log1m_5finv_5flogit_2ehpp',['log1m_inv_logit.hpp',['../math_2functions_2log1m__inv__logit_8hpp.html',1,'']]], + ['log1p',['log1p',['../namespacestan_1_1agrad.html#a3e8efd5110369daca4516294e61113cc',1,'stan::agrad::log1p(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#a668283bab0c6bc04b5b106d236a2377a',1,'stan::agrad::log1p(const stan::agrad::var &a)'],['../namespacestan_1_1math.html#a5166d3c58ad8ce0aedbf104179888b69',1,'stan::math::log1p()']]], + ['log1p_2ehpp',['log1p.hpp',['../agrad_2fwd_2functions_2log1p_8hpp.html',1,'']]], + ['log1p_2ehpp',['log1p.hpp',['../agrad_2rev_2functions_2log1p_8hpp.html',1,'']]], + ['log1p_2ehpp',['log1p.hpp',['../math_2functions_2log1p_8hpp.html',1,'']]], + ['log1p_5fexp',['log1p_exp',['../namespacestan_1_1agrad.html#a1ff177e7dc2559a9f0e11b60aa024aac',1,'stan::agrad::log1p_exp(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#a10454c0b2b4185635d09ceb22bb1e8b0',1,'stan::agrad::log1p_exp(const stan::agrad::var &a)'],['../namespacestan_1_1math.html#a88151def26813dec3e04c4a8b9674091',1,'stan::math::log1p_exp()']]], + ['log1p_5fexp_2ehpp',['log1p_exp.hpp',['../agrad_2fwd_2functions_2log1p__exp_8hpp.html',1,'']]], + ['log1p_5fexp_2ehpp',['log1p_exp.hpp',['../agrad_2rev_2functions_2log1p__exp_8hpp.html',1,'']]], + ['log1p_5fexp_2ehpp',['log1p_exp.hpp',['../math_2functions_2log1p__exp_8hpp.html',1,'']]], + ['log2',['log2',['../namespacestan_1_1agrad.html#adc1fbe8f169e3dbaf05dce2399b87177',1,'stan::agrad::log2(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#aca9b147f7efd83ab91e1169324e42172',1,'stan::agrad::log2(const stan::agrad::var &a)'],['../namespacestan_1_1math.html#aa25e1572bf46e3a6b9ee270f0c7e2c4d',1,'stan::math::log2(const T a)'],['../namespacestan_1_1math.html#a947ba3fe3c87293f7c57395007100c79',1,'stan::math::log2()']]], + ['log2_2ehpp',['log2.hpp',['../agrad_2fwd_2functions_2log2_8hpp.html',1,'']]], + ['log2_2ehpp',['log2.hpp',['../agrad_2rev_2functions_2log2_8hpp.html',1,'']]], + ['log2_2ehpp',['log2.hpp',['../math_2functions_2log2_8hpp.html',1,'']]], + ['log_5f10',['LOG_10',['../namespacestan_1_1math.html#ab773773e2db53015eb48ab1730816fb5',1,'stan::math']]], + ['log_5f2',['LOG_2',['../namespacestan_1_1math.html#a43fb48f0a7f26bc60c1dfb572283b149',1,'stan::math']]], + ['log_5fabs_5fdet',['log_abs_det',['../classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4.html#a8c2f622cdd10422db6d9470c7799a189',1,'stan::math::LDLT_factor< double, R, C >']]], + ['log_5fdeterminant',['log_determinant',['../namespacestan_1_1agrad.html#a8a1d37f736333bd2c5e22f0ccb645e5c',1,'stan::agrad::log_determinant(const Eigen::Matrix< fvar< T >, R, C > &m)'],['../namespacestan_1_1agrad.html#a987a42c964cf999f61943d6811843964',1,'stan::agrad::log_determinant(const Eigen::Matrix< var, R, C > &m)'],['../namespacestan_1_1math.html#aca29dad18932e3ca17ac52fd0238b364',1,'stan::math::log_determinant()']]], + ['log_5fdeterminant_2ehpp',['log_determinant.hpp',['../math_2matrix_2log__determinant_8hpp.html',1,'']]], + ['log_5fdeterminant_2ehpp',['log_determinant.hpp',['../agrad_2fwd_2matrix_2log__determinant_8hpp.html',1,'']]], + ['log_5fdeterminant_2ehpp',['log_determinant.hpp',['../agrad_2rev_2matrix_2log__determinant_8hpp.html',1,'']]], + ['log_5fdeterminant_5fldlt',['log_determinant_ldlt',['../namespacestan_1_1agrad.html#a836b4fbc18e46a0b211c77362ee5ea7f',1,'stan::agrad::log_determinant_ldlt()'],['../namespacestan_1_1math.html#a306d737ee042b8f40e93713cd87fe48b',1,'stan::math::log_determinant_ldlt()']]], + ['log_5fdeterminant_5fspd',['log_determinant_spd',['../namespacestan_1_1agrad.html#acb47e4ac872b94a58defa619ba0b96e3',1,'stan::agrad::log_determinant_spd()'],['../namespacestan_1_1math.html#ae9a296d4414d0193108c70b350a05cfc',1,'stan::math::log_determinant_spd()']]], + ['log_5fdeterminant_5fspd_2ehpp',['log_determinant_spd.hpp',['../agrad_2rev_2matrix_2log__determinant__spd_8hpp.html',1,'']]], + ['log_5fdeterminant_5fspd_2ehpp',['log_determinant_spd.hpp',['../math_2matrix_2log__determinant__spd_8hpp.html',1,'']]], + ['log_5fdiff_5fexp',['log_diff_exp',['../namespacestan_1_1agrad.html#a8b63a8fd1ac87815107c75c405e810dd',1,'stan::agrad::log_diff_exp(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a5d5141fbaefe30307b79611c1391ca5c',1,'stan::agrad::log_diff_exp(const T1 &x1, const fvar< T2 > &x2)'],['../namespacestan_1_1agrad.html#a24844c12cad61f5e2ee54fe198347a98',1,'stan::agrad::log_diff_exp(const fvar< T1 > &x1, const T2 &x2)'],['../namespacestan_1_1agrad.html#a119e409264dfab429ffaa814ba6133c0',1,'stan::agrad::log_diff_exp(const stan::agrad::var &a, const stan::agrad::var &b)'],['../namespacestan_1_1agrad.html#a2475060db47484c7a076f404fbb2394d',1,'stan::agrad::log_diff_exp(const stan::agrad::var &a, const double &b)'],['../namespacestan_1_1agrad.html#a9a895635ca7f66a6bf4372fe314f2d21',1,'stan::agrad::log_diff_exp(const double &a, const stan::agrad::var &b)'],['../namespacestan_1_1math.html#aac1dbafd4c2a129415e86f868fc0979a',1,'stan::math::log_diff_exp()']]], + ['log_5fdiff_5fexp_2ehpp',['log_diff_exp.hpp',['../agrad_2fwd_2functions_2log__diff__exp_8hpp.html',1,'']]], + ['log_5fdiff_5fexp_2ehpp',['log_diff_exp.hpp',['../agrad_2rev_2functions_2log__diff__exp_8hpp.html',1,'']]], + ['log_5fdiff_5fexp_2ehpp',['log_diff_exp.hpp',['../math_2functions_2log__diff__exp_8hpp.html',1,'']]], + ['log_5ffalling_5ffactorial',['log_falling_factorial',['../namespacestan_1_1agrad.html#a0ffd034a1939c647aead3fdafae32afa',1,'stan::agrad::log_falling_factorial(const fvar< T > &x, const fvar< T > &n)'],['../namespacestan_1_1agrad.html#a21f6f947d6415c306ad111ef43981b90',1,'stan::agrad::log_falling_factorial(const double x, const fvar< T > &n)'],['../namespacestan_1_1agrad.html#ab039c4e5fecc51d8772b632c3a9acb53',1,'stan::agrad::log_falling_factorial(const fvar< T > &x, const double n)'],['../namespacestan_1_1agrad.html#aa5f969e2991f83a5e66a3f8822486215',1,'stan::agrad::log_falling_factorial(const var &a, const double &b)'],['../namespacestan_1_1agrad.html#a08dde4140ae5a400855918f6cd91e17e',1,'stan::agrad::log_falling_factorial(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#adebdfe1af8c92bcd3a142794c954316b',1,'stan::agrad::log_falling_factorial(const double &a, const var &b)'],['../namespacestan_1_1math.html#aa9cb2f3f6c73b2005d9e9fadbad415bf',1,'stan::math::log_falling_factorial()']]], + ['log_5ffalling_5ffactorial_2ehpp',['log_falling_factorial.hpp',['../agrad_2fwd_2functions_2log__falling__factorial_8hpp.html',1,'']]], + ['log_5ffalling_5ffactorial_2ehpp',['log_falling_factorial.hpp',['../agrad_2rev_2functions_2log__falling__factorial_8hpp.html',1,'']]], + ['log_5ffalling_5ffactorial_2ehpp',['log_falling_factorial.hpp',['../math_2functions_2log__falling__factorial_8hpp.html',1,'']]], + ['log_5finv_5flogit',['log_inv_logit',['../namespacestan_1_1agrad.html#a25aaaf2eca128514fc4cf52b59872658',1,'stan::agrad::log_inv_logit()'],['../namespacestan_1_1math.html#ad5be889d1ef4284654a04e400f5371a7',1,'stan::math::log_inv_logit()']]], + ['log_5finv_5flogit_2ehpp',['log_inv_logit.hpp',['../agrad_2fwd_2functions_2log__inv__logit_8hpp.html',1,'']]], + ['log_5finv_5flogit_2ehpp',['log_inv_logit.hpp',['../math_2functions_2log__inv__logit_8hpp.html',1,'']]], + ['log_5finv_5flogit_5fdiff',['log_inv_logit_diff',['../namespacestan_1_1prob.html#a76c814ad46314b38beb80a1a699617ef',1,'stan::prob']]], + ['log_5fpi_5fover_5ffour',['LOG_PI_OVER_FOUR',['../namespacestan_1_1math.html#a177764626d2378e0d7bdfb26aac187b6',1,'stan::math']]], + ['log_5fprob',['log_prob',['../classstan_1_1mcmc_1_1sample.html#a42aa100b16656e4904586f80ec028425',1,'stan::mcmc::sample']]], + ['log_5fprob_5f',['log_prob_',['../structstan_1_1gm_1_1increment__log__prob__statement.html#a7ba573d094c1453cf8e425eb2bf8a48e',1,'stan::gm::increment_log_prob_statement']]], + ['log_5fprob_5fgrad',['log_prob_grad',['../namespacestan_1_1model.html#aad33e9d6c10b589acbe6e527b5f9de80',1,'stan::model::log_prob_grad(const M &model, std::vector< double > &params_r, std::vector< int > &params_i, std::vector< double > &gradient, std::ostream *msgs=0)'],['../namespacestan_1_1model.html#aa8bbac348a197c17f86d57cc3a65e7d2',1,'stan::model::log_prob_grad(const M &model, Eigen::VectorXd &params_r, Eigen::VectorXd &gradient, std::ostream *msgs=0)']]], + ['log_5fprob_5fpropto',['log_prob_propto',['../namespacestan_1_1model.html#a4f75ba8738a5667a7abaef3871e14ca8',1,'stan::model::log_prob_propto(const M &model, std::vector< double > &params_r, std::vector< int > &params_i, std::ostream *msgs=0)'],['../namespacestan_1_1model.html#a0267095f157269950cfd3f1f402abe21',1,'stan::model::log_prob_propto(const M &model, Eigen::VectorXd &params_r, std::ostream *msgs=0)']]], + ['log_5frising_5ffactorial',['log_rising_factorial',['../namespacestan_1_1agrad.html#a3782da231c6c02f7ce65cf7b8a0d0b28',1,'stan::agrad::log_rising_factorial(const fvar< T > &x, const fvar< T > &n)'],['../namespacestan_1_1agrad.html#af00e8b62f7721b68f450588b1842d005',1,'stan::agrad::log_rising_factorial(const fvar< T > &x, const double n)'],['../namespacestan_1_1agrad.html#a58c0933b722f43bed32a6dd069716698',1,'stan::agrad::log_rising_factorial(const double x, const fvar< T > &n)'],['../namespacestan_1_1agrad.html#aa260d82a2cae776fafd0b65f40da2a91',1,'stan::agrad::log_rising_factorial(const var &a, const double &b)'],['../namespacestan_1_1agrad.html#aee3ad0a137a3ac1164ef4afbbfc3aa17',1,'stan::agrad::log_rising_factorial(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#af9ecc1f14a7e33f59a6349b37aeb6846',1,'stan::agrad::log_rising_factorial(const double &a, const var &b)'],['../namespacestan_1_1math.html#aaf23285d755661c14ca29c3ba935b77d',1,'stan::math::log_rising_factorial()']]], + ['log_5frising_5ffactorial_2ehpp',['log_rising_factorial.hpp',['../agrad_2fwd_2functions_2log__rising__factorial_8hpp.html',1,'']]], + ['log_5frising_5ffactorial_2ehpp',['log_rising_factorial.hpp',['../math_2functions_2log__rising__factorial_8hpp.html',1,'']]], + ['log_5frising_5ffactorial_2ehpp',['log_rising_factorial.hpp',['../agrad_2rev_2functions_2log__rising__factorial_8hpp.html',1,'']]], + ['log_5fsoftmax',['log_softmax',['../namespacestan_1_1agrad.html#a1669a67b8247ae502926890376c2b68b',1,'stan::agrad::log_softmax(const Eigen::Matrix< fvar< T >, Eigen::Dynamic, 1 > &alpha)'],['../namespacestan_1_1agrad.html#adcaa1e54a0acf38f7a8f10a1bc33e8df',1,'stan::agrad::log_softmax(const Eigen::Matrix< var, Eigen::Dynamic, 1 > &alpha)'],['../namespacestan_1_1math.html#a011a8c8bb83f9b6c700a725240be33b5',1,'stan::math::log_softmax()']]], + ['log_5fsoftmax_2ehpp',['log_softmax.hpp',['../agrad_2rev_2matrix_2log__softmax_8hpp.html',1,'']]], + ['log_5fsoftmax_2ehpp',['log_softmax.hpp',['../math_2matrix_2log__softmax_8hpp.html',1,'']]], + ['log_5fsoftmax_2ehpp',['log_softmax.hpp',['../agrad_2fwd_2matrix_2log__softmax_8hpp.html',1,'']]], + ['log_5fsum_5fexp',['log_sum_exp',['../namespacestan_1_1agrad.html#a6cd9f7f4203d0dd299489be37445b5e1',1,'stan::agrad::log_sum_exp(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a65accd2105cd3b00e370ba7ba2de38e4',1,'stan::agrad::log_sum_exp(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#ac8761a5b8672071d99b5c7cc8dea3276',1,'stan::agrad::log_sum_exp(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#a3d1039fe876efe94f6a8d40f9d1c96cd',1,'stan::agrad::log_sum_exp(const std::vector< fvar< T > > &v)'],['../namespacestan_1_1agrad.html#a5df6229f0b30f3b43f5c6b4744acc62c',1,'stan::agrad::log_sum_exp(const Eigen::Matrix< fvar< T >, R, C > &v)'],['../namespacestan_1_1agrad.html#ac64b74224b38e3bcff5e33c2ffdb673e',1,'stan::agrad::log_sum_exp(const stan::agrad::var &a, const stan::agrad::var &b)'],['../namespacestan_1_1agrad.html#af6960e01ec13ad3bffda2295e5f10c33',1,'stan::agrad::log_sum_exp(const stan::agrad::var &a, const double &b)'],['../namespacestan_1_1agrad.html#a845f5338275b390a8eeedb3e66f097f8',1,'stan::agrad::log_sum_exp(const double &a, const stan::agrad::var &b)'],['../namespacestan_1_1agrad.html#a5706fda535b2473b48024f50ce69be18',1,'stan::agrad::log_sum_exp(const std::vector< var > &x)'],['../namespacestan_1_1agrad.html#a902892cf9092c81ee4d26c54ba672c38',1,'stan::agrad::log_sum_exp(const Eigen::Matrix< var, R, C > &x)'],['../namespacestan_1_1math.html#a3c5f32f7cd1a5690a697f4031df569c4',1,'stan::math::log_sum_exp(const T2 &a, const T1 &b)'],['../namespacestan_1_1math.html#ae5513861b48f8649938d82883b58170c',1,'stan::math::log_sum_exp(const std::vector< T > &x)'],['../namespacestan_1_1math.html#a6205ce595af6efac8746bd83b2b761da',1,'stan::math::log_sum_exp(const Eigen::Matrix< T, R, C > &x)']]], + ['log_5fsum_5fexp_2ehpp',['log_sum_exp.hpp',['../agrad_2fwd_2functions_2log__sum__exp_8hpp.html',1,'']]], + ['log_5fsum_5fexp_2ehpp',['log_sum_exp.hpp',['../agrad_2fwd_2matrix_2log__sum__exp_8hpp.html',1,'']]], + ['log_5fsum_5fexp_2ehpp',['log_sum_exp.hpp',['../agrad_2rev_2functions_2log__sum__exp_8hpp.html',1,'']]], + ['log_5fsum_5fexp_2ehpp',['log_sum_exp.hpp',['../agrad_2rev_2matrix_2log__sum__exp_8hpp.html',1,'']]], + ['log_5fsum_5fexp_2ehpp',['log_sum_exp.hpp',['../math_2functions_2log__sum__exp_8hpp.html',1,'']]], + ['log_5fsum_5fexp_2ehpp',['log_sum_exp.hpp',['../math_2matrix_2log__sum__exp_8hpp.html',1,'']]], + ['log_5fu',['log_u',['../structstan_1_1mcmc_1_1nuts__util.html#a825716d6d5b78da51a930844d3b33ccf',1,'stan::mcmc::nuts_util']]], + ['logical_5fand',['logical_and',['../namespacestan_1_1math.html#adc35bab2db89b3ceda66f11e1fa53ec8',1,'stan::math']]], + ['logical_5fand_2ehpp',['logical_and.hpp',['../logical__and_8hpp.html',1,'']]], + ['logical_5feq',['logical_eq',['../namespacestan_1_1math.html#ab2213736b55fd6696fa0120fd3fe72e4',1,'stan::math']]], + ['logical_5feq_2ehpp',['logical_eq.hpp',['../logical__eq_8hpp.html',1,'']]], + ['logical_5fgt',['logical_gt',['../namespacestan_1_1math.html#aba86bfd994302061a0260e1202fca777',1,'stan::math']]], + ['logical_5fgt_2ehpp',['logical_gt.hpp',['../logical__gt_8hpp.html',1,'']]], + ['logical_5fgte',['logical_gte',['../namespacestan_1_1math.html#ac6bb0b8623192207d35e207ea312d8be',1,'stan::math']]], + ['logical_5fgte_2ehpp',['logical_gte.hpp',['../logical__gte_8hpp.html',1,'']]], + ['logical_5flt',['logical_lt',['../namespacestan_1_1math.html#a0b5bd91412749e10933f304b54aef88f',1,'stan::math']]], + ['logical_5flt_2ehpp',['logical_lt.hpp',['../logical__lt_8hpp.html',1,'']]], + ['logical_5flte',['logical_lte',['../namespacestan_1_1math.html#af3649d4c704962c4502cd6220a5e2230',1,'stan::math']]], + ['logical_5flte_2ehpp',['logical_lte.hpp',['../logical__lte_8hpp.html',1,'']]], + ['logical_5fnegate_5fexpr',['logical_negate_expr',['../structstan_1_1gm_1_1logical__negate__expr.html',1,'stan::gm']]], + ['logical_5fnegate_5fexpr_5ff',['logical_negate_expr_f',['../namespacestan_1_1gm.html#a5d5139168f13961e213defe8bd85ba16',1,'stan::gm']]], + ['logical_5fnegation',['logical_negation',['../namespacestan_1_1math.html#aad2fc9ce55dfac079d930335beb7e4a8',1,'stan::math']]], + ['logical_5fnegation_2ehpp',['logical_negation.hpp',['../logical__negation_8hpp.html',1,'']]], + ['logical_5fneq',['logical_neq',['../namespacestan_1_1math.html#a206eb210d8e7e2c718af25c40de8f9d1',1,'stan::math']]], + ['logical_5fneq_2ehpp',['logical_neq.hpp',['../logical__neq_8hpp.html',1,'']]], + ['logical_5for',['logical_or',['../namespacestan_1_1math.html#ac74007e2d5f55d5ae4a308f535869aee',1,'stan::math']]], + ['logical_5for_2ehpp',['logical_or.hpp',['../logical__or_8hpp.html',1,'']]], + ['logistic_2ehpp',['logistic.hpp',['../logistic_8hpp.html',1,'']]], + ['logistic_5fccdf_5flog',['logistic_ccdf_log',['../namespacestan_1_1prob.html#aeff91e2efd57e631955cb7ebde45a1c7',1,'stan::prob']]], + ['logistic_5fcdf',['logistic_cdf',['../namespacestan_1_1prob.html#ac2a1d5c2316209f3a4d6cc90f3f3b6cf',1,'stan::prob']]], + ['logistic_5fcdf_5flog',['logistic_cdf_log',['../namespacestan_1_1prob.html#aca4c773da2a18fac3e13b91e51e9e18d',1,'stan::prob']]], + ['logistic_5flog',['logistic_log',['../namespacestan_1_1prob.html#a33be4a206231be2a1acda61c06c05039',1,'stan::prob::logistic_log(const T_y &y, const T_loc &mu, const T_scale &sigma)'],['../namespacestan_1_1prob.html#abfa731b9fd1d7ba996e1e5f9eb6e847f',1,'stan::prob::logistic_log(const T_y &y, const T_loc &mu, const T_scale &sigma)']]], + ['logistic_5frng',['logistic_rng',['../namespacestan_1_1prob.html#a664843596a52a9bc23dc5f2073f9806b',1,'stan::prob']]], + ['logit',['logit',['../namespacestan_1_1agrad.html#ab43cf2fb570203a8492c272da3d2922f',1,'stan::agrad::logit()'],['../namespacestan_1_1math.html#a53342d0c2cd3a6e440c533070054aca3',1,'stan::math::logit()']]], + ['logit_2ehpp',['logit.hpp',['../agrad_2fwd_2functions_2logit_8hpp.html',1,'']]], + ['logit_2ehpp',['logit.hpp',['../math_2functions_2logit_8hpp.html',1,'']]], + ['lognormal_2ehpp',['lognormal.hpp',['../lognormal_8hpp.html',1,'']]], + ['lognormal_5fccdf_5flog',['lognormal_ccdf_log',['../namespacestan_1_1prob.html#a576b250e68b4cc83d9df5d697eb57fa2',1,'stan::prob']]], + ['lognormal_5fcdf',['lognormal_cdf',['../namespacestan_1_1prob.html#af50822e781206859400fb659831eb000',1,'stan::prob']]], + ['lognormal_5fcdf_5flog',['lognormal_cdf_log',['../namespacestan_1_1prob.html#aa7a25fc347587649f2ca55656fb23950',1,'stan::prob']]], + ['lognormal_5flog',['lognormal_log',['../namespacestan_1_1prob.html#a72c3cfe83f1bfa2a71d146dde0cc865e',1,'stan::prob::lognormal_log(const T_y &y, const T_loc &mu, const T_scale &sigma)'],['../namespacestan_1_1prob.html#a47dbe7f1b8096c72c8dc40496b9f082d',1,'stan::prob::lognormal_log(const T_y &y, const T_loc &mu, const T_scale &sigma)']]], + ['lognormal_5frng',['lognormal_rng',['../namespacestan_1_1prob.html#a9dbaae05c716d93b29dfc3f00f26d4ed',1,'stan::prob']]], + ['logp',['logp',['../classstan_1_1optimization_1_1_b_f_g_s_line_search.html#a6750ef181409d006239e8693a60daa85',1,'stan::optimization::BFGSLineSearch::logp()'],['../classstan_1_1optimization_1_1_nesterov_gradient.html#af86f9e2d5da6465c6fdaa435a7c48886',1,'stan::optimization::NesterovGradient::logp()']]], + ['low_5f',['low_',['../structstan_1_1gm_1_1range.html#a9b009f03d27b53ed652e22fbf5932d97',1,'stan::gm::range']]], + ['lowest',['lowest',['../struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html#a14cfab12cd9b5df0f0663a7bb07fa35d',1,'Eigen::NumTraits< stan::agrad::var >']]], + ['lp_5fno_5fjacobian',['lp_no_jacobian',['../namespacestan_1_1optimization.html#a03faddd9bfe31c6237e1ce662d3f3d2d',1,'stan::optimization']]], + ['lub_5fconstrain',['lub_constrain',['../namespacestan_1_1prob.html#a7333ecac8eb1a974e758a134f30fbf7b',1,'stan::prob::lub_constrain(const T x, TL lb, TU ub)'],['../namespacestan_1_1prob.html#af8825917ff4f4875b7820edc760e4440',1,'stan::prob::lub_constrain(const T x, const TL lb, const TU ub, T &lp)']]], + ['lub_5ffree',['lub_free',['../namespacestan_1_1prob.html#a4e48912671137a74815f5194163279c9',1,'stan::prob']]] +]; diff --git a/doc/api/html/search/all_6d.html b/doc/api/html/search/all_6d.html new file mode 100644 index 00000000000..2e27d4d647d --- /dev/null +++ b/doc/api/html/search/all_6d.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/all_6d.js b/doc/api/html/search/all_6d.js new file mode 100644 index 00000000000..0de670b496f --- /dev/null +++ b/doc/api/html/search/all_6d.js @@ -0,0 +1,148 @@ +var searchData= +[ + ['m_5f',['M_',['../structstan_1_1gm_1_1vector__var__decl.html#a2a503a710912ec9280682c48252c673f',1,'stan::gm::vector_var_decl::M_()'],['../structstan_1_1gm_1_1matrix__var__decl.html#ac65e9e100b4199313535f4ce92e7c583',1,'stan::gm::matrix_var_decl::M_()'],['../structstan_1_1gm_1_1cholesky__factor__var__decl.html#a20ba381f18b44d1cd09bf468eb957eb0',1,'stan::gm::cholesky_factor_var_decl::M_()'],['../agrad_2rev_2matrix_2ldlt_8hpp.html#ac7022caeebffc39337bdfd893db75983',1,'M_(): ldlt.hpp'],['../agrad_2rev_2matrix_2mdivide__left_8hpp.html#ac7022caeebffc39337bdfd893db75983',1,'M_(): mdivide_left.hpp'],['../agrad_2rev_2matrix_2mdivide__left__spd_8hpp.html#ac7022caeebffc39337bdfd893db75983',1,'M_(): mdivide_left_spd.hpp'],['../agrad_2rev_2matrix_2mdivide__left__tri_8hpp.html#ac7022caeebffc39337bdfd893db75983',1,'M_(): mdivide_left_tri.hpp']]], + ['machine_5fprecision',['machine_precision',['../namespacestan_1_1math.html#a173839dddd0a8ac8afa710b9e3d5008a',1,'stan::math']]], + ['main',['main',['../print_8cpp.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]): print.cpp'],['../stanc_8cpp.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]): stanc.cpp']]], + ['mainpage_2edox',['mainpage.dox',['../mainpage_8dox.html',1,'']]], + ['major_5fversion',['MAJOR_VERSION',['../namespacestan.html#a75c4bb3d494fafd9d1714d4db258975c',1,'stan']]], + ['make_5fnu',['make_nu',['../namespacestan_1_1prob.html#a4aae2e874c72677ddb53ec9bdec1c29d',1,'stan::prob']]], + ['map_5f',['map_',['../structstan_1_1gm_1_1variable__map.html#a1473c759fc630466b193cbcb6a128cc7',1,'stan::gm::variable_map']]], + ['map_5fmatrix_5ft',['map_matrix_t',['../classstan_1_1io_1_1reader.html#a05f161f2ef596f356d249afbb0b43ca6',1,'stan::io::reader']]], + ['map_5frow_5fvector_5ft',['map_row_vector_t',['../classstan_1_1io_1_1reader.html#a71946c44faafcf4669f3cfde52816633',1,'stan::io::reader']]], + ['map_5fvector_5ft',['map_vector_t',['../classstan_1_1io_1_1reader.html#a1285611f704d4a3ec0d0e10ff98206d4',1,'stan::io::reader']]], + ['math_2ehpp',['math.hpp',['../math_8hpp.html',1,'']]], + ['matrix',['matrix',['../classstan_1_1io_1_1reader.html#afd2aeccae677df87006d976cbcae9fd2',1,'stan::io::reader']]], + ['matrix_2ehpp',['matrix.hpp',['../agrad_2rev_2error__handling_2matrix_8hpp.html',1,'']]], + ['matrix_2ehpp',['matrix.hpp',['../agrad_2rev_2matrix_8hpp.html',1,'']]], + ['matrix_2ehpp',['matrix.hpp',['../math_2matrix_8hpp.html',1,'']]], + ['matrix_2ehpp',['matrix.hpp',['../agrad_2fwd_2matrix_8hpp.html',1,'']]], + ['matrix_5fconstrain',['matrix_constrain',['../classstan_1_1io_1_1reader.html#a72043393997619c044478ced8a867f69',1,'stan::io::reader::matrix_constrain(size_t m, size_t n)'],['../classstan_1_1io_1_1reader.html#a44a9e74ffa53964f23173a5c31e798c8',1,'stan::io::reader::matrix_constrain(size_t m, size_t n, T &)']]], + ['matrix_5fd',['matrix_d',['../namespacestan_1_1math.html#ac1a24821b475ee296830ebac12f70460',1,'stan::math::matrix_d()'],['../namespacestan_1_1optimization.html#afd985f1c123f049985ad18ad074474c4',1,'stan::optimization::matrix_d()']]], + ['matrix_5fdecl_5fr',['matrix_decl_r',['../structstan_1_1gm_1_1var__decls__grammar.html#ae0a681145e09c4810cebdb1a43024b0f',1,'stan::gm::var_decls_grammar']]], + ['matrix_5ferror_5fhandling_2ehpp',['matrix_error_handling.hpp',['../matrix__error__handling_8hpp.html',1,'']]], + ['matrix_5ffd',['matrix_fd',['../namespacestan_1_1agrad.html#a9568a3aa8bbf0ba6c2e96ab703e83184',1,'stan::agrad']]], + ['matrix_5fffd',['matrix_ffd',['../namespacestan_1_1agrad.html#aff56af7392587b36f7071967f87ad7d1',1,'stan::agrad']]], + ['matrix_5fffv',['matrix_ffv',['../namespacestan_1_1agrad.html#a3e6bc2f7c13dfbbb0c30dce6dcb62951',1,'stan::agrad']]], + ['matrix_5ffv',['matrix_fv',['../namespacestan_1_1agrad.html#aac5f57e2caa5ea24203633335cfe3fc6',1,'stan::agrad']]], + ['matrix_5findex',['matrix_index',['../print_8hpp.html#ac6106c19828c8abe37b2bb9dc66ce82b',1,'matrix_index(stan::mcmc::chains<> &chains, const int index): print.hpp'],['../print_8hpp.html#abb3cd74cdc531aef4a85bed5fca26c26',1,'matrix_index(std::vector< int > &index, const std::vector< int > &dims): print.hpp']]], + ['matrix_5flb',['matrix_lb',['../classstan_1_1io_1_1reader.html#afcad89dd91b23010956526b523ed8c95',1,'stan::io::reader']]], + ['matrix_5flb_5fconstrain',['matrix_lb_constrain',['../classstan_1_1io_1_1reader.html#a79b98ecf881169d6dd480caa096c0ed8',1,'stan::io::reader::matrix_lb_constrain(const TL lb, size_t m, size_t n)'],['../classstan_1_1io_1_1reader.html#a9b119826c47b45fa83df1758de07c5ff',1,'stan::io::reader::matrix_lb_constrain(const TL lb, size_t m, size_t n, T &lp)']]], + ['matrix_5flb_5funconstrain',['matrix_lb_unconstrain',['../classstan_1_1io_1_1writer.html#a73a1d50b227b9488dc28ee98847aa100',1,'stan::io::writer']]], + ['matrix_5flub',['matrix_lub',['../classstan_1_1io_1_1reader.html#a13209c64b39d9c7515fb561ec788a516',1,'stan::io::reader']]], + ['matrix_5flub_5fconstrain',['matrix_lub_constrain',['../classstan_1_1io_1_1reader.html#a9007b1739c9738d88347f499e9a39021',1,'stan::io::reader::matrix_lub_constrain(const TL lb, const TU ub, size_t m, size_t n)'],['../classstan_1_1io_1_1reader.html#a7b8a944a6d7ff2ea53cf7a3e78843306',1,'stan::io::reader::matrix_lub_constrain(const TL lb, const TU ub, size_t m, size_t n, T &lp)']]], + ['matrix_5flub_5funconstrain',['matrix_lub_unconstrain',['../classstan_1_1io_1_1writer.html#a0f4b5839e3bd701f2c586e7d31bb0dbf',1,'stan::io::writer']]], + ['matrix_5fnormal_2ehpp',['matrix_normal.hpp',['../matrix__normal_8hpp.html',1,'']]], + ['matrix_5fnormal_5fprec_5flog',['matrix_normal_prec_log',['../namespacestan_1_1prob.html#a04ca61f93c3e75f12a7dafbbb2964069',1,'stan::prob::matrix_normal_prec_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_Mu, Eigen::Dynamic, Eigen::Dynamic > &Mu, const Eigen::Matrix< T_Sigma, Eigen::Dynamic, Eigen::Dynamic > &Sigma, const Eigen::Matrix< T_D, Eigen::Dynamic, Eigen::Dynamic > &D)'],['../namespacestan_1_1prob.html#a225aae36a6e9611cdba3b36e20225a5a',1,'stan::prob::matrix_normal_prec_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_Mu, Eigen::Dynamic, Eigen::Dynamic > &Mu, const Eigen::Matrix< T_Sigma, Eigen::Dynamic, Eigen::Dynamic > &Sigma, const Eigen::Matrix< T_D, Eigen::Dynamic, Eigen::Dynamic > &D)']]], + ['matrix_5ft',['matrix_t',['../classstan_1_1io_1_1reader.html#aded74129931435c293b0fd0885535d93',1,'stan::io::reader::matrix_t()'],['../classstan_1_1io_1_1writer.html#aadbf07fa0a161b2037f3dfbe0548f263',1,'stan::io::writer::matrix_t()'],['../namespacestan_1_1gm.html#af68190cae932b66ca3aa3c56bc2b0dc6',1,'stan::gm::MATRIX_T()']]], + ['matrix_5fub',['matrix_ub',['../classstan_1_1io_1_1reader.html#a280b0c933f7dae06f472e56432b45489',1,'stan::io::reader']]], + ['matrix_5fub_5fconstrain',['matrix_ub_constrain',['../classstan_1_1io_1_1reader.html#af70a11c24ac7cfba146d0864a05dcf9a',1,'stan::io::reader::matrix_ub_constrain(const TU ub, size_t m, size_t n)'],['../classstan_1_1io_1_1reader.html#ace55576f9257795f986494e343c11978',1,'stan::io::reader::matrix_ub_constrain(const TU ub, size_t m, size_t n, T &lp)']]], + ['matrix_5fub_5funconstrain',['matrix_ub_unconstrain',['../classstan_1_1io_1_1writer.html#a098679782a22794d929d982a1f1a147b',1,'stan::io::writer']]], + ['matrix_5funconstrain',['matrix_unconstrain',['../classstan_1_1io_1_1writer.html#a1120b4bda9918cce7944b2b857bed5f9',1,'stan::io::writer']]], + ['matrix_5fv',['matrix_v',['../namespacestan_1_1agrad.html#a31a0e0ac129c0a7d965b1fb17301c942',1,'stan::agrad']]], + ['matrix_5fvar_5fdecl',['matrix_var_decl',['../structstan_1_1gm_1_1matrix__var__decl.html#a80c7b9b96497a250e4b9861131e515aa',1,'stan::gm::matrix_var_decl::matrix_var_decl()'],['../structstan_1_1gm_1_1matrix__var__decl.html#a4a99b5bb963daaeba872633b7753ffff',1,'stan::gm::matrix_var_decl::matrix_var_decl(range const &range, expression const &M, expression const &N, std::string const &name, std::vector< expression > const &dims)']]], + ['matrix_5fvar_5fdecl',['matrix_var_decl',['../structstan_1_1gm_1_1matrix__var__decl.html',1,'stan::gm']]], + ['matrix_5fvari_2ehpp',['matrix_vari.hpp',['../matrix__vari_8hpp.html',1,'']]], + ['max',['max',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#ab5052559ef909e48342d86185079a8f3',1,'std::numeric_limits< stan::agrad::fvar< T > >::max()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a133cb21b688f8be5f5d86b523d2848c1',1,'std::numeric_limits< stan::agrad::var >::max()'],['../namespacestan_1_1math.html#a86b6be1d580b3b5cf4b4f57546062352',1,'stan::math::max(const double a, const double b)'],['../namespacestan_1_1math.html#a5da0ef87756d3dbd20ca4ff5a3efa10d',1,'stan::math::max(const std::vector< int > &x)'],['../namespacestan_1_1math.html#acde414919e0e4dcfa72d565679819091',1,'stan::math::max(const std::vector< T > &x)'],['../namespacestan_1_1math.html#ae3f299773dc20e8305fc16df1be8d029',1,'stan::math::max(const Eigen::Matrix< T, R, C > &m)']]], + ['max_2ehpp',['max.hpp',['../functions_2max_8hpp.html',1,'']]], + ['max_2ehpp',['max.hpp',['../matrix_2max_8hpp.html',1,'']]], + ['max_5fexponent',['max_exponent',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a20ce95f45b11a6e1649fe88ed29e9c18',1,'std::numeric_limits< stan::agrad::fvar< T > >::max_exponent()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a8cfd734ee404aa28cf57f64d24d192d7',1,'std::numeric_limits< stan::agrad::var >::max_exponent()']]], + ['max_5fexponent10',['max_exponent10',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#aa7f994271a89f8f913680464f37e1033',1,'std::numeric_limits< stan::agrad::fvar< T > >::max_exponent10()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#ac513d112aece630b48c538b6ac397b13',1,'std::numeric_limits< stan::agrad::var >::max_exponent10()']]], + ['max_5fsize',['max_size',['../namespacestan.html#a8b2c79a3a686dcf90566be8492e1065d',1,'stan::max_size(const T1 &x1, const T2 &x2)'],['../namespacestan.html#ac5ca4bf16c3b5c453162473c67f844bb',1,'stan::max_size(const T1 &x1, const T2 &x2, const T3 &x3)'],['../namespacestan.html#afff0e381090b0d490dc3b23f3eaf8846',1,'stan::max_size(const T1 &x1, const T2 &x2, const T3 &x3, const T4 &x4)']]], + ['maxits',['maxIts',['../structstan_1_1optimization_1_1_b_f_g_s_minimizer_1_1_b_f_g_s_options.html#af876cbedf84144450e0762520e9ff191',1,'stan::optimization::BFGSMinimizer::BFGSOptions']]], + ['mcmc_2ehpp',['mcmc.hpp',['../mcmc_8hpp.html',1,'']]], + ['mcmc_5fwriter',['mcmc_writer',['../classstan_1_1io_1_1mcmc__writer.html',1,'stan::io']]], + ['mcmc_5fwriter',['mcmc_writer',['../classstan_1_1io_1_1mcmc__writer.html#a6a688bb1b2851d68f7305cb97c750a2b',1,'stan::io::mcmc_writer']]], + ['mcmc_5fwriter_2ehpp',['mcmc_writer.hpp',['../mcmc__writer_8hpp.html',1,'']]], + ['mdivide_5fleft',['mdivide_left',['../namespacestan_1_1agrad.html#a2b41bf2c8372fd934837bcab95ea6218',1,'stan::agrad::mdivide_left(const Eigen::Matrix< fvar< T >, R1, C1 > &A, const Eigen::Matrix< fvar< T >, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#aa1da8d6fb0170dddd868c37b4ae0e243',1,'stan::agrad::mdivide_left(const Eigen::Matrix< double, R1, C1 > &A, const Eigen::Matrix< fvar< T >, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#a9c7cffeb1a3590e2bc9803e2b9b96e57',1,'stan::agrad::mdivide_left(const Eigen::Matrix< fvar< T >, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#a290e23ab6f9674cb1400b32a1cadd61b',1,'stan::agrad::mdivide_left(const Eigen::Matrix< var, R1, C1 > &A, const Eigen::Matrix< var, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#ad17f36acd5401a8f3d83410055cacd5b',1,'stan::agrad::mdivide_left(const Eigen::Matrix< var, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#a35f1d7800586ac5f5c1930627c2ed408',1,'stan::agrad::mdivide_left(const Eigen::Matrix< double, R1, C1 > &A, const Eigen::Matrix< var, R2, C2 > &b)'],['../namespacestan_1_1math.html#a7266758367e8260b2afbfaeea7d5b418',1,'stan::math::mdivide_left()']]], + ['mdivide_5fleft_2ehpp',['mdivide_left.hpp',['../agrad_2fwd_2matrix_2mdivide__left_8hpp.html',1,'']]], + ['mdivide_5fleft_2ehpp',['mdivide_left.hpp',['../agrad_2rev_2matrix_2mdivide__left_8hpp.html',1,'']]], + ['mdivide_5fleft_2ehpp',['mdivide_left.hpp',['../math_2matrix_2mdivide__left_8hpp.html',1,'']]], + ['mdivide_5fleft_5fldlt',['mdivide_left_ldlt',['../namespacestan_1_1agrad.html#a73fe08a0aed98a06f69afd7efdcf7e91',1,'stan::agrad::mdivide_left_ldlt(const stan::math::LDLT_factor< var, R1, C1 > &A, const Eigen::Matrix< var, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#aca6cefcad36a0a43763634d7e399192e',1,'stan::agrad::mdivide_left_ldlt(const stan::math::LDLT_factor< var, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#a2cd1fc34cc6a308373729f667a21a243',1,'stan::agrad::mdivide_left_ldlt(const stan::math::LDLT_factor< double, R1, C1 > &A, const Eigen::Matrix< var, R2, C2 > &b)'],['../namespacestan_1_1math.html#a978022fb9cb20fd35f6e9e89ab3bc871',1,'stan::math::mdivide_left_ldlt()']]], + ['mdivide_5fleft_5fspd',['mdivide_left_spd',['../namespacestan_1_1agrad.html#a20ea5c1fbce1ed4ad4d54fc8f2c558c2',1,'stan::agrad::mdivide_left_spd(const Eigen::Matrix< var, R1, C1 > &A, const Eigen::Matrix< var, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#a03fc1f8557646c3d1b11483a1f14c6de',1,'stan::agrad::mdivide_left_spd(const Eigen::Matrix< var, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#aec4a59ebe9eae939784d0a7e202bd7de',1,'stan::agrad::mdivide_left_spd(const Eigen::Matrix< double, R1, C1 > &A, const Eigen::Matrix< var, R2, C2 > &b)'],['../namespacestan_1_1math.html#a0c8c6e72f1cbf2b73008d4fc98de1abe',1,'stan::math::mdivide_left_spd()']]], + ['mdivide_5fleft_5fspd_2ehpp',['mdivide_left_spd.hpp',['../agrad_2rev_2matrix_2mdivide__left__spd_8hpp.html',1,'']]], + ['mdivide_5fleft_5fspd_2ehpp',['mdivide_left_spd.hpp',['../math_2matrix_2mdivide__left__spd_8hpp.html',1,'']]], + ['mdivide_5fleft_5ftri',['mdivide_left_tri',['../namespacestan_1_1agrad.html#a4cc1b5631c20f7a48b973d5ca0418c34',1,'stan::agrad::mdivide_left_tri(const Eigen::Matrix< var, R1, C1 > &A, const Eigen::Matrix< var, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#a97be1bb5da2a12a36c9d32235d59bd5f',1,'stan::agrad::mdivide_left_tri(const Eigen::Matrix< double, R1, C1 > &A, const Eigen::Matrix< var, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#aac856c62d730cb5880add59627d59d5a',1,'stan::agrad::mdivide_left_tri(const Eigen::Matrix< var, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)'],['../namespacestan_1_1math.html#ac9ffa799f8af2cd4941cbd2506bc4573',1,'stan::math::mdivide_left_tri(const Eigen::Matrix< T1, R1, C1 > &A, const Eigen::Matrix< T2, R2, C2 > &b)'],['../namespacestan_1_1math.html#a58dbd828faf06c2ef74152367f749ca4',1,'stan::math::mdivide_left_tri(const Eigen::Matrix< T, R1, C1 > &A)']]], + ['mdivide_5fleft_5ftri_2ehpp',['mdivide_left_tri.hpp',['../agrad_2rev_2matrix_2mdivide__left__tri_8hpp.html',1,'']]], + ['mdivide_5fleft_5ftri_2ehpp',['mdivide_left_tri.hpp',['../math_2matrix_2mdivide__left__tri_8hpp.html',1,'']]], + ['mdivide_5fleft_5ftri_5flow',['mdivide_left_tri_low',['../namespacestan_1_1agrad.html#a4976e3da1ade5b442fdf9a98ce657e1b',1,'stan::agrad::mdivide_left_tri_low(const Eigen::Matrix< fvar< T >, R1, C1 > &A, const Eigen::Matrix< fvar< T >, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#a4cae5cb645fe5bc960315f994d2cce24',1,'stan::agrad::mdivide_left_tri_low(const Eigen::Matrix< double, R1, C1 > &A, const Eigen::Matrix< fvar< T >, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#a88989bbd44ec90171c52d78cf99fa37f',1,'stan::agrad::mdivide_left_tri_low(const Eigen::Matrix< fvar< T >, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)'],['../namespacestan_1_1math.html#a199a9357715dff8b9a3bae8cc1bb4aa5',1,'stan::math::mdivide_left_tri_low(const Eigen::Matrix< T1, R1, C1 > &A, const Eigen::Matrix< T2, R2, C2 > &b)'],['../namespacestan_1_1math.html#ae8391d23da9e29f3420fdb89116e83cd',1,'stan::math::mdivide_left_tri_low(const Eigen::Matrix< T, R1, C1 > &A)']]], + ['mdivide_5fleft_5ftri_5flow_2ehpp',['mdivide_left_tri_low.hpp',['../agrad_2fwd_2matrix_2mdivide__left__tri__low_8hpp.html',1,'']]], + ['mdivide_5fleft_5ftri_5flow_2ehpp',['mdivide_left_tri_low.hpp',['../math_2matrix_2mdivide__left__tri__low_8hpp.html',1,'']]], + ['mdivide_5fright',['mdivide_right',['../namespacestan_1_1agrad.html#a92e113c418aa00fb0b0f05de3421a377',1,'stan::agrad::mdivide_right(const Eigen::Matrix< fvar< T >, R1, C1 > &A, const Eigen::Matrix< fvar< T >, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#ab1bf56872a19067bf76e9e0ae0319ff3',1,'stan::agrad::mdivide_right(const Eigen::Matrix< fvar< T >, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#ad4d1ebb9e641da4b6d03b08eac67469c',1,'stan::agrad::mdivide_right(const Eigen::Matrix< double, R1, C1 > &A, const Eigen::Matrix< fvar< T >, R2, C2 > &b)'],['../namespacestan_1_1math.html#a5efba9dddcf77889b66c1210ba55cf5f',1,'stan::math::mdivide_right()']]], + ['mdivide_5fright_2ehpp',['mdivide_right.hpp',['../agrad_2fwd_2matrix_2mdivide__right_8hpp.html',1,'']]], + ['mdivide_5fright_2ehpp',['mdivide_right.hpp',['../math_2matrix_2mdivide__right_8hpp.html',1,'']]], + ['mdivide_5fright_5fldlt',['mdivide_right_ldlt',['../namespacestan_1_1math.html#a68c862e90d97ea5d5552101b65978813',1,'stan::math::mdivide_right_ldlt(const Eigen::Matrix< T1, R1, C1 > &b, const stan::math::LDLT_factor< T2, R2, C2 > &A)'],['../namespacestan_1_1math.html#a01d77bf4121d56b8491092164d1523ce',1,'stan::math::mdivide_right_ldlt(const Eigen::Matrix< double, R1, C1 > &b, const stan::math::LDLT_factor< double, R2, C2 > &A)']]], + ['mdivide_5fright_5fspd',['mdivide_right_spd',['../namespacestan_1_1math.html#a5d6f32dd8adc4a9ffa28d63b62d4c90f',1,'stan::math']]], + ['mdivide_5fright_5fspd_2ehpp',['mdivide_right_spd.hpp',['../mdivide__right__spd_8hpp.html',1,'']]], + ['mdivide_5fright_5ftri',['mdivide_right_tri',['../namespacestan_1_1math.html#ae158767243e09b91b9ba6cd366e7dab8',1,'stan::math']]], + ['mdivide_5fright_5ftri_2ehpp',['mdivide_right_tri.hpp',['../mdivide__right__tri_8hpp.html',1,'']]], + ['mdivide_5fright_5ftri_5flow',['mdivide_right_tri_low',['../namespacestan_1_1agrad.html#ad91af5d6f2192ec14360aa9f9e70bfc0',1,'stan::agrad::mdivide_right_tri_low(const Eigen::Matrix< fvar< T >, R1, C1 > &A, const Eigen::Matrix< fvar< T >, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#a2dc33743ae5cee446bca0e9f0c18c1fa',1,'stan::agrad::mdivide_right_tri_low(const Eigen::Matrix< fvar< T >, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#a6f2d6e5dd89d2094f04d9a81cb8a6191',1,'stan::agrad::mdivide_right_tri_low(const Eigen::Matrix< double, R1, C1 > &A, const Eigen::Matrix< fvar< T >, R2, C2 > &b)'],['../namespacestan_1_1math.html#a09f35fbeab4d8ff311ce77d91492e26b',1,'stan::math::mdivide_right_tri_low()']]], + ['mdivide_5fright_5ftri_5flow_2ehpp',['mdivide_right_tri_low.hpp',['../agrad_2fwd_2matrix_2mdivide__right__tri__low_8hpp.html',1,'']]], + ['mdivide_5fright_5ftri_5flow_2ehpp',['mdivide_right_tri_low.hpp',['../math_2matrix_2mdivide__right__tri__low_8hpp.html',1,'']]], + ['mean',['mean',['../classstan_1_1mcmc_1_1chains.html#a905c53a11c08a53404379096885674ac',1,'stan::mcmc::chains::mean(const int chain, const int index)'],['../classstan_1_1mcmc_1_1chains.html#a9549bed51ad7dac77a4b27b849768049',1,'stan::mcmc::chains::mean(const int index)'],['../classstan_1_1mcmc_1_1chains.html#a5587f727e87620b9f2e9477f7517c9fa',1,'stan::mcmc::chains::mean(const int chain, const std::string &name)'],['../classstan_1_1mcmc_1_1chains.html#ad53b31c4b7b3056d5e38469f3c58ed51',1,'stan::mcmc::chains::mean(const std::string &name)'],['../namespacestan_1_1math.html#a3443c4ac994b039a7f055c55c5afa8a3',1,'stan::math::mean(const std::vector< T > &v)'],['../namespacestan_1_1math.html#a8074c0041b93407c473fd26a7c45dc88',1,'stan::math::mean(const Eigen::Matrix< T, R, C > &m)']]], + ['mean_2ehpp',['mean.hpp',['../mean_8hpp.html',1,'']]], + ['memalloc_5f',['memalloc_',['../agrad__thread__safe_8hpp.html#a101adb62dfa9c36d8fe9d782b145b638',1,'memalloc_(): agrad_thread_safe.hpp'],['../namespacestan_1_1agrad.html#aaa104691d168acd62c8adff8e1888d5f',1,'stan::agrad::memalloc_()']]], + ['member_5fvar_5fdecl_5fvisgen',['member_var_decl_visgen',['../structstan_1_1gm_1_1member__var__decl__visgen.html#a665f039f108df78a55e1ddf8651c6dca',1,'stan::gm::member_var_decl_visgen']]], + ['member_5fvar_5fdecl_5fvisgen',['member_var_decl_visgen',['../structstan_1_1gm_1_1member__var__decl__visgen.html',1,'stan::gm']]], + ['memory_2ehpp',['memory.hpp',['../memory_8hpp.html',1,'']]], + ['meta_2ehpp',['meta.hpp',['../meta_8hpp.html',1,'']]], + ['metadata',['metadata',['../structstan_1_1io_1_1stan__csv.html#a4ecfceb7adb01489b02afae2d38bb32d',1,'stan::io::stan_csv']]], + ['metric',['metric',['../structstan_1_1io_1_1stan__csv__adaptation.html#acb7a22f17dae3c239bab54097f06a082',1,'stan::io::stan_csv_adaptation']]], + ['min',['min',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#ae238eb8551b8faa9ff191638541d48a6',1,'std::numeric_limits< stan::agrad::fvar< T > >::min()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a4442454f1562bcd4cd926cb45b5d16b9',1,'std::numeric_limits< stan::agrad::var >::min()'],['../namespacestan_1_1math.html#ab360c822174f211838f5979760c7e09e',1,'stan::math::min(const double a, const double b)'],['../namespacestan_1_1math.html#a3f076860549f63d55c0e4985dce78099',1,'stan::math::min(const std::vector< int > &x)'],['../namespacestan_1_1math.html#a9e9c3a01030d96fd4c8f28e2ed8d3d61',1,'stan::math::min(const std::vector< T > &x)'],['../namespacestan_1_1math.html#a86f2380e5c54a549e0f74ffd51204d33',1,'stan::math::min(const Eigen::Matrix< T, R, C > &m)']]], + ['min_2ehpp',['min.hpp',['../matrix_2min_8hpp.html',1,'']]], + ['min_2ehpp',['min.hpp',['../functions_2min_8hpp.html',1,'']]], + ['min_5fexponent',['min_exponent',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#ace35430e8870ecb76f33c3053c88dabe',1,'std::numeric_limits< stan::agrad::fvar< T > >::min_exponent()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#ae36c2c99f19cedb4fc1e791d6e18d097',1,'std::numeric_limits< stan::agrad::var >::min_exponent()']]], + ['min_5fexponent10',['min_exponent10',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a7a7c9a1c6899d243cb31c6173d887bc2',1,'std::numeric_limits< stan::agrad::fvar< T > >::min_exponent10()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a4d51c2b58c296c505325170f1b24a2c2',1,'std::numeric_limits< stan::agrad::var >::min_exponent10()']]], + ['minalpha',['minAlpha',['../structstan_1_1optimization_1_1_b_f_g_s_minimizer_1_1_b_f_g_s_options.html#af96e08cafc1f70370eee848f0a4e0b05',1,'stan::optimization::BFGSMinimizer::BFGSOptions']]], + ['minimize',['minimize',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a27a804ca4bbe7923b8913ab38a8693a6',1,'stan::optimization::BFGSMinimizer']]], + ['minor_5fversion',['MINOR_VERSION',['../namespacestan.html#ad48b562c737bb49645bd8117067858b9',1,'stan']]], + ['minus',['minus',['../namespacestan_1_1math.html#a87b343d6dc12982c2b76c453650c0797',1,'stan::math']]], + ['minus_2ehpp',['minus.hpp',['../minus_8hpp.html',1,'']]], + ['minv',['mInv',['../classstan_1_1mcmc_1_1dense__e__point.html#abf64e065e1579f7aeb211d764dc62eb1',1,'stan::mcmc::dense_e_point::mInv()'],['../classstan_1_1mcmc_1_1diag__e__point.html#aaeb41431de534f7237ea8a180b2b3d1a',1,'stan::mcmc::diag_e_point::mInv()']]], + ['model',['model',['../structstan_1_1io_1_1stan__csv__metadata.html#ab8e05cb697a29eac28fd070ab8567de7',1,'stan::io::stan_csv_metadata']]], + ['model_2ehpp',['model.hpp',['../model_8hpp.html',1,'']]], + ['model_5fheader_2ehpp',['model_header.hpp',['../model__header_8hpp.html',1,'']]], + ['model_5fname_5f',['model_name_',['../structstan_1_1gm_1_1program__grammar.html#a32cf25177064369c7fcccc8e3f8e5cf1',1,'stan::gm::program_grammar']]], + ['model_5fname_5forigin',['model_name_origin',['../namespacestan_1_1gm.html#a119c68ad93a3fc5589c594433b8cb258',1,'stan::gm']]], + ['model_5fr',['model_r',['../structstan_1_1gm_1_1program__grammar.html#a082357dac44c70fe58bb9941c5ff4972',1,'stan::gm::program_grammar']]], + ['modeladaptor',['ModelAdaptor',['../classstan_1_1optimization_1_1_model_adaptor.html',1,'stan::optimization']]], + ['modeladaptor',['ModelAdaptor',['../classstan_1_1optimization_1_1_model_adaptor.html#a28c05023727eb49f55b51ec0dee8413e',1,'stan::optimization::ModelAdaptor']]], + ['modified_5fbessel_5ffirst_5fkind',['modified_bessel_first_kind',['../namespacestan_1_1agrad.html#af1e6f0609bef81a1832bd4c624350e6e',1,'stan::agrad::modified_bessel_first_kind(int v, const fvar< T > &z)'],['../namespacestan_1_1agrad.html#a4667276304c443e9bde5fb7218c56778',1,'stan::agrad::modified_bessel_first_kind(const int &v, const var &a)'],['../namespacestan_1_1math.html#acafecf14b103c7c17da33368d07b1565',1,'stan::math::modified_bessel_first_kind()']]], + ['modified_5fbessel_5ffirst_5fkind_2ehpp',['modified_bessel_first_kind.hpp',['../agrad_2fwd_2functions_2modified__bessel__first__kind_8hpp.html',1,'']]], + ['modified_5fbessel_5ffirst_5fkind_2ehpp',['modified_bessel_first_kind.hpp',['../math_2functions_2modified__bessel__first__kind_8hpp.html',1,'']]], + ['modified_5fbessel_5ffirst_5fkind_2ehpp',['modified_bessel_first_kind.hpp',['../agrad_2rev_2functions_2modified__bessel__first__kind_8hpp.html',1,'']]], + ['modified_5fbessel_5fsecond_5fkind',['modified_bessel_second_kind',['../namespacestan_1_1agrad.html#a2af4019aee25cb289b88d3dc946eea77',1,'stan::agrad::modified_bessel_second_kind(int v, const fvar< T > &z)'],['../namespacestan_1_1agrad.html#a4a949984f1a537a77db66f4d4f15cfeb',1,'stan::agrad::modified_bessel_second_kind(const int &v, const var &a)'],['../namespacestan_1_1math.html#a72ce86f3db5478cad4666c9cf1d05a6e',1,'stan::math::modified_bessel_second_kind()']]], + ['modified_5fbessel_5fsecond_5fkind_2ehpp',['modified_bessel_second_kind.hpp',['../agrad_2rev_2functions_2modified__bessel__second__kind_8hpp.html',1,'']]], + ['modified_5fbessel_5fsecond_5fkind_2ehpp',['modified_bessel_second_kind.hpp',['../math_2functions_2modified__bessel__second__kind_8hpp.html',1,'']]], + ['modified_5fbessel_5fsecond_5fkind_2ehpp',['modified_bessel_second_kind.hpp',['../agrad_2fwd_2functions_2modified__bessel__second__kind_8hpp.html',1,'']]], + ['mulcost',['MulCost',['../struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html#a932a61195daad3e89711cfb02521cac9a4440e43b74d010d56f93bded451d0741',1,'Eigen::NumTraits< stan::agrad::var >']]], + ['multi_5fgp_2ehpp',['multi_gp.hpp',['../multi__gp_8hpp.html',1,'']]], + ['multi_5fgp_5flog',['multi_gp_log',['../namespacestan_1_1prob.html#a9c3810ea429509d3fd4e9a435a73f11f',1,'stan::prob::multi_gp_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma, const Eigen::Matrix< T_w, Eigen::Dynamic, 1 > &w)'],['../namespacestan_1_1prob.html#a87858b89fe976714f66df92989fb0f03',1,'stan::prob::multi_gp_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &w)']]], + ['multi_5fnormal_2ehpp',['multi_normal.hpp',['../multi__normal_8hpp.html',1,'']]], + ['multi_5fnormal_5fcholesky_2ehpp',['multi_normal_cholesky.hpp',['../multi__normal__cholesky_8hpp.html',1,'']]], + ['multi_5fnormal_5fcholesky_5flog',['multi_normal_cholesky_log',['../namespacestan_1_1prob.html#a01330a7c13ec8bb09a28b0983ef805c3',1,'stan::prob::multi_normal_cholesky_log(const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &L)'],['../namespacestan_1_1prob.html#adb8d48a2490b405c5f07ff6a316b4d3a',1,'stan::prob::multi_normal_cholesky_log(const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &L)'],['../namespacestan_1_1prob.html#aceed1445a3d25c5fc36dcf38ef115692',1,'stan::prob::multi_normal_cholesky_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &L)'],['../namespacestan_1_1prob.html#a59d30c1dea51119a3bc99519eca23f1f',1,'stan::prob::multi_normal_cholesky_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &L)']]], + ['multi_5fnormal_5flog',['multi_normal_log',['../namespacestan_1_1prob.html#a71e8ba5779457e6f532f39e89de717e4',1,'stan::prob::multi_normal_log(const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma)'],['../namespacestan_1_1prob.html#a627102d5b7ce3cf3dc6835cb1e6b3455',1,'stan::prob::multi_normal_log(const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma)'],['../namespacestan_1_1prob.html#a1be2baaf4bbbf9997816256e21fc849c',1,'stan::prob::multi_normal_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma)'],['../namespacestan_1_1prob.html#a5f7dfeb4f132811e2584b673f808396c',1,'stan::prob::multi_normal_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma)']]], + ['multi_5fnormal_5fprec_2ehpp',['multi_normal_prec.hpp',['../multi__normal__prec_8hpp.html',1,'']]], + ['multi_5fnormal_5fprec_5flog',['multi_normal_prec_log',['../namespacestan_1_1prob.html#a3aa4c668766dc37248e6d5bd84eae338',1,'stan::prob::multi_normal_prec_log(const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma)'],['../namespacestan_1_1prob.html#a9d21551db0a50bd061cbf0147628a255',1,'stan::prob::multi_normal_prec_log(const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma)'],['../namespacestan_1_1prob.html#a45250c0ec42bb7278ced6275eed9ffa1',1,'stan::prob::multi_normal_prec_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma)'],['../namespacestan_1_1prob.html#a5478d2a990aa6b82b0911707659c1e50',1,'stan::prob::multi_normal_prec_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma)']]], + ['multi_5fnormal_5frng',['multi_normal_rng',['../namespacestan_1_1prob.html#a93eceb90a88d6432e3bda7c5e35db8e0',1,'stan::prob']]], + ['multi_5fstudent_5ft_2ehpp',['multi_student_t.hpp',['../multi__student__t_8hpp.html',1,'']]], + ['multi_5fstudent_5ft_5flog',['multi_student_t_log',['../namespacestan_1_1prob.html#a48b71448bd4100f9dbbf884c9fee4de6',1,'stan::prob::multi_student_t_log(const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const T_dof &nu, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_scale, Eigen::Dynamic, Eigen::Dynamic > &Sigma)'],['../namespacestan_1_1prob.html#ac5c541f4309051587f35a5187ef5165c',1,'stan::prob::multi_student_t_log(const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const T_dof &nu, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_scale, Eigen::Dynamic, Eigen::Dynamic > &Sigma)']]], + ['multi_5fstudent_5ft_5frng',['multi_student_t_rng',['../namespacestan_1_1prob.html#ab61ba841eb4bd76a7df2975e18f0b025',1,'stan::prob']]], + ['multinomial_2ehpp',['multinomial.hpp',['../multinomial_8hpp.html',1,'']]], + ['multinomial_5flog',['multinomial_log',['../namespacestan_1_1prob.html#a30f2c82429f15f40ab59b038f35d29f4',1,'stan::prob::multinomial_log(const std::vector< int > &ns, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta)'],['../namespacestan_1_1prob.html#aee5c8f7cbbbc28455bae7c9f6b6bf2f8',1,'stan::prob::multinomial_log(const std::vector< int > &ns, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta)']]], + ['multinomial_5frng',['multinomial_rng',['../namespacestan_1_1prob.html#a7d4d3be39750d795653ce0a8ee25e065',1,'stan::prob']]], + ['multiplication',['multiplication',['../namespacestan_1_1gm.html#a84ada99320bf1c4bb7bc1609d29965a4',1,'stan::gm']]], + ['multiplication_5fexpr',['multiplication_expr',['../structstan_1_1gm_1_1multiplication__expr.html',1,'stan::gm']]], + ['multiply',['multiply',['../namespacestan_1_1agrad.html#af5dfb2569a8f7f2f95830d0f0bb5bd40',1,'stan::agrad::multiply(const Eigen::Matrix< fvar< T >, R1, C1 > &m, const fvar< T > &c)'],['../namespacestan_1_1agrad.html#a148bf99bd72fc1ef2e7fb410837bda03',1,'stan::agrad::multiply(const Eigen::Matrix< fvar< T >, R2, C2 > &m, const double c)'],['../namespacestan_1_1agrad.html#ad8c423f41aa11c693cdeff32ec369021',1,'stan::agrad::multiply(const Eigen::Matrix< double, R1, C1 > &m, const fvar< T > &c)'],['../namespacestan_1_1agrad.html#a1bac78b32103f6336d645dcc8e601e1c',1,'stan::agrad::multiply(const fvar< T > &c, const Eigen::Matrix< fvar< T >, R1, C1 > &m)'],['../namespacestan_1_1agrad.html#a5ab5375c22320ffabc25b59bf372b787',1,'stan::agrad::multiply(const double c, const Eigen::Matrix< fvar< T >, R1, C1 > &m)'],['../namespacestan_1_1agrad.html#af88e47add7862504f83f82f6b209ef8d',1,'stan::agrad::multiply(const fvar< T > &c, const Eigen::Matrix< double, R1, C1 > &m)'],['../namespacestan_1_1agrad.html#a19d042d141225843b96006e12359677c',1,'stan::agrad::multiply(const Eigen::Matrix< fvar< T >, R1, C1 > &m1, const Eigen::Matrix< fvar< T >, R2, C2 > &m2)'],['../namespacestan_1_1agrad.html#a467103932d1ea2c9717b85872a3ea60b',1,'stan::agrad::multiply(const Eigen::Matrix< fvar< T >, R1, C1 > &m1, const Eigen::Matrix< double, R2, C2 > &m2)'],['../namespacestan_1_1agrad.html#adbfc25a42aa3f524ea845e592c7ccd2b',1,'stan::agrad::multiply(const Eigen::Matrix< double, R1, C1 > &m1, const Eigen::Matrix< fvar< T >, R2, C2 > &m2)'],['../namespacestan_1_1agrad.html#a115c9006f06661eef4c034d1a2f885dc',1,'stan::agrad::multiply(const Eigen::Matrix< fvar< T >, 1, C1 > &rv, const Eigen::Matrix< fvar< T >, R2, 1 > &v)'],['../namespacestan_1_1agrad.html#a5a6f66eeddc4fcfeced24f4a710fdb97',1,'stan::agrad::multiply(const Eigen::Matrix< fvar< T >, 1, C1 > &rv, const Eigen::Matrix< double, R2, 1 > &v)'],['../namespacestan_1_1agrad.html#af00532cd123eac94a193d0c76e9d58ee',1,'stan::agrad::multiply(const Eigen::Matrix< double, 1, C1 > &rv, const Eigen::Matrix< fvar< T >, R2, 1 > &v)'],['../namespacestan_1_1agrad.html#a57ea43d861a571f86937062eda4fa5af',1,'stan::agrad::multiply(const T1 &v, const T2 &c)'],['../namespacestan_1_1agrad.html#a26ac66272ba16ad14daa9f4952a16454',1,'stan::agrad::multiply(const T1 &c, const Eigen::Matrix< T2, R2, C2 > &m)'],['../namespacestan_1_1agrad.html#a5eb3c1069fc2d98aa42b3b0308bd9c60',1,'stan::agrad::multiply(const Eigen::Matrix< T1, R1, C1 > &m, const T2 &c)'],['../namespacestan_1_1agrad.html#af029b6f77d642a6278df7fced3a1ec12',1,'stan::agrad::multiply(const Eigen::Matrix< T1, R1, C1 > &m1, const Eigen::Matrix< T2, R2, C2 > &m2)'],['../namespacestan_1_1agrad.html#a746363e825961a19e0edb846c0d420cc',1,'stan::agrad::multiply(const Eigen::Matrix< T1, 1, C1 > &rv, const Eigen::Matrix< T2, R2, 1 > &v)'],['../namespacestan_1_1math.html#a919d4a6495c489841df3d0423200b147',1,'stan::math::multiply(const Eigen::Matrix< double, R, C > &m, T c)'],['../namespacestan_1_1math.html#a5a2b6dbfb5543b73dac8496091745ec1',1,'stan::math::multiply(T c, const Eigen::Matrix< double, R, C > &m)'],['../namespacestan_1_1math.html#a7c72cdca253e0230e0dbd19400781b5c',1,'stan::math::multiply(const Eigen::Matrix< double, R1, C1 > &m1, const Eigen::Matrix< double, R2, C2 > &m2)'],['../namespacestan_1_1math.html#a6e67698775aaac248efa49b646ca2a51',1,'stan::math::multiply(const Eigen::Matrix< double, 1, C1 > &rv, const Eigen::Matrix< double, R2, 1 > &v)']]], + ['multiply_2ehpp',['multiply.hpp',['../agrad_2rev_2matrix_2multiply_8hpp.html',1,'']]], + ['multiply_2ehpp',['multiply.hpp',['../math_2matrix_2multiply_8hpp.html',1,'']]], + ['multiply_2ehpp',['multiply.hpp',['../agrad_2fwd_2matrix_2multiply_8hpp.html',1,'']]], + ['multiply_5flog',['multiply_log',['../namespacestan_1_1agrad.html#a3d696a83dc04e19d84ea2fb6a0cfa61a',1,'stan::agrad::multiply_log(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#ad21e093d0619e2099f38902925cc292d',1,'stan::agrad::multiply_log(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a60b90b0dce0a75a73c63673f189ff9aa',1,'stan::agrad::multiply_log(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#a0e93c32718fc1d0762b3543a246f00ec',1,'stan::agrad::multiply_log(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#a041ccf4847a3f896904c7baeaefddb34',1,'stan::agrad::multiply_log(const var &a, const double b)'],['../namespacestan_1_1agrad.html#aca18b1e8909315b63cc1a98f4505a0dd',1,'stan::agrad::multiply_log(const double a, const var &b)'],['../namespacestan_1_1math.html#ab530a1792bc901bb6ade34ef3d9ef8b3',1,'stan::math::multiply_log()']]], + ['multiply_5flog_2ehpp',['multiply_log.hpp',['../agrad_2rev_2functions_2multiply__log_8hpp.html',1,'']]], + ['multiply_5flog_2ehpp',['multiply_log.hpp',['../agrad_2fwd_2functions_2multiply__log_8hpp.html',1,'']]], + ['multiply_5flog_2ehpp',['multiply_log.hpp',['../math_2functions_2multiply__log_8hpp.html',1,'']]], + ['multiply_5flower_5ftri_5fself_5ftranspose',['multiply_lower_tri_self_transpose',['../namespacestan_1_1agrad.html#a6635a0f0dfb1767a1930f1ff1984098a',1,'stan::agrad::multiply_lower_tri_self_transpose(const Eigen::Matrix< fvar< T >, R, C > &m)'],['../namespacestan_1_1agrad.html#a0e6a55fe5d7057ad569ec10edfe8187a',1,'stan::agrad::multiply_lower_tri_self_transpose(const matrix_v &L)'],['../namespacestan_1_1math.html#a3c0c953951f141b35277fe2308777cff',1,'stan::math::multiply_lower_tri_self_transpose()']]], + ['multiply_5flower_5ftri_5fself_5ftranspose_2ehpp',['multiply_lower_tri_self_transpose.hpp',['../agrad_2rev_2matrix_2multiply__lower__tri__self__transpose_8hpp.html',1,'']]], + ['multiply_5flower_5ftri_5fself_5ftranspose_2ehpp',['multiply_lower_tri_self_transpose.hpp',['../agrad_2fwd_2matrix_2multiply__lower__tri__self__transpose_8hpp.html',1,'']]], + ['multiply_5flower_5ftri_5fself_5ftranspose_2ehpp',['multiply_lower_tri_self_transpose.hpp',['../math_2matrix_2multiply__lower__tri__self__transpose_8hpp.html',1,'']]], + ['multivariate_2ehpp',['multivariate.hpp',['../multivariate_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/all_6e.html b/doc/api/html/search/all_6e.html new file mode 100644 index 00000000000..1f92ee5b624 --- /dev/null +++ b/doc/api/html/search/all_6e.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/all_6e.js b/doc/api/html/search/all_6e.js new file mode 100644 index 00000000000..81915744183 --- /dev/null +++ b/doc/api/html/search/all_6e.js @@ -0,0 +1,67 @@ +var searchData= +[ + ['n_5f',['N_',['../structstan_1_1gm_1_1row__vector__var__decl.html#afcf4381a6b4bf0f832e30dca34c2e418',1,'stan::gm::row_vector_var_decl::N_()'],['../structstan_1_1gm_1_1matrix__var__decl.html#af2a6738f8c8aec9255ea286504ef8d30',1,'stan::gm::matrix_var_decl::N_()'],['../structstan_1_1gm_1_1cholesky__factor__var__decl.html#ac4c2902b224d2808a2a879b85e555359',1,'stan::gm::cholesky_factor_var_decl::N_()'],['../classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4.html#aef6f29f77406d69af69d903b629e96dd',1,'stan::math::LDLT_factor< double, R, C >::N_()'],['../agrad_2rev_2matrix_2ldlt_8hpp.html#a733553beee6dadc63ea8c537055a9e04',1,'N_(): ldlt.hpp'],['../agrad_2rev_2matrix_2mdivide__left_8hpp.html#a733553beee6dadc63ea8c537055a9e04',1,'N_(): mdivide_left.hpp'],['../agrad_2rev_2matrix_2mdivide__left__spd_8hpp.html#a733553beee6dadc63ea8c537055a9e04',1,'N_(): mdivide_left_spd.hpp'],['../agrad_2rev_2matrix_2mdivide__left__tri_8hpp.html#a733553beee6dadc63ea8c537055a9e04',1,'N_(): mdivide_left_tri.hpp']]], + ['n_5ftree',['n_tree',['../structstan_1_1mcmc_1_1nuts__util.html#ad3f10003284b647aa8a6d246e8d73935',1,'stan::mcmc::nuts_util']]], + ['name',['name',['../classstan_1_1gm_1_1argument.html#a95e720fb0f0dda0b2be4201274fa47c8',1,'stan::gm::argument::name()'],['../structstan_1_1gm_1_1type__name.html#abf38a6f1fbe6d34e8fc4495423a5cd30',1,'stan::gm::type_name::name()'],['../structstan_1_1gm_1_1type__name_3_01int_01_4.html#a467a9397f434235e89512bf3164f2c53',1,'stan::gm::type_name< int >::name()'],['../structstan_1_1gm_1_1type__name_3_01unsigned_01int_01_4.html#af18249277270ae33f01976e0c8246736',1,'stan::gm::type_name< unsigned int >::name()'],['../structstan_1_1gm_1_1type__name_3_01double_01_4.html#a7acfdb1474ab32c35fb8f67a4612c611',1,'stan::gm::type_name< double >::name()'],['../structstan_1_1gm_1_1type__name_3_01bool_01_4.html#a01b4d6b1873e3dabe9186193558d3e4a',1,'stan::gm::type_name< bool >::name()'],['../structstan_1_1gm_1_1type__name_3_01std_1_1string_01_4.html#a06316042d2aa143497f3306752d5bf14',1,'stan::gm::type_name< std::string >::name()'],['../structstan_1_1gm_1_1var__decl.html#a6df298e1c38d35a2fce94b5513df015b',1,'stan::gm::var_decl::name()'],['../classstan_1_1io_1_1dump__reader.html#aed540ae1e798ad34757a2a66c35ad054',1,'stan::io::dump_reader::name()'],['../classstan_1_1mcmc_1_1base__mcmc.html#a999c963237aa4af863b691f1843b25bc',1,'stan::mcmc::base_mcmc::name()']]], + ['name_5f',['name_',['../structstan_1_1gm_1_1variable__dims.html#a639052828000ec7614d7b40c859f592a',1,'stan::gm::variable_dims::name_()'],['../structstan_1_1gm_1_1variable.html#afb1d3556c61360990675ef1e886719ea',1,'stan::gm::variable::name_()'],['../structstan_1_1gm_1_1fun.html#a7bacce5646beb34ceca62564465e5512',1,'stan::gm::fun::name_()'],['../structstan_1_1gm_1_1base__var__decl.html#af95b3b01bd96c57240dabd226a64809e',1,'stan::gm::base_var_decl::name_()']]], + ['name_5fvis',['name_vis',['../structstan_1_1gm_1_1name__vis.html',1,'stan::gm']]], + ['name_5fvis',['name_vis',['../structstan_1_1gm_1_1name__vis.html#a3d6b32de01cd222ea3b016200ede6ed1',1,'stan::gm::name_vis']]], + ['names_5fi',['names_i',['../classstan_1_1io_1_1dump.html#a965e639a5884ffd40d3849c8a706e145',1,'stan::io::dump::names_i()'],['../classstan_1_1io_1_1var__context.html#a2b1417a3a4b012539392eb6f44e8f059',1,'stan::io::var_context::names_i()']]], + ['names_5fr',['names_r',['../classstan_1_1io_1_1dump.html#a4c287f947ed4205be9115f8d4dbffb0d',1,'stan::io::dump::names_r()'],['../classstan_1_1io_1_1var__context.html#a9161afdc65cf035209fcb3da96f3affe',1,'stan::io::var_context::names_r()']]], + ['neg_5fbinomial_2ehpp',['neg_binomial.hpp',['../neg__binomial_8hpp.html',1,'']]], + ['neg_5fbinomial_5fccdf_5flog',['neg_binomial_ccdf_log',['../namespacestan_1_1prob.html#a6eb2a050c9854f16d47c8a03d16e424d',1,'stan::prob']]], + ['neg_5fbinomial_5fcdf',['neg_binomial_cdf',['../namespacestan_1_1prob.html#a2df22df9c6b60e308e4ccf0b692b5242',1,'stan::prob']]], + ['neg_5fbinomial_5fcdf_5flog',['neg_binomial_cdf_log',['../namespacestan_1_1prob.html#a5c1a6f565a252ab38ef3165fa2d6a7e1',1,'stan::prob']]], + ['neg_5fbinomial_5flog',['neg_binomial_log',['../namespacestan_1_1prob.html#a223eba2920bbf00ffdce87cd9a385d64',1,'stan::prob::neg_binomial_log(const T_n &n, const T_shape &alpha, const T_inv_scale &beta)'],['../namespacestan_1_1prob.html#abb46acd84fce88aa36198b16cc54deae',1,'stan::prob::neg_binomial_log(const T_n &n, const T_shape &alpha, const T_inv_scale &beta)']]], + ['neg_5fbinomial_5frng',['neg_binomial_rng',['../namespacestan_1_1prob.html#a8c1d402a1dd528a63c0a68d63e809644',1,'stan::prob']]], + ['neg_5ftwo_5fover_5fsqrt_5fpi',['NEG_TWO_OVER_SQRT_PI',['../namespacestan_1_1math.html#a344504ea0c1f4f956c85ea8027a07ba9',1,'stan::math']]], + ['negate_5fexpr',['negate_expr',['../structstan_1_1gm_1_1negate__expr.html',1,'stan::gm']]], + ['negate_5fexpr_5ff',['negate_expr_f',['../namespacestan_1_1gm.html#a1b6085f99e8b4fb9b42a7add98ac9488',1,'stan::gm']]], + ['negated_5ffactor_5fr',['negated_factor_r',['../structstan_1_1gm_1_1term__grammar.html#a8a82771553bc80dbd016853cf37676e9',1,'stan::gm::term_grammar']]], + ['negative_5fepsilon',['NEGATIVE_EPSILON',['../namespacestan_1_1math.html#a1dcea3a9752d079c9f972040b873b704',1,'stan::math']]], + ['negative_5finfinity',['negative_infinity',['../namespacestan_1_1math.html#a34bffe91b7a24cb29bd69cb60814c39e',1,'stan::math']]], + ['negative_5finfty',['NEGATIVE_INFTY',['../namespacestan_1_1math.html#aa37d0f67f02e0a0b5797ed9f4df56bfb',1,'stan::math']]], + ['nested',['Nested',['../struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html#aa313e91d6d8163393d270e3c70ad50cf',1,'Eigen::NumTraits< stan::agrad::var >']]], + ['nesterov_5fgradient_2ehpp',['nesterov_gradient.hpp',['../nesterov__gradient_8hpp.html',1,'']]], + ['nesterovgradient',['NesterovGradient',['../classstan_1_1optimization_1_1_nesterov_gradient.html#a185bdd404b884473cf22ad75a9b98ede',1,'stan::optimization::NesterovGradient']]], + ['nesterovgradient',['NesterovGradient',['../classstan_1_1optimization_1_1_nesterov_gradient.html',1,'stan::optimization']]], + ['newline',['newline',['../classstan_1_1io_1_1csv__writer.html#a676de0a0f10ef649af9dd81b1b91afab',1,'stan::io::csv_writer']]], + ['newton_2ehpp',['newton.hpp',['../newton_8hpp.html',1,'']]], + ['newton_5fstep',['newton_step',['../namespacestan_1_1optimization.html#a96fbc01564bc465d164199b41891be0d',1,'stan::optimization']]], + ['next',['next',['../classstan_1_1io_1_1dump__reader.html#aed46c1062b3a19c22a7440b72f1c8ffd',1,'stan::io::dump_reader']]], + ['next_5findex',['next_index',['../print_8hpp.html#ab54368a8bca76f33372859602ca77797',1,'print.hpp']]], + ['nil',['nil',['../structstan_1_1gm_1_1nil.html',1,'stan::gm']]], + ['no_5fop_5fstatement',['no_op_statement',['../structstan_1_1gm_1_1no__op__statement.html',1,'stan::gm']]], + ['no_5fop_5fstatement_5fr',['no_op_statement_r',['../structstan_1_1gm_1_1statement__grammar.html#a0be0bd6e7a44724c32ff73e1bb96375e',1,'stan::gm::statement_grammar']]], + ['noinput',['NOINPUT',['../structstan_1_1gm_1_1error__codes.html#aa63873e8f7e9dd7f8af3502e4003292fa2fcaec15ffdd862e869b23a13b4a4d7c',1,'stan::gm::error_codes']]], + ['non_5flvalue_5fassign_5fr',['non_lvalue_assign_r',['../structstan_1_1gm_1_1statement__grammar.html#a1af0cfdf0b99e6e93c39b7fd326b0069',1,'stan::gm::statement_grammar']]], + ['nonbasic_5fvalidate',['nonbasic_validate',['../structstan_1_1gm_1_1validate__var__decl__visgen.html#a3008b1b4caf900e42f94e2517c874c8f',1,'stan::gm::validate_var_decl_visgen']]], + ['noninteger',['NonInteger',['../struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html#a0b7008c189ffa66353158a30af2aabaf',1,'Eigen::NumTraits< stan::agrad::var >']]], + ['normal_2ehpp',['normal.hpp',['../agrad_2fwd_2prob_2univariate_2continuous_2normal_8hpp.html',1,'']]], + ['normal_2ehpp',['normal.hpp',['../prob_2distributions_2univariate_2continuous_2normal_8hpp.html',1,'']]], + ['normal_5fccdf_5flog',['normal_ccdf_log',['../namespacestan_1_1prob.html#a02b0750cf65f06ac78d448731a6e2dc9',1,'stan::prob']]], + ['normal_5fcdf',['normal_cdf',['../namespacestan_1_1prob.html#a886f9e64bad2382679b935d90b527985',1,'stan::prob']]], + ['normal_5fcdf_5flog',['normal_cdf_log',['../namespacestan_1_1prob.html#a44b5ec88e8620ed6ba61bd58bb0fcab5',1,'stan::prob']]], + ['normal_5flog',['normal_log',['../namespacestan_1_1prob.html#ad99bbf0b29a582cc76394c30f23db536',1,'stan::prob::normal_log(const T_y &y, const T_loc &mu, const T_scale &sigma)'],['../namespacestan_1_1prob.html#a4f3e49fd8c69e4f3bfe5b3e74fed912b',1,'stan::prob::normal_log(const T_y &y, const T_loc &mu, const T_scale &sigma)']]], + ['normal_5frng',['normal_rng',['../namespacestan_1_1prob.html#a85cb8a1ee8a40b7545946a979e249dd1',1,'stan::prob']]], + ['not_5fa_5fnumber',['NOT_A_NUMBER',['../namespacestan_1_1math.html#a9cf147700a2e38335abc618b2c913b8a',1,'stan::math::NOT_A_NUMBER()'],['../namespacestan_1_1math.html#a381493bccc58bd993d797a2a5458c486',1,'stan::math::not_a_number()']]], + ['note',['note',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#addb17a450063c4caaa85de952927513c',1,'stan::optimization::BFGSMinimizer']]], + ['num_5fchains',['num_chains',['../classstan_1_1mcmc_1_1chains.html#aa42993978c341f420c38776862f6e0f4',1,'stan::mcmc::chains']]], + ['num_5fdims',['num_dims',['../structstan_1_1gm_1_1expr__type.html#abcd5fe81541025ae63595502b2db4673',1,'stan::gm::expr_type']]], + ['num_5fdims_5f',['num_dims_',['../structstan_1_1gm_1_1expr__type.html#abf2edf8c79d5990be66b23016dbd2143',1,'stan::gm::expr_type']]], + ['num_5fkept_5fsamples',['num_kept_samples',['../classstan_1_1mcmc_1_1chains.html#a174e16464afa282c23f88651edcf563a',1,'stan::mcmc::chains::num_kept_samples(const int chain)'],['../classstan_1_1mcmc_1_1chains.html#a51ee052b484f3810c4efeed3b7a55812',1,'stan::mcmc::chains::num_kept_samples()']]], + ['num_5fparams',['num_params',['../classstan_1_1mcmc_1_1chains.html#a69301dc29ebf0a2e1049c3a90be229b2',1,'stan::mcmc::chains']]], + ['num_5fparams_5fi',['num_params_i',['../classstan_1_1model_1_1prob__grad.html#a6c758a7e401926bfb453b6c1e0865e74',1,'stan::model::prob_grad']]], + ['num_5fparams_5fr',['num_params_r',['../classstan_1_1model_1_1prob__grad.html#af369b6f368d9a19090f08ed1deeab5be',1,'stan::model::prob_grad']]], + ['num_5fparams_5fr_5f_5f',['num_params_r__',['../classstan_1_1model_1_1prob__grad.html#a26e7379db0cea5dc64fa8c505f4edfda',1,'stan::model::prob_grad']]], + ['num_5fpromotions',['num_promotions',['../classstan_1_1gm_1_1function__signatures.html#a9a6ad50ac8bbc4a95db624019121925d',1,'stan::gm::function_signatures']]], + ['num_5fsamples',['num_samples',['../structstan_1_1io_1_1stan__csv__metadata.html#ab9d717fdea1c34f826112cd197ca530b',1,'stan::io::stan_csv_metadata::num_samples()'],['../classstan_1_1mcmc_1_1chains.html#a371c0c26bc0b62b1d1b33019fc66b66c',1,'stan::mcmc::chains::num_samples(const int chain)'],['../classstan_1_1mcmc_1_1chains.html#ae997b88b5d2aa188453748152b1b6c69',1,'stan::mcmc::chains::num_samples()'],['../classstan_1_1prob_1_1welford__covar__estimator.html#aa76e24fffa5e0bf733aafbaab942166e',1,'stan::prob::welford_covar_estimator::num_samples()'],['../classstan_1_1prob_1_1welford__var__estimator.html#aaead1fea2bb10ec78761a7544f47b9ed',1,'stan::prob::welford_var_estimator::num_samples()']]], + ['num_5fwarmup',['num_warmup',['../structstan_1_1io_1_1stan__csv__metadata.html#a220bc990428b915e65cebf3877658008',1,'stan::io::stan_csv_metadata']]], + ['numeric_5flimits_2ehpp',['numeric_limits.hpp',['../rev_2numeric__limits_8hpp.html',1,'']]], + ['numeric_5flimits_2ehpp',['numeric_limits.hpp',['../fwd_2numeric__limits_8hpp.html',1,'']]], + ['numeric_5flimits_3c_20stan_3a_3aagrad_3a_3afvar_3c_20t_20_3e_20_3e',['numeric_limits< stan::agrad::fvar< T > >',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html',1,'std']]], + ['numeric_5flimits_3c_20stan_3a_3aagrad_3a_3avar_20_3e',['numeric_limits< stan::agrad::var >',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html',1,'std']]], + ['numtraits_3c_20stan_3a_3aagrad_3a_3avar_20_3e',['NumTraits< stan::agrad::var >',['../struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html',1,'Eigen']]], + ['nuts_5futil',['nuts_util',['../structstan_1_1mcmc_1_1nuts__util.html',1,'stan::mcmc']]], + ['nvaris',['nvaris',['../structstan_1_1agrad_1_1_operands_and_partials.html#a4ae05b02b6c5a839f43a1815e7714c49',1,'stan::agrad::OperandsAndPartials']]] +]; diff --git a/doc/api/html/search/all_6f.html b/doc/api/html/search/all_6f.html new file mode 100644 index 00000000000..61827e82e31 --- /dev/null +++ b/doc/api/html/search/all_6f.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/all_6f.js b/doc/api/html/search/all_6f.js new file mode 100644 index 00000000000..be040087a49 --- /dev/null +++ b/doc/api/html/search/all_6f.js @@ -0,0 +1,105 @@ +var searchData= +[ + ['o_5f',['o_',['../structstan_1_1gm_1_1visgen.html#a05817588766bc44447698a3602e82cdb',1,'stan::gm::visgen']]], + ['ok',['OK',['../structstan_1_1gm_1_1error__codes.html#aa63873e8f7e9dd7f8af3502e4003292fa2e47ab549bdeac4803f2801b08cdeee4',1,'stan::gm::error_codes']]], + ['op',['op',['../structstan_1_1gm_1_1binary__op.html#ad657bf27d15914af4925d567fbc725c6',1,'stan::gm::binary_op::op()'],['../structstan_1_1gm_1_1unary__op.html#aca16006ca03efadf9bd194bdaea1b07b',1,'stan::gm::unary_op::op()']]], + ['op_5fddv_5fvari',['op_ddv_vari',['../classstan_1_1agrad_1_1op__ddv__vari.html',1,'stan::agrad']]], + ['op_5fddv_5fvari',['op_ddv_vari',['../classstan_1_1agrad_1_1op__ddv__vari.html#a0dc6f08e56b65cd270dcc2f7939dacef',1,'stan::agrad::op_ddv_vari']]], + ['op_5fdv_5fvari',['op_dv_vari',['../classstan_1_1agrad_1_1op__dv__vari.html',1,'stan::agrad']]], + ['op_5fdv_5fvari',['op_dv_vari',['../classstan_1_1agrad_1_1op__dv__vari.html#a25707782c6db0f4cd1fd99418e660eff',1,'stan::agrad::op_dv_vari']]], + ['op_5fdvd_5fvari',['op_dvd_vari',['../classstan_1_1agrad_1_1op__dvd__vari.html',1,'stan::agrad']]], + ['op_5fdvd_5fvari',['op_dvd_vari',['../classstan_1_1agrad_1_1op__dvd__vari.html#aea81045cbb7574359c547974c1720745',1,'stan::agrad::op_dvd_vari']]], + ['op_5fdvv_5fvari',['op_dvv_vari',['../classstan_1_1agrad_1_1op__dvv__vari.html',1,'stan::agrad']]], + ['op_5fdvv_5fvari',['op_dvv_vari',['../classstan_1_1agrad_1_1op__dvv__vari.html#a459bde977de6b15f8a9d045ca41c95d1',1,'stan::agrad::op_dvv_vari']]], + ['op_5fmatrix_5fvari',['op_matrix_vari',['../classstan_1_1agrad_1_1op__matrix__vari.html',1,'stan::agrad']]], + ['op_5fmatrix_5fvari',['op_matrix_vari',['../classstan_1_1agrad_1_1op__matrix__vari.html#a64359f048df8adbd625d3cf5e2f9f4d0',1,'stan::agrad::op_matrix_vari']]], + ['op_5fv_5fvari',['op_v_vari',['../classstan_1_1agrad_1_1op__v__vari.html',1,'stan::agrad']]], + ['op_5fv_5fvari',['op_v_vari',['../classstan_1_1agrad_1_1op__v__vari.html#a9c8f4f7c998f9e01b7b062845dd02826',1,'stan::agrad::op_v_vari']]], + ['op_5fvd_5fvari',['op_vd_vari',['../classstan_1_1agrad_1_1op__vd__vari.html',1,'stan::agrad']]], + ['op_5fvd_5fvari',['op_vd_vari',['../classstan_1_1agrad_1_1op__vd__vari.html#a90dab6a33453cab385392989faed72a6',1,'stan::agrad::op_vd_vari']]], + ['op_5fvdd_5fvari',['op_vdd_vari',['../classstan_1_1agrad_1_1op__vdd__vari.html',1,'stan::agrad']]], + ['op_5fvdd_5fvari',['op_vdd_vari',['../classstan_1_1agrad_1_1op__vdd__vari.html#a422712bd9ca49f7295d63efd9db459e1',1,'stan::agrad::op_vdd_vari']]], + ['op_5fvdv_5fvari',['op_vdv_vari',['../classstan_1_1agrad_1_1op__vdv__vari.html',1,'stan::agrad']]], + ['op_5fvdv_5fvari',['op_vdv_vari',['../classstan_1_1agrad_1_1op__vdv__vari.html#a887420e658b3a11db1a8087f4a86cff4',1,'stan::agrad::op_vdv_vari']]], + ['op_5fvector_5fvari',['op_vector_vari',['../classstan_1_1agrad_1_1op__vector__vari.html#a6171e0b248aae2c5a9ec3d056567ac49',1,'stan::agrad::op_vector_vari']]], + ['op_5fvector_5fvari',['op_vector_vari',['../classstan_1_1agrad_1_1op__vector__vari.html',1,'stan::agrad']]], + ['op_5fvv_5fvari',['op_vv_vari',['../classstan_1_1agrad_1_1op__vv__vari.html#a45481fc072e8b4792641ed211cb26431',1,'stan::agrad::op_vv_vari']]], + ['op_5fvv_5fvari',['op_vv_vari',['../classstan_1_1agrad_1_1op__vv__vari.html',1,'stan::agrad']]], + ['op_5fvvd_5fvari',['op_vvd_vari',['../classstan_1_1agrad_1_1op__vvd__vari.html#a889fcc9443f84a8605049ca4cbe3fbe0',1,'stan::agrad::op_vvd_vari']]], + ['op_5fvvd_5fvari',['op_vvd_vari',['../classstan_1_1agrad_1_1op__vvd__vari.html',1,'stan::agrad']]], + ['op_5fvvv_5fvari',['op_vvv_vari',['../classstan_1_1agrad_1_1op__vvv__vari.html#aab31cc197ce983a6694f238551561dad',1,'stan::agrad::op_vvv_vari']]], + ['op_5fvvv_5fvari',['op_vvv_vari',['../classstan_1_1agrad_1_1op__vvv__vari.html',1,'stan::agrad']]], + ['operandsandpartials',['OperandsAndPartials',['../structstan_1_1agrad_1_1_operands_and_partials.html#aecabbb142f41aae42881a3b847b4f4e1',1,'stan::agrad::OperandsAndPartials']]], + ['operandsandpartials',['OperandsAndPartials',['../structstan_1_1agrad_1_1_operands_and_partials.html',1,'stan::agrad']]], + ['operator_20delete',['operator delete',['../classstan_1_1agrad_1_1chainable.html#ad1ea1170b887c7730a437a9e831e8c54',1,'stan::agrad::chainable']]], + ['operator_20new',['operator new',['../classstan_1_1agrad_1_1vari.html#a1722e422e33d131e88ae9ca351b9e86c',1,'stan::agrad::vari::operator new()'],['../classstan_1_1agrad_1_1chainable.html#ae78a7b4dfaf5f07c01f3d08f663caf06',1,'stan::agrad::chainable::operator new()']]], + ['operator_21',['operator!',['../namespacestan_1_1agrad.html#ae9d3324d88a532f80e9451dd9f9c5a83',1,'stan::agrad']]], + ['operator_21_3d',['operator!=',['../structstan_1_1gm_1_1expr__type.html#abecd19ebe1a5e0a7bb382c86b0c47477',1,'stan::gm::expr_type::operator!=()'],['../namespacestan_1_1agrad.html#a63631a963a524e14c26616a546e75ad7',1,'stan::agrad::operator!=(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#a772cb5941614d15e4796e4e28c7b3626',1,'stan::agrad::operator!=(const var &a, const double &b)'],['../namespacestan_1_1agrad.html#a0896d4e6a953397b0421f25b1583bb66',1,'stan::agrad::operator!=(const double &a, const var &b)'],['../namespacestan_1_1agrad.html#abc2a6a3826a8c40963c2c43de787c6d9',1,'stan::agrad::operator!=(const fvar< T > &x, const fvar< T > &y)'],['../namespacestan_1_1agrad.html#a4d2b7b3282b4dc8853c2a5821668c058',1,'stan::agrad::operator!=(const fvar< T > &x, double y)'],['../namespacestan_1_1agrad.html#a7a0281d5047cfc8842455774716a1c68',1,'stan::agrad::operator!=(double x, const fvar< T > &y)'],['../namespacestan_1_1agrad.html#a7bb28051fbfb4acffa58bc94a78fcf20',1,'stan::agrad::operator!=(const var &a, const double b)'],['../namespacestan_1_1agrad.html#a3068e402162a891ca257dc2bd55fe47e',1,'stan::agrad::operator!=(const double a, const var &b)']]], + ['operator_28_29',['operator()',['../structstan_1_1gm_1_1expression__type__vis.html#ae101d363740a76d72e1b458d8de4aad1',1,'stan::gm::expression_type_vis::operator()(const nil &e) const '],['../structstan_1_1gm_1_1expression__type__vis.html#ae84dca1e40e9af8689e452fb46d9e032',1,'stan::gm::expression_type_vis::operator()(const int_literal &e) const '],['../structstan_1_1gm_1_1expression__type__vis.html#aab6cc33ac330a276c599d390be4edec8',1,'stan::gm::expression_type_vis::operator()(const double_literal &e) const '],['../structstan_1_1gm_1_1expression__type__vis.html#af8b390d2239e791d7411cee8f8992e03',1,'stan::gm::expression_type_vis::operator()(const array_literal &e) const '],['../structstan_1_1gm_1_1expression__type__vis.html#a18ca391f31a93fd1c0346a29a054dfbe',1,'stan::gm::expression_type_vis::operator()(const variable &e) const '],['../structstan_1_1gm_1_1expression__type__vis.html#adccaf0a45107f4ce7fd01c3fe9a7be6e',1,'stan::gm::expression_type_vis::operator()(const fun &e) const '],['../structstan_1_1gm_1_1expression__type__vis.html#a00466288bc82f8e6e65913dffab469f9',1,'stan::gm::expression_type_vis::operator()(const index_op &e) const '],['../structstan_1_1gm_1_1expression__type__vis.html#a3dfc663ba0cac644c99f76a3becc48e2',1,'stan::gm::expression_type_vis::operator()(const binary_op &e) const '],['../structstan_1_1gm_1_1expression__type__vis.html#a526a9e5db2b2e67f80f37d3c157e691e',1,'stan::gm::expression_type_vis::operator()(const unary_op &e) const '],['../structstan_1_1gm_1_1is__nil__op.html#a08ed9c0b2717cc75d3c76742a4e4e473',1,'stan::gm::is_nil_op::operator()(const nil &x) const '],['../structstan_1_1gm_1_1is__nil__op.html#a8d9976b143d73fa3a7781413aa55b346',1,'stan::gm::is_nil_op::operator()(const int_literal &x) const '],['../structstan_1_1gm_1_1is__nil__op.html#a1779f980df65958d9302c441dd9ec6fd',1,'stan::gm::is_nil_op::operator()(const double_literal &x) const '],['../structstan_1_1gm_1_1is__nil__op.html#a718054de1e6a5991154f4de24da3e43c',1,'stan::gm::is_nil_op::operator()(const array_literal &x) const '],['../structstan_1_1gm_1_1is__nil__op.html#a3297c2fa3f7b613ecef9f81f3cac26f4',1,'stan::gm::is_nil_op::operator()(const variable &x) const '],['../structstan_1_1gm_1_1is__nil__op.html#a5e2a04a8705c487b2b58bc48acb564d0',1,'stan::gm::is_nil_op::operator()(const fun &x) const '],['../structstan_1_1gm_1_1is__nil__op.html#a4fed00e3746cf933d44c1451091ff940',1,'stan::gm::is_nil_op::operator()(const index_op &x) const '],['../structstan_1_1gm_1_1is__nil__op.html#a5e6feff96929c5ff3d8aed77b1aa4775',1,'stan::gm::is_nil_op::operator()(const binary_op &x) const '],['../structstan_1_1gm_1_1is__nil__op.html#af5bcccdf1f78faeffbe7217ac2cc51da',1,'stan::gm::is_nil_op::operator()(const unary_op &x) const '],['../structstan_1_1gm_1_1name__vis.html#a77a99ecd9081380c63ef8611973c4764',1,'stan::gm::name_vis::operator()(const nil &x) const '],['../structstan_1_1gm_1_1name__vis.html#a06e7c65a2fc7f371027db2b4c6ce2076',1,'stan::gm::name_vis::operator()(const int_var_decl &x) const '],['../structstan_1_1gm_1_1name__vis.html#ad621523ffc5f454eddf4b9bedfe04445',1,'stan::gm::name_vis::operator()(const double_var_decl &x) const '],['../structstan_1_1gm_1_1name__vis.html#abd9e7de4bd05940079937ea1c8c30ef4',1,'stan::gm::name_vis::operator()(const vector_var_decl &x) const '],['../structstan_1_1gm_1_1name__vis.html#aac0f822ac237b665c3da17927a8942d1',1,'stan::gm::name_vis::operator()(const row_vector_var_decl &x) const '],['../structstan_1_1gm_1_1name__vis.html#ac40f17c0184a5aa7f62cb74c7905fcca',1,'stan::gm::name_vis::operator()(const matrix_var_decl &x) const '],['../structstan_1_1gm_1_1name__vis.html#afb1ee17045f456b5f078fc31e80b4a04',1,'stan::gm::name_vis::operator()(const simplex_var_decl &x) const '],['../structstan_1_1gm_1_1name__vis.html#a54987fdf17b92c69a422b7fb2737dd6c',1,'stan::gm::name_vis::operator()(const unit_vector_var_decl &x) const '],['../structstan_1_1gm_1_1name__vis.html#aa01c0297fecee56aa965f2c5e1f4855f',1,'stan::gm::name_vis::operator()(const ordered_var_decl &x) const '],['../structstan_1_1gm_1_1name__vis.html#abc29cfc00dd904d37af4ae409fc3f405',1,'stan::gm::name_vis::operator()(const positive_ordered_var_decl &x) const '],['../structstan_1_1gm_1_1name__vis.html#ad4cb7341a3374c2edcb8ed0bf5d87900',1,'stan::gm::name_vis::operator()(const cholesky_factor_var_decl &x) const '],['../structstan_1_1gm_1_1name__vis.html#a6be1389d6fb96e624f542c63a8afe1ce',1,'stan::gm::name_vis::operator()(const cov_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1name__vis.html#aa79a10dd8b0b0c89677836c378beae5e',1,'stan::gm::name_vis::operator()(const corr_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1contains__var.html#abd731c09e08561b635b0ccd4a9075502',1,'stan::gm::contains_var::operator()(const nil &e) const '],['../structstan_1_1gm_1_1contains__var.html#aa14c77d41a64da0038ce5574a1b1195c',1,'stan::gm::contains_var::operator()(const int_literal &e) const '],['../structstan_1_1gm_1_1contains__var.html#a3faac1c9345f3db54478636846d97522',1,'stan::gm::contains_var::operator()(const double_literal &e) const '],['../structstan_1_1gm_1_1contains__var.html#a6d21c8096ca0fbf664963be1157c33cd',1,'stan::gm::contains_var::operator()(const array_literal &e) const '],['../structstan_1_1gm_1_1contains__var.html#ae8586b023ba16f5160d0fa861d7ddbc9',1,'stan::gm::contains_var::operator()(const variable &e) const '],['../structstan_1_1gm_1_1contains__var.html#a6899ad69964d75a4f226c9e4fcf45b5b',1,'stan::gm::contains_var::operator()(const fun &e) const '],['../structstan_1_1gm_1_1contains__var.html#adb25dda5b8d245c3aa67ce6baca5baf4',1,'stan::gm::contains_var::operator()(const index_op &e) const '],['../structstan_1_1gm_1_1contains__var.html#a2552f6617b18df1ae1590fa66a8a9dc8',1,'stan::gm::contains_var::operator()(const binary_op &e) const '],['../structstan_1_1gm_1_1contains__var.html#a072b336abd0018f97f342d55fb75a116',1,'stan::gm::contains_var::operator()(const unary_op &e) const '],['../structstan_1_1gm_1_1contains__nonparam__var.html#ae3faaa613f42c8cb8ac24a521e156e8d',1,'stan::gm::contains_nonparam_var::operator()(const nil &e) const '],['../structstan_1_1gm_1_1contains__nonparam__var.html#a60f21f3f6613845cc38688be1d2d9934',1,'stan::gm::contains_nonparam_var::operator()(const int_literal &e) const '],['../structstan_1_1gm_1_1contains__nonparam__var.html#ae434f920314720d08a7fd840c2b2697b',1,'stan::gm::contains_nonparam_var::operator()(const double_literal &e) const '],['../structstan_1_1gm_1_1contains__nonparam__var.html#a01e37e1af206e136e912ed2d2962f105',1,'stan::gm::contains_nonparam_var::operator()(const array_literal &e) const '],['../structstan_1_1gm_1_1contains__nonparam__var.html#a44d42494dd1eb8798afa4a569e3c638f',1,'stan::gm::contains_nonparam_var::operator()(const variable &e) const '],['../structstan_1_1gm_1_1contains__nonparam__var.html#a4cc5cac2f665fc3bd5b2b200508a936c',1,'stan::gm::contains_nonparam_var::operator()(const fun &e) const '],['../structstan_1_1gm_1_1contains__nonparam__var.html#ac09ff2eee4dc1412b2f7919c1726dd28',1,'stan::gm::contains_nonparam_var::operator()(const index_op &e) const '],['../structstan_1_1gm_1_1contains__nonparam__var.html#a8f62d373bb553ecde42728cbccf5abc1',1,'stan::gm::contains_nonparam_var::operator()(const binary_op &e) const '],['../structstan_1_1gm_1_1contains__nonparam__var.html#a9e95a4a6800ad32f799d8b8eb99c7d53',1,'stan::gm::contains_nonparam_var::operator()(const unary_op &e) const '],['../structstan_1_1gm_1_1expression__visgen.html#aab15972d43af74f77cf26c2c2fec82bf',1,'stan::gm::expression_visgen::operator()(nil const &) const '],['../structstan_1_1gm_1_1expression__visgen.html#a09af83f6b3b1f38ad7ff4964fb6aa4a9',1,'stan::gm::expression_visgen::operator()(const int_literal &n) const '],['../structstan_1_1gm_1_1expression__visgen.html#a63098914d92705be895c57e4adef150f',1,'stan::gm::expression_visgen::operator()(const double_literal &x) const '],['../structstan_1_1gm_1_1expression__visgen.html#a1d09589dc5a9b6e3b8d83c6ad2b69935',1,'stan::gm::expression_visgen::operator()(const array_literal &x) const '],['../structstan_1_1gm_1_1expression__visgen.html#a54590d7ff6be63a4b8fe1f91f04261c5',1,'stan::gm::expression_visgen::operator()(const variable &v) const '],['../structstan_1_1gm_1_1expression__visgen.html#a64a5ba8f9ca3ec6ebc78e25946dbe03d',1,'stan::gm::expression_visgen::operator()(int n) const '],['../structstan_1_1gm_1_1expression__visgen.html#afff24140ddd6164642eaac2d11a029a8',1,'stan::gm::expression_visgen::operator()(double x) const '],['../structstan_1_1gm_1_1expression__visgen.html#a20fa0b87d91d4c30a0255b44bb47db06',1,'stan::gm::expression_visgen::operator()(const std::string &x) const '],['../structstan_1_1gm_1_1expression__visgen.html#aa4686c19b616c8c7381b53a1c834bebb',1,'stan::gm::expression_visgen::operator()(const index_op &x) const '],['../structstan_1_1gm_1_1expression__visgen.html#ac6ae9b2a5dae07545dfcc59a295e980f',1,'stan::gm::expression_visgen::operator()(const fun &fx) const '],['../structstan_1_1gm_1_1expression__visgen.html#a7d647894403afdd5dbd0cfa369b3a9fd',1,'stan::gm::expression_visgen::operator()(const binary_op &expr) const '],['../structstan_1_1gm_1_1expression__visgen.html#a031a4d53347d39e110eb3c1d20159dd2',1,'stan::gm::expression_visgen::operator()(const unary_op &expr) const '],['../structstan_1_1gm_1_1printable__visgen.html#a4527a09ed8015d0ffcf004cb1d4a67e6',1,'stan::gm::printable_visgen::operator()(const std::string &s) const '],['../structstan_1_1gm_1_1printable__visgen.html#ab6298d1155c3982e8c2bad7ea562cee6',1,'stan::gm::printable_visgen::operator()(const expression &e) const '],['../structstan_1_1gm_1_1var__size__validating__visgen.html#a0c3d62bd75928038d50e2cb207718936',1,'stan::gm::var_size_validating_visgen::operator()(nil const &) const '],['../structstan_1_1gm_1_1var__size__validating__visgen.html#a9028495f1c1b7eba7789fd640bf1d14e',1,'stan::gm::var_size_validating_visgen::operator()(int_var_decl const &x) const '],['../structstan_1_1gm_1_1var__size__validating__visgen.html#a00c2424a51f337b1b8703244d2ca1e81',1,'stan::gm::var_size_validating_visgen::operator()(double_var_decl const &x) const '],['../structstan_1_1gm_1_1var__size__validating__visgen.html#afab72d75a1111f01b8b1f771f2e736fe',1,'stan::gm::var_size_validating_visgen::operator()(vector_var_decl const &x) const '],['../structstan_1_1gm_1_1var__size__validating__visgen.html#a14ea51e14a4cf91b841aaeb81d11554c',1,'stan::gm::var_size_validating_visgen::operator()(row_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1var__size__validating__visgen.html#acb8091b7c199fb3b49d7bfd24c6be687',1,'stan::gm::var_size_validating_visgen::operator()(unit_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1var__size__validating__visgen.html#ad0527fcfeed7807664a784af7083bc49',1,'stan::gm::var_size_validating_visgen::operator()(simplex_var_decl const &x) const '],['../structstan_1_1gm_1_1var__size__validating__visgen.html#adb42789b5993da3f03577244e65dce74',1,'stan::gm::var_size_validating_visgen::operator()(ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1var__size__validating__visgen.html#a008afb0bcfcdac5b70ce2805c1858387',1,'stan::gm::var_size_validating_visgen::operator()(positive_ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1var__size__validating__visgen.html#a35236dd88f0ebbc900575e63960e0707',1,'stan::gm::var_size_validating_visgen::operator()(matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1var__size__validating__visgen.html#a7c502111b0cb5e27b54d45c0525fbbf3',1,'stan::gm::var_size_validating_visgen::operator()(cholesky_factor_var_decl const &x) const '],['../structstan_1_1gm_1_1var__size__validating__visgen.html#a03c98e95540ffc39e540114b5a67ec42',1,'stan::gm::var_size_validating_visgen::operator()(cov_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1var__size__validating__visgen.html#aaa4deb5d7e8a85a0acd059f0883384b9',1,'stan::gm::var_size_validating_visgen::operator()(corr_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1var__resizing__visgen.html#a669faa2dfb234af0ec6f651a92eb3cc7',1,'stan::gm::var_resizing_visgen::operator()(nil const &) const '],['../structstan_1_1gm_1_1var__resizing__visgen.html#ad973da4f52c164e36735bca3e9a1ee80',1,'stan::gm::var_resizing_visgen::operator()(int_var_decl const &x) const '],['../structstan_1_1gm_1_1var__resizing__visgen.html#aac743c79ec0be79ce58ab662316890bd',1,'stan::gm::var_resizing_visgen::operator()(double_var_decl const &x) const '],['../structstan_1_1gm_1_1var__resizing__visgen.html#a8517c46749146da31a0e7f63c4228cc2',1,'stan::gm::var_resizing_visgen::operator()(vector_var_decl const &x) const '],['../structstan_1_1gm_1_1var__resizing__visgen.html#a36cfe5b6c444c2a024db0f30036a5f93',1,'stan::gm::var_resizing_visgen::operator()(row_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1var__resizing__visgen.html#ad811ec41000dbbc94b41d5745f3c3918',1,'stan::gm::var_resizing_visgen::operator()(unit_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1var__resizing__visgen.html#a1db8714cf43b3f5eacb74c826646c80a',1,'stan::gm::var_resizing_visgen::operator()(simplex_var_decl const &x) const '],['../structstan_1_1gm_1_1var__resizing__visgen.html#ad728ef0d927e9712efdc777b44de98a7',1,'stan::gm::var_resizing_visgen::operator()(ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1var__resizing__visgen.html#a9459c303e0852fc8c3e5d4c0c83e5380',1,'stan::gm::var_resizing_visgen::operator()(positive_ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1var__resizing__visgen.html#a9d2ee03b4184c5fe97bbf1e96fdad0f4',1,'stan::gm::var_resizing_visgen::operator()(matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1var__resizing__visgen.html#a1db09012dd2e670383a72a258b47e1e0',1,'stan::gm::var_resizing_visgen::operator()(cholesky_factor_var_decl const &x) const '],['../structstan_1_1gm_1_1var__resizing__visgen.html#a96571adb3b948ef318b7e7fc5c02a282',1,'stan::gm::var_resizing_visgen::operator()(cov_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1var__resizing__visgen.html#aa60a881ddd0551119087ea501cb7cfb3',1,'stan::gm::var_resizing_visgen::operator()(corr_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1init__local__var__visgen.html#ab7d91977035552a328beee8465a41554',1,'stan::gm::init_local_var_visgen::operator()(const nil &) const '],['../structstan_1_1gm_1_1init__local__var__visgen.html#a56e547b9d8d98eb235c88a8c1d58409a',1,'stan::gm::init_local_var_visgen::operator()(const int_var_decl &x) const '],['../structstan_1_1gm_1_1init__local__var__visgen.html#a713119b71e590ff2d31089d7c224970b',1,'stan::gm::init_local_var_visgen::operator()(const double_var_decl &x) const '],['../structstan_1_1gm_1_1init__local__var__visgen.html#a135f6581adaecde47e10eb38f167297b',1,'stan::gm::init_local_var_visgen::operator()(const vector_var_decl &x) const '],['../structstan_1_1gm_1_1init__local__var__visgen.html#a1eda8c62c18a93fc3fc33a60a0cf1840',1,'stan::gm::init_local_var_visgen::operator()(const row_vector_var_decl &x) const '],['../structstan_1_1gm_1_1init__local__var__visgen.html#a24592819d7fe9e9571627601a0ca6f94',1,'stan::gm::init_local_var_visgen::operator()(const matrix_var_decl &x) const '],['../structstan_1_1gm_1_1init__local__var__visgen.html#a0edae9cf5200fdb6791a3802ef641dde',1,'stan::gm::init_local_var_visgen::operator()(const unit_vector_var_decl &x) const '],['../structstan_1_1gm_1_1init__local__var__visgen.html#a32c0e1d58251b7aaf9a9c626517ccdc4',1,'stan::gm::init_local_var_visgen::operator()(const simplex_var_decl &x) const '],['../structstan_1_1gm_1_1init__local__var__visgen.html#a8c4a28b3b201923feb3237ab70cbfd26',1,'stan::gm::init_local_var_visgen::operator()(const ordered_var_decl &x) const '],['../structstan_1_1gm_1_1init__local__var__visgen.html#a90db653548c46cf9ea0226491de19dd1',1,'stan::gm::init_local_var_visgen::operator()(const positive_ordered_var_decl &x) const '],['../structstan_1_1gm_1_1init__local__var__visgen.html#a6601554142c706daa7d7c90dcd4405b0',1,'stan::gm::init_local_var_visgen::operator()(const cholesky_factor_var_decl &x) const '],['../structstan_1_1gm_1_1init__local__var__visgen.html#a082b360d9ef23c9fb2cf4e606223e82d',1,'stan::gm::init_local_var_visgen::operator()(const cov_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1init__local__var__visgen.html#a3c92ee4c4c11702308cad9e01cc25a8c',1,'stan::gm::init_local_var_visgen::operator()(const corr_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1validate__var__decl__visgen.html#a293b04f191427eac6d4ebb731380530a',1,'stan::gm::validate_var_decl_visgen::operator()(nil const &) const '],['../structstan_1_1gm_1_1validate__var__decl__visgen.html#aeb09dcce8135ffe469e7a3d388fe23a5',1,'stan::gm::validate_var_decl_visgen::operator()(int_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__var__decl__visgen.html#a57821ae7264ce2b467c99671dd2445f1',1,'stan::gm::validate_var_decl_visgen::operator()(double_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__var__decl__visgen.html#af401582ce790254d4a822c821564749c',1,'stan::gm::validate_var_decl_visgen::operator()(vector_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__var__decl__visgen.html#a8cfc776610aef88901ea9f582c8ee5df',1,'stan::gm::validate_var_decl_visgen::operator()(row_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__var__decl__visgen.html#a31374009014b9209309cebb451e95a6d',1,'stan::gm::validate_var_decl_visgen::operator()(matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__var__decl__visgen.html#ac2692f61a0783cad7ccf53b45dc016c2',1,'stan::gm::validate_var_decl_visgen::operator()(unit_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__var__decl__visgen.html#af783c90b5deb3149733edc1d0bbb80da',1,'stan::gm::validate_var_decl_visgen::operator()(simplex_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__var__decl__visgen.html#ae56af402e25685e48b72cf51a8a81db3',1,'stan::gm::validate_var_decl_visgen::operator()(ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__var__decl__visgen.html#aa90b8ec05ece3e94a2b61ccaeac99b71',1,'stan::gm::validate_var_decl_visgen::operator()(positive_ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__var__decl__visgen.html#aa52047c0ba795b014daf81ffc14c2730',1,'stan::gm::validate_var_decl_visgen::operator()(cholesky_factor_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__var__decl__visgen.html#abe4496806c43c26f25d1d5decf630499',1,'stan::gm::validate_var_decl_visgen::operator()(cov_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__var__decl__visgen.html#a5b14b6fbf4c38146fd80097a16cb3f8e',1,'stan::gm::validate_var_decl_visgen::operator()(corr_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1member__var__decl__visgen.html#a5522b70943b2a24749e14dd03c98ade8',1,'stan::gm::member_var_decl_visgen::operator()(nil const &) const '],['../structstan_1_1gm_1_1member__var__decl__visgen.html#a846d68c8fb568e97d8e72a0023c6990e',1,'stan::gm::member_var_decl_visgen::operator()(int_var_decl const &x) const '],['../structstan_1_1gm_1_1member__var__decl__visgen.html#aad6bcbbf2b1ee90edee39b8e194d8682',1,'stan::gm::member_var_decl_visgen::operator()(double_var_decl const &x) const '],['../structstan_1_1gm_1_1member__var__decl__visgen.html#ae071877e2420318e00df38b6fa99aa4c',1,'stan::gm::member_var_decl_visgen::operator()(unit_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1member__var__decl__visgen.html#a452ce11c5be73d030bb2b578f56d92ff',1,'stan::gm::member_var_decl_visgen::operator()(simplex_var_decl const &x) const '],['../structstan_1_1gm_1_1member__var__decl__visgen.html#a4b118f12400d5b68e582659ad7156001',1,'stan::gm::member_var_decl_visgen::operator()(ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1member__var__decl__visgen.html#a188762a0e623abddb891beeb3f8fc7c2',1,'stan::gm::member_var_decl_visgen::operator()(positive_ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1member__var__decl__visgen.html#adf9c99128404dfb300102feef2455c4e',1,'stan::gm::member_var_decl_visgen::operator()(cholesky_factor_var_decl const &x) const '],['../structstan_1_1gm_1_1member__var__decl__visgen.html#a4e6590cdabe3dad424175b40a6b4754a',1,'stan::gm::member_var_decl_visgen::operator()(cov_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1member__var__decl__visgen.html#a547c121fc9b18960dfb348e37eb04a0e',1,'stan::gm::member_var_decl_visgen::operator()(corr_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1member__var__decl__visgen.html#a4d8ea1a46fc58335839c7b8c688d147d',1,'stan::gm::member_var_decl_visgen::operator()(vector_var_decl const &x) const '],['../structstan_1_1gm_1_1member__var__decl__visgen.html#a16094bd8d9f8b7ec7ec42a3b7556e2d9',1,'stan::gm::member_var_decl_visgen::operator()(row_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1member__var__decl__visgen.html#a870fbb7b4bb778789eb6bb5d832d7911',1,'stan::gm::member_var_decl_visgen::operator()(matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1local__var__decl__visgen.html#a0896684d42f09ea98f32bbd8f1c0ee29',1,'stan::gm::local_var_decl_visgen::operator()(nil const &) const '],['../structstan_1_1gm_1_1local__var__decl__visgen.html#afaffeaef006f8b9156b79ad911e63686',1,'stan::gm::local_var_decl_visgen::operator()(int_var_decl const &x) const '],['../structstan_1_1gm_1_1local__var__decl__visgen.html#aa1d9d8bd0d10c6cf59318d51606ba322',1,'stan::gm::local_var_decl_visgen::operator()(double_var_decl const &x) const '],['../structstan_1_1gm_1_1local__var__decl__visgen.html#a402d4b157dd157cd05af74e8aede83ac',1,'stan::gm::local_var_decl_visgen::operator()(vector_var_decl const &x) const '],['../structstan_1_1gm_1_1local__var__decl__visgen.html#a891deece1420c22599e64b7bfa85e481',1,'stan::gm::local_var_decl_visgen::operator()(row_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1local__var__decl__visgen.html#aa169624bac1a343c4f76b3c524ccdf92',1,'stan::gm::local_var_decl_visgen::operator()(matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1local__var__decl__visgen.html#a8f523bcdc99b230336b45a73392c6bdc',1,'stan::gm::local_var_decl_visgen::operator()(unit_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1local__var__decl__visgen.html#a19fe01f126a6d2da24531b6853fca054',1,'stan::gm::local_var_decl_visgen::operator()(simplex_var_decl const &x) const '],['../structstan_1_1gm_1_1local__var__decl__visgen.html#ac56bc9b5dea646125b2bc9898a2daf72',1,'stan::gm::local_var_decl_visgen::operator()(ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1local__var__decl__visgen.html#a6dddb8f57c6478c6cd4e9650ee7647f3',1,'stan::gm::local_var_decl_visgen::operator()(positive_ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1local__var__decl__visgen.html#a285e81494c6c7dc4b8c24f4fccd6b551',1,'stan::gm::local_var_decl_visgen::operator()(cholesky_factor_var_decl const &x) const '],['../structstan_1_1gm_1_1local__var__decl__visgen.html#a27dee788268922197969f21368393349',1,'stan::gm::local_var_decl_visgen::operator()(cov_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1local__var__decl__visgen.html#ab7ed5b969db7d6b35c7c1f1401bc184b',1,'stan::gm::local_var_decl_visgen::operator()(corr_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#a42d0b0b15905906457cbca26c6d10142',1,'stan::gm::generate_local_var_init_nan_visgen::operator()(const nil &) const '],['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#ae4765b5775d99a95ddb1728302f5cbe0',1,'stan::gm::generate_local_var_init_nan_visgen::operator()(const int_var_decl &x) const '],['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#ad47511bfb6722ed45fbe450cb9ba581a',1,'stan::gm::generate_local_var_init_nan_visgen::operator()(const double_var_decl &x) const '],['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#afa590791c9f6197ca2f85cef55be2f99',1,'stan::gm::generate_local_var_init_nan_visgen::operator()(const vector_var_decl &x) const '],['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#a6c85a19a7505a8454242df4367fe07e9',1,'stan::gm::generate_local_var_init_nan_visgen::operator()(const row_vector_var_decl &x) const '],['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#a45ac40894402f023815850e68f485aef',1,'stan::gm::generate_local_var_init_nan_visgen::operator()(const matrix_var_decl &x) const '],['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#a308932a45f040240680173e54e33d8cf',1,'stan::gm::generate_local_var_init_nan_visgen::operator()(const unit_vector_var_decl &x) const '],['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#a6e735049bbefcc57919868b3a6f08715',1,'stan::gm::generate_local_var_init_nan_visgen::operator()(const simplex_var_decl &x) const '],['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#a10b41b00c40c30ca1bc8ce3e53ff0ebf',1,'stan::gm::generate_local_var_init_nan_visgen::operator()(const ordered_var_decl &x) const '],['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#a4b8549963107c86290863b79cea66c51',1,'stan::gm::generate_local_var_init_nan_visgen::operator()(const positive_ordered_var_decl &x) const '],['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#a6ecfe0a495361f204c894f4e0df8a426',1,'stan::gm::generate_local_var_init_nan_visgen::operator()(const cholesky_factor_var_decl &x) const '],['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#a99b6c01ad0c40e6a38c6e1b2546f56a0',1,'stan::gm::generate_local_var_init_nan_visgen::operator()(const cov_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#aada22b5e887493ac2aafb7952555e684',1,'stan::gm::generate_local_var_init_nan_visgen::operator()(const corr_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1generate__init__vars__visgen.html#a5296c19c9ceeec88da8aea6f7c127a0f',1,'stan::gm::generate_init_vars_visgen::operator()(nil const &) const '],['../structstan_1_1gm_1_1generate__init__vars__visgen.html#a9e7341c528d58e75cce017b798d5a0cc',1,'stan::gm::generate_init_vars_visgen::operator()(int_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__vars__visgen.html#a564e16e6d2733419f6124f594b3ce02d',1,'stan::gm::generate_init_vars_visgen::operator()(double_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__vars__visgen.html#ae8ae66be4b3102b4c58c1ad5474fc703',1,'stan::gm::generate_init_vars_visgen::operator()(vector_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__vars__visgen.html#a322208fcee39dfaae64d6d660e44db9f',1,'stan::gm::generate_init_vars_visgen::operator()(row_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__vars__visgen.html#a1f4d18fd1d808922ba1be8c063275576',1,'stan::gm::generate_init_vars_visgen::operator()(matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__vars__visgen.html#a76b27f4e0d2cdeef25f8c8653161e8e2',1,'stan::gm::generate_init_vars_visgen::operator()(unit_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__vars__visgen.html#a539105c77554c2111c5f819870cba7b4',1,'stan::gm::generate_init_vars_visgen::operator()(simplex_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__vars__visgen.html#aa96301578f07886566d1c60605f51a24',1,'stan::gm::generate_init_vars_visgen::operator()(ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__vars__visgen.html#a445e438ce16f5da4b477e4c28b29af64',1,'stan::gm::generate_init_vars_visgen::operator()(positive_ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__vars__visgen.html#aa623eb8b3406e8025ff2ee4202d1a037',1,'stan::gm::generate_init_vars_visgen::operator()(cholesky_factor_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__vars__visgen.html#a67a792b559bef1d3ebc8b3ecd3e7e3d8',1,'stan::gm::generate_init_vars_visgen::operator()(cov_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__vars__visgen.html#ac67da1998f7e6479721e6f419e033a8f',1,'stan::gm::generate_init_vars_visgen::operator()(corr_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__transformed__params__visgen.html#a14fd7eed71c573311d921da1d1cb901b',1,'stan::gm::validate_transformed_params_visgen::operator()(nil const &) const '],['../structstan_1_1gm_1_1validate__transformed__params__visgen.html#ab43eac10e252f672634e5c3098e6102e',1,'stan::gm::validate_transformed_params_visgen::operator()(int_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__transformed__params__visgen.html#a118d04b0f14440602301eedcf2e00331',1,'stan::gm::validate_transformed_params_visgen::operator()(double_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__transformed__params__visgen.html#a3482660b917b658e4d987f63ed688c2a',1,'stan::gm::validate_transformed_params_visgen::operator()(vector_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__transformed__params__visgen.html#affb011dc7007013be0e7b09c402d4c38',1,'stan::gm::validate_transformed_params_visgen::operator()(unit_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__transformed__params__visgen.html#ad4c97056f7796c9f0335edd1c5a770a4',1,'stan::gm::validate_transformed_params_visgen::operator()(simplex_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__transformed__params__visgen.html#aa046bb1fa3a293080f0b50fd939c48b5',1,'stan::gm::validate_transformed_params_visgen::operator()(ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__transformed__params__visgen.html#a2e5661a4fe0ffa841278abd106b658b8',1,'stan::gm::validate_transformed_params_visgen::operator()(positive_ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__transformed__params__visgen.html#a8c346096587fed22458d55deb48bb556',1,'stan::gm::validate_transformed_params_visgen::operator()(row_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__transformed__params__visgen.html#a9d5589f7e8adae47669af9b1662cf846',1,'stan::gm::validate_transformed_params_visgen::operator()(matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__transformed__params__visgen.html#acaa1f2d1859c10a1c4ac1c0f1c96e82f',1,'stan::gm::validate_transformed_params_visgen::operator()(cholesky_factor_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__transformed__params__visgen.html#a3e5e6857c321533c1083a6ce3088fdfb',1,'stan::gm::validate_transformed_params_visgen::operator()(cov_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__transformed__params__visgen.html#a99261725b4a378a9919fe7f89e4fa591',1,'stan::gm::validate_transformed_params_visgen::operator()(corr_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1statement__visgen.html#af85ff0769df52efb90ce2bbc5ff3df23',1,'stan::gm::statement_visgen::operator()(nil const &) const '],['../structstan_1_1gm_1_1statement__visgen.html#a882ddbcdad5d16de84a4d3d658c6ff20',1,'stan::gm::statement_visgen::operator()(assignment const &x) const '],['../structstan_1_1gm_1_1statement__visgen.html#a18f13f4f735a01b9bc621dbacaf64c67',1,'stan::gm::statement_visgen::operator()(expression const &x) const '],['../structstan_1_1gm_1_1statement__visgen.html#a8b4d0dbca715399dad65ca12d81c2caf',1,'stan::gm::statement_visgen::operator()(sample const &x) const '],['../structstan_1_1gm_1_1statement__visgen.html#a42c4a20fb6e15cfc6348f67669a596a3',1,'stan::gm::statement_visgen::operator()(const increment_log_prob_statement &x) const '],['../structstan_1_1gm_1_1statement__visgen.html#a0173ebc27b24f84a454b7dd8d86ad5aa',1,'stan::gm::statement_visgen::operator()(const statements &x) const '],['../structstan_1_1gm_1_1statement__visgen.html#a3210b49a16a34a1f00e5ae4103e4d52d',1,'stan::gm::statement_visgen::operator()(const print_statement &ps) const '],['../structstan_1_1gm_1_1statement__visgen.html#a34c280dce22502fe23321a7104e06516',1,'stan::gm::statement_visgen::operator()(const for_statement &x) const '],['../structstan_1_1gm_1_1statement__visgen.html#a44904f06b384d2d48bc86ce8761c87b7',1,'stan::gm::statement_visgen::operator()(const while_statement &x) const '],['../structstan_1_1gm_1_1statement__visgen.html#a6cd75512cddef8725f4668be6d7ff891',1,'stan::gm::statement_visgen::operator()(const conditional_statement &x) const '],['../structstan_1_1gm_1_1statement__visgen.html#ad5ace1426be86aeec720e50919d711b8',1,'stan::gm::statement_visgen::operator()(const no_op_statement &) const '],['../structstan_1_1gm_1_1dump__member__var__visgen.html#abfa487614709c71e58805b48802e45a4',1,'stan::gm::dump_member_var_visgen::operator()(nil const &) const '],['../structstan_1_1gm_1_1dump__member__var__visgen.html#aa56bad9542006b9d9354f8571c6b722c',1,'stan::gm::dump_member_var_visgen::operator()(int_var_decl const &x) const '],['../structstan_1_1gm_1_1dump__member__var__visgen.html#aef25639b7aa2e8fe80e189de25130ea0',1,'stan::gm::dump_member_var_visgen::operator()(double_var_decl const &x) const '],['../structstan_1_1gm_1_1dump__member__var__visgen.html#ab8092387d74cddae7522efd01d133d43',1,'stan::gm::dump_member_var_visgen::operator()(vector_var_decl const &x) const '],['../structstan_1_1gm_1_1dump__member__var__visgen.html#ac67d9309fc445f1dc5f962995f2cfebc',1,'stan::gm::dump_member_var_visgen::operator()(row_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1dump__member__var__visgen.html#a90cdc8c8b6027bbe9f72c6b4b2ab6351',1,'stan::gm::dump_member_var_visgen::operator()(unit_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1dump__member__var__visgen.html#a1df5811f58ff7a33a96962e1f0527250',1,'stan::gm::dump_member_var_visgen::operator()(simplex_var_decl const &x) const '],['../structstan_1_1gm_1_1dump__member__var__visgen.html#a4c94da368b07ae2933600a6a5f0e7c9f',1,'stan::gm::dump_member_var_visgen::operator()(ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1dump__member__var__visgen.html#a8fbb932a4cb688a85ee6e65ce36a4b13',1,'stan::gm::dump_member_var_visgen::operator()(positive_ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1dump__member__var__visgen.html#ace2352860fab0197f7cf0d43f75b7302',1,'stan::gm::dump_member_var_visgen::operator()(matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1dump__member__var__visgen.html#a1a149800febdc5a296facd5874dbf695',1,'stan::gm::dump_member_var_visgen::operator()(corr_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1dump__member__var__visgen.html#afe2e3c945b8fbd8fd18a3df5ac91fe5f',1,'stan::gm::dump_member_var_visgen::operator()(cholesky_factor_var_decl const &x) const '],['../structstan_1_1gm_1_1dump__member__var__visgen.html#ab6568cd4e866ced3a2456c4910265eb9',1,'stan::gm::dump_member_var_visgen::operator()(cov_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1set__param__ranges__visgen.html#a3625dc74eb75e7fa91531810bdf97b9e',1,'stan::gm::set_param_ranges_visgen::operator()(const nil &) const '],['../structstan_1_1gm_1_1set__param__ranges__visgen.html#ae3478b2db9512a083f0ee9bdfd111082',1,'stan::gm::set_param_ranges_visgen::operator()(const int_var_decl &x) const '],['../structstan_1_1gm_1_1set__param__ranges__visgen.html#a706ebdafd5d5ea2db2bfff93a7b1328f',1,'stan::gm::set_param_ranges_visgen::operator()(const double_var_decl &x) const '],['../structstan_1_1gm_1_1set__param__ranges__visgen.html#aee6df5fcfce0657ed53f2c144cf64797',1,'stan::gm::set_param_ranges_visgen::operator()(const vector_var_decl &x) const '],['../structstan_1_1gm_1_1set__param__ranges__visgen.html#a4b318d4a2f5799b9f431ced598a7255a',1,'stan::gm::set_param_ranges_visgen::operator()(const row_vector_var_decl &x) const '],['../structstan_1_1gm_1_1set__param__ranges__visgen.html#a07a9057ea34f41475091f186c465486d',1,'stan::gm::set_param_ranges_visgen::operator()(const matrix_var_decl &x) const '],['../structstan_1_1gm_1_1set__param__ranges__visgen.html#a0a3c6ed449782da43725725db88f0af5',1,'stan::gm::set_param_ranges_visgen::operator()(const unit_vector_var_decl &x) const '],['../structstan_1_1gm_1_1set__param__ranges__visgen.html#abcb216c0ca4b41da7d535ce3a2738a9f',1,'stan::gm::set_param_ranges_visgen::operator()(const simplex_var_decl &x) const '],['../structstan_1_1gm_1_1set__param__ranges__visgen.html#a33f608b08e2821547825696f04d0fdbf',1,'stan::gm::set_param_ranges_visgen::operator()(const ordered_var_decl &x) const '],['../structstan_1_1gm_1_1set__param__ranges__visgen.html#a376e19d3c9d4ee5bd05651b3f7b8400c',1,'stan::gm::set_param_ranges_visgen::operator()(const positive_ordered_var_decl &x) const '],['../structstan_1_1gm_1_1set__param__ranges__visgen.html#ad0298bb2fcb14381f78fcdf45deb8334',1,'stan::gm::set_param_ranges_visgen::operator()(const cholesky_factor_var_decl &x) const '],['../structstan_1_1gm_1_1set__param__ranges__visgen.html#a852e85c5a92311b692c6ea2278168f37',1,'stan::gm::set_param_ranges_visgen::operator()(const cov_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1set__param__ranges__visgen.html#a183d4048461fbc6648583ea9c9738204',1,'stan::gm::set_param_ranges_visgen::operator()(const corr_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1generate__init__visgen.html#ae64d5b09459e81886886f4b8bb93ad5e',1,'stan::gm::generate_init_visgen::operator()(nil const &) const '],['../structstan_1_1gm_1_1generate__init__visgen.html#a4acfea897c0949cfc6d0a93e1206d19f',1,'stan::gm::generate_init_visgen::operator()(int_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__visgen.html#a1a20fef969f980bd76d76f649fee2f8f',1,'stan::gm::generate_init_visgen::operator()(double_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__visgen.html#aea32eea12e6ecd555c45f4f70d84fdd4',1,'stan::gm::generate_init_visgen::operator()(vector_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__visgen.html#a2d29390aa764b8b85a2648d4ea2f68b6',1,'stan::gm::generate_init_visgen::operator()(row_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__visgen.html#ad04937033077af89a4b73ebfe5212c97',1,'stan::gm::generate_init_visgen::operator()(matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__visgen.html#adc2c6e42617cf083e62c8173858903f5',1,'stan::gm::generate_init_visgen::operator()(unit_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__visgen.html#a849ab1352d5c6ecf926e2062eaec1fe6',1,'stan::gm::generate_init_visgen::operator()(simplex_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__visgen.html#a9982f4abc1aeea75644c95d262a4664c',1,'stan::gm::generate_init_visgen::operator()(ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__visgen.html#aa9b31667894e82fcce665487e56df858',1,'stan::gm::generate_init_visgen::operator()(positive_ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__visgen.html#a15640d3d0ed7f8bd5e3791760873a141',1,'stan::gm::generate_init_visgen::operator()(cholesky_factor_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__visgen.html#a1902bf22a0d19fa6c0608d80f79fbd15',1,'stan::gm::generate_init_visgen::operator()(cov_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__visgen.html#ac7801f6cac14339b13bd6e33a16479fd',1,'stan::gm::generate_init_visgen::operator()(corr_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1write__dims__visgen.html#a241e8488f5df6048133f3fc3436b4f73',1,'stan::gm::write_dims_visgen::operator()(const nil &) const '],['../structstan_1_1gm_1_1write__dims__visgen.html#a285f76d658ddd8b018079da23eb88ab2',1,'stan::gm::write_dims_visgen::operator()(const int_var_decl &x) const '],['../structstan_1_1gm_1_1write__dims__visgen.html#a739b3a41bd03346e6364ed563644fca3',1,'stan::gm::write_dims_visgen::operator()(const double_var_decl &x) const '],['../structstan_1_1gm_1_1write__dims__visgen.html#ac46344be8a564d0019c582f9604ea797',1,'stan::gm::write_dims_visgen::operator()(const vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__dims__visgen.html#adc6fbaedd6b426908b335d9ed6363c64',1,'stan::gm::write_dims_visgen::operator()(const row_vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__dims__visgen.html#a9399300d81344525a1c52ca3003bd123',1,'stan::gm::write_dims_visgen::operator()(const matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__dims__visgen.html#a0e7495ad6875b725669909150209d36e',1,'stan::gm::write_dims_visgen::operator()(const unit_vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__dims__visgen.html#abfe9bcecd2b4081a1970a514dfa2f7bb',1,'stan::gm::write_dims_visgen::operator()(const simplex_var_decl &x) const '],['../structstan_1_1gm_1_1write__dims__visgen.html#a735927dd81ac131434272269eb9853fd',1,'stan::gm::write_dims_visgen::operator()(const ordered_var_decl &x) const '],['../structstan_1_1gm_1_1write__dims__visgen.html#a6823e7c0f43cb493bc166f3e6f7ce169',1,'stan::gm::write_dims_visgen::operator()(const positive_ordered_var_decl &x) const '],['../structstan_1_1gm_1_1write__dims__visgen.html#a5affc0ae2fa501d9d98ea0421688fdc9',1,'stan::gm::write_dims_visgen::operator()(const cholesky_factor_var_decl &x) const '],['../structstan_1_1gm_1_1write__dims__visgen.html#afcd238f2d6c7d48a4e13f3bfc4e640f8',1,'stan::gm::write_dims_visgen::operator()(const cov_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__dims__visgen.html#ae252214d9acdfd84be53e5f3803e0bee',1,'stan::gm::write_dims_visgen::operator()(const corr_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__param__names__visgen.html#a661aeeb81f7e904501160518ef2ba145',1,'stan::gm::write_param_names_visgen::operator()(const nil &) const '],['../structstan_1_1gm_1_1write__param__names__visgen.html#abff2286d0b2a3d185d304917ebc4492a',1,'stan::gm::write_param_names_visgen::operator()(const int_var_decl &x) const '],['../structstan_1_1gm_1_1write__param__names__visgen.html#a470817ce578b1abc52f0fdc56c1b28f4',1,'stan::gm::write_param_names_visgen::operator()(const double_var_decl &x) const '],['../structstan_1_1gm_1_1write__param__names__visgen.html#a62123b5999a928689b74ce0adf406067',1,'stan::gm::write_param_names_visgen::operator()(const vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__param__names__visgen.html#a4f921a15549249daf2b0dc4ddc13614c',1,'stan::gm::write_param_names_visgen::operator()(const row_vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__param__names__visgen.html#a930d1005cd6effae68a9e30c38ae5547',1,'stan::gm::write_param_names_visgen::operator()(const matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__param__names__visgen.html#a4e2f1c39a4f283e4c13107a84093aa1e',1,'stan::gm::write_param_names_visgen::operator()(const unit_vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__param__names__visgen.html#a2a82891f7cd347774f01ee587527d607',1,'stan::gm::write_param_names_visgen::operator()(const simplex_var_decl &x) const '],['../structstan_1_1gm_1_1write__param__names__visgen.html#a5244ace83897596a9a898062a466f3a7',1,'stan::gm::write_param_names_visgen::operator()(const ordered_var_decl &x) const '],['../structstan_1_1gm_1_1write__param__names__visgen.html#a13381b4ec5fc1104cec86d0630c0073a',1,'stan::gm::write_param_names_visgen::operator()(const positive_ordered_var_decl &x) const '],['../structstan_1_1gm_1_1write__param__names__visgen.html#aaf7e806be4b3ad34f72b37b65f6d9f69',1,'stan::gm::write_param_names_visgen::operator()(const cholesky_factor_var_decl &x) const '],['../structstan_1_1gm_1_1write__param__names__visgen.html#acdd883b61a36735c8647fe83618f6fa7',1,'stan::gm::write_param_names_visgen::operator()(const cov_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__param__names__visgen.html#a9910044b2795a6255a78c9f672c1bf0c',1,'stan::gm::write_param_names_visgen::operator()(const corr_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__header__visgen.html#ae9ad9fd29629c1a5fa7eaf95aef5d8d7',1,'stan::gm::write_csv_header_visgen::operator()(const nil &) const '],['../structstan_1_1gm_1_1write__csv__header__visgen.html#ae604f0f9b1cc6db35f15f655b00cd262',1,'stan::gm::write_csv_header_visgen::operator()(const int_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__header__visgen.html#a8d445e07f41720cce733711c33acaa76',1,'stan::gm::write_csv_header_visgen::operator()(const double_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__header__visgen.html#ab1ef373185ef957afb786883c4f1ab79',1,'stan::gm::write_csv_header_visgen::operator()(const vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__header__visgen.html#ab1fcfc4ab4f58ef149e8492fe967194c',1,'stan::gm::write_csv_header_visgen::operator()(const row_vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__header__visgen.html#aa7f849a4a814eadaaecf4a6ce8ca4db5',1,'stan::gm::write_csv_header_visgen::operator()(const matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__header__visgen.html#af409c6ebc10fd7efd7c964033c8d0c27',1,'stan::gm::write_csv_header_visgen::operator()(const unit_vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__header__visgen.html#a1225374f023caada43d88fb6cc879d3c',1,'stan::gm::write_csv_header_visgen::operator()(const simplex_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__header__visgen.html#ab1ee25227b1498266d43231b824c31d7',1,'stan::gm::write_csv_header_visgen::operator()(const ordered_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__header__visgen.html#a9be3a2194404fd09e0ba9e3de51bc5fa',1,'stan::gm::write_csv_header_visgen::operator()(const positive_ordered_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__header__visgen.html#a38e2400334cbb5ca23835db8c0a1126f',1,'stan::gm::write_csv_header_visgen::operator()(const cholesky_factor_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__header__visgen.html#ad3adb663e082ceea28006f88cc48e584',1,'stan::gm::write_csv_header_visgen::operator()(const cov_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__header__visgen.html#ab64e2f461383641fbbdb0ada35a8ecc3',1,'stan::gm::write_csv_header_visgen::operator()(const corr_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1constrained__param__names__visgen.html#a7c3101dca78af8f11df33f8e69272d1f',1,'stan::gm::constrained_param_names_visgen::operator()(const nil &) const '],['../structstan_1_1gm_1_1constrained__param__names__visgen.html#a42d95194ca06e7281883aac7a71cd8e0',1,'stan::gm::constrained_param_names_visgen::operator()(const int_var_decl &x) const '],['../structstan_1_1gm_1_1constrained__param__names__visgen.html#a6b0c36939bea3557e78606b4cad1c6ed',1,'stan::gm::constrained_param_names_visgen::operator()(const double_var_decl &x) const '],['../structstan_1_1gm_1_1constrained__param__names__visgen.html#aa768bee970f4f260a25afe9469cb94f2',1,'stan::gm::constrained_param_names_visgen::operator()(const vector_var_decl &x) const '],['../structstan_1_1gm_1_1constrained__param__names__visgen.html#ab6aedd3a1d06e93388765f6322439b91',1,'stan::gm::constrained_param_names_visgen::operator()(const row_vector_var_decl &x) const '],['../structstan_1_1gm_1_1constrained__param__names__visgen.html#a80882376e2174653b40047ef3e74e641',1,'stan::gm::constrained_param_names_visgen::operator()(const matrix_var_decl &x) const '],['../structstan_1_1gm_1_1constrained__param__names__visgen.html#abbeaf19e5de404502b219c5f8c6ec5ea',1,'stan::gm::constrained_param_names_visgen::operator()(const unit_vector_var_decl &x) const '],['../structstan_1_1gm_1_1constrained__param__names__visgen.html#acd0d2716db8d9b32253916c959680df9',1,'stan::gm::constrained_param_names_visgen::operator()(const simplex_var_decl &x) const '],['../structstan_1_1gm_1_1constrained__param__names__visgen.html#addad66465bf189869bd62f872a17edbc',1,'stan::gm::constrained_param_names_visgen::operator()(const ordered_var_decl &x) const '],['../structstan_1_1gm_1_1constrained__param__names__visgen.html#a6c880b88ca3ca940cea321b0617b97af',1,'stan::gm::constrained_param_names_visgen::operator()(const positive_ordered_var_decl &x) const '],['../structstan_1_1gm_1_1constrained__param__names__visgen.html#a7e406cdece7bcf4e87d2c225baf9ffce',1,'stan::gm::constrained_param_names_visgen::operator()(const cholesky_factor_var_decl &x) const '],['../structstan_1_1gm_1_1constrained__param__names__visgen.html#a8a496777aa89fd7699f822b67500a50b',1,'stan::gm::constrained_param_names_visgen::operator()(const cov_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1constrained__param__names__visgen.html#ab836f4938f43c78bfdd417ee4b8bb88a',1,'stan::gm::constrained_param_names_visgen::operator()(const corr_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1unconstrained__param__names__visgen.html#a8d1853ed4e7a8999b2f548e2bd3dedc4',1,'stan::gm::unconstrained_param_names_visgen::operator()(const nil &) const '],['../structstan_1_1gm_1_1unconstrained__param__names__visgen.html#a227e9459dd3354627bf7c95a3e2805d4',1,'stan::gm::unconstrained_param_names_visgen::operator()(const int_var_decl &x) const '],['../structstan_1_1gm_1_1unconstrained__param__names__visgen.html#a336ad68a4364f534af6c3b8ba4148af0',1,'stan::gm::unconstrained_param_names_visgen::operator()(const double_var_decl &x) const '],['../structstan_1_1gm_1_1unconstrained__param__names__visgen.html#a6dde9e6aa7dff433b48f2b53c6f57966',1,'stan::gm::unconstrained_param_names_visgen::operator()(const vector_var_decl &x) const '],['../structstan_1_1gm_1_1unconstrained__param__names__visgen.html#a68a7a4f4f7a0027c312f093ced7a8036',1,'stan::gm::unconstrained_param_names_visgen::operator()(const row_vector_var_decl &x) const '],['../structstan_1_1gm_1_1unconstrained__param__names__visgen.html#a01ef3b571744b182fd2b2679aa14c90c',1,'stan::gm::unconstrained_param_names_visgen::operator()(const matrix_var_decl &x) const '],['../structstan_1_1gm_1_1unconstrained__param__names__visgen.html#acf780131651d54be9029160c82ce5c7b',1,'stan::gm::unconstrained_param_names_visgen::operator()(const unit_vector_var_decl &x) const '],['../structstan_1_1gm_1_1unconstrained__param__names__visgen.html#a510b9bb20dda3fb01a1ff9dbabb0bf78',1,'stan::gm::unconstrained_param_names_visgen::operator()(const simplex_var_decl &x) const '],['../structstan_1_1gm_1_1unconstrained__param__names__visgen.html#a3296924b11f2a2a1aad3ffe4c48d3772',1,'stan::gm::unconstrained_param_names_visgen::operator()(const ordered_var_decl &x) const '],['../structstan_1_1gm_1_1unconstrained__param__names__visgen.html#af672a2749665faa902b87e17f7be9eef',1,'stan::gm::unconstrained_param_names_visgen::operator()(const positive_ordered_var_decl &x) const '],['../structstan_1_1gm_1_1unconstrained__param__names__visgen.html#a9a938d11ae97283b176fefd67ac79e6b',1,'stan::gm::unconstrained_param_names_visgen::operator()(const cholesky_factor_var_decl &x) const '],['../structstan_1_1gm_1_1unconstrained__param__names__visgen.html#a40bde127dc4cd55e31d53fe0a9d7b9a5',1,'stan::gm::unconstrained_param_names_visgen::operator()(const cov_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1unconstrained__param__names__visgen.html#a3735b01da2e94eff9780b03d95f0c5b6',1,'stan::gm::unconstrained_param_names_visgen::operator()(const corr_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__visgen.html#a832c79f771732b731f04153cafe0dd37',1,'stan::gm::write_csv_visgen::operator()(const nil &) const '],['../structstan_1_1gm_1_1write__csv__visgen.html#a4b42d735e3420ec31517fee504c52793',1,'stan::gm::write_csv_visgen::operator()(const int_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__visgen.html#a9c86371fd1160881efc97c46c67235ca',1,'stan::gm::write_csv_visgen::operator()(const double_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__visgen.html#a0c5d75d85a6fd4065cfcac82070672d0',1,'stan::gm::write_csv_visgen::operator()(const vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__visgen.html#aa7ca047c2be3c5b568480846296a94ec',1,'stan::gm::write_csv_visgen::operator()(const row_vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__visgen.html#a7b6c88d0194ef11baef723f5add65b10',1,'stan::gm::write_csv_visgen::operator()(const matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__visgen.html#afbd0de485f3be611e1b7789ff2a12dc7',1,'stan::gm::write_csv_visgen::operator()(const unit_vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__visgen.html#aa427354c26e25e85863c118f12fa0a13',1,'stan::gm::write_csv_visgen::operator()(const simplex_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__visgen.html#a93880784b37e0d8a73cfeccd1c8a162c',1,'stan::gm::write_csv_visgen::operator()(const ordered_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__visgen.html#a595f05ac1587bfd0647519eb0698b6a2',1,'stan::gm::write_csv_visgen::operator()(const positive_ordered_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__visgen.html#ad1b3b76918fbd09d02b35e25a91d7f36',1,'stan::gm::write_csv_visgen::operator()(const cholesky_factor_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__visgen.html#a2072ed961ae54bcdcc7cf5a66efec313',1,'stan::gm::write_csv_visgen::operator()(const cov_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__visgen.html#af88449a647d8d4aaf5d4cb296e923f8d',1,'stan::gm::write_csv_visgen::operator()(const corr_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__vars__visgen.html#a2719acba4b1a18fb662c97dcb830d103',1,'stan::gm::write_csv_vars_visgen::operator()(const nil &) const '],['../structstan_1_1gm_1_1write__csv__vars__visgen.html#adb67f6f8f3816f872f4cd5db25993fbc',1,'stan::gm::write_csv_vars_visgen::operator()(const int_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__vars__visgen.html#a2b0ba004b7c8510e89ef81da784f0e1c',1,'stan::gm::write_csv_vars_visgen::operator()(const double_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__vars__visgen.html#afeca4060a34a32397dfcf01615405bdb',1,'stan::gm::write_csv_vars_visgen::operator()(const vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__vars__visgen.html#a80ba2c361cccd8f57935e9d6668be516',1,'stan::gm::write_csv_vars_visgen::operator()(const row_vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__vars__visgen.html#a1d97ffbfc321ee5120a71055372ded4e',1,'stan::gm::write_csv_vars_visgen::operator()(const matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__vars__visgen.html#a3035bb84db8ce7a78918d76bc8a1fb4c',1,'stan::gm::write_csv_vars_visgen::operator()(const unit_vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__vars__visgen.html#ac74b4f9071b03f3a66b83023b568e797',1,'stan::gm::write_csv_vars_visgen::operator()(const simplex_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__vars__visgen.html#a019d32e99ccad2f6c17485519507e8b7',1,'stan::gm::write_csv_vars_visgen::operator()(const ordered_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__vars__visgen.html#aae675794a40e6c613b11f6fd28fcebf3',1,'stan::gm::write_csv_vars_visgen::operator()(const positive_ordered_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__vars__visgen.html#ab9336edc282edfd966c36da2514f09dc',1,'stan::gm::write_csv_vars_visgen::operator()(const cholesky_factor_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__vars__visgen.html#a77f63c9fcd04bab901a8efe09a2acbee',1,'stan::gm::write_csv_vars_visgen::operator()(const cov_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__vars__visgen.html#ad622ac454a8959f9621901235f01001b',1,'stan::gm::write_csv_vars_visgen::operator()(const corr_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__visgen.html#a5e023f2fef25f89a84e7ef9cc3fffb28',1,'stan::gm::write_array_visgen::operator()(const nil &) const '],['../structstan_1_1gm_1_1write__array__visgen.html#a76890f5af58b5249068657a2bd5b6efa',1,'stan::gm::write_array_visgen::operator()(const int_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__visgen.html#a24364e34f4993b5b367c81ce3f2b659a',1,'stan::gm::write_array_visgen::operator()(const double_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__visgen.html#ac622e7cbe2c27da32f5be2d828b2e7e8',1,'stan::gm::write_array_visgen::operator()(const vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__visgen.html#a24849551217534810a461fed799f5f2b',1,'stan::gm::write_array_visgen::operator()(const row_vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__visgen.html#a25dffda3b1d6542f6e7d4842080c42a8',1,'stan::gm::write_array_visgen::operator()(const matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__visgen.html#a0b22a9605e7f90682f451d1ff8be1b67',1,'stan::gm::write_array_visgen::operator()(const unit_vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__visgen.html#a8c54d3d13d4ca2d2cc09ae6a90ef441a',1,'stan::gm::write_array_visgen::operator()(const simplex_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__visgen.html#a3fbb94eaca23339aa18664d3a808cd2d',1,'stan::gm::write_array_visgen::operator()(const ordered_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__visgen.html#ad554817b1894e39e2ad30bad286f4563',1,'stan::gm::write_array_visgen::operator()(const positive_ordered_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__visgen.html#ae4e903cfb0434aa8b0d1cfc1ff46fd13',1,'stan::gm::write_array_visgen::operator()(const cholesky_factor_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__visgen.html#a2b7fc3532750391146c46bbf15ad605f',1,'stan::gm::write_array_visgen::operator()(const cov_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__visgen.html#a79cfed1b9d05d41c66727331ec4fa0e2',1,'stan::gm::write_array_visgen::operator()(const corr_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__vars__visgen.html#ad601dd8e1b7c3294e9dbb779b7a64090',1,'stan::gm::write_array_vars_visgen::operator()(const nil &) const '],['../structstan_1_1gm_1_1write__array__vars__visgen.html#a4bdb9cfceafeff1f37c18f0a2d8b4262',1,'stan::gm::write_array_vars_visgen::operator()(const int_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__vars__visgen.html#adef25be6d3bdb7365fb6f26aeddabe65',1,'stan::gm::write_array_vars_visgen::operator()(const double_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__vars__visgen.html#a8b05bf8a27d5f0d495a7302bef516f6c',1,'stan::gm::write_array_vars_visgen::operator()(const vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__vars__visgen.html#a049135667941289c42a3b081610ab298',1,'stan::gm::write_array_vars_visgen::operator()(const row_vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__vars__visgen.html#aea55b2a06d469e5d499eef36190fd037',1,'stan::gm::write_array_vars_visgen::operator()(const matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__vars__visgen.html#ae62dfbbd8d1d79af6bbdfccbfc09d6bc',1,'stan::gm::write_array_vars_visgen::operator()(const unit_vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__vars__visgen.html#ace51ff0942e94f73235fa37cbefab194',1,'stan::gm::write_array_vars_visgen::operator()(const simplex_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__vars__visgen.html#af12814f9cf2f360f33c363d3492746eb',1,'stan::gm::write_array_vars_visgen::operator()(const ordered_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__vars__visgen.html#af7fa42ced7c5d892234d8db022397754',1,'stan::gm::write_array_vars_visgen::operator()(const positive_ordered_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__vars__visgen.html#a7ef33b812611b18bf7340cc5cf586dd5',1,'stan::gm::write_array_vars_visgen::operator()(const cholesky_factor_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__vars__visgen.html#a66250932aff2ae2ffd3cff5d361f95b4',1,'stan::gm::write_array_vars_visgen::operator()(const cov_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__vars__visgen.html#a5763e948b3e12feb9e988e11eeb4553a',1,'stan::gm::write_array_vars_visgen::operator()(const corr_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1validate__expr__type2.html#a882be65b1df71e890016fb4f7751e962',1,'stan::gm::validate_expr_type2::operator()()'],['../structstan_1_1gm_1_1set__fun__type2.html#a3727191c07f903e90039d085047aec77',1,'stan::gm::set_fun_type2::operator()()'],['../structstan_1_1gm_1_1binary__op__expr.html#ae729ce9f535a2edbfe88a313d3f7184e',1,'stan::gm::binary_op_expr::operator()()'],['../structstan_1_1gm_1_1addition__expr.html#a6f511d62b60d4c5708c0dc9a5687809f',1,'stan::gm::addition_expr::operator()()'],['../structstan_1_1gm_1_1subtraction__expr.html#af01e91cfb196709e94cba69ca6055f48',1,'stan::gm::subtraction_expr::operator()()'],['../structstan_1_1gm_1_1add__conditional__condition.html#aace3227298368df282a3c6fc29dea385',1,'stan::gm::add_conditional_condition::operator()()'],['../structstan_1_1gm_1_1add__conditional__body.html#a329d5d20cbf88349147d98045ba2d79e',1,'stan::gm::add_conditional_body::operator()()'],['../structstan_1_1gm_1_1validate__assignment.html#afa6d6906c1128cadfdf4d041bc1bfcf0',1,'stan::gm::validate_assignment::operator()()'],['../structstan_1_1gm_1_1validate__sample.html#a77de03d8f8a44b98afa75e7fa02fe705',1,'stan::gm::validate_sample::operator()()'],['../structstan_1_1gm_1_1expression__as__statement.html#ad91df00b5b3c97d4ed401b0ac898f17c',1,'stan::gm::expression_as_statement::operator()()'],['../structstan_1_1gm_1_1unscope__locals.html#a5be53d7ab77a85c6002a787b8aa2dbe2',1,'stan::gm::unscope_locals::operator()()'],['../structstan_1_1gm_1_1add__while__condition.html#af1707344a4485a9844789de02036a99b',1,'stan::gm::add_while_condition::operator()()'],['../structstan_1_1gm_1_1add__while__body.html#a95c4e95049a6f5175ad6e6d862f1e02e',1,'stan::gm::add_while_body::operator()()'],['../structstan_1_1gm_1_1add__loop__identifier.html#a6b40d339f94aa76d22665c2f4328e095',1,'stan::gm::add_loop_identifier::operator()()'],['../structstan_1_1gm_1_1remove__loop__identifier.html#af7b8d2468ac908978b92fc852cbb0208',1,'stan::gm::remove_loop_identifier::operator()()'],['../structstan_1_1gm_1_1validate__int__expr2.html#a462cc8619e7c1454119a75fa019b4d51',1,'stan::gm::validate_int_expr2::operator()()'],['../structstan_1_1gm_1_1validate__allow__sample.html#a4e15d9514eb63e9ddefa8bbede4b0fb5',1,'stan::gm::validate_allow_sample::operator()()'],['../structstan_1_1gm_1_1set__fun__type.html#aa047855ac672fdda270a623cfe44f9dc',1,'stan::gm::set_fun_type::operator()()'],['../structstan_1_1gm_1_1set__fun__type__named.html#ae4a66b5e2003663c4d0651ccc9b22633',1,'stan::gm::set_fun_type_named::operator()()'],['../structstan_1_1gm_1_1multiplication__expr.html#a5a3418a174c704a06dc078189e1e75bf',1,'stan::gm::multiplication_expr::operator()()'],['../structstan_1_1gm_1_1division__expr.html#a727db3527c40866ff8dd2709959fcbbf',1,'stan::gm::division_expr::operator()()'],['../structstan_1_1gm_1_1left__division__expr.html#a78883f0a7a5cad2f9654189fd5d834cf',1,'stan::gm::left_division_expr::operator()()'],['../structstan_1_1gm_1_1elt__multiplication__expr.html#a1df3b42b009deca11a8e01a437a67798',1,'stan::gm::elt_multiplication_expr::operator()()'],['../structstan_1_1gm_1_1elt__division__expr.html#addc060e5b9609d1e16a8c749f8e81363',1,'stan::gm::elt_division_expr::operator()()'],['../structstan_1_1gm_1_1negate__expr.html#a75cef8d0a29e9cb72a9f80f4ad2f6403',1,'stan::gm::negate_expr::operator()()'],['../structstan_1_1gm_1_1logical__negate__expr.html#a1a428268ae11c49de22066e600e5ce9c',1,'stan::gm::logical_negate_expr::operator()()'],['../structstan_1_1gm_1_1transpose__expr.html#aeca6b173a3530e7e56029c3f95d8dbc9',1,'stan::gm::transpose_expr::operator()()'],['../structstan_1_1gm_1_1add__expression__dimss.html#ad1b37475cdfb437df9fdaa2ba13a3bcc',1,'stan::gm::add_expression_dimss::operator()()'],['../structstan_1_1gm_1_1set__var__type.html#a81e8e16e1f75675c8aa2e99a45230fdd',1,'stan::gm::set_var_type::operator()()'],['../structstan_1_1gm_1_1validate__int__expr3.html#ad00cc4a51aa05e4cac78c6da0c54755f',1,'stan::gm::validate_int_expr3::operator()()'],['../structstan_1_1gm_1_1validate__expr__type.html#a867deadb8d8aa863e91ba057584f88aa',1,'stan::gm::validate_expr_type::operator()()'],['../classstan_1_1optimization_1_1_model_adaptor.html#a6ef3bd561e81ae2cfdc96143aacd4fa7',1,'stan::optimization::ModelAdaptor::operator()(const Eigen::Matrix< double, Eigen::Dynamic, 1 > &x, double &f)'],['../classstan_1_1optimization_1_1_model_adaptor.html#adb0fdd3e2c65d765607c3f30ba16aec8',1,'stan::optimization::ModelAdaptor::operator()(const Eigen::Matrix< double, Eigen::Dynamic, 1 > &x, double &f, Eigen::Matrix< double, Eigen::Dynamic, 1 > &g)']]], + ['operator_2a',['operator*',['../classstan_1_1agrad_1_1var.html#ab9b31165b391c7db9e1b47f0573bc747',1,'stan::agrad::var::operator*()'],['../namespacestan_1_1agrad.html#ab98d09a4888ed80cc22ef9fbdd63c725',1,'stan::agrad::operator*(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#acd3d5f35e32b3b80f294ae2581744963',1,'stan::agrad::operator*(const var &a, const double &b)'],['../namespacestan_1_1agrad.html#aaf70e0701de307a0228d8b26e2b03043',1,'stan::agrad::operator*(const double &a, const var &b)'],['../namespacestan_1_1agrad.html#a58030b052901596ec4978f651504619c',1,'stan::agrad::operator*(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a4e2bbe49f478f96a9fb2716c76523bea',1,'stan::agrad::operator*(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a31ef0939decd80327614cbf795f23b05',1,'stan::agrad::operator*(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#a19282727c9f5d3b03a33fc3e1400ffe9',1,'stan::agrad::operator*(const var &a, const double b)'],['../namespacestan_1_1agrad.html#a8683cc0c4ae269dde86a7a75adff3962',1,'stan::agrad::operator*(const double a, const var &b)']]], + ['operator_2a_3d',['operator*=',['../classstan_1_1agrad_1_1var.html#a9a9aedf7da287c55b7ef482c452b5be7',1,'stan::agrad::var::operator*=(const var &b)'],['../classstan_1_1agrad_1_1var.html#a222ff48b7d30354f136787e634811809',1,'stan::agrad::var::operator*=(const double &b)'],['../structstan_1_1agrad_1_1fvar.html#a345b88c637ae96c0516354b6484347d2',1,'stan::agrad::fvar::operator*=(const fvar< T2 > &x2)'],['../structstan_1_1agrad_1_1fvar.html#a26a112d55140f52b3a5724794348459e',1,'stan::agrad::fvar::operator*=(const T2 &x2)'],['../classstan_1_1agrad_1_1var.html#a4ea7fa4896c40fce1c9d6cf2d59b695e',1,'stan::agrad::var::operator*=(const var &b)'],['../classstan_1_1agrad_1_1var.html#a724480f8a861f8f5430439da4765d1a4',1,'stan::agrad::var::operator*=(const double b)'],['../structstan_1_1gm_1_1expression.html#a2809197528eaa19de579ddb94927c399',1,'stan::gm::expression::operator*=()']]], + ['operator_2b',['operator+',['../namespacestan_1_1agrad.html#a3c56114bde6eda1fc7d8a2a86c7df5e0',1,'stan::agrad::operator+(const var &a)'],['../namespacestan_1_1agrad.html#a9b0bdcc1fdb32b8025983612faa4900d',1,'stan::agrad::operator+(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#aeba6062298b3063bb259ee201d941bc6',1,'stan::agrad::operator+(const var &a, const double &b)'],['../namespacestan_1_1agrad.html#aba8668d340bca165895e64479728b8da',1,'stan::agrad::operator+(const double &a, const var &b)'],['../namespacestan_1_1agrad.html#a8bfe21c1bd8ab796527f2b74cf389469',1,'stan::agrad::operator+(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a952d610e660fc372f93fac76ede56096',1,'stan::agrad::operator+(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#af8208f5ba8bb28ad10e61f7b374c84dd',1,'stan::agrad::operator+(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#adf0933c87c5d700de971755f40979d2a',1,'stan::agrad::operator+(const var &a, const double b)'],['../namespacestan_1_1agrad.html#a71d87c889481dd165b69e5ae18afd358',1,'stan::agrad::operator+(const double a, const var &b)']]], + ['operator_2b_2b',['operator++',['../structstan_1_1agrad_1_1fvar.html#adb8af0c2332bd8fcc102eba6e16e5bc1',1,'stan::agrad::fvar::operator++()'],['../structstan_1_1agrad_1_1fvar.html#ac558947777c6867650377130fed604de',1,'stan::agrad::fvar::operator++(int)'],['../namespacestan_1_1agrad.html#ac3d5ee13c66c2eeef697c20567fb9fe3',1,'stan::agrad::operator++(var &a)'],['../namespacestan_1_1agrad.html#ae5bc7c4bde258ad0fc845b2aa2897a11',1,'stan::agrad::operator++(var &a, int)']]], + ['operator_2b_3d',['operator+=',['../classstan_1_1agrad_1_1var.html#a7aed84a14a5c7f34bddc0d5a17a2c77f',1,'stan::agrad::var::operator+=(const var &b)'],['../classstan_1_1agrad_1_1var.html#a64086c7c9362cf53e57551f8ed5add14',1,'stan::agrad::var::operator+=(const double &b)'],['../structstan_1_1agrad_1_1fvar.html#a42855e5405cb603222286c34d4bd1ffc',1,'stan::agrad::fvar::operator+=(const fvar< T2 > &x2)'],['../structstan_1_1agrad_1_1fvar.html#a0af6f5512f976604a5f7ea908cedccf5',1,'stan::agrad::fvar::operator+=(const T2 &x2)'],['../classstan_1_1agrad_1_1var.html#a8066e2b84e91f0993b63611d8ca9db4a',1,'stan::agrad::var::operator+=(const var &b)'],['../classstan_1_1agrad_1_1var.html#a1f61621b09c7d87facf17e63f036db57',1,'stan::agrad::var::operator+=(const double b)'],['../structstan_1_1gm_1_1expression.html#a80b6ae53326a5bc334b0b64574d4687e',1,'stan::gm::expression::operator+=()']]], + ['operator_2d',['operator-',['../namespacestan_1_1agrad.html#a32cdb534a0a3e4efb74ac57b240b2abd',1,'stan::agrad::operator-(const var &a)'],['../namespacestan_1_1agrad.html#a50db79b36e350ddadea93da21467bd2b',1,'stan::agrad::operator-(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#a1a85fcc0258ec8c8f93e544c9099cc78',1,'stan::agrad::operator-(const var &a, const double &b)'],['../namespacestan_1_1agrad.html#a922d9be5b47d2964d681da023ce86252',1,'stan::agrad::operator-(const double &a, const var &b)'],['../namespacestan_1_1agrad.html#af03dcfffbcfab11eadf069f9e7549683',1,'stan::agrad::operator-(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#aa503cf2df6453a29ea38e921c1f72702',1,'stan::agrad::operator-(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a3ad03eae992d5dd4475f4462cda0460c',1,'stan::agrad::operator-(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#ab7ca680c6523576a2ffefabe1fce682b',1,'stan::agrad::operator-(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#aab2ad74276bb5b689f6d3e4a3d68b588',1,'stan::agrad::operator-(const var &a, const double b)'],['../namespacestan_1_1agrad.html#a2f4fae66485d0711155ff06709d90d40',1,'stan::agrad::operator-(const double a, const var &b)']]], + ['operator_2d_2d',['operator--',['../structstan_1_1agrad_1_1fvar.html#a018ea15f734397c5b035d2b08292a1af',1,'stan::agrad::fvar::operator--()'],['../structstan_1_1agrad_1_1fvar.html#a4b67eb3587d853feb8d7ca14cea9d1d0',1,'stan::agrad::fvar::operator--(int)'],['../namespacestan_1_1agrad.html#afd628cbe961d30214e9599706cb9df3d',1,'stan::agrad::operator--(var &a)'],['../namespacestan_1_1agrad.html#a2c7866db3308cb99e1e6ebe3d276f805',1,'stan::agrad::operator--(var &a, int)']]], + ['operator_2d_3d',['operator-=',['../classstan_1_1agrad_1_1var.html#adc63a21e809772e4e1943dcde7d81501',1,'stan::agrad::var::operator-=(const var &b)'],['../classstan_1_1agrad_1_1var.html#af175a08753073e2b5cd0431df96f685e',1,'stan::agrad::var::operator-=(const double &b)'],['../structstan_1_1agrad_1_1fvar.html#acab2cd650a6ace2d2cbc919a2e295281',1,'stan::agrad::fvar::operator-=(const fvar< T2 > &x2)'],['../structstan_1_1agrad_1_1fvar.html#a9265544f8ff15013032381543e917321',1,'stan::agrad::fvar::operator-=(const T2 &x2)'],['../classstan_1_1agrad_1_1var.html#a7f0d2c15e16e20a61269259b7f7cc5b7',1,'stan::agrad::var::operator-=(const var &b)'],['../classstan_1_1agrad_1_1var.html#a27e309010cc293bfc7b0895010ea576e',1,'stan::agrad::var::operator-=(const double b)'],['../structstan_1_1gm_1_1expression.html#ab7fbe72fb912a2fa66c1084c69bfd1dd',1,'stan::gm::expression::operator-=()']]], + ['operator_2d_3e',['operator->',['../classstan_1_1agrad_1_1var.html#af706ab2096ce340463d8794edb603a22',1,'stan::agrad::var']]], + ['operator_2f',['operator/',['../namespacestan_1_1agrad.html#a7712039ced9aa4a7d848369b36a81832',1,'stan::agrad::operator/(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#af02e91c7d6a2402c055905816ae914e7',1,'stan::agrad::operator/(const var &a, const double &b)'],['../namespacestan_1_1agrad.html#ac920e55ed730cdc2989729a7237f5975',1,'stan::agrad::operator/(const double &a, const var &b)'],['../namespacestan_1_1agrad.html#af4268a75b7456526175bcf5db4210ef4',1,'stan::agrad::operator/(const Eigen::Matrix< fvar< T >, R, C > &v, const fvar< T > &c)'],['../namespacestan_1_1agrad.html#a18ac8b46664850a5703fd3caa9c68c08',1,'stan::agrad::operator/(const Eigen::Matrix< fvar< T >, R, C > &v, const double c)'],['../namespacestan_1_1agrad.html#abc825eb3bf95f70a94e073eaaddff374',1,'stan::agrad::operator/(const Eigen::Matrix< double, R, C > &v, const fvar< T > &c)'],['../namespacestan_1_1agrad.html#a72c74ea31db523c28cef63c20b1a66ef',1,'stan::agrad::operator/(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a7e7e231514df7e0e61bb94dea9436b57',1,'stan::agrad::operator/(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#a00027f1730fec7abb98522c809f4cf40',1,'stan::agrad::operator/(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#acfdf2b1289c99bb87bc37e44dae5b3c4',1,'stan::agrad::operator/(const var &a, const double b)'],['../namespacestan_1_1agrad.html#aef6041bf907aa9f560f2902c96d9befb',1,'stan::agrad::operator/(const double a, const var &b)']]], + ['operator_2f_3d',['operator/=',['../classstan_1_1agrad_1_1var.html#aa006b46d2909a3924efd0275a57f85a9',1,'stan::agrad::var::operator/=(const var &b)'],['../classstan_1_1agrad_1_1var.html#ad2d16ef5b3e1dfda05252a41e80d2276',1,'stan::agrad::var::operator/=(const double &b)'],['../structstan_1_1agrad_1_1fvar.html#a51f4cc010b2c7c553c5ad138f53d2fd5',1,'stan::agrad::fvar::operator/=(const fvar< T2 > &x2)'],['../structstan_1_1agrad_1_1fvar.html#acd050be117d173a998ddc0f3f6e2d00d',1,'stan::agrad::fvar::operator/=(const T2 &x2)'],['../classstan_1_1agrad_1_1var.html#ae193444d7017bca48834761230b6cd76',1,'stan::agrad::var::operator/=(const var &b)'],['../classstan_1_1agrad_1_1var.html#a6bde2e6f35855e8455f3c9ec8bea97ee',1,'stan::agrad::var::operator/=(const double b)'],['../structstan_1_1gm_1_1expression.html#a83a58233b24992d4a4ec01114522df90',1,'stan::gm::expression::operator/=()']]], + ['operator_3c',['operator<',['../namespacestan_1_1agrad.html#a7ee2f26775300ee2e40be6815f68cc2f',1,'stan::agrad::operator<(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#a6955eaac53f1f699cd00859bec37f035',1,'stan::agrad::operator<(const var &a, const double &b)'],['../namespacestan_1_1agrad.html#a30910779586484a4244b3730b9a6d7c7',1,'stan::agrad::operator<(const double &a, const var &b)'],['../namespacestan_1_1agrad.html#a46f6bae01b579578493c501932d6df19',1,'stan::agrad::operator<(const fvar< T > &x, double y)'],['../namespacestan_1_1agrad.html#a302261483eb474a1c2791a19a68efb89',1,'stan::agrad::operator<(double x, const fvar< T > &y)'],['../namespacestan_1_1agrad.html#abe5f505189008af63094d119f3e8f375',1,'stan::agrad::operator<(const fvar< T > &x, const fvar< T > &y)'],['../namespacestan_1_1agrad.html#ad3a4834d55bf56c24cc32d847f2c4116',1,'stan::agrad::operator<(const var &a, const double b)'],['../namespacestan_1_1agrad.html#a190ba1fcff502eab8db57971c2fee3c2',1,'stan::agrad::operator<(const double a, const var &b)']]], + ['operator_3c_3c',['operator<<',['../classstan_1_1agrad_1_1var.html#a3545860122fa159c57e23dd0fbfbf5cd',1,'stan::agrad::var::operator<<()'],['../classstan_1_1agrad_1_1vari.html#abd24d4e4eb6b0c65c8447bd2cc73b200',1,'stan::agrad::vari::operator<<()'],['../namespacestan_1_1gm.html#ae9c40c419ed4088b66443029e8359904',1,'stan::gm::operator<<()']]], + ['operator_3c_3d',['operator<=',['../namespacestan_1_1agrad.html#a16c687c4cda4039dc722cfbccb98a836',1,'stan::agrad::operator<=(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#a7994ac18959dc8e5dfa2a2e184e6f844',1,'stan::agrad::operator<=(const var &a, const double &b)'],['../namespacestan_1_1agrad.html#a922f5b8418b94d72ad5751b057fa2a6f',1,'stan::agrad::operator<=(const double &a, const var &b)'],['../namespacestan_1_1agrad.html#a37a95747a6282483fd15682760013967',1,'stan::agrad::operator<=(const fvar< T > &x, const fvar< T > &y)'],['../namespacestan_1_1agrad.html#a85d1a3b82ccc2cdec61adbce358a23de',1,'stan::agrad::operator<=(const fvar< T > &x, double y)'],['../namespacestan_1_1agrad.html#a59152358a21913aa69c58e87fc895559',1,'stan::agrad::operator<=(double x, const fvar< T > &y)'],['../namespacestan_1_1agrad.html#ad79a6afe31a88499457cd316da3228f6',1,'stan::agrad::operator<=(const var &a, const double b)'],['../namespacestan_1_1agrad.html#a95038cb175ff8a78ae74260dad67762a',1,'stan::agrad::operator<=(const double a, const var &b)']]], + ['operator_3d',['operator=',['../structstan_1_1gm_1_1int__literal.html#a1e480a251d65ebd3b68eb0d88886918e',1,'stan::gm::int_literal::operator=()'],['../structstan_1_1gm_1_1double__literal.html#ac89f8c39a91a251fb0af83e2af876d3f',1,'stan::gm::double_literal::operator=()'],['../structstan_1_1gm_1_1array__literal.html#a944703d4016be32de3902eb090e78002',1,'stan::gm::array_literal::operator=()'],['../classstan_1_1mcmc_1_1ps__point.html#a6465e2b1c8c8abf56bd716fcb069be47',1,'stan::mcmc::ps_point::operator=()']]], + ['operator_3d_3d',['operator==',['../structstan_1_1gm_1_1expr__type.html#a40ff8512daac53614b78023e131f4638',1,'stan::gm::expr_type::operator==()'],['../namespacestan_1_1agrad.html#a830d82c706b521cee378eb7e8a0cd7b7',1,'stan::agrad::operator==(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#a927bbd061c1f873a70aca58c803315e0',1,'stan::agrad::operator==(const var &a, const double &b)'],['../namespacestan_1_1agrad.html#a55d28b38ec68e94b1504f657bcfe0e07',1,'stan::agrad::operator==(const double &a, const var &b)'],['../namespacestan_1_1agrad.html#af7ac331f5be998e2ecfbcd7359a295e8',1,'stan::agrad::operator==(const fvar< T > &x, const fvar< T > &y)'],['../namespacestan_1_1agrad.html#a0e5426b1de61dd143a791ea9375ea1f3',1,'stan::agrad::operator==(const fvar< T > &x, double y)'],['../namespacestan_1_1agrad.html#aa935399fdfdb5cb9017062c403623897',1,'stan::agrad::operator==(double x, const fvar< T > &y)'],['../namespacestan_1_1agrad.html#a1188a11f7af64553356cad475e6d6fd7',1,'stan::agrad::operator==(const var &a, const double b)'],['../namespacestan_1_1agrad.html#adf03ce96aca2d91ebfd9082ddb08ab60',1,'stan::agrad::operator==(const double a, const var &b)']]], + ['operator_3e',['operator>',['../namespacestan_1_1agrad.html#ad712e7d5e7b6ac090a17367ce063ad12',1,'stan::agrad::operator>(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#abb74b46284f1c5e4b878a63ee1400cb9',1,'stan::agrad::operator>(const var &a, const double &b)'],['../namespacestan_1_1agrad.html#af3baa98195c96dfda85e1d3e7b3dad18',1,'stan::agrad::operator>(const double &a, const var &b)'],['../namespacestan_1_1agrad.html#a5e161b7bc2dbcb9d990969ccb12499d9',1,'stan::agrad::operator>(const fvar< T > &x, const fvar< T > &y)'],['../namespacestan_1_1agrad.html#a50f810a2b10225f4aaabafb9e7e89054',1,'stan::agrad::operator>(const fvar< T > &x, double y)'],['../namespacestan_1_1agrad.html#ada1ccd3c3b7edb45aa02f9775e9a955d',1,'stan::agrad::operator>(double x, const fvar< T > &y)'],['../namespacestan_1_1agrad.html#a15ed77a2c9f81fb7293fdd4748a6ea53',1,'stan::agrad::operator>(const var &a, const double b)'],['../namespacestan_1_1agrad.html#a8c76a2c886c5a8dfd04a8db314b023dc',1,'stan::agrad::operator>(const double a, const var &b)']]], + ['operator_3e_3d',['operator>=',['../namespacestan_1_1agrad.html#a31cdf0b7a08d01a685d30822f9d395dc',1,'stan::agrad::operator>=(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#aa5ec0b4f2ff8cc4c9119b9cc2a5d3c58',1,'stan::agrad::operator>=(const var &a, const double &b)'],['../namespacestan_1_1agrad.html#af841090352d0e1f31978afbf7e1469db',1,'stan::agrad::operator>=(const double &a, const var &b)'],['../namespacestan_1_1agrad.html#ac654b0ca4c217705ed1bff6503723405',1,'stan::agrad::operator>=(const fvar< T > &x, const fvar< T > &y)'],['../namespacestan_1_1agrad.html#a4edcfc2e7c89ac76c0c43f1d01b9edb1',1,'stan::agrad::operator>=(const fvar< T > &x, double y)'],['../namespacestan_1_1agrad.html#af90b0c11af13e7d31bab2b7429bec732',1,'stan::agrad::operator>=(double x, const fvar< T > &y)'],['../namespacestan_1_1agrad.html#a9907066c12b56235c233ec56e108b684',1,'stan::agrad::operator>=(const var &a, const double b)'],['../namespacestan_1_1agrad.html#a89e08d2dddf60454bbae9c3a7078d14a',1,'stan::agrad::operator>=(const double a, const var &b)']]], + ['operator_5b_5d',['operator[]',['../classstan_1_1agrad_1_1op__matrix__vari.html#a33373afd7da2f7adc9283b5e7b140868',1,'stan::agrad::op_matrix_vari::operator[]()'],['../classstan_1_1agrad_1_1op__vector__vari.html#a4ad5b26a8c5e46b57eec2e9622c13fbc',1,'stan::agrad::op_vector_vari::operator[]()'],['../classstan_1_1math_1_1seq__view.html#abdd1705b880895c4e32e917fad70fb0b',1,'stan::math::seq_view::operator[]()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_01_eigen_1_1_dynamic_00_011_01_4_01_4.html#a6466225a392d75a98f0ae43c5f001820',1,'stan::math::seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, 1 > >::operator[]()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_011_00_01_eigen_1_1_dynamic_01_4_01_4.html#aafd342f1f6f9851fd8f8e3494b36068e',1,'stan::math::seq_view< T, Eigen::Matrix< S, 1, Eigen::Dynamic > >::operator[]()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4.html#ab45edf39aad64a4093db924b02322af9',1,'stan::math::seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, Eigen::Dynamic > >::operator[]()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01_s_01_4_01_4.html#acfe4d699397a114cabd8d970e569aac6',1,'stan::math::seq_view< T, std::vector< S > >::operator[]()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01_t_01_4_01_4.html#afe1bd346e72ac6adc53826801a7e54f2',1,'stan::math::seq_view< T, std::vector< T > >::operator[]()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01std_1_1vector_3_01_t_01_4_01_4_01_4.html#aa8d34d4dd171acbd81d642aea1b8b61e',1,'stan::math::seq_view< T, std::vector< std::vector< T > > >::operator[]()'],['../classstan_1_1math_1_1seq__view_3_01double_00_01std_1_1vector_3_01int_01_4_01_4.html#a05bbd23ec952656521365f99d575a64c',1,'stan::math::seq_view< double, std::vector< int > >::operator[]()'],['../classstan_1_1_vector_view.html#afa380e5d11746837925198eeb8669299',1,'stan::VectorView::operator[]()'],['../classstan_1_1_vector_view_3_01const_01_t_00_01is__array_00_01throw__if__accessed_01_4.html#a4ebd6fad997a99a0cb1ed71e4143befe',1,'stan::VectorView< const T, is_array, throw_if_accessed >::operator[]()'],['../classstan_1_1_vector_view_3_01const_01double_00_01false_00_01false_01_4.html#a2d4a632cfb7533c7ab183c8437b9433c',1,'stan::VectorView< const double, false, false >::operator[]()'],['../classstan_1_1_double_vector_view.html#a2d22664770b4a3061079683994cc5531',1,'stan::DoubleVectorView::operator[]()'],['../classstan_1_1_double_vector_view_3_01true_00_01false_01_4.html#adfc928699f9b1fdd936ff631ab68d405',1,'stan::DoubleVectorView< true, false >::operator[]()'],['../classstan_1_1_double_vector_view_3_01true_00_01true_01_4.html#a7b95c038ecbc5526605715fca51f6737',1,'stan::DoubleVectorView< true, true >::operator[]()']]], + ['operator_5faddition_2ehpp',['operator_addition.hpp',['../fwd_2operators_2operator__addition_8hpp.html',1,'']]], + ['operator_5faddition_2ehpp',['operator_addition.hpp',['../rev_2operators_2operator__addition_8hpp.html',1,'']]], + ['operator_5fdivide_5fequal_2ehpp',['operator_divide_equal.hpp',['../operator__divide__equal_8hpp.html',1,'']]], + ['operator_5fdivision_2ehpp',['operator_division.hpp',['../rev_2operators_2operator__division_8hpp.html',1,'']]], + ['operator_5fdivision_2ehpp',['operator_division.hpp',['../fwd_2operators_2operator__division_8hpp.html',1,'']]], + ['operator_5fequal_2ehpp',['operator_equal.hpp',['../fwd_2operators_2operator__equal_8hpp.html',1,'']]], + ['operator_5fequal_2ehpp',['operator_equal.hpp',['../rev_2operators_2operator__equal_8hpp.html',1,'']]], + ['operator_5fgreater_5fthan_2ehpp',['operator_greater_than.hpp',['../fwd_2operators_2operator__greater__than_8hpp.html',1,'']]], + ['operator_5fgreater_5fthan_2ehpp',['operator_greater_than.hpp',['../rev_2operators_2operator__greater__than_8hpp.html',1,'']]], + ['operator_5fgreater_5fthan_5for_5fequal_2ehpp',['operator_greater_than_or_equal.hpp',['../fwd_2operators_2operator__greater__than__or__equal_8hpp.html',1,'']]], + ['operator_5fgreater_5fthan_5for_5fequal_2ehpp',['operator_greater_than_or_equal.hpp',['../rev_2operators_2operator__greater__than__or__equal_8hpp.html',1,'']]], + ['operator_5fless_5fthan_2ehpp',['operator_less_than.hpp',['../rev_2operators_2operator__less__than_8hpp.html',1,'']]], + ['operator_5fless_5fthan_2ehpp',['operator_less_than.hpp',['../fwd_2operators_2operator__less__than_8hpp.html',1,'']]], + ['operator_5fless_5fthan_5for_5fequal_2ehpp',['operator_less_than_or_equal.hpp',['../fwd_2operators_2operator__less__than__or__equal_8hpp.html',1,'']]], + ['operator_5fless_5fthan_5for_5fequal_2ehpp',['operator_less_than_or_equal.hpp',['../rev_2operators_2operator__less__than__or__equal_8hpp.html',1,'']]], + ['operator_5fminus_5fequal_2ehpp',['operator_minus_equal.hpp',['../operator__minus__equal_8hpp.html',1,'']]], + ['operator_5fmultiplication_2ehpp',['operator_multiplication.hpp',['../fwd_2operators_2operator__multiplication_8hpp.html',1,'']]], + ['operator_5fmultiplication_2ehpp',['operator_multiplication.hpp',['../rev_2operators_2operator__multiplication_8hpp.html',1,'']]], + ['operator_5fmultiply_5fequal_2ehpp',['operator_multiply_equal.hpp',['../operator__multiply__equal_8hpp.html',1,'']]], + ['operator_5fnot_5fequal_2ehpp',['operator_not_equal.hpp',['../fwd_2operators_2operator__not__equal_8hpp.html',1,'']]], + ['operator_5fnot_5fequal_2ehpp',['operator_not_equal.hpp',['../rev_2operators_2operator__not__equal_8hpp.html',1,'']]], + ['operator_5fplus_5fequal_2ehpp',['operator_plus_equal.hpp',['../operator__plus__equal_8hpp.html',1,'']]], + ['operator_5fsubtraction_2ehpp',['operator_subtraction.hpp',['../rev_2operators_2operator__subtraction_8hpp.html',1,'']]], + ['operator_5fsubtraction_2ehpp',['operator_subtraction.hpp',['../fwd_2operators_2operator__subtraction_8hpp.html',1,'']]], + ['operator_5funary_5fdecrement_2ehpp',['operator_unary_decrement.hpp',['../operator__unary__decrement_8hpp.html',1,'']]], + ['operator_5funary_5fincrement_2ehpp',['operator_unary_increment.hpp',['../operator__unary__increment_8hpp.html',1,'']]], + ['operator_5funary_5fminus_2ehpp',['operator_unary_minus.hpp',['../operator__unary__minus_8hpp.html',1,'']]], + ['operator_5funary_5fnegative_2ehpp',['operator_unary_negative.hpp',['../operator__unary__negative_8hpp.html',1,'']]], + ['operator_5funary_5fnot_2ehpp',['operator_unary_not.hpp',['../operator__unary__not_8hpp.html',1,'']]], + ['operator_5funary_5fplus_2ehpp',['operator_unary_plus.hpp',['../operator__unary__plus_8hpp.html',1,'']]], + ['operators_2ehpp',['operators.hpp',['../rev_2operators_8hpp.html',1,'']]], + ['operators_2ehpp',['operators.hpp',['../fwd_2operators_8hpp.html',1,'']]], + ['opt_5fdims_5fr',['opt_dims_r',['../structstan_1_1gm_1_1statement__grammar.html#a11edf3c28eba99f15d511531a874bd55',1,'stan::gm::statement_grammar::opt_dims_r()'],['../structstan_1_1gm_1_1var__decls__grammar.html#abb097b3fed3a38b056724635d2fafa88',1,'stan::gm::var_decls_grammar::opt_dims_r()']]], + ['ordered',['ordered',['../classstan_1_1io_1_1reader.html#ae5597679b7085f74c44ae623ef117410',1,'stan::io::reader']]], + ['ordered_5fconstrain',['ordered_constrain',['../classstan_1_1io_1_1reader.html#ae371520b9f4d28912092b43c40fdccb3',1,'stan::io::reader::ordered_constrain(size_t k)'],['../classstan_1_1io_1_1reader.html#a8e91154c913c5645c8a4ae474f1a6748',1,'stan::io::reader::ordered_constrain(size_t k, T &lp)'],['../namespacestan_1_1prob.html#a5b7b0a65348e29f0f018002a80ed035f',1,'stan::prob::ordered_constrain(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x)'],['../namespacestan_1_1prob.html#a8013ef2d8df4e964a99688d4d5b66b30',1,'stan::prob::ordered_constrain(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, T &lp)']]], + ['ordered_5fdecl_5fr',['ordered_decl_r',['../structstan_1_1gm_1_1var__decls__grammar.html#a9e7481c3a94cac4e78006f7c10fb9cab',1,'stan::gm::var_decls_grammar']]], + ['ordered_5ffree',['ordered_free',['../namespacestan_1_1prob.html#a49254bbed7656ffce7d701755f35591a',1,'stan::prob']]], + ['ordered_5flogistic_2ehpp',['ordered_logistic.hpp',['../ordered__logistic_8hpp.html',1,'']]], + ['ordered_5flogistic_5flog',['ordered_logistic_log',['../namespacestan_1_1prob.html#a08672b48d49723b22234418ea31725e9',1,'stan::prob::ordered_logistic_log(int y, const T_lambda &lambda, const Eigen::Matrix< T_cut, Eigen::Dynamic, 1 > &c)'],['../namespacestan_1_1prob.html#a5dd231c095c24f5c6b344b6b06e85802',1,'stan::prob::ordered_logistic_log(int y, const T_lambda &lambda, const Eigen::Matrix< T_cut, Eigen::Dynamic, 1 > &c)']]], + ['ordered_5flogistic_5frng',['ordered_logistic_rng',['../namespacestan_1_1prob.html#a5becd684e61c1e96447752b65c202465',1,'stan::prob']]], + ['ordered_5funconstrain',['ordered_unconstrain',['../classstan_1_1io_1_1writer.html#af9e8b0cc64f52fe8b893aa68b24efe28',1,'stan::io::writer']]], + ['ordered_5fvar_5fdecl',['ordered_var_decl',['../structstan_1_1gm_1_1ordered__var__decl.html',1,'stan::gm']]], + ['ordered_5fvar_5fdecl',['ordered_var_decl',['../structstan_1_1gm_1_1ordered__var__decl.html#a245a2f9aa050ab85b5586f98a7fa890d',1,'stan::gm::ordered_var_decl::ordered_var_decl()'],['../structstan_1_1gm_1_1ordered__var__decl.html#a805bcb3c7b339fb728ee04a4b1bc3dff',1,'stan::gm::ordered_var_decl::ordered_var_decl(expression const &K, std::string const &name, std::vector< expression > const &dims)']]], + ['owens_5ft',['owens_t',['../namespacestan_1_1agrad.html#a6a34e8ac9ab34d8bd7309b914670f77f',1,'stan::agrad::owens_t(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#ad7c9ae7ec1a20f802579797c3951846d',1,'stan::agrad::owens_t(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a9888ef51a909a957ca30b306cfd90beb',1,'stan::agrad::owens_t(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#a4ffb11bd376c638b747a8be17548b021',1,'stan::agrad::owens_t(const var &h, const var &a)'],['../namespacestan_1_1agrad.html#af68b3a37d8fede3f6ab613cf4278b86c',1,'stan::agrad::owens_t(const var &h, const double &a)'],['../namespacestan_1_1agrad.html#a0e87f87799c9d0290d5c972494e4caea',1,'stan::agrad::owens_t(const double &h, const var &a)'],['../namespacestan_1_1math.html#a66a7e8ebefd11e5801aab51d6ed9c9d8',1,'stan::math::owens_t()']]], + ['owens_5ft_2ehpp',['owens_t.hpp',['../agrad_2rev_2functions_2owens__t_8hpp.html',1,'']]], + ['owens_5ft_2ehpp',['owens_t.hpp',['../agrad_2fwd_2functions_2owens__t_8hpp.html',1,'']]], + ['owens_5ft_2ehpp',['owens_t.hpp',['../math_2functions_2owens__t_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/all_70.html b/doc/api/html/search/all_70.html new file mode 100644 index 00000000000..0340151b687 --- /dev/null +++ b/doc/api/html/search/all_70.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/all_70.js b/doc/api/html/search/all_70.js new file mode 100644 index 00000000000..7f21e7737bf --- /dev/null +++ b/doc/api/html/search/all_70.js @@ -0,0 +1,137 @@ +var searchData= +[ + ['p',['p',['../classstan_1_1mcmc_1_1ps__point.html#a1bb62217e59e573da4cc5ff391c1b2ce',1,'stan::mcmc::ps_point']]], + ['pad_5fhelp_5foption',['pad_help_option',['../namespacestan_1_1io.html#aefe8bb54168558ab08f140cb2886f1e3',1,'stan::io']]], + ['param_5fname',['param_name',['../classstan_1_1mcmc_1_1chains.html#a1205fef2f70da7bdc88d8ff140b5d19b',1,'stan::mcmc::chains']]], + ['param_5fnames',['param_names',['../classstan_1_1mcmc_1_1chains.html#a95881c6244f8c1a59de9dc1b2ada3fbe',1,'stan::mcmc::chains']]], + ['param_5frange_5fi',['param_range_i',['../classstan_1_1model_1_1prob__grad.html#ac0eefb4d3d667a368820f0e7d2fb847c',1,'stan::model::prob_grad']]], + ['param_5franges_5fi_5f_5f',['param_ranges_i__',['../classstan_1_1model_1_1prob__grad.html#a19436879a5602e7b47676ce3a6ea8f5f',1,'stan::model::prob_grad']]], + ['param_5fvar_5fdecls_5fr',['param_var_decls_r',['../structstan_1_1gm_1_1program__grammar.html#a84e0908a657b1bc073abd5a134e53bc8',1,'stan::gm::program_grammar']]], + ['parameter_5fdecl_5f',['parameter_decl_',['../structstan_1_1gm_1_1program.html#aa468fc1c6838a4a02031d41391d0feee',1,'stan::gm::program']]], + ['parameter_5forigin',['parameter_origin',['../namespacestan_1_1gm.html#a15fbbd2865f57526a81f238175751b83',1,'stan::gm']]], + ['params_5fr',['params_r',['../classstan_1_1optimization_1_1_b_f_g_s_line_search.html#a3668e57491999e53bc083fa9ce7be0c2',1,'stan::optimization::BFGSLineSearch::params_r()'],['../classstan_1_1optimization_1_1_nesterov_gradient.html#a8b9b14a7b025c2978785d4b289c03a87',1,'stan::optimization::NesterovGradient::params_r()']]], + ['pareto_2ehpp',['pareto.hpp',['../pareto_8hpp.html',1,'']]], + ['pareto_5fccdf_5flog',['pareto_ccdf_log',['../namespacestan_1_1prob.html#adbbe4b2736aa52b527690320f589f444',1,'stan::prob']]], + ['pareto_5fcdf',['pareto_cdf',['../namespacestan_1_1prob.html#a7f3bb39af8cf343288bc03b08d4995c1',1,'stan::prob']]], + ['pareto_5fcdf_5flog',['pareto_cdf_log',['../namespacestan_1_1prob.html#a355fe2fac0b8f75ba9152a5641584db0',1,'stan::prob']]], + ['pareto_5flog',['pareto_log',['../namespacestan_1_1prob.html#a6f227b32b40751c0969ed9208e53f250',1,'stan::prob::pareto_log(const T_y &y, const T_scale &y_min, const T_shape &alpha)'],['../namespacestan_1_1prob.html#ae76190b63d49cd29c4cf6cec4e530d2c',1,'stan::prob::pareto_log(const T_y &y, const T_scale &y_min, const T_shape &alpha)']]], + ['pareto_5frng',['pareto_rng',['../namespacestan_1_1prob.html#a28f8c3e807edaa26151a701410dbe540',1,'stan::prob']]], + ['parse',['parse',['../classstan_1_1io_1_1stan__csv__reader.html#a113f6a5169758e1c03370b0156f926e3',1,'stan::io::stan_csv_reader::parse()'],['../namespacestan_1_1gm.html#a027bc5ebd84646c7ce8fb6128e33dae8',1,'stan::gm::parse()']]], + ['parse_5fargs',['parse_args',['../classstan_1_1gm_1_1argument.html#ab89f5fe38e4a01cd098d5c38b25b63bd',1,'stan::gm::argument::parse_args()'],['../classstan_1_1gm_1_1argument__parser.html#acc91054d8cad8ed7b123bfc008589f91',1,'stan::gm::argument_parser::parse_args()'],['../classstan_1_1gm_1_1categorical__argument.html#aa5fcc67aed6fecfb8b1b4b430fbe8f9e',1,'stan::gm::categorical_argument::parse_args()'],['../classstan_1_1gm_1_1list__argument.html#a70d41fb22dbc0d4b7be35ad12ee28cd8',1,'stan::gm::list_argument::parse_args()'],['../classstan_1_1gm_1_1singleton__argument.html#a6ae2898ccb341e201a3f70af8d63b34f',1,'stan::gm::singleton_argument::parse_args()'],['../classstan_1_1gm_1_1unvalued__argument.html#a43ec298199e879d2254b0b22a07932fd',1,'stan::gm::unvalued_argument::parse_args()']]], + ['parser_2ehpp',['parser.hpp',['../parser_8hpp.html',1,'']]], + ['partial_5fderivative',['partial_derivative',['../namespacestan_1_1agrad.html#ad8a49a8b8a5b06f4053c40cb64a1fe48',1,'stan::agrad']]], + ['partials_5f',['partials_',['../classstan_1_1agrad_1_1stored__gradient__vari.html#a6cc0dc9d0c215f4eedd8684f8d9d04ec',1,'stan::agrad::stored_gradient_vari']]], + ['partials_5fvari',['partials_vari',['../classstan_1_1agrad_1_1partials__vari.html',1,'stan::agrad']]], + ['partials_5fvari',['partials_vari',['../classstan_1_1agrad_1_1partials__vari.html#a8c03a1f677444ee503551cc9cc718467',1,'stan::agrad::partials_vari']]], + ['partials_5fvari_2ehpp',['partials_vari.hpp',['../partials__vari_8hpp.html',1,'']]], + ['pass_5ftype',['pass_type',['../structstan_1_1math_1_1pass__type.html',1,'stan::math']]], + ['pass_5ftype_3c_20double_20_3e',['pass_type< double >',['../structstan_1_1math_1_1pass__type_3_01double_01_4.html',1,'stan::math']]], + ['pass_5ftype_3c_20int_20_3e',['pass_type< int >',['../structstan_1_1math_1_1pass__type_3_01int_01_4.html',1,'stan::math']]], + ['patch_5fversion',['PATCH_VERSION',['../namespacestan.html#ae9ae37a39676ea8ca7cbfeffce12f938',1,'stan']]], + ['phi',['phi',['../classstan_1_1mcmc_1_1base__hamiltonian.html#a4daa5d6148f56985b92397eb637868d8',1,'stan::mcmc::base_hamiltonian::phi()'],['../classstan_1_1mcmc_1_1dense__e__metric.html#a132d41ed5cea3b3f4e83f4d27f6e0984',1,'stan::mcmc::dense_e_metric::phi()'],['../classstan_1_1mcmc_1_1diag__e__metric.html#aab16db232dd37b1227032249d01dd0b5',1,'stan::mcmc::diag_e_metric::phi()'],['../classstan_1_1mcmc_1_1unit__e__metric.html#af866a9fc23c184997591e3377ad6e2bb',1,'stan::mcmc::unit_e_metric::phi()'],['../namespacestan_1_1agrad.html#a310443649bed5c3a85c01ee0cb5a8499',1,'stan::agrad::Phi(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#aab4d19226597a86f74257bde4f457521',1,'stan::agrad::Phi(const stan::agrad::var &a)'],['../namespacestan_1_1math.html#ac85644bbd92359d699f374adea62c643',1,'stan::math::Phi()']]], + ['phi_2ehpp',['Phi.hpp',['../agrad_2fwd_2functions_2_phi_8hpp.html',1,'']]], + ['phi_2ehpp',['Phi.hpp',['../agrad_2rev_2functions_2_phi_8hpp.html',1,'']]], + ['phi_2ehpp',['Phi.hpp',['../math_2functions_2_phi_8hpp.html',1,'']]], + ['phi_5fapprox',['Phi_approx',['../namespacestan_1_1agrad.html#a8332749395cd428484eb176964e28052',1,'stan::agrad::Phi_approx()'],['../namespacestan_1_1math.html#a6cf4bf2074175fd7bcde43f9f94e4d16',1,'stan::math::Phi_approx()']]], + ['phi_5fapprox_2ehpp',['Phi_approx.hpp',['../agrad_2rev_2functions_2_phi__approx_8hpp.html',1,'']]], + ['phi_5fapprox_2ehpp',['Phi_approx.hpp',['../math_2functions_2_phi__approx_8hpp.html',1,'']]], + ['pi',['pi',['../namespacestan_1_1math.html#aa2ffd66726e0532160e16e6b48d6f428',1,'stan::math']]], + ['poisson_2ehpp',['poisson.hpp',['../poisson_8hpp.html',1,'']]], + ['poisson_5fccdf_5flog',['poisson_ccdf_log',['../namespacestan_1_1prob.html#a47e7fb827ea3efb81744f00ae02d3c8c',1,'stan::prob']]], + ['poisson_5fcdf',['poisson_cdf',['../namespacestan_1_1prob.html#a493a94836898c1c7daeefc66f76f3bcb',1,'stan::prob']]], + ['poisson_5fcdf_5flog',['poisson_cdf_log',['../namespacestan_1_1prob.html#a4bcc9d28c6419db6908062a120203225',1,'stan::prob']]], + ['poisson_5flog',['poisson_log',['../namespacestan_1_1prob.html#a4af491958f18e73de79a50f0eeab5cbf',1,'stan::prob::poisson_log(const T_n &n, const T_rate &lambda)'],['../namespacestan_1_1prob.html#a4c14df398fd68d83f82e93d7cf012e88',1,'stan::prob::poisson_log(const T_n &n, const T_rate &lambda)']]], + ['poisson_5flog_5flog',['poisson_log_log',['../namespacestan_1_1prob.html#a37ad053fe5e90d0886876e8be27e57f5',1,'stan::prob::poisson_log_log(const T_n &n, const T_log_rate &alpha)'],['../namespacestan_1_1prob.html#a4e7496b229fa8eb51083e449cfd20704',1,'stan::prob::poisson_log_log(const T_n &n, const T_log_rate &alpha)']]], + ['poisson_5frng',['poisson_rng',['../namespacestan_1_1prob.html#ae76f4412a22e18c1aacf098ab6c41dc5',1,'stan::prob']]], + ['pos_5fiterator_5ft',['pos_iterator_t',['../namespacestan_1_1gm.html#aa941962f9fda48879b4d84fd518852c9',1,'stan::gm']]], + ['positive_5fconstrain',['positive_constrain',['../namespacestan_1_1prob.html#a9cb1d75e59f02fa90c1052b403012dc8',1,'stan::prob::positive_constrain(const T x)'],['../namespacestan_1_1prob.html#a2ee662d6ef96688a59a873ef6e41a461',1,'stan::prob::positive_constrain(const T x, T &lp)']]], + ['positive_5ffree',['positive_free',['../namespacestan_1_1prob.html#af8aecbd34195ffe481fb331d62c7b9d5',1,'stan::prob']]], + ['positive_5finfinity',['positive_infinity',['../namespacestan_1_1math.html#a34675a70d3df614d88d33ddbdd49b49a',1,'stan::math']]], + ['positive_5fordered',['positive_ordered',['../classstan_1_1io_1_1reader.html#ac3f49da1bc5719a4cd6da4b35f488b34',1,'stan::io::reader']]], + ['positive_5fordered_5fconstrain',['positive_ordered_constrain',['../classstan_1_1io_1_1reader.html#aedeee305b5de15af5e1e296a07649dc2',1,'stan::io::reader::positive_ordered_constrain(size_t k)'],['../classstan_1_1io_1_1reader.html#ad2794458867712e2e7dd40674b8e2196',1,'stan::io::reader::positive_ordered_constrain(size_t k, T &lp)'],['../namespacestan_1_1prob.html#a264b000ea11a127f82b2a635c37af760',1,'stan::prob::positive_ordered_constrain(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x)'],['../namespacestan_1_1prob.html#ac046e29dc1e72c04cad85faf7884b1e8',1,'stan::prob::positive_ordered_constrain(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, T &lp)']]], + ['positive_5fordered_5fdecl_5fr',['positive_ordered_decl_r',['../structstan_1_1gm_1_1var__decls__grammar.html#a18e4327f093a7e92cc4b2bca94d50470',1,'stan::gm::var_decls_grammar']]], + ['positive_5fordered_5ffree',['positive_ordered_free',['../namespacestan_1_1prob.html#aed117c56ae59674e81e38faadf423a4d',1,'stan::prob']]], + ['positive_5fordered_5funconstrain',['positive_ordered_unconstrain',['../classstan_1_1io_1_1writer.html#adf62c05a81fce5b27e1a2bdcd2eb51f3',1,'stan::io::writer']]], + ['positive_5fordered_5fvar_5fdecl',['positive_ordered_var_decl',['../structstan_1_1gm_1_1positive__ordered__var__decl.html',1,'stan::gm']]], + ['positive_5fordered_5fvar_5fdecl',['positive_ordered_var_decl',['../structstan_1_1gm_1_1positive__ordered__var__decl.html#af60da77bab73766c34a6322d0c75d129',1,'stan::gm::positive_ordered_var_decl::positive_ordered_var_decl()'],['../structstan_1_1gm_1_1positive__ordered__var__decl.html#aa92b00bd4b03fa2192bdecbc3c816539',1,'stan::gm::positive_ordered_var_decl::positive_ordered_var_decl(expression const &K, std::string const &name, std::vector< expression > const &dims)']]], + ['pow',['pow',['../namespacestan_1_1agrad.html#ab1f104b0302a07417e72b4dbae3fc74c',1,'stan::agrad::pow(const var &base, const var &exponent)'],['../namespacestan_1_1agrad.html#abff57b6f6ebb58545a7e8d4a0c05611d',1,'stan::agrad::pow(const var &base, const double &exponent)'],['../namespacestan_1_1agrad.html#a8e4a959251353750a1656804b46507fd',1,'stan::agrad::pow(const double &base, const var &exponent)'],['../namespacestan_1_1agrad.html#a2d8fddd3123eb3574ff8e06d4fc7248d',1,'stan::agrad::pow(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#ace3246b2d3ac1a77d9f4a0f8974960b8',1,'stan::agrad::pow(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a25f02a3133f34b96d74727823e21d70b',1,'stan::agrad::pow(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#add7765fa6394e825bd26a69f84218193',1,'stan::agrad::pow(const var &base, const double exponent)'],['../namespacestan_1_1agrad.html#acd1d27b770b1609c7f161ed57c4621ac',1,'stan::agrad::pow(const double base, const var &exponent)']]], + ['pow_2ehpp',['pow.hpp',['../fwd_2functions_2pow_8hpp.html',1,'']]], + ['pow_2ehpp',['pow.hpp',['../rev_2functions_2pow_8hpp.html',1,'']]], + ['precomp_5fv_5fvari',['precomp_v_vari',['../classstan_1_1agrad_1_1precomp__v__vari.html',1,'stan::agrad']]], + ['precomp_5fv_5fvari',['precomp_v_vari',['../classstan_1_1agrad_1_1precomp__v__vari.html#a3ca5c79bf568105418d1b0048a96967f',1,'stan::agrad::precomp_v_vari']]], + ['precomp_5fv_5fvari_2ehpp',['precomp_v_vari.hpp',['../precomp__v__vari_8hpp.html',1,'']]], + ['prev_5ff',['prev_f',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#ab29933c9bf9263b7b165b589c0e1aba3',1,'stan::optimization::BFGSMinimizer']]], + ['prev_5fg',['prev_g',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a846398bc345d84bab66dc1f1df9e95e0',1,'stan::optimization::BFGSMinimizer']]], + ['prev_5fs',['prev_s',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a902e16cc988e9ca31cace95dea86dfb7',1,'stan::optimization::BFGSMinimizer']]], + ['prev_5fstep_5fsize',['prev_step_size',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a5fe16e6f70fed6e1911fe856cd52476e',1,'stan::optimization::BFGSMinimizer']]], + ['prev_5fx',['prev_x',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a000b87bcf59d279ba44efec85f971078',1,'stan::optimization::BFGSMinimizer']]], + ['print',['print',['../classstan_1_1gm_1_1argument.html#a00e74796257dff5e01e40a771a6bdc93',1,'stan::gm::argument::print()'],['../classstan_1_1gm_1_1argument__parser.html#a0d439a88a50a5497f76bbc5f020aaf91',1,'stan::gm::argument_parser::print()'],['../classstan_1_1gm_1_1categorical__argument.html#a571a79c8271b50dee3a49641690773cf',1,'stan::gm::categorical_argument::print()'],['../classstan_1_1gm_1_1list__argument.html#a55f86d294e39ee6a422bdf1308fb3e5b',1,'stan::gm::list_argument::print()'],['../classstan_1_1gm_1_1unvalued__argument.html#ad9feae771a79a8c5d8f96111b6bb08e5',1,'stan::gm::unvalued_argument::print()'],['../classstan_1_1gm_1_1valued__argument.html#a4b22c1fa6c57037233201ba7f800cf1a',1,'stan::gm::valued_argument::print()'],['../classstan_1_1io_1_1cmd__line.html#a7b567a1d5ff8fbfd102541ff7165f0a8',1,'stan::io::cmd_line::print()']]], + ['print_2ecpp',['print.cpp',['../print_8cpp.html',1,'']]], + ['print_2ehpp',['print.hpp',['../print_8hpp.html',1,'']]], + ['print_5fadapt_5ffinish',['print_adapt_finish',['../classstan_1_1io_1_1mcmc__writer.html#a19e50100237ae6ceedb36f3485db0a98',1,'stan::io::mcmc_writer::print_adapt_finish(stan::mcmc::base_mcmc *sampler, std::ostream *stream)'],['../classstan_1_1io_1_1mcmc__writer.html#a8e38711ae1d5cb3562d739e65a26a672',1,'stan::io::mcmc_writer::print_adapt_finish(stan::mcmc::base_mcmc *sampler)']]], + ['print_5fdiagnostic_5fnames',['print_diagnostic_names',['../classstan_1_1io_1_1mcmc__writer.html#a92e6f182bccdd993e73f751e5aafd7e9',1,'stan::io::mcmc_writer']]], + ['print_5fdiagnostic_5fparams',['print_diagnostic_params',['../classstan_1_1io_1_1mcmc__writer.html#a611c78b4786bb2a649bbaa660350dc35',1,'stan::io::mcmc_writer']]], + ['print_5fhelp',['print_help',['../classstan_1_1gm_1_1argument.html#aa2e3ed12ca3904af93b24c42f8a008ff',1,'stan::gm::argument::print_help()'],['../classstan_1_1gm_1_1argument__parser.html#a9ab402e181e3de508c3a7b594cb67960',1,'stan::gm::argument_parser::print_help()'],['../classstan_1_1gm_1_1categorical__argument.html#a6d8744329f8af88ec15747b57851bc67',1,'stan::gm::categorical_argument::print_help()'],['../classstan_1_1gm_1_1list__argument.html#a55d7f8d70a85d02895446acc7e9402ee',1,'stan::gm::list_argument::print_help()'],['../classstan_1_1gm_1_1unvalued__argument.html#a97c066f9a95356069ff6923d483ea03b',1,'stan::gm::unvalued_argument::print_help()'],['../classstan_1_1gm_1_1valued__argument.html#a67c2fcf60e605b17de08ef051e54876c',1,'stan::gm::valued_argument::print_help()']]], + ['print_5fhelp_5fhelper',['print_help_helper',['../namespacestan_1_1io.html#a6a7173ea51d2f2c2dc710d3a846fc732',1,'stan::io']]], + ['print_5fhelp_5foption',['print_help_option',['../namespacestan_1_1io.html#a0b47261532cf7c027e939aca02088c06',1,'stan::io']]], + ['print_5fprogress',['print_progress',['../namespacestan_1_1gm.html#a36c90a4a1e6a4833c1e3a12a964f31dc',1,'stan::gm']]], + ['print_5fquoted_5fexpression',['print_quoted_expression',['../namespacestan_1_1gm.html#a53960511e1fa7ae0e66d681f3055f199',1,'stan::gm']]], + ['print_5fsample_5fnames',['print_sample_names',['../classstan_1_1io_1_1mcmc__writer.html#a4ff21af4911d312b84f3ad955c6be1f7',1,'stan::io::mcmc_writer']]], + ['print_5fsample_5fparams',['print_sample_params',['../classstan_1_1io_1_1mcmc__writer.html#a1141fad60b8e8587b5f84ded115a870f',1,'stan::io::mcmc_writer']]], + ['print_5fstack',['print_stack',['../namespacestan_1_1agrad.html#a77de304bacc69535fb9a5ccd52454219',1,'stan::agrad']]], + ['print_5fstack_2ehpp',['print_stack.hpp',['../print__stack_8hpp.html',1,'']]], + ['print_5fstanc_5fhelp',['print_stanc_help',['../stanc__helper_8hpp.html#ab8ff534ebd7aa89be78b2b9e65f5f33a',1,'stanc_helper.hpp']]], + ['print_5fstatement',['print_statement',['../structstan_1_1gm_1_1print__statement.html',1,'stan::gm']]], + ['print_5fstatement',['print_statement',['../structstan_1_1gm_1_1print__statement.html#aeebe03d9212e3ddbe4fabdaf4873a466',1,'stan::gm::print_statement::print_statement()'],['../structstan_1_1gm_1_1print__statement.html#ab4522e7d5640848cebed9fd2509bfd32',1,'stan::gm::print_statement::print_statement(const std::vector< printable > &printables)']]], + ['print_5fstatement_5fr',['print_statement_r',['../structstan_1_1gm_1_1statement__grammar.html#a481ea25baea5242da113c3e80b830bf8',1,'stan::gm::statement_grammar']]], + ['print_5fstring_5fliteral',['print_string_literal',['../namespacestan_1_1gm.html#ab0047255699c74937f85d6fc52a25cb7',1,'stan::gm']]], + ['print_5ftiming',['print_timing',['../classstan_1_1io_1_1mcmc__writer.html#acec599e2966fe94577b9a5e125edc058',1,'stan::io::mcmc_writer::print_timing(double warmDeltaT, double sampleDeltaT, std::ostream *stream, const char prefix= '\0')'],['../classstan_1_1io_1_1mcmc__writer.html#a18d3702721db48c5a6a6ae0f693988fe',1,'stan::io::mcmc_writer::print_timing(double warmDeltaT, double sampleDeltaT)']]], + ['print_5fusage',['print_usage',['../classstan_1_1gm_1_1argument__parser.html#aab87bcb3b493725f33fe83d51a402f92',1,'stan::gm::argument_parser::print_usage()'],['../print_8hpp.html#ae5ad5cbeccaedc03a48d3c7eaa803e79',1,'print_usage(): print.hpp']]], + ['print_5fvalid',['print_valid',['../classstan_1_1gm_1_1list__argument.html#aec1358b17e4ab6e88093d9601bd574ad',1,'stan::gm::list_argument::print_valid()'],['../classstan_1_1gm_1_1singleton__argument.html#a8b1ec553f2faad91f393a16301f283b7',1,'stan::gm::singleton_argument::print_valid()'],['../classstan_1_1gm_1_1valued__argument.html#a71e5e9f18b38112a0f37e631e06479c2',1,'stan::gm::valued_argument::print_valid()']]], + ['print_5fvalue',['print_value',['../classstan_1_1gm_1_1list__argument.html#a7fe07f7eb68fcbe07902f275c36a9de7',1,'stan::gm::list_argument::print_value()'],['../classstan_1_1gm_1_1singleton__argument.html#a314ff92f87549d7b79966e5ff0148f27',1,'stan::gm::singleton_argument::print_value()'],['../classstan_1_1gm_1_1valued__argument.html#a3d7db8f03b459a944745799cb17fbb22',1,'stan::gm::valued_argument::print_value()']]], + ['print_5fvar_5forigin',['print_var_origin',['../namespacestan_1_1gm.html#afbacd22142d44e8f79d40a512441c060',1,'stan::gm']]], + ['print_5fversion',['print_version',['../stanc__helper_8hpp.html#a89aadce7a620baad44661f64650a2c57',1,'stanc_helper.hpp']]], + ['printable',['printable',['../structstan_1_1gm_1_1printable.html',1,'stan::gm']]], + ['printable',['printable',['../structstan_1_1gm_1_1printable.html#a08d5587f674f2bcea656dfc21b4368a7',1,'stan::gm::printable::printable()'],['../structstan_1_1gm_1_1printable.html#a698c3a1a3e88fe55ef803940688f2fe7',1,'stan::gm::printable::printable(const expression &expression)'],['../structstan_1_1gm_1_1printable.html#aa88ce12741897574e993ddf73630a2dc',1,'stan::gm::printable::printable(const std::string &msg)'],['../structstan_1_1gm_1_1printable.html#ab6c9efb0d66476e95420d0d0a9a34971',1,'stan::gm::printable::printable(const printable_t &printable)'],['../structstan_1_1gm_1_1printable.html#a73fd1eca794d1abeedf35458c1298fcc',1,'stan::gm::printable::printable(const printable &printable)']]], + ['printable_5f',['printable_',['../structstan_1_1gm_1_1printable.html#ac9bcfe693d24c2c7b3363596fc380b26',1,'stan::gm::printable']]], + ['printable_5fr',['printable_r',['../structstan_1_1gm_1_1statement__grammar.html#a54e7e6691e72cb4983d430c033777431',1,'stan::gm::statement_grammar']]], + ['printable_5fstring_5fr',['printable_string_r',['../structstan_1_1gm_1_1statement__grammar.html#a5ba49f86716949ae1bc36585d081aba8',1,'stan::gm::statement_grammar']]], + ['printable_5ft',['printable_t',['../structstan_1_1gm_1_1printable.html#a0fe5ff9b4d1c7581f75ab444b6e9828b',1,'stan::gm::printable']]], + ['printable_5fvisgen',['printable_visgen',['../structstan_1_1gm_1_1printable__visgen.html',1,'stan::gm']]], + ['printable_5fvisgen',['printable_visgen',['../structstan_1_1gm_1_1printable__visgen.html#a07ac177e70ed67abf0a8c104ae00c12b',1,'stan::gm::printable_visgen']]], + ['printables_5f',['printables_',['../structstan_1_1gm_1_1print__statement.html#a2de577f68c38d6494d0c5b01337c3106',1,'stan::gm::print_statement']]], + ['prob',['prob',['../classstan_1_1io_1_1reader.html#ad57e12e95a36df2d9448f6123e3d2cfa',1,'stan::io::reader']]], + ['prob_2ehpp',['prob.hpp',['../prob_8hpp.html',1,'']]], + ['prob_5fconstrain',['prob_constrain',['../classstan_1_1io_1_1reader.html#a2d999e486addc7652b2be90365b89bc4',1,'stan::io::reader::prob_constrain()'],['../classstan_1_1io_1_1reader.html#a07a0565ad1ff42fe678bcb51ed748455',1,'stan::io::reader::prob_constrain(T &lp)'],['../namespacestan_1_1prob.html#a675a89a2298e205693a1291bff9e8517',1,'stan::prob::prob_constrain(const T x)'],['../namespacestan_1_1prob.html#a5c2e4977a32258e859e18c3d93ff7fb2',1,'stan::prob::prob_constrain(const T x, T &lp)']]], + ['prob_5ffree',['prob_free',['../namespacestan_1_1prob.html#a6df28f004649a2e2453b2dc068dce763',1,'stan::prob']]], + ['prob_5fgrad',['prob_grad',['../classstan_1_1model_1_1prob__grad.html',1,'stan::model']]], + ['prob_5fgrad',['prob_grad',['../classstan_1_1model_1_1prob__grad.html#a8b51f2731af4391fb46981ee6d65deb6',1,'stan::model::prob_grad::prob_grad(size_t num_params_r)'],['../classstan_1_1model_1_1prob__grad.html#a879682609a70983fde0ac281a6a3c5d0',1,'stan::model::prob_grad::prob_grad(size_t num_params_r, std::vector< std::pair< int, int > > &param_ranges_i)']]], + ['prob_5fgrad_2ehpp',['prob_grad.hpp',['../prob__grad_8hpp.html',1,'']]], + ['prob_5funconstrain',['prob_unconstrain',['../classstan_1_1io_1_1writer.html#a320165b59bc22f73db4898d4d4a5a7e1',1,'stan::io::writer']]], + ['probe_5fargs',['probe_args',['../classstan_1_1gm_1_1argument.html#a1d9fabf656c50a0e5bc3d5d47ca091aa',1,'stan::gm::argument::probe_args()'],['../classstan_1_1gm_1_1argument__probe.html#a4754d08a83d1bdf23e18ceb1b16dc26a',1,'stan::gm::argument_probe::probe_args()'],['../classstan_1_1gm_1_1categorical__argument.html#a5d662cc0b84b02e3b3622a0eeec02bf7',1,'stan::gm::categorical_argument::probe_args()'],['../classstan_1_1gm_1_1list__argument.html#a0ffea05532b87732f82f2099e189306e',1,'stan::gm::list_argument::probe_args()'],['../classstan_1_1gm_1_1singleton__argument.html#aaf5dc642547b460e7df60fd9a1e3a025',1,'stan::gm::singleton_argument::probe_args()']]], + ['prod',['prod',['../namespacestan_1_1math.html#a1649a895ec6e79097d5645a3f8b8a1e6',1,'stan::math::prod(const std::vector< T > &v)'],['../namespacestan_1_1math.html#ad7082de8742d87f7a0fa0842207341c9',1,'stan::math::prod(const Eigen::Matrix< T, R, C > &v)']]], + ['prod_2ehpp',['prod.hpp',['../prod_8hpp.html',1,'']]], + ['program',['program',['../structstan_1_1gm_1_1program.html#a3bdfcb0bc8822d6edd2253bda7dcbfdb',1,'stan::gm::program::program()'],['../structstan_1_1gm_1_1program.html#aa11648de93a4e6496c0cfe7850134436',1,'stan::gm::program::program(const std::vector< var_decl > &data_decl, const std::pair< std::vector< var_decl >, std::vector< statement > > &derived_data_decl, const std::vector< var_decl > &parameter_decl, const std::pair< std::vector< var_decl >, std::vector< statement > > &derived_decl, const statement &st, const std::pair< std::vector< var_decl >, std::vector< statement > > &generated_decl)']]], + ['program',['program',['../structstan_1_1gm_1_1program.html',1,'stan::gm']]], + ['program_5fgrammar',['program_grammar',['../structstan_1_1gm_1_1program__grammar.html#a37628310038c1d41ac858edc87763f6e',1,'stan::gm::program_grammar']]], + ['program_5fgrammar',['program_grammar',['../structstan_1_1gm_1_1program__grammar.html',1,'stan::gm']]], + ['program_5fgrammar_2ehpp',['program_grammar.hpp',['../program__grammar_8hpp.html',1,'']]], + ['program_5fgrammar_5fdef_2ehpp',['program_grammar_def.hpp',['../program__grammar__def_8hpp.html',1,'']]], + ['program_5fgrammar_5finst_2ecpp',['program_grammar_inst.cpp',['../program__grammar__inst_8cpp.html',1,'']]], + ['program_5fr',['program_r',['../structstan_1_1gm_1_1program__grammar.html#a6db277442a938e2a146edcb2d7f8ebb0',1,'stan::gm::program_grammar']]], + ['promote',['promote',['../structstan_1_1math_1_1promoter.html#ab3df6e7131a09943826d1b995142d7d6',1,'stan::math::promoter::promote()'],['../structstan_1_1math_1_1promoter_3_01_t_00_01_t_01_4.html#ac8db3f3f3410059f5cae51383f1b38c2',1,'stan::math::promoter< T, T >::promote()'],['../structstan_1_1math_1_1promoter_3_01std_1_1vector_3_01_f_01_4_00_01std_1_1vector_3_01_t_01_4_01_4.html#a357d5eb63ba812437c51640670cef745',1,'stan::math::promoter< std::vector< F >, std::vector< T > >::promote()'],['../structstan_1_1math_1_1promoter_3_01std_1_1vector_3_01_t_01_4_00_01std_1_1vector_3_01_t_01_4_01_4.html#adb1706254fcd6734bf986e2cd01b093f',1,'stan::math::promoter< std::vector< T >, std::vector< T > >::promote()'],['../structstan_1_1math_1_1promoter_3_01_eigen_1_1_matrix_3_01_f_00_01_r_00_01_c_01_4_00_01_eigen_1_142b48fda94601374e41a81325f3f7b84.html#a9964d13b9f2f05efca2b21ac165210d8',1,'stan::math::promoter< Eigen::Matrix< F, R, C >, Eigen::Matrix< T, R, C > >::promote()'],['../structstan_1_1math_1_1promoter_3_01_eigen_1_1_matrix_3_01_t_00_01_r_00_01_c_01_4_00_01_eigen_1_12d7fadf0560f1f2f3abc5388b7666f9c.html#a525fc8cb91f5c4c22195cdb004b1eb0f',1,'stan::math::promoter< Eigen::Matrix< T, R, C >, Eigen::Matrix< T, R, C > >::promote()']]], + ['promote_5fcommon',['promote_common',['../namespacestan_1_1math.html#a91458631115a8d1cf29298431f745556',1,'stan::math']]], + ['promote_5fcommon_2ehpp',['promote_common.hpp',['../promote__common_8hpp.html',1,'']]], + ['promote_5fprimitive',['promote_primitive',['../namespacestan_1_1gm.html#a6ca8ea09cf26b1fdd7c5e31c8febd8d9',1,'stan::gm::promote_primitive(const expr_type &et)'],['../namespacestan_1_1gm.html#a08ffae837e524e7ee4ede3cc51c7a2fb',1,'stan::gm::promote_primitive(const expr_type &et1, const expr_type &et2)']]], + ['promote_5fto',['promote_to',['../structstan_1_1math_1_1promoter.html#a892e350b17a5930b9de4a9ff05eddc39',1,'stan::math::promoter::promote_to()'],['../structstan_1_1math_1_1promoter_3_01_t_00_01_t_01_4.html#a108a1ffe4c0560f0c0b384270ea801f1',1,'stan::math::promoter< T, T >::promote_to()'],['../structstan_1_1math_1_1promoter_3_01std_1_1vector_3_01_f_01_4_00_01std_1_1vector_3_01_t_01_4_01_4.html#a3da744179c9bbe7fe2ac326a4dcba352',1,'stan::math::promoter< std::vector< F >, std::vector< T > >::promote_to()'],['../structstan_1_1math_1_1promoter_3_01std_1_1vector_3_01_t_01_4_00_01std_1_1vector_3_01_t_01_4_01_4.html#a099437577ccd004d58c5b2ee3e5acf06',1,'stan::math::promoter< std::vector< T >, std::vector< T > >::promote_to()'],['../structstan_1_1math_1_1promoter_3_01_eigen_1_1_matrix_3_01_f_00_01_r_00_01_c_01_4_00_01_eigen_1_142b48fda94601374e41a81325f3f7b84.html#a7ed5c4e3899aca0cb2ed4cea530807af',1,'stan::math::promoter< Eigen::Matrix< F, R, C >, Eigen::Matrix< T, R, C > >::promote_to()'],['../structstan_1_1math_1_1promoter_3_01_eigen_1_1_matrix_3_01_t_00_01_r_00_01_c_01_4_00_01_eigen_1_12d7fadf0560f1f2f3abc5388b7666f9c.html#a46f61632d1bdeede4431d730b4251d37',1,'stan::math::promoter< Eigen::Matrix< T, R, C >, Eigen::Matrix< T, R, C > >::promote_to()']]], + ['promoter',['promoter',['../structstan_1_1math_1_1promoter.html',1,'stan::math']]], + ['promoter_2ehpp',['promoter.hpp',['../promoter_8hpp.html',1,'']]], + ['promoter_3c_20eigen_3a_3amatrix_3c_20f_2c_20r_2c_20c_20_3e_2c_20eigen_3a_3amatrix_3c_20t_2c_20r_2c_20c_20_3e_20_3e',['promoter< Eigen::Matrix< F, R, C >, Eigen::Matrix< T, R, C > >',['../structstan_1_1math_1_1promoter_3_01_eigen_1_1_matrix_3_01_f_00_01_r_00_01_c_01_4_00_01_eigen_1_142b48fda94601374e41a81325f3f7b84.html',1,'stan::math']]], + ['promoter_3c_20eigen_3a_3amatrix_3c_20t_2c_20r_2c_20c_20_3e_2c_20eigen_3a_3amatrix_3c_20t_2c_20r_2c_20c_20_3e_20_3e',['promoter< Eigen::Matrix< T, R, C >, Eigen::Matrix< T, R, C > >',['../structstan_1_1math_1_1promoter_3_01_eigen_1_1_matrix_3_01_t_00_01_r_00_01_c_01_4_00_01_eigen_1_12d7fadf0560f1f2f3abc5388b7666f9c.html',1,'stan::math']]], + ['promoter_3c_20std_3a_3avector_3c_20f_20_3e_2c_20std_3a_3avector_3c_20t_20_3e_20_3e',['promoter< std::vector< F >, std::vector< T > >',['../structstan_1_1math_1_1promoter_3_01std_1_1vector_3_01_f_01_4_00_01std_1_1vector_3_01_t_01_4_01_4.html',1,'stan::math']]], + ['promoter_3c_20std_3a_3avector_3c_20t_20_3e_2c_20std_3a_3avector_3c_20t_20_3e_20_3e',['promoter< std::vector< T >, std::vector< T > >',['../structstan_1_1math_1_1promoter_3_01std_1_1vector_3_01_t_01_4_00_01std_1_1vector_3_01_t_01_4_01_4.html',1,'stan::math']]], + ['promoter_3c_20t_2c_20t_20_3e',['promoter< T, T >',['../structstan_1_1math_1_1promoter_3_01_t_00_01_t_01_4.html',1,'stan::math']]], + ['ps_5fpoint',['ps_point',['../classstan_1_1mcmc_1_1ps__point.html#ab3577ab2d8d6109485e03e893e770654',1,'stan::mcmc::ps_point::ps_point(int n)'],['../classstan_1_1mcmc_1_1ps__point.html#aa31c2f392681f074461372c98f76b7d0',1,'stan::mcmc::ps_point::ps_point(const ps_point &z)']]], + ['ps_5fpoint',['ps_point',['../classstan_1_1mcmc_1_1ps__point.html',1,'stan::mcmc']]], + ['ps_5fpoint_2ehpp',['ps_point.hpp',['../ps__point_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/all_71.html b/doc/api/html/search/all_71.html new file mode 100644 index 00000000000..b4dc1e6ee34 --- /dev/null +++ b/doc/api/html/search/all_71.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/all_71.js b/doc/api/html/search/all_71.js new file mode 100644 index 00000000000..5561a448f55 --- /dev/null +++ b/doc/api/html/search/all_71.js @@ -0,0 +1,11 @@ +var searchData= +[ + ['q',['q',['../classstan_1_1mcmc_1_1ps__point.html#a3a12cd50a8d7e0d8c698a4debc767283',1,'stan::mcmc::ps_point']]], + ['quad_5fform',['quad_form',['../namespacestan_1_1agrad.html#a12051c57c37d841f90b64d18d18b3572',1,'stan::agrad::quad_form(const Eigen::Matrix< TA, RA, CA > &A, const Eigen::Matrix< TB, RB, CB > &B)'],['../namespacestan_1_1agrad.html#ad10e001e4f70e7c20a0d0e4fc9ad6e45',1,'stan::agrad::quad_form(const Eigen::Matrix< TA, RA, CA > &A, const Eigen::Matrix< TB, RB, 1 > &B)'],['../namespacestan_1_1math.html#a376cbe31002df6a319da4caaaeb8598c',1,'stan::math::quad_form(const Eigen::Matrix< double, RA, CA > &A, const Eigen::Matrix< double, RB, CB > &B)'],['../namespacestan_1_1math.html#a0e0213e916c2185844b48eea25312e86',1,'stan::math::quad_form(const Eigen::Matrix< double, RA, CA > &A, const Eigen::Matrix< double, RB, 1 > &B)']]], + ['quad_5fform_2ehpp',['quad_form.hpp',['../math_2matrix_2quad__form_8hpp.html',1,'']]], + ['quad_5fform_2ehpp',['quad_form.hpp',['../agrad_2rev_2matrix_2quad__form_8hpp.html',1,'']]], + ['quad_5fform_5fsym',['quad_form_sym',['../namespacestan_1_1agrad.html#a0065419b6716e2e9bd2b046209eeb29d',1,'stan::agrad::quad_form_sym(const Eigen::Matrix< TA, RA, CA > &A, const Eigen::Matrix< TB, RB, CB > &B)'],['../namespacestan_1_1agrad.html#a18283c753845a6ff14c457500314171c',1,'stan::agrad::quad_form_sym(const Eigen::Matrix< TA, RA, CA > &A, const Eigen::Matrix< TB, RB, 1 > &B)'],['../namespacestan_1_1math.html#a2cc753af413f715d82b992aae8b10fde',1,'stan::math::quad_form_sym(const Eigen::Matrix< double, RA, CA > &A, const Eigen::Matrix< double, RB, CB > &B)'],['../namespacestan_1_1math.html#a9355d4e6239f0bb06e0b8d2302f37af4',1,'stan::math::quad_form_sym(const Eigen::Matrix< double, RA, CA > &A, const Eigen::Matrix< double, RB, 1 > &B)']]], + ['quantile',['quantile',['../classstan_1_1mcmc_1_1chains.html#a56d312e2c426bff532c77b9156031023',1,'stan::mcmc::chains::quantile(const int chain, const int index, const double prob)'],['../classstan_1_1mcmc_1_1chains.html#adc3507c5fadc08b20d8a62278ea1403d',1,'stan::mcmc::chains::quantile(const int index, const double prob)'],['../classstan_1_1mcmc_1_1chains.html#ad53b60119eb5c4c0b6dda5b718d10bcf',1,'stan::mcmc::chains::quantile(const int chain, const std::string &name, const double prob)'],['../classstan_1_1mcmc_1_1chains.html#a7234fcd741119e1973f1879dfee16494',1,'stan::mcmc::chains::quantile(const std::string &name, const double prob)']]], + ['quantiles',['quantiles',['../classstan_1_1mcmc_1_1chains.html#ad387dd810f96b6ac37efd2992fc29630',1,'stan::mcmc::chains::quantiles(const int chain, const int index, const Eigen::VectorXd &probs)'],['../classstan_1_1mcmc_1_1chains.html#a491e846ff148541c564d7db4a0794589',1,'stan::mcmc::chains::quantiles(const int index, const Eigen::VectorXd &probs)'],['../classstan_1_1mcmc_1_1chains.html#ab71e51ca47d8961e7a338a4275ddc718',1,'stan::mcmc::chains::quantiles(const int chain, const std::string &name, const Eigen::VectorXd &probs)'],['../classstan_1_1mcmc_1_1chains.html#a5ab7f0a936ba813e9086172f2946baa4',1,'stan::mcmc::chains::quantiles(const std::string &name, const Eigen::VectorXd &probs)']]], + ['quiet_5fnan',['quiet_NaN',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a8c903c018ba2cf816a16b981cd0148fd',1,'std::numeric_limits< stan::agrad::fvar< T > >::quiet_NaN()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#ac27177b2b7f896ddd695084b3616eae6',1,'std::numeric_limits< stan::agrad::var >::quiet_NaN()']]] +]; diff --git a/doc/api/html/search/all_72.html b/doc/api/html/search/all_72.html new file mode 100644 index 00000000000..0ab18d65fec --- /dev/null +++ b/doc/api/html/search/all_72.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/all_72.js b/doc/api/html/search/all_72.js new file mode 100644 index 00000000000..4d6018f32cb --- /dev/null +++ b/doc/api/html/search/all_72.js @@ -0,0 +1,135 @@ +var searchData= +[ + ['radix',['radix',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#afd5b4f9c99692d107b041363e1224f5c',1,'std::numeric_limits< stan::agrad::fvar< T > >::radix()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#ab0737f3e76c801f971530861695381fa',1,'std::numeric_limits< stan::agrad::var >::radix()']]], + ['raise_5fdomain_5ferror',['raise_domain_error',['../namespacestan_1_1math_1_1policies_1_1detail.html#a247352f3a333a7aebbe6ccf09473f2f9',1,'stan::math::policies::detail::raise_domain_error(const char *function, const char *message, const T_val &val, const ::boost::math::policies::domain_error< ::boost::math::policies::throw_on_error > &)'],['../namespacestan_1_1math_1_1policies_1_1detail.html#a1e05fecf80a5d9760597fa17374ac729',1,'stan::math::policies::detail::raise_domain_error(const char *, const char *, const T_val &, const ::boost::math::policies::domain_error< ::boost::math::policies::ignore_error > &)'],['../namespacestan_1_1math_1_1policies_1_1detail.html#a37a116f5cfdd061c779fa174223cc64b',1,'stan::math::policies::detail::raise_domain_error(const char *, const char *, const T_val &, const ::boost::math::policies::domain_error< ::boost::math::policies::errno_on_error > &)'],['../namespacestan_1_1math_1_1policies_1_1detail.html#a84db90eb3648bab11711b7282e69cf0b',1,'stan::math::policies::detail::raise_domain_error(const char *function, const char *message, const T_val &val, const ::boost::math::policies::domain_error< ::boost::math::policies::user_error > &)'],['../namespacestan_1_1math_1_1policies.html#ac83ded77a40cbdc0bdb98879f0d24fb7',1,'stan::math::policies::raise_domain_error()']]], + ['raise_5fdomain_5ferror_2ehpp',['raise_domain_error.hpp',['../raise__domain__error_8hpp.html',1,'']]], + ['random_5fseed',['random_seed',['../structstan_1_1io_1_1stan__csv__metadata.html#a11e87094a178f9c9942cd7e2f5d7bd02',1,'stan::io::stan_csv_metadata']]], + ['range',['range',['../structstan_1_1gm_1_1range.html',1,'stan::gm']]], + ['range',['range',['../structstan_1_1gm_1_1range.html#a64e3d1cc595ede56d2c46cca8689cc95',1,'stan::gm::range::range()'],['../structstan_1_1gm_1_1range.html#a0b26a72500318c7840baed6ca87ce946',1,'stan::gm::range::range(expression const &low, expression const &high)']]], + ['range_5f',['range_',['../structstan_1_1gm_1_1int__var__decl.html#aaa6d328f10dd0d0ae838d83ba81a1951',1,'stan::gm::int_var_decl::range_()'],['../structstan_1_1gm_1_1double__var__decl.html#ae592f05b693896629cf2c33039819404',1,'stan::gm::double_var_decl::range_()'],['../structstan_1_1gm_1_1vector__var__decl.html#aaa8d18715438632ddf572e90dea01973',1,'stan::gm::vector_var_decl::range_()'],['../structstan_1_1gm_1_1row__vector__var__decl.html#a2f731ff1b9109a953a4b145f5ab35dec',1,'stan::gm::row_vector_var_decl::range_()'],['../structstan_1_1gm_1_1matrix__var__decl.html#a787d753dd8fab870cf529e569b1556b3',1,'stan::gm::matrix_var_decl::range_()'],['../structstan_1_1gm_1_1for__statement.html#a9398fccd6c9d3e0d5c25e90fd09d3d4a',1,'stan::gm::for_statement::range_()']]], + ['range_5fbrackets_5fdouble_5fr',['range_brackets_double_r',['../structstan_1_1gm_1_1var__decls__grammar.html#a0aaf89ef89fa49d93c4b5b23b37be1ff',1,'stan::gm::var_decls_grammar']]], + ['range_5fbrackets_5fint_5fr',['range_brackets_int_r',['../structstan_1_1gm_1_1var__decls__grammar.html#a09e210333cb4aa7173c8b3f80fde5208',1,'stan::gm::var_decls_grammar']]], + ['range_5fr',['range_r',['../structstan_1_1gm_1_1statement__grammar.html#a6dc40f704e7efaccfc1a7886a051773f',1,'stan::gm::statement_grammar::range_r()'],['../structstan_1_1gm_1_1var__decls__grammar.html#aac6aeaf9cbe3c714711c2d3e387c941e',1,'stan::gm::var_decls_grammar::range_r()']]], + ['range_5ft',['range_t',['../structstan_1_1gm_1_1variable__map.html#a2da97e3733b1c7695abd1eef547df69e',1,'stan::gm::variable_map']]], + ['rank',['rank',['../namespacestan_1_1math.html#a1baa9539e0a8d4ea50aa16b73d736d93',1,'stan::math::rank(const std::vector< T > &v, int s)'],['../namespacestan_1_1math.html#a808d3133624cd36ac410ba872ea653c2',1,'stan::math::rank(const Eigen::Matrix< T, R, C > &v, int s)']]], + ['rank_2ehpp',['rank.hpp',['../rank_8hpp.html',1,'']]], + ['rayleigh_2ehpp',['rayleigh.hpp',['../rayleigh_8hpp.html',1,'']]], + ['rayleigh_5fccdf_5flog',['rayleigh_ccdf_log',['../namespacestan_1_1prob.html#acb3f08ecac9dc1faebaff9f209c39c3e',1,'stan::prob']]], + ['rayleigh_5fcdf',['rayleigh_cdf',['../namespacestan_1_1prob.html#a21adf5dd176a990c274cb58c6b6ad491',1,'stan::prob']]], + ['rayleigh_5fcdf_5flog',['rayleigh_cdf_log',['../namespacestan_1_1prob.html#a6790ee20a779a4ec36207229ed36bf4e',1,'stan::prob']]], + ['rayleigh_5flog',['rayleigh_log',['../namespacestan_1_1prob.html#a98165bd7ce46385b8c12fa228ee90718',1,'stan::prob::rayleigh_log(const T_y &y, const T_scale &sigma)'],['../namespacestan_1_1prob.html#af1c16f2642c0e8fb3237ba5f4b704e98',1,'stan::prob::rayleigh_log(const T_y &y, const T_scale &sigma)']]], + ['rayleigh_5frng',['rayleigh_rng',['../namespacestan_1_1prob.html#ac500ff019314d3a79c6d1cd0e41ce0dd',1,'stan::prob']]], + ['read_5fadaptation',['read_adaptation',['../classstan_1_1io_1_1stan__csv__reader.html#afa996f8c6897a2e40f3e5b44a26db0e3',1,'stan::io::stan_csv_reader']]], + ['read_5fcorr_5fl',['read_corr_L',['../namespacestan_1_1prob.html#a12361bac5c2810d6245cf97465f1f09d',1,'stan::prob::read_corr_L(const Eigen::Array< T, Eigen::Dynamic, 1 > &CPCs, const size_t K)'],['../namespacestan_1_1prob.html#a18ea63e587986f4c53909c26b718cc17',1,'stan::prob::read_corr_L(const Eigen::Array< T, Eigen::Dynamic, 1 > &CPCs, const size_t K, T &log_prob)']]], + ['read_5fcorr_5fmatrix',['read_corr_matrix',['../namespacestan_1_1prob.html#a049065737ff2e957c65db870c99d509d',1,'stan::prob::read_corr_matrix(const Eigen::Array< T, Eigen::Dynamic, 1 > &CPCs, const size_t K)'],['../namespacestan_1_1prob.html#a21dcd8cff30b002e3483120f231dde9e',1,'stan::prob::read_corr_matrix(const Eigen::Array< T, Eigen::Dynamic, 1 > &CPCs, const size_t K, T &log_prob)']]], + ['read_5fcov_5fl',['read_cov_L',['../namespacestan_1_1prob.html#a1545e79c24324fc626f4422b45d4c2b8',1,'stan::prob']]], + ['read_5fcov_5fmatrix',['read_cov_matrix',['../namespacestan_1_1prob.html#ad5a94ee9ba8f88bc5f06a1bc0973cd64',1,'stan::prob::read_cov_matrix(const Eigen::Array< T, Eigen::Dynamic, 1 > &CPCs, const Eigen::Array< T, Eigen::Dynamic, 1 > &sds, T &log_prob)'],['../namespacestan_1_1prob.html#a39d24789bf8d8528e6d308c57ec8d309',1,'stan::prob::read_cov_matrix(const Eigen::Array< T, Eigen::Dynamic, 1 > &CPCs, const Eigen::Array< T, Eigen::Dynamic, 1 > &sds)']]], + ['read_5fheader',['read_header',['../classstan_1_1io_1_1stan__csv__reader.html#a7b816d25cface2d2236069cfc54367bf',1,'stan::io::stan_csv_reader']]], + ['read_5fmetadata',['read_metadata',['../classstan_1_1io_1_1stan__csv__reader.html#a882e750d8fb201dfa1cdb5e174f21957',1,'stan::io::stan_csv_reader']]], + ['read_5fsamples',['read_samples',['../classstan_1_1io_1_1stan__csv__reader.html#a1ec68f0382342bfd8e7de9d823239247',1,'stan::io::stan_csv_reader']]], + ['readcost',['ReadCost',['../struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html#a932a61195daad3e89711cfb02521cac9a337c2bf1065c51d4a2b76e80ae51b0e7',1,'Eigen::NumTraits< stan::agrad::var >']]], + ['reader',['reader',['../classstan_1_1io_1_1reader.html',1,'stan::io']]], + ['reader',['reader',['../classstan_1_1io_1_1reader.html#aa3ae88d711db3f2469c86131c28191ac',1,'stan::io::reader']]], + ['reader_2ehpp',['reader.hpp',['../reader_8hpp.html',1,'']]], + ['real',['Real',['../struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html#a4c2ce540647aaade50bc0c572a4741ee',1,'Eigen::NumTraits< stan::agrad::var >']]], + ['real_5fargument',['real_argument',['../namespacestan_1_1gm.html#a2d364040dd6f2d340627acb37db9c2be',1,'stan::gm']]], + ['recover_5fall',['recover_all',['../classstan_1_1memory_1_1chunk__alloc.html#a25506eb4680556464e3a52772bb09794',1,'stan::memory::chunk_alloc::recover_all()'],['../classstan_1_1memory_1_1stack__alloc.html#a453c7dd354d0cb89389f648882cd459d',1,'stan::memory::stack_alloc::recover_all()']]], + ['recover_5fmemory',['recover_memory',['../classstan_1_1agrad_1_1vari.html#a653f4d93055013f4b4332e2e992268c8',1,'stan::agrad::vari::recover_memory()'],['../namespacestan_1_1agrad.html#a352bfc3b18e738626b7cbbbbcd23ef06',1,'stan::agrad::recover_memory()'],['../namespacestan_1_1agrad.html#a352bfc3b18e738626b7cbbbbcd23ef06',1,'stan::agrad::recover_memory()']]], + ['remove',['remove',['../structstan_1_1gm_1_1variable__map.html#ab50a247ce7a5a9c041f02e51de75ab8c',1,'stan::gm::variable_map::remove()'],['../classstan_1_1io_1_1dump.html#ae73ebbf7c924c54f04cb4cab5d3bb61c',1,'stan::io::dump::remove()']]], + ['remove_5floop_5fidentifier',['remove_loop_identifier',['../structstan_1_1gm_1_1remove__loop__identifier.html',1,'stan::gm']]], + ['remove_5floop_5fidentifier_5ff',['remove_loop_identifier_f',['../namespacestan_1_1gm.html#add53eab5545aad3acada8a2f5c253a13',1,'stan::gm']]], + ['rep_5farray',['rep_array',['../namespacestan_1_1math.html#ad3d78d2735a35451f02bcd2f4da24886',1,'stan::math::rep_array(const T &x, int n)'],['../namespacestan_1_1math.html#a8edf0b7ec2ad24b1fda26a8d58513106',1,'stan::math::rep_array(const T &x, int m, int n)'],['../namespacestan_1_1math.html#a53054db4cfa6672654fbaedafbdae242',1,'stan::math::rep_array(const T &x, int k, int m, int n)']]], + ['rep_5farray_2ehpp',['rep_array.hpp',['../rep__array_8hpp.html',1,'']]], + ['rep_5fmatrix',['rep_matrix',['../namespacestan_1_1math.html#ad31fd1c6f1cd56836b049489009d2221',1,'stan::math::rep_matrix(const T &x, int m, int n)'],['../namespacestan_1_1math.html#a79febbfc52e2118819bb0eb77fbea561',1,'stan::math::rep_matrix(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v, int n)'],['../namespacestan_1_1math.html#aa70f063ee9a5790fbed08ba8ae07c52e',1,'stan::math::rep_matrix(const Eigen::Matrix< T, 1, Eigen::Dynamic > &rv, int m)']]], + ['rep_5fmatrix_2ehpp',['rep_matrix.hpp',['../rep__matrix_8hpp.html',1,'']]], + ['rep_5frow_5fvector',['rep_row_vector',['../namespacestan_1_1math.html#ac9d77ddf6ad38a102ebd6f5e433c3e6c',1,'stan::math']]], + ['rep_5frow_5fvector_2ehpp',['rep_row_vector.hpp',['../rep__row__vector_8hpp.html',1,'']]], + ['rep_5fvector',['rep_vector',['../namespacestan_1_1math.html#a2b132ea41ccfdb7b0ca4897cbb64649a',1,'stan::math']]], + ['rep_5fvector_2ehpp',['rep_vector.hpp',['../rep__vector_8hpp.html',1,'']]], + ['requireinitialization',['RequireInitialization',['../struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html#a932a61195daad3e89711cfb02521cac9ab6efa4e8f91c34b33478a794bd889dd4',1,'Eigen::NumTraits< stan::agrad::var >']]], + ['resize',['resize',['../namespacestan_1_1math.html#a8abf3ffa6d67a158348134225c9d3090',1,'stan::math']]], + ['resize_2ehpp',['resize.hpp',['../resize_8hpp.html',1,'']]], + ['resscalar',['ResScalar',['../struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1va44da5f98e1caea9523bacbd5bdc025fe.html#a5eccd0cab616793b2cd6a27ec9603e53',1,'Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, ColMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >::ResScalar()'],['../struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1vacd54cabc78c49ca719650381b68b105e.html#a2a3d011e77719fbba9c50c4c98f4098e',1,'Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, RowMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >::ResScalar()'],['../struct_eigen_1_1internal_1_1general__matrix__matrix__product_3_01_index_00_01stan_1_1agrad_1_1va9b485de9571b6e46d7a64aff43a6d9d3.html#a794af3646b14e20ff11c169ecd57a64a',1,'Eigen::internal::general_matrix_matrix_product< Index, stan::agrad::var, LhsStorageOrder, ConjugateLhs, stan::agrad::var, RhsStorageOrder, ConjugateRhs, ColMajor >::ResScalar()']]], + ['restart',['restart',['../classstan_1_1mcmc_1_1base__adaptation.html#afc41c7354b21fd64eb4a3d5964b4e230',1,'stan::mcmc::base_adaptation::restart()'],['../classstan_1_1mcmc_1_1stepsize__adaptation.html#ae0eba1b2db8fce83d078f095b6407c40',1,'stan::mcmc::stepsize_adaptation::restart()'],['../classstan_1_1mcmc_1_1windowed__adaptation.html#a0c6ce68d4fdde8df0bdcb5436aae9675',1,'stan::mcmc::windowed_adaptation::restart()'],['../classstan_1_1prob_1_1welford__covar__estimator.html#ac753e07b944404946cba323d0f33481d',1,'stan::prob::welford_covar_estimator::restart()'],['../classstan_1_1prob_1_1welford__var__estimator.html#a61dacc8a07628708042aaf83aa7b1f70',1,'stan::prob::welford_var_estimator::restart()']]], + ['result',['result',['../structstan_1_1gm_1_1elt__division__expr_1_1result.html',1,'stan::gm::elt_division_expr']]], + ['result',['result',['../structstan_1_1gm_1_1division__expr_1_1result.html',1,'stan::gm::division_expr']]], + ['result',['result',['../structstan_1_1gm_1_1add__loop__identifier_1_1result.html',1,'stan::gm::add_loop_identifier']]], + ['result',['result',['../structstan_1_1gm_1_1unscope__locals_1_1result.html',1,'stan::gm::unscope_locals']]], + ['result',['result',['../structstan_1_1gm_1_1left__division__expr_1_1result.html',1,'stan::gm::left_division_expr']]], + ['result',['result',['../structstan_1_1gm_1_1add__while__body_1_1result.html',1,'stan::gm::add_while_body']]], + ['result',['result',['../structstan_1_1gm_1_1transpose__expr_1_1result.html',1,'stan::gm::transpose_expr']]], + ['result',['result',['../structstan_1_1gm_1_1remove__loop__identifier_1_1result.html',1,'stan::gm::remove_loop_identifier']]], + ['result',['result',['../structstan_1_1gm_1_1add__expression__dimss_1_1result.html',1,'stan::gm::add_expression_dimss']]], + ['result',['result',['../structstan_1_1gm_1_1add__conditional__condition_1_1result.html',1,'stan::gm::add_conditional_condition']]], + ['result',['result',['../structstan_1_1gm_1_1validate__expr__type_1_1result.html',1,'stan::gm::validate_expr_type']]], + ['result',['result',['../structstan_1_1gm_1_1validate__expr__type2_1_1result.html',1,'stan::gm::validate_expr_type2']]], + ['result',['result',['../structstan_1_1gm_1_1set__fun__type_1_1result.html',1,'stan::gm::set_fun_type']]], + ['result',['result',['../structstan_1_1gm_1_1set__fun__type2_1_1result.html',1,'stan::gm::set_fun_type2']]], + ['result',['result',['../structstan_1_1gm_1_1subtraction__expr_1_1result.html',1,'stan::gm::subtraction_expr']]], + ['result',['result',['../structstan_1_1gm_1_1negate__expr_1_1result.html',1,'stan::gm::negate_expr']]], + ['result',['result',['../structstan_1_1gm_1_1validate__allow__sample_1_1result.html',1,'stan::gm::validate_allow_sample']]], + ['result',['result',['../structstan_1_1gm_1_1validate__sample_1_1result.html',1,'stan::gm::validate_sample']]], + ['result',['result',['../structstan_1_1gm_1_1binary__op__expr_1_1result.html',1,'stan::gm::binary_op_expr']]], + ['result',['result',['../structstan_1_1gm_1_1multiplication__expr_1_1result.html',1,'stan::gm::multiplication_expr']]], + ['result',['result',['../structstan_1_1gm_1_1set__fun__type__named_1_1result.html',1,'stan::gm::set_fun_type_named']]], + ['result',['result',['../structstan_1_1gm_1_1validate__assignment_1_1result.html',1,'stan::gm::validate_assignment']]], + ['result',['result',['../structstan_1_1gm_1_1add__while__condition_1_1result.html',1,'stan::gm::add_while_condition']]], + ['result',['result',['../structstan_1_1gm_1_1expression__as__statement_1_1result.html',1,'stan::gm::expression_as_statement']]], + ['result',['result',['../structstan_1_1gm_1_1validate__int__expr2_1_1result.html',1,'stan::gm::validate_int_expr2']]], + ['result',['result',['../structstan_1_1gm_1_1addition__expr_1_1result.html',1,'stan::gm::addition_expr']]], + ['result',['result',['../structstan_1_1gm_1_1elt__multiplication__expr_1_1result.html',1,'stan::gm::elt_multiplication_expr']]], + ['result',['result',['../structstan_1_1gm_1_1logical__negate__expr_1_1result.html',1,'stan::gm::logical_negate_expr']]], + ['result',['result',['../structstan_1_1gm_1_1set__var__type_1_1result.html',1,'stan::gm::set_var_type']]], + ['result',['result',['../structstan_1_1gm_1_1add__conditional__body_1_1result.html',1,'stan::gm::add_conditional_body']]], + ['result',['result',['../structstan_1_1gm_1_1validate__int__expr3_1_1result.html',1,'stan::gm::validate_int_expr3']]], + ['result_5ftype',['result_type',['../structstan_1_1gm_1_1visgen.html#a109e318e1629afb884191005e56b040e',1,'stan::gm::visgen']]], + ['return_5ftype',['return_type',['../structstan_1_1return__type.html',1,'stan']]], + ['returntype',['ReturnType',['../struct_eigen_1_1internal_1_1scalar__product__traits_3_01stan_1_1agrad_1_1var_00_01double_01_4.html#a7a3a05b2596fc2bf37c31456c2f5646e',1,'Eigen::internal::scalar_product_traits< stan::agrad::var, double >::ReturnType()'],['../struct_eigen_1_1internal_1_1scalar__product__traits_3_01double_00_01stan_1_1agrad_1_1var_01_4.html#ae4eab286198b6597cf9fb9f009facfde',1,'Eigen::internal::scalar_product_traits< double, stan::agrad::var >::ReturnType()']]], + ['rev_2ehpp',['rev.hpp',['../rev_8hpp.html',1,'']]], + ['rho',['rho',['../structstan_1_1optimization_1_1_b_f_g_s_minimizer_1_1_b_f_g_s_options.html#ae62684f34eac1552c27bed815c2e4ea3',1,'stan::optimization::BFGSMinimizer::BFGSOptions']]], + ['rhsscalar',['RhsScalar',['../struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1va44da5f98e1caea9523bacbd5bdc025fe.html#a032c6f6f307ed07b410a6d9cfc933588',1,'Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, ColMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >::RhsScalar()'],['../struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1vacd54cabc78c49ca719650381b68b105e.html#afe67acef0cc902389c761f0a3a914e73',1,'Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, RowMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >::RhsScalar()'],['../struct_eigen_1_1internal_1_1general__matrix__matrix__product_3_01_index_00_01stan_1_1agrad_1_1va9b485de9571b6e46d7a64aff43a6d9d3.html#ae39f7406453977f1c2341a05397f7024',1,'Eigen::internal::general_matrix_matrix_product< Index, stan::agrad::var, LhsStorageOrder, ConjugateLhs, stan::agrad::var, RhsStorageOrder, ConjugateRhs, ColMajor >::RhsScalar()']]], + ['right',['right',['../structstan_1_1gm_1_1binary__op.html#a8c4d835d3bf96f0163e265f824130210',1,'stan::gm::binary_op']]], + ['rising_5ffactorial',['rising_factorial',['../namespacestan_1_1agrad.html#ae4c3b430f306e040a9179e658765b149',1,'stan::agrad::rising_factorial(const fvar< T > &x, const fvar< T > &n)'],['../namespacestan_1_1agrad.html#ad41059332ac855c615d8595f1ec2912d',1,'stan::agrad::rising_factorial(const fvar< T > &x, const double n)'],['../namespacestan_1_1agrad.html#af7f09d1c92ebab44b0765c7cbbece686',1,'stan::agrad::rising_factorial(const double x, const fvar< T > &n)'],['../namespacestan_1_1agrad.html#a2938f3b0f93ab4f19e3809fe4f69c94f',1,'stan::agrad::rising_factorial(const var &a, const double &b)'],['../namespacestan_1_1agrad.html#a20247c229eb0eff045d4f8eb46754d2e',1,'stan::agrad::rising_factorial(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#abe622a48fa2a2942b149fdba55f333e1',1,'stan::agrad::rising_factorial(const double &a, const var &b)'],['../namespacestan_1_1math.html#a3c25994a9886374662f280ecba376a42',1,'stan::math::rising_factorial()']]], + ['rising_5ffactorial_2ehpp',['rising_factorial.hpp',['../math_2functions_2rising__factorial_8hpp.html',1,'']]], + ['rising_5ffactorial_2ehpp',['rising_factorial.hpp',['../agrad_2fwd_2functions_2rising__factorial_8hpp.html',1,'']]], + ['rising_5ffactorial_2ehpp',['rising_factorial.hpp',['../agrad_2rev_2functions_2rising__factorial_8hpp.html',1,'']]], + ['round',['round',['../namespacestan_1_1agrad.html#afec6a38f518019111c47c6e6c2a593b2',1,'stan::agrad::round(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#ad590e62d8c71957c7af8415e85905161',1,'stan::agrad::round(const stan::agrad::var &a)']]], + ['round_2ehpp',['round.hpp',['../rev_2functions_2round_8hpp.html',1,'']]], + ['round_2ehpp',['round.hpp',['../fwd_2functions_2round_8hpp.html',1,'']]], + ['round_5ferror',['round_error',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#af3bf0d1a9d694cf2ab881c0a648ddaa7',1,'std::numeric_limits< stan::agrad::fvar< T > >::round_error()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#aaac0b0266785c7bd359eee49a89231a4',1,'std::numeric_limits< stan::agrad::var >::round_error()']]], + ['round_5fstyle',['round_style',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a1c70d1cf58dba42f0bb1987810ae07a7',1,'std::numeric_limits< stan::agrad::fvar< T > >::round_style()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a87a2f9fb70b542ca087f476622d51a57',1,'std::numeric_limits< stan::agrad::var >::round_style()']]], + ['row',['row',['../namespacestan_1_1math.html#ab540ec1825d8a36cf690a3f061d544bb',1,'stan::math']]], + ['row_2ehpp',['row.hpp',['../row_8hpp.html',1,'']]], + ['row_5fvector',['row_vector',['../classstan_1_1io_1_1reader.html#a857c3ed31d34189e5768ef2475024b36',1,'stan::io::reader']]], + ['row_5fvector_5fconstrain',['row_vector_constrain',['../classstan_1_1io_1_1reader.html#a83f84052299bcadcd6bdf0273e7a48d4',1,'stan::io::reader::row_vector_constrain(size_t m)'],['../classstan_1_1io_1_1reader.html#a2165af289c7ec046db04aec5d369bc9b',1,'stan::io::reader::row_vector_constrain(size_t m, T &)']]], + ['row_5fvector_5fd',['row_vector_d',['../namespacestan_1_1math.html#ac105e584e4ed2d24a5c3a40df4d94697',1,'stan::math']]], + ['row_5fvector_5fdecl_5fr',['row_vector_decl_r',['../structstan_1_1gm_1_1var__decls__grammar.html#a2ead8250ab9ab408323ca23af20cd734',1,'stan::gm::var_decls_grammar']]], + ['row_5fvector_5ffd',['row_vector_fd',['../namespacestan_1_1agrad.html#a034dc4f78e984e287123599a3b87ac97',1,'stan::agrad']]], + ['row_5fvector_5fffd',['row_vector_ffd',['../namespacestan_1_1agrad.html#a493bb030b1f2016276f58fe67662e252',1,'stan::agrad']]], + ['row_5fvector_5fffv',['row_vector_ffv',['../namespacestan_1_1agrad.html#a4a52427f4040846e15dca434ea633b7b',1,'stan::agrad']]], + ['row_5fvector_5ffv',['row_vector_fv',['../namespacestan_1_1agrad.html#a031f0408fe91a974e1cc09d61cea8807',1,'stan::agrad']]], + ['row_5fvector_5flb',['row_vector_lb',['../classstan_1_1io_1_1reader.html#a91cbfaaef51a6f1537ae86c13403c8fc',1,'stan::io::reader']]], + ['row_5fvector_5flb_5fconstrain',['row_vector_lb_constrain',['../classstan_1_1io_1_1reader.html#ac2a358a28348483347a0c3d18587dcff',1,'stan::io::reader::row_vector_lb_constrain(const TL lb, size_t m)'],['../classstan_1_1io_1_1reader.html#a03477c8e7dec8028b31d7435161a58d1',1,'stan::io::reader::row_vector_lb_constrain(const TL lb, size_t m, T &lp)']]], + ['row_5fvector_5flb_5funconstrain',['row_vector_lb_unconstrain',['../classstan_1_1io_1_1writer.html#a2c478d495e007c8eba20f089a089c163',1,'stan::io::writer']]], + ['row_5fvector_5flub',['row_vector_lub',['../classstan_1_1io_1_1reader.html#a4cb4db5f423c38abdf0e3cb8f9d9188b',1,'stan::io::reader']]], + ['row_5fvector_5flub_5fconstrain',['row_vector_lub_constrain',['../classstan_1_1io_1_1reader.html#aaa3a163e402812f41d271adcf974e455',1,'stan::io::reader::row_vector_lub_constrain(const TL lb, const TU ub, size_t m)'],['../classstan_1_1io_1_1reader.html#ab1d1b3316dd321fdf4965d8843920800',1,'stan::io::reader::row_vector_lub_constrain(const TL lb, const TU ub, size_t m, T &lp)']]], + ['row_5fvector_5flub_5funconstrain',['row_vector_lub_unconstrain',['../classstan_1_1io_1_1writer.html#a044b59a59c26439b2bb2bc19071531d6',1,'stan::io::writer']]], + ['row_5fvector_5ft',['row_vector_t',['../classstan_1_1io_1_1reader.html#a9266295ff05e7617d42304c90e485b52',1,'stan::io::reader::row_vector_t()'],['../classstan_1_1io_1_1writer.html#a51abce190e367fccf3c1f8ddfa3c5170',1,'stan::io::writer::row_vector_t()'],['../namespacestan_1_1gm.html#a262a14a590dd1cc841d61cfec98b1ecd',1,'stan::gm::ROW_VECTOR_T()']]], + ['row_5fvector_5fub',['row_vector_ub',['../classstan_1_1io_1_1reader.html#a7e2430e335d19e695f50494130e9a183',1,'stan::io::reader']]], + ['row_5fvector_5fub_5fconstrain',['row_vector_ub_constrain',['../classstan_1_1io_1_1reader.html#a956b2417c03f1f4645377fc06e1eee94',1,'stan::io::reader::row_vector_ub_constrain(const TU ub, size_t m)'],['../classstan_1_1io_1_1reader.html#a66650f9f00be4acabf92acfca8c53dbc',1,'stan::io::reader::row_vector_ub_constrain(const TU ub, size_t m, T &lp)']]], + ['row_5fvector_5fub_5funconstrain',['row_vector_ub_unconstrain',['../classstan_1_1io_1_1writer.html#afd20cc10409dce8c8f19dd7739bf05bb',1,'stan::io::writer']]], + ['row_5fvector_5funconstrain',['row_vector_unconstrain',['../classstan_1_1io_1_1writer.html#ac994c53580dee20c98e2734b889be4ad',1,'stan::io::writer']]], + ['row_5fvector_5fv',['row_vector_v',['../namespacestan_1_1agrad.html#ac3832e2dace4d1299a812cdcc53ab091',1,'stan::agrad']]], + ['row_5fvector_5fvar_5fdecl',['row_vector_var_decl',['../structstan_1_1gm_1_1row__vector__var__decl.html#aa014117956dbd7c14c2008ddef880824',1,'stan::gm::row_vector_var_decl::row_vector_var_decl()'],['../structstan_1_1gm_1_1row__vector__var__decl.html#a5519c24ae953da7a875c0f39ce69704c',1,'stan::gm::row_vector_var_decl::row_vector_var_decl(range const &range, expression const &N, std::string const &name, std::vector< expression > const &dims)']]], + ['row_5fvector_5fvar_5fdecl',['row_vector_var_decl',['../structstan_1_1gm_1_1row__vector__var__decl.html',1,'stan::gm']]], + ['rows',['rows',['../classstan_1_1math_1_1_l_d_l_t__factor_3_01stan_1_1agrad_1_1var_00_01_r_00_01_c_01_4.html#a6ed9e0cd72d929449d5257f11b7aad45',1,'stan::math::LDLT_factor< stan::agrad::var, R, C >::rows()'],['../classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4.html#a481dd3025ce906d56ab57d6f33759426',1,'stan::math::LDLT_factor< double, R, C >::rows()'],['../namespacestan_1_1math.html#adb157990709e17068a450238d0a579fb',1,'stan::math::rows()']]], + ['rows_2ehpp',['rows.hpp',['../rows_8hpp.html',1,'']]], + ['rows_5fdot_5fproduct',['rows_dot_product',['../namespacestan_1_1agrad.html#ad53bb44b66e3b1129e5454cda93c700c',1,'stan::agrad::rows_dot_product(const Eigen::Matrix< fvar< T >, R1, C1 > &v1, const Eigen::Matrix< fvar< T >, R2, C2 > &v2)'],['../namespacestan_1_1agrad.html#a78dcc991d879df3adf65cd1869015317',1,'stan::agrad::rows_dot_product(const Eigen::Matrix< double, R1, C1 > &v1, const Eigen::Matrix< fvar< T >, R2, C2 > &v2)'],['../namespacestan_1_1agrad.html#aa6efe02004903faea4953ea2b0a6c02c',1,'stan::agrad::rows_dot_product(const Eigen::Matrix< fvar< T >, R1, C1 > &v1, const Eigen::Matrix< double, R2, C2 > &v2)'],['../namespacestan_1_1agrad.html#a515860810335a99d111cda0614bc00e1',1,'stan::agrad::rows_dot_product(const Eigen::Matrix< T1, R1, C1 > &v1, const Eigen::Matrix< T2, R2, C2 > &v2)'],['../namespacestan_1_1math.html#a6e1fb33918f8c4e61cc7709905db012c',1,'stan::math::rows_dot_product()']]], + ['rows_5fdot_5fproduct_2ehpp',['rows_dot_product.hpp',['../agrad_2fwd_2matrix_2rows__dot__product_8hpp.html',1,'']]], + ['rows_5fdot_5fproduct_2ehpp',['rows_dot_product.hpp',['../math_2matrix_2rows__dot__product_8hpp.html',1,'']]], + ['rows_5fdot_5fself',['rows_dot_self',['../namespacestan_1_1agrad.html#aba5acba7161f7e4080052f1bd6063e9a',1,'stan::agrad::rows_dot_self()'],['../namespacestan_1_1math.html#a7b071fe169e76df6dc2a49c85ec28b2f',1,'stan::math::rows_dot_self()']]], + ['rows_5fdot_5fself_2ehpp',['rows_dot_self.hpp',['../agrad_2fwd_2matrix_2rows__dot__self_8hpp.html',1,'']]], + ['rows_5fdot_5fself_2ehpp',['rows_dot_self.hpp',['../math_2matrix_2rows__dot__self_8hpp.html',1,'']]], + ['run',['run',['../struct_eigen_1_1internal_1_1significant__decimals__default__impl_3_01stan_1_1agrad_1_1var_00_01false_01_4.html#ac2f97f18b6f0c481a111bbf82a4fc7e5',1,'Eigen::internal::significant_decimals_default_impl< stan::agrad::var, false >::run()'],['../struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1va44da5f98e1caea9523bacbd5bdc025fe.html#a62cd81217587325b39ccdd4668b13e7a',1,'Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, ColMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >::run()'],['../struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1vacd54cabc78c49ca719650381b68b105e.html#aec3ce42cbaf2a03d150a0ae70b72220e',1,'Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, RowMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >::run()'],['../struct_eigen_1_1internal_1_1general__matrix__matrix__product_3_01_index_00_01stan_1_1agrad_1_1va9b485de9571b6e46d7a64aff43a6d9d3.html#a6e9d5e398a3e5602fa39b1938bb6f155',1,'Eigen::internal::general_matrix_matrix_product< Index, stan::agrad::var, LhsStorageOrder, ConjugateLhs, stan::agrad::var, RhsStorageOrder, ConjugateRhs, ColMajor >::run()']]], + ['run_5fmarkov_5fchain',['run_markov_chain',['../namespacestan_1_1gm.html#a9209ad79a636ceb3152038e76e81acc4',1,'stan::gm']]] +]; diff --git a/doc/api/html/search/all_73.html b/doc/api/html/search/all_73.html new file mode 100644 index 00000000000..1ec8f174deb --- /dev/null +++ b/doc/api/html/search/all_73.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/all_73.js b/doc/api/html/search/all_73.js new file mode 100644 index 00000000000..9c3d56d4a0d --- /dev/null +++ b/doc/api/html/search/all_73.js @@ -0,0 +1,271 @@ +var searchData= +[ + ['agrad',['agrad',['../namespacestan_1_1agrad.html',1,'stan']]], + ['detail',['detail',['../namespacestan_1_1math_1_1policies_1_1detail.html',1,'stan::math::policies']]], + ['gm',['gm',['../namespacestan_1_1gm.html',1,'stan']]], + ['io',['io',['../namespacestan_1_1io.html',1,'stan']]], + ['math',['math',['../namespacestan_1_1math.html',1,'stan']]], + ['mcmc',['mcmc',['../namespacestan_1_1mcmc.html',1,'stan']]], + ['memory',['memory',['../namespacestan_1_1memory.html',1,'stan']]], + ['model',['model',['../namespacestan_1_1model.html',1,'stan']]], + ['optimization',['optimization',['../namespacestan_1_1optimization.html',1,'stan']]], + ['policies',['policies',['../namespacestan_1_1math_1_1policies.html',1,'stan::math']]], + ['prob',['prob',['../namespacestan_1_1prob.html',1,'stan']]], + ['sample',['sample',['../classstan_1_1mcmc_1_1sample.html',1,'stan::mcmc']]], + ['sample',['sample',['../structstan_1_1gm_1_1sample.html',1,'stan::gm']]], + ['sample',['sample',['../structstan_1_1gm_1_1sample.html#af848ffe2b840908129a6ec949f4ef881',1,'stan::gm::sample::sample()'],['../structstan_1_1gm_1_1sample.html#af9ef88ac0fe1bca70dd1a598a805125d',1,'stan::gm::sample::sample(expression &e, distribution &dist)'],['../classstan_1_1mcmc_1_1sample.html#a028816248fc7ec7dbee24d0e7ea621dc',1,'stan::mcmc::sample::sample()'],['../namespacestan_1_1gm.html#a7cf4c17c47162f69708fa787fa09d4dc',1,'stan::gm::sample()']]], + ['sample_2ehpp',['sample.hpp',['../sample_8hpp.html',1,'']]], + ['sample_5fcovariance',['sample_covariance',['../classstan_1_1prob_1_1welford__covar__estimator.html#a5e36ff271130c52b707d261f0cf72205',1,'stan::prob::welford_covar_estimator']]], + ['sample_5fmean',['sample_mean',['../classstan_1_1prob_1_1welford__covar__estimator.html#a025fef3ddbd1b600ff60f293757c7dda',1,'stan::prob::welford_covar_estimator::sample_mean()'],['../classstan_1_1prob_1_1welford__var__estimator.html#a9204b9e61b85661377f48f0d4c55531c',1,'stan::prob::welford_var_estimator::sample_mean()']]], + ['sample_5fp',['sample_p',['../classstan_1_1mcmc_1_1base__hamiltonian.html#a3207510e682d531885cc65e91b7e9af9',1,'stan::mcmc::base_hamiltonian::sample_p()'],['../classstan_1_1mcmc_1_1dense__e__metric.html#a6226a2831ba574b3219536c5c3b31d42',1,'stan::mcmc::dense_e_metric::sample_p()'],['../classstan_1_1mcmc_1_1diag__e__metric.html#a4006b1b08873b2f09a4c7a718f4f7517',1,'stan::mcmc::diag_e_metric::sample_p()'],['../classstan_1_1mcmc_1_1unit__e__metric.html#a97f537f349ad486cb8ca40bbfdc8135b',1,'stan::mcmc::unit_e_metric::sample_p()']]], + ['sample_5fr',['sample_r',['../structstan_1_1gm_1_1statement__grammar.html#a3058435c851fca6533f0a859e06e32f2',1,'stan::gm::statement_grammar']]], + ['sample_5fstepsize',['sample_stepsize',['../classstan_1_1mcmc_1_1base__hmc.html#a3ac766b0cce7b20168fb576cc7b399af',1,'stan::mcmc::base_hmc']]], + ['sample_5fvariance',['sample_variance',['../classstan_1_1prob_1_1welford__var__estimator.html#a97832111891ecd58739f528506f64bbb',1,'stan::prob::welford_var_estimator']]], + ['samples',['samples',['../structstan_1_1io_1_1stan__csv.html#a5e17346c48ca1e2b9146d2700c6433a8',1,'stan::io::stan_csv::samples()'],['../classstan_1_1mcmc_1_1chains.html#a9db136c877e767e92877f162fc613af0',1,'stan::mcmc::chains::samples(const int chain, const int index)'],['../classstan_1_1mcmc_1_1chains.html#aaa2edbb4814eaf82fa21bb5795008b86',1,'stan::mcmc::chains::samples(const int index)'],['../classstan_1_1mcmc_1_1chains.html#a32d4494522c2cb233f48960d2ed57198',1,'stan::mcmc::chains::samples(const int chain, const std::string &name)'],['../classstan_1_1mcmc_1_1chains.html#aa00ee119c518e1912e3153be0797fbaf',1,'stan::mcmc::chains::samples(const std::string &name)']]], + ['sampling',['sampling',['../structstan_1_1io_1_1stan__csv__timing.html#ac519541a29874dcefa08af1e0584f595',1,'stan::io::stan_csv_timing']]], + ['save_5fwarmup',['save_warmup',['../structstan_1_1io_1_1stan__csv__metadata.html#aeb01b3bd545cb53379cc3d9b4965574a',1,'stan::io::stan_csv_metadata']]], + ['scalar',['Scalar',['../classstan_1_1agrad_1_1var.html#a9ddcf3d9523473d4c99eb4dc81c6938f',1,'stan::agrad::var::Scalar()'],['../classstan_1_1agrad_1_1var.html#a9ddcf3d9523473d4c99eb4dc81c6938f',1,'stan::agrad::var::Scalar()'],['../classstan_1_1io_1_1reader.html#a804e3de3992c9f6a53c03596369dd1d0',1,'stan::io::reader::scalar()']]], + ['scalar_5fconstrain',['scalar_constrain',['../classstan_1_1io_1_1reader.html#a1436d19aa2acb5c139f7abccda0245c0',1,'stan::io::reader::scalar_constrain()'],['../classstan_1_1io_1_1reader.html#adc2d45ed51c042512f07e2c977894b7b',1,'stan::io::reader::scalar_constrain(T &)']]], + ['scalar_5flb',['scalar_lb',['../classstan_1_1io_1_1reader.html#a63d5909de270e2f187707c7bdfa1b2ba',1,'stan::io::reader']]], + ['scalar_5flb_5fconstrain',['scalar_lb_constrain',['../classstan_1_1io_1_1reader.html#aa9191795f375a3e3c5e048ca1eb045ba',1,'stan::io::reader::scalar_lb_constrain(const TL lb)'],['../classstan_1_1io_1_1reader.html#a8fc8affb3f2c3835965d943c7a7ce83c',1,'stan::io::reader::scalar_lb_constrain(const TL lb, T &lp)']]], + ['scalar_5flb_5funconstrain',['scalar_lb_unconstrain',['../classstan_1_1io_1_1writer.html#a7f2596b8de12ff0a3121a6acbbf79536',1,'stan::io::writer']]], + ['scalar_5flub',['scalar_lub',['../classstan_1_1io_1_1reader.html#a13f36e576e51d8e9d72589133d7cf107',1,'stan::io::reader']]], + ['scalar_5flub_5fconstrain',['scalar_lub_constrain',['../classstan_1_1io_1_1reader.html#a12299645ca45f2b765fea6fe14447733',1,'stan::io::reader::scalar_lub_constrain(const TL lb, const TU ub)'],['../classstan_1_1io_1_1reader.html#ad821d1abbeefcd04f3350a213276d53e',1,'stan::io::reader::scalar_lub_constrain(TL lb, TU ub, T &lp)']]], + ['scalar_5flub_5funconstrain',['scalar_lub_unconstrain',['../classstan_1_1io_1_1writer.html#a841fbd5b6feddfbad117c3cb23f2844c',1,'stan::io::writer']]], + ['scalar_5fpos',['scalar_pos',['../classstan_1_1io_1_1reader.html#acf5c5343597a44d4d2173881c7c68912',1,'stan::io::reader']]], + ['scalar_5fpos_5fconstrain',['scalar_pos_constrain',['../classstan_1_1io_1_1reader.html#a45d5a9c201fb25c44f1bba987e64d387',1,'stan::io::reader::scalar_pos_constrain()'],['../classstan_1_1io_1_1reader.html#a41d6bf28bfa13c861ce1afe8cd7d4c1e',1,'stan::io::reader::scalar_pos_constrain(T &lp)']]], + ['scalar_5fpos_5funconstrain',['scalar_pos_unconstrain',['../classstan_1_1io_1_1writer.html#a0711f8ca4117ca12cdb301e40838dc74',1,'stan::io::writer']]], + ['scalar_5fproduct_5ftraits_3c_20double_2c_20stan_3a_3aagrad_3a_3avar_20_3e',['scalar_product_traits< double, stan::agrad::var >',['../struct_eigen_1_1internal_1_1scalar__product__traits_3_01double_00_01stan_1_1agrad_1_1var_01_4.html',1,'Eigen::internal']]], + ['scalar_5fproduct_5ftraits_3c_20stan_3a_3aagrad_3a_3avar_2c_20double_20_3e',['scalar_product_traits< stan::agrad::var, double >',['../struct_eigen_1_1internal_1_1scalar__product__traits_3_01stan_1_1agrad_1_1var_00_01double_01_4.html',1,'Eigen::internal']]], + ['scalar_5ft',['scalar_t',['../classstan_1_1_vector_view.html#a2a17f256f923b7271b7008682995c072',1,'stan::VectorView::scalar_t()'],['../classstan_1_1_vector_view_3_01const_01_t_00_01is__array_00_01throw__if__accessed_01_4.html#ab4284d2fe6f3e884e2bc9ec7c5621372',1,'stan::VectorView< const T, is_array, throw_if_accessed >::scalar_t()']]], + ['scalar_5ftype',['scalar_type',['../structstan_1_1scalar__type.html',1,'stan']]], + ['scalar_5ftype_3c_20eigen_3a_3amatrix_3c_20t_2c_20eigen_3a_3adynamic_2c_20eigen_3a_3adynamic_20_3e_20_3e',['scalar_type< Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > >',['../structstan_1_1scalar__type_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4.html',1,'stan']]], + ['scalar_5ftype_3c_20t_20_2a_20_3e',['scalar_type< T * >',['../structstan_1_1scalar__type_3_01_t_01_5_01_4.html',1,'stan']]], + ['scalar_5fub',['scalar_ub',['../classstan_1_1io_1_1reader.html#aa5e2f8eca996110fb2be2e436d583b62',1,'stan::io::reader']]], + ['scalar_5fub_5fconstrain',['scalar_ub_constrain',['../classstan_1_1io_1_1reader.html#a21b4b63d07615a9d0a7c5de364a43a36',1,'stan::io::reader::scalar_ub_constrain(const TU ub)'],['../classstan_1_1io_1_1reader.html#a48afbd36262b7a2f51dec8d2fad471dd',1,'stan::io::reader::scalar_ub_constrain(const TU ub, T &lp)']]], + ['scalar_5fub_5funconstrain',['scalar_ub_unconstrain',['../classstan_1_1io_1_1writer.html#a747459c1f2b0d23711d7d36f18269ed6',1,'stan::io::writer']]], + ['scalar_5funconstrain',['scalar_unconstrain',['../classstan_1_1io_1_1writer.html#a15d75c45cfa52d103ad5660283fdde45',1,'stan::io::writer']]], + ['scaled_5fadd',['scaled_add',['../namespacestan_1_1math.html#a2eb786f14699d69c39cfdd49893a8006',1,'stan::math']]], + ['scaled_5fadd_2ehpp',['scaled_add.hpp',['../scaled__add_8hpp.html',1,'']]], + ['scaled_5finv_5fchi_5fsquare_2ehpp',['scaled_inv_chi_square.hpp',['../scaled__inv__chi__square_8hpp.html',1,'']]], + ['scaled_5finv_5fchi_5fsquare_5fccdf_5flog',['scaled_inv_chi_square_ccdf_log',['../namespacestan_1_1prob.html#a93cfec0873f41fb0f7e4c83d874b45fc',1,'stan::prob']]], + ['scaled_5finv_5fchi_5fsquare_5fcdf',['scaled_inv_chi_square_cdf',['../namespacestan_1_1prob.html#aeed68e0c4e8cfb8b5c470ae0b59345c9',1,'stan::prob']]], + ['scaled_5finv_5fchi_5fsquare_5fcdf_5flog',['scaled_inv_chi_square_cdf_log',['../namespacestan_1_1prob.html#ac9609fecff26e0c07646f794f65a39a7',1,'stan::prob']]], + ['scaled_5finv_5fchi_5fsquare_5flog',['scaled_inv_chi_square_log',['../namespacestan_1_1prob.html#a6428f925f8c1b43c323ce549da410d58',1,'stan::prob::scaled_inv_chi_square_log(const T_y &y, const T_dof &nu, const T_scale &s)'],['../namespacestan_1_1prob.html#a33291b85f39ebace4a4bae7633551cb0',1,'stan::prob::scaled_inv_chi_square_log(const T_y &y, const T_dof &nu, const T_scale &s)']]], + ['scaled_5finv_5fchi_5fsquare_5frng',['scaled_inv_chi_square_rng',['../namespacestan_1_1prob.html#af34f411fc637d2d1163663c0cf0a850e',1,'stan::prob']]], + ['sd',['sd',['../classstan_1_1mcmc_1_1chains.html#ab2763e38f54eb42ecaffe3202d2b945c',1,'stan::mcmc::chains::sd(const int chain, const int index)'],['../classstan_1_1mcmc_1_1chains.html#a5a63a0830242bcb793d0b058a2037a0c',1,'stan::mcmc::chains::sd(const int index)'],['../classstan_1_1mcmc_1_1chains.html#aa4d9e5490c0f67fb36f524d3398d7fdd',1,'stan::mcmc::chains::sd(const int chain, const std::string &name)'],['../classstan_1_1mcmc_1_1chains.html#add89272071040d56370525dae0a341f2',1,'stan::mcmc::chains::sd(const std::string &name)'],['../namespacestan_1_1agrad.html#a0d4edc50e38fa85f989dd2bc6a0b35b2',1,'stan::agrad::sd(const std::vector< var > &v)'],['../namespacestan_1_1agrad.html#ab13ef786c424299f0312dc5372c97ee1',1,'stan::agrad::sd(const Eigen::Matrix< var, R, C > &m)'],['../namespacestan_1_1math.html#a34fd02fe795ea38c98f4a02befed309f',1,'stan::math::sd(const std::vector< T > &v)'],['../namespacestan_1_1math.html#a8e1cb72c1528f0ff383033c642341147',1,'stan::math::sd(const Eigen::Matrix< T, R, C > &m)']]], + ['sd_2ehpp',['sd.hpp',['../agrad_2rev_2matrix_2sd_8hpp.html',1,'']]], + ['sd_2ehpp',['sd.hpp',['../math_2matrix_2sd_8hpp.html',1,'']]], + ['seed',['seed',['../structstan_1_1io_1_1stan__csv__metadata.html#a1c59ab6a12137c935db71dae89472dd4',1,'stan::io::stan_csv_metadata::seed()'],['../classstan_1_1mcmc_1_1base__hmc.html#af14724fbb8065467b10deeb4134c6e74',1,'stan::mcmc::base_hmc::seed()']]], + ['segment',['segment',['../namespacestan_1_1math.html#a4e828d606f1a1c8faf42e6d901089543',1,'stan::math::segment(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v, size_t i, size_t n)'],['../namespacestan_1_1math.html#ad2c340addebdc88ac086b0e1fac2c1b7',1,'stan::math::segment(const Eigen::Matrix< T, 1, Eigen::Dynamic > &v, size_t i, size_t n)'],['../namespacestan_1_1math.html#a721232b5c8e7c068a120719255f5fb0c',1,'stan::math::segment(const std::vector< T > &sv, size_t i, size_t n)']]], + ['segment_2ehpp',['segment.hpp',['../segment_8hpp.html',1,'']]], + ['seq_5fview',['seq_view',['../classstan_1_1math_1_1seq__view.html',1,'stan::math']]], + ['seq_5fview',['seq_view',['../classstan_1_1math_1_1seq__view.html#a0c10cc8d25cff8c90c8bbecf3cd054a1',1,'stan::math::seq_view::seq_view()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_01_eigen_1_1_dynamic_00_011_01_4_01_4.html#ae570c324a14b81a018475195a77e4430',1,'stan::math::seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, 1 > >::seq_view()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_011_00_01_eigen_1_1_dynamic_01_4_01_4.html#a57ab58ed09da14b8efcf83b9d1528b88',1,'stan::math::seq_view< T, Eigen::Matrix< S, 1, Eigen::Dynamic > >::seq_view()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4.html#a706e3bea5d58f77fd9d6d427e64aa370',1,'stan::math::seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, Eigen::Dynamic > >::seq_view()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01_s_01_4_01_4.html#a42ff5c63f8f83390fc7c585b41c0d5ed',1,'stan::math::seq_view< T, std::vector< S > >::seq_view()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01_t_01_4_01_4.html#a2e9627b1092238710ed116adc7c1cab5',1,'stan::math::seq_view< T, std::vector< T > >::seq_view()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01std_1_1vector_3_01_t_01_4_01_4_01_4.html#ac35e60cb3f9e9f4dde81b8ed3b532a2b',1,'stan::math::seq_view< T, std::vector< std::vector< T > > >::seq_view()'],['../classstan_1_1math_1_1seq__view_3_01double_00_01std_1_1vector_3_01int_01_4_01_4.html#ad82423565c559cd4e889350bc204319b',1,'stan::math::seq_view< double, std::vector< int > >::seq_view()']]], + ['seq_5fview_2ehpp',['seq_view.hpp',['../seq__view_8hpp.html',1,'']]], + ['seq_5fview_3c_20double_2c_20std_3a_3avector_3c_20int_20_3e_20_3e',['seq_view< double, std::vector< int > >',['../classstan_1_1math_1_1seq__view_3_01double_00_01std_1_1vector_3_01int_01_4_01_4.html',1,'stan::math']]], + ['seq_5fview_3c_20t_2c_20eigen_3a_3amatrix_3c_20s_2c_201_2c_20eigen_3a_3adynamic_20_3e_20_3e',['seq_view< T, Eigen::Matrix< S, 1, Eigen::Dynamic > >',['../classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_011_00_01_eigen_1_1_dynamic_01_4_01_4.html',1,'stan::math']]], + ['seq_5fview_3c_20t_2c_20eigen_3a_3amatrix_3c_20s_2c_20eigen_3a_3adynamic_2c_201_20_3e_20_3e',['seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, 1 > >',['../classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_01_eigen_1_1_dynamic_00_011_01_4_01_4.html',1,'stan::math']]], + ['seq_5fview_3c_20t_2c_20eigen_3a_3amatrix_3c_20s_2c_20eigen_3a_3adynamic_2c_20eigen_3a_3adynamic_20_3e_20_3e',['seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, Eigen::Dynamic > >',['../classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4.html',1,'stan::math']]], + ['seq_5fview_3c_20t_2c_20std_3a_3avector_3c_20s_20_3e_20_3e',['seq_view< T, std::vector< S > >',['../classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01_s_01_4_01_4.html',1,'stan::math']]], + ['seq_5fview_3c_20t_2c_20std_3a_3avector_3c_20std_3a_3avector_3c_20t_20_3e_20_3e_20_3e',['seq_view< T, std::vector< std::vector< T > > >',['../classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01std_1_1vector_3_01_t_01_4_01_4_01_4.html',1,'stan::math']]], + ['seq_5fview_3c_20t_2c_20std_3a_3avector_3c_20t_20_3e_20_3e',['seq_view< T, std::vector< T > >',['../classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01_t_01_4_01_4.html',1,'stan::math']]], + ['set_5fdelta',['set_delta',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#a1e6d6d34e50d9a5ff106f739ca81a851',1,'stan::mcmc::stepsize_adaptation']]], + ['set_5ffun_5ftype',['set_fun_type',['../structstan_1_1gm_1_1set__fun__type.html',1,'stan::gm']]], + ['set_5ffun_5ftype2',['set_fun_type2',['../structstan_1_1gm_1_1set__fun__type2.html',1,'stan::gm']]], + ['set_5ffun_5ftype2_5ff',['set_fun_type2_f',['../namespacestan_1_1gm.html#a071fa25593504eb98cd7d9da2baab92d',1,'stan::gm']]], + ['set_5ffun_5ftype_5ff',['set_fun_type_f',['../namespacestan_1_1gm.html#a7e620438867564889b2124e8877a6707',1,'stan::gm']]], + ['set_5ffun_5ftype_5fnamed',['set_fun_type_named',['../structstan_1_1gm_1_1set__fun__type__named.html',1,'stan::gm']]], + ['set_5ffun_5ftype_5fnamed_5ff',['set_fun_type_named_f',['../namespacestan_1_1gm.html#a7c2b54c2a8ea3233bb4e6b6984a5e2c7',1,'stan::gm']]], + ['set_5fgamma',['set_gamma',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#a7feb00e53bc871dc9e796668b65c95b7',1,'stan::mcmc::stepsize_adaptation']]], + ['set_5fkappa',['set_kappa',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#a5efe516ab71582fda45991235ea64a80',1,'stan::mcmc::stepsize_adaptation']]], + ['set_5fmax_5fdelta',['set_max_delta',['../classstan_1_1mcmc_1_1base__nuts.html#ae53e9049abf738dd6e1a3c1d6d0fb5e2',1,'stan::mcmc::base_nuts']]], + ['set_5fmax_5fdepth',['set_max_depth',['../classstan_1_1mcmc_1_1base__nuts.html#ac587ab4dc49a366f588314cffce64471',1,'stan::mcmc::base_nuts']]], + ['set_5fmu',['set_mu',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#a8be8064cdb258e343922c186ecaaaf18',1,'stan::mcmc::stepsize_adaptation']]], + ['set_5fnominal_5fstepsize',['set_nominal_stepsize',['../classstan_1_1mcmc_1_1base__hmc.html#ad9ecfad54327ebceea08415e8b1514c3',1,'stan::mcmc::base_hmc::set_nominal_stepsize()'],['../classstan_1_1mcmc_1_1base__static__hmc.html#a0219d73bf44be4797b47c150d349d261',1,'stan::mcmc::base_static_hmc::set_nominal_stepsize()']]], + ['set_5fnominal_5fstepsize_5fand_5fl',['set_nominal_stepsize_and_L',['../classstan_1_1mcmc_1_1base__static__hmc.html#a42697249fbc38355195528383ad7d08f',1,'stan::mcmc::base_static_hmc']]], + ['set_5fnominal_5fstepsize_5fand_5ft',['set_nominal_stepsize_and_T',['../classstan_1_1mcmc_1_1base__static__hmc.html#a90ce61c9dce1d02419f4488efb4950a3',1,'stan::mcmc::base_static_hmc']]], + ['set_5fparam_5franges_5fvisgen',['set_param_ranges_visgen',['../structstan_1_1gm_1_1set__param__ranges__visgen.html',1,'stan::gm']]], + ['set_5fparam_5franges_5fvisgen',['set_param_ranges_visgen',['../structstan_1_1gm_1_1set__param__ranges__visgen.html#a260565c9456f52828d4dab2472536c8c',1,'stan::gm::set_param_ranges_visgen']]], + ['set_5fstepsize_5fjitter',['set_stepsize_jitter',['../classstan_1_1mcmc_1_1base__hmc.html#aa049a77cf8131f53a707a3a976fa3c11',1,'stan::mcmc::base_hmc']]], + ['set_5ft',['set_T',['../classstan_1_1mcmc_1_1base__static__hmc.html#ab7f3e3cfb7c79053aec34e27647a573a',1,'stan::mcmc::base_static_hmc']]], + ['set_5ft0',['set_t0',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#a1afb2430aad55e460826f70db13bae9c',1,'stan::mcmc::stepsize_adaptation']]], + ['set_5ftype',['set_type',['../structstan_1_1gm_1_1variable.html#accf431520ba5cee016d698e01f089b37',1,'stan::gm::variable']]], + ['set_5fvalue',['set_value',['../classstan_1_1gm_1_1singleton__argument.html#a71e1284e9af67ce97dc32baa943a59a9',1,'stan::gm::singleton_argument']]], + ['set_5fvar_5ftype',['set_var_type',['../structstan_1_1gm_1_1set__var__type.html',1,'stan::gm']]], + ['set_5fvar_5ftype_5ff',['set_var_type_f',['../namespacestan_1_1gm.html#a4e0139a9c5cc5c02221aabee7b75d5aa',1,'stan::gm']]], + ['set_5fwarmup',['set_warmup',['../classstan_1_1mcmc_1_1chains.html#a6bb363076e9988fb98ee7241456e06b0',1,'stan::mcmc::chains::set_warmup(const int chain, const int warmup)'],['../classstan_1_1mcmc_1_1chains.html#a0e955cb8e43f1b9f8da98c5dff663768',1,'stan::mcmc::chains::set_warmup(const int warmup)']]], + ['set_5fwindow_5fparams',['set_window_params',['../classstan_1_1mcmc_1_1stepsize__covar__adapter.html#ae337a1a05112f580a3d105a8b60fe83f',1,'stan::mcmc::stepsize_covar_adapter::set_window_params()'],['../classstan_1_1mcmc_1_1stepsize__var__adapter.html#a9de24f09147a18ab6974426a518ba691',1,'stan::mcmc::stepsize_var_adapter::set_window_params()'],['../classstan_1_1mcmc_1_1windowed__adaptation.html#a818edfc11176b8ebc0bdb1b1d9c3319c',1,'stan::mcmc::windowed_adaptation::set_window_params()']]], + ['set_5fzero_5fadjoint',['set_zero_adjoint',['../classstan_1_1agrad_1_1chainable.html#a6cb7ffe4555cbba60c2136053d2c2a5f',1,'stan::agrad::chainable::set_zero_adjoint()'],['../classstan_1_1agrad_1_1vari.html#a1b9805e76f3afcb3199d8455c577a4dc',1,'stan::agrad::vari::set_zero_adjoint()']]], + ['set_5fzero_5fall_5fadjoints',['set_zero_all_adjoints',['../namespacestan_1_1agrad.html#aadb1e5a1bc99069eeab84a0b27c4dceb',1,'stan::agrad']]], + ['sign',['sign',['../structstan_1_1mcmc_1_1nuts__util.html#a1a1ff33b599f6046e6137d127a641b5e',1,'stan::mcmc::nuts_util::sign()'],['../namespacestan_1_1prob.html#af054a122bafce0c367eaca60a181bd47',1,'stan::prob::sign()']]], + ['signaling_5fnan',['signaling_NaN',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a2f08955d86f725887a49949ebef19626',1,'std::numeric_limits< stan::agrad::fvar< T > >::signaling_NaN()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a4c69e978e7814b7215f29a2e57a73993',1,'std::numeric_limits< stan::agrad::var >::signaling_NaN()']]], + ['significant_5fdecimals_5fdefault_5fimpl_3c_20stan_3a_3aagrad_3a_3avar_2c_20false_20_3e',['significant_decimals_default_impl< stan::agrad::var, false >',['../struct_eigen_1_1internal_1_1significant__decimals__default__impl_3_01stan_1_1agrad_1_1var_00_01false_01_4.html',1,'Eigen::internal']]], + ['simplex',['simplex',['../classstan_1_1io_1_1reader.html#a9b15c1f051764a8a50a08c5880f810bb',1,'stan::io::reader']]], + ['simplex_5fconstrain',['simplex_constrain',['../classstan_1_1io_1_1reader.html#a1fa21fc736a271ff845ffddc5ecae125',1,'stan::io::reader::simplex_constrain(size_t k)'],['../classstan_1_1io_1_1reader.html#a8ee8c20266159e7ce8763c8014bf2899',1,'stan::io::reader::simplex_constrain(size_t k, T &lp)'],['../namespacestan_1_1prob.html#a34fe9ae8e8dcc7b4f619ffcdf2ac5387',1,'stan::prob::simplex_constrain(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &y)'],['../namespacestan_1_1prob.html#a373ba2418f71147953238312e5bd6954',1,'stan::prob::simplex_constrain(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &y, T &lp)']]], + ['simplex_5fdecl_5fr',['simplex_decl_r',['../structstan_1_1gm_1_1var__decls__grammar.html#a3fb24659ce9b09c18ac09acc4079510f',1,'stan::gm::var_decls_grammar']]], + ['simplex_5ffree',['simplex_free',['../namespacestan_1_1prob.html#a6703d995557396cc5fd013c6cd882327',1,'stan::prob']]], + ['simplex_5funconstrain',['simplex_unconstrain',['../classstan_1_1io_1_1writer.html#ae9bc049dd109093051e7db16aa18be56',1,'stan::io::writer']]], + ['simplex_5fvar_5fdecl',['simplex_var_decl',['../structstan_1_1gm_1_1simplex__var__decl.html#a7e1687968e4f300e3ebae4720065db42',1,'stan::gm::simplex_var_decl::simplex_var_decl()'],['../structstan_1_1gm_1_1simplex__var__decl.html#a9f61771cca77cde06b1e0723d4b8471a',1,'stan::gm::simplex_var_decl::simplex_var_decl(expression const &K, std::string const &name, std::vector< expression > const &dims)']]], + ['simplex_5fvar_5fdecl',['simplex_var_decl',['../structstan_1_1gm_1_1simplex__var__decl.html',1,'stan::gm']]], + ['sin',['sin',['../namespacestan_1_1agrad.html#a7b48feb9c99466a3be1efb1abc686779',1,'stan::agrad::sin(const var &a)'],['../namespacestan_1_1agrad.html#acd0120597292585e7729ba613fdbb42a',1,'stan::agrad::sin(const fvar< T > &x)']]], + ['sin_2ehpp',['sin.hpp',['../fwd_2functions_2sin_8hpp.html',1,'']]], + ['sin_2ehpp',['sin.hpp',['../rev_2functions_2sin_8hpp.html',1,'']]], + ['singleton_5fargument',['singleton_argument',['../classstan_1_1gm_1_1singleton__argument.html#af6cb0a5be1281e4f5e3c6889fa50eaa9',1,'stan::gm::singleton_argument::singleton_argument()'],['../classstan_1_1gm_1_1singleton__argument.html#a33f50fa7bdbeaf5e7bb2255d80b78945',1,'stan::gm::singleton_argument::singleton_argument(const std::string name)']]], + ['singleton_5fargument',['singleton_argument',['../classstan_1_1gm_1_1singleton__argument.html',1,'stan::gm']]], + ['singleton_5fargument_2ehpp',['singleton_argument.hpp',['../singleton__argument_8hpp.html',1,'']]], + ['singular_5fvalues',['singular_values',['../namespacestan_1_1math.html#a204f15e3685b2c610ca2c0c80a3005d5',1,'stan::math']]], + ['singular_5fvalues_2ehpp',['singular_values.hpp',['../singular__values_8hpp.html',1,'']]], + ['sinh',['sinh',['../namespacestan_1_1agrad.html#afac6cdf77cc95b678ffde768754810e5',1,'stan::agrad::sinh(const var &a)'],['../namespacestan_1_1agrad.html#a6d1505ab5904db650f5d478a09beb7dc',1,'stan::agrad::sinh(const fvar< T > &x)']]], + ['sinh_2ehpp',['sinh.hpp',['../fwd_2functions_2sinh_8hpp.html',1,'']]], + ['sinh_2ehpp',['sinh.hpp',['../rev_2functions_2sinh_8hpp.html',1,'']]], + ['size',['size',['../classstan_1_1agrad_1_1op__matrix__vari.html#a6611078e47e0bb3d017e78e29f194036',1,'stan::agrad::op_matrix_vari::size()'],['../classstan_1_1agrad_1_1op__vector__vari.html#af0560b5a659dae6c49afae0b3657e8f2',1,'stan::agrad::op_vector_vari::size()'],['../classstan_1_1math_1_1seq__view.html#ab20467423ddb3b3e45513abb8e4a21d3',1,'stan::math::seq_view::size()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_01_eigen_1_1_dynamic_00_011_01_4_01_4.html#a3284abfb2471ad555d43a8693658c5ec',1,'stan::math::seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, 1 > >::size()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_011_00_01_eigen_1_1_dynamic_01_4_01_4.html#a8c830a8c9c9c431a71a89cf4b996b27e',1,'stan::math::seq_view< T, Eigen::Matrix< S, 1, Eigen::Dynamic > >::size()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4.html#a07185ddaf17963a5724ddc2c62208922',1,'stan::math::seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, Eigen::Dynamic > >::size()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01_s_01_4_01_4.html#a3a6031049d11ce5429727dcbe5e29130',1,'stan::math::seq_view< T, std::vector< S > >::size()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01_t_01_4_01_4.html#a3f616444293b86fdb17272494c88cc4c',1,'stan::math::seq_view< T, std::vector< T > >::size()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01std_1_1vector_3_01_t_01_4_01_4_01_4.html#ab81a7a5c2de89631c7aec2ab701854a1',1,'stan::math::seq_view< T, std::vector< std::vector< T > > >::size()'],['../classstan_1_1math_1_1seq__view_3_01double_00_01std_1_1vector_3_01int_01_4_01_4.html#af56447dd766a3a5a9d6c97b0a2de9563',1,'stan::math::seq_view< double, std::vector< int > >::size()'],['../namespacestan_1_1math.html#aa1f9966aade9c4515d33d3ffa7305462',1,'stan::math::size()']]], + ['size_2ehpp',['size.hpp',['../size_8hpp.html',1,'']]], + ['size_5f',['size_',['../classstan_1_1agrad_1_1op__matrix__vari.html#acb63d498d5e4c7008bc2fd5407bf37cf',1,'stan::agrad::op_matrix_vari::size_()'],['../classstan_1_1agrad_1_1op__vector__vari.html#a71e9b994ff0ea34aa6ea109365e9ca27',1,'stan::agrad::op_vector_vari::size_()'],['../classstan_1_1agrad_1_1stored__gradient__vari.html#ae0a8a41b1a8e68d294cecb3ef46692e9',1,'stan::agrad::stored_gradient_vari::size_()'],['../agrad_2rev_2matrix_2dot__self_8hpp.html#a5f31775800bbb46b35b5791def1f3acc',1,'size_(): dot_self.hpp'],['../agrad_2rev_2matrix_2log__softmax_8hpp.html#a50218915641ec8f39877c2565e95a604',1,'size_(): log_softmax.hpp'],['../agrad_2rev_2matrix_2softmax_8hpp.html#a50218915641ec8f39877c2565e95a604',1,'size_(): softmax.hpp']]], + ['size_5fcont',['size_cont',['../classstan_1_1mcmc_1_1sample.html#aadbb128a85fb6d72df04d3097acfc3e5',1,'stan::mcmc::sample']]], + ['size_5fof',['size_of',['../structstan_1_1size__of__helper.html#a8f7056983b7948acf66a2e8b3e37e855',1,'stan::size_of_helper::size_of()'],['../structstan_1_1size__of__helper_3_01_t_00_01true_01_4.html#af0810fc0270af209916e67d5defe4b7d',1,'stan::size_of_helper< T, true >::size_of()'],['../namespacestan.html#a4741beaf7ec88631fd2735cadf05365f',1,'stan::size_of()']]], + ['size_5fof_5fhelper',['size_of_helper',['../structstan_1_1size__of__helper.html',1,'stan']]], + ['size_5fof_5fhelper_3c_20t_2c_20true_20_3e',['size_of_helper< T, true >',['../structstan_1_1size__of__helper_3_01_t_00_01true_01_4.html',1,'stan']]], + ['size_5ftype',['size_type',['../classstan_1_1math_1_1_l_d_l_t__factor_3_01stan_1_1agrad_1_1var_00_01_r_00_01_c_01_4.html#ad21eca557d202a3f2f1db369f08afb89',1,'stan::math::LDLT_factor< stan::agrad::var, R, C >::size_type()'],['../classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4.html#a226a632082480f5715a8ef2979719fa1',1,'stan::math::LDLT_factor< double, R, C >::size_type()'],['../namespacestan_1_1agrad.html#aeae9e6e94d5656d748136a7c4780856e',1,'stan::agrad::size_type()'],['../namespacestan_1_1math.html#aa29284c242450c2000920599105e4eb0',1,'stan::math::size_type()']]], + ['skew_5fnormal_2ehpp',['skew_normal.hpp',['../skew__normal_8hpp.html',1,'']]], + ['skew_5fnormal_5fccdf_5flog',['skew_normal_ccdf_log',['../namespacestan_1_1prob.html#a9b9d2a0cb044b4683b8ebc1f5664067a',1,'stan::prob']]], + ['skew_5fnormal_5fcdf',['skew_normal_cdf',['../namespacestan_1_1prob.html#af883c9ea717a01e7835a5071cfb132bd',1,'stan::prob']]], + ['skew_5fnormal_5fcdf_5flog',['skew_normal_cdf_log',['../namespacestan_1_1prob.html#aa702b78d553fccea5853eb3fad971200',1,'stan::prob']]], + ['skew_5fnormal_5flog',['skew_normal_log',['../namespacestan_1_1prob.html#aa490430040824f21c59eb415f0b77051',1,'stan::prob::skew_normal_log(const T_y &y, const T_loc &mu, const T_scale &sigma, const T_shape &alpha)'],['../namespacestan_1_1prob.html#a72d94de0c6230acb70815802bddf5587',1,'stan::prob::skew_normal_log(const T_y &y, const T_loc &mu, const T_scale &sigma, const T_shape &alpha)']]], + ['skew_5fnormal_5frng',['skew_normal_rng',['../namespacestan_1_1prob.html#ad193097bedddda283ba854e2ddcd6013',1,'stan::prob']]], + ['softmax',['softmax',['../namespacestan_1_1agrad.html#afb1b8b97d1a6b36f59618a80a9c3778d',1,'stan::agrad::softmax(const Eigen::Matrix< fvar< T >, Eigen::Dynamic, 1 > &alpha)'],['../namespacestan_1_1agrad.html#a611391662c0928a68fa23be96188a49d',1,'stan::agrad::softmax(const Eigen::Matrix< var, Eigen::Dynamic, 1 > &alpha)'],['../namespacestan_1_1math.html#a724679c01caa9ae44c146fe8019ddcf6',1,'stan::math::softmax()']]], + ['softmax_2ehpp',['softmax.hpp',['../agrad_2fwd_2matrix_2softmax_8hpp.html',1,'']]], + ['softmax_2ehpp',['softmax.hpp',['../agrad_2rev_2matrix_2softmax_8hpp.html',1,'']]], + ['softmax_2ehpp',['softmax.hpp',['../math_2matrix_2softmax_8hpp.html',1,'']]], + ['softmax_5falpha_5f',['softmax_alpha_',['../agrad_2rev_2matrix_2log__softmax_8hpp.html#a1e7fc23c4da87820ad49b66444825c34',1,'softmax_alpha_(): log_softmax.hpp'],['../agrad_2rev_2matrix_2softmax_8hpp.html#a1e7fc23c4da87820ad49b66444825c34',1,'softmax_alpha_(): softmax.hpp']]], + ['software',['SOFTWARE',['../structstan_1_1gm_1_1error__codes.html#aa63873e8f7e9dd7f8af3502e4003292fa9924bc6241a8d380961bb3d9bc8dba92',1,'stan::gm::error_codes']]], + ['solve',['solve',['../classstan_1_1math_1_1_l_d_l_t__factor_3_01stan_1_1agrad_1_1var_00_01_r_00_01_c_01_4.html#a94d5fa0c327e9f55e1fc90734040c845',1,'stan::math::LDLT_factor< stan::agrad::var, R, C >::solve()'],['../classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4.html#a1974a3e67f6d9aa1d1cdfe803a7aaaef',1,'stan::math::LDLT_factor< double, R, C >::solve()']]], + ['solveright',['solveRight',['../classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4.html#aed238516181016209dbe39a879146092',1,'stan::math::LDLT_factor< double, R, C >']]], + ['sort_2ehpp',['sort.hpp',['../agrad_2fwd_2matrix_2sort_8hpp.html',1,'']]], + ['sort_2ehpp',['sort.hpp',['../agrad_2rev_2matrix_2sort_8hpp.html',1,'']]], + ['sort_2ehpp',['sort.hpp',['../math_2matrix_2sort_8hpp.html',1,'']]], + ['sort_5fasc',['sort_asc',['../namespacestan_1_1agrad.html#ad95245f78e0f8d52eb288842562fc4a4',1,'stan::agrad::sort_asc(std::vector< fvar< T > > xs)'],['../namespacestan_1_1agrad.html#a9ac1f0102b58f1e1a1dee468a383f27d',1,'stan::agrad::sort_asc(Eigen::Matrix< fvar< T >, R, C > xs)'],['../namespacestan_1_1agrad.html#a9eb00d0b49af47ecd65373ef59ae1640',1,'stan::agrad::sort_asc(std::vector< var > xs)'],['../namespacestan_1_1agrad.html#a64d1e2a0f135d1ce0a1e1f4e768bc8e5',1,'stan::agrad::sort_asc(Eigen::Matrix< var, R, C > xs)'],['../namespacestan_1_1math.html#a80f5418b16ea26e9bc6d2a8f9b764897',1,'stan::math::sort_asc(std::vector< T > xs)'],['../namespacestan_1_1math.html#aea0d013ec0a699e61dd74f32aa722fa0',1,'stan::math::sort_asc(Eigen::Matrix< T, R, C > xs)']]], + ['sort_5fdesc',['sort_desc',['../namespacestan_1_1agrad.html#abcc2609354cc5a38ad45c3b0a656e63f',1,'stan::agrad::sort_desc(std::vector< fvar< T > > xs)'],['../namespacestan_1_1agrad.html#a77b9ed0b3272b0bf9623fe31b69bc965',1,'stan::agrad::sort_desc(Eigen::Matrix< fvar< T >, R, C > xs)'],['../namespacestan_1_1agrad.html#acdf543712f8bac6eb1b7dff1eae7c3c6',1,'stan::agrad::sort_desc(std::vector< var > xs)'],['../namespacestan_1_1agrad.html#a41cc77adf1c2cb5df2034d8d94da39da',1,'stan::agrad::sort_desc(Eigen::Matrix< var, R, C > xs)'],['../namespacestan_1_1math.html#ab0b2712eab9b95535c0589455ed11cfc',1,'stan::math::sort_desc(std::vector< T > xs)'],['../namespacestan_1_1math.html#a13ae8cd1155e8c4c684efb4405a1e277',1,'stan::math::sort_desc(Eigen::Matrix< T, R, C > xs)']]], + ['split_5farg',['split_arg',['../classstan_1_1gm_1_1argument.html#ab68a5c3e2ba856a6717ffe71b7968f53',1,'stan::gm::argument']]], + ['split_5fpotential_5fscale_5freduction',['split_potential_scale_reduction',['../classstan_1_1mcmc_1_1chains.html#aff7e664bd9451e0854d65bd8c4a6aa9d',1,'stan::mcmc::chains::split_potential_scale_reduction(const int index)'],['../classstan_1_1mcmc_1_1chains.html#a2ae7c29a53d548f408ddc9a9d894d767',1,'stan::mcmc::chains::split_potential_scale_reduction(const std::string &name)']]], + ['sqrt',['sqrt',['../namespacestan_1_1agrad.html#a14e7c78163cf5677786955053de27a98',1,'stan::agrad::sqrt(const var &a)'],['../namespacestan_1_1agrad.html#af7d52e77074ba94b4485cc33f8f637df',1,'stan::agrad::sqrt(const fvar< T > &x)']]], + ['sqrt_2ehpp',['sqrt.hpp',['../fwd_2functions_2sqrt_8hpp.html',1,'']]], + ['sqrt_2ehpp',['sqrt.hpp',['../rev_2functions_2sqrt_8hpp.html',1,'']]], + ['sqrt2',['sqrt2',['../namespacestan_1_1math.html#a1369f60a09e3af4933096de3a54ac28c',1,'stan::math']]], + ['sqrt_5f2',['SQRT_2',['../namespacestan_1_1math.html#a491d6e40aaa2a3e205ea6708dc3c75dd',1,'stan::math']]], + ['square',['square',['../namespacestan_1_1agrad.html#a5de00b0d86ae64136a4952a28f9bd84f',1,'stan::agrad::square(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#a18783225f7d6895849af12dd12b305bf',1,'stan::agrad::square(const var &x)'],['../namespacestan_1_1math.html#a056b82f11f784f321bce2c5677089e24',1,'stan::math::square()']]], + ['square_2ehpp',['square.hpp',['../agrad_2fwd_2functions_2square_8hpp.html',1,'']]], + ['square_2ehpp',['square.hpp',['../agrad_2rev_2functions_2square_8hpp.html',1,'']]], + ['square_2ehpp',['square.hpp',['../math_2functions_2square_8hpp.html',1,'']]], + ['squared_5fdist',['squared_dist',['../namespacestan_1_1agrad.html#a910dc759393c71753e4f9461ef002959',1,'stan::agrad::squared_dist(const Eigen::Matrix< var, R1, C1 > &v1, const Eigen::Matrix< var, R2, C2 > &v2)'],['../namespacestan_1_1agrad.html#a5f43e23662d36a6779a584428de7ccf2',1,'stan::agrad::squared_dist(const Eigen::Matrix< var, R1, C1 > &v1, const Eigen::Matrix< double, R2, C2 > &v2)'],['../namespacestan_1_1agrad.html#a94d44dbc0e316489fb9af8f90ca2e283',1,'stan::agrad::squared_dist(const Eigen::Matrix< double, R1, C1 > &v1, const Eigen::Matrix< var, R2, C2 > &v2)'],['../namespacestan_1_1math.html#aa870be227ae57e703770592d7d5d3a22',1,'stan::math::squared_dist()']]], + ['squared_5fdist_2ehpp',['squared_dist.hpp',['../agrad_2rev_2matrix_2squared__dist_8hpp.html',1,'']]], + ['squared_5fdist_2ehpp',['squared_dist.hpp',['../math_2matrix_2squared__dist_8hpp.html',1,'']]], + ['stack_5falloc',['stack_alloc',['../classstan_1_1memory_1_1stack__alloc.html#a3da167b8f4f9bd981f948ac03c29604b',1,'stan::memory::stack_alloc']]], + ['stack_5falloc',['stack_alloc',['../classstan_1_1memory_1_1stack__alloc.html',1,'stan::memory']]], + ['stack_5falloc_2ehpp',['stack_alloc.hpp',['../stack__alloc_8hpp.html',1,'']]], + ['stage_5f',['stage_',['../structstan_1_1gm_1_1var__size__validating__visgen.html#ae878013c66844f15680c8748629f51b7',1,'stan::gm::var_size_validating_visgen']]], + ['stan',['stan',['../namespacestan.html',1,'']]], + ['stan_2edox',['stan.dox',['../stan_8dox.html',1,'']]], + ['stan_5fcsv',['stan_csv',['../structstan_1_1io_1_1stan__csv.html',1,'stan::io']]], + ['stan_5fcsv_5fadaptation',['stan_csv_adaptation',['../structstan_1_1io_1_1stan__csv__adaptation.html#a80dd57392300524f88f68f09959a1918',1,'stan::io::stan_csv_adaptation']]], + ['stan_5fcsv_5fadaptation',['stan_csv_adaptation',['../structstan_1_1io_1_1stan__csv__adaptation.html',1,'stan::io']]], + ['stan_5fcsv_5fmetadata',['stan_csv_metadata',['../structstan_1_1io_1_1stan__csv__metadata.html#abb84cf3a6ecfaceb2fe108180e9897eb',1,'stan::io::stan_csv_metadata']]], + ['stan_5fcsv_5fmetadata',['stan_csv_metadata',['../structstan_1_1io_1_1stan__csv__metadata.html',1,'stan::io']]], + ['stan_5fcsv_5freader',['stan_csv_reader',['../classstan_1_1io_1_1stan__csv__reader.html',1,'stan::io']]], + ['stan_5fcsv_5freader',['stan_csv_reader',['../classstan_1_1io_1_1stan__csv__reader.html#a959ed39477ffd99a18b8ee217f6ad457',1,'stan::io::stan_csv_reader']]], + ['stan_5fcsv_5freader_2ehpp',['stan_csv_reader.hpp',['../stan__csv__reader_8hpp.html',1,'']]], + ['stan_5fcsv_5ftiming',['stan_csv_timing',['../structstan_1_1io_1_1stan__csv__timing.html#acbab41cb7a74d799bafda67688bf3e8e',1,'stan::io::stan_csv_timing']]], + ['stan_5fcsv_5ftiming',['stan_csv_timing',['../structstan_1_1io_1_1stan__csv__timing.html',1,'stan::io']]], + ['stan_5fprint',['stan_print',['../namespacestan_1_1agrad.html#a0d1d06f46e761f9f0fbcf078b6e6208e',1,'stan::agrad::stan_print()'],['../namespacestan_1_1math.html#a7c14b7fd70050f03a07fdf73a1df06d2',1,'stan::math::stan_print(std::ostream *o, const T &x)'],['../namespacestan_1_1math.html#a37cb2d874adcc950cb0439af044f549f',1,'stan::math::stan_print(std::ostream *o, const std::vector< T > &x)'],['../namespacestan_1_1math.html#ae94f7170ee85d4b353f55e3a044d2345',1,'stan::math::stan_print(std::ostream *o, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x)'],['../namespacestan_1_1math.html#ad9c9057d71cf2795d0042f665c0f89c1',1,'stan::math::stan_print(std::ostream *o, const Eigen::Matrix< T, 1, Eigen::Dynamic > &x)'],['../namespacestan_1_1math.html#adffa61a0521d0c07b8c4cd7ccbbb4aca',1,'stan::math::stan_print(std::ostream *o, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &x)']]], + ['stan_5fprint_2ehpp',['stan_print.hpp',['../agrad_2rev_2matrix_2stan__print_8hpp.html',1,'']]], + ['stan_5fprint_2ehpp',['stan_print.hpp',['../math_2matrix_2stan__print_8hpp.html',1,'']]], + ['stan_5fversion_5fmajor',['stan_version_major',['../structstan_1_1io_1_1stan__csv__metadata.html#a8f6f94ea53c82fcb9269a649066af0dc',1,'stan::io::stan_csv_metadata']]], + ['stan_5fversion_5fminor',['stan_version_minor',['../structstan_1_1io_1_1stan__csv__metadata.html#a259cf0626d25c32dc03b82fc4cd1f08a',1,'stan::io::stan_csv_metadata']]], + ['stan_5fversion_5fpatch',['stan_version_patch',['../structstan_1_1io_1_1stan__csv__metadata.html#a05c438d9a575f0d8b5326cde887c51ad',1,'stan::io::stan_csv_metadata']]], + ['stanc_2ecpp',['stanc.cpp',['../stanc_8cpp.html',1,'']]], + ['stanc_5fhelper',['stanc_helper',['../stanc__helper_8hpp.html#a6285d39574513b78cafc494a8f614852',1,'stanc_helper.hpp']]], + ['stanc_5fhelper_2ehpp',['stanc_helper.hpp',['../stanc__helper_8hpp.html',1,'']]], + ['statement',['statement',['../structstan_1_1gm_1_1statement.html',1,'stan::gm']]], + ['statement',['statement',['../structstan_1_1gm_1_1statement.html#abe28b81d5ca623dfbee35480dd7aed2e',1,'stan::gm::statement::statement()'],['../structstan_1_1gm_1_1statement.html#ab5dc6d05e69a9d8443a05edbca545446',1,'stan::gm::statement::statement(const statement_t &st)'],['../structstan_1_1gm_1_1statement.html#ad9eb67ce544f05bb158d1d660537d22d',1,'stan::gm::statement::statement(const nil &st)'],['../structstan_1_1gm_1_1statement.html#a7edde6e19d06ecabc83b4d0b20287f8c',1,'stan::gm::statement::statement(const assignment &st)'],['../structstan_1_1gm_1_1statement.html#af2e6691a2c9b6ebe50a2980782077a14',1,'stan::gm::statement::statement(const sample &st)'],['../structstan_1_1gm_1_1statement.html#ac61a640e5137d6644f0e6a4f2cf5a0f6',1,'stan::gm::statement::statement(const increment_log_prob_statement &st)'],['../structstan_1_1gm_1_1statement.html#a87f9d00e9b62804b5022958df5ba12df',1,'stan::gm::statement::statement(const expression &st)'],['../structstan_1_1gm_1_1statement.html#adcfaa1a8e2045291440780abf58f7203',1,'stan::gm::statement::statement(const statements &st)'],['../structstan_1_1gm_1_1statement.html#aee6de7e7d5063346e281a197ba3054c9',1,'stan::gm::statement::statement(const for_statement &st)'],['../structstan_1_1gm_1_1statement.html#a9326bcbb2bfbc31fe3bf8e5295496dac',1,'stan::gm::statement::statement(const conditional_statement &st)'],['../structstan_1_1gm_1_1statement.html#ac5c288cb0c748f276f04694c182cd612',1,'stan::gm::statement::statement(const while_statement &st)'],['../structstan_1_1gm_1_1statement.html#ab17da65c74a3282835af18dccd20d5cd',1,'stan::gm::statement::statement(const print_statement &st)'],['../structstan_1_1gm_1_1statement.html#ae88961e04050f67fdf34a6a5b1b872b9',1,'stan::gm::statement::statement(const no_op_statement &st)']]], + ['statement_5f',['statement_',['../structstan_1_1gm_1_1statement.html#a42dac92fef21d4502828e531cc6ea4b9',1,'stan::gm::statement::statement_()'],['../structstan_1_1gm_1_1for__statement.html#a88a12e92114b27b638669beb3a4fa795',1,'stan::gm::for_statement::statement_()'],['../structstan_1_1gm_1_1program.html#a68db9c547c8a9a585860305efa83ee38',1,'stan::gm::program::statement_()']]], + ['statement_5f2_5fg',['statement_2_g',['../structstan_1_1gm_1_1statement__grammar.html#a711cbab281b543290a3efa6012ef39c1',1,'stan::gm::statement_grammar']]], + ['statement_5f2_5fgrammar',['statement_2_grammar',['../structstan_1_1gm_1_1statement__2__grammar.html',1,'stan::gm']]], + ['statement_5f2_5fgrammar',['statement_2_grammar',['../structstan_1_1gm_1_1statement__2__grammar.html#a124bb789c4c06388a498dffc981b1726',1,'stan::gm::statement_2_grammar']]], + ['statement_5f2_5fgrammar_2ehpp',['statement_2_grammar.hpp',['../statement__2__grammar_8hpp.html',1,'']]], + ['statement_5f2_5fgrammar_5fdef_2ehpp',['statement_2_grammar_def.hpp',['../statement__2__grammar__def_8hpp.html',1,'']]], + ['statement_5f2_5fgrammar_5finst_2ecpp',['statement_2_grammar_inst.cpp',['../statement__2__grammar__inst_8cpp.html',1,'']]], + ['statement_5f2_5fr',['statement_2_r',['../structstan_1_1gm_1_1statement__2__grammar.html#ade56d3d85cad306fb8a918671335bc26',1,'stan::gm::statement_2_grammar']]], + ['statement_5fg',['statement_g',['../structstan_1_1gm_1_1program__grammar.html#adac531fa3a2b1db28c4ae98e90af0a2b',1,'stan::gm::program_grammar::statement_g()'],['../structstan_1_1gm_1_1statement__2__grammar.html#a71b74b870a48887d16af27eb90154492',1,'stan::gm::statement_2_grammar::statement_g()']]], + ['statement_5fgrammar',['statement_grammar',['../structstan_1_1gm_1_1statement__grammar.html',1,'stan::gm']]], + ['statement_5fgrammar',['statement_grammar',['../structstatement__grammar.html',1,'statement_grammar< Iterator >'],['../structstan_1_1gm_1_1statement__grammar.html#af39ce5043643ec014ef8f16ed32fa9a8',1,'stan::gm::statement_grammar::statement_grammar()']]], + ['statement_5fgrammar_2ehpp',['statement_grammar.hpp',['../statement__grammar_8hpp.html',1,'']]], + ['statement_5fgrammar_5fdef_2ehpp',['statement_grammar_def.hpp',['../statement__grammar__def_8hpp.html',1,'']]], + ['statement_5fgrammar_5finst_2ecpp',['statement_grammar_inst.cpp',['../statement__grammar__inst_8cpp.html',1,'']]], + ['statement_5fr',['statement_r',['../structstan_1_1gm_1_1statement__grammar.html#af25706af04c4ddca423562a701a693a3',1,'stan::gm::statement_grammar']]], + ['statement_5fseq_5fr',['statement_seq_r',['../structstan_1_1gm_1_1statement__grammar.html#a041b22f44ddbc558223b1ffeae95bbb9',1,'stan::gm::statement_grammar']]], + ['statement_5ft',['statement_t',['../structstan_1_1gm_1_1statement.html#ab5c314341c7dd06f32786185b5689314',1,'stan::gm::statement']]], + ['statement_5fvisgen',['statement_visgen',['../structstan_1_1gm_1_1statement__visgen.html#a5b426890ad86afc18588037d3acd1cdf',1,'stan::gm::statement_visgen']]], + ['statement_5fvisgen',['statement_visgen',['../structstan_1_1gm_1_1statement__visgen.html',1,'stan::gm']]], + ['statements',['statements',['../structstan_1_1gm_1_1statements.html#aa4e43d906c204aacbd111474d080c466',1,'stan::gm::statements::statements()'],['../structstan_1_1gm_1_1statements.html#afd82e89ed40745f135579777e52e2277',1,'stan::gm::statements::statements(const std::vector< var_decl > &local_decl, const std::vector< statement > &stmts)']]], + ['statements',['statements',['../structstan_1_1gm_1_1statements.html',1,'stan::gm']]], + ['statements_5f',['statements_',['../structstan_1_1gm_1_1statements.html#a4de24354bdefdcf2b482150027a4b841',1,'stan::gm::statements']]], + ['std',['std',['../namespacestd.html',1,'']]], + ['std_2edox',['std.dox',['../std_8dox.html',1,'']]], + ['std_5fvector',['std_vector',['../classstan_1_1io_1_1reader.html#a72a39fbd649e5be85b0f20ac00721c35',1,'stan::io::reader']]], + ['step',['step',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#adfa1ece56a78fbd805212d31179da105',1,'stan::optimization::BFGSMinimizer::step()'],['../classstan_1_1optimization_1_1_nesterov_gradient.html#af3e12bb8b1db3c38fcbd359f6c7f5bc9',1,'stan::optimization::NesterovGradient::step()'],['../namespacestan_1_1agrad.html#a40c71c5396dbbbbcee5a8ae890345060',1,'stan::agrad::step()'],['../namespacestan_1_1math.html#a8fdc5e5ba8e306c2a594e928bfd62ea2',1,'stan::math::step()']]], + ['step_2ehpp',['step.hpp',['../math_2functions_2step_8hpp.html',1,'']]], + ['step_2ehpp',['step.hpp',['../agrad_2rev_2functions_2step_8hpp.html',1,'']]], + ['step_5fsize',['step_size',['../structstan_1_1io_1_1stan__csv__adaptation.html#ac3cef3b693c2834695a9d7f6e21614f7',1,'stan::io::stan_csv_adaptation']]], + ['stepsize_5fadaptation',['stepsize_adaptation',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#a288d386b790bc25abc7a2b7f93bddb00',1,'stan::mcmc::stepsize_adaptation']]], + ['stepsize_5fadaptation',['stepsize_adaptation',['../classstan_1_1mcmc_1_1stepsize__adaptation.html',1,'stan::mcmc']]], + ['stepsize_5fadaptation_2ehpp',['stepsize_adaptation.hpp',['../stepsize__adaptation_8hpp.html',1,'']]], + ['stepsize_5fadapter',['stepsize_adapter',['../classstan_1_1mcmc_1_1stepsize__adapter.html',1,'stan::mcmc']]], + ['stepsize_5fadapter',['stepsize_adapter',['../classstan_1_1mcmc_1_1stepsize__adapter.html#a36b5d0fb4a2d8bb3025b4104a29f6068',1,'stan::mcmc::stepsize_adapter']]], + ['stepsize_5fadapter_2ehpp',['stepsize_adapter.hpp',['../stepsize__adapter_8hpp.html',1,'']]], + ['stepsize_5fcovar_5fadapter',['stepsize_covar_adapter',['../classstan_1_1mcmc_1_1stepsize__covar__adapter.html',1,'stan::mcmc']]], + ['stepsize_5fcovar_5fadapter',['stepsize_covar_adapter',['../classstan_1_1mcmc_1_1stepsize__covar__adapter.html#a9aba8c876cb1207ce110ae95e90308e9',1,'stan::mcmc::stepsize_covar_adapter']]], + ['stepsize_5fcovar_5fadapter_2ehpp',['stepsize_covar_adapter.hpp',['../stepsize__covar__adapter_8hpp.html',1,'']]], + ['stepsize_5fvar_5fadapter',['stepsize_var_adapter',['../classstan_1_1mcmc_1_1stepsize__var__adapter.html',1,'stan::mcmc']]], + ['stepsize_5fvar_5fadapter',['stepsize_var_adapter',['../classstan_1_1mcmc_1_1stepsize__var__adapter.html#a1599b792341a655efeeebadf15c08d63',1,'stan::mcmc::stepsize_var_adapter']]], + ['stepsize_5fvar_5fadapter_2ehpp',['stepsize_var_adapter.hpp',['../stepsize__var__adapter_8hpp.html',1,'']]], + ['store_5ftype',['store_type',['../structstan_1_1math_1_1store__type.html',1,'stan::math']]], + ['store_5ftype_3c_20double_20_3e',['store_type< double >',['../structstan_1_1math_1_1store__type_3_01double_01_4.html',1,'stan::math']]], + ['store_5ftype_3c_20eigen_3a_3amatrix_3c_20s_2c_201_2c_20eigen_3a_3adynamic_20_3e_20_3e',['store_type< Eigen::Matrix< S, 1, Eigen::Dynamic > >',['../structstan_1_1math_1_1store__type.html',1,'stan::math']]], + ['store_5ftype_3c_20eigen_3a_3amatrix_3c_20s_2c_20eigen_3a_3adynamic_2c_201_20_3e_20_3e',['store_type< Eigen::Matrix< S, Eigen::Dynamic, 1 > >',['../structstan_1_1math_1_1store__type.html',1,'stan::math']]], + ['store_5ftype_3c_20eigen_3a_3amatrix_3c_20s_2c_20eigen_3a_3adynamic_2c_20eigen_3a_3adynamic_20_3e_20_3e',['store_type< Eigen::Matrix< S, Eigen::Dynamic, Eigen::Dynamic > >',['../structstan_1_1math_1_1store__type.html',1,'stan::math']]], + ['store_5ftype_3c_20int_20_3e',['store_type< int >',['../structstan_1_1math_1_1store__type_3_01int_01_4.html',1,'stan::math']]], + ['store_5ftype_3c_20s_20_3e',['store_type< S >',['../structstan_1_1math_1_1store__type.html',1,'stan::math']]], + ['store_5ftype_3c_20std_3a_3avector_3c_20int_20_3e_20_3e',['store_type< std::vector< int > >',['../structstan_1_1math_1_1store__type.html',1,'stan::math']]], + ['store_5ftype_3c_20std_3a_3avector_3c_20s_20_3e_20_3e',['store_type< std::vector< S > >',['../structstan_1_1math_1_1store__type.html',1,'stan::math']]], + ['store_5ftype_3c_20std_3a_3avector_3c_20std_3a_3avector_3c_20t_20_3e_20_3e_20_3e',['store_type< std::vector< std::vector< T > > >',['../structstan_1_1math_1_1store__type.html',1,'stan::math']]], + ['store_5ftype_3c_20std_3a_3avector_3c_20t_20_3e_20_3e',['store_type< std::vector< T > >',['../structstan_1_1math_1_1store__type.html',1,'stan::math']]], + ['stored_5fgradient_5fvari',['stored_gradient_vari',['../classstan_1_1agrad_1_1stored__gradient__vari.html#af779bcf6d92cccf16672907758f5bedc',1,'stan::agrad::stored_gradient_vari']]], + ['stored_5fgradient_5fvari',['stored_gradient_vari',['../classstan_1_1agrad_1_1stored__gradient__vari.html',1,'stan::agrad']]], + ['stored_5fgradient_5fvari_2ehpp',['stored_gradient_vari.hpp',['../stored__gradient__vari_8hpp.html',1,'']]], + ['string_5fargument',['string_argument',['../namespacestan_1_1gm.html#ae180adbeec14bbafaf3c7634061c614d',1,'stan::gm']]], + ['student_5ft_2ehpp',['student_t.hpp',['../student__t_8hpp.html',1,'']]], + ['student_5ft_5fccdf_5flog',['student_t_ccdf_log',['../namespacestan_1_1prob.html#a927a64a2497df7302ae7fa9098e65546',1,'stan::prob']]], + ['student_5ft_5fcdf',['student_t_cdf',['../namespacestan_1_1prob.html#a19cc3cf5b600b92144c79356c0e879fc',1,'stan::prob']]], + ['student_5ft_5fcdf_5flog',['student_t_cdf_log',['../namespacestan_1_1prob.html#aab514e4c15e40c36184b0291e3c2e814',1,'stan::prob']]], + ['student_5ft_5flog',['student_t_log',['../namespacestan_1_1prob.html#a72933c1b9a4eb2005d32e811ae124bd0',1,'stan::prob::student_t_log(const T_y &y, const T_dof &nu, const T_loc &mu, const T_scale &sigma)'],['../namespacestan_1_1prob.html#a9097e9dad2bbb017a14c491fa3750203',1,'stan::prob::student_t_log(const T_y &y, const T_dof &nu, const T_loc &mu, const T_scale &sigma)']]], + ['student_5ft_5frng',['student_t_rng',['../namespacestan_1_1prob.html#adb81f1474168ce77e5bb71ef3c7432d9',1,'stan::prob']]], + ['sub',['sub',['../namespacestan_1_1math.html#a9e4c5e5b76b18a41b28f646104b3cd46',1,'stan::math']]], + ['sub_2ehpp',['sub.hpp',['../sub_8hpp.html',1,'']]], + ['sub_5fcol',['sub_col',['../namespacestan_1_1math.html#a63cf32e07d51c4ebfe042dd452eeae14',1,'stan::math']]], + ['sub_5fcol_2ehpp',['sub_col.hpp',['../sub__col_8hpp.html',1,'']]], + ['sub_5frow',['sub_row',['../namespacestan_1_1math.html#aa1ea780efd8d0282dbf069f0776d727b',1,'stan::math']]], + ['sub_5frow_2ehpp',['sub_row.hpp',['../sub__row_8hpp.html',1,'']]], + ['subarguments',['subarguments',['../classstan_1_1gm_1_1categorical__argument.html#a5ca383118480518414b2b5b52bc42dfb',1,'stan::gm::categorical_argument']]], + ['subject',['subject',['../structstan_1_1gm_1_1unary__op.html#a2030562bec45cd179d0087e2760e606f',1,'stan::gm::unary_op']]], + ['subtract',['subtract',['../namespacestan_1_1math.html#a90c28e884c638ed67fa0c81ffc01e2d3',1,'stan::math::subtract(const Eigen::Matrix< T1, R, C > &m1, const Eigen::Matrix< T2, R, C > &m2)'],['../namespacestan_1_1math.html#a36726c055970205db893867a77e9d0a7',1,'stan::math::subtract(const T1 &c, const Eigen::Matrix< T2, R, C > &m)'],['../namespacestan_1_1math.html#a776789f307db599fddcda6a68c480557',1,'stan::math::subtract(const Eigen::Matrix< T1, R, C > &m, const T2 &c)']]], + ['subtract_2ehpp',['subtract.hpp',['../subtract_8hpp.html',1,'']]], + ['subtraction',['subtraction',['../namespacestan_1_1gm.html#abd39613c1505c278ec7a2cdcc009bbcb',1,'stan::gm']]], + ['subtraction_5fexpr',['subtraction_expr',['../structstan_1_1gm_1_1subtraction__expr.html',1,'stan::gm']]], + ['success',['success',['../classstan_1_1math_1_1_l_d_l_t__factor_3_01stan_1_1agrad_1_1var_00_01_r_00_01_c_01_4.html#aa9e011b37205e0bfa198c9f032d19edb',1,'stan::math::LDLT_factor< stan::agrad::var, R, C >::success()'],['../classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4.html#a98215f2467d234354d398ec3e415dfce',1,'stan::math::LDLT_factor< double, R, C >::success()']]], + ['sum',['sum',['../classstan_1_1math_1_1accumulator.html#a289e9e869da8e29e78fa6c6c5bb9bddf',1,'stan::math::accumulator::sum()'],['../namespacestan_1_1agrad.html#a8baa11534c7cfb1b5e6f96bd958dfd03',1,'stan::agrad::sum(const Eigen::Matrix< fvar< T >, R, C > &m)'],['../namespacestan_1_1agrad.html#ad6c767cb7dcb4963f468cc5a2aa494ac',1,'stan::agrad::sum(const Eigen::Matrix< var, R, C > &m)'],['../namespacestan_1_1math.html#adde1fe0f002efa49cf9f7c129fe1a1d0',1,'stan::math::sum(std::vector< double > &x)'],['../namespacestan_1_1math.html#a1efee0b4f8879a114af50b7e9802745c',1,'stan::math::sum(const std::vector< T > &xs)'],['../namespacestan_1_1math.html#a44c32c2d7e895378feb11c99091765ad',1,'stan::math::sum(const Eigen::Matrix< T, R, C > &v)']]], + ['sum_2ehpp',['sum.hpp',['../agrad_2rev_2matrix_2sum_8hpp.html',1,'']]], + ['sum_2ehpp',['sum.hpp',['../math_2functions_2sum_8hpp.html',1,'']]], + ['sum_2ehpp',['sum.hpp',['../agrad_2fwd_2matrix_2sum_8hpp.html',1,'']]], + ['sum_2ehpp',['sum.hpp',['../math_2matrix_2sum_8hpp.html',1,'']]], + ['sum_5fprob',['sum_prob',['../structstan_1_1mcmc_1_1nuts__util.html#adf4917a8569f79ecd47cc4ebf443a102',1,'stan::mcmc::nuts_util']]], + ['suppress_5fwarning',['suppress_warning',['../namespacestan_1_1gm.html#a33ab69ad9d56b9d1c99d8808fd106648',1,'stan::gm']]] +]; diff --git a/doc/api/html/search/all_74.html b/doc/api/html/search/all_74.html new file mode 100644 index 00000000000..fdc6589d017 --- /dev/null +++ b/doc/api/html/search/all_74.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/all_74.js b/doc/api/html/search/all_74.js new file mode 100644 index 00000000000..0845860b4e4 --- /dev/null +++ b/doc/api/html/search/all_74.js @@ -0,0 +1,84 @@ +var searchData= +[ + ['t',['T',['../classstan_1_1mcmc_1_1base__hamiltonian.html#a4f3adba6ad80e9b538e57bd655362eee',1,'stan::mcmc::base_hamiltonian::T()'],['../classstan_1_1mcmc_1_1dense__e__metric.html#a02cdb81d16115734815790a5dc5e6c90',1,'stan::mcmc::dense_e_metric::T()'],['../classstan_1_1mcmc_1_1diag__e__metric.html#a0a6a65c2291eac1e13ee48f4ed61f636',1,'stan::mcmc::diag_e_metric::T()'],['../classstan_1_1mcmc_1_1unit__e__metric.html#ae924e01d719ba1ccbaca6daff56f762a',1,'stan::mcmc::unit_e_metric::T()']]], + ['t_5f',['T_',['../classstan_1_1mcmc_1_1base__static__hmc.html#affe6fd6d44fea89db4bc396cc7f64fa9',1,'stan::mcmc::base_static_hmc']]], + ['tail',['tail',['../namespacestan_1_1math.html#ac5b2770a97397fc738125d70420393fb',1,'stan::math::tail(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v, size_t n)'],['../namespacestan_1_1math.html#a7ae4ee69ace75bb2fb216247ab8272ec',1,'stan::math::tail(const Eigen::Matrix< T, 1, Eigen::Dynamic > &rv, size_t n)'],['../namespacestan_1_1math.html#a9956cf78180c6340f61667e797cf7055',1,'stan::math::tail(const std::vector< T > &sv, size_t n)']]], + ['tail_2ehpp',['tail.hpp',['../tail_8hpp.html',1,'']]], + ['tan',['tan',['../namespacestan_1_1agrad.html#adbc956463e3d58643e2a10dd3b6fd00c',1,'stan::agrad::tan(const var &a)'],['../namespacestan_1_1agrad.html#a48c6154fdb08d77249c5fa5216d34e2f',1,'stan::agrad::tan(const fvar< T > &x)']]], + ['tan_2ehpp',['tan.hpp',['../rev_2functions_2tan_8hpp.html',1,'']]], + ['tan_2ehpp',['tan.hpp',['../fwd_2functions_2tan_8hpp.html',1,'']]], + ['tangent',['tangent',['../structstan_1_1agrad_1_1fvar.html#aa9f2f0107f7a9e3d92de38b615d22dd6',1,'stan::agrad::fvar']]], + ['tanh',['tanh',['../namespacestan_1_1agrad.html#a9e4ae39cc622b5388d16b971616da01d',1,'stan::agrad::tanh(const var &a)'],['../namespacestan_1_1agrad.html#ae56147f3f502e8436c2a02ed7d275128',1,'stan::agrad::tanh(const fvar< T > &x)']]], + ['tanh_2ehpp',['tanh.hpp',['../rev_2functions_2tanh_8hpp.html',1,'']]], + ['tanh_2ehpp',['tanh.hpp',['../fwd_2functions_2tanh_8hpp.html',1,'']]], + ['tau',['tau',['../classstan_1_1mcmc_1_1base__hamiltonian.html#a12c9833e59b1aa7455872ebffe0819ce',1,'stan::mcmc::base_hamiltonian::tau()'],['../classstan_1_1mcmc_1_1dense__e__metric.html#a80d1467817d80ee50aca96b4f5b85146',1,'stan::mcmc::dense_e_metric::tau()'],['../classstan_1_1mcmc_1_1diag__e__metric.html#ad8b4d7e8c1cdfb0b98520bc6b6b3c5a2',1,'stan::mcmc::diag_e_metric::tau()'],['../classstan_1_1mcmc_1_1unit__e__metric.html#a428fcc506d11bfc227125153ef3e87d4',1,'stan::mcmc::unit_e_metric::tau()']]], + ['tcrossprod',['tcrossprod',['../namespacestan_1_1agrad.html#afe68149651e5bbdab5c531bc82b0868e',1,'stan::agrad::tcrossprod(const Eigen::Matrix< fvar< T >, R, C > &m)'],['../namespacestan_1_1agrad.html#a756be37f5934ada1e12abec937e3d13b',1,'stan::agrad::tcrossprod(const matrix_v &M)'],['../namespacestan_1_1math.html#a16b07b3f7d18cdb710806c5793a83d31',1,'stan::math::tcrossprod()']]], + ['tcrossprod_2ehpp',['tcrossprod.hpp',['../agrad_2fwd_2matrix_2tcrossprod_8hpp.html',1,'']]], + ['tcrossprod_2ehpp',['tcrossprod.hpp',['../agrad_2rev_2matrix_2tcrossprod_8hpp.html',1,'']]], + ['tcrossprod_2ehpp',['tcrossprod.hpp',['../math_2matrix_2tcrossprod_8hpp.html',1,'']]], + ['term_5fg',['term_g',['../structstan_1_1gm_1_1expression__grammar.html#af321c7c9134b2e63ebdf52245d0358c5',1,'stan::gm::expression_grammar']]], + ['term_5fgrammar',['term_grammar',['../structterm__grammar.html',1,'term_grammar< Iterator >'],['../structterm__grammar.html',1,'term_grammar< Iterator >'],['../structstan_1_1gm_1_1term__grammar.html#a190b57b393dca19c78dbe5e8e88d4cba',1,'stan::gm::term_grammar::term_grammar()']]], + ['term_5fgrammar',['term_grammar',['../structstan_1_1gm_1_1term__grammar.html',1,'stan::gm']]], + ['term_5fgrammar_2ehpp',['term_grammar.hpp',['../term__grammar_8hpp.html',1,'']]], + ['term_5fgrammar_5fdef_2ehpp',['term_grammar_def.hpp',['../term__grammar__def_8hpp.html',1,'']]], + ['term_5fgrammar_5finst_2ecpp',['term_grammar_inst.cpp',['../term__grammar__inst_8cpp.html',1,'']]], + ['term_5fr',['term_r',['../structstan_1_1gm_1_1term__grammar.html#a2e84fd310e862d276ac7ea3f2b4b0ee3',1,'stan::gm::term_grammar']]], + ['test_5fgradients',['test_gradients',['../namespacestan_1_1model.html#a53b2d650c95140811fa1dee58bdfb0c4',1,'stan::model']]], + ['tgamma',['tgamma',['../namespacestan_1_1agrad.html#a1a5ceb1f1202bd9c910bb9a447ea12a4',1,'stan::agrad::tgamma(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#ad3efbbe0949604d6a169864776508b5d',1,'stan::agrad::tgamma(const stan::agrad::var &a)']]], + ['tgamma_2ehpp',['tgamma.hpp',['../rev_2functions_2tgamma_8hpp.html',1,'']]], + ['tgamma_2ehpp',['tgamma.hpp',['../fwd_2functions_2tgamma_8hpp.html',1,'']]], + ['thin',['thin',['../structstan_1_1io_1_1stan__csv__metadata.html#afe9c15f7c7e774a40f83e3a7f24e4279',1,'stan::io::stan_csv_metadata']]], + ['timing',['timing',['../structstan_1_1io_1_1stan__csv.html#aeac96bfaa43c3d99db3972b6407394d7',1,'stan::io::stan_csv']]], + ['tinyness_5fbefore',['tinyness_before',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a96cfd06162e299fdd889f865df8f88ec',1,'std::numeric_limits< stan::agrad::fvar< T > >::tinyness_before()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a9dd41511966171dd188b4bb1f65b5911',1,'std::numeric_limits< stan::agrad::var >::tinyness_before()']]], + ['to_5ffvar',['to_fvar',['../namespacestan_1_1agrad.html#afd6883af022a54c60dd207c733917425',1,'stan::agrad::to_fvar(const T &x)'],['../namespacestan_1_1agrad.html#a88f3f805d72a977a680135249341f0e6',1,'stan::agrad::to_fvar(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#a6a028d6aadad12e84b3a7a587458313d',1,'stan::agrad::to_fvar(const stan::math::matrix_d &m)'],['../namespacestan_1_1agrad.html#ab901750d171a340d359d4366ce18e920',1,'stan::agrad::to_fvar(const matrix_fd &m)'],['../namespacestan_1_1agrad.html#a8bf93f28ef32c8a01acee60bf3a86953',1,'stan::agrad::to_fvar(const matrix_fv &m)'],['../namespacestan_1_1agrad.html#ac33cf85a99591eab48c23e6243935827',1,'stan::agrad::to_fvar(const matrix_ffd &m)'],['../namespacestan_1_1agrad.html#aa5f13b4aac2e833fbc550adf15bbb89c',1,'stan::agrad::to_fvar(const matrix_ffv &m)'],['../namespacestan_1_1agrad.html#acb1b51857662ff7aceb7bf33e977fda2',1,'stan::agrad::to_fvar(const stan::math::vector_d &v)'],['../namespacestan_1_1agrad.html#ac5b829ba1d8c567a4ddc153e8e8deb28',1,'stan::agrad::to_fvar(const vector_fd &v)'],['../namespacestan_1_1agrad.html#af5034319341d60121260723636478ac1',1,'stan::agrad::to_fvar(const vector_fv &v)'],['../namespacestan_1_1agrad.html#af5fbf0e0b0386b87379bb330e9a97a3e',1,'stan::agrad::to_fvar(const vector_ffd &v)'],['../namespacestan_1_1agrad.html#ab7ee85577850baf2a033d4bcfb1bf630',1,'stan::agrad::to_fvar(const vector_ffv &v)'],['../namespacestan_1_1agrad.html#a795793505477543f5c1138585049d597',1,'stan::agrad::to_fvar(const stan::math::row_vector_d &rv)'],['../namespacestan_1_1agrad.html#a2f32b3cb37dc324f9dc3566aaf516a28',1,'stan::agrad::to_fvar(const row_vector_fd &rv)'],['../namespacestan_1_1agrad.html#accbd0fa22f2dc7ae894380a09ad2bccb',1,'stan::agrad::to_fvar(const row_vector_fv &rv)'],['../namespacestan_1_1agrad.html#af95bfe51597f252ca2d110f4cd6bc553',1,'stan::agrad::to_fvar(const row_vector_ffd &rv)'],['../namespacestan_1_1agrad.html#a6ec009827c7274b73a0a5dbdac33d2e0',1,'stan::agrad::to_fvar(const row_vector_ffv &rv)'],['../namespacestan_1_1agrad.html#aefe945fec82fc902015d82c4363e3adc',1,'stan::agrad::to_fvar(const Eigen::Matrix< T, R, C > &val, const Eigen::Matrix< T, R, C > &deriv)']]], + ['to_5ffvar_2ehpp',['to_fvar.hpp',['../to__fvar_8hpp.html',1,'']]], + ['to_5fstring',['to_string',['../namespacestan_1_1gm.html#abd7966e0ee430a0e4e12326fd9cd762f',1,'stan::gm']]], + ['to_5fvar',['to_var',['../structstan_1_1agrad_1_1_operands_and_partials.html#a8d193a68235f335ad3ee7dc9fd130094',1,'stan::agrad::OperandsAndPartials::to_var()'],['../namespacestan_1_1agrad.html#a29fd7db9833fa17e3ff54709c13bba7e',1,'stan::agrad::to_var(const double &x)'],['../namespacestan_1_1agrad.html#a7d1c1c2fdd2ac909cde84c4cf3ae0b97',1,'stan::agrad::to_var(const var &x)'],['../namespacestan_1_1agrad.html#a3a13a3857bc425dab978636de428a7cf',1,'stan::agrad::to_var(const stan::math::matrix_d &m)'],['../namespacestan_1_1agrad.html#affc9f72e4afab7464103565795be6b5a',1,'stan::agrad::to_var(const matrix_v &m)'],['../namespacestan_1_1agrad.html#a87949ec636f056e2ed3956675ab2cfd1',1,'stan::agrad::to_var(const stan::math::vector_d &v)'],['../namespacestan_1_1agrad.html#a5ccc4666fffc6f06b1fcae217ea7b9a5',1,'stan::agrad::to_var(const vector_v &v)'],['../namespacestan_1_1agrad.html#a27974665dae3441df744285776390314',1,'stan::agrad::to_var(const stan::math::row_vector_d &rv)'],['../namespacestan_1_1agrad.html#a3f723b593d96af7f204e0f138ee49ec3',1,'stan::agrad::to_var(const row_vector_v &rv)']]], + ['to_5fvar_2ehpp',['to_var.hpp',['../to__var_8hpp.html',1,'']]], + ['to_5fvec',['to_vec',['../classstan_1_1io_1_1var__context.html#a4dead4b7dda5bc87bbc73f95fbc5cc14',1,'stan::io::var_context::to_vec()'],['../classstan_1_1io_1_1var__context.html#ae127d4a7b16d0584a1fc352715f9496f',1,'stan::io::var_context::to_vec(size_t n1)'],['../classstan_1_1io_1_1var__context.html#a6476d396377cd81c55b2870585ae6b80',1,'stan::io::var_context::to_vec(size_t n1, size_t n2)'],['../classstan_1_1io_1_1var__context.html#ae14b5a7e54016763fc3ab8f29d98b7ed',1,'stan::io::var_context::to_vec(size_t n1, size_t n2, size_t n3)'],['../classstan_1_1io_1_1var__context.html#a936afdc0abaf478ad05baaa9e5c899ed',1,'stan::io::var_context::to_vec(size_t n1, size_t n2, size_t n3, size_t n4)'],['../classstan_1_1io_1_1var__context.html#a5592642ebe6a9ec30cdc97c05e025456',1,'stan::io::var_context::to_vec(size_t n1, size_t n2, size_t n3, size_t n4, size_t n5)'],['../classstan_1_1io_1_1var__context.html#a16f365bd3c63c030a9fb7ef48f0b53a6',1,'stan::io::var_context::to_vec(size_t n1, size_t n2, size_t n3, size_t n4, size_t n5, size_t n6)'],['../classstan_1_1io_1_1var__context.html#a7c9a822c3aeb4f3d49dbd0ce509be573',1,'stan::io::var_context::to_vec(size_t n1, size_t n2, size_t n3, size_t n4, size_t n5, size_t n6, size_t n7)'],['../classstan_1_1io_1_1var__context.html#aab65fbc55030028781f4060cf8dba8b8',1,'stan::io::var_context::to_vec(size_t n1, size_t n2, size_t n3, size_t n4, size_t n5, size_t n6, size_t n7, size_t n8)']]], + ['to_5fvector',['to_vector',['../namespacestan_1_1math.html#a2576c9799bbb676b1b2d930be8032b8c',1,'stan::math']]], + ['to_5fvector_2ehpp',['to_vector.hpp',['../to__vector_8hpp.html',1,'']]], + ['tolf',['tolF',['../structstan_1_1optimization_1_1_b_f_g_s_minimizer_1_1_b_f_g_s_options.html#ab0aa0121e1acca46338f9e25e9650192',1,'stan::optimization::BFGSMinimizer::BFGSOptions']]], + ['tolgrad',['tolGrad',['../structstan_1_1optimization_1_1_b_f_g_s_minimizer_1_1_b_f_g_s_options.html#aa459b03a3adde843c5bb742bc73ac55a',1,'stan::optimization::BFGSMinimizer::BFGSOptions']]], + ['tolx',['tolX',['../structstan_1_1optimization_1_1_b_f_g_s_minimizer_1_1_b_f_g_s_options.html#a0aec50286d347f1a64bf344f36088771',1,'stan::optimization::BFGSMinimizer::BFGSOptions']]], + ['total_5fdims',['total_dims',['../namespacestan_1_1gm.html#a0888f90c4bb279ad09b9f7724912a2cd',1,'stan::gm']]], + ['trace',['trace',['../namespacestan_1_1math.html#a7001fd7e0296d5dae6ab0a88e1a28547',1,'stan::math']]], + ['trace_2ehpp',['trace.hpp',['../trace_8hpp.html',1,'']]], + ['trace_5fgen_5fquad_5fform',['trace_gen_quad_form',['../namespacestan_1_1agrad.html#ad63e47021cd7aa676fe91db80092997e',1,'stan::agrad::trace_gen_quad_form()'],['../namespacestan_1_1math.html#a09d402800ee27ba77d03dc3ec365d22e',1,'stan::math::trace_gen_quad_form()']]], + ['trace_5fgen_5fquad_5fform_2ehpp',['trace_gen_quad_form.hpp',['../math_2matrix_2trace__gen__quad__form_8hpp.html',1,'']]], + ['trace_5fgen_5fquad_5fform_2ehpp',['trace_gen_quad_form.hpp',['../agrad_2rev_2matrix_2trace__gen__quad__form_8hpp.html',1,'']]], + ['trace_5finv_5fquad_5fform_5fldlt',['trace_inv_quad_form_ldlt',['../namespacestan_1_1agrad.html#a2fbca76427b2713b14f3445b3b5285c8',1,'stan::agrad::trace_inv_quad_form_ldlt(const Eigen::Matrix< T1, R1, C1 > &D, const stan::math::LDLT_factor< T2, R2, C2 > &A, const Eigen::Matrix< T3, R3, C3 > &B)'],['../namespacestan_1_1agrad.html#a9e9f878f6533c815e81193669c47a4f1',1,'stan::agrad::trace_inv_quad_form_ldlt(const stan::math::LDLT_factor< T2, R2, C2 > &A, const Eigen::Matrix< T3, R3, C3 > &B)'],['../namespacestan_1_1math.html#aab8b4d4ddbcb7df66d3baf8394318e1e',1,'stan::math::trace_inv_quad_form_ldlt(const Eigen::Matrix< double, R1, C1 > &D, const stan::math::LDLT_factor< double, R2, C2 > &A, const Eigen::Matrix< double, R3, C3 > &B)'],['../namespacestan_1_1math.html#aa0261f49dc318d8ee553e378325ee3db',1,'stan::math::trace_inv_quad_form_ldlt(const stan::math::LDLT_factor< double, R2, C2 > &A, const Eigen::Matrix< double, R3, C3 > &B)']]], + ['trace_5fquad_5fform',['trace_quad_form',['../namespacestan_1_1agrad.html#a0d688dadede814a9e3f2a3b6af6601c5',1,'stan::agrad::trace_quad_form()'],['../namespacestan_1_1math.html#a097af33142548fd565d1dab2233fa3e5',1,'stan::math::trace_quad_form()']]], + ['trace_5fquad_5fform_2ehpp',['trace_quad_form.hpp',['../agrad_2rev_2matrix_2trace__quad__form_8hpp.html',1,'']]], + ['trace_5fquad_5fform_2ehpp',['trace_quad_form.hpp',['../math_2matrix_2trace__quad__form_8hpp.html',1,'']]], + ['traits_2ehpp',['traits.hpp',['../prob_2traits_8hpp.html',1,'']]], + ['traits_2ehpp',['traits.hpp',['../meta_2traits_8hpp.html',1,'']]], + ['transform_2ehpp',['transform.hpp',['../transform_8hpp.html',1,'']]], + ['transformed_5fdata_5forigin',['transformed_data_origin',['../namespacestan_1_1gm.html#a8badb02edbcc98351299f2b1a0f23740',1,'stan::gm']]], + ['transformed_5fparameter_5forigin',['transformed_parameter_origin',['../namespacestan_1_1gm.html#acd24a39b6850fab486aa1ab63d45d537',1,'stan::gm']]], + ['transition',['transition',['../classstan_1_1mcmc_1_1base__mcmc.html#acb8c38a588d49495a6dc2bb22d3eb435',1,'stan::mcmc::base_mcmc::transition()'],['../classstan_1_1mcmc_1_1adapt__dense__e__nuts.html#a18ea2702c10597236f0ea359f251c9f5',1,'stan::mcmc::adapt_dense_e_nuts::transition()'],['../classstan_1_1mcmc_1_1adapt__diag__e__nuts.html#ab1732e3ce940a436110a7cf8a0f17aac',1,'stan::mcmc::adapt_diag_e_nuts::transition()'],['../classstan_1_1mcmc_1_1adapt__unit__e__nuts.html#ad1130b322d697d62f7d8d3fbef6ee17f',1,'stan::mcmc::adapt_unit_e_nuts::transition()'],['../classstan_1_1mcmc_1_1base__nuts.html#aceabaf9d1acdf64b0d084e354ede9564',1,'stan::mcmc::base_nuts::transition()'],['../classstan_1_1mcmc_1_1adapt__dense__e__static__hmc.html#a406a335276134a2f86fa3e4c24925e4f',1,'stan::mcmc::adapt_dense_e_static_hmc::transition()'],['../classstan_1_1mcmc_1_1adapt__diag__e__static__hmc.html#a1dfaa6a5fe56df79856bc2f3789e9895',1,'stan::mcmc::adapt_diag_e_static_hmc::transition()'],['../classstan_1_1mcmc_1_1adapt__unit__e__static__hmc.html#a7db6fa5aedf5f35ceadca297f28f9914',1,'stan::mcmc::adapt_unit_e_static_hmc::transition()'],['../classstan_1_1mcmc_1_1base__static__hmc.html#aad1ceb75b092cdefe079b2c81275f501',1,'stan::mcmc::base_static_hmc::transition()']]], + ['transpose',['transpose',['../namespacestan_1_1math.html#a9db6bf273b69e20dc12e0c348b928296',1,'stan::math']]], + ['transpose_2ehpp',['transpose.hpp',['../transpose_8hpp.html',1,'']]], + ['transpose_5fexpr',['transpose_expr',['../structstan_1_1gm_1_1transpose__expr.html',1,'stan::gm']]], + ['transpose_5ff',['transpose_f',['../namespacestan_1_1gm.html#a7f4d79c4779b3252cb5d22ce80c79d98',1,'stan::gm']]], + ['traps',['traps',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a5bc84afce7db610312123c95a0f893f7',1,'std::numeric_limits< stan::agrad::fvar< T > >::traps()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a9bf9a84401ae310d4855a7d5b483fa34',1,'std::numeric_limits< stan::agrad::var >::traps()']]], + ['trigamma',['trigamma',['../namespacestan_1_1math.html#ab18c21bad37c9af26424d0922936355e',1,'stan::math']]], + ['trigamma_2ehpp',['trigamma.hpp',['../trigamma_8hpp.html',1,'']]], + ['trunc',['trunc',['../namespacestan_1_1agrad.html#aea02c702f338cc531cdb7b6e11344b34',1,'stan::agrad::trunc(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#af5cde78a4f7b7ee45f8f98c75343174e',1,'stan::agrad::trunc(const stan::agrad::var &a)']]], + ['trunc_2ehpp',['trunc.hpp',['../rev_2functions_2trunc_8hpp.html',1,'']]], + ['trunc_2ehpp',['trunc.hpp',['../fwd_2functions_2trunc_8hpp.html',1,'']]], + ['truncation_5f',['truncation_',['../structstan_1_1gm_1_1sample.html#a5e796a4be6bef910fcad25dfbc8ca3b6',1,'stan::gm::sample']]], + ['truncation_5frange_5fr',['truncation_range_r',['../structstan_1_1gm_1_1statement__grammar.html#a1fc065c2e3cd518346178e31b84f713c',1,'stan::gm::statement_grammar']]], + ['two_5fover_5fsqrt_5fpi',['TWO_OVER_SQRT_PI',['../namespacestan_1_1math.html#a935530f53a026ebb80fcd9006059e9c8',1,'stan::math']]], + ['type',['type',['../structstan_1_1gm_1_1validate__expr__type2_1_1result.html#acf9da899e777ac9cfb14f120a5a4e6e7',1,'stan::gm::validate_expr_type2::result::type()'],['../structstan_1_1gm_1_1set__fun__type2_1_1result.html#a797bb1fd338a65fa9377535addd51aa2',1,'stan::gm::set_fun_type2::result::type()'],['../structstan_1_1gm_1_1binary__op__expr_1_1result.html#a6613b3bbad33fe2edf7b1337ff10c4ab',1,'stan::gm::binary_op_expr::result::type()'],['../structstan_1_1gm_1_1addition__expr_1_1result.html#abbb7eba785d1bf2b37be6983c21abde2',1,'stan::gm::addition_expr::result::type()'],['../structstan_1_1gm_1_1subtraction__expr_1_1result.html#a83d53c7bf088539887e8d349745dbbd3',1,'stan::gm::subtraction_expr::result::type()'],['../structstan_1_1gm_1_1add__conditional__condition_1_1result.html#a7ae524581e60adf8ec58ff362d123b04',1,'stan::gm::add_conditional_condition::result::type()'],['../structstan_1_1gm_1_1add__conditional__body_1_1result.html#af12e1aa0082754acf1218bd767b65f97',1,'stan::gm::add_conditional_body::result::type()'],['../structstan_1_1gm_1_1validate__assignment_1_1result.html#a8ed777fd03014c406553a98a2092d597',1,'stan::gm::validate_assignment::result::type()'],['../structstan_1_1gm_1_1validate__sample_1_1result.html#ad554b4aaf143a4c535708ac7ee56a12f',1,'stan::gm::validate_sample::result::type()'],['../structstan_1_1gm_1_1expression__as__statement_1_1result.html#aa817fc2a2eab202b696d81dc5054a233',1,'stan::gm::expression_as_statement::result::type()'],['../structstan_1_1gm_1_1unscope__locals_1_1result.html#a78057309e7356062ee1abf3978fb75ad',1,'stan::gm::unscope_locals::result::type()'],['../structstan_1_1gm_1_1add__while__condition_1_1result.html#a3355eac5ec601747e940106ca5a9553c',1,'stan::gm::add_while_condition::result::type()'],['../structstan_1_1gm_1_1add__while__body_1_1result.html#a14b5d10c7fd59660a6d9070f2adb50a0',1,'stan::gm::add_while_body::result::type()'],['../structstan_1_1gm_1_1add__loop__identifier_1_1result.html#ad8cb4be555a262642d21fbca93669692',1,'stan::gm::add_loop_identifier::result::type()'],['../structstan_1_1gm_1_1remove__loop__identifier_1_1result.html#a651b017053ea891677678fd434ae2b6a',1,'stan::gm::remove_loop_identifier::result::type()'],['../structstan_1_1gm_1_1validate__int__expr2_1_1result.html#ac09fa987115620b2b268f7050ea2b53c',1,'stan::gm::validate_int_expr2::result::type()'],['../structstan_1_1gm_1_1validate__allow__sample_1_1result.html#a35e630d24e687699327b33e071c2a993',1,'stan::gm::validate_allow_sample::result::type()'],['../structstan_1_1gm_1_1set__fun__type_1_1result.html#a8a3b4372dd614aed3ed3e683a9e93cea',1,'stan::gm::set_fun_type::result::type()'],['../structstan_1_1gm_1_1set__fun__type__named_1_1result.html#af8b27e490e0b8ddeaba4c65ee5dff707',1,'stan::gm::set_fun_type_named::result::type()'],['../structstan_1_1gm_1_1multiplication__expr_1_1result.html#a0ab75c7570d913a4a3122048e092b76a',1,'stan::gm::multiplication_expr::result::type()'],['../structstan_1_1gm_1_1division__expr_1_1result.html#a18185a370c691f1eea0847551e78ed83',1,'stan::gm::division_expr::result::type()'],['../structstan_1_1gm_1_1left__division__expr_1_1result.html#ae7eade30901e506aca5bd0b4a7296595',1,'stan::gm::left_division_expr::result::type()'],['../structstan_1_1gm_1_1elt__multiplication__expr_1_1result.html#acd68e9b5d774c889c1064e1350495620',1,'stan::gm::elt_multiplication_expr::result::type()'],['../structstan_1_1gm_1_1elt__division__expr_1_1result.html#a96008a34740a7ff158716517993aa6f0',1,'stan::gm::elt_division_expr::result::type()'],['../structstan_1_1gm_1_1negate__expr_1_1result.html#ae3983d7993aa29e8d6c9b488dcde6312',1,'stan::gm::negate_expr::result::type()'],['../structstan_1_1gm_1_1logical__negate__expr_1_1result.html#a4f04e5a391864ce1cd4e295b38800aa9',1,'stan::gm::logical_negate_expr::result::type()'],['../structstan_1_1gm_1_1transpose__expr_1_1result.html#a46200139ae3022913240e7afb1e1a98f',1,'stan::gm::transpose_expr::result::type()'],['../structstan_1_1gm_1_1add__expression__dimss_1_1result.html#ac7ba6f938007515f8585e7f3edfa17fd',1,'stan::gm::add_expression_dimss::result::type()'],['../structstan_1_1gm_1_1set__var__type_1_1result.html#ab76768683b619416b7df951add24cf65',1,'stan::gm::set_var_type::result::type()'],['../structstan_1_1gm_1_1validate__int__expr3_1_1result.html#a3561c5435c7ea45b40819bb2937b792d',1,'stan::gm::validate_int_expr3::result::type()'],['../structstan_1_1gm_1_1validate__expr__type_1_1result.html#a27afcd81cf29e2a4e3cd1456a9580998',1,'stan::gm::validate_expr_type::result::type()'],['../structstan_1_1math_1_1common__type.html#aab77e3179df5479c1531afad8687a83f',1,'stan::math::common_type::type()'],['../structstan_1_1math_1_1common__type_3_01std_1_1vector_3_01_t1_01_4_00_01std_1_1vector_3_01_t2_01_4_01_4.html#a57e2603ca0216acd5592ebbd45aee70d',1,'stan::math::common_type< std::vector< T1 >, std::vector< T2 > >::type()'],['../structstan_1_1math_1_1common__type_3_01_eigen_1_1_matrix_3_01_t1_00_01_r_00_01_c_01_4_00_01_eiged8accfa00e73f240c58ad02ac582ba93.html#a233e6e69eead8714ccd05f2c49c0d56d',1,'stan::math::common_type< Eigen::Matrix< T1, R, C >, Eigen::Matrix< T2, R, C > >::type()'],['../structstan_1_1math_1_1store__type.html#a4911dad4e7692aae90f6a93466a3e88b',1,'stan::math::store_type::type()'],['../structstan_1_1math_1_1store__type_3_01double_01_4.html#a36449fc098f0ee60b5e078771f5395e8',1,'stan::math::store_type< double >::type()'],['../structstan_1_1math_1_1store__type_3_01int_01_4.html#aa10e456268690936392e9ea31e24645f',1,'stan::math::store_type< int >::type()'],['../structstan_1_1math_1_1pass__type.html#aaf902ad0b26acab6888195ed0b528ec5',1,'stan::math::pass_type::type()'],['../structstan_1_1math_1_1pass__type_3_01double_01_4.html#adee94e36436cf8e5628e961330047738',1,'stan::math::pass_type< double >::type()'],['../structstan_1_1math_1_1pass__type_3_01int_01_4.html#a6e1bfc775f016451ab261ecede07402c',1,'stan::math::pass_type< int >::type()'],['../structstan_1_1is__vector.html#a5384dc7751d6efdfd7b7bd9ccc442ca2',1,'stan::is_vector::type()'],['../structstan_1_1is__vector_3_01const_01_t_01_4.html#a438013ddac03fc30456a132b069b6db7',1,'stan::is_vector< const T >::type()'],['../structstan_1_1is__vector_3_01std_1_1vector_3_01_t_01_4_01_4.html#aefecb429647f6ad44faa02cb233050da',1,'stan::is_vector< std::vector< T > >::type()'],['../structstan_1_1is__vector_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_011_01_4_01_4.html#ab0c2ebfaeaf2d18b25665573a01dab1e',1,'stan::is_vector< Eigen::Matrix< T, Eigen::Dynamic, 1 > >::type()'],['../structstan_1_1is__vector_3_01_eigen_1_1_matrix_3_01_t_00_011_00_01_eigen_1_1_dynamic_01_4_01_4.html#a07a4e818504882fb191b9d3a5ba6677a',1,'stan::is_vector< Eigen::Matrix< T, 1, Eigen::Dynamic > >::type()'],['../structstan_1_1scalar__type.html#aa9068e42d81d7091f822df126fe932b7',1,'stan::scalar_type::type()'],['../structstan_1_1scalar__type_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4.html#a3cbf7ba7c3d16da948863b3180075b36',1,'stan::scalar_type< Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > >::type()'],['../structstan_1_1scalar__type_3_01_t_01_5_01_4.html#a38f00242ece28298968a43f30508c940',1,'stan::scalar_type< T * >::type()'],['../structstan_1_1return__type.html#af3130731cc471801ccef3bc753dd790b',1,'stan::return_type::type()'],['../structstan_1_1gm_1_1expr__type.html#adb52e22aa9f56f528c4a5305ae562364',1,'stan::gm::expr_type::type()']]], + ['type_5f',['type_',['../structstan_1_1gm_1_1int__literal.html#a72e3ed5537084bf3ff324105cce4b457',1,'stan::gm::int_literal::type_()'],['../structstan_1_1gm_1_1double__literal.html#ae571ef14f106d406302e3fe0ac9bd204',1,'stan::gm::double_literal::type_()'],['../structstan_1_1gm_1_1array__literal.html#a722c9507094a61e528cb017ed6abaac0',1,'stan::gm::array_literal::type_()'],['../structstan_1_1gm_1_1variable.html#a6ff634fb68f6f6f51fe4e014a2d1dae0',1,'stan::gm::variable::type_()'],['../structstan_1_1gm_1_1fun.html#adff7eb341e34851eda4f8c38ce9c001a',1,'stan::gm::fun::type_()'],['../structstan_1_1gm_1_1index__op.html#ada5fa6fc111a5c01cdcb4bfd34cef545',1,'stan::gm::index_op::type_()'],['../structstan_1_1gm_1_1binary__op.html#a4b1a2844ace11d2be56ad75ea416a0dd',1,'stan::gm::binary_op::type_()'],['../structstan_1_1gm_1_1unary__op.html#a4963df25da0d8fd9a8697b6bc3573846',1,'stan::gm::unary_op::type_()']]], + ['type_5fname',['type_name',['../structstan_1_1gm_1_1type__name.html',1,'stan::gm']]], + ['type_5fname_3c_20bool_20_3e',['type_name< bool >',['../structstan_1_1gm_1_1type__name_3_01bool_01_4.html',1,'stan::gm']]], + ['type_5fname_3c_20double_20_3e',['type_name< double >',['../structstan_1_1gm_1_1type__name_3_01double_01_4.html',1,'stan::gm']]], + ['type_5fname_3c_20int_20_3e',['type_name< int >',['../structstan_1_1gm_1_1type__name_3_01int_01_4.html',1,'stan::gm']]], + ['type_5fname_3c_20std_3a_3astring_20_3e',['type_name< std::string >',['../structstan_1_1gm_1_1type__name_3_01std_1_1string_01_4.html',1,'stan::gm']]], + ['type_5fname_3c_20unsigned_20int_20_3e',['type_name< unsigned int >',['../structstan_1_1gm_1_1type__name_3_01unsigned_01int_01_4.html',1,'stan::gm']]], + ['typedefs_2ehpp',['typedefs.hpp',['../agrad_2rev_2matrix_2typedefs_8hpp.html',1,'']]], + ['typedefs_2ehpp',['typedefs.hpp',['../agrad_2fwd_2matrix_2typedefs_8hpp.html',1,'']]], + ['typedefs_2ehpp',['typedefs.hpp',['../math_2matrix_2typedefs_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/all_75.html b/doc/api/html/search/all_75.html new file mode 100644 index 00000000000..ab8455ed502 --- /dev/null +++ b/doc/api/html/search/all_75.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/all_75.js b/doc/api/html/search/all_75.js new file mode 100644 index 00000000000..6d7a11ee919 --- /dev/null +++ b/doc/api/html/search/all_75.js @@ -0,0 +1,48 @@ +var searchData= +[ + ['u_5fint_5fargument',['u_int_argument',['../namespacestan_1_1gm.html#ae43d445dc26f5d0423f77c37236d3b38',1,'stan::gm']]], + ['ub_5fconstrain',['ub_constrain',['../namespacestan_1_1prob.html#a3cc62d5f301ccbb23e1e97231d736c4c',1,'stan::prob::ub_constrain(const T x, const TU ub)'],['../namespacestan_1_1prob.html#ac41afc3f7ad3b927d352383d4a8dea7f',1,'stan::prob::ub_constrain(const T x, const TU ub, T &lp)']]], + ['ub_5ffree',['ub_free',['../namespacestan_1_1prob.html#aa0fbf5448b5fdc2510256bbc73cc9b49',1,'stan::prob']]], + ['unary_5fop',['unary_op',['../structstan_1_1gm_1_1unary__op.html#a98e5a64686af8cefd3293e1925c2a3b1',1,'stan::gm::unary_op']]], + ['unary_5fop',['unary_op',['../structstan_1_1gm_1_1unary__op.html',1,'stan::gm']]], + ['unconstrained_5fparam_5fnames_5fvisgen',['unconstrained_param_names_visgen',['../structstan_1_1gm_1_1unconstrained__param__names__visgen.html',1,'stan::gm']]], + ['unconstrained_5fparam_5fnames_5fvisgen',['unconstrained_param_names_visgen',['../structstan_1_1gm_1_1unconstrained__param__names__visgen.html#a0fe661e868b54bff65d31a93d2c9e86e',1,'stan::gm::unconstrained_param_names_visgen']]], + ['uniform_2ehpp',['uniform.hpp',['../uniform_8hpp.html',1,'']]], + ['uniform_5fccdf_5flog',['uniform_ccdf_log',['../namespacestan_1_1prob.html#ab524f79f1c0a3d5f97b1e481b21f1736',1,'stan::prob']]], + ['uniform_5fcdf',['uniform_cdf',['../namespacestan_1_1prob.html#a2540292f80682fd8971fcf9b5c0b35b1',1,'stan::prob']]], + ['uniform_5fcdf_5flog',['uniform_cdf_log',['../namespacestan_1_1prob.html#a05dfe81e20c266f06cc111b1571edb4d',1,'stan::prob']]], + ['uniform_5flog',['uniform_log',['../namespacestan_1_1prob.html#a20f9e437a772626e4e6aac94f58f60fa',1,'stan::prob::uniform_log(const T_y &y, const T_low &alpha, const T_high &beta)'],['../namespacestan_1_1prob.html#a520f558845310e1de1e8692a8ac5ab23',1,'stan::prob::uniform_log(const T_y &y, const T_low &alpha, const T_high &beta)']]], + ['uniform_5frng',['uniform_rng',['../namespacestan_1_1prob.html#ab9c29e62027123e900b55f29170e2426',1,'stan::prob']]], + ['unit_5fe_5fmetric',['unit_e_metric',['../classstan_1_1mcmc_1_1unit__e__metric.html#acdbee1cba43deae117af1312703ab2b4',1,'stan::mcmc::unit_e_metric']]], + ['unit_5fe_5fmetric',['unit_e_metric',['../classstan_1_1mcmc_1_1unit__e__metric.html',1,'stan::mcmc']]], + ['unit_5fe_5fmetric_2ehpp',['unit_e_metric.hpp',['../unit__e__metric_8hpp.html',1,'']]], + ['unit_5fe_5fnuts',['unit_e_nuts',['../classstan_1_1mcmc_1_1unit__e__nuts.html',1,'stan::mcmc']]], + ['unit_5fe_5fnuts',['unit_e_nuts',['../classstan_1_1mcmc_1_1unit__e__nuts.html#a0e74025d0c07dee2edc39b43d6fa85be',1,'stan::mcmc::unit_e_nuts']]], + ['unit_5fe_5fnuts_2ehpp',['unit_e_nuts.hpp',['../unit__e__nuts_8hpp.html',1,'']]], + ['unit_5fe_5fpoint',['unit_e_point',['../classstan_1_1mcmc_1_1unit__e__point.html',1,'stan::mcmc']]], + ['unit_5fe_5fpoint',['unit_e_point',['../classstan_1_1mcmc_1_1unit__e__point.html#a8ab0ffea3990bf0b8cdb289e1f7327ef',1,'stan::mcmc::unit_e_point']]], + ['unit_5fe_5fpoint_2ehpp',['unit_e_point.hpp',['../unit__e__point_8hpp.html',1,'']]], + ['unit_5fe_5fstatic_5fhmc',['unit_e_static_hmc',['../classstan_1_1mcmc_1_1unit__e__static__hmc.html#aa3f18e181e9b27bc487ec48af5ddd9c1',1,'stan::mcmc::unit_e_static_hmc']]], + ['unit_5fe_5fstatic_5fhmc',['unit_e_static_hmc',['../classstan_1_1mcmc_1_1unit__e__static__hmc.html',1,'stan::mcmc']]], + ['unit_5fe_5fstatic_5fhmc_2ehpp',['unit_e_static_hmc.hpp',['../unit__e__static__hmc_8hpp.html',1,'']]], + ['unit_5fvector',['unit_vector',['../classstan_1_1io_1_1reader.html#a6b8ebf459013095c8bef590c5e7f2dd2',1,'stan::io::reader']]], + ['unit_5fvector_5fconstrain',['unit_vector_constrain',['../classstan_1_1io_1_1reader.html#aafcb145538d7414947c3420b652ad962',1,'stan::io::reader::unit_vector_constrain(size_t k)'],['../classstan_1_1io_1_1reader.html#ac4c986f3ceee7c402820835ba7bfde62',1,'stan::io::reader::unit_vector_constrain(size_t k, T &lp)'],['../namespacestan_1_1prob.html#afd9044ce24ca929e0d1fcf49fdfcb7cc',1,'stan::prob::unit_vector_constrain(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &y)'],['../namespacestan_1_1prob.html#ac361cea0021ad5cbd7d9daa32935bf9b',1,'stan::prob::unit_vector_constrain(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &y, T &lp)']]], + ['unit_5fvector_5fdecl_5fr',['unit_vector_decl_r',['../structstan_1_1gm_1_1var__decls__grammar.html#ad6400ff89afd46d01c13dd93ef231edd',1,'stan::gm::var_decls_grammar']]], + ['unit_5fvector_5ffree',['unit_vector_free',['../namespacestan_1_1prob.html#aa72cd0f07fe68884774feea5e5c0056c',1,'stan::prob']]], + ['unit_5fvector_5funconstrain',['unit_vector_unconstrain',['../classstan_1_1io_1_1writer.html#aa0f2b9b17db03235f4cd3f90092ac6d0',1,'stan::io::writer']]], + ['unit_5fvector_5fvar_5fdecl',['unit_vector_var_decl',['../structstan_1_1gm_1_1unit__vector__var__decl.html#a76baa9fd153a608c6d4e0b4077ddd1bc',1,'stan::gm::unit_vector_var_decl::unit_vector_var_decl()'],['../structstan_1_1gm_1_1unit__vector__var__decl.html#a2cdc1ee5970cc4e9d06362b1a51bdb7c',1,'stan::gm::unit_vector_var_decl::unit_vector_var_decl(expression const &K, std::string const &name, std::vector< expression > const &dims)']]], + ['unit_5fvector_5fvar_5fdecl',['unit_vector_var_decl',['../structstan_1_1gm_1_1unit__vector__var__decl.html',1,'stan::gm']]], + ['univariate_2ehpp',['univariate.hpp',['../univariate_8hpp.html',1,'']]], + ['unlikely',['unlikely',['../stack__alloc_8hpp.html#ac6c45889010c1bd68631771b64f18101',1,'stack_alloc.hpp']]], + ['unscope_5flocals',['unscope_locals',['../structstan_1_1gm_1_1unscope__locals.html',1,'stan::gm']]], + ['unscope_5flocals_5ff',['unscope_locals_f',['../namespacestan_1_1gm.html#aecac3234ee1a4b8b9b6344c0679cfd8d',1,'stan::gm']]], + ['unvalued_5fargument',['unvalued_argument',['../classstan_1_1gm_1_1unvalued__argument.html',1,'stan::gm']]], + ['unvalued_5fargument',['unvalued_argument',['../classstan_1_1gm_1_1unvalued__argument.html#ad92f588ed35ed51647cac11f883a945a',1,'stan::gm::unvalued_argument']]], + ['unvalued_5fargument_2ehpp',['unvalued_argument.hpp',['../unvalued__argument_8hpp.html',1,'']]], + ['update',['update',['../classstan_1_1mcmc_1_1base__hamiltonian.html#a72b6cc15dc1f074e871fbd77c3d49ed8',1,'stan::mcmc::base_hamiltonian']]], + ['update_5fq',['update_q',['../classstan_1_1mcmc_1_1base__leapfrog.html#aafd8bbf5fcf3ac4246ce798bbe085098',1,'stan::mcmc::base_leapfrog::update_q()'],['../classstan_1_1mcmc_1_1expl__leapfrog.html#ab0ac437892b1206c0bb581e5db52ba0e',1,'stan::mcmc::expl_leapfrog::update_q()']]], + ['usage',['USAGE',['../structstan_1_1gm_1_1error__codes.html#aa63873e8f7e9dd7f8af3502e4003292fab91146036be9b2c1e9bd09619da086ba',1,'stan::gm::error_codes']]], + ['utc_5ftime_5fstring',['utc_time_string',['../namespacestan_1_1io.html#a56441daea55f49d4bcb168b30d7313f0',1,'stan::io']]], + ['util_2ehpp',['util.hpp',['../io_2util_8hpp.html',1,'']]], + ['util_2ehpp',['util.hpp',['../model_2util_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/all_76.html b/doc/api/html/search/all_76.html new file mode 100644 index 00000000000..0ff5edd3493 --- /dev/null +++ b/doc/api/html/search/all_76.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/all_76.js b/doc/api/html/search/all_76.js new file mode 100644 index 00000000000..dd38338e6eb --- /dev/null +++ b/doc/api/html/search/all_76.js @@ -0,0 +1,170 @@ +var searchData= +[ + ['v',['V',['../classstan_1_1mcmc_1_1ps__point.html#a21cea778ac74b5c026a2f23fbae71304',1,'stan::mcmc::ps_point::V()'],['../classstan_1_1mcmc_1_1base__hamiltonian.html#a833128e107a090d7b285ca34a80c6881',1,'stan::mcmc::base_hamiltonian::V()']]], + ['v1_5f',['v1_',['../agrad_2rev_2matrix_2dot__product_8hpp.html#a8c886c0e0b0df10a90267645bac46674',1,'v1_(): dot_product.hpp'],['../_eigen___num_traits_8hpp.html#a26e986ea55e50b52a5f24dc12146b280',1,'v1_(): Eigen_NumTraits.hpp'],['../agrad_2rev_2matrix_2squared__dist_8hpp.html#a83c5c6dc5ed503252611e6e50af3557a',1,'v1_(): squared_dist.hpp']]], + ['v2_5f',['v2_',['../agrad_2rev_2matrix_2dot__product_8hpp.html#a27e3d8b375e8f1fb1cb0078d150879ea',1,'v2_(): dot_product.hpp'],['../_eigen___num_traits_8hpp.html#a07b9904c44113353bf64f61d7c1e5672',1,'v2_(): Eigen_NumTraits.hpp'],['../agrad_2rev_2matrix_2squared__dist_8hpp.html#a2157c9243530cdafcfb1665c9e682ed7',1,'v2_(): squared_dist.hpp']]], + ['v_5f',['v_',['../agrad_2rev_2matrix_2dot__self_8hpp.html#ad96f2a078f01703996f5677e20cc34cd',1,'v_(): dot_self.hpp'],['../agrad_2rev_2matrix_2sum_8hpp.html#ad96f2a078f01703996f5677e20cc34cd',1,'v_(): sum.hpp']]], + ['v_5fvari_2ehpp',['v_vari.hpp',['../v__vari_8hpp.html',1,'']]], + ['val',['val',['../classstan_1_1agrad_1_1var.html#a3c15579ed3018cae0a0bf556bed164e3',1,'stan::agrad::var::val()'],['../structstan_1_1agrad_1_1fvar.html#a4a8422fc2fcf430e05a5a05cf3c14fe0',1,'stan::agrad::fvar::val()'],['../classstan_1_1agrad_1_1var.html#a3c15579ed3018cae0a0bf556bed164e3',1,'stan::agrad::var::val()'],['../classstan_1_1io_1_1cmd__line.html#a44c058f7d1a236d9fdc95720191e8bd2',1,'stan::io::cmd_line::val()']]], + ['val_5f',['val_',['../classstan_1_1agrad_1_1vari.html#a03ed9389d9c07f294820e406adfc865e',1,'stan::agrad::vari::val_()'],['../structstan_1_1agrad_1_1fvar.html#a8aa2f2b763eea9bf8928fe5f4dcd0a3d',1,'stan::agrad::fvar::val_()'],['../structstan_1_1gm_1_1int__literal.html#a298151e163dc54d45f2876fe296cde5d',1,'stan::gm::int_literal::val_()'],['../structstan_1_1gm_1_1double__literal.html#a15debd030159098dafaac809c9565c48',1,'stan::gm::double_literal::val_()']]], + ['valid_5fvalue',['valid_value',['../classstan_1_1gm_1_1list__argument.html#a73dd9564f755fa41db8dfad1186ba269',1,'stan::gm::list_argument']]], + ['validate_5fallow_5fsample',['validate_allow_sample',['../structstan_1_1gm_1_1validate__allow__sample.html',1,'stan::gm']]], + ['validate_5fallow_5fsample_5ff',['validate_allow_sample_f',['../namespacestan_1_1gm.html#aa30c31af794258c24cb18df976cf4296',1,'stan::gm']]], + ['validate_5farray',['validate_array',['../structstan_1_1gm_1_1validate__transformed__params__visgen.html#a36abc2dc33d5d8053dbe93a30444fca4',1,'stan::gm::validate_transformed_params_visgen']]], + ['validate_5fassignment',['validate_assignment',['../structstan_1_1gm_1_1validate__assignment.html',1,'stan::gm']]], + ['validate_5fassignment_5ff',['validate_assignment_f',['../namespacestan_1_1gm.html#a06237cc6105be14cdd2eb0575bef7ae4',1,'stan::gm']]], + ['validate_5fcolumn_5findex',['validate_column_index',['../namespacestan_1_1math.html#a0908a541f73f2d206d9bc0d41c487a4d',1,'stan::math']]], + ['validate_5fcolumn_5findex_2ehpp',['validate_column_index.hpp',['../validate__column__index_8hpp.html',1,'']]], + ['validate_5fdims',['validate_dims',['../classstan_1_1io_1_1var__context.html#a6b4a742d7a221312bc81fc4fdd9bf011',1,'stan::io::var_context']]], + ['validate_5fexpr_5ftype',['validate_expr_type',['../structstan_1_1gm_1_1validate__expr__type.html',1,'stan::gm']]], + ['validate_5fexpr_5ftype2',['validate_expr_type2',['../structstan_1_1gm_1_1validate__expr__type2.html',1,'stan::gm']]], + ['validate_5fexpr_5ftype2_5ff',['validate_expr_type2_f',['../namespacestan_1_1gm.html#a4a3fe9f1de32042785143d781cdaaae9',1,'stan::gm']]], + ['validate_5fexpr_5ftype_5ff',['validate_expr_type_f',['../namespacestan_1_1gm.html#a32f93691dd2a6209d3f19ac875b17f3e',1,'stan::gm']]], + ['validate_5fgreater',['validate_greater',['../namespacestan_1_1math.html#a954f9705a277937f1a4e39f85c226304',1,'stan::math']]], + ['validate_5fgreater_2ehpp',['validate_greater.hpp',['../validate__greater_8hpp.html',1,'']]], + ['validate_5fgreater_5for_5fequal',['validate_greater_or_equal',['../namespacestan_1_1math.html#a153a2d6e5f828a2dc08ccba7dab2ba02',1,'stan::math']]], + ['validate_5fgreater_5for_5fequal_2ehpp',['validate_greater_or_equal.hpp',['../validate__greater__or__equal_8hpp.html',1,'']]], + ['validate_5fint_5fexpr2',['validate_int_expr2',['../structstan_1_1gm_1_1validate__int__expr2.html',1,'stan::gm']]], + ['validate_5fint_5fexpr2_5ff',['validate_int_expr2_f',['../namespacestan_1_1gm.html#a46fe00392f8da59e985d5d347198d137',1,'stan::gm']]], + ['validate_5fint_5fexpr3',['validate_int_expr3',['../structstan_1_1gm_1_1validate__int__expr3.html',1,'stan::gm']]], + ['validate_5fint_5fexpr3_5ff',['validate_int_expr3_f',['../namespacestan_1_1gm.html#a275f5389777c95f7178c6bc23f1e6441',1,'stan::gm']]], + ['validate_5fless',['validate_less',['../namespacestan_1_1math.html#a849c8dde0b08965817c862676d5b8aa3',1,'stan::math']]], + ['validate_5fless_2ehpp',['validate_less.hpp',['../validate__less_8hpp.html',1,'']]], + ['validate_5fless_5for_5fequal',['validate_less_or_equal',['../namespacestan_1_1math.html#a3f5968c67a61a65e3fe2a434d9ffb7bf',1,'stan::math']]], + ['validate_5fless_5for_5fequal_2ehpp',['validate_less_or_equal.hpp',['../validate__less__or__equal_8hpp.html',1,'']]], + ['validate_5fmatching_5fdims',['validate_matching_dims',['../namespacestan_1_1math.html#a6c2cb320ad093bb28e503258b3681826',1,'stan::math']]], + ['validate_5fmatching_5fdims_2ehpp',['validate_matching_dims.hpp',['../validate__matching__dims_8hpp.html',1,'']]], + ['validate_5fmatching_5fsizes',['validate_matching_sizes',['../namespacestan_1_1math.html#ad53597362a6c7c1158057959fcac292e',1,'stan::math::validate_matching_sizes(const std::vector< T1 > &x1, const std::vector< T2 > &x2, const char *msg)'],['../namespacestan_1_1math.html#a41ec7da4239a007943fc013e07cba3aa',1,'stan::math::validate_matching_sizes(const Eigen::Matrix< T1, R1, C1 > &x1, const Eigen::Matrix< T2, R2, C2 > &x2, const char *msg)'],['../namespacestan_1_1math.html#a263171956617573c8cd3c1d18fd6ceb3',1,'stan::math::validate_matching_sizes(const Eigen::Block< Derived > &x1, const Eigen::Matrix< T2, R2, C2 > &x2, const char *msg)'],['../namespacestan_1_1math.html#a8129ae89cd2dbb265cb12b92f8e04422',1,'stan::math::validate_matching_sizes(const Eigen::Matrix< T1, R1, C1 > &x1, const Eigen::Block< Derived > &x2, const char *msg)'],['../namespacestan_1_1math.html#affd4c08b7da0d68132fa34cb400ea42f',1,'stan::math::validate_matching_sizes(const Eigen::Block< Derived1 > &x1, const Eigen::Block< Derived2 > &x2, const char *msg)']]], + ['validate_5fmatching_5fsizes_2ehpp',['validate_matching_sizes.hpp',['../validate__matching__sizes_8hpp.html',1,'']]], + ['validate_5fmultiplicable',['validate_multiplicable',['../namespacestan_1_1math.html#a2f8623dd71addc9eb308adbd79650173',1,'stan::math']]], + ['validate_5fmultiplicable_2ehpp',['validate_multiplicable.hpp',['../validate__multiplicable_8hpp.html',1,'']]], + ['validate_5fnon_5fnegative_5findex',['validate_non_negative_index',['../namespacestan_1_1math.html#a3abcd9b7deac4b6378eae04ee927f498',1,'stan::math']]], + ['validate_5fnon_5fnegative_5findex_2ehpp',['validate_non_negative_index.hpp',['../validate__non__negative__index_8hpp.html',1,'']]], + ['validate_5fnon_5fnegative_5frep',['validate_non_negative_rep',['../namespacestan_1_1math.html#aa5fcab47a4a1c557ed22ce8c9dfa4690',1,'stan::math']]], + ['validate_5fnon_5fnegative_5frep_2ehpp',['validate_non_negative_rep.hpp',['../validate__non__negative__rep_8hpp.html',1,'']]], + ['validate_5fnonzero_5fsize',['validate_nonzero_size',['../namespacestan_1_1math.html#ab4ad50f7ce663f08887cc98f00325102',1,'stan::math']]], + ['validate_5fnonzero_5fsize_2ehpp',['validate_nonzero_size.hpp',['../validate__nonzero__size_8hpp.html',1,'']]], + ['validate_5frow_5findex',['validate_row_index',['../namespacestan_1_1math.html#a89eabaf81a12e1ba52dc95991f3c7cec',1,'stan::math']]], + ['validate_5frow_5findex_2ehpp',['validate_row_index.hpp',['../validate__row__index_8hpp.html',1,'']]], + ['validate_5fsample',['validate_sample',['../structstan_1_1gm_1_1validate__sample.html',1,'stan::gm']]], + ['validate_5fsample_5ff',['validate_sample_f',['../namespacestan_1_1gm.html#ac38f7f49db3ee6f8fabb7b317eaa126c',1,'stan::gm']]], + ['validate_5fsquare',['validate_square',['../namespacestan_1_1math.html#a80e2967cc986a918329c7e226aa97d35',1,'stan::math']]], + ['validate_5fsquare_2ehpp',['validate_square.hpp',['../validate__square_8hpp.html',1,'']]], + ['validate_5fstd_5fvector_5findex',['validate_std_vector_index',['../namespacestan_1_1math.html#aa8bef2aad224049eb13f5de732d60805',1,'stan::math']]], + ['validate_5fstd_5fvector_5findex_2ehpp',['validate_std_vector_index.hpp',['../validate__std__vector__index_8hpp.html',1,'']]], + ['validate_5fsymmetric',['validate_symmetric',['../namespacestan_1_1math.html#a3e7c964f96b6454223b9204f463ad674',1,'stan::math']]], + ['validate_5fsymmetric_2ehpp',['validate_symmetric.hpp',['../validate__symmetric_8hpp.html',1,'']]], + ['validate_5ftransformed_5fparams_5fvisgen',['validate_transformed_params_visgen',['../structstan_1_1gm_1_1validate__transformed__params__visgen.html',1,'stan::gm']]], + ['validate_5ftransformed_5fparams_5fvisgen',['validate_transformed_params_visgen',['../structstan_1_1gm_1_1validate__transformed__params__visgen.html#a7a4e7704245e4a73bc886041c82c91e5',1,'stan::gm::validate_transformed_params_visgen']]], + ['validate_5fvar_5fdecl_5fvisgen',['validate_var_decl_visgen',['../structstan_1_1gm_1_1validate__var__decl__visgen.html',1,'stan::gm']]], + ['validate_5fvar_5fdecl_5fvisgen',['validate_var_decl_visgen',['../structstan_1_1gm_1_1validate__var__decl__visgen.html#a271a3fadedfb0fe40560244c26f4aef4',1,'stan::gm::validate_var_decl_visgen']]], + ['validate_5fvector',['validate_vector',['../namespacestan_1_1math.html#a883b9b83e5ca3d865f9dcf26d57a69fe',1,'stan::math']]], + ['validate_5fvector_2ehpp',['validate_vector.hpp',['../validate__vector_8hpp.html',1,'']]], + ['vals_5fi',['vals_i',['../classstan_1_1io_1_1dump.html#ac9a6ba06213461f7d86c5823813de2bd',1,'stan::io::dump::vals_i()'],['../classstan_1_1io_1_1var__context.html#ae491a228dc66136ed04f9d22b18386d2',1,'stan::io::var_context::vals_i()']]], + ['vals_5fr',['vals_r',['../classstan_1_1io_1_1dump.html#aa9b7bc08c1152a313e90b74ade5338b5',1,'stan::io::dump::vals_r()'],['../classstan_1_1io_1_1var__context.html#aaf3c30da7aa7a81b67d0cb3a480a5295',1,'stan::io::var_context::vals_r()']]], + ['value',['value',['../structstan_1_1is__constant.html#a9f8df8637f49cd02a47f8c6c2c775777aecafc97e964e672dd93bcb490a0a1811',1,'stan::is_constant::value()'],['../structstan_1_1is__constant__struct.html#a601169d4607d1347bd20eb918809a922a3f9610c0a10a3879fccf6f212dd3d411',1,'stan::is_constant_struct::value()'],['../structstan_1_1is__constant__struct_3_01std_1_1vector_3_01_t_01_4_01_4.html#ac35de45d53f720014d1d6c9341facc38a889b9838820d11325b1b1e2e6dcd1f62',1,'stan::is_constant_struct< std::vector< T > >::value()'],['../structstan_1_1is__constant__struct_3_01_eigen_1_1_matrix_3_01_t_00_01_r_00_01_c_01_4_01_4.html#a629489369f685966d67e23b49b3a765ca8a919616f9227fcfa43cb7134758120a',1,'stan::is_constant_struct< Eigen::Matrix< T, R, C > >::value()'],['../structstan_1_1is__constant__struct_3_01_eigen_1_1_block_3_01_t_01_4_01_4.html#a47daf157025983c39d6e5b7789c05206ae47d85a4a43fdce9e0a2be294e6e0622',1,'stan::is_constant_struct< Eigen::Block< T > >::value()'],['../structstan_1_1is__vector.html#a69abd37dca972430e0f61ea33a19ce5da9b19e1572754024bf83375a19efee164',1,'stan::is_vector::value()'],['../structstan_1_1is__vector_3_01const_01_t_01_4.html#ad3a0ba8876c7203c3ae3e20dd7904da4ab7b181e7406ecc9d9512f53eeb423835',1,'stan::is_vector< const T >::value()'],['../structstan_1_1is__vector_3_01std_1_1vector_3_01_t_01_4_01_4.html#a820092c09f0441ab121b88f94e7034f5a8669507d2c0cf8d2013fa55cbc040690',1,'stan::is_vector< std::vector< T > >::value()'],['../structstan_1_1is__vector_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_011_01_4_01_4.html#a38d7fc87cb5dbb66fb65e9dd8c257273a75a67f94582ddd21b4956e5540578114',1,'stan::is_vector< Eigen::Matrix< T, Eigen::Dynamic, 1 > >::value()'],['../structstan_1_1is__vector_3_01_eigen_1_1_matrix_3_01_t_00_011_00_01_eigen_1_1_dynamic_01_4_01_4.html#ae014ed595604daf1ca469933b46e9126a060ce69961a2ceb1cc29cc4861aa527e',1,'stan::is_vector< Eigen::Matrix< T, 1, Eigen::Dynamic > >::value()'],['../structstan_1_1is__vector__like.html#a991e328843789ff8e8976aa11aecb426a2113100a63bb957b1ada362a39a22213',1,'stan::is_vector_like::value()'],['../structstan_1_1is__vector__like_3_01_t_01_5_01_4.html#ab609c9cc8a50da1025789263899aa807a50f6d9fb5990e3e623e6e02458926009',1,'stan::is_vector_like< T * >::value()'],['../structstan_1_1is__vector__like_3_01const_01_t_01_4.html#aa1518e780b217cf8d6acf068792c726dab859ca004282bbe79a5eeda7238d86da',1,'stan::is_vector_like< const T >::value()'],['../structstan_1_1is__vector__like_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4.html#ae847915a9aa58775e6fbee811f5e20c8acc3bb708be577474e9cd1e11ad5a4ba1',1,'stan::is_vector_like< Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > >::value()'],['../structstan_1_1is__fvar.html#aee7f99a61d7b21a79c1dfd4a3619571eab1813e4af114b125e86c4eefb1c67481',1,'stan::is_fvar::value()'],['../structstan_1_1is__fvar_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a60189a2e893c9b483c218f57503672caa2a6d75c410b27b41f578e8a7ede11c56',1,'stan::is_fvar< stan::agrad::fvar< T > >::value()'],['../structstan_1_1is__var.html#a2adee59171c897185a772cd0987caef6aaeb0f9a9eead1ac6cc943d6a1974a4c1',1,'stan::is_var::value()'],['../structstan_1_1is__var_3_01stan_1_1agrad_1_1var_01_4.html#a82e1a086145eecf5ccc03374a3b41192a754935335e15e1f2b61f2bd9bf15e65b',1,'stan::is_var< stan::agrad::var >::value()'],['../structstan_1_1contains__fvar.html#a140698e0d236727d9723e6831750d2aca5a1eddf5b1539585920063fb6cd6835b',1,'stan::contains_fvar::value()'],['../structstan_1_1is__var__or__arithmetic.html#a7242e3ffd78e362fd4f4a940d39ed7a6a4e3e0e0100aa814492acbd85e2138643',1,'stan::is_var_or_arithmetic::value()'],['../structstan_1_1prob_1_1include__summand.html#a53abfbd14a204b9ceb4ed749b9183aa9a66741e4ae3f0a68c0ac9c9143c9481dd',1,'stan::prob::include_summand::value()'],['../classstan_1_1gm_1_1list__argument.html#a5c53e1ae1cbfea372b538425868f0c42',1,'stan::gm::list_argument::value()'],['../classstan_1_1gm_1_1singleton__argument.html#a7c7d0321e410a7cf3cecfcda7ddbaa4a',1,'stan::gm::singleton_argument::value()']]], + ['value_5fof',['value_of',['../namespacestan_1_1agrad.html#a8ce52917ab0cd91c9db4d615f1988e11',1,'stan::agrad::value_of(const agrad::var &v)'],['../namespacestan_1_1agrad.html#a241ff687791a297532aeed5955d6b137',1,'stan::agrad::value_of(const Eigen::Matrix< double, R, C > &M)'],['../namespacestan_1_1agrad.html#aef1424bdc8ef1058ec2cef4584bb6d5f',1,'stan::agrad::value_of(const Eigen::Matrix< var, R, C > &M)'],['../namespacestan_1_1math.html#a73087d72fd937f4be66684bd2613ae6e',1,'stan::math::value_of()']]], + ['value_5fof_2ehpp',['value_of.hpp',['../agrad_2rev_2functions_2value__of_8hpp.html',1,'']]], + ['value_5fof_2ehpp',['value_of.hpp',['../agrad_2rev_2matrix_2value__of_8hpp.html',1,'']]], + ['value_5fof_2ehpp',['value_of.hpp',['../math_2functions_2value__of_8hpp.html',1,'']]], + ['value_5fof_3c_20double_20_3e',['value_of< double >',['../namespacestan_1_1math.html#a2d7774df98215b7d113075019d74ebbf',1,'stan::math']]], + ['valued_5fargument',['valued_argument',['../classstan_1_1gm_1_1valued__argument.html',1,'stan::gm']]], + ['valued_5fargument_2ehpp',['valued_argument.hpp',['../valued__argument_8hpp.html',1,'']]], + ['values',['values',['../classstan_1_1gm_1_1list__argument.html#a0e44b787e5dd125a719e8ea75d621ceb',1,'stan::gm::list_argument']]], + ['var',['var',['../classstan_1_1agrad_1_1vari.html#a335628f2e9085305224b4f9cc6e95ed5',1,'stan::agrad::vari::var()'],['../classstan_1_1agrad_1_1var.html#adfb9d02c364f36d433ebbe551ed5cf6d',1,'stan::agrad::var::var(vari *vi)'],['../classstan_1_1agrad_1_1var.html#a338e1033dc034d6333060ec779200146',1,'stan::agrad::var::var()'],['../classstan_1_1agrad_1_1var.html#af45c7283eb94f118473d6590387ae2bb',1,'stan::agrad::var::var(bool b)'],['../classstan_1_1agrad_1_1var.html#a36df08fb95336e5c4475768447cc17dc',1,'stan::agrad::var::var(char c)'],['../classstan_1_1agrad_1_1var.html#add6c4253ae479385de58f2dd02e5e82e',1,'stan::agrad::var::var(short n)'],['../classstan_1_1agrad_1_1var.html#ac4651f0c746a0f08974866f3052b7137',1,'stan::agrad::var::var(unsigned short n)'],['../classstan_1_1agrad_1_1var.html#a8a75e2e91a261d9919cc05ca0e2535c3',1,'stan::agrad::var::var(int n)'],['../classstan_1_1agrad_1_1var.html#a3044e37414ac3abe97862ec2a9bbc7a7',1,'stan::agrad::var::var(unsigned int n)'],['../classstan_1_1agrad_1_1var.html#a5603249b00e49e3b3176a7652274bd8f',1,'stan::agrad::var::var(long int n)'],['../classstan_1_1agrad_1_1var.html#acdc706002d30bae61e31b94706110f66',1,'stan::agrad::var::var(unsigned long int n)'],['../classstan_1_1agrad_1_1var.html#a4160c721453aae2e1ab1a10d082e5ea4',1,'stan::agrad::var::var(float x)'],['../classstan_1_1agrad_1_1var.html#a5af3ea95797e2c3789a01a32dab060e6',1,'stan::agrad::var::var(double x)'],['../classstan_1_1agrad_1_1var.html#ab2b3011f87a92d85b32f6a0da738c46e',1,'stan::agrad::var::var(long double x)'],['../classstan_1_1agrad_1_1var.html#adfb9d02c364f36d433ebbe551ed5cf6d',1,'stan::agrad::var::var(vari *vi)'],['../classstan_1_1agrad_1_1var.html#a338e1033dc034d6333060ec779200146',1,'stan::agrad::var::var()'],['../classstan_1_1agrad_1_1var.html#af45c7283eb94f118473d6590387ae2bb',1,'stan::agrad::var::var(bool b)'],['../classstan_1_1agrad_1_1var.html#a36df08fb95336e5c4475768447cc17dc',1,'stan::agrad::var::var(char c)'],['../classstan_1_1agrad_1_1var.html#add6c4253ae479385de58f2dd02e5e82e',1,'stan::agrad::var::var(short n)'],['../classstan_1_1agrad_1_1var.html#ac4651f0c746a0f08974866f3052b7137',1,'stan::agrad::var::var(unsigned short n)'],['../classstan_1_1agrad_1_1var.html#a8a75e2e91a261d9919cc05ca0e2535c3',1,'stan::agrad::var::var(int n)'],['../classstan_1_1agrad_1_1var.html#a3044e37414ac3abe97862ec2a9bbc7a7',1,'stan::agrad::var::var(unsigned int n)'],['../classstan_1_1agrad_1_1var.html#a5603249b00e49e3b3176a7652274bd8f',1,'stan::agrad::var::var(long int n)'],['../classstan_1_1agrad_1_1var.html#acdc706002d30bae61e31b94706110f66',1,'stan::agrad::var::var(unsigned long int n)'],['../classstan_1_1agrad_1_1var.html#a050ffd5f911d423f27673bc531e1e9c1',1,'stan::agrad::var::var(unsigned long long n)'],['../classstan_1_1agrad_1_1var.html#a078422d44f10f7e4dadfeb9424f6fa94',1,'stan::agrad::var::var(long long n)'],['../classstan_1_1agrad_1_1var.html#a4160c721453aae2e1ab1a10d082e5ea4',1,'stan::agrad::var::var(float x)'],['../classstan_1_1agrad_1_1var.html#a5af3ea95797e2c3789a01a32dab060e6',1,'stan::agrad::var::var(double x)'],['../classstan_1_1agrad_1_1var.html#ab2b3011f87a92d85b32f6a0da738c46e',1,'stan::agrad::var::var(long double x)']]], + ['var',['var',['../classstan_1_1agrad_1_1var.html',1,'stan::agrad']]], + ['var_2ehpp',['var.hpp',['../var_8hpp.html',1,'']]], + ['var_5fadaptation',['var_adaptation',['../classstan_1_1mcmc_1_1var__adaptation.html#a6a890bf02c8dba36880f8e273b2f9549',1,'stan::mcmc::var_adaptation']]], + ['var_5fadaptation',['var_adaptation',['../classstan_1_1mcmc_1_1var__adaptation.html',1,'stan::mcmc']]], + ['var_5fadaptation_2ehpp',['var_adaptation.hpp',['../var__adaptation_8hpp.html',1,'']]], + ['var_5falloc_5fstack_5f',['var_alloc_stack_',['../namespacestan_1_1agrad.html#aab83e8df917b0f383dc6c2821fac522a',1,'stan::agrad']]], + ['var_5fcontext',['var_context',['../classstan_1_1io_1_1var__context.html',1,'stan::io']]], + ['var_5fcontext_2ehpp',['var_context.hpp',['../var__context_8hpp.html',1,'']]], + ['var_5fdecl',['var_decl',['../structstan_1_1gm_1_1var__decl.html#a609249d793137a66288e59763f0c0ca1',1,'stan::gm::var_decl::var_decl()'],['../structstan_1_1gm_1_1var__decl.html#ad6b9ea345106c83e5c9a006142d195e7',1,'stan::gm::var_decl::var_decl(const var_decl_t &decl)'],['../structstan_1_1gm_1_1var__decl.html#a2e0ba8dd969d92d891856d0e9b0d6b15',1,'stan::gm::var_decl::var_decl(const nil &decl)'],['../structstan_1_1gm_1_1var__decl.html#aea6f39c72a547284867577e99479f92c',1,'stan::gm::var_decl::var_decl(const int_var_decl &decl)'],['../structstan_1_1gm_1_1var__decl.html#ace6a19a8b112ee1bae58bb097cc4cde1',1,'stan::gm::var_decl::var_decl(const double_var_decl &decl)'],['../structstan_1_1gm_1_1var__decl.html#adabe31b1d68c4fedd82c583cebf31144',1,'stan::gm::var_decl::var_decl(const vector_var_decl &decl)'],['../structstan_1_1gm_1_1var__decl.html#a99d47a87450d915d42f2a5ab0731a307',1,'stan::gm::var_decl::var_decl(const row_vector_var_decl &decl)'],['../structstan_1_1gm_1_1var__decl.html#ac4ec89ef8d699e42d15ad4313a85b912',1,'stan::gm::var_decl::var_decl(const matrix_var_decl &decl)'],['../structstan_1_1gm_1_1var__decl.html#a1375d5fae7161b6788290acb062bf332',1,'stan::gm::var_decl::var_decl(const simplex_var_decl &decl)'],['../structstan_1_1gm_1_1var__decl.html#a02bd1875a6b106c8200a8c1c268ce23a',1,'stan::gm::var_decl::var_decl(const unit_vector_var_decl &decl)'],['../structstan_1_1gm_1_1var__decl.html#a6c5e46d11317ad8b9952c3732a50ba3a',1,'stan::gm::var_decl::var_decl(const ordered_var_decl &decl)'],['../structstan_1_1gm_1_1var__decl.html#a6c0661f7389c05f0c1a7f2ab94886205',1,'stan::gm::var_decl::var_decl(const positive_ordered_var_decl &decl)'],['../structstan_1_1gm_1_1var__decl.html#a9557a2d4d9e64c5bccc65c7110c726f5',1,'stan::gm::var_decl::var_decl(const cholesky_factor_var_decl &decl)'],['../structstan_1_1gm_1_1var__decl.html#a700ecb84f6ed7e2f100409c026cc6a6a',1,'stan::gm::var_decl::var_decl(const cov_matrix_var_decl &decl)'],['../structstan_1_1gm_1_1var__decl.html#acacc89bd6b788a9ea8b509153957e21e',1,'stan::gm::var_decl::var_decl(const corr_matrix_var_decl &decl)']]], + ['var_5fdecl',['var_decl',['../structstan_1_1gm_1_1var__decl.html',1,'stan::gm']]], + ['var_5fdecl_5fr',['var_decl_r',['../structstan_1_1gm_1_1var__decls__grammar.html#a2ec92bd1cdd1d5fca11adfc6d51d9090',1,'stan::gm::var_decls_grammar']]], + ['var_5fdecl_5ft',['var_decl_t',['../structstan_1_1gm_1_1var__decl.html#a053ae171df165a1fba298555456bb7ee',1,'stan::gm::var_decl']]], + ['var_5fdecls_5fg',['var_decls_g',['../structstan_1_1gm_1_1program__grammar.html#a5449b77a88443dc754276cb5e19320ef',1,'stan::gm::program_grammar::var_decls_g()'],['../structstan_1_1gm_1_1statement__grammar.html#aa09ea489cb32def2470106aea74eb2ce',1,'stan::gm::statement_grammar::var_decls_g()']]], + ['var_5fdecls_5fgrammar',['var_decls_grammar',['../structstan_1_1gm_1_1var__decls__grammar.html#ae9971b3fb03092c02d4f4d12a9d05277',1,'stan::gm::var_decls_grammar']]], + ['var_5fdecls_5fgrammar',['var_decls_grammar',['../structstan_1_1gm_1_1var__decls__grammar.html',1,'stan::gm']]], + ['var_5fdecls_5fgrammar_2ehpp',['var_decls_grammar.hpp',['../var__decls__grammar_8hpp.html',1,'']]], + ['var_5fdecls_5fgrammar_5fdef_2ehpp',['var_decls_grammar_def.hpp',['../var__decls__grammar__def_8hpp.html',1,'']]], + ['var_5fdecls_5fgrammar_5finst_2ecpp',['var_decls_grammar_inst.cpp',['../var__decls__grammar__inst_8cpp.html',1,'']]], + ['var_5fdecls_5fr',['var_decls_r',['../structstan_1_1gm_1_1var__decls__grammar.html#ac22f2373eb5a3a464aeff6f74086ab4f',1,'stan::gm::var_decls_grammar']]], + ['var_5fdims_5f',['var_dims_',['../structstan_1_1gm_1_1assignment.html#a2d2d3c02b849dae3dbf789473eac2ea0',1,'stan::gm::assignment']]], + ['var_5flhs_5fr',['var_lhs_r',['../structstan_1_1gm_1_1statement__grammar.html#aec8e5ec3102aa27c455d4eeb321ba74c',1,'stan::gm::statement_grammar']]], + ['var_5fmap_5f',['var_map_',['../structstan_1_1gm_1_1contains__var.html#abf59ec75e5e6729db7424da7ecce4ea7',1,'stan::gm::contains_var::var_map_()'],['../structstan_1_1gm_1_1contains__nonparam__var.html#adddb447cfb03a1031db491d6ff004d8d',1,'stan::gm::contains_nonparam_var::var_map_()'],['../structstan_1_1gm_1_1expression__grammar.html#a0bf2d69a4ee05a6f7f073087afe40929',1,'stan::gm::expression_grammar::var_map_()'],['../structstan_1_1gm_1_1program__grammar.html#a612c1a5b4a954dd9960d00d9d621a738',1,'stan::gm::program_grammar::var_map_()'],['../structstan_1_1gm_1_1statement__2__grammar.html#a3626cba34b0c81150a12ee6b045fd197',1,'stan::gm::statement_2_grammar::var_map_()'],['../structstan_1_1gm_1_1statement__grammar.html#a3e38af92fc643463ac93d825d5997c7d',1,'stan::gm::statement_grammar::var_map_()'],['../structstan_1_1gm_1_1term__grammar.html#a8a79bec27b23f79504c768be5942c958',1,'stan::gm::term_grammar::var_map_()'],['../structstan_1_1gm_1_1var__decls__grammar.html#a0a5d7aec5bad30ea0164823c04e04faf',1,'stan::gm::var_decls_grammar::var_map_()']]], + ['var_5fnochain_5fstack_5f',['var_nochain_stack_',['../namespacestan_1_1agrad.html#a1da2503303417b341d207feb1bfc9ef1',1,'stan::agrad']]], + ['var_5forigin',['var_origin',['../namespacestan_1_1gm.html#a37c3937aa5961352d95274c274bf0b17',1,'stan::gm']]], + ['var_5fresizer_5f',['var_resizer_',['../structstan_1_1gm_1_1dump__member__var__visgen.html#ae6b91a5e31677edd71859d18ad79b24c',1,'stan::gm::dump_member_var_visgen']]], + ['var_5fresizing_5fvisgen',['var_resizing_visgen',['../structstan_1_1gm_1_1var__resizing__visgen.html',1,'stan::gm']]], + ['var_5fresizing_5fvisgen',['var_resizing_visgen',['../structstan_1_1gm_1_1var__resizing__visgen.html#ac5178b0a38aa8258bcbf689ae03d895b',1,'stan::gm::var_resizing_visgen']]], + ['var_5fsize_5fvalidating_5fvisgen',['var_size_validating_visgen',['../structstan_1_1gm_1_1var__size__validating__visgen.html',1,'stan::gm']]], + ['var_5fsize_5fvalidating_5fvisgen',['var_size_validating_visgen',['../structstan_1_1gm_1_1var__size__validating__visgen.html#ade6d9d7b7a8904cf3d32ff16283143cc',1,'stan::gm::var_size_validating_visgen']]], + ['var_5fsize_5fvalidator_5f',['var_size_validator_',['../structstan_1_1gm_1_1dump__member__var__visgen.html#a977c2256249340da5264d61fc42fa37b',1,'stan::gm::dump_member_var_visgen::var_size_validator_()'],['../structstan_1_1gm_1_1generate__init__visgen.html#a81dbd32331a4a957f17f7dfd9a9259d0',1,'stan::gm::generate_init_visgen::var_size_validator_()']]], + ['var_5fstack_2ecpp',['var_stack.cpp',['../var__stack_8cpp.html',1,'']]], + ['var_5fstack_2ehpp',['var_stack.hpp',['../var__stack_8hpp.html',1,'']]], + ['var_5fstack_5f',['var_stack_',['../agrad__thread__safe_8hpp.html#ae14d7988968e318f7272640e9bd558aa',1,'var_stack_(): agrad_thread_safe.hpp'],['../namespacestan_1_1agrad.html#a02d750bf3c4aca82309533ecb869237b',1,'stan::agrad::var_stack_()']]], + ['var_5ftype_5f',['var_type_',['../structstan_1_1gm_1_1assignment.html#a32c7f69945a9335aad93f5b6c44b6b34',1,'stan::gm::assignment']]], + ['vari',['vari',['../classstan_1_1agrad_1_1vari.html',1,'stan::agrad']]], + ['vari',['vari',['../classstan_1_1agrad_1_1vari.html#add6d0976a3103aebe8b529fb3a4aede3',1,'stan::agrad::vari::vari(const double x)'],['../classstan_1_1agrad_1_1vari.html#add6d0976a3103aebe8b529fb3a4aede3',1,'stan::agrad::vari::vari(const double x)'],['../classstan_1_1agrad_1_1vari.html#a38eab19f6ecee276e3f306c14df18403',1,'stan::agrad::vari::vari(const double x, bool stacked)']]], + ['vari_2ehpp',['vari.hpp',['../vari_8hpp.html',1,'']]], + ['variable',['variable',['../structstan_1_1gm_1_1variable.html#a4d6553f00364503f9b3c1b09cce2742a',1,'stan::gm::variable::variable()'],['../structstan_1_1gm_1_1variable.html#a7a550a388056ef05489c8947aaa4d664',1,'stan::gm::variable::variable(std::string name)']]], + ['variable',['variable',['../structstan_1_1gm_1_1variable.html',1,'stan::gm']]], + ['variable_5f',['variable_',['../structstan_1_1gm_1_1for__statement.html#acc156ec777cc5ca5a60e65506a94c60f',1,'stan::gm::for_statement']]], + ['variable_5fdims',['variable_dims',['../structstan_1_1gm_1_1variable__dims.html',1,'stan::gm']]], + ['variable_5fdims',['variable_dims',['../structstan_1_1gm_1_1variable__dims.html#a58ef01ac93eb73561446431890023fcb',1,'stan::gm::variable_dims::variable_dims()'],['../structstan_1_1gm_1_1variable__dims.html#aa35ae19b846c7eed5571dc6c62b51629',1,'stan::gm::variable_dims::variable_dims(std::string const &name, std::vector< expression > const &dims)']]], + ['variable_5fmap',['variable_map',['../structstan_1_1gm_1_1variable__map.html',1,'stan::gm']]], + ['variable_5fr',['variable_r',['../structstan_1_1gm_1_1term__grammar.html#ab0c2f2623b8f78f859c358cdf3e161a6',1,'stan::gm::term_grammar']]], + ['variance',['variance',['../classstan_1_1mcmc_1_1chains.html#ada94492fb9209194467c40ee0c70ae7e',1,'stan::mcmc::chains::variance(const int chain, const int index)'],['../classstan_1_1mcmc_1_1chains.html#a2a490e9c65ef24c24d90363c762606cb',1,'stan::mcmc::chains::variance(const int index)'],['../classstan_1_1mcmc_1_1chains.html#a5e82c2ed22640dc97e77000030cad474',1,'stan::mcmc::chains::variance(const int chain, const std::string &name)'],['../classstan_1_1mcmc_1_1chains.html#ac73d02b763998c65a573f3e3f770833b',1,'stan::mcmc::chains::variance(const std::string &name)'],['../namespacestan_1_1agrad.html#a4cb2a39469233dedb86b1000789a9595',1,'stan::agrad::variance(const std::vector< var > &v)'],['../namespacestan_1_1agrad.html#a7ef648c386bf96d4cdc8b688f8de02af',1,'stan::agrad::variance(const Eigen::Matrix< var, R, C > &m)'],['../namespacestan_1_1math.html#aa433ac2fc47bbd40a6d87f62574dff85',1,'stan::math::variance(const std::vector< T > &v)'],['../namespacestan_1_1math.html#a1f055da8754c2215aac70d7787692f54',1,'stan::math::variance(const Eigen::Matrix< T, R, C > &m)']]], + ['variance_2ehpp',['variance.hpp',['../math_2matrix_2variance_8hpp.html',1,'']]], + ['variance_2ehpp',['variance.hpp',['../agrad_2rev_2matrix_2variance_8hpp.html',1,'']]], + ['vd_5fvari_2ehpp',['vd_vari.hpp',['../vd__vari_8hpp.html',1,'']]], + ['vdd_5fvari_2ehpp',['vdd_vari.hpp',['../vdd__vari_8hpp.html',1,'']]], + ['vdv_5fvari_2ehpp',['vdv_vari.hpp',['../vdv__vari_8hpp.html',1,'']]], + ['vector',['vector',['../classstan_1_1io_1_1reader.html#ac7cbe04c9a1439e20b27c3cf612bd963',1,'stan::io::reader']]], + ['vector_5fconstrain',['vector_constrain',['../classstan_1_1io_1_1reader.html#a393939c8de7bd2609b069424244b005a',1,'stan::io::reader::vector_constrain(size_t m)'],['../classstan_1_1io_1_1reader.html#aec8c3e697090c981438b94da63c02ccc',1,'stan::io::reader::vector_constrain(size_t m, T &)']]], + ['vector_5fd',['vector_d',['../namespacestan_1_1math.html#a0c7ab54df86be3a3d61e58623c210d86',1,'stan::math::vector_d()'],['../namespacestan_1_1optimization.html#af557a7d4dc0f32c569400f2b71c76d1d',1,'stan::optimization::vector_d()']]], + ['vector_5fdecl_5fr',['vector_decl_r',['../structstan_1_1gm_1_1var__decls__grammar.html#abc85787fdc330600e8ed8418a29fb6ac',1,'stan::gm::var_decls_grammar']]], + ['vector_5ffd',['vector_fd',['../namespacestan_1_1agrad.html#a50e8b3ee954a699c1467801ab52be810',1,'stan::agrad']]], + ['vector_5fffd',['vector_ffd',['../namespacestan_1_1agrad.html#a97cd52b23aca617183eb7deadb1c6d9d',1,'stan::agrad']]], + ['vector_5fffv',['vector_ffv',['../namespacestan_1_1agrad.html#a96902ae4f8847b57803a5ac7e5d9754d',1,'stan::agrad']]], + ['vector_5ffv',['vector_fv',['../namespacestan_1_1agrad.html#a4ee7f0ffda84be0aec51dfd293951daf',1,'stan::agrad']]], + ['vector_5flb',['vector_lb',['../classstan_1_1io_1_1reader.html#ae6eeeaea16178783def48d93e92e502e',1,'stan::io::reader']]], + ['vector_5flb_5fconstrain',['vector_lb_constrain',['../classstan_1_1io_1_1reader.html#a8edd356b9b6575e74458dfc36fd1079c',1,'stan::io::reader::vector_lb_constrain(const TL lb, size_t m)'],['../classstan_1_1io_1_1reader.html#a380b2abea05be45eef534178ccddae74',1,'stan::io::reader::vector_lb_constrain(const TL lb, size_t m, T &lp)']]], + ['vector_5flb_5funconstrain',['vector_lb_unconstrain',['../classstan_1_1io_1_1writer.html#ad47362a39537ff1b5d771780ee652d2b',1,'stan::io::writer']]], + ['vector_5flub',['vector_lub',['../classstan_1_1io_1_1reader.html#acfa86e4338c499595998dd4dc0b58c6d',1,'stan::io::reader']]], + ['vector_5flub_5fconstrain',['vector_lub_constrain',['../classstan_1_1io_1_1reader.html#aa0eb51076e214b1cfee60b70260186c8',1,'stan::io::reader::vector_lub_constrain(const TL lb, const TU ub, size_t m)'],['../classstan_1_1io_1_1reader.html#a6f0780b890a223ecc7840732bda385e5',1,'stan::io::reader::vector_lub_constrain(const TL lb, const TU ub, size_t m, T &lp)']]], + ['vector_5flub_5funconstrain',['vector_lub_unconstrain',['../classstan_1_1io_1_1writer.html#a2cd367320f480096f724c2e180f6abfe',1,'stan::io::writer']]], + ['vector_5ft',['vector_t',['../classstan_1_1io_1_1reader.html#acc7ad774f8ec903caa164a9ac1e78b30',1,'stan::io::reader::vector_t()'],['../classstan_1_1io_1_1writer.html#a4f9ede8dc253f291c7a27cacd03cf542',1,'stan::io::writer::vector_t()'],['../classstan_1_1optimization_1_1_b_f_g_s_line_search.html#af45bef442ce47a3821c2c19292283ecd',1,'stan::optimization::BFGSLineSearch::vector_t()'],['../namespacestan_1_1gm.html#a994b5bf5385c2c96190f9aaf19e0c711',1,'stan::gm::VECTOR_T()']]], + ['vector_5fub',['vector_ub',['../classstan_1_1io_1_1reader.html#a35d1322b79079e9227ae225a480807db',1,'stan::io::reader']]], + ['vector_5fub_5fconstrain',['vector_ub_constrain',['../classstan_1_1io_1_1reader.html#a5f5c24c79245cdcdc447f1d70ab16f67',1,'stan::io::reader::vector_ub_constrain(const TU ub, size_t m)'],['../classstan_1_1io_1_1reader.html#a7c62e6ad093def5f59767807a3c46b74',1,'stan::io::reader::vector_ub_constrain(const TU ub, size_t m, T &lp)']]], + ['vector_5fub_5funconstrain',['vector_ub_unconstrain',['../classstan_1_1io_1_1writer.html#a4d032dfecf63d6cc4f4fbe9acfbf1d26',1,'stan::io::writer']]], + ['vector_5funconstrain',['vector_unconstrain',['../classstan_1_1io_1_1writer.html#a5fac170691f85ce21490c654985c2880',1,'stan::io::writer']]], + ['vector_5fv',['vector_v',['../namespacestan_1_1agrad.html#acf0241b312ef1f17733c24766df1f49f',1,'stan::agrad']]], + ['vector_5fvar_5fdecl',['vector_var_decl',['../structstan_1_1gm_1_1vector__var__decl.html#a75bee96d48f65c3656c0195e9ddd658c',1,'stan::gm::vector_var_decl::vector_var_decl()'],['../structstan_1_1gm_1_1vector__var__decl.html#ae60a0d9f611230785a264fe1057b070c',1,'stan::gm::vector_var_decl::vector_var_decl(range const &range, expression const &M, std::string const &name, std::vector< expression > const &dims)']]], + ['vector_5fvar_5fdecl',['vector_var_decl',['../structstan_1_1gm_1_1vector__var__decl.html',1,'stan::gm']]], + ['vector_5fvari_2ehpp',['vector_vari.hpp',['../vector__vari_8hpp.html',1,'']]], + ['vectort',['VectorT',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#ae26c7119488745c9d70158da1bc1d2ae',1,'stan::optimization::BFGSMinimizer']]], + ['vectorview',['VectorView',['../classstan_1_1_vector_view.html#a49530fcffe86b987cc16c9db07433a01',1,'stan::VectorView::VectorView(scalar_t &c)'],['../classstan_1_1_vector_view.html#aa8cf0eb6c25b3e6e7ab4164d3327cab3',1,'stan::VectorView::VectorView(std::vector< scalar_t > &v)'],['../classstan_1_1_vector_view.html#a1a2167039be334fe553432580f7ec4ee',1,'stan::VectorView::VectorView(Eigen::Matrix< scalar_t, R, C > &m)'],['../classstan_1_1_vector_view.html#ace98de1e8835b3317330d98fa34b981b',1,'stan::VectorView::VectorView(scalar_t *x)'],['../classstan_1_1_vector_view_3_01const_01_t_00_01is__array_00_01throw__if__accessed_01_4.html#a144dc75865388d9e80c153d6651a9bab',1,'stan::VectorView< const T, is_array, throw_if_accessed >::VectorView(const scalar_t &c)'],['../classstan_1_1_vector_view_3_01const_01_t_00_01is__array_00_01throw__if__accessed_01_4.html#a2e063aacbcb8999b921bce5d52557646',1,'stan::VectorView< const T, is_array, throw_if_accessed >::VectorView(const scalar_t *x)'],['../classstan_1_1_vector_view_3_01const_01_t_00_01is__array_00_01throw__if__accessed_01_4.html#a8a70c613d18b72f45466591168f354dc',1,'stan::VectorView< const T, is_array, throw_if_accessed >::VectorView(const std::vector< scalar_t > &v)'],['../classstan_1_1_vector_view_3_01const_01_t_00_01is__array_00_01throw__if__accessed_01_4.html#af337a1b8ede134a1debe59fbee1cd1e1',1,'stan::VectorView< const T, is_array, throw_if_accessed >::VectorView(const Eigen::Matrix< scalar_t, R, C > &m)'],['../classstan_1_1_vector_view_3_01const_01double_00_01false_00_01false_01_4.html#af57df094db378d9da317b93d23c34ab1',1,'stan::VectorView< const double, false, false >::VectorView()']]], + ['vectorview',['VectorView',['../classstan_1_1_vector_view.html',1,'stan']]], + ['vectorview_3c_20const_20double_2c_20false_2c_20false_20_3e',['VectorView< const double, false, false >',['../classstan_1_1_vector_view_3_01const_01double_00_01false_00_01false_01_4.html',1,'stan']]], + ['vectorview_3c_20const_20t_2c_20is_5farray_2c_20throw_5fif_5faccessed_20_3e',['VectorView< const T, is_array, throw_if_accessed >',['../classstan_1_1_vector_view_3_01const_01_t_00_01is__array_00_01throw__if__accessed_01_4.html',1,'stan']]], + ['vectorview_3c_20double_20_2a_2c_20is_5fvector_3c_20t1_20_3e_3a_3avalue_2c_20is_5fconstant_5fstruct_3c_20t1_20_3e_3a_3avalue_20_3e',['VectorView< double *, is_vector< T1 >::value, is_constant_struct< T1 >::value >',['../classstan_1_1_vector_view.html',1,'stan']]], + ['vectorview_3c_20double_20_2a_2c_20is_5fvector_3c_20t2_20_3e_3a_3avalue_2c_20is_5fconstant_5fstruct_3c_20t2_20_3e_3a_3avalue_20_3e',['VectorView< double *, is_vector< T2 >::value, is_constant_struct< T2 >::value >',['../classstan_1_1_vector_view.html',1,'stan']]], + ['vectorview_3c_20double_20_2a_2c_20is_5fvector_3c_20t3_20_3e_3a_3avalue_2c_20is_5fconstant_5fstruct_3c_20t3_20_3e_3a_3avalue_20_3e',['VectorView< double *, is_vector< T3 >::value, is_constant_struct< T3 >::value >',['../classstan_1_1_vector_view.html',1,'stan']]], + ['vectorview_3c_20double_20_2a_2c_20is_5fvector_3c_20t4_20_3e_3a_3avalue_2c_20is_5fconstant_5fstruct_3c_20t4_20_3e_3a_3avalue_20_3e',['VectorView< double *, is_vector< T4 >::value, is_constant_struct< T4 >::value >',['../classstan_1_1_vector_view.html',1,'stan']]], + ['vectorview_3c_20double_20_2a_2c_20is_5fvector_3c_20t5_20_3e_3a_3avalue_2c_20is_5fconstant_5fstruct_3c_20t5_20_3e_3a_3avalue_20_3e',['VectorView< double *, is_vector< T5 >::value, is_constant_struct< T5 >::value >',['../classstan_1_1_vector_view.html',1,'stan']]], + ['vectorview_3c_20double_20_2a_2c_20is_5fvector_3c_20t6_20_3e_3a_3avalue_2c_20is_5fconstant_5fstruct_3c_20t6_20_3e_3a_3avalue_20_3e',['VectorView< double *, is_vector< T6 >::value, is_constant_struct< T6 >::value >',['../classstan_1_1_vector_view.html',1,'stan']]], + ['verbose_5fevolve',['verbose_evolve',['../classstan_1_1mcmc_1_1base__leapfrog.html#a514877fc7879757485b997d90074393d',1,'stan::mcmc::base_leapfrog']]], + ['version_2ehpp',['version.hpp',['../version_8hpp.html',1,'']]], + ['vi_5f',['vi_',['../classstan_1_1agrad_1_1var.html#af62c13dcd2bfab818579f6715fbda6af',1,'stan::agrad::var']]], + ['vis_5f',['vis_',['../classstan_1_1agrad_1_1op__matrix__vari.html#ac0dbd0805a80054b5cd0335ef8a6b144',1,'stan::agrad::op_matrix_vari::vis_()'],['../classstan_1_1agrad_1_1op__vector__vari.html#a63beb3a08614befd8eca4ed45e4ff438',1,'stan::agrad::op_vector_vari::vis_()']]], + ['visgen',['visgen',['../structstan_1_1gm_1_1visgen.html#a3e7e38e3b411dc26e0451cc3327018ca',1,'stan::gm::visgen']]], + ['visgen',['visgen',['../structstan_1_1gm_1_1visgen.html',1,'stan::gm']]], + ['von_5fmises_2ehpp',['von_mises.hpp',['../von__mises_8hpp.html',1,'']]], + ['von_5fmises_5flog',['von_mises_log',['../namespacestan_1_1prob.html#a5f25537bc65fd6699824c9c5829c9e0a',1,'stan::prob::von_mises_log(T_y const &y, T_loc const &mu, T_scale const &kappa)'],['../namespacestan_1_1prob.html#a34be34d214b53bf3d2f158ebe9b4c93d',1,'stan::prob::von_mises_log(T_y const &y, T_loc const &mu, T_scale const &kappa)']]], + ['vv_5fvari_2ehpp',['vv_vari.hpp',['../vv__vari_8hpp.html',1,'']]], + ['vvd_5fvari_2ehpp',['vvd_vari.hpp',['../vvd__vari_8hpp.html',1,'']]], + ['vvv_5fvari_2ehpp',['vvv_vari.hpp',['../vvv__vari_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/all_77.html b/doc/api/html/search/all_77.html new file mode 100644 index 00000000000..73323d3167e --- /dev/null +++ b/doc/api/html/search/all_77.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/all_77.js b/doc/api/html/search/all_77.js new file mode 100644 index 00000000000..ce5778aba1d --- /dev/null +++ b/doc/api/html/search/all_77.js @@ -0,0 +1,60 @@ +var searchData= +[ + ['warmup',['warmup',['../structstan_1_1io_1_1stan__csv__timing.html#a26e38502db9dfbb27cf5747c8e96d229',1,'stan::io::stan_csv_timing::warmup()'],['../classstan_1_1mcmc_1_1chains.html#a4a6916b3af4d4f7ecf848a4587157e2d',1,'stan::mcmc::chains::warmup()'],['../classstan_1_1mcmc_1_1chains.html#a5d009a5e09853cdf0181c6bb68f1680a',1,'stan::mcmc::chains::warmup(const int chain)'],['../namespacestan_1_1gm.html#a98eeb261d85ab5d16b98b8cfeaeb31cc',1,'stan::gm::warmup()']]], + ['weibull_2ehpp',['weibull.hpp',['../weibull_8hpp.html',1,'']]], + ['weibull_5fccdf_5flog',['weibull_ccdf_log',['../namespacestan_1_1prob.html#a77b3086174c8c53f64a6040926e463c7',1,'stan::prob']]], + ['weibull_5fcdf',['weibull_cdf',['../namespacestan_1_1prob.html#aebe40f64269bb4cad34cbf93faa258a3',1,'stan::prob']]], + ['weibull_5fcdf_5flog',['weibull_cdf_log',['../namespacestan_1_1prob.html#adf406916a5b4faaa7ff6c09f38029418',1,'stan::prob']]], + ['weibull_5flog',['weibull_log',['../namespacestan_1_1prob.html#ac9dd426180e500e8ce9ab2e401393c5a',1,'stan::prob::weibull_log(const T_y &y, const T_shape &alpha, const T_scale &sigma)'],['../namespacestan_1_1prob.html#ac782f55b0a8994488c5a02f7977799cf',1,'stan::prob::weibull_log(const T_y &y, const T_shape &alpha, const T_scale &sigma)']]], + ['weibull_5frng',['weibull_rng',['../namespacestan_1_1prob.html#a446b0eda07246d07a2d539c9a511ea7e',1,'stan::prob']]], + ['welford_5fcovar_5festimator',['welford_covar_estimator',['../classstan_1_1prob_1_1welford__covar__estimator.html',1,'stan::prob']]], + ['welford_5fcovar_5festimator',['welford_covar_estimator',['../classstan_1_1prob_1_1welford__covar__estimator.html#a185e1767d0634b283c66f8d845bb42d7',1,'stan::prob::welford_covar_estimator']]], + ['welford_5fcovar_5festimator_2ehpp',['welford_covar_estimator.hpp',['../welford__covar__estimator_8hpp.html',1,'']]], + ['welford_5fvar_5festimator',['welford_var_estimator',['../classstan_1_1prob_1_1welford__var__estimator.html',1,'stan::prob']]], + ['welford_5fvar_5festimator',['welford_var_estimator',['../classstan_1_1prob_1_1welford__var__estimator.html#adcb9ab77cf1496f0d81a605e4b503608',1,'stan::prob::welford_var_estimator']]], + ['welford_5fvar_5festimator_2ehpp',['welford_var_estimator.hpp',['../welford__var__estimator_8hpp.html',1,'']]], + ['while_5fstatement',['while_statement',['../structstan_1_1gm_1_1while__statement.html',1,'stan::gm']]], + ['while_5fstatement',['while_statement',['../structstan_1_1gm_1_1while__statement.html#a3d22ddf0941379465a1d233308baa78c',1,'stan::gm::while_statement::while_statement()'],['../structstan_1_1gm_1_1while__statement.html#afcb474205331a4302d5b57e1d334208a',1,'stan::gm::while_statement::while_statement(const expression &condition, const statement &body)']]], + ['while_5fstatement_5fr',['while_statement_r',['../structstan_1_1gm_1_1statement__grammar.html#ab8208e8ab3c4e29d3a153da6566a076d',1,'stan::gm::statement_grammar']]], + ['whitespace',['whitespace',['../structstan_1_1gm_1_1whitespace__grammar.html#a5b8a5755ab01dd301f1a32e1ef3dbf22',1,'stan::gm::whitespace_grammar']]], + ['whitespace_5fgrammar',['whitespace_grammar',['../structstan_1_1gm_1_1whitespace__grammar.html',1,'stan::gm']]], + ['whitespace_5fgrammar',['whitespace_grammar',['../structstan_1_1gm_1_1whitespace__grammar.html#aa64db66377f7420f39162295148f2582',1,'stan::gm::whitespace_grammar']]], + ['whitespace_5fgrammar_2ehpp',['whitespace_grammar.hpp',['../whitespace__grammar_8hpp.html',1,'']]], + ['whitespace_5fgrammar_5fdef_2ehpp',['whitespace_grammar_def.hpp',['../whitespace__grammar__def_8hpp.html',1,'']]], + ['whitespace_5fgrammar_5finst_2ecpp',['whitespace_grammar_inst.cpp',['../whitespace__grammar__inst_8cpp.html',1,'']]], + ['windowed_5fadaptation',['windowed_adaptation',['../classstan_1_1mcmc_1_1windowed__adaptation.html',1,'stan::mcmc']]], + ['windowed_5fadaptation',['windowed_adaptation',['../classstan_1_1mcmc_1_1windowed__adaptation.html#a80584644c847ec89734ec4dd578ce6af',1,'stan::mcmc::windowed_adaptation']]], + ['windowed_5fadaptation_2ehpp',['windowed_adaptation.hpp',['../windowed__adaptation_8hpp.html',1,'']]], + ['wishart_2ehpp',['wishart.hpp',['../wishart_8hpp.html',1,'']]], + ['wishart_5flog',['wishart_log',['../namespacestan_1_1prob.html#a10fd2efedb0954c290861d22335bd384',1,'stan::prob::wishart_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &W, const T_dof &nu, const Eigen::Matrix< T_scale, Eigen::Dynamic, Eigen::Dynamic > &S)'],['../namespacestan_1_1prob.html#a50a5c47de11d55fe41ce044e3298e7d6',1,'stan::prob::wishart_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &W, const T_dof &nu, const Eigen::Matrix< T_scale, Eigen::Dynamic, Eigen::Dynamic > &S)']]], + ['wishart_5frng',['wishart_rng',['../namespacestan_1_1prob.html#a7b8c234f87f003d4f67545ee9eb998b5',1,'stan::prob']]], + ['write',['write',['../classstan_1_1io_1_1csv__writer.html#ac4e076bd6f52bae564b785cb868bac5a',1,'stan::io::csv_writer::write(int n)'],['../classstan_1_1io_1_1csv__writer.html#af5ad776d96e98944627f61f046cd5745',1,'stan::io::csv_writer::write(double x)'],['../classstan_1_1io_1_1csv__writer.html#abeea10d26f5a33df95941359955f6429',1,'stan::io::csv_writer::write(const Eigen::Matrix< double, R, C > &m)'],['../classstan_1_1io_1_1csv__writer.html#a756aee107218b98b5aa5d283f27e853b',1,'stan::io::csv_writer::write(const std::string &s)'],['../classstan_1_1io_1_1dump__writer.html#a7505270979a70bd19a2893f33a0ba346',1,'stan::io::dump_writer::write()']]], + ['write_5farray',['write_array',['../structstan_1_1gm_1_1write__csv__vars__visgen.html#a981030df9dd0720a86077e98a3b7c2f0',1,'stan::gm::write_csv_vars_visgen::write_array()'],['../structstan_1_1gm_1_1write__array__vars__visgen.html#a46d1925738b1d24f2a0f849165d9193c',1,'stan::gm::write_array_vars_visgen::write_array()']]], + ['write_5farray_5fvars_5fvisgen',['write_array_vars_visgen',['../structstan_1_1gm_1_1write__array__vars__visgen.html#a28c75cf8b30d7a8e7121b325c34b028c',1,'stan::gm::write_array_vars_visgen']]], + ['write_5farray_5fvars_5fvisgen',['write_array_vars_visgen',['../structstan_1_1gm_1_1write__array__vars__visgen.html',1,'stan::gm']]], + ['write_5farray_5fvisgen',['write_array_visgen',['../structstan_1_1gm_1_1write__array__visgen.html#afeb5e731732edea5c690dc4b44503557',1,'stan::gm::write_array_visgen']]], + ['write_5farray_5fvisgen',['write_array_visgen',['../structstan_1_1gm_1_1write__array__visgen.html',1,'stan::gm']]], + ['write_5fbase_5fexpr_5ftype',['write_base_expr_type',['../namespacestan_1_1gm.html#a281907d01ac42b6c4c703f9285361419',1,'stan::gm']]], + ['write_5fcol_5fmajor',['write_col_major',['../classstan_1_1io_1_1csv__writer.html#ac301f64044fc4f019df0ceea3223434d',1,'stan::io::csv_writer']]], + ['write_5fcsv_5fheader_5fvisgen',['write_csv_header_visgen',['../structstan_1_1gm_1_1write__csv__header__visgen.html',1,'stan::gm']]], + ['write_5fcsv_5fheader_5fvisgen',['write_csv_header_visgen',['../structstan_1_1gm_1_1write__csv__header__visgen.html#a7931a3de7356bb9013a56703434f57c9',1,'stan::gm::write_csv_header_visgen']]], + ['write_5fcsv_5fvars_5fvisgen',['write_csv_vars_visgen',['../structstan_1_1gm_1_1write__csv__vars__visgen.html',1,'stan::gm']]], + ['write_5fcsv_5fvars_5fvisgen',['write_csv_vars_visgen',['../structstan_1_1gm_1_1write__csv__vars__visgen.html#aa0072ea087bb79c27ce204ef8b7d7421',1,'stan::gm::write_csv_vars_visgen']]], + ['write_5fcsv_5fvisgen',['write_csv_visgen',['../structstan_1_1gm_1_1write__csv__visgen.html#a9da769ec38611f0cd1cc785bedb35b31',1,'stan::gm::write_csv_visgen']]], + ['write_5fcsv_5fvisgen',['write_csv_visgen',['../structstan_1_1gm_1_1write__csv__visgen.html',1,'stan::gm']]], + ['write_5fdims_5fvisgen',['write_dims_visgen',['../structstan_1_1gm_1_1write__dims__visgen.html',1,'stan::gm']]], + ['write_5fdims_5fvisgen',['write_dims_visgen',['../structstan_1_1gm_1_1write__dims__visgen.html#a1ab14d8dc3ff1affdc050a81590124d2',1,'stan::gm::write_dims_visgen']]], + ['write_5ferror_5fmsg',['write_error_msg',['../namespacestan_1_1gm.html#ae76346e1327805d1a7f6a28da263ec5d',1,'stan::gm']]], + ['write_5fmetric',['write_metric',['../classstan_1_1mcmc_1_1dense__e__point.html#a9a5591a32c9768f2dd6e80f92b16cf93',1,'stan::mcmc::dense_e_point::write_metric()'],['../classstan_1_1mcmc_1_1diag__e__point.html#a8002286217f14c53715bffe395b9755d',1,'stan::mcmc::diag_e_point::write_metric()'],['../classstan_1_1mcmc_1_1ps__point.html#a5bee8061481a677349a329a037afed1a',1,'stan::mcmc::ps_point::write_metric()']]], + ['write_5fmodel',['write_model',['../namespacestan_1_1gm.html#ae20aea4f2c25e3aa171c1c4740ee19d7',1,'stan::gm']]], + ['write_5fparam_5fnames_5fvisgen',['write_param_names_visgen',['../structstan_1_1gm_1_1write__param__names__visgen.html',1,'stan::gm']]], + ['write_5fparam_5fnames_5fvisgen',['write_param_names_visgen',['../structstan_1_1gm_1_1write__param__names__visgen.html#ac4dd97f7d6688523100d412bcd7bfa59',1,'stan::gm::write_param_names_visgen']]], + ['write_5frow_5fmajor',['write_row_major',['../classstan_1_1io_1_1csv__writer.html#a52c5a9818363f72590cc1f3f2a70ab02',1,'stan::io::csv_writer']]], + ['write_5fsampler_5fparam_5fnames',['write_sampler_param_names',['../classstan_1_1mcmc_1_1base__mcmc.html#a2555bcff40b4656f370c751bfe06e9ab',1,'stan::mcmc::base_mcmc::write_sampler_param_names()'],['../classstan_1_1mcmc_1_1base__nuts.html#ae79f7f88b5156db27898504be9560a49',1,'stan::mcmc::base_nuts::write_sampler_param_names()'],['../classstan_1_1mcmc_1_1base__static__hmc.html#a08b235a3894d765791330ab7b0c5d473',1,'stan::mcmc::base_static_hmc::write_sampler_param_names()']]], + ['write_5fsampler_5fparams',['write_sampler_params',['../classstan_1_1mcmc_1_1base__mcmc.html#a4c30ef76ab8e9f78e46b1984b29c7f26',1,'stan::mcmc::base_mcmc::write_sampler_params()'],['../classstan_1_1mcmc_1_1base__nuts.html#aabe0eae0ae8241775760102c74053e6c',1,'stan::mcmc::base_nuts::write_sampler_params()'],['../classstan_1_1mcmc_1_1base__static__hmc.html#a26e2e7facb3998237644d7320c8db501',1,'stan::mcmc::base_static_hmc::write_sampler_params()']]], + ['write_5fsampler_5fstate',['write_sampler_state',['../classstan_1_1mcmc_1_1base__mcmc.html#a10f416fdcd1a9eb9aab56f63c0fda786',1,'stan::mcmc::base_mcmc::write_sampler_state()'],['../classstan_1_1mcmc_1_1base__hmc.html#a84c87e49136f89f49511bf46b2001f2b',1,'stan::mcmc::base_hmc::write_sampler_state()']]], + ['write_5fstan',['write_stan',['../namespacestan_1_1gm.html#afef5e532e54ab9d2a07c9b67dbc9f71d',1,'stan::gm']]], + ['writer',['writer',['../classstan_1_1io_1_1writer.html',1,'stan::io']]], + ['writer',['writer',['../classstan_1_1io_1_1writer.html#a7dcb9072dd6ce295bd1c73721c339c51',1,'stan::io::writer']]], + ['writer_2ehpp',['writer.hpp',['../writer_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/all_78.html b/doc/api/html/search/all_78.html new file mode 100644 index 00000000000..10780d661e0 --- /dev/null +++ b/doc/api/html/search/all_78.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/all_78.js b/doc/api/html/search/all_78.js new file mode 100644 index 00000000000..4863289b85f --- /dev/null +++ b/doc/api/html/search/all_78.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['x_5f',['x_',['../structstan_1_1math_1_1array__builder.html#aeeffff75de3c356257e419fc8591afcb',1,'stan::math::array_builder']]] +]; diff --git a/doc/api/html/search/all_7a.html b/doc/api/html/search/all_7a.html new file mode 100644 index 00000000000..0593a62d2a5 --- /dev/null +++ b/doc/api/html/search/all_7a.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/all_7a.js b/doc/api/html/search/all_7a.js new file mode 100644 index 00000000000..5e05b2b36b4 --- /dev/null +++ b/doc/api/html/search/all_7a.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['z',['z',['../classstan_1_1mcmc_1_1base__hmc.html#a7b9f7a04975626ce6ea23a81d903b325',1,'stan::mcmc::base_hmc']]] +]; diff --git a/doc/api/html/search/all_7e.html b/doc/api/html/search/all_7e.html new file mode 100644 index 00000000000..63512c6f9e3 --- /dev/null +++ b/doc/api/html/search/all_7e.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/all_7e.js b/doc/api/html/search/all_7e.js new file mode 100644 index 00000000000..4a4ba9d8a69 --- /dev/null +++ b/doc/api/html/search/all_7e.js @@ -0,0 +1,32 @@ +var searchData= +[ + ['_7eaccumulator',['~accumulator',['../classstan_1_1math_1_1accumulator.html#a298d4088fbfdfca98d2c8e36a5ea4f1c',1,'stan::math::accumulator']]], + ['_7eadapt_5fdense_5fe_5fnuts',['~adapt_dense_e_nuts',['../classstan_1_1mcmc_1_1adapt__dense__e__nuts.html#ac74d2958a5e578cdd10e844237e36500',1,'stan::mcmc::adapt_dense_e_nuts']]], + ['_7eadapt_5fdense_5fe_5fstatic_5fhmc',['~adapt_dense_e_static_hmc',['../classstan_1_1mcmc_1_1adapt__dense__e__static__hmc.html#ae81ad6f37f41e6a587c36e9e369a425f',1,'stan::mcmc::adapt_dense_e_static_hmc']]], + ['_7eadapt_5fdiag_5fe_5fnuts',['~adapt_diag_e_nuts',['../classstan_1_1mcmc_1_1adapt__diag__e__nuts.html#a53e11fcb574220f40be06e43e7744a74',1,'stan::mcmc::adapt_diag_e_nuts']]], + ['_7eadapt_5fdiag_5fe_5fstatic_5fhmc',['~adapt_diag_e_static_hmc',['../classstan_1_1mcmc_1_1adapt__diag__e__static__hmc.html#a4f2a2e5b2046f456483ef4eed6aa7822',1,'stan::mcmc::adapt_diag_e_static_hmc']]], + ['_7eadapt_5funit_5fe_5fnuts',['~adapt_unit_e_nuts',['../classstan_1_1mcmc_1_1adapt__unit__e__nuts.html#a615794e2c10bcda9dd7f3aba29903f28',1,'stan::mcmc::adapt_unit_e_nuts']]], + ['_7eadapt_5funit_5fe_5fstatic_5fhmc',['~adapt_unit_e_static_hmc',['../classstan_1_1mcmc_1_1adapt__unit__e__static__hmc.html#a4001b78d765ab895a38b569ec915d9f6',1,'stan::mcmc::adapt_unit_e_static_hmc']]], + ['_7eargument',['~argument',['../classstan_1_1gm_1_1argument.html#a58068b14405201e7fde123047e251dc0',1,'stan::gm::argument']]], + ['_7ebase_5fhamiltonian',['~base_hamiltonian',['../classstan_1_1mcmc_1_1base__hamiltonian.html#a16a9150dc16c40c1e137ff1462f1d53f',1,'stan::mcmc::base_hamiltonian']]], + ['_7ebase_5fmcmc',['~base_mcmc',['../classstan_1_1mcmc_1_1base__mcmc.html#a7c8f525f093ac911bab10f619e7736fe',1,'stan::mcmc::base_mcmc']]], + ['_7ebase_5fnuts',['~base_nuts',['../classstan_1_1mcmc_1_1base__nuts.html#a84f3b26c2dd43965496766cdd6ba1245',1,'stan::mcmc::base_nuts']]], + ['_7ebase_5fstatic_5fhmc',['~base_static_hmc',['../classstan_1_1mcmc_1_1base__static__hmc.html#aab5a4f0ef94b01b624262a2484d7047b',1,'stan::mcmc::base_static_hmc']]], + ['_7ecategorical_5fargument',['~categorical_argument',['../classstan_1_1gm_1_1categorical__argument.html#ae72c69a4cbf867643694227c006c53a4',1,'stan::gm::categorical_argument']]], + ['_7echainable',['~chainable',['../classstan_1_1agrad_1_1chainable.html#a962b7191aa156e1f1714ba4750971636',1,'stan::agrad::chainable']]], + ['_7echainable_5falloc',['~chainable_alloc',['../classstan_1_1agrad_1_1chainable__alloc.html#acc8ec0b3e4b6c1ef9c4f6bb03fd57eca',1,'stan::agrad::chainable_alloc']]], + ['_7echunk_5falloc',['~chunk_alloc',['../classstan_1_1memory_1_1chunk__alloc.html#aa69ee56e6bd33c0beffbe798c2bf81e1',1,'stan::memory::chunk_alloc']]], + ['_7edense_5fe_5fmetric',['~dense_e_metric',['../classstan_1_1mcmc_1_1dense__e__metric.html#ab8327239e30c1ac20c624f2d0d2a22dc',1,'stan::mcmc::dense_e_metric']]], + ['_7ediag_5fe_5fmetric',['~diag_e_metric',['../classstan_1_1mcmc_1_1diag__e__metric.html#a64127ae540bb5ad55b871a94e0684236',1,'stan::mcmc::diag_e_metric']]], + ['_7edump_5freader',['~dump_reader',['../classstan_1_1io_1_1dump__reader.html#aff43241b7509e1877e4bca83e292fff1',1,'stan::io::dump_reader']]], + ['_7edump_5fwriter',['~dump_writer',['../classstan_1_1io_1_1dump__writer.html#a69f9822358de693b3de8acf4e8dbae1b',1,'stan::io::dump_writer']]], + ['_7elist_5fargument',['~list_argument',['../classstan_1_1gm_1_1list__argument.html#a21e0538351cb27f121f7307111bb9998',1,'stan::gm::list_argument']]], + ['_7eprob_5fgrad',['~prob_grad',['../classstan_1_1model_1_1prob__grad.html#aa81011f24dd20466efdf2971ae0df2da',1,'stan::model::prob_grad']]], + ['_7ereader',['~reader',['../classstan_1_1io_1_1reader.html#a679801e4a7936f90c13e9a6498745314',1,'stan::io::reader']]], + ['_7esample',['~sample',['../classstan_1_1mcmc_1_1sample.html#a20ad72aee8c1982a32277a374401f6db',1,'stan::mcmc::sample']]], + ['_7estack_5falloc',['~stack_alloc',['../classstan_1_1memory_1_1stack__alloc.html#a9031a182931d5cd7f11e0bfa8357c6bf',1,'stan::memory::stack_alloc']]], + ['_7estan_5fcsv_5freader',['~stan_csv_reader',['../classstan_1_1io_1_1stan__csv__reader.html#a53321a2f3045ed4cec11c77413f18759',1,'stan::io::stan_csv_reader']]], + ['_7eunit_5fe_5fmetric',['~unit_e_metric',['../classstan_1_1mcmc_1_1unit__e__metric.html#aa895987fa4375871ea9c523455bcf090',1,'stan::mcmc::unit_e_metric']]], + ['_7evari',['~vari',['../classstan_1_1agrad_1_1vari.html#aa95acf2a60125ef1083a0b929cf39adb',1,'stan::agrad::vari']]], + ['_7ewriter',['~writer',['../classstan_1_1io_1_1writer.html#aab627c99226cf0e3dd237512f673c8e5',1,'stan::io::writer']]] +]; diff --git a/doc/api/html/search/classes_61.html b/doc/api/html/search/classes_61.html new file mode 100644 index 00000000000..85e5d72a385 --- /dev/null +++ b/doc/api/html/search/classes_61.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/classes_61.js b/doc/api/html/search/classes_61.js new file mode 100644 index 00000000000..5f164df5386 --- /dev/null +++ b/doc/api/html/search/classes_61.js @@ -0,0 +1,77 @@ +var searchData= +[ + ['accumulator',['accumulator',['../classstan_1_1math_1_1accumulator.html',1,'stan::math']]], + ['adapt_5fdense_5fe_5fnuts',['adapt_dense_e_nuts',['../classstan_1_1mcmc_1_1adapt__dense__e__nuts.html',1,'stan::mcmc']]], + ['adapt_5fdense_5fe_5fstatic_5fhmc',['adapt_dense_e_static_hmc',['../classstan_1_1mcmc_1_1adapt__dense__e__static__hmc.html',1,'stan::mcmc']]], + ['adapt_5fdiag_5fe_5fnuts',['adapt_diag_e_nuts',['../classstan_1_1mcmc_1_1adapt__diag__e__nuts.html',1,'stan::mcmc']]], + ['adapt_5fdiag_5fe_5fstatic_5fhmc',['adapt_diag_e_static_hmc',['../classstan_1_1mcmc_1_1adapt__diag__e__static__hmc.html',1,'stan::mcmc']]], + ['adapt_5funit_5fe_5fnuts',['adapt_unit_e_nuts',['../classstan_1_1mcmc_1_1adapt__unit__e__nuts.html',1,'stan::mcmc']]], + ['adapt_5funit_5fe_5fstatic_5fhmc',['adapt_unit_e_static_hmc',['../classstan_1_1mcmc_1_1adapt__unit__e__static__hmc.html',1,'stan::mcmc']]], + ['add_5fconditional_5fbody',['add_conditional_body',['../structstan_1_1gm_1_1add__conditional__body.html',1,'stan::gm']]], + ['add_5fconditional_5fcondition',['add_conditional_condition',['../structstan_1_1gm_1_1add__conditional__condition.html',1,'stan::gm']]], + ['add_5fexpression_5fdimss',['add_expression_dimss',['../structstan_1_1gm_1_1add__expression__dimss.html',1,'stan::gm']]], + ['add_5floop_5fidentifier',['add_loop_identifier',['../structstan_1_1gm_1_1add__loop__identifier.html',1,'stan::gm']]], + ['add_5fwhile_5fbody',['add_while_body',['../structstan_1_1gm_1_1add__while__body.html',1,'stan::gm']]], + ['add_5fwhile_5fcondition',['add_while_condition',['../structstan_1_1gm_1_1add__while__condition.html',1,'stan::gm']]], + ['addition_5fexpr',['addition_expr',['../structstan_1_1gm_1_1addition__expr.html',1,'stan::gm']]], + ['arg_5fadapt',['arg_adapt',['../classstan_1_1gm_1_1arg__adapt.html',1,'stan::gm']]], + ['arg_5fadapt_5fdelta',['arg_adapt_delta',['../classstan_1_1gm_1_1arg__adapt__delta.html',1,'stan::gm']]], + ['arg_5fadapt_5fengaged',['arg_adapt_engaged',['../classstan_1_1gm_1_1arg__adapt__engaged.html',1,'stan::gm']]], + ['arg_5fadapt_5fgamma',['arg_adapt_gamma',['../classstan_1_1gm_1_1arg__adapt__gamma.html',1,'stan::gm']]], + ['arg_5fadapt_5finit_5fbuffer',['arg_adapt_init_buffer',['../classstan_1_1gm_1_1arg__adapt__init__buffer.html',1,'stan::gm']]], + ['arg_5fadapt_5fkappa',['arg_adapt_kappa',['../classstan_1_1gm_1_1arg__adapt__kappa.html',1,'stan::gm']]], + ['arg_5fadapt_5ft0',['arg_adapt_t0',['../classstan_1_1gm_1_1arg__adapt__t0.html',1,'stan::gm']]], + ['arg_5fadapt_5fterm_5fbuffer',['arg_adapt_term_buffer',['../classstan_1_1gm_1_1arg__adapt__term__buffer.html',1,'stan::gm']]], + ['arg_5fadapt_5fwindow',['arg_adapt_window',['../classstan_1_1gm_1_1arg__adapt__window.html',1,'stan::gm']]], + ['arg_5fbfgs',['arg_bfgs',['../classstan_1_1gm_1_1arg__bfgs.html',1,'stan::gm']]], + ['arg_5fdata',['arg_data',['../classstan_1_1gm_1_1arg__data.html',1,'stan::gm']]], + ['arg_5fdata_5ffile',['arg_data_file',['../classstan_1_1gm_1_1arg__data__file.html',1,'stan::gm']]], + ['arg_5fdense_5fe',['arg_dense_e',['../classstan_1_1gm_1_1arg__dense__e.html',1,'stan::gm']]], + ['arg_5fdiag_5fe',['arg_diag_e',['../classstan_1_1gm_1_1arg__diag__e.html',1,'stan::gm']]], + ['arg_5fdiagnose',['arg_diagnose',['../classstan_1_1gm_1_1arg__diagnose.html',1,'stan::gm']]], + ['arg_5fdiagnostic_5ffile',['arg_diagnostic_file',['../classstan_1_1gm_1_1arg__diagnostic__file.html',1,'stan::gm']]], + ['arg_5fengine',['arg_engine',['../classstan_1_1gm_1_1arg__engine.html',1,'stan::gm']]], + ['arg_5ffail',['arg_fail',['../classstan_1_1gm_1_1arg__fail.html',1,'stan::gm']]], + ['arg_5fhmc',['arg_hmc',['../classstan_1_1gm_1_1arg__hmc.html',1,'stan::gm']]], + ['arg_5fid',['arg_id',['../classstan_1_1gm_1_1arg__id.html',1,'stan::gm']]], + ['arg_5finit',['arg_init',['../classstan_1_1gm_1_1arg__init.html',1,'stan::gm']]], + ['arg_5finit_5falpha',['arg_init_alpha',['../classstan_1_1gm_1_1arg__init__alpha.html',1,'stan::gm']]], + ['arg_5fint_5ftime',['arg_int_time',['../classstan_1_1gm_1_1arg__int__time.html',1,'stan::gm']]], + ['arg_5fiter',['arg_iter',['../classstan_1_1gm_1_1arg__iter.html',1,'stan::gm']]], + ['arg_5fmax_5fdepth',['arg_max_depth',['../classstan_1_1gm_1_1arg__max__depth.html',1,'stan::gm']]], + ['arg_5fmethod',['arg_method',['../classstan_1_1gm_1_1arg__method.html',1,'stan::gm']]], + ['arg_5fmetric',['arg_metric',['../classstan_1_1gm_1_1arg__metric.html',1,'stan::gm']]], + ['arg_5fnesterov',['arg_nesterov',['../classstan_1_1gm_1_1arg__nesterov.html',1,'stan::gm']]], + ['arg_5fnewton',['arg_newton',['../classstan_1_1gm_1_1arg__newton.html',1,'stan::gm']]], + ['arg_5fnum_5fsamples',['arg_num_samples',['../classstan_1_1gm_1_1arg__num__samples.html',1,'stan::gm']]], + ['arg_5fnum_5fwarmup',['arg_num_warmup',['../classstan_1_1gm_1_1arg__num__warmup.html',1,'stan::gm']]], + ['arg_5fnuts',['arg_nuts',['../classstan_1_1gm_1_1arg__nuts.html',1,'stan::gm']]], + ['arg_5foptimize',['arg_optimize',['../classstan_1_1gm_1_1arg__optimize.html',1,'stan::gm']]], + ['arg_5foptimize_5falgo',['arg_optimize_algo',['../classstan_1_1gm_1_1arg__optimize__algo.html',1,'stan::gm']]], + ['arg_5foutput',['arg_output',['../classstan_1_1gm_1_1arg__output.html',1,'stan::gm']]], + ['arg_5foutput_5ffile',['arg_output_file',['../classstan_1_1gm_1_1arg__output__file.html',1,'stan::gm']]], + ['arg_5frandom',['arg_random',['../classstan_1_1gm_1_1arg__random.html',1,'stan::gm']]], + ['arg_5frefresh',['arg_refresh',['../classstan_1_1gm_1_1arg__refresh.html',1,'stan::gm']]], + ['arg_5frwm',['arg_rwm',['../classstan_1_1gm_1_1arg__rwm.html',1,'stan::gm']]], + ['arg_5fsample',['arg_sample',['../classstan_1_1gm_1_1arg__sample.html',1,'stan::gm']]], + ['arg_5fsample_5falgo',['arg_sample_algo',['../classstan_1_1gm_1_1arg__sample__algo.html',1,'stan::gm']]], + ['arg_5fsave_5fiterations',['arg_save_iterations',['../classstan_1_1gm_1_1arg__save__iterations.html',1,'stan::gm']]], + ['arg_5fsave_5fwarmup',['arg_save_warmup',['../classstan_1_1gm_1_1arg__save__warmup.html',1,'stan::gm']]], + ['arg_5fseed',['arg_seed',['../classstan_1_1gm_1_1arg__seed.html',1,'stan::gm']]], + ['arg_5fstatic',['arg_static',['../classstan_1_1gm_1_1arg__static.html',1,'stan::gm']]], + ['arg_5fstepsize',['arg_stepsize',['../classstan_1_1gm_1_1arg__stepsize.html',1,'stan::gm']]], + ['arg_5fstepsize_5fjitter',['arg_stepsize_jitter',['../classstan_1_1gm_1_1arg__stepsize__jitter.html',1,'stan::gm']]], + ['arg_5ftest',['arg_test',['../classstan_1_1gm_1_1arg__test.html',1,'stan::gm']]], + ['arg_5ftest_5fgrad_5feps',['arg_test_grad_eps',['../classstan_1_1gm_1_1arg__test__grad__eps.html',1,'stan::gm']]], + ['arg_5ftest_5fgrad_5ferr',['arg_test_grad_err',['../classstan_1_1gm_1_1arg__test__grad__err.html',1,'stan::gm']]], + ['arg_5ftest_5fgradient',['arg_test_gradient',['../classstan_1_1gm_1_1arg__test__gradient.html',1,'stan::gm']]], + ['arg_5fthin',['arg_thin',['../classstan_1_1gm_1_1arg__thin.html',1,'stan::gm']]], + ['arg_5ftolerance',['arg_tolerance',['../classstan_1_1gm_1_1arg__tolerance.html',1,'stan::gm']]], + ['arg_5funit_5fe',['arg_unit_e',['../classstan_1_1gm_1_1arg__unit__e.html',1,'stan::gm']]], + ['argument',['argument',['../classstan_1_1gm_1_1argument.html',1,'stan::gm']]], + ['argument_5fparser',['argument_parser',['../classstan_1_1gm_1_1argument__parser.html',1,'stan::gm']]], + ['argument_5fprobe',['argument_probe',['../classstan_1_1gm_1_1argument__probe.html',1,'stan::gm']]], + ['array_5fbuilder',['array_builder',['../structstan_1_1math_1_1array__builder.html',1,'stan::math']]], + ['array_5fliteral',['array_literal',['../structstan_1_1gm_1_1array__literal.html',1,'stan::gm']]], + ['assignment',['assignment',['../structstan_1_1gm_1_1assignment.html',1,'stan::gm']]] +]; diff --git a/doc/api/html/search/classes_62.html b/doc/api/html/search/classes_62.html new file mode 100644 index 00000000000..10760ded208 --- /dev/null +++ b/doc/api/html/search/classes_62.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/classes_62.js b/doc/api/html/search/classes_62.js new file mode 100644 index 00000000000..15dfd245089 --- /dev/null +++ b/doc/api/html/search/classes_62.js @@ -0,0 +1,37 @@ +var searchData= +[ + ['base_5fadaptation',['base_adaptation',['../classstan_1_1mcmc_1_1base__adaptation.html',1,'stan::mcmc']]], + ['base_5fadapter',['base_adapter',['../classstan_1_1mcmc_1_1base__adapter.html',1,'stan::mcmc']]], + ['base_5fhamiltonian',['base_hamiltonian',['../classstan_1_1mcmc_1_1base__hamiltonian.html',1,'stan::mcmc']]], + ['base_5fhamiltonian_3c_20m_2c_20dense_5fe_5fpoint_2c_20baserng_20_3e',['base_hamiltonian< M, dense_e_point, BaseRNG >',['../classstan_1_1mcmc_1_1base__hamiltonian.html',1,'stan::mcmc']]], + ['base_5fhamiltonian_3c_20m_2c_20diag_5fe_5fpoint_2c_20baserng_20_3e',['base_hamiltonian< M, diag_e_point, BaseRNG >',['../classstan_1_1mcmc_1_1base__hamiltonian.html',1,'stan::mcmc']]], + ['base_5fhamiltonian_3c_20m_2c_20unit_5fe_5fpoint_2c_20baserng_20_3e',['base_hamiltonian< M, unit_e_point, BaseRNG >',['../classstan_1_1mcmc_1_1base__hamiltonian.html',1,'stan::mcmc']]], + ['base_5fhmc',['base_hmc',['../classstan_1_1mcmc_1_1base__hmc.html',1,'stan::mcmc']]], + ['base_5fhmc_3c_20m_2c_20dense_5fe_5fpoint_2c_20dense_5fe_5fmetric_2c_20expl_5fleapfrog_2c_20baserng_20_3e',['base_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >',['../classstan_1_1mcmc_1_1base__hmc.html',1,'stan::mcmc']]], + ['base_5fhmc_3c_20m_2c_20diag_5fe_5fpoint_2c_20diag_5fe_5fmetric_2c_20expl_5fleapfrog_2c_20baserng_20_3e',['base_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >',['../classstan_1_1mcmc_1_1base__hmc.html',1,'stan::mcmc']]], + ['base_5fhmc_3c_20m_2c_20unit_5fe_5fpoint_2c_20unit_5fe_5fmetric_2c_20expl_5fleapfrog_2c_20baserng_20_3e',['base_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >',['../classstan_1_1mcmc_1_1base__hmc.html',1,'stan::mcmc']]], + ['base_5fintegrator',['base_integrator',['../classstan_1_1mcmc_1_1base__integrator.html',1,'stan::mcmc']]], + ['base_5fintegrator_3c_20dense_5fe_5fmetric_3c_20m_2c_20baserng_20_3e_2c_20dense_5fe_5fpoint_20_3e',['base_integrator< dense_e_metric< M, BaseRNG >, dense_e_point >',['../classstan_1_1mcmc_1_1base__integrator.html',1,'stan::mcmc']]], + ['base_5fintegrator_3c_20diag_5fe_5fmetric_3c_20m_2c_20baserng_20_3e_2c_20diag_5fe_5fpoint_20_3e',['base_integrator< diag_e_metric< M, BaseRNG >, diag_e_point >',['../classstan_1_1mcmc_1_1base__integrator.html',1,'stan::mcmc']]], + ['base_5fintegrator_3c_20unit_5fe_5fmetric_3c_20m_2c_20baserng_20_3e_2c_20unit_5fe_5fpoint_20_3e',['base_integrator< unit_e_metric< M, BaseRNG >, unit_e_point >',['../classstan_1_1mcmc_1_1base__integrator.html',1,'stan::mcmc']]], + ['base_5fleapfrog',['base_leapfrog',['../classstan_1_1mcmc_1_1base__leapfrog.html',1,'stan::mcmc']]], + ['base_5fleapfrog_3c_20dense_5fe_5fmetric_3c_20m_2c_20baserng_20_3e_2c_20dense_5fe_5fpoint_20_3e',['base_leapfrog< dense_e_metric< M, BaseRNG >, dense_e_point >',['../classstan_1_1mcmc_1_1base__leapfrog.html',1,'stan::mcmc']]], + ['base_5fleapfrog_3c_20diag_5fe_5fmetric_3c_20m_2c_20baserng_20_3e_2c_20diag_5fe_5fpoint_20_3e',['base_leapfrog< diag_e_metric< M, BaseRNG >, diag_e_point >',['../classstan_1_1mcmc_1_1base__leapfrog.html',1,'stan::mcmc']]], + ['base_5fleapfrog_3c_20unit_5fe_5fmetric_3c_20m_2c_20baserng_20_3e_2c_20unit_5fe_5fpoint_20_3e',['base_leapfrog< unit_e_metric< M, BaseRNG >, unit_e_point >',['../classstan_1_1mcmc_1_1base__leapfrog.html',1,'stan::mcmc']]], + ['base_5fmcmc',['base_mcmc',['../classstan_1_1mcmc_1_1base__mcmc.html',1,'stan::mcmc']]], + ['base_5fnuts',['base_nuts',['../classstan_1_1mcmc_1_1base__nuts.html',1,'stan::mcmc']]], + ['base_5fnuts_3c_20m_2c_20dense_5fe_5fpoint_2c_20dense_5fe_5fmetric_2c_20expl_5fleapfrog_2c_20baserng_20_3e',['base_nuts< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >',['../classstan_1_1mcmc_1_1base__nuts.html',1,'stan::mcmc']]], + ['base_5fnuts_3c_20m_2c_20diag_5fe_5fpoint_2c_20diag_5fe_5fmetric_2c_20expl_5fleapfrog_2c_20baserng_20_3e',['base_nuts< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >',['../classstan_1_1mcmc_1_1base__nuts.html',1,'stan::mcmc']]], + ['base_5fnuts_3c_20m_2c_20unit_5fe_5fpoint_2c_20unit_5fe_5fmetric_2c_20expl_5fleapfrog_2c_20baserng_20_3e',['base_nuts< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >',['../classstan_1_1mcmc_1_1base__nuts.html',1,'stan::mcmc']]], + ['base_5fstatic_5fhmc',['base_static_hmc',['../classstan_1_1mcmc_1_1base__static__hmc.html',1,'stan::mcmc']]], + ['base_5fstatic_5fhmc_3c_20m_2c_20dense_5fe_5fpoint_2c_20dense_5fe_5fmetric_2c_20expl_5fleapfrog_2c_20baserng_20_3e',['base_static_hmc< M, dense_e_point, dense_e_metric, expl_leapfrog, BaseRNG >',['../classstan_1_1mcmc_1_1base__static__hmc.html',1,'stan::mcmc']]], + ['base_5fstatic_5fhmc_3c_20m_2c_20diag_5fe_5fpoint_2c_20diag_5fe_5fmetric_2c_20expl_5fleapfrog_2c_20baserng_20_3e',['base_static_hmc< M, diag_e_point, diag_e_metric, expl_leapfrog, BaseRNG >',['../classstan_1_1mcmc_1_1base__static__hmc.html',1,'stan::mcmc']]], + ['base_5fstatic_5fhmc_3c_20m_2c_20unit_5fe_5fpoint_2c_20unit_5fe_5fmetric_2c_20expl_5fleapfrog_2c_20baserng_20_3e',['base_static_hmc< M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG >',['../classstan_1_1mcmc_1_1base__static__hmc.html',1,'stan::mcmc']]], + ['base_5fvar_5fdecl',['base_var_decl',['../structstan_1_1gm_1_1base__var__decl.html',1,'stan::gm']]], + ['bfgslinesearch',['BFGSLineSearch',['../classstan_1_1optimization_1_1_b_f_g_s_line_search.html',1,'stan::optimization']]], + ['bfgsminimizer',['BFGSMinimizer',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html',1,'stan::optimization']]], + ['bfgsminimizer_3c_20modeladaptor_3c_20m_20_3e_20_3e',['BFGSMinimizer< ModelAdaptor< M > >',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html',1,'stan::optimization']]], + ['bfgsoptions',['BFGSOptions',['../structstan_1_1optimization_1_1_b_f_g_s_minimizer_1_1_b_f_g_s_options.html',1,'stan::optimization::BFGSMinimizer']]], + ['binary_5fop',['binary_op',['../structstan_1_1gm_1_1binary__op.html',1,'stan::gm']]], + ['binary_5fop_5fexpr',['binary_op_expr',['../structstan_1_1gm_1_1binary__op__expr.html',1,'stan::gm']]] +]; diff --git a/doc/api/html/search/classes_63.html b/doc/api/html/search/classes_63.html new file mode 100644 index 00000000000..72c66b963db --- /dev/null +++ b/doc/api/html/search/classes_63.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/classes_63.js b/doc/api/html/search/classes_63.js new file mode 100644 index 00000000000..cab275d358a --- /dev/null +++ b/doc/api/html/search/classes_63.js @@ -0,0 +1,22 @@ +var searchData= +[ + ['categorical_5fargument',['categorical_argument',['../classstan_1_1gm_1_1categorical__argument.html',1,'stan::gm']]], + ['chainable',['chainable',['../classstan_1_1agrad_1_1chainable.html',1,'stan::agrad']]], + ['chainable_5falloc',['chainable_alloc',['../classstan_1_1agrad_1_1chainable__alloc.html',1,'stan::agrad']]], + ['chains',['chains',['../classstan_1_1mcmc_1_1chains.html',1,'stan::mcmc']]], + ['cholesky_5ffactor_5fvar_5fdecl',['cholesky_factor_var_decl',['../structstan_1_1gm_1_1cholesky__factor__var__decl.html',1,'stan::gm']]], + ['chunk_5falloc',['chunk_alloc',['../classstan_1_1memory_1_1chunk__alloc.html',1,'stan::memory']]], + ['cmd_5fline',['cmd_line',['../classstan_1_1io_1_1cmd__line.html',1,'stan::io']]], + ['common_5ftype',['common_type',['../structstan_1_1math_1_1common__type.html',1,'stan::math']]], + ['common_5ftype_3c_20eigen_3a_3amatrix_3c_20t1_2c_20r_2c_20c_20_3e_2c_20eigen_3a_3amatrix_3c_20t2_2c_20r_2c_20c_20_3e_20_3e',['common_type< Eigen::Matrix< T1, R, C >, Eigen::Matrix< T2, R, C > >',['../structstan_1_1math_1_1common__type_3_01_eigen_1_1_matrix_3_01_t1_00_01_r_00_01_c_01_4_00_01_eiged8accfa00e73f240c58ad02ac582ba93.html',1,'stan::math']]], + ['common_5ftype_3c_20std_3a_3avector_3c_20t1_20_3e_2c_20std_3a_3avector_3c_20t2_20_3e_20_3e',['common_type< std::vector< T1 >, std::vector< T2 > >',['../structstan_1_1math_1_1common__type_3_01std_1_1vector_3_01_t1_01_4_00_01std_1_1vector_3_01_t2_01_4_01_4.html',1,'stan::math']]], + ['conditional_5fstatement',['conditional_statement',['../structstan_1_1gm_1_1conditional__statement.html',1,'stan::gm']]], + ['constrained_5fparam_5fnames_5fvisgen',['constrained_param_names_visgen',['../structstan_1_1gm_1_1constrained__param__names__visgen.html',1,'stan::gm']]], + ['contains_5ffvar',['contains_fvar',['../structstan_1_1contains__fvar.html',1,'stan']]], + ['contains_5fnonparam_5fvar',['contains_nonparam_var',['../structstan_1_1gm_1_1contains__nonparam__var.html',1,'stan::gm']]], + ['contains_5fvar',['contains_var',['../structstan_1_1gm_1_1contains__var.html',1,'stan::gm']]], + ['corr_5fmatrix_5fvar_5fdecl',['corr_matrix_var_decl',['../structstan_1_1gm_1_1corr__matrix__var__decl.html',1,'stan::gm']]], + ['cov_5fmatrix_5fvar_5fdecl',['cov_matrix_var_decl',['../structstan_1_1gm_1_1cov__matrix__var__decl.html',1,'stan::gm']]], + ['covar_5fadaptation',['covar_adaptation',['../classstan_1_1mcmc_1_1covar__adaptation.html',1,'stan::mcmc']]], + ['csv_5fwriter',['csv_writer',['../classstan_1_1io_1_1csv__writer.html',1,'stan::io']]] +]; diff --git a/doc/api/html/search/classes_64.html b/doc/api/html/search/classes_64.html new file mode 100644 index 00000000000..59027083046 --- /dev/null +++ b/doc/api/html/search/classes_64.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/classes_64.js b/doc/api/html/search/classes_64.js new file mode 100644 index 00000000000..0854a6713df --- /dev/null +++ b/doc/api/html/search/classes_64.js @@ -0,0 +1,23 @@ +var searchData= +[ + ['dense_5fe_5fmetric',['dense_e_metric',['../classstan_1_1mcmc_1_1dense__e__metric.html',1,'stan::mcmc']]], + ['dense_5fe_5fnuts',['dense_e_nuts',['../classstan_1_1mcmc_1_1dense__e__nuts.html',1,'stan::mcmc']]], + ['dense_5fe_5fpoint',['dense_e_point',['../classstan_1_1mcmc_1_1dense__e__point.html',1,'stan::mcmc']]], + ['dense_5fe_5fstatic_5fhmc',['dense_e_static_hmc',['../classstan_1_1mcmc_1_1dense__e__static__hmc.html',1,'stan::mcmc']]], + ['diag_5fe_5fmetric',['diag_e_metric',['../classstan_1_1mcmc_1_1diag__e__metric.html',1,'stan::mcmc']]], + ['diag_5fe_5fnuts',['diag_e_nuts',['../classstan_1_1mcmc_1_1diag__e__nuts.html',1,'stan::mcmc']]], + ['diag_5fe_5fpoint',['diag_e_point',['../classstan_1_1mcmc_1_1diag__e__point.html',1,'stan::mcmc']]], + ['diag_5fe_5fstatic_5fhmc',['diag_e_static_hmc',['../classstan_1_1mcmc_1_1diag__e__static__hmc.html',1,'stan::mcmc']]], + ['distribution',['distribution',['../structstan_1_1gm_1_1distribution.html',1,'stan::gm']]], + ['division_5fexpr',['division_expr',['../structstan_1_1gm_1_1division__expr.html',1,'stan::gm']]], + ['dot_5fproduct_5fstore_5ftype',['dot_product_store_type',['../structdot__product__store__type.html',1,'']]], + ['double_5fliteral',['double_literal',['../structstan_1_1gm_1_1double__literal.html',1,'stan::gm']]], + ['double_5fvar_5fdecl',['double_var_decl',['../structstan_1_1gm_1_1double__var__decl.html',1,'stan::gm']]], + ['doublevectorview',['DoubleVectorView',['../classstan_1_1_double_vector_view.html',1,'stan']]], + ['doublevectorview_3c_20true_2c_20false_20_3e',['DoubleVectorView< true, false >',['../classstan_1_1_double_vector_view_3_01true_00_01false_01_4.html',1,'stan']]], + ['doublevectorview_3c_20true_2c_20true_20_3e',['DoubleVectorView< true, true >',['../classstan_1_1_double_vector_view_3_01true_00_01true_01_4.html',1,'stan']]], + ['dump',['dump',['../classstan_1_1io_1_1dump.html',1,'stan::io']]], + ['dump_5fmember_5fvar_5fvisgen',['dump_member_var_visgen',['../structstan_1_1gm_1_1dump__member__var__visgen.html',1,'stan::gm']]], + ['dump_5freader',['dump_reader',['../classstan_1_1io_1_1dump__reader.html',1,'stan::io']]], + ['dump_5fwriter',['dump_writer',['../classstan_1_1io_1_1dump__writer.html',1,'stan::io']]] +]; diff --git a/doc/api/html/search/classes_65.html b/doc/api/html/search/classes_65.html new file mode 100644 index 00000000000..15f57ebdf59 --- /dev/null +++ b/doc/api/html/search/classes_65.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/classes_65.js b/doc/api/html/search/classes_65.js new file mode 100644 index 00000000000..47d0e07565c --- /dev/null +++ b/doc/api/html/search/classes_65.js @@ -0,0 +1,17 @@ +var searchData= +[ + ['elt_5fdivision_5fexpr',['elt_division_expr',['../structstan_1_1gm_1_1elt__division__expr.html',1,'stan::gm']]], + ['elt_5fmultiplication_5fexpr',['elt_multiplication_expr',['../structstan_1_1gm_1_1elt__multiplication__expr.html',1,'stan::gm']]], + ['error_5fcodes',['error_codes',['../structstan_1_1gm_1_1error__codes.html',1,'stan::gm']]], + ['expl_5fleapfrog',['expl_leapfrog',['../classstan_1_1mcmc_1_1expl__leapfrog.html',1,'stan::mcmc']]], + ['expl_5fleapfrog_3c_20dense_5fe_5fmetric_3c_20m_2c_20baserng_20_3e_2c_20dense_5fe_5fpoint_20_3e',['expl_leapfrog< dense_e_metric< M, BaseRNG >, dense_e_point >',['../classstan_1_1mcmc_1_1expl__leapfrog.html',1,'stan::mcmc']]], + ['expl_5fleapfrog_3c_20diag_5fe_5fmetric_3c_20m_2c_20baserng_20_3e_2c_20diag_5fe_5fpoint_20_3e',['expl_leapfrog< diag_e_metric< M, BaseRNG >, diag_e_point >',['../classstan_1_1mcmc_1_1expl__leapfrog.html',1,'stan::mcmc']]], + ['expl_5fleapfrog_3c_20unit_5fe_5fmetric_3c_20m_2c_20baserng_20_3e_2c_20unit_5fe_5fpoint_20_3e',['expl_leapfrog< unit_e_metric< M, BaseRNG >, unit_e_point >',['../classstan_1_1mcmc_1_1expl__leapfrog.html',1,'stan::mcmc']]], + ['expr_5ftype',['expr_type',['../structstan_1_1gm_1_1expr__type.html',1,'stan::gm']]], + ['expression',['expression',['../structstan_1_1gm_1_1expression.html',1,'stan::gm']]], + ['expression_5fas_5fstatement',['expression_as_statement',['../structstan_1_1gm_1_1expression__as__statement.html',1,'stan::gm']]], + ['expression_5fgrammar',['expression_grammar',['../structexpression__grammar.html',1,'']]], + ['expression_5fgrammar',['expression_grammar',['../structstan_1_1gm_1_1expression__grammar.html',1,'stan::gm']]], + ['expression_5ftype_5fvis',['expression_type_vis',['../structstan_1_1gm_1_1expression__type__vis.html',1,'stan::gm']]], + ['expression_5fvisgen',['expression_visgen',['../structstan_1_1gm_1_1expression__visgen.html',1,'stan::gm']]] +]; diff --git a/doc/api/html/search/classes_66.html b/doc/api/html/search/classes_66.html new file mode 100644 index 00000000000..941988c6576 --- /dev/null +++ b/doc/api/html/search/classes_66.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/classes_66.js b/doc/api/html/search/classes_66.js new file mode 100644 index 00000000000..8f7bd1e5a42 --- /dev/null +++ b/doc/api/html/search/classes_66.js @@ -0,0 +1,7 @@ +var searchData= +[ + ['for_5fstatement',['for_statement',['../structstan_1_1gm_1_1for__statement.html',1,'stan::gm']]], + ['fun',['fun',['../structstan_1_1gm_1_1fun.html',1,'stan::gm']]], + ['function_5fsignatures',['function_signatures',['../classstan_1_1gm_1_1function__signatures.html',1,'stan::gm']]], + ['fvar',['fvar',['../structstan_1_1agrad_1_1fvar.html',1,'stan::agrad']]] +]; diff --git a/doc/api/html/search/classes_67.html b/doc/api/html/search/classes_67.html new file mode 100644 index 00000000000..78b514df041 --- /dev/null +++ b/doc/api/html/search/classes_67.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/classes_67.js b/doc/api/html/search/classes_67.js new file mode 100644 index 00000000000..5d2d5870078 --- /dev/null +++ b/doc/api/html/search/classes_67.js @@ -0,0 +1,9 @@ +var searchData= +[ + ['general_5fmatrix_5fmatrix_5fproduct_3c_20index_2c_20stan_3a_3aagrad_3a_3avar_2c_20lhsstorageorder_2c_20conjugatelhs_2c_20stan_3a_3aagrad_3a_3avar_2c_20rhsstorageorder_2c_20conjugaterhs_2c_20colmajor_20_3e',['general_matrix_matrix_product< Index, stan::agrad::var, LhsStorageOrder, ConjugateLhs, stan::agrad::var, RhsStorageOrder, ConjugateRhs, ColMajor >',['../struct_eigen_1_1internal_1_1general__matrix__matrix__product_3_01_index_00_01stan_1_1agrad_1_1va9b485de9571b6e46d7a64aff43a6d9d3.html',1,'Eigen::internal']]], + ['general_5fmatrix_5fvector_5fproduct_3c_20index_2c_20stan_3a_3aagrad_3a_3avar_2c_20colmajor_2c_20conjugatelhs_2c_20stan_3a_3aagrad_3a_3avar_2c_20conjugaterhs_20_3e',['general_matrix_vector_product< Index, stan::agrad::var, ColMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >',['../struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1va44da5f98e1caea9523bacbd5bdc025fe.html',1,'Eigen::internal']]], + ['general_5fmatrix_5fvector_5fproduct_3c_20index_2c_20stan_3a_3aagrad_3a_3avar_2c_20rowmajor_2c_20conjugatelhs_2c_20stan_3a_3aagrad_3a_3avar_2c_20conjugaterhs_20_3e',['general_matrix_vector_product< Index, stan::agrad::var, RowMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >',['../struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1vacd54cabc78c49ca719650381b68b105e.html',1,'Eigen::internal']]], + ['generate_5finit_5fvars_5fvisgen',['generate_init_vars_visgen',['../structstan_1_1gm_1_1generate__init__vars__visgen.html',1,'stan::gm']]], + ['generate_5finit_5fvisgen',['generate_init_visgen',['../structstan_1_1gm_1_1generate__init__visgen.html',1,'stan::gm']]], + ['generate_5flocal_5fvar_5finit_5fnan_5fvisgen',['generate_local_var_init_nan_visgen',['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html',1,'stan::gm']]] +]; diff --git a/doc/api/html/search/classes_69.html b/doc/api/html/search/classes_69.html new file mode 100644 index 00000000000..961dbea275b --- /dev/null +++ b/doc/api/html/search/classes_69.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/classes_69.js b/doc/api/html/search/classes_69.js new file mode 100644 index 00000000000..538b0833f70 --- /dev/null +++ b/doc/api/html/search/classes_69.js @@ -0,0 +1,29 @@ +var searchData= +[ + ['include_5fsummand',['include_summand',['../structstan_1_1prob_1_1include__summand.html',1,'stan::prob']]], + ['increment_5flog_5fprob_5fstatement',['increment_log_prob_statement',['../structstan_1_1gm_1_1increment__log__prob__statement.html',1,'stan::gm']]], + ['index_5fop',['index_op',['../structstan_1_1gm_1_1index__op.html',1,'stan::gm']]], + ['init_5flocal_5fvar_5fvisgen',['init_local_var_visgen',['../structstan_1_1gm_1_1init__local__var__visgen.html',1,'stan::gm']]], + ['int_5fliteral',['int_literal',['../structstan_1_1gm_1_1int__literal.html',1,'stan::gm']]], + ['int_5fvar_5fdecl',['int_var_decl',['../structstan_1_1gm_1_1int__var__decl.html',1,'stan::gm']]], + ['is_5fconstant',['is_constant',['../structstan_1_1is__constant.html',1,'stan']]], + ['is_5fconstant_5fstruct',['is_constant_struct',['../structstan_1_1is__constant__struct.html',1,'stan']]], + ['is_5fconstant_5fstruct_3c_20eigen_3a_3ablock_3c_20t_20_3e_20_3e',['is_constant_struct< Eigen::Block< T > >',['../structstan_1_1is__constant__struct_3_01_eigen_1_1_block_3_01_t_01_4_01_4.html',1,'stan']]], + ['is_5fconstant_5fstruct_3c_20eigen_3a_3amatrix_3c_20t_2c_20r_2c_20c_20_3e_20_3e',['is_constant_struct< Eigen::Matrix< T, R, C > >',['../structstan_1_1is__constant__struct_3_01_eigen_1_1_matrix_3_01_t_00_01_r_00_01_c_01_4_01_4.html',1,'stan']]], + ['is_5fconstant_5fstruct_3c_20std_3a_3avector_3c_20t_20_3e_20_3e',['is_constant_struct< std::vector< T > >',['../structstan_1_1is__constant__struct_3_01std_1_1vector_3_01_t_01_4_01_4.html',1,'stan']]], + ['is_5ffvar',['is_fvar',['../structstan_1_1is__fvar.html',1,'stan']]], + ['is_5ffvar_3c_20stan_3a_3aagrad_3a_3afvar_3c_20t_20_3e_20_3e',['is_fvar< stan::agrad::fvar< T > >',['../structstan_1_1is__fvar_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html',1,'stan']]], + ['is_5fnil_5fop',['is_nil_op',['../structstan_1_1gm_1_1is__nil__op.html',1,'stan::gm']]], + ['is_5fvar',['is_var',['../structstan_1_1is__var.html',1,'stan']]], + ['is_5fvar_3c_20stan_3a_3aagrad_3a_3avar_20_3e',['is_var< stan::agrad::var >',['../structstan_1_1is__var_3_01stan_1_1agrad_1_1var_01_4.html',1,'stan']]], + ['is_5fvar_5for_5farithmetic',['is_var_or_arithmetic',['../structstan_1_1is__var__or__arithmetic.html',1,'stan']]], + ['is_5fvector',['is_vector',['../structstan_1_1is__vector.html',1,'stan']]], + ['is_5fvector_3c_20const_20t_20_3e',['is_vector< const T >',['../structstan_1_1is__vector_3_01const_01_t_01_4.html',1,'stan']]], + ['is_5fvector_3c_20eigen_3a_3amatrix_3c_20t_2c_201_2c_20eigen_3a_3adynamic_20_3e_20_3e',['is_vector< Eigen::Matrix< T, 1, Eigen::Dynamic > >',['../structstan_1_1is__vector_3_01_eigen_1_1_matrix_3_01_t_00_011_00_01_eigen_1_1_dynamic_01_4_01_4.html',1,'stan']]], + ['is_5fvector_3c_20eigen_3a_3amatrix_3c_20t_2c_20eigen_3a_3adynamic_2c_201_20_3e_20_3e',['is_vector< Eigen::Matrix< T, Eigen::Dynamic, 1 > >',['../structstan_1_1is__vector_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_011_01_4_01_4.html',1,'stan']]], + ['is_5fvector_3c_20std_3a_3avector_3c_20t_20_3e_20_3e',['is_vector< std::vector< T > >',['../structstan_1_1is__vector_3_01std_1_1vector_3_01_t_01_4_01_4.html',1,'stan']]], + ['is_5fvector_5flike',['is_vector_like',['../structstan_1_1is__vector__like.html',1,'stan']]], + ['is_5fvector_5flike_3c_20const_20t_20_3e',['is_vector_like< const T >',['../structstan_1_1is__vector__like_3_01const_01_t_01_4.html',1,'stan']]], + ['is_5fvector_5flike_3c_20eigen_3a_3amatrix_3c_20t_2c_20eigen_3a_3adynamic_2c_20eigen_3a_3adynamic_20_3e_20_3e',['is_vector_like< Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > >',['../structstan_1_1is__vector__like_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4.html',1,'stan']]], + ['is_5fvector_5flike_3c_20t_20_2a_20_3e',['is_vector_like< T * >',['../structstan_1_1is__vector__like_3_01_t_01_5_01_4.html',1,'stan']]] +]; diff --git a/doc/api/html/search/classes_6c.html b/doc/api/html/search/classes_6c.html new file mode 100644 index 00000000000..9991e053932 --- /dev/null +++ b/doc/api/html/search/classes_6c.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/classes_6c.js b/doc/api/html/search/classes_6c.js new file mode 100644 index 00000000000..201af6a6b7c --- /dev/null +++ b/doc/api/html/search/classes_6c.js @@ -0,0 +1,10 @@ +var searchData= +[ + ['ldlt_5ffactor',['LDLT_factor',['../class_l_d_l_t__factor.html',1,'']]], + ['ldlt_5ffactor_3c_20double_2c_20r_2c_20c_20_3e',['LDLT_factor< double, R, C >',['../classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4.html',1,'stan::math']]], + ['ldlt_5ffactor_3c_20stan_3a_3aagrad_3a_3avar_2c_20r_2c_20c_20_3e',['LDLT_factor< stan::agrad::var, R, C >',['../classstan_1_1math_1_1_l_d_l_t__factor_3_01stan_1_1agrad_1_1var_00_01_r_00_01_c_01_4.html',1,'stan::math']]], + ['left_5fdivision_5fexpr',['left_division_expr',['../structstan_1_1gm_1_1left__division__expr.html',1,'stan::gm']]], + ['list_5fargument',['list_argument',['../classstan_1_1gm_1_1list__argument.html',1,'stan::gm']]], + ['local_5fvar_5fdecl_5fvisgen',['local_var_decl_visgen',['../structstan_1_1gm_1_1local__var__decl__visgen.html',1,'stan::gm']]], + ['logical_5fnegate_5fexpr',['logical_negate_expr',['../structstan_1_1gm_1_1logical__negate__expr.html',1,'stan::gm']]] +]; diff --git a/doc/api/html/search/classes_6d.html b/doc/api/html/search/classes_6d.html new file mode 100644 index 00000000000..abe6f0d1df4 --- /dev/null +++ b/doc/api/html/search/classes_6d.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/classes_6d.js b/doc/api/html/search/classes_6d.js new file mode 100644 index 00000000000..61c571568b7 --- /dev/null +++ b/doc/api/html/search/classes_6d.js @@ -0,0 +1,8 @@ +var searchData= +[ + ['matrix_5fvar_5fdecl',['matrix_var_decl',['../structstan_1_1gm_1_1matrix__var__decl.html',1,'stan::gm']]], + ['mcmc_5fwriter',['mcmc_writer',['../classstan_1_1io_1_1mcmc__writer.html',1,'stan::io']]], + ['member_5fvar_5fdecl_5fvisgen',['member_var_decl_visgen',['../structstan_1_1gm_1_1member__var__decl__visgen.html',1,'stan::gm']]], + ['modeladaptor',['ModelAdaptor',['../classstan_1_1optimization_1_1_model_adaptor.html',1,'stan::optimization']]], + ['multiplication_5fexpr',['multiplication_expr',['../structstan_1_1gm_1_1multiplication__expr.html',1,'stan::gm']]] +]; diff --git a/doc/api/html/search/classes_6e.html b/doc/api/html/search/classes_6e.html new file mode 100644 index 00000000000..44803baa4b9 --- /dev/null +++ b/doc/api/html/search/classes_6e.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/classes_6e.js b/doc/api/html/search/classes_6e.js new file mode 100644 index 00000000000..852b5677e38 --- /dev/null +++ b/doc/api/html/search/classes_6e.js @@ -0,0 +1,12 @@ +var searchData= +[ + ['name_5fvis',['name_vis',['../structstan_1_1gm_1_1name__vis.html',1,'stan::gm']]], + ['negate_5fexpr',['negate_expr',['../structstan_1_1gm_1_1negate__expr.html',1,'stan::gm']]], + ['nesterovgradient',['NesterovGradient',['../classstan_1_1optimization_1_1_nesterov_gradient.html',1,'stan::optimization']]], + ['nil',['nil',['../structstan_1_1gm_1_1nil.html',1,'stan::gm']]], + ['no_5fop_5fstatement',['no_op_statement',['../structstan_1_1gm_1_1no__op__statement.html',1,'stan::gm']]], + ['numeric_5flimits_3c_20stan_3a_3aagrad_3a_3afvar_3c_20t_20_3e_20_3e',['numeric_limits< stan::agrad::fvar< T > >',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html',1,'std']]], + ['numeric_5flimits_3c_20stan_3a_3aagrad_3a_3avar_20_3e',['numeric_limits< stan::agrad::var >',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html',1,'std']]], + ['numtraits_3c_20stan_3a_3aagrad_3a_3avar_20_3e',['NumTraits< stan::agrad::var >',['../struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html',1,'Eigen']]], + ['nuts_5futil',['nuts_util',['../structstan_1_1mcmc_1_1nuts__util.html',1,'stan::mcmc']]] +]; diff --git a/doc/api/html/search/classes_6f.html b/doc/api/html/search/classes_6f.html new file mode 100644 index 00000000000..926dcfcf421 --- /dev/null +++ b/doc/api/html/search/classes_6f.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/classes_6f.js b/doc/api/html/search/classes_6f.js new file mode 100644 index 00000000000..3dfc4d22dd2 --- /dev/null +++ b/doc/api/html/search/classes_6f.js @@ -0,0 +1,18 @@ +var searchData= +[ + ['op_5fddv_5fvari',['op_ddv_vari',['../classstan_1_1agrad_1_1op__ddv__vari.html',1,'stan::agrad']]], + ['op_5fdv_5fvari',['op_dv_vari',['../classstan_1_1agrad_1_1op__dv__vari.html',1,'stan::agrad']]], + ['op_5fdvd_5fvari',['op_dvd_vari',['../classstan_1_1agrad_1_1op__dvd__vari.html',1,'stan::agrad']]], + ['op_5fdvv_5fvari',['op_dvv_vari',['../classstan_1_1agrad_1_1op__dvv__vari.html',1,'stan::agrad']]], + ['op_5fmatrix_5fvari',['op_matrix_vari',['../classstan_1_1agrad_1_1op__matrix__vari.html',1,'stan::agrad']]], + ['op_5fv_5fvari',['op_v_vari',['../classstan_1_1agrad_1_1op__v__vari.html',1,'stan::agrad']]], + ['op_5fvd_5fvari',['op_vd_vari',['../classstan_1_1agrad_1_1op__vd__vari.html',1,'stan::agrad']]], + ['op_5fvdd_5fvari',['op_vdd_vari',['../classstan_1_1agrad_1_1op__vdd__vari.html',1,'stan::agrad']]], + ['op_5fvdv_5fvari',['op_vdv_vari',['../classstan_1_1agrad_1_1op__vdv__vari.html',1,'stan::agrad']]], + ['op_5fvector_5fvari',['op_vector_vari',['../classstan_1_1agrad_1_1op__vector__vari.html',1,'stan::agrad']]], + ['op_5fvv_5fvari',['op_vv_vari',['../classstan_1_1agrad_1_1op__vv__vari.html',1,'stan::agrad']]], + ['op_5fvvd_5fvari',['op_vvd_vari',['../classstan_1_1agrad_1_1op__vvd__vari.html',1,'stan::agrad']]], + ['op_5fvvv_5fvari',['op_vvv_vari',['../classstan_1_1agrad_1_1op__vvv__vari.html',1,'stan::agrad']]], + ['operandsandpartials',['OperandsAndPartials',['../structstan_1_1agrad_1_1_operands_and_partials.html',1,'stan::agrad']]], + ['ordered_5fvar_5fdecl',['ordered_var_decl',['../structstan_1_1gm_1_1ordered__var__decl.html',1,'stan::gm']]] +]; diff --git a/doc/api/html/search/classes_70.html b/doc/api/html/search/classes_70.html new file mode 100644 index 00000000000..e4b52087496 --- /dev/null +++ b/doc/api/html/search/classes_70.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/classes_70.js b/doc/api/html/search/classes_70.js new file mode 100644 index 00000000000..fe5d273c041 --- /dev/null +++ b/doc/api/html/search/classes_70.js @@ -0,0 +1,22 @@ +var searchData= +[ + ['partials_5fvari',['partials_vari',['../classstan_1_1agrad_1_1partials__vari.html',1,'stan::agrad']]], + ['pass_5ftype',['pass_type',['../structstan_1_1math_1_1pass__type.html',1,'stan::math']]], + ['pass_5ftype_3c_20double_20_3e',['pass_type< double >',['../structstan_1_1math_1_1pass__type_3_01double_01_4.html',1,'stan::math']]], + ['pass_5ftype_3c_20int_20_3e',['pass_type< int >',['../structstan_1_1math_1_1pass__type_3_01int_01_4.html',1,'stan::math']]], + ['positive_5fordered_5fvar_5fdecl',['positive_ordered_var_decl',['../structstan_1_1gm_1_1positive__ordered__var__decl.html',1,'stan::gm']]], + ['precomp_5fv_5fvari',['precomp_v_vari',['../classstan_1_1agrad_1_1precomp__v__vari.html',1,'stan::agrad']]], + ['print_5fstatement',['print_statement',['../structstan_1_1gm_1_1print__statement.html',1,'stan::gm']]], + ['printable',['printable',['../structstan_1_1gm_1_1printable.html',1,'stan::gm']]], + ['printable_5fvisgen',['printable_visgen',['../structstan_1_1gm_1_1printable__visgen.html',1,'stan::gm']]], + ['prob_5fgrad',['prob_grad',['../classstan_1_1model_1_1prob__grad.html',1,'stan::model']]], + ['program',['program',['../structstan_1_1gm_1_1program.html',1,'stan::gm']]], + ['program_5fgrammar',['program_grammar',['../structstan_1_1gm_1_1program__grammar.html',1,'stan::gm']]], + ['promoter',['promoter',['../structstan_1_1math_1_1promoter.html',1,'stan::math']]], + ['promoter_3c_20eigen_3a_3amatrix_3c_20f_2c_20r_2c_20c_20_3e_2c_20eigen_3a_3amatrix_3c_20t_2c_20r_2c_20c_20_3e_20_3e',['promoter< Eigen::Matrix< F, R, C >, Eigen::Matrix< T, R, C > >',['../structstan_1_1math_1_1promoter_3_01_eigen_1_1_matrix_3_01_f_00_01_r_00_01_c_01_4_00_01_eigen_1_142b48fda94601374e41a81325f3f7b84.html',1,'stan::math']]], + ['promoter_3c_20eigen_3a_3amatrix_3c_20t_2c_20r_2c_20c_20_3e_2c_20eigen_3a_3amatrix_3c_20t_2c_20r_2c_20c_20_3e_20_3e',['promoter< Eigen::Matrix< T, R, C >, Eigen::Matrix< T, R, C > >',['../structstan_1_1math_1_1promoter_3_01_eigen_1_1_matrix_3_01_t_00_01_r_00_01_c_01_4_00_01_eigen_1_12d7fadf0560f1f2f3abc5388b7666f9c.html',1,'stan::math']]], + ['promoter_3c_20std_3a_3avector_3c_20f_20_3e_2c_20std_3a_3avector_3c_20t_20_3e_20_3e',['promoter< std::vector< F >, std::vector< T > >',['../structstan_1_1math_1_1promoter_3_01std_1_1vector_3_01_f_01_4_00_01std_1_1vector_3_01_t_01_4_01_4.html',1,'stan::math']]], + ['promoter_3c_20std_3a_3avector_3c_20t_20_3e_2c_20std_3a_3avector_3c_20t_20_3e_20_3e',['promoter< std::vector< T >, std::vector< T > >',['../structstan_1_1math_1_1promoter_3_01std_1_1vector_3_01_t_01_4_00_01std_1_1vector_3_01_t_01_4_01_4.html',1,'stan::math']]], + ['promoter_3c_20t_2c_20t_20_3e',['promoter< T, T >',['../structstan_1_1math_1_1promoter_3_01_t_00_01_t_01_4.html',1,'stan::math']]], + ['ps_5fpoint',['ps_point',['../classstan_1_1mcmc_1_1ps__point.html',1,'stan::mcmc']]] +]; diff --git a/doc/api/html/search/classes_72.html b/doc/api/html/search/classes_72.html new file mode 100644 index 00000000000..0d0ddb4eb72 --- /dev/null +++ b/doc/api/html/search/classes_72.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/classes_72.js b/doc/api/html/search/classes_72.js new file mode 100644 index 00000000000..712e40c0c91 --- /dev/null +++ b/doc/api/html/search/classes_72.js @@ -0,0 +1,39 @@ +var searchData= +[ + ['range',['range',['../structstan_1_1gm_1_1range.html',1,'stan::gm']]], + ['reader',['reader',['../classstan_1_1io_1_1reader.html',1,'stan::io']]], + ['remove_5floop_5fidentifier',['remove_loop_identifier',['../structstan_1_1gm_1_1remove__loop__identifier.html',1,'stan::gm']]], + ['result',['result',['../structstan_1_1gm_1_1transpose__expr_1_1result.html',1,'stan::gm::transpose_expr']]], + ['result',['result',['../structstan_1_1gm_1_1left__division__expr_1_1result.html',1,'stan::gm::left_division_expr']]], + ['result',['result',['../structstan_1_1gm_1_1add__while__body_1_1result.html',1,'stan::gm::add_while_body']]], + ['result',['result',['../structstan_1_1gm_1_1validate__int__expr3_1_1result.html',1,'stan::gm::validate_int_expr3']]], + ['result',['result',['../structstan_1_1gm_1_1set__var__type_1_1result.html',1,'stan::gm::set_var_type']]], + ['result',['result',['../structstan_1_1gm_1_1add__expression__dimss_1_1result.html',1,'stan::gm::add_expression_dimss']]], + ['result',['result',['../structstan_1_1gm_1_1logical__negate__expr_1_1result.html',1,'stan::gm::logical_negate_expr']]], + ['result',['result',['../structstan_1_1gm_1_1elt__division__expr_1_1result.html',1,'stan::gm::elt_division_expr']]], + ['result',['result',['../structstan_1_1gm_1_1elt__multiplication__expr_1_1result.html',1,'stan::gm::elt_multiplication_expr']]], + ['result',['result',['../structstan_1_1gm_1_1validate__int__expr2_1_1result.html',1,'stan::gm::validate_int_expr2']]], + ['result',['result',['../structstan_1_1gm_1_1division__expr_1_1result.html',1,'stan::gm::division_expr']]], + ['result',['result',['../structstan_1_1gm_1_1multiplication__expr_1_1result.html',1,'stan::gm::multiplication_expr']]], + ['result',['result',['../structstan_1_1gm_1_1validate__sample_1_1result.html',1,'stan::gm::validate_sample']]], + ['result',['result',['../structstan_1_1gm_1_1negate__expr_1_1result.html',1,'stan::gm::negate_expr']]], + ['result',['result',['../structstan_1_1gm_1_1subtraction__expr_1_1result.html',1,'stan::gm::subtraction_expr']]], + ['result',['result',['../structstan_1_1gm_1_1set__fun__type_1_1result.html',1,'stan::gm::set_fun_type']]], + ['result',['result',['../structstan_1_1gm_1_1validate__expr__type2_1_1result.html',1,'stan::gm::validate_expr_type2']]], + ['result',['result',['../structstan_1_1gm_1_1unscope__locals_1_1result.html',1,'stan::gm::unscope_locals']]], + ['result',['result',['../structstan_1_1gm_1_1add__loop__identifier_1_1result.html',1,'stan::gm::add_loop_identifier']]], + ['result',['result',['../structstan_1_1gm_1_1add__conditional__body_1_1result.html',1,'stan::gm::add_conditional_body']]], + ['result',['result',['../structstan_1_1gm_1_1add__conditional__condition_1_1result.html',1,'stan::gm::add_conditional_condition']]], + ['result',['result',['../structstan_1_1gm_1_1addition__expr_1_1result.html',1,'stan::gm::addition_expr']]], + ['result',['result',['../structstan_1_1gm_1_1validate__assignment_1_1result.html',1,'stan::gm::validate_assignment']]], + ['result',['result',['../structstan_1_1gm_1_1binary__op__expr_1_1result.html',1,'stan::gm::binary_op_expr']]], + ['result',['result',['../structstan_1_1gm_1_1set__fun__type2_1_1result.html',1,'stan::gm::set_fun_type2']]], + ['result',['result',['../structstan_1_1gm_1_1remove__loop__identifier_1_1result.html',1,'stan::gm::remove_loop_identifier']]], + ['result',['result',['../structstan_1_1gm_1_1validate__expr__type_1_1result.html',1,'stan::gm::validate_expr_type']]], + ['result',['result',['../structstan_1_1gm_1_1expression__as__statement_1_1result.html',1,'stan::gm::expression_as_statement']]], + ['result',['result',['../structstan_1_1gm_1_1add__while__condition_1_1result.html',1,'stan::gm::add_while_condition']]], + ['result',['result',['../structstan_1_1gm_1_1validate__allow__sample_1_1result.html',1,'stan::gm::validate_allow_sample']]], + ['result',['result',['../structstan_1_1gm_1_1set__fun__type__named_1_1result.html',1,'stan::gm::set_fun_type_named']]], + ['return_5ftype',['return_type',['../structstan_1_1return__type.html',1,'stan']]], + ['row_5fvector_5fvar_5fdecl',['row_vector_var_decl',['../structstan_1_1gm_1_1row__vector__var__decl.html',1,'stan::gm']]] +]; diff --git a/doc/api/html/search/classes_73.html b/doc/api/html/search/classes_73.html new file mode 100644 index 00000000000..a1bf0b912de --- /dev/null +++ b/doc/api/html/search/classes_73.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/classes_73.js b/doc/api/html/search/classes_73.js new file mode 100644 index 00000000000..d5a66910c3c --- /dev/null +++ b/doc/api/html/search/classes_73.js @@ -0,0 +1,57 @@ +var searchData= +[ + ['sample',['sample',['../structstan_1_1gm_1_1sample.html',1,'stan::gm']]], + ['sample',['sample',['../classstan_1_1mcmc_1_1sample.html',1,'stan::mcmc']]], + ['scalar_5fproduct_5ftraits_3c_20double_2c_20stan_3a_3aagrad_3a_3avar_20_3e',['scalar_product_traits< double, stan::agrad::var >',['../struct_eigen_1_1internal_1_1scalar__product__traits_3_01double_00_01stan_1_1agrad_1_1var_01_4.html',1,'Eigen::internal']]], + ['scalar_5fproduct_5ftraits_3c_20stan_3a_3aagrad_3a_3avar_2c_20double_20_3e',['scalar_product_traits< stan::agrad::var, double >',['../struct_eigen_1_1internal_1_1scalar__product__traits_3_01stan_1_1agrad_1_1var_00_01double_01_4.html',1,'Eigen::internal']]], + ['scalar_5ftype',['scalar_type',['../structstan_1_1scalar__type.html',1,'stan']]], + ['scalar_5ftype_3c_20eigen_3a_3amatrix_3c_20t_2c_20eigen_3a_3adynamic_2c_20eigen_3a_3adynamic_20_3e_20_3e',['scalar_type< Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > >',['../structstan_1_1scalar__type_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4.html',1,'stan']]], + ['scalar_5ftype_3c_20t_20_2a_20_3e',['scalar_type< T * >',['../structstan_1_1scalar__type_3_01_t_01_5_01_4.html',1,'stan']]], + ['seq_5fview',['seq_view',['../classstan_1_1math_1_1seq__view.html',1,'stan::math']]], + ['seq_5fview_3c_20double_2c_20std_3a_3avector_3c_20int_20_3e_20_3e',['seq_view< double, std::vector< int > >',['../classstan_1_1math_1_1seq__view_3_01double_00_01std_1_1vector_3_01int_01_4_01_4.html',1,'stan::math']]], + ['seq_5fview_3c_20t_2c_20eigen_3a_3amatrix_3c_20s_2c_201_2c_20eigen_3a_3adynamic_20_3e_20_3e',['seq_view< T, Eigen::Matrix< S, 1, Eigen::Dynamic > >',['../classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_011_00_01_eigen_1_1_dynamic_01_4_01_4.html',1,'stan::math']]], + ['seq_5fview_3c_20t_2c_20eigen_3a_3amatrix_3c_20s_2c_20eigen_3a_3adynamic_2c_201_20_3e_20_3e',['seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, 1 > >',['../classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_01_eigen_1_1_dynamic_00_011_01_4_01_4.html',1,'stan::math']]], + ['seq_5fview_3c_20t_2c_20eigen_3a_3amatrix_3c_20s_2c_20eigen_3a_3adynamic_2c_20eigen_3a_3adynamic_20_3e_20_3e',['seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, Eigen::Dynamic > >',['../classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4.html',1,'stan::math']]], + ['seq_5fview_3c_20t_2c_20std_3a_3avector_3c_20s_20_3e_20_3e',['seq_view< T, std::vector< S > >',['../classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01_s_01_4_01_4.html',1,'stan::math']]], + ['seq_5fview_3c_20t_2c_20std_3a_3avector_3c_20std_3a_3avector_3c_20t_20_3e_20_3e_20_3e',['seq_view< T, std::vector< std::vector< T > > >',['../classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01std_1_1vector_3_01_t_01_4_01_4_01_4.html',1,'stan::math']]], + ['seq_5fview_3c_20t_2c_20std_3a_3avector_3c_20t_20_3e_20_3e',['seq_view< T, std::vector< T > >',['../classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01_t_01_4_01_4.html',1,'stan::math']]], + ['set_5ffun_5ftype',['set_fun_type',['../structstan_1_1gm_1_1set__fun__type.html',1,'stan::gm']]], + ['set_5ffun_5ftype2',['set_fun_type2',['../structstan_1_1gm_1_1set__fun__type2.html',1,'stan::gm']]], + ['set_5ffun_5ftype_5fnamed',['set_fun_type_named',['../structstan_1_1gm_1_1set__fun__type__named.html',1,'stan::gm']]], + ['set_5fparam_5franges_5fvisgen',['set_param_ranges_visgen',['../structstan_1_1gm_1_1set__param__ranges__visgen.html',1,'stan::gm']]], + ['set_5fvar_5ftype',['set_var_type',['../structstan_1_1gm_1_1set__var__type.html',1,'stan::gm']]], + ['significant_5fdecimals_5fdefault_5fimpl_3c_20stan_3a_3aagrad_3a_3avar_2c_20false_20_3e',['significant_decimals_default_impl< stan::agrad::var, false >',['../struct_eigen_1_1internal_1_1significant__decimals__default__impl_3_01stan_1_1agrad_1_1var_00_01false_01_4.html',1,'Eigen::internal']]], + ['simplex_5fvar_5fdecl',['simplex_var_decl',['../structstan_1_1gm_1_1simplex__var__decl.html',1,'stan::gm']]], + ['singleton_5fargument',['singleton_argument',['../classstan_1_1gm_1_1singleton__argument.html',1,'stan::gm']]], + ['size_5fof_5fhelper',['size_of_helper',['../structstan_1_1size__of__helper.html',1,'stan']]], + ['size_5fof_5fhelper_3c_20t_2c_20true_20_3e',['size_of_helper< T, true >',['../structstan_1_1size__of__helper_3_01_t_00_01true_01_4.html',1,'stan']]], + ['stack_5falloc',['stack_alloc',['../classstan_1_1memory_1_1stack__alloc.html',1,'stan::memory']]], + ['stan_5fcsv',['stan_csv',['../structstan_1_1io_1_1stan__csv.html',1,'stan::io']]], + ['stan_5fcsv_5fadaptation',['stan_csv_adaptation',['../structstan_1_1io_1_1stan__csv__adaptation.html',1,'stan::io']]], + ['stan_5fcsv_5fmetadata',['stan_csv_metadata',['../structstan_1_1io_1_1stan__csv__metadata.html',1,'stan::io']]], + ['stan_5fcsv_5freader',['stan_csv_reader',['../classstan_1_1io_1_1stan__csv__reader.html',1,'stan::io']]], + ['stan_5fcsv_5ftiming',['stan_csv_timing',['../structstan_1_1io_1_1stan__csv__timing.html',1,'stan::io']]], + ['statement',['statement',['../structstan_1_1gm_1_1statement.html',1,'stan::gm']]], + ['statement_5f2_5fgrammar',['statement_2_grammar',['../structstan_1_1gm_1_1statement__2__grammar.html',1,'stan::gm']]], + ['statement_5fgrammar',['statement_grammar',['../structstan_1_1gm_1_1statement__grammar.html',1,'stan::gm']]], + ['statement_5fgrammar',['statement_grammar',['../structstatement__grammar.html',1,'']]], + ['statement_5fvisgen',['statement_visgen',['../structstan_1_1gm_1_1statement__visgen.html',1,'stan::gm']]], + ['statements',['statements',['../structstan_1_1gm_1_1statements.html',1,'stan::gm']]], + ['stepsize_5fadaptation',['stepsize_adaptation',['../classstan_1_1mcmc_1_1stepsize__adaptation.html',1,'stan::mcmc']]], + ['stepsize_5fadapter',['stepsize_adapter',['../classstan_1_1mcmc_1_1stepsize__adapter.html',1,'stan::mcmc']]], + ['stepsize_5fcovar_5fadapter',['stepsize_covar_adapter',['../classstan_1_1mcmc_1_1stepsize__covar__adapter.html',1,'stan::mcmc']]], + ['stepsize_5fvar_5fadapter',['stepsize_var_adapter',['../classstan_1_1mcmc_1_1stepsize__var__adapter.html',1,'stan::mcmc']]], + ['store_5ftype',['store_type',['../structstan_1_1math_1_1store__type.html',1,'stan::math']]], + ['store_5ftype_3c_20double_20_3e',['store_type< double >',['../structstan_1_1math_1_1store__type_3_01double_01_4.html',1,'stan::math']]], + ['store_5ftype_3c_20eigen_3a_3amatrix_3c_20s_2c_201_2c_20eigen_3a_3adynamic_20_3e_20_3e',['store_type< Eigen::Matrix< S, 1, Eigen::Dynamic > >',['../structstan_1_1math_1_1store__type.html',1,'stan::math']]], + ['store_5ftype_3c_20eigen_3a_3amatrix_3c_20s_2c_20eigen_3a_3adynamic_2c_201_20_3e_20_3e',['store_type< Eigen::Matrix< S, Eigen::Dynamic, 1 > >',['../structstan_1_1math_1_1store__type.html',1,'stan::math']]], + ['store_5ftype_3c_20eigen_3a_3amatrix_3c_20s_2c_20eigen_3a_3adynamic_2c_20eigen_3a_3adynamic_20_3e_20_3e',['store_type< Eigen::Matrix< S, Eigen::Dynamic, Eigen::Dynamic > >',['../structstan_1_1math_1_1store__type.html',1,'stan::math']]], + ['store_5ftype_3c_20int_20_3e',['store_type< int >',['../structstan_1_1math_1_1store__type_3_01int_01_4.html',1,'stan::math']]], + ['store_5ftype_3c_20s_20_3e',['store_type< S >',['../structstan_1_1math_1_1store__type.html',1,'stan::math']]], + ['store_5ftype_3c_20std_3a_3avector_3c_20int_20_3e_20_3e',['store_type< std::vector< int > >',['../structstan_1_1math_1_1store__type.html',1,'stan::math']]], + ['store_5ftype_3c_20std_3a_3avector_3c_20s_20_3e_20_3e',['store_type< std::vector< S > >',['../structstan_1_1math_1_1store__type.html',1,'stan::math']]], + ['store_5ftype_3c_20std_3a_3avector_3c_20std_3a_3avector_3c_20t_20_3e_20_3e_20_3e',['store_type< std::vector< std::vector< T > > >',['../structstan_1_1math_1_1store__type.html',1,'stan::math']]], + ['store_5ftype_3c_20std_3a_3avector_3c_20t_20_3e_20_3e',['store_type< std::vector< T > >',['../structstan_1_1math_1_1store__type.html',1,'stan::math']]], + ['stored_5fgradient_5fvari',['stored_gradient_vari',['../classstan_1_1agrad_1_1stored__gradient__vari.html',1,'stan::agrad']]], + ['subtraction_5fexpr',['subtraction_expr',['../structstan_1_1gm_1_1subtraction__expr.html',1,'stan::gm']]] +]; diff --git a/doc/api/html/search/classes_74.html b/doc/api/html/search/classes_74.html new file mode 100644 index 00000000000..f7f27cea727 --- /dev/null +++ b/doc/api/html/search/classes_74.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/classes_74.js b/doc/api/html/search/classes_74.js new file mode 100644 index 00000000000..8824b6bda57 --- /dev/null +++ b/doc/api/html/search/classes_74.js @@ -0,0 +1,12 @@ +var searchData= +[ + ['term_5fgrammar',['term_grammar',['../structterm__grammar.html',1,'term_grammar< Iterator >'],['../structterm__grammar.html',1,'term_grammar< Iterator >']]], + ['term_5fgrammar',['term_grammar',['../structstan_1_1gm_1_1term__grammar.html',1,'stan::gm']]], + ['transpose_5fexpr',['transpose_expr',['../structstan_1_1gm_1_1transpose__expr.html',1,'stan::gm']]], + ['type_5fname',['type_name',['../structstan_1_1gm_1_1type__name.html',1,'stan::gm']]], + ['type_5fname_3c_20bool_20_3e',['type_name< bool >',['../structstan_1_1gm_1_1type__name_3_01bool_01_4.html',1,'stan::gm']]], + ['type_5fname_3c_20double_20_3e',['type_name< double >',['../structstan_1_1gm_1_1type__name_3_01double_01_4.html',1,'stan::gm']]], + ['type_5fname_3c_20int_20_3e',['type_name< int >',['../structstan_1_1gm_1_1type__name_3_01int_01_4.html',1,'stan::gm']]], + ['type_5fname_3c_20std_3a_3astring_20_3e',['type_name< std::string >',['../structstan_1_1gm_1_1type__name_3_01std_1_1string_01_4.html',1,'stan::gm']]], + ['type_5fname_3c_20unsigned_20int_20_3e',['type_name< unsigned int >',['../structstan_1_1gm_1_1type__name_3_01unsigned_01int_01_4.html',1,'stan::gm']]] +]; diff --git a/doc/api/html/search/classes_75.html b/doc/api/html/search/classes_75.html new file mode 100644 index 00000000000..807d7426e6c --- /dev/null +++ b/doc/api/html/search/classes_75.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/classes_75.js b/doc/api/html/search/classes_75.js new file mode 100644 index 00000000000..50c6297eff7 --- /dev/null +++ b/doc/api/html/search/classes_75.js @@ -0,0 +1,12 @@ +var searchData= +[ + ['unary_5fop',['unary_op',['../structstan_1_1gm_1_1unary__op.html',1,'stan::gm']]], + ['unconstrained_5fparam_5fnames_5fvisgen',['unconstrained_param_names_visgen',['../structstan_1_1gm_1_1unconstrained__param__names__visgen.html',1,'stan::gm']]], + ['unit_5fe_5fmetric',['unit_e_metric',['../classstan_1_1mcmc_1_1unit__e__metric.html',1,'stan::mcmc']]], + ['unit_5fe_5fnuts',['unit_e_nuts',['../classstan_1_1mcmc_1_1unit__e__nuts.html',1,'stan::mcmc']]], + ['unit_5fe_5fpoint',['unit_e_point',['../classstan_1_1mcmc_1_1unit__e__point.html',1,'stan::mcmc']]], + ['unit_5fe_5fstatic_5fhmc',['unit_e_static_hmc',['../classstan_1_1mcmc_1_1unit__e__static__hmc.html',1,'stan::mcmc']]], + ['unit_5fvector_5fvar_5fdecl',['unit_vector_var_decl',['../structstan_1_1gm_1_1unit__vector__var__decl.html',1,'stan::gm']]], + ['unscope_5flocals',['unscope_locals',['../structstan_1_1gm_1_1unscope__locals.html',1,'stan::gm']]], + ['unvalued_5fargument',['unvalued_argument',['../classstan_1_1gm_1_1unvalued__argument.html',1,'stan::gm']]] +]; diff --git a/doc/api/html/search/classes_76.html b/doc/api/html/search/classes_76.html new file mode 100644 index 00000000000..f470eb97455 --- /dev/null +++ b/doc/api/html/search/classes_76.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/classes_76.js b/doc/api/html/search/classes_76.js new file mode 100644 index 00000000000..9b7a4451143 --- /dev/null +++ b/doc/api/html/search/classes_76.js @@ -0,0 +1,35 @@ +var searchData= +[ + ['validate_5fallow_5fsample',['validate_allow_sample',['../structstan_1_1gm_1_1validate__allow__sample.html',1,'stan::gm']]], + ['validate_5fassignment',['validate_assignment',['../structstan_1_1gm_1_1validate__assignment.html',1,'stan::gm']]], + ['validate_5fexpr_5ftype',['validate_expr_type',['../structstan_1_1gm_1_1validate__expr__type.html',1,'stan::gm']]], + ['validate_5fexpr_5ftype2',['validate_expr_type2',['../structstan_1_1gm_1_1validate__expr__type2.html',1,'stan::gm']]], + ['validate_5fint_5fexpr2',['validate_int_expr2',['../structstan_1_1gm_1_1validate__int__expr2.html',1,'stan::gm']]], + ['validate_5fint_5fexpr3',['validate_int_expr3',['../structstan_1_1gm_1_1validate__int__expr3.html',1,'stan::gm']]], + ['validate_5fsample',['validate_sample',['../structstan_1_1gm_1_1validate__sample.html',1,'stan::gm']]], + ['validate_5ftransformed_5fparams_5fvisgen',['validate_transformed_params_visgen',['../structstan_1_1gm_1_1validate__transformed__params__visgen.html',1,'stan::gm']]], + ['validate_5fvar_5fdecl_5fvisgen',['validate_var_decl_visgen',['../structstan_1_1gm_1_1validate__var__decl__visgen.html',1,'stan::gm']]], + ['valued_5fargument',['valued_argument',['../classstan_1_1gm_1_1valued__argument.html',1,'stan::gm']]], + ['var',['var',['../classstan_1_1agrad_1_1var.html',1,'stan::agrad']]], + ['var_5fadaptation',['var_adaptation',['../classstan_1_1mcmc_1_1var__adaptation.html',1,'stan::mcmc']]], + ['var_5fcontext',['var_context',['../classstan_1_1io_1_1var__context.html',1,'stan::io']]], + ['var_5fdecl',['var_decl',['../structstan_1_1gm_1_1var__decl.html',1,'stan::gm']]], + ['var_5fdecls_5fgrammar',['var_decls_grammar',['../structstan_1_1gm_1_1var__decls__grammar.html',1,'stan::gm']]], + ['var_5fresizing_5fvisgen',['var_resizing_visgen',['../structstan_1_1gm_1_1var__resizing__visgen.html',1,'stan::gm']]], + ['var_5fsize_5fvalidating_5fvisgen',['var_size_validating_visgen',['../structstan_1_1gm_1_1var__size__validating__visgen.html',1,'stan::gm']]], + ['vari',['vari',['../classstan_1_1agrad_1_1vari.html',1,'stan::agrad']]], + ['variable',['variable',['../structstan_1_1gm_1_1variable.html',1,'stan::gm']]], + ['variable_5fdims',['variable_dims',['../structstan_1_1gm_1_1variable__dims.html',1,'stan::gm']]], + ['variable_5fmap',['variable_map',['../structstan_1_1gm_1_1variable__map.html',1,'stan::gm']]], + ['vector_5fvar_5fdecl',['vector_var_decl',['../structstan_1_1gm_1_1vector__var__decl.html',1,'stan::gm']]], + ['vectorview',['VectorView',['../classstan_1_1_vector_view.html',1,'stan']]], + ['vectorview_3c_20const_20double_2c_20false_2c_20false_20_3e',['VectorView< const double, false, false >',['../classstan_1_1_vector_view_3_01const_01double_00_01false_00_01false_01_4.html',1,'stan']]], + ['vectorview_3c_20const_20t_2c_20is_5farray_2c_20throw_5fif_5faccessed_20_3e',['VectorView< const T, is_array, throw_if_accessed >',['../classstan_1_1_vector_view_3_01const_01_t_00_01is__array_00_01throw__if__accessed_01_4.html',1,'stan']]], + ['vectorview_3c_20double_20_2a_2c_20is_5fvector_3c_20t1_20_3e_3a_3avalue_2c_20is_5fconstant_5fstruct_3c_20t1_20_3e_3a_3avalue_20_3e',['VectorView< double *, is_vector< T1 >::value, is_constant_struct< T1 >::value >',['../classstan_1_1_vector_view.html',1,'stan']]], + ['vectorview_3c_20double_20_2a_2c_20is_5fvector_3c_20t2_20_3e_3a_3avalue_2c_20is_5fconstant_5fstruct_3c_20t2_20_3e_3a_3avalue_20_3e',['VectorView< double *, is_vector< T2 >::value, is_constant_struct< T2 >::value >',['../classstan_1_1_vector_view.html',1,'stan']]], + ['vectorview_3c_20double_20_2a_2c_20is_5fvector_3c_20t3_20_3e_3a_3avalue_2c_20is_5fconstant_5fstruct_3c_20t3_20_3e_3a_3avalue_20_3e',['VectorView< double *, is_vector< T3 >::value, is_constant_struct< T3 >::value >',['../classstan_1_1_vector_view.html',1,'stan']]], + ['vectorview_3c_20double_20_2a_2c_20is_5fvector_3c_20t4_20_3e_3a_3avalue_2c_20is_5fconstant_5fstruct_3c_20t4_20_3e_3a_3avalue_20_3e',['VectorView< double *, is_vector< T4 >::value, is_constant_struct< T4 >::value >',['../classstan_1_1_vector_view.html',1,'stan']]], + ['vectorview_3c_20double_20_2a_2c_20is_5fvector_3c_20t5_20_3e_3a_3avalue_2c_20is_5fconstant_5fstruct_3c_20t5_20_3e_3a_3avalue_20_3e',['VectorView< double *, is_vector< T5 >::value, is_constant_struct< T5 >::value >',['../classstan_1_1_vector_view.html',1,'stan']]], + ['vectorview_3c_20double_20_2a_2c_20is_5fvector_3c_20t6_20_3e_3a_3avalue_2c_20is_5fconstant_5fstruct_3c_20t6_20_3e_3a_3avalue_20_3e',['VectorView< double *, is_vector< T6 >::value, is_constant_struct< T6 >::value >',['../classstan_1_1_vector_view.html',1,'stan']]], + ['visgen',['visgen',['../structstan_1_1gm_1_1visgen.html',1,'stan::gm']]] +]; diff --git a/doc/api/html/search/classes_77.html b/doc/api/html/search/classes_77.html new file mode 100644 index 00000000000..e3967e97218 --- /dev/null +++ b/doc/api/html/search/classes_77.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/classes_77.js b/doc/api/html/search/classes_77.js new file mode 100644 index 00000000000..8b7637995b8 --- /dev/null +++ b/doc/api/html/search/classes_77.js @@ -0,0 +1,16 @@ +var searchData= +[ + ['welford_5fcovar_5festimator',['welford_covar_estimator',['../classstan_1_1prob_1_1welford__covar__estimator.html',1,'stan::prob']]], + ['welford_5fvar_5festimator',['welford_var_estimator',['../classstan_1_1prob_1_1welford__var__estimator.html',1,'stan::prob']]], + ['while_5fstatement',['while_statement',['../structstan_1_1gm_1_1while__statement.html',1,'stan::gm']]], + ['whitespace_5fgrammar',['whitespace_grammar',['../structstan_1_1gm_1_1whitespace__grammar.html',1,'stan::gm']]], + ['windowed_5fadaptation',['windowed_adaptation',['../classstan_1_1mcmc_1_1windowed__adaptation.html',1,'stan::mcmc']]], + ['write_5farray_5fvars_5fvisgen',['write_array_vars_visgen',['../structstan_1_1gm_1_1write__array__vars__visgen.html',1,'stan::gm']]], + ['write_5farray_5fvisgen',['write_array_visgen',['../structstan_1_1gm_1_1write__array__visgen.html',1,'stan::gm']]], + ['write_5fcsv_5fheader_5fvisgen',['write_csv_header_visgen',['../structstan_1_1gm_1_1write__csv__header__visgen.html',1,'stan::gm']]], + ['write_5fcsv_5fvars_5fvisgen',['write_csv_vars_visgen',['../structstan_1_1gm_1_1write__csv__vars__visgen.html',1,'stan::gm']]], + ['write_5fcsv_5fvisgen',['write_csv_visgen',['../structstan_1_1gm_1_1write__csv__visgen.html',1,'stan::gm']]], + ['write_5fdims_5fvisgen',['write_dims_visgen',['../structstan_1_1gm_1_1write__dims__visgen.html',1,'stan::gm']]], + ['write_5fparam_5fnames_5fvisgen',['write_param_names_visgen',['../structstan_1_1gm_1_1write__param__names__visgen.html',1,'stan::gm']]], + ['writer',['writer',['../classstan_1_1io_1_1writer.html',1,'stan::io']]] +]; diff --git a/doc/api/html/search/close.png b/doc/api/html/search/close.png new file mode 100644 index 0000000000000000000000000000000000000000..9342d3dfeea7b7c4ee610987e717804b5a42ceb9 GIT binary patch literal 273 zcmV+s0q*{ZP)4(RlMby96)VwnbG{ zbe&}^BDn7x>$<{ck4zAK-=nT;=hHG)kmplIF${xqm8db3oX6wT3bvp`TE@m0cg;b) zBuSL}5?N7O(iZLdAlz@)b)Rd~DnSsSX&P5qC`XwuFwcAYLC+d2>+1(8on;wpt8QIC X2MT$R4iQDd00000NkvXXu0mjfia~GN literal 0 HcmV?d00001 diff --git a/doc/api/html/search/defines_5f.html b/doc/api/html/search/defines_5f.html new file mode 100644 index 00000000000..548a824972f --- /dev/null +++ b/doc/api/html/search/defines_5f.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/defines_5f.js b/doc/api/html/search/defines_5f.js new file mode 100644 index 00000000000..6b2ad441877 --- /dev/null +++ b/doc/api/html/search/defines_5f.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['_5f_5fstan_5f_5fagrad_5f_5frev_5f_5fvar_5fstack_5fcpp_5f_5f',['__STAN__AGRAD__REV__VAR_STACK_CPP__',['../var__stack_8cpp.html#a3ecef594fdb031601452cf4e8ab29953',1,'var_stack.cpp']]], + ['_5f_5fstan_5f_5fgm_5f_5fast_5fdef_5fhpp_5f_5f',['__STAN__GM__AST_DEF_HPP__',['../ast__def_8cpp.html#a8d8277f93d7f31b96e2609f6388d6409',1,'ast_def.cpp']]] +]; diff --git a/doc/api/html/search/defines_64.html b/doc/api/html/search/defines_64.html new file mode 100644 index 00000000000..7b428bdb6bc --- /dev/null +++ b/doc/api/html/search/defines_64.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/defines_64.js b/doc/api/html/search/defines_64.js new file mode 100644 index 00000000000..034dc77b888 --- /dev/null +++ b/doc/api/html/search/defines_64.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['default_5finitial_5fnchunks',['DEFAULT_INITIAL_NCHUNKS',['../chunk__alloc_8hpp.html#a5f845c774e340bc6030d5ce15487812a',1,'chunk_alloc.hpp']]] +]; diff --git a/doc/api/html/search/defines_65.html b/doc/api/html/search/defines_65.html new file mode 100644 index 00000000000..f1906de5abf --- /dev/null +++ b/doc/api/html/search/defines_65.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/defines_65.js b/doc/api/html/search/defines_65.js new file mode 100644 index 00000000000..1d9a6417bbf --- /dev/null +++ b/doc/api/html/search/defines_65.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['eigen_5fdensebase_5fplugin',['EIGEN_DENSEBASE_PLUGIN',['../_eigen_8hpp.html#a90ac195153d63737038c5b747962f4df',1,'Eigen.hpp']]] +]; diff --git a/doc/api/html/search/defines_6c.html b/doc/api/html/search/defines_6c.html new file mode 100644 index 00000000000..c4bf65090cc --- /dev/null +++ b/doc/api/html/search/defines_6c.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/defines_6c.js b/doc/api/html/search/defines_6c.js new file mode 100644 index 00000000000..417315dc975 --- /dev/null +++ b/doc/api/html/search/defines_6c.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['likely',['likely',['../stack__alloc_8hpp.html#a217a0bd562b98ae8c2ffce44935351e1',1,'stack_alloc.hpp']]] +]; diff --git a/doc/api/html/search/defines_75.html b/doc/api/html/search/defines_75.html new file mode 100644 index 00000000000..7318a7abdc3 --- /dev/null +++ b/doc/api/html/search/defines_75.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/defines_75.js b/doc/api/html/search/defines_75.js new file mode 100644 index 00000000000..e8a6d42c38a --- /dev/null +++ b/doc/api/html/search/defines_75.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['unlikely',['unlikely',['../stack__alloc_8hpp.html#ac6c45889010c1bd68631771b64f18101',1,'stack_alloc.hpp']]] +]; diff --git a/doc/api/html/search/enumvalues_61.html b/doc/api/html/search/enumvalues_61.html new file mode 100644 index 00000000000..deef5919dc4 --- /dev/null +++ b/doc/api/html/search/enumvalues_61.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/enumvalues_61.js b/doc/api/html/search/enumvalues_61.js new file mode 100644 index 00000000000..83b9223a79b --- /dev/null +++ b/doc/api/html/search/enumvalues_61.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['addcost',['AddCost',['../struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html#a932a61195daad3e89711cfb02521cac9ad567631af797962bfa1646b3228b1d8d',1,'Eigen::NumTraits< stan::agrad::var >']]] +]; diff --git a/doc/api/html/search/enumvalues_63.html b/doc/api/html/search/enumvalues_63.html new file mode 100644 index 00000000000..7399d30c65e --- /dev/null +++ b/doc/api/html/search/enumvalues_63.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/enumvalues_63.js b/doc/api/html/search/enumvalues_63.js new file mode 100644 index 00000000000..54d9f4348f0 --- /dev/null +++ b/doc/api/html/search/enumvalues_63.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['config',['CONFIG',['../structstan_1_1gm_1_1error__codes.html#aa63873e8f7e9dd7f8af3502e4003292fa06ec7fc9f65aafc74d415edaba0a63bc',1,'stan::gm::error_codes']]] +]; diff --git a/doc/api/html/search/enumvalues_64.html b/doc/api/html/search/enumvalues_64.html new file mode 100644 index 00000000000..2cae30be6da --- /dev/null +++ b/doc/api/html/search/enumvalues_64.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/enumvalues_64.js b/doc/api/html/search/enumvalues_64.js new file mode 100644 index 00000000000..095d3bd1cdd --- /dev/null +++ b/doc/api/html/search/enumvalues_64.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['dataerr',['DATAERR',['../structstan_1_1gm_1_1error__codes.html#aa63873e8f7e9dd7f8af3502e4003292fa6b2a96b1b804a9792a1355d28cc9c44d',1,'stan::gm::error_codes']]] +]; diff --git a/doc/api/html/search/enumvalues_68.html b/doc/api/html/search/enumvalues_68.html new file mode 100644 index 00000000000..0f58de6c38b --- /dev/null +++ b/doc/api/html/search/enumvalues_68.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/enumvalues_68.js b/doc/api/html/search/enumvalues_68.js new file mode 100644 index 00000000000..af093574807 --- /dev/null +++ b/doc/api/html/search/enumvalues_68.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['hasfloatingpoint',['HasFloatingPoint',['../struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html#a932a61195daad3e89711cfb02521cac9a60d738ff8c60f58fe3a03d2909498a6e',1,'Eigen::NumTraits< stan::agrad::var >']]] +]; diff --git a/doc/api/html/search/enumvalues_69.html b/doc/api/html/search/enumvalues_69.html new file mode 100644 index 00000000000..ff4c4322a72 --- /dev/null +++ b/doc/api/html/search/enumvalues_69.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/enumvalues_69.js b/doc/api/html/search/enumvalues_69.js new file mode 100644 index 00000000000..f7128cb522d --- /dev/null +++ b/doc/api/html/search/enumvalues_69.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['iscomplex',['IsComplex',['../struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html#a932a61195daad3e89711cfb02521cac9a12cf0c95d1a09bb4805e148f3ced38ab',1,'Eigen::NumTraits< stan::agrad::var >']]], + ['isinteger',['IsInteger',['../struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html#a932a61195daad3e89711cfb02521cac9a1355527a3b8071883fdbc70b00a30b80',1,'Eigen::NumTraits< stan::agrad::var >']]], + ['issigned',['IsSigned',['../struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html#a932a61195daad3e89711cfb02521cac9ae9afee549e8ec17d1bc544ae785ac96f',1,'Eigen::NumTraits< stan::agrad::var >']]] +]; diff --git a/doc/api/html/search/enumvalues_6c.html b/doc/api/html/search/enumvalues_6c.html new file mode 100644 index 00000000000..b52750a5e78 --- /dev/null +++ b/doc/api/html/search/enumvalues_6c.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/enumvalues_6c.js b/doc/api/html/search/enumvalues_6c.js new file mode 100644 index 00000000000..413548963c1 --- /dev/null +++ b/doc/api/html/search/enumvalues_6c.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['lhsstorageorder',['LhsStorageOrder',['../struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1va44da5f98e1caea9523bacbd5bdc025fe.html#a1a45ecc02e193d7a8d978fc11b7bf753a4568cff436d678b2cb8e936b209fced9',1,'Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, ColMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >::LhsStorageOrder()'],['../struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1vacd54cabc78c49ca719650381b68b105e.html#a2b766d523420f3934c8e5bd00078d9f4a2a6d617ef050b14291315944cee7c382',1,'Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, RowMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >::LhsStorageOrder()']]] +]; diff --git a/doc/api/html/search/enumvalues_6d.html b/doc/api/html/search/enumvalues_6d.html new file mode 100644 index 00000000000..5e0c86ba742 --- /dev/null +++ b/doc/api/html/search/enumvalues_6d.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/enumvalues_6d.js b/doc/api/html/search/enumvalues_6d.js new file mode 100644 index 00000000000..050adaca71e --- /dev/null +++ b/doc/api/html/search/enumvalues_6d.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['mulcost',['MulCost',['../struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html#a932a61195daad3e89711cfb02521cac9a4440e43b74d010d56f93bded451d0741',1,'Eigen::NumTraits< stan::agrad::var >']]] +]; diff --git a/doc/api/html/search/enumvalues_6e.html b/doc/api/html/search/enumvalues_6e.html new file mode 100644 index 00000000000..3c41b09ae0e --- /dev/null +++ b/doc/api/html/search/enumvalues_6e.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/enumvalues_6e.js b/doc/api/html/search/enumvalues_6e.js new file mode 100644 index 00000000000..fa7ba951c20 --- /dev/null +++ b/doc/api/html/search/enumvalues_6e.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['noinput',['NOINPUT',['../structstan_1_1gm_1_1error__codes.html#aa63873e8f7e9dd7f8af3502e4003292fa2fcaec15ffdd862e869b23a13b4a4d7c',1,'stan::gm::error_codes']]] +]; diff --git a/doc/api/html/search/enumvalues_6f.html b/doc/api/html/search/enumvalues_6f.html new file mode 100644 index 00000000000..697cd20c1be --- /dev/null +++ b/doc/api/html/search/enumvalues_6f.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/enumvalues_6f.js b/doc/api/html/search/enumvalues_6f.js new file mode 100644 index 00000000000..87a22dbcfed --- /dev/null +++ b/doc/api/html/search/enumvalues_6f.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['ok',['OK',['../structstan_1_1gm_1_1error__codes.html#aa63873e8f7e9dd7f8af3502e4003292fa2e47ab549bdeac4803f2801b08cdeee4',1,'stan::gm::error_codes']]] +]; diff --git a/doc/api/html/search/enumvalues_72.html b/doc/api/html/search/enumvalues_72.html new file mode 100644 index 00000000000..b53ce22b413 --- /dev/null +++ b/doc/api/html/search/enumvalues_72.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/enumvalues_72.js b/doc/api/html/search/enumvalues_72.js new file mode 100644 index 00000000000..d17fbd7ca06 --- /dev/null +++ b/doc/api/html/search/enumvalues_72.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['readcost',['ReadCost',['../struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html#a932a61195daad3e89711cfb02521cac9a337c2bf1065c51d4a2b76e80ae51b0e7',1,'Eigen::NumTraits< stan::agrad::var >']]], + ['requireinitialization',['RequireInitialization',['../struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html#a932a61195daad3e89711cfb02521cac9ab6efa4e8f91c34b33478a794bd889dd4',1,'Eigen::NumTraits< stan::agrad::var >']]] +]; diff --git a/doc/api/html/search/enumvalues_73.html b/doc/api/html/search/enumvalues_73.html new file mode 100644 index 00000000000..f2f7db4647a --- /dev/null +++ b/doc/api/html/search/enumvalues_73.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/enumvalues_73.js b/doc/api/html/search/enumvalues_73.js new file mode 100644 index 00000000000..5d152c2c134 --- /dev/null +++ b/doc/api/html/search/enumvalues_73.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['software',['SOFTWARE',['../structstan_1_1gm_1_1error__codes.html#aa63873e8f7e9dd7f8af3502e4003292fa9924bc6241a8d380961bb3d9bc8dba92',1,'stan::gm::error_codes']]] +]; diff --git a/doc/api/html/search/enumvalues_75.html b/doc/api/html/search/enumvalues_75.html new file mode 100644 index 00000000000..c0a15042a59 --- /dev/null +++ b/doc/api/html/search/enumvalues_75.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/enumvalues_75.js b/doc/api/html/search/enumvalues_75.js new file mode 100644 index 00000000000..a856c6cd9eb --- /dev/null +++ b/doc/api/html/search/enumvalues_75.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['usage',['USAGE',['../structstan_1_1gm_1_1error__codes.html#aa63873e8f7e9dd7f8af3502e4003292fab91146036be9b2c1e9bd09619da086ba',1,'stan::gm::error_codes']]] +]; diff --git a/doc/api/html/search/enumvalues_76.html b/doc/api/html/search/enumvalues_76.html new file mode 100644 index 00000000000..87b49856c8f --- /dev/null +++ b/doc/api/html/search/enumvalues_76.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/enumvalues_76.js b/doc/api/html/search/enumvalues_76.js new file mode 100644 index 00000000000..abcc183559f --- /dev/null +++ b/doc/api/html/search/enumvalues_76.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['value',['value',['../structstan_1_1is__constant.html#a9f8df8637f49cd02a47f8c6c2c775777aecafc97e964e672dd93bcb490a0a1811',1,'stan::is_constant::value()'],['../structstan_1_1is__constant__struct.html#a601169d4607d1347bd20eb918809a922a3f9610c0a10a3879fccf6f212dd3d411',1,'stan::is_constant_struct::value()'],['../structstan_1_1is__constant__struct_3_01std_1_1vector_3_01_t_01_4_01_4.html#ac35de45d53f720014d1d6c9341facc38a889b9838820d11325b1b1e2e6dcd1f62',1,'stan::is_constant_struct< std::vector< T > >::value()'],['../structstan_1_1is__constant__struct_3_01_eigen_1_1_matrix_3_01_t_00_01_r_00_01_c_01_4_01_4.html#a629489369f685966d67e23b49b3a765ca8a919616f9227fcfa43cb7134758120a',1,'stan::is_constant_struct< Eigen::Matrix< T, R, C > >::value()'],['../structstan_1_1is__constant__struct_3_01_eigen_1_1_block_3_01_t_01_4_01_4.html#a47daf157025983c39d6e5b7789c05206ae47d85a4a43fdce9e0a2be294e6e0622',1,'stan::is_constant_struct< Eigen::Block< T > >::value()'],['../structstan_1_1is__vector.html#a69abd37dca972430e0f61ea33a19ce5da9b19e1572754024bf83375a19efee164',1,'stan::is_vector::value()'],['../structstan_1_1is__vector_3_01const_01_t_01_4.html#ad3a0ba8876c7203c3ae3e20dd7904da4ab7b181e7406ecc9d9512f53eeb423835',1,'stan::is_vector< const T >::value()'],['../structstan_1_1is__vector_3_01std_1_1vector_3_01_t_01_4_01_4.html#a820092c09f0441ab121b88f94e7034f5a8669507d2c0cf8d2013fa55cbc040690',1,'stan::is_vector< std::vector< T > >::value()'],['../structstan_1_1is__vector_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_011_01_4_01_4.html#a38d7fc87cb5dbb66fb65e9dd8c257273a75a67f94582ddd21b4956e5540578114',1,'stan::is_vector< Eigen::Matrix< T, Eigen::Dynamic, 1 > >::value()'],['../structstan_1_1is__vector_3_01_eigen_1_1_matrix_3_01_t_00_011_00_01_eigen_1_1_dynamic_01_4_01_4.html#ae014ed595604daf1ca469933b46e9126a060ce69961a2ceb1cc29cc4861aa527e',1,'stan::is_vector< Eigen::Matrix< T, 1, Eigen::Dynamic > >::value()'],['../structstan_1_1is__vector__like.html#a991e328843789ff8e8976aa11aecb426a2113100a63bb957b1ada362a39a22213',1,'stan::is_vector_like::value()'],['../structstan_1_1is__vector__like_3_01_t_01_5_01_4.html#ab609c9cc8a50da1025789263899aa807a50f6d9fb5990e3e623e6e02458926009',1,'stan::is_vector_like< T * >::value()'],['../structstan_1_1is__vector__like_3_01const_01_t_01_4.html#aa1518e780b217cf8d6acf068792c726dab859ca004282bbe79a5eeda7238d86da',1,'stan::is_vector_like< const T >::value()'],['../structstan_1_1is__vector__like_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4.html#ae847915a9aa58775e6fbee811f5e20c8acc3bb708be577474e9cd1e11ad5a4ba1',1,'stan::is_vector_like< Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > >::value()'],['../structstan_1_1is__fvar.html#aee7f99a61d7b21a79c1dfd4a3619571eab1813e4af114b125e86c4eefb1c67481',1,'stan::is_fvar::value()'],['../structstan_1_1is__fvar_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a60189a2e893c9b483c218f57503672caa2a6d75c410b27b41f578e8a7ede11c56',1,'stan::is_fvar< stan::agrad::fvar< T > >::value()'],['../structstan_1_1is__var.html#a2adee59171c897185a772cd0987caef6aaeb0f9a9eead1ac6cc943d6a1974a4c1',1,'stan::is_var::value()'],['../structstan_1_1is__var_3_01stan_1_1agrad_1_1var_01_4.html#a82e1a086145eecf5ccc03374a3b41192a754935335e15e1f2b61f2bd9bf15e65b',1,'stan::is_var< stan::agrad::var >::value()'],['../structstan_1_1contains__fvar.html#a140698e0d236727d9723e6831750d2aca5a1eddf5b1539585920063fb6cd6835b',1,'stan::contains_fvar::value()'],['../structstan_1_1is__var__or__arithmetic.html#a7242e3ffd78e362fd4f4a940d39ed7a6a4e3e0e0100aa814492acbd85e2138643',1,'stan::is_var_or_arithmetic::value()'],['../structstan_1_1prob_1_1include__summand.html#a53abfbd14a204b9ceb4ed749b9183aa9a66741e4ae3f0a68c0ac9c9143c9481dd',1,'stan::prob::include_summand::value()']]] +]; diff --git a/doc/api/html/search/files_61.html b/doc/api/html/search/files_61.html new file mode 100644 index 00000000000..5a8e4549927 --- /dev/null +++ b/doc/api/html/search/files_61.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/files_61.js b/doc/api/html/search/files_61.js new file mode 100644 index 00000000000..2ab82594e5c --- /dev/null +++ b/doc/api/html/search/files_61.js @@ -0,0 +1,96 @@ +var searchData= +[ + ['abs_2ehpp',['abs.hpp',['../agrad_2fwd_2functions_2abs_8hpp.html',1,'']]], + ['abs_2ehpp',['abs.hpp',['../agrad_2rev_2functions_2abs_8hpp.html',1,'']]], + ['abs_2ehpp',['abs.hpp',['../math_2functions_2abs_8hpp.html',1,'']]], + ['accumulator_2ehpp',['accumulator.hpp',['../accumulator_8hpp.html',1,'']]], + ['acos_2ehpp',['acos.hpp',['../rev_2functions_2acos_8hpp.html',1,'']]], + ['acos_2ehpp',['acos.hpp',['../fwd_2functions_2acos_8hpp.html',1,'']]], + ['acosh_2ehpp',['acosh.hpp',['../fwd_2functions_2acosh_8hpp.html',1,'']]], + ['acosh_2ehpp',['acosh.hpp',['../rev_2functions_2acosh_8hpp.html',1,'']]], + ['adapt_5fdense_5fe_5fnuts_2ehpp',['adapt_dense_e_nuts.hpp',['../adapt__dense__e__nuts_8hpp.html',1,'']]], + ['adapt_5fdense_5fe_5fstatic_5fhmc_2ehpp',['adapt_dense_e_static_hmc.hpp',['../adapt__dense__e__static__hmc_8hpp.html',1,'']]], + ['adapt_5fdiag_5fe_5fnuts_2ehpp',['adapt_diag_e_nuts.hpp',['../adapt__diag__e__nuts_8hpp.html',1,'']]], + ['adapt_5fdiag_5fe_5fstatic_5fhmc_2ehpp',['adapt_diag_e_static_hmc.hpp',['../adapt__diag__e__static__hmc_8hpp.html',1,'']]], + ['adapt_5funit_5fe_5fnuts_2ehpp',['adapt_unit_e_nuts.hpp',['../adapt__unit__e__nuts_8hpp.html',1,'']]], + ['adapt_5funit_5fe_5fstatic_5fhmc_2ehpp',['adapt_unit_e_static_hmc.hpp',['../adapt__unit__e__static__hmc_8hpp.html',1,'']]], + ['add_2ehpp',['add.hpp',['../add_8hpp.html',1,'']]], + ['agrad_2ehpp',['agrad.hpp',['../agrad_8hpp.html',1,'']]], + ['agrad_5fthread_5fsafe_2ehpp',['agrad_thread_safe.hpp',['../agrad__thread__safe_8hpp.html',1,'']]], + ['arg_5fadapt_2ehpp',['arg_adapt.hpp',['../arg__adapt_8hpp.html',1,'']]], + ['arg_5fadapt_5fdelta_2ehpp',['arg_adapt_delta.hpp',['../arg__adapt__delta_8hpp.html',1,'']]], + ['arg_5fadapt_5fengaged_2ehpp',['arg_adapt_engaged.hpp',['../arg__adapt__engaged_8hpp.html',1,'']]], + ['arg_5fadapt_5fgamma_2ehpp',['arg_adapt_gamma.hpp',['../arg__adapt__gamma_8hpp.html',1,'']]], + ['arg_5fadapt_5finit_5fbuffer_2ehpp',['arg_adapt_init_buffer.hpp',['../arg__adapt__init__buffer_8hpp.html',1,'']]], + ['arg_5fadapt_5fkappa_2ehpp',['arg_adapt_kappa.hpp',['../arg__adapt__kappa_8hpp.html',1,'']]], + ['arg_5fadapt_5ft0_2ehpp',['arg_adapt_t0.hpp',['../arg__adapt__t0_8hpp.html',1,'']]], + ['arg_5fadapt_5fterm_5fbuffer_2ehpp',['arg_adapt_term_buffer.hpp',['../arg__adapt__term__buffer_8hpp.html',1,'']]], + ['arg_5fadapt_5fwindow_2ehpp',['arg_adapt_window.hpp',['../arg__adapt__window_8hpp.html',1,'']]], + ['arg_5fbfgs_2ehpp',['arg_bfgs.hpp',['../arg__bfgs_8hpp.html',1,'']]], + ['arg_5fdata_2ehpp',['arg_data.hpp',['../arg__data_8hpp.html',1,'']]], + ['arg_5fdata_5ffile_2ehpp',['arg_data_file.hpp',['../arg__data__file_8hpp.html',1,'']]], + ['arg_5fdense_5fe_2ehpp',['arg_dense_e.hpp',['../arg__dense__e_8hpp.html',1,'']]], + ['arg_5fdiag_5fe_2ehpp',['arg_diag_e.hpp',['../arg__diag__e_8hpp.html',1,'']]], + ['arg_5fdiagnose_2ehpp',['arg_diagnose.hpp',['../arg__diagnose_8hpp.html',1,'']]], + ['arg_5fdiagnostic_5ffile_2ehpp',['arg_diagnostic_file.hpp',['../arg__diagnostic__file_8hpp.html',1,'']]], + ['arg_5fengine_2ehpp',['arg_engine.hpp',['../arg__engine_8hpp.html',1,'']]], + ['arg_5ffail_2ehpp',['arg_fail.hpp',['../arg__fail_8hpp.html',1,'']]], + ['arg_5fhmc_2ehpp',['arg_hmc.hpp',['../arg__hmc_8hpp.html',1,'']]], + ['arg_5fid_2ehpp',['arg_id.hpp',['../arg__id_8hpp.html',1,'']]], + ['arg_5finit_2ehpp',['arg_init.hpp',['../arg__init_8hpp.html',1,'']]], + ['arg_5finit_5falpha_2ehpp',['arg_init_alpha.hpp',['../arg__init__alpha_8hpp.html',1,'']]], + ['arg_5fint_5ftime_2ehpp',['arg_int_time.hpp',['../arg__int__time_8hpp.html',1,'']]], + ['arg_5fiter_2ehpp',['arg_iter.hpp',['../arg__iter_8hpp.html',1,'']]], + ['arg_5fmax_5fdepth_2ehpp',['arg_max_depth.hpp',['../arg__max__depth_8hpp.html',1,'']]], + ['arg_5fmethod_2ehpp',['arg_method.hpp',['../arg__method_8hpp.html',1,'']]], + ['arg_5fmetric_2ehpp',['arg_metric.hpp',['../arg__metric_8hpp.html',1,'']]], + ['arg_5fnesterov_2ehpp',['arg_nesterov.hpp',['../arg__nesterov_8hpp.html',1,'']]], + ['arg_5fnewton_2ehpp',['arg_newton.hpp',['../arg__newton_8hpp.html',1,'']]], + ['arg_5fnum_5fsamples_2ehpp',['arg_num_samples.hpp',['../arg__num__samples_8hpp.html',1,'']]], + ['arg_5fnum_5fwarmup_2ehpp',['arg_num_warmup.hpp',['../arg__num__warmup_8hpp.html',1,'']]], + ['arg_5fnuts_2ehpp',['arg_nuts.hpp',['../arg__nuts_8hpp.html',1,'']]], + ['arg_5foptimize_2ehpp',['arg_optimize.hpp',['../arg__optimize_8hpp.html',1,'']]], + ['arg_5foptimize_5falgo_2ehpp',['arg_optimize_algo.hpp',['../arg__optimize__algo_8hpp.html',1,'']]], + ['arg_5foutput_2ehpp',['arg_output.hpp',['../arg__output_8hpp.html',1,'']]], + ['arg_5foutput_5ffile_2ehpp',['arg_output_file.hpp',['../arg__output__file_8hpp.html',1,'']]], + ['arg_5frandom_2ehpp',['arg_random.hpp',['../arg__random_8hpp.html',1,'']]], + ['arg_5frefresh_2ehpp',['arg_refresh.hpp',['../arg__refresh_8hpp.html',1,'']]], + ['arg_5frwm_2ehpp',['arg_rwm.hpp',['../arg__rwm_8hpp.html',1,'']]], + ['arg_5fsample_2ehpp',['arg_sample.hpp',['../arg__sample_8hpp.html',1,'']]], + ['arg_5fsample_5falgo_2ehpp',['arg_sample_algo.hpp',['../arg__sample__algo_8hpp.html',1,'']]], + ['arg_5fsave_5fiterations_2ehpp',['arg_save_iterations.hpp',['../arg__save__iterations_8hpp.html',1,'']]], + ['arg_5fsave_5fwarmup_2ehpp',['arg_save_warmup.hpp',['../arg__save__warmup_8hpp.html',1,'']]], + ['arg_5fseed_2ehpp',['arg_seed.hpp',['../arg__seed_8hpp.html',1,'']]], + ['arg_5fstatic_2ehpp',['arg_static.hpp',['../arg__static_8hpp.html',1,'']]], + ['arg_5fstepsize_2ehpp',['arg_stepsize.hpp',['../arg__stepsize_8hpp.html',1,'']]], + ['arg_5fstepsize_5fjitter_2ehpp',['arg_stepsize_jitter.hpp',['../arg__stepsize__jitter_8hpp.html',1,'']]], + ['arg_5ftest_2ehpp',['arg_test.hpp',['../arg__test_8hpp.html',1,'']]], + ['arg_5ftest_5fgrad_5feps_2ehpp',['arg_test_grad_eps.hpp',['../arg__test__grad__eps_8hpp.html',1,'']]], + ['arg_5ftest_5fgrad_5ferr_2ehpp',['arg_test_grad_err.hpp',['../arg__test__grad__err_8hpp.html',1,'']]], + ['arg_5ftest_5fgradient_2ehpp',['arg_test_gradient.hpp',['../arg__test__gradient_8hpp.html',1,'']]], + ['arg_5fthin_2ehpp',['arg_thin.hpp',['../arg__thin_8hpp.html',1,'']]], + ['arg_5ftolerance_2ehpp',['arg_tolerance.hpp',['../arg__tolerance_8hpp.html',1,'']]], + ['arg_5funit_5fe_2ehpp',['arg_unit_e.hpp',['../arg__unit__e_8hpp.html',1,'']]], + ['argument_2ehpp',['argument.hpp',['../argument_8hpp.html',1,'']]], + ['argument_5fparser_2ehpp',['argument_parser.hpp',['../argument__parser_8hpp.html',1,'']]], + ['argument_5fprobe_2ehpp',['argument_probe.hpp',['../argument__probe_8hpp.html',1,'']]], + ['array_5fbuilder_2ehpp',['array_builder.hpp',['../array__builder_8hpp.html',1,'']]], + ['as_5fbool_2ehpp',['as_bool.hpp',['../math_2functions_2as__bool_8hpp.html',1,'']]], + ['as_5fbool_2ehpp',['as_bool.hpp',['../agrad_2rev_2functions_2as__bool_8hpp.html',1,'']]], + ['asin_2ehpp',['asin.hpp',['../fwd_2functions_2asin_8hpp.html',1,'']]], + ['asin_2ehpp',['asin.hpp',['../rev_2functions_2asin_8hpp.html',1,'']]], + ['asinh_2ehpp',['asinh.hpp',['../rev_2functions_2asinh_8hpp.html',1,'']]], + ['asinh_2ehpp',['asinh.hpp',['../fwd_2functions_2asinh_8hpp.html',1,'']]], + ['assign_2ehpp',['assign.hpp',['../assign_8hpp.html',1,'']]], + ['ast_2ehpp',['ast.hpp',['../ast_8hpp.html',1,'']]], + ['ast_5fdef_2ecpp',['ast_def.cpp',['../ast__def_8cpp.html',1,'']]], + ['atan_2ehpp',['atan.hpp',['../rev_2functions_2atan_8hpp.html',1,'']]], + ['atan_2ehpp',['atan.hpp',['../fwd_2functions_2atan_8hpp.html',1,'']]], + ['atan2_2ehpp',['atan2.hpp',['../fwd_2functions_2atan2_8hpp.html',1,'']]], + ['atan2_2ehpp',['atan2.hpp',['../rev_2functions_2atan2_8hpp.html',1,'']]], + ['atanh_2ehpp',['atanh.hpp',['../fwd_2functions_2atanh_8hpp.html',1,'']]], + ['atanh_2ehpp',['atanh.hpp',['../rev_2functions_2atanh_8hpp.html',1,'']]], + ['autocorrelation_2ehpp',['autocorrelation.hpp',['../autocorrelation_8hpp.html',1,'']]], + ['autocovariance_2ehpp',['autocovariance.hpp',['../autocovariance_8hpp.html',1,'']]], + ['autodiff_2ehpp',['autodiff.hpp',['../autodiff_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/files_62.html b/doc/api/html/search/files_62.html new file mode 100644 index 00000000000..bb7577ecff5 --- /dev/null +++ b/doc/api/html/search/files_62.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/files_62.js b/doc/api/html/search/files_62.js new file mode 100644 index 00000000000..6404bb8fcae --- /dev/null +++ b/doc/api/html/search/files_62.js @@ -0,0 +1,31 @@ +var searchData= +[ + ['base_5fadaptation_2ehpp',['base_adaptation.hpp',['../base__adaptation_8hpp.html',1,'']]], + ['base_5fadapter_2ehpp',['base_adapter.hpp',['../base__adapter_8hpp.html',1,'']]], + ['base_5fhamiltonian_2ehpp',['base_hamiltonian.hpp',['../base__hamiltonian_8hpp.html',1,'']]], + ['base_5fhmc_2ehpp',['base_hmc.hpp',['../base__hmc_8hpp.html',1,'']]], + ['base_5fintegrator_2ehpp',['base_integrator.hpp',['../base__integrator_8hpp.html',1,'']]], + ['base_5fleapfrog_2ehpp',['base_leapfrog.hpp',['../base__leapfrog_8hpp.html',1,'']]], + ['base_5fmcmc_2ehpp',['base_mcmc.hpp',['../base__mcmc_8hpp.html',1,'']]], + ['base_5fnuts_2ehpp',['base_nuts.hpp',['../base__nuts_8hpp.html',1,'']]], + ['base_5fstatic_5fhmc_2ehpp',['base_static_hmc.hpp',['../base__static__hmc_8hpp.html',1,'']]], + ['bernoulli_2ehpp',['bernoulli.hpp',['../bernoulli_8hpp.html',1,'']]], + ['bessel_5ffirst_5fkind_2ehpp',['bessel_first_kind.hpp',['../math_2functions_2bessel__first__kind_8hpp.html',1,'']]], + ['bessel_5ffirst_5fkind_2ehpp',['bessel_first_kind.hpp',['../agrad_2fwd_2functions_2bessel__first__kind_8hpp.html',1,'']]], + ['bessel_5ffirst_5fkind_2ehpp',['bessel_first_kind.hpp',['../agrad_2rev_2functions_2bessel__first__kind_8hpp.html',1,'']]], + ['bessel_5fsecond_5fkind_2ehpp',['bessel_second_kind.hpp',['../agrad_2fwd_2functions_2bessel__second__kind_8hpp.html',1,'']]], + ['bessel_5fsecond_5fkind_2ehpp',['bessel_second_kind.hpp',['../agrad_2rev_2functions_2bessel__second__kind_8hpp.html',1,'']]], + ['bessel_5fsecond_5fkind_2ehpp',['bessel_second_kind.hpp',['../math_2functions_2bessel__second__kind_8hpp.html',1,'']]], + ['beta_2ehpp',['beta.hpp',['../beta_8hpp.html',1,'']]], + ['beta_5fbinomial_2ehpp',['beta_binomial.hpp',['../beta__binomial_8hpp.html',1,'']]], + ['bfgs_2ehpp',['bfgs.hpp',['../bfgs_8hpp.html',1,'']]], + ['binary_5flog_5floss_2ehpp',['binary_log_loss.hpp',['../agrad_2fwd_2functions_2binary__log__loss_8hpp.html',1,'']]], + ['binary_5flog_5floss_2ehpp',['binary_log_loss.hpp',['../agrad_2rev_2functions_2binary__log__loss_8hpp.html',1,'']]], + ['binary_5flog_5floss_2ehpp',['binary_log_loss.hpp',['../math_2functions_2binary__log__loss_8hpp.html',1,'']]], + ['binomial_2ehpp',['binomial.hpp',['../binomial_8hpp.html',1,'']]], + ['binomial_5fcoefficient_5flog_2ehpp',['binomial_coefficient_log.hpp',['../math_2functions_2binomial__coefficient__log_8hpp.html',1,'']]], + ['binomial_5fcoefficient_5flog_2ehpp',['binomial_coefficient_log.hpp',['../agrad_2fwd_2functions_2binomial__coefficient__log_8hpp.html',1,'']]], + ['block_2ehpp',['block.hpp',['../block_8hpp.html',1,'']]], + ['boost_2edox',['boost.dox',['../boost_8dox.html',1,'']]], + ['boost_5ffpclassify_2ehpp',['boost_fpclassify.hpp',['../boost__fpclassify_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/files_63.html b/doc/api/html/search/files_63.html new file mode 100644 index 00000000000..6611a5b9180 --- /dev/null +++ b/doc/api/html/search/files_63.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/files_63.js b/doc/api/html/search/files_63.js new file mode 100644 index 00000000000..78a9bdd5ec2 --- /dev/null +++ b/doc/api/html/search/files_63.js @@ -0,0 +1,70 @@ +var searchData= +[ + ['calculate_5fchain_2ehpp',['calculate_chain.hpp',['../calculate__chain_8hpp.html',1,'']]], + ['categorical_2ehpp',['categorical.hpp',['../categorical_8hpp.html',1,'']]], + ['categorical_5fargument_2ehpp',['categorical_argument.hpp',['../categorical__argument_8hpp.html',1,'']]], + ['categorical_5flogit_2ehpp',['categorical_logit.hpp',['../categorical__logit_8hpp.html',1,'']]], + ['cauchy_2ehpp',['cauchy.hpp',['../cauchy_8hpp.html',1,'']]], + ['cbrt_2ehpp',['cbrt.hpp',['../rev_2functions_2cbrt_8hpp.html',1,'']]], + ['cbrt_2ehpp',['cbrt.hpp',['../fwd_2functions_2cbrt_8hpp.html',1,'']]], + ['ceil_2ehpp',['ceil.hpp',['../rev_2functions_2ceil_8hpp.html',1,'']]], + ['ceil_2ehpp',['ceil.hpp',['../fwd_2functions_2ceil_8hpp.html',1,'']]], + ['chainable_2ehpp',['chainable.hpp',['../chainable_8hpp.html',1,'']]], + ['chains_2ehpp',['chains.hpp',['../chains_8hpp.html',1,'']]], + ['check_5fbounded_2ehpp',['check_bounded.hpp',['../check__bounded_8hpp.html',1,'']]], + ['check_5fcholesky_5ffactor_2ehpp',['check_cholesky_factor.hpp',['../check__cholesky__factor_8hpp.html',1,'']]], + ['check_5fconsistent_5fsize_2ehpp',['check_consistent_size.hpp',['../check__consistent__size_8hpp.html',1,'']]], + ['check_5fconsistent_5fsizes_2ehpp',['check_consistent_sizes.hpp',['../check__consistent__sizes_8hpp.html',1,'']]], + ['check_5fcorr_5fmatrix_2ehpp',['check_corr_matrix.hpp',['../check__corr__matrix_8hpp.html',1,'']]], + ['check_5fcov_5fmatrix_2ehpp',['check_cov_matrix.hpp',['../check__cov__matrix_8hpp.html',1,'']]], + ['check_5ffinite_2ehpp',['check_finite.hpp',['../check__finite_8hpp.html',1,'']]], + ['check_5fgreater_2ehpp',['check_greater.hpp',['../check__greater_8hpp.html',1,'']]], + ['check_5fgreater_5for_5fequal_2ehpp',['check_greater_or_equal.hpp',['../check__greater__or__equal_8hpp.html',1,'']]], + ['check_5fless_2ehpp',['check_less.hpp',['../check__less_8hpp.html',1,'']]], + ['check_5fless_5for_5fequal_2ehpp',['check_less_or_equal.hpp',['../check__less__or__equal_8hpp.html',1,'']]], + ['check_5flower_5ftriangular_2ehpp',['check_lower_triangular.hpp',['../check__lower__triangular_8hpp.html',1,'']]], + ['check_5fnonnegative_2ehpp',['check_nonnegative.hpp',['../check__nonnegative_8hpp.html',1,'']]], + ['check_5fnot_5fnan_2ehpp',['check_not_nan.hpp',['../check__not__nan_8hpp.html',1,'']]], + ['check_5fordered_2ehpp',['check_ordered.hpp',['../check__ordered_8hpp.html',1,'']]], + ['check_5fpos_5fdefinite_2ehpp',['check_pos_definite.hpp',['../agrad_2rev_2error__handling_2matrix_2check__pos__definite_8hpp.html',1,'']]], + ['check_5fpos_5fdefinite_2ehpp',['check_pos_definite.hpp',['../math_2error__handling_2matrix_2check__pos__definite_8hpp.html',1,'']]], + ['check_5fpos_5fsemidefinite_2ehpp',['check_pos_semidefinite.hpp',['../check__pos__semidefinite_8hpp.html',1,'']]], + ['check_5fpositive_2ehpp',['check_positive.hpp',['../check__positive_8hpp.html',1,'']]], + ['check_5fpositive_5fordered_2ehpp',['check_positive_ordered.hpp',['../check__positive__ordered_8hpp.html',1,'']]], + ['check_5frange_2ehpp',['check_range.hpp',['../check__range_8hpp.html',1,'']]], + ['check_5fsimplex_2ehpp',['check_simplex.hpp',['../check__simplex_8hpp.html',1,'']]], + ['check_5fsize_5fmatch_2ehpp',['check_size_match.hpp',['../check__size__match_8hpp.html',1,'']]], + ['check_5fspsd_5fmatrix_2ehpp',['check_spsd_matrix.hpp',['../check__spsd__matrix_8hpp.html',1,'']]], + ['check_5fsquare_2ehpp',['check_square.hpp',['../check__square_8hpp.html',1,'']]], + ['check_5fsymmetric_2ehpp',['check_symmetric.hpp',['../check__symmetric_8hpp.html',1,'']]], + ['check_5funit_5fvector_2ehpp',['check_unit_vector.hpp',['../check__unit__vector_8hpp.html',1,'']]], + ['chi_5fsquare_2ehpp',['chi_square.hpp',['../chi__square_8hpp.html',1,'']]], + ['cholesky_5fdecompose_2ehpp',['cholesky_decompose.hpp',['../cholesky__decompose_8hpp.html',1,'']]], + ['chunk_5falloc_2ehpp',['chunk_alloc.hpp',['../chunk__alloc_8hpp.html',1,'']]], + ['cmd_5fline_2ehpp',['cmd_line.hpp',['../cmd__line_8hpp.html',1,'']]], + ['col_2ehpp',['col.hpp',['../col_8hpp.html',1,'']]], + ['cols_2ehpp',['cols.hpp',['../cols_8hpp.html',1,'']]], + ['columns_5fdot_5fproduct_2ehpp',['columns_dot_product.hpp',['../agrad_2fwd_2matrix_2columns__dot__product_8hpp.html',1,'']]], + ['columns_5fdot_5fproduct_2ehpp',['columns_dot_product.hpp',['../math_2matrix_2columns__dot__product_8hpp.html',1,'']]], + ['columns_5fdot_5fself_2ehpp',['columns_dot_self.hpp',['../math_2matrix_2columns__dot__self_8hpp.html',1,'']]], + ['columns_5fdot_5fself_2ehpp',['columns_dot_self.hpp',['../agrad_2fwd_2matrix_2columns__dot__self_8hpp.html',1,'']]], + ['command_2ehpp',['command.hpp',['../command_8hpp.html',1,'']]], + ['common_5fadaptors_5fdef_2ehpp',['common_adaptors_def.hpp',['../common__adaptors__def_8hpp.html',1,'']]], + ['common_5ftype_2ehpp',['common_type.hpp',['../common__type_8hpp.html',1,'']]], + ['compiler_2ehpp',['compiler.hpp',['../compiler_8hpp.html',1,'']]], + ['constants_2ehpp',['constants.hpp',['../prob_2constants_8hpp.html',1,'']]], + ['constants_2ehpp',['constants.hpp',['../math_2constants_8hpp.html',1,'']]], + ['constraint_5ftolerance_2ehpp',['constraint_tolerance.hpp',['../constraint__tolerance_8hpp.html',1,'']]], + ['continuous_2ehpp',['continuous.hpp',['../multivariate_2continuous_8hpp.html',1,'']]], + ['continuous_2ehpp',['continuous.hpp',['../univariate_2continuous_8hpp.html',1,'']]], + ['cos_2ehpp',['cos.hpp',['../rev_2functions_2cos_8hpp.html',1,'']]], + ['cos_2ehpp',['cos.hpp',['../fwd_2functions_2cos_8hpp.html',1,'']]], + ['cosh_2ehpp',['cosh.hpp',['../rev_2functions_2cosh_8hpp.html',1,'']]], + ['cosh_2ehpp',['cosh.hpp',['../fwd_2functions_2cosh_8hpp.html',1,'']]], + ['covar_5fadaptation_2ehpp',['covar_adaptation.hpp',['../covar__adaptation_8hpp.html',1,'']]], + ['crossprod_2ehpp',['crossprod.hpp',['../math_2matrix_2crossprod_8hpp.html',1,'']]], + ['crossprod_2ehpp',['crossprod.hpp',['../agrad_2rev_2matrix_2crossprod_8hpp.html',1,'']]], + ['crossprod_2ehpp',['crossprod.hpp',['../agrad_2fwd_2matrix_2crossprod_8hpp.html',1,'']]], + ['csv_5fwriter_2ehpp',['csv_writer.hpp',['../csv__writer_8hpp.html',1,'']]], + ['cumulative_5fsum_2ehpp',['cumulative_sum.hpp',['../cumulative__sum_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/files_64.html b/doc/api/html/search/files_64.html new file mode 100644 index 00000000000..1a32bf882a1 --- /dev/null +++ b/doc/api/html/search/files_64.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/files_64.js b/doc/api/html/search/files_64.js new file mode 100644 index 00000000000..b7e2151db85 --- /dev/null +++ b/doc/api/html/search/files_64.js @@ -0,0 +1,47 @@ +var searchData= +[ + ['ddv_5fvari_2ehpp',['ddv_vari.hpp',['../ddv__vari_8hpp.html',1,'']]], + ['dense_5fe_5fmetric_2ehpp',['dense_e_metric.hpp',['../dense__e__metric_8hpp.html',1,'']]], + ['dense_5fe_5fnuts_2ehpp',['dense_e_nuts.hpp',['../dense__e__nuts_8hpp.html',1,'']]], + ['dense_5fe_5fpoint_2ehpp',['dense_e_point.hpp',['../dense__e__point_8hpp.html',1,'']]], + ['dense_5fe_5fstatic_5fhmc_2ehpp',['dense_e_static_hmc.hpp',['../dense__e__static__hmc_8hpp.html',1,'']]], + ['determinant_2ehpp',['determinant.hpp',['../agrad_2fwd_2matrix_2determinant_8hpp.html',1,'']]], + ['determinant_2ehpp',['determinant.hpp',['../agrad_2rev_2matrix_2determinant_8hpp.html',1,'']]], + ['determinant_2ehpp',['determinant.hpp',['../math_2matrix_2determinant_8hpp.html',1,'']]], + ['diag_5fe_5fmetric_2ehpp',['diag_e_metric.hpp',['../diag__e__metric_8hpp.html',1,'']]], + ['diag_5fe_5fnuts_2ehpp',['diag_e_nuts.hpp',['../diag__e__nuts_8hpp.html',1,'']]], + ['diag_5fe_5fpoint_2ehpp',['diag_e_point.hpp',['../diag__e__point_8hpp.html',1,'']]], + ['diag_5fe_5fstatic_5fhmc_2ehpp',['diag_e_static_hmc.hpp',['../diag__e__static__hmc_8hpp.html',1,'']]], + ['diag_5fmatrix_2ehpp',['diag_matrix.hpp',['../diag__matrix_8hpp.html',1,'']]], + ['diag_5fpost_5fmultiply_2ehpp',['diag_post_multiply.hpp',['../diag__post__multiply_8hpp.html',1,'']]], + ['diag_5fpre_5fmultiply_2ehpp',['diag_pre_multiply.hpp',['../diag__pre__multiply_8hpp.html',1,'']]], + ['diagonal_2ehpp',['diagonal.hpp',['../diagonal_8hpp.html',1,'']]], + ['digamma_2ehpp',['digamma.hpp',['../agrad_2rev_2functions_2digamma_8hpp.html',1,'']]], + ['digamma_2ehpp',['digamma.hpp',['../agrad_2fwd_2functions_2digamma_8hpp.html',1,'']]], + ['digamma_2ehpp',['digamma.hpp',['../math_2functions_2digamma_8hpp.html',1,'']]], + ['dims_2ehpp',['dims.hpp',['../dims_8hpp.html',1,'']]], + ['dirichlet_2ehpp',['dirichlet.hpp',['../dirichlet_8hpp.html',1,'']]], + ['discrete_2ehpp',['discrete.hpp',['../univariate_2discrete_8hpp.html',1,'']]], + ['discrete_2ehpp',['discrete.hpp',['../multivariate_2discrete_8hpp.html',1,'']]], + ['dist_2ehpp',['dist.hpp',['../functions_2dist_8hpp.html',1,'']]], + ['dist_2ehpp',['dist.hpp',['../matrix_2dist_8hpp.html',1,'']]], + ['distributions_2ehpp',['distributions.hpp',['../distributions_8hpp.html',1,'']]], + ['divide_2ehpp',['divide.hpp',['../math_2matrix_2divide_8hpp.html',1,'']]], + ['divide_2ehpp',['divide.hpp',['../agrad_2rev_2matrix_2divide_8hpp.html',1,'']]], + ['divide_2ehpp',['divide.hpp',['../agrad_2fwd_2matrix_2divide_8hpp.html',1,'']]], + ['dom_5ferr_2ehpp',['dom_err.hpp',['../dom__err_8hpp.html',1,'']]], + ['dom_5ferr_5fvec_2ehpp',['dom_err_vec.hpp',['../dom__err__vec_8hpp.html',1,'']]], + ['dot_2ehpp',['dot.hpp',['../dot_8hpp.html',1,'']]], + ['dot_5fproduct_2ehpp',['dot_product.hpp',['../agrad_2fwd_2matrix_2dot__product_8hpp.html',1,'']]], + ['dot_5fproduct_2ehpp',['dot_product.hpp',['../math_2matrix_2dot__product_8hpp.html',1,'']]], + ['dot_5fproduct_2ehpp',['dot_product.hpp',['../agrad_2rev_2matrix_2dot__product_8hpp.html',1,'']]], + ['dot_5fself_2ehpp',['dot_self.hpp',['../agrad_2rev_2matrix_2dot__self_8hpp.html',1,'']]], + ['dot_5fself_2ehpp',['dot_self.hpp',['../agrad_2fwd_2matrix_2dot__self_8hpp.html',1,'']]], + ['dot_5fself_2ehpp',['dot_self.hpp',['../math_2functions_2dot__self_8hpp.html',1,'']]], + ['dot_5fself_2ehpp',['dot_self.hpp',['../math_2matrix_2dot__self_8hpp.html',1,'']]], + ['double_5fexponential_2ehpp',['double_exponential.hpp',['../double__exponential_8hpp.html',1,'']]], + ['dump_2ehpp',['dump.hpp',['../dump_8hpp.html',1,'']]], + ['dv_5fvari_2ehpp',['dv_vari.hpp',['../dv__vari_8hpp.html',1,'']]], + ['dvd_5fvari_2ehpp',['dvd_vari.hpp',['../dvd__vari_8hpp.html',1,'']]], + ['dvv_5fvari_2ehpp',['dvv_vari.hpp',['../dvv__vari_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/files_65.html b/doc/api/html/search/files_65.html new file mode 100644 index 00000000000..1eadd1b02d9 --- /dev/null +++ b/doc/api/html/search/files_65.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/files_65.js b/doc/api/html/search/files_65.js new file mode 100644 index 00000000000..c8f867dd784 --- /dev/null +++ b/doc/api/html/search/files_65.js @@ -0,0 +1,32 @@ +var searchData= +[ + ['eigen_2edox',['Eigen.dox',['../_eigen_8dox.html',1,'']]], + ['eigen_2ehpp',['Eigen.hpp',['../_eigen_8hpp.html',1,'']]], + ['eigen_5fnumtraits_2ehpp',['Eigen_NumTraits.hpp',['../_eigen___num_traits_8hpp.html',1,'']]], + ['eigenvalues_5fsym_2ehpp',['eigenvalues_sym.hpp',['../eigenvalues__sym_8hpp.html',1,'']]], + ['eigenvectors_5fsym_2ehpp',['eigenvectors_sym.hpp',['../eigenvectors__sym_8hpp.html',1,'']]], + ['elt_5fdivide_2ehpp',['elt_divide.hpp',['../elt__divide_8hpp.html',1,'']]], + ['elt_5fmultiply_2ehpp',['elt_multiply.hpp',['../elt__multiply_8hpp.html',1,'']]], + ['erf_2ehpp',['erf.hpp',['../rev_2functions_2erf_8hpp.html',1,'']]], + ['erf_2ehpp',['erf.hpp',['../fwd_2functions_2erf_8hpp.html',1,'']]], + ['erfc_2ehpp',['erfc.hpp',['../fwd_2functions_2erfc_8hpp.html',1,'']]], + ['erfc_2ehpp',['erfc.hpp',['../rev_2functions_2erfc_8hpp.html',1,'']]], + ['error_5fcodes_2ehpp',['error_codes.hpp',['../error__codes_8hpp.html',1,'']]], + ['error_5fhandling_2edox',['error_handling.dox',['../error__handling_8dox.html',1,'']]], + ['error_5fhandling_2ehpp',['error_handling.hpp',['../math_2error__handling_8hpp.html',1,'']]], + ['error_5fhandling_2ehpp',['error_handling.hpp',['../agrad_2rev_2error__handling_8hpp.html',1,'']]], + ['exp_2ehpp',['exp.hpp',['../agrad_2rev_2functions_2exp_8hpp.html',1,'']]], + ['exp_2ehpp',['exp.hpp',['../math_2matrix_2exp_8hpp.html',1,'']]], + ['exp_2ehpp',['exp.hpp',['../agrad_2fwd_2functions_2exp_8hpp.html',1,'']]], + ['exp2_2ehpp',['exp2.hpp',['../agrad_2fwd_2functions_2exp2_8hpp.html',1,'']]], + ['exp2_2ehpp',['exp2.hpp',['../agrad_2rev_2functions_2exp2_8hpp.html',1,'']]], + ['exp2_2ehpp',['exp2.hpp',['../math_2functions_2exp2_8hpp.html',1,'']]], + ['exp_5fmod_5fnormal_2ehpp',['exp_mod_normal.hpp',['../exp__mod__normal_8hpp.html',1,'']]], + ['expl_5fleapfrog_2ehpp',['expl_leapfrog.hpp',['../expl__leapfrog_8hpp.html',1,'']]], + ['expm1_2ehpp',['expm1.hpp',['../rev_2functions_2expm1_8hpp.html',1,'']]], + ['expm1_2ehpp',['expm1.hpp',['../fwd_2functions_2expm1_8hpp.html',1,'']]], + ['exponential_2ehpp',['exponential.hpp',['../exponential_8hpp.html',1,'']]], + ['expression_5fgrammar_2ehpp',['expression_grammar.hpp',['../expression__grammar_8hpp.html',1,'']]], + ['expression_5fgrammar_5fdef_2ehpp',['expression_grammar_def.hpp',['../expression__grammar__def_8hpp.html',1,'']]], + ['expression_5fgrammar_5finst_2ecpp',['expression_grammar_inst.cpp',['../expression__grammar__inst_8cpp.html',1,'']]] +]; diff --git a/doc/api/html/search/files_66.html b/doc/api/html/search/files_66.html new file mode 100644 index 00000000000..c05640363d0 --- /dev/null +++ b/doc/api/html/search/files_66.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/files_66.js b/doc/api/html/search/files_66.js new file mode 100644 index 00000000000..cf83856f99d --- /dev/null +++ b/doc/api/html/search/files_66.js @@ -0,0 +1,28 @@ +var searchData= +[ + ['fabs_2ehpp',['fabs.hpp',['../fwd_2functions_2fabs_8hpp.html',1,'']]], + ['fabs_2ehpp',['fabs.hpp',['../rev_2functions_2fabs_8hpp.html',1,'']]], + ['falling_5ffactorial_2ehpp',['falling_factorial.hpp',['../agrad_2rev_2functions_2falling__factorial_8hpp.html',1,'']]], + ['falling_5ffactorial_2ehpp',['falling_factorial.hpp',['../math_2functions_2falling__factorial_8hpp.html',1,'']]], + ['falling_5ffactorial_2ehpp',['falling_factorial.hpp',['../agrad_2fwd_2functions_2falling__factorial_8hpp.html',1,'']]], + ['fdim_2ehpp',['fdim.hpp',['../agrad_2fwd_2functions_2fdim_8hpp.html',1,'']]], + ['fdim_2ehpp',['fdim.hpp',['../agrad_2rev_2functions_2fdim_8hpp.html',1,'']]], + ['fdim_2ehpp',['fdim.hpp',['../math_2functions_2fdim_8hpp.html',1,'']]], + ['fill_2ehpp',['fill.hpp',['../fill_8hpp.html',1,'']]], + ['floor_2ehpp',['floor.hpp',['../fwd_2functions_2floor_8hpp.html',1,'']]], + ['floor_2ehpp',['floor.hpp',['../rev_2functions_2floor_8hpp.html',1,'']]], + ['fma_2ehpp',['fma.hpp',['../agrad_2rev_2functions_2fma_8hpp.html',1,'']]], + ['fma_2ehpp',['fma.hpp',['../math_2functions_2fma_8hpp.html',1,'']]], + ['fma_2ehpp',['fma.hpp',['../agrad_2fwd_2functions_2fma_8hpp.html',1,'']]], + ['fmax_2ehpp',['fmax.hpp',['../fwd_2functions_2fmax_8hpp.html',1,'']]], + ['fmax_2ehpp',['fmax.hpp',['../rev_2functions_2fmax_8hpp.html',1,'']]], + ['fmin_2ehpp',['fmin.hpp',['../rev_2functions_2fmin_8hpp.html',1,'']]], + ['fmin_2ehpp',['fmin.hpp',['../fwd_2functions_2fmin_8hpp.html',1,'']]], + ['fmod_2ehpp',['fmod.hpp',['../rev_2functions_2fmod_8hpp.html',1,'']]], + ['fmod_2ehpp',['fmod.hpp',['../fwd_2functions_2fmod_8hpp.html',1,'']]], + ['functions_2ehpp',['functions.hpp',['../math_2functions_8hpp.html',1,'']]], + ['functions_2ehpp',['functions.hpp',['../agrad_2fwd_2functions_8hpp.html',1,'']]], + ['functions_2ehpp',['functions.hpp',['../agrad_2rev_2functions_8hpp.html',1,'']]], + ['fvar_2ehpp',['fvar.hpp',['../fvar_8hpp.html',1,'']]], + ['fwd_2ehpp',['fwd.hpp',['../fwd_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/files_67.html b/doc/api/html/search/files_67.html new file mode 100644 index 00000000000..d5df283f3cf --- /dev/null +++ b/doc/api/html/search/files_67.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/files_67.js b/doc/api/html/search/files_67.js new file mode 100644 index 00000000000..a64563d2ce1 --- /dev/null +++ b/doc/api/html/search/files_67.js @@ -0,0 +1,17 @@ +var searchData= +[ + ['gamma_2ehpp',['gamma.hpp',['../gamma_8hpp.html',1,'']]], + ['gamma_5fp_2ehpp',['gamma_p.hpp',['../agrad_2rev_2functions_2gamma__p_8hpp.html',1,'']]], + ['gamma_5fp_2ehpp',['gamma_p.hpp',['../agrad_2fwd_2functions_2gamma__p_8hpp.html',1,'']]], + ['gamma_5fp_2ehpp',['gamma_p.hpp',['../math_2functions_2gamma__p_8hpp.html',1,'']]], + ['gamma_5fq_2ehpp',['gamma_q.hpp',['../agrad_2fwd_2functions_2gamma__q_8hpp.html',1,'']]], + ['gamma_5fq_2ehpp',['gamma_q.hpp',['../agrad_2rev_2functions_2gamma__q_8hpp.html',1,'']]], + ['gamma_5fq_2ehpp',['gamma_q.hpp',['../math_2functions_2gamma__q_8hpp.html',1,'']]], + ['gaussian_5fdlm_5fobs_2ehpp',['gaussian_dlm_obs.hpp',['../gaussian__dlm__obs_8hpp.html',1,'']]], + ['generator_2ehpp',['generator.hpp',['../generator_8hpp.html',1,'']]], + ['get_5fbase1_2ehpp',['get_base1.hpp',['../get__base1_8hpp.html',1,'']]], + ['get_5fbase1_5flhs_2ehpp',['get_base1_lhs.hpp',['../get__base1__lhs_8hpp.html',1,'']]], + ['gm_2ehpp',['gm.hpp',['../gm_8hpp.html',1,'']]], + ['grad_2ehpp',['grad.hpp',['../grad_8hpp.html',1,'']]], + ['gumbel_2ehpp',['gumbel.hpp',['../gumbel_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/files_68.html b/doc/api/html/search/files_68.html new file mode 100644 index 00000000000..8ead5893fb9 --- /dev/null +++ b/doc/api/html/search/files_68.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/files_68.js b/doc/api/html/search/files_68.js new file mode 100644 index 00000000000..7655473f720 --- /dev/null +++ b/doc/api/html/search/files_68.js @@ -0,0 +1,8 @@ +var searchData= +[ + ['head_2ehpp',['head.hpp',['../head_8hpp.html',1,'']]], + ['hessian_2ehpp',['hessian.hpp',['../hessian_8hpp.html',1,'']]], + ['hypergeometric_2ehpp',['hypergeometric.hpp',['../hypergeometric_8hpp.html',1,'']]], + ['hypot_2ehpp',['hypot.hpp',['../fwd_2functions_2hypot_8hpp.html',1,'']]], + ['hypot_2ehpp',['hypot.hpp',['../rev_2functions_2hypot_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/files_69.html b/doc/api/html/search/files_69.html new file mode 100644 index 00000000000..7fbd757cdbb --- /dev/null +++ b/doc/api/html/search/files_69.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/files_69.js b/doc/api/html/search/files_69.js new file mode 100644 index 00000000000..2085ba3ec64 --- /dev/null +++ b/doc/api/html/search/files_69.js @@ -0,0 +1,38 @@ +var searchData= +[ + ['ibeta_2ehpp',['ibeta.hpp',['../agrad_2rev_2functions_2ibeta_8hpp.html',1,'']]], + ['ibeta_2ehpp',['ibeta.hpp',['../math_2functions_2ibeta_8hpp.html',1,'']]], + ['if_5felse_2ehpp',['if_else.hpp',['../agrad_2rev_2functions_2if__else_8hpp.html',1,'']]], + ['if_5felse_2ehpp',['if_else.hpp',['../math_2functions_2if__else_8hpp.html',1,'']]], + ['initialize_2ehpp',['initialize.hpp',['../initialize_8hpp.html',1,'']]], + ['initialize_5fvariable_2ehpp',['initialize_variable.hpp',['../initialize__variable_8hpp.html',1,'']]], + ['int_5fstep_2ehpp',['int_step.hpp',['../int__step_8hpp.html',1,'']]], + ['internal_2ehpp',['internal.hpp',['../internal_8hpp.html',1,'']]], + ['internal_5fmath_2ehpp',['internal_math.hpp',['../internal__math_8hpp.html',1,'']]], + ['inv_2ehpp',['inv.hpp',['../agrad_2fwd_2functions_2inv_8hpp.html',1,'']]], + ['inv_2ehpp',['inv.hpp',['../agrad_2rev_2functions_2inv_8hpp.html',1,'']]], + ['inv_2ehpp',['inv.hpp',['../math_2functions_2inv_8hpp.html',1,'']]], + ['inv_5fchi_5fsquare_2ehpp',['inv_chi_square.hpp',['../inv__chi__square_8hpp.html',1,'']]], + ['inv_5fcloglog_2ehpp',['inv_cloglog.hpp',['../agrad_2fwd_2functions_2inv__cloglog_8hpp.html',1,'']]], + ['inv_5fcloglog_2ehpp',['inv_cloglog.hpp',['../agrad_2rev_2functions_2inv__cloglog_8hpp.html',1,'']]], + ['inv_5fcloglog_2ehpp',['inv_cloglog.hpp',['../math_2functions_2inv__cloglog_8hpp.html',1,'']]], + ['inv_5fgamma_2ehpp',['inv_gamma.hpp',['../inv__gamma_8hpp.html',1,'']]], + ['inv_5flogit_2ehpp',['inv_logit.hpp',['../agrad_2rev_2functions_2inv__logit_8hpp.html',1,'']]], + ['inv_5flogit_2ehpp',['inv_logit.hpp',['../math_2functions_2inv__logit_8hpp.html',1,'']]], + ['inv_5flogit_2ehpp',['inv_logit.hpp',['../agrad_2fwd_2functions_2inv__logit_8hpp.html',1,'']]], + ['inv_5fsqrt_2ehpp',['inv_sqrt.hpp',['../agrad_2fwd_2functions_2inv__sqrt_8hpp.html',1,'']]], + ['inv_5fsqrt_2ehpp',['inv_sqrt.hpp',['../agrad_2rev_2functions_2inv__sqrt_8hpp.html',1,'']]], + ['inv_5fsqrt_2ehpp',['inv_sqrt.hpp',['../math_2functions_2inv__sqrt_8hpp.html',1,'']]], + ['inv_5fsquare_2ehpp',['inv_square.hpp',['../math_2functions_2inv__square_8hpp.html',1,'']]], + ['inv_5fsquare_2ehpp',['inv_square.hpp',['../agrad_2fwd_2functions_2inv__square_8hpp.html',1,'']]], + ['inv_5fsquare_2ehpp',['inv_square.hpp',['../agrad_2rev_2functions_2inv__square_8hpp.html',1,'']]], + ['inv_5fwishart_2ehpp',['inv_wishart.hpp',['../inv__wishart_8hpp.html',1,'']]], + ['inverse_2ehpp',['inverse.hpp',['../math_2matrix_2inverse_8hpp.html',1,'']]], + ['inverse_2ehpp',['inverse.hpp',['../agrad_2fwd_2matrix_2inverse_8hpp.html',1,'']]], + ['inverse_5fsoftmax_2ehpp',['inverse_softmax.hpp',['../inverse__softmax_8hpp.html',1,'']]], + ['inverse_5fspd_2ehpp',['inverse_spd.hpp',['../inverse__spd_8hpp.html',1,'']]], + ['io_2ehpp',['io.hpp',['../io_8hpp.html',1,'']]], + ['is_5funinitialized_2ehpp',['is_uninitialized.hpp',['../agrad_2rev_2functions_2is__uninitialized_8hpp.html',1,'']]], + ['is_5funinitialized_2ehpp',['is_uninitialized.hpp',['../math_2functions_2is__uninitialized_8hpp.html',1,'']]], + ['iterator_5ftypedefs_2ehpp',['iterator_typedefs.hpp',['../iterator__typedefs_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/files_6a.html b/doc/api/html/search/files_6a.html new file mode 100644 index 00000000000..aad2e16b1be --- /dev/null +++ b/doc/api/html/search/files_6a.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/files_6a.js b/doc/api/html/search/files_6a.js new file mode 100644 index 00000000000..f49e20d2f6b --- /dev/null +++ b/doc/api/html/search/files_6a.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['jacobian_2ehpp',['jacobian.hpp',['../jacobian_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/files_6c.html b/doc/api/html/search/files_6c.html new file mode 100644 index 00000000000..642a5458562 --- /dev/null +++ b/doc/api/html/search/files_6c.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/files_6c.js b/doc/api/html/search/files_6c.js new file mode 100644 index 00000000000..7af38d6af21 --- /dev/null +++ b/doc/api/html/search/files_6c.js @@ -0,0 +1,76 @@ +var searchData= +[ + ['lbeta_2ehpp',['lbeta.hpp',['../agrad_2fwd_2functions_2lbeta_8hpp.html',1,'']]], + ['lbeta_2ehpp',['lbeta.hpp',['../math_2functions_2lbeta_8hpp.html',1,'']]], + ['ldlt_2ehpp',['ldlt.hpp',['../agrad_2rev_2matrix_2ldlt_8hpp.html',1,'']]], + ['ldlt_2ehpp',['ldlt.hpp',['../math_2matrix_2ldlt_8hpp.html',1,'']]], + ['lgamma_2ehpp',['lgamma.hpp',['../agrad_2rev_2functions_2lgamma_8hpp.html',1,'']]], + ['lgamma_2ehpp',['lgamma.hpp',['../math_2functions_2lgamma_8hpp.html',1,'']]], + ['lgamma_2ehpp',['lgamma.hpp',['../agrad_2fwd_2functions_2lgamma_8hpp.html',1,'']]], + ['list_5fargument_2ehpp',['list_argument.hpp',['../list__argument_8hpp.html',1,'']]], + ['lkj_5fcorr_2ehpp',['lkj_corr.hpp',['../lkj__corr_8hpp.html',1,'']]], + ['lkj_5fcov_2ehpp',['lkj_cov.hpp',['../lkj__cov_8hpp.html',1,'']]], + ['lmgamma_2ehpp',['lmgamma.hpp',['../math_2functions_2lmgamma_8hpp.html',1,'']]], + ['lmgamma_2ehpp',['lmgamma.hpp',['../agrad_2fwd_2functions_2lmgamma_8hpp.html',1,'']]], + ['lmgamma_2ehpp',['lmgamma.hpp',['../agrad_2rev_2functions_2lmgamma_8hpp.html',1,'']]], + ['log_2ehpp',['log.hpp',['../agrad_2fwd_2functions_2log_8hpp.html',1,'']]], + ['log_2ehpp',['log.hpp',['../agrad_2rev_2functions_2log_8hpp.html',1,'']]], + ['log_2ehpp',['log.hpp',['../math_2matrix_2log_8hpp.html',1,'']]], + ['log10_2ehpp',['log10.hpp',['../fwd_2functions_2log10_8hpp.html',1,'']]], + ['log10_2ehpp',['log10.hpp',['../rev_2functions_2log10_8hpp.html',1,'']]], + ['log1m_2ehpp',['log1m.hpp',['../math_2functions_2log1m_8hpp.html',1,'']]], + ['log1m_2ehpp',['log1m.hpp',['../agrad_2fwd_2functions_2log1m_8hpp.html',1,'']]], + ['log1m_2ehpp',['log1m.hpp',['../agrad_2rev_2functions_2log1m_8hpp.html',1,'']]], + ['log1m_5fexp_2ehpp',['log1m_exp.hpp',['../agrad_2fwd_2functions_2log1m__exp_8hpp.html',1,'']]], + ['log1m_5fexp_2ehpp',['log1m_exp.hpp',['../agrad_2rev_2functions_2log1m__exp_8hpp.html',1,'']]], + ['log1m_5fexp_2ehpp',['log1m_exp.hpp',['../math_2functions_2log1m__exp_8hpp.html',1,'']]], + ['log1m_5finv_5flogit_2ehpp',['log1m_inv_logit.hpp',['../agrad_2fwd_2functions_2log1m__inv__logit_8hpp.html',1,'']]], + ['log1m_5finv_5flogit_2ehpp',['log1m_inv_logit.hpp',['../math_2functions_2log1m__inv__logit_8hpp.html',1,'']]], + ['log1p_2ehpp',['log1p.hpp',['../agrad_2fwd_2functions_2log1p_8hpp.html',1,'']]], + ['log1p_2ehpp',['log1p.hpp',['../agrad_2rev_2functions_2log1p_8hpp.html',1,'']]], + ['log1p_2ehpp',['log1p.hpp',['../math_2functions_2log1p_8hpp.html',1,'']]], + ['log1p_5fexp_2ehpp',['log1p_exp.hpp',['../agrad_2fwd_2functions_2log1p__exp_8hpp.html',1,'']]], + ['log1p_5fexp_2ehpp',['log1p_exp.hpp',['../agrad_2rev_2functions_2log1p__exp_8hpp.html',1,'']]], + ['log1p_5fexp_2ehpp',['log1p_exp.hpp',['../math_2functions_2log1p__exp_8hpp.html',1,'']]], + ['log2_2ehpp',['log2.hpp',['../agrad_2fwd_2functions_2log2_8hpp.html',1,'']]], + ['log2_2ehpp',['log2.hpp',['../agrad_2rev_2functions_2log2_8hpp.html',1,'']]], + ['log2_2ehpp',['log2.hpp',['../math_2functions_2log2_8hpp.html',1,'']]], + ['log_5fdeterminant_2ehpp',['log_determinant.hpp',['../agrad_2fwd_2matrix_2log__determinant_8hpp.html',1,'']]], + ['log_5fdeterminant_2ehpp',['log_determinant.hpp',['../agrad_2rev_2matrix_2log__determinant_8hpp.html',1,'']]], + ['log_5fdeterminant_2ehpp',['log_determinant.hpp',['../math_2matrix_2log__determinant_8hpp.html',1,'']]], + ['log_5fdeterminant_5fspd_2ehpp',['log_determinant_spd.hpp',['../math_2matrix_2log__determinant__spd_8hpp.html',1,'']]], + ['log_5fdeterminant_5fspd_2ehpp',['log_determinant_spd.hpp',['../agrad_2rev_2matrix_2log__determinant__spd_8hpp.html',1,'']]], + ['log_5fdiff_5fexp_2ehpp',['log_diff_exp.hpp',['../agrad_2rev_2functions_2log__diff__exp_8hpp.html',1,'']]], + ['log_5fdiff_5fexp_2ehpp',['log_diff_exp.hpp',['../math_2functions_2log__diff__exp_8hpp.html',1,'']]], + ['log_5fdiff_5fexp_2ehpp',['log_diff_exp.hpp',['../agrad_2fwd_2functions_2log__diff__exp_8hpp.html',1,'']]], + ['log_5ffalling_5ffactorial_2ehpp',['log_falling_factorial.hpp',['../agrad_2fwd_2functions_2log__falling__factorial_8hpp.html',1,'']]], + ['log_5ffalling_5ffactorial_2ehpp',['log_falling_factorial.hpp',['../math_2functions_2log__falling__factorial_8hpp.html',1,'']]], + ['log_5ffalling_5ffactorial_2ehpp',['log_falling_factorial.hpp',['../agrad_2rev_2functions_2log__falling__factorial_8hpp.html',1,'']]], + ['log_5finv_5flogit_2ehpp',['log_inv_logit.hpp',['../agrad_2fwd_2functions_2log__inv__logit_8hpp.html',1,'']]], + ['log_5finv_5flogit_2ehpp',['log_inv_logit.hpp',['../math_2functions_2log__inv__logit_8hpp.html',1,'']]], + ['log_5frising_5ffactorial_2ehpp',['log_rising_factorial.hpp',['../agrad_2rev_2functions_2log__rising__factorial_8hpp.html',1,'']]], + ['log_5frising_5ffactorial_2ehpp',['log_rising_factorial.hpp',['../agrad_2fwd_2functions_2log__rising__factorial_8hpp.html',1,'']]], + ['log_5frising_5ffactorial_2ehpp',['log_rising_factorial.hpp',['../math_2functions_2log__rising__factorial_8hpp.html',1,'']]], + ['log_5fsoftmax_2ehpp',['log_softmax.hpp',['../agrad_2rev_2matrix_2log__softmax_8hpp.html',1,'']]], + ['log_5fsoftmax_2ehpp',['log_softmax.hpp',['../math_2matrix_2log__softmax_8hpp.html',1,'']]], + ['log_5fsoftmax_2ehpp',['log_softmax.hpp',['../agrad_2fwd_2matrix_2log__softmax_8hpp.html',1,'']]], + ['log_5fsum_5fexp_2ehpp',['log_sum_exp.hpp',['../math_2matrix_2log__sum__exp_8hpp.html',1,'']]], + ['log_5fsum_5fexp_2ehpp',['log_sum_exp.hpp',['../agrad_2fwd_2matrix_2log__sum__exp_8hpp.html',1,'']]], + ['log_5fsum_5fexp_2ehpp',['log_sum_exp.hpp',['../agrad_2fwd_2functions_2log__sum__exp_8hpp.html',1,'']]], + ['log_5fsum_5fexp_2ehpp',['log_sum_exp.hpp',['../agrad_2rev_2functions_2log__sum__exp_8hpp.html',1,'']]], + ['log_5fsum_5fexp_2ehpp',['log_sum_exp.hpp',['../agrad_2rev_2matrix_2log__sum__exp_8hpp.html',1,'']]], + ['log_5fsum_5fexp_2ehpp',['log_sum_exp.hpp',['../math_2functions_2log__sum__exp_8hpp.html',1,'']]], + ['logical_5fand_2ehpp',['logical_and.hpp',['../logical__and_8hpp.html',1,'']]], + ['logical_5feq_2ehpp',['logical_eq.hpp',['../logical__eq_8hpp.html',1,'']]], + ['logical_5fgt_2ehpp',['logical_gt.hpp',['../logical__gt_8hpp.html',1,'']]], + ['logical_5fgte_2ehpp',['logical_gte.hpp',['../logical__gte_8hpp.html',1,'']]], + ['logical_5flt_2ehpp',['logical_lt.hpp',['../logical__lt_8hpp.html',1,'']]], + ['logical_5flte_2ehpp',['logical_lte.hpp',['../logical__lte_8hpp.html',1,'']]], + ['logical_5fnegation_2ehpp',['logical_negation.hpp',['../logical__negation_8hpp.html',1,'']]], + ['logical_5fneq_2ehpp',['logical_neq.hpp',['../logical__neq_8hpp.html',1,'']]], + ['logical_5for_2ehpp',['logical_or.hpp',['../logical__or_8hpp.html',1,'']]], + ['logistic_2ehpp',['logistic.hpp',['../logistic_8hpp.html',1,'']]], + ['logit_2ehpp',['logit.hpp',['../math_2functions_2logit_8hpp.html',1,'']]], + ['logit_2ehpp',['logit.hpp',['../agrad_2fwd_2functions_2logit_8hpp.html',1,'']]], + ['lognormal_2ehpp',['lognormal.hpp',['../lognormal_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/files_6d.html b/doc/api/html/search/files_6d.html new file mode 100644 index 00000000000..d9d93006bf6 --- /dev/null +++ b/doc/api/html/search/files_6d.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/files_6d.js b/doc/api/html/search/files_6d.js new file mode 100644 index 00000000000..e12e0e19123 --- /dev/null +++ b/doc/api/html/search/files_6d.js @@ -0,0 +1,61 @@ +var searchData= +[ + ['mainpage_2edox',['mainpage.dox',['../mainpage_8dox.html',1,'']]], + ['math_2ehpp',['math.hpp',['../math_8hpp.html',1,'']]], + ['matrix_2ehpp',['matrix.hpp',['../agrad_2fwd_2matrix_8hpp.html',1,'']]], + ['matrix_2ehpp',['matrix.hpp',['../agrad_2rev_2error__handling_2matrix_8hpp.html',1,'']]], + ['matrix_2ehpp',['matrix.hpp',['../agrad_2rev_2matrix_8hpp.html',1,'']]], + ['matrix_2ehpp',['matrix.hpp',['../math_2matrix_8hpp.html',1,'']]], + ['matrix_5ferror_5fhandling_2ehpp',['matrix_error_handling.hpp',['../matrix__error__handling_8hpp.html',1,'']]], + ['matrix_5fnormal_2ehpp',['matrix_normal.hpp',['../matrix__normal_8hpp.html',1,'']]], + ['matrix_5fvari_2ehpp',['matrix_vari.hpp',['../matrix__vari_8hpp.html',1,'']]], + ['max_2ehpp',['max.hpp',['../functions_2max_8hpp.html',1,'']]], + ['max_2ehpp',['max.hpp',['../matrix_2max_8hpp.html',1,'']]], + ['mcmc_2ehpp',['mcmc.hpp',['../mcmc_8hpp.html',1,'']]], + ['mcmc_5fwriter_2ehpp',['mcmc_writer.hpp',['../mcmc__writer_8hpp.html',1,'']]], + ['mdivide_5fleft_2ehpp',['mdivide_left.hpp',['../agrad_2rev_2matrix_2mdivide__left_8hpp.html',1,'']]], + ['mdivide_5fleft_2ehpp',['mdivide_left.hpp',['../math_2matrix_2mdivide__left_8hpp.html',1,'']]], + ['mdivide_5fleft_2ehpp',['mdivide_left.hpp',['../agrad_2fwd_2matrix_2mdivide__left_8hpp.html',1,'']]], + ['mdivide_5fleft_5fspd_2ehpp',['mdivide_left_spd.hpp',['../math_2matrix_2mdivide__left__spd_8hpp.html',1,'']]], + ['mdivide_5fleft_5fspd_2ehpp',['mdivide_left_spd.hpp',['../agrad_2rev_2matrix_2mdivide__left__spd_8hpp.html',1,'']]], + ['mdivide_5fleft_5ftri_2ehpp',['mdivide_left_tri.hpp',['../agrad_2rev_2matrix_2mdivide__left__tri_8hpp.html',1,'']]], + ['mdivide_5fleft_5ftri_2ehpp',['mdivide_left_tri.hpp',['../math_2matrix_2mdivide__left__tri_8hpp.html',1,'']]], + ['mdivide_5fleft_5ftri_5flow_2ehpp',['mdivide_left_tri_low.hpp',['../agrad_2fwd_2matrix_2mdivide__left__tri__low_8hpp.html',1,'']]], + ['mdivide_5fleft_5ftri_5flow_2ehpp',['mdivide_left_tri_low.hpp',['../math_2matrix_2mdivide__left__tri__low_8hpp.html',1,'']]], + ['mdivide_5fright_2ehpp',['mdivide_right.hpp',['../math_2matrix_2mdivide__right_8hpp.html',1,'']]], + ['mdivide_5fright_2ehpp',['mdivide_right.hpp',['../agrad_2fwd_2matrix_2mdivide__right_8hpp.html',1,'']]], + ['mdivide_5fright_5fspd_2ehpp',['mdivide_right_spd.hpp',['../mdivide__right__spd_8hpp.html',1,'']]], + ['mdivide_5fright_5ftri_2ehpp',['mdivide_right_tri.hpp',['../mdivide__right__tri_8hpp.html',1,'']]], + ['mdivide_5fright_5ftri_5flow_2ehpp',['mdivide_right_tri_low.hpp',['../agrad_2fwd_2matrix_2mdivide__right__tri__low_8hpp.html',1,'']]], + ['mdivide_5fright_5ftri_5flow_2ehpp',['mdivide_right_tri_low.hpp',['../math_2matrix_2mdivide__right__tri__low_8hpp.html',1,'']]], + ['mean_2ehpp',['mean.hpp',['../mean_8hpp.html',1,'']]], + ['memory_2ehpp',['memory.hpp',['../memory_8hpp.html',1,'']]], + ['meta_2ehpp',['meta.hpp',['../meta_8hpp.html',1,'']]], + ['min_2ehpp',['min.hpp',['../functions_2min_8hpp.html',1,'']]], + ['min_2ehpp',['min.hpp',['../matrix_2min_8hpp.html',1,'']]], + ['minus_2ehpp',['minus.hpp',['../minus_8hpp.html',1,'']]], + ['model_2ehpp',['model.hpp',['../model_8hpp.html',1,'']]], + ['model_5fheader_2ehpp',['model_header.hpp',['../model__header_8hpp.html',1,'']]], + ['modified_5fbessel_5ffirst_5fkind_2ehpp',['modified_bessel_first_kind.hpp',['../math_2functions_2modified__bessel__first__kind_8hpp.html',1,'']]], + ['modified_5fbessel_5ffirst_5fkind_2ehpp',['modified_bessel_first_kind.hpp',['../agrad_2fwd_2functions_2modified__bessel__first__kind_8hpp.html',1,'']]], + ['modified_5fbessel_5ffirst_5fkind_2ehpp',['modified_bessel_first_kind.hpp',['../agrad_2rev_2functions_2modified__bessel__first__kind_8hpp.html',1,'']]], + ['modified_5fbessel_5fsecond_5fkind_2ehpp',['modified_bessel_second_kind.hpp',['../agrad_2rev_2functions_2modified__bessel__second__kind_8hpp.html',1,'']]], + ['modified_5fbessel_5fsecond_5fkind_2ehpp',['modified_bessel_second_kind.hpp',['../agrad_2fwd_2functions_2modified__bessel__second__kind_8hpp.html',1,'']]], + ['modified_5fbessel_5fsecond_5fkind_2ehpp',['modified_bessel_second_kind.hpp',['../math_2functions_2modified__bessel__second__kind_8hpp.html',1,'']]], + ['multi_5fgp_2ehpp',['multi_gp.hpp',['../multi__gp_8hpp.html',1,'']]], + ['multi_5fnormal_2ehpp',['multi_normal.hpp',['../multi__normal_8hpp.html',1,'']]], + ['multi_5fnormal_5fcholesky_2ehpp',['multi_normal_cholesky.hpp',['../multi__normal__cholesky_8hpp.html',1,'']]], + ['multi_5fnormal_5fprec_2ehpp',['multi_normal_prec.hpp',['../multi__normal__prec_8hpp.html',1,'']]], + ['multi_5fstudent_5ft_2ehpp',['multi_student_t.hpp',['../multi__student__t_8hpp.html',1,'']]], + ['multinomial_2ehpp',['multinomial.hpp',['../multinomial_8hpp.html',1,'']]], + ['multiply_2ehpp',['multiply.hpp',['../math_2matrix_2multiply_8hpp.html',1,'']]], + ['multiply_2ehpp',['multiply.hpp',['../agrad_2fwd_2matrix_2multiply_8hpp.html',1,'']]], + ['multiply_2ehpp',['multiply.hpp',['../agrad_2rev_2matrix_2multiply_8hpp.html',1,'']]], + ['multiply_5flog_2ehpp',['multiply_log.hpp',['../agrad_2fwd_2functions_2multiply__log_8hpp.html',1,'']]], + ['multiply_5flog_2ehpp',['multiply_log.hpp',['../agrad_2rev_2functions_2multiply__log_8hpp.html',1,'']]], + ['multiply_5flog_2ehpp',['multiply_log.hpp',['../math_2functions_2multiply__log_8hpp.html',1,'']]], + ['multiply_5flower_5ftri_5fself_5ftranspose_2ehpp',['multiply_lower_tri_self_transpose.hpp',['../math_2matrix_2multiply__lower__tri__self__transpose_8hpp.html',1,'']]], + ['multiply_5flower_5ftri_5fself_5ftranspose_2ehpp',['multiply_lower_tri_self_transpose.hpp',['../agrad_2rev_2matrix_2multiply__lower__tri__self__transpose_8hpp.html',1,'']]], + ['multiply_5flower_5ftri_5fself_5ftranspose_2ehpp',['multiply_lower_tri_self_transpose.hpp',['../agrad_2fwd_2matrix_2multiply__lower__tri__self__transpose_8hpp.html',1,'']]], + ['multivariate_2ehpp',['multivariate.hpp',['../multivariate_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/files_6e.html b/doc/api/html/search/files_6e.html new file mode 100644 index 00000000000..9e30d62e7a7 --- /dev/null +++ b/doc/api/html/search/files_6e.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/files_6e.js b/doc/api/html/search/files_6e.js new file mode 100644 index 00000000000..9b529ace117 --- /dev/null +++ b/doc/api/html/search/files_6e.js @@ -0,0 +1,10 @@ +var searchData= +[ + ['neg_5fbinomial_2ehpp',['neg_binomial.hpp',['../neg__binomial_8hpp.html',1,'']]], + ['nesterov_5fgradient_2ehpp',['nesterov_gradient.hpp',['../nesterov__gradient_8hpp.html',1,'']]], + ['newton_2ehpp',['newton.hpp',['../newton_8hpp.html',1,'']]], + ['normal_2ehpp',['normal.hpp',['../prob_2distributions_2univariate_2continuous_2normal_8hpp.html',1,'']]], + ['normal_2ehpp',['normal.hpp',['../agrad_2fwd_2prob_2univariate_2continuous_2normal_8hpp.html',1,'']]], + ['numeric_5flimits_2ehpp',['numeric_limits.hpp',['../fwd_2numeric__limits_8hpp.html',1,'']]], + ['numeric_5flimits_2ehpp',['numeric_limits.hpp',['../rev_2numeric__limits_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/files_6f.html b/doc/api/html/search/files_6f.html new file mode 100644 index 00000000000..127aac1efab --- /dev/null +++ b/doc/api/html/search/files_6f.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/files_6f.js b/doc/api/html/search/files_6f.js new file mode 100644 index 00000000000..6c8d781d699 --- /dev/null +++ b/doc/api/html/search/files_6f.js @@ -0,0 +1,39 @@ +var searchData= +[ + ['operator_5faddition_2ehpp',['operator_addition.hpp',['../fwd_2operators_2operator__addition_8hpp.html',1,'']]], + ['operator_5faddition_2ehpp',['operator_addition.hpp',['../rev_2operators_2operator__addition_8hpp.html',1,'']]], + ['operator_5fdivide_5fequal_2ehpp',['operator_divide_equal.hpp',['../operator__divide__equal_8hpp.html',1,'']]], + ['operator_5fdivision_2ehpp',['operator_division.hpp',['../fwd_2operators_2operator__division_8hpp.html',1,'']]], + ['operator_5fdivision_2ehpp',['operator_division.hpp',['../rev_2operators_2operator__division_8hpp.html',1,'']]], + ['operator_5fequal_2ehpp',['operator_equal.hpp',['../fwd_2operators_2operator__equal_8hpp.html',1,'']]], + ['operator_5fequal_2ehpp',['operator_equal.hpp',['../rev_2operators_2operator__equal_8hpp.html',1,'']]], + ['operator_5fgreater_5fthan_2ehpp',['operator_greater_than.hpp',['../fwd_2operators_2operator__greater__than_8hpp.html',1,'']]], + ['operator_5fgreater_5fthan_2ehpp',['operator_greater_than.hpp',['../rev_2operators_2operator__greater__than_8hpp.html',1,'']]], + ['operator_5fgreater_5fthan_5for_5fequal_2ehpp',['operator_greater_than_or_equal.hpp',['../fwd_2operators_2operator__greater__than__or__equal_8hpp.html',1,'']]], + ['operator_5fgreater_5fthan_5for_5fequal_2ehpp',['operator_greater_than_or_equal.hpp',['../rev_2operators_2operator__greater__than__or__equal_8hpp.html',1,'']]], + ['operator_5fless_5fthan_2ehpp',['operator_less_than.hpp',['../fwd_2operators_2operator__less__than_8hpp.html',1,'']]], + ['operator_5fless_5fthan_2ehpp',['operator_less_than.hpp',['../rev_2operators_2operator__less__than_8hpp.html',1,'']]], + ['operator_5fless_5fthan_5for_5fequal_2ehpp',['operator_less_than_or_equal.hpp',['../fwd_2operators_2operator__less__than__or__equal_8hpp.html',1,'']]], + ['operator_5fless_5fthan_5for_5fequal_2ehpp',['operator_less_than_or_equal.hpp',['../rev_2operators_2operator__less__than__or__equal_8hpp.html',1,'']]], + ['operator_5fminus_5fequal_2ehpp',['operator_minus_equal.hpp',['../operator__minus__equal_8hpp.html',1,'']]], + ['operator_5fmultiplication_2ehpp',['operator_multiplication.hpp',['../fwd_2operators_2operator__multiplication_8hpp.html',1,'']]], + ['operator_5fmultiplication_2ehpp',['operator_multiplication.hpp',['../rev_2operators_2operator__multiplication_8hpp.html',1,'']]], + ['operator_5fmultiply_5fequal_2ehpp',['operator_multiply_equal.hpp',['../operator__multiply__equal_8hpp.html',1,'']]], + ['operator_5fnot_5fequal_2ehpp',['operator_not_equal.hpp',['../rev_2operators_2operator__not__equal_8hpp.html',1,'']]], + ['operator_5fnot_5fequal_2ehpp',['operator_not_equal.hpp',['../fwd_2operators_2operator__not__equal_8hpp.html',1,'']]], + ['operator_5fplus_5fequal_2ehpp',['operator_plus_equal.hpp',['../operator__plus__equal_8hpp.html',1,'']]], + ['operator_5fsubtraction_2ehpp',['operator_subtraction.hpp',['../rev_2operators_2operator__subtraction_8hpp.html',1,'']]], + ['operator_5fsubtraction_2ehpp',['operator_subtraction.hpp',['../fwd_2operators_2operator__subtraction_8hpp.html',1,'']]], + ['operator_5funary_5fdecrement_2ehpp',['operator_unary_decrement.hpp',['../operator__unary__decrement_8hpp.html',1,'']]], + ['operator_5funary_5fincrement_2ehpp',['operator_unary_increment.hpp',['../operator__unary__increment_8hpp.html',1,'']]], + ['operator_5funary_5fminus_2ehpp',['operator_unary_minus.hpp',['../operator__unary__minus_8hpp.html',1,'']]], + ['operator_5funary_5fnegative_2ehpp',['operator_unary_negative.hpp',['../operator__unary__negative_8hpp.html',1,'']]], + ['operator_5funary_5fnot_2ehpp',['operator_unary_not.hpp',['../operator__unary__not_8hpp.html',1,'']]], + ['operator_5funary_5fplus_2ehpp',['operator_unary_plus.hpp',['../operator__unary__plus_8hpp.html',1,'']]], + ['operators_2ehpp',['operators.hpp',['../fwd_2operators_8hpp.html',1,'']]], + ['operators_2ehpp',['operators.hpp',['../rev_2operators_8hpp.html',1,'']]], + ['ordered_5flogistic_2ehpp',['ordered_logistic.hpp',['../ordered__logistic_8hpp.html',1,'']]], + ['owens_5ft_2ehpp',['owens_t.hpp',['../agrad_2rev_2functions_2owens__t_8hpp.html',1,'']]], + ['owens_5ft_2ehpp',['owens_t.hpp',['../math_2functions_2owens__t_8hpp.html',1,'']]], + ['owens_5ft_2ehpp',['owens_t.hpp',['../agrad_2fwd_2functions_2owens__t_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/files_70.html b/doc/api/html/search/files_70.html new file mode 100644 index 00000000000..abcae9a6f06 --- /dev/null +++ b/doc/api/html/search/files_70.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/files_70.js b/doc/api/html/search/files_70.js new file mode 100644 index 00000000000..3412d45d539 --- /dev/null +++ b/doc/api/html/search/files_70.js @@ -0,0 +1,27 @@ +var searchData= +[ + ['pareto_2ehpp',['pareto.hpp',['../pareto_8hpp.html',1,'']]], + ['parser_2ehpp',['parser.hpp',['../parser_8hpp.html',1,'']]], + ['partials_5fvari_2ehpp',['partials_vari.hpp',['../partials__vari_8hpp.html',1,'']]], + ['phi_2ehpp',['Phi.hpp',['../agrad_2rev_2functions_2_phi_8hpp.html',1,'']]], + ['phi_2ehpp',['Phi.hpp',['../agrad_2fwd_2functions_2_phi_8hpp.html',1,'']]], + ['phi_2ehpp',['Phi.hpp',['../math_2functions_2_phi_8hpp.html',1,'']]], + ['phi_5fapprox_2ehpp',['Phi_approx.hpp',['../math_2functions_2_phi__approx_8hpp.html',1,'']]], + ['phi_5fapprox_2ehpp',['Phi_approx.hpp',['../agrad_2rev_2functions_2_phi__approx_8hpp.html',1,'']]], + ['poisson_2ehpp',['poisson.hpp',['../poisson_8hpp.html',1,'']]], + ['pow_2ehpp',['pow.hpp',['../fwd_2functions_2pow_8hpp.html',1,'']]], + ['pow_2ehpp',['pow.hpp',['../rev_2functions_2pow_8hpp.html',1,'']]], + ['precomp_5fv_5fvari_2ehpp',['precomp_v_vari.hpp',['../precomp__v__vari_8hpp.html',1,'']]], + ['print_2ecpp',['print.cpp',['../print_8cpp.html',1,'']]], + ['print_2ehpp',['print.hpp',['../print_8hpp.html',1,'']]], + ['print_5fstack_2ehpp',['print_stack.hpp',['../print__stack_8hpp.html',1,'']]], + ['prob_2ehpp',['prob.hpp',['../prob_8hpp.html',1,'']]], + ['prob_5fgrad_2ehpp',['prob_grad.hpp',['../prob__grad_8hpp.html',1,'']]], + ['prod_2ehpp',['prod.hpp',['../prod_8hpp.html',1,'']]], + ['program_5fgrammar_2ehpp',['program_grammar.hpp',['../program__grammar_8hpp.html',1,'']]], + ['program_5fgrammar_5fdef_2ehpp',['program_grammar_def.hpp',['../program__grammar__def_8hpp.html',1,'']]], + ['program_5fgrammar_5finst_2ecpp',['program_grammar_inst.cpp',['../program__grammar__inst_8cpp.html',1,'']]], + ['promote_5fcommon_2ehpp',['promote_common.hpp',['../promote__common_8hpp.html',1,'']]], + ['promoter_2ehpp',['promoter.hpp',['../promoter_8hpp.html',1,'']]], + ['ps_5fpoint_2ehpp',['ps_point.hpp',['../ps__point_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/files_71.html b/doc/api/html/search/files_71.html new file mode 100644 index 00000000000..bb4ccc7cc57 --- /dev/null +++ b/doc/api/html/search/files_71.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/files_71.js b/doc/api/html/search/files_71.js new file mode 100644 index 00000000000..40af2b32a34 --- /dev/null +++ b/doc/api/html/search/files_71.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['quad_5fform_2ehpp',['quad_form.hpp',['../agrad_2rev_2matrix_2quad__form_8hpp.html',1,'']]], + ['quad_5fform_2ehpp',['quad_form.hpp',['../math_2matrix_2quad__form_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/files_72.html b/doc/api/html/search/files_72.html new file mode 100644 index 00000000000..609fb48fc37 --- /dev/null +++ b/doc/api/html/search/files_72.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/files_72.js b/doc/api/html/search/files_72.js new file mode 100644 index 00000000000..e3955ef4fa4 --- /dev/null +++ b/doc/api/html/search/files_72.js @@ -0,0 +1,24 @@ +var searchData= +[ + ['raise_5fdomain_5ferror_2ehpp',['raise_domain_error.hpp',['../raise__domain__error_8hpp.html',1,'']]], + ['rank_2ehpp',['rank.hpp',['../rank_8hpp.html',1,'']]], + ['rayleigh_2ehpp',['rayleigh.hpp',['../rayleigh_8hpp.html',1,'']]], + ['reader_2ehpp',['reader.hpp',['../reader_8hpp.html',1,'']]], + ['rep_5farray_2ehpp',['rep_array.hpp',['../rep__array_8hpp.html',1,'']]], + ['rep_5fmatrix_2ehpp',['rep_matrix.hpp',['../rep__matrix_8hpp.html',1,'']]], + ['rep_5frow_5fvector_2ehpp',['rep_row_vector.hpp',['../rep__row__vector_8hpp.html',1,'']]], + ['rep_5fvector_2ehpp',['rep_vector.hpp',['../rep__vector_8hpp.html',1,'']]], + ['resize_2ehpp',['resize.hpp',['../resize_8hpp.html',1,'']]], + ['rev_2ehpp',['rev.hpp',['../rev_8hpp.html',1,'']]], + ['rising_5ffactorial_2ehpp',['rising_factorial.hpp',['../agrad_2rev_2functions_2rising__factorial_8hpp.html',1,'']]], + ['rising_5ffactorial_2ehpp',['rising_factorial.hpp',['../math_2functions_2rising__factorial_8hpp.html',1,'']]], + ['rising_5ffactorial_2ehpp',['rising_factorial.hpp',['../agrad_2fwd_2functions_2rising__factorial_8hpp.html',1,'']]], + ['round_2ehpp',['round.hpp',['../fwd_2functions_2round_8hpp.html',1,'']]], + ['round_2ehpp',['round.hpp',['../rev_2functions_2round_8hpp.html',1,'']]], + ['row_2ehpp',['row.hpp',['../row_8hpp.html',1,'']]], + ['rows_2ehpp',['rows.hpp',['../rows_8hpp.html',1,'']]], + ['rows_5fdot_5fproduct_2ehpp',['rows_dot_product.hpp',['../agrad_2fwd_2matrix_2rows__dot__product_8hpp.html',1,'']]], + ['rows_5fdot_5fproduct_2ehpp',['rows_dot_product.hpp',['../math_2matrix_2rows__dot__product_8hpp.html',1,'']]], + ['rows_5fdot_5fself_2ehpp',['rows_dot_self.hpp',['../agrad_2fwd_2matrix_2rows__dot__self_8hpp.html',1,'']]], + ['rows_5fdot_5fself_2ehpp',['rows_dot_self.hpp',['../math_2matrix_2rows__dot__self_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/files_73.html b/doc/api/html/search/files_73.html new file mode 100644 index 00000000000..e0de9e6b55d --- /dev/null +++ b/doc/api/html/search/files_73.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/files_73.js b/doc/api/html/search/files_73.js new file mode 100644 index 00000000000..0cb6ec0a8e6 --- /dev/null +++ b/doc/api/html/search/files_73.js @@ -0,0 +1,61 @@ +var searchData= +[ + ['sample_2ehpp',['sample.hpp',['../sample_8hpp.html',1,'']]], + ['scaled_5fadd_2ehpp',['scaled_add.hpp',['../scaled__add_8hpp.html',1,'']]], + ['scaled_5finv_5fchi_5fsquare_2ehpp',['scaled_inv_chi_square.hpp',['../scaled__inv__chi__square_8hpp.html',1,'']]], + ['sd_2ehpp',['sd.hpp',['../agrad_2rev_2matrix_2sd_8hpp.html',1,'']]], + ['sd_2ehpp',['sd.hpp',['../math_2matrix_2sd_8hpp.html',1,'']]], + ['segment_2ehpp',['segment.hpp',['../segment_8hpp.html',1,'']]], + ['seq_5fview_2ehpp',['seq_view.hpp',['../seq__view_8hpp.html',1,'']]], + ['sin_2ehpp',['sin.hpp',['../rev_2functions_2sin_8hpp.html',1,'']]], + ['sin_2ehpp',['sin.hpp',['../fwd_2functions_2sin_8hpp.html',1,'']]], + ['singleton_5fargument_2ehpp',['singleton_argument.hpp',['../singleton__argument_8hpp.html',1,'']]], + ['singular_5fvalues_2ehpp',['singular_values.hpp',['../singular__values_8hpp.html',1,'']]], + ['sinh_2ehpp',['sinh.hpp',['../fwd_2functions_2sinh_8hpp.html',1,'']]], + ['sinh_2ehpp',['sinh.hpp',['../rev_2functions_2sinh_8hpp.html',1,'']]], + ['size_2ehpp',['size.hpp',['../size_8hpp.html',1,'']]], + ['skew_5fnormal_2ehpp',['skew_normal.hpp',['../skew__normal_8hpp.html',1,'']]], + ['softmax_2ehpp',['softmax.hpp',['../agrad_2fwd_2matrix_2softmax_8hpp.html',1,'']]], + ['softmax_2ehpp',['softmax.hpp',['../agrad_2rev_2matrix_2softmax_8hpp.html',1,'']]], + ['softmax_2ehpp',['softmax.hpp',['../math_2matrix_2softmax_8hpp.html',1,'']]], + ['sort_2ehpp',['sort.hpp',['../agrad_2rev_2matrix_2sort_8hpp.html',1,'']]], + ['sort_2ehpp',['sort.hpp',['../math_2matrix_2sort_8hpp.html',1,'']]], + ['sort_2ehpp',['sort.hpp',['../agrad_2fwd_2matrix_2sort_8hpp.html',1,'']]], + ['sqrt_2ehpp',['sqrt.hpp',['../rev_2functions_2sqrt_8hpp.html',1,'']]], + ['sqrt_2ehpp',['sqrt.hpp',['../fwd_2functions_2sqrt_8hpp.html',1,'']]], + ['square_2ehpp',['square.hpp',['../agrad_2fwd_2functions_2square_8hpp.html',1,'']]], + ['square_2ehpp',['square.hpp',['../agrad_2rev_2functions_2square_8hpp.html',1,'']]], + ['square_2ehpp',['square.hpp',['../math_2functions_2square_8hpp.html',1,'']]], + ['squared_5fdist_2ehpp',['squared_dist.hpp',['../agrad_2rev_2matrix_2squared__dist_8hpp.html',1,'']]], + ['squared_5fdist_2ehpp',['squared_dist.hpp',['../math_2matrix_2squared__dist_8hpp.html',1,'']]], + ['stack_5falloc_2ehpp',['stack_alloc.hpp',['../stack__alloc_8hpp.html',1,'']]], + ['stan_2edox',['stan.dox',['../stan_8dox.html',1,'']]], + ['stan_5fcsv_5freader_2ehpp',['stan_csv_reader.hpp',['../stan__csv__reader_8hpp.html',1,'']]], + ['stan_5fprint_2ehpp',['stan_print.hpp',['../agrad_2rev_2matrix_2stan__print_8hpp.html',1,'']]], + ['stan_5fprint_2ehpp',['stan_print.hpp',['../math_2matrix_2stan__print_8hpp.html',1,'']]], + ['stanc_2ecpp',['stanc.cpp',['../stanc_8cpp.html',1,'']]], + ['stanc_5fhelper_2ehpp',['stanc_helper.hpp',['../stanc__helper_8hpp.html',1,'']]], + ['statement_5f2_5fgrammar_2ehpp',['statement_2_grammar.hpp',['../statement__2__grammar_8hpp.html',1,'']]], + ['statement_5f2_5fgrammar_5fdef_2ehpp',['statement_2_grammar_def.hpp',['../statement__2__grammar__def_8hpp.html',1,'']]], + ['statement_5f2_5fgrammar_5finst_2ecpp',['statement_2_grammar_inst.cpp',['../statement__2__grammar__inst_8cpp.html',1,'']]], + ['statement_5fgrammar_2ehpp',['statement_grammar.hpp',['../statement__grammar_8hpp.html',1,'']]], + ['statement_5fgrammar_5fdef_2ehpp',['statement_grammar_def.hpp',['../statement__grammar__def_8hpp.html',1,'']]], + ['statement_5fgrammar_5finst_2ecpp',['statement_grammar_inst.cpp',['../statement__grammar__inst_8cpp.html',1,'']]], + ['std_2edox',['std.dox',['../std_8dox.html',1,'']]], + ['step_2ehpp',['step.hpp',['../agrad_2rev_2functions_2step_8hpp.html',1,'']]], + ['step_2ehpp',['step.hpp',['../math_2functions_2step_8hpp.html',1,'']]], + ['stepsize_5fadaptation_2ehpp',['stepsize_adaptation.hpp',['../stepsize__adaptation_8hpp.html',1,'']]], + ['stepsize_5fadapter_2ehpp',['stepsize_adapter.hpp',['../stepsize__adapter_8hpp.html',1,'']]], + ['stepsize_5fcovar_5fadapter_2ehpp',['stepsize_covar_adapter.hpp',['../stepsize__covar__adapter_8hpp.html',1,'']]], + ['stepsize_5fvar_5fadapter_2ehpp',['stepsize_var_adapter.hpp',['../stepsize__var__adapter_8hpp.html',1,'']]], + ['stored_5fgradient_5fvari_2ehpp',['stored_gradient_vari.hpp',['../stored__gradient__vari_8hpp.html',1,'']]], + ['student_5ft_2ehpp',['student_t.hpp',['../student__t_8hpp.html',1,'']]], + ['sub_2ehpp',['sub.hpp',['../sub_8hpp.html',1,'']]], + ['sub_5fcol_2ehpp',['sub_col.hpp',['../sub__col_8hpp.html',1,'']]], + ['sub_5frow_2ehpp',['sub_row.hpp',['../sub__row_8hpp.html',1,'']]], + ['subtract_2ehpp',['subtract.hpp',['../subtract_8hpp.html',1,'']]], + ['sum_2ehpp',['sum.hpp',['../math_2functions_2sum_8hpp.html',1,'']]], + ['sum_2ehpp',['sum.hpp',['../agrad_2rev_2matrix_2sum_8hpp.html',1,'']]], + ['sum_2ehpp',['sum.hpp',['../agrad_2fwd_2matrix_2sum_8hpp.html',1,'']]], + ['sum_2ehpp',['sum.hpp',['../math_2matrix_2sum_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/files_74.html b/doc/api/html/search/files_74.html new file mode 100644 index 00000000000..017b3fe9fa0 --- /dev/null +++ b/doc/api/html/search/files_74.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/files_74.js b/doc/api/html/search/files_74.js new file mode 100644 index 00000000000..5aa3786ba26 --- /dev/null +++ b/doc/api/html/search/files_74.js @@ -0,0 +1,34 @@ +var searchData= +[ + ['tail_2ehpp',['tail.hpp',['../tail_8hpp.html',1,'']]], + ['tan_2ehpp',['tan.hpp',['../rev_2functions_2tan_8hpp.html',1,'']]], + ['tan_2ehpp',['tan.hpp',['../fwd_2functions_2tan_8hpp.html',1,'']]], + ['tanh_2ehpp',['tanh.hpp',['../rev_2functions_2tanh_8hpp.html',1,'']]], + ['tanh_2ehpp',['tanh.hpp',['../fwd_2functions_2tanh_8hpp.html',1,'']]], + ['tcrossprod_2ehpp',['tcrossprod.hpp',['../agrad_2fwd_2matrix_2tcrossprod_8hpp.html',1,'']]], + ['tcrossprod_2ehpp',['tcrossprod.hpp',['../agrad_2rev_2matrix_2tcrossprod_8hpp.html',1,'']]], + ['tcrossprod_2ehpp',['tcrossprod.hpp',['../math_2matrix_2tcrossprod_8hpp.html',1,'']]], + ['term_5fgrammar_2ehpp',['term_grammar.hpp',['../term__grammar_8hpp.html',1,'']]], + ['term_5fgrammar_5fdef_2ehpp',['term_grammar_def.hpp',['../term__grammar__def_8hpp.html',1,'']]], + ['term_5fgrammar_5finst_2ecpp',['term_grammar_inst.cpp',['../term__grammar__inst_8cpp.html',1,'']]], + ['tgamma_2ehpp',['tgamma.hpp',['../fwd_2functions_2tgamma_8hpp.html',1,'']]], + ['tgamma_2ehpp',['tgamma.hpp',['../rev_2functions_2tgamma_8hpp.html',1,'']]], + ['to_5ffvar_2ehpp',['to_fvar.hpp',['../to__fvar_8hpp.html',1,'']]], + ['to_5fvar_2ehpp',['to_var.hpp',['../to__var_8hpp.html',1,'']]], + ['to_5fvector_2ehpp',['to_vector.hpp',['../to__vector_8hpp.html',1,'']]], + ['trace_2ehpp',['trace.hpp',['../trace_8hpp.html',1,'']]], + ['trace_5fgen_5fquad_5fform_2ehpp',['trace_gen_quad_form.hpp',['../agrad_2rev_2matrix_2trace__gen__quad__form_8hpp.html',1,'']]], + ['trace_5fgen_5fquad_5fform_2ehpp',['trace_gen_quad_form.hpp',['../math_2matrix_2trace__gen__quad__form_8hpp.html',1,'']]], + ['trace_5fquad_5fform_2ehpp',['trace_quad_form.hpp',['../math_2matrix_2trace__quad__form_8hpp.html',1,'']]], + ['trace_5fquad_5fform_2ehpp',['trace_quad_form.hpp',['../agrad_2rev_2matrix_2trace__quad__form_8hpp.html',1,'']]], + ['traits_2ehpp',['traits.hpp',['../prob_2traits_8hpp.html',1,'']]], + ['traits_2ehpp',['traits.hpp',['../meta_2traits_8hpp.html',1,'']]], + ['transform_2ehpp',['transform.hpp',['../transform_8hpp.html',1,'']]], + ['transpose_2ehpp',['transpose.hpp',['../transpose_8hpp.html',1,'']]], + ['trigamma_2ehpp',['trigamma.hpp',['../trigamma_8hpp.html',1,'']]], + ['trunc_2ehpp',['trunc.hpp',['../rev_2functions_2trunc_8hpp.html',1,'']]], + ['trunc_2ehpp',['trunc.hpp',['../fwd_2functions_2trunc_8hpp.html',1,'']]], + ['typedefs_2ehpp',['typedefs.hpp',['../math_2matrix_2typedefs_8hpp.html',1,'']]], + ['typedefs_2ehpp',['typedefs.hpp',['../agrad_2fwd_2matrix_2typedefs_8hpp.html',1,'']]], + ['typedefs_2ehpp',['typedefs.hpp',['../agrad_2rev_2matrix_2typedefs_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/files_75.html b/doc/api/html/search/files_75.html new file mode 100644 index 00000000000..8ea7b3d4b84 --- /dev/null +++ b/doc/api/html/search/files_75.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/files_75.js b/doc/api/html/search/files_75.js new file mode 100644 index 00000000000..44119bd2407 --- /dev/null +++ b/doc/api/html/search/files_75.js @@ -0,0 +1,12 @@ +var searchData= +[ + ['uniform_2ehpp',['uniform.hpp',['../uniform_8hpp.html',1,'']]], + ['unit_5fe_5fmetric_2ehpp',['unit_e_metric.hpp',['../unit__e__metric_8hpp.html',1,'']]], + ['unit_5fe_5fnuts_2ehpp',['unit_e_nuts.hpp',['../unit__e__nuts_8hpp.html',1,'']]], + ['unit_5fe_5fpoint_2ehpp',['unit_e_point.hpp',['../unit__e__point_8hpp.html',1,'']]], + ['unit_5fe_5fstatic_5fhmc_2ehpp',['unit_e_static_hmc.hpp',['../unit__e__static__hmc_8hpp.html',1,'']]], + ['univariate_2ehpp',['univariate.hpp',['../univariate_8hpp.html',1,'']]], + ['unvalued_5fargument_2ehpp',['unvalued_argument.hpp',['../unvalued__argument_8hpp.html',1,'']]], + ['util_2ehpp',['util.hpp',['../model_2util_8hpp.html',1,'']]], + ['util_2ehpp',['util.hpp',['../io_2util_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/files_76.html b/doc/api/html/search/files_76.html new file mode 100644 index 00000000000..e53e134cd31 --- /dev/null +++ b/doc/api/html/search/files_76.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/files_76.js b/doc/api/html/search/files_76.js new file mode 100644 index 00000000000..5e0e11ff2fb --- /dev/null +++ b/doc/api/html/search/files_76.js @@ -0,0 +1,44 @@ +var searchData= +[ + ['v_5fvari_2ehpp',['v_vari.hpp',['../v__vari_8hpp.html',1,'']]], + ['validate_5fcolumn_5findex_2ehpp',['validate_column_index.hpp',['../validate__column__index_8hpp.html',1,'']]], + ['validate_5fgreater_2ehpp',['validate_greater.hpp',['../validate__greater_8hpp.html',1,'']]], + ['validate_5fgreater_5for_5fequal_2ehpp',['validate_greater_or_equal.hpp',['../validate__greater__or__equal_8hpp.html',1,'']]], + ['validate_5fless_2ehpp',['validate_less.hpp',['../validate__less_8hpp.html',1,'']]], + ['validate_5fless_5for_5fequal_2ehpp',['validate_less_or_equal.hpp',['../validate__less__or__equal_8hpp.html',1,'']]], + ['validate_5fmatching_5fdims_2ehpp',['validate_matching_dims.hpp',['../validate__matching__dims_8hpp.html',1,'']]], + ['validate_5fmatching_5fsizes_2ehpp',['validate_matching_sizes.hpp',['../validate__matching__sizes_8hpp.html',1,'']]], + ['validate_5fmultiplicable_2ehpp',['validate_multiplicable.hpp',['../validate__multiplicable_8hpp.html',1,'']]], + ['validate_5fnon_5fnegative_5findex_2ehpp',['validate_non_negative_index.hpp',['../validate__non__negative__index_8hpp.html',1,'']]], + ['validate_5fnon_5fnegative_5frep_2ehpp',['validate_non_negative_rep.hpp',['../validate__non__negative__rep_8hpp.html',1,'']]], + ['validate_5fnonzero_5fsize_2ehpp',['validate_nonzero_size.hpp',['../validate__nonzero__size_8hpp.html',1,'']]], + ['validate_5frow_5findex_2ehpp',['validate_row_index.hpp',['../validate__row__index_8hpp.html',1,'']]], + ['validate_5fsquare_2ehpp',['validate_square.hpp',['../validate__square_8hpp.html',1,'']]], + ['validate_5fstd_5fvector_5findex_2ehpp',['validate_std_vector_index.hpp',['../validate__std__vector__index_8hpp.html',1,'']]], + ['validate_5fsymmetric_2ehpp',['validate_symmetric.hpp',['../validate__symmetric_8hpp.html',1,'']]], + ['validate_5fvector_2ehpp',['validate_vector.hpp',['../validate__vector_8hpp.html',1,'']]], + ['value_5fof_2ehpp',['value_of.hpp',['../agrad_2rev_2matrix_2value__of_8hpp.html',1,'']]], + ['value_5fof_2ehpp',['value_of.hpp',['../agrad_2rev_2functions_2value__of_8hpp.html',1,'']]], + ['value_5fof_2ehpp',['value_of.hpp',['../math_2functions_2value__of_8hpp.html',1,'']]], + ['valued_5fargument_2ehpp',['valued_argument.hpp',['../valued__argument_8hpp.html',1,'']]], + ['var_2ehpp',['var.hpp',['../var_8hpp.html',1,'']]], + ['var_5fadaptation_2ehpp',['var_adaptation.hpp',['../var__adaptation_8hpp.html',1,'']]], + ['var_5fcontext_2ehpp',['var_context.hpp',['../var__context_8hpp.html',1,'']]], + ['var_5fdecls_5fgrammar_2ehpp',['var_decls_grammar.hpp',['../var__decls__grammar_8hpp.html',1,'']]], + ['var_5fdecls_5fgrammar_5fdef_2ehpp',['var_decls_grammar_def.hpp',['../var__decls__grammar__def_8hpp.html',1,'']]], + ['var_5fdecls_5fgrammar_5finst_2ecpp',['var_decls_grammar_inst.cpp',['../var__decls__grammar__inst_8cpp.html',1,'']]], + ['var_5fstack_2ecpp',['var_stack.cpp',['../var__stack_8cpp.html',1,'']]], + ['var_5fstack_2ehpp',['var_stack.hpp',['../var__stack_8hpp.html',1,'']]], + ['vari_2ehpp',['vari.hpp',['../vari_8hpp.html',1,'']]], + ['variance_2ehpp',['variance.hpp',['../agrad_2rev_2matrix_2variance_8hpp.html',1,'']]], + ['variance_2ehpp',['variance.hpp',['../math_2matrix_2variance_8hpp.html',1,'']]], + ['vd_5fvari_2ehpp',['vd_vari.hpp',['../vd__vari_8hpp.html',1,'']]], + ['vdd_5fvari_2ehpp',['vdd_vari.hpp',['../vdd__vari_8hpp.html',1,'']]], + ['vdv_5fvari_2ehpp',['vdv_vari.hpp',['../vdv__vari_8hpp.html',1,'']]], + ['vector_5fvari_2ehpp',['vector_vari.hpp',['../vector__vari_8hpp.html',1,'']]], + ['version_2ehpp',['version.hpp',['../version_8hpp.html',1,'']]], + ['von_5fmises_2ehpp',['von_mises.hpp',['../von__mises_8hpp.html',1,'']]], + ['vv_5fvari_2ehpp',['vv_vari.hpp',['../vv__vari_8hpp.html',1,'']]], + ['vvd_5fvari_2ehpp',['vvd_vari.hpp',['../vvd__vari_8hpp.html',1,'']]], + ['vvv_5fvari_2ehpp',['vvv_vari.hpp',['../vvv__vari_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/files_77.html b/doc/api/html/search/files_77.html new file mode 100644 index 00000000000..69f6897820e --- /dev/null +++ b/doc/api/html/search/files_77.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/files_77.js b/doc/api/html/search/files_77.js new file mode 100644 index 00000000000..b237fac7c5d --- /dev/null +++ b/doc/api/html/search/files_77.js @@ -0,0 +1,12 @@ +var searchData= +[ + ['weibull_2ehpp',['weibull.hpp',['../weibull_8hpp.html',1,'']]], + ['welford_5fcovar_5festimator_2ehpp',['welford_covar_estimator.hpp',['../welford__covar__estimator_8hpp.html',1,'']]], + ['welford_5fvar_5festimator_2ehpp',['welford_var_estimator.hpp',['../welford__var__estimator_8hpp.html',1,'']]], + ['whitespace_5fgrammar_2ehpp',['whitespace_grammar.hpp',['../whitespace__grammar_8hpp.html',1,'']]], + ['whitespace_5fgrammar_5fdef_2ehpp',['whitespace_grammar_def.hpp',['../whitespace__grammar__def_8hpp.html',1,'']]], + ['whitespace_5fgrammar_5finst_2ecpp',['whitespace_grammar_inst.cpp',['../whitespace__grammar__inst_8cpp.html',1,'']]], + ['windowed_5fadaptation_2ehpp',['windowed_adaptation.hpp',['../windowed__adaptation_8hpp.html',1,'']]], + ['wishart_2ehpp',['wishart.hpp',['../wishart_8hpp.html',1,'']]], + ['writer_2ehpp',['writer.hpp',['../writer_8hpp.html',1,'']]] +]; diff --git a/doc/api/html/search/functions_5f.html b/doc/api/html/search/functions_5f.html new file mode 100644 index 00000000000..cb54e927d59 --- /dev/null +++ b/doc/api/html/search/functions_5f.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/functions_5f.js b/doc/api/html/search/functions_5f.js new file mode 100644 index 00000000000..a931b1f859a --- /dev/null +++ b/doc/api/html/search/functions_5f.js @@ -0,0 +1,7 @@ +var searchData= +[ + ['_5ffast_5fmatrix_5fcopy',['_fast_matrix_copy',['../classstan_1_1mcmc_1_1ps__point.html#aa701eacefbab10b9cac8273267bbf39d',1,'stan::mcmc::ps_point']]], + ['_5ffast_5fvector_5fcopy',['_fast_vector_copy',['../classstan_1_1mcmc_1_1ps__point.html#a685e73353f2931b3afbfccd4acbe598d',1,'stan::mcmc::ps_point']]], + ['_5fupdate_5fl',['_update_L',['../classstan_1_1mcmc_1_1base__static__hmc.html#a99f17a731044a9880298f5e254b94a69',1,'stan::mcmc::base_static_hmc']]], + ['_5fwrite_5ferror_5fmsg',['_write_error_msg',['../classstan_1_1mcmc_1_1base__hamiltonian.html#a119fab9e5829911ccfb31a5f7ec1f30b',1,'stan::mcmc::base_hamiltonian']]] +]; diff --git a/doc/api/html/search/functions_61.html b/doc/api/html/search/functions_61.html new file mode 100644 index 00000000000..7f395337e22 --- /dev/null +++ b/doc/api/html/search/functions_61.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/functions_61.js b/doc/api/html/search/functions_61.js new file mode 100644 index 00000000000..61f47537a5b --- /dev/null +++ b/doc/api/html/search/functions_61.js @@ -0,0 +1,102 @@ +var searchData= +[ + ['abs',['abs',['../namespacestan_1_1agrad.html#a2d5337cd9cddc3807cb3b3740221ace1',1,'stan::agrad::abs(const var &a)'],['../namespacestan_1_1agrad.html#a16237ddae626928422d7c63f7f02ae6f',1,'stan::agrad::abs(const fvar< T > &x)'],['../namespacestan_1_1math.html#aeb4764556637084eee528b45d8eaa767',1,'stan::math::abs()']]], + ['accept_5fstat',['accept_stat',['../classstan_1_1mcmc_1_1sample.html#ab427230e7e2d5cb3b541c3b7040d0fb7',1,'stan::mcmc::sample']]], + ['accumulator',['accumulator',['../classstan_1_1math_1_1accumulator.html#afb44f3c753ac1373482e123df612a266',1,'stan::math::accumulator']]], + ['acos',['acos',['../namespacestan_1_1agrad.html#a3d7b4b9ba0df66c3ae59a4478fecdc2b',1,'stan::agrad::acos(const var &a)'],['../namespacestan_1_1agrad.html#a8d58f71cd77c7447a63eb336f9b29857',1,'stan::agrad::acos(const fvar< T > &x)']]], + ['acosh',['acosh',['../namespacestan_1_1agrad.html#a7f0ba2a81fb92e3f18d75fd4da3f5b67',1,'stan::agrad::acosh(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#a55d6c606ed591f3aa617ccf6ef912d17',1,'stan::agrad::acosh(const stan::agrad::var &a)']]], + ['adapt_5fdense_5fe_5fnuts',['adapt_dense_e_nuts',['../classstan_1_1mcmc_1_1adapt__dense__e__nuts.html#a7f2a7a4f48cbc0f7667f01e9045e069a',1,'stan::mcmc::adapt_dense_e_nuts']]], + ['adapt_5fdense_5fe_5fstatic_5fhmc',['adapt_dense_e_static_hmc',['../classstan_1_1mcmc_1_1adapt__dense__e__static__hmc.html#a7d57f187b6877982cf329800e47b5370',1,'stan::mcmc::adapt_dense_e_static_hmc']]], + ['adapt_5fdiag_5fe_5fnuts',['adapt_diag_e_nuts',['../classstan_1_1mcmc_1_1adapt__diag__e__nuts.html#a8e2eb81bdeed65fb1cdf8512643c5247',1,'stan::mcmc::adapt_diag_e_nuts']]], + ['adapt_5fdiag_5fe_5fstatic_5fhmc',['adapt_diag_e_static_hmc',['../classstan_1_1mcmc_1_1adapt__diag__e__static__hmc.html#a08c8c79cc0a4c5fcfc8a2be30b9ab858',1,'stan::mcmc::adapt_diag_e_static_hmc']]], + ['adapt_5funit_5fe_5fnuts',['adapt_unit_e_nuts',['../classstan_1_1mcmc_1_1adapt__unit__e__nuts.html#a65a0e3a8ff345164784d1c411c1d685f',1,'stan::mcmc::adapt_unit_e_nuts']]], + ['adapt_5funit_5fe_5fstatic_5fhmc',['adapt_unit_e_static_hmc',['../classstan_1_1mcmc_1_1adapt__unit__e__static__hmc.html#ab6e501da21dace8ba4deb0378df2e74f',1,'stan::mcmc::adapt_unit_e_static_hmc']]], + ['adaptation_5fwindow',['adaptation_window',['../classstan_1_1mcmc_1_1windowed__adaptation.html#a8e82facfbdd25e23a6dc04dfb47f6f55',1,'stan::mcmc::windowed_adaptation']]], + ['adapting',['adapting',['../classstan_1_1mcmc_1_1base__adapter.html#a56b7bacc5a6d31b2e0d0d2dc8f096cb7',1,'stan::mcmc::base_adapter']]], + ['add',['add',['../classstan_1_1gm_1_1function__signatures.html#a2cd5e6592f8f0839d0744d0ac6c889a6',1,'stan::gm::function_signatures::add(const std::string &name, const expr_type &result_type, const std::vector< expr_type > &arg_types)'],['../classstan_1_1gm_1_1function__signatures.html#a155a6d04ca2dd66396558e55afee2ac9',1,'stan::gm::function_signatures::add(const std::string &name, const expr_type &result_type)'],['../classstan_1_1gm_1_1function__signatures.html#a7030b5e710a69202f33055d64f506aac',1,'stan::gm::function_signatures::add(const std::string &name, const expr_type &result_type, const expr_type &arg_type)'],['../classstan_1_1gm_1_1function__signatures.html#aa0947100246ba8239f476a6b337c7a45',1,'stan::gm::function_signatures::add(const std::string &name, const expr_type &result_type, const expr_type &arg_type1, const expr_type &arg_type2)'],['../classstan_1_1gm_1_1function__signatures.html#a827e5f55c134829c58dc20924ba02d8e',1,'stan::gm::function_signatures::add(const std::string &name, const expr_type &result_type, const expr_type &arg_type1, const expr_type &arg_type2, const expr_type &arg_type3)'],['../classstan_1_1gm_1_1function__signatures.html#a029bfb7842b41f1c3cd853ca9806a6c9',1,'stan::gm::function_signatures::add(const std::string &name, const expr_type &result_type, const expr_type &arg_type1, const expr_type &arg_type2, const expr_type &arg_type3, const expr_type &arg_type4)'],['../classstan_1_1gm_1_1function__signatures.html#acb2e2b50157a56f5a924cf9d8c134025',1,'stan::gm::function_signatures::add(const std::string &name, const expr_type &result_type, const expr_type &arg_type1, const expr_type &arg_type2, const expr_type &arg_type3, const expr_type &arg_type4, const expr_type &arg_type5)'],['../classstan_1_1gm_1_1function__signatures.html#a59a3c6beef4febbc41c38a7ed92e4b8a',1,'stan::gm::function_signatures::add(const std::string &name, const expr_type &result_type, const expr_type &arg_type1, const expr_type &arg_type2, const expr_type &arg_type3, const expr_type &arg_type4, const expr_type &arg_type5, const expr_type &arg_type6)'],['../classstan_1_1gm_1_1function__signatures.html#ab8b4feffbf25d433f7f4545a28fed897',1,'stan::gm::function_signatures::add(const std::string &name, const expr_type &result_type, const expr_type &arg_type1, const expr_type &arg_type2, const expr_type &arg_type3, const expr_type &arg_type4, const expr_type &arg_type5, const expr_type &arg_type6, const expr_type &arg_type7)'],['../structstan_1_1gm_1_1variable__map.html#a2a1c8d42745d2ba940577f8f9d4da17e',1,'stan::gm::variable_map::add()'],['../classstan_1_1math_1_1accumulator.html#ad18efaeb75a21c93ea9ca77ca99a8747',1,'stan::math::accumulator::add()'],['../structstan_1_1math_1_1array__builder.html#a085e0190d7a41c4e33bfa9f542b1d62a',1,'stan::math::array_builder::add()'],['../classstan_1_1mcmc_1_1chains.html#af47331852814d5853f769cfb5d71fbe2',1,'stan::mcmc::chains::add(const int chain, const Eigen::MatrixXd &sample)'],['../classstan_1_1mcmc_1_1chains.html#a87a66fd3d8395bd6b44e8e9fba8e4068',1,'stan::mcmc::chains::add(const Eigen::MatrixXd &sample)'],['../classstan_1_1mcmc_1_1chains.html#a0c7ad1958670871f1d080d8feb8233b6',1,'stan::mcmc::chains::add(const stan::io::stan_csv &stan_csv)'],['../namespacestan_1_1math.html#a3d4b97f71328d3de40de286ec6e3754e',1,'stan::math::add(const Eigen::Matrix< T1, R, C > &m1, const Eigen::Matrix< T2, R, C > &m2)'],['../namespacestan_1_1math.html#aa92ade0aeac74c8366b8c210446324a1',1,'stan::math::add(const Eigen::Matrix< T1, R, C > &m, const T2 &c)'],['../namespacestan_1_1math.html#ac4cbcb4a48d3284e93afe13093412683',1,'stan::math::add(const T1 &c, const Eigen::Matrix< T2, R, C > &m)']]], + ['add_5fbinary',['add_binary',['../classstan_1_1gm_1_1function__signatures.html#a3cac5b9cb17575d88d76286fcff64344',1,'stan::gm::function_signatures']]], + ['add_5fnullary',['add_nullary',['../classstan_1_1gm_1_1function__signatures.html#a5ef070db4552215d2de0ebdcf2298481',1,'stan::gm::function_signatures']]], + ['add_5fquaternary',['add_quaternary',['../classstan_1_1gm_1_1function__signatures.html#a7e6eae9e711df2373c8f624c7d9da53c',1,'stan::gm::function_signatures']]], + ['add_5fsample',['add_sample',['../classstan_1_1prob_1_1welford__covar__estimator.html#a3446b92b64b15d105b399c1723fcad57',1,'stan::prob::welford_covar_estimator::add_sample()'],['../classstan_1_1prob_1_1welford__var__estimator.html#a3706c5c31c545bafd3dee6fa1dcce816',1,'stan::prob::welford_var_estimator::add_sample()']]], + ['add_5fternary',['add_ternary',['../classstan_1_1gm_1_1function__signatures.html#a028061fc0bf4b4842aacd64be3fcc89e',1,'stan::gm::function_signatures']]], + ['add_5funary',['add_unary',['../classstan_1_1gm_1_1function__signatures.html#a9ce2dcdafcd2370053c4eb0c9be10042',1,'stan::gm::function_signatures']]], + ['add_5fvec',['add_vec',['../classstan_1_1io_1_1var__context.html#a4cdc64bb5dbdc26f15885fc34737752e',1,'stan::io::var_context']]], + ['adj',['adj',['../classstan_1_1agrad_1_1var.html#a44db5cfbac5b6858bc26cbb2518a6826',1,'stan::agrad::var']]], + ['alloc',['alloc',['../classstan_1_1memory_1_1chunk__alloc.html#a220d04d5ca74562e28a6c01111d8fd22',1,'stan::memory::chunk_alloc::alloc()'],['../classstan_1_1memory_1_1stack__alloc.html#a90eb1978d8bbc20e4357b1ea2c686f5b',1,'stan::memory::stack_alloc::alloc()']]], + ['alpha',['alpha',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a2efb26e144b4d4d29f982df93e761823',1,'stan::optimization::BFGSMinimizer']]], + ['alpha0',['alpha0',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#ae534c5316049196626b103bb461f428c',1,'stan::optimization::BFGSMinimizer']]], + ['arg',['arg',['../classstan_1_1gm_1_1argument.html#a30ba1fe18d6f4016b030835969039e9d',1,'stan::gm::argument::arg()'],['../classstan_1_1gm_1_1argument__parser.html#a3e40d509ada7d1ea9def28f819f54ee9',1,'stan::gm::argument_parser::arg()'],['../classstan_1_1gm_1_1categorical__argument.html#a5ae28cffcf6579400a8736fc581c6ab5',1,'stan::gm::categorical_argument::arg()'],['../classstan_1_1gm_1_1list__argument.html#a649267bc16e4863f507aaeecb9cbf2f1',1,'stan::gm::list_argument::arg()']]], + ['arg_5fadapt',['arg_adapt',['../classstan_1_1gm_1_1arg__adapt.html#a7db5d900f8ce94a610cbb2f129d02763',1,'stan::gm::arg_adapt']]], + ['arg_5fadapt_5fdelta',['arg_adapt_delta',['../classstan_1_1gm_1_1arg__adapt__delta.html#ab994caa2d7658bd6548f17b18cd5efaf',1,'stan::gm::arg_adapt_delta']]], + ['arg_5fadapt_5fengaged',['arg_adapt_engaged',['../classstan_1_1gm_1_1arg__adapt__engaged.html#a93164af8cdf69db14252d54d654278f2',1,'stan::gm::arg_adapt_engaged']]], + ['arg_5fadapt_5fgamma',['arg_adapt_gamma',['../classstan_1_1gm_1_1arg__adapt__gamma.html#a1e89fd146d9a20e98c550321d03aa674',1,'stan::gm::arg_adapt_gamma']]], + ['arg_5fadapt_5finit_5fbuffer',['arg_adapt_init_buffer',['../classstan_1_1gm_1_1arg__adapt__init__buffer.html#a458117f29f2665be1b17d7ce3fc2728b',1,'stan::gm::arg_adapt_init_buffer']]], + ['arg_5fadapt_5fkappa',['arg_adapt_kappa',['../classstan_1_1gm_1_1arg__adapt__kappa.html#a69a930fe17bcb920dd1beaa31d47ac20',1,'stan::gm::arg_adapt_kappa']]], + ['arg_5fadapt_5ft0',['arg_adapt_t0',['../classstan_1_1gm_1_1arg__adapt__t0.html#a92a0c0524b5f854828cb6e22c4119e8b',1,'stan::gm::arg_adapt_t0']]], + ['arg_5fadapt_5fterm_5fbuffer',['arg_adapt_term_buffer',['../classstan_1_1gm_1_1arg__adapt__term__buffer.html#a8e4699ec0baa6885ba9c34430b6d83b2',1,'stan::gm::arg_adapt_term_buffer']]], + ['arg_5fadapt_5fwindow',['arg_adapt_window',['../classstan_1_1gm_1_1arg__adapt__window.html#a95facd1874bc025735aeb9bc0b4297fe',1,'stan::gm::arg_adapt_window']]], + ['arg_5fbfgs',['arg_bfgs',['../classstan_1_1gm_1_1arg__bfgs.html#a0c1429d90a7c7f0943730e16cde44fac',1,'stan::gm::arg_bfgs']]], + ['arg_5fdata',['arg_data',['../classstan_1_1gm_1_1arg__data.html#af14bc033277233421428ef9fde504b07',1,'stan::gm::arg_data']]], + ['arg_5fdata_5ffile',['arg_data_file',['../classstan_1_1gm_1_1arg__data__file.html#a2432968effc35f8973394e91b941cf86',1,'stan::gm::arg_data_file']]], + ['arg_5fdense_5fe',['arg_dense_e',['../classstan_1_1gm_1_1arg__dense__e.html#af591c90b48c64017b2eed129e7fd2de6',1,'stan::gm::arg_dense_e']]], + ['arg_5fdiag_5fe',['arg_diag_e',['../classstan_1_1gm_1_1arg__diag__e.html#a090d24faf43dccdb255de369c396947f',1,'stan::gm::arg_diag_e']]], + ['arg_5fdiagnose',['arg_diagnose',['../classstan_1_1gm_1_1arg__diagnose.html#a29fa2b3eb2a85d31f3de053e7ab4a7cb',1,'stan::gm::arg_diagnose']]], + ['arg_5fdiagnostic_5ffile',['arg_diagnostic_file',['../classstan_1_1gm_1_1arg__diagnostic__file.html#a59b7ff8a694fa099456fc6c4466eb300',1,'stan::gm::arg_diagnostic_file']]], + ['arg_5fengine',['arg_engine',['../classstan_1_1gm_1_1arg__engine.html#a565b15c3703faddc7346db01b5a7fa3d',1,'stan::gm::arg_engine']]], + ['arg_5ffail',['arg_fail',['../classstan_1_1gm_1_1arg__fail.html#a09c9ceb2645fafb62b79172287ce0797',1,'stan::gm::arg_fail']]], + ['arg_5fhmc',['arg_hmc',['../classstan_1_1gm_1_1arg__hmc.html#a21bce37da4a429c509a142d2989c9e25',1,'stan::gm::arg_hmc']]], + ['arg_5fid',['arg_id',['../classstan_1_1gm_1_1arg__id.html#a9db2f80b010bff893370ae4b230bd966',1,'stan::gm::arg_id']]], + ['arg_5finit',['arg_init',['../classstan_1_1gm_1_1arg__init.html#acfb9b2317ca874c9c9c266c03ac1368f',1,'stan::gm::arg_init']]], + ['arg_5finit_5falpha',['arg_init_alpha',['../classstan_1_1gm_1_1arg__init__alpha.html#a62422aee45bcf245c6707a75ad762f4a',1,'stan::gm::arg_init_alpha']]], + ['arg_5fint_5ftime',['arg_int_time',['../classstan_1_1gm_1_1arg__int__time.html#a8374ed135e25d27819e08b474b6170c4',1,'stan::gm::arg_int_time']]], + ['arg_5fiter',['arg_iter',['../classstan_1_1gm_1_1arg__iter.html#addc4d554b12927d3e099cb78e84b4c69',1,'stan::gm::arg_iter']]], + ['arg_5fmax_5fdepth',['arg_max_depth',['../classstan_1_1gm_1_1arg__max__depth.html#aa43e5f69ecea1ab64a93d0544f5b2204',1,'stan::gm::arg_max_depth']]], + ['arg_5fmethod',['arg_method',['../classstan_1_1gm_1_1arg__method.html#a0ab921dbf66c5b63669cb77f07d797e9',1,'stan::gm::arg_method']]], + ['arg_5fmetric',['arg_metric',['../classstan_1_1gm_1_1arg__metric.html#a8f59bf4d98051c730af026865135958d',1,'stan::gm::arg_metric']]], + ['arg_5fnesterov',['arg_nesterov',['../classstan_1_1gm_1_1arg__nesterov.html#aff8818db928802f6e048d6a3dcf080ea',1,'stan::gm::arg_nesterov']]], + ['arg_5fnewton',['arg_newton',['../classstan_1_1gm_1_1arg__newton.html#a40a307722a2f91f3c1507261183fd4a2',1,'stan::gm::arg_newton']]], + ['arg_5fnum_5fsamples',['arg_num_samples',['../classstan_1_1gm_1_1arg__num__samples.html#af03561fdb3d19b14fa8ce33db4bfbb92',1,'stan::gm::arg_num_samples']]], + ['arg_5fnum_5fwarmup',['arg_num_warmup',['../classstan_1_1gm_1_1arg__num__warmup.html#a12b94f117fb965fee31d2a53d946a3b9',1,'stan::gm::arg_num_warmup']]], + ['arg_5fnuts',['arg_nuts',['../classstan_1_1gm_1_1arg__nuts.html#a54338616bb4ea3c6cdaa922fe60f6279',1,'stan::gm::arg_nuts']]], + ['arg_5foptimize',['arg_optimize',['../classstan_1_1gm_1_1arg__optimize.html#a212f9e1a9ea25739e42913cd99f6cfa3',1,'stan::gm::arg_optimize']]], + ['arg_5foptimize_5falgo',['arg_optimize_algo',['../classstan_1_1gm_1_1arg__optimize__algo.html#a6c60961805502a27dd60db458155b30e',1,'stan::gm::arg_optimize_algo']]], + ['arg_5foutput',['arg_output',['../classstan_1_1gm_1_1arg__output.html#a00b3df35f243cba8de0e50cacff5f9f8',1,'stan::gm::arg_output']]], + ['arg_5foutput_5ffile',['arg_output_file',['../classstan_1_1gm_1_1arg__output__file.html#a7653a338dae46687a0cd46607cb8df30',1,'stan::gm::arg_output_file']]], + ['arg_5frandom',['arg_random',['../classstan_1_1gm_1_1arg__random.html#a04356fb8dd2badb38de8d957d89ccd25',1,'stan::gm::arg_random']]], + ['arg_5frefresh',['arg_refresh',['../classstan_1_1gm_1_1arg__refresh.html#a1055e8b9beac79398a5efd25106bef73',1,'stan::gm::arg_refresh']]], + ['arg_5frwm',['arg_rwm',['../classstan_1_1gm_1_1arg__rwm.html#a7e6e4430b6cc5d35128899c2d7e7f4c1',1,'stan::gm::arg_rwm']]], + ['arg_5fsample',['arg_sample',['../classstan_1_1gm_1_1arg__sample.html#a76e9dba4b18fff10db3938783e4bbc84',1,'stan::gm::arg_sample']]], + ['arg_5fsample_5falgo',['arg_sample_algo',['../classstan_1_1gm_1_1arg__sample__algo.html#a677c78a97f6e522c2b532d5ec8cdc436',1,'stan::gm::arg_sample_algo']]], + ['arg_5fsave_5fiterations',['arg_save_iterations',['../classstan_1_1gm_1_1arg__save__iterations.html#ac3c6147547688bf229a5a229b761891f',1,'stan::gm::arg_save_iterations']]], + ['arg_5fsave_5fwarmup',['arg_save_warmup',['../classstan_1_1gm_1_1arg__save__warmup.html#abc63cf780ff0ec05b668034557e66e5a',1,'stan::gm::arg_save_warmup']]], + ['arg_5fseed',['arg_seed',['../classstan_1_1gm_1_1arg__seed.html#a49ef4eab0312fb9eebdaf8901a24a50f',1,'stan::gm::arg_seed']]], + ['arg_5fstatic',['arg_static',['../classstan_1_1gm_1_1arg__static.html#aad5c9ed706c879ffc39b2f44b4ce9aef',1,'stan::gm::arg_static']]], + ['arg_5fstepsize',['arg_stepsize',['../classstan_1_1gm_1_1arg__stepsize.html#ab10f7c015e43cae0bd66ebd7d2ea60bb',1,'stan::gm::arg_stepsize']]], + ['arg_5fstepsize_5fjitter',['arg_stepsize_jitter',['../classstan_1_1gm_1_1arg__stepsize__jitter.html#af57b445faa0178cddfc60633a0452e02',1,'stan::gm::arg_stepsize_jitter']]], + ['arg_5ftest',['arg_test',['../classstan_1_1gm_1_1arg__test.html#a09019b7ca0e874ecc2946309b1032acd',1,'stan::gm::arg_test']]], + ['arg_5ftest_5fgrad_5feps',['arg_test_grad_eps',['../classstan_1_1gm_1_1arg__test__grad__eps.html#a1105ef70c0defa9892e9bd5993fd24cf',1,'stan::gm::arg_test_grad_eps']]], + ['arg_5ftest_5fgrad_5ferr',['arg_test_grad_err',['../classstan_1_1gm_1_1arg__test__grad__err.html#a3c862ad4e9f4ae7010ca45c77da8d380',1,'stan::gm::arg_test_grad_err']]], + ['arg_5ftest_5fgradient',['arg_test_gradient',['../classstan_1_1gm_1_1arg__test__gradient.html#aa61549ae85bb062c3cc5f76668b3e1dd',1,'stan::gm::arg_test_gradient']]], + ['arg_5fthin',['arg_thin',['../classstan_1_1gm_1_1arg__thin.html#a968a02a29a6fc8097ce610f3be4e5ac9',1,'stan::gm::arg_thin']]], + ['arg_5ftolerance',['arg_tolerance',['../classstan_1_1gm_1_1arg__tolerance.html#aba6a7ae537bca04e284af54e9a231e3f',1,'stan::gm::arg_tolerance']]], + ['arg_5funit_5fe',['arg_unit_e',['../classstan_1_1gm_1_1arg__unit__e.html#a6772c5923ce0c23db100e1157aa232c5',1,'stan::gm::arg_unit_e']]], + ['argument',['argument',['../classstan_1_1gm_1_1argument.html#ad3b825604d30e95f4e66eef6cbadf533',1,'stan::gm::argument::argument()'],['../classstan_1_1gm_1_1argument.html#af5c733afb4fdc0f55795f8cdd2891d7f',1,'stan::gm::argument::argument(const std::string name)']]], + ['argument_5fparser',['argument_parser',['../classstan_1_1gm_1_1argument__parser.html#a540ddee5190ee5dd85a8773d98a5cb83',1,'stan::gm::argument_parser']]], + ['argument_5fprobe',['argument_probe',['../classstan_1_1gm_1_1argument__probe.html#a82b991e17fd517f1a04ba905acb545be',1,'stan::gm::argument_probe']]], + ['array',['array',['../structstan_1_1math_1_1array__builder.html#a725410c59aa282c6b23c52fd252aa1a3',1,'stan::math::array_builder']]], + ['array_5fbuilder',['array_builder',['../structstan_1_1math_1_1array__builder.html#a8e2649b71c980137fa5d86433d2be50c',1,'stan::math::array_builder']]], + ['array_5fliteral',['array_literal',['../structstan_1_1gm_1_1array__literal.html#a462b152d7868e7d588994d215e81b26d',1,'stan::gm::array_literal::array_literal()'],['../structstan_1_1gm_1_1array__literal.html#a08529fbee87e23323340317b11f4a71c',1,'stan::gm::array_literal::array_literal(const std::vector< expression > &args)']]], + ['as_5fbool',['as_bool',['../namespacestan_1_1agrad.html#a0e0e98b7b8248f6303a3ae565a46305c',1,'stan::agrad::as_bool()'],['../namespacestan_1_1math.html#a6ad1c484220022b3abfb79c16d1d7f72',1,'stan::math::as_bool()']]], + ['as_5fbool_3c_20int_20_3e',['as_bool< int >',['../namespacestan_1_1math.html#a86b5156aa25d21592dbd3624aae1ea39',1,'stan::math']]], + ['asin',['asin',['../namespacestan_1_1agrad.html#a376ec296a189c47edee18e50ba72b2f5',1,'stan::agrad::asin(const var &a)'],['../namespacestan_1_1agrad.html#afd98c31d8d43e552287de2dc9170ff3e',1,'stan::agrad::asin(const fvar< T > &x)']]], + ['asinh',['asinh',['../namespacestan_1_1agrad.html#aaf137922ce743a1f63adfaed2630dfe6',1,'stan::agrad::asinh(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#a0fd3a2e895d3c03de0b670b3ba8b3b3c',1,'stan::agrad::asinh(const stan::agrad::var &a)']]], + ['assign',['assign',['../namespacestan_1_1math.html#a5f394c15ea3eb97743382631f91801cf',1,'stan::math::assign(LHS &lhs, const RHS &rhs)'],['../namespacestan_1_1math.html#a5371f0f914e9b79a0700577e5557c0b7',1,'stan::math::assign(Eigen::Matrix< LHS, R1, C1 > &x, const Eigen::Matrix< RHS, R2, C2 > &y)'],['../namespacestan_1_1math.html#a0a80c719463c4e3caa03df731e2c2cb9',1,'stan::math::assign(Eigen::Matrix< LHS, R, C > &x, const Eigen::Matrix< RHS, R, C > &y)'],['../namespacestan_1_1math.html#aa4af3a90ad3b5ec1507dfc1823fdb8da',1,'stan::math::assign(Eigen::Block< LHS > x, const Eigen::Matrix< RHS, R, C > &y)'],['../namespacestan_1_1math.html#a2c6dec98c71fd478c2ee16bc274b464d',1,'stan::math::assign(std::vector< LHS > &x, const std::vector< RHS > &y)']]], + ['assignment',['assignment',['../structstan_1_1gm_1_1assignment.html#ad3690469ab15526cf947f92e2ae9aef3',1,'stan::gm::assignment::assignment()'],['../structstan_1_1gm_1_1assignment.html#a5f93f2431c52a23bab7288491a6f02b7',1,'stan::gm::assignment::assignment(variable_dims &var_dims, expression &expr)']]], + ['atan',['atan',['../namespacestan_1_1agrad.html#a0dfbfab0e6051aa349a6090f102f6742',1,'stan::agrad::atan(const var &a)'],['../namespacestan_1_1agrad.html#a6546708d4dc0f19756f4e2380eb9b9e4',1,'stan::agrad::atan(const fvar< T > &x)']]], + ['atan2',['atan2',['../namespacestan_1_1agrad.html#ae76a1cfac43312edacb47fd87fc2393a',1,'stan::agrad::atan2(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#a8d5bc116190d363cc639326df5e04aea',1,'stan::agrad::atan2(const var &a, const double &b)'],['../namespacestan_1_1agrad.html#ad1a44f881f4e456e06374ee511387769',1,'stan::agrad::atan2(const double &a, const var &b)'],['../namespacestan_1_1agrad.html#aed06ff6c2ea34535f6c75ea7582aa203',1,'stan::agrad::atan2(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#aa982d2dff799ce857c3c0853628d3f1f',1,'stan::agrad::atan2(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#ac193d89ea00a38466c89eff9c13bcd48',1,'stan::agrad::atan2(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#a675cbb776b5402953bd180b4d6e1d90b',1,'stan::agrad::atan2(const var &a, const double b)'],['../namespacestan_1_1agrad.html#a9963689c927130aef845582a1160678b',1,'stan::agrad::atan2(const double a, const var &b)']]], + ['atanh',['atanh',['../namespacestan_1_1agrad.html#a5063c907c581ab5a2e735f8cccd7aad3',1,'stan::agrad::atanh(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#af87034c9a4d6edfc1df46d96069fd68c',1,'stan::agrad::atanh(const stan::agrad::var &a)']]], + ['autocorrelation',['autocorrelation',['../classstan_1_1mcmc_1_1chains.html#a4f666226faa6abbf0083da66da0a8d10',1,'stan::mcmc::chains::autocorrelation(const int chain, const int index)'],['../classstan_1_1mcmc_1_1chains.html#ab1de31b2bda945c27829ac7823bef3f2',1,'stan::mcmc::chains::autocorrelation(const int chain, const std::string &name)'],['../namespacestan_1_1prob.html#afca2f21cad2a74d9d5ff27c4ae47d6cf',1,'stan::prob::autocorrelation(const std::vector< T > &y, std::vector< T > &ac, Eigen::FFT< T > &fft)'],['../namespacestan_1_1prob.html#a426d883667d0707d0d6d6337831e41c4',1,'stan::prob::autocorrelation(const std::vector< T > &y, std::vector< T > &ac)']]], + ['autocovariance',['autocovariance',['../classstan_1_1mcmc_1_1chains.html#a24f75bd6ba8e24fe99b54c9226a18320',1,'stan::mcmc::chains::autocovariance(const int chain, const int index)'],['../classstan_1_1mcmc_1_1chains.html#a3d2a87745cfded05b30a8b517c4e5a88',1,'stan::mcmc::chains::autocovariance(const int chain, const std::string &name)'],['../namespacestan_1_1prob.html#ac4390e4cb6742ab59c9d6c401cd7a188',1,'stan::prob::autocovariance(const std::vector< T > &y, std::vector< T > &acov, Eigen::FFT< T > &fft)'],['../namespacestan_1_1prob.html#a73aec38db728d2f43f80fbdcc314b3db',1,'stan::prob::autocovariance(const std::vector< T > &y, std::vector< T > &acov)']]], + ['available',['available',['../classstan_1_1io_1_1reader.html#a581d87c0d6f4fbcc889fcda61d9da129',1,'stan::io::reader']]], + ['available_5fi',['available_i',['../classstan_1_1io_1_1reader.html#a69f82bd5d88795b0012d04b239685858',1,'stan::io::reader']]] +]; diff --git a/doc/api/html/search/functions_62.html b/doc/api/html/search/functions_62.html new file mode 100644 index 00000000000..def0606e751 --- /dev/null +++ b/doc/api/html/search/functions_62.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/functions_62.js b/doc/api/html/search/functions_62.js new file mode 100644 index 00000000000..e47fb4d6479 --- /dev/null +++ b/doc/api/html/search/functions_62.js @@ -0,0 +1,51 @@ +var searchData= +[ + ['bare',['bare',['../classstan_1_1io_1_1cmd__line.html#a3879e1290c19f6580ee0285dc1625675',1,'stan::io::cmd_line']]], + ['bare_5fsize',['bare_size',['../classstan_1_1io_1_1cmd__line.html#a5cfdf91b7237b7db7cd9ea0b7de571b6',1,'stan::io::cmd_line']]], + ['base_5fadapter',['base_adapter',['../classstan_1_1mcmc_1_1base__adapter.html#ac1d2bf71f98f15445b607766f5451bba',1,'stan::mcmc::base_adapter']]], + ['base_5fhamiltonian',['base_hamiltonian',['../classstan_1_1mcmc_1_1base__hamiltonian.html#aff93f8e3e83acfe9b8e6f88ed1a63c85',1,'stan::mcmc::base_hamiltonian']]], + ['base_5fhmc',['base_hmc',['../classstan_1_1mcmc_1_1base__hmc.html#a8c414cb92694b17a02b3d2a799499870',1,'stan::mcmc::base_hmc']]], + ['base_5fintegrator',['base_integrator',['../classstan_1_1mcmc_1_1base__integrator.html#aca59e40275dc1404de7077455e267d3d',1,'stan::mcmc::base_integrator']]], + ['base_5fleapfrog',['base_leapfrog',['../classstan_1_1mcmc_1_1base__leapfrog.html#a633d75fe0c95602fe6546e5a2cb217ae',1,'stan::mcmc::base_leapfrog']]], + ['base_5fmcmc',['base_mcmc',['../classstan_1_1mcmc_1_1base__mcmc.html#a4fb817f487dc4fe86a91acca8109ac2a',1,'stan::mcmc::base_mcmc']]], + ['base_5fnuts',['base_nuts',['../classstan_1_1mcmc_1_1base__nuts.html#a553804373eddffd3b7079fe7cf25a611',1,'stan::mcmc::base_nuts']]], + ['base_5fparam_5fname',['base_param_name',['../print_8hpp.html#a44680d963f2fac28eca89f94f3eb99dc',1,'print.hpp']]], + ['base_5fstatic_5fhmc',['base_static_hmc',['../classstan_1_1mcmc_1_1base__static__hmc.html#adc496c9b987be1297a40fa0e07e44fdf',1,'stan::mcmc::base_static_hmc']]], + ['base_5ftype_5fto_5fstring',['base_type_to_string',['../namespacestan_1_1gm.html#a9c695724226e13246eefc23216841ffc',1,'stan::gm']]], + ['base_5fvar_5fdecl',['base_var_decl',['../structstan_1_1gm_1_1base__var__decl.html#afbf37085102e8852cc11bf7d3cc4e07a',1,'stan::gm::base_var_decl::base_var_decl()'],['../structstan_1_1gm_1_1base__var__decl.html#af89f3d0b355688ee0099f6300c045c19',1,'stan::gm::base_var_decl::base_var_decl(const base_expr_type &base_type)'],['../structstan_1_1gm_1_1base__var__decl.html#ad83579cb2af06544b1367d91d041b2ab',1,'stan::gm::base_var_decl::base_var_decl(const std::string &name, const std::vector< expression > &dims, const base_expr_type &base_type)']]], + ['basic_5fvalidate',['basic_validate',['../structstan_1_1gm_1_1validate__var__decl__visgen.html#aee960e3728540789c2da4b55b95a6a14',1,'stan::gm::validate_var_decl_visgen']]], + ['begin_5fupdate_5fp',['begin_update_p',['../classstan_1_1mcmc_1_1base__leapfrog.html#a32f9d6a2fdca2ac0b81941bece5ada93',1,'stan::mcmc::base_leapfrog::begin_update_p()'],['../classstan_1_1mcmc_1_1expl__leapfrog.html#a8db6aa8c6efa80ced2123390d02d1079',1,'stan::mcmc::expl_leapfrog::begin_update_p()']]], + ['bernoulli_5fccdf_5flog',['bernoulli_ccdf_log',['../namespacestan_1_1prob.html#a726363482ee79c9eec5168e0662878ee',1,'stan::prob']]], + ['bernoulli_5fcdf',['bernoulli_cdf',['../namespacestan_1_1prob.html#acc2b8587b0d9e02ae857a2b3f5cba35d',1,'stan::prob']]], + ['bernoulli_5fcdf_5flog',['bernoulli_cdf_log',['../namespacestan_1_1prob.html#aba32173189278464e98a8126eb552cde',1,'stan::prob']]], + ['bernoulli_5flog',['bernoulli_log',['../namespacestan_1_1prob.html#a0bc33fe590391b82dab751bdadaf7b62',1,'stan::prob::bernoulli_log(const T_n &n, const T_prob &theta)'],['../namespacestan_1_1prob.html#a219ad54841aea16fc57524fca232f2e7',1,'stan::prob::bernoulli_log(const T_y &n, const T_prob &theta)']]], + ['bernoulli_5flogit_5flog',['bernoulli_logit_log',['../namespacestan_1_1prob.html#a5c8219bcfefefbfb4035de576837ab45',1,'stan::prob::bernoulli_logit_log(const T_n &n, const T_prob &theta)'],['../namespacestan_1_1prob.html#a41019ebe0811bb5c4dab0b3c2c836680',1,'stan::prob::bernoulli_logit_log(const T_n &n, const T_prob &theta)']]], + ['bernoulli_5frng',['bernoulli_rng',['../namespacestan_1_1prob.html#afea2d4a81899214550a87b8a09220620',1,'stan::prob']]], + ['bessel_5ffirst_5fkind',['bessel_first_kind',['../namespacestan_1_1agrad.html#a15ef0c83a99d3629e9ea8eb982ffe91c',1,'stan::agrad::bessel_first_kind(int v, const fvar< T > &z)'],['../namespacestan_1_1agrad.html#afc6ca13242211e5b43d3fcfb3bc8f3a7',1,'stan::agrad::bessel_first_kind(const int &v, const var &a)'],['../namespacestan_1_1math.html#aebfb3835848bd8550192cd5e090d3b5a',1,'stan::math::bessel_first_kind()']]], + ['bessel_5fsecond_5fkind',['bessel_second_kind',['../namespacestan_1_1agrad.html#a70cd3f5b630e4cae786470b8a7d70c62',1,'stan::agrad::bessel_second_kind(int v, const fvar< T > &z)'],['../namespacestan_1_1agrad.html#a17fd5151af2e0e715f84fbdcdea202cd',1,'stan::agrad::bessel_second_kind(const int &v, const var &a)'],['../namespacestan_1_1math.html#a645ce13c6454913ec39be807751604dc',1,'stan::math::bessel_second_kind()']]], + ['beta_5fbinomial_5fccdf_5flog',['beta_binomial_ccdf_log',['../namespacestan_1_1prob.html#a5d2307b3b214c6a219dc1ae47cbba4d0',1,'stan::prob']]], + ['beta_5fbinomial_5fcdf',['beta_binomial_cdf',['../namespacestan_1_1prob.html#a6549c9b89bee939a79c35a797977e48e',1,'stan::prob']]], + ['beta_5fbinomial_5fcdf_5flog',['beta_binomial_cdf_log',['../namespacestan_1_1prob.html#a260dee97213ab1ea2bcb345f2e5699f8',1,'stan::prob']]], + ['beta_5fbinomial_5flog',['beta_binomial_log',['../namespacestan_1_1prob.html#a6b05e0ee6a8e83b15ab01a8bd2f75621',1,'stan::prob::beta_binomial_log(const T_n &n, const T_N &N, const T_size1 &alpha, const T_size2 &beta)'],['../namespacestan_1_1prob.html#a08bb45fa7fefa94d7e243b4df5686909',1,'stan::prob::beta_binomial_log(const T_n &n, const T_N &N, const T_size1 &alpha, const T_size2 &beta)']]], + ['beta_5fbinomial_5frng',['beta_binomial_rng',['../namespacestan_1_1prob.html#a0ab5a0632c3782b2feed87f13731a3cb',1,'stan::prob']]], + ['beta_5fccdf_5flog',['beta_ccdf_log',['../namespacestan_1_1prob.html#a2cf7120d50b02585fd722748e624b13e',1,'stan::prob']]], + ['beta_5fcdf',['beta_cdf',['../namespacestan_1_1prob.html#ae99fab56f54c2e0f879345eee28b82ca',1,'stan::prob']]], + ['beta_5fcdf_5flog',['beta_cdf_log',['../namespacestan_1_1prob.html#ab63ea302e7cd29f7a5f3f23152b3de1f',1,'stan::prob']]], + ['beta_5flog',['beta_log',['../namespacestan_1_1prob.html#adcb4e073c7510ab55a2fd6f310168559',1,'stan::prob::beta_log(const T_y &y, const T_scale_succ &alpha, const T_scale_fail &beta)'],['../namespacestan_1_1prob.html#a76da5fc9b833aaf3844f98e9d032bb83',1,'stan::prob::beta_log(const T_y &y, const T_scale_succ &alpha, const T_scale_fail &beta)']]], + ['beta_5frng',['beta_rng',['../namespacestan_1_1prob.html#af9ffa205c1948b93323a12b13954558b',1,'stan::prob']]], + ['bfgslinesearch',['BFGSLineSearch',['../classstan_1_1optimization_1_1_b_f_g_s_line_search.html#a4979246eff3a7ea7e456ff6a78b9f947',1,'stan::optimization::BFGSLineSearch']]], + ['bfgsminimizer',['BFGSMinimizer',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a49e517b4678f438f201bea8576ca1b2f',1,'stan::optimization::BFGSMinimizer']]], + ['bfgsoptions',['BFGSOptions',['../structstan_1_1optimization_1_1_b_f_g_s_minimizer_1_1_b_f_g_s_options.html#a73b45c4d12854633eaa946de5c3def7b',1,'stan::optimization::BFGSMinimizer::BFGSOptions']]], + ['binary_5flog_5floss',['binary_log_loss',['../namespacestan_1_1agrad.html#af5d9abde22a78da0378d464f1ce24544',1,'stan::agrad::binary_log_loss(const int y, const fvar< T > &y_hat)'],['../namespacestan_1_1agrad.html#acbbcd95da81df518f28454f7d2cb8772',1,'stan::agrad::binary_log_loss(const int y, const stan::agrad::var &y_hat)'],['../namespacestan_1_1math.html#add2a043f562537b8cc57bb35780ac5b5',1,'stan::math::binary_log_loss()']]], + ['binary_5fop',['binary_op',['../structstan_1_1gm_1_1binary__op.html#a65335603651a7ea889960d4cddebcac4',1,'stan::gm::binary_op::binary_op()'],['../structstan_1_1gm_1_1binary__op.html#a78c4a1e12c510a73c172bc8155118678',1,'stan::gm::binary_op::binary_op(const expression &left, const std::string &op, const expression &right)']]], + ['binomial_5fccdf_5flog',['binomial_ccdf_log',['../namespacestan_1_1prob.html#a6a5c4f320e9c4fd342a2bc95cd5cab06',1,'stan::prob']]], + ['binomial_5fcdf',['binomial_cdf',['../namespacestan_1_1prob.html#aeed3ba1a20bc8adb20b6a15d35945533',1,'stan::prob']]], + ['binomial_5fcdf_5flog',['binomial_cdf_log',['../namespacestan_1_1prob.html#ab5b95dc562c6fc2d9474debaae03903c',1,'stan::prob']]], + ['binomial_5fcoefficient_5flog',['binomial_coefficient_log',['../namespacestan_1_1agrad.html#a4ec7cdb5d5ad2c9b0a0257398570e55b',1,'stan::agrad::binomial_coefficient_log(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a02695b9403bc2bd772610aec257b71ab',1,'stan::agrad::binomial_coefficient_log(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#a9b9e7ad2199a7cbcf958b4bab56eb5ba',1,'stan::agrad::binomial_coefficient_log(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1math.html#a27dad23d38c6d5e74c65e7571c70272e',1,'stan::math::binomial_coefficient_log()']]], + ['binomial_5flog',['binomial_log',['../namespacestan_1_1prob.html#ad12aae68875554db5a4e4934bfa1e24a',1,'stan::prob::binomial_log(const T_n &n, const T_N &N, const T_prob &theta)'],['../namespacestan_1_1prob.html#a255338df1c9dc1edcaf556ec019e70f9',1,'stan::prob::binomial_log(const T_n &n, const T_N &N, const T_prob &theta)']]], + ['binomial_5flogit_5flog',['binomial_logit_log',['../namespacestan_1_1prob.html#aeec51733f46d26326f271edaeb2c85fd',1,'stan::prob::binomial_logit_log(const T_n &n, const T_N &N, const T_prob &alpha)'],['../namespacestan_1_1prob.html#a36b4660673caceb27df26e36771d3b82',1,'stan::prob::binomial_logit_log(const T_n &n, const T_N &N, const T_prob &alpha)']]], + ['binomial_5frng',['binomial_rng',['../namespacestan_1_1prob.html#a4fedb58fc6bbe6d006bab9fe0b72c2d2',1,'stan::prob']]], + ['block',['block',['../namespacestan_1_1math.html#af163dfd071f1cff0297b7418156563a8',1,'stan::math']]], + ['boost_5ffusion_5fadapt_5fstruct',['BOOST_FUSION_ADAPT_STRUCT',['../program__grammar__def_8hpp.html#ada0ff5807ec701c3ec7f2ecc0d99aaf4',1,'BOOST_FUSION_ADAPT_STRUCT(stan::gm::program,(std::vector< stan::gm::var_decl >, data_decl_)(DUMMY_STRUCT::type, derived_data_decl_)(std::vector< stan::gm::var_decl >, parameter_decl_)(DUMMY_STRUCT::type, derived_decl_)(stan::gm::statement, statement_)(DUMMY_STRUCT::type, generated_decl_)) namespace stan: program_grammar_def.hpp'],['../statement__grammar__def_8hpp.html#a7bcb20f801376d20d08e7bbf352e88b8',1,'BOOST_FUSION_ADAPT_STRUCT(stan::gm::assignment,(stan::gm::variable_dims, var_dims_)(stan::gm::expression, expr_)): statement_grammar_def.hpp'],['../statement__grammar__def_8hpp.html#aaa7e207109145caa601bf2d96667b5a8',1,'BOOST_FUSION_ADAPT_STRUCT(stan::gm::variable_dims,(std::string, name_)(std::vector< stan::gm::expression >, dims_)): statement_grammar_def.hpp'],['../statement__grammar__def_8hpp.html#a6961e24e92dd0d1f84976386c45cc1b6',1,'BOOST_FUSION_ADAPT_STRUCT(stan::gm::distribution,(std::string, family_)(std::vector< stan::gm::expression >, args_)): statement_grammar_def.hpp'],['../statement__grammar__def_8hpp.html#a1cae61dafe9d4dd9285b7b6f76d05f92',1,'BOOST_FUSION_ADAPT_STRUCT(stan::gm::for_statement,(std::string, variable_)(stan::gm::range, range_)(stan::gm::statement, statement_)): statement_grammar_def.hpp'],['../statement__grammar__def_8hpp.html#af7c34bfed453a4a6d29961f3abe165cf',1,'BOOST_FUSION_ADAPT_STRUCT(stan::gm::print_statement,(std::vector< stan::gm::printable >, printables_)): statement_grammar_def.hpp'],['../statement__grammar__def_8hpp.html#a2495608d80afb728361556d665a415c4',1,'BOOST_FUSION_ADAPT_STRUCT(stan::gm::statements,(std::vector< stan::gm::var_decl >, local_decl_)(std::vector< stan::gm::statement >, statements_)): statement_grammar_def.hpp'],['../term__grammar__def_8hpp.html#a2aa48ab7197d456209104ec48170e6e7',1,'BOOST_FUSION_ADAPT_STRUCT(stan::gm::index_op,(stan::gm::expression, expr_)(std::vector< std::vector< stan::gm::expression > >, dimss_)): term_grammar_def.hpp'],['../term__grammar__def_8hpp.html#a480456e9da4c14c5519988cdc778facc',1,'BOOST_FUSION_ADAPT_STRUCT(stan::gm::fun,(std::string, name_)(std::vector< stan::gm::expression >, args_)): term_grammar_def.hpp'],['../term__grammar__def_8hpp.html#a1e81a41b83af331d2ab9038c3ab22c8e',1,'BOOST_FUSION_ADAPT_STRUCT(stan::gm::int_literal,(int, val_)(stan::gm::expr_type, type_)): term_grammar_def.hpp'],['../term__grammar__def_8hpp.html#a449100aff0b5136c9793061cb929bec8',1,'BOOST_FUSION_ADAPT_STRUCT(stan::gm::double_literal,(double, val_)(stan::gm::expr_type, type_)): term_grammar_def.hpp'],['../var__decls__grammar__def_8hpp.html#a1bf1e318d7e36dbd7a26eb65a05fcd13',1,'BOOST_FUSION_ADAPT_STRUCT(stan::gm::int_var_decl,(stan::gm::range, range_)(std::string, name_)(std::vector< stan::gm::expression >, dims_)) BOOST_FUSION_ADAPT_STRUCT(stan: var_decls_grammar_def.hpp']]], + ['build_5ftree',['build_tree',['../classstan_1_1mcmc_1_1base__nuts.html#abfa3f7a87c96c0021bbd4e9a87ad9f4b',1,'stan::mcmc::base_nuts']]] +]; diff --git a/doc/api/html/search/functions_63.html b/doc/api/html/search/functions_63.html new file mode 100644 index 00000000000..9ebe11d691b --- /dev/null +++ b/doc/api/html/search/functions_63.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/functions_63.js b/doc/api/html/search/functions_63.js new file mode 100644 index 00000000000..02b82a9736f --- /dev/null +++ b/doc/api/html/search/functions_63.js @@ -0,0 +1,112 @@ +var searchData= +[ + ['bare_3c_20std_3a_3astring_20_3e',['bare< std::string >',['../namespacestan_1_1io.html#aec5638401c1a9174c2a1755dbb9b9a1c',1,'stan::io']]], + ['calculate_5fchain',['calculate_chain',['../namespacestan_1_1agrad.html#aa16e752d268f0240dab6f484fe0026da',1,'stan::agrad']]], + ['calculate_5fcolumn_5fwidth',['calculate_column_width',['../print_8hpp.html#a5e7bd64dd538b38c24f0950e20336b9e',1,'print.hpp']]], + ['calculate_5fcolumn_5fwidths',['calculate_column_widths',['../print_8hpp.html#aca6645f28f92ff465e290fef0fefa9bc',1,'print.hpp']]], + ['categorical_5flog',['categorical_log',['../namespacestan_1_1prob.html#af95a794f03919aea39098f278d2c59d6',1,'stan::prob::categorical_log(int n, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta)'],['../namespacestan_1_1prob.html#a246986bd8f60af47c1f81ebb814dd563',1,'stan::prob::categorical_log(const typename Eigen::Matrix< T_prob, Eigen::Dynamic, 1 >::size_type n, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta)'],['../namespacestan_1_1prob.html#a02f82adf130605305c98f4e011bbe9ac',1,'stan::prob::categorical_log(const std::vector< int > &ns, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta)'],['../namespacestan_1_1prob.html#a16675570c76e20595a8a6b7b1beeabea',1,'stan::prob::categorical_log(const std::vector< int > &ns, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta)']]], + ['categorical_5flogit_5flog',['categorical_logit_log',['../namespacestan_1_1prob.html#a2a925c941d407c44cac03cfdee07c20f',1,'stan::prob::categorical_logit_log(int n, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &beta)'],['../namespacestan_1_1prob.html#a56b41ad5a9d6c90837fe573771174921',1,'stan::prob::categorical_logit_log(int n, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &beta)'],['../namespacestan_1_1prob.html#a3fa98ec586dbbbceafb56261324b5170',1,'stan::prob::categorical_logit_log(const std::vector< int > &ns, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &beta)'],['../namespacestan_1_1prob.html#a9195250cdb8eb73cbfc24e6b78ce8fcb',1,'stan::prob::categorical_logit_log(const std::vector< int > &ns, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &beta)']]], + ['categorical_5frng',['categorical_rng',['../namespacestan_1_1prob.html#a4c3ca0ee1deca1cacd5211bbc995152e',1,'stan::prob']]], + ['cauchy_5fccdf_5flog',['cauchy_ccdf_log',['../namespacestan_1_1prob.html#ac70c31a88a9078a1abe3b7404504f1fe',1,'stan::prob']]], + ['cauchy_5fcdf',['cauchy_cdf',['../namespacestan_1_1prob.html#a47c7985de17346e84f8d63941d094c6f',1,'stan::prob']]], + ['cauchy_5fcdf_5flog',['cauchy_cdf_log',['../namespacestan_1_1prob.html#a438076c7412e6cc425b59489fd2288c3',1,'stan::prob']]], + ['cauchy_5flog',['cauchy_log',['../namespacestan_1_1prob.html#a336c31f3968917b4cb73fdd6bcb7dbda',1,'stan::prob::cauchy_log(const T_y &y, const T_loc &mu, const T_scale &sigma)'],['../namespacestan_1_1prob.html#adeee6144ac19be6775669835d4b0a544',1,'stan::prob::cauchy_log(const T_y &y, const T_loc &mu, const T_scale &sigma)']]], + ['cauchy_5frng',['cauchy_rng',['../namespacestan_1_1prob.html#a018d09865f9ab743ec78422a4e69d2d0',1,'stan::prob']]], + ['cbrt',['cbrt',['../namespacestan_1_1agrad.html#a183eb686f1c72d5de6a1997e53bd2b49',1,'stan::agrad::cbrt(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#a56daa2a3973305eca89f54b45b215b08',1,'stan::agrad::cbrt(const stan::agrad::var &a)']]], + ['ceil',['ceil',['../namespacestan_1_1agrad.html#a3edfb95b57f8b42c6c68968628ba0158',1,'stan::agrad::ceil(const var &a)'],['../namespacestan_1_1agrad.html#ab5aa6d910a8a47ea9fc1b6199d710069',1,'stan::agrad::ceil(const fvar< T > &x)']]], + ['central_5finterval',['central_interval',['../classstan_1_1mcmc_1_1chains.html#afc466fb86c162616dc6db2d4a6904e81',1,'stan::mcmc::chains::central_interval(const int chain, const int index, const double prob)'],['../classstan_1_1mcmc_1_1chains.html#a819d8aff3c3b7c40de79e493850deba3',1,'stan::mcmc::chains::central_interval(const int index, const double prob)'],['../classstan_1_1mcmc_1_1chains.html#a3c52c722eb9f5d1bde7b27307602f592',1,'stan::mcmc::chains::central_interval(const int chain, const std::string &name, const double prob)'],['../classstan_1_1mcmc_1_1chains.html#a7dcc333dfe0d01bf595700bd72e5999f',1,'stan::mcmc::chains::central_interval(const std::string &name, const double prob)']]], + ['chain',['chain',['../classstan_1_1agrad_1_1vari.html#aa0a84901028b116fad7020b30b926b98',1,'stan::agrad::vari::chain()'],['../classstan_1_1agrad_1_1partials__vari.html#a0fa792b38fdadfd389dcffcea597deeb',1,'stan::agrad::partials_vari::chain()'],['../classstan_1_1agrad_1_1chainable.html#a4d1b4d61c1b10d6da4ababce3d276592',1,'stan::agrad::chainable::chain()'],['../classstan_1_1agrad_1_1precomp__v__vari.html#a009196476cbeca0b4721a2615e275d10',1,'stan::agrad::precomp_v_vari::chain()'],['../classstan_1_1agrad_1_1stored__gradient__vari.html#ae97f9740598ac7be4c3af5769a54ac19',1,'stan::agrad::stored_gradient_vari::chain()']]], + ['chainable',['chainable',['../classstan_1_1agrad_1_1chainable.html#a7a645b2e90197e1d6a0431707b7fad59',1,'stan::agrad::chainable']]], + ['chainable_5falloc',['chainable_alloc',['../classstan_1_1agrad_1_1chainable__alloc.html#a0e5e6212324cb2453fd58b961aa1f098',1,'stan::agrad::chainable_alloc']]], + ['chains',['chains',['../classstan_1_1mcmc_1_1chains.html#ac3aa526b28133ca5e40369f1267abd51',1,'stan::mcmc::chains::chains(const Eigen::Matrix< std::string, Eigen::Dynamic, 1 > &param_names)'],['../classstan_1_1mcmc_1_1chains.html#a9155b524e66935f9e30bac5d6ae31a53',1,'stan::mcmc::chains::chains(const stan::io::stan_csv &stan_csv)']]], + ['check_5fbounded',['check_bounded',['../namespacestan_1_1math.html#a244fb67601cb568b79137450f934047b',1,'stan::math::check_bounded(const char *function, const T_y &y, const T_low &low, const T_high &high, const char *name, T_result *result)'],['../namespacestan_1_1math.html#a1e00f0db84045333d946bb2a49b924ac',1,'stan::math::check_bounded(const char *function, const T_y &y, const T_low &low, const T_high &high, const char *name)']]], + ['check_5fcholesky_5ffactor',['check_cholesky_factor',['../namespacestan_1_1math.html#a6ea62b7ae38dc4b6a84bfe90f72b1fc9',1,'stan::math::check_cholesky_factor(const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)'],['../namespacestan_1_1math.html#ab78172933a2bd63bdd511f062564a505',1,'stan::math::check_cholesky_factor(const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)'],['../namespacestan_1_1math.html#a63e498bfd9699c99b57b207e2869023a',1,'stan::math::check_cholesky_factor(const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, T_result *result)'],['../namespacestan_1_1math.html#a1bba6a9591ff4834950d8819d17ec105',1,'stan::math::check_cholesky_factor(const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, T *result=0)']]], + ['check_5fconsistent_5fsize',['check_consistent_size',['../namespacestan_1_1math.html#a8987da44a92a90edb79fd84fd39e39d3',1,'stan::math']]], + ['check_5fconsistent_5fsizes',['check_consistent_sizes',['../namespacestan_1_1math.html#ac0e0ad1687b604c6f0667a12922a2545',1,'stan::math::check_consistent_sizes(const char *function, const T1 &x1, const T2 &x2, const char *name1, const char *name2, T_result *result)'],['../namespacestan_1_1math.html#a0a4c9f7aec5e75731b7e3d0c33a758b6',1,'stan::math::check_consistent_sizes(const char *function, const T1 &x1, const T2 &x2, const T3 &x3, const char *name1, const char *name2, const char *name3, T_result *result)'],['../namespacestan_1_1math.html#a1244db32f5cb1447091b8f7965fe09d6',1,'stan::math::check_consistent_sizes(const char *function, const T1 &x1, const T2 &x2, const T3 &x3, const T4 &x4, const char *name1, const char *name2, const char *name3, const char *name4, T_result *result)']]], + ['check_5fcorr_5fmatrix',['check_corr_matrix',['../namespacestan_1_1math.html#a19892bf98f113034430413117fddd012',1,'stan::math::check_corr_matrix(const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)'],['../namespacestan_1_1math.html#ad32dc573d6046854e39913596554961b',1,'stan::math::check_corr_matrix(const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)']]], + ['check_5fcov_5fmatrix',['check_cov_matrix',['../namespacestan_1_1math.html#a90326b7bfecdcd28d2555c001ca7cf0f',1,'stan::math::check_cov_matrix(const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)'],['../namespacestan_1_1math.html#adf9d505abaaf8ae26ad366f51d71fbd8',1,'stan::math::check_cov_matrix(const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)'],['../namespacestan_1_1math.html#aea06d3b49639cdd7f4eee1a9e21d01a0',1,'stan::math::check_cov_matrix(const char *function, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma, T_result *result)'],['../namespacestan_1_1math.html#ac60a94eb57a3b80ccdb54d75a38d5aa4',1,'stan::math::check_cov_matrix(const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &Sigma, T *result=0)']]], + ['check_5ffinite',['check_finite',['../namespacestan_1_1math.html#af6feab878b8ff447121df2e6a9461680',1,'stan::math::check_finite(const char *function, const T_y &y, const char *name, T_result *result)'],['../namespacestan_1_1math.html#a46c87d5d26732e2860ae58d00f4fdff2',1,'stan::math::check_finite(const char *function, const T &y, const char *name)']]], + ['check_5fgreater',['check_greater',['../namespacestan_1_1math.html#aada3014caf18d49104f7d63d0d6ea15e',1,'stan::math::check_greater(const char *function, const T_y &y, const T_low &low, const char *name, T_result *result)'],['../namespacestan_1_1math.html#aaaf1c4b2de4ed60a01fe919a0b3655fd',1,'stan::math::check_greater(const char *function, const T_y &y, const T_low &low, const char *name)']]], + ['check_5fgreater_5for_5fequal',['check_greater_or_equal',['../namespacestan_1_1math.html#adbb58d3f6d9657f8488bc74a6db0a056',1,'stan::math::check_greater_or_equal(const char *function, const T_y &y, const T_low &low, const char *name, T_result *result)'],['../namespacestan_1_1math.html#abe66408d89f69a9d59b13d7c3d73423b',1,'stan::math::check_greater_or_equal(const char *function, const T_y &y, const T_low &low, const char *name)']]], + ['check_5fless',['check_less',['../namespacestan_1_1math.html#a7187754b7dfb0727664c3bed40ccf7b4',1,'stan::math::check_less(const char *function, const T_y &y, const T_high &high, const char *name, T_result *result)'],['../namespacestan_1_1math.html#a359cf57677ad750cbe12441ba34df391',1,'stan::math::check_less(const char *function, const T_y &y, const T_high &high, const char *name)']]], + ['check_5fless_5for_5fequal',['check_less_or_equal',['../namespacestan_1_1math.html#a1c5a1e6a543017c50d64bcdd9d53bd83',1,'stan::math::check_less_or_equal(const char *function, const T_y &y, const T_high &high, const char *name, T_result *result)'],['../namespacestan_1_1math.html#adaaa5ed482610e1a8c0477cdd60e8033',1,'stan::math::check_less_or_equal(const char *function, const T_y &y, const T_high &high, const char *name)']]], + ['check_5flower_5ftriangular',['check_lower_triangular',['../namespacestan_1_1math.html#a54f45f5cee19ad65fdd516e1b855d0fe',1,'stan::math::check_lower_triangular(const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)'],['../namespacestan_1_1math.html#a5cd9fc9fd09527b5b8adf811d3d5b5e5',1,'stan::math::check_lower_triangular(const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)']]], + ['check_5fnonnegative',['check_nonnegative',['../namespacestan_1_1math.html#a68e2e1e4423183dabe9e5cdad6bee6c2',1,'stan::math::check_nonnegative(const char *function, const T_y &y, const char *name, T_result *result)'],['../namespacestan_1_1math.html#a88d0fc72c0c2a6612f355cd48ddffab8',1,'stan::math::check_nonnegative(const char *function, const T_y &y, const char *name)']]], + ['check_5fnot_5fnan',['check_not_nan',['../namespacestan_1_1math.html#aee36bc9bba89bed1d1568d20046cd3da',1,'stan::math::check_not_nan(const char *function, const T_y &y, const char *name, T_result *result=0)'],['../namespacestan_1_1math.html#a4d490dd2ffa3a5775cfd4f5347111505',1,'stan::math::check_not_nan(const char *function, const T &y, const char *name)']]], + ['check_5fordered',['check_ordered',['../namespacestan_1_1math.html#a55bd442a2e6c56c40d7b60d0079ac8a7',1,'stan::math::check_ordered(const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const char *name, T_result *result)'],['../namespacestan_1_1math.html#a69935f4ef1aad90e6a48c49ba945efc2',1,'stan::math::check_ordered(const char *function, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &y, const char *name, T *result=0)']]], + ['check_5fpos_5fdefinite',['check_pos_definite',['../namespacestan_1_1agrad.html#a5f647d8ef1686ba2b85035726e395f40',1,'stan::agrad::check_pos_definite()'],['../namespacestan_1_1math.html#aa543443cb0c96a44613255c83d593a86',1,'stan::math::check_pos_definite(const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)'],['../namespacestan_1_1math.html#aa38f7f1aacfd755763e5b00af14ff9b6',1,'stan::math::check_pos_definite(const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)']]], + ['check_5fpos_5fsemidefinite',['check_pos_semidefinite',['../namespacestan_1_1math.html#a7341142ee291b13f1ad04152a37f974f',1,'stan::math::check_pos_semidefinite(const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)'],['../namespacestan_1_1math.html#af9a161786def6581011502056d92c021',1,'stan::math::check_pos_semidefinite(const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)']]], + ['check_5fpositive',['check_positive',['../namespacestan_1_1math.html#a573ec8402d9e6928596057ee179a96a9',1,'stan::math::check_positive(const char *function, const T_y &y, const char *name, T_result *result)'],['../namespacestan_1_1math.html#ac07e0ff96981b93a266298e6c9343395',1,'stan::math::check_positive(const char *function, const T &x, const char *name)']]], + ['check_5fpositive_5fordered',['check_positive_ordered',['../namespacestan_1_1math.html#a953ca730fb62ef45047f2a73c0f84a88',1,'stan::math::check_positive_ordered(const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const char *name, T_result *result)'],['../namespacestan_1_1math.html#a153b3fac80bd9f9739f87cfccb7eb870',1,'stan::math::check_positive_ordered(const char *function, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &y, const char *name, T *result=0)']]], + ['check_5frange',['check_range',['../namespacestan_1_1math.html#a1220906f5cf5892f9867a4b9bcec08c9',1,'stan::math']]], + ['check_5fsimplex',['check_simplex',['../namespacestan_1_1math.html#a4cbbf2c5799c876b8b5a40a6be59fad4',1,'stan::math::check_simplex(const char *function, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta, const char *name, T_result *result)'],['../namespacestan_1_1math.html#ac5371fc49b7503afbe9a49867fc5d075',1,'stan::math::check_simplex(const char *function, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &theta, const char *name, T *result=0)']]], + ['check_5fsize_5fmatch',['check_size_match',['../namespacestan_1_1math.html#aa604267d7189b6fde0be2c83f03f60f8',1,'stan::math::check_size_match(const char *function, T_size1 i, const char *name_i, T_size2 j, const char *name_j, T_result *result)'],['../namespacestan_1_1math.html#a7db9ba4076101c008a4164d1f4f0881d',1,'stan::math::check_size_match(const char *function, T_size1 i, const char *name_i, T_size2 j, const char *name_j, T_size1 *result=0)']]], + ['check_5fspsd_5fmatrix',['check_spsd_matrix',['../namespacestan_1_1math.html#a1f953f345a5fc4d4258d65c9fd494d0d',1,'stan::math::check_spsd_matrix(const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)'],['../namespacestan_1_1math.html#a919b0ac7be6e9129159dcd57b5aaa229',1,'stan::math::check_spsd_matrix(const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)']]], + ['check_5fsquare',['check_square',['../namespacestan_1_1math.html#aaa8e58058a05567645f7589f90f5acaf',1,'stan::math::check_square(const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)'],['../namespacestan_1_1math.html#a354049e8dec929a4b054b7e8db06a4fb',1,'stan::math::check_square(const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)']]], + ['check_5fsymmetric',['check_symmetric',['../namespacestan_1_1math.html#a7d97aebea4cf628724dfd08030284bb2',1,'stan::math::check_symmetric(const char *function, const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T_result *result)'],['../namespacestan_1_1math.html#a8aebef4c723a2963977653559ebd2374',1,'stan::math::check_symmetric(const char *function, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y, const char *name, T *result=0)']]], + ['check_5funit_5fvector',['check_unit_vector',['../namespacestan_1_1math.html#ab722ab154aebf9a162df8e9bd4e3e42f',1,'stan::math::check_unit_vector(const char *function, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta, const char *name, T_result *result)'],['../namespacestan_1_1math.html#a7496b0022b662c358931d1ab0458f60e',1,'stan::math::check_unit_vector(const char *function, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &theta, const char *name, T *result=0)']]], + ['chi_5fsquare_5fccdf_5flog',['chi_square_ccdf_log',['../namespacestan_1_1prob.html#a3053cf28f5702b2b815e90f6e13a0931',1,'stan::prob']]], + ['chi_5fsquare_5fcdf',['chi_square_cdf',['../namespacestan_1_1prob.html#a200487188f204a155be81bcf76e3e578',1,'stan::prob']]], + ['chi_5fsquare_5fcdf_5flog',['chi_square_cdf_log',['../namespacestan_1_1prob.html#abec586221c76c3d3da9654cba160b35d',1,'stan::prob']]], + ['chi_5fsquare_5flog',['chi_square_log',['../namespacestan_1_1prob.html#ab7eb2d6575574aa8b2838532bb81832d',1,'stan::prob::chi_square_log(const T_y &y, const T_dof &nu)'],['../namespacestan_1_1prob.html#ab08231831678e188d428e0bd78c900f0',1,'stan::prob::chi_square_log(const T_y &y, const T_dof &nu)']]], + ['chi_5fsquare_5frng',['chi_square_rng',['../namespacestan_1_1prob.html#a367304c7727de79fa5d8660f1406754b',1,'stan::prob']]], + ['cholesky_5fdecompose',['cholesky_decompose',['../namespacestan_1_1math.html#abbcc91ff24e86fa318fe0f8a9111b4c5',1,'stan::math']]], + ['cholesky_5ffactor',['cholesky_factor',['../classstan_1_1io_1_1reader.html#a9572cd028cf0d073c45ab83ae6f4477e',1,'stan::io::reader']]], + ['cholesky_5ffactor_5fconstrain',['cholesky_factor_constrain',['../classstan_1_1io_1_1reader.html#a6c6bee8c526c8d114c95646f171413cc',1,'stan::io::reader::cholesky_factor_constrain(size_t M, size_t N)'],['../classstan_1_1io_1_1reader.html#ac49f77d0cd4d89f3d06ac62515cfa809',1,'stan::io::reader::cholesky_factor_constrain(size_t M, size_t N, T &lp)'],['../namespacestan_1_1prob.html#a1fed06bde5073fb875496b5a680c39ca',1,'stan::prob::cholesky_factor_constrain(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, int M, int N)'],['../namespacestan_1_1prob.html#aaac795244dbcd9bb3fa44d2275ddc3c1',1,'stan::prob::cholesky_factor_constrain(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, int M, int N, T &lp)']]], + ['cholesky_5ffactor_5ffree',['cholesky_factor_free',['../namespacestan_1_1prob.html#a74157f1d9c708df760d602d6adb53712',1,'stan::prob']]], + ['cholesky_5ffactor_5funconstrain',['cholesky_factor_unconstrain',['../classstan_1_1io_1_1writer.html#ae96ed09cbcd87375c712e20503894264',1,'stan::io::writer']]], + ['cholesky_5ffactor_5fvar_5fdecl',['cholesky_factor_var_decl',['../structstan_1_1gm_1_1cholesky__factor__var__decl.html#ae19a9b374feff362b4f32d0d8cb8a4df',1,'stan::gm::cholesky_factor_var_decl::cholesky_factor_var_decl()'],['../structstan_1_1gm_1_1cholesky__factor__var__decl.html#a661cb5898a5139eba744d9d53309584f',1,'stan::gm::cholesky_factor_var_decl::cholesky_factor_var_decl(expression const &M, expression const &N, std::string const &name, std::vector< expression > const &dims)']]], + ['chunk_5falloc',['chunk_alloc',['../classstan_1_1memory_1_1chunk__alloc.html#a51cecbbac945e0b108229b21ecd6abf7',1,'stan::memory::chunk_alloc']]], + ['cmd_5fline',['cmd_line',['../classstan_1_1io_1_1cmd__line.html#a8b00f5947e12e84d1740116a05a4ca16',1,'stan::io::cmd_line']]], + ['col',['col',['../namespacestan_1_1math.html#ae497ca37fd7867fd11c4cd095c8aaa71',1,'stan::math']]], + ['cols',['cols',['../classstan_1_1math_1_1_l_d_l_t__factor_3_01stan_1_1agrad_1_1var_00_01_r_00_01_c_01_4.html#a00df49ca9dbf61b2f6b1fc6c991c1fb9',1,'stan::math::LDLT_factor< stan::agrad::var, R, C >::cols()'],['../classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4.html#adf662c7112e7274e630e07d7ac14c78a',1,'stan::math::LDLT_factor< double, R, C >::cols()'],['../namespacestan_1_1math.html#a871bccc233a4dcd764ffece5a3f9a399',1,'stan::math::cols()']]], + ['columns_5fdot_5fproduct',['columns_dot_product',['../namespacestan_1_1agrad.html#a4690cc81441d5be35328e09c11b6d0bb',1,'stan::agrad::columns_dot_product(const Eigen::Matrix< fvar< T >, R1, C1 > &v1, const Eigen::Matrix< fvar< T >, R2, C2 > &v2)'],['../namespacestan_1_1agrad.html#ad72bd7f6e164cb2341d055ace67c32af',1,'stan::agrad::columns_dot_product(const Eigen::Matrix< fvar< T >, R1, C1 > &v1, const Eigen::Matrix< double, R2, C2 > &v2)'],['../namespacestan_1_1agrad.html#ad2c2338e972cab17e0f8cbcaa190d90b',1,'stan::agrad::columns_dot_product(const Eigen::Matrix< double, R1, C1 > &v1, const Eigen::Matrix< fvar< T >, R2, C2 > &v2)'],['../namespacestan_1_1agrad.html#a3d6da62972dd8c1d717b7e99838c84bc',1,'stan::agrad::columns_dot_product(const Eigen::Matrix< T1, R1, C1 > &v1, const Eigen::Matrix< T2, R2, C2 > &v2)'],['../namespacestan_1_1math.html#a6d03b34aa7329a68f31d1c7bc500c5c8',1,'stan::math::columns_dot_product()']]], + ['columns_5fdot_5fself',['columns_dot_self',['../namespacestan_1_1agrad.html#aa4910329638fc8776c1568e9c41ae014',1,'stan::agrad::columns_dot_self(const Eigen::Matrix< fvar< T >, R, C > &x)'],['../namespacestan_1_1agrad.html#a6b316428660dff0e79e67e804ad1cbce',1,'stan::agrad::columns_dot_self(const Eigen::Matrix< var, R, C > &x)'],['../namespacestan_1_1math.html#af03701ff6420231890468e9881eb9245',1,'stan::math::columns_dot_self()']]], + ['comma',['comma',['../classstan_1_1io_1_1csv__writer.html#a3b3dd2236e6e62005bad3a4dfbea6596',1,'stan::io::csv_writer']]], + ['command',['command',['../classstan_1_1io_1_1cmd__line.html#acffdc087dbbe052e4827b281e2c388f7',1,'stan::io::cmd_line::command()'],['../namespacestan_1_1gm.html#a4f99fc7285080014068543c8d5ab71b1',1,'stan::gm::command()']]], + ['compile',['compile',['../namespacestan_1_1gm.html#afa03c3de30429fab595ea53c97b9edc8',1,'stan::gm']]], + ['complete_5fadaptation',['complete_adaptation',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#a6a58fb8dd3f3b90c16ac9f86299c7da3',1,'stan::mcmc::stepsize_adaptation']]], + ['compute',['compute',['../classstan_1_1math_1_1_l_d_l_t__factor_3_01stan_1_1agrad_1_1var_00_01_r_00_01_c_01_4.html#adea90c563014600ac9d7aa05056db56d',1,'stan::math::LDLT_factor< stan::agrad::var, R, C >::compute()'],['../classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4.html#add76e21a65bdd840ca67d24531612573',1,'stan::math::LDLT_factor< double, R, C >::compute()']]], + ['compute_5fcriterion',['compute_criterion',['../classstan_1_1mcmc_1_1base__nuts.html#ac2961f3ce35af570405291a8011e1064',1,'stan::mcmc::base_nuts::compute_criterion()'],['../classstan_1_1mcmc_1_1dense__e__nuts.html#aa23ebe0b61e0ed91a9a94457e69e08da',1,'stan::mcmc::dense_e_nuts::compute_criterion()'],['../classstan_1_1mcmc_1_1diag__e__nuts.html#a61f9db95ebdc67274cdea0f479dc0a5e',1,'stan::mcmc::diag_e_nuts::compute_criterion()'],['../classstan_1_1mcmc_1_1unit__e__nuts.html#ab61a9ee4db3845a88adc78249e35c170',1,'stan::mcmc::unit_e_nuts::compute_criterion()']]], + ['compute_5findent',['compute_indent',['../classstan_1_1gm_1_1argument.html#a1df06fb3f558fc0eecfce30d38f77359',1,'stan::gm::argument']]], + ['compute_5fnext_5fwindow',['compute_next_window',['../classstan_1_1mcmc_1_1windowed__adaptation.html#a99adff4a3380c627160d995b5584bf8e',1,'stan::mcmc::windowed_adaptation']]], + ['compute_5fprecision',['compute_precision',['../print_8hpp.html#a0fc6b77bb6e90f0e770af8b3fe5ac44d',1,'print.hpp']]], + ['compute_5fwidth',['compute_width',['../print_8hpp.html#a78042a12545744a3a7978b458faea92c',1,'print.hpp']]], + ['compute_5fwidth_5fand_5fprecision',['compute_width_and_precision',['../print_8hpp.html#a16acdd9987d7a0e6d03b905f9c6cc65b',1,'print.hpp']]], + ['conditional_5fstatement',['conditional_statement',['../structstan_1_1gm_1_1conditional__statement.html#a1abc13ef1fe45721706610334a3fc111',1,'stan::gm::conditional_statement::conditional_statement()'],['../structstan_1_1gm_1_1conditional__statement.html#a9ee4cb8e757e7be347cb40f870b77494',1,'stan::gm::conditional_statement::conditional_statement(const std::vector< expression > &conditions, const std::vector< statement > &statements)']]], + ['constrained_5fparam_5fnames_5fvisgen',['constrained_param_names_visgen',['../structstan_1_1gm_1_1constrained__param__names__visgen.html#ab1fef3623722eef039191cf79b87e84b',1,'stan::gm::constrained_param_names_visgen']]], + ['cont_5fparams',['cont_params',['../classstan_1_1mcmc_1_1sample.html#aa6dbff10de92bcd52e156ac8ca8eba6e',1,'stan::mcmc::sample::cont_params(int k) const '],['../classstan_1_1mcmc_1_1sample.html#ae659b68fe8ac4a7a87fcd53549133c90',1,'stan::mcmc::sample::cont_params(Eigen::VectorXd &x) const '],['../classstan_1_1mcmc_1_1sample.html#afa5f116f5b79a757bfb7d68931bd3c17',1,'stan::mcmc::sample::cont_params() const ']]], + ['contains_5fi',['contains_i',['../classstan_1_1io_1_1dump.html#a1865fdffc3451dd6460a5540c8e0912e',1,'stan::io::dump::contains_i()'],['../classstan_1_1io_1_1var__context.html#a57b4df63029aa81a4ee3e93899722068',1,'stan::io::var_context::contains_i()']]], + ['contains_5fnonparam_5fvar',['contains_nonparam_var',['../structstan_1_1gm_1_1contains__nonparam__var.html#a6beb41e5c41785733e1cc6881eba82a9',1,'stan::gm::contains_nonparam_var']]], + ['contains_5fr',['contains_r',['../classstan_1_1io_1_1dump.html#ac531d67fb8a74300ebbe014dfe367706',1,'stan::io::dump::contains_r()'],['../classstan_1_1io_1_1var__context.html#abaa6a87ecb4d45c29386f0de57b330f4',1,'stan::io::var_context::contains_r()']]], + ['contains_5fvar',['contains_var',['../structstan_1_1gm_1_1contains__var.html#a8d00ba5b2f7fcecec2baca23d1ddb200',1,'stan::gm::contains_var']]], + ['corr',['corr',['../classstan_1_1io_1_1reader.html#af409911d7c4b3996291884fbebecfd85',1,'stan::io::reader']]], + ['corr_5fconstrain',['corr_constrain',['../classstan_1_1io_1_1reader.html#aeaafba520a6ad5ae7654e24d46ffbb39',1,'stan::io::reader::corr_constrain()'],['../classstan_1_1io_1_1reader.html#a83d52f9f5ffec50991cf3224f1caad9c',1,'stan::io::reader::corr_constrain(T &lp)'],['../namespacestan_1_1prob.html#a1a965b7e5c7fc2ef6bbd3a436ae17b99',1,'stan::prob::corr_constrain(const T x)'],['../namespacestan_1_1prob.html#a845c7b8687f4e6b588820b815e464729',1,'stan::prob::corr_constrain(const T x, T &lp)']]], + ['corr_5ffree',['corr_free',['../namespacestan_1_1prob.html#ade592c3579e0e7a685b7e2ec5bb0218b',1,'stan::prob']]], + ['corr_5fmatrix',['corr_matrix',['../classstan_1_1io_1_1reader.html#aa410515341701109fb937c14b101e20d',1,'stan::io::reader']]], + ['corr_5fmatrix_5fconstrain',['corr_matrix_constrain',['../classstan_1_1io_1_1reader.html#a75eb056f8f7b1032865feb97f506e3e6',1,'stan::io::reader::corr_matrix_constrain(size_t k)'],['../classstan_1_1io_1_1reader.html#ab23e0b88e39d354121b66e6823e1cac9',1,'stan::io::reader::corr_matrix_constrain(size_t k, T &lp)'],['../namespacestan_1_1prob.html#ad9af41714d33fbe0e5e29aab85553ccc',1,'stan::prob::corr_matrix_constrain(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, typename Eigen::Matrix< T, Eigen::Dynamic, 1 >::size_type k)'],['../namespacestan_1_1prob.html#a2767379e92ce98f2f7016b47e7aeec47',1,'stan::prob::corr_matrix_constrain(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, typename Eigen::Matrix< T, Eigen::Dynamic, 1 >::size_type k, T &lp)']]], + ['corr_5fmatrix_5ffree',['corr_matrix_free',['../namespacestan_1_1prob.html#acc2abdf331f1cc4b3f36b15a66088ab2',1,'stan::prob']]], + ['corr_5fmatrix_5funconstrain',['corr_matrix_unconstrain',['../classstan_1_1io_1_1writer.html#af26ec20d15ff3a57ab0e1a87579decbb',1,'stan::io::writer']]], + ['corr_5fmatrix_5fvar_5fdecl',['corr_matrix_var_decl',['../structstan_1_1gm_1_1corr__matrix__var__decl.html#acb8f9bbb7cbfcc2a5cae3b6b6e5aa3a3',1,'stan::gm::corr_matrix_var_decl::corr_matrix_var_decl()'],['../structstan_1_1gm_1_1corr__matrix__var__decl.html#a208b78416bf4d23b7b093014c19c03d2',1,'stan::gm::corr_matrix_var_decl::corr_matrix_var_decl(expression const &K, std::string const &name, std::vector< expression > const &dims)']]], + ['corr_5funconstrain',['corr_unconstrain',['../classstan_1_1io_1_1writer.html#a00cb858ddd90f1af498f1dfe552f2658',1,'stan::io::writer']]], + ['correlation',['correlation',['../classstan_1_1mcmc_1_1chains.html#aaf76107a82d21ec2a1b49e436faa459b',1,'stan::mcmc::chains::correlation(const int chain, const int index1, const int index2)'],['../classstan_1_1mcmc_1_1chains.html#a2cf11cd1b7b928ebf87d6708a0bada74',1,'stan::mcmc::chains::correlation(const int index1, const int index2)'],['../classstan_1_1mcmc_1_1chains.html#ab581e93f8ad9222927be0ab55de4e83c',1,'stan::mcmc::chains::correlation(const int chain, const std::string &name1, const std::string &name2)'],['../classstan_1_1mcmc_1_1chains.html#aa5f25ea09b915b3c768947c3e3e03bf5',1,'stan::mcmc::chains::correlation(const std::string &name1, const std::string &name2)']]], + ['cos',['cos',['../namespacestan_1_1agrad.html#a6f03b0ce8e8e381865f09baa3036d48d',1,'stan::agrad::cos(const var &a)'],['../namespacestan_1_1agrad.html#a1768b39c559d7c8e0f467ea1916b625f',1,'stan::agrad::cos(const fvar< T > &x)']]], + ['cosh',['cosh',['../namespacestan_1_1agrad.html#a0c2536220a01717d9efc8aa9b993d46b',1,'stan::agrad::cosh(const var &a)'],['../namespacestan_1_1agrad.html#a2401e1b775fc8f3ba201a30d66022d09',1,'stan::agrad::cosh(const fvar< T > &x)']]], + ['cov_5fmatrix',['cov_matrix',['../classstan_1_1io_1_1reader.html#a6b0b034457a37f2eb7c27cec9b8e600d',1,'stan::io::reader']]], + ['cov_5fmatrix_5fconstrain',['cov_matrix_constrain',['../classstan_1_1io_1_1reader.html#ab8ada631ae87ef2de7978a33299e872e',1,'stan::io::reader::cov_matrix_constrain(size_t k)'],['../classstan_1_1io_1_1reader.html#a1ea7077509503ff9bf2777430cb70fcf',1,'stan::io::reader::cov_matrix_constrain(size_t k, T &lp)'],['../namespacestan_1_1prob.html#afe73ba3027bcb8e30424b81a5460828b',1,'stan::prob::cov_matrix_constrain(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, typename Eigen::Matrix< T, Eigen::Dynamic, 1 >::size_type K)'],['../namespacestan_1_1prob.html#af8bbcd6e6f8239799dc9b2661059801b',1,'stan::prob::cov_matrix_constrain(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, typename Eigen::Matrix< T, Eigen::Dynamic, 1 >::size_type K, T &lp)']]], + ['cov_5fmatrix_5fconstrain_5flkj',['cov_matrix_constrain_lkj',['../namespacestan_1_1prob.html#ae151aa1645e82ec7cb298466edcbbb0b',1,'stan::prob::cov_matrix_constrain_lkj(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, size_t k)'],['../namespacestan_1_1prob.html#a26ee45f1dd50ceaca0eea65cab7e85b3',1,'stan::prob::cov_matrix_constrain_lkj(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, size_t k, T &lp)']]], + ['cov_5fmatrix_5ffree',['cov_matrix_free',['../namespacestan_1_1prob.html#a402fcdcfe19b2a5c25f4729d1cf31678',1,'stan::prob']]], + ['cov_5fmatrix_5ffree_5flkj',['cov_matrix_free_lkj',['../namespacestan_1_1prob.html#a7f6a575490d3de6839a6f544781bf464',1,'stan::prob']]], + ['cov_5fmatrix_5funconstrain',['cov_matrix_unconstrain',['../classstan_1_1io_1_1writer.html#a2f9bb2387b552311a613cc00391e6bb4',1,'stan::io::writer']]], + ['cov_5fmatrix_5fvar_5fdecl',['cov_matrix_var_decl',['../structstan_1_1gm_1_1cov__matrix__var__decl.html#aebf75d147fbbf2ee7e8d52aa48a0fd76',1,'stan::gm::cov_matrix_var_decl::cov_matrix_var_decl()'],['../structstan_1_1gm_1_1cov__matrix__var__decl.html#aedec8ffe9e2f319afd7eb903e3b17dc6',1,'stan::gm::cov_matrix_var_decl::cov_matrix_var_decl(expression const &K, std::string const &name, std::vector< expression > const &dims)']]], + ['covar_5fadaptation',['covar_adaptation',['../classstan_1_1mcmc_1_1covar__adaptation.html#a32edd1badb6af5fad1348168ab4d5d91',1,'stan::mcmc::covar_adaptation']]], + ['covariance',['covariance',['../classstan_1_1mcmc_1_1chains.html#a1611771bf5fa3c15e528d26836aa2ac5',1,'stan::mcmc::chains::covariance(const int chain, const int index1, const int index2)'],['../classstan_1_1mcmc_1_1chains.html#a5bc40586bfcc5bfef6e5b6bf651608ec',1,'stan::mcmc::chains::covariance(const int index1, const int index2)'],['../classstan_1_1mcmc_1_1chains.html#a99a0247f578644538745f03510f0f268',1,'stan::mcmc::chains::covariance(const int chain, const std::string &name1, const std::string &name2)'],['../classstan_1_1mcmc_1_1chains.html#a2920dbf4b733612596fc7b306043aceb',1,'stan::mcmc::chains::covariance(const std::string &name1, const std::string &name2)']]], + ['crossprod',['crossprod',['../namespacestan_1_1agrad.html#a5091c4a9b716a75406b9cbee072a27c1',1,'stan::agrad::crossprod(const Eigen::Matrix< fvar< T >, R, C > &m)'],['../namespacestan_1_1agrad.html#a704fdafdbf6fd44b9b3a382bc23a026e',1,'stan::agrad::crossprod(const matrix_v &M)'],['../namespacestan_1_1math.html#a62cc3a137ff3220bdd0137a52a4b9714',1,'stan::math::crossprod()']]], + ['csv_5fwriter',['csv_writer',['../classstan_1_1io_1_1csv__writer.html#a50ab9dce7685e32f9e7575a4aac66e0f',1,'stan::io::csv_writer']]], + ['cumulative_5fsum',['cumulative_sum',['../namespacestan_1_1math.html#a7340f6be8ae1e121c6d854005560fef5',1,'stan::math::cumulative_sum(const std::vector< T > &x)'],['../namespacestan_1_1math.html#affab469ac332306aa00947f4a7c5d30b',1,'stan::math::cumulative_sum(const Eigen::Matrix< T, R, C > &m)']]], + ['curr_5ff',['curr_f',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#afaba4589a2a29fd201c3642f06cc11c3',1,'stan::optimization::BFGSMinimizer']]], + ['curr_5fg',['curr_g',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a9010c566033a5a18b1f7ece46811f552',1,'stan::optimization::BFGSMinimizer']]], + ['curr_5fs',['curr_s',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a76bc647acbfdad3f5f593ec940df8d84',1,'stan::optimization::BFGSMinimizer']]], + ['curr_5fx',['curr_x',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a23c0ccc29dcf6eed8995300a8642f887',1,'stan::optimization::BFGSMinimizer']]], + ['val_3c_20std_3a_3astring_20_3e',['val< std::string >',['../namespacestan_1_1io.html#a6717f7e0267a49b9c35e24aa6183236a',1,'stan::io']]] +]; diff --git a/doc/api/html/search/functions_64.html b/doc/api/html/search/functions_64.html new file mode 100644 index 00000000000..d8b63943c86 --- /dev/null +++ b/doc/api/html/search/functions_64.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/functions_64.js b/doc/api/html/search/functions_64.js new file mode 100644 index 00000000000..e0ef005e2aa --- /dev/null +++ b/doc/api/html/search/functions_64.js @@ -0,0 +1,61 @@ +var searchData= +[ + ['data_5fi',['data_i',['../classstan_1_1io_1_1writer.html#a6cf35dda98f2d8d322f337fa5e4db8c5',1,'stan::io::writer']]], + ['data_5fr',['data_r',['../classstan_1_1io_1_1writer.html#afc520ab8c7f1a351ba7b8955d7045a73',1,'stan::io::writer']]], + ['declare_5farray',['declare_array',['../structstan_1_1gm_1_1member__var__decl__visgen.html#a7cd6cbe9a4e154a4b47437ec8506b4a0',1,'stan::gm::member_var_decl_visgen::declare_array()'],['../structstan_1_1gm_1_1local__var__decl__visgen.html#aa021dda326a4032145da713d78091b30',1,'stan::gm::local_var_decl_visgen::declare_array()']]], + ['delete_5ffile',['delete_file',['../stanc__helper_8hpp.html#a018575b1df2fee775b6583718a7ddc18',1,'stanc_helper.hpp']]], + ['denorm_5fmin',['denorm_min',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a60e936662fc9da655a32defc4b13c305',1,'std::numeric_limits< stan::agrad::fvar< T > >::denorm_min()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#afc66e528e2fad364eb324e672d49fe86',1,'std::numeric_limits< stan::agrad::var >::denorm_min()']]], + ['dense_5fe_5fmetric',['dense_e_metric',['../classstan_1_1mcmc_1_1dense__e__metric.html#aacbf4525e5660fd18eaea038e54e10e2',1,'stan::mcmc::dense_e_metric']]], + ['dense_5fe_5fnuts',['dense_e_nuts',['../classstan_1_1mcmc_1_1dense__e__nuts.html#a556e5c4e0ddf32b50ccd4bae8cb54e22',1,'stan::mcmc::dense_e_nuts']]], + ['dense_5fe_5fpoint',['dense_e_point',['../classstan_1_1mcmc_1_1dense__e__point.html#a3b437b07a44c6994c669ee8ae673e975',1,'stan::mcmc::dense_e_point::dense_e_point(int n)'],['../classstan_1_1mcmc_1_1dense__e__point.html#a493b3745174b5d6dcc50dd2ec6b5e422',1,'stan::mcmc::dense_e_point::dense_e_point(const dense_e_point &z)']]], + ['dense_5fe_5fstatic_5fhmc',['dense_e_static_hmc',['../classstan_1_1mcmc_1_1dense__e__static__hmc.html#a8eae1f2e8a48c368ecd5d013099b692e',1,'stan::mcmc::dense_e_static_hmc']]], + ['derivative',['derivative',['../namespacestan_1_1agrad.html#adf138af35c36b51a588f35e10dfa6e06',1,'stan::agrad']]], + ['description',['description',['../classstan_1_1gm_1_1argument.html#a49d0e69d3fbade5ba476bac73f68cb24',1,'stan::gm::argument']]], + ['determinant',['determinant',['../namespacestan_1_1agrad.html#aa27b1abc14538bd9946ad1d6d1e8e60a',1,'stan::agrad::determinant(const Eigen::Matrix< fvar< T >, R, C > &m)'],['../namespacestan_1_1agrad.html#a6d1cf84909394145bb264afb9fee64ac',1,'stan::agrad::determinant(const Eigen::Matrix< var, R, C > &m)'],['../namespacestan_1_1math.html#ab65e9ab0e6f725c7e11068b0be2af84f',1,'stan::math::determinant()']]], + ['df',['df',['../classstan_1_1optimization_1_1_model_adaptor.html#a5c832385e9d4792ccf2c4375e2b1ade3',1,'stan::optimization::ModelAdaptor']]], + ['diag_5fe_5fmetric',['diag_e_metric',['../classstan_1_1mcmc_1_1diag__e__metric.html#aa85e6a49b53531d5cd722666394fbd70',1,'stan::mcmc::diag_e_metric']]], + ['diag_5fe_5fnuts',['diag_e_nuts',['../classstan_1_1mcmc_1_1diag__e__nuts.html#a2adb4853ab835ff95474e593750cc4f7',1,'stan::mcmc::diag_e_nuts']]], + ['diag_5fe_5fpoint',['diag_e_point',['../classstan_1_1mcmc_1_1diag__e__point.html#a5cfefc79d93c982528c7cf957fdc20a2',1,'stan::mcmc::diag_e_point::diag_e_point(int n)'],['../classstan_1_1mcmc_1_1diag__e__point.html#a7fd76371128c831232948273a46c50b2',1,'stan::mcmc::diag_e_point::diag_e_point(const diag_e_point &z)']]], + ['diag_5fe_5fstatic_5fhmc',['diag_e_static_hmc',['../classstan_1_1mcmc_1_1diag__e__static__hmc.html#a3188ee6bf11965a9e5a582302483f8fc',1,'stan::mcmc::diag_e_static_hmc']]], + ['diag_5fmatrix',['diag_matrix',['../namespacestan_1_1math.html#af970bc3201f476e84259e7ba2d4eb276',1,'stan::math']]], + ['diag_5fpost_5fmultiply',['diag_post_multiply',['../namespacestan_1_1math.html#a00896827d3247350178c86c0aed533f6',1,'stan::math']]], + ['diag_5fpre_5fmultiply',['diag_pre_multiply',['../namespacestan_1_1math.html#a6159f8ffb5a37c394dff93781622f504',1,'stan::math']]], + ['diagonal',['diagonal',['../namespacestan_1_1math.html#a877aa9df52c3a3f300a3d214c7bde64a',1,'stan::math']]], + ['digamma',['digamma',['../namespacestan_1_1agrad.html#a253104e7f6fed46947b23b3e9515b668',1,'stan::agrad::digamma(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#aec8af996186baacdbb3e707fa02d80ea',1,'stan::agrad::digamma(const stan::agrad::var &a)'],['../namespacestan_1_1math.html#a5eb54ce92709046c6d168e851d2481c7',1,'stan::math::digamma()']]], + ['dimensions',['dimensions',['../print_8hpp.html#aca9cbff882a3a995d9d4bc69d0f693da',1,'print.hpp']]], + ['dims',['dims',['../classstan_1_1io_1_1dump__reader.html#a6ada826cbef5e7ab4213efe629945d95',1,'stan::io::dump_reader::dims()'],['../namespacestan_1_1math.html#a2b9073e39033e56eb31344091f0170fd',1,'stan::math::dims(const T &x, std::vector< int > &result)'],['../namespacestan_1_1math.html#af95a2dcde478c06e3543511821618902',1,'stan::math::dims(const Eigen::Matrix< T, R, C > &x, std::vector< int > &result)'],['../namespacestan_1_1math.html#a467589eef4220a87d457c8a268a1fd5d',1,'stan::math::dims(const std::vector< T > &x, std::vector< int > &result)'],['../namespacestan_1_1math.html#a33777ee768c7032331ca8b92e5323384',1,'stan::math::dims(const T &x)']]], + ['dims_5fi',['dims_i',['../classstan_1_1io_1_1dump.html#a1bdf386abd7e81a9a287c6a59a48eac9',1,'stan::io::dump::dims_i()'],['../classstan_1_1io_1_1var__context.html#a445c05ee5f0fbe9548cdbdc7b08d31f1',1,'stan::io::var_context::dims_i()']]], + ['dims_5fr',['dims_r',['../classstan_1_1io_1_1dump.html#ad1a19a706880befca7fe4a3c4dc4a39f',1,'stan::io::dump::dims_r()'],['../classstan_1_1io_1_1var__context.html#ae1e90fd2b90b43267a5ab1c1b5cf880a',1,'stan::io::var_context::dims_r()']]], + ['dirichlet_5flog',['dirichlet_log',['../namespacestan_1_1prob.html#a788f709440fd4c6189fa6d40a32cc328',1,'stan::prob::dirichlet_log(const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta, const Eigen::Matrix< T_prior_sample_size, Eigen::Dynamic, 1 > &alpha)'],['../namespacestan_1_1prob.html#a91bcdf333694f9c1f685de29105d9bf5',1,'stan::prob::dirichlet_log(const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta, const Eigen::Matrix< T_prior_sample_size, Eigen::Dynamic, 1 > &alpha)']]], + ['dirichlet_5frng',['dirichlet_rng',['../namespacestan_1_1prob.html#a4324e10af97b35a6b667f7b02ddbb7e2',1,'stan::prob']]], + ['disengage_5fadaptation',['disengage_adaptation',['../classstan_1_1mcmc_1_1base__adapter.html#af8eb7f179d54f984c61aa945ceb56492',1,'stan::mcmc::base_adapter::disengage_adaptation()'],['../classstan_1_1mcmc_1_1adapt__dense__e__nuts.html#aac70c0c7dc28e85fa793176e0f05b2e0',1,'stan::mcmc::adapt_dense_e_nuts::disengage_adaptation()'],['../classstan_1_1mcmc_1_1adapt__diag__e__nuts.html#a6b7d857c9b602525cbdddf78f18f5f52',1,'stan::mcmc::adapt_diag_e_nuts::disengage_adaptation()'],['../classstan_1_1mcmc_1_1adapt__unit__e__nuts.html#a7024d8a1794d7d3afa01a7cc92e1a734',1,'stan::mcmc::adapt_unit_e_nuts::disengage_adaptation()'],['../classstan_1_1mcmc_1_1adapt__dense__e__static__hmc.html#a82b0383814a0aa603f06651c562ac649',1,'stan::mcmc::adapt_dense_e_static_hmc::disengage_adaptation()'],['../classstan_1_1mcmc_1_1adapt__diag__e__static__hmc.html#afcc9890fefe667daf023826a054324b3',1,'stan::mcmc::adapt_diag_e_static_hmc::disengage_adaptation()'],['../classstan_1_1mcmc_1_1adapt__unit__e__static__hmc.html#a3b2afe0cec71096e356ac100014c9073',1,'stan::mcmc::adapt_unit_e_static_hmc::disengage_adaptation()']]], + ['dist',['dist',['../namespacestan_1_1math.html#ae86020a972c6efc6b3407c3cfc30f4a6',1,'stan::math::dist(const std::vector< double > &x, const std::vector< double > &y)'],['../namespacestan_1_1math.html#a5b7a051fb294f63774525cb76bfb3fb9',1,'stan::math::dist(const Eigen::Matrix< T1, R1, C1 > &v1, const Eigen::Matrix< T2, R2, C2 > &v2)']]], + ['divide',['divide',['../namespacestan_1_1agrad.html#a8834a2f7763f46dd14e765d6c3287d23',1,'stan::agrad::divide(const T1 &v, const T2 &c)'],['../namespacestan_1_1agrad.html#a8bfe03ac15191df9f6777217e8d698b8',1,'stan::agrad::divide(const Eigen::Matrix< fvar< T >, R, C > &v, const fvar< T > &c)'],['../namespacestan_1_1agrad.html#a1897f84d86b89b5485b10f20e30a2613',1,'stan::agrad::divide(const Eigen::Matrix< fvar< T >, R, C > &v, const double c)'],['../namespacestan_1_1agrad.html#a9e95e534e22aad48cd9a29584958f7a2',1,'stan::agrad::divide(const Eigen::Matrix< double, R, C > &v, const fvar< T > &c)'],['../namespacestan_1_1agrad.html#af3abe6f014b50c5873fa84734cad4131',1,'stan::agrad::divide(double x, double y)'],['../namespacestan_1_1agrad.html#a6b7cb944896ee4923018198ea3946773',1,'stan::agrad::divide(const Eigen::Matrix< T1, R, C > &v, const T2 &c)'],['../namespacestan_1_1math.html#a082ee76b34a2ea656d2c8ab9186c1a2b',1,'stan::math::divide()']]], + ['do_5flkj_5fconstant',['do_lkj_constant',['../namespacestan_1_1prob.html#a3e884a06b4337008b72a3e75c1aee386',1,'stan::prob']]], + ['do_5fprint',['do_print',['../namespacestan_1_1gm.html#a0505a5edd8692d9113977c9cd19bc778',1,'stan::gm']]], + ['dom_5ferr',['dom_err',['../namespacestan_1_1math.html#a5af45491b0f1852295f1c7ec0730294c',1,'stan::math']]], + ['dom_5ferr_5fvec',['dom_err_vec',['../namespacestan_1_1math.html#a5114bd4a8397e21dd60cc596d24022fe',1,'stan::math']]], + ['dot',['dot',['../namespacestan_1_1math.html#afd3b73319bd8df9dad1d3902997d8e89',1,'stan::math']]], + ['dot_5fproduct',['dot_product',['../namespacestan_1_1agrad.html#a6ab5996a680002f996384f7f7cc2ba86',1,'stan::agrad::dot_product(const Eigen::Matrix< fvar< T >, R1, C1 > &v1, const Eigen::Matrix< fvar< T >, R2, C2 > &v2)'],['../namespacestan_1_1agrad.html#a516128a11f53f55e533ed1d0bcd07b1d',1,'stan::agrad::dot_product(const Eigen::Matrix< fvar< T >, R1, C1 > &v1, const Eigen::Matrix< double, R2, C2 > &v2)'],['../namespacestan_1_1agrad.html#a2e18b595e821acf4af3bd9615b51eeff',1,'stan::agrad::dot_product(const Eigen::Matrix< double, R1, C1 > &v1, const Eigen::Matrix< fvar< T >, R2, C2 > &v2)'],['../namespacestan_1_1agrad.html#aaf1dc132cacae954cde8a4bd94d3d33e',1,'stan::agrad::dot_product(const Eigen::Matrix< fvar< T >, R1, C1 > &v1, const Eigen::Matrix< fvar< T >, R2, C2 > &v2, size_type &length)'],['../namespacestan_1_1agrad.html#a48ed77a6a9982642731d22f05f729281',1,'stan::agrad::dot_product(const Eigen::Matrix< fvar< T >, R1, C1 > &v1, const Eigen::Matrix< double, R2, C2 > &v2, size_type &length)'],['../namespacestan_1_1agrad.html#a2588ccae6e0c5bd5cfa50c08477025c9',1,'stan::agrad::dot_product(const Eigen::Matrix< double, R1, C1 > &v1, const Eigen::Matrix< fvar< T >, R2, C2 > &v2, size_type &length)'],['../namespacestan_1_1agrad.html#adc99c244a2cd1ac8e60ba4a14874d874',1,'stan::agrad::dot_product(const std::vector< fvar< T > > &v1, const std::vector< fvar< T > > &v2)'],['../namespacestan_1_1agrad.html#a427294fe7f03d86b0d13c588de3056f6',1,'stan::agrad::dot_product(const std::vector< double > &v1, const std::vector< fvar< T > > &v2)'],['../namespacestan_1_1agrad.html#aa01ea6a323474c7fbb9be783a9f805ff',1,'stan::agrad::dot_product(const std::vector< fvar< T > > &v1, const std::vector< double > &v2)'],['../namespacestan_1_1agrad.html#aba1e86a65c31342dc920bec07eeeac1b',1,'stan::agrad::dot_product(const std::vector< fvar< T > > &v1, const std::vector< fvar< T > > &v2, size_type &length)'],['../namespacestan_1_1agrad.html#ab66e08f88fa7d6a448082ade1153cac3',1,'stan::agrad::dot_product(const std::vector< double > &v1, const std::vector< fvar< T > > &v2, size_type &length)'],['../namespacestan_1_1agrad.html#ae8dea21d83c52cfdd1a0d6114633f2d3',1,'stan::agrad::dot_product(const std::vector< fvar< T > > &v1, const std::vector< double > &v2, size_type &length)'],['../namespacestan_1_1agrad.html#a4011d7bf9c85f3408ed0139436bcc958',1,'stan::agrad::dot_product(const Eigen::Matrix< T1, R1, C1 > &v1, const Eigen::Matrix< T2, R2, C2 > &v2)'],['../namespacestan_1_1agrad.html#ad390f00556d047ae51e5a6a8dd5842a5',1,'stan::agrad::dot_product(const T1 *v1, const T2 *v2, size_t length)'],['../namespacestan_1_1agrad.html#a349c89cb994774063fd7fb561d130ad5',1,'stan::agrad::dot_product(const std::vector< T1 > &v1, const std::vector< T2 > &v2)'],['../namespacestan_1_1math.html#af8d73851895fb151fdf79e55bf33e98e',1,'stan::math::dot_product(const Eigen::Matrix< double, R1, C1 > &v1, const Eigen::Matrix< double, R2, C2 > &v2)'],['../namespacestan_1_1math.html#a58da447df259e9e092e8fd910b338e1f',1,'stan::math::dot_product(const double *v1, const double *v2, size_t length)'],['../namespacestan_1_1math.html#ab7cd93708bf432b3bd3d284958972ede',1,'stan::math::dot_product(const std::vector< double > &v1, const std::vector< double > &v2)']]], + ['dot_5fself',['dot_self',['../namespacestan_1_1agrad.html#a4c1836521010bd6f18b5a58061cc3198',1,'stan::agrad::dot_self(const Eigen::Matrix< fvar< T >, R, C > &v)'],['../namespacestan_1_1agrad.html#a88446fe7bdc500d280a66cd8b58bf475',1,'stan::agrad::dot_self(const Eigen::Matrix< var, R, C > &v)'],['../namespacestan_1_1math.html#a8a6a4ef7c701db7984297d153580c8d4',1,'stan::math::dot_self(const std::vector< double > &x)'],['../namespacestan_1_1math.html#ac81ab85d390fcb594884773a85fac657',1,'stan::math::dot_self(const Eigen::Matrix< double, R, C > &v)']]], + ['double_5fexponential_5fccdf_5flog',['double_exponential_ccdf_log',['../namespacestan_1_1prob.html#a799d82a35ad39823a27340bb57656643',1,'stan::prob']]], + ['double_5fexponential_5fcdf',['double_exponential_cdf',['../namespacestan_1_1prob.html#acb5d3e2870190b33cb60f9165820a07b',1,'stan::prob']]], + ['double_5fexponential_5fcdf_5flog',['double_exponential_cdf_log',['../namespacestan_1_1prob.html#a9f090972ba99ef96684475140e8d7e39',1,'stan::prob']]], + ['double_5fexponential_5flog',['double_exponential_log',['../namespacestan_1_1prob.html#a7621036746361ce33a182006375fcf56',1,'stan::prob::double_exponential_log(const T_y &y, const T_loc &mu, const T_scale &sigma)'],['../namespacestan_1_1prob.html#a2fd04507640d7df4025cdf22bc1940e1',1,'stan::prob::double_exponential_log(const T_y &y, const T_loc &mu, const T_scale &sigma)']]], + ['double_5fexponential_5frng',['double_exponential_rng',['../namespacestan_1_1prob.html#aced8b51bafb8aa39773b8f278559ec09',1,'stan::prob']]], + ['double_5fliteral',['double_literal',['../structstan_1_1gm_1_1double__literal.html#abab56647c315a43fdb62b7b2f1ff3ce2',1,'stan::gm::double_literal::double_literal()'],['../structstan_1_1gm_1_1double__literal.html#a99fefae4612adf8c085e2ce158bba7b3',1,'stan::gm::double_literal::double_literal(double val)']]], + ['double_5fvalues',['double_values',['../classstan_1_1io_1_1dump__reader.html#ac275a400d67c89a01d980fa2ea093ed3',1,'stan::io::dump_reader']]], + ['double_5fvar_5fdecl',['double_var_decl',['../structstan_1_1gm_1_1double__var__decl.html#ac777d487174edeba42d587ff70ebbf38',1,'stan::gm::double_var_decl::double_var_decl()'],['../structstan_1_1gm_1_1double__var__decl.html#a0f4506bf06efcfc3bdec5db3aad51f80',1,'stan::gm::double_var_decl::double_var_decl(range const &range, std::string const &name, std::vector< expression > const &dims)']]], + ['doublevectorview',['DoubleVectorView',['../classstan_1_1_double_vector_view.html#a574803fc6d532f052ffcce6b8cefac58',1,'stan::DoubleVectorView::DoubleVectorView()'],['../classstan_1_1_double_vector_view_3_01true_00_01false_01_4.html#a73f42b82f90108127bcd8e4952328618',1,'stan::DoubleVectorView< true, false >::DoubleVectorView()'],['../classstan_1_1_double_vector_view_3_01true_00_01true_01_4.html#a2ed705a71ac46654258500ecdff057aa',1,'stan::DoubleVectorView< true, true >::DoubleVectorView()']]], + ['dphi_5fdq',['dphi_dq',['../classstan_1_1mcmc_1_1base__hamiltonian.html#a4ac1d9af0360d98a5f5725752d784d26',1,'stan::mcmc::base_hamiltonian::dphi_dq()'],['../classstan_1_1mcmc_1_1dense__e__metric.html#a1172afcf9fdfe07704c6fde165d2c65d',1,'stan::mcmc::dense_e_metric::dphi_dq()'],['../classstan_1_1mcmc_1_1diag__e__metric.html#afdc9e9ca146ec4afc943f1643d1abf5c',1,'stan::mcmc::diag_e_metric::dphi_dq()'],['../classstan_1_1mcmc_1_1unit__e__metric.html#aa309e8c017d1d65eb4c1996ec52375a1',1,'stan::mcmc::unit_e_metric::dphi_dq()']]], + ['dtau_5fdp',['dtau_dp',['../classstan_1_1mcmc_1_1base__hamiltonian.html#a52f1eecd0e71160cbe496af89ecb163e',1,'stan::mcmc::base_hamiltonian::dtau_dp()'],['../classstan_1_1mcmc_1_1dense__e__metric.html#a42125a6efb109bad98202343bd4f16dc',1,'stan::mcmc::dense_e_metric::dtau_dp()'],['../classstan_1_1mcmc_1_1diag__e__metric.html#a02386e255cd255f066f9620d3dbb41f3',1,'stan::mcmc::diag_e_metric::dtau_dp()'],['../classstan_1_1mcmc_1_1unit__e__metric.html#a7f21e1814aac56a2be51674b07f70744',1,'stan::mcmc::unit_e_metric::dtau_dp()']]], + ['dtau_5fdq',['dtau_dq',['../classstan_1_1mcmc_1_1base__hamiltonian.html#af61e96b9766092a3c161a020f440785d',1,'stan::mcmc::base_hamiltonian::dtau_dq()'],['../classstan_1_1mcmc_1_1dense__e__metric.html#acb07208943a4c9a73baa825e5c164b5c',1,'stan::mcmc::dense_e_metric::dtau_dq()'],['../classstan_1_1mcmc_1_1diag__e__metric.html#af03722a421a4b8f8a21fb2f4ae65d98e',1,'stan::mcmc::diag_e_metric::dtau_dq()'],['../classstan_1_1mcmc_1_1unit__e__metric.html#a87728dc744116e7e7b90ca0ffbc3c186',1,'stan::mcmc::unit_e_metric::dtau_dq()']]], + ['dummy_5fprecision',['dummy_precision',['../struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html#ae1b9c4f662ce5e4087ff27b4374116cf',1,'Eigen::NumTraits< stan::agrad::var >']]], + ['dump',['dump',['../classstan_1_1io_1_1dump.html#a05c2de349bdf89ef97e2940dfabe3064',1,'stan::io::dump']]], + ['dump_5flist',['dump_list',['../classstan_1_1io_1_1dump__writer.html#adeb591bec98817e4e2d3c049d672137f',1,'stan::io::dump_writer']]], + ['dump_5fmember_5fvar_5fvisgen',['dump_member_var_visgen',['../structstan_1_1gm_1_1dump__member__var__visgen.html#a4c22ce134acbfefce374269220cfd1d0',1,'stan::gm::dump_member_var_visgen']]], + ['dump_5freader',['dump_reader',['../classstan_1_1io_1_1dump__reader.html#a60f0c45b98358118444362c4a954068f',1,'stan::io::dump_reader::dump_reader()'],['../classstan_1_1io_1_1dump__reader.html#a5a2d82e204b9dc1b0af62fc902a17e37',1,'stan::io::dump_reader::dump_reader(std::istream &in)']]], + ['dump_5fstructure',['dump_structure',['../classstan_1_1io_1_1dump__writer.html#aeffcdc7277269597f6f9e0bbd6110ef8',1,'stan::io::dump_writer']]], + ['dump_5fvar',['dump_var',['../classstan_1_1io_1_1dump__writer.html#a7f58183f74acada75a5dd61a83234502',1,'stan::io::dump_writer']]], + ['dump_5fwriter',['dump_writer',['../classstan_1_1io_1_1dump__writer.html#ad5f0fd7ec8b1fc78d6719cabb6caa0d9',1,'stan::io::dump_writer::dump_writer()'],['../classstan_1_1io_1_1dump__writer.html#a783a19484fcba2bf776369f012a30509',1,'stan::io::dump_writer::dump_writer(std::ostream &out)']]] +]; diff --git a/doc/api/html/search/functions_65.html b/doc/api/html/search/functions_65.html new file mode 100644 index 00000000000..a77debae038 --- /dev/null +++ b/doc/api/html/search/functions_65.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/functions_65.js b/doc/api/html/search/functions_65.js new file mode 100644 index 00000000000..d567ad816d5 --- /dev/null +++ b/doc/api/html/search/functions_65.js @@ -0,0 +1,39 @@ +var searchData= +[ + ['e',['e',['../namespacestan_1_1math.html#a3b650a0131d41167ef4837ecc7d02be5',1,'stan::math']]], + ['effective_5fsample_5fsize',['effective_sample_size',['../classstan_1_1mcmc_1_1chains.html#a37b1a6f5c8aa8cc7ecbce3008c4638b7',1,'stan::mcmc::chains::effective_sample_size(const int index)'],['../classstan_1_1mcmc_1_1chains.html#a02a748353706e1b811639d35021bfe7c',1,'stan::mcmc::chains::effective_sample_size(const std::string &name)']]], + ['eigenvalues_5fsym',['eigenvalues_sym',['../namespacestan_1_1math.html#aa37c65f508af7ad1d0b010aa5c932cbe',1,'stan::math']]], + ['eigenvectors_5fsym',['eigenvectors_sym',['../namespacestan_1_1math.html#a9bd4729756e6ed00a35f1e4531444c13',1,'stan::math']]], + ['elt_5fdivide',['elt_divide',['../namespacestan_1_1math.html#a3c9262da41fbf44fefc9a66141a0759d',1,'stan::math']]], + ['elt_5fmultiply',['elt_multiply',['../namespacestan_1_1math.html#a998e2dce5971bba8c059995797e22ba0',1,'stan::math']]], + ['empty_5fexp_5fvector',['EMPTY_EXP_VECTOR',['../namespacestan_1_1gm.html#a7b75153f298993fbca07d0e128a75771',1,'stan::gm']]], + ['end_5fadaptation_5fwindow',['end_adaptation_window',['../classstan_1_1mcmc_1_1windowed__adaptation.html#ae4b5c1e4712c89086d7f7e2c0463e245',1,'stan::mcmc::windowed_adaptation']]], + ['end_5fupdate_5fp',['end_update_p',['../classstan_1_1mcmc_1_1base__leapfrog.html#a4e043d1858bcbdaa2d84af24fadf0958',1,'stan::mcmc::base_leapfrog::end_update_p()'],['../classstan_1_1mcmc_1_1expl__leapfrog.html#a512ff7eeb698eb2aa276d10c77a25a2b',1,'stan::mcmc::expl_leapfrog::end_update_p()']]], + ['engage_5fadaptation',['engage_adaptation',['../classstan_1_1mcmc_1_1base__adapter.html#a7e1c264d6a6091938373903c813b6a0b',1,'stan::mcmc::base_adapter']]], + ['eol',['EOL',['../namespacestan_1_1gm.html#a24fe8f1f728798f3f4e922ae086c2473',1,'stan::gm']]], + ['eol2',['EOL2',['../namespacestan_1_1gm.html#affc181dd85ce73c82cfbd0cde2321c6b',1,'stan::gm']]], + ['epsilon',['epsilon',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a5080115d295c7180feb653a44bfb0724',1,'std::numeric_limits< stan::agrad::fvar< T > >::epsilon()'],['../struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html#a9d192c3e8fe70d6ea68998877103ff6b',1,'Eigen::NumTraits< stan::agrad::var >::epsilon()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a2f80ac604bf9bb4fd6d42d720264c803',1,'std::numeric_limits< stan::agrad::var >::epsilon()']]], + ['erf',['erf',['../namespacestan_1_1agrad.html#ac4d0f7557b5cea3a8e3a4ca05b5967fa',1,'stan::agrad::erf(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#aa84c9d13118bbeb0d8838e79edb33406',1,'stan::agrad::erf(const stan::agrad::var &a)']]], + ['erfc',['erfc',['../namespacestan_1_1agrad.html#ad43010d593e90d2e8fffe7d314fc78a1',1,'stan::agrad::erfc(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#a5e56afd5e6984624acdf4e6b0aebc251',1,'stan::agrad::erfc(const stan::agrad::var &a)']]], + ['evolve',['evolve',['../classstan_1_1mcmc_1_1base__integrator.html#a9462d1729356a62c9d3264c81bfe2ea8',1,'stan::mcmc::base_integrator::evolve()'],['../classstan_1_1mcmc_1_1base__leapfrog.html#aeaa5e375882c8792817432d5fb83cf1b',1,'stan::mcmc::base_leapfrog::evolve()']]], + ['exists',['exists',['../structstan_1_1gm_1_1variable__map.html#a29d85bf3018b2393c737dbb7d641ad32',1,'stan::gm::variable_map']]], + ['exp',['exp',['../namespacestan_1_1agrad.html#af8dbb5923cb5c5e94b80b21e1263e0e7',1,'stan::agrad::exp(const var &a)'],['../namespacestan_1_1agrad.html#a3953dfa2629b70db4117da64e77a1ba6',1,'stan::agrad::exp(const fvar< T > &x)'],['../namespacestan_1_1math.html#ac38f1fab5fe3e9b45c8c6e78ac3cc749',1,'stan::math::exp()']]], + ['exp2',['exp2',['../namespacestan_1_1agrad.html#a4bb4a54d8488b2d7ca364037c7495cf8',1,'stan::agrad::exp2(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#a3c7b9522635566471bd40c9b994bd8b8',1,'stan::agrad::exp2(const stan::agrad::var &a)'],['../namespacestan_1_1math.html#a0ef734d7c3b8ebd689012295bf826e94',1,'stan::math::exp2()']]], + ['exp_5fmod_5fnormal_5fccdf_5flog',['exp_mod_normal_ccdf_log',['../namespacestan_1_1prob.html#acda3771d153ce0b6699db1bcabc7f994',1,'stan::prob']]], + ['exp_5fmod_5fnormal_5fcdf',['exp_mod_normal_cdf',['../namespacestan_1_1prob.html#a829c8e7a571893d48ee513be108162ac',1,'stan::prob']]], + ['exp_5fmod_5fnormal_5fcdf_5flog',['exp_mod_normal_cdf_log',['../namespacestan_1_1prob.html#a292d6dc1426b3aecc6a6415b0a5d9851',1,'stan::prob']]], + ['exp_5fmod_5fnormal_5flog',['exp_mod_normal_log',['../namespacestan_1_1prob.html#a95e73a8689e52bd28a8bb88f8ef0131b',1,'stan::prob::exp_mod_normal_log(const T_y &y, const T_loc &mu, const T_scale &sigma, const T_inv_scale &lambda)'],['../namespacestan_1_1prob.html#a0c333035ef21be05f6124919256ca7df',1,'stan::prob::exp_mod_normal_log(const T_y &y, const T_loc &mu, const T_scale &sigma, const T_inv_scale &lambda)']]], + ['exp_5fmod_5fnormal_5frng',['exp_mod_normal_rng',['../namespacestan_1_1prob.html#ad44443eca9be898e4a2fc013353a0f3c',1,'stan::prob']]], + ['expl_5fleapfrog',['expl_leapfrog',['../classstan_1_1mcmc_1_1expl__leapfrog.html#a2e93db18fb24e447931497904ae42421',1,'stan::mcmc::expl_leapfrog']]], + ['expm1',['expm1',['../namespacestan_1_1agrad.html#a0ebbcc9d6368c357c1daba678d71beec',1,'stan::agrad::expm1(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#a0d2243d6b4d61aa41c095622e61e7a3e',1,'stan::agrad::expm1(const stan::agrad::var &a)']]], + ['exponential_5fccdf_5flog',['exponential_ccdf_log',['../namespacestan_1_1prob.html#a3ec6b8d579b4f186acb357692219d08e',1,'stan::prob']]], + ['exponential_5fcdf',['exponential_cdf',['../namespacestan_1_1prob.html#a3ed11c9b495e23976817f9c37b1f2af7',1,'stan::prob']]], + ['exponential_5fcdf_5flog',['exponential_cdf_log',['../namespacestan_1_1prob.html#a1f2a5189acae75f0eee599d604e872ab',1,'stan::prob']]], + ['exponential_5flog',['exponential_log',['../namespacestan_1_1prob.html#a6b5f560921b5b09edfe2f55ee909b17e',1,'stan::prob::exponential_log(const T_y &y, const T_inv_scale &beta)'],['../namespacestan_1_1prob.html#ae71620681df03e43f03002634a3c1855',1,'stan::prob::exponential_log(const T_y &y, const T_inv_scale &beta)']]], + ['exponential_5frng',['exponential_rng',['../namespacestan_1_1prob.html#a87460d0e1f55ec9fa5df01d59ef55bc0',1,'stan::prob']]], + ['expr_5ftype',['expr_type',['../structstan_1_1gm_1_1expr__type.html#a1ff96386c9bd4174c1a20d805238a992',1,'stan::gm::expr_type::expr_type()'],['../structstan_1_1gm_1_1expr__type.html#aa5e743430fd9c3891c635c3a23c038b1',1,'stan::gm::expr_type::expr_type(const base_expr_type base_type)'],['../structstan_1_1gm_1_1expr__type.html#a3c5bf10403a3eeb277f097f4c596ab92',1,'stan::gm::expr_type::expr_type(const base_expr_type base_type, size_t num_dims)']]], + ['expression',['expression',['../structstan_1_1gm_1_1expression.html#ab361d5eb3d8bb5fe05e601760781fdce',1,'stan::gm::expression::expression()'],['../structstan_1_1gm_1_1expression.html#a192ef1829feee7075f4d3490d025948c',1,'stan::gm::expression::expression(const expression &e)'],['../structstan_1_1gm_1_1expression.html#a865d7dc525a001c8168f4d171922cd1b',1,'stan::gm::expression::expression(const nil &expr)'],['../structstan_1_1gm_1_1expression.html#a1c8a3f8fb8bbe3d29f8dfe561926a757',1,'stan::gm::expression::expression(const int_literal &expr)'],['../structstan_1_1gm_1_1expression.html#a07b50b75a888a4cc0e04b11697448178',1,'stan::gm::expression::expression(const double_literal &expr)'],['../structstan_1_1gm_1_1expression.html#ab9dfe0c525980b4e33a6f635dd5a5201',1,'stan::gm::expression::expression(const array_literal &expr)'],['../structstan_1_1gm_1_1expression.html#ad6d7cf87fda52077b952285867864bca',1,'stan::gm::expression::expression(const variable &expr)'],['../structstan_1_1gm_1_1expression.html#a54c0b18de4561bf0cbfa866e95516b75',1,'stan::gm::expression::expression(const fun &expr)'],['../structstan_1_1gm_1_1expression.html#a369b4548b7c22bb6e5c9011009ed1689',1,'stan::gm::expression::expression(const index_op &expr)'],['../structstan_1_1gm_1_1expression.html#af033e3bb265198db64040977ef64ff2e',1,'stan::gm::expression::expression(const binary_op &expr)'],['../structstan_1_1gm_1_1expression.html#a51c9181abfa94bdc35c586b15cd65e8f',1,'stan::gm::expression::expression(const unary_op &expr)'],['../structstan_1_1gm_1_1expression.html#a9b2fb897812c6d640bc8eff392afcbb0',1,'stan::gm::expression::expression(const expression_t &expr_)']]], + ['expression_5fgrammar',['expression_grammar',['../structstan_1_1gm_1_1expression__grammar.html#a9a1dcf37552e3ba1eecc18cd4fe88528',1,'stan::gm::expression_grammar']]], + ['expression_5ftype',['expression_type',['../structstan_1_1gm_1_1expression.html#a61fc6d63842363ebf2c501286874a159',1,'stan::gm::expression']]], + ['expression_5fvisgen',['expression_visgen',['../structstan_1_1gm_1_1expression__visgen.html#a216c5cae399487b3a82c0e9005eb063c',1,'stan::gm::expression_visgen']]] +]; diff --git a/doc/api/html/search/functions_66.html b/doc/api/html/search/functions_66.html new file mode 100644 index 00000000000..319a5316a66 --- /dev/null +++ b/doc/api/html/search/functions_66.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/functions_66.js b/doc/api/html/search/functions_66.js new file mode 100644 index 00000000000..32fc2005eb5 --- /dev/null +++ b/doc/api/html/search/functions_66.js @@ -0,0 +1,24 @@ +var searchData= +[ + ['f32',['F32',['../namespacestan_1_1math.html#a582d3c65ec66505882d2d1b740887ae8',1,'stan::math']]], + ['fabs',['fabs',['../namespacestan_1_1agrad.html#a16b719a6d38dc2ccc9eeae9ecbdc6cce',1,'stan::agrad::fabs(const var &a)'],['../namespacestan_1_1agrad.html#ae8cb1fd9f1e72fef6e442c1e566006b9',1,'stan::agrad::fabs(const fvar< T > &x)']]], + ['factor_5fcov_5fmatrix',['factor_cov_matrix',['../namespacestan_1_1prob.html#a12303c67d7416a48497afe8b59913d13',1,'stan::prob']]], + ['falling_5ffactorial',['falling_factorial',['../namespacestan_1_1agrad.html#afd34f7d31e0b8259abb0f61fac5e6fcd',1,'stan::agrad::falling_factorial(const fvar< T > &x, const fvar< T > &n)'],['../namespacestan_1_1agrad.html#a22978d7897d2c1b62f9faa70b69969bb',1,'stan::agrad::falling_factorial(const fvar< T > &x, const double n)'],['../namespacestan_1_1agrad.html#a371442e647e39bf957ec3c9c58454d03',1,'stan::agrad::falling_factorial(const double x, const fvar< T > &n)'],['../namespacestan_1_1agrad.html#a3fe9336533c29b3f48381f31e5b2f34d',1,'stan::agrad::falling_factorial(const var &a, const double &b)'],['../namespacestan_1_1agrad.html#ac91a3d31a2220937ca9052d66c12292b',1,'stan::agrad::falling_factorial(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#a9dee7426dac152938bbdb79b70395106',1,'stan::agrad::falling_factorial(const double &a, const var &b)'],['../namespacestan_1_1math.html#ac2df2a7019f7f68a915b3edab21921a1',1,'stan::math::falling_factorial()']]], + ['fdim',['fdim',['../namespacestan_1_1agrad.html#a3602c7867931bfd2085509c75596ce09',1,'stan::agrad::fdim(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a0be65ebed198f4ea8dbc5b7b1cd7126f',1,'stan::agrad::fdim(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#a1035a00ecb52c988bab0a77698c00f44',1,'stan::agrad::fdim(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a8b11e04370013c6df527524463f9ca74',1,'stan::agrad::fdim(const stan::agrad::var &a, const stan::agrad::var &b)'],['../namespacestan_1_1agrad.html#a3cbb5f05f4a177ad199188f3be030b3e',1,'stan::agrad::fdim(const double &a, const stan::agrad::var &b)'],['../namespacestan_1_1agrad.html#ace71dd32d041a962cb481242ecacab0b',1,'stan::agrad::fdim(const stan::agrad::var &a, const double &b)'],['../namespacestan_1_1math.html#a7d2db622c0f83134b7f3ebd1eec3c1d6',1,'stan::math::fdim()']]], + ['fevals',['fevals',['../classstan_1_1optimization_1_1_model_adaptor.html#a77cd72166cb46c21e16c82f24dd84caf',1,'stan::optimization::ModelAdaptor']]], + ['fill',['fill',['../namespacestan_1_1math.html#a6d362e53d3d40b61e68fdd08dc5eb38b',1,'stan::math::fill(T &x, const S &y)'],['../namespacestan_1_1math.html#a73e791042ed648602eed1754679feff4',1,'stan::math::fill(Eigen::Matrix< T, R, C > &x, const S &y)'],['../namespacestan_1_1math.html#aa7f5d81c4d45f2407096def8810ffe00',1,'stan::math::fill(std::vector< T > &x, const S &y)']]], + ['find_5farg',['find_arg',['../classstan_1_1gm_1_1argument.html#af6212284d6fbf9ee71cdc0563d9bf891',1,'stan::gm::argument::find_arg()'],['../classstan_1_1gm_1_1categorical__argument.html#a24aa833497801c7a66c8ef8c599181ce',1,'stan::gm::categorical_argument::find_arg()'],['../classstan_1_1gm_1_1list__argument.html#a2428856fc920f6d7b4f50c1408bd9c9a',1,'stan::gm::list_argument::find_arg()'],['../classstan_1_1gm_1_1singleton__argument.html#a343a60ef80e0dd3eafe685141a6c3fa8',1,'stan::gm::singleton_argument::find_arg()']]], + ['finite_5fdiff_5fgrad',['finite_diff_grad',['../namespacestan_1_1model.html#a2660b5de2ccd8322d61f077d43289d18',1,'stan::model']]], + ['floor',['floor',['../namespacestan_1_1agrad.html#aa9046719ea83cad7cf7dace32ede78ce',1,'stan::agrad::floor(const var &a)'],['../namespacestan_1_1agrad.html#a266dcbe1451957c1fc2c32b2ae2870f3',1,'stan::agrad::floor(const fvar< T > &x)']]], + ['fma',['fma',['../namespacestan_1_1agrad.html#a5f77bec24d717ec5f98b996f0be4cab4',1,'stan::agrad::fma(const fvar< T1 > &x1, const fvar< T2 > &x2, const fvar< T3 > &x3)'],['../namespacestan_1_1agrad.html#a86c32e534514f635bf641508b30804bb',1,'stan::agrad::fma(const T1 &x1, const fvar< T2 > &x2, const fvar< T3 > &x3)'],['../namespacestan_1_1agrad.html#ab0b96f19fcab78ceea15a6c0a95f8d7d',1,'stan::agrad::fma(const fvar< T1 > &x1, const T2 &x2, const fvar< T3 > &x3)'],['../namespacestan_1_1agrad.html#a663c1cc77abf57686013dbb666bf1ed0',1,'stan::agrad::fma(const fvar< T1 > &x1, const fvar< T2 > &x2, const T3 &x3)'],['../namespacestan_1_1agrad.html#a48956c680d59182a8b63d9e52f2ee2d8',1,'stan::agrad::fma(const T1 &x1, const T2 &x2, const fvar< T3 > &x3)'],['../namespacestan_1_1agrad.html#a2f1cefa8d0717c47703394f7724f86d8',1,'stan::agrad::fma(const fvar< T1 > &x1, const T2 &x2, const T3 &x3)'],['../namespacestan_1_1agrad.html#a1116b96b95098db023b128fa810a3828',1,'stan::agrad::fma(const T1 &x1, const fvar< T2 > &x2, const T3 &x3)'],['../namespacestan_1_1agrad.html#a236c6ba1684b8993ab0ca0d4319ebc15',1,'stan::agrad::fma(const stan::agrad::var &a, const stan::agrad::var &b, const stan::agrad::var &c)'],['../namespacestan_1_1agrad.html#a60d474fe443809433d909f153e326f63',1,'stan::agrad::fma(const stan::agrad::var &a, const stan::agrad::var &b, const double &c)'],['../namespacestan_1_1agrad.html#a4a8f1b59063836f79f91e61aa37e7f24',1,'stan::agrad::fma(const stan::agrad::var &a, const double &b, const stan::agrad::var &c)'],['../namespacestan_1_1agrad.html#afbff5da93a0ea4d23fc83faf70d866c0',1,'stan::agrad::fma(const stan::agrad::var &a, const double &b, const double &c)'],['../namespacestan_1_1agrad.html#a114089c3582069352ec3055927da54b3',1,'stan::agrad::fma(const double &a, const stan::agrad::var &b, const double &c)'],['../namespacestan_1_1agrad.html#a2858845a5ac98800b708c7c42ccaac35',1,'stan::agrad::fma(const double &a, const double &b, const stan::agrad::var &c)'],['../namespacestan_1_1agrad.html#aba5953fcb09dca0142b23409bd6c2766',1,'stan::agrad::fma(const double &a, const stan::agrad::var &b, const stan::agrad::var &c)'],['../namespacestan_1_1math.html#ad8ac3f1f4f177645d84a1d6480f70d96',1,'stan::math::fma()']]], + ['fmax',['fmax',['../namespacestan_1_1agrad.html#a2cf89150207e0d529ffd68744593a2bc',1,'stan::agrad::fmax(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a2cf4931ad43b37de539770207eb9e531',1,'stan::agrad::fmax(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a3f3435dc40e6c86fd4fd495357fbf6a9',1,'stan::agrad::fmax(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#a6bfbbbe6a55f984d587261a0d7213936',1,'stan::agrad::fmax(const stan::agrad::var &a, const stan::agrad::var &b)'],['../namespacestan_1_1agrad.html#ae46ecdd6d3cfa395ddfe12b425ae292a',1,'stan::agrad::fmax(const stan::agrad::var &a, const double &b)'],['../namespacestan_1_1agrad.html#adc9389efdd26ce3ba31890e70620026b',1,'stan::agrad::fmax(const double &a, const stan::agrad::var &b)']]], + ['fmin',['fmin',['../namespacestan_1_1agrad.html#aac4bc7dd96a78ed7ba7a03d268ead9eb',1,'stan::agrad::fmin(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a855b36ac5868d163a4501b77359560ab',1,'stan::agrad::fmin(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a3f0537c9981801bd4c0f04d6580b9385',1,'stan::agrad::fmin(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#af9ad06d7c50e65542e3a83c1d7bf8bcc',1,'stan::agrad::fmin(const stan::agrad::var &a, const stan::agrad::var &b)'],['../namespacestan_1_1agrad.html#a46d5b1c42b386e876cadf5948cdf8256',1,'stan::agrad::fmin(const stan::agrad::var &a, const double &b)'],['../namespacestan_1_1agrad.html#a3afd698a7b861deeca2539c60ce89743',1,'stan::agrad::fmin(const double &a, const stan::agrad::var &b)']]], + ['fmod',['fmod',['../namespacestan_1_1agrad.html#ad475182b7f8b4849bb596e2529838bb6',1,'stan::agrad::fmod(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#af96a5057c49216f1bda2be3a906b93f3',1,'stan::agrad::fmod(const var &a, const double &b)'],['../namespacestan_1_1agrad.html#adf82aceb2eca59a1fa422ea6dcfad435',1,'stan::agrad::fmod(const double &a, const var &b)'],['../namespacestan_1_1agrad.html#a4f6323825127dbf709facbed66f9e788',1,'stan::agrad::fmod(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#ad974df65ff640e773ea32c6061d732f9',1,'stan::agrad::fmod(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#a419533f3ed45a0fd5c77673e0db37915',1,'stan::agrad::fmod(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a48a712f23dfb6e5fe484fdda678bdff9',1,'stan::agrad::fmod(const var &a, const double b)'],['../namespacestan_1_1agrad.html#a478d71eb2e0aeb0df8fdba5c6933a2e6',1,'stan::agrad::fmod(const double a, const var &b)']]], + ['for_5fstatement',['for_statement',['../structstan_1_1gm_1_1for__statement.html#a34c29e8875104ecab7481e308626666e',1,'stan::gm::for_statement::for_statement()'],['../structstan_1_1gm_1_1for__statement.html#acc3bc5c944315988c6b7724b170e77b3',1,'stan::gm::for_statement::for_statement(std::string &variable, range &range, statement &stmt)']]], + ['fpclassify',['fpclassify',['../namespaceboost_1_1math.html#a81d6724493d3ad55a65f18a3e780ddf7',1,'boost::math']]], + ['free_5fall',['free_all',['../classstan_1_1memory_1_1chunk__alloc.html#aa313a74350df2c4dabf4b61d63e4a2a9',1,'stan::memory::chunk_alloc::free_all()'],['../classstan_1_1memory_1_1stack__alloc.html#a02e126e827732287d7f4ede17316089a',1,'stan::memory::stack_alloc::free_all()']]], + ['free_5fmemory',['free_memory',['../classstan_1_1agrad_1_1vari.html#a7f23c079bd16b3183a46bb250ec231ac',1,'stan::agrad::vari::free_memory()'],['../namespacestan_1_1agrad.html#a97c8b13e0b24beeb9a67b880ac34b48c',1,'stan::agrad::free_memory()']]], + ['fun',['fun',['../structstan_1_1gm_1_1fun.html#ac61c1007763bc47ad4bbf7142de638fb',1,'stan::gm::fun::fun()'],['../structstan_1_1gm_1_1fun.html#ae988678efe42ba4871f47c7d30879feb',1,'stan::gm::fun::fun(std::string const &name, std::vector< expression > const &args)']]], + ['function_5fargs',['function_args',['../structstan_1_1gm_1_1generate__init__visgen.html#aa4efef315371d95e3fe70fd042da3705',1,'stan::gm::generate_init_visgen']]], + ['fvar',['fvar',['../structstan_1_1agrad_1_1fvar.html#a289970c8de6526ad9e5e8b323f26c7b5',1,'stan::agrad::fvar::fvar(const TV &val, const TD &deriv)'],['../structstan_1_1agrad_1_1fvar.html#a8aa84b5da53f24362d9b04f6e248d3d9',1,'stan::agrad::fvar::fvar(const TV &val)'],['../structstan_1_1agrad_1_1fvar.html#a18f9e0f72bd845ef6445ca616acbffcd',1,'stan::agrad::fvar::fvar()']]] +]; diff --git a/doc/api/html/search/functions_67.html b/doc/api/html/search/functions_67.html new file mode 100644 index 00000000000..d0ab42a3f73 --- /dev/null +++ b/doc/api/html/search/functions_67.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/functions_67.js b/doc/api/html/search/functions_67.js new file mode 100644 index 00000000000..3d2e44bdcaa --- /dev/null +++ b/doc/api/html/search/functions_67.js @@ -0,0 +1,135 @@ +var searchData= +[ + ['gamma_5fccdf_5flog',['gamma_ccdf_log',['../namespacestan_1_1prob.html#ad7ee96f7433a8a2213f6c00d053fcc98',1,'stan::prob']]], + ['gamma_5fcdf',['gamma_cdf',['../namespacestan_1_1prob.html#a0056f042d18ab321812adae932f7788e',1,'stan::prob']]], + ['gamma_5fcdf_5flog',['gamma_cdf_log',['../namespacestan_1_1prob.html#a74f0bab3925e33a3f4d41ad844172b27',1,'stan::prob']]], + ['gamma_5flog',['gamma_log',['../namespacestan_1_1prob.html#a79b5cdb98cde395af01ceeb3e643788b',1,'stan::prob::gamma_log(const T_y &y, const T_shape &alpha, const T_inv_scale &beta)'],['../namespacestan_1_1prob.html#a762b08e1b594764a002a4503042a1782',1,'stan::prob::gamma_log(const T_y &y, const T_shape &alpha, const T_inv_scale &beta)']]], + ['gamma_5fp',['gamma_p',['../namespacestan_1_1agrad.html#af866ffae5b244d1e6e93bd7ed85452c9',1,'stan::agrad::gamma_p(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a8448454064a4337b6358d60e2d6820ff',1,'stan::agrad::gamma_p(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#a0b6a1689e89d7de041e7bc4e57bcd1c7',1,'stan::agrad::gamma_p(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a998c50e583b44604ded2c213ed565b72',1,'stan::agrad::gamma_p(const stan::agrad::var &a, const stan::agrad::var &b)'],['../namespacestan_1_1agrad.html#a27226e41e865a880d1d5628d7b7aeba5',1,'stan::agrad::gamma_p(const stan::agrad::var &a, const double &b)'],['../namespacestan_1_1agrad.html#a1be9111ad018e40e8388d628e527255d',1,'stan::agrad::gamma_p(const double &a, const stan::agrad::var &b)'],['../namespacestan_1_1math.html#aed411d626d4ae01a76584c454a83673f',1,'stan::math::gamma_p()']]], + ['gamma_5fq',['gamma_q',['../namespacestan_1_1agrad.html#a11135a2ea60dac802a560b6d650df60f',1,'stan::agrad::gamma_q(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a032ac91edd3d7ca00478b937353fd63f',1,'stan::agrad::gamma_q(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#ad8bb1c38eb8ba69d50c8ccb3452719e3',1,'stan::agrad::gamma_q(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#abbfd6400f96010759da0a7f20a0e6991',1,'stan::agrad::gamma_q(const stan::agrad::var &a, const stan::agrad::var &b)'],['../namespacestan_1_1agrad.html#af9f89bf49133aa1ef45e6b3257b84c63',1,'stan::agrad::gamma_q(const stan::agrad::var &a, const double &b)'],['../namespacestan_1_1agrad.html#a5df71efbadd34735e269ce904160ceb9',1,'stan::agrad::gamma_q(const double &a, const stan::agrad::var &b)'],['../namespacestan_1_1math.html#a0830ba049b81bc98ea9fbcf1eb7b4bd6',1,'stan::math::gamma_q()']]], + ['gamma_5frng',['gamma_rng',['../namespacestan_1_1prob.html#ae48a407db43161a34812a8ed250de25c',1,'stan::prob']]], + ['gaussian_5fdlm_5fobs_5flog',['gaussian_dlm_obs_log',['../namespacestan_1_1prob.html#a2788e0ec29af261204d5a071a9ac6abb',1,'stan::prob::gaussian_dlm_obs_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_F, Eigen::Dynamic, Eigen::Dynamic > &F, const Eigen::Matrix< T_G, Eigen::Dynamic, Eigen::Dynamic > &G, const Eigen::Matrix< T_V, Eigen::Dynamic, Eigen::Dynamic > &V, const Eigen::Matrix< T_W, Eigen::Dynamic, Eigen::Dynamic > &W, const Eigen::Matrix< T_m0, Eigen::Dynamic, 1 > &m0, const Eigen::Matrix< T_C0, Eigen::Dynamic, Eigen::Dynamic > &C0)'],['../namespacestan_1_1prob.html#abe03afe63c5a16f0900578622143fe11',1,'stan::prob::gaussian_dlm_obs_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_F, Eigen::Dynamic, Eigen::Dynamic > &F, const Eigen::Matrix< T_G, Eigen::Dynamic, Eigen::Dynamic > &G, const Eigen::Matrix< T_V, Eigen::Dynamic, Eigen::Dynamic > &V, const Eigen::Matrix< T_W, Eigen::Dynamic, Eigen::Dynamic > &W, const Eigen::Matrix< T_m0, Eigen::Dynamic, 1 > &m0, const Eigen::Matrix< T_C0, Eigen::Dynamic, Eigen::Dynamic > &C0)'],['../namespacestan_1_1prob.html#a7205d695b5a1a8358299908ab943c812',1,'stan::prob::gaussian_dlm_obs_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_F, Eigen::Dynamic, Eigen::Dynamic > &F, const Eigen::Matrix< T_G, Eigen::Dynamic, Eigen::Dynamic > &G, const Eigen::Matrix< T_V, Eigen::Dynamic, 1 > &V, const Eigen::Matrix< T_W, Eigen::Dynamic, Eigen::Dynamic > &W, const Eigen::Matrix< T_m0, Eigen::Dynamic, 1 > &m0, const Eigen::Matrix< T_C0, Eigen::Dynamic, Eigen::Dynamic > &C0)'],['../namespacestan_1_1prob.html#ab2f8f2486dabf18bc892a59326aabba6',1,'stan::prob::gaussian_dlm_obs_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_F, Eigen::Dynamic, Eigen::Dynamic > &F, const Eigen::Matrix< T_G, Eigen::Dynamic, Eigen::Dynamic > &G, const Eigen::Matrix< T_V, Eigen::Dynamic, 1 > &V, const Eigen::Matrix< T_W, Eigen::Dynamic, Eigen::Dynamic > &W, const Eigen::Matrix< T_m0, Eigen::Dynamic, 1 > &m0, const Eigen::Matrix< T_C0, Eigen::Dynamic, Eigen::Dynamic > &C0)']]], + ['generate_5fbegin_5ffor_5fdims',['generate_begin_for_dims',['../structstan_1_1gm_1_1validate__var__decl__visgen.html#aff830ed631f54eff36b9a643d14d0223',1,'stan::gm::validate_var_decl_visgen']]], + ['generate_5fbuffer_5floop',['generate_buffer_loop',['../structstan_1_1gm_1_1generate__init__visgen.html#a05aa9ddaf49b4e575bf8c8ddd1c9caa8',1,'stan::gm::generate_init_visgen']]], + ['generate_5fcheck_5fdouble',['generate_check_double',['../structstan_1_1gm_1_1generate__init__visgen.html#adb02e4312d893d26819ea0535e72a395',1,'stan::gm::generate_init_visgen']]], + ['generate_5fcheck_5fint',['generate_check_int',['../structstan_1_1gm_1_1generate__init__visgen.html#ad97c800e8b97eb5e99e15be9e731856e',1,'stan::gm::generate_init_visgen']]], + ['generate_5fclass_5fdecl',['generate_class_decl',['../namespacestan_1_1gm.html#af08d462ee1f0e163d614e9ed03fe53c0',1,'stan::gm']]], + ['generate_5fcomment',['generate_comment',['../namespacestan_1_1gm.html#abba632c440fa0d045a469d12a7cef474',1,'stan::gm']]], + ['generate_5fconstrained_5fparam_5fnames_5fmethod',['generate_constrained_param_names_method',['../namespacestan_1_1gm.html#a5064d8f1632c7557de53ab9af11342f3',1,'stan::gm']]], + ['generate_5fconstructor',['generate_constructor',['../namespacestan_1_1gm.html#aa582396b750dabd6768f4adb30508349',1,'stan::gm']]], + ['generate_5fcpp',['generate_cpp',['../namespacestan_1_1gm.html#a668b578a61c97daacf978986469d1af1',1,'stan::gm']]], + ['generate_5fcsv_5fheader_5farray',['generate_csv_header_array',['../structstan_1_1gm_1_1write__csv__header__visgen.html#a8b2bffaeddce0015c69d6a300ce624de',1,'stan::gm::write_csv_header_visgen']]], + ['generate_5fdeclaration',['generate_declaration',['../structstan_1_1gm_1_1generate__init__visgen.html#a1d115ad0f68566f36cb724b45a67c6a0',1,'stan::gm::generate_init_visgen']]], + ['generate_5fdestructor',['generate_destructor',['../namespacestan_1_1gm.html#a2547842ef250f715e7121eab59f2263c',1,'stan::gm']]], + ['generate_5fdims_5farray',['generate_dims_array',['../structstan_1_1gm_1_1write__dims__visgen.html#ab1da381e42f08f05b968b62ff8ed8df0',1,'stan::gm::write_dims_visgen']]], + ['generate_5fdims_5floop_5ffwd',['generate_dims_loop_fwd',['../structstan_1_1gm_1_1generate__init__visgen.html#a793258abd85f441fd2ca1a15d06e81a3',1,'stan::gm::generate_init_visgen']]], + ['generate_5fdims_5fmethod',['generate_dims_method',['../namespacestan_1_1gm.html#ad25e6e8b2a6244b38ce779887bb4c17f',1,'stan::gm']]], + ['generate_5fend_5fclass_5fdecl',['generate_end_class_decl',['../namespacestan_1_1gm.html#adc6eed04035b3dd32a5e04d227d4cf68',1,'stan::gm']]], + ['generate_5fend_5ffor_5fdims',['generate_end_for_dims',['../structstan_1_1gm_1_1validate__var__decl__visgen.html#a84366f1b6aca2e4e6ce0dffbb65fd523',1,'stan::gm::validate_var_decl_visgen']]], + ['generate_5fend_5fnamespace',['generate_end_namespace',['../namespacestan_1_1gm.html#a9771868cf777556e7ea3dfabbfcccecb',1,'stan::gm']]], + ['generate_5fexpression',['generate_expression',['../namespacestan_1_1gm.html#a6d7cbee2be927cee628328a4e879294a',1,'stan::gm']]], + ['generate_5finclude',['generate_include',['../namespacestan_1_1gm.html#ab12d33faf3ee33c50995679a53496706',1,'stan::gm']]], + ['generate_5fincludes',['generate_includes',['../namespacestan_1_1gm.html#a6a9d6cf24f2051d0804f641525a36f8a',1,'stan::gm']]], + ['generate_5fincrement',['generate_increment',['../structstan_1_1gm_1_1set__param__ranges__visgen.html#a03bf3d67902d7addab06e8348fcad034',1,'stan::gm::set_param_ranges_visgen::generate_increment(std::vector< expression > dims) const '],['../structstan_1_1gm_1_1set__param__ranges__visgen.html#a643b15f7e1aebb50457c29795d98dbba',1,'stan::gm::set_param_ranges_visgen::generate_increment(expression K, std::vector< expression > dims) const '],['../structstan_1_1gm_1_1set__param__ranges__visgen.html#a02f19b449b05e3cc0c265dec2310bbcb',1,'stan::gm::set_param_ranges_visgen::generate_increment(expression M, expression N, std::vector< expression > dims) const ']]], + ['generate_5fincrement_5fi',['generate_increment_i',['../structstan_1_1gm_1_1set__param__ranges__visgen.html#a80cc6bdadbd3cfb04fb75d3674d3d74a',1,'stan::gm::set_param_ranges_visgen']]], + ['generate_5findent',['generate_indent',['../namespacestan_1_1gm.html#a5dfdee531df2c1a3fa39c3c5d9ee5edd',1,'stan::gm']]], + ['generate_5findent_5fnum_5fdims',['generate_indent_num_dims',['../structstan_1_1gm_1_1generate__init__visgen.html#a39fe228dfb30354fddb0bc9c3076fe78',1,'stan::gm::generate_init_visgen']]], + ['generate_5findexed_5fexpr',['generate_indexed_expr',['../namespacestan_1_1gm.html#acd8d56cc6cd4afabfb2b65f2e721be01',1,'stan::gm']]], + ['generate_5finit',['generate_init',['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#a90bfb805ab0dc6b9612a05254d86dbe5',1,'stan::gm::generate_local_var_init_nan_visgen']]], + ['generate_5finit_5fargs',['generate_init_args',['../structstan_1_1gm_1_1local__var__decl__visgen.html#ac57a75ce0bdc9749ed24792421119511',1,'stan::gm::local_var_decl_visgen']]], + ['generate_5finit_5fmethod',['generate_init_method',['../namespacestan_1_1gm.html#a208a651630210246d1cff43ebd3e7d0e',1,'stan::gm']]], + ['generate_5finit_5fvars',['generate_init_vars',['../namespacestan_1_1gm.html#a5e4c218a7d9e607732925c5a266a8f79',1,'stan::gm']]], + ['generate_5finit_5fvars_5fvisgen',['generate_init_vars_visgen',['../structstan_1_1gm_1_1generate__init__vars__visgen.html#a74161c591ed31e81372e5adbf9ae48d3',1,'stan::gm::generate_init_vars_visgen']]], + ['generate_5finit_5fvisgen',['generate_init_visgen',['../structstan_1_1gm_1_1generate__init__visgen.html#a245dc3d8b132021896c5f17d90901dc4',1,'stan::gm::generate_init_visgen']]], + ['generate_5finitialization',['generate_initialization',['../namespacestan_1_1gm.html#a2a09040ccbbc3628b80d4b17278a9d02',1,'stan::gm']]], + ['generate_5finitialize_5farray',['generate_initialize_array',['../structstan_1_1gm_1_1init__local__var__visgen.html#a5779f760dc12ada7971f2d8c009d45f3',1,'stan::gm::init_local_var_visgen::generate_initialize_array()'],['../structstan_1_1gm_1_1write__csv__visgen.html#a2a171b9ce86cbc005df39f73a0914db3',1,'stan::gm::write_csv_visgen::generate_initialize_array()'],['../structstan_1_1gm_1_1write__array__visgen.html#a58d0d5f31f9a489b4cc23f5256f0b56f',1,'stan::gm::write_array_visgen::generate_initialize_array()']]], + ['generate_5finitialize_5farray_5fbounded',['generate_initialize_array_bounded',['../structstan_1_1gm_1_1init__local__var__visgen.html#a7efee35863c753717d4831e51d2f2419',1,'stan::gm::init_local_var_visgen::generate_initialize_array_bounded()'],['../structstan_1_1gm_1_1write__csv__visgen.html#adfabff813b3be4aa0d56dfe894ab1da4',1,'stan::gm::write_csv_visgen::generate_initialize_array_bounded()'],['../structstan_1_1gm_1_1write__array__visgen.html#a149aa727af8bfdd53d2e494eb75c9201',1,'stan::gm::write_array_visgen::generate_initialize_array_bounded()']]], + ['generate_5finitializer',['generate_initializer',['../namespacestan_1_1gm.html#ac3b48b7ab230ddd3d882103245827857',1,'stan::gm']]], + ['generate_5flocal_5fvar_5fdecls',['generate_local_var_decls',['../namespacestan_1_1gm.html#a258ce4643ff39bb93d455f8ae8698a8e',1,'stan::gm']]], + ['generate_5flocal_5fvar_5finit_5fnan',['generate_local_var_init_nan',['../namespacestan_1_1gm.html#a6b6842504d267f2ec759ad7b25e7fac3',1,'stan::gm']]], + ['generate_5flocal_5fvar_5finit_5fnan_5fvisgen',['generate_local_var_init_nan_visgen',['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#a49fb5d91eaa967066d5f5c39a64fa972',1,'stan::gm::generate_local_var_init_nan_visgen']]], + ['generate_5flocal_5fvar_5finits',['generate_local_var_inits',['../namespacestan_1_1gm.html#a890d6d9cd0b21a64327ccf76a9a7e824',1,'stan::gm']]], + ['generate_5flog_5fprob',['generate_log_prob',['../namespacestan_1_1gm.html#a4d93a678fb6ead7a8554de1758f36034',1,'stan::gm']]], + ['generate_5floop_5fvar',['generate_loop_var',['../structstan_1_1gm_1_1validate__var__decl__visgen.html#ad480023da77dc0a07bd592377dde6479',1,'stan::gm::validate_var_decl_visgen']]], + ['generate_5fmain',['generate_main',['../namespacestan_1_1gm.html#a425cf99f39ca9123446a5192eeee83e0',1,'stan::gm']]], + ['generate_5fmember_5fvar_5fdecls',['generate_member_var_decls',['../namespacestan_1_1gm.html#a63d43e75db4c7e7ff2dda2d1036df363',1,'stan::gm']]], + ['generate_5fmember_5fvar_5finits',['generate_member_var_inits',['../namespacestan_1_1gm.html#adc65399d7375f831d8d4d806b62b6293',1,'stan::gm']]], + ['generate_5fmodel_5fname_5fmethod',['generate_model_name_method',['../namespacestan_1_1gm.html#a06761a1392734570a22e5a492141bce8',1,'stan::gm']]], + ['generate_5fname_5fdims',['generate_name_dims',['../structstan_1_1gm_1_1generate__init__visgen.html#aeb5f4afc816218d11e8e76222d766a08',1,'stan::gm::generate_init_visgen']]], + ['generate_5fparam_5fnames',['generate_param_names',['../structstan_1_1gm_1_1write__param__names__visgen.html#a2532b08b83077c52daedb50fc6864f44',1,'stan::gm::write_param_names_visgen']]], + ['generate_5fparam_5fnames_5farray',['generate_param_names_array',['../structstan_1_1gm_1_1constrained__param__names__visgen.html#a797d0bdd948219ece7f55b13d9ab5bff',1,'stan::gm::constrained_param_names_visgen::generate_param_names_array()'],['../structstan_1_1gm_1_1unconstrained__param__names__visgen.html#aa147cbae3df22ef747f281ccb73e8f4f',1,'stan::gm::unconstrained_param_names_visgen::generate_param_names_array()']]], + ['generate_5fparam_5fnames_5fmethod',['generate_param_names_method',['../namespacestan_1_1gm.html#a4c248f99b9df350026ff05c604181358',1,'stan::gm']]], + ['generate_5fprintable',['generate_printable',['../namespacestan_1_1gm.html#ae27bbd9b3b5dbc0f93bbcd9f198a46eb',1,'stan::gm']]], + ['generate_5fprivate_5fdecl',['generate_private_decl',['../namespacestan_1_1gm.html#a8c0b83999d50ab15f1c8503f33a3d47c',1,'stan::gm']]], + ['generate_5fpublic_5fdecl',['generate_public_decl',['../namespacestan_1_1gm.html#a30e9216cd9f5d025bcb3dde6aa0c86b0',1,'stan::gm']]], + ['generate_5fset_5fparam_5franges',['generate_set_param_ranges',['../namespacestan_1_1gm.html#a7ce48f574b608d4ecebac5dc7c3fe21e',1,'stan::gm']]], + ['generate_5fstart_5fnamespace',['generate_start_namespace',['../namespacestan_1_1gm.html#a297a49a54728e0866002eeb4350f46dd',1,'stan::gm']]], + ['generate_5fstatement',['generate_statement',['../namespacestan_1_1gm.html#ad06f7d19c1a004ec456362bd32369cc9',1,'stan::gm']]], + ['generate_5fstatements',['generate_statements',['../namespacestan_1_1gm.html#a09382dd26edd6d5095555b7b1dea2c6d',1,'stan::gm']]], + ['generate_5ftype',['generate_type',['../structstan_1_1gm_1_1local__var__decl__visgen.html#a9eac0e6e7549ecf508f56097b8beaaa5',1,'stan::gm::local_var_decl_visgen::generate_type()'],['../namespacestan_1_1gm.html#a513a251d0b3d2e80bc0b9e32ecfeea0d',1,'stan::gm::generate_type()']]], + ['generate_5ftypedef',['generate_typedef',['../namespacestan_1_1gm.html#a6150f8826fdd1742c1287552966cb6d0',1,'stan::gm']]], + ['generate_5ftypedefs',['generate_typedefs',['../namespacestan_1_1gm.html#a1515682780f226a7001d930fd2c1e1d0',1,'stan::gm']]], + ['generate_5funconstrained_5fparam_5fnames_5fmethod',['generate_unconstrained_param_names_method',['../namespacestan_1_1gm.html#a7caf37b3f443d37d400f9f647a5d4f7b',1,'stan::gm']]], + ['generate_5fusing',['generate_using',['../namespacestan_1_1gm.html#a8669bcb4fa524c442de23cedeb7aaa23',1,'stan::gm']]], + ['generate_5fusing_5fnamespace',['generate_using_namespace',['../namespacestan_1_1gm.html#aab6c7437ec473e5dbe083f86b1b059ae',1,'stan::gm']]], + ['generate_5fusings',['generate_usings',['../namespacestan_1_1gm.html#aa985aaef054c7f1af4a9628ef6a9155d',1,'stan::gm']]], + ['generate_5fvalidate_5fcontext_5fsize',['generate_validate_context_size',['../namespacestan_1_1gm.html#a33b21b6ece1a626d859d7d0e16bc0914',1,'stan::gm']]], + ['generate_5fvalidate_5fpositive',['generate_validate_positive',['../namespacestan_1_1gm.html#ae5e451a20922d72237b17635a04629c6',1,'stan::gm']]], + ['generate_5fvalidate_5ftransformed_5fparams',['generate_validate_transformed_params',['../namespacestan_1_1gm.html#ae40fee02e525b4599929a3898b14493a',1,'stan::gm']]], + ['generate_5fvalidate_5fvar_5fdecl',['generate_validate_var_decl',['../namespacestan_1_1gm.html#a52bae0dc2622d9a571205c83441d1bce',1,'stan::gm']]], + ['generate_5fvalidate_5fvar_5fdecls',['generate_validate_var_decls',['../namespacestan_1_1gm.html#a43655ffe4072e69181e20c6e5e3254cf',1,'stan::gm']]], + ['generate_5fvar_5fresizing',['generate_var_resizing',['../namespacestan_1_1gm.html#a3d65cdc4d78792bed25979830e67b9eb',1,'stan::gm']]], + ['generate_5fversion_5fcomment',['generate_version_comment',['../namespacestan_1_1gm.html#ad46a7bc5909963f3af53bb69c764c415',1,'stan::gm']]], + ['generate_5fvoid_5fstatement',['generate_void_statement',['../structstan_1_1gm_1_1local__var__decl__visgen.html#aa2abf6410868390e087ab93c583a5eaf',1,'stan::gm::local_var_decl_visgen::generate_void_statement()'],['../namespacestan_1_1gm.html#aa1deb42499e1aeaf64a3f66f7e08220e',1,'stan::gm::generate_void_statement()']]], + ['generate_5fwrite_5farray_5fmethod',['generate_write_array_method',['../namespacestan_1_1gm.html#a56f6bed9b4ff736ba8282d9cb81ff0c2',1,'stan::gm']]], + ['generate_5fwrite_5fcsv_5fheader_5fmethod',['generate_write_csv_header_method',['../namespacestan_1_1gm.html#a175fe5ebc2de7986e91d335a0f973642',1,'stan::gm']]], + ['generate_5fwrite_5fcsv_5fmethod',['generate_write_csv_method',['../namespacestan_1_1gm.html#a8576715fcf1c68be750ae6f9b5928923',1,'stan::gm']]], + ['generate_5fwrite_5floop',['generate_write_loop',['../structstan_1_1gm_1_1generate__init__visgen.html#a6a491ca19f67492859f69414e65c2859',1,'stan::gm::generate_init_visgen']]], + ['get',['get',['../structstan_1_1gm_1_1variable__map.html#af16b9b2424cf92cd3804908986d53ff1',1,'stan::gm::variable_map::get()'],['../namespacestan.html#a2e926e5518c0c2f289f79d23010815d3',1,'stan::get(const T &x, size_t n)'],['../namespacestan.html#a431bd201f09a215cccb16cda10a1e840',1,'stan::get(const std::vector< T > &x, size_t n)'],['../namespacestan.html#aa0b8055d979ee18e43048b99eccb5640',1,'stan::get(const Eigen::Matrix< T, R, C > &m, size_t n)']]], + ['get_5fbase1',['get_base1',['../namespacestan_1_1math.html#a7535c86e2c9ee9d5391a8cc63187317e',1,'stan::math::get_base1(const std::vector< T > &x, size_t i, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#aca7c84b936da0d3422507927cf9a68cc',1,'stan::math::get_base1(const std::vector< std::vector< T > > &x, size_t i1, size_t i2, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#a714e39ba9fcbbd90c787a51d511c9af1',1,'stan::math::get_base1(const std::vector< std::vector< std::vector< T > > > &x, size_t i1, size_t i2, size_t i3, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#aa23b355397df347249da513307fd6667',1,'stan::math::get_base1(const std::vector< std::vector< std::vector< std::vector< T > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#a25c1fac0445beea55c521c94f360e13e',1,'stan::math::get_base1(const std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, size_t i5, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#a20a82151947fc8816c5ce5b7bc6d8abd',1,'stan::math::get_base1(const std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, size_t i5, size_t i6, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#a6fb72caff19c8ce19dc6e3c25c79f7b8',1,'stan::math::get_base1(const std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, size_t i5, size_t i6, size_t i7, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#accc97dd76490d575638ebb22da233a53',1,'stan::math::get_base1(const std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, size_t i5, size_t i6, size_t i7, size_t i8, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#ae72208605f731144cab862feecb456a2',1,'stan::math::get_base1(const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &x, size_t m, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#a51091bb67549e42c241f4e08e7d291d6',1,'stan::math::get_base1(const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &x, size_t m, size_t n, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#ab0dbeed50ff3f8630ea3cd54f9ecb804',1,'stan::math::get_base1(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, size_t m, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#abf9dcd5236495d3f581b31dd05b9a227',1,'stan::math::get_base1(const Eigen::Matrix< T, 1, Eigen::Dynamic > &x, size_t n, const char *error_msg, size_t idx)']]], + ['get_5fbase1_5flhs',['get_base1_lhs',['../namespacestan_1_1math.html#ac54b1427fd9d0765f0200dc9caa830f9',1,'stan::math::get_base1_lhs(std::vector< T > &x, size_t i, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#a4d5711f99869d05a6263218f3256e582',1,'stan::math::get_base1_lhs(std::vector< std::vector< T > > &x, size_t i1, size_t i2, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#a37f3ceaa6197904ef662f1edc8245e1a',1,'stan::math::get_base1_lhs(std::vector< std::vector< std::vector< T > > > &x, size_t i1, size_t i2, size_t i3, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#a3132eb36eaf861cfbd119b38e0a85a15',1,'stan::math::get_base1_lhs(std::vector< std::vector< std::vector< std::vector< T > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#afbcc061003aabcaf675f4415adc80c0a',1,'stan::math::get_base1_lhs(std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, size_t i5, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#a1958245532761be08be7ac9bc781f3a7',1,'stan::math::get_base1_lhs(std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, size_t i5, size_t i6, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#aedc7fc712ebe439bec1892c8f69447cd',1,'stan::math::get_base1_lhs(std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, size_t i5, size_t i6, size_t i7, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#a64467731d9abfaf97ea8d541d528142c',1,'stan::math::get_base1_lhs(std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< std::vector< T > > > > > > > > &x, size_t i1, size_t i2, size_t i3, size_t i4, size_t i5, size_t i6, size_t i7, size_t i8, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#abbdd7246170c1c0cade6c7be73f436e0',1,'stan::math::get_base1_lhs(Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &x, size_t m, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#af8cb7e6e670cddcdf5527ec92fa3ff37',1,'stan::math::get_base1_lhs(Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &x, size_t m, size_t n, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#adffeab694f7588c92dc97b6736e5be7b',1,'stan::math::get_base1_lhs(Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, size_t m, const char *error_msg, size_t idx)'],['../namespacestan_1_1math.html#a6133d90708e16760b6394c6ca6a305ff',1,'stan::math::get_base1_lhs(Eigen::Matrix< T, 1, Eigen::Dynamic > &x, size_t n, const char *error_msg, size_t idx)']]], + ['get_5fbase_5ftype',['get_base_type',['../structstan_1_1gm_1_1variable__map.html#aca8dd3f11c916e9f3e960da5a54fabcd',1,'stan::gm::variable_map']]], + ['get_5fcode_5fstring',['get_code_string',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#adc021871519f45628bdd50446e3d4075',1,'stan::optimization::BFGSMinimizer']]], + ['get_5fcovar_5fadaptation',['get_covar_adaptation',['../classstan_1_1mcmc_1_1stepsize__covar__adapter.html#a78b53fec4bef5a7ba2e7531f416ba3a1',1,'stan::mcmc::stepsize_covar_adapter']]], + ['get_5fcurrent_5fstepsize',['get_current_stepsize',['../classstan_1_1mcmc_1_1base__hmc.html#a6e9333e00268e9ea5e0145a17bfbe4d2',1,'stan::mcmc::base_hmc']]], + ['get_5fdelta',['get_delta',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#a9b009709850567a0c8859c6184b79099',1,'stan::mcmc::stepsize_adaptation']]], + ['get_5fgamma',['get_gamma',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#af73d1fae6249bec73f9a1b5d9993ff2f',1,'stan::mcmc::stepsize_adaptation']]], + ['get_5fkappa',['get_kappa',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#aef3ef49e43ab17cd2d8c10a101603971',1,'stan::mcmc::stepsize_adaptation']]], + ['get_5fl',['get_L',['../classstan_1_1mcmc_1_1base__static__hmc.html#a0f7bee31ab516375f70c8b1857ecc095',1,'stan::mcmc::base_static_hmc']]], + ['get_5fmax_5fdelta',['get_max_delta',['../classstan_1_1mcmc_1_1base__nuts.html#a29db7ce203e322ba14d06fe99d05806e',1,'stan::mcmc::base_nuts']]], + ['get_5fmax_5fdepth',['get_max_depth',['../classstan_1_1mcmc_1_1base__nuts.html#aef3fb41adbe18bbd10f31be06075d0f8',1,'stan::mcmc::base_nuts']]], + ['get_5fmu',['get_mu',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#ad39004ce73f47a9a08ad523333a142dc',1,'stan::mcmc::stepsize_adaptation']]], + ['get_5fnominal_5fstepsize',['get_nominal_stepsize',['../classstan_1_1mcmc_1_1base__hmc.html#a33aa7f0e7d733ca915e5bb4b77117fd1',1,'stan::mcmc::base_hmc']]], + ['get_5fnum_5fdims',['get_num_dims',['../structstan_1_1gm_1_1variable__map.html#a0aacb56aae39f1ee43126951336876ee',1,'stan::gm::variable_map']]], + ['get_5forigin',['get_origin',['../structstan_1_1gm_1_1variable__map.html#a489c5362720bcea3520b36b8fbf139c3',1,'stan::gm::variable_map']]], + ['get_5fparam_5fnames',['get_param_names',['../classstan_1_1mcmc_1_1ps__point.html#a3e1b059004a82c80200402ae840df17c',1,'stan::mcmc::ps_point']]], + ['get_5fparams',['get_params',['../classstan_1_1mcmc_1_1ps__point.html#a90335d3f5df5ffd758b7282ac55e2239',1,'stan::mcmc::ps_point']]], + ['get_5fresult_5ftype',['get_result_type',['../classstan_1_1gm_1_1function__signatures.html#ae14f96665097dc1c77f89750e73e8af9',1,'stan::gm::function_signatures']]], + ['get_5fsample_5fparam_5fnames',['get_sample_param_names',['../classstan_1_1mcmc_1_1sample.html#af9d0b064b26b744a8a3416726ed64ad0',1,'stan::mcmc::sample']]], + ['get_5fsample_5fparams',['get_sample_params',['../classstan_1_1mcmc_1_1sample.html#a0a0f69f242625c8f7d033cefae3b066c',1,'stan::mcmc::sample']]], + ['get_5fsampler_5fdiagnostic_5fnames',['get_sampler_diagnostic_names',['../classstan_1_1mcmc_1_1base__mcmc.html#a439ab0edaa1e186e5c0639dd30a367c7',1,'stan::mcmc::base_mcmc::get_sampler_diagnostic_names()'],['../classstan_1_1mcmc_1_1base__hmc.html#ab03fa8ffe91879f8bd8b364641c4de5a',1,'stan::mcmc::base_hmc::get_sampler_diagnostic_names()']]], + ['get_5fsampler_5fdiagnostics',['get_sampler_diagnostics',['../classstan_1_1mcmc_1_1base__mcmc.html#a0d3f7f318891d813a1b3f78a194aa060',1,'stan::mcmc::base_mcmc::get_sampler_diagnostics()'],['../classstan_1_1mcmc_1_1base__hmc.html#abcf75357ef756a2c74f9855386b3be47',1,'stan::mcmc::base_hmc::get_sampler_diagnostics()']]], + ['get_5fsampler_5fparam_5fnames',['get_sampler_param_names',['../classstan_1_1mcmc_1_1base__mcmc.html#aca923f3231a9487745a999d95b5923ce',1,'stan::mcmc::base_mcmc::get_sampler_param_names()'],['../classstan_1_1mcmc_1_1base__nuts.html#a1f1085f2b4bd6b4e94fbce9f43243a6c',1,'stan::mcmc::base_nuts::get_sampler_param_names()'],['../classstan_1_1mcmc_1_1base__static__hmc.html#a101e66c9b73da1301847477ace7caebb',1,'stan::mcmc::base_static_hmc::get_sampler_param_names()']]], + ['get_5fsampler_5fparams',['get_sampler_params',['../classstan_1_1mcmc_1_1base__mcmc.html#af599911f5d38fbf91c4a475b0d27c1b6',1,'stan::mcmc::base_mcmc::get_sampler_params()'],['../classstan_1_1mcmc_1_1base__nuts.html#a7b804d04e40e371e8d543e78a6b1fc12',1,'stan::mcmc::base_nuts::get_sampler_params()'],['../classstan_1_1mcmc_1_1base__static__hmc.html#a743d29144c3d7f6159995f71524abff9',1,'stan::mcmc::base_static_hmc::get_sampler_params()']]], + ['get_5fstepsize_5fadaptation',['get_stepsize_adaptation',['../classstan_1_1mcmc_1_1stepsize__adapter.html#afc1a82938cba4951ea63cc983ae77844',1,'stan::mcmc::stepsize_adapter::get_stepsize_adaptation()'],['../classstan_1_1mcmc_1_1stepsize__covar__adapter.html#a84390e298b70ce828d8e04ebdad63d56',1,'stan::mcmc::stepsize_covar_adapter::get_stepsize_adaptation()'],['../classstan_1_1mcmc_1_1stepsize__var__adapter.html#af38b99277aa2cf9af8bbf69c1e683c0a',1,'stan::mcmc::stepsize_var_adapter::get_stepsize_adaptation()']]], + ['get_5fstepsize_5fjitter',['get_stepsize_jitter',['../classstan_1_1mcmc_1_1base__hmc.html#a17660d32d37d39df87f49ed0e8f97262',1,'stan::mcmc::base_hmc']]], + ['get_5ft',['get_T',['../classstan_1_1mcmc_1_1base__static__hmc.html#a2c983e383003ed37eccb11bcaef22179',1,'stan::mcmc::base_static_hmc']]], + ['get_5ft0',['get_t0',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#a12f4547328cdc7a469d3369568954d14',1,'stan::mcmc::stepsize_adaptation']]], + ['get_5fvar_5fadaptation',['get_var_adaptation',['../classstan_1_1mcmc_1_1stepsize__var__adapter.html#a63d086dbff4db90650091784bd48e54a',1,'stan::mcmc::stepsize_var_adapter']]], + ['grad',['grad',['../classstan_1_1agrad_1_1var.html#adafe2731ffff76ed74a84299633d70ac',1,'stan::agrad::var::grad(std::vector< var > &x, std::vector< double > &g)'],['../classstan_1_1agrad_1_1var.html#a14d0349fa31df6ae544165b40cd01d94',1,'stan::agrad::var::grad()'],['../classstan_1_1agrad_1_1var.html#adafe2731ffff76ed74a84299633d70ac',1,'stan::agrad::var::grad(std::vector< var > &x, std::vector< double > &g)'],['../classstan_1_1agrad_1_1var.html#a14d0349fa31df6ae544165b40cd01d94',1,'stan::agrad::var::grad()'],['../classstan_1_1optimization_1_1_b_f_g_s_line_search.html#a800198f26824c242a030d7ab838b0a2c',1,'stan::optimization::BFGSLineSearch::grad()'],['../classstan_1_1optimization_1_1_nesterov_gradient.html#a0b4971e472f7ab5708535a9a87d8fc9c',1,'stan::optimization::NesterovGradient::grad()'],['../namespacestan_1_1agrad.html#a1fb22c831a12e8fea76ef7ee0bd32cb3',1,'stan::agrad::grad(chainable *vi)'],['../namespacestan_1_1agrad.html#aab9a3ff45fadad49e4797f3687ab7e8a',1,'stan::agrad::grad(var &v, Eigen::Matrix< var, Eigen::Dynamic, 1 > &x, Eigen::VectorXd &g)'],['../namespacestan_1_1agrad.html#a1fb22c831a12e8fea76ef7ee0bd32cb3',1,'stan::agrad::grad(chainable *vi)']]], + ['grad2f1',['grad2F1',['../namespacestan_1_1math.html#a71aed6cfebd1e7a926130982018cfefe',1,'stan::math']]], + ['grad_5fevals',['grad_evals',['../classstan_1_1optimization_1_1_b_f_g_s_line_search.html#aa39e8aa1b28762bd358986c11c67838a',1,'stan::optimization::BFGSLineSearch']]], + ['grad_5fhess_5flog_5fprob',['grad_hess_log_prob',['../namespacestan_1_1model.html#ad83f35a2e6e0b78d505d8128dee49588',1,'stan::model']]], + ['grad_5fnorm',['grad_norm',['../classstan_1_1optimization_1_1_b_f_g_s_line_search.html#ae9f74939356da68cdb2763647fe5f1b7',1,'stan::optimization::BFGSLineSearch']]], + ['grad_5ftr_5fmat_5ftimes_5fhessian',['grad_tr_mat_times_hessian',['../namespacestan_1_1agrad.html#acba3577a92618529775046335dc015ac',1,'stan::agrad']]], + ['gradf32',['gradF32',['../namespacestan_1_1math.html#a8db199c237a3b502dccc197db9dfcd7d',1,'stan::math']]], + ['gradient',['gradient',['../namespacestan_1_1agrad.html#a3a0d7a65cb491249a40ce309b4c74433',1,'stan::agrad::gradient(const F &f, const Eigen::Matrix< double, Eigen::Dynamic, 1 > &x, double &fx, Eigen::Matrix< double, Eigen::Dynamic, 1 > &grad_fx)'],['../namespacestan_1_1agrad.html#a90556a6034444a74ac3859ab41d79334',1,'stan::agrad::gradient(const F &f, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, T &fx, Eigen::Matrix< T, Eigen::Dynamic, 1 > &grad_fx)']]], + ['gradient_5fdot_5fvector',['gradient_dot_vector',['../namespacestan_1_1agrad.html#a193936962d2fceadcf578dd09b127776',1,'stan::agrad']]], + ['gradincbeta',['gradIncBeta',['../namespacestan_1_1math.html#a6e61bf2a2523eac620649be1b836f6af',1,'stan::math']]], + ['gradregincbeta',['gradRegIncBeta',['../namespacestan_1_1math.html#a748e297c3c711bde9cd125cdc873dc8d',1,'stan::math']]], + ['gradregincgamma',['gradRegIncGamma',['../namespacestan_1_1math.html#a55877c24977357ef441acc0b37f6b337',1,'stan::math']]], + ['gumbel_5fccdf_5flog',['gumbel_ccdf_log',['../namespacestan_1_1prob.html#a7031408cb549ef6e62d05a0e23050913',1,'stan::prob']]], + ['gumbel_5fcdf',['gumbel_cdf',['../namespacestan_1_1prob.html#a51c9e75ef3d9f0aa113b1dff27bfd5f8',1,'stan::prob']]], + ['gumbel_5fcdf_5flog',['gumbel_cdf_log',['../namespacestan_1_1prob.html#af3a4abf9379ede54947a4a46c520a286',1,'stan::prob']]], + ['gumbel_5flog',['gumbel_log',['../namespacestan_1_1prob.html#ad56fe89a003692852a43ed83e9020ade',1,'stan::prob::gumbel_log(const T_y &y, const T_loc &mu, const T_scale &beta)'],['../namespacestan_1_1prob.html#a09ae16a393bdb54599b3e0794e626df0',1,'stan::prob::gumbel_log(const T_y &y, const T_loc &mu, const T_scale &beta)']]], + ['gumbel_5frng',['gumbel_rng',['../namespacestan_1_1prob.html#a717c41a1a31ff84f523df17a4e894c23',1,'stan::prob']]] +]; diff --git a/doc/api/html/search/functions_68.html b/doc/api/html/search/functions_68.html new file mode 100644 index 00000000000..66b85be313c --- /dev/null +++ b/doc/api/html/search/functions_68.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/functions_68.js b/doc/api/html/search/functions_68.js new file mode 100644 index 00000000000..45436599a43 --- /dev/null +++ b/doc/api/html/search/functions_68.js @@ -0,0 +1,22 @@ +var searchData= +[ + ['h',['H',['../classstan_1_1mcmc_1_1base__hamiltonian.html#abb069ceb36c44afad1ba03f97e8a097d',1,'stan::mcmc::base_hamiltonian']]], + ['has_5fflag',['has_flag',['../classstan_1_1io_1_1cmd__line.html#a2d24eb7b0df0df0f9237e722c9935344',1,'stan::io::cmd_line']]], + ['has_5fhigh',['has_high',['../structstan_1_1gm_1_1range.html#a4fd2933ba84accb4d4df4fa7af5570b8',1,'stan::gm::range']]], + ['has_5fkey',['has_key',['../classstan_1_1io_1_1cmd__line.html#a6d18234501f15e832c610807519091bc',1,'stan::io::cmd_line']]], + ['has_5flb',['has_lb',['../namespacestan_1_1gm.html#a5f8f794036a1282d39160c8005350fb6',1,'stan::gm']]], + ['has_5flow',['has_low',['../structstan_1_1gm_1_1range.html#a5602af4e9ea366a5c256798a372f7d26',1,'stan::gm::range']]], + ['has_5flub',['has_lub',['../namespacestan_1_1gm.html#a354abd99f7fd052b3be9e590a90f51af',1,'stan::gm']]], + ['has_5fnon_5fparam_5fvar',['has_non_param_var',['../namespacestan_1_1gm.html#a5cd24fa3880414fae68b9f140341781c',1,'stan::gm']]], + ['has_5frng_5fsuffix',['has_rng_suffix',['../namespacestan_1_1gm.html#adbc7bd18dc8464af8d3deee3dc1119de',1,'stan::gm']]], + ['has_5fub',['has_ub',['../namespacestan_1_1gm.html#af96a2f3903f1feab3fce868fefee250b',1,'stan::gm']]], + ['has_5fvar',['has_var',['../namespacestan_1_1gm.html#a2fd9d0472225916eae17d19fde00fe30',1,'stan::gm']]], + ['head',['head',['../namespacestan_1_1math.html#a140b54b11069aed039f67c6dd172256b',1,'stan::math::head(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v, size_t n)'],['../namespacestan_1_1math.html#a4d7964d83597ea54cd7ba63bee50409f',1,'stan::math::head(const Eigen::Matrix< T, 1, Eigen::Dynamic > &rv, size_t n)'],['../namespacestan_1_1math.html#a5e746ba14994b318a0a192a97a0a28db',1,'stan::math::head(const std::vector< T > &sv, size_t n)']]], + ['help_5fprinted',['help_printed',['../classstan_1_1gm_1_1argument__parser.html#a97217b4fce24caa4f13f01366ba7eede',1,'stan::gm::argument_parser']]], + ['hessian',['hessian',['../namespacestan_1_1agrad.html#a757135302068c250c2379b0c13a28e2e',1,'stan::agrad::hessian(const F &f, const Eigen::Matrix< double, Eigen::Dynamic, 1 > &x, double &fx, Eigen::Matrix< double, Eigen::Dynamic, 1 > &grad, Eigen::Matrix< double, Eigen::Dynamic, Eigen::Dynamic > &H)'],['../namespacestan_1_1agrad.html#ae0c1250f021e0a792f89308da1798c52',1,'stan::agrad::hessian(const F &f, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, T &fx, Eigen::Matrix< T, Eigen::Dynamic, 1 > &grad, Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &H)'],['../namespacestan_1_1agrad.html#a7bb9b2db82474a079e4fe1cfe980f41b',1,'stan::agrad::hessian(const F &f, const std::vector< double > &x, const std::vector< double > &v, std::vector< double > &Hv)']]], + ['hessian_5ftimes_5fvector',['hessian_times_vector',['../namespacestan_1_1agrad.html#a65e3ff9debccf35476fd084b965c3eb1',1,'stan::agrad::hessian_times_vector(const F &f, const Eigen::Matrix< double, Eigen::Dynamic, 1 > &x, const Eigen::Matrix< double, Eigen::Dynamic, 1 > &v, double &fx, Eigen::Matrix< double, Eigen::Dynamic, 1 > &Hv)'],['../namespacestan_1_1agrad.html#a410d4227fbb881a70b80ae5d110dafe9',1,'stan::agrad::hessian_times_vector(const F &f, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v, T &fx, Eigen::Matrix< T, Eigen::Dynamic, 1 > &Hv)']]], + ['highest',['highest',['../struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html#a91c90fce61fb31c3a9bc079ff8a07d35',1,'Eigen::NumTraits< stan::agrad::var >']]], + ['hypergeometric_5flog',['hypergeometric_log',['../namespacestan_1_1prob.html#a66e4f57cee9af34a961de0ff06cbd778',1,'stan::prob::hypergeometric_log(const T_n &n, const T_N &N, const T_a &a, const T_b &b)'],['../namespacestan_1_1prob.html#aa8045ba7d2d74aa5142128b020ef91f9',1,'stan::prob::hypergeometric_log(const T_n &n, const T_N &N, const T_a &a, const T_b &b)']]], + ['hypergeometric_5frng',['hypergeometric_rng',['../namespacestan_1_1prob.html#ac1f5eb0ed8be3298f817d5f5b976144d',1,'stan::prob']]], + ['hypot',['hypot',['../namespacestan_1_1agrad.html#abefe7efd440d029f4ae53c723c1835cf',1,'stan::agrad::hypot(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#afaa49a34b4a0d6977cacc4eed74aa276',1,'stan::agrad::hypot(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#a8ec2045c8ca3af2bc0f411819e287108',1,'stan::agrad::hypot(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#aca9ecbd3c8db717865343fe7dc363490',1,'stan::agrad::hypot(const stan::agrad::var &a, const stan::agrad::var &b)'],['../namespacestan_1_1agrad.html#a4671da443c63a084e9511fc3dad810c6',1,'stan::agrad::hypot(const stan::agrad::var &a, const double &b)'],['../namespacestan_1_1agrad.html#a6b4379c4eaaa6367836430274d82a06b',1,'stan::agrad::hypot(const double &a, const stan::agrad::var &b)']]] +]; diff --git a/doc/api/html/search/functions_69.html b/doc/api/html/search/functions_69.html new file mode 100644 index 00000000000..e2041976c97 --- /dev/null +++ b/doc/api/html/search/functions_69.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/functions_69.js b/doc/api/html/search/functions_69.js new file mode 100644 index 00000000000..b5b00b2c896 --- /dev/null +++ b/doc/api/html/search/functions_69.js @@ -0,0 +1,81 @@ +var searchData= +[ + ['ibeta',['ibeta',['../namespacestan_1_1agrad.html#a54d4bc3e46a75315a2c098c3d4e0b3f4',1,'stan::agrad::ibeta()'],['../namespacestan_1_1math.html#af7b430ac57e75ba2d55843cd868506e1',1,'stan::math::ibeta()']]], + ['identity_5fconstrain',['identity_constrain',['../namespacestan_1_1prob.html#ad85151d68bb1f8edbdc64960cf14a86e',1,'stan::prob::identity_constrain(T x)'],['../namespacestan_1_1prob.html#a2efcd423525f2b20c28888283eb41079',1,'stan::prob::identity_constrain(const T x, T &)']]], + ['identity_5ffree',['identity_free',['../namespacestan_1_1prob.html#ae9e2475641a356dc2b0b103f5152eb84',1,'stan::prob']]], + ['if_5felse',['if_else',['../namespacestan_1_1agrad.html#a2a018c9770257f38d93125db6c7eda5f',1,'stan::agrad::if_else(bool c, const var &y_true, const var &y_false)'],['../namespacestan_1_1agrad.html#a2b19777661eada4e32b7d84b64c9f4db',1,'stan::agrad::if_else(bool c, double y_true, const var &y_false)'],['../namespacestan_1_1agrad.html#a86ce2dc25f73176ea45b300a9cfd63eb',1,'stan::agrad::if_else(bool c, const var &y_true, const double y_false)'],['../namespacestan_1_1math.html#aa732732442d65936275d718b7286cb51',1,'stan::math::if_else()']]], + ['increment_5flog_5fprob_5fstatement',['increment_log_prob_statement',['../structstan_1_1gm_1_1increment__log__prob__statement.html#a7cac1e4c4bf79fce11fc836ab1ea0cc1',1,'stan::gm::increment_log_prob_statement::increment_log_prob_statement()'],['../structstan_1_1gm_1_1increment__log__prob__statement.html#ab828f581d60e699e3fa1ea4f82fa24eb',1,'stan::gm::increment_log_prob_statement::increment_log_prob_statement(const expression &log_prob)']]], + ['indent',['INDENT',['../namespacestan_1_1gm.html#a0c2dcd808a0d9ba32a552d5da9449dad',1,'stan::gm']]], + ['indent2',['INDENT2',['../namespacestan_1_1gm.html#ac233ed8139ded7c35ee0583d7840914a',1,'stan::gm']]], + ['indent3',['INDENT3',['../namespacestan_1_1gm.html#a6ff34cca044609d9dd669dcc9c992c60',1,'stan::gm']]], + ['index',['index',['../classstan_1_1mcmc_1_1chains.html#ab87d44365c2f2a83afc9351020bfc3ed',1,'stan::mcmc::chains']]], + ['index_5fop',['index_op',['../structstan_1_1gm_1_1index__op.html#a862956865d36615fa28089dea1d1217d',1,'stan::gm::index_op::index_op()'],['../structstan_1_1gm_1_1index__op.html#a12f574d13a3b1d3d34c536cb8d7d6aa2',1,'stan::gm::index_op::index_op(const expression &expr, const std::vector< std::vector< expression > > &dimss)']]], + ['infer_5ftype',['infer_type',['../structstan_1_1gm_1_1fun.html#a20f538c7866f306aa80274fddebf727d',1,'stan::gm::fun::infer_type()'],['../structstan_1_1gm_1_1index__op.html#a529d7cb01f9d404a881fda27c82dc460',1,'stan::gm::index_op::infer_type()']]], + ['infer_5ftype_5findexing',['infer_type_indexing',['../namespacestan_1_1gm.html#a17574edb8e226bfd71f69da1d4f97168',1,'stan::gm::infer_type_indexing(const base_expr_type &expr_base_type, size_t num_expr_dims, size_t num_index_dims)'],['../namespacestan_1_1gm.html#a46f979229875f1d6d427dbbe87fa8a59',1,'stan::gm::infer_type_indexing(const expression &expr, size_t num_index_dims)']]], + ['infinity',['infinity',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#ad148a929c21b1747b25cecd70cf212cf',1,'std::numeric_limits< stan::agrad::fvar< T > >::infinity()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#ad4b150d32c6d506c86f20072a9bcfa57',1,'std::numeric_limits< stan::agrad::var >::infinity()']]], + ['init',['init',['../classstan_1_1mcmc_1_1base__hamiltonian.html#a43a6071f6c711fc9e2980515c3223d10',1,'stan::mcmc::base_hamiltonian']]], + ['init_5fadapt',['init_adapt',['../namespacestan_1_1gm.html#ab49a5fee3bf2cacd63f0ce7e252a6a93',1,'stan::gm::init_adapt(Sampler *sampler, const double delta, const double gamma, const double kappa, const double t0, const Eigen::VectorXd &cont_params)'],['../namespacestan_1_1gm.html#ae3483b7eb32848c5bee0ee48b431f46e',1,'stan::gm::init_adapt(stan::mcmc::base_mcmc *sampler, categorical_argument *adapt, const Eigen::VectorXd &cont_params)']]], + ['init_5fdependent',['init_dependent',['../classstan_1_1agrad_1_1chainable.html#a9ef6020dcc949b73c1c3dfb1d4623bae',1,'stan::agrad::chainable::init_dependent()'],['../classstan_1_1agrad_1_1vari.html#ac668b532eb7eb33af863dfb035c0b8dc',1,'stan::agrad::vari::init_dependent()']]], + ['init_5flocal_5fvar_5fvisgen',['init_local_var_visgen',['../structstan_1_1gm_1_1init__local__var__visgen.html#a25c03b95d95240b52cf0b06801478a87',1,'stan::gm::init_local_var_visgen']]], + ['init_5fnuts',['init_nuts',['../namespacestan_1_1gm.html#aaa8e6ed991ef6bf3b5afc96b953e18ca',1,'stan::gm']]], + ['init_5fstatic_5fhmc',['init_static_hmc',['../namespacestan_1_1gm.html#ad9e999952303f4c193f24b063ff55d91',1,'stan::gm']]], + ['init_5fstepsize',['init_stepsize',['../classstan_1_1mcmc_1_1base__hmc.html#a6ec1af08b215fda50b23dade2aa615a8',1,'stan::mcmc::base_hmc']]], + ['init_5fwindowed_5fadapt',['init_windowed_adapt',['../namespacestan_1_1gm.html#a5121125c3b419aa099ab6fca8cb9d1c6',1,'stan::gm']]], + ['initialize',['initialize',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a1b31f5b47ab4af27c17ab8f620aaf914',1,'stan::optimization::BFGSMinimizer::initialize()'],['../namespacestan_1_1math.html#af81e05dfd6918524dafff10715f21a8d',1,'stan::math::initialize(T &x, const T &v)'],['../namespacestan_1_1math.html#a067af584ff2d244d2041c9b13f6d9247',1,'stan::math::initialize(T &x, V v)'],['../namespacestan_1_1math.html#aa2d6d42a356af95988b3a7005b5cf408',1,'stan::math::initialize(Eigen::Matrix< T, R, C > &x, const T &v)'],['../namespacestan_1_1math.html#ad27706378f77dc22746ad74721d495d4',1,'stan::math::initialize(std::vector< T > &x, const V &v)']]], + ['initialize_5fepsilon',['initialize_epsilon',['../classstan_1_1optimization_1_1_nesterov_gradient.html#af4dd5e1558ecf25c7a0bb57cb4e71c90',1,'stan::optimization::NesterovGradient']]], + ['initialize_5fvariable',['initialize_variable',['../namespacestan_1_1agrad.html#ae4df62fded6cf60ac4928f942190f39d',1,'stan::agrad::initialize_variable(var &variable, const var &value)'],['../namespacestan_1_1agrad.html#a6de2168e9cf12f2dad32a9a823b385a6',1,'stan::agrad::initialize_variable(Eigen::Matrix< var, R, C > &matrix, const var &value)'],['../namespacestan_1_1agrad.html#a15a79398931d22105e55c92dc3b8c6be',1,'stan::agrad::initialize_variable(std::vector< T > &variables, const var &value)']]], + ['instance',['instance',['../classstan_1_1gm_1_1function__signatures.html#a7f9782621df19462a0f088d0cf1542ff',1,'stan::gm::function_signatures']]], + ['int_5fliteral',['int_literal',['../structstan_1_1gm_1_1int__literal.html#a621c688b553f3f113f9b8ec9dc007ac8',1,'stan::gm::int_literal::int_literal()'],['../structstan_1_1gm_1_1int__literal.html#ae1dde9e342981c83edcc3832b10a19ca',1,'stan::gm::int_literal::int_literal(int val)'],['../structstan_1_1gm_1_1int__literal.html#aad91821fd816aa1be8b6313a12898141',1,'stan::gm::int_literal::int_literal(const int_literal &il)']]], + ['int_5fstep',['int_step',['../namespacestan_1_1math.html#a8c507cff4b7b473cd86e1d428fb03136',1,'stan::math']]], + ['int_5fvalues',['int_values',['../classstan_1_1io_1_1dump__reader.html#a595a2345787b84d1cb763c5f45a2c749',1,'stan::io::dump_reader']]], + ['int_5fvar_5fdecl',['int_var_decl',['../structstan_1_1gm_1_1int__var__decl.html#a47be885b904c190c2cdeae110ff4ca1c',1,'stan::gm::int_var_decl::int_var_decl()'],['../structstan_1_1gm_1_1int__var__decl.html#a8f08077bdf5b897c09ee679149eebd8a',1,'stan::gm::int_var_decl::int_var_decl(range const &range, std::string const &name, std::vector< expression > const &dims)']]], + ['integer',['integer',['../classstan_1_1io_1_1reader.html#af1a2b111d918d34bfebf6bb3b821495f',1,'stan::io::reader::integer()'],['../classstan_1_1io_1_1writer.html#a5614adc99ab468fdc3957c6444df46c7',1,'stan::io::writer::integer()']]], + ['integer_5fconstrain',['integer_constrain',['../classstan_1_1io_1_1reader.html#aeccd55003bc47a1eade2c75c20d0d13f',1,'stan::io::reader::integer_constrain()'],['../classstan_1_1io_1_1reader.html#a41d16a67c77fa38a5da05da6b4eb563f',1,'stan::io::reader::integer_constrain(T &)']]], + ['integer_5flb',['integer_lb',['../classstan_1_1io_1_1reader.html#a1535fc6c26ecedd2aa25989853a09261',1,'stan::io::reader']]], + ['integer_5flb_5fconstrain',['integer_lb_constrain',['../classstan_1_1io_1_1reader.html#a9287c3669f5eea0a5b2f22708d26da67',1,'stan::io::reader::integer_lb_constrain(int lb)'],['../classstan_1_1io_1_1reader.html#a786ee459470898a8fbc8a240dec6f269',1,'stan::io::reader::integer_lb_constrain(int lb, T &)']]], + ['integer_5flub',['integer_lub',['../classstan_1_1io_1_1reader.html#af9be53bcf3f435d5c25b07774853afa3',1,'stan::io::reader']]], + ['integer_5flub_5fconstrain',['integer_lub_constrain',['../classstan_1_1io_1_1reader.html#aa73203544d85c8e7f4a6e682edb8db4f',1,'stan::io::reader::integer_lub_constrain(int lb, int ub)'],['../classstan_1_1io_1_1reader.html#a0934519cf50d98a616b4e3a0bc9539fc',1,'stan::io::reader::integer_lub_constrain(int lb, int ub, T &)']]], + ['integer_5fub',['integer_ub',['../classstan_1_1io_1_1reader.html#a5dce1d461bcef2fda9d996fb07bb6782',1,'stan::io::reader']]], + ['integer_5fub_5fconstrain',['integer_ub_constrain',['../classstan_1_1io_1_1reader.html#aa492d17e0aeaba5a082fc554d248048e',1,'stan::io::reader::integer_ub_constrain(int ub)'],['../classstan_1_1io_1_1reader.html#ad23ce5d0b04667272770eb04eff2bfd4',1,'stan::io::reader::integer_ub_constrain(int ub, T &)']]], + ['inv',['inv',['../namespacestan_1_1agrad.html#a08b011331905f0a026fa4270582fe5d5',1,'stan::agrad::inv(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#ab3034b6e4ac96bb83a5b6f40c310d64d',1,'stan::agrad::inv(const var &a)'],['../namespacestan_1_1math.html#ab64935e0bdac8227bfd9608285d4e699',1,'stan::math::inv()']]], + ['inv_5fchi_5fsquare_5fccdf_5flog',['inv_chi_square_ccdf_log',['../namespacestan_1_1prob.html#a51e89cc15295d67eba75dfb4ccdbe27c',1,'stan::prob']]], + ['inv_5fchi_5fsquare_5fcdf',['inv_chi_square_cdf',['../namespacestan_1_1prob.html#ad68b6e115796a534a753491eae9744cb',1,'stan::prob']]], + ['inv_5fchi_5fsquare_5fcdf_5flog',['inv_chi_square_cdf_log',['../namespacestan_1_1prob.html#a624df4d53f7a8d24a4014e1e57ccaf3c',1,'stan::prob']]], + ['inv_5fchi_5fsquare_5flog',['inv_chi_square_log',['../namespacestan_1_1prob.html#ad6fd48ecb4e2a0cc22225cff5a7997e2',1,'stan::prob::inv_chi_square_log(const T_y &y, const T_dof &nu)'],['../namespacestan_1_1prob.html#a4c772dff5074551415e50920347b83cd',1,'stan::prob::inv_chi_square_log(const T_y &y, const T_dof &nu)']]], + ['inv_5fchi_5fsquare_5frng',['inv_chi_square_rng',['../namespacestan_1_1prob.html#ad7d3c06abef9546ac2f0a9174f1446fa',1,'stan::prob']]], + ['inv_5fcloglog',['inv_cloglog',['../namespacestan_1_1agrad.html#a14ec5b6590b42a6405fa06a34105ce84',1,'stan::agrad::inv_cloglog(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#afa07068a7659049c1404ff6e380176ef',1,'stan::agrad::inv_cloglog(const stan::agrad::var &a)'],['../namespacestan_1_1math.html#a008bf0b6c2ab38d088b0aba5d7b10c8d',1,'stan::math::inv_cloglog()']]], + ['inv_5fgamma_5fccdf_5flog',['inv_gamma_ccdf_log',['../namespacestan_1_1prob.html#ac95b1a5f812a121f1fce3120f54caabc',1,'stan::prob']]], + ['inv_5fgamma_5fcdf',['inv_gamma_cdf',['../namespacestan_1_1prob.html#a9295ef95ac9022168eff6748495294bf',1,'stan::prob']]], + ['inv_5fgamma_5fcdf_5flog',['inv_gamma_cdf_log',['../namespacestan_1_1prob.html#af5bc8f367605c27867cc93ec4f7b19d9',1,'stan::prob']]], + ['inv_5fgamma_5flog',['inv_gamma_log',['../namespacestan_1_1prob.html#a94f9022a58b4d16ac6eac9edc8c1cecc',1,'stan::prob::inv_gamma_log(const T_y &y, const T_shape &alpha, const T_scale &beta)'],['../namespacestan_1_1prob.html#a5aada55fa2a26ebfc6d38a1c5a2dc956',1,'stan::prob::inv_gamma_log(const T_y &y, const T_shape &alpha, const T_scale &beta)']]], + ['inv_5fgamma_5frng',['inv_gamma_rng',['../namespacestan_1_1prob.html#af588e525e8543ac66f21b5273196deaf',1,'stan::prob']]], + ['inv_5flogit',['inv_logit',['../namespacestan_1_1agrad.html#ab812d33218848139b280e30cd8863ac2',1,'stan::agrad::inv_logit(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#a015c1e0733bd9a3d7c26175d7072a759',1,'stan::agrad::inv_logit(const stan::agrad::var &a)'],['../namespacestan_1_1math.html#ad2c4834fc581f55acf8491ec3f80ecb7',1,'stan::math::inv_logit()']]], + ['inv_5fsqrt',['inv_sqrt',['../namespacestan_1_1agrad.html#a17ce517fb5ec226947603b3dfbbc235b',1,'stan::agrad::inv_sqrt(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#aac8f303b29b23f9952c2ad5ada543319',1,'stan::agrad::inv_sqrt(const var &a)'],['../namespacestan_1_1math.html#a4b4db5e98585c71cc7c14319f96e0c04',1,'stan::math::inv_sqrt()']]], + ['inv_5fsquare',['inv_square',['../namespacestan_1_1agrad.html#ad0cd65a6699f1fa471523ecef19102b4',1,'stan::agrad::inv_square(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#ab283916863ab97eab6aed628480f8a8b',1,'stan::agrad::inv_square(const var &a)'],['../namespacestan_1_1math.html#a3d2e922aa13e2dfae510fc13d86eaea3',1,'stan::math::inv_square()']]], + ['inv_5fwishart_5flog',['inv_wishart_log',['../namespacestan_1_1prob.html#a3052d1f67722328b643b7adb1fbae485',1,'stan::prob::inv_wishart_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &W, const T_dof &nu, const Eigen::Matrix< T_scale, Eigen::Dynamic, Eigen::Dynamic > &S)'],['../namespacestan_1_1prob.html#ad6efba06df0f3ccf2455b60bc7bbbdef',1,'stan::prob::inv_wishart_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &W, const T_dof &nu, const Eigen::Matrix< T_scale, Eigen::Dynamic, Eigen::Dynamic > &S)']]], + ['inv_5fwishart_5frng',['inv_wishart_rng',['../namespacestan_1_1prob.html#a6c0745153ef776d59ddac99f480972e5',1,'stan::prob']]], + ['inverse',['inverse',['../classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4.html#ac4f64ce4ad745b09bbb59113697760f4',1,'stan::math::LDLT_factor< double, R, C >::inverse()'],['../namespacestan_1_1agrad.html#ad04d66a7b2f44ae630c904534a43687a',1,'stan::agrad::inverse()'],['../namespacestan_1_1math.html#a461598c914f5634fa5057da7a817803d',1,'stan::math::inverse()']]], + ['inverse_5fsoftmax',['inverse_softmax',['../namespacestan_1_1math.html#a1edc35cc581dda178263f6a4a4fd1158',1,'stan::math']]], + ['inverse_5fspd',['inverse_spd',['../namespacestan_1_1math.html#a989989548db02c34cd6134790bd93478',1,'stan::math']]], + ['is_5faligned',['is_aligned',['../namespacestan_1_1memory.html#a952ba61b6936bdcad3955ec1f5e6ef8f',1,'stan::memory']]], + ['is_5fdefault',['is_default',['../classstan_1_1gm_1_1list__argument.html#a1f1d85337d7e4d67ef688997d8418dbd',1,'stan::gm::list_argument::is_default()'],['../classstan_1_1gm_1_1singleton__argument.html#a6ea5538fe5533addc1f6795a4ac1eb49',1,'stan::gm::singleton_argument::is_default()'],['../classstan_1_1gm_1_1valued__argument.html#af72ce3805416a25c51304b5448dae967',1,'stan::gm::valued_argument::is_default()']]], + ['is_5fdouble_5freturn',['is_double_return',['../structstan_1_1gm_1_1validate__sample.html#a457fa512cf1ad5c13e3c1fb0e02e9adf',1,'stan::gm::validate_sample']]], + ['is_5fill_5fformed',['is_ill_formed',['../structstan_1_1gm_1_1expr__type.html#af9a85e43e814f13ccadd9640308b86de',1,'stan::gm::expr_type::is_ill_formed()'],['../structstan_1_1gm_1_1sample.html#ab2f55c7ff636a10cc46e1d86c401041d',1,'stan::gm::sample::is_ill_formed()']]], + ['is_5fint',['is_int',['../classstan_1_1io_1_1dump__reader.html#a17c0c96ad8cb3c3c362fa74384b45bb7',1,'stan::io::dump_reader']]], + ['is_5fmatrix',['is_matrix',['../print_8hpp.html#a4405283b10c32553e10a7273d2a4f9d8',1,'print.hpp']]], + ['is_5fnil',['is_nil',['../namespacestan_1_1gm.html#a90e5f154350b02c39f381659672f9581',1,'stan::gm']]], + ['is_5fnonempty',['is_nonempty',['../namespacestan_1_1gm.html#a9cb045831aff85e2a5bc5d51bfc6584a',1,'stan::gm']]], + ['is_5fpresent',['is_present',['../classstan_1_1gm_1_1unvalued__argument.html#a87b246d97afb366e67ae99984dc4540e',1,'stan::gm::unvalued_argument']]], + ['is_5fprimitive',['is_primitive',['../structstan_1_1gm_1_1expr__type.html#a28728288384b1c9510ffe1a3cbb5efa3',1,'stan::gm::expr_type']]], + ['is_5fprimitive_5fdouble',['is_primitive_double',['../structstan_1_1gm_1_1expr__type.html#a01d1300672955a943b60f1f7220371a7',1,'stan::gm::expr_type']]], + ['is_5fprimitive_5fint',['is_primitive_int',['../structstan_1_1gm_1_1expr__type.html#a745e55e1e245badd91138475f8f7bddb',1,'stan::gm::expr_type']]], + ['is_5fspace',['is_space',['../namespacestan_1_1gm.html#a68fe0b83fbaa4ec1300a89f5097127b3',1,'stan::gm']]], + ['is_5funinitialized',['is_uninitialized',['../classstan_1_1agrad_1_1var.html#ab7764c9ed32774d35c18d512d5c96f96',1,'stan::agrad::var::is_uninitialized()'],['../namespacestan_1_1agrad.html#a72761c1c17a04122ee2dbb0c56cbb9c0',1,'stan::agrad::is_uninitialized()'],['../namespacestan_1_1math.html#a40c14c26dc55a985e05695b3ff1eeef2',1,'stan::math::is_uninitialized()']]], + ['is_5funivariate',['is_univariate',['../structstan_1_1gm_1_1validate__sample.html#aca344bafbf0b16055bc48307645f4c81',1,'stan::gm::validate_sample']]], + ['is_5fvalid',['is_valid',['../classstan_1_1gm_1_1arg__adapt__delta.html#a916005859f965aabc1d829a7062ec424',1,'stan::gm::arg_adapt_delta::is_valid()'],['../classstan_1_1gm_1_1arg__adapt__gamma.html#a6fe8d59b8c1315ee5c6dc6b466698e19',1,'stan::gm::arg_adapt_gamma::is_valid()'],['../classstan_1_1gm_1_1arg__adapt__kappa.html#a1b03b095c18343b8932d36aca1211e12',1,'stan::gm::arg_adapt_kappa::is_valid()'],['../classstan_1_1gm_1_1arg__adapt__t0.html#a98cacbc166aa6b2ceb14094dddc7fad6',1,'stan::gm::arg_adapt_t0::is_valid()'],['../classstan_1_1gm_1_1arg__id.html#a477cdfd1a053c2e7b63bdadada63ff60',1,'stan::gm::arg_id::is_valid()'],['../classstan_1_1gm_1_1arg__init__alpha.html#ac40372ef2c1cbe5d9ede053b1014c003',1,'stan::gm::arg_init_alpha::is_valid()'],['../classstan_1_1gm_1_1arg__int__time.html#a71716eb472c59395c6de8cbca1755c00',1,'stan::gm::arg_int_time::is_valid()'],['../classstan_1_1gm_1_1arg__iter.html#a390a002c014d9d88c41ab5b224b0e771',1,'stan::gm::arg_iter::is_valid()'],['../classstan_1_1gm_1_1arg__max__depth.html#a30a8bb165ba3b981ab802337641bbe60',1,'stan::gm::arg_max_depth::is_valid()'],['../classstan_1_1gm_1_1arg__num__samples.html#aeca6a105ba2ef2e80ec02969bd581af2',1,'stan::gm::arg_num_samples::is_valid()'],['../classstan_1_1gm_1_1arg__num__warmup.html#a3671f012b8c32dbc0cc470db0be437ff',1,'stan::gm::arg_num_warmup::is_valid()'],['../classstan_1_1gm_1_1arg__refresh.html#a2ea73528686bcd3386826638346a7173',1,'stan::gm::arg_refresh::is_valid()'],['../classstan_1_1gm_1_1arg__stepsize.html#a39d1b37895f28567618958d5b7df849d',1,'stan::gm::arg_stepsize::is_valid()'],['../classstan_1_1gm_1_1arg__stepsize__jitter.html#acf9b3e56f3f411ecf82e0af58f05517d',1,'stan::gm::arg_stepsize_jitter::is_valid()'],['../classstan_1_1gm_1_1arg__test__grad__eps.html#aa547cb6de6ea0e76098b79cce8e94cf7',1,'stan::gm::arg_test_grad_eps::is_valid()'],['../classstan_1_1gm_1_1arg__test__grad__err.html#a449f28acf765be6f6998f1fabebc7b40',1,'stan::gm::arg_test_grad_err::is_valid()'],['../classstan_1_1gm_1_1arg__thin.html#a98ba3e88a6641e25ca08d3c35ca68e68',1,'stan::gm::arg_thin::is_valid()'],['../classstan_1_1gm_1_1arg__tolerance.html#a003c31f5f93a8a7f77ec46b7c9e2420c',1,'stan::gm::arg_tolerance::is_valid()'],['../classstan_1_1gm_1_1singleton__argument.html#a007c5b0d3f9498c45089075bb0c3c390',1,'stan::gm::singleton_argument::is_valid()']]], + ['isfinite',['isfinite',['../namespaceboost_1_1math.html#aacb94b2d8f46034875d78e4260274709',1,'boost::math']]], + ['isinf',['isinf',['../namespaceboost_1_1math.html#ad274b0c69c7bd9e4ca76ac7519fd9f74',1,'boost::math::isinf()'],['../namespacestd.html#a458a0f3c809188e7fb9a9e10d335ac60',1,'std::isinf()']]], + ['isnan',['isnan',['../namespaceboost_1_1math.html#a3987c91e5ae7f757baf28ae8efc0fbbe',1,'boost::math::isnan()'],['../namespacestd.html#a197a4417fc07456e4f2d545e176dc97a',1,'std::isnan()']]], + ['isnormal',['isnormal',['../namespaceboost_1_1math.html#a66748d24fc22dc865ef9b64d17ed4d66',1,'boost::math']]], + ['iter_5fnum',['iter_num',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a7c686dded117ef891b9a0aff363a511d',1,'stan::optimization::BFGSMinimizer']]] +]; diff --git a/doc/api/html/search/functions_6a.html b/doc/api/html/search/functions_6a.html new file mode 100644 index 00000000000..2b208e183ba --- /dev/null +++ b/doc/api/html/search/functions_6a.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/functions_6a.js b/doc/api/html/search/functions_6a.js new file mode 100644 index 00000000000..7d12f0d45cc --- /dev/null +++ b/doc/api/html/search/functions_6a.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['jacobian',['jacobian',['../namespacestan_1_1agrad.html#a660e1cd77e3dcb11faf98da2521ee0f8',1,'stan::agrad::jacobian(const F &f, const Eigen::Matrix< double, Eigen::Dynamic, 1 > &x, Eigen::Matrix< double, Eigen::Dynamic, 1 > &fx, Eigen::Matrix< double, Eigen::Dynamic, Eigen::Dynamic > &J)'],['../namespacestan_1_1agrad.html#a7d496770e4f01fa73a4adf17e2ea1313',1,'stan::agrad::jacobian(const F &f, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, Eigen::Matrix< T, Eigen::Dynamic, 1 > &fx, Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &J)'],['../namespacestan_1_1agrad.html#a4121d2877f4a3569f878b8e9207af3c1',1,'stan::agrad::jacobian(std::vector< var > &dependents, std::vector< var > &independents, std::vector< std::vector< double > > &jacobian)']]] +]; diff --git a/doc/api/html/search/functions_6b.html b/doc/api/html/search/functions_6b.html new file mode 100644 index 00000000000..5b1fb4a3ae5 --- /dev/null +++ b/doc/api/html/search/functions_6b.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/functions_6b.js b/doc/api/html/search/functions_6b.js new file mode 100644 index 00000000000..ff629187233 --- /dev/null +++ b/doc/api/html/search/functions_6b.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['key_5fset',['key_set',['../classstan_1_1gm_1_1function__signatures.html#a6b48032da5b50b100fdb4ebcba899197',1,'stan::gm::function_signatures']]] +]; diff --git a/doc/api/html/search/functions_6c.html b/doc/api/html/search/functions_6c.html new file mode 100644 index 00000000000..da371cfab0f --- /dev/null +++ b/doc/api/html/search/functions_6c.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/functions_6c.js b/doc/api/html/search/functions_6c.js new file mode 100644 index 00000000000..cc7931c98a1 --- /dev/null +++ b/doc/api/html/search/functions_6c.js @@ -0,0 +1,67 @@ +var searchData= +[ + ['lb_5fconstrain',['lb_constrain',['../namespacestan_1_1prob.html#a680c6f47862a16f0b45c85ce534e8211',1,'stan::prob::lb_constrain(const T x, const TL lb)'],['../namespacestan_1_1prob.html#a76b59a59ddaad0ad5a82226192ffd843',1,'stan::prob::lb_constrain(const T x, const TL lb, T &lp)']]], + ['lb_5ffree',['lb_free',['../namespacestan_1_1prob.html#a5f8562f1f72bf02ac21b36ef8dcfe3d7',1,'stan::prob']]], + ['lbeta',['lbeta',['../namespacestan_1_1agrad.html#ab7f20a5b3ac5abeef9b69b629c64f075',1,'stan::agrad::lbeta(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#ae4c9ce80559602ab8d0ec6f5ae3e7d3b',1,'stan::agrad::lbeta(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a2f095ba758cbca01594b6b7be1513ce4',1,'stan::agrad::lbeta(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1math.html#a3ccdb3f505b7db61c510e59e97b947b6',1,'stan::math::lbeta()']]], + ['ldlt_5ffactor',['LDLT_factor',['../classstan_1_1math_1_1_l_d_l_t__factor_3_01stan_1_1agrad_1_1var_00_01_r_00_01_c_01_4.html#abdc7a01f87ac33c781d58a2d5ed2fd26',1,'stan::math::LDLT_factor< stan::agrad::var, R, C >::LDLT_factor()'],['../classstan_1_1math_1_1_l_d_l_t__factor_3_01stan_1_1agrad_1_1var_00_01_r_00_01_c_01_4.html#a86525804bc537ac3a74297484626d45a',1,'stan::math::LDLT_factor< stan::agrad::var, R, C >::LDLT_factor(const Eigen::Matrix< stan::agrad::var, R, C > &A)'],['../classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4.html#ab710d201cf60112e05283a2b57c3547c',1,'stan::math::LDLT_factor< double, R, C >::LDLT_factor()'],['../classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4.html#a88d83ef1c8b2536fc47c2e822aabaee2',1,'stan::math::LDLT_factor< double, R, C >::LDLT_factor(const Eigen::Matrix< double, R, C > &A)']]], + ['learn_5fcovariance',['learn_covariance',['../classstan_1_1mcmc_1_1covar__adaptation.html#a6c50cab9f1bebe465e8c28db2a9581f4',1,'stan::mcmc::covar_adaptation']]], + ['learn_5fstepsize',['learn_stepsize',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#a29b24c73369c15114624b44b703d100e',1,'stan::mcmc::stepsize_adaptation']]], + ['learn_5fvariance',['learn_variance',['../classstan_1_1mcmc_1_1var__adaptation.html#a52f68d10bf0c8628b395bf18a00ba34e',1,'stan::mcmc::var_adaptation']]], + ['length',['length',['../namespacestan.html#a59c48c2ee48c5a6e8048fa2d6a035445',1,'stan::length(const T &)'],['../namespacestan.html#adb2e0700b1ec87a5e080cd50026b0182',1,'stan::length(const std::vector< T > &x)'],['../namespacestan.html#a12b8544448f77da1a773c7b7c0ebdc01',1,'stan::length(const Eigen::Matrix< T, R, C > &m)']]], + ['lgamma',['lgamma',['../namespacestan_1_1agrad.html#acb8b7366b1ecbe633d2c96f1c8dc62b8',1,'stan::agrad::lgamma(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#a9d1f65093166797ec93ec580abc77d15',1,'stan::agrad::lgamma(const stan::agrad::var &a)'],['../namespacestan_1_1math.html#a836f46d7f63f5118a32cad11382c0551',1,'stan::math::lgamma()']]], + ['list_5fargument',['list_argument',['../classstan_1_1gm_1_1list__argument.html#ac0e9e2d2392255d5d6576390c7560b89',1,'stan::gm::list_argument']]], + ['lkj_5fcorr_5fcholesky_5flog',['lkj_corr_cholesky_log',['../namespacestan_1_1prob.html#a547d5d6ea7f2a985488c75eb2788d7c4',1,'stan::prob::lkj_corr_cholesky_log(const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &L, const T_shape &eta)'],['../namespacestan_1_1prob.html#afa5ff4715e294327b88666b1f9639e55',1,'stan::prob::lkj_corr_cholesky_log(const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &L, const T_shape &eta)']]], + ['lkj_5fcorr_5fcholesky_5frng',['lkj_corr_cholesky_rng',['../namespacestan_1_1prob.html#ab6923f0ee88a517f5be6ac8780e5842c',1,'stan::prob']]], + ['lkj_5fcorr_5flog',['lkj_corr_log',['../namespacestan_1_1prob.html#a89375117dd56efcdf32c2e8d7bb593a9',1,'stan::prob::lkj_corr_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const T_shape &eta)'],['../namespacestan_1_1prob.html#a35b120723f2e595892c2d86d00a9cf3e',1,'stan::prob::lkj_corr_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const T_shape &eta)']]], + ['lkj_5fcorr_5frng',['lkj_corr_rng',['../namespacestan_1_1prob.html#a54800d037a32da9ecfb59c87152bfbcc',1,'stan::prob']]], + ['lkj_5fcov_5flog',['lkj_cov_log',['../namespacestan_1_1prob.html#a96a69b926127ce2349d86bcbedac81d7',1,'stan::prob::lkj_cov_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_scale, Eigen::Dynamic, 1 > &sigma, const T_shape &eta)'],['../namespacestan_1_1prob.html#a60be4ec8b4e9dd29b73d49139c489e51',1,'stan::prob::lkj_cov_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_scale, Eigen::Dynamic, 1 > &sigma, const T_shape &eta)'],['../namespacestan_1_1prob.html#a8d134366536efce845a8f64527e86ff9',1,'stan::prob::lkj_cov_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const T_loc &mu, const T_scale &sigma, const T_shape &eta)'],['../namespacestan_1_1prob.html#a78c42178310c4085d186abfb85c97db1',1,'stan::prob::lkj_cov_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const T_loc &mu, const T_scale &sigma, const T_shape &eta)']]], + ['lmgamma',['lmgamma',['../namespacestan_1_1agrad.html#abcf5c1dacc44b491a46040004177e1ad',1,'stan::agrad::lmgamma(int x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#af080723d19e8d4fa6dbe74cab69ee3f2',1,'stan::agrad::lmgamma(int a, const stan::agrad::var &b)'],['../namespacestan_1_1math.html#a0ee0706b2cb6d2e1da2c3b6041c06a56',1,'stan::math::lmgamma()']]], + ['local_5fvar_5fdecl_5fvisgen',['local_var_decl_visgen',['../structstan_1_1gm_1_1local__var__decl__visgen.html#a64a2e460136e91077c77fccef2b34c0d',1,'stan::gm::local_var_decl_visgen']]], + ['log',['log',['../namespacestan_1_1agrad.html#ac98c1c298301701efe36438130bac705',1,'stan::agrad::log(const var &a)'],['../namespacestan_1_1agrad.html#a43089bcc90b7c1aaff44406aaa426e85',1,'stan::agrad::log(const fvar< T > &x)'],['../namespacestan_1_1math.html#ae3e7ce33064686ec2a2591fa5d4227cf',1,'stan::math::log()']]], + ['log10',['log10',['../namespacestan_1_1agrad.html#a6eb95bc79aff1cd13c794525c5a907e8',1,'stan::agrad::log10(const var &a)'],['../namespacestan_1_1agrad.html#aa63c2c14dbdb19b7edf2834b287a4676',1,'stan::agrad::log10(const fvar< T > &x)'],['../namespacestan_1_1math.html#a21f4f7c092e2bc9a089885628b86c004',1,'stan::math::log10()']]], + ['log1m',['log1m',['../namespacestan_1_1agrad.html#af4be9cece7a9094512941604d195fafc',1,'stan::agrad::log1m(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#a428e6958e002b027bdbfe4a844a267a4',1,'stan::agrad::log1m(const stan::agrad::var &a)'],['../namespacestan_1_1math.html#a4f92092fb8a70b31d00898bbbe769612',1,'stan::math::log1m()']]], + ['log1m_5fexp',['log1m_exp',['../namespacestan_1_1agrad.html#a501a03587bc86f5ec3745e9fbee6636a',1,'stan::agrad::log1m_exp(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#ab8a7bcd350916b80b3bd0e6633344861',1,'stan::agrad::log1m_exp(const stan::agrad::var &a)'],['../namespacestan_1_1math.html#a3ce261caf05bd371c430e82a0e6389a5',1,'stan::math::log1m_exp()']]], + ['log1m_5finv_5flogit',['log1m_inv_logit',['../namespacestan_1_1agrad.html#a4ef1d069b2a0b0e79e6a96096ced05a5',1,'stan::agrad::log1m_inv_logit()'],['../namespacestan_1_1math.html#ac7f71c696a5e0da4daab30e5f3704842',1,'stan::math::log1m_inv_logit()']]], + ['log1p',['log1p',['../namespacestan_1_1agrad.html#a3e8efd5110369daca4516294e61113cc',1,'stan::agrad::log1p(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#a668283bab0c6bc04b5b106d236a2377a',1,'stan::agrad::log1p(const stan::agrad::var &a)'],['../namespacestan_1_1math.html#a5166d3c58ad8ce0aedbf104179888b69',1,'stan::math::log1p()']]], + ['log1p_5fexp',['log1p_exp',['../namespacestan_1_1agrad.html#a1ff177e7dc2559a9f0e11b60aa024aac',1,'stan::agrad::log1p_exp(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#a10454c0b2b4185635d09ceb22bb1e8b0',1,'stan::agrad::log1p_exp(const stan::agrad::var &a)'],['../namespacestan_1_1math.html#a88151def26813dec3e04c4a8b9674091',1,'stan::math::log1p_exp()']]], + ['log2',['log2',['../namespacestan_1_1agrad.html#adc1fbe8f169e3dbaf05dce2399b87177',1,'stan::agrad::log2(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#aca9b147f7efd83ab91e1169324e42172',1,'stan::agrad::log2(const stan::agrad::var &a)'],['../namespacestan_1_1math.html#aa25e1572bf46e3a6b9ee270f0c7e2c4d',1,'stan::math::log2(const T a)'],['../namespacestan_1_1math.html#a947ba3fe3c87293f7c57395007100c79',1,'stan::math::log2()']]], + ['log_5fabs_5fdet',['log_abs_det',['../classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4.html#a8c2f622cdd10422db6d9470c7799a189',1,'stan::math::LDLT_factor< double, R, C >']]], + ['log_5fdeterminant',['log_determinant',['../namespacestan_1_1agrad.html#a8a1d37f736333bd2c5e22f0ccb645e5c',1,'stan::agrad::log_determinant(const Eigen::Matrix< fvar< T >, R, C > &m)'],['../namespacestan_1_1agrad.html#a987a42c964cf999f61943d6811843964',1,'stan::agrad::log_determinant(const Eigen::Matrix< var, R, C > &m)'],['../namespacestan_1_1math.html#aca29dad18932e3ca17ac52fd0238b364',1,'stan::math::log_determinant()']]], + ['log_5fdeterminant_5fldlt',['log_determinant_ldlt',['../namespacestan_1_1agrad.html#a836b4fbc18e46a0b211c77362ee5ea7f',1,'stan::agrad::log_determinant_ldlt()'],['../namespacestan_1_1math.html#a306d737ee042b8f40e93713cd87fe48b',1,'stan::math::log_determinant_ldlt()']]], + ['log_5fdeterminant_5fspd',['log_determinant_spd',['../namespacestan_1_1agrad.html#acb47e4ac872b94a58defa619ba0b96e3',1,'stan::agrad::log_determinant_spd()'],['../namespacestan_1_1math.html#ae9a296d4414d0193108c70b350a05cfc',1,'stan::math::log_determinant_spd()']]], + ['log_5fdiff_5fexp',['log_diff_exp',['../namespacestan_1_1agrad.html#a8b63a8fd1ac87815107c75c405e810dd',1,'stan::agrad::log_diff_exp(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a5d5141fbaefe30307b79611c1391ca5c',1,'stan::agrad::log_diff_exp(const T1 &x1, const fvar< T2 > &x2)'],['../namespacestan_1_1agrad.html#a24844c12cad61f5e2ee54fe198347a98',1,'stan::agrad::log_diff_exp(const fvar< T1 > &x1, const T2 &x2)'],['../namespacestan_1_1agrad.html#a119e409264dfab429ffaa814ba6133c0',1,'stan::agrad::log_diff_exp(const stan::agrad::var &a, const stan::agrad::var &b)'],['../namespacestan_1_1agrad.html#a2475060db47484c7a076f404fbb2394d',1,'stan::agrad::log_diff_exp(const stan::agrad::var &a, const double &b)'],['../namespacestan_1_1agrad.html#a9a895635ca7f66a6bf4372fe314f2d21',1,'stan::agrad::log_diff_exp(const double &a, const stan::agrad::var &b)'],['../namespacestan_1_1math.html#aac1dbafd4c2a129415e86f868fc0979a',1,'stan::math::log_diff_exp()']]], + ['log_5ffalling_5ffactorial',['log_falling_factorial',['../namespacestan_1_1agrad.html#a0ffd034a1939c647aead3fdafae32afa',1,'stan::agrad::log_falling_factorial(const fvar< T > &x, const fvar< T > &n)'],['../namespacestan_1_1agrad.html#a21f6f947d6415c306ad111ef43981b90',1,'stan::agrad::log_falling_factorial(const double x, const fvar< T > &n)'],['../namespacestan_1_1agrad.html#ab039c4e5fecc51d8772b632c3a9acb53',1,'stan::agrad::log_falling_factorial(const fvar< T > &x, const double n)'],['../namespacestan_1_1agrad.html#aa5f969e2991f83a5e66a3f8822486215',1,'stan::agrad::log_falling_factorial(const var &a, const double &b)'],['../namespacestan_1_1agrad.html#a08dde4140ae5a400855918f6cd91e17e',1,'stan::agrad::log_falling_factorial(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#adebdfe1af8c92bcd3a142794c954316b',1,'stan::agrad::log_falling_factorial(const double &a, const var &b)'],['../namespacestan_1_1math.html#aa9cb2f3f6c73b2005d9e9fadbad415bf',1,'stan::math::log_falling_factorial()']]], + ['log_5finv_5flogit',['log_inv_logit',['../namespacestan_1_1agrad.html#a25aaaf2eca128514fc4cf52b59872658',1,'stan::agrad::log_inv_logit()'],['../namespacestan_1_1math.html#ad5be889d1ef4284654a04e400f5371a7',1,'stan::math::log_inv_logit()']]], + ['log_5finv_5flogit_5fdiff',['log_inv_logit_diff',['../namespacestan_1_1prob.html#a76c814ad46314b38beb80a1a699617ef',1,'stan::prob']]], + ['log_5fprob',['log_prob',['../classstan_1_1mcmc_1_1sample.html#a42aa100b16656e4904586f80ec028425',1,'stan::mcmc::sample']]], + ['log_5fprob_5fgrad',['log_prob_grad',['../namespacestan_1_1model.html#aad33e9d6c10b589acbe6e527b5f9de80',1,'stan::model::log_prob_grad(const M &model, std::vector< double > &params_r, std::vector< int > &params_i, std::vector< double > &gradient, std::ostream *msgs=0)'],['../namespacestan_1_1model.html#aa8bbac348a197c17f86d57cc3a65e7d2',1,'stan::model::log_prob_grad(const M &model, Eigen::VectorXd &params_r, Eigen::VectorXd &gradient, std::ostream *msgs=0)']]], + ['log_5fprob_5fpropto',['log_prob_propto',['../namespacestan_1_1model.html#a4f75ba8738a5667a7abaef3871e14ca8',1,'stan::model::log_prob_propto(const M &model, std::vector< double > &params_r, std::vector< int > &params_i, std::ostream *msgs=0)'],['../namespacestan_1_1model.html#a0267095f157269950cfd3f1f402abe21',1,'stan::model::log_prob_propto(const M &model, Eigen::VectorXd &params_r, std::ostream *msgs=0)']]], + ['log_5frising_5ffactorial',['log_rising_factorial',['../namespacestan_1_1agrad.html#a3782da231c6c02f7ce65cf7b8a0d0b28',1,'stan::agrad::log_rising_factorial(const fvar< T > &x, const fvar< T > &n)'],['../namespacestan_1_1agrad.html#af00e8b62f7721b68f450588b1842d005',1,'stan::agrad::log_rising_factorial(const fvar< T > &x, const double n)'],['../namespacestan_1_1agrad.html#a58c0933b722f43bed32a6dd069716698',1,'stan::agrad::log_rising_factorial(const double x, const fvar< T > &n)'],['../namespacestan_1_1agrad.html#aa260d82a2cae776fafd0b65f40da2a91',1,'stan::agrad::log_rising_factorial(const var &a, const double &b)'],['../namespacestan_1_1agrad.html#aee3ad0a137a3ac1164ef4afbbfc3aa17',1,'stan::agrad::log_rising_factorial(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#af9ecc1f14a7e33f59a6349b37aeb6846',1,'stan::agrad::log_rising_factorial(const double &a, const var &b)'],['../namespacestan_1_1math.html#aaf23285d755661c14ca29c3ba935b77d',1,'stan::math::log_rising_factorial()']]], + ['log_5fsoftmax',['log_softmax',['../namespacestan_1_1agrad.html#a1669a67b8247ae502926890376c2b68b',1,'stan::agrad::log_softmax(const Eigen::Matrix< fvar< T >, Eigen::Dynamic, 1 > &alpha)'],['../namespacestan_1_1agrad.html#adcaa1e54a0acf38f7a8f10a1bc33e8df',1,'stan::agrad::log_softmax(const Eigen::Matrix< var, Eigen::Dynamic, 1 > &alpha)'],['../namespacestan_1_1math.html#a011a8c8bb83f9b6c700a725240be33b5',1,'stan::math::log_softmax()']]], + ['log_5fsum_5fexp',['log_sum_exp',['../namespacestan_1_1agrad.html#a6cd9f7f4203d0dd299489be37445b5e1',1,'stan::agrad::log_sum_exp(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a65accd2105cd3b00e370ba7ba2de38e4',1,'stan::agrad::log_sum_exp(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#ac8761a5b8672071d99b5c7cc8dea3276',1,'stan::agrad::log_sum_exp(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#a3d1039fe876efe94f6a8d40f9d1c96cd',1,'stan::agrad::log_sum_exp(const std::vector< fvar< T > > &v)'],['../namespacestan_1_1agrad.html#a5df6229f0b30f3b43f5c6b4744acc62c',1,'stan::agrad::log_sum_exp(const Eigen::Matrix< fvar< T >, R, C > &v)'],['../namespacestan_1_1agrad.html#ac64b74224b38e3bcff5e33c2ffdb673e',1,'stan::agrad::log_sum_exp(const stan::agrad::var &a, const stan::agrad::var &b)'],['../namespacestan_1_1agrad.html#af6960e01ec13ad3bffda2295e5f10c33',1,'stan::agrad::log_sum_exp(const stan::agrad::var &a, const double &b)'],['../namespacestan_1_1agrad.html#a845f5338275b390a8eeedb3e66f097f8',1,'stan::agrad::log_sum_exp(const double &a, const stan::agrad::var &b)'],['../namespacestan_1_1agrad.html#a5706fda535b2473b48024f50ce69be18',1,'stan::agrad::log_sum_exp(const std::vector< var > &x)'],['../namespacestan_1_1agrad.html#a902892cf9092c81ee4d26c54ba672c38',1,'stan::agrad::log_sum_exp(const Eigen::Matrix< var, R, C > &x)'],['../namespacestan_1_1math.html#a3c5f32f7cd1a5690a697f4031df569c4',1,'stan::math::log_sum_exp(const T2 &a, const T1 &b)'],['../namespacestan_1_1math.html#ae5513861b48f8649938d82883b58170c',1,'stan::math::log_sum_exp(const std::vector< T > &x)'],['../namespacestan_1_1math.html#a6205ce595af6efac8746bd83b2b761da',1,'stan::math::log_sum_exp(const Eigen::Matrix< T, R, C > &x)']]], + ['logical_5fand',['logical_and',['../namespacestan_1_1math.html#adc35bab2db89b3ceda66f11e1fa53ec8',1,'stan::math']]], + ['logical_5feq',['logical_eq',['../namespacestan_1_1math.html#ab2213736b55fd6696fa0120fd3fe72e4',1,'stan::math']]], + ['logical_5fgt',['logical_gt',['../namespacestan_1_1math.html#aba86bfd994302061a0260e1202fca777',1,'stan::math']]], + ['logical_5fgte',['logical_gte',['../namespacestan_1_1math.html#ac6bb0b8623192207d35e207ea312d8be',1,'stan::math']]], + ['logical_5flt',['logical_lt',['../namespacestan_1_1math.html#a0b5bd91412749e10933f304b54aef88f',1,'stan::math']]], + ['logical_5flte',['logical_lte',['../namespacestan_1_1math.html#af3649d4c704962c4502cd6220a5e2230',1,'stan::math']]], + ['logical_5fnegation',['logical_negation',['../namespacestan_1_1math.html#aad2fc9ce55dfac079d930335beb7e4a8',1,'stan::math']]], + ['logical_5fneq',['logical_neq',['../namespacestan_1_1math.html#a206eb210d8e7e2c718af25c40de8f9d1',1,'stan::math']]], + ['logical_5for',['logical_or',['../namespacestan_1_1math.html#ac74007e2d5f55d5ae4a308f535869aee',1,'stan::math']]], + ['logistic_5fccdf_5flog',['logistic_ccdf_log',['../namespacestan_1_1prob.html#aeff91e2efd57e631955cb7ebde45a1c7',1,'stan::prob']]], + ['logistic_5fcdf',['logistic_cdf',['../namespacestan_1_1prob.html#ac2a1d5c2316209f3a4d6cc90f3f3b6cf',1,'stan::prob']]], + ['logistic_5fcdf_5flog',['logistic_cdf_log',['../namespacestan_1_1prob.html#aca4c773da2a18fac3e13b91e51e9e18d',1,'stan::prob']]], + ['logistic_5flog',['logistic_log',['../namespacestan_1_1prob.html#a33be4a206231be2a1acda61c06c05039',1,'stan::prob::logistic_log(const T_y &y, const T_loc &mu, const T_scale &sigma)'],['../namespacestan_1_1prob.html#abfa731b9fd1d7ba996e1e5f9eb6e847f',1,'stan::prob::logistic_log(const T_y &y, const T_loc &mu, const T_scale &sigma)']]], + ['logistic_5frng',['logistic_rng',['../namespacestan_1_1prob.html#a664843596a52a9bc23dc5f2073f9806b',1,'stan::prob']]], + ['logit',['logit',['../namespacestan_1_1agrad.html#ab43cf2fb570203a8492c272da3d2922f',1,'stan::agrad::logit()'],['../namespacestan_1_1math.html#a53342d0c2cd3a6e440c533070054aca3',1,'stan::math::logit()']]], + ['lognormal_5fccdf_5flog',['lognormal_ccdf_log',['../namespacestan_1_1prob.html#a576b250e68b4cc83d9df5d697eb57fa2',1,'stan::prob']]], + ['lognormal_5fcdf',['lognormal_cdf',['../namespacestan_1_1prob.html#af50822e781206859400fb659831eb000',1,'stan::prob']]], + ['lognormal_5fcdf_5flog',['lognormal_cdf_log',['../namespacestan_1_1prob.html#aa7a25fc347587649f2ca55656fb23950',1,'stan::prob']]], + ['lognormal_5flog',['lognormal_log',['../namespacestan_1_1prob.html#a72c3cfe83f1bfa2a71d146dde0cc865e',1,'stan::prob::lognormal_log(const T_y &y, const T_loc &mu, const T_scale &sigma)'],['../namespacestan_1_1prob.html#a47dbe7f1b8096c72c8dc40496b9f082d',1,'stan::prob::lognormal_log(const T_y &y, const T_loc &mu, const T_scale &sigma)']]], + ['lognormal_5frng',['lognormal_rng',['../namespacestan_1_1prob.html#a9dbaae05c716d93b29dfc3f00f26d4ed',1,'stan::prob']]], + ['logp',['logp',['../classstan_1_1optimization_1_1_b_f_g_s_line_search.html#a6750ef181409d006239e8693a60daa85',1,'stan::optimization::BFGSLineSearch::logp()'],['../classstan_1_1optimization_1_1_nesterov_gradient.html#af86f9e2d5da6465c6fdaa435a7c48886',1,'stan::optimization::NesterovGradient::logp()']]], + ['lowest',['lowest',['../struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html#a14cfab12cd9b5df0f0663a7bb07fa35d',1,'Eigen::NumTraits< stan::agrad::var >']]], + ['lp_5fno_5fjacobian',['lp_no_jacobian',['../namespacestan_1_1optimization.html#a03faddd9bfe31c6237e1ce662d3f3d2d',1,'stan::optimization']]], + ['lub_5fconstrain',['lub_constrain',['../namespacestan_1_1prob.html#a7333ecac8eb1a974e758a134f30fbf7b',1,'stan::prob::lub_constrain(const T x, TL lb, TU ub)'],['../namespacestan_1_1prob.html#af8825917ff4f4875b7820edc760e4440',1,'stan::prob::lub_constrain(const T x, const TL lb, const TU ub, T &lp)']]], + ['lub_5ffree',['lub_free',['../namespacestan_1_1prob.html#a4e48912671137a74815f5194163279c9',1,'stan::prob']]] +]; diff --git a/doc/api/html/search/functions_6d.html b/doc/api/html/search/functions_6d.html new file mode 100644 index 00000000000..d01ac5376a1 --- /dev/null +++ b/doc/api/html/search/functions_6d.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/functions_6d.js b/doc/api/html/search/functions_6d.js new file mode 100644 index 00000000000..4b573c8e4a0 --- /dev/null +++ b/doc/api/html/search/functions_6d.js @@ -0,0 +1,54 @@ +var searchData= +[ + ['machine_5fprecision',['machine_precision',['../namespacestan_1_1math.html#a173839dddd0a8ac8afa710b9e3d5008a',1,'stan::math']]], + ['main',['main',['../print_8cpp.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]): print.cpp'],['../stanc_8cpp.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]): stanc.cpp']]], + ['make_5fnu',['make_nu',['../namespacestan_1_1prob.html#a4aae2e874c72677ddb53ec9bdec1c29d',1,'stan::prob']]], + ['matrix',['matrix',['../classstan_1_1io_1_1reader.html#afd2aeccae677df87006d976cbcae9fd2',1,'stan::io::reader']]], + ['matrix_5fconstrain',['matrix_constrain',['../classstan_1_1io_1_1reader.html#a72043393997619c044478ced8a867f69',1,'stan::io::reader::matrix_constrain(size_t m, size_t n)'],['../classstan_1_1io_1_1reader.html#a44a9e74ffa53964f23173a5c31e798c8',1,'stan::io::reader::matrix_constrain(size_t m, size_t n, T &)']]], + ['matrix_5findex',['matrix_index',['../print_8hpp.html#ac6106c19828c8abe37b2bb9dc66ce82b',1,'matrix_index(stan::mcmc::chains<> &chains, const int index): print.hpp'],['../print_8hpp.html#abb3cd74cdc531aef4a85bed5fca26c26',1,'matrix_index(std::vector< int > &index, const std::vector< int > &dims): print.hpp']]], + ['matrix_5flb',['matrix_lb',['../classstan_1_1io_1_1reader.html#afcad89dd91b23010956526b523ed8c95',1,'stan::io::reader']]], + ['matrix_5flb_5fconstrain',['matrix_lb_constrain',['../classstan_1_1io_1_1reader.html#a79b98ecf881169d6dd480caa096c0ed8',1,'stan::io::reader::matrix_lb_constrain(const TL lb, size_t m, size_t n)'],['../classstan_1_1io_1_1reader.html#a9b119826c47b45fa83df1758de07c5ff',1,'stan::io::reader::matrix_lb_constrain(const TL lb, size_t m, size_t n, T &lp)']]], + ['matrix_5flb_5funconstrain',['matrix_lb_unconstrain',['../classstan_1_1io_1_1writer.html#a73a1d50b227b9488dc28ee98847aa100',1,'stan::io::writer']]], + ['matrix_5flub',['matrix_lub',['../classstan_1_1io_1_1reader.html#a13209c64b39d9c7515fb561ec788a516',1,'stan::io::reader']]], + ['matrix_5flub_5fconstrain',['matrix_lub_constrain',['../classstan_1_1io_1_1reader.html#a9007b1739c9738d88347f499e9a39021',1,'stan::io::reader::matrix_lub_constrain(const TL lb, const TU ub, size_t m, size_t n)'],['../classstan_1_1io_1_1reader.html#a7b8a944a6d7ff2ea53cf7a3e78843306',1,'stan::io::reader::matrix_lub_constrain(const TL lb, const TU ub, size_t m, size_t n, T &lp)']]], + ['matrix_5flub_5funconstrain',['matrix_lub_unconstrain',['../classstan_1_1io_1_1writer.html#a0f4b5839e3bd701f2c586e7d31bb0dbf',1,'stan::io::writer']]], + ['matrix_5fnormal_5fprec_5flog',['matrix_normal_prec_log',['../namespacestan_1_1prob.html#a04ca61f93c3e75f12a7dafbbb2964069',1,'stan::prob::matrix_normal_prec_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_Mu, Eigen::Dynamic, Eigen::Dynamic > &Mu, const Eigen::Matrix< T_Sigma, Eigen::Dynamic, Eigen::Dynamic > &Sigma, const Eigen::Matrix< T_D, Eigen::Dynamic, Eigen::Dynamic > &D)'],['../namespacestan_1_1prob.html#a225aae36a6e9611cdba3b36e20225a5a',1,'stan::prob::matrix_normal_prec_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_Mu, Eigen::Dynamic, Eigen::Dynamic > &Mu, const Eigen::Matrix< T_Sigma, Eigen::Dynamic, Eigen::Dynamic > &Sigma, const Eigen::Matrix< T_D, Eigen::Dynamic, Eigen::Dynamic > &D)']]], + ['matrix_5fub',['matrix_ub',['../classstan_1_1io_1_1reader.html#a280b0c933f7dae06f472e56432b45489',1,'stan::io::reader']]], + ['matrix_5fub_5fconstrain',['matrix_ub_constrain',['../classstan_1_1io_1_1reader.html#af70a11c24ac7cfba146d0864a05dcf9a',1,'stan::io::reader::matrix_ub_constrain(const TU ub, size_t m, size_t n)'],['../classstan_1_1io_1_1reader.html#ace55576f9257795f986494e343c11978',1,'stan::io::reader::matrix_ub_constrain(const TU ub, size_t m, size_t n, T &lp)']]], + ['matrix_5fub_5funconstrain',['matrix_ub_unconstrain',['../classstan_1_1io_1_1writer.html#a098679782a22794d929d982a1f1a147b',1,'stan::io::writer']]], + ['matrix_5funconstrain',['matrix_unconstrain',['../classstan_1_1io_1_1writer.html#a1120b4bda9918cce7944b2b857bed5f9',1,'stan::io::writer']]], + ['matrix_5fvar_5fdecl',['matrix_var_decl',['../structstan_1_1gm_1_1matrix__var__decl.html#a80c7b9b96497a250e4b9861131e515aa',1,'stan::gm::matrix_var_decl::matrix_var_decl()'],['../structstan_1_1gm_1_1matrix__var__decl.html#a4a99b5bb963daaeba872633b7753ffff',1,'stan::gm::matrix_var_decl::matrix_var_decl(range const &range, expression const &M, expression const &N, std::string const &name, std::vector< expression > const &dims)']]], + ['max',['max',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#ab5052559ef909e48342d86185079a8f3',1,'std::numeric_limits< stan::agrad::fvar< T > >::max()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a133cb21b688f8be5f5d86b523d2848c1',1,'std::numeric_limits< stan::agrad::var >::max()'],['../namespacestan_1_1math.html#a86b6be1d580b3b5cf4b4f57546062352',1,'stan::math::max(const double a, const double b)'],['../namespacestan_1_1math.html#a5da0ef87756d3dbd20ca4ff5a3efa10d',1,'stan::math::max(const std::vector< int > &x)'],['../namespacestan_1_1math.html#acde414919e0e4dcfa72d565679819091',1,'stan::math::max(const std::vector< T > &x)'],['../namespacestan_1_1math.html#ae3f299773dc20e8305fc16df1be8d029',1,'stan::math::max(const Eigen::Matrix< T, R, C > &m)']]], + ['max_5fsize',['max_size',['../namespacestan.html#a8b2c79a3a686dcf90566be8492e1065d',1,'stan::max_size(const T1 &x1, const T2 &x2)'],['../namespacestan.html#ac5ca4bf16c3b5c453162473c67f844bb',1,'stan::max_size(const T1 &x1, const T2 &x2, const T3 &x3)'],['../namespacestan.html#afff0e381090b0d490dc3b23f3eaf8846',1,'stan::max_size(const T1 &x1, const T2 &x2, const T3 &x3, const T4 &x4)']]], + ['mcmc_5fwriter',['mcmc_writer',['../classstan_1_1io_1_1mcmc__writer.html#a6a688bb1b2851d68f7305cb97c750a2b',1,'stan::io::mcmc_writer']]], + ['mdivide_5fleft',['mdivide_left',['../namespacestan_1_1agrad.html#a2b41bf2c8372fd934837bcab95ea6218',1,'stan::agrad::mdivide_left(const Eigen::Matrix< fvar< T >, R1, C1 > &A, const Eigen::Matrix< fvar< T >, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#aa1da8d6fb0170dddd868c37b4ae0e243',1,'stan::agrad::mdivide_left(const Eigen::Matrix< double, R1, C1 > &A, const Eigen::Matrix< fvar< T >, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#a9c7cffeb1a3590e2bc9803e2b9b96e57',1,'stan::agrad::mdivide_left(const Eigen::Matrix< fvar< T >, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#a290e23ab6f9674cb1400b32a1cadd61b',1,'stan::agrad::mdivide_left(const Eigen::Matrix< var, R1, C1 > &A, const Eigen::Matrix< var, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#ad17f36acd5401a8f3d83410055cacd5b',1,'stan::agrad::mdivide_left(const Eigen::Matrix< var, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#a35f1d7800586ac5f5c1930627c2ed408',1,'stan::agrad::mdivide_left(const Eigen::Matrix< double, R1, C1 > &A, const Eigen::Matrix< var, R2, C2 > &b)'],['../namespacestan_1_1math.html#a7266758367e8260b2afbfaeea7d5b418',1,'stan::math::mdivide_left()']]], + ['mdivide_5fleft_5fldlt',['mdivide_left_ldlt',['../namespacestan_1_1agrad.html#a73fe08a0aed98a06f69afd7efdcf7e91',1,'stan::agrad::mdivide_left_ldlt(const stan::math::LDLT_factor< var, R1, C1 > &A, const Eigen::Matrix< var, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#aca6cefcad36a0a43763634d7e399192e',1,'stan::agrad::mdivide_left_ldlt(const stan::math::LDLT_factor< var, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#a2cd1fc34cc6a308373729f667a21a243',1,'stan::agrad::mdivide_left_ldlt(const stan::math::LDLT_factor< double, R1, C1 > &A, const Eigen::Matrix< var, R2, C2 > &b)'],['../namespacestan_1_1math.html#a978022fb9cb20fd35f6e9e89ab3bc871',1,'stan::math::mdivide_left_ldlt()']]], + ['mdivide_5fleft_5fspd',['mdivide_left_spd',['../namespacestan_1_1agrad.html#a20ea5c1fbce1ed4ad4d54fc8f2c558c2',1,'stan::agrad::mdivide_left_spd(const Eigen::Matrix< var, R1, C1 > &A, const Eigen::Matrix< var, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#a03fc1f8557646c3d1b11483a1f14c6de',1,'stan::agrad::mdivide_left_spd(const Eigen::Matrix< var, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#aec4a59ebe9eae939784d0a7e202bd7de',1,'stan::agrad::mdivide_left_spd(const Eigen::Matrix< double, R1, C1 > &A, const Eigen::Matrix< var, R2, C2 > &b)'],['../namespacestan_1_1math.html#a0c8c6e72f1cbf2b73008d4fc98de1abe',1,'stan::math::mdivide_left_spd()']]], + ['mdivide_5fleft_5ftri',['mdivide_left_tri',['../namespacestan_1_1agrad.html#a4cc1b5631c20f7a48b973d5ca0418c34',1,'stan::agrad::mdivide_left_tri(const Eigen::Matrix< var, R1, C1 > &A, const Eigen::Matrix< var, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#a97be1bb5da2a12a36c9d32235d59bd5f',1,'stan::agrad::mdivide_left_tri(const Eigen::Matrix< double, R1, C1 > &A, const Eigen::Matrix< var, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#aac856c62d730cb5880add59627d59d5a',1,'stan::agrad::mdivide_left_tri(const Eigen::Matrix< var, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)'],['../namespacestan_1_1math.html#ac9ffa799f8af2cd4941cbd2506bc4573',1,'stan::math::mdivide_left_tri(const Eigen::Matrix< T1, R1, C1 > &A, const Eigen::Matrix< T2, R2, C2 > &b)'],['../namespacestan_1_1math.html#a58dbd828faf06c2ef74152367f749ca4',1,'stan::math::mdivide_left_tri(const Eigen::Matrix< T, R1, C1 > &A)']]], + ['mdivide_5fleft_5ftri_5flow',['mdivide_left_tri_low',['../namespacestan_1_1agrad.html#a4976e3da1ade5b442fdf9a98ce657e1b',1,'stan::agrad::mdivide_left_tri_low(const Eigen::Matrix< fvar< T >, R1, C1 > &A, const Eigen::Matrix< fvar< T >, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#a4cae5cb645fe5bc960315f994d2cce24',1,'stan::agrad::mdivide_left_tri_low(const Eigen::Matrix< double, R1, C1 > &A, const Eigen::Matrix< fvar< T >, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#a88989bbd44ec90171c52d78cf99fa37f',1,'stan::agrad::mdivide_left_tri_low(const Eigen::Matrix< fvar< T >, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)'],['../namespacestan_1_1math.html#a199a9357715dff8b9a3bae8cc1bb4aa5',1,'stan::math::mdivide_left_tri_low(const Eigen::Matrix< T1, R1, C1 > &A, const Eigen::Matrix< T2, R2, C2 > &b)'],['../namespacestan_1_1math.html#ae8391d23da9e29f3420fdb89116e83cd',1,'stan::math::mdivide_left_tri_low(const Eigen::Matrix< T, R1, C1 > &A)']]], + ['mdivide_5fright',['mdivide_right',['../namespacestan_1_1agrad.html#a92e113c418aa00fb0b0f05de3421a377',1,'stan::agrad::mdivide_right(const Eigen::Matrix< fvar< T >, R1, C1 > &A, const Eigen::Matrix< fvar< T >, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#ab1bf56872a19067bf76e9e0ae0319ff3',1,'stan::agrad::mdivide_right(const Eigen::Matrix< fvar< T >, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#ad4d1ebb9e641da4b6d03b08eac67469c',1,'stan::agrad::mdivide_right(const Eigen::Matrix< double, R1, C1 > &A, const Eigen::Matrix< fvar< T >, R2, C2 > &b)'],['../namespacestan_1_1math.html#a5efba9dddcf77889b66c1210ba55cf5f',1,'stan::math::mdivide_right()']]], + ['mdivide_5fright_5fldlt',['mdivide_right_ldlt',['../namespacestan_1_1math.html#a68c862e90d97ea5d5552101b65978813',1,'stan::math::mdivide_right_ldlt(const Eigen::Matrix< T1, R1, C1 > &b, const stan::math::LDLT_factor< T2, R2, C2 > &A)'],['../namespacestan_1_1math.html#a01d77bf4121d56b8491092164d1523ce',1,'stan::math::mdivide_right_ldlt(const Eigen::Matrix< double, R1, C1 > &b, const stan::math::LDLT_factor< double, R2, C2 > &A)']]], + ['mdivide_5fright_5fspd',['mdivide_right_spd',['../namespacestan_1_1math.html#a5d6f32dd8adc4a9ffa28d63b62d4c90f',1,'stan::math']]], + ['mdivide_5fright_5ftri',['mdivide_right_tri',['../namespacestan_1_1math.html#ae158767243e09b91b9ba6cd366e7dab8',1,'stan::math']]], + ['mdivide_5fright_5ftri_5flow',['mdivide_right_tri_low',['../namespacestan_1_1agrad.html#ad91af5d6f2192ec14360aa9f9e70bfc0',1,'stan::agrad::mdivide_right_tri_low(const Eigen::Matrix< fvar< T >, R1, C1 > &A, const Eigen::Matrix< fvar< T >, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#a2dc33743ae5cee446bca0e9f0c18c1fa',1,'stan::agrad::mdivide_right_tri_low(const Eigen::Matrix< fvar< T >, R1, C1 > &A, const Eigen::Matrix< double, R2, C2 > &b)'],['../namespacestan_1_1agrad.html#a6f2d6e5dd89d2094f04d9a81cb8a6191',1,'stan::agrad::mdivide_right_tri_low(const Eigen::Matrix< double, R1, C1 > &A, const Eigen::Matrix< fvar< T >, R2, C2 > &b)'],['../namespacestan_1_1math.html#a09f35fbeab4d8ff311ce77d91492e26b',1,'stan::math::mdivide_right_tri_low()']]], + ['mean',['mean',['../classstan_1_1mcmc_1_1chains.html#a905c53a11c08a53404379096885674ac',1,'stan::mcmc::chains::mean(const int chain, const int index)'],['../classstan_1_1mcmc_1_1chains.html#a9549bed51ad7dac77a4b27b849768049',1,'stan::mcmc::chains::mean(const int index)'],['../classstan_1_1mcmc_1_1chains.html#a5587f727e87620b9f2e9477f7517c9fa',1,'stan::mcmc::chains::mean(const int chain, const std::string &name)'],['../classstan_1_1mcmc_1_1chains.html#ad53b31c4b7b3056d5e38469f3c58ed51',1,'stan::mcmc::chains::mean(const std::string &name)'],['../namespacestan_1_1math.html#a3443c4ac994b039a7f055c55c5afa8a3',1,'stan::math::mean(const std::vector< T > &v)'],['../namespacestan_1_1math.html#a8074c0041b93407c473fd26a7c45dc88',1,'stan::math::mean(const Eigen::Matrix< T, R, C > &m)']]], + ['member_5fvar_5fdecl_5fvisgen',['member_var_decl_visgen',['../structstan_1_1gm_1_1member__var__decl__visgen.html#a665f039f108df78a55e1ddf8651c6dca',1,'stan::gm::member_var_decl_visgen']]], + ['min',['min',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#ae238eb8551b8faa9ff191638541d48a6',1,'std::numeric_limits< stan::agrad::fvar< T > >::min()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a4442454f1562bcd4cd926cb45b5d16b9',1,'std::numeric_limits< stan::agrad::var >::min()'],['../namespacestan_1_1math.html#ab360c822174f211838f5979760c7e09e',1,'stan::math::min(const double a, const double b)'],['../namespacestan_1_1math.html#a3f076860549f63d55c0e4985dce78099',1,'stan::math::min(const std::vector< int > &x)'],['../namespacestan_1_1math.html#a9e9c3a01030d96fd4c8f28e2ed8d3d61',1,'stan::math::min(const std::vector< T > &x)'],['../namespacestan_1_1math.html#a86f2380e5c54a549e0f74ffd51204d33',1,'stan::math::min(const Eigen::Matrix< T, R, C > &m)']]], + ['minimize',['minimize',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a27a804ca4bbe7923b8913ab38a8693a6',1,'stan::optimization::BFGSMinimizer']]], + ['minus',['minus',['../namespacestan_1_1math.html#a87b343d6dc12982c2b76c453650c0797',1,'stan::math']]], + ['modeladaptor',['ModelAdaptor',['../classstan_1_1optimization_1_1_model_adaptor.html#a28c05023727eb49f55b51ec0dee8413e',1,'stan::optimization::ModelAdaptor']]], + ['modified_5fbessel_5ffirst_5fkind',['modified_bessel_first_kind',['../namespacestan_1_1agrad.html#af1e6f0609bef81a1832bd4c624350e6e',1,'stan::agrad::modified_bessel_first_kind(int v, const fvar< T > &z)'],['../namespacestan_1_1agrad.html#a4667276304c443e9bde5fb7218c56778',1,'stan::agrad::modified_bessel_first_kind(const int &v, const var &a)'],['../namespacestan_1_1math.html#acafecf14b103c7c17da33368d07b1565',1,'stan::math::modified_bessel_first_kind()']]], + ['modified_5fbessel_5fsecond_5fkind',['modified_bessel_second_kind',['../namespacestan_1_1agrad.html#a2af4019aee25cb289b88d3dc946eea77',1,'stan::agrad::modified_bessel_second_kind(int v, const fvar< T > &z)'],['../namespacestan_1_1agrad.html#a4a949984f1a537a77db66f4d4f15cfeb',1,'stan::agrad::modified_bessel_second_kind(const int &v, const var &a)'],['../namespacestan_1_1math.html#a72ce86f3db5478cad4666c9cf1d05a6e',1,'stan::math::modified_bessel_second_kind()']]], + ['multi_5fgp_5flog',['multi_gp_log',['../namespacestan_1_1prob.html#a9c3810ea429509d3fd4e9a435a73f11f',1,'stan::prob::multi_gp_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma, const Eigen::Matrix< T_w, Eigen::Dynamic, 1 > &w)'],['../namespacestan_1_1prob.html#a87858b89fe976714f66df92989fb0f03',1,'stan::prob::multi_gp_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &w)']]], + ['multi_5fnormal_5fcholesky_5flog',['multi_normal_cholesky_log',['../namespacestan_1_1prob.html#a01330a7c13ec8bb09a28b0983ef805c3',1,'stan::prob::multi_normal_cholesky_log(const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &L)'],['../namespacestan_1_1prob.html#adb8d48a2490b405c5f07ff6a316b4d3a',1,'stan::prob::multi_normal_cholesky_log(const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &L)'],['../namespacestan_1_1prob.html#aceed1445a3d25c5fc36dcf38ef115692',1,'stan::prob::multi_normal_cholesky_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &L)'],['../namespacestan_1_1prob.html#a59d30c1dea51119a3bc99519eca23f1f',1,'stan::prob::multi_normal_cholesky_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &L)']]], + ['multi_5fnormal_5flog',['multi_normal_log',['../namespacestan_1_1prob.html#a71e8ba5779457e6f532f39e89de717e4',1,'stan::prob::multi_normal_log(const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma)'],['../namespacestan_1_1prob.html#a627102d5b7ce3cf3dc6835cb1e6b3455',1,'stan::prob::multi_normal_log(const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma)'],['../namespacestan_1_1prob.html#a1be2baaf4bbbf9997816256e21fc849c',1,'stan::prob::multi_normal_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma)'],['../namespacestan_1_1prob.html#a5f7dfeb4f132811e2584b673f808396c',1,'stan::prob::multi_normal_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma)']]], + ['multi_5fnormal_5fprec_5flog',['multi_normal_prec_log',['../namespacestan_1_1prob.html#a3aa4c668766dc37248e6d5bd84eae338',1,'stan::prob::multi_normal_prec_log(const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma)'],['../namespacestan_1_1prob.html#a9d21551db0a50bd061cbf0147628a255',1,'stan::prob::multi_normal_prec_log(const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma)'],['../namespacestan_1_1prob.html#a45250c0ec42bb7278ced6275eed9ffa1',1,'stan::prob::multi_normal_prec_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma)'],['../namespacestan_1_1prob.html#a5478d2a990aa6b82b0911707659c1e50',1,'stan::prob::multi_normal_prec_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &y, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_covar, Eigen::Dynamic, Eigen::Dynamic > &Sigma)']]], + ['multi_5fnormal_5frng',['multi_normal_rng',['../namespacestan_1_1prob.html#a93eceb90a88d6432e3bda7c5e35db8e0',1,'stan::prob']]], + ['multi_5fstudent_5ft_5flog',['multi_student_t_log',['../namespacestan_1_1prob.html#a48b71448bd4100f9dbbf884c9fee4de6',1,'stan::prob::multi_student_t_log(const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const T_dof &nu, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_scale, Eigen::Dynamic, Eigen::Dynamic > &Sigma)'],['../namespacestan_1_1prob.html#ac5c541f4309051587f35a5187ef5165c',1,'stan::prob::multi_student_t_log(const Eigen::Matrix< T_y, Eigen::Dynamic, 1 > &y, const T_dof &nu, const Eigen::Matrix< T_loc, Eigen::Dynamic, 1 > &mu, const Eigen::Matrix< T_scale, Eigen::Dynamic, Eigen::Dynamic > &Sigma)']]], + ['multi_5fstudent_5ft_5frng',['multi_student_t_rng',['../namespacestan_1_1prob.html#ab61ba841eb4bd76a7df2975e18f0b025',1,'stan::prob']]], + ['multinomial_5flog',['multinomial_log',['../namespacestan_1_1prob.html#a30f2c82429f15f40ab59b038f35d29f4',1,'stan::prob::multinomial_log(const std::vector< int > &ns, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta)'],['../namespacestan_1_1prob.html#aee5c8f7cbbbc28455bae7c9f6b6bf2f8',1,'stan::prob::multinomial_log(const std::vector< int > &ns, const Eigen::Matrix< T_prob, Eigen::Dynamic, 1 > &theta)']]], + ['multinomial_5frng',['multinomial_rng',['../namespacestan_1_1prob.html#a7d4d3be39750d795653ce0a8ee25e065',1,'stan::prob']]], + ['multiply',['multiply',['../namespacestan_1_1agrad.html#af5dfb2569a8f7f2f95830d0f0bb5bd40',1,'stan::agrad::multiply(const Eigen::Matrix< fvar< T >, R1, C1 > &m, const fvar< T > &c)'],['../namespacestan_1_1agrad.html#a148bf99bd72fc1ef2e7fb410837bda03',1,'stan::agrad::multiply(const Eigen::Matrix< fvar< T >, R2, C2 > &m, const double c)'],['../namespacestan_1_1agrad.html#ad8c423f41aa11c693cdeff32ec369021',1,'stan::agrad::multiply(const Eigen::Matrix< double, R1, C1 > &m, const fvar< T > &c)'],['../namespacestan_1_1agrad.html#a1bac78b32103f6336d645dcc8e601e1c',1,'stan::agrad::multiply(const fvar< T > &c, const Eigen::Matrix< fvar< T >, R1, C1 > &m)'],['../namespacestan_1_1agrad.html#a5ab5375c22320ffabc25b59bf372b787',1,'stan::agrad::multiply(const double c, const Eigen::Matrix< fvar< T >, R1, C1 > &m)'],['../namespacestan_1_1agrad.html#af88e47add7862504f83f82f6b209ef8d',1,'stan::agrad::multiply(const fvar< T > &c, const Eigen::Matrix< double, R1, C1 > &m)'],['../namespacestan_1_1agrad.html#a19d042d141225843b96006e12359677c',1,'stan::agrad::multiply(const Eigen::Matrix< fvar< T >, R1, C1 > &m1, const Eigen::Matrix< fvar< T >, R2, C2 > &m2)'],['../namespacestan_1_1agrad.html#a467103932d1ea2c9717b85872a3ea60b',1,'stan::agrad::multiply(const Eigen::Matrix< fvar< T >, R1, C1 > &m1, const Eigen::Matrix< double, R2, C2 > &m2)'],['../namespacestan_1_1agrad.html#adbfc25a42aa3f524ea845e592c7ccd2b',1,'stan::agrad::multiply(const Eigen::Matrix< double, R1, C1 > &m1, const Eigen::Matrix< fvar< T >, R2, C2 > &m2)'],['../namespacestan_1_1agrad.html#a115c9006f06661eef4c034d1a2f885dc',1,'stan::agrad::multiply(const Eigen::Matrix< fvar< T >, 1, C1 > &rv, const Eigen::Matrix< fvar< T >, R2, 1 > &v)'],['../namespacestan_1_1agrad.html#a5a6f66eeddc4fcfeced24f4a710fdb97',1,'stan::agrad::multiply(const Eigen::Matrix< fvar< T >, 1, C1 > &rv, const Eigen::Matrix< double, R2, 1 > &v)'],['../namespacestan_1_1agrad.html#af00532cd123eac94a193d0c76e9d58ee',1,'stan::agrad::multiply(const Eigen::Matrix< double, 1, C1 > &rv, const Eigen::Matrix< fvar< T >, R2, 1 > &v)'],['../namespacestan_1_1agrad.html#a57ea43d861a571f86937062eda4fa5af',1,'stan::agrad::multiply(const T1 &v, const T2 &c)'],['../namespacestan_1_1agrad.html#a26ac66272ba16ad14daa9f4952a16454',1,'stan::agrad::multiply(const T1 &c, const Eigen::Matrix< T2, R2, C2 > &m)'],['../namespacestan_1_1agrad.html#a5eb3c1069fc2d98aa42b3b0308bd9c60',1,'stan::agrad::multiply(const Eigen::Matrix< T1, R1, C1 > &m, const T2 &c)'],['../namespacestan_1_1agrad.html#af029b6f77d642a6278df7fced3a1ec12',1,'stan::agrad::multiply(const Eigen::Matrix< T1, R1, C1 > &m1, const Eigen::Matrix< T2, R2, C2 > &m2)'],['../namespacestan_1_1agrad.html#a746363e825961a19e0edb846c0d420cc',1,'stan::agrad::multiply(const Eigen::Matrix< T1, 1, C1 > &rv, const Eigen::Matrix< T2, R2, 1 > &v)'],['../namespacestan_1_1math.html#a919d4a6495c489841df3d0423200b147',1,'stan::math::multiply(const Eigen::Matrix< double, R, C > &m, T c)'],['../namespacestan_1_1math.html#a5a2b6dbfb5543b73dac8496091745ec1',1,'stan::math::multiply(T c, const Eigen::Matrix< double, R, C > &m)'],['../namespacestan_1_1math.html#a7c72cdca253e0230e0dbd19400781b5c',1,'stan::math::multiply(const Eigen::Matrix< double, R1, C1 > &m1, const Eigen::Matrix< double, R2, C2 > &m2)'],['../namespacestan_1_1math.html#a6e67698775aaac248efa49b646ca2a51',1,'stan::math::multiply(const Eigen::Matrix< double, 1, C1 > &rv, const Eigen::Matrix< double, R2, 1 > &v)']]], + ['multiply_5flog',['multiply_log',['../namespacestan_1_1agrad.html#a3d696a83dc04e19d84ea2fb6a0cfa61a',1,'stan::agrad::multiply_log(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#ad21e093d0619e2099f38902925cc292d',1,'stan::agrad::multiply_log(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a60b90b0dce0a75a73c63673f189ff9aa',1,'stan::agrad::multiply_log(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#a0e93c32718fc1d0762b3543a246f00ec',1,'stan::agrad::multiply_log(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#a041ccf4847a3f896904c7baeaefddb34',1,'stan::agrad::multiply_log(const var &a, const double b)'],['../namespacestan_1_1agrad.html#aca18b1e8909315b63cc1a98f4505a0dd',1,'stan::agrad::multiply_log(const double a, const var &b)'],['../namespacestan_1_1math.html#ab530a1792bc901bb6ade34ef3d9ef8b3',1,'stan::math::multiply_log()']]], + ['multiply_5flower_5ftri_5fself_5ftranspose',['multiply_lower_tri_self_transpose',['../namespacestan_1_1agrad.html#a6635a0f0dfb1767a1930f1ff1984098a',1,'stan::agrad::multiply_lower_tri_self_transpose(const Eigen::Matrix< fvar< T >, R, C > &m)'],['../namespacestan_1_1agrad.html#a0e6a55fe5d7057ad569ec10edfe8187a',1,'stan::agrad::multiply_lower_tri_self_transpose(const matrix_v &L)'],['../namespacestan_1_1math.html#a3c0c953951f141b35277fe2308777cff',1,'stan::math::multiply_lower_tri_self_transpose()']]] +]; diff --git a/doc/api/html/search/functions_6e.html b/doc/api/html/search/functions_6e.html new file mode 100644 index 00000000000..d734dd07e7d --- /dev/null +++ b/doc/api/html/search/functions_6e.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/functions_6e.js b/doc/api/html/search/functions_6e.js new file mode 100644 index 00000000000..ce230c80bf9 --- /dev/null +++ b/doc/api/html/search/functions_6e.js @@ -0,0 +1,34 @@ +var searchData= +[ + ['name',['name',['../classstan_1_1gm_1_1argument.html#a95e720fb0f0dda0b2be4201274fa47c8',1,'stan::gm::argument::name()'],['../structstan_1_1gm_1_1type__name.html#abf38a6f1fbe6d34e8fc4495423a5cd30',1,'stan::gm::type_name::name()'],['../structstan_1_1gm_1_1type__name_3_01int_01_4.html#a467a9397f434235e89512bf3164f2c53',1,'stan::gm::type_name< int >::name()'],['../structstan_1_1gm_1_1type__name_3_01unsigned_01int_01_4.html#af18249277270ae33f01976e0c8246736',1,'stan::gm::type_name< unsigned int >::name()'],['../structstan_1_1gm_1_1type__name_3_01double_01_4.html#a7acfdb1474ab32c35fb8f67a4612c611',1,'stan::gm::type_name< double >::name()'],['../structstan_1_1gm_1_1type__name_3_01bool_01_4.html#a01b4d6b1873e3dabe9186193558d3e4a',1,'stan::gm::type_name< bool >::name()'],['../structstan_1_1gm_1_1type__name_3_01std_1_1string_01_4.html#a06316042d2aa143497f3306752d5bf14',1,'stan::gm::type_name< std::string >::name()'],['../structstan_1_1gm_1_1var__decl.html#a6df298e1c38d35a2fce94b5513df015b',1,'stan::gm::var_decl::name()'],['../classstan_1_1io_1_1dump__reader.html#aed540ae1e798ad34757a2a66c35ad054',1,'stan::io::dump_reader::name()'],['../classstan_1_1mcmc_1_1base__mcmc.html#a999c963237aa4af863b691f1843b25bc',1,'stan::mcmc::base_mcmc::name()']]], + ['name_5fvis',['name_vis',['../structstan_1_1gm_1_1name__vis.html#a3d6b32de01cd222ea3b016200ede6ed1',1,'stan::gm::name_vis']]], + ['names_5fi',['names_i',['../classstan_1_1io_1_1dump.html#a965e639a5884ffd40d3849c8a706e145',1,'stan::io::dump::names_i()'],['../classstan_1_1io_1_1var__context.html#a2b1417a3a4b012539392eb6f44e8f059',1,'stan::io::var_context::names_i()']]], + ['names_5fr',['names_r',['../classstan_1_1io_1_1dump.html#a4c287f947ed4205be9115f8d4dbffb0d',1,'stan::io::dump::names_r()'],['../classstan_1_1io_1_1var__context.html#a9161afdc65cf035209fcb3da96f3affe',1,'stan::io::var_context::names_r()']]], + ['neg_5fbinomial_5fccdf_5flog',['neg_binomial_ccdf_log',['../namespacestan_1_1prob.html#a6eb2a050c9854f16d47c8a03d16e424d',1,'stan::prob']]], + ['neg_5fbinomial_5fcdf',['neg_binomial_cdf',['../namespacestan_1_1prob.html#a2df22df9c6b60e308e4ccf0b692b5242',1,'stan::prob']]], + ['neg_5fbinomial_5fcdf_5flog',['neg_binomial_cdf_log',['../namespacestan_1_1prob.html#a5c1a6f565a252ab38ef3165fa2d6a7e1',1,'stan::prob']]], + ['neg_5fbinomial_5flog',['neg_binomial_log',['../namespacestan_1_1prob.html#a223eba2920bbf00ffdce87cd9a385d64',1,'stan::prob::neg_binomial_log(const T_n &n, const T_shape &alpha, const T_inv_scale &beta)'],['../namespacestan_1_1prob.html#abb46acd84fce88aa36198b16cc54deae',1,'stan::prob::neg_binomial_log(const T_n &n, const T_shape &alpha, const T_inv_scale &beta)']]], + ['neg_5fbinomial_5frng',['neg_binomial_rng',['../namespacestan_1_1prob.html#a8c1d402a1dd528a63c0a68d63e809644',1,'stan::prob']]], + ['negative_5finfinity',['negative_infinity',['../namespacestan_1_1math.html#a34bffe91b7a24cb29bd69cb60814c39e',1,'stan::math']]], + ['nesterovgradient',['NesterovGradient',['../classstan_1_1optimization_1_1_nesterov_gradient.html#a185bdd404b884473cf22ad75a9b98ede',1,'stan::optimization::NesterovGradient']]], + ['newline',['newline',['../classstan_1_1io_1_1csv__writer.html#a676de0a0f10ef649af9dd81b1b91afab',1,'stan::io::csv_writer']]], + ['newton_5fstep',['newton_step',['../namespacestan_1_1optimization.html#a96fbc01564bc465d164199b41891be0d',1,'stan::optimization']]], + ['next',['next',['../classstan_1_1io_1_1dump__reader.html#aed46c1062b3a19c22a7440b72f1c8ffd',1,'stan::io::dump_reader']]], + ['next_5findex',['next_index',['../print_8hpp.html#ab54368a8bca76f33372859602ca77797',1,'print.hpp']]], + ['nonbasic_5fvalidate',['nonbasic_validate',['../structstan_1_1gm_1_1validate__var__decl__visgen.html#a3008b1b4caf900e42f94e2517c874c8f',1,'stan::gm::validate_var_decl_visgen']]], + ['normal_5fccdf_5flog',['normal_ccdf_log',['../namespacestan_1_1prob.html#a02b0750cf65f06ac78d448731a6e2dc9',1,'stan::prob']]], + ['normal_5fcdf',['normal_cdf',['../namespacestan_1_1prob.html#a886f9e64bad2382679b935d90b527985',1,'stan::prob']]], + ['normal_5fcdf_5flog',['normal_cdf_log',['../namespacestan_1_1prob.html#a44b5ec88e8620ed6ba61bd58bb0fcab5',1,'stan::prob']]], + ['normal_5flog',['normal_log',['../namespacestan_1_1prob.html#ad99bbf0b29a582cc76394c30f23db536',1,'stan::prob::normal_log(const T_y &y, const T_loc &mu, const T_scale &sigma)'],['../namespacestan_1_1prob.html#a4f3e49fd8c69e4f3bfe5b3e74fed912b',1,'stan::prob::normal_log(const T_y &y, const T_loc &mu, const T_scale &sigma)']]], + ['normal_5frng',['normal_rng',['../namespacestan_1_1prob.html#a85cb8a1ee8a40b7545946a979e249dd1',1,'stan::prob']]], + ['not_5fa_5fnumber',['not_a_number',['../namespacestan_1_1math.html#a381493bccc58bd993d797a2a5458c486',1,'stan::math']]], + ['note',['note',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#addb17a450063c4caaa85de952927513c',1,'stan::optimization::BFGSMinimizer']]], + ['num_5fchains',['num_chains',['../classstan_1_1mcmc_1_1chains.html#aa42993978c341f420c38776862f6e0f4',1,'stan::mcmc::chains']]], + ['num_5fdims',['num_dims',['../structstan_1_1gm_1_1expr__type.html#abcd5fe81541025ae63595502b2db4673',1,'stan::gm::expr_type']]], + ['num_5fkept_5fsamples',['num_kept_samples',['../classstan_1_1mcmc_1_1chains.html#a174e16464afa282c23f88651edcf563a',1,'stan::mcmc::chains::num_kept_samples(const int chain)'],['../classstan_1_1mcmc_1_1chains.html#a51ee052b484f3810c4efeed3b7a55812',1,'stan::mcmc::chains::num_kept_samples()']]], + ['num_5fparams',['num_params',['../classstan_1_1mcmc_1_1chains.html#a69301dc29ebf0a2e1049c3a90be229b2',1,'stan::mcmc::chains']]], + ['num_5fparams_5fi',['num_params_i',['../classstan_1_1model_1_1prob__grad.html#a6c758a7e401926bfb453b6c1e0865e74',1,'stan::model::prob_grad']]], + ['num_5fparams_5fr',['num_params_r',['../classstan_1_1model_1_1prob__grad.html#af369b6f368d9a19090f08ed1deeab5be',1,'stan::model::prob_grad']]], + ['num_5fpromotions',['num_promotions',['../classstan_1_1gm_1_1function__signatures.html#a9a6ad50ac8bbc4a95db624019121925d',1,'stan::gm::function_signatures']]], + ['num_5fsamples',['num_samples',['../classstan_1_1mcmc_1_1chains.html#a371c0c26bc0b62b1d1b33019fc66b66c',1,'stan::mcmc::chains::num_samples(const int chain)'],['../classstan_1_1mcmc_1_1chains.html#ae997b88b5d2aa188453748152b1b6c69',1,'stan::mcmc::chains::num_samples()'],['../classstan_1_1prob_1_1welford__covar__estimator.html#aa76e24fffa5e0bf733aafbaab942166e',1,'stan::prob::welford_covar_estimator::num_samples()'],['../classstan_1_1prob_1_1welford__var__estimator.html#aaead1fea2bb10ec78761a7544f47b9ed',1,'stan::prob::welford_var_estimator::num_samples()']]] +]; diff --git a/doc/api/html/search/functions_6f.html b/doc/api/html/search/functions_6f.html new file mode 100644 index 00000000000..222f0f8362f --- /dev/null +++ b/doc/api/html/search/functions_6f.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/functions_6f.js b/doc/api/html/search/functions_6f.js new file mode 100644 index 00000000000..cac8a0dd140 --- /dev/null +++ b/doc/api/html/search/functions_6f.js @@ -0,0 +1,49 @@ +var searchData= +[ + ['op_5fddv_5fvari',['op_ddv_vari',['../classstan_1_1agrad_1_1op__ddv__vari.html#a0dc6f08e56b65cd270dcc2f7939dacef',1,'stan::agrad::op_ddv_vari']]], + ['op_5fdv_5fvari',['op_dv_vari',['../classstan_1_1agrad_1_1op__dv__vari.html#a25707782c6db0f4cd1fd99418e660eff',1,'stan::agrad::op_dv_vari']]], + ['op_5fdvd_5fvari',['op_dvd_vari',['../classstan_1_1agrad_1_1op__dvd__vari.html#aea81045cbb7574359c547974c1720745',1,'stan::agrad::op_dvd_vari']]], + ['op_5fdvv_5fvari',['op_dvv_vari',['../classstan_1_1agrad_1_1op__dvv__vari.html#a459bde977de6b15f8a9d045ca41c95d1',1,'stan::agrad::op_dvv_vari']]], + ['op_5fmatrix_5fvari',['op_matrix_vari',['../classstan_1_1agrad_1_1op__matrix__vari.html#a64359f048df8adbd625d3cf5e2f9f4d0',1,'stan::agrad::op_matrix_vari']]], + ['op_5fv_5fvari',['op_v_vari',['../classstan_1_1agrad_1_1op__v__vari.html#a9c8f4f7c998f9e01b7b062845dd02826',1,'stan::agrad::op_v_vari']]], + ['op_5fvd_5fvari',['op_vd_vari',['../classstan_1_1agrad_1_1op__vd__vari.html#a90dab6a33453cab385392989faed72a6',1,'stan::agrad::op_vd_vari']]], + ['op_5fvdd_5fvari',['op_vdd_vari',['../classstan_1_1agrad_1_1op__vdd__vari.html#a422712bd9ca49f7295d63efd9db459e1',1,'stan::agrad::op_vdd_vari']]], + ['op_5fvdv_5fvari',['op_vdv_vari',['../classstan_1_1agrad_1_1op__vdv__vari.html#a887420e658b3a11db1a8087f4a86cff4',1,'stan::agrad::op_vdv_vari']]], + ['op_5fvector_5fvari',['op_vector_vari',['../classstan_1_1agrad_1_1op__vector__vari.html#a6171e0b248aae2c5a9ec3d056567ac49',1,'stan::agrad::op_vector_vari']]], + ['op_5fvv_5fvari',['op_vv_vari',['../classstan_1_1agrad_1_1op__vv__vari.html#a45481fc072e8b4792641ed211cb26431',1,'stan::agrad::op_vv_vari']]], + ['op_5fvvd_5fvari',['op_vvd_vari',['../classstan_1_1agrad_1_1op__vvd__vari.html#a889fcc9443f84a8605049ca4cbe3fbe0',1,'stan::agrad::op_vvd_vari']]], + ['op_5fvvv_5fvari',['op_vvv_vari',['../classstan_1_1agrad_1_1op__vvv__vari.html#aab31cc197ce983a6694f238551561dad',1,'stan::agrad::op_vvv_vari']]], + ['operandsandpartials',['OperandsAndPartials',['../structstan_1_1agrad_1_1_operands_and_partials.html#aecabbb142f41aae42881a3b847b4f4e1',1,'stan::agrad::OperandsAndPartials']]], + ['operator_20delete',['operator delete',['../classstan_1_1agrad_1_1chainable.html#ad1ea1170b887c7730a437a9e831e8c54',1,'stan::agrad::chainable']]], + ['operator_20new',['operator new',['../classstan_1_1agrad_1_1vari.html#a1722e422e33d131e88ae9ca351b9e86c',1,'stan::agrad::vari::operator new()'],['../classstan_1_1agrad_1_1chainable.html#ae78a7b4dfaf5f07c01f3d08f663caf06',1,'stan::agrad::chainable::operator new()']]], + ['operator_21',['operator!',['../namespacestan_1_1agrad.html#ae9d3324d88a532f80e9451dd9f9c5a83',1,'stan::agrad']]], + ['operator_21_3d',['operator!=',['../structstan_1_1gm_1_1expr__type.html#abecd19ebe1a5e0a7bb382c86b0c47477',1,'stan::gm::expr_type::operator!=()'],['../namespacestan_1_1agrad.html#a63631a963a524e14c26616a546e75ad7',1,'stan::agrad::operator!=(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#a772cb5941614d15e4796e4e28c7b3626',1,'stan::agrad::operator!=(const var &a, const double &b)'],['../namespacestan_1_1agrad.html#a0896d4e6a953397b0421f25b1583bb66',1,'stan::agrad::operator!=(const double &a, const var &b)'],['../namespacestan_1_1agrad.html#abc2a6a3826a8c40963c2c43de787c6d9',1,'stan::agrad::operator!=(const fvar< T > &x, const fvar< T > &y)'],['../namespacestan_1_1agrad.html#a4d2b7b3282b4dc8853c2a5821668c058',1,'stan::agrad::operator!=(const fvar< T > &x, double y)'],['../namespacestan_1_1agrad.html#a7a0281d5047cfc8842455774716a1c68',1,'stan::agrad::operator!=(double x, const fvar< T > &y)'],['../namespacestan_1_1agrad.html#a7bb28051fbfb4acffa58bc94a78fcf20',1,'stan::agrad::operator!=(const var &a, const double b)'],['../namespacestan_1_1agrad.html#a3068e402162a891ca257dc2bd55fe47e',1,'stan::agrad::operator!=(const double a, const var &b)']]], + ['operator_28_29',['operator()',['../structstan_1_1gm_1_1expression__type__vis.html#ae101d363740a76d72e1b458d8de4aad1',1,'stan::gm::expression_type_vis::operator()(const nil &e) const '],['../structstan_1_1gm_1_1expression__type__vis.html#ae84dca1e40e9af8689e452fb46d9e032',1,'stan::gm::expression_type_vis::operator()(const int_literal &e) const '],['../structstan_1_1gm_1_1expression__type__vis.html#aab6cc33ac330a276c599d390be4edec8',1,'stan::gm::expression_type_vis::operator()(const double_literal &e) const '],['../structstan_1_1gm_1_1expression__type__vis.html#af8b390d2239e791d7411cee8f8992e03',1,'stan::gm::expression_type_vis::operator()(const array_literal &e) const '],['../structstan_1_1gm_1_1expression__type__vis.html#a18ca391f31a93fd1c0346a29a054dfbe',1,'stan::gm::expression_type_vis::operator()(const variable &e) const '],['../structstan_1_1gm_1_1expression__type__vis.html#adccaf0a45107f4ce7fd01c3fe9a7be6e',1,'stan::gm::expression_type_vis::operator()(const fun &e) const '],['../structstan_1_1gm_1_1expression__type__vis.html#a00466288bc82f8e6e65913dffab469f9',1,'stan::gm::expression_type_vis::operator()(const index_op &e) const '],['../structstan_1_1gm_1_1expression__type__vis.html#a3dfc663ba0cac644c99f76a3becc48e2',1,'stan::gm::expression_type_vis::operator()(const binary_op &e) const '],['../structstan_1_1gm_1_1expression__type__vis.html#a526a9e5db2b2e67f80f37d3c157e691e',1,'stan::gm::expression_type_vis::operator()(const unary_op &e) const '],['../structstan_1_1gm_1_1is__nil__op.html#a08ed9c0b2717cc75d3c76742a4e4e473',1,'stan::gm::is_nil_op::operator()(const nil &x) const '],['../structstan_1_1gm_1_1is__nil__op.html#a8d9976b143d73fa3a7781413aa55b346',1,'stan::gm::is_nil_op::operator()(const int_literal &x) const '],['../structstan_1_1gm_1_1is__nil__op.html#a1779f980df65958d9302c441dd9ec6fd',1,'stan::gm::is_nil_op::operator()(const double_literal &x) const '],['../structstan_1_1gm_1_1is__nil__op.html#a718054de1e6a5991154f4de24da3e43c',1,'stan::gm::is_nil_op::operator()(const array_literal &x) const '],['../structstan_1_1gm_1_1is__nil__op.html#a3297c2fa3f7b613ecef9f81f3cac26f4',1,'stan::gm::is_nil_op::operator()(const variable &x) const '],['../structstan_1_1gm_1_1is__nil__op.html#a5e2a04a8705c487b2b58bc48acb564d0',1,'stan::gm::is_nil_op::operator()(const fun &x) const '],['../structstan_1_1gm_1_1is__nil__op.html#a4fed00e3746cf933d44c1451091ff940',1,'stan::gm::is_nil_op::operator()(const index_op &x) const '],['../structstan_1_1gm_1_1is__nil__op.html#a5e6feff96929c5ff3d8aed77b1aa4775',1,'stan::gm::is_nil_op::operator()(const binary_op &x) const '],['../structstan_1_1gm_1_1is__nil__op.html#af5bcccdf1f78faeffbe7217ac2cc51da',1,'stan::gm::is_nil_op::operator()(const unary_op &x) const '],['../structstan_1_1gm_1_1name__vis.html#a77a99ecd9081380c63ef8611973c4764',1,'stan::gm::name_vis::operator()(const nil &x) const '],['../structstan_1_1gm_1_1name__vis.html#a06e7c65a2fc7f371027db2b4c6ce2076',1,'stan::gm::name_vis::operator()(const int_var_decl &x) const '],['../structstan_1_1gm_1_1name__vis.html#ad621523ffc5f454eddf4b9bedfe04445',1,'stan::gm::name_vis::operator()(const double_var_decl &x) const '],['../structstan_1_1gm_1_1name__vis.html#abd9e7de4bd05940079937ea1c8c30ef4',1,'stan::gm::name_vis::operator()(const vector_var_decl &x) const '],['../structstan_1_1gm_1_1name__vis.html#aac0f822ac237b665c3da17927a8942d1',1,'stan::gm::name_vis::operator()(const row_vector_var_decl &x) const '],['../structstan_1_1gm_1_1name__vis.html#ac40f17c0184a5aa7f62cb74c7905fcca',1,'stan::gm::name_vis::operator()(const matrix_var_decl &x) const '],['../structstan_1_1gm_1_1name__vis.html#afb1ee17045f456b5f078fc31e80b4a04',1,'stan::gm::name_vis::operator()(const simplex_var_decl &x) const '],['../structstan_1_1gm_1_1name__vis.html#a54987fdf17b92c69a422b7fb2737dd6c',1,'stan::gm::name_vis::operator()(const unit_vector_var_decl &x) const '],['../structstan_1_1gm_1_1name__vis.html#aa01c0297fecee56aa965f2c5e1f4855f',1,'stan::gm::name_vis::operator()(const ordered_var_decl &x) const '],['../structstan_1_1gm_1_1name__vis.html#abc29cfc00dd904d37af4ae409fc3f405',1,'stan::gm::name_vis::operator()(const positive_ordered_var_decl &x) const '],['../structstan_1_1gm_1_1name__vis.html#ad4cb7341a3374c2edcb8ed0bf5d87900',1,'stan::gm::name_vis::operator()(const cholesky_factor_var_decl &x) const '],['../structstan_1_1gm_1_1name__vis.html#a6be1389d6fb96e624f542c63a8afe1ce',1,'stan::gm::name_vis::operator()(const cov_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1name__vis.html#aa79a10dd8b0b0c89677836c378beae5e',1,'stan::gm::name_vis::operator()(const corr_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1contains__var.html#abd731c09e08561b635b0ccd4a9075502',1,'stan::gm::contains_var::operator()(const nil &e) const '],['../structstan_1_1gm_1_1contains__var.html#aa14c77d41a64da0038ce5574a1b1195c',1,'stan::gm::contains_var::operator()(const int_literal &e) const '],['../structstan_1_1gm_1_1contains__var.html#a3faac1c9345f3db54478636846d97522',1,'stan::gm::contains_var::operator()(const double_literal &e) const '],['../structstan_1_1gm_1_1contains__var.html#a6d21c8096ca0fbf664963be1157c33cd',1,'stan::gm::contains_var::operator()(const array_literal &e) const '],['../structstan_1_1gm_1_1contains__var.html#ae8586b023ba16f5160d0fa861d7ddbc9',1,'stan::gm::contains_var::operator()(const variable &e) const '],['../structstan_1_1gm_1_1contains__var.html#a6899ad69964d75a4f226c9e4fcf45b5b',1,'stan::gm::contains_var::operator()(const fun &e) const '],['../structstan_1_1gm_1_1contains__var.html#adb25dda5b8d245c3aa67ce6baca5baf4',1,'stan::gm::contains_var::operator()(const index_op &e) const '],['../structstan_1_1gm_1_1contains__var.html#a2552f6617b18df1ae1590fa66a8a9dc8',1,'stan::gm::contains_var::operator()(const binary_op &e) const '],['../structstan_1_1gm_1_1contains__var.html#a072b336abd0018f97f342d55fb75a116',1,'stan::gm::contains_var::operator()(const unary_op &e) const '],['../structstan_1_1gm_1_1contains__nonparam__var.html#ae3faaa613f42c8cb8ac24a521e156e8d',1,'stan::gm::contains_nonparam_var::operator()(const nil &e) const '],['../structstan_1_1gm_1_1contains__nonparam__var.html#a60f21f3f6613845cc38688be1d2d9934',1,'stan::gm::contains_nonparam_var::operator()(const int_literal &e) const '],['../structstan_1_1gm_1_1contains__nonparam__var.html#ae434f920314720d08a7fd840c2b2697b',1,'stan::gm::contains_nonparam_var::operator()(const double_literal &e) const '],['../structstan_1_1gm_1_1contains__nonparam__var.html#a01e37e1af206e136e912ed2d2962f105',1,'stan::gm::contains_nonparam_var::operator()(const array_literal &e) const '],['../structstan_1_1gm_1_1contains__nonparam__var.html#a44d42494dd1eb8798afa4a569e3c638f',1,'stan::gm::contains_nonparam_var::operator()(const variable &e) const '],['../structstan_1_1gm_1_1contains__nonparam__var.html#a4cc5cac2f665fc3bd5b2b200508a936c',1,'stan::gm::contains_nonparam_var::operator()(const fun &e) const '],['../structstan_1_1gm_1_1contains__nonparam__var.html#ac09ff2eee4dc1412b2f7919c1726dd28',1,'stan::gm::contains_nonparam_var::operator()(const index_op &e) const '],['../structstan_1_1gm_1_1contains__nonparam__var.html#a8f62d373bb553ecde42728cbccf5abc1',1,'stan::gm::contains_nonparam_var::operator()(const binary_op &e) const '],['../structstan_1_1gm_1_1contains__nonparam__var.html#a9e95a4a6800ad32f799d8b8eb99c7d53',1,'stan::gm::contains_nonparam_var::operator()(const unary_op &e) const '],['../structstan_1_1gm_1_1expression__visgen.html#aab15972d43af74f77cf26c2c2fec82bf',1,'stan::gm::expression_visgen::operator()(nil const &) const '],['../structstan_1_1gm_1_1expression__visgen.html#a09af83f6b3b1f38ad7ff4964fb6aa4a9',1,'stan::gm::expression_visgen::operator()(const int_literal &n) const '],['../structstan_1_1gm_1_1expression__visgen.html#a63098914d92705be895c57e4adef150f',1,'stan::gm::expression_visgen::operator()(const double_literal &x) const '],['../structstan_1_1gm_1_1expression__visgen.html#a1d09589dc5a9b6e3b8d83c6ad2b69935',1,'stan::gm::expression_visgen::operator()(const array_literal &x) const '],['../structstan_1_1gm_1_1expression__visgen.html#a54590d7ff6be63a4b8fe1f91f04261c5',1,'stan::gm::expression_visgen::operator()(const variable &v) const '],['../structstan_1_1gm_1_1expression__visgen.html#a64a5ba8f9ca3ec6ebc78e25946dbe03d',1,'stan::gm::expression_visgen::operator()(int n) const '],['../structstan_1_1gm_1_1expression__visgen.html#afff24140ddd6164642eaac2d11a029a8',1,'stan::gm::expression_visgen::operator()(double x) const '],['../structstan_1_1gm_1_1expression__visgen.html#a20fa0b87d91d4c30a0255b44bb47db06',1,'stan::gm::expression_visgen::operator()(const std::string &x) const '],['../structstan_1_1gm_1_1expression__visgen.html#aa4686c19b616c8c7381b53a1c834bebb',1,'stan::gm::expression_visgen::operator()(const index_op &x) const '],['../structstan_1_1gm_1_1expression__visgen.html#ac6ae9b2a5dae07545dfcc59a295e980f',1,'stan::gm::expression_visgen::operator()(const fun &fx) const '],['../structstan_1_1gm_1_1expression__visgen.html#a7d647894403afdd5dbd0cfa369b3a9fd',1,'stan::gm::expression_visgen::operator()(const binary_op &expr) const '],['../structstan_1_1gm_1_1expression__visgen.html#a031a4d53347d39e110eb3c1d20159dd2',1,'stan::gm::expression_visgen::operator()(const unary_op &expr) const '],['../structstan_1_1gm_1_1printable__visgen.html#a4527a09ed8015d0ffcf004cb1d4a67e6',1,'stan::gm::printable_visgen::operator()(const std::string &s) const '],['../structstan_1_1gm_1_1printable__visgen.html#ab6298d1155c3982e8c2bad7ea562cee6',1,'stan::gm::printable_visgen::operator()(const expression &e) const '],['../structstan_1_1gm_1_1var__size__validating__visgen.html#a0c3d62bd75928038d50e2cb207718936',1,'stan::gm::var_size_validating_visgen::operator()(nil const &) const '],['../structstan_1_1gm_1_1var__size__validating__visgen.html#a9028495f1c1b7eba7789fd640bf1d14e',1,'stan::gm::var_size_validating_visgen::operator()(int_var_decl const &x) const '],['../structstan_1_1gm_1_1var__size__validating__visgen.html#a00c2424a51f337b1b8703244d2ca1e81',1,'stan::gm::var_size_validating_visgen::operator()(double_var_decl const &x) const '],['../structstan_1_1gm_1_1var__size__validating__visgen.html#afab72d75a1111f01b8b1f771f2e736fe',1,'stan::gm::var_size_validating_visgen::operator()(vector_var_decl const &x) const '],['../structstan_1_1gm_1_1var__size__validating__visgen.html#a14ea51e14a4cf91b841aaeb81d11554c',1,'stan::gm::var_size_validating_visgen::operator()(row_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1var__size__validating__visgen.html#acb8091b7c199fb3b49d7bfd24c6be687',1,'stan::gm::var_size_validating_visgen::operator()(unit_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1var__size__validating__visgen.html#ad0527fcfeed7807664a784af7083bc49',1,'stan::gm::var_size_validating_visgen::operator()(simplex_var_decl const &x) const '],['../structstan_1_1gm_1_1var__size__validating__visgen.html#adb42789b5993da3f03577244e65dce74',1,'stan::gm::var_size_validating_visgen::operator()(ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1var__size__validating__visgen.html#a008afb0bcfcdac5b70ce2805c1858387',1,'stan::gm::var_size_validating_visgen::operator()(positive_ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1var__size__validating__visgen.html#a35236dd88f0ebbc900575e63960e0707',1,'stan::gm::var_size_validating_visgen::operator()(matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1var__size__validating__visgen.html#a7c502111b0cb5e27b54d45c0525fbbf3',1,'stan::gm::var_size_validating_visgen::operator()(cholesky_factor_var_decl const &x) const '],['../structstan_1_1gm_1_1var__size__validating__visgen.html#a03c98e95540ffc39e540114b5a67ec42',1,'stan::gm::var_size_validating_visgen::operator()(cov_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1var__size__validating__visgen.html#aaa4deb5d7e8a85a0acd059f0883384b9',1,'stan::gm::var_size_validating_visgen::operator()(corr_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1var__resizing__visgen.html#a669faa2dfb234af0ec6f651a92eb3cc7',1,'stan::gm::var_resizing_visgen::operator()(nil const &) const '],['../structstan_1_1gm_1_1var__resizing__visgen.html#ad973da4f52c164e36735bca3e9a1ee80',1,'stan::gm::var_resizing_visgen::operator()(int_var_decl const &x) const '],['../structstan_1_1gm_1_1var__resizing__visgen.html#aac743c79ec0be79ce58ab662316890bd',1,'stan::gm::var_resizing_visgen::operator()(double_var_decl const &x) const '],['../structstan_1_1gm_1_1var__resizing__visgen.html#a8517c46749146da31a0e7f63c4228cc2',1,'stan::gm::var_resizing_visgen::operator()(vector_var_decl const &x) const '],['../structstan_1_1gm_1_1var__resizing__visgen.html#a36cfe5b6c444c2a024db0f30036a5f93',1,'stan::gm::var_resizing_visgen::operator()(row_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1var__resizing__visgen.html#ad811ec41000dbbc94b41d5745f3c3918',1,'stan::gm::var_resizing_visgen::operator()(unit_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1var__resizing__visgen.html#a1db8714cf43b3f5eacb74c826646c80a',1,'stan::gm::var_resizing_visgen::operator()(simplex_var_decl const &x) const '],['../structstan_1_1gm_1_1var__resizing__visgen.html#ad728ef0d927e9712efdc777b44de98a7',1,'stan::gm::var_resizing_visgen::operator()(ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1var__resizing__visgen.html#a9459c303e0852fc8c3e5d4c0c83e5380',1,'stan::gm::var_resizing_visgen::operator()(positive_ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1var__resizing__visgen.html#a9d2ee03b4184c5fe97bbf1e96fdad0f4',1,'stan::gm::var_resizing_visgen::operator()(matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1var__resizing__visgen.html#a1db09012dd2e670383a72a258b47e1e0',1,'stan::gm::var_resizing_visgen::operator()(cholesky_factor_var_decl const &x) const '],['../structstan_1_1gm_1_1var__resizing__visgen.html#a96571adb3b948ef318b7e7fc5c02a282',1,'stan::gm::var_resizing_visgen::operator()(cov_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1var__resizing__visgen.html#aa60a881ddd0551119087ea501cb7cfb3',1,'stan::gm::var_resizing_visgen::operator()(corr_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1init__local__var__visgen.html#ab7d91977035552a328beee8465a41554',1,'stan::gm::init_local_var_visgen::operator()(const nil &) const '],['../structstan_1_1gm_1_1init__local__var__visgen.html#a56e547b9d8d98eb235c88a8c1d58409a',1,'stan::gm::init_local_var_visgen::operator()(const int_var_decl &x) const '],['../structstan_1_1gm_1_1init__local__var__visgen.html#a713119b71e590ff2d31089d7c224970b',1,'stan::gm::init_local_var_visgen::operator()(const double_var_decl &x) const '],['../structstan_1_1gm_1_1init__local__var__visgen.html#a135f6581adaecde47e10eb38f167297b',1,'stan::gm::init_local_var_visgen::operator()(const vector_var_decl &x) const '],['../structstan_1_1gm_1_1init__local__var__visgen.html#a1eda8c62c18a93fc3fc33a60a0cf1840',1,'stan::gm::init_local_var_visgen::operator()(const row_vector_var_decl &x) const '],['../structstan_1_1gm_1_1init__local__var__visgen.html#a24592819d7fe9e9571627601a0ca6f94',1,'stan::gm::init_local_var_visgen::operator()(const matrix_var_decl &x) const '],['../structstan_1_1gm_1_1init__local__var__visgen.html#a0edae9cf5200fdb6791a3802ef641dde',1,'stan::gm::init_local_var_visgen::operator()(const unit_vector_var_decl &x) const '],['../structstan_1_1gm_1_1init__local__var__visgen.html#a32c0e1d58251b7aaf9a9c626517ccdc4',1,'stan::gm::init_local_var_visgen::operator()(const simplex_var_decl &x) const '],['../structstan_1_1gm_1_1init__local__var__visgen.html#a8c4a28b3b201923feb3237ab70cbfd26',1,'stan::gm::init_local_var_visgen::operator()(const ordered_var_decl &x) const '],['../structstan_1_1gm_1_1init__local__var__visgen.html#a90db653548c46cf9ea0226491de19dd1',1,'stan::gm::init_local_var_visgen::operator()(const positive_ordered_var_decl &x) const '],['../structstan_1_1gm_1_1init__local__var__visgen.html#a6601554142c706daa7d7c90dcd4405b0',1,'stan::gm::init_local_var_visgen::operator()(const cholesky_factor_var_decl &x) const '],['../structstan_1_1gm_1_1init__local__var__visgen.html#a082b360d9ef23c9fb2cf4e606223e82d',1,'stan::gm::init_local_var_visgen::operator()(const cov_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1init__local__var__visgen.html#a3c92ee4c4c11702308cad9e01cc25a8c',1,'stan::gm::init_local_var_visgen::operator()(const corr_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1validate__var__decl__visgen.html#a293b04f191427eac6d4ebb731380530a',1,'stan::gm::validate_var_decl_visgen::operator()(nil const &) const '],['../structstan_1_1gm_1_1validate__var__decl__visgen.html#aeb09dcce8135ffe469e7a3d388fe23a5',1,'stan::gm::validate_var_decl_visgen::operator()(int_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__var__decl__visgen.html#a57821ae7264ce2b467c99671dd2445f1',1,'stan::gm::validate_var_decl_visgen::operator()(double_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__var__decl__visgen.html#af401582ce790254d4a822c821564749c',1,'stan::gm::validate_var_decl_visgen::operator()(vector_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__var__decl__visgen.html#a8cfc776610aef88901ea9f582c8ee5df',1,'stan::gm::validate_var_decl_visgen::operator()(row_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__var__decl__visgen.html#a31374009014b9209309cebb451e95a6d',1,'stan::gm::validate_var_decl_visgen::operator()(matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__var__decl__visgen.html#ac2692f61a0783cad7ccf53b45dc016c2',1,'stan::gm::validate_var_decl_visgen::operator()(unit_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__var__decl__visgen.html#af783c90b5deb3149733edc1d0bbb80da',1,'stan::gm::validate_var_decl_visgen::operator()(simplex_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__var__decl__visgen.html#ae56af402e25685e48b72cf51a8a81db3',1,'stan::gm::validate_var_decl_visgen::operator()(ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__var__decl__visgen.html#aa90b8ec05ece3e94a2b61ccaeac99b71',1,'stan::gm::validate_var_decl_visgen::operator()(positive_ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__var__decl__visgen.html#aa52047c0ba795b014daf81ffc14c2730',1,'stan::gm::validate_var_decl_visgen::operator()(cholesky_factor_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__var__decl__visgen.html#abe4496806c43c26f25d1d5decf630499',1,'stan::gm::validate_var_decl_visgen::operator()(cov_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__var__decl__visgen.html#a5b14b6fbf4c38146fd80097a16cb3f8e',1,'stan::gm::validate_var_decl_visgen::operator()(corr_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1member__var__decl__visgen.html#a5522b70943b2a24749e14dd03c98ade8',1,'stan::gm::member_var_decl_visgen::operator()(nil const &) const '],['../structstan_1_1gm_1_1member__var__decl__visgen.html#a846d68c8fb568e97d8e72a0023c6990e',1,'stan::gm::member_var_decl_visgen::operator()(int_var_decl const &x) const '],['../structstan_1_1gm_1_1member__var__decl__visgen.html#aad6bcbbf2b1ee90edee39b8e194d8682',1,'stan::gm::member_var_decl_visgen::operator()(double_var_decl const &x) const '],['../structstan_1_1gm_1_1member__var__decl__visgen.html#ae071877e2420318e00df38b6fa99aa4c',1,'stan::gm::member_var_decl_visgen::operator()(unit_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1member__var__decl__visgen.html#a452ce11c5be73d030bb2b578f56d92ff',1,'stan::gm::member_var_decl_visgen::operator()(simplex_var_decl const &x) const '],['../structstan_1_1gm_1_1member__var__decl__visgen.html#a4b118f12400d5b68e582659ad7156001',1,'stan::gm::member_var_decl_visgen::operator()(ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1member__var__decl__visgen.html#a188762a0e623abddb891beeb3f8fc7c2',1,'stan::gm::member_var_decl_visgen::operator()(positive_ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1member__var__decl__visgen.html#adf9c99128404dfb300102feef2455c4e',1,'stan::gm::member_var_decl_visgen::operator()(cholesky_factor_var_decl const &x) const '],['../structstan_1_1gm_1_1member__var__decl__visgen.html#a4e6590cdabe3dad424175b40a6b4754a',1,'stan::gm::member_var_decl_visgen::operator()(cov_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1member__var__decl__visgen.html#a547c121fc9b18960dfb348e37eb04a0e',1,'stan::gm::member_var_decl_visgen::operator()(corr_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1member__var__decl__visgen.html#a4d8ea1a46fc58335839c7b8c688d147d',1,'stan::gm::member_var_decl_visgen::operator()(vector_var_decl const &x) const '],['../structstan_1_1gm_1_1member__var__decl__visgen.html#a16094bd8d9f8b7ec7ec42a3b7556e2d9',1,'stan::gm::member_var_decl_visgen::operator()(row_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1member__var__decl__visgen.html#a870fbb7b4bb778789eb6bb5d832d7911',1,'stan::gm::member_var_decl_visgen::operator()(matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1local__var__decl__visgen.html#a0896684d42f09ea98f32bbd8f1c0ee29',1,'stan::gm::local_var_decl_visgen::operator()(nil const &) const '],['../structstan_1_1gm_1_1local__var__decl__visgen.html#afaffeaef006f8b9156b79ad911e63686',1,'stan::gm::local_var_decl_visgen::operator()(int_var_decl const &x) const '],['../structstan_1_1gm_1_1local__var__decl__visgen.html#aa1d9d8bd0d10c6cf59318d51606ba322',1,'stan::gm::local_var_decl_visgen::operator()(double_var_decl const &x) const '],['../structstan_1_1gm_1_1local__var__decl__visgen.html#a402d4b157dd157cd05af74e8aede83ac',1,'stan::gm::local_var_decl_visgen::operator()(vector_var_decl const &x) const '],['../structstan_1_1gm_1_1local__var__decl__visgen.html#a891deece1420c22599e64b7bfa85e481',1,'stan::gm::local_var_decl_visgen::operator()(row_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1local__var__decl__visgen.html#aa169624bac1a343c4f76b3c524ccdf92',1,'stan::gm::local_var_decl_visgen::operator()(matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1local__var__decl__visgen.html#a8f523bcdc99b230336b45a73392c6bdc',1,'stan::gm::local_var_decl_visgen::operator()(unit_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1local__var__decl__visgen.html#a19fe01f126a6d2da24531b6853fca054',1,'stan::gm::local_var_decl_visgen::operator()(simplex_var_decl const &x) const '],['../structstan_1_1gm_1_1local__var__decl__visgen.html#ac56bc9b5dea646125b2bc9898a2daf72',1,'stan::gm::local_var_decl_visgen::operator()(ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1local__var__decl__visgen.html#a6dddb8f57c6478c6cd4e9650ee7647f3',1,'stan::gm::local_var_decl_visgen::operator()(positive_ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1local__var__decl__visgen.html#a285e81494c6c7dc4b8c24f4fccd6b551',1,'stan::gm::local_var_decl_visgen::operator()(cholesky_factor_var_decl const &x) const '],['../structstan_1_1gm_1_1local__var__decl__visgen.html#a27dee788268922197969f21368393349',1,'stan::gm::local_var_decl_visgen::operator()(cov_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1local__var__decl__visgen.html#ab7ed5b969db7d6b35c7c1f1401bc184b',1,'stan::gm::local_var_decl_visgen::operator()(corr_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#a42d0b0b15905906457cbca26c6d10142',1,'stan::gm::generate_local_var_init_nan_visgen::operator()(const nil &) const '],['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#ae4765b5775d99a95ddb1728302f5cbe0',1,'stan::gm::generate_local_var_init_nan_visgen::operator()(const int_var_decl &x) const '],['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#ad47511bfb6722ed45fbe450cb9ba581a',1,'stan::gm::generate_local_var_init_nan_visgen::operator()(const double_var_decl &x) const '],['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#afa590791c9f6197ca2f85cef55be2f99',1,'stan::gm::generate_local_var_init_nan_visgen::operator()(const vector_var_decl &x) const '],['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#a6c85a19a7505a8454242df4367fe07e9',1,'stan::gm::generate_local_var_init_nan_visgen::operator()(const row_vector_var_decl &x) const '],['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#a45ac40894402f023815850e68f485aef',1,'stan::gm::generate_local_var_init_nan_visgen::operator()(const matrix_var_decl &x) const '],['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#a308932a45f040240680173e54e33d8cf',1,'stan::gm::generate_local_var_init_nan_visgen::operator()(const unit_vector_var_decl &x) const '],['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#a6e735049bbefcc57919868b3a6f08715',1,'stan::gm::generate_local_var_init_nan_visgen::operator()(const simplex_var_decl &x) const '],['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#a10b41b00c40c30ca1bc8ce3e53ff0ebf',1,'stan::gm::generate_local_var_init_nan_visgen::operator()(const ordered_var_decl &x) const '],['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#a4b8549963107c86290863b79cea66c51',1,'stan::gm::generate_local_var_init_nan_visgen::operator()(const positive_ordered_var_decl &x) const '],['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#a6ecfe0a495361f204c894f4e0df8a426',1,'stan::gm::generate_local_var_init_nan_visgen::operator()(const cholesky_factor_var_decl &x) const '],['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#a99b6c01ad0c40e6a38c6e1b2546f56a0',1,'stan::gm::generate_local_var_init_nan_visgen::operator()(const cov_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#aada22b5e887493ac2aafb7952555e684',1,'stan::gm::generate_local_var_init_nan_visgen::operator()(const corr_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1generate__init__vars__visgen.html#a5296c19c9ceeec88da8aea6f7c127a0f',1,'stan::gm::generate_init_vars_visgen::operator()(nil const &) const '],['../structstan_1_1gm_1_1generate__init__vars__visgen.html#a9e7341c528d58e75cce017b798d5a0cc',1,'stan::gm::generate_init_vars_visgen::operator()(int_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__vars__visgen.html#a564e16e6d2733419f6124f594b3ce02d',1,'stan::gm::generate_init_vars_visgen::operator()(double_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__vars__visgen.html#ae8ae66be4b3102b4c58c1ad5474fc703',1,'stan::gm::generate_init_vars_visgen::operator()(vector_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__vars__visgen.html#a322208fcee39dfaae64d6d660e44db9f',1,'stan::gm::generate_init_vars_visgen::operator()(row_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__vars__visgen.html#a1f4d18fd1d808922ba1be8c063275576',1,'stan::gm::generate_init_vars_visgen::operator()(matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__vars__visgen.html#a76b27f4e0d2cdeef25f8c8653161e8e2',1,'stan::gm::generate_init_vars_visgen::operator()(unit_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__vars__visgen.html#a539105c77554c2111c5f819870cba7b4',1,'stan::gm::generate_init_vars_visgen::operator()(simplex_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__vars__visgen.html#aa96301578f07886566d1c60605f51a24',1,'stan::gm::generate_init_vars_visgen::operator()(ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__vars__visgen.html#a445e438ce16f5da4b477e4c28b29af64',1,'stan::gm::generate_init_vars_visgen::operator()(positive_ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__vars__visgen.html#aa623eb8b3406e8025ff2ee4202d1a037',1,'stan::gm::generate_init_vars_visgen::operator()(cholesky_factor_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__vars__visgen.html#a67a792b559bef1d3ebc8b3ecd3e7e3d8',1,'stan::gm::generate_init_vars_visgen::operator()(cov_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__vars__visgen.html#ac67da1998f7e6479721e6f419e033a8f',1,'stan::gm::generate_init_vars_visgen::operator()(corr_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__transformed__params__visgen.html#a14fd7eed71c573311d921da1d1cb901b',1,'stan::gm::validate_transformed_params_visgen::operator()(nil const &) const '],['../structstan_1_1gm_1_1validate__transformed__params__visgen.html#ab43eac10e252f672634e5c3098e6102e',1,'stan::gm::validate_transformed_params_visgen::operator()(int_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__transformed__params__visgen.html#a118d04b0f14440602301eedcf2e00331',1,'stan::gm::validate_transformed_params_visgen::operator()(double_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__transformed__params__visgen.html#a3482660b917b658e4d987f63ed688c2a',1,'stan::gm::validate_transformed_params_visgen::operator()(vector_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__transformed__params__visgen.html#affb011dc7007013be0e7b09c402d4c38',1,'stan::gm::validate_transformed_params_visgen::operator()(unit_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__transformed__params__visgen.html#ad4c97056f7796c9f0335edd1c5a770a4',1,'stan::gm::validate_transformed_params_visgen::operator()(simplex_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__transformed__params__visgen.html#aa046bb1fa3a293080f0b50fd939c48b5',1,'stan::gm::validate_transformed_params_visgen::operator()(ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__transformed__params__visgen.html#a2e5661a4fe0ffa841278abd106b658b8',1,'stan::gm::validate_transformed_params_visgen::operator()(positive_ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__transformed__params__visgen.html#a8c346096587fed22458d55deb48bb556',1,'stan::gm::validate_transformed_params_visgen::operator()(row_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__transformed__params__visgen.html#a9d5589f7e8adae47669af9b1662cf846',1,'stan::gm::validate_transformed_params_visgen::operator()(matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__transformed__params__visgen.html#acaa1f2d1859c10a1c4ac1c0f1c96e82f',1,'stan::gm::validate_transformed_params_visgen::operator()(cholesky_factor_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__transformed__params__visgen.html#a3e5e6857c321533c1083a6ce3088fdfb',1,'stan::gm::validate_transformed_params_visgen::operator()(cov_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1validate__transformed__params__visgen.html#a99261725b4a378a9919fe7f89e4fa591',1,'stan::gm::validate_transformed_params_visgen::operator()(corr_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1statement__visgen.html#af85ff0769df52efb90ce2bbc5ff3df23',1,'stan::gm::statement_visgen::operator()(nil const &) const '],['../structstan_1_1gm_1_1statement__visgen.html#a882ddbcdad5d16de84a4d3d658c6ff20',1,'stan::gm::statement_visgen::operator()(assignment const &x) const '],['../structstan_1_1gm_1_1statement__visgen.html#a18f13f4f735a01b9bc621dbacaf64c67',1,'stan::gm::statement_visgen::operator()(expression const &x) const '],['../structstan_1_1gm_1_1statement__visgen.html#a8b4d0dbca715399dad65ca12d81c2caf',1,'stan::gm::statement_visgen::operator()(sample const &x) const '],['../structstan_1_1gm_1_1statement__visgen.html#a42c4a20fb6e15cfc6348f67669a596a3',1,'stan::gm::statement_visgen::operator()(const increment_log_prob_statement &x) const '],['../structstan_1_1gm_1_1statement__visgen.html#a0173ebc27b24f84a454b7dd8d86ad5aa',1,'stan::gm::statement_visgen::operator()(const statements &x) const '],['../structstan_1_1gm_1_1statement__visgen.html#a3210b49a16a34a1f00e5ae4103e4d52d',1,'stan::gm::statement_visgen::operator()(const print_statement &ps) const '],['../structstan_1_1gm_1_1statement__visgen.html#a34c280dce22502fe23321a7104e06516',1,'stan::gm::statement_visgen::operator()(const for_statement &x) const '],['../structstan_1_1gm_1_1statement__visgen.html#a44904f06b384d2d48bc86ce8761c87b7',1,'stan::gm::statement_visgen::operator()(const while_statement &x) const '],['../structstan_1_1gm_1_1statement__visgen.html#a6cd75512cddef8725f4668be6d7ff891',1,'stan::gm::statement_visgen::operator()(const conditional_statement &x) const '],['../structstan_1_1gm_1_1statement__visgen.html#ad5ace1426be86aeec720e50919d711b8',1,'stan::gm::statement_visgen::operator()(const no_op_statement &) const '],['../structstan_1_1gm_1_1dump__member__var__visgen.html#abfa487614709c71e58805b48802e45a4',1,'stan::gm::dump_member_var_visgen::operator()(nil const &) const '],['../structstan_1_1gm_1_1dump__member__var__visgen.html#aa56bad9542006b9d9354f8571c6b722c',1,'stan::gm::dump_member_var_visgen::operator()(int_var_decl const &x) const '],['../structstan_1_1gm_1_1dump__member__var__visgen.html#aef25639b7aa2e8fe80e189de25130ea0',1,'stan::gm::dump_member_var_visgen::operator()(double_var_decl const &x) const '],['../structstan_1_1gm_1_1dump__member__var__visgen.html#ab8092387d74cddae7522efd01d133d43',1,'stan::gm::dump_member_var_visgen::operator()(vector_var_decl const &x) const '],['../structstan_1_1gm_1_1dump__member__var__visgen.html#ac67d9309fc445f1dc5f962995f2cfebc',1,'stan::gm::dump_member_var_visgen::operator()(row_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1dump__member__var__visgen.html#a90cdc8c8b6027bbe9f72c6b4b2ab6351',1,'stan::gm::dump_member_var_visgen::operator()(unit_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1dump__member__var__visgen.html#a1df5811f58ff7a33a96962e1f0527250',1,'stan::gm::dump_member_var_visgen::operator()(simplex_var_decl const &x) const '],['../structstan_1_1gm_1_1dump__member__var__visgen.html#a4c94da368b07ae2933600a6a5f0e7c9f',1,'stan::gm::dump_member_var_visgen::operator()(ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1dump__member__var__visgen.html#a8fbb932a4cb688a85ee6e65ce36a4b13',1,'stan::gm::dump_member_var_visgen::operator()(positive_ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1dump__member__var__visgen.html#ace2352860fab0197f7cf0d43f75b7302',1,'stan::gm::dump_member_var_visgen::operator()(matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1dump__member__var__visgen.html#a1a149800febdc5a296facd5874dbf695',1,'stan::gm::dump_member_var_visgen::operator()(corr_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1dump__member__var__visgen.html#afe2e3c945b8fbd8fd18a3df5ac91fe5f',1,'stan::gm::dump_member_var_visgen::operator()(cholesky_factor_var_decl const &x) const '],['../structstan_1_1gm_1_1dump__member__var__visgen.html#ab6568cd4e866ced3a2456c4910265eb9',1,'stan::gm::dump_member_var_visgen::operator()(cov_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1set__param__ranges__visgen.html#a3625dc74eb75e7fa91531810bdf97b9e',1,'stan::gm::set_param_ranges_visgen::operator()(const nil &) const '],['../structstan_1_1gm_1_1set__param__ranges__visgen.html#ae3478b2db9512a083f0ee9bdfd111082',1,'stan::gm::set_param_ranges_visgen::operator()(const int_var_decl &x) const '],['../structstan_1_1gm_1_1set__param__ranges__visgen.html#a706ebdafd5d5ea2db2bfff93a7b1328f',1,'stan::gm::set_param_ranges_visgen::operator()(const double_var_decl &x) const '],['../structstan_1_1gm_1_1set__param__ranges__visgen.html#aee6df5fcfce0657ed53f2c144cf64797',1,'stan::gm::set_param_ranges_visgen::operator()(const vector_var_decl &x) const '],['../structstan_1_1gm_1_1set__param__ranges__visgen.html#a4b318d4a2f5799b9f431ced598a7255a',1,'stan::gm::set_param_ranges_visgen::operator()(const row_vector_var_decl &x) const '],['../structstan_1_1gm_1_1set__param__ranges__visgen.html#a07a9057ea34f41475091f186c465486d',1,'stan::gm::set_param_ranges_visgen::operator()(const matrix_var_decl &x) const '],['../structstan_1_1gm_1_1set__param__ranges__visgen.html#a0a3c6ed449782da43725725db88f0af5',1,'stan::gm::set_param_ranges_visgen::operator()(const unit_vector_var_decl &x) const '],['../structstan_1_1gm_1_1set__param__ranges__visgen.html#abcb216c0ca4b41da7d535ce3a2738a9f',1,'stan::gm::set_param_ranges_visgen::operator()(const simplex_var_decl &x) const '],['../structstan_1_1gm_1_1set__param__ranges__visgen.html#a33f608b08e2821547825696f04d0fdbf',1,'stan::gm::set_param_ranges_visgen::operator()(const ordered_var_decl &x) const '],['../structstan_1_1gm_1_1set__param__ranges__visgen.html#a376e19d3c9d4ee5bd05651b3f7b8400c',1,'stan::gm::set_param_ranges_visgen::operator()(const positive_ordered_var_decl &x) const '],['../structstan_1_1gm_1_1set__param__ranges__visgen.html#ad0298bb2fcb14381f78fcdf45deb8334',1,'stan::gm::set_param_ranges_visgen::operator()(const cholesky_factor_var_decl &x) const '],['../structstan_1_1gm_1_1set__param__ranges__visgen.html#a852e85c5a92311b692c6ea2278168f37',1,'stan::gm::set_param_ranges_visgen::operator()(const cov_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1set__param__ranges__visgen.html#a183d4048461fbc6648583ea9c9738204',1,'stan::gm::set_param_ranges_visgen::operator()(const corr_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1generate__init__visgen.html#ae64d5b09459e81886886f4b8bb93ad5e',1,'stan::gm::generate_init_visgen::operator()(nil const &) const '],['../structstan_1_1gm_1_1generate__init__visgen.html#a4acfea897c0949cfc6d0a93e1206d19f',1,'stan::gm::generate_init_visgen::operator()(int_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__visgen.html#a1a20fef969f980bd76d76f649fee2f8f',1,'stan::gm::generate_init_visgen::operator()(double_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__visgen.html#aea32eea12e6ecd555c45f4f70d84fdd4',1,'stan::gm::generate_init_visgen::operator()(vector_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__visgen.html#a2d29390aa764b8b85a2648d4ea2f68b6',1,'stan::gm::generate_init_visgen::operator()(row_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__visgen.html#ad04937033077af89a4b73ebfe5212c97',1,'stan::gm::generate_init_visgen::operator()(matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__visgen.html#adc2c6e42617cf083e62c8173858903f5',1,'stan::gm::generate_init_visgen::operator()(unit_vector_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__visgen.html#a849ab1352d5c6ecf926e2062eaec1fe6',1,'stan::gm::generate_init_visgen::operator()(simplex_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__visgen.html#a9982f4abc1aeea75644c95d262a4664c',1,'stan::gm::generate_init_visgen::operator()(ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__visgen.html#aa9b31667894e82fcce665487e56df858',1,'stan::gm::generate_init_visgen::operator()(positive_ordered_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__visgen.html#a15640d3d0ed7f8bd5e3791760873a141',1,'stan::gm::generate_init_visgen::operator()(cholesky_factor_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__visgen.html#a1902bf22a0d19fa6c0608d80f79fbd15',1,'stan::gm::generate_init_visgen::operator()(cov_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1generate__init__visgen.html#ac7801f6cac14339b13bd6e33a16479fd',1,'stan::gm::generate_init_visgen::operator()(corr_matrix_var_decl const &x) const '],['../structstan_1_1gm_1_1write__dims__visgen.html#a241e8488f5df6048133f3fc3436b4f73',1,'stan::gm::write_dims_visgen::operator()(const nil &) const '],['../structstan_1_1gm_1_1write__dims__visgen.html#a285f76d658ddd8b018079da23eb88ab2',1,'stan::gm::write_dims_visgen::operator()(const int_var_decl &x) const '],['../structstan_1_1gm_1_1write__dims__visgen.html#a739b3a41bd03346e6364ed563644fca3',1,'stan::gm::write_dims_visgen::operator()(const double_var_decl &x) const '],['../structstan_1_1gm_1_1write__dims__visgen.html#ac46344be8a564d0019c582f9604ea797',1,'stan::gm::write_dims_visgen::operator()(const vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__dims__visgen.html#adc6fbaedd6b426908b335d9ed6363c64',1,'stan::gm::write_dims_visgen::operator()(const row_vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__dims__visgen.html#a9399300d81344525a1c52ca3003bd123',1,'stan::gm::write_dims_visgen::operator()(const matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__dims__visgen.html#a0e7495ad6875b725669909150209d36e',1,'stan::gm::write_dims_visgen::operator()(const unit_vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__dims__visgen.html#abfe9bcecd2b4081a1970a514dfa2f7bb',1,'stan::gm::write_dims_visgen::operator()(const simplex_var_decl &x) const '],['../structstan_1_1gm_1_1write__dims__visgen.html#a735927dd81ac131434272269eb9853fd',1,'stan::gm::write_dims_visgen::operator()(const ordered_var_decl &x) const '],['../structstan_1_1gm_1_1write__dims__visgen.html#a6823e7c0f43cb493bc166f3e6f7ce169',1,'stan::gm::write_dims_visgen::operator()(const positive_ordered_var_decl &x) const '],['../structstan_1_1gm_1_1write__dims__visgen.html#a5affc0ae2fa501d9d98ea0421688fdc9',1,'stan::gm::write_dims_visgen::operator()(const cholesky_factor_var_decl &x) const '],['../structstan_1_1gm_1_1write__dims__visgen.html#afcd238f2d6c7d48a4e13f3bfc4e640f8',1,'stan::gm::write_dims_visgen::operator()(const cov_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__dims__visgen.html#ae252214d9acdfd84be53e5f3803e0bee',1,'stan::gm::write_dims_visgen::operator()(const corr_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__param__names__visgen.html#a661aeeb81f7e904501160518ef2ba145',1,'stan::gm::write_param_names_visgen::operator()(const nil &) const '],['../structstan_1_1gm_1_1write__param__names__visgen.html#abff2286d0b2a3d185d304917ebc4492a',1,'stan::gm::write_param_names_visgen::operator()(const int_var_decl &x) const '],['../structstan_1_1gm_1_1write__param__names__visgen.html#a470817ce578b1abc52f0fdc56c1b28f4',1,'stan::gm::write_param_names_visgen::operator()(const double_var_decl &x) const '],['../structstan_1_1gm_1_1write__param__names__visgen.html#a62123b5999a928689b74ce0adf406067',1,'stan::gm::write_param_names_visgen::operator()(const vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__param__names__visgen.html#a4f921a15549249daf2b0dc4ddc13614c',1,'stan::gm::write_param_names_visgen::operator()(const row_vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__param__names__visgen.html#a930d1005cd6effae68a9e30c38ae5547',1,'stan::gm::write_param_names_visgen::operator()(const matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__param__names__visgen.html#a4e2f1c39a4f283e4c13107a84093aa1e',1,'stan::gm::write_param_names_visgen::operator()(const unit_vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__param__names__visgen.html#a2a82891f7cd347774f01ee587527d607',1,'stan::gm::write_param_names_visgen::operator()(const simplex_var_decl &x) const '],['../structstan_1_1gm_1_1write__param__names__visgen.html#a5244ace83897596a9a898062a466f3a7',1,'stan::gm::write_param_names_visgen::operator()(const ordered_var_decl &x) const '],['../structstan_1_1gm_1_1write__param__names__visgen.html#a13381b4ec5fc1104cec86d0630c0073a',1,'stan::gm::write_param_names_visgen::operator()(const positive_ordered_var_decl &x) const '],['../structstan_1_1gm_1_1write__param__names__visgen.html#aaf7e806be4b3ad34f72b37b65f6d9f69',1,'stan::gm::write_param_names_visgen::operator()(const cholesky_factor_var_decl &x) const '],['../structstan_1_1gm_1_1write__param__names__visgen.html#acdd883b61a36735c8647fe83618f6fa7',1,'stan::gm::write_param_names_visgen::operator()(const cov_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__param__names__visgen.html#a9910044b2795a6255a78c9f672c1bf0c',1,'stan::gm::write_param_names_visgen::operator()(const corr_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__header__visgen.html#ae9ad9fd29629c1a5fa7eaf95aef5d8d7',1,'stan::gm::write_csv_header_visgen::operator()(const nil &) const '],['../structstan_1_1gm_1_1write__csv__header__visgen.html#ae604f0f9b1cc6db35f15f655b00cd262',1,'stan::gm::write_csv_header_visgen::operator()(const int_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__header__visgen.html#a8d445e07f41720cce733711c33acaa76',1,'stan::gm::write_csv_header_visgen::operator()(const double_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__header__visgen.html#ab1ef373185ef957afb786883c4f1ab79',1,'stan::gm::write_csv_header_visgen::operator()(const vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__header__visgen.html#ab1fcfc4ab4f58ef149e8492fe967194c',1,'stan::gm::write_csv_header_visgen::operator()(const row_vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__header__visgen.html#aa7f849a4a814eadaaecf4a6ce8ca4db5',1,'stan::gm::write_csv_header_visgen::operator()(const matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__header__visgen.html#af409c6ebc10fd7efd7c964033c8d0c27',1,'stan::gm::write_csv_header_visgen::operator()(const unit_vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__header__visgen.html#a1225374f023caada43d88fb6cc879d3c',1,'stan::gm::write_csv_header_visgen::operator()(const simplex_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__header__visgen.html#ab1ee25227b1498266d43231b824c31d7',1,'stan::gm::write_csv_header_visgen::operator()(const ordered_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__header__visgen.html#a9be3a2194404fd09e0ba9e3de51bc5fa',1,'stan::gm::write_csv_header_visgen::operator()(const positive_ordered_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__header__visgen.html#a38e2400334cbb5ca23835db8c0a1126f',1,'stan::gm::write_csv_header_visgen::operator()(const cholesky_factor_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__header__visgen.html#ad3adb663e082ceea28006f88cc48e584',1,'stan::gm::write_csv_header_visgen::operator()(const cov_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__header__visgen.html#ab64e2f461383641fbbdb0ada35a8ecc3',1,'stan::gm::write_csv_header_visgen::operator()(const corr_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1constrained__param__names__visgen.html#a7c3101dca78af8f11df33f8e69272d1f',1,'stan::gm::constrained_param_names_visgen::operator()(const nil &) const '],['../structstan_1_1gm_1_1constrained__param__names__visgen.html#a42d95194ca06e7281883aac7a71cd8e0',1,'stan::gm::constrained_param_names_visgen::operator()(const int_var_decl &x) const '],['../structstan_1_1gm_1_1constrained__param__names__visgen.html#a6b0c36939bea3557e78606b4cad1c6ed',1,'stan::gm::constrained_param_names_visgen::operator()(const double_var_decl &x) const '],['../structstan_1_1gm_1_1constrained__param__names__visgen.html#aa768bee970f4f260a25afe9469cb94f2',1,'stan::gm::constrained_param_names_visgen::operator()(const vector_var_decl &x) const '],['../structstan_1_1gm_1_1constrained__param__names__visgen.html#ab6aedd3a1d06e93388765f6322439b91',1,'stan::gm::constrained_param_names_visgen::operator()(const row_vector_var_decl &x) const '],['../structstan_1_1gm_1_1constrained__param__names__visgen.html#a80882376e2174653b40047ef3e74e641',1,'stan::gm::constrained_param_names_visgen::operator()(const matrix_var_decl &x) const '],['../structstan_1_1gm_1_1constrained__param__names__visgen.html#abbeaf19e5de404502b219c5f8c6ec5ea',1,'stan::gm::constrained_param_names_visgen::operator()(const unit_vector_var_decl &x) const '],['../structstan_1_1gm_1_1constrained__param__names__visgen.html#acd0d2716db8d9b32253916c959680df9',1,'stan::gm::constrained_param_names_visgen::operator()(const simplex_var_decl &x) const '],['../structstan_1_1gm_1_1constrained__param__names__visgen.html#addad66465bf189869bd62f872a17edbc',1,'stan::gm::constrained_param_names_visgen::operator()(const ordered_var_decl &x) const '],['../structstan_1_1gm_1_1constrained__param__names__visgen.html#a6c880b88ca3ca940cea321b0617b97af',1,'stan::gm::constrained_param_names_visgen::operator()(const positive_ordered_var_decl &x) const '],['../structstan_1_1gm_1_1constrained__param__names__visgen.html#a7e406cdece7bcf4e87d2c225baf9ffce',1,'stan::gm::constrained_param_names_visgen::operator()(const cholesky_factor_var_decl &x) const '],['../structstan_1_1gm_1_1constrained__param__names__visgen.html#a8a496777aa89fd7699f822b67500a50b',1,'stan::gm::constrained_param_names_visgen::operator()(const cov_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1constrained__param__names__visgen.html#ab836f4938f43c78bfdd417ee4b8bb88a',1,'stan::gm::constrained_param_names_visgen::operator()(const corr_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1unconstrained__param__names__visgen.html#a8d1853ed4e7a8999b2f548e2bd3dedc4',1,'stan::gm::unconstrained_param_names_visgen::operator()(const nil &) const '],['../structstan_1_1gm_1_1unconstrained__param__names__visgen.html#a227e9459dd3354627bf7c95a3e2805d4',1,'stan::gm::unconstrained_param_names_visgen::operator()(const int_var_decl &x) const '],['../structstan_1_1gm_1_1unconstrained__param__names__visgen.html#a336ad68a4364f534af6c3b8ba4148af0',1,'stan::gm::unconstrained_param_names_visgen::operator()(const double_var_decl &x) const '],['../structstan_1_1gm_1_1unconstrained__param__names__visgen.html#a6dde9e6aa7dff433b48f2b53c6f57966',1,'stan::gm::unconstrained_param_names_visgen::operator()(const vector_var_decl &x) const '],['../structstan_1_1gm_1_1unconstrained__param__names__visgen.html#a68a7a4f4f7a0027c312f093ced7a8036',1,'stan::gm::unconstrained_param_names_visgen::operator()(const row_vector_var_decl &x) const '],['../structstan_1_1gm_1_1unconstrained__param__names__visgen.html#a01ef3b571744b182fd2b2679aa14c90c',1,'stan::gm::unconstrained_param_names_visgen::operator()(const matrix_var_decl &x) const '],['../structstan_1_1gm_1_1unconstrained__param__names__visgen.html#acf780131651d54be9029160c82ce5c7b',1,'stan::gm::unconstrained_param_names_visgen::operator()(const unit_vector_var_decl &x) const '],['../structstan_1_1gm_1_1unconstrained__param__names__visgen.html#a510b9bb20dda3fb01a1ff9dbabb0bf78',1,'stan::gm::unconstrained_param_names_visgen::operator()(const simplex_var_decl &x) const '],['../structstan_1_1gm_1_1unconstrained__param__names__visgen.html#a3296924b11f2a2a1aad3ffe4c48d3772',1,'stan::gm::unconstrained_param_names_visgen::operator()(const ordered_var_decl &x) const '],['../structstan_1_1gm_1_1unconstrained__param__names__visgen.html#af672a2749665faa902b87e17f7be9eef',1,'stan::gm::unconstrained_param_names_visgen::operator()(const positive_ordered_var_decl &x) const '],['../structstan_1_1gm_1_1unconstrained__param__names__visgen.html#a9a938d11ae97283b176fefd67ac79e6b',1,'stan::gm::unconstrained_param_names_visgen::operator()(const cholesky_factor_var_decl &x) const '],['../structstan_1_1gm_1_1unconstrained__param__names__visgen.html#a40bde127dc4cd55e31d53fe0a9d7b9a5',1,'stan::gm::unconstrained_param_names_visgen::operator()(const cov_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1unconstrained__param__names__visgen.html#a3735b01da2e94eff9780b03d95f0c5b6',1,'stan::gm::unconstrained_param_names_visgen::operator()(const corr_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__visgen.html#a832c79f771732b731f04153cafe0dd37',1,'stan::gm::write_csv_visgen::operator()(const nil &) const '],['../structstan_1_1gm_1_1write__csv__visgen.html#a4b42d735e3420ec31517fee504c52793',1,'stan::gm::write_csv_visgen::operator()(const int_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__visgen.html#a9c86371fd1160881efc97c46c67235ca',1,'stan::gm::write_csv_visgen::operator()(const double_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__visgen.html#a0c5d75d85a6fd4065cfcac82070672d0',1,'stan::gm::write_csv_visgen::operator()(const vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__visgen.html#aa7ca047c2be3c5b568480846296a94ec',1,'stan::gm::write_csv_visgen::operator()(const row_vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__visgen.html#a7b6c88d0194ef11baef723f5add65b10',1,'stan::gm::write_csv_visgen::operator()(const matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__visgen.html#afbd0de485f3be611e1b7789ff2a12dc7',1,'stan::gm::write_csv_visgen::operator()(const unit_vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__visgen.html#aa427354c26e25e85863c118f12fa0a13',1,'stan::gm::write_csv_visgen::operator()(const simplex_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__visgen.html#a93880784b37e0d8a73cfeccd1c8a162c',1,'stan::gm::write_csv_visgen::operator()(const ordered_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__visgen.html#a595f05ac1587bfd0647519eb0698b6a2',1,'stan::gm::write_csv_visgen::operator()(const positive_ordered_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__visgen.html#ad1b3b76918fbd09d02b35e25a91d7f36',1,'stan::gm::write_csv_visgen::operator()(const cholesky_factor_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__visgen.html#a2072ed961ae54bcdcc7cf5a66efec313',1,'stan::gm::write_csv_visgen::operator()(const cov_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__visgen.html#af88449a647d8d4aaf5d4cb296e923f8d',1,'stan::gm::write_csv_visgen::operator()(const corr_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__vars__visgen.html#a2719acba4b1a18fb662c97dcb830d103',1,'stan::gm::write_csv_vars_visgen::operator()(const nil &) const '],['../structstan_1_1gm_1_1write__csv__vars__visgen.html#adb67f6f8f3816f872f4cd5db25993fbc',1,'stan::gm::write_csv_vars_visgen::operator()(const int_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__vars__visgen.html#a2b0ba004b7c8510e89ef81da784f0e1c',1,'stan::gm::write_csv_vars_visgen::operator()(const double_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__vars__visgen.html#afeca4060a34a32397dfcf01615405bdb',1,'stan::gm::write_csv_vars_visgen::operator()(const vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__vars__visgen.html#a80ba2c361cccd8f57935e9d6668be516',1,'stan::gm::write_csv_vars_visgen::operator()(const row_vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__vars__visgen.html#a1d97ffbfc321ee5120a71055372ded4e',1,'stan::gm::write_csv_vars_visgen::operator()(const matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__vars__visgen.html#a3035bb84db8ce7a78918d76bc8a1fb4c',1,'stan::gm::write_csv_vars_visgen::operator()(const unit_vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__vars__visgen.html#ac74b4f9071b03f3a66b83023b568e797',1,'stan::gm::write_csv_vars_visgen::operator()(const simplex_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__vars__visgen.html#a019d32e99ccad2f6c17485519507e8b7',1,'stan::gm::write_csv_vars_visgen::operator()(const ordered_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__vars__visgen.html#aae675794a40e6c613b11f6fd28fcebf3',1,'stan::gm::write_csv_vars_visgen::operator()(const positive_ordered_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__vars__visgen.html#ab9336edc282edfd966c36da2514f09dc',1,'stan::gm::write_csv_vars_visgen::operator()(const cholesky_factor_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__vars__visgen.html#a77f63c9fcd04bab901a8efe09a2acbee',1,'stan::gm::write_csv_vars_visgen::operator()(const cov_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__csv__vars__visgen.html#ad622ac454a8959f9621901235f01001b',1,'stan::gm::write_csv_vars_visgen::operator()(const corr_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__visgen.html#a5e023f2fef25f89a84e7ef9cc3fffb28',1,'stan::gm::write_array_visgen::operator()(const nil &) const '],['../structstan_1_1gm_1_1write__array__visgen.html#a76890f5af58b5249068657a2bd5b6efa',1,'stan::gm::write_array_visgen::operator()(const int_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__visgen.html#a24364e34f4993b5b367c81ce3f2b659a',1,'stan::gm::write_array_visgen::operator()(const double_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__visgen.html#ac622e7cbe2c27da32f5be2d828b2e7e8',1,'stan::gm::write_array_visgen::operator()(const vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__visgen.html#a24849551217534810a461fed799f5f2b',1,'stan::gm::write_array_visgen::operator()(const row_vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__visgen.html#a25dffda3b1d6542f6e7d4842080c42a8',1,'stan::gm::write_array_visgen::operator()(const matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__visgen.html#a0b22a9605e7f90682f451d1ff8be1b67',1,'stan::gm::write_array_visgen::operator()(const unit_vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__visgen.html#a8c54d3d13d4ca2d2cc09ae6a90ef441a',1,'stan::gm::write_array_visgen::operator()(const simplex_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__visgen.html#a3fbb94eaca23339aa18664d3a808cd2d',1,'stan::gm::write_array_visgen::operator()(const ordered_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__visgen.html#ad554817b1894e39e2ad30bad286f4563',1,'stan::gm::write_array_visgen::operator()(const positive_ordered_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__visgen.html#ae4e903cfb0434aa8b0d1cfc1ff46fd13',1,'stan::gm::write_array_visgen::operator()(const cholesky_factor_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__visgen.html#a2b7fc3532750391146c46bbf15ad605f',1,'stan::gm::write_array_visgen::operator()(const cov_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__visgen.html#a79cfed1b9d05d41c66727331ec4fa0e2',1,'stan::gm::write_array_visgen::operator()(const corr_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__vars__visgen.html#ad601dd8e1b7c3294e9dbb779b7a64090',1,'stan::gm::write_array_vars_visgen::operator()(const nil &) const '],['../structstan_1_1gm_1_1write__array__vars__visgen.html#a4bdb9cfceafeff1f37c18f0a2d8b4262',1,'stan::gm::write_array_vars_visgen::operator()(const int_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__vars__visgen.html#adef25be6d3bdb7365fb6f26aeddabe65',1,'stan::gm::write_array_vars_visgen::operator()(const double_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__vars__visgen.html#a8b05bf8a27d5f0d495a7302bef516f6c',1,'stan::gm::write_array_vars_visgen::operator()(const vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__vars__visgen.html#a049135667941289c42a3b081610ab298',1,'stan::gm::write_array_vars_visgen::operator()(const row_vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__vars__visgen.html#aea55b2a06d469e5d499eef36190fd037',1,'stan::gm::write_array_vars_visgen::operator()(const matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__vars__visgen.html#ae62dfbbd8d1d79af6bbdfccbfc09d6bc',1,'stan::gm::write_array_vars_visgen::operator()(const unit_vector_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__vars__visgen.html#ace51ff0942e94f73235fa37cbefab194',1,'stan::gm::write_array_vars_visgen::operator()(const simplex_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__vars__visgen.html#af12814f9cf2f360f33c363d3492746eb',1,'stan::gm::write_array_vars_visgen::operator()(const ordered_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__vars__visgen.html#af7fa42ced7c5d892234d8db022397754',1,'stan::gm::write_array_vars_visgen::operator()(const positive_ordered_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__vars__visgen.html#a7ef33b812611b18bf7340cc5cf586dd5',1,'stan::gm::write_array_vars_visgen::operator()(const cholesky_factor_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__vars__visgen.html#a66250932aff2ae2ffd3cff5d361f95b4',1,'stan::gm::write_array_vars_visgen::operator()(const cov_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1write__array__vars__visgen.html#a5763e948b3e12feb9e988e11eeb4553a',1,'stan::gm::write_array_vars_visgen::operator()(const corr_matrix_var_decl &x) const '],['../structstan_1_1gm_1_1validate__expr__type2.html#a882be65b1df71e890016fb4f7751e962',1,'stan::gm::validate_expr_type2::operator()()'],['../structstan_1_1gm_1_1set__fun__type2.html#a3727191c07f903e90039d085047aec77',1,'stan::gm::set_fun_type2::operator()()'],['../structstan_1_1gm_1_1binary__op__expr.html#ae729ce9f535a2edbfe88a313d3f7184e',1,'stan::gm::binary_op_expr::operator()()'],['../structstan_1_1gm_1_1addition__expr.html#a6f511d62b60d4c5708c0dc9a5687809f',1,'stan::gm::addition_expr::operator()()'],['../structstan_1_1gm_1_1subtraction__expr.html#af01e91cfb196709e94cba69ca6055f48',1,'stan::gm::subtraction_expr::operator()()'],['../structstan_1_1gm_1_1add__conditional__condition.html#aace3227298368df282a3c6fc29dea385',1,'stan::gm::add_conditional_condition::operator()()'],['../structstan_1_1gm_1_1add__conditional__body.html#a329d5d20cbf88349147d98045ba2d79e',1,'stan::gm::add_conditional_body::operator()()'],['../structstan_1_1gm_1_1validate__assignment.html#afa6d6906c1128cadfdf4d041bc1bfcf0',1,'stan::gm::validate_assignment::operator()()'],['../structstan_1_1gm_1_1validate__sample.html#a77de03d8f8a44b98afa75e7fa02fe705',1,'stan::gm::validate_sample::operator()()'],['../structstan_1_1gm_1_1expression__as__statement.html#ad91df00b5b3c97d4ed401b0ac898f17c',1,'stan::gm::expression_as_statement::operator()()'],['../structstan_1_1gm_1_1unscope__locals.html#a5be53d7ab77a85c6002a787b8aa2dbe2',1,'stan::gm::unscope_locals::operator()()'],['../structstan_1_1gm_1_1add__while__condition.html#af1707344a4485a9844789de02036a99b',1,'stan::gm::add_while_condition::operator()()'],['../structstan_1_1gm_1_1add__while__body.html#a95c4e95049a6f5175ad6e6d862f1e02e',1,'stan::gm::add_while_body::operator()()'],['../structstan_1_1gm_1_1add__loop__identifier.html#a6b40d339f94aa76d22665c2f4328e095',1,'stan::gm::add_loop_identifier::operator()()'],['../structstan_1_1gm_1_1remove__loop__identifier.html#af7b8d2468ac908978b92fc852cbb0208',1,'stan::gm::remove_loop_identifier::operator()()'],['../structstan_1_1gm_1_1validate__int__expr2.html#a462cc8619e7c1454119a75fa019b4d51',1,'stan::gm::validate_int_expr2::operator()()'],['../structstan_1_1gm_1_1validate__allow__sample.html#a4e15d9514eb63e9ddefa8bbede4b0fb5',1,'stan::gm::validate_allow_sample::operator()()'],['../structstan_1_1gm_1_1set__fun__type.html#aa047855ac672fdda270a623cfe44f9dc',1,'stan::gm::set_fun_type::operator()()'],['../structstan_1_1gm_1_1set__fun__type__named.html#ae4a66b5e2003663c4d0651ccc9b22633',1,'stan::gm::set_fun_type_named::operator()()'],['../structstan_1_1gm_1_1multiplication__expr.html#a5a3418a174c704a06dc078189e1e75bf',1,'stan::gm::multiplication_expr::operator()()'],['../structstan_1_1gm_1_1division__expr.html#a727db3527c40866ff8dd2709959fcbbf',1,'stan::gm::division_expr::operator()()'],['../structstan_1_1gm_1_1left__division__expr.html#a78883f0a7a5cad2f9654189fd5d834cf',1,'stan::gm::left_division_expr::operator()()'],['../structstan_1_1gm_1_1elt__multiplication__expr.html#a1df3b42b009deca11a8e01a437a67798',1,'stan::gm::elt_multiplication_expr::operator()()'],['../structstan_1_1gm_1_1elt__division__expr.html#addc060e5b9609d1e16a8c749f8e81363',1,'stan::gm::elt_division_expr::operator()()'],['../structstan_1_1gm_1_1negate__expr.html#a75cef8d0a29e9cb72a9f80f4ad2f6403',1,'stan::gm::negate_expr::operator()()'],['../structstan_1_1gm_1_1logical__negate__expr.html#a1a428268ae11c49de22066e600e5ce9c',1,'stan::gm::logical_negate_expr::operator()()'],['../structstan_1_1gm_1_1transpose__expr.html#aeca6b173a3530e7e56029c3f95d8dbc9',1,'stan::gm::transpose_expr::operator()()'],['../structstan_1_1gm_1_1add__expression__dimss.html#ad1b37475cdfb437df9fdaa2ba13a3bcc',1,'stan::gm::add_expression_dimss::operator()()'],['../structstan_1_1gm_1_1set__var__type.html#a81e8e16e1f75675c8aa2e99a45230fdd',1,'stan::gm::set_var_type::operator()()'],['../structstan_1_1gm_1_1validate__int__expr3.html#ad00cc4a51aa05e4cac78c6da0c54755f',1,'stan::gm::validate_int_expr3::operator()()'],['../structstan_1_1gm_1_1validate__expr__type.html#a867deadb8d8aa863e91ba057584f88aa',1,'stan::gm::validate_expr_type::operator()()'],['../classstan_1_1optimization_1_1_model_adaptor.html#a6ef3bd561e81ae2cfdc96143aacd4fa7',1,'stan::optimization::ModelAdaptor::operator()(const Eigen::Matrix< double, Eigen::Dynamic, 1 > &x, double &f)'],['../classstan_1_1optimization_1_1_model_adaptor.html#adb0fdd3e2c65d765607c3f30ba16aec8',1,'stan::optimization::ModelAdaptor::operator()(const Eigen::Matrix< double, Eigen::Dynamic, 1 > &x, double &f, Eigen::Matrix< double, Eigen::Dynamic, 1 > &g)']]], + ['operator_2a',['operator*',['../classstan_1_1agrad_1_1var.html#ab9b31165b391c7db9e1b47f0573bc747',1,'stan::agrad::var::operator*()'],['../namespacestan_1_1agrad.html#ab98d09a4888ed80cc22ef9fbdd63c725',1,'stan::agrad::operator*(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#acd3d5f35e32b3b80f294ae2581744963',1,'stan::agrad::operator*(const var &a, const double &b)'],['../namespacestan_1_1agrad.html#aaf70e0701de307a0228d8b26e2b03043',1,'stan::agrad::operator*(const double &a, const var &b)'],['../namespacestan_1_1agrad.html#a58030b052901596ec4978f651504619c',1,'stan::agrad::operator*(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a4e2bbe49f478f96a9fb2716c76523bea',1,'stan::agrad::operator*(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a31ef0939decd80327614cbf795f23b05',1,'stan::agrad::operator*(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#a19282727c9f5d3b03a33fc3e1400ffe9',1,'stan::agrad::operator*(const var &a, const double b)'],['../namespacestan_1_1agrad.html#a8683cc0c4ae269dde86a7a75adff3962',1,'stan::agrad::operator*(const double a, const var &b)']]], + ['operator_2a_3d',['operator*=',['../classstan_1_1agrad_1_1var.html#a9a9aedf7da287c55b7ef482c452b5be7',1,'stan::agrad::var::operator*=(const var &b)'],['../classstan_1_1agrad_1_1var.html#a222ff48b7d30354f136787e634811809',1,'stan::agrad::var::operator*=(const double &b)'],['../structstan_1_1agrad_1_1fvar.html#a345b88c637ae96c0516354b6484347d2',1,'stan::agrad::fvar::operator*=(const fvar< T2 > &x2)'],['../structstan_1_1agrad_1_1fvar.html#a26a112d55140f52b3a5724794348459e',1,'stan::agrad::fvar::operator*=(const T2 &x2)'],['../classstan_1_1agrad_1_1var.html#a4ea7fa4896c40fce1c9d6cf2d59b695e',1,'stan::agrad::var::operator*=(const var &b)'],['../classstan_1_1agrad_1_1var.html#a724480f8a861f8f5430439da4765d1a4',1,'stan::agrad::var::operator*=(const double b)'],['../structstan_1_1gm_1_1expression.html#a2809197528eaa19de579ddb94927c399',1,'stan::gm::expression::operator*=()']]], + ['operator_2b',['operator+',['../namespacestan_1_1agrad.html#a3c56114bde6eda1fc7d8a2a86c7df5e0',1,'stan::agrad::operator+(const var &a)'],['../namespacestan_1_1agrad.html#a9b0bdcc1fdb32b8025983612faa4900d',1,'stan::agrad::operator+(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#aeba6062298b3063bb259ee201d941bc6',1,'stan::agrad::operator+(const var &a, const double &b)'],['../namespacestan_1_1agrad.html#aba8668d340bca165895e64479728b8da',1,'stan::agrad::operator+(const double &a, const var &b)'],['../namespacestan_1_1agrad.html#a8bfe21c1bd8ab796527f2b74cf389469',1,'stan::agrad::operator+(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a952d610e660fc372f93fac76ede56096',1,'stan::agrad::operator+(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#af8208f5ba8bb28ad10e61f7b374c84dd',1,'stan::agrad::operator+(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#adf0933c87c5d700de971755f40979d2a',1,'stan::agrad::operator+(const var &a, const double b)'],['../namespacestan_1_1agrad.html#a71d87c889481dd165b69e5ae18afd358',1,'stan::agrad::operator+(const double a, const var &b)']]], + ['operator_2b_2b',['operator++',['../structstan_1_1agrad_1_1fvar.html#adb8af0c2332bd8fcc102eba6e16e5bc1',1,'stan::agrad::fvar::operator++()'],['../structstan_1_1agrad_1_1fvar.html#ac558947777c6867650377130fed604de',1,'stan::agrad::fvar::operator++(int)'],['../namespacestan_1_1agrad.html#ac3d5ee13c66c2eeef697c20567fb9fe3',1,'stan::agrad::operator++(var &a)'],['../namespacestan_1_1agrad.html#ae5bc7c4bde258ad0fc845b2aa2897a11',1,'stan::agrad::operator++(var &a, int)']]], + ['operator_2b_3d',['operator+=',['../classstan_1_1agrad_1_1var.html#a7aed84a14a5c7f34bddc0d5a17a2c77f',1,'stan::agrad::var::operator+=(const var &b)'],['../classstan_1_1agrad_1_1var.html#a64086c7c9362cf53e57551f8ed5add14',1,'stan::agrad::var::operator+=(const double &b)'],['../structstan_1_1agrad_1_1fvar.html#a42855e5405cb603222286c34d4bd1ffc',1,'stan::agrad::fvar::operator+=(const fvar< T2 > &x2)'],['../structstan_1_1agrad_1_1fvar.html#a0af6f5512f976604a5f7ea908cedccf5',1,'stan::agrad::fvar::operator+=(const T2 &x2)'],['../classstan_1_1agrad_1_1var.html#a8066e2b84e91f0993b63611d8ca9db4a',1,'stan::agrad::var::operator+=(const var &b)'],['../classstan_1_1agrad_1_1var.html#a1f61621b09c7d87facf17e63f036db57',1,'stan::agrad::var::operator+=(const double b)'],['../structstan_1_1gm_1_1expression.html#a80b6ae53326a5bc334b0b64574d4687e',1,'stan::gm::expression::operator+=()']]], + ['operator_2d',['operator-',['../namespacestan_1_1agrad.html#a32cdb534a0a3e4efb74ac57b240b2abd',1,'stan::agrad::operator-(const var &a)'],['../namespacestan_1_1agrad.html#a50db79b36e350ddadea93da21467bd2b',1,'stan::agrad::operator-(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#a1a85fcc0258ec8c8f93e544c9099cc78',1,'stan::agrad::operator-(const var &a, const double &b)'],['../namespacestan_1_1agrad.html#a922d9be5b47d2964d681da023ce86252',1,'stan::agrad::operator-(const double &a, const var &b)'],['../namespacestan_1_1agrad.html#af03dcfffbcfab11eadf069f9e7549683',1,'stan::agrad::operator-(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#aa503cf2df6453a29ea38e921c1f72702',1,'stan::agrad::operator-(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a3ad03eae992d5dd4475f4462cda0460c',1,'stan::agrad::operator-(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#ab7ca680c6523576a2ffefabe1fce682b',1,'stan::agrad::operator-(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#aab2ad74276bb5b689f6d3e4a3d68b588',1,'stan::agrad::operator-(const var &a, const double b)'],['../namespacestan_1_1agrad.html#a2f4fae66485d0711155ff06709d90d40',1,'stan::agrad::operator-(const double a, const var &b)']]], + ['operator_2d_2d',['operator--',['../structstan_1_1agrad_1_1fvar.html#a018ea15f734397c5b035d2b08292a1af',1,'stan::agrad::fvar::operator--()'],['../structstan_1_1agrad_1_1fvar.html#a4b67eb3587d853feb8d7ca14cea9d1d0',1,'stan::agrad::fvar::operator--(int)'],['../namespacestan_1_1agrad.html#afd628cbe961d30214e9599706cb9df3d',1,'stan::agrad::operator--(var &a)'],['../namespacestan_1_1agrad.html#a2c7866db3308cb99e1e6ebe3d276f805',1,'stan::agrad::operator--(var &a, int)']]], + ['operator_2d_3d',['operator-=',['../classstan_1_1agrad_1_1var.html#adc63a21e809772e4e1943dcde7d81501',1,'stan::agrad::var::operator-=(const var &b)'],['../classstan_1_1agrad_1_1var.html#af175a08753073e2b5cd0431df96f685e',1,'stan::agrad::var::operator-=(const double &b)'],['../structstan_1_1agrad_1_1fvar.html#acab2cd650a6ace2d2cbc919a2e295281',1,'stan::agrad::fvar::operator-=(const fvar< T2 > &x2)'],['../structstan_1_1agrad_1_1fvar.html#a9265544f8ff15013032381543e917321',1,'stan::agrad::fvar::operator-=(const T2 &x2)'],['../classstan_1_1agrad_1_1var.html#a7f0d2c15e16e20a61269259b7f7cc5b7',1,'stan::agrad::var::operator-=(const var &b)'],['../classstan_1_1agrad_1_1var.html#a27e309010cc293bfc7b0895010ea576e',1,'stan::agrad::var::operator-=(const double b)'],['../structstan_1_1gm_1_1expression.html#ab7fbe72fb912a2fa66c1084c69bfd1dd',1,'stan::gm::expression::operator-=()']]], + ['operator_2d_3e',['operator->',['../classstan_1_1agrad_1_1var.html#af706ab2096ce340463d8794edb603a22',1,'stan::agrad::var']]], + ['operator_2f',['operator/',['../namespacestan_1_1agrad.html#a7712039ced9aa4a7d848369b36a81832',1,'stan::agrad::operator/(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#af02e91c7d6a2402c055905816ae914e7',1,'stan::agrad::operator/(const var &a, const double &b)'],['../namespacestan_1_1agrad.html#ac920e55ed730cdc2989729a7237f5975',1,'stan::agrad::operator/(const double &a, const var &b)'],['../namespacestan_1_1agrad.html#af4268a75b7456526175bcf5db4210ef4',1,'stan::agrad::operator/(const Eigen::Matrix< fvar< T >, R, C > &v, const fvar< T > &c)'],['../namespacestan_1_1agrad.html#a18ac8b46664850a5703fd3caa9c68c08',1,'stan::agrad::operator/(const Eigen::Matrix< fvar< T >, R, C > &v, const double c)'],['../namespacestan_1_1agrad.html#abc825eb3bf95f70a94e073eaaddff374',1,'stan::agrad::operator/(const Eigen::Matrix< double, R, C > &v, const fvar< T > &c)'],['../namespacestan_1_1agrad.html#a72c74ea31db523c28cef63c20b1a66ef',1,'stan::agrad::operator/(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a7e7e231514df7e0e61bb94dea9436b57',1,'stan::agrad::operator/(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#a00027f1730fec7abb98522c809f4cf40',1,'stan::agrad::operator/(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#acfdf2b1289c99bb87bc37e44dae5b3c4',1,'stan::agrad::operator/(const var &a, const double b)'],['../namespacestan_1_1agrad.html#aef6041bf907aa9f560f2902c96d9befb',1,'stan::agrad::operator/(const double a, const var &b)']]], + ['operator_2f_3d',['operator/=',['../classstan_1_1agrad_1_1var.html#aa006b46d2909a3924efd0275a57f85a9',1,'stan::agrad::var::operator/=(const var &b)'],['../classstan_1_1agrad_1_1var.html#ad2d16ef5b3e1dfda05252a41e80d2276',1,'stan::agrad::var::operator/=(const double &b)'],['../structstan_1_1agrad_1_1fvar.html#a51f4cc010b2c7c553c5ad138f53d2fd5',1,'stan::agrad::fvar::operator/=(const fvar< T2 > &x2)'],['../structstan_1_1agrad_1_1fvar.html#acd050be117d173a998ddc0f3f6e2d00d',1,'stan::agrad::fvar::operator/=(const T2 &x2)'],['../classstan_1_1agrad_1_1var.html#ae193444d7017bca48834761230b6cd76',1,'stan::agrad::var::operator/=(const var &b)'],['../classstan_1_1agrad_1_1var.html#a6bde2e6f35855e8455f3c9ec8bea97ee',1,'stan::agrad::var::operator/=(const double b)'],['../structstan_1_1gm_1_1expression.html#a83a58233b24992d4a4ec01114522df90',1,'stan::gm::expression::operator/=()']]], + ['operator_3c',['operator<',['../namespacestan_1_1agrad.html#a7ee2f26775300ee2e40be6815f68cc2f',1,'stan::agrad::operator<(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#a6955eaac53f1f699cd00859bec37f035',1,'stan::agrad::operator<(const var &a, const double &b)'],['../namespacestan_1_1agrad.html#a30910779586484a4244b3730b9a6d7c7',1,'stan::agrad::operator<(const double &a, const var &b)'],['../namespacestan_1_1agrad.html#a46f6bae01b579578493c501932d6df19',1,'stan::agrad::operator<(const fvar< T > &x, double y)'],['../namespacestan_1_1agrad.html#a302261483eb474a1c2791a19a68efb89',1,'stan::agrad::operator<(double x, const fvar< T > &y)'],['../namespacestan_1_1agrad.html#abe5f505189008af63094d119f3e8f375',1,'stan::agrad::operator<(const fvar< T > &x, const fvar< T > &y)'],['../namespacestan_1_1agrad.html#ad3a4834d55bf56c24cc32d847f2c4116',1,'stan::agrad::operator<(const var &a, const double b)'],['../namespacestan_1_1agrad.html#a190ba1fcff502eab8db57971c2fee3c2',1,'stan::agrad::operator<(const double a, const var &b)']]], + ['operator_3c_3c',['operator<<',['../namespacestan_1_1gm.html#ae9c40c419ed4088b66443029e8359904',1,'stan::gm']]], + ['operator_3c_3d',['operator<=',['../namespacestan_1_1agrad.html#a16c687c4cda4039dc722cfbccb98a836',1,'stan::agrad::operator<=(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#a7994ac18959dc8e5dfa2a2e184e6f844',1,'stan::agrad::operator<=(const var &a, const double &b)'],['../namespacestan_1_1agrad.html#a922f5b8418b94d72ad5751b057fa2a6f',1,'stan::agrad::operator<=(const double &a, const var &b)'],['../namespacestan_1_1agrad.html#a37a95747a6282483fd15682760013967',1,'stan::agrad::operator<=(const fvar< T > &x, const fvar< T > &y)'],['../namespacestan_1_1agrad.html#a85d1a3b82ccc2cdec61adbce358a23de',1,'stan::agrad::operator<=(const fvar< T > &x, double y)'],['../namespacestan_1_1agrad.html#a59152358a21913aa69c58e87fc895559',1,'stan::agrad::operator<=(double x, const fvar< T > &y)'],['../namespacestan_1_1agrad.html#ad79a6afe31a88499457cd316da3228f6',1,'stan::agrad::operator<=(const var &a, const double b)'],['../namespacestan_1_1agrad.html#a95038cb175ff8a78ae74260dad67762a',1,'stan::agrad::operator<=(const double a, const var &b)']]], + ['operator_3d',['operator=',['../structstan_1_1gm_1_1int__literal.html#a1e480a251d65ebd3b68eb0d88886918e',1,'stan::gm::int_literal::operator=()'],['../structstan_1_1gm_1_1double__literal.html#ac89f8c39a91a251fb0af83e2af876d3f',1,'stan::gm::double_literal::operator=()'],['../structstan_1_1gm_1_1array__literal.html#a944703d4016be32de3902eb090e78002',1,'stan::gm::array_literal::operator=()'],['../classstan_1_1mcmc_1_1ps__point.html#a6465e2b1c8c8abf56bd716fcb069be47',1,'stan::mcmc::ps_point::operator=()']]], + ['operator_3d_3d',['operator==',['../structstan_1_1gm_1_1expr__type.html#a40ff8512daac53614b78023e131f4638',1,'stan::gm::expr_type::operator==()'],['../namespacestan_1_1agrad.html#a830d82c706b521cee378eb7e8a0cd7b7',1,'stan::agrad::operator==(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#a927bbd061c1f873a70aca58c803315e0',1,'stan::agrad::operator==(const var &a, const double &b)'],['../namespacestan_1_1agrad.html#a55d28b38ec68e94b1504f657bcfe0e07',1,'stan::agrad::operator==(const double &a, const var &b)'],['../namespacestan_1_1agrad.html#af7ac331f5be998e2ecfbcd7359a295e8',1,'stan::agrad::operator==(const fvar< T > &x, const fvar< T > &y)'],['../namespacestan_1_1agrad.html#a0e5426b1de61dd143a791ea9375ea1f3',1,'stan::agrad::operator==(const fvar< T > &x, double y)'],['../namespacestan_1_1agrad.html#aa935399fdfdb5cb9017062c403623897',1,'stan::agrad::operator==(double x, const fvar< T > &y)'],['../namespacestan_1_1agrad.html#a1188a11f7af64553356cad475e6d6fd7',1,'stan::agrad::operator==(const var &a, const double b)'],['../namespacestan_1_1agrad.html#adf03ce96aca2d91ebfd9082ddb08ab60',1,'stan::agrad::operator==(const double a, const var &b)']]], + ['operator_3e',['operator>',['../namespacestan_1_1agrad.html#ad712e7d5e7b6ac090a17367ce063ad12',1,'stan::agrad::operator>(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#abb74b46284f1c5e4b878a63ee1400cb9',1,'stan::agrad::operator>(const var &a, const double &b)'],['../namespacestan_1_1agrad.html#af3baa98195c96dfda85e1d3e7b3dad18',1,'stan::agrad::operator>(const double &a, const var &b)'],['../namespacestan_1_1agrad.html#a5e161b7bc2dbcb9d990969ccb12499d9',1,'stan::agrad::operator>(const fvar< T > &x, const fvar< T > &y)'],['../namespacestan_1_1agrad.html#a50f810a2b10225f4aaabafb9e7e89054',1,'stan::agrad::operator>(const fvar< T > &x, double y)'],['../namespacestan_1_1agrad.html#ada1ccd3c3b7edb45aa02f9775e9a955d',1,'stan::agrad::operator>(double x, const fvar< T > &y)'],['../namespacestan_1_1agrad.html#a15ed77a2c9f81fb7293fdd4748a6ea53',1,'stan::agrad::operator>(const var &a, const double b)'],['../namespacestan_1_1agrad.html#a8c76a2c886c5a8dfd04a8db314b023dc',1,'stan::agrad::operator>(const double a, const var &b)']]], + ['operator_3e_3d',['operator>=',['../namespacestan_1_1agrad.html#a31cdf0b7a08d01a685d30822f9d395dc',1,'stan::agrad::operator>=(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#aa5ec0b4f2ff8cc4c9119b9cc2a5d3c58',1,'stan::agrad::operator>=(const var &a, const double &b)'],['../namespacestan_1_1agrad.html#af841090352d0e1f31978afbf7e1469db',1,'stan::agrad::operator>=(const double &a, const var &b)'],['../namespacestan_1_1agrad.html#ac654b0ca4c217705ed1bff6503723405',1,'stan::agrad::operator>=(const fvar< T > &x, const fvar< T > &y)'],['../namespacestan_1_1agrad.html#a4edcfc2e7c89ac76c0c43f1d01b9edb1',1,'stan::agrad::operator>=(const fvar< T > &x, double y)'],['../namespacestan_1_1agrad.html#af90b0c11af13e7d31bab2b7429bec732',1,'stan::agrad::operator>=(double x, const fvar< T > &y)'],['../namespacestan_1_1agrad.html#a9907066c12b56235c233ec56e108b684',1,'stan::agrad::operator>=(const var &a, const double b)'],['../namespacestan_1_1agrad.html#a89e08d2dddf60454bbae9c3a7078d14a',1,'stan::agrad::operator>=(const double a, const var &b)']]], + ['operator_5b_5d',['operator[]',['../classstan_1_1agrad_1_1op__matrix__vari.html#a33373afd7da2f7adc9283b5e7b140868',1,'stan::agrad::op_matrix_vari::operator[]()'],['../classstan_1_1agrad_1_1op__vector__vari.html#a4ad5b26a8c5e46b57eec2e9622c13fbc',1,'stan::agrad::op_vector_vari::operator[]()'],['../classstan_1_1math_1_1seq__view.html#abdd1705b880895c4e32e917fad70fb0b',1,'stan::math::seq_view::operator[]()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_01_eigen_1_1_dynamic_00_011_01_4_01_4.html#a6466225a392d75a98f0ae43c5f001820',1,'stan::math::seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, 1 > >::operator[]()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_011_00_01_eigen_1_1_dynamic_01_4_01_4.html#aafd342f1f6f9851fd8f8e3494b36068e',1,'stan::math::seq_view< T, Eigen::Matrix< S, 1, Eigen::Dynamic > >::operator[]()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4.html#ab45edf39aad64a4093db924b02322af9',1,'stan::math::seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, Eigen::Dynamic > >::operator[]()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01_s_01_4_01_4.html#acfe4d699397a114cabd8d970e569aac6',1,'stan::math::seq_view< T, std::vector< S > >::operator[]()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01_t_01_4_01_4.html#afe1bd346e72ac6adc53826801a7e54f2',1,'stan::math::seq_view< T, std::vector< T > >::operator[]()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01std_1_1vector_3_01_t_01_4_01_4_01_4.html#aa8d34d4dd171acbd81d642aea1b8b61e',1,'stan::math::seq_view< T, std::vector< std::vector< T > > >::operator[]()'],['../classstan_1_1math_1_1seq__view_3_01double_00_01std_1_1vector_3_01int_01_4_01_4.html#a05bbd23ec952656521365f99d575a64c',1,'stan::math::seq_view< double, std::vector< int > >::operator[]()'],['../classstan_1_1_vector_view.html#afa380e5d11746837925198eeb8669299',1,'stan::VectorView::operator[]()'],['../classstan_1_1_vector_view_3_01const_01_t_00_01is__array_00_01throw__if__accessed_01_4.html#a4ebd6fad997a99a0cb1ed71e4143befe',1,'stan::VectorView< const T, is_array, throw_if_accessed >::operator[]()'],['../classstan_1_1_vector_view_3_01const_01double_00_01false_00_01false_01_4.html#a2d4a632cfb7533c7ab183c8437b9433c',1,'stan::VectorView< const double, false, false >::operator[]()'],['../classstan_1_1_double_vector_view.html#a2d22664770b4a3061079683994cc5531',1,'stan::DoubleVectorView::operator[]()'],['../classstan_1_1_double_vector_view_3_01true_00_01false_01_4.html#adfc928699f9b1fdd936ff631ab68d405',1,'stan::DoubleVectorView< true, false >::operator[]()'],['../classstan_1_1_double_vector_view_3_01true_00_01true_01_4.html#a7b95c038ecbc5526605715fca51f6737',1,'stan::DoubleVectorView< true, true >::operator[]()']]], + ['ordered',['ordered',['../classstan_1_1io_1_1reader.html#ae5597679b7085f74c44ae623ef117410',1,'stan::io::reader']]], + ['ordered_5fconstrain',['ordered_constrain',['../classstan_1_1io_1_1reader.html#ae371520b9f4d28912092b43c40fdccb3',1,'stan::io::reader::ordered_constrain(size_t k)'],['../classstan_1_1io_1_1reader.html#a8e91154c913c5645c8a4ae474f1a6748',1,'stan::io::reader::ordered_constrain(size_t k, T &lp)'],['../namespacestan_1_1prob.html#a5b7b0a65348e29f0f018002a80ed035f',1,'stan::prob::ordered_constrain(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x)'],['../namespacestan_1_1prob.html#a8013ef2d8df4e964a99688d4d5b66b30',1,'stan::prob::ordered_constrain(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, T &lp)']]], + ['ordered_5ffree',['ordered_free',['../namespacestan_1_1prob.html#a49254bbed7656ffce7d701755f35591a',1,'stan::prob']]], + ['ordered_5flogistic_5flog',['ordered_logistic_log',['../namespacestan_1_1prob.html#a08672b48d49723b22234418ea31725e9',1,'stan::prob::ordered_logistic_log(int y, const T_lambda &lambda, const Eigen::Matrix< T_cut, Eigen::Dynamic, 1 > &c)'],['../namespacestan_1_1prob.html#a5dd231c095c24f5c6b344b6b06e85802',1,'stan::prob::ordered_logistic_log(int y, const T_lambda &lambda, const Eigen::Matrix< T_cut, Eigen::Dynamic, 1 > &c)']]], + ['ordered_5flogistic_5frng',['ordered_logistic_rng',['../namespacestan_1_1prob.html#a5becd684e61c1e96447752b65c202465',1,'stan::prob']]], + ['ordered_5funconstrain',['ordered_unconstrain',['../classstan_1_1io_1_1writer.html#af9e8b0cc64f52fe8b893aa68b24efe28',1,'stan::io::writer']]], + ['ordered_5fvar_5fdecl',['ordered_var_decl',['../structstan_1_1gm_1_1ordered__var__decl.html#a245a2f9aa050ab85b5586f98a7fa890d',1,'stan::gm::ordered_var_decl::ordered_var_decl()'],['../structstan_1_1gm_1_1ordered__var__decl.html#a805bcb3c7b339fb728ee04a4b1bc3dff',1,'stan::gm::ordered_var_decl::ordered_var_decl(expression const &K, std::string const &name, std::vector< expression > const &dims)']]], + ['owens_5ft',['owens_t',['../namespacestan_1_1agrad.html#a6a34e8ac9ab34d8bd7309b914670f77f',1,'stan::agrad::owens_t(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#ad7c9ae7ec1a20f802579797c3951846d',1,'stan::agrad::owens_t(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a9888ef51a909a957ca30b306cfd90beb',1,'stan::agrad::owens_t(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#a4ffb11bd376c638b747a8be17548b021',1,'stan::agrad::owens_t(const var &h, const var &a)'],['../namespacestan_1_1agrad.html#af68b3a37d8fede3f6ab613cf4278b86c',1,'stan::agrad::owens_t(const var &h, const double &a)'],['../namespacestan_1_1agrad.html#a0e87f87799c9d0290d5c972494e4caea',1,'stan::agrad::owens_t(const double &h, const var &a)'],['../namespacestan_1_1math.html#a66a7e8ebefd11e5801aab51d6ed9c9d8',1,'stan::math::owens_t()']]] +]; diff --git a/doc/api/html/search/functions_70.html b/doc/api/html/search/functions_70.html new file mode 100644 index 00000000000..c62125ede7b --- /dev/null +++ b/doc/api/html/search/functions_70.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/functions_70.js b/doc/api/html/search/functions_70.js new file mode 100644 index 00000000000..8ee973a15ac --- /dev/null +++ b/doc/api/html/search/functions_70.js @@ -0,0 +1,78 @@ +var searchData= +[ + ['pad_5fhelp_5foption',['pad_help_option',['../namespacestan_1_1io.html#aefe8bb54168558ab08f140cb2886f1e3',1,'stan::io']]], + ['param_5fname',['param_name',['../classstan_1_1mcmc_1_1chains.html#a1205fef2f70da7bdc88d8ff140b5d19b',1,'stan::mcmc::chains']]], + ['param_5fnames',['param_names',['../classstan_1_1mcmc_1_1chains.html#a95881c6244f8c1a59de9dc1b2ada3fbe',1,'stan::mcmc::chains']]], + ['param_5frange_5fi',['param_range_i',['../classstan_1_1model_1_1prob__grad.html#ac0eefb4d3d667a368820f0e7d2fb847c',1,'stan::model::prob_grad']]], + ['params_5fr',['params_r',['../classstan_1_1optimization_1_1_b_f_g_s_line_search.html#a3668e57491999e53bc083fa9ce7be0c2',1,'stan::optimization::BFGSLineSearch::params_r()'],['../classstan_1_1optimization_1_1_nesterov_gradient.html#a8b9b14a7b025c2978785d4b289c03a87',1,'stan::optimization::NesterovGradient::params_r()']]], + ['pareto_5fccdf_5flog',['pareto_ccdf_log',['../namespacestan_1_1prob.html#adbbe4b2736aa52b527690320f589f444',1,'stan::prob']]], + ['pareto_5fcdf',['pareto_cdf',['../namespacestan_1_1prob.html#a7f3bb39af8cf343288bc03b08d4995c1',1,'stan::prob']]], + ['pareto_5fcdf_5flog',['pareto_cdf_log',['../namespacestan_1_1prob.html#a355fe2fac0b8f75ba9152a5641584db0',1,'stan::prob']]], + ['pareto_5flog',['pareto_log',['../namespacestan_1_1prob.html#a6f227b32b40751c0969ed9208e53f250',1,'stan::prob::pareto_log(const T_y &y, const T_scale &y_min, const T_shape &alpha)'],['../namespacestan_1_1prob.html#ae76190b63d49cd29c4cf6cec4e530d2c',1,'stan::prob::pareto_log(const T_y &y, const T_scale &y_min, const T_shape &alpha)']]], + ['pareto_5frng',['pareto_rng',['../namespacestan_1_1prob.html#a28f8c3e807edaa26151a701410dbe540',1,'stan::prob']]], + ['parse',['parse',['../classstan_1_1io_1_1stan__csv__reader.html#a113f6a5169758e1c03370b0156f926e3',1,'stan::io::stan_csv_reader::parse()'],['../namespacestan_1_1gm.html#a027bc5ebd84646c7ce8fb6128e33dae8',1,'stan::gm::parse()']]], + ['parse_5fargs',['parse_args',['../classstan_1_1gm_1_1argument.html#ab89f5fe38e4a01cd098d5c38b25b63bd',1,'stan::gm::argument::parse_args()'],['../classstan_1_1gm_1_1argument__parser.html#acc91054d8cad8ed7b123bfc008589f91',1,'stan::gm::argument_parser::parse_args()'],['../classstan_1_1gm_1_1categorical__argument.html#aa5fcc67aed6fecfb8b1b4b430fbe8f9e',1,'stan::gm::categorical_argument::parse_args()'],['../classstan_1_1gm_1_1list__argument.html#a70d41fb22dbc0d4b7be35ad12ee28cd8',1,'stan::gm::list_argument::parse_args()'],['../classstan_1_1gm_1_1singleton__argument.html#a6ae2898ccb341e201a3f70af8d63b34f',1,'stan::gm::singleton_argument::parse_args()'],['../classstan_1_1gm_1_1unvalued__argument.html#a43ec298199e879d2254b0b22a07932fd',1,'stan::gm::unvalued_argument::parse_args()']]], + ['partial_5fderivative',['partial_derivative',['../namespacestan_1_1agrad.html#ad8a49a8b8a5b06f4053c40cb64a1fe48',1,'stan::agrad']]], + ['partials_5fvari',['partials_vari',['../classstan_1_1agrad_1_1partials__vari.html#a8c03a1f677444ee503551cc9cc718467',1,'stan::agrad::partials_vari']]], + ['phi',['phi',['../classstan_1_1mcmc_1_1base__hamiltonian.html#a4daa5d6148f56985b92397eb637868d8',1,'stan::mcmc::base_hamiltonian::phi()'],['../classstan_1_1mcmc_1_1dense__e__metric.html#a132d41ed5cea3b3f4e83f4d27f6e0984',1,'stan::mcmc::dense_e_metric::phi()'],['../classstan_1_1mcmc_1_1diag__e__metric.html#aab16db232dd37b1227032249d01dd0b5',1,'stan::mcmc::diag_e_metric::phi()'],['../classstan_1_1mcmc_1_1unit__e__metric.html#af866a9fc23c184997591e3377ad6e2bb',1,'stan::mcmc::unit_e_metric::phi()'],['../namespacestan_1_1agrad.html#a310443649bed5c3a85c01ee0cb5a8499',1,'stan::agrad::Phi(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#aab4d19226597a86f74257bde4f457521',1,'stan::agrad::Phi(const stan::agrad::var &a)'],['../namespacestan_1_1math.html#ac85644bbd92359d699f374adea62c643',1,'stan::math::Phi()']]], + ['phi_5fapprox',['Phi_approx',['../namespacestan_1_1agrad.html#a8332749395cd428484eb176964e28052',1,'stan::agrad::Phi_approx()'],['../namespacestan_1_1math.html#a6cf4bf2074175fd7bcde43f9f94e4d16',1,'stan::math::Phi_approx()']]], + ['pi',['pi',['../namespacestan_1_1math.html#aa2ffd66726e0532160e16e6b48d6f428',1,'stan::math']]], + ['poisson_5fccdf_5flog',['poisson_ccdf_log',['../namespacestan_1_1prob.html#a47e7fb827ea3efb81744f00ae02d3c8c',1,'stan::prob']]], + ['poisson_5fcdf',['poisson_cdf',['../namespacestan_1_1prob.html#a493a94836898c1c7daeefc66f76f3bcb',1,'stan::prob']]], + ['poisson_5fcdf_5flog',['poisson_cdf_log',['../namespacestan_1_1prob.html#a4bcc9d28c6419db6908062a120203225',1,'stan::prob']]], + ['poisson_5flog',['poisson_log',['../namespacestan_1_1prob.html#a4af491958f18e73de79a50f0eeab5cbf',1,'stan::prob::poisson_log(const T_n &n, const T_rate &lambda)'],['../namespacestan_1_1prob.html#a4c14df398fd68d83f82e93d7cf012e88',1,'stan::prob::poisson_log(const T_n &n, const T_rate &lambda)']]], + ['poisson_5flog_5flog',['poisson_log_log',['../namespacestan_1_1prob.html#a37ad053fe5e90d0886876e8be27e57f5',1,'stan::prob::poisson_log_log(const T_n &n, const T_log_rate &alpha)'],['../namespacestan_1_1prob.html#a4e7496b229fa8eb51083e449cfd20704',1,'stan::prob::poisson_log_log(const T_n &n, const T_log_rate &alpha)']]], + ['poisson_5frng',['poisson_rng',['../namespacestan_1_1prob.html#ae76f4412a22e18c1aacf098ab6c41dc5',1,'stan::prob']]], + ['positive_5fconstrain',['positive_constrain',['../namespacestan_1_1prob.html#a9cb1d75e59f02fa90c1052b403012dc8',1,'stan::prob::positive_constrain(const T x)'],['../namespacestan_1_1prob.html#a2ee662d6ef96688a59a873ef6e41a461',1,'stan::prob::positive_constrain(const T x, T &lp)']]], + ['positive_5ffree',['positive_free',['../namespacestan_1_1prob.html#af8aecbd34195ffe481fb331d62c7b9d5',1,'stan::prob']]], + ['positive_5finfinity',['positive_infinity',['../namespacestan_1_1math.html#a34675a70d3df614d88d33ddbdd49b49a',1,'stan::math']]], + ['positive_5fordered',['positive_ordered',['../classstan_1_1io_1_1reader.html#ac3f49da1bc5719a4cd6da4b35f488b34',1,'stan::io::reader']]], + ['positive_5fordered_5fconstrain',['positive_ordered_constrain',['../classstan_1_1io_1_1reader.html#aedeee305b5de15af5e1e296a07649dc2',1,'stan::io::reader::positive_ordered_constrain(size_t k)'],['../classstan_1_1io_1_1reader.html#ad2794458867712e2e7dd40674b8e2196',1,'stan::io::reader::positive_ordered_constrain(size_t k, T &lp)'],['../namespacestan_1_1prob.html#a264b000ea11a127f82b2a635c37af760',1,'stan::prob::positive_ordered_constrain(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x)'],['../namespacestan_1_1prob.html#ac046e29dc1e72c04cad85faf7884b1e8',1,'stan::prob::positive_ordered_constrain(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, T &lp)']]], + ['positive_5fordered_5ffree',['positive_ordered_free',['../namespacestan_1_1prob.html#aed117c56ae59674e81e38faadf423a4d',1,'stan::prob']]], + ['positive_5fordered_5funconstrain',['positive_ordered_unconstrain',['../classstan_1_1io_1_1writer.html#adf62c05a81fce5b27e1a2bdcd2eb51f3',1,'stan::io::writer']]], + ['positive_5fordered_5fvar_5fdecl',['positive_ordered_var_decl',['../structstan_1_1gm_1_1positive__ordered__var__decl.html#af60da77bab73766c34a6322d0c75d129',1,'stan::gm::positive_ordered_var_decl::positive_ordered_var_decl()'],['../structstan_1_1gm_1_1positive__ordered__var__decl.html#aa92b00bd4b03fa2192bdecbc3c816539',1,'stan::gm::positive_ordered_var_decl::positive_ordered_var_decl(expression const &K, std::string const &name, std::vector< expression > const &dims)']]], + ['pow',['pow',['../namespacestan_1_1agrad.html#ab1f104b0302a07417e72b4dbae3fc74c',1,'stan::agrad::pow(const var &base, const var &exponent)'],['../namespacestan_1_1agrad.html#abff57b6f6ebb58545a7e8d4a0c05611d',1,'stan::agrad::pow(const var &base, const double &exponent)'],['../namespacestan_1_1agrad.html#a8e4a959251353750a1656804b46507fd',1,'stan::agrad::pow(const double &base, const var &exponent)'],['../namespacestan_1_1agrad.html#a2d8fddd3123eb3574ff8e06d4fc7248d',1,'stan::agrad::pow(const fvar< T > &x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#ace3246b2d3ac1a77d9f4a0f8974960b8',1,'stan::agrad::pow(const double x1, const fvar< T > &x2)'],['../namespacestan_1_1agrad.html#a25f02a3133f34b96d74727823e21d70b',1,'stan::agrad::pow(const fvar< T > &x1, const double x2)'],['../namespacestan_1_1agrad.html#add7765fa6394e825bd26a69f84218193',1,'stan::agrad::pow(const var &base, const double exponent)'],['../namespacestan_1_1agrad.html#acd1d27b770b1609c7f161ed57c4621ac',1,'stan::agrad::pow(const double base, const var &exponent)']]], + ['precomp_5fv_5fvari',['precomp_v_vari',['../classstan_1_1agrad_1_1precomp__v__vari.html#a3ca5c79bf568105418d1b0048a96967f',1,'stan::agrad::precomp_v_vari']]], + ['prev_5ff',['prev_f',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#ab29933c9bf9263b7b165b589c0e1aba3',1,'stan::optimization::BFGSMinimizer']]], + ['prev_5fg',['prev_g',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a846398bc345d84bab66dc1f1df9e95e0',1,'stan::optimization::BFGSMinimizer']]], + ['prev_5fs',['prev_s',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a902e16cc988e9ca31cace95dea86dfb7',1,'stan::optimization::BFGSMinimizer']]], + ['prev_5fstep_5fsize',['prev_step_size',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a5fe16e6f70fed6e1911fe856cd52476e',1,'stan::optimization::BFGSMinimizer']]], + ['prev_5fx',['prev_x',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a000b87bcf59d279ba44efec85f971078',1,'stan::optimization::BFGSMinimizer']]], + ['print',['print',['../classstan_1_1gm_1_1argument.html#a00e74796257dff5e01e40a771a6bdc93',1,'stan::gm::argument::print()'],['../classstan_1_1gm_1_1argument__parser.html#a0d439a88a50a5497f76bbc5f020aaf91',1,'stan::gm::argument_parser::print()'],['../classstan_1_1gm_1_1categorical__argument.html#a571a79c8271b50dee3a49641690773cf',1,'stan::gm::categorical_argument::print()'],['../classstan_1_1gm_1_1list__argument.html#a55f86d294e39ee6a422bdf1308fb3e5b',1,'stan::gm::list_argument::print()'],['../classstan_1_1gm_1_1unvalued__argument.html#ad9feae771a79a8c5d8f96111b6bb08e5',1,'stan::gm::unvalued_argument::print()'],['../classstan_1_1gm_1_1valued__argument.html#a4b22c1fa6c57037233201ba7f800cf1a',1,'stan::gm::valued_argument::print()'],['../classstan_1_1io_1_1cmd__line.html#a7b567a1d5ff8fbfd102541ff7165f0a8',1,'stan::io::cmd_line::print()']]], + ['print_5fadapt_5ffinish',['print_adapt_finish',['../classstan_1_1io_1_1mcmc__writer.html#a19e50100237ae6ceedb36f3485db0a98',1,'stan::io::mcmc_writer::print_adapt_finish(stan::mcmc::base_mcmc *sampler, std::ostream *stream)'],['../classstan_1_1io_1_1mcmc__writer.html#a8e38711ae1d5cb3562d739e65a26a672',1,'stan::io::mcmc_writer::print_adapt_finish(stan::mcmc::base_mcmc *sampler)']]], + ['print_5fdiagnostic_5fnames',['print_diagnostic_names',['../classstan_1_1io_1_1mcmc__writer.html#a92e6f182bccdd993e73f751e5aafd7e9',1,'stan::io::mcmc_writer']]], + ['print_5fdiagnostic_5fparams',['print_diagnostic_params',['../classstan_1_1io_1_1mcmc__writer.html#a611c78b4786bb2a649bbaa660350dc35',1,'stan::io::mcmc_writer']]], + ['print_5fhelp',['print_help',['../classstan_1_1gm_1_1argument.html#aa2e3ed12ca3904af93b24c42f8a008ff',1,'stan::gm::argument::print_help()'],['../classstan_1_1gm_1_1argument__parser.html#a9ab402e181e3de508c3a7b594cb67960',1,'stan::gm::argument_parser::print_help()'],['../classstan_1_1gm_1_1categorical__argument.html#a6d8744329f8af88ec15747b57851bc67',1,'stan::gm::categorical_argument::print_help()'],['../classstan_1_1gm_1_1list__argument.html#a55d7f8d70a85d02895446acc7e9402ee',1,'stan::gm::list_argument::print_help()'],['../classstan_1_1gm_1_1unvalued__argument.html#a97c066f9a95356069ff6923d483ea03b',1,'stan::gm::unvalued_argument::print_help()'],['../classstan_1_1gm_1_1valued__argument.html#a67c2fcf60e605b17de08ef051e54876c',1,'stan::gm::valued_argument::print_help()']]], + ['print_5fhelp_5fhelper',['print_help_helper',['../namespacestan_1_1io.html#a6a7173ea51d2f2c2dc710d3a846fc732',1,'stan::io']]], + ['print_5fhelp_5foption',['print_help_option',['../namespacestan_1_1io.html#a0b47261532cf7c027e939aca02088c06',1,'stan::io']]], + ['print_5fprogress',['print_progress',['../namespacestan_1_1gm.html#a36c90a4a1e6a4833c1e3a12a964f31dc',1,'stan::gm']]], + ['print_5fquoted_5fexpression',['print_quoted_expression',['../namespacestan_1_1gm.html#a53960511e1fa7ae0e66d681f3055f199',1,'stan::gm']]], + ['print_5fsample_5fnames',['print_sample_names',['../classstan_1_1io_1_1mcmc__writer.html#a4ff21af4911d312b84f3ad955c6be1f7',1,'stan::io::mcmc_writer']]], + ['print_5fsample_5fparams',['print_sample_params',['../classstan_1_1io_1_1mcmc__writer.html#a1141fad60b8e8587b5f84ded115a870f',1,'stan::io::mcmc_writer']]], + ['print_5fstack',['print_stack',['../namespacestan_1_1agrad.html#a77de304bacc69535fb9a5ccd52454219',1,'stan::agrad']]], + ['print_5fstanc_5fhelp',['print_stanc_help',['../stanc__helper_8hpp.html#ab8ff534ebd7aa89be78b2b9e65f5f33a',1,'stanc_helper.hpp']]], + ['print_5fstatement',['print_statement',['../structstan_1_1gm_1_1print__statement.html#aeebe03d9212e3ddbe4fabdaf4873a466',1,'stan::gm::print_statement::print_statement()'],['../structstan_1_1gm_1_1print__statement.html#ab4522e7d5640848cebed9fd2509bfd32',1,'stan::gm::print_statement::print_statement(const std::vector< printable > &printables)']]], + ['print_5fstring_5fliteral',['print_string_literal',['../namespacestan_1_1gm.html#ab0047255699c74937f85d6fc52a25cb7',1,'stan::gm']]], + ['print_5ftiming',['print_timing',['../classstan_1_1io_1_1mcmc__writer.html#acec599e2966fe94577b9a5e125edc058',1,'stan::io::mcmc_writer::print_timing(double warmDeltaT, double sampleDeltaT, std::ostream *stream, const char prefix= '\0')'],['../classstan_1_1io_1_1mcmc__writer.html#a18d3702721db48c5a6a6ae0f693988fe',1,'stan::io::mcmc_writer::print_timing(double warmDeltaT, double sampleDeltaT)']]], + ['print_5fusage',['print_usage',['../classstan_1_1gm_1_1argument__parser.html#aab87bcb3b493725f33fe83d51a402f92',1,'stan::gm::argument_parser::print_usage()'],['../print_8hpp.html#ae5ad5cbeccaedc03a48d3c7eaa803e79',1,'print_usage(): print.hpp']]], + ['print_5fvalid',['print_valid',['../classstan_1_1gm_1_1list__argument.html#aec1358b17e4ab6e88093d9601bd574ad',1,'stan::gm::list_argument::print_valid()'],['../classstan_1_1gm_1_1singleton__argument.html#a8b1ec553f2faad91f393a16301f283b7',1,'stan::gm::singleton_argument::print_valid()'],['../classstan_1_1gm_1_1valued__argument.html#a71e5e9f18b38112a0f37e631e06479c2',1,'stan::gm::valued_argument::print_valid()']]], + ['print_5fvalue',['print_value',['../classstan_1_1gm_1_1list__argument.html#a7fe07f7eb68fcbe07902f275c36a9de7',1,'stan::gm::list_argument::print_value()'],['../classstan_1_1gm_1_1singleton__argument.html#a314ff92f87549d7b79966e5ff0148f27',1,'stan::gm::singleton_argument::print_value()'],['../classstan_1_1gm_1_1valued__argument.html#a3d7db8f03b459a944745799cb17fbb22',1,'stan::gm::valued_argument::print_value()']]], + ['print_5fvar_5forigin',['print_var_origin',['../namespacestan_1_1gm.html#afbacd22142d44e8f79d40a512441c060',1,'stan::gm']]], + ['print_5fversion',['print_version',['../stanc__helper_8hpp.html#a89aadce7a620baad44661f64650a2c57',1,'stanc_helper.hpp']]], + ['printable',['printable',['../structstan_1_1gm_1_1printable.html#a08d5587f674f2bcea656dfc21b4368a7',1,'stan::gm::printable::printable()'],['../structstan_1_1gm_1_1printable.html#a698c3a1a3e88fe55ef803940688f2fe7',1,'stan::gm::printable::printable(const expression &expression)'],['../structstan_1_1gm_1_1printable.html#aa88ce12741897574e993ddf73630a2dc',1,'stan::gm::printable::printable(const std::string &msg)'],['../structstan_1_1gm_1_1printable.html#ab6c9efb0d66476e95420d0d0a9a34971',1,'stan::gm::printable::printable(const printable_t &printable)'],['../structstan_1_1gm_1_1printable.html#a73fd1eca794d1abeedf35458c1298fcc',1,'stan::gm::printable::printable(const printable &printable)']]], + ['printable_5fvisgen',['printable_visgen',['../structstan_1_1gm_1_1printable__visgen.html#a07ac177e70ed67abf0a8c104ae00c12b',1,'stan::gm::printable_visgen']]], + ['prob',['prob',['../classstan_1_1io_1_1reader.html#ad57e12e95a36df2d9448f6123e3d2cfa',1,'stan::io::reader']]], + ['prob_5fconstrain',['prob_constrain',['../classstan_1_1io_1_1reader.html#a2d999e486addc7652b2be90365b89bc4',1,'stan::io::reader::prob_constrain()'],['../classstan_1_1io_1_1reader.html#a07a0565ad1ff42fe678bcb51ed748455',1,'stan::io::reader::prob_constrain(T &lp)'],['../namespacestan_1_1prob.html#a675a89a2298e205693a1291bff9e8517',1,'stan::prob::prob_constrain(const T x)'],['../namespacestan_1_1prob.html#a5c2e4977a32258e859e18c3d93ff7fb2',1,'stan::prob::prob_constrain(const T x, T &lp)']]], + ['prob_5ffree',['prob_free',['../namespacestan_1_1prob.html#a6df28f004649a2e2453b2dc068dce763',1,'stan::prob']]], + ['prob_5fgrad',['prob_grad',['../classstan_1_1model_1_1prob__grad.html#a8b51f2731af4391fb46981ee6d65deb6',1,'stan::model::prob_grad::prob_grad(size_t num_params_r)'],['../classstan_1_1model_1_1prob__grad.html#a879682609a70983fde0ac281a6a3c5d0',1,'stan::model::prob_grad::prob_grad(size_t num_params_r, std::vector< std::pair< int, int > > &param_ranges_i)']]], + ['prob_5funconstrain',['prob_unconstrain',['../classstan_1_1io_1_1writer.html#a320165b59bc22f73db4898d4d4a5a7e1',1,'stan::io::writer']]], + ['probe_5fargs',['probe_args',['../classstan_1_1gm_1_1argument.html#a1d9fabf656c50a0e5bc3d5d47ca091aa',1,'stan::gm::argument::probe_args()'],['../classstan_1_1gm_1_1argument__probe.html#a4754d08a83d1bdf23e18ceb1b16dc26a',1,'stan::gm::argument_probe::probe_args()'],['../classstan_1_1gm_1_1categorical__argument.html#a5d662cc0b84b02e3b3622a0eeec02bf7',1,'stan::gm::categorical_argument::probe_args()'],['../classstan_1_1gm_1_1list__argument.html#a0ffea05532b87732f82f2099e189306e',1,'stan::gm::list_argument::probe_args()'],['../classstan_1_1gm_1_1singleton__argument.html#aaf5dc642547b460e7df60fd9a1e3a025',1,'stan::gm::singleton_argument::probe_args()']]], + ['prod',['prod',['../namespacestan_1_1math.html#a1649a895ec6e79097d5645a3f8b8a1e6',1,'stan::math::prod(const std::vector< T > &v)'],['../namespacestan_1_1math.html#ad7082de8742d87f7a0fa0842207341c9',1,'stan::math::prod(const Eigen::Matrix< T, R, C > &v)']]], + ['program',['program',['../structstan_1_1gm_1_1program.html#a3bdfcb0bc8822d6edd2253bda7dcbfdb',1,'stan::gm::program::program()'],['../structstan_1_1gm_1_1program.html#aa11648de93a4e6496c0cfe7850134436',1,'stan::gm::program::program(const std::vector< var_decl > &data_decl, const std::pair< std::vector< var_decl >, std::vector< statement > > &derived_data_decl, const std::vector< var_decl > &parameter_decl, const std::pair< std::vector< var_decl >, std::vector< statement > > &derived_decl, const statement &st, const std::pair< std::vector< var_decl >, std::vector< statement > > &generated_decl)']]], + ['program_5fgrammar',['program_grammar',['../structstan_1_1gm_1_1program__grammar.html#a37628310038c1d41ac858edc87763f6e',1,'stan::gm::program_grammar']]], + ['promote',['promote',['../structstan_1_1math_1_1promoter.html#ab3df6e7131a09943826d1b995142d7d6',1,'stan::math::promoter::promote()'],['../structstan_1_1math_1_1promoter_3_01_t_00_01_t_01_4.html#ac8db3f3f3410059f5cae51383f1b38c2',1,'stan::math::promoter< T, T >::promote()'],['../structstan_1_1math_1_1promoter_3_01std_1_1vector_3_01_f_01_4_00_01std_1_1vector_3_01_t_01_4_01_4.html#a357d5eb63ba812437c51640670cef745',1,'stan::math::promoter< std::vector< F >, std::vector< T > >::promote()'],['../structstan_1_1math_1_1promoter_3_01std_1_1vector_3_01_t_01_4_00_01std_1_1vector_3_01_t_01_4_01_4.html#adb1706254fcd6734bf986e2cd01b093f',1,'stan::math::promoter< std::vector< T >, std::vector< T > >::promote()'],['../structstan_1_1math_1_1promoter_3_01_eigen_1_1_matrix_3_01_f_00_01_r_00_01_c_01_4_00_01_eigen_1_142b48fda94601374e41a81325f3f7b84.html#a9964d13b9f2f05efca2b21ac165210d8',1,'stan::math::promoter< Eigen::Matrix< F, R, C >, Eigen::Matrix< T, R, C > >::promote()'],['../structstan_1_1math_1_1promoter_3_01_eigen_1_1_matrix_3_01_t_00_01_r_00_01_c_01_4_00_01_eigen_1_12d7fadf0560f1f2f3abc5388b7666f9c.html#a525fc8cb91f5c4c22195cdb004b1eb0f',1,'stan::math::promoter< Eigen::Matrix< T, R, C >, Eigen::Matrix< T, R, C > >::promote()']]], + ['promote_5fcommon',['promote_common',['../namespacestan_1_1math.html#a91458631115a8d1cf29298431f745556',1,'stan::math']]], + ['promote_5fprimitive',['promote_primitive',['../namespacestan_1_1gm.html#a6ca8ea09cf26b1fdd7c5e31c8febd8d9',1,'stan::gm::promote_primitive(const expr_type &et)'],['../namespacestan_1_1gm.html#a08ffae837e524e7ee4ede3cc51c7a2fb',1,'stan::gm::promote_primitive(const expr_type &et1, const expr_type &et2)']]], + ['promote_5fto',['promote_to',['../structstan_1_1math_1_1promoter.html#a892e350b17a5930b9de4a9ff05eddc39',1,'stan::math::promoter::promote_to()'],['../structstan_1_1math_1_1promoter_3_01_t_00_01_t_01_4.html#a108a1ffe4c0560f0c0b384270ea801f1',1,'stan::math::promoter< T, T >::promote_to()'],['../structstan_1_1math_1_1promoter_3_01std_1_1vector_3_01_f_01_4_00_01std_1_1vector_3_01_t_01_4_01_4.html#a3da744179c9bbe7fe2ac326a4dcba352',1,'stan::math::promoter< std::vector< F >, std::vector< T > >::promote_to()'],['../structstan_1_1math_1_1promoter_3_01std_1_1vector_3_01_t_01_4_00_01std_1_1vector_3_01_t_01_4_01_4.html#a099437577ccd004d58c5b2ee3e5acf06',1,'stan::math::promoter< std::vector< T >, std::vector< T > >::promote_to()'],['../structstan_1_1math_1_1promoter_3_01_eigen_1_1_matrix_3_01_f_00_01_r_00_01_c_01_4_00_01_eigen_1_142b48fda94601374e41a81325f3f7b84.html#a7ed5c4e3899aca0cb2ed4cea530807af',1,'stan::math::promoter< Eigen::Matrix< F, R, C >, Eigen::Matrix< T, R, C > >::promote_to()'],['../structstan_1_1math_1_1promoter_3_01_eigen_1_1_matrix_3_01_t_00_01_r_00_01_c_01_4_00_01_eigen_1_12d7fadf0560f1f2f3abc5388b7666f9c.html#a46f61632d1bdeede4431d730b4251d37',1,'stan::math::promoter< Eigen::Matrix< T, R, C >, Eigen::Matrix< T, R, C > >::promote_to()']]], + ['ps_5fpoint',['ps_point',['../classstan_1_1mcmc_1_1ps__point.html#ab3577ab2d8d6109485e03e893e770654',1,'stan::mcmc::ps_point::ps_point(int n)'],['../classstan_1_1mcmc_1_1ps__point.html#aa31c2f392681f074461372c98f76b7d0',1,'stan::mcmc::ps_point::ps_point(const ps_point &z)']]] +]; diff --git a/doc/api/html/search/functions_71.html b/doc/api/html/search/functions_71.html new file mode 100644 index 00000000000..af909d4a26b --- /dev/null +++ b/doc/api/html/search/functions_71.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/functions_71.js b/doc/api/html/search/functions_71.js new file mode 100644 index 00000000000..e4329330ede --- /dev/null +++ b/doc/api/html/search/functions_71.js @@ -0,0 +1,8 @@ +var searchData= +[ + ['quad_5fform',['quad_form',['../namespacestan_1_1agrad.html#a12051c57c37d841f90b64d18d18b3572',1,'stan::agrad::quad_form(const Eigen::Matrix< TA, RA, CA > &A, const Eigen::Matrix< TB, RB, CB > &B)'],['../namespacestan_1_1agrad.html#ad10e001e4f70e7c20a0d0e4fc9ad6e45',1,'stan::agrad::quad_form(const Eigen::Matrix< TA, RA, CA > &A, const Eigen::Matrix< TB, RB, 1 > &B)'],['../namespacestan_1_1math.html#a376cbe31002df6a319da4caaaeb8598c',1,'stan::math::quad_form(const Eigen::Matrix< double, RA, CA > &A, const Eigen::Matrix< double, RB, CB > &B)'],['../namespacestan_1_1math.html#a0e0213e916c2185844b48eea25312e86',1,'stan::math::quad_form(const Eigen::Matrix< double, RA, CA > &A, const Eigen::Matrix< double, RB, 1 > &B)']]], + ['quad_5fform_5fsym',['quad_form_sym',['../namespacestan_1_1agrad.html#a0065419b6716e2e9bd2b046209eeb29d',1,'stan::agrad::quad_form_sym(const Eigen::Matrix< TA, RA, CA > &A, const Eigen::Matrix< TB, RB, CB > &B)'],['../namespacestan_1_1agrad.html#a18283c753845a6ff14c457500314171c',1,'stan::agrad::quad_form_sym(const Eigen::Matrix< TA, RA, CA > &A, const Eigen::Matrix< TB, RB, 1 > &B)'],['../namespacestan_1_1math.html#a2cc753af413f715d82b992aae8b10fde',1,'stan::math::quad_form_sym(const Eigen::Matrix< double, RA, CA > &A, const Eigen::Matrix< double, RB, CB > &B)'],['../namespacestan_1_1math.html#a9355d4e6239f0bb06e0b8d2302f37af4',1,'stan::math::quad_form_sym(const Eigen::Matrix< double, RA, CA > &A, const Eigen::Matrix< double, RB, 1 > &B)']]], + ['quantile',['quantile',['../classstan_1_1mcmc_1_1chains.html#a56d312e2c426bff532c77b9156031023',1,'stan::mcmc::chains::quantile(const int chain, const int index, const double prob)'],['../classstan_1_1mcmc_1_1chains.html#adc3507c5fadc08b20d8a62278ea1403d',1,'stan::mcmc::chains::quantile(const int index, const double prob)'],['../classstan_1_1mcmc_1_1chains.html#ad53b60119eb5c4c0b6dda5b718d10bcf',1,'stan::mcmc::chains::quantile(const int chain, const std::string &name, const double prob)'],['../classstan_1_1mcmc_1_1chains.html#a7234fcd741119e1973f1879dfee16494',1,'stan::mcmc::chains::quantile(const std::string &name, const double prob)']]], + ['quantiles',['quantiles',['../classstan_1_1mcmc_1_1chains.html#ad387dd810f96b6ac37efd2992fc29630',1,'stan::mcmc::chains::quantiles(const int chain, const int index, const Eigen::VectorXd &probs)'],['../classstan_1_1mcmc_1_1chains.html#a491e846ff148541c564d7db4a0794589',1,'stan::mcmc::chains::quantiles(const int index, const Eigen::VectorXd &probs)'],['../classstan_1_1mcmc_1_1chains.html#ab71e51ca47d8961e7a338a4275ddc718',1,'stan::mcmc::chains::quantiles(const int chain, const std::string &name, const Eigen::VectorXd &probs)'],['../classstan_1_1mcmc_1_1chains.html#a5ab7f0a936ba813e9086172f2946baa4',1,'stan::mcmc::chains::quantiles(const std::string &name, const Eigen::VectorXd &probs)']]], + ['quiet_5fnan',['quiet_NaN',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a8c903c018ba2cf816a16b981cd0148fd',1,'std::numeric_limits< stan::agrad::fvar< T > >::quiet_NaN()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#ac27177b2b7f896ddd695084b3616eae6',1,'std::numeric_limits< stan::agrad::var >::quiet_NaN()']]] +]; diff --git a/doc/api/html/search/functions_72.html b/doc/api/html/search/functions_72.html new file mode 100644 index 00000000000..a4336f7c495 --- /dev/null +++ b/doc/api/html/search/functions_72.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/functions_72.js b/doc/api/html/search/functions_72.js new file mode 100644 index 00000000000..b5313f5cce0 --- /dev/null +++ b/doc/api/html/search/functions_72.js @@ -0,0 +1,51 @@ +var searchData= +[ + ['raise_5fdomain_5ferror',['raise_domain_error',['../namespacestan_1_1math_1_1policies_1_1detail.html#a247352f3a333a7aebbe6ccf09473f2f9',1,'stan::math::policies::detail::raise_domain_error(const char *function, const char *message, const T_val &val, const ::boost::math::policies::domain_error< ::boost::math::policies::throw_on_error > &)'],['../namespacestan_1_1math_1_1policies_1_1detail.html#a1e05fecf80a5d9760597fa17374ac729',1,'stan::math::policies::detail::raise_domain_error(const char *, const char *, const T_val &, const ::boost::math::policies::domain_error< ::boost::math::policies::ignore_error > &)'],['../namespacestan_1_1math_1_1policies_1_1detail.html#a37a116f5cfdd061c779fa174223cc64b',1,'stan::math::policies::detail::raise_domain_error(const char *, const char *, const T_val &, const ::boost::math::policies::domain_error< ::boost::math::policies::errno_on_error > &)'],['../namespacestan_1_1math_1_1policies_1_1detail.html#a84db90eb3648bab11711b7282e69cf0b',1,'stan::math::policies::detail::raise_domain_error(const char *function, const char *message, const T_val &val, const ::boost::math::policies::domain_error< ::boost::math::policies::user_error > &)'],['../namespacestan_1_1math_1_1policies.html#ac83ded77a40cbdc0bdb98879f0d24fb7',1,'stan::math::policies::raise_domain_error()']]], + ['range',['range',['../structstan_1_1gm_1_1range.html#a64e3d1cc595ede56d2c46cca8689cc95',1,'stan::gm::range::range()'],['../structstan_1_1gm_1_1range.html#a0b26a72500318c7840baed6ca87ce946',1,'stan::gm::range::range(expression const &low, expression const &high)']]], + ['rank',['rank',['../namespacestan_1_1math.html#a1baa9539e0a8d4ea50aa16b73d736d93',1,'stan::math::rank(const std::vector< T > &v, int s)'],['../namespacestan_1_1math.html#a808d3133624cd36ac410ba872ea653c2',1,'stan::math::rank(const Eigen::Matrix< T, R, C > &v, int s)']]], + ['rayleigh_5fccdf_5flog',['rayleigh_ccdf_log',['../namespacestan_1_1prob.html#acb3f08ecac9dc1faebaff9f209c39c3e',1,'stan::prob']]], + ['rayleigh_5fcdf',['rayleigh_cdf',['../namespacestan_1_1prob.html#a21adf5dd176a990c274cb58c6b6ad491',1,'stan::prob']]], + ['rayleigh_5fcdf_5flog',['rayleigh_cdf_log',['../namespacestan_1_1prob.html#a6790ee20a779a4ec36207229ed36bf4e',1,'stan::prob']]], + ['rayleigh_5flog',['rayleigh_log',['../namespacestan_1_1prob.html#a98165bd7ce46385b8c12fa228ee90718',1,'stan::prob::rayleigh_log(const T_y &y, const T_scale &sigma)'],['../namespacestan_1_1prob.html#af1c16f2642c0e8fb3237ba5f4b704e98',1,'stan::prob::rayleigh_log(const T_y &y, const T_scale &sigma)']]], + ['rayleigh_5frng',['rayleigh_rng',['../namespacestan_1_1prob.html#ac500ff019314d3a79c6d1cd0e41ce0dd',1,'stan::prob']]], + ['read_5fadaptation',['read_adaptation',['../classstan_1_1io_1_1stan__csv__reader.html#afa996f8c6897a2e40f3e5b44a26db0e3',1,'stan::io::stan_csv_reader']]], + ['read_5fcorr_5fl',['read_corr_L',['../namespacestan_1_1prob.html#a12361bac5c2810d6245cf97465f1f09d',1,'stan::prob::read_corr_L(const Eigen::Array< T, Eigen::Dynamic, 1 > &CPCs, const size_t K)'],['../namespacestan_1_1prob.html#a18ea63e587986f4c53909c26b718cc17',1,'stan::prob::read_corr_L(const Eigen::Array< T, Eigen::Dynamic, 1 > &CPCs, const size_t K, T &log_prob)']]], + ['read_5fcorr_5fmatrix',['read_corr_matrix',['../namespacestan_1_1prob.html#a049065737ff2e957c65db870c99d509d',1,'stan::prob::read_corr_matrix(const Eigen::Array< T, Eigen::Dynamic, 1 > &CPCs, const size_t K)'],['../namespacestan_1_1prob.html#a21dcd8cff30b002e3483120f231dde9e',1,'stan::prob::read_corr_matrix(const Eigen::Array< T, Eigen::Dynamic, 1 > &CPCs, const size_t K, T &log_prob)']]], + ['read_5fcov_5fl',['read_cov_L',['../namespacestan_1_1prob.html#a1545e79c24324fc626f4422b45d4c2b8',1,'stan::prob']]], + ['read_5fcov_5fmatrix',['read_cov_matrix',['../namespacestan_1_1prob.html#ad5a94ee9ba8f88bc5f06a1bc0973cd64',1,'stan::prob::read_cov_matrix(const Eigen::Array< T, Eigen::Dynamic, 1 > &CPCs, const Eigen::Array< T, Eigen::Dynamic, 1 > &sds, T &log_prob)'],['../namespacestan_1_1prob.html#a39d24789bf8d8528e6d308c57ec8d309',1,'stan::prob::read_cov_matrix(const Eigen::Array< T, Eigen::Dynamic, 1 > &CPCs, const Eigen::Array< T, Eigen::Dynamic, 1 > &sds)']]], + ['read_5fheader',['read_header',['../classstan_1_1io_1_1stan__csv__reader.html#a7b816d25cface2d2236069cfc54367bf',1,'stan::io::stan_csv_reader']]], + ['read_5fmetadata',['read_metadata',['../classstan_1_1io_1_1stan__csv__reader.html#a882e750d8fb201dfa1cdb5e174f21957',1,'stan::io::stan_csv_reader']]], + ['read_5fsamples',['read_samples',['../classstan_1_1io_1_1stan__csv__reader.html#a1ec68f0382342bfd8e7de9d823239247',1,'stan::io::stan_csv_reader']]], + ['reader',['reader',['../classstan_1_1io_1_1reader.html#aa3ae88d711db3f2469c86131c28191ac',1,'stan::io::reader']]], + ['recover_5fall',['recover_all',['../classstan_1_1memory_1_1chunk__alloc.html#a25506eb4680556464e3a52772bb09794',1,'stan::memory::chunk_alloc::recover_all()'],['../classstan_1_1memory_1_1stack__alloc.html#a453c7dd354d0cb89389f648882cd459d',1,'stan::memory::stack_alloc::recover_all()']]], + ['recover_5fmemory',['recover_memory',['../classstan_1_1agrad_1_1vari.html#a653f4d93055013f4b4332e2e992268c8',1,'stan::agrad::vari::recover_memory()'],['../namespacestan_1_1agrad.html#a352bfc3b18e738626b7cbbbbcd23ef06',1,'stan::agrad::recover_memory()'],['../namespacestan_1_1agrad.html#a352bfc3b18e738626b7cbbbbcd23ef06',1,'stan::agrad::recover_memory()']]], + ['remove',['remove',['../structstan_1_1gm_1_1variable__map.html#ab50a247ce7a5a9c041f02e51de75ab8c',1,'stan::gm::variable_map::remove()'],['../classstan_1_1io_1_1dump.html#ae73ebbf7c924c54f04cb4cab5d3bb61c',1,'stan::io::dump::remove()']]], + ['rep_5farray',['rep_array',['../namespacestan_1_1math.html#ad3d78d2735a35451f02bcd2f4da24886',1,'stan::math::rep_array(const T &x, int n)'],['../namespacestan_1_1math.html#a8edf0b7ec2ad24b1fda26a8d58513106',1,'stan::math::rep_array(const T &x, int m, int n)'],['../namespacestan_1_1math.html#a53054db4cfa6672654fbaedafbdae242',1,'stan::math::rep_array(const T &x, int k, int m, int n)']]], + ['rep_5fmatrix',['rep_matrix',['../namespacestan_1_1math.html#ad31fd1c6f1cd56836b049489009d2221',1,'stan::math::rep_matrix(const T &x, int m, int n)'],['../namespacestan_1_1math.html#a79febbfc52e2118819bb0eb77fbea561',1,'stan::math::rep_matrix(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v, int n)'],['../namespacestan_1_1math.html#aa70f063ee9a5790fbed08ba8ae07c52e',1,'stan::math::rep_matrix(const Eigen::Matrix< T, 1, Eigen::Dynamic > &rv, int m)']]], + ['rep_5frow_5fvector',['rep_row_vector',['../namespacestan_1_1math.html#ac9d77ddf6ad38a102ebd6f5e433c3e6c',1,'stan::math']]], + ['rep_5fvector',['rep_vector',['../namespacestan_1_1math.html#a2b132ea41ccfdb7b0ca4897cbb64649a',1,'stan::math']]], + ['resize',['resize',['../namespacestan_1_1math.html#a8abf3ffa6d67a158348134225c9d3090',1,'stan::math']]], + ['restart',['restart',['../classstan_1_1mcmc_1_1base__adaptation.html#afc41c7354b21fd64eb4a3d5964b4e230',1,'stan::mcmc::base_adaptation::restart()'],['../classstan_1_1mcmc_1_1stepsize__adaptation.html#ae0eba1b2db8fce83d078f095b6407c40',1,'stan::mcmc::stepsize_adaptation::restart()'],['../classstan_1_1mcmc_1_1windowed__adaptation.html#a0c6ce68d4fdde8df0bdcb5436aae9675',1,'stan::mcmc::windowed_adaptation::restart()'],['../classstan_1_1prob_1_1welford__covar__estimator.html#ac753e07b944404946cba323d0f33481d',1,'stan::prob::welford_covar_estimator::restart()'],['../classstan_1_1prob_1_1welford__var__estimator.html#a61dacc8a07628708042aaf83aa7b1f70',1,'stan::prob::welford_var_estimator::restart()']]], + ['rising_5ffactorial',['rising_factorial',['../namespacestan_1_1agrad.html#ae4c3b430f306e040a9179e658765b149',1,'stan::agrad::rising_factorial(const fvar< T > &x, const fvar< T > &n)'],['../namespacestan_1_1agrad.html#ad41059332ac855c615d8595f1ec2912d',1,'stan::agrad::rising_factorial(const fvar< T > &x, const double n)'],['../namespacestan_1_1agrad.html#af7f09d1c92ebab44b0765c7cbbece686',1,'stan::agrad::rising_factorial(const double x, const fvar< T > &n)'],['../namespacestan_1_1agrad.html#a2938f3b0f93ab4f19e3809fe4f69c94f',1,'stan::agrad::rising_factorial(const var &a, const double &b)'],['../namespacestan_1_1agrad.html#a20247c229eb0eff045d4f8eb46754d2e',1,'stan::agrad::rising_factorial(const var &a, const var &b)'],['../namespacestan_1_1agrad.html#abe622a48fa2a2942b149fdba55f333e1',1,'stan::agrad::rising_factorial(const double &a, const var &b)'],['../namespacestan_1_1math.html#a3c25994a9886374662f280ecba376a42',1,'stan::math::rising_factorial()']]], + ['round',['round',['../namespacestan_1_1agrad.html#afec6a38f518019111c47c6e6c2a593b2',1,'stan::agrad::round(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#ad590e62d8c71957c7af8415e85905161',1,'stan::agrad::round(const stan::agrad::var &a)']]], + ['round_5ferror',['round_error',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#af3bf0d1a9d694cf2ab881c0a648ddaa7',1,'std::numeric_limits< stan::agrad::fvar< T > >::round_error()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#aaac0b0266785c7bd359eee49a89231a4',1,'std::numeric_limits< stan::agrad::var >::round_error()']]], + ['row',['row',['../namespacestan_1_1math.html#ab540ec1825d8a36cf690a3f061d544bb',1,'stan::math']]], + ['row_5fvector',['row_vector',['../classstan_1_1io_1_1reader.html#a857c3ed31d34189e5768ef2475024b36',1,'stan::io::reader']]], + ['row_5fvector_5fconstrain',['row_vector_constrain',['../classstan_1_1io_1_1reader.html#a83f84052299bcadcd6bdf0273e7a48d4',1,'stan::io::reader::row_vector_constrain(size_t m)'],['../classstan_1_1io_1_1reader.html#a2165af289c7ec046db04aec5d369bc9b',1,'stan::io::reader::row_vector_constrain(size_t m, T &)']]], + ['row_5fvector_5flb',['row_vector_lb',['../classstan_1_1io_1_1reader.html#a91cbfaaef51a6f1537ae86c13403c8fc',1,'stan::io::reader']]], + ['row_5fvector_5flb_5fconstrain',['row_vector_lb_constrain',['../classstan_1_1io_1_1reader.html#ac2a358a28348483347a0c3d18587dcff',1,'stan::io::reader::row_vector_lb_constrain(const TL lb, size_t m)'],['../classstan_1_1io_1_1reader.html#a03477c8e7dec8028b31d7435161a58d1',1,'stan::io::reader::row_vector_lb_constrain(const TL lb, size_t m, T &lp)']]], + ['row_5fvector_5flb_5funconstrain',['row_vector_lb_unconstrain',['../classstan_1_1io_1_1writer.html#a2c478d495e007c8eba20f089a089c163',1,'stan::io::writer']]], + ['row_5fvector_5flub',['row_vector_lub',['../classstan_1_1io_1_1reader.html#a4cb4db5f423c38abdf0e3cb8f9d9188b',1,'stan::io::reader']]], + ['row_5fvector_5flub_5fconstrain',['row_vector_lub_constrain',['../classstan_1_1io_1_1reader.html#aaa3a163e402812f41d271adcf974e455',1,'stan::io::reader::row_vector_lub_constrain(const TL lb, const TU ub, size_t m)'],['../classstan_1_1io_1_1reader.html#ab1d1b3316dd321fdf4965d8843920800',1,'stan::io::reader::row_vector_lub_constrain(const TL lb, const TU ub, size_t m, T &lp)']]], + ['row_5fvector_5flub_5funconstrain',['row_vector_lub_unconstrain',['../classstan_1_1io_1_1writer.html#a044b59a59c26439b2bb2bc19071531d6',1,'stan::io::writer']]], + ['row_5fvector_5fub',['row_vector_ub',['../classstan_1_1io_1_1reader.html#a7e2430e335d19e695f50494130e9a183',1,'stan::io::reader']]], + ['row_5fvector_5fub_5fconstrain',['row_vector_ub_constrain',['../classstan_1_1io_1_1reader.html#a956b2417c03f1f4645377fc06e1eee94',1,'stan::io::reader::row_vector_ub_constrain(const TU ub, size_t m)'],['../classstan_1_1io_1_1reader.html#a66650f9f00be4acabf92acfca8c53dbc',1,'stan::io::reader::row_vector_ub_constrain(const TU ub, size_t m, T &lp)']]], + ['row_5fvector_5fub_5funconstrain',['row_vector_ub_unconstrain',['../classstan_1_1io_1_1writer.html#afd20cc10409dce8c8f19dd7739bf05bb',1,'stan::io::writer']]], + ['row_5fvector_5funconstrain',['row_vector_unconstrain',['../classstan_1_1io_1_1writer.html#ac994c53580dee20c98e2734b889be4ad',1,'stan::io::writer']]], + ['row_5fvector_5fvar_5fdecl',['row_vector_var_decl',['../structstan_1_1gm_1_1row__vector__var__decl.html#aa014117956dbd7c14c2008ddef880824',1,'stan::gm::row_vector_var_decl::row_vector_var_decl()'],['../structstan_1_1gm_1_1row__vector__var__decl.html#a5519c24ae953da7a875c0f39ce69704c',1,'stan::gm::row_vector_var_decl::row_vector_var_decl(range const &range, expression const &N, std::string const &name, std::vector< expression > const &dims)']]], + ['rows',['rows',['../classstan_1_1math_1_1_l_d_l_t__factor_3_01stan_1_1agrad_1_1var_00_01_r_00_01_c_01_4.html#a6ed9e0cd72d929449d5257f11b7aad45',1,'stan::math::LDLT_factor< stan::agrad::var, R, C >::rows()'],['../classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4.html#a481dd3025ce906d56ab57d6f33759426',1,'stan::math::LDLT_factor< double, R, C >::rows()'],['../namespacestan_1_1math.html#adb157990709e17068a450238d0a579fb',1,'stan::math::rows()']]], + ['rows_5fdot_5fproduct',['rows_dot_product',['../namespacestan_1_1agrad.html#ad53bb44b66e3b1129e5454cda93c700c',1,'stan::agrad::rows_dot_product(const Eigen::Matrix< fvar< T >, R1, C1 > &v1, const Eigen::Matrix< fvar< T >, R2, C2 > &v2)'],['../namespacestan_1_1agrad.html#a78dcc991d879df3adf65cd1869015317',1,'stan::agrad::rows_dot_product(const Eigen::Matrix< double, R1, C1 > &v1, const Eigen::Matrix< fvar< T >, R2, C2 > &v2)'],['../namespacestan_1_1agrad.html#aa6efe02004903faea4953ea2b0a6c02c',1,'stan::agrad::rows_dot_product(const Eigen::Matrix< fvar< T >, R1, C1 > &v1, const Eigen::Matrix< double, R2, C2 > &v2)'],['../namespacestan_1_1agrad.html#a515860810335a99d111cda0614bc00e1',1,'stan::agrad::rows_dot_product(const Eigen::Matrix< T1, R1, C1 > &v1, const Eigen::Matrix< T2, R2, C2 > &v2)'],['../namespacestan_1_1math.html#a6e1fb33918f8c4e61cc7709905db012c',1,'stan::math::rows_dot_product()']]], + ['rows_5fdot_5fself',['rows_dot_self',['../namespacestan_1_1agrad.html#aba5acba7161f7e4080052f1bd6063e9a',1,'stan::agrad::rows_dot_self()'],['../namespacestan_1_1math.html#a7b071fe169e76df6dc2a49c85ec28b2f',1,'stan::math::rows_dot_self()']]], + ['run',['run',['../struct_eigen_1_1internal_1_1significant__decimals__default__impl_3_01stan_1_1agrad_1_1var_00_01false_01_4.html#ac2f97f18b6f0c481a111bbf82a4fc7e5',1,'Eigen::internal::significant_decimals_default_impl< stan::agrad::var, false >::run()'],['../struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1va44da5f98e1caea9523bacbd5bdc025fe.html#a62cd81217587325b39ccdd4668b13e7a',1,'Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, ColMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >::run()'],['../struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1vacd54cabc78c49ca719650381b68b105e.html#aec3ce42cbaf2a03d150a0ae70b72220e',1,'Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, RowMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >::run()'],['../struct_eigen_1_1internal_1_1general__matrix__matrix__product_3_01_index_00_01stan_1_1agrad_1_1va9b485de9571b6e46d7a64aff43a6d9d3.html#a6e9d5e398a3e5602fa39b1938bb6f155',1,'Eigen::internal::general_matrix_matrix_product< Index, stan::agrad::var, LhsStorageOrder, ConjugateLhs, stan::agrad::var, RhsStorageOrder, ConjugateRhs, ColMajor >::run()']]], + ['run_5fmarkov_5fchain',['run_markov_chain',['../namespacestan_1_1gm.html#a9209ad79a636ceb3152038e76e81acc4',1,'stan::gm']]] +]; diff --git a/doc/api/html/search/functions_73.html b/doc/api/html/search/functions_73.html new file mode 100644 index 00000000000..774d577f552 --- /dev/null +++ b/doc/api/html/search/functions_73.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/functions_73.js b/doc/api/html/search/functions_73.js new file mode 100644 index 00000000000..7e35a008c72 --- /dev/null +++ b/doc/api/html/search/functions_73.js @@ -0,0 +1,116 @@ +var searchData= +[ + ['sample',['sample',['../structstan_1_1gm_1_1sample.html#af848ffe2b840908129a6ec949f4ef881',1,'stan::gm::sample::sample()'],['../structstan_1_1gm_1_1sample.html#af9ef88ac0fe1bca70dd1a598a805125d',1,'stan::gm::sample::sample(expression &e, distribution &dist)'],['../classstan_1_1mcmc_1_1sample.html#a028816248fc7ec7dbee24d0e7ea621dc',1,'stan::mcmc::sample::sample()'],['../namespacestan_1_1gm.html#a7cf4c17c47162f69708fa787fa09d4dc',1,'stan::gm::sample()']]], + ['sample_5fcovariance',['sample_covariance',['../classstan_1_1prob_1_1welford__covar__estimator.html#a5e36ff271130c52b707d261f0cf72205',1,'stan::prob::welford_covar_estimator']]], + ['sample_5fmean',['sample_mean',['../classstan_1_1prob_1_1welford__covar__estimator.html#a025fef3ddbd1b600ff60f293757c7dda',1,'stan::prob::welford_covar_estimator::sample_mean()'],['../classstan_1_1prob_1_1welford__var__estimator.html#a9204b9e61b85661377f48f0d4c55531c',1,'stan::prob::welford_var_estimator::sample_mean()']]], + ['sample_5fp',['sample_p',['../classstan_1_1mcmc_1_1base__hamiltonian.html#a3207510e682d531885cc65e91b7e9af9',1,'stan::mcmc::base_hamiltonian::sample_p()'],['../classstan_1_1mcmc_1_1dense__e__metric.html#a6226a2831ba574b3219536c5c3b31d42',1,'stan::mcmc::dense_e_metric::sample_p()'],['../classstan_1_1mcmc_1_1diag__e__metric.html#a4006b1b08873b2f09a4c7a718f4f7517',1,'stan::mcmc::diag_e_metric::sample_p()'],['../classstan_1_1mcmc_1_1unit__e__metric.html#a97f537f349ad486cb8ca40bbfdc8135b',1,'stan::mcmc::unit_e_metric::sample_p()']]], + ['sample_5fstepsize',['sample_stepsize',['../classstan_1_1mcmc_1_1base__hmc.html#a3ac766b0cce7b20168fb576cc7b399af',1,'stan::mcmc::base_hmc']]], + ['sample_5fvariance',['sample_variance',['../classstan_1_1prob_1_1welford__var__estimator.html#a97832111891ecd58739f528506f64bbb',1,'stan::prob::welford_var_estimator']]], + ['samples',['samples',['../classstan_1_1mcmc_1_1chains.html#a9db136c877e767e92877f162fc613af0',1,'stan::mcmc::chains::samples(const int chain, const int index)'],['../classstan_1_1mcmc_1_1chains.html#aaa2edbb4814eaf82fa21bb5795008b86',1,'stan::mcmc::chains::samples(const int index)'],['../classstan_1_1mcmc_1_1chains.html#a32d4494522c2cb233f48960d2ed57198',1,'stan::mcmc::chains::samples(const int chain, const std::string &name)'],['../classstan_1_1mcmc_1_1chains.html#aa00ee119c518e1912e3153be0797fbaf',1,'stan::mcmc::chains::samples(const std::string &name)']]], + ['scalar',['scalar',['../classstan_1_1io_1_1reader.html#a804e3de3992c9f6a53c03596369dd1d0',1,'stan::io::reader']]], + ['scalar_5fconstrain',['scalar_constrain',['../classstan_1_1io_1_1reader.html#a1436d19aa2acb5c139f7abccda0245c0',1,'stan::io::reader::scalar_constrain()'],['../classstan_1_1io_1_1reader.html#adc2d45ed51c042512f07e2c977894b7b',1,'stan::io::reader::scalar_constrain(T &)']]], + ['scalar_5flb',['scalar_lb',['../classstan_1_1io_1_1reader.html#a63d5909de270e2f187707c7bdfa1b2ba',1,'stan::io::reader']]], + ['scalar_5flb_5fconstrain',['scalar_lb_constrain',['../classstan_1_1io_1_1reader.html#aa9191795f375a3e3c5e048ca1eb045ba',1,'stan::io::reader::scalar_lb_constrain(const TL lb)'],['../classstan_1_1io_1_1reader.html#a8fc8affb3f2c3835965d943c7a7ce83c',1,'stan::io::reader::scalar_lb_constrain(const TL lb, T &lp)']]], + ['scalar_5flb_5funconstrain',['scalar_lb_unconstrain',['../classstan_1_1io_1_1writer.html#a7f2596b8de12ff0a3121a6acbbf79536',1,'stan::io::writer']]], + ['scalar_5flub',['scalar_lub',['../classstan_1_1io_1_1reader.html#a13f36e576e51d8e9d72589133d7cf107',1,'stan::io::reader']]], + ['scalar_5flub_5fconstrain',['scalar_lub_constrain',['../classstan_1_1io_1_1reader.html#a12299645ca45f2b765fea6fe14447733',1,'stan::io::reader::scalar_lub_constrain(const TL lb, const TU ub)'],['../classstan_1_1io_1_1reader.html#ad821d1abbeefcd04f3350a213276d53e',1,'stan::io::reader::scalar_lub_constrain(TL lb, TU ub, T &lp)']]], + ['scalar_5flub_5funconstrain',['scalar_lub_unconstrain',['../classstan_1_1io_1_1writer.html#a841fbd5b6feddfbad117c3cb23f2844c',1,'stan::io::writer']]], + ['scalar_5fpos',['scalar_pos',['../classstan_1_1io_1_1reader.html#acf5c5343597a44d4d2173881c7c68912',1,'stan::io::reader']]], + ['scalar_5fpos_5fconstrain',['scalar_pos_constrain',['../classstan_1_1io_1_1reader.html#a45d5a9c201fb25c44f1bba987e64d387',1,'stan::io::reader::scalar_pos_constrain()'],['../classstan_1_1io_1_1reader.html#a41d6bf28bfa13c861ce1afe8cd7d4c1e',1,'stan::io::reader::scalar_pos_constrain(T &lp)']]], + ['scalar_5fpos_5funconstrain',['scalar_pos_unconstrain',['../classstan_1_1io_1_1writer.html#a0711f8ca4117ca12cdb301e40838dc74',1,'stan::io::writer']]], + ['scalar_5fub',['scalar_ub',['../classstan_1_1io_1_1reader.html#aa5e2f8eca996110fb2be2e436d583b62',1,'stan::io::reader']]], + ['scalar_5fub_5fconstrain',['scalar_ub_constrain',['../classstan_1_1io_1_1reader.html#a21b4b63d07615a9d0a7c5de364a43a36',1,'stan::io::reader::scalar_ub_constrain(const TU ub)'],['../classstan_1_1io_1_1reader.html#a48afbd36262b7a2f51dec8d2fad471dd',1,'stan::io::reader::scalar_ub_constrain(const TU ub, T &lp)']]], + ['scalar_5fub_5funconstrain',['scalar_ub_unconstrain',['../classstan_1_1io_1_1writer.html#a747459c1f2b0d23711d7d36f18269ed6',1,'stan::io::writer']]], + ['scalar_5funconstrain',['scalar_unconstrain',['../classstan_1_1io_1_1writer.html#a15d75c45cfa52d103ad5660283fdde45',1,'stan::io::writer']]], + ['scaled_5fadd',['scaled_add',['../namespacestan_1_1math.html#a2eb786f14699d69c39cfdd49893a8006',1,'stan::math']]], + ['scaled_5finv_5fchi_5fsquare_5fccdf_5flog',['scaled_inv_chi_square_ccdf_log',['../namespacestan_1_1prob.html#a93cfec0873f41fb0f7e4c83d874b45fc',1,'stan::prob']]], + ['scaled_5finv_5fchi_5fsquare_5fcdf',['scaled_inv_chi_square_cdf',['../namespacestan_1_1prob.html#aeed68e0c4e8cfb8b5c470ae0b59345c9',1,'stan::prob']]], + ['scaled_5finv_5fchi_5fsquare_5fcdf_5flog',['scaled_inv_chi_square_cdf_log',['../namespacestan_1_1prob.html#ac9609fecff26e0c07646f794f65a39a7',1,'stan::prob']]], + ['scaled_5finv_5fchi_5fsquare_5flog',['scaled_inv_chi_square_log',['../namespacestan_1_1prob.html#a6428f925f8c1b43c323ce549da410d58',1,'stan::prob::scaled_inv_chi_square_log(const T_y &y, const T_dof &nu, const T_scale &s)'],['../namespacestan_1_1prob.html#a33291b85f39ebace4a4bae7633551cb0',1,'stan::prob::scaled_inv_chi_square_log(const T_y &y, const T_dof &nu, const T_scale &s)']]], + ['scaled_5finv_5fchi_5fsquare_5frng',['scaled_inv_chi_square_rng',['../namespacestan_1_1prob.html#af34f411fc637d2d1163663c0cf0a850e',1,'stan::prob']]], + ['sd',['sd',['../classstan_1_1mcmc_1_1chains.html#ab2763e38f54eb42ecaffe3202d2b945c',1,'stan::mcmc::chains::sd(const int chain, const int index)'],['../classstan_1_1mcmc_1_1chains.html#a5a63a0830242bcb793d0b058a2037a0c',1,'stan::mcmc::chains::sd(const int index)'],['../classstan_1_1mcmc_1_1chains.html#aa4d9e5490c0f67fb36f524d3398d7fdd',1,'stan::mcmc::chains::sd(const int chain, const std::string &name)'],['../classstan_1_1mcmc_1_1chains.html#add89272071040d56370525dae0a341f2',1,'stan::mcmc::chains::sd(const std::string &name)'],['../namespacestan_1_1agrad.html#a0d4edc50e38fa85f989dd2bc6a0b35b2',1,'stan::agrad::sd(const std::vector< var > &v)'],['../namespacestan_1_1agrad.html#ab13ef786c424299f0312dc5372c97ee1',1,'stan::agrad::sd(const Eigen::Matrix< var, R, C > &m)'],['../namespacestan_1_1math.html#a34fd02fe795ea38c98f4a02befed309f',1,'stan::math::sd(const std::vector< T > &v)'],['../namespacestan_1_1math.html#a8e1cb72c1528f0ff383033c642341147',1,'stan::math::sd(const Eigen::Matrix< T, R, C > &m)']]], + ['seed',['seed',['../classstan_1_1mcmc_1_1base__hmc.html#af14724fbb8065467b10deeb4134c6e74',1,'stan::mcmc::base_hmc']]], + ['segment',['segment',['../namespacestan_1_1math.html#a4e828d606f1a1c8faf42e6d901089543',1,'stan::math::segment(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v, size_t i, size_t n)'],['../namespacestan_1_1math.html#ad2c340addebdc88ac086b0e1fac2c1b7',1,'stan::math::segment(const Eigen::Matrix< T, 1, Eigen::Dynamic > &v, size_t i, size_t n)'],['../namespacestan_1_1math.html#a721232b5c8e7c068a120719255f5fb0c',1,'stan::math::segment(const std::vector< T > &sv, size_t i, size_t n)']]], + ['seq_5fview',['seq_view',['../classstan_1_1math_1_1seq__view.html#a0c10cc8d25cff8c90c8bbecf3cd054a1',1,'stan::math::seq_view::seq_view()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_01_eigen_1_1_dynamic_00_011_01_4_01_4.html#ae570c324a14b81a018475195a77e4430',1,'stan::math::seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, 1 > >::seq_view()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_011_00_01_eigen_1_1_dynamic_01_4_01_4.html#a57ab58ed09da14b8efcf83b9d1528b88',1,'stan::math::seq_view< T, Eigen::Matrix< S, 1, Eigen::Dynamic > >::seq_view()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4.html#a706e3bea5d58f77fd9d6d427e64aa370',1,'stan::math::seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, Eigen::Dynamic > >::seq_view()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01_s_01_4_01_4.html#a42ff5c63f8f83390fc7c585b41c0d5ed',1,'stan::math::seq_view< T, std::vector< S > >::seq_view()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01_t_01_4_01_4.html#a2e9627b1092238710ed116adc7c1cab5',1,'stan::math::seq_view< T, std::vector< T > >::seq_view()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01std_1_1vector_3_01_t_01_4_01_4_01_4.html#ac35e60cb3f9e9f4dde81b8ed3b532a2b',1,'stan::math::seq_view< T, std::vector< std::vector< T > > >::seq_view()'],['../classstan_1_1math_1_1seq__view_3_01double_00_01std_1_1vector_3_01int_01_4_01_4.html#ad82423565c559cd4e889350bc204319b',1,'stan::math::seq_view< double, std::vector< int > >::seq_view()']]], + ['set_5fdelta',['set_delta',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#a1e6d6d34e50d9a5ff106f739ca81a851',1,'stan::mcmc::stepsize_adaptation']]], + ['set_5fgamma',['set_gamma',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#a7feb00e53bc871dc9e796668b65c95b7',1,'stan::mcmc::stepsize_adaptation']]], + ['set_5fkappa',['set_kappa',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#a5efe516ab71582fda45991235ea64a80',1,'stan::mcmc::stepsize_adaptation']]], + ['set_5fmax_5fdelta',['set_max_delta',['../classstan_1_1mcmc_1_1base__nuts.html#ae53e9049abf738dd6e1a3c1d6d0fb5e2',1,'stan::mcmc::base_nuts']]], + ['set_5fmax_5fdepth',['set_max_depth',['../classstan_1_1mcmc_1_1base__nuts.html#ac587ab4dc49a366f588314cffce64471',1,'stan::mcmc::base_nuts']]], + ['set_5fmu',['set_mu',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#a8be8064cdb258e343922c186ecaaaf18',1,'stan::mcmc::stepsize_adaptation']]], + ['set_5fnominal_5fstepsize',['set_nominal_stepsize',['../classstan_1_1mcmc_1_1base__hmc.html#ad9ecfad54327ebceea08415e8b1514c3',1,'stan::mcmc::base_hmc::set_nominal_stepsize()'],['../classstan_1_1mcmc_1_1base__static__hmc.html#a0219d73bf44be4797b47c150d349d261',1,'stan::mcmc::base_static_hmc::set_nominal_stepsize()']]], + ['set_5fnominal_5fstepsize_5fand_5fl',['set_nominal_stepsize_and_L',['../classstan_1_1mcmc_1_1base__static__hmc.html#a42697249fbc38355195528383ad7d08f',1,'stan::mcmc::base_static_hmc']]], + ['set_5fnominal_5fstepsize_5fand_5ft',['set_nominal_stepsize_and_T',['../classstan_1_1mcmc_1_1base__static__hmc.html#a90ce61c9dce1d02419f4488efb4950a3',1,'stan::mcmc::base_static_hmc']]], + ['set_5fparam_5franges_5fvisgen',['set_param_ranges_visgen',['../structstan_1_1gm_1_1set__param__ranges__visgen.html#a260565c9456f52828d4dab2472536c8c',1,'stan::gm::set_param_ranges_visgen']]], + ['set_5fstepsize_5fjitter',['set_stepsize_jitter',['../classstan_1_1mcmc_1_1base__hmc.html#aa049a77cf8131f53a707a3a976fa3c11',1,'stan::mcmc::base_hmc']]], + ['set_5ft',['set_T',['../classstan_1_1mcmc_1_1base__static__hmc.html#ab7f3e3cfb7c79053aec34e27647a573a',1,'stan::mcmc::base_static_hmc']]], + ['set_5ft0',['set_t0',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#a1afb2430aad55e460826f70db13bae9c',1,'stan::mcmc::stepsize_adaptation']]], + ['set_5ftype',['set_type',['../structstan_1_1gm_1_1variable.html#accf431520ba5cee016d698e01f089b37',1,'stan::gm::variable']]], + ['set_5fvalue',['set_value',['../classstan_1_1gm_1_1singleton__argument.html#a71e1284e9af67ce97dc32baa943a59a9',1,'stan::gm::singleton_argument']]], + ['set_5fwarmup',['set_warmup',['../classstan_1_1mcmc_1_1chains.html#a6bb363076e9988fb98ee7241456e06b0',1,'stan::mcmc::chains::set_warmup(const int chain, const int warmup)'],['../classstan_1_1mcmc_1_1chains.html#a0e955cb8e43f1b9f8da98c5dff663768',1,'stan::mcmc::chains::set_warmup(const int warmup)']]], + ['set_5fwindow_5fparams',['set_window_params',['../classstan_1_1mcmc_1_1stepsize__covar__adapter.html#ae337a1a05112f580a3d105a8b60fe83f',1,'stan::mcmc::stepsize_covar_adapter::set_window_params()'],['../classstan_1_1mcmc_1_1stepsize__var__adapter.html#a9de24f09147a18ab6974426a518ba691',1,'stan::mcmc::stepsize_var_adapter::set_window_params()'],['../classstan_1_1mcmc_1_1windowed__adaptation.html#a818edfc11176b8ebc0bdb1b1d9c3319c',1,'stan::mcmc::windowed_adaptation::set_window_params()']]], + ['set_5fzero_5fadjoint',['set_zero_adjoint',['../classstan_1_1agrad_1_1chainable.html#a6cb7ffe4555cbba60c2136053d2c2a5f',1,'stan::agrad::chainable::set_zero_adjoint()'],['../classstan_1_1agrad_1_1vari.html#a1b9805e76f3afcb3199d8455c577a4dc',1,'stan::agrad::vari::set_zero_adjoint()']]], + ['set_5fzero_5fall_5fadjoints',['set_zero_all_adjoints',['../namespacestan_1_1agrad.html#aadb1e5a1bc99069eeab84a0b27c4dceb',1,'stan::agrad']]], + ['sign',['sign',['../namespacestan_1_1prob.html#af054a122bafce0c367eaca60a181bd47',1,'stan::prob']]], + ['signaling_5fnan',['signaling_NaN',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a2f08955d86f725887a49949ebef19626',1,'std::numeric_limits< stan::agrad::fvar< T > >::signaling_NaN()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a4c69e978e7814b7215f29a2e57a73993',1,'std::numeric_limits< stan::agrad::var >::signaling_NaN()']]], + ['simplex',['simplex',['../classstan_1_1io_1_1reader.html#a9b15c1f051764a8a50a08c5880f810bb',1,'stan::io::reader']]], + ['simplex_5fconstrain',['simplex_constrain',['../classstan_1_1io_1_1reader.html#a1fa21fc736a271ff845ffddc5ecae125',1,'stan::io::reader::simplex_constrain(size_t k)'],['../classstan_1_1io_1_1reader.html#a8ee8c20266159e7ce8763c8014bf2899',1,'stan::io::reader::simplex_constrain(size_t k, T &lp)'],['../namespacestan_1_1prob.html#a34fe9ae8e8dcc7b4f619ffcdf2ac5387',1,'stan::prob::simplex_constrain(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &y)'],['../namespacestan_1_1prob.html#a373ba2418f71147953238312e5bd6954',1,'stan::prob::simplex_constrain(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &y, T &lp)']]], + ['simplex_5ffree',['simplex_free',['../namespacestan_1_1prob.html#a6703d995557396cc5fd013c6cd882327',1,'stan::prob']]], + ['simplex_5funconstrain',['simplex_unconstrain',['../classstan_1_1io_1_1writer.html#ae9bc049dd109093051e7db16aa18be56',1,'stan::io::writer']]], + ['simplex_5fvar_5fdecl',['simplex_var_decl',['../structstan_1_1gm_1_1simplex__var__decl.html#a7e1687968e4f300e3ebae4720065db42',1,'stan::gm::simplex_var_decl::simplex_var_decl()'],['../structstan_1_1gm_1_1simplex__var__decl.html#a9f61771cca77cde06b1e0723d4b8471a',1,'stan::gm::simplex_var_decl::simplex_var_decl(expression const &K, std::string const &name, std::vector< expression > const &dims)']]], + ['sin',['sin',['../namespacestan_1_1agrad.html#a7b48feb9c99466a3be1efb1abc686779',1,'stan::agrad::sin(const var &a)'],['../namespacestan_1_1agrad.html#acd0120597292585e7729ba613fdbb42a',1,'stan::agrad::sin(const fvar< T > &x)']]], + ['singleton_5fargument',['singleton_argument',['../classstan_1_1gm_1_1singleton__argument.html#af6cb0a5be1281e4f5e3c6889fa50eaa9',1,'stan::gm::singleton_argument::singleton_argument()'],['../classstan_1_1gm_1_1singleton__argument.html#a33f50fa7bdbeaf5e7bb2255d80b78945',1,'stan::gm::singleton_argument::singleton_argument(const std::string name)']]], + ['singular_5fvalues',['singular_values',['../namespacestan_1_1math.html#a204f15e3685b2c610ca2c0c80a3005d5',1,'stan::math']]], + ['sinh',['sinh',['../namespacestan_1_1agrad.html#afac6cdf77cc95b678ffde768754810e5',1,'stan::agrad::sinh(const var &a)'],['../namespacestan_1_1agrad.html#a6d1505ab5904db650f5d478a09beb7dc',1,'stan::agrad::sinh(const fvar< T > &x)']]], + ['size',['size',['../classstan_1_1agrad_1_1op__matrix__vari.html#a6611078e47e0bb3d017e78e29f194036',1,'stan::agrad::op_matrix_vari::size()'],['../classstan_1_1agrad_1_1op__vector__vari.html#af0560b5a659dae6c49afae0b3657e8f2',1,'stan::agrad::op_vector_vari::size()'],['../classstan_1_1math_1_1seq__view.html#ab20467423ddb3b3e45513abb8e4a21d3',1,'stan::math::seq_view::size()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_01_eigen_1_1_dynamic_00_011_01_4_01_4.html#a3284abfb2471ad555d43a8693658c5ec',1,'stan::math::seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, 1 > >::size()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_011_00_01_eigen_1_1_dynamic_01_4_01_4.html#a8c830a8c9c9c431a71a89cf4b996b27e',1,'stan::math::seq_view< T, Eigen::Matrix< S, 1, Eigen::Dynamic > >::size()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01_eigen_1_1_matrix_3_01_s_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4.html#a07185ddaf17963a5724ddc2c62208922',1,'stan::math::seq_view< T, Eigen::Matrix< S, Eigen::Dynamic, Eigen::Dynamic > >::size()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01_s_01_4_01_4.html#a3a6031049d11ce5429727dcbe5e29130',1,'stan::math::seq_view< T, std::vector< S > >::size()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01_t_01_4_01_4.html#a3f616444293b86fdb17272494c88cc4c',1,'stan::math::seq_view< T, std::vector< T > >::size()'],['../classstan_1_1math_1_1seq__view_3_01_t_00_01std_1_1vector_3_01std_1_1vector_3_01_t_01_4_01_4_01_4.html#ab81a7a5c2de89631c7aec2ab701854a1',1,'stan::math::seq_view< T, std::vector< std::vector< T > > >::size()'],['../classstan_1_1math_1_1seq__view_3_01double_00_01std_1_1vector_3_01int_01_4_01_4.html#af56447dd766a3a5a9d6c97b0a2de9563',1,'stan::math::seq_view< double, std::vector< int > >::size()'],['../namespacestan_1_1math.html#aa1f9966aade9c4515d33d3ffa7305462',1,'stan::math::size()']]], + ['size_5fcont',['size_cont',['../classstan_1_1mcmc_1_1sample.html#aadbb128a85fb6d72df04d3097acfc3e5',1,'stan::mcmc::sample']]], + ['size_5fof',['size_of',['../structstan_1_1size__of__helper.html#a8f7056983b7948acf66a2e8b3e37e855',1,'stan::size_of_helper::size_of()'],['../structstan_1_1size__of__helper_3_01_t_00_01true_01_4.html#af0810fc0270af209916e67d5defe4b7d',1,'stan::size_of_helper< T, true >::size_of()'],['../namespacestan.html#a4741beaf7ec88631fd2735cadf05365f',1,'stan::size_of()']]], + ['skew_5fnormal_5fccdf_5flog',['skew_normal_ccdf_log',['../namespacestan_1_1prob.html#a9b9d2a0cb044b4683b8ebc1f5664067a',1,'stan::prob']]], + ['skew_5fnormal_5fcdf',['skew_normal_cdf',['../namespacestan_1_1prob.html#af883c9ea717a01e7835a5071cfb132bd',1,'stan::prob']]], + ['skew_5fnormal_5fcdf_5flog',['skew_normal_cdf_log',['../namespacestan_1_1prob.html#aa702b78d553fccea5853eb3fad971200',1,'stan::prob']]], + ['skew_5fnormal_5flog',['skew_normal_log',['../namespacestan_1_1prob.html#aa490430040824f21c59eb415f0b77051',1,'stan::prob::skew_normal_log(const T_y &y, const T_loc &mu, const T_scale &sigma, const T_shape &alpha)'],['../namespacestan_1_1prob.html#a72d94de0c6230acb70815802bddf5587',1,'stan::prob::skew_normal_log(const T_y &y, const T_loc &mu, const T_scale &sigma, const T_shape &alpha)']]], + ['skew_5fnormal_5frng',['skew_normal_rng',['../namespacestan_1_1prob.html#ad193097bedddda283ba854e2ddcd6013',1,'stan::prob']]], + ['softmax',['softmax',['../namespacestan_1_1agrad.html#afb1b8b97d1a6b36f59618a80a9c3778d',1,'stan::agrad::softmax(const Eigen::Matrix< fvar< T >, Eigen::Dynamic, 1 > &alpha)'],['../namespacestan_1_1agrad.html#a611391662c0928a68fa23be96188a49d',1,'stan::agrad::softmax(const Eigen::Matrix< var, Eigen::Dynamic, 1 > &alpha)'],['../namespacestan_1_1math.html#a724679c01caa9ae44c146fe8019ddcf6',1,'stan::math::softmax()']]], + ['solve',['solve',['../classstan_1_1math_1_1_l_d_l_t__factor_3_01stan_1_1agrad_1_1var_00_01_r_00_01_c_01_4.html#a94d5fa0c327e9f55e1fc90734040c845',1,'stan::math::LDLT_factor< stan::agrad::var, R, C >::solve()'],['../classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4.html#a1974a3e67f6d9aa1d1cdfe803a7aaaef',1,'stan::math::LDLT_factor< double, R, C >::solve()']]], + ['solveright',['solveRight',['../classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4.html#aed238516181016209dbe39a879146092',1,'stan::math::LDLT_factor< double, R, C >']]], + ['sort_5fasc',['sort_asc',['../namespacestan_1_1agrad.html#ad95245f78e0f8d52eb288842562fc4a4',1,'stan::agrad::sort_asc(std::vector< fvar< T > > xs)'],['../namespacestan_1_1agrad.html#a9ac1f0102b58f1e1a1dee468a383f27d',1,'stan::agrad::sort_asc(Eigen::Matrix< fvar< T >, R, C > xs)'],['../namespacestan_1_1agrad.html#a9eb00d0b49af47ecd65373ef59ae1640',1,'stan::agrad::sort_asc(std::vector< var > xs)'],['../namespacestan_1_1agrad.html#a64d1e2a0f135d1ce0a1e1f4e768bc8e5',1,'stan::agrad::sort_asc(Eigen::Matrix< var, R, C > xs)'],['../namespacestan_1_1math.html#a80f5418b16ea26e9bc6d2a8f9b764897',1,'stan::math::sort_asc(std::vector< T > xs)'],['../namespacestan_1_1math.html#aea0d013ec0a699e61dd74f32aa722fa0',1,'stan::math::sort_asc(Eigen::Matrix< T, R, C > xs)']]], + ['sort_5fdesc',['sort_desc',['../namespacestan_1_1agrad.html#abcc2609354cc5a38ad45c3b0a656e63f',1,'stan::agrad::sort_desc(std::vector< fvar< T > > xs)'],['../namespacestan_1_1agrad.html#a77b9ed0b3272b0bf9623fe31b69bc965',1,'stan::agrad::sort_desc(Eigen::Matrix< fvar< T >, R, C > xs)'],['../namespacestan_1_1agrad.html#acdf543712f8bac6eb1b7dff1eae7c3c6',1,'stan::agrad::sort_desc(std::vector< var > xs)'],['../namespacestan_1_1agrad.html#a41cc77adf1c2cb5df2034d8d94da39da',1,'stan::agrad::sort_desc(Eigen::Matrix< var, R, C > xs)'],['../namespacestan_1_1math.html#ab0b2712eab9b95535c0589455ed11cfc',1,'stan::math::sort_desc(std::vector< T > xs)'],['../namespacestan_1_1math.html#a13ae8cd1155e8c4c684efb4405a1e277',1,'stan::math::sort_desc(Eigen::Matrix< T, R, C > xs)']]], + ['split_5farg',['split_arg',['../classstan_1_1gm_1_1argument.html#ab68a5c3e2ba856a6717ffe71b7968f53',1,'stan::gm::argument']]], + ['split_5fpotential_5fscale_5freduction',['split_potential_scale_reduction',['../classstan_1_1mcmc_1_1chains.html#aff7e664bd9451e0854d65bd8c4a6aa9d',1,'stan::mcmc::chains::split_potential_scale_reduction(const int index)'],['../classstan_1_1mcmc_1_1chains.html#a2ae7c29a53d548f408ddc9a9d894d767',1,'stan::mcmc::chains::split_potential_scale_reduction(const std::string &name)']]], + ['sqrt',['sqrt',['../namespacestan_1_1agrad.html#a14e7c78163cf5677786955053de27a98',1,'stan::agrad::sqrt(const var &a)'],['../namespacestan_1_1agrad.html#af7d52e77074ba94b4485cc33f8f637df',1,'stan::agrad::sqrt(const fvar< T > &x)']]], + ['sqrt2',['sqrt2',['../namespacestan_1_1math.html#a1369f60a09e3af4933096de3a54ac28c',1,'stan::math']]], + ['square',['square',['../namespacestan_1_1agrad.html#a5de00b0d86ae64136a4952a28f9bd84f',1,'stan::agrad::square(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#a18783225f7d6895849af12dd12b305bf',1,'stan::agrad::square(const var &x)'],['../namespacestan_1_1math.html#a056b82f11f784f321bce2c5677089e24',1,'stan::math::square()']]], + ['squared_5fdist',['squared_dist',['../namespacestan_1_1agrad.html#a910dc759393c71753e4f9461ef002959',1,'stan::agrad::squared_dist(const Eigen::Matrix< var, R1, C1 > &v1, const Eigen::Matrix< var, R2, C2 > &v2)'],['../namespacestan_1_1agrad.html#a5f43e23662d36a6779a584428de7ccf2',1,'stan::agrad::squared_dist(const Eigen::Matrix< var, R1, C1 > &v1, const Eigen::Matrix< double, R2, C2 > &v2)'],['../namespacestan_1_1agrad.html#a94d44dbc0e316489fb9af8f90ca2e283',1,'stan::agrad::squared_dist(const Eigen::Matrix< double, R1, C1 > &v1, const Eigen::Matrix< var, R2, C2 > &v2)'],['../namespacestan_1_1math.html#aa870be227ae57e703770592d7d5d3a22',1,'stan::math::squared_dist()']]], + ['stack_5falloc',['stack_alloc',['../classstan_1_1memory_1_1stack__alloc.html#a3da167b8f4f9bd981f948ac03c29604b',1,'stan::memory::stack_alloc']]], + ['stan_5fcsv_5fadaptation',['stan_csv_adaptation',['../structstan_1_1io_1_1stan__csv__adaptation.html#a80dd57392300524f88f68f09959a1918',1,'stan::io::stan_csv_adaptation']]], + ['stan_5fcsv_5fmetadata',['stan_csv_metadata',['../structstan_1_1io_1_1stan__csv__metadata.html#abb84cf3a6ecfaceb2fe108180e9897eb',1,'stan::io::stan_csv_metadata']]], + ['stan_5fcsv_5freader',['stan_csv_reader',['../classstan_1_1io_1_1stan__csv__reader.html#a959ed39477ffd99a18b8ee217f6ad457',1,'stan::io::stan_csv_reader']]], + ['stan_5fcsv_5ftiming',['stan_csv_timing',['../structstan_1_1io_1_1stan__csv__timing.html#acbab41cb7a74d799bafda67688bf3e8e',1,'stan::io::stan_csv_timing']]], + ['stan_5fprint',['stan_print',['../namespacestan_1_1agrad.html#a0d1d06f46e761f9f0fbcf078b6e6208e',1,'stan::agrad::stan_print()'],['../namespacestan_1_1math.html#a7c14b7fd70050f03a07fdf73a1df06d2',1,'stan::math::stan_print(std::ostream *o, const T &x)'],['../namespacestan_1_1math.html#a37cb2d874adcc950cb0439af044f549f',1,'stan::math::stan_print(std::ostream *o, const std::vector< T > &x)'],['../namespacestan_1_1math.html#ae94f7170ee85d4b353f55e3a044d2345',1,'stan::math::stan_print(std::ostream *o, const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x)'],['../namespacestan_1_1math.html#ad9c9057d71cf2795d0042f665c0f89c1',1,'stan::math::stan_print(std::ostream *o, const Eigen::Matrix< T, 1, Eigen::Dynamic > &x)'],['../namespacestan_1_1math.html#adffa61a0521d0c07b8c4cd7ccbbb4aca',1,'stan::math::stan_print(std::ostream *o, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &x)']]], + ['stanc_5fhelper',['stanc_helper',['../stanc__helper_8hpp.html#a6285d39574513b78cafc494a8f614852',1,'stanc_helper.hpp']]], + ['statement',['statement',['../structstan_1_1gm_1_1statement.html#abe28b81d5ca623dfbee35480dd7aed2e',1,'stan::gm::statement::statement()'],['../structstan_1_1gm_1_1statement.html#ab5dc6d05e69a9d8443a05edbca545446',1,'stan::gm::statement::statement(const statement_t &st)'],['../structstan_1_1gm_1_1statement.html#ad9eb67ce544f05bb158d1d660537d22d',1,'stan::gm::statement::statement(const nil &st)'],['../structstan_1_1gm_1_1statement.html#a7edde6e19d06ecabc83b4d0b20287f8c',1,'stan::gm::statement::statement(const assignment &st)'],['../structstan_1_1gm_1_1statement.html#af2e6691a2c9b6ebe50a2980782077a14',1,'stan::gm::statement::statement(const sample &st)'],['../structstan_1_1gm_1_1statement.html#ac61a640e5137d6644f0e6a4f2cf5a0f6',1,'stan::gm::statement::statement(const increment_log_prob_statement &st)'],['../structstan_1_1gm_1_1statement.html#a87f9d00e9b62804b5022958df5ba12df',1,'stan::gm::statement::statement(const expression &st)'],['../structstan_1_1gm_1_1statement.html#adcfaa1a8e2045291440780abf58f7203',1,'stan::gm::statement::statement(const statements &st)'],['../structstan_1_1gm_1_1statement.html#aee6de7e7d5063346e281a197ba3054c9',1,'stan::gm::statement::statement(const for_statement &st)'],['../structstan_1_1gm_1_1statement.html#a9326bcbb2bfbc31fe3bf8e5295496dac',1,'stan::gm::statement::statement(const conditional_statement &st)'],['../structstan_1_1gm_1_1statement.html#ac5c288cb0c748f276f04694c182cd612',1,'stan::gm::statement::statement(const while_statement &st)'],['../structstan_1_1gm_1_1statement.html#ab17da65c74a3282835af18dccd20d5cd',1,'stan::gm::statement::statement(const print_statement &st)'],['../structstan_1_1gm_1_1statement.html#ae88961e04050f67fdf34a6a5b1b872b9',1,'stan::gm::statement::statement(const no_op_statement &st)']]], + ['statement_5f2_5fgrammar',['statement_2_grammar',['../structstan_1_1gm_1_1statement__2__grammar.html#a124bb789c4c06388a498dffc981b1726',1,'stan::gm::statement_2_grammar']]], + ['statement_5fgrammar',['statement_grammar',['../structstan_1_1gm_1_1statement__grammar.html#af39ce5043643ec014ef8f16ed32fa9a8',1,'stan::gm::statement_grammar']]], + ['statement_5fvisgen',['statement_visgen',['../structstan_1_1gm_1_1statement__visgen.html#a5b426890ad86afc18588037d3acd1cdf',1,'stan::gm::statement_visgen']]], + ['statements',['statements',['../structstan_1_1gm_1_1statements.html#aa4e43d906c204aacbd111474d080c466',1,'stan::gm::statements::statements()'],['../structstan_1_1gm_1_1statements.html#afd82e89ed40745f135579777e52e2277',1,'stan::gm::statements::statements(const std::vector< var_decl > &local_decl, const std::vector< statement > &stmts)']]], + ['std_5fvector',['std_vector',['../classstan_1_1io_1_1reader.html#a72a39fbd649e5be85b0f20ac00721c35',1,'stan::io::reader']]], + ['step',['step',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#adfa1ece56a78fbd805212d31179da105',1,'stan::optimization::BFGSMinimizer::step()'],['../classstan_1_1optimization_1_1_nesterov_gradient.html#af3e12bb8b1db3c38fcbd359f6c7f5bc9',1,'stan::optimization::NesterovGradient::step()'],['../namespacestan_1_1agrad.html#a40c71c5396dbbbbcee5a8ae890345060',1,'stan::agrad::step()'],['../namespacestan_1_1math.html#a8fdc5e5ba8e306c2a594e928bfd62ea2',1,'stan::math::step()']]], + ['stepsize_5fadaptation',['stepsize_adaptation',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#a288d386b790bc25abc7a2b7f93bddb00',1,'stan::mcmc::stepsize_adaptation']]], + ['stepsize_5fadapter',['stepsize_adapter',['../classstan_1_1mcmc_1_1stepsize__adapter.html#a36b5d0fb4a2d8bb3025b4104a29f6068',1,'stan::mcmc::stepsize_adapter']]], + ['stepsize_5fcovar_5fadapter',['stepsize_covar_adapter',['../classstan_1_1mcmc_1_1stepsize__covar__adapter.html#a9aba8c876cb1207ce110ae95e90308e9',1,'stan::mcmc::stepsize_covar_adapter']]], + ['stepsize_5fvar_5fadapter',['stepsize_var_adapter',['../classstan_1_1mcmc_1_1stepsize__var__adapter.html#a1599b792341a655efeeebadf15c08d63',1,'stan::mcmc::stepsize_var_adapter']]], + ['stored_5fgradient_5fvari',['stored_gradient_vari',['../classstan_1_1agrad_1_1stored__gradient__vari.html#af779bcf6d92cccf16672907758f5bedc',1,'stan::agrad::stored_gradient_vari']]], + ['student_5ft_5fccdf_5flog',['student_t_ccdf_log',['../namespacestan_1_1prob.html#a927a64a2497df7302ae7fa9098e65546',1,'stan::prob']]], + ['student_5ft_5fcdf',['student_t_cdf',['../namespacestan_1_1prob.html#a19cc3cf5b600b92144c79356c0e879fc',1,'stan::prob']]], + ['student_5ft_5fcdf_5flog',['student_t_cdf_log',['../namespacestan_1_1prob.html#aab514e4c15e40c36184b0291e3c2e814',1,'stan::prob']]], + ['student_5ft_5flog',['student_t_log',['../namespacestan_1_1prob.html#a72933c1b9a4eb2005d32e811ae124bd0',1,'stan::prob::student_t_log(const T_y &y, const T_dof &nu, const T_loc &mu, const T_scale &sigma)'],['../namespacestan_1_1prob.html#a9097e9dad2bbb017a14c491fa3750203',1,'stan::prob::student_t_log(const T_y &y, const T_dof &nu, const T_loc &mu, const T_scale &sigma)']]], + ['student_5ft_5frng',['student_t_rng',['../namespacestan_1_1prob.html#adb81f1474168ce77e5bb71ef3c7432d9',1,'stan::prob']]], + ['sub',['sub',['../namespacestan_1_1math.html#a9e4c5e5b76b18a41b28f646104b3cd46',1,'stan::math']]], + ['sub_5fcol',['sub_col',['../namespacestan_1_1math.html#a63cf32e07d51c4ebfe042dd452eeae14',1,'stan::math']]], + ['sub_5frow',['sub_row',['../namespacestan_1_1math.html#aa1ea780efd8d0282dbf069f0776d727b',1,'stan::math']]], + ['subarguments',['subarguments',['../classstan_1_1gm_1_1categorical__argument.html#a5ca383118480518414b2b5b52bc42dfb',1,'stan::gm::categorical_argument']]], + ['subtract',['subtract',['../namespacestan_1_1math.html#a90c28e884c638ed67fa0c81ffc01e2d3',1,'stan::math::subtract(const Eigen::Matrix< T1, R, C > &m1, const Eigen::Matrix< T2, R, C > &m2)'],['../namespacestan_1_1math.html#a36726c055970205db893867a77e9d0a7',1,'stan::math::subtract(const T1 &c, const Eigen::Matrix< T2, R, C > &m)'],['../namespacestan_1_1math.html#a776789f307db599fddcda6a68c480557',1,'stan::math::subtract(const Eigen::Matrix< T1, R, C > &m, const T2 &c)']]], + ['success',['success',['../classstan_1_1math_1_1_l_d_l_t__factor_3_01stan_1_1agrad_1_1var_00_01_r_00_01_c_01_4.html#aa9e011b37205e0bfa198c9f032d19edb',1,'stan::math::LDLT_factor< stan::agrad::var, R, C >::success()'],['../classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4.html#a98215f2467d234354d398ec3e415dfce',1,'stan::math::LDLT_factor< double, R, C >::success()']]], + ['sum',['sum',['../classstan_1_1math_1_1accumulator.html#a289e9e869da8e29e78fa6c6c5bb9bddf',1,'stan::math::accumulator::sum()'],['../namespacestan_1_1agrad.html#a8baa11534c7cfb1b5e6f96bd958dfd03',1,'stan::agrad::sum(const Eigen::Matrix< fvar< T >, R, C > &m)'],['../namespacestan_1_1agrad.html#ad6c767cb7dcb4963f468cc5a2aa494ac',1,'stan::agrad::sum(const Eigen::Matrix< var, R, C > &m)'],['../namespacestan_1_1math.html#adde1fe0f002efa49cf9f7c129fe1a1d0',1,'stan::math::sum(std::vector< double > &x)'],['../namespacestan_1_1math.html#a1efee0b4f8879a114af50b7e9802745c',1,'stan::math::sum(const std::vector< T > &xs)'],['../namespacestan_1_1math.html#a44c32c2d7e895378feb11c99091765ad',1,'stan::math::sum(const Eigen::Matrix< T, R, C > &v)']]], + ['suppress_5fwarning',['suppress_warning',['../namespacestan_1_1gm.html#a33ab69ad9d56b9d1c99d8808fd106648',1,'stan::gm']]] +]; diff --git a/doc/api/html/search/functions_74.html b/doc/api/html/search/functions_74.html new file mode 100644 index 00000000000..e3c96c3398b --- /dev/null +++ b/doc/api/html/search/functions_74.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/functions_74.js b/doc/api/html/search/functions_74.js new file mode 100644 index 00000000000..7417ab328f7 --- /dev/null +++ b/doc/api/html/search/functions_74.js @@ -0,0 +1,28 @@ +var searchData= +[ + ['t',['T',['../classstan_1_1mcmc_1_1base__hamiltonian.html#a4f3adba6ad80e9b538e57bd655362eee',1,'stan::mcmc::base_hamiltonian::T()'],['../classstan_1_1mcmc_1_1dense__e__metric.html#a02cdb81d16115734815790a5dc5e6c90',1,'stan::mcmc::dense_e_metric::T()'],['../classstan_1_1mcmc_1_1diag__e__metric.html#a0a6a65c2291eac1e13ee48f4ed61f636',1,'stan::mcmc::diag_e_metric::T()'],['../classstan_1_1mcmc_1_1unit__e__metric.html#ae924e01d719ba1ccbaca6daff56f762a',1,'stan::mcmc::unit_e_metric::T()']]], + ['tail',['tail',['../namespacestan_1_1math.html#ac5b2770a97397fc738125d70420393fb',1,'stan::math::tail(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v, size_t n)'],['../namespacestan_1_1math.html#a7ae4ee69ace75bb2fb216247ab8272ec',1,'stan::math::tail(const Eigen::Matrix< T, 1, Eigen::Dynamic > &rv, size_t n)'],['../namespacestan_1_1math.html#a9956cf78180c6340f61667e797cf7055',1,'stan::math::tail(const std::vector< T > &sv, size_t n)']]], + ['tan',['tan',['../namespacestan_1_1agrad.html#adbc956463e3d58643e2a10dd3b6fd00c',1,'stan::agrad::tan(const var &a)'],['../namespacestan_1_1agrad.html#a48c6154fdb08d77249c5fa5216d34e2f',1,'stan::agrad::tan(const fvar< T > &x)']]], + ['tangent',['tangent',['../structstan_1_1agrad_1_1fvar.html#aa9f2f0107f7a9e3d92de38b615d22dd6',1,'stan::agrad::fvar']]], + ['tanh',['tanh',['../namespacestan_1_1agrad.html#a9e4ae39cc622b5388d16b971616da01d',1,'stan::agrad::tanh(const var &a)'],['../namespacestan_1_1agrad.html#ae56147f3f502e8436c2a02ed7d275128',1,'stan::agrad::tanh(const fvar< T > &x)']]], + ['tau',['tau',['../classstan_1_1mcmc_1_1base__hamiltonian.html#a12c9833e59b1aa7455872ebffe0819ce',1,'stan::mcmc::base_hamiltonian::tau()'],['../classstan_1_1mcmc_1_1dense__e__metric.html#a80d1467817d80ee50aca96b4f5b85146',1,'stan::mcmc::dense_e_metric::tau()'],['../classstan_1_1mcmc_1_1diag__e__metric.html#ad8b4d7e8c1cdfb0b98520bc6b6b3c5a2',1,'stan::mcmc::diag_e_metric::tau()'],['../classstan_1_1mcmc_1_1unit__e__metric.html#a428fcc506d11bfc227125153ef3e87d4',1,'stan::mcmc::unit_e_metric::tau()']]], + ['tcrossprod',['tcrossprod',['../namespacestan_1_1agrad.html#afe68149651e5bbdab5c531bc82b0868e',1,'stan::agrad::tcrossprod(const Eigen::Matrix< fvar< T >, R, C > &m)'],['../namespacestan_1_1agrad.html#a756be37f5934ada1e12abec937e3d13b',1,'stan::agrad::tcrossprod(const matrix_v &M)'],['../namespacestan_1_1math.html#a16b07b3f7d18cdb710806c5793a83d31',1,'stan::math::tcrossprod()']]], + ['term_5fgrammar',['term_grammar',['../structstan_1_1gm_1_1term__grammar.html#a190b57b393dca19c78dbe5e8e88d4cba',1,'stan::gm::term_grammar']]], + ['test_5fgradients',['test_gradients',['../namespacestan_1_1model.html#a53b2d650c95140811fa1dee58bdfb0c4',1,'stan::model']]], + ['tgamma',['tgamma',['../namespacestan_1_1agrad.html#a1a5ceb1f1202bd9c910bb9a447ea12a4',1,'stan::agrad::tgamma(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#ad3efbbe0949604d6a169864776508b5d',1,'stan::agrad::tgamma(const stan::agrad::var &a)']]], + ['to_5ffvar',['to_fvar',['../namespacestan_1_1agrad.html#afd6883af022a54c60dd207c733917425',1,'stan::agrad::to_fvar(const T &x)'],['../namespacestan_1_1agrad.html#a88f3f805d72a977a680135249341f0e6',1,'stan::agrad::to_fvar(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#a6a028d6aadad12e84b3a7a587458313d',1,'stan::agrad::to_fvar(const stan::math::matrix_d &m)'],['../namespacestan_1_1agrad.html#ab901750d171a340d359d4366ce18e920',1,'stan::agrad::to_fvar(const matrix_fd &m)'],['../namespacestan_1_1agrad.html#a8bf93f28ef32c8a01acee60bf3a86953',1,'stan::agrad::to_fvar(const matrix_fv &m)'],['../namespacestan_1_1agrad.html#ac33cf85a99591eab48c23e6243935827',1,'stan::agrad::to_fvar(const matrix_ffd &m)'],['../namespacestan_1_1agrad.html#aa5f13b4aac2e833fbc550adf15bbb89c',1,'stan::agrad::to_fvar(const matrix_ffv &m)'],['../namespacestan_1_1agrad.html#acb1b51857662ff7aceb7bf33e977fda2',1,'stan::agrad::to_fvar(const stan::math::vector_d &v)'],['../namespacestan_1_1agrad.html#ac5b829ba1d8c567a4ddc153e8e8deb28',1,'stan::agrad::to_fvar(const vector_fd &v)'],['../namespacestan_1_1agrad.html#af5034319341d60121260723636478ac1',1,'stan::agrad::to_fvar(const vector_fv &v)'],['../namespacestan_1_1agrad.html#af5fbf0e0b0386b87379bb330e9a97a3e',1,'stan::agrad::to_fvar(const vector_ffd &v)'],['../namespacestan_1_1agrad.html#ab7ee85577850baf2a033d4bcfb1bf630',1,'stan::agrad::to_fvar(const vector_ffv &v)'],['../namespacestan_1_1agrad.html#a795793505477543f5c1138585049d597',1,'stan::agrad::to_fvar(const stan::math::row_vector_d &rv)'],['../namespacestan_1_1agrad.html#a2f32b3cb37dc324f9dc3566aaf516a28',1,'stan::agrad::to_fvar(const row_vector_fd &rv)'],['../namespacestan_1_1agrad.html#accbd0fa22f2dc7ae894380a09ad2bccb',1,'stan::agrad::to_fvar(const row_vector_fv &rv)'],['../namespacestan_1_1agrad.html#af95bfe51597f252ca2d110f4cd6bc553',1,'stan::agrad::to_fvar(const row_vector_ffd &rv)'],['../namespacestan_1_1agrad.html#a6ec009827c7274b73a0a5dbdac33d2e0',1,'stan::agrad::to_fvar(const row_vector_ffv &rv)'],['../namespacestan_1_1agrad.html#aefe945fec82fc902015d82c4363e3adc',1,'stan::agrad::to_fvar(const Eigen::Matrix< T, R, C > &val, const Eigen::Matrix< T, R, C > &deriv)']]], + ['to_5fstring',['to_string',['../namespacestan_1_1gm.html#abd7966e0ee430a0e4e12326fd9cd762f',1,'stan::gm']]], + ['to_5fvar',['to_var',['../structstan_1_1agrad_1_1_operands_and_partials.html#a8d193a68235f335ad3ee7dc9fd130094',1,'stan::agrad::OperandsAndPartials::to_var()'],['../namespacestan_1_1agrad.html#a29fd7db9833fa17e3ff54709c13bba7e',1,'stan::agrad::to_var(const double &x)'],['../namespacestan_1_1agrad.html#a7d1c1c2fdd2ac909cde84c4cf3ae0b97',1,'stan::agrad::to_var(const var &x)'],['../namespacestan_1_1agrad.html#a3a13a3857bc425dab978636de428a7cf',1,'stan::agrad::to_var(const stan::math::matrix_d &m)'],['../namespacestan_1_1agrad.html#affc9f72e4afab7464103565795be6b5a',1,'stan::agrad::to_var(const matrix_v &m)'],['../namespacestan_1_1agrad.html#a87949ec636f056e2ed3956675ab2cfd1',1,'stan::agrad::to_var(const stan::math::vector_d &v)'],['../namespacestan_1_1agrad.html#a5ccc4666fffc6f06b1fcae217ea7b9a5',1,'stan::agrad::to_var(const vector_v &v)'],['../namespacestan_1_1agrad.html#a27974665dae3441df744285776390314',1,'stan::agrad::to_var(const stan::math::row_vector_d &rv)'],['../namespacestan_1_1agrad.html#a3f723b593d96af7f204e0f138ee49ec3',1,'stan::agrad::to_var(const row_vector_v &rv)']]], + ['to_5fvec',['to_vec',['../classstan_1_1io_1_1var__context.html#a4dead4b7dda5bc87bbc73f95fbc5cc14',1,'stan::io::var_context::to_vec()'],['../classstan_1_1io_1_1var__context.html#ae127d4a7b16d0584a1fc352715f9496f',1,'stan::io::var_context::to_vec(size_t n1)'],['../classstan_1_1io_1_1var__context.html#a6476d396377cd81c55b2870585ae6b80',1,'stan::io::var_context::to_vec(size_t n1, size_t n2)'],['../classstan_1_1io_1_1var__context.html#ae14b5a7e54016763fc3ab8f29d98b7ed',1,'stan::io::var_context::to_vec(size_t n1, size_t n2, size_t n3)'],['../classstan_1_1io_1_1var__context.html#a936afdc0abaf478ad05baaa9e5c899ed',1,'stan::io::var_context::to_vec(size_t n1, size_t n2, size_t n3, size_t n4)'],['../classstan_1_1io_1_1var__context.html#a5592642ebe6a9ec30cdc97c05e025456',1,'stan::io::var_context::to_vec(size_t n1, size_t n2, size_t n3, size_t n4, size_t n5)'],['../classstan_1_1io_1_1var__context.html#a16f365bd3c63c030a9fb7ef48f0b53a6',1,'stan::io::var_context::to_vec(size_t n1, size_t n2, size_t n3, size_t n4, size_t n5, size_t n6)'],['../classstan_1_1io_1_1var__context.html#a7c9a822c3aeb4f3d49dbd0ce509be573',1,'stan::io::var_context::to_vec(size_t n1, size_t n2, size_t n3, size_t n4, size_t n5, size_t n6, size_t n7)'],['../classstan_1_1io_1_1var__context.html#aab65fbc55030028781f4060cf8dba8b8',1,'stan::io::var_context::to_vec(size_t n1, size_t n2, size_t n3, size_t n4, size_t n5, size_t n6, size_t n7, size_t n8)']]], + ['to_5fvector',['to_vector',['../namespacestan_1_1math.html#a2576c9799bbb676b1b2d930be8032b8c',1,'stan::math']]], + ['total_5fdims',['total_dims',['../namespacestan_1_1gm.html#a0888f90c4bb279ad09b9f7724912a2cd',1,'stan::gm']]], + ['trace',['trace',['../namespacestan_1_1math.html#a7001fd7e0296d5dae6ab0a88e1a28547',1,'stan::math']]], + ['trace_5fgen_5fquad_5fform',['trace_gen_quad_form',['../namespacestan_1_1agrad.html#ad63e47021cd7aa676fe91db80092997e',1,'stan::agrad::trace_gen_quad_form()'],['../namespacestan_1_1math.html#a09d402800ee27ba77d03dc3ec365d22e',1,'stan::math::trace_gen_quad_form()']]], + ['trace_5finv_5fquad_5fform_5fldlt',['trace_inv_quad_form_ldlt',['../namespacestan_1_1agrad.html#a2fbca76427b2713b14f3445b3b5285c8',1,'stan::agrad::trace_inv_quad_form_ldlt(const Eigen::Matrix< T1, R1, C1 > &D, const stan::math::LDLT_factor< T2, R2, C2 > &A, const Eigen::Matrix< T3, R3, C3 > &B)'],['../namespacestan_1_1agrad.html#a9e9f878f6533c815e81193669c47a4f1',1,'stan::agrad::trace_inv_quad_form_ldlt(const stan::math::LDLT_factor< T2, R2, C2 > &A, const Eigen::Matrix< T3, R3, C3 > &B)'],['../namespacestan_1_1math.html#aab8b4d4ddbcb7df66d3baf8394318e1e',1,'stan::math::trace_inv_quad_form_ldlt(const Eigen::Matrix< double, R1, C1 > &D, const stan::math::LDLT_factor< double, R2, C2 > &A, const Eigen::Matrix< double, R3, C3 > &B)'],['../namespacestan_1_1math.html#aa0261f49dc318d8ee553e378325ee3db',1,'stan::math::trace_inv_quad_form_ldlt(const stan::math::LDLT_factor< double, R2, C2 > &A, const Eigen::Matrix< double, R3, C3 > &B)']]], + ['trace_5fquad_5fform',['trace_quad_form',['../namespacestan_1_1agrad.html#a0d688dadede814a9e3f2a3b6af6601c5',1,'stan::agrad::trace_quad_form()'],['../namespacestan_1_1math.html#a097af33142548fd565d1dab2233fa3e5',1,'stan::math::trace_quad_form()']]], + ['transition',['transition',['../classstan_1_1mcmc_1_1base__mcmc.html#acb8c38a588d49495a6dc2bb22d3eb435',1,'stan::mcmc::base_mcmc::transition()'],['../classstan_1_1mcmc_1_1adapt__dense__e__nuts.html#a18ea2702c10597236f0ea359f251c9f5',1,'stan::mcmc::adapt_dense_e_nuts::transition()'],['../classstan_1_1mcmc_1_1adapt__diag__e__nuts.html#ab1732e3ce940a436110a7cf8a0f17aac',1,'stan::mcmc::adapt_diag_e_nuts::transition()'],['../classstan_1_1mcmc_1_1adapt__unit__e__nuts.html#ad1130b322d697d62f7d8d3fbef6ee17f',1,'stan::mcmc::adapt_unit_e_nuts::transition()'],['../classstan_1_1mcmc_1_1base__nuts.html#aceabaf9d1acdf64b0d084e354ede9564',1,'stan::mcmc::base_nuts::transition()'],['../classstan_1_1mcmc_1_1adapt__dense__e__static__hmc.html#a406a335276134a2f86fa3e4c24925e4f',1,'stan::mcmc::adapt_dense_e_static_hmc::transition()'],['../classstan_1_1mcmc_1_1adapt__diag__e__static__hmc.html#a1dfaa6a5fe56df79856bc2f3789e9895',1,'stan::mcmc::adapt_diag_e_static_hmc::transition()'],['../classstan_1_1mcmc_1_1adapt__unit__e__static__hmc.html#a7db6fa5aedf5f35ceadca297f28f9914',1,'stan::mcmc::adapt_unit_e_static_hmc::transition()'],['../classstan_1_1mcmc_1_1base__static__hmc.html#aad1ceb75b092cdefe079b2c81275f501',1,'stan::mcmc::base_static_hmc::transition()']]], + ['transpose',['transpose',['../namespacestan_1_1math.html#a9db6bf273b69e20dc12e0c348b928296',1,'stan::math']]], + ['trigamma',['trigamma',['../namespacestan_1_1math.html#ab18c21bad37c9af26424d0922936355e',1,'stan::math']]], + ['trunc',['trunc',['../namespacestan_1_1agrad.html#aea02c702f338cc531cdb7b6e11344b34',1,'stan::agrad::trunc(const fvar< T > &x)'],['../namespacestan_1_1agrad.html#af5cde78a4f7b7ee45f8f98c75343174e',1,'stan::agrad::trunc(const stan::agrad::var &a)']]], + ['type',['type',['../structstan_1_1gm_1_1expr__type.html#adb52e22aa9f56f528c4a5305ae562364',1,'stan::gm::expr_type']]] +]; diff --git a/doc/api/html/search/functions_75.html b/doc/api/html/search/functions_75.html new file mode 100644 index 00000000000..2d61754d166 --- /dev/null +++ b/doc/api/html/search/functions_75.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/functions_75.js b/doc/api/html/search/functions_75.js new file mode 100644 index 00000000000..b81d3e32441 --- /dev/null +++ b/doc/api/html/search/functions_75.js @@ -0,0 +1,25 @@ +var searchData= +[ + ['ub_5fconstrain',['ub_constrain',['../namespacestan_1_1prob.html#a3cc62d5f301ccbb23e1e97231d736c4c',1,'stan::prob::ub_constrain(const T x, const TU ub)'],['../namespacestan_1_1prob.html#ac41afc3f7ad3b927d352383d4a8dea7f',1,'stan::prob::ub_constrain(const T x, const TU ub, T &lp)']]], + ['ub_5ffree',['ub_free',['../namespacestan_1_1prob.html#aa0fbf5448b5fdc2510256bbc73cc9b49',1,'stan::prob']]], + ['unary_5fop',['unary_op',['../structstan_1_1gm_1_1unary__op.html#a98e5a64686af8cefd3293e1925c2a3b1',1,'stan::gm::unary_op']]], + ['unconstrained_5fparam_5fnames_5fvisgen',['unconstrained_param_names_visgen',['../structstan_1_1gm_1_1unconstrained__param__names__visgen.html#a0fe661e868b54bff65d31a93d2c9e86e',1,'stan::gm::unconstrained_param_names_visgen']]], + ['uniform_5fccdf_5flog',['uniform_ccdf_log',['../namespacestan_1_1prob.html#ab524f79f1c0a3d5f97b1e481b21f1736',1,'stan::prob']]], + ['uniform_5fcdf',['uniform_cdf',['../namespacestan_1_1prob.html#a2540292f80682fd8971fcf9b5c0b35b1',1,'stan::prob']]], + ['uniform_5fcdf_5flog',['uniform_cdf_log',['../namespacestan_1_1prob.html#a05dfe81e20c266f06cc111b1571edb4d',1,'stan::prob']]], + ['uniform_5flog',['uniform_log',['../namespacestan_1_1prob.html#a20f9e437a772626e4e6aac94f58f60fa',1,'stan::prob::uniform_log(const T_y &y, const T_low &alpha, const T_high &beta)'],['../namespacestan_1_1prob.html#a520f558845310e1de1e8692a8ac5ab23',1,'stan::prob::uniform_log(const T_y &y, const T_low &alpha, const T_high &beta)']]], + ['uniform_5frng',['uniform_rng',['../namespacestan_1_1prob.html#ab9c29e62027123e900b55f29170e2426',1,'stan::prob']]], + ['unit_5fe_5fmetric',['unit_e_metric',['../classstan_1_1mcmc_1_1unit__e__metric.html#acdbee1cba43deae117af1312703ab2b4',1,'stan::mcmc::unit_e_metric']]], + ['unit_5fe_5fnuts',['unit_e_nuts',['../classstan_1_1mcmc_1_1unit__e__nuts.html#a0e74025d0c07dee2edc39b43d6fa85be',1,'stan::mcmc::unit_e_nuts']]], + ['unit_5fe_5fpoint',['unit_e_point',['../classstan_1_1mcmc_1_1unit__e__point.html#a8ab0ffea3990bf0b8cdb289e1f7327ef',1,'stan::mcmc::unit_e_point']]], + ['unit_5fe_5fstatic_5fhmc',['unit_e_static_hmc',['../classstan_1_1mcmc_1_1unit__e__static__hmc.html#aa3f18e181e9b27bc487ec48af5ddd9c1',1,'stan::mcmc::unit_e_static_hmc']]], + ['unit_5fvector',['unit_vector',['../classstan_1_1io_1_1reader.html#a6b8ebf459013095c8bef590c5e7f2dd2',1,'stan::io::reader']]], + ['unit_5fvector_5fconstrain',['unit_vector_constrain',['../classstan_1_1io_1_1reader.html#aafcb145538d7414947c3420b652ad962',1,'stan::io::reader::unit_vector_constrain(size_t k)'],['../classstan_1_1io_1_1reader.html#ac4c986f3ceee7c402820835ba7bfde62',1,'stan::io::reader::unit_vector_constrain(size_t k, T &lp)'],['../namespacestan_1_1prob.html#afd9044ce24ca929e0d1fcf49fdfcb7cc',1,'stan::prob::unit_vector_constrain(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &y)'],['../namespacestan_1_1prob.html#ac361cea0021ad5cbd7d9daa32935bf9b',1,'stan::prob::unit_vector_constrain(const Eigen::Matrix< T, Eigen::Dynamic, 1 > &y, T &lp)']]], + ['unit_5fvector_5ffree',['unit_vector_free',['../namespacestan_1_1prob.html#aa72cd0f07fe68884774feea5e5c0056c',1,'stan::prob']]], + ['unit_5fvector_5funconstrain',['unit_vector_unconstrain',['../classstan_1_1io_1_1writer.html#aa0f2b9b17db03235f4cd3f90092ac6d0',1,'stan::io::writer']]], + ['unit_5fvector_5fvar_5fdecl',['unit_vector_var_decl',['../structstan_1_1gm_1_1unit__vector__var__decl.html#a76baa9fd153a608c6d4e0b4077ddd1bc',1,'stan::gm::unit_vector_var_decl::unit_vector_var_decl()'],['../structstan_1_1gm_1_1unit__vector__var__decl.html#a2cdc1ee5970cc4e9d06362b1a51bdb7c',1,'stan::gm::unit_vector_var_decl::unit_vector_var_decl(expression const &K, std::string const &name, std::vector< expression > const &dims)']]], + ['unvalued_5fargument',['unvalued_argument',['../classstan_1_1gm_1_1unvalued__argument.html#ad92f588ed35ed51647cac11f883a945a',1,'stan::gm::unvalued_argument']]], + ['update',['update',['../classstan_1_1mcmc_1_1base__hamiltonian.html#a72b6cc15dc1f074e871fbd77c3d49ed8',1,'stan::mcmc::base_hamiltonian']]], + ['update_5fq',['update_q',['../classstan_1_1mcmc_1_1base__leapfrog.html#aafd8bbf5fcf3ac4246ce798bbe085098',1,'stan::mcmc::base_leapfrog::update_q()'],['../classstan_1_1mcmc_1_1expl__leapfrog.html#ab0ac437892b1206c0bb581e5db52ba0e',1,'stan::mcmc::expl_leapfrog::update_q()']]], + ['utc_5ftime_5fstring',['utc_time_string',['../namespacestan_1_1io.html#a56441daea55f49d4bcb168b30d7313f0',1,'stan::io']]] +]; diff --git a/doc/api/html/search/functions_76.html b/doc/api/html/search/functions_76.html new file mode 100644 index 00000000000..2ec05695c16 --- /dev/null +++ b/doc/api/html/search/functions_76.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/functions_76.js b/doc/api/html/search/functions_76.js new file mode 100644 index 00000000000..9d418a71e88 --- /dev/null +++ b/doc/api/html/search/functions_76.js @@ -0,0 +1,59 @@ +var searchData= +[ + ['v',['V',['../classstan_1_1mcmc_1_1base__hamiltonian.html#a833128e107a090d7b285ca34a80c6881',1,'stan::mcmc::base_hamiltonian']]], + ['val',['val',['../classstan_1_1agrad_1_1var.html#a3c15579ed3018cae0a0bf556bed164e3',1,'stan::agrad::var::val()'],['../structstan_1_1agrad_1_1fvar.html#a4a8422fc2fcf430e05a5a05cf3c14fe0',1,'stan::agrad::fvar::val()'],['../classstan_1_1agrad_1_1var.html#a3c15579ed3018cae0a0bf556bed164e3',1,'stan::agrad::var::val()'],['../classstan_1_1io_1_1cmd__line.html#a44c058f7d1a236d9fdc95720191e8bd2',1,'stan::io::cmd_line::val()']]], + ['valid_5fvalue',['valid_value',['../classstan_1_1gm_1_1list__argument.html#a73dd9564f755fa41db8dfad1186ba269',1,'stan::gm::list_argument']]], + ['validate_5farray',['validate_array',['../structstan_1_1gm_1_1validate__transformed__params__visgen.html#a36abc2dc33d5d8053dbe93a30444fca4',1,'stan::gm::validate_transformed_params_visgen']]], + ['validate_5fcolumn_5findex',['validate_column_index',['../namespacestan_1_1math.html#a0908a541f73f2d206d9bc0d41c487a4d',1,'stan::math']]], + ['validate_5fdims',['validate_dims',['../classstan_1_1io_1_1var__context.html#a6b4a742d7a221312bc81fc4fdd9bf011',1,'stan::io::var_context']]], + ['validate_5fgreater',['validate_greater',['../namespacestan_1_1math.html#a954f9705a277937f1a4e39f85c226304',1,'stan::math']]], + ['validate_5fgreater_5for_5fequal',['validate_greater_or_equal',['../namespacestan_1_1math.html#a153a2d6e5f828a2dc08ccba7dab2ba02',1,'stan::math']]], + ['validate_5fless',['validate_less',['../namespacestan_1_1math.html#a849c8dde0b08965817c862676d5b8aa3',1,'stan::math']]], + ['validate_5fless_5for_5fequal',['validate_less_or_equal',['../namespacestan_1_1math.html#a3f5968c67a61a65e3fe2a434d9ffb7bf',1,'stan::math']]], + ['validate_5fmatching_5fdims',['validate_matching_dims',['../namespacestan_1_1math.html#a6c2cb320ad093bb28e503258b3681826',1,'stan::math']]], + ['validate_5fmatching_5fsizes',['validate_matching_sizes',['../namespacestan_1_1math.html#ad53597362a6c7c1158057959fcac292e',1,'stan::math::validate_matching_sizes(const std::vector< T1 > &x1, const std::vector< T2 > &x2, const char *msg)'],['../namespacestan_1_1math.html#a41ec7da4239a007943fc013e07cba3aa',1,'stan::math::validate_matching_sizes(const Eigen::Matrix< T1, R1, C1 > &x1, const Eigen::Matrix< T2, R2, C2 > &x2, const char *msg)'],['../namespacestan_1_1math.html#a263171956617573c8cd3c1d18fd6ceb3',1,'stan::math::validate_matching_sizes(const Eigen::Block< Derived > &x1, const Eigen::Matrix< T2, R2, C2 > &x2, const char *msg)'],['../namespacestan_1_1math.html#a8129ae89cd2dbb265cb12b92f8e04422',1,'stan::math::validate_matching_sizes(const Eigen::Matrix< T1, R1, C1 > &x1, const Eigen::Block< Derived > &x2, const char *msg)'],['../namespacestan_1_1math.html#affd4c08b7da0d68132fa34cb400ea42f',1,'stan::math::validate_matching_sizes(const Eigen::Block< Derived1 > &x1, const Eigen::Block< Derived2 > &x2, const char *msg)']]], + ['validate_5fmultiplicable',['validate_multiplicable',['../namespacestan_1_1math.html#a2f8623dd71addc9eb308adbd79650173',1,'stan::math']]], + ['validate_5fnon_5fnegative_5findex',['validate_non_negative_index',['../namespacestan_1_1math.html#a3abcd9b7deac4b6378eae04ee927f498',1,'stan::math']]], + ['validate_5fnon_5fnegative_5frep',['validate_non_negative_rep',['../namespacestan_1_1math.html#aa5fcab47a4a1c557ed22ce8c9dfa4690',1,'stan::math']]], + ['validate_5fnonzero_5fsize',['validate_nonzero_size',['../namespacestan_1_1math.html#ab4ad50f7ce663f08887cc98f00325102',1,'stan::math']]], + ['validate_5frow_5findex',['validate_row_index',['../namespacestan_1_1math.html#a89eabaf81a12e1ba52dc95991f3c7cec',1,'stan::math']]], + ['validate_5fsquare',['validate_square',['../namespacestan_1_1math.html#a80e2967cc986a918329c7e226aa97d35',1,'stan::math']]], + ['validate_5fstd_5fvector_5findex',['validate_std_vector_index',['../namespacestan_1_1math.html#aa8bef2aad224049eb13f5de732d60805',1,'stan::math']]], + ['validate_5fsymmetric',['validate_symmetric',['../namespacestan_1_1math.html#a3e7c964f96b6454223b9204f463ad674',1,'stan::math']]], + ['validate_5ftransformed_5fparams_5fvisgen',['validate_transformed_params_visgen',['../structstan_1_1gm_1_1validate__transformed__params__visgen.html#a7a4e7704245e4a73bc886041c82c91e5',1,'stan::gm::validate_transformed_params_visgen']]], + ['validate_5fvar_5fdecl_5fvisgen',['validate_var_decl_visgen',['../structstan_1_1gm_1_1validate__var__decl__visgen.html#a271a3fadedfb0fe40560244c26f4aef4',1,'stan::gm::validate_var_decl_visgen']]], + ['validate_5fvector',['validate_vector',['../namespacestan_1_1math.html#a883b9b83e5ca3d865f9dcf26d57a69fe',1,'stan::math']]], + ['vals_5fi',['vals_i',['../classstan_1_1io_1_1dump.html#ac9a6ba06213461f7d86c5823813de2bd',1,'stan::io::dump::vals_i()'],['../classstan_1_1io_1_1var__context.html#ae491a228dc66136ed04f9d22b18386d2',1,'stan::io::var_context::vals_i()']]], + ['vals_5fr',['vals_r',['../classstan_1_1io_1_1dump.html#aa9b7bc08c1152a313e90b74ade5338b5',1,'stan::io::dump::vals_r()'],['../classstan_1_1io_1_1var__context.html#aaf3c30da7aa7a81b67d0cb3a480a5295',1,'stan::io::var_context::vals_r()']]], + ['value',['value',['../classstan_1_1gm_1_1list__argument.html#a5c53e1ae1cbfea372b538425868f0c42',1,'stan::gm::list_argument::value()'],['../classstan_1_1gm_1_1singleton__argument.html#a7c7d0321e410a7cf3cecfcda7ddbaa4a',1,'stan::gm::singleton_argument::value()']]], + ['value_5fof',['value_of',['../namespacestan_1_1agrad.html#a8ce52917ab0cd91c9db4d615f1988e11',1,'stan::agrad::value_of(const agrad::var &v)'],['../namespacestan_1_1agrad.html#a241ff687791a297532aeed5955d6b137',1,'stan::agrad::value_of(const Eigen::Matrix< double, R, C > &M)'],['../namespacestan_1_1agrad.html#aef1424bdc8ef1058ec2cef4584bb6d5f',1,'stan::agrad::value_of(const Eigen::Matrix< var, R, C > &M)'],['../namespacestan_1_1math.html#a73087d72fd937f4be66684bd2613ae6e',1,'stan::math::value_of()']]], + ['value_5fof_3c_20double_20_3e',['value_of< double >',['../namespacestan_1_1math.html#a2d7774df98215b7d113075019d74ebbf',1,'stan::math']]], + ['values',['values',['../classstan_1_1gm_1_1list__argument.html#a0e44b787e5dd125a719e8ea75d621ceb',1,'stan::gm::list_argument']]], + ['var',['var',['../classstan_1_1agrad_1_1var.html#adfb9d02c364f36d433ebbe551ed5cf6d',1,'stan::agrad::var::var(vari *vi)'],['../classstan_1_1agrad_1_1var.html#a338e1033dc034d6333060ec779200146',1,'stan::agrad::var::var()'],['../classstan_1_1agrad_1_1var.html#af45c7283eb94f118473d6590387ae2bb',1,'stan::agrad::var::var(bool b)'],['../classstan_1_1agrad_1_1var.html#a36df08fb95336e5c4475768447cc17dc',1,'stan::agrad::var::var(char c)'],['../classstan_1_1agrad_1_1var.html#add6c4253ae479385de58f2dd02e5e82e',1,'stan::agrad::var::var(short n)'],['../classstan_1_1agrad_1_1var.html#ac4651f0c746a0f08974866f3052b7137',1,'stan::agrad::var::var(unsigned short n)'],['../classstan_1_1agrad_1_1var.html#a8a75e2e91a261d9919cc05ca0e2535c3',1,'stan::agrad::var::var(int n)'],['../classstan_1_1agrad_1_1var.html#a3044e37414ac3abe97862ec2a9bbc7a7',1,'stan::agrad::var::var(unsigned int n)'],['../classstan_1_1agrad_1_1var.html#a5603249b00e49e3b3176a7652274bd8f',1,'stan::agrad::var::var(long int n)'],['../classstan_1_1agrad_1_1var.html#acdc706002d30bae61e31b94706110f66',1,'stan::agrad::var::var(unsigned long int n)'],['../classstan_1_1agrad_1_1var.html#a4160c721453aae2e1ab1a10d082e5ea4',1,'stan::agrad::var::var(float x)'],['../classstan_1_1agrad_1_1var.html#a5af3ea95797e2c3789a01a32dab060e6',1,'stan::agrad::var::var(double x)'],['../classstan_1_1agrad_1_1var.html#ab2b3011f87a92d85b32f6a0da738c46e',1,'stan::agrad::var::var(long double x)'],['../classstan_1_1agrad_1_1var.html#adfb9d02c364f36d433ebbe551ed5cf6d',1,'stan::agrad::var::var(vari *vi)'],['../classstan_1_1agrad_1_1var.html#a338e1033dc034d6333060ec779200146',1,'stan::agrad::var::var()'],['../classstan_1_1agrad_1_1var.html#af45c7283eb94f118473d6590387ae2bb',1,'stan::agrad::var::var(bool b)'],['../classstan_1_1agrad_1_1var.html#a36df08fb95336e5c4475768447cc17dc',1,'stan::agrad::var::var(char c)'],['../classstan_1_1agrad_1_1var.html#add6c4253ae479385de58f2dd02e5e82e',1,'stan::agrad::var::var(short n)'],['../classstan_1_1agrad_1_1var.html#ac4651f0c746a0f08974866f3052b7137',1,'stan::agrad::var::var(unsigned short n)'],['../classstan_1_1agrad_1_1var.html#a8a75e2e91a261d9919cc05ca0e2535c3',1,'stan::agrad::var::var(int n)'],['../classstan_1_1agrad_1_1var.html#a3044e37414ac3abe97862ec2a9bbc7a7',1,'stan::agrad::var::var(unsigned int n)'],['../classstan_1_1agrad_1_1var.html#a5603249b00e49e3b3176a7652274bd8f',1,'stan::agrad::var::var(long int n)'],['../classstan_1_1agrad_1_1var.html#acdc706002d30bae61e31b94706110f66',1,'stan::agrad::var::var(unsigned long int n)'],['../classstan_1_1agrad_1_1var.html#a050ffd5f911d423f27673bc531e1e9c1',1,'stan::agrad::var::var(unsigned long long n)'],['../classstan_1_1agrad_1_1var.html#a078422d44f10f7e4dadfeb9424f6fa94',1,'stan::agrad::var::var(long long n)'],['../classstan_1_1agrad_1_1var.html#a4160c721453aae2e1ab1a10d082e5ea4',1,'stan::agrad::var::var(float x)'],['../classstan_1_1agrad_1_1var.html#a5af3ea95797e2c3789a01a32dab060e6',1,'stan::agrad::var::var(double x)'],['../classstan_1_1agrad_1_1var.html#ab2b3011f87a92d85b32f6a0da738c46e',1,'stan::agrad::var::var(long double x)']]], + ['var_5fadaptation',['var_adaptation',['../classstan_1_1mcmc_1_1var__adaptation.html#a6a890bf02c8dba36880f8e273b2f9549',1,'stan::mcmc::var_adaptation']]], + ['var_5fdecl',['var_decl',['../structstan_1_1gm_1_1var__decl.html#a609249d793137a66288e59763f0c0ca1',1,'stan::gm::var_decl::var_decl()'],['../structstan_1_1gm_1_1var__decl.html#ad6b9ea345106c83e5c9a006142d195e7',1,'stan::gm::var_decl::var_decl(const var_decl_t &decl)'],['../structstan_1_1gm_1_1var__decl.html#a2e0ba8dd969d92d891856d0e9b0d6b15',1,'stan::gm::var_decl::var_decl(const nil &decl)'],['../structstan_1_1gm_1_1var__decl.html#aea6f39c72a547284867577e99479f92c',1,'stan::gm::var_decl::var_decl(const int_var_decl &decl)'],['../structstan_1_1gm_1_1var__decl.html#ace6a19a8b112ee1bae58bb097cc4cde1',1,'stan::gm::var_decl::var_decl(const double_var_decl &decl)'],['../structstan_1_1gm_1_1var__decl.html#adabe31b1d68c4fedd82c583cebf31144',1,'stan::gm::var_decl::var_decl(const vector_var_decl &decl)'],['../structstan_1_1gm_1_1var__decl.html#a99d47a87450d915d42f2a5ab0731a307',1,'stan::gm::var_decl::var_decl(const row_vector_var_decl &decl)'],['../structstan_1_1gm_1_1var__decl.html#ac4ec89ef8d699e42d15ad4313a85b912',1,'stan::gm::var_decl::var_decl(const matrix_var_decl &decl)'],['../structstan_1_1gm_1_1var__decl.html#a1375d5fae7161b6788290acb062bf332',1,'stan::gm::var_decl::var_decl(const simplex_var_decl &decl)'],['../structstan_1_1gm_1_1var__decl.html#a02bd1875a6b106c8200a8c1c268ce23a',1,'stan::gm::var_decl::var_decl(const unit_vector_var_decl &decl)'],['../structstan_1_1gm_1_1var__decl.html#a6c5e46d11317ad8b9952c3732a50ba3a',1,'stan::gm::var_decl::var_decl(const ordered_var_decl &decl)'],['../structstan_1_1gm_1_1var__decl.html#a6c0661f7389c05f0c1a7f2ab94886205',1,'stan::gm::var_decl::var_decl(const positive_ordered_var_decl &decl)'],['../structstan_1_1gm_1_1var__decl.html#a9557a2d4d9e64c5bccc65c7110c726f5',1,'stan::gm::var_decl::var_decl(const cholesky_factor_var_decl &decl)'],['../structstan_1_1gm_1_1var__decl.html#a700ecb84f6ed7e2f100409c026cc6a6a',1,'stan::gm::var_decl::var_decl(const cov_matrix_var_decl &decl)'],['../structstan_1_1gm_1_1var__decl.html#acacc89bd6b788a9ea8b509153957e21e',1,'stan::gm::var_decl::var_decl(const corr_matrix_var_decl &decl)']]], + ['var_5fdecls_5fgrammar',['var_decls_grammar',['../structstan_1_1gm_1_1var__decls__grammar.html#ae9971b3fb03092c02d4f4d12a9d05277',1,'stan::gm::var_decls_grammar']]], + ['var_5fresizing_5fvisgen',['var_resizing_visgen',['../structstan_1_1gm_1_1var__resizing__visgen.html#ac5178b0a38aa8258bcbf689ae03d895b',1,'stan::gm::var_resizing_visgen']]], + ['var_5fsize_5fvalidating_5fvisgen',['var_size_validating_visgen',['../structstan_1_1gm_1_1var__size__validating__visgen.html#ade6d9d7b7a8904cf3d32ff16283143cc',1,'stan::gm::var_size_validating_visgen']]], + ['vari',['vari',['../classstan_1_1agrad_1_1vari.html#add6d0976a3103aebe8b529fb3a4aede3',1,'stan::agrad::vari::vari(const double x)'],['../classstan_1_1agrad_1_1vari.html#add6d0976a3103aebe8b529fb3a4aede3',1,'stan::agrad::vari::vari(const double x)'],['../classstan_1_1agrad_1_1vari.html#a38eab19f6ecee276e3f306c14df18403',1,'stan::agrad::vari::vari(const double x, bool stacked)']]], + ['variable',['variable',['../structstan_1_1gm_1_1variable.html#a4d6553f00364503f9b3c1b09cce2742a',1,'stan::gm::variable::variable()'],['../structstan_1_1gm_1_1variable.html#a7a550a388056ef05489c8947aaa4d664',1,'stan::gm::variable::variable(std::string name)']]], + ['variable_5fdims',['variable_dims',['../structstan_1_1gm_1_1variable__dims.html#a58ef01ac93eb73561446431890023fcb',1,'stan::gm::variable_dims::variable_dims()'],['../structstan_1_1gm_1_1variable__dims.html#aa35ae19b846c7eed5571dc6c62b51629',1,'stan::gm::variable_dims::variable_dims(std::string const &name, std::vector< expression > const &dims)']]], + ['variance',['variance',['../classstan_1_1mcmc_1_1chains.html#ada94492fb9209194467c40ee0c70ae7e',1,'stan::mcmc::chains::variance(const int chain, const int index)'],['../classstan_1_1mcmc_1_1chains.html#a2a490e9c65ef24c24d90363c762606cb',1,'stan::mcmc::chains::variance(const int index)'],['../classstan_1_1mcmc_1_1chains.html#a5e82c2ed22640dc97e77000030cad474',1,'stan::mcmc::chains::variance(const int chain, const std::string &name)'],['../classstan_1_1mcmc_1_1chains.html#ac73d02b763998c65a573f3e3f770833b',1,'stan::mcmc::chains::variance(const std::string &name)'],['../namespacestan_1_1agrad.html#a4cb2a39469233dedb86b1000789a9595',1,'stan::agrad::variance(const std::vector< var > &v)'],['../namespacestan_1_1agrad.html#a7ef648c386bf96d4cdc8b688f8de02af',1,'stan::agrad::variance(const Eigen::Matrix< var, R, C > &m)'],['../namespacestan_1_1math.html#aa433ac2fc47bbd40a6d87f62574dff85',1,'stan::math::variance(const std::vector< T > &v)'],['../namespacestan_1_1math.html#a1f055da8754c2215aac70d7787692f54',1,'stan::math::variance(const Eigen::Matrix< T, R, C > &m)']]], + ['vector',['vector',['../classstan_1_1io_1_1reader.html#ac7cbe04c9a1439e20b27c3cf612bd963',1,'stan::io::reader']]], + ['vector_5fconstrain',['vector_constrain',['../classstan_1_1io_1_1reader.html#a393939c8de7bd2609b069424244b005a',1,'stan::io::reader::vector_constrain(size_t m)'],['../classstan_1_1io_1_1reader.html#aec8c3e697090c981438b94da63c02ccc',1,'stan::io::reader::vector_constrain(size_t m, T &)']]], + ['vector_5flb',['vector_lb',['../classstan_1_1io_1_1reader.html#ae6eeeaea16178783def48d93e92e502e',1,'stan::io::reader']]], + ['vector_5flb_5fconstrain',['vector_lb_constrain',['../classstan_1_1io_1_1reader.html#a8edd356b9b6575e74458dfc36fd1079c',1,'stan::io::reader::vector_lb_constrain(const TL lb, size_t m)'],['../classstan_1_1io_1_1reader.html#a380b2abea05be45eef534178ccddae74',1,'stan::io::reader::vector_lb_constrain(const TL lb, size_t m, T &lp)']]], + ['vector_5flb_5funconstrain',['vector_lb_unconstrain',['../classstan_1_1io_1_1writer.html#ad47362a39537ff1b5d771780ee652d2b',1,'stan::io::writer']]], + ['vector_5flub',['vector_lub',['../classstan_1_1io_1_1reader.html#acfa86e4338c499595998dd4dc0b58c6d',1,'stan::io::reader']]], + ['vector_5flub_5fconstrain',['vector_lub_constrain',['../classstan_1_1io_1_1reader.html#aa0eb51076e214b1cfee60b70260186c8',1,'stan::io::reader::vector_lub_constrain(const TL lb, const TU ub, size_t m)'],['../classstan_1_1io_1_1reader.html#a6f0780b890a223ecc7840732bda385e5',1,'stan::io::reader::vector_lub_constrain(const TL lb, const TU ub, size_t m, T &lp)']]], + ['vector_5flub_5funconstrain',['vector_lub_unconstrain',['../classstan_1_1io_1_1writer.html#a2cd367320f480096f724c2e180f6abfe',1,'stan::io::writer']]], + ['vector_5fub',['vector_ub',['../classstan_1_1io_1_1reader.html#a35d1322b79079e9227ae225a480807db',1,'stan::io::reader']]], + ['vector_5fub_5fconstrain',['vector_ub_constrain',['../classstan_1_1io_1_1reader.html#a5f5c24c79245cdcdc447f1d70ab16f67',1,'stan::io::reader::vector_ub_constrain(const TU ub, size_t m)'],['../classstan_1_1io_1_1reader.html#a7c62e6ad093def5f59767807a3c46b74',1,'stan::io::reader::vector_ub_constrain(const TU ub, size_t m, T &lp)']]], + ['vector_5fub_5funconstrain',['vector_ub_unconstrain',['../classstan_1_1io_1_1writer.html#a4d032dfecf63d6cc4f4fbe9acfbf1d26',1,'stan::io::writer']]], + ['vector_5funconstrain',['vector_unconstrain',['../classstan_1_1io_1_1writer.html#a5fac170691f85ce21490c654985c2880',1,'stan::io::writer']]], + ['vector_5fvar_5fdecl',['vector_var_decl',['../structstan_1_1gm_1_1vector__var__decl.html#a75bee96d48f65c3656c0195e9ddd658c',1,'stan::gm::vector_var_decl::vector_var_decl()'],['../structstan_1_1gm_1_1vector__var__decl.html#ae60a0d9f611230785a264fe1057b070c',1,'stan::gm::vector_var_decl::vector_var_decl(range const &range, expression const &M, std::string const &name, std::vector< expression > const &dims)']]], + ['vectorview',['VectorView',['../classstan_1_1_vector_view.html#a49530fcffe86b987cc16c9db07433a01',1,'stan::VectorView::VectorView(scalar_t &c)'],['../classstan_1_1_vector_view.html#aa8cf0eb6c25b3e6e7ab4164d3327cab3',1,'stan::VectorView::VectorView(std::vector< scalar_t > &v)'],['../classstan_1_1_vector_view.html#a1a2167039be334fe553432580f7ec4ee',1,'stan::VectorView::VectorView(Eigen::Matrix< scalar_t, R, C > &m)'],['../classstan_1_1_vector_view.html#ace98de1e8835b3317330d98fa34b981b',1,'stan::VectorView::VectorView(scalar_t *x)'],['../classstan_1_1_vector_view_3_01const_01_t_00_01is__array_00_01throw__if__accessed_01_4.html#a144dc75865388d9e80c153d6651a9bab',1,'stan::VectorView< const T, is_array, throw_if_accessed >::VectorView(const scalar_t &c)'],['../classstan_1_1_vector_view_3_01const_01_t_00_01is__array_00_01throw__if__accessed_01_4.html#a2e063aacbcb8999b921bce5d52557646',1,'stan::VectorView< const T, is_array, throw_if_accessed >::VectorView(const scalar_t *x)'],['../classstan_1_1_vector_view_3_01const_01_t_00_01is__array_00_01throw__if__accessed_01_4.html#a8a70c613d18b72f45466591168f354dc',1,'stan::VectorView< const T, is_array, throw_if_accessed >::VectorView(const std::vector< scalar_t > &v)'],['../classstan_1_1_vector_view_3_01const_01_t_00_01is__array_00_01throw__if__accessed_01_4.html#af337a1b8ede134a1debe59fbee1cd1e1',1,'stan::VectorView< const T, is_array, throw_if_accessed >::VectorView(const Eigen::Matrix< scalar_t, R, C > &m)'],['../classstan_1_1_vector_view_3_01const_01double_00_01false_00_01false_01_4.html#af57df094db378d9da317b93d23c34ab1',1,'stan::VectorView< const double, false, false >::VectorView()']]], + ['verbose_5fevolve',['verbose_evolve',['../classstan_1_1mcmc_1_1base__leapfrog.html#a514877fc7879757485b997d90074393d',1,'stan::mcmc::base_leapfrog']]], + ['visgen',['visgen',['../structstan_1_1gm_1_1visgen.html#a3e7e38e3b411dc26e0451cc3327018ca',1,'stan::gm::visgen']]], + ['von_5fmises_5flog',['von_mises_log',['../namespacestan_1_1prob.html#a5f25537bc65fd6699824c9c5829c9e0a',1,'stan::prob::von_mises_log(T_y const &y, T_loc const &mu, T_scale const &kappa)'],['../namespacestan_1_1prob.html#a34be34d214b53bf3d2f158ebe9b4c93d',1,'stan::prob::von_mises_log(T_y const &y, T_loc const &mu, T_scale const &kappa)']]] +]; diff --git a/doc/api/html/search/functions_77.html b/doc/api/html/search/functions_77.html new file mode 100644 index 00000000000..8fe97554fba --- /dev/null +++ b/doc/api/html/search/functions_77.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/functions_77.js b/doc/api/html/search/functions_77.js new file mode 100644 index 00000000000..03360ec864a --- /dev/null +++ b/doc/api/html/search/functions_77.js @@ -0,0 +1,36 @@ +var searchData= +[ + ['warmup',['warmup',['../classstan_1_1mcmc_1_1chains.html#a4a6916b3af4d4f7ecf848a4587157e2d',1,'stan::mcmc::chains::warmup()'],['../classstan_1_1mcmc_1_1chains.html#a5d009a5e09853cdf0181c6bb68f1680a',1,'stan::mcmc::chains::warmup(const int chain)'],['../namespacestan_1_1gm.html#a98eeb261d85ab5d16b98b8cfeaeb31cc',1,'stan::gm::warmup()']]], + ['weibull_5fccdf_5flog',['weibull_ccdf_log',['../namespacestan_1_1prob.html#a77b3086174c8c53f64a6040926e463c7',1,'stan::prob']]], + ['weibull_5fcdf',['weibull_cdf',['../namespacestan_1_1prob.html#aebe40f64269bb4cad34cbf93faa258a3',1,'stan::prob']]], + ['weibull_5fcdf_5flog',['weibull_cdf_log',['../namespacestan_1_1prob.html#adf406916a5b4faaa7ff6c09f38029418',1,'stan::prob']]], + ['weibull_5flog',['weibull_log',['../namespacestan_1_1prob.html#ac9dd426180e500e8ce9ab2e401393c5a',1,'stan::prob::weibull_log(const T_y &y, const T_shape &alpha, const T_scale &sigma)'],['../namespacestan_1_1prob.html#ac782f55b0a8994488c5a02f7977799cf',1,'stan::prob::weibull_log(const T_y &y, const T_shape &alpha, const T_scale &sigma)']]], + ['weibull_5frng',['weibull_rng',['../namespacestan_1_1prob.html#a446b0eda07246d07a2d539c9a511ea7e',1,'stan::prob']]], + ['welford_5fcovar_5festimator',['welford_covar_estimator',['../classstan_1_1prob_1_1welford__covar__estimator.html#a185e1767d0634b283c66f8d845bb42d7',1,'stan::prob::welford_covar_estimator']]], + ['welford_5fvar_5festimator',['welford_var_estimator',['../classstan_1_1prob_1_1welford__var__estimator.html#adcb9ab77cf1496f0d81a605e4b503608',1,'stan::prob::welford_var_estimator']]], + ['while_5fstatement',['while_statement',['../structstan_1_1gm_1_1while__statement.html#a3d22ddf0941379465a1d233308baa78c',1,'stan::gm::while_statement::while_statement()'],['../structstan_1_1gm_1_1while__statement.html#afcb474205331a4302d5b57e1d334208a',1,'stan::gm::while_statement::while_statement(const expression &condition, const statement &body)']]], + ['whitespace_5fgrammar',['whitespace_grammar',['../structstan_1_1gm_1_1whitespace__grammar.html#aa64db66377f7420f39162295148f2582',1,'stan::gm::whitespace_grammar']]], + ['windowed_5fadaptation',['windowed_adaptation',['../classstan_1_1mcmc_1_1windowed__adaptation.html#a80584644c847ec89734ec4dd578ce6af',1,'stan::mcmc::windowed_adaptation']]], + ['wishart_5flog',['wishart_log',['../namespacestan_1_1prob.html#a10fd2efedb0954c290861d22335bd384',1,'stan::prob::wishart_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &W, const T_dof &nu, const Eigen::Matrix< T_scale, Eigen::Dynamic, Eigen::Dynamic > &S)'],['../namespacestan_1_1prob.html#a50a5c47de11d55fe41ce044e3298e7d6',1,'stan::prob::wishart_log(const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &W, const T_dof &nu, const Eigen::Matrix< T_scale, Eigen::Dynamic, Eigen::Dynamic > &S)']]], + ['wishart_5frng',['wishart_rng',['../namespacestan_1_1prob.html#a7b8c234f87f003d4f67545ee9eb998b5',1,'stan::prob']]], + ['write',['write',['../classstan_1_1io_1_1csv__writer.html#ac4e076bd6f52bae564b785cb868bac5a',1,'stan::io::csv_writer::write(int n)'],['../classstan_1_1io_1_1csv__writer.html#af5ad776d96e98944627f61f046cd5745',1,'stan::io::csv_writer::write(double x)'],['../classstan_1_1io_1_1csv__writer.html#abeea10d26f5a33df95941359955f6429',1,'stan::io::csv_writer::write(const Eigen::Matrix< double, R, C > &m)'],['../classstan_1_1io_1_1csv__writer.html#a756aee107218b98b5aa5d283f27e853b',1,'stan::io::csv_writer::write(const std::string &s)'],['../classstan_1_1io_1_1dump__writer.html#a7505270979a70bd19a2893f33a0ba346',1,'stan::io::dump_writer::write()']]], + ['write_5farray',['write_array',['../structstan_1_1gm_1_1write__csv__vars__visgen.html#a981030df9dd0720a86077e98a3b7c2f0',1,'stan::gm::write_csv_vars_visgen::write_array()'],['../structstan_1_1gm_1_1write__array__vars__visgen.html#a46d1925738b1d24f2a0f849165d9193c',1,'stan::gm::write_array_vars_visgen::write_array()']]], + ['write_5farray_5fvars_5fvisgen',['write_array_vars_visgen',['../structstan_1_1gm_1_1write__array__vars__visgen.html#a28c75cf8b30d7a8e7121b325c34b028c',1,'stan::gm::write_array_vars_visgen']]], + ['write_5farray_5fvisgen',['write_array_visgen',['../structstan_1_1gm_1_1write__array__visgen.html#afeb5e731732edea5c690dc4b44503557',1,'stan::gm::write_array_visgen']]], + ['write_5fbase_5fexpr_5ftype',['write_base_expr_type',['../namespacestan_1_1gm.html#a281907d01ac42b6c4c703f9285361419',1,'stan::gm']]], + ['write_5fcol_5fmajor',['write_col_major',['../classstan_1_1io_1_1csv__writer.html#ac301f64044fc4f019df0ceea3223434d',1,'stan::io::csv_writer']]], + ['write_5fcsv_5fheader_5fvisgen',['write_csv_header_visgen',['../structstan_1_1gm_1_1write__csv__header__visgen.html#a7931a3de7356bb9013a56703434f57c9',1,'stan::gm::write_csv_header_visgen']]], + ['write_5fcsv_5fvars_5fvisgen',['write_csv_vars_visgen',['../structstan_1_1gm_1_1write__csv__vars__visgen.html#aa0072ea087bb79c27ce204ef8b7d7421',1,'stan::gm::write_csv_vars_visgen']]], + ['write_5fcsv_5fvisgen',['write_csv_visgen',['../structstan_1_1gm_1_1write__csv__visgen.html#a9da769ec38611f0cd1cc785bedb35b31',1,'stan::gm::write_csv_visgen']]], + ['write_5fdims_5fvisgen',['write_dims_visgen',['../structstan_1_1gm_1_1write__dims__visgen.html#a1ab14d8dc3ff1affdc050a81590124d2',1,'stan::gm::write_dims_visgen']]], + ['write_5ferror_5fmsg',['write_error_msg',['../namespacestan_1_1gm.html#ae76346e1327805d1a7f6a28da263ec5d',1,'stan::gm']]], + ['write_5fmetric',['write_metric',['../classstan_1_1mcmc_1_1dense__e__point.html#a9a5591a32c9768f2dd6e80f92b16cf93',1,'stan::mcmc::dense_e_point::write_metric()'],['../classstan_1_1mcmc_1_1diag__e__point.html#a8002286217f14c53715bffe395b9755d',1,'stan::mcmc::diag_e_point::write_metric()'],['../classstan_1_1mcmc_1_1ps__point.html#a5bee8061481a677349a329a037afed1a',1,'stan::mcmc::ps_point::write_metric()']]], + ['write_5fmodel',['write_model',['../namespacestan_1_1gm.html#ae20aea4f2c25e3aa171c1c4740ee19d7',1,'stan::gm']]], + ['write_5fparam_5fnames_5fvisgen',['write_param_names_visgen',['../structstan_1_1gm_1_1write__param__names__visgen.html#ac4dd97f7d6688523100d412bcd7bfa59',1,'stan::gm::write_param_names_visgen']]], + ['write_5frow_5fmajor',['write_row_major',['../classstan_1_1io_1_1csv__writer.html#a52c5a9818363f72590cc1f3f2a70ab02',1,'stan::io::csv_writer']]], + ['write_5fsampler_5fparam_5fnames',['write_sampler_param_names',['../classstan_1_1mcmc_1_1base__mcmc.html#a2555bcff40b4656f370c751bfe06e9ab',1,'stan::mcmc::base_mcmc::write_sampler_param_names()'],['../classstan_1_1mcmc_1_1base__nuts.html#ae79f7f88b5156db27898504be9560a49',1,'stan::mcmc::base_nuts::write_sampler_param_names()'],['../classstan_1_1mcmc_1_1base__static__hmc.html#a08b235a3894d765791330ab7b0c5d473',1,'stan::mcmc::base_static_hmc::write_sampler_param_names()']]], + ['write_5fsampler_5fparams',['write_sampler_params',['../classstan_1_1mcmc_1_1base__mcmc.html#a4c30ef76ab8e9f78e46b1984b29c7f26',1,'stan::mcmc::base_mcmc::write_sampler_params()'],['../classstan_1_1mcmc_1_1base__nuts.html#aabe0eae0ae8241775760102c74053e6c',1,'stan::mcmc::base_nuts::write_sampler_params()'],['../classstan_1_1mcmc_1_1base__static__hmc.html#a26e2e7facb3998237644d7320c8db501',1,'stan::mcmc::base_static_hmc::write_sampler_params()']]], + ['write_5fsampler_5fstate',['write_sampler_state',['../classstan_1_1mcmc_1_1base__mcmc.html#a10f416fdcd1a9eb9aab56f63c0fda786',1,'stan::mcmc::base_mcmc::write_sampler_state()'],['../classstan_1_1mcmc_1_1base__hmc.html#a84c87e49136f89f49511bf46b2001f2b',1,'stan::mcmc::base_hmc::write_sampler_state()']]], + ['write_5fstan',['write_stan',['../namespacestan_1_1gm.html#afef5e532e54ab9d2a07c9b67dbc9f71d',1,'stan::gm']]], + ['writer',['writer',['../classstan_1_1io_1_1writer.html#a7dcb9072dd6ce295bd1c73721c339c51',1,'stan::io::writer']]] +]; diff --git a/doc/api/html/search/functions_7a.html b/doc/api/html/search/functions_7a.html new file mode 100644 index 00000000000..c1347710f0b --- /dev/null +++ b/doc/api/html/search/functions_7a.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/functions_7a.js b/doc/api/html/search/functions_7a.js new file mode 100644 index 00000000000..5e05b2b36b4 --- /dev/null +++ b/doc/api/html/search/functions_7a.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['z',['z',['../classstan_1_1mcmc_1_1base__hmc.html#a7b9f7a04975626ce6ea23a81d903b325',1,'stan::mcmc::base_hmc']]] +]; diff --git a/doc/api/html/search/functions_7e.html b/doc/api/html/search/functions_7e.html new file mode 100644 index 00000000000..fd1d3ce20d5 --- /dev/null +++ b/doc/api/html/search/functions_7e.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/functions_7e.js b/doc/api/html/search/functions_7e.js new file mode 100644 index 00000000000..4a4ba9d8a69 --- /dev/null +++ b/doc/api/html/search/functions_7e.js @@ -0,0 +1,32 @@ +var searchData= +[ + ['_7eaccumulator',['~accumulator',['../classstan_1_1math_1_1accumulator.html#a298d4088fbfdfca98d2c8e36a5ea4f1c',1,'stan::math::accumulator']]], + ['_7eadapt_5fdense_5fe_5fnuts',['~adapt_dense_e_nuts',['../classstan_1_1mcmc_1_1adapt__dense__e__nuts.html#ac74d2958a5e578cdd10e844237e36500',1,'stan::mcmc::adapt_dense_e_nuts']]], + ['_7eadapt_5fdense_5fe_5fstatic_5fhmc',['~adapt_dense_e_static_hmc',['../classstan_1_1mcmc_1_1adapt__dense__e__static__hmc.html#ae81ad6f37f41e6a587c36e9e369a425f',1,'stan::mcmc::adapt_dense_e_static_hmc']]], + ['_7eadapt_5fdiag_5fe_5fnuts',['~adapt_diag_e_nuts',['../classstan_1_1mcmc_1_1adapt__diag__e__nuts.html#a53e11fcb574220f40be06e43e7744a74',1,'stan::mcmc::adapt_diag_e_nuts']]], + ['_7eadapt_5fdiag_5fe_5fstatic_5fhmc',['~adapt_diag_e_static_hmc',['../classstan_1_1mcmc_1_1adapt__diag__e__static__hmc.html#a4f2a2e5b2046f456483ef4eed6aa7822',1,'stan::mcmc::adapt_diag_e_static_hmc']]], + ['_7eadapt_5funit_5fe_5fnuts',['~adapt_unit_e_nuts',['../classstan_1_1mcmc_1_1adapt__unit__e__nuts.html#a615794e2c10bcda9dd7f3aba29903f28',1,'stan::mcmc::adapt_unit_e_nuts']]], + ['_7eadapt_5funit_5fe_5fstatic_5fhmc',['~adapt_unit_e_static_hmc',['../classstan_1_1mcmc_1_1adapt__unit__e__static__hmc.html#a4001b78d765ab895a38b569ec915d9f6',1,'stan::mcmc::adapt_unit_e_static_hmc']]], + ['_7eargument',['~argument',['../classstan_1_1gm_1_1argument.html#a58068b14405201e7fde123047e251dc0',1,'stan::gm::argument']]], + ['_7ebase_5fhamiltonian',['~base_hamiltonian',['../classstan_1_1mcmc_1_1base__hamiltonian.html#a16a9150dc16c40c1e137ff1462f1d53f',1,'stan::mcmc::base_hamiltonian']]], + ['_7ebase_5fmcmc',['~base_mcmc',['../classstan_1_1mcmc_1_1base__mcmc.html#a7c8f525f093ac911bab10f619e7736fe',1,'stan::mcmc::base_mcmc']]], + ['_7ebase_5fnuts',['~base_nuts',['../classstan_1_1mcmc_1_1base__nuts.html#a84f3b26c2dd43965496766cdd6ba1245',1,'stan::mcmc::base_nuts']]], + ['_7ebase_5fstatic_5fhmc',['~base_static_hmc',['../classstan_1_1mcmc_1_1base__static__hmc.html#aab5a4f0ef94b01b624262a2484d7047b',1,'stan::mcmc::base_static_hmc']]], + ['_7ecategorical_5fargument',['~categorical_argument',['../classstan_1_1gm_1_1categorical__argument.html#ae72c69a4cbf867643694227c006c53a4',1,'stan::gm::categorical_argument']]], + ['_7echainable',['~chainable',['../classstan_1_1agrad_1_1chainable.html#a962b7191aa156e1f1714ba4750971636',1,'stan::agrad::chainable']]], + ['_7echainable_5falloc',['~chainable_alloc',['../classstan_1_1agrad_1_1chainable__alloc.html#acc8ec0b3e4b6c1ef9c4f6bb03fd57eca',1,'stan::agrad::chainable_alloc']]], + ['_7echunk_5falloc',['~chunk_alloc',['../classstan_1_1memory_1_1chunk__alloc.html#aa69ee56e6bd33c0beffbe798c2bf81e1',1,'stan::memory::chunk_alloc']]], + ['_7edense_5fe_5fmetric',['~dense_e_metric',['../classstan_1_1mcmc_1_1dense__e__metric.html#ab8327239e30c1ac20c624f2d0d2a22dc',1,'stan::mcmc::dense_e_metric']]], + ['_7ediag_5fe_5fmetric',['~diag_e_metric',['../classstan_1_1mcmc_1_1diag__e__metric.html#a64127ae540bb5ad55b871a94e0684236',1,'stan::mcmc::diag_e_metric']]], + ['_7edump_5freader',['~dump_reader',['../classstan_1_1io_1_1dump__reader.html#aff43241b7509e1877e4bca83e292fff1',1,'stan::io::dump_reader']]], + ['_7edump_5fwriter',['~dump_writer',['../classstan_1_1io_1_1dump__writer.html#a69f9822358de693b3de8acf4e8dbae1b',1,'stan::io::dump_writer']]], + ['_7elist_5fargument',['~list_argument',['../classstan_1_1gm_1_1list__argument.html#a21e0538351cb27f121f7307111bb9998',1,'stan::gm::list_argument']]], + ['_7eprob_5fgrad',['~prob_grad',['../classstan_1_1model_1_1prob__grad.html#aa81011f24dd20466efdf2971ae0df2da',1,'stan::model::prob_grad']]], + ['_7ereader',['~reader',['../classstan_1_1io_1_1reader.html#a679801e4a7936f90c13e9a6498745314',1,'stan::io::reader']]], + ['_7esample',['~sample',['../classstan_1_1mcmc_1_1sample.html#a20ad72aee8c1982a32277a374401f6db',1,'stan::mcmc::sample']]], + ['_7estack_5falloc',['~stack_alloc',['../classstan_1_1memory_1_1stack__alloc.html#a9031a182931d5cd7f11e0bfa8357c6bf',1,'stan::memory::stack_alloc']]], + ['_7estan_5fcsv_5freader',['~stan_csv_reader',['../classstan_1_1io_1_1stan__csv__reader.html#a53321a2f3045ed4cec11c77413f18759',1,'stan::io::stan_csv_reader']]], + ['_7eunit_5fe_5fmetric',['~unit_e_metric',['../classstan_1_1mcmc_1_1unit__e__metric.html#aa895987fa4375871ea9c523455bcf090',1,'stan::mcmc::unit_e_metric']]], + ['_7evari',['~vari',['../classstan_1_1agrad_1_1vari.html#aa95acf2a60125ef1083a0b929cf39adb',1,'stan::agrad::vari']]], + ['_7ewriter',['~writer',['../classstan_1_1io_1_1writer.html#aab627c99226cf0e3dd237512f673c8e5',1,'stan::io::writer']]] +]; diff --git a/doc/api/html/search/mag_sel.png b/doc/api/html/search/mag_sel.png new file mode 100644 index 0000000000000000000000000000000000000000..81f6040a2092402b4d98f9ffa8855d12a0d4ca17 GIT binary patch literal 563 zcmV-30?hr1P)zxx&tqG15pu7)IiiXFflOc2k;dXd>%13GZAy? zRz!q0=|E6a6vV)&ZBS~G9oe0kbqyw1*gvY`{Pop2oKq#FlzgXt@Xh-7fxh>}`Fxg> z$%N%{$!4=5nM{(;=c!aG1Ofr^Do{u%Ih{^&Fc@H2)+a-?TBXrw5DW&z%Nb6mQ!L9O zl}b@6mB?f=tX3;#vl)}ggh(Vpyh(IK z(Mb0D{l{U$FsRjP;!{($+bsaaVi8T#1c0V#qEIOCYa9@UVLV`f__E81L;?WEaRA;Y zUH;rZ;vb;mk7JX|$=i3O~&If0O@oZfLg8gfIjW=dcBsz;gI=!{-r4# z4%6v$&~;q^j7Fo67yJ(NJWuX+I~I!tj^nW3?}^9bq|<3^+vapS5sgM^x7!cs(+mMT z&y%j};&~po+YO)3hoUH4E*E;e9>?R6SS&`X)p`njycAVcg{rEb41T{~Hk(bl-7eSb zmFxA2uIqo#@R?lKm50ND`~6Nfn|-b1|L6O98vt3Tx@gKz#isxO002ovPDHLkV1kyW B_l^Jn literal 0 HcmV?d00001 diff --git a/doc/api/html/search/namespaces_62.html b/doc/api/html/search/namespaces_62.html new file mode 100644 index 00000000000..6caccc17249 --- /dev/null +++ b/doc/api/html/search/namespaces_62.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/namespaces_62.js b/doc/api/html/search/namespaces_62.js new file mode 100644 index 00000000000..65285fe078e --- /dev/null +++ b/doc/api/html/search/namespaces_62.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['boost',['boost',['../namespaceboost.html',1,'']]], + ['math',['math',['../namespaceboost_1_1math.html',1,'boost']]] +]; diff --git a/doc/api/html/search/namespaces_65.html b/doc/api/html/search/namespaces_65.html new file mode 100644 index 00000000000..e646ede3183 --- /dev/null +++ b/doc/api/html/search/namespaces_65.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/namespaces_65.js b/doc/api/html/search/namespaces_65.js new file mode 100644 index 00000000000..5e56472a9b9 --- /dev/null +++ b/doc/api/html/search/namespaces_65.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['eigen',['Eigen',['../namespace_eigen.html',1,'']]], + ['internal',['internal',['../namespace_eigen_1_1internal.html',1,'Eigen']]] +]; diff --git a/doc/api/html/search/namespaces_73.html b/doc/api/html/search/namespaces_73.html new file mode 100644 index 00000000000..5ebf8e4abd1 --- /dev/null +++ b/doc/api/html/search/namespaces_73.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/namespaces_73.js b/doc/api/html/search/namespaces_73.js new file mode 100644 index 00000000000..a5b37295b21 --- /dev/null +++ b/doc/api/html/search/namespaces_73.js @@ -0,0 +1,16 @@ +var searchData= +[ + ['agrad',['agrad',['../namespacestan_1_1agrad.html',1,'stan']]], + ['detail',['detail',['../namespacestan_1_1math_1_1policies_1_1detail.html',1,'stan::math::policies']]], + ['gm',['gm',['../namespacestan_1_1gm.html',1,'stan']]], + ['io',['io',['../namespacestan_1_1io.html',1,'stan']]], + ['math',['math',['../namespacestan_1_1math.html',1,'stan']]], + ['mcmc',['mcmc',['../namespacestan_1_1mcmc.html',1,'stan']]], + ['memory',['memory',['../namespacestan_1_1memory.html',1,'stan']]], + ['model',['model',['../namespacestan_1_1model.html',1,'stan']]], + ['optimization',['optimization',['../namespacestan_1_1optimization.html',1,'stan']]], + ['policies',['policies',['../namespacestan_1_1math_1_1policies.html',1,'stan::math']]], + ['prob',['prob',['../namespacestan_1_1prob.html',1,'stan']]], + ['stan',['stan',['../namespacestan.html',1,'']]], + ['std',['std',['../namespacestd.html',1,'']]] +]; diff --git a/doc/api/html/search/nomatches.html b/doc/api/html/search/nomatches.html new file mode 100644 index 00000000000..b1ded27e9ad --- /dev/null +++ b/doc/api/html/search/nomatches.html @@ -0,0 +1,12 @@ + + + + + + + +
+
No Matches
+
+ + diff --git a/doc/api/html/search/pages_65.html b/doc/api/html/search/pages_65.html new file mode 100644 index 00000000000..e6b363ac165 --- /dev/null +++ b/doc/api/html/search/pages_65.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/pages_65.js b/doc/api/html/search/pages_65.js new file mode 100644 index 00000000000..ca8bf3b0483 --- /dev/null +++ b/doc/api/html/search/pages_65.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['error_20handling_20policies',['Error Handling Policies',['../policy_page.html',1,'']]] +]; diff --git a/doc/api/html/search/related_6f.html b/doc/api/html/search/related_6f.html new file mode 100644 index 00000000000..22c66d86ba1 --- /dev/null +++ b/doc/api/html/search/related_6f.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/related_6f.js b/doc/api/html/search/related_6f.js new file mode 100644 index 00000000000..ea3f6f83ef5 --- /dev/null +++ b/doc/api/html/search/related_6f.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['operator_3c_3c',['operator<<',['../classstan_1_1agrad_1_1var.html#a3545860122fa159c57e23dd0fbfbf5cd',1,'stan::agrad::var::operator<<()'],['../classstan_1_1agrad_1_1vari.html#abd24d4e4eb6b0c65c8447bd2cc73b200',1,'stan::agrad::vari::operator<<()']]] +]; diff --git a/doc/api/html/search/related_76.html b/doc/api/html/search/related_76.html new file mode 100644 index 00000000000..7460bc68b31 --- /dev/null +++ b/doc/api/html/search/related_76.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/related_76.js b/doc/api/html/search/related_76.js new file mode 100644 index 00000000000..40cb30a4179 --- /dev/null +++ b/doc/api/html/search/related_76.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['var',['var',['../classstan_1_1agrad_1_1vari.html#a335628f2e9085305224b4f9cc6e95ed5',1,'stan::agrad::vari']]] +]; diff --git a/doc/api/html/search/search.css b/doc/api/html/search/search.css new file mode 100644 index 00000000000..d18c1da8c0d --- /dev/null +++ b/doc/api/html/search/search.css @@ -0,0 +1,238 @@ +/*---------------- Search Box */ + +#FSearchBox { + float: left; +} + +#MSearchBox { + white-space : nowrap; + position: absolute; + float: none; + display: inline; + margin-top: 8px; + right: 0px; + width: 170px; + z-index: 102; + background-color: white; +} + +#MSearchBox .left +{ + display:block; + position:absolute; + left:10px; + width:20px; + height:19px; + background:url('search_l.png') no-repeat; + background-position:right; +} + +#MSearchSelect { + display:block; + position:absolute; + width:20px; + height:19px; +} + +.left #MSearchSelect { + left:4px; +} + +.right #MSearchSelect { + right:5px; +} + +#MSearchField { + display:block; + position:absolute; + height:19px; + background:url('search_m.png') repeat-x; + border:none; + width:116px; + margin-left:20px; + padding-left:4px; + color: #909090; + outline: none; + font: 9pt Arial, Verdana, sans-serif; +} + +#FSearchBox #MSearchField { + margin-left:15px; +} + +#MSearchBox .right { + display:block; + position:absolute; + right:10px; + top:0px; + width:20px; + height:19px; + background:url('search_r.png') no-repeat; + background-position:left; +} + +#MSearchClose { + display: none; + position: absolute; + top: 4px; + background : none; + border: none; + margin: 0px 4px 0px 0px; + padding: 0px 0px; + outline: none; +} + +.left #MSearchClose { + left: 6px; +} + +.right #MSearchClose { + right: 2px; +} + +.MSearchBoxActive #MSearchField { + color: #000000; +} + +/*---------------- Search filter selection */ + +#MSearchSelectWindow { + display: none; + position: absolute; + left: 0; top: 0; + border: 1px solid #90A5CE; + background-color: #F9FAFC; + z-index: 1; + padding-top: 4px; + padding-bottom: 4px; + -moz-border-radius: 4px; + -webkit-border-top-left-radius: 4px; + -webkit-border-top-right-radius: 4px; + -webkit-border-bottom-left-radius: 4px; + -webkit-border-bottom-right-radius: 4px; + -webkit-box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); +} + +.SelectItem { + font: 8pt Arial, Verdana, sans-serif; + padding-left: 2px; + padding-right: 12px; + border: 0px; +} + +span.SelectionMark { + margin-right: 4px; + font-family: monospace; + outline-style: none; + text-decoration: none; +} + +a.SelectItem { + display: block; + outline-style: none; + color: #000000; + text-decoration: none; + padding-left: 6px; + padding-right: 12px; +} + +a.SelectItem:focus, +a.SelectItem:active { + color: #000000; + outline-style: none; + text-decoration: none; +} + +a.SelectItem:hover { + color: #FFFFFF; + background-color: #3D578C; + outline-style: none; + text-decoration: none; + cursor: pointer; + display: block; +} + +/*---------------- Search results window */ + +iframe#MSearchResults { + width: 60ex; + height: 15em; +} + +#MSearchResultsWindow { + display: none; + position: absolute; + left: 0; top: 0; + border: 1px solid #000; + background-color: #EEF1F7; +} + +/* ----------------------------------- */ + + +#SRIndex { + clear:both; + padding-bottom: 15px; +} + +.SREntry { + font-size: 10pt; + padding-left: 1ex; +} + +.SRPage .SREntry { + font-size: 8pt; + padding: 1px 5px; +} + +body.SRPage { + margin: 5px 2px; +} + +.SRChildren { + padding-left: 3ex; padding-bottom: .5em +} + +.SRPage .SRChildren { + display: none; +} + +.SRSymbol { + font-weight: bold; + color: #425E97; + font-family: Arial, Verdana, sans-serif; + text-decoration: none; + outline: none; +} + +a.SRScope { + display: block; + color: #425E97; + font-family: Arial, Verdana, sans-serif; + text-decoration: none; + outline: none; +} + +a.SRSymbol:focus, a.SRSymbol:active, +a.SRScope:focus, a.SRScope:active { + text-decoration: underline; +} + +span.SRScope { + padding-left: 4px; +} + +.SRPage .SRStatus { + padding: 2px 5px; + font-size: 8pt; + font-style: italic; +} + +.SRResult { + display: none; +} + +DIV.searchresults { + margin-left: 10px; + margin-right: 10px; +} diff --git a/doc/api/html/search/search.js b/doc/api/html/search/search.js new file mode 100644 index 00000000000..f25fa27be64 --- /dev/null +++ b/doc/api/html/search/search.js @@ -0,0 +1,815 @@ +// Search script generated by doxygen +// Copyright (C) 2009 by Dimitri van Heesch. + +// The code in this file is loosly based on main.js, part of Natural Docs, +// which is Copyright (C) 2003-2008 Greg Valure +// Natural Docs is licensed under the GPL. + +var indexSectionsWithContent = +{ + 0: "0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000010111111111111111111111111010001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", + 1: "0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000111111101001111101111110000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", + 2: "0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000010010000000000000100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", + 3: "0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000111111111101111111111110000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", + 4: "0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000010111111111111111111111110010001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", + 5: "0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000010111111111011111111111111000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", + 6: "0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000110011011001110101111100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", + 7: "0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000101100011001111001101100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", + 8: "0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001000000100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", + 9: "0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000010000110000001000000001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", + 10: "0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000010000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000" +}; + +var indexSectionNames = +{ + 0: "all", + 1: "classes", + 2: "namespaces", + 3: "files", + 4: "functions", + 5: "variables", + 6: "typedefs", + 7: "enumvalues", + 8: "related", + 9: "defines", + 10: "pages" +}; + +function convertToId(search) +{ + var result = ''; + for (i=0;i do a search + { + this.Search(); + } + } + + this.OnSearchSelectKey = function(evt) + { + var e = (evt) ? evt : window.event; // for IE + if (e.keyCode==40 && this.searchIndex0) // Up + { + this.searchIndex--; + this.OnSelectItem(this.searchIndex); + } + else if (e.keyCode==13 || e.keyCode==27) + { + this.OnSelectItem(this.searchIndex); + this.CloseSelectionWindow(); + this.DOMSearchField().focus(); + } + return false; + } + + // --------- Actions + + // Closes the results window. + this.CloseResultsWindow = function() + { + this.DOMPopupSearchResultsWindow().style.display = 'none'; + this.DOMSearchClose().style.display = 'none'; + this.Activate(false); + } + + this.CloseSelectionWindow = function() + { + this.DOMSearchSelectWindow().style.display = 'none'; + } + + // Performs a search. + this.Search = function() + { + this.keyTimeout = 0; + + // strip leading whitespace + var searchValue = this.DOMSearchField().value.replace(/^ +/, ""); + + var code = searchValue.toLowerCase().charCodeAt(0); + var hexCode; + if (code<16) + { + hexCode="0"+code.toString(16); + } + else + { + hexCode=code.toString(16); + } + + var resultsPage; + var resultsPageWithSearch; + var hasResultsPage; + + if (indexSectionsWithContent[this.searchIndex].charAt(code) == '1') + { + resultsPage = this.resultsPath + '/' + indexSectionNames[this.searchIndex] + '_' + hexCode + '.html'; + resultsPageWithSearch = resultsPage+'?'+escape(searchValue); + hasResultsPage = true; + } + else // nothing available for this search term + { + resultsPage = this.resultsPath + '/nomatches.html'; + resultsPageWithSearch = resultsPage; + hasResultsPage = false; + } + + window.frames.MSearchResults.location = resultsPageWithSearch; + var domPopupSearchResultsWindow = this.DOMPopupSearchResultsWindow(); + + if (domPopupSearchResultsWindow.style.display!='block') + { + var domSearchBox = this.DOMSearchBox(); + this.DOMSearchClose().style.display = 'inline'; + if (this.insideFrame) + { + var domPopupSearchResults = this.DOMPopupSearchResults(); + domPopupSearchResultsWindow.style.position = 'relative'; + domPopupSearchResultsWindow.style.display = 'block'; + var width = document.body.clientWidth - 8; // the -8 is for IE :-( + domPopupSearchResultsWindow.style.width = width + 'px'; + domPopupSearchResults.style.width = width + 'px'; + } + else + { + var domPopupSearchResults = this.DOMPopupSearchResults(); + var left = getXPos(domSearchBox) + 150; // domSearchBox.offsetWidth; + var top = getYPos(domSearchBox) + 20; // domSearchBox.offsetHeight + 1; + domPopupSearchResultsWindow.style.display = 'block'; + left -= domPopupSearchResults.offsetWidth; + domPopupSearchResultsWindow.style.top = top + 'px'; + domPopupSearchResultsWindow.style.left = left + 'px'; + } + } + + this.lastSearchValue = searchValue; + this.lastResultsPage = resultsPage; + } + + // -------- Activation Functions + + // Activates or deactivates the search panel, resetting things to + // their default values if necessary. + this.Activate = function(isActive) + { + if (isActive || // open it + this.DOMPopupSearchResultsWindow().style.display == 'block' + ) + { + this.DOMSearchBox().className = 'MSearchBoxActive'; + + var searchField = this.DOMSearchField(); + + if (searchField.value == this.searchLabel) // clear "Search" term upon entry + { + searchField.value = ''; + this.searchActive = true; + } + } + else if (!isActive) // directly remove the panel + { + this.DOMSearchBox().className = 'MSearchBoxInactive'; + this.DOMSearchField().value = this.searchLabel; + this.searchActive = false; + this.lastSearchValue = '' + this.lastResultsPage = ''; + } + } +} + +// ----------------------------------------------------------------------- + +// The class that handles everything on the search results page. +function SearchResults(name) +{ + // The number of matches from the last run of . + this.lastMatchCount = 0; + this.lastKey = 0; + this.repeatOn = false; + + // Toggles the visibility of the passed element ID. + this.FindChildElement = function(id) + { + var parentElement = document.getElementById(id); + var element = parentElement.firstChild; + + while (element && element!=parentElement) + { + if (element.nodeName == 'DIV' && element.className == 'SRChildren') + { + return element; + } + + if (element.nodeName == 'DIV' && element.hasChildNodes()) + { + element = element.firstChild; + } + else if (element.nextSibling) + { + element = element.nextSibling; + } + else + { + do + { + element = element.parentNode; + } + while (element && element!=parentElement && !element.nextSibling); + + if (element && element!=parentElement) + { + element = element.nextSibling; + } + } + } + } + + this.Toggle = function(id) + { + var element = this.FindChildElement(id); + if (element) + { + if (element.style.display == 'block') + { + element.style.display = 'none'; + } + else + { + element.style.display = 'block'; + } + } + } + + // Searches for the passed string. If there is no parameter, + // it takes it from the URL query. + // + // Always returns true, since other documents may try to call it + // and that may or may not be possible. + this.Search = function(search) + { + if (!search) // get search word from URL + { + search = window.location.search; + search = search.substring(1); // Remove the leading '?' + search = unescape(search); + } + + search = search.replace(/^ +/, ""); // strip leading spaces + search = search.replace(/ +$/, ""); // strip trailing spaces + search = search.toLowerCase(); + search = convertToId(search); + + var resultRows = document.getElementsByTagName("div"); + var matches = 0; + + var i = 0; + while (i < resultRows.length) + { + var row = resultRows.item(i); + if (row.className == "SRResult") + { + var rowMatchName = row.id.toLowerCase(); + rowMatchName = rowMatchName.replace(/^sr\d*_/, ''); // strip 'sr123_' + + if (search.length<=rowMatchName.length && + rowMatchName.substr(0, search.length)==search) + { + row.style.display = 'block'; + matches++; + } + else + { + row.style.display = 'none'; + } + } + i++; + } + document.getElementById("Searching").style.display='none'; + if (matches == 0) // no results + { + document.getElementById("NoMatches").style.display='block'; + } + else // at least one result + { + document.getElementById("NoMatches").style.display='none'; + } + this.lastMatchCount = matches; + return true; + } + + // return the first item with index index or higher that is visible + this.NavNext = function(index) + { + var focusItem; + while (1) + { + var focusName = 'Item'+index; + focusItem = document.getElementById(focusName); + if (focusItem && focusItem.parentNode.parentNode.style.display=='block') + { + break; + } + else if (!focusItem) // last element + { + break; + } + focusItem=null; + index++; + } + return focusItem; + } + + this.NavPrev = function(index) + { + var focusItem; + while (1) + { + var focusName = 'Item'+index; + focusItem = document.getElementById(focusName); + if (focusItem && focusItem.parentNode.parentNode.style.display=='block') + { + break; + } + else if (!focusItem) // last element + { + break; + } + focusItem=null; + index--; + } + return focusItem; + } + + this.ProcessKeys = function(e) + { + if (e.type == "keydown") + { + this.repeatOn = false; + this.lastKey = e.keyCode; + } + else if (e.type == "keypress") + { + if (!this.repeatOn) + { + if (this.lastKey) this.repeatOn = true; + return false; // ignore first keypress after keydown + } + } + else if (e.type == "keyup") + { + this.lastKey = 0; + this.repeatOn = false; + } + return this.lastKey!=0; + } + + this.Nav = function(evt,itemIndex) + { + var e = (evt) ? evt : window.event; // for IE + if (e.keyCode==13) return true; + if (!this.ProcessKeys(e)) return false; + + if (this.lastKey==38) // Up + { + var newIndex = itemIndex-1; + var focusItem = this.NavPrev(newIndex); + if (focusItem) + { + var child = this.FindChildElement(focusItem.parentNode.parentNode.id); + if (child && child.style.display == 'block') // children visible + { + var n=0; + var tmpElem; + while (1) // search for last child + { + tmpElem = document.getElementById('Item'+newIndex+'_c'+n); + if (tmpElem) + { + focusItem = tmpElem; + } + else // found it! + { + break; + } + n++; + } + } + } + if (focusItem) + { + focusItem.focus(); + } + else // return focus to search field + { + parent.document.getElementById("MSearchField").focus(); + } + } + else if (this.lastKey==40) // Down + { + var newIndex = itemIndex+1; + var focusItem; + var item = document.getElementById('Item'+itemIndex); + var elem = this.FindChildElement(item.parentNode.parentNode.id); + if (elem && elem.style.display == 'block') // children visible + { + focusItem = document.getElementById('Item'+itemIndex+'_c0'); + } + if (!focusItem) focusItem = this.NavNext(newIndex); + if (focusItem) focusItem.focus(); + } + else if (this.lastKey==39) // Right + { + var item = document.getElementById('Item'+itemIndex); + var elem = this.FindChildElement(item.parentNode.parentNode.id); + if (elem) elem.style.display = 'block'; + } + else if (this.lastKey==37) // Left + { + var item = document.getElementById('Item'+itemIndex); + var elem = this.FindChildElement(item.parentNode.parentNode.id); + if (elem) elem.style.display = 'none'; + } + else if (this.lastKey==27) // Escape + { + parent.searchBox.CloseResultsWindow(); + parent.document.getElementById("MSearchField").focus(); + } + else if (this.lastKey==13) // Enter + { + return true; + } + return false; + } + + this.NavChild = function(evt,itemIndex,childIndex) + { + var e = (evt) ? evt : window.event; // for IE + if (e.keyCode==13) return true; + if (!this.ProcessKeys(e)) return false; + + if (this.lastKey==38) // Up + { + if (childIndex>0) + { + var newIndex = childIndex-1; + document.getElementById('Item'+itemIndex+'_c'+newIndex).focus(); + } + else // already at first child, jump to parent + { + document.getElementById('Item'+itemIndex).focus(); + } + } + else if (this.lastKey==40) // Down + { + var newIndex = childIndex+1; + var elem = document.getElementById('Item'+itemIndex+'_c'+newIndex); + if (!elem) // last child, jump to parent next parent + { + elem = this.NavNext(itemIndex+1); + } + if (elem) + { + elem.focus(); + } + } + else if (this.lastKey==27) // Escape + { + parent.searchBox.CloseResultsWindow(); + parent.document.getElementById("MSearchField").focus(); + } + else if (this.lastKey==13) // Enter + { + return true; + } + return false; + } +} + +function setKeyActions(elem,action) +{ + elem.setAttribute('onkeydown',action); + elem.setAttribute('onkeypress',action); + elem.setAttribute('onkeyup',action); +} + +function setClassAttr(elem,attr) +{ + elem.setAttribute('class',attr); + elem.setAttribute('className',attr); +} + +function createResults() +{ + var results = document.getElementById("SRResults"); + for (var e=0; ek7RCwB~R6VQOP#AvB$vH7i{6H{96zot$7cZT<7246EF5Np6N}+$IbiG6W zg#87A+NFaX+=_^xM1#gCtshC=E{%9^uQX_%?YwXvo{#q&MnpJ8uh(O?ZRc&~_1%^SsPxG@rfElJg-?U zm!Cz-IOn(qJP3kDp-^~qt+FGbl=5jNli^Wj_xIBG{Rc0en{!oFvyoNC7{V~T8}b>| z=jL2WIReZzX(YN(_9fV;BBD$VXQIxNasAL8ATvEu822WQ%mvv4FO#qs` BFGc_W literal 0 HcmV?d00001 diff --git a/doc/api/html/search/search_r.png b/doc/api/html/search/search_r.png new file mode 100644 index 0000000000000000000000000000000000000000..97ee8b439687084201b79c6f776a41f495c6392a GIT binary patch literal 612 zcmV-q0-ODbP)PbXFRCwB?)W514K@j&X?z2*SxFI6-@HT2E2K=9X9%Pb zEK*!TBw&g(DMC;|A)uGlRkOS9vd-?zNs%bR4d$w+ox_iFnE8fvIvv7^5<(>Te12Li z7C)9srCzmK{ZcNM{YIl9j{DePFgOWiS%xG@5CnnnJa4nvY<^glbz7^|-ZY!dUkAwd z{gaTC@_>b5h~;ug#R0wRL0>o5!hxm*s0VW?8dr}O#zXTRTnrQm_Z7z1Mrnx>&p zD4qifUjzLvbVVWi?l?rUzwt^sdb~d!f_LEhsRVIXZtQ=qSxuxqm zEX#tf>$?M_Y1-LSDT)HqG?`%-%ZpY!#{N!rcNIiL;G7F0`l?)mNGTD9;f9F5Up3Kg zw}a<-JylhG&;=!>B+fZaCX+?C+kHYrP%c?X2!Zu_olK|GcS4A70HEy;vn)I0>0kLH z`jc(WIaaHc7!HS@f*^R^Znx8W=_jIl2oWJoQ*h1^$FX!>*PqR1J8k|fw}w_y}TpE>7m8DqDO<3z`OzXt$ccSejbEZCg@0000 + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/typedefs_61.js b/doc/api/html/search/typedefs_61.js new file mode 100644 index 00000000000..ca98ab8c2f5 --- /dev/null +++ b/doc/api/html/search/typedefs_61.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['array_5fvec_5ft',['array_vec_t',['../classstan_1_1io_1_1writer.html#a897e6e5d45368b1c69a5f773f71f03e7',1,'stan::io::writer']]] +]; diff --git a/doc/api/html/search/typedefs_62.html b/doc/api/html/search/typedefs_62.html new file mode 100644 index 00000000000..249aca42540 --- /dev/null +++ b/doc/api/html/search/typedefs_62.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/typedefs_62.js b/doc/api/html/search/typedefs_62.js new file mode 100644 index 00000000000..e045d409f66 --- /dev/null +++ b/doc/api/html/search/typedefs_62.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['base_5fexpr_5ftype',['base_expr_type',['../namespacestan_1_1gm.html#acf4d6f01fec7bb88dc578ad058392b78',1,'stan::gm']]], + ['base_5fiterator_5ft',['base_iterator_t',['../namespacestan_1_1gm.html#a48761b304b8039f53b3a6fc76e4efc87',1,'stan::gm']]], + ['bool_5fargument',['bool_argument',['../namespacestan_1_1gm.html#adb787df02fb46fca9c39b4d8f2438a28',1,'stan::gm']]] +]; diff --git a/doc/api/html/search/typedefs_65.html b/doc/api/html/search/typedefs_65.html new file mode 100644 index 00000000000..8511baf9b12 --- /dev/null +++ b/doc/api/html/search/typedefs_65.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/typedefs_65.js b/doc/api/html/search/typedefs_65.js new file mode 100644 index 00000000000..52986f9e695 --- /dev/null +++ b/doc/api/html/search/typedefs_65.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['expression_5ft',['expression_t',['../structstan_1_1gm_1_1expression.html#abae5cb68846d118c4e78e11afbaa4826',1,'stan::gm::expression']]] +]; diff --git a/doc/api/html/search/typedefs_66.html b/doc/api/html/search/typedefs_66.html new file mode 100644 index 00000000000..d0276b994dc --- /dev/null +++ b/doc/api/html/search/typedefs_66.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/typedefs_66.js b/doc/api/html/search/typedefs_66.js new file mode 100644 index 00000000000..3e18218e520 --- /dev/null +++ b/doc/api/html/search/typedefs_66.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['forward_5fiterator_5ft',['forward_iterator_t',['../namespacestan_1_1gm.html#aa1c432dd6520c6f137b092953345f7d5',1,'stan::gm']]], + ['function_5fsignature_5ft',['function_signature_t',['../namespacestan_1_1gm.html#ab969833a2ffdf92a759238a5d9ba5859',1,'stan::gm']]] +]; diff --git a/doc/api/html/search/typedefs_68.html b/doc/api/html/search/typedefs_68.html new file mode 100644 index 00000000000..75c9c6b3a35 --- /dev/null +++ b/doc/api/html/search/typedefs_68.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/typedefs_68.js b/doc/api/html/search/typedefs_68.js new file mode 100644 index 00000000000..dbcb3d72ec8 --- /dev/null +++ b/doc/api/html/search/typedefs_68.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['hessiant',['HessianT',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a80b2c5e6ef5839aa3a580a9a9a37de64',1,'stan::optimization::BFGSMinimizer']]] +]; diff --git a/doc/api/html/search/typedefs_69.html b/doc/api/html/search/typedefs_69.html new file mode 100644 index 00000000000..983811b6f57 --- /dev/null +++ b/doc/api/html/search/typedefs_69.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/typedefs_69.js b/doc/api/html/search/typedefs_69.js new file mode 100644 index 00000000000..7b9379721da --- /dev/null +++ b/doc/api/html/search/typedefs_69.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['idx_5ft',['idx_t',['../classstan_1_1optimization_1_1_b_f_g_s_line_search.html#afa2cfdf9357f5d63982f8ff00b4c6916',1,'stan::optimization::BFGSLineSearch']]], + ['int_5fargument',['int_argument',['../namespacestan_1_1gm.html#ab772327341c716a591776dda31107ee7',1,'stan::gm']]] +]; diff --git a/doc/api/html/search/typedefs_6c.html b/doc/api/html/search/typedefs_6c.html new file mode 100644 index 00000000000..67afacccf7b --- /dev/null +++ b/doc/api/html/search/typedefs_6c.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/typedefs_6c.js b/doc/api/html/search/typedefs_6c.js new file mode 100644 index 00000000000..569fbfbd8cb --- /dev/null +++ b/doc/api/html/search/typedefs_6c.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['lhsscalar',['LhsScalar',['../struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1va44da5f98e1caea9523bacbd5bdc025fe.html#a53b8b1e508aa14de16ac804960453975',1,'Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, ColMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >::LhsScalar()'],['../struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1vacd54cabc78c49ca719650381b68b105e.html#a8b1863097b547b5a7f2d24b8ccfe5796',1,'Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, RowMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >::LhsScalar()'],['../struct_eigen_1_1internal_1_1general__matrix__matrix__product_3_01_index_00_01stan_1_1agrad_1_1va9b485de9571b6e46d7a64aff43a6d9d3.html#a4b77e4f22ba05c8daaa850af323db4c5',1,'Eigen::internal::general_matrix_matrix_product< Index, stan::agrad::var, LhsStorageOrder, ConjugateLhs, stan::agrad::var, RhsStorageOrder, ConjugateRhs, ColMajor >::LhsScalar()']]] +]; diff --git a/doc/api/html/search/typedefs_6d.html b/doc/api/html/search/typedefs_6d.html new file mode 100644 index 00000000000..383ce5f1469 --- /dev/null +++ b/doc/api/html/search/typedefs_6d.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/typedefs_6d.js b/doc/api/html/search/typedefs_6d.js new file mode 100644 index 00000000000..3bdcd6b164b --- /dev/null +++ b/doc/api/html/search/typedefs_6d.js @@ -0,0 +1,13 @@ +var searchData= +[ + ['map_5fmatrix_5ft',['map_matrix_t',['../classstan_1_1io_1_1reader.html#a05f161f2ef596f356d249afbb0b43ca6',1,'stan::io::reader']]], + ['map_5frow_5fvector_5ft',['map_row_vector_t',['../classstan_1_1io_1_1reader.html#a71946c44faafcf4669f3cfde52816633',1,'stan::io::reader']]], + ['map_5fvector_5ft',['map_vector_t',['../classstan_1_1io_1_1reader.html#a1285611f704d4a3ec0d0e10ff98206d4',1,'stan::io::reader']]], + ['matrix_5fd',['matrix_d',['../namespacestan_1_1math.html#ac1a24821b475ee296830ebac12f70460',1,'stan::math::matrix_d()'],['../namespacestan_1_1optimization.html#afd985f1c123f049985ad18ad074474c4',1,'stan::optimization::matrix_d()']]], + ['matrix_5ffd',['matrix_fd',['../namespacestan_1_1agrad.html#a9568a3aa8bbf0ba6c2e96ab703e83184',1,'stan::agrad']]], + ['matrix_5fffd',['matrix_ffd',['../namespacestan_1_1agrad.html#aff56af7392587b36f7071967f87ad7d1',1,'stan::agrad']]], + ['matrix_5fffv',['matrix_ffv',['../namespacestan_1_1agrad.html#a3e6bc2f7c13dfbbb0c30dce6dcb62951',1,'stan::agrad']]], + ['matrix_5ffv',['matrix_fv',['../namespacestan_1_1agrad.html#aac5f57e2caa5ea24203633335cfe3fc6',1,'stan::agrad']]], + ['matrix_5ft',['matrix_t',['../classstan_1_1io_1_1reader.html#aded74129931435c293b0fd0885535d93',1,'stan::io::reader::matrix_t()'],['../classstan_1_1io_1_1writer.html#aadbf07fa0a161b2037f3dfbe0548f263',1,'stan::io::writer::matrix_t()']]], + ['matrix_5fv',['matrix_v',['../namespacestan_1_1agrad.html#a31a0e0ac129c0a7d965b1fb17301c942',1,'stan::agrad']]] +]; diff --git a/doc/api/html/search/typedefs_6e.html b/doc/api/html/search/typedefs_6e.html new file mode 100644 index 00000000000..ebbf394de71 --- /dev/null +++ b/doc/api/html/search/typedefs_6e.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/typedefs_6e.js b/doc/api/html/search/typedefs_6e.js new file mode 100644 index 00000000000..a4058438667 --- /dev/null +++ b/doc/api/html/search/typedefs_6e.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['nested',['Nested',['../struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html#aa313e91d6d8163393d270e3c70ad50cf',1,'Eigen::NumTraits< stan::agrad::var >']]], + ['noninteger',['NonInteger',['../struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html#a0b7008c189ffa66353158a30af2aabaf',1,'Eigen::NumTraits< stan::agrad::var >']]] +]; diff --git a/doc/api/html/search/typedefs_70.html b/doc/api/html/search/typedefs_70.html new file mode 100644 index 00000000000..77095275d87 --- /dev/null +++ b/doc/api/html/search/typedefs_70.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/typedefs_70.js b/doc/api/html/search/typedefs_70.js new file mode 100644 index 00000000000..b40f211d9a2 --- /dev/null +++ b/doc/api/html/search/typedefs_70.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['pos_5fiterator_5ft',['pos_iterator_t',['../namespacestan_1_1gm.html#aa941962f9fda48879b4d84fd518852c9',1,'stan::gm']]], + ['printable_5ft',['printable_t',['../structstan_1_1gm_1_1printable.html#a0fe5ff9b4d1c7581f75ab444b6e9828b',1,'stan::gm::printable']]] +]; diff --git a/doc/api/html/search/typedefs_72.html b/doc/api/html/search/typedefs_72.html new file mode 100644 index 00000000000..5f19d63ac69 --- /dev/null +++ b/doc/api/html/search/typedefs_72.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/typedefs_72.js b/doc/api/html/search/typedefs_72.js new file mode 100644 index 00000000000..f4df5ac90fa --- /dev/null +++ b/doc/api/html/search/typedefs_72.js @@ -0,0 +1,17 @@ +var searchData= +[ + ['range_5ft',['range_t',['../structstan_1_1gm_1_1variable__map.html#a2da97e3733b1c7695abd1eef547df69e',1,'stan::gm::variable_map']]], + ['real',['Real',['../struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html#a4c2ce540647aaade50bc0c572a4741ee',1,'Eigen::NumTraits< stan::agrad::var >']]], + ['real_5fargument',['real_argument',['../namespacestan_1_1gm.html#a2d364040dd6f2d340627acb37db9c2be',1,'stan::gm']]], + ['resscalar',['ResScalar',['../struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1va44da5f98e1caea9523bacbd5bdc025fe.html#a5eccd0cab616793b2cd6a27ec9603e53',1,'Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, ColMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >::ResScalar()'],['../struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1vacd54cabc78c49ca719650381b68b105e.html#a2a3d011e77719fbba9c50c4c98f4098e',1,'Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, RowMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >::ResScalar()'],['../struct_eigen_1_1internal_1_1general__matrix__matrix__product_3_01_index_00_01stan_1_1agrad_1_1va9b485de9571b6e46d7a64aff43a6d9d3.html#a794af3646b14e20ff11c169ecd57a64a',1,'Eigen::internal::general_matrix_matrix_product< Index, stan::agrad::var, LhsStorageOrder, ConjugateLhs, stan::agrad::var, RhsStorageOrder, ConjugateRhs, ColMajor >::ResScalar()']]], + ['result_5ftype',['result_type',['../structstan_1_1gm_1_1visgen.html#a109e318e1629afb884191005e56b040e',1,'stan::gm::visgen']]], + ['returntype',['ReturnType',['../struct_eigen_1_1internal_1_1scalar__product__traits_3_01stan_1_1agrad_1_1var_00_01double_01_4.html#a7a3a05b2596fc2bf37c31456c2f5646e',1,'Eigen::internal::scalar_product_traits< stan::agrad::var, double >::ReturnType()'],['../struct_eigen_1_1internal_1_1scalar__product__traits_3_01double_00_01stan_1_1agrad_1_1var_01_4.html#ae4eab286198b6597cf9fb9f009facfde',1,'Eigen::internal::scalar_product_traits< double, stan::agrad::var >::ReturnType()']]], + ['rhsscalar',['RhsScalar',['../struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1va44da5f98e1caea9523bacbd5bdc025fe.html#a032c6f6f307ed07b410a6d9cfc933588',1,'Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, ColMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >::RhsScalar()'],['../struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1vacd54cabc78c49ca719650381b68b105e.html#afe67acef0cc902389c761f0a3a914e73',1,'Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, RowMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >::RhsScalar()'],['../struct_eigen_1_1internal_1_1general__matrix__matrix__product_3_01_index_00_01stan_1_1agrad_1_1va9b485de9571b6e46d7a64aff43a6d9d3.html#ae39f7406453977f1c2341a05397f7024',1,'Eigen::internal::general_matrix_matrix_product< Index, stan::agrad::var, LhsStorageOrder, ConjugateLhs, stan::agrad::var, RhsStorageOrder, ConjugateRhs, ColMajor >::RhsScalar()']]], + ['row_5fvector_5fd',['row_vector_d',['../namespacestan_1_1math.html#ac105e584e4ed2d24a5c3a40df4d94697',1,'stan::math']]], + ['row_5fvector_5ffd',['row_vector_fd',['../namespacestan_1_1agrad.html#a034dc4f78e984e287123599a3b87ac97',1,'stan::agrad']]], + ['row_5fvector_5fffd',['row_vector_ffd',['../namespacestan_1_1agrad.html#a493bb030b1f2016276f58fe67662e252',1,'stan::agrad']]], + ['row_5fvector_5fffv',['row_vector_ffv',['../namespacestan_1_1agrad.html#a4a52427f4040846e15dca434ea633b7b',1,'stan::agrad']]], + ['row_5fvector_5ffv',['row_vector_fv',['../namespacestan_1_1agrad.html#a031f0408fe91a974e1cc09d61cea8807',1,'stan::agrad']]], + ['row_5fvector_5ft',['row_vector_t',['../classstan_1_1io_1_1reader.html#a9266295ff05e7617d42304c90e485b52',1,'stan::io::reader::row_vector_t()'],['../classstan_1_1io_1_1writer.html#a51abce190e367fccf3c1f8ddfa3c5170',1,'stan::io::writer::row_vector_t()']]], + ['row_5fvector_5fv',['row_vector_v',['../namespacestan_1_1agrad.html#ac3832e2dace4d1299a812cdcc53ab091',1,'stan::agrad']]] +]; diff --git a/doc/api/html/search/typedefs_73.html b/doc/api/html/search/typedefs_73.html new file mode 100644 index 00000000000..3f28c4d2629 --- /dev/null +++ b/doc/api/html/search/typedefs_73.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/typedefs_73.js b/doc/api/html/search/typedefs_73.js new file mode 100644 index 00000000000..b5015072432 --- /dev/null +++ b/doc/api/html/search/typedefs_73.js @@ -0,0 +1,8 @@ +var searchData= +[ + ['scalar',['Scalar',['../classstan_1_1agrad_1_1var.html#a9ddcf3d9523473d4c99eb4dc81c6938f',1,'stan::agrad::var::Scalar()'],['../classstan_1_1agrad_1_1var.html#a9ddcf3d9523473d4c99eb4dc81c6938f',1,'stan::agrad::var::Scalar()']]], + ['scalar_5ft',['scalar_t',['../classstan_1_1_vector_view.html#a2a17f256f923b7271b7008682995c072',1,'stan::VectorView::scalar_t()'],['../classstan_1_1_vector_view_3_01const_01_t_00_01is__array_00_01throw__if__accessed_01_4.html#ab4284d2fe6f3e884e2bc9ec7c5621372',1,'stan::VectorView< const T, is_array, throw_if_accessed >::scalar_t()']]], + ['size_5ftype',['size_type',['../classstan_1_1math_1_1_l_d_l_t__factor_3_01stan_1_1agrad_1_1var_00_01_r_00_01_c_01_4.html#ad21eca557d202a3f2f1db369f08afb89',1,'stan::math::LDLT_factor< stan::agrad::var, R, C >::size_type()'],['../classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4.html#a226a632082480f5715a8ef2979719fa1',1,'stan::math::LDLT_factor< double, R, C >::size_type()'],['../namespacestan_1_1agrad.html#aeae9e6e94d5656d748136a7c4780856e',1,'stan::agrad::size_type()'],['../namespacestan_1_1math.html#aa29284c242450c2000920599105e4eb0',1,'stan::math::size_type()']]], + ['statement_5ft',['statement_t',['../structstan_1_1gm_1_1statement.html#ab5c314341c7dd06f32786185b5689314',1,'stan::gm::statement']]], + ['string_5fargument',['string_argument',['../namespacestan_1_1gm.html#ae180adbeec14bbafaf3c7634061c614d',1,'stan::gm']]] +]; diff --git a/doc/api/html/search/typedefs_74.html b/doc/api/html/search/typedefs_74.html new file mode 100644 index 00000000000..4c98afb2e57 --- /dev/null +++ b/doc/api/html/search/typedefs_74.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/typedefs_74.js b/doc/api/html/search/typedefs_74.js new file mode 100644 index 00000000000..d22a9c7b4f9 --- /dev/null +++ b/doc/api/html/search/typedefs_74.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['type',['type',['../structstan_1_1gm_1_1validate__expr__type2_1_1result.html#acf9da899e777ac9cfb14f120a5a4e6e7',1,'stan::gm::validate_expr_type2::result::type()'],['../structstan_1_1gm_1_1set__fun__type2_1_1result.html#a797bb1fd338a65fa9377535addd51aa2',1,'stan::gm::set_fun_type2::result::type()'],['../structstan_1_1gm_1_1binary__op__expr_1_1result.html#a6613b3bbad33fe2edf7b1337ff10c4ab',1,'stan::gm::binary_op_expr::result::type()'],['../structstan_1_1gm_1_1addition__expr_1_1result.html#abbb7eba785d1bf2b37be6983c21abde2',1,'stan::gm::addition_expr::result::type()'],['../structstan_1_1gm_1_1subtraction__expr_1_1result.html#a83d53c7bf088539887e8d349745dbbd3',1,'stan::gm::subtraction_expr::result::type()'],['../structstan_1_1gm_1_1add__conditional__condition_1_1result.html#a7ae524581e60adf8ec58ff362d123b04',1,'stan::gm::add_conditional_condition::result::type()'],['../structstan_1_1gm_1_1add__conditional__body_1_1result.html#af12e1aa0082754acf1218bd767b65f97',1,'stan::gm::add_conditional_body::result::type()'],['../structstan_1_1gm_1_1validate__assignment_1_1result.html#a8ed777fd03014c406553a98a2092d597',1,'stan::gm::validate_assignment::result::type()'],['../structstan_1_1gm_1_1validate__sample_1_1result.html#ad554b4aaf143a4c535708ac7ee56a12f',1,'stan::gm::validate_sample::result::type()'],['../structstan_1_1gm_1_1expression__as__statement_1_1result.html#aa817fc2a2eab202b696d81dc5054a233',1,'stan::gm::expression_as_statement::result::type()'],['../structstan_1_1gm_1_1unscope__locals_1_1result.html#a78057309e7356062ee1abf3978fb75ad',1,'stan::gm::unscope_locals::result::type()'],['../structstan_1_1gm_1_1add__while__condition_1_1result.html#a3355eac5ec601747e940106ca5a9553c',1,'stan::gm::add_while_condition::result::type()'],['../structstan_1_1gm_1_1add__while__body_1_1result.html#a14b5d10c7fd59660a6d9070f2adb50a0',1,'stan::gm::add_while_body::result::type()'],['../structstan_1_1gm_1_1add__loop__identifier_1_1result.html#ad8cb4be555a262642d21fbca93669692',1,'stan::gm::add_loop_identifier::result::type()'],['../structstan_1_1gm_1_1remove__loop__identifier_1_1result.html#a651b017053ea891677678fd434ae2b6a',1,'stan::gm::remove_loop_identifier::result::type()'],['../structstan_1_1gm_1_1validate__int__expr2_1_1result.html#ac09fa987115620b2b268f7050ea2b53c',1,'stan::gm::validate_int_expr2::result::type()'],['../structstan_1_1gm_1_1validate__allow__sample_1_1result.html#a35e630d24e687699327b33e071c2a993',1,'stan::gm::validate_allow_sample::result::type()'],['../structstan_1_1gm_1_1set__fun__type_1_1result.html#a8a3b4372dd614aed3ed3e683a9e93cea',1,'stan::gm::set_fun_type::result::type()'],['../structstan_1_1gm_1_1set__fun__type__named_1_1result.html#af8b27e490e0b8ddeaba4c65ee5dff707',1,'stan::gm::set_fun_type_named::result::type()'],['../structstan_1_1gm_1_1multiplication__expr_1_1result.html#a0ab75c7570d913a4a3122048e092b76a',1,'stan::gm::multiplication_expr::result::type()'],['../structstan_1_1gm_1_1division__expr_1_1result.html#a18185a370c691f1eea0847551e78ed83',1,'stan::gm::division_expr::result::type()'],['../structstan_1_1gm_1_1left__division__expr_1_1result.html#ae7eade30901e506aca5bd0b4a7296595',1,'stan::gm::left_division_expr::result::type()'],['../structstan_1_1gm_1_1elt__multiplication__expr_1_1result.html#acd68e9b5d774c889c1064e1350495620',1,'stan::gm::elt_multiplication_expr::result::type()'],['../structstan_1_1gm_1_1elt__division__expr_1_1result.html#a96008a34740a7ff158716517993aa6f0',1,'stan::gm::elt_division_expr::result::type()'],['../structstan_1_1gm_1_1negate__expr_1_1result.html#ae3983d7993aa29e8d6c9b488dcde6312',1,'stan::gm::negate_expr::result::type()'],['../structstan_1_1gm_1_1logical__negate__expr_1_1result.html#a4f04e5a391864ce1cd4e295b38800aa9',1,'stan::gm::logical_negate_expr::result::type()'],['../structstan_1_1gm_1_1transpose__expr_1_1result.html#a46200139ae3022913240e7afb1e1a98f',1,'stan::gm::transpose_expr::result::type()'],['../structstan_1_1gm_1_1add__expression__dimss_1_1result.html#ac7ba6f938007515f8585e7f3edfa17fd',1,'stan::gm::add_expression_dimss::result::type()'],['../structstan_1_1gm_1_1set__var__type_1_1result.html#ab76768683b619416b7df951add24cf65',1,'stan::gm::set_var_type::result::type()'],['../structstan_1_1gm_1_1validate__int__expr3_1_1result.html#a3561c5435c7ea45b40819bb2937b792d',1,'stan::gm::validate_int_expr3::result::type()'],['../structstan_1_1gm_1_1validate__expr__type_1_1result.html#a27afcd81cf29e2a4e3cd1456a9580998',1,'stan::gm::validate_expr_type::result::type()'],['../structstan_1_1math_1_1common__type.html#aab77e3179df5479c1531afad8687a83f',1,'stan::math::common_type::type()'],['../structstan_1_1math_1_1common__type_3_01std_1_1vector_3_01_t1_01_4_00_01std_1_1vector_3_01_t2_01_4_01_4.html#a57e2603ca0216acd5592ebbd45aee70d',1,'stan::math::common_type< std::vector< T1 >, std::vector< T2 > >::type()'],['../structstan_1_1math_1_1common__type_3_01_eigen_1_1_matrix_3_01_t1_00_01_r_00_01_c_01_4_00_01_eiged8accfa00e73f240c58ad02ac582ba93.html#a233e6e69eead8714ccd05f2c49c0d56d',1,'stan::math::common_type< Eigen::Matrix< T1, R, C >, Eigen::Matrix< T2, R, C > >::type()'],['../structstan_1_1math_1_1store__type.html#a4911dad4e7692aae90f6a93466a3e88b',1,'stan::math::store_type::type()'],['../structstan_1_1math_1_1store__type_3_01double_01_4.html#a36449fc098f0ee60b5e078771f5395e8',1,'stan::math::store_type< double >::type()'],['../structstan_1_1math_1_1store__type_3_01int_01_4.html#aa10e456268690936392e9ea31e24645f',1,'stan::math::store_type< int >::type()'],['../structstan_1_1math_1_1pass__type.html#aaf902ad0b26acab6888195ed0b528ec5',1,'stan::math::pass_type::type()'],['../structstan_1_1math_1_1pass__type_3_01double_01_4.html#adee94e36436cf8e5628e961330047738',1,'stan::math::pass_type< double >::type()'],['../structstan_1_1math_1_1pass__type_3_01int_01_4.html#a6e1bfc775f016451ab261ecede07402c',1,'stan::math::pass_type< int >::type()'],['../structstan_1_1is__vector.html#a5384dc7751d6efdfd7b7bd9ccc442ca2',1,'stan::is_vector::type()'],['../structstan_1_1is__vector_3_01const_01_t_01_4.html#a438013ddac03fc30456a132b069b6db7',1,'stan::is_vector< const T >::type()'],['../structstan_1_1is__vector_3_01std_1_1vector_3_01_t_01_4_01_4.html#aefecb429647f6ad44faa02cb233050da',1,'stan::is_vector< std::vector< T > >::type()'],['../structstan_1_1is__vector_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_011_01_4_01_4.html#ab0c2ebfaeaf2d18b25665573a01dab1e',1,'stan::is_vector< Eigen::Matrix< T, Eigen::Dynamic, 1 > >::type()'],['../structstan_1_1is__vector_3_01_eigen_1_1_matrix_3_01_t_00_011_00_01_eigen_1_1_dynamic_01_4_01_4.html#a07a4e818504882fb191b9d3a5ba6677a',1,'stan::is_vector< Eigen::Matrix< T, 1, Eigen::Dynamic > >::type()'],['../structstan_1_1scalar__type.html#aa9068e42d81d7091f822df126fe932b7',1,'stan::scalar_type::type()'],['../structstan_1_1scalar__type_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4.html#a3cbf7ba7c3d16da948863b3180075b36',1,'stan::scalar_type< Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > >::type()'],['../structstan_1_1scalar__type_3_01_t_01_5_01_4.html#a38f00242ece28298968a43f30508c940',1,'stan::scalar_type< T * >::type()'],['../structstan_1_1return__type.html#af3130731cc471801ccef3bc753dd790b',1,'stan::return_type::type()']]] +]; diff --git a/doc/api/html/search/typedefs_75.html b/doc/api/html/search/typedefs_75.html new file mode 100644 index 00000000000..35bb0050f0b --- /dev/null +++ b/doc/api/html/search/typedefs_75.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/typedefs_75.js b/doc/api/html/search/typedefs_75.js new file mode 100644 index 00000000000..99c80cc96c1 --- /dev/null +++ b/doc/api/html/search/typedefs_75.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['u_5fint_5fargument',['u_int_argument',['../namespacestan_1_1gm.html#ae43d445dc26f5d0423f77c37236d3b38',1,'stan::gm']]] +]; diff --git a/doc/api/html/search/typedefs_76.html b/doc/api/html/search/typedefs_76.html new file mode 100644 index 00000000000..57eab51a2c6 --- /dev/null +++ b/doc/api/html/search/typedefs_76.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/typedefs_76.js b/doc/api/html/search/typedefs_76.js new file mode 100644 index 00000000000..c84fafaa322 --- /dev/null +++ b/doc/api/html/search/typedefs_76.js @@ -0,0 +1,13 @@ +var searchData= +[ + ['var_5fdecl_5ft',['var_decl_t',['../structstan_1_1gm_1_1var__decl.html#a053ae171df165a1fba298555456bb7ee',1,'stan::gm::var_decl']]], + ['var_5forigin',['var_origin',['../namespacestan_1_1gm.html#a37c3937aa5961352d95274c274bf0b17',1,'stan::gm']]], + ['vector_5fd',['vector_d',['../namespacestan_1_1math.html#a0c7ab54df86be3a3d61e58623c210d86',1,'stan::math::vector_d()'],['../namespacestan_1_1optimization.html#af557a7d4dc0f32c569400f2b71c76d1d',1,'stan::optimization::vector_d()']]], + ['vector_5ffd',['vector_fd',['../namespacestan_1_1agrad.html#a50e8b3ee954a699c1467801ab52be810',1,'stan::agrad']]], + ['vector_5fffd',['vector_ffd',['../namespacestan_1_1agrad.html#a97cd52b23aca617183eb7deadb1c6d9d',1,'stan::agrad']]], + ['vector_5fffv',['vector_ffv',['../namespacestan_1_1agrad.html#a96902ae4f8847b57803a5ac7e5d9754d',1,'stan::agrad']]], + ['vector_5ffv',['vector_fv',['../namespacestan_1_1agrad.html#a4ee7f0ffda84be0aec51dfd293951daf',1,'stan::agrad']]], + ['vector_5ft',['vector_t',['../classstan_1_1io_1_1reader.html#acc7ad774f8ec903caa164a9ac1e78b30',1,'stan::io::reader::vector_t()'],['../classstan_1_1io_1_1writer.html#a4f9ede8dc253f291c7a27cacd03cf542',1,'stan::io::writer::vector_t()'],['../classstan_1_1optimization_1_1_b_f_g_s_line_search.html#af45bef442ce47a3821c2c19292283ecd',1,'stan::optimization::BFGSLineSearch::vector_t()']]], + ['vector_5fv',['vector_v',['../namespacestan_1_1agrad.html#acf0241b312ef1f17733c24766df1f49f',1,'stan::agrad']]], + ['vectort',['VectorT',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#ae26c7119488745c9d70158da1bc1d2ae',1,'stan::optimization::BFGSMinimizer']]] +]; diff --git a/doc/api/html/search/variables_5f.html b/doc/api/html/search/variables_5f.html new file mode 100644 index 00000000000..375abd9bec3 --- /dev/null +++ b/doc/api/html/search/variables_5f.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/variables_5f.js b/doc/api/html/search/variables_5f.js new file mode 100644 index 00000000000..66be12a3c28 --- /dev/null +++ b/doc/api/html/search/variables_5f.js @@ -0,0 +1,92 @@ +var searchData= +[ + ['_5fadapt_5fbase_5fwindow',['_adapt_base_window',['../classstan_1_1mcmc_1_1windowed__adaptation.html#ae25e5dc1480c6e553d65e24beb964dec',1,'stan::mcmc::windowed_adaptation']]], + ['_5fadapt_5fflag',['_adapt_flag',['../classstan_1_1mcmc_1_1base__adapter.html#aef437ec008b42d9364f0165bd783a4de',1,'stan::mcmc::base_adapter']]], + ['_5fadapt_5finit_5fbuffer',['_adapt_init_buffer',['../classstan_1_1mcmc_1_1windowed__adaptation.html#a7a79530d16f82b9d8beb0961b4bb1018',1,'stan::mcmc::windowed_adaptation']]], + ['_5fadapt_5fnext_5fwindow',['_adapt_next_window',['../classstan_1_1mcmc_1_1windowed__adaptation.html#a0b3771ea39bc3fd60c43aea960b2df98',1,'stan::mcmc::windowed_adaptation']]], + ['_5fadapt_5fterm_5fbuffer',['_adapt_term_buffer',['../classstan_1_1mcmc_1_1windowed__adaptation.html#a81191d64fdfb010c997a538d479a270a',1,'stan::mcmc::windowed_adaptation']]], + ['_5fadapt_5fwindow_5fcounter',['_adapt_window_counter',['../classstan_1_1mcmc_1_1windowed__adaptation.html#ab589266e966065c3088e6b02c73ad1e3',1,'stan::mcmc::windowed_adaptation']]], + ['_5fadapt_5fwindow_5fsize',['_adapt_window_size',['../classstan_1_1mcmc_1_1windowed__adaptation.html#a9b669ff236cb187f69901064ce4835d3',1,'stan::mcmc::windowed_adaptation']]], + ['_5fadjaref',['_adjARef',['../agrad_2rev_2matrix_2determinant_8hpp.html#ac289fdc094f4376437157416320ac3bd',1,'_adjARef(): determinant.hpp'],['../agrad_2rev_2matrix_2log__determinant_8hpp.html#ac289fdc094f4376437157416320ac3bd',1,'_adjARef(): log_determinant.hpp'],['../agrad_2rev_2matrix_2log__determinant__spd_8hpp.html#ac289fdc094f4376437157416320ac3bd',1,'_adjARef(): log_determinant_spd.hpp']]], + ['_5falloc',['_alloc',['../classstan_1_1math_1_1_l_d_l_t__factor_3_01stan_1_1agrad_1_1var_00_01_r_00_01_c_01_4.html#ac161188fa80c04c2affb499c81e8b3bd',1,'stan::math::LDLT_factor< stan::agrad::var, R, C >::_alloc()'],['../agrad_2rev_2matrix_2ldlt_8hpp.html#ac8fd1d052b1749cdac48e692c69b01e4',1,'_alloc(): ldlt.hpp'],['../agrad_2rev_2matrix_2log__determinant__spd_8hpp.html#a6a66022aa2c567d6be6ecc6a4818e36d',1,'_alloc(): log_determinant_spd.hpp'],['../agrad_2rev_2matrix_2mdivide__left__spd_8hpp.html#af33a1ef9d6061ad644079483e4811d9c',1,'_alloc(): mdivide_left_spd.hpp']]], + ['_5falloc_5fldlt',['_alloc_ldlt',['../agrad_2rev_2matrix_2ldlt_8hpp.html#acb7147b3011bb4bb4d08ed4da2dd9ed6',1,'ldlt.hpp']]], + ['_5falpha',['_alpha',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#ad45ecfae1cf522aeccd74690e3ca5ab1',1,'stan::optimization::BFGSMinimizer']]], + ['_5falpha0',['_alpha0',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#ace039fd8789a6eba09a0fbc15584f003',1,'stan::optimization::BFGSMinimizer']]], + ['_5falphak_5f1',['_alphak_1',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#afc093ad16e0b1c8668463303ccc03429',1,'stan::optimization::BFGSMinimizer']]], + ['_5farguments',['_arguments',['../classstan_1_1gm_1_1argument__parser.html#a123bcf0183cb6bbe71068ff187a67e67',1,'stan::gm::argument_parser::_arguments()'],['../classstan_1_1gm_1_1argument__probe.html#a92cda768d0cd100860a9de7e3b1b6838',1,'stan::gm::argument_probe::_arguments()']]], + ['_5fbad_5fvalue',['_bad_value',['../classstan_1_1gm_1_1singleton__argument.html#a6c77999833a1f8e580fb13f76af3c4be',1,'stan::gm::singleton_argument']]], + ['_5fcols',['_cols',['../agrad_2rev_2matrix_2determinant_8hpp.html#a9c07cb6acc3ea9dc957ef6874d075e7b',1,'_cols(): determinant.hpp'],['../agrad_2rev_2matrix_2log__determinant_8hpp.html#a9c07cb6acc3ea9dc957ef6874d075e7b',1,'_cols(): log_determinant.hpp'],['../agrad_2rev_2matrix_2log__determinant__spd_8hpp.html#a9c07cb6acc3ea9dc957ef6874d075e7b',1,'_cols(): log_determinant_spd.hpp']]], + ['_5fconstrained',['_constrained',['../classstan_1_1gm_1_1singleton__argument.html#a3fb0b88831bbc32580be800e735654ef',1,'stan::gm::singleton_argument']]], + ['_5fcounter',['_counter',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#ade5951f7ef5e42f0571838b2932408ee',1,'stan::mcmc::stepsize_adaptation']]], + ['_5fcovar_5fadaptation',['_covar_adaptation',['../classstan_1_1mcmc_1_1stepsize__covar__adapter.html#a81e2e0c870bf71ae803ed7bc29e7c10d',1,'stan::mcmc::stepsize_covar_adapter']]], + ['_5fcursor',['_cursor',['../classstan_1_1gm_1_1list__argument.html#ad55e26c7c3dad56b1755e7ff48ad105a',1,'stan::gm::list_argument']]], + ['_5fdefault',['_default',['../classstan_1_1gm_1_1valued__argument.html#abca552e2f3f5a60700aef0fb4b7e2982',1,'stan::gm::valued_argument']]], + ['_5fdefault_5fcursor',['_default_cursor',['../classstan_1_1gm_1_1list__argument.html#ad83ee16d6f572997bd75a2e573ebad6b',1,'stan::gm::list_argument']]], + ['_5fdefault_5fvalue',['_default_value',['../classstan_1_1gm_1_1singleton__argument.html#a09f10b878343aa0cce9e33a5cf7f8032',1,'stan::gm::singleton_argument']]], + ['_5fdelta',['_delta',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#adceaf56188458666a1d2c9e390f03a74',1,'stan::mcmc::stepsize_adaptation']]], + ['_5fdepth',['_depth',['../classstan_1_1mcmc_1_1base__nuts.html#acb7e67dd254cab229429fcead7f18248',1,'stan::mcmc::base_nuts']]], + ['_5fdescription',['_description',['../classstan_1_1gm_1_1argument.html#aa0d6c7ba1141afefb7e78b829bc556a7',1,'stan::gm::argument']]], + ['_5fepsilon',['_epsilon',['../classstan_1_1mcmc_1_1base__hmc.html#a0d4321fe558ad0295196d79c5525a777',1,'stan::mcmc::base_hmc']]], + ['_5fepsilon_5fjitter',['_epsilon_jitter',['../classstan_1_1mcmc_1_1base__hmc.html#a1eb0217fe58fa1a2e4d0691831f062d6',1,'stan::mcmc::base_hmc']]], + ['_5ferr_5fstream',['_err_stream',['../classstan_1_1mcmc_1_1base__mcmc.html#a38c1899ffa57046d3da3ac5496ac4a8e',1,'stan::mcmc::base_mcmc::_err_stream()'],['../classstan_1_1mcmc_1_1base__hamiltonian.html#a7db84e905cea2560e6a223656594c393',1,'stan::mcmc::base_hamiltonian::_err_stream()']]], + ['_5festimator',['_estimator',['../classstan_1_1mcmc_1_1covar__adaptation.html#a58ed3f592a8a0ef46f440c9174ec439d',1,'stan::mcmc::covar_adaptation::_estimator()'],['../classstan_1_1mcmc_1_1var__adaptation.html#ac7cca0e0ab1286b812f2d890049a09e4',1,'stan::mcmc::var_adaptation::_estimator()']]], + ['_5festimator_5fname',['_estimator_name',['../classstan_1_1mcmc_1_1windowed__adaptation.html#a3a5f0f2df10b1e0e5431a97d9edc0a83',1,'stan::mcmc::windowed_adaptation']]], + ['_5ffk',['_fk',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a75288a0a0783ca985d0539f82a47a800',1,'stan::optimization::BFGSMinimizer']]], + ['_5ffk_5f1',['_fk_1',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a244de3265b928cb15d10069931641a83',1,'stan::optimization::BFGSMinimizer']]], + ['_5ffunc',['_func',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a02a192467c7706cf70db60141a3615f6',1,'stan::optimization::BFGSMinimizer']]], + ['_5fgamma',['_gamma',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#a4747f034cf8440b500e76aada963ab41',1,'stan::mcmc::stepsize_adaptation']]], + ['_5fgk',['_gk',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a8bf1d09f17e9a5665d3dcc821f153d33',1,'stan::optimization::BFGSMinimizer']]], + ['_5fgk_5f1',['_gk_1',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#aef94fd725067fd7fede3bc48a3b62c7b',1,'stan::optimization::BFGSMinimizer']]], + ['_5fgood_5fvalue',['_good_value',['../classstan_1_1gm_1_1singleton__argument.html#a69fa41809718b5093ddff19c515beeee',1,'stan::gm::singleton_argument']]], + ['_5fhamiltonian',['_hamiltonian',['../classstan_1_1mcmc_1_1base__hmc.html#a1181763cca26e4cde7db08023709bceb',1,'stan::mcmc::base_hmc']]], + ['_5fhelp_5fflag',['_help_flag',['../classstan_1_1gm_1_1argument__parser.html#a8756ce3f3d1e6a9ee3076439d5af15a7',1,'stan::gm::argument_parser']]], + ['_5fimpl',['_impl',['../agrad_2rev_2matrix_2ldlt_8hpp.html#ab89158b8e67137e7d7693f9d285e6a6b',1,'_impl(): ldlt.hpp'],['../agrad_2rev_2matrix_2quad__form_8hpp.html#aba5296c623c71f7372cb23517d7a9cfa',1,'_impl(): quad_form.hpp'],['../agrad_2rev_2matrix_2trace__gen__quad__form_8hpp.html#afd17a8260936f41e3700b767282501fa',1,'_impl(): trace_gen_quad_form.hpp'],['../agrad_2rev_2matrix_2trace__quad__form_8hpp.html#a0b5bde925768070ceaa12322cd5da836',1,'_impl(): trace_quad_form.hpp']]], + ['_5fintegrator',['_integrator',['../classstan_1_1mcmc_1_1base__hmc.html#a2f9b84971fc6b6ef1e46ff480b514240',1,'stan::mcmc::base_hmc']]], + ['_5finva',['_invA',['../agrad_2rev_2matrix_2log__determinant__spd_8hpp.html#ac62e1300d96ac0909e7fe11f8d8166ef',1,'log_determinant_spd.hpp']]], + ['_5fis_5fpresent',['_is_present',['../classstan_1_1gm_1_1unvalued__argument.html#a6b227464109b7ecf60f8a9093b92ee50',1,'stan::gm::unvalued_argument']]], + ['_5fitnum',['_itNum',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a6a7e635b790a21bf66419b240c08936f',1,'stan::optimization::BFGSMinimizer']]], + ['_5fkappa',['_kappa',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#abfa89219ff2a4b2895627b305fa9f83e',1,'stan::mcmc::stepsize_adaptation']]], + ['_5fldlt',['_ldlt',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a8b5218fc992daacb2748f6ea34a437b6',1,'stan::optimization::BFGSMinimizer::_ldlt()'],['../agrad_2rev_2matrix_2ldlt_8hpp.html#a8ff5c08d7409eec748e7d3c88ec37eda',1,'_ldlt(): ldlt.hpp']]], + ['_5fldltp',['_ldltP',['../classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4.html#aa41484403512f2b107922d0d7fc5c63d',1,'stan::math::LDLT_factor< double, R, C >::_ldltP()'],['../agrad_2rev_2matrix_2ldlt_8hpp.html#a65ac506e2dfa234b42d90ed38b481b50',1,'_ldltP(): ldlt.hpp']]], + ['_5fllt',['_llt',['../agrad_2rev_2matrix_2mdivide__left__spd_8hpp.html#a9443c5162b5e88a4425734a7c46ed32a',1,'mdivide_left_spd.hpp']]], + ['_5fm',['_m',['../classstan_1_1prob_1_1welford__covar__estimator.html#a7cb4d78c9a9496b27f719eb93c56436d',1,'stan::prob::welford_covar_estimator::_m()'],['../classstan_1_1prob_1_1welford__var__estimator.html#a97a3e57c6fd9781409f061b9f2937284',1,'stan::prob::welford_var_estimator::_m()']]], + ['_5fm2',['_m2',['../classstan_1_1prob_1_1welford__covar__estimator.html#a9ebe972e6e8ea3e680031c36f59bc3c5',1,'stan::prob::welford_covar_estimator::_m2()'],['../classstan_1_1prob_1_1welford__var__estimator.html#aa805b2a914cff1c8326b2b9037cdbcec',1,'stan::prob::welford_var_estimator::_m2()']]], + ['_5fmax_5fdelta',['_max_delta',['../classstan_1_1mcmc_1_1base__nuts.html#a32c5b1250b06867e5bfad17cb33943b7',1,'stan::mcmc::base_nuts']]], + ['_5fmax_5fdepth',['_max_depth',['../classstan_1_1mcmc_1_1base__nuts.html#aca7e01df1dadea953191cb0818e45e2f',1,'stan::mcmc::base_nuts']]], + ['_5fmethod_5fflag',['_method_flag',['../classstan_1_1gm_1_1argument__parser.html#a0d7e3677a25c3602d9491c5876cb398c',1,'stan::gm::argument_parser']]], + ['_5fmodel',['_model',['../classstan_1_1mcmc_1_1base__hamiltonian.html#a7c187e854abd5b0aca8726cbfab86a21',1,'stan::mcmc::base_hamiltonian']]], + ['_5fmu',['_mu',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#a3ba1ba74a735ae0c6826b49e7bd284df',1,'stan::mcmc::stepsize_adaptation']]], + ['_5fn_5fdivergent',['_n_divergent',['../classstan_1_1mcmc_1_1base__nuts.html#a103b33df985e433f37a56ee0626a7861',1,'stan::mcmc::base_nuts']]], + ['_5fname',['_name',['../classstan_1_1gm_1_1argument.html#a23946e8de0291c9868b0e5430ff71cf0',1,'stan::gm::argument::_name()'],['../classstan_1_1mcmc_1_1base__mcmc.html#ad2c7124c9b80002735c5db2b7aecf482',1,'stan::mcmc::base_mcmc::_name()']]], + ['_5fnom_5fepsilon',['_nom_epsilon',['../classstan_1_1mcmc_1_1base__hmc.html#a514b2e6f2d9481218709b1a16747f8a6',1,'stan::mcmc::base_hmc']]], + ['_5fnote',['_note',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a85128ba7124ddd7e9e604df71a9c71c5',1,'stan::optimization::BFGSMinimizer']]], + ['_5fnum_5fsamples',['_num_samples',['../classstan_1_1prob_1_1welford__covar__estimator.html#ac3239162bce3b35ff653b8072aa8e7e3',1,'stan::prob::welford_covar_estimator::_num_samples()'],['../classstan_1_1prob_1_1welford__var__estimator.html#a8b378660396e184e69b5cd7152f4e094',1,'stan::prob::welford_var_estimator::_num_samples()']]], + ['_5fnum_5fwarmup',['_num_warmup',['../classstan_1_1mcmc_1_1windowed__adaptation.html#a49833a6e927a0e7dec9a82d756626e16',1,'stan::mcmc::windowed_adaptation']]], + ['_5fopts',['_opts',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a2f69cfce2ab1a2004dd6687df21b565a',1,'stan::optimization::BFGSMinimizer']]], + ['_5fout_5fstream',['_out_stream',['../classstan_1_1mcmc_1_1base__mcmc.html#ab021a0550faee8630a30990d7ebf7b88',1,'stan::mcmc::base_mcmc::_out_stream()'],['../classstan_1_1mcmc_1_1base__integrator.html#a4cc219f3069be428aa6a74c01d08d333',1,'stan::mcmc::base_integrator::_out_stream()']]], + ['_5frand_5fint',['_rand_int',['../classstan_1_1mcmc_1_1base__hmc.html#a06d0bc3d17266ca80823487f6a6e1180',1,'stan::mcmc::base_hmc']]], + ['_5frand_5funiform',['_rand_uniform',['../classstan_1_1mcmc_1_1base__hmc.html#a5970ff139255992393ebd05cd8cc68f0',1,'stan::mcmc::base_hmc']]], + ['_5frows',['_rows',['../agrad_2rev_2matrix_2determinant_8hpp.html#a3e8959363f536b448785cdfdb1dd461a',1,'_rows(): determinant.hpp'],['../agrad_2rev_2matrix_2log__determinant_8hpp.html#a3e8959363f536b448785cdfdb1dd461a',1,'_rows(): log_determinant.hpp'],['../agrad_2rev_2matrix_2log__determinant__spd_8hpp.html#a3e8959363f536b448785cdfdb1dd461a',1,'_rows(): log_determinant_spd.hpp']]], + ['_5fs_5fbar',['_s_bar',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#a0a3fe27836b539b99e81b5ba3b7e36e1',1,'stan::mcmc::stepsize_adaptation']]], + ['_5fsk',['_sk',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a7cef3ef923dfd139bb8bb6990b6d47f1',1,'stan::optimization::BFGSMinimizer']]], + ['_5fsk_5f1',['_sk_1',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a972b1176a858cd4c3209c6d1629953af',1,'stan::optimization::BFGSMinimizer']]], + ['_5fstepsize_5fadaptation',['_stepsize_adaptation',['../classstan_1_1mcmc_1_1stepsize__adapter.html#a560cd9f56401167b284e7eb36e58cbec',1,'stan::mcmc::stepsize_adapter::_stepsize_adaptation()'],['../classstan_1_1mcmc_1_1stepsize__covar__adapter.html#a50045d3383df82e4c3dda971ed0ddf38',1,'stan::mcmc::stepsize_covar_adapter::_stepsize_adaptation()'],['../classstan_1_1mcmc_1_1stepsize__var__adapter.html#aed1abeb55985ad65b435e7a7ced9d4d5',1,'stan::mcmc::stepsize_var_adapter::_stepsize_adaptation()']]], + ['_5fsubarguments',['_subarguments',['../classstan_1_1gm_1_1categorical__argument.html#ae906b6761d356c568023f68020647240',1,'stan::gm::categorical_argument']]], + ['_5fsym',['_sym',['../agrad_2rev_2matrix_2quad__form_8hpp.html#a0f0c3a82aa9cb1ecd7d97fce67fea63d',1,'quad_form.hpp']]], + ['_5ft0',['_t0',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#a9343ca729fb8566cde5b102d391d7003',1,'stan::mcmc::stepsize_adaptation']]], + ['_5fvalidity',['_validity',['../classstan_1_1gm_1_1singleton__argument.html#a74d2460a6fd7de8d3d05b191856f5468',1,'stan::gm::singleton_argument']]], + ['_5fvalue',['_value',['../classstan_1_1gm_1_1singleton__argument.html#a841db6c125379f5a359f3049f532f53b',1,'stan::gm::singleton_argument::_value()'],['../agrad_2rev_2matrix_2ldlt_8hpp.html#a3e78e92b9e102f837e1433ff78edd53c',1,'_value(): ldlt.hpp']]], + ['_5fvalue_5ftype',['_value_type',['../classstan_1_1gm_1_1valued__argument.html#a8a47f35a2b7426e96bbed0739714b767',1,'stan::gm::valued_argument']]], + ['_5fvalues',['_values',['../classstan_1_1gm_1_1list__argument.html#a784a4d1f183a4404936d25136e27b0f7',1,'stan::gm::list_argument']]], + ['_5fvar_5fadaptation',['_var_adaptation',['../classstan_1_1mcmc_1_1stepsize__var__adapter.html#a4b0e0a10b281ecbc17a22731cabd5032',1,'stan::mcmc::stepsize_var_adapter']]], + ['_5fvaria',['_variA',['../agrad_2rev_2matrix_2ldlt_8hpp.html#a67f87b0fba11a247523af8e89ea39331',1,'ldlt.hpp']]], + ['_5fvarib',['_variB',['../agrad_2rev_2matrix_2ldlt_8hpp.html#a6d2efaefd09e1eb3e1a9a28f2b3a509b',1,'ldlt.hpp']]], + ['_5fvarid',['_variD',['../agrad_2rev_2matrix_2ldlt_8hpp.html#ad7f5a226630b241aa90441b387c06c41',1,'ldlt.hpp']]], + ['_5fvarirefa',['_variRefA',['../agrad_2rev_2matrix_2mdivide__left_8hpp.html#aea7df605462946b48f6c8200fe67a467',1,'_variRefA(): mdivide_left.hpp'],['../agrad_2rev_2matrix_2mdivide__left__spd_8hpp.html#aea7df605462946b48f6c8200fe67a467',1,'_variRefA(): mdivide_left_spd.hpp'],['../agrad_2rev_2matrix_2mdivide__left__tri_8hpp.html#aea7df605462946b48f6c8200fe67a467',1,'_variRefA(): mdivide_left_tri.hpp']]], + ['_5fvarirefb',['_variRefB',['../agrad_2rev_2matrix_2ldlt_8hpp.html#aa2a293603982ac5da732ef1c85aabcd4',1,'_variRefB(): ldlt.hpp'],['../agrad_2rev_2matrix_2mdivide__left_8hpp.html#aa2a293603982ac5da732ef1c85aabcd4',1,'_variRefB(): mdivide_left.hpp'],['../agrad_2rev_2matrix_2mdivide__left__spd_8hpp.html#aa2a293603982ac5da732ef1c85aabcd4',1,'_variRefB(): mdivide_left_spd.hpp'],['../agrad_2rev_2matrix_2mdivide__left__tri_8hpp.html#aa2a293603982ac5da732ef1c85aabcd4',1,'_variRefB(): mdivide_left_tri.hpp']]], + ['_5fvarirefc',['_variRefC',['../agrad_2rev_2matrix_2ldlt_8hpp.html#ab81845acdc3a00d1a9358f95da0d560e',1,'_variRefC(): ldlt.hpp'],['../agrad_2rev_2matrix_2mdivide__left_8hpp.html#ab81845acdc3a00d1a9358f95da0d560e',1,'_variRefC(): mdivide_left.hpp'],['../agrad_2rev_2matrix_2mdivide__left__spd_8hpp.html#ab81845acdc3a00d1a9358f95da0d560e',1,'_variRefC(): mdivide_left_spd.hpp'],['../agrad_2rev_2matrix_2mdivide__left__tri_8hpp.html#ab81845acdc3a00d1a9358f95da0d560e',1,'_variRefC(): mdivide_left_tri.hpp']]], + ['_5fx_5fbar',['_x_bar',['../classstan_1_1mcmc_1_1stepsize__adaptation.html#a0091180522b7f03d801a6f8ec46c7f21',1,'stan::mcmc::stepsize_adaptation']]], + ['_5fxk',['_xk',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a6107a86ad15de26b4dd7c8877a892331',1,'stan::optimization::BFGSMinimizer']]], + ['_5fxk_5f1',['_xk_1',['../classstan_1_1optimization_1_1_b_f_g_s_minimizer.html#a5659d96d4d5d37d72cb62ab6b747eb7a',1,'stan::optimization::BFGSMinimizer']]], + ['_5fz',['_z',['../classstan_1_1mcmc_1_1base__hmc.html#abaa8c5f40b664481b188c8342f3917db',1,'stan::mcmc::base_hmc']]] +]; diff --git a/doc/api/html/search/variables_61.html b/doc/api/html/search/variables_61.html new file mode 100644 index 00000000000..ff1f937dfc6 --- /dev/null +++ b/doc/api/html/search/variables_61.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/variables_61.js b/doc/api/html/search/variables_61.js new file mode 100644 index 00000000000..e81b7eb61f8 --- /dev/null +++ b/doc/api/html/search/variables_61.js @@ -0,0 +1,26 @@ +var searchData= +[ + ['a_5f',['A_',['../agrad_2rev_2matrix_2determinant_8hpp.html#a11b6b3ab6459db606ab7f4bfd4ad2823',1,'A_(): determinant.hpp'],['../agrad_2rev_2matrix_2log__determinant_8hpp.html#a11b6b3ab6459db606ab7f4bfd4ad2823',1,'A_(): log_determinant.hpp'],['../agrad_2rev_2matrix_2mdivide__left_8hpp.html#a11b6b3ab6459db606ab7f4bfd4ad2823',1,'A_(): mdivide_left.hpp'],['../agrad_2rev_2matrix_2mdivide__left__tri_8hpp.html#a11b6b3ab6459db606ab7f4bfd4ad2823',1,'A_(): mdivide_left_tri.hpp'],['../agrad_2rev_2matrix_2quad__form_8hpp.html#a74fc8e511e9ed21b74f2b3e281ff4c72',1,'A_(): quad_form.hpp'],['../agrad_2rev_2matrix_2trace__gen__quad__form_8hpp.html#a74fc8e511e9ed21b74f2b3e281ff4c72',1,'A_(): trace_gen_quad_form.hpp'],['../agrad_2rev_2matrix_2trace__quad__form_8hpp.html#a74fc8e511e9ed21b74f2b3e281ff4c72',1,'A_(): trace_quad_form.hpp']]], + ['ad_5f',['ad_',['../classstan_1_1agrad_1_1op__ddv__vari.html#ab8049b0e5cba4646440a2a1c1cd04df8',1,'stan::agrad::op_ddv_vari::ad_()'],['../classstan_1_1agrad_1_1op__dv__vari.html#ad87be470866f04643d2f34067ae4b772',1,'stan::agrad::op_dv_vari::ad_()'],['../classstan_1_1agrad_1_1op__dvd__vari.html#ab2a01176a41145a445de4a77f2a5e733',1,'stan::agrad::op_dvd_vari::ad_()'],['../classstan_1_1agrad_1_1op__dvv__vari.html#a73736e271f0a642a887c75903729c76d',1,'stan::agrad::op_dvv_vari::ad_()'],['../agrad__thread__safe_8hpp.html#a7e82ab18118812301f1d7f89468aab1f',1,'ad_(): agrad_thread_safe.hpp']]], + ['adaptation',['adaptation',['../structstan_1_1io_1_1stan__csv.html#aef8315d92141f9f96c832340b7d6553d',1,'stan::io::stan_csv']]], + ['add_5fconditional_5fbody_5ff',['add_conditional_body_f',['../namespacestan_1_1gm.html#ad78f054e040e1e50bbca1c359bdfb212',1,'stan::gm']]], + ['add_5fconditional_5fcondition_5ff',['add_conditional_condition_f',['../namespacestan_1_1gm.html#ac933d49bf64b047878de0a9cd6bee469',1,'stan::gm']]], + ['add_5fexpression_5fdimss_5ff',['add_expression_dimss_f',['../namespacestan_1_1gm.html#a59538d290878f4de9cd33e6d21f57a3c',1,'stan::gm']]], + ['add_5floop_5fidentifier_5ff',['add_loop_identifier_f',['../namespacestan_1_1gm.html#aa52cffaf304fc09f5936e0fe6a708a15',1,'stan::gm']]], + ['add_5fwhile_5fbody_5ff',['add_while_body_f',['../namespacestan_1_1gm.html#a6cd03a1b864b365878417733f67b523e',1,'stan::gm']]], + ['add_5fwhile_5fcondition_5ff',['add_while_condition_f',['../namespacestan_1_1gm.html#adb748e38743964139413d8a31c622474',1,'stan::gm']]], + ['addition',['addition',['../namespacestan_1_1gm.html#a66dd9d718181d0b71df757b512a9e7b6',1,'stan::gm']]], + ['adj_5f',['adj_',['../classstan_1_1agrad_1_1vari.html#a23c19b981f1a4f850e840884b76d08a0',1,'stan::agrad::vari']]], + ['ainvb_5f',['AinvB_',['../agrad_2rev_2matrix_2ldlt_8hpp.html#ab94d72eb089cbdafd7d658f9f21e2749',1,'ldlt.hpp']]], + ['algorithm',['algorithm',['../structstan_1_1io_1_1stan__csv__metadata.html#ade7047cd16512c5a03c4d1dc9b6a3282',1,'stan::io::stan_csv_metadata']]], + ['all_5fconstant',['all_constant',['../structstan_1_1agrad_1_1_operands_and_partials.html#af8cdd957e2c7d02ea713440ae2ff0d5c',1,'stan::agrad::OperandsAndPartials']]], + ['all_5fpartials',['all_partials',['../structstan_1_1agrad_1_1_operands_and_partials.html#a72bcc7c3e6fb628355b1d147660dd1c1',1,'stan::agrad::OperandsAndPartials']]], + ['all_5fvaris',['all_varis',['../structstan_1_1agrad_1_1_operands_and_partials.html#a3af6956efe05f1ae634bcff64224b25f',1,'stan::agrad::OperandsAndPartials']]], + ['alpha0',['alpha0',['../structstan_1_1optimization_1_1_b_f_g_s_minimizer_1_1_b_f_g_s_options.html#a07597137b348a11f639d2c9eb9dd7207',1,'stan::optimization::BFGSMinimizer::BFGSOptions']]], + ['alpha_5f',['alpha_',['../_eigen___num_traits_8hpp.html#a1b79ed4274c457ae581283a7fc8e51af',1,'alpha_(): Eigen_NumTraits.hpp'],['../agrad_2rev_2matrix_2log__softmax_8hpp.html#acd28daa1fad3aaa17c91e2ca90526175',1,'alpha_(): log_softmax.hpp'],['../agrad_2rev_2matrix_2softmax_8hpp.html#acd28daa1fad3aaa17c91e2ca90526175',1,'alpha_(): softmax.hpp']]], + ['append_5fsamples',['append_samples',['../structstan_1_1io_1_1stan__csv__metadata.html#a5dd804a343d097dabe18f8a48701accb',1,'stan::io::stan_csv_metadata']]], + ['args_5f',['args_',['../structstan_1_1gm_1_1distribution.html#aab595ee25d571021f9c27db31b187f6b',1,'stan::gm::distribution::args_()'],['../structstan_1_1gm_1_1array__literal.html#a26de2c2e4c1319f282766524f991d065',1,'stan::gm::array_literal::args_()'],['../structstan_1_1gm_1_1fun.html#a7c4dc2f722ef80460d8171d6bcab8d00',1,'stan::gm::fun::args_()']]], + ['args_5fr',['args_r',['../structstan_1_1gm_1_1term__grammar.html#a6e06cb76720538efdb14c0c2ada2d370',1,'stan::gm::term_grammar']]], + ['assignment_5fr',['assignment_r',['../structstan_1_1gm_1_1statement__grammar.html#aa3deabcf92016a9afde6ce09215288ff',1,'stan::gm::statement_grammar']]], + ['avi_5f',['avi_',['../classstan_1_1agrad_1_1op__v__vari.html#ae8e93664ac7970bf32c2289f6b8d23fd',1,'stan::agrad::op_v_vari::avi_()'],['../classstan_1_1agrad_1_1op__vd__vari.html#a0bcd38664a8c961ccae91a7c4a5af468',1,'stan::agrad::op_vd_vari::avi_()'],['../classstan_1_1agrad_1_1op__vdd__vari.html#ac48a55ac9e4fe37c975bc0da3795e5cc',1,'stan::agrad::op_vdd_vari::avi_()'],['../classstan_1_1agrad_1_1op__vdv__vari.html#aedb9c63989ef1592cdf387c3a655b772',1,'stan::agrad::op_vdv_vari::avi_()'],['../classstan_1_1agrad_1_1op__vv__vari.html#acdd44b7d08e9f182c70ad91c782f8c79',1,'stan::agrad::op_vv_vari::avi_()'],['../classstan_1_1agrad_1_1op__vvd__vari.html#a16e916a50bb457803ab104e014f07419',1,'stan::agrad::op_vvd_vari::avi_()'],['../classstan_1_1agrad_1_1op__vvv__vari.html#ae8912106d3514178b27ee59f6e964654',1,'stan::agrad::op_vvv_vari::avi_()'],['../agrad__thread__safe_8hpp.html#a7ed9dc49639747c6e4466603cb99f37a',1,'avi_(): agrad_thread_safe.hpp']]] +]; diff --git a/doc/api/html/search/variables_62.html b/doc/api/html/search/variables_62.html new file mode 100644 index 00000000000..c55a15ed3c9 --- /dev/null +++ b/doc/api/html/search/variables_62.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/variables_62.js b/doc/api/html/search/variables_62.js new file mode 100644 index 00000000000..eba1d72047e --- /dev/null +++ b/doc/api/html/search/variables_62.js @@ -0,0 +1,10 @@ +var searchData= +[ + ['b_5f',['B_',['../agrad_2rev_2matrix_2quad__form_8hpp.html#a9e12a47e6a37454b96cc03670779ebf0',1,'B_(): quad_form.hpp'],['../agrad_2rev_2matrix_2trace__gen__quad__form_8hpp.html#a9e12a47e6a37454b96cc03670779ebf0',1,'B_(): trace_gen_quad_form.hpp'],['../agrad_2rev_2matrix_2trace__quad__form_8hpp.html#a9e12a47e6a37454b96cc03670779ebf0',1,'B_(): trace_quad_form.hpp']]], + ['base_5ftype_5f',['base_type_',['../structstan_1_1gm_1_1expr__type.html#aefee7b86134990f92cce19ef8e88f800',1,'stan::gm::expr_type::base_type_()'],['../structstan_1_1gm_1_1base__var__decl.html#a55f45e9a1c2aec254ab96335f85b9399',1,'stan::gm::base_var_decl::base_type_()']]], + ['bd_5f',['bd_',['../classstan_1_1agrad_1_1op__ddv__vari.html#ae35305f4cfd7182e903c8bc40b83e1e4',1,'stan::agrad::op_ddv_vari::bd_()'],['../classstan_1_1agrad_1_1op__vd__vari.html#aeb6e24f98c7ea9a0861d2651e78fba0f',1,'stan::agrad::op_vd_vari::bd_()'],['../classstan_1_1agrad_1_1op__vdd__vari.html#a287e3ff89d946a2eb877abbc525ed132',1,'stan::agrad::op_vdd_vari::bd_()'],['../classstan_1_1agrad_1_1op__vdv__vari.html#ac7de165236d121d5ee5dea22c131aa7f',1,'stan::agrad::op_vdv_vari::bd_()'],['../agrad__thread__safe_8hpp.html#a6bc687cb96fe2e6f4d9f4db190eb789f',1,'bd_(): agrad_thread_safe.hpp']]], + ['binary_5fop_5ff',['binary_op_f',['../namespacestan_1_1gm.html#ac468cb2fce622382db58f8e9f2f6c628',1,'stan::gm']]], + ['bodies_5f',['bodies_',['../structstan_1_1gm_1_1conditional__statement.html#aa050a0eba5609aba1a82615cab5be84b',1,'stan::gm::conditional_statement']]], + ['body_5f',['body_',['../structstan_1_1gm_1_1while__statement.html#a02751b1da71e77005c2e31df9c901997',1,'stan::gm::while_statement']]], + ['bvi_5f',['bvi_',['../classstan_1_1agrad_1_1op__dv__vari.html#a98d635e1f027bdfc2b334b4e1c37c3ac',1,'stan::agrad::op_dv_vari::bvi_()'],['../classstan_1_1agrad_1_1op__dvd__vari.html#ac260097674d6178986ce2bca1bf06f18',1,'stan::agrad::op_dvd_vari::bvi_()'],['../classstan_1_1agrad_1_1op__dvv__vari.html#a7e8348772bd3a834702dbaf107102fcf',1,'stan::agrad::op_dvv_vari::bvi_()'],['../classstan_1_1agrad_1_1op__vv__vari.html#ad5479c2e11d97e789b12555069856f64',1,'stan::agrad::op_vv_vari::bvi_()'],['../classstan_1_1agrad_1_1op__vvd__vari.html#a641c2f4fdf8fb63130bf1ac50705ca11',1,'stan::agrad::op_vvd_vari::bvi_()'],['../classstan_1_1agrad_1_1op__vvv__vari.html#a3bff8e5ca6a08bba14b5383ee5af0526',1,'stan::agrad::op_vvv_vari::bvi_()'],['../agrad__thread__safe_8hpp.html#adf2a9af952f9152b9565cce4349b3dbc',1,'bvi_(): agrad_thread_safe.hpp']]] +]; diff --git a/doc/api/html/search/variables_63.html b/doc/api/html/search/variables_63.html new file mode 100644 index 00000000000..c649c81fbf6 --- /dev/null +++ b/doc/api/html/search/variables_63.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/variables_63.js b/doc/api/html/search/variables_63.js new file mode 100644 index 00000000000..3a0fca945b3 --- /dev/null +++ b/doc/api/html/search/variables_63.js @@ -0,0 +1,17 @@ +var searchData= +[ + ['c1',['c1',['../structstan_1_1optimization_1_1_b_f_g_s_minimizer_1_1_b_f_g_s_options.html#a77d9e5ac3274c6810e1aacc63df5dbe1',1,'stan::optimization::BFGSMinimizer::BFGSOptions']]], + ['c2',['c2',['../structstan_1_1optimization_1_1_b_f_g_s_minimizer_1_1_b_f_g_s_options.html#a6379b29a858127f1ef3cc0ab5426cc82',1,'stan::optimization::BFGSMinimizer::BFGSOptions']]], + ['c_5f',['C_',['../agrad_2rev_2matrix_2ldlt_8hpp.html#aaed1328a1a8dc253591d2941edfec676',1,'C_(): ldlt.hpp'],['../agrad_2rev_2matrix_2mdivide__left_8hpp.html#a03e9f8989e0f5a0117b426e2b204933a',1,'C_(): mdivide_left.hpp'],['../agrad_2rev_2matrix_2mdivide__left__spd_8hpp.html#a71042c83f662a5f71b52b6e6c2ae4915',1,'C_(): mdivide_left_spd.hpp'],['../agrad_2rev_2matrix_2mdivide__left__tri_8hpp.html#a03e9f8989e0f5a0117b426e2b204933a',1,'C_(): mdivide_left_tri.hpp'],['../agrad_2rev_2matrix_2quad__form_8hpp.html#a55687fe74d2b370950b50b750657c48e',1,'C_(): quad_form.hpp']]], + ['cd_5f',['cd_',['../classstan_1_1agrad_1_1op__dvd__vari.html#afb19614ab6249ef02fd7b25cffc08025',1,'stan::agrad::op_dvd_vari::cd_()'],['../classstan_1_1agrad_1_1op__vdd__vari.html#a07feae28b7d06e95a4c5221728eaeb59',1,'stan::agrad::op_vdd_vari::cd_()'],['../classstan_1_1agrad_1_1op__vvd__vari.html#a77be8bf88a35750ac9bb0d6c7bd77d1a',1,'stan::agrad::op_vvd_vari::cd_()'],['../agrad__thread__safe_8hpp.html#a1671afec9ddeea25855e744cb53988f4',1,'cd_(): agrad_thread_safe.hpp']]], + ['chain_5fid',['chain_id',['../structstan_1_1io_1_1stan__csv__metadata.html#ad18cd985fe4d6c8c451950cc158438e4',1,'stan::io::stan_csv_metadata']]], + ['cholesky_5ffactor_5fdecl_5fr',['cholesky_factor_decl_r',['../structstan_1_1gm_1_1var__decls__grammar.html#af6c3b1a0eb00517659faa2f659d0abd0',1,'stan::gm::var_decls_grammar']]], + ['condition_5f',['condition_',['../structstan_1_1gm_1_1while__statement.html#ac28766c928629d492f3cb633a70d446d',1,'stan::gm::while_statement']]], + ['conditional_5fstatement_5fr',['conditional_statement_r',['../structstan_1_1gm_1_1statement__2__grammar.html#a5d6a2f57ba3e3e2d05f9aad72fcbc97c',1,'stan::gm::statement_2_grammar']]], + ['conditions_5f',['conditions_',['../structstan_1_1gm_1_1conditional__statement.html#a1afeedc0d7f192d1fac3cda264918a22',1,'stan::gm::conditional_statement']]], + ['constraint_5ftolerance',['CONSTRAINT_TOLERANCE',['../classstan_1_1io_1_1writer.html#a028f6ddc6fd884c8be9cdb5e17d49d73',1,'stan::io::writer::CONSTRAINT_TOLERANCE()'],['../namespacestan_1_1math.html#aece739c5a2672028f0c7848045b89f08',1,'stan::math::CONSTRAINT_TOLERANCE()'],['../namespacestan_1_1prob.html#a42d98044ad33e2fe147c7edcf09282f6',1,'stan::prob::CONSTRAINT_TOLERANCE()']]], + ['corr_5fmatrix_5fdecl_5fr',['corr_matrix_decl_r',['../structstan_1_1gm_1_1var__decls__grammar.html#a8a1a3bc0f32b4484648ba7ed1cc1e6ec',1,'stan::gm::var_decls_grammar']]], + ['cov_5fmatrix_5fdecl_5fr',['cov_matrix_decl_r',['../structstan_1_1gm_1_1var__decls__grammar.html#af7029c6e49af878a50f5717713430798',1,'stan::gm::var_decls_grammar']]], + ['criterion',['criterion',['../structstan_1_1mcmc_1_1nuts__util.html#ad957f342afb9aa4d0e838486885f31d3',1,'stan::mcmc::nuts_util']]], + ['cvi_5f',['cvi_',['../classstan_1_1agrad_1_1op__ddv__vari.html#a9fa975086d0c27cd1506fc76f0a826a1',1,'stan::agrad::op_ddv_vari::cvi_()'],['../classstan_1_1agrad_1_1op__dvv__vari.html#a7b45480bb231853d2849a225e98395b0',1,'stan::agrad::op_dvv_vari::cvi_()'],['../classstan_1_1agrad_1_1op__vdv__vari.html#a35aaa74843a75c3e340eaa2be01428fb',1,'stan::agrad::op_vdv_vari::cvi_()'],['../classstan_1_1agrad_1_1op__vvv__vari.html#a9f790058e86519dd043af8799e5269ff',1,'stan::agrad::op_vvv_vari::cvi_()'],['../agrad__thread__safe_8hpp.html#a85cb3e45be84a247edd670178d7585b1',1,'cvi_(): agrad_thread_safe.hpp']]] +]; diff --git a/doc/api/html/search/variables_64.html b/doc/api/html/search/variables_64.html new file mode 100644 index 00000000000..fee6769deda --- /dev/null +++ b/doc/api/html/search/variables_64.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/variables_64.js b/doc/api/html/search/variables_64.js new file mode 100644 index 00000000000..15c14254ec7 --- /dev/null +++ b/doc/api/html/search/variables_64.js @@ -0,0 +1,36 @@ +var searchData= +[ + ['d_5f',['d_',['../structstan_1_1agrad_1_1fvar.html#a189f3e99b3716c92b73b43e709245787',1,'stan::agrad::fvar::d_()'],['../agrad_2rev_2matrix_2ldlt_8hpp.html#a924a423d56557fce1ab298532ab03bb8',1,'D_(): ldlt.hpp'],['../agrad_2rev_2matrix_2trace__gen__quad__form_8hpp.html#ab8b790d54b5b04c9c5dd60e063ed40bc',1,'D_(): trace_gen_quad_form.hpp']]], + ['d_5fx1',['d_x1',['../structstan_1_1agrad_1_1_operands_and_partials.html#a3c0b97cb24df6cf073c7585a2ced93ea',1,'stan::agrad::OperandsAndPartials']]], + ['d_5fx2',['d_x2',['../structstan_1_1agrad_1_1_operands_and_partials.html#ae36664450bb09392fe8e0dae036ebfa1',1,'stan::agrad::OperandsAndPartials']]], + ['d_5fx3',['d_x3',['../structstan_1_1agrad_1_1_operands_and_partials.html#a1858e4f3e9bc2dee0f3bd25b72ac7862',1,'stan::agrad::OperandsAndPartials']]], + ['d_5fx4',['d_x4',['../structstan_1_1agrad_1_1_operands_and_partials.html#a1ca64b9b641bf4fe7a34bf2a6804c50a',1,'stan::agrad::OperandsAndPartials']]], + ['d_5fx5',['d_x5',['../structstan_1_1agrad_1_1_operands_and_partials.html#a99c7a29399d12adf8c55f31a60cbf6aa',1,'stan::agrad::OperandsAndPartials']]], + ['d_5fx6',['d_x6',['../structstan_1_1agrad_1_1_operands_and_partials.html#acd4f4706460ff63b51e987d343cd8bbf',1,'stan::agrad::OperandsAndPartials']]], + ['da_5f',['da_',['../classstan_1_1agrad_1_1precomp__v__vari.html#af0cd4c5436b3bdc84f0d5c499a628be3',1,'stan::agrad::precomp_v_vari']]], + ['data',['data',['../structstan_1_1io_1_1stan__csv__metadata.html#ab98a28bde3ef2a0c2a04588d527902da',1,'stan::io::stan_csv_metadata']]], + ['data_5fdecl_5f',['data_decl_',['../structstan_1_1gm_1_1program.html#a6703cdf4c559cfdf4675c68eeff40fa5',1,'stan::gm::program']]], + ['data_5forigin',['data_origin',['../namespacestan_1_1gm.html#aa21145a91e4c8dd4d9495868c6f729a7',1,'stan::gm']]], + ['data_5fvar_5fdecls_5fr',['data_var_decls_r',['../structstan_1_1gm_1_1program__grammar.html#a739949e8b7237c5a60f4968d75bf9058',1,'stan::gm::program_grammar']]], + ['decl_5f',['decl_',['../structstan_1_1gm_1_1var__decl.html#a9d23fb1315d50ec89c135e1ccfd60a6c',1,'stan::gm::var_decl']]], + ['declare_5fvars_5f',['declare_vars_',['../structstan_1_1gm_1_1init__local__var__visgen.html#a2c9f12770f32bb4cffe9444898a89ddf',1,'stan::gm::init_local_var_visgen::declare_vars_()'],['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#ae1f7b8e29eb89aff4c1b2394e27a051c',1,'stan::gm::generate_local_var_init_nan_visgen::declare_vars_()']]], + ['derived_5fdata_5fdecl_5f',['derived_data_decl_',['../structstan_1_1gm_1_1program.html#abb7b64b4d14faf7c161d6fc0c73a859d',1,'stan::gm::program']]], + ['derived_5fdata_5fvar_5fdecls_5fr',['derived_data_var_decls_r',['../structstan_1_1gm_1_1program__grammar.html#acf4498316a5b25d57a2391749f4a82fc',1,'stan::gm::program_grammar']]], + ['derived_5fdecl_5f',['derived_decl_',['../structstan_1_1gm_1_1program.html#a24e02f27c716fefbf3ec7c3a766778f5',1,'stan::gm::program']]], + ['derived_5forigin',['derived_origin',['../namespacestan_1_1gm.html#af2cb1df6a23d138782246a8304ad7d86',1,'stan::gm']]], + ['derived_5fvar_5fdecls_5fr',['derived_var_decls_r',['../structstan_1_1gm_1_1program__grammar.html#a3dd0e48430d1ef2e41b8bb670ed872e6',1,'stan::gm::program_grammar']]], + ['digits',['digits',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#ab7fc728472be7d381bf47674c5d158db',1,'std::numeric_limits< stan::agrad::fvar< T > >::digits()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a98f7189075cd866db3f13c1d8bc8f210',1,'std::numeric_limits< stan::agrad::var >::digits()']]], + ['digits10',['digits10',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a82bc6dd47767407e075cfbc04a9872d4',1,'std::numeric_limits< stan::agrad::fvar< T > >::digits10()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#afa394a3a7449a6a03d19176378ae5ea4',1,'std::numeric_limits< stan::agrad::var >::digits10()']]], + ['dims_5f',['dims_',['../structstan_1_1gm_1_1variable__dims.html#a70f46c11bdd84865ec1b65c37f9ad23c',1,'stan::gm::variable_dims::dims_()'],['../structstan_1_1gm_1_1base__var__decl.html#a34df8ccee8d884095d1b95ea2503a42c',1,'stan::gm::base_var_decl::dims_()']]], + ['dims_5fr',['dims_r',['../structstan_1_1gm_1_1statement__grammar.html#a894de01f7a57cb4f67c157e12faf33ad',1,'stan::gm::statement_grammar::dims_r()'],['../structstan_1_1gm_1_1term__grammar.html#a572196c88493b512a11e7995fe201505',1,'stan::gm::term_grammar::dims_r()'],['../structstan_1_1gm_1_1var__decls__grammar.html#a18dc853a54fc1727eea828ef99f36e01',1,'stan::gm::var_decls_grammar::dims_r()']]], + ['dimss_5f',['dimss_',['../structstan_1_1gm_1_1index__op.html#a8a7e436ba365c1e1f4bafee5a3be34a9',1,'stan::gm::index_op']]], + ['dist_5f',['dist_',['../structstan_1_1gm_1_1sample.html#a516dbdf8e9b0deee39b6ff63c8d5cde1',1,'stan::gm::sample']]], + ['distribution_5fr',['distribution_r',['../structstan_1_1gm_1_1statement__grammar.html#ad54fcb7f586876e0dbbf146d8aa7099b',1,'stan::gm::statement_grammar']]], + ['division',['division',['../namespacestan_1_1gm.html#aba4de316e472e23ea0f375d1e1a7cc33',1,'stan::gm']]], + ['dotval_5f',['dotval_',['../_eigen___num_traits_8hpp.html#a7616b0eef5b3dc26e5a5b62a3ead2035',1,'Eigen_NumTraits.hpp']]], + ['double_5fdecl_5fr',['double_decl_r',['../structstan_1_1gm_1_1var__decls__grammar.html#aaa761edc4a269b040365070ae0e1b38b',1,'stan::gm::var_decls_grammar']]], + ['double_5fliteral_5fr',['double_literal_r',['../structstan_1_1gm_1_1term__grammar.html#a91f8666c8899032d59c1ad4f54a9c0c3',1,'stan::gm::term_grammar']]], + ['double_5ft',['DOUBLE_T',['../namespacestan_1_1gm.html#a903b745f5e5ae0c05b667e45e5d62e66',1,'stan::gm']]], + ['dtrs_5f',['dtrs_',['../classstan_1_1agrad_1_1stored__gradient__vari.html#afb98edd9fb9584921e7ef283e5c9478e',1,'stan::agrad::stored_gradient_vari']]], + ['dtype_5f',['Dtype_',['../agrad_2rev_2matrix_2ldlt_8hpp.html#a7c830ea3da654e2c30a3e8d4c41610e8',1,'ldlt.hpp']]] +]; diff --git a/doc/api/html/search/variables_65.html b/doc/api/html/search/variables_65.html new file mode 100644 index 00000000000..95b64e699ac --- /dev/null +++ b/doc/api/html/search/variables_65.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/variables_65.js b/doc/api/html/search/variables_65.js new file mode 100644 index 00000000000..4821a0ec7ec --- /dev/null +++ b/doc/api/html/search/variables_65.js @@ -0,0 +1,19 @@ +var searchData= +[ + ['e',['E',['../namespacestan_1_1math.html#a66f94e47c6dc073bbd3929903b4431fe',1,'stan::math']]], + ['elt_5fdivision',['elt_division',['../namespacestan_1_1gm.html#a754bafd927243560d1f783d46ecb34a9',1,'stan::gm']]], + ['elt_5fmultiplication',['elt_multiplication',['../namespacestan_1_1gm.html#a0953feed6c7def5c5a3e9326007e81ea',1,'stan::gm']]], + ['engine',['engine',['../structstan_1_1io_1_1stan__csv__metadata.html#af9275dd04e87640591d6f365ae2416cc',1,'stan::io::stan_csv_metadata']]], + ['epsilon',['EPSILON',['../namespacestan_1_1math.html#a5ffd625c2083751d7ccabb7dbe39cbe0',1,'stan::math']]], + ['error_5fmsgs_5f',['error_msgs_',['../structstan_1_1gm_1_1expression__grammar.html#ad7c2d0065b399be4677ff2a934880bab',1,'stan::gm::expression_grammar::error_msgs_()'],['../structstan_1_1gm_1_1program__grammar.html#abdcce1575595284876756bbccc1d782d',1,'stan::gm::program_grammar::error_msgs_()'],['../structstan_1_1gm_1_1statement__2__grammar.html#acd1c878d999eb7e0b296b8171effcff5',1,'stan::gm::statement_2_grammar::error_msgs_()'],['../structstan_1_1gm_1_1statement__grammar.html#a778922e661a8179a719c1c4f148a8e89',1,'stan::gm::statement_grammar::error_msgs_()'],['../structstan_1_1gm_1_1term__grammar.html#af0c016d0b7ee4d1a637697956fb1903b',1,'stan::gm::term_grammar::error_msgs_()'],['../structstan_1_1gm_1_1var__decls__grammar.html#a0de9ad5f258a7bd55322ee06caa43559',1,'stan::gm::var_decls_grammar::error_msgs_()']]], + ['exp_5fval_5f',['exp_val_',['../agrad__thread__safe_8hpp.html#ad5fa8da685c6b471f471d6ed4fc99ebd',1,'exp_val_(): agrad_thread_safe.hpp'],['../rev_2functions_2log10_8hpp.html#ad5fa8da685c6b471f471d6ed4fc99ebd',1,'exp_val_(): log10.hpp']]], + ['expr_5f',['expr_',['../structstan_1_1gm_1_1expression.html#aea4b4bd3a099e637be3b6495cacf7a38',1,'stan::gm::expression::expr_()'],['../structstan_1_1gm_1_1index__op.html#acff80ac7b92703b3fc8e0e26d8ffa4ea',1,'stan::gm::index_op::expr_()'],['../structstan_1_1gm_1_1sample.html#a29225bfbf5c3cc9b6f259782ac957891',1,'stan::gm::sample::expr_()'],['../structstan_1_1gm_1_1assignment.html#a5b4337392501b66b3d72f1561e969fed',1,'stan::gm::assignment::expr_()']]], + ['expression07_5fg',['expression07_g',['../structstan_1_1gm_1_1var__decls__grammar.html#a873990473ac21516e6aef9eeb17516b7',1,'stan::gm::var_decls_grammar']]], + ['expression07_5fr',['expression07_r',['../structstan_1_1gm_1_1expression__grammar.html#a039d451d73377c293b768acc290f4fe0',1,'stan::gm::expression_grammar']]], + ['expression09_5fr',['expression09_r',['../structstan_1_1gm_1_1expression__grammar.html#a49f5da4ddf11067e5f9234850f0246b7',1,'stan::gm::expression_grammar']]], + ['expression10_5fr',['expression10_r',['../structstan_1_1gm_1_1expression__grammar.html#a842a2f82871c9b725a4e01408412dfef',1,'stan::gm::expression_grammar']]], + ['expression14_5fr',['expression14_r',['../structstan_1_1gm_1_1expression__grammar.html#ad8c1a56d832543048c8c8ce78af686f6',1,'stan::gm::expression_grammar']]], + ['expression_5fas_5fstatement_5ff',['expression_as_statement_f',['../namespacestan_1_1gm.html#a235997d18cc5a475e44e279951e7e96e',1,'stan::gm']]], + ['expression_5fg',['expression_g',['../structstan_1_1gm_1_1program__grammar.html#a57e35e3566d20e80fbfdaecd4035e850',1,'stan::gm::program_grammar::expression_g()'],['../structstan_1_1gm_1_1statement__2__grammar.html#ab1dd748c47712014575913b6d6d94b78',1,'stan::gm::statement_2_grammar::expression_g()'],['../structstan_1_1gm_1_1statement__grammar.html#ab7be40f62219856f74ad71670614c078',1,'stan::gm::statement_grammar::expression_g()'],['../structstan_1_1gm_1_1term__grammar.html#adc0324028be557cb8d639c30ffb4fe6d',1,'stan::gm::term_grammar::expression_g()'],['../structstan_1_1gm_1_1var__decls__grammar.html#a53b96dbd7fc4bf896e0e56c0087727cf',1,'stan::gm::var_decls_grammar::expression_g()']]], + ['expression_5fr',['expression_r',['../structstan_1_1gm_1_1expression__grammar.html#a86d9c1c1655244e6ba1bfe2cb68d4bde',1,'stan::gm::expression_grammar']]] +]; diff --git a/doc/api/html/search/variables_66.html b/doc/api/html/search/variables_66.html new file mode 100644 index 00000000000..9ff42ab7c45 --- /dev/null +++ b/doc/api/html/search/variables_66.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/variables_66.js b/doc/api/html/search/variables_66.js new file mode 100644 index 00000000000..34e09be488a --- /dev/null +++ b/doc/api/html/search/variables_66.js @@ -0,0 +1,7 @@ +var searchData= +[ + ['factor_5fr',['factor_r',['../structstan_1_1gm_1_1term__grammar.html#a9d446cacd531a1f58fbd26edf3465065',1,'stan::gm::term_grammar']]], + ['family_5f',['family_',['../structstan_1_1gm_1_1distribution.html#ab09553687b34895debe5818c548f26b8',1,'stan::gm::distribution']]], + ['for_5fstatement_5fr',['for_statement_r',['../structstan_1_1gm_1_1statement__grammar.html#a5b68ed64ef9f0602474270b4de26c268',1,'stan::gm::statement_grammar']]], + ['fun_5fr',['fun_r',['../structstan_1_1gm_1_1term__grammar.html#a8b08e0616ee62cfba37e6db5e22fa63f',1,'stan::gm::term_grammar']]] +]; diff --git a/doc/api/html/search/variables_67.html b/doc/api/html/search/variables_67.html new file mode 100644 index 00000000000..a7dd43814f3 --- /dev/null +++ b/doc/api/html/search/variables_67.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/variables_67.js b/doc/api/html/search/variables_67.js new file mode 100644 index 00000000000..25faabc8238 --- /dev/null +++ b/doc/api/html/search/variables_67.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['g',['g',['../classstan_1_1mcmc_1_1ps__point.html#a651cacb5446e2c6c9931ec23ffe547d3',1,'stan::mcmc::ps_point']]], + ['generated_5fdecl_5f',['generated_decl_',['../structstan_1_1gm_1_1program.html#a8317c188381639e8751e651c0cabccb3',1,'stan::gm::program']]], + ['generated_5fvar_5fdecls_5fr',['generated_var_decls_r',['../structstan_1_1gm_1_1program__grammar.html#a3cc3698f28d843ac60b46504c2171243',1,'stan::gm::program_grammar']]] +]; diff --git a/doc/api/html/search/variables_68.html b/doc/api/html/search/variables_68.html new file mode 100644 index 00000000000..f11c2c94888 --- /dev/null +++ b/doc/api/html/search/variables_68.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/variables_68.js b/doc/api/html/search/variables_68.js new file mode 100644 index 00000000000..7eb7bf691c7 --- /dev/null +++ b/doc/api/html/search/variables_68.js @@ -0,0 +1,12 @@ +var searchData= +[ + ['h0',['H0',['../structstan_1_1mcmc_1_1nuts__util.html#a083059897da783bc5a50a483b3d1a183',1,'stan::mcmc::nuts_util']]], + ['has_5fdenorm',['has_denorm',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#ab74374d12ef2fd157e9da0da9bca17aa',1,'std::numeric_limits< stan::agrad::fvar< T > >::has_denorm()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a39f58441200febe35d15375e04002318',1,'std::numeric_limits< stan::agrad::var >::has_denorm()']]], + ['has_5fdenorm_5floss',['has_denorm_loss',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#ac1de307325406b40bd2aa6753c8b77a4',1,'std::numeric_limits< stan::agrad::fvar< T > >::has_denorm_loss()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a07a601c0d75d68be0894f1ec263261ee',1,'std::numeric_limits< stan::agrad::var >::has_denorm_loss()']]], + ['has_5finfinity',['has_infinity',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a4900fc01499241dbb808e1ab376c8f20',1,'std::numeric_limits< stan::agrad::fvar< T > >::has_infinity()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#ac994e94ce600838a8387132c7b11e481',1,'std::numeric_limits< stan::agrad::var >::has_infinity()']]], + ['has_5fquiet_5fnan',['has_quiet_NaN',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a3d523ce5c3189091d5a7e108cdc4d0fa',1,'std::numeric_limits< stan::agrad::fvar< T > >::has_quiet_NaN()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a636301ed6183639045a28156565e7d98',1,'std::numeric_limits< stan::agrad::var >::has_quiet_NaN()']]], + ['has_5fsignaling_5fnan',['has_signaling_NaN',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a9e18e0a8ae010b0eab03652a91df9073',1,'std::numeric_limits< stan::agrad::fvar< T > >::has_signaling_NaN()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#af303ec0e4b68e63d6d0a3c5962af28f0',1,'std::numeric_limits< stan::agrad::var >::has_signaling_NaN()']]], + ['header',['header',['../structstan_1_1io_1_1stan__csv.html#afacde95dde068821de91fc137eb86515',1,'stan::io::stan_csv']]], + ['help_5fwidth',['help_width',['../classstan_1_1gm_1_1argument.html#a1604ff4589c7f92728663ce1c4709c3b',1,'stan::gm::argument']]], + ['high_5f',['high_',['../structstan_1_1gm_1_1range.html#a1b2c5b66107277bccac20593700fce54',1,'stan::gm::range']]] +]; diff --git a/doc/api/html/search/variables_69.html b/doc/api/html/search/variables_69.html new file mode 100644 index 00000000000..d4ddaf0ae0f --- /dev/null +++ b/doc/api/html/search/variables_69.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/variables_69.js b/doc/api/html/search/variables_69.js new file mode 100644 index 00000000000..616a11f6aa9 --- /dev/null +++ b/doc/api/html/search/variables_69.js @@ -0,0 +1,28 @@ +var searchData= +[ + ['identifier_5fname_5fr',['identifier_name_r',['../structstan_1_1gm_1_1var__decls__grammar.html#abe3a037eddfdf6c101755e4fc09436f9',1,'stan::gm::var_decls_grammar']]], + ['identifier_5fr',['identifier_r',['../structstan_1_1gm_1_1statement__grammar.html#a416d3908d9a67cf4d3a9b5774475fee1',1,'stan::gm::statement_grammar::identifier_r()'],['../structstan_1_1gm_1_1term__grammar.html#a58df34f539d1aa793e3cc607350bd9f3',1,'stan::gm::term_grammar::identifier_r()'],['../structstan_1_1gm_1_1var__decls__grammar.html#a633a9520c7d6578925fe33bc0106db7f',1,'stan::gm::var_decls_grammar::identifier_r()']]], + ['idx_5f',['idx_',['../agrad_2rev_2matrix_2log__softmax_8hpp.html#a48e1ddf96b6a9b19ecead9aca544bb31',1,'idx_(): log_softmax.hpp'],['../agrad_2rev_2matrix_2softmax_8hpp.html#a48e1ddf96b6a9b19ecead9aca544bb31',1,'idx_(): softmax.hpp']]], + ['ill_5fformed_5ft',['ILL_FORMED_T',['../namespacestan_1_1gm.html#a41679a8cc9b047f5ce5aea48a4d6800a',1,'stan::gm']]], + ['include_5fsampling_5f',['include_sampling_',['../structstan_1_1gm_1_1statement__visgen.html#a021d7d6fb6d86d0d05f91fead1b7beaf',1,'stan::gm::statement_visgen']]], + ['increment_5flog_5fprob_5fstatement_5fr',['increment_log_prob_statement_r',['../structstan_1_1gm_1_1statement__grammar.html#a63ae1e77864d40c126f8f5f2ea389c92',1,'stan::gm::statement_grammar']]], + ['indent_5f',['indent_',['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#a74906d451df5f65a04ae1d0125ed7e76',1,'stan::gm::generate_local_var_init_nan_visgen::indent_()'],['../structstan_1_1gm_1_1generate__init__vars__visgen.html#a647f2748887eb08a54ae5c79617ef662',1,'stan::gm::generate_init_vars_visgen::indent_()'],['../structstan_1_1gm_1_1statement__visgen.html#ae4c1610db98461ae144b353bcee4ef0c',1,'stan::gm::statement_visgen::indent_()']]], + ['indent_5fwidth',['indent_width',['../classstan_1_1gm_1_1argument.html#a63234e5b668b59bda3c18c3ade793332',1,'stan::gm::argument']]], + ['indents_5f',['indents_',['../structstan_1_1gm_1_1validate__var__decl__visgen.html#a68936cf8226f63807082c4c9201b659c',1,'stan::gm::validate_var_decl_visgen::indents_()'],['../structstan_1_1gm_1_1member__var__decl__visgen.html#a4e3a93b4b15745447bcc0f25c71c2818',1,'stan::gm::member_var_decl_visgen::indents_()'],['../structstan_1_1gm_1_1local__var__decl__visgen.html#a684598c909a697b029cbd625574b473a',1,'stan::gm::local_var_decl_visgen::indents_()'],['../structstan_1_1gm_1_1validate__transformed__params__visgen.html#abbc7f7f70068b351832f9ed884bd700e',1,'stan::gm::validate_transformed_params_visgen::indents_()']]], + ['indexed_5ffactor_5fr',['indexed_factor_r',['../structstan_1_1gm_1_1term__grammar.html#a2423c5db80eac040aa5a28db10db99cf',1,'stan::gm::term_grammar']]], + ['infty',['INFTY',['../namespacestan_1_1math.html#a7f2ac8ebf3095e9934715bb34f0669b3',1,'stan::math']]], + ['init',['init',['../structstan_1_1io_1_1stan__csv__metadata.html#ad962db2e20c7b01804ed3e2553cca168',1,'stan::io::stan_csv_metadata']]], + ['int_5fdecl_5fr',['int_decl_r',['../structstan_1_1gm_1_1var__decls__grammar.html#a95017547beb96098c7578e64b8b278eb',1,'stan::gm::var_decls_grammar']]], + ['int_5fliteral_5fr',['int_literal_r',['../structstan_1_1gm_1_1term__grammar.html#a74cece98c11632b9d78665d719908735',1,'stan::gm::term_grammar']]], + ['int_5ft',['INT_T',['../namespacestan_1_1gm.html#a2da21cb21d76a1fbafe6857e23e37b5b',1,'stan::gm']]], + ['inv_5fsqrt_5f2',['INV_SQRT_2',['../namespacestan_1_1math.html#a5491e346d5a812af988f8de4a5948c88',1,'stan::math']]], + ['inv_5fsqrt_5ftwo_5fpi',['INV_SQRT_TWO_PI',['../namespacestan_1_1math.html#a44d54686aa26009d0e9101be42afd877',1,'stan::math']]], + ['is_5fbounded',['is_bounded',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a00d51ca94f9c0e1b616831de051cbb5d',1,'std::numeric_limits< stan::agrad::fvar< T > >::is_bounded()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a0e9247bdf394e889d350e1440ec16838',1,'std::numeric_limits< stan::agrad::var >::is_bounded()']]], + ['is_5fexact',['is_exact',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#aad19ba909c19a94944d95dd1b08d1710',1,'std::numeric_limits< stan::agrad::fvar< T > >::is_exact()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#aaf190bf85cc7519a8a1b14e14c97da00',1,'std::numeric_limits< stan::agrad::var >::is_exact()']]], + ['is_5fiec559',['is_iec559',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#ade091447063275d7c0b78ee66ff60cf5',1,'std::numeric_limits< stan::agrad::fvar< T > >::is_iec559()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#ae82edc8f86c529ccf0160b314a551d2f',1,'std::numeric_limits< stan::agrad::var >::is_iec559()']]], + ['is_5finteger',['is_integer',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a0bab63fa64809576a620da21303d0811',1,'std::numeric_limits< stan::agrad::fvar< T > >::is_integer()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a0fa54365a3bc3ca63ad1eeb4ca90aa99',1,'std::numeric_limits< stan::agrad::var >::is_integer()']]], + ['is_5fmodulo',['is_modulo',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#ad516d6dd56d51063f07ba00a55a40c61',1,'std::numeric_limits< stan::agrad::fvar< T > >::is_modulo()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a03869da904ea370a26159a4b5b44552c',1,'std::numeric_limits< stan::agrad::var >::is_modulo()']]], + ['is_5fsigned',['is_signed',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a233290aa081cce7372665d112465e6aa',1,'std::numeric_limits< stan::agrad::fvar< T > >::is_signed()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a4c82808a270534c93824fa6ad9d03654',1,'std::numeric_limits< stan::agrad::var >::is_signed()']]], + ['is_5fspecialized',['is_specialized',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a1376e2f62fedbf5cabaa9ee991faaca4',1,'std::numeric_limits< stan::agrad::fvar< T > >::is_specialized()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#ae66652be3cbe3f3b88a06b3a036e47cf',1,'std::numeric_limits< stan::agrad::var >::is_specialized()']]], + ['is_5fvar_5f',['is_var_',['../structstan_1_1gm_1_1init__local__var__visgen.html#a06307f8a9f7b1ef4c6d8823d23e355e8',1,'stan::gm::init_local_var_visgen::is_var_()'],['../structstan_1_1gm_1_1local__var__decl__visgen.html#abe44f6bbd4ad19111fd011c02dd228bb',1,'stan::gm::local_var_decl_visgen::is_var_()'],['../structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html#af0d41615f91253c476b881ee7e90134e',1,'stan::gm::generate_local_var_init_nan_visgen::is_var_()'],['../structstan_1_1gm_1_1statement__visgen.html#ad951339b35d33e87ee6900f7423c1592',1,'stan::gm::statement_visgen::is_var_()']]] +]; diff --git a/doc/api/html/search/variables_6b.html b/doc/api/html/search/variables_6b.html new file mode 100644 index 00000000000..4cc58a6910f --- /dev/null +++ b/doc/api/html/search/variables_6b.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/variables_6b.js b/doc/api/html/search/variables_6b.js new file mode 100644 index 00000000000..77f49725252 --- /dev/null +++ b/doc/api/html/search/variables_6b.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['k_5f',['K_',['../structstan_1_1gm_1_1unit__vector__var__decl.html#a5e60137ec4a7b3f0ccfd0e6841ebb46f',1,'stan::gm::unit_vector_var_decl::K_()'],['../structstan_1_1gm_1_1simplex__var__decl.html#ac395e69af88b82ab0dd6f17413bf9552',1,'stan::gm::simplex_var_decl::K_()'],['../structstan_1_1gm_1_1ordered__var__decl.html#aa3a7d1133246c773a8a23825cf6a71b9',1,'stan::gm::ordered_var_decl::K_()'],['../structstan_1_1gm_1_1positive__ordered__var__decl.html#a46cd009bcd34cae3f1a1eac88ffb9df9',1,'stan::gm::positive_ordered_var_decl::K_()'],['../structstan_1_1gm_1_1cov__matrix__var__decl.html#a015b2522873880fbe7788f3b2627f6ac',1,'stan::gm::cov_matrix_var_decl::K_()'],['../structstan_1_1gm_1_1corr__matrix__var__decl.html#aed341a4b3496c14fe2e12ec4c4ae6389',1,'stan::gm::corr_matrix_var_decl::K_()']]] +]; diff --git a/doc/api/html/search/variables_6c.html b/doc/api/html/search/variables_6c.html new file mode 100644 index 00000000000..6016f5cccf5 --- /dev/null +++ b/doc/api/html/search/variables_6c.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/variables_6c.js b/doc/api/html/search/variables_6c.js new file mode 100644 index 00000000000..e4bfb47feae --- /dev/null +++ b/doc/api/html/search/variables_6c.js @@ -0,0 +1,17 @@ +var searchData= +[ + ['l_5f',['L_',['../classstan_1_1mcmc_1_1base__static__hmc.html#a90fa0670ef5e51de2534f25c0a34a2c7',1,'stan::mcmc::base_static_hmc']]], + ['left',['left',['../structstan_1_1gm_1_1binary__op.html#a08aaf31f8a247550eac0475e4a260a10',1,'stan::gm::binary_op']]], + ['left_5fdivision',['left_division',['../namespacestan_1_1gm.html#a7ce0894487b3983ccf7f1d1ed59a1f4b',1,'stan::gm']]], + ['length_5f',['length_',['../agrad_2rev_2matrix_2dot__product_8hpp.html#af0c9b7dcc98dce1d0edf7cb6ce49103b',1,'length_(): dot_product.hpp'],['../_eigen___num_traits_8hpp.html#af0c9b7dcc98dce1d0edf7cb6ce49103b',1,'length_(): Eigen_NumTraits.hpp'],['../agrad_2rev_2matrix_2squared__dist_8hpp.html#af0c9b7dcc98dce1d0edf7cb6ce49103b',1,'length_(): squared_dist.hpp'],['../agrad_2rev_2matrix_2sum_8hpp.html#af0c9b7dcc98dce1d0edf7cb6ce49103b',1,'length_(): sum.hpp']]], + ['local_5fdecl_5f',['local_decl_',['../structstan_1_1gm_1_1statements.html#a277fff5acdb257537ee927d68d7fa139',1,'stan::gm::statements']]], + ['local_5forigin',['local_origin',['../namespacestan_1_1gm.html#ae5497a13c6ad9d782269f4b25fc7608a',1,'stan::gm']]], + ['local_5fvar_5fdecls_5fr',['local_var_decls_r',['../structstan_1_1gm_1_1statement__grammar.html#ac5e7f4b79105a972ddfae455a7f28709',1,'stan::gm::statement_grammar']]], + ['log_5f10',['LOG_10',['../namespacestan_1_1math.html#ab773773e2db53015eb48ab1730816fb5',1,'stan::math']]], + ['log_5f2',['LOG_2',['../namespacestan_1_1math.html#a43fb48f0a7f26bc60c1dfb572283b149',1,'stan::math']]], + ['log_5fpi_5fover_5ffour',['LOG_PI_OVER_FOUR',['../namespacestan_1_1math.html#a177764626d2378e0d7bdfb26aac187b6',1,'stan::math']]], + ['log_5fprob_5f',['log_prob_',['../structstan_1_1gm_1_1increment__log__prob__statement.html#a7ba573d094c1453cf8e425eb2bf8a48e',1,'stan::gm::increment_log_prob_statement']]], + ['log_5fu',['log_u',['../structstan_1_1mcmc_1_1nuts__util.html#a825716d6d5b78da51a930844d3b33ccf',1,'stan::mcmc::nuts_util']]], + ['logical_5fnegate_5fexpr_5ff',['logical_negate_expr_f',['../namespacestan_1_1gm.html#a5d5139168f13961e213defe8bd85ba16',1,'stan::gm']]], + ['low_5f',['low_',['../structstan_1_1gm_1_1range.html#a9b009f03d27b53ed652e22fbf5932d97',1,'stan::gm::range']]] +]; diff --git a/doc/api/html/search/variables_6d.html b/doc/api/html/search/variables_6d.html new file mode 100644 index 00000000000..b7924e3562c --- /dev/null +++ b/doc/api/html/search/variables_6d.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/variables_6d.js b/doc/api/html/search/variables_6d.js new file mode 100644 index 00000000000..39689708f7a --- /dev/null +++ b/doc/api/html/search/variables_6d.js @@ -0,0 +1,24 @@ +var searchData= +[ + ['m_5f',['M_',['../structstan_1_1gm_1_1vector__var__decl.html#a2a503a710912ec9280682c48252c673f',1,'stan::gm::vector_var_decl::M_()'],['../structstan_1_1gm_1_1matrix__var__decl.html#ac65e9e100b4199313535f4ce92e7c583',1,'stan::gm::matrix_var_decl::M_()'],['../structstan_1_1gm_1_1cholesky__factor__var__decl.html#a20ba381f18b44d1cd09bf468eb957eb0',1,'stan::gm::cholesky_factor_var_decl::M_()'],['../agrad_2rev_2matrix_2ldlt_8hpp.html#ac7022caeebffc39337bdfd893db75983',1,'M_(): ldlt.hpp'],['../agrad_2rev_2matrix_2mdivide__left_8hpp.html#ac7022caeebffc39337bdfd893db75983',1,'M_(): mdivide_left.hpp'],['../agrad_2rev_2matrix_2mdivide__left__spd_8hpp.html#ac7022caeebffc39337bdfd893db75983',1,'M_(): mdivide_left_spd.hpp'],['../agrad_2rev_2matrix_2mdivide__left__tri_8hpp.html#ac7022caeebffc39337bdfd893db75983',1,'M_(): mdivide_left_tri.hpp']]], + ['major_5fversion',['MAJOR_VERSION',['../namespacestan.html#a75c4bb3d494fafd9d1714d4db258975c',1,'stan']]], + ['map_5f',['map_',['../structstan_1_1gm_1_1variable__map.html#a1473c759fc630466b193cbcb6a128cc7',1,'stan::gm::variable_map']]], + ['matrix_5fdecl_5fr',['matrix_decl_r',['../structstan_1_1gm_1_1var__decls__grammar.html#ae0a681145e09c4810cebdb1a43024b0f',1,'stan::gm::var_decls_grammar']]], + ['matrix_5ft',['MATRIX_T',['../namespacestan_1_1gm.html#af68190cae932b66ca3aa3c56bc2b0dc6',1,'stan::gm']]], + ['max_5fexponent',['max_exponent',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a20ce95f45b11a6e1649fe88ed29e9c18',1,'std::numeric_limits< stan::agrad::fvar< T > >::max_exponent()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a8cfd734ee404aa28cf57f64d24d192d7',1,'std::numeric_limits< stan::agrad::var >::max_exponent()']]], + ['max_5fexponent10',['max_exponent10',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#aa7f994271a89f8f913680464f37e1033',1,'std::numeric_limits< stan::agrad::fvar< T > >::max_exponent10()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#ac513d112aece630b48c538b6ac397b13',1,'std::numeric_limits< stan::agrad::var >::max_exponent10()']]], + ['maxits',['maxIts',['../structstan_1_1optimization_1_1_b_f_g_s_minimizer_1_1_b_f_g_s_options.html#af876cbedf84144450e0762520e9ff191',1,'stan::optimization::BFGSMinimizer::BFGSOptions']]], + ['memalloc_5f',['memalloc_',['../agrad__thread__safe_8hpp.html#a101adb62dfa9c36d8fe9d782b145b638',1,'memalloc_(): agrad_thread_safe.hpp'],['../namespacestan_1_1agrad.html#aaa104691d168acd62c8adff8e1888d5f',1,'stan::agrad::memalloc_()']]], + ['metadata',['metadata',['../structstan_1_1io_1_1stan__csv.html#a4ecfceb7adb01489b02afae2d38bb32d',1,'stan::io::stan_csv']]], + ['metric',['metric',['../structstan_1_1io_1_1stan__csv__adaptation.html#acb7a22f17dae3c239bab54097f06a082',1,'stan::io::stan_csv_adaptation']]], + ['min_5fexponent',['min_exponent',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#ace35430e8870ecb76f33c3053c88dabe',1,'std::numeric_limits< stan::agrad::fvar< T > >::min_exponent()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#ae36c2c99f19cedb4fc1e791d6e18d097',1,'std::numeric_limits< stan::agrad::var >::min_exponent()']]], + ['min_5fexponent10',['min_exponent10',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a7a7c9a1c6899d243cb31c6173d887bc2',1,'std::numeric_limits< stan::agrad::fvar< T > >::min_exponent10()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a4d51c2b58c296c505325170f1b24a2c2',1,'std::numeric_limits< stan::agrad::var >::min_exponent10()']]], + ['minalpha',['minAlpha',['../structstan_1_1optimization_1_1_b_f_g_s_minimizer_1_1_b_f_g_s_options.html#af96e08cafc1f70370eee848f0a4e0b05',1,'stan::optimization::BFGSMinimizer::BFGSOptions']]], + ['minor_5fversion',['MINOR_VERSION',['../namespacestan.html#ad48b562c737bb49645bd8117067858b9',1,'stan']]], + ['minv',['mInv',['../classstan_1_1mcmc_1_1dense__e__point.html#abf64e065e1579f7aeb211d764dc62eb1',1,'stan::mcmc::dense_e_point::mInv()'],['../classstan_1_1mcmc_1_1diag__e__point.html#aaeb41431de534f7237ea8a180b2b3d1a',1,'stan::mcmc::diag_e_point::mInv()']]], + ['model',['model',['../structstan_1_1io_1_1stan__csv__metadata.html#ab8e05cb697a29eac28fd070ab8567de7',1,'stan::io::stan_csv_metadata']]], + ['model_5fname_5f',['model_name_',['../structstan_1_1gm_1_1program__grammar.html#a32cf25177064369c7fcccc8e3f8e5cf1',1,'stan::gm::program_grammar']]], + ['model_5fname_5forigin',['model_name_origin',['../namespacestan_1_1gm.html#a119c68ad93a3fc5589c594433b8cb258',1,'stan::gm']]], + ['model_5fr',['model_r',['../structstan_1_1gm_1_1program__grammar.html#a082357dac44c70fe58bb9941c5ff4972',1,'stan::gm::program_grammar']]], + ['multiplication',['multiplication',['../namespacestan_1_1gm.html#a84ada99320bf1c4bb7bc1609d29965a4',1,'stan::gm']]] +]; diff --git a/doc/api/html/search/variables_6e.html b/doc/api/html/search/variables_6e.html new file mode 100644 index 00000000000..4cc41d57fc5 --- /dev/null +++ b/doc/api/html/search/variables_6e.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/variables_6e.js b/doc/api/html/search/variables_6e.js new file mode 100644 index 00000000000..51c8bfec5b4 --- /dev/null +++ b/doc/api/html/search/variables_6e.js @@ -0,0 +1,19 @@ +var searchData= +[ + ['n_5f',['N_',['../structstan_1_1gm_1_1row__vector__var__decl.html#afcf4381a6b4bf0f832e30dca34c2e418',1,'stan::gm::row_vector_var_decl::N_()'],['../structstan_1_1gm_1_1matrix__var__decl.html#af2a6738f8c8aec9255ea286504ef8d30',1,'stan::gm::matrix_var_decl::N_()'],['../structstan_1_1gm_1_1cholesky__factor__var__decl.html#ac4c2902b224d2808a2a879b85e555359',1,'stan::gm::cholesky_factor_var_decl::N_()'],['../classstan_1_1math_1_1_l_d_l_t__factor_3_01double_00_01_r_00_01_c_01_4.html#aef6f29f77406d69af69d903b629e96dd',1,'stan::math::LDLT_factor< double, R, C >::N_()'],['../agrad_2rev_2matrix_2ldlt_8hpp.html#a733553beee6dadc63ea8c537055a9e04',1,'N_(): ldlt.hpp'],['../agrad_2rev_2matrix_2mdivide__left_8hpp.html#a733553beee6dadc63ea8c537055a9e04',1,'N_(): mdivide_left.hpp'],['../agrad_2rev_2matrix_2mdivide__left__spd_8hpp.html#a733553beee6dadc63ea8c537055a9e04',1,'N_(): mdivide_left_spd.hpp'],['../agrad_2rev_2matrix_2mdivide__left__tri_8hpp.html#a733553beee6dadc63ea8c537055a9e04',1,'N_(): mdivide_left_tri.hpp']]], + ['n_5ftree',['n_tree',['../structstan_1_1mcmc_1_1nuts__util.html#ad3f10003284b647aa8a6d246e8d73935',1,'stan::mcmc::nuts_util']]], + ['name_5f',['name_',['../structstan_1_1gm_1_1variable__dims.html#a639052828000ec7614d7b40c859f592a',1,'stan::gm::variable_dims::name_()'],['../structstan_1_1gm_1_1variable.html#afb1d3556c61360990675ef1e886719ea',1,'stan::gm::variable::name_()'],['../structstan_1_1gm_1_1fun.html#a7bacce5646beb34ceca62564465e5512',1,'stan::gm::fun::name_()'],['../structstan_1_1gm_1_1base__var__decl.html#af95b3b01bd96c57240dabd226a64809e',1,'stan::gm::base_var_decl::name_()']]], + ['neg_5ftwo_5fover_5fsqrt_5fpi',['NEG_TWO_OVER_SQRT_PI',['../namespacestan_1_1math.html#a344504ea0c1f4f956c85ea8027a07ba9',1,'stan::math']]], + ['negate_5fexpr_5ff',['negate_expr_f',['../namespacestan_1_1gm.html#a1b6085f99e8b4fb9b42a7add98ac9488',1,'stan::gm']]], + ['negated_5ffactor_5fr',['negated_factor_r',['../structstan_1_1gm_1_1term__grammar.html#a8a82771553bc80dbd016853cf37676e9',1,'stan::gm::term_grammar']]], + ['negative_5fepsilon',['NEGATIVE_EPSILON',['../namespacestan_1_1math.html#a1dcea3a9752d079c9f972040b873b704',1,'stan::math']]], + ['negative_5finfty',['NEGATIVE_INFTY',['../namespacestan_1_1math.html#aa37d0f67f02e0a0b5797ed9f4df56bfb',1,'stan::math']]], + ['no_5fop_5fstatement_5fr',['no_op_statement_r',['../structstan_1_1gm_1_1statement__grammar.html#a0be0bd6e7a44724c32ff73e1bb96375e',1,'stan::gm::statement_grammar']]], + ['non_5flvalue_5fassign_5fr',['non_lvalue_assign_r',['../structstan_1_1gm_1_1statement__grammar.html#a1af0cfdf0b99e6e93c39b7fd326b0069',1,'stan::gm::statement_grammar']]], + ['not_5fa_5fnumber',['NOT_A_NUMBER',['../namespacestan_1_1math.html#a9cf147700a2e38335abc618b2c913b8a',1,'stan::math']]], + ['num_5fdims_5f',['num_dims_',['../structstan_1_1gm_1_1expr__type.html#abf2edf8c79d5990be66b23016dbd2143',1,'stan::gm::expr_type']]], + ['num_5fparams_5fr_5f_5f',['num_params_r__',['../classstan_1_1model_1_1prob__grad.html#a26e7379db0cea5dc64fa8c505f4edfda',1,'stan::model::prob_grad']]], + ['num_5fsamples',['num_samples',['../structstan_1_1io_1_1stan__csv__metadata.html#ab9d717fdea1c34f826112cd197ca530b',1,'stan::io::stan_csv_metadata']]], + ['num_5fwarmup',['num_warmup',['../structstan_1_1io_1_1stan__csv__metadata.html#a220bc990428b915e65cebf3877658008',1,'stan::io::stan_csv_metadata']]], + ['nvaris',['nvaris',['../structstan_1_1agrad_1_1_operands_and_partials.html#a4ae05b02b6c5a839f43a1815e7714c49',1,'stan::agrad::OperandsAndPartials']]] +]; diff --git a/doc/api/html/search/variables_6f.html b/doc/api/html/search/variables_6f.html new file mode 100644 index 00000000000..12fe64f3f20 --- /dev/null +++ b/doc/api/html/search/variables_6f.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/variables_6f.js b/doc/api/html/search/variables_6f.js new file mode 100644 index 00000000000..da40e6c1cb9 --- /dev/null +++ b/doc/api/html/search/variables_6f.js @@ -0,0 +1,7 @@ +var searchData= +[ + ['o_5f',['o_',['../structstan_1_1gm_1_1visgen.html#a05817588766bc44447698a3602e82cdb',1,'stan::gm::visgen']]], + ['op',['op',['../structstan_1_1gm_1_1binary__op.html#ad657bf27d15914af4925d567fbc725c6',1,'stan::gm::binary_op::op()'],['../structstan_1_1gm_1_1unary__op.html#aca16006ca03efadf9bd194bdaea1b07b',1,'stan::gm::unary_op::op()']]], + ['opt_5fdims_5fr',['opt_dims_r',['../structstan_1_1gm_1_1statement__grammar.html#a11edf3c28eba99f15d511531a874bd55',1,'stan::gm::statement_grammar::opt_dims_r()'],['../structstan_1_1gm_1_1var__decls__grammar.html#abb097b3fed3a38b056724635d2fafa88',1,'stan::gm::var_decls_grammar::opt_dims_r()']]], + ['ordered_5fdecl_5fr',['ordered_decl_r',['../structstan_1_1gm_1_1var__decls__grammar.html#a9e7481c3a94cac4e78006f7c10fb9cab',1,'stan::gm::var_decls_grammar']]] +]; diff --git a/doc/api/html/search/variables_70.html b/doc/api/html/search/variables_70.html new file mode 100644 index 00000000000..bc5c193ce73 --- /dev/null +++ b/doc/api/html/search/variables_70.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/variables_70.js b/doc/api/html/search/variables_70.js new file mode 100644 index 00000000000..bed7e5227a6 --- /dev/null +++ b/doc/api/html/search/variables_70.js @@ -0,0 +1,17 @@ +var searchData= +[ + ['p',['p',['../classstan_1_1mcmc_1_1ps__point.html#a1bb62217e59e573da4cc5ff391c1b2ce',1,'stan::mcmc::ps_point']]], + ['param_5franges_5fi_5f_5f',['param_ranges_i__',['../classstan_1_1model_1_1prob__grad.html#a19436879a5602e7b47676ce3a6ea8f5f',1,'stan::model::prob_grad']]], + ['param_5fvar_5fdecls_5fr',['param_var_decls_r',['../structstan_1_1gm_1_1program__grammar.html#a84e0908a657b1bc073abd5a134e53bc8',1,'stan::gm::program_grammar']]], + ['parameter_5fdecl_5f',['parameter_decl_',['../structstan_1_1gm_1_1program.html#aa468fc1c6838a4a02031d41391d0feee',1,'stan::gm::program']]], + ['parameter_5forigin',['parameter_origin',['../namespacestan_1_1gm.html#a15fbbd2865f57526a81f238175751b83',1,'stan::gm']]], + ['partials_5f',['partials_',['../classstan_1_1agrad_1_1stored__gradient__vari.html#a6cc0dc9d0c215f4eedd8684f8d9d04ec',1,'stan::agrad::stored_gradient_vari']]], + ['patch_5fversion',['PATCH_VERSION',['../namespacestan.html#ae9ae37a39676ea8ca7cbfeffce12f938',1,'stan']]], + ['positive_5fordered_5fdecl_5fr',['positive_ordered_decl_r',['../structstan_1_1gm_1_1var__decls__grammar.html#a18e4327f093a7e92cc4b2bca94d50470',1,'stan::gm::var_decls_grammar']]], + ['print_5fstatement_5fr',['print_statement_r',['../structstan_1_1gm_1_1statement__grammar.html#a481ea25baea5242da113c3e80b830bf8',1,'stan::gm::statement_grammar']]], + ['printable_5f',['printable_',['../structstan_1_1gm_1_1printable.html#ac9bcfe693d24c2c7b3363596fc380b26',1,'stan::gm::printable']]], + ['printable_5fr',['printable_r',['../structstan_1_1gm_1_1statement__grammar.html#a54e7e6691e72cb4983d430c033777431',1,'stan::gm::statement_grammar']]], + ['printable_5fstring_5fr',['printable_string_r',['../structstan_1_1gm_1_1statement__grammar.html#a5ba49f86716949ae1bc36585d081aba8',1,'stan::gm::statement_grammar']]], + ['printables_5f',['printables_',['../structstan_1_1gm_1_1print__statement.html#a2de577f68c38d6494d0c5b01337c3106',1,'stan::gm::print_statement']]], + ['program_5fr',['program_r',['../structstan_1_1gm_1_1program__grammar.html#a6db277442a938e2a146edcb2d7f8ebb0',1,'stan::gm::program_grammar']]] +]; diff --git a/doc/api/html/search/variables_71.html b/doc/api/html/search/variables_71.html new file mode 100644 index 00000000000..cceeff20476 --- /dev/null +++ b/doc/api/html/search/variables_71.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/variables_71.js b/doc/api/html/search/variables_71.js new file mode 100644 index 00000000000..da15abca23e --- /dev/null +++ b/doc/api/html/search/variables_71.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['q',['q',['../classstan_1_1mcmc_1_1ps__point.html#a3a12cd50a8d7e0d8c698a4debc767283',1,'stan::mcmc::ps_point']]] +]; diff --git a/doc/api/html/search/variables_72.html b/doc/api/html/search/variables_72.html new file mode 100644 index 00000000000..29b87f042e2 --- /dev/null +++ b/doc/api/html/search/variables_72.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/variables_72.js b/doc/api/html/search/variables_72.js new file mode 100644 index 00000000000..833199d338a --- /dev/null +++ b/doc/api/html/search/variables_72.js @@ -0,0 +1,15 @@ +var searchData= +[ + ['radix',['radix',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#afd5b4f9c99692d107b041363e1224f5c',1,'std::numeric_limits< stan::agrad::fvar< T > >::radix()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#ab0737f3e76c801f971530861695381fa',1,'std::numeric_limits< stan::agrad::var >::radix()']]], + ['random_5fseed',['random_seed',['../structstan_1_1io_1_1stan__csv__metadata.html#a11e87094a178f9c9942cd7e2f5d7bd02',1,'stan::io::stan_csv_metadata']]], + ['range_5f',['range_',['../structstan_1_1gm_1_1int__var__decl.html#aaa6d328f10dd0d0ae838d83ba81a1951',1,'stan::gm::int_var_decl::range_()'],['../structstan_1_1gm_1_1double__var__decl.html#ae592f05b693896629cf2c33039819404',1,'stan::gm::double_var_decl::range_()'],['../structstan_1_1gm_1_1vector__var__decl.html#aaa8d18715438632ddf572e90dea01973',1,'stan::gm::vector_var_decl::range_()'],['../structstan_1_1gm_1_1row__vector__var__decl.html#a2f731ff1b9109a953a4b145f5ab35dec',1,'stan::gm::row_vector_var_decl::range_()'],['../structstan_1_1gm_1_1matrix__var__decl.html#a787d753dd8fab870cf529e569b1556b3',1,'stan::gm::matrix_var_decl::range_()'],['../structstan_1_1gm_1_1for__statement.html#a9398fccd6c9d3e0d5c25e90fd09d3d4a',1,'stan::gm::for_statement::range_()']]], + ['range_5fbrackets_5fdouble_5fr',['range_brackets_double_r',['../structstan_1_1gm_1_1var__decls__grammar.html#a0aaf89ef89fa49d93c4b5b23b37be1ff',1,'stan::gm::var_decls_grammar']]], + ['range_5fbrackets_5fint_5fr',['range_brackets_int_r',['../structstan_1_1gm_1_1var__decls__grammar.html#a09e210333cb4aa7173c8b3f80fde5208',1,'stan::gm::var_decls_grammar']]], + ['range_5fr',['range_r',['../structstan_1_1gm_1_1statement__grammar.html#a6dc40f704e7efaccfc1a7886a051773f',1,'stan::gm::statement_grammar::range_r()'],['../structstan_1_1gm_1_1var__decls__grammar.html#aac6aeaf9cbe3c714711c2d3e387c941e',1,'stan::gm::var_decls_grammar::range_r()']]], + ['remove_5floop_5fidentifier_5ff',['remove_loop_identifier_f',['../namespacestan_1_1gm.html#add53eab5545aad3acada8a2f5c253a13',1,'stan::gm']]], + ['rho',['rho',['../structstan_1_1optimization_1_1_b_f_g_s_minimizer_1_1_b_f_g_s_options.html#ae62684f34eac1552c27bed815c2e4ea3',1,'stan::optimization::BFGSMinimizer::BFGSOptions']]], + ['right',['right',['../structstan_1_1gm_1_1binary__op.html#a8c4d835d3bf96f0163e265f824130210',1,'stan::gm::binary_op']]], + ['round_5fstyle',['round_style',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a1c70d1cf58dba42f0bb1987810ae07a7',1,'std::numeric_limits< stan::agrad::fvar< T > >::round_style()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a87a2f9fb70b542ca087f476622d51a57',1,'std::numeric_limits< stan::agrad::var >::round_style()']]], + ['row_5fvector_5fdecl_5fr',['row_vector_decl_r',['../structstan_1_1gm_1_1var__decls__grammar.html#a2ead8250ab9ab408323ca23af20cd734',1,'stan::gm::var_decls_grammar']]], + ['row_5fvector_5ft',['ROW_VECTOR_T',['../namespacestan_1_1gm.html#a262a14a590dd1cc841d61cfec98b1ecd',1,'stan::gm']]] +]; diff --git a/doc/api/html/search/variables_73.html b/doc/api/html/search/variables_73.html new file mode 100644 index 00000000000..65b8f642d84 --- /dev/null +++ b/doc/api/html/search/variables_73.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/variables_73.js b/doc/api/html/search/variables_73.js new file mode 100644 index 00000000000..8d5b4aab944 --- /dev/null +++ b/doc/api/html/search/variables_73.js @@ -0,0 +1,32 @@ +var searchData= +[ + ['sample_5fr',['sample_r',['../structstan_1_1gm_1_1statement__grammar.html#a3058435c851fca6533f0a859e06e32f2',1,'stan::gm::statement_grammar']]], + ['samples',['samples',['../structstan_1_1io_1_1stan__csv.html#a5e17346c48ca1e2b9146d2700c6433a8',1,'stan::io::stan_csv']]], + ['sampling',['sampling',['../structstan_1_1io_1_1stan__csv__timing.html#ac519541a29874dcefa08af1e0584f595',1,'stan::io::stan_csv_timing']]], + ['save_5fwarmup',['save_warmup',['../structstan_1_1io_1_1stan__csv__metadata.html#aeb01b3bd545cb53379cc3d9b4965574a',1,'stan::io::stan_csv_metadata']]], + ['seed',['seed',['../structstan_1_1io_1_1stan__csv__metadata.html#a1c59ab6a12137c935db71dae89472dd4',1,'stan::io::stan_csv_metadata']]], + ['set_5ffun_5ftype2_5ff',['set_fun_type2_f',['../namespacestan_1_1gm.html#a071fa25593504eb98cd7d9da2baab92d',1,'stan::gm']]], + ['set_5ffun_5ftype_5ff',['set_fun_type_f',['../namespacestan_1_1gm.html#a7e620438867564889b2124e8877a6707',1,'stan::gm']]], + ['set_5ffun_5ftype_5fnamed_5ff',['set_fun_type_named_f',['../namespacestan_1_1gm.html#a7c2b54c2a8ea3233bb4e6b6984a5e2c7',1,'stan::gm']]], + ['set_5fvar_5ftype_5ff',['set_var_type_f',['../namespacestan_1_1gm.html#a4e0139a9c5cc5c02221aabee7b75d5aa',1,'stan::gm']]], + ['sign',['sign',['../structstan_1_1mcmc_1_1nuts__util.html#a1a1ff33b599f6046e6137d127a641b5e',1,'stan::mcmc::nuts_util']]], + ['simplex_5fdecl_5fr',['simplex_decl_r',['../structstan_1_1gm_1_1var__decls__grammar.html#a3fb24659ce9b09c18ac09acc4079510f',1,'stan::gm::var_decls_grammar']]], + ['size_5f',['size_',['../classstan_1_1agrad_1_1op__matrix__vari.html#acb63d498d5e4c7008bc2fd5407bf37cf',1,'stan::agrad::op_matrix_vari::size_()'],['../classstan_1_1agrad_1_1op__vector__vari.html#a71e9b994ff0ea34aa6ea109365e9ca27',1,'stan::agrad::op_vector_vari::size_()'],['../classstan_1_1agrad_1_1stored__gradient__vari.html#ae0a8a41b1a8e68d294cecb3ef46692e9',1,'stan::agrad::stored_gradient_vari::size_()'],['../agrad_2rev_2matrix_2dot__self_8hpp.html#a5f31775800bbb46b35b5791def1f3acc',1,'size_(): dot_self.hpp'],['../agrad_2rev_2matrix_2log__softmax_8hpp.html#a50218915641ec8f39877c2565e95a604',1,'size_(): log_softmax.hpp'],['../agrad_2rev_2matrix_2softmax_8hpp.html#a50218915641ec8f39877c2565e95a604',1,'size_(): softmax.hpp']]], + ['softmax_5falpha_5f',['softmax_alpha_',['../agrad_2rev_2matrix_2log__softmax_8hpp.html#a1e7fc23c4da87820ad49b66444825c34',1,'softmax_alpha_(): log_softmax.hpp'],['../agrad_2rev_2matrix_2softmax_8hpp.html#a1e7fc23c4da87820ad49b66444825c34',1,'softmax_alpha_(): softmax.hpp']]], + ['sqrt_5f2',['SQRT_2',['../namespacestan_1_1math.html#a491d6e40aaa2a3e205ea6708dc3c75dd',1,'stan::math']]], + ['stage_5f',['stage_',['../structstan_1_1gm_1_1var__size__validating__visgen.html#ae878013c66844f15680c8748629f51b7',1,'stan::gm::var_size_validating_visgen']]], + ['stan_5fversion_5fmajor',['stan_version_major',['../structstan_1_1io_1_1stan__csv__metadata.html#a8f6f94ea53c82fcb9269a649066af0dc',1,'stan::io::stan_csv_metadata']]], + ['stan_5fversion_5fminor',['stan_version_minor',['../structstan_1_1io_1_1stan__csv__metadata.html#a259cf0626d25c32dc03b82fc4cd1f08a',1,'stan::io::stan_csv_metadata']]], + ['stan_5fversion_5fpatch',['stan_version_patch',['../structstan_1_1io_1_1stan__csv__metadata.html#a05c438d9a575f0d8b5326cde887c51ad',1,'stan::io::stan_csv_metadata']]], + ['statement_5f',['statement_',['../structstan_1_1gm_1_1statement.html#a42dac92fef21d4502828e531cc6ea4b9',1,'stan::gm::statement::statement_()'],['../structstan_1_1gm_1_1for__statement.html#a88a12e92114b27b638669beb3a4fa795',1,'stan::gm::for_statement::statement_()'],['../structstan_1_1gm_1_1program.html#a68db9c547c8a9a585860305efa83ee38',1,'stan::gm::program::statement_()']]], + ['statement_5f2_5fg',['statement_2_g',['../structstan_1_1gm_1_1statement__grammar.html#a711cbab281b543290a3efa6012ef39c1',1,'stan::gm::statement_grammar']]], + ['statement_5f2_5fr',['statement_2_r',['../structstan_1_1gm_1_1statement__2__grammar.html#ade56d3d85cad306fb8a918671335bc26',1,'stan::gm::statement_2_grammar']]], + ['statement_5fg',['statement_g',['../structstan_1_1gm_1_1program__grammar.html#adac531fa3a2b1db28c4ae98e90af0a2b',1,'stan::gm::program_grammar::statement_g()'],['../structstan_1_1gm_1_1statement__2__grammar.html#a71b74b870a48887d16af27eb90154492',1,'stan::gm::statement_2_grammar::statement_g()']]], + ['statement_5fr',['statement_r',['../structstan_1_1gm_1_1statement__grammar.html#af25706af04c4ddca423562a701a693a3',1,'stan::gm::statement_grammar']]], + ['statement_5fseq_5fr',['statement_seq_r',['../structstan_1_1gm_1_1statement__grammar.html#a041b22f44ddbc558223b1ffeae95bbb9',1,'stan::gm::statement_grammar']]], + ['statements_5f',['statements_',['../structstan_1_1gm_1_1statements.html#a4de24354bdefdcf2b482150027a4b841',1,'stan::gm::statements']]], + ['step_5fsize',['step_size',['../structstan_1_1io_1_1stan__csv__adaptation.html#ac3cef3b693c2834695a9d7f6e21614f7',1,'stan::io::stan_csv_adaptation']]], + ['subject',['subject',['../structstan_1_1gm_1_1unary__op.html#a2030562bec45cd179d0087e2760e606f',1,'stan::gm::unary_op']]], + ['subtraction',['subtraction',['../namespacestan_1_1gm.html#abd39613c1505c278ec7a2cdcc009bbcb',1,'stan::gm']]], + ['sum_5fprob',['sum_prob',['../structstan_1_1mcmc_1_1nuts__util.html#adf4917a8569f79ecd47cc4ebf443a102',1,'stan::mcmc::nuts_util']]] +]; diff --git a/doc/api/html/search/variables_74.html b/doc/api/html/search/variables_74.html new file mode 100644 index 00000000000..60939222e90 --- /dev/null +++ b/doc/api/html/search/variables_74.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/variables_74.js b/doc/api/html/search/variables_74.js new file mode 100644 index 00000000000..67a0f41f5aa --- /dev/null +++ b/doc/api/html/search/variables_74.js @@ -0,0 +1,20 @@ +var searchData= +[ + ['t_5f',['T_',['../classstan_1_1mcmc_1_1base__static__hmc.html#affe6fd6d44fea89db4bc396cc7f64fa9',1,'stan::mcmc::base_static_hmc']]], + ['term_5fg',['term_g',['../structstan_1_1gm_1_1expression__grammar.html#af321c7c9134b2e63ebdf52245d0358c5',1,'stan::gm::expression_grammar']]], + ['term_5fr',['term_r',['../structstan_1_1gm_1_1term__grammar.html#a2e84fd310e862d276ac7ea3f2b4b0ee3',1,'stan::gm::term_grammar']]], + ['thin',['thin',['../structstan_1_1io_1_1stan__csv__metadata.html#afe9c15f7c7e774a40f83e3a7f24e4279',1,'stan::io::stan_csv_metadata']]], + ['timing',['timing',['../structstan_1_1io_1_1stan__csv.html#aeac96bfaa43c3d99db3972b6407394d7',1,'stan::io::stan_csv']]], + ['tinyness_5fbefore',['tinyness_before',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a96cfd06162e299fdd889f865df8f88ec',1,'std::numeric_limits< stan::agrad::fvar< T > >::tinyness_before()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a9dd41511966171dd188b4bb1f65b5911',1,'std::numeric_limits< stan::agrad::var >::tinyness_before()']]], + ['tolf',['tolF',['../structstan_1_1optimization_1_1_b_f_g_s_minimizer_1_1_b_f_g_s_options.html#ab0aa0121e1acca46338f9e25e9650192',1,'stan::optimization::BFGSMinimizer::BFGSOptions']]], + ['tolgrad',['tolGrad',['../structstan_1_1optimization_1_1_b_f_g_s_minimizer_1_1_b_f_g_s_options.html#aa459b03a3adde843c5bb742bc73ac55a',1,'stan::optimization::BFGSMinimizer::BFGSOptions']]], + ['tolx',['tolX',['../structstan_1_1optimization_1_1_b_f_g_s_minimizer_1_1_b_f_g_s_options.html#a0aec50286d347f1a64bf344f36088771',1,'stan::optimization::BFGSMinimizer::BFGSOptions']]], + ['transformed_5fdata_5forigin',['transformed_data_origin',['../namespacestan_1_1gm.html#a8badb02edbcc98351299f2b1a0f23740',1,'stan::gm']]], + ['transformed_5fparameter_5forigin',['transformed_parameter_origin',['../namespacestan_1_1gm.html#acd24a39b6850fab486aa1ab63d45d537',1,'stan::gm']]], + ['transpose_5ff',['transpose_f',['../namespacestan_1_1gm.html#a7f4d79c4779b3252cb5d22ce80c79d98',1,'stan::gm']]], + ['traps',['traps',['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html#a5bc84afce7db610312123c95a0f893f7',1,'std::numeric_limits< stan::agrad::fvar< T > >::traps()'],['../structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html#a9bf9a84401ae310d4855a7d5b483fa34',1,'std::numeric_limits< stan::agrad::var >::traps()']]], + ['truncation_5f',['truncation_',['../structstan_1_1gm_1_1sample.html#a5e796a4be6bef910fcad25dfbc8ca3b6',1,'stan::gm::sample']]], + ['truncation_5frange_5fr',['truncation_range_r',['../structstan_1_1gm_1_1statement__grammar.html#a1fc065c2e3cd518346178e31b84f713c',1,'stan::gm::statement_grammar']]], + ['two_5fover_5fsqrt_5fpi',['TWO_OVER_SQRT_PI',['../namespacestan_1_1math.html#a935530f53a026ebb80fcd9006059e9c8',1,'stan::math']]], + ['type_5f',['type_',['../structstan_1_1gm_1_1int__literal.html#a72e3ed5537084bf3ff324105cce4b457',1,'stan::gm::int_literal::type_()'],['../structstan_1_1gm_1_1double__literal.html#ae571ef14f106d406302e3fe0ac9bd204',1,'stan::gm::double_literal::type_()'],['../structstan_1_1gm_1_1array__literal.html#a722c9507094a61e528cb017ed6abaac0',1,'stan::gm::array_literal::type_()'],['../structstan_1_1gm_1_1variable.html#a6ff634fb68f6f6f51fe4e014a2d1dae0',1,'stan::gm::variable::type_()'],['../structstan_1_1gm_1_1fun.html#adff7eb341e34851eda4f8c38ce9c001a',1,'stan::gm::fun::type_()'],['../structstan_1_1gm_1_1index__op.html#ada5fa6fc111a5c01cdcb4bfd34cef545',1,'stan::gm::index_op::type_()'],['../structstan_1_1gm_1_1binary__op.html#a4b1a2844ace11d2be56ad75ea416a0dd',1,'stan::gm::binary_op::type_()'],['../structstan_1_1gm_1_1unary__op.html#a4963df25da0d8fd9a8697b6bc3573846',1,'stan::gm::unary_op::type_()']]] +]; diff --git a/doc/api/html/search/variables_75.html b/doc/api/html/search/variables_75.html new file mode 100644 index 00000000000..b9cc25cf223 --- /dev/null +++ b/doc/api/html/search/variables_75.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/variables_75.js b/doc/api/html/search/variables_75.js new file mode 100644 index 00000000000..10097781bb6 --- /dev/null +++ b/doc/api/html/search/variables_75.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['unit_5fvector_5fdecl_5fr',['unit_vector_decl_r',['../structstan_1_1gm_1_1var__decls__grammar.html#ad6400ff89afd46d01c13dd93ef231edd',1,'stan::gm::var_decls_grammar']]], + ['unscope_5flocals_5ff',['unscope_locals_f',['../namespacestan_1_1gm.html#aecac3234ee1a4b8b9b6344c0679cfd8d',1,'stan::gm']]] +]; diff --git a/doc/api/html/search/variables_76.html b/doc/api/html/search/variables_76.html new file mode 100644 index 00000000000..ab1aba9f49e --- /dev/null +++ b/doc/api/html/search/variables_76.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/variables_76.js b/doc/api/html/search/variables_76.js new file mode 100644 index 00000000000..d448bf1e990 --- /dev/null +++ b/doc/api/html/search/variables_76.js @@ -0,0 +1,33 @@ +var searchData= +[ + ['v',['V',['../classstan_1_1mcmc_1_1ps__point.html#a21cea778ac74b5c026a2f23fbae71304',1,'stan::mcmc::ps_point']]], + ['v1_5f',['v1_',['../agrad_2rev_2matrix_2dot__product_8hpp.html#a8c886c0e0b0df10a90267645bac46674',1,'v1_(): dot_product.hpp'],['../_eigen___num_traits_8hpp.html#a26e986ea55e50b52a5f24dc12146b280',1,'v1_(): Eigen_NumTraits.hpp'],['../agrad_2rev_2matrix_2squared__dist_8hpp.html#a83c5c6dc5ed503252611e6e50af3557a',1,'v1_(): squared_dist.hpp']]], + ['v2_5f',['v2_',['../agrad_2rev_2matrix_2dot__product_8hpp.html#a27e3d8b375e8f1fb1cb0078d150879ea',1,'v2_(): dot_product.hpp'],['../_eigen___num_traits_8hpp.html#a07b9904c44113353bf64f61d7c1e5672',1,'v2_(): Eigen_NumTraits.hpp'],['../agrad_2rev_2matrix_2squared__dist_8hpp.html#a2157c9243530cdafcfb1665c9e682ed7',1,'v2_(): squared_dist.hpp']]], + ['v_5f',['v_',['../agrad_2rev_2matrix_2dot__self_8hpp.html#ad96f2a078f01703996f5677e20cc34cd',1,'v_(): dot_self.hpp'],['../agrad_2rev_2matrix_2sum_8hpp.html#ad96f2a078f01703996f5677e20cc34cd',1,'v_(): sum.hpp']]], + ['val_5f',['val_',['../classstan_1_1agrad_1_1vari.html#a03ed9389d9c07f294820e406adfc865e',1,'stan::agrad::vari::val_()'],['../structstan_1_1agrad_1_1fvar.html#a8aa2f2b763eea9bf8928fe5f4dcd0a3d',1,'stan::agrad::fvar::val_()'],['../structstan_1_1gm_1_1int__literal.html#a298151e163dc54d45f2876fe296cde5d',1,'stan::gm::int_literal::val_()'],['../structstan_1_1gm_1_1double__literal.html#a15debd030159098dafaac809c9565c48',1,'stan::gm::double_literal::val_()']]], + ['validate_5fallow_5fsample_5ff',['validate_allow_sample_f',['../namespacestan_1_1gm.html#aa30c31af794258c24cb18df976cf4296',1,'stan::gm']]], + ['validate_5fassignment_5ff',['validate_assignment_f',['../namespacestan_1_1gm.html#a06237cc6105be14cdd2eb0575bef7ae4',1,'stan::gm']]], + ['validate_5fexpr_5ftype2_5ff',['validate_expr_type2_f',['../namespacestan_1_1gm.html#a4a3fe9f1de32042785143d781cdaaae9',1,'stan::gm']]], + ['validate_5fexpr_5ftype_5ff',['validate_expr_type_f',['../namespacestan_1_1gm.html#a32f93691dd2a6209d3f19ac875b17f3e',1,'stan::gm']]], + ['validate_5fint_5fexpr2_5ff',['validate_int_expr2_f',['../namespacestan_1_1gm.html#a46fe00392f8da59e985d5d347198d137',1,'stan::gm']]], + ['validate_5fint_5fexpr3_5ff',['validate_int_expr3_f',['../namespacestan_1_1gm.html#a275f5389777c95f7178c6bc23f1e6441',1,'stan::gm']]], + ['validate_5fsample_5ff',['validate_sample_f',['../namespacestan_1_1gm.html#ac38f7f49db3ee6f8fabb7b317eaa126c',1,'stan::gm']]], + ['var_5falloc_5fstack_5f',['var_alloc_stack_',['../namespacestan_1_1agrad.html#aab83e8df917b0f383dc6c2821fac522a',1,'stan::agrad']]], + ['var_5fdecl_5fr',['var_decl_r',['../structstan_1_1gm_1_1var__decls__grammar.html#a2ec92bd1cdd1d5fca11adfc6d51d9090',1,'stan::gm::var_decls_grammar']]], + ['var_5fdecls_5fg',['var_decls_g',['../structstan_1_1gm_1_1program__grammar.html#a5449b77a88443dc754276cb5e19320ef',1,'stan::gm::program_grammar::var_decls_g()'],['../structstan_1_1gm_1_1statement__grammar.html#aa09ea489cb32def2470106aea74eb2ce',1,'stan::gm::statement_grammar::var_decls_g()']]], + ['var_5fdecls_5fr',['var_decls_r',['../structstan_1_1gm_1_1var__decls__grammar.html#ac22f2373eb5a3a464aeff6f74086ab4f',1,'stan::gm::var_decls_grammar']]], + ['var_5fdims_5f',['var_dims_',['../structstan_1_1gm_1_1assignment.html#a2d2d3c02b849dae3dbf789473eac2ea0',1,'stan::gm::assignment']]], + ['var_5flhs_5fr',['var_lhs_r',['../structstan_1_1gm_1_1statement__grammar.html#aec8e5ec3102aa27c455d4eeb321ba74c',1,'stan::gm::statement_grammar']]], + ['var_5fmap_5f',['var_map_',['../structstan_1_1gm_1_1contains__var.html#abf59ec75e5e6729db7424da7ecce4ea7',1,'stan::gm::contains_var::var_map_()'],['../structstan_1_1gm_1_1contains__nonparam__var.html#adddb447cfb03a1031db491d6ff004d8d',1,'stan::gm::contains_nonparam_var::var_map_()'],['../structstan_1_1gm_1_1expression__grammar.html#a0bf2d69a4ee05a6f7f073087afe40929',1,'stan::gm::expression_grammar::var_map_()'],['../structstan_1_1gm_1_1program__grammar.html#a612c1a5b4a954dd9960d00d9d621a738',1,'stan::gm::program_grammar::var_map_()'],['../structstan_1_1gm_1_1statement__2__grammar.html#a3626cba34b0c81150a12ee6b045fd197',1,'stan::gm::statement_2_grammar::var_map_()'],['../structstan_1_1gm_1_1statement__grammar.html#a3e38af92fc643463ac93d825d5997c7d',1,'stan::gm::statement_grammar::var_map_()'],['../structstan_1_1gm_1_1term__grammar.html#a8a79bec27b23f79504c768be5942c958',1,'stan::gm::term_grammar::var_map_()'],['../structstan_1_1gm_1_1var__decls__grammar.html#a0a5d7aec5bad30ea0164823c04e04faf',1,'stan::gm::var_decls_grammar::var_map_()']]], + ['var_5fnochain_5fstack_5f',['var_nochain_stack_',['../namespacestan_1_1agrad.html#a1da2503303417b341d207feb1bfc9ef1',1,'stan::agrad']]], + ['var_5fresizer_5f',['var_resizer_',['../structstan_1_1gm_1_1dump__member__var__visgen.html#ae6b91a5e31677edd71859d18ad79b24c',1,'stan::gm::dump_member_var_visgen']]], + ['var_5fsize_5fvalidator_5f',['var_size_validator_',['../structstan_1_1gm_1_1dump__member__var__visgen.html#a977c2256249340da5264d61fc42fa37b',1,'stan::gm::dump_member_var_visgen::var_size_validator_()'],['../structstan_1_1gm_1_1generate__init__visgen.html#a81dbd32331a4a957f17f7dfd9a9259d0',1,'stan::gm::generate_init_visgen::var_size_validator_()']]], + ['var_5fstack_5f',['var_stack_',['../agrad__thread__safe_8hpp.html#ae14d7988968e318f7272640e9bd558aa',1,'var_stack_(): agrad_thread_safe.hpp'],['../namespacestan_1_1agrad.html#a02d750bf3c4aca82309533ecb869237b',1,'stan::agrad::var_stack_()']]], + ['var_5ftype_5f',['var_type_',['../structstan_1_1gm_1_1assignment.html#a32c7f69945a9335aad93f5b6c44b6b34',1,'stan::gm::assignment']]], + ['variable_5f',['variable_',['../structstan_1_1gm_1_1for__statement.html#acc156ec777cc5ca5a60e65506a94c60f',1,'stan::gm::for_statement']]], + ['variable_5fr',['variable_r',['../structstan_1_1gm_1_1term__grammar.html#ab0c2f2623b8f78f859c358cdf3e161a6',1,'stan::gm::term_grammar']]], + ['vector_5fdecl_5fr',['vector_decl_r',['../structstan_1_1gm_1_1var__decls__grammar.html#abc85787fdc330600e8ed8418a29fb6ac',1,'stan::gm::var_decls_grammar']]], + ['vector_5ft',['VECTOR_T',['../namespacestan_1_1gm.html#a994b5bf5385c2c96190f9aaf19e0c711',1,'stan::gm']]], + ['vi_5f',['vi_',['../classstan_1_1agrad_1_1var.html#af62c13dcd2bfab818579f6715fbda6af',1,'stan::agrad::var']]], + ['vis_5f',['vis_',['../classstan_1_1agrad_1_1op__matrix__vari.html#ac0dbd0805a80054b5cd0335ef8a6b144',1,'stan::agrad::op_matrix_vari::vis_()'],['../classstan_1_1agrad_1_1op__vector__vari.html#a63beb3a08614befd8eca4ed45e4ff438',1,'stan::agrad::op_vector_vari::vis_()']]] +]; diff --git a/doc/api/html/search/variables_77.html b/doc/api/html/search/variables_77.html new file mode 100644 index 00000000000..25c3e3a7aa4 --- /dev/null +++ b/doc/api/html/search/variables_77.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/variables_77.js b/doc/api/html/search/variables_77.js new file mode 100644 index 00000000000..f1fb4ee0ddf --- /dev/null +++ b/doc/api/html/search/variables_77.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['warmup',['warmup',['../structstan_1_1io_1_1stan__csv__timing.html#a26e38502db9dfbb27cf5747c8e96d229',1,'stan::io::stan_csv_timing']]], + ['while_5fstatement_5fr',['while_statement_r',['../structstan_1_1gm_1_1statement__grammar.html#ab8208e8ab3c4e29d3a153da6566a076d',1,'stan::gm::statement_grammar']]], + ['whitespace',['whitespace',['../structstan_1_1gm_1_1whitespace__grammar.html#a5b8a5755ab01dd301f1a32e1ef3dbf22',1,'stan::gm::whitespace_grammar']]] +]; diff --git a/doc/api/html/search/variables_78.html b/doc/api/html/search/variables_78.html new file mode 100644 index 00000000000..4a1263d84c4 --- /dev/null +++ b/doc/api/html/search/variables_78.html @@ -0,0 +1,25 @@ + + + + + + + + +
+
Loading...
+
+ +
Searching...
+
No Matches
+ +
+ + diff --git a/doc/api/html/search/variables_78.js b/doc/api/html/search/variables_78.js new file mode 100644 index 00000000000..4863289b85f --- /dev/null +++ b/doc/api/html/search/variables_78.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['x_5f',['x_',['../structstan_1_1math_1_1array__builder.html#aeeffff75de3c356257e419fc8591afcb',1,'stan::math::array_builder']]] +]; diff --git a/doc/api/html/segment_8hpp.html b/doc/api/html/segment_8hpp.html new file mode 100644 index 00000000000..9b70d021890 --- /dev/null +++ b/doc/api/html/segment_8hpp.html @@ -0,0 +1,141 @@ + + + + + +Stan: src/stan/math/matrix/segment.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
segment.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + + + +

+Functions

template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
stan::math::segment (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v, size_t i, size_t n)
 Return the specified number of elements as a vector starting from the specified element - 1 of the specified vector.
 
template<typename T >
Eigen::Matrix< T,
+1, Eigen::Dynamic > 
stan::math::segment (const Eigen::Matrix< T, 1, Eigen::Dynamic > &v, size_t i, size_t n)
 
template<typename T >
std::vector< T > stan::math::segment (const std::vector< T > &sv, size_t i, size_t n)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/segment_8hpp_source.html b/doc/api/html/segment_8hpp_source.html new file mode 100644 index 00000000000..6f3c4e09af7 --- /dev/null +++ b/doc/api/html/segment_8hpp_source.html @@ -0,0 +1,158 @@ + + + + + +Stan: src/stan/math/matrix/segment.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
segment.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__SEGMENT_HPP__
+
2 #define __STAN__MATH__MATRIX__SEGMENT_HPP__
+
3 
+ + + + +
8 
+
9 
+
10 namespace stan {
+
11  namespace math {
+
12 
+
17  template <typename T>
+
18  inline
+
19  Eigen::Matrix<T,Eigen::Dynamic,1>
+
20  segment(const Eigen::Matrix<T,Eigen::Dynamic,1>& v,
+
21  size_t i, size_t n) {
+
22  validate_row_index(v, i, "segment");
+
23  if (n != 0) validate_row_index(v, i + n - 1, "segment");
+
24  return v.segment(i-1,n);
+
25  }
+
26 
+
27  template <typename T>
+
28  inline
+
29  Eigen::Matrix<T,1,Eigen::Dynamic>
+
30  segment(const Eigen::Matrix<T,1,Eigen::Dynamic>& v,
+
31  size_t i, size_t n) {
+
32  validate_column_index(v, i, "segment");
+
33  if (n != 0) validate_column_index(v, i + n - 1, "segment");
+
34  return v.segment(i-1,n);
+
35  }
+
36 
+
37 
+
38  template <typename T>
+
39  std::vector<T>
+
40  segment(const std::vector<T>& sv,
+
41  size_t i, size_t n) {
+
42  validate_std_vector_index(sv, i, "segment");
+
43  if (n != 0) validate_std_vector_index(sv, i + n - 1, "segment");
+
44  std::vector<T> s;
+
45  for (size_t j = 0; j < n; ++j)
+
46  s.push_back(sv[i + j - 1]);
+
47  return s;
+
48  }
+
49 
+
50 
+
51 
+
52  }
+
53 }
+
54 
+
55 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/seq__view_8hpp.html b/doc/api/html/seq__view_8hpp.html new file mode 100644 index 00000000000..a13a663553b --- /dev/null +++ b/doc/api/html/seq__view_8hpp.html @@ -0,0 +1,155 @@ + + + + + +Stan: src/stan/math/seq_view.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
seq_view.hpp File Reference
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/seq__view_8hpp_source.html b/doc/api/html/seq__view_8hpp_source.html new file mode 100644 index 00000000000..a978ae9eabd --- /dev/null +++ b/doc/api/html/seq__view_8hpp_source.html @@ -0,0 +1,302 @@ + + + + + +Stan: src/stan/math/seq_view.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
seq_view.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__SEQ_VIEW_HPP__
+
2 #define __STAN__MATH__SEQ_VIEW_HPP__
+
3 
+
4 #include <vector>
+
5 
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace math {
+
11 
+
12 
+
13  template <typename T>
+
14  struct store_type {
+
15  typedef const T& type;
+
16  };
+
17  template <>
+
18  struct store_type<double> {
+
19  typedef const double type;
+
20  };
+
21  template <>
+
22  struct store_type<int> {
+
23  typedef const int type;
+
24  };
+
25 
+
26 
+
27  template <typename T>
+
28  struct pass_type {
+
29  typedef const T& type;
+
30  };
+
31  template <>
+
32  struct pass_type<double> {
+
33  typedef double type;
+
34  };
+
35  template <>
+
36  struct pass_type<int> {
+
37  typedef int type;
+
38  };
+
39 
+
40 
+
41  // S assignable to T
+
42  template <typename T, typename S>
+
43  class seq_view {
+
44  private:
+
45  typename store_type<S>::type x_;
+
46  public:
+ +
48  : x_(x) {
+
49  }
+
50  inline typename pass_type<T>::type
+
51  operator[](int n) const {
+
52  return x_;
+
53  }
+
54  int size() const {
+
55  return 1;
+
56  }
+
57  };
+
58 
+
59  template <typename T, typename S>
+
60  class seq_view<T, Eigen::Matrix<S,Eigen::Dynamic,1> > {
+
61  private:
+ +
63  public:
+
64  seq_view(typename pass_type<Eigen::Matrix<S,Eigen::Dynamic,1> >::type x)
+
65  : x_(x) {
+
66  }
+
67  inline typename pass_type<T>::type
+
68  operator[](int n) const {
+
69  return x_(n);
+
70  }
+
71  int size() const {
+
72  return x_.size();
+
73  }
+
74  };
+
75 
+
76 
+
77  template <typename T, typename S>
+
78  class seq_view<T, Eigen::Matrix<S,1,Eigen::Dynamic> > {
+
79  private:
+ +
81  public:
+
82  seq_view(typename pass_type<Eigen::Matrix<S,1,Eigen::Dynamic> >::type x)
+
83  : x_(x) {
+
84  }
+
85  inline typename pass_type<T>::type
+
86  operator[](int n) const {
+
87  return x_(n);
+
88  }
+
89  int size() const {
+
90  return x_.size();
+
91  }
+
92  };
+
93 
+
94 
+
95 
+
96  // row-major order of returns to match std::vector
+
97  template <typename T, typename S>
+
98  class seq_view<T, Eigen::Matrix<S,Eigen::Dynamic,Eigen::Dynamic> > {
+
99  private:
+ +
101  public:
+
102  seq_view(typename pass_type<Eigen::Matrix<S,Eigen::Dynamic,Eigen::Dynamic> >::type x)
+
103  : x_(x) {
+
104  }
+
105  inline typename pass_type<T>::type
+
106  operator[](int n) const {
+
107  return x_(n / x_.cols(), n % x_.cols());
+
108  }
+
109  int size() const {
+
110  return x_.size();
+
111  }
+
112  };
+
113 
+
114  // question is how expensive the ctor is
+
115  template <typename T, typename S>
+
116  class seq_view<T, std::vector<S> > {
+
117  private:
+
118  typename store_type<std::vector<S> >::type x_;
+
119  const size_t elt_size_;
+
120  public:
+
121  seq_view(typename pass_type<std::vector<S> >::type x)
+
122  : x_(x),
+
123  elt_size_(x_.size() == 0 ? 0 : seq_view<T,S>(x_[0]).size()) {
+
124  }
+
125  inline typename pass_type<T>::type
+
126  operator[](int n) const {
+
127  return seq_view<T,S>(x_[n / elt_size_])[n % elt_size_];
+
128  }
+
129  int size() const {
+
130  return x_.size() * elt_size_;
+
131  }
+
132  };
+
133 
+
134  // BELOW HERE JUST FOR EFFICIENCY
+
135 
+
136  template <typename T>
+
137  class seq_view<T, std::vector<T> > {
+
138  private:
+
139  typename store_type<std::vector<T> >::type x_;
+
140  public:
+
141  seq_view(typename pass_type<std::vector<T> >::type x)
+
142  : x_(x) {
+
143  }
+
144  inline typename pass_type<T>::type
+
145  operator[](int n) const {
+
146  return x_[n];
+
147  }
+
148  int size() const {
+
149  return x_.size();
+
150  }
+
151  };
+
152 
+
153  // if vector of S with S assignable to T, also works
+
154  // use enable_if? (and disable_if for the general case)
+
155  template <typename T>
+
156  class seq_view<T, std::vector<std::vector<T> > > {
+
157  private:
+
158  typename store_type<std::vector<std::vector<T> > >::type x_;
+
159  const size_t cols_;
+
160  public:
+
161  seq_view(typename pass_type<std::vector<std::vector<T> > >::type x)
+
162  : x_(x),
+
163  cols_(x_.size() == 0 ? 0 : x_[0].size()) { }
+
164  inline typename pass_type<T>::type
+
165  operator[](int n) const {
+
166  return x_[n / cols_][n % cols_];
+
167  }
+
168  int size() const {
+
169  return x_.size() * cols_;
+
170  }
+
171  };
+
172 
+
173  template <>
+
174  class seq_view<double, std::vector<int> > {
+
175  private:
+
176  store_type<std::vector<int> >::type x_;
+
177  public:
+
178  seq_view(pass_type<std::vector<int> >::type x)
+
179  : x_(x) {
+
180  }
+
181  inline pass_type<double>::type operator[](int n) const {
+
182  return x_[n];
+
183  }
+
184  int size() const {
+
185  return x_.size();
+
186  }
+
187  };
+
188 
+
189 
+
190 
+
191 
+
192  }
+
193 }
+
194 
+
195 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/singleton__argument_8hpp.html b/doc/api/html/singleton__argument_8hpp.html new file mode 100644 index 00000000000..ec2df68a050 --- /dev/null +++ b/doc/api/html/singleton__argument_8hpp.html @@ -0,0 +1,159 @@ + + + + + +Stan: src/stan/gm/arguments/singleton_argument.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
singleton_argument.hpp File Reference
+
+
+
#include <iostream>
+#include <boost/lexical_cast.hpp>
+#include <stan/gm/arguments/valued_argument.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + + + + + + + + + +

+Classes

struct  stan::gm::type_name< T >
 
struct  stan::gm::type_name< int >
 
struct  stan::gm::type_name< unsigned int >
 
struct  stan::gm::type_name< double >
 
struct  stan::gm::type_name< bool >
 
struct  stan::gm::type_name< std::string >
 
class  stan::gm::singleton_argument< T >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+ + + + + + + + + + + +

+Typedefs

typedef singleton_argument
+< double > 
stan::gm::real_argument
 
typedef singleton_argument< int > stan::gm::int_argument
 
typedef singleton_argument
+< unsigned int > 
stan::gm::u_int_argument
 
typedef singleton_argument< bool > stan::gm::bool_argument
 
typedef singleton_argument
+< std::string > 
stan::gm::string_argument
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/singleton__argument_8hpp_source.html b/doc/api/html/singleton__argument_8hpp_source.html new file mode 100644 index 00000000000..e7231442859 --- /dev/null +++ b/doc/api/html/singleton__argument_8hpp_source.html @@ -0,0 +1,281 @@ + + + + + +Stan: src/stan/gm/arguments/singleton_argument.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
singleton_argument.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__SINGLETON__ARGUMENT__BETA__
+
2 #define __STAN__GM__ARGUMENTS__SINGLETON__ARGUMENT__BETA__
+
3 
+
4 #include <iostream>
+
5 #include <boost/lexical_cast.hpp>
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace gm {
+
11 
+
12  template <typename T>
+
13  struct type_name {
+
14  static std::string name() { return typeid(T).name(); }
+
15  };
+
16 
+
17  // Specialize to something more readable
+
18  template <>
+
19  struct type_name<int> {
+
20  static std::string name() { return "int"; }
+
21  };
+
22 
+
23  template <>
+
24  struct type_name<unsigned int> {
+
25  static std::string name() { return "unsigned int"; }
+
26  };
+
27 
+
28  template <>
+
29  struct type_name<double> {
+
30  static std::string name() { return "double"; }
+
31  };
+
32 
+
33  template <>
+
34  struct type_name<bool> {
+
35  static std::string name() { return "boolean"; }
+
36  };
+
37 
+
38  template <>
+
39  struct type_name<std::string> {
+
40  static std::string name() { return "string"; }
+
41  };
+
42 
+
43  template<typename T>
+ +
45 
+
46  public:
+
47 
+ +
49  _constrained = false;
+
50  _name = "";
+ +
52  }
+
53 
+
54  singleton_argument(const std::string name): _validity("All") {
+
55  _name = name;
+
56  }
+
57 
+
58 
+
59  bool parse_args(std::vector<std::string>& args, std::ostream* out,
+
60  std::ostream* err, bool& help_flag) {
+
61  if (args.size() == 0)
+
62  return true;
+
63 
+
64  if ( (args.back() == "help") || (args.back() == "help-all") ) {
+
65  print_help(out, 0);
+
66  help_flag |= true;
+
67  args.clear();
+
68  return true;
+
69  }
+
70 
+
71  std::string name;
+
72  std::string value;
+
73  split_arg(args.back(), name, value);
+
74 
+
75  if (_name == name) {
+
76 
+
77  args.pop_back();
+
78 
+
79  T proposed_value = boost::lexical_cast<T>(value);
+
80 
+
81  if (!set_value(proposed_value)) {
+
82 
+
83  if (err) {
+
84  *err << proposed_value << " is not a valid value for "
+
85  << "\"" << _name << "\"" << std::endl;
+
86  *err << std::string(indent_width, ' ')
+
87  << "Valid values:" << print_valid() << std::endl;
+
88  }
+
89 
+
90  args.clear();
+
91  return false;
+
92  }
+
93 
+
94  }
+
95  return true;
+
96  }
+
97 
+
98  virtual void probe_args(argument* base_arg, std::stringstream& s) {
+
99 
+
100  s << "good" << std::endl;
+ +
102  base_arg->print(&s, 0, '\0');
+
103  s << std::endl;
+
104 
+
105  if (_constrained) {
+
106  s << "bad" << std::endl;
+
107  _value = _bad_value;
+
108  base_arg->print(&s, 0, '\0');
+
109  s << std::endl;
+
110  }
+
111 
+ +
113 
+
114  }
+
115 
+
116  void find_arg(std::string name,
+
117  std::string prefix,
+
118  std::vector<std::string>& valid_paths) {
+
119  if (name == _name) {
+
120  valid_paths.push_back(prefix + _name + "=<" + _value_type + ">");
+
121  }
+
122  }
+
123 
+
124  T value() { return _value; }
+
125 
+
126  bool set_value(const T& value) {
+
127 
+
128  if (is_valid(value)) {
+
129  _value = value;
+
130  return true;
+
131  }
+
132 
+
133  return false;
+
134  }
+
135 
+
136  std::string print_value() {
+
137  return boost::lexical_cast<std::string>(_value);
+
138  }
+
139 
+
140  std::string print_valid() {
+
141  return " " + _validity;
+
142  }
+
143 
+
144  bool is_default() {
+
145  return _value == _default_value;
+
146  }
+
147 
+
148 
+
149  protected:
+
150 
+
151  std::string _validity;
+
152  virtual bool is_valid(T value) { return true; }
+
153 
+ + +
156 
+ +
158 
+ + +
161 
+
162  };
+
163 
+ + + + + +
169 
+
170  } // gm
+
171 
+
172 } // stan
+
173 
+
174 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/singular__values_8hpp.html b/doc/api/html/singular__values_8hpp.html new file mode 100644 index 00000000000..21a165d23e0 --- /dev/null +++ b/doc/api/html/singular__values_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/math/matrix/singular_values.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
singular_values.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
stan::math::singular_values (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &m)
 Return the vector of the singular values of the specified matrix in decreasing order of magnitude.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/singular__values_8hpp_source.html b/doc/api/html/singular__values_8hpp_source.html new file mode 100644 index 00000000000..3f7c223da4e --- /dev/null +++ b/doc/api/html/singular__values_8hpp_source.html @@ -0,0 +1,125 @@ + + + + + +Stan: src/stan/math/matrix/singular_values.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
singular_values.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__SINGULAR_VALUES_HPP__
+
2 #define __STAN__MATH__MATRIX__SINGULAR_VALUES_HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
17  template <typename T>
+
18  Eigen::Matrix<T,Eigen::Dynamic,1>
+
19  singular_values(const Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& m) {
+
20  return Eigen::JacobiSVD<Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> >(m)
+
21  .singularValues();
+
22  }
+
23 
+
24  }
+
25 }
+
26 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/size_8hpp.html b/doc/api/html/size_8hpp.html new file mode 100644 index 00000000000..4e4c4db5efb --- /dev/null +++ b/doc/api/html/size_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/matrix/size.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
size.hpp File Reference
+
+
+
#include <vector>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T >
int stan::math::size (const std::vector< T > &x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/size_8hpp_source.html b/doc/api/html/size_8hpp_source.html new file mode 100644 index 00000000000..ace5f7ee7c1 --- /dev/null +++ b/doc/api/html/size_8hpp_source.html @@ -0,0 +1,124 @@ + + + + + +Stan: src/stan/math/matrix/size.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
size.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__SIZE_HPP__
+
2 #define __STAN__MATH__MATRIX__SIZE_HPP__
+
3 
+
4 #include <vector>
+
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
9  template <typename T>
+
10  inline int
+
11  size(const std::vector<T>& x) {
+
12  return x.size();
+
13  }
+
14 
+
15  }
+
16 }
+
17 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/skew__normal_8hpp.html b/doc/api/html/skew__normal_8hpp.html new file mode 100644 index 00000000000..9ac929085a5 --- /dev/null +++ b/doc/api/html/skew__normal_8hpp.html @@ -0,0 +1,158 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/skew_normal.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
skew_normal.hpp File Reference
+
+
+
#include <boost/random/variate_generator.hpp>
+#include <boost/math/distributions.hpp>
+#include <stan/prob/distributions/univariate/continuous/uniform.hpp>
+#include <stan/agrad/partials_vari.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/math/functions/owens_t.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/prob/constants.hpp>
+#include <stan/prob/traits.hpp>
+#include <stan/math/functions/value_of.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + + + + + + +

+Functions

template<bool propto, typename T_y , typename T_loc , typename T_scale , typename T_shape >
return_type< T_y, T_loc,
+T_scale, T_shape >::type 
stan::prob::skew_normal_log (const T_y &y, const T_loc &mu, const T_scale &sigma, const T_shape &alpha)
 
template<typename T_y , typename T_loc , typename T_scale , typename T_shape >
return_type< T_y, T_loc,
+T_scale, T_shape >::type 
stan::prob::skew_normal_log (const T_y &y, const T_loc &mu, const T_scale &sigma, const T_shape &alpha)
 
template<typename T_y , typename T_loc , typename T_scale , typename T_shape >
return_type< T_y, T_loc,
+T_scale, T_shape >::type 
stan::prob::skew_normal_cdf (const T_y &y, const T_loc &mu, const T_scale &sigma, const T_shape &alpha)
 
template<typename T_y , typename T_loc , typename T_scale , typename T_shape >
return_type< T_y, T_loc,
+T_scale, T_shape >::type 
stan::prob::skew_normal_cdf_log (const T_y &y, const T_loc &mu, const T_scale &sigma, const T_shape &alpha)
 
template<typename T_y , typename T_loc , typename T_scale , typename T_shape >
return_type< T_y, T_loc,
+T_scale, T_shape >::type 
stan::prob::skew_normal_ccdf_log (const T_y &y, const T_loc &mu, const T_scale &sigma, const T_shape &alpha)
 
template<class RNG >
double stan::prob::skew_normal_rng (const double mu, const double sigma, const double alpha, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/skew__normal_8hpp_source.html b/doc/api/html/skew__normal_8hpp_source.html new file mode 100644 index 00000000000..7c2bfb7d8a7 --- /dev/null +++ b/doc/api/html/skew__normal_8hpp_source.html @@ -0,0 +1,562 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/skew_normal.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
skew_normal.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS__SKEW__NORMAL__HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS__SKEW__NORMAL__HPP__
+
3 
+
4 #include <boost/random/variate_generator.hpp>
+
5 #include <boost/math/distributions.hpp>
+ +
7 
+ + + +
11 #include <stan/meta/traits.hpp>
+
12 #include <stan/prob/constants.hpp>
+
13 #include <stan/prob/traits.hpp>
+ +
15 
+
16 namespace stan {
+
17 
+
18  namespace prob {
+
19 
+
20  template <bool propto,
+
21  typename T_y, typename T_loc, typename T_scale, typename T_shape>
+
22  typename return_type<T_y,T_loc,T_scale,T_shape>::type
+
23  skew_normal_log(const T_y& y, const T_loc& mu, const T_scale& sigma,
+
24  const T_shape& alpha) {
+
25  static const char* function = "stan::prob::skew_normal_log(%1%)";
+
26 
+
27  using std::log;
+ + + + + + + +
35 
+
36  // check if any vectors are zero length
+
37  if (!(stan::length(y)
+
38  && stan::length(mu)
+
39  && stan::length(sigma)
+
40  && stan::length(alpha)))
+
41  return 0.0;
+
42 
+
43  // set up return value accumulator
+
44  double logp(0.0);
+
45 
+
46  // validate args (here done over var, which should be OK)
+
47  if (!check_not_nan(function, y, "Random variable", &logp))
+
48  return logp;
+
49  if (!check_finite(function, mu, "Location parameter",
+
50  &logp))
+
51  return logp;
+
52  if (!check_finite(function, alpha, "Shape parameter",
+
53  &logp))
+
54  return logp;
+
55  if (!check_positive(function, sigma, "Scale parameter",
+
56  &logp))
+
57  return logp;
+
58  if (!(check_consistent_sizes(function,
+
59  y,mu,sigma,alpha,
+
60  "Random variable","Location parameter",
+
61  "Scale parameter", "Shape paramter",
+
62  &logp)))
+
63  return logp;
+
64 
+
65  // check if no variables are involved and prop-to
+ +
67  return 0.0;
+
68 
+
69  // set up template expressions wrapping scalars into vector views
+ +
71  operands_and_partials(y, mu, sigma, alpha);
+
72 
+
73  VectorView<const T_y> y_vec(y);
+
74  VectorView<const T_loc> mu_vec(mu);
+
75  VectorView<const T_scale> sigma_vec(sigma);
+
76  VectorView<const T_shape> alpha_vec(alpha);
+
77  size_t N = max_size(y, mu, sigma, alpha);
+
78 
+ + +
81  is_vector<T_scale>::value> log_sigma(length(sigma));
+
82  for (size_t i = 0; i < length(sigma); i++) {
+
83  inv_sigma[i] = 1.0 / value_of(sigma_vec[i]);
+ +
85  log_sigma[i] = log(value_of(sigma_vec[i]));
+
86  }
+
87 
+
88  for (size_t n = 0; n < N; n++) {
+
89  // pull out values of arguments
+
90  const double y_dbl = value_of(y_vec[n]);
+
91  const double mu_dbl = value_of(mu_vec[n]);
+
92  const double sigma_dbl = value_of(sigma_vec[n]);
+
93  const double alpha_dbl = value_of(alpha_vec[n]);
+
94 
+
95  // reusable subexpression values
+
96  const double y_minus_mu_over_sigma
+
97  = (y_dbl - mu_dbl) * inv_sigma[n];
+
98  const double pi_dbl = boost::math::constants::pi<double>();
+
99 
+
100  // log probability
+ +
102  logp -= 0.5 * log(2.0 * pi_dbl);
+ +
104  logp -= log(sigma_dbl);
+ +
106  logp -= y_minus_mu_over_sigma * y_minus_mu_over_sigma / 2.0;
+ +
108  logp += log(boost::math::erfc(-alpha_dbl * y_minus_mu_over_sigma
+
109  / std::sqrt(2.0)));
+
110 
+
111  // gradients
+
112  double deriv_logerf
+
113  = 2.0 / std::sqrt(pi_dbl)
+
114  * exp(-alpha_dbl * y_minus_mu_over_sigma / std::sqrt(2.0)
+
115  * alpha_dbl * y_minus_mu_over_sigma / std::sqrt(2.0))
+
116  / (1 + boost::math::erf(alpha_dbl * y_minus_mu_over_sigma
+
117  / std::sqrt(2.0)));
+ +
119  operands_and_partials.d_x1[n]
+
120  += -y_minus_mu_over_sigma / sigma_dbl
+
121  + deriv_logerf * alpha_dbl / (sigma_dbl * std::sqrt(2.0)) ;
+ +
123  operands_and_partials.d_x2[n]
+
124  += y_minus_mu_over_sigma / sigma_dbl
+
125  + deriv_logerf * -alpha_dbl / (sigma_dbl * std::sqrt(2.0));
+ +
127  operands_and_partials.d_x3[n]
+
128  += -1.0 / sigma_dbl
+
129  + y_minus_mu_over_sigma * y_minus_mu_over_sigma / sigma_dbl
+
130  - deriv_logerf * y_minus_mu_over_sigma * alpha_dbl
+
131  / (sigma_dbl * std::sqrt(2.0));
+ +
133  operands_and_partials.d_x4[n]
+
134  += deriv_logerf * y_minus_mu_over_sigma / std::sqrt(2.0);
+
135  }
+
136  return operands_and_partials.to_var(logp);
+
137  }
+
138 
+
139  template <typename T_y, typename T_loc, typename T_scale, typename T_shape>
+
140  inline
+ +
142  skew_normal_log(const T_y& y, const T_loc& mu, const T_scale& sigma,
+
143  const T_shape& alpha) {
+
144  return skew_normal_log<false>(y,mu,sigma,alpha);
+
145  }
+
146 
+
147  template <typename T_y, typename T_loc, typename T_scale, typename T_shape>
+ +
149  skew_normal_cdf(const T_y& y, const T_loc& mu, const T_scale& sigma,
+
150  const T_shape& alpha) {
+
151  static const char* function = "stan::prob::skew_normal_cdf(%1%)";
+
152 
+ + + + +
157  using stan::math::owens_t;
+
158  using stan::math::value_of;
+
159 
+
160  double cdf(1.0);
+
161 
+
162  // check if any vectors are zero length
+
163  if (!(stan::length(y)
+
164  && stan::length(mu)
+
165  && stan::length(sigma)
+
166  && stan::length(alpha)))
+
167  return cdf;
+
168 
+
169  if (!check_not_nan(function, y, "Random variable", &cdf))
+
170  return cdf;
+
171  if (!check_finite(function, mu, "Location parameter", &cdf))
+
172  return cdf;
+
173  if (!check_not_nan(function, sigma, "Scale parameter", &cdf))
+
174  return cdf;
+
175  if (!check_positive(function, sigma, "Scale parameter", &cdf))
+
176  return cdf;
+
177  if (!check_finite(function, alpha, "Shape parameter", &cdf))
+
178  return cdf;
+
179  if (!check_not_nan(function, alpha, "Shape parameter", &cdf))
+
180  return cdf;
+
181  if (!(check_consistent_sizes(function,
+
182  y,mu,sigma,alpha,
+
183  "Random variable","Location parameter",
+
184  "Scale parameter","Shape paramter",
+
185  &cdf)))
+
186  return cdf;
+
187 
+ +
189  operands_and_partials(y, mu, sigma, alpha);
+
190 
+
191  using stan::math::SQRT_2;
+
192  using stan::math::pi;
+
193 
+
194  VectorView<const T_y> y_vec(y);
+
195  VectorView<const T_loc> mu_vec(mu);
+
196  VectorView<const T_scale> sigma_vec(sigma);
+
197  VectorView<const T_shape> alpha_vec(alpha);
+
198  size_t N = max_size(y, mu, sigma, alpha);
+
199  const double SQRT_TWO_OVER_PI = std::sqrt(2.0 / stan::math::pi());
+
200 
+
201  for (size_t n = 0; n < N; n++) {
+
202  const double y_dbl = value_of(y_vec[n]);
+
203  const double mu_dbl = value_of(mu_vec[n]);
+
204  const double sigma_dbl = value_of(sigma_vec[n]);
+
205  const double alpha_dbl = value_of(alpha_vec[n]);
+
206  const double alpha_dbl_sq = alpha_dbl * alpha_dbl;
+
207  const double diff = (y_dbl - mu_dbl) / sigma_dbl;
+
208  const double diff_sq = diff * diff;
+
209  const double scaled_diff = diff / SQRT_2;
+
210  const double scaled_diff_sq = diff_sq * 0.5;
+
211  const double cdf_ = 0.5 * erfc(-scaled_diff) - 2 * owens_t(diff,
+
212  alpha_dbl);
+
213  //cdf
+
214  cdf *= cdf_;
+
215 
+
216  //gradients
+
217  const double deriv_erfc = SQRT_TWO_OVER_PI * 0.5 * exp(-scaled_diff_sq)
+
218  / sigma_dbl;
+
219  const double deriv_owens = erf(alpha_dbl * scaled_diff)
+
220  * exp(-scaled_diff_sq) / SQRT_TWO_OVER_PI / (-2.0 * pi()) / sigma_dbl;
+
221  const double rep_deriv = (-2.0 * deriv_owens + deriv_erfc) / cdf_;
+
222 
+ +
224  operands_and_partials.d_x1[n] += rep_deriv;
+ +
226  operands_and_partials.d_x2[n] -= rep_deriv;
+ +
228  operands_and_partials.d_x3[n] -= rep_deriv * diff;
+ +
230  operands_and_partials.d_x4[n] += -2.0 * exp(-0.5 * diff_sq * (1.0
+
231  + alpha_dbl_sq)) / ((1 + alpha_dbl_sq) * 2.0 * pi()) / cdf_;
+
232  }
+
233 
+ +
235  for (size_t n = 0; n < stan::length(y); ++n)
+
236  operands_and_partials.d_x1[n] *= cdf;
+ +
238  for (size_t n = 0; n < stan::length(mu); ++n)
+
239  operands_and_partials.d_x2[n] *= cdf;
+ +
241  for (size_t n = 0; n < stan::length(sigma); ++n)
+
242  operands_and_partials.d_x3[n] *= cdf;
+ +
244  for (size_t n = 0; n < stan::length(alpha); ++n)
+
245  operands_and_partials.d_x4[n] *= cdf;
+
246 
+
247  return operands_and_partials.to_var(cdf);
+
248  }
+
249 
+
250  template <typename T_y, typename T_loc, typename T_scale, typename T_shape>
+ +
252  skew_normal_cdf_log(const T_y& y, const T_loc& mu, const T_scale& sigma,
+
253  const T_shape& alpha) {
+
254  static const char* function = "stan::prob::skew_normal_cdf_log(%1%)";
+
255 
+ + + +
259  using stan::math::value_of;
+ +
261  using stan::math::owens_t;
+
262 
+
263  double cdf_log(0.0);
+
264 
+
265  // check if any vectors are zero length
+
266  if (!(stan::length(y)
+
267  && stan::length(mu)
+
268  && stan::length(sigma)
+
269  && stan::length(alpha)))
+
270  return cdf_log;
+
271 
+
272  if (!check_not_nan(function, y, "Random variable", &cdf_log))
+
273  return cdf_log;
+
274  if (!check_finite(function, mu, "Location parameter", &cdf_log))
+
275  return cdf_log;
+
276  if (!check_not_nan(function, sigma, "Scale parameter", &cdf_log))
+
277  return cdf_log;
+
278  if (!check_positive(function, sigma, "Scale parameter", &cdf_log))
+
279  return cdf_log;
+
280  if (!check_finite(function, alpha, "Shape parameter", &cdf_log))
+
281  return cdf_log;
+
282  if (!check_not_nan(function, alpha, "Shape parameter", &cdf_log))
+
283  return cdf_log;
+
284  if (!(check_consistent_sizes(function,
+
285  y,mu,sigma,alpha,
+
286  "Random variable","Location parameter",
+
287  "Scale parameter","Shape paramter",
+
288  &cdf_log)))
+
289  return cdf_log;
+
290 
+ +
292  operands_and_partials(y, mu, sigma, alpha);
+
293 
+
294  using stan::math::SQRT_2;
+
295  using stan::math::pi;
+
296 
+
297  VectorView<const T_y> y_vec(y);
+
298  VectorView<const T_loc> mu_vec(mu);
+
299  VectorView<const T_scale> sigma_vec(sigma);
+
300  VectorView<const T_shape> alpha_vec(alpha);
+
301  size_t N = max_size(y, mu, sigma, alpha);
+
302  const double SQRT_TWO_OVER_PI = std::sqrt(2.0 / stan::math::pi());
+
303 
+
304  for (size_t n = 0; n < N; n++) {
+
305  const double y_dbl = value_of(y_vec[n]);
+
306  const double mu_dbl = value_of(mu_vec[n]);
+
307  const double sigma_dbl = value_of(sigma_vec[n]);
+
308  const double alpha_dbl = value_of(alpha_vec[n]);
+
309  const double alpha_dbl_sq = alpha_dbl * alpha_dbl;
+
310  const double diff = (y_dbl - mu_dbl) / sigma_dbl;
+
311  const double diff_sq = diff * diff;
+
312  const double scaled_diff = diff / SQRT_2;
+
313  const double scaled_diff_sq = diff_sq * 0.5;
+
314  const double cdf_log_ = 0.5 * erfc(-scaled_diff) - 2 * owens_t(diff,
+
315  alpha_dbl);
+
316  //cdf_log
+
317  cdf_log += log(cdf_log_);
+
318 
+
319  //gradients
+
320  const double deriv_erfc = SQRT_TWO_OVER_PI * 0.5 * exp(-scaled_diff_sq)
+
321  / sigma_dbl;
+
322  const double deriv_owens = erf(alpha_dbl * scaled_diff)
+
323  * exp(-scaled_diff_sq) / SQRT_TWO_OVER_PI / (-2.0 * pi()) / sigma_dbl;
+
324  const double rep_deriv = (-2.0 * deriv_owens + deriv_erfc) / cdf_log_;
+
325 
+ +
327  operands_and_partials.d_x1[n] += rep_deriv;
+ +
329  operands_and_partials.d_x2[n] -= rep_deriv;
+ +
331  operands_and_partials.d_x3[n] -= rep_deriv * diff;
+ +
333  operands_and_partials.d_x4[n] += -2.0 * exp(-0.5 * diff_sq * (1.0
+
334  + alpha_dbl_sq)) / ((1 + alpha_dbl_sq) * 2.0 * pi()) / cdf_log_;
+
335  }
+
336 
+
337  return operands_and_partials.to_var(cdf_log);
+
338  }
+
339 
+
340  template <typename T_y, typename T_loc, typename T_scale, typename T_shape>
+ +
342  skew_normal_ccdf_log(const T_y& y, const T_loc& mu, const T_scale& sigma,
+
343  const T_shape& alpha) {
+
344  static const char* function = "stan::prob::skew_normal_ccdf_log(%1%)";
+
345 
+ + + + +
350  using stan::math::owens_t;
+
351  using stan::math::value_of;
+
352 
+
353  double ccdf_log(0.0);
+
354 
+
355  // check if any vectors are zero length
+
356  if (!(stan::length(y)
+
357  && stan::length(mu)
+
358  && stan::length(sigma)
+
359  && stan::length(alpha)))
+
360  return ccdf_log;
+
361 
+
362  if (!check_not_nan(function, y, "Random variable", &ccdf_log))
+
363  return ccdf_log;
+
364  if (!check_finite(function, mu, "Location parameter", &ccdf_log))
+
365  return ccdf_log;
+
366  if (!check_not_nan(function, sigma, "Scale parameter", &ccdf_log))
+
367  return ccdf_log;
+
368  if (!check_positive(function, sigma, "Scale parameter", &ccdf_log))
+
369  return ccdf_log;
+
370  if (!check_finite(function, alpha, "Shape parameter", &ccdf_log))
+
371  return ccdf_log;
+
372  if (!check_not_nan(function, alpha, "Shape parameter", &ccdf_log))
+
373  return ccdf_log;
+
374  if (!(check_consistent_sizes(function,
+
375  y,mu,sigma,alpha,
+
376  "Random variable","Location parameter",
+
377  "Scale parameter","Shape paramter",
+
378  &ccdf_log)))
+
379  return ccdf_log;
+
380 
+ +
382  operands_and_partials(y, mu, sigma, alpha);
+
383 
+
384  using stan::math::SQRT_2;
+
385  using stan::math::pi;
+
386 
+
387  VectorView<const T_y> y_vec(y);
+
388  VectorView<const T_loc> mu_vec(mu);
+
389  VectorView<const T_scale> sigma_vec(sigma);
+
390  VectorView<const T_shape> alpha_vec(alpha);
+
391  size_t N = max_size(y, mu, sigma, alpha);
+
392  const double SQRT_TWO_OVER_PI = std::sqrt(2.0 / stan::math::pi());
+
393 
+
394  for (size_t n = 0; n < N; n++) {
+
395  const double y_dbl = value_of(y_vec[n]);
+
396  const double mu_dbl = value_of(mu_vec[n]);
+
397  const double sigma_dbl = value_of(sigma_vec[n]);
+
398  const double alpha_dbl = value_of(alpha_vec[n]);
+
399  const double alpha_dbl_sq = alpha_dbl * alpha_dbl;
+
400  const double diff = (y_dbl - mu_dbl) / sigma_dbl;
+
401  const double diff_sq = diff * diff;
+
402  const double scaled_diff = diff / SQRT_2;
+
403  const double scaled_diff_sq = diff_sq * 0.5;
+
404  const double ccdf_log_ = 1.0 - 0.5 * erfc(-scaled_diff) + 2 * owens_t(diff,
+
405  alpha_dbl);
+
406  //ccdf_log
+
407  ccdf_log += log(ccdf_log_);
+
408 
+
409  //gradients
+
410  const double deriv_erfc = SQRT_TWO_OVER_PI * 0.5 * exp(-scaled_diff_sq)
+
411  / sigma_dbl;
+
412  const double deriv_owens = erf(alpha_dbl * scaled_diff)
+
413  * exp(-scaled_diff_sq) / SQRT_TWO_OVER_PI / (-2.0 * pi()) / sigma_dbl;
+
414  const double rep_deriv = (-2.0 * deriv_owens + deriv_erfc) / ccdf_log_;
+
415 
+ +
417  operands_and_partials.d_x1[n] -= rep_deriv;
+ +
419  operands_and_partials.d_x2[n] += rep_deriv;
+ +
421  operands_and_partials.d_x3[n] += rep_deriv * diff;
+ +
423  operands_and_partials.d_x4[n] -= -2.0 * exp(-0.5 * diff_sq * (1.0
+
424  + alpha_dbl_sq)) / ((1 + alpha_dbl_sq) * 2.0 * pi()) / ccdf_log_;
+
425  }
+
426 
+
427  return operands_and_partials.to_var(ccdf_log);
+
428  }
+
429 
+
430  template <class RNG>
+
431  inline double
+
432  skew_normal_rng(const double mu,
+
433  const double sigma,
+
434  const double alpha,
+
435  RNG& rng) {
+
436  boost::math::skew_normal_distribution<>dist (mu, sigma, alpha);
+
437 
+
438  static const char* function = "stan::prob::skew_normal_rng(%1%)";
+
439 
+ + +
442 
+
443  if (!check_finite(function, mu, "Location parameter"))
+
444  return 0;
+
445  if (!check_finite(function, alpha, "Shape parameter"))
+
446  return 0;
+
447  if (!check_positive(function, sigma, "Scale parameter"))
+
448  return 0;
+
449 
+
450  return quantile(dist, stan::prob::uniform_rng(0.0,1.0,rng));
+
451  }
+
452  }
+
453 }
+
454 #endif
+
455 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/stack__alloc_8hpp.html b/doc/api/html/stack__alloc_8hpp.html new file mode 100644 index 00000000000..3ae48d2cd1d --- /dev/null +++ b/doc/api/html/stack__alloc_8hpp.html @@ -0,0 +1,187 @@ + + + + + +Stan: src/stan/memory/stack_alloc.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stack_alloc.hpp File Reference
+
+
+
#include <cstdlib>
+#include <cstddef>
+#include <sstream>
+#include <stdexcept>
+#include <stdint.h>
+#include <vector>
+
+

Go to the source code of this file.

+ + + + + +

+Classes

class  stan::memory::stack_alloc
 An instance of this class provides a memory pool through which blocks of raw memory may be allocated and then collected simultaneously. More...
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::memory
 (Expert) Allocate, free, and manage underlying system memory.
 
+ + + + + +

+Macros

#define likely(x)   (x)
 
#define unlikely(x)   (x)
 
+ + + + + +

+Functions

template<typename T >
bool stan::memory::is_aligned (T *ptr, unsigned int bytes_aligned)
 Return true if the specified pointer is aligned on the number of bytes.
 
+

Macro Definition Documentation

+ +
+
+ + + + + + + + +
#define likely( x)   (x)
+
+ +

Definition at line 15 of file stack_alloc.hpp.

+ +
+
+ +
+
+ + + + + + + + +
#define unlikely( x)   (x)
+
+ +

Definition at line 16 of file stack_alloc.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/stack__alloc_8hpp_source.html b/doc/api/html/stack__alloc_8hpp_source.html new file mode 100644 index 00000000000..19d46b0ade0 --- /dev/null +++ b/doc/api/html/stack__alloc_8hpp_source.html @@ -0,0 +1,238 @@ + + + + + +Stan: src/stan/memory/stack_alloc.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stack_alloc.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MEMORY__STACK_ALLOC_HPP__
+
2 #define __STAN__MEMORY__STACK_ALLOC_HPP__
+
3 
+
4 #include <cstdlib>
+
5 #include <cstddef>
+
6 #include <sstream>
+
7 #include <stdexcept>
+
8 #include <stdint.h> // FIXME: replace with cstddef?
+
9 #include <vector>
+
10 
+
11 #ifdef __GNUC__
+
12 #define likely(x) (__builtin_expect((x),1))
+
13 #define unlikely(x) (__builtin_expect((x),0))
+
14 #else
+
15 #define likely(x) (x)
+
16 #define unlikely(x) (x)
+
17 #endif
+
18 
+
19 namespace stan {
+
20 
+
21  namespace memory {
+
22 
+
34  template <typename T>
+
35  bool is_aligned(T* ptr, unsigned int bytes_aligned) {
+
36  return (reinterpret_cast<uintptr_t>(ptr) % bytes_aligned) == 0U;
+
37  }
+
38 
+
39 
+
40  namespace {
+
41  const size_t DEFAULT_INITIAL_NBYTES = 1 << 16; // 64KB
+
42 
+
43 
+
44  // FIXME: enforce alignment
+
45  // big fun to inline, but only called twice
+
46  inline char* eight_byte_aligned_malloc(size_t size) {
+
47  char* ptr = static_cast<char*>(malloc(size));
+
48  if (!ptr) return ptr; // malloc failed to alloc
+
49  if (!is_aligned(ptr,8U)) {
+
50  std::stringstream s;
+
51  s << "invalid alignment to 8 bytes, ptr="
+
52  << reinterpret_cast<uintptr_t>(ptr)
+
53  << std::endl;
+
54  throw std::runtime_error(s.str());
+
55  }
+
56  return ptr;
+
57  }
+
58  }
+
59 
+
79  class stack_alloc {
+
80  private:
+
81  std::vector<char*> blocks_; // storage for blocks, may be bigger than cur_block_
+
82  std::vector<size_t> sizes_; // could store initial & shift for others
+
83  size_t cur_block_; // index into blocks_ for next alloc
+
84  char* cur_block_end_; // ptr to cur_block_ptr_ + sizes_[cur_block_]
+
85  char* next_loc_; // ptr to next available spot in cur block
+
86 
+
95  char* move_to_next_block(size_t len) {
+
96  char* result;
+
97  ++cur_block_;
+
98  // Find the next block (if any) containing at least len bytes.
+
99  while ((cur_block_ < blocks_.size()) && (sizes_[cur_block_] < len))
+
100  ++cur_block_;
+
101  // Allocate a new block if necessary.
+
102  if (unlikely(cur_block_ >= blocks_.size())) {
+
103  // New block should be max(2*size of last block, len) bytes.
+
104  size_t newsize = sizes_.back() * 2;
+
105  if (newsize < len)
+
106  newsize = len;
+
107  blocks_.push_back(eight_byte_aligned_malloc(newsize));
+
108  if (!blocks_.back())
+
109  throw std::bad_alloc();
+
110  sizes_.push_back(newsize);
+
111  }
+
112  result = blocks_[cur_block_];
+
113  // Get the object's state back in order.
+
114  next_loc_ = result + len;
+
115  cur_block_end_ = result + sizes_[cur_block_];
+
116  return result;
+
117  }
+
118 
+
119  public:
+
120 
+
130  stack_alloc(size_t initial_nbytes = DEFAULT_INITIAL_NBYTES) :
+
131  blocks_(1, eight_byte_aligned_malloc(initial_nbytes)),
+
132  sizes_(1,initial_nbytes),
+
133  cur_block_(0),
+
134  cur_block_end_(blocks_[0] + initial_nbytes),
+
135  next_loc_(blocks_[0]) {
+
136 
+
137  if (!blocks_[0])
+
138  throw std::bad_alloc(); // no msg allowed in bad_alloc ctor
+
139  }
+
140 
+ +
148  // free ALL blocks
+
149  for (size_t i = 0; i < blocks_.size(); ++i)
+
150  if (blocks_[i])
+
151  free(blocks_[i]);
+
152  }
+
153 
+
166  inline void* alloc(size_t len) {
+
167  // Typically, just return and increment the next location.
+
168  char* result = next_loc_;
+
169  next_loc_ += len;
+
170  // Occasionally, we have to switch blocks.
+
171  if (unlikely(next_loc_ >= cur_block_end_))
+
172  result = move_to_next_block(len);
+
173  return (void*)result;
+
174  }
+
175 
+
182  inline void recover_all() {
+
183  cur_block_ = 0;
+
184  next_loc_ = blocks_[0];
+
185  cur_block_end_ = next_loc_ + sizes_[0];
+
186  }
+
187 
+
193  inline void free_all() {
+
194  // frees all BUT the first (index 0) block
+
195  for (size_t i = 1; i < blocks_.size(); ++i)
+
196  if (blocks_[i])
+
197  free(blocks_[i]);
+
198  sizes_.resize(1);
+
199  blocks_.resize(1);
+
200  recover_all();
+
201  }
+
202 
+
203  };
+
204 
+
205  }
+
206 }
+
207 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/stan_8dox.html b/doc/api/html/stan_8dox.html new file mode 100644 index 00000000000..72f04774778 --- /dev/null +++ b/doc/api/html/stan_8dox.html @@ -0,0 +1,142 @@ + + + + + +Stan: src/doxygen/stan.dox File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ +
+
+ +
+
src/doxygen/stan.dox File Reference
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
namespace  stan::gm
 Directed graphical model compiler.
 
namespace  stan::io
 Input/output utilities.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
namespace  stan::math::policies
 Extending boost functionality.
 
namespace  stan::math::policies::detail
 Reimplementing boost::math::policies::detail::raise_domain_error.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
namespace  stan::memory
 (Expert) Allocate, free, and manage underlying system memory.
 
namespace  stan::model
 For compiling models.
 
namespace  stan::prob
 Templated probability distributions.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/stan__csv__reader_8hpp.html b/doc/api/html/stan__csv__reader_8hpp.html new file mode 100644 index 00000000000..ca5c34c74f5 --- /dev/null +++ b/doc/api/html/stan__csv__reader_8hpp.html @@ -0,0 +1,143 @@ + + + + + +Stan: src/stan/io/stan_csv_reader.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan_csv_reader.hpp File Reference
+
+
+
#include <istream>
+#include <iostream>
+#include <sstream>
+#include <string>
+#include <boost/algorithm/string.hpp>
+#include <boost/lexical_cast.hpp>
+#include <stan/math/matrix.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + + + + + + +

+Classes

struct  stan::io::stan_csv_metadata
 
struct  stan::io::stan_csv_adaptation
 
struct  stan::io::stan_csv_timing
 
struct  stan::io::stan_csv
 
class  stan::io::stan_csv_reader
 Reads from a Stan output csv file. More...
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::io
 Input/output utilities.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/stan__csv__reader_8hpp_source.html b/doc/api/html/stan__csv__reader_8hpp_source.html new file mode 100644 index 00000000000..8e0cac21c87 --- /dev/null +++ b/doc/api/html/stan__csv__reader_8hpp_source.html @@ -0,0 +1,453 @@ + + + + + +Stan: src/stan/io/stan_csv_reader.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan_csv_reader.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__IO__STAN_CSV_READER_HPP__
+
2 #define __STAN__IO__STAN_CSV_READER_HPP__
+
3 
+
4 #include <istream>
+
5 #include <iostream>
+
6 #include <sstream>
+
7 #include <string>
+
8 #include <boost/algorithm/string.hpp>
+
9 #include <boost/lexical_cast.hpp>
+
10 #include <stan/math/matrix.hpp>
+
11 
+
12 namespace stan {
+
13  namespace io {
+
14 
+
15  // FIXME: should consolidate with the options from the command line in stan::gm
+ + + + +
20 
+
21  std::string model;
+
22  std::string data;
+
23  std::string init;
+
24  size_t chain_id;
+
25  size_t seed;
+ +
27  size_t num_samples;
+
28  size_t num_warmup;
+ +
30  size_t thin;
+ +
32  std::string algorithm;
+
33  std::string engine;
+
34 
+ + +
37  model(""), data(""), init(""),
+
38  chain_id(1), seed(0), random_seed(false),
+
39  num_samples(0), num_warmup(0), save_warmup(false), thin(0),
+
40  append_samples(false),
+
41  algorithm(""), engine("") {}
+
42  };
+
43 
+ +
45  double step_size;
+
46  Eigen::MatrixXd metric;
+
47 
+ +
49  : step_size(0), metric(0,0) {}
+
50  };
+
51 
+
52  struct stan_csv_timing {
+
53  double warmup;
+
54  double sampling;
+
55 
+ +
57  : warmup(0), sampling(0) {}
+
58  };
+
59 
+
60  struct stan_csv {
+ +
62  Eigen::Matrix<std::string, Eigen::Dynamic, 1> header;
+ +
64  Eigen::MatrixXd samples;
+ +
66  };
+
67 
+ +
72 
+
73  public:
+
74 
+ + +
77 
+
78  static bool read_metadata(std::istream& in, stan_csv_metadata& metadata) {
+
79 
+
80  std::stringstream ss;
+
81  std::string line;
+
82 
+
83  if (in.peek() != '#')
+
84  return false;
+
85  while (in.peek() == '#') {
+
86  std::getline(in, line);
+
87  ss << line << '\n';
+
88  }
+
89  ss.seekg(std::ios_base::beg);
+
90 
+
91  char comment;
+
92  std::string lhs;
+
93 
+
94  std::string name;
+
95  std::string value;
+
96 
+
97  while (ss.good()) {
+
98 
+
99  ss >> comment;
+
100  std::getline(ss, lhs);
+
101 
+
102  size_t equal = lhs.find("=");
+
103  if (equal != std::string::npos) {
+
104  name = lhs.substr(0, equal);
+
105  boost::trim(name);
+
106  value = lhs.substr(equal + 2, lhs.size());
+
107  boost::replace_first(value, " (Default)", "");
+
108  } else {
+
109  continue;
+
110  }
+
111 
+
112  if (name.compare("stan_version_major") == 0) {
+
113  metadata.stan_version_major = boost::lexical_cast<int>(value);
+
114  } else if (name.compare("stan_version_minor") == 0) {
+
115  metadata.stan_version_minor = boost::lexical_cast<int>(value);
+
116  } else if (name.compare("stan_version_patch") == 0) {
+
117  metadata.stan_version_patch = boost::lexical_cast<int>(value);
+
118  } else if (name.compare("model") == 0) {
+
119  metadata.model = value;
+
120  } else if (name.compare("num_samples") == 0) {
+
121  metadata.num_samples = boost::lexical_cast<int>(value);
+
122  } else if (name.compare("num_warmup") == 0) {
+
123  metadata.num_warmup = boost::lexical_cast<int>(value);
+
124  } else if (name.compare("save_warmup") == 0) {
+
125  metadata.save_warmup = boost::lexical_cast<bool>(value);
+
126  } else if (name.compare("thin") == 0) {
+
127  metadata.thin = boost::lexical_cast<int>(value);
+
128  } else if (name.compare("chain_id") == 0) {
+
129  metadata.chain_id = boost::lexical_cast<int>(value);
+
130  } else if (name.compare("data") == 0) {
+
131  metadata.data = value;
+
132  } else if (name.compare("init") == 0) {
+
133  metadata.init = value;
+
134  boost::trim(metadata.init);
+
135  } else if (name.compare("seed") == 0) {
+
136  metadata.seed = boost::lexical_cast<unsigned int>(value);
+
137  metadata.random_seed = false;
+
138  } else if (name.compare("append_samples") == 0) {
+
139  metadata.append_samples = boost::lexical_cast<bool>(value);
+
140  } else if (name.compare("algorithm") == 0) {
+
141  metadata.algorithm = value;
+
142  } else if (name.compare("engine") == 0) {
+
143  metadata.engine = value;
+
144  }
+
145 
+
146  }
+
147 
+
148  if (ss.good() == true)
+
149  return false;
+
150 
+
151  return true;
+
152 
+
153  } // read_metadata
+
154 
+
155  static bool read_header(std::istream& in, Eigen::Matrix<std::string, Eigen::Dynamic, 1>& header) {
+
156 
+
157  std::string line;
+
158 
+
159  if (in.peek() != 'l')
+
160  return false;
+
161 
+
162  std::getline(in, line);
+
163  std::stringstream ss(line);
+
164 
+
165  header.resize(std::count(line.begin(), line.end(), ',') + 1);
+
166  int idx = 0;
+
167  while (ss.good()) {
+
168  std::string token;
+
169  std::getline(ss, token, ',');
+
170  boost::trim(token);
+
171 
+
172  int pos = token.find('.');
+
173  if (pos > 0) {
+
174  token.replace(pos, 1, "[");
+
175  std::replace(token.begin(), token.end(), '.', ',');
+
176  token += "]";
+
177  }
+
178  header(idx++) = token;
+
179  }
+
180  return true;
+
181  }
+
182 
+
183  static bool read_adaptation(std::istream& in, stan_csv_adaptation& adaptation) {
+
184 
+
185  std::stringstream ss;
+
186  std::string line;
+
187  int lines = 0;
+
188 
+
189  if (in.peek() != '#' || in.good() == false)
+
190  return false;
+
191 
+
192  while (in.peek() == '#') {
+
193  std::getline(in, line);
+
194  ss << line << std::endl;
+
195  lines++;
+
196  }
+
197  ss.seekg(std::ios_base::beg);
+
198 
+
199  char comment; // Buffer for comment indicator, #
+
200 
+
201  // Skip first two lines
+
202  std::getline(ss, line);
+
203 
+
204  // Stepsize
+
205  std::getline(ss, line, '=');
+
206  boost::trim(line);
+
207  ss >> adaptation.step_size;
+
208 
+
209  // Metric parameters
+
210  std::getline(ss, line);
+
211  std::getline(ss, line);
+
212  std::getline(ss, line);
+
213 
+
214  int rows = lines - 3;
+
215  int cols = std::count(line.begin(), line.end(), ',') + 1;
+
216  adaptation.metric.resize(rows, cols);
+
217 
+
218  for (int row = 0; row < rows; row++) {
+
219 
+
220  std::stringstream line_ss;
+
221  line_ss.str(line);
+
222  line_ss >> comment;
+
223 
+
224  for (int col = 0; col < cols; col++) {
+
225  std::string token;
+
226  std::getline(line_ss, token, ',');
+
227  boost::trim(token);
+
228  adaptation.metric(row, col) = boost::lexical_cast<double>(token);
+
229  }
+
230 
+
231  std::getline(ss, line); // Read in next line
+
232 
+
233  }
+
234 
+
235  if (ss.good())
+
236  return false;
+
237  else
+
238  return true;
+
239 
+
240  }
+
241 
+
242  static bool read_samples(std::istream& in, Eigen::MatrixXd& samples, stan_csv_timing& timing) {
+
243 
+
244  std::stringstream ss;
+
245  std::string line;
+
246 
+
247  int rows = 0;
+
248  int cols = -1;
+
249 
+
250  if (in.peek() == '#' || in.good() == false)
+
251  return false;
+
252 
+
253  while (in.good()) {
+
254 
+
255  bool comment_line = (in.peek() == '#');
+
256  bool empty_line = (in.peek() == '\n');
+
257 
+
258  std::getline(in, line);
+
259 
+
260  if (empty_line) continue;
+
261  if (!line.length()) break;
+
262 
+
263  if (comment_line) {
+
264 
+
265  if (line.find("(Warm-up)") != std::string::npos) {
+
266  int left = 17;
+
267  int right = line.find(" seconds");
+
268  timing.warmup += boost::lexical_cast<double>(line.substr(left, right - left));
+
269  } else if (line.find("(Sampling)") != std::string::npos) {
+
270  int left = 17;
+
271  int right = line.find(" seconds");
+
272  timing.sampling += boost::lexical_cast<double>(line.substr(left, right - left));
+
273  }
+
274 
+
275  }
+
276  else {
+
277 
+
278  ss << line << '\n';
+
279 
+
280  int current_cols = std::count(line.begin(), line.end(), ',') + 1;
+
281  if (cols == -1) {
+
282  cols = current_cols;
+
283  } else if (cols != current_cols) {
+
284  std::cout << "Error: expected " << cols << " columns, but found "
+
285  << current_cols << " instead for row " << rows + 1 << std::endl;
+
286  return false;
+
287  }
+
288  rows++;
+
289 
+
290  }
+
291 
+
292  in.peek();
+
293 
+
294  }
+
295 
+
296  ss.seekg(std::ios_base::beg);
+
297 
+
298  if (rows > 0) {
+
299  samples.resize(rows, cols);
+
300  for (int row = 0; row < rows; row++) {
+
301  std::getline(ss, line);
+
302  std::stringstream ls(line);
+
303  for (int col = 0; col < cols; col++) {
+
304  std::getline(ls, line, ',');
+
305  boost::trim(line);
+
306  //std::cout << "line: !" << line << "@" << std::endl;
+
307  samples(row, col) = boost::lexical_cast<double>(line);
+
308  //std::cout << "after" << std::endl << std::endl;
+
309  }
+
310  }
+
311  }
+
312  return true;
+
313  }
+
314 
+
319  static stan_csv parse(std::istream& in) {
+
320 
+
321  stan_csv data;
+
322 
+
323  if (!read_metadata(in, data.metadata)) {
+
324  std::cout << "Warning: non-fatal error reading metadata" << std::endl;
+
325  }
+
326 
+
327  if (!read_header(in, data.header)) {
+
328  std::cout << "Error: error reading header" << std::endl;
+
329  throw std::invalid_argument("Error with header of input file in parse");
+
330  }
+
331 
+
332  if (!read_adaptation(in, data.adaptation)) {
+
333  std::cout << "Warning: non-fatal error reading adapation data" << std::endl;
+
334  }
+
335 
+
336  data.timing.warmup = 0;
+
337  data.timing.sampling = 0;
+
338 
+
339  if (!read_samples(in, data.samples, data.timing)) {
+
340  std::cout << "Warning: non-fatal error reading samples" << std::endl;
+
341  }
+
342 
+
343  return data;
+
344 
+
345  }
+
346 
+
347  };
+
348 
+
349  } // io
+
350 
+
351 } // stan
+
352 
+
353 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/stanc_8cpp.html b/doc/api/html/stanc_8cpp.html new file mode 100644 index 00000000000..90534c90449 --- /dev/null +++ b/doc/api/html/stanc_8cpp.html @@ -0,0 +1,158 @@ + + + + + +Stan: src/stan/command/stanc.cpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stanc.cpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + +

+Functions

int main (int argc, const char *argv[])
 The Stan compiler (stanc).
 
+

Function Documentation

+ +
+
+ + + + + + + + + + + + + + + + + + +
int main (int argc,
const char * argv[] 
)
+
+ +

The Stan compiler (stanc).

+
Parameters
+ + + +
argcNumber of arguments
argvArguments
+
+
+
Returns
0 for success, -1 for exception, -2 for parser failure, -3 for invalid arguments.
+ +

Definition at line 12 of file stanc.cpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/stanc_8cpp_source.html b/doc/api/html/stanc_8cpp_source.html new file mode 100644 index 00000000000..bcd554dd75a --- /dev/null +++ b/doc/api/html/stanc_8cpp_source.html @@ -0,0 +1,115 @@ + + + + + +Stan: src/stan/command/stanc.cpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stanc.cpp
+
+
+Go to the documentation of this file.
+
2 
+
12 int main(int argc, const char* argv[]) {
+
13  return stanc_helper(argc,argv,&std::cout,&std::cerr);
+
14 }
+
15 
+
16 
+
17 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/stanc__helper_8hpp.html b/doc/api/html/stanc__helper_8hpp.html new file mode 100644 index 00000000000..a80cc132fe1 --- /dev/null +++ b/doc/api/html/stanc__helper_8hpp.html @@ -0,0 +1,239 @@ + + + + + +Stan: src/stan/command/stanc_helper.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stanc_helper.hpp File Reference
+
+
+
#include <stan/version.hpp>
+#include <stan/gm/compiler.hpp>
+#include <exception>
+#include <fstream>
+#include <iostream>
+#include <stdexcept>
+#include <string>
+#include <stan/io/cmd_line.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + + + + +

+Functions

void print_version (std::ostream *out_stream)
 
void print_stanc_help (std::ostream *out_stream)
 Prints the Stan compiler (stanc) help.
 
void delete_file (std::ostream *err_stream, const std::string &file_name)
 
int stanc_helper (int argc, const char *argv[], std::ostream *out_stream, std::ostream *err_stream)
 
+

Function Documentation

+ +
+
+ + + + + + + + + + + + + + + + + + +
void delete_file (std::ostream * err_stream,
const std::string & file_name 
)
+
+ +

Definition at line 55 of file stanc_helper.hpp.

+ +
+
+ +
+
+ + + + + + + + +
void print_stanc_help (std::ostream * out_stream)
+
+ +

Prints the Stan compiler (stanc) help.

+ +

Definition at line 26 of file stanc_helper.hpp.

+ +
+
+ +
+
+ + + + + + + + +
void print_version (std::ostream * out_stream)
+
+ +

Definition at line 12 of file stanc_helper.hpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
int stanc_helper (int argc,
const char * argv[],
std::ostream * out_stream,
std::ostream * err_stream 
)
+
+ +

Definition at line 65 of file stanc_helper.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/stanc__helper_8hpp_source.html b/doc/api/html/stanc__helper_8hpp_source.html new file mode 100644 index 00000000000..4c8c4aa9b12 --- /dev/null +++ b/doc/api/html/stanc__helper_8hpp_source.html @@ -0,0 +1,284 @@ + + + + + +Stan: src/stan/command/stanc_helper.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stanc_helper.hpp
+
+
+Go to the documentation of this file.
1 #include <stan/version.hpp>
+
2 #include <stan/gm/compiler.hpp>
+
3 
+
4 #include <exception>
+
5 #include <fstream>
+
6 #include <iostream>
+
7 #include <stdexcept>
+
8 #include <string>
+
9 
+
10 #include <stan/io/cmd_line.hpp>
+
11 
+
12 void print_version(std::ostream* out_stream) {
+
13  if (!out_stream) return;
+
14  *out_stream << "stanc version "
+ +
16  << "."
+ +
18  << "."
+ +
20  << std::endl;
+
21 }
+
22 
+
26 void print_stanc_help(std::ostream* out_stream) {
+ +
28 
+
29  if (!out_stream) return;
+
30 
+
31  *out_stream << std::endl;
+
32  print_version(out_stream);
+
33  *out_stream << std::endl;
+
34 
+
35  *out_stream << "USAGE: " << "stanc [options] <model_file>" << std::endl;
+
36  *out_stream << std::endl;
+
37 
+
38  *out_stream << "OPTIONS:" << std::endl;
+
39  *out_stream << std::endl;
+
40 
+
41  print_help_option(out_stream,"help","","Display this information");
+
42 
+
43  print_help_option(out_stream,"version","","Display stanc version number");
+
44 
+
45  print_help_option(out_stream,"name","string",
+
46  "Model name",
+
47  "default = \"$model_filename_model\"");
+
48 
+
49  print_help_option(out_stream,"o","file",
+
50  "Output file for generated C++ code",
+
51  "default = \"$name.cpp\"");
+
52 
+
53 }
+
54 
+
55 void delete_file(std::ostream* err_stream,
+
56  const std::string& file_name) {
+
57  int deleted = std::remove(file_name.c_str());
+
58  if (deleted != 0 && file_name.size() > 0)
+
59  if (err_stream)
+
60  std::cerr << "Could not remove output file=" << file_name
+
61  << std::endl;
+
62 }
+
63 
+
64 
+
65 int stanc_helper(int argc, const char* argv[],
+
66  std::ostream* out_stream, std::ostream* err_stream) {
+
67  static const int SUCCESS_RC = 0;
+
68  static const int EXCEPTION_RC = -1;
+
69  static const int PARSE_FAIL_RC = -2;
+
70  static const int INVALID_ARGUMENT_RC = -3;
+
71 
+
72  std::string out_file_name; // declare outside of try to delete in catch
+
73 
+
74  try {
+
75 
+
76  stan::io::cmd_line cmd(argc,argv);
+
77 
+
78  if (cmd.has_flag("help")) {
+
79  print_stanc_help(out_stream);
+
80  return SUCCESS_RC;
+
81  }
+
82 
+
83  if (cmd.has_flag("version")) {
+
84  print_version(out_stream);
+
85  return SUCCESS_RC;
+
86  }
+
87 
+
88  if (cmd.bare_size() != 1) {
+
89  std::string msg("Require model file as argument. ");
+
90  throw std::invalid_argument(msg);
+
91  }
+
92  std::string in_file_name;
+
93  cmd.bare(0,in_file_name);
+
94  std::fstream in(in_file_name.c_str());
+
95 
+
96  std::string model_name;
+
97  if (cmd.has_key("name")) {
+
98  cmd.val("name",model_name);
+
99  } else {
+
100  size_t slashInd = in_file_name.rfind('/');
+
101  size_t ptInd = in_file_name.rfind('.');
+
102  if (ptInd == std::string::npos)
+
103  ptInd = in_file_name.length();
+
104  if (slashInd == std::string::npos) {
+
105  slashInd = in_file_name.rfind('\\');
+
106  }
+
107  if (slashInd == std::string::npos) {
+
108  slashInd = 0;
+
109  } else {
+
110  slashInd++;
+
111  }
+
112  model_name = in_file_name.substr(slashInd,ptInd - slashInd) + "_model";
+
113  for (std::string::iterator strIt = model_name.begin();
+
114  strIt != model_name.end(); strIt++) {
+
115  if (!isalnum(*strIt) && *strIt != '_') {
+
116  *strIt = '_';
+
117  }
+
118  }
+
119  }
+
120 
+
121  if (cmd.has_key("o")) {
+
122  cmd.val("o",out_file_name);
+
123  } else {
+
124  out_file_name = model_name;
+
125  out_file_name += ".cpp";
+
126  }
+
127 
+
128  if (!isalpha(model_name[0]) && model_name[0] != '_') {
+
129  std::string msg("model_name must not start with a number or symbol other than _");
+
130  throw std::invalid_argument(msg);
+
131  }
+
132  for (std::string::iterator strIt = model_name.begin();
+
133  strIt != model_name.end(); strIt++) {
+
134  if (!isalnum(*strIt) && *strIt != '_') {
+
135  std::string msg("model_name must contain only letters, numbers and _");
+
136  throw std::invalid_argument(msg);
+
137  }
+
138  }
+
139 
+
140  stan::gm::program prog;
+
141  std::fstream out(out_file_name.c_str(),
+
142  std::fstream::out);
+
143  if (out_stream) {
+
144  *out_stream << "Model name=" << model_name << std::endl;
+
145  *out_stream << "Input file=" << in_file_name << std::endl;
+
146  *out_stream << "Output file=" << out_file_name << std::endl;
+
147  }
+
148  bool include_main = !cmd.has_flag("no_main");
+
149  bool valid_model
+
150  = stan::gm::compile(err_stream,in,out,model_name,include_main,in_file_name);
+
151  out.close();
+
152  if (!valid_model) {
+
153  if (err_stream)
+
154  *err_stream << "PARSING FAILED." << std::endl;
+
155  delete_file(out_stream,out_file_name); // FIXME: how to remove triple cut-and-paste?
+
156  return PARSE_FAIL_RC;
+
157  }
+
158  } catch (const std::invalid_argument& e) {
+
159  if (err_stream) {
+
160  *err_stream << std::endl
+
161  << e.what()
+
162  << std::endl;
+
163  *err_stream << "Execute \"stanc --help\" for more information"
+
164  << std::endl;
+
165  delete_file(out_stream,out_file_name);
+
166  }
+
167  return INVALID_ARGUMENT_RC;
+
168  } catch (const std::exception& e) {
+
169  if (err_stream) {
+
170  *err_stream << std::endl
+
171  << e.what()
+
172  << std::endl;
+
173  }
+
174  delete_file(out_stream,out_file_name);
+
175  return EXCEPTION_RC;
+
176  }
+
177 
+
178  return SUCCESS_RC;
+
179 }
+
180 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/stanlogo-main.png b/doc/api/html/stanlogo-main.png new file mode 100644 index 0000000000000000000000000000000000000000..93988f5dd4cb4fb6fab854a3b15b5092092c6440 GIT binary patch literal 7353 zcmWkyWmFYS7~U)0-63(MySux)J4KO}6u5MVgeWO3UDDE*25FEkX^;{wNJxD9?V0$o zd){+q=Be2@9W7-XOiD}u0B}@Q6!gGZ=l_n53XX{c7uDc|;h|#c4FFg~|91$G^@SV& zFtuIe<#lvky8F0$zjXJYQ^-DSRSlB0ZcRdnx zIz74fFya&@HhK(vwOIOsB@*2p0!2k+s^R=tq{Kv60*NjMc0A@H+75kTVnk7F{EvT| zK}E0UJFfS}ADb4W_Nx#%4U=eabnG-0eqBKrcDWoa!LNv+{=v;1E}1Y)s0V!*?77HDKYi7fFsAHb+e#>QAKwyy&xKE0RIy#IPkO@qbD**^#D3Hz@r-*#R?z?0XD;ojQ&7mCP1uoVJvaZ zUW32S2JTd5y+kWiR58pPozoM|*qDo!WkQvVomj~BnQfK~S8qTj1z(r|-Y>)$0OY5T zfU8A3_)p;0OiTzRHse}z{_aM7Vz9H@e%zg`^pF97O`nkIM-J`=N|-n*?9F50i&Ny6 zR#^FOuirb>Q~nmG>p$OOd0v+SMS)RMlto|M~q0j)x9L;`xdOHdzx8>epS0x6E@;)T|&=9g{%Yw zUok_R+(*`d7c)-|TN@nzkfb&Qfp4#*AVDddWtR3xf7O}sO?=>6*8p(Q?%wm01sw_Y zGGcSm@99kXK{@{g0CQ6P=m`K;3Q#VC9}Ut&=m4OQAIA1gmg=&HoCA(Z-Gj2)gLQ8s z6e$Po@0G)s!*qaAd)cs7h0C!-kAI_Kv*G?JLn8p!eHoqVfy>ov_#Ic$1MkijJ-3IY zBMbvsb{L(=mVP-FVi#}1n21i68FfS7qk>HM9!fV7ORUSFo+7Bis~2xTXQ)DRA?fu@ zG{!=yEk%47;0wQx?oj6a6jrY*`4hWIzO_u4GE%7!Ys$fgH!F!WKYPlnky0{2s9=Ap z@+IDKl9c=q5Bz`}jlbWOhikA;u1a**D@sOiDTR?@9F?D3w;dMQl=qC<3_Ti|V zoSnWM{vE0v`U`W+96K4$uQ&QzEP6j)sZs3W?+WaqI%e?68Wv^gt(6rR5C|rj$yFCL z>(%PUlo1KM%@Q4tAXQZ_t}gsMOZk%Q<+V%gflnL3+Gkp=^eN++(L?2f^aG?zKWv<6 zl8B*LXBLWVax`*h3P1AN42=?s+4mGf20X&NM;ZH>c$w~oCTz`Y??_U9V18En%=DRx zjoYBSqNHNI0?QC#IBJkoZlxbwqh!dhzg>>;Gp*9FB1h*)pGx1kT)Zr%!nw@dK>BNl z=|dcSmY!x(sZyz1 zseIHaRC7|AQ_`u}Zu&0_S9VB^*@9WwIcWkVXJ3Cwf2|a=lvGnv?5c*V;&m}qLA!!q zw_E9HMsAlCELX$5bUmPR|BgDC`@!Jh&0Xo0GPVh712zsgGEfJO!Q3Zn!hzqv-C7uOIS<9 zHN-WB#>d7B$LBKzvn6>K`1Z5+vlp^AT5Qbx%{ZFNn!h`$*6)~=n4UIwxJ8+XniiWF znprj|Rp(T{m~XFcFC{2#)k@W>%$;}c`*z+u(p=s`@ojezb)}~HO>?lVvmKdp%Ro)v zX=-O`a9i+)2T3%Xm?hjw8Z(*@??x|TF(a|{tcfqD(!m3lX@}g-CX@J+i~QToM5CfxhY=~7(TRD)~7ojYniSDu!efiqV**$vsfCuJ+Or$VPL zr!lK}V*+`sxu*QyQ+>nozjSw}rLpop^Ss`u3elF=4s&kWXXLi$PBE@t_|{VFS8;87 zMke)F$}4YMYFk2hop0ULdQ2GJGTbt%-RGWb9kn4J%J}5)6!oRQ+fWW&s# z{ksW#N8g<&Ew}G==qSXI^d5T23`VHmM4(R}#y@ zZ31o5gIrFgV{;}sCaSLL)S_H$H9~H#T^si&h?uRMEv)SzvJCEFOOJqpiQdboQqpoR zLJqMs8I4#ikxzeQ@!85q6JA^p`MpTQ4Ctllb!On67MhM-l(%4`)w)n&(+vE0oYEl} z03F~j=GbkGWG+wc(7@4H%NENe&GMyt!zU@$$s6%8CD~K1f?hMV+4;Bgo|Errm19)> zYW{pow~>4eu$=3=CY5Uj5YjNNf!Qc zmiKf**h{$ivAH-}-I$ZcWUsU8m1w<$XTS>PHVF!Qv=M5R#P|4Swl{Oyl_$pOH6fi$ zfts(wta^Tg_cTFXA7L3{?nVV4tuCBcYMXGIZZz56MdwgSk;KK<5U-G>lY}m^torX# z#kl|I&RqS}SYFxR>M-dv<8-*U&Y5eDn^uv&myYX(v$WiZvtiVDa`jhng*$zmWu-l$ zS-!QXTjG0%W9i7mxVW^zSA$D~I|HH9nYAX{g&Vi&Q>vhjzXHc|E9M>74^kstD~1q5 z%{iwz$A7B-8m^^l;wlbr(*C`%tk!ztc`}4FgYu3El zw=-|k9+R4$|Gge~ue|ac?~8zhX@DBSV8mtlFnl)E`C>95=W|YQ2-oeZ%}QZ&(7ye| z#w$Gcvo?I6%^Ag~_xs`<;u97Z-+eCXS9XbvzZ+-Oidnz;?ekmWF?CjZsQpWOR!ytL z>(qDws;fb}&&VX~$r}?>DQOUJVM4v^TWhw`;s5?X?2Ho zhxMh*iR_a6TFjiZ`Qz&1*=p!3xL-bEdR6%vH7a8AG36==PaY*HGifv$C;BK?L`qb2 zOWNz<@V-=j(qWP*m+Z0dakPevlsn{R?r33RI%B#Z{USZJ`^~%Jhu`ocirSUI-a*=~ z5r2MOt4pJQCp~_vel%xA8+h6~@908Vo?hP8UFlDi{!67uO?^T}%0S%P^K-6%d6Ujw zMNbm|0$%_CECK*-pTPML0N(Ndz;7D>5X%4nGWUC`$N!EbVQ=5K=lEm&CveCV8*hLi~j7xafwiNNj4K@JFhC$?0DT$ zMn82na?#6I!j_Na#{&CIZ8ecJ9=ad2?_D6pgZN7Khm zjVeiKlhBZ5W$=-8h@<}e@#ybovGnxJ+Ac3&PHSxREFKwQeTq#;D1&&6dhyzQMaZ0pWD8{eYW1W46z7B3(nl z3fm&zIIwc}2}nqyR##W`{Wc``XT!t8Ply#WyU73{AtA||-SmGU-uM0ivc~B&gmK7( zaSp?0eFzB&T0E7H3T9?mw&z=lPl7>zkNs3W3T&hRzP@HpE(*LE*N$KhRpVzKEP(ZC<4ILGpK2+|~0Q4vLb5o12^YyjtJ&!`gMh z`YiEswwoQb#?@w5N3pSgvQ{W%(nlpvAFek-|5es@aeZZZWuozxr)%cWN3L?t?0M*Y z9W#^0@ZCW(^3+RL^PA<@E9=$e<#EO=#FB*v)uc&7NaY6c%FivY2k&pAo}R&jRsjFQ zk2Nok=F^`R9Qa0dy>8!RUwToaA^YS%3Zdb?OF& z(+XKEUncQc_ft>BY^nB>6BGiKy8p9%&Bk8Y*y0UG|Gle9C^5M`F1)esDwJKChz{G` z-H<#VAZtHmLMP-H-O?h9wzc8QJUCg|2%-Y`s{k{Ow6V2zb*nGD_F_(xxp6l){{9lV z;ww?hqmlu<`VRJg;t^-<^N=L==5!ihBE(c01v)HF0S$s-O7Yf$uO z$gljF%T-8i#2(jkqt24xI-(;_KHs6*Wq%UuX*z04+#PCVg=;Gqb7HRqTiY z6efKtG4W~-v7BTTC}f!xy*Ji{U32!O`x!iiQCWzXghW#66Y$8Ap^8O1HdG)VVkh zQqE;)ii%k@1Ln}PVVo-F027WhS|Ub8y)#}Rq7TKGTS?*FQd(bv}}ARyp{;s&pN_mq5R;N``apk$8+n5GTfT^$t|RZdM! z!3GDFzDSr(SK^&;57?2T&dmunbXd7d^zjVJB7tYU8yJijOGv=>tg5KM1erjrNYB9V zjEu`d#&AwlBiF)1&_Y?6k&6qLS=$JHvW^O#!)LXqvN9G2CnuR=y{iD}Obya}&CE;+ z$-RWi)J#~~_=XaJ4N<=`N9fn$ z;(~$#Ssz|d`Ab~N=3aqqXLolK)L+{=i$l-OySuw~x%gg9O-=7LH*LVq)6)~8n^xk| z*w|QDxJArm@f|&)$7B2qIh}8K*NcT16Kv-%Ow;7m)G(nRbD!LOd;|!Ih$1SwU9$ey zSjj!#quXJ_-l!9F8>^82`g;6ZrPg<@sDo{cJVd3oovKAOr zm6rhbg*6c}?cw3!mZ!5bGkUm;fdMf0?#m2hUWO*gqF-$di8G&c(%L?b(8;MTZGH zt+SI8vgO~Xs3_ahRnb5GsDsNOkz@MkF)(Ce`Z68sOl(^GP!hDW1Tf5-U3h{+6nBW?H%HnV7_8knh4CO~UEI+0cg{ ztx6gihysK4lQ!(^KKXCOS^rvc&Xd*B60+bjp5p##{g|GdjGwFynr&g-`5k|m0bBpj zYq#HMoTOOyr^>~Y5vC1JI3`%~Oa^Oi!X{}0pw0jLlA4|#v!54=nwc6EjG{{~A~eg9(x(i3kak6Hi*vIx5`zp)Y9xBa2y(Qf1; zLzUG7e#iP$;9Q7D8wwwYv5ax!scBD1%O5{}{9Z7mmhjg}_#PJ*mmw7_w(5303}H#J zs1{jX5&r`&6^cLL+I%onK2j6&_j+;| zu#wo=*Xk#U<=_I4+(CsA_zzJ^L<`O~bm*{c|KpVwYwFoo`aHpRKHn`KUKivY z<6y{qRx>=|9t2_7e&#l0?%s)0Ik&toy0o;UqNzz^P!zW<0%c~7t8DYnRetk^#w0Cj z;Yc3TN|}#e($Yd^{|!6neUS=AZE9*-tJ(=+A&$=nu(7bPaNv=Vk@Kfrakk{(wxEMJ z`_TP(RcX~Hp_no}K2E{Ie1KLJ1bB+&=u{eloW^t-&x+gG`2@i08<>opu`c# z%HEHFs`j4v+E34R$Zf^uFkKZpuhkME-&v7U@m>c;m_^6n_m$$ zki#&8K*2yfX!19X_us#pC@3qV1>-8}s%UGUEo}U7;G>ofp-$&IM0LQSpx9QIf0j&# zev+#F$QH8FEWJ5rY&}@-I2yR43qrH0i3AiN`YR@rG(|NvwLC$tAx{qx>VxBB?C+0} z7)0T0qhL7nJy|BXY)GIex_H&Jyj`GoXK8C|s|DB^&t}D1Jx|;Z@Ok?dB>_iiW~Sz! zbo*Ljj(9hG&TKWYh70Z3m&)G?zBkStTdt*~gxcHJw+W{9xn3e>t-`i8R8i3-;b0>$ z0#;Qe@PkFK3Z5;Z=TpEaflohPru;b$u@8OzUHoX&(_-rV7>X>+fK5>?zS;cIIB9Du z$A(`^NKsLc&IEY-)u#@Tr-ou}tb_NQ*QI(ml zvxjh=9`|~BbU6(#2;8Y*>tZ+2YCO4+W%0zf<8sEx=dI|}^fV-<4-!tNV`MaM-!miA zf8ty8&10SZgOa}3CxEtdPh;e?%VD{3-MAmTM-irTXBX%U{~O=DC$Qj3XXNKUGP~XD zU26F3A@U{o6$oIFx4#9@!_fh@Pf`ha7}oU;BP9?+ZP{19Oo7`6&CA<&B0dK?wI%!R zFa2u0P18si{XIQ-IY_ZIN_Gux^43Q3a)~YnYr|#>mMo3 z3ZXRytQ#p~ZXvS1-u?!WXN@F_-+4zHPWS67a1&9NUslO(h&JOy&9y0lE1+pVTS7)l zDa>`13L&DCoj^eR$>IAziO*Bdu9xl8BN7YOI_sWe@NMuTT5TRnwQOBJq?tjmW$i z#<9tkj%R{GC1&U6o8xSueo%k!y;Z|@kj#15q#Yqk8IN8qL8q-jh-jSdyBs=nzn@kF zF@0g61J1iG{^{=|R?L!Xolia{i&SL z8;CewYB+4UuqP6ZAKg^~@kkrsaFP~)I1Rv+Z(IuM{awpwYg1>JzTHXPpZFr0P4PRhrzfLwR{&Co{blhU^CuSZOfcJU^^$ndaoI=4WGLI|X%MEcn9*O;e%l4>qQ_ zP*vnhDbOR#uV46hwNg`lDB%|ml3V&&uCETd81+XL=s4r8TtDYMcKuJ+<{becp^38E z+Ps-nSMrVN>4N%|lXABf^(};@_Si#vBIrJ>OiY7W$@rm0m2&y1oIaQtcdUb(XZ_O2~e^@F*~4DZwCJj0ji2x3N>;z;r{{FOx(8s literal 0 HcmV?d00001 diff --git a/doc/api/html/statement__2__grammar_8hpp.html b/doc/api/html/statement__2__grammar_8hpp.html new file mode 100644 index 00000000000..dc445684e6e --- /dev/null +++ b/doc/api/html/statement__2__grammar_8hpp.html @@ -0,0 +1,137 @@ + + + + + +Stan: src/stan/gm/grammars/statement_2_grammar.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
statement_2_grammar.hpp File Reference
+
+
+
#include <string>
+#include <sstream>
+#include <vector>
+#include <boost/spirit/include/qi.hpp>
+#include <stan/gm/ast.hpp>
+#include <stan/gm/grammars/whitespace_grammar.hpp>
+#include <stan/gm/grammars/expression_grammar.hpp>
+#include <stan/gm/grammars/var_decls_grammar.hpp>
+
+

Go to the source code of this file.

+ + + + + + +

+Classes

struct  statement_grammar< Iterator >
 
struct  stan::gm::statement_2_grammar< Iterator >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/statement__2__grammar_8hpp_source.html b/doc/api/html/statement__2__grammar_8hpp_source.html new file mode 100644 index 00000000000..ec692793644 --- /dev/null +++ b/doc/api/html/statement__2__grammar_8hpp_source.html @@ -0,0 +1,169 @@ + + + + + +Stan: src/stan/gm/grammars/statement_2_grammar.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
statement_2_grammar.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__PARSER__STATEMENT_2_GRAMMAR__HPP__
+
2 #define __STAN__GM__PARSER__STATEMENT_2_GRAMMAR__HPP__
+
3 
+
4 #include <string>
+
5 #include <sstream>
+
6 #include <vector>
+
7 
+
8 #include <boost/spirit/include/qi.hpp>
+
9 
+
10 #include <stan/gm/ast.hpp>
+ + + +
14 
+
15 namespace stan {
+
16 
+
17  namespace gm {
+
18 
+
19  template <typename Iterator>
+ +
21 
+
22  template <typename Iterator>
+ +
24  : boost::spirit::qi::grammar<Iterator,
+
25  statement(bool,var_origin),
+
26  whitespace_grammar<Iterator> > {
+
27 
+
28 
+
29 
+ +
31  std::stringstream& error_msgs,
+ +
33 
+
34 
+
35  // global info for parses
+ +
37  std::stringstream& error_msgs_;
+
38 
+
39  // grammars
+ + +
42 
+
43  // rules
+
44 
+
45  boost::spirit::qi::rule<Iterator,
+ + + +
49 
+
50 
+
51  boost::spirit::qi::rule<Iterator,
+
52  statement(bool,var_origin),
+ + +
55 
+
56  };
+
57 
+
58 
+
59  }
+
60 }
+
61 
+
62 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/statement__2__grammar__def_8hpp.html b/doc/api/html/statement__2__grammar__def_8hpp.html new file mode 100644 index 00000000000..af5dbe8611e --- /dev/null +++ b/doc/api/html/statement__2__grammar__def_8hpp.html @@ -0,0 +1,178 @@ + + + + + +Stan: src/stan/gm/grammars/statement_2_grammar_def.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
statement_2_grammar_def.hpp File Reference
+
+
+
#include <cstddef>
+#include <iomanip>
+#include <iostream>
+#include <istream>
+#include <map>
+#include <set>
+#include <sstream>
+#include <string>
+#include <utility>
+#include <vector>
+#include <stdexcept>
+#include <boost/spirit/include/qi.hpp>
+#include <boost/spirit/include/phoenix_core.hpp>
+#include <boost/spirit/include/phoenix_function.hpp>
+#include <boost/spirit/include/phoenix_fusion.hpp>
+#include <boost/spirit/include/phoenix_object.hpp>
+#include <boost/spirit/include/phoenix_operator.hpp>
+#include <boost/spirit/include/phoenix_stl.hpp>
+#include <boost/lexical_cast.hpp>
+#include <boost/fusion/include/adapt_struct.hpp>
+#include <boost/fusion/include/std_pair.hpp>
+#include <boost/config/warning_disable.hpp>
+#include <boost/spirit/include/qi_numeric.hpp>
+#include <boost/spirit/include/classic_position_iterator.hpp>
+#include <boost/spirit/include/support_multi_pass.hpp>
+#include <boost/tuple/tuple.hpp>
+#include <boost/variant/apply_visitor.hpp>
+#include <boost/variant/recursive_variant.hpp>
+#include <stan/gm/ast.hpp>
+#include <stan/gm/grammars/whitespace_grammar.hpp>
+#include <stan/gm/grammars/expression_grammar.hpp>
+#include <stan/gm/grammars/var_decls_grammar.hpp>
+#include <stan/gm/grammars/statement_grammar.hpp>
+#include <stan/gm/grammars/statement_2_grammar.hpp>
+#include <stan/gm/grammars/common_adaptors_def.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + + + +

+Classes

struct  stan::gm::add_conditional_condition
 
struct  stan::gm::add_conditional_condition::result< T1, T2, T3 >
 
struct  stan::gm::add_conditional_body
 
struct  stan::gm::add_conditional_body::result< T1, T2 >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+ + + + + +

+Variables

boost::phoenix::function
+< add_conditional_condition > 
stan::gm::add_conditional_condition_f
 
boost::phoenix::function
+< add_conditional_body > 
stan::gm::add_conditional_body_f
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/statement__2__grammar__def_8hpp_source.html b/doc/api/html/statement__2__grammar__def_8hpp_source.html new file mode 100644 index 00000000000..3db118a2320 --- /dev/null +++ b/doc/api/html/statement__2__grammar__def_8hpp_source.html @@ -0,0 +1,252 @@ + + + + + +Stan: src/stan/gm/grammars/statement_2_grammar_def.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
statement_2_grammar_def.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__PARSER__STATEMENT_2_GRAMMAR_DEF__HPP__
+
2 #define __STAN__GM__PARSER__STATEMENT_2_GRAMMAR_DEF__HPP__
+
3 
+
4 #include <cstddef>
+
5 #include <iomanip>
+
6 #include <iostream>
+
7 #include <istream>
+
8 #include <map>
+
9 #include <set>
+
10 #include <sstream>
+
11 #include <string>
+
12 #include <utility>
+
13 #include <vector>
+
14 #include <stdexcept>
+
15 
+
16 #include <boost/spirit/include/qi.hpp>
+
17 // FIXME: get rid of unused include
+
18 #include <boost/spirit/include/phoenix_core.hpp>
+
19 #include <boost/spirit/include/phoenix_function.hpp>
+
20 #include <boost/spirit/include/phoenix_fusion.hpp>
+
21 #include <boost/spirit/include/phoenix_object.hpp>
+
22 #include <boost/spirit/include/phoenix_operator.hpp>
+
23 #include <boost/spirit/include/phoenix_stl.hpp>
+
24 
+
25 #include <boost/lexical_cast.hpp>
+
26 #include <boost/fusion/include/adapt_struct.hpp>
+
27 #include <boost/fusion/include/std_pair.hpp>
+
28 #include <boost/config/warning_disable.hpp>
+
29 #include <boost/spirit/include/qi.hpp>
+
30 #include <boost/spirit/include/qi_numeric.hpp>
+
31 #include <boost/spirit/include/classic_position_iterator.hpp>
+
32 #include <boost/spirit/include/phoenix_core.hpp>
+
33 #include <boost/spirit/include/phoenix_function.hpp>
+
34 #include <boost/spirit/include/phoenix_fusion.hpp>
+
35 #include <boost/spirit/include/phoenix_object.hpp>
+
36 #include <boost/spirit/include/phoenix_operator.hpp>
+
37 #include <boost/spirit/include/phoenix_stl.hpp>
+
38 #include <boost/spirit/include/support_multi_pass.hpp>
+
39 #include <boost/tuple/tuple.hpp>
+
40 #include <boost/variant/apply_visitor.hpp>
+
41 #include <boost/variant/recursive_variant.hpp>
+
42 
+
43 #include <stan/gm/ast.hpp>
+ + + + + + +
50 
+
51 
+
52 namespace stan {
+
53 
+
54  namespace gm {
+
55 
+
56 
+
57 
+ +
59  template <typename T1, typename T2, typename T3>
+
60  struct result { typedef bool type; };
+ +
62  const expression& e,
+
63  std::stringstream& error_msgs) const {
+
64  if (!e.expression_type().is_primitive()) {
+
65  error_msgs << "conditions in if-else statement must be primitive int or real;"
+
66  << " found type=" << e.expression_type() << std::endl;
+
67  return false;
+
68  }
+
69  cs.conditions_.push_back(e);
+
70  return true;
+
71  }
+
72  };
+
73  boost::phoenix::function<add_conditional_condition> add_conditional_condition_f;
+
74 
+ +
76  template <typename T1, typename T2>
+
77  struct result { typedef void type; };
+ +
79  const statement& s) const {
+
80  cs.bodies_.push_back(s);
+
81  }
+
82  };
+
83  boost::phoenix::function<add_conditional_body> add_conditional_body_f;
+
84 
+
85 
+
86 
+
87  template <typename Iterator>
+ +
89  std::stringstream& error_msgs,
+ +
91  : statement_2_grammar::base_type(statement_2_r),
+
92  var_map_(var_map),
+
93  error_msgs_(error_msgs),
+
94  expression_g(var_map,error_msgs),
+
95  statement_g(sg)
+
96  {
+
97  using boost::spirit::qi::_1;
+
98  using boost::spirit::qi::char_;
+
99  using boost::spirit::qi::lit;
+
100  using boost::spirit::qi::_pass;
+
101  using boost::spirit::qi::_val;
+
102 
+
103  using boost::spirit::qi::labels::_r1;
+
104  using boost::spirit::qi::labels::_r2;
+
105 
+
106  // _r1 true if sample_r allowed (inherited)
+
107  // _r2 source of variables allowed for assignments
+
108  // set to true if sample_r are allowed
+
109  statement_2_r.name("statement");
+ +
111  %= conditional_statement_r(_r1,_r2)
+
112  ;
+
113 
+
114 
+
115  conditional_statement_r.name("if-else statement");
+ +
117  = lit("if")
+
118  > lit('(')
+
119  > expression_g(_r2)
+
120  [_pass = add_conditional_condition_f(_val,_1,
+
121  boost::phoenix::ref(error_msgs_))]
+
122  > lit(')')
+
123  > statement_g(_r1,_r2)
+
124  [add_conditional_body_f(_val,_1)]
+
125  > * (( lit("else")
+
126  >> lit("if") )
+
127  > lit('(')
+
128  > expression_g(_r2)
+
129  [_pass = add_conditional_condition_f(_val,_1,
+
130  boost::phoenix::ref(error_msgs_))]
+
131  > lit(')')
+
132  > statement_g(_r1,_r2)
+
133  [add_conditional_body_f(_val,_1)]
+
134  )
+
135  > - (lit("else")
+
136  > statement_g(_r1,_r2)
+
137  [add_conditional_body_f(_val,_1)]
+
138  )
+
139  ;
+
140 
+
141  }
+
142 
+
143  }
+
144 }
+
145 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/statement__2__grammar__inst_8cpp.html b/doc/api/html/statement__2__grammar__inst_8cpp.html new file mode 100644 index 00000000000..d36d5ba9579 --- /dev/null +++ b/doc/api/html/statement__2__grammar__inst_8cpp.html @@ -0,0 +1,123 @@ + + + + + +Stan: src/stan/gm/grammars/statement_2_grammar_inst.cpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
statement_2_grammar_inst.cpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/statement__2__grammar__inst_8cpp_source.html b/doc/api/html/statement__2__grammar__inst_8cpp_source.html new file mode 100644 index 00000000000..bdba0b98db5 --- /dev/null +++ b/doc/api/html/statement__2__grammar__inst_8cpp_source.html @@ -0,0 +1,115 @@ + + + + + +Stan: src/stan/gm/grammars/statement_2_grammar_inst.cpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
statement_2_grammar_inst.cpp
+
+
+Go to the documentation of this file.
+ +
3 
+
4 namespace stan {
+
5  namespace gm {
+
6  template struct statement_2_grammar<pos_iterator_t>;
+
7  }
+
8 }
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/statement__grammar_8hpp.html b/doc/api/html/statement__grammar_8hpp.html new file mode 100644 index 00000000000..155be7627e3 --- /dev/null +++ b/doc/api/html/statement__grammar_8hpp.html @@ -0,0 +1,136 @@ + + + + + +Stan: src/stan/gm/grammars/statement_grammar.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
statement_grammar.hpp File Reference
+
+
+
#include <string>
+#include <sstream>
+#include <vector>
+#include <boost/spirit/include/qi.hpp>
+#include <stan/gm/ast.hpp>
+#include <stan/gm/grammars/whitespace_grammar.hpp>
+#include <stan/gm/grammars/expression_grammar.hpp>
+#include <stan/gm/grammars/var_decls_grammar.hpp>
+#include <stan/gm/grammars/statement_2_grammar.hpp>
+
+

Go to the source code of this file.

+ + + + +

+Classes

struct  stan::gm::statement_grammar< Iterator >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/statement__grammar_8hpp_source.html b/doc/api/html/statement__grammar_8hpp_source.html new file mode 100644 index 00000000000..dd1197db420 --- /dev/null +++ b/doc/api/html/statement__grammar_8hpp_source.html @@ -0,0 +1,264 @@ + + + + + +Stan: src/stan/gm/grammars/statement_grammar.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
statement_grammar.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__PARSER__STATEMENT_GRAMMAR__HPP__
+
2 #define __STAN__GM__PARSER__STATEMENT_GRAMMAR__HPP__
+
3 
+
4 #include <string>
+
5 #include <sstream>
+
6 #include <vector>
+
7 
+
8 #include <boost/spirit/include/qi.hpp>
+
9 
+
10 #include <stan/gm/ast.hpp>
+ + + + +
15 
+
16 namespace stan {
+
17 
+
18  namespace gm {
+
19 
+
20  template <typename Iterator>
+ +
22  : boost::spirit::qi::grammar<Iterator,
+
23  statement(bool,var_origin),
+
24  whitespace_grammar<Iterator> > {
+
25 
+
26 
+
27 
+ +
29  std::stringstream& error_msgs);
+
30 
+
31 
+
32  // global info for parses
+ +
34  std::stringstream& error_msgs_;
+
35 
+
36  // grammars
+ + + +
40 
+
41  // rules
+
42  boost::spirit::qi::rule<Iterator,
+ + + +
46 
+
47  boost::spirit::qi::rule<Iterator,
+ + + +
51 
+
52 
+
53  boost::spirit::qi::rule<Iterator,
+
54  std::vector<expression>(var_origin),
+ + +
57 
+
58 
+
59  boost::spirit::qi::rule<Iterator,
+ + + +
63 
+
64 
+
65  boost::spirit::qi::rule<Iterator,
+ + + +
69 
+
70  boost::spirit::qi::rule<Iterator,
+
71  boost::spirit::qi::locals<std::string>,
+ + + +
75 
+
76 
+
77  boost::spirit::qi::rule<Iterator,
+ + + +
81 
+
82 
+
83  boost::spirit::qi::rule<Iterator,
+ + + +
87 
+
88 
+
89  boost::spirit::qi::rule<Iterator,
+ + + +
93 
+
94  boost::spirit::qi::rule<Iterator,
+
95  std::string(),
+ + +
98 
+
99 
+
100  boost::spirit::qi::rule<Iterator,
+
101  std::string(),
+ + +
104 
+
105  boost::spirit::qi::rule<Iterator,
+
106  std::vector<var_decl>(),
+ + +
109 
+
110  boost::spirit::qi::rule<Iterator,
+
111  no_op_statement(),
+ + +
114 
+
115  boost::spirit::qi::rule<Iterator,
+
116  std::vector<expression>(var_origin),
+ + +
119 
+
120  boost::spirit::qi::rule<Iterator,
+
121  range(var_origin),
+ + +
124 
+
125  boost::spirit::qi::rule<Iterator,
+
126  sample(bool,var_origin),
+ + +
129 
+
130  boost::spirit::qi::rule<Iterator,
+
131  statement(bool,var_origin),
+ + +
134 
+
135  boost::spirit::qi::rule<Iterator,
+
136  boost::spirit::qi::locals<std::vector<var_decl> >,
+
137  statements(bool,var_origin),
+ + +
140 
+
141  boost::spirit::qi::rule<Iterator,
+
142  range(var_origin),
+ + +
145 
+
146  boost::spirit::qi::rule<Iterator,
+ + + +
150 
+
151  };
+
152 
+
153 
+
154  }
+
155 }
+
156 
+
157 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/statement__grammar__def_8hpp.html b/doc/api/html/statement__grammar__def_8hpp.html new file mode 100644 index 00000000000..63e7a70512a --- /dev/null +++ b/doc/api/html/statement__grammar__def_8hpp.html @@ -0,0 +1,408 @@ + + + + + +Stan: src/stan/gm/grammars/statement_grammar_def.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
statement_grammar_def.hpp File Reference
+
+
+
#include <cstddef>
+#include <iomanip>
+#include <iostream>
+#include <istream>
+#include <map>
+#include <set>
+#include <sstream>
+#include <string>
+#include <utility>
+#include <vector>
+#include <stdexcept>
+#include <boost/spirit/include/qi.hpp>
+#include <boost/spirit/include/phoenix_core.hpp>
+#include <boost/spirit/include/phoenix_function.hpp>
+#include <boost/spirit/include/phoenix_fusion.hpp>
+#include <boost/spirit/include/phoenix_object.hpp>
+#include <boost/spirit/include/phoenix_operator.hpp>
+#include <boost/spirit/include/phoenix_stl.hpp>
+#include <boost/lexical_cast.hpp>
+#include <boost/fusion/include/adapt_struct.hpp>
+#include <boost/fusion/include/std_pair.hpp>
+#include <boost/config/warning_disable.hpp>
+#include <boost/spirit/include/qi_numeric.hpp>
+#include <boost/spirit/include/classic_position_iterator.hpp>
+#include <boost/spirit/include/support_multi_pass.hpp>
+#include <boost/tuple/tuple.hpp>
+#include <boost/variant/apply_visitor.hpp>
+#include <boost/variant/recursive_variant.hpp>
+#include <stan/gm/ast.hpp>
+#include <stan/gm/grammars/whitespace_grammar.hpp>
+#include <stan/gm/grammars/expression_grammar.hpp>
+#include <stan/gm/grammars/var_decls_grammar.hpp>
+#include <stan/gm/grammars/statement_grammar.hpp>
+#include <stan/gm/grammars/common_adaptors_def.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Classes

struct  stan::gm::validate_assignment
 
struct  stan::gm::validate_assignment::result< T1, T2, T3, T4 >
 
struct  stan::gm::validate_sample
 
struct  stan::gm::validate_sample::result< T1, T2, T3 >
 
struct  stan::gm::expression_as_statement
 
struct  stan::gm::expression_as_statement::result< T1, T2, T3 >
 
struct  stan::gm::unscope_locals
 
struct  stan::gm::unscope_locals::result< T1, T2 >
 
struct  stan::gm::add_while_condition
 
struct  stan::gm::add_while_condition::result< T1, T2, T3 >
 
struct  stan::gm::add_while_body
 
struct  stan::gm::add_while_body::result< T1, T2 >
 
struct  stan::gm::add_loop_identifier
 
struct  stan::gm::add_loop_identifier::result< T1, T2, T3, T4 >
 
struct  stan::gm::remove_loop_identifier
 
struct  stan::gm::remove_loop_identifier::result< T1, T2 >
 
struct  stan::gm::validate_int_expr2
 
struct  stan::gm::validate_int_expr2::result< T1, T2 >
 
struct  stan::gm::validate_allow_sample
 
struct  stan::gm::validate_allow_sample::result< T1, T2 >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+ + + + + + + + + + + + + +

+Functions

 BOOST_FUSION_ADAPT_STRUCT (stan::gm::assignment,(stan::gm::variable_dims, var_dims_)(stan::gm::expression, expr_))
 
 BOOST_FUSION_ADAPT_STRUCT (stan::gm::variable_dims,(std::string, name_)(std::vector< stan::gm::expression >, dims_))
 
 BOOST_FUSION_ADAPT_STRUCT (stan::gm::distribution,(std::string, family_)(std::vector< stan::gm::expression >, args_))
 
 BOOST_FUSION_ADAPT_STRUCT (stan::gm::for_statement,(std::string, variable_)(stan::gm::range, range_)(stan::gm::statement, statement_))
 
 BOOST_FUSION_ADAPT_STRUCT (stan::gm::print_statement,(std::vector< stan::gm::printable >, printables_))
 
BOOST_FUSION_ADAPT_STRUCT(stan::gm::increment_log_prob_statement,(stan::gm::expression,
+log_prob_))
+BOOST_FUSION_ADAPT_STRUCT(stan 
BOOST_FUSION_ADAPT_STRUCT (stan::gm::statements,(std::vector< stan::gm::var_decl >, local_decl_)(std::vector< stan::gm::statement >, statements_))
 
+ + + + + + + + + + + + + + + + + + + + + +

+Variables

boost::phoenix::function
+< validate_assignment > 
stan::gm::validate_assignment_f
 
boost::phoenix::function
+< validate_sample > 
stan::gm::validate_sample_f
 
boost::phoenix::function
+< expression_as_statement > 
stan::gm::expression_as_statement_f
 
boost::phoenix::function
+< unscope_locals > 
stan::gm::unscope_locals_f
 
boost::phoenix::function
+< add_while_condition > 
stan::gm::add_while_condition_f
 
boost::phoenix::function
+< add_while_body > 
stan::gm::add_while_body_f
 
boost::phoenix::function
+< add_loop_identifier > 
stan::gm::add_loop_identifier_f
 
boost::phoenix::function
+< remove_loop_identifier > 
stan::gm::remove_loop_identifier_f
 
boost::phoenix::function
+< validate_int_expr2 > 
stan::gm::validate_int_expr2_f
 
boost::phoenix::function
+< validate_allow_sample > 
stan::gm::validate_allow_sample_f
 
+

Function Documentation

+ +
+
+ + + + + + + + + + + + + + + + + + +
BOOST_FUSION_ADAPT_STRUCT (stan::gm::assignment ,
(stan::gm::variable_dims, var_dims_)(stan::gm::expression, expr_)  
)
+
+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
BOOST_FUSION_ADAPT_STRUCT (stan::gm::variable_dims ,
(std::string, name_)(std::vector< stan::gm::expression >, dims_)  
)
+
+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
BOOST_FUSION_ADAPT_STRUCT (stan::gm::distribution ,
(std::string, family_)(std::vector< stan::gm::expression >, args_)  
)
+
+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
BOOST_FUSION_ADAPT_STRUCT (stan::gm::for_statement ,
(std::string, variable_)(stan::gm::range, range_)(stan::gm::statement, statement_)  
)
+
+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
BOOST_FUSION_ADAPT_STRUCT (stan::gm::print_statement ,
(std::vector< stan::gm::printable >, printables_)  
)
+
+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
BOOST_FUSION_ADAPT_STRUCT (stan::gm::increment_log_prob_statement, (stan::gm::expression, log_prob_)) BOOST_FUSION_ADAPT_STRUCT(stan BOOST_FUSION_ADAPT_STRUCT (stan::gm::statements ,
(std::vector< stan::gm::var_decl >, local_decl_)(std::vector< stan::gm::statement >, statements_)  
)
+
+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/statement__grammar__def_8hpp_source.html b/doc/api/html/statement__grammar__def_8hpp_source.html new file mode 100644 index 00000000000..3ed0acd9fd0 --- /dev/null +++ b/doc/api/html/statement__grammar__def_8hpp_source.html @@ -0,0 +1,729 @@ + + + + + +Stan: src/stan/gm/grammars/statement_grammar_def.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
statement_grammar_def.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__PARSER__STATEMENT_GRAMMAR_DEF__HPP__
+
2 #define __STAN__GM__PARSER__STATEMENT_GRAMMAR_DEF__HPP__
+
3 
+
4 #include <cstddef>
+
5 #include <iomanip>
+
6 #include <iostream>
+
7 #include <istream>
+
8 #include <map>
+
9 #include <set>
+
10 #include <sstream>
+
11 #include <string>
+
12 #include <utility>
+
13 #include <vector>
+
14 #include <stdexcept>
+
15 
+
16 #include <boost/spirit/include/qi.hpp>
+
17 // FIXME: get rid of unused include
+
18 #include <boost/spirit/include/phoenix_core.hpp>
+
19 #include <boost/spirit/include/phoenix_function.hpp>
+
20 #include <boost/spirit/include/phoenix_fusion.hpp>
+
21 #include <boost/spirit/include/phoenix_object.hpp>
+
22 #include <boost/spirit/include/phoenix_operator.hpp>
+
23 #include <boost/spirit/include/phoenix_stl.hpp>
+
24 
+
25 #include <boost/lexical_cast.hpp>
+
26 #include <boost/fusion/include/adapt_struct.hpp>
+
27 #include <boost/fusion/include/std_pair.hpp>
+
28 #include <boost/config/warning_disable.hpp>
+
29 #include <boost/spirit/include/qi.hpp>
+
30 #include <boost/spirit/include/qi_numeric.hpp>
+
31 #include <boost/spirit/include/classic_position_iterator.hpp>
+
32 #include <boost/spirit/include/phoenix_core.hpp>
+
33 #include <boost/spirit/include/phoenix_function.hpp>
+
34 #include <boost/spirit/include/phoenix_fusion.hpp>
+
35 #include <boost/spirit/include/phoenix_object.hpp>
+
36 #include <boost/spirit/include/phoenix_operator.hpp>
+
37 #include <boost/spirit/include/phoenix_stl.hpp>
+
38 #include <boost/spirit/include/support_multi_pass.hpp>
+
39 #include <boost/tuple/tuple.hpp>
+
40 #include <boost/variant/apply_visitor.hpp>
+
41 #include <boost/variant/recursive_variant.hpp>
+
42 
+
43 #include <stan/gm/ast.hpp>
+ + + + + +
49 
+ +
51  (stan::gm::variable_dims, var_dims_)
+
52  (stan::gm::expression, expr_) );
+
53 
+ +
55  (std::string, name_)
+
56  (std::vector<stan::gm::expression>, dims_) );
+
57 
+ +
59  (std::string, family_)
+
60  (std::vector<stan::gm::expression>, args_) );
+
61 
+ +
63  (std::string, variable_)
+
64  (stan::gm::range, range_)
+
65  (stan::gm::statement, statement_) );
+
66 
+ +
68  (std::vector<stan::gm::printable>, printables_) );
+
69 
+ +
71  (stan::gm::expression, log_prob_))
+
72 
+ +
74  (stan::gm::expression, expr_)
+
75  (stan::gm::distribution, dist_)
+
76  (stan::gm::range, truncation_) );
+
77 
+
78 BOOST_FUSION_ADAPT_STRUCT(stan::gm::statements,
+
79  (std::vector<stan::gm::var_decl>, local_decl_)
+
80  (std::vector<stan::gm::statement>, statements_) );
+
81 
+
82 namespace stan {
+
83 
+
84  namespace gm {
+
85 
+ +
87  template <typename T1, typename T2, typename T3, typename T4>
+
88  struct result { typedef bool type; };
+
89 
+
90  bool operator()(assignment& a,
+
91  const var_origin& origin_allowed,
+
92  variable_map& vm,
+
93  std::stringstream& error_msgs) const {
+
94 
+
95  // validate existence
+
96  std::string name = a.var_dims_.name_;
+
97  if (!vm.exists(name)) {
+
98  error_msgs << "unknown variable in assignment"
+
99  << "; lhs variable=" << a.var_dims_.name_
+
100  << std::endl;
+
101  return false;
+
102  }
+
103 
+
104  // validate origin
+
105  var_origin lhs_origin = vm.get_origin(name);
+
106  if (lhs_origin != local_origin
+
107  && lhs_origin != origin_allowed) {
+
108  error_msgs << "attempt to assign variable in wrong block."
+
109  << " left-hand-side variable origin=";
+
110  print_var_origin(error_msgs,lhs_origin);
+
111  error_msgs << std::endl;
+
112  return false;
+
113  }
+
114 
+
115  // validate types
+
116  a.var_type_ = vm.get(name);
+
117  size_t lhs_var_num_dims = a.var_type_.dims_.size();
+
118  size_t num_index_dims = a.var_dims_.dims_.size();
+
119 
+ +
121  lhs_var_num_dims,
+
122  num_index_dims);
+
123 
+
124  if (lhs_type.is_ill_formed()) {
+
125  error_msgs << "too many indexes for variable "
+
126  << "; variable name = " << name
+
127  << "; num dimensions given = " << num_index_dims
+
128  << "; variable array dimensions = " << lhs_var_num_dims;
+
129  return false;
+
130  }
+
131  if (lhs_type.num_dims_ != a.expr_.expression_type().num_dims_) {
+
132  error_msgs << "mismatched dimensions on left- and right-hand side of assignment"
+
133  << "; left dims=" << lhs_type.num_dims_
+
134  << "; right dims=" << a.expr_.expression_type().num_dims_
+
135  << std::endl;
+
136  return false;
+
137  }
+
138 
+
139  base_expr_type lhs_base_type = lhs_type.base_type_;
+
140  base_expr_type rhs_base_type = a.expr_.expression_type().base_type_;
+
141  // int -> double promotion
+
142  bool types_compatible
+
143  = lhs_base_type == rhs_base_type
+
144  || ( lhs_base_type == DOUBLE_T && rhs_base_type == INT_T );
+
145  if (!types_compatible) {
+
146  error_msgs << "base type mismatch in assignment"
+
147  << "; left variable=" << a.var_dims_.name_
+
148  << "; left base type=";
+
149  write_base_expr_type(error_msgs,lhs_base_type);
+
150  error_msgs << "; right base type=";
+
151  write_base_expr_type(error_msgs,rhs_base_type);
+
152  error_msgs << std::endl;
+
153  return false;
+
154  }
+
155  return true;
+
156  }
+
157  };
+
158  boost::phoenix::function<validate_assignment> validate_assignment_f;
+
159 
+ +
161  template <typename T1, typename T2, typename T3>
+
162  struct result { typedef bool type; };
+
163 
+
164  bool is_double_return(const std::string& function_name,
+
165  const std::vector<expr_type>& arg_types,
+
166  std::ostream& error_msgs) const {
+
167  return function_signatures::instance()
+
168  .get_result_type(function_name,arg_types,error_msgs)
+
169  .is_primitive_double();
+
170  }
+
171  static bool is_univariate(const expr_type& et) {
+
172  return et.num_dims_ == 0
+
173  && ( et.base_type_ == INT_T
+
174  || et.base_type_ == DOUBLE_T );
+
175  }
+
176  bool operator()(const sample& s,
+
177  const variable_map& var_map,
+
178  std::ostream& error_msgs) const {
+
179  std::vector<expr_type> arg_types;
+
180  arg_types.push_back(s.expr_.expression_type());
+
181  for (size_t i = 0; i < s.dist_.args_.size(); ++i)
+
182  arg_types.push_back(s.dist_.args_[i].expression_type());
+
183  std::string function_name(s.dist_.family_);
+
184  function_name += "_log";
+
185  if (!is_double_return(function_name,arg_types,error_msgs)) {
+
186  error_msgs << "unknown distribution=" << s.dist_.family_ << std::endl;
+
187  return false;
+
188  }
+
189  // test for LHS not being purely a variable
+
190  if (has_non_param_var(s.expr_,var_map)) {
+
191  // FIXME: really want to get line numbers in here too
+
192  error_msgs << "Warning (non-fatal):"
+
193  << " sampling statement (~) contains a transformed parameter or local variable."
+
194  << std::endl
+
195  << " You must increment lp__ with the log absolute determinant"
+
196  << " of the Jacobian of the transform."
+
197  << std::endl
+
198  << " Sampling Statement left-hand-side expression:"
+
199  << std::endl
+
200  << " ";
+
201  generate_expression(s.expr_,error_msgs);
+
202  error_msgs << " ~ ";
+
203  error_msgs << function_name << "(...)";
+
204  error_msgs << std::endl;
+
205  }
+
206  // validate that variable and params are univariate if truncated
+
207  if (s.truncation_.has_low() || s.truncation_.has_high()) {
+
208  if (!is_univariate(s.expr_.expression_type())) { // .num_dims_ > 0) {
+
209  error_msgs << "Outcomes in truncated distributions must be univariate."
+
210  << std::endl
+
211  << " Found outcome expression: ";
+
212  generate_expression(s.expr_,error_msgs);
+
213  error_msgs << std::endl
+
214  << " with non-univariate type: "
+
215  << s.expr_.expression_type()
+
216  << std::endl;
+
217  return false;
+
218  }
+
219  for (size_t i = 0; i < s.dist_.args_.size(); ++i)
+
220  if (!is_univariate(s.dist_.args_[i].expression_type())) { // .num_dims_ > 0) {
+
221  error_msgs << "Parameters in truncated distributions must be univariate."
+
222  << std::endl
+
223  << " Found parameter expression: ";
+
224  generate_expression(s.dist_.args_[i],error_msgs);
+
225  error_msgs << std::endl
+
226  << " with non-univariate type: "
+
227  << s.dist_.args_[i].expression_type()
+
228  << std::endl;
+
229  return false;
+
230  }
+
231  }
+
232  if (s.truncation_.has_low()
+
233  && !is_univariate(s.truncation_.low_.expression_type())) {
+
234  error_msgs << "Lower boundsin truncated distributions must be univariate."
+
235  << std::endl
+
236  << " Found lower bound expression: ";
+
237  generate_expression(s.truncation_.low_,error_msgs);
+
238  error_msgs << std::endl
+
239  << " with non-univariate type: "
+ +
241  << std::endl;
+
242  return false;
+
243  }
+
244  if (s.truncation_.has_high()
+
245  && !is_univariate(s.truncation_.high_.expression_type())) {
+
246  error_msgs << "Upper bounds in truncated distributions must be univariate."
+
247  << std::endl
+
248  << " Found upper bound expression: ";
+
249  generate_expression(s.truncation_.high_,error_msgs);
+
250  error_msgs << std::endl
+
251  << " with non-univariate type: "
+ +
253  << std::endl;
+
254  return false;
+
255  }
+
256 
+
257  if (s.truncation_.has_low()) {
+
258  std::vector<expr_type> arg_types_trunc(arg_types);
+
259  arg_types_trunc[0] = s.truncation_.low_.expression_type();
+
260  std::string function_name_cdf(s.dist_.family_);
+
261  function_name_cdf += "_cdf_log";
+
262  if (!is_double_return(function_name_cdf,arg_types_trunc,error_msgs)) {
+
263  error_msgs << "lower truncation not defined for specified arguments to "
+
264  << s.dist_.family_ << std::endl;
+
265  return false;
+
266  }
+
267  if (!is_double_return(function_name_cdf,arg_types,error_msgs)) {
+
268  error_msgs << "lower bound in truncation type does not match"
+
269  << " sampled variate in distribution's type"
+
270  << std::endl;
+
271  return false;
+
272  }
+
273  }
+
274  if (s.truncation_.has_high()) {
+
275  std::vector<expr_type> arg_types_trunc(arg_types);
+
276  arg_types_trunc[0] = s.truncation_.high_.expression_type();
+
277  std::string function_name_cdf(s.dist_.family_);
+
278  function_name_cdf += "_cdf_log";
+
279  if (!is_double_return(function_name_cdf,arg_types_trunc,error_msgs)) {
+
280  error_msgs << "upper truncation not defined for specified arguments to "
+
281  << s.dist_.family_ << std::endl;
+
282  return false;
+
283  }
+
284  if (!is_double_return(function_name_cdf,arg_types,error_msgs)) {
+
285  error_msgs << "upper bound in truncation type does not match"
+
286  << " sampled variate in distribution's type"
+
287  << std::endl;
+
288  return false;
+
289  }
+
290  }
+
291  return true;
+
292 
+
293  }
+
294  };
+
295  boost::phoenix::function<validate_sample> validate_sample_f;
+
296 
+ +
298  template <typename T1, typename T2, typename T3>
+
299  struct result { typedef void type; };
+
300  void operator()(bool& pass,
+
301  const stan::gm::expression& expr,
+
302  std::stringstream& error_msgs) const {
+
303  error_msgs << "Illegal statement beginning with expression parsed as"
+
304  << std::endl << " ";
+
305  generate_expression(expr.expr_,error_msgs);
+
306  error_msgs << std::endl
+
307  << "Not a legal assignment or sampling statement. Note that"
+
308  << std::endl
+
309  << " * Assignment statements only allow variables (with optional indexes) on the left;"
+
310  << std::endl
+
311  << " if you see an outer function logical_lt (<) with negated (-) second argument,"
+
312  << std::endl
+
313  << " it indicates an assignment statement A <- B with illegal left"
+
314  << std::endl
+
315  << " side A parsed as expression (A < (-B))."
+
316  << std::endl
+
317  << " * Sampling statements allow arbitrary value-denoting expressions on the left."
+
318  << std::endl
+
319  << std::endl << std::endl;
+
320  pass = false;
+
321  }
+
322  };
+
323  boost::phoenix::function<expression_as_statement> expression_as_statement_f;
+
324 
+
325  struct unscope_locals {
+
326  template <typename T1, typename T2>
+
327  struct result { typedef void type; };
+
328  void operator()(const std::vector<var_decl>& var_decls,
+
329  variable_map& vm) const {
+
330  for (size_t i = 0; i < var_decls.size(); ++i)
+
331  vm.remove(var_decls[i].name());
+
332  }
+
333  };
+
334  boost::phoenix::function<unscope_locals> unscope_locals_f;
+
335 
+ +
337  template <typename T1, typename T2, typename T3>
+
338  struct result { typedef bool type; };
+
339  bool operator()(while_statement& ws,
+
340  const expression& e,
+
341  std::stringstream& error_msgs) const {
+
342  if (!e.expression_type().is_primitive()) {
+
343  error_msgs << "conditions in while statement must be primitive int or real;"
+
344  << " found type=" << e.expression_type() << std::endl;
+
345  return false;
+
346  }
+
347  ws.condition_ = e;
+
348  return true;
+
349  }
+
350  };
+
351  boost::phoenix::function<add_while_condition> add_while_condition_f;
+
352 
+
353  struct add_while_body {
+
354  template <typename T1, typename T2>
+
355  struct result { typedef void type; };
+
356  void operator()(while_statement& ws,
+
357  const statement& s) const {
+
358  ws.body_ = s;
+
359  }
+
360  };
+
361  boost::phoenix::function<add_while_body> add_while_body_f;
+
362 
+ +
364  template <typename T1, typename T2, typename T3, typename T4>
+
365  struct result { typedef bool type; };
+
366  bool operator()(const std::string& name,
+
367  std::string& name_local,
+
368  variable_map& vm,
+
369  std::stringstream& error_msgs) const {
+
370  name_local = name;
+
371  if (vm.exists(name)) {
+
372  error_msgs << "ERROR: loop variable already declared."
+
373  << " variable name=\"" << name << "\"" << std::endl;
+
374  return false; // variable exists
+
375  }
+
376  vm.add(name,
+
377  base_var_decl(name,std::vector<expression>(),
+
378  INT_T),
+
379  local_origin); // loop var acts like local
+
380  return true;
+
381  }
+
382  };
+
383  boost::phoenix::function<add_loop_identifier> add_loop_identifier_f;
+
384 
+ +
386  template <typename T1, typename T2>
+
387  struct result { typedef void type; };
+
388  void operator()(const std::string& name,
+
389  variable_map& vm) const {
+
390  vm.remove(name);
+
391  }
+
392  };
+
393  boost::phoenix::function<remove_loop_identifier> remove_loop_identifier_f;
+
394 
+ +
396  template <typename T1, typename T2>
+
397  struct result { typedef bool type; };
+
398 
+
399  bool operator()(const expression& expr,
+
400  std::stringstream& error_msgs) const {
+
401  if (!expr.expression_type().is_primitive_int()) {
+
402  error_msgs << "expression denoting integer required; found type="
+
403  << expr.expression_type() << std::endl;
+
404  return false;
+
405  }
+
406  return true;
+
407  }
+
408  };
+
409  boost::phoenix::function<validate_int_expr2> validate_int_expr2_f;
+
410 
+ +
412  template <typename T1, typename T2>
+
413  struct result { typedef bool type; };
+
414 
+
415  bool operator()(const bool& allow_sample,
+
416  std::stringstream& error_msgs) const {
+
417  if (!allow_sample) {
+
418  error_msgs << "ERROR: sampling only allowed in model."
+
419  << std::endl;
+
420  return false;
+
421  }
+
422  return true;
+
423  }
+
424  };
+
425  boost::phoenix::function<validate_allow_sample> validate_allow_sample_f;
+
426 
+
427 
+
428  template <typename Iterator>
+ +
430  std::stringstream& error_msgs)
+
431  : statement_grammar::base_type(statement_r),
+
432  var_map_(var_map),
+
433  error_msgs_(error_msgs),
+
434  expression_g(var_map,error_msgs),
+
435  var_decls_g(var_map,error_msgs),
+
436  statement_2_g(var_map,error_msgs,*this)
+
437  {
+
438  using boost::spirit::qi::_1;
+
439  using boost::spirit::qi::char_;
+
440  using boost::spirit::qi::eps;
+
441  using boost::spirit::qi::lexeme;
+
442  using boost::spirit::qi::lit;
+
443  using boost::spirit::qi::no_skip;
+
444  using boost::spirit::qi::_pass;
+
445  using boost::spirit::qi::_val;
+
446 
+
447  using boost::spirit::qi::labels::_a;
+
448  using boost::spirit::qi::labels::_r1;
+
449  using boost::spirit::qi::labels::_r2;
+
450 
+
451  // _r1 true if sample_r allowed (inherited)
+
452  // _r2 source of variables allowed for assignments
+
453  // set to true if sample_r are allowed
+
454  statement_r.name("statement");
+ +
456  %= no_op_statement_r // key ";"
+
457  | statement_seq_r(_r1,_r2) // key "{"
+
458  | increment_log_prob_statement_r(_r2) // key "increment"
+
459  | for_statement_r(_r1,_r2) // key "for"
+
460  | while_statement_r(_r1,_r2) // key "while"
+
461  | statement_2_g(_r1,_r2) // key "if"
+
462  | print_statement_r(_r2) // key "print"
+
463  | assignment_r(_r2) // lvalue "<-"
+
464  // [_pass = validate_assignment_f(_1,_r2,boost::phoenix::ref(var_map_),
+
465  // boost::phoenix::ref(error_msgs_))]
+
466  | sample_r(_r1,_r2) // expression "~"
+
467  | expression_g(_r2) // expression
+
468  [expression_as_statement_f(_pass,_1,boost::phoenix::ref(error_msgs_))]
+
469  ;
+
470 
+
471  // _r1, _r2 same as statement_r
+
472  statement_seq_r.name("sequence of statements");
+ +
474  %= lit('{')
+
475  > local_var_decls_r[_a = _1]
+
476  > *statement_r(_r1,_r2)
+
477  > lit('}')
+
478  > eps[unscope_locals_f(_a,boost::phoenix::ref(var_map_))]
+
479  ;
+
480 
+ +
482  %= var_decls_g(false,local_origin); // - constants
+
483 
+
484  increment_log_prob_statement_r.name("increment log prob statement");
+ +
486  = lit("increment_log_prob")
+
487  > lit('(')
+
488  > expression_g(_r1)
+
489  > lit(')')
+
490  > lit(';')
+
491  ;
+
492 
+
493  while_statement_r.name("while statement");
+ +
495  = lit("while")
+
496  > lit('(')
+
497  > expression_g(_r2)
+
498  [_pass = add_while_condition_f(_val,_1,
+
499  boost::phoenix::ref(error_msgs_))]
+
500  > lit(')')
+
501  > statement_r(_r1,_r2)
+
502  [add_while_body_f(_val,_1)]
+
503  ;
+
504 
+
505 
+
506  // _r1, _r2 same as statement_r
+
507  for_statement_r.name("for statement");
+ +
509  %= lit("for")
+
510  > lit('(')
+
511  > identifier_r [_pass
+
512  = add_loop_identifier_f(_1,_a,
+
513  boost::phoenix::ref(var_map_),
+
514  boost::phoenix::ref(error_msgs_))]
+
515  > lit("in")
+
516  > range_r(_r2)
+
517  > lit(')')
+
518  > statement_r(_r1,_r2)
+
519  > eps
+
520  [remove_loop_identifier_f(_a,boost::phoenix::ref(var_map_))];
+
521  ;
+
522 
+
523  print_statement_r.name("print statement");
+ +
525  %= lit("print")
+
526  > lit('(')
+
527  > (printable_r(_r1) % ',')
+
528  > lit(')');
+
529 
+
530  printable_r.name("printable");
+ + +
533  | expression_g(_r1);
+
534 
+
535  printable_string_r.name("printable quoted string");
+ +
537  %= lit('"')
+
538  > no_skip[*char_("a-zA-Z0-9/~!@#$%^&*()`_+-={}|[]:;'<>?,./ ")]
+
539  > lit('"');
+
540 
+
541  identifier_r.name("identifier");
+ +
543  %= (lexeme[char_("a-zA-Z")
+
544  >> *char_("a-zA-Z0-9_.")]);
+
545 
+
546  range_r.name("range expression pair, colon");
+
547  range_r
+
548  %= expression_g(_r1)
+
549  [_pass = validate_int_expr2_f(_1,boost::phoenix::ref(error_msgs_))]
+
550  >> lit(':')
+
551  >> expression_g(_r1)
+
552  [_pass = validate_int_expr2_f(_1,boost::phoenix::ref(error_msgs_))];
+
553 
+
554  assignment_r.name("variable assignment by expression");
+ +
556  %= ( var_lhs_r(_r1)
+
557  >> lit("<-") )
+
558  > expression_g(_r1)
+
559  > lit(';')
+
560  [_pass = validate_assignment_f(_val,_r1,boost::phoenix::ref(var_map_),
+
561  boost::phoenix::ref(error_msgs_))]
+
562  ;
+
563 
+
564  var_lhs_r.name("variable and array dimensions");
+
565  var_lhs_r
+
566  %= identifier_r
+
567  >> opt_dims_r(_r1);
+
568 
+
569  opt_dims_r.name("array dimensions (optional)");
+
570  opt_dims_r
+
571  %= * dims_r(_r1);
+
572 
+
573  dims_r.name("array dimensions");
+
574  dims_r
+
575  %= lit('[')
+
576  > (expression_g(_r1)
+
577  [_pass = validate_int_expr2_f(_1,boost::phoenix::ref(error_msgs_))]
+
578  % ',')
+
579  > lit(']')
+
580  ;
+
581 
+
582  // inherited _r1 = true if samples allowed as statements
+
583  sample_r.name("distribution of expression");
+
584  sample_r
+
585  %= ( expression_g(_r2)
+
586  >> lit('~') )
+
587  > eps
+
588  [_pass = validate_allow_sample_f(_r1,
+
589  boost::phoenix::ref(error_msgs_))]
+
590  > distribution_r(_r2)
+
591  > -truncation_range_r(_r2)
+
592  > lit(';')
+
593  > eps
+
594  [_pass = validate_sample_f(_val,
+
595  boost::phoenix::ref(var_map_),
+
596  boost::phoenix::ref(error_msgs_))]
+
597  ;
+
598  distribution_r.name("distribution and parameters");
+ +
600  %= ( identifier_r
+
601  >> lit('(')
+
602  >> -(expression_g(_r1) % ',') )
+
603  > lit(')');
+
604 
+
605  truncation_range_r.name("range pair");
+ +
607  %= lit('T')
+
608  > lit('[')
+
609  > -expression_g(_r1)
+
610  > lit(',')
+
611  > -expression_g(_r1)
+
612  > lit(']');
+
613 
+
614  no_op_statement_r.name("no op statement");
+ +
616  %= lit(';') [_val = no_op_statement()]; // ok to re-use instance
+
617 
+
618  }
+
619 
+
620  }
+
621 }
+
622 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/statement__grammar__inst_8cpp.html b/doc/api/html/statement__grammar__inst_8cpp.html new file mode 100644 index 00000000000..4232642fe60 --- /dev/null +++ b/doc/api/html/statement__grammar__inst_8cpp.html @@ -0,0 +1,123 @@ + + + + + +Stan: src/stan/gm/grammars/statement_grammar_inst.cpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
statement_grammar_inst.cpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/statement__grammar__inst_8cpp_source.html b/doc/api/html/statement__grammar__inst_8cpp_source.html new file mode 100644 index 00000000000..1ecf2b8450c --- /dev/null +++ b/doc/api/html/statement__grammar__inst_8cpp_source.html @@ -0,0 +1,115 @@ + + + + + +Stan: src/stan/gm/grammars/statement_grammar_inst.cpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
statement_grammar_inst.cpp
+
+
+Go to the documentation of this file.
+ +
3 
+
4 namespace stan {
+
5  namespace gm {
+
6  template struct statement_grammar<pos_iterator_t>;
+
7  }
+
8 }
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/std_8dox.html b/doc/api/html/std_8dox.html new file mode 100644 index 00000000000..5f7540fc197 --- /dev/null +++ b/doc/api/html/std_8dox.html @@ -0,0 +1,112 @@ + + + + + +Stan: src/doxygen/std.dox File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ +
+
+ +
+
src/doxygen/std.dox File Reference
+
+
+ + + + + +

+Namespaces

namespace  std
 Template specification of functions in std for Stan.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/stepsize__adaptation_8hpp.html b/doc/api/html/stepsize__adaptation_8hpp.html new file mode 100644 index 00000000000..7617c469ff7 --- /dev/null +++ b/doc/api/html/stepsize__adaptation_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/mcmc/stepsize_adaptation.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stepsize_adaptation.hpp File Reference
+
+
+
#include <cmath>
+#include <stan/mcmc/base_adaptation.hpp>
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::stepsize_adaptation
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/stepsize__adaptation_8hpp_source.html b/doc/api/html/stepsize__adaptation_8hpp_source.html new file mode 100644 index 00000000000..77b24e46b53 --- /dev/null +++ b/doc/api/html/stepsize__adaptation_8hpp_source.html @@ -0,0 +1,185 @@ + + + + + +Stan: src/stan/mcmc/stepsize_adaptation.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stepsize_adaptation.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__STEPSIZE__ADAPTATION__BETA__
+
2 #define __STAN__MCMC__STEPSIZE__ADAPTATION__BETA__
+
3 
+
4 #include <cmath>
+ +
6 
+
7 namespace stan {
+
8 
+
9  namespace mcmc {
+
10 
+ +
12 
+
13  public:
+
14 
+
15  stepsize_adaptation(): _mu(0.5), _delta(0.5), _gamma(0.05),
+
16  _kappa(0.75), _t0(10)
+
17  { restart(); }
+
18 
+
19  void set_mu(double m) { _mu = m; }
+
20  void set_delta(double d) { if(d > 0 && d < 1) _delta = d; }
+
21  void set_gamma(double g) { if(g > 0) _gamma = g; }
+
22  void set_kappa(double k) { if(k > 0) _kappa = k; }
+
23  void set_t0(double t) { if(t > 0) _t0 = t; }
+
24 
+
25  double get_mu() { return _mu; }
+
26  double get_delta() { return _delta; }
+
27  double get_gamma() { return _gamma; }
+
28  double get_kappa() { return _kappa; }
+
29  double get_t0() { return _t0; }
+
30 
+
31  void restart() {
+
32  _counter = 0;
+
33  _s_bar = 0;
+
34  _x_bar = 0;
+
35  }
+
36 
+
37  void learn_stepsize(double& epsilon, double adapt_stat) {
+
38 
+
39  ++_counter;
+
40 
+
41  adapt_stat = adapt_stat > 1 ? 1 : adapt_stat;
+
42 
+
43  // Nesterov Dual-Averaging of log(epsilon)
+
44  const double eta = 1.0 / (_counter + _t0);
+
45 
+
46  _s_bar = (1.0 - eta) * _s_bar + eta * (_delta - adapt_stat);
+
47 
+
48  const double x = _mu - _s_bar * std::sqrt(_counter) / _gamma;
+
49  const double x_eta = std::pow(_counter, - _kappa);
+
50 
+
51  _x_bar = (1.0 - x_eta) * _x_bar + x_eta * x;
+
52 
+
53  epsilon = std::exp(x);
+
54 
+
55  }
+
56 
+
57  void complete_adaptation(double& epsilon) {
+
58  epsilon = std::exp(_x_bar);
+
59  }
+
60 
+
61  protected:
+
62 
+
63  double _counter; // Adaptation iteration
+
64  double _s_bar; // Moving average statistic
+
65  double _x_bar; // Moving average parameter
+
66  double _mu; // Asymptotic mean of parameter
+
67  double _delta; // Target value of statistic
+
68  double _gamma; // Adaptation scaling
+
69  double _kappa; // Adaptation shrinkage
+
70  double _t0; // Effective starting iteration
+
71 
+
72  };
+
73 
+
74  } // mcmc
+
75 
+
76 } // stan
+
77 
+
78 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/stepsize__adapter_8hpp.html b/doc/api/html/stepsize__adapter_8hpp.html new file mode 100644 index 00000000000..57a90debdc7 --- /dev/null +++ b/doc/api/html/stepsize__adapter_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/mcmc/stepsize_adapter.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stepsize_adapter.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::stepsize_adapter
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/stepsize__adapter_8hpp_source.html b/doc/api/html/stepsize__adapter_8hpp_source.html new file mode 100644 index 00000000000..1cfe6dd8f4f --- /dev/null +++ b/doc/api/html/stepsize__adapter_8hpp_source.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/mcmc/stepsize_adapter.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stepsize_adapter.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__STEPSIZE__ADAPTER__BETA__
+
2 #define __STAN__MCMC__STEPSIZE__ADAPTER__BETA__
+
3 
+ + +
6 
+
7 namespace stan {
+
8 
+
9  namespace mcmc {
+
10 
+ +
12 
+
13  public:
+
14 
+ +
16 
+ +
18  return _stepsize_adaptation;
+
19  }
+
20 
+
21  protected:
+
22 
+ +
24 
+
25  };
+
26 
+
27  } // mcmc
+
28 
+
29 } // stan
+
30 
+
31 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/stepsize__covar__adapter_8hpp.html b/doc/api/html/stepsize__covar__adapter_8hpp.html new file mode 100644 index 00000000000..d6e46a56ffd --- /dev/null +++ b/doc/api/html/stepsize__covar__adapter_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/mcmc/stepsize_covar_adapter.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stepsize_covar_adapter.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::stepsize_covar_adapter
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/stepsize__covar__adapter_8hpp_source.html b/doc/api/html/stepsize__covar__adapter_8hpp_source.html new file mode 100644 index 00000000000..9a4bfcbba7f --- /dev/null +++ b/doc/api/html/stepsize__covar__adapter_8hpp_source.html @@ -0,0 +1,157 @@ + + + + + +Stan: src/stan/mcmc/stepsize_covar_adapter.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stepsize_covar_adapter.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__STEPSIZE__COVAR__ADAPTER__BETA__
+
2 #define __STAN__MCMC__STEPSIZE__COVAR__ADAPTER__BETA__
+
3 
+ + + +
7 
+
8 namespace stan {
+
9 
+
10  namespace mcmc {
+
11 
+ +
13 
+
14  public:
+
15 
+ +
17  {};
+
18 
+ +
20  return _stepsize_adaptation;
+
21  }
+
22 
+ +
24  return _covar_adaptation;
+
25  }
+
26 
+
27  void set_window_params(unsigned int num_warmup,
+
28  unsigned int init_buffer,
+
29  unsigned int term_buffer,
+
30  unsigned int base_window,
+
31  std::ostream* e = 0) {
+ +
33  init_buffer,
+
34  term_buffer,
+
35  base_window,
+
36  e);
+
37  }
+
38 
+
39  protected:
+
40 
+ + +
43 
+
44  };
+
45 
+
46  } // mcmc
+
47 
+
48 } // stan
+
49 
+
50 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/stepsize__var__adapter_8hpp.html b/doc/api/html/stepsize__var__adapter_8hpp.html new file mode 100644 index 00000000000..44356ea8f6f --- /dev/null +++ b/doc/api/html/stepsize__var__adapter_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/mcmc/stepsize_var_adapter.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stepsize_var_adapter.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::stepsize_var_adapter
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/stepsize__var__adapter_8hpp_source.html b/doc/api/html/stepsize__var__adapter_8hpp_source.html new file mode 100644 index 00000000000..be4bc43e632 --- /dev/null +++ b/doc/api/html/stepsize__var__adapter_8hpp_source.html @@ -0,0 +1,158 @@ + + + + + +Stan: src/stan/mcmc/stepsize_var_adapter.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stepsize_var_adapter.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__STEPSIZE__VAR__ADAPTER__BETA__
+
2 #define __STAN__MCMC__STEPSIZE__VAR__ADAPTER__BETA__
+
3 
+ + + +
7 
+
8 namespace stan {
+
9 
+
10  namespace mcmc {
+
11 
+ +
13 
+
14  public:
+
15 
+ +
17  {};
+
18 
+ +
20  return _stepsize_adaptation;
+
21  }
+
22 
+ +
24  return _var_adaptation;
+
25  }
+
26 
+
27  void set_window_params(unsigned int num_warmup,
+
28  unsigned int init_buffer,
+
29  unsigned int term_buffer,
+
30  unsigned int base_window,
+
31  std::ostream* e = 0) {
+ +
33  init_buffer,
+
34  term_buffer,
+
35  base_window,
+
36  e);
+
37  }
+
38 
+
39 
+
40  protected:
+
41 
+ + +
44 
+
45  };
+
46 
+
47  } // mcmc
+
48 
+
49 } // stan
+
50 
+
51 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/stored__gradient__vari_8hpp.html b/doc/api/html/stored__gradient__vari_8hpp.html new file mode 100644 index 00000000000..8f17fcc578c --- /dev/null +++ b/doc/api/html/stored__gradient__vari_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/stored_gradient_vari.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stored_gradient_vari.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + +

+Classes

class  stan::agrad::stored_gradient_vari
 A var implementation that stores the daughter variable implementation pointers and the partial derivative with respect to the result explicitly in arrays constructed on the auto-diff memory stack. More...
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/stored__gradient__vari_8hpp_source.html b/doc/api/html/stored__gradient__vari_8hpp_source.html new file mode 100644 index 00000000000..431182d8475 --- /dev/null +++ b/doc/api/html/stored__gradient__vari_8hpp_source.html @@ -0,0 +1,146 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/stored_gradient_vari.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stored_gradient_vari.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__STORED_GRADIENT_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__STORED_GRADIENT_HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace agrad {
+
9 
+
18  class stored_gradient_vari : public vari {
+
19 
+
20  protected:
+
21 
+
22  size_t size_;
+ +
24  double* partials_;
+
25 
+
26  public:
+
27 
+
38  stored_gradient_vari(double value,
+
39  size_t size,
+
40  vari** dtrs,
+
41  double* partials)
+
42  : vari(value),
+
43  size_(size),
+
44  dtrs_(dtrs),
+
45  partials_(partials) {
+
46  }
+
47 
+
52  void chain() {
+
53  for (size_t i = 0; i < size_; ++i)
+
54  dtrs_[i]->adj_ += adj_ * partials_[i];
+
55  }
+
56  };
+
57 
+
58  }
+
59 }
+
60 
+
61 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4-members.html b/doc/api/html/struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4-members.html new file mode 100644 index 00000000000..ceba3c3b9bc --- /dev/null +++ b/doc/api/html/struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4-members.html @@ -0,0 +1,127 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
Eigen::NumTraits< stan::agrad::var > Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html b/doc/api/html/struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html new file mode 100644 index 00000000000..45991d13b10 --- /dev/null +++ b/doc/api/html/struct_eigen_1_1_num_traits_3_01stan_1_1agrad_1_1var_01_4.html @@ -0,0 +1,371 @@ + + + + + +Stan: Eigen::NumTraits< stan::agrad::var > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
Eigen::NumTraits< stan::agrad::var > Struct Template Reference
+
+
+ +

Numerical traits template override for Eigen for automatic gradient variables. + More...

+ +

#include <Eigen_NumTraits.hpp>

+ + + + + + + + + + + + + + +

+Public Types

enum  {
+  IsInteger = 0, +IsSigned = 1, +IsComplex = 0, +RequireInitialization = 0, +
+  ReadCost = 1, +AddCost = 1, +MulCost = 1, +HasFloatingPoint = 1 +
+ }
 Properties for automatic differentiation variables read by Eigen matrix library. More...
 
typedef stan::agrad::var Real
 Real-valued variables.
 
typedef stan::agrad::var NonInteger
 Non-integer valued variables.
 
typedef stan::agrad::var Nested
 Nested variables.
 
+ + + + + + + + + + + + + +

+Static Public Member Functions

static Real epsilon ()
 Return standard library's epsilon for double-precision floating point, std::numeric_limits<double>::epsilon().
 
static Real dummy_precision ()
 Return dummy precision.
 
static Real highest ()
 Return standard library's highest for double-precision floating point, std::numeric_limits<double>max().
 
static Real lowest ()
 Return standard library's lowest for double-precision floating point, &#45;std::numeric_limits<double>max().
 
+

Detailed Description

+

template<>
+struct Eigen::NumTraits< stan::agrad::var >

+ +

Numerical traits template override for Eigen for automatic gradient variables.

+ +

Definition at line 65 of file Eigen_NumTraits.hpp.

+

Member Typedef Documentation

+ +
+
+ + + + +
typedef stan::agrad::var Eigen::NumTraits< stan::agrad::var >::Nested
+
+ +

Nested variables.

+

Required for numerical traits.

+ +

Definition at line 85 of file Eigen_NumTraits.hpp.

+ +
+
+ +
+
+ + + + +
typedef stan::agrad::var Eigen::NumTraits< stan::agrad::var >::NonInteger
+
+ +

Non-integer valued variables.

+

Required for numerical traits.

+ +

Definition at line 78 of file Eigen_NumTraits.hpp.

+ +
+
+ +
+
+ + + + +
typedef stan::agrad::var Eigen::NumTraits< stan::agrad::var >::Real
+
+ +

Real-valued variables.

+

Required for numerical traits.

+ +

Definition at line 71 of file Eigen_NumTraits.hpp.

+ +
+
+

Member Enumeration Documentation

+ +
+
+ + + + +
anonymous enum
+
+ +

Properties for automatic differentiation variables read by Eigen matrix library.

+
Enumerator:
+ + + + + + + + +
IsInteger  +
IsSigned  +
IsComplex  +
RequireInitialization  +
ReadCost  +
AddCost  +
MulCost  +
HasFloatingPoint  +
+
+
+ +

Definition at line 128 of file Eigen_NumTraits.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + +
static Real Eigen::NumTraits< stan::agrad::var >::dummy_precision ()
+
+inlinestatic
+
+ +

Return dummy precision.

+ +

Definition at line 100 of file Eigen_NumTraits.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
static Real Eigen::NumTraits< stan::agrad::var >::epsilon ()
+
+inlinestatic
+
+ +

Return standard library's epsilon for double-precision floating point, std::numeric_limits<double>::epsilon().

+
Returns
Same epsilon as a double.
+ +

Definition at line 93 of file Eigen_NumTraits.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
static Real Eigen::NumTraits< stan::agrad::var >::highest ()
+
+inlinestatic
+
+ +

Return standard library's highest for double-precision floating point, std::numeric_limits<double>max().

+
Returns
Same highest value as a double.
+ +

Definition at line 110 of file Eigen_NumTraits.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
static Real Eigen::NumTraits< stan::agrad::var >::lowest ()
+
+inlinestatic
+
+ +

Return standard library's lowest for double-precision floating point, &#45;std::numeric_limits<double>max().

+
Returns
Same lowest value as a double.
+ +

Definition at line 120 of file Eigen_NumTraits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/struct_eigen_1_1internal_1_1general__matrix__matrix__product_3_01_index_00_01stan_1_1agrad_1_1va753d9f8f3d54fbedc22d657246672d94.html b/doc/api/html/struct_eigen_1_1internal_1_1general__matrix__matrix__product_3_01_index_00_01stan_1_1agrad_1_1va753d9f8f3d54fbedc22d657246672d94.html new file mode 100644 index 00000000000..71c2ac88a08 --- /dev/null +++ b/doc/api/html/struct_eigen_1_1internal_1_1general__matrix__matrix__product_3_01_index_00_01stan_1_1agrad_1_1va753d9f8f3d54fbedc22d657246672d94.html @@ -0,0 +1,116 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
Eigen::internal::general_matrix_matrix_product< Index, stan::agrad::var, LhsStorageOrder, ConjugateLhs, stan::agrad::var, RhsStorageOrder, ConjugateRhs, ColMajor > Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/struct_eigen_1_1internal_1_1general__matrix__matrix__product_3_01_index_00_01stan_1_1agrad_1_1va9b485de9571b6e46d7a64aff43a6d9d3.html b/doc/api/html/struct_eigen_1_1internal_1_1general__matrix__matrix__product_3_01_index_00_01stan_1_1agrad_1_1va9b485de9571b6e46d7a64aff43a6d9d3.html new file mode 100644 index 00000000000..03c74f145c1 --- /dev/null +++ b/doc/api/html/struct_eigen_1_1internal_1_1general__matrix__matrix__product_3_01_index_00_01stan_1_1agrad_1_1va9b485de9571b6e46d7a64aff43a6d9d3.html @@ -0,0 +1,289 @@ + + + + + +Stan: Eigen::internal::general_matrix_matrix_product< Index, stan::agrad::var, LhsStorageOrder, ConjugateLhs, stan::agrad::var, RhsStorageOrder, ConjugateRhs, ColMajor > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
Eigen::internal::general_matrix_matrix_product< Index, stan::agrad::var, LhsStorageOrder, ConjugateLhs, stan::agrad::var, RhsStorageOrder, ConjugateRhs, ColMajor > Struct Template Reference
+
+
+ +

#include <Eigen_NumTraits.hpp>

+ + + + + + + + +

+Public Types

typedef stan::agrad::var LhsScalar
 
typedef stan::agrad::var RhsScalar
 
typedef scalar_product_traits
+< LhsScalar, RhsScalar >
+::ReturnType 
ResScalar
 
+ + + +

+Static Public Member Functions

static void run (Index rows, Index cols, Index depth, const LhsScalar *_lhs, Index lhsStride, const RhsScalar *_rhs, Index rhsStride, ResScalar *res, Index resStride, const ResScalar &alpha, level3_blocking< LhsScalar, RhsScalar > &, GemmParallelInfo< Index > *)
 
+

Detailed Description

+

template<typename Index, int LhsStorageOrder, bool ConjugateLhs, int RhsStorageOrder, bool ConjugateRhs>
+struct Eigen::internal::general_matrix_matrix_product< Index, stan::agrad::var, LhsStorageOrder, ConjugateLhs, stan::agrad::var, RhsStorageOrder, ConjugateRhs, ColMajor >

+ + +

Definition at line 216 of file Eigen_NumTraits.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename Index , int LhsStorageOrder, bool ConjugateLhs, int RhsStorageOrder, bool ConjugateRhs>
+ + + + +
typedef stan::agrad::var Eigen::internal::general_matrix_matrix_product< Index, stan::agrad::var, LhsStorageOrder, ConjugateLhs, stan::agrad::var, RhsStorageOrder, ConjugateRhs, ColMajor >::LhsScalar
+
+ +

Definition at line 218 of file Eigen_NumTraits.hpp.

+ +
+
+ +
+
+
+template<typename Index , int LhsStorageOrder, bool ConjugateLhs, int RhsStorageOrder, bool ConjugateRhs>
+ + + + +
typedef scalar_product_traits<LhsScalar, RhsScalar>::ReturnType Eigen::internal::general_matrix_matrix_product< Index, stan::agrad::var, LhsStorageOrder, ConjugateLhs, stan::agrad::var, RhsStorageOrder, ConjugateRhs, ColMajor >::ResScalar
+
+ +

Definition at line 220 of file Eigen_NumTraits.hpp.

+ +
+
+ +
+
+
+template<typename Index , int LhsStorageOrder, bool ConjugateLhs, int RhsStorageOrder, bool ConjugateRhs>
+ + + + +
typedef stan::agrad::var Eigen::internal::general_matrix_matrix_product< Index, stan::agrad::var, LhsStorageOrder, ConjugateLhs, stan::agrad::var, RhsStorageOrder, ConjugateRhs, ColMajor >::RhsScalar
+
+ +

Definition at line 219 of file Eigen_NumTraits.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename Index , int LhsStorageOrder, bool ConjugateLhs, int RhsStorageOrder, bool ConjugateRhs>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
static void Eigen::internal::general_matrix_matrix_product< Index, stan::agrad::var, LhsStorageOrder, ConjugateLhs, stan::agrad::var, RhsStorageOrder, ConjugateRhs, ColMajor >::run (Index rows,
Index cols,
Index depth,
const LhsScalar_lhs,
Index lhsStride,
const RhsScalar_rhs,
Index rhsStride,
ResScalarres,
Index resStride,
const ResScalaralpha,
level3_blocking< LhsScalar, RhsScalar > & ,
GemmParallelInfo< Index > *  
)
+
+inlinestatic
+
+ +

Definition at line 221 of file Eigen_NumTraits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1va16fe21f36cb92096f2fc63d419437421.html b/doc/api/html/struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1va16fe21f36cb92096f2fc63d419437421.html new file mode 100644 index 00000000000..c65818ae6ac --- /dev/null +++ b/doc/api/html/struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1va16fe21f36cb92096f2fc63d419437421.html @@ -0,0 +1,117 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, ColMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs > Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1va3d1bc254c18abbf59c1006f7e7cbcbac.html b/doc/api/html/struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1va3d1bc254c18abbf59c1006f7e7cbcbac.html new file mode 100644 index 00000000000..9390bafea23 --- /dev/null +++ b/doc/api/html/struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1va3d1bc254c18abbf59c1006f7e7cbcbac.html @@ -0,0 +1,117 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, RowMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs > Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1va44da5f98e1caea9523bacbd5bdc025fe.html b/doc/api/html/struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1va44da5f98e1caea9523bacbd5bdc025fe.html new file mode 100644 index 00000000000..ec1e4c8bdac --- /dev/null +++ b/doc/api/html/struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1va44da5f98e1caea9523bacbd5bdc025fe.html @@ -0,0 +1,301 @@ + + + + + +Stan: Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, ColMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, ColMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs > Struct Template Reference
+
+
+ +

Override matrix-vector and matrix-matrix products to use more efficient implementation. + More...

+ +

#include <Eigen_NumTraits.hpp>

+ + + + + + + + + + +

+Public Types

enum  { LhsStorageOrder = ColMajor + }
 
typedef stan::agrad::var LhsScalar
 
typedef stan::agrad::var RhsScalar
 
typedef scalar_product_traits
+< LhsScalar, RhsScalar >
+::ReturnType 
ResScalar
 
+ + + +

+Static Public Member Functions

static EIGEN_DONT_INLINE void run (Index rows, Index cols, const LhsScalar *lhs, Index lhsStride, const RhsScalar *rhs, Index rhsIncr, ResScalar *res, Index resIncr, const ResScalar &alpha)
 
+

Detailed Description

+

template<typename Index, bool ConjugateLhs, bool ConjugateRhs>
+struct Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, ColMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >

+ +

Override matrix-vector and matrix-matrix products to use more efficient implementation.

+ +

Definition at line 178 of file Eigen_NumTraits.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename Index , bool ConjugateLhs, bool ConjugateRhs>
+ + + + +
typedef stan::agrad::var Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, ColMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >::LhsScalar
+
+ +

Definition at line 180 of file Eigen_NumTraits.hpp.

+ +
+
+ +
+
+
+template<typename Index , bool ConjugateLhs, bool ConjugateRhs>
+ + + + +
typedef scalar_product_traits<LhsScalar, RhsScalar>::ReturnType Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, ColMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >::ResScalar
+
+ +

Definition at line 182 of file Eigen_NumTraits.hpp.

+ +
+
+ +
+
+
+template<typename Index , bool ConjugateLhs, bool ConjugateRhs>
+ + + + +
typedef stan::agrad::var Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, ColMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >::RhsScalar
+
+ +

Definition at line 181 of file Eigen_NumTraits.hpp.

+ +
+
+

Member Enumeration Documentation

+ +
+
+
+template<typename Index , bool ConjugateLhs, bool ConjugateRhs>
+ + + + +
anonymous enum
+
+
Enumerator:
+ +
LhsStorageOrder  +
+
+
+ +

Definition at line 183 of file Eigen_NumTraits.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename Index , bool ConjugateLhs, bool ConjugateRhs>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
static EIGEN_DONT_INLINE void Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, ColMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >::run (Index rows,
Index cols,
const LhsScalarlhs,
Index lhsStride,
const RhsScalarrhs,
Index rhsIncr,
ResScalarres,
Index resIncr,
const ResScalaralpha 
)
+
+inlinestatic
+
+ +

Definition at line 185 of file Eigen_NumTraits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1vacd54cabc78c49ca719650381b68b105e.html b/doc/api/html/struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1vacd54cabc78c49ca719650381b68b105e.html new file mode 100644 index 00000000000..d1a58083dee --- /dev/null +++ b/doc/api/html/struct_eigen_1_1internal_1_1general__matrix__vector__product_3_01_index_00_01stan_1_1agrad_1_1vacd54cabc78c49ca719650381b68b105e.html @@ -0,0 +1,297 @@ + + + + + +Stan: Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, RowMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, RowMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs > Struct Template Reference
+
+
+ +

#include <Eigen_NumTraits.hpp>

+ + + + + + + + + + +

+Public Types

enum  { LhsStorageOrder = RowMajor + }
 
typedef stan::agrad::var LhsScalar
 
typedef stan::agrad::var RhsScalar
 
typedef scalar_product_traits
+< LhsScalar, RhsScalar >
+::ReturnType 
ResScalar
 
+ + + +

+Static Public Member Functions

static EIGEN_DONT_INLINE void run (Index rows, Index cols, const LhsScalar *lhs, Index lhsStride, const RhsScalar *rhs, Index rhsIncr, ResScalar *res, Index resIncr, const RhsScalar &alpha)
 
+

Detailed Description

+

template<typename Index, bool ConjugateLhs, bool ConjugateRhs>
+struct Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, RowMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >

+ + +

Definition at line 197 of file Eigen_NumTraits.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename Index , bool ConjugateLhs, bool ConjugateRhs>
+ + + + +
typedef stan::agrad::var Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, RowMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >::LhsScalar
+
+ +

Definition at line 199 of file Eigen_NumTraits.hpp.

+ +
+
+ +
+
+
+template<typename Index , bool ConjugateLhs, bool ConjugateRhs>
+ + + + +
typedef scalar_product_traits<LhsScalar, RhsScalar>::ReturnType Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, RowMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >::ResScalar
+
+ +

Definition at line 201 of file Eigen_NumTraits.hpp.

+ +
+
+ +
+
+
+template<typename Index , bool ConjugateLhs, bool ConjugateRhs>
+ + + + +
typedef stan::agrad::var Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, RowMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >::RhsScalar
+
+ +

Definition at line 200 of file Eigen_NumTraits.hpp.

+ +
+
+

Member Enumeration Documentation

+ +
+
+
+template<typename Index , bool ConjugateLhs, bool ConjugateRhs>
+ + + + +
anonymous enum
+
+
Enumerator:
+ +
LhsStorageOrder  +
+
+
+ +

Definition at line 202 of file Eigen_NumTraits.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename Index , bool ConjugateLhs, bool ConjugateRhs>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
static EIGEN_DONT_INLINE void Eigen::internal::general_matrix_vector_product< Index, stan::agrad::var, RowMajor, ConjugateLhs, stan::agrad::var, ConjugateRhs >::run (Index rows,
Index cols,
const LhsScalarlhs,
Index lhsStride,
const RhsScalarrhs,
Index rhsIncr,
ResScalarres,
Index resIncr,
const RhsScalaralpha 
)
+
+inlinestatic
+
+ +

Definition at line 204 of file Eigen_NumTraits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/struct_eigen_1_1internal_1_1scalar__product__traits_3_01double_00_01stan_1_1agrad_1_1var_01_4-members.html b/doc/api/html/struct_eigen_1_1internal_1_1scalar__product__traits_3_01double_00_01stan_1_1agrad_1_1var_01_4-members.html new file mode 100644 index 00000000000..e9ce8e3f72c --- /dev/null +++ b/doc/api/html/struct_eigen_1_1internal_1_1scalar__product__traits_3_01double_00_01stan_1_1agrad_1_1var_01_4-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
Eigen::internal::scalar_product_traits< double, stan::agrad::var > Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/struct_eigen_1_1internal_1_1scalar__product__traits_3_01double_00_01stan_1_1agrad_1_1var_01_4.html b/doc/api/html/struct_eigen_1_1internal_1_1scalar__product__traits_3_01double_00_01stan_1_1agrad_1_1var_01_4.html new file mode 100644 index 00000000000..77a1f2aba70 --- /dev/null +++ b/doc/api/html/struct_eigen_1_1internal_1_1scalar__product__traits_3_01double_00_01stan_1_1agrad_1_1var_01_4.html @@ -0,0 +1,148 @@ + + + + + +Stan: Eigen::internal::scalar_product_traits< double, stan::agrad::var > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
Eigen::internal::scalar_product_traits< double, stan::agrad::var > Struct Template Reference
+
+
+ +

Scalar product traits override for Eigen for automatic gradient variables. + More...

+ +

#include <Eigen_NumTraits.hpp>

+ + + + +

+Public Types

typedef stan::agrad::var ReturnType
 
+

Detailed Description

+

template<>
+struct Eigen::internal::scalar_product_traits< double, stan::agrad::var >

+ +

Scalar product traits override for Eigen for automatic gradient variables.

+ +

Definition at line 170 of file Eigen_NumTraits.hpp.

+

Member Typedef Documentation

+ +
+
+ + + + +
typedef stan::agrad::var Eigen::internal::scalar_product_traits< double, stan::agrad::var >::ReturnType
+
+ +

Definition at line 171 of file Eigen_NumTraits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/struct_eigen_1_1internal_1_1scalar__product__traits_3_01stan_1_1agrad_1_1var_00_01double_01_4-members.html b/doc/api/html/struct_eigen_1_1internal_1_1scalar__product__traits_3_01stan_1_1agrad_1_1var_00_01double_01_4-members.html new file mode 100644 index 00000000000..072c29e654d --- /dev/null +++ b/doc/api/html/struct_eigen_1_1internal_1_1scalar__product__traits_3_01stan_1_1agrad_1_1var_00_01double_01_4-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
Eigen::internal::scalar_product_traits< stan::agrad::var, double > Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/struct_eigen_1_1internal_1_1scalar__product__traits_3_01stan_1_1agrad_1_1var_00_01double_01_4.html b/doc/api/html/struct_eigen_1_1internal_1_1scalar__product__traits_3_01stan_1_1agrad_1_1var_00_01double_01_4.html new file mode 100644 index 00000000000..b66410d729a --- /dev/null +++ b/doc/api/html/struct_eigen_1_1internal_1_1scalar__product__traits_3_01stan_1_1agrad_1_1var_00_01double_01_4.html @@ -0,0 +1,148 @@ + + + + + +Stan: Eigen::internal::scalar_product_traits< stan::agrad::var, double > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
Eigen::internal::scalar_product_traits< stan::agrad::var, double > Struct Template Reference
+
+
+ +

Scalar product traits override for Eigen for automatic gradient variables. + More...

+ +

#include <Eigen_NumTraits.hpp>

+ + + + +

+Public Types

typedef stan::agrad::var ReturnType
 
+

Detailed Description

+

template<>
+struct Eigen::internal::scalar_product_traits< stan::agrad::var, double >

+ +

Scalar product traits override for Eigen for automatic gradient variables.

+ +

Definition at line 161 of file Eigen_NumTraits.hpp.

+

Member Typedef Documentation

+ +
+
+ + + + +
typedef stan::agrad::var Eigen::internal::scalar_product_traits< stan::agrad::var, double >::ReturnType
+
+ +

Definition at line 162 of file Eigen_NumTraits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/struct_eigen_1_1internal_1_1significant__decimals__default__impl_3_01stan_1_1agrad_1_1var_00_01false_01_4-members.html b/doc/api/html/struct_eigen_1_1internal_1_1significant__decimals__default__impl_3_01stan_1_1agrad_1_1var_00_01false_01_4-members.html new file mode 100644 index 00000000000..a330784645c --- /dev/null +++ b/doc/api/html/struct_eigen_1_1internal_1_1significant__decimals__default__impl_3_01stan_1_1agrad_1_1var_00_01false_01_4-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
Eigen::internal::significant_decimals_default_impl< stan::agrad::var, false > Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/struct_eigen_1_1internal_1_1significant__decimals__default__impl_3_01stan_1_1agrad_1_1var_00_01false_01_4.html b/doc/api/html/struct_eigen_1_1internal_1_1significant__decimals__default__impl_3_01stan_1_1agrad_1_1var_00_01false_01_4.html new file mode 100644 index 00000000000..aadd960d721 --- /dev/null +++ b/doc/api/html/struct_eigen_1_1internal_1_1significant__decimals__default__impl_3_01stan_1_1agrad_1_1var_00_01false_01_4.html @@ -0,0 +1,159 @@ + + + + + +Stan: Eigen::internal::significant_decimals_default_impl< stan::agrad::var, false > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
Eigen::internal::significant_decimals_default_impl< stan::agrad::var, false > Struct Template Reference
+
+
+ +

Implemented this for printing to stream. + More...

+ +

#include <Eigen_NumTraits.hpp>

+ + + + +

+Static Public Member Functions

static int run ()
 
+

Detailed Description

+

template<>
+struct Eigen::internal::significant_decimals_default_impl< stan::agrad::var, false >

+ +

Implemented this for printing to stream.

+ +

Definition at line 145 of file Eigen_NumTraits.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + +
static int Eigen::internal::significant_decimals_default_impl< stan::agrad::var, false >::run ()
+
+inlinestatic
+
+ +

Definition at line 147 of file Eigen_NumTraits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structdot__product__store__type.html b/doc/api/html/structdot__product__store__type.html new file mode 100644 index 00000000000..f0a98b476da --- /dev/null +++ b/doc/api/html/structdot__product__store__type.html @@ -0,0 +1,116 @@ + + + + + +Stan: dot_product_store_type< T > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ +
+
+
+
dot_product_store_type< T > Struct Template Reference
+
+
+ +

#include <dot_product.hpp>

+

Detailed Description

+

template<typename T>
+struct dot_product_store_type< T >

+ + +

Definition at line 22 of file dot_product.hpp.

+

The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structexpression__grammar.html b/doc/api/html/structexpression__grammar.html new file mode 100644 index 00000000000..66792b780c1 --- /dev/null +++ b/doc/api/html/structexpression__grammar.html @@ -0,0 +1,116 @@ + + + + + +Stan: expression_grammar< Iterator > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ +
+
+
+
expression_grammar< Iterator > Struct Template Reference
+
+
+ +

#include <expression_grammar.hpp>

+

Detailed Description

+

template<typename Iterator>
+struct expression_grammar< Iterator >

+ + +

Definition at line 22 of file expression_grammar.hpp.

+

The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1agrad_1_1_operands_and_partials-members.html b/doc/api/html/structstan_1_1agrad_1_1_operands_and_partials-members.html new file mode 100644 index 00000000000..5b0d988c956 --- /dev/null +++ b/doc/api/html/structstan_1_1agrad_1_1_operands_and_partials-members.html @@ -0,0 +1,124 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::agrad::OperandsAndPartials< T1, T2, T3, T4, T5, T6, T_return_type > Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1agrad_1_1_operands_and_partials.html b/doc/api/html/structstan_1_1agrad_1_1_operands_and_partials.html new file mode 100644 index 00000000000..3276f5c5b0b --- /dev/null +++ b/doc/api/html/structstan_1_1agrad_1_1_operands_and_partials.html @@ -0,0 +1,442 @@ + + + + + +Stan: stan::agrad::OperandsAndPartials< T1, T2, T3, T4, T5, T6, T_return_type > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::agrad::OperandsAndPartials< T1, T2, T3, T4, T5, T6, T_return_type > Struct Template Reference
+
+
+ +

A variable implementation that stores operands and derivatives with respect to the variable. + More...

+ +

#include <partials_vari.hpp>

+ + + + + + +

+Public Member Functions

 OperandsAndPartials (const T1 &x1=0, const T2 &x2=0, const T3 &x3=0, const T4 &x4=0, const T5 &x5=0, const T6 &x6=0)
 
T_return_type to_var (double logp)
 
+ + + + + + + + + + + + + + + + + + + +

+Public Attributes

size_t nvaris
 
agrad::vari ** all_varis
 
double * all_partials
 
VectorView< double
+*, is_vector< T1 >::value,
+is_constant_struct< T1 >
+::value > 
d_x1
 
VectorView< double
+*, is_vector< T2 >::value,
+is_constant_struct< T2 >
+::value > 
d_x2
 
VectorView< double
+*, is_vector< T3 >::value,
+is_constant_struct< T3 >
+::value > 
d_x3
 
VectorView< double
+*, is_vector< T4 >::value,
+is_constant_struct< T4 >
+::value > 
d_x4
 
VectorView< double
+*, is_vector< T5 >::value,
+is_constant_struct< T5 >
+::value > 
d_x5
 
VectorView< double
+*, is_vector< T6 >::value,
+is_constant_struct< T6 >
+::value > 
d_x6
 
+ + + +

+Static Public Attributes

static const bool all_constant = is_constant<T_return_type>::value
 
+

Detailed Description

+

template<typename T1 = double, typename T2 = double, typename T3 = double, typename T4 = double, typename T5 = double, typename T6 = double, typename T_return_type = typename return_type<T1,T2,T3,T4,T5,T6>::type>
+struct stan::agrad::OperandsAndPartials< T1, T2, T3, T4, T5, T6, T_return_type >

+ +

A variable implementation that stores operands and derivatives with respect to the variable.

+ +

Definition at line 76 of file partials_vari.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename T1 = double, typename T2 = double, typename T3 = double, typename T4 = double, typename T5 = double, typename T6 = double, typename T_return_type = typename return_type<T1,T2,T3,T4,T5,T6>::type>
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::agrad::OperandsAndPartials< T1, T2, T3, T4, T5, T6, T_return_type >::OperandsAndPartials (const T1 & x1 = 0,
const T2 & x2 = 0,
const T3 & x3 = 0,
const T4 & x4 = 0,
const T5 & x5 = 0,
const T6 & x6 = 0 
)
+
+inline
+
+ +

Definition at line 89 of file partials_vari.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename T1 = double, typename T2 = double, typename T3 = double, typename T4 = double, typename T5 = double, typename T6 = double, typename T_return_type = typename return_type<T1,T2,T3,T4,T5,T6>::type>
+ + + + + +
+ + + + + + + + +
T_return_type stan::agrad::OperandsAndPartials< T1, T2, T3, T4, T5, T6, T_return_type >::to_var (double logp)
+
+inline
+
+ +

Definition at line 138 of file partials_vari.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+
+template<typename T1 = double, typename T2 = double, typename T3 = double, typename T4 = double, typename T5 = double, typename T6 = double, typename T_return_type = typename return_type<T1,T2,T3,T4,T5,T6>::type>
+ + + + + +
+ + + + +
const bool stan::agrad::OperandsAndPartials< T1, T2, T3, T4, T5, T6, T_return_type >::all_constant = is_constant<T_return_type>::value
+
+static
+
+ +

Definition at line 77 of file partials_vari.hpp.

+ +
+
+ +
+
+
+template<typename T1 = double, typename T2 = double, typename T3 = double, typename T4 = double, typename T5 = double, typename T6 = double, typename T_return_type = typename return_type<T1,T2,T3,T4,T5,T6>::type>
+ + + + +
double* stan::agrad::OperandsAndPartials< T1, T2, T3, T4, T5, T6, T_return_type >::all_partials
+
+ +

Definition at line 80 of file partials_vari.hpp.

+ +
+
+ +
+
+
+template<typename T1 = double, typename T2 = double, typename T3 = double, typename T4 = double, typename T5 = double, typename T6 = double, typename T_return_type = typename return_type<T1,T2,T3,T4,T5,T6>::type>
+ + + + +
agrad::vari** stan::agrad::OperandsAndPartials< T1, T2, T3, T4, T5, T6, T_return_type >::all_varis
+
+ +

Definition at line 79 of file partials_vari.hpp.

+ +
+
+ +
+
+
+template<typename T1 = double, typename T2 = double, typename T3 = double, typename T4 = double, typename T5 = double, typename T6 = double, typename T_return_type = typename return_type<T1,T2,T3,T4,T5,T6>::type>
+ + + + +
VectorView<double*, is_vector<T1>::value, is_constant_struct<T1>::value> stan::agrad::OperandsAndPartials< T1, T2, T3, T4, T5, T6, T_return_type >::d_x1
+
+ +

Definition at line 82 of file partials_vari.hpp.

+ +
+
+ +
+
+
+template<typename T1 = double, typename T2 = double, typename T3 = double, typename T4 = double, typename T5 = double, typename T6 = double, typename T_return_type = typename return_type<T1,T2,T3,T4,T5,T6>::type>
+ + + + +
VectorView<double*, is_vector<T2>::value, is_constant_struct<T2>::value> stan::agrad::OperandsAndPartials< T1, T2, T3, T4, T5, T6, T_return_type >::d_x2
+
+ +

Definition at line 83 of file partials_vari.hpp.

+ +
+
+ +
+
+
+template<typename T1 = double, typename T2 = double, typename T3 = double, typename T4 = double, typename T5 = double, typename T6 = double, typename T_return_type = typename return_type<T1,T2,T3,T4,T5,T6>::type>
+ + + + +
VectorView<double*, is_vector<T3>::value, is_constant_struct<T3>::value> stan::agrad::OperandsAndPartials< T1, T2, T3, T4, T5, T6, T_return_type >::d_x3
+
+ +

Definition at line 84 of file partials_vari.hpp.

+ +
+
+ +
+
+
+template<typename T1 = double, typename T2 = double, typename T3 = double, typename T4 = double, typename T5 = double, typename T6 = double, typename T_return_type = typename return_type<T1,T2,T3,T4,T5,T6>::type>
+ + + + +
VectorView<double*, is_vector<T4>::value, is_constant_struct<T4>::value> stan::agrad::OperandsAndPartials< T1, T2, T3, T4, T5, T6, T_return_type >::d_x4
+
+ +

Definition at line 85 of file partials_vari.hpp.

+ +
+
+ +
+
+
+template<typename T1 = double, typename T2 = double, typename T3 = double, typename T4 = double, typename T5 = double, typename T6 = double, typename T_return_type = typename return_type<T1,T2,T3,T4,T5,T6>::type>
+ + + + +
VectorView<double*, is_vector<T5>::value, is_constant_struct<T5>::value> stan::agrad::OperandsAndPartials< T1, T2, T3, T4, T5, T6, T_return_type >::d_x5
+
+ +

Definition at line 86 of file partials_vari.hpp.

+ +
+
+ +
+
+
+template<typename T1 = double, typename T2 = double, typename T3 = double, typename T4 = double, typename T5 = double, typename T6 = double, typename T_return_type = typename return_type<T1,T2,T3,T4,T5,T6>::type>
+ + + + +
VectorView<double*, is_vector<T6>::value, is_constant_struct<T6>::value> stan::agrad::OperandsAndPartials< T1, T2, T3, T4, T5, T6, T_return_type >::d_x6
+
+ +

Definition at line 87 of file partials_vari.hpp.

+ +
+
+ +
+
+
+template<typename T1 = double, typename T2 = double, typename T3 = double, typename T4 = double, typename T5 = double, typename T6 = double, typename T_return_type = typename return_type<T1,T2,T3,T4,T5,T6>::type>
+ + + + +
size_t stan::agrad::OperandsAndPartials< T1, T2, T3, T4, T5, T6, T_return_type >::nvaris
+
+ +

Definition at line 78 of file partials_vari.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1agrad_1_1fvar-members.html b/doc/api/html/structstan_1_1agrad_1_1fvar-members.html new file mode 100644 index 00000000000..53ee34c209e --- /dev/null +++ b/doc/api/html/structstan_1_1agrad_1_1fvar-members.html @@ -0,0 +1,131 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::agrad::fvar< T > Member List
+
+
+ +

This is the complete list of members for stan::agrad::fvar< T >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + +
d_stan::agrad::fvar< T >
fvar(const TV &val, const TD &deriv)stan::agrad::fvar< T >inline
fvar(const TV &val)stan::agrad::fvar< T >inline
fvar()stan::agrad::fvar< T >inline
operator*=(const fvar< T2 > &x2)stan::agrad::fvar< T >inline
operator*=(const T2 &x2)stan::agrad::fvar< T >inline
operator++()stan::agrad::fvar< T >inline
operator++(int)stan::agrad::fvar< T >inline
operator+=(const fvar< T2 > &x2)stan::agrad::fvar< T >inline
operator+=(const T2 &x2)stan::agrad::fvar< T >inline
operator--()stan::agrad::fvar< T >inline
operator--(int)stan::agrad::fvar< T >inline
operator-=(const fvar< T2 > &x2)stan::agrad::fvar< T >inline
operator-=(const T2 &x2)stan::agrad::fvar< T >inline
operator/=(const fvar< T2 > &x2)stan::agrad::fvar< T >inline
operator/=(const T2 &x2)stan::agrad::fvar< T >inline
tangent()stan::agrad::fvar< T >inline
val()stan::agrad::fvar< T >inline
val_stan::agrad::fvar< T >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1agrad_1_1fvar.html b/doc/api/html/structstan_1_1agrad_1_1fvar.html new file mode 100644 index 00000000000..76dd004ff30 --- /dev/null +++ b/doc/api/html/structstan_1_1agrad_1_1fvar.html @@ -0,0 +1,715 @@ + + + + + +Stan: stan::agrad::fvar< T > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::agrad::fvar< T > Struct Template Reference
+
+
+ +

#include <fvar.hpp>

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

val ()
 
tangent ()
 
template<typename TV , typename TD >
 fvar (const TV &val, const TD &deriv)
 
template<typename TV >
 fvar (const TV &val)
 
 fvar ()
 
template<typename T2 >
fvar< T > & operator+= (const fvar< T2 > &x2)
 
template<typename T2 >
fvar< T > & operator+= (const T2 &x2)
 
template<typename T2 >
fvar< T > & operator-= (const fvar< T2 > &x2)
 
template<typename T2 >
fvar< T > & operator-= (const T2 &x2)
 
template<typename T2 >
fvar< T > & operator*= (const fvar< T2 > &x2)
 
template<typename T2 >
fvar< T > & operator*= (const T2 &x2)
 
template<typename T2 >
fvar< T > & operator/= (const fvar< T2 > &x2)
 
template<typename T2 >
fvar< T > & operator/= (const T2 &x2)
 
fvar< T > & operator++ ()
 
fvar< T > operator++ (int)
 
fvar< T > & operator-- ()
 
fvar< T > operator-- (int)
 
+ + + + + +

+Public Attributes

val_
 
d_
 
+

Detailed Description

+

template<typename T>
+struct stan::agrad::fvar< T >

+ + +

Definition at line 9 of file fvar.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename T>
+
+template<typename TV , typename TD >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
stan::agrad::fvar< T >::fvar (const TV & val,
const TD & deriv 
)
+
+inline
+
+ +

Definition at line 19 of file fvar.hpp.

+ +
+
+ +
+
+
+template<typename T>
+
+template<typename TV >
+ + + + + +
+ + + + + + + + +
stan::agrad::fvar< T >::fvar (const TV & val)
+
+inline
+
+ +

Definition at line 23 of file fvar.hpp.

+ +
+
+ +
+
+
+template<typename T>
+ + + + + +
+ + + + + + + +
stan::agrad::fvar< T >::fvar ()
+
+inline
+
+ +

Definition at line 25 of file fvar.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename T>
+
+template<typename T2 >
+ + + + + +
+ + + + + + + + +
fvar<T>& stan::agrad::fvar< T >::operator*= (const fvar< T2 > & x2)
+
+inline
+
+ +

Definition at line 64 of file fvar.hpp.

+ +
+
+ +
+
+
+template<typename T>
+
+template<typename T2 >
+ + + + + +
+ + + + + + + + +
fvar<T>& stan::agrad::fvar< T >::operator*= (const T2 & x2)
+
+inline
+
+ +

Definition at line 73 of file fvar.hpp.

+ +
+
+ +
+
+
+template<typename T>
+ + + + + +
+ + + + + + + +
fvar<T>& stan::agrad::fvar< T >::operator++ ()
+
+inline
+
+ +

Definition at line 99 of file fvar.hpp.

+ +
+
+ +
+
+
+template<typename T>
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::fvar< T >::operator++ (int )
+
+inline
+
+ +

Definition at line 106 of file fvar.hpp.

+ +
+
+ +
+
+
+template<typename T>
+
+template<typename T2 >
+ + + + + +
+ + + + + + + + +
fvar<T>& stan::agrad::fvar< T >::operator+= (const fvar< T2 > & x2)
+
+inline
+
+ +

Definition at line 30 of file fvar.hpp.

+ +
+
+ +
+
+
+template<typename T>
+
+template<typename T2 >
+ + + + + +
+ + + + + + + + +
fvar<T>& stan::agrad::fvar< T >::operator+= (const T2 & x2)
+
+inline
+
+ +

Definition at line 39 of file fvar.hpp.

+ +
+
+ +
+
+
+template<typename T>
+ + + + + +
+ + + + + + + +
fvar<T>& stan::agrad::fvar< T >::operator-- ()
+
+inline
+
+ +

Definition at line 114 of file fvar.hpp.

+ +
+
+ +
+
+
+template<typename T>
+ + + + + +
+ + + + + + + + +
fvar<T> stan::agrad::fvar< T >::operator-- (int )
+
+inline
+
+ +

Definition at line 120 of file fvar.hpp.

+ +
+
+ +
+
+
+template<typename T>
+
+template<typename T2 >
+ + + + + +
+ + + + + + + + +
fvar<T>& stan::agrad::fvar< T >::operator-= (const fvar< T2 > & x2)
+
+inline
+
+ +

Definition at line 47 of file fvar.hpp.

+ +
+
+ +
+
+
+template<typename T>
+
+template<typename T2 >
+ + + + + +
+ + + + + + + + +
fvar<T>& stan::agrad::fvar< T >::operator-= (const T2 & x2)
+
+inline
+
+ +

Definition at line 56 of file fvar.hpp.

+ +
+
+ +
+
+
+template<typename T>
+
+template<typename T2 >
+ + + + + +
+ + + + + + + + +
fvar<T>& stan::agrad::fvar< T >::operator/= (const fvar< T2 > & x2)
+
+inline
+
+ +

Definition at line 83 of file fvar.hpp.

+ +
+
+ +
+
+
+template<typename T>
+
+template<typename T2 >
+ + + + + +
+ + + + + + + + +
fvar<T>& stan::agrad::fvar< T >::operator/= (const T2 & x2)
+
+inline
+
+ +

Definition at line 92 of file fvar.hpp.

+ +
+
+ +
+
+
+template<typename T>
+ + + + + +
+ + + + + + + +
T stan::agrad::fvar< T >::tangent ()
+
+inline
+
+ +

Definition at line 15 of file fvar.hpp.

+ +
+
+ +
+
+
+template<typename T>
+ + + + + +
+ + + + + + + +
T stan::agrad::fvar< T >::val ()
+
+inline
+
+ +

Definition at line 14 of file fvar.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+
+template<typename T>
+ + + + +
T stan::agrad::fvar< T >::d_
+
+ +

Definition at line 12 of file fvar.hpp.

+ +
+
+ +
+
+
+template<typename T>
+ + + + +
T stan::agrad::fvar< T >::val_
+
+ +

Definition at line 11 of file fvar.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1contains__fvar-members.html b/doc/api/html/structstan_1_1contains__fvar-members.html new file mode 100644 index 00000000000..586a6132f96 --- /dev/null +++ b/doc/api/html/structstan_1_1contains__fvar-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::contains_fvar< T1, T2, T3, T4, T5, T6 > Member List
+
+
+ +

This is the complete list of members for stan::contains_fvar< T1, T2, T3, T4, T5, T6 >, including all inherited members.

+ + +
value enum valuestan::contains_fvar< T1, T2, T3, T4, T5, T6 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1contains__fvar.html b/doc/api/html/structstan_1_1contains__fvar.html new file mode 100644 index 00000000000..f386ae303c0 --- /dev/null +++ b/doc/api/html/structstan_1_1contains__fvar.html @@ -0,0 +1,157 @@ + + + + + +Stan: stan::contains_fvar< T1, T2, T3, T4, T5, T6 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::contains_fvar< T1, T2, T3, T4, T5, T6 > Struct Template Reference
+
+
+ +

Metaprogram to calculate the base scalar return type resulting from promoting all the scalar types of the template parameters. + More...

+ +

#include <traits.hpp>

+ + + + +

+Public Types

enum  { value + }
 
+

Detailed Description

+

template<typename T1, typename T2 = double, typename T3 = double, typename T4 = double, typename T5 = double, typename T6 = double>
+struct stan::contains_fvar< T1, T2, T3, T4, T5, T6 >

+ +

Metaprogram to calculate the base scalar return type resulting from promoting all the scalar types of the template parameters.

+ +

Definition at line 421 of file traits.hpp.

+

Member Enumeration Documentation

+ +
+
+
+template<typename T1 , typename T2 = double, typename T3 = double, typename T4 = double, typename T5 = double, typename T6 = double>
+ + + + +
anonymous enum
+
+
Enumerator:
+ +
value  +
+
+
+ +

Definition at line 422 of file traits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1add__conditional__body-members.html b/doc/api/html/structstan_1_1gm_1_1add__conditional__body-members.html new file mode 100644 index 00000000000..fa587880c81 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1add__conditional__body-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::add_conditional_body Member List
+
+
+ +

This is the complete list of members for stan::gm::add_conditional_body, including all inherited members.

+ + +
operator()(conditional_statement &cs, const statement &s) const stan::gm::add_conditional_bodyinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1add__conditional__body.html b/doc/api/html/structstan_1_1gm_1_1add__conditional__body.html new file mode 100644 index 00000000000..4b1266a5f76 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1add__conditional__body.html @@ -0,0 +1,169 @@ + + + + + +Stan: stan::gm::add_conditional_body Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::add_conditional_body Struct Reference
+
+
+ +

#include <statement_2_grammar_def.hpp>

+ + + + +

+Classes

struct  result
 
+ + + +

+Public Member Functions

void operator() (conditional_statement &cs, const statement &s) const
 
+

Detailed Description

+
+

Definition at line 75 of file statement_2_grammar_def.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::gm::add_conditional_body::operator() (conditional_statementcs,
const statements 
) const
+
+inline
+
+ +

Definition at line 78 of file statement_2_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1add__conditional__body_1_1result-members.html b/doc/api/html/structstan_1_1gm_1_1add__conditional__body_1_1result-members.html new file mode 100644 index 00000000000..0b33995ebb3 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1add__conditional__body_1_1result-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::add_conditional_body::result< T1, T2 > Member List
+
+
+ +

This is the complete list of members for stan::gm::add_conditional_body::result< T1, T2 >, including all inherited members.

+ + +
type typedefstan::gm::add_conditional_body::result< T1, T2 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1add__conditional__body_1_1result.html b/doc/api/html/structstan_1_1gm_1_1add__conditional__body_1_1result.html new file mode 100644 index 00000000000..78975d0e29f --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1add__conditional__body_1_1result.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::gm::add_conditional_body::result< T1, T2 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::add_conditional_body::result< T1, T2 > Struct Template Reference
+
+
+ +

#include <statement_2_grammar_def.hpp>

+ + + + +

+Public Types

typedef void type
 
+

Detailed Description

+

template<typename T1, typename T2>
+struct stan::gm::add_conditional_body::result< T1, T2 >

+ + +

Definition at line 77 of file statement_2_grammar_def.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 >
+ + + + +
typedef void stan::gm::add_conditional_body::result< T1, T2 >::type
+
+ +

Definition at line 77 of file statement_2_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1add__conditional__condition-members.html b/doc/api/html/structstan_1_1gm_1_1add__conditional__condition-members.html new file mode 100644 index 00000000000..25f54c0b34f --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1add__conditional__condition-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::add_conditional_condition Member List
+
+
+ +

This is the complete list of members for stan::gm::add_conditional_condition, including all inherited members.

+ + +
operator()(conditional_statement &cs, const expression &e, std::stringstream &error_msgs) const stan::gm::add_conditional_conditioninline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1add__conditional__condition.html b/doc/api/html/structstan_1_1gm_1_1add__conditional__condition.html new file mode 100644 index 00000000000..37cae60205e --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1add__conditional__condition.html @@ -0,0 +1,175 @@ + + + + + +Stan: stan::gm::add_conditional_condition Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::add_conditional_condition Struct Reference
+
+
+ +

#include <statement_2_grammar_def.hpp>

+ + + + +

+Classes

struct  result
 
+ + + +

+Public Member Functions

bool operator() (conditional_statement &cs, const expression &e, std::stringstream &error_msgs) const
 
+

Detailed Description

+
+

Definition at line 58 of file statement_2_grammar_def.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::gm::add_conditional_condition::operator() (conditional_statementcs,
const expressione,
std::stringstream & error_msgs 
) const
+
+inline
+
+ +

Definition at line 61 of file statement_2_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1add__conditional__condition_1_1result-members.html b/doc/api/html/structstan_1_1gm_1_1add__conditional__condition_1_1result-members.html new file mode 100644 index 00000000000..0f0b5cb417b --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1add__conditional__condition_1_1result-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::add_conditional_condition::result< T1, T2, T3 > Member List
+
+
+ +

This is the complete list of members for stan::gm::add_conditional_condition::result< T1, T2, T3 >, including all inherited members.

+ + +
type typedefstan::gm::add_conditional_condition::result< T1, T2, T3 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1add__conditional__condition_1_1result.html b/doc/api/html/structstan_1_1gm_1_1add__conditional__condition_1_1result.html new file mode 100644 index 00000000000..914431db24a --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1add__conditional__condition_1_1result.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::gm::add_conditional_condition::result< T1, T2, T3 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::add_conditional_condition::result< T1, T2, T3 > Struct Template Reference
+
+
+ +

#include <statement_2_grammar_def.hpp>

+ + + + +

+Public Types

typedef bool type
 
+

Detailed Description

+

template<typename T1, typename T2, typename T3>
+struct stan::gm::add_conditional_condition::result< T1, T2, T3 >

+ + +

Definition at line 60 of file statement_2_grammar_def.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 , typename T3 >
+ + + + +
typedef bool stan::gm::add_conditional_condition::result< T1, T2, T3 >::type
+
+ +

Definition at line 60 of file statement_2_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1add__expression__dimss-members.html b/doc/api/html/structstan_1_1gm_1_1add__expression__dimss-members.html new file mode 100644 index 00000000000..9a92468e626 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1add__expression__dimss-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::add_expression_dimss Member List
+
+
+ +

This is the complete list of members for stan::gm::add_expression_dimss, including all inherited members.

+ + +
operator()(expression &expression, std::vector< std::vector< stan::gm::expression > > &dimss, bool &pass, std::ostream &error_msgs) const stan::gm::add_expression_dimssinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1add__expression__dimss.html b/doc/api/html/structstan_1_1gm_1_1add__expression__dimss.html new file mode 100644 index 00000000000..01477ee51a7 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1add__expression__dimss.html @@ -0,0 +1,181 @@ + + + + + +Stan: stan::gm::add_expression_dimss Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::add_expression_dimss Struct Reference
+
+
+ +

#include <term_grammar_def.hpp>

+ + + + +

+Classes

struct  result
 
+ + + +

+Public Member Functions

expression operator() (expression &expression, std::vector< std::vector< stan::gm::expression > > &dimss, bool &pass, std::ostream &error_msgs) const
 
+

Detailed Description

+
+

Definition at line 343 of file term_grammar_def.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
expression stan::gm::add_expression_dimss::operator() (expressionexpression,
std::vector< std::vector< stan::gm::expression > > & dimss,
bool & pass,
std::ostream & error_msgs 
) const
+
+inline
+
+ +

Definition at line 346 of file term_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1add__expression__dimss_1_1result-members.html b/doc/api/html/structstan_1_1gm_1_1add__expression__dimss_1_1result-members.html new file mode 100644 index 00000000000..2e6a5763e3c --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1add__expression__dimss_1_1result-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::add_expression_dimss::result< T1, T2, T3, T4 > Member List
+
+
+ +

This is the complete list of members for stan::gm::add_expression_dimss::result< T1, T2, T3, T4 >, including all inherited members.

+ + +
type typedefstan::gm::add_expression_dimss::result< T1, T2, T3, T4 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1add__expression__dimss_1_1result.html b/doc/api/html/structstan_1_1gm_1_1add__expression__dimss_1_1result.html new file mode 100644 index 00000000000..0194a23137f --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1add__expression__dimss_1_1result.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::gm::add_expression_dimss::result< T1, T2, T3, T4 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::add_expression_dimss::result< T1, T2, T3, T4 > Struct Template Reference
+
+
+ +

#include <term_grammar_def.hpp>

+ + + + +

+Public Types

typedef T1 type
 
+

Detailed Description

+

template<typename T1, typename T2, typename T3, typename T4>
+struct stan::gm::add_expression_dimss::result< T1, T2, T3, T4 >

+ + +

Definition at line 345 of file term_grammar_def.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 , typename T3 , typename T4 >
+ + + + +
typedef T1 stan::gm::add_expression_dimss::result< T1, T2, T3, T4 >::type
+
+ +

Definition at line 345 of file term_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1add__loop__identifier-members.html b/doc/api/html/structstan_1_1gm_1_1add__loop__identifier-members.html new file mode 100644 index 00000000000..8e5c29245e3 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1add__loop__identifier-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::add_loop_identifier Member List
+
+
+ +

This is the complete list of members for stan::gm::add_loop_identifier, including all inherited members.

+ + +
operator()(const std::string &name, std::string &name_local, variable_map &vm, std::stringstream &error_msgs) const stan::gm::add_loop_identifierinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1add__loop__identifier.html b/doc/api/html/structstan_1_1gm_1_1add__loop__identifier.html new file mode 100644 index 00000000000..8ef09f82b1a --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1add__loop__identifier.html @@ -0,0 +1,181 @@ + + + + + +Stan: stan::gm::add_loop_identifier Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::add_loop_identifier Struct Reference
+
+
+ +

#include <statement_grammar_def.hpp>

+ + + + +

+Classes

struct  result
 
+ + + +

+Public Member Functions

bool operator() (const std::string &name, std::string &name_local, variable_map &vm, std::stringstream &error_msgs) const
 
+

Detailed Description

+
+

Definition at line 363 of file statement_grammar_def.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::gm::add_loop_identifier::operator() (const std::string & name,
std::string & name_local,
variable_mapvm,
std::stringstream & error_msgs 
) const
+
+inline
+
+ +

Definition at line 366 of file statement_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1add__loop__identifier_1_1result-members.html b/doc/api/html/structstan_1_1gm_1_1add__loop__identifier_1_1result-members.html new file mode 100644 index 00000000000..0c864b164e9 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1add__loop__identifier_1_1result-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::add_loop_identifier::result< T1, T2, T3, T4 > Member List
+
+
+ +

This is the complete list of members for stan::gm::add_loop_identifier::result< T1, T2, T3, T4 >, including all inherited members.

+ + +
type typedefstan::gm::add_loop_identifier::result< T1, T2, T3, T4 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1add__loop__identifier_1_1result.html b/doc/api/html/structstan_1_1gm_1_1add__loop__identifier_1_1result.html new file mode 100644 index 00000000000..e302c7784e5 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1add__loop__identifier_1_1result.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::gm::add_loop_identifier::result< T1, T2, T3, T4 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::add_loop_identifier::result< T1, T2, T3, T4 > Struct Template Reference
+
+
+ +

#include <statement_grammar_def.hpp>

+ + + + +

+Public Types

typedef bool type
 
+

Detailed Description

+

template<typename T1, typename T2, typename T3, typename T4>
+struct stan::gm::add_loop_identifier::result< T1, T2, T3, T4 >

+ + +

Definition at line 365 of file statement_grammar_def.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 , typename T3 , typename T4 >
+ + + + +
typedef bool stan::gm::add_loop_identifier::result< T1, T2, T3, T4 >::type
+
+ +

Definition at line 365 of file statement_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1add__while__body-members.html b/doc/api/html/structstan_1_1gm_1_1add__while__body-members.html new file mode 100644 index 00000000000..004ea2404d1 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1add__while__body-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::add_while_body Member List
+
+
+ +

This is the complete list of members for stan::gm::add_while_body, including all inherited members.

+ + +
operator()(while_statement &ws, const statement &s) const stan::gm::add_while_bodyinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1add__while__body.html b/doc/api/html/structstan_1_1gm_1_1add__while__body.html new file mode 100644 index 00000000000..271e23a074d --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1add__while__body.html @@ -0,0 +1,169 @@ + + + + + +Stan: stan::gm::add_while_body Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::add_while_body Struct Reference
+
+
+ +

#include <statement_grammar_def.hpp>

+ + + + +

+Classes

struct  result
 
+ + + +

+Public Member Functions

void operator() (while_statement &ws, const statement &s) const
 
+

Detailed Description

+
+

Definition at line 353 of file statement_grammar_def.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::gm::add_while_body::operator() (while_statementws,
const statements 
) const
+
+inline
+
+ +

Definition at line 356 of file statement_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1add__while__body_1_1result-members.html b/doc/api/html/structstan_1_1gm_1_1add__while__body_1_1result-members.html new file mode 100644 index 00000000000..d34dd351c98 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1add__while__body_1_1result-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::add_while_body::result< T1, T2 > Member List
+
+
+ +

This is the complete list of members for stan::gm::add_while_body::result< T1, T2 >, including all inherited members.

+ + +
type typedefstan::gm::add_while_body::result< T1, T2 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1add__while__body_1_1result.html b/doc/api/html/structstan_1_1gm_1_1add__while__body_1_1result.html new file mode 100644 index 00000000000..c1ddc777d44 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1add__while__body_1_1result.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::gm::add_while_body::result< T1, T2 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::add_while_body::result< T1, T2 > Struct Template Reference
+
+
+ +

#include <statement_grammar_def.hpp>

+ + + + +

+Public Types

typedef void type
 
+

Detailed Description

+

template<typename T1, typename T2>
+struct stan::gm::add_while_body::result< T1, T2 >

+ + +

Definition at line 355 of file statement_grammar_def.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 >
+ + + + +
typedef void stan::gm::add_while_body::result< T1, T2 >::type
+
+ +

Definition at line 355 of file statement_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1add__while__condition-members.html b/doc/api/html/structstan_1_1gm_1_1add__while__condition-members.html new file mode 100644 index 00000000000..7c850e53753 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1add__while__condition-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::add_while_condition Member List
+
+
+ +

This is the complete list of members for stan::gm::add_while_condition, including all inherited members.

+ + +
operator()(while_statement &ws, const expression &e, std::stringstream &error_msgs) const stan::gm::add_while_conditioninline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1add__while__condition.html b/doc/api/html/structstan_1_1gm_1_1add__while__condition.html new file mode 100644 index 00000000000..acd2fd0879b --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1add__while__condition.html @@ -0,0 +1,175 @@ + + + + + +Stan: stan::gm::add_while_condition Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::add_while_condition Struct Reference
+
+
+ +

#include <statement_grammar_def.hpp>

+ + + + +

+Classes

struct  result
 
+ + + +

+Public Member Functions

bool operator() (while_statement &ws, const expression &e, std::stringstream &error_msgs) const
 
+

Detailed Description

+
+

Definition at line 336 of file statement_grammar_def.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::gm::add_while_condition::operator() (while_statementws,
const expressione,
std::stringstream & error_msgs 
) const
+
+inline
+
+ +

Definition at line 339 of file statement_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1add__while__condition_1_1result-members.html b/doc/api/html/structstan_1_1gm_1_1add__while__condition_1_1result-members.html new file mode 100644 index 00000000000..22a7bd84e61 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1add__while__condition_1_1result-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::add_while_condition::result< T1, T2, T3 > Member List
+
+
+ +

This is the complete list of members for stan::gm::add_while_condition::result< T1, T2, T3 >, including all inherited members.

+ + +
type typedefstan::gm::add_while_condition::result< T1, T2, T3 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1add__while__condition_1_1result.html b/doc/api/html/structstan_1_1gm_1_1add__while__condition_1_1result.html new file mode 100644 index 00000000000..5e47fc1aec4 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1add__while__condition_1_1result.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::gm::add_while_condition::result< T1, T2, T3 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::add_while_condition::result< T1, T2, T3 > Struct Template Reference
+
+
+ +

#include <statement_grammar_def.hpp>

+ + + + +

+Public Types

typedef bool type
 
+

Detailed Description

+

template<typename T1, typename T2, typename T3>
+struct stan::gm::add_while_condition::result< T1, T2, T3 >

+ + +

Definition at line 338 of file statement_grammar_def.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 , typename T3 >
+ + + + +
typedef bool stan::gm::add_while_condition::result< T1, T2, T3 >::type
+
+ +

Definition at line 338 of file statement_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1addition__expr-members.html b/doc/api/html/structstan_1_1gm_1_1addition__expr-members.html new file mode 100644 index 00000000000..8844d4e7c64 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1addition__expr-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::addition_expr Member List
+
+
+ +

This is the complete list of members for stan::gm::addition_expr, including all inherited members.

+ + +
operator()(expression &expr1, const expression &expr2, std::ostream &error_msgs) const stan::gm::addition_exprinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1addition__expr.html b/doc/api/html/structstan_1_1gm_1_1addition__expr.html new file mode 100644 index 00000000000..31e40f3d081 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1addition__expr.html @@ -0,0 +1,175 @@ + + + + + +Stan: stan::gm::addition_expr Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::addition_expr Struct Reference
+
+
+ +

#include <expression_grammar_def.hpp>

+ + + + +

+Classes

struct  result
 
+ + + +

+Public Member Functions

expression operator() (expression &expr1, const expression &expr2, std::ostream &error_msgs) const
 
+

Detailed Description

+
+

Definition at line 119 of file expression_grammar_def.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
expression stan::gm::addition_expr::operator() (expressionexpr1,
const expressionexpr2,
std::ostream & error_msgs 
) const
+
+inline
+
+ +

Definition at line 123 of file expression_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1addition__expr_1_1result-members.html b/doc/api/html/structstan_1_1gm_1_1addition__expr_1_1result-members.html new file mode 100644 index 00000000000..073e63e03eb --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1addition__expr_1_1result-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::addition_expr::result< T1, T2, T3 > Member List
+
+
+ +

This is the complete list of members for stan::gm::addition_expr::result< T1, T2, T3 >, including all inherited members.

+ + +
type typedefstan::gm::addition_expr::result< T1, T2, T3 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1addition__expr_1_1result.html b/doc/api/html/structstan_1_1gm_1_1addition__expr_1_1result.html new file mode 100644 index 00000000000..65233b6a738 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1addition__expr_1_1result.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::gm::addition_expr::result< T1, T2, T3 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::addition_expr::result< T1, T2, T3 > Struct Template Reference
+
+
+ +

#include <expression_grammar_def.hpp>

+ + + + +

+Public Types

typedef expression type
 
+

Detailed Description

+

template<typename T1, typename T2, typename T3>
+struct stan::gm::addition_expr::result< T1, T2, T3 >

+ + +

Definition at line 121 of file expression_grammar_def.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 , typename T3 >
+ + + + +
typedef expression stan::gm::addition_expr::result< T1, T2, T3 >::type
+
+ +

Definition at line 121 of file expression_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1array__literal-members.html b/doc/api/html/structstan_1_1gm_1_1array__literal-members.html new file mode 100644 index 00000000000..b5c20e9a3b7 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1array__literal-members.html @@ -0,0 +1,117 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::array_literal Member List
+
+
+ +

This is the complete list of members for stan::gm::array_literal, including all inherited members.

+ + + + + + +
args_stan::gm::array_literal
array_literal()stan::gm::array_literal
array_literal(const std::vector< expression > &args)stan::gm::array_literal
operator=(const array_literal &al)stan::gm::array_literal
type_stan::gm::array_literal
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1array__literal.html b/doc/api/html/structstan_1_1gm_1_1array__literal.html new file mode 100644 index 00000000000..6bc8405dc92 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1array__literal.html @@ -0,0 +1,223 @@ + + + + + +Stan: stan::gm::array_literal Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::array_literal Struct Reference
+
+
+ +

#include <ast.hpp>

+ + + + + + + + +

+Public Member Functions

 array_literal ()
 
 array_literal (const std::vector< expression > &args)
 
array_literaloperator= (const array_literal &al)
 
+ + + + + +

+Public Attributes

std::vector< expressionargs_
 
expr_type type_
 
+

Detailed Description

+
+

Definition at line 290 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::array_literal::array_literal ()
+
+ +

Definition at line 545 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::array_literal::array_literal (const std::vector< expression > & args)
+
+ +

Definition at line 549 of file ast_def.cpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + + + + +
array_literal & stan::gm::array_literal::operator= (const array_literalal)
+
+ +

Definition at line 553 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
std::vector<expression> stan::gm::array_literal::args_
+
+ +

Definition at line 291 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
expr_type stan::gm::array_literal::type_
+
+ +

Definition at line 292 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1assignment-members.html b/doc/api/html/structstan_1_1gm_1_1assignment-members.html new file mode 100644 index 00000000000..85affa8901b --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1assignment-members.html @@ -0,0 +1,117 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::assignment Member List
+
+
+ +

This is the complete list of members for stan::gm::assignment, including all inherited members.

+ + + + + + +
assignment()stan::gm::assignment
assignment(variable_dims &var_dims, expression &expr)stan::gm::assignment
expr_stan::gm::assignment
var_dims_stan::gm::assignment
var_type_stan::gm::assignment
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1assignment.html b/doc/api/html/structstan_1_1gm_1_1assignment.html new file mode 100644 index 00000000000..7d01e61f140 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1assignment.html @@ -0,0 +1,228 @@ + + + + + +Stan: stan::gm::assignment Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::assignment Struct Reference
+
+
+ +

#include <ast.hpp>

+ + + + + + +

+Public Member Functions

 assignment ()
 
 assignment (variable_dims &var_dims, expression &expr)
 
+ + + + + + + +

+Public Attributes

variable_dims var_dims_
 
expression expr_
 
base_var_decl var_type_
 
+

Detailed Description

+
+

Definition at line 687 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::assignment::assignment ()
+
+ +

Definition at line 1011 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
stan::gm::assignment::assignment (variable_dimsvar_dims,
expressionexpr 
)
+
+ +

Definition at line 1013 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
expression stan::gm::assignment::expr_
+
+ +

Definition at line 689 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
variable_dims stan::gm::assignment::var_dims_
+
+ +

Definition at line 688 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
base_var_decl stan::gm::assignment::var_type_
+
+ +

Definition at line 690 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1base__var__decl-members.html b/doc/api/html/structstan_1_1gm_1_1base__var__decl-members.html new file mode 100644 index 00000000000..a231f1a7746 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1base__var__decl-members.html @@ -0,0 +1,118 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::base_var_decl Member List
+
+
+ +

This is the complete list of members for stan::gm::base_var_decl, including all inherited members.

+ + + + + + + +
base_type_stan::gm::base_var_decl
base_var_decl()stan::gm::base_var_decl
base_var_decl(const base_expr_type &base_type)stan::gm::base_var_decl
base_var_decl(const std::string &name, const std::vector< expression > &dims, const base_expr_type &base_type)stan::gm::base_var_decl
dims_stan::gm::base_var_decl
name_stan::gm::base_var_decl
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1base__var__decl.html b/doc/api/html/structstan_1_1gm_1_1base__var__decl.html new file mode 100644 index 00000000000..9affa24e301 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1base__var__decl.html @@ -0,0 +1,274 @@ + + + + + +Stan: stan::gm::base_var_decl Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::base_var_decl Struct Reference
+
+
+ +

#include <ast.hpp>

+
+Inheritance diagram for stan::gm::base_var_decl:
+
+
+ + +stan::gm::cholesky_factor_var_decl +stan::gm::corr_matrix_var_decl +stan::gm::cov_matrix_var_decl +stan::gm::double_var_decl +stan::gm::int_var_decl +stan::gm::matrix_var_decl +stan::gm::ordered_var_decl +stan::gm::positive_ordered_var_decl +stan::gm::row_vector_var_decl +stan::gm::simplex_var_decl +stan::gm::unit_vector_var_decl +stan::gm::vector_var_decl + +
+ + + + + + + + +

+Public Member Functions

 base_var_decl ()
 
 base_var_decl (const base_expr_type &base_type)
 
 base_var_decl (const std::string &name, const std::vector< expression > &dims, const base_expr_type &base_type)
 
+ + + + + + + +

+Public Attributes

std::string name_
 
std::vector< expressiondims_
 
base_expr_type base_type_
 
+

Detailed Description

+
+

Definition at line 381 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::base_var_decl::base_var_decl ()
+
+ +

Definition at line 678 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::base_var_decl::base_var_decl (const base_expr_typebase_type)
+
+ +

Definition at line 679 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
stan::gm::base_var_decl::base_var_decl (const std::string & name,
const std::vector< expression > & dims,
const base_expr_typebase_type 
)
+
+ +

Definition at line 682 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
base_expr_type stan::gm::base_var_decl::base_type_
+
+ +

Definition at line 384 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
std::vector<expression> stan::gm::base_var_decl::dims_
+
+ +

Definition at line 383 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
std::string stan::gm::base_var_decl::name_
+
+ +

Definition at line 382 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1base__var__decl.png b/doc/api/html/structstan_1_1gm_1_1base__var__decl.png new file mode 100644 index 0000000000000000000000000000000000000000..3635ae02fe955ae64c0bc521680430401b257788 GIT binary patch literal 6084 zcmdT|2~bn#z7M4qmx`buDq(p6K~UM0J&Lv{DkO>tqO4L>1WYhMSY!!8l>h=R1r&%_ ztzrU%3WNm0rX(P;RWYC>EFQ|1utP-FyboyaZF}FH&YkIfGtEpUC+8$*&V0Y`xBcTz zpl#N#-L@76gRMV$#QG!*CdGomK4Yzx24@WCx4^;2mJ@c^LlTJu91aYLiODZ+f}`bk zRaMohIDs1Yx;pSA8Uq7AT6*zbVU1ugCCpLlgV+$MVTvdfGLx%O=!JJmZl!6NYHRK_ zC^T55=DR&czqfOvp5(EpbVOR})202BBtr~3l-QGR@sXKIZf^D6%`eAJf3pE|eU(VRenhF}Sl5=IYY@d5wRh<%*Vt-g2KoC zG`Hk9<;^#wYV>W5Rd#;3$~s?2mQMZnQUVoEbm-vkg}M&cBn^WI_btvFfzZ>$w^C+ZN)u}ua54k7xT>X{g}$Oq5@rLF70?5xh%6mCH4bsAsl7`PlgF>IZ}e^tp07?`SQP8h6n2MGAC~O$+Zz(r$b?%M^#p> zQHQ-nKrkV}f(t)jj*xwz>g8uBb0U!}z2j(+l!E5JtmMiqz~v*HzvA+QDj}k4T5WYz zPRJcIUa|&+UAK`y1IY2BtuuWNRvdT9o>dna^H;Ow+3X9{&TgN^H}V8ps-j*^5KR-{#5?=VW$lfi|W%I8Y`-`65@h<3a7_p@}k43 zEc54>VoO)X)w=GH29)Go-&B55jgfax@l1Jc|E0qq182ed4gQUqOD+y~)Rq{dKKKJMd(K!bjOFu3vT@XTlwkafi*mgRQyWk0SK;M!0F)zl;R9-oA+5nM$iFu4Snml^YS!#` zskS!RICjIOiT2HW;&{2mk)9t2%=2BYgvqx-XXn>tQ(B$FQ_OhIxf^M-TSzPyaU=qd z;bXHrEw)&x@iO4e>^)y`jMrcy($nrU$(Y?oIn>RXzggDs7*@sTT(fkyLzxZy04yZ^ zFT?Wpl>5_-GAiFT9U-|2D~mUc!z`E~&mUH!Dy_}v(;g#adS`vwpz-m0M#x6D7mHJgnDkH$)LmY&C<1}T zwcq^Nke7z^Z7aT7ch)ihJwJ82V1IpvTMl<8A;+M;E0A%VLq#c17+!c>*Q3S6^`+L; z4}C-y7dr3pwH!ugY-0HCg5DN45(ivvEf%ndoIF-ZkXy=&nXzV(M3Io)GC1Wg%TZCN zs#M22uVX6umA%B@XNiMo%Ko(~WPS;Seodf*_v*U^_#B-2>U*Qzv1j#yg7EzF7bZ&` zbV-P&x-Lc2Ca1WqS6b(+GlkM{O*^r>I)r5kK0VH%o2%W(N*1D$`a6{W2g3SIT-@g1 zZu zAq$=)MrX`Z*`;y6lPZBGk!fC)#IocN`+o?W?8$ss@4Iz=>sD3NXm5Sd0~O~ddWNJ~ zy@f_jXzv!hW~c_ICC~8$ke`L zq6128@Y}b`+xHIBu2a4Zjcd#uF3K^{_GvrKq0-L?J5IN$Dll~ehVQvtT%)}zr~lEF zJ3XP(hfkz!CeSRAnMZj_zZJe;*#NW}kR%k4WST6!8g_is|Dosq9|Zn+A2eGrY9$xt zIIcyYsoDH-6AC5bIA zZ})=teNz^^oHjbE(Q3N-XU;w+-R#@qV9xrhsqZn{k#fwTx#RJc6m)i4Kr#y`?oMsI zVtL7$4QRnEmez^T#!n~l$R7Z7M-md&QE1Q;nLmP_o{30UR3anqNnQCVEghcGRD<#$5yV(xr@tE%V+OSx4n64(TLq~NGt{J#=ZH%@D@sF zYSDgfw72q1vAI3F1|fTvivdaLd~-rZe2?6@oa zj>^l(!R~AQw{y_H(b|_`9C1V!Ngb9Cp&+ak*ni9B_)kA4dQ*gjb_r_h{Eg=-dgZhA zhV#K5%_2*`>p>Gb%so2h&9X-)oW39(zFvF#!=R{OBzyEtmmT~C>T31}tr4WrNban% zJo8*IKFu*Z2k0rB-IqVm#VuwixPb4|Q1E-?A@XV#5U#Y^g872#T@$e`ktRY&i-o(BEtl{5k@^Zbi``4XixYGgyjij z%tDG)LxIp;>u(GpYrKWJzkVDFt9EOg!+CHH!K-kK_5i!1OV|yqU}w`3He(d%em{f$ zp{x4kH{V$LF=`8Z(rH($Iqyq~?7yX;lzZ(aQtwT^711vYJGofq&q$xjF{#|h+lj#2 zy}tWYi;)q?tQ&f}o>J-&aXH;@CE1MZOu^(`aTEL)k`%BVMA*i%M%8*62`v~5v?$MX z=i+R8TeL@*F$~wB2&gr|A^BxoVSslSbSk)$&f=*si#z&AW|!GZI(ms!h?V8~m@8pq z^;Iav!$tw84E4?s8Gw?3N$(b=aNpu|9Lfs(nza)Mg)ttTmXOF z0e_Pm6kftYi%C8A1{{55!Sf3x)&Ta#tE`dCTVT*I84$WV#!935QQe2K3k?HEv*0i7 zQ>!qw<8Lp-dhi{9CGkzpkq8FD)9qE~F53<4T{t4(`93SM_$pSTG5=vG760i1!4}Fu z;{DmLTpo$eUZf0_KPs6mwenX4!8kbW71dy&gf*z3_gt2X;u7wbYU7o`1>Y4-HkV`W zPDzeeUgXC+Z=ZX@>M0BXf3qE7NfUA`N1X&IiQ@_?odg?<=~AjaqZ|9G2p+BDk(Pw! zn>ey4BJYa5wXYqfdZ@~VUpH%!g~nYw(c;ZAYcLB+0IuDpk%K<`rfjJH(X4VUMr}2S zv$e?d!@Rb?b*`NUxz^LGZj*h`<^|R5(BiIM+D?RQcmCyA0P0f!YD>@xsGf{-JS)A@ z%WD`Lf84gsF%N3i2vFd8BJi&yh_hqwKmmO~L1oP4KP;MYpFM1w)99FBQYpt%LEsl7 zlIwilu#bjj{1jSum7Yj3`MJ+}cv}K%&bAkuKeDOqyH~!1ufI!SQO(d_w?V0Sl7lPF zb3`tfGVjjy4(7GqF$sQ1p|kcAL>TH7JG7uvg(=UhsF2OYjj}#O;e_MM6D3E1t8Q#G zBQsGac?s2GM_qn2pX}5XA5auD8TxuEo;3$33QZ$BO>M;bV9vs1jl$rK=4uZ>4ZYqY z&vOULoFTZ^k!coHS?3OjD%tYKj<lL6rcL>h=aRrRAy9Unao+CMx}L9#v+u z)QM$21D#kCE$;ajK~ZX>?yn6U)X&LU6UpdP2Q!ELU~D$;4v!N>CN<2PX%7JF)z|hR z=3e)1X~=3rn#iJDZ3R@%HHDORyg|5kjCE$IPt0xmhV9ku4BT0xki7w-z)7cFDs~+= zZag!6hBXamuzIHjn*MhLCPcPV5(hVxYwD&obi-v8XsEp)`Pz|o;d4W*zK`5ws#xnG zywAeP@pk7cu0-G?f@0XBA|dBomqKv(=KScV_&SwfO?9wdcvkl~20a5Ey1n^hfhQw=eHY-~wdTJ!ujc$im#jtkU+P zN$RJWr;9b?Z)KLWYQ1XXBcbiz*m@E4nLrwevqzrZDp1sf0833IKLVEK0hR^?|02Dp z(Q6)k1tG%IefaER`|J9+o8+(qf(Pdm0*+P$;gs)wS-gjt&wbN6zW9>G(@GVh5OgZq zvnCzxH_>^4X!<_yK5^>&i>8+jay-7Z;G}N$Lt+-|8MM$KK?$(%SZWwld=O+Dr(YPl zk?9T_m1iFNh$7T_jq8$yI5%C{ZZVQri{s>tlsQD~tLUL01MFNI46hP}KETR4_?oL@ zjFvJKu40S6ZEc%^hofLiSj6UK92XKn=%ui4Q)hKS9ySTi`i#hHk{RfKRQe&rTC57r rDJ|~e(nz3?{h=xFqJNqE^;ng^Q1O_T)!>1VJM8Eov^D*!v(f(xP<`nr literal 0 HcmV?d00001 diff --git a/doc/api/html/structstan_1_1gm_1_1binary__op-members.html b/doc/api/html/structstan_1_1gm_1_1binary__op-members.html new file mode 100644 index 00000000000..11e62cba531 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1binary__op-members.html @@ -0,0 +1,118 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::binary_op Member List
+
+
+ +

This is the complete list of members for stan::gm::binary_op, including all inherited members.

+ + + + + + + +
binary_op()stan::gm::binary_op
binary_op(const expression &left, const std::string &op, const expression &right)stan::gm::binary_op
leftstan::gm::binary_op
opstan::gm::binary_op
rightstan::gm::binary_op
type_stan::gm::binary_op
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1binary__op.html b/doc/api/html/structstan_1_1gm_1_1binary__op.html new file mode 100644 index 00000000000..c99bd99796b --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1binary__op.html @@ -0,0 +1,250 @@ + + + + + +Stan: stan::gm::binary_op Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::binary_op Struct Reference
+
+
+ +

#include <ast.hpp>

+ + + + + + +

+Public Member Functions

 binary_op ()
 
 binary_op (const expression &left, const std::string &op, const expression &right)
 
+ + + + + + + + + +

+Public Attributes

std::string op
 
expression left
 
expression right
 
expr_type type_
 
+

Detailed Description

+
+

Definition at line 339 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::binary_op::binary_op ()
+
+ +

Definition at line 625 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
stan::gm::binary_op::binary_op (const expressionleft,
const std::string & op,
const expressionright 
)
+
+ +

Definition at line 626 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
expression stan::gm::binary_op::left
+
+ +

Definition at line 341 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
std::string stan::gm::binary_op::op
+
+ +

Definition at line 340 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
expression stan::gm::binary_op::right
+
+ +

Definition at line 342 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
expr_type stan::gm::binary_op::type_
+
+ +

Definition at line 343 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1binary__op__expr-members.html b/doc/api/html/structstan_1_1gm_1_1binary__op__expr-members.html new file mode 100644 index 00000000000..360eda0b1f7 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1binary__op__expr-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::binary_op_expr Member List
+
+
+ +

This is the complete list of members for stan::gm::binary_op_expr, including all inherited members.

+ + +
operator()(expression &expr1, const expression &expr2, const std::string &op, const std::string &fun_name, std::ostream &error_msgs) const stan::gm::binary_op_exprinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1binary__op__expr.html b/doc/api/html/structstan_1_1gm_1_1binary__op__expr.html new file mode 100644 index 00000000000..8a7c89dc896 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1binary__op__expr.html @@ -0,0 +1,187 @@ + + + + + +Stan: stan::gm::binary_op_expr Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::binary_op_expr Struct Reference
+
+
+ +

#include <expression_grammar_def.hpp>

+ + + + +

+Classes

struct  result
 
+ + + +

+Public Member Functions

expression operator() (expression &expr1, const expression &expr2, const std::string &op, const std::string &fun_name, std::ostream &error_msgs) const
 
+

Detailed Description

+
+

Definition at line 87 of file expression_grammar_def.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
expression stan::gm::binary_op_expr::operator() (expressionexpr1,
const expressionexpr2,
const std::string & op,
const std::string & fun_name,
std::ostream & error_msgs 
) const
+
+inline
+
+ +

Definition at line 91 of file expression_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1binary__op__expr_1_1result-members.html b/doc/api/html/structstan_1_1gm_1_1binary__op__expr_1_1result-members.html new file mode 100644 index 00000000000..d70f01dc3fe --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1binary__op__expr_1_1result-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::binary_op_expr::result< T1, T2, T3, T4, T5 > Member List
+
+
+ +

This is the complete list of members for stan::gm::binary_op_expr::result< T1, T2, T3, T4, T5 >, including all inherited members.

+ + +
type typedefstan::gm::binary_op_expr::result< T1, T2, T3, T4, T5 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1binary__op__expr_1_1result.html b/doc/api/html/structstan_1_1gm_1_1binary__op__expr_1_1result.html new file mode 100644 index 00000000000..2d56bfc1a44 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1binary__op__expr_1_1result.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::gm::binary_op_expr::result< T1, T2, T3, T4, T5 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::binary_op_expr::result< T1, T2, T3, T4, T5 > Struct Template Reference
+
+
+ +

#include <expression_grammar_def.hpp>

+ + + + +

+Public Types

typedef expression type
 
+

Detailed Description

+

template<typename T1, typename T2, typename T3, typename T4, typename T5>
+struct stan::gm::binary_op_expr::result< T1, T2, T3, T4, T5 >

+ + +

Definition at line 89 of file expression_grammar_def.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 , typename T3 , typename T4 , typename T5 >
+ + + + +
typedef expression stan::gm::binary_op_expr::result< T1, T2, T3, T4, T5 >::type
+
+ +

Definition at line 89 of file expression_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1cholesky__factor__var__decl-members.html b/doc/api/html/structstan_1_1gm_1_1cholesky__factor__var__decl-members.html new file mode 100644 index 00000000000..68a208b638e --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1cholesky__factor__var__decl-members.html @@ -0,0 +1,122 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::cholesky_factor_var_decl Member List
+
+
+ +

This is the complete list of members for stan::gm::cholesky_factor_var_decl, including all inherited members.

+ + + + + + + + + + + +
base_type_stan::gm::base_var_decl
base_var_decl()stan::gm::base_var_decl
base_var_decl(const base_expr_type &base_type)stan::gm::base_var_decl
base_var_decl(const std::string &name, const std::vector< expression > &dims, const base_expr_type &base_type)stan::gm::base_var_decl
cholesky_factor_var_decl()stan::gm::cholesky_factor_var_decl
cholesky_factor_var_decl(expression const &M, expression const &N, std::string const &name, std::vector< expression > const &dims)stan::gm::cholesky_factor_var_decl
dims_stan::gm::base_var_decl
M_stan::gm::cholesky_factor_var_decl
N_stan::gm::cholesky_factor_var_decl
name_stan::gm::base_var_decl
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1cholesky__factor__var__decl.html b/doc/api/html/structstan_1_1gm_1_1cholesky__factor__var__decl.html new file mode 100644 index 00000000000..2ecc8d0664e --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1cholesky__factor__var__decl.html @@ -0,0 +1,247 @@ + + + + + +Stan: stan::gm::cholesky_factor_var_decl Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::cholesky_factor_var_decl Struct Reference
+
+
+ +

#include <ast.hpp>

+
+Inheritance diagram for stan::gm::cholesky_factor_var_decl:
+
+
+ + +stan::gm::base_var_decl + +
+ + + + + + + + + + + + + +

+Public Member Functions

 cholesky_factor_var_decl ()
 
 cholesky_factor_var_decl (expression const &M, expression const &N, std::string const &name, std::vector< expression > const &dims)
 
- Public Member Functions inherited from stan::gm::base_var_decl
 base_var_decl ()
 
 base_var_decl (const base_expr_type &base_type)
 
 base_var_decl (const std::string &name, const std::vector< expression > &dims, const base_expr_type &base_type)
 
+ + + + + + + + + + + + +

+Public Attributes

expression M_
 
expression N_
 
- Public Attributes inherited from stan::gm::base_var_decl
std::string name_
 
std::vector< expressiondims_
 
base_expr_type base_type_
 
+

Detailed Description

+
+

Definition at line 487 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::cholesky_factor_var_decl::cholesky_factor_var_decl ()
+
+ +

Definition at line 820 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::gm::cholesky_factor_var_decl::cholesky_factor_var_decl (expression const & M,
expression const & N,
std::string const & name,
std::vector< expression > const & dims 
)
+
+ +

Definition at line 823 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
expression stan::gm::cholesky_factor_var_decl::M_
+
+ +

Definition at line 488 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
expression stan::gm::cholesky_factor_var_decl::N_
+
+ +

Definition at line 489 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1cholesky__factor__var__decl.png b/doc/api/html/structstan_1_1gm_1_1cholesky__factor__var__decl.png new file mode 100644 index 0000000000000000000000000000000000000000..41a8dd18fd63f47f3ad0437b61609ea331a80d7c GIT binary patch literal 792 zcmeAS@N?(olHy`uVBq!ia0vp^mw-5cgBeIh+uvRcq$C1-LR|m<{|{uoc=NTi|Ih>= z3ycpOIKbL@M;^%KC<*clW&kPzfvcxNj2IZ0mV3H5hEy=VoqJJeu>y}P|Mi*w{;RJS z6X1y2x;1uM>apzA6DBx2)uhf^wo>2FGss`cW73sfY?D;BuFLlDn{@8gr4&!2Rd4*Q z{>-0v=goz++i(8;tj?>a{BN4lhu}SqKPM#BX!Sfj_Aha3Z?Ni1hxCax8x)_Y&v^3b zwDzW{!B3{FW7<_Q^P<}4ORXxhFPVb6jvWhgjeVlfpDw&o?nc^Aw}(fgcCIxs&bBaA@_b(6 zKh3V!X;R+h+*WnZ+zbWJpx0o}rY*^wwQL>B2WeY|UqSUA{qE&He-+QV>@_UyFtL(z z_$}qZur^zPam%_!mJ7SsgdBjn@CzK6U36~ez82;ep3IyJN_kZpuBA@6_fR``O}lS@ zaX8ba*Plx-ckgcs+5emG(xzhX;P2a06*hl7Yj@|9f0UWA-O>7gTeo*8?~F{Fx^{N{ zrmxf2%I>q&1GvO@6C>ZFwS} zqWL*uE^~B+yT|XJn|0XJPb!F}XY2o-ovvx~UU}x`5YvshOCE2Yaw_HI(_OX~7rfzm zeLG3`yVbp8&)Pj#?tdn`{?+Nite>gYZz>q{zn)wE*si!?vQ>MCD9ZuWwa0DVXdhVj z?fKk~1xDWKOpG@!zb`6T`hnpeCn#7 + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::conditional_statement Member List
+
+
+ +

This is the complete list of members for stan::gm::conditional_statement, including all inherited members.

+ + + + + +
bodies_stan::gm::conditional_statement
conditional_statement()stan::gm::conditional_statement
conditional_statement(const std::vector< expression > &conditions, const std::vector< statement > &statements)stan::gm::conditional_statement
conditions_stan::gm::conditional_statement
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1conditional__statement.html b/doc/api/html/structstan_1_1gm_1_1conditional__statement.html new file mode 100644 index 00000000000..0eb5bdda973 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1conditional__statement.html @@ -0,0 +1,212 @@ + + + + + +Stan: stan::gm::conditional_statement Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::conditional_statement Struct Reference
+
+
+ +

#include <ast.hpp>

+ + + + + + +

+Public Member Functions

 conditional_statement ()
 
 conditional_statement (const std::vector< expression > &conditions, const std::vector< statement > &statements)
 
+ + + + + +

+Public Attributes

std::vector< expressionconditions_
 
std::vector< statementbodies_
 
+

Detailed Description

+
+

Definition at line 625 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::conditional_statement::conditional_statement ()
+
+ +

Definition at line 961 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
stan::gm::conditional_statement::conditional_statement (const std::vector< expression > & conditions,
const std::vector< statement > & statements 
)
+
+ +

Definition at line 964 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
std::vector<statement> stan::gm::conditional_statement::bodies_
+
+ +

Definition at line 627 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
std::vector<expression> stan::gm::conditional_statement::conditions_
+
+ +

Definition at line 626 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1constrained__param__names__visgen-members.html b/doc/api/html/structstan_1_1gm_1_1constrained__param__names__visgen-members.html new file mode 100644 index 00000000000..bb6f76756f7 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1constrained__param__names__visgen-members.html @@ -0,0 +1,130 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::constrained_param_names_visgen Member List
+
+
+ +

This is the complete list of members for stan::gm::constrained_param_names_visgen, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
constrained_param_names_visgen(std::ostream &o)stan::gm::constrained_param_names_visgeninline
generate_param_names_array(const std::vector< expression > &matrix_dims, const std::string &name, const std::vector< expression > &dims) const stan::gm::constrained_param_names_visgeninline
o_stan::gm::visgen
operator()(const nil &) const stan::gm::constrained_param_names_visgeninline
operator()(const int_var_decl &x) const stan::gm::constrained_param_names_visgeninline
operator()(const double_var_decl &x) const stan::gm::constrained_param_names_visgeninline
operator()(const vector_var_decl &x) const stan::gm::constrained_param_names_visgeninline
operator()(const row_vector_var_decl &x) const stan::gm::constrained_param_names_visgeninline
operator()(const matrix_var_decl &x) const stan::gm::constrained_param_names_visgeninline
operator()(const unit_vector_var_decl &x) const stan::gm::constrained_param_names_visgeninline
operator()(const simplex_var_decl &x) const stan::gm::constrained_param_names_visgeninline
operator()(const ordered_var_decl &x) const stan::gm::constrained_param_names_visgeninline
operator()(const positive_ordered_var_decl &x) const stan::gm::constrained_param_names_visgeninline
operator()(const cholesky_factor_var_decl &x) const stan::gm::constrained_param_names_visgeninline
operator()(const cov_matrix_var_decl &x) const stan::gm::constrained_param_names_visgeninline
operator()(const corr_matrix_var_decl &x) const stan::gm::constrained_param_names_visgeninline
result_type typedefstan::gm::visgen
visgen(std::ostream &o)stan::gm::visgeninline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1constrained__param__names__visgen.html b/doc/api/html/structstan_1_1gm_1_1constrained__param__names__visgen.html new file mode 100644 index 00000000000..25bfde0101d --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1constrained__param__names__visgen.html @@ -0,0 +1,583 @@ + + + + + +Stan: stan::gm::constrained_param_names_visgen Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::constrained_param_names_visgen Struct Reference
+
+
+ +

#include <generator.hpp>

+
+Inheritance diagram for stan::gm::constrained_param_names_visgen:
+
+
+ + +stan::gm::visgen + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 constrained_param_names_visgen (std::ostream &o)
 
void operator() (const nil &) const
 
void operator() (const int_var_decl &x) const
 
void operator() (const double_var_decl &x) const
 
void operator() (const vector_var_decl &x) const
 
void operator() (const row_vector_var_decl &x) const
 
void operator() (const matrix_var_decl &x) const
 
void operator() (const unit_vector_var_decl &x) const
 
void operator() (const simplex_var_decl &x) const
 
void operator() (const ordered_var_decl &x) const
 
void operator() (const positive_ordered_var_decl &x) const
 
void operator() (const cholesky_factor_var_decl &x) const
 
void operator() (const cov_matrix_var_decl &x) const
 
void operator() (const corr_matrix_var_decl &x) const
 
void generate_param_names_array (const std::vector< expression > &matrix_dims, const std::string &name, const std::vector< expression > &dims) const
 
- Public Member Functions inherited from stan::gm::visgen
 visgen (std::ostream &o)
 
+ + + + + + + +

+Additional Inherited Members

- Public Types inherited from stan::gm::visgen
typedef void result_type
 
- Public Attributes inherited from stan::gm::visgen
std::ostream & o_
 
+

Detailed Description

+
+

Definition at line 2949 of file generator.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::gm::constrained_param_names_visgen::constrained_param_names_visgen (std::ostream & o)
+
+inline
+
+ +

Definition at line 2950 of file generator.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::constrained_param_names_visgen::generate_param_names_array (const std::vector< expression > & matrix_dims,
const std::string & name,
const std::vector< expression > & dims 
) const
+
+inline
+
+ +

Definition at line 3015 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::constrained_param_names_visgen::operator() (const nil) const
+
+inline
+
+ +

Definition at line 2953 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::constrained_param_names_visgen::operator() (const int_var_declx) const
+
+inline
+
+ +

Definition at line 2954 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::constrained_param_names_visgen::operator() (const double_var_declx) const
+
+inline
+
+ +

Definition at line 2957 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::constrained_param_names_visgen::operator() (const vector_var_declx) const
+
+inline
+
+ +

Definition at line 2960 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::constrained_param_names_visgen::operator() (const row_vector_var_declx) const
+
+inline
+
+ +

Definition at line 2965 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::constrained_param_names_visgen::operator() (const matrix_var_declx) const
+
+inline
+
+ +

Definition at line 2970 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::constrained_param_names_visgen::operator() (const unit_vector_var_declx) const
+
+inline
+
+ +

Definition at line 2976 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::constrained_param_names_visgen::operator() (const simplex_var_declx) const
+
+inline
+
+ +

Definition at line 2981 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::constrained_param_names_visgen::operator() (const ordered_var_declx) const
+
+inline
+
+ +

Definition at line 2986 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::constrained_param_names_visgen::operator() (const positive_ordered_var_declx) const
+
+inline
+
+ +

Definition at line 2991 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::constrained_param_names_visgen::operator() (const cholesky_factor_var_declx) const
+
+inline
+
+ +

Definition at line 2996 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::constrained_param_names_visgen::operator() (const cov_matrix_var_declx) const
+
+inline
+
+ +

Definition at line 3002 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::constrained_param_names_visgen::operator() (const corr_matrix_var_declx) const
+
+inline
+
+ +

Definition at line 3008 of file generator.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1constrained__param__names__visgen.png b/doc/api/html/structstan_1_1gm_1_1constrained__param__names__visgen.png new file mode 100644 index 0000000000000000000000000000000000000000..bc815d9ff5e834ad0e8efcbb491981ef7549dc62 GIT binary patch literal 781 zcmeAS@N?(olHy`uVBq!ia0y~yU}OTa12~w0PCVUSn59zouEi^L1JO3)H!pUY+ zK}YSDZG!dp%Hm_!pXL&8P~pFP#c4(59)3r?o-mHrAM=?fJV~5YA^Yn~9aH1?96OcD z4fo2#Em-c}y%6fJ6#bjIH6X6#Yt8N6`5xELsMiSoJM5%za^tt$^h?$ro3{2V+$dl4 z`P|$kne$IJ&AF{o>Hm9;$EWaL5sDL@lzVWrIB>KqP>7h8YPpr+!RB2I2X?BmOh5fn zlH=gi12-i(8rL~13NRrM!-ZJ_9F6FRA;XuW<$<)ok|~#Vwz4p!PXjA(Y2z3>z+PUlQ+JP%FQF)%^L4n~(jenAZPt@86fQQFCUON*W)&x{CEv^0kX+ zZ$xgpD7IBOrfs*T`R(ZNNo!a8-|WndoZ7mzM>ebd>v!2{|E#WAUXyh8-YsXm(fz{v zh0$x>FHE|;MxEz+>L%sH-&H$q&$s(?p)f^K)~!b&W|{j0|D`FX^aW;Es5;+0n7df| z`qiDqGLf?$>&_E%I$6Da$y=shlVs*zHs+|33ydhg5#4cEa=W{vWRAd{_ya%m3OJgK zIfGA6{klWo-5pka#ShC&XS0Kijzt(UVm vh<}- + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::contains_nonparam_var Member List
+
+
+ +

This is the complete list of members for stan::gm::contains_nonparam_var, including all inherited members.

+ + + + + + + + + + + + +
contains_nonparam_var(const variable_map &var_map)stan::gm::contains_nonparam_var
operator()(const nil &e) const stan::gm::contains_nonparam_var
operator()(const int_literal &e) const stan::gm::contains_nonparam_var
operator()(const double_literal &e) const stan::gm::contains_nonparam_var
operator()(const array_literal &e) const stan::gm::contains_nonparam_var
operator()(const variable &e) const stan::gm::contains_nonparam_var
operator()(const fun &e) const stan::gm::contains_nonparam_var
operator()(const index_op &e) const stan::gm::contains_nonparam_var
operator()(const binary_op &e) const stan::gm::contains_nonparam_var
operator()(const unary_op &e) const stan::gm::contains_nonparam_var
var_map_stan::gm::contains_nonparam_var
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1contains__nonparam__var.html b/doc/api/html/structstan_1_1gm_1_1contains__nonparam__var.html new file mode 100644 index 00000000000..3b5c0750152 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1contains__nonparam__var.html @@ -0,0 +1,356 @@ + + + + + +Stan: stan::gm::contains_nonparam_var Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::contains_nonparam_var Struct Reference
+
+
+ +

#include <ast.hpp>

+
+Inheritance diagram for stan::gm::contains_nonparam_var:
+
+
+ + + +
+ + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 contains_nonparam_var (const variable_map &var_map)
 
bool operator() (const nil &e) const
 
bool operator() (const int_literal &e) const
 
bool operator() (const double_literal &e) const
 
bool operator() (const array_literal &e) const
 
bool operator() (const variable &e) const
 
bool operator() (const fun &e) const
 
bool operator() (const index_op &e) const
 
bool operator() (const binary_op &e) const
 
bool operator() (const unary_op &e) const
 
+ + + +

+Public Attributes

const variable_mapvar_map_
 
+

Detailed Description

+
+

Definition at line 721 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + + +
stan::gm::contains_nonparam_var::contains_nonparam_var (const variable_mapvar_map)
+
+ +

Definition at line 442 of file ast_def.cpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + + + + +
bool stan::gm::contains_nonparam_var::operator() (const nile) const
+
+ +

Definition at line 445 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
bool stan::gm::contains_nonparam_var::operator() (const int_literale) const
+
+ +

Definition at line 448 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
bool stan::gm::contains_nonparam_var::operator() (const double_literale) const
+
+ +

Definition at line 451 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
bool stan::gm::contains_nonparam_var::operator() (const array_literale) const
+
+ +

Definition at line 454 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
bool stan::gm::contains_nonparam_var::operator() (const variablee) const
+
+ +

Definition at line 460 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
bool stan::gm::contains_nonparam_var::operator() (const fune) const
+
+ +

Definition at line 465 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
bool stan::gm::contains_nonparam_var::operator() (const index_ope) const
+
+ +

Definition at line 471 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
bool stan::gm::contains_nonparam_var::operator() (const binary_ope) const
+
+ +

Definition at line 474 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
bool stan::gm::contains_nonparam_var::operator() (const unary_ope) const
+
+ +

Definition at line 477 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
const variable_map& stan::gm::contains_nonparam_var::var_map_
+
+ +

Definition at line 722 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1contains__nonparam__var.png b/doc/api/html/structstan_1_1gm_1_1contains__nonparam__var.png new file mode 100644 index 0000000000000000000000000000000000000000..c7c5ba5109d460223ea561ac2d2db6eba77eef21 GIT binary patch literal 737 zcmeAS@N?(olHy`uVBq!ia0vp^$ALJ2gBeK9+A)zINJ#|vgt-3y{~ySF@#br3|Dg#$ z78oBmaDcV*jy#adQ4-`A%m7pb0#{Fk7%?y~6?nQhhEy=VoqN0QumX=uf4tTI|Hp5e zu<-CM*?l*}WYdu+ZMhZ?W`v(Pqo?3AXK#6dUn={bRP^nhAHG{=(#~%y|4RImw_bVWr~S5_USa0><*)uS6p>*7dYs`|U;)FK#Sa)}xF2LR=x<_9kYi;( zV8g}NP>H6XA}}pYT!8JvSD4(2hZXXxTzSx!lk+5&=t%f~M`?1TNx_9 z{rZ()*`lutDqC&bPjaQ-u=uTMd4ATZX!FxM)8qP|vEPeso454*>fGb^o}3W86>9w? z!uI+JJFmIZmzK9D+eiO9^zqA=kYiOcY$mS?DtiC-w zho~EsoD=EUw)N|&tIZ;b6T*9^uMWSxrFM#X->FaG&ws9DKYaUO{NojqcpmUa)t%YW z$gs7qng4G5y?#fQhV5S${$-dE4GSh+_6aj@UVqKbol+`m+c%*Xm>wBCUHx3vIVCg! E0AL+s=l}o! literal 0 HcmV?d00001 diff --git a/doc/api/html/structstan_1_1gm_1_1contains__var-members.html b/doc/api/html/structstan_1_1gm_1_1contains__var-members.html new file mode 100644 index 00000000000..fa227db8e17 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1contains__var-members.html @@ -0,0 +1,123 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::contains_var Member List
+
+
+ +

This is the complete list of members for stan::gm::contains_var, including all inherited members.

+ + + + + + + + + + + + +
contains_var(const variable_map &var_map)stan::gm::contains_var
operator()(const nil &e) const stan::gm::contains_var
operator()(const int_literal &e) const stan::gm::contains_var
operator()(const double_literal &e) const stan::gm::contains_var
operator()(const array_literal &e) const stan::gm::contains_var
operator()(const variable &e) const stan::gm::contains_var
operator()(const fun &e) const stan::gm::contains_var
operator()(const index_op &e) const stan::gm::contains_var
operator()(const binary_op &e) const stan::gm::contains_var
operator()(const unary_op &e) const stan::gm::contains_var
var_map_stan::gm::contains_var
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1contains__var.html b/doc/api/html/structstan_1_1gm_1_1contains__var.html new file mode 100644 index 00000000000..a28dde95dab --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1contains__var.html @@ -0,0 +1,356 @@ + + + + + +Stan: stan::gm::contains_var Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::contains_var Struct Reference
+
+
+ +

#include <ast.hpp>

+
+Inheritance diagram for stan::gm::contains_var:
+
+
+ + + +
+ + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 contains_var (const variable_map &var_map)
 
bool operator() (const nil &e) const
 
bool operator() (const int_literal &e) const
 
bool operator() (const double_literal &e) const
 
bool operator() (const array_literal &e) const
 
bool operator() (const variable &e) const
 
bool operator() (const fun &e) const
 
bool operator() (const index_op &e) const
 
bool operator() (const binary_op &e) const
 
bool operator() (const unary_op &e) const
 
+ + + +

+Public Attributes

const variable_mapvar_map_
 
+

Detailed Description

+
+

Definition at line 703 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + + +
stan::gm::contains_var::contains_var (const variable_mapvar_map)
+
+ +

Definition at line 394 of file ast_def.cpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + + + + +
bool stan::gm::contains_var::operator() (const nile) const
+
+ +

Definition at line 397 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
bool stan::gm::contains_var::operator() (const int_literale) const
+
+ +

Definition at line 400 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
bool stan::gm::contains_var::operator() (const double_literale) const
+
+ +

Definition at line 403 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
bool stan::gm::contains_var::operator() (const array_literale) const
+
+ +

Definition at line 406 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
bool stan::gm::contains_var::operator() (const variablee) const
+
+ +

Definition at line 412 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
bool stan::gm::contains_var::operator() (const fune) const
+
+ +

Definition at line 418 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
bool stan::gm::contains_var::operator() (const index_ope) const
+
+ +

Definition at line 424 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
bool stan::gm::contains_var::operator() (const binary_ope) const
+
+ +

Definition at line 427 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
bool stan::gm::contains_var::operator() (const unary_ope) const
+
+ +

Definition at line 431 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
const variable_map& stan::gm::contains_var::var_map_
+
+ +

Definition at line 704 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1contains__var.png b/doc/api/html/structstan_1_1gm_1_1contains__var.png new file mode 100644 index 0000000000000000000000000000000000000000..689b460b0f9efe171e2ce0865962fd883e00576a GIT binary patch literal 675 zcmeAS@N?(olHy`uVBq!ia0vp^%YZn5gBeIJnfuQXNJ#|vgt-3y{~ySF@#br3|Dg#$ z78oBmaDcV*jy#adQ4-`A%m7pb0#{Fk7%?y~8F{)mhEy=VoqKW9Y6TwG@VH(7|M#yC z<7#ADe*9V48=15lT~d=$oxX?~Z+^`^dCBVRM6aMJV#`!qHIw}^X1hNvn%z6?>2KlL zfmhC*EjLtsseUx+R_(Uh#jAqng-!pt!M=#iy=Th7-*4~c7Z&M!xHfl1@R`Hg`;~51 zoCtB7oH%)&yW;ufg;#E^()^Xsct8E=CZ`vv#?jSh%>Gzp{j~}{<9>Hl>dJG>XF|gF z?>P3w`ic6PN&hULecn`earcZ#I|ZkleR=QAmC6m~@*0z_9=^SIv$^}+ee$dBo%Ox< z`b$$}*E{RjNz(h@m3Z!2cgW!TvaCy5o{qn=Z%$eAe|f8>XJFKfNg_*mFQ0kyiK*in z?}J~z_|DvZt8KBLxp?s(wsZOiW9IS+EN|r$SV}Cm@5xLnt4(AGzkZ0N;}QtVeEu7* zA$RZ7S4*FU%Th^s^H=?yJd1DlTw|Mk$uA%5Kk&3fXN66Q`qb6!mloTd=lIOvA@MyR zp-!giL)GbXO#3zNuQuS;Juq2q#?q8?zK?IY>m1|VvOSM0z;ay@L!M9fzZJ)3&$#Jq zp4$1q;FoFI{we7O^V3YvIzC{%@Z#y-n+avxBGr2@M}DnRHw?ZQJpY;bxzr;W?zdmA zyE>`8ZvK)#Y4aJ@`u%UU`~BIf)p8}@0q + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::corr_matrix_var_decl Member List
+
+
+ +

This is the complete list of members for stan::gm::corr_matrix_var_decl, including all inherited members.

+ + + + + + + + + + +
base_type_stan::gm::base_var_decl
base_var_decl()stan::gm::base_var_decl
base_var_decl(const base_expr_type &base_type)stan::gm::base_var_decl
base_var_decl(const std::string &name, const std::vector< expression > &dims, const base_expr_type &base_type)stan::gm::base_var_decl
corr_matrix_var_decl()stan::gm::corr_matrix_var_decl
corr_matrix_var_decl(expression const &K, std::string const &name, std::vector< expression > const &dims)stan::gm::corr_matrix_var_decl
dims_stan::gm::base_var_decl
K_stan::gm::corr_matrix_var_decl
name_stan::gm::base_var_decl
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1corr__matrix__var__decl.html b/doc/api/html/structstan_1_1gm_1_1corr__matrix__var__decl.html new file mode 100644 index 00000000000..267dbb5dd90 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1corr__matrix__var__decl.html @@ -0,0 +1,225 @@ + + + + + +Stan: stan::gm::corr_matrix_var_decl Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::corr_matrix_var_decl Struct Reference
+
+
+ +

#include <ast.hpp>

+
+Inheritance diagram for stan::gm::corr_matrix_var_decl:
+
+
+ + +stan::gm::base_var_decl + +
+ + + + + + + + + + + + + +

+Public Member Functions

 corr_matrix_var_decl ()
 
 corr_matrix_var_decl (expression const &K, std::string const &name, std::vector< expression > const &dims)
 
- Public Member Functions inherited from stan::gm::base_var_decl
 base_var_decl ()
 
 base_var_decl (const base_expr_type &base_type)
 
 base_var_decl (const std::string &name, const std::vector< expression > &dims, const base_expr_type &base_type)
 
+ + + + + + + + + + +

+Public Attributes

expression K_
 
- Public Attributes inherited from stan::gm::base_var_decl
std::string name_
 
std::vector< expressiondims_
 
base_expr_type base_type_
 
+

Detailed Description

+
+

Definition at line 506 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::corr_matrix_var_decl::corr_matrix_var_decl ()
+
+ +

Definition at line 841 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
stan::gm::corr_matrix_var_decl::corr_matrix_var_decl (expression const & K,
std::string const & name,
std::vector< expression > const & dims 
)
+
+ +

Definition at line 842 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
expression stan::gm::corr_matrix_var_decl::K_
+
+ +

Definition at line 507 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1corr__matrix__var__decl.png b/doc/api/html/structstan_1_1gm_1_1corr__matrix__var__decl.png new file mode 100644 index 0000000000000000000000000000000000000000..d6a2e3d82e0b44efb7aaf22f826418ffdabe9fc7 GIT binary patch literal 745 zcmeAS@N?(olHy`uVBq!ia0vp^JAgQVgBeK9{pBwOq$C1-LR|m<{|{uoc=NTi|Ih>= z3ycpOIKbL@M;^%KC<*clW&kPzfvcxNj2IZ0Dm+~rLn;{G&b>WpwSs`F`0Z7H{;SV- z5y%Kg);r9zeAltwaaN3+dhhDFkBYzZmQA|yn#D#*b%SU;*H_W4 zXAjKMSP_$!_3U_--_g5m6PC!%ZJs_y*YSATwaw>tao^j2L%nW)$hN!Hyf#)#7+x+6 z30~F0{9)3Y=EFDN{c-(}bn|_g)|1Pk+jlE@?u}ddk?qcvn$kJ`**1Uo^Z#2ab-&DN z-iJLw(N})?Ok2IBh2>Jo)IFj%|NoA4o#gj5^ZK+U+rR4l_*vvJ>1x%pH<#>dl|9?5 zs*m13q3RibS$(OJ=YBQz=}RUS6?jUmwEnS4=X49x55v0*X;;=f*nWG-lg&-{cRp8{ zFLq})*MSI2ivu3SV~5oOPBQ{o8h$=`z@YpTh_5#Mf1o()?DV_&%jp@d;Z}2 zxgRfHzWkvg@aK_jGuwU%2i)J}DY{GIh~nR?E{3ytlP}$}(XH^A6tuQd;Y#=wv*uey z>i60vnI6tJf1Go`cgCSBPj51=Uq1P<$;Q`HrlxOO_x%#r?_ zS|GiV_59XkuZ4cmf4=iS&tt4%+_ScIS%^?G=jF9Ke9NOA^ZxKF{pKKkuw1AA!2IhK zmeKvSC%XgqLK~jF+I7lv|8{_nmN%Ha3)_`VI-56sqOvA9+>?aWK&7o|Dn zs)vq>?q^~$@VoBK`hfrBK}NSzK>X@sEQeyt&oBJisp{+}%-)0m( + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::cov_matrix_var_decl Member List
+
+
+ +

This is the complete list of members for stan::gm::cov_matrix_var_decl, including all inherited members.

+ + + + + + + + + + +
base_type_stan::gm::base_var_decl
base_var_decl()stan::gm::base_var_decl
base_var_decl(const base_expr_type &base_type)stan::gm::base_var_decl
base_var_decl(const std::string &name, const std::vector< expression > &dims, const base_expr_type &base_type)stan::gm::base_var_decl
cov_matrix_var_decl()stan::gm::cov_matrix_var_decl
cov_matrix_var_decl(expression const &K, std::string const &name, std::vector< expression > const &dims)stan::gm::cov_matrix_var_decl
dims_stan::gm::base_var_decl
K_stan::gm::cov_matrix_var_decl
name_stan::gm::base_var_decl
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1cov__matrix__var__decl.html b/doc/api/html/structstan_1_1gm_1_1cov__matrix__var__decl.html new file mode 100644 index 00000000000..9437f454690 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1cov__matrix__var__decl.html @@ -0,0 +1,225 @@ + + + + + +Stan: stan::gm::cov_matrix_var_decl Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::cov_matrix_var_decl Struct Reference
+
+
+ +

#include <ast.hpp>

+
+Inheritance diagram for stan::gm::cov_matrix_var_decl:
+
+
+ + +stan::gm::base_var_decl + +
+ + + + + + + + + + + + + +

+Public Member Functions

 cov_matrix_var_decl ()
 
 cov_matrix_var_decl (expression const &K, std::string const &name, std::vector< expression > const &dims)
 
- Public Member Functions inherited from stan::gm::base_var_decl
 base_var_decl ()
 
 base_var_decl (const base_expr_type &base_type)
 
 base_var_decl (const std::string &name, const std::vector< expression > &dims, const base_expr_type &base_type)
 
+ + + + + + + + + + +

+Public Attributes

expression K_
 
- Public Attributes inherited from stan::gm::base_var_decl
std::string name_
 
std::vector< expressiondims_
 
base_expr_type base_type_
 
+

Detailed Description

+
+

Definition at line 497 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::cov_matrix_var_decl::cov_matrix_var_decl ()
+
+ +

Definition at line 832 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
stan::gm::cov_matrix_var_decl::cov_matrix_var_decl (expression const & K,
std::string const & name,
std::vector< expression > const & dims 
)
+
+ +

Definition at line 834 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
expression stan::gm::cov_matrix_var_decl::K_
+
+ +

Definition at line 498 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1cov__matrix__var__decl.png b/doc/api/html/structstan_1_1gm_1_1cov__matrix__var__decl.png new file mode 100644 index 0000000000000000000000000000000000000000..fc841dca24e602dc80abf4aca0acb7d2275a3854 GIT binary patch literal 747 zcmeAS@N?(olHy`uVBq!ia0vp^TY)%$gBeI>upC(hq$C1-LR|m<{|{uoc=NTi|Ih>= z3ycpOIKbL@M;^%KC<*clW&kPzfvcxNj2IZ0sytmBLn;{G&V4&+v4Vgr|MgXS{ww<{ zX_%}CocvOD+lr@;Bz`^Sxcer4S>~)=!jn}>mpSTs+DToR^ki}Q6~{^EUQODl5}Nhr zJJY}ND-T}^UwbK;Soh@Ub+0)^lQM*4-*_LJG4-0)^B#x4bn>qZWtElJ?xd7mzQ4}nQs29G zU!S^6`eIrepg8GEzsU;KlkUw?lWM*!nYS$Sl`q5oCF~C6uO|Ka_(E{E_bc_1_8YZ9 z{nji8yql#CxD$^Jlv@OL2{SG*=FMV|2jS2w`@eB|Kgi~kdi|x@-1I=@-sN?1P3w1C z`>t<2q<(Kgrq=pjerR{~4CXGKIFPtlwt%&FrUdZ1@#v*U0Ewx_1_@^S%Ck+OOK!idt0K7^Mlm2r5_!UWhz*)|4aP~%U7>HFqD~?_h*_ng#9i{SDJI@ uwXp(&pH;jfL%l03l-B>YZxOJ%%s;bQEj8-8(?4L!WbkzLb6Mw<&;$UigI`Dh literal 0 HcmV?d00001 diff --git a/doc/api/html/structstan_1_1gm_1_1distribution-members.html b/doc/api/html/structstan_1_1gm_1_1distribution-members.html new file mode 100644 index 00000000000..ca6525ae5b3 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1distribution-members.html @@ -0,0 +1,114 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::distribution Member List
+
+
+ +

This is the complete list of members for stan::gm::distribution, including all inherited members.

+ + + +
args_stan::gm::distribution
family_stan::gm::distribution
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1distribution.html b/doc/api/html/structstan_1_1gm_1_1distribution.html new file mode 100644 index 00000000000..ba08c347589 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1distribution.html @@ -0,0 +1,157 @@ + + + + + +Stan: stan::gm::distribution Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::distribution Struct Reference
+
+
+ +

#include <ast.hpp>

+ + + + + + +

+Public Attributes

std::string family_
 
std::vector< expressionargs_
 
+

Detailed Description

+
+

Definition at line 171 of file ast.hpp.

+

Member Data Documentation

+ +
+
+ + + + +
std::vector<expression> stan::gm::distribution::args_
+
+ +

Definition at line 173 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
std::string stan::gm::distribution::family_
+
+ +

Definition at line 172 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1division__expr-members.html b/doc/api/html/structstan_1_1gm_1_1division__expr-members.html new file mode 100644 index 00000000000..7264db14012 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1division__expr-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::division_expr Member List
+
+
+ +

This is the complete list of members for stan::gm::division_expr, including all inherited members.

+ + +
operator()(expression &expr1, const expression &expr2, std::ostream &error_msgs) const stan::gm::division_exprinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1division__expr.html b/doc/api/html/structstan_1_1gm_1_1division__expr.html new file mode 100644 index 00000000000..18a18ae529b --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1division__expr.html @@ -0,0 +1,175 @@ + + + + + +Stan: stan::gm::division_expr Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::division_expr Struct Reference
+
+
+ +

#include <term_grammar_def.hpp>

+ + + + +

+Classes

struct  result
 
+ + + +

+Public Member Functions

expression operator() (expression &expr1, const expression &expr2, std::ostream &error_msgs) const
 
+

Detailed Description

+
+

Definition at line 158 of file term_grammar_def.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
expression stan::gm::division_expr::operator() (expressionexpr1,
const expressionexpr2,
std::ostream & error_msgs 
) const
+
+inline
+
+ +

Definition at line 162 of file term_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1division__expr_1_1result-members.html b/doc/api/html/structstan_1_1gm_1_1division__expr_1_1result-members.html new file mode 100644 index 00000000000..9adc048fab6 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1division__expr_1_1result-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::division_expr::result< T1, T2, T3 > Member List
+
+
+ +

This is the complete list of members for stan::gm::division_expr::result< T1, T2, T3 >, including all inherited members.

+ + +
type typedefstan::gm::division_expr::result< T1, T2, T3 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1division__expr_1_1result.html b/doc/api/html/structstan_1_1gm_1_1division__expr_1_1result.html new file mode 100644 index 00000000000..b4794c0b002 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1division__expr_1_1result.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::gm::division_expr::result< T1, T2, T3 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::division_expr::result< T1, T2, T3 > Struct Template Reference
+
+
+ +

#include <term_grammar_def.hpp>

+ + + + +

+Public Types

typedef expression type
 
+

Detailed Description

+

template<typename T1, typename T2, typename T3>
+struct stan::gm::division_expr::result< T1, T2, T3 >

+ + +

Definition at line 160 of file term_grammar_def.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 , typename T3 >
+ + + + +
typedef expression stan::gm::division_expr::result< T1, T2, T3 >::type
+
+ +

Definition at line 160 of file term_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1double__literal-members.html b/doc/api/html/structstan_1_1gm_1_1double__literal-members.html new file mode 100644 index 00000000000..4b9fef180d8 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1double__literal-members.html @@ -0,0 +1,117 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::double_literal Member List
+
+
+ +

This is the complete list of members for stan::gm::double_literal, including all inherited members.

+ + + + + + +
double_literal()stan::gm::double_literal
double_literal(double val)stan::gm::double_literal
operator=(const double_literal &dl)stan::gm::double_literal
type_stan::gm::double_literal
val_stan::gm::double_literal
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1double__literal.html b/doc/api/html/structstan_1_1gm_1_1double__literal.html new file mode 100644 index 00000000000..c0bdb8714de --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1double__literal.html @@ -0,0 +1,223 @@ + + + + + +Stan: stan::gm::double_literal Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::double_literal Struct Reference
+
+
+ +

#include <ast.hpp>

+ + + + + + + + +

+Public Member Functions

 double_literal ()
 
 double_literal (double val)
 
double_literaloperator= (const double_literal &dl)
 
+ + + + + +

+Public Attributes

double val_
 
expr_type type_
 
+

Detailed Description

+
+

Definition at line 282 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::double_literal::double_literal ()
+
+ +

Definition at line 531 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::double_literal::double_literal (double val)
+
+ +

Definition at line 534 of file ast_def.cpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + + + + +
double_literal & stan::gm::double_literal::operator= (const double_literaldl)
+
+ +

Definition at line 538 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
expr_type stan::gm::double_literal::type_
+
+ +

Definition at line 284 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
double stan::gm::double_literal::val_
+
+ +

Definition at line 283 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1double__var__decl-members.html b/doc/api/html/structstan_1_1gm_1_1double__var__decl-members.html new file mode 100644 index 00000000000..da3dc61db52 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1double__var__decl-members.html @@ -0,0 +1,121 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::double_var_decl Member List
+
+
+ +

This is the complete list of members for stan::gm::double_var_decl, including all inherited members.

+ + + + + + + + + + +
base_type_stan::gm::base_var_decl
base_var_decl()stan::gm::base_var_decl
base_var_decl(const base_expr_type &base_type)stan::gm::base_var_decl
base_var_decl(const std::string &name, const std::vector< expression > &dims, const base_expr_type &base_type)stan::gm::base_var_decl
dims_stan::gm::base_var_decl
double_var_decl()stan::gm::double_var_decl
double_var_decl(range const &range, std::string const &name, std::vector< expression > const &dims)stan::gm::double_var_decl
name_stan::gm::base_var_decl
range_stan::gm::double_var_decl
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1double__var__decl.html b/doc/api/html/structstan_1_1gm_1_1double__var__decl.html new file mode 100644 index 00000000000..41472108967 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1double__var__decl.html @@ -0,0 +1,225 @@ + + + + + +Stan: stan::gm::double_var_decl Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::double_var_decl Struct Reference
+
+
+ +

#include <ast.hpp>

+
+Inheritance diagram for stan::gm::double_var_decl:
+
+
+ + +stan::gm::base_var_decl + +
+ + + + + + + + + + + + + +

+Public Member Functions

 double_var_decl ()
 
 double_var_decl (range const &range, std::string const &name, std::vector< expression > const &dims)
 
- Public Member Functions inherited from stan::gm::base_var_decl
 base_var_decl ()
 
 base_var_decl (const base_expr_type &base_type)
 
 base_var_decl (const std::string &name, const std::vector< expression > &dims, const base_expr_type &base_type)
 
+ + + + + + + + + + +

+Public Attributes

range range_
 
- Public Attributes inherited from stan::gm::base_var_decl
std::string name_
 
std::vector< expressiondims_
 
base_expr_type base_type_
 
+

Detailed Description

+
+

Definition at line 415 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::double_var_decl::double_var_decl ()
+
+ +

Definition at line 731 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
stan::gm::double_var_decl::double_var_decl (range const & range,
std::string const & name,
std::vector< expression > const & dims 
)
+
+ +

Definition at line 735 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
range stan::gm::double_var_decl::range_
+
+ +

Definition at line 416 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1double__var__decl.png b/doc/api/html/structstan_1_1gm_1_1double__var__decl.png new file mode 100644 index 0000000000000000000000000000000000000000..1bf784ce2b540cbca24cdb8e57da0390c07a8563 GIT binary patch literal 693 zcmeAS@N?(olHy`uVBq!ia0vp^^ME*jgBeKP-)Ykeq$C1-LR|m<{|{uoc=NTi|Ih>= z3ycpOIKbL@M;^%KC<*clW&kPzfvcxNj2IZ0Ts&PILn;{G&V9LQv4TLWeP3whe|I@$ zjn&+>#^oNop>m5I%;)c&uwUo&rXFoEPpMF0|4D0RRZL0=+ln^XodzPsBf}n|&xI>rFi0?b?@|^X^;Z?059i+qC^!9$Q;yr6_cF)V)=>CI>&BcswW>qi%)iJDAlWPbS z=0C8ilRe?;5#|k9j~F9NKQaIV2O<4ma$fPdUTv8JD`28rd-ATGQs61EvMT?qTJc)) zvmNu{x3&{+{9x9&({=H1Lhy#}$0zGfCP+;?-o1YB~R>^bdO$FXB9$z^wo7c3!W|PWjHb zQnw|m?uM)_jjLvjiwl0ci1X`BpS+5^$9J#CdE~vg^EkM?d6Dv^i#LkG=T?V&f4FLO zF{9pB|9`Rb9!{-fs#vl1(Px8u=Su!Rzqga|hji7vn1=Z4P~U#FbDdk97xI_Up<8i= U*95b8U>alaboFyt=akR{05SDVrvLx| literal 0 HcmV?d00001 diff --git a/doc/api/html/structstan_1_1gm_1_1dump__member__var__visgen-members.html b/doc/api/html/structstan_1_1gm_1_1dump__member__var__visgen-members.html new file mode 100644 index 00000000000..4b625a28b44 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1dump__member__var__visgen-members.html @@ -0,0 +1,131 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::dump_member_var_visgen Member List
+
+
+ +

This is the complete list of members for stan::gm::dump_member_var_visgen, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + +
dump_member_var_visgen(std::ostream &o)stan::gm::dump_member_var_visgeninline
o_stan::gm::visgen
operator()(nil const &) const stan::gm::dump_member_var_visgeninline
operator()(int_var_decl const &x) const stan::gm::dump_member_var_visgeninline
operator()(double_var_decl const &x) const stan::gm::dump_member_var_visgeninline
operator()(vector_var_decl const &x) const stan::gm::dump_member_var_visgeninline
operator()(row_vector_var_decl const &x) const stan::gm::dump_member_var_visgeninline
operator()(unit_vector_var_decl const &x) const stan::gm::dump_member_var_visgeninline
operator()(simplex_var_decl const &x) const stan::gm::dump_member_var_visgeninline
operator()(ordered_var_decl const &x) const stan::gm::dump_member_var_visgeninline
operator()(positive_ordered_var_decl const &x) const stan::gm::dump_member_var_visgeninline
operator()(matrix_var_decl const &x) const stan::gm::dump_member_var_visgeninline
operator()(corr_matrix_var_decl const &x) const stan::gm::dump_member_var_visgeninline
operator()(cholesky_factor_var_decl const &x) const stan::gm::dump_member_var_visgeninline
operator()(cov_matrix_var_decl const &x) const stan::gm::dump_member_var_visgeninline
result_type typedefstan::gm::visgen
var_resizer_stan::gm::dump_member_var_visgen
var_size_validator_stan::gm::dump_member_var_visgen
visgen(std::ostream &o)stan::gm::visgeninline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1dump__member__var__visgen.html b/doc/api/html/structstan_1_1gm_1_1dump__member__var__visgen.html new file mode 100644 index 00000000000..cb51296f79a --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1dump__member__var__visgen.html @@ -0,0 +1,576 @@ + + + + + +Stan: stan::gm::dump_member_var_visgen Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::dump_member_var_visgen Struct Reference
+
+
+ +

#include <generator.hpp>

+
+Inheritance diagram for stan::gm::dump_member_var_visgen:
+
+
+ + +stan::gm::visgen + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 dump_member_var_visgen (std::ostream &o)
 
void operator() (nil const &) const
 
void operator() (int_var_decl const &x) const
 
void operator() (double_var_decl const &x) const
 
void operator() (vector_var_decl const &x) const
 
void operator() (row_vector_var_decl const &x) const
 
void operator() (unit_vector_var_decl const &x) const
 
void operator() (simplex_var_decl const &x) const
 
void operator() (ordered_var_decl const &x) const
 
void operator() (positive_ordered_var_decl const &x) const
 
void operator() (matrix_var_decl const &x) const
 
void operator() (corr_matrix_var_decl const &x) const
 
void operator() (cholesky_factor_var_decl const &x) const
 
void operator() (cov_matrix_var_decl const &x) const
 
- Public Member Functions inherited from stan::gm::visgen
 visgen (std::ostream &o)
 
+ + + + + + + + +

+Public Attributes

var_resizing_visgen var_resizer_
 
var_size_validating_visgen var_size_validator_
 
- Public Attributes inherited from stan::gm::visgen
std::ostream & o_
 
+ + + + +

+Additional Inherited Members

- Public Types inherited from stan::gm::visgen
typedef void result_type
 
+

Detailed Description

+
+

Definition at line 1666 of file generator.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::gm::dump_member_var_visgen::dump_member_var_visgen (std::ostream & o)
+
+inline
+
+ +

Definition at line 1669 of file generator.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::dump_member_var_visgen::operator() (nil const & ) const
+
+inline
+
+ +

Definition at line 1674 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::dump_member_var_visgen::operator() (int_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1675 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::dump_member_var_visgen::operator() (double_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1705 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::dump_member_var_visgen::operator() (vector_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1733 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::dump_member_var_visgen::operator() (row_vector_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1767 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::dump_member_var_visgen::operator() (unit_vector_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1801 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::dump_member_var_visgen::operator() (simplex_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1835 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::dump_member_var_visgen::operator() (ordered_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1869 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::dump_member_var_visgen::operator() (positive_ordered_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1903 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::dump_member_var_visgen::operator() (matrix_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1937 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::dump_member_var_visgen::operator() (corr_matrix_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1975 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::dump_member_var_visgen::operator() (cholesky_factor_var_decl const & x) const
+
+inline
+
+ +

Definition at line 2011 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::dump_member_var_visgen::operator() (cov_matrix_var_decl const & x) const
+
+inline
+
+ +

Definition at line 2056 of file generator.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
var_resizing_visgen stan::gm::dump_member_var_visgen::var_resizer_
+
+ +

Definition at line 1667 of file generator.hpp.

+ +
+
+ +
+
+ + + + +
var_size_validating_visgen stan::gm::dump_member_var_visgen::var_size_validator_
+
+ +

Definition at line 1668 of file generator.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1dump__member__var__visgen.png b/doc/api/html/structstan_1_1gm_1_1dump__member__var__visgen.png new file mode 100644 index 0000000000000000000000000000000000000000..936a97d4308df60640b6e2418d974f81375fcd2c GIT binary patch literal 744 zcmeAS@N?(olHy`uVBq!ia0vp^*MK;HgBeH$U8%kaq$C1-LR|m<{|{uoc=NTi|Ih>= z3ycpOIKbL@M;^%KC<*clW&kPzfvcxNj2IZ0$~|2iLn;{G&VAeWT7iePU3lgD|0lM` z2JL%!$>e3MvI^hsqYgGVX6(!}iOy|(s`AoTHd5J>`Pcl2 zNhK5g4iuHEi0`s~aDIM9O+?M~c?aztJpUDWmRIFvZEfGvztvScgO{CseRBFao%B>` zk4uSjn?xrYScM-`{c0+$yC^(I!IQltNXV`@gXgq*s?Q;TWmU|cRtti?+-64QCrs6T zEahpnhWlMuq-yiOl$bR$W zd`JJ1C9$%)^TQ{7@k-vTk{J;1;pF*io7gm!$cu+2sc7#?&b__OSG^(sC7Z$gXGeD3 zUG`*_@M}L)U%^nCZUV{*D{;)+<3ggTe~DWM4fU&B%A literal 0 HcmV?d00001 diff --git a/doc/api/html/structstan_1_1gm_1_1elt__division__expr-members.html b/doc/api/html/structstan_1_1gm_1_1elt__division__expr-members.html new file mode 100644 index 00000000000..2c295a0f36e --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1elt__division__expr-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::elt_division_expr Member List
+
+
+ +

This is the complete list of members for stan::gm::elt_division_expr, including all inherited members.

+ + +
operator()(expression &expr1, const expression &expr2, std::ostream &error_msgs) const stan::gm::elt_division_exprinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1elt__division__expr.html b/doc/api/html/structstan_1_1gm_1_1elt__division__expr.html new file mode 100644 index 00000000000..542637c60b8 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1elt__division__expr.html @@ -0,0 +1,175 @@ + + + + + +Stan: stan::gm::elt_division_expr Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::elt_division_expr Struct Reference
+
+
+ +

#include <term_grammar_def.hpp>

+ + + + +

+Classes

struct  result
 
+ + + +

+Public Member Functions

expression operator() (expression &expr1, const expression &expr2, std::ostream &error_msgs) const
 
+

Detailed Description

+
+

Definition at line 256 of file term_grammar_def.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
expression stan::gm::elt_division_expr::operator() (expressionexpr1,
const expressionexpr2,
std::ostream & error_msgs 
) const
+
+inline
+
+ +

Definition at line 260 of file term_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1elt__division__expr_1_1result-members.html b/doc/api/html/structstan_1_1gm_1_1elt__division__expr_1_1result-members.html new file mode 100644 index 00000000000..14733524d86 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1elt__division__expr_1_1result-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::elt_division_expr::result< T1, T2, T3 > Member List
+
+
+ +

This is the complete list of members for stan::gm::elt_division_expr::result< T1, T2, T3 >, including all inherited members.

+ + +
type typedefstan::gm::elt_division_expr::result< T1, T2, T3 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1elt__division__expr_1_1result.html b/doc/api/html/structstan_1_1gm_1_1elt__division__expr_1_1result.html new file mode 100644 index 00000000000..6b5d2169a64 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1elt__division__expr_1_1result.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::gm::elt_division_expr::result< T1, T2, T3 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::elt_division_expr::result< T1, T2, T3 > Struct Template Reference
+
+
+ +

#include <term_grammar_def.hpp>

+ + + + +

+Public Types

typedef expression type
 
+

Detailed Description

+

template<typename T1, typename T2, typename T3>
+struct stan::gm::elt_division_expr::result< T1, T2, T3 >

+ + +

Definition at line 258 of file term_grammar_def.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 , typename T3 >
+ + + + +
typedef expression stan::gm::elt_division_expr::result< T1, T2, T3 >::type
+
+ +

Definition at line 258 of file term_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1elt__multiplication__expr-members.html b/doc/api/html/structstan_1_1gm_1_1elt__multiplication__expr-members.html new file mode 100644 index 00000000000..56ee88302a8 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1elt__multiplication__expr-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::elt_multiplication_expr Member List
+
+
+ +

This is the complete list of members for stan::gm::elt_multiplication_expr, including all inherited members.

+ + +
operator()(expression &expr1, const expression &expr2, std::ostream &error_msgs) const stan::gm::elt_multiplication_exprinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1elt__multiplication__expr.html b/doc/api/html/structstan_1_1gm_1_1elt__multiplication__expr.html new file mode 100644 index 00000000000..73458a38a00 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1elt__multiplication__expr.html @@ -0,0 +1,175 @@ + + + + + +Stan: stan::gm::elt_multiplication_expr Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::elt_multiplication_expr Struct Reference
+
+
+ +

#include <term_grammar_def.hpp>

+ + + + +

+Classes

struct  result
 
+ + + +

+Public Member Functions

expression operator() (expression &expr1, const expression &expr2, std::ostream &error_msgs) const
 
+

Detailed Description

+
+

Definition at line 232 of file term_grammar_def.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
expression stan::gm::elt_multiplication_expr::operator() (expressionexpr1,
const expressionexpr2,
std::ostream & error_msgs 
) const
+
+inline
+
+ +

Definition at line 236 of file term_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1elt__multiplication__expr_1_1result-members.html b/doc/api/html/structstan_1_1gm_1_1elt__multiplication__expr_1_1result-members.html new file mode 100644 index 00000000000..89e9442d81d --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1elt__multiplication__expr_1_1result-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::elt_multiplication_expr::result< T1, T2, T3 > Member List
+
+
+ +

This is the complete list of members for stan::gm::elt_multiplication_expr::result< T1, T2, T3 >, including all inherited members.

+ + +
type typedefstan::gm::elt_multiplication_expr::result< T1, T2, T3 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1elt__multiplication__expr_1_1result.html b/doc/api/html/structstan_1_1gm_1_1elt__multiplication__expr_1_1result.html new file mode 100644 index 00000000000..66d3315fe74 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1elt__multiplication__expr_1_1result.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::gm::elt_multiplication_expr::result< T1, T2, T3 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::elt_multiplication_expr::result< T1, T2, T3 > Struct Template Reference
+
+
+ +

#include <term_grammar_def.hpp>

+ + + + +

+Public Types

typedef expression type
 
+

Detailed Description

+

template<typename T1, typename T2, typename T3>
+struct stan::gm::elt_multiplication_expr::result< T1, T2, T3 >

+ + +

Definition at line 234 of file term_grammar_def.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 , typename T3 >
+ + + + +
typedef expression stan::gm::elt_multiplication_expr::result< T1, T2, T3 >::type
+
+ +

Definition at line 234 of file term_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1error__codes-members.html b/doc/api/html/structstan_1_1gm_1_1error__codes-members.html new file mode 100644 index 00000000000..03bf304b4f6 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1error__codes-members.html @@ -0,0 +1,118 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::error_codes Member List
+
+
+ +

This is the complete list of members for stan::gm::error_codes, including all inherited members.

+ + + + + + + +
CONFIG enum valuestan::gm::error_codes
DATAERR enum valuestan::gm::error_codes
NOINPUT enum valuestan::gm::error_codes
OK enum valuestan::gm::error_codes
SOFTWARE enum valuestan::gm::error_codes
USAGE enum valuestan::gm::error_codes
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1error__codes.html b/doc/api/html/structstan_1_1gm_1_1error__codes.html new file mode 100644 index 00000000000..e35e554ce21 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1error__codes.html @@ -0,0 +1,166 @@ + + + + + +Stan: stan::gm::error_codes Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::error_codes Struct Reference
+
+
+ +

#include <error_codes.hpp>

+ + + + +

+Public Types

enum  {
+  OK = 0, +USAGE = 64, +DATAERR = 65, +NOINPUT = 66, +
+  SOFTWARE = 70, +CONFIG = 78 +
+ }
 
+

Detailed Description

+
+

Definition at line 7 of file error_codes.hpp.

+

Member Enumeration Documentation

+ +
+
+ + + + +
anonymous enum
+
+
Enumerator:
+ + + + + + +
OK  +
USAGE  +
DATAERR  +
NOINPUT  +
SOFTWARE  +
CONFIG  +
+
+
+ +

Definition at line 10 of file error_codes.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1expr__type-members.html b/doc/api/html/structstan_1_1gm_1_1expr__type-members.html new file mode 100644 index 00000000000..43b63f854ae --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1expr__type-members.html @@ -0,0 +1,125 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::expr_type Member List
+
+
+ +

This is the complete list of members for stan::gm::expr_type, including all inherited members.

+ + + + + + + + + + + + + + +
base_type_stan::gm::expr_type
expr_type()stan::gm::expr_type
expr_type(const base_expr_type base_type)stan::gm::expr_type
expr_type(const base_expr_type base_type, size_t num_dims)stan::gm::expr_type
is_ill_formed() const stan::gm::expr_type
is_primitive() const stan::gm::expr_type
is_primitive_double() const stan::gm::expr_type
is_primitive_int() const stan::gm::expr_type
num_dims() const stan::gm::expr_type
num_dims_stan::gm::expr_type
operator!=(const expr_type &et) const stan::gm::expr_type
operator==(const expr_type &et) const stan::gm::expr_type
type() const stan::gm::expr_type
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1expr__type.html b/doc/api/html/structstan_1_1gm_1_1expr__type.html new file mode 100644 index 00000000000..0576fb4c438 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1expr__type.html @@ -0,0 +1,387 @@ + + + + + +Stan: stan::gm::expr_type Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::expr_type Struct Reference
+
+
+ +

#include <ast.hpp>

+ + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 expr_type ()
 
 expr_type (const base_expr_type base_type)
 
 expr_type (const base_expr_type base_type, size_t num_dims)
 
bool operator== (const expr_type &et) const
 
bool operator!= (const expr_type &et) const
 
bool is_primitive () const
 
bool is_primitive_int () const
 
bool is_primitive_double () const
 
bool is_ill_formed () const
 
base_expr_type type () const
 
size_t num_dims () const
 
+ + + + + +

+Public Attributes

base_expr_type base_type_
 
size_t num_dims_
 
+

Detailed Description

+
+

Definition at line 68 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::expr_type::expr_type ()
+
+ +

Definition at line 50 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::expr_type::expr_type (const base_expr_type base_type)
+
+ +

Definition at line 54 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
stan::gm::expr_type::expr_type (const base_expr_type base_type,
size_t num_dims 
)
+
+ +

Definition at line 58 of file ast_def.cpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + + + +
bool stan::gm::expr_type::is_ill_formed () const
+
+ +

Definition at line 82 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + +
bool stan::gm::expr_type::is_primitive () const
+
+ +

Definition at line 70 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + +
bool stan::gm::expr_type::is_primitive_double () const
+
+ +

Definition at line 78 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + +
bool stan::gm::expr_type::is_primitive_int () const
+
+ +

Definition at line 74 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + +
size_t stan::gm::expr_type::num_dims () const
+
+ +

Definition at line 88 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
bool stan::gm::expr_type::operator!= (const expr_typeet) const
+
+ +

Definition at line 67 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
bool stan::gm::expr_type::operator== (const expr_typeet) const
+
+ +

Definition at line 63 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + +
base_expr_type stan::gm::expr_type::type () const
+
+ +

Definition at line 85 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
base_expr_type stan::gm::expr_type::base_type_
+
+ +

Definition at line 69 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
size_t stan::gm::expr_type::num_dims_
+
+ +

Definition at line 70 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1expression-members.html b/doc/api/html/structstan_1_1gm_1_1expression-members.html new file mode 100644 index 00000000000..a39220f1e08 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1expression-members.html @@ -0,0 +1,131 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::expression Member List
+
+
+ +

This is the complete list of members for stan::gm::expression, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + +
expr_stan::gm::expression
expression()stan::gm::expression
expression(const expression &e)stan::gm::expression
expression(const nil &expr)stan::gm::expression
expression(const int_literal &expr)stan::gm::expression
expression(const double_literal &expr)stan::gm::expression
expression(const array_literal &expr)stan::gm::expression
expression(const variable &expr)stan::gm::expression
expression(const fun &expr)stan::gm::expression
expression(const index_op &expr)stan::gm::expression
expression(const binary_op &expr)stan::gm::expression
expression(const unary_op &expr)stan::gm::expression
expression(const expression_t &expr_)stan::gm::expression
expression_t typedefstan::gm::expression
expression_type() const stan::gm::expression
operator*=(const expression &rhs)stan::gm::expression
operator+=(const expression &rhs)stan::gm::expression
operator-=(const expression &rhs)stan::gm::expression
operator/=(const expression &rhs)stan::gm::expression
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1expression.html b/doc/api/html/structstan_1_1gm_1_1expression.html new file mode 100644 index 00000000000..bac249949ba --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1expression.html @@ -0,0 +1,525 @@ + + + + + +Stan: stan::gm::expression Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::expression Struct Reference
+
+
+ +

#include <ast.hpp>

+ + + + +

+Public Types

typedef boost::variant
+< boost::recursive_wrapper
+< nil >
+, boost::recursive_wrapper
+< int_literal >
+, boost::recursive_wrapper
+< double_literal >
+, boost::recursive_wrapper
+< array_literal >
+, boost::recursive_wrapper
+< variable >
+, boost::recursive_wrapper
+< fun >
+, boost::recursive_wrapper
+< index_op >
+, boost::recursive_wrapper
+< binary_op >
+, boost::recursive_wrapper
+< unary_op > > 
expression_t
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 expression ()
 
 expression (const expression &e)
 
 expression (const nil &expr)
 
 expression (const int_literal &expr)
 
 expression (const double_literal &expr)
 
 expression (const array_literal &expr)
 
 expression (const variable &expr)
 
 expression (const fun &expr)
 
 expression (const index_op &expr)
 
 expression (const binary_op &expr)
 
 expression (const unary_op &expr)
 
 expression (const expression_t &expr_)
 
expr_type expression_type () const
 
expressionoperator+= (const expression &rhs)
 
expressionoperator-= (const expression &rhs)
 
expressionoperator*= (const expression &rhs)
 
expressionoperator/= (const expression &rhs)
 
+ + + +

+Public Attributes

expression_t expr_
 
+

Detailed Description

+
+

Definition at line 194 of file ast.hpp.

+

Member Typedef Documentation

+ +
+
+ + + + +
typedef boost::variant<boost::recursive_wrapper<nil>, boost::recursive_wrapper<int_literal>, boost::recursive_wrapper<double_literal>, boost::recursive_wrapper<array_literal>, boost::recursive_wrapper<variable>, boost::recursive_wrapper<fun>, boost::recursive_wrapper<index_op>, boost::recursive_wrapper<binary_op>, boost::recursive_wrapper<unary_op> > stan::gm::expression::expression_t
+
+ +

Definition at line 204 of file ast.hpp.

+ +
+
+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::expression::expression ()
+
+ +

Definition at line 362 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::expression::expression (const expressione)
+
+ +

Definition at line 365 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::expression::expression (const nilexpr)
+
+ +

Definition at line 376 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::expression::expression (const int_literalexpr)
+
+ +

Definition at line 377 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::expression::expression (const double_literalexpr)
+
+ +

Definition at line 378 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::expression::expression (const array_literalexpr)
+
+ +

Definition at line 379 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::expression::expression (const variableexpr)
+
+ +

Definition at line 380 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::expression::expression (const funexpr)
+
+ +

Definition at line 381 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::expression::expression (const index_opexpr)
+
+ +

Definition at line 382 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::expression::expression (const binary_opexpr)
+
+ +

Definition at line 383 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::expression::expression (const unary_opexpr)
+
+ +

Definition at line 384 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::expression::expression (const expression_texpr_)
+
+ +

Definition at line 375 of file ast_def.cpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + + + +
expr_type stan::gm::expression::expression_type () const
+
+ +

Definition at line 368 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
expression & stan::gm::expression::operator*= (const expressionrhs)
+
+ +

Definition at line 1029 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
expression & stan::gm::expression::operator+= (const expressionrhs)
+
+ +

Definition at line 1019 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
expression & stan::gm::expression::operator-= (const expressionrhs)
+
+ +

Definition at line 1024 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
expression & stan::gm::expression::operator/= (const expressionrhs)
+
+ +

Definition at line 1034 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
expression_t stan::gm::expression::expr_
+
+ +

Definition at line 228 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1expression__as__statement-members.html b/doc/api/html/structstan_1_1gm_1_1expression__as__statement-members.html new file mode 100644 index 00000000000..3af6b2d3ebd --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1expression__as__statement-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::expression_as_statement Member List
+
+
+ +

This is the complete list of members for stan::gm::expression_as_statement, including all inherited members.

+ + +
operator()(bool &pass, const stan::gm::expression &expr, std::stringstream &error_msgs) const stan::gm::expression_as_statementinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1expression__as__statement.html b/doc/api/html/structstan_1_1gm_1_1expression__as__statement.html new file mode 100644 index 00000000000..4d4c65d5a8d --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1expression__as__statement.html @@ -0,0 +1,175 @@ + + + + + +Stan: stan::gm::expression_as_statement Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::expression_as_statement Struct Reference
+
+
+ +

#include <statement_grammar_def.hpp>

+ + + + +

+Classes

struct  result
 
+ + + +

+Public Member Functions

void operator() (bool &pass, const stan::gm::expression &expr, std::stringstream &error_msgs) const
 
+

Detailed Description

+
+

Definition at line 297 of file statement_grammar_def.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::expression_as_statement::operator() (bool & pass,
const stan::gm::expressionexpr,
std::stringstream & error_msgs 
) const
+
+inline
+
+ +

Definition at line 300 of file statement_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1expression__as__statement_1_1result-members.html b/doc/api/html/structstan_1_1gm_1_1expression__as__statement_1_1result-members.html new file mode 100644 index 00000000000..9ba7240ac69 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1expression__as__statement_1_1result-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::expression_as_statement::result< T1, T2, T3 > Member List
+
+
+ +

This is the complete list of members for stan::gm::expression_as_statement::result< T1, T2, T3 >, including all inherited members.

+ + +
type typedefstan::gm::expression_as_statement::result< T1, T2, T3 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1expression__as__statement_1_1result.html b/doc/api/html/structstan_1_1gm_1_1expression__as__statement_1_1result.html new file mode 100644 index 00000000000..0f53ccdb76a --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1expression__as__statement_1_1result.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::gm::expression_as_statement::result< T1, T2, T3 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::expression_as_statement::result< T1, T2, T3 > Struct Template Reference
+
+
+ +

#include <statement_grammar_def.hpp>

+ + + + +

+Public Types

typedef void type
 
+

Detailed Description

+

template<typename T1, typename T2, typename T3>
+struct stan::gm::expression_as_statement::result< T1, T2, T3 >

+ + +

Definition at line 299 of file statement_grammar_def.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 , typename T3 >
+ + + + +
typedef void stan::gm::expression_as_statement::result< T1, T2, T3 >::type
+
+ +

Definition at line 299 of file statement_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1expression__grammar-members.html b/doc/api/html/structstan_1_1gm_1_1expression__grammar-members.html new file mode 100644 index 00000000000..d0f0db199d7 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1expression__grammar-members.html @@ -0,0 +1,121 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::expression_grammar< Iterator > Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1expression__grammar.html b/doc/api/html/structstan_1_1gm_1_1expression__grammar.html new file mode 100644 index 00000000000..a5760fdfd2e --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1expression__grammar.html @@ -0,0 +1,334 @@ + + + + + +Stan: stan::gm::expression_grammar< Iterator > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::expression_grammar< Iterator > Struct Template Reference
+
+
+ +

#include <expression_grammar.hpp>

+
+Inheritance diagram for stan::gm::expression_grammar< Iterator >:
+
+
+ + + +
+ + + + +

+Public Member Functions

 expression_grammar (variable_map &var_map, std::stringstream &error_msgs, bool allow_lte=true)
 
+ + + + + + + + + + + + + + + + + +

+Public Attributes

variable_mapvar_map_
 
std::stringstream & error_msgs_
 
term_grammar< Iterator > term_g
 
boost::spirit::qi::rule
+< Iterator, expression(var_origin),
+whitespace_grammar< Iterator > > 
expression_r
 
boost::spirit::qi::rule
+< Iterator, expression(var_origin),
+whitespace_grammar< Iterator > > 
expression07_r
 
boost::spirit::qi::rule
+< Iterator, expression(var_origin),
+whitespace_grammar< Iterator > > 
expression09_r
 
boost::spirit::qi::rule
+< Iterator, expression(var_origin),
+whitespace_grammar< Iterator > > 
expression10_r
 
boost::spirit::qi::rule
+< Iterator, expression(var_origin),
+whitespace_grammar< Iterator > > 
expression14_r
 
+

Detailed Description

+

template<typename Iterator>
+struct stan::gm::expression_grammar< Iterator >

+ + +

Definition at line 25 of file expression_grammar.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename Iterator >
+ + + + + + + + + + + + + + + + + + + + + + + + +
expression_grammar< Iterator >::expression_grammar (variable_mapvar_map,
std::stringstream & error_msgs,
bool allow_lte = true 
)
+
+ +

Definition at line 168 of file expression_grammar_def.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+
+template<typename Iterator>
+ + + + +
std::stringstream& stan::gm::expression_grammar< Iterator >::error_msgs_
+
+ +

Definition at line 36 of file expression_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator, expression(var_origin), whitespace_grammar<Iterator> > stan::gm::expression_grammar< Iterator >::expression07_r
+
+ +

Definition at line 50 of file expression_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator, expression(var_origin), whitespace_grammar<Iterator> > stan::gm::expression_grammar< Iterator >::expression09_r
+
+ +

Definition at line 55 of file expression_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator, expression(var_origin), whitespace_grammar<Iterator> > stan::gm::expression_grammar< Iterator >::expression10_r
+
+ +

Definition at line 60 of file expression_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator, expression(var_origin), whitespace_grammar<Iterator> > stan::gm::expression_grammar< Iterator >::expression14_r
+
+ +

Definition at line 65 of file expression_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator, expression(var_origin), whitespace_grammar<Iterator> > stan::gm::expression_grammar< Iterator >::expression_r
+
+ +

Definition at line 45 of file expression_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
term_grammar<Iterator> stan::gm::expression_grammar< Iterator >::term_g
+
+ +

Definition at line 38 of file expression_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
variable_map& stan::gm::expression_grammar< Iterator >::var_map_
+
+ +

Definition at line 34 of file expression_grammar.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1expression__grammar.png b/doc/api/html/structstan_1_1gm_1_1expression__grammar.png new file mode 100644 index 0000000000000000000000000000000000000000..15884fe9f1da3a3440f7d6248531b60d76180942 GIT binary patch literal 1419 zcmcgsdsLDK6#tZ?S(D1S($7klLu^`Ru7i)zY-;*7bgDMQ-(s)@ z0021T=Ijjs>YxgHX~9%BNtLlWOj!rr5=rkwO`dU$`0k85Cfk!@ zO^oZEo$scEre`9)f{I)t=L*2eNTBj@sT7_ zHEPwqWBpG7FM=siM9+jZ%N~>aLGBs}pJ$-~aqUlmG|Y;5IY)DKP?(ZmG8VBmv`DHt zV|3**A!)j9j&ume$`QybZcg0bt+w(e8$L3N&d2v(;bb_#9omcG#0fO-^nRZ;dRm^` z-Wqp3V!LY-yXq2t3Q^Wcuk?6YoBWy+0($qK?nDi>hD-fjd)>(alR0OG-Lg3AH2SfO z{*gEB#d@!5dYwL}t(Q_WqnIU;DWYO!u6P9T!FIGO#I9!$J*nFRA`T$4>;`D%;TUYe zaqe784d&x3MmVL!m`w;JeERqvG^8Lcd*b`(U|*lW_`8#&AmHvIp0K)3kbW1ALEu^X4&q^khHrJ$P}Nx z66#NHN2?ZWKFY<1INT?9ND`=%iAOvy&^(*!?V7eEAg{G=Ggk9dLD=v@wUwg zMaGNSUl$Q}xkYuO?6((tvJdU@x`nl}VjbFKXEun-Az|Sw*Thh#TCEjg z+#!PU*TthUf0|*C!Jy0!@(x75GMtGl8J{PaLYvU1K&SiJg;n=9*_`)bOfDoqW|K4W z%)Ad`!kQ(1uIDX0ztwPF!6jbJv1Du_++^A3FV;XF?ZHM+a$K zKl~a0$y>cdHA_dLk7lCUK1zb00ie0BRR~xD$!V7R;Q(xyfCuyw4W;UQ0P{o}fO%C~ z0oslY8x=duVgGBAN^wzLkCv_uO9#;858n#hnCx1%+Bv{%WBO8G5YYT(Zc!N9JM-ZE z^84tirTN8vB^Crqg7E(~p+JkYit;97x_BolHKaMbe`>o^^Nj=H%6En)$)W@fZj?;T ztAn-y7X?cheW z0ye3a!8kl!lE(=0V^f4i2WK&0LX)b8B0OM_i`+(^ZTo%sdRItUo79nHYdR*nJ;J6= z%6y4&I4Z^6!#c`gOU^4bE^Cj|9O{plJJ@^09ALUNJ|77P#QG}%?lKZdJ#uUQBWgrG z>?7KyvN=QXVro`9c}U&ZQsCTz(JrQy VK-;UfQ}sCk$i>r{{q4DHe*+9#pf~^k literal 0 HcmV?d00001 diff --git a/doc/api/html/structstan_1_1gm_1_1expression__type__vis-members.html b/doc/api/html/structstan_1_1gm_1_1expression__type__vis-members.html new file mode 100644 index 00000000000..a07e23d2dd7 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1expression__type__vis-members.html @@ -0,0 +1,121 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::expression_type_vis Member List
+
+
+ +

This is the complete list of members for stan::gm::expression_type_vis, including all inherited members.

+ + + + + + + + + + +
operator()(const nil &e) const stan::gm::expression_type_vis
operator()(const int_literal &e) const stan::gm::expression_type_vis
operator()(const double_literal &e) const stan::gm::expression_type_vis
operator()(const array_literal &e) const stan::gm::expression_type_vis
operator()(const variable &e) const stan::gm::expression_type_vis
operator()(const fun &e) const stan::gm::expression_type_vis
operator()(const index_op &e) const stan::gm::expression_type_vis
operator()(const binary_op &e) const stan::gm::expression_type_vis
operator()(const unary_op &e) const stan::gm::expression_type_vis
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1expression__type__vis.html b/doc/api/html/structstan_1_1gm_1_1expression__type__vis.html new file mode 100644 index 00000000000..ea760ea1230 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1expression__type__vis.html @@ -0,0 +1,314 @@ + + + + + +Stan: stan::gm::expression_type_vis Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::expression_type_vis Struct Reference
+
+
+ +

#include <ast.hpp>

+
+Inheritance diagram for stan::gm::expression_type_vis:
+
+
+ + + +
+ + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

expr_type operator() (const nil &e) const
 
expr_type operator() (const int_literal &e) const
 
expr_type operator() (const double_literal &e) const
 
expr_type operator() (const array_literal &e) const
 
expr_type operator() (const variable &e) const
 
expr_type operator() (const fun &e) const
 
expr_type operator() (const index_op &e) const
 
expr_type operator() (const binary_op &e) const
 
expr_type operator() (const unary_op &e) const
 
+

Detailed Description

+
+

Definition at line 176 of file ast.hpp.

+

Member Function Documentation

+ +
+
+ + + + + + + + +
expr_type stan::gm::expression_type_vis::operator() (const nile) const
+
+ +

Definition at line 330 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
expr_type stan::gm::expression_type_vis::operator() (const int_literale) const
+
+ +

Definition at line 337 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
expr_type stan::gm::expression_type_vis::operator() (const double_literale) const
+
+ +

Definition at line 340 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
expr_type stan::gm::expression_type_vis::operator() (const array_literale) const
+
+ +

Definition at line 343 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
expr_type stan::gm::expression_type_vis::operator() (const variablee) const
+
+ +

Definition at line 346 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
expr_type stan::gm::expression_type_vis::operator() (const fune) const
+
+ +

Definition at line 349 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
expr_type stan::gm::expression_type_vis::operator() (const index_ope) const
+
+ +

Definition at line 352 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
expr_type stan::gm::expression_type_vis::operator() (const binary_ope) const
+
+ +

Definition at line 355 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
expr_type stan::gm::expression_type_vis::operator() (const unary_ope) const
+
+ +

Definition at line 358 of file ast_def.cpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1expression__type__vis.png b/doc/api/html/structstan_1_1gm_1_1expression__type__vis.png new file mode 100644 index 0000000000000000000000000000000000000000..e342df4ce2c604e4b71cda34649f2d2200f4b4d6 GIT binary patch literal 818 zcmeAS@N?(olHy`uVBq!ia0vp^$ACD1gBeJcR{b&rQW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;y~4d0f@M|NYCg zoE#QxDSyXPwlS>lsu0udmLFX+Z~krdymWV~fl8*BE|2FdSHZ>3!8}WkKab6h`m_JB zvZua@)z{?`lfHQU7d!lIcRK&Mx<|R+B=m1jD7Fyelf3c&-lJs-$65COv#a2n>Q~r$ z`kzXrw}iXJe(saE)PgrDIjhC$PCPpQ((T9Tsx#UCCfz$P9?H9T#pf?GayL%veeu@t z)KlBIXC((u)Ok&?bK`oytko(jp=HvC$;CZuG`3l+H{5iyGIZ|Cx5+WzZfdO3YD+mc z>*k8(XWpMm_V5Zj>GnM*s$F5W@^tLIM(#KmpHqCl;pg%8?(YyTTr9WSzbH?{x_V)4v%9rH*ap z&X1p5a5HAk`HPDVAFZ!B^x3TFhrHcGyV&wr=J|X7bI9HK%k}(*B#%efL5n%(H5*Ue zUO4%9b=Chb++~LEUrawMex}`U663j75}FQ@>*RFzrXE=LNzr(Rm0R+TqZc$+8Gmn< zXisN7%zxw|Ut2nV@#eXG;-Qj72GU#SisWw=x3Gx~ia02tw@S~gEbNqS%jZg6E#~~# zo?ACNWK+K6wA^Vod;IJ8&Nj!yUcafkd>03&N_^aSYo*Y!ia^FKUz3jc+c9*?C&au@ znlh73Z3YLEQYv2%@pPsCuazNc{F4F_q+Mp1I$(e}^XBM?G8gy^-@11$` b?pO8>y`qV0INx{x6F7sXtDnm{r-UW|> + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::expression_visgen Member List
+
+
+ +

This is the complete list of members for stan::gm::expression_visgen, including all inherited members.

+ + + + + + + + + + + + + + + + + +
expression_visgen(std::ostream &o)stan::gm::expression_visgeninline
o_stan::gm::visgen
operator()(nil const &) const stan::gm::expression_visgeninline
operator()(const int_literal &n) const stan::gm::expression_visgeninline
operator()(const double_literal &x) const stan::gm::expression_visgeninline
operator()(const array_literal &x) const stan::gm::expression_visgeninline
operator()(const variable &v) const stan::gm::expression_visgeninline
operator()(int n) const stan::gm::expression_visgeninline
operator()(double x) const stan::gm::expression_visgeninline
operator()(const std::string &x) const stan::gm::expression_visgeninline
operator()(const index_op &x) const stan::gm::expression_visgeninline
operator()(const fun &fx) const stan::gm::expression_visgeninline
operator()(const binary_op &expr) const stan::gm::expression_visgeninline
operator()(const unary_op &expr) const stan::gm::expression_visgeninline
result_type typedefstan::gm::visgen
visgen(std::ostream &o)stan::gm::visgeninline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1expression__visgen.html b/doc/api/html/structstan_1_1gm_1_1expression__visgen.html new file mode 100644 index 00000000000..4e41717013d --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1expression__visgen.html @@ -0,0 +1,511 @@ + + + + + +Stan: stan::gm::expression_visgen Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::expression_visgen Struct Reference
+
+
+ +

#include <generator.hpp>

+
+Inheritance diagram for stan::gm::expression_visgen:
+
+
+ + +stan::gm::visgen + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 expression_visgen (std::ostream &o)
 
void operator() (nil const &) const
 
void operator() (const int_literal &n) const
 
void operator() (const double_literal &x) const
 
void operator() (const array_literal &x) const
 
void operator() (const variable &v) const
 
void operator() (int n) const
 
void operator() (double x) const
 
void operator() (const std::string &x) const
 
void operator() (const index_op &x) const
 
void operator() (const fun &fx) const
 
void operator() (const binary_op &expr) const
 
void operator() (const unary_op &expr) const
 
- Public Member Functions inherited from stan::gm::visgen
 visgen (std::ostream &o)
 
+ + + + + + + +

+Additional Inherited Members

- Public Types inherited from stan::gm::visgen
typedef void result_type
 
- Public Attributes inherited from stan::gm::visgen
std::ostream & o_
 
+

Detailed Description

+
+

Definition at line 142 of file generator.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::gm::expression_visgen::expression_visgen (std::ostream & o)
+
+inline
+
+ +

Definition at line 143 of file generator.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::expression_visgen::operator() (nil const & ) const
+
+inline
+
+ +

Definition at line 144 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::expression_visgen::operator() (const int_literaln) const
+
+inline
+
+ +

Definition at line 147 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::expression_visgen::operator() (const double_literalx) const
+
+inline
+
+ +

Definition at line 148 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::expression_visgen::operator() (const array_literalx) const
+
+inline
+
+ +

Definition at line 154 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::expression_visgen::operator() (const variablev) const
+
+inline
+
+ +

Definition at line 168 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::expression_visgen::operator() (int n) const
+
+inline
+
+ +

Definition at line 169 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::expression_visgen::operator() (double x) const
+
+inline
+
+ +

Definition at line 170 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::expression_visgen::operator() (const std::string & x) const
+
+inline
+
+ +

Definition at line 171 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::expression_visgen::operator() (const index_opx) const
+
+inline
+
+ +

Definition at line 172 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::expression_visgen::operator() (const funfx) const
+
+inline
+
+ +

Definition at line 184 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::expression_visgen::operator() (const binary_opexpr) const
+
+inline
+
+ +

Definition at line 194 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::expression_visgen::operator() (const unary_opexpr) const
+
+inline
+
+ +

Definition at line 201 of file generator.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1expression__visgen.png b/doc/api/html/structstan_1_1gm_1_1expression__visgen.png new file mode 100644 index 0000000000000000000000000000000000000000..3418abb1fd714c10b41bbb6cf4081741e5137eae GIT binary patch literal 692 zcmeAS@N?(olHy`uVBq!ia0vp^D}XqFgBeKf3OV-)NJ#|vgt-3y{~ySF@#br3|Dg#$ z78oBmaDcV*jy#adQ4-`A%m7pb0#{Fk7%?y~IeWS|hEy=Vo%_1)wE_=YyMEC9{}atM zRbrg-*51DSA|mP1-A6N4^8QJaXnV+K;Bo2w<3*EFI=j6lsZMuoR*8KwwOl3ivG$@# zU-ZIV4r@qGJHF!2pA(ZW`_xR?uT?9UoE&1_sPeYJ(PW*)`q_I<3(o94eZp*&mxAZ< z7~!*P&!679RXcqBzFe(4DifC2uG?1k?vCZf9im0Arw6SQ_P8W>oiF(I1@1*}XaAJ- zw0btz_Etw&^|o93j;9`Huk~MEw=&f3s$-Vh#~1T{^>2-vw9Rt+i*E6aQ(x?S6|-vL zlB5}-CS}2szFCN?dg@MFJAFz2LzvqazcAoA%*$Z#oUwrYozkz0J4e3gEn58C)+b;2 z)pEH5V&beDj<_=F6b3SQ$A}yd!p;4ce^J0`2Qy2<{o_#eQWyIpdq%lu9=(RE3$ubmII*OXGWUi9>c(OpqrrrcRm z7HaRxdoibAWv?$!jIB$z zQ(~O8vGCP& + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::for_statement Member List
+
+
+ +

This is the complete list of members for stan::gm::for_statement, including all inherited members.

+ + + + + + +
for_statement()stan::gm::for_statement
for_statement(std::string &variable, range &range, statement &stmt)stan::gm::for_statement
range_stan::gm::for_statement
statement_stan::gm::for_statement
variable_stan::gm::for_statement
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1for__statement.html b/doc/api/html/structstan_1_1gm_1_1for__statement.html new file mode 100644 index 00000000000..9a916a34ab2 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1for__statement.html @@ -0,0 +1,234 @@ + + + + + +Stan: stan::gm::for_statement Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::for_statement Struct Reference
+
+
+ +

#include <ast.hpp>

+ + + + + + +

+Public Member Functions

 for_statement ()
 
 for_statement (std::string &variable, range &range, statement &stmt)
 
+ + + + + + + +

+Public Attributes

std::string variable_
 
range range_
 
statement statement_
 
+

Detailed Description

+
+

Definition at line 614 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::for_statement::for_statement ()
+
+ +

Definition at line 943 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
stan::gm::for_statement::for_statement (std::string & variable,
rangerange,
statementstmt 
)
+
+ +

Definition at line 945 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
range stan::gm::for_statement::range_
+
+ +

Definition at line 616 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
statement stan::gm::for_statement::statement_
+
+ +

Definition at line 617 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
std::string stan::gm::for_statement::variable_
+
+ +

Definition at line 615 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1fun-members.html b/doc/api/html/structstan_1_1gm_1_1fun-members.html new file mode 100644 index 00000000000..0325cc87418 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1fun-members.html @@ -0,0 +1,118 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::fun Member List
+
+
+ +

This is the complete list of members for stan::gm::fun, including all inherited members.

+ + + + + + + +
args_stan::gm::fun
fun()stan::gm::fun
fun(std::string const &name, std::vector< expression > const &args)stan::gm::fun
infer_type()stan::gm::fun
name_stan::gm::fun
type_stan::gm::fun
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1fun.html b/doc/api/html/structstan_1_1gm_1_1fun.html new file mode 100644 index 00000000000..744279b2e03 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1fun.html @@ -0,0 +1,248 @@ + + + + + +Stan: stan::gm::fun Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::fun Struct Reference
+
+
+ +

#include <ast.hpp>

+ + + + + + + + +

+Public Member Functions

 fun ()
 
 fun (std::string const &name, std::vector< expression > const &args)
 
void infer_type ()
 
+ + + + + + + +

+Public Attributes

std::string name_
 
std::vector< expressionargs_
 
expr_type type_
 
+

Detailed Description

+
+

Definition at line 307 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::fun::fun ()
+
+ +

Definition at line 567 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
stan::gm::fun::fun (std::string const & name,
std::vector< expression > const & args 
)
+
+ +

Definition at line 568 of file ast_def.cpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + + + +
void stan::gm::fun::infer_type ()
+
+ +

Definition at line 574 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
std::vector<expression> stan::gm::fun::args_
+
+ +

Definition at line 309 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
std::string stan::gm::fun::name_
+
+ +

Definition at line 308 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
expr_type stan::gm::fun::type_
+
+ +

Definition at line 310 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1generate__init__vars__visgen-members.html b/doc/api/html/structstan_1_1gm_1_1generate__init__vars__visgen-members.html new file mode 100644 index 00000000000..74effaa09e5 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1generate__init__vars__visgen-members.html @@ -0,0 +1,130 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::generate_init_vars_visgen Member List
+
+
+ +

This is the complete list of members for stan::gm::generate_init_vars_visgen, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
generate_init_vars_visgen(int indent, std::ostream &o)stan::gm::generate_init_vars_visgeninline
indent_stan::gm::generate_init_vars_visgen
o_stan::gm::visgen
operator()(nil const &) const stan::gm::generate_init_vars_visgeninline
operator()(int_var_decl const &x) const stan::gm::generate_init_vars_visgeninline
operator()(double_var_decl const &x) const stan::gm::generate_init_vars_visgeninline
operator()(vector_var_decl const &x) const stan::gm::generate_init_vars_visgeninline
operator()(row_vector_var_decl const &x) const stan::gm::generate_init_vars_visgeninline
operator()(matrix_var_decl const &x) const stan::gm::generate_init_vars_visgeninline
operator()(unit_vector_var_decl const &x) const stan::gm::generate_init_vars_visgeninline
operator()(simplex_var_decl const &x) const stan::gm::generate_init_vars_visgeninline
operator()(ordered_var_decl const &x) const stan::gm::generate_init_vars_visgeninline
operator()(positive_ordered_var_decl const &x) const stan::gm::generate_init_vars_visgeninline
operator()(cholesky_factor_var_decl const &x) const stan::gm::generate_init_vars_visgeninline
operator()(cov_matrix_var_decl const &x) const stan::gm::generate_init_vars_visgeninline
operator()(corr_matrix_var_decl const &x) const stan::gm::generate_init_vars_visgeninline
result_type typedefstan::gm::visgen
visgen(std::ostream &o)stan::gm::visgeninline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1generate__init__vars__visgen.html b/doc/api/html/structstan_1_1gm_1_1generate__init__vars__visgen.html new file mode 100644 index 00000000000..fda1c8ffe45 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1generate__init__vars__visgen.html @@ -0,0 +1,570 @@ + + + + + +Stan: stan::gm::generate_init_vars_visgen Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::generate_init_vars_visgen Struct Reference
+
+
+ +

#include <generator.hpp>

+
+Inheritance diagram for stan::gm::generate_init_vars_visgen:
+
+
+ + +stan::gm::visgen + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 generate_init_vars_visgen (int indent, std::ostream &o)
 
void operator() (nil const &) const
 
void operator() (int_var_decl const &x) const
 
void operator() (double_var_decl const &x) const
 
void operator() (vector_var_decl const &x) const
 
void operator() (row_vector_var_decl const &x) const
 
void operator() (matrix_var_decl const &x) const
 
void operator() (unit_vector_var_decl const &x) const
 
void operator() (simplex_var_decl const &x) const
 
void operator() (ordered_var_decl const &x) const
 
void operator() (positive_ordered_var_decl const &x) const
 
void operator() (cholesky_factor_var_decl const &x) const
 
void operator() (cov_matrix_var_decl const &x) const
 
void operator() (corr_matrix_var_decl const &x) const
 
- Public Member Functions inherited from stan::gm::visgen
 visgen (std::ostream &o)
 
+ + + + + + +

+Public Attributes

int indent_
 
- Public Attributes inherited from stan::gm::visgen
std::ostream & o_
 
+ + + + +

+Additional Inherited Members

- Public Types inherited from stan::gm::visgen
typedef void result_type
 
+

Detailed Description

+
+

Definition at line 1195 of file generator.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
stan::gm::generate_init_vars_visgen::generate_init_vars_visgen (int indent,
std::ostream & o 
)
+
+inline
+
+ +

Definition at line 1197 of file generator.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_init_vars_visgen::operator() (nil const & ) const
+
+inline
+
+ +

Definition at line 1202 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_init_vars_visgen::operator() (int_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1203 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_init_vars_visgen::operator() (double_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1207 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_init_vars_visgen::operator() (vector_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1211 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_init_vars_visgen::operator() (row_vector_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1215 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_init_vars_visgen::operator() (matrix_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1219 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_init_vars_visgen::operator() (unit_vector_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1223 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_init_vars_visgen::operator() (simplex_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1227 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_init_vars_visgen::operator() (ordered_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1231 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_init_vars_visgen::operator() (positive_ordered_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1235 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_init_vars_visgen::operator() (cholesky_factor_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1239 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_init_vars_visgen::operator() (cov_matrix_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1243 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_init_vars_visgen::operator() (corr_matrix_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1247 of file generator.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
int stan::gm::generate_init_vars_visgen::indent_
+
+ +

Definition at line 1196 of file generator.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1generate__init__vars__visgen.png b/doc/api/html/structstan_1_1gm_1_1generate__init__vars__visgen.png new file mode 100644 index 0000000000000000000000000000000000000000..8d98ba1b7d327492bd042d941c790468d2e23e91 GIT binary patch literal 763 zcmeAS@N?(olHy`uVBq!ia0vp^SAaNxgBeJMDXxA3q$C1-LR|m<{|{uoc=NTi|Ih>= z3ycpOIKbL@M;^%KC<*clW&kPzfvcxNj2IZ0x;$MRLn;{G&b>IPS%Jru|N6{-|JB#) zY6x7&TD_b5Fwgb7Op2CjN5Yq7&Z-igtnzg!qpGKFhJ$Ai_b!f8o|implaxK*e{Bz# zRMNk%y~ub%w7l`X*Zwgz>wdWZVms7w|8;pN|AZx%e@UHk-+n|w;_}0-7nWMTUH68; z^H)f?!_iOO3vbR@GBItlTJbXmPpkFWr}9_MOAgp4ll*h7rWR1==Us~eZ!EH6Ox0c7 zt5Un__4_G}r`|<`ZT9PW96v4oMO`*uQhD(t$&-t3{r%_q)AQ1{KGuqt?eF4NB?Ci`>qN<+NR@=NM^}YP}Y4VczYYmf@h?y)y2t965giQk$3bIX3-d*HvI!6L6fa^bUg|Nf-49xqlbd>&n2F(WehL4E7qXBSND zS6|%qK>ZD;WgSOCVd%&CPCxH<`zH9bUw4{*E~@!zZcoz8-hD>(sTV%B-1^m5&n+r@ z+u%*%R)rjon`<=}Zdz&+oOvl{;WD$* + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::generate_init_visgen Member List
+
+
+ +

This is the complete list of members for stan::gm::generate_init_visgen, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + +
function_args(const std::string &fun_prefix, const D &x) const stan::gm::generate_init_visgeninline
generate_buffer_loop(const std::string &base_type, const std::string &name, const std::vector< expression > &dims, const expression &dim1=expression(), const expression &dim2=expression(), int indent=2U) const stan::gm::generate_init_visgeninline
generate_check_double(const std::string &name, size_t) const stan::gm::generate_init_visgeninline
generate_check_int(const std::string &name, size_t) const stan::gm::generate_init_visgeninline
generate_declaration(const std::string &name, const std::string &base_type, const std::vector< expression > &dims, const expression &type_arg1=expression(), const expression &type_arg2=expression()) const stan::gm::generate_init_visgeninline
generate_dims_loop_fwd(const std::vector< expression > &dims, int indent=2U) const stan::gm::generate_init_visgeninline
generate_indent_num_dims(size_t base_indent, const std::vector< expression > &dims, const expression &dim1, const expression &dim2) const stan::gm::generate_init_visgeninline
generate_init_visgen(std::ostream &o)stan::gm::generate_init_visgeninline
generate_name_dims(const std::string name, size_t num_dims) const stan::gm::generate_init_visgeninline
generate_write_loop(const std::string &write_method_name, const std::string &var_name, const std::vector< expression > &dims) const stan::gm::generate_init_visgeninline
o_stan::gm::visgen
operator()(nil const &) const stan::gm::generate_init_visgeninline
operator()(int_var_decl const &x) const stan::gm::generate_init_visgeninline
operator()(double_var_decl const &x) const stan::gm::generate_init_visgeninline
operator()(vector_var_decl const &x) const stan::gm::generate_init_visgeninline
operator()(row_vector_var_decl const &x) const stan::gm::generate_init_visgeninline
operator()(matrix_var_decl const &x) const stan::gm::generate_init_visgeninline
operator()(unit_vector_var_decl const &x) const stan::gm::generate_init_visgeninline
operator()(simplex_var_decl const &x) const stan::gm::generate_init_visgeninline
operator()(ordered_var_decl const &x) const stan::gm::generate_init_visgeninline
operator()(positive_ordered_var_decl const &x) const stan::gm::generate_init_visgeninline
operator()(cholesky_factor_var_decl const &x) const stan::gm::generate_init_visgeninline
operator()(cov_matrix_var_decl const &x) const stan::gm::generate_init_visgeninline
operator()(corr_matrix_var_decl const &x) const stan::gm::generate_init_visgeninline
result_type typedefstan::gm::visgen
var_size_validator_stan::gm::generate_init_visgen
visgen(std::ostream &o)stan::gm::visgeninline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1generate__init__visgen.html b/doc/api/html/structstan_1_1gm_1_1generate__init__visgen.html new file mode 100644 index 00000000000..2a738189265 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1generate__init__visgen.html @@ -0,0 +1,965 @@ + + + + + +Stan: stan::gm::generate_init_visgen Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::generate_init_visgen Struct Reference
+
+
+ +

#include <generator.hpp>

+
+Inheritance diagram for stan::gm::generate_init_visgen:
+
+
+ + +stan::gm::visgen + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 generate_init_visgen (std::ostream &o)
 
void operator() (nil const &) const
 
void operator() (int_var_decl const &x) const
 
template<typename D >
std::string function_args (const std::string &fun_prefix, const D &x) const
 
void operator() (double_var_decl const &x) const
 
void operator() (vector_var_decl const &x) const
 
void operator() (row_vector_var_decl const &x) const
 
void operator() (matrix_var_decl const &x) const
 
void operator() (unit_vector_var_decl const &x) const
 
void operator() (simplex_var_decl const &x) const
 
void operator() (ordered_var_decl const &x) const
 
void operator() (positive_ordered_var_decl const &x) const
 
void operator() (cholesky_factor_var_decl const &x) const
 
void operator() (cov_matrix_var_decl const &x) const
 
void operator() (corr_matrix_var_decl const &x) const
 
void generate_write_loop (const std::string &write_method_name, const std::string &var_name, const std::vector< expression > &dims) const
 
void generate_name_dims (const std::string name, size_t num_dims) const
 
void generate_declaration (const std::string &name, const std::string &base_type, const std::vector< expression > &dims, const expression &type_arg1=expression(), const expression &type_arg2=expression()) const
 
void generate_indent_num_dims (size_t base_indent, const std::vector< expression > &dims, const expression &dim1, const expression &dim2) const
 
void generate_buffer_loop (const std::string &base_type, const std::string &name, const std::vector< expression > &dims, const expression &dim1=expression(), const expression &dim2=expression(), int indent=2U) const
 
void generate_dims_loop_fwd (const std::vector< expression > &dims, int indent=2U) const
 
void generate_check_int (const std::string &name, size_t) const
 
void generate_check_double (const std::string &name, size_t) const
 
- Public Member Functions inherited from stan::gm::visgen
 visgen (std::ostream &o)
 
+ + + + + + +

+Public Attributes

var_size_validating_visgen var_size_validator_
 
- Public Attributes inherited from stan::gm::visgen
std::ostream & o_
 
+ + + + +

+Additional Inherited Members

- Public Types inherited from stan::gm::visgen
typedef void result_type
 
+

Detailed Description

+
+

Definition at line 2335 of file generator.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::gm::generate_init_visgen::generate_init_visgen (std::ostream & o)
+
+inline
+
+ +

Definition at line 2337 of file generator.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename D >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
std::string stan::gm::generate_init_visgen::function_args (const std::string & fun_prefix,
const D & x 
) const
+
+inline
+
+ +

Definition at line 2350 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::generate_init_visgen::generate_buffer_loop (const std::string & base_type,
const std::string & name,
const std::vector< expression > & dims,
const expressiondim1 = expression(),
const expressiondim2 = expression(),
int indent = 2U 
) const
+
+inline
+
+ +

Definition at line 2490 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::gm::generate_init_visgen::generate_check_double (const std::string & name,
size_t  
) const
+
+inline
+
+ +

Definition at line 2552 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::gm::generate_init_visgen::generate_check_int (const std::string & name,
size_t  
) const
+
+inline
+
+ +

Definition at line 2544 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::generate_init_visgen::generate_declaration (const std::string & name,
const std::string & base_type,
const std::vector< expression > & dims,
const expressiontype_arg1 = expression(),
const expressiontype_arg2 = expression() 
) const
+
+inline
+
+ +

Definition at line 2471 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::gm::generate_init_visgen::generate_dims_loop_fwd (const std::vector< expression > & dims,
int indent = 2U 
) const
+
+inline
+
+ +

Definition at line 2533 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::generate_init_visgen::generate_indent_num_dims (size_t base_indent,
const std::vector< expression > & dims,
const expressiondim1,
const expressiondim2 
) const
+
+inline
+
+ +

Definition at line 2482 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::gm::generate_init_visgen::generate_name_dims (const std::string name,
size_t num_dims 
) const
+
+inline
+
+ +

Definition at line 2465 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::generate_init_visgen::generate_write_loop (const std::string & write_method_name,
const std::string & var_name,
const std::vector< expression > & dims 
) const
+
+inline
+
+ +

Definition at line 2455 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_init_visgen::operator() (nil const & ) const
+
+inline
+
+ +

Definition at line 2341 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_init_visgen::operator() (int_var_decl const & x) const
+
+inline
+
+ +

Definition at line 2342 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_init_visgen::operator() (double_var_decl const & x) const
+
+inline
+
+ +

Definition at line 2374 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_init_visgen::operator() (vector_var_decl const & x) const
+
+inline
+
+ +

Definition at line 2382 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_init_visgen::operator() (row_vector_var_decl const & x) const
+
+inline
+
+ +

Definition at line 2390 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_init_visgen::operator() (matrix_var_decl const & x) const
+
+inline
+
+ +

Definition at line 2398 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_init_visgen::operator() (unit_vector_var_decl const & x) const
+
+inline
+
+ +

Definition at line 2406 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_init_visgen::operator() (simplex_var_decl const & x) const
+
+inline
+
+ +

Definition at line 2413 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_init_visgen::operator() (ordered_var_decl const & x) const
+
+inline
+
+ +

Definition at line 2420 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_init_visgen::operator() (positive_ordered_var_decl const & x) const
+
+inline
+
+ +

Definition at line 2427 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_init_visgen::operator() (cholesky_factor_var_decl const & x) const
+
+inline
+
+ +

Definition at line 2434 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_init_visgen::operator() (cov_matrix_var_decl const & x) const
+
+inline
+
+ +

Definition at line 2441 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_init_visgen::operator() (corr_matrix_var_decl const & x) const
+
+inline
+
+ +

Definition at line 2448 of file generator.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
var_size_validating_visgen stan::gm::generate_init_visgen::var_size_validator_
+
+ +

Definition at line 2336 of file generator.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1generate__init__visgen.png b/doc/api/html/structstan_1_1gm_1_1generate__init__visgen.png new file mode 100644 index 0000000000000000000000000000000000000000..7451bf7d9dd74f34187df3f6227a620b2143c5ba GIT binary patch literal 714 zcmeAS@N?(olHy`uVBq!ia0vp^TYxx#gBeJ+A6q{KNJ#|vgt-3y{~ySF@#br3|Dg#$ z78oBmaDcV*jy#adQ4-`A%m7pb0#{Fk7%?y~MS8k8hEy=Vo%^v+f2z^@|0k|T z25ew;k6r$K(u9C>r`(Hky6)}wxoq-PP0jO_H*?e^8Y03cFne0XL&WB)h*TA$-W=$Kq7OyGx+~9ZHb+E-Q!Z^ z-+PzYsvdvrUEVb1_WT>lq5Y=qJFQqwZg~{AR!;BRgeBX~G5%R~!JfNTFWbCGdu0ZH zy4AcLDzY!{=yhj?)vsgdso;7tm{bybGwZTJO5tx=J~C59r+836L$CVZa?4i_ays`hI>4rWtm6s-%hsd&Au?3^`-8)DEDdi zoL{hPzO`8De%z6@wtA^m-^0>s!j+Wlne!q-<9XYn^|d-ZwW-~U^r{>yy%R?=V1DD`V+ zP-+_g?%N;z({_n%zRLZfC+g$*+sqH_FE+4!xB$YtzqAWD#s6aGkyhIVvj6}9 literal 0 HcmV?d00001 diff --git a/doc/api/html/structstan_1_1gm_1_1generate__local__var__init__nan__visgen-members.html b/doc/api/html/structstan_1_1gm_1_1generate__local__var__init__nan__visgen-members.html new file mode 100644 index 00000000000..4c84ef2a12c --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1generate__local__var__init__nan__visgen-members.html @@ -0,0 +1,133 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::generate_local_var_init_nan_visgen Member List
+
+
+ +

This is the complete list of members for stan::gm::generate_local_var_init_nan_visgen, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + +
declare_vars_stan::gm::generate_local_var_init_nan_visgen
generate_init(const T &x) const stan::gm::generate_local_var_init_nan_visgeninline
generate_local_var_init_nan_visgen(bool declare_vars, bool is_var, int indent, std::ostream &o)stan::gm::generate_local_var_init_nan_visgeninline
indent_stan::gm::generate_local_var_init_nan_visgen
is_var_stan::gm::generate_local_var_init_nan_visgen
o_stan::gm::visgen
operator()(const nil &) const stan::gm::generate_local_var_init_nan_visgeninline
operator()(const int_var_decl &x) const stan::gm::generate_local_var_init_nan_visgeninline
operator()(const double_var_decl &x) const stan::gm::generate_local_var_init_nan_visgeninline
operator()(const vector_var_decl &x) const stan::gm::generate_local_var_init_nan_visgeninline
operator()(const row_vector_var_decl &x) const stan::gm::generate_local_var_init_nan_visgeninline
operator()(const matrix_var_decl &x) const stan::gm::generate_local_var_init_nan_visgeninline
operator()(const unit_vector_var_decl &x) const stan::gm::generate_local_var_init_nan_visgeninline
operator()(const simplex_var_decl &x) const stan::gm::generate_local_var_init_nan_visgeninline
operator()(const ordered_var_decl &x) const stan::gm::generate_local_var_init_nan_visgeninline
operator()(const positive_ordered_var_decl &x) const stan::gm::generate_local_var_init_nan_visgeninline
operator()(const cholesky_factor_var_decl &x) const stan::gm::generate_local_var_init_nan_visgeninline
operator()(const cov_matrix_var_decl &x) const stan::gm::generate_local_var_init_nan_visgeninline
operator()(const corr_matrix_var_decl &x) const stan::gm::generate_local_var_init_nan_visgeninline
result_type typedefstan::gm::visgen
visgen(std::ostream &o)stan::gm::visgeninline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html b/doc/api/html/structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html new file mode 100644 index 00000000000..74430848795 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1generate__local__var__init__nan__visgen.html @@ -0,0 +1,645 @@ + + + + + +Stan: stan::gm::generate_local_var_init_nan_visgen Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::generate_local_var_init_nan_visgen Struct Reference
+
+
+ +

#include <generator.hpp>

+
+Inheritance diagram for stan::gm::generate_local_var_init_nan_visgen:
+
+
+ + +stan::gm::visgen + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 generate_local_var_init_nan_visgen (bool declare_vars, bool is_var, int indent, std::ostream &o)
 
void operator() (const nil &) const
 
void operator() (const int_var_decl &x) const
 
void operator() (const double_var_decl &x) const
 
void operator() (const vector_var_decl &x) const
 
void operator() (const row_vector_var_decl &x) const
 
void operator() (const matrix_var_decl &x) const
 
void operator() (const unit_vector_var_decl &x) const
 
void operator() (const simplex_var_decl &x) const
 
void operator() (const ordered_var_decl &x) const
 
void operator() (const positive_ordered_var_decl &x) const
 
void operator() (const cholesky_factor_var_decl &x) const
 
void operator() (const cov_matrix_var_decl &x) const
 
void operator() (const corr_matrix_var_decl &x) const
 
template<typename T >
void generate_init (const T &x) const
 
- Public Member Functions inherited from stan::gm::visgen
 visgen (std::ostream &o)
 
+ + + + + + + + + + +

+Public Attributes

const bool declare_vars_
 
const bool is_var_
 
const int indent_
 
- Public Attributes inherited from stan::gm::visgen
std::ostream & o_
 
+ + + + +

+Additional Inherited Members

- Public Types inherited from stan::gm::visgen
typedef void result_type
 
+

Detailed Description

+
+

Definition at line 1122 of file generator.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::gm::generate_local_var_init_nan_visgen::generate_local_var_init_nan_visgen (bool declare_vars,
bool is_var,
int indent,
std::ostream & o 
)
+
+inline
+
+ +

Definition at line 1126 of file generator.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_local_var_init_nan_visgen::generate_init (const T & x) const
+
+inline
+
+ +

Definition at line 1175 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_local_var_init_nan_visgen::operator() (const nil) const
+
+inline
+
+ +

Definition at line 1135 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_local_var_init_nan_visgen::operator() (const int_var_declx) const
+
+inline
+
+ +

Definition at line 1138 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_local_var_init_nan_visgen::operator() (const double_var_declx) const
+
+inline
+
+ +

Definition at line 1141 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_local_var_init_nan_visgen::operator() (const vector_var_declx) const
+
+inline
+
+ +

Definition at line 1144 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_local_var_init_nan_visgen::operator() (const row_vector_var_declx) const
+
+inline
+
+ +

Definition at line 1147 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_local_var_init_nan_visgen::operator() (const matrix_var_declx) const
+
+inline
+
+ +

Definition at line 1150 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_local_var_init_nan_visgen::operator() (const unit_vector_var_declx) const
+
+inline
+
+ +

Definition at line 1153 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_local_var_init_nan_visgen::operator() (const simplex_var_declx) const
+
+inline
+
+ +

Definition at line 1156 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_local_var_init_nan_visgen::operator() (const ordered_var_declx) const
+
+inline
+
+ +

Definition at line 1159 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_local_var_init_nan_visgen::operator() (const positive_ordered_var_declx) const
+
+inline
+
+ +

Definition at line 1162 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_local_var_init_nan_visgen::operator() (const cholesky_factor_var_declx) const
+
+inline
+
+ +

Definition at line 1165 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_local_var_init_nan_visgen::operator() (const cov_matrix_var_declx) const
+
+inline
+
+ +

Definition at line 1168 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::generate_local_var_init_nan_visgen::operator() (const corr_matrix_var_declx) const
+
+inline
+
+ +

Definition at line 1171 of file generator.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
const bool stan::gm::generate_local_var_init_nan_visgen::declare_vars_
+
+ +

Definition at line 1123 of file generator.hpp.

+ +
+
+ +
+
+ + + + +
const int stan::gm::generate_local_var_init_nan_visgen::indent_
+
+ +

Definition at line 1125 of file generator.hpp.

+ +
+
+ +
+
+ + + + +
const bool stan::gm::generate_local_var_init_nan_visgen::is_var_
+
+ +

Definition at line 1124 of file generator.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1generate__local__var__init__nan__visgen.png b/doc/api/html/structstan_1_1gm_1_1generate__local__var__init__nan__visgen.png new file mode 100644 index 0000000000000000000000000000000000000000..7644a7f0d20e5957d96d1ee469b347e5c3cb4195 GIT binary patch literal 846 zcmeAS@N?(olHy`uVBq!ia0y~yVB`U^12~w0{;3|H5Rpozo zJHLRPCQoL}oZ-3eme_5V%votSdFvymrEdImRLS$&_f&~CMbE&tM2SfvUzsF4C&^v$ zKjv}i{g-71Dlfn85_5}kT=IBZ($2qA&b^;kv-)JN{-)e*QdSd|EPoXwQ5pLCmYG@U z>02wWOxqj!*kRJT3s()iW=>K4Y8kM8L*?yMujdYv=B<8xI_3PQVuPZaQ;aNwlz@7l zzk0>H#s43B!WZS!5}v!9*55U@k~k}O=}Oonuiwj0rC9s+<;VGTtCX(Y#p^%0Ur*R` z*6TZm*4g-~PW@JHaIW@gcd=v8)qe)YMbEr1+0NZOY03T9`KMhb-SYtZ1L7s^p43RO z*JX@*8uu~i9A=pH?Q5!38{>t{)I=a9kRk#kfC|YY-m@z&owBB8BEy>KIEl7I1{O&m z;Zka#rzkw#kCfWw-zOK3=!{3dVTM1D%1LUyY7HtZl{vY zR=y2CJ3q>2TO2dn7&d=XzpBM<;d1`PEO*-P@0NDGbNs%}AGw~3VgWa|JKx^8neniR z^_%02?M62@KR1*(+wfL1TGsaWZONWTi_YG-byHKK`9XQQdl&EHcjgz&F3X+j`4E!s zapN0vPvE>Onq^YQG=AK=S@Z69wHteKz>3(nM~!~|oVPLkT5*ERxwh(KdwjO_{!fT3 zd&m;|y8P)oh8zE$-~DwY^U}Oex65tRh6w-w literal 0 HcmV?d00001 diff --git a/doc/api/html/structstan_1_1gm_1_1increment__log__prob__statement-members.html b/doc/api/html/structstan_1_1gm_1_1increment__log__prob__statement-members.html new file mode 100644 index 00000000000..f7428d92e12 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1increment__log__prob__statement-members.html @@ -0,0 +1,115 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::increment_log_prob_statement Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1increment__log__prob__statement.html b/doc/api/html/structstan_1_1gm_1_1increment__log__prob__statement.html new file mode 100644 index 00000000000..897c3a865cc --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1increment__log__prob__statement.html @@ -0,0 +1,186 @@ + + + + + +Stan: stan::gm::increment_log_prob_statement Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::increment_log_prob_statement Struct Reference
+
+
+ +

#include <ast.hpp>

+ + + + + + +

+Public Member Functions

 increment_log_prob_statement ()
 
 increment_log_prob_statement (const expression &log_prob)
 
+ + + +

+Public Attributes

expression log_prob_
 
+

Detailed Description

+
+

Definition at line 608 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::increment_log_prob_statement::increment_log_prob_statement ()
+
+ +

Definition at line 937 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::increment_log_prob_statement::increment_log_prob_statement (const expressionlog_prob)
+
+ +

Definition at line 939 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
expression stan::gm::increment_log_prob_statement::log_prob_
+
+ +

Definition at line 609 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1index__op-members.html b/doc/api/html/structstan_1_1gm_1_1index__op-members.html new file mode 100644 index 00000000000..720f8ddf261 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1index__op-members.html @@ -0,0 +1,118 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::index_op Member List
+
+
+ +

This is the complete list of members for stan::gm::index_op, including all inherited members.

+ + + + + + + +
dimss_stan::gm::index_op
expr_stan::gm::index_op
index_op()stan::gm::index_op
index_op(const expression &expr, const std::vector< std::vector< expression > > &dimss)stan::gm::index_op
infer_type()stan::gm::index_op
type_stan::gm::index_op
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1index__op.html b/doc/api/html/structstan_1_1gm_1_1index__op.html new file mode 100644 index 00000000000..fe46027f297 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1index__op.html @@ -0,0 +1,249 @@ + + + + + +Stan: stan::gm::index_op Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::index_op Struct Reference
+
+
+ +

#include <ast.hpp>

+ + + + + + + + +

+Public Member Functions

 index_op ()
 
 index_op (const expression &expr, const std::vector< std::vector< expression > > &dimss)
 
void infer_type ()
 
+ + + + + + + +

+Public Attributes

expression expr_
 
std::vector< std::vector
+< expression > > 
dimss_
 
expr_type type_
 
+

Detailed Description

+
+

Definition at line 327 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::index_op::index_op ()
+
+ +

Definition at line 614 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
stan::gm::index_op::index_op (const expressionexpr,
const std::vector< std::vector< expression > > & dimss 
)
+
+ +

Definition at line 615 of file ast_def.cpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + + + +
void stan::gm::index_op::infer_type ()
+
+ +

Definition at line 621 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
std::vector<std::vector<expression> > stan::gm::index_op::dimss_
+
+ +

Definition at line 329 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
expression stan::gm::index_op::expr_
+
+ +

Definition at line 328 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
expr_type stan::gm::index_op::type_
+
+ +

Definition at line 330 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1init__local__var__visgen-members.html b/doc/api/html/structstan_1_1gm_1_1init__local__var__visgen-members.html new file mode 100644 index 00000000000..37f61fda68a --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1init__local__var__visgen-members.html @@ -0,0 +1,133 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::init_local_var_visgen Member List
+
+
+ +

This is the complete list of members for stan::gm::init_local_var_visgen, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + +
declare_vars_stan::gm::init_local_var_visgen
generate_initialize_array(const std::string &var_type, const std::string &read_type, const std::vector< expression > &read_args, const std::string &name, const std::vector< expression > &dims) const stan::gm::init_local_var_visgeninline
generate_initialize_array_bounded(const D &x, const std::string &base_type, const std::string &read_fun_prefix, const std::vector< expression > &dim_args) const stan::gm::init_local_var_visgeninline
init_local_var_visgen(bool declare_vars, bool is_var, std::ostream &o)stan::gm::init_local_var_visgeninline
is_var_stan::gm::init_local_var_visgen
o_stan::gm::visgen
operator()(const nil &) const stan::gm::init_local_var_visgeninline
operator()(const int_var_decl &x) const stan::gm::init_local_var_visgeninline
operator()(const double_var_decl &x) const stan::gm::init_local_var_visgeninline
operator()(const vector_var_decl &x) const stan::gm::init_local_var_visgeninline
operator()(const row_vector_var_decl &x) const stan::gm::init_local_var_visgeninline
operator()(const matrix_var_decl &x) const stan::gm::init_local_var_visgeninline
operator()(const unit_vector_var_decl &x) const stan::gm::init_local_var_visgeninline
operator()(const simplex_var_decl &x) const stan::gm::init_local_var_visgeninline
operator()(const ordered_var_decl &x) const stan::gm::init_local_var_visgeninline
operator()(const positive_ordered_var_decl &x) const stan::gm::init_local_var_visgeninline
operator()(const cholesky_factor_var_decl &x) const stan::gm::init_local_var_visgeninline
operator()(const cov_matrix_var_decl &x) const stan::gm::init_local_var_visgeninline
operator()(const corr_matrix_var_decl &x) const stan::gm::init_local_var_visgeninline
result_type typedefstan::gm::visgen
visgen(std::ostream &o)stan::gm::visgeninline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1init__local__var__visgen.html b/doc/api/html/structstan_1_1gm_1_1init__local__var__visgen.html new file mode 100644 index 00000000000..7320e9cb5fa --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1init__local__var__visgen.html @@ -0,0 +1,701 @@ + + + + + +Stan: stan::gm::init_local_var_visgen Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::init_local_var_visgen Struct Reference
+
+
+ +

#include <generator.hpp>

+
+Inheritance diagram for stan::gm::init_local_var_visgen:
+
+
+ + +stan::gm::visgen + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 init_local_var_visgen (bool declare_vars, bool is_var, std::ostream &o)
 
template<typename D >
void generate_initialize_array_bounded (const D &x, const std::string &base_type, const std::string &read_fun_prefix, const std::vector< expression > &dim_args) const
 
void operator() (const nil &) const
 
void operator() (const int_var_decl &x) const
 
void operator() (const double_var_decl &x) const
 
void operator() (const vector_var_decl &x) const
 
void operator() (const row_vector_var_decl &x) const
 
void operator() (const matrix_var_decl &x) const
 
void operator() (const unit_vector_var_decl &x) const
 
void operator() (const simplex_var_decl &x) const
 
void operator() (const ordered_var_decl &x) const
 
void operator() (const positive_ordered_var_decl &x) const
 
void operator() (const cholesky_factor_var_decl &x) const
 
void operator() (const cov_matrix_var_decl &x) const
 
void operator() (const corr_matrix_var_decl &x) const
 
void generate_initialize_array (const std::string &var_type, const std::string &read_type, const std::vector< expression > &read_args, const std::string &name, const std::vector< expression > &dims) const
 
- Public Member Functions inherited from stan::gm::visgen
 visgen (std::ostream &o)
 
+ + + + + + + + +

+Public Attributes

const bool declare_vars_
 
const bool is_var_
 
- Public Attributes inherited from stan::gm::visgen
std::ostream & o_
 
+ + + + +

+Additional Inherited Members

- Public Types inherited from stan::gm::visgen
typedef void result_type
 
+

Detailed Description

+
+

Definition at line 501 of file generator.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
stan::gm::init_local_var_visgen::init_local_var_visgen (bool declare_vars,
bool is_var,
std::ostream & o 
)
+
+inline
+
+ +

Definition at line 504 of file generator.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::init_local_var_visgen::generate_initialize_array (const std::string & var_type,
const std::string & read_type,
const std::vector< expression > & read_args,
const std::string & name,
const std::vector< expression > & dims 
) const
+
+inline
+
+ +

Definition at line 595 of file generator.hpp.

+ +
+
+ +
+
+
+template<typename D >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::init_local_var_visgen::generate_initialize_array_bounded (const D & x,
const std::string & base_type,
const std::string & read_fun_prefix,
const std::vector< expression > & dim_args 
) const
+
+inline
+
+ +

Definition at line 512 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::init_local_var_visgen::operator() (const nil) const
+
+inline
+
+ +

Definition at line 532 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::init_local_var_visgen::operator() (const int_var_declx) const
+
+inline
+
+ +

Definition at line 533 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::init_local_var_visgen::operator() (const double_var_declx) const
+
+inline
+
+ +

Definition at line 536 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::init_local_var_visgen::operator() (const vector_var_declx) const
+
+inline
+
+ +

Definition at line 540 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::init_local_var_visgen::operator() (const row_vector_var_declx) const
+
+inline
+
+ +

Definition at line 545 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::init_local_var_visgen::operator() (const matrix_var_declx) const
+
+inline
+
+ +

Definition at line 550 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::init_local_var_visgen::operator() (const unit_vector_var_declx) const
+
+inline
+
+ +

Definition at line 556 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::init_local_var_visgen::operator() (const simplex_var_declx) const
+
+inline
+
+ +

Definition at line 561 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::init_local_var_visgen::operator() (const ordered_var_declx) const
+
+inline
+
+ +

Definition at line 566 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::init_local_var_visgen::operator() (const positive_ordered_var_declx) const
+
+inline
+
+ +

Definition at line 571 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::init_local_var_visgen::operator() (const cholesky_factor_var_declx) const
+
+inline
+
+ +

Definition at line 576 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::init_local_var_visgen::operator() (const cov_matrix_var_declx) const
+
+inline
+
+ +

Definition at line 583 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::init_local_var_visgen::operator() (const corr_matrix_var_declx) const
+
+inline
+
+ +

Definition at line 589 of file generator.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
const bool stan::gm::init_local_var_visgen::declare_vars_
+
+ +

Definition at line 502 of file generator.hpp.

+ +
+
+ +
+
+ + + + +
const bool stan::gm::init_local_var_visgen::is_var_
+
+ +

Definition at line 503 of file generator.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1init__local__var__visgen.png b/doc/api/html/structstan_1_1gm_1_1init__local__var__visgen.png new file mode 100644 index 0000000000000000000000000000000000000000..aefe9ad1766b46c49c006c305a8be5f2dda0539e GIT binary patch literal 711 zcmeAS@N?(olHy`uVBq!ia0vp^+krTMgBeKXd=!}uq$C1-LR|m<{|{uoc=NTi|Ih>= z3ycpOIKbL@M;^%KC<*clW&kPzfvcxNj2IZ0!aQ9ZLn;{G&V4;;wSoZK?DMPk{8wJj zsU@!1z9a2hfNAI!&xDpVnUnF;QX|z`Tqi9%yjS%k-}h-M*6XU+J%3Hm{_YXP?Vazr ztDE~?VkzJ8)Vl{?EA!g9KT^H_~YCr z`kvsqORl~?^UTOKf9n4%pt6TabKmq=p0U2>yK1uX#pj$VnJwP$Q~!Rk|FG`8&v&2} z^DE^~W3N;P#yEPtUH>Y@+P}|d*=Hq>(9?QnKOb4;r?T?=jKli>8S=i#oxZ!2$NSW+ zyFdH-<0joR6jSxI-4~!f=}YOI=t*x1@;x^te~p`#I+MR4|0BbU37&i9`z?>Ee~sI^ zTx9;$+vkNDyzfXK;QP+D;qYEYpmGLleB6dE0jC)POb1GKm^aA2<4tgX`uCz*(1%}Z ze=rt2YTo%@_Lp?N!q(`$jQ1w*xvu=Na$5fM=MLKfZ1lH#PkgHU<3)Yxk@-j6cW$=P z;>}eqG|;UnvwGKg@we@5vrl3-%_n@H_gW=>-w%u1vTavA_PYGr`pM7oq*|`ub%8gP z-|sc#+%#GB=tvPe!wt`4ub-^FxAskXknH<^F7IFO z{*)K;X+rtttZgOcd-^A))qZ~s3dP*z)2$sgr(WJ~?SG27-1~)LZnpc{&r2fJ8EXH% zso%Qu!;J4QGnuaJiJSN50=vcw_b+a{xcQ&`-phYr`U_o~ICX~q{6K%VS2N$(Sk*3Y csOAsDYzcL<00F1{z*NWJ>FVdQ&MBb@05 + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::int_literal Member List
+
+
+ +

This is the complete list of members for stan::gm::int_literal, including all inherited members.

+ + + + + + + +
int_literal()stan::gm::int_literal
int_literal(int val)stan::gm::int_literal
int_literal(const int_literal &il)stan::gm::int_literal
operator=(const int_literal &il)stan::gm::int_literal
type_stan::gm::int_literal
val_stan::gm::int_literal
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1int__literal.html b/doc/api/html/structstan_1_1gm_1_1int__literal.html new file mode 100644 index 00000000000..6c260ed171e --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1int__literal.html @@ -0,0 +1,243 @@ + + + + + +Stan: stan::gm::int_literal Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::int_literal Struct Reference
+
+
+ +

#include <ast.hpp>

+ + + + + + + + + + +

+Public Member Functions

 int_literal ()
 
 int_literal (int val)
 
 int_literal (const int_literal &il)
 
int_literaloperator= (const int_literal &il)
 
+ + + + + +

+Public Attributes

int val_
 
expr_type type_
 
+

Detailed Description

+
+

Definition at line 272 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::int_literal::int_literal ()
+
+ +

Definition at line 513 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::int_literal::int_literal (int val)
+
+ +

Definition at line 516 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::int_literal::int_literal (const int_literalil)
+
+ +

Definition at line 520 of file ast_def.cpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + + + + +
int_literal & stan::gm::int_literal::operator= (const int_literalil)
+
+ +

Definition at line 524 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
expr_type stan::gm::int_literal::type_
+
+ +

Definition at line 274 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
int stan::gm::int_literal::val_
+
+ +

Definition at line 273 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1int__var__decl-members.html b/doc/api/html/structstan_1_1gm_1_1int__var__decl-members.html new file mode 100644 index 00000000000..3f34e16e158 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1int__var__decl-members.html @@ -0,0 +1,121 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::int_var_decl Member List
+
+
+ +

This is the complete list of members for stan::gm::int_var_decl, including all inherited members.

+ + + + + + + + + + +
base_type_stan::gm::base_var_decl
base_var_decl()stan::gm::base_var_decl
base_var_decl(const base_expr_type &base_type)stan::gm::base_var_decl
base_var_decl(const std::string &name, const std::vector< expression > &dims, const base_expr_type &base_type)stan::gm::base_var_decl
dims_stan::gm::base_var_decl
int_var_decl()stan::gm::int_var_decl
int_var_decl(range const &range, std::string const &name, std::vector< expression > const &dims)stan::gm::int_var_decl
name_stan::gm::base_var_decl
range_stan::gm::int_var_decl
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1int__var__decl.html b/doc/api/html/structstan_1_1gm_1_1int__var__decl.html new file mode 100644 index 00000000000..d24b86f63e0 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1int__var__decl.html @@ -0,0 +1,225 @@ + + + + + +Stan: stan::gm::int_var_decl Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::int_var_decl Struct Reference
+
+
+ +

#include <ast.hpp>

+
+Inheritance diagram for stan::gm::int_var_decl:
+
+
+ + +stan::gm::base_var_decl + +
+ + + + + + + + + + + + + +

+Public Member Functions

 int_var_decl ()
 
 int_var_decl (range const &range, std::string const &name, std::vector< expression > const &dims)
 
- Public Member Functions inherited from stan::gm::base_var_decl
 base_var_decl ()
 
 base_var_decl (const base_expr_type &base_type)
 
 base_var_decl (const std::string &name, const std::vector< expression > &dims, const base_expr_type &base_type)
 
+ + + + + + + + + + +

+Public Attributes

range range_
 
- Public Attributes inherited from stan::gm::base_var_decl
std::string name_
 
std::vector< expressiondims_
 
base_expr_type base_type_
 
+

Detailed Description

+
+

Definition at line 406 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::int_var_decl::int_var_decl ()
+
+ +

Definition at line 718 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
stan::gm::int_var_decl::int_var_decl (range const & range,
std::string const & name,
std::vector< expression > const & dims 
)
+
+ +

Definition at line 722 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
range stan::gm::int_var_decl::range_
+
+ +

Definition at line 407 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1int__var__decl.png b/doc/api/html/structstan_1_1gm_1_1int__var__decl.png new file mode 100644 index 0000000000000000000000000000000000000000..4f1bdd301c3afdf841976f5789164baf1d88280e GIT binary patch literal 670 zcmeAS@N?(olHy`uVBq!ia0vp^lYuyZgBeI_xo@`xQW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;#(N**O6l%!o`ReL~jVhtLek||Y zIrC7l+MNF9zy7J~?+bgR+}@#fabe9#&$6YauVv!>?jOElbTmivxt|)V^&-9#PFNuY2V4Ur9z17U8_f)Qh=oCttmazV>O`e63}R_Mcg~+U;UjEhEBD#a_rw>MS$tV;%SzudRBf5T0Q5OSd^hKT>q$%>w&Ld2 zpA&K7nB2)=FjY*rVf|5-2dmGT9GTf$eOIsS=@IrB$L_k#oVWe(>r-C+*LN9qgu7SG zXt=0VHOI5;sOD_dSo`B%r;3h?Y+gF2T8^X4MYf=9+r6VQN9w}2ZHsKMk@A^&+hwiM zO^dY`j;&qgEW9lFecz*hb6$2xH*c9y^kbf!{`YsfYOAy7o{Hl85_~k|%XQvht>DR- zTjpQ7w=}qzopr0MJW4rT_o{ literal 0 HcmV?d00001 diff --git a/doc/api/html/structstan_1_1gm_1_1is__nil__op-members.html b/doc/api/html/structstan_1_1gm_1_1is__nil__op-members.html new file mode 100644 index 00000000000..9e751fade95 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1is__nil__op-members.html @@ -0,0 +1,121 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::is_nil_op Member List
+
+
+ +

This is the complete list of members for stan::gm::is_nil_op, including all inherited members.

+ + + + + + + + + + +
operator()(const nil &x) const stan::gm::is_nil_op
operator()(const int_literal &x) const stan::gm::is_nil_op
operator()(const double_literal &x) const stan::gm::is_nil_op
operator()(const array_literal &x) const stan::gm::is_nil_op
operator()(const variable &x) const stan::gm::is_nil_op
operator()(const fun &x) const stan::gm::is_nil_op
operator()(const index_op &x) const stan::gm::is_nil_op
operator()(const binary_op &x) const stan::gm::is_nil_op
operator()(const unary_op &x) const stan::gm::is_nil_op
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1is__nil__op.html b/doc/api/html/structstan_1_1gm_1_1is__nil__op.html new file mode 100644 index 00000000000..cf8a7f8180c --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1is__nil__op.html @@ -0,0 +1,314 @@ + + + + + +Stan: stan::gm::is_nil_op Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::is_nil_op Struct Reference
+
+
+ +

#include <ast.hpp>

+
+Inheritance diagram for stan::gm::is_nil_op:
+
+
+ + + +
+ + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

bool operator() (const nil &x) const
 
bool operator() (const int_literal &x) const
 
bool operator() (const double_literal &x) const
 
bool operator() (const array_literal &x) const
 
bool operator() (const variable &x) const
 
bool operator() (const fun &x) const
 
bool operator() (const index_op &x) const
 
bool operator() (const binary_op &x) const
 
bool operator() (const unary_op &x) const
 
+

Detailed Description

+
+

Definition at line 246 of file ast.hpp.

+

Member Function Documentation

+ +
+
+ + + + + + + + +
bool stan::gm::is_nil_op::operator() (const nilx) const
+
+ +

Definition at line 487 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
bool stan::gm::is_nil_op::operator() (const int_literalx) const
+
+ +

Definition at line 488 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
bool stan::gm::is_nil_op::operator() (const double_literalx) const
+
+ +

Definition at line 489 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
bool stan::gm::is_nil_op::operator() (const array_literalx) const
+
+ +

Definition at line 490 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
bool stan::gm::is_nil_op::operator() (const variablex) const
+
+ +

Definition at line 491 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
bool stan::gm::is_nil_op::operator() (const funx) const
+
+ +

Definition at line 492 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
bool stan::gm::is_nil_op::operator() (const index_opx) const
+
+ +

Definition at line 493 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
bool stan::gm::is_nil_op::operator() (const binary_opx) const
+
+ +

Definition at line 494 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
bool stan::gm::is_nil_op::operator() (const unary_opx) const
+
+ +

Definition at line 495 of file ast_def.cpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1is__nil__op.png b/doc/api/html/structstan_1_1gm_1_1is__nil__op.png new file mode 100644 index 0000000000000000000000000000000000000000..8263c358f91506dd214b695992e2933b54d7b62e GIT binary patch literal 639 zcmeAS@N?(olHy`uVBq!ia0vp^%YZn5gBeIJnfuQXNJ#|vgt-3y{~ySF@#br3|Dg#$ z78oBmaDcV*jy#adQ4-`A%m7pb0#{Fk7%?y~@p-y9hEy=VoqM~e*?`BTKW^9m|HoTr zJn+t$Zl=T>e71s9;-rm{ymVD`#-t}p4@^+3?*0a#Mn0Ib@zyBOb z6WMC~Q*W8dUzK>D>N~pWAzwG&59|M(S{o{{L?W6^{_^Wxl@p%?M3pb{GrW8&RpjI` z=VdmtcxHdGGWz+?xGyT&)K%VM%5NR}Fpj-B@2;t)N!Q72{WnMR+2*{dx5J(@J`1~k zY3DJW@)Q0uEdLgt3Ey6KarcZ#qK7qSU*3Cj<>!QayFiuI?wQ}u-IFQ(RkgCJJpWVN z^7Jz?Up8G<6@7etuAb-hsnXAGh4@CPp7i{$J9|>eJf`4DdqhCKVZD6j%_pW0*TfHe zE#*J6etmSoJ?7$tdzhd58Z5rd_(x<0LmZb6gFdTT!*nL$1Ky3C50)Na`4E)ARH13W z2s8pA{m*b2D3};yVxfvIC7y||J$s;H=D*~ia|c;oymmSB^h%Wf^|zaLiP*jLxUHw^ zlR9PItDJ9P%r9Otq(#+me{5jYcE2=PT)F>~^X;8krVX8aiO;f9Z&^j0z0kI9P295@ zgYQkY|HAu|%v}F7q(y&8o>9BxvqAi~wC0;PE0ULd{`M^F%i7D6oe$o9JxAH~`@52c zmG`0^&iK50#^<$Lzr}dnDtKo+Bl;!7zh(T1Omo&leUfP#d-lw_b@>}7#{Y7C{PZ6% PwJ>qa;1 literal 0 HcmV?d00001 diff --git a/doc/api/html/structstan_1_1gm_1_1left__division__expr-members.html b/doc/api/html/structstan_1_1gm_1_1left__division__expr-members.html new file mode 100644 index 00000000000..93c77f2315c --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1left__division__expr-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::left_division_expr Member List
+
+
+ +

This is the complete list of members for stan::gm::left_division_expr, including all inherited members.

+ + +
operator()(expression &expr1, const expression &expr2, std::ostream &error_msgs) const stan::gm::left_division_exprinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1left__division__expr.html b/doc/api/html/structstan_1_1gm_1_1left__division__expr.html new file mode 100644 index 00000000000..7a5a0302ce9 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1left__division__expr.html @@ -0,0 +1,175 @@ + + + + + +Stan: stan::gm::left_division_expr Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::left_division_expr Struct Reference
+
+
+ +

#include <term_grammar_def.hpp>

+ + + + +

+Classes

struct  result
 
+ + + +

+Public Member Functions

expression operator() (expression &expr1, const expression &expr2, std::ostream &error_msgs) const
 
+

Detailed Description

+
+

Definition at line 202 of file term_grammar_def.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
expression stan::gm::left_division_expr::operator() (expressionexpr1,
const expressionexpr2,
std::ostream & error_msgs 
) const
+
+inline
+
+ +

Definition at line 206 of file term_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1left__division__expr_1_1result-members.html b/doc/api/html/structstan_1_1gm_1_1left__division__expr_1_1result-members.html new file mode 100644 index 00000000000..0b53ca2148e --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1left__division__expr_1_1result-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::left_division_expr::result< T1, T2, T3 > Member List
+
+
+ +

This is the complete list of members for stan::gm::left_division_expr::result< T1, T2, T3 >, including all inherited members.

+ + +
type typedefstan::gm::left_division_expr::result< T1, T2, T3 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1left__division__expr_1_1result.html b/doc/api/html/structstan_1_1gm_1_1left__division__expr_1_1result.html new file mode 100644 index 00000000000..0c4eda4a2a7 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1left__division__expr_1_1result.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::gm::left_division_expr::result< T1, T2, T3 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::left_division_expr::result< T1, T2, T3 > Struct Template Reference
+
+
+ +

#include <term_grammar_def.hpp>

+ + + + +

+Public Types

typedef expression type
 
+

Detailed Description

+

template<typename T1, typename T2, typename T3>
+struct stan::gm::left_division_expr::result< T1, T2, T3 >

+ + +

Definition at line 204 of file term_grammar_def.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 , typename T3 >
+ + + + +
typedef expression stan::gm::left_division_expr::result< T1, T2, T3 >::type
+
+ +

Definition at line 204 of file term_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1local__var__decl__visgen-members.html b/doc/api/html/structstan_1_1gm_1_1local__var__decl__visgen-members.html new file mode 100644 index 00000000000..784c0e63c2f --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1local__var__decl__visgen-members.html @@ -0,0 +1,135 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::local_var_decl_visgen Member List
+
+
+ +

This is the complete list of members for stan::gm::local_var_decl_visgen, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + +
declare_array(const std::string &type, const std::vector< expression > &ctor_args, const std::string &name, const std::vector< expression > &dims) const stan::gm::local_var_decl_visgeninline
generate_init_args(const std::string &type, const std::vector< expression > &ctor_args, const std::vector< expression > &dims, size_t dim) const stan::gm::local_var_decl_visgeninline
generate_type(const std::string &type, size_t num_dims) const stan::gm::local_var_decl_visgeninline
generate_void_statement(const std::string &name) const stan::gm::local_var_decl_visgeninline
indents_stan::gm::local_var_decl_visgen
is_var_stan::gm::local_var_decl_visgen
local_var_decl_visgen(int indents, bool is_var, std::ostream &o)stan::gm::local_var_decl_visgeninline
o_stan::gm::visgen
operator()(nil const &) const stan::gm::local_var_decl_visgeninline
operator()(int_var_decl const &x) const stan::gm::local_var_decl_visgeninline
operator()(double_var_decl const &x) const stan::gm::local_var_decl_visgeninline
operator()(vector_var_decl const &x) const stan::gm::local_var_decl_visgeninline
operator()(row_vector_var_decl const &x) const stan::gm::local_var_decl_visgeninline
operator()(matrix_var_decl const &x) const stan::gm::local_var_decl_visgeninline
operator()(unit_vector_var_decl const &x) const stan::gm::local_var_decl_visgeninline
operator()(simplex_var_decl const &x) const stan::gm::local_var_decl_visgeninline
operator()(ordered_var_decl const &x) const stan::gm::local_var_decl_visgeninline
operator()(positive_ordered_var_decl const &x) const stan::gm::local_var_decl_visgeninline
operator()(cholesky_factor_var_decl const &x) const stan::gm::local_var_decl_visgeninline
operator()(cov_matrix_var_decl const &x) const stan::gm::local_var_decl_visgeninline
operator()(corr_matrix_var_decl const &x) const stan::gm::local_var_decl_visgeninline
result_type typedefstan::gm::visgen
visgen(std::ostream &o)stan::gm::visgeninline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1local__var__decl__visgen.html b/doc/api/html/structstan_1_1gm_1_1local__var__decl__visgen.html new file mode 100644 index 00000000000..ab0cab07350 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1local__var__decl__visgen.html @@ -0,0 +1,758 @@ + + + + + +Stan: stan::gm::local_var_decl_visgen Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::local_var_decl_visgen Struct Reference
+
+
+ +

#include <generator.hpp>

+
+Inheritance diagram for stan::gm::local_var_decl_visgen:
+
+
+ + +stan::gm::visgen + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 local_var_decl_visgen (int indents, bool is_var, std::ostream &o)
 
void operator() (nil const &) const
 
void operator() (int_var_decl const &x) const
 
void operator() (double_var_decl const &x) const
 
void operator() (vector_var_decl const &x) const
 
void operator() (row_vector_var_decl const &x) const
 
void operator() (matrix_var_decl const &x) const
 
void operator() (unit_vector_var_decl const &x) const
 
void operator() (simplex_var_decl const &x) const
 
void operator() (ordered_var_decl const &x) const
 
void operator() (positive_ordered_var_decl const &x) const
 
void operator() (cholesky_factor_var_decl const &x) const
 
void operator() (cov_matrix_var_decl const &x) const
 
void operator() (corr_matrix_var_decl const &x) const
 
void generate_type (const std::string &type, size_t num_dims) const
 
void generate_void_statement (const std::string &name) const
 
void generate_init_args (const std::string &type, const std::vector< expression > &ctor_args, const std::vector< expression > &dims, size_t dim) const
 
void declare_array (const std::string &type, const std::vector< expression > &ctor_args, const std::string &name, const std::vector< expression > &dims) const
 
- Public Member Functions inherited from stan::gm::visgen
 visgen (std::ostream &o)
 
+ + + + + + + + +

+Public Attributes

int indents_
 
bool is_var_
 
- Public Attributes inherited from stan::gm::visgen
std::ostream & o_
 
+ + + + +

+Additional Inherited Members

- Public Types inherited from stan::gm::visgen
typedef void result_type
 
+

Detailed Description

+
+

Definition at line 936 of file generator.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
stan::gm::local_var_decl_visgen::local_var_decl_visgen (int indents,
bool is_var,
std::ostream & o 
)
+
+inline
+
+ +

Definition at line 939 of file generator.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::local_var_decl_visgen::declare_array (const std::string & type,
const std::vector< expression > & ctor_args,
const std::string & name,
const std::vector< expression > & dims 
) const
+
+inline
+
+ +

Definition at line 1085 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::local_var_decl_visgen::generate_init_args (const std::string & type,
const std::vector< expression > & ctor_args,
const std::vector< expression > & dims,
size_t dim 
) const
+
+inline
+
+ +

Definition at line 1038 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::gm::local_var_decl_visgen::generate_type (const std::string & type,
size_t num_dims 
) const
+
+inline
+
+ +

Definition at line 1020 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::local_var_decl_visgen::generate_void_statement (const std::string & name) const
+
+inline
+
+ +

Definition at line 1031 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::local_var_decl_visgen::operator() (nil const & ) const
+
+inline
+
+ +

Definition at line 946 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::local_var_decl_visgen::operator() (int_var_decl const & x) const
+
+inline
+
+ +

Definition at line 947 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::local_var_decl_visgen::operator() (double_var_decl const & x) const
+
+inline
+
+ +

Definition at line 951 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::local_var_decl_visgen::operator() (vector_var_decl const & x) const
+
+inline
+
+ +

Definition at line 956 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::local_var_decl_visgen::operator() (row_vector_var_decl const & x) const
+
+inline
+
+ +

Definition at line 962 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::local_var_decl_visgen::operator() (matrix_var_decl const & x) const
+
+inline
+
+ +

Definition at line 968 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::local_var_decl_visgen::operator() (unit_vector_var_decl const & x) const
+
+inline
+
+ +

Definition at line 975 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::local_var_decl_visgen::operator() (simplex_var_decl const & x) const
+
+inline
+
+ +

Definition at line 981 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::local_var_decl_visgen::operator() (ordered_var_decl const & x) const
+
+inline
+
+ +

Definition at line 987 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::local_var_decl_visgen::operator() (positive_ordered_var_decl const & x) const
+
+inline
+
+ +

Definition at line 993 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::local_var_decl_visgen::operator() (cholesky_factor_var_decl const & x) const
+
+inline
+
+ +

Definition at line 999 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::local_var_decl_visgen::operator() (cov_matrix_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1006 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::local_var_decl_visgen::operator() (corr_matrix_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1013 of file generator.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
int stan::gm::local_var_decl_visgen::indents_
+
+ +

Definition at line 937 of file generator.hpp.

+ +
+
+ +
+
+ + + + +
bool stan::gm::local_var_decl_visgen::is_var_
+
+ +

Definition at line 938 of file generator.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1local__var__decl__visgen.png b/doc/api/html/structstan_1_1gm_1_1local__var__decl__visgen.png new file mode 100644 index 0000000000000000000000000000000000000000..2fe8cdf8c8bc8c0909cab667c0cde87602121b9b GIT binary patch literal 711 zcmeAS@N?(olHy`uVBq!ia0vp^`++!sgBeKHtA!*3DTx4|5ZC|z{{xvX-h3_XKQsZz z0^6|{Y!Q;}F9s5;oKKwT+<#_&|W|i0{e)67Hk8b~) z^u;glSNm1lH`_~9?d?~7yeX9bGif`!p_yAL`-CNq?|!;ZoPKWGoIhQA#3s343p~m& zsigPzzm;{9T<5-wSyd7B*4?y0rT0_!ugcv2GwRnY53#R)bemBnbIR@a`LUwne_qd9 z*{>4&*!OGvPx1H8fhCS!(@X#6JU>70X30L5mAf`YfB*Bd?61cq!(_eu9}P7J>UE}X zH`deKZ8!0MgwUjtV-ZtS=6+oGYvPji4}flO|Lr|VcJ+Utm-aB!OkzK9#OK}riZgo~ zPW}!5yHea>_x}0z4AXYlH^{!@PiX(meB;v zamaXk?Fos$uQuzd?^jyi8glTg|LTpa-(2P`)nPp~Z)*K12eb6@9adWRSH}H2ZGU^J zDBszZyB}`ZtEJywy!+qE?45f*R-WJg;$q1i^R>MBe}1bLp4`7(`sN$uu-_hR}KEDsUJni4Q|B-)}_uc(vzi$59KR2h(=WAqmd)2c3lyK$g2lwhf{5dIp z&$@osSLTAApXIx>4W7lTvp?vW|6S*Q9nY3IX7XG-&;F-)HJmS2F^IEgsOSIAzTq&? i^AUfYITGXkF)sX|@$CHWsV{)3j=|H_&t;ucLK6T&RB&DZ literal 0 HcmV?d00001 diff --git a/doc/api/html/structstan_1_1gm_1_1logical__negate__expr-members.html b/doc/api/html/structstan_1_1gm_1_1logical__negate__expr-members.html new file mode 100644 index 00000000000..6042d4fde8f --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1logical__negate__expr-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::logical_negate_expr Member List
+
+
+ +

This is the complete list of members for stan::gm::logical_negate_expr, including all inherited members.

+ + +
operator()(const expression &expr, std::ostream &error_msgs) const stan::gm::logical_negate_exprinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1logical__negate__expr.html b/doc/api/html/structstan_1_1gm_1_1logical__negate__expr.html new file mode 100644 index 00000000000..63964271fa3 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1logical__negate__expr.html @@ -0,0 +1,169 @@ + + + + + +Stan: stan::gm::logical_negate_expr Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::logical_negate_expr Struct Reference
+
+
+ +

#include <term_grammar_def.hpp>

+ + + + +

+Classes

struct  result
 
+ + + +

+Public Member Functions

expression operator() (const expression &expr, std::ostream &error_msgs) const
 
+

Detailed Description

+
+

Definition at line 304 of file term_grammar_def.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
expression stan::gm::logical_negate_expr::operator() (const expressionexpr,
std::ostream & error_msgs 
) const
+
+inline
+
+ +

Definition at line 308 of file term_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1logical__negate__expr_1_1result-members.html b/doc/api/html/structstan_1_1gm_1_1logical__negate__expr_1_1result-members.html new file mode 100644 index 00000000000..cb6ac60ebf6 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1logical__negate__expr_1_1result-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::logical_negate_expr::result< T1, T2 > Member List
+
+
+ +

This is the complete list of members for stan::gm::logical_negate_expr::result< T1, T2 >, including all inherited members.

+ + +
type typedefstan::gm::logical_negate_expr::result< T1, T2 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1logical__negate__expr_1_1result.html b/doc/api/html/structstan_1_1gm_1_1logical__negate__expr_1_1result.html new file mode 100644 index 00000000000..636c5716a20 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1logical__negate__expr_1_1result.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::gm::logical_negate_expr::result< T1, T2 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::logical_negate_expr::result< T1, T2 > Struct Template Reference
+
+
+ +

#include <term_grammar_def.hpp>

+ + + + +

+Public Types

typedef expression type
 
+

Detailed Description

+

template<typename T1, typename T2>
+struct stan::gm::logical_negate_expr::result< T1, T2 >

+ + +

Definition at line 306 of file term_grammar_def.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 >
+ + + + +
typedef expression stan::gm::logical_negate_expr::result< T1, T2 >::type
+
+ +

Definition at line 306 of file term_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1matrix__var__decl-members.html b/doc/api/html/structstan_1_1gm_1_1matrix__var__decl-members.html new file mode 100644 index 00000000000..42491935db2 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1matrix__var__decl-members.html @@ -0,0 +1,123 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::matrix_var_decl Member List
+
+
+ +

This is the complete list of members for stan::gm::matrix_var_decl, including all inherited members.

+ + + + + + + + + + + + +
base_type_stan::gm::base_var_decl
base_var_decl()stan::gm::base_var_decl
base_var_decl(const base_expr_type &base_type)stan::gm::base_var_decl
base_var_decl(const std::string &name, const std::vector< expression > &dims, const base_expr_type &base_type)stan::gm::base_var_decl
dims_stan::gm::base_var_decl
M_stan::gm::matrix_var_decl
matrix_var_decl()stan::gm::matrix_var_decl
matrix_var_decl(range const &range, expression const &M, expression const &N, std::string const &name, std::vector< expression > const &dims)stan::gm::matrix_var_decl
N_stan::gm::matrix_var_decl
name_stan::gm::base_var_decl
range_stan::gm::matrix_var_decl
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1matrix__var__decl.html b/doc/api/html/structstan_1_1gm_1_1matrix__var__decl.html new file mode 100644 index 00000000000..aa26f4d732c --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1matrix__var__decl.html @@ -0,0 +1,269 @@ + + + + + +Stan: stan::gm::matrix_var_decl Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::matrix_var_decl Struct Reference
+
+
+ +

#include <ast.hpp>

+
+Inheritance diagram for stan::gm::matrix_var_decl:
+
+
+ + +stan::gm::base_var_decl + +
+ + + + + + + + + + + + + +

+Public Member Functions

 matrix_var_decl ()
 
 matrix_var_decl (range const &range, expression const &M, expression const &N, std::string const &name, std::vector< expression > const &dims)
 
- Public Member Functions inherited from stan::gm::base_var_decl
 base_var_decl ()
 
 base_var_decl (const base_expr_type &base_type)
 
 base_var_decl (const std::string &name, const std::vector< expression > &dims, const base_expr_type &base_type)
 
+ + + + + + + + + + + + + + +

+Public Attributes

range range_
 
expression M_
 
expression N_
 
- Public Attributes inherited from stan::gm::base_var_decl
std::string name_
 
std::vector< expressiondims_
 
base_expr_type base_type_
 
+

Detailed Description

+
+

Definition at line 475 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::matrix_var_decl::matrix_var_decl ()
+
+ +

Definition at line 807 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::gm::matrix_var_decl::matrix_var_decl (range const & range,
expression const & M,
expression const & N,
std::string const & name,
std::vector< expression > const & dims 
)
+
+ +

Definition at line 808 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
expression stan::gm::matrix_var_decl::M_
+
+ +

Definition at line 477 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
expression stan::gm::matrix_var_decl::N_
+
+ +

Definition at line 478 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
range stan::gm::matrix_var_decl::range_
+
+ +

Definition at line 476 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1matrix__var__decl.png b/doc/api/html/structstan_1_1gm_1_1matrix__var__decl.png new file mode 100644 index 0000000000000000000000000000000000000000..de8bf0132b8c0e3a87955644ecea2b5ae1dbdee5 GIT binary patch literal 698 zcmeAS@N?(olHy`uVBq!ia0vp^Gl4jOgBeKLrmBAdQW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;n)Y zz9RSej{$P$Lx20vtvP$dy;Nkn3-j%j3(J=7yk=3>l^a*3(rp<0WUfC~ZuhBz4XDH(v)X+Oiha`&t3Xoyy;@`w8?_6m+Z+l%jU1k-MS%Y$vU&s zX=1Bzftx%FJ0xT*}in$W#P zGgaQrefe=#M$V(RljPF&f6v=m-K#o3HL+y6?Ci51+r#F0PSlO$ndJ1gP+^O%mh!TN zmvrrq^((G!cI;!a75ZvMy1Kl7Yt9 zrg_i* + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::member_var_decl_visgen Member List
+
+
+ +

This is the complete list of members for stan::gm::member_var_decl_visgen, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + +
declare_array(std::string const &type, std::string const &name, size_t size) const stan::gm::member_var_decl_visgeninline
indents_stan::gm::member_var_decl_visgen
member_var_decl_visgen(int indents, std::ostream &o)stan::gm::member_var_decl_visgeninline
o_stan::gm::visgen
operator()(nil const &) const stan::gm::member_var_decl_visgeninline
operator()(int_var_decl const &x) const stan::gm::member_var_decl_visgeninline
operator()(double_var_decl const &x) const stan::gm::member_var_decl_visgeninline
operator()(unit_vector_var_decl const &x) const stan::gm::member_var_decl_visgeninline
operator()(simplex_var_decl const &x) const stan::gm::member_var_decl_visgeninline
operator()(ordered_var_decl const &x) const stan::gm::member_var_decl_visgeninline
operator()(positive_ordered_var_decl const &x) const stan::gm::member_var_decl_visgeninline
operator()(cholesky_factor_var_decl const &x) const stan::gm::member_var_decl_visgeninline
operator()(cov_matrix_var_decl const &x) const stan::gm::member_var_decl_visgeninline
operator()(corr_matrix_var_decl const &x) const stan::gm::member_var_decl_visgeninline
operator()(vector_var_decl const &x) const stan::gm::member_var_decl_visgeninline
operator()(row_vector_var_decl const &x) const stan::gm::member_var_decl_visgeninline
operator()(matrix_var_decl const &x) const stan::gm::member_var_decl_visgeninline
result_type typedefstan::gm::visgen
visgen(std::ostream &o)stan::gm::visgeninline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1member__var__decl__visgen.html b/doc/api/html/structstan_1_1gm_1_1member__var__decl__visgen.html new file mode 100644 index 00000000000..5495f958fe7 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1member__var__decl__visgen.html @@ -0,0 +1,614 @@ + + + + + +Stan: stan::gm::member_var_decl_visgen Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::member_var_decl_visgen Struct Reference
+
+
+ +

#include <generator.hpp>

+
+Inheritance diagram for stan::gm::member_var_decl_visgen:
+
+
+ + +stan::gm::visgen + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 member_var_decl_visgen (int indents, std::ostream &o)
 
void operator() (nil const &) const
 
void operator() (int_var_decl const &x) const
 
void operator() (double_var_decl const &x) const
 
void operator() (unit_vector_var_decl const &x) const
 
void operator() (simplex_var_decl const &x) const
 
void operator() (ordered_var_decl const &x) const
 
void operator() (positive_ordered_var_decl const &x) const
 
void operator() (cholesky_factor_var_decl const &x) const
 
void operator() (cov_matrix_var_decl const &x) const
 
void operator() (corr_matrix_var_decl const &x) const
 
void operator() (vector_var_decl const &x) const
 
void operator() (row_vector_var_decl const &x) const
 
void operator() (matrix_var_decl const &x) const
 
void declare_array (std::string const &type, std::string const &name, size_t size) const
 
- Public Member Functions inherited from stan::gm::visgen
 visgen (std::ostream &o)
 
+ + + + + + +

+Public Attributes

int indents_
 
- Public Attributes inherited from stan::gm::visgen
std::ostream & o_
 
+ + + + +

+Additional Inherited Members

- Public Types inherited from stan::gm::visgen
typedef void result_type
 
+

Detailed Description

+
+

Definition at line 865 of file generator.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
stan::gm::member_var_decl_visgen::member_var_decl_visgen (int indents,
std::ostream & o 
)
+
+inline
+
+ +

Definition at line 867 of file generator.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::member_var_decl_visgen::declare_array (std::string const & type,
std::string const & name,
size_t size 
) const
+
+inline
+
+ +

Definition at line 909 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::member_var_decl_visgen::operator() (nil const & ) const
+
+inline
+
+ +

Definition at line 872 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::member_var_decl_visgen::operator() (int_var_decl const & x) const
+
+inline
+
+ +

Definition at line 873 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::member_var_decl_visgen::operator() (double_var_decl const & x) const
+
+inline
+
+ +

Definition at line 876 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::member_var_decl_visgen::operator() (unit_vector_var_decl const & x) const
+
+inline
+
+ +

Definition at line 879 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::member_var_decl_visgen::operator() (simplex_var_decl const & x) const
+
+inline
+
+ +

Definition at line 882 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::member_var_decl_visgen::operator() (ordered_var_decl const & x) const
+
+inline
+
+ +

Definition at line 885 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::member_var_decl_visgen::operator() (positive_ordered_var_decl const & x) const
+
+inline
+
+ +

Definition at line 888 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::member_var_decl_visgen::operator() (cholesky_factor_var_decl const & x) const
+
+inline
+
+ +

Definition at line 891 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::member_var_decl_visgen::operator() (cov_matrix_var_decl const & x) const
+
+inline
+
+ +

Definition at line 894 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::member_var_decl_visgen::operator() (corr_matrix_var_decl const & x) const
+
+inline
+
+ +

Definition at line 897 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::member_var_decl_visgen::operator() (vector_var_decl const & x) const
+
+inline
+
+ +

Definition at line 900 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::member_var_decl_visgen::operator() (row_vector_var_decl const & x) const
+
+inline
+
+ +

Definition at line 903 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::member_var_decl_visgen::operator() (matrix_var_decl const & x) const
+
+inline
+
+ +

Definition at line 906 of file generator.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
int stan::gm::member_var_decl_visgen::indents_
+
+ +

Definition at line 866 of file generator.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1member__var__decl__visgen.png b/doc/api/html/structstan_1_1gm_1_1member__var__decl__visgen.png new file mode 100644 index 0000000000000000000000000000000000000000..4a85d22bdd6d2109246c04a7926cd28446f57798 GIT binary patch literal 747 zcmeAS@N?(olHy`uVBq!ia0vp^7l1f`gBeK1pW>beq$C1-LR|m<{|{uoc=NTi|Ih>= z3ycpOIKbL@M;^%KC<*clW&kPzfvcxNj2IZ0sytmBLn;{G&V4)SkOGe@|90bj|CQHs zJ>7jb?DZ+5nGdfmoG`=L>DTns$Z0c=D0zN9(V&uQ@4x>3mDPkLldFVJxNkcq{^Qfbt&^Twzm9EX z_N?-K&%AV!cjDEZCl>463zJ+e<8di6Hn1rBs0{Nb)frxT%a)ZYc&2}?3tqwfk|iK_ zW{%2B)7aW}tp$(#L`z>SF=^A@dEx1!o6Gf{Ey+sh&zt_c>ZIqTZGEie58K~Nb~x_$ z`|TW$Q^(wmpRD$n^sOXkx{B<@<=%di{)GS?t9%;djk}H0QX|!b4$ObSW-vL8dDmSv zec)EPGaKo)9u&2#Nv)-TI$<8RiAwP>Kc~K zcao29=vlF4O~a*$DgSSlZZBkeyQd`B=eM@%Nw$FUYThUQ+9@A(0!&s;iV^qwv%hTV zmdu8xM4#;4dl_$8+*>U9Dt*n)TahudCABu+kjP8f6kN31!Ii5{d*>@Y)85tmTguxf zC4T42ogVX|=%Ym*d`i59Cik18mK4^9z>GpIzinD%9yX U!4 + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::multiplication_expr Member List
+
+
+ +

This is the complete list of members for stan::gm::multiplication_expr, including all inherited members.

+ + +
operator()(expression &expr1, const expression &expr2, std::ostream &error_msgs) const stan::gm::multiplication_exprinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1multiplication__expr.html b/doc/api/html/structstan_1_1gm_1_1multiplication__expr.html new file mode 100644 index 00000000000..24198fae438 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1multiplication__expr.html @@ -0,0 +1,175 @@ + + + + + +Stan: stan::gm::multiplication_expr Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::multiplication_expr Struct Reference
+
+
+ +

#include <term_grammar_def.hpp>

+ + + + +

+Classes

struct  result
 
+ + + +

+Public Member Functions

expression operator() (expression &expr1, const expression &expr2, std::ostream &error_msgs) const
 
+

Detailed Description

+
+

Definition at line 133 of file term_grammar_def.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
expression stan::gm::multiplication_expr::operator() (expressionexpr1,
const expressionexpr2,
std::ostream & error_msgs 
) const
+
+inline
+
+ +

Definition at line 137 of file term_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1multiplication__expr_1_1result-members.html b/doc/api/html/structstan_1_1gm_1_1multiplication__expr_1_1result-members.html new file mode 100644 index 00000000000..697b96526f7 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1multiplication__expr_1_1result-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::multiplication_expr::result< T1, T2, T3 > Member List
+
+
+ +

This is the complete list of members for stan::gm::multiplication_expr::result< T1, T2, T3 >, including all inherited members.

+ + +
type typedefstan::gm::multiplication_expr::result< T1, T2, T3 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1multiplication__expr_1_1result.html b/doc/api/html/structstan_1_1gm_1_1multiplication__expr_1_1result.html new file mode 100644 index 00000000000..b8a789b81fc --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1multiplication__expr_1_1result.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::gm::multiplication_expr::result< T1, T2, T3 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::multiplication_expr::result< T1, T2, T3 > Struct Template Reference
+
+
+ +

#include <term_grammar_def.hpp>

+ + + + +

+Public Types

typedef expression type
 
+

Detailed Description

+

template<typename T1, typename T2, typename T3>
+struct stan::gm::multiplication_expr::result< T1, T2, T3 >

+ + +

Definition at line 135 of file term_grammar_def.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 , typename T3 >
+ + + + +
typedef expression stan::gm::multiplication_expr::result< T1, T2, T3 >::type
+
+ +

Definition at line 135 of file term_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1name__vis-members.html b/doc/api/html/structstan_1_1gm_1_1name__vis-members.html new file mode 100644 index 00000000000..31bc948fed9 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1name__vis-members.html @@ -0,0 +1,126 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::name_vis Member List
+
+
+ +

This is the complete list of members for stan::gm::name_vis, including all inherited members.

+ + + + + + + + + + + + + + + +
name_vis()stan::gm::name_vis
operator()(const nil &x) const stan::gm::name_vis
operator()(const int_var_decl &x) const stan::gm::name_vis
operator()(const double_var_decl &x) const stan::gm::name_vis
operator()(const vector_var_decl &x) const stan::gm::name_vis
operator()(const row_vector_var_decl &x) const stan::gm::name_vis
operator()(const matrix_var_decl &x) const stan::gm::name_vis
operator()(const simplex_var_decl &x) const stan::gm::name_vis
operator()(const unit_vector_var_decl &x) const stan::gm::name_vis
operator()(const ordered_var_decl &x) const stan::gm::name_vis
operator()(const positive_ordered_var_decl &x) const stan::gm::name_vis
operator()(const cholesky_factor_var_decl &x) const stan::gm::name_vis
operator()(const cov_matrix_var_decl &x) const stan::gm::name_vis
operator()(const corr_matrix_var_decl &x) const stan::gm::name_vis
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1name__vis.html b/doc/api/html/structstan_1_1gm_1_1name__vis.html new file mode 100644 index 00000000000..d168aae304a --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1name__vis.html @@ -0,0 +1,414 @@ + + + + + +Stan: stan::gm::name_vis Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::name_vis Struct Reference
+
+
+ +

#include <ast.hpp>

+
+Inheritance diagram for stan::gm::name_vis:
+
+
+ + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 name_vis ()
 
std::string operator() (const nil &x) const
 
std::string operator() (const int_var_decl &x) const
 
std::string operator() (const double_var_decl &x) const
 
std::string operator() (const vector_var_decl &x) const
 
std::string operator() (const row_vector_var_decl &x) const
 
std::string operator() (const matrix_var_decl &x) const
 
std::string operator() (const simplex_var_decl &x) const
 
std::string operator() (const unit_vector_var_decl &x) const
 
std::string operator() (const ordered_var_decl &x) const
 
std::string operator() (const positive_ordered_var_decl &x) const
 
std::string operator() (const cholesky_factor_var_decl &x) const
 
std::string operator() (const cov_matrix_var_decl &x) const
 
std::string operator() (const corr_matrix_var_decl &x) const
 
+

Detailed Description

+
+

Definition at line 514 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::name_vis::name_vis ()
+
+ +

Definition at line 852 of file ast_def.cpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + + + + +
std::string stan::gm::name_vis::operator() (const nilx) const
+
+ +

Definition at line 853 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
std::string stan::gm::name_vis::operator() (const int_var_declx) const
+
+ +

Definition at line 856 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
std::string stan::gm::name_vis::operator() (const double_var_declx) const
+
+ +

Definition at line 859 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
std::string stan::gm::name_vis::operator() (const vector_var_declx) const
+
+ +

Definition at line 862 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
std::string stan::gm::name_vis::operator() (const row_vector_var_declx) const
+
+ +

Definition at line 865 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
std::string stan::gm::name_vis::operator() (const matrix_var_declx) const
+
+ +

Definition at line 868 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
std::string stan::gm::name_vis::operator() (const simplex_var_declx) const
+
+ +

Definition at line 874 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
std::string stan::gm::name_vis::operator() (const unit_vector_var_declx) const
+
+ +

Definition at line 871 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
std::string stan::gm::name_vis::operator() (const ordered_var_declx) const
+
+ +

Definition at line 877 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
std::string stan::gm::name_vis::operator() (const positive_ordered_var_declx) const
+
+ +

Definition at line 880 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
std::string stan::gm::name_vis::operator() (const cholesky_factor_var_declx) const
+
+ +

Definition at line 883 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
std::string stan::gm::name_vis::operator() (const cov_matrix_var_declx) const
+
+ +

Definition at line 886 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
std::string stan::gm::name_vis::operator() (const corr_matrix_var_declx) const
+
+ +

Definition at line 889 of file ast_def.cpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1name__vis.png b/doc/api/html/structstan_1_1gm_1_1name__vis.png new file mode 100644 index 0000000000000000000000000000000000000000..476c09c080bb4ab04ec92457c3799e7a7e3a1ec3 GIT binary patch literal 731 zcmeAS@N?(olHy`uVBq!ia0vp^hk-bNgBeIp4mKxk|C&mwtlY2U%)Io4*V(7J`B8uFNd)uV z`&exA*OkrF>QXn)q$^XBH{8A*l(%{Qk6EUVAK!Y)wr1YpoA>SFulshd5#IBE%MAND zKT79LGz(Yu=2@M*pY`N7-(@LB@6IU6=hXh^@$Br9LyxxS1nhGW^fql%+O~PN|Gup6 z0`Apqm-e2Y*){*wInRK`)}Lg!5I>o5!G1Iae5q+>I}92Y!qpb@$Um;jdRTvqp&)9xX6tIOw2(pli;Lg$g&z%^Z$|#`<+iI*c`uF#qZDq@^Xl=8yhS5Omi4?|WcMWbkzLb6Mw<&;$T73`=zY literal 0 HcmV?d00001 diff --git a/doc/api/html/structstan_1_1gm_1_1negate__expr-members.html b/doc/api/html/structstan_1_1gm_1_1negate__expr-members.html new file mode 100644 index 00000000000..6f94b110883 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1negate__expr-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::negate_expr Member List
+
+
+ +

This is the complete list of members for stan::gm::negate_expr, including all inherited members.

+ + +
operator()(const expression &expr, std::ostream &error_msgs) const stan::gm::negate_exprinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1negate__expr.html b/doc/api/html/structstan_1_1gm_1_1negate__expr.html new file mode 100644 index 00000000000..ea4f1d0c2f4 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1negate__expr.html @@ -0,0 +1,169 @@ + + + + + +Stan: stan::gm::negate_expr Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::negate_expr Struct Reference
+
+
+ +

#include <term_grammar_def.hpp>

+ + + + +

+Classes

struct  result
 
+ + + +

+Public Member Functions

expression operator() (const expression &expr, std::ostream &error_msgs) const
 
+

Detailed Description

+
+

Definition at line 285 of file term_grammar_def.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
expression stan::gm::negate_expr::operator() (const expressionexpr,
std::ostream & error_msgs 
) const
+
+inline
+
+ +

Definition at line 289 of file term_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1negate__expr_1_1result-members.html b/doc/api/html/structstan_1_1gm_1_1negate__expr_1_1result-members.html new file mode 100644 index 00000000000..f4999bb0f54 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1negate__expr_1_1result-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::negate_expr::result< T1, T2 > Member List
+
+
+ +

This is the complete list of members for stan::gm::negate_expr::result< T1, T2 >, including all inherited members.

+ + +
type typedefstan::gm::negate_expr::result< T1, T2 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1negate__expr_1_1result.html b/doc/api/html/structstan_1_1gm_1_1negate__expr_1_1result.html new file mode 100644 index 00000000000..a9f989b6705 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1negate__expr_1_1result.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::gm::negate_expr::result< T1, T2 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::negate_expr::result< T1, T2 > Struct Template Reference
+
+
+ +

#include <term_grammar_def.hpp>

+ + + + +

+Public Types

typedef expression type
 
+

Detailed Description

+

template<typename T1, typename T2>
+struct stan::gm::negate_expr::result< T1, T2 >

+ + +

Definition at line 287 of file term_grammar_def.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 >
+ + + + +
typedef expression stan::gm::negate_expr::result< T1, T2 >::type
+
+ +

Definition at line 287 of file term_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1nil.html b/doc/api/html/structstan_1_1gm_1_1nil.html new file mode 100644 index 00000000000..af4ae2ebb8a --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1nil.html @@ -0,0 +1,121 @@ + + + + + +Stan: stan::gm::nil Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::nil Struct Reference
+
+
+ +

Placeholder struct for boost::variant default ctors. + More...

+ +

#include <ast.hpp>

+

Detailed Description

+

Placeholder struct for boost::variant default ctors.

+ +

Definition at line 18 of file ast.hpp.

+

The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1no__op__statement.html b/doc/api/html/structstan_1_1gm_1_1no__op__statement.html new file mode 100644 index 00000000000..996f245764f --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1no__op__statement.html @@ -0,0 +1,117 @@ + + + + + +Stan: stan::gm::no_op_statement Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::no_op_statement Struct Reference
+
+
+ +

#include <ast.hpp>

+

Detailed Description

+
+

Definition at line 648 of file ast.hpp.

+

The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1ordered__var__decl-members.html b/doc/api/html/structstan_1_1gm_1_1ordered__var__decl-members.html new file mode 100644 index 00000000000..22635bdd041 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1ordered__var__decl-members.html @@ -0,0 +1,121 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::ordered_var_decl Member List
+
+
+ +

This is the complete list of members for stan::gm::ordered_var_decl, including all inherited members.

+ + + + + + + + + + +
base_type_stan::gm::base_var_decl
base_var_decl()stan::gm::base_var_decl
base_var_decl(const base_expr_type &base_type)stan::gm::base_var_decl
base_var_decl(const std::string &name, const std::vector< expression > &dims, const base_expr_type &base_type)stan::gm::base_var_decl
dims_stan::gm::base_var_decl
K_stan::gm::ordered_var_decl
name_stan::gm::base_var_decl
ordered_var_decl()stan::gm::ordered_var_decl
ordered_var_decl(expression const &K, std::string const &name, std::vector< expression > const &dims)stan::gm::ordered_var_decl
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1ordered__var__decl.html b/doc/api/html/structstan_1_1gm_1_1ordered__var__decl.html new file mode 100644 index 00000000000..ffc515d9daf --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1ordered__var__decl.html @@ -0,0 +1,225 @@ + + + + + +Stan: stan::gm::ordered_var_decl Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::ordered_var_decl Struct Reference
+
+
+ +

#include <ast.hpp>

+
+Inheritance diagram for stan::gm::ordered_var_decl:
+
+
+ + +stan::gm::base_var_decl + +
+ + + + + + + + + + + + + +

+Public Member Functions

 ordered_var_decl ()
 
 ordered_var_decl (expression const &K, std::string const &name, std::vector< expression > const &dims)
 
- Public Member Functions inherited from stan::gm::base_var_decl
 base_var_decl ()
 
 base_var_decl (const base_expr_type &base_type)
 
 base_var_decl (const std::string &name, const std::vector< expression > &dims, const base_expr_type &base_type)
 
+ + + + + + + + + + +

+Public Attributes

expression K_
 
- Public Attributes inherited from stan::gm::base_var_decl
std::string name_
 
std::vector< expressiondims_
 
base_expr_type base_type_
 
+

Detailed Description

+
+

Definition at line 439 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::ordered_var_decl::ordered_var_decl ()
+
+ +

Definition at line 764 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
stan::gm::ordered_var_decl::ordered_var_decl (expression const & K,
std::string const & name,
std::vector< expression > const & dims 
)
+
+ +

Definition at line 768 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
expression stan::gm::ordered_var_decl::K_
+
+ +

Definition at line 440 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1ordered__var__decl.png b/doc/api/html/structstan_1_1gm_1_1ordered__var__decl.png new file mode 100644 index 0000000000000000000000000000000000000000..77fb430405d348cafeed9b7fadac1bcf9c600812 GIT binary patch literal 719 zcmeAS@N?(olHy`uVBq!ia0vp^OMy6mgBeKruX1$)QW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;8ECup5wn-Zg_Y3nV;N8yFyxxln`p#?Tud;_I^ zwQW+hwz92d<_|JEU3&S{v)gNzuK#|r_GaL&+N@`}rb}D|Cy#{(soxeQ8}?m6g{e&$&zP{0i`_T7Es?$D+EJiA(&_vnwq&sIR~%? zF5Y%bBYjr=)c@P3o>;hd?&*tr#DcS@eHQPUGqq(W*GZ>aI;&s)n)>nUlxyqOR_F%{ zd1v0to};%-H;u_kb-`rrl=*)SS?}rX(^vgJ&&c|^h4v}cg&SWNnXG^N@}unkUDM`! zUE94j`{ms7@2T!Dzr9pjdVBi6%WvLHTX}QQpFR5C$4_Tm(~pz+bK%N%)2CU--fr0? zyo|@8w<7BpW7*f)`vZ?_?0&{D=SsFl%yawobNf0{ c#>Un&u+LQHmzHBn2Btm+Pgg&ebxsLQ0LLs_T>t<8 literal 0 HcmV?d00001 diff --git a/doc/api/html/structstan_1_1gm_1_1positive__ordered__var__decl-members.html b/doc/api/html/structstan_1_1gm_1_1positive__ordered__var__decl-members.html new file mode 100644 index 00000000000..b88d7771a2c --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1positive__ordered__var__decl-members.html @@ -0,0 +1,121 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::positive_ordered_var_decl Member List
+
+
+ +

This is the complete list of members for stan::gm::positive_ordered_var_decl, including all inherited members.

+ + + + + + + + + + +
base_type_stan::gm::base_var_decl
base_var_decl()stan::gm::base_var_decl
base_var_decl(const base_expr_type &base_type)stan::gm::base_var_decl
base_var_decl(const std::string &name, const std::vector< expression > &dims, const base_expr_type &base_type)stan::gm::base_var_decl
dims_stan::gm::base_var_decl
K_stan::gm::positive_ordered_var_decl
name_stan::gm::base_var_decl
positive_ordered_var_decl()stan::gm::positive_ordered_var_decl
positive_ordered_var_decl(expression const &K, std::string const &name, std::vector< expression > const &dims)stan::gm::positive_ordered_var_decl
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1positive__ordered__var__decl.html b/doc/api/html/structstan_1_1gm_1_1positive__ordered__var__decl.html new file mode 100644 index 00000000000..24d26fc4a3f --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1positive__ordered__var__decl.html @@ -0,0 +1,225 @@ + + + + + +Stan: stan::gm::positive_ordered_var_decl Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::positive_ordered_var_decl Struct Reference
+
+
+ +

#include <ast.hpp>

+
+Inheritance diagram for stan::gm::positive_ordered_var_decl:
+
+
+ + +stan::gm::base_var_decl + +
+ + + + + + + + + + + + + +

+Public Member Functions

 positive_ordered_var_decl ()
 
 positive_ordered_var_decl (expression const &K, std::string const &name, std::vector< expression > const &dims)
 
- Public Member Functions inherited from stan::gm::base_var_decl
 base_var_decl ()
 
 base_var_decl (const base_expr_type &base_type)
 
 base_var_decl (const std::string &name, const std::vector< expression > &dims, const base_expr_type &base_type)
 
+ + + + + + + + + + +

+Public Attributes

expression K_
 
- Public Attributes inherited from stan::gm::base_var_decl
std::string name_
 
std::vector< expressiondims_
 
base_expr_type base_type_
 
+

Detailed Description

+
+

Definition at line 447 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::positive_ordered_var_decl::positive_ordered_var_decl ()
+
+ +

Definition at line 775 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
stan::gm::positive_ordered_var_decl::positive_ordered_var_decl (expression const & K,
std::string const & name,
std::vector< expression > const & dims 
)
+
+ +

Definition at line 779 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
expression stan::gm::positive_ordered_var_decl::K_
+
+ +

Definition at line 448 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1positive__ordered__var__decl.png b/doc/api/html/structstan_1_1gm_1_1positive__ordered__var__decl.png new file mode 100644 index 0000000000000000000000000000000000000000..f70ccaee8d08201f9b2196e0db65f813f156694f GIT binary patch literal 794 zcmeAS@N?(olHy`uVBq!ia0vp^*MT^IgBeKf6%%+4q$C1-LR|m<{|{uoc=NTi|Ih>= z3ycpOIKbL@M;^%KC<*clW&kPzfvcxNj2IZ0R(iTPhEy=Vo%?pvY6Tuw@!K;$|Ld<= zTf=tc)yn0?i8B&!Yk8h968OJK=d{s+2$f6=Up>!P?vuSI{koW|r|ubEdOBi~mg&Fg z%zo=kUr1eDdV1HfZ?(_eKMt8(VU>D~<9~c@$ML7KP7MW< zw`bi*V~?raxc{~E*KNB_Ox3-;R)p_j=H47%)t77SEaOF|Tjskix3rCa_}}h&`MK~r zZu`uaewPu~z3nQub7rf}>be(z;h0 zt7_+Usn{-4|GrS=ul}r{nR|h}uU_}!bBdX{*bU~Wi96WOiedP>;?XaOBHjn= z2cl(f|Fv?e_+WBuz8p8wF&6<^C9%lloFw zzAOA{^N)%=;JWU&@2&Fdfc*8V^`#ghjsQjyJz-ZDVSRO&Cj02A~gH^k>h+1^h + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::print_statement Member List
+
+
+ +

This is the complete list of members for stan::gm::print_statement, including all inherited members.

+ + + + +
print_statement()stan::gm::print_statement
print_statement(const std::vector< printable > &printables)stan::gm::print_statement
printables_stan::gm::print_statement
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1print__statement.html b/doc/api/html/structstan_1_1gm_1_1print__statement.html new file mode 100644 index 00000000000..42cfb52e6d7 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1print__statement.html @@ -0,0 +1,186 @@ + + + + + +Stan: stan::gm::print_statement Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::print_statement Struct Reference
+
+
+ +

#include <ast.hpp>

+ + + + + + +

+Public Member Functions

 print_statement ()
 
 print_statement (const std::vector< printable > &printables)
 
+ + + +

+Public Attributes

std::vector< printableprintables_
 
+

Detailed Description

+
+

Definition at line 641 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::print_statement::print_statement ()
+
+ +

Definition at line 970 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::print_statement::print_statement (const std::vector< printable > & printables)
+
+ +

Definition at line 972 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
std::vector<printable> stan::gm::print_statement::printables_
+
+ +

Definition at line 642 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1printable-members.html b/doc/api/html/structstan_1_1gm_1_1printable-members.html new file mode 100644 index 00000000000..a2de36c668d --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1printable-members.html @@ -0,0 +1,119 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::printable Member List
+
+
+ +

This is the complete list of members for stan::gm::printable, including all inherited members.

+ + + + + + + + +
printable()stan::gm::printable
printable(const expression &expression)stan::gm::printable
printable(const std::string &msg)stan::gm::printable
printable(const printable_t &printable)stan::gm::printable
printable(const printable &printable)stan::gm::printable
printable_stan::gm::printable
printable_t typedefstan::gm::printable
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1printable.html b/doc/api/html/structstan_1_1gm_1_1printable.html new file mode 100644 index 00000000000..5392ae43e9b --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1printable.html @@ -0,0 +1,271 @@ + + + + + +Stan: stan::gm::printable Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::printable Struct Reference
+
+
+ +

#include <ast.hpp>

+ + + + +

+Public Types

typedef boost::variant
+< boost::recursive_wrapper
+< std::string >
+, boost::recursive_wrapper
+< expression > > 
printable_t
 
+ + + + + + + + + + + +

+Public Member Functions

 printable ()
 
 printable (const expression &expression)
 
 printable (const std::string &msg)
 
 printable (const printable_t &printable)
 
 printable (const printable &printable)
 
+ + + +

+Public Attributes

printable_t printable_
 
+

Detailed Description

+
+

Definition at line 232 of file ast.hpp.

+

Member Typedef Documentation

+ +
+
+ + + + +
typedef boost::variant<boost::recursive_wrapper<std::string>, boost::recursive_wrapper<expression> > stan::gm::printable::printable_t
+
+ +

Definition at line 235 of file ast.hpp.

+ +
+
+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::printable::printable ()
+
+ +

Definition at line 386 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::printable::printable (const expressionexpression)
+
+ +

Definition at line 387 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::printable::printable (const std::string & msg)
+
+ +

Definition at line 388 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::printable::printable (const printable_tprintable)
+
+ +

Definition at line 389 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::printable::printable (const printableprintable)
+
+ +

Definition at line 391 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
printable_t stan::gm::printable::printable_
+
+ +

Definition at line 243 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1printable__visgen-members.html b/doc/api/html/structstan_1_1gm_1_1printable__visgen-members.html new file mode 100644 index 00000000000..0c36ff0cf02 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1printable__visgen-members.html @@ -0,0 +1,118 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::printable_visgen Member List
+
+
+ +

This is the complete list of members for stan::gm::printable_visgen, including all inherited members.

+ + + + + + + +
o_stan::gm::visgen
operator()(const std::string &s) const stan::gm::printable_visgeninline
operator()(const expression &e) const stan::gm::printable_visgeninline
printable_visgen(std::ostream &o)stan::gm::printable_visgeninline
result_type typedefstan::gm::visgen
visgen(std::ostream &o)stan::gm::visgeninline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1printable__visgen.html b/doc/api/html/structstan_1_1gm_1_1printable__visgen.html new file mode 100644 index 00000000000..189af7ecc2c --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1printable__visgen.html @@ -0,0 +1,231 @@ + + + + + +Stan: stan::gm::printable_visgen Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::printable_visgen Struct Reference
+
+
+ +

#include <generator.hpp>

+
+Inheritance diagram for stan::gm::printable_visgen:
+
+
+ + +stan::gm::visgen + +
+ + + + + + + + + + + +

+Public Member Functions

 printable_visgen (std::ostream &o)
 
void operator() (const std::string &s) const
 
void operator() (const expression &e) const
 
- Public Member Functions inherited from stan::gm::visgen
 visgen (std::ostream &o)
 
+ + + + + + + +

+Additional Inherited Members

- Public Types inherited from stan::gm::visgen
typedef void result_type
 
- Public Attributes inherited from stan::gm::visgen
std::ostream & o_
 
+

Detailed Description

+
+

Definition at line 231 of file generator.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::gm::printable_visgen::printable_visgen (std::ostream & o)
+
+inline
+
+ +

Definition at line 232 of file generator.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::printable_visgen::operator() (const std::string & s) const
+
+inline
+
+ +

Definition at line 233 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::printable_visgen::operator() (const expressione) const
+
+inline
+
+ +

Definition at line 236 of file generator.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1printable__visgen.png b/doc/api/html/structstan_1_1gm_1_1printable__visgen.png new file mode 100644 index 0000000000000000000000000000000000000000..5dd87115101285dc034b61ceb66544b46dccebd7 GIT binary patch literal 661 zcmeAS@N?(olHy`uVBq!ia0vp^bAUL2gBeKP_Ia}bNJ#|vgt-3y{~ySF@#br3|Dg#$ z78oBmaDcV*jy#adQ4-`A%m7pb0#{Fk7%?y~sd&0LhEy=Votr!PwgL~^^y9`q|J(2M zJn-zQUf><+TUl*ipXLZib6UpV+?E?HYUUXwJbkhXx1PGEnB4^KNnaGFncAzVdzL+W zawu3wX8Q7Hzy0feR0-)nHTN`sbjKoF!eLUI&&i{)-}X+*wp7}kYPorCDC>kJ+G$UV zB0r1e_MMVlz1vr9Hp3*7w0&!;L!UiKnpqs#KjkZSzM$1evSRpXP-WlvQ9P88X5WSW5kWT)Sb(3?<(^?UAdj< zMu8;*w;p@K!KVy5J7gMIr!#MOP{be>!*`(RG-Cvk# zdUyHe8T;?Q*4xSLTYX07d(G-S_bOk0stR!FT|cKp^V+`um3RC6+ZFGH98~&P*LN?! z=ETvPzh^y(>N}Aa>0`Mpt}VkzYJt? + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::program Member List
+
+
+ +

This is the complete list of members for stan::gm::program, including all inherited members.

+ + + + + + + + + +
data_decl_stan::gm::program
derived_data_decl_stan::gm::program
derived_decl_stan::gm::program
generated_decl_stan::gm::program
parameter_decl_stan::gm::program
program()stan::gm::program
program(const std::vector< var_decl > &data_decl, const std::pair< std::vector< var_decl >, std::vector< statement > > &derived_data_decl, const std::vector< var_decl > &parameter_decl, const std::pair< std::vector< var_decl >, std::vector< statement > > &derived_decl, const statement &st, const std::pair< std::vector< var_decl >, std::vector< statement > > &generated_decl)stan::gm::program
statement_stan::gm::program
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1program.html b/doc/api/html/structstan_1_1gm_1_1program.html new file mode 100644 index 00000000000..cb2f0886939 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1program.html @@ -0,0 +1,306 @@ + + + + + +Stan: stan::gm::program Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::program Struct Reference
+
+
+ +

#include <ast.hpp>

+ + + + + + +

+Public Member Functions

 program ()
 
 program (const std::vector< var_decl > &data_decl, const std::pair< std::vector< var_decl >, std::vector< statement > > &derived_data_decl, const std::vector< var_decl > &parameter_decl, const std::pair< std::vector< var_decl >, std::vector< statement > > &derived_decl, const statement &st, const std::pair< std::vector< var_decl >, std::vector< statement > > &generated_decl)
 
+ + + + + + + + + + + + + +

+Public Attributes

std::vector< var_decldata_decl_
 
std::pair< std::vector
+< var_decl >, std::vector
+< statement > > 
derived_data_decl_
 
std::vector< var_declparameter_decl_
 
std::pair< std::vector
+< var_decl >, std::vector
+< statement > > 
derived_decl_
 
statement statement_
 
std::pair< std::vector
+< var_decl >, std::vector
+< statement > > 
generated_decl_
 
+

Detailed Description

+
+

Definition at line 654 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::program::program ()
+
+ +

Definition at line 976 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::gm::program::program (const std::vector< var_decl > & data_decl,
const std::pair< std::vector< var_decl >, std::vector< statement > > & derived_data_decl,
const std::vector< var_decl > & parameter_decl,
const std::pair< std::vector< var_decl >, std::vector< statement > > & derived_decl,
const statementst,
const std::pair< std::vector< var_decl >, std::vector< statement > > & generated_decl 
)
+
+ +

Definition at line 977 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
std::vector<var_decl> stan::gm::program::data_decl_
+
+ +

Definition at line 655 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
std::pair<std::vector<var_decl>,std::vector<statement> > stan::gm::program::derived_data_decl_
+
+ +

Definition at line 657 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
std::pair<std::vector<var_decl>,std::vector<statement> > stan::gm::program::derived_decl_
+
+ +

Definition at line 660 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
std::pair<std::vector<var_decl>,std::vector<statement> > stan::gm::program::generated_decl_
+
+ +

Definition at line 662 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
std::vector<var_decl> stan::gm::program::parameter_decl_
+
+ +

Definition at line 658 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
statement stan::gm::program::statement_
+
+ +

Definition at line 661 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1program__grammar-members.html b/doc/api/html/structstan_1_1gm_1_1program__grammar-members.html new file mode 100644 index 00000000000..0c80aac084b --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1program__grammar-members.html @@ -0,0 +1,126 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::program_grammar< Iterator > Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1program__grammar.html b/doc/api/html/structstan_1_1gm_1_1program__grammar.html new file mode 100644 index 00000000000..85b63704388 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1program__grammar.html @@ -0,0 +1,422 @@ + + + + + +Stan: stan::gm::program_grammar< Iterator > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::program_grammar< Iterator > Struct Template Reference
+
+
+ +

#include <program_grammar.hpp>

+
+Inheritance diagram for stan::gm::program_grammar< Iterator >:
+
+
+ + + +
+ + + + +

+Public Member Functions

 program_grammar (const std::string &model_name)
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Attributes

std::string model_name_
 
variable_map var_map_
 
std::stringstream error_msgs_
 
expression_grammar< Iterator > expression_g
 
var_decls_grammar< Iterator > var_decls_g
 
statement_grammar< Iterator > statement_g
 
boost::spirit::qi::rule
+< Iterator, std::vector
+< var_decl >
+), whitespace_grammar
+< Iterator > > 
data_var_decls_r
 
boost::spirit::qi::rule
+< Iterator, std::pair
+< std::vector< var_decl >
+, std::vector< statement >
+ >), whitespace_grammar
+< Iterator > > 
derived_data_var_decls_r
 
boost::spirit::qi::rule
+< Iterator, std::pair
+< std::vector< var_decl >
+, std::vector< statement >
+ >), whitespace_grammar
+< Iterator > > 
derived_var_decls_r
 
boost::spirit::qi::rule
+< Iterator, std::pair
+< std::vector< var_decl >
+, std::vector< statement >
+ >), whitespace_grammar
+< Iterator > > 
generated_var_decls_r
 
boost::spirit::qi::rule
+< Iterator, statement(),
+whitespace_grammar< Iterator > > 
model_r
 
boost::spirit::qi::rule
+< Iterator, std::vector
+< var_decl >
+), whitespace_grammar
+< Iterator > > 
param_var_decls_r
 
boost::spirit::qi::rule
+< Iterator, program(),
+whitespace_grammar< Iterator > > 
program_r
 
+

Detailed Description

+

template<typename Iterator>
+struct stan::gm::program_grammar< Iterator >

+ + +

Definition at line 21 of file program_grammar.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename Iterator>
+ + + + + + + + +
stan::gm::program_grammar< Iterator >::program_grammar (const std::string & model_name)
+
+ +
+
+

Member Data Documentation

+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator, std::vector<var_decl>), whitespace_grammar<Iterator> > stan::gm::program_grammar< Iterator >::data_var_decls_r
+
+ +

Definition at line 43 of file program_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator, std::pair<std::vector<var_decl>, std::vector<statement> >), whitespace_grammar<Iterator> > stan::gm::program_grammar< Iterator >::derived_data_var_decls_r
+
+ +

Definition at line 49 of file program_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator, std::pair<std::vector<var_decl>, std::vector<statement> >), whitespace_grammar<Iterator> > stan::gm::program_grammar< Iterator >::derived_var_decls_r
+
+ +

Definition at line 55 of file program_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
std::stringstream stan::gm::program_grammar< Iterator >::error_msgs_
+
+ +

Definition at line 31 of file program_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
expression_grammar<Iterator> stan::gm::program_grammar< Iterator >::expression_g
+
+ +

Definition at line 34 of file program_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator, std::pair<std::vector<var_decl>, std::vector<statement> >), whitespace_grammar<Iterator> > stan::gm::program_grammar< Iterator >::generated_var_decls_r
+
+ +

Definition at line 61 of file program_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
std::string stan::gm::program_grammar< Iterator >::model_name_
+
+ +

Definition at line 29 of file program_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator, statement(), whitespace_grammar<Iterator> > stan::gm::program_grammar< Iterator >::model_r
+
+ +

Definition at line 66 of file program_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator, std::vector<var_decl>), whitespace_grammar<Iterator> > stan::gm::program_grammar< Iterator >::param_var_decls_r
+
+ +

Definition at line 71 of file program_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator, program(), whitespace_grammar<Iterator> > stan::gm::program_grammar< Iterator >::program_r
+
+ +

Definition at line 76 of file program_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
statement_grammar<Iterator> stan::gm::program_grammar< Iterator >::statement_g
+
+ +

Definition at line 36 of file program_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
var_decls_grammar<Iterator> stan::gm::program_grammar< Iterator >::var_decls_g
+
+ +

Definition at line 35 of file program_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
variable_map stan::gm::program_grammar< Iterator >::var_map_
+
+ +

Definition at line 30 of file program_grammar.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1program__grammar.png b/doc/api/html/structstan_1_1gm_1_1program__grammar.png new file mode 100644 index 0000000000000000000000000000000000000000..503ab229d570812735ff7868321c4da43403bda9 GIT binary patch literal 1216 zcmeAS@N?(olHy`uVBq!ia0y~yV7v%q2XHV0$-=h%2|!9Bz$e7@|Ns9$=8HF9OZyK^ z0J6aNz<~p-op)Tg1i|YRVyDlA5zq?+2^UbWPull*G1irnwULR|{?bsHcYd8CtI!<4Iy5-5u%3JYE z&YjmTp0;Gc)E6c<=Uo3~plOz#8IAC149BA%P5=Jla`C>}e!soNteO2U{k6qb zFP(p0TIc=i6Jd6Lwy$G4>h)k+8t0Ln9eZC(zV^*$6PTV+Y+a)LQ0!#=tG-{_MbnnZ znl74D;%Cm*a^Aj7-_w4Qe$XV5Ez$>`Sx#M2JJ+PP?%bp;i z2IqrQmL$vGi1WMf^|`5~_oaFBs@;B9sd)NdxfasS_{V04F>~Ck%_^*S9YZF0P5LrX zYtf`Bo~|L2j8?*v0e7JB=1DUn`56Cj)-q0En6#pUN#)Y@a7ES=i6UeTEqZMGmJp(OesNvtS6QLm3X>}C`<+_0H!KxDEMXVau$+afvy22S2T<4 z8ec4bztX$rwqjk%16Pp;5kS1;&911o=S`)=&prKHZMa)B)@RwfpS7nBm9{#ztF3%_QZMt!V#6;?dt%@BrbM0Ewn;eQzM5{v+>^g@_QqZ}I^nw|{gHacy6f&7hJJVY z3-uY^U%1`5?&#^Y{;%In_#LPJ|NRF4V}Tc!Y|eG-^GPVb@w;xBd_d`Q+jrmo<#(95 z|8{Babl!aB@w`((Y`3o8b5;43wk&`B|Jtj6O)tK6lyH&kd3#KfcipQVrV^=l7ad9- z@A$b`=KV$IMZ48*yL^9tF?mt_AGx{HD_3O}>+Iu5>dB4Ty!6M}xEk9zGNms4KD$;) zx0Oa~``EZXs%E^mZhLraLv8QDw=LC5-Ti(d4-9`LEP7aV>-nZ!3;DC}=PL_0`22ce zY$a}TVC&ifb6&>lelr+UF0=!62_48pkEKhkD`rNXJfqY8kCD}k^W-w6tY5(5hQZU- K&t;ucLK6U9(L7WD literal 0 HcmV?d00001 diff --git a/doc/api/html/structstan_1_1gm_1_1range-members.html b/doc/api/html/structstan_1_1gm_1_1range-members.html new file mode 100644 index 00000000000..3ada6739bb8 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1range-members.html @@ -0,0 +1,118 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::range Member List
+
+
+ +

This is the complete list of members for stan::gm::range, including all inherited members.

+ + + + + + + +
has_high() const stan::gm::range
has_low() const stan::gm::range
high_stan::gm::range
low_stan::gm::range
range()stan::gm::range
range(expression const &low, expression const &high)stan::gm::range
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1range.html b/doc/api/html/structstan_1_1gm_1_1range.html new file mode 100644 index 00000000000..3b859d2db3f --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1range.html @@ -0,0 +1,251 @@ + + + + + +Stan: stan::gm::range Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::range Struct Reference
+
+
+ +

#include <ast.hpp>

+ + + + + + + + + + +

+Public Member Functions

 range ()
 
 range (expression const &low, expression const &high)
 
bool has_low () const
 
bool has_high () const
 
+ + + + + +

+Public Attributes

expression low_
 
expression high_
 
+

Detailed Description

+
+

Definition at line 358 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::range::range ()
+
+ +

Definition at line 645 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
stan::gm::range::range (expression const & low,
expression const & high 
)
+
+ +

Definition at line 646 of file ast_def.cpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + + + +
bool stan::gm::range::has_high () const
+
+ +

Definition at line 654 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + +
bool stan::gm::range::has_low () const
+
+ +

Definition at line 651 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
expression stan::gm::range::high_
+
+ +

Definition at line 360 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
expression stan::gm::range::low_
+
+ +

Definition at line 359 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1remove__loop__identifier-members.html b/doc/api/html/structstan_1_1gm_1_1remove__loop__identifier-members.html new file mode 100644 index 00000000000..7f353a4a981 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1remove__loop__identifier-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::remove_loop_identifier Member List
+
+
+ +

This is the complete list of members for stan::gm::remove_loop_identifier, including all inherited members.

+ + +
operator()(const std::string &name, variable_map &vm) const stan::gm::remove_loop_identifierinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1remove__loop__identifier.html b/doc/api/html/structstan_1_1gm_1_1remove__loop__identifier.html new file mode 100644 index 00000000000..68257b954ef --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1remove__loop__identifier.html @@ -0,0 +1,169 @@ + + + + + +Stan: stan::gm::remove_loop_identifier Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::remove_loop_identifier Struct Reference
+
+
+ +

#include <statement_grammar_def.hpp>

+ + + + +

+Classes

struct  result
 
+ + + +

+Public Member Functions

void operator() (const std::string &name, variable_map &vm) const
 
+

Detailed Description

+
+

Definition at line 385 of file statement_grammar_def.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::gm::remove_loop_identifier::operator() (const std::string & name,
variable_mapvm 
) const
+
+inline
+
+ +

Definition at line 388 of file statement_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1remove__loop__identifier_1_1result-members.html b/doc/api/html/structstan_1_1gm_1_1remove__loop__identifier_1_1result-members.html new file mode 100644 index 00000000000..a6bb9d93655 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1remove__loop__identifier_1_1result-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::remove_loop_identifier::result< T1, T2 > Member List
+
+
+ +

This is the complete list of members for stan::gm::remove_loop_identifier::result< T1, T2 >, including all inherited members.

+ + +
type typedefstan::gm::remove_loop_identifier::result< T1, T2 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1remove__loop__identifier_1_1result.html b/doc/api/html/structstan_1_1gm_1_1remove__loop__identifier_1_1result.html new file mode 100644 index 00000000000..d6b2618f3ff --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1remove__loop__identifier_1_1result.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::gm::remove_loop_identifier::result< T1, T2 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::remove_loop_identifier::result< T1, T2 > Struct Template Reference
+
+
+ +

#include <statement_grammar_def.hpp>

+ + + + +

+Public Types

typedef void type
 
+

Detailed Description

+

template<typename T1, typename T2>
+struct stan::gm::remove_loop_identifier::result< T1, T2 >

+ + +

Definition at line 387 of file statement_grammar_def.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 >
+ + + + +
typedef void stan::gm::remove_loop_identifier::result< T1, T2 >::type
+
+ +

Definition at line 387 of file statement_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1row__vector__var__decl-members.html b/doc/api/html/structstan_1_1gm_1_1row__vector__var__decl-members.html new file mode 100644 index 00000000000..6b11711c847 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1row__vector__var__decl-members.html @@ -0,0 +1,122 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::row_vector_var_decl Member List
+
+
+ +

This is the complete list of members for stan::gm::row_vector_var_decl, including all inherited members.

+ + + + + + + + + + + +
base_type_stan::gm::base_var_decl
base_var_decl()stan::gm::base_var_decl
base_var_decl(const base_expr_type &base_type)stan::gm::base_var_decl
base_var_decl(const std::string &name, const std::vector< expression > &dims, const base_expr_type &base_type)stan::gm::base_var_decl
dims_stan::gm::base_var_decl
N_stan::gm::row_vector_var_decl
name_stan::gm::base_var_decl
range_stan::gm::row_vector_var_decl
row_vector_var_decl()stan::gm::row_vector_var_decl
row_vector_var_decl(range const &range, expression const &N, std::string const &name, std::vector< expression > const &dims)stan::gm::row_vector_var_decl
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1row__vector__var__decl.html b/doc/api/html/structstan_1_1gm_1_1row__vector__var__decl.html new file mode 100644 index 00000000000..b296b06a6ab --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1row__vector__var__decl.html @@ -0,0 +1,247 @@ + + + + + +Stan: stan::gm::row_vector_var_decl Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::row_vector_var_decl Struct Reference
+
+
+ +

#include <ast.hpp>

+
+Inheritance diagram for stan::gm::row_vector_var_decl:
+
+
+ + +stan::gm::base_var_decl + +
+ + + + + + + + + + + + + +

+Public Member Functions

 row_vector_var_decl ()
 
 row_vector_var_decl (range const &range, expression const &N, std::string const &name, std::vector< expression > const &dims)
 
- Public Member Functions inherited from stan::gm::base_var_decl
 base_var_decl ()
 
 base_var_decl (const base_expr_type &base_type)
 
 base_var_decl (const std::string &name, const std::vector< expression > &dims, const base_expr_type &base_type)
 
+ + + + + + + + + + + + +

+Public Attributes

range range_
 
expression N_
 
- Public Attributes inherited from stan::gm::base_var_decl
std::string name_
 
std::vector< expressiondims_
 
base_expr_type base_type_
 
+

Detailed Description

+
+

Definition at line 465 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::row_vector_var_decl::row_vector_var_decl ()
+
+ +

Definition at line 797 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::gm::row_vector_var_decl::row_vector_var_decl (range const & range,
expression const & N,
std::string const & name,
std::vector< expression > const & dims 
)
+
+ +

Definition at line 798 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
expression stan::gm::row_vector_var_decl::N_
+
+ +

Definition at line 467 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
range stan::gm::row_vector_var_decl::range_
+
+ +

Definition at line 466 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1row__vector__var__decl.png b/doc/api/html/structstan_1_1gm_1_1row__vector__var__decl.png new file mode 100644 index 0000000000000000000000000000000000000000..e2940a2a56ae084a21d1ecbbb8ab5eb6ff2df1bf GIT binary patch literal 735 zcmeAS@N?(olHy`uVBq!ia0vp^JAgQVgBeK9{pBwOq$C1-LR|m<{|{uoc=NTi|Ih>= z3ycpOIKbL@M;^%KC<*clW&kPzfvcxNj2IZ0@;qG}Ln;{G&V4;;wSoZK?DMPk{8yG& zRxmd_mSTDO+Lc?oxOjMZp6H+6q+@(Y$@6pKqe&)0!qb;b+#^yxsbuPQE$<-L%lqU% z_;>BzI`ejZ_Jp?+x#p|>oA&EtXif7c)tNahoAzw1zj^!Es!3Ohl-^Bky0J`u=bukU z1gC^PnX)b^YMCURP;6GL4O`+=S_TK_71vg}s>cxAi%=axrh zs~CEY9$^HkV^B6MY?wI1;(&*bOoECUpMj7tyF_OvbI%bJX@}n8b7wjD66~O=CVBly zcP~`0x~x|7gZa_xlRs=OAATD-Ve7}^X*;H#etNs5qx#{$gYKS*!d5S{Y0F9> z@n^*!cW`M&gxgsCSmpkxbb{JqzOe7RcKly`boDvEBfqmRvRIz~=(Xp>&#*lkIXB-p z`!VjS*Pqh9_7KkBb@N-c@XCf<-*<@p<<9(Bj~q_;Pd&UUbyuuaD1+b6)cqT-ADR7< z#Ukal$4`BR1BQQBg*U~_`Pi+;(7a=w7Q=oHXgH*ZmY>_n`IG(Y8g)j_zf;x#QzL_? LtDnm{r-UW|n4e(h literal 0 HcmV?d00001 diff --git a/doc/api/html/structstan_1_1gm_1_1sample-members.html b/doc/api/html/structstan_1_1gm_1_1sample-members.html new file mode 100644 index 00000000000..645ccfaa5f8 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1sample-members.html @@ -0,0 +1,118 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::sample Member List
+
+
+ +

This is the complete list of members for stan::gm::sample, including all inherited members.

+ + + + + + + +
dist_stan::gm::sample
expr_stan::gm::sample
is_ill_formed() const stan::gm::sample
sample()stan::gm::sample
sample(expression &e, distribution &dist)stan::gm::sample
truncation_stan::gm::sample
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1sample.html b/doc/api/html/structstan_1_1gm_1_1sample.html new file mode 100644 index 00000000000..5d3d9e87aad --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1sample.html @@ -0,0 +1,248 @@ + + + + + +Stan: stan::gm::sample Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::sample Struct Reference
+
+
+ +

#include <ast.hpp>

+ + + + + + + + +

+Public Member Functions

 sample ()
 
 sample (expression &e, distribution &dist)
 
bool is_ill_formed () const
 
+ + + + + + + +

+Public Attributes

expression expr_
 
distribution dist_
 
range truncation_
 
+

Detailed Description

+
+

Definition at line 677 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::sample::sample ()
+
+ +

Definition at line 994 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
stan::gm::sample::sample (expressione,
distributiondist 
)
+
+ +

Definition at line 996 of file ast_def.cpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + + + +
bool stan::gm::sample::is_ill_formed () const
+
+ +

Definition at line 1001 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
distribution stan::gm::sample::dist_
+
+ +

Definition at line 679 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
expression stan::gm::sample::expr_
+
+ +

Definition at line 678 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
range stan::gm::sample::truncation_
+
+ +

Definition at line 680 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1set__fun__type-members.html b/doc/api/html/structstan_1_1gm_1_1set__fun__type-members.html new file mode 100644 index 00000000000..332f2b14dfa --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1set__fun__type-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::set_fun_type Member List
+
+
+ +

This is the complete list of members for stan::gm::set_fun_type, including all inherited members.

+ + +
operator()(fun &fun, std::ostream &error_msgs) const stan::gm::set_fun_typeinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1set__fun__type.html b/doc/api/html/structstan_1_1gm_1_1set__fun__type.html new file mode 100644 index 00000000000..95333d1735c --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1set__fun__type.html @@ -0,0 +1,169 @@ + + + + + +Stan: stan::gm::set_fun_type Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::set_fun_type Struct Reference
+
+
+ +

#include <term_grammar_def.hpp>

+ + + + +

+Classes

struct  result
 
+ + + +

+Public Member Functions

fun operator() (fun &fun, std::ostream &error_msgs) const
 
+

Detailed Description

+
+

Definition at line 73 of file term_grammar_def.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fun stan::gm::set_fun_type::operator() (funfun,
std::ostream & error_msgs 
) const
+
+inline
+
+ +

Definition at line 77 of file term_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1set__fun__type2-members.html b/doc/api/html/structstan_1_1gm_1_1set__fun__type2-members.html new file mode 100644 index 00000000000..a9c1b85a8fc --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1set__fun__type2-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::set_fun_type2 Member List
+
+
+ +

This is the complete list of members for stan::gm::set_fun_type2, including all inherited members.

+ + +
operator()(fun &fun, std::ostream &error_msgs) const stan::gm::set_fun_type2inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1set__fun__type2.html b/doc/api/html/structstan_1_1gm_1_1set__fun__type2.html new file mode 100644 index 00000000000..f8dc6a8f2d5 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1set__fun__type2.html @@ -0,0 +1,169 @@ + + + + + +Stan: stan::gm::set_fun_type2 Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::set_fun_type2 Struct Reference
+
+
+ +

#include <expression_grammar_def.hpp>

+ + + + +

+Classes

struct  result
 
+ + + +

+Public Member Functions

fun operator() (fun &fun, std::ostream &error_msgs) const
 
+

Detailed Description

+
+

Definition at line 70 of file expression_grammar_def.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
fun stan::gm::set_fun_type2::operator() (funfun,
std::ostream & error_msgs 
) const
+
+inline
+
+ +

Definition at line 74 of file expression_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1set__fun__type2_1_1result-members.html b/doc/api/html/structstan_1_1gm_1_1set__fun__type2_1_1result-members.html new file mode 100644 index 00000000000..e1032e75dc9 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1set__fun__type2_1_1result-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::set_fun_type2::result< T1, T2 > Member List
+
+
+ +

This is the complete list of members for stan::gm::set_fun_type2::result< T1, T2 >, including all inherited members.

+ + +
type typedefstan::gm::set_fun_type2::result< T1, T2 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1set__fun__type2_1_1result.html b/doc/api/html/structstan_1_1gm_1_1set__fun__type2_1_1result.html new file mode 100644 index 00000000000..3f918b74765 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1set__fun__type2_1_1result.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::gm::set_fun_type2::result< T1, T2 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::set_fun_type2::result< T1, T2 > Struct Template Reference
+
+
+ +

#include <expression_grammar_def.hpp>

+ + + + +

+Public Types

typedef fun type
 
+

Detailed Description

+

template<typename T1, typename T2>
+struct stan::gm::set_fun_type2::result< T1, T2 >

+ + +

Definition at line 72 of file expression_grammar_def.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 >
+ + + + +
typedef fun stan::gm::set_fun_type2::result< T1, T2 >::type
+
+ +

Definition at line 72 of file expression_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1set__fun__type_1_1result-members.html b/doc/api/html/structstan_1_1gm_1_1set__fun__type_1_1result-members.html new file mode 100644 index 00000000000..c639e959c94 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1set__fun__type_1_1result-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::set_fun_type::result< T1, T2 > Member List
+
+
+ +

This is the complete list of members for stan::gm::set_fun_type::result< T1, T2 >, including all inherited members.

+ + +
type typedefstan::gm::set_fun_type::result< T1, T2 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1set__fun__type_1_1result.html b/doc/api/html/structstan_1_1gm_1_1set__fun__type_1_1result.html new file mode 100644 index 00000000000..f6d6c6d6580 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1set__fun__type_1_1result.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::gm::set_fun_type::result< T1, T2 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::set_fun_type::result< T1, T2 > Struct Template Reference
+
+
+ +

#include <term_grammar_def.hpp>

+ + + + +

+Public Types

typedef fun type
 
+

Detailed Description

+

template<typename T1, typename T2>
+struct stan::gm::set_fun_type::result< T1, T2 >

+ + +

Definition at line 75 of file term_grammar_def.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 >
+ + + + +
typedef fun stan::gm::set_fun_type::result< T1, T2 >::type
+
+ +

Definition at line 75 of file term_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1set__fun__type__named-members.html b/doc/api/html/structstan_1_1gm_1_1set__fun__type__named-members.html new file mode 100644 index 00000000000..dff0f7de5f9 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1set__fun__type__named-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::set_fun_type_named Member List
+
+
+ +

This is the complete list of members for stan::gm::set_fun_type_named, including all inherited members.

+ + +
operator()(fun &fun, const var_origin &var_origin, bool &pass, std::ostream &error_msgs) const stan::gm::set_fun_type_namedinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1set__fun__type__named.html b/doc/api/html/structstan_1_1gm_1_1set__fun__type__named.html new file mode 100644 index 00000000000..18c0c612df4 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1set__fun__type__named.html @@ -0,0 +1,181 @@ + + + + + +Stan: stan::gm::set_fun_type_named Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::set_fun_type_named Struct Reference
+
+
+ +

#include <term_grammar_def.hpp>

+ + + + +

+Classes

struct  result
 
+ + + +

+Public Member Functions

fun operator() (fun &fun, const var_origin &var_origin, bool &pass, std::ostream &error_msgs) const
 
+

Detailed Description

+
+

Definition at line 91 of file term_grammar_def.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
fun stan::gm::set_fun_type_named::operator() (funfun,
const var_originvar_origin,
bool & pass,
std::ostream & error_msgs 
) const
+
+inline
+
+ +

Definition at line 95 of file term_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1set__fun__type__named_1_1result-members.html b/doc/api/html/structstan_1_1gm_1_1set__fun__type__named_1_1result-members.html new file mode 100644 index 00000000000..4a6369f3123 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1set__fun__type__named_1_1result-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::set_fun_type_named::result< T1, T2, T3, T4 > Member List
+
+
+ +

This is the complete list of members for stan::gm::set_fun_type_named::result< T1, T2, T3, T4 >, including all inherited members.

+ + +
type typedefstan::gm::set_fun_type_named::result< T1, T2, T3, T4 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1set__fun__type__named_1_1result.html b/doc/api/html/structstan_1_1gm_1_1set__fun__type__named_1_1result.html new file mode 100644 index 00000000000..b27c1ba4c95 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1set__fun__type__named_1_1result.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::gm::set_fun_type_named::result< T1, T2, T3, T4 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::set_fun_type_named::result< T1, T2, T3, T4 > Struct Template Reference
+
+
+ +

#include <term_grammar_def.hpp>

+ + + + +

+Public Types

typedef fun type
 
+

Detailed Description

+

template<typename T1, typename T2, typename T3, typename T4>
+struct stan::gm::set_fun_type_named::result< T1, T2, T3, T4 >

+ + +

Definition at line 93 of file term_grammar_def.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 , typename T3 , typename T4 >
+ + + + +
typedef fun stan::gm::set_fun_type_named::result< T1, T2, T3, T4 >::type
+
+ +

Definition at line 93 of file term_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1set__param__ranges__visgen-members.html b/doc/api/html/structstan_1_1gm_1_1set__param__ranges__visgen-members.html new file mode 100644 index 00000000000..54a3eadec01 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1set__param__ranges__visgen-members.html @@ -0,0 +1,133 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::set_param_ranges_visgen Member List
+
+
+ +

This is the complete list of members for stan::gm::set_param_ranges_visgen, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + +
generate_increment(std::vector< expression > dims) const stan::gm::set_param_ranges_visgeninline
generate_increment(expression K, std::vector< expression > dims) const stan::gm::set_param_ranges_visgeninline
generate_increment(expression M, expression N, std::vector< expression > dims) const stan::gm::set_param_ranges_visgeninline
generate_increment_i(std::vector< expression > dims) const stan::gm::set_param_ranges_visgeninline
o_stan::gm::visgen
operator()(const nil &) const stan::gm::set_param_ranges_visgeninline
operator()(const int_var_decl &x) const stan::gm::set_param_ranges_visgeninline
operator()(const double_var_decl &x) const stan::gm::set_param_ranges_visgeninline
operator()(const vector_var_decl &x) const stan::gm::set_param_ranges_visgeninline
operator()(const row_vector_var_decl &x) const stan::gm::set_param_ranges_visgeninline
operator()(const matrix_var_decl &x) const stan::gm::set_param_ranges_visgeninline
operator()(const unit_vector_var_decl &x) const stan::gm::set_param_ranges_visgeninline
operator()(const simplex_var_decl &x) const stan::gm::set_param_ranges_visgeninline
operator()(const ordered_var_decl &x) const stan::gm::set_param_ranges_visgeninline
operator()(const positive_ordered_var_decl &x) const stan::gm::set_param_ranges_visgeninline
operator()(const cholesky_factor_var_decl &x) const stan::gm::set_param_ranges_visgeninline
operator()(const cov_matrix_var_decl &x) const stan::gm::set_param_ranges_visgeninline
operator()(const corr_matrix_var_decl &x) const stan::gm::set_param_ranges_visgeninline
result_type typedefstan::gm::visgen
set_param_ranges_visgen(std::ostream &o)stan::gm::set_param_ranges_visgeninline
visgen(std::ostream &o)stan::gm::visgeninline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1set__param__ranges__visgen.html b/doc/api/html/structstan_1_1gm_1_1set__param__ranges__visgen.html new file mode 100644 index 00000000000..2e8f7d1ca95 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1set__param__ranges__visgen.html @@ -0,0 +1,677 @@ + + + + + +Stan: stan::gm::set_param_ranges_visgen Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::set_param_ranges_visgen Struct Reference
+
+
+ +

#include <generator.hpp>

+
+Inheritance diagram for stan::gm::set_param_ranges_visgen:
+
+
+ + +stan::gm::visgen + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 set_param_ranges_visgen (std::ostream &o)
 
void operator() (const nil &) const
 
void operator() (const int_var_decl &x) const
 
void operator() (const double_var_decl &x) const
 
void operator() (const vector_var_decl &x) const
 
void operator() (const row_vector_var_decl &x) const
 
void operator() (const matrix_var_decl &x) const
 
void operator() (const unit_vector_var_decl &x) const
 
void operator() (const simplex_var_decl &x) const
 
void operator() (const ordered_var_decl &x) const
 
void operator() (const positive_ordered_var_decl &x) const
 
void operator() (const cholesky_factor_var_decl &x) const
 
void operator() (const cov_matrix_var_decl &x) const
 
void operator() (const corr_matrix_var_decl &x) const
 
void generate_increment_i (std::vector< expression > dims) const
 
void generate_increment (std::vector< expression > dims) const
 
void generate_increment (expression K, std::vector< expression > dims) const
 
void generate_increment (expression M, expression N, std::vector< expression > dims) const
 
- Public Member Functions inherited from stan::gm::visgen
 visgen (std::ostream &o)
 
+ + + + + + + +

+Additional Inherited Members

- Public Types inherited from stan::gm::visgen
typedef void result_type
 
- Public Attributes inherited from stan::gm::visgen
std::ostream & o_
 
+

Detailed Description

+
+

Definition at line 2117 of file generator.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::gm::set_param_ranges_visgen::set_param_ranges_visgen (std::ostream & o)
+
+inline
+
+ +

Definition at line 2118 of file generator.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::set_param_ranges_visgen::generate_increment (std::vector< expressiondims) const
+
+inline
+
+ +

Definition at line 2244 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::gm::set_param_ranges_visgen::generate_increment (expression K,
std::vector< expressiondims 
) const
+
+inline
+
+ +

Definition at line 2256 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::set_param_ranges_visgen::generate_increment (expression M,
expression N,
std::vector< expressiondims 
) const
+
+inline
+
+ +

Definition at line 2267 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::set_param_ranges_visgen::generate_increment_i (std::vector< expressiondims) const
+
+inline
+
+ +

Definition at line 2232 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::set_param_ranges_visgen::operator() (const nil) const
+
+inline
+
+ +

Definition at line 2121 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::set_param_ranges_visgen::operator() (const int_var_declx) const
+
+inline
+
+ +

Definition at line 2122 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::set_param_ranges_visgen::operator() (const double_var_declx) const
+
+inline
+
+ +

Definition at line 2145 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::set_param_ranges_visgen::operator() (const vector_var_declx) const
+
+inline
+
+ +

Definition at line 2148 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::set_param_ranges_visgen::operator() (const row_vector_var_declx) const
+
+inline
+
+ +

Definition at line 2151 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::set_param_ranges_visgen::operator() (const matrix_var_declx) const
+
+inline
+
+ +

Definition at line 2154 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::set_param_ranges_visgen::operator() (const unit_vector_var_declx) const
+
+inline
+
+ +

Definition at line 2157 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::set_param_ranges_visgen::operator() (const simplex_var_declx) const
+
+inline
+
+ +

Definition at line 2168 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::set_param_ranges_visgen::operator() (const ordered_var_declx) const
+
+inline
+
+ +

Definition at line 2179 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::set_param_ranges_visgen::operator() (const positive_ordered_var_declx) const
+
+inline
+
+ +

Definition at line 2182 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::set_param_ranges_visgen::operator() (const cholesky_factor_var_declx) const
+
+inline
+
+ +

Definition at line 2185 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::set_param_ranges_visgen::operator() (const cov_matrix_var_declx) const
+
+inline
+
+ +

Definition at line 2204 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::set_param_ranges_visgen::operator() (const corr_matrix_var_declx) const
+
+inline
+
+ +

Definition at line 2219 of file generator.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1set__param__ranges__visgen.png b/doc/api/html/structstan_1_1gm_1_1set__param__ranges__visgen.png new file mode 100644 index 0000000000000000000000000000000000000000..83f147f9ad2a98a6fa24bed0c8d673a700813d2e GIT binary patch literal 766 zcmeAS@N?(olHy`uVBq!ia0vp^mw`BdgBeI}`MY5*kdg@S332`Z|38rV;?396{zDUh zEHFNB-~emq9eE&^qa?^Lm;tB=1g@S6F=Aj~>h*MS45?szJNNCR)d~VG{JEj`{!h#o za>H7PPovXFyrTAOos-C~U6u$SoH2ta1q$~U9cux9teQxHgWtlpRHSXpO2Tc?% zzcrJ)(%@6R{Saj9>KAnO?-7W4W+@4(Eb;OJRrq zXbR?paVYYrF&zkiiLXwy;{UOAX{GJO_lAsr)}ATRf8D=3tIozwB=guTd;3${KQ?*K zy)@xx?W-xr);xTjU%WouxE9NHO<*;a?NS0r^)YYXQHa~-#)clw$rph=sWK(Zh`DaF(pS!&6`!lO8I-YtajI+Y7n(uzMbjdWs-1k?v-C9vS^W?hfW#1XL zZT-zu^?R9>L4)M3{*^{b4NIRVuFW=WSSZ4I;lzwg?JDDybANA{$aui({oBipGq*W? qujYSX{sbDd*B>|WD7Gy8!q3pGYxa4z{eEC#W$<+Mb6Mw<&;$T8NpN=n literal 0 HcmV?d00001 diff --git a/doc/api/html/structstan_1_1gm_1_1set__var__type-members.html b/doc/api/html/structstan_1_1gm_1_1set__var__type-members.html new file mode 100644 index 00000000000..5fdd967055a --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1set__var__type-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::set_var_type Member List
+
+
+ +

This is the complete list of members for stan::gm::set_var_type, including all inherited members.

+ + +
operator()(variable &var_expr, variable_map &vm, std::ostream &error_msgs, bool &pass) const stan::gm::set_var_typeinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1set__var__type.html b/doc/api/html/structstan_1_1gm_1_1set__var__type.html new file mode 100644 index 00000000000..2fb93f25e86 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1set__var__type.html @@ -0,0 +1,181 @@ + + + + + +Stan: stan::gm::set_var_type Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::set_var_type Struct Reference
+
+
+ +

#include <term_grammar_def.hpp>

+ + + + +

+Classes

struct  result
 
+ + + +

+Public Member Functions

variable operator() (variable &var_expr, variable_map &vm, std::ostream &error_msgs, bool &pass) const
 
+

Detailed Description

+
+

Definition at line 363 of file term_grammar_def.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
variable stan::gm::set_var_type::operator() (variablevar_expr,
variable_mapvm,
std::ostream & error_msgs,
bool & pass 
) const
+
+inline
+
+ +

Definition at line 366 of file term_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1set__var__type_1_1result-members.html b/doc/api/html/structstan_1_1gm_1_1set__var__type_1_1result-members.html new file mode 100644 index 00000000000..014e7c39b3a --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1set__var__type_1_1result-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::set_var_type::result< T1, T2, T3, T4 > Member List
+
+
+ +

This is the complete list of members for stan::gm::set_var_type::result< T1, T2, T3, T4 >, including all inherited members.

+ + +
type typedefstan::gm::set_var_type::result< T1, T2, T3, T4 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1set__var__type_1_1result.html b/doc/api/html/structstan_1_1gm_1_1set__var__type_1_1result.html new file mode 100644 index 00000000000..9095aedc89d --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1set__var__type_1_1result.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::gm::set_var_type::result< T1, T2, T3, T4 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::set_var_type::result< T1, T2, T3, T4 > Struct Template Reference
+
+
+ +

#include <term_grammar_def.hpp>

+ + + + +

+Public Types

typedef variable type
 
+

Detailed Description

+

template<typename T1, typename T2, typename T3, typename T4>
+struct stan::gm::set_var_type::result< T1, T2, T3, T4 >

+ + +

Definition at line 365 of file term_grammar_def.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 , typename T3 , typename T4 >
+ + + + +
typedef variable stan::gm::set_var_type::result< T1, T2, T3, T4 >::type
+
+ +

Definition at line 365 of file term_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1simplex__var__decl-members.html b/doc/api/html/structstan_1_1gm_1_1simplex__var__decl-members.html new file mode 100644 index 00000000000..b20e29a1eab --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1simplex__var__decl-members.html @@ -0,0 +1,121 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::simplex_var_decl Member List
+
+
+ +

This is the complete list of members for stan::gm::simplex_var_decl, including all inherited members.

+ + + + + + + + + + +
base_type_stan::gm::base_var_decl
base_var_decl()stan::gm::base_var_decl
base_var_decl(const base_expr_type &base_type)stan::gm::base_var_decl
base_var_decl(const std::string &name, const std::vector< expression > &dims, const base_expr_type &base_type)stan::gm::base_var_decl
dims_stan::gm::base_var_decl
K_stan::gm::simplex_var_decl
name_stan::gm::base_var_decl
simplex_var_decl()stan::gm::simplex_var_decl
simplex_var_decl(expression const &K, std::string const &name, std::vector< expression > const &dims)stan::gm::simplex_var_decl
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1simplex__var__decl.html b/doc/api/html/structstan_1_1gm_1_1simplex__var__decl.html new file mode 100644 index 00000000000..750a5617421 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1simplex__var__decl.html @@ -0,0 +1,225 @@ + + + + + +Stan: stan::gm::simplex_var_decl Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::simplex_var_decl Struct Reference
+
+
+ +

#include <ast.hpp>

+
+Inheritance diagram for stan::gm::simplex_var_decl:
+
+
+ + +stan::gm::base_var_decl + +
+ + + + + + + + + + + + + +

+Public Member Functions

 simplex_var_decl ()
 
 simplex_var_decl (expression const &K, std::string const &name, std::vector< expression > const &dims)
 
- Public Member Functions inherited from stan::gm::base_var_decl
 base_var_decl ()
 
 base_var_decl (const base_expr_type &base_type)
 
 base_var_decl (const std::string &name, const std::vector< expression > &dims, const base_expr_type &base_type)
 
+ + + + + + + + + + +

+Public Attributes

expression K_
 
- Public Attributes inherited from stan::gm::base_var_decl
std::string name_
 
std::vector< expressiondims_
 
base_expr_type base_type_
 
+

Detailed Description

+
+

Definition at line 431 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::simplex_var_decl::simplex_var_decl ()
+
+ +

Definition at line 753 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
stan::gm::simplex_var_decl::simplex_var_decl (expression const & K,
std::string const & name,
std::vector< expression > const & dims 
)
+
+ +

Definition at line 757 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
expression stan::gm::simplex_var_decl::K_
+
+ +

Definition at line 432 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1simplex__var__decl.png b/doc/api/html/structstan_1_1gm_1_1simplex__var__decl.png new file mode 100644 index 0000000000000000000000000000000000000000..5e6fd794b31ec8b822ce6045944091ad7dbf291c GIT binary patch literal 716 zcmeAS@N?(olHy`uVBq!ia0vp^3xPO*gBeJ=IX<-jQW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;Sf8Dt9zx%x- zHC%6wth=RaeVXU`T0tRpPRsh6+j3_|rpH&n2Xfa!l_oC+7mC^6Kwq3K_Cvtz!mpKOS=5mzzX>L*0T6{~D zYt`X72Yt*wT)o>?;UCfbJ(^cQ%{ljn^P!6cJ!K0|S$_P^vDlewLfk7?4_6z-HM3)1 zPT7|s&iVS(!hp^VS6^g*u6Zn1*77XQZ12}^a?AerbH2ZKIA+O>@TYHX?#-QGm8HB) zc6XfKN!@>aanqJ;|5W!^<>jH4x&1zy5+P7QwcE?FjxAYbWF+(H48}& z%l1hjP+FS<~_FaF&n-KME^V4tdKP@-dKhL@0 m{v~L5eED^(P2kXxU(C%jm8|Bh+!+l_dJLYfelF{r5}E) + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::statement Member List
+
+
+ +

This is the complete list of members for stan::gm::statement, including all inherited members.

+ + + + + + + + + + + + + + + + +
statement()stan::gm::statement
statement(const statement_t &st)stan::gm::statement
statement(const nil &st)stan::gm::statement
statement(const assignment &st)stan::gm::statement
statement(const sample &st)stan::gm::statement
statement(const increment_log_prob_statement &st)stan::gm::statement
statement(const expression &st)stan::gm::statement
statement(const statements &st)stan::gm::statement
statement(const for_statement &st)stan::gm::statement
statement(const conditional_statement &st)stan::gm::statement
statement(const while_statement &st)stan::gm::statement
statement(const print_statement &st)stan::gm::statement
statement(const no_op_statement &st)stan::gm::statement
statement_stan::gm::statement
statement_t typedefstan::gm::statement
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1statement.html b/doc/api/html/structstan_1_1gm_1_1statement.html new file mode 100644 index 00000000000..8bbca9f9c29 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1statement.html @@ -0,0 +1,449 @@ + + + + + +Stan: stan::gm::statement Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::statement Struct Reference
+
+
+ +

#include <ast.hpp>

+ + + + +

+Public Types

typedef boost::variant
+< boost::recursive_wrapper
+< nil >
+, boost::recursive_wrapper
+< assignment >
+, boost::recursive_wrapper
+< sample >
+, boost::recursive_wrapper
+< increment_log_prob_statement >
+, boost::recursive_wrapper
+< expression >
+, boost::recursive_wrapper
+< statements >
+, boost::recursive_wrapper
+< for_statement >
+, boost::recursive_wrapper
+< conditional_statement >
+, boost::recursive_wrapper
+< while_statement >
+, boost::recursive_wrapper
+< print_statement >
+, boost::recursive_wrapper
+< no_op_statement > > 
statement_t
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 statement ()
 
 statement (const statement_t &st)
 
 statement (const nil &st)
 
 statement (const assignment &st)
 
 statement (const sample &st)
 
 statement (const increment_log_prob_statement &st)
 
 statement (const expression &st)
 
 statement (const statements &st)
 
 statement (const for_statement &st)
 
 statement (const conditional_statement &st)
 
 statement (const while_statement &st)
 
 statement (const print_statement &st)
 
 statement (const no_op_statement &st)
 
+ + + +

+Public Attributes

statement_t statement_
 
+

Detailed Description

+
+

Definition at line 574 of file ast.hpp.

+

Member Typedef Documentation

+ +
+
+ + + + +
typedef boost::variant<boost::recursive_wrapper<nil>, boost::recursive_wrapper<assignment>, boost::recursive_wrapper<sample>, boost::recursive_wrapper<increment_log_prob_statement>, boost::recursive_wrapper<expression>, boost::recursive_wrapper<statements>, boost::recursive_wrapper<for_statement>, boost::recursive_wrapper<conditional_statement>, boost::recursive_wrapper<while_statement>, boost::recursive_wrapper<print_statement>, boost::recursive_wrapper<no_op_statement> > stan::gm::statement::statement_t
+
+ +

Definition at line 586 of file ast.hpp.

+ +
+
+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::statement::statement ()
+
+ +

Definition at line 916 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::statement::statement (const statement_tst)
+
+ +

Definition at line 918 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::statement::statement (const nilst)
+
+ +

Definition at line 919 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::statement::statement (const assignmentst)
+
+ +

Definition at line 920 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::statement::statement (const samplest)
+
+ +

Definition at line 921 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::statement::statement (const increment_log_prob_statementst)
+
+ +

Definition at line 922 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::statement::statement (const expressionst)
+
+ +

Definition at line 924 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::statement::statement (const statementsst)
+
+ +

Definition at line 923 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::statement::statement (const for_statementst)
+
+ +

Definition at line 925 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::statement::statement (const conditional_statementst)
+
+ +

Definition at line 927 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::statement::statement (const while_statementst)
+
+ +

Definition at line 926 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::statement::statement (const print_statementst)
+
+ +

Definition at line 928 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::statement::statement (const no_op_statementst)
+
+ +

Definition at line 929 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
statement_t stan::gm::statement::statement_
+
+ +

Definition at line 588 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1statement__2__grammar-members.html b/doc/api/html/structstan_1_1gm_1_1statement__2__grammar-members.html new file mode 100644 index 00000000000..c43701c4b5c --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1statement__2__grammar-members.html @@ -0,0 +1,119 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::statement_2_grammar< Iterator > Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1statement__2__grammar.html b/doc/api/html/structstan_1_1gm_1_1statement__2__grammar.html new file mode 100644 index 00000000000..1aa0338734f --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1statement__2__grammar.html @@ -0,0 +1,295 @@ + + + + + +Stan: stan::gm::statement_2_grammar< Iterator > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::statement_2_grammar< Iterator > Struct Template Reference
+
+
+ +

#include <statement_2_grammar.hpp>

+
+Inheritance diagram for stan::gm::statement_2_grammar< Iterator >:
+
+
+ + + +
+ + + + +

+Public Member Functions

 statement_2_grammar (variable_map &var_map, std::stringstream &error_msgs, statement_grammar< Iterator > &sg)
 
+ + + + + + + + + + + + + +

+Public Attributes

variable_mapvar_map_
 
std::stringstream & error_msgs_
 
expression_grammar< Iterator > expression_g
 
statement_grammar< Iterator > & statement_g
 
boost::spirit::qi::rule
+< Iterator,
+conditional_statement(bool,
+var_origin),
+whitespace_grammar< Iterator > > 
conditional_statement_r
 
boost::spirit::qi::rule
+< Iterator, statement(bool,
+var_origin),
+whitespace_grammar< Iterator > > 
statement_2_r
 
+

Detailed Description

+

template<typename Iterator>
+struct stan::gm::statement_2_grammar< Iterator >

+ + +

Definition at line 23 of file statement_2_grammar.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename Iterator >
+ + + + + + + + + + + + + + + + + + + + + + + + +
stan::gm::statement_2_grammar< Iterator >::statement_2_grammar (variable_mapvar_map,
std::stringstream & error_msgs,
statement_grammar< Iterator > & sg 
)
+
+ +

Definition at line 88 of file statement_2_grammar_def.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, conditional_statement(bool,var_origin), whitespace_grammar<Iterator> > stan::gm::statement_2_grammar< Iterator >::conditional_statement_r
+
+ +

Definition at line 48 of file statement_2_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
std::stringstream& stan::gm::statement_2_grammar< Iterator >::error_msgs_
+
+ +

Definition at line 37 of file statement_2_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
expression_grammar<Iterator> stan::gm::statement_2_grammar< Iterator >::expression_g
+
+ +

Definition at line 40 of file statement_2_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, statement(bool,var_origin), whitespace_grammar<Iterator> > stan::gm::statement_2_grammar< Iterator >::statement_2_r
+
+ +

Definition at line 54 of file statement_2_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
statement_grammar<Iterator>& stan::gm::statement_2_grammar< Iterator >::statement_g
+
+ +

Definition at line 41 of file statement_2_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
variable_map& stan::gm::statement_2_grammar< Iterator >::var_map_
+
+ +

Definition at line 36 of file statement_2_grammar.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1statement__2__grammar.png b/doc/api/html/structstan_1_1gm_1_1statement__2__grammar.png new file mode 100644 index 0000000000000000000000000000000000000000..48338dce31b256c38a41fe5ca28da24075c40f45 GIT binary patch literal 1468 zcmeAS@N?(olHy`uVBq!ia0y~yU@`=<12~w0+TI79u=%<|m${dLyO*(Mghba&pb_MiSSSD<+J_3s8Ve;ha|_tF3UHTh#9m+sZA zn{irINpt&ojb|CtPKW4w%IfO`PSSglbo5Bk^Ih|gKmN8Wa$W!Z^*0sbZ@s_%RZc(b zbaGvV&sE*(ud}Pa^Ita1&ENF;c~sd337I#0KJGU3n`Ngf_S#3&t$F(1%{RTc-WG7& z)w7of_RP8|x;c02Z_btZCykcud+T_+$9(hJ>e!cgzdmgJuOeQ#?Bw-#OlRNx+Bqv# z{$0(q?p>a{uc}@@Sr_8tvGc66^_ku8KN%aIJ$SbITtwro@quTyE!{KawaDhm+#1_yJNL{1(u())^jLOhg=U<(;xH2hi`UlgaI{%N!6bszia_g|B=&bG9NmY}Q z`#zV29SF!_Zw@njdv#*cwOKhebF}?MjQ1brGR;jYxNu#3&!nVzaW|R+p0pHinDXs{ zz3}CgakFGL*Tfn>c%1%IpS67Rna`=sZ!6`0derY+e{#WN$+wI#;*(;&#NS@Es7$ zOK+}!QgK3S{SM7p`|OuZDmf4>YWyVCbJwhT^MjKwp5Hai-qY85jq{|Cg$7UEle9eD z_n05|S)}DzFEm|m!|nH17yeaF`o(@; zFi126uaRJ24tR83-<$0KL&%0C1|Ek_{euxk3~UP;M41y9Rz>IonQb6uR)paIGYyoL z4!O9@=;#RMU;sME5A0lCZMFjpSCE)HCMMNwxKMlI<%1M~!cd=mf6m0-{V^-bF!*wJ zQ_@j}KjMG(eYtO5zw=*wcV5t;BBQq-w>aNAxH_@y+S92A|5~m2dSSQJqMx_FzpE)X ztYO{3xjo{2kzRjtRG-E6R$nU?Uuiabp6K-AgF0ffBVR8p-pcuN;l8v-$Br7P*)sgu zdB@f8x8bsc=Sr96{!a18-?9ID*UR~zYZ#NWyCSWA`bqomzvpWFeWlmyRv+=NGn3Su z>+D(HtS!8@Y%257FLK`&-+vWa{pzgC;_f)Z?HA6(u6m)PYZH2AkCtx^`_V0ooC}l_ za?~xC6+e|>{$R()b@HC&S})_HEKkhVdNn6~D+vwqvHH33duLMK!s*qaOH~i9_dX}u zxFG-Vgs&^LRbTR4KB+7F`_9fKI+xj>Y%Am0c<0KVAE)(pt!FTQs29rlV21hohxr_W z2UPFG8~UcP|Ioa@GgV*X_3hMmjQ`mFHOXAQBG8asxw*O_`eS*BDg*O}I&kti+{I|X s04(x=DG9>dCn7AEsHEiMazye!L(FLhTi3#CF$_T9>FVdQ&MBb@0KRRTQvd(} literal 0 HcmV?d00001 diff --git a/doc/api/html/structstan_1_1gm_1_1statement__grammar-members.html b/doc/api/html/structstan_1_1gm_1_1statement__grammar-members.html new file mode 100644 index 00000000000..19a73dfe902 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1statement__grammar-members.html @@ -0,0 +1,138 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::statement_grammar< Iterator > Member List
+
+
+ +

This is the complete list of members for stan::gm::statement_grammar< Iterator >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + +
assignment_rstan::gm::statement_grammar< Iterator >
dims_rstan::gm::statement_grammar< Iterator >
distribution_rstan::gm::statement_grammar< Iterator >
error_msgs_stan::gm::statement_grammar< Iterator >
expression_gstan::gm::statement_grammar< Iterator >
for_statement_rstan::gm::statement_grammar< Iterator >
identifier_rstan::gm::statement_grammar< Iterator >
increment_log_prob_statement_rstan::gm::statement_grammar< Iterator >
local_var_decls_rstan::gm::statement_grammar< Iterator >
no_op_statement_rstan::gm::statement_grammar< Iterator >
non_lvalue_assign_rstan::gm::statement_grammar< Iterator >
opt_dims_rstan::gm::statement_grammar< Iterator >
print_statement_rstan::gm::statement_grammar< Iterator >
printable_rstan::gm::statement_grammar< Iterator >
printable_string_rstan::gm::statement_grammar< Iterator >
range_rstan::gm::statement_grammar< Iterator >
sample_rstan::gm::statement_grammar< Iterator >
statement_2_gstan::gm::statement_grammar< Iterator >
statement_grammar(variable_map &var_map, std::stringstream &error_msgs)stan::gm::statement_grammar< Iterator >
statement_rstan::gm::statement_grammar< Iterator >
statement_seq_rstan::gm::statement_grammar< Iterator >
truncation_range_rstan::gm::statement_grammar< Iterator >
var_decls_gstan::gm::statement_grammar< Iterator >
var_lhs_rstan::gm::statement_grammar< Iterator >
var_map_stan::gm::statement_grammar< Iterator >
while_statement_rstan::gm::statement_grammar< Iterator >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1statement__grammar.html b/doc/api/html/structstan_1_1gm_1_1statement__grammar.html new file mode 100644 index 00000000000..d3a83dd585a --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1statement__grammar.html @@ -0,0 +1,679 @@ + + + + + +Stan: stan::gm::statement_grammar< Iterator > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::statement_grammar< Iterator > Struct Template Reference
+
+
+ +

#include <statement_grammar.hpp>

+
+Inheritance diagram for stan::gm::statement_grammar< Iterator >:
+
+
+ + + +
+ + + + +

+Public Member Functions

 statement_grammar (variable_map &var_map, std::stringstream &error_msgs)
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Attributes

variable_mapvar_map_
 
std::stringstream & error_msgs_
 
expression_grammar< Iterator > expression_g
 
var_decls_grammar< Iterator > var_decls_g
 
statement_2_grammar< Iterator > statement_2_g
 
boost::spirit::qi::rule
+< Iterator, assignment(var_origin),
+whitespace_grammar< Iterator > > 
assignment_r
 
boost::spirit::qi::rule
+< Iterator, expression(var_origin),
+whitespace_grammar< Iterator > > 
non_lvalue_assign_r
 
boost::spirit::qi::rule
+< Iterator, std::vector
+< expression >var_origin),
+whitespace_grammar< Iterator > > 
dims_r
 
boost::spirit::qi::rule
+< Iterator, distribution(var_origin),
+whitespace_grammar< Iterator > > 
distribution_r
 
boost::spirit::qi::rule
+< Iterator,
+increment_log_prob_statement(var_origin),
+whitespace_grammar< Iterator > > 
increment_log_prob_statement_r
 
boost::spirit::qi::rule
+< Iterator,
+boost::spirit::qi::locals
+< std::string >, for_statement(bool,
+var_origin),
+whitespace_grammar< Iterator > > 
for_statement_r
 
boost::spirit::qi::rule
+< Iterator, while_statement(bool,
+var_origin),
+whitespace_grammar< Iterator > > 
while_statement_r
 
boost::spirit::qi::rule
+< Iterator, print_statement(var_origin),
+whitespace_grammar< Iterator > > 
print_statement_r
 
boost::spirit::qi::rule
+< Iterator, printable(var_origin),
+whitespace_grammar< Iterator > > 
printable_r
 
boost::spirit::qi::rule
+< Iterator, std::string(),
+whitespace_grammar< Iterator > > 
printable_string_r
 
boost::spirit::qi::rule
+< Iterator, std::string(),
+whitespace_grammar< Iterator > > 
identifier_r
 
boost::spirit::qi::rule
+< Iterator, std::vector
+< var_decl >
+), whitespace_grammar
+< Iterator > > 
local_var_decls_r
 
boost::spirit::qi::rule
+< Iterator, no_op_statement(),
+whitespace_grammar< Iterator > > 
no_op_statement_r
 
boost::spirit::qi::rule
+< Iterator, std::vector
+< expression >var_origin),
+whitespace_grammar< Iterator > > 
opt_dims_r
 
boost::spirit::qi::rule
+< Iterator, range(var_origin),
+whitespace_grammar< Iterator > > 
range_r
 
boost::spirit::qi::rule
+< Iterator, sample(bool,
+var_origin),
+whitespace_grammar< Iterator > > 
sample_r
 
boost::spirit::qi::rule
+< Iterator, statement(bool,
+var_origin),
+whitespace_grammar< Iterator > > 
statement_r
 
boost::spirit::qi::rule
+< Iterator,
+boost::spirit::qi::locals
+< std::vector< var_decl >
+ >, statements(bool,
+var_origin),
+whitespace_grammar< Iterator > > 
statement_seq_r
 
boost::spirit::qi::rule
+< Iterator, range(var_origin),
+whitespace_grammar< Iterator > > 
truncation_range_r
 
boost::spirit::qi::rule
+< Iterator, variable_dims(var_origin),
+whitespace_grammar< Iterator > > 
var_lhs_r
 
+

Detailed Description

+

template<typename Iterator>
+struct stan::gm::statement_grammar< Iterator >

+ + +

Definition at line 21 of file statement_grammar.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename Iterator >
+ + + + + + + + + + + + + + + + + + +
statement_grammar< Iterator >::statement_grammar (variable_mapvar_map,
std::stringstream & error_msgs 
)
+
+ +

Definition at line 429 of file statement_grammar_def.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator, assignment(var_origin), whitespace_grammar<Iterator> > stan::gm::statement_grammar< Iterator >::assignment_r
+
+ +

Definition at line 45 of file statement_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator, std::vector<expression>var_origin), whitespace_grammar<Iterator> > stan::gm::statement_grammar< Iterator >::dims_r
+
+ +

Definition at line 56 of file statement_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator, distribution(var_origin), whitespace_grammar<Iterator> > stan::gm::statement_grammar< Iterator >::distribution_r
+
+ +

Definition at line 62 of file statement_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
std::stringstream& stan::gm::statement_grammar< Iterator >::error_msgs_
+
+ +

Definition at line 34 of file statement_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
expression_grammar<Iterator> stan::gm::statement_grammar< Iterator >::expression_g
+
+ +

Definition at line 37 of file statement_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator, boost::spirit::qi::locals<std::string>, for_statement(bool,var_origin), whitespace_grammar<Iterator> > stan::gm::statement_grammar< Iterator >::for_statement_r
+
+ +

Definition at line 74 of file statement_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator, std::string(), whitespace_grammar<Iterator> > stan::gm::statement_grammar< Iterator >::identifier_r
+
+ +

Definition at line 103 of file statement_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator, increment_log_prob_statement(var_origin), whitespace_grammar<Iterator> > stan::gm::statement_grammar< Iterator >::increment_log_prob_statement_r
+
+ +

Definition at line 68 of file statement_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator, std::vector<var_decl>), whitespace_grammar<Iterator> > stan::gm::statement_grammar< Iterator >::local_var_decls_r
+
+ +

Definition at line 108 of file statement_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator, no_op_statement(), whitespace_grammar<Iterator> > stan::gm::statement_grammar< Iterator >::no_op_statement_r
+
+ +

Definition at line 113 of file statement_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator, expression(var_origin), whitespace_grammar<Iterator> > stan::gm::statement_grammar< Iterator >::non_lvalue_assign_r
+
+ +

Definition at line 50 of file statement_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator, std::vector<expression>var_origin), whitespace_grammar<Iterator> > stan::gm::statement_grammar< Iterator >::opt_dims_r
+
+ +

Definition at line 118 of file statement_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator, print_statement(var_origin), whitespace_grammar<Iterator> > stan::gm::statement_grammar< Iterator >::print_statement_r
+
+ +

Definition at line 86 of file statement_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator, printable(var_origin), whitespace_grammar<Iterator> > stan::gm::statement_grammar< Iterator >::printable_r
+
+ +

Definition at line 92 of file statement_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator, std::string(), whitespace_grammar<Iterator> > stan::gm::statement_grammar< Iterator >::printable_string_r
+
+ +

Definition at line 97 of file statement_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator, range(var_origin), whitespace_grammar<Iterator> > stan::gm::statement_grammar< Iterator >::range_r
+
+ +

Definition at line 123 of file statement_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator, sample(bool,var_origin), whitespace_grammar<Iterator> > stan::gm::statement_grammar< Iterator >::sample_r
+
+ +

Definition at line 128 of file statement_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
statement_2_grammar<Iterator> stan::gm::statement_grammar< Iterator >::statement_2_g
+
+ +

Definition at line 39 of file statement_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator, statement(bool,var_origin), whitespace_grammar<Iterator> > stan::gm::statement_grammar< Iterator >::statement_r
+
+ +

Definition at line 133 of file statement_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator, boost::spirit::qi::locals<std::vector<var_decl> >, statements(bool,var_origin), whitespace_grammar<Iterator> > stan::gm::statement_grammar< Iterator >::statement_seq_r
+
+ +

Definition at line 139 of file statement_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator, range(var_origin), whitespace_grammar<Iterator> > stan::gm::statement_grammar< Iterator >::truncation_range_r
+
+ +

Definition at line 144 of file statement_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
var_decls_grammar<Iterator> stan::gm::statement_grammar< Iterator >::var_decls_g
+
+ +

Definition at line 38 of file statement_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator, variable_dims(var_origin), whitespace_grammar<Iterator> > stan::gm::statement_grammar< Iterator >::var_lhs_r
+
+ +

Definition at line 149 of file statement_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
variable_map& stan::gm::statement_grammar< Iterator >::var_map_
+
+ +

Definition at line 33 of file statement_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator, while_statement(bool,var_origin), whitespace_grammar<Iterator> > stan::gm::statement_grammar< Iterator >::while_statement_r
+
+ +

Definition at line 80 of file statement_grammar.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1statement__grammar.png b/doc/api/html/structstan_1_1gm_1_1statement__grammar.png new file mode 100644 index 0000000000000000000000000000000000000000..775c0e3c639a44fdd69cb2ec9233cd5033ac5802 GIT binary patch literal 1445 zcmcJPdr;C@6vuzcO6r(a#;WDC>*mxZrv6;hQQRdH6j*Z%=!s8A5-l+lGtIKrHo<&A zsAQ?BspBK*VLnT730*UF1C@NcuDCw2T9nj`{pHO5*S~vb?!Di8&*z>wbI+N>@$>cG zY`DV^0D#SS9EJ!0x*(+e^kL9C_G|AJXfyZoA!D^#EhMMsm)IGw7vSe94qJ!VkrjlS^VW?2p!FuEf71*h%q_E9#&mOA~$sQIi|M%A2Q1lLZv?)5F8Gtbz`PZ)9L} za~Aw!rAp~`HOoU5=Ezu93+c`_7m9DbpNu%rD?z>%%VlM8R8u;-7YnRP&PpO(&5-;*f_eIE2$)bJq6-B?$BV2y=h81GA z4#|oq(%RT4Zy-ScK1%P~~_Ku{AwNMRTz3mF(&w=qeOP8Zc zgv+f`bO8y!<83jQG5gp$pleJo&T;jm;{D$8Fi8TAPZ#R1@E{K<1rNZyDuS%#MTu!u ze*!yP%emWJXpVQ}t6N@tq3A-SI6m*b>n`p_mG1d&!U%x*z1t)P%#%n}<^aq=T7b?r zO41Rwa&;U4lKWS*4#;G%VM<-n4F;wjQUN2e<+0C<mH2@DbM#9Cws}Ly!yKcZY z5U~Fnj>lkxDf*^c&l~ClLopeAIi~Yy=`(PQ_WR6u>f?7&a!ri(ABGetKM4Xo^;y)3 zh~3ND=BfNW+PF`nWvnMJt(4<^4k$|g6G`7gOOi>X?1OS4>Oy^3v+i&z>Ttq9NuoS^ zfA_hNTgD!*b6cB2W^A!*s=2gsI8!#VbS&A%--#xJiP1e>+oOAz1gq=Og&D6i2j9jq zx05jXVHD?As368)Gm1Nmsn|MMyu18SVyUn@Q*2ZA z`?v1|lsxWsM6vSMPHCHYic*3J=v_tjjY&)`a} zh66p!p^OrKZU{P)zqsjI;{nh9vRNt~b;>_%g>X_AK3N;6RW z*qQS_l?973Xz>EEd7I*Ly!Ae;Hg#Kx?I$$7!l(T(e~HpqN7W;0%z{4Kg!<)Fn@Iml bO4}8S%!7LlJy&@`Jr%%XeKFOCg0KAxC7Y+^ literal 0 HcmV?d00001 diff --git a/doc/api/html/structstan_1_1gm_1_1statement__visgen-members.html b/doc/api/html/structstan_1_1gm_1_1statement__visgen-members.html new file mode 100644 index 00000000000..28df7b66d9b --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1statement__visgen-members.html @@ -0,0 +1,130 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::statement_visgen Member List
+
+
+ +

This is the complete list of members for stan::gm::statement_visgen, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
include_sampling_stan::gm::statement_visgen
indent_stan::gm::statement_visgen
is_var_stan::gm::statement_visgen
o_stan::gm::visgen
operator()(nil const &) const stan::gm::statement_visgeninline
operator()(assignment const &x) const stan::gm::statement_visgeninline
operator()(expression const &x) const stan::gm::statement_visgeninline
operator()(sample const &x) const stan::gm::statement_visgeninline
operator()(const increment_log_prob_statement &x) const stan::gm::statement_visgeninline
operator()(const statements &x) const stan::gm::statement_visgeninline
operator()(const print_statement &ps) const stan::gm::statement_visgeninline
operator()(const for_statement &x) const stan::gm::statement_visgeninline
operator()(const while_statement &x) const stan::gm::statement_visgeninline
operator()(const conditional_statement &x) const stan::gm::statement_visgeninline
operator()(const no_op_statement &) const stan::gm::statement_visgeninline
result_type typedefstan::gm::visgen
statement_visgen(size_t indent, bool include_sampling, bool is_var, std::ostream &o)stan::gm::statement_visgeninline
visgen(std::ostream &o)stan::gm::visgeninline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1statement__visgen.html b/doc/api/html/structstan_1_1gm_1_1statement__visgen.html new file mode 100644 index 00000000000..4293fe4d4d7 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1statement__visgen.html @@ -0,0 +1,558 @@ + + + + + +Stan: stan::gm::statement_visgen Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::statement_visgen Struct Reference
+
+
+ +

#include <generator.hpp>

+
+Inheritance diagram for stan::gm::statement_visgen:
+
+
+ + +stan::gm::visgen + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 statement_visgen (size_t indent, bool include_sampling, bool is_var, std::ostream &o)
 
void operator() (nil const &) const
 
void operator() (assignment const &x) const
 
void operator() (expression const &x) const
 
void operator() (sample const &x) const
 
void operator() (const increment_log_prob_statement &x) const
 
void operator() (const statements &x) const
 
void operator() (const print_statement &ps) const
 
void operator() (const for_statement &x) const
 
void operator() (const while_statement &x) const
 
void operator() (const conditional_statement &x) const
 
void operator() (const no_op_statement &) const
 
- Public Member Functions inherited from stan::gm::visgen
 visgen (std::ostream &o)
 
+ + + + + + + + + + +

+Public Attributes

size_t indent_
 
bool include_sampling_
 
bool is_var_
 
- Public Attributes inherited from stan::gm::visgen
std::ostream & o_
 
+ + + + +

+Additional Inherited Members

- Public Types inherited from stan::gm::visgen
typedef void result_type
 
+

Detailed Description

+
+

Definition at line 1396 of file generator.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::gm::statement_visgen::statement_visgen (size_t indent,
bool include_sampling,
bool is_var,
std::ostream & o 
)
+
+inline
+
+ +

Definition at line 1400 of file generator.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::statement_visgen::operator() (nil const & ) const
+
+inline
+
+ +

Definition at line 1409 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::statement_visgen::operator() (assignment const & x) const
+
+inline
+
+ +

Definition at line 1411 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::statement_visgen::operator() (expression const & x) const
+
+inline
+
+ +

Definition at line 1423 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::statement_visgen::operator() (sample const & x) const
+
+inline
+
+ +

Definition at line 1426 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::statement_visgen::operator() (const increment_log_prob_statementx) const
+
+inline
+
+ +

Definition at line 1500 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::statement_visgen::operator() (const statementsx) const
+
+inline
+
+ +

Definition at line 1506 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::statement_visgen::operator() (const print_statementps) const
+
+inline
+
+ +

Definition at line 1524 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::statement_visgen::operator() (const for_statementx) const
+
+inline
+
+ +

Definition at line 1538 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::statement_visgen::operator() (const while_statementx) const
+
+inline
+
+ +

Definition at line 1549 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::statement_visgen::operator() (const conditional_statementx) const
+
+inline
+
+ +

Definition at line 1558 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::statement_visgen::operator() (const no_op_statement) const
+
+inline
+
+ +

Definition at line 1581 of file generator.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
bool stan::gm::statement_visgen::include_sampling_
+
+ +

Definition at line 1398 of file generator.hpp.

+ +
+
+ +
+
+ + + + +
size_t stan::gm::statement_visgen::indent_
+
+ +

Definition at line 1397 of file generator.hpp.

+ +
+
+ +
+
+ + + + +
bool stan::gm::statement_visgen::is_var_
+
+ +

Definition at line 1399 of file generator.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1statement__visgen.png b/doc/api/html/structstan_1_1gm_1_1statement__visgen.png new file mode 100644 index 0000000000000000000000000000000000000000..cdbf235904ccb25abcc3a94bb66c953cc51c95dd GIT binary patch literal 675 zcmeAS@N?(olHy`uVBq!ia0vp^^MN>kgBeH~REKW{QW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;3ckXw8c#csebIHq}8N0tR#=o9ftMW4H z*yrmXLZ5H65^+5Bdi(F$&%UqlnRi~nboGs0pR3F3RWsM@JbkF3@!kRR@a~sgo?6#r zzjo_RUZQx@Vc~&uzK4uZbR*Tg9NW=IBqk{;iDS&#NEl z^6s#je_sE9|C1VqGE4b}*mLX&(?2ubc#4yIz5ckk69;!U!-h3;_z&nkXWp>-q49yV z>D$k#H-CTmPgnlHR-^l$S5@9^&8*(5ap-8ZM()$ghnAN4wWV(O@mIlD?PKDu7k)eW z_hsz;z2wf*u3L_rA+Mj*NL)MUS5w+_YR}WtvL}}PEpVRhckkI^;SDR(r|y3DKJKyQ zzCQ0i-df#3Y})Z`fG(w|?2|gueAzW(}eDnFFSMjBPsk y>uVCzon?VdKmRfP*$egC>(bS20*5yJV!COl + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::statements Member List
+
+
+ +

This is the complete list of members for stan::gm::statements, including all inherited members.

+ + + + + +
local_decl_stan::gm::statements
statements()stan::gm::statements
statements(const std::vector< var_decl > &local_decl, const std::vector< statement > &stmts)stan::gm::statements
statements_stan::gm::statements
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1statements.html b/doc/api/html/structstan_1_1gm_1_1statements.html new file mode 100644 index 00000000000..a328a6bf91d --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1statements.html @@ -0,0 +1,212 @@ + + + + + +Stan: stan::gm::statements Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::statements Struct Reference
+
+
+ +

#include <ast.hpp>

+ + + + + + +

+Public Member Functions

 statements ()
 
 statements (const std::vector< var_decl > &local_decl, const std::vector< statement > &stmts)
 
+ + + + + +

+Public Attributes

std::vector< var_decllocal_decl_
 
std::vector< statementstatements_
 
+

Detailed Description

+
+

Definition at line 162 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::statements::statements ()
+
+ +

Definition at line 323 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
stan::gm::statements::statements (const std::vector< var_decl > & local_decl,
const std::vector< statement > & stmts 
)
+
+ +

Definition at line 324 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
std::vector<var_decl> stan::gm::statements::local_decl_
+
+ +

Definition at line 163 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
std::vector<statement> stan::gm::statements::statements_
+
+ +

Definition at line 164 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1subtraction__expr-members.html b/doc/api/html/structstan_1_1gm_1_1subtraction__expr-members.html new file mode 100644 index 00000000000..3d769d78f1a --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1subtraction__expr-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::subtraction_expr Member List
+
+
+ +

This is the complete list of members for stan::gm::subtraction_expr, including all inherited members.

+ + +
operator()(expression &expr1, const expression &expr2, std::ostream &error_msgs) const stan::gm::subtraction_exprinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1subtraction__expr.html b/doc/api/html/structstan_1_1gm_1_1subtraction__expr.html new file mode 100644 index 00000000000..0e9d7ad21c1 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1subtraction__expr.html @@ -0,0 +1,175 @@ + + + + + +Stan: stan::gm::subtraction_expr Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::subtraction_expr Struct Reference
+
+
+ +

#include <expression_grammar_def.hpp>

+ + + + +

+Classes

struct  result
 
+ + + +

+Public Member Functions

expression operator() (expression &expr1, const expression &expr2, std::ostream &error_msgs) const
 
+

Detailed Description

+
+

Definition at line 143 of file expression_grammar_def.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
expression stan::gm::subtraction_expr::operator() (expressionexpr1,
const expressionexpr2,
std::ostream & error_msgs 
) const
+
+inline
+
+ +

Definition at line 147 of file expression_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1subtraction__expr_1_1result-members.html b/doc/api/html/structstan_1_1gm_1_1subtraction__expr_1_1result-members.html new file mode 100644 index 00000000000..1fade16b625 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1subtraction__expr_1_1result-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::subtraction_expr::result< T1, T2, T3 > Member List
+
+
+ +

This is the complete list of members for stan::gm::subtraction_expr::result< T1, T2, T3 >, including all inherited members.

+ + +
type typedefstan::gm::subtraction_expr::result< T1, T2, T3 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1subtraction__expr_1_1result.html b/doc/api/html/structstan_1_1gm_1_1subtraction__expr_1_1result.html new file mode 100644 index 00000000000..251ecbc2971 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1subtraction__expr_1_1result.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::gm::subtraction_expr::result< T1, T2, T3 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::subtraction_expr::result< T1, T2, T3 > Struct Template Reference
+
+
+ +

#include <expression_grammar_def.hpp>

+ + + + +

+Public Types

typedef expression type
 
+

Detailed Description

+

template<typename T1, typename T2, typename T3>
+struct stan::gm::subtraction_expr::result< T1, T2, T3 >

+ + +

Definition at line 145 of file expression_grammar_def.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 , typename T3 >
+ + + + +
typedef expression stan::gm::subtraction_expr::result< T1, T2, T3 >::type
+
+ +

Definition at line 145 of file expression_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1term__grammar-members.html b/doc/api/html/structstan_1_1gm_1_1term__grammar-members.html new file mode 100644 index 00000000000..6edb70fafb6 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1term__grammar-members.html @@ -0,0 +1,127 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::term_grammar< Iterator > Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1term__grammar.html b/doc/api/html/structstan_1_1gm_1_1term__grammar.html new file mode 100644 index 00000000000..c6f2aee5917 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1term__grammar.html @@ -0,0 +1,459 @@ + + + + + +Stan: stan::gm::term_grammar< Iterator > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::term_grammar< Iterator > Struct Template Reference
+
+
+ +

#include <term_grammar.hpp>

+
+Inheritance diagram for stan::gm::term_grammar< Iterator >:
+
+
+ + + +
+ + + + +

+Public Member Functions

 term_grammar (variable_map &var_map, std::stringstream &error_msgs, expression_grammar< Iterator > &eg)
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Attributes

variable_mapvar_map_
 
std::stringstream & error_msgs_
 
stan::gm::expression_grammar
+< Iterator > & 
expression_g
 
boost::spirit::qi::rule
+< Iterator, std::vector
+< expression >var_origin),
+whitespace_grammar< Iterator > > 
args_r
 
boost::spirit::qi::rule
+< Iterator, std::vector
+< expression >var_origin),
+whitespace_grammar< Iterator > > 
dims_r
 
boost::spirit::qi::rule
+< Iterator, double_literal(),
+whitespace_grammar< Iterator > > 
double_literal_r
 
boost::spirit::qi::rule
+< Iterator,
+boost::spirit::qi::locals
+< bool >, expression(var_origin),
+whitespace_grammar< Iterator > > 
factor_r
 
boost::spirit::qi::rule
+< Iterator, fun(var_origin),
+whitespace_grammar< Iterator > > 
fun_r
 
boost::spirit::qi::rule
+< Iterator, std::string(),
+whitespace_grammar< Iterator > > 
identifier_r
 
boost::spirit::qi::rule
+< Iterator, expression(var_origin),
+whitespace_grammar< Iterator > > 
indexed_factor_r
 
boost::spirit::qi::rule
+< Iterator, int_literal(),
+whitespace_grammar< Iterator > > 
int_literal_r
 
boost::spirit::qi::rule
+< Iterator, expression(var_origin),
+whitespace_grammar< Iterator > > 
negated_factor_r
 
boost::spirit::qi::rule
+< Iterator, expression(var_origin),
+whitespace_grammar< Iterator > > 
term_r
 
boost::spirit::qi::rule
+< Iterator, variable(),
+whitespace_grammar< Iterator > > 
variable_r
 
+

Detailed Description

+

template<typename Iterator>
+struct stan::gm::term_grammar< Iterator >

+ + +

Definition at line 25 of file term_grammar.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename Iterator >
+ + + + + + + + + + + + + + + + + + + + + + + + +
term_grammar< Iterator >::term_grammar (variable_mapvar_map,
std::stringstream & error_msgs,
expression_grammar< Iterator > & eg 
)
+
+ +

Definition at line 430 of file term_grammar_def.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, std::vector<expression>var_origin), whitespace_grammar<Iterator> > stan::gm::term_grammar< Iterator >::args_r
+
+ +

Definition at line 44 of file term_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, std::vector<expression>var_origin), whitespace_grammar<Iterator> > stan::gm::term_grammar< Iterator >::dims_r
+
+ +

Definition at line 50 of file term_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, double_literal(), whitespace_grammar<Iterator> > stan::gm::term_grammar< Iterator >::double_literal_r
+
+ +

Definition at line 56 of file term_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
std::stringstream& stan::gm::term_grammar< Iterator >::error_msgs_
+
+ +

Definition at line 36 of file term_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
stan::gm::expression_grammar<Iterator>& stan::gm::term_grammar< Iterator >::expression_g
+
+ +

Definition at line 38 of file term_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, boost::spirit::qi::locals<bool>, expression(var_origin), whitespace_grammar<Iterator> > stan::gm::term_grammar< Iterator >::factor_r
+
+ +

Definition at line 63 of file term_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, fun(var_origin), whitespace_grammar<Iterator> > stan::gm::term_grammar< Iterator >::fun_r
+
+ +

Definition at line 69 of file term_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, std::string(), whitespace_grammar<Iterator> > stan::gm::term_grammar< Iterator >::identifier_r
+
+ +

Definition at line 75 of file term_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, expression(var_origin), whitespace_grammar<Iterator> > stan::gm::term_grammar< Iterator >::indexed_factor_r
+
+ +

Definition at line 81 of file term_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, int_literal(), whitespace_grammar<Iterator> > stan::gm::term_grammar< Iterator >::int_literal_r
+
+ +

Definition at line 87 of file term_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, expression(var_origin), whitespace_grammar<Iterator> > stan::gm::term_grammar< Iterator >::negated_factor_r
+
+ +

Definition at line 93 of file term_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, expression(var_origin), whitespace_grammar<Iterator> > stan::gm::term_grammar< Iterator >::term_r
+
+ +

Definition at line 99 of file term_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
variable_map& stan::gm::term_grammar< Iterator >::var_map_
+
+ +

Definition at line 34 of file term_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, variable(), whitespace_grammar<Iterator> > stan::gm::term_grammar< Iterator >::variable_r
+
+ +

Definition at line 105 of file term_grammar.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1term__grammar.png b/doc/api/html/structstan_1_1gm_1_1term__grammar.png new file mode 100644 index 0000000000000000000000000000000000000000..ff073754ff68c9d138348c0af9da6ed8aa263945 GIT binary patch literal 1363 zcmeAS@N?(olHy`uVBq!ia0y~yV3Gu~12~w0WHZln6CfoK;1lBd|Nnm=^TnI5rTvE{ z09jys;J^Xa&O7ozE=Ng_UoZnu5eQs86=KA|!1Bn`#WAFU@$KBZNso1ST>A5@-v2)q zA9Xu|Y0mt-Nq^_aP7k(LVCitYBP5upq~zoBrgegfvZtDDSeuHZ=c)+FNhvBTlTtk< zO1y?N!kzm;An?SHe||Gsh3_v%!e zSguJ$l`D-@R(^7i%lG~A3#B;e5=m;l*;kConKbJWHoyCO`s*k zUQ2mN%rixqV|Sq6N{d8O6a zrG|mW(xfJF?ObT;f9`Vc=2;@<#eNUatE3Vi zzwP~=^HOK~)SesZ%S2}7DxGwVpS^B!$&cN2hjTYw>pL~WSEDyv$>^*hyOq}A_krhp zOHY^|@tee#acaVn-#acY%&xn!SH<>7NlW^AuSr~wUB5N7Tl>b#TYFkPSb9q0(;5}q z**_W1M_zqeQENZR%W{vs%1gO*H}ahKsg_MDIg(v`Ol8%iFKlx1-xtnZ`?|`r=~wl} z-&>7TPI_E&Pex8w$my*p(9NZ#v%}ygqrvOXtO*P}8^pDl4={-A+o!|Jz&s@>l|iE6 zkgLQrwg$$cjYbSS4*jK!2@G0cK>msdNd~qBU=>|c=_}|~2g*M{ckdNoU_0=nClTb# zCNxJBxux2eJPy};|ET)iKViSwQyD*auiew!-d!qR1O6LA}}8pKjc`_5P~krzr$!gK| zDH|p3hq)C?O*nn)f{@Sho+tZuyqH?3mpkX3)SB%l?^-4s%+Od|ZV>0*Zn?Pl=^Vxn ze!up@Y3xR&xfz?6rWR#Pgg&ebxsLQ E02d&6KmY&$ literal 0 HcmV?d00001 diff --git a/doc/api/html/structstan_1_1gm_1_1transpose__expr-members.html b/doc/api/html/structstan_1_1gm_1_1transpose__expr-members.html new file mode 100644 index 00000000000..3e16f4afbf1 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1transpose__expr-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::transpose_expr Member List
+
+
+ +

This is the complete list of members for stan::gm::transpose_expr, including all inherited members.

+ + +
operator()(const expression &expr, std::ostream &error_msgs) const stan::gm::transpose_exprinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1transpose__expr.html b/doc/api/html/structstan_1_1gm_1_1transpose__expr.html new file mode 100644 index 00000000000..e278a1635ef --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1transpose__expr.html @@ -0,0 +1,169 @@ + + + + + +Stan: stan::gm::transpose_expr Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::transpose_expr Struct Reference
+
+
+ +

#include <term_grammar_def.hpp>

+ + + + +

+Classes

struct  result
 
+ + + +

+Public Member Functions

expression operator() (const expression &expr, std::ostream &error_msgs) const
 
+

Detailed Description

+
+

Definition at line 324 of file term_grammar_def.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
expression stan::gm::transpose_expr::operator() (const expressionexpr,
std::ostream & error_msgs 
) const
+
+inline
+
+ +

Definition at line 328 of file term_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1transpose__expr_1_1result-members.html b/doc/api/html/structstan_1_1gm_1_1transpose__expr_1_1result-members.html new file mode 100644 index 00000000000..48d0a9283aa --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1transpose__expr_1_1result-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::transpose_expr::result< T1, T2 > Member List
+
+
+ +

This is the complete list of members for stan::gm::transpose_expr::result< T1, T2 >, including all inherited members.

+ + +
type typedefstan::gm::transpose_expr::result< T1, T2 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1transpose__expr_1_1result.html b/doc/api/html/structstan_1_1gm_1_1transpose__expr_1_1result.html new file mode 100644 index 00000000000..8d912ed9c23 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1transpose__expr_1_1result.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::gm::transpose_expr::result< T1, T2 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::transpose_expr::result< T1, T2 > Struct Template Reference
+
+
+ +

#include <term_grammar_def.hpp>

+ + + + +

+Public Types

typedef expression type
 
+

Detailed Description

+

template<typename T1, typename T2>
+struct stan::gm::transpose_expr::result< T1, T2 >

+ + +

Definition at line 326 of file term_grammar_def.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 >
+ + + + +
typedef expression stan::gm::transpose_expr::result< T1, T2 >::type
+
+ +

Definition at line 326 of file term_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1type__name-members.html b/doc/api/html/structstan_1_1gm_1_1type__name-members.html new file mode 100644 index 00000000000..88ac011cf85 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1type__name-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::type_name< T > Member List
+
+
+ +

This is the complete list of members for stan::gm::type_name< T >, including all inherited members.

+ + +
name()stan::gm::type_name< T >inlinestatic
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1type__name.html b/doc/api/html/structstan_1_1gm_1_1type__name.html new file mode 100644 index 00000000000..23ed247eaf2 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1type__name.html @@ -0,0 +1,157 @@ + + + + + +Stan: stan::gm::type_name< T > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::type_name< T > Struct Template Reference
+
+
+ +

#include <singleton_argument.hpp>

+ + + + +

+Static Public Member Functions

static std::string name ()
 
+

Detailed Description

+

template<typename T>
+struct stan::gm::type_name< T >

+ + +

Definition at line 13 of file singleton_argument.hpp.

+

Member Function Documentation

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
static std::string stan::gm::type_name< T >::name ()
+
+inlinestatic
+
+ +

Definition at line 14 of file singleton_argument.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1type__name_3_01bool_01_4-members.html b/doc/api/html/structstan_1_1gm_1_1type__name_3_01bool_01_4-members.html new file mode 100644 index 00000000000..062de7f5a1e --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1type__name_3_01bool_01_4-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::type_name< bool > Member List
+
+
+ +

This is the complete list of members for stan::gm::type_name< bool >, including all inherited members.

+ + +
name()stan::gm::type_name< bool >inlinestatic
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1type__name_3_01bool_01_4.html b/doc/api/html/structstan_1_1gm_1_1type__name_3_01bool_01_4.html new file mode 100644 index 00000000000..5fc3c7e3f1a --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1type__name_3_01bool_01_4.html @@ -0,0 +1,155 @@ + + + + + +Stan: stan::gm::type_name< bool > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::type_name< bool > Struct Template Reference
+
+
+ +

#include <singleton_argument.hpp>

+ + + + +

+Static Public Member Functions

static std::string name ()
 
+

Detailed Description

+

template<>
+struct stan::gm::type_name< bool >

+ + +

Definition at line 34 of file singleton_argument.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + +
static std::string stan::gm::type_name< bool >::name ()
+
+inlinestatic
+
+ +

Definition at line 35 of file singleton_argument.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1type__name_3_01double_01_4-members.html b/doc/api/html/structstan_1_1gm_1_1type__name_3_01double_01_4-members.html new file mode 100644 index 00000000000..ecede97daee --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1type__name_3_01double_01_4-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::type_name< double > Member List
+
+
+ +

This is the complete list of members for stan::gm::type_name< double >, including all inherited members.

+ + +
name()stan::gm::type_name< double >inlinestatic
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1type__name_3_01double_01_4.html b/doc/api/html/structstan_1_1gm_1_1type__name_3_01double_01_4.html new file mode 100644 index 00000000000..03a5c138621 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1type__name_3_01double_01_4.html @@ -0,0 +1,155 @@ + + + + + +Stan: stan::gm::type_name< double > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::type_name< double > Struct Template Reference
+
+
+ +

#include <singleton_argument.hpp>

+ + + + +

+Static Public Member Functions

static std::string name ()
 
+

Detailed Description

+

template<>
+struct stan::gm::type_name< double >

+ + +

Definition at line 29 of file singleton_argument.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + +
static std::string stan::gm::type_name< double >::name ()
+
+inlinestatic
+
+ +

Definition at line 30 of file singleton_argument.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1type__name_3_01int_01_4-members.html b/doc/api/html/structstan_1_1gm_1_1type__name_3_01int_01_4-members.html new file mode 100644 index 00000000000..26f2b7a1059 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1type__name_3_01int_01_4-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::type_name< int > Member List
+
+
+ +

This is the complete list of members for stan::gm::type_name< int >, including all inherited members.

+ + +
name()stan::gm::type_name< int >inlinestatic
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1type__name_3_01int_01_4.html b/doc/api/html/structstan_1_1gm_1_1type__name_3_01int_01_4.html new file mode 100644 index 00000000000..1481e259708 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1type__name_3_01int_01_4.html @@ -0,0 +1,155 @@ + + + + + +Stan: stan::gm::type_name< int > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::type_name< int > Struct Template Reference
+
+
+ +

#include <singleton_argument.hpp>

+ + + + +

+Static Public Member Functions

static std::string name ()
 
+

Detailed Description

+

template<>
+struct stan::gm::type_name< int >

+ + +

Definition at line 19 of file singleton_argument.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + +
static std::string stan::gm::type_name< int >::name ()
+
+inlinestatic
+
+ +

Definition at line 20 of file singleton_argument.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1type__name_3_01std_1_1string_01_4-members.html b/doc/api/html/structstan_1_1gm_1_1type__name_3_01std_1_1string_01_4-members.html new file mode 100644 index 00000000000..1ef5e0864cd --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1type__name_3_01std_1_1string_01_4-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::type_name< std::string > Member List
+
+
+ +

This is the complete list of members for stan::gm::type_name< std::string >, including all inherited members.

+ + +
name()stan::gm::type_name< std::string >inlinestatic
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1type__name_3_01std_1_1string_01_4.html b/doc/api/html/structstan_1_1gm_1_1type__name_3_01std_1_1string_01_4.html new file mode 100644 index 00000000000..e692b36fb86 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1type__name_3_01std_1_1string_01_4.html @@ -0,0 +1,155 @@ + + + + + +Stan: stan::gm::type_name< std::string > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::type_name< std::string > Struct Template Reference
+
+
+ +

#include <singleton_argument.hpp>

+ + + + +

+Static Public Member Functions

static std::string name ()
 
+

Detailed Description

+

template<>
+struct stan::gm::type_name< std::string >

+ + +

Definition at line 39 of file singleton_argument.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + +
static std::string stan::gm::type_name< std::string >::name ()
+
+inlinestatic
+
+ +

Definition at line 40 of file singleton_argument.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1type__name_3_01unsigned_01int_01_4-members.html b/doc/api/html/structstan_1_1gm_1_1type__name_3_01unsigned_01int_01_4-members.html new file mode 100644 index 00000000000..2499930b462 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1type__name_3_01unsigned_01int_01_4-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::type_name< unsigned int > Member List
+
+
+ +

This is the complete list of members for stan::gm::type_name< unsigned int >, including all inherited members.

+ + +
name()stan::gm::type_name< unsigned int >inlinestatic
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1type__name_3_01unsigned_01int_01_4.html b/doc/api/html/structstan_1_1gm_1_1type__name_3_01unsigned_01int_01_4.html new file mode 100644 index 00000000000..0c3357bef56 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1type__name_3_01unsigned_01int_01_4.html @@ -0,0 +1,155 @@ + + + + + +Stan: stan::gm::type_name< unsigned int > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::type_name< unsigned int > Struct Template Reference
+
+
+ +

#include <singleton_argument.hpp>

+ + + + +

+Static Public Member Functions

static std::string name ()
 
+

Detailed Description

+

template<>
+struct stan::gm::type_name< unsigned int >

+ + +

Definition at line 24 of file singleton_argument.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + +
static std::string stan::gm::type_name< unsigned int >::name ()
+
+inlinestatic
+
+ +

Definition at line 25 of file singleton_argument.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1unary__op-members.html b/doc/api/html/structstan_1_1gm_1_1unary__op-members.html new file mode 100644 index 00000000000..240f695023e --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1unary__op-members.html @@ -0,0 +1,116 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::unary_op Member List
+
+
+ +

This is the complete list of members for stan::gm::unary_op, including all inherited members.

+ + + + + +
opstan::gm::unary_op
subjectstan::gm::unary_op
type_stan::gm::unary_op
unary_op(char op, expression const &subject)stan::gm::unary_op
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1unary__op.html b/doc/api/html/structstan_1_1gm_1_1unary__op.html new file mode 100644 index 00000000000..5c6785cc445 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1unary__op.html @@ -0,0 +1,209 @@ + + + + + +Stan: stan::gm::unary_op Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::unary_op Struct Reference
+
+
+ +

#include <ast.hpp>

+ + + + +

+Public Member Functions

 unary_op (char op, expression const &subject)
 
+ + + + + + + +

+Public Attributes

char op
 
expression subject
 
expr_type type_
 
+

Detailed Description

+
+

Definition at line 350 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + + + + + + + + + + + + +
stan::gm::unary_op::unary_op (char op,
expression const & subject 
)
+
+ +

Definition at line 637 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
char stan::gm::unary_op::op
+
+ +

Definition at line 351 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
expression stan::gm::unary_op::subject
+
+ +

Definition at line 352 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
expr_type stan::gm::unary_op::type_
+
+ +

Definition at line 353 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1unconstrained__param__names__visgen-members.html b/doc/api/html/structstan_1_1gm_1_1unconstrained__param__names__visgen-members.html new file mode 100644 index 00000000000..ce1e63fdef6 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1unconstrained__param__names__visgen-members.html @@ -0,0 +1,130 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::unconstrained_param_names_visgen Member List
+
+
+ +

This is the complete list of members for stan::gm::unconstrained_param_names_visgen, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
generate_param_names_array(const std::vector< expression > &matrix_dims, const std::string &name, const std::vector< expression > &dims) const stan::gm::unconstrained_param_names_visgeninline
o_stan::gm::visgen
operator()(const nil &) const stan::gm::unconstrained_param_names_visgeninline
operator()(const int_var_decl &x) const stan::gm::unconstrained_param_names_visgeninline
operator()(const double_var_decl &x) const stan::gm::unconstrained_param_names_visgeninline
operator()(const vector_var_decl &x) const stan::gm::unconstrained_param_names_visgeninline
operator()(const row_vector_var_decl &x) const stan::gm::unconstrained_param_names_visgeninline
operator()(const matrix_var_decl &x) const stan::gm::unconstrained_param_names_visgeninline
operator()(const unit_vector_var_decl &x) const stan::gm::unconstrained_param_names_visgeninline
operator()(const simplex_var_decl &x) const stan::gm::unconstrained_param_names_visgeninline
operator()(const ordered_var_decl &x) const stan::gm::unconstrained_param_names_visgeninline
operator()(const positive_ordered_var_decl &x) const stan::gm::unconstrained_param_names_visgeninline
operator()(const cholesky_factor_var_decl &x) const stan::gm::unconstrained_param_names_visgeninline
operator()(const cov_matrix_var_decl &x) const stan::gm::unconstrained_param_names_visgeninline
operator()(const corr_matrix_var_decl &x) const stan::gm::unconstrained_param_names_visgeninline
result_type typedefstan::gm::visgen
unconstrained_param_names_visgen(std::ostream &o)stan::gm::unconstrained_param_names_visgeninline
visgen(std::ostream &o)stan::gm::visgeninline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1unconstrained__param__names__visgen.html b/doc/api/html/structstan_1_1gm_1_1unconstrained__param__names__visgen.html new file mode 100644 index 00000000000..03bdf46c50c --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1unconstrained__param__names__visgen.html @@ -0,0 +1,583 @@ + + + + + +Stan: stan::gm::unconstrained_param_names_visgen Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::unconstrained_param_names_visgen Struct Reference
+
+
+ +

#include <generator.hpp>

+
+Inheritance diagram for stan::gm::unconstrained_param_names_visgen:
+
+
+ + +stan::gm::visgen + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 unconstrained_param_names_visgen (std::ostream &o)
 
void operator() (const nil &) const
 
void operator() (const int_var_decl &x) const
 
void operator() (const double_var_decl &x) const
 
void operator() (const vector_var_decl &x) const
 
void operator() (const row_vector_var_decl &x) const
 
void operator() (const matrix_var_decl &x) const
 
void operator() (const unit_vector_var_decl &x) const
 
void operator() (const simplex_var_decl &x) const
 
void operator() (const ordered_var_decl &x) const
 
void operator() (const positive_ordered_var_decl &x) const
 
void operator() (const cholesky_factor_var_decl &x) const
 
void operator() (const cov_matrix_var_decl &x) const
 
void operator() (const corr_matrix_var_decl &x) const
 
void generate_param_names_array (const std::vector< expression > &matrix_dims, const std::string &name, const std::vector< expression > &dims) const
 
- Public Member Functions inherited from stan::gm::visgen
 visgen (std::ostream &o)
 
+ + + + + + + +

+Additional Inherited Members

- Public Types inherited from stan::gm::visgen
typedef void result_type
 
- Public Attributes inherited from stan::gm::visgen
std::ostream & o_
 
+

Detailed Description

+
+

Definition at line 3094 of file generator.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::gm::unconstrained_param_names_visgen::unconstrained_param_names_visgen (std::ostream & o)
+
+inline
+
+ +

Definition at line 3095 of file generator.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::unconstrained_param_names_visgen::generate_param_names_array (const std::vector< expression > & matrix_dims,
const std::string & name,
const std::vector< expression > & dims 
) const
+
+inline
+
+ +

Definition at line 3186 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::unconstrained_param_names_visgen::operator() (const nil) const
+
+inline
+
+ +

Definition at line 3098 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::unconstrained_param_names_visgen::operator() (const int_var_declx) const
+
+inline
+
+ +

Definition at line 3099 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::unconstrained_param_names_visgen::operator() (const double_var_declx) const
+
+inline
+
+ +

Definition at line 3102 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::unconstrained_param_names_visgen::operator() (const vector_var_declx) const
+
+inline
+
+ +

Definition at line 3105 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::unconstrained_param_names_visgen::operator() (const row_vector_var_declx) const
+
+inline
+
+ +

Definition at line 3110 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::unconstrained_param_names_visgen::operator() (const matrix_var_declx) const
+
+inline
+
+ +

Definition at line 3115 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::unconstrained_param_names_visgen::operator() (const unit_vector_var_declx) const
+
+inline
+
+ +

Definition at line 3121 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::unconstrained_param_names_visgen::operator() (const simplex_var_declx) const
+
+inline
+
+ +

Definition at line 3126 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::unconstrained_param_names_visgen::operator() (const ordered_var_declx) const
+
+inline
+
+ +

Definition at line 3131 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::unconstrained_param_names_visgen::operator() (const positive_ordered_var_declx) const
+
+inline
+
+ +

Definition at line 3136 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::unconstrained_param_names_visgen::operator() (const cholesky_factor_var_declx) const
+
+inline
+
+ +

Definition at line 3141 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::unconstrained_param_names_visgen::operator() (const cov_matrix_var_declx) const
+
+inline
+
+ +

Definition at line 3160 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::unconstrained_param_names_visgen::operator() (const corr_matrix_var_declx) const
+
+inline
+
+ +

Definition at line 3173 of file generator.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1unconstrained__param__names__visgen.png b/doc/api/html/structstan_1_1gm_1_1unconstrained__param__names__visgen.png new file mode 100644 index 0000000000000000000000000000000000000000..8eb645c3cfab2265d2e6c558329fbe441f3620a8 GIT binary patch literal 872 zcmeAS@N?(olHy`uVBq!ia0y~yU=#qd12~w07TXg&wq7& zLyoO^hMqld@5+XouRPGB=PvbfYHH-Pf}a~bf-L?sb*O|hOnkznFe!%7WzuU+he;~6 zm+enZTyp(UzkcJIQtnW?dH&xw!Gh-Q}XVsSZfku_b=QD4b8lX8dIr|H* z$EC%!e;3{oJ7nIlWu~h8q;(%RpP#_yQMxRoblQ?d_3Ki;ML&!9UDU0za-wb9_A~ME zMw3jw?>re>ec4N^N_9f<>e`?4CZtro+PU+8;*$PzR(XwAj90ncX3~_te#|&$ z-ST%U?|SEFd#u-z{GC6;qWg{5s4qxfPSsl)rc^|NEU;g0;k9pWJ~zJedtVVJlW1J~_YI z;oUq%d!|cm&*qw0IzLn0JpTpz`63myjF9<>Z*?F4zTE%6@Z6JWlB#^(%YIqyNadRF zQP)^UvSH`>V~l@Jt$+JMX2Px$jCvp5Hmv@}b>M`h(1X78g_kAg-ceNF&HiKS{L7bf v+@5>0J+LoeV2ptW=yfiYrBegTe~DWM4fmiCJ6 literal 0 HcmV?d00001 diff --git a/doc/api/html/structstan_1_1gm_1_1unit__vector__var__decl-members.html b/doc/api/html/structstan_1_1gm_1_1unit__vector__var__decl-members.html new file mode 100644 index 00000000000..31a43edcd53 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1unit__vector__var__decl-members.html @@ -0,0 +1,121 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::unit_vector_var_decl Member List
+
+
+ +

This is the complete list of members for stan::gm::unit_vector_var_decl, including all inherited members.

+ + + + + + + + + + +
base_type_stan::gm::base_var_decl
base_var_decl()stan::gm::base_var_decl
base_var_decl(const base_expr_type &base_type)stan::gm::base_var_decl
base_var_decl(const std::string &name, const std::vector< expression > &dims, const base_expr_type &base_type)stan::gm::base_var_decl
dims_stan::gm::base_var_decl
K_stan::gm::unit_vector_var_decl
name_stan::gm::base_var_decl
unit_vector_var_decl()stan::gm::unit_vector_var_decl
unit_vector_var_decl(expression const &K, std::string const &name, std::vector< expression > const &dims)stan::gm::unit_vector_var_decl
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1unit__vector__var__decl.html b/doc/api/html/structstan_1_1gm_1_1unit__vector__var__decl.html new file mode 100644 index 00000000000..a4e957c5646 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1unit__vector__var__decl.html @@ -0,0 +1,225 @@ + + + + + +Stan: stan::gm::unit_vector_var_decl Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::unit_vector_var_decl Struct Reference
+
+
+ +

#include <ast.hpp>

+
+Inheritance diagram for stan::gm::unit_vector_var_decl:
+
+
+ + +stan::gm::base_var_decl + +
+ + + + + + + + + + + + + +

+Public Member Functions

 unit_vector_var_decl ()
 
 unit_vector_var_decl (expression const &K, std::string const &name, std::vector< expression > const &dims)
 
- Public Member Functions inherited from stan::gm::base_var_decl
 base_var_decl ()
 
 base_var_decl (const base_expr_type &base_type)
 
 base_var_decl (const std::string &name, const std::vector< expression > &dims, const base_expr_type &base_type)
 
+ + + + + + + + + + +

+Public Attributes

expression K_
 
- Public Attributes inherited from stan::gm::base_var_decl
std::string name_
 
std::vector< expressiondims_
 
base_expr_type base_type_
 
+

Detailed Description

+
+

Definition at line 423 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::unit_vector_var_decl::unit_vector_var_decl ()
+
+ +

Definition at line 742 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
stan::gm::unit_vector_var_decl::unit_vector_var_decl (expression const & K,
std::string const & name,
std::vector< expression > const & dims 
)
+
+ +

Definition at line 746 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
expression stan::gm::unit_vector_var_decl::K_
+
+ +

Definition at line 424 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1unit__vector__var__decl.png b/doc/api/html/structstan_1_1gm_1_1unit__vector__var__decl.png new file mode 100644 index 0000000000000000000000000000000000000000..13ee086a59f7fea38189efa17e16d17f5b03f6b5 GIT binary patch literal 742 zcmeAS@N?(olHy`uVBq!ia0vp^+krTMgBeKXd=!}uq$C1-LR|m<{|{uoc=NTi|Ih>= z3ycpOIKbL@M;^%KC<*clW&kPzfvcxNj2IZ0NSo=Ubj4qP=UkQ8tI@|MrG)&P z&-O=t=iOINzg?F~{ykZ3zVW}Q(>|)*TlmLAVfLYzcW>;=?q_IuPL;YdPop6B%cRrt z>vuF>a`AhqSr*2V7VY&emBVw@)n|U*Q4L&cEzZ_lbbeR$Na9D?+#^@^9)BzA)bL@V zm*$j%oaIq({_Wk8x&Opmo!24lN_q3jX9|0+`r=nB{ch2{&9m>UdH>Bwz%X*WYsw?NKZCCkv`P5#W(?;_c>b&_I7)>?4KQ>hRvEYvOw+Rmx z7oD$Tx)3~Bdck}(a|e6hyar&fF#I*y$@nX?i22LqCu}d4pX9yZkEX!woTd4K0*1pd zHR^}|9#jjvE`G1PDcmmcLG_*Wd+Xb)b34z+$;F-TJahc}=?|xze_VXA;e6{#iz$ze zHHsXY^^E&Rzm3Pyx1CJaw=wMa^RY|XV)K@0qk5qyohxT@ZuHeTJokNCe{$0ElJ=1F zJ8kQHYK{e*4{>~D)tUKohV_xJ`%mP)>v-VXzaw|TsyTc`zZJJfu0B{huT#ro_dee5 zj-ugT!!ONwd!|TyS=;Z@+IB0>@H+eE7XfkZ*0b*3-4s7{t-^ct(Cp8rr&aI2;LkAY zSM>hX*LSSG!X%Tq+xh24W|`M_zIaXOeqK9~bwU5S>zoJfUxWpQ_V(g)z02j9H>zD> U)n57sm?#-MUHx3vIVCg!0KeXPjsO4v literal 0 HcmV?d00001 diff --git a/doc/api/html/structstan_1_1gm_1_1unscope__locals-members.html b/doc/api/html/structstan_1_1gm_1_1unscope__locals-members.html new file mode 100644 index 00000000000..d70e7d7bf2c --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1unscope__locals-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::unscope_locals Member List
+
+
+ +

This is the complete list of members for stan::gm::unscope_locals, including all inherited members.

+ + +
operator()(const std::vector< var_decl > &var_decls, variable_map &vm) const stan::gm::unscope_localsinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1unscope__locals.html b/doc/api/html/structstan_1_1gm_1_1unscope__locals.html new file mode 100644 index 00000000000..0596a7e16d7 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1unscope__locals.html @@ -0,0 +1,169 @@ + + + + + +Stan: stan::gm::unscope_locals Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::unscope_locals Struct Reference
+
+
+ +

#include <statement_grammar_def.hpp>

+ + + + +

+Classes

struct  result
 
+ + + +

+Public Member Functions

void operator() (const std::vector< var_decl > &var_decls, variable_map &vm) const
 
+

Detailed Description

+
+

Definition at line 325 of file statement_grammar_def.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::gm::unscope_locals::operator() (const std::vector< var_decl > & var_decls,
variable_mapvm 
) const
+
+inline
+
+ +

Definition at line 328 of file statement_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1unscope__locals_1_1result-members.html b/doc/api/html/structstan_1_1gm_1_1unscope__locals_1_1result-members.html new file mode 100644 index 00000000000..2078cd485a2 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1unscope__locals_1_1result-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::unscope_locals::result< T1, T2 > Member List
+
+
+ +

This is the complete list of members for stan::gm::unscope_locals::result< T1, T2 >, including all inherited members.

+ + +
type typedefstan::gm::unscope_locals::result< T1, T2 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1unscope__locals_1_1result.html b/doc/api/html/structstan_1_1gm_1_1unscope__locals_1_1result.html new file mode 100644 index 00000000000..caf277a1e05 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1unscope__locals_1_1result.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::gm::unscope_locals::result< T1, T2 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::unscope_locals::result< T1, T2 > Struct Template Reference
+
+
+ +

#include <statement_grammar_def.hpp>

+ + + + +

+Public Types

typedef void type
 
+

Detailed Description

+

template<typename T1, typename T2>
+struct stan::gm::unscope_locals::result< T1, T2 >

+ + +

Definition at line 327 of file statement_grammar_def.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 >
+ + + + +
typedef void stan::gm::unscope_locals::result< T1, T2 >::type
+
+ +

Definition at line 327 of file statement_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__allow__sample-members.html b/doc/api/html/structstan_1_1gm_1_1validate__allow__sample-members.html new file mode 100644 index 00000000000..e4f60a7b74f --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1validate__allow__sample-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::validate_allow_sample Member List
+
+
+ +

This is the complete list of members for stan::gm::validate_allow_sample, including all inherited members.

+ + +
operator()(const bool &allow_sample, std::stringstream &error_msgs) const stan::gm::validate_allow_sampleinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__allow__sample.html b/doc/api/html/structstan_1_1gm_1_1validate__allow__sample.html new file mode 100644 index 00000000000..c9c113a2d98 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1validate__allow__sample.html @@ -0,0 +1,169 @@ + + + + + +Stan: stan::gm::validate_allow_sample Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::validate_allow_sample Struct Reference
+
+
+ +

#include <statement_grammar_def.hpp>

+ + + + +

+Classes

struct  result
 
+ + + +

+Public Member Functions

bool operator() (const bool &allow_sample, std::stringstream &error_msgs) const
 
+

Detailed Description

+
+

Definition at line 411 of file statement_grammar_def.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::gm::validate_allow_sample::operator() (const bool & allow_sample,
std::stringstream & error_msgs 
) const
+
+inline
+
+ +

Definition at line 415 of file statement_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__allow__sample_1_1result-members.html b/doc/api/html/structstan_1_1gm_1_1validate__allow__sample_1_1result-members.html new file mode 100644 index 00000000000..2d7c5e7f280 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1validate__allow__sample_1_1result-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::validate_allow_sample::result< T1, T2 > Member List
+
+
+ +

This is the complete list of members for stan::gm::validate_allow_sample::result< T1, T2 >, including all inherited members.

+ + +
type typedefstan::gm::validate_allow_sample::result< T1, T2 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__allow__sample_1_1result.html b/doc/api/html/structstan_1_1gm_1_1validate__allow__sample_1_1result.html new file mode 100644 index 00000000000..e7279a5bbbb --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1validate__allow__sample_1_1result.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::gm::validate_allow_sample::result< T1, T2 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::validate_allow_sample::result< T1, T2 > Struct Template Reference
+
+
+ +

#include <statement_grammar_def.hpp>

+ + + + +

+Public Types

typedef bool type
 
+

Detailed Description

+

template<typename T1, typename T2>
+struct stan::gm::validate_allow_sample::result< T1, T2 >

+ + +

Definition at line 413 of file statement_grammar_def.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 >
+ + + + +
typedef bool stan::gm::validate_allow_sample::result< T1, T2 >::type
+
+ +

Definition at line 413 of file statement_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__assignment-members.html b/doc/api/html/structstan_1_1gm_1_1validate__assignment-members.html new file mode 100644 index 00000000000..e73fb80a6ff --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1validate__assignment-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::validate_assignment Member List
+
+
+ +

This is the complete list of members for stan::gm::validate_assignment, including all inherited members.

+ + +
operator()(assignment &a, const var_origin &origin_allowed, variable_map &vm, std::stringstream &error_msgs) const stan::gm::validate_assignmentinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__assignment.html b/doc/api/html/structstan_1_1gm_1_1validate__assignment.html new file mode 100644 index 00000000000..99fe937a5d1 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1validate__assignment.html @@ -0,0 +1,181 @@ + + + + + +Stan: stan::gm::validate_assignment Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::validate_assignment Struct Reference
+
+
+ +

#include <statement_grammar_def.hpp>

+ + + + +

+Classes

struct  result
 
+ + + +

+Public Member Functions

bool operator() (assignment &a, const var_origin &origin_allowed, variable_map &vm, std::stringstream &error_msgs) const
 
+

Detailed Description

+
+

Definition at line 86 of file statement_grammar_def.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::gm::validate_assignment::operator() (assignmenta,
const var_originorigin_allowed,
variable_mapvm,
std::stringstream & error_msgs 
) const
+
+inline
+
+ +

Definition at line 90 of file statement_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__assignment_1_1result-members.html b/doc/api/html/structstan_1_1gm_1_1validate__assignment_1_1result-members.html new file mode 100644 index 00000000000..90aee017869 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1validate__assignment_1_1result-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::validate_assignment::result< T1, T2, T3, T4 > Member List
+
+
+ +

This is the complete list of members for stan::gm::validate_assignment::result< T1, T2, T3, T4 >, including all inherited members.

+ + +
type typedefstan::gm::validate_assignment::result< T1, T2, T3, T4 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__assignment_1_1result.html b/doc/api/html/structstan_1_1gm_1_1validate__assignment_1_1result.html new file mode 100644 index 00000000000..36b1187e45d --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1validate__assignment_1_1result.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::gm::validate_assignment::result< T1, T2, T3, T4 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::validate_assignment::result< T1, T2, T3, T4 > Struct Template Reference
+
+
+ +

#include <statement_grammar_def.hpp>

+ + + + +

+Public Types

typedef bool type
 
+

Detailed Description

+

template<typename T1, typename T2, typename T3, typename T4>
+struct stan::gm::validate_assignment::result< T1, T2, T3, T4 >

+ + +

Definition at line 88 of file statement_grammar_def.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 , typename T3 , typename T4 >
+ + + + +
typedef bool stan::gm::validate_assignment::result< T1, T2, T3, T4 >::type
+
+ +

Definition at line 88 of file statement_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__expr__type-members.html b/doc/api/html/structstan_1_1gm_1_1validate__expr__type-members.html new file mode 100644 index 00000000000..d510749374a --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1validate__expr__type-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::validate_expr_type Member List
+
+
+ +

This is the complete list of members for stan::gm::validate_expr_type, including all inherited members.

+ + +
operator()(const expression &expr, std::ostream &error_msgs) const stan::gm::validate_expr_typeinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__expr__type.html b/doc/api/html/structstan_1_1gm_1_1validate__expr__type.html new file mode 100644 index 00000000000..7dd38a45ed8 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1validate__expr__type.html @@ -0,0 +1,169 @@ + + + + + +Stan: stan::gm::validate_expr_type Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::validate_expr_type Struct Reference
+
+
+ +

#include <term_grammar_def.hpp>

+ + + + +

+Classes

struct  result
 
+ + + +

+Public Member Functions

bool operator() (const expression &expr, std::ostream &error_msgs) const
 
+

Detailed Description

+
+

Definition at line 410 of file term_grammar_def.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::gm::validate_expr_type::operator() (const expressionexpr,
std::ostream & error_msgs 
) const
+
+inline
+
+ +

Definition at line 414 of file term_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__expr__type2-members.html b/doc/api/html/structstan_1_1gm_1_1validate__expr__type2-members.html new file mode 100644 index 00000000000..2482cb174e9 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1validate__expr__type2-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::validate_expr_type2 Member List
+
+
+ +

This is the complete list of members for stan::gm::validate_expr_type2, including all inherited members.

+ + +
operator()(const expression &expr, std::ostream &error_msgs) const stan::gm::validate_expr_type2inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__expr__type2.html b/doc/api/html/structstan_1_1gm_1_1validate__expr__type2.html new file mode 100644 index 00000000000..bdb3d37c5e5 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1validate__expr__type2.html @@ -0,0 +1,169 @@ + + + + + +Stan: stan::gm::validate_expr_type2 Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::validate_expr_type2 Struct Reference
+
+
+ +

#include <expression_grammar_def.hpp>

+ + + + +

+Classes

struct  result
 
+ + + +

+Public Member Functions

bool operator() (const expression &expr, std::ostream &error_msgs) const
 
+

Detailed Description

+
+

Definition at line 54 of file expression_grammar_def.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::gm::validate_expr_type2::operator() (const expressionexpr,
std::ostream & error_msgs 
) const
+
+inline
+
+ +

Definition at line 58 of file expression_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__expr__type2_1_1result-members.html b/doc/api/html/structstan_1_1gm_1_1validate__expr__type2_1_1result-members.html new file mode 100644 index 00000000000..3f04fbac439 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1validate__expr__type2_1_1result-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::validate_expr_type2::result< T1, T2 > Member List
+
+
+ +

This is the complete list of members for stan::gm::validate_expr_type2::result< T1, T2 >, including all inherited members.

+ + +
type typedefstan::gm::validate_expr_type2::result< T1, T2 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__expr__type2_1_1result.html b/doc/api/html/structstan_1_1gm_1_1validate__expr__type2_1_1result.html new file mode 100644 index 00000000000..b59938cb9df --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1validate__expr__type2_1_1result.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::gm::validate_expr_type2::result< T1, T2 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::validate_expr_type2::result< T1, T2 > Struct Template Reference
+
+
+ +

#include <expression_grammar_def.hpp>

+ + + + +

+Public Types

typedef bool type
 
+

Detailed Description

+

template<typename T1, typename T2>
+struct stan::gm::validate_expr_type2::result< T1, T2 >

+ + +

Definition at line 56 of file expression_grammar_def.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 >
+ + + + +
typedef bool stan::gm::validate_expr_type2::result< T1, T2 >::type
+
+ +

Definition at line 56 of file expression_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__expr__type_1_1result-members.html b/doc/api/html/structstan_1_1gm_1_1validate__expr__type_1_1result-members.html new file mode 100644 index 00000000000..d9cb2b4fe44 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1validate__expr__type_1_1result-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::validate_expr_type::result< T1, T2 > Member List
+
+
+ +

This is the complete list of members for stan::gm::validate_expr_type::result< T1, T2 >, including all inherited members.

+ + +
type typedefstan::gm::validate_expr_type::result< T1, T2 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__expr__type_1_1result.html b/doc/api/html/structstan_1_1gm_1_1validate__expr__type_1_1result.html new file mode 100644 index 00000000000..50b5ce171f9 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1validate__expr__type_1_1result.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::gm::validate_expr_type::result< T1, T2 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::validate_expr_type::result< T1, T2 > Struct Template Reference
+
+
+ +

#include <term_grammar_def.hpp>

+ + + + +

+Public Types

typedef bool type
 
+

Detailed Description

+

template<typename T1, typename T2>
+struct stan::gm::validate_expr_type::result< T1, T2 >

+ + +

Definition at line 412 of file term_grammar_def.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 >
+ + + + +
typedef bool stan::gm::validate_expr_type::result< T1, T2 >::type
+
+ +

Definition at line 412 of file term_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__int__expr2-members.html b/doc/api/html/structstan_1_1gm_1_1validate__int__expr2-members.html new file mode 100644 index 00000000000..98ea01c1ef6 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1validate__int__expr2-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::validate_int_expr2 Member List
+
+
+ +

This is the complete list of members for stan::gm::validate_int_expr2, including all inherited members.

+ + +
operator()(const expression &expr, std::stringstream &error_msgs) const stan::gm::validate_int_expr2inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__int__expr2.html b/doc/api/html/structstan_1_1gm_1_1validate__int__expr2.html new file mode 100644 index 00000000000..bf3cc0180f8 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1validate__int__expr2.html @@ -0,0 +1,169 @@ + + + + + +Stan: stan::gm::validate_int_expr2 Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::validate_int_expr2 Struct Reference
+
+
+ +

#include <statement_grammar_def.hpp>

+ + + + +

+Classes

struct  result
 
+ + + +

+Public Member Functions

bool operator() (const expression &expr, std::stringstream &error_msgs) const
 
+

Detailed Description

+
+

Definition at line 395 of file statement_grammar_def.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::gm::validate_int_expr2::operator() (const expressionexpr,
std::stringstream & error_msgs 
) const
+
+inline
+
+ +

Definition at line 399 of file statement_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__int__expr2_1_1result-members.html b/doc/api/html/structstan_1_1gm_1_1validate__int__expr2_1_1result-members.html new file mode 100644 index 00000000000..65ae5ed8d2c --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1validate__int__expr2_1_1result-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::validate_int_expr2::result< T1, T2 > Member List
+
+
+ +

This is the complete list of members for stan::gm::validate_int_expr2::result< T1, T2 >, including all inherited members.

+ + +
type typedefstan::gm::validate_int_expr2::result< T1, T2 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__int__expr2_1_1result.html b/doc/api/html/structstan_1_1gm_1_1validate__int__expr2_1_1result.html new file mode 100644 index 00000000000..a27e71e4e7a --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1validate__int__expr2_1_1result.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::gm::validate_int_expr2::result< T1, T2 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::validate_int_expr2::result< T1, T2 > Struct Template Reference
+
+
+ +

#include <statement_grammar_def.hpp>

+ + + + +

+Public Types

typedef bool type
 
+

Detailed Description

+

template<typename T1, typename T2>
+struct stan::gm::validate_int_expr2::result< T1, T2 >

+ + +

Definition at line 397 of file statement_grammar_def.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 >
+ + + + +
typedef bool stan::gm::validate_int_expr2::result< T1, T2 >::type
+
+ +

Definition at line 397 of file statement_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__int__expr3-members.html b/doc/api/html/structstan_1_1gm_1_1validate__int__expr3-members.html new file mode 100644 index 00000000000..30950942d3e --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1validate__int__expr3-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::validate_int_expr3 Member List
+
+
+ +

This is the complete list of members for stan::gm::validate_int_expr3, including all inherited members.

+ + +
operator()(const expression &expr, std::stringstream &error_msgs) const stan::gm::validate_int_expr3inline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__int__expr3.html b/doc/api/html/structstan_1_1gm_1_1validate__int__expr3.html new file mode 100644 index 00000000000..09811c120a8 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1validate__int__expr3.html @@ -0,0 +1,169 @@ + + + + + +Stan: stan::gm::validate_int_expr3 Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::validate_int_expr3 Struct Reference
+
+
+ +

#include <term_grammar_def.hpp>

+ + + + +

+Classes

struct  result
 
+ + + +

+Public Member Functions

bool operator() (const expression &expr, std::stringstream &error_msgs) const
 
+

Detailed Description

+
+

Definition at line 393 of file term_grammar_def.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool stan::gm::validate_int_expr3::operator() (const expressionexpr,
std::stringstream & error_msgs 
) const
+
+inline
+
+ +

Definition at line 397 of file term_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__int__expr3_1_1result-members.html b/doc/api/html/structstan_1_1gm_1_1validate__int__expr3_1_1result-members.html new file mode 100644 index 00000000000..e19bee521de --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1validate__int__expr3_1_1result-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::validate_int_expr3::result< T1, T2 > Member List
+
+
+ +

This is the complete list of members for stan::gm::validate_int_expr3::result< T1, T2 >, including all inherited members.

+ + +
type typedefstan::gm::validate_int_expr3::result< T1, T2 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__int__expr3_1_1result.html b/doc/api/html/structstan_1_1gm_1_1validate__int__expr3_1_1result.html new file mode 100644 index 00000000000..f4af04be07d --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1validate__int__expr3_1_1result.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::gm::validate_int_expr3::result< T1, T2 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::validate_int_expr3::result< T1, T2 > Struct Template Reference
+
+
+ +

#include <term_grammar_def.hpp>

+ + + + +

+Public Types

typedef bool type
 
+

Detailed Description

+

template<typename T1, typename T2>
+struct stan::gm::validate_int_expr3::result< T1, T2 >

+ + +

Definition at line 395 of file term_grammar_def.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 >
+ + + + +
typedef bool stan::gm::validate_int_expr3::result< T1, T2 >::type
+
+ +

Definition at line 395 of file term_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__sample-members.html b/doc/api/html/structstan_1_1gm_1_1validate__sample-members.html new file mode 100644 index 00000000000..d00c207ba17 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1validate__sample-members.html @@ -0,0 +1,115 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::validate_sample Member List
+
+
+ +

This is the complete list of members for stan::gm::validate_sample, including all inherited members.

+ + + + +
is_double_return(const std::string &function_name, const std::vector< expr_type > &arg_types, std::ostream &error_msgs) const stan::gm::validate_sampleinline
is_univariate(const expr_type &et)stan::gm::validate_sampleinlinestatic
operator()(const sample &s, const variable_map &var_map, std::ostream &error_msgs) const stan::gm::validate_sampleinline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__sample.html b/doc/api/html/structstan_1_1gm_1_1validate__sample.html new file mode 100644 index 00000000000..c0506133872 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1validate__sample.html @@ -0,0 +1,251 @@ + + + + + +Stan: stan::gm::validate_sample Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::validate_sample Struct Reference
+
+
+ +

#include <statement_grammar_def.hpp>

+ + + + +

+Classes

struct  result
 
+ + + + + +

+Public Member Functions

bool is_double_return (const std::string &function_name, const std::vector< expr_type > &arg_types, std::ostream &error_msgs) const
 
bool operator() (const sample &s, const variable_map &var_map, std::ostream &error_msgs) const
 
+ + + +

+Static Public Member Functions

static bool is_univariate (const expr_type &et)
 
+

Detailed Description

+
+

Definition at line 160 of file statement_grammar_def.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::gm::validate_sample::is_double_return (const std::string & function_name,
const std::vector< expr_type > & arg_types,
std::ostream & error_msgs 
) const
+
+inline
+
+ +

Definition at line 164 of file statement_grammar_def.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
static bool stan::gm::validate_sample::is_univariate (const expr_typeet)
+
+inlinestatic
+
+ +

Definition at line 171 of file statement_grammar_def.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
bool stan::gm::validate_sample::operator() (const samples,
const variable_mapvar_map,
std::ostream & error_msgs 
) const
+
+inline
+
+ +

Definition at line 176 of file statement_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__sample_1_1result-members.html b/doc/api/html/structstan_1_1gm_1_1validate__sample_1_1result-members.html new file mode 100644 index 00000000000..3af4bc6f535 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1validate__sample_1_1result-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::validate_sample::result< T1, T2, T3 > Member List
+
+
+ +

This is the complete list of members for stan::gm::validate_sample::result< T1, T2, T3 >, including all inherited members.

+ + +
type typedefstan::gm::validate_sample::result< T1, T2, T3 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__sample_1_1result.html b/doc/api/html/structstan_1_1gm_1_1validate__sample_1_1result.html new file mode 100644 index 00000000000..ae86214314c --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1validate__sample_1_1result.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::gm::validate_sample::result< T1, T2, T3 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::validate_sample::result< T1, T2, T3 > Struct Template Reference
+
+
+ +

#include <statement_grammar_def.hpp>

+ + + + +

+Public Types

typedef bool type
 
+

Detailed Description

+

template<typename T1, typename T2, typename T3>
+struct stan::gm::validate_sample::result< T1, T2, T3 >

+ + +

Definition at line 162 of file statement_grammar_def.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 , typename T3 >
+ + + + +
typedef bool stan::gm::validate_sample::result< T1, T2, T3 >::type
+
+ +

Definition at line 162 of file statement_grammar_def.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__transformed__params__visgen-members.html b/doc/api/html/structstan_1_1gm_1_1validate__transformed__params__visgen-members.html new file mode 100644 index 00000000000..8e580031366 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1validate__transformed__params__visgen-members.html @@ -0,0 +1,131 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::validate_transformed_params_visgen Member List
+
+
+ +

This is the complete list of members for stan::gm::validate_transformed_params_visgen, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + +
indents_stan::gm::validate_transformed_params_visgen
o_stan::gm::visgen
operator()(nil const &) const stan::gm::validate_transformed_params_visgeninline
operator()(int_var_decl const &x) const stan::gm::validate_transformed_params_visgeninline
operator()(double_var_decl const &x) const stan::gm::validate_transformed_params_visgeninline
operator()(vector_var_decl const &x) const stan::gm::validate_transformed_params_visgeninline
operator()(unit_vector_var_decl const &x) const stan::gm::validate_transformed_params_visgeninline
operator()(simplex_var_decl const &x) const stan::gm::validate_transformed_params_visgeninline
operator()(ordered_var_decl const &x) const stan::gm::validate_transformed_params_visgeninline
operator()(positive_ordered_var_decl const &x) const stan::gm::validate_transformed_params_visgeninline
operator()(row_vector_var_decl const &x) const stan::gm::validate_transformed_params_visgeninline
operator()(matrix_var_decl const &x) const stan::gm::validate_transformed_params_visgeninline
operator()(cholesky_factor_var_decl const &x) const stan::gm::validate_transformed_params_visgeninline
operator()(cov_matrix_var_decl const &x) const stan::gm::validate_transformed_params_visgeninline
operator()(corr_matrix_var_decl const &x) const stan::gm::validate_transformed_params_visgeninline
result_type typedefstan::gm::visgen
validate_array(const std::string &name, const std::vector< expression > &dims, size_t matrix_dims) const stan::gm::validate_transformed_params_visgeninline
validate_transformed_params_visgen(int indents, std::ostream &o)stan::gm::validate_transformed_params_visgeninline
visgen(std::ostream &o)stan::gm::visgeninline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__transformed__params__visgen.html b/doc/api/html/structstan_1_1gm_1_1validate__transformed__params__visgen.html new file mode 100644 index 00000000000..4da8d4fee61 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1validate__transformed__params__visgen.html @@ -0,0 +1,614 @@ + + + + + +Stan: stan::gm::validate_transformed_params_visgen Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::validate_transformed_params_visgen Struct Reference
+
+
+ +

#include <generator.hpp>

+
+Inheritance diagram for stan::gm::validate_transformed_params_visgen:
+
+
+ + +stan::gm::visgen + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 validate_transformed_params_visgen (int indents, std::ostream &o)
 
void operator() (nil const &) const
 
void operator() (int_var_decl const &x) const
 
void operator() (double_var_decl const &x) const
 
void operator() (vector_var_decl const &x) const
 
void operator() (unit_vector_var_decl const &x) const
 
void operator() (simplex_var_decl const &x) const
 
void operator() (ordered_var_decl const &x) const
 
void operator() (positive_ordered_var_decl const &x) const
 
void operator() (row_vector_var_decl const &x) const
 
void operator() (matrix_var_decl const &x) const
 
void operator() (cholesky_factor_var_decl const &x) const
 
void operator() (cov_matrix_var_decl const &x) const
 
void operator() (corr_matrix_var_decl const &x) const
 
void validate_array (const std::string &name, const std::vector< expression > &dims, size_t matrix_dims) const
 
- Public Member Functions inherited from stan::gm::visgen
 visgen (std::ostream &o)
 
+ + + + + + +

+Public Attributes

int indents_
 
- Public Attributes inherited from stan::gm::visgen
std::ostream & o_
 
+ + + + +

+Additional Inherited Members

- Public Types inherited from stan::gm::visgen
typedef void result_type
 
+

Detailed Description

+
+

Definition at line 1266 of file generator.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
stan::gm::validate_transformed_params_visgen::validate_transformed_params_visgen (int indents,
std::ostream & o 
)
+
+inline
+
+ +

Definition at line 1268 of file generator.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::validate_transformed_params_visgen::operator() (nil const & ) const
+
+inline
+
+ +

Definition at line 1273 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::validate_transformed_params_visgen::operator() (int_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1274 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::validate_transformed_params_visgen::operator() (double_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1278 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::validate_transformed_params_visgen::operator() (vector_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1282 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::validate_transformed_params_visgen::operator() (unit_vector_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1287 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::validate_transformed_params_visgen::operator() (simplex_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1292 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::validate_transformed_params_visgen::operator() (ordered_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1297 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::validate_transformed_params_visgen::operator() (positive_ordered_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1302 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::validate_transformed_params_visgen::operator() (row_vector_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1307 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::validate_transformed_params_visgen::operator() (matrix_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1312 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::validate_transformed_params_visgen::operator() (cholesky_factor_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1318 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::validate_transformed_params_visgen::operator() (cov_matrix_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1324 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::validate_transformed_params_visgen::operator() (corr_matrix_var_decl const & x) const
+
+inline
+
+ +

Definition at line 1330 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::validate_transformed_params_visgen::validate_array (const std::string & name,
const std::vector< expression > & dims,
size_t matrix_dims 
) const
+
+inline
+
+ +

Definition at line 1336 of file generator.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
int stan::gm::validate_transformed_params_visgen::indents_
+
+ +

Definition at line 1267 of file generator.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__transformed__params__visgen.png b/doc/api/html/structstan_1_1gm_1_1validate__transformed__params__visgen.png new file mode 100644 index 0000000000000000000000000000000000000000..fdfc42fb20eed2ea2184040a28c79b6356082f83 GIT binary patch literal 919 zcmeAS@N?(olHy`uVBq!ia0y~yU=#$h12~w0B&X%ZgFs3mz$e7@|Ns9$=8HF9OZyK^ z0J6aNz<~p-op6+pnuqa=j8_jkD#jBNgXP|LK9QGlqUIjx=ebh>e8iR z`{MqWiA$FM-RPq7Qg`1h56R3aUz1Zl|6N^I`8(}b$B$>?!M9h2nm4G-ecRpX6CAB( z!Q3@#&w@_f+hJl3lk`4)b;-JVrE=?TMZe4U%&M1hDtIpcEgHHx=U1}JGObmioAdg9 zGfXPkwcbARc2q@!$L-DECNAmz^Qw4>V$$=jsZkSG{oA{0=KEQtUth-tEpdCexcd5^ zzoE*Wx9!Y!ck9P^hQ3!R%GtaAzUZW;d%N71IZaq%E1#|Ex%|gnprZLtRg_LnaZ#BG z^_Ns9&tZclubDpx{$uh`7i`$Kf1ePiz!aB;6@ng0jH@PbG+0+MEK^~cF^MC=OQ}J# zlM0;kia}nQFFyn@Tq5meBEo0-*N)0qCo>ias!cZc2{lkcx=u(jV?;~q4}Bjx#e z=8yeP>JGN8bIH>#+15mwmr;S^8*Ut~%!g+h`71@eMCG zu=Ot9qkKs=V@;)Y-QnQJTOZc+msH%^eQw()71Q#^azFDvsbzF8?!ED5rdrgRS*h}} z%9~2!tZ&THeZOq~t;&i?vvzwgFUiEg{`J*|H^0lz#$JfK+Vb@EUDLa(7;k*LSjM3L zLGtj+V-{{lw%Z+O{%3cf<|ISiL)A+UTko9MW4W|>;rW@o2O{gLY@&m$_@p1y7YH%> rc(NF%3Lco^!f@GR$&{c=Uw<-->szIlvwgG$<{}19S3j3^P6 + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::validate_var_decl_visgen Member List
+
+
+ +

This is the complete list of members for stan::gm::validate_var_decl_visgen, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + +
basic_validate(T const &x) const stan::gm::validate_var_decl_visgeninline
generate_begin_for_dims(const std::vector< expression > &dims) const stan::gm::validate_var_decl_visgeninline
generate_end_for_dims(size_t dims_size) const stan::gm::validate_var_decl_visgeninline
generate_loop_var(const std::string &name, size_t dims_size) const stan::gm::validate_var_decl_visgeninline
indents_stan::gm::validate_var_decl_visgen
nonbasic_validate(const T &x, const std::string &type_name) const stan::gm::validate_var_decl_visgeninline
o_stan::gm::visgen
operator()(nil const &) const stan::gm::validate_var_decl_visgeninline
operator()(int_var_decl const &x) const stan::gm::validate_var_decl_visgeninline
operator()(double_var_decl const &x) const stan::gm::validate_var_decl_visgeninline
operator()(vector_var_decl const &x) const stan::gm::validate_var_decl_visgeninline
operator()(row_vector_var_decl const &x) const stan::gm::validate_var_decl_visgeninline
operator()(matrix_var_decl const &x) const stan::gm::validate_var_decl_visgeninline
operator()(unit_vector_var_decl const &x) const stan::gm::validate_var_decl_visgeninline
operator()(simplex_var_decl const &x) const stan::gm::validate_var_decl_visgeninline
operator()(ordered_var_decl const &x) const stan::gm::validate_var_decl_visgeninline
operator()(positive_ordered_var_decl const &x) const stan::gm::validate_var_decl_visgeninline
operator()(cholesky_factor_var_decl const &x) const stan::gm::validate_var_decl_visgeninline
operator()(cov_matrix_var_decl const &x) const stan::gm::validate_var_decl_visgeninline
operator()(corr_matrix_var_decl const &x) const stan::gm::validate_var_decl_visgeninline
result_type typedefstan::gm::visgen
validate_var_decl_visgen(int indents, std::ostream &o)stan::gm::validate_var_decl_visgeninline
visgen(std::ostream &o)stan::gm::visgeninline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__var__decl__visgen.html b/doc/api/html/structstan_1_1gm_1_1validate__var__decl__visgen.html new file mode 100644 index 00000000000..55d59a9eab4 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1validate__var__decl__visgen.html @@ -0,0 +1,736 @@ + + + + + +Stan: stan::gm::validate_var_decl_visgen Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::validate_var_decl_visgen Struct Reference
+
+
+ +

#include <generator.hpp>

+
+Inheritance diagram for stan::gm::validate_var_decl_visgen:
+
+
+ + +stan::gm::visgen + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 validate_var_decl_visgen (int indents, std::ostream &o)
 
void generate_begin_for_dims (const std::vector< expression > &dims) const
 
void generate_end_for_dims (size_t dims_size) const
 
void generate_loop_var (const std::string &name, size_t dims_size) const
 
void operator() (nil const &) const
 
template<typename T >
void basic_validate (T const &x) const
 
void operator() (int_var_decl const &x) const
 
void operator() (double_var_decl const &x) const
 
void operator() (vector_var_decl const &x) const
 
void operator() (row_vector_var_decl const &x) const
 
void operator() (matrix_var_decl const &x) const
 
template<typename T >
void nonbasic_validate (const T &x, const std::string &type_name) const
 
void operator() (unit_vector_var_decl const &x) const
 
void operator() (simplex_var_decl const &x) const
 
void operator() (ordered_var_decl const &x) const
 
void operator() (positive_ordered_var_decl const &x) const
 
void operator() (cholesky_factor_var_decl const &x) const
 
void operator() (cov_matrix_var_decl const &x) const
 
void operator() (corr_matrix_var_decl const &x) const
 
- Public Member Functions inherited from stan::gm::visgen
 visgen (std::ostream &o)
 
+ + + + + + +

+Public Attributes

int indents_
 
- Public Attributes inherited from stan::gm::visgen
std::ostream & o_
 
+ + + + +

+Additional Inherited Members

- Public Types inherited from stan::gm::visgen
typedef void result_type
 
+

Detailed Description

+
+

Definition at line 729 of file generator.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
stan::gm::validate_var_decl_visgen::validate_var_decl_visgen (int indents,
std::ostream & o 
)
+
+inline
+
+ +

Definition at line 731 of file generator.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
void stan::gm::validate_var_decl_visgen::basic_validate (T const & x) const
+
+inline
+
+ +

Definition at line 763 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::validate_var_decl_visgen::generate_begin_for_dims (const std::vector< expression > & dims) const
+
+inline
+
+ +

Definition at line 736 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::validate_var_decl_visgen::generate_end_for_dims (size_t dims_size) const
+
+inline
+
+ +

Definition at line 748 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::gm::validate_var_decl_visgen::generate_loop_var (const std::string & name,
size_t dims_size 
) const
+
+inline
+
+ +

Definition at line 755 of file generator.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::gm::validate_var_decl_visgen::nonbasic_validate (const T & x,
const std::string & type_name 
) const
+
+inline
+
+ +

Definition at line 815 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::validate_var_decl_visgen::operator() (nil const & ) const
+
+inline
+
+ +

Definition at line 761 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::validate_var_decl_visgen::operator() (int_var_decl const & x) const
+
+inline
+
+ +

Definition at line 799 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::validate_var_decl_visgen::operator() (double_var_decl const & x) const
+
+inline
+
+ +

Definition at line 802 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::validate_var_decl_visgen::operator() (vector_var_decl const & x) const
+
+inline
+
+ +

Definition at line 805 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::validate_var_decl_visgen::operator() (row_vector_var_decl const & x) const
+
+inline
+
+ +

Definition at line 808 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::validate_var_decl_visgen::operator() (matrix_var_decl const & x) const
+
+inline
+
+ +

Definition at line 811 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::validate_var_decl_visgen::operator() (unit_vector_var_decl const & x) const
+
+inline
+
+ +

Definition at line 826 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::validate_var_decl_visgen::operator() (simplex_var_decl const & x) const
+
+inline
+
+ +

Definition at line 829 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::validate_var_decl_visgen::operator() (ordered_var_decl const & x) const
+
+inline
+
+ +

Definition at line 832 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::validate_var_decl_visgen::operator() (positive_ordered_var_decl const & x) const
+
+inline
+
+ +

Definition at line 835 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::validate_var_decl_visgen::operator() (cholesky_factor_var_decl const & x) const
+
+inline
+
+ +

Definition at line 838 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::validate_var_decl_visgen::operator() (cov_matrix_var_decl const & x) const
+
+inline
+
+ +

Definition at line 841 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::validate_var_decl_visgen::operator() (corr_matrix_var_decl const & x) const
+
+inline
+
+ +

Definition at line 844 of file generator.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
int stan::gm::validate_var_decl_visgen::indents_
+
+ +

Definition at line 730 of file generator.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1validate__var__decl__visgen.png b/doc/api/html/structstan_1_1gm_1_1validate__var__decl__visgen.png new file mode 100644 index 0000000000000000000000000000000000000000..9667fcb5bf370a20519cb2cd0424c949c4adf4de GIT binary patch literal 760 zcmeAS@N?(olHy`uVBq!ia0vp^7l1f`gBeK1pW>beq$C1-LR|m<{|{uoc=NTi|Ih>= z3ycpOIKbL@M;^%KC<*clW&kPzfvcxNj2IZ0+C5zyLn;{G&b_#4wE~Z;`0bhh{;S7F z2XHL7n&rQf$2iZQf5HS;r<&AR%T}rzdIs4`IZV2;iEV<))-}-$b5!PDQ8%0P#m}C3 z(vtiaS`%g`-uX4_VqE>BC&kD12mLa5aQ#}YPo{NQvOV!On09B@tV@k5bFY3~HbMLn=Yl&% zw>&PT@A}P`>hR2Ord4TB%`EMm7oJ|*+#h?!^XB9|t76|hS5^1CZ6$W6SAJ7IldSdI z)0Pvb*usfmK3g%Vt%!*|8m=tx5$He#Ym5B`hT=*O2U6H=< z_@ZQBzJsxUyvtq2UOn~;+t>sgPD?p3=w>r8Zdt>~a$yr8fe)Q?ir1+>WcYQFfhi-B znPWj}s)P88w95&ybLW(V>(tvbB$Q}hIH%vR{g*-=!(tAT@(<6=HTTRD?zFyt@38jW zcS{ol{&gmI?q1btdG3nA$4uVCd_O;_+_<_le(w#IeP2FCowzi0X6c44-CBifH?IAC zy+*9tCmc<7=>C|MaIQ}B z^Zr$8rVDmd+vQ)1($jBv)mp-^Vup^_x*eNWp5nQwBi1H8bIp`HdJ}w|Znd7fqnJHu z=dIn&7YmZ-ubsr5n`z5`dAH1x^HmAmj@O>nyf+k0_su!5J66xOGiv(kX)*`4>D4S^ z*ta0d<#@xV%S;wauRqSIz9aP_CCO5%HZkh=d#Wzp$Py030*n> literal 0 HcmV?d00001 diff --git a/doc/api/html/structstan_1_1gm_1_1var__decl-members.html b/doc/api/html/structstan_1_1gm_1_1var__decl-members.html new file mode 100644 index 00000000000..e50fcb589a9 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1var__decl-members.html @@ -0,0 +1,130 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::var_decl Member List
+
+
+ +

This is the complete list of members for stan::gm::var_decl, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
decl_stan::gm::var_decl
name() const stan::gm::var_decl
var_decl()stan::gm::var_decl
var_decl(const var_decl_t &decl)stan::gm::var_decl
var_decl(const nil &decl)stan::gm::var_decl
var_decl(const int_var_decl &decl)stan::gm::var_decl
var_decl(const double_var_decl &decl)stan::gm::var_decl
var_decl(const vector_var_decl &decl)stan::gm::var_decl
var_decl(const row_vector_var_decl &decl)stan::gm::var_decl
var_decl(const matrix_var_decl &decl)stan::gm::var_decl
var_decl(const simplex_var_decl &decl)stan::gm::var_decl
var_decl(const unit_vector_var_decl &decl)stan::gm::var_decl
var_decl(const ordered_var_decl &decl)stan::gm::var_decl
var_decl(const positive_ordered_var_decl &decl)stan::gm::var_decl
var_decl(const cholesky_factor_var_decl &decl)stan::gm::var_decl
var_decl(const cov_matrix_var_decl &decl)stan::gm::var_decl
var_decl(const corr_matrix_var_decl &decl)stan::gm::var_decl
var_decl_t typedefstan::gm::var_decl
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1var__decl.html b/doc/api/html/structstan_1_1gm_1_1var__decl.html new file mode 100644 index 00000000000..05b36d7de5e --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1var__decl.html @@ -0,0 +1,513 @@ + + + + + +Stan: stan::gm::var_decl Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::var_decl Struct Reference
+
+
+ +

#include <ast.hpp>

+ + + + +

+Public Types

typedef boost::variant
+< boost::recursive_wrapper
+< nil >
+, boost::recursive_wrapper
+< int_var_decl >
+, boost::recursive_wrapper
+< double_var_decl >
+, boost::recursive_wrapper
+< vector_var_decl >
+, boost::recursive_wrapper
+< row_vector_var_decl >
+, boost::recursive_wrapper
+< matrix_var_decl >
+, boost::recursive_wrapper
+< simplex_var_decl >
+, boost::recursive_wrapper
+< unit_vector_var_decl >
+, boost::recursive_wrapper
+< ordered_var_decl >
+, boost::recursive_wrapper
+< positive_ordered_var_decl >
+, boost::recursive_wrapper
+< cholesky_factor_var_decl >
+, boost::recursive_wrapper
+< cov_matrix_var_decl >
+, boost::recursive_wrapper
+< corr_matrix_var_decl > > 
var_decl_t
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 var_decl ()
 
 var_decl (const var_decl_t &decl)
 
 var_decl (const nil &decl)
 
 var_decl (const int_var_decl &decl)
 
 var_decl (const double_var_decl &decl)
 
 var_decl (const vector_var_decl &decl)
 
 var_decl (const row_vector_var_decl &decl)
 
 var_decl (const matrix_var_decl &decl)
 
 var_decl (const simplex_var_decl &decl)
 
 var_decl (const unit_vector_var_decl &decl)
 
 var_decl (const ordered_var_decl &decl)
 
 var_decl (const positive_ordered_var_decl &decl)
 
 var_decl (const cholesky_factor_var_decl &decl)
 
 var_decl (const cov_matrix_var_decl &decl)
 
 var_decl (const corr_matrix_var_decl &decl)
 
std::string name () const
 
+ + + +

+Public Attributes

var_decl_t decl_
 
+

Detailed Description

+
+

Definition at line 534 of file ast.hpp.

+

Member Typedef Documentation

+ +
+
+ + + + +
typedef boost::variant<boost::recursive_wrapper<nil>, boost::recursive_wrapper<int_var_decl>, boost::recursive_wrapper<double_var_decl>, boost::recursive_wrapper<vector_var_decl>, boost::recursive_wrapper<row_vector_var_decl>, boost::recursive_wrapper<matrix_var_decl>, boost::recursive_wrapper<simplex_var_decl>, boost::recursive_wrapper<unit_vector_var_decl>, boost::recursive_wrapper<ordered_var_decl>, boost::recursive_wrapper<positive_ordered_var_decl>, boost::recursive_wrapper<cholesky_factor_var_decl>, boost::recursive_wrapper<cov_matrix_var_decl>, boost::recursive_wrapper<corr_matrix_var_decl> > stan::gm::var_decl::var_decl_t
+
+ +

Definition at line 548 of file ast.hpp.

+ +
+
+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::var_decl::var_decl ()
+
+ +

Definition at line 897 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::var_decl::var_decl (const var_decl_tdecl)
+
+ +

Definition at line 896 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::var_decl::var_decl (const nildecl)
+
+ +

Definition at line 898 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::var_decl::var_decl (const int_var_decldecl)
+
+ +

Definition at line 899 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::var_decl::var_decl (const double_var_decldecl)
+
+ +

Definition at line 900 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::var_decl::var_decl (const vector_var_decldecl)
+
+ +

Definition at line 901 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::var_decl::var_decl (const row_vector_var_decldecl)
+
+ +

Definition at line 902 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::var_decl::var_decl (const matrix_var_decldecl)
+
+ +

Definition at line 903 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::var_decl::var_decl (const simplex_var_decldecl)
+
+ +

Definition at line 905 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::var_decl::var_decl (const unit_vector_var_decldecl)
+
+ +

Definition at line 904 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::var_decl::var_decl (const ordered_var_decldecl)
+
+ +

Definition at line 906 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::var_decl::var_decl (const positive_ordered_var_decldecl)
+
+ +

Definition at line 907 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::var_decl::var_decl (const cholesky_factor_var_decldecl)
+
+ +

Definition at line 908 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::var_decl::var_decl (const cov_matrix_var_decldecl)
+
+ +

Definition at line 909 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::var_decl::var_decl (const corr_matrix_var_decldecl)
+
+ +

Definition at line 910 of file ast_def.cpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + + + +
std::string stan::gm::var_decl::name () const
+
+ +

Definition at line 912 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
var_decl_t stan::gm::var_decl::decl_
+
+ +

Definition at line 550 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1var__decls__grammar-members.html b/doc/api/html/structstan_1_1gm_1_1var__decls__grammar-members.html new file mode 100644 index 00000000000..0094fb08347 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1var__decls__grammar-members.html @@ -0,0 +1,138 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::var_decls_grammar< Iterator > Member List
+
+
+ +

This is the complete list of members for stan::gm::var_decls_grammar< Iterator >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + +
cholesky_factor_decl_rstan::gm::var_decls_grammar< Iterator >
corr_matrix_decl_rstan::gm::var_decls_grammar< Iterator >
cov_matrix_decl_rstan::gm::var_decls_grammar< Iterator >
dims_rstan::gm::var_decls_grammar< Iterator >
double_decl_rstan::gm::var_decls_grammar< Iterator >
error_msgs_stan::gm::var_decls_grammar< Iterator >
expression07_gstan::gm::var_decls_grammar< Iterator >
expression_gstan::gm::var_decls_grammar< Iterator >
identifier_name_rstan::gm::var_decls_grammar< Iterator >
identifier_rstan::gm::var_decls_grammar< Iterator >
int_decl_rstan::gm::var_decls_grammar< Iterator >
matrix_decl_rstan::gm::var_decls_grammar< Iterator >
opt_dims_rstan::gm::var_decls_grammar< Iterator >
ordered_decl_rstan::gm::var_decls_grammar< Iterator >
positive_ordered_decl_rstan::gm::var_decls_grammar< Iterator >
range_brackets_double_rstan::gm::var_decls_grammar< Iterator >
range_brackets_int_rstan::gm::var_decls_grammar< Iterator >
range_rstan::gm::var_decls_grammar< Iterator >
row_vector_decl_rstan::gm::var_decls_grammar< Iterator >
simplex_decl_rstan::gm::var_decls_grammar< Iterator >
unit_vector_decl_rstan::gm::var_decls_grammar< Iterator >
var_decl_rstan::gm::var_decls_grammar< Iterator >
var_decls_grammar(variable_map &var_map, std::stringstream &error_msgs)stan::gm::var_decls_grammar< Iterator >
var_decls_rstan::gm::var_decls_grammar< Iterator >
var_map_stan::gm::var_decls_grammar< Iterator >
vector_decl_rstan::gm::var_decls_grammar< Iterator >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1var__decls__grammar.html b/doc/api/html/structstan_1_1gm_1_1var__decls__grammar.html new file mode 100644 index 00000000000..a17c456e51a --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1var__decls__grammar.html @@ -0,0 +1,677 @@ + + + + + +Stan: stan::gm::var_decls_grammar< Iterator > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::var_decls_grammar< Iterator > Struct Template Reference
+
+
+ +

#include <var_decls_grammar.hpp>

+
+Inheritance diagram for stan::gm::var_decls_grammar< Iterator >:
+
+
+ + + +
+ + + + +

+Public Member Functions

 var_decls_grammar (variable_map &var_map, std::stringstream &error_msgs)
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Attributes

variable_mapvar_map_
 
std::stringstream & error_msgs_
 
expression_grammar< Iterator > expression_g
 
expression_grammar< Iterator > expression07_g
 
boost::spirit::qi::rule
+< Iterator,
+cholesky_factor_var_decl(var_origin),
+whitespace_grammar< Iterator > > 
cholesky_factor_decl_r
 
boost::spirit::qi::rule
+< Iterator,
+corr_matrix_var_decl(var_origin),
+whitespace_grammar< Iterator > > 
corr_matrix_decl_r
 
boost::spirit::qi::rule
+< Iterator,
+cov_matrix_var_decl(var_origin),
+whitespace_grammar< Iterator > > 
cov_matrix_decl_r
 
boost::spirit::qi::rule
+< Iterator, std::vector
+< expression >var_origin),
+whitespace_grammar< Iterator > > 
dims_r
 
boost::spirit::qi::rule
+< Iterator, double_var_decl(var_origin),
+whitespace_grammar< Iterator > > 
double_decl_r
 
boost::spirit::qi::rule
+< Iterator, std::string(),
+whitespace_grammar< Iterator > > 
identifier_r
 
boost::spirit::qi::rule
+< Iterator, std::string(),
+whitespace_grammar< Iterator > > 
identifier_name_r
 
boost::spirit::qi::rule
+< Iterator, int_var_decl(var_origin),
+whitespace_grammar< Iterator > > 
int_decl_r
 
boost::spirit::qi::rule
+< Iterator, matrix_var_decl(var_origin),
+whitespace_grammar< Iterator > > 
matrix_decl_r
 
boost::spirit::qi::rule
+< Iterator, std::vector
+< expression >var_origin),
+whitespace_grammar< Iterator > > 
opt_dims_r
 
boost::spirit::qi::rule
+< Iterator, ordered_var_decl(var_origin),
+whitespace_grammar< Iterator > > 
ordered_decl_r
 
boost::spirit::qi::rule
+< Iterator,
+positive_ordered_var_decl(var_origin),
+whitespace_grammar< Iterator > > 
positive_ordered_decl_r
 
boost::spirit::qi::rule
+< Iterator, range(var_origin),
+whitespace_grammar< Iterator > > 
range_brackets_double_r
 
boost::spirit::qi::rule
+< Iterator, range(var_origin),
+whitespace_grammar< Iterator > > 
range_brackets_int_r
 
boost::spirit::qi::rule
+< Iterator, range(var_origin),
+whitespace_grammar< Iterator > > 
range_r
 
boost::spirit::qi::rule
+< Iterator,
+row_vector_var_decl(var_origin),
+whitespace_grammar< Iterator > > 
row_vector_decl_r
 
boost::spirit::qi::rule
+< Iterator,
+unit_vector_var_decl(var_origin),
+whitespace_grammar< Iterator > > 
unit_vector_decl_r
 
boost::spirit::qi::rule
+< Iterator, simplex_var_decl(var_origin),
+whitespace_grammar< Iterator > > 
simplex_decl_r
 
boost::spirit::qi::rule
+< Iterator, vector_var_decl(var_origin),
+whitespace_grammar< Iterator > > 
vector_decl_r
 
boost::spirit::qi::rule
+< Iterator,
+boost::spirit::qi::locals
+< bool >, var_decl(bool,
+var_origin),
+whitespace_grammar< Iterator > > 
var_decl_r
 
boost::spirit::qi::rule
+< Iterator,
+boost::spirit::qi::locals
+< bool >, std::vector
+< var_decl >bool, var_origin),
+whitespace_grammar< Iterator > > 
var_decls_r
 
+

Detailed Description

+

template<typename Iterator>
+struct stan::gm::var_decls_grammar< Iterator >

+ + +

Definition at line 19 of file var_decls_grammar.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename Iterator >
+ + + + + + + + + + + + + + + + + + +
stan::gm::var_decls_grammar< Iterator >::var_decls_grammar (variable_mapvar_map,
std::stringstream & error_msgs 
)
+
+ +
+
+

Member Data Documentation

+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, cholesky_factor_var_decl(var_origin), whitespace_grammar<Iterator> > stan::gm::var_decls_grammar< Iterator >::cholesky_factor_decl_r
+
+ +

Definition at line 42 of file var_decls_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, corr_matrix_var_decl(var_origin), whitespace_grammar<Iterator> > stan::gm::var_decls_grammar< Iterator >::corr_matrix_decl_r
+
+ +

Definition at line 47 of file var_decls_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, cov_matrix_var_decl(var_origin), whitespace_grammar<Iterator> > stan::gm::var_decls_grammar< Iterator >::cov_matrix_decl_r
+
+ +

Definition at line 52 of file var_decls_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, std::vector<expression>var_origin), whitespace_grammar<Iterator> > stan::gm::var_decls_grammar< Iterator >::dims_r
+
+ +

Definition at line 57 of file var_decls_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, double_var_decl(var_origin), whitespace_grammar<Iterator> > stan::gm::var_decls_grammar< Iterator >::double_decl_r
+
+ +

Definition at line 62 of file var_decls_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
std::stringstream& stan::gm::var_decls_grammar< Iterator >::error_msgs_
+
+ +

Definition at line 30 of file var_decls_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
expression_grammar<Iterator> stan::gm::var_decls_grammar< Iterator >::expression07_g
+
+ +

Definition at line 35 of file var_decls_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
expression_grammar<Iterator> stan::gm::var_decls_grammar< Iterator >::expression_g
+
+ +

Definition at line 33 of file var_decls_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, std::string(), whitespace_grammar<Iterator> > stan::gm::var_decls_grammar< Iterator >::identifier_name_r
+
+ +

Definition at line 72 of file var_decls_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, std::string(), whitespace_grammar<Iterator> > stan::gm::var_decls_grammar< Iterator >::identifier_r
+
+ +

Definition at line 67 of file var_decls_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, int_var_decl(var_origin), whitespace_grammar<Iterator> > stan::gm::var_decls_grammar< Iterator >::int_decl_r
+
+ +

Definition at line 77 of file var_decls_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, matrix_var_decl(var_origin), whitespace_grammar<Iterator> > stan::gm::var_decls_grammar< Iterator >::matrix_decl_r
+
+ +

Definition at line 82 of file var_decls_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, std::vector<expression>var_origin), whitespace_grammar<Iterator> > stan::gm::var_decls_grammar< Iterator >::opt_dims_r
+
+ +

Definition at line 87 of file var_decls_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, ordered_var_decl(var_origin), whitespace_grammar<Iterator> > stan::gm::var_decls_grammar< Iterator >::ordered_decl_r
+
+ +

Definition at line 92 of file var_decls_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, positive_ordered_var_decl(var_origin), whitespace_grammar<Iterator> > stan::gm::var_decls_grammar< Iterator >::positive_ordered_decl_r
+
+ +

Definition at line 97 of file var_decls_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, range(var_origin), whitespace_grammar<Iterator> > stan::gm::var_decls_grammar< Iterator >::range_brackets_double_r
+
+ +

Definition at line 102 of file var_decls_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, range(var_origin), whitespace_grammar<Iterator> > stan::gm::var_decls_grammar< Iterator >::range_brackets_int_r
+
+ +

Definition at line 107 of file var_decls_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, range(var_origin), whitespace_grammar<Iterator> > stan::gm::var_decls_grammar< Iterator >::range_r
+
+ +

Definition at line 112 of file var_decls_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, row_vector_var_decl(var_origin), whitespace_grammar<Iterator> > stan::gm::var_decls_grammar< Iterator >::row_vector_decl_r
+
+ +

Definition at line 117 of file var_decls_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, simplex_var_decl(var_origin), whitespace_grammar<Iterator> > stan::gm::var_decls_grammar< Iterator >::simplex_decl_r
+
+ +

Definition at line 127 of file var_decls_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, unit_vector_var_decl(var_origin), whitespace_grammar<Iterator> > stan::gm::var_decls_grammar< Iterator >::unit_vector_decl_r
+
+ +

Definition at line 122 of file var_decls_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, boost::spirit::qi::locals<bool>, var_decl(bool,var_origin), whitespace_grammar<Iterator> > stan::gm::var_decls_grammar< Iterator >::var_decl_r
+
+ +

Definition at line 138 of file var_decls_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, boost::spirit::qi::locals<bool>, std::vector<var_decl>bool,var_origin), whitespace_grammar<Iterator> > stan::gm::var_decls_grammar< Iterator >::var_decls_r
+
+ +

Definition at line 144 of file var_decls_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
variable_map& stan::gm::var_decls_grammar< Iterator >::var_map_
+
+ +

Definition at line 29 of file var_decls_grammar.hpp.

+ +
+
+ +
+
+
+template<typename Iterator >
+ + + + +
boost::spirit::qi::rule<Iterator, vector_var_decl(var_origin), whitespace_grammar<Iterator> > stan::gm::var_decls_grammar< Iterator >::vector_decl_r
+
+ +

Definition at line 132 of file var_decls_grammar.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1var__decls__grammar.png b/doc/api/html/structstan_1_1gm_1_1var__decls__grammar.png new file mode 100644 index 0000000000000000000000000000000000000000..dde62a3a9d35efa9c48ae266079a37766844cd2e GIT binary patch literal 1786 zcmd6oe>Br;9LEg$a>x9(V%RldF+v=urdCqyx`+UylJgJ_Dlj|Xd z5D*Bo9{9->2?A-t)b6=fQ%zHR)ot~%)zi)Agi57S>*)AwY{t8LYFn8c4hNhngsQh| zV~_}MkowZM(e;Oq6$rE@6>xR&iC-n{YkQPat@HDr0#koEnVV=2aJEK1yl5q5klmLy zYaFKr?H}_AE7@F9fhzCDv|+*uLjj~QaNqa@CD$_npzH$DjDPk1zA#3EcIAlC8HG?m zo#+Tes3Z<9@32s`V+GK3JZzguqu?Vkeo|!QV%qp&p`IZufiFuk7kHZ=7;6p)cswxW zIaDU#K^2S6Z9L!f0K%Y2Bj-AuGNct>hU*#eH#)$Ribvj0la%ueo6(F{EqQY9@!;6E zQarWj=4%;A$r?*}hVL&+_Q=#^u||M}sI43cE+%Z-un{)*fP%BUQ_cuP*IZwvtEkrYD5q>(GmeG6n0&7rg2dX_5W0lUQn~2Y3&RLQkI^qU)`@1Wr{pgI; z5b-&Ab0XSu0nW3x*2^QlE;Gz#rG{92@}(fA%c>l8gLAHFzAf~=V<*HiZ+${`?w4?< znB&8JufAyQEgmQ(HHVSyntO+5dQBrOZSD7GTzamGK4@s2GTP9G+|-q1Eh?_ z)9j?f)zoqBQhjvHx|e4+SeB*+2Pu;`9Rsp}HVOmi(h=C$@}PUS2G zv8Z=()}I{#WC*!GfS^;`8Sn%VbsEMZE0?3``?WTDUTVBjU`A~9SkD36qsiBkO(4BC16~g-}IRrP1S}11BEx$8nnqtXKsKT z$$vju>}@8}GGlX~Uwu|jp6(yihbXob7??f1X7@cp6E3clF>R%$(mSeELCx)8cvg6X Q`lA8?ClIc* + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::var_resizing_visgen Member List
+
+
+ +

This is the complete list of members for stan::gm::var_resizing_visgen, including all inherited members.

+ + + + + + + + + + + + + + + + + + +
o_stan::gm::visgen
operator()(nil const &) const stan::gm::var_resizing_visgeninline
operator()(int_var_decl const &x) const stan::gm::var_resizing_visgeninline
operator()(double_var_decl const &x) const stan::gm::var_resizing_visgeninline
operator()(vector_var_decl const &x) const stan::gm::var_resizing_visgeninline
operator()(row_vector_var_decl const &x) const stan::gm::var_resizing_visgeninline
operator()(unit_vector_var_decl const &x) const stan::gm::var_resizing_visgeninline
operator()(simplex_var_decl const &x) const stan::gm::var_resizing_visgeninline
operator()(ordered_var_decl const &x) const stan::gm::var_resizing_visgeninline
operator()(positive_ordered_var_decl const &x) const stan::gm::var_resizing_visgeninline
operator()(matrix_var_decl const &x) const stan::gm::var_resizing_visgeninline
operator()(cholesky_factor_var_decl const &x) const stan::gm::var_resizing_visgeninline
operator()(cov_matrix_var_decl const &x) const stan::gm::var_resizing_visgeninline
operator()(corr_matrix_var_decl const &x) const stan::gm::var_resizing_visgeninline
result_type typedefstan::gm::visgen
var_resizing_visgen(std::ostream &o)stan::gm::var_resizing_visgeninline
visgen(std::ostream &o)stan::gm::visgeninline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1var__resizing__visgen.html b/doc/api/html/structstan_1_1gm_1_1var__resizing__visgen.html new file mode 100644 index 00000000000..543f6bee0e7 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1var__resizing__visgen.html @@ -0,0 +1,539 @@ + + + + + +Stan: stan::gm::var_resizing_visgen Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::var_resizing_visgen Struct Reference
+
+
+ +

#include <generator.hpp>

+
+Inheritance diagram for stan::gm::var_resizing_visgen:
+
+
+ + +stan::gm::visgen + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 var_resizing_visgen (std::ostream &o)
 
void operator() (nil const &) const
 
void operator() (int_var_decl const &x) const
 
void operator() (double_var_decl const &x) const
 
void operator() (vector_var_decl const &x) const
 
void operator() (row_vector_var_decl const &x) const
 
void operator() (unit_vector_var_decl const &x) const
 
void operator() (simplex_var_decl const &x) const
 
void operator() (ordered_var_decl const &x) const
 
void operator() (positive_ordered_var_decl const &x) const
 
void operator() (matrix_var_decl const &x) const
 
void operator() (cholesky_factor_var_decl const &x) const
 
void operator() (cov_matrix_var_decl const &x) const
 
void operator() (corr_matrix_var_decl const &x) const
 
- Public Member Functions inherited from stan::gm::visgen
 visgen (std::ostream &o)
 
+ + + + + + + +

+Additional Inherited Members

- Public Types inherited from stan::gm::visgen
typedef void result_type
 
- Public Attributes inherited from stan::gm::visgen
std::ostream & o_
 
+

Detailed Description

+
+

Definition at line 449 of file generator.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::gm::var_resizing_visgen::var_resizing_visgen (std::ostream & o)
+
+inline
+
+ +

Definition at line 450 of file generator.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::var_resizing_visgen::operator() (nil const & ) const
+
+inline
+
+ +

Definition at line 453 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::var_resizing_visgen::operator() (int_var_decl const & x) const
+
+inline
+
+ +

Definition at line 454 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::var_resizing_visgen::operator() (double_var_decl const & x) const
+
+inline
+
+ +

Definition at line 457 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::var_resizing_visgen::operator() (vector_var_decl const & x) const
+
+inline
+
+ +

Definition at line 460 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::var_resizing_visgen::operator() (row_vector_var_decl const & x) const
+
+inline
+
+ +

Definition at line 463 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::var_resizing_visgen::operator() (unit_vector_var_decl const & x) const
+
+inline
+
+ +

Definition at line 466 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::var_resizing_visgen::operator() (simplex_var_decl const & x) const
+
+inline
+
+ +

Definition at line 469 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::var_resizing_visgen::operator() (ordered_var_decl const & x) const
+
+inline
+
+ +

Definition at line 472 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::var_resizing_visgen::operator() (positive_ordered_var_decl const & x) const
+
+inline
+
+ +

Definition at line 475 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::var_resizing_visgen::operator() (matrix_var_decl const & x) const
+
+inline
+
+ +

Definition at line 478 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::var_resizing_visgen::operator() (cholesky_factor_var_decl const & x) const
+
+inline
+
+ +

Definition at line 481 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::var_resizing_visgen::operator() (cov_matrix_var_decl const & x) const
+
+inline
+
+ +

Definition at line 484 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::var_resizing_visgen::operator() (corr_matrix_var_decl const & x) const
+
+inline
+
+ +

Definition at line 487 of file generator.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1var__resizing__visgen.png b/doc/api/html/structstan_1_1gm_1_1var__resizing__visgen.png new file mode 100644 index 0000000000000000000000000000000000000000..028fd8578ac2d5af7c681e4ec265844354c9132c GIT binary patch literal 712 zcmeAS@N?(olHy`uVBq!ia0vp^8-X~0gBeIBzE8OTq$C1-LR|m<{|{uoc=NTi|Ih>= z3ycpOIKbL@M;^%KC<*clW&kPzfvcxNj2IZ0!aZFaLn;{G&VAkYT7ieHT|eml|B3$5 z?^;xrM2E9?icVh3G=ov*f7een%_`}xR(EPaBLAjezxS2*aar0tWzXh6 zrv1{7wbri=DGJKlf4(a~`_jv&Q4f|Z6YbAiyWu>Sr&U_c*Zm@2@}>IcUjG|BHDt^B zc^mgarOi?NQSr+CoN%wTbq@2iOlTuD!t^j&Sjlrja!RKhnvHs&Zr!Gs{x2gxv zJ6~~?iy?cOVT0~zi38J8c@j<=v293|WWKSfhY_fiVVh1eLo|x?x%zXK=Asr2oe@x3 zsbu57B0rK^vm4_jnQPi}{^*pfza=BLzR&4?_`wev+rJ;{*D-(Z-u6B5&hBY#1{;&b z&m7mTDmTjv;+eM0YQ-$|RnwIxS8P4J$olPOj;VETdtR$*&%S1n?)vZ|Z}|Meznks; zX%*}}TIIL($juv8+K+5|B#)o0J9N)tpZ=HrUgr&EP8^p^?RLD*e(aS||HpR+bdTfcO=3qW2a6tPG(QdPCa!+-+asY$B)-=%&)jr@UKSJMAvi4y|k}~qXOC9=IjsG z-WADM(Brw%j{nwMS>rr?*#*acTd!Ov^`Idl{dX|mbQzn+iM$Pg=bGid_NB8P_NnZ>{5ycjj=|H_&t;ucLK6VYhECc5 literal 0 HcmV?d00001 diff --git a/doc/api/html/structstan_1_1gm_1_1var__size__validating__visgen-members.html b/doc/api/html/structstan_1_1gm_1_1var__size__validating__visgen-members.html new file mode 100644 index 00000000000..7122fe31ad8 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1var__size__validating__visgen-members.html @@ -0,0 +1,130 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::var_size_validating_visgen Member List
+
+
+ +

This is the complete list of members for stan::gm::var_size_validating_visgen, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
o_stan::gm::visgen
operator()(nil const &) const stan::gm::var_size_validating_visgeninline
operator()(int_var_decl const &x) const stan::gm::var_size_validating_visgeninline
operator()(double_var_decl const &x) const stan::gm::var_size_validating_visgeninline
operator()(vector_var_decl const &x) const stan::gm::var_size_validating_visgeninline
operator()(row_vector_var_decl const &x) const stan::gm::var_size_validating_visgeninline
operator()(unit_vector_var_decl const &x) const stan::gm::var_size_validating_visgeninline
operator()(simplex_var_decl const &x) const stan::gm::var_size_validating_visgeninline
operator()(ordered_var_decl const &x) const stan::gm::var_size_validating_visgeninline
operator()(positive_ordered_var_decl const &x) const stan::gm::var_size_validating_visgeninline
operator()(matrix_var_decl const &x) const stan::gm::var_size_validating_visgeninline
operator()(cholesky_factor_var_decl const &x) const stan::gm::var_size_validating_visgeninline
operator()(cov_matrix_var_decl const &x) const stan::gm::var_size_validating_visgeninline
operator()(corr_matrix_var_decl const &x) const stan::gm::var_size_validating_visgeninline
result_type typedefstan::gm::visgen
stage_stan::gm::var_size_validating_visgen
var_size_validating_visgen(std::ostream &o, const std::string &stage)stan::gm::var_size_validating_visgeninline
visgen(std::ostream &o)stan::gm::visgeninline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1var__size__validating__visgen.html b/doc/api/html/structstan_1_1gm_1_1var__size__validating__visgen.html new file mode 100644 index 00000000000..4fe83e76239 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1var__size__validating__visgen.html @@ -0,0 +1,570 @@ + + + + + +Stan: stan::gm::var_size_validating_visgen Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::var_size_validating_visgen Struct Reference
+
+
+ +

#include <generator.hpp>

+
+Inheritance diagram for stan::gm::var_size_validating_visgen:
+
+
+ + +stan::gm::visgen + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 var_size_validating_visgen (std::ostream &o, const std::string &stage)
 
void operator() (nil const &) const
 
void operator() (int_var_decl const &x) const
 
void operator() (double_var_decl const &x) const
 
void operator() (vector_var_decl const &x) const
 
void operator() (row_vector_var_decl const &x) const
 
void operator() (unit_vector_var_decl const &x) const
 
void operator() (simplex_var_decl const &x) const
 
void operator() (ordered_var_decl const &x) const
 
void operator() (positive_ordered_var_decl const &x) const
 
void operator() (matrix_var_decl const &x) const
 
void operator() (cholesky_factor_var_decl const &x) const
 
void operator() (cov_matrix_var_decl const &x) const
 
void operator() (corr_matrix_var_decl const &x) const
 
- Public Member Functions inherited from stan::gm::visgen
 visgen (std::ostream &o)
 
+ + + + + + +

+Public Attributes

const std::string stage_
 
- Public Attributes inherited from stan::gm::visgen
std::ostream & o_
 
+ + + + +

+Additional Inherited Members

- Public Types inherited from stan::gm::visgen
typedef void result_type
 
+

Detailed Description

+
+

Definition at line 370 of file generator.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
stan::gm::var_size_validating_visgen::var_size_validating_visgen (std::ostream & o,
const std::string & stage 
)
+
+inline
+
+ +

Definition at line 372 of file generator.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::var_size_validating_visgen::operator() (nil const & ) const
+
+inline
+
+ +

Definition at line 376 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::var_size_validating_visgen::operator() (int_var_decl const & x) const
+
+inline
+
+ +

Definition at line 377 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::var_size_validating_visgen::operator() (double_var_decl const & x) const
+
+inline
+
+ +

Definition at line 380 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::var_size_validating_visgen::operator() (vector_var_decl const & x) const
+
+inline
+
+ +

Definition at line 383 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::var_size_validating_visgen::operator() (row_vector_var_decl const & x) const
+
+inline
+
+ +

Definition at line 386 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::var_size_validating_visgen::operator() (unit_vector_var_decl const & x) const
+
+inline
+
+ +

Definition at line 389 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::var_size_validating_visgen::operator() (simplex_var_decl const & x) const
+
+inline
+
+ +

Definition at line 392 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::var_size_validating_visgen::operator() (ordered_var_decl const & x) const
+
+inline
+
+ +

Definition at line 395 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::var_size_validating_visgen::operator() (positive_ordered_var_decl const & x) const
+
+inline
+
+ +

Definition at line 398 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::var_size_validating_visgen::operator() (matrix_var_decl const & x) const
+
+inline
+
+ +

Definition at line 401 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::var_size_validating_visgen::operator() (cholesky_factor_var_decl const & x) const
+
+inline
+
+ +

Definition at line 404 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::var_size_validating_visgen::operator() (cov_matrix_var_decl const & x) const
+
+inline
+
+ +

Definition at line 407 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::var_size_validating_visgen::operator() (corr_matrix_var_decl const & x) const
+
+inline
+
+ +

Definition at line 410 of file generator.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
const std::string stan::gm::var_size_validating_visgen::stage_
+
+ +

Definition at line 371 of file generator.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1var__size__validating__visgen.png b/doc/api/html/structstan_1_1gm_1_1var__size__validating__visgen.png new file mode 100644 index 0000000000000000000000000000000000000000..03073e9d4bddd7a299b1ba0a97082537331963f8 GIT binary patch literal 777 zcmeAS@N?(olHy`uVBq!ia0vp^H-I>RgBeKr$a-f1DTx4|5ZC|z{{xvX-h3_XKQsZz z0^SZyxmj|73Gr zl>~)YHSgWbPN&Y6H09Q8c)Vv*?rpQhH&in1bPYVEJh^=)xdoXUsC(L9k(Kw%x>(OT zd5Ql@_8GSq-l@DT7+?SBQSs6Hmx4L?_pIH%ifzIY=~oQTjBP&g%z62=RAAY(ol`j# zJilLM*V&fjqrcvF*4oNhp$6Ovp5<3oi}w3vF@Ihw8U0ZwRMKJ6yA|g@oREIQp0G3h z%fuzWe;u)&);P2L+?Vx}AAQY^HuO2VS*-AtrRMHQ(WP4dW`#{zlD$>+=1=DznH#oU zejlXldGhPWuAlEFEh*31JZVW-?P5{Ym#?D|CYekUo1xOXL^kL4wp=I18ejefNmK0` zj}0|%u1T=IJ}2dJ)7q6B2GhhO4tPW*Feqm>GWINCWiyyWNZ`ZzqH{YXTbXD0bMqvq z=o&OkoYGjjG>2=OH0$mRx%rG&zI?whpN09yY97DiI!ZU}e$KzYrJ!0*<>TLU#XFb& z#($djQnFQGeSgZ96+2ry9_}tydrQ2D1lurfUUc5c8bE7jhWKGemtHS#%rtWaRdTraIz^i5( z4*z_yeam6q^Op}KsOO2T`LxEu__Cts>G;OI-QUI5tnrNdk|QCp{noPFgq?x+cywha z>@QySR4ZX-Zs7S>w~KhEP5WK4uV7Es(PE98Y3I_8O)NU`J0^El*R{2Cx=yxuO+OX9 z()VbVHdD;&-}84|+q-&oZo*S-mVj4Z`EI{5(PO$&S~LIEx#=@a!``?#F~okUd%ybX pw=fn74_I)O@C7}eGux}4;mC45M}roda$ve;@O1TaS?83{1OPX5ZLa_T literal 0 HcmV?d00001 diff --git a/doc/api/html/structstan_1_1gm_1_1variable-members.html b/doc/api/html/structstan_1_1gm_1_1variable-members.html new file mode 100644 index 00000000000..13cab1ceffd --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1variable-members.html @@ -0,0 +1,117 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::variable Member List
+
+
+ +

This is the complete list of members for stan::gm::variable, including all inherited members.

+ + + + + + +
name_stan::gm::variable
set_type(const base_expr_type &base_type, size_t num_dims)stan::gm::variable
type_stan::gm::variable
variable()stan::gm::variable
variable(std::string name)stan::gm::variable
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1variable.html b/doc/api/html/structstan_1_1gm_1_1variable.html new file mode 100644 index 00000000000..9578cc0b27b --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1variable.html @@ -0,0 +1,233 @@ + + + + + +Stan: stan::gm::variable Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::variable Struct Reference
+
+
+ +

#include <ast.hpp>

+ + + + + + + + +

+Public Member Functions

 variable ()
 
 variable (std::string name)
 
void set_type (const base_expr_type &base_type, size_t num_dims)
 
+ + + + + +

+Public Attributes

std::string name_
 
expr_type type_
 
+

Detailed Description

+
+

Definition at line 298 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::variable::variable ()
+
+ +

Definition at line 559 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
stan::gm::variable::variable (std::string name)
+
+ +

Definition at line 560 of file ast_def.cpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + + + + + + + + + + + + + + +
void stan::gm::variable::set_type (const base_expr_typebase_type,
size_t num_dims 
)
+
+ +

Definition at line 561 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
std::string stan::gm::variable::name_
+
+ +

Definition at line 299 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
expr_type stan::gm::variable::type_
+
+ +

Definition at line 300 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1variable__dims-members.html b/doc/api/html/structstan_1_1gm_1_1variable__dims-members.html new file mode 100644 index 00000000000..e0f3d3659f3 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1variable__dims-members.html @@ -0,0 +1,116 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::variable_dims Member List
+
+
+ +

This is the complete list of members for stan::gm::variable_dims, including all inherited members.

+ + + + + +
dims_stan::gm::variable_dims
name_stan::gm::variable_dims
variable_dims()stan::gm::variable_dims
variable_dims(std::string const &name, std::vector< expression > const &dims)stan::gm::variable_dims
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1variable__dims.html b/doc/api/html/structstan_1_1gm_1_1variable__dims.html new file mode 100644 index 00000000000..8fb8f718bb4 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1variable__dims.html @@ -0,0 +1,212 @@ + + + + + +Stan: stan::gm::variable_dims Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::variable_dims Struct Reference
+
+
+ +

#include <ast.hpp>

+ + + + + + +

+Public Member Functions

 variable_dims ()
 
 variable_dims (std::string const &name, std::vector< expression > const &dims)
 
+ + + + + +

+Public Attributes

std::string name_
 
std::vector< expressiondims_
 
+

Detailed Description

+
+

Definition at line 263 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::variable_dims::variable_dims ()
+
+ +

Definition at line 505 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
stan::gm::variable_dims::variable_dims (std::string const & name,
std::vector< expression > const & dims 
)
+
+ +

Definition at line 506 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
std::vector<expression> stan::gm::variable_dims::dims_
+
+ +

Definition at line 265 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
std::string stan::gm::variable_dims::name_
+
+ +

Definition at line 264 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1variable__map-members.html b/doc/api/html/structstan_1_1gm_1_1variable__map-members.html new file mode 100644 index 00000000000..bd229566b78 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1variable__map-members.html @@ -0,0 +1,121 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::variable_map Member List
+
+
+ +

This is the complete list of members for stan::gm::variable_map, including all inherited members.

+ + + + + + + + + + +
add(const std::string &name, const base_var_decl &base_decl, const var_origin &vo)stan::gm::variable_map
exists(const std::string &name) const stan::gm::variable_map
get(const std::string &name) const stan::gm::variable_map
get_base_type(const std::string &name) const stan::gm::variable_map
get_num_dims(const std::string &name) const stan::gm::variable_map
get_origin(const std::string &name) const stan::gm::variable_map
map_stan::gm::variable_map
range_t typedefstan::gm::variable_map
remove(const std::string &name)stan::gm::variable_map
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1variable__map.html b/doc/api/html/structstan_1_1gm_1_1variable__map.html new file mode 100644 index 00000000000..c77e15741ee --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1variable__map.html @@ -0,0 +1,325 @@ + + + + + +Stan: stan::gm::variable_map Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::variable_map Struct Reference
+
+
+ +

#include <ast.hpp>

+ + + + +

+Public Types

typedef std::pair
+< base_var_decl, var_origin
range_t
 
+ + + + + + + + + + + + + + + +

+Public Member Functions

bool exists (const std::string &name) const
 
base_var_decl get (const std::string &name) const
 
base_expr_type get_base_type (const std::string &name) const
 
size_t get_num_dims (const std::string &name) const
 
var_origin get_origin (const std::string &name) const
 
void add (const std::string &name, const base_var_decl &base_decl, const var_origin &vo)
 
void remove (const std::string &name)
 
+ + + +

+Public Attributes

std::map< std::string, range_tmap_
 
+

Detailed Description

+
+

Definition at line 392 of file ast.hpp.

+

Member Typedef Documentation

+ +
+
+ +

Definition at line 393 of file ast.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::variable_map::add (const std::string & name,
const base_var_declbase_decl,
const var_originvo 
)
+
+ +

Definition at line 709 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
bool stan::gm::variable_map::exists (const std::string & name) const
+
+ +

Definition at line 690 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
base_var_decl stan::gm::variable_map::get (const std::string & name) const
+
+ +

Definition at line 693 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
base_expr_type stan::gm::variable_map::get_base_type (const std::string & name) const
+
+ +

Definition at line 698 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
size_t stan::gm::variable_map::get_num_dims (const std::string & name) const
+
+ +

Definition at line 701 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
var_origin stan::gm::variable_map::get_origin (const std::string & name) const
+
+ +

Definition at line 704 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + +
void stan::gm::variable_map::remove (const std::string & name)
+
+ +

Definition at line 714 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
std::map<std::string, range_t> stan::gm::variable_map::map_
+
+ +

Definition at line 394 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1vector__var__decl-members.html b/doc/api/html/structstan_1_1gm_1_1vector__var__decl-members.html new file mode 100644 index 00000000000..4158c8b19be --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1vector__var__decl-members.html @@ -0,0 +1,122 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::vector_var_decl Member List
+
+
+ +

This is the complete list of members for stan::gm::vector_var_decl, including all inherited members.

+ + + + + + + + + + + +
base_type_stan::gm::base_var_decl
base_var_decl()stan::gm::base_var_decl
base_var_decl(const base_expr_type &base_type)stan::gm::base_var_decl
base_var_decl(const std::string &name, const std::vector< expression > &dims, const base_expr_type &base_type)stan::gm::base_var_decl
dims_stan::gm::base_var_decl
M_stan::gm::vector_var_decl
name_stan::gm::base_var_decl
range_stan::gm::vector_var_decl
vector_var_decl()stan::gm::vector_var_decl
vector_var_decl(range const &range, expression const &M, std::string const &name, std::vector< expression > const &dims)stan::gm::vector_var_decl
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1vector__var__decl.html b/doc/api/html/structstan_1_1gm_1_1vector__var__decl.html new file mode 100644 index 00000000000..d65be481e15 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1vector__var__decl.html @@ -0,0 +1,247 @@ + + + + + +Stan: stan::gm::vector_var_decl Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::vector_var_decl Struct Reference
+
+
+ +

#include <ast.hpp>

+
+Inheritance diagram for stan::gm::vector_var_decl:
+
+
+ + +stan::gm::base_var_decl + +
+ + + + + + + + + + + + + +

+Public Member Functions

 vector_var_decl ()
 
 vector_var_decl (range const &range, expression const &M, std::string const &name, std::vector< expression > const &dims)
 
- Public Member Functions inherited from stan::gm::base_var_decl
 base_var_decl ()
 
 base_var_decl (const base_expr_type &base_type)
 
 base_var_decl (const std::string &name, const std::vector< expression > &dims, const base_expr_type &base_type)
 
+ + + + + + + + + + + + +

+Public Attributes

range range_
 
expression M_
 
- Public Attributes inherited from stan::gm::base_var_decl
std::string name_
 
std::vector< expressiondims_
 
base_expr_type base_type_
 
+

Detailed Description

+
+

Definition at line 455 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::vector_var_decl::vector_var_decl ()
+
+ +

Definition at line 786 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
stan::gm::vector_var_decl::vector_var_decl (range const & range,
expression const & M,
std::string const & name,
std::vector< expression > const & dims 
)
+
+ +

Definition at line 788 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
expression stan::gm::vector_var_decl::M_
+
+ +

Definition at line 457 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
range stan::gm::vector_var_decl::range_
+
+ +

Definition at line 456 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1vector__var__decl.png b/doc/api/html/structstan_1_1gm_1_1vector__var__decl.png new file mode 100644 index 0000000000000000000000000000000000000000..37bea37cc356b83999b5523cb35087f521474a10 GIT binary patch literal 691 zcmeAS@N?(olHy`uVBq!ia0vp^bAUL2gBeKP_Ia}bNJ#|vgt-3y{~ySF@#br3|Dg#$ z78oBmaDcV*jy#adQ4-`A%m7pb0#{Fk7%?y~IeEG`hEy=VoqLh*wgQhUzj@IA|C6t? zaj;#QQZd!dbjh79oHy(an(f(?d)sXF4V6qkT?@}o83#QlxvLjAPI4>F-lSss>do73 z`6ll33k&Yd6aGHm=!aD2_D9-&oorv7JGW`~Mn3*gaO2s^F&04#ow}+%#{| zf}+qLSG^C%p2-%^f7o^3%u9TKl=$nPBJ1QWmhbY*j(b^Ma8be1gJ1QtW_JDquMPaX z7t=BY)}6^QDn1bTb=%iheOF_c!>=yLTzGnx_y6+`^RC34^LjJqarfq>Z<~vzhIt>H zm1jHc%ZBfzt5srO<(Hd!?pj#53QoJlZCg>DcP)7c68=Zi~SnKw^v^CuG!#cwL`*;^**!1hVYPOTa0hdce+$}{HF)k z)gM_8bUr;?{xNs@yWYc10nbmeymGfvuZ{Z5)PGR*am9t0!%r;=UrENiUUK@M=QOtm zQtjde@2_tuE{ZMYjR|cI4d1(d=Q_so5ACkUcxAuZ`q+81<6ZWfcA{BVGqy$VzN`3a z-Sv_M(TsXu`TZst?$GmOP`>s0PTmY= + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::visgen Member List
+
+
+ +

This is the complete list of members for stan::gm::visgen, including all inherited members.

+ + + + +
o_stan::gm::visgen
result_type typedefstan::gm::visgen
visgen(std::ostream &o)stan::gm::visgeninline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1visgen.html b/doc/api/html/structstan_1_1gm_1_1visgen.html new file mode 100644 index 00000000000..a8543867317 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1visgen.html @@ -0,0 +1,231 @@ + + + + + +Stan: stan::gm::visgen Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::visgen Struct Reference
+
+
+ +

generic visitor with output for extension + More...

+ +

#include <generator.hpp>

+
+Inheritance diagram for stan::gm::visgen:
+
+
+ + +stan::gm::constrained_param_names_visgen +stan::gm::dump_member_var_visgen +stan::gm::expression_visgen +stan::gm::generate_init_vars_visgen +stan::gm::generate_init_visgen +stan::gm::generate_local_var_init_nan_visgen +stan::gm::init_local_var_visgen +stan::gm::local_var_decl_visgen +stan::gm::member_var_decl_visgen +stan::gm::printable_visgen +stan::gm::set_param_ranges_visgen +stan::gm::statement_visgen +stan::gm::unconstrained_param_names_visgen +stan::gm::validate_transformed_params_visgen +stan::gm::validate_var_decl_visgen +stan::gm::var_resizing_visgen +stan::gm::var_size_validating_visgen +stan::gm::write_array_vars_visgen +stan::gm::write_array_visgen +stan::gm::write_csv_header_visgen +stan::gm::write_csv_vars_visgen +stan::gm::write_csv_visgen +stan::gm::write_dims_visgen +stan::gm::write_param_names_visgen + +
+ + + + +

+Public Types

typedef void result_type
 
+ + + +

+Public Member Functions

 visgen (std::ostream &o)
 
+ + + +

+Public Attributes

std::ostream & o_
 
+

Detailed Description

+

generic visitor with output for extension

+ +

Definition at line 61 of file generator.hpp.

+

Member Typedef Documentation

+ +
+
+ + + + +
typedef void stan::gm::visgen::result_type
+
+ +

Definition at line 62 of file generator.hpp.

+ +
+
+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::gm::visgen::visgen (std::ostream & o)
+
+inline
+
+ +

Definition at line 64 of file generator.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
std::ostream& stan::gm::visgen::o_
+
+ +

Definition at line 63 of file generator.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1visgen.png b/doc/api/html/structstan_1_1gm_1_1visgen.png new file mode 100644 index 0000000000000000000000000000000000000000..356359a8e67ed7f14410e28a587aa92ce96dc0e3 GIT binary patch literal 15238 zcmd^mYgkj)y0x{X)}rRLZc#+Zwhf>dK~X{ElD1eiqCtU*5hS({sFe`z7YRub3$=>T z072ze>LsE;G#~*2L`4Z95>(U(NeDEAh}^>^gxt&=d-UhFf*F_%(|1I0Q+xK&$ z(Fjgo4ot*S@0|r_Gym?~xnput0tbJ-7vqibnFB6@j%Urj4s+(XEJ1Jk)HmU+L1|x{ zd}ro6k3E&n$Ba8Hv#YE=xk@{D9Ti8tbZ^`I>Y`<7-*XqGHxw;c`j09GZc*Ax^;?Ul z6^Fkk!`B!6{-1^vd!@?`U2D{S?BRQ-n&%o9+nVm4;^2hc$=Zeqp7u*PoP8JdF#|3i z%OmFX7KFG-=8$un=Pow9%872Cwo-@2H*Sf%6_Qt7c)NX$;lpebYaIa_zC+?&&s=rs zty~UgSGjl&IUo82*`g-qoHE$?_7#7N8hVy?VV9^FxxSl7an|;#Ot6z{iATHa_ksJ6 zg?kh>N7V_GfyiFN0Mu{$UF6>`M9wdFXj2>eZUUiOo0-tLzdo0vM+#QhTMlawVy;%$@nk=KxW4?p0n1*aqoK4q@g-Y9D3Gf zTJZN^m~B02tH2yyL!#5JfzdsOOh;%;;G1=!x};b++yhvM)I&Wqccugm0;Pq zLi3XAhwa)}$;zu23D`+O%`zLi=chNq?W-iqM8m|>1%W(AQ+pftJZJaTh><}0pz+JG zifogDE)3oO=rRZO$SK+Qx%`dty3#Z?Ts+7y4c!PoqCG%Qr(&^P&XyHLp819pWP`iX zaC7auY7WekdCCb~lTM2abnZ1uV&kaeBX0%np|imu`pQNi|8OK0TiNT{5$E^GP;72N z0?yKMPgN#fGp7_lAfE8j2WwfYgqdnXGI^|k>vykS(;uMgpL%}R@sA%XS53VO6F(~6 zE9-0)sHY?4XHSoA7@NLTs>!K6eMZBGA<{sve`&e8C3$7k=-wnRkHJ-2< z-8)dl1a^IHjSl5&c77zgSrz;f zt;a&QF&jTYfoACx_!2`KcyBM3wgAk?XLz*3HhjwbY%BhM095p2vOd$AUHUJceL=YfJ!uZs5|qc~09ij#}>FT)0*2eB&H{v8x{wEQ$ngx<7H5 z_r!WMl~%(hSa<7XoF(!?>W(s4r23s~6Y~8w!b|Tq;}1wta{Q8kCmwO7{i=V$wwFzW zaCqE(uaWli8mu)@$J|fnWrvg;NwT{7F>LZ{d`h7z*kan3zUPZ7PSVcs4MP4ZcGD`4 zuxA~?8s7u%7S%4Lg!jlP_7z1w`?z&?b5@WfTM$8c!<{g4SS+s0Ep1Z zBQb%s(i+wsY65Ga6+e&hWaP?8v?{tjG5{a~MOXC2$N88U0?;btm{s{XdpAFPiWQ29 z#G$n)EVlky5I&_> zQM-o}!yuk%7|u!=5rs;q7(LlGGI%*XIfdYrY6tuAwYR$D?(Js6I8-E?H;R$>|o~g|G%}Tgc%wQU+N47Em0f5oW+S}G zVNpOj+%#fnD~BL-(WM6`CV^ue`6EGcbmCRkK#tq$6@>)XW>#Sg8w)-S-G8~`crjAB zRA0X^|2hv(5~VHTFQXn5Btb zPUVMrLqleHhOMnq!q(@R{Xg~J>1!mXm+n{2t6DM9r9)`)03r%#imdNE?Sw<8BY*y? zB_W>Mby4UaXCF@tB?vh=-IWcOM!keyG!ux-)(X}YX~&1!##dKseTS_ie3p5~e)_GZ z0eED<*i_f-7ZN>kt{XOE9ZiLl{E$OC?BY?`il+&7H|)5?F!LKi`B-M~T~oel5*!Cz zZ3OiTlZ#mr{pROs9K%R8l5<@ZK{8&ZzQ2#=dKvmrahiL!!uuo3&ism^(hvH9{IZU} zG2BRe?D!71$*<#4afz(6+tbWFd$80h z2^2C7Qb+S!D~k{p#}A<{`=tuWLo zfJk$OL>l=YDFmx6Qt7%a`q%=FIHtr#^tmXdEn|${rk|y2j&$AT)XBxk@IL>YI0>~PWb&h({{|i}hdDAUd7V6ty)%I

AZfI6e{l3~-LFEOR+a=5o+-tUa<=si zx;pTW9%JAQrUtS?G2E6!B^#d< z?T?Mi9TW-8T#-H^4HaI+y2A()Kf1D&vWMPsd<@6Hip~k77m)0A;RHpT(Uj$yFeL~P zeK;{vjq{q-WY)hB-2U^W?^1&keM1{RoTxy;Zalczt{d2IHkEhl|G=QQL})8$xEf=J zE$^pV$_{#Xqp4%7P;vxFuvnW0&PA+0`Cr*L#qwPN5dj2%2 zQV}*#t}Fw~ir?(8=P*szKh;yc76{XNp!6t(U~Yb$zWpZbzF`&n)u#VQ*!(Btmw$l4 z-_3RTrp-}r5|hudw95g^KYEOMd%-Gnfx=OvXScx7QM{#-h9^M?z7kR#Fh1ZsE*J&f zM-Xv%(i;j@5&F@B4oJZ5n0S$McB}*i7ir;67)rQ%<<<;k}wXovnfJ|V%EDZ85$mQUpGZ>?)DCX6`#?WmhKT5-FHclSLd5?n>Q^Gsj)~!eB zok@8vt=H~r3_)0-ML|fO({<#CfK(2N|KZ>@X!65W7z7y+KJisHnW8lYpdG$+4{}sV zXNiu?Ws&SYrRl85iY{n*?}BJ<%^&f@UxemB;PIfj3c^(7xsn!t*-qLp=!)%V) z)nfJOtgYpw8IrpzMYT9;(l_0cZ&j|%?7>1`nucV@C+!?*kPL=qY<{^9-)=a@e7s(H zHwDH3yl7SbEY0qUfy0u}0~rA|54X`ITSDiQAye9 zB=_CV?lZMqwm8f{a%J5P{z%Z!2aE|wf?r`#zM%Kh4n=l2WgeAR!`sWMGZnQX2hR*K zjHdY4d1XO1-rKC86iHp%;;sl1GP3dh$wOus+r4W|b!V00M+{cjF5dNpgm7Y8f-Mq; zH~;27h8@{$$N~nKRsHic%oY8lCC*_Ku#@X)sujQ63{EK|qRuKvjr-HaF36wkU(o1n$Hbvl{2w5e7O_Y_wcxTpLR&(F)rxnnwV8k- z-Oq2VirfW^HI(qe?eOr?yCLO^8Ctd!ZkdOWK}I%Q5Y^mil|D;T=cDqc`^-2$MDKKr zWZR<2pS+%otI=U9j@NMS&{c2O7e7a1Ez6k55z$n>V@%(>sBC=sgW`1r?W4hxFZHRZ znLYlsXOTp3Fdwwy+tp{`O{$T`-XFz7)Lq^HJZ|LIq;y5rW&UE}!=i=x@hC44&HOYOz>ta_T0AwDWylAH4(XmO zTQMp&JbQ=hcLvC#u&Mkvsyzy*cDc-Rq(Pe5qlH*Y4Ve&0e-{&CEd&;S5(Q5qrNH67 zP%PUGV%Z0;`J~%TnhwNz4+V&IhzpeO5E(;4aoE-YPExbWba{x}vWopeT~-=RT_8c-FMBdj;Do*k&CGW|AoaKMqXMIHxtn`p zjGH3z$3CIAB#O3129iV-;e@YUCU9$JBi>~stfP4seYADQ;8(34STig9M(yO@cprak z7td7+*$B0t|2p@TJu+;ZXj`6`qsig#@=Fo8(0ute-{g4xG8EUjT!0B z3LrUkTkx#-8=)Cyf-2MNs@?%mBeI17`{AU1wnlUw*>30VwZh3oPkz?xs)!kjxzkXd z+0zew&IgMr<{(Cp_aGa!=jYxMMUDRM{jKLHH>Qu}8Zr;$e{U!faMqFsG|Y$pL6qw`kEd zZ&o*!w9Jm_OA15Gk$h+OBQf7M?XQjo`aG|UPsw&n|o(l%Y z&Z&*1a+s>m0p6NM@WL9TfkzDkf0$<}8)?&yCJ(yh>?Z{#s77Ig|(dN`q=5)_dn z!PT2nSNXxXue9vgfMfB|lKvuWuHz=%L_~L3Z~lF)os(T53JQ%u7B#-TxJ>+u2?;#z zL6@QA%f8sr5OC362jSWshlGbh)jMI9UEj@m^>!>*av#N3@H}rv`oQ~5b>VGe!|<-h zCtR>*ut(rl!(Uex+d1_p%>jN?@w@B__kb+GvUEIZ!n?@PF==&B+Og7+RLQDALn-b3%GCV=g`9 zFi`F7Hpe=;tw9^!9k$mL_Mc3(+X#H#uva)DV|LDC2}JGC$)c+hTOdkE>4X zn2wrK^v2#LwDs4NhOl=?++I#`OTnZd1%0P#N%=}$24wGViDpmNM!6i>-L5-(mpgc* z;rS&o$3(P;$EeLzbfHtGjm=k^5$W28YWvaxxDlJ=~e9yCfw?fRV}p=7b4qh zbm**qP}RfELb9cJ|Lrd?Nv~2n9vz;n5|^I(0=RDez>9DelW7Q}4_O{*IRrh=Mpjr7 znnpUOR;ydH5vU$kTX|9orofN`A@({;hxsY9hdnhq_R!!7sUC3}t;hH_IQu)ewj?wl zR}xiyMfr@qr@l%m9seaIO=Xc({xqbkr zCIl5B$DtMD+dG9+on$TXRA`KGY_r^XY$j&8ge?2WB_rVQ`CJQs*I zSR$xT*$OHXPS+i^7mQp-CG_#EIHi@Q>Z^y$Fv4Qwh|jN+)6(=T^bUX2&%ki)N@CayJ#!N&UvMC zjWh4;0_I0PT7~KodqFHpgmfQNfcfuhHh+=Q6BQ~G$hvAqe?B3jd<$R|=mXLX8B~9Y z2RZ4fC}4evdLe*?_KXK@>Q8NZNPXP@DE3mDI|Jn|cYPNkFEoxu4g{b<)gDpd5_Oj@B`Mu=F z?F97+q!taE^rG1u0dZbNobh3~POPwt0vp2DqQJBi{lygy+kh3jhYZY)Y~$ob+=mlT zw@+k?F*YV=D$_KlEQ+w&g99LpEgE}S`T&sFq52uC!znr&5$!G;_d5fXg^5k7fm3=$ zLS8?hGU1W7b{hOCZKh3U#LrgH_AY{7PO9%CuEc_Y1PL-)MTClNzuTnsCMdsYqcH_O zdm!i|`2W~g_OFe9)p6D@PVqiEVvXp=A3X*G#27wt^l8X&rf@90ji{#ee1IYe0kjNG zpfiJ(@saWAjK6*wnT{GBo8Tqgb9WCFfOLa0QUM7h)3*~{iUfGsVvH~@NK z5aktI|=9C@wb-WRS?F2{QsnB2zatHADaW0b&j^uD#SUb|)Z3N^e4ZNMS zq=R6#qai(5Nz}avw`^kNCi%r%&fnsjrcXVM@2g2*-DKVI0_C3kUDJd5y5O#vOyt$Q z*zvN3hqgYomgeGf-?meSvxy$+tNFR@v0vg-;9~(ZWQJG;WM5&Se!}Jkz#oII4??rV9i{d6f?7L?P&u9Xcj2_95CYW+xarhq zXjYeB921Ne;1Twd3kV7oikvyKk<-TTI&wCuA}_|;t$`cEZxH+44a@fzI>B3NI?ZjU z>9SYP6B~J1>9C84LP)%{vGQ1ve13cW224PS^Of=Lp7iAbVJlRIy=mgw9da?FJue>t zxd!+Af~)Zng{{doabyB7zL?WlEh(_QUAmuYD;QiA`m+^36v~uuJH`|b0fV*T*w-HZ z*s@&W#b;aMH2QGe{-5lu6oyYTdwc@lh`L1VB;lnw7GoTe={b%SMtKRZZh`otXs3G0 zy&d1JMqdTZbSIb!x+&meJ0 zNvKW@u{ZP3_NdzcH4I`+Nb2n>!u*MA0mimu2i^%Tx(wKWqk z8`;r_UFyUqG0#_3Kai#(_)d^RVZ)L*RJAJI^If==a?aDh;ec?8ouKTAYsUt30hss` zg|~}5CyXgb#xoC#j^-#SsjVc=>ZP~$5cEU$e`(^tfhLY)+v#mwZAXMCZIY5lmkL;v zjB(wf(q0O+5*!Da<)qs8gZ2XGY;i|D7*EJaRQn54RgpUzt8x^z$0XyM$ffVa|8yuc53>bM>hlK; z+T#_GA@~$rmj)_56zthf(`_UTp9DGP)Iw~%s<)v3KET{0$sr4o6w=0>2B`pD2U3C0 zj%D`1|CXr$8%hOc!=~zcnV1ELgL06LYYC(293aL11?a|j0(p8ZMt5~Vrk)n-3vmoJX59;a6ybBQ>2%+ z_phEC%<06KgRTr4Nb~pq3TEcAfn*%E(&`l`v6pl@(-B@!Nj4tTLLV7Fp|`y%Mdoa0 z@rO0cF`YlV;|xyx==Nm^>JY6Yan&r`n9VGrM{85mbUg0eNdULq!7oHVN~a9BESLNQ zIw>Jio0w_0RVT_DN)ez&3?1m4dEnG_W9u|lw)K+oW6Od91P&TEIDnYM zDtQ)S2w?*smT_Q_G!DWR5yDL?zS=6fu!D1%sP8y4eEP+J+c~`7kx7sN2p}%CAiR9? z9{HbwBNO}So|oEtD69A6E{~;vvOxY)+HA*9G1T#M8p)uj@n6{s@Qp#(NnYm{KwCRN zHlPwx{=#8xV|ssHYsaITFH_LzJ!YV3+iS#y@bc;WaHifWa>o8uv-13?xdn|(lb#f0 zj&-bibl5Jm>JUUuiICVwJp>@0diF8&LN4gq_?%)7gSs|0T17e**>&1%jEr9(CP5!?pONPY2~jrM)jEBo!@Ll_z8*jE(2Q{ zezW)GH;;kJnZ-}TvvMsr`kU9y*}$X^n~*uILYqPJ`7vm1+;s<}muFB=db#8))44H5qbOQ~v(Y?=hTwA)z-J|e zxd6Z?u_;W)d(-k$*Q~p=N8}Gq*^2A^D!oJg)dve^wh#nah~S8FY#wgm!MX zU+d(<#1Cvun3fx=Gkc&)eF@$DvLawXLP(4 z6MN(X`6LYAo)K6nuAmoPBU~5jqiy&ezod)v!G5=go*-Scj6bE#F_2$f>ZEx%-YO=! zU@d(MDY?jzuUwx&YO6eIJ<%infzpB{@lSA$Uj2!&!|@&aMz9&mx0Pr=tmrrXBD6~0 z%6T5WXDU{Uwdgoqz!p~&bw3nz5xxO7#i%dDT>T3WeEM(+nr1)tEEU3E5wf+eEGT=r zs^CEMg$oGN5FhSzM7D{0Hv?3wNY?H5Q9juEQSgej?lbTO#s%Q)kDdN9 + + + + +Stan: Member List + + + + + + + + + +

+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::while_statement Member List
+
+
+ +

This is the complete list of members for stan::gm::while_statement, including all inherited members.

+ + + + + +
body_stan::gm::while_statement
condition_stan::gm::while_statement
while_statement()stan::gm::while_statement
while_statement(const expression &condition, const statement &body)stan::gm::while_statement
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1while__statement.html b/doc/api/html/structstan_1_1gm_1_1while__statement.html new file mode 100644 index 00000000000..6d53ebd479d --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1while__statement.html @@ -0,0 +1,212 @@ + + + + + +Stan: stan::gm::while_statement Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::while_statement Struct Reference
+
+
+ +

#include <ast.hpp>

+ + + + + + +

+Public Member Functions

 while_statement ()
 
 while_statement (const expression &condition, const statement &body)
 
+ + + + + +

+Public Attributes

expression condition_
 
statement body_
 
+

Detailed Description

+
+

Definition at line 633 of file ast.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + + + +
stan::gm::while_statement::while_statement ()
+
+ +

Definition at line 953 of file ast_def.cpp.

+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
stan::gm::while_statement::while_statement (const expressioncondition,
const statementbody 
)
+
+ +

Definition at line 955 of file ast_def.cpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
statement stan::gm::while_statement::body_
+
+ +

Definition at line 635 of file ast.hpp.

+ +
+
+ +
+
+ + + + +
expression stan::gm::while_statement::condition_
+
+ +

Definition at line 634 of file ast.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1whitespace__grammar-members.html b/doc/api/html/structstan_1_1gm_1_1whitespace__grammar-members.html new file mode 100644 index 00000000000..6b973a09990 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1whitespace__grammar-members.html @@ -0,0 +1,114 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::whitespace_grammar< Iterator > Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1whitespace__grammar.html b/doc/api/html/structstan_1_1gm_1_1whitespace__grammar.html new file mode 100644 index 00000000000..b331349a1ee --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1whitespace__grammar.html @@ -0,0 +1,181 @@ + + + + + +Stan: stan::gm::whitespace_grammar< Iterator > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::whitespace_grammar< Iterator > Struct Template Reference
+
+
+ +

#include <whitespace_grammar.hpp>

+
+Inheritance diagram for stan::gm::whitespace_grammar< Iterator >:
+
+
+ + + +
+ + + + +

+Public Member Functions

 whitespace_grammar ()
 
+ + + +

+Public Attributes

boost::spirit::qi::rule< Iterator > whitespace
 
+

Detailed Description

+

template<typename Iterator>
+struct stan::gm::whitespace_grammar< Iterator >

+ + +

Definition at line 11 of file whitespace_grammar.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename Iterator >
+ + + + + + + +
stan::gm::whitespace_grammar< Iterator >::whitespace_grammar ()
+
+ +

Definition at line 13 of file whitespace_grammar_def.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+
+template<typename Iterator>
+ + + + +
boost::spirit::qi::rule<Iterator> stan::gm::whitespace_grammar< Iterator >::whitespace
+
+ +

Definition at line 16 of file whitespace_grammar.hpp.

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1whitespace__grammar.png b/doc/api/html/structstan_1_1gm_1_1whitespace__grammar.png new file mode 100644 index 0000000000000000000000000000000000000000..8577a566fe067ac6da2a1dfd8004008edb5cc3e0 GIT binary patch literal 873 zcmeAS@N?(olHy`uVBq!ia0vp^-+(xPgBeK5c2;l#DTx4|5ZC|z{{xvX-h3_XKQsZz z0^bw|PtL zozoBPJO38?d2YMgDmyRvwq|(jr?>xhL@&Gje6eZ8pH;^*rmcCjcJIkxQya~7vbwVD zc9Tpl@L2D2Wzw3iu=Q*N+sa&Pf5UrczddXT@F`wXWT^PYr}^G3?@3mBJw6F;JG<&r z#_~L#Gkg-0XB{!i&WPX7IOp3whI;YcONysHnZ9BB9-g54mmK_h*>?9_Q;d2e`Q!GD z*i^|iXDr{`O#hs;eRjb7yKi4^kIg^8V;ySv`3K*(kK1jJ|2w+9HsoaP%a>Y}vB!#3 zxA!kgFn_A2{`19_TjCY#Z>qXn*7hv+-Jtq%PFzby+y7HD^*r-mq`g`9%HxuF$@jeF zF;kZ0zf!(2=}SH$TzIWp1nzJ?i2lX+L4E!Wdwac|wMqF`whxP1c^|l5olp4D0PhW&fT;T(J7D=2dSf{q4=lXMUe&a4udHAGb}b zMs(3MvKpt!Vx5tzw0xXI8}?==-M@ zCu(dflaRifVcXKiIZ|h}r(Cph>5jd$)N^~Gnq1=X`v*T*?A~1@+~CIe>l-Li(#xx- zEV;U`Z)aP6_1oKay|sUG&u?_Uzip-Vd96!3rhA#q&k8#E_QHlqKqGxmGcw$srRm$T zOngIb$X&*&SgT3?R(EUf%s=u@i}`@0@0@w1C*GMHh_%{zyEKYv&gGS+dnKeFtU9M| nd7yqVENJD}t2q=aF3Ybt*8j-l)O>SbzF_cl^>bP0l+XkK+MuFB literal 0 HcmV?d00001 diff --git a/doc/api/html/structstan_1_1gm_1_1write__array__vars__visgen-members.html b/doc/api/html/structstan_1_1gm_1_1write__array__vars__visgen-members.html new file mode 100644 index 00000000000..b2f50742350 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1write__array__vars__visgen-members.html @@ -0,0 +1,130 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::write_array_vars_visgen Member List
+
+
+ +

This is the complete list of members for stan::gm::write_array_vars_visgen, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
o_stan::gm::visgen
operator()(const nil &) const stan::gm::write_array_vars_visgeninline
operator()(const int_var_decl &x) const stan::gm::write_array_vars_visgeninline
operator()(const double_var_decl &x) const stan::gm::write_array_vars_visgeninline
operator()(const vector_var_decl &x) const stan::gm::write_array_vars_visgeninline
operator()(const row_vector_var_decl &x) const stan::gm::write_array_vars_visgeninline
operator()(const matrix_var_decl &x) const stan::gm::write_array_vars_visgeninline
operator()(const unit_vector_var_decl &x) const stan::gm::write_array_vars_visgeninline
operator()(const simplex_var_decl &x) const stan::gm::write_array_vars_visgeninline
operator()(const ordered_var_decl &x) const stan::gm::write_array_vars_visgeninline
operator()(const positive_ordered_var_decl &x) const stan::gm::write_array_vars_visgeninline
operator()(const cholesky_factor_var_decl &x) const stan::gm::write_array_vars_visgeninline
operator()(const cov_matrix_var_decl &x) const stan::gm::write_array_vars_visgeninline
operator()(const corr_matrix_var_decl &x) const stan::gm::write_array_vars_visgeninline
result_type typedefstan::gm::visgen
visgen(std::ostream &o)stan::gm::visgeninline
write_array(const std::string &name, const std::vector< expression > &arraydims, const std::vector< expression > &matdims) const stan::gm::write_array_vars_visgeninline
write_array_vars_visgen(std::ostream &o)stan::gm::write_array_vars_visgeninline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1write__array__vars__visgen.html b/doc/api/html/structstan_1_1gm_1_1write__array__vars__visgen.html new file mode 100644 index 00000000000..e912d520ddb --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1write__array__vars__visgen.html @@ -0,0 +1,583 @@ + + + + + +Stan: stan::gm::write_array_vars_visgen Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::write_array_vars_visgen Struct Reference
+
+
+ +

#include <generator.hpp>

+
+Inheritance diagram for stan::gm::write_array_vars_visgen:
+
+
+ + +stan::gm::visgen + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 write_array_vars_visgen (std::ostream &o)
 
void operator() (const nil &) const
 
void operator() (const int_var_decl &x) const
 
void operator() (const double_var_decl &x) const
 
void operator() (const vector_var_decl &x) const
 
void operator() (const row_vector_var_decl &x) const
 
void operator() (const matrix_var_decl &x) const
 
void operator() (const unit_vector_var_decl &x) const
 
void operator() (const simplex_var_decl &x) const
 
void operator() (const ordered_var_decl &x) const
 
void operator() (const positive_ordered_var_decl &x) const
 
void operator() (const cholesky_factor_var_decl &x) const
 
void operator() (const cov_matrix_var_decl &x) const
 
void operator() (const corr_matrix_var_decl &x) const
 
void write_array (const std::string &name, const std::vector< expression > &arraydims, const std::vector< expression > &matdims) const
 
- Public Member Functions inherited from stan::gm::visgen
 visgen (std::ostream &o)
 
+ + + + + + + +

+Additional Inherited Members

- Public Types inherited from stan::gm::visgen
typedef void result_type
 
- Public Attributes inherited from stan::gm::visgen
std::ostream & o_
 
+

Detailed Description

+
+

Definition at line 3727 of file generator.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::gm::write_array_vars_visgen::write_array_vars_visgen (std::ostream & o)
+
+inline
+
+ +

Definition at line 3728 of file generator.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_array_vars_visgen::operator() (const nil) const
+
+inline
+
+ +

Definition at line 3731 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_array_vars_visgen::operator() (const int_var_declx) const
+
+inline
+
+ +

Definition at line 3733 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_array_vars_visgen::operator() (const double_var_declx) const
+
+inline
+
+ +

Definition at line 3736 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_array_vars_visgen::operator() (const vector_var_declx) const
+
+inline
+
+ +

Definition at line 3739 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_array_vars_visgen::operator() (const row_vector_var_declx) const
+
+inline
+
+ +

Definition at line 3744 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_array_vars_visgen::operator() (const matrix_var_declx) const
+
+inline
+
+ +

Definition at line 3749 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_array_vars_visgen::operator() (const unit_vector_var_declx) const
+
+inline
+
+ +

Definition at line 3755 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_array_vars_visgen::operator() (const simplex_var_declx) const
+
+inline
+
+ +

Definition at line 3760 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_array_vars_visgen::operator() (const ordered_var_declx) const
+
+inline
+
+ +

Definition at line 3765 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_array_vars_visgen::operator() (const positive_ordered_var_declx) const
+
+inline
+
+ +

Definition at line 3770 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_array_vars_visgen::operator() (const cholesky_factor_var_declx) const
+
+inline
+
+ +

Definition at line 3775 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_array_vars_visgen::operator() (const cov_matrix_var_declx) const
+
+inline
+
+ +

Definition at line 3781 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_array_vars_visgen::operator() (const corr_matrix_var_declx) const
+
+inline
+
+ +

Definition at line 3787 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::write_array_vars_visgen::write_array (const std::string & name,
const std::vector< expression > & arraydims,
const std::vector< expression > & matdims 
) const
+
+inline
+
+ +

Definition at line 3793 of file generator.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1write__array__vars__visgen.png b/doc/api/html/structstan_1_1gm_1_1write__array__vars__visgen.png new file mode 100644 index 0000000000000000000000000000000000000000..4164b269af643eb2f182f9a96d320e9100b64f9c GIT binary patch literal 754 zcmeAS@N?(olHy`uVBq!ia0vp^XMi|>gBeIBMP&T|QW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;L3DtE6~+f6E2SKl;o z$@8mh!f6vW_!?h3zkbV)sLo)&eKsB2F0R_usB$+**rz9}H#hOL`xURL(NU|Dm_4i9 z*BY!m6XapWUfFUqc(UeZpt9iVnQKFfc-5xGYHik4{mrZLa$b~lgYGS zeLE*H;}M_eR>>tMF;j0|I=ju-|E`utT1xQN*?+TVdS2SNj`iD(_E*IQ*Zp=Hici|~ z@!**wrzS2jj@>+I$^EZ4jV3R#ztS*KrC-Wm(vv{rGbX;l>P$bFYZ<>RnwPL|pVgw5 zoM~w<+m~t2xOkSKChGu0#gzue4=Wg%9|SV99azl9(*X2215h`EoM{4s4Vr=n^PD&q ziVHIQx&YI}wyZIy?C+bMfA;+@HaL5aA=k^GczRuJ@wAs)Cma=v{$Z55P`^rdkBr&- zH_F@gs`{ONX8H4*iut+td7t)099dD`m}hXY>TBeUPl8*6bo)#nXU%w>nOYdy>|3_= ztI@1Scg5899^7|6Fa5{q(%{_NlS}H@Po!=GhJ#}m|1zD;rq#R#7p=873#HxOqj9Vz z_iy#~c|m)Y9bubg-mvM+x&ue%|GgQyF7&7W&GIhaQ$dEW&758rm8A3dRO)JpmQ#5og=$t}Be_S%7KK~_7$kNsfScJ1t{RJMXO>Gn!%cZdF6 zfAGzDp$8H6<(q9{6r^vr+HbasvhR78l;)?*ykq&Xvwe$p#-%Zwg9jatuoK7J7t-73 WYcDeMzbFPwpbVa_elF{r5}E+BXZ literal 0 HcmV?d00001 diff --git a/doc/api/html/structstan_1_1gm_1_1write__array__visgen-members.html b/doc/api/html/structstan_1_1gm_1_1write__array__visgen-members.html new file mode 100644 index 00000000000..1ed38bf34f1 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1write__array__visgen-members.html @@ -0,0 +1,131 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::write_array_visgen Member List
+
+
+ +

This is the complete list of members for stan::gm::write_array_visgen, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + +
generate_initialize_array(const std::string &var_type, const std::string &read_type, const std::vector< expression > &read_args, const std::string &name, const std::vector< expression > &dims) const stan::gm::write_array_visgeninline
generate_initialize_array_bounded(const D &x, const std::string &base_type, const std::string &read_fun_prefix, const std::vector< expression > &dim_args) const stan::gm::write_array_visgeninline
o_stan::gm::visgen
operator()(const nil &) const stan::gm::write_array_visgeninline
operator()(const int_var_decl &x) const stan::gm::write_array_visgeninline
operator()(const double_var_decl &x) const stan::gm::write_array_visgeninline
operator()(const vector_var_decl &x) const stan::gm::write_array_visgeninline
operator()(const row_vector_var_decl &x) const stan::gm::write_array_visgeninline
operator()(const matrix_var_decl &x) const stan::gm::write_array_visgeninline
operator()(const unit_vector_var_decl &x) const stan::gm::write_array_visgeninline
operator()(const simplex_var_decl &x) const stan::gm::write_array_visgeninline
operator()(const ordered_var_decl &x) const stan::gm::write_array_visgeninline
operator()(const positive_ordered_var_decl &x) const stan::gm::write_array_visgeninline
operator()(const cholesky_factor_var_decl &x) const stan::gm::write_array_visgeninline
operator()(const cov_matrix_var_decl &x) const stan::gm::write_array_visgeninline
operator()(const corr_matrix_var_decl &x) const stan::gm::write_array_visgeninline
result_type typedefstan::gm::visgen
visgen(std::ostream &o)stan::gm::visgeninline
write_array_visgen(std::ostream &o)stan::gm::write_array_visgeninline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1write__array__visgen.html b/doc/api/html/structstan_1_1gm_1_1write__array__visgen.html new file mode 100644 index 00000000000..01ed60d9f5c --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1write__array__visgen.html @@ -0,0 +1,648 @@ + + + + + +Stan: stan::gm::write_array_visgen Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::write_array_visgen Struct Reference
+
+
+ +

#include <generator.hpp>

+
+Inheritance diagram for stan::gm::write_array_visgen:
+
+
+ + +stan::gm::visgen + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 write_array_visgen (std::ostream &o)
 
void operator() (const nil &) const
 
void operator() (const int_var_decl &x) const
 
template<typename D >
void generate_initialize_array_bounded (const D &x, const std::string &base_type, const std::string &read_fun_prefix, const std::vector< expression > &dim_args) const
 
void operator() (const double_var_decl &x) const
 
void operator() (const vector_var_decl &x) const
 
void operator() (const row_vector_var_decl &x) const
 
void operator() (const matrix_var_decl &x) const
 
void operator() (const unit_vector_var_decl &x) const
 
void operator() (const simplex_var_decl &x) const
 
void operator() (const ordered_var_decl &x) const
 
void operator() (const positive_ordered_var_decl &x) const
 
void operator() (const cholesky_factor_var_decl &x) const
 
void operator() (const cov_matrix_var_decl &x) const
 
void operator() (const corr_matrix_var_decl &x) const
 
void generate_initialize_array (const std::string &var_type, const std::string &read_type, const std::vector< expression > &read_args, const std::string &name, const std::vector< expression > &dims) const
 
- Public Member Functions inherited from stan::gm::visgen
 visgen (std::ostream &o)
 
+ + + + + + + +

+Additional Inherited Members

- Public Types inherited from stan::gm::visgen
typedef void result_type
 
- Public Attributes inherited from stan::gm::visgen
std::ostream & o_
 
+

Detailed Description

+
+

Definition at line 3579 of file generator.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::gm::write_array_visgen::write_array_visgen (std::ostream & o)
+
+inline
+
+ +

Definition at line 3580 of file generator.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::write_array_visgen::generate_initialize_array (const std::string & var_type,
const std::string & read_type,
const std::vector< expression > & read_args,
const std::string & name,
const std::vector< expression > & dims 
) const
+
+inline
+
+ +

Definition at line 3667 of file generator.hpp.

+ +
+
+ +
+
+
+template<typename D >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::write_array_visgen::generate_initialize_array_bounded (const D & x,
const std::string & base_type,
const std::string & read_fun_prefix,
const std::vector< expression > & dim_args 
) const
+
+inline
+
+ +

Definition at line 3590 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_array_visgen::operator() (const nil) const
+
+inline
+
+ +

Definition at line 3583 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_array_visgen::operator() (const int_var_declx) const
+
+inline
+
+ +

Definition at line 3584 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_array_visgen::operator() (const double_var_declx) const
+
+inline
+
+ +

Definition at line 3611 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_array_visgen::operator() (const vector_var_declx) const
+
+inline
+
+ +

Definition at line 3615 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_array_visgen::operator() (const row_vector_var_declx) const
+
+inline
+
+ +

Definition at line 3620 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_array_visgen::operator() (const matrix_var_declx) const
+
+inline
+
+ +

Definition at line 3625 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_array_visgen::operator() (const unit_vector_var_declx) const
+
+inline
+
+ +

Definition at line 3631 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_array_visgen::operator() (const simplex_var_declx) const
+
+inline
+
+ +

Definition at line 3636 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_array_visgen::operator() (const ordered_var_declx) const
+
+inline
+
+ +

Definition at line 3641 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_array_visgen::operator() (const positive_ordered_var_declx) const
+
+inline
+
+ +

Definition at line 3646 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_array_visgen::operator() (const cholesky_factor_var_declx) const
+
+inline
+
+ +

Definition at line 3651 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_array_visgen::operator() (const cov_matrix_var_declx) const
+
+inline
+
+ +

Definition at line 3657 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_array_visgen::operator() (const corr_matrix_var_declx) const
+
+inline
+
+ +

Definition at line 3662 of file generator.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1write__array__visgen.png b/doc/api/html/structstan_1_1gm_1_1write__array__visgen.png new file mode 100644 index 0000000000000000000000000000000000000000..55625cef17ece10bee50c2e1c77f59bcfb979aec GIT binary patch literal 710 zcmeAS@N?(olHy`uVBq!ia0vp^Yk)X_gBeI}-k;Y2q$C1-LR|m<{|{uoc=NTi|Ih>= z3ycpOIKbL@M;^%KC<*clW&kPzfvcxNj2IZ0LOop^Ln;{G&V8NtMuCT|T|eml|B3$F z1oC$3++0)Lk}`E+7K3pi&)?IVbWZDR@VF$iV~tAWgH4lC4zh1@oRs(Jq?BjYPvuC@ zs&lqCH*~e#S$k{${!Xs>VUpfXRq67(-~8T{cIRCCdZsQ+*kO{} z4(;eu3vzBg-(Z$8uWaT!CXY*|-%ls}?n>UYQO8U2$&`1@K#_9(i2sH8C%$Q)mhzN( z7;21gyv>U>S7ybZ z$@#NsQpwR9I-a*a-!+<`;v5q;Nv9yvb5p|9*lDRVSs0k>7}65eZqA?InUg*#Hum|( zxn9@unHi*G#11e`XWeihl@X|%fg2x}L$M`Nf#FQ!X{Lw=n;67OHu0aizV!UP-+y1d zKWP`oTi`n}Hh<&wxwCg&ci39K=TT7jO4T^#^{kbprJc`XlcqOa&!5)p(wVz`ugA3B z&D%{+?#-Kc)=JlA)}HGfx0iY@-^?^+oAAq2?-si_`E}L%%l52p`?KW9bFXcuON_Vc zHtYW8PkH?6SAC`O>}K<$muj1Im+tkbJ#foNVq&lT?>jP6N`Jdouk)U8Z^7F4pJ%;I zxxLBe$D!$_)w;8f^JjnC!*i+e?E5Ic%!YMuQ~C3o-~QcZWU=z~=i3i9@GzYF`A+qh z-mQl}X1uWzXL$Z+Ua#6whr6E=t!I_)x}A`wU(UAU`0RxA-M!Np57ZxnhE&*10jC)) Z^*Ny`FaGrX&j2Pm22WQ%mvv4FO#nLiPksOZ literal 0 HcmV?d00001 diff --git a/doc/api/html/structstan_1_1gm_1_1write__csv__header__visgen-members.html b/doc/api/html/structstan_1_1gm_1_1write__csv__header__visgen-members.html new file mode 100644 index 00000000000..f35661f2278 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1write__csv__header__visgen-members.html @@ -0,0 +1,130 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::write_csv_header_visgen Member List
+
+
+ +

This is the complete list of members for stan::gm::write_csv_header_visgen, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
generate_csv_header_array(const std::vector< expression > &matrix_dims, const std::string &name, const std::vector< expression > &dims) const stan::gm::write_csv_header_visgeninline
o_stan::gm::visgen
operator()(const nil &) const stan::gm::write_csv_header_visgeninline
operator()(const int_var_decl &x) const stan::gm::write_csv_header_visgeninline
operator()(const double_var_decl &x) const stan::gm::write_csv_header_visgeninline
operator()(const vector_var_decl &x) const stan::gm::write_csv_header_visgeninline
operator()(const row_vector_var_decl &x) const stan::gm::write_csv_header_visgeninline
operator()(const matrix_var_decl &x) const stan::gm::write_csv_header_visgeninline
operator()(const unit_vector_var_decl &x) const stan::gm::write_csv_header_visgeninline
operator()(const simplex_var_decl &x) const stan::gm::write_csv_header_visgeninline
operator()(const ordered_var_decl &x) const stan::gm::write_csv_header_visgeninline
operator()(const positive_ordered_var_decl &x) const stan::gm::write_csv_header_visgeninline
operator()(const cholesky_factor_var_decl &x) const stan::gm::write_csv_header_visgeninline
operator()(const cov_matrix_var_decl &x) const stan::gm::write_csv_header_visgeninline
operator()(const corr_matrix_var_decl &x) const stan::gm::write_csv_header_visgeninline
result_type typedefstan::gm::visgen
visgen(std::ostream &o)stan::gm::visgeninline
write_csv_header_visgen(std::ostream &o)stan::gm::write_csv_header_visgeninline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1write__csv__header__visgen.html b/doc/api/html/structstan_1_1gm_1_1write__csv__header__visgen.html new file mode 100644 index 00000000000..a6c59768f68 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1write__csv__header__visgen.html @@ -0,0 +1,583 @@ + + + + + +Stan: stan::gm::write_csv_header_visgen Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::write_csv_header_visgen Struct Reference
+
+
+ +

#include <generator.hpp>

+
+Inheritance diagram for stan::gm::write_csv_header_visgen:
+
+
+ + +stan::gm::visgen + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 write_csv_header_visgen (std::ostream &o)
 
void operator() (const nil &) const
 
void operator() (const int_var_decl &x) const
 
void operator() (const double_var_decl &x) const
 
void operator() (const vector_var_decl &x) const
 
void operator() (const row_vector_var_decl &x) const
 
void operator() (const matrix_var_decl &x) const
 
void operator() (const unit_vector_var_decl &x) const
 
void operator() (const simplex_var_decl &x) const
 
void operator() (const ordered_var_decl &x) const
 
void operator() (const positive_ordered_var_decl &x) const
 
void operator() (const cholesky_factor_var_decl &x) const
 
void operator() (const cov_matrix_var_decl &x) const
 
void operator() (const corr_matrix_var_decl &x) const
 
void generate_csv_header_array (const std::vector< expression > &matrix_dims, const std::string &name, const std::vector< expression > &dims) const
 
- Public Member Functions inherited from stan::gm::visgen
 visgen (std::ostream &o)
 
+ + + + + + + +

+Additional Inherited Members

- Public Types inherited from stan::gm::visgen
typedef void result_type
 
- Public Attributes inherited from stan::gm::visgen
std::ostream & o_
 
+

Detailed Description

+
+

Definition at line 2790 of file generator.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::gm::write_csv_header_visgen::write_csv_header_visgen (std::ostream & o)
+
+inline
+
+ +

Definition at line 2791 of file generator.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::write_csv_header_visgen::generate_csv_header_array (const std::vector< expression > & matrix_dims,
const std::string & name,
const std::vector< expression > & dims 
) const
+
+inline
+
+ +

Definition at line 2856 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_header_visgen::operator() (const nil) const
+
+inline
+
+ +

Definition at line 2794 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_header_visgen::operator() (const int_var_declx) const
+
+inline
+
+ +

Definition at line 2795 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_header_visgen::operator() (const double_var_declx) const
+
+inline
+
+ +

Definition at line 2798 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_header_visgen::operator() (const vector_var_declx) const
+
+inline
+
+ +

Definition at line 2801 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_header_visgen::operator() (const row_vector_var_declx) const
+
+inline
+
+ +

Definition at line 2806 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_header_visgen::operator() (const matrix_var_declx) const
+
+inline
+
+ +

Definition at line 2811 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_header_visgen::operator() (const unit_vector_var_declx) const
+
+inline
+
+ +

Definition at line 2817 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_header_visgen::operator() (const simplex_var_declx) const
+
+inline
+
+ +

Definition at line 2822 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_header_visgen::operator() (const ordered_var_declx) const
+
+inline
+
+ +

Definition at line 2827 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_header_visgen::operator() (const positive_ordered_var_declx) const
+
+inline
+
+ +

Definition at line 2832 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_header_visgen::operator() (const cholesky_factor_var_declx) const
+
+inline
+
+ +

Definition at line 2837 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_header_visgen::operator() (const cov_matrix_var_declx) const
+
+inline
+
+ +

Definition at line 2843 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_header_visgen::operator() (const corr_matrix_var_declx) const
+
+inline
+
+ +

Definition at line 2849 of file generator.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1write__csv__header__visgen.png b/doc/api/html/structstan_1_1gm_1_1write__csv__header__visgen.png new file mode 100644 index 0000000000000000000000000000000000000000..16aaca5a42bf455b7c876196316903c48ffb4b7f GIT binary patch literal 763 zcmeAS@N?(olHy`uVBq!ia0vp^7l1f`gBeK1pW>beq$C1-LR|m<{|{uoc=NTi|Ih>= z3ycpOIKbL@M;^%KC<*clW&kPzfvcxNj2IZ0x;$MRLn;{G&b>Y9u>ue4?8mGA{8wLZ zobc}318*Z8SKZ??O@&spPKb}3mMZC~Gs&b+ZGy_zHJmD*wyy;hls(l;kGfB)yF8!K z^OAar_=zzHRuQA8)#~5Aiuy~09d@RF zn7Aan>K9+C!^yc`uda9`mV_6rJN@%cyI$Io9GCvA>Aycun!KcTE9>_M?QbSKvm7Q}*$noDXa>+%3XCQ&vIa}&1Pc!vWAo8!e&AO1+K>=j3*f|JkEgWFj^p8vih~; z``FuuUF+^Yv|KRx-t`8CKGBA2eEQvU|$EOuT*V+qb%8 z^Qr$LjKA+sGPaJ4a64EfpS|~|#lDJ&+>~=0)8@GFs!4qe*%fWjqqF$V6YZtbZqJtt zxM6UAABWCaN2~das@d0-bj)?n8{b|yse?&Fi#ys%ym3u=nS2*lSJCS(wR>0g>%42T z-+pBi*Ocio+!OwWKU=@&!MaP?n(NhV-t#9e?n>odvBOz1pvresX`h!~kr#8$4rkXQ zo|cOtMeF>3*0h{UQjk`?kT`uc)6v*-Tj%aL9oq0Jc3o5v!|z=`YZ)pcu6EpN==#iV zap8QdZ{Mm^E`{s!e&)IKs+TCSH0WpOFZwo#`3JvABSY0S7N!@G+7k?q@hqt~G0 + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::write_csv_vars_visgen Member List
+
+
+ +

This is the complete list of members for stan::gm::write_csv_vars_visgen, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
o_stan::gm::visgen
operator()(const nil &) const stan::gm::write_csv_vars_visgeninline
operator()(const int_var_decl &x) const stan::gm::write_csv_vars_visgeninline
operator()(const double_var_decl &x) const stan::gm::write_csv_vars_visgeninline
operator()(const vector_var_decl &x) const stan::gm::write_csv_vars_visgeninline
operator()(const row_vector_var_decl &x) const stan::gm::write_csv_vars_visgeninline
operator()(const matrix_var_decl &x) const stan::gm::write_csv_vars_visgeninline
operator()(const unit_vector_var_decl &x) const stan::gm::write_csv_vars_visgeninline
operator()(const simplex_var_decl &x) const stan::gm::write_csv_vars_visgeninline
operator()(const ordered_var_decl &x) const stan::gm::write_csv_vars_visgeninline
operator()(const positive_ordered_var_decl &x) const stan::gm::write_csv_vars_visgeninline
operator()(const cholesky_factor_var_decl &x) const stan::gm::write_csv_vars_visgeninline
operator()(const cov_matrix_var_decl &x) const stan::gm::write_csv_vars_visgeninline
operator()(const corr_matrix_var_decl &x) const stan::gm::write_csv_vars_visgeninline
result_type typedefstan::gm::visgen
visgen(std::ostream &o)stan::gm::visgeninline
write_array(const std::string &name, const std::vector< expression > &dims) const stan::gm::write_csv_vars_visgeninline
write_csv_vars_visgen(std::ostream &o)stan::gm::write_csv_vars_visgeninline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1write__csv__vars__visgen.html b/doc/api/html/structstan_1_1gm_1_1write__csv__vars__visgen.html new file mode 100644 index 00000000000..b57f89b97ed --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1write__csv__vars__visgen.html @@ -0,0 +1,577 @@ + + + + + +Stan: stan::gm::write_csv_vars_visgen Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::write_csv_vars_visgen Struct Reference
+
+
+ +

#include <generator.hpp>

+
+Inheritance diagram for stan::gm::write_csv_vars_visgen:
+
+
+ + +stan::gm::visgen + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 write_csv_vars_visgen (std::ostream &o)
 
void operator() (const nil &) const
 
void operator() (const int_var_decl &x) const
 
void operator() (const double_var_decl &x) const
 
void operator() (const vector_var_decl &x) const
 
void operator() (const row_vector_var_decl &x) const
 
void operator() (const matrix_var_decl &x) const
 
void operator() (const unit_vector_var_decl &x) const
 
void operator() (const simplex_var_decl &x) const
 
void operator() (const ordered_var_decl &x) const
 
void operator() (const positive_ordered_var_decl &x) const
 
void operator() (const cholesky_factor_var_decl &x) const
 
void operator() (const cov_matrix_var_decl &x) const
 
void operator() (const corr_matrix_var_decl &x) const
 
void write_array (const std::string &name, const std::vector< expression > &dims) const
 
- Public Member Functions inherited from stan::gm::visgen
 visgen (std::ostream &o)
 
+ + + + + + + +

+Additional Inherited Members

- Public Types inherited from stan::gm::visgen
typedef void result_type
 
- Public Attributes inherited from stan::gm::visgen
std::ostream & o_
 
+

Detailed Description

+
+

Definition at line 3421 of file generator.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::gm::write_csv_vars_visgen::write_csv_vars_visgen (std::ostream & o)
+
+inline
+
+ +

Definition at line 3422 of file generator.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_vars_visgen::operator() (const nil) const
+
+inline
+
+ +

Definition at line 3425 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_vars_visgen::operator() (const int_var_declx) const
+
+inline
+
+ +

Definition at line 3427 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_vars_visgen::operator() (const double_var_declx) const
+
+inline
+
+ +

Definition at line 3430 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_vars_visgen::operator() (const vector_var_declx) const
+
+inline
+
+ +

Definition at line 3433 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_vars_visgen::operator() (const row_vector_var_declx) const
+
+inline
+
+ +

Definition at line 3436 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_vars_visgen::operator() (const matrix_var_declx) const
+
+inline
+
+ +

Definition at line 3439 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_vars_visgen::operator() (const unit_vector_var_declx) const
+
+inline
+
+ +

Definition at line 3442 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_vars_visgen::operator() (const simplex_var_declx) const
+
+inline
+
+ +

Definition at line 3445 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_vars_visgen::operator() (const ordered_var_declx) const
+
+inline
+
+ +

Definition at line 3448 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_vars_visgen::operator() (const positive_ordered_var_declx) const
+
+inline
+
+ +

Definition at line 3451 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_vars_visgen::operator() (const cholesky_factor_var_declx) const
+
+inline
+
+ +

Definition at line 3454 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_vars_visgen::operator() (const cov_matrix_var_declx) const
+
+inline
+
+ +

Definition at line 3457 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_vars_visgen::operator() (const corr_matrix_var_declx) const
+
+inline
+
+ +

Definition at line 3460 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::gm::write_csv_vars_visgen::write_array (const std::string & name,
const std::vector< expression > & dims 
) const
+
+inline
+
+ +

Definition at line 3463 of file generator.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1write__csv__vars__visgen.png b/doc/api/html/structstan_1_1gm_1_1write__csv__vars__visgen.png new file mode 100644 index 0000000000000000000000000000000000000000..26c81ab5ee9fda55838591397baa1290b96e3857 GIT binary patch literal 732 zcmeAS@N?(olHy`uVBq!ia0vp^2Z1<%gBeIpU-r-gNJ#|vgt-3y{~ySF@#br3|Dg#$ z78oBmaDcV*jy#adQ4-`A%m7pb0#{Fk7%?y~WqZ0fhEy=Vo%?#-5(NRa?(-@4{!a{N ze{yNjX$x^aPRl8~B{SYMvHjnqbK1y6XOfA*Wrs<>jCfU6>gP*ZcvelcHk?#)>O8N? z%f)w03$nlI*@aDiZojhl^~e4g^FI%c{|daysj_nFY&N^8whI-en4e!asejAjE>4w~ zuJ5FmXn9rMxO(ogR-I{elG=nNY4=tx+RJf^rzUi%R#$iZ9EVA>cGgeI&E1obpd8$z zviHRDbB%@?=UfA;{JhrIi?;68SeLgedrnH!w-xtX_pev-v|6q^+rK7YU*d&r^S+12 z23^~?iG81e%FC{8fs;y3ZeQgwsqV1JgeCiYm_1*e&e{Oo)gk`3bLYFeR0I+j#SN-(%kriH~#C>XUC>vv8N1pDND# z=Y_2r$J4W$SGOFv^&olH^;pBxi}-Rgs=WWjCr`MSaKHS-k|}z>eWi}xIc}?AzIhwF z>lQ)#kc<2L^Cf;{6dP>v+W1xa*zzRp-^rp!k8Z#Dbn~>(D@hOj_i>lm+*(-iTJqLi zqrYal(nV!_J&uvD(&nw!I@P3Ab!<_{7WaiKyAI_Fi7Uji^Z8gy#oTlK%KIsQbx5FD z@msxBVS)!N>mS^X^<8-OK|wG>%m + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::write_csv_visgen Member List
+
+
+ +

This is the complete list of members for stan::gm::write_csv_visgen, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + +
generate_initialize_array(const std::string &var_type, const std::string &read_type, const std::vector< expression > &read_args, const std::string &name, const std::vector< expression > &dims) const stan::gm::write_csv_visgeninline
generate_initialize_array_bounded(const D &x, const std::string &base_type, const std::string &read_fun_prefix, const std::vector< expression > &dim_args) const stan::gm::write_csv_visgeninline
o_stan::gm::visgen
operator()(const nil &) const stan::gm::write_csv_visgeninline
operator()(const int_var_decl &x) const stan::gm::write_csv_visgeninline
operator()(const double_var_decl &x) const stan::gm::write_csv_visgeninline
operator()(const vector_var_decl &x) const stan::gm::write_csv_visgeninline
operator()(const row_vector_var_decl &x) const stan::gm::write_csv_visgeninline
operator()(const matrix_var_decl &x) const stan::gm::write_csv_visgeninline
operator()(const unit_vector_var_decl &x) const stan::gm::write_csv_visgeninline
operator()(const simplex_var_decl &x) const stan::gm::write_csv_visgeninline
operator()(const ordered_var_decl &x) const stan::gm::write_csv_visgeninline
operator()(const positive_ordered_var_decl &x) const stan::gm::write_csv_visgeninline
operator()(const cholesky_factor_var_decl &x) const stan::gm::write_csv_visgeninline
operator()(const cov_matrix_var_decl &x) const stan::gm::write_csv_visgeninline
operator()(const corr_matrix_var_decl &x) const stan::gm::write_csv_visgeninline
result_type typedefstan::gm::visgen
visgen(std::ostream &o)stan::gm::visgeninline
write_csv_visgen(std::ostream &o)stan::gm::write_csv_visgeninline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1write__csv__visgen.html b/doc/api/html/structstan_1_1gm_1_1write__csv__visgen.html new file mode 100644 index 00000000000..54fdd94b2e1 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1write__csv__visgen.html @@ -0,0 +1,648 @@ + + + + + +Stan: stan::gm::write_csv_visgen Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::write_csv_visgen Struct Reference
+
+
+ +

#include <generator.hpp>

+
+Inheritance diagram for stan::gm::write_csv_visgen:
+
+
+ + +stan::gm::visgen + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 write_csv_visgen (std::ostream &o)
 
template<typename D >
void generate_initialize_array_bounded (const D &x, const std::string &base_type, const std::string &read_fun_prefix, const std::vector< expression > &dim_args) const
 
void operator() (const nil &) const
 
void operator() (const int_var_decl &x) const
 
void operator() (const double_var_decl &x) const
 
void operator() (const vector_var_decl &x) const
 
void operator() (const row_vector_var_decl &x) const
 
void operator() (const matrix_var_decl &x) const
 
void operator() (const unit_vector_var_decl &x) const
 
void operator() (const simplex_var_decl &x) const
 
void operator() (const ordered_var_decl &x) const
 
void operator() (const positive_ordered_var_decl &x) const
 
void operator() (const cholesky_factor_var_decl &x) const
 
void operator() (const cov_matrix_var_decl &x) const
 
void operator() (const corr_matrix_var_decl &x) const
 
void generate_initialize_array (const std::string &var_type, const std::string &read_type, const std::vector< expression > &read_args, const std::string &name, const std::vector< expression > &dims) const
 
- Public Member Functions inherited from stan::gm::visgen
 visgen (std::ostream &o)
 
+ + + + + + + +

+Additional Inherited Members

- Public Types inherited from stan::gm::visgen
typedef void result_type
 
- Public Attributes inherited from stan::gm::visgen
std::ostream & o_
 
+

Detailed Description

+
+

Definition at line 3265 of file generator.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::gm::write_csv_visgen::write_csv_visgen (std::ostream & o)
+
+inline
+
+ +

Definition at line 3266 of file generator.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::write_csv_visgen::generate_initialize_array (const std::string & var_type,
const std::string & read_type,
const std::vector< expression > & read_args,
const std::string & name,
const std::vector< expression > & dims 
) const
+
+inline
+
+ +

Definition at line 3351 of file generator.hpp.

+ +
+
+ +
+
+
+template<typename D >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void stan::gm::write_csv_visgen::generate_initialize_array_bounded (const D & x,
const std::string & base_type,
const std::string & read_fun_prefix,
const std::vector< expression > & dim_args 
) const
+
+inline
+
+ +

Definition at line 3270 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_visgen::operator() (const nil) const
+
+inline
+
+ +

Definition at line 3290 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_visgen::operator() (const int_var_declx) const
+
+inline
+
+ +

Definition at line 3291 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_visgen::operator() (const double_var_declx) const
+
+inline
+
+ +

Definition at line 3295 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_visgen::operator() (const vector_var_declx) const
+
+inline
+
+ +

Definition at line 3299 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_visgen::operator() (const row_vector_var_declx) const
+
+inline
+
+ +

Definition at line 3304 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_visgen::operator() (const matrix_var_declx) const
+
+inline
+
+ +

Definition at line 3309 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_visgen::operator() (const unit_vector_var_declx) const
+
+inline
+
+ +

Definition at line 3315 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_visgen::operator() (const simplex_var_declx) const
+
+inline
+
+ +

Definition at line 3320 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_visgen::operator() (const ordered_var_declx) const
+
+inline
+
+ +

Definition at line 3325 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_visgen::operator() (const positive_ordered_var_declx) const
+
+inline
+
+ +

Definition at line 3330 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_visgen::operator() (const cholesky_factor_var_declx) const
+
+inline
+
+ +

Definition at line 3335 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_visgen::operator() (const cov_matrix_var_declx) const
+
+inline
+
+ +

Definition at line 3341 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_csv_visgen::operator() (const corr_matrix_var_declx) const
+
+inline
+
+ +

Definition at line 3346 of file generator.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1write__csv__visgen.png b/doc/api/html/structstan_1_1gm_1_1write__csv__visgen.png new file mode 100644 index 0000000000000000000000000000000000000000..990697e01348c4829c888d9889ebf5cd295b0c17 GIT binary patch literal 679 zcmeAS@N?(olHy`uVBq!ia0vp^3xPO*gBeJ=IX<-jQW60^A+G=b{|7Q(y!l$%e`o@b z1;z&s9ANFdBM;^rkaB2iDp!EK938d_1}A=u6)4gC|9w zn}6BOlW>%mF=vNj1Ft#DhKFqoW_JV*v`I7FC~#(w&f`cpjF9|jFV!Y+=!yV?+A)Y= z@39LDcDL0D*2)&mUuY@ype1L=zKU(-$yGVRu7`evdG#Ms-{_me=w9-1)7|fO*TOHJ z@2~a!<39PXLC@;%GgM;wPOO{7bY5(JR*c`%*i-w>+A7=2_D}cu+P~_#bZ^%CzQo|m zS-E$g?mfqLSmLhCnJdR%EfDivvFl=*{^D19{SwFQ*RxjcwR%}FS87}4>#FbP6O$w4 zx2DZ6kJW4P`@;Oh@XFH?>3;bc>!Tae_DJp9d)oH!=iN28QXA~*AO4?rStPlw^gYA9 z&o=Kv4fU7r(qzlN;mKYgzE|XNEZYxpXn<@4dHKvA#`Zl*-R(XzzXMYhgQu&X%Q~lo FCII!QKcoNv literal 0 HcmV?d00001 diff --git a/doc/api/html/structstan_1_1gm_1_1write__dims__visgen-members.html b/doc/api/html/structstan_1_1gm_1_1write__dims__visgen-members.html new file mode 100644 index 00000000000..8042d1738a7 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1write__dims__visgen-members.html @@ -0,0 +1,130 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::write_dims_visgen Member List
+
+
+ +

This is the complete list of members for stan::gm::write_dims_visgen, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
generate_dims_array(const std::vector< expression > &matrix_dims_exprs, const std::vector< expression > &array_dims_exprs) const stan::gm::write_dims_visgeninline
o_stan::gm::visgen
operator()(const nil &) const stan::gm::write_dims_visgeninline
operator()(const int_var_decl &x) const stan::gm::write_dims_visgeninline
operator()(const double_var_decl &x) const stan::gm::write_dims_visgeninline
operator()(const vector_var_decl &x) const stan::gm::write_dims_visgeninline
operator()(const row_vector_var_decl &x) const stan::gm::write_dims_visgeninline
operator()(const matrix_var_decl &x) const stan::gm::write_dims_visgeninline
operator()(const unit_vector_var_decl &x) const stan::gm::write_dims_visgeninline
operator()(const simplex_var_decl &x) const stan::gm::write_dims_visgeninline
operator()(const ordered_var_decl &x) const stan::gm::write_dims_visgeninline
operator()(const positive_ordered_var_decl &x) const stan::gm::write_dims_visgeninline
operator()(const cholesky_factor_var_decl &x) const stan::gm::write_dims_visgeninline
operator()(const cov_matrix_var_decl &x) const stan::gm::write_dims_visgeninline
operator()(const corr_matrix_var_decl &x) const stan::gm::write_dims_visgeninline
result_type typedefstan::gm::visgen
visgen(std::ostream &o)stan::gm::visgeninline
write_dims_visgen(std::ostream &o)stan::gm::write_dims_visgeninline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1write__dims__visgen.html b/doc/api/html/structstan_1_1gm_1_1write__dims__visgen.html new file mode 100644 index 00000000000..13a44d4d813 --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1write__dims__visgen.html @@ -0,0 +1,577 @@ + + + + + +Stan: stan::gm::write_dims_visgen Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::write_dims_visgen Struct Reference
+
+
+ +

#include <generator.hpp>

+
+Inheritance diagram for stan::gm::write_dims_visgen:
+
+
+ + +stan::gm::visgen + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 write_dims_visgen (std::ostream &o)
 
void operator() (const nil &) const
 
void operator() (const int_var_decl &x) const
 
void operator() (const double_var_decl &x) const
 
void operator() (const vector_var_decl &x) const
 
void operator() (const row_vector_var_decl &x) const
 
void operator() (const matrix_var_decl &x) const
 
void operator() (const unit_vector_var_decl &x) const
 
void operator() (const simplex_var_decl &x) const
 
void operator() (const ordered_var_decl &x) const
 
void operator() (const positive_ordered_var_decl &x) const
 
void operator() (const cholesky_factor_var_decl &x) const
 
void operator() (const cov_matrix_var_decl &x) const
 
void operator() (const corr_matrix_var_decl &x) const
 
void generate_dims_array (const std::vector< expression > &matrix_dims_exprs, const std::vector< expression > &array_dims_exprs) const
 
- Public Member Functions inherited from stan::gm::visgen
 visgen (std::ostream &o)
 
+ + + + + + + +

+Additional Inherited Members

- Public Types inherited from stan::gm::visgen
typedef void result_type
 
- Public Attributes inherited from stan::gm::visgen
std::ostream & o_
 
+

Detailed Description

+
+

Definition at line 2595 of file generator.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::gm::write_dims_visgen::write_dims_visgen (std::ostream & o)
+
+inline
+
+ +

Definition at line 2596 of file generator.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void stan::gm::write_dims_visgen::generate_dims_array (const std::vector< expression > & matrix_dims_exprs,
const std::vector< expression > & array_dims_exprs 
) const
+
+inline
+
+ +

Definition at line 2661 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_dims_visgen::operator() (const nil) const
+
+inline
+
+ +

Definition at line 2599 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_dims_visgen::operator() (const int_var_declx) const
+
+inline
+
+ +

Definition at line 2600 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_dims_visgen::operator() (const double_var_declx) const
+
+inline
+
+ +

Definition at line 2603 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_dims_visgen::operator() (const vector_var_declx) const
+
+inline
+
+ +

Definition at line 2606 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_dims_visgen::operator() (const row_vector_var_declx) const
+
+inline
+
+ +

Definition at line 2611 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_dims_visgen::operator() (const matrix_var_declx) const
+
+inline
+
+ +

Definition at line 2616 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_dims_visgen::operator() (const unit_vector_var_declx) const
+
+inline
+
+ +

Definition at line 2622 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_dims_visgen::operator() (const simplex_var_declx) const
+
+inline
+
+ +

Definition at line 2627 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_dims_visgen::operator() (const ordered_var_declx) const
+
+inline
+
+ +

Definition at line 2632 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_dims_visgen::operator() (const positive_ordered_var_declx) const
+
+inline
+
+ +

Definition at line 2637 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_dims_visgen::operator() (const cholesky_factor_var_declx) const
+
+inline
+
+ +

Definition at line 2642 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_dims_visgen::operator() (const cov_matrix_var_declx) const
+
+inline
+
+ +

Definition at line 2648 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_dims_visgen::operator() (const corr_matrix_var_declx) const
+
+inline
+
+ +

Definition at line 2654 of file generator.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1write__dims__visgen.png b/doc/api/html/structstan_1_1gm_1_1write__dims__visgen.png new file mode 100644 index 0000000000000000000000000000000000000000..ad013bbbabcff923c681754780b031c674d57f0c GIT binary patch literal 689 zcmeAS@N?(olHy`uVBq!ia0vp^%YZn5gBeIJnfuQXNJ#|vgt-3y{~ySF@#br3|Dg#$ z78oBmaDcV*jy#adQ4-`A%m7pb0#{Fk7%?y~Ie5A_hEy=Vo%?XoY6TuQ{`tnW|J~za zLp(%Q=We@xF7;Gl`jiRDOz+~`5+&a8H>=#8yH3+Hu*BE1>(Q#TNlUu-2q~|Wn}1=- z67!u4X1X2S66f~tzWvjOUsU2>mCwq5va|BqJElojp6y9Hw>@R<+Sd~!YhKT+n-=LX zX>2+$#II=5ofUe!)&KU-((}wcx3uQ%Vd*86>x{x*sjrj@ zyn3c~$`a*sXD6w+CtOy2x&FnhNg}S-r!3KMJDVuccAHt?Ec1hZHSNzHe-xc}f1zbm zUGwwl8Q&)J3AkTp=~$G_*c=* z4DbA)q7O~(7sxr6FOL4MpW1sl$F;p=bw=O)WiO?z;+L_9HvM@xOF#7A%$Em6Hn{!X zp>;(kdez+g^YSNp53Sm{W?P$@fpYTacYf<$h1(h}jP{*t9=1UtadCW!G&D&wk|kD!9qle(}uu+pAIx-Fq|dS54UU?K*S49vln%{9?&_v%OsRtzYi;WzYD$@_$%w z|NEI=woPR?{%0OzwAq55YoF8RO}=V#3g~I=^FNm{|1pMzL!j}}DS7Alt5lR%s-|g* Q1Jf6Sr>mdKI;Vst0L(#8-v9sr literal 0 HcmV?d00001 diff --git a/doc/api/html/structstan_1_1gm_1_1write__param__names__visgen-members.html b/doc/api/html/structstan_1_1gm_1_1write__param__names__visgen-members.html new file mode 100644 index 00000000000..558f263364b --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1write__param__names__visgen-members.html @@ -0,0 +1,130 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::gm::write_param_names_visgen Member List
+
+
+ +

This is the complete list of members for stan::gm::write_param_names_visgen, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
generate_param_names(const std::string &name) const stan::gm::write_param_names_visgeninline
o_stan::gm::visgen
operator()(const nil &) const stan::gm::write_param_names_visgeninline
operator()(const int_var_decl &x) const stan::gm::write_param_names_visgeninline
operator()(const double_var_decl &x) const stan::gm::write_param_names_visgeninline
operator()(const vector_var_decl &x) const stan::gm::write_param_names_visgeninline
operator()(const row_vector_var_decl &x) const stan::gm::write_param_names_visgeninline
operator()(const matrix_var_decl &x) const stan::gm::write_param_names_visgeninline
operator()(const unit_vector_var_decl &x) const stan::gm::write_param_names_visgeninline
operator()(const simplex_var_decl &x) const stan::gm::write_param_names_visgeninline
operator()(const ordered_var_decl &x) const stan::gm::write_param_names_visgeninline
operator()(const positive_ordered_var_decl &x) const stan::gm::write_param_names_visgeninline
operator()(const cholesky_factor_var_decl &x) const stan::gm::write_param_names_visgeninline
operator()(const cov_matrix_var_decl &x) const stan::gm::write_param_names_visgeninline
operator()(const corr_matrix_var_decl &x) const stan::gm::write_param_names_visgeninline
result_type typedefstan::gm::visgen
visgen(std::ostream &o)stan::gm::visgeninline
write_param_names_visgen(std::ostream &o)stan::gm::write_param_names_visgeninline
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1write__param__names__visgen.html b/doc/api/html/structstan_1_1gm_1_1write__param__names__visgen.html new file mode 100644 index 00000000000..def6297a69d --- /dev/null +++ b/doc/api/html/structstan_1_1gm_1_1write__param__names__visgen.html @@ -0,0 +1,567 @@ + + + + + +Stan: stan::gm::write_param_names_visgen Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::gm::write_param_names_visgen Struct Reference
+
+
+ +

#include <generator.hpp>

+
+Inheritance diagram for stan::gm::write_param_names_visgen:
+
+
+ + +stan::gm::visgen + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 write_param_names_visgen (std::ostream &o)
 
void operator() (const nil &) const
 
void operator() (const int_var_decl &x) const
 
void operator() (const double_var_decl &x) const
 
void operator() (const vector_var_decl &x) const
 
void operator() (const row_vector_var_decl &x) const
 
void operator() (const matrix_var_decl &x) const
 
void operator() (const unit_vector_var_decl &x) const
 
void operator() (const simplex_var_decl &x) const
 
void operator() (const ordered_var_decl &x) const
 
void operator() (const positive_ordered_var_decl &x) const
 
void operator() (const cholesky_factor_var_decl &x) const
 
void operator() (const cov_matrix_var_decl &x) const
 
void operator() (const corr_matrix_var_decl &x) const
 
void generate_param_names (const std::string &name) const
 
- Public Member Functions inherited from stan::gm::visgen
 visgen (std::ostream &o)
 
+ + + + + + + +

+Additional Inherited Members

- Public Types inherited from stan::gm::visgen
typedef void result_type
 
- Public Attributes inherited from stan::gm::visgen
std::ostream & o_
 
+

Detailed Description

+
+

Definition at line 2710 of file generator.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
stan::gm::write_param_names_visgen::write_param_names_visgen (std::ostream & o)
+
+inline
+
+ +

Definition at line 2711 of file generator.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_param_names_visgen::generate_param_names (const std::string & name) const
+
+inline
+
+ +

Definition at line 2752 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_param_names_visgen::operator() (const nil) const
+
+inline
+
+ +

Definition at line 2714 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_param_names_visgen::operator() (const int_var_declx) const
+
+inline
+
+ +

Definition at line 2715 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_param_names_visgen::operator() (const double_var_declx) const
+
+inline
+
+ +

Definition at line 2718 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_param_names_visgen::operator() (const vector_var_declx) const
+
+inline
+
+ +

Definition at line 2721 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_param_names_visgen::operator() (const row_vector_var_declx) const
+
+inline
+
+ +

Definition at line 2724 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_param_names_visgen::operator() (const matrix_var_declx) const
+
+inline
+
+ +

Definition at line 2727 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_param_names_visgen::operator() (const unit_vector_var_declx) const
+
+inline
+
+ +

Definition at line 2730 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_param_names_visgen::operator() (const simplex_var_declx) const
+
+inline
+
+ +

Definition at line 2733 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_param_names_visgen::operator() (const ordered_var_declx) const
+
+inline
+
+ +

Definition at line 2736 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_param_names_visgen::operator() (const positive_ordered_var_declx) const
+
+inline
+
+ +

Definition at line 2739 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_param_names_visgen::operator() (const cholesky_factor_var_declx) const
+
+inline
+
+ +

Definition at line 2742 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_param_names_visgen::operator() (const cov_matrix_var_declx) const
+
+inline
+
+ +

Definition at line 2745 of file generator.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + + +
void stan::gm::write_param_names_visgen::operator() (const corr_matrix_var_declx) const
+
+inline
+
+ +

Definition at line 2748 of file generator.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1gm_1_1write__param__names__visgen.png b/doc/api/html/structstan_1_1gm_1_1write__param__names__visgen.png new file mode 100644 index 0000000000000000000000000000000000000000..1258a7142827b84332cef800e7584d9a86327b98 GIT binary patch literal 775 zcmeAS@N?(olHy`uVBq!ia0vp^w}Ci-gBeIJ*ZPnNq$C1-LR|m<{|{uoc=NTi|Ih>= z3ycpOIKbL@M;^%KC<*clW&kPzfvcxNj2IZ0rg^$JhEy=Vo%^t8vx0yt|Mi)B{ws%f zbF7&Wm3-;Yo0^#YZV@*Q$34`)Y~tJ8hny6%X_CCk6M zvsL!`Z{N^5Q#+@B=BMBL@9g|?#C@mW>uw9PzAQfl&*>%X(LP2?cP*NxtK~RN`R$4< zCeJEY^Np$g&v-TH1Ts6=0C3#a+=3aLPs;E~;pS0S8UCKU$?$9PX2vh->C7+u&#_&YKZkdLy`{7RFd$GA z+*u^xBoV^Wp!gJ~DY2TdgzxVQv%h<8)aK~BGv8Tt#w?!wbnJG!X?;ppE5g_GH>F&? zw2>v}V&%8@@vl!y%wM+t+akG{)xjyICB`SON!HKUW4_J8>gbvksoh=^vJ|ro+NBD(^Zl1cTy_hv_~2w{o>CFx4`6y85}Sb4q9e0L~qG(*OVf literal 0 HcmV?d00001 diff --git a/doc/api/html/structstan_1_1io_1_1stan__csv-members.html b/doc/api/html/structstan_1_1io_1_1stan__csv-members.html new file mode 100644 index 00000000000..6c6f2982289 --- /dev/null +++ b/doc/api/html/structstan_1_1io_1_1stan__csv-members.html @@ -0,0 +1,117 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::io::stan_csv Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1io_1_1stan__csv.html b/doc/api/html/structstan_1_1io_1_1stan__csv.html new file mode 100644 index 00000000000..0061a5ef660 --- /dev/null +++ b/doc/api/html/structstan_1_1io_1_1stan__csv.html @@ -0,0 +1,206 @@ + + + + + +Stan: stan::io::stan_csv Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::io::stan_csv Struct Reference
+
+
+ +

#include <stan_csv_reader.hpp>

+ + + + + + + + + + + + +

+Public Attributes

stan_csv_metadata metadata
 
Eigen::Matrix< std::string,
+Eigen::Dynamic, 1 > 
header
 
stan_csv_adaptation adaptation
 
Eigen::MatrixXd samples
 
stan_csv_timing timing
 
+

Detailed Description

+
+

Definition at line 60 of file stan_csv_reader.hpp.

+

Member Data Documentation

+ +
+
+ + + + +
stan_csv_adaptation stan::io::stan_csv::adaptation
+
+ +

Definition at line 63 of file stan_csv_reader.hpp.

+ +
+
+ +
+
+ + + + +
Eigen::Matrix<std::string, Eigen::Dynamic, 1> stan::io::stan_csv::header
+
+ +

Definition at line 62 of file stan_csv_reader.hpp.

+ +
+
+ +
+
+ + + + +
stan_csv_metadata stan::io::stan_csv::metadata
+
+ +

Definition at line 61 of file stan_csv_reader.hpp.

+ +
+
+ +
+
+ + + + +
Eigen::MatrixXd stan::io::stan_csv::samples
+
+ +

Definition at line 64 of file stan_csv_reader.hpp.

+ +
+
+ +
+
+ + + + +
stan_csv_timing stan::io::stan_csv::timing
+
+ +

Definition at line 65 of file stan_csv_reader.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1io_1_1stan__csv__adaptation-members.html b/doc/api/html/structstan_1_1io_1_1stan__csv__adaptation-members.html new file mode 100644 index 00000000000..0c2a164e43e --- /dev/null +++ b/doc/api/html/structstan_1_1io_1_1stan__csv__adaptation-members.html @@ -0,0 +1,115 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::io::stan_csv_adaptation Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1io_1_1stan__csv__adaptation.html b/doc/api/html/structstan_1_1io_1_1stan__csv__adaptation.html new file mode 100644 index 00000000000..ad423a7a6f8 --- /dev/null +++ b/doc/api/html/structstan_1_1io_1_1stan__csv__adaptation.html @@ -0,0 +1,189 @@ + + + + + +Stan: stan::io::stan_csv_adaptation Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::io::stan_csv_adaptation Struct Reference
+
+
+ +

#include <stan_csv_reader.hpp>

+ + + + +

+Public Member Functions

 stan_csv_adaptation ()
 
+ + + + + +

+Public Attributes

double step_size
 
Eigen::MatrixXd metric
 
+

Detailed Description

+
+

Definition at line 44 of file stan_csv_reader.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::io::stan_csv_adaptation::stan_csv_adaptation ()
+
+inline
+
+ +

Definition at line 48 of file stan_csv_reader.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
Eigen::MatrixXd stan::io::stan_csv_adaptation::metric
+
+ +

Definition at line 46 of file stan_csv_reader.hpp.

+ +
+
+ +
+
+ + + + +
double stan::io::stan_csv_adaptation::step_size
+
+ +

Definition at line 45 of file stan_csv_reader.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1io_1_1stan__csv__metadata-members.html b/doc/api/html/structstan_1_1io_1_1stan__csv__metadata-members.html new file mode 100644 index 00000000000..9f1f7b64a3d --- /dev/null +++ b/doc/api/html/structstan_1_1io_1_1stan__csv__metadata-members.html @@ -0,0 +1,129 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::io::stan_csv_metadata Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1io_1_1stan__csv__metadata.html b/doc/api/html/structstan_1_1io_1_1stan__csv__metadata.html new file mode 100644 index 00000000000..ea36188b310 --- /dev/null +++ b/doc/api/html/structstan_1_1io_1_1stan__csv__metadata.html @@ -0,0 +1,413 @@ + + + + + +Stan: stan::io::stan_csv_metadata Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::io::stan_csv_metadata Struct Reference
+
+
+ +

#include <stan_csv_reader.hpp>

+ + + + +

+Public Member Functions

 stan_csv_metadata ()
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Attributes

int stan_version_major
 
int stan_version_minor
 
int stan_version_patch
 
std::string model
 
std::string data
 
std::string init
 
size_t chain_id
 
size_t seed
 
bool random_seed
 
size_t num_samples
 
size_t num_warmup
 
bool save_warmup
 
size_t thin
 
bool append_samples
 
std::string algorithm
 
std::string engine
 
+

Detailed Description

+
+

Definition at line 16 of file stan_csv_reader.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::io::stan_csv_metadata::stan_csv_metadata ()
+
+inline
+
+ +

Definition at line 35 of file stan_csv_reader.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
std::string stan::io::stan_csv_metadata::algorithm
+
+ +

Definition at line 32 of file stan_csv_reader.hpp.

+ +
+
+ +
+
+ + + + +
bool stan::io::stan_csv_metadata::append_samples
+
+ +

Definition at line 31 of file stan_csv_reader.hpp.

+ +
+
+ +
+
+ + + + +
size_t stan::io::stan_csv_metadata::chain_id
+
+ +

Definition at line 24 of file stan_csv_reader.hpp.

+ +
+
+ +
+
+ + + + +
std::string stan::io::stan_csv_metadata::data
+
+ +

Definition at line 22 of file stan_csv_reader.hpp.

+ +
+
+ +
+
+ + + + +
std::string stan::io::stan_csv_metadata::engine
+
+ +

Definition at line 33 of file stan_csv_reader.hpp.

+ +
+
+ +
+
+ + + + +
std::string stan::io::stan_csv_metadata::init
+
+ +

Definition at line 23 of file stan_csv_reader.hpp.

+ +
+
+ +
+
+ + + + +
std::string stan::io::stan_csv_metadata::model
+
+ +

Definition at line 21 of file stan_csv_reader.hpp.

+ +
+
+ +
+
+ + + + +
size_t stan::io::stan_csv_metadata::num_samples
+
+ +

Definition at line 27 of file stan_csv_reader.hpp.

+ +
+
+ +
+
+ + + + +
size_t stan::io::stan_csv_metadata::num_warmup
+
+ +

Definition at line 28 of file stan_csv_reader.hpp.

+ +
+
+ +
+
+ + + + +
bool stan::io::stan_csv_metadata::random_seed
+
+ +

Definition at line 26 of file stan_csv_reader.hpp.

+ +
+
+ +
+
+ + + + +
bool stan::io::stan_csv_metadata::save_warmup
+
+ +

Definition at line 29 of file stan_csv_reader.hpp.

+ +
+
+ +
+
+ + + + +
size_t stan::io::stan_csv_metadata::seed
+
+ +

Definition at line 25 of file stan_csv_reader.hpp.

+ +
+
+ +
+
+ + + + +
int stan::io::stan_csv_metadata::stan_version_major
+
+ +

Definition at line 17 of file stan_csv_reader.hpp.

+ +
+
+ +
+
+ + + + +
int stan::io::stan_csv_metadata::stan_version_minor
+
+ +

Definition at line 18 of file stan_csv_reader.hpp.

+ +
+
+ +
+
+ + + + +
int stan::io::stan_csv_metadata::stan_version_patch
+
+ +

Definition at line 19 of file stan_csv_reader.hpp.

+ +
+
+ +
+
+ + + + +
size_t stan::io::stan_csv_metadata::thin
+
+ +

Definition at line 30 of file stan_csv_reader.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1io_1_1stan__csv__timing-members.html b/doc/api/html/structstan_1_1io_1_1stan__csv__timing-members.html new file mode 100644 index 00000000000..f7524c81eb0 --- /dev/null +++ b/doc/api/html/structstan_1_1io_1_1stan__csv__timing-members.html @@ -0,0 +1,115 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::io::stan_csv_timing Member List
+
+
+ +

This is the complete list of members for stan::io::stan_csv_timing, including all inherited members.

+ + + + +
samplingstan::io::stan_csv_timing
stan_csv_timing()stan::io::stan_csv_timinginline
warmupstan::io::stan_csv_timing
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1io_1_1stan__csv__timing.html b/doc/api/html/structstan_1_1io_1_1stan__csv__timing.html new file mode 100644 index 00000000000..526196f879e --- /dev/null +++ b/doc/api/html/structstan_1_1io_1_1stan__csv__timing.html @@ -0,0 +1,189 @@ + + + + + +Stan: stan::io::stan_csv_timing Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::io::stan_csv_timing Struct Reference
+
+
+ +

#include <stan_csv_reader.hpp>

+ + + + +

+Public Member Functions

 stan_csv_timing ()
 
+ + + + + +

+Public Attributes

double warmup
 
double sampling
 
+

Detailed Description

+
+

Definition at line 52 of file stan_csv_reader.hpp.

+

Constructor & Destructor Documentation

+ +
+
+ + + + + +
+ + + + + + + +
stan::io::stan_csv_timing::stan_csv_timing ()
+
+inline
+
+ +

Definition at line 56 of file stan_csv_reader.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + +
double stan::io::stan_csv_timing::sampling
+
+ +

Definition at line 54 of file stan_csv_reader.hpp.

+ +
+
+ +
+
+ + + + +
double stan::io::stan_csv_timing::warmup
+
+ +

Definition at line 53 of file stan_csv_reader.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__constant-members.html b/doc/api/html/structstan_1_1is__constant-members.html new file mode 100644 index 00000000000..44a244e2644 --- /dev/null +++ b/doc/api/html/structstan_1_1is__constant-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::is_constant< T > Member List
+
+
+ +

This is the complete list of members for stan::is_constant< T >, including all inherited members.

+ + +
value enum valuestan::is_constant< T >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__constant.html b/doc/api/html/structstan_1_1is__constant.html new file mode 100644 index 00000000000..7f3d58b6afa --- /dev/null +++ b/doc/api/html/structstan_1_1is__constant.html @@ -0,0 +1,168 @@ + + + + + +Stan: stan::is_constant< T > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::is_constant< T > Struct Template Reference
+
+
+ +

Metaprogramming struct to detect whether a given type is constant in the mathematical sense (not the C++ const sense). + More...

+ +

#include <traits.hpp>

+ + + + + +

+Public Types

enum  { value = boost::is_convertible<T,double>::value + }
 A boolean constant with equal to true if the type parameter T is a mathematical constant. More...
 
+

Detailed Description

+

template<typename T>
+struct stan::is_constant< T >

+ +

Metaprogramming struct to detect whether a given type is constant in the mathematical sense (not the C++ const sense).

+

If the parameter type is constant, value will be equal to true.

+

The baseline implementation in this abstract base class is to classify a type T as constant if it can be converted (i.e., assigned) to a double. This baseline should be overridden for any type that should be treated as a variable.

+
Template Parameters
+ + +
TType being tested.
+
+
+ +

Definition at line 30 of file traits.hpp.

+

Member Enumeration Documentation

+ +
+
+
+template<typename T >
+ + + + +
anonymous enum
+
+ +

A boolean constant with equal to true if the type parameter T is a mathematical constant.

+
Enumerator:
+ +
value  +
+
+
+ +

Definition at line 35 of file traits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__constant__struct-members.html b/doc/api/html/structstan_1_1is__constant__struct-members.html new file mode 100644 index 00000000000..d9fc9775073 --- /dev/null +++ b/doc/api/html/structstan_1_1is__constant__struct-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::is_constant_struct< T > Member List
+
+
+ +

This is the complete list of members for stan::is_constant_struct< T >, including all inherited members.

+ + +
value enum valuestan::is_constant_struct< T >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__constant__struct.html b/doc/api/html/structstan_1_1is__constant__struct.html new file mode 100644 index 00000000000..292a957734c --- /dev/null +++ b/doc/api/html/structstan_1_1is__constant__struct.html @@ -0,0 +1,157 @@ + + + + + +Stan: stan::is_constant_struct< T > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::is_constant_struct< T > Struct Template Reference
+
+
+ +

Metaprogram to determine if a type has a base scalar type that can be assigned to type double. + More...

+ +

#include <traits.hpp>

+ + + + +

+Public Types

enum  { value = is_constant<T>::value + }
 
+

Detailed Description

+

template<typename T>
+struct stan::is_constant_struct< T >

+ +

Metaprogram to determine if a type has a base scalar type that can be assigned to type double.

+ +

Definition at line 44 of file traits.hpp.

+

Member Enumeration Documentation

+ +
+
+
+template<typename T>
+ + + + +
anonymous enum
+
+
Enumerator:
+ +
value  +
+
+
+ +

Definition at line 45 of file traits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__constant__struct_3_01_eigen_1_1_block_3_01_t_01_4_01_4-members.html b/doc/api/html/structstan_1_1is__constant__struct_3_01_eigen_1_1_block_3_01_t_01_4_01_4-members.html new file mode 100644 index 00000000000..a3715bf7e92 --- /dev/null +++ b/doc/api/html/structstan_1_1is__constant__struct_3_01_eigen_1_1_block_3_01_t_01_4_01_4-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::is_constant_struct< Eigen::Block< T > > Member List
+
+
+ +

This is the complete list of members for stan::is_constant_struct< Eigen::Block< T > >, including all inherited members.

+ + +
value enum valuestan::is_constant_struct< Eigen::Block< T > >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__constant__struct_3_01_eigen_1_1_block_3_01_t_01_4_01_4.html b/doc/api/html/structstan_1_1is__constant__struct_3_01_eigen_1_1_block_3_01_t_01_4_01_4.html new file mode 100644 index 00000000000..f8e539e9ef9 --- /dev/null +++ b/doc/api/html/structstan_1_1is__constant__struct_3_01_eigen_1_1_block_3_01_t_01_4_01_4.html @@ -0,0 +1,153 @@ + + + + + +Stan: stan::is_constant_struct< Eigen::Block< T > > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::is_constant_struct< Eigen::Block< T > > Struct Template Reference
+
+
+ +

#include <traits.hpp>

+ + + + +

+Public Types

enum  { value = is_constant_struct<T>::value + }
 
+

Detailed Description

+

template<typename T>
+struct stan::is_constant_struct< Eigen::Block< T > >

+ + +

Definition at line 60 of file traits.hpp.

+

Member Enumeration Documentation

+ +
+
+
+template<typename T >
+ + + + +
anonymous enum
+
+
Enumerator:
+ +
value  +
+
+
+ +

Definition at line 61 of file traits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__constant__struct_3_01_eigen_1_1_matrix_3_01_t_00_01_r_00_01_c_01_4_01_4-members.html b/doc/api/html/structstan_1_1is__constant__struct_3_01_eigen_1_1_matrix_3_01_t_00_01_r_00_01_c_01_4_01_4-members.html new file mode 100644 index 00000000000..fa1092b99d6 --- /dev/null +++ b/doc/api/html/structstan_1_1is__constant__struct_3_01_eigen_1_1_matrix_3_01_t_00_01_r_00_01_c_01_4_01_4-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::is_constant_struct< Eigen::Matrix< T, R, C > > Member List
+
+
+ +

This is the complete list of members for stan::is_constant_struct< Eigen::Matrix< T, R, C > >, including all inherited members.

+ + +
value enum valuestan::is_constant_struct< Eigen::Matrix< T, R, C > >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__constant__struct_3_01_eigen_1_1_matrix_3_01_t_00_01_r_00_01_c_01_4_01_4.html b/doc/api/html/structstan_1_1is__constant__struct_3_01_eigen_1_1_matrix_3_01_t_00_01_r_00_01_c_01_4_01_4.html new file mode 100644 index 00000000000..221ffab9e49 --- /dev/null +++ b/doc/api/html/structstan_1_1is__constant__struct_3_01_eigen_1_1_matrix_3_01_t_00_01_r_00_01_c_01_4_01_4.html @@ -0,0 +1,153 @@ + + + + + +Stan: stan::is_constant_struct< Eigen::Matrix< T, R, C > > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::is_constant_struct< Eigen::Matrix< T, R, C > > Struct Template Reference
+
+
+ +

#include <traits.hpp>

+ + + + +

+Public Types

enum  { value = is_constant_struct<T>::value + }
 
+

Detailed Description

+

template<typename T, int R, int C>
+struct stan::is_constant_struct< Eigen::Matrix< T, R, C > >

+ + +

Definition at line 55 of file traits.hpp.

+

Member Enumeration Documentation

+ +
+
+
+template<typename T , int R, int C>
+ + + + +
anonymous enum
+
+
Enumerator:
+ +
value  +
+
+
+ +

Definition at line 56 of file traits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__constant__struct_3_01std_1_1vector_3_01_t_01_4_01_4-members.html b/doc/api/html/structstan_1_1is__constant__struct_3_01std_1_1vector_3_01_t_01_4_01_4-members.html new file mode 100644 index 00000000000..7809e0b277d --- /dev/null +++ b/doc/api/html/structstan_1_1is__constant__struct_3_01std_1_1vector_3_01_t_01_4_01_4-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::is_constant_struct< std::vector< T > > Member List
+
+
+ +

This is the complete list of members for stan::is_constant_struct< std::vector< T > >, including all inherited members.

+ + +
value enum valuestan::is_constant_struct< std::vector< T > >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__constant__struct_3_01std_1_1vector_3_01_t_01_4_01_4.html b/doc/api/html/structstan_1_1is__constant__struct_3_01std_1_1vector_3_01_t_01_4_01_4.html new file mode 100644 index 00000000000..e636d6696ff --- /dev/null +++ b/doc/api/html/structstan_1_1is__constant__struct_3_01std_1_1vector_3_01_t_01_4_01_4.html @@ -0,0 +1,153 @@ + + + + + +Stan: stan::is_constant_struct< std::vector< T > > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::is_constant_struct< std::vector< T > > Struct Template Reference
+
+
+ +

#include <traits.hpp>

+ + + + +

+Public Types

enum  { value = is_constant_struct<T>::value + }
 
+

Detailed Description

+

template<typename T>
+struct stan::is_constant_struct< std::vector< T > >

+ + +

Definition at line 50 of file traits.hpp.

+

Member Enumeration Documentation

+ +
+
+
+template<typename T >
+ + + + +
anonymous enum
+
+
Enumerator:
+ +
value  +
+
+
+ +

Definition at line 51 of file traits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__fvar-members.html b/doc/api/html/structstan_1_1is__fvar-members.html new file mode 100644 index 00000000000..28fb8663eb3 --- /dev/null +++ b/doc/api/html/structstan_1_1is__fvar-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::is_fvar< T > Member List
+
+
+ +

This is the complete list of members for stan::is_fvar< T >, including all inherited members.

+ + +
value enum valuestan::is_fvar< T >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__fvar.html b/doc/api/html/structstan_1_1is__fvar.html new file mode 100644 index 00000000000..073c34f84fc --- /dev/null +++ b/doc/api/html/structstan_1_1is__fvar.html @@ -0,0 +1,153 @@ + + + + + +Stan: stan::is_fvar< T > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::is_fvar< T > Struct Template Reference
+
+
+ +

#include <traits.hpp>

+ + + + +

+Public Types

enum  { value = false + }
 
+

Detailed Description

+

template<typename T>
+struct stan::is_fvar< T >

+ + +

Definition at line 389 of file traits.hpp.

+

Member Enumeration Documentation

+ +
+
+
+template<typename T >
+ + + + +
anonymous enum
+
+
Enumerator:
+ +
value  +
+
+
+ +

Definition at line 390 of file traits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__fvar_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4-members.html b/doc/api/html/structstan_1_1is__fvar_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4-members.html new file mode 100644 index 00000000000..a521535fa28 --- /dev/null +++ b/doc/api/html/structstan_1_1is__fvar_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::is_fvar< stan::agrad::fvar< T > > Member List
+
+
+ +

This is the complete list of members for stan::is_fvar< stan::agrad::fvar< T > >, including all inherited members.

+ + +
value enum valuestan::is_fvar< stan::agrad::fvar< T > >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__fvar_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html b/doc/api/html/structstan_1_1is__fvar_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html new file mode 100644 index 00000000000..46df71dd23b --- /dev/null +++ b/doc/api/html/structstan_1_1is__fvar_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html @@ -0,0 +1,153 @@ + + + + + +Stan: stan::is_fvar< stan::agrad::fvar< T > > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::is_fvar< stan::agrad::fvar< T > > Struct Template Reference
+
+
+ +

#include <traits.hpp>

+ + + + +

+Public Types

enum  { value = true + }
 
+

Detailed Description

+

template<typename T>
+struct stan::is_fvar< stan::agrad::fvar< T > >

+ + +

Definition at line 393 of file traits.hpp.

+

Member Enumeration Documentation

+ +
+
+
+template<typename T >
+ + + + +
anonymous enum
+
+
Enumerator:
+ +
value  +
+
+
+ +

Definition at line 394 of file traits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__var-members.html b/doc/api/html/structstan_1_1is__var-members.html new file mode 100644 index 00000000000..fa222077561 --- /dev/null +++ b/doc/api/html/structstan_1_1is__var-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::is_var< T > Member List
+
+
+ +

This is the complete list of members for stan::is_var< T >, including all inherited members.

+ + +
value enum valuestan::is_var< T >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__var.html b/doc/api/html/structstan_1_1is__var.html new file mode 100644 index 00000000000..1da4d95810f --- /dev/null +++ b/doc/api/html/structstan_1_1is__var.html @@ -0,0 +1,153 @@ + + + + + +Stan: stan::is_var< T > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::is_var< T > Struct Template Reference
+
+
+ +

#include <traits.hpp>

+ + + + +

+Public Types

enum  { value = false + }
 
+

Detailed Description

+

template<typename T>
+struct stan::is_var< T >

+ + +

Definition at line 399 of file traits.hpp.

+

Member Enumeration Documentation

+ +
+
+
+template<typename T >
+ + + + +
anonymous enum
+
+
Enumerator:
+ +
value  +
+
+
+ +

Definition at line 400 of file traits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__var_3_01stan_1_1agrad_1_1var_01_4-members.html b/doc/api/html/structstan_1_1is__var_3_01stan_1_1agrad_1_1var_01_4-members.html new file mode 100644 index 00000000000..f6d5eeea441 --- /dev/null +++ b/doc/api/html/structstan_1_1is__var_3_01stan_1_1agrad_1_1var_01_4-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::is_var< stan::agrad::var > Member List
+
+
+ +

This is the complete list of members for stan::is_var< stan::agrad::var >, including all inherited members.

+ + +
value enum valuestan::is_var< stan::agrad::var >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__var_3_01stan_1_1agrad_1_1var_01_4.html b/doc/api/html/structstan_1_1is__var_3_01stan_1_1agrad_1_1var_01_4.html new file mode 100644 index 00000000000..24505dbcf72 --- /dev/null +++ b/doc/api/html/structstan_1_1is__var_3_01stan_1_1agrad_1_1var_01_4.html @@ -0,0 +1,151 @@ + + + + + +Stan: stan::is_var< stan::agrad::var > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::is_var< stan::agrad::var > Struct Template Reference
+
+
+ +

#include <traits.hpp>

+ + + + +

+Public Types

enum  { value = true + }
 
+

Detailed Description

+

template<>
+struct stan::is_var< stan::agrad::var >

+ + +

Definition at line 403 of file traits.hpp.

+

Member Enumeration Documentation

+ +
+
+ + + + +
anonymous enum
+
+
Enumerator:
+ +
value  +
+
+
+ +

Definition at line 404 of file traits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__var__or__arithmetic-members.html b/doc/api/html/structstan_1_1is__var__or__arithmetic-members.html new file mode 100644 index 00000000000..0a6312e1ab1 --- /dev/null +++ b/doc/api/html/structstan_1_1is__var__or__arithmetic-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::is_var_or_arithmetic< T1, T2, T3, T4, T5, T6 > Member List
+
+
+ +

This is the complete list of members for stan::is_var_or_arithmetic< T1, T2, T3, T4, T5, T6 >, including all inherited members.

+ + +
value enum valuestan::is_var_or_arithmetic< T1, T2, T3, T4, T5, T6 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__var__or__arithmetic.html b/doc/api/html/structstan_1_1is__var__or__arithmetic.html new file mode 100644 index 00000000000..dcd676cbb0e --- /dev/null +++ b/doc/api/html/structstan_1_1is__var__or__arithmetic.html @@ -0,0 +1,153 @@ + + + + + +Stan: stan::is_var_or_arithmetic< T1, T2, T3, T4, T5, T6 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::is_var_or_arithmetic< T1, T2, T3, T4, T5, T6 > Struct Template Reference
+
+
+ +

#include <traits.hpp>

+ + + + +

+Public Types

enum  { value + }
 
+

Detailed Description

+

template<typename T1, typename T2 = double, typename T3 = double, typename T4 = double, typename T5 = double, typename T6 = double>
+struct stan::is_var_or_arithmetic< T1, T2, T3, T4, T5, T6 >

+ + +

Definition at line 439 of file traits.hpp.

+

Member Enumeration Documentation

+ +
+
+
+template<typename T1 , typename T2 = double, typename T3 = double, typename T4 = double, typename T5 = double, typename T6 = double>
+ + + + +
anonymous enum
+
+
Enumerator:
+ +
value  +
+
+
+ +

Definition at line 440 of file traits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__vector-members.html b/doc/api/html/structstan_1_1is__vector-members.html new file mode 100644 index 00000000000..01c56bd24e6 --- /dev/null +++ b/doc/api/html/structstan_1_1is__vector-members.html @@ -0,0 +1,114 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::is_vector< T > Member List
+
+
+ +

This is the complete list of members for stan::is_vector< T >, including all inherited members.

+ + + +
type typedefstan::is_vector< T >
value enum valuestan::is_vector< T >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__vector.html b/doc/api/html/structstan_1_1is__vector.html new file mode 100644 index 00000000000..f6029d1b5ab --- /dev/null +++ b/doc/api/html/structstan_1_1is__vector.html @@ -0,0 +1,172 @@ + + + + + +Stan: stan::is_vector< T > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::is_vector< T > Struct Template Reference
+
+
+ +

#include <traits.hpp>

+ + + + + + +

+Public Types

enum  { value = 0 + }
 
typedef T type
 
+

Detailed Description

+

template<typename T>
+struct stan::is_vector< T >

+ + +

Definition at line 70 of file traits.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T>
+ + + + +
typedef T stan::is_vector< T >::type
+
+ +

Definition at line 72 of file traits.hpp.

+ +
+
+

Member Enumeration Documentation

+ +
+
+
+template<typename T>
+ + + + +
anonymous enum
+
+
Enumerator:
+ +
value  +
+
+
+ +

Definition at line 71 of file traits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__vector_3_01_eigen_1_1_matrix_3_01_t_00_011_00_01_eigen_1_1_dynamic_01_4_01_4-members.html b/doc/api/html/structstan_1_1is__vector_3_01_eigen_1_1_matrix_3_01_t_00_011_00_01_eigen_1_1_dynamic_01_4_01_4-members.html new file mode 100644 index 00000000000..b59056e91d7 --- /dev/null +++ b/doc/api/html/structstan_1_1is__vector_3_01_eigen_1_1_matrix_3_01_t_00_011_00_01_eigen_1_1_dynamic_01_4_01_4-members.html @@ -0,0 +1,114 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::is_vector< Eigen::Matrix< T, 1, Eigen::Dynamic > > Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__vector_3_01_eigen_1_1_matrix_3_01_t_00_011_00_01_eigen_1_1_dynamic_01_4_01_4.html b/doc/api/html/structstan_1_1is__vector_3_01_eigen_1_1_matrix_3_01_t_00_011_00_01_eigen_1_1_dynamic_01_4_01_4.html new file mode 100644 index 00000000000..d27ca27d817 --- /dev/null +++ b/doc/api/html/structstan_1_1is__vector_3_01_eigen_1_1_matrix_3_01_t_00_011_00_01_eigen_1_1_dynamic_01_4_01_4.html @@ -0,0 +1,172 @@ + + + + + +Stan: stan::is_vector< Eigen::Matrix< T, 1, Eigen::Dynamic > > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::is_vector< Eigen::Matrix< T, 1, Eigen::Dynamic > > Struct Template Reference
+
+
+ +

#include <traits.hpp>

+ + + + + + +

+Public Types

enum  { value = 1 + }
 
typedef T type
 
+

Detailed Description

+

template<typename T>
+struct stan::is_vector< Eigen::Matrix< T, 1, Eigen::Dynamic > >

+ + +

Definition at line 91 of file traits.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T >
+ + + + +
typedef T stan::is_vector< Eigen::Matrix< T, 1, Eigen::Dynamic > >::type
+
+ +

Definition at line 93 of file traits.hpp.

+ +
+
+

Member Enumeration Documentation

+ +
+
+
+template<typename T >
+ + + + +
anonymous enum
+
+
Enumerator:
+ +
value  +
+
+
+ +

Definition at line 92 of file traits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__vector_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_011_01_4_01_4-members.html b/doc/api/html/structstan_1_1is__vector_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_011_01_4_01_4-members.html new file mode 100644 index 00000000000..bb21dde1ccb --- /dev/null +++ b/doc/api/html/structstan_1_1is__vector_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_011_01_4_01_4-members.html @@ -0,0 +1,114 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::is_vector< Eigen::Matrix< T, Eigen::Dynamic, 1 > > Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__vector_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_011_01_4_01_4.html b/doc/api/html/structstan_1_1is__vector_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_011_01_4_01_4.html new file mode 100644 index 00000000000..e12b4865720 --- /dev/null +++ b/doc/api/html/structstan_1_1is__vector_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_011_01_4_01_4.html @@ -0,0 +1,172 @@ + + + + + +Stan: stan::is_vector< Eigen::Matrix< T, Eigen::Dynamic, 1 > > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::is_vector< Eigen::Matrix< T, Eigen::Dynamic, 1 > > Struct Template Reference
+
+
+ +

#include <traits.hpp>

+ + + + + + +

+Public Types

enum  { value = 1 + }
 
typedef T type
 
+

Detailed Description

+

template<typename T>
+struct stan::is_vector< Eigen::Matrix< T, Eigen::Dynamic, 1 > >

+ + +

Definition at line 86 of file traits.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T >
+ + + + +
typedef T stan::is_vector< Eigen::Matrix< T, Eigen::Dynamic, 1 > >::type
+
+ +

Definition at line 88 of file traits.hpp.

+ +
+
+

Member Enumeration Documentation

+ +
+
+
+template<typename T >
+ + + + +
anonymous enum
+
+
Enumerator:
+ +
value  +
+
+
+ +

Definition at line 87 of file traits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__vector_3_01const_01_t_01_4-members.html b/doc/api/html/structstan_1_1is__vector_3_01const_01_t_01_4-members.html new file mode 100644 index 00000000000..0d976d39c23 --- /dev/null +++ b/doc/api/html/structstan_1_1is__vector_3_01const_01_t_01_4-members.html @@ -0,0 +1,114 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::is_vector< const T > Member List
+
+
+ +

This is the complete list of members for stan::is_vector< const T >, including all inherited members.

+ + + +
type typedefstan::is_vector< const T >
value enum valuestan::is_vector< const T >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__vector_3_01const_01_t_01_4.html b/doc/api/html/structstan_1_1is__vector_3_01const_01_t_01_4.html new file mode 100644 index 00000000000..e769ba50ade --- /dev/null +++ b/doc/api/html/structstan_1_1is__vector_3_01const_01_t_01_4.html @@ -0,0 +1,172 @@ + + + + + +Stan: stan::is_vector< const T > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::is_vector< const T > Struct Template Reference
+
+
+ +

#include <traits.hpp>

+ + + + + + +

+Public Types

enum  { value = is_vector<T>::value + }
 
typedef T type
 
+

Detailed Description

+

template<typename T>
+struct stan::is_vector< const T >

+ + +

Definition at line 75 of file traits.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T >
+ + + + +
typedef T stan::is_vector< const T >::type
+
+ +

Definition at line 77 of file traits.hpp.

+ +
+
+

Member Enumeration Documentation

+ +
+
+
+template<typename T >
+ + + + +
anonymous enum
+
+
Enumerator:
+ +
value  +
+
+
+ +

Definition at line 76 of file traits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__vector_3_01std_1_1vector_3_01_t_01_4_01_4-members.html b/doc/api/html/structstan_1_1is__vector_3_01std_1_1vector_3_01_t_01_4_01_4-members.html new file mode 100644 index 00000000000..9da4c531141 --- /dev/null +++ b/doc/api/html/structstan_1_1is__vector_3_01std_1_1vector_3_01_t_01_4_01_4-members.html @@ -0,0 +1,114 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::is_vector< std::vector< T > > Member List
+
+
+ +

This is the complete list of members for stan::is_vector< std::vector< T > >, including all inherited members.

+ + + +
type typedefstan::is_vector< std::vector< T > >
value enum valuestan::is_vector< std::vector< T > >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__vector_3_01std_1_1vector_3_01_t_01_4_01_4.html b/doc/api/html/structstan_1_1is__vector_3_01std_1_1vector_3_01_t_01_4_01_4.html new file mode 100644 index 00000000000..4430eeeb73c --- /dev/null +++ b/doc/api/html/structstan_1_1is__vector_3_01std_1_1vector_3_01_t_01_4_01_4.html @@ -0,0 +1,172 @@ + + + + + +Stan: stan::is_vector< std::vector< T > > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::is_vector< std::vector< T > > Struct Template Reference
+
+
+ +

#include <traits.hpp>

+ + + + + + +

+Public Types

enum  { value = 1 + }
 
typedef T type
 
+

Detailed Description

+

template<typename T>
+struct stan::is_vector< std::vector< T > >

+ + +

Definition at line 80 of file traits.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T >
+ + + + +
typedef T stan::is_vector< std::vector< T > >::type
+
+ +

Definition at line 82 of file traits.hpp.

+ +
+
+

Member Enumeration Documentation

+ +
+
+
+template<typename T >
+ + + + +
anonymous enum
+
+
Enumerator:
+ +
value  +
+
+
+ +

Definition at line 81 of file traits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__vector__like-members.html b/doc/api/html/structstan_1_1is__vector__like-members.html new file mode 100644 index 00000000000..12df700f923 --- /dev/null +++ b/doc/api/html/structstan_1_1is__vector__like-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::is_vector_like< T > Member List
+
+
+ +

This is the complete list of members for stan::is_vector_like< T >, including all inherited members.

+ + +
value enum valuestan::is_vector_like< T >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__vector__like.html b/doc/api/html/structstan_1_1is__vector__like.html new file mode 100644 index 00000000000..18b06f9202e --- /dev/null +++ b/doc/api/html/structstan_1_1is__vector__like.html @@ -0,0 +1,153 @@ + + + + + +Stan: stan::is_vector_like< T > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::is_vector_like< T > Struct Template Reference
+
+
+ +

#include <traits.hpp>

+ + + + +

+Public Types

enum  { value = stan::is_vector<T>::value + }
 
+

Detailed Description

+

template<typename T>
+struct stan::is_vector_like< T >

+ + +

Definition at line 206 of file traits.hpp.

+

Member Enumeration Documentation

+ +
+
+
+template<typename T >
+ + + + +
anonymous enum
+
+
Enumerator:
+ +
value  +
+
+
+ +

Definition at line 207 of file traits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__vector__like_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4-members.html b/doc/api/html/structstan_1_1is__vector__like_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4-members.html new file mode 100644 index 00000000000..337e70771b2 --- /dev/null +++ b/doc/api/html/structstan_1_1is__vector__like_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::is_vector_like< Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > > Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__vector__like_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4.html b/doc/api/html/structstan_1_1is__vector__like_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4.html new file mode 100644 index 00000000000..fc4bbe193ab --- /dev/null +++ b/doc/api/html/structstan_1_1is__vector__like_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4.html @@ -0,0 +1,153 @@ + + + + + +Stan: stan::is_vector_like< Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::is_vector_like< Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > > Struct Template Reference
+
+
+ +

#include <traits.hpp>

+ + + + +

+Public Types

enum  { value = true + }
 
+

Detailed Description

+

template<typename T>
+struct stan::is_vector_like< Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > >

+ + +

Definition at line 220 of file traits.hpp.

+

Member Enumeration Documentation

+ +
+
+
+template<typename T >
+ + + + +
anonymous enum
+
+
Enumerator:
+ +
value  +
+
+
+ +

Definition at line 221 of file traits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__vector__like_3_01_t_01_5_01_4-members.html b/doc/api/html/structstan_1_1is__vector__like_3_01_t_01_5_01_4-members.html new file mode 100644 index 00000000000..03893986d92 --- /dev/null +++ b/doc/api/html/structstan_1_1is__vector__like_3_01_t_01_5_01_4-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::is_vector_like< T * > Member List
+
+
+ +

This is the complete list of members for stan::is_vector_like< T * >, including all inherited members.

+ + +
value enum valuestan::is_vector_like< T * >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__vector__like_3_01_t_01_5_01_4.html b/doc/api/html/structstan_1_1is__vector__like_3_01_t_01_5_01_4.html new file mode 100644 index 00000000000..be38ddf4a65 --- /dev/null +++ b/doc/api/html/structstan_1_1is__vector__like_3_01_t_01_5_01_4.html @@ -0,0 +1,153 @@ + + + + + +Stan: stan::is_vector_like< T * > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::is_vector_like< T * > Struct Template Reference
+
+
+ +

#include <traits.hpp>

+ + + + +

+Public Types

enum  { value = true + }
 
+

Detailed Description

+

template<typename T>
+struct stan::is_vector_like< T * >

+ + +

Definition at line 210 of file traits.hpp.

+

Member Enumeration Documentation

+ +
+
+
+template<typename T >
+ + + + +
anonymous enum
+
+
Enumerator:
+ +
value  +
+
+
+ +

Definition at line 211 of file traits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__vector__like_3_01const_01_t_01_4-members.html b/doc/api/html/structstan_1_1is__vector__like_3_01const_01_t_01_4-members.html new file mode 100644 index 00000000000..1131c968c31 --- /dev/null +++ b/doc/api/html/structstan_1_1is__vector__like_3_01const_01_t_01_4-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::is_vector_like< const T > Member List
+
+
+ +

This is the complete list of members for stan::is_vector_like< const T >, including all inherited members.

+ + +
value enum valuestan::is_vector_like< const T >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1is__vector__like_3_01const_01_t_01_4.html b/doc/api/html/structstan_1_1is__vector__like_3_01const_01_t_01_4.html new file mode 100644 index 00000000000..19b6028e30c --- /dev/null +++ b/doc/api/html/structstan_1_1is__vector__like_3_01const_01_t_01_4.html @@ -0,0 +1,153 @@ + + + + + +Stan: stan::is_vector_like< const T > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::is_vector_like< const T > Struct Template Reference
+
+
+ +

#include <traits.hpp>

+ + + + +

+Public Types

enum  { value = stan::is_vector_like<T>::value + }
 
+

Detailed Description

+

template<typename T>
+struct stan::is_vector_like< const T >

+ + +

Definition at line 215 of file traits.hpp.

+

Member Enumeration Documentation

+ +
+
+
+template<typename T >
+ + + + +
anonymous enum
+
+
Enumerator:
+ +
value  +
+
+
+ +

Definition at line 216 of file traits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1math_1_1array__builder-members.html b/doc/api/html/structstan_1_1math_1_1array__builder-members.html new file mode 100644 index 00000000000..e26de992c72 --- /dev/null +++ b/doc/api/html/structstan_1_1math_1_1array__builder-members.html @@ -0,0 +1,116 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::math::array_builder< T > Member List
+
+
+ +

This is the complete list of members for stan::math::array_builder< T >, including all inherited members.

+ + + + + +
add(const F &u)stan::math::array_builder< T >inline
array()stan::math::array_builder< T >inline
array_builder()stan::math::array_builder< T >inline
x_stan::math::array_builder< T >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1math_1_1array__builder.html b/doc/api/html/structstan_1_1math_1_1array__builder.html new file mode 100644 index 00000000000..965809f3746 --- /dev/null +++ b/doc/api/html/structstan_1_1math_1_1array__builder.html @@ -0,0 +1,247 @@ + + + + + +Stan: stan::math::array_builder< T > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::math::array_builder< T > Struct Template Reference
+
+
+ +

Structure for building up arrays in an expression (rather than in statements) using an argumentchaining add() method and a getter method array() to return the result. + More...

+ +

#include <array_builder.hpp>

+ + + + + + + + + +

+Public Member Functions

 array_builder ()
 
template<typename F >
array_builderadd (const F &u)
 
std::vector< T > array ()
 
+ + + +

+Public Attributes

std::vector< T > x_
 
+

Detailed Description

+

template<typename T>
+struct stan::math::array_builder< T >

+ +

Structure for building up arrays in an expression (rather than in statements) using an argumentchaining add() method and a getter method array() to return the result.

+ +

Definition at line 16 of file array_builder.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
stan::math::array_builder< T >::array_builder ()
+
+inline
+
+ +

Definition at line 18 of file array_builder.hpp.

+ +
+
+

Member Function Documentation

+ +
+
+
+template<typename T >
+
+template<typename F >
+ + + + + +
+ + + + + + + + +
array_builder& stan::math::array_builder< T >::add (const F & u)
+
+inline
+
+ +

Definition at line 20 of file array_builder.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
std::vector<T> stan::math::array_builder< T >::array ()
+
+inline
+
+ +

Definition at line 26 of file array_builder.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+
+template<typename T >
+ + + + +
std::vector<T> stan::math::array_builder< T >::x_
+
+ +

Definition at line 17 of file array_builder.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1math_1_1common__type-members.html b/doc/api/html/structstan_1_1math_1_1common__type-members.html new file mode 100644 index 00000000000..eacc5d9c782 --- /dev/null +++ b/doc/api/html/structstan_1_1math_1_1common__type-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::math::common_type< T1, T2 > Member List
+
+
+ +

This is the complete list of members for stan::math::common_type< T1, T2 >, including all inherited members.

+ + +
type typedefstan::math::common_type< T1, T2 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1math_1_1common__type.html b/doc/api/html/structstan_1_1math_1_1common__type.html new file mode 100644 index 00000000000..fd898161c5b --- /dev/null +++ b/doc/api/html/structstan_1_1math_1_1common__type.html @@ -0,0 +1,148 @@ + + + + + +Stan: stan::math::common_type< T1, T2 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::math::common_type< T1, T2 > Struct Template Reference
+
+
+ +

#include <common_type.hpp>

+ + + + +

+Public Types

typedef
+boost::math::tools::promote_args
+< T1, T2 >::type 
type
 
+

Detailed Description

+

template<typename T1, typename T2>
+struct stan::math::common_type< T1, T2 >

+ + +

Definition at line 13 of file common_type.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1, typename T2>
+ + + + +
typedef boost::math::tools::promote_args<T1,T2>::type stan::math::common_type< T1, T2 >::type
+
+ +

Definition at line 14 of file common_type.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1math_1_1common__type_3_01_eigen_1_1_matrix_3_01_t1_00_01_r_00_01_c_01_4_00_01_eige106a86f1021708b40db478c4e2fef0a7.html b/doc/api/html/structstan_1_1math_1_1common__type_3_01_eigen_1_1_matrix_3_01_t1_00_01_r_00_01_c_01_4_00_01_eige106a86f1021708b40db478c4e2fef0a7.html new file mode 100644 index 00000000000..500ffc066d2 --- /dev/null +++ b/doc/api/html/structstan_1_1math_1_1common__type_3_01_eigen_1_1_matrix_3_01_t1_00_01_r_00_01_c_01_4_00_01_eige106a86f1021708b40db478c4e2fef0a7.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::math::common_type< Eigen::Matrix< T1, R, C >, Eigen::Matrix< T2, R, C > > Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1math_1_1common__type_3_01_eigen_1_1_matrix_3_01_t1_00_01_r_00_01_c_01_4_00_01_eiged8accfa00e73f240c58ad02ac582ba93.html b/doc/api/html/structstan_1_1math_1_1common__type_3_01_eigen_1_1_matrix_3_01_t1_00_01_r_00_01_c_01_4_00_01_eiged8accfa00e73f240c58ad02ac582ba93.html new file mode 100644 index 00000000000..46d459d5489 --- /dev/null +++ b/doc/api/html/structstan_1_1math_1_1common__type_3_01_eigen_1_1_matrix_3_01_t1_00_01_r_00_01_c_01_4_00_01_eiged8accfa00e73f240c58ad02ac582ba93.html @@ -0,0 +1,148 @@ + + + + + +Stan: stan::math::common_type< Eigen::Matrix< T1, R, C >, Eigen::Matrix< T2, R, C > > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::math::common_type< Eigen::Matrix< T1, R, C >, Eigen::Matrix< T2, R, C > > Struct Template Reference
+
+
+ +

#include <common_type.hpp>

+ + + + +

+Public Types

typedef Eigen::Matrix
+< typename common_type< T1, T2 >
+::type, R, C > 
type
 
+

Detailed Description

+

template<typename T1, typename T2, int R, int C>
+struct stan::math::common_type< Eigen::Matrix< T1, R, C >, Eigen::Matrix< T2, R, C > >

+ + +

Definition at line 23 of file common_type.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 , int R, int C>
+ + + + +
typedef Eigen::Matrix<typename common_type<T1,T2>::type,R,C> stan::math::common_type< Eigen::Matrix< T1, R, C >, Eigen::Matrix< T2, R, C > >::type
+
+ +

Definition at line 24 of file common_type.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1math_1_1common__type_3_01std_1_1vector_3_01_t1_01_4_00_01std_1_1vector_3_01_t2_01_4_01_4-members.html b/doc/api/html/structstan_1_1math_1_1common__type_3_01std_1_1vector_3_01_t1_01_4_00_01std_1_1vector_3_01_t2_01_4_01_4-members.html new file mode 100644 index 00000000000..d087940e5c9 --- /dev/null +++ b/doc/api/html/structstan_1_1math_1_1common__type_3_01std_1_1vector_3_01_t1_01_4_00_01std_1_1vector_3_01_t2_01_4_01_4-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::math::common_type< std::vector< T1 >, std::vector< T2 > > Member List
+
+
+ +

This is the complete list of members for stan::math::common_type< std::vector< T1 >, std::vector< T2 > >, including all inherited members.

+ + +
type typedefstan::math::common_type< std::vector< T1 >, std::vector< T2 > >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1math_1_1common__type_3_01std_1_1vector_3_01_t1_01_4_00_01std_1_1vector_3_01_t2_01_4_01_4.html b/doc/api/html/structstan_1_1math_1_1common__type_3_01std_1_1vector_3_01_t1_01_4_00_01std_1_1vector_3_01_t2_01_4_01_4.html new file mode 100644 index 00000000000..3a64292abd7 --- /dev/null +++ b/doc/api/html/structstan_1_1math_1_1common__type_3_01std_1_1vector_3_01_t1_01_4_00_01std_1_1vector_3_01_t2_01_4_01_4.html @@ -0,0 +1,147 @@ + + + + + +Stan: stan::math::common_type< std::vector< T1 >, std::vector< T2 > > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::math::common_type< std::vector< T1 >, std::vector< T2 > > Struct Template Reference
+
+
+ +

#include <common_type.hpp>

+ + + + +

+Public Types

typedef std::vector< typename
+common_type< T1, T2 >::type
type
 
+

Detailed Description

+

template<typename T1, typename T2>
+struct stan::math::common_type< std::vector< T1 >, std::vector< T2 > >

+ + +

Definition at line 18 of file common_type.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1 , typename T2 >
+ + + + +
typedef std::vector<typename common_type<T1,T2>::type> stan::math::common_type< std::vector< T1 >, std::vector< T2 > >::type
+
+ +

Definition at line 19 of file common_type.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1math_1_1pass__type-members.html b/doc/api/html/structstan_1_1math_1_1pass__type-members.html new file mode 100644 index 00000000000..8a2239fd5ee --- /dev/null +++ b/doc/api/html/structstan_1_1math_1_1pass__type-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::math::pass_type< T > Member List
+
+
+ +

This is the complete list of members for stan::math::pass_type< T >, including all inherited members.

+ + +
type typedefstan::math::pass_type< T >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1math_1_1pass__type.html b/doc/api/html/structstan_1_1math_1_1pass__type.html new file mode 100644 index 00000000000..3b3017467f5 --- /dev/null +++ b/doc/api/html/structstan_1_1math_1_1pass__type.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::math::pass_type< T > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::math::pass_type< T > Struct Template Reference
+
+
+ +

#include <seq_view.hpp>

+ + + + +

+Public Types

typedef const T & type
 
+

Detailed Description

+

template<typename T>
+struct stan::math::pass_type< T >

+ + +

Definition at line 28 of file seq_view.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T>
+ + + + +
typedef const T& stan::math::pass_type< T >::type
+
+ +

Definition at line 29 of file seq_view.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1math_1_1pass__type_3_01double_01_4-members.html b/doc/api/html/structstan_1_1math_1_1pass__type_3_01double_01_4-members.html new file mode 100644 index 00000000000..a603f11ed47 --- /dev/null +++ b/doc/api/html/structstan_1_1math_1_1pass__type_3_01double_01_4-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::math::pass_type< double > Member List
+
+
+ +

This is the complete list of members for stan::math::pass_type< double >, including all inherited members.

+ + +
type typedefstan::math::pass_type< double >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1math_1_1pass__type_3_01double_01_4.html b/doc/api/html/structstan_1_1math_1_1pass__type_3_01double_01_4.html new file mode 100644 index 00000000000..7cd45fea551 --- /dev/null +++ b/doc/api/html/structstan_1_1math_1_1pass__type_3_01double_01_4.html @@ -0,0 +1,144 @@ + + + + + +Stan: stan::math::pass_type< double > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::math::pass_type< double > Struct Template Reference
+
+
+ +

#include <seq_view.hpp>

+ + + + +

+Public Types

typedef double type
 
+

Detailed Description

+

template<>
+struct stan::math::pass_type< double >

+ + +

Definition at line 32 of file seq_view.hpp.

+

Member Typedef Documentation

+ +
+
+ + + + +
typedef double stan::math::pass_type< double >::type
+
+ +

Definition at line 33 of file seq_view.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1math_1_1pass__type_3_01int_01_4-members.html b/doc/api/html/structstan_1_1math_1_1pass__type_3_01int_01_4-members.html new file mode 100644 index 00000000000..93749928277 --- /dev/null +++ b/doc/api/html/structstan_1_1math_1_1pass__type_3_01int_01_4-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::math::pass_type< int > Member List
+
+
+ +

This is the complete list of members for stan::math::pass_type< int >, including all inherited members.

+ + +
type typedefstan::math::pass_type< int >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1math_1_1pass__type_3_01int_01_4.html b/doc/api/html/structstan_1_1math_1_1pass__type_3_01int_01_4.html new file mode 100644 index 00000000000..0a9e14287ee --- /dev/null +++ b/doc/api/html/structstan_1_1math_1_1pass__type_3_01int_01_4.html @@ -0,0 +1,144 @@ + + + + + +Stan: stan::math::pass_type< int > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::math::pass_type< int > Struct Template Reference
+
+
+ +

#include <seq_view.hpp>

+ + + + +

+Public Types

typedef int type
 
+

Detailed Description

+

template<>
+struct stan::math::pass_type< int >

+ + +

Definition at line 36 of file seq_view.hpp.

+

Member Typedef Documentation

+ +
+
+ + + + +
typedef int stan::math::pass_type< int >::type
+
+ +

Definition at line 37 of file seq_view.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1math_1_1promoter-members.html b/doc/api/html/structstan_1_1math_1_1promoter-members.html new file mode 100644 index 00000000000..0c7115a1e61 --- /dev/null +++ b/doc/api/html/structstan_1_1math_1_1promoter-members.html @@ -0,0 +1,114 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::math::promoter< F, T > Member List
+
+
+ +

This is the complete list of members for stan::math::promoter< F, T >, including all inherited members.

+ + + +
promote(const F &u, T &t)stan::math::promoter< F, T >inlinestatic
promote_to(const F &u)stan::math::promoter< F, T >inlinestatic
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1math_1_1promoter.html b/doc/api/html/structstan_1_1math_1_1promoter.html new file mode 100644 index 00000000000..5802c37c242 --- /dev/null +++ b/doc/api/html/structstan_1_1math_1_1promoter.html @@ -0,0 +1,198 @@ + + + + + +Stan: stan::math::promoter< F, T > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::math::promoter< F, T > Struct Template Reference
+
+
+ +

#include <promoter.hpp>

+ + + + + + +

+Static Public Member Functions

static void promote (const F &u, T &t)
 
static T promote_to (const F &u)
 
+

Detailed Description

+

template<typename F, typename T>
+struct stan::math::promoter< F, T >

+ + +

Definition at line 14 of file promoter.hpp.

+

Member Function Documentation

+ +
+
+
+template<typename F, typename T>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
static void stan::math::promoter< F, T >::promote (const F & u,
T & t 
)
+
+inlinestatic
+
+ +

Definition at line 15 of file promoter.hpp.

+ +
+
+ +
+
+
+template<typename F, typename T>
+ + + + + +
+ + + + + + + + +
static T stan::math::promoter< F, T >::promote_to (const F & u)
+
+inlinestatic
+
+ +

Definition at line 18 of file promoter.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1math_1_1promoter_3_01_eigen_1_1_matrix_3_01_f_00_01_r_00_01_c_01_4_00_01_eigen_1_142b48fda94601374e41a81325f3f7b84.html b/doc/api/html/structstan_1_1math_1_1promoter_3_01_eigen_1_1_matrix_3_01_f_00_01_r_00_01_c_01_4_00_01_eigen_1_142b48fda94601374e41a81325f3f7b84.html new file mode 100644 index 00000000000..aa8fffc0626 --- /dev/null +++ b/doc/api/html/structstan_1_1math_1_1promoter_3_01_eigen_1_1_matrix_3_01_f_00_01_r_00_01_c_01_4_00_01_eigen_1_142b48fda94601374e41a81325f3f7b84.html @@ -0,0 +1,198 @@ + + + + + +Stan: stan::math::promoter< Eigen::Matrix< F, R, C >, Eigen::Matrix< T, R, C > > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::math::promoter< Eigen::Matrix< F, R, C >, Eigen::Matrix< T, R, C > > Struct Template Reference
+
+
+ +

#include <promoter.hpp>

+ + + + + + +

+Static Public Member Functions

static void promote (const Eigen::Matrix< F, R, C > &u, Eigen::Matrix< T, R, C > &t)
 
static Eigen::Matrix< T, R, C > promote_to (const Eigen::Matrix< F, R, C > &u)
 
+

Detailed Description

+

template<typename F, typename T, int R, int C>
+struct stan::math::promoter< Eigen::Matrix< F, R, C >, Eigen::Matrix< T, R, C > >

+ + +

Definition at line 63 of file promoter.hpp.

+

Member Function Documentation

+ +
+
+
+template<typename F , typename T , int R, int C>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
static void stan::math::promoter< Eigen::Matrix< F, R, C >, Eigen::Matrix< T, R, C > >::promote (const Eigen::Matrix< F, R, C > & u,
Eigen::Matrix< T, R, C > & t 
)
+
+inlinestatic
+
+ +

Definition at line 64 of file promoter.hpp.

+ +
+
+ +
+
+
+template<typename F , typename T , int R, int C>
+ + + + + +
+ + + + + + + + +
static Eigen::Matrix<T,R,C> stan::math::promoter< Eigen::Matrix< F, R, C >, Eigen::Matrix< T, R, C > >::promote_to (const Eigen::Matrix< F, R, C > & u)
+
+inlinestatic
+
+ +

Definition at line 71 of file promoter.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1math_1_1promoter_3_01_eigen_1_1_matrix_3_01_f_00_01_r_00_01_c_01_4_00_01_eigen_1_19fcbf4e7bc8e106173bfa338a15054ff.html b/doc/api/html/structstan_1_1math_1_1promoter_3_01_eigen_1_1_matrix_3_01_f_00_01_r_00_01_c_01_4_00_01_eigen_1_19fcbf4e7bc8e106173bfa338a15054ff.html new file mode 100644 index 00000000000..eba4d30a868 --- /dev/null +++ b/doc/api/html/structstan_1_1math_1_1promoter_3_01_eigen_1_1_matrix_3_01_f_00_01_r_00_01_c_01_4_00_01_eigen_1_19fcbf4e7bc8e106173bfa338a15054ff.html @@ -0,0 +1,114 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::math::promoter< Eigen::Matrix< F, R, C >, Eigen::Matrix< T, R, C > > Member List
+
+
+ +

This is the complete list of members for stan::math::promoter< Eigen::Matrix< F, R, C >, Eigen::Matrix< T, R, C > >, including all inherited members.

+ + + +
promote(const Eigen::Matrix< F, R, C > &u, Eigen::Matrix< T, R, C > &t)stan::math::promoter< Eigen::Matrix< F, R, C >, Eigen::Matrix< T, R, C > >inlinestatic
promote_to(const Eigen::Matrix< F, R, C > &u)stan::math::promoter< Eigen::Matrix< F, R, C >, Eigen::Matrix< T, R, C > >inlinestatic
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1math_1_1promoter_3_01_eigen_1_1_matrix_3_01_t_00_01_r_00_01_c_01_4_00_01_eigen_1_12d7fadf0560f1f2f3abc5388b7666f9c.html b/doc/api/html/structstan_1_1math_1_1promoter_3_01_eigen_1_1_matrix_3_01_t_00_01_r_00_01_c_01_4_00_01_eigen_1_12d7fadf0560f1f2f3abc5388b7666f9c.html new file mode 100644 index 00000000000..2a86e063465 --- /dev/null +++ b/doc/api/html/structstan_1_1math_1_1promoter_3_01_eigen_1_1_matrix_3_01_t_00_01_r_00_01_c_01_4_00_01_eigen_1_12d7fadf0560f1f2f3abc5388b7666f9c.html @@ -0,0 +1,198 @@ + + + + + +Stan: stan::math::promoter< Eigen::Matrix< T, R, C >, Eigen::Matrix< T, R, C > > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::math::promoter< Eigen::Matrix< T, R, C >, Eigen::Matrix< T, R, C > > Struct Template Reference
+
+
+ +

#include <promoter.hpp>

+ + + + + + +

+Static Public Member Functions

static void promote (const Eigen::Matrix< T, R, C > &u, Eigen::Matrix< T, R, C > &t)
 
static Eigen::Matrix< T, R, C > promote_to (const Eigen::Matrix< T, R, C > &u)
 
+

Detailed Description

+

template<typename T, int R, int C>
+struct stan::math::promoter< Eigen::Matrix< T, R, C >, Eigen::Matrix< T, R, C > >

+ + +

Definition at line 79 of file promoter.hpp.

+

Member Function Documentation

+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
static void stan::math::promoter< Eigen::Matrix< T, R, C >, Eigen::Matrix< T, R, C > >::promote (const Eigen::Matrix< T, R, C > & u,
Eigen::Matrix< T, R, C > & t 
)
+
+inlinestatic
+
+ +

Definition at line 80 of file promoter.hpp.

+ +
+
+ +
+
+
+template<typename T , int R, int C>
+ + + + + +
+ + + + + + + + +
static Eigen::Matrix<T,R,C> stan::math::promoter< Eigen::Matrix< T, R, C >, Eigen::Matrix< T, R, C > >::promote_to (const Eigen::Matrix< T, R, C > & u)
+
+inlinestatic
+
+ +

Definition at line 84 of file promoter.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1math_1_1promoter_3_01_eigen_1_1_matrix_3_01_t_00_01_r_00_01_c_01_4_00_01_eigen_1_1ab38afe2feaa91a91579e3639d1f03b0.html b/doc/api/html/structstan_1_1math_1_1promoter_3_01_eigen_1_1_matrix_3_01_t_00_01_r_00_01_c_01_4_00_01_eigen_1_1ab38afe2feaa91a91579e3639d1f03b0.html new file mode 100644 index 00000000000..ec1d2a82504 --- /dev/null +++ b/doc/api/html/structstan_1_1math_1_1promoter_3_01_eigen_1_1_matrix_3_01_t_00_01_r_00_01_c_01_4_00_01_eigen_1_1ab38afe2feaa91a91579e3639d1f03b0.html @@ -0,0 +1,114 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::math::promoter< Eigen::Matrix< T, R, C >, Eigen::Matrix< T, R, C > > Member List
+
+
+ +

This is the complete list of members for stan::math::promoter< Eigen::Matrix< T, R, C >, Eigen::Matrix< T, R, C > >, including all inherited members.

+ + + +
promote(const Eigen::Matrix< T, R, C > &u, Eigen::Matrix< T, R, C > &t)stan::math::promoter< Eigen::Matrix< T, R, C >, Eigen::Matrix< T, R, C > >inlinestatic
promote_to(const Eigen::Matrix< T, R, C > &u)stan::math::promoter< Eigen::Matrix< T, R, C >, Eigen::Matrix< T, R, C > >inlinestatic
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1math_1_1promoter_3_01_t_00_01_t_01_4-members.html b/doc/api/html/structstan_1_1math_1_1promoter_3_01_t_00_01_t_01_4-members.html new file mode 100644 index 00000000000..9ef84b2c596 --- /dev/null +++ b/doc/api/html/structstan_1_1math_1_1promoter_3_01_t_00_01_t_01_4-members.html @@ -0,0 +1,114 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::math::promoter< T, T > Member List
+
+
+ +

This is the complete list of members for stan::math::promoter< T, T >, including all inherited members.

+ + + +
promote(const T &u, T &t)stan::math::promoter< T, T >inlinestatic
promote_to(const T &u)stan::math::promoter< T, T >inlinestatic
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1math_1_1promoter_3_01_t_00_01_t_01_4.html b/doc/api/html/structstan_1_1math_1_1promoter_3_01_t_00_01_t_01_4.html new file mode 100644 index 00000000000..cae18a84ad5 --- /dev/null +++ b/doc/api/html/structstan_1_1math_1_1promoter_3_01_t_00_01_t_01_4.html @@ -0,0 +1,198 @@ + + + + + +Stan: stan::math::promoter< T, T > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::math::promoter< T, T > Struct Template Reference
+
+
+ +

#include <promoter.hpp>

+ + + + + + +

+Static Public Member Functions

static void promote (const T &u, T &t)
 
static T promote_to (const T &u)
 
+

Detailed Description

+

template<typename T>
+struct stan::math::promoter< T, T >

+ + +

Definition at line 24 of file promoter.hpp.

+

Member Function Documentation

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
static void stan::math::promoter< T, T >::promote (const T & u,
T & t 
)
+
+inlinestatic
+
+ +

Definition at line 25 of file promoter.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
static T stan::math::promoter< T, T >::promote_to (const T & u)
+
+inlinestatic
+
+ +

Definition at line 28 of file promoter.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1math_1_1promoter_3_01std_1_1vector_3_01_f_01_4_00_01std_1_1vector_3_01_t_01_4_01_4-members.html b/doc/api/html/structstan_1_1math_1_1promoter_3_01std_1_1vector_3_01_f_01_4_00_01std_1_1vector_3_01_t_01_4_01_4-members.html new file mode 100644 index 00000000000..bd439341a11 --- /dev/null +++ b/doc/api/html/structstan_1_1math_1_1promoter_3_01std_1_1vector_3_01_f_01_4_00_01std_1_1vector_3_01_t_01_4_01_4-members.html @@ -0,0 +1,114 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::math::promoter< std::vector< F >, std::vector< T > > Member List
+
+
+ +

This is the complete list of members for stan::math::promoter< std::vector< F >, std::vector< T > >, including all inherited members.

+ + + +
promote(const std::vector< F > &u, std::vector< T > &t)stan::math::promoter< std::vector< F >, std::vector< T > >inlinestatic
promote_to(const std::vector< F > &u)stan::math::promoter< std::vector< F >, std::vector< T > >inlinestatic
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1math_1_1promoter_3_01std_1_1vector_3_01_f_01_4_00_01std_1_1vector_3_01_t_01_4_01_4.html b/doc/api/html/structstan_1_1math_1_1promoter_3_01std_1_1vector_3_01_f_01_4_00_01std_1_1vector_3_01_t_01_4_01_4.html new file mode 100644 index 00000000000..89fe988c911 --- /dev/null +++ b/doc/api/html/structstan_1_1math_1_1promoter_3_01std_1_1vector_3_01_f_01_4_00_01std_1_1vector_3_01_t_01_4_01_4.html @@ -0,0 +1,198 @@ + + + + + +Stan: stan::math::promoter< std::vector< F >, std::vector< T > > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::math::promoter< std::vector< F >, std::vector< T > > Struct Template Reference
+
+
+ +

#include <promoter.hpp>

+ + + + + + +

+Static Public Member Functions

static void promote (const std::vector< F > &u, std::vector< T > &t)
 
static std::vector< T > promote_to (const std::vector< F > &u)
 
+

Detailed Description

+

template<typename F, typename T>
+struct stan::math::promoter< std::vector< F >, std::vector< T > >

+ + +

Definition at line 35 of file promoter.hpp.

+

Member Function Documentation

+ +
+
+
+template<typename F , typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
static void stan::math::promoter< std::vector< F >, std::vector< T > >::promote (const std::vector< F > & u,
std::vector< T > & t 
)
+
+inlinestatic
+
+ +

Definition at line 36 of file promoter.hpp.

+ +
+
+ +
+
+
+template<typename F , typename T >
+ + + + + +
+ + + + + + + + +
static std::vector<T> stan::math::promoter< std::vector< F >, std::vector< T > >::promote_to (const std::vector< F > & u)
+
+inlinestatic
+
+ +

Definition at line 43 of file promoter.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1math_1_1promoter_3_01std_1_1vector_3_01_t_01_4_00_01std_1_1vector_3_01_t_01_4_01_4-members.html b/doc/api/html/structstan_1_1math_1_1promoter_3_01std_1_1vector_3_01_t_01_4_00_01std_1_1vector_3_01_t_01_4_01_4-members.html new file mode 100644 index 00000000000..afdefd2a8c1 --- /dev/null +++ b/doc/api/html/structstan_1_1math_1_1promoter_3_01std_1_1vector_3_01_t_01_4_00_01std_1_1vector_3_01_t_01_4_01_4-members.html @@ -0,0 +1,114 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::math::promoter< std::vector< T >, std::vector< T > > Member List
+
+
+ +

This is the complete list of members for stan::math::promoter< std::vector< T >, std::vector< T > >, including all inherited members.

+ + + +
promote(const std::vector< T > &u, std::vector< T > &t)stan::math::promoter< std::vector< T >, std::vector< T > >inlinestatic
promote_to(const std::vector< T > &u)stan::math::promoter< std::vector< T >, std::vector< T > >inlinestatic
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1math_1_1promoter_3_01std_1_1vector_3_01_t_01_4_00_01std_1_1vector_3_01_t_01_4_01_4.html b/doc/api/html/structstan_1_1math_1_1promoter_3_01std_1_1vector_3_01_t_01_4_00_01std_1_1vector_3_01_t_01_4_01_4.html new file mode 100644 index 00000000000..1eec17cc9f9 --- /dev/null +++ b/doc/api/html/structstan_1_1math_1_1promoter_3_01std_1_1vector_3_01_t_01_4_00_01std_1_1vector_3_01_t_01_4_01_4.html @@ -0,0 +1,198 @@ + + + + + +Stan: stan::math::promoter< std::vector< T >, std::vector< T > > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::math::promoter< std::vector< T >, std::vector< T > > Struct Template Reference
+
+
+ +

#include <promoter.hpp>

+ + + + + + +

+Static Public Member Functions

static void promote (const std::vector< T > &u, std::vector< T > &t)
 
static std::vector< T > promote_to (const std::vector< T > &u)
 
+

Detailed Description

+

template<typename T>
+struct stan::math::promoter< std::vector< T >, std::vector< T > >

+ + +

Definition at line 51 of file promoter.hpp.

+

Member Function Documentation

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
static void stan::math::promoter< std::vector< T >, std::vector< T > >::promote (const std::vector< T > & u,
std::vector< T > & t 
)
+
+inlinestatic
+
+ +

Definition at line 52 of file promoter.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
static std::vector<T> stan::math::promoter< std::vector< T >, std::vector< T > >::promote_to (const std::vector< T > & u)
+
+inlinestatic
+
+ +

Definition at line 56 of file promoter.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1math_1_1store__type-members.html b/doc/api/html/structstan_1_1math_1_1store__type-members.html new file mode 100644 index 00000000000..dc20ac81ce1 --- /dev/null +++ b/doc/api/html/structstan_1_1math_1_1store__type-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::math::store_type< T > Member List
+
+
+ +

This is the complete list of members for stan::math::store_type< T >, including all inherited members.

+ + +
type typedefstan::math::store_type< T >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1math_1_1store__type.html b/doc/api/html/structstan_1_1math_1_1store__type.html new file mode 100644 index 00000000000..22d18aaf499 --- /dev/null +++ b/doc/api/html/structstan_1_1math_1_1store__type.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::math::store_type< T > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::math::store_type< T > Struct Template Reference
+
+
+ +

#include <seq_view.hpp>

+ + + + +

+Public Types

typedef const T & type
 
+

Detailed Description

+

template<typename T>
+struct stan::math::store_type< T >

+ + +

Definition at line 14 of file seq_view.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T>
+ + + + +
typedef const T& stan::math::store_type< T >::type
+
+ +

Definition at line 15 of file seq_view.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1math_1_1store__type_3_01double_01_4-members.html b/doc/api/html/structstan_1_1math_1_1store__type_3_01double_01_4-members.html new file mode 100644 index 00000000000..137d2ad38c7 --- /dev/null +++ b/doc/api/html/structstan_1_1math_1_1store__type_3_01double_01_4-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::math::store_type< double > Member List
+
+
+ +

This is the complete list of members for stan::math::store_type< double >, including all inherited members.

+ + +
type typedefstan::math::store_type< double >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1math_1_1store__type_3_01double_01_4.html b/doc/api/html/structstan_1_1math_1_1store__type_3_01double_01_4.html new file mode 100644 index 00000000000..f5e30d5a030 --- /dev/null +++ b/doc/api/html/structstan_1_1math_1_1store__type_3_01double_01_4.html @@ -0,0 +1,144 @@ + + + + + +Stan: stan::math::store_type< double > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::math::store_type< double > Struct Template Reference
+
+
+ +

#include <seq_view.hpp>

+ + + + +

+Public Types

typedef const double type
 
+

Detailed Description

+

template<>
+struct stan::math::store_type< double >

+ + +

Definition at line 18 of file seq_view.hpp.

+

Member Typedef Documentation

+ +
+
+ + + + +
typedef const double stan::math::store_type< double >::type
+
+ +

Definition at line 19 of file seq_view.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1math_1_1store__type_3_01int_01_4-members.html b/doc/api/html/structstan_1_1math_1_1store__type_3_01int_01_4-members.html new file mode 100644 index 00000000000..1f01b970e97 --- /dev/null +++ b/doc/api/html/structstan_1_1math_1_1store__type_3_01int_01_4-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::math::store_type< int > Member List
+
+
+ +

This is the complete list of members for stan::math::store_type< int >, including all inherited members.

+ + +
type typedefstan::math::store_type< int >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1math_1_1store__type_3_01int_01_4.html b/doc/api/html/structstan_1_1math_1_1store__type_3_01int_01_4.html new file mode 100644 index 00000000000..1dfcc44c6d5 --- /dev/null +++ b/doc/api/html/structstan_1_1math_1_1store__type_3_01int_01_4.html @@ -0,0 +1,144 @@ + + + + + +Stan: stan::math::store_type< int > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::math::store_type< int > Struct Template Reference
+
+
+ +

#include <seq_view.hpp>

+ + + + +

+Public Types

typedef const int type
 
+

Detailed Description

+

template<>
+struct stan::math::store_type< int >

+ + +

Definition at line 22 of file seq_view.hpp.

+

Member Typedef Documentation

+ +
+
+ + + + +
typedef const int stan::math::store_type< int >::type
+
+ +

Definition at line 23 of file seq_view.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1mcmc_1_1nuts__util-members.html b/doc/api/html/structstan_1_1mcmc_1_1nuts__util-members.html new file mode 100644 index 00000000000..c2d7a030753 --- /dev/null +++ b/doc/api/html/structstan_1_1mcmc_1_1nuts__util-members.html @@ -0,0 +1,118 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::mcmc::nuts_util Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1mcmc_1_1nuts__util.html b/doc/api/html/structstan_1_1mcmc_1_1nuts__util.html new file mode 100644 index 00000000000..6f17d93a283 --- /dev/null +++ b/doc/api/html/structstan_1_1mcmc_1_1nuts__util.html @@ -0,0 +1,221 @@ + + + + + +Stan: stan::mcmc::nuts_util Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::mcmc::nuts_util Struct Reference
+
+
+ +

#include <base_nuts.hpp>

+ + + + + + + + + + + + + + +

+Public Attributes

double log_u
 
double H0
 
int sign
 
int n_tree
 
double sum_prob
 
bool criterion
 
+

Detailed Description

+
+

Definition at line 14 of file base_nuts.hpp.

+

Member Data Documentation

+ +
+
+ + + + +
bool stan::mcmc::nuts_util::criterion
+
+ +

Definition at line 24 of file base_nuts.hpp.

+ +
+
+ +
+
+ + + + +
double stan::mcmc::nuts_util::H0
+
+ +

Definition at line 18 of file base_nuts.hpp.

+ +
+
+ +
+
+ + + + +
double stan::mcmc::nuts_util::log_u
+
+ +

Definition at line 17 of file base_nuts.hpp.

+ +
+
+ +
+
+ + + + +
int stan::mcmc::nuts_util::n_tree
+
+ +

Definition at line 22 of file base_nuts.hpp.

+ +
+
+ +
+
+ + + + +
int stan::mcmc::nuts_util::sign
+
+ +

Definition at line 19 of file base_nuts.hpp.

+ +
+
+ +
+
+ + + + +
double stan::mcmc::nuts_util::sum_prob
+
+ +

Definition at line 23 of file base_nuts.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1optimization_1_1_b_f_g_s_minimizer_1_1_b_f_g_s_options-members.html b/doc/api/html/structstan_1_1optimization_1_1_b_f_g_s_minimizer_1_1_b_f_g_s_options-members.html new file mode 100644 index 00000000000..905c422a235 --- /dev/null +++ b/doc/api/html/structstan_1_1optimization_1_1_b_f_g_s_minimizer_1_1_b_f_g_s_options-members.html @@ -0,0 +1,122 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::BFGSOptions Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1optimization_1_1_b_f_g_s_minimizer_1_1_b_f_g_s_options.html b/doc/api/html/structstan_1_1optimization_1_1_b_f_g_s_minimizer_1_1_b_f_g_s_options.html new file mode 100644 index 00000000000..69e6d3c2f59 --- /dev/null +++ b/doc/api/html/structstan_1_1optimization_1_1_b_f_g_s_minimizer_1_1_b_f_g_s_options.html @@ -0,0 +1,324 @@ + + + + + +Stan: stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::BFGSOptions Struct Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::BFGSOptions Struct Reference
+
+
+ +

#include <bfgs.hpp>

+ + + + +

+Public Member Functions

 BFGSOptions ()
 
+ + + + + + + + + + + + + + + + + + + +

+Public Attributes

size_t maxIts
 
Scalar rho
 
Scalar c1
 
Scalar c2
 
Scalar alpha0
 
Scalar minAlpha
 
Scalar tolX
 
Scalar tolF
 
Scalar tolGrad
 
+

Detailed Description

+

template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+struct stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::BFGSOptions

+ + +

Definition at line 285 of file bfgs.hpp.

+

Constructor & Destructor Documentation

+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + + +
+ + + + + + + +
stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::BFGSOptions::BFGSOptions ()
+
+inline
+
+ +

Definition at line 286 of file bfgs.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + +
Scalar stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::BFGSOptions::alpha0
+
+ +

Definition at line 301 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + +
Scalar stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::BFGSOptions::c1
+
+ +

Definition at line 299 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + +
Scalar stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::BFGSOptions::c2
+
+ +

Definition at line 300 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + +
size_t stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::BFGSOptions::maxIts
+
+ +

Definition at line 297 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + +
Scalar stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::BFGSOptions::minAlpha
+
+ +

Definition at line 302 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + +
Scalar stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::BFGSOptions::rho
+
+ +

Definition at line 298 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + +
Scalar stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::BFGSOptions::tolF
+
+ +

Definition at line 304 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + +
Scalar stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::BFGSOptions::tolGrad
+
+ +

Definition at line 305 of file bfgs.hpp.

+ +
+
+ +
+
+
+template<typename FunctorType, typename Scalar = double, int DimAtCompile = Eigen::Dynamic, int LineSearchMethod = 1>
+ + + + +
Scalar stan::optimization::BFGSMinimizer< FunctorType, Scalar, DimAtCompile, LineSearchMethod >::BFGSOptions::tolX
+
+ +

Definition at line 303 of file bfgs.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1prob_1_1include__summand-members.html b/doc/api/html/structstan_1_1prob_1_1include__summand-members.html new file mode 100644 index 00000000000..ac36e598afe --- /dev/null +++ b/doc/api/html/structstan_1_1prob_1_1include__summand-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::prob::include_summand< propto, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10 > Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1prob_1_1include__summand.html b/doc/api/html/structstan_1_1prob_1_1include__summand.html new file mode 100644 index 00000000000..f7194d363eb --- /dev/null +++ b/doc/api/html/structstan_1_1prob_1_1include__summand.html @@ -0,0 +1,169 @@ + + + + + +Stan: stan::prob::include_summand< propto, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::prob::include_summand< propto, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10 > Struct Template Reference
+
+
+ +

Template metaprogram to calculate whether a summand needs to be included in a proportional (log) probability calculation. + More...

+ +

#include <traits.hpp>

+ + + + + +

+Public Types

enum  { value + }
 true if a term with the specified propto value and subterm types should be included in a proportionality calculation. More...
 
+

Detailed Description

+

template<bool propto, typename T1 = double, typename T2 = double, typename T3 = double, typename T4 = double, typename T5 = double, typename T6 = double, typename T7 = double, typename T8 = double, typename T9 = double, typename T10 = double>
+struct stan::prob::include_summand< propto, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10 >

+ +

Template metaprogram to calculate whether a summand needs to be included in a proportional (log) probability calculation.

+

For usage, the first boolean parameter should be set to true if calculating a term up to proportionality. Other type parameters should be included for all of the types of variables in a term.

+

The value enum will be true if the propto parameter is false or if any of the other template arguments are not constants as defined by stan::is_constant<T>.

+
Template Parameters
+ + + +
proptotrue if calculating up to a proportionality constant.
T1First
+
+
+ +

Definition at line 35 of file traits.hpp.

+

Member Enumeration Documentation

+ +
+
+
+template<bool propto, typename T1 = double, typename T2 = double, typename T3 = double, typename T4 = double, typename T5 = double, typename T6 = double, typename T7 = double, typename T8 = double, typename T9 = double, typename T10 = double>
+ + + + +
anonymous enum
+
+ +

true if a term with the specified propto value and subterm types should be included in a proportionality calculation.

+
Enumerator:
+ +
value  +
+
+
+ +

Definition at line 42 of file traits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1return__type-members.html b/doc/api/html/structstan_1_1return__type-members.html new file mode 100644 index 00000000000..9dcf049796a --- /dev/null +++ b/doc/api/html/structstan_1_1return__type-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::return_type< T1, T2, T3, T4, T5, T6 > Member List
+
+
+ +

This is the complete list of members for stan::return_type< T1, T2, T3, T4, T5, T6 >, including all inherited members.

+ + +
type typedefstan::return_type< T1, T2, T3, T4, T5, T6 >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1return__type.html b/doc/api/html/structstan_1_1return__type.html new file mode 100644 index 00000000000..1f01a19aade --- /dev/null +++ b/doc/api/html/structstan_1_1return__type.html @@ -0,0 +1,160 @@ + + + + + +Stan: stan::return_type< T1, T2, T3, T4, T5, T6 > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::return_type< T1, T2, T3, T4, T5, T6 > Struct Template Reference
+
+
+ +

Metaprogram to calculate the base scalar return type resulting from promoting all the scalar types of the template parameters. + More...

+ +

#include <traits.hpp>

+ + + + +

+Public Types

typedef
+boost::math::tools::promote_args
+< typename scalar_type< T1 >
+::type, typename scalar_type
+< T2 >::type, typename
+scalar_type< T3 >::type,
+typename scalar_type< T4 >
+::type, typename scalar_type
+< T5 >::type, typename
+scalar_type< T6 >::type >
+::type 
type
 
+

Detailed Description

+

template<typename T1, typename T2 = double, typename T3 = double, typename T4 = double, typename T5 = double, typename T6 = double>
+struct stan::return_type< T1, T2, T3, T4, T5, T6 >

+ +

Metaprogram to calculate the base scalar return type resulting from promoting all the scalar types of the template parameters.

+ +

Definition at line 376 of file traits.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T1, typename T2 = double, typename T3 = double, typename T4 = double, typename T5 = double, typename T6 = double>
+ + + + +
typedef boost::math::tools::promote_args<typename scalar_type<T1>::type, typename scalar_type<T2>::type, typename scalar_type<T3>::type, typename scalar_type<T4>::type, typename scalar_type<T5>::type, typename scalar_type<T6>::type>::type stan::return_type< T1, T2, T3, T4, T5, T6 >::type
+
+ +

Definition at line 384 of file traits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1scalar__type-members.html b/doc/api/html/structstan_1_1scalar__type-members.html new file mode 100644 index 00000000000..7985e9e0335 --- /dev/null +++ b/doc/api/html/structstan_1_1scalar__type-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::scalar_type< T > Member List
+
+
+ +

This is the complete list of members for stan::scalar_type< T >, including all inherited members.

+ + +
type typedefstan::scalar_type< T >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1scalar__type.html b/doc/api/html/structstan_1_1scalar__type.html new file mode 100644 index 00000000000..9ce7a678ec9 --- /dev/null +++ b/doc/api/html/structstan_1_1scalar__type.html @@ -0,0 +1,159 @@ + + + + + +Stan: stan::scalar_type< T > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::scalar_type< T > Struct Template Reference
+
+
+ +

Metaprogram structure to determine the base scalar type of a template argument. + More...

+ +

#include <traits.hpp>

+ + + + +

+Public Types

typedef scalar_type_helper
+< is_vector< T >::value, T >
+::type 
type
 
+

Detailed Description

+

template<typename T>
+struct stan::scalar_type< T >

+ +

Metaprogram structure to determine the base scalar type of a template argument.

+

This base class should be specialized for structured types.

+
Template Parameters
+ + +
TType of object.
+
+
+ +

Definition at line 116 of file traits.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T>
+ + + + +
typedef scalar_type_helper<is_vector<T>::value, T>::type stan::scalar_type< T >::type
+
+ +

Definition at line 117 of file traits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1scalar__type_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4-members.html b/doc/api/html/structstan_1_1scalar__type_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4-members.html new file mode 100644 index 00000000000..24804f24002 --- /dev/null +++ b/doc/api/html/structstan_1_1scalar__type_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::scalar_type< Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > > Member List
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1scalar__type_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4.html b/doc/api/html/structstan_1_1scalar__type_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4.html new file mode 100644 index 00000000000..a2b06dfb436 --- /dev/null +++ b/doc/api/html/structstan_1_1scalar__type_3_01_eigen_1_1_matrix_3_01_t_00_01_eigen_1_1_dynamic_00_01_eigen_1_1_dynamic_01_4_01_4.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::scalar_type< Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::scalar_type< Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > > Struct Template Reference
+
+
+ +

#include <traits.hpp>

+ + + + +

+Public Types

typedef scalar_type< T >::type type
 
+

Detailed Description

+

template<typename T>
+struct stan::scalar_type< Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > >

+ + +

Definition at line 194 of file traits.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T >
+ + + + +
typedef scalar_type<T>::type stan::scalar_type< Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > >::type
+
+ +

Definition at line 195 of file traits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1scalar__type_3_01_t_01_5_01_4-members.html b/doc/api/html/structstan_1_1scalar__type_3_01_t_01_5_01_4-members.html new file mode 100644 index 00000000000..25f32a21109 --- /dev/null +++ b/doc/api/html/structstan_1_1scalar__type_3_01_t_01_5_01_4-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::scalar_type< T * > Member List
+
+
+ +

This is the complete list of members for stan::scalar_type< T * >, including all inherited members.

+ + +
type typedefstan::scalar_type< T * >
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1scalar__type_3_01_t_01_5_01_4.html b/doc/api/html/structstan_1_1scalar__type_3_01_t_01_5_01_4.html new file mode 100644 index 00000000000..88561caf676 --- /dev/null +++ b/doc/api/html/structstan_1_1scalar__type_3_01_t_01_5_01_4.html @@ -0,0 +1,146 @@ + + + + + +Stan: stan::scalar_type< T * > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::scalar_type< T * > Struct Template Reference
+
+
+ +

#include <traits.hpp>

+ + + + +

+Public Types

typedef scalar_type< T >::type type
 
+

Detailed Description

+

template<typename T>
+struct stan::scalar_type< T * >

+ + +

Definition at line 199 of file traits.hpp.

+

Member Typedef Documentation

+ +
+
+
+template<typename T >
+ + + + +
typedef scalar_type<T>::type stan::scalar_type< T * >::type
+
+ +

Definition at line 200 of file traits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1size__of__helper-members.html b/doc/api/html/structstan_1_1size__of__helper-members.html new file mode 100644 index 00000000000..b7471af79e2 --- /dev/null +++ b/doc/api/html/structstan_1_1size__of__helper-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::size_of_helper< T, is_vec > Member List
+
+
+ +

This is the complete list of members for stan::size_of_helper< T, is_vec >, including all inherited members.

+ + +
size_of(const T &)stan::size_of_helper< T, is_vec >inlinestatic
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1size__of__helper.html b/doc/api/html/structstan_1_1size__of__helper.html new file mode 100644 index 00000000000..c955be91532 --- /dev/null +++ b/doc/api/html/structstan_1_1size__of__helper.html @@ -0,0 +1,158 @@ + + + + + +Stan: stan::size_of_helper< T, is_vec > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::size_of_helper< T, is_vec > Struct Template Reference
+
+
+ +

#include <traits.hpp>

+ + + + +

+Static Public Member Functions

static size_t size_of (const T &)
 
+

Detailed Description

+

template<typename T, bool is_vec>
+struct stan::size_of_helper< T, is_vec >

+ + +

Definition at line 150 of file traits.hpp.

+

Member Function Documentation

+ +
+
+
+template<typename T, bool is_vec>
+ + + + + +
+ + + + + + + + +
static size_t stan::size_of_helper< T, is_vec >::size_of (const T & )
+
+inlinestatic
+
+ +

Definition at line 151 of file traits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1size__of__helper_3_01_t_00_01true_01_4-members.html b/doc/api/html/structstan_1_1size__of__helper_3_01_t_00_01true_01_4-members.html new file mode 100644 index 00000000000..be9b79e21d8 --- /dev/null +++ b/doc/api/html/structstan_1_1size__of__helper_3_01_t_00_01true_01_4-members.html @@ -0,0 +1,113 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
stan::size_of_helper< T, true > Member List
+
+
+ +

This is the complete list of members for stan::size_of_helper< T, true >, including all inherited members.

+ + +
size_of(const T &x)stan::size_of_helper< T, true >inlinestatic
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstan_1_1size__of__helper_3_01_t_00_01true_01_4.html b/doc/api/html/structstan_1_1size__of__helper_3_01_t_00_01true_01_4.html new file mode 100644 index 00000000000..dfa810616f1 --- /dev/null +++ b/doc/api/html/structstan_1_1size__of__helper_3_01_t_00_01true_01_4.html @@ -0,0 +1,158 @@ + + + + + +Stan: stan::size_of_helper< T, true > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
stan::size_of_helper< T, true > Struct Template Reference
+
+
+ +

#include <traits.hpp>

+ + + + +

+Static Public Member Functions

static size_t size_of (const T &x)
 
+

Detailed Description

+

template<typename T>
+struct stan::size_of_helper< T, true >

+ + +

Definition at line 157 of file traits.hpp.

+

Member Function Documentation

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
static size_t stan::size_of_helper< T, true >::size_of (const T & x)
+
+inlinestatic
+
+ +

Definition at line 158 of file traits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstatement__grammar.html b/doc/api/html/structstatement__grammar.html new file mode 100644 index 00000000000..85d3ea2f885 --- /dev/null +++ b/doc/api/html/structstatement__grammar.html @@ -0,0 +1,116 @@ + + + + + +Stan: statement_grammar< Iterator > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ +
+
+
+
statement_grammar< Iterator > Struct Template Reference
+
+
+ +

#include <statement_2_grammar.hpp>

+

Detailed Description

+

template<typename Iterator>
+struct statement_grammar< Iterator >

+ + +

Definition at line 20 of file statement_2_grammar.hpp.

+

The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4-members.html b/doc/api/html/structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4-members.html new file mode 100644 index 00000000000..7d17d22fef0 --- /dev/null +++ b/doc/api/html/structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4-members.html @@ -0,0 +1,142 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
std::numeric_limits< stan::agrad::fvar< T > > Member List
+
+
+ +

This is the complete list of members for std::numeric_limits< stan::agrad::fvar< T > >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
denorm_min()std::numeric_limits< stan::agrad::fvar< T > >inlinestatic
digitsstd::numeric_limits< stan::agrad::fvar< T > >static
digits10std::numeric_limits< stan::agrad::fvar< T > >static
epsilon()std::numeric_limits< stan::agrad::fvar< T > >inlinestatic
has_denormstd::numeric_limits< stan::agrad::fvar< T > >static
has_denorm_lossstd::numeric_limits< stan::agrad::fvar< T > >static
has_infinitystd::numeric_limits< stan::agrad::fvar< T > >static
has_quiet_NaNstd::numeric_limits< stan::agrad::fvar< T > >static
has_signaling_NaNstd::numeric_limits< stan::agrad::fvar< T > >static
infinity()std::numeric_limits< stan::agrad::fvar< T > >inlinestatic
is_boundedstd::numeric_limits< stan::agrad::fvar< T > >static
is_exactstd::numeric_limits< stan::agrad::fvar< T > >static
is_iec559std::numeric_limits< stan::agrad::fvar< T > >static
is_integerstd::numeric_limits< stan::agrad::fvar< T > >static
is_modulostd::numeric_limits< stan::agrad::fvar< T > >static
is_signedstd::numeric_limits< stan::agrad::fvar< T > >static
is_specializedstd::numeric_limits< stan::agrad::fvar< T > >static
max()std::numeric_limits< stan::agrad::fvar< T > >inlinestatic
max_exponentstd::numeric_limits< stan::agrad::fvar< T > >static
max_exponent10std::numeric_limits< stan::agrad::fvar< T > >static
min()std::numeric_limits< stan::agrad::fvar< T > >inlinestatic
min_exponentstd::numeric_limits< stan::agrad::fvar< T > >static
min_exponent10std::numeric_limits< stan::agrad::fvar< T > >static
quiet_NaN()std::numeric_limits< stan::agrad::fvar< T > >inlinestatic
radixstd::numeric_limits< stan::agrad::fvar< T > >static
round_error()std::numeric_limits< stan::agrad::fvar< T > >inlinestatic
round_stylestd::numeric_limits< stan::agrad::fvar< T > >static
signaling_NaN()std::numeric_limits< stan::agrad::fvar< T > >inlinestatic
tinyness_beforestd::numeric_limits< stan::agrad::fvar< T > >static
trapsstd::numeric_limits< stan::agrad::fvar< T > >static
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html b/doc/api/html/structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html new file mode 100644 index 00000000000..4161e96e7bb --- /dev/null +++ b/doc/api/html/structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1fvar_3_01_t_01_4_01_4.html @@ -0,0 +1,943 @@ + + + + + +Stan: std::numeric_limits< stan::agrad::fvar< T > > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
std::numeric_limits< stan::agrad::fvar< T > > Struct Template Reference
+
+
+ +

#include <numeric_limits.hpp>

+ + + + + + + + + + + + + + + + + + +

+Static Public Member Functions

static stan::agrad::fvar< T > min ()
 
static stan::agrad::fvar< T > max ()
 
static stan::agrad::fvar< T > epsilon ()
 
static stan::agrad::fvar< T > round_error ()
 
static stan::agrad::fvar< T > infinity ()
 
static stan::agrad::fvar< T > quiet_NaN ()
 
static stan::agrad::fvar< T > signaling_NaN ()
 
static stan::agrad::fvar< T > denorm_min ()
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Static Public Attributes

static const bool is_specialized = true
 
static const int digits = numeric_limits<double>::digits
 
static const int digits10 = numeric_limits<double>::digits10
 
static const bool is_signed = numeric_limits<double>::is_signed
 
static const bool is_integer = numeric_limits<double>::is_integer
 
static const bool is_exact = numeric_limits<double>::is_exact
 
static const int radix = numeric_limits<double>::radix
 
static const int min_exponent = numeric_limits<double>::min_exponent
 
static const int min_exponent10 = numeric_limits<double>::min_exponent10
 
static const int max_exponent = numeric_limits<double>::max_exponent
 
static const int max_exponent10 = numeric_limits<double>::max_exponent10
 
static const bool has_infinity = numeric_limits<double>::has_infinity
 
static const bool has_quiet_NaN = numeric_limits<double>::has_quiet_NaN
 
static const bool has_signaling_NaN
 
static const float_denorm_style has_denorm
 
static const bool has_denorm_loss = numeric_limits<double>::has_denorm_loss
 
static const bool is_iec559 = numeric_limits<double>::is_iec559
 
static const bool is_bounded = numeric_limits<double>::is_bounded
 
static const bool is_modulo = numeric_limits<double>::is_modulo
 
static const bool traps = numeric_limits<double>::traps
 
static const bool tinyness_before = numeric_limits<double>::tinyness_before
 
static const float_round_style round_style
 
+

Detailed Description

+

template<typename T>
+struct std::numeric_limits< stan::agrad::fvar< T > >

+ + +

Definition at line 11 of file numeric_limits.hpp.

+

Member Function Documentation

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
static stan::agrad::fvar<T> std::numeric_limits< stan::agrad::fvar< T > >::denorm_min ()
+
+inlinestatic
+
+ +

Definition at line 44 of file numeric_limits.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
static stan::agrad::fvar<T> std::numeric_limits< stan::agrad::fvar< T > >::epsilon ()
+
+inlinestatic
+
+ +

Definition at line 21 of file numeric_limits.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
static stan::agrad::fvar<T> std::numeric_limits< stan::agrad::fvar< T > >::infinity ()
+
+inlinestatic
+
+ +

Definition at line 38 of file numeric_limits.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
static stan::agrad::fvar<T> std::numeric_limits< stan::agrad::fvar< T > >::max ()
+
+inlinestatic
+
+ +

Definition at line 14 of file numeric_limits.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
static stan::agrad::fvar<T> std::numeric_limits< stan::agrad::fvar< T > >::min ()
+
+inlinestatic
+
+ +

Definition at line 13 of file numeric_limits.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
static stan::agrad::fvar<T> std::numeric_limits< stan::agrad::fvar< T > >::quiet_NaN ()
+
+inlinestatic
+
+ +

Definition at line 40 of file numeric_limits.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
static stan::agrad::fvar<T> std::numeric_limits< stan::agrad::fvar< T > >::round_error ()
+
+inlinestatic
+
+ +

Definition at line 23 of file numeric_limits.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
static stan::agrad::fvar<T> std::numeric_limits< stan::agrad::fvar< T > >::signaling_NaN ()
+
+inlinestatic
+
+ +

Definition at line 42 of file numeric_limits.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + +
const int std::numeric_limits< stan::agrad::fvar< T > >::digits = numeric_limits<double>::digits
+
+static
+
+ +

Definition at line 15 of file numeric_limits.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + +
const int std::numeric_limits< stan::agrad::fvar< T > >::digits10 = numeric_limits<double>::digits10
+
+static
+
+ +

Definition at line 16 of file numeric_limits.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + +
const float_denorm_style std::numeric_limits< stan::agrad::fvar< T > >::has_denorm
+
+static
+
+Initial value:
=
+
numeric_limits<double>::has_denorm
+
+

Definition at line 35 of file numeric_limits.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + +
const bool std::numeric_limits< stan::agrad::fvar< T > >::has_denorm_loss = numeric_limits<double>::has_denorm_loss
+
+static
+
+ +

Definition at line 37 of file numeric_limits.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + +
const bool std::numeric_limits< stan::agrad::fvar< T > >::has_infinity = numeric_limits<double>::has_infinity
+
+static
+
+ +

Definition at line 31 of file numeric_limits.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + +
const bool std::numeric_limits< stan::agrad::fvar< T > >::has_quiet_NaN = numeric_limits<double>::has_quiet_NaN
+
+static
+
+ +

Definition at line 32 of file numeric_limits.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + +
const bool std::numeric_limits< stan::agrad::fvar< T > >::has_signaling_NaN
+
+static
+
+Initial value:
=
+
numeric_limits<double>::has_signaling_NaN
+
+

Definition at line 33 of file numeric_limits.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + +
const bool std::numeric_limits< stan::agrad::fvar< T > >::is_bounded = numeric_limits<double>::is_bounded
+
+static
+
+ +

Definition at line 48 of file numeric_limits.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + +
const bool std::numeric_limits< stan::agrad::fvar< T > >::is_exact = numeric_limits<double>::is_exact
+
+static
+
+ +

Definition at line 19 of file numeric_limits.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + +
const bool std::numeric_limits< stan::agrad::fvar< T > >::is_iec559 = numeric_limits<double>::is_iec559
+
+static
+
+ +

Definition at line 47 of file numeric_limits.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + +
const bool std::numeric_limits< stan::agrad::fvar< T > >::is_integer = numeric_limits<double>::is_integer
+
+static
+
+ +

Definition at line 18 of file numeric_limits.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + +
const bool std::numeric_limits< stan::agrad::fvar< T > >::is_modulo = numeric_limits<double>::is_modulo
+
+static
+
+ +

Definition at line 49 of file numeric_limits.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + +
const bool std::numeric_limits< stan::agrad::fvar< T > >::is_signed = numeric_limits<double>::is_signed
+
+static
+
+ +

Definition at line 17 of file numeric_limits.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + +
const bool std::numeric_limits< stan::agrad::fvar< T > >::is_specialized = true
+
+static
+
+ +

Definition at line 12 of file numeric_limits.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + +
const int std::numeric_limits< stan::agrad::fvar< T > >::max_exponent = numeric_limits<double>::max_exponent
+
+static
+
+ +

Definition at line 28 of file numeric_limits.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + +
const int std::numeric_limits< stan::agrad::fvar< T > >::max_exponent10 = numeric_limits<double>::max_exponent10
+
+static
+
+ +

Definition at line 29 of file numeric_limits.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + +
const int std::numeric_limits< stan::agrad::fvar< T > >::min_exponent = numeric_limits<double>::min_exponent
+
+static
+
+ +

Definition at line 26 of file numeric_limits.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + +
const int std::numeric_limits< stan::agrad::fvar< T > >::min_exponent10 = numeric_limits<double>::min_exponent10
+
+static
+
+ +

Definition at line 27 of file numeric_limits.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + +
const int std::numeric_limits< stan::agrad::fvar< T > >::radix = numeric_limits<double>::radix
+
+static
+
+ +

Definition at line 20 of file numeric_limits.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + +
const float_round_style std::numeric_limits< stan::agrad::fvar< T > >::round_style
+
+static
+
+Initial value:
=
+
numeric_limits<double>::round_style
+
+

Definition at line 53 of file numeric_limits.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + +
const bool std::numeric_limits< stan::agrad::fvar< T > >::tinyness_before = numeric_limits<double>::tinyness_before
+
+static
+
+ +

Definition at line 52 of file numeric_limits.hpp.

+ +
+
+ +
+
+
+template<typename T >
+ + + + + +
+ + + + +
const bool std::numeric_limits< stan::agrad::fvar< T > >::traps = numeric_limits<double>::traps
+
+static
+
+ +

Definition at line 51 of file numeric_limits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4-members.html b/doc/api/html/structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4-members.html new file mode 100644 index 00000000000..7fb8767e797 --- /dev/null +++ b/doc/api/html/structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4-members.html @@ -0,0 +1,142 @@ + + + + + +Stan: Member List + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
std::numeric_limits< stan::agrad::var > Member List
+
+
+ +

This is the complete list of members for std::numeric_limits< stan::agrad::var >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
denorm_min()std::numeric_limits< stan::agrad::var >inlinestatic
digitsstd::numeric_limits< stan::agrad::var >static
digits10std::numeric_limits< stan::agrad::var >static
epsilon()std::numeric_limits< stan::agrad::var >inlinestatic
has_denormstd::numeric_limits< stan::agrad::var >static
has_denorm_lossstd::numeric_limits< stan::agrad::var >static
has_infinitystd::numeric_limits< stan::agrad::var >static
has_quiet_NaNstd::numeric_limits< stan::agrad::var >static
has_signaling_NaNstd::numeric_limits< stan::agrad::var >static
infinity()std::numeric_limits< stan::agrad::var >inlinestatic
is_boundedstd::numeric_limits< stan::agrad::var >static
is_exactstd::numeric_limits< stan::agrad::var >static
is_iec559std::numeric_limits< stan::agrad::var >static
is_integerstd::numeric_limits< stan::agrad::var >static
is_modulostd::numeric_limits< stan::agrad::var >static
is_signedstd::numeric_limits< stan::agrad::var >static
is_specializedstd::numeric_limits< stan::agrad::var >static
max()std::numeric_limits< stan::agrad::var >inlinestatic
max_exponentstd::numeric_limits< stan::agrad::var >static
max_exponent10std::numeric_limits< stan::agrad::var >static
min()std::numeric_limits< stan::agrad::var >inlinestatic
min_exponentstd::numeric_limits< stan::agrad::var >static
min_exponent10std::numeric_limits< stan::agrad::var >static
quiet_NaN()std::numeric_limits< stan::agrad::var >inlinestatic
radixstd::numeric_limits< stan::agrad::var >static
round_error()std::numeric_limits< stan::agrad::var >inlinestatic
round_stylestd::numeric_limits< stan::agrad::var >static
signaling_NaN()std::numeric_limits< stan::agrad::var >inlinestatic
tinyness_beforestd::numeric_limits< stan::agrad::var >static
trapsstd::numeric_limits< stan::agrad::var >static
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html b/doc/api/html/structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html new file mode 100644 index 00000000000..0a3a2f8c781 --- /dev/null +++ b/doc/api/html/structstd_1_1numeric__limits_3_01stan_1_1agrad_1_1var_01_4.html @@ -0,0 +1,882 @@ + + + + + +Stan: std::numeric_limits< stan::agrad::var > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
std::numeric_limits< stan::agrad::var > Struct Template Reference
+
+
+ +

Specialization of numeric limits for var objects. + More...

+ +

#include <numeric_limits.hpp>

+ + + + + + + + + + + + + + + + + + +

+Static Public Member Functions

static stan::agrad::var min ()
 
static stan::agrad::var max ()
 
static stan::agrad::var epsilon ()
 
static stan::agrad::var round_error ()
 
static stan::agrad::var infinity ()
 
static stan::agrad::var quiet_NaN ()
 
static stan::agrad::var signaling_NaN ()
 
static stan::agrad::var denorm_min ()
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Static Public Attributes

static const bool is_specialized = true
 
static const int digits = numeric_limits<double>::digits
 
static const int digits10 = numeric_limits<double>::digits10
 
static const bool is_signed = numeric_limits<double>::is_signed
 
static const bool is_integer = numeric_limits<double>::is_integer
 
static const bool is_exact = numeric_limits<double>::is_exact
 
static const int radix = numeric_limits<double>::radix
 
static const int min_exponent = numeric_limits<double>::min_exponent
 
static const int min_exponent10 = numeric_limits<double>::min_exponent10
 
static const int max_exponent = numeric_limits<double>::max_exponent
 
static const int max_exponent10 = numeric_limits<double>::max_exponent10
 
static const bool has_infinity = numeric_limits<double>::has_infinity
 
static const bool has_quiet_NaN = numeric_limits<double>::has_quiet_NaN
 
static const bool has_signaling_NaN = numeric_limits<double>::has_signaling_NaN
 
static const float_denorm_style has_denorm = numeric_limits<double>::has_denorm
 
static const bool has_denorm_loss = numeric_limits<double>::has_denorm_loss
 
static const bool is_iec559 = numeric_limits<double>::is_iec559
 
static const bool is_bounded = numeric_limits<double>::is_bounded
 
static const bool is_modulo = numeric_limits<double>::is_modulo
 
static const bool traps = numeric_limits<double>::traps
 
static const bool tinyness_before = numeric_limits<double>::tinyness_before
 
static const float_round_style round_style = numeric_limits<double>::round_style
 
+

Detailed Description

+

template<>
+struct std::numeric_limits< stan::agrad::var >

+ +

Specialization of numeric limits for var objects.

+

This implementation of std::numeric_limits<stan::agrad::var> is used to treat var objects like doubles.

+ +

Definition at line 16 of file numeric_limits.hpp.

+

Member Function Documentation

+ +
+
+ + + + + +
+ + + + + + + +
static stan::agrad::var std::numeric_limits< stan::agrad::var >::denorm_min ()
+
+inlinestatic
+
+ +

Definition at line 42 of file numeric_limits.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
static stan::agrad::var std::numeric_limits< stan::agrad::var >::epsilon ()
+
+inlinestatic
+
+ +

Definition at line 26 of file numeric_limits.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
static stan::agrad::var std::numeric_limits< stan::agrad::var >::infinity ()
+
+inlinestatic
+
+ +

Definition at line 39 of file numeric_limits.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
static stan::agrad::var std::numeric_limits< stan::agrad::var >::max ()
+
+inlinestatic
+
+ +

Definition at line 19 of file numeric_limits.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
static stan::agrad::var std::numeric_limits< stan::agrad::var >::min ()
+
+inlinestatic
+
+ +

Definition at line 18 of file numeric_limits.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
static stan::agrad::var std::numeric_limits< stan::agrad::var >::quiet_NaN ()
+
+inlinestatic
+
+ +

Definition at line 40 of file numeric_limits.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
static stan::agrad::var std::numeric_limits< stan::agrad::var >::round_error ()
+
+inlinestatic
+
+ +

Definition at line 27 of file numeric_limits.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + + + + +
static stan::agrad::var std::numeric_limits< stan::agrad::var >::signaling_NaN ()
+
+inlinestatic
+
+ +

Definition at line 41 of file numeric_limits.hpp.

+ +
+
+

Member Data Documentation

+ +
+
+ + + + + +
+ + + + +
const int std::numeric_limits< stan::agrad::var >::digits = numeric_limits<double>::digits
+
+static
+
+ +

Definition at line 20 of file numeric_limits.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
const int std::numeric_limits< stan::agrad::var >::digits10 = numeric_limits<double>::digits10
+
+static
+
+ +

Definition at line 21 of file numeric_limits.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
const float_denorm_style std::numeric_limits< stan::agrad::var >::has_denorm = numeric_limits<double>::has_denorm
+
+static
+
+ +

Definition at line 37 of file numeric_limits.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
const bool std::numeric_limits< stan::agrad::var >::has_denorm_loss = numeric_limits<double>::has_denorm_loss
+
+static
+
+ +

Definition at line 38 of file numeric_limits.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
const bool std::numeric_limits< stan::agrad::var >::has_infinity = numeric_limits<double>::has_infinity
+
+static
+
+ +

Definition at line 34 of file numeric_limits.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
const bool std::numeric_limits< stan::agrad::var >::has_quiet_NaN = numeric_limits<double>::has_quiet_NaN
+
+static
+
+ +

Definition at line 35 of file numeric_limits.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
const bool std::numeric_limits< stan::agrad::var >::has_signaling_NaN = numeric_limits<double>::has_signaling_NaN
+
+static
+
+ +

Definition at line 36 of file numeric_limits.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
const bool std::numeric_limits< stan::agrad::var >::is_bounded = numeric_limits<double>::is_bounded
+
+static
+
+ +

Definition at line 45 of file numeric_limits.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
const bool std::numeric_limits< stan::agrad::var >::is_exact = numeric_limits<double>::is_exact
+
+static
+
+ +

Definition at line 24 of file numeric_limits.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
const bool std::numeric_limits< stan::agrad::var >::is_iec559 = numeric_limits<double>::is_iec559
+
+static
+
+ +

Definition at line 44 of file numeric_limits.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
const bool std::numeric_limits< stan::agrad::var >::is_integer = numeric_limits<double>::is_integer
+
+static
+
+ +

Definition at line 23 of file numeric_limits.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
const bool std::numeric_limits< stan::agrad::var >::is_modulo = numeric_limits<double>::is_modulo
+
+static
+
+ +

Definition at line 46 of file numeric_limits.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
const bool std::numeric_limits< stan::agrad::var >::is_signed = numeric_limits<double>::is_signed
+
+static
+
+ +

Definition at line 22 of file numeric_limits.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
const bool std::numeric_limits< stan::agrad::var >::is_specialized = true
+
+static
+
+ +

Definition at line 17 of file numeric_limits.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
const int std::numeric_limits< stan::agrad::var >::max_exponent = numeric_limits<double>::max_exponent
+
+static
+
+ +

Definition at line 31 of file numeric_limits.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
const int std::numeric_limits< stan::agrad::var >::max_exponent10 = numeric_limits<double>::max_exponent10
+
+static
+
+ +

Definition at line 32 of file numeric_limits.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
const int std::numeric_limits< stan::agrad::var >::min_exponent = numeric_limits<double>::min_exponent
+
+static
+
+ +

Definition at line 29 of file numeric_limits.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
const int std::numeric_limits< stan::agrad::var >::min_exponent10 = numeric_limits<double>::min_exponent10
+
+static
+
+ +

Definition at line 30 of file numeric_limits.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
const int std::numeric_limits< stan::agrad::var >::radix = numeric_limits<double>::radix
+
+static
+
+ +

Definition at line 25 of file numeric_limits.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
const float_round_style std::numeric_limits< stan::agrad::var >::round_style = numeric_limits<double>::round_style
+
+static
+
+ +

Definition at line 50 of file numeric_limits.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
const bool std::numeric_limits< stan::agrad::var >::tinyness_before = numeric_limits<double>::tinyness_before
+
+static
+
+ +

Definition at line 49 of file numeric_limits.hpp.

+ +
+
+ +
+
+ + + + + +
+ + + + +
const bool std::numeric_limits< stan::agrad::var >::traps = numeric_limits<double>::traps
+
+static
+
+ +

Definition at line 48 of file numeric_limits.hpp.

+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/structterm__grammar.html b/doc/api/html/structterm__grammar.html new file mode 100644 index 00000000000..651de7eb309 --- /dev/null +++ b/doc/api/html/structterm__grammar.html @@ -0,0 +1,116 @@ + + + + + +Stan: term_grammar< Iterator > Struct Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ +
+
+
+
term_grammar< Iterator > Struct Template Reference
+
+
+ +

#include <term_grammar.hpp>

+

Detailed Description

+

template<typename Iterator>
+struct term_grammar< Iterator >

+ + +

Definition at line 19 of file term_grammar.hpp.

+

The documentation for this struct was generated from the following file: +
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/student__t_8hpp.html b/doc/api/html/student__t_8hpp.html new file mode 100644 index 00000000000..66a5f251ce5 --- /dev/null +++ b/doc/api/html/student__t_8hpp.html @@ -0,0 +1,160 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/student_t.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
student_t.hpp File Reference
+
+
+
#include <boost/random/student_t_distribution.hpp>
+#include <boost/random/variate_generator.hpp>
+#include <stan/agrad/partials_vari.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/math/constants.hpp>
+#include <stan/math/functions/square.hpp>
+#include <stan/math/functions/value_of.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/prob/constants.hpp>
+#include <stan/prob/traits.hpp>
+#include <stan/prob/internal_math.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + + + + + + + +

+Functions

template<bool propto, typename T_y , typename T_dof , typename T_loc , typename T_scale >
return_type< T_y, T_dof, T_loc,
+T_scale >::type 
stan::prob::student_t_log (const T_y &y, const T_dof &nu, const T_loc &mu, const T_scale &sigma)
 The log of the Student-t density for the given y, nu, mean, and scale parameter.
 
template<typename T_y , typename T_dof , typename T_loc , typename T_scale >
return_type< T_y, T_dof, T_loc,
+T_scale >::type 
stan::prob::student_t_log (const T_y &y, const T_dof &nu, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_dof , typename T_loc , typename T_scale >
return_type< T_y, T_dof, T_loc,
+T_scale >::type 
stan::prob::student_t_cdf (const T_y &y, const T_dof &nu, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_dof , typename T_loc , typename T_scale >
return_type< T_y, T_dof, T_loc,
+T_scale >::type 
stan::prob::student_t_cdf_log (const T_y &y, const T_dof &nu, const T_loc &mu, const T_scale &sigma)
 
template<typename T_y , typename T_dof , typename T_loc , typename T_scale >
return_type< T_y, T_dof, T_loc,
+T_scale >::type 
stan::prob::student_t_ccdf_log (const T_y &y, const T_dof &nu, const T_loc &mu, const T_scale &sigma)
 
template<class RNG >
double stan::prob::student_t_rng (const double nu, const double mu, const double sigma, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/student__t_8hpp_source.html b/doc/api/html/student__t_8hpp_source.html new file mode 100644 index 00000000000..c1c66f5ee3b --- /dev/null +++ b/doc/api/html/student__t_8hpp_source.html @@ -0,0 +1,865 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/student_t.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
student_t.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS__STUDENT_T_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS__STUDENT_T_HPP__
+
3 
+
4 #include <boost/random/student_t_distribution.hpp>
+
5 #include <boost/random/variate_generator.hpp>
+
6 
+ + + + + +
12 #include <stan/meta/traits.hpp>
+
13 #include <stan/prob/constants.hpp>
+
14 #include <stan/prob/traits.hpp>
+ +
16 
+
17 namespace stan {
+
18 
+
19  namespace prob {
+
20 
+
46  template <bool propto, typename T_y, typename T_dof,
+
47  typename T_loc, typename T_scale>
+
48  typename return_type<T_y,T_dof,T_loc,T_scale>::type
+
49  student_t_log(const T_y& y, const T_dof& nu, const T_loc& mu,
+
50  const T_scale& sigma) {
+
51  static const char* function = "stan::prob::student_t_log(%1%)";
+
52 
+ + + + +
57 
+
58  // check if any vectors are zero length
+
59  if (!(stan::length(y)
+
60  && stan::length(nu)
+
61  && stan::length(mu)
+
62  && stan::length(sigma)))
+
63  return 0.0;
+
64 
+
65  double logp(0.0);
+
66 
+
67  // validate args (here done over var, which should be OK)
+
68  if (!check_not_nan(function, y, "Random variable", &logp))
+
69  return logp;
+
70  if(!check_finite(function, nu, "Degrees of freedom parameter",
+
71  &logp))
+
72  return logp;
+
73  if(!check_positive(function, nu, "Degrees of freedom parameter",
+
74  &logp))
+
75  return logp;
+
76  if (!check_finite(function, mu, "Location parameter",
+
77  &logp))
+
78  return logp;
+
79  if (!check_finite(function, sigma, "Scale parameter",
+
80  &logp))
+
81  return logp;
+
82  if (!check_positive(function, sigma, "Scale parameter",
+
83  &logp))
+
84  return logp;
+
85  if (!(check_consistent_sizes(function,
+
86  y,nu,mu,sigma,
+
87  "Random variable",
+
88  "Degrees of freedom parameter",
+
89  "Location parameter","Scale parameter",
+
90  &logp)))
+
91  return logp;
+
92 
+
93  // check if no variables are involved and prop-to
+ +
95  return 0.0;
+
96 
+
97  VectorView<const T_y> y_vec(y);
+
98  VectorView<const T_dof> nu_vec(nu);
+
99  VectorView<const T_loc> mu_vec(mu);
+
100  VectorView<const T_scale> sigma_vec(sigma);
+
101  size_t N = max_size(y, nu, mu, sigma);
+
102 
+
103  using std::log;
+
104  using boost::math::digamma;
+
105  using boost::math::lgamma;
+
106  using stan::math::square;
+
107  using stan::math::value_of;
+
108 
+ +
110  is_vector<T_dof>::value> half_nu(length(nu));
+
111  for (size_t i = 0; i < length(nu); i++)
+ +
113  half_nu[i] = 0.5 * value_of(nu_vec[i]);
+ +
115  is_vector<T_dof>::value> lgamma_half_nu(length(nu));
+ +
117  is_vector<T_dof>::value> lgamma_half_nu_plus_half(length(nu));
+ +
119  for (size_t i = 0; i < length(nu); i++) {
+
120  lgamma_half_nu[i] = lgamma(half_nu[i]);
+
121  lgamma_half_nu_plus_half[i] = lgamma(half_nu[i] + 0.5);
+
122  }
+ +
124  is_vector<T_dof>::value> digamma_half_nu(length(nu));
+ +
126  is_vector<T_dof>::value> digamma_half_nu_plus_half(length(nu));
+ +
128  for (size_t i = 0; i < length(nu); i++) {
+
129  digamma_half_nu[i] = digamma(half_nu[i]);
+
130  digamma_half_nu_plus_half[i] = digamma(half_nu[i] + 0.5);
+
131  }
+
132 
+
133 
+
134 
+ +
136  is_vector<T_dof>::value> log_nu(length(nu));
+
137  for (size_t i = 0; i < length(nu); i++)
+ +
139  log_nu[i] = log(value_of(nu_vec[i]));
+ +
141  is_vector<T_scale>::value> log_sigma(length(sigma));
+
142  for (size_t i = 0; i < length(sigma); i++)
+ +
144  log_sigma[i] = log(value_of(sigma_vec[i]));
+
145 
+ + + + + +
151  square_y_minus_mu_over_sigma__over_nu(N);
+
152 
+ + + + + +
158  log1p_exp(N);
+
159 
+
160  for (size_t i = 0; i < N; i++)
+ +
162  const double y_dbl = value_of(y_vec[i]);
+
163  const double mu_dbl = value_of(mu_vec[i]);
+
164  const double sigma_dbl = value_of(sigma_vec[i]);
+
165  const double nu_dbl = value_of(nu_vec[i]);
+
166  square_y_minus_mu_over_sigma__over_nu[i]
+
167  = square((y_dbl - mu_dbl) / sigma_dbl) / nu_dbl;
+
168  log1p_exp[i] = log1p(square_y_minus_mu_over_sigma__over_nu[i]);
+
169  }
+
170 
+ +
172  operands_and_partials(y,nu,mu,sigma);
+
173  for (size_t n = 0; n < N; n++) {
+
174  const double y_dbl = value_of(y_vec[n]);
+
175  const double mu_dbl = value_of(mu_vec[n]);
+
176  const double sigma_dbl = value_of(sigma_vec[n]);
+
177  const double nu_dbl = value_of(nu_vec[n]);
+ +
179  logp += NEG_LOG_SQRT_PI;
+ +
181  logp += lgamma_half_nu_plus_half[n] - lgamma_half_nu[n]
+
182  - 0.5 * log_nu[n];
+ +
184  logp -= log_sigma[n];
+ +
186  logp -= (half_nu[n] + 0.5)
+
187  * log1p_exp[n];
+
188 
+ +
190  operands_and_partials.d_x1[n]
+
191  += -(half_nu[n]+0.5)
+
192  * 1.0 / (1.0 + square_y_minus_mu_over_sigma__over_nu[n])
+
193  * (2.0 * (y_dbl - mu_dbl) / square(sigma_dbl) / nu_dbl);
+
194  }
+ +
196  const double inv_nu = 1.0 / nu_dbl;
+
197  operands_and_partials.d_x2[n]
+
198  += 0.5*digamma_half_nu_plus_half[n] - 0.5*digamma_half_nu[n]
+
199  - 0.5 * inv_nu
+
200  - 0.5*log1p_exp[n]
+
201  + (half_nu[n] + 0.5)
+
202  * (1.0/(1.0 + square_y_minus_mu_over_sigma__over_nu[n])
+
203  * square_y_minus_mu_over_sigma__over_nu[n] * inv_nu);
+
204  }
+ +
206  operands_and_partials.d_x3[n]
+
207  -= (half_nu[n] + 0.5)
+
208  / (1.0 + square_y_minus_mu_over_sigma__over_nu[n])
+
209  * (2.0 * (mu_dbl - y_dbl) / (sigma_dbl*sigma_dbl*nu_dbl));
+
210  }
+ +
212  const double inv_sigma = 1.0 / sigma_dbl;
+
213  operands_and_partials.d_x4[n]
+
214  += -inv_sigma
+
215  + (nu_dbl + 1.0) / (1.0 + square_y_minus_mu_over_sigma__over_nu[n])
+
216  * (square_y_minus_mu_over_sigma__over_nu[n] * inv_sigma);
+
217  }
+
218  }
+
219  return operands_and_partials.to_var(logp);
+
220  }
+
221 
+
222  template <typename T_y, typename T_dof, typename T_loc, typename T_scale>
+
223  inline
+ +
225  student_t_log(const T_y& y, const T_dof& nu, const T_loc& mu,
+
226  const T_scale& sigma) {
+
227  return student_t_log<false>(y,nu,mu,sigma);
+
228  }
+
229 
+
230  template <typename T_y, typename T_dof, typename T_loc, typename T_scale>
+ +
232  student_t_cdf(const T_y& y, const T_dof& nu, const T_loc& mu,
+
233  const T_scale& sigma) {
+
234 
+
235  // Size checks
+
236  if (!(stan::length(y) && stan::length(nu) && stan::length(mu)
+
237  && stan::length(sigma)))
+
238  return 1.0;
+
239 
+
240  static const char* function = "stan::prob::student_t_cdf(%1%)";
+
241 
+ + + + +
246  using stan::math::value_of;
+
247 
+
248  double P(1.0);
+
249 
+
250  if (!check_not_nan(function, y, "Random variable", &P))
+
251  return P;
+
252  if (!check_finite(function, nu, "Degrees of freedom parameter", &P))
+
253  return P;
+
254  if (!check_positive(function, nu, "Degrees of freedom parameter", &P))
+
255  return P;
+
256  if (!check_finite(function, mu, "Location parameter", &P))
+
257  return P;
+
258  if (!check_finite(function, sigma, "Scale parameter", &P))
+
259  return P;
+
260  if (!check_positive(function, sigma, "Scale parameter", &P))
+
261  return P;
+
262 
+
263  // Wrap arguments in vectors
+
264  VectorView<const T_y> y_vec(y);
+
265  VectorView<const T_dof> nu_vec(nu);
+
266  VectorView<const T_loc> mu_vec(mu);
+
267  VectorView<const T_scale> sigma_vec(sigma);
+
268  size_t N = max_size(y, nu, mu, sigma);
+
269 
+ +
271  operands_and_partials(y, nu, mu, sigma);
+
272 
+
273  // Explicit return for extreme values
+
274  // The gradients are technically ill-defined, but treated as zero
+
275  for (size_t i = 0; i < stan::length(y); i++) {
+
276  if (value_of(y_vec[i]) == -std::numeric_limits<double>::infinity())
+
277  return operands_and_partials.to_var(0.0);
+
278  }
+
279 
+
280  using boost::math::ibeta;
+
281  using boost::math::ibeta_derivative;
+
282  using boost::math::digamma;
+
283  using boost::math::beta;
+
284 
+
285  // Cache a few expensive function calls if nu is a parameter
+
286  double digammaHalf = 0;
+
287 
+ +
289  digamma_vec(stan::length(nu));
+ +
291  digammaNu_vec(stan::length(nu));
+ +
293  digammaNuPlusHalf_vec(stan::length(nu));
+ +
295  betaNuHalf_vec(stan::length(nu));
+
296 
+ +
298  digammaHalf = digamma(0.5);
+
299 
+
300  for (size_t i = 0; i < stan::length(nu); i++) {
+
301  const double nu_dbl = value_of(nu_vec[i]);
+
302 
+
303  digammaNu_vec[i] = digamma(0.5 * nu_dbl);
+
304  digammaNuPlusHalf_vec[i] = digamma(0.5 + 0.5 * nu_dbl);
+
305  betaNuHalf_vec[i] = beta(0.5, 0.5 * nu_dbl);
+
306  }
+
307  }
+
308 
+
309  // Compute vectorized CDF and gradient
+
310  for (size_t n = 0; n < N; n++) {
+
311 
+
312  // Explicit results for extreme values
+
313  // The gradients are technically ill-defined, but treated as zero
+
314  if (value_of(y_vec[n]) == std::numeric_limits<double>::infinity()) {
+
315  continue;
+
316  }
+
317 
+
318  const double sigma_inv = 1.0 / value_of(sigma_vec[n]);
+
319  const double t = (value_of(y_vec[n]) - value_of(mu_vec[n])) * sigma_inv;
+
320  const double nu_dbl = value_of(nu_vec[n]);
+
321  const double q = nu_dbl / (t * t);
+
322  const double r = 1.0 / (1.0 + q);
+
323  const double J = 2 * r * r * q / t;
+
324  double zJacobian = t > 0 ? - 0.5 : 0.5;
+
325 
+
326  if(q < 2)
+
327  {
+
328 
+
329  double z = ibeta(0.5 * nu_dbl, 0.5, 1.0 - r);
+
330  const double Pn = t > 0 ? 1.0 - 0.5 * z : 0.5 * z;
+
331  const double d_ibeta = ibeta_derivative(0.5 * nu_dbl, 0.5, 1.0 - r);
+
332 
+
333  P *= Pn;
+
334 
+ +
336  operands_and_partials.d_x1[n]
+
337  += - zJacobian * d_ibeta * J * sigma_inv / Pn;
+ +
339 
+
340  double g1 = 0;
+
341  double g2 = 0;
+
342 
+
343  stan::math::gradRegIncBeta(g1, g2, 0.5 * nu_dbl, 0.5, 1.0 - r,
+
344  digammaNu_vec[n], digammaHalf,
+
345  digammaNuPlusHalf_vec[n],
+
346  betaNuHalf_vec[n]);
+
347 
+
348  operands_and_partials.d_x2[n]
+
349  += zJacobian * ( d_ibeta * (r / t) * (r / t) + 0.5 * g1 ) / Pn;
+
350  }
+
351 
+ +
353  operands_and_partials.d_x3[n]
+
354  += zJacobian * d_ibeta * J * sigma_inv / Pn;
+ +
356  operands_and_partials.d_x4[n]
+
357  += zJacobian * d_ibeta * J * sigma_inv * t / Pn;
+
358 
+
359  }
+
360  else {
+
361 
+
362  double z = 1 - ibeta(0.5, 0.5 * nu_dbl, r);
+
363  zJacobian *= -1;
+
364 
+
365  const double Pn = t > 0 ? 1.0 - 0.5 * z : 0.5 * z;
+
366 
+
367  double d_ibeta = ibeta_derivative(0.5, 0.5 * nu_dbl, r);
+
368 
+
369  P *= Pn;
+
370 
+ +
372  operands_and_partials.d_x1[n]
+
373  += zJacobian * d_ibeta * J * sigma_inv / Pn;
+ +
375 
+
376  double g1 = 0;
+
377  double g2 = 0;
+
378 
+
379  stan::math::gradRegIncBeta(g1, g2, 0.5, 0.5 * nu_dbl, r,
+
380  digammaHalf, digammaNu_vec[n],
+
381  digammaNuPlusHalf_vec[n],
+
382  betaNuHalf_vec[n]);
+
383 
+
384  operands_and_partials.d_x2[n]
+
385  += zJacobian * ( - d_ibeta * (r / t) * (r / t) + 0.5 * g2 ) / Pn;
+
386  }
+ +
388  operands_and_partials.d_x3[n]
+
389  += - zJacobian * d_ibeta * J * sigma_inv / Pn;
+ +
391  operands_and_partials.d_x4[n]
+
392  += - zJacobian * d_ibeta * J * sigma_inv * t / Pn;
+
393  }
+
394  }
+
395 
+ +
397  for(size_t n = 0; n < stan::length(y); ++n)
+
398  operands_and_partials.d_x1[n] *= P;
+ +
400  for(size_t n = 0; n < stan::length(nu); ++n)
+
401  operands_and_partials.d_x2[n] *= P;
+ +
403  for(size_t n = 0; n < stan::length(mu); ++n)
+
404  operands_and_partials.d_x3[n] *= P;
+ +
406  for(size_t n = 0; n < stan::length(sigma); ++n)
+
407  operands_and_partials.d_x4[n] *= P;
+
408 
+
409  return operands_and_partials.to_var(P);
+
410  }
+
411 
+
412  template <typename T_y, typename T_dof, typename T_loc, typename T_scale>
+ +
414  student_t_cdf_log(const T_y& y, const T_dof& nu, const T_loc& mu,
+
415  const T_scale& sigma) {
+
416 
+
417  // Size checks
+
418  if (!(stan::length(y) && stan::length(nu) && stan::length(mu)
+
419  && stan::length(sigma)))
+
420  return 0.0;
+
421 
+
422  static const char* function = "stan::prob::student_t_cdf_log(%1%)";
+
423 
+ + + + +
428  using stan::math::value_of;
+
429 
+
430  double P(0.0);
+
431 
+
432  if (!check_not_nan(function, y, "Random variable", &P))
+
433  return P;
+
434  if (!check_finite(function, nu, "Degrees of freedom parameter", &P))
+
435  return P;
+
436  if (!check_positive(function, nu, "Degrees of freedom parameter", &P))
+
437  return P;
+
438  if (!check_finite(function, mu, "Location parameter", &P))
+
439  return P;
+
440  if (!check_finite(function, sigma, "Scale parameter", &P))
+
441  return P;
+
442  if (!check_positive(function, sigma, "Scale parameter", &P))
+
443  return P;
+
444 
+
445  // Wrap arguments in vectors
+
446  VectorView<const T_y> y_vec(y);
+
447  VectorView<const T_dof> nu_vec(nu);
+
448  VectorView<const T_loc> mu_vec(mu);
+
449  VectorView<const T_scale> sigma_vec(sigma);
+
450  size_t N = max_size(y, nu, mu, sigma);
+
451 
+ +
453  operands_and_partials(y, nu, mu, sigma);
+
454 
+
455  // Explicit return for extreme values
+
456  // The gradients are technically ill-defined, but treated as zero
+
457  for (size_t i = 0; i < stan::length(y); i++) {
+
458  if (value_of(y_vec[i]) == -std::numeric_limits<double>::infinity())
+
459  return operands_and_partials.to_var(stan::math::negative_infinity());
+
460  }
+
461 
+
462  using boost::math::ibeta;
+
463  using boost::math::ibeta_derivative;
+
464  using boost::math::digamma;
+
465  using boost::math::beta;
+
466 
+
467  // Cache a few expensive function calls if nu is a parameter
+
468  double digammaHalf = 0;
+
469 
+ +
471  digamma_vec(stan::length(nu));
+ +
473  digammaNu_vec(stan::length(nu));
+ +
475  digammaNuPlusHalf_vec(stan::length(nu));
+ +
477  betaNuHalf_vec(stan::length(nu));
+
478 
+ +
480  digammaHalf = digamma(0.5);
+
481 
+
482  for (size_t i = 0; i < stan::length(nu); i++) {
+
483  const double nu_dbl = value_of(nu_vec[i]);
+
484 
+
485  digammaNu_vec[i] = digamma(0.5 * nu_dbl);
+
486  digammaNuPlusHalf_vec[i] = digamma(0.5 + 0.5 * nu_dbl);
+
487  betaNuHalf_vec[i] = beta(0.5, 0.5 * nu_dbl);
+
488  }
+
489  }
+
490 
+
491  // Compute vectorized cdf_log and gradient
+
492  for (size_t n = 0; n < N; n++) {
+
493 
+
494  // Explicit results for extreme values
+
495  // The gradients are technically ill-defined, but treated as zero
+
496  if (value_of(y_vec[n]) == std::numeric_limits<double>::infinity()) {
+
497  continue;
+
498  }
+
499 
+
500  const double sigma_inv = 1.0 / value_of(sigma_vec[n]);
+
501  const double t = (value_of(y_vec[n]) - value_of(mu_vec[n])) * sigma_inv;
+
502  const double nu_dbl = value_of(nu_vec[n]);
+
503  const double q = nu_dbl / (t * t);
+
504  const double r = 1.0 / (1.0 + q);
+
505  const double J = 2 * r * r * q / t;
+
506  double zJacobian = t > 0 ? - 0.5 : 0.5;
+
507 
+
508  if(q < 2) {
+
509  double z = ibeta(0.5 * nu_dbl, 0.5, 1.0 - r);
+
510  const double Pn = t > 0 ? 1.0 - 0.5 * z : 0.5 * z;
+
511  const double d_ibeta = ibeta_derivative(0.5 * nu_dbl, 0.5, 1.0 - r);
+
512 
+
513  P += log(Pn);
+
514 
+ +
516  operands_and_partials.d_x1[n]
+
517  += - zJacobian * d_ibeta * J * sigma_inv / Pn;
+
518 
+ +
520 
+
521  double g1 = 0;
+
522  double g2 = 0;
+
523 
+
524  stan::math::gradRegIncBeta(g1, g2, 0.5 * nu_dbl, 0.5, 1.0 - r,
+
525  digammaNu_vec[n], digammaHalf,
+
526  digammaNuPlusHalf_vec[n],
+
527  betaNuHalf_vec[n]);
+
528 
+
529  operands_and_partials.d_x2[n]
+
530  += zJacobian * ( d_ibeta * (r / t) * (r / t) + 0.5 * g1 ) / Pn;
+
531  }
+
532 
+ +
534  operands_and_partials.d_x3[n]
+
535  += zJacobian * d_ibeta * J * sigma_inv / Pn;
+ +
537  operands_and_partials.d_x4[n]
+
538  += zJacobian * d_ibeta * J * sigma_inv * t / Pn;
+
539 
+
540  }
+
541  else {
+
542 
+
543  double z = 1 - ibeta(0.5, 0.5 * nu_dbl, r);
+
544  zJacobian *= -1;
+
545 
+
546  const double Pn = t > 0 ? 1.0 - 0.5 * z : 0.5 * z;
+
547 
+
548  double d_ibeta = ibeta_derivative(0.5, 0.5 * nu_dbl, r);
+
549 
+
550  P += log(Pn);
+
551 
+ +
553  operands_and_partials.d_x1[n]
+
554  += zJacobian * d_ibeta * J * sigma_inv / Pn;
+
555 
+ +
557 
+
558  double g1 = 0;
+
559  double g2 = 0;
+
560 
+
561  stan::math::gradRegIncBeta(g1, g2, 0.5, 0.5 * nu_dbl, r,
+
562  digammaHalf, digammaNu_vec[n],
+
563  digammaNuPlusHalf_vec[n],
+
564  betaNuHalf_vec[n]);
+
565 
+
566  operands_and_partials.d_x2[n]
+
567  += zJacobian * ( - d_ibeta * (r / t) * (r / t) + 0.5 * g2 ) / Pn;
+
568  }
+
569 
+ +
571  operands_and_partials.d_x3[n]
+
572  += - zJacobian * d_ibeta * J * sigma_inv / Pn;
+ +
574  operands_and_partials.d_x4[n]
+
575  += - zJacobian * d_ibeta * J * sigma_inv * t / Pn;
+
576  }
+
577  }
+
578 
+
579  return operands_and_partials.to_var(P);
+
580  }
+
581 
+
582  template <typename T_y, typename T_dof, typename T_loc, typename T_scale>
+ +
584  student_t_ccdf_log(const T_y& y, const T_dof& nu, const T_loc& mu,
+
585  const T_scale& sigma) {
+
586 
+
587  // Size checks
+
588  if (!(stan::length(y) && stan::length(nu) && stan::length(mu)
+
589  && stan::length(sigma)))
+
590  return 0.0;
+
591 
+
592  static const char* function = "stan::prob::student_t_ccdf_log(%1%)";
+
593 
+ + + + +
598  using stan::math::value_of;
+
599 
+
600  double P(0.0);
+
601 
+
602  if (!check_not_nan(function, y, "Random variable", &P))
+
603  return P;
+
604  if (!check_finite(function, nu, "Degrees of freedom parameter", &P))
+
605  return P;
+
606  if (!check_positive(function, nu, "Degrees of freedom parameter", &P))
+
607  return P;
+
608  if (!check_finite(function, mu, "Location parameter", &P))
+
609  return P;
+
610  if (!check_finite(function, sigma, "Scale parameter", &P))
+
611  return P;
+
612  if (!check_positive(function, sigma, "Scale parameter", &P))
+
613  return P;
+
614 
+
615  // Wrap arguments in vectors
+
616  VectorView<const T_y> y_vec(y);
+
617  VectorView<const T_dof> nu_vec(nu);
+
618  VectorView<const T_loc> mu_vec(mu);
+
619  VectorView<const T_scale> sigma_vec(sigma);
+
620  size_t N = max_size(y, nu, mu, sigma);
+
621 
+ +
623  operands_and_partials(y, nu, mu, sigma);
+
624 
+
625  // Explicit return for extreme values
+
626  // The gradients are technically ill-defined, but treated as zero
+
627  for (size_t i = 0; i < stan::length(y); i++) {
+
628  if (value_of(y_vec[i]) == -std::numeric_limits<double>::infinity())
+
629  return operands_and_partials.to_var(0.0);
+
630  }
+
631 
+
632  using boost::math::ibeta;
+
633  using boost::math::ibeta_derivative;
+
634  using boost::math::digamma;
+
635  using boost::math::beta;
+
636 
+
637  // Cache a few expensive function calls if nu is a parameter
+
638  double digammaHalf = 0;
+
639 
+ +
641  digamma_vec(stan::length(nu));
+ +
643  digammaNu_vec(stan::length(nu));
+ +
645  digammaNuPlusHalf_vec(stan::length(nu));
+ +
647  betaNuHalf_vec(stan::length(nu));
+
648 
+ +
650  digammaHalf = digamma(0.5);
+
651 
+
652  for (size_t i = 0; i < stan::length(nu); i++) {
+
653  const double nu_dbl = value_of(nu_vec[i]);
+
654 
+
655  digammaNu_vec[i] = digamma(0.5 * nu_dbl);
+
656  digammaNuPlusHalf_vec[i] = digamma(0.5 + 0.5 * nu_dbl);
+
657  betaNuHalf_vec[i] = beta(0.5, 0.5 * nu_dbl);
+
658  }
+
659  }
+
660 
+
661  // Compute vectorized cdf_log and gradient
+
662  for (size_t n = 0; n < N; n++) {
+
663 
+
664  // Explicit results for extreme values
+
665  // The gradients are technically ill-defined, but treated as zero
+
666  if (value_of(y_vec[n]) == std::numeric_limits<double>::infinity()) {
+
667  return operands_and_partials.to_var(stan::math::negative_infinity());
+
668  }
+
669 
+
670  const double sigma_inv = 1.0 / value_of(sigma_vec[n]);
+
671  const double t = (value_of(y_vec[n]) - value_of(mu_vec[n])) * sigma_inv;
+
672  const double nu_dbl = value_of(nu_vec[n]);
+
673  const double q = nu_dbl / (t * t);
+
674  const double r = 1.0 / (1.0 + q);
+
675  const double J = 2 * r * r * q / t;
+
676  double zJacobian = t > 0 ? - 0.5 : 0.5;
+
677 
+
678  if(q < 2) {
+
679  double z = ibeta(0.5 * nu_dbl, 0.5, 1.0 - r);
+
680  const double Pn = t > 0 ? 0.5 * z : 1.0 - 0.5 * z;
+
681  const double d_ibeta = ibeta_derivative(0.5 * nu_dbl, 0.5, 1.0 - r);
+
682 
+
683  P += log(Pn);
+
684 
+ +
686  operands_and_partials.d_x1[n]
+
687  += zJacobian * d_ibeta * J * sigma_inv / Pn;
+
688 
+ +
690 
+
691  double g1 = 0;
+
692  double g2 = 0;
+
693 
+
694  stan::math::gradRegIncBeta(g1, g2, 0.5 * nu_dbl, 0.5, 1.0 - r,
+
695  digammaNu_vec[n], digammaHalf,
+
696  digammaNuPlusHalf_vec[n],
+
697  betaNuHalf_vec[n]);
+
698 
+
699  operands_and_partials.d_x2[n]
+
700  -= zJacobian * ( d_ibeta * (r / t) * (r / t) + 0.5 * g1 ) / Pn;
+
701  }
+
702 
+ +
704  operands_and_partials.d_x3[n]
+
705  -= zJacobian * d_ibeta * J * sigma_inv / Pn;
+ +
707  operands_and_partials.d_x4[n]
+
708  -= zJacobian * d_ibeta * J * sigma_inv * t / Pn;
+
709 
+
710  }
+
711  else {
+
712 
+
713  double z = 1 - ibeta(0.5, 0.5 * nu_dbl, r);
+
714  zJacobian *= -1;
+
715 
+
716  const double Pn = t > 0 ? 0.5 * z : 1.0 - 0.5 * z;
+
717 
+
718  double d_ibeta = ibeta_derivative(0.5, 0.5 * nu_dbl, r);
+
719 
+
720  P += log(Pn);
+
721 
+ +
723  operands_and_partials.d_x1[n]
+
724  -= zJacobian * d_ibeta * J * sigma_inv / Pn;
+
725 
+ +
727 
+
728  double g1 = 0;
+
729  double g2 = 0;
+
730 
+
731  stan::math::gradRegIncBeta(g1, g2, 0.5, 0.5 * nu_dbl, r,
+
732  digammaHalf, digammaNu_vec[n],
+
733  digammaNuPlusHalf_vec[n],
+
734  betaNuHalf_vec[n]);
+
735 
+
736  operands_and_partials.d_x2[n]
+
737  -= zJacobian * ( - d_ibeta * (r / t) * (r / t) + 0.5 * g2 ) / Pn;
+
738  }
+
739 
+ +
741  operands_and_partials.d_x3[n]
+
742  += zJacobian * d_ibeta * J * sigma_inv / Pn;
+ +
744  operands_and_partials.d_x4[n]
+
745  += zJacobian * d_ibeta * J * sigma_inv * t / Pn;
+
746  }
+
747  }
+
748 
+
749  return operands_and_partials.to_var(P);
+
750  }
+
751 
+
752  template <class RNG>
+
753  inline double
+
754  student_t_rng(const double nu,
+
755  const double mu,
+
756  const double sigma,
+
757  RNG& rng) {
+
758  using boost::variate_generator;
+
759  using boost::random::student_t_distribution;
+
760 
+
761  static const char* function = "stan::prob::student_t_rng(%1%)";
+
762 
+ + +
765 
+
766  if(!check_finite(function, nu, "Degrees of freedom parameter"))
+
767  return 0;
+
768  if(!check_positive(function, nu, "Degrees of freedom parameter"))
+
769  return 0;
+
770  if (!check_finite(function, mu, "Location parameter"))
+
771  return 0;
+
772  if (!check_finite(function, sigma, "Scale parameter"))
+
773  return 0;
+
774  if (!check_positive(function, sigma, "Scale parameter"))
+
775  return 0;
+
776 
+
777  variate_generator<RNG&, student_t_distribution<> >
+
778  rng_unit_student_t(rng, student_t_distribution<>(nu));
+
779  return mu + sigma * rng_unit_student_t();
+
780  }
+
781  }
+
782 }
+
783 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/sub_8hpp.html b/doc/api/html/sub_8hpp.html new file mode 100644 index 00000000000..6f4914ea65d --- /dev/null +++ b/doc/api/html/sub_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/functions/sub.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
sub.hpp File Reference
+
+
+
#include <vector>
+#include <cstddef>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + +

+Functions

void stan::math::sub (std::vector< double > &x, std::vector< double > &y, std::vector< double > &result)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/sub_8hpp_source.html b/doc/api/html/sub_8hpp_source.html new file mode 100644 index 00000000000..49a5789107a --- /dev/null +++ b/doc/api/html/sub_8hpp_source.html @@ -0,0 +1,127 @@ + + + + + +Stan: src/stan/math/functions/sub.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
sub.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__SUB_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__SUB_HPP__
+
3 
+
4 #include <vector>
+
5 #include <cstddef>
+
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
10  inline void sub(std::vector<double>& x, std::vector<double>& y,
+
11  std::vector<double>& result) {
+
12  result.resize(x.size());
+
13  for (size_t i = 0; i < x.size(); ++i)
+
14  result[i] = x[i] - y[i];
+
15  }
+
16 
+
17  }
+
18 }
+
19 
+
20 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/sub__col_8hpp.html b/doc/api/html/sub__col_8hpp.html new file mode 100644 index 00000000000..53532a0cc6f --- /dev/null +++ b/doc/api/html/sub__col_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/matrix/sub_col.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
sub_col.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
stan::math::sub_col (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &m, size_t i, size_t j, size_t nrows)
 Return a nrows x 1 subcolumn starting at (i-1,j-1).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/sub__col_8hpp_source.html b/doc/api/html/sub__col_8hpp_source.html new file mode 100644 index 00000000000..89b556bbf49 --- /dev/null +++ b/doc/api/html/sub__col_8hpp_source.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/matrix/sub_col.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
sub_col.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__SUB_COL_HPP__
+
2 #define __STAN__MATH__MATRIX__SUB_COL_HPP__
+
3 
+ + + +
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
19  template <typename T>
+
20  inline
+
21  Eigen::Matrix<T,Eigen::Dynamic,1>
+
22  sub_col(const Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& m,
+
23  size_t i, size_t j, size_t nrows) {
+
24  validate_row_index(m,i,"sub_column");
+
25  if (nrows > 0) validate_row_index(m,i+nrows-1,"sub_column");
+
26  validate_column_index(m,j,"sub_column");
+
27  return m.block(i - 1,j - 1,nrows,1);
+
28  }
+
29 
+
30 
+
31  }
+
32 }
+
33 
+
34 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/sub__row_8hpp.html b/doc/api/html/sub__row_8hpp.html new file mode 100644 index 00000000000..6db94b4115a --- /dev/null +++ b/doc/api/html/sub__row_8hpp.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/matrix/sub_row.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
sub_row.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
Eigen::Matrix< T,
+1, Eigen::Dynamic > 
stan::math::sub_row (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &m, size_t i, size_t j, size_t ncols)
 Return a 1 x nrows subrow starting at (i-1,j-1).
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/sub__row_8hpp_source.html b/doc/api/html/sub__row_8hpp_source.html new file mode 100644 index 00000000000..29cabd7773a --- /dev/null +++ b/doc/api/html/sub__row_8hpp_source.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/matrix/sub_row.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
sub_row.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__SUB_ROW_HPP__
+
2 #define __STAN__MATH__MATRIX__SUB_ROW_HPP__
+
3 
+ + + +
7 
+
8 namespace stan {
+
9 
+
10  namespace math {
+
11 
+
20  template <typename T>
+
21  inline
+
22  Eigen::Matrix<T,1,Eigen::Dynamic>
+
23  sub_row(const Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& m,
+
24  size_t i, size_t j, size_t ncols) {
+
25  validate_row_index(m,i,"sub_row");
+
26  validate_column_index(m,j,"sub_row");
+
27  if (ncols > 0) validate_column_index(m,j+ncols-1,"sub_row");
+
28  return m.block(i - 1,j - 1,1,ncols);
+
29  }
+
30 
+
31  }
+
32 }
+
33 
+
34 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/subtract_8hpp.html b/doc/api/html/subtract_8hpp.html new file mode 100644 index 00000000000..6fa1e8163da --- /dev/null +++ b/doc/api/html/subtract_8hpp.html @@ -0,0 +1,144 @@ + + + + + +Stan: src/stan/math/matrix/subtract.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
subtract.hpp File Reference
+
+
+
#include <boost/math/tools/promotion.hpp>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/validate_matching_dims.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + + + +

+Functions

template<typename T1 , typename T2 , int R, int C>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R, C > 
stan::math::subtract (const Eigen::Matrix< T1, R, C > &m1, const Eigen::Matrix< T2, R, C > &m2)
 Return the result of subtracting the second specified matrix from the first specified matrix.
 
template<typename T1 , typename T2 , int R, int C>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R, C > 
stan::math::subtract (const T1 &c, const Eigen::Matrix< T2, R, C > &m)
 
template<typename T1 , typename T2 , int R, int C>
Eigen::Matrix< typename
+boost::math::tools::promote_args
+< T1, T2 >::type, R, C > 
stan::math::subtract (const Eigen::Matrix< T1, R, C > &m, const T2 &c)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/subtract_8hpp_source.html b/doc/api/html/subtract_8hpp_source.html new file mode 100644 index 00000000000..617787b551e --- /dev/null +++ b/doc/api/html/subtract_8hpp_source.html @@ -0,0 +1,157 @@ + + + + + +Stan: src/stan/math/matrix/subtract.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
subtract.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__SUBTRACT_HPP__
+
2 #define __STAN__MATH__MATRIX__SUBTRACT_HPP__
+
3 
+
4 #include <boost/math/tools/promotion.hpp>
+ + +
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
24  template <typename T1, typename T2, int R, int C>
+
25  inline
+
26  Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type, R, C>
+
27  subtract(const Eigen::Matrix<T1,R,C>& m1,
+
28  const Eigen::Matrix<T2,R,C>& m2) {
+
29  stan::math::validate_matching_dims(m1,m2,"subtract");
+
30  Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type, R, C>
+
31  result(m1.rows(), m1.cols());
+
32  for (int i = 0; i < result.size(); ++i)
+
33  result(i) = m1(i) - m2(i);
+
34  return result;
+
35  }
+
36 
+
37  template <typename T1, typename T2, int R, int C>
+
38  inline
+
39  Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type, R, C>
+
40  subtract(const T1& c,
+
41  const Eigen::Matrix<T2,R,C>& m) {
+
42  Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type, R, C>
+
43  result(m.rows(),m.cols());
+
44  for (int i = 0; i < m.size(); ++i)
+
45  result(i) = c - m(i);
+
46  return result;
+
47  }
+
48 
+
49  template <typename T1, typename T2, int R, int C>
+
50  inline
+
51  Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type, R, C>
+
52  subtract(const Eigen::Matrix<T1,R,C>& m,
+
53  const T2& c) {
+
54  Eigen::Matrix<typename boost::math::tools::promote_args<T1,T2>::type, R, C>
+
55  result(m.rows(),m.cols());
+
56  for (int i = 0; i < m.size(); ++i)
+
57  result(i) = m(i) - c;
+
58  return result;
+
59  }
+
60 
+
61  }
+
62 }
+
63 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/sync_off.png b/doc/api/html/sync_off.png new file mode 100644 index 0000000000000000000000000000000000000000..3b443fc62892114406e3d399421b2a881b897acc GIT binary patch literal 853 zcmV-b1FHOqP)oT|#XixUYy%lpuf3i8{fX!o zUyDD0jOrAiT^tq>fLSOOABs-#u{dV^F$b{L9&!2=9&RmV;;8s^x&UqB$PCj4FdKbh zoB1WTskPUPu05XzFbA}=KZ-GP1fPpAfSs>6AHb12UlR%-i&uOlTpFNS7{jm@mkU1V zh`nrXr~+^lsV-s1dkZOaI|kYyVj3WBpPCY{n~yd%u%e+d=f%`N0FItMPtdgBb@py; zq@v6NVArhyTC7)ULw-Jy8y42S1~4n(3LkrW8mW(F-4oXUP3E`e#g**YyqI7h-J2zK zK{m9##m4ri!7N>CqQqCcnI3hqo1I;Yh&QLNY4T`*ptiQGozK>FF$!$+84Z`xwmeMh zJ0WT+OH$WYFALEaGj2_l+#DC3t7_S`vHpSivNeFbP6+r50cO8iu)`7i%Z4BTPh@_m3Tk!nAm^)5Bqnr%Ov|Baunj#&RPtRuK& z4RGz|D5HNrW83-#ydk}tVKJrNmyYt-sTxLGlJY5nc&Re zU4SgHNPx8~Yxwr$bsju?4q&%T1874xxzq+_%?h8_ofw~(bld=o3iC)LUNR*BY%c0y zWd_jX{Y8`l%z+ol1$@Qa?Cy!(0CVIEeYpKZ`(9{z>3$CIe;pJDQk$m3p}$>xBm4lb zKo{4S)`wdU9Ba9jJbVJ0C=SOefZe%d$8=2r={nu<_^a3~>c#t_U6dye5)JrR(_a^E f@}b6j1K9lwFJq@>o)+Ry00000NkvXXu0mjfWa5j* literal 0 HcmV?d00001 diff --git a/doc/api/html/sync_on.png b/doc/api/html/sync_on.png new file mode 100644 index 0000000000000000000000000000000000000000..e08320fb64e6fa33b573005ed6d8fe294e19db76 GIT binary patch literal 845 zcmV-T1G4;yP)Y;xxyHF2B5Wzm| zOOGupOTn@c(JmBOl)e;XMNnZuiTJP>rM8<|Q`7I_))aP?*T)ow&n59{}X4$3Goat zgjs?*aasfbrokzG5cT4K=uG`E14xZl@z)F={P0Y^?$4t z>v!teRnNZym<6h{7sLyF1V0HsfEl+l6TrZpsfr1}luH~F7L}ktXu|*uVX^RG$L0`K zWs3j|0tIvVe(N%_?2{(iCPFGf#B6Hjy6o&}D$A%W%jfO8_W%ZO#-mh}EM$LMn7joJ z05dHr!5Y92g+31l<%i1(=L1a1pXX+OYnalY>31V4K}BjyRe3)9n#;-cCVRD_IG1fT zOKGeNY8q;TL@K{dj@D^scf&VCs*-Jb>8b>|`b*osv52-!A?BpbYtTQBns5EAU**$m zSnVSm(teh>tQi*S*A>#ySc=n;`BHz`DuG4&g4Kf8lLhca+zvZ7t7RflD6-i-mcK=M z!=^P$*u2)bkY5asG4gsss!Hn%u~>}kIW`vMs%lJLH+u*9<4PaV_c6U`KqWXQH%+Nu zTv41O(^ZVi@qhjQdG!fbZw&y+2o!iYymO^?ud3{P*HdoX83YV*Uu_HB=?U&W9%AU# z80}k1SS-CXTU7dcQlsm<^oYLxVSseqY6NO}dc`Nj?8vrhNuCdm@^{a3AQ_>6myOj+ z`1RsLUXF|dm|3k7s2jD(B{rzE>WI2scH8i1;=O5Cc9xB3^aJk%fQjqsu+kH#0=_5a z0nCE8@dbQa-|YIuUVvG0L_IwHMEhOj$Mj4Uq05 X8=0q~qBNan00000NkvXXu0mjfptF>5 literal 0 HcmV?d00001 diff --git a/doc/api/html/tab_a.png b/doc/api/html/tab_a.png new file mode 100644 index 0000000000000000000000000000000000000000..3b725c41c5a527a3a3e40097077d0e206a681247 GIT binary patch literal 142 zcmeAS@N?(olHy`uVBq!ia0vp^j6kfy!2~3aiye;!QlXwMjv*C{Z|8b*H5dputLHD# z=<0|*y7z(Vor?d;H&?EG&cXR}?!j-Lm&u1OOI7AIF5&c)RFE;&p0MYK>*Kl@eiymD r@|NpwKX@^z+;{u_Z~trSBfrMKa%3`zocFjEXaR$#tDnm{r-UW|TZ1%4 literal 0 HcmV?d00001 diff --git a/doc/api/html/tab_b.png b/doc/api/html/tab_b.png new file mode 100644 index 0000000000000000000000000000000000000000..5f6601a813b57d522fb8e3d83a94db3c11bd004b GIT binary patch literal 170 zcmeAS@N?(olHy`uVBq!ia0vp^j6kfy!2~3aiye;!QiYx_jv*C{Z}0l@H8}{lJbb5j z@koWKnO@9+F40r>75L7yOy2aEZQj9IGhUePt6CX-V%z?=Md#j>u>9GS^hx`U_90)v zzY>Nv%(E01lyd(reV?ARTe9?0m9SvU>2o1dpM;m!GkCiCxvX=ZI-;YrdjIl`U`uzuDWSP?o#Dmo{%SgM#oan kX~E1%D-|#H#QbHoIja2U-MgvsK&LQxy85}Sb4q9e0Efg%P5=M^ literal 0 HcmV?d00001 diff --git a/doc/api/html/tabs.css b/doc/api/html/tabs.css new file mode 100644 index 00000000000..9cf578f23a1 --- /dev/null +++ b/doc/api/html/tabs.css @@ -0,0 +1,60 @@ +.tabs, .tabs2, .tabs3 { + background-image: url('tab_b.png'); + width: 100%; + z-index: 101; + font-size: 13px; + font-family: 'Lucida Grande',Geneva,Helvetica,Arial,sans-serif; +} + +.tabs2 { + font-size: 10px; +} +.tabs3 { + font-size: 9px; +} + +.tablist { + margin: 0; + padding: 0; + display: table; +} + +.tablist li { + float: left; + display: table-cell; + background-image: url('tab_b.png'); + line-height: 36px; + list-style: none; +} + +.tablist a { + display: block; + padding: 0 20px; + font-weight: bold; + background-image:url('tab_s.png'); + background-repeat:no-repeat; + background-position:right; + color: #283A5D; + text-shadow: 0px 1px 1px rgba(255, 255, 255, 0.9); + text-decoration: none; + outline: none; +} + +.tabs3 .tablist a { + padding: 0 10px; +} + +.tablist a:hover { + background-image: url('tab_h.png'); + background-repeat:repeat-x; + color: #fff; + text-shadow: 0px 1px 1px rgba(0, 0, 0, 1.0); + text-decoration: none; +} + +.tablist li.current a { + background-image: url('tab_a.png'); + background-repeat:repeat-x; + color: #fff; + text-shadow: 0px 1px 1px rgba(0, 0, 0, 1.0); +} diff --git a/doc/api/html/tail_8hpp.html b/doc/api/html/tail_8hpp.html new file mode 100644 index 00000000000..e8a2588de9a --- /dev/null +++ b/doc/api/html/tail_8hpp.html @@ -0,0 +1,143 @@ + + + + + +Stan: src/stan/math/matrix/tail.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
tail.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + + + + +

+Functions

template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
stan::math::tail (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &v, size_t n)
 Return the specified number of elements as a vector from the back of the specified vector.
 
template<typename T >
Eigen::Matrix< T,
+1, Eigen::Dynamic > 
stan::math::tail (const Eigen::Matrix< T, 1, Eigen::Dynamic > &rv, size_t n)
 Return the specified number of elements as a row vector from the back of the specified row vector.
 
template<typename T >
std::vector< T > stan::math::tail (const std::vector< T > &sv, size_t n)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/tail_8hpp_source.html b/doc/api/html/tail_8hpp_source.html new file mode 100644 index 00000000000..3284293bbe1 --- /dev/null +++ b/doc/api/html/tail_8hpp_source.html @@ -0,0 +1,156 @@ + + + + + +Stan: src/stan/math/matrix/tail.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
tail.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__TAIL_HPP__
+
2 #define __STAN__MATH__MATRIX__TAIL_HPP__
+
3 
+
4 #include <vector>
+ + + + +
9 
+
10 namespace stan {
+
11  namespace math {
+
12 
+
17  template <typename T>
+
18  inline
+
19  Eigen::Matrix<T,Eigen::Dynamic,1>
+
20  tail(const Eigen::Matrix<T,Eigen::Dynamic,1>& v,
+
21  size_t n) {
+
22  if (n != 0)
+
23  validate_row_index(v, v.size() - n + 1, "tail");
+
24  return v.tail(n);
+
25  }
+
26 
+
27 
+
32  template <typename T>
+
33  inline
+
34  Eigen::Matrix<T,1,Eigen::Dynamic>
+
35  tail(const Eigen::Matrix<T,1,Eigen::Dynamic>& rv,
+
36  size_t n) {
+
37  if (n != 0)
+
38  validate_column_index(rv, rv.size() - n + 1, "tail");
+
39  return rv.tail(n);
+
40  }
+
41 
+
42  template <typename T>
+
43  std::vector<T> tail(const std::vector<T>& sv,
+
44  size_t n) {
+
45  if (n != 0)
+
46  validate_std_vector_index(sv, sv.size() - n + 1, "tail");
+
47  std::vector<T> s;
+
48  for (typename std::vector<T>::size_type i = sv.size() - n; i < sv.size(); ++i)
+
49  s.push_back(sv[i]);
+
50  return s;
+
51  }
+
52 
+
53 
+
54  }
+
55 }
+
56 
+
57 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/term__grammar_8hpp.html b/doc/api/html/term__grammar_8hpp.html new file mode 100644 index 00000000000..a2d2391bed4 --- /dev/null +++ b/doc/api/html/term__grammar_8hpp.html @@ -0,0 +1,138 @@ + + + + + +Stan: src/stan/gm/grammars/term_grammar.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
term_grammar.hpp File Reference
+
+
+
#include <string>
+#include <sstream>
+#include <vector>
+#include <boost/spirit/include/qi.hpp>
+#include <stan/gm/ast.hpp>
+#include <stan/gm/grammars/whitespace_grammar.hpp>
+#include <stan/gm/grammars/expression_grammar.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Classes

struct  term_grammar< Iterator >
 
struct  stan::gm::expression_grammar< Iterator >
 
struct  stan::gm::term_grammar< Iterator >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/term__grammar_8hpp_source.html b/doc/api/html/term__grammar_8hpp_source.html new file mode 100644 index 00000000000..53297dc888e --- /dev/null +++ b/doc/api/html/term__grammar_8hpp_source.html @@ -0,0 +1,219 @@ + + + + + +Stan: src/stan/gm/grammars/term_grammar.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
term_grammar.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__PARSER__TERM_GRAMMAR__HPP__
+
2 #define __STAN__GM__PARSER__TERM_GRAMMAR__HPP__
+
3 
+
4 #include <string>
+
5 #include <sstream>
+
6 #include <vector>
+
7 
+
8 #include <boost/spirit/include/qi.hpp>
+
9 
+
10 #include <stan/gm/ast.hpp>
+ + +
13 
+
14 namespace stan {
+
15 
+
16  namespace gm {
+
17 
+
18  template <typename Iterator>
+
19  struct term_grammar;
+
20 
+
21  template <typename Iterator>
+
22  struct expression_grammar;
+
23 
+
24  template <typename Iterator>
+
25  struct term_grammar
+
26  : public boost::spirit::qi::grammar<Iterator,
+
27  expression(var_origin),
+
28  whitespace_grammar<Iterator> > {
+
29 
+
30  term_grammar(variable_map& var_map,
+
31  std::stringstream& error_msgs,
+ +
33 
+ +
35 
+
36  std::stringstream& error_msgs_;
+
37 
+ +
39 
+
40 
+
41  boost::spirit::qi::rule<Iterator,
+
42  std::vector<expression>(var_origin),
+ + +
45 
+
46 
+
47  boost::spirit::qi::rule<Iterator,
+
48  std::vector<expression>(var_origin),
+ + +
51 
+
52 
+
53  boost::spirit::qi::rule<Iterator,
+ + + +
57 
+
58 
+
59  boost::spirit::qi::rule<Iterator,
+
60  boost::spirit::qi::locals<bool>,
+ + + +
64 
+
65 
+
66  boost::spirit::qi::rule<Iterator,
+
67  fun(var_origin),
+ + +
70 
+
71 
+
72  boost::spirit::qi::rule<Iterator,
+
73  std::string(),
+ + +
76 
+
77 
+
78  boost::spirit::qi::rule<Iterator,
+ + + +
82 
+
83 
+
84  boost::spirit::qi::rule<Iterator,
+
85  int_literal(),
+ + +
88 
+
89 
+
90  boost::spirit::qi::rule<Iterator,
+ + + +
94 
+
95 
+
96  boost::spirit::qi::rule<Iterator,
+ + + +
100 
+
101 
+
102  boost::spirit::qi::rule<Iterator,
+
103  variable(),
+ + +
106 
+
107  };
+
108 
+
109  }
+
110 }
+
111 
+
112 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/term__grammar__def_8hpp.html b/doc/api/html/term__grammar__def_8hpp.html new file mode 100644 index 00000000000..b954ee74f0d --- /dev/null +++ b/doc/api/html/term__grammar__def_8hpp.html @@ -0,0 +1,378 @@ + + + + + +Stan: src/stan/gm/grammars/term_grammar_def.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
term_grammar_def.hpp File Reference
+
+
+
#include <cstddef>
+#include <iomanip>
+#include <iostream>
+#include <istream>
+#include <map>
+#include <set>
+#include <sstream>
+#include <string>
+#include <utility>
+#include <vector>
+#include <stdexcept>
+#include <boost/spirit/include/qi.hpp>
+#include <boost/spirit/include/phoenix_core.hpp>
+#include <boost/spirit/include/phoenix_function.hpp>
+#include <boost/spirit/include/phoenix_fusion.hpp>
+#include <boost/spirit/include/phoenix_object.hpp>
+#include <boost/spirit/include/phoenix_operator.hpp>
+#include <boost/spirit/include/phoenix_stl.hpp>
+#include <boost/lexical_cast.hpp>
+#include <boost/fusion/include/adapt_struct.hpp>
+#include <boost/fusion/include/std_pair.hpp>
+#include <boost/config/warning_disable.hpp>
+#include <boost/spirit/include/qi_numeric.hpp>
+#include <boost/spirit/include/classic_position_iterator.hpp>
+#include <boost/spirit/include/support_multi_pass.hpp>
+#include <boost/tuple/tuple.hpp>
+#include <boost/variant/apply_visitor.hpp>
+#include <boost/variant/recursive_variant.hpp>
+#include <stan/gm/ast.hpp>
+#include <stan/gm/grammars/whitespace_grammar.hpp>
+#include <stan/gm/grammars/term_grammar.hpp>
+#include <stan/gm/grammars/expression_grammar.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Classes

struct  stan::gm::set_fun_type
 
struct  stan::gm::set_fun_type::result< T1, T2 >
 
struct  stan::gm::set_fun_type_named
 
struct  stan::gm::set_fun_type_named::result< T1, T2, T3, T4 >
 
struct  stan::gm::multiplication_expr
 
struct  stan::gm::multiplication_expr::result< T1, T2, T3 >
 
struct  stan::gm::division_expr
 
struct  stan::gm::division_expr::result< T1, T2, T3 >
 
struct  stan::gm::left_division_expr
 
struct  stan::gm::left_division_expr::result< T1, T2, T3 >
 
struct  stan::gm::elt_multiplication_expr
 
struct  stan::gm::elt_multiplication_expr::result< T1, T2, T3 >
 
struct  stan::gm::elt_division_expr
 
struct  stan::gm::elt_division_expr::result< T1, T2, T3 >
 
struct  stan::gm::negate_expr
 
struct  stan::gm::negate_expr::result< T1, T2 >
 
struct  stan::gm::logical_negate_expr
 
struct  stan::gm::logical_negate_expr::result< T1, T2 >
 
struct  stan::gm::transpose_expr
 
struct  stan::gm::transpose_expr::result< T1, T2 >
 
struct  stan::gm::add_expression_dimss
 
struct  stan::gm::add_expression_dimss::result< T1, T2, T3, T4 >
 
struct  stan::gm::set_var_type
 
struct  stan::gm::set_var_type::result< T1, T2, T3, T4 >
 
struct  stan::gm::validate_int_expr3
 
struct  stan::gm::validate_int_expr3::result< T1, T2 >
 
struct  stan::gm::validate_expr_type
 
struct  stan::gm::validate_expr_type::result< T1, T2 >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+ + + + + + + + + + + +

+Functions

 BOOST_FUSION_ADAPT_STRUCT (stan::gm::index_op,(stan::gm::expression, expr_)(std::vector< std::vector< stan::gm::expression > >, dimss_))
 
 BOOST_FUSION_ADAPT_STRUCT (stan::gm::fun,(std::string, name_)(std::vector< stan::gm::expression >, args_))
 
 BOOST_FUSION_ADAPT_STRUCT (stan::gm::int_literal,(int, val_)(stan::gm::expr_type, type_))
 
 BOOST_FUSION_ADAPT_STRUCT (stan::gm::double_literal,(double, val_)(stan::gm::expr_type, type_))
 
void stan::gm::generate_expression (const expression &e, std::ostream &o)
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Variables

boost::phoenix::function
+< set_fun_type > 
stan::gm::set_fun_type_f
 
boost::phoenix::function
+< set_fun_type_named > 
stan::gm::set_fun_type_named_f
 
boost::phoenix::function
+< multiplication_expr > 
stan::gm::multiplication
 
boost::phoenix::function
+< division_expr > 
stan::gm::division
 
boost::phoenix::function
+< left_division_expr > 
stan::gm::left_division
 
boost::phoenix::function
+< elt_multiplication_expr > 
stan::gm::elt_multiplication
 
boost::phoenix::function
+< elt_division_expr > 
stan::gm::elt_division
 
boost::phoenix::function
+< negate_expr > 
stan::gm::negate_expr_f
 
boost::phoenix::function
+< logical_negate_expr > 
stan::gm::logical_negate_expr_f
 
boost::phoenix::function
+< transpose_expr > 
stan::gm::transpose_f
 
boost::phoenix::function
+< add_expression_dimss > 
stan::gm::add_expression_dimss_f
 
boost::phoenix::function
+< set_var_type > 
stan::gm::set_var_type_f
 
boost::phoenix::function
+< validate_int_expr3 > 
stan::gm::validate_int_expr3_f
 
boost::phoenix::function
+< validate_expr_type > 
stan::gm::validate_expr_type_f
 
+

Function Documentation

+ +
+
+ + + + + + + + + + + + + + + + + + +
BOOST_FUSION_ADAPT_STRUCT (stan::gm::index_op ,
(stan::gm::expression, expr_)(std::vector< std::vector< stan::gm::expression > >, dimss_)  
)
+
+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
BOOST_FUSION_ADAPT_STRUCT (stan::gm::fun ,
(std::string, name_)(std::vector< stan::gm::expression >, args_)  
)
+
+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
BOOST_FUSION_ADAPT_STRUCT (stan::gm::int_literal ,
(int, val_)(stan::gm::expr_type, type_)  
)
+
+ +
+
+ +
+
+ + + + + + + + + + + + + + + + + + +
BOOST_FUSION_ADAPT_STRUCT (stan::gm::double_literal ,
(double, val_)(stan::gm::expr_type, type_)  
)
+
+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/term__grammar__def_8hpp_source.html b/doc/api/html/term__grammar__def_8hpp_source.html new file mode 100644 index 00000000000..9ef285620ce --- /dev/null +++ b/doc/api/html/term__grammar__def_8hpp_source.html @@ -0,0 +1,672 @@ + + + + + +Stan: src/stan/gm/grammars/term_grammar_def.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
term_grammar_def.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__PARSER__TERM_GRAMMAR_DEF__HPP__
+
2 #define __STAN__GM__PARSER__TERM_GRAMMAR_DEF__HPP__
+
3 
+
4 #include <cstddef>
+
5 #include <iomanip>
+
6 #include <iostream>
+
7 #include <istream>
+
8 #include <map>
+
9 #include <set>
+
10 #include <sstream>
+
11 #include <string>
+
12 #include <utility>
+
13 #include <vector>
+
14 #include <stdexcept>
+
15 
+
16 #include <boost/spirit/include/qi.hpp>
+
17 // FIXME: get rid of unused include
+
18 #include <boost/spirit/include/phoenix_core.hpp>
+
19 #include <boost/spirit/include/phoenix_function.hpp>
+
20 #include <boost/spirit/include/phoenix_fusion.hpp>
+
21 #include <boost/spirit/include/phoenix_object.hpp>
+
22 #include <boost/spirit/include/phoenix_operator.hpp>
+
23 #include <boost/spirit/include/phoenix_stl.hpp>
+
24 
+
25 #include <boost/lexical_cast.hpp>
+
26 #include <boost/fusion/include/adapt_struct.hpp>
+
27 #include <boost/fusion/include/std_pair.hpp>
+
28 #include <boost/config/warning_disable.hpp>
+
29 #include <boost/spirit/include/qi.hpp>
+
30 #include <boost/spirit/include/qi_numeric.hpp>
+
31 #include <boost/spirit/include/classic_position_iterator.hpp>
+
32 #include <boost/spirit/include/phoenix_core.hpp>
+
33 #include <boost/spirit/include/phoenix_function.hpp>
+
34 #include <boost/spirit/include/phoenix_fusion.hpp>
+
35 #include <boost/spirit/include/phoenix_object.hpp>
+
36 #include <boost/spirit/include/phoenix_operator.hpp>
+
37 #include <boost/spirit/include/phoenix_stl.hpp>
+
38 #include <boost/spirit/include/support_multi_pass.hpp>
+
39 #include <boost/tuple/tuple.hpp>
+
40 #include <boost/variant/apply_visitor.hpp>
+
41 #include <boost/variant/recursive_variant.hpp>
+
42 
+
43 #include <stan/gm/ast.hpp>
+ + + +
47 
+ +
49  (stan::gm::expression, expr_)
+
50  (std::vector<std::vector<stan::gm::expression> >,
+
51  dimss_) );
+
52 
+ +
54  (std::string, name_)
+
55  (std::vector<stan::gm::expression>, args_) );
+
56 
+ +
58  (int,val_)
+
59  (stan::gm::expr_type,type_));
+
60 
+ +
62  (double,val_)
+
63  (stan::gm::expr_type,type_) );
+
64 
+
65 
+
66 
+
67 
+
68 namespace stan {
+
69 
+
70  namespace gm {
+
71 
+
72 
+
73  struct set_fun_type {
+
74  template <typename T1, typename T2>
+
75  struct result { typedef fun type; };
+
76 
+ +
78  std::ostream& error_msgs) const {
+
79  std::vector<expr_type> arg_types;
+
80  for (size_t i = 0; i < fun.args_.size(); ++i)
+
81  arg_types.push_back(fun.args_[i].expression_type());
+ +
83  arg_types,
+
84  error_msgs);
+
85  return fun;
+
86  }
+
87  };
+
88  boost::phoenix::function<set_fun_type> set_fun_type_f;
+
89 
+
90 
+ +
92  template <typename T1, typename T2, typename T3, typename T4>
+
93  struct result { typedef fun type; };
+
94 
+ +
96  const var_origin& var_origin,
+
97  bool& pass,
+
98  std::ostream& error_msgs) const {
+
99  std::vector<expr_type> arg_types;
+
100  for (size_t i = 0; i < fun.args_.size(); ++i)
+
101  arg_types.push_back(fun.args_[i].expression_type());
+ +
103  arg_types,
+
104  error_msgs);
+
105 
+
106  pass = !has_rng_suffix(fun.name_) || var_origin == derived_origin;
+
107  if (fun.name_ == "abs"
+
108  && fun.args_[0].expression_type().is_primitive_double()) {
+
109  error_msgs << "Warning: Function abs(real) is deprecated."
+
110  << std::endl
+
111  << " It will be removed in a future release."
+
112  << std::endl
+
113  << " Use fabs(real) instead."
+
114  << std::endl << std::endl;
+
115  }
+
116 
+
117 
+
118  if (!pass) {
+
119  error_msgs << "random number generators only allowed in generated quantities block"
+
120  << "; found function=" << fun.name_
+
121  << " in block=";
+
122  print_var_origin(error_msgs,var_origin);
+
123  error_msgs << std::endl;
+
124  }
+
125 
+
126  return fun;
+
127  }
+
128  };
+
129  boost::phoenix::function<set_fun_type_named> set_fun_type_named_f;
+
130 
+
131 
+
132 
+ +
134  template <typename T1, typename T2, typename T3>
+
135  struct result { typedef expression type; };
+
136 
+ +
138  const expression& expr2,
+
139  std::ostream& error_msgs) const {
+
140 
+
141  if (expr1.expression_type().is_primitive()
+
142  && expr2.expression_type().is_primitive()) {
+
143  return expr1 *= expr2;
+
144  }
+
145  std::vector<expression> args;
+
146  args.push_back(expr1);
+
147  args.push_back(expr2);
+
148  set_fun_type sft;
+
149  fun f("multiply",args);
+
150  sft(f,error_msgs);
+
151  return expression(f);
+
152  }
+
153  };
+
154  boost::phoenix::function<multiplication_expr> multiplication;
+
155 
+
156  void generate_expression(const expression& e, std::ostream& o);
+
157 
+
158  struct division_expr {
+
159  template <typename T1, typename T2, typename T3>
+
160  struct result { typedef expression type; };
+
161 
+ +
163  const expression& expr2,
+
164  std::ostream& error_msgs) const {
+
165  if (expr1.expression_type().is_primitive_int()
+
166  && expr2.expression_type().is_primitive_int()) {
+
167  // getting here, but not printing? only print error if problems?
+
168  error_msgs << "Warning: integer division implicitly rounds to integer."
+
169  << " Found int division: ";
+
170  generate_expression(expr1.expr_,error_msgs);
+
171  error_msgs << " / ";
+
172  generate_expression(expr2.expr_,error_msgs);
+
173  error_msgs << std::endl
+
174  << " Positive values rounded down, negative values rounded up or down"
+
175  << " in platform-dependent way."
+
176  << std::endl;
+
177  }
+
178 
+
179  if (expr1.expression_type().is_primitive()
+
180  && expr2.expression_type().is_primitive()) {
+
181  return expr1 /= expr2;
+
182  }
+
183  std::vector<expression> args;
+
184  args.push_back(expr1);
+
185  args.push_back(expr2);
+
186  set_fun_type sft;
+
187  if ((expr1.expression_type().type() == MATRIX_T
+
188  || expr1.expression_type().type() == ROW_VECTOR_T)
+
189  && expr2.expression_type().type() == MATRIX_T) {
+
190  fun f("mdivide_right",args);
+
191  sft(f,error_msgs);
+
192  return expression(f);
+
193  }
+
194 
+
195  fun f("divide",args);
+
196  sft(f,error_msgs);
+
197  return expression(f);
+
198  }
+
199  };
+
200  boost::phoenix::function<division_expr> division;
+
201 
+ +
203  template <typename T1, typename T2, typename T3>
+
204  struct result { typedef expression type; };
+
205 
+ +
207  const expression& expr2,
+
208  std::ostream& error_msgs) const {
+
209  if (expr1.expression_type().is_primitive()
+
210  && expr2.expression_type().is_primitive()) {
+
211  return expr1 /= expr2;
+
212  }
+
213  std::vector<expression> args;
+
214  args.push_back(expr1);
+
215  args.push_back(expr2);
+
216  set_fun_type sft;
+
217  if (expr1.expression_type().type() == MATRIX_T
+
218  && (expr2.expression_type().type() == VECTOR_T
+
219  || expr2.expression_type().type() == MATRIX_T)) {
+
220  fun f("mdivide_left",args);
+
221  sft(f,error_msgs);
+
222  return expression(f);
+
223  }
+
224  fun f("divide_left",args); // this doesn't exist, so will
+
225  // throw error on purpose
+
226  sft(f,error_msgs);
+
227  return expression(f);
+
228  }
+
229  };
+
230  boost::phoenix::function<left_division_expr> left_division;
+
231 
+ +
233  template <typename T1, typename T2, typename T3>
+
234  struct result { typedef expression type; };
+
235 
+ +
237  const expression& expr2,
+
238  std::ostream& error_msgs) const {
+
239 
+
240  if (expr1.expression_type().is_primitive()
+
241  && expr2.expression_type().is_primitive()) {
+
242  return expr1 *= expr2;
+
243  }
+
244  std::vector<expression> args;
+
245  args.push_back(expr1);
+
246  args.push_back(expr2);
+
247  set_fun_type sft;
+
248  fun f("elt_multiply",args);
+
249  sft(f,error_msgs);
+
250  return expression(f);
+
251  return expr1 += expr2;
+
252  }
+
253  };
+
254  boost::phoenix::function<elt_multiplication_expr> elt_multiplication;
+
255 
+ +
257  template <typename T1, typename T2, typename T3>
+
258  struct result { typedef expression type; };
+
259 
+ +
261  const expression& expr2,
+
262  std::ostream& error_msgs) const {
+
263 
+
264  if (expr1.expression_type().is_primitive()
+
265  && expr2.expression_type().is_primitive()) {
+
266  return expr1 /= expr2;
+
267  }
+
268  std::vector<expression> args;
+
269  args.push_back(expr1);
+
270  args.push_back(expr2);
+
271  set_fun_type sft;
+
272  fun f("elt_divide",args);
+
273  sft(f,error_msgs);
+
274  return expression(f);
+
275  return expr1 += expr2;
+
276  }
+
277  };
+
278  boost::phoenix::function<elt_division_expr> elt_division;
+
279 
+
280  // Cut-and-Paste from Spirit examples, including comment: We
+
281  // should be using expression::operator-. There's a bug in phoenix
+
282  // type deduction mechanism that prevents us from doing
+
283  // so. Phoenix will be switching to BOOST_TYPEOF. In the meantime,
+
284  // we will use a phoenix::function below:
+
285  struct negate_expr {
+
286  template <typename T1, typename T2>
+
287  struct result { typedef expression type; };
+
288 
+ +
290  std::ostream& error_msgs) const {
+
291  if (expr.expression_type().is_primitive()) {
+
292  return expression(unary_op('-', expr));
+
293  }
+
294  std::vector<expression> args;
+
295  args.push_back(expr);
+
296  set_fun_type sft;
+
297  fun f("minus",args);
+
298  sft(f,error_msgs);
+
299  return expression(f);
+
300  }
+
301  };
+
302  boost::phoenix::function<negate_expr> negate_expr_f;
+
303 
+ +
305  template <typename T1, typename T2>
+
306  struct result { typedef expression type; };
+
307 
+ +
309  std::ostream& error_msgs) const {
+
310  if (!expr.expression_type().is_primitive()) {
+
311  error_msgs << "logical negation operator ! only applies to int or real types; ";
+
312  return expression();
+
313  }
+
314  std::vector<expression> args;
+
315  args.push_back(expr);
+
316  set_fun_type sft;
+
317  fun f("logical_negation",args);
+
318  sft(f,error_msgs);
+
319  return expression(f);
+
320  }
+
321  };
+
322  boost::phoenix::function<logical_negate_expr> logical_negate_expr_f;
+
323 
+
324  struct transpose_expr {
+
325  template <typename T1, typename T2>
+
326  struct result { typedef expression type; };
+
327 
+ +
329  std::ostream& error_msgs) const {
+
330  if (expr.expression_type().is_primitive()) {
+
331  return expr; // transpose of basic is self -- works?
+
332  }
+
333  std::vector<expression> args;
+
334  args.push_back(expr);
+
335  set_fun_type sft;
+
336  fun f("transpose",args);
+
337  sft(f,error_msgs);
+
338  return expression(f);
+
339  }
+
340  };
+
341  boost::phoenix::function<transpose_expr> transpose_f;
+
342 
+ +
344  template <typename T1, typename T2, typename T3, typename T4>
+
345  struct result { typedef T1 type; };
+ +
347  std::vector<std::vector<stan::gm::expression> >& dimss,
+
348  bool& pass,
+
349  std::ostream& error_msgs) const {
+
350  index_op iop(expression,dimss);
+
351  iop.infer_type();
+
352  if (iop.type_.is_ill_formed()) {
+
353  error_msgs << "indexes inappropriate for expression." << std::endl;
+
354  pass = false;
+
355  } else {
+
356  pass = true;
+
357  }
+
358  return iop;
+
359  }
+
360  };
+
361  boost::phoenix::function<add_expression_dimss> add_expression_dimss_f;
+
362 
+
363  struct set_var_type {
+
364  template <typename T1, typename T2, typename T3, typename T4>
+
365  struct result { typedef variable type; };
+ +
367  variable_map& vm,
+
368  std::ostream& error_msgs,
+
369  bool& pass) const {
+
370  std::string name = var_expr.name_;
+
371  if (!vm.exists(name)) {
+
372  pass = false;
+
373  error_msgs << "variable \"" << name << '"' << " does not exist."
+
374  << std::endl;
+
375  return var_expr;
+
376  }
+
377  if (name == std::string("lp__")) {
+
378  error_msgs << std::endl
+
379  << "WARNING:"
+
380  << std::endl
+
381  << " Direct use of variable lp__ is deprecated and will be removed in a future release."
+
382  << std::endl
+
383  << " Please use increment_log_prob(u) in place of of lp__ <- lp__ + u."
+
384  << std::endl;
+
385  }
+
386  pass = true;
+
387  var_expr.set_type(vm.get_base_type(name),vm.get_num_dims(name));
+
388  return var_expr;
+
389  }
+
390  };
+
391  boost::phoenix::function<set_var_type> set_var_type_f;
+
392 
+ +
394  template <typename T1, typename T2>
+
395  struct result { typedef bool type; };
+
396 
+
397  bool operator()(const expression& expr,
+
398  std::stringstream& error_msgs) const {
+
399  if (!expr.expression_type().is_primitive_int()) {
+
400  error_msgs << "expression denoting integer required; found type="
+
401  << expr.expression_type() << std::endl;
+
402  return false;
+
403  }
+
404  return true;
+
405  }
+
406  };
+
407  boost::phoenix::function<validate_int_expr3> validate_int_expr3_f;
+
408 
+
409 
+ +
411  template <typename T1, typename T2>
+
412  struct result { typedef bool type; };
+
413 
+
414  bool operator()(const expression& expr,
+
415  std::ostream& error_msgs) const {
+
416  if (expr.expression_type().is_ill_formed()) {
+
417  error_msgs << "expression is ill formed" << std::endl;
+
418  return false;
+
419  }
+
420  return true;
+
421  }
+
422  };
+
423  boost::phoenix::function<validate_expr_type> validate_expr_type_f;
+
424 
+
425 
+
426 
+
427 
+
428 
+
429  template <typename Iterator>
+ +
431  std::stringstream& error_msgs,
+ +
433  : term_grammar::base_type(term_r),
+
434  var_map_(var_map),
+
435  error_msgs_(error_msgs),
+
436  expression_g(eg)
+
437  {
+
438  using boost::spirit::qi::_1;
+
439  using boost::spirit::qi::char_;
+
440  using boost::spirit::qi::double_;
+
441  using boost::spirit::qi::eps;
+
442  using boost::spirit::qi::int_;
+
443  using boost::spirit::qi::lexeme;
+
444  using boost::spirit::qi::lit;
+
445  using boost::spirit::qi::_pass;
+
446  using boost::spirit::qi::_val;
+
447  using boost::spirit::qi::labels::_r1;
+
448 
+
449  // _r1 : var_origin
+
450 
+
451  term_r.name("term");
+
452  term_r
+
453  = ( negated_factor_r(_r1)
+
454  [_val = _1]
+
455  >> *( (lit('*') > negated_factor_r(_r1)
+
456  [_val = multiplication(_val,_1,
+
457  boost::phoenix::ref(error_msgs_))])
+
458  | (lit('/') > negated_factor_r(_r1)
+
459  [_val = division(_val,_1,boost::phoenix::ref(error_msgs_))])
+
460  | (lit('\\') > negated_factor_r(_r1)
+
461  [_val = left_division(_val,_1,
+
462  boost::phoenix::ref(error_msgs_))])
+
463  | (lit(".*") > negated_factor_r(_r1)
+
464  [_val = elt_multiplication(_val,_1,
+
465  boost::phoenix::ref(error_msgs_))])
+
466  | (lit("./") > negated_factor_r(_r1)
+
467  [_val = elt_division(_val,_1,
+
468  boost::phoenix::ref(error_msgs_))])
+
469  )
+
470  )
+
471  ;
+
472 
+
473 
+ +
475  = lit('-') >> negated_factor_r(_r1)
+
476  [_val = negate_expr_f(_1,boost::phoenix::ref(error_msgs_))]
+
477  | lit('!') >> negated_factor_r(_r1)
+
478  [_val = logical_negate_expr_f(_1,boost::phoenix::ref(error_msgs_))]
+
479  | lit('+') >> negated_factor_r(_r1) [_val = _1]
+
480  | indexed_factor_r(_r1) [_val = _1];
+
481 
+
482 
+
483  indexed_factor_r.name("(optionally) indexed factor [sub]");
+ +
485  = factor_r(_r1) [_val = _1]
+
486  > * (
+
487  (+dims_r(_r1))
+
488  [_val = add_expression_dimss_f(_val, _1, _pass,
+
489  boost::phoenix::ref(error_msgs_))]
+
490  |
+
491  lit("'")
+
492  [_val = transpose_f(_val, boost::phoenix::ref(error_msgs_))]
+
493  )
+
494  ;
+
495 
+
496 
+
497  factor_r.name("factor");
+
498  factor_r
+
499  = int_literal_r [_val = _1]
+
500  | double_literal_r [_val = _1]
+
501  | fun_r(_r1) [_val = set_fun_type_named_f(_1,_r1,_pass,boost::phoenix::ref(error_msgs_))]
+
502  | variable_r [_val = set_var_type_f(_1,boost::phoenix::ref(var_map_),
+
503  boost::phoenix::ref(error_msgs_),
+
504  _pass)]
+
505  | ( lit('(')
+
506  > expression_g(_r1) [_val = _1]
+
507  > lit(')') )
+
508  ;
+
509 
+
510  int_literal_r.name("integer literal");
+ +
512  %= int_
+
513  >> !( lit('.')
+
514  | lit('e')
+
515  | lit('E') );
+
516 
+
517 
+
518  double_literal_r.name("real literal");
+ +
520  %= double_;
+
521 
+
522 
+
523  fun_r.name("function and argument expressions");
+
524  fun_r
+
525  %= identifier_r // no test yet on valid naming
+
526  >> args_r(_r1);
+
527 
+
528 
+
529  identifier_r.name("identifier (expression grammar)");
+ +
531  %= lexeme[char_("a-zA-Z")
+
532  >> *char_("a-zA-Z0-9_.")];
+
533 
+
534 
+
535  args_r.name("function argument expressions");
+
536  args_r
+
537  %= (lit('(') >> lit(')'))
+
538  | ( ( lit('(')
+
539  >> (expression_g(_r1) % ',') )
+
540  > lit(')') )
+
541  ;
+
542 
+
543 
+
544  dims_r.name("array dimensions");
+
545  dims_r
+
546  %= lit('[')
+
547  > (expression_g(_r1)
+
548  [_pass = validate_int_expr3_f(_1,boost::phoenix::ref(error_msgs_))]
+
549  % ',')
+
550  > lit(']')
+
551  ;
+
552 
+
553 
+
554  variable_r.name("variable expression");
+
555  variable_r
+
556  %= identifier_r
+
557  > !lit('('); // negative lookahead to prevent failure in
+
558  // fun to try to evaluate as variable [cleaner
+
559  // error msgs]
+
560 
+
561  }
+
562  }
+
563 }
+
564 
+
565 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/term__grammar__inst_8cpp.html b/doc/api/html/term__grammar__inst_8cpp.html new file mode 100644 index 00000000000..48f365705c1 --- /dev/null +++ b/doc/api/html/term__grammar__inst_8cpp.html @@ -0,0 +1,123 @@ + + + + + +Stan: src/stan/gm/grammars/term_grammar_inst.cpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
term_grammar_inst.cpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/term__grammar__inst_8cpp_source.html b/doc/api/html/term__grammar__inst_8cpp_source.html new file mode 100644 index 00000000000..2f6a47e3ed5 --- /dev/null +++ b/doc/api/html/term__grammar__inst_8cpp_source.html @@ -0,0 +1,115 @@ + + + + + +Stan: src/stan/gm/grammars/term_grammar_inst.cpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
term_grammar_inst.cpp
+
+
+Go to the documentation of this file.
+ +
3 
+
4 namespace stan {
+
5  namespace gm {
+
6  template struct term_grammar<pos_iterator_t>;
+
7  }
+
8 }
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/to__fvar_8hpp.html b/doc/api/html/to__fvar_8hpp.html new file mode 100644 index 00000000000..bdabc58a3fe --- /dev/null +++ b/doc/api/html/to__fvar_8hpp.html @@ -0,0 +1,170 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/to_fvar.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
to_fvar.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

template<typename T >
fvar< T > stan::agrad::to_fvar (const T &x)
 
template<typename T >
fvar< T > stan::agrad::to_fvar (const fvar< T > &x)
 
matrix_fd stan::agrad::to_fvar (const stan::math::matrix_d &m)
 
matrix_fd stan::agrad::to_fvar (const matrix_fd &m)
 
matrix_fv stan::agrad::to_fvar (const matrix_fv &m)
 
matrix_ffd stan::agrad::to_fvar (const matrix_ffd &m)
 
matrix_ffv stan::agrad::to_fvar (const matrix_ffv &m)
 
vector_fd stan::agrad::to_fvar (const stan::math::vector_d &v)
 
vector_fd stan::agrad::to_fvar (const vector_fd &v)
 
vector_fv stan::agrad::to_fvar (const vector_fv &v)
 
vector_ffd stan::agrad::to_fvar (const vector_ffd &v)
 
vector_ffv stan::agrad::to_fvar (const vector_ffv &v)
 
row_vector_fd stan::agrad::to_fvar (const stan::math::row_vector_d &rv)
 
row_vector_fd stan::agrad::to_fvar (const row_vector_fd &rv)
 
row_vector_fv stan::agrad::to_fvar (const row_vector_fv &rv)
 
row_vector_ffd stan::agrad::to_fvar (const row_vector_ffd &rv)
 
row_vector_ffv stan::agrad::to_fvar (const row_vector_ffv &rv)
 
template<typename T , int R, int C>
Eigen::Matrix< fvar< T >, R, C > stan::agrad::to_fvar (const Eigen::Matrix< T, R, C > &val, const Eigen::Matrix< T, R, C > &deriv)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/to__fvar_8hpp_source.html b/doc/api/html/to__fvar_8hpp_source.html new file mode 100644 index 00000000000..f7ab36a0817 --- /dev/null +++ b/doc/api/html/to__fvar_8hpp_source.html @@ -0,0 +1,252 @@ + + + + + +Stan: src/stan/agrad/fwd/matrix/to_fvar.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
to_fvar.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__FWD__MATRIX__TO_FVAR_HPP__
+
2 #define __STAN__AGRAD__FWD__MATRIX__TO_FVAR_HPP__
+
3 
+
4 #include <vector>
+ + + + + +
10 
+
11 namespace stan {
+
12  namespace agrad {
+
13 
+
14  template<typename T>
+
15  inline
+
16  fvar<T>
+
17  to_fvar(const T& x) {
+
18  return fvar<T>(x);
+
19  }
+
20 
+
21  template<typename T>
+
22  inline
+
23  fvar<T>
+
24  to_fvar(const fvar<T>& x) {
+
25  return x;
+
26  }
+
27 
+
28  inline
+
29  matrix_fd
+ +
31  matrix_fd m_v(m.rows(), m.cols());
+
32  for (int j = 0; j < m.cols(); ++j)
+
33  for (int i = 0; i < m.rows(); ++i)
+
34  m_v(i,j) = m(i,j);
+
35  return m_v;
+
36  }
+
37 
+
38  inline
+
39  matrix_fd
+
40  to_fvar(const matrix_fd& m) {
+
41  return m;
+
42  }
+
43 
+
44  inline
+
45  matrix_fv
+
46  to_fvar(const matrix_fv& m) {
+
47  return m;
+
48  }
+
49 
+
50  inline
+ +
52  to_fvar(const matrix_ffd& m) {
+
53  return m;
+
54  }
+
55 
+
56  inline
+
57  matrix_ffv
+
58  to_fvar(const matrix_ffv& m) {
+
59  return m;
+
60  }
+
61 
+
62  inline
+
63  vector_fd
+ +
65  vector_fd v_v(v.size());
+
66  for (int i = 0; i < v.size(); ++i)
+
67  v_v[i] = v[i];
+
68  return v_v;
+
69  }
+
70 
+
71  inline
+
72  vector_fd
+
73  to_fvar(const vector_fd& v) {
+
74  return v;
+
75  }
+
76 
+
77  inline
+
78  vector_fv
+
79  to_fvar(const vector_fv& v) {
+
80  return v;
+
81  }
+
82 
+
83  inline
+ +
85  to_fvar(const vector_ffd& v) {
+
86  return v;
+
87  }
+
88 
+
89  inline
+
90  vector_ffv
+
91  to_fvar(const vector_ffv& v) {
+
92  return v;
+
93  }
+
94 
+
95  inline
+ + +
98  row_vector_fd rv_v(rv.size());
+
99  for (int i = 0; i < rv.size(); ++i)
+
100  rv_v[i] = rv[i];
+
101  return rv_v;
+
102  }
+
103 
+
104  inline
+ +
106  to_fvar(const row_vector_fd& rv) {
+
107  return rv;
+
108  }
+
109 
+
110  inline
+ +
112  to_fvar(const row_vector_fv& rv) {
+
113  return rv;
+
114  }
+
115 
+
116  inline
+ +
118  to_fvar(const row_vector_ffd& rv) {
+
119  return rv;
+
120  }
+
121 
+
122  inline
+ +
124  to_fvar(const row_vector_ffv& rv) {
+
125  return rv;
+
126  }
+
127 
+
128  template<typename T, int R, int C>
+
129  inline
+
130  Eigen::Matrix<fvar<T>, R, C>
+
131  to_fvar(const Eigen::Matrix<T,R,C>& val,
+
132  const Eigen::Matrix<T,R,C>& deriv) {
+
133  stan::math::validate_matching_dims(val,deriv, "to_fvar");
+
134  Eigen::Matrix<fvar<T>,R,C> ret(val.rows(), val.cols());
+
135  for(size_type i = 0; i < val.rows(); i++) {
+
136  for(size_type j = 0; j < val.cols(); j++) {
+
137  ret(i,j).val_ = val(i,j);
+
138  ret(i,j).d_ = deriv(i,j);
+
139  }
+
140  }
+
141  return ret;
+
142  }
+
143  }
+
144 }
+
145 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/to__var_8hpp.html b/doc/api/html/to__var_8hpp.html new file mode 100644 index 00000000000..3f4aa89ecb7 --- /dev/null +++ b/doc/api/html/to__var_8hpp.html @@ -0,0 +1,154 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/to_var.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
to_var.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

var stan::agrad::to_var (const double &x)
 Converts argument to an automatic differentiation variable.
 
var stan::agrad::to_var (const var &x)
 Converts argument to an automatic differentiation variable.
 
matrix_v stan::agrad::to_var (const stan::math::matrix_d &m)
 Converts argument to an automatic differentiation variable.
 
matrix_v stan::agrad::to_var (const matrix_v &m)
 Converts argument to an automatic differentiation variable.
 
vector_v stan::agrad::to_var (const stan::math::vector_d &v)
 Converts argument to an automatic differentiation variable.
 
vector_v stan::agrad::to_var (const vector_v &v)
 Converts argument to an automatic differentiation variable.
 
row_vector_v stan::agrad::to_var (const stan::math::row_vector_d &rv)
 Converts argument to an automatic differentiation variable.
 
row_vector_v stan::agrad::to_var (const row_vector_v &rv)
 Converts argument to an automatic differentiation variable.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/to__var_8hpp_source.html b/doc/api/html/to__var_8hpp_source.html new file mode 100644 index 00000000000..6f5b5a0efd5 --- /dev/null +++ b/doc/api/html/to__var_8hpp_source.html @@ -0,0 +1,157 @@ + + + + + +Stan: src/stan/agrad/rev/matrix/to_var.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
to_var.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__MATRIX__TO_VAR_HPP__
+
2 #define __STAN__AGRAD__REV__MATRIX__TO_VAR_HPP__
+
3 
+
4 #include <vector>
+ + +
7 #include <stan/agrad/rev/var.hpp>
+ +
9 
+
10 namespace stan {
+
11  namespace agrad {
+
12 
+
21  inline var to_var(const double& x) {
+
22  return var(x);
+
23  }
+
32  inline var to_var(const var& x) {
+
33  return x;
+
34  }
+ +
44  matrix_v m_v(m.rows(), m.cols());
+
45  for (int j = 0; j < m.cols(); ++j)
+
46  for (int i = 0; i < m.rows(); ++i)
+
47  m_v(i,j) = m(i,j);
+
48  return m_v;
+
49  }
+
58  inline matrix_v to_var(const matrix_v& m) {
+
59  return m;
+
60  }
+ +
71  vector_v v_v(v.size());
+
72  for (int i = 0; i < v.size(); ++i)
+
73  v_v[i] = v[i];
+
74  return v_v;
+
75  }
+
85  inline vector_v to_var(const vector_v& v) {
+
86  return v;
+
87  }
+ +
98  row_vector_v rv_v(rv.size());
+
99  for (int i = 0; i < rv.size(); ++i)
+
100  rv_v[i] = rv[i];
+
101  return rv_v;
+
102  }
+
112  inline row_vector_v to_var(const row_vector_v& rv) {
+
113  return rv;
+
114  }
+
115 
+
116  }
+
117 }
+
118 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/to__vector_8hpp.html b/doc/api/html/to__vector_8hpp.html new file mode 100644 index 00000000000..aaf2e3028b1 --- /dev/null +++ b/doc/api/html/to__vector_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/matrix/to_vector.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
to_vector.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T , int R1, int R2>
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
stan::math::to_vector (const Eigen::Matrix< T, R1, R2 > &m)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/to__vector_8hpp_source.html b/doc/api/html/to__vector_8hpp_source.html new file mode 100644 index 00000000000..7e4da8e6df5 --- /dev/null +++ b/doc/api/html/to__vector_8hpp_source.html @@ -0,0 +1,125 @@ + + + + + +Stan: src/stan/math/matrix/to_vector.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
to_vector.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__TO_VECTOR_HPP__
+
2 #define __STAN__MATH__MATRIX__TO_VECTOR_HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
9  template <typename T, int R1, int R2>
+
10  inline
+
11  Eigen::Matrix<T,Eigen::Dynamic,1>
+
12  to_vector(const Eigen::Matrix<T,R1,R2>& m) {
+
13  return Eigen::Matrix<T,Eigen::Dynamic,1>::Map(m.data(), m.rows()*m.cols());
+
14  }
+
15 
+
16  }
+
17 }
+
18 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/trace_8hpp.html b/doc/api/html/trace_8hpp.html new file mode 100644 index 00000000000..78b3a6b1643 --- /dev/null +++ b/doc/api/html/trace_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/matrix/trace.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
trace.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + +

+Functions

template<typename T >
stan::math::trace (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &m)
 Returns the trace of the specified matrix.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/trace_8hpp_source.html b/doc/api/html/trace_8hpp_source.html new file mode 100644 index 00000000000..1439df819b9 --- /dev/null +++ b/doc/api/html/trace_8hpp_source.html @@ -0,0 +1,123 @@ + + + + + +Stan: src/stan/math/matrix/trace.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
trace.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__TRACE_HPP__
+
2 #define __STAN__MATH__MATRIX__TRACE_HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
18  template <typename T>
+
19  inline T trace(const Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& m) {
+
20  return m.trace();
+
21  }
+
22 
+
23  }
+
24 }
+
25 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/transform_8hpp.html b/doc/api/html/transform_8hpp.html new file mode 100644 index 00000000000..4262253e948 --- /dev/null +++ b/doc/api/html/transform_8hpp.html @@ -0,0 +1,403 @@ + + + + + +Stan: src/stan/prob/transform.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
transform.hpp File Reference
+
+
+
#include <cmath>
+#include <cstddef>
+#include <limits>
+#include <stdexcept>
+#include <sstream>
+#include <vector>
+#include <boost/multi_array.hpp>
+#include <boost/throw_exception.hpp>
+#include <boost/math/tools/promotion.hpp>
+#include <stan/agrad/rev/matrix.hpp>
+#include <stan/math.hpp>
+#include <stan/math/matrix.hpp>
+#include <stan/math/matrix/sum.hpp>
+#include <stan/math/matrix/validate_less.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/math/matrix_error_handling.hpp>
+#include <stan/math/matrix/multiply_lower_tri_self_transpose.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

template<typename T >
bool stan::prob::factor_cov_matrix (Eigen::Array< T, Eigen::Dynamic, 1 > &CPCs, Eigen::Array< T, Eigen::Dynamic, 1 > &sds, const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &Sigma)
 This function is intended to make starting values, given a covariance matrix Sigma.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
stan::prob::read_corr_L (const Eigen::Array< T, Eigen::Dynamic, 1 > &CPCs, const size_t K)
 Return the Cholesky factor of the correlation matrix of the specified dimensionality corresponding to the specified canonical partial correlations.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
stan::prob::read_corr_matrix (const Eigen::Array< T, Eigen::Dynamic, 1 > &CPCs, const size_t K)
 Return the correlation matrix of the specified dimensionality corresponding to the specified canonical partial correlations.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
stan::prob::read_corr_L (const Eigen::Array< T, Eigen::Dynamic, 1 > &CPCs, const size_t K, T &log_prob)
 Return the Cholesky factor of the correlation matrix of the specified dimensionality corresponding to the specified canonical partial correlations, incrementing the specified scalar reference with the log absolute determinant of the Jacobian of the transformation.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
stan::prob::read_corr_matrix (const Eigen::Array< T, Eigen::Dynamic, 1 > &CPCs, const size_t K, T &log_prob)
 Return the correlation matrix of the specified dimensionality corresponding to the specified canonical partial correlations, incrementing the specified scalar reference with the log absolute determinant of the Jacobian of the transformation.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
stan::prob::read_cov_L (const Eigen::Array< T, Eigen::Dynamic, 1 > &CPCs, const Eigen::Array< T, Eigen::Dynamic, 1 > &sds, T &log_prob)
 This is the function that should be called prior to evaluating the density of any elliptical distribution.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
stan::prob::read_cov_matrix (const Eigen::Array< T, Eigen::Dynamic, 1 > &CPCs, const Eigen::Array< T, Eigen::Dynamic, 1 > &sds, T &log_prob)
 A generally worse alternative to call prior to evaluating the density of an elliptical distribution.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
stan::prob::read_cov_matrix (const Eigen::Array< T, Eigen::Dynamic, 1 > &CPCs, const Eigen::Array< T, Eigen::Dynamic, 1 > &sds)
 Builds a covariance matrix from CPCs and standard deviations.
 
template<typename T >
const Eigen::Array< T,
+Eigen::Dynamic, 1 > 
stan::prob::make_nu (const T eta, const size_t K)
 This function calculates the degrees of freedom for the t distribution that corresponds to the shape parameter in the Lewandowski et.
 
template<typename T >
stan::prob::identity_constrain (T x)
 Returns the result of applying the identity constraint transform to the input.
 
template<typename T >
stan::prob::identity_constrain (const T x, T &)
 Returns the result of applying the identity constraint transform to the input and increments the log probability reference with the log absolute Jacobian determinant.
 
template<typename T >
stan::prob::identity_free (const T y)
 Returns the result of applying the inverse of the identity constraint transform to the input.
 
template<typename T >
stan::prob::positive_constrain (const T x)
 Return the positive value for the specified unconstrained input.
 
template<typename T >
stan::prob::positive_constrain (const T x, T &lp)
 Return the positive value for the specified unconstrained input, incrementing the scalar reference with the log absolute Jacobian determinant.
 
template<typename T >
stan::prob::positive_free (const T y)
 Return the unconstrained value corresponding to the specified positive-constrained value.
 
template<typename T , typename TL >
stan::prob::lb_constrain (const T x, const TL lb)
 Return the lower-bounded value for the specified unconstrained input and specified lower bound.
 
template<typename T , typename TL >
boost::math::tools::promote_args
+< T, TL >::type 
stan::prob::lb_constrain (const T x, const TL lb, T &lp)
 Return the lower-bounded value for the speicifed unconstrained input and specified lower bound, incrementing the specified reference with the log absolute Jacobian determinant of the transform.
 
template<typename T , typename TL >
boost::math::tools::promote_args
+< T, TL >::type 
stan::prob::lb_free (const T y, const TL lb)
 Return the unconstrained value that produces the specified lower-bound constrained value.
 
template<typename T , typename TU >
boost::math::tools::promote_args
+< T, TU >::type 
stan::prob::ub_constrain (const T x, const TU ub)
 Return the upper-bounded value for the specified unconstrained scalar and upper bound.
 
template<typename T , typename TU >
boost::math::tools::promote_args
+< T, TU >::type 
stan::prob::ub_constrain (const T x, const TU ub, T &lp)
 Return the upper-bounded value for the specified unconstrained scalar and upper bound and increment the specified log probability reference with the log absolute Jacobian determinant of the transform.
 
template<typename T , typename TU >
boost::math::tools::promote_args
+< T, TU >::type 
stan::prob::ub_free (const T y, const TU ub)
 Return the free scalar that corresponds to the specified upper-bounded value with respect to the specified upper bound.
 
template<typename T , typename TL , typename TU >
boost::math::tools::promote_args
+< T, TL, TU >::type 
stan::prob::lub_constrain (const T x, TL lb, TU ub)
 Return the lower- and upper-bounded scalar derived by transforming the specified free scalar given the specified lower and upper bounds.
 
template<typename T , typename TL , typename TU >
boost::math::tools::promote_args
+< T, TL, TU >::type 
stan::prob::lub_constrain (const T x, const TL lb, const TU ub, T &lp)
 Return the lower- and upper-bounded scalar derived by transforming the specified free scalar given the specified lower and upper bounds and increment the specified log probability with the log absolute Jacobian determinant.
 
template<typename T , typename TL , typename TU >
boost::math::tools::promote_args
+< T, TL, TU >::type 
stan::prob::lub_free (const T y, TL lb, TU ub)
 Return the unconstrained scalar that transforms to the specified lower- and upper-bounded scalar given the specified bounds.
 
template<typename T >
stan::prob::prob_constrain (const T x)
 Return a probability value constrained to fall between 0 and 1 (inclusive) for the specified free scalar.
 
template<typename T >
stan::prob::prob_constrain (const T x, T &lp)
 Return a probability value constrained to fall between 0 and 1 (inclusive) for the specified free scalar and increment the specified log probability reference with the log absolute Jacobian determinant of the transform.
 
template<typename T >
stan::prob::prob_free (const T y)
 Return the free scalar that when transformed to a probability produces the specified scalar.
 
template<typename T >
stan::prob::corr_constrain (const T x)
 Return the result of transforming the specified scalar to have a valid correlation value between -1 and 1 (inclusive).
 
template<typename T >
stan::prob::corr_constrain (const T x, T &lp)
 Return the result of transforming the specified scalar to have a valid correlation value between -1 and 1 (inclusive).
 
template<typename T >
stan::prob::corr_free (const T y)
 Return the unconstrained scalar that when transformed to a valid correlation produces the specified value.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
stan::prob::unit_vector_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &y)
 Return the unit length vector corresponding to the free vector y.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
stan::prob::unit_vector_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &y, T &lp)
 Return the unit length vector corresponding to the free vector y.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
stan::prob::unit_vector_free (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x)
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
stan::prob::simplex_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &y)
 Return the simplex corresponding to the specified free vector.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
stan::prob::simplex_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &y, T &lp)
 Return the simplex corresponding to the specified free vector and increment the specified log probability reference with the log absolute Jacobian determinant of the transform.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
stan::prob::simplex_free (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x)
 Return an unconstrained vector that when transformed produces the specified simplex.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
stan::prob::ordered_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x)
 Return an increasing ordered vector derived from the specified free vector.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
stan::prob::ordered_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, T &lp)
 Return a positive valued, increasing ordered vector derived from the specified free vector and increment the specified log probability reference with the log absolute Jacobian determinant of the transform.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
stan::prob::ordered_free (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &y)
 Return the vector of unconstrained scalars that transform to the specified positive ordered vector.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
stan::prob::positive_ordered_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x)
 Return an increasing positive ordered vector derived from the specified free vector.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
stan::prob::positive_ordered_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, T &lp)
 Return a positive valued, increasing positive ordered vector derived from the specified free vector and increment the specified log probability reference with the log absolute Jacobian determinant of the transform.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
stan::prob::positive_ordered_free (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &y)
 Return the vector of unconstrained scalars that transform to the specified positive ordered vector.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
stan::prob::cholesky_factor_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, int M, int N)
 Return the Cholesky factor of the specified size read from the specified vector.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
stan::prob::cholesky_factor_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, int M, int N, T &lp)
 Return the Cholesky factor of the specified size read from the specified vector and increment the specified log probability reference with the log Jacobian adjustment of the transform.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
stan::prob::cholesky_factor_free (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y)
 Return the unconstrained vector of parameters correspdonding to the specified Cholesky factor.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
stan::prob::corr_matrix_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, typename Eigen::Matrix< T, Eigen::Dynamic, 1 >::size_type k)
 Return the correlation matrix of the specified dimensionality derived from the specified vector of unconstrained values.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
stan::prob::corr_matrix_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, typename Eigen::Matrix< T, Eigen::Dynamic, 1 >::size_type k, T &lp)
 Return the correlation matrix of the specified dimensionality derived from the specified vector of unconstrained values.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
stan::prob::corr_matrix_free (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y)
 Return the vector of unconstrained partial correlations that define the specified correlation matrix when transformed.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
stan::prob::cov_matrix_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, typename Eigen::Matrix< T, Eigen::Dynamic, 1 >::size_type K)
 Return the symmetric, positive-definite matrix of dimensions K by K resulting from transforming the specified finite vector of size K plus (K choose 2).
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
stan::prob::cov_matrix_constrain (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, typename Eigen::Matrix< T, Eigen::Dynamic, 1 >::size_type K, T &lp)
 Return the symmetric, positive-definite matrix of dimensions K by K resulting from transforming the specified finite vector of size K plus (K choose 2).
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
stan::prob::cov_matrix_free (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y)
 The covariance matrix derived from the symmetric view of the lower-triangular view of the K by K specified matrix is freed to return a vector of size K + (K choose 2).
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
stan::prob::cov_matrix_constrain_lkj (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, size_t k)
 Return the covariance matrix of the specified dimensionality derived from constraining the specified vector of unconstrained values.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, Eigen::Dynamic > 
stan::prob::cov_matrix_constrain_lkj (const Eigen::Matrix< T, Eigen::Dynamic, 1 > &x, size_t k, T &lp)
 Return the covariance matrix of the specified dimensionality derived from constraining the specified vector of unconstrained values and increment the specified log probability reference with the log absolute Jacobian determinant.
 
template<typename T >
Eigen::Matrix< T,
+Eigen::Dynamic, 1 > 
stan::prob::cov_matrix_free_lkj (const Eigen::Matrix< T, Eigen::Dynamic, Eigen::Dynamic > &y)
 Return the vector of unconstrained partial correlations and deviations that transform to the specified covariance matrix.
 
+ + + +

+Variables

const double stan::prob::CONSTRAINT_TOLERANCE = 1E-8
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/transform_8hpp_source.html b/doc/api/html/transform_8hpp_source.html new file mode 100644 index 00000000000..d9dffd60c8b --- /dev/null +++ b/doc/api/html/transform_8hpp_source.html @@ -0,0 +1,1073 @@ + + + + + +Stan: src/stan/prob/transform.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
transform.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__TRANSFORM_HPP__
+
2 #define __STAN__PROB__TRANSFORM_HPP__
+
3 
+
4 #include <cmath>
+
5 #include <cstddef>
+
6 #include <limits>
+
7 #include <stdexcept>
+
8 #include <sstream>
+
9 #include <vector>
+
10 #include <boost/multi_array.hpp>
+
11 #include <boost/throw_exception.hpp>
+
12 #include <boost/math/tools/promotion.hpp>
+ +
14 #include <stan/math.hpp>
+
15 #include <stan/math/matrix.hpp>
+
16 #include <stan/math/matrix/sum.hpp>
+ + + +
20 
+ +
22 
+
23 namespace stan {
+
24 
+
25  namespace prob {
+
26 
+
27 
+
28  const double CONSTRAINT_TOLERANCE = 1E-8;
+
29 
+
30 
+
43  template<typename T>
+
44  bool
+
45  factor_cov_matrix(Eigen::Array<T,Eigen::Dynamic,1>& CPCs,
+
46  Eigen::Array<T,Eigen::Dynamic,1>& sds,
+
47  const Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& Sigma) {
+
48 
+
49  size_t K = sds.rows();
+
50 
+
51  sds = Sigma.diagonal().array();
+
52  if( (sds <= 0.0).any() ) return false;
+
53  sds = sds.sqrt();
+
54 
+
55  Eigen::DiagonalMatrix<T,Eigen::Dynamic> D(K);
+
56  D.diagonal() = sds.inverse();
+
57  sds = sds.log(); // now unbounded
+
58 
+
59  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> R = D * Sigma * D;
+
60  // to hopefully prevent pivoting due to floating point error
+
61  R.diagonal().setOnes();
+
62  Eigen::LDLT<Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> > ldlt;
+
63  ldlt = R.ldlt();
+
64  if (!ldlt.isPositive())
+
65  return false;
+
66  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> U = ldlt.matrixU();
+
67 
+
68  size_t position = 0;
+
69  size_t pull = K - 1;
+
70 
+
71  Eigen::Array<T,1,Eigen::Dynamic> temp = U.row(0).tail(pull);
+
72 
+
73  CPCs.head(pull) = temp;
+
74 
+
75  Eigen::Array<T,Eigen::Dynamic,1> acc(K);
+
76  acc(0) = -0.0;
+
77  acc.tail(pull) = 1.0 - temp.square();
+
78  for(size_t i = 1; i < (K - 1); i++) {
+
79  position += pull;
+
80  pull--;
+
81  temp = U.row(i).tail(pull);
+
82  temp /= sqrt(acc.tail(pull) / acc(i));
+
83  CPCs.segment(position, pull) = temp;
+
84  acc.tail(pull) *= 1.0 - temp.square();
+
85  }
+
86  CPCs = 0.5 * ( (1.0 + CPCs) / (1.0 - CPCs) ).log(); // now unbounded
+
87  return true;
+
88  }
+
89 
+
90  // MATRIX TRANSFORMS +/- JACOBIANS
+
91 
+
113  template <typename T>
+
114  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>
+
115  read_corr_L(const Eigen::Array<T,Eigen::Dynamic,1>& CPCs, // on (-1,1)
+
116  const size_t K) {
+
117  Eigen::Array<T,Eigen::Dynamic,1> temp;
+
118  Eigen::Array<T,Eigen::Dynamic,1> acc(K-1);
+
119  acc.setOnes();
+
120  // Cholesky factor of correlation matrix
+
121  Eigen::Array<T,Eigen::Dynamic,Eigen::Dynamic> L(K,K);
+
122  L.setZero();
+
123 
+
124  size_t position = 0;
+
125  size_t pull = K - 1;
+
126 
+
127  L(0,0) = 1.0;
+
128  L.col(0).tail(pull) = temp = CPCs.head(pull);
+
129  acc.tail(pull) = 1.0 - temp.square();
+
130  for(size_t i = 1; i < (K - 1); i++) {
+
131  position += pull;
+
132  pull--;
+
133  temp = CPCs.segment(position, pull);
+
134  L(i,i) = sqrt(acc(i-1));
+
135  L.col(i).tail(pull) = temp * acc.tail(pull).sqrt();
+
136  acc.tail(pull) *= 1.0 - temp.square();
+
137  }
+
138  L(K-1,K-1) = sqrt(acc(K-2));
+
139  return L.matrix();
+
140  }
+
141 
+
155  template <typename T>
+
156  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>
+
157  read_corr_matrix(const Eigen::Array<T,Eigen::Dynamic,1>& CPCs,
+
158  const size_t K) {
+
159  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> L
+
160  = read_corr_L(CPCs, K);
+ + +
163  }
+
164 
+
191  template <typename T>
+
192  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>
+
193  read_corr_L(const Eigen::Array<T,Eigen::Dynamic,1>& CPCs,
+
194  const size_t K,
+
195  T& log_prob) {
+
196 
+
197  size_t k = 0;
+
198  size_t i = 0;
+
199  T log_1cpc2;
+
200  double lead = K - 2.0;
+
201  // no need to abs() because this Jacobian determinant
+
202  // is strictly positive (and triangular)
+
203  // skip last row (odd indexing) because it adds nothing by design
+ +
205  for (size_type j = 0;
+
206  j < (CPCs.rows() - 1);
+
207  ++j) {
+
208  using stan::math::log1m;
+
209  using stan::math::square;
+
210  log_1cpc2 = log1m(square(CPCs[j]));
+
211  // derivative of correlation wrt CPC
+
212  log_prob += lead / 2.0 * log_1cpc2;
+
213  i++;
+
214  if (i > K) {
+
215  k++;
+
216  i = k + 1;
+
217  lead = K - k - 1.0;
+
218  }
+
219  }
+
220  return read_corr_L(CPCs, K);
+
221  }
+
222 
+
241  template <typename T>
+
242  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>
+
243  read_corr_matrix(const Eigen::Array<T,Eigen::Dynamic,1>& CPCs,
+
244  const size_t K,
+
245  T& log_prob) {
+
246 
+
247  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> L
+
248  = read_corr_L(CPCs, K, log_prob);
+ + +
251  }
+
252 
+
263  template <typename T>
+
264  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>
+
265  read_cov_L(const Eigen::Array<T,Eigen::Dynamic,1>& CPCs,
+
266  const Eigen::Array<T,Eigen::Dynamic,1>& sds,
+
267  T& log_prob) {
+
268  size_t K = sds.rows();
+
269  // adjust due to transformation from correlations to covariances
+
270  log_prob += (sds.log().sum() + stan::math::LOG_2) * K;
+
271  return sds.matrix().asDiagonal() * read_corr_L(CPCs, K, log_prob);
+
272  }
+
273 
+
283  template <typename T>
+
284  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>
+
285  read_cov_matrix(const Eigen::Array<T,Eigen::Dynamic,1>& CPCs,
+
286  const Eigen::Array<T,Eigen::Dynamic,1>& sds,
+
287  T& log_prob) {
+
288 
+
289  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> L
+
290  = read_cov_L(CPCs, sds, log_prob);
+ + +
293  }
+
294 
+
302  template<typename T>
+
303  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>
+
304  read_cov_matrix(const Eigen::Array<T,Eigen::Dynamic,1>& CPCs,
+
305  const Eigen::Array<T,Eigen::Dynamic,1>& sds) {
+
306 
+
307  size_t K = sds.rows();
+
308  Eigen::DiagonalMatrix<T,Eigen::Dynamic> D(K);
+
309  D.diagonal() = sds;
+
310  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> L
+
311  = D * read_corr_L(CPCs, K);
+ + +
314  }
+
315 
+
316 
+
326  template<typename T>
+
327  const Eigen::Array<T,Eigen::Dynamic,1>
+
328  make_nu(const T eta, const size_t K) {
+
329 
+
330  Eigen::Array<T,Eigen::Dynamic,1> nu(K * (K - 1) / 2);
+
331 
+
332  T alpha = eta + (K - 2.0) / 2.0; // from Lewandowski et. al.
+
333 
+
334  // Best (1978) implies nu = 2 * alpha for the dof in a t
+
335  // distribution that generates a beta variate on (-1,1)
+
336  T alpha2 = 2.0 * alpha;
+
337 
+ +
339  for (size_type j = 0; j < (K - 1); j++) {
+
340  nu(j) = alpha2;
+
341  }
+
342  size_t counter = K - 1;
+
343  for (size_type i = 1; i < (K - 1); i++) {
+
344  alpha -= 0.5;
+
345  alpha2 = 2.0 * alpha;
+
346  for (size_type j = i + 1; j < K; j++) {
+
347  nu(counter) = alpha2;
+
348  counter++;
+
349  }
+
350  }
+
351  return nu;
+
352  }
+
353 
+
354 
+
355 
+
356 
+
357  // IDENTITY
+
358 
+
371  template <typename T>
+
372  inline
+ +
374  return x;
+
375  }
+
376 
+
390  template <typename T>
+
391  inline
+
392  T identity_constrain(const T x, T& /*lp*/) {
+
393  return x;
+
394  }
+
395 
+
407  template <typename T>
+
408  inline
+
409  T identity_free(const T y) {
+
410  return y;
+
411  }
+
412 
+
413 
+
414  // POSITIVE
+
415 
+
426  template <typename T>
+
427  inline
+
428  T positive_constrain(const T x) {
+
429  return exp(x);
+
430  }
+
431 
+
448  template <typename T>
+
449  inline
+
450  T positive_constrain(const T x, T& lp) {
+
451  lp += x;
+
452  return exp(x);
+
453  }
+
454 
+
471  template <typename T>
+
472  inline
+
473  T positive_free(const T y) {
+
474  stan::math::check_positive("stan::prob::positive_free(%1%)", y, "Positive variable");
+
475  return log(y);
+
476  }
+
477 
+
478  // LOWER BOUND
+
479 
+
499  template <typename T, typename TL>
+
500  inline
+
501  T lb_constrain(const T x, const TL lb) {
+
502  if (lb == -std::numeric_limits<double>::infinity())
+
503  return identity_constrain(x);
+
504  return exp(x) + lb;
+
505  }
+
506 
+
523  template <typename T, typename TL>
+
524  inline
+
525  typename boost::math::tools::promote_args<T,TL>::type
+
526  lb_constrain(const T x, const TL lb, T& lp) {
+
527  if (lb == -std::numeric_limits<double>::infinity())
+
528  return identity_constrain(x,lp);
+
529  lp += x;
+
530  return exp(x) + lb;
+
531  }
+
532 
+
548  template <typename T, typename TL>
+
549  inline
+
550  typename boost::math::tools::promote_args<T,TL>::type
+
551  lb_free(const T y, const TL lb) {
+
552  if (lb == -std::numeric_limits<double>::infinity())
+
553  return identity_free(y);
+
554  stan::math::check_greater_or_equal("stan::prob::lb_free(%1%)",
+
555  y, lb, "Lower bounded variable");
+
556  return log(y - lb);
+
557  }
+
558 
+
559 
+
560  // UPPER BOUND
+
561 
+
581  template <typename T, typename TU>
+
582  inline
+
583  typename boost::math::tools::promote_args<T,TU>::type
+
584  ub_constrain(const T x, const TU ub) {
+
585  if (ub == std::numeric_limits<double>::infinity())
+
586  return identity_constrain(x);
+
587  return ub - exp(x);
+
588  }
+
589 
+
613  template <typename T, typename TU>
+
614  inline
+
615  typename boost::math::tools::promote_args<T,TU>::type
+
616  ub_constrain(const T x, const TU ub, T& lp) {
+
617  if (ub == std::numeric_limits<double>::infinity())
+
618  return identity_constrain(x,lp);
+
619  lp += x;
+
620  return ub - exp(x);
+
621  }
+
622 
+
645  template <typename T, typename TU>
+
646  inline
+
647  typename boost::math::tools::promote_args<T,TU>::type
+
648  ub_free(const T y, const TU ub) {
+
649  if (ub == std::numeric_limits<double>::infinity())
+
650  return identity_free(y);
+
651  stan::math::check_less_or_equal("stan::prob::ub_free(%1%)",
+
652  y, ub, "Upper bounded variable");
+
653  return log(ub - y);
+
654  }
+
655 
+
656 
+
657  // LOWER & UPPER BOUNDS
+
658 
+
686  template <typename T, typename TL, typename TU>
+
687  inline
+
688  typename boost::math::tools::promote_args<T,TL,TU>::type
+
689  lub_constrain(const T x, TL lb, TU ub) {
+
690  stan::math::validate_less(lb,ub,"lb","ub","lub_constrain/3");
+
691 
+
692  if (lb == -std::numeric_limits<double>::infinity())
+
693  return ub_constrain(x,ub);
+
694  if (ub == std::numeric_limits<double>::infinity())
+
695  return lb_constrain(x,lb);
+
696 
+
697  T inv_logit_x;
+
698  if (x > 0) {
+
699  T exp_minus_x = exp(-x);
+
700  inv_logit_x = 1.0 / (1.0 + exp_minus_x);
+
701  // Prevent x from reaching one unless it really really should.
+
702  if ((x < std::numeric_limits<double>::infinity())
+
703  && (inv_logit_x == 1))
+
704  inv_logit_x = 1 - 1e-15;
+
705  } else {
+
706  T exp_x = exp(x);
+
707  inv_logit_x = 1.0 - 1.0 / (1.0 + exp_x);
+
708  // Prevent x from reaching zero unless it really really should.
+
709  if ((x > -std::numeric_limits<double>::infinity())
+
710  && (inv_logit_x== 0))
+
711  inv_logit_x = 1e-15;
+
712  }
+
713  return lb + (ub - lb) * inv_logit_x;
+
714  }
+
715 
+
757  template <typename T, typename TL, typename TU>
+
758  typename boost::math::tools::promote_args<T,TL,TU>::type
+
759  lub_constrain(const T x, const TL lb, const TU ub, T& lp) {
+
760  if (!(lb < ub)) {
+
761  std::stringstream s;
+
762  s << "domain error in lub_constrain; lower bound = " << lb
+
763  << " must be strictly less than upper bound = " << ub;
+
764  throw std::domain_error(s.str());
+
765  }
+
766  if (lb == -std::numeric_limits<double>::infinity())
+
767  return ub_constrain(x,ub,lp);
+
768  if (ub == std::numeric_limits<double>::infinity())
+
769  return lb_constrain(x,lb,lp);
+
770  T inv_logit_x;
+
771  if (x > 0) {
+
772  T exp_minus_x = exp(-x);
+
773  inv_logit_x = 1.0 / (1.0 + exp_minus_x);
+
774  lp += log(ub - lb) - x - 2 * log1p(exp_minus_x);
+
775  // Prevent x from reaching one unless it really really should.
+
776  if ((x < std::numeric_limits<double>::infinity())
+
777  && (inv_logit_x == 1))
+
778  inv_logit_x = 1 - 1e-15;
+
779  } else {
+
780  T exp_x = exp(x);
+
781  inv_logit_x = 1.0 - 1.0 / (1.0 + exp_x);
+
782  lp += log(ub - lb) + x - 2 * log1p(exp_x);
+
783  // Prevent x from reaching zero unless it really really should.
+
784  if ((x > -std::numeric_limits<double>::infinity())
+
785  && (inv_logit_x== 0))
+
786  inv_logit_x = 1e-15;
+
787  }
+
788  return lb + (ub - lb) * inv_logit_x;
+
789  }
+
790 
+
821  template <typename T, typename TL, typename TU>
+
822  inline
+
823  typename boost::math::tools::promote_args<T,TL,TU>::type
+
824  lub_free(const T y, TL lb, TU ub) {
+
825  using stan::math::logit;
+
826  stan::math::check_bounded("stan::prob::lub_free(%1%)",
+
827  y, lb, ub, "Bounded variable");
+
828  if (lb == -std::numeric_limits<double>::infinity())
+
829  return ub_free(y,ub);
+
830  if (ub == std::numeric_limits<double>::infinity())
+
831  return lb_free(y,lb);
+
832  return logit((y - lb) / (ub - lb));
+
833  }
+
834 
+
835 
+
836  // PROBABILITY
+
837 
+
851  template <typename T>
+
852  inline
+
853  T prob_constrain(const T x) {
+
854  using stan::math::inv_logit;
+
855  return inv_logit(x);
+
856  }
+
857 
+
879  template <typename T>
+
880  inline
+
881  T prob_constrain(const T x, T& lp) {
+
882  using stan::math::inv_logit;
+
883  using stan::math::log1m;
+
884  T inv_logit_x = inv_logit(x);
+
885  lp += log(inv_logit_x) + log1m(inv_logit_x);
+
886  return inv_logit_x;
+
887  }
+
888 
+
903  template <typename T>
+
904  inline
+
905  T prob_free(const T y) {
+
906  using stan::math::logit;
+
907  stan::math::check_bounded("stan::prob::prob_free(%1%)",
+
908  y, 0, 1, "Probability variable");
+
909  return logit(y);
+
910  }
+
911 
+
912 
+
913  // CORRELATION
+
914 
+
927  template <typename T>
+
928  inline
+
929  T corr_constrain(const T x) {
+
930  return tanh(x);
+
931  }
+
932 
+
945  template <typename T>
+
946  inline
+
947  T corr_constrain(const T x, T& lp) {
+
948  using stan::math::log1m;
+
949  T tanh_x = tanh(x);
+
950  lp += log1m(tanh_x * tanh_x);
+
951  return tanh_x;
+
952  }
+
953 
+
970  template <typename T>
+
971  inline
+
972  T corr_free(const T y) {
+
973  stan::math::check_bounded("stan::prob::lub_free(%1%)",
+
974  y, -1, 1, "Correlation variable");
+
975  return atanh(y);
+
976  }
+
977 
+
978 
+
979  // Unit vector
+
980 
+
989  template <typename T>
+
990  Eigen::Matrix<T,Eigen::Dynamic,1>
+
991  unit_vector_constrain(const Eigen::Matrix<T,Eigen::Dynamic,1>& y) {
+ +
993  int Km1 = y.size();
+
994  Eigen::Matrix<T,Eigen::Dynamic,1> x(Km1 + 1);
+
995  x(0) = 1.0;
+
996  const T half_pi = T(M_PI/2.0);
+
997  for (size_type k = 1; k <= Km1; ++k) {
+
998  T yk_1 = y(k-1) + half_pi;
+
999  T sin_yk_1 = sin(yk_1);
+
1000  x(k) = x(k-1)*sin_yk_1;
+
1001  x(k-1) *= cos(yk_1);
+
1002  }
+
1003  return x;
+
1004  }
+
1005 
+
1015  template <typename T>
+
1016  Eigen::Matrix<T,Eigen::Dynamic,1>
+
1017  unit_vector_constrain(const Eigen::Matrix<T,Eigen::Dynamic,1>& y, T &lp) {
+ +
1019  int Km1 = y.size();
+
1020  Eigen::Matrix<T,Eigen::Dynamic,1> x(Km1 + 1);
+
1021  x(0) = 1.0;
+
1022  const T half_pi = T(M_PI/2.0);
+
1023  for (size_type k = 1; k <= Km1; ++k) {
+
1024  T yk_1 = y(k-1) + half_pi;
+
1025  T sin_yk_1 = sin(yk_1);
+
1026  x(k) = x(k-1)*sin_yk_1;
+
1027  x(k-1) *= cos(yk_1);
+
1028  if (k < Km1)
+
1029  lp += (Km1 - k)*log(fabs(sin_yk_1));
+
1030  }
+
1031  return x;
+
1032  }
+
1033 
+
1034  template <typename T>
+
1035  Eigen::Matrix<T,Eigen::Dynamic,1>
+
1036  unit_vector_free(const Eigen::Matrix<T,Eigen::Dynamic,1>& x) {
+ +
1038  stan::math::check_unit_vector("stan::prob::unit_vector_free(%1%)", x, "Unit vector variable");
+
1039  int Km1 = x.size() - 1;
+
1040  Eigen::Matrix<T,Eigen::Dynamic,1> y(Km1);
+
1041  T sumSq = x(Km1)*x(Km1);
+
1042  const T half_pi = T(M_PI/2.0);
+
1043  for (size_type k = Km1; --k >= 0; ) {
+
1044  y(k) = atan2(sqrt(sumSq),x(k)) - half_pi;
+
1045  sumSq += x(k)*x(k);
+
1046  }
+
1047  return y;
+
1048  }
+
1049 
+
1050  // SIMPLEX
+
1051 
+
1052 
+
1065  template <typename T>
+
1066  Eigen::Matrix<T,Eigen::Dynamic,1>
+
1067  simplex_constrain(const Eigen::Matrix<T,Eigen::Dynamic,1>& y) {
+
1068  // cut & paste simplex_constrain(Eigen::Matrix,T) w/o Jacobian
+ +
1070  using stan::math::logit;
+
1071  using stan::math::inv_logit;
+
1072  using stan::math::log1m;
+
1073  int Km1 = y.size();
+
1074  Eigen::Matrix<T,Eigen::Dynamic,1> x(Km1 + 1);
+
1075  T stick_len(1.0);
+
1076  for (size_type k = 0; k < Km1; ++k) {
+
1077  T z_k(inv_logit(y(k) - log(Km1 - k)));
+
1078  x(k) = stick_len * z_k;
+
1079  stick_len -= x(k);
+
1080  }
+
1081  x(Km1) = stick_len;
+
1082  return x;
+
1083  }
+
1084 
+
1098  template <typename T>
+
1099  Eigen::Matrix<T,Eigen::Dynamic,1>
+
1100  simplex_constrain(const Eigen::Matrix<T,Eigen::Dynamic,1>& y,
+
1101  T& lp) {
+
1102  using stan::math::logit;
+
1103  using stan::math::inv_logit;
+
1104  using stan::math::log1p_exp;
+
1105  using stan::math::log1m;
+ +
1107  int Km1 = y.size(); // K = Km1 + 1
+
1108  Eigen::Matrix<T,Eigen::Dynamic,1> x(Km1 + 1);
+
1109  T stick_len(1.0);
+
1110  for (size_type k = 0; k < Km1; ++k) {
+
1111  double eq_share = -log(Km1 - k); // = logit(1.0/(Km1 + 1 - k));
+
1112  T adj_y_k(y(k) + eq_share);
+
1113  T z_k(inv_logit(adj_y_k));
+
1114  x(k) = stick_len * z_k;
+
1115  lp += log(stick_len);
+
1116  lp -= log1p_exp(-adj_y_k);
+
1117  lp -= log1p_exp(adj_y_k);
+
1118  stick_len -= x(k); // equivalently *= (1 - z_k);
+
1119  }
+
1120  x(Km1) = stick_len; // no Jacobian contrib for last dim
+
1121  return x;
+
1122  }
+
1123 
+
1138  template <typename T>
+
1139  Eigen::Matrix<T,Eigen::Dynamic,1>
+
1140  simplex_free(const Eigen::Matrix<T,Eigen::Dynamic,1>& x) {
+
1141  using stan::math::logit;
+ +
1143  stan::math::check_simplex("stan::prob::simplex_free(%1%)", x, "Simplex variable");
+
1144  int Km1 = x.size() - 1;
+
1145  Eigen::Matrix<T,Eigen::Dynamic,1> y(Km1);
+
1146  T stick_len(x(Km1));
+
1147  for (size_type k = Km1; --k >= 0; ) {
+
1148  stick_len += x(k);
+
1149  T z_k(x(k) / stick_len);
+
1150  y(k) = logit(z_k) + log(Km1 - k);
+
1151  // log(Km-k) = logit(1.0 / (Km1 + 1 - k));
+
1152  }
+
1153  return y;
+
1154  }
+
1155 
+
1156 
+
1157  // ORDERED
+
1158 
+
1168  template <typename T>
+
1169  Eigen::Matrix<T,Eigen::Dynamic,1>
+
1170  ordered_constrain(const Eigen::Matrix<T,Eigen::Dynamic,1>& x) {
+ +
1172  size_type k = x.size();
+
1173  Eigen::Matrix<T,Eigen::Dynamic,1> y(k);
+
1174  if (k == 0)
+
1175  return y;
+
1176  y[0] = x[0];
+
1177  for (size_type i = 1;
+
1178  i < k;
+
1179  ++i)
+
1180  y[i] = y[i-1] + exp(x[i]);
+
1181  return y;
+
1182  }
+
1183 
+
1196  template <typename T>
+
1197  inline
+
1198  Eigen::Matrix<T,Eigen::Dynamic,1>
+
1199  ordered_constrain(const Eigen::Matrix<T,Eigen::Dynamic,1>& x, T& lp) {
+ +
1201  for (size_type i = 1; i < x.size(); ++i)
+
1202  lp += x(i);
+
1203  return ordered_constrain(x);
+
1204  }
+
1205 
+
1206 
+
1207 
+
1221  template <typename T>
+
1222  Eigen::Matrix<T,Eigen::Dynamic,1>
+
1223  ordered_free(const Eigen::Matrix<T,Eigen::Dynamic,1>& y) {
+
1224  stan::math::check_ordered("stan::prob::ordered_free(%1%)",
+
1225  y, "Ordered variable");
+ +
1227  size_type k = y.size();
+
1228  Eigen::Matrix<T,Eigen::Dynamic,1> x(k);
+
1229  if (k == 0)
+
1230  return x;
+
1231  x[0] = y[0];
+
1232  for (size_type i = 1; i < k; ++i)
+
1233  x[i] = log(y[i] - y[i-1]);
+
1234  return x;
+
1235  }
+
1236 
+
1237 
+
1238  // POSITIVE ORDERED
+
1239 
+
1249  template <typename T>
+
1250  Eigen::Matrix<T,Eigen::Dynamic,1>
+
1251  positive_ordered_constrain(const Eigen::Matrix<T,Eigen::Dynamic,1>& x) {
+ +
1253  size_type k = x.size();
+
1254  Eigen::Matrix<T,Eigen::Dynamic,1> y(k);
+
1255  if (k == 0)
+
1256  return y;
+
1257  y[0] = exp(x[0]);
+
1258  for (size_type i = 1;
+
1259  i < k;
+
1260  ++i)
+
1261  y[i] = y[i-1] + exp(x[i]);
+
1262  return y;
+
1263  }
+
1264 
+
1277  template <typename T>
+
1278  inline
+
1279  Eigen::Matrix<T,Eigen::Dynamic,1>
+
1280  positive_ordered_constrain(const Eigen::Matrix<T,Eigen::Dynamic,1>& x, T& lp) {
+ +
1282  for (size_type i = 0; i < x.size(); ++i)
+
1283  lp += x(i);
+
1284  return positive_ordered_constrain(x);
+
1285  }
+
1286 
+
1287 
+
1288 
+
1302  template <typename T>
+
1303  Eigen::Matrix<T,Eigen::Dynamic,1>
+
1304  positive_ordered_free(const Eigen::Matrix<T,Eigen::Dynamic,1>& y) {
+
1305  stan::math::check_positive_ordered("stan::prob::positive_ordered_free(%1%)",
+
1306  y, "Positive ordered variable");
+ +
1308  size_type k = y.size();
+
1309  Eigen::Matrix<T,Eigen::Dynamic,1> x(k);
+
1310  if (k == 0)
+
1311  return x;
+
1312  x[0] = log(y[0]);
+
1313  for (size_type i = 1; i < k; ++i)
+
1314  x[i] = log(y[i] - y[i-1]);
+
1315  return x;
+
1316  }
+
1317 
+
1318 
+
1319  // CHOLESKY FACTOR
+
1320 
+
1332  template <typename T>
+
1333  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>
+
1334  cholesky_factor_constrain(const Eigen::Matrix<T,Eigen::Dynamic,1>& x,
+
1335  int M,
+
1336  int N) {
+
1337  using std::exp;
+
1338  if (M < N)
+
1339  throw std::domain_error("cholesky_factor_constrain: num rows must be >= num cols");
+
1340  if (x.size() != ((N * (N + 1)) / 2 + (M - N) * N))
+
1341  throw std::domain_error("cholesky_factor_constrain: x.size() must be (N * (N + 1)) / 2 + (M - N) * N");
+
1342  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> y(M,N);
+
1343  T zero(0);
+
1344  int pos = 0;
+
1345  // upper square
+
1346  for (int m = 0; m < N; ++m) {
+
1347  for (int n = 0; n < m; ++n)
+
1348  y(m,n) = x(pos++);
+
1349  y(m,m) = exp(x(pos++));
+
1350  for (int n = m + 1; n < N; ++n)
+
1351  y(m,n) = zero;
+
1352  }
+
1353  // lower rectangle
+
1354  for (int m = N; m < M; ++m)
+
1355  for (int n = 0; n < N; ++n)
+
1356  y(m,n) = x(pos++);
+
1357  return y;
+
1358  }
+
1359 
+
1374  template <typename T>
+
1375  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>
+
1376  cholesky_factor_constrain(const Eigen::Matrix<T,Eigen::Dynamic,1>& x,
+
1377  int M,
+
1378  int N,
+
1379  T& lp) {
+
1380  // cut-and-paste from above, so checks twice
+
1381 
+
1382  using stan::math::sum;
+
1383  if (x.size() != ((N * (N + 1)) / 2 + (M - N) * N))
+
1384  throw std::domain_error("cholesky_factor_constrain: x.size() must be (k choose 2) + k");
+
1385  int pos = 0;
+
1386  std::vector<T> log_jacobians(N);
+
1387  for (int n = 0; n < N; ++n) {
+
1388  pos += n;
+
1389  log_jacobians[n] = x(pos++);
+
1390  }
+
1391  lp += sum(log_jacobians); // optimized for autodiff vs. direct lp +=
+
1392  return cholesky_factor_constrain(x,M,N);
+
1393  }
+
1394 
+
1404  template <typename T>
+
1405  Eigen::Matrix<T,Eigen::Dynamic,1>
+
1406  cholesky_factor_free(const Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& y) {
+
1407  using std::log;
+
1408  double result;
+
1409  if (!stan::math::check_cholesky_factor("cholesky_factor_free(%1%)",y,"y",&result))
+
1410  throw std::domain_error("cholesky_factor_free: y is not a Cholesky factor");
+
1411  int M = y.rows();
+
1412  int N = y.cols();
+
1413  Eigen::Matrix<T,Eigen::Dynamic,1> x((N * (N + 1)) / 2 + (M - N) * N);
+
1414  int pos = 0;
+
1415  // lower triangle of upper square
+
1416  for (int m = 0; m < N; ++m) {
+
1417  for (int n = 0; n < m; ++n)
+
1418  x(pos++) = y(m,n);
+
1419  // diagonal of upper square
+
1420  x(pos++) = log(y(m,m));
+
1421  }
+
1422  // lower rectangle
+
1423  for (int m = N; m < M; ++m)
+
1424  for (int n = 0; n < N; ++n)
+
1425  x(pos++) = y(m,n);
+
1426  return x;
+
1427  }
+
1428 
+
1429  // CORRELATION MATRIX
+
1454  template <typename T>
+
1455  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>
+
1456  corr_matrix_constrain(const Eigen::Matrix<T,Eigen::Dynamic,1>& x,
+ + +
1459  size_type k_choose_2 = (k * (k - 1)) / 2;
+
1460  if (k_choose_2 != x.size())
+
1461  throw std::invalid_argument ("x is not a valid correlation matrix");
+
1462  Eigen::Array<T,Eigen::Dynamic,1> cpcs(k_choose_2);
+
1463  for (size_type i = 0; i < k_choose_2; ++i)
+
1464  cpcs[i] = corr_constrain(x[i]);
+
1465  return read_corr_matrix(cpcs,k);
+
1466  }
+
1467 
+
1487  template <typename T>
+
1488  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>
+
1489  corr_matrix_constrain(const Eigen::Matrix<T,Eigen::Dynamic,1>& x,
+ +
1491  T& lp) {
+ +
1493  size_type k_choose_2 = (k * (k - 1)) / 2;
+
1494  if (k_choose_2 != x.size())
+
1495  throw std::invalid_argument ("x is not a valid correlation matrix");
+
1496  Eigen::Array<T,Eigen::Dynamic,1> cpcs(k_choose_2);
+
1497  for (size_type i = 0; i < k_choose_2; ++i)
+
1498  cpcs[i] = corr_constrain(x[i],lp);
+
1499  return read_corr_matrix(cpcs,k,lp);
+
1500  }
+
1501 
+
1522  template <typename T>
+
1523  Eigen::Matrix<T,Eigen::Dynamic,1>
+
1524  corr_matrix_free(const Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& y) {
+
1525  typedef typename
+ +
1527  size_type k = y.rows();
+
1528  if (y.cols() != k)
+
1529  throw std::domain_error("y is not a square matrix");
+
1530  if (k == 0)
+
1531  throw std::domain_error("y has no elements");
+
1532  size_type k_choose_2 = (k * (k-1)) / 2;
+
1533  Eigen::Array<T,Eigen::Dynamic,1> x(k_choose_2);
+
1534  Eigen::Array<T,Eigen::Dynamic,1> sds(k);
+
1535  bool successful = factor_cov_matrix(x,sds,y);
+
1536  if (!successful)
+
1537  throw std::runtime_error("factor_cov_matrix failed on y");
+
1538  for (size_type i = 0; i < k; ++i) {
+
1539  // sds on log scale unconstrained
+
1540  if (fabs(sds[i] - 0.0) >= CONSTRAINT_TOLERANCE) {
+
1541  std::stringstream s;
+
1542  s << "all standard deviations must be zero."
+
1543  << " found log(sd[" << i << "])=" << sds[i] << std::endl;
+
1544  BOOST_THROW_EXCEPTION(std::runtime_error(s.str()));
+
1545  }
+
1546  }
+
1547  return x.matrix();
+
1548  }
+
1549 
+
1550 
+
1551  // COVARIANCE MATRIX
+
1552 
+
1565  template <typename T>
+
1566  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>
+
1567  cov_matrix_constrain(const Eigen::Matrix<T,Eigen::Dynamic,1>& x,
+ +
1569  using std::exp;
+ +
1571  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> L(K,K);
+
1572  if (x.size() != (K * (K + 1)) / 2)
+
1573  throw std::domain_error("x.size() != K + (K choose 2)");
+
1574  int i = 0;
+
1575  for (size_type m = 0; m < K; ++m) {
+
1576  for (int n = 0; n < m; ++n)
+
1577  L(m,n) = x(i++);
+
1578  L(m,m) = exp(x(i++));
+
1579  for (size_type n = m + 1; n < K; ++n)
+
1580  L(m,n) = 0.0;
+
1581  }
+
1582  // FIXME: return multiply_self_transpose
+
1583  return L * L.transpose();
+
1584  }
+
1585 
+
1586 
+
1599  template <typename T>
+
1600  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>
+
1601  cov_matrix_constrain(const Eigen::Matrix<T,Eigen::Dynamic,1>& x,
+ +
1603  T& lp) {
+
1604  using std::exp;
+ +
1606  if (x.size() != (K * (K + 1)) / 2)
+
1607  throw std::domain_error("x.size() != K + (K choose 2)");
+
1608  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> L(K,K);
+
1609  int i = 0;
+
1610  for (size_type m = 0; m < K; ++m) {
+
1611  for (size_type n = 0; n < m; ++n)
+
1612  L(m,n) = x(i++);
+
1613  L(m,m) = exp(x(i++));
+
1614  for (size_type n = m + 1; n < K; ++n)
+
1615  L(m,n) = 0.0;
+
1616  }
+
1617  // Jacobian for complete transform, including exp() above
+
1618  lp += (K * stan::math::LOG_2); // needless constant; want propto
+
1619  for (int k = 0; k < K; ++k)
+
1620  lp += (K - k + 1) * log(L(k,k)); // only +1 because index from 0
+
1621  return L * L.transpose();
+
1622  // return tri_multiply_transpose(L);
+
1623  }
+
1624 
+
1647  template <typename T>
+
1648  Eigen::Matrix<T,Eigen::Dynamic,1>
+
1649  cov_matrix_free(const Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& y) {
+
1650  using std::log;
+
1651  int K = y.rows();
+
1652  if (y.cols() != K)
+
1653  throw std::domain_error("y is not a square matrix");
+
1654  if (K == 0)
+
1655  throw std::domain_error("y has no elements");
+
1656  for (int k = 0; k < K; ++k)
+
1657  if (!(y(k,k) > 0.0))
+
1658  throw std::domain_error("y has non-positive diagonal");
+
1659  Eigen::Matrix<T,Eigen::Dynamic,1> x((K * (K + 1)) / 2);
+
1660  // FIXME: see Eigen LDLT for rank-revealing version -- use that
+
1661  // even if less efficient?
+
1662  Eigen::LLT<Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> >
+
1663  llt(y.rows());
+
1664  llt.compute(y);
+
1665  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> L = llt.matrixL();
+
1666  int i = 0;
+
1667  for (int m = 0; m < K; ++m) {
+
1668  for (int n = 0; n < m; ++n)
+
1669  x(i++) = L(m,n);
+
1670  x(i++) = log(L(m,m));
+
1671  }
+
1672  return x;
+
1673  }
+
1674 
+
1694  template <typename T>
+
1695  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>
+
1696  cov_matrix_constrain_lkj(const Eigen::Matrix<T,Eigen::Dynamic,1>& x,
+
1697  size_t k) {
+
1698  size_t k_choose_2 = (k * (k - 1)) / 2;
+
1699  Eigen::Array<T,Eigen::Dynamic,1> cpcs(k_choose_2);
+
1700  int pos = 0;
+
1701  for (size_t i = 0; i < k_choose_2; ++i)
+
1702  cpcs[i] = corr_constrain(x[pos++]);
+
1703  Eigen::Array<T,Eigen::Dynamic,1> sds(k);
+
1704  for (size_t i = 0; i < k; ++i)
+
1705  sds[i] = positive_constrain(x[pos++]);
+
1706  return read_cov_matrix(cpcs, sds);
+
1707  }
+
1708 
+
1733  template <typename T>
+
1734  Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>
+
1735  cov_matrix_constrain_lkj(const Eigen::Matrix<T,Eigen::Dynamic,1>& x,
+
1736  size_t k,
+
1737  T& lp) {
+
1738  size_t k_choose_2 = (k * (k - 1)) / 2;
+
1739  Eigen::Array<T,Eigen::Dynamic,1> cpcs(k_choose_2);
+
1740  int pos = 0;
+
1741  for (size_t i = 0; i < k_choose_2; ++i)
+
1742  cpcs[i] = corr_constrain(x[pos++], lp);
+
1743  Eigen::Array<T,Eigen::Dynamic,1> sds(k);
+
1744  for (size_t i = 0; i < k; ++i)
+
1745  sds[i] = positive_constrain(x[pos++],lp);
+
1746  return read_cov_matrix(cpcs, sds, lp);
+
1747  }
+
1748 
+
1767  template <typename T>
+
1768  Eigen::Matrix<T,Eigen::Dynamic,1>
+ +
1770  const Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic>& y) {
+
1771  typedef typename
+ +
1773  size_type k = y.rows();
+
1774  if (y.cols() != k)
+
1775  throw std::domain_error("y is not a square matrix");
+
1776  if (k == 0)
+
1777  throw std::domain_error("y has no elements");
+
1778  size_type k_choose_2 = (k * (k-1)) / 2;
+
1779  Eigen::Array<T,Eigen::Dynamic,1> cpcs(k_choose_2);
+
1780  Eigen::Array<T,Eigen::Dynamic,1> sds(k);
+
1781  bool successful = factor_cov_matrix(cpcs,sds,y);
+
1782  if (!successful)
+
1783  throw std::runtime_error ("factor_cov_matrix failed on y");
+
1784  Eigen::Matrix<T,Eigen::Dynamic,1> x(k_choose_2 + k);
+
1785  size_type pos = 0;
+
1786  for (size_type i = 0; i < k_choose_2; ++i)
+
1787  x[pos++] = cpcs[i];
+
1788  for (size_type i = 0; i < k; ++i)
+
1789  x[pos++] = sds[i];
+
1790  return x;
+
1791  }
+
1792 
+
1793  }
+
1794 
+
1795 }
+
1796 
+
1797 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/transpose_8hpp.html b/doc/api/html/transpose_8hpp.html new file mode 100644 index 00000000000..835bed10e87 --- /dev/null +++ b/doc/api/html/transpose_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/matrix/transpose.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
transpose.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T , int R, int C>
Eigen::Matrix< T, C, R > stan::math::transpose (const Eigen::Matrix< T, R, C > &m)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/transpose_8hpp_source.html b/doc/api/html/transpose_8hpp_source.html new file mode 100644 index 00000000000..77b11936433 --- /dev/null +++ b/doc/api/html/transpose_8hpp_source.html @@ -0,0 +1,125 @@ + + + + + +Stan: src/stan/math/matrix/transpose.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
transpose.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__TRANSPOSE_HPP__
+
2 #define __STAN__MATH__MATRIX__TRANSPOSE_HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7  namespace math {
+
8 
+
9  template <typename T, int R, int C>
+
10  Eigen::Matrix<T,C,R>
+
11  inline
+
12  transpose(const Eigen::Matrix<T,R,C>& m) {
+
13  return m.transpose();
+
14  }
+
15 
+
16  }
+
17 }
+
18 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/trigamma_8hpp.html b/doc/api/html/trigamma_8hpp.html new file mode 100644 index 00000000000..3cde41d9fb5 --- /dev/null +++ b/doc/api/html/trigamma_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/functions/trigamma.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
trigamma.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T >
stan::math::trigamma (T x)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/trigamma_8hpp_source.html b/doc/api/html/trigamma_8hpp_source.html new file mode 100644 index 00000000000..b3ef4269b71 --- /dev/null +++ b/doc/api/html/trigamma_8hpp_source.html @@ -0,0 +1,182 @@ + + + + + +Stan: src/stan/math/functions/trigamma.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
trigamma.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__FUNCTIONS__TRIGAMMA_HPP__
+
2 #define __STAN__MATH__FUNCTIONS__TRIGAMMA_HPP__
+
3 
+
4  // Reference:
+
5  // BE Schneider,
+
6  // Algorithm AS 121:
+
7  // Trigamma Function,
+
8  // Applied Statistics,
+
9  // Volume 27, Number 1, pages 97-99, 1978.
+
10 
+
11 #include <stan/math/constants.hpp>
+
12 
+
13 namespace stan {
+
14 
+
15  namespace math {
+
16 
+
17  template <typename T>
+
18  inline
+
19  T
+
20  trigamma(T x) {
+
21 
+
22  using std::floor;
+
23  using std::sin;
+
24 
+
25  double small = 0.0001;
+
26  double large = 5.0;
+
27  T value;
+
28  T y;
+
29  T z;
+
30 
+
31  //bernoulli numbers
+
32  double b2 = 1.0 / 6.0;
+
33  double b4 = -1.0 / 30.0;
+
34  double b6 = 1.0 / 42.0;
+
35  double b8 = -1.0 / 30.0;
+
36 
+
37  //negative integers and zero return postiive infinity
+
38  //see http://mathworld.wolfram.com/PolygammaFunction.html
+
39  if ((x <= 0.0) && (floor(x) == x)) {
+
40  value = positive_infinity();
+
41  return value;
+
42  }
+
43 
+
44  //negative non-integers: use the reflection formula
+
45  //see http://mathworld.wolfram.com/PolygammaFunction.html
+
46  if((x <= 0) && (floor(x) != x)) {
+
47  value = -trigamma(-x + 1.0) + (pi() / sin(-pi() * x))
+
48  * (pi() / sin(-pi() * x));
+
49  return value;
+
50  }
+
51 
+
52  //small value approximation if x <= small.
+
53  if (x <= small)
+
54  return 1.0 / (x * x);
+
55 
+
56  //use recurrence relation until x >= large
+
57  //see http://mathworld.wolfram.com/PolygammaFunction.html
+
58  z = x;
+
59  value = 0.0;
+
60  while (z < large) {
+
61  value += 1.0 / (z * z);
+
62  z += 1.0;
+
63  }
+
64 
+
65  //asymptotic expansion as a Laurent series if x >= large
+
66  //see http://en.wikipedia.org/wiki/Trigamma_function
+
67  y = 1.0 / (z * z);
+
68  value += 0.5 * y + (1.0 + y * (b2 + y * (b4 + y * (b6 + y * b8)))) / z;
+
69 
+
70  return value;
+
71  }
+
72  }
+
73 }
+
74 
+
75 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/uniform_8hpp.html b/doc/api/html/uniform_8hpp.html new file mode 100644 index 00000000000..c9955155ed4 --- /dev/null +++ b/doc/api/html/uniform_8hpp.html @@ -0,0 +1,158 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/uniform.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
uniform.hpp File Reference
+
+
+
#include <boost/random/uniform_real_distribution.hpp>
+#include <boost/random/variate_generator.hpp>
+#include <stan/agrad/partials_vari.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/math/constants.hpp>
+#include <stan/math/functions/value_of.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/prob/constants.hpp>
+#include <stan/prob/traits.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + + + + + + + +

+Functions

template<bool propto, typename T_y , typename T_low , typename T_high >
return_type< T_y, T_low,
+T_high >::type 
stan::prob::uniform_log (const T_y &y, const T_low &alpha, const T_high &beta)
 The log of a uniform density for the given y, lower, and upper bound.
 
template<typename T_y , typename T_low , typename T_high >
return_type< T_y, T_low,
+T_high >::type 
stan::prob::uniform_log (const T_y &y, const T_low &alpha, const T_high &beta)
 
template<typename T_y , typename T_low , typename T_high >
return_type< T_y, T_low,
+T_high >::type 
stan::prob::uniform_cdf (const T_y &y, const T_low &alpha, const T_high &beta)
 
template<typename T_y , typename T_low , typename T_high >
return_type< T_y, T_low,
+T_high >::type 
stan::prob::uniform_cdf_log (const T_y &y, const T_low &alpha, const T_high &beta)
 
template<typename T_y , typename T_low , typename T_high >
return_type< T_y, T_low,
+T_high >::type 
stan::prob::uniform_ccdf_log (const T_y &y, const T_low &alpha, const T_high &beta)
 
template<class RNG >
double stan::prob::uniform_rng (const double alpha, const double beta, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/uniform_8hpp_source.html b/doc/api/html/uniform_8hpp_source.html new file mode 100644 index 00000000000..8b0fde6d159 --- /dev/null +++ b/doc/api/html/uniform_8hpp_source.html @@ -0,0 +1,473 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/uniform.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
uniform.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS__UNIFORM_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS__UNIFORM_HPP__
+
3 
+
4 #include <boost/random/uniform_real_distribution.hpp>
+
5 #include <boost/random/variate_generator.hpp>
+
6 
+ + + + +
11 #include <stan/meta/traits.hpp>
+
12 #include <stan/prob/constants.hpp>
+
13 #include <stan/prob/traits.hpp>
+
14 
+
15 namespace stan {
+
16 
+
17  namespace prob {
+
18 
+
19  // CONTINUOUS, UNIVARIATE DENSITIES
+
41  template <bool propto,
+
42  typename T_y, typename T_low, typename T_high>
+
43  typename return_type<T_y,T_low,T_high>::type
+
44  uniform_log(const T_y& y, const T_low& alpha, const T_high& beta) {
+
45  static const char* function = "stan::prob::uniform_log(%1%)";
+
46 
+ + + + + +
52 
+
53  // check if any vectors are zero length
+
54  if (!(stan::length(y)
+
55  && stan::length(alpha)
+
56  && stan::length(beta)))
+
57  return 0.0;
+
58 
+
59  // set up return value accumulator
+
60  double logp(0.0);
+
61  if(!check_not_nan(function, y, "Random variable", &logp))
+
62  return logp;
+
63  if (!check_finite(function, alpha, "Lower bound parameter", &logp))
+
64  return logp;
+
65  if (!check_finite(function, beta, "Upper bound parameter", &logp))
+
66  return logp;
+
67  if (!check_greater(function, beta, alpha, "Upper bound parameter",
+
68  &logp))
+
69  return logp;
+
70  if (!(check_consistent_sizes(function,
+
71  y,alpha,beta,
+
72  "Random variable","Lower bound parameter",
+
73  "Upper bound parameter",
+
74  &logp)))
+
75  return logp;
+
76 
+
77 
+
78  // check if no variables are involved and prop-to
+ +
80  return 0.0;
+
81 
+
82  VectorView<const T_y> y_vec(y);
+
83  VectorView<const T_low> alpha_vec(alpha);
+
84  VectorView<const T_high> beta_vec(beta);
+
85  size_t N = max_size(y, alpha, beta);
+
86 
+
87  for (size_t n = 0; n < N; n++) {
+
88  const double y_dbl = value_of(y_vec[n]);
+
89  if (y_dbl < value_of(alpha_vec[n])
+
90  || y_dbl > value_of(beta_vec[n]))
+
91  return LOG_ZERO;
+
92  }
+
93 
+ + +
96  inv_beta_minus_alpha(max_size(alpha,beta));
+
97  for (size_t i = 0; i < max_size(alpha,beta); i++)
+ +
99  inv_beta_minus_alpha[i]
+
100  = 1.0 / (value_of(beta_vec[i]) - value_of(alpha_vec[i]));
+ + +
103  log_beta_minus_alpha(max_size(alpha,beta));
+
104  for (size_t i = 0; i < max_size(alpha,beta); i++)
+ +
106  log_beta_minus_alpha[i]
+
107  = log(value_of(beta_vec[i]) - value_of(alpha_vec[i]));
+
108 
+ +
110  operands_and_partials(y,alpha,beta);
+
111  for (size_t n = 0; n < N; n++) {
+ +
113  logp -= log_beta_minus_alpha[n];
+
114 
+ +
116  operands_and_partials.d_x2[n] += inv_beta_minus_alpha[n];
+ +
118  operands_and_partials.d_x3[n] -= inv_beta_minus_alpha[n];
+
119  }
+
120  return operands_and_partials.to_var(logp);
+
121  }
+
122 
+
123  template <typename T_y, typename T_low, typename T_high>
+
124  inline
+ +
126  uniform_log(const T_y& y, const T_low& alpha, const T_high& beta) {
+
127  return uniform_log<false>(y,alpha,beta);
+
128  }
+
129 
+
130  template <typename T_y, typename T_low, typename T_high>
+ +
132  uniform_cdf(const T_y& y, const T_low& alpha, const T_high& beta) {
+
133  static const char* function = "stan::prob::uniform_cdf(%1%)";
+
134 
+ + + +
138  using stan::math::value_of;
+ +
140 
+
141  // check if any vectors are zero length
+
142  if (!(stan::length(y)
+
143  && stan::length(alpha)
+
144  && stan::length(beta)))
+
145  return 1.0;
+
146 
+
147  // set up return value accumulator
+
148  double cdf(1.0);
+
149  if(!check_not_nan(function, y, "Random variable", &cdf))
+
150  return cdf;
+
151  if (!check_finite(function, alpha, "Lower bound parameter", &cdf))
+
152  return cdf;
+
153  if (!check_finite(function, beta, "Upper bound parameter", &cdf))
+
154  return cdf;
+
155  if (!check_greater(function, beta, alpha, "Upper bound parameter", &cdf))
+
156  return cdf;
+
157  if (!(check_consistent_sizes(function,
+
158  y,alpha,beta,
+
159  "Random variable","Lower bound parameter",
+
160  "Upper bound parameter",
+
161  &cdf)))
+
162  return cdf;
+
163 
+
164  VectorView<const T_y> y_vec(y);
+
165  VectorView<const T_low> alpha_vec(alpha);
+
166  VectorView<const T_high> beta_vec(beta);
+
167  size_t N = max_size(y, alpha, beta);
+
168 
+
169  for (size_t n = 0; n < N; n++) {
+
170  const double y_dbl = value_of(y_vec[n]);
+
171  if (y_dbl < value_of(alpha_vec[n])
+
172  || y_dbl > value_of(beta_vec[n]))
+
173  return 0.0;
+
174  }
+
175 
+ +
177  operands_and_partials(y,alpha,beta);
+
178  for (size_t n = 0; n < N; n++) {
+
179  const double y_dbl = value_of(y_vec[n]);
+
180  const double alpha_dbl = value_of(alpha_vec[n]);
+
181  const double beta_dbl = value_of(beta_vec[n]);
+
182  const double b_min_a = beta_dbl - alpha_dbl;
+
183  const double cdf_ = (y_dbl - alpha_dbl) / b_min_a;
+
184 
+
185  //cdf
+
186  cdf *= cdf_;
+
187 
+
188  //gradients
+ +
190  operands_and_partials.d_x1[n] += 1.0 / b_min_a / cdf_;
+ +
192  operands_and_partials.d_x2[n] += (y_dbl - beta_dbl) / b_min_a
+
193  / b_min_a / cdf_;
+ +
195  operands_and_partials.d_x3[n] -= 1.0 / b_min_a;
+
196  }
+
197 
+ +
199  for (size_t n = 0; n < stan::length(y); ++n)
+
200  operands_and_partials.d_x1[n] *= cdf;
+ +
202  for (size_t n = 0; n < stan::length(alpha); ++n)
+
203  operands_and_partials.d_x2[n] *= cdf;
+ +
205  for (size_t n = 0; n < stan::length(beta); ++n)
+
206  operands_and_partials.d_x3[n] *= cdf;
+
207 
+
208  return operands_and_partials.to_var(cdf);
+
209  }
+
210 
+
211  template <typename T_y, typename T_low, typename T_high>
+ +
213  uniform_cdf_log(const T_y& y, const T_low& alpha, const T_high& beta) {
+
214  static const char* function = "stan::prob::uniform_cdf_log(%1%)";
+
215 
+ + + +
219  using stan::math::value_of;
+ +
221 
+
222  // check if any vectors are zero length
+
223  if (!(stan::length(y)
+
224  && stan::length(alpha)
+
225  && stan::length(beta)))
+
226  return 0.0;
+
227 
+
228  // set up return value accumulator
+
229  double cdf_log(0.0);
+
230  if(!check_not_nan(function, y, "Random variable", &cdf_log))
+
231  return cdf_log;
+
232  if (!check_finite(function, alpha, "Lower bound parameter", &cdf_log))
+
233  return cdf_log;
+
234  if (!check_finite(function, beta, "Upper bound parameter", &cdf_log))
+
235  return cdf_log;
+
236  if (!check_greater(function, beta, alpha, "Upper bound parameter",
+
237  &cdf_log))
+
238  return cdf_log;
+
239  if (!(check_consistent_sizes(function,
+
240  y,alpha,beta,
+
241  "Random variable","Lower bound parameter",
+
242  "Upper bound parameter",
+
243  &cdf_log)))
+
244  return cdf_log;
+
245 
+
246  VectorView<const T_y> y_vec(y);
+
247  VectorView<const T_low> alpha_vec(alpha);
+
248  VectorView<const T_high> beta_vec(beta);
+
249  size_t N = max_size(y, alpha, beta);
+
250 
+ +
252  operands_and_partials(y,alpha,beta);
+
253 
+
254  for (size_t n = 0; n < N; n++) {
+
255  const double y_dbl = value_of(y_vec[n]);
+
256  if (y_dbl < value_of(alpha_vec[n])
+
257  || y_dbl > value_of(beta_vec[n]))
+ +
259  if (y_dbl == value_of(beta_vec[n]))
+
260  return operands_and_partials.to_var(0.0);
+
261  }
+
262 
+
263  for (size_t n = 0; n < N; n++) {
+
264  const double y_dbl = value_of(y_vec[n]);
+
265  const double alpha_dbl = value_of(alpha_vec[n]);
+
266  const double beta_dbl = value_of(beta_vec[n]);
+
267  const double b_min_a = beta_dbl - alpha_dbl;
+
268  const double cdf_log_ = (y_dbl - alpha_dbl) / b_min_a;
+
269 
+
270  //cdf_log
+
271  cdf_log += log(cdf_log_);
+
272 
+
273  //gradients
+ +
275  operands_and_partials.d_x1[n] += 1.0 / b_min_a / cdf_log_;
+ +
277  operands_and_partials.d_x2[n] += (y_dbl - beta_dbl) / b_min_a
+
278  / b_min_a / cdf_log_;
+ +
280  operands_and_partials.d_x3[n] -= 1.0 / b_min_a;
+
281  }
+
282 
+
283  return operands_and_partials.to_var(cdf_log);
+
284  }
+
285 
+
286  template <typename T_y, typename T_low, typename T_high>
+ +
288  uniform_ccdf_log(const T_y& y, const T_low& alpha, const T_high& beta) {
+
289  static const char* function = "stan::prob::uniform_ccdf_log(%1%)";
+
290 
+ + + +
294  using stan::math::value_of;
+ +
296 
+
297  // check if any vectors are zero length
+
298  if (!(stan::length(y)
+
299  && stan::length(alpha)
+
300  && stan::length(beta)))
+
301  return 0.0;
+
302 
+
303  // set up return value accumulator
+
304  double ccdf_log(0.0);
+
305  if(!check_not_nan(function, y, "Random variable", &ccdf_log))
+
306  return ccdf_log;
+
307  if (!check_finite(function, alpha, "Lower bound parameter", &ccdf_log))
+
308  return ccdf_log;
+
309  if (!check_finite(function, beta, "Upper bound parameter", &ccdf_log))
+
310  return ccdf_log;
+
311  if (!check_greater(function, beta, alpha, "Upper bound parameter",
+
312  &ccdf_log))
+
313  return ccdf_log;
+
314  if (!(check_consistent_sizes(function,
+
315  y,alpha,beta,
+
316  "Random variable","Lower bound parameter",
+
317  "Upper bound parameter",
+
318  &ccdf_log)))
+
319  return ccdf_log;
+
320 
+
321  VectorView<const T_y> y_vec(y);
+
322  VectorView<const T_low> alpha_vec(alpha);
+
323  VectorView<const T_high> beta_vec(beta);
+
324  size_t N = max_size(y, alpha, beta);
+
325 
+
326  for (size_t n = 0; n < N; n++) {
+
327  const double y_dbl = value_of(y_vec[n]);
+
328  if (y_dbl < value_of(alpha_vec[n])
+
329  || y_dbl > value_of(beta_vec[n]))
+
330  return 0.0;
+
331  if (y_dbl == value_of(beta_vec[n]))
+
332  return LOG_ZERO;
+
333  }
+
334 
+ +
336  operands_and_partials(y,alpha,beta);
+
337  for (size_t n = 0; n < N; n++) {
+
338  const double y_dbl = value_of(y_vec[n]);
+
339  const double alpha_dbl = value_of(alpha_vec[n]);
+
340  const double beta_dbl = value_of(beta_vec[n]);
+
341  const double b_min_a = beta_dbl - alpha_dbl;
+
342  const double ccdf_log_ = 1.0 - (y_dbl - alpha_dbl) / b_min_a;
+
343 
+
344  //ccdf_log
+
345  ccdf_log += log(ccdf_log_);
+
346 
+
347  //gradients
+ +
349  operands_and_partials.d_x1[n] -= 1.0 / b_min_a / ccdf_log_;
+ +
351  operands_and_partials.d_x2[n] -= (y_dbl - beta_dbl) / b_min_a
+
352  / b_min_a / ccdf_log_;
+ +
354  operands_and_partials.d_x3[n] += (y_dbl - alpha_dbl) / b_min_a
+
355  / b_min_a / ccdf_log_;
+
356  }
+
357 
+
358  return operands_and_partials.to_var(ccdf_log);
+
359  }
+
360 
+
361  template <class RNG>
+
362  inline double
+
363  uniform_rng(const double alpha,
+
364  const double beta,
+
365  RNG& rng) {
+
366  using boost::variate_generator;
+
367  using boost::random::uniform_real_distribution;
+
368 
+
369  static const char* function = "stan::prob::uniform_rng(%1%)";
+
370 
+ + +
373 
+
374  if (!check_finite(function, alpha, "Lower bound parameter"))
+
375  return 0;
+
376  if (!check_finite(function, beta, "Upper bound parameter"))
+
377  return 0;
+
378  if (!check_greater(function, beta, alpha, "Upper bound parameter"))
+
379  return 0;
+
380 
+
381  variate_generator<RNG&, uniform_real_distribution<> >
+
382  uniform_rng(rng, uniform_real_distribution<>(alpha, beta));
+
383  return uniform_rng();
+
384  }
+
385  }
+
386 }
+
387 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/unit__e__metric_8hpp.html b/doc/api/html/unit__e__metric_8hpp.html new file mode 100644 index 00000000000..385ada848c4 --- /dev/null +++ b/doc/api/html/unit__e__metric_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/mcmc/hmc/hamiltonians/unit_e_metric.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
unit_e_metric.hpp File Reference
+
+
+
#include <boost/random/variate_generator.hpp>
+#include <boost/random/normal_distribution.hpp>
+#include <stan/mcmc/hmc/hamiltonians/base_hamiltonian.hpp>
+#include <stan/mcmc/hmc/hamiltonians/unit_e_point.hpp>
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::unit_e_metric< M, BaseRNG >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/unit__e__metric_8hpp_source.html b/doc/api/html/unit__e__metric_8hpp_source.html new file mode 100644 index 00000000000..e2c4cedcaf2 --- /dev/null +++ b/doc/api/html/unit__e__metric_8hpp_source.html @@ -0,0 +1,167 @@ + + + + + +Stan: src/stan/mcmc/hmc/hamiltonians/unit_e_metric.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
unit_e_metric.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__UNIT__E__METRIC__BETA__
+
2 #define __STAN__MCMC__UNIT__E__METRIC__BETA__
+
3 
+
4 #include <boost/random/variate_generator.hpp>
+
5 #include <boost/random/normal_distribution.hpp>
+
6 
+ + +
9 
+
10 namespace stan {
+
11 
+
12  namespace mcmc {
+
13 
+
14  // Euclidean manifold with unit metric
+
15  template <typename M, typename BaseRNG>
+
16  class unit_e_metric: public base_hamiltonian<M, unit_e_point, BaseRNG> {
+
17 
+
18  public:
+
19 
+
20  unit_e_metric(M& m, std::ostream* e):
+
21  base_hamiltonian<M, unit_e_point, BaseRNG>(m, e) {};
+ +
23 
+
24  double T(unit_e_point& z) {
+
25  return 0.5 * z.p.squaredNorm();
+
26  }
+
27 
+
28  double tau(unit_e_point& z) { return T(z); }
+
29  double phi(unit_e_point& z) { return this->V(z); }
+
30 
+
31  const Eigen::VectorXd dtau_dq(unit_e_point& z) {
+
32  return Eigen::VectorXd::Zero(this->_model.num_params_r());
+
33  }
+
34 
+
35  const Eigen::VectorXd dtau_dp(unit_e_point& z) {
+
36  return z.p;
+
37  }
+
38 
+
39  const Eigen::VectorXd dphi_dq(unit_e_point& z) {
+
40  return z.g;
+
41  }
+
42 
+
43  void sample_p(unit_e_point& z, BaseRNG& rng) {
+
44 
+
45  boost::variate_generator<BaseRNG&, boost::normal_distribution<> >
+
46  _rand_unit_gaus(rng, boost::normal_distribution<>());
+
47 
+
48  for (int i = 0; i < z.p.size(); ++i)
+
49  z.p(i) = _rand_unit_gaus();
+
50 
+
51  }
+
52 
+
53  };
+
54 
+
55  } // mcmc
+
56 
+
57 } // stan
+
58 
+
59 
+
60 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/unit__e__nuts_8hpp.html b/doc/api/html/unit__e__nuts_8hpp.html new file mode 100644 index 00000000000..457facf7d02 --- /dev/null +++ b/doc/api/html/unit__e__nuts_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/mcmc/hmc/nuts/unit_e_nuts.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
unit_e_nuts.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::unit_e_nuts< M, BaseRNG >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/unit__e__nuts_8hpp_source.html b/doc/api/html/unit__e__nuts_8hpp_source.html new file mode 100644 index 00000000000..3576cb396d8 --- /dev/null +++ b/doc/api/html/unit__e__nuts_8hpp_source.html @@ -0,0 +1,149 @@ + + + + + +Stan: src/stan/mcmc/hmc/nuts/unit_e_nuts.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
unit_e_nuts.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__UNIT__E__NUTS__BETA__
+
2 #define __STAN__MCMC__UNIT__E__NUTS__BETA__
+
3 
+ + + + +
8 
+
9 namespace stan {
+
10 
+
11  namespace mcmc {
+
12 
+
13  // The No-U-Turn Sampler (NUTS) on a
+
14  // Euclidean manifold with unit metric
+
15 
+
16  template <typename M, class BaseRNG>
+
17  class unit_e_nuts: public base_nuts<M,
+
18  unit_e_point,
+
19  unit_e_metric,
+
20  expl_leapfrog,
+
21  BaseRNG> {
+
22 
+
23  public:
+
24 
+
25  unit_e_nuts(M &m, BaseRNG& rng, std::ostream* o = &std::cout, std::ostream* e = 0):
+
26  base_nuts<M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG>(m, rng, o, e)
+
27  { this->_name = "NUTS with a unit Euclidean metric"; }
+
28 
+ +
30  unit_e_point& finish,
+
31  Eigen::VectorXd& rho) {
+
32  return finish.p.dot(rho - finish.p) > 0
+
33  && start.p.dot(rho - start.p) > 0;
+
34  }
+
35 
+
36  };
+
37 
+
38  } // mcmc
+
39 
+
40 } // stan
+
41 
+
42 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/unit__e__point_8hpp.html b/doc/api/html/unit__e__point_8hpp.html new file mode 100644 index 00000000000..0a82d4b417f --- /dev/null +++ b/doc/api/html/unit__e__point_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/mcmc/hmc/hamiltonians/unit_e_point.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
unit_e_point.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::unit_e_point
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/unit__e__point_8hpp_source.html b/doc/api/html/unit__e__point_8hpp_source.html new file mode 100644 index 00000000000..7e791c37a69 --- /dev/null +++ b/doc/api/html/unit__e__point_8hpp_source.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/mcmc/hmc/hamiltonians/unit_e_point.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
unit_e_point.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__UNIT__E__POINT__BETA__
+
2 #define __STAN__MCMC__UNIT__E__POINT__BETA__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace mcmc {
+
9 
+
10  // Point in a phase space with a base
+
11  // Euclidean manifold with unit metric
+
12  class unit_e_point: public ps_point {
+
13 
+
14  public:
+
15 
+
16  unit_e_point(int n): ps_point(n) {};
+
17 
+
18  };
+
19 
+
20  } // mcmc
+
21 
+
22 } // stan
+
23 
+
24 
+
25 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/unit__e__static__hmc_8hpp.html b/doc/api/html/unit__e__static__hmc_8hpp.html new file mode 100644 index 00000000000..432bd064126 --- /dev/null +++ b/doc/api/html/unit__e__static__hmc_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/mcmc/hmc/static/unit_e_static_hmc.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
unit_e_static_hmc.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::unit_e_static_hmc< M, BaseRNG >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/unit__e__static__hmc_8hpp_source.html b/doc/api/html/unit__e__static__hmc_8hpp_source.html new file mode 100644 index 00000000000..365605d89b1 --- /dev/null +++ b/doc/api/html/unit__e__static__hmc_8hpp_source.html @@ -0,0 +1,144 @@ + + + + + +Stan: src/stan/mcmc/hmc/static/unit_e_static_hmc.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
unit_e_static_hmc.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__UNIT__E__STATIC__HMC__BETA__
+
2 #define __STAN__MCMC__UNIT__E__STATIC__HMC__BETA__
+
3 
+ + + + +
8 
+
9 namespace stan {
+
10 
+
11  namespace mcmc {
+
12 
+
13  // Hamiltonian Monte Carlo on a
+
14  // Euclidean manifold with unit metric
+
15  // and static integration time
+
16 
+
17  template <typename M, class BaseRNG>
+ +
19  unit_e_point,
+
20  unit_e_metric,
+
21  expl_leapfrog,
+
22  BaseRNG> {
+
23 
+
24  public:
+
25 
+
26  unit_e_static_hmc(M &m, BaseRNG& rng, std::ostream* o = &std::cout, std::ostream* e = 0):
+
27  base_static_hmc<M, unit_e_point, unit_e_metric, expl_leapfrog, BaseRNG>(m, rng, o, e)
+
28  { this->_name = "Static HMC with a unit Euclidean metric"; }
+
29 
+
30  };
+
31 
+
32  } // mcmc
+
33 
+
34 } // stan
+
35 
+
36 
+
37 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/univariate_2continuous_8hpp.html b/doc/api/html/univariate_2continuous_8hpp.html new file mode 100644 index 00000000000..5f8518b2333 --- /dev/null +++ b/doc/api/html/univariate_2continuous_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
continuous.hpp File Reference
+
+
+
#include <stan/prob/distributions/univariate/continuous/beta.hpp>
+#include <stan/prob/distributions/univariate/continuous/cauchy.hpp>
+#include <stan/prob/distributions/univariate/continuous/chi_square.hpp>
+#include <stan/prob/distributions/univariate/continuous/double_exponential.hpp>
+#include <stan/prob/distributions/univariate/continuous/exponential.hpp>
+#include <stan/prob/distributions/univariate/continuous/exp_mod_normal.hpp>
+#include <stan/prob/distributions/univariate/continuous/gamma.hpp>
+#include <stan/prob/distributions/univariate/continuous/gumbel.hpp>
+#include <stan/prob/distributions/univariate/continuous/inv_chi_square.hpp>
+#include <stan/prob/distributions/univariate/continuous/inv_gamma.hpp>
+#include <stan/prob/distributions/univariate/continuous/logistic.hpp>
+#include <stan/prob/distributions/univariate/continuous/lognormal.hpp>
+#include <stan/prob/distributions/univariate/continuous/normal.hpp>
+#include <stan/prob/distributions/univariate/continuous/pareto.hpp>
+#include <stan/prob/distributions/univariate/continuous/rayleigh.hpp>
+#include <stan/prob/distributions/univariate/continuous/scaled_inv_chi_square.hpp>
+#include <stan/prob/distributions/univariate/continuous/skew_normal.hpp>
+#include <stan/prob/distributions/univariate/continuous/student_t.hpp>
+#include <stan/prob/distributions/univariate/continuous/uniform.hpp>
+#include <stan/prob/distributions/univariate/continuous/von_mises.hpp>
+#include <stan/prob/distributions/univariate/continuous/weibull.hpp>
+
+

Go to the source code of this file.

+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/univariate_2continuous_8hpp_source.html b/doc/api/html/univariate_2continuous_8hpp_source.html new file mode 100644 index 00000000000..05545bf79dd --- /dev/null +++ b/doc/api/html/univariate_2continuous_8hpp_source.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
continuous.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS_HPP__
+
3 
+ + + + + + + + + + + + + + + + + + + + + +
25 
+
26 
+
27 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/univariate_2discrete_8hpp.html b/doc/api/html/univariate_2discrete_8hpp.html new file mode 100644 index 00000000000..2bcaf513d14 --- /dev/null +++ b/doc/api/html/univariate_2discrete_8hpp.html @@ -0,0 +1,116 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/discrete.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
discrete.hpp File Reference
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/univariate_2discrete_8hpp_source.html b/doc/api/html/univariate_2discrete_8hpp_source.html new file mode 100644 index 00000000000..524af7ade42 --- /dev/null +++ b/doc/api/html/univariate_2discrete_8hpp_source.html @@ -0,0 +1,119 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/discrete.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
discrete.hpp
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/univariate_8hpp.html b/doc/api/html/univariate_8hpp.html new file mode 100644 index 00000000000..f0d0d7c968d --- /dev/null +++ b/doc/api/html/univariate_8hpp.html @@ -0,0 +1,111 @@ + + + + + +Stan: src/stan/prob/distributions/univariate.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
univariate.hpp File Reference
+
+ +
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/univariate_8hpp_source.html b/doc/api/html/univariate_8hpp_source.html new file mode 100644 index 00000000000..9c4a8e4cdb0 --- /dev/null +++ b/doc/api/html/univariate_8hpp_source.html @@ -0,0 +1,114 @@ + + + + + +Stan: src/stan/prob/distributions/univariate.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
univariate.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__UNIVARIATE_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__UNIVARIATE_HPP__
+
3 
+ + +
6 
+
7 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/unvalued__argument_8hpp.html b/doc/api/html/unvalued__argument_8hpp.html new file mode 100644 index 00000000000..62b2b1444d4 --- /dev/null +++ b/doc/api/html/unvalued__argument_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/gm/arguments/unvalued_argument.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
unvalued_argument.hpp File Reference
+
+
+
#include <iostream>
+#include <vector>
+#include <stan/gm/arguments/argument.hpp>
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::unvalued_argument
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/unvalued__argument_8hpp_source.html b/doc/api/html/unvalued__argument_8hpp_source.html new file mode 100644 index 00000000000..cfa54415907 --- /dev/null +++ b/doc/api/html/unvalued__argument_8hpp_source.html @@ -0,0 +1,167 @@ + + + + + +Stan: src/stan/gm/arguments/unvalued_argument.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
unvalued_argument.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__UNVALUED__ARGUMENT__BETA__
+
2 #define __STAN__GM__ARGUMENTS__UNVALUED__ARGUMENT__BETA__
+
3 #include <iostream>
+
4 
+
5 #include <vector>
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace gm {
+
11 
+
12  class unvalued_argument: public argument {
+
13 
+
14  public:
+
15 
+ +
17  : _is_present(false) {}
+
18 
+
19  void print(std::ostream* s, const int depth, const char prefix) {}
+
20 
+
21  void print_help(std::ostream* s, const int depth, const bool recurse = false) {
+
22  if (!s)
+
23  return;
+
24 
+
25  std::string indent(indent_width * depth, ' ');
+
26  std::string subindent(indent_width, ' ');
+
27 
+
28  *s << indent << _name << std::endl;
+
29  *s << indent << subindent << _description << std::endl;
+
30  *s << std::endl;
+
31 
+
32  }
+
33 
+
34  bool parse_args(std::vector<std::string>& args, std::ostream* out,
+
35  std::ostream* err, bool& help_flag) {
+
36  if (args.size() == 0)
+
37  return true;
+
38 
+
39  if ((args.back() == "help") || (args.back() == "help-all")) {
+
40  print_help(out, 0);
+
41  help_flag |= true;
+
42  args.clear();
+
43  return true;
+
44  }
+
45 
+
46  _is_present = true;
+
47  return true;
+
48  };
+
49 
+
50  bool is_present() {
+
51  return _is_present;
+
52  }
+
53 
+
54  protected:
+ +
56  };
+
57 
+
58  } // gm
+
59 } // stan
+
60 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/v__vari_8hpp.html b/doc/api/html/v__vari_8hpp.html new file mode 100644 index 00000000000..05c1a7e7abe --- /dev/null +++ b/doc/api/html/v__vari_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/agrad/rev/internal/v_vari.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
v_vari.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::agrad::op_v_vari
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/v__vari_8hpp_source.html b/doc/api/html/v__vari_8hpp_source.html new file mode 100644 index 00000000000..3747a2a0c37 --- /dev/null +++ b/doc/api/html/v__vari_8hpp_source.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/agrad/rev/internal/v_vari.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
v_vari.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__INTERNAL__V_VARI_HPP__
+
2 #define __STAN__AGRAD__REV__INTERNAL__V_VARI_HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7  namespace agrad {
+
8 
+
9  class op_v_vari : public vari {
+
10  protected:
+ +
12  public:
+
13  op_v_vari(double f, vari* avi) :
+
14  vari(f),
+
15  avi_(avi) {
+
16  }
+
17  };
+
18 
+
19  }
+
20 }
+
21 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/validate__column__index_8hpp.html b/doc/api/html/validate__column__index_8hpp.html new file mode 100644 index 00000000000..f3d4223f4d5 --- /dev/null +++ b/doc/api/html/validate__column__index_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/math/matrix/validate_column_index.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
validate_column_index.hpp File Reference
+
+
+
#include <sstream>
+#include <stdexcept>
+#include <stan/math/matrix/Eigen.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T , int R, int C>
void stan::math::validate_column_index (const Eigen::Matrix< T, R, C > &m, size_t j, const char *msg)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/validate__column__index_8hpp_source.html b/doc/api/html/validate__column__index_8hpp_source.html new file mode 100644 index 00000000000..d7baf28bf81 --- /dev/null +++ b/doc/api/html/validate__column__index_8hpp_source.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/math/matrix/validate_column_index.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
validate_column_index.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__VALIDATE_COLUMN_INDEX_HPP__
+
2 #define __STAN__MATH__MATRIX__VALIDATE_COLUMN_INDEX_HPP__
+
3 
+
4 #include <sstream>
+
5 #include <stdexcept>
+ +
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
11  template <typename T, int R, int C>
+
12  void validate_column_index(const Eigen::Matrix<T,R,C>& m,
+
13  size_t j,
+
14  const char* msg) {
+
15  if (j > 0 && j <= static_cast<size_t>(m.cols())) return;
+
16  std::stringstream ss;
+
17  ss << "require 0 < column index <= number of columns in " << msg;
+
18  ss << " found cols()=" << m.cols()
+
19  << "; index j=" << j;
+
20  throw std::domain_error(ss.str());
+
21  }
+
22 
+
23  }
+
24 }
+
25 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/validate__greater_8hpp.html b/doc/api/html/validate__greater_8hpp.html new file mode 100644 index 00000000000..008162a5aa4 --- /dev/null +++ b/doc/api/html/validate__greater_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/matrix/validate_greater.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
validate_greater.hpp File Reference
+
+
+
#include <sstream>
+#include <stdexcept>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T1 , typename T2 >
void stan::math::validate_greater (const T1 &x, const T2 &y, const char *x_name, const char *y_name, const char *fun_name)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/validate__greater_8hpp_source.html b/doc/api/html/validate__greater_8hpp_source.html new file mode 100644 index 00000000000..a4f60e134c4 --- /dev/null +++ b/doc/api/html/validate__greater_8hpp_source.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/matrix/validate_greater.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
validate_greater.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__VALIDATE_GREATER_HPP__
+
2 #define __STAN__MATH__MATRIX__VALIDATE_GREATER_HPP__
+
3 
+
4 #include <sstream>
+
5 #include <stdexcept>
+
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
10  template <typename T1, typename T2>
+
11  inline
+
12  void validate_greater(const T1& x, const T2& y,
+
13  const char* x_name, const char* y_name,
+
14  const char* fun_name) {
+
15  if (x > y) return;
+
16  std::stringstream ss;
+
17  ss << "require " << x_name << " > " << y_name
+
18  << " in " << fun_name
+
19  << "; found " << x_name << "=" << x
+
20  << ", " << y_name << "=" << y;
+
21  throw std::domain_error(ss.str());
+
22  }
+
23 
+
24  }
+
25 }
+
26 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/validate__greater__or__equal_8hpp.html b/doc/api/html/validate__greater__or__equal_8hpp.html new file mode 100644 index 00000000000..af2905961d2 --- /dev/null +++ b/doc/api/html/validate__greater__or__equal_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/matrix/validate_greater_or_equal.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
validate_greater_or_equal.hpp File Reference
+
+
+
#include <sstream>
+#include <stdexcept>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T1 , typename T2 >
void stan::math::validate_greater_or_equal (const T1 &x, const T2 &y, const char *x_name, const char *y_name, const char *fun_name)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/validate__greater__or__equal_8hpp_source.html b/doc/api/html/validate__greater__or__equal_8hpp_source.html new file mode 100644 index 00000000000..0ed5d0064b6 --- /dev/null +++ b/doc/api/html/validate__greater__or__equal_8hpp_source.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/matrix/validate_greater_or_equal.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
validate_greater_or_equal.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__VALIDATE_GREATER_OR_EQUAL_HPP__
+
2 #define __STAN__MATH__MATRIX__VALIDATE_GREATER_OR_EQUAL_HPP__
+
3 
+
4 #include <sstream>
+
5 #include <stdexcept>
+
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
10  template <typename T1, typename T2>
+
11  inline
+
12  void validate_greater_or_equal(const T1& x, const T2& y,
+
13  const char* x_name, const char* y_name,
+
14  const char* fun_name) {
+
15  if (x >= y) return;
+
16  std::stringstream ss;
+
17  ss << "require " << x_name << " >= " << y_name
+
18  << " in " << fun_name
+
19  << "; found " << x_name << "=" << x
+
20  << ", " << y_name << "=" << y;
+
21  throw std::domain_error(ss.str());
+
22  }
+
23 
+
24  }
+
25 }
+
26 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/validate__less_8hpp.html b/doc/api/html/validate__less_8hpp.html new file mode 100644 index 00000000000..71ac0317158 --- /dev/null +++ b/doc/api/html/validate__less_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/matrix/validate_less.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
validate_less.hpp File Reference
+
+
+
#include <sstream>
+#include <stdexcept>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T1 , typename T2 >
void stan::math::validate_less (const T1 &x, const T2 &y, const char *x_name, const char *y_name, const char *fun_name)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/validate__less_8hpp_source.html b/doc/api/html/validate__less_8hpp_source.html new file mode 100644 index 00000000000..1a6283405cf --- /dev/null +++ b/doc/api/html/validate__less_8hpp_source.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/matrix/validate_less.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
validate_less.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__VALIDATE_LESS_HPP__
+
2 #define __STAN__MATH__MATRIX__VALIDATE_LESS_HPP__
+
3 
+
4 #include <sstream>
+
5 #include <stdexcept>
+
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
10  template <typename T1, typename T2>
+
11  inline
+
12  void validate_less(const T1& x, const T2& y,
+
13  const char* x_name, const char* y_name,
+
14  const char* fun_name) {
+
15  if (x < y) return;
+
16  std::stringstream ss;
+
17  ss << "require " << x_name << " < " << y_name
+
18  << " in " << fun_name
+
19  << "; found " << x_name << "=" << x
+
20  << ", " << y_name << "=" << y;
+
21  throw std::domain_error(ss.str());
+
22  }
+
23 
+
24  }
+
25 }
+
26 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/validate__less__or__equal_8hpp.html b/doc/api/html/validate__less__or__equal_8hpp.html new file mode 100644 index 00000000000..f2c51f62f70 --- /dev/null +++ b/doc/api/html/validate__less__or__equal_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/matrix/validate_less_or_equal.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
validate_less_or_equal.hpp File Reference
+
+
+
#include <sstream>
+#include <stdexcept>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T1 , typename T2 >
void stan::math::validate_less_or_equal (const T1 &x, const T2 &y, const char *x_name, const char *y_name, const char *fun_name)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/validate__less__or__equal_8hpp_source.html b/doc/api/html/validate__less__or__equal_8hpp_source.html new file mode 100644 index 00000000000..6027be2e1a4 --- /dev/null +++ b/doc/api/html/validate__less__or__equal_8hpp_source.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/matrix/validate_less_or_equal.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
validate_less_or_equal.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__VALIDATE_LESS_OR_EQUAL_HPP__
+
2 #define __STAN__MATH__MATRIX__VALIDATE_LESS_OR_EQUAL_HPP__
+
3 
+
4 #include <sstream>
+
5 #include <stdexcept>
+
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
10  template <typename T1, typename T2>
+
11  inline
+
12  void validate_less_or_equal(const T1& x, const T2& y,
+
13  const char* x_name, const char* y_name,
+
14  const char* fun_name) {
+
15  if (x <= y) return;
+
16  std::stringstream ss;
+
17  ss << "require " << x_name << " <= " << y_name
+
18  << " in " << fun_name
+
19  << "; found " << x_name << "=" << x
+
20  << ", " << y_name << "=" << y;
+
21  throw std::domain_error(ss.str());
+
22  }
+
23 
+
24  }
+
25 }
+
26 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/validate__matching__dims_8hpp.html b/doc/api/html/validate__matching__dims_8hpp.html new file mode 100644 index 00000000000..0921adc2a29 --- /dev/null +++ b/doc/api/html/validate__matching__dims_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/math/matrix/validate_matching_dims.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
validate_matching_dims.hpp File Reference
+
+
+
#include <sstream>
+#include <stdexcept>
+#include <stan/math/matrix/Eigen.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T1 , int R1, int C1, typename T2 , int R2, int C2>
void stan::math::validate_matching_dims (const Eigen::Matrix< T1, R1, C1 > &x1, const Eigen::Matrix< T2, R2, C2 > &x2, const char *msg)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/validate__matching__dims_8hpp_source.html b/doc/api/html/validate__matching__dims_8hpp_source.html new file mode 100644 index 00000000000..3647e440fd8 --- /dev/null +++ b/doc/api/html/validate__matching__dims_8hpp_source.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/math/matrix/validate_matching_dims.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
validate_matching_dims.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__VALIDATE_MATCHING_DIMS_HPP__
+
2 #define __STAN__MATH__MATRIX__VALIDATE_MATCHING_DIMS_HPP__
+
3 
+
4 #include <sstream>
+
5 #include <stdexcept>
+ +
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
11  template <typename T1, int R1, int C1, typename T2, int R2, int C2>
+
12  inline void validate_matching_dims(const Eigen::Matrix<T1,R1,C1>& x1,
+
13  const Eigen::Matrix<T2,R2,C2>& x2,
+
14  const char* msg) {
+
15  if (x1.rows() == x2.rows()
+
16  && x1.cols() == x2.cols()) return;
+
17  std::stringstream ss;
+
18  ss << "error in call to " << msg
+
19  << "; require matching dimensions, but found"
+
20  << " arg1(rows=" << x1.rows() << ",cols=" << x1.cols() << ");"
+
21  << " arg2(rows=" << x2.rows() << ",cols=" << x2.cols() << ")";
+
22  throw std::domain_error(ss.str());
+
23  }
+
24 
+
25  }
+
26 }
+
27 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/validate__matching__sizes_8hpp.html b/doc/api/html/validate__matching__sizes_8hpp.html new file mode 100644 index 00000000000..7e5baa344ae --- /dev/null +++ b/doc/api/html/validate__matching__sizes_8hpp.html @@ -0,0 +1,144 @@ + + + + + +Stan: src/stan/math/matrix/validate_matching_sizes.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
validate_matching_sizes.hpp File Reference
+
+
+
#include <sstream>
+#include <stdexcept>
+#include <vector>
+#include <stan/math/matrix/Eigen.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + + + + + + + + + + + + + +

+Functions

template<typename T1 , typename T2 >
void stan::math::validate_matching_sizes (const std::vector< T1 > &x1, const std::vector< T2 > &x2, const char *msg)
 
template<typename T1 , int R1, int C1, typename T2 , int R2, int C2>
void stan::math::validate_matching_sizes (const Eigen::Matrix< T1, R1, C1 > &x1, const Eigen::Matrix< T2, R2, C2 > &x2, const char *msg)
 
template<typename Derived , typename T2 , int R2, int C2>
void stan::math::validate_matching_sizes (const Eigen::Block< Derived > &x1, const Eigen::Matrix< T2, R2, C2 > &x2, const char *msg)
 
template<typename T1 , int R1, int C1, typename Derived >
void stan::math::validate_matching_sizes (const Eigen::Matrix< T1, R1, C1 > &x1, const Eigen::Block< Derived > &x2, const char *msg)
 
template<typename Derived1 , typename Derived2 >
void stan::math::validate_matching_sizes (const Eigen::Block< Derived1 > &x1, const Eigen::Block< Derived2 > &x2, const char *msg)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/validate__matching__sizes_8hpp_source.html b/doc/api/html/validate__matching__sizes_8hpp_source.html new file mode 100644 index 00000000000..8fc9cc4b624 --- /dev/null +++ b/doc/api/html/validate__matching__sizes_8hpp_source.html @@ -0,0 +1,194 @@ + + + + + +Stan: src/stan/math/matrix/validate_matching_sizes.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
validate_matching_sizes.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__VALIDATE_MATCHING_SIZES_HPP__
+
2 #define __STAN__MATH__MATRIX__VALIDATE_MATCHING_SIZES_HPP__
+
3 
+
4 #include <sstream>
+
5 #include <stdexcept>
+
6 #include <vector>
+ +
8 
+
9 namespace stan {
+
10  namespace math {
+
11 
+
12  template <typename T1, typename T2>
+
13  inline void validate_matching_sizes(const std::vector<T1>& x1,
+
14  const std::vector<T2>& x2,
+
15  const char* msg) {
+
16  if (x1.size() == x2.size()) return;
+
17  std::stringstream ss;
+
18  ss << "error in call to " << msg
+
19  << "; require matching sizes, but found"
+
20  << " arg1(size=" << x1.size() << ");"
+
21  << " arg2(size=" << x2.size() << ");";
+
22  throw std::domain_error(ss.str());
+
23  }
+
24 
+
25  template <typename T1, int R1, int C1, typename T2, int R2, int C2>
+
26  inline void validate_matching_sizes(const Eigen::Matrix<T1,R1,C1>& x1,
+
27  const Eigen::Matrix<T2,R2,C2>& x2,
+
28  const char* msg) {
+
29  if (x1.size() == x2.size()) return;
+
30  std::stringstream ss;
+
31  ss << "error in call to " << msg
+
32  << "; require matching sizes, but found"
+
33  << " arg1(rows=" << x1.rows() << ",cols=" << x1.cols()
+
34  << ",size=" << (x1.rows() * x1.cols()) << ");"
+
35  << " arg2(rows=" << x2.rows() << ",cols=" << x2.cols()
+
36  << ",size=" << (x2.rows() * x2.cols()) << ")";
+
37  throw std::domain_error(ss.str());
+
38  }
+
39 
+
40  template <typename Derived, typename T2, int R2, int C2>
+
41  inline void validate_matching_sizes(const Eigen::Block<Derived>& x1,
+
42  const Eigen::Matrix<T2,R2,C2>& x2,
+
43  const char* msg) {
+
44  if (x1.size() == x2.size()) return;
+
45  std::stringstream ss;
+
46  ss << "error in call to " << msg
+
47  << "; require matching sizes, but found"
+
48  << " arg1(rows=" << x1.rows() << ",cols=" << x1.cols()
+
49  << ",size=" << (x1.rows() * x1.cols()) << ");"
+
50  << " arg2(rows=" << x2.rows() << ",cols=" << x2.cols()
+
51  << ",size=" << (x2.rows() * x2.cols()) << ")";
+
52  throw std::domain_error(ss.str());
+
53  }
+
54 
+
55  template <typename T1, int R1, int C1, typename Derived>
+
56  inline void validate_matching_sizes(const Eigen::Matrix<T1,R1,C1>& x1,
+
57  const Eigen::Block<Derived>& x2,
+
58  const char* msg) {
+
59  if (x1.size() == x2.size()) return;
+
60  std::stringstream ss;
+
61  ss << "error in call to " << msg
+
62  << "; require matching sizes, but found"
+
63  << " arg1(rows=" << x1.rows() << ",cols=" << x1.cols()
+
64  << ",size=" << (x1.rows() * x1.cols()) << ");"
+
65  << " arg2(rows=" << x2.rows() << ",cols=" << x2.cols()
+
66  << ",size=" << (x2.rows() * x2.cols()) << ")";
+
67  throw std::domain_error(ss.str());
+
68  }
+
69 
+
70  template <typename Derived1, typename Derived2>
+
71  inline void validate_matching_sizes(const Eigen::Block<Derived1>& x1,
+
72  const Eigen::Block<Derived2>& x2,
+
73  const char* msg) {
+
74  if (x1.size() == x2.size()) return;
+
75  std::stringstream ss;
+
76  ss << "error in call to " << msg
+
77  << "; require matching sizes, but found"
+
78  << " arg1(rows=" << x1.rows() << ",cols=" << x1.cols()
+
79  << ",size=" << (x1.rows() * x1.cols()) << ");"
+
80  << " arg2(rows=" << x2.rows() << ",cols=" << x2.cols()
+
81  << ",size=" << (x2.rows() * x2.cols()) << ")";
+
82  throw std::domain_error(ss.str());
+
83  }
+
84 
+
85  }
+
86 }
+
87 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/validate__multiplicable_8hpp.html b/doc/api/html/validate__multiplicable_8hpp.html new file mode 100644 index 00000000000..ffc2d7ab81c --- /dev/null +++ b/doc/api/html/validate__multiplicable_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/math/matrix/validate_multiplicable.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
validate_multiplicable.hpp File Reference
+
+
+
#include <sstream>
+#include <stdexcept>
+#include <stan/math/matrix/Eigen.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T1 , typename T2 >
void stan::math::validate_multiplicable (const T1 &x1, const T2 &x2, const char *msg)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/validate__multiplicable_8hpp_source.html b/doc/api/html/validate__multiplicable_8hpp_source.html new file mode 100644 index 00000000000..c4032fe5fb1 --- /dev/null +++ b/doc/api/html/validate__multiplicable_8hpp_source.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/math/matrix/validate_multiplicable.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
validate_multiplicable.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__VALIDATE_MULTIPLICABLE_HPP__
+
2 #define __STAN__MATH__MATRIX__VALIDATE_MULTIPLICABLE_HPP__
+
3 
+
4 #include <sstream>
+
5 #include <stdexcept>
+ +
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
11  template <typename T1, typename T2>
+
12  inline void validate_multiplicable(const T1& x1,
+
13  const T2& x2,
+
14  const char* msg) {
+
15  if (x1.cols() == static_cast<typename T1::size_type>(x2.rows()))
+
16  return;
+
17  std::stringstream ss;
+
18  ss << "error in call to " << msg
+
19  << "; require cols of arg1 to match rows of arg2, but found "
+
20  << " arg1 rows=" << x1.rows() << " arg1 cols=" << x1.cols()
+
21  << " arg2 rows=" << x2.rows() << " arg2 cols=" << x2.cols();
+
22  throw std::domain_error(ss.str());
+
23  }
+
24 
+
25  }
+
26 }
+
27 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/validate__non__negative__index_8hpp.html b/doc/api/html/validate__non__negative__index_8hpp.html new file mode 100644 index 00000000000..f13e03d4952 --- /dev/null +++ b/doc/api/html/validate__non__negative__index_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/math/error_handling/matrix/validate_non_negative_index.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
validate_non_negative_index.hpp File Reference
+
+
+
#include <sstream>
+#include <stdexcept>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + +

+Functions

void stan::math::validate_non_negative_index (const std::string &var_name, const std::string &expr, int val)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/validate__non__negative__index_8hpp_source.html b/doc/api/html/validate__non__negative__index_8hpp_source.html new file mode 100644 index 00000000000..f38fffbe6cf --- /dev/null +++ b/doc/api/html/validate__non__negative__index_8hpp_source.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/math/error_handling/matrix/validate_non_negative_index.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
validate_non_negative_index.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__ERROR_HANDLING__MATRIX__VALIDATE_NON_NEGATIVE_INDEX_HPP__
+
2 #define __STAN__MATH__ERROR_HANDLING__MATRIX__VALIDATE_NON_NEGATIVE_INDEX_HPP__
+
3 
+
4 #include <sstream>
+
5 #include <stdexcept>
+
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
10  inline
+
11  void
+
12  validate_non_negative_index(const std::string& var_name,
+
13  const std::string& expr,
+
14  int val) {
+
15  if (val < 0) {
+
16  std::stringstream msg;
+
17  msg << "Found negative dimension size in variable declaration"
+
18  << "; variable=" << var_name
+
19  << "; dimension size expression=" << expr
+
20  << "; expression value=" << val;
+
21  throw std::invalid_argument(msg.str());
+
22  }
+
23  }
+
24 
+
25  }
+
26 }
+
27 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/validate__non__negative__rep_8hpp.html b/doc/api/html/validate__non__negative__rep_8hpp.html new file mode 100644 index 00000000000..aab06a46824 --- /dev/null +++ b/doc/api/html/validate__non__negative__rep_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/math/validate_non_negative_rep.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
validate_non_negative_rep.hpp File Reference
+
+
+
#include <stdexcept>
+#include <sstream>
+#include <string>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

void stan::math::validate_non_negative_rep (int n, const std::string &fun)
 If argument is negative, throw a domain error indicating the function with the specified name.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/validate__non__negative__rep_8hpp_source.html b/doc/api/html/validate__non__negative__rep_8hpp_source.html new file mode 100644 index 00000000000..149f1aa14e6 --- /dev/null +++ b/doc/api/html/validate__non__negative__rep_8hpp_source.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/math/validate_non_negative_rep.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
validate_non_negative_rep.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__VALIDATE_NON_NEGATIVE_REP_HPP__
+
2 #define __STAN__MATH__VALIDATE_NON_NEGATIVE_REP_HPP__
+
3 
+
4 #include <stdexcept>
+
5 #include <sstream>
+
6 #include <string>
+
7 
+
8 namespace stan {
+
9 
+
10  namespace math {
+
11 
+
20  inline void validate_non_negative_rep(int n, const std::string& fun) {
+
21  if (n >= 0) return;
+
22  std::stringstream msg;
+
23  msg << "error in " << fun
+
24  << "; number of replications must be positive"
+
25  << "; found n=" << n;
+
26  throw std::domain_error(msg.str());
+
27  }
+
28 
+
29  }
+
30 }
+
31 
+
32 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/validate__nonzero__size_8hpp.html b/doc/api/html/validate__nonzero__size_8hpp.html new file mode 100644 index 00000000000..d084fe2c98b --- /dev/null +++ b/doc/api/html/validate__nonzero__size_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/math/matrix/validate_nonzero_size.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
validate_nonzero_size.hpp File Reference
+
+
+
#include <sstream>
+#include <stdexcept>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T >
void stan::math::validate_nonzero_size (const T &x, const char *msg)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/validate__nonzero__size_8hpp_source.html b/doc/api/html/validate__nonzero__size_8hpp_source.html new file mode 100644 index 00000000000..cff2b9b86e6 --- /dev/null +++ b/doc/api/html/validate__nonzero__size_8hpp_source.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/math/matrix/validate_nonzero_size.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
validate_nonzero_size.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__VALIDATE_NONZERO_SIZE_HPP__
+
2 #define __STAN__MATH__MATRIX__VALIDATE_NONZERO_SIZE_HPP__
+
3 
+
4 #include <sstream>
+
5 #include <stdexcept>
+
6 
+
7 namespace stan {
+
8  namespace math {
+
9 
+
10  template <typename T>
+
11  inline void validate_nonzero_size(const T& x, const char* msg) {
+
12  if (x.size() > 0) return;
+
13  std::stringstream ss;
+
14  ss << "require non-zero size for " << msg
+
15  << "found size=" << x.size();
+
16  throw std::domain_error(ss.str());
+
17  }
+
18 
+
19  }
+
20 }
+
21 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/validate__row__index_8hpp.html b/doc/api/html/validate__row__index_8hpp.html new file mode 100644 index 00000000000..44a63c0b451 --- /dev/null +++ b/doc/api/html/validate__row__index_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/math/matrix/validate_row_index.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
validate_row_index.hpp File Reference
+
+
+
#include <sstream>
+#include <stdexcept>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/validate_square.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T , int R, int C>
void stan::math::validate_row_index (const Eigen::Matrix< T, R, C > &m, size_t i, const char *msg)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/validate__row__index_8hpp_source.html b/doc/api/html/validate__row__index_8hpp_source.html new file mode 100644 index 00000000000..8cf9c829268 --- /dev/null +++ b/doc/api/html/validate__row__index_8hpp_source.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/matrix/validate_row_index.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
validate_row_index.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__VALIDATE_ROW_INDEX_HPP__
+
2 #define __STAN__MATH__MATRIX__VALIDATE_ROW_INDEX_HPP__
+
3 
+
4 #include <sstream>
+
5 #include <stdexcept>
+ + +
8 
+
9 namespace stan {
+
10  namespace math {
+
11 
+
12  template <typename T, int R, int C>
+
13  void validate_row_index(const Eigen::Matrix<T,R,C>& m,
+
14  size_t i,
+
15  const char* msg) {
+
16  if (i > 0 && i <= static_cast<size_t>(m.rows())) return;
+
17  std::stringstream ss;
+
18  ss << "require 0 < row index <= number of rows in " << msg;
+
19  ss << " found rows()=" << m.rows()
+
20  << "; index i=" << i;
+
21  throw std::domain_error(ss.str());
+
22  }
+
23 
+
24  }
+
25 }
+
26 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/validate__square_8hpp.html b/doc/api/html/validate__square_8hpp.html new file mode 100644 index 00000000000..5b2a7c2dd0c --- /dev/null +++ b/doc/api/html/validate__square_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/math/matrix/validate_square.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
validate_square.hpp File Reference
+
+
+
#include <sstream>
+#include <stdexcept>
+#include <stan/math/matrix/Eigen.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T , int R, int C>
void stan::math::validate_square (const Eigen::Matrix< T, R, C > &x, const char *msg)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/validate__square_8hpp_source.html b/doc/api/html/validate__square_8hpp_source.html new file mode 100644 index 00000000000..5c820b1a049 --- /dev/null +++ b/doc/api/html/validate__square_8hpp_source.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/math/matrix/validate_square.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
validate_square.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__VALIDATE_SQUARE_HPP__
+
2 #define __STAN__MATH__MATRIX__VALIDATE_SQUARE_HPP__
+
3 
+
4 #include <sstream>
+
5 #include <stdexcept>
+ +
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
11  template <typename T, int R, int C>
+
12  void validate_square(const Eigen::Matrix<T,R,C>& x,
+
13  const char* msg) {
+
14  if (x.rows() == x.cols()) return;
+
15  std::stringstream ss;
+
16  ss << "error in call to " << msg
+
17  << "; require square matrix, but found"
+
18  << " rows=" << x.rows()
+
19  << "; cols=" << x.cols();
+
20  throw std::domain_error(ss.str());
+
21  }
+
22 
+
23  }
+
24 }
+
25 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/validate__std__vector__index_8hpp.html b/doc/api/html/validate__std__vector__index_8hpp.html new file mode 100644 index 00000000000..a20f6ba964d --- /dev/null +++ b/doc/api/html/validate__std__vector__index_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/math/matrix/validate_std_vector_index.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
validate_std_vector_index.hpp File Reference
+
+
+
#include <sstream>
+#include <stdexcept>
+#include <vector>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T >
void stan::math::validate_std_vector_index (const std::vector< T > &sv, size_t j, const char *msg)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/validate__std__vector__index_8hpp_source.html b/doc/api/html/validate__std__vector__index_8hpp_source.html new file mode 100644 index 00000000000..576c6fb9f22 --- /dev/null +++ b/doc/api/html/validate__std__vector__index_8hpp_source.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/math/matrix/validate_std_vector_index.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
validate_std_vector_index.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__VALIDATE_STD_VECTOR_INDEX_HPP__
+
2 #define __STAN__MATH__MATRIX__VALIDATE_STD_VECTOR_INDEX_HPP__
+
3 
+
4 #include <sstream>
+
5 #include <stdexcept>
+
6 #include <vector>
+
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
11  template <typename T>
+
12  void validate_std_vector_index(const std::vector<T>& sv,
+
13  size_t j,
+
14  const char* msg) {
+
15  if (j > 0 && j <= sv.size()) return;
+
16  std::stringstream ss;
+
17  ss << "require 0 < index <= vector size" << msg;
+
18  ss << "; found vector size=" << sv.size()
+
19  << "; index j=" << j;
+
20  throw std::domain_error(ss.str());
+
21  }
+
22 
+
23  }
+
24 }
+
25 
+
26 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/validate__symmetric_8hpp.html b/doc/api/html/validate__symmetric_8hpp.html new file mode 100644 index 00000000000..63b095de4bc --- /dev/null +++ b/doc/api/html/validate__symmetric_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/math/matrix/validate_symmetric.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
validate_symmetric.hpp File Reference
+
+
+
#include <sstream>
+#include <stdexcept>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/math/matrix/validate_square.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T , int R, int C>
void stan::math::validate_symmetric (const Eigen::Matrix< T, R, C > &x, const char *msg)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/validate__symmetric_8hpp_source.html b/doc/api/html/validate__symmetric_8hpp_source.html new file mode 100644 index 00000000000..3ea804d2ec4 --- /dev/null +++ b/doc/api/html/validate__symmetric_8hpp_source.html @@ -0,0 +1,140 @@ + + + + + +Stan: src/stan/math/matrix/validate_symmetric.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
validate_symmetric.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__VALIDATE_SYMMETRIC_HPP__
+
2 #define __STAN__MATH__MATRIX__VALIDATE_SYMMETRIC_HPP__
+
3 
+
4 #include <sstream>
+
5 #include <stdexcept>
+ + +
8 
+
9 namespace stan {
+
10  namespace math {
+
11 
+
12  template <typename T, int R, int C>
+
13  void validate_symmetric(const Eigen::Matrix<T,R,C>& x,
+
14  const char* msg) {
+
15  // tolerance = 1E-8
+
16  validate_square(x,msg);
+
17  for (int i = 0; i < x.rows(); ++i) {
+
18  for (int j = 0; j < x.cols(); ++j) {
+
19  if (x(i,j) != x(j,i)) {
+
20  std::stringstream ss;
+
21  ss << "error in call to " << msg
+
22  << "; require symmetric matrix, but found"
+
23  << "; x[" << i << "," << j << "]=" << x(i,j)
+
24  << "; x[" << j << "," << i << "]=" << x(j,i);
+
25  throw std::domain_error(ss.str());
+
26  }
+
27  }
+
28  }
+
29  }
+
30 
+
31  }
+
32 }
+
33 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/validate__vector_8hpp.html b/doc/api/html/validate__vector_8hpp.html new file mode 100644 index 00000000000..f0993da607d --- /dev/null +++ b/doc/api/html/validate__vector_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/math/matrix/validate_vector.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
validate_vector.hpp File Reference
+
+
+
#include <sstream>
+#include <stdexcept>
+#include <stan/math/matrix/Eigen.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::math
 Matrices and templated mathematical functions.
 
+ + + + +

+Functions

template<typename T , int R, int C>
void stan::math::validate_vector (const Eigen::Matrix< T, R, C > &x, const char *msg)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/validate__vector_8hpp_source.html b/doc/api/html/validate__vector_8hpp_source.html new file mode 100644 index 00000000000..e97543a0aff --- /dev/null +++ b/doc/api/html/validate__vector_8hpp_source.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/math/matrix/validate_vector.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
validate_vector.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MATH__MATRIX__VALIDATE_VECTOR_HPP__
+
2 #define __STAN__MATH__MATRIX__VALIDATE_VECTOR_HPP__
+
3 
+
4 #include <sstream>
+
5 #include <stdexcept>
+ +
7 
+
8 namespace stan {
+
9  namespace math {
+
10 
+
11  template <typename T, int R, int C>
+
12  inline void validate_vector(const Eigen::Matrix<T,R,C>& x,
+
13  const char* msg) {
+
14  if (x.rows() == 1 || x.cols() == 1) return;
+
15  std::stringstream ss;
+
16  ss << "error in " << msg
+
17  << "; require vector, found "
+
18  << " rows=" << x.rows() << "cols=" << x.cols();
+
19  throw std::domain_error(ss.str());
+
20  }
+
21 
+
22  }
+
23 }
+
24 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/valued__argument_8hpp.html b/doc/api/html/valued__argument_8hpp.html new file mode 100644 index 00000000000..4aaf1abfff2 --- /dev/null +++ b/doc/api/html/valued__argument_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/arguments/valued_argument.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
valued_argument.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::gm::valued_argument
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/valued__argument_8hpp_source.html b/doc/api/html/valued__argument_8hpp_source.html new file mode 100644 index 00000000000..72d6d031e1d --- /dev/null +++ b/doc/api/html/valued__argument_8hpp_source.html @@ -0,0 +1,161 @@ + + + + + +Stan: src/stan/gm/arguments/valued_argument.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
valued_argument.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__ARGUMENTS__VALUED__ARGUMENT__BETA__
+
2 #define __STAN__GM__ARGUMENTS__VALUED__ARGUMENT__BETA__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+
10  class valued_argument: public argument {
+
11 
+
12  public:
+
13 
+
14  virtual void print(std::ostream* s, const int depth, const char prefix) {
+
15  if (!s)
+
16  return;
+
17 
+
18  std::string indent(compute_indent(depth), ' ');
+
19 
+
20  *s << prefix << indent << _name << " = " << print_value();
+
21  if(is_default())
+
22  *s << " (Default)";
+
23  *s << std::endl;
+
24  }
+
25 
+
26  virtual void print_help(std::ostream* s, const int depth, const bool recurse = false) {
+
27  if (!s)
+
28  return;
+
29 
+
30  std::string indent(indent_width * depth, ' ');
+
31  std::string subindent(indent_width, ' ');
+
32 
+
33  *s << indent << _name << "=<" << _value_type << ">" << std::endl;
+
34  *s << indent << subindent << _description << std::endl;
+
35  *s << indent << subindent << "Valid values:" << print_valid() << std::endl;
+
36  *s << indent << subindent << "Defaults to " << _default << std::endl;
+
37  *s << std::endl;
+
38 
+
39  }
+
40 
+
41  virtual std::string print_value() = 0;
+
42  virtual std::string print_valid() = 0;
+
43  virtual bool is_default() = 0;
+
44 
+
45  protected:
+
46 
+
47  std::string _default;
+
48  std::string _value_type;
+
49 
+
50  };
+
51 
+
52  } // gm
+
53 } // stan
+
54 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/var_8hpp.html b/doc/api/html/var_8hpp.html new file mode 100644 index 00000000000..1ee7d92589f --- /dev/null +++ b/doc/api/html/var_8hpp.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/agrad/rev/var.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
var.hpp File Reference
+
+
+
#include <ostream>
+#include <stan/math/matrix/Eigen.hpp>
+#include <stan/agrad/rev/vari.hpp>
+
+

Go to the source code of this file.

+ + + + + +

+Classes

class  stan::agrad::var
 Independent (input) and dependent (output) variables for gradients. More...
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + +

+Functions

static void stan::agrad::recover_memory ()
 
static void stan::agrad::grad (chainable *vi)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/var_8hpp_source.html b/doc/api/html/var_8hpp_source.html new file mode 100644 index 00000000000..66e07008c1d --- /dev/null +++ b/doc/api/html/var_8hpp_source.html @@ -0,0 +1,253 @@ + + + + + +Stan: src/stan/agrad/rev/var.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
var.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__VAR_HPP__
+
2 #define __STAN__AGRAD__REV__VAR_HPP__
+
3 
+
4 #include <ostream>
+ + +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  // forward declare
+
12  static void recover_memory();
+
13  static void grad(chainable* vi);
+
14 
+
28  class var {
+
29  public:
+
30 
+
31  // FIXME: doc what this is for
+
32  typedef double Scalar;
+
33 
+
41  vari * vi_;
+
42 
+ +
53  return (vi_ == static_cast<vari*>(0U));
+
54  }
+
55 
+
61  explicit var(vari* vi)
+
62  : vi_(vi)
+
63  { }
+
64 
+
72  var()
+
73  : vi_(static_cast<vari*>(0U))
+
74  { }
+
75 
+
82  var(bool b) :
+
83  vi_(new vari(static_cast<double>(b))) {
+
84  }
+
85 
+
92  var(char c) :
+
93  vi_(new vari(static_cast<double>(c))) {
+
94  }
+
95 
+
102  var(short n) :
+
103  vi_(new vari(static_cast<double>(n))) {
+
104  }
+
105 
+
112  var(unsigned short n) :
+
113  vi_(new vari(static_cast<double>(n))) {
+
114  }
+
115 
+
122  var(int n) :
+
123  vi_(new vari(static_cast<double>(n))) {
+
124  }
+
125 
+
132  var(unsigned int n) :
+
133  vi_(new vari(static_cast<double>(n))) {
+
134  }
+
135 
+
142  var(long int n) :
+
143  vi_(new vari(static_cast<double>(n))) {
+
144  }
+
145 
+
152  var(unsigned long int n) :
+
153  vi_(new vari(static_cast<double>(n))) {
+
154  }
+
155 
+
162  var(unsigned long long n) :
+
163  vi_(new vari(static_cast<double>(n))) {
+
164  }
+
165 
+
172  var(long long n) :
+
173  vi_(new vari(static_cast<double>(n))) {
+
174  }
+
175 
+
182  var(float x) :
+
183  vi_(new vari(static_cast<double>(x))) {
+
184  }
+
185 
+
191  var(double x) :
+
192  vi_(new vari(x)) {
+
193  }
+
194 
+
201  var(long double x) :
+
202  vi_(new vari(static_cast<double>(x))) {
+
203  }
+
204 
+
210  inline double val() const {
+
211  return vi_->val_;
+
212  }
+
213 
+
222  inline double adj() const {
+
223  return vi_->adj_;
+
224  }
+
225 
+
238  void grad(std::vector<var>& x,
+
239  std::vector<double>& g) {
+ +
241  g.resize(x.size());
+
242  for (size_t i = 0; i < x.size(); ++i)
+
243  g[i] = x[i].vi_->adj_;
+
244  recover_memory();
+
245  }
+
246 
+
263  void grad() {
+ +
265  recover_memory();
+
266  }
+
267 
+
268  // POINTER OVERRIDES
+
269 
+
282  inline vari& operator*() {
+
283  return *vi_;
+
284  }
+
285 
+
296  inline vari* operator->() {
+
297  return vi_;
+
298  }
+
299 
+
300  // COMPOUND ASSIGNMENT OPERATORS
+
301 
+
312  inline var& operator+=(const var& b);
+
313 
+
324  inline var& operator+=(const double b);
+
325 
+
337  inline var& operator-=(const var& b);
+
338 
+
350  inline var& operator-=(const double b);
+
351 
+
363  inline var& operator*=(const var& b);
+
364 
+
376  inline var& operator*=(const double b);
+
377 
+
388  inline var& operator/=(const var& b);
+
389 
+
401  inline var& operator/=(const double b);
+
402 
+
411  friend std::ostream& operator<<(std::ostream& os, const var& v) {
+
412  if (v.vi_ == 0)
+
413  return os << "uninitialized";
+
414  return os << v.val() << ':' << v.adj();
+
415  }
+
416  };
+
417 
+
418  }
+
419 }
+
420 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/var__adaptation_8hpp.html b/doc/api/html/var__adaptation_8hpp.html new file mode 100644 index 00000000000..183fd576206 --- /dev/null +++ b/doc/api/html/var__adaptation_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/mcmc/var_adaptation.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
var_adaptation.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::var_adaptation
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/var__adaptation_8hpp_source.html b/doc/api/html/var__adaptation_8hpp_source.html new file mode 100644 index 00000000000..5e4c371855c --- /dev/null +++ b/doc/api/html/var__adaptation_8hpp_source.html @@ -0,0 +1,163 @@ + + + + + +Stan: src/stan/mcmc/var_adaptation.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
var_adaptation.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__VAR__ADAPTATION__BETA__
+
2 #define __STAN__MCMC__VAR__ADAPTATION__BETA__
+
3 
+
4 #include <vector>
+ +
6 
+ + +
9 
+
10 namespace stan {
+
11 
+
12  namespace mcmc {
+
13 
+ +
15 
+
16  public:
+
17 
+
18  var_adaptation(int n): windowed_adaptation("variance"), _estimator(n) {}
+
19 
+
20  bool learn_variance(Eigen::VectorXd& var, const Eigen::VectorXd& q) {
+
21 
+ +
23 
+
24  if (end_adaptation_window()) {
+
25 
+ +
27 
+ +
29 
+
30  double n = static_cast<double>(_estimator.num_samples());
+
31  var = (n / (n + 5.0)) * var
+
32  + 1e-3 * (5.0 / (n + 5.0)) * Eigen::VectorXd::Ones(var.size());
+
33 
+ +
35 
+ +
37  return true;
+
38 
+
39  }
+
40 
+ +
42  return false;
+
43 
+
44  }
+
45 
+
46  protected:
+
47 
+ +
49 
+
50  };
+
51 
+
52  } // mcmc
+
53 
+
54 } // stan
+
55 
+
56 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/var__context_8hpp.html b/doc/api/html/var__context_8hpp.html new file mode 100644 index 00000000000..c932f1b21ea --- /dev/null +++ b/doc/api/html/var__context_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/io/var_context.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
var_context.hpp File Reference
+
+
+
#include <sstream>
+#include <stdexcept>
+#include <string>
+#include <vector>
+
+

Go to the source code of this file.

+ + + + + +

+Classes

class  stan::io::var_context
 A var_reader reads array variables of integer and floating point type by name and dimension. More...
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::io
 Input/output utilities.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/var__context_8hpp_source.html b/doc/api/html/var__context_8hpp_source.html new file mode 100644 index 00000000000..f0b0169446b --- /dev/null +++ b/doc/api/html/var__context_8hpp_source.html @@ -0,0 +1,294 @@ + + + + + +Stan: src/stan/io/var_context.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
var_context.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__IO__VAR_CONTEXT_HPP__
+
2 #define __STAN__IO__VAR_CONTEXT_HPP__
+
3 
+
4 #include <sstream>
+
5 #include <stdexcept>
+
6 #include <string>
+
7 #include <vector>
+
8 
+
9 namespace stan {
+
10 
+
11  namespace io {
+
12 
+
29  class var_context {
+
30  public:
+
31 
+
41  virtual bool contains_r(const std::string& name) const = 0;
+
42 
+
55  virtual std::vector<double> vals_r(const std::string& name) const = 0;
+
56 
+
65  virtual std::vector<size_t> dims_r(const std::string& name) const = 0;
+
66 
+
75  virtual bool contains_i(const std::string& name) const = 0;
+
76 
+
85  virtual std::vector<int> vals_i(const std::string& name) const = 0;
+
86 
+
95  virtual std::vector<size_t> dims_i(const std::string& name) const = 0;
+
96 
+
103  virtual void names_r(std::vector<std::string>& names) const = 0;
+
104 
+
111  virtual void names_i(std::vector<std::string>& names) const = 0;
+
112 
+
113  void add_vec(std::stringstream& msg,
+
114  const std::vector<size_t>& dims) const {
+
115  msg << '(';
+
116  for (size_t i = 0; i < dims.size(); ++i) {
+
117  if (i > 0) msg << ',';
+
118  msg << dims[i];
+
119  }
+
120  msg << ')';
+
121  }
+
122 
+
123  void validate_dims(const std::string& stage,
+
124  const std::string& name,
+
125  const std::string& base_type,
+
126  const std::vector<size_t>& dims_declared) const {
+
127  bool is_int_type = base_type == "int";
+
128  if (is_int_type) {
+
129  if (!contains_i(name)) {
+
130  std::stringstream msg;
+
131  msg << (contains_r(name)
+
132  ? "int variable contained non-int values"
+
133  : "variable does not exist" )
+
134  << "; processing stage=" << stage
+
135  << "; variable name=" << name
+
136  << "; base type=" << base_type;
+
137  throw std::runtime_error(msg.str());
+
138  }
+
139  } else {
+
140  if (!contains_r(name)) {
+
141  std::stringstream msg;
+
142  msg << "variable does not exist"
+
143  << "; processing stage=" << stage
+
144  << "; variable name=" << name
+
145  << "; base type=" << base_type;
+
146  throw std::runtime_error(msg.str());
+
147  }
+
148  }
+
149  std::vector<size_t> dims = dims_r(name);
+
150  if (dims.size() != dims_declared.size()) {
+
151  std::stringstream msg;
+
152  msg << "mismatch in number dimensions declared and found in context"
+
153  << "; processing stage=" << stage
+
154  << "; variable name=" << name
+
155  << "; dims declared=";
+
156  add_vec(msg,dims_declared);
+
157  msg << "; dims found=";
+
158  add_vec(msg,dims);
+
159  throw std::runtime_error(msg.str());
+
160  }
+
161  for (size_t i = 0; i < dims.size(); ++i) {
+
162  if (dims_declared[i] != dims[i]) {
+
163  std::stringstream msg;
+
164  msg << "mismatch in dimension declared and found in context"
+
165  << "; processing stage=" << stage
+
166  << "; variable name=" << name
+
167  << "; position="
+
168  << i
+
169  << "; dims declared=";
+
170  add_vec(msg,dims_declared);
+
171  msg << "; dims found=";
+
172  add_vec(msg,dims);
+
173  throw std::runtime_error(msg.str());
+
174  }
+
175  }
+
176  }
+
177 
+
178  static std::vector<size_t> to_vec() {
+
179  return std::vector<size_t>();
+
180  }
+
181  static std::vector<size_t> to_vec(size_t n1) {
+
182  std::vector<size_t> v(1);
+
183  v[0] = n1;
+
184  return v;
+
185  }
+
186  static std::vector<size_t> to_vec(size_t n1, size_t n2) {
+
187  std::vector<size_t> v(2);
+
188  v[0] = n1;
+
189  v[1] = n2;
+
190  return v;
+
191  }
+
192  static std::vector<size_t> to_vec(size_t n1, size_t n2,
+
193  size_t n3) {
+
194  std::vector<size_t> v(3);
+
195  v[0] = n1;
+
196  v[1] = n2;
+
197  v[2] = n3;
+
198  return v;
+
199  }
+
200  static std::vector<size_t> to_vec(size_t n1, size_t n2,
+
201  size_t n3, size_t n4) {
+
202  std::vector<size_t> v(4);
+
203  v[0] = n1;
+
204  v[1] = n2;
+
205  v[2] = n3;
+
206  v[3] = n4;
+
207  return v;
+
208  }
+
209  static std::vector<size_t> to_vec(size_t n1, size_t n2,
+
210  size_t n3, size_t n4,
+
211  size_t n5) {
+
212  std::vector<size_t> v(5);
+
213  v[0] = n1;
+
214  v[1] = n2;
+
215  v[2] = n3;
+
216  v[3] = n4;
+
217  v[4] = n5;
+
218  return v;
+
219  }
+
220  static std::vector<size_t> to_vec(size_t n1, size_t n2,
+
221  size_t n3, size_t n4,
+
222  size_t n5, size_t n6) {
+
223  std::vector<size_t> v(6);
+
224  v[0] = n1;
+
225  v[1] = n2;
+
226  v[2] = n3;
+
227  v[3] = n4;
+
228  v[4] = n5;
+
229  v[5] = n6;
+
230  return v;
+
231  }
+
232  static std::vector<size_t> to_vec(size_t n1, size_t n2,
+
233  size_t n3, size_t n4,
+
234  size_t n5, size_t n6,
+
235  size_t n7) {
+
236  std::vector<size_t> v(7);
+
237  v[0] = n1;
+
238  v[1] = n2;
+
239  v[2] = n3;
+
240  v[3] = n4;
+
241  v[4] = n5;
+
242  v[5] = n6;
+
243  v[6] = n7;
+
244  return v;
+
245  }
+
246  static std::vector<size_t> to_vec(size_t n1, size_t n2,
+
247  size_t n3, size_t n4,
+
248  size_t n5, size_t n6,
+
249  size_t n7, size_t n8) {
+
250  std::vector<size_t> v(8);
+
251  v[0] = n1;
+
252  v[1] = n2;
+
253  v[2] = n3;
+
254  v[3] = n4;
+
255  v[4] = n5;
+
256  v[5] = n6;
+
257  v[6] = n7;
+
258  v[7] = n8;
+
259  return v;
+
260  }
+
261  };
+
262 
+
263 
+
264  }
+
265 
+
266 }
+
267 
+
268 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/var__decls__grammar_8hpp.html b/doc/api/html/var__decls__grammar_8hpp.html new file mode 100644 index 00000000000..819a2d7299e --- /dev/null +++ b/doc/api/html/var__decls__grammar_8hpp.html @@ -0,0 +1,134 @@ + + + + + +Stan: src/stan/gm/grammars/var_decls_grammar.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
var_decls_grammar.hpp File Reference
+
+
+
#include <string>
+#include <sstream>
+#include <vector>
+#include <boost/spirit/include/qi.hpp>
+#include <stan/gm/ast.hpp>
+#include <stan/gm/grammars/whitespace_grammar.hpp>
+#include <stan/gm/grammars/expression_grammar.hpp>
+
+

Go to the source code of this file.

+ + + + +

+Classes

struct  stan::gm::var_decls_grammar< Iterator >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/var__decls__grammar_8hpp_source.html b/doc/api/html/var__decls__grammar_8hpp_source.html new file mode 100644 index 00000000000..c9222db3f36 --- /dev/null +++ b/doc/api/html/var__decls__grammar_8hpp_source.html @@ -0,0 +1,259 @@ + + + + + +Stan: src/stan/gm/grammars/var_decls_grammar.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
var_decls_grammar.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__PARSER__VAR_DECLS_GRAMMAR__HPP__
+
2 #define __STAN__GM__PARSER__VAR_DECLS_GRAMMAR__HPP__
+
3 
+
4 #include <string>
+
5 #include <sstream>
+
6 #include <vector>
+
7 
+
8 #include <boost/spirit/include/qi.hpp>
+
9 
+
10 #include <stan/gm/ast.hpp>
+ + +
13 
+
14 namespace stan {
+
15 
+
16  namespace gm {
+
17 
+
18  template <typename Iterator>
+ +
20  : boost::spirit::qi::grammar<Iterator,
+
21  boost::spirit::qi::locals<bool>,
+
22  std::vector<var_decl>(bool,var_origin),
+
23  whitespace_grammar<Iterator> > {
+
24 
+ +
26  std::stringstream& error_msgs);
+
27 
+
28  // global info for parses
+ +
30  std::stringstream& error_msgs_;
+
31 
+
32  // grammars
+ +
34 
+ +
36 
+
37  // rules
+
38 
+
39  boost::spirit::qi::rule<Iterator,
+ + + +
43 
+
44  boost::spirit::qi::rule<Iterator,
+ + + +
48 
+
49  boost::spirit::qi::rule<Iterator,
+ + + +
53 
+
54  boost::spirit::qi::rule<Iterator,
+
55  std::vector<expression>(var_origin),
+ + +
58 
+
59  boost::spirit::qi::rule<Iterator,
+ + + +
63 
+
64  boost::spirit::qi::rule<Iterator,
+
65  std::string(),
+ + +
68 
+
69  boost::spirit::qi::rule<Iterator,
+
70  std::string(),
+ + +
73 
+
74  boost::spirit::qi::rule<Iterator,
+ + + +
78 
+
79  boost::spirit::qi::rule<Iterator,
+ + + +
83 
+
84  boost::spirit::qi::rule<Iterator,
+
85  std::vector<expression>(var_origin),
+ + +
88 
+
89  boost::spirit::qi::rule<Iterator,
+ + + +
93 
+
94  boost::spirit::qi::rule<Iterator,
+ + + +
98 
+
99  boost::spirit::qi::rule<Iterator,
+
100  range(var_origin),
+ + +
103 
+
104  boost::spirit::qi::rule<Iterator,
+
105  range(var_origin),
+ + +
108 
+
109  boost::spirit::qi::rule<Iterator,
+
110  range(var_origin),
+ + +
113 
+
114  boost::spirit::qi::rule<Iterator,
+ + + +
118 
+
119  boost::spirit::qi::rule<Iterator,
+ + + +
123 
+
124  boost::spirit::qi::rule<Iterator,
+ + + +
128 
+
129  boost::spirit::qi::rule<Iterator,
+ + + +
133 
+
134  boost::spirit::qi::rule<Iterator,
+
135  boost::spirit::qi::locals<bool>,
+
136  var_decl(bool,var_origin),
+ + +
139 
+
140  boost::spirit::qi::rule<Iterator,
+
141  boost::spirit::qi::locals<bool>,
+
142  std::vector<var_decl>(bool,var_origin),
+ + +
145 
+
146 
+
147  };
+
148 
+
149  }
+
150 }
+
151 
+
152 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/var__decls__grammar__def_8hpp.html b/doc/api/html/var__decls__grammar__def_8hpp.html new file mode 100644 index 00000000000..96932642cd6 --- /dev/null +++ b/doc/api/html/var__decls__grammar__def_8hpp.html @@ -0,0 +1,161 @@ + + + + + +Stan: src/stan/gm/grammars/var_decls_grammar_def.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
var_decls_grammar_def.hpp File Reference
+
+
+
#include <boost/spirit/include/qi.hpp>
+#include <boost/spirit/include/phoenix_core.hpp>
+#include <boost/spirit/include/phoenix_function.hpp>
+#include <boost/spirit/include/phoenix_fusion.hpp>
+#include <boost/spirit/include/phoenix_object.hpp>
+#include <boost/spirit/include/phoenix_operator.hpp>
+#include <boost/spirit/include/phoenix_stl.hpp>
+#include <boost/lexical_cast.hpp>
+#include <boost/fusion/include/adapt_struct.hpp>
+#include <boost/fusion/include/std_pair.hpp>
+#include <boost/config/warning_disable.hpp>
+#include <boost/spirit/include/qi_numeric.hpp>
+#include <stan/gm/ast.hpp>
+#include <stan/gm/grammars/var_decls_grammar.hpp>
+#include <stan/gm/grammars/common_adaptors_def.hpp>
+
+

Go to the source code of this file.

+ + + + +

+Functions

 BOOST_FUSION_ADAPT_STRUCT (stan::gm::int_var_decl,(stan::gm::range, range_)(std::string, name_)(std::vector< stan::gm::expression >, dims_)) BOOST_FUSION_ADAPT_STRUCT(stan
 
+

Function Documentation

+ +
+
+ + + + + + + + + + + + + + + + + + +
BOOST_FUSION_ADAPT_STRUCT (stan::gm::int_var_decl ,
(stan::gm::range, range_)(std::string, name_)(std::vector< stan::gm::expression >, dims_)  
)
+
+ +

Definition at line 22 of file var_decls_grammar_def.hpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/var__decls__grammar__def_8hpp_source.html b/doc/api/html/var__decls__grammar__def_8hpp_source.html new file mode 100644 index 00000000000..a57132fd131 --- /dev/null +++ b/doc/api/html/var__decls__grammar__def_8hpp_source.html @@ -0,0 +1,1017 @@ + + + + + +Stan: src/stan/gm/grammars/var_decls_grammar_def.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
var_decls_grammar_def.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__PARSER__VAR_DECLS_GRAMMAR_DEF__HPP__
+
2 #define __STAN__GM__PARSER__VAR_DECLS_GRAMMAR_DEF__HPP__
+
3 
+
4 #include <boost/spirit/include/qi.hpp>
+
5 // FIXME: get rid of unused include
+
6 #include <boost/spirit/include/phoenix_core.hpp>
+
7 #include <boost/spirit/include/phoenix_function.hpp>
+
8 #include <boost/spirit/include/phoenix_fusion.hpp>
+
9 #include <boost/spirit/include/phoenix_object.hpp>
+
10 #include <boost/spirit/include/phoenix_operator.hpp>
+
11 #include <boost/spirit/include/phoenix_stl.hpp>
+
12 
+
13 #include <boost/lexical_cast.hpp>
+
14 #include <boost/fusion/include/adapt_struct.hpp>
+
15 #include <boost/fusion/include/std_pair.hpp>
+
16 #include <boost/config/warning_disable.hpp>
+
17 #include <boost/spirit/include/qi_numeric.hpp>
+
18 #include <stan/gm/ast.hpp>
+ + +
21 
+ +
23  (stan::gm::range, range_)
+
24  (std::string, name_)
+
25  (std::vector<stan::gm::expression>, dims_) )
+
26 
+
27 BOOST_FUSION_ADAPT_STRUCT(stan::gm::double_var_decl,
+
28  (stan::gm::range, range_)
+
29  (std::string, name_)
+
30  (std::vector<stan::gm::expression>, dims_) )
+
31 
+
32 BOOST_FUSION_ADAPT_STRUCT(stan::gm::vector_var_decl,
+
33  (stan::gm::range, range_)
+
34  (stan::gm::expression, M_)
+
35  (std::string, name_)
+
36  (std::vector<stan::gm::expression>, dims_) )
+
37 
+
38 BOOST_FUSION_ADAPT_STRUCT(stan::gm::row_vector_var_decl,
+
39  (stan::gm::range, range_)
+
40  (stan::gm::expression, N_)
+
41  (std::string, name_)
+
42  (std::vector<stan::gm::expression>, dims_) )
+
43 
+
44 BOOST_FUSION_ADAPT_STRUCT(stan::gm::matrix_var_decl,
+
45  (stan::gm::range, range_)
+
46  (stan::gm::expression, M_)
+
47  (stan::gm::expression, N_)
+
48  (std::string, name_)
+
49  (std::vector<stan::gm::expression>, dims_) )
+
50 
+
51 BOOST_FUSION_ADAPT_STRUCT(stan::gm::unit_vector_var_decl,
+
52  (stan::gm::expression, K_)
+
53  (std::string, name_)
+
54  (std::vector<stan::gm::expression>, dims_) )
+
55 
+
56 BOOST_FUSION_ADAPT_STRUCT(stan::gm::simplex_var_decl,
+
57  (stan::gm::expression, K_)
+
58  (std::string, name_)
+
59  (std::vector<stan::gm::expression>, dims_) )
+
60 
+
61 BOOST_FUSION_ADAPT_STRUCT(stan::gm::ordered_var_decl,
+
62  (stan::gm::expression, K_)
+
63  (std::string, name_)
+
64  (std::vector<stan::gm::expression>, dims_) )
+
65 
+
66 BOOST_FUSION_ADAPT_STRUCT(stan::gm::positive_ordered_var_decl,
+
67  (stan::gm::expression, K_)
+
68  (std::string, name_)
+
69  (std::vector<stan::gm::expression>, dims_) )
+
70 
+
71 BOOST_FUSION_ADAPT_STRUCT(stan::gm::cholesky_factor_var_decl,
+
72  (stan::gm::expression, M_)
+
73  (stan::gm::expression, N_)
+
74  (std::string, name_)
+
75  (std::vector<stan::gm::expression>, dims_) )
+
76 
+
77 BOOST_FUSION_ADAPT_STRUCT(stan::gm::cov_matrix_var_decl,
+
78  (stan::gm::expression, K_)
+
79  (std::string, name_)
+
80  (std::vector<stan::gm::expression>, dims_) )
+
81 
+
82 BOOST_FUSION_ADAPT_STRUCT(stan::gm::corr_matrix_var_decl,
+
83  (stan::gm::expression, K_)
+
84  (std::string, name_)
+
85  (std::vector<stan::gm::expression>, dims_) )
+
86 
+
87 namespace stan {
+
88 
+
89  namespace gm {
+
90 
+
91  struct validate_no_constraints_vis : public boost::static_visitor<bool> {
+
92  std::stringstream& error_msgs_;
+
93  validate_no_constraints_vis(std::stringstream& error_msgs)
+
94  : error_msgs_(error_msgs) {
+
95  }
+
96  bool operator()(const nil& /*x*/) const {
+
97  error_msgs_ << "nil declarations not allowed";
+
98  return false; // fail if arises
+
99  }
+
100  bool operator()(const int_var_decl& x) const {
+
101  if (x.range_.has_low() || x.range_.has_high()) {
+
102  error_msgs_ << "require unconstrained."
+
103  << " found range constraint." << std::endl;
+
104  return false;
+
105  }
+
106  return true;
+
107  }
+
108  bool operator()(const double_var_decl& x) const {
+
109  if (x.range_.has_low() || x.range_.has_high()) {
+
110  error_msgs_ << "require unconstrained."
+
111  << " found range constraint." << std::endl;
+
112  return false;
+
113  }
+
114  return true;
+
115  }
+
116  bool operator()(const vector_var_decl& /*x*/) const {
+
117  return true;
+
118  }
+
119  bool operator()(const row_vector_var_decl& /*x*/) const {
+
120  return true;
+
121  }
+
122  bool operator()(const matrix_var_decl& /*x*/) const {
+
123  return true;
+
124  }
+
125  bool operator()(const unit_vector_var_decl& /*x*/) const {
+
126  error_msgs_ << "require unconstrained variable declaration."
+
127  << " found unit_vector." << std::endl;
+
128  return false;
+
129  }
+
130  bool operator()(const simplex_var_decl& /*x*/) const {
+
131  error_msgs_ << "require unconstrained variable declaration."
+
132  << " found simplex." << std::endl;
+
133  return false;
+
134  }
+
135  bool operator()(const ordered_var_decl& /*x*/) const {
+
136  error_msgs_ << "require unconstrained variable declaration."
+
137  << " found ordered." << std::endl;
+
138  return false;
+
139  }
+
140  bool operator()(const positive_ordered_var_decl& /*x*/) const {
+
141  error_msgs_ << "require unconstrained variable declaration."
+
142  << " found positive_ordered." << std::endl;
+
143  return false;
+
144  }
+
145  bool operator()(const cholesky_factor_var_decl& /*x*/) const {
+
146  error_msgs_ << "require unconstrained variable declaration."
+
147  << " found cholesky_factor." << std::endl;
+
148  return false;
+
149  }
+
150  bool operator()(const cov_matrix_var_decl& /*x*/) const {
+
151  error_msgs_ << "require unconstrained variable declaration."
+
152  << " found cov_matrix." << std::endl;
+
153  return false;
+
154  }
+
155  bool operator()(const corr_matrix_var_decl& /*x*/) const {
+
156  error_msgs_ << "require unconstrained variable declaration."
+
157  << " found corr_matrix." << std::endl;
+
158  return false;
+
159  }
+
160  };
+
161 
+
162  struct data_only_expression : public boost::static_visitor<bool> {
+
163  std::stringstream& error_msgs_;
+
164  variable_map& var_map_;
+
165  data_only_expression(std::stringstream& error_msgs,
+
166  variable_map& var_map)
+
167  : error_msgs_(error_msgs),
+
168  var_map_(var_map) {
+
169  }
+
170  bool operator()(const nil& /*e*/) const {
+
171  return true;
+
172  }
+
173  bool operator()(const int_literal& /*x*/) const {
+
174  return true;
+
175  }
+
176  bool operator()(const double_literal& /*x*/) const {
+
177  return true;
+
178  }
+
179  bool operator()(const array_literal& x) const {
+
180  for (size_t i = 0; i < x.args_.size(); ++i)
+
181  if (!boost::apply_visitor(*this,x.args_[i].expr_))
+
182  return false;
+
183  return true;
+
184  }
+
185  bool operator()(const variable& x) const {
+
186  var_origin origin = var_map_.get_origin(x.name_);
+
187  bool is_data = (origin == data_origin)
+
188  || (origin == transformed_data_origin)
+
189  || (origin == local_origin);
+
190  if (!is_data) {
+
191  error_msgs_ << "non-data variables not allowed in dimension declarations."
+
192  << std::endl
+
193  << " found variable=" << x.name_
+
194  << "; declared in block=";
+
195  print_var_origin(error_msgs_,origin);
+
196  error_msgs_ << std::endl;
+
197  }
+
198  return is_data;
+
199  }
+
200  bool operator()(const fun& x) const {
+
201  for (size_t i = 0; i < x.args_.size(); ++i)
+
202  if (!boost::apply_visitor(*this,x.args_[i].expr_))
+
203  return false;
+
204  return true;
+
205  }
+
206  bool operator()(const index_op& x) const {
+
207  if (!boost::apply_visitor(*this,x.expr_.expr_))
+
208  return false;
+
209  for (size_t i = 0; i < x.dimss_.size(); ++i)
+
210  for (size_t j = 0; j < x.dimss_[i].size(); ++j)
+
211  if (!boost::apply_visitor(*this,x.dimss_[i][j].expr_))
+
212  return false;
+
213  return true;
+
214  }
+
215  bool operator()(const binary_op& x) const {
+
216  return boost::apply_visitor(*this,x.left.expr_)
+
217  && boost::apply_visitor(*this,x.right.expr_);
+
218  }
+
219  bool operator()(const unary_op& x) const {
+
220  return boost::apply_visitor(*this,x.subject.expr_);
+
221  }
+
222  };
+
223 
+
224 
+
225  struct add_var {
+
226  template <typename T1, typename T2, typename T3, typename T4, typename T5>
+
227  struct result { typedef T1 type; };
+
228  // each type derived from base_var_decl gets own instance
+
229  template <typename T>
+
230  T operator()(const T& var_decl,
+
231  variable_map& vm,
+
232  bool& pass,
+
233  const var_origin& vo,
+
234  std::ostream& error_msgs) const {
+
235  if (vm.exists(var_decl.name_)) {
+
236  // variable already exists
+
237  pass = false;
+
238  error_msgs << "duplicate declaration of variable, name="
+
239  << var_decl.name_;
+
240 
+
241  error_msgs << "; attempt to redeclare as ";
+
242  print_var_origin(error_msgs,vo); // FIXME -- need original vo
+
243 
+
244  error_msgs << "; original declaration as ";
+
245  print_var_origin(error_msgs,vm.get_origin(var_decl.name_));
+
246 
+
247  error_msgs << std::endl;
+
248  return var_decl;
+
249  }
+ +
251  && var_decl.base_type_ == INT_T) {
+
252  pass = false;
+
253  error_msgs << "integer parameters or transformed parameters are not allowed; "
+
254  << " found declared type int, parameter name=" << var_decl.name_
+
255  << std::endl;
+
256  return var_decl;
+
257  }
+
258  pass = true; // probably don't need to set true
+
259  vm.add(var_decl.name_,var_decl,vo);
+
260  return var_decl;
+
261  }
+
262  };
+
263  boost::phoenix::function<add_var> add_var_f;
+
264 
+
265 
+
266  struct validate_decl_constraints {
+
267  template <typename T1, typename T2, typename T3, typename T4>
+
268  struct result { typedef bool type; };
+
269 
+
270  bool operator()(const bool& allow_constraints,
+
271  const bool& declaration_ok,
+
272  const var_decl& var_decl,
+
273  std::stringstream& error_msgs) const {
+
274  if (!declaration_ok) {
+
275  error_msgs << "Problem with declaration." << std::endl;
+
276  return false; // short-circuits test of constraints
+
277  }
+
278  if (allow_constraints)
+
279  return true;
+
280  validate_no_constraints_vis vis(error_msgs);
+
281  bool constraints_ok = boost::apply_visitor(vis,var_decl.decl_);
+
282  return constraints_ok;
+
283  }
+
284  };
+
285  boost::phoenix::function<validate_decl_constraints>
+
286  validate_decl_constraints_f;
+
287 
+
288  struct validate_identifier {
+
289  std::set<std::string> reserved_word_set_;
+
290 
+
291  template <typename T1, typename T2>
+
292  struct result { typedef bool type; };
+
293 
+
294  void reserve(const std::string& w) {
+
295  reserved_word_set_.insert(w);
+
296  }
+
297 
+
298  validate_identifier() {
+
299  reserve("for");
+
300  reserve("in");
+
301  reserve("while");
+
302  reserve("repeat");
+
303  reserve("until");
+
304  reserve("if");
+
305  reserve("then");
+
306  reserve("else");
+
307  reserve("true");
+
308  reserve("false");
+
309 
+
310  reserve("int");
+
311  reserve("real");
+
312  reserve("vector");
+
313  reserve("unit_vector");
+
314  reserve("simplex");
+
315  reserve("ordered");
+
316  reserve("positive_ordered");
+
317  reserve("row_vector");
+
318  reserve("matrix");
+
319  reserve("cholesky_factor_cov");
+
320  reserve("cov_matrix");
+
321  reserve("corr_matrix");
+
322 
+
323 
+
324  reserve("model");
+
325  reserve("data");
+
326  reserve("parameters");
+
327  reserve("quantities");
+
328  reserve("transformed");
+
329  reserve("generated");
+
330 
+
331  reserve("var");
+
332 
+
333  reserve("alignas");
+
334  reserve("alignof");
+
335  reserve("and");
+
336  reserve("and_eq");
+
337  reserve("asm");
+
338  reserve("auto");
+
339  reserve("bitand");
+
340  reserve("bitor");
+
341  reserve("bool");
+
342  reserve("break");
+
343  reserve("case");
+
344  reserve("catch");
+
345  reserve("char");
+
346  reserve("char16_t");
+
347  reserve("char32_t");
+
348  reserve("class");
+
349  reserve("compl");
+
350  reserve("const");
+
351  reserve("constexpr");
+
352  reserve("const_cast");
+
353  reserve("continue");
+
354  reserve("decltype");
+
355  reserve("default");
+
356  reserve("delete");
+
357  reserve("do");
+
358  reserve("double");
+
359  reserve("dynamic_cast");
+
360  reserve("else");
+
361  reserve("enum");
+
362  reserve("explicit");
+
363  reserve("export");
+
364  reserve("extern");
+
365  reserve("false");
+
366  reserve("float");
+
367  reserve("for");
+
368  reserve("friend");
+
369  reserve("goto");
+
370  reserve("if");
+
371  reserve("inline");
+
372  reserve("int");
+
373  reserve("long");
+
374  reserve("mutable");
+
375  reserve("namespace");
+
376  reserve("new");
+
377  reserve("noexcept");
+
378  reserve("not");
+
379  reserve("not_eq");
+
380  reserve("nullptr");
+
381  reserve("operator");
+
382  reserve("or");
+
383  reserve("or_eq");
+
384  reserve("private");
+
385  reserve("protected");
+
386  reserve("public");
+
387  reserve("register");
+
388  reserve("reinterpret_cast");
+
389  reserve("return");
+
390  reserve("short");
+
391  reserve("signed");
+
392  reserve("sizeof");
+
393  reserve("static");
+
394  reserve("static_assert");
+
395  reserve("static_cast");
+
396  reserve("struct");
+
397  reserve("switch");
+
398  reserve("template");
+
399  reserve("this");
+
400  reserve("thread_local");
+
401  reserve("throw");
+
402  reserve("true");
+
403  reserve("try");
+
404  reserve("typedef");
+
405  reserve("typeid");
+
406  reserve("typename");
+
407  reserve("union");
+
408  reserve("unsigned");
+
409  reserve("using");
+
410  reserve("virtual");
+
411  reserve("void");
+
412  reserve("volatile");
+
413  reserve("wchar_t");
+
414  reserve("while");
+
415  reserve("xor");
+
416  reserve("xor_eq");
+
417 
+
418  // function names declared in signatures
+ +
420  using std::set;
+
421  using std::string;
+
422  const function_signatures& sigs = function_signatures::instance();
+
423  set<string> fun_names = sigs.key_set();
+
424  fun_names.erase("pi");
+
425  fun_names.erase("e");
+
426  fun_names.erase("sqrt2");
+
427  fun_names.erase("log2");
+
428  fun_names.erase("log10");
+
429  fun_names.erase("not_a_number");
+
430  fun_names.erase("positive_infinity");
+
431  fun_names.erase("negative_infinity");
+
432  fun_names.erase("epsilon");
+
433  fun_names.erase("negative_epsilon");
+
434  for (set<string>::iterator it = fun_names.begin();
+
435  it != fun_names.end();
+
436  ++it)
+
437  reserve(*it);
+
438 
+
439  }
+
440 
+
441  bool operator()(const std::string& identifier,
+
442  std::stringstream& error_msgs) const {
+
443  int len = identifier.size();
+
444  if (len >= 2
+
445  && identifier[len-1] == '_'
+
446  && identifier[len-2] == '_') {
+
447  error_msgs << "variable identifier (name) may not end in double underscore (__)"
+
448  << std::endl
+
449  << " found identifer=" << identifier << std::endl;
+
450  return false;
+
451  }
+
452  size_t period_position = identifier.find('.');
+
453  if (period_position != std::string::npos) {
+
454  error_msgs << "variable identifier may not contain a period (.)"
+
455  << std::endl
+
456  << " found period at position (indexed from 0)=" << period_position
+
457  << std::endl
+
458  << " found identifier=" << identifier
+
459  << std::endl;
+
460  return false;
+
461  }
+
462  if (reserved_word_set_.find(identifier) != reserved_word_set_.end()) {
+
463  error_msgs << "variable identifier (name) may not be reserved word"
+
464  << std::endl
+
465  << " found identifier=" << identifier
+
466  << std::endl;
+
467  return false;
+
468  }
+
469  return true;
+
470  }
+
471  };
+
472  boost::phoenix::function<validate_identifier> validate_identifier_f;
+
473 
+
474  // copies single dimension from M to N if only M declared
+
475  struct copy_square_cholesky_dimension_if_necessary {
+
476  template <typename T1>
+
477  struct result { typedef void type; };
+
478  void operator()(cholesky_factor_var_decl& var_decl) const {
+
479  if (is_nil(var_decl.N_))
+
480  var_decl.N_ = var_decl.M_;
+
481  }
+
482  };
+
483  boost::phoenix::function<copy_square_cholesky_dimension_if_necessary>
+
484  copy_square_cholesky_dimension_if_necessary_f;
+
485 
+
486  struct empty_range {
+
487  template <typename T1>
+
488  struct result { typedef range type; };
+
489  range operator()(std::stringstream& /*error_msgs*/) const {
+
490  return range();
+
491  }
+
492  };
+
493  boost::phoenix::function<empty_range> empty_range_f;
+
494 
+
495  struct validate_int_expr {
+
496  template <typename T1, typename T2>
+
497  struct result { typedef bool type; };
+
498 
+
499  bool operator()(const expression& expr,
+
500  std::stringstream& error_msgs) const {
+
501  if (!expr.expression_type().is_primitive_int()) {
+
502  error_msgs << "expression denoting integer required; found type="
+
503  << expr.expression_type() << std::endl;
+
504  return false;
+
505  }
+
506  return true;
+
507  }
+
508  };
+
509  boost::phoenix::function<validate_int_expr> validate_int_expr_f;
+
510 
+
511  struct set_int_range_lower {
+
512  template <typename T1, typename T2, typename T3>
+
513  struct result { typedef bool type; };
+
514  bool operator()(range& range,
+
515  const expression& expr,
+
516  std::stringstream& error_msgs) const {
+
517  range.low_ = expr;
+
518  validate_int_expr validator;
+
519  return validator(expr,error_msgs);
+
520  }
+
521  };
+
522  boost::phoenix::function<set_int_range_lower> set_int_range_lower_f;
+
523 
+
524  struct set_int_range_upper {
+
525  template <typename T1, typename T2, typename T3>
+
526  struct result { typedef bool type; };
+
527  bool operator()(range& range,
+
528  const expression& expr,
+
529  std::stringstream& error_msgs) const {
+
530  range.high_ = expr;
+
531  validate_int_expr validator;
+
532  return validator(expr,error_msgs);
+
533  }
+
534  };
+
535  boost::phoenix::function<set_int_range_upper> set_int_range_upper_f;
+
536 
+
537 
+
538 
+
539  struct validate_int_data_expr {
+
540  template <typename T1, typename T2, typename T3>
+
541  struct result { typedef bool type; };
+
542 
+
543  bool operator()(const expression& expr,
+
544  variable_map& var_map,
+
545  std::stringstream& error_msgs) const {
+
546  if (!expr.expression_type().is_primitive_int()) {
+
547  error_msgs << "dimension declaration requires expression denoting integer;"
+
548  << " found type="
+
549  << expr.expression_type()
+
550  << std::endl;
+
551  return false;
+
552  }
+
553  data_only_expression vis(error_msgs,var_map);
+
554  bool only_data_dimensions = boost::apply_visitor(vis,expr.expr_);
+
555  return only_data_dimensions;
+
556  }
+
557  };
+
558  boost::phoenix::function<validate_int_data_expr> validate_int_data_expr_f;
+
559 
+
560  struct validate_double_expr {
+
561  template <typename T1, typename T2>
+
562  struct result { typedef bool type; };
+
563 
+
564  bool operator()(const expression& expr,
+
565  std::stringstream& error_msgs) const {
+
566  if (!expr.expression_type().is_primitive_double()
+
567  && !expr.expression_type().is_primitive_int()) {
+
568  error_msgs << "expression denoting double required; found type="
+
569  << expr.expression_type() << std::endl;
+
570  return false;
+
571  }
+
572  return true;
+
573  }
+
574  };
+
575  boost::phoenix::function<validate_double_expr> validate_double_expr_f;
+
576 
+
577 
+
578  struct set_double_range_lower {
+
579  template <typename T1, typename T2, typename T3>
+
580  struct result { typedef bool type; };
+
581  bool operator()(range& range,
+
582  const expression& expr,
+
583  std::stringstream& error_msgs) const {
+
584  range.low_ = expr;
+
585  validate_double_expr validator;
+
586  return validator(expr,error_msgs);
+
587  }
+
588  };
+
589  boost::phoenix::function<set_double_range_lower> set_double_range_lower_f;
+
590 
+
591  struct set_double_range_upper {
+
592  template <typename T1, typename T2, typename T3>
+
593  struct result { typedef bool type; };
+
594  bool operator()(range& range,
+
595  const expression& expr,
+
596  std::stringstream& error_msgs) const {
+
597  range.high_ = expr;
+
598  validate_double_expr validator;
+
599  return validator(expr,error_msgs);
+
600  }
+
601  };
+
602  boost::phoenix::function<set_double_range_upper> set_double_range_upper_f;
+
603 
+
604 
+
605  template <typename Iterator>
+
606  var_decls_grammar<Iterator>::var_decls_grammar(variable_map& var_map,
+
607  std::stringstream& error_msgs)
+
608  : var_decls_grammar::base_type(var_decls_r),
+
609  var_map_(var_map),
+
610  error_msgs_(error_msgs),
+
611  expression_g(var_map,error_msgs),
+
612  expression07_g(var_map,error_msgs,false)
+
613  {
+
614 
+
615  using boost::spirit::qi::_1;
+
616  using boost::spirit::qi::_3;
+
617  using boost::spirit::qi::char_;
+
618  using boost::spirit::qi::eps;
+
619  using boost::spirit::qi::lexeme;
+
620  using boost::spirit::qi::lit;
+
621  using boost::spirit::qi::no_skip;
+
622  using boost::spirit::qi::_pass;
+
623  using boost::spirit::qi::_val;
+
624  using boost::spirit::qi::labels::_a;
+
625  using boost::spirit::qi::labels::_r1;
+
626  using boost::spirit::qi::labels::_r2;
+
627 
+
628  var_decls_r.name("variable declarations");
+
629  var_decls_r
+
630  %= *var_decl_r(_r1,_r2);
+
631 
+
632  // _a = error state local,
+
633  // _r1 constraints allowed inherited,
+
634  // _r2 var_origin
+
635  var_decl_r.name("variable declaration");
+
636  var_decl_r
+
637  %= (int_decl_r(_r2)
+
638  [_val = add_var_f(_1,boost::phoenix::ref(var_map_),_a,_r2,
+
639  boost::phoenix::ref(error_msgs))]
+
640  | double_decl_r(_r2)
+
641  [_val = add_var_f(_1,boost::phoenix::ref(var_map_),_a,_r2,
+
642  boost::phoenix::ref(error_msgs_))]
+
643  | vector_decl_r(_r2)
+
644  [_val = add_var_f(_1,boost::phoenix::ref(var_map_),_a,_r2,
+
645  boost::phoenix::ref(error_msgs_))]
+
646  | row_vector_decl_r(_r2)
+
647  [_val = add_var_f(_1,boost::phoenix::ref(var_map_),_a,_r2,
+
648  boost::phoenix::ref(error_msgs_))]
+
649  | matrix_decl_r(_r2)
+
650  [_val = add_var_f(_1,boost::phoenix::ref(var_map_),_a,_r2,
+
651  boost::phoenix::ref(error_msgs_))]
+
652  | unit_vector_decl_r(_r2)
+
653  [_val = add_var_f(_1,boost::phoenix::ref(var_map_),_a,_r2,
+
654  boost::phoenix::ref(error_msgs_))]
+
655  | simplex_decl_r(_r2)
+
656  [_val = add_var_f(_1,boost::phoenix::ref(var_map_),_a,_r2,
+
657  boost::phoenix::ref(error_msgs_))]
+
658  | ordered_decl_r(_r2)
+
659  [_val = add_var_f(_1,boost::phoenix::ref(var_map_),_a,_r2,
+
660  boost::phoenix::ref(error_msgs_))]
+
661  | positive_ordered_decl_r(_r2)
+
662  [_val = add_var_f(_1,boost::phoenix::ref(var_map_),_a,_r2,
+
663  boost::phoenix::ref(error_msgs_))]
+
664  | cholesky_factor_decl_r(_r2)
+
665  [_val = add_var_f(_1,boost::phoenix::ref(var_map_),_a,_r2,
+
666  boost::phoenix::ref(error_msgs_))]
+
667  | cov_matrix_decl_r(_r2)
+
668  [_val = add_var_f(_1,boost::phoenix::ref(var_map_),_a,_r2,
+
669  boost::phoenix::ref(error_msgs_))]
+
670  | corr_matrix_decl_r(_r2)
+
671  [_val = add_var_f(_1,boost::phoenix::ref(var_map_),_a,_r2,
+
672  boost::phoenix::ref(error_msgs_))]
+
673  )
+
674  > eps
+
675  [_pass
+
676  = validate_decl_constraints_f(_r1,_a,_val,
+
677  boost::phoenix::ref(error_msgs_))]
+
678  ;
+
679 
+
680  int_decl_r.name("integer declaration");
+
681  int_decl_r
+
682  %= ( lit("int")
+
683  >> no_skip[!char_("a-zA-Z0-9_")] )
+
684  > -range_brackets_int_r(_r1)
+
685  // >> (lit(' ') | lit('\n') | lit('\t') | lit('\r'))
+
686  > identifier_r
+
687  > opt_dims_r(_r1)
+
688  > lit(';');
+
689 
+
690  double_decl_r.name("real declaration");
+
691  double_decl_r
+
692  %= ( lit("real")
+
693  >> no_skip[!char_("a-zA-Z0-9_")] )
+
694  > -range_brackets_double_r(_r1)
+
695  > identifier_r
+
696  > opt_dims_r(_r1)
+
697  > lit(';');
+
698 
+
699  vector_decl_r.name("vector declaration");
+
700  vector_decl_r
+
701  %= lit("vector")
+
702  > -range_brackets_double_r(_r1)
+
703  > lit('[')
+
704  > expression_g(_r1)
+
705  [_pass = validate_int_expr_f(_1,boost::phoenix::ref(error_msgs_))]
+
706  > lit(']')
+
707  > identifier_r
+
708  > opt_dims_r(_r1)
+
709  > lit(';');
+
710 
+
711  row_vector_decl_r.name("row vector declaration");
+
712  row_vector_decl_r
+
713  %= lit("row_vector")
+
714  > -range_brackets_double_r(_r1)
+
715  > lit('[')
+
716  > expression_g(_r1)
+
717  [_pass = validate_int_expr_f(_1,boost::phoenix::ref(error_msgs_))]
+
718  > lit(']')
+
719  > identifier_r
+
720  > opt_dims_r(_r1)
+
721  > lit(';');
+
722 
+
723  matrix_decl_r.name("matrix declaration");
+
724  matrix_decl_r
+
725  %= lit("matrix")
+
726  > -range_brackets_double_r(_r1)
+
727  > lit('[')
+
728  > expression_g(_r1)
+
729  [_pass = validate_int_expr_f(_1,boost::phoenix::ref(error_msgs_))]
+
730  > lit(',')
+
731  > expression_g(_r1)
+
732  [_pass = validate_int_expr_f(_1,boost::phoenix::ref(error_msgs_))]
+
733  > lit(']')
+
734  > identifier_r
+
735  > opt_dims_r(_r1)
+
736  > lit(';');
+
737 
+
738  unit_vector_decl_r.name("unit_vector declaration");
+
739  unit_vector_decl_r
+
740  %= lit("unit_vector")
+
741  > lit('[')
+
742  > expression_g(_r1)
+
743  [_pass = validate_int_expr_f(_1,boost::phoenix::ref(error_msgs_))]
+
744  > lit(']')
+
745  > identifier_r
+
746  > opt_dims_r(_r1)
+
747  > lit(';');
+
748 
+
749  simplex_decl_r.name("simplex declaration");
+
750  simplex_decl_r
+
751  %= lit("simplex")
+
752  > lit('[')
+
753  > expression_g(_r1)
+
754  [_pass = validate_int_expr_f(_1,boost::phoenix::ref(error_msgs_))]
+
755  > lit(']')
+
756  > identifier_r
+
757  > opt_dims_r(_r1)
+
758  > lit(';');
+
759 
+
760  ordered_decl_r.name("ordered declaration");
+
761  ordered_decl_r
+
762  %= lit("ordered")
+
763  > lit('[')
+
764  > expression_g(_r1)
+
765  [_pass = validate_int_expr_f(_1,boost::phoenix::ref(error_msgs_))]
+
766  > lit(']')
+
767  > identifier_r
+
768  > opt_dims_r(_r1)
+
769  > lit(';');
+
770 
+
771  positive_ordered_decl_r.name("positive_ordered declaration");
+
772  positive_ordered_decl_r
+
773  %= lit("positive_ordered")
+
774  > lit('[')
+
775  > expression_g(_r1)
+
776  [_pass = validate_int_expr_f(_1,boost::phoenix::ref(error_msgs_))]
+
777  > lit(']')
+
778  > identifier_r
+
779  > opt_dims_r(_r1)
+
780  > lit(';');
+
781 
+
782  cholesky_factor_decl_r.name("cholesky factor declaration");
+
783  cholesky_factor_decl_r
+
784  %= lit("cholesky_factor_cov")
+
785  > lit('[')
+
786  > expression_g(_r1)
+
787  [_pass = validate_int_expr_f(_1,boost::phoenix::ref(error_msgs_))]
+
788  > -( lit(',')
+
789  > expression_g(_r1)
+
790  [_pass = validate_int_expr_f(_1,boost::phoenix::ref(error_msgs_))]
+
791  )
+
792  > lit(']')
+
793  > identifier_r
+
794  > opt_dims_r(_r1)
+
795  > lit(';')
+
796  > eps
+
797  [copy_square_cholesky_dimension_if_necessary_f(_val)];
+
798 
+
799  cov_matrix_decl_r.name("covariance matrix declaration");
+
800  cov_matrix_decl_r
+
801  %= lit("cov_matrix")
+
802  > lit('[')
+
803  > expression_g(_r1)
+
804  [_pass = validate_int_expr_f(_1,boost::phoenix::ref(error_msgs_))]
+
805  > lit(']')
+
806  > identifier_r
+
807  > opt_dims_r(_r1)
+
808  > lit(';');
+
809 
+
810  corr_matrix_decl_r.name("correlation matrix declaration");
+
811  corr_matrix_decl_r
+
812  %= lit("corr_matrix")
+
813  > lit('[')
+
814  > expression_g(_r1)
+
815  [_pass = validate_int_expr_f(_1,boost::phoenix::ref(error_msgs_))]
+
816  > lit(']')
+
817  > identifier_r
+
818  > opt_dims_r(_r1)
+
819  > lit(';');
+
820 
+
821  opt_dims_r.name("array dimensions (optional)");
+
822  opt_dims_r
+
823  %= - dims_r(_r1);
+
824 
+
825  dims_r.name("array dimensions");
+
826  dims_r
+
827  %= lit('[')
+
828  > (expression_g(_r1)
+
829  [_pass = validate_int_data_expr_f(_1,
+
830  boost::phoenix::ref(var_map_),
+
831  boost::phoenix::ref(error_msgs_))]
+
832  % ',')
+
833  > lit(']')
+
834  ;
+
835 
+
836  range_brackets_int_r.name("integer range expression pair, brackets");
+
837  range_brackets_int_r
+
838  = lit('<') [_val = empty_range_f(boost::phoenix::ref(error_msgs_))]
+
839  >> (
+
840  ( (lit("lower")
+
841  >> lit('=')
+
842  >> expression07_g(_r1)
+
843  [ _pass = set_int_range_lower_f(_val,_1,
+
844  boost::phoenix::ref(error_msgs_)) ])
+
845  >> -( lit(',')
+
846  >> lit("upper")
+
847  >> lit('=')
+
848  >> expression07_g(_r1)
+
849  [ _pass = set_int_range_upper_f(_val,_1,
+
850  boost::phoenix::ref(error_msgs_)) ] ) )
+
851  |
+
852  ( lit("upper")
+
853  >> lit('=')
+
854  >> expression07_g(_r1)
+
855  [ _pass = set_int_range_upper_f(_val,_1,
+
856  boost::phoenix::ref(error_msgs_)) ])
+
857  )
+
858  >> lit('>');
+
859 
+
860  range_brackets_double_r.name("real range expression pair, brackets");
+
861  range_brackets_double_r
+
862  = lit('<') [_val = empty_range_f(boost::phoenix::ref(error_msgs_))]
+
863  > (
+
864  ( (lit("lower")
+
865  > lit('=')
+
866  > expression07_g(_r1)
+
867  [ _pass = set_double_range_lower_f(_val,_1,
+
868  boost::phoenix::ref(error_msgs_)) ])
+
869  > -( lit(',')
+
870  > lit("upper")
+
871  > lit('=')
+
872  > expression07_g(_r1)
+
873  [ _pass = set_double_range_upper_f(_val,_1,
+
874  boost::phoenix::ref(error_msgs_)) ] ) )
+
875  |
+
876  ( lit("upper")
+
877  > lit('=')
+
878  > expression07_g(_r1)
+
879  [ _pass = set_double_range_upper_f(_val,_1,
+
880  boost::phoenix::ref(error_msgs_)) ])
+
881  )
+
882  > lit('>');
+
883 
+
884  identifier_r.name("identifier");
+
885  identifier_r
+
886  %= identifier_name_r
+
887  [_pass = validate_identifier_f(_val,boost::phoenix::ref(error_msgs_))]
+
888  ;
+
889 
+
890  identifier_name_r.name("identifier subrule");
+
891  identifier_name_r
+
892  %= lexeme[char_("a-zA-Z")
+
893  >> *char_("a-zA-Z0-9_.")]
+
894  ;
+
895 
+
896 
+
897  range_r.name("range expression pair, colon");
+
898  range_r
+
899  %= expression_g(_r1)
+
900  [_pass = validate_int_expr_f(_1,boost::phoenix::ref(error_msgs_))]
+
901  >> lit(':')
+
902  >> expression_g(_r1)
+
903  [_pass = validate_int_expr_f(_1,boost::phoenix::ref(error_msgs_))];
+
904 
+
905  }
+
906 
+
907 
+
908  }
+
909 }
+
910 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/var__decls__grammar__inst_8cpp.html b/doc/api/html/var__decls__grammar__inst_8cpp.html new file mode 100644 index 00000000000..11e1d0763eb --- /dev/null +++ b/doc/api/html/var__decls__grammar__inst_8cpp.html @@ -0,0 +1,123 @@ + + + + + +Stan: src/stan/gm/grammars/var_decls_grammar_inst.cpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
var_decls_grammar_inst.cpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/var__decls__grammar__inst_8cpp_source.html b/doc/api/html/var__decls__grammar__inst_8cpp_source.html new file mode 100644 index 00000000000..1abb3c99637 --- /dev/null +++ b/doc/api/html/var__decls__grammar__inst_8cpp_source.html @@ -0,0 +1,115 @@ + + + + + +Stan: src/stan/gm/grammars/var_decls_grammar_inst.cpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
var_decls_grammar_inst.cpp
+
+
+Go to the documentation of this file.
+ +
3 
+
4 namespace stan {
+
5  namespace gm {
+
6  template struct var_decls_grammar<pos_iterator_t>;
+
7  }
+
8 }
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/var__stack_8cpp.html b/doc/api/html/var__stack_8cpp.html new file mode 100644 index 00000000000..2ce0e61e796 --- /dev/null +++ b/doc/api/html/var__stack_8cpp.html @@ -0,0 +1,155 @@ + + + + + +Stan: src/stan/agrad/rev/var_stack.cpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
var_stack.cpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + +

+Macros

#define __STAN__AGRAD__REV__VAR_STACK_CPP__
 
+ + + + + + + + + +

+Variables

std::vector< chainable * > stan::agrad::var_stack_
 
std::vector< chainable * > stan::agrad::var_nochain_stack_
 
std::vector< chainable_alloc * > stan::agrad::var_alloc_stack_
 
memory::stack_alloc stan::agrad::memalloc_
 
+

Macro Definition Documentation

+ +
+
+ + + + +
#define __STAN__AGRAD__REV__VAR_STACK_CPP__
+
+ +

Definition at line 2 of file var_stack.cpp.

+ +
+
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/var__stack_8cpp_source.html b/doc/api/html/var__stack_8cpp_source.html new file mode 100644 index 00000000000..31ac8d9e55c --- /dev/null +++ b/doc/api/html/var__stack_8cpp_source.html @@ -0,0 +1,126 @@ + + + + + +Stan: src/stan/agrad/rev/var_stack.cpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
var_stack.cpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__VAR_STACK_CPP__
+
2 #define __STAN__AGRAD__REV__VAR_STACK_CPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7 
+
8  namespace agrad {
+
9 
+
10  std::vector<chainable*> var_stack_;
+
11  std::vector<chainable*> var_nochain_stack_;
+
12  std::vector<chainable_alloc*> var_alloc_stack_;
+ +
14 
+
15  }
+
16 
+
17 }
+
18 
+
19 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/var__stack_8hpp.html b/doc/api/html/var__stack_8hpp.html new file mode 100644 index 00000000000..fef415e0b12 --- /dev/null +++ b/doc/api/html/var__stack_8hpp.html @@ -0,0 +1,140 @@ + + + + + +Stan: src/stan/agrad/rev/var_stack.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
var_stack.hpp File Reference
+
+
+
#include <vector>
+#include <stan/memory/stack_alloc.hpp>
+
+

Go to the source code of this file.

+ + + + + +

+Classes

class  stan::agrad::chainable_alloc
 A chainable_alloc is an object which is constructed and destructed normally but the memory lifespan is managed along with the arena allocator for the gradient calculation. More...
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+ + + + + + + +

+Functions

static void stan::agrad::recover_memory ()
 Recover memory used for all variables for reuse.
 
static void stan::agrad::free_memory ()
 Return all memory used for gradients back to the system.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/var__stack_8hpp_source.html b/doc/api/html/var__stack_8hpp_source.html new file mode 100644 index 00000000000..df21512f935 --- /dev/null +++ b/doc/api/html/var__stack_8hpp_source.html @@ -0,0 +1,151 @@ + + + + + +Stan: src/stan/agrad/rev/var_stack.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
var_stack.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__VAR_STACK_HPP__
+
2 #define __STAN__AGRAD__REV__VAR_STACK_HPP__
+
3 
+
4 #include <vector>
+ +
6 
+
7 namespace stan {
+
8  namespace agrad {
+
9 
+
10  // forward declaration of chainable
+
11  class chainable;
+
12  class chainable_alloc;
+
13 
+
14  // FIXME: manage all this as a single singleton (thread local)
+
15  extern std::vector<chainable*> var_stack_;
+
16  extern std::vector<chainable*> var_nochain_stack_;
+
17  extern std::vector<chainable_alloc*> var_alloc_stack_;
+
18  extern memory::stack_alloc memalloc_;
+
19 
+ +
27  public:
+ +
29  var_alloc_stack_.push_back(this);
+
30  }
+
31  virtual ~chainable_alloc() { };
+
32  };
+
33 
+
37  static void recover_memory() {
+
38  var_stack_.clear();
+
39  var_nochain_stack_.clear();
+
40  for (size_t i = 0; i < var_alloc_stack_.size(); i++)
+
41  delete var_alloc_stack_[i];
+
42  var_alloc_stack_.clear();
+ +
44  }
+
45 
+
49  static void free_memory() {
+ +
51  }
+
52 
+
53 
+
54  }
+
55 }
+
56 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/vari_8hpp.html b/doc/api/html/vari_8hpp.html new file mode 100644 index 00000000000..e7834755f9f --- /dev/null +++ b/doc/api/html/vari_8hpp.html @@ -0,0 +1,131 @@ + + + + + +Stan: src/stan/agrad/rev/vari.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
vari.hpp File Reference
+
+
+
#include <ostream>
+#include <stan/agrad/rev/var_stack.hpp>
+#include <stan/agrad/rev/chainable.hpp>
+
+

Go to the source code of this file.

+ + + + + +

+Classes

class  stan::agrad::vari
 The variable implementation base class. More...
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/vari_8hpp_source.html b/doc/api/html/vari_8hpp_source.html new file mode 100644 index 00000000000..7a13f80a99d --- /dev/null +++ b/doc/api/html/vari_8hpp_source.html @@ -0,0 +1,166 @@ + + + + + +Stan: src/stan/agrad/rev/vari.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
vari.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__VARI_HPP__
+
2 #define __STAN__AGRAD__REV__VARI_HPP__
+
3 
+
4 #include <ostream>
+
5 
+ + +
8 
+
9 namespace stan {
+
10  namespace agrad {
+
11 
+
12  // forward declaration of var
+
13  class var;
+
14 
+
28  class vari : public chainable {
+
29  private:
+
30  friend class var;
+
31 
+
32  public:
+
33 
+
37  const double val_;
+
38 
+
43  double adj_;
+
44 
+
57  vari(const double x):
+
58  val_(x),
+
59  adj_(0.0) {
+
60  var_stack_.push_back(this);
+
61  }
+
62 
+
63  vari(const double x,bool stacked):
+
64  val_(x),
+
65  adj_(0.0) {
+
66  if (stacked)
+
67  var_stack_.push_back(this);
+
68  else
+
69  var_nochain_stack_.push_back(this);
+
70  }
+
71 
+
79  virtual ~vari() {
+
80  // throw std::logic_error("vari destruction handled automatically");
+
81  }
+
82 
+
88  virtual void init_dependent() {
+
89  adj_ = 1.0; // droot/droot = 1
+
90  }
+
91 
+
95  virtual void set_zero_adjoint() {
+
96  adj_ = 0.0;
+
97  }
+
98 
+
108  friend std::ostream& operator<<(std::ostream& os, const vari* v) {
+
109  return os << v << " " << v->val_ << " : " << v->adj_;
+
110  }
+
111  };
+
112 
+
113  }
+
114 }
+
115 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/vd__vari_8hpp.html b/doc/api/html/vd__vari_8hpp.html new file mode 100644 index 00000000000..008ddc38282 --- /dev/null +++ b/doc/api/html/vd__vari_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/agrad/rev/internal/vd_vari.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
vd_vari.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::agrad::op_vd_vari
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/vd__vari_8hpp_source.html b/doc/api/html/vd__vari_8hpp_source.html new file mode 100644 index 00000000000..05c2318fa3a --- /dev/null +++ b/doc/api/html/vd__vari_8hpp_source.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/rev/internal/vd_vari.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
vd_vari.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__INTERNAL__VD_VARI_HPP__
+
2 #define __STAN__AGRAD__REV__INTERNAL__VD_VARI_HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7  namespace agrad {
+
8 
+
9  class op_vd_vari : public vari {
+
10  protected:
+ +
12  double bd_;
+
13  public:
+
14  op_vd_vari(double f, vari* avi, double b) :
+
15  vari(f),
+
16  avi_(avi),
+
17  bd_(b) {
+
18  }
+
19  };
+
20 
+
21  }
+
22 }
+
23 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/vdd__vari_8hpp.html b/doc/api/html/vdd__vari_8hpp.html new file mode 100644 index 00000000000..d09f7ab18a4 --- /dev/null +++ b/doc/api/html/vdd__vari_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/agrad/rev/internal/vdd_vari.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
vdd_vari.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::agrad::op_vdd_vari
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/vdd__vari_8hpp_source.html b/doc/api/html/vdd__vari_8hpp_source.html new file mode 100644 index 00000000000..294f9fb69a9 --- /dev/null +++ b/doc/api/html/vdd__vari_8hpp_source.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/rev/internal/vdd_vari.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
vdd_vari.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__INTERNAL__VDD_VARI_HPP__
+
2 #define __STAN__AGRAD__REV__INTERNAL__VDD_VARI_HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7  namespace agrad {
+
8 
+
9  class op_vdd_vari : public vari {
+
10  protected:
+ +
12  double bd_;
+
13  double cd_;
+
14  public:
+
15  op_vdd_vari(double f, vari* avi, double b, double c) :
+
16  vari(f),
+
17  avi_(avi),
+
18  bd_(b),
+
19  cd_(c) {
+
20  }
+
21  };
+
22 
+
23  }
+
24 }
+
25 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/vdv__vari_8hpp.html b/doc/api/html/vdv__vari_8hpp.html new file mode 100644 index 00000000000..1e62e7f26dc --- /dev/null +++ b/doc/api/html/vdv__vari_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/agrad/rev/internal/vdv_vari.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
vdv_vari.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::agrad::op_vdv_vari
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/vdv__vari_8hpp_source.html b/doc/api/html/vdv__vari_8hpp_source.html new file mode 100644 index 00000000000..dcfd15dcf51 --- /dev/null +++ b/doc/api/html/vdv__vari_8hpp_source.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/rev/internal/vdv_vari.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
vdv_vari.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__INTERNAL__VDV_VARI_HPP__
+
2 #define __STAN__AGRAD__REV__INTERNAL__VDV_VARI_HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7  namespace agrad {
+
8 
+
9  class op_vdv_vari : public vari {
+
10  protected:
+ +
12  double bd_;
+ +
14  public:
+
15  op_vdv_vari(double f, vari* avi, double b, vari* cvi) :
+
16  vari(f),
+
17  avi_(avi),
+
18  bd_(b),
+
19  cvi_(cvi) {
+
20  }
+
21  };
+
22 
+
23  }
+
24 }
+
25 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/vector__vari_8hpp.html b/doc/api/html/vector__vari_8hpp.html new file mode 100644 index 00000000000..03a15631639 --- /dev/null +++ b/doc/api/html/vector__vari_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/rev/internal/vector_vari.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
vector_vari.hpp File Reference
+
+
+
#include <vector>
+#include <stan/agrad/rev/var.hpp>
+#include <stan/agrad/rev/vari.hpp>
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  stan::agrad::op_vector_vari
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/vector__vari_8hpp_source.html b/doc/api/html/vector__vari_8hpp_source.html new file mode 100644 index 00000000000..684b6fab5f7 --- /dev/null +++ b/doc/api/html/vector__vari_8hpp_source.html @@ -0,0 +1,140 @@ + + + + + +Stan: src/stan/agrad/rev/internal/vector_vari.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
vector_vari.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__INTERNAL__VECTOR_VARI_HPP__
+
2 #define __STAN__AGRAD__REV__INTERNAL__VECTOR_VARI_HPP__
+
3 
+
4 #include <vector>
+
5 #include <stan/agrad/rev/var.hpp>
+ +
7 
+
8 namespace stan {
+
9  namespace agrad {
+
10 
+
11  class op_vector_vari : public vari {
+
12  protected:
+
13  const size_t size_;
+ +
15  public:
+
16  op_vector_vari(double f, const std::vector<stan::agrad::var>& vs) :
+
17  vari(f),
+
18  size_(vs.size()) {
+
19  vis_ = (vari**) operator new(sizeof(vari*) * vs.size());
+
20  for (size_t i = 0; i < vs.size(); ++i)
+
21  vis_[i] = vs[i].vi_;
+
22  }
+
23  vari* operator[](size_t n) const {
+
24  return vis_[n];
+
25  }
+
26  size_t size() {
+
27  return size_;
+
28  }
+
29  };
+
30 
+
31  }
+
32 }
+
33 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/version_8hpp.html b/doc/api/html/version_8hpp.html new file mode 100644 index 00000000000..d59c4486224 --- /dev/null +++ b/doc/api/html/version_8hpp.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/version.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
version.hpp File Reference
+
+
+
#include <string>
+
+

Go to the source code of this file.

+ + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
+ + + + + + + + + + +

+Variables

const std::string stan::MAJOR_VERSION = "2"
 Major version number for Stan package.
 
const std::string stan::MINOR_VERSION = "1"
 Minor version number for Stan package.
 
const std::string stan::PATCH_VERSION = "0"
 Patch version for Stan package.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/version_8hpp_source.html b/doc/api/html/version_8hpp_source.html new file mode 100644 index 00000000000..ced09e57b5c --- /dev/null +++ b/doc/api/html/version_8hpp_source.html @@ -0,0 +1,123 @@ + + + + + +Stan: src/stan/version.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
version.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__VERSION_HPP__
+
2 #define __STAN__VERSION_HPP__
+
3 
+
4 #include <string>
+
5 
+
6 namespace stan {
+
7 
+
9  const std::string MAJOR_VERSION = "2";
+
10 
+
12  const std::string MINOR_VERSION = "1";
+
13 
+
15  const std::string PATCH_VERSION = "0";
+
16 
+
17 }
+
18 
+
19 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/von__mises_8hpp.html b/doc/api/html/von__mises_8hpp.html new file mode 100644 index 00000000000..3ed8f826d8d --- /dev/null +++ b/doc/api/html/von__mises_8hpp.html @@ -0,0 +1,139 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/von_mises.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
von_mises.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + +

+Functions

template<bool propto, typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
stan::prob::von_mises_log (T_y const &y, T_loc const &mu, T_scale const &kappa)
 
template<typename T_y , typename T_loc , typename T_scale >
return_type< T_y, T_loc,
+T_scale >::type 
stan::prob::von_mises_log (T_y const &y, T_loc const &mu, T_scale const &kappa)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/von__mises_8hpp_source.html b/doc/api/html/von__mises_8hpp_source.html new file mode 100644 index 00000000000..0b7d5626ca3 --- /dev/null +++ b/doc/api/html/von__mises_8hpp_source.html @@ -0,0 +1,232 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/von_mises.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
von_mises.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS__VON_MISES_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__UNIVARIATE__CONTINUOUS__VON_MISES_HPP__
+
3 
+ + +
6 #include <stan/math.hpp>
+
7 #include <stan/meta/traits.hpp>
+ +
9 #include <stan/prob/traits.hpp>
+
10 
+
11 namespace stan {
+
12 
+
13  namespace prob {
+
14 
+
15  template<bool propto,
+
16  typename T_y, typename T_loc, typename T_scale>
+
17  typename return_type<T_y,T_loc,T_scale>::type
+
18  von_mises_log(T_y const& y, T_loc const& mu, T_scale const& kappa) {
+
19  static char const* const function = "stan::prob::von_mises_log(%1%)";
+
20 
+
21  // check if any vectors are zero length
+
22  if (!(stan::length(y)
+
23  && stan::length(mu)
+
24  && stan::length(kappa)))
+
25  return 0.0;
+
26 
+ + + + + + + +
34 
+
35  // Result accumulator.
+
36  double logp = 0.0;
+
37 
+
38  // Validate arguments.
+
39  if (!check_finite(function, y, "Random variable", &logp))
+
40  return logp;
+
41  if(!check_finite(function, mu, "Location paramter", &logp))
+
42  return logp;
+
43  if(!check_finite(function, kappa, "Scale parameter", &logp))
+
44  return logp;
+
45  if(!check_positive(function, kappa, "Scale parameter", &logp))
+
46  return logp;
+
47  if(!check_consistent_sizes(function, y, mu, kappa, "Random variable",
+
48  "Location parameter", "Scale parameter",
+
49  &logp))
+
50  return logp;
+
51 
+
52  // check if no variables are involved and prop-to
+ +
54  return logp;
+
55 
+
56  // Determine constants.
+
57  const bool y_const = is_constant_struct<T_y>::value;
+
58  const bool mu_const = is_constant_struct<T_loc>::value;
+
59  const bool kappa_const = is_constant_struct<T_scale>::value;
+
60 
+
61  // Determine which expensive computations to perform.
+
62  const bool compute_bessel0 = include_summand<propto,T_scale>::value;
+
63  const bool compute_bessel1 = !kappa_const;
+
64  const double TWO_PI = 2.0 * stan::math::pi();
+
65 
+
66  // Wrap scalars into vector views.
+
67  VectorView<const T_y> y_vec(y);
+
68  VectorView<const T_loc> mu_vec(mu);
+
69  VectorView<const T_scale> kappa_vec(kappa);
+
70 
+ + +
73  for (size_t i = 0; i < length(kappa); i++) {
+
74  kappa_dbl[i] = value_of(kappa_vec[i]);
+ +
76  log_bessel0[i] = log(boost::math::cyl_bessel_i(0, value_of(kappa_vec[i])));
+
77  }
+ +
79 
+
80  size_t N = max_size(y, mu, kappa);
+
81 
+
82  for (size_t n = 0; n < N; n++) {
+
83  // Extract argument values.
+
84  const double y_ = value_of(y_vec[n]);
+
85  const double y_dbl = y_ - std::floor(y_ / TWO_PI) * TWO_PI;
+
86  const double mu_dbl = value_of(mu_vec[n]);
+
87 
+
88  // Reusable values.
+
89  double bessel0 = 0;
+
90  if (compute_bessel0)
+
91  bessel0 = boost::math::cyl_bessel_i(0, kappa_dbl[n]);
+
92  double bessel1 = 0;
+
93  if (compute_bessel1)
+
94  bessel1 = boost::math::cyl_bessel_i(-1, kappa_dbl[n]);
+
95  const double kappa_sin = kappa_dbl[n] * std::sin(mu_dbl - y_dbl);
+
96  const double kappa_cos = kappa_dbl[n] * std::cos(mu_dbl - y_dbl);
+
97 
+
98  // Log probability.
+ +
100  logp -= LOG_TWO_PI;
+ +
102  logp -= log_bessel0[n];
+ +
104  logp += kappa_cos;
+
105 
+
106  // Gradient.
+
107  if (!y_const)
+
108  oap.d_x1[n] += kappa_sin;
+
109  if (!mu_const)
+
110  oap.d_x2[n] -= kappa_sin;
+
111  if (!kappa_const)
+
112  oap.d_x3[n] += kappa_cos / kappa_dbl[n] - bessel1 / bessel0;
+
113  }
+
114 
+
115  return oap.to_var(logp);
+
116  }
+
117 
+
118  template<typename T_y, typename T_loc, typename T_scale>
+ +
120  von_mises_log(T_y const& y, T_loc const& mu, T_scale const& kappa) {
+
121  return von_mises_log<false>(y, mu, kappa);
+
122  }
+
123  }
+
124 }
+
125 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/vv__vari_8hpp.html b/doc/api/html/vv__vari_8hpp.html new file mode 100644 index 00000000000..ec1a302a67c --- /dev/null +++ b/doc/api/html/vv__vari_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/agrad/rev/internal/vv_vari.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
vv_vari.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::agrad::op_vv_vari
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/vv__vari_8hpp_source.html b/doc/api/html/vv__vari_8hpp_source.html new file mode 100644 index 00000000000..f07c7780d96 --- /dev/null +++ b/doc/api/html/vv__vari_8hpp_source.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/agrad/rev/internal/vv_vari.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
vv_vari.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__INTERNAL__VV_VARI_HPP__
+
2 #define __STAN__AGRAD__REV__INTERNAL__VV_VARI_HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7  namespace agrad {
+
8 
+
9  class op_vv_vari : public vari {
+
10  protected:
+ + +
13  public:
+
14  op_vv_vari(double f, vari* avi, vari* bvi):
+
15  vari(f),
+
16  avi_(avi),
+
17  bvi_(bvi) {
+
18  }
+
19  };
+
20 
+
21  }
+
22 }
+
23 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/vvd__vari_8hpp.html b/doc/api/html/vvd__vari_8hpp.html new file mode 100644 index 00000000000..38a86fae71c --- /dev/null +++ b/doc/api/html/vvd__vari_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/agrad/rev/internal/vvd_vari.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
vvd_vari.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::agrad::op_vvd_vari
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/vvd__vari_8hpp_source.html b/doc/api/html/vvd__vari_8hpp_source.html new file mode 100644 index 00000000000..17840575d83 --- /dev/null +++ b/doc/api/html/vvd__vari_8hpp_source.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/rev/internal/vvd_vari.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
vvd_vari.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__INTERNAL__VVD_VARI_HPP__
+
2 #define __STAN__AGRAD__REV__INTERNAL__VVD_VARI_HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7  namespace agrad {
+
8 
+
9  class op_vvd_vari : public vari {
+
10  protected:
+ + +
13  double cd_;
+
14  public:
+
15  op_vvd_vari(double f, vari* avi, vari* bvi, double c) :
+
16  vari(f),
+
17  avi_(avi),
+
18  bvi_(bvi),
+
19  cd_(c) {
+
20  }
+
21  };
+
22 
+
23  }
+
24 }
+
25 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/vvv__vari_8hpp.html b/doc/api/html/vvv__vari_8hpp.html new file mode 100644 index 00000000000..4a3b80ed06c --- /dev/null +++ b/doc/api/html/vvv__vari_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/agrad/rev/internal/vvv_vari.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
vvv_vari.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + +

+Classes

class  stan::agrad::op_vvv_vari
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::agrad
 Function gradients via reverse-mode automatic differentiation.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/vvv__vari_8hpp_source.html b/doc/api/html/vvv__vari_8hpp_source.html new file mode 100644 index 00000000000..a209e870f17 --- /dev/null +++ b/doc/api/html/vvv__vari_8hpp_source.html @@ -0,0 +1,132 @@ + + + + + +Stan: src/stan/agrad/rev/internal/vvv_vari.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
vvv_vari.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__AGRAD__REV__INTERNAL__VVV_VARI_HPP__
+
2 #define __STAN__AGRAD__REV__INTERNAL__VVV_VARI_HPP__
+
3 
+ +
5 
+
6 namespace stan {
+
7  namespace agrad {
+
8 
+
9  class op_vvv_vari : public vari {
+
10  protected:
+ + + +
14  public:
+
15  op_vvv_vari(double f, vari* avi, vari* bvi, vari* cvi) :
+
16  vari(f),
+
17  avi_(avi),
+
18  bvi_(bvi),
+
19  cvi_(cvi) {
+
20  }
+
21  };
+
22 
+
23  }
+
24 }
+
25 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/weibull_8hpp.html b/doc/api/html/weibull_8hpp.html new file mode 100644 index 00000000000..7f54da33b61 --- /dev/null +++ b/doc/api/html/weibull_8hpp.html @@ -0,0 +1,157 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/weibull.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
weibull.hpp File Reference
+
+
+
#include <boost/random/weibull_distribution.hpp>
+#include <boost/random/variate_generator.hpp>
+#include <stan/agrad/partials_vari.hpp>
+#include <stan/math/error_handling.hpp>
+#include <stan/math/functions/multiply_log.hpp>
+#include <stan/math/functions/value_of.hpp>
+#include <stan/meta/traits.hpp>
+#include <stan/prob/constants.hpp>
+#include <stan/prob/traits.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + + + + + + + + + +

+Functions

template<bool propto, typename T_y , typename T_shape , typename T_scale >
return_type< T_y, T_shape,
+T_scale >::type 
stan::prob::weibull_log (const T_y &y, const T_shape &alpha, const T_scale &sigma)
 
template<typename T_y , typename T_shape , typename T_scale >
return_type< T_y, T_shape,
+T_scale >::type 
stan::prob::weibull_log (const T_y &y, const T_shape &alpha, const T_scale &sigma)
 
template<typename T_y , typename T_shape , typename T_scale >
return_type< T_y, T_shape,
+T_scale >::type 
stan::prob::weibull_cdf (const T_y &y, const T_shape &alpha, const T_scale &sigma)
 
template<typename T_y , typename T_shape , typename T_scale >
return_type< T_y, T_shape,
+T_scale >::type 
stan::prob::weibull_cdf_log (const T_y &y, const T_shape &alpha, const T_scale &sigma)
 
template<typename T_y , typename T_shape , typename T_scale >
return_type< T_y, T_shape,
+T_scale >::type 
stan::prob::weibull_ccdf_log (const T_y &y, const T_shape &alpha, const T_scale &sigma)
 
template<class RNG >
double stan::prob::weibull_rng (const double alpha, const double sigma, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/weibull_8hpp_source.html b/doc/api/html/weibull_8hpp_source.html new file mode 100644 index 00000000000..14e50286ce9 --- /dev/null +++ b/doc/api/html/weibull_8hpp_source.html @@ -0,0 +1,474 @@ + + + + + +Stan: src/stan/prob/distributions/univariate/continuous/weibull.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
weibull.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__WEIBULL_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__WEIBULL_HPP__
+
3 
+
4 #include <boost/random/weibull_distribution.hpp>
+
5 #include <boost/random/variate_generator.hpp>
+
6 
+ + + + +
11 #include <stan/meta/traits.hpp>
+
12 #include <stan/prob/constants.hpp>
+
13 #include <stan/prob/traits.hpp>
+
14 
+
15 namespace stan {
+
16 
+
17  namespace prob {
+
18 
+
19  // Weibull(y|sigma,alpha) [y >= 0; sigma > 0; alpha > 0]
+
20  // FIXME: document
+
21  template <bool propto,
+
22  typename T_y, typename T_shape, typename T_scale>
+
23  typename return_type<T_y,T_shape,T_scale>::type
+
24  weibull_log(const T_y& y, const T_shape& alpha, const T_scale& sigma) {
+
25  static const char* function = "stan::prob::weibull_log(%1%)";
+
26 
+ + + + + + +
33 
+
34  // check if any vectors are zero length
+
35  if (!(stan::length(y)
+
36  && stan::length(alpha)
+
37  && stan::length(sigma)))
+
38  return 0.0;
+
39 
+
40  // set up return value accumulator
+
41  double logp(0.0);
+
42  if(!check_finite(function, y, "Random variable", &logp))
+
43  return logp;
+
44  if(!check_finite(function, alpha, "Shape parameter",
+
45  &logp))
+
46  return logp;
+
47  if(!check_positive(function, alpha, "Shape parameter",
+
48  &logp))
+
49  return logp;
+
50  if(!check_not_nan(function, sigma, "Scale parameter",
+
51  &logp))
+
52  return logp;
+
53  if(!check_positive(function, sigma, "Scale parameter",
+
54  &logp))
+
55  return logp;
+
56  if (!(check_consistent_sizes(function,
+
57  y,alpha,sigma,
+
58  "Random variable","Shape parameter","Scale parameter",
+
59  &logp)))
+
60  return logp;
+
61 
+
62  // check if no variables are involved and prop-to
+ +
64  return 0.0;
+
65 
+
66  VectorView<const T_y> y_vec(y);
+
67  VectorView<const T_shape> alpha_vec(alpha);
+
68  VectorView<const T_scale> sigma_vec(sigma);
+
69  size_t N = max_size(y, alpha, sigma);
+
70 
+
71  for (size_t n = 0; n < N; n++) {
+
72  const double y_dbl = value_of(y_vec[n]);
+
73  if (y_dbl < 0)
+
74  return LOG_ZERO;
+
75  }
+
76 
+ +
78  is_vector<T_shape>::value> log_alpha(length(alpha));
+
79  for (size_t i = 0; i < length(alpha); i++)
+ +
81  log_alpha[i] = log(value_of(alpha_vec[i]));
+
82 
+ +
84  is_vector<T_y>::value> log_y(length(y));
+
85  for (size_t i = 0; i < length(y); i++)
+ +
87  log_y[i] = log(value_of(y_vec[i]));
+
88 
+ +
90  is_vector<T_scale>::value> log_sigma(length(sigma));
+
91  for (size_t i = 0; i < length(sigma); i++)
+ +
93  log_sigma[i] = log(value_of(sigma_vec[i]));
+
94 
+ +
96  is_vector<T_scale>::value> inv_sigma(length(sigma));
+
97  for (size_t i = 0; i < length(sigma); i++)
+ +
99  inv_sigma[i] = 1.0 / value_of(sigma_vec[i]);
+
100 
+ + +
103  y_div_sigma_pow_alpha(N);
+
104  for (size_t i = 0; i < N; i++)
+ +
106  const double y_dbl = value_of(y_vec[i]);
+
107  const double alpha_dbl = value_of(alpha_vec[i]);
+
108  y_div_sigma_pow_alpha[i] = pow(y_dbl * inv_sigma[i], alpha_dbl);
+
109  }
+
110 
+
111  agrad::OperandsAndPartials<T_y,T_shape,T_scale> operands_and_partials(y,alpha,sigma);
+
112  for (size_t n = 0; n < N; n++) {
+
113  const double alpha_dbl = value_of(alpha_vec[n]);
+ +
115  logp += log_alpha[n];
+ +
117  logp += (alpha_dbl-1.0)*log_y[n];
+ +
119  logp -= alpha_dbl*log_sigma[n];
+ +
121  logp -= y_div_sigma_pow_alpha[n];
+
122 
+ +
124  const double inv_y = 1.0 / value_of(y_vec[n]);
+
125  operands_and_partials.d_x1[n]
+
126  += (alpha_dbl-1.0) * inv_y
+
127  - alpha_dbl * y_div_sigma_pow_alpha[n] * inv_y;
+
128  }
+ +
130  operands_and_partials.d_x2[n]
+
131  += 1.0/alpha_dbl
+
132  + (1.0 - y_div_sigma_pow_alpha[n]) * (log_y[n] - log_sigma[n]);
+ +
134  operands_and_partials.d_x3[n]
+
135  += -alpha_dbl * inv_sigma[n]
+
136  + alpha_dbl * inv_sigma[n] * y_div_sigma_pow_alpha[n];
+
137  }
+
138  return operands_and_partials.to_var(logp);
+
139  }
+
140 
+
141  template <typename T_y, typename T_shape, typename T_scale>
+
142  inline
+ +
144  weibull_log(const T_y& y, const T_shape& alpha, const T_scale& sigma) {
+
145  return weibull_log<false>(y,alpha,sigma);
+
146  }
+
147 
+
148  template <typename T_y, typename T_shape, typename T_scale>
+ +
150  weibull_cdf(const T_y& y, const T_shape& alpha, const T_scale& sigma) {
+
151 
+
152  static const char* function = "stan::prob::weibull_cdf(%1%)";
+
153 
+ + + +
157  using boost::math::tools::promote_args;
+
158  using stan::math::value_of;
+
159 
+
160  // check if any vectors are zero length
+
161  if (!(stan::length(y)
+
162  && stan::length(alpha)
+
163  && stan::length(sigma)))
+
164  return 1.0;
+
165 
+
166  double cdf(1.0);
+
167  if (!check_nonnegative(function, y, "Random variable", &cdf))
+
168  return cdf;
+
169  if (!check_finite(function, alpha, "Shape parameter", &cdf))
+
170  return cdf;
+
171  if (!check_positive(function, alpha, "Shape parameter", &cdf))
+
172  return cdf;
+
173  if (!check_finite(function, sigma, "Scale parameter", &cdf))
+
174  return cdf;
+
175  if (!check_positive(function, sigma, "Scale parameter", &cdf))
+
176  return cdf;
+
177 
+ +
179  operands_and_partials(y, alpha, sigma);
+
180 
+
181  VectorView<const T_y> y_vec(y);
+
182  VectorView<const T_scale> sigma_vec(sigma);
+
183  VectorView<const T_shape> alpha_vec(alpha);
+
184  size_t N = max_size(y, sigma, alpha);
+
185  for (size_t n = 0; n < N; n++) {
+
186  const double y_dbl = value_of(y_vec[n]);
+
187  const double sigma_dbl = value_of(sigma_vec[n]);
+
188  const double alpha_dbl = value_of(alpha_vec[n]);
+
189  const double pow_ = pow(y_dbl / sigma_dbl, alpha_dbl);
+
190  const double exp_ = exp(-pow_);
+
191  const double cdf_ = 1.0 - exp_;
+
192 
+
193  //cdf
+
194  cdf *= cdf_;
+
195 
+
196  //gradients
+
197  const double rep_deriv = exp_ * pow_ / cdf_;
+ +
199  operands_and_partials.d_x1[n] += rep_deriv * alpha_dbl / y_dbl;
+ +
201  operands_and_partials.d_x2[n] += rep_deriv * log(y_dbl / sigma_dbl);
+ +
203  operands_and_partials.d_x3[n] -= rep_deriv * alpha_dbl / sigma_dbl;
+
204  }
+
205 
+ +
207  for (size_t n = 0; n < stan::length(y); ++n)
+
208  operands_and_partials.d_x1[n] *= cdf;
+ +
210  for (size_t n = 0; n < stan::length(alpha); ++n)
+
211  operands_and_partials.d_x2[n] *= cdf;
+ +
213  for (size_t n = 0; n < stan::length(sigma); ++n)
+
214  operands_and_partials.d_x3[n] *= cdf;
+
215 
+
216  return operands_and_partials.to_var(cdf);
+
217  }
+
218 
+
219  template <typename T_y, typename T_shape, typename T_scale>
+ +
221  weibull_cdf_log(const T_y& y, const T_shape& alpha, const T_scale& sigma) {
+
222 
+
223  static const char* function = "stan::prob::weibull_cdf_log(%1%)";
+
224 
+ + + +
228  using boost::math::tools::promote_args;
+
229  using stan::math::value_of;
+
230 
+
231  // check if any vectors are zero length
+
232  if (!(stan::length(y)
+
233  && stan::length(alpha)
+
234  && stan::length(sigma)))
+
235  return 0.0;
+
236 
+
237  double cdf_log(0.0);
+
238  if (!check_nonnegative(function, y, "Random variable", &cdf_log))
+
239  return cdf_log;
+
240  if (!check_finite(function, alpha, "Shape parameter", &cdf_log))
+
241  return cdf_log;
+
242  if (!check_positive(function, alpha, "Shape parameter", &cdf_log))
+
243  return cdf_log;
+
244  if (!check_finite(function, sigma, "Scale parameter", &cdf_log))
+
245  return cdf_log;
+
246  if (!check_positive(function, sigma, "Scale parameter", &cdf_log))
+
247  return cdf_log;
+
248 
+ +
250  operands_and_partials(y, alpha, sigma);
+
251 
+
252  VectorView<const T_y> y_vec(y);
+
253  VectorView<const T_scale> sigma_vec(sigma);
+
254  VectorView<const T_shape> alpha_vec(alpha);
+
255  size_t N = max_size(y, sigma, alpha);
+
256  for (size_t n = 0; n < N; n++) {
+
257  const double y_dbl = value_of(y_vec[n]);
+
258  const double sigma_dbl = value_of(sigma_vec[n]);
+
259  const double alpha_dbl = value_of(alpha_vec[n]);
+
260  const double pow_ = pow(y_dbl / sigma_dbl, alpha_dbl);
+
261  const double exp_ = exp(-pow_);
+
262  const double cdf_log_ = 1.0 - exp_;
+
263 
+
264  //cdf_log
+
265  cdf_log += log(cdf_log_);
+
266 
+
267  //gradients
+
268  const double rep_deriv = pow_ / (1.0 / exp_ - 1.0);
+ +
270  operands_and_partials.d_x1[n] += rep_deriv * alpha_dbl / y_dbl;
+ +
272  operands_and_partials.d_x2[n] += rep_deriv * log(y_dbl / sigma_dbl);
+ +
274  operands_and_partials.d_x3[n] -= rep_deriv * alpha_dbl / sigma_dbl;
+
275  }
+
276 
+
277  return operands_and_partials.to_var(cdf_log);
+
278  }
+
279 
+
280  template <typename T_y, typename T_shape, typename T_scale>
+ +
282  weibull_ccdf_log(const T_y& y, const T_shape& alpha, const T_scale& sigma) {
+
283 
+
284  static const char* function = "stan::prob::weibull_ccdf_log(%1%)";
+
285 
+ + + +
289  using boost::math::tools::promote_args;
+
290  using stan::math::value_of;
+
291 
+
292  // check if any vectors are zero length
+
293  if (!(stan::length(y)
+
294  && stan::length(alpha)
+
295  && stan::length(sigma)))
+
296  return 0.0;
+
297 
+
298  double ccdf_log(0.0);
+
299  if (!check_nonnegative(function, y, "Random variable", &ccdf_log))
+
300  return ccdf_log;
+
301  if (!check_finite(function, alpha, "Shape parameter", &ccdf_log))
+
302  return ccdf_log;
+
303  if (!check_positive(function, alpha, "Shape parameter", &ccdf_log))
+
304  return ccdf_log;
+
305  if (!check_finite(function, sigma, "Scale parameter", &ccdf_log))
+
306  return ccdf_log;
+
307  if (!check_positive(function, sigma, "Scale parameter", &ccdf_log))
+
308  return ccdf_log;
+
309 
+ +
311  operands_and_partials(y, alpha, sigma);
+
312 
+
313  VectorView<const T_y> y_vec(y);
+
314  VectorView<const T_scale> sigma_vec(sigma);
+
315  VectorView<const T_shape> alpha_vec(alpha);
+
316  size_t N = max_size(y, sigma, alpha);
+
317  for (size_t n = 0; n < N; n++) {
+
318  const double y_dbl = value_of(y_vec[n]);
+
319  const double sigma_dbl = value_of(sigma_vec[n]);
+
320  const double alpha_dbl = value_of(alpha_vec[n]);
+
321  const double pow_ = pow(y_dbl / sigma_dbl, alpha_dbl);
+
322 
+
323  //ccdf_log
+
324  ccdf_log -= pow_;
+
325 
+
326  //gradients
+ +
328  operands_and_partials.d_x1[n] -= alpha_dbl / y_dbl * pow_;
+ +
330  operands_and_partials.d_x2[n] -= log(y_dbl / sigma_dbl) * pow_;
+ +
332  operands_and_partials.d_x3[n] += alpha_dbl / sigma_dbl * pow_;
+
333  }
+
334 
+
335  return operands_and_partials.to_var(ccdf_log);
+
336  }
+
337 
+
338  template <class RNG>
+
339  inline double
+
340  weibull_rng(const double alpha,
+
341  const double sigma,
+
342  RNG& rng) {
+
343  using boost::variate_generator;
+
344  using boost::random::weibull_distribution;
+
345 
+
346  static const char* function = "stan::prob::weibull_rng(%1%)";
+
347 
+ + + +
351 
+
352  if(!check_finite(function, alpha, "Shape parameter"))
+
353  return 0;
+
354  if(!check_positive(function, alpha, "Shape parameter"))
+
355  return 0;
+
356  if(!check_not_nan(function, sigma, "Scale parameter"))
+
357  return 0;
+
358  if(!check_positive(function, sigma, "Scale parameter"))
+
359  return 0;
+
360 
+
361  variate_generator<RNG&, weibull_distribution<> >
+
362  weibull_rng(rng, weibull_distribution<>(alpha, sigma));
+
363  return weibull_rng();
+
364  }
+
365  }
+
366 }
+
367 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/welford__covar__estimator_8hpp.html b/doc/api/html/welford__covar__estimator_8hpp.html new file mode 100644 index 00000000000..786493a5f49 --- /dev/null +++ b/doc/api/html/welford__covar__estimator_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/prob/welford_covar_estimator.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
welford_covar_estimator.hpp File Reference
+
+
+
#include <vector>
+#include <stan/math/matrix/Eigen.hpp>
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  stan::prob::welford_covar_estimator
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/welford__covar__estimator_8hpp_source.html b/doc/api/html/welford__covar__estimator_8hpp_source.html new file mode 100644 index 00000000000..9596a747dc0 --- /dev/null +++ b/doc/api/html/welford__covar__estimator_8hpp_source.html @@ -0,0 +1,165 @@ + + + + + +Stan: src/stan/prob/welford_covar_estimator.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
welford_covar_estimator.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__WELFORD__COVAR__ESTIMATOR__BETA__
+
2 #define __STAN__PROB__WELFORD__COVAR__ESTIMATOR__BETA__
+
3 
+
4 #include <vector>
+ +
6 
+
7 namespace stan {
+
8 
+
9  namespace prob {
+
10 
+ +
12 
+
13  public:
+
14 
+
15  welford_covar_estimator(int n): _m(Eigen::VectorXd::Zero(n)),
+
16  _m2(Eigen::MatrixXd::Zero(n, n))
+
17  { restart(); }
+
18 
+
19  void restart() {
+
20  _num_samples = 0;
+
21  _m.setZero();
+
22  _m2.setZero();
+
23  }
+
24 
+
25  void add_sample(const Eigen::VectorXd& q) {
+
26 
+
27  ++_num_samples;
+
28 
+
29  Eigen::VectorXd delta(q - _m);
+
30  _m += delta / _num_samples;
+
31  _m2 += (q - _m) * delta.transpose();
+
32 
+
33  }
+
34 
+
35  int num_samples() { return _num_samples; }
+
36 
+
37  void sample_mean(Eigen::VectorXd& mean) { mean = _m; }
+
38 
+
39  void sample_covariance(Eigen::MatrixXd& covar) {
+
40  if(_num_samples > 1)
+
41  covar = _m2 / (_num_samples - 1.0);
+
42  }
+
43 
+
44  protected:
+
45 
+
46  double _num_samples;
+
47 
+
48  Eigen::VectorXd _m;
+
49  Eigen::MatrixXd _m2;
+
50 
+
51  };
+
52 
+
53  } // prob
+
54 
+
55 } // stan
+
56 
+
57 
+
58 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/welford__var__estimator_8hpp.html b/doc/api/html/welford__var__estimator_8hpp.html new file mode 100644 index 00000000000..a3fe53a99e4 --- /dev/null +++ b/doc/api/html/welford__var__estimator_8hpp.html @@ -0,0 +1,129 @@ + + + + + +Stan: src/stan/prob/welford_var_estimator.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
welford_var_estimator.hpp File Reference
+
+
+
#include <vector>
+#include <stan/math/matrix/Eigen.hpp>
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  stan::prob::welford_var_estimator
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/welford__var__estimator_8hpp_source.html b/doc/api/html/welford__var__estimator_8hpp_source.html new file mode 100644 index 00000000000..1de623572cb --- /dev/null +++ b/doc/api/html/welford__var__estimator_8hpp_source.html @@ -0,0 +1,165 @@ + + + + + +Stan: src/stan/prob/welford_var_estimator.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
welford_var_estimator.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__WELFORD__VAR__ESTIMATOR__BETA__
+
2 #define __STAN__PROB__WELFORD__VAR__ESTIMATOR__BETA__
+
3 
+
4 #include <vector>
+ +
6 
+
7 namespace stan {
+
8 
+
9  namespace prob {
+
10 
+ +
12 
+
13  public:
+
14 
+
15  welford_var_estimator(int n): _m(Eigen::VectorXd::Zero(n)),
+
16  _m2(Eigen::VectorXd::Zero(n))
+
17  { restart(); }
+
18 
+
19  void restart() {
+
20  _num_samples = 0;
+
21  _m.setZero();
+
22  _m2.setZero();
+
23  }
+
24 
+
25  void add_sample(const Eigen::VectorXd& q) {
+
26 
+
27  ++_num_samples;
+
28 
+
29  Eigen::VectorXd delta(q - _m);
+
30  _m += delta / _num_samples;
+
31  _m2 += delta.cwiseProduct(q - _m);
+
32 
+
33  }
+
34 
+
35  int num_samples() { return _num_samples; }
+
36 
+
37  void sample_mean(Eigen::VectorXd& mean) { mean = _m; }
+
38 
+
39  void sample_variance(Eigen::VectorXd& var) {
+
40  if(_num_samples > 1)
+
41  var = _m2 / (_num_samples - 1.0);
+
42  }
+
43 
+
44  protected:
+
45 
+
46  double _num_samples;
+
47 
+
48  Eigen::VectorXd _m;
+
49  Eigen::VectorXd _m2;
+
50 
+
51  };
+
52 
+
53  } // prob
+
54 
+
55 } // stan
+
56 
+
57 
+
58 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/whitespace__grammar_8hpp.html b/doc/api/html/whitespace__grammar_8hpp.html new file mode 100644 index 00000000000..ad6c540cc7d --- /dev/null +++ b/doc/api/html/whitespace__grammar_8hpp.html @@ -0,0 +1,128 @@ + + + + + +Stan: src/stan/gm/grammars/whitespace_grammar.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
whitespace_grammar.hpp File Reference
+
+
+
#include <boost/spirit/include/qi.hpp>
+
+

Go to the source code of this file.

+ + + + +

+Classes

struct  stan::gm::whitespace_grammar< Iterator >
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/whitespace__grammar_8hpp_source.html b/doc/api/html/whitespace__grammar_8hpp_source.html new file mode 100644 index 00000000000..cc9b6d0d31d --- /dev/null +++ b/doc/api/html/whitespace__grammar_8hpp_source.html @@ -0,0 +1,133 @@ + + + + + +Stan: src/stan/gm/grammars/whitespace_grammar.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
whitespace_grammar.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__PARSER__WHITESPACE_GRAMMAR_HPP__
+
2 #define __STAN__GM__PARSER__WHITESPACE_GRAMMAR_HPP__
+
3 
+
4 #include <boost/spirit/include/qi.hpp>
+
5 
+
6 namespace stan {
+
7 
+
8  namespace gm {
+
9 
+
10  template <typename Iterator>
+ +
12  : public boost::spirit::qi::grammar<Iterator> {
+
13  public:
+ +
15  // private:
+
16  boost::spirit::qi::rule<Iterator> whitespace;
+
17  };
+
18 
+
19 
+
20  }
+
21 
+
22 }
+
23 
+
24 
+
25 
+
26 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/whitespace__grammar__def_8hpp.html b/doc/api/html/whitespace__grammar__def_8hpp.html new file mode 100644 index 00000000000..bea5c2ae6be --- /dev/null +++ b/doc/api/html/whitespace__grammar__def_8hpp.html @@ -0,0 +1,123 @@ + + + + + +Stan: src/stan/gm/grammars/whitespace_grammar_def.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
whitespace_grammar_def.hpp File Reference
+
+
+
#include <boost/spirit/include/qi.hpp>
+#include <stan/gm/grammars/whitespace_grammar.hpp>
+
+

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/whitespace__grammar__def_8hpp_source.html b/doc/api/html/whitespace__grammar__def_8hpp_source.html new file mode 100644 index 00000000000..1a6f46f2ef1 --- /dev/null +++ b/doc/api/html/whitespace__grammar__def_8hpp_source.html @@ -0,0 +1,142 @@ + + + + + +Stan: src/stan/gm/grammars/whitespace_grammar_def.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
whitespace_grammar_def.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__GM__PARSER__WHITESPACE_GRAMMAR_DEF__HPP__
+
2 #define __STAN__GM__PARSER__WHITESPACE_GRAMMAR_DEF__HPP__
+
3 
+
4 #include <boost/spirit/include/qi.hpp>
+
5 
+ +
7 
+
8 namespace stan {
+
9 
+
10  namespace gm {
+
11 
+
12  template <typename Iterator>
+ +
14  : whitespace_grammar::base_type(whitespace)
+
15  {
+
16  using boost::spirit::qi::omit;
+
17  using boost::spirit::qi::char_;
+
18  using boost::spirit::qi::eol;
+
19  whitespace
+
20  = ( ( omit["/*"]
+
21  >> *(char_ - "*/") )
+
22  > omit["*/"] )
+
23  | ( omit["//"] >> *(char_ - eol) )
+
24  | ( omit["#"] >> *(char_ - eol) )
+
25  | boost::spirit::ascii::space_type()
+
26  ;
+
27  }
+
28 
+
29  }
+
30 
+
31 }
+
32 
+
33 
+
34 
+
35 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/whitespace__grammar__inst_8cpp.html b/doc/api/html/whitespace__grammar__inst_8cpp.html new file mode 100644 index 00000000000..20fae87424d --- /dev/null +++ b/doc/api/html/whitespace__grammar__inst_8cpp.html @@ -0,0 +1,123 @@ + + + + + +Stan: src/stan/gm/grammars/whitespace_grammar_inst.cpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
whitespace_grammar_inst.cpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::gm
 Directed graphical model compiler.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/whitespace__grammar__inst_8cpp_source.html b/doc/api/html/whitespace__grammar__inst_8cpp_source.html new file mode 100644 index 00000000000..ecea640ff27 --- /dev/null +++ b/doc/api/html/whitespace__grammar__inst_8cpp_source.html @@ -0,0 +1,115 @@ + + + + + +Stan: src/stan/gm/grammars/whitespace_grammar_inst.cpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
whitespace_grammar_inst.cpp
+
+
+Go to the documentation of this file.
+ +
3 
+
4 namespace stan {
+
5  namespace gm {
+
6  template struct whitespace_grammar<pos_iterator_t>;
+
7  }
+
8 }
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/windowed__adaptation_8hpp.html b/doc/api/html/windowed__adaptation_8hpp.html new file mode 100644 index 00000000000..1a5fae25cca --- /dev/null +++ b/doc/api/html/windowed__adaptation_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/mcmc/windowed_adaptation.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
windowed_adaptation.hpp File Reference
+
+
+
#include <ostream>
+#include <string>
+#include <stan/mcmc/base_adaptation.hpp>
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  stan::mcmc::windowed_adaptation
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::mcmc
 Markov chain Monte Carlo samplers.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/windowed__adaptation_8hpp_source.html b/doc/api/html/windowed__adaptation_8hpp_source.html new file mode 100644 index 00000000000..ac9c1a0e2aa --- /dev/null +++ b/doc/api/html/windowed__adaptation_8hpp_source.html @@ -0,0 +1,234 @@ + + + + + +Stan: src/stan/mcmc/windowed_adaptation.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
windowed_adaptation.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__MCMC__WINDOWED__ADAPTATION__BETA__
+
2 #define __STAN__MCMC__WINDOWED__ADAPTATION__BETA__
+
3 
+
4 #include <ostream>
+
5 #include <string>
+
6 
+ +
8 
+
9 namespace stan {
+
10 
+
11  namespace mcmc {
+
12 
+ +
14 
+
15  public:
+
16 
+
17  windowed_adaptation(std::string name): _estimator_name(name) {
+
18  _num_warmup = 0;
+ + + +
22 
+
23  restart();
+
24  }
+
25 
+
26  void restart() {
+ + + +
30  }
+
31 
+
32  void set_window_params(unsigned int num_warmup,
+
33  unsigned int init_buffer,
+
34  unsigned int term_buffer,
+
35  unsigned int base_window,
+
36  std::ostream* e = 0) {
+
37 
+
38  if (num_warmup < 20) {
+
39  if (e) {
+
40  *e << "WARNING: No " << _estimator_name << " estimation is" << std::endl;
+
41  *e << " performed for num_warmup < 20" << std::endl << std::endl;
+
42  }
+
43  return;
+
44  }
+
45 
+
46  if (init_buffer + base_window + term_buffer > num_warmup) {
+
47 
+
48  if (e) {
+
49  *e << "WARNING: The initial buffer, adaptation window, and terminal buffer" << std::endl;
+
50  *e << " overflow the total number of warmup iterations." << std::endl;
+
51  }
+
52 
+
53  _num_warmup = num_warmup;
+
54  _adapt_init_buffer = 0.15 * num_warmup;
+
55  _adapt_term_buffer = 0.10 * num_warmup;
+ +
57 
+
58  if(e) {
+
59  *e << " Defaulting to a 15%/75%/10% partition," << std::endl;
+
60  *e << " init_buffer = " << _adapt_init_buffer << std::endl;
+
61  *e << " adapt_window = " << _adapt_base_window << std::endl;
+
62  *e << " term_buffer = " << _adapt_term_buffer << std::endl << std::endl;
+
63  }
+
64 
+
65  return;
+
66 
+
67  }
+
68 
+
69  _num_warmup = num_warmup;
+
70  _adapt_init_buffer = init_buffer;
+
71  _adapt_term_buffer = term_buffer;
+
72  _adapt_base_window = base_window;
+
73  restart();
+
74 
+
75  }
+
76 
+ + + + +
81  }
+
82 
+ + + +
86  }
+
87 
+ +
89 
+ +
91 
+
92  _adapt_window_size *= 2;
+ +
94 
+ +
96 
+
97  // Bounday of the following window, not the window just computed
+
98  unsigned int next_window_boundary = _adapt_next_window + 2 * _adapt_window_size;
+
99 
+
100  // If the following window overtakes the full adaptation window,
+
101  // then stretch the current window to the end of the full window
+
102  if (next_window_boundary >= _num_warmup - _adapt_term_buffer) {
+ +
104  }
+
105 
+
106  }
+
107 
+
108  protected:
+
109 
+
110  std::string _estimator_name;
+
111 
+
112  unsigned int _num_warmup;
+
113  unsigned int _adapt_init_buffer;
+
114  unsigned int _adapt_term_buffer;
+
115  unsigned int _adapt_base_window;
+
116 
+
117  unsigned int _adapt_window_counter;
+
118  unsigned int _adapt_next_window;
+
119  unsigned int _adapt_window_size;
+
120 
+
121  };
+
122 
+
123  } // mcmc
+
124 
+
125 } // stan
+
126 
+
127 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/wishart_8hpp.html b/doc/api/html/wishart_8hpp.html new file mode 100644 index 00000000000..857d9c5f0e2 --- /dev/null +++ b/doc/api/html/wishart_8hpp.html @@ -0,0 +1,153 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/continuous/wishart.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
wishart.hpp File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::prob
 Templated probability distributions.
 
+ + + + + + + + + + + +

+Functions

template<bool propto, typename T_y , typename T_dof , typename T_scale >
boost::math::tools::promote_args
+< T_y, T_dof, T_scale >::type 
stan::prob::wishart_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &W, const T_dof &nu, const Eigen::Matrix< T_scale, Eigen::Dynamic, Eigen::Dynamic > &S)
 The log of the Wishart density for the given W, degrees of freedom, and scale matrix.
 
template<typename T_y , typename T_dof , typename T_scale >
boost::math::tools::promote_args
+< T_y, T_dof, T_scale >::type 
stan::prob::wishart_log (const Eigen::Matrix< T_y, Eigen::Dynamic, Eigen::Dynamic > &W, const T_dof &nu, const Eigen::Matrix< T_scale, Eigen::Dynamic, Eigen::Dynamic > &S)
 
template<class RNG >
Eigen::Matrix< double,
+Eigen::Dynamic, Eigen::Dynamic > 
stan::prob::wishart_rng (const double nu, const Eigen::Matrix< double, Eigen::Dynamic, Eigen::Dynamic > &S, RNG &rng)
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/wishart_8hpp_source.html b/doc/api/html/wishart_8hpp_source.html new file mode 100644 index 00000000000..3831d127267 --- /dev/null +++ b/doc/api/html/wishart_8hpp_source.html @@ -0,0 +1,256 @@ + + + + + +Stan: src/stan/prob/distributions/multivariate/continuous/wishart.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
wishart.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__PROB__DISTRIBUTIONS__MULTIVARIATE__CONTINUOUS__WISHART_HPP__
+
2 #define __STAN__PROB__DISTRIBUTIONS__MULTIVARIATE__CONTINUOUS__WISHART_HPP__
+
3 
+ + + + +
8 #include <stan/prob/traits.hpp>
+
9 #include <boost/concept_check.hpp>
+ + + + + + + + + +
19 
+
20 namespace stan {
+
21 
+
22  namespace prob {
+
23 
+
24  // Wishart(Sigma|n,Omega) [Sigma, Omega symmetric, non-neg, definite;
+
25  // Sigma.dims() = Omega.dims();
+
26  // n > Sigma.rows() - 1]
+
54  template <bool propto,
+
55  typename T_y, typename T_dof, typename T_scale>
+
56  typename boost::math::tools::promote_args<T_y,T_dof,T_scale>::type
+
57  wishart_log(const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& W,
+
58  const T_dof& nu,
+
59  const Eigen::Matrix<T_scale,Eigen::Dynamic,Eigen::Dynamic>& S) {
+
60  static const char* function = "stan::prob::wishart_log(%1%)";
+
61 
+ + +
64  using boost::math::tools::promote_args;
+
65 
+ +
67  typename promote_args<T_y,T_dof,T_scale>::type lp(0.0);
+
68  if (!check_greater(function, nu, k-1,
+
69  "Degrees of freedom parameter", &lp))
+
70  return lp;
+
71  if (!check_size_match(function,
+
72  W.rows(), "Rows of random variable",
+
73  W.cols(), "columns of random variable",
+
74  &lp))
+
75  return lp;
+
76  if (!check_size_match(function,
+
77  S.rows(), "Rows of scale parameter",
+
78  S.cols(), "columns of scale parameter",
+
79  &lp))
+
80  return lp;
+
81  if (!check_size_match(function,
+
82  W.rows(), "Rows of random variable",
+
83  S.rows(), "columns of scale parameter",
+
84  &lp))
+
85  return lp;
+
86  // FIXME: domain checks
+
87 
+ + +
90  using stan::math::LDLT_factor;
+
91 
+ +
93  if (!ldlt_W.success()) {
+
94  std::ostringstream message;
+
95  message << "W is not positive definite (%1%).";
+
96  std::string str(message.str());
+
97  stan::math::dom_err(function,W(0,0),"W",str.c_str(),"",&lp);
+
98  return lp;
+
99  }
+ +
101  if (!ldlt_S.success()) {
+
102  std::ostringstream message;
+
103  message << "S is not positive definite (%1%).";
+
104  std::string str(message.str());
+
105  stan::math::dom_err(function,S(0,0),"S",str.c_str(),"",&lp);
+
106  return lp;
+
107  }
+
108 
+
109  using stan::math::trace;
+
110  using stan::math::lmgamma;
+ +
112  lp += nu * k * NEG_LOG_TWO_OVER_TWO;
+
113 
+ +
115  lp -= lmgamma(k, 0.5 * nu);
+
116 
+ +
118  lp -= 0.5 * nu * log_determinant_ldlt(ldlt_S);
+
119 
+ +
121 // L_S = crossprod(mdivide_left_tri_low(L_S));
+
122 // Eigen::Matrix<T_scale,Eigen::Dynamic,1> S_inv_vec = Eigen::Map<
+
123 // const Eigen::Matrix<T_scale,Eigen::Dynamic,Eigen::Dynamic> >(
+
124 // &L_S(0), L_S.size(), 1);
+
125 // Eigen::Matrix<T_y,Eigen::Dynamic,1> W_vec = Eigen::Map<
+
126 // const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic> >(
+
127 // &W(0), W.size(), 1);
+
128 // lp -= 0.5 * dot_product(S_inv_vec, W_vec); // trace(S^-1 * W)
+
129  Eigen::Matrix<typename promote_args<T_y,T_scale>::type,Eigen::Dynamic,Eigen::Dynamic> Sinv_W(mdivide_left_ldlt(ldlt_S,W));
+
130  lp -= 0.5*trace(Sinv_W);
+
131  }
+
132 
+
133  if (include_summand<propto,T_y,T_dof>::value && nu != (k + 1))
+
134  lp += 0.5*(nu - k - 1.0) * log_determinant_ldlt(ldlt_W);
+
135  return lp;
+
136  }
+
137 
+
138  template <typename T_y, typename T_dof, typename T_scale>
+
139  inline
+
140  typename boost::math::tools::promote_args<T_y,T_dof,T_scale>::type
+
141  wishart_log(const Eigen::Matrix<T_y,Eigen::Dynamic,Eigen::Dynamic>& W,
+
142  const T_dof& nu,
+
143  const Eigen::Matrix<T_scale,Eigen::Dynamic,Eigen::Dynamic>& S) {
+
144  return wishart_log<false>(W,nu,S);
+
145  }
+
146 
+
147  template <class RNG>
+
148  inline Eigen::Matrix<double, Eigen::Dynamic, Eigen::Dynamic>
+
149  wishart_rng(const double nu,
+
150  const Eigen::Matrix<double,Eigen::Dynamic,Eigen::Dynamic>& S,
+
151  RNG& rng) {
+
152 
+
153  static const char* function = "stan::prob::wishart_rng(%1%)";
+
154 
+ + +
157 
+
158  check_positive(function,nu,"degrees of freedom");
+
159  check_size_match(function,
+
160  S.rows(), "Rows of scale parameter",
+
161  S.cols(), "columns of scale parameter");
+
162 
+
163  Eigen::Matrix<double,Eigen::Dynamic,Eigen::Dynamic> B(S.rows(), S.cols());
+
164  B.setZero();
+
165 
+
166  for(int i = 0; i < S.cols(); i++) {
+
167  B(i,i) = std::sqrt(chi_square_rng(nu - i, rng));
+
168  for(int j = 0; j < i; j++)
+
169  B(j,i) = normal_rng(0,1,rng);
+
170  }
+
171 
+
172  return stan::math::multiply_lower_tri_self_transpose(S.llt().matrixL() * B);
+
173  }
+
174  }
+
175 }
+
176 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/writer_8hpp.html b/doc/api/html/writer_8hpp.html new file mode 100644 index 00000000000..404b973cdbf --- /dev/null +++ b/doc/api/html/writer_8hpp.html @@ -0,0 +1,130 @@ + + + + + +Stan: src/stan/io/writer.hpp File Reference + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+ +
+
writer.hpp File Reference
+
+
+
#include <stdexcept>
+#include <stan/prob/transform.hpp>
+
+

Go to the source code of this file.

+ + + + + +

+Classes

class  stan::io::writer< T >
 A stream-based writer for integer, scalar, vector, matrix and array data types, which transforms from constrained to a sequence of constrained variables. More...
 
+ + + + + + + +

+Namespaces

namespace  stan
 Probability, optimization and sampling library.
 
namespace  stan::io
 Input/output utilities.
 
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/api/html/writer_8hpp_source.html b/doc/api/html/writer_8hpp_source.html new file mode 100644 index 00000000000..c6fabe32230 --- /dev/null +++ b/doc/api/html/writer_8hpp_source.html @@ -0,0 +1,332 @@ + + + + + +Stan: src/stan/io/writer.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
Stan +  1.3 +
+
probability, sampling & optimization
+
+
+ + + + + + + + + +
+ +
+ + +
+
+
+
writer.hpp
+
+
+Go to the documentation of this file.
1 #ifndef __STAN__IO__WRITER_HPP__
+
2 #define __STAN__IO__WRITER_HPP__
+
3 
+
4 #include <stdexcept>
+ +
6 
+
7 namespace stan {
+
8 
+
9  namespace io {
+
10 
+
23  template <typename T>
+
24  class writer {
+
25  private:
+
26  std::vector<T> data_r_;
+
27  std::vector<int> data_i_;
+
28  public:
+
29 
+
30  typedef Eigen::Matrix<T,Eigen::Dynamic,Eigen::Dynamic> matrix_t;
+
31  typedef Eigen::Matrix<T,Eigen::Dynamic,1> vector_t;
+
32  typedef Eigen::Matrix<T,1,Eigen::Dynamic> row_vector_t;
+
33 
+
34  typedef Eigen::Array<T,Eigen::Dynamic,1> array_vec_t;
+
35 
+
40  const double CONSTRAINT_TOLERANCE;
+
41 
+
49  writer(std::vector<T>& data_r,
+
50  std::vector<int>& data_i)
+
51  : data_r_(data_r),
+
52  data_i_(data_i),
+ +
54  data_r_.clear();
+
55  data_i_.clear();
+
56  }
+
57 
+
61  ~writer() { }
+
62 
+
69  std::vector<T>& data_r() {
+
70  return data_r_;
+
71  }
+
72 
+
73 
+
80  std::vector<int>& data_i() {
+
81  return data_i_;
+
82  }
+
83 
+
89  void integer(int n) {
+
90  data_i_.push_back(n);
+
91  }
+
92 
+
100  void scalar_unconstrain(T& y) {
+
101  data_r_.push_back(y);
+
102  }
+
103 
+ +
116  if (y < 0.0)
+
117  BOOST_THROW_EXCEPTION(std::runtime_error ("y is negative"));
+
118  data_r_.push_back(log(y));
+
119  }
+
120 
+
132  void scalar_lb_unconstrain(double lb, T& y) {
+
133  data_r_.push_back(stan::prob::lb_free(y,lb));
+
134  }
+
135 
+
146  void scalar_ub_unconstrain(double ub, T& y) {
+
147  data_r_.push_back(stan::prob::ub_free(y,ub));
+
148  }
+
149 
+
162  void scalar_lub_unconstrain(double lb, double ub, T& y) {
+
163  data_r_.push_back(stan::prob::lub_free(y,lb,ub));
+
164  }
+
165 
+
176  void corr_unconstrain(T& y) {
+
177  data_r_.push_back(stan::prob::corr_free(y));
+
178  }
+
179 
+
191  void prob_unconstrain(T& y) {
+
192  data_r_.push_back(stan::prob::prob_free(y));
+
193  }
+
194 
+ +
211  if (y.size() == 0) return;
+
212  stan::math::check_ordered("stan::io::ordered_unconstrain(%1%)", y, "Vector");
+
213  data_r_.push_back(y[0]);
+
214  for (typename vector_t::size_type i = 1; i < y.size(); ++i) {
+
215  data_r_.push_back(log(y[i] - y[i-1]));
+
216  }
+
217  }
+
218 
+ +
235  // reimplements pos_ordered_free in prob to avoid malloc
+
236  if (y.size() == 0) return;
+
237  stan::math::check_positive_ordered("stan::io::positive_ordered_unconstrain(%1%)", y, "Vector");
+
238  data_r_.push_back(log(y[0]));
+
239  for (typename vector_t::size_type i = 1; i < y.size(); ++i) {
+
240  data_r_.push_back(log(y[i] - y[i-1]));
+
241  }
+
242  }
+
243 
+
244 
+
250  void vector_unconstrain(const vector_t& y) {
+
251  for (typename vector_t::size_type i = 0; i < y.size(); ++i)
+
252  data_r_.push_back(y[i]);
+
253  }
+
254 
+ +
261  for (typename vector_t::size_type i = 0; i < y.size(); ++i)
+
262  data_r_.push_back(y[i]);
+
263  }
+
264 
+
270  void matrix_unconstrain(const matrix_t& y) {
+
271  for (typename matrix_t::size_type j = 0; j < y.cols(); ++j)
+
272  for (typename matrix_t::size_type i = 0; i < y.rows(); ++i)
+
273  data_r_.push_back(y(i,j));
+
274  }
+
275 
+
276  void vector_lb_unconstrain(double lb, vector_t& y) {
+
277  for (int i = 0; i < y.size(); ++i)
+
278  scalar_lb_unconstrain(lb,y(i));
+
279  }
+ +
281  for (int i = 0; i < y.size(); ++i)
+
282  scalar_lb_unconstrain(lb,y(i));
+
283  }
+
284  void matrix_lb_unconstrain(double lb, matrix_t& y) {
+
285  for (typename matrix_t::size_type j = 0; j < y.cols(); ++j)
+
286  for (typename matrix_t::size_type i = 0; i < y.rows(); ++i)
+
287  scalar_lb_unconstrain(lb,y(i,j));
+
288  }
+
289 
+
290  void vector_ub_unconstrain(double ub, vector_t& y) {
+
291  for (int i = 0; i < y.size(); ++i)
+
292  scalar_ub_unconstrain(ub,y(i));
+
293  }
+ +
295  for (int i = 0; i < y.size(); ++i)
+
296  scalar_ub_unconstrain(ub,y(i));
+
297  }
+
298  void matrix_ub_unconstrain(double ub, matrix_t& y) {
+
299  for (typename matrix_t::size_type j = 0; j < y.cols(); ++j)
+
300  for (typename matrix_t::size_type i = 0; i < y.rows(); ++i)
+
301  scalar_ub_unconstrain(ub,y(i,j));
+
302  }
+
303 
+
304 
+
305  void vector_lub_unconstrain(double lb, double ub, vector_t& y) {
+
306  for (int i = 0; i < y.size(); ++i)
+
307  scalar_lub_unconstrain(lb,ub,y(i));
+
308  }
+
309  void row_vector_lub_unconstrain(double lb, double ub, row_vector_t& y) {
+
310  for (int i = 0; i < y.size(); ++i)
+
311  scalar_lub_unconstrain(lb,ub,y(i));
+
312  }
+
313  void matrix_lub_unconstrain(double lb, double ub, matrix_t& y) {
+
314  for (typename matrix_t::size_type j = 0; j < y.cols(); ++j)
+
315  for (typename matrix_t::size_type i = 0; i < y.rows(); ++i)
+
316  scalar_lub_unconstrain(lb,ub,y(i,j));
+
317  }
+
318 
+
319 
+
320 
+ +
336  stan::math::check_unit_vector("stan::io::unit_vector_unconstrain(%1%)", y, "Vector");
+ +
338  for (typename vector_t::size_type i = 0; i < uy.size(); ++i)
+
339  data_r_.push_back(uy[i]);
+
340  }
+
341 
+
342 
+ +
358  stan::math::check_simplex("stan::io::simplex_unconstrain(%1%)", y, "Vector");
+ +
360  for (typename vector_t::size_type i = 0; i < uy.size(); ++i)
+
361  data_r_.push_back(uy[i]);
+
362  }
+
363 
+ +
376  // FIXME: optimize by unrolling cholesky_factor_free
+
377  Eigen::Matrix<T,Eigen::Dynamic,1> y_free
+ +
379  for (int i = 0; i < y_free.size(); ++i)
+
380  data_r_.push_back(y_free[i]);
+
381  }
+
382 
+
383 
+ +
396  typename matrix_t::size_type k = y.rows();
+
397  if (k == 0 || y.cols() != k)
+
398  BOOST_THROW_EXCEPTION(
+
399  std::runtime_error ("y must have elements and y must be a square matrix"));
+
400  typename matrix_t::size_type k_choose_2 = (k * (k-1)) / 2;
+
401  array_vec_t cpcs(k_choose_2);
+
402  array_vec_t sds(k);
+
403  bool successful = stan::prob::factor_cov_matrix(cpcs,sds,y);
+
404  if(!successful)
+
405  BOOST_THROW_EXCEPTION(std::runtime_error ("factor_cov_matrix failed"));
+
406  for (typename matrix_t::size_type i = 0; i < k_choose_2; ++i)
+
407  data_r_.push_back(cpcs[i]);
+
408  for (typename matrix_t::size_type i = 0; i < k; ++i)
+
409  data_r_.push_back(sds[i]);
+
410  }
+
411 
+ +
428  stan::math::check_corr_matrix("stan::io::corr_matrix_unconstrain(%1%)", y, "Matrix");
+
429  size_t k = y.rows();
+
430  size_t k_choose_2 = (k * (k-1)) / 2;
+
431  array_vec_t cpcs(k_choose_2);
+
432  array_vec_t sds(k);
+
433  bool successful = stan::prob::factor_cov_matrix(cpcs,sds,y);
+
434  if (!successful)
+
435  BOOST_THROW_EXCEPTION(std::runtime_error ("y cannot be factorized by factor_cov_matrix"));
+
436  for (size_t i = 0; i < k; ++i) {
+
437  // sds on log scale unconstrained
+
438  if (fabs(sds[i] - 0.0) >= CONSTRAINT_TOLERANCE)
+
439  BOOST_THROW_EXCEPTION(std::runtime_error ("sds on log scale are unconstrained"));
+
440  }
+
441  for (size_t i = 0; i < k_choose_2; ++i)
+
442  data_r_.push_back(cpcs[i]);
+
443  }
+
444 
+
445  };
+
446  }
+
447 
+
448 }
+
449 
+
450 #endif
+
+
+
+ +      + [ Stan Home Page ] + + + © 2011–2013, + Stan Development Team. +      + + +
diff --git a/doc/stan-reference-2.1.0.pdf b/doc/stan-reference-2.1.0.pdf new file mode 100644 index 0000000000000000000000000000000000000000..627074dd975627b8517cf4b1393d66296d6d5c48 GIT binary patch literal 1319059 zcmdSC2OyVS|36+RD-^Q#D9ZlWWbc*iRmjTTBa$*R$|^+@5h)`@R#Fm)M3R-Vi56wF z{^wkmPd=pX`+0uP{d}MQ<#vs8-tY5Xuk$|d>wNUNx%E}l_=N?;NVwacJ$OMP!Y0J# zx!;9NR+dE2=%AMao8a#KE{1;YB!YTu!a_nMf@;n_zJ6?yLZT#sIu0IAeh1iuMI=Po zkOTI*`8oKo397l-`Z=gL*m>GJkjTlA`1<)c*t(Mh^_(}^>)9*0`OsX^i-(`vZgOz% z8O-Eq<8rsP>Lt(>5Dc8V+nAtjlzZsp$@*`fBzErkR%xM$ud;>TJJ2a0+Lcs`=ZaBM zmQGTxQi_HKDJ3uQo|MMoN1D`J)E+_lJSpM!Su_SIC+VA*!h*ubxGx;APd&NqWG=UW z)>aSt9ERp_kyuMj^TLXKCX=e$cz4eekMNx2ePpbbo@?b4q_|^*_Okx2CwUt0vo3Kw zxPCdy=rX~nEHfTW?)@bNd?Zu321BXa_)8cgMaVh!vhi?USENp$yi`w>yly}7quA%9 z`kR#w?5H!jB&S8R=hCrl>{Oc4b-Q*F`$h8UA7QNLSH5%7^4K9>x?_H0)C@ zvN@!USy7M*tP|&;wOViPd-#F-lb8%5ea(9hN{%Q*FzmQ*chfqL!uu|_K)b$x2?v7^*k!?K%|Ptw=kGZqOW;?Qate{Z3EYu!G+OIzOWuRHhDs%)%G{yD@Cskbl`oXG1!7`4*ohzf0kd z^Y5`}Y%>(+R7ve_B#u94&f#k!f?xM}CvA9(#B8y>vJZu~<^$dEAcOU}>!|Y0q^)k) z?9n%)iMz<=TPJks(y*GQeo9VC{MeI;Zu(sz9p@xwr_Qh#v$m9#zAnG=QMe|kB*>3p z>Qw&J&^N{o@1f?&R8J3=DvRFZpZ0$FaqK#AzoGEkeeLamndYC2#~5lQzTEsa+!O8U zZ`C+4{BPL|EyGd`N?Esl0yuX2CQw(Fn|?vFgaK>s!0U^u?tycV6xwyoO*f{dz!d*!T5CqZ+Xe#dho5_%x1^EX zkk^$GdlA@hkg;cA!hy)KOD>bt(qH#(_}TZZes#vaNBjted(x6O4gb*d>e*fQEWPsO zQ&yqtV^19Iwuq$aaM_j3w0(JW*NR}viEEx`ZPedAu8$*ba_`EfP>x^cyp1DxHexR! z>HKllh|zUw6RrIXEa$pkxrGGk_>IW8TCB6P9XBSj5%+r$F#5_PB6j>~cBSWsbjwhu z{sWIBatSLwFey9=(9_+c!{4pvQ}HBv>>}Rrk2E;-Zi#EJow-T)kDFg)ivvfDLy~i_{OPW%8UklI|9S)-)~Z}=(Y zEo9_Pm)~|}PLHaErXBjG_@Q($(st4GV`RNNMk?z=qE%k-<43IYUkOD5zci9Kc-Su` zL2w5WEQyGu5KgLHN~IVHNi>tP{dFphGSJ<9UuaX!oaubSwk;9^no?OM!~}$wycC%p zF;r^0lJ1SEuiftaXd_W%@UiLHU0-U>C~csoA^tWd+mh;6DCrg5V}ZYbF*{0c%oe5Q z%0J94tK;z{E1j}#e)uYXzhl3Va1~#Mi>Z;v;u-5rvO4UYN*h@2B|9)2OX4AmmkqS+ zVs_^YD6u>(5Upz1@Ty@~RjXKY$zfyBs{NQ0Z5!>=68v6DjMHsiT_iv}lajkG|~7 z4b9)%@lfe)oOE&I2a(pJ2af9WUc4RB<=!=YW_}|1ttI14g9*j7@(0Sq6d!dip9y?( zBZ$?TFiGj{&h=c>4DWd7TH}Z&Ol!R?hYdCkeXeckYwz4$DD$1miQ`pDsjThy^}Iqh z=@N8qUgmdi=EO^|SJLnyLM^9@6!s31N$EY0R{= zVw+JVz&sNqC*)6l^TFLD^oLJM?xz%;nz_{L*z)45&q>rWBp#H|rZ2??A~ zqN}DEST-H({73{1{rCGJ>!_Ni4_HOv8KDp+5!5$QH4^|Urh}fXy8|1KfPf(SpPQ$X zr>~%|pREVH<9D}p_7L#0cjR5-(6@DR(DQfS57t@iAetVIo+{3EerzI=P!$6bK_w;6 zAT~<~F%dBd0SS!M(p7XXShsC`{d7I;ogJMW?Adr!q(y{;g@uKLF~XvvQo>UFLZaJ+ zgtkLz&JK1CaA>3&&~$V22N1UP^Yj5?BoQ%SX%{qb@b&cfv2*Z6s8oae)D8W>;*UJ3 z8v^-~QcJXg`aYgs4nBU)OSHPmpjQg&XaI@?I2N{|kdTu6s|lbH>vmfAgoD_os4>s2 z-FJ1jdk=CMGSufqS!^;>h-Zz(%eVbOIpF=aV8>>q$$JMEN)i(jL*>7|7Y?1DExGJ@ z=i3<;YgX=C!ZSAy|LC6x7Wn#UX6VZ7cA3H2>h^bu6azoZ+Ka;E@8mKRd^-5Zz=w_xZb~3R!*LiyS03N@{#zcUh|F4rvs{|$0jHC(?4<9*U~;xk&waH z71y!zblL5Sv3*;GUvAya>6z*)*2_YinAX(UM-nI>@K%KXbPrWX#&x0I&-E8AMi=}| z#JgI1$7V!_AHX!yHCR7sVjyt zS*-c~sfT@xQro$dDlVM3nan77RDsimMf!OS3u4& zQ(a3_8~jo-KJa`Mu`Subx2LK|(}g#P&s;5WN@lAQ%9SmwCN?`Cbh}?`%DDCP%eSMk zZ#J2ppZYXRP)#+QcevezUAy<%NBaw*+(SYXRO3gS)aFArP*rT}UPq=dF;7N#(tOLk zF1?y0ww!f-GU-!&{oPs{8?-`4p6g|iOfX4$?AdHgS18J6Kp{62xt&&jy7OFL|CgFw zG>w;-O{mY5QBP=Mi2J7GI?HVPGkXGOABaZ+16ivq%plMziqNP!cF(?0M}(t2Unj@X=*&CJD#c@`FKxb*9X!H zntVg<$27$QG-7WCnpc9?-JZ+AUg8gM*4>ly|0RuwRD6%!>QYHfN~5_NZB20H*!I{{ zp)M4AC_B~3MpLgvOU@1%Uv76iz4!fYX%&CN;i$z_gO5Jyw3SQ;sJI;jn-y(luW|0& zmhXKd+~?$0{hmE+)!7-Z-(6xecRSa{;ebc`C8;#Jjmp*V>t<`0-Uq3QA{Wx$9hpSPX54kkKrrX-x(er`Dh7{a1(P|| zoEf5YDh0Co*5h|<*bwABb~8YQ)wn%=sLf<(9eMgF=@|=sm+rHt)!kA?f^0Ed3jL?vG{?*{HBZUFi&2|?^iWi@6y-JSnI#%U9;;!K>whb>| z&no)&LRln}Io{^ExM!oPw{@QqTBb7ql^@Q%1NBz&MW$_gqh+x)i=x6&(l9{a% zoF`P)X%{ittZcM?@eE%Nea~kWr^-D6%;75AYR=7GJs7}GSM!;LT0m2?s^4UjewUb| zQT5Qqp#9wTs=g_%Ch8hzwfg<4G)24UV=JX^#oB3Cg|uC;$lZS|B!7{}nN=}R=GKHV z)zxNBye&O6$IZV7CI%~E-reYWRUqk@kZxbWyK^L=cxUvU7IHQ=azi`z?YdO-L0V56 zp2p}A(JCk74G~;z6Wym&X|T(s{FuTEaxo#^`y(!Hha~F2TT&rC?792b~3}; zp>vwvdV_6QsSM5LZF;q`$1>wL^E4%VJjoN3N4i&GuaZ`E)I>*a*knX}>9>UM1ul*F zwcH~7#y0ca2c~F4Z(pNh%j4vA^wW;_+$_?UGsLp#7H4c#g7SUyhMLXy2cD^C$Ylix z1#})hJJe*ckjt*@|2nf)o0T;=GhbanHrk)^(wYwPA<=jzPM#={F3jhy}596;~NipJI%_8|j;p;SQ00EQD16vhY&3$uwx zi%PNS>p}usj{sX=U*}-hEsl}IfHoyhe-C?S4<}ILfJO;%HhwV?F*Z?*7#qKcxC9{3 za0XS$YAOLy2~mVp6x2haqJUmhKtvc+MoUa8o_7B34jz7>N&(f3ud=6`r;o2Ro06NY zohuozUd$TSYOsK_^aoj1(lrSR>rVzMxc-W<%~_vxK## zJ7_U<@bd%OgR!Aom37UvaYX`)mVS6F4IG@Dk(vv5XfJRVGBPNl+--ea0Xs1LFN}f= zMh@;?a61O^7Dh;10JsSw1uwV{=-@`cLWGWALPS7ZOiYrEUtAI+ASo^(!X_>*EPxTk zfF@xf38V?-S@xSlfU`rOG@G8MhXd>qvsU!+GejdNDk>zz1`13eU^476@ON|YG4^ow z17?W8CMncqpe}WATWUi1!A=t5DFA9P!15U##>m#k$-xhnpl<$t2qGo15b0S9iBWJ6BKXaYdo&tFg`3n0I! zwr~s0&jHRc_zZBSth+ppkdT0`ArPwSVXy4z4pHk%wpK0>13ItD1tP-2Qo^{|;GdaJ z5bZ_>z-x+!tuqLyu!tn`D+!cV0;u)?6W$iYSy)I^h)u&Gh)wCBpMx(Mw-7im7+6}Le3fcr^LMl{0Xc@eRBcXPwfdgs;eF^EvxZxG`H0n##S12d!fp)+% zsynJ1DjjN$a-x0kj2@5*+6T{YBs7Ak)o33YG1vpCpncc~qh3LIp?$C&K0)iy_`@@* zIc$MXkP6xd&uA1O3ZQ*h$tXs!7=W5XZD1?3533oxgZEG_>Nn^eI6CZsvfvr|99~iF zpgbrA<%DNQfjuA%v<{0*XdUE6twwvHeXs>mq4&UpV$VSlsV+31J z32>}s3`1$q8Z6qN=I{wpp@@L?L0w=Qv=6Hnyo2|sT-0w+bEpMsIg|%~QN7?5Qej6& z`O$vZ3ax|O=*)!nq47kmhG&!pT8QEo+J*H79GQ$8azWdmP4Eo+Q9q%h!B&U}NCPdx zq63W>d_rYHDi|?%hE&iZct(AVY6NMPJqcwmdjqR0q=W}nF1$x$q^t}!WRL@1(X0se zXploh1npVAiXaDETj8;M6-5p*ZZR>mXZb3I91;>}`|?!+IV8av3J-WiWlJs{ii&8@ z@>LNzl$6l+<*O2Mka4T1pgqf1735G=McbFJs>p%1!ZVCFJfru}H|QN~L!Zzquunu( zSyW6-1tX@WrYNZ>siq<%Dxm_-Qeq+!D)3iA1-2`ysi}xB(ZF^Q2{Eupi%7s9^y#mz z*s;`9#8lMOBvi?`;W$gYlIRtA2KRrw0(nsOG6&QUj4A;}1=@;8f}g+832Od#v_`EH z6G1&A2E3;zDWL*oLvA${5#S{_63_tnM-*UE5z+onqyJsmYwNdy8v`RHD!F9$l0|>= z9pL^e@BX2G$!ZFe=TC@>=FT~7_0`O2rmZlJ6IVML8kuQX#e+`|4uV> zUW$Nuxi)5?=43^3SR%pV=TO+L4#K9UY zDGFLZ6$gC}X64eFupDpL`mg@}FLEQeMQT%M4}33O`L>H9`Cmf|F3uo7V)uUuslSsg zg63Ian32%>O9+WKtkJR2{WYHdf5bTwQLv}8^zMdKnc!0%h;Z=UkKGgbGkX6Qk@~B~ z;18kTDzjwOuSmsmpgr)s8Xc>j|2L2-h5=T=iePEi25Sez?ehFwSu6anBNag(VYA++SPDIjYzh2=}NE!~%|$^*9_y2&p1aU!a)@_0aF73Omx%wdQ9<94gvHR@@~hsfy}S1F zKb2ds2!lBRz84_R2vQKVA*(ei8|=>@YaKevmhpwB34UOZ!A{OcnKlnkD}xVoJdBN-X2Nh`4l-vi)!vy{C7 z$7)|39tf#7DVz|+9G5AL<35(8f$rLD{)ci9I&@xxeUGK*rFrlZ^JqV?3Th5VT15w*5j~LF zXjLC}EHDPlOsI@MMQa&FD}9R_F)Tl-%St+I+tMsuvTE&!A<@FlbYR8Gk+8n~eP#mu z;8>D`;16hq)W6GCAU;RxLWnTX574?4H=x^6CSK+N+AOz04M4=e$bfI@lQ-B8eGFP) zruao`&<84U>}}k&0{ODz>Z_R=?j}ky!!|^d}AwUSw7v(h!Z8N5h>ZSdU>d-7?i$9)rEO zUc-6}p#^hU5?~VYI;vD(}#S(f&k%Us~k+zh5p|llz=={R& zqF|)}s^uBFiUUgnqlD;>jE}5*xa%6O*OtBXYYb3LSNjv!YfwH)C84^!rXf}UJ#oiI z=zuNIZrt`|u9dC0+^97WmjJ0?3}}@w7$3BwnHgYvc^qgdc9tz;7`7pKZRy<@@M5bL zfGP0wGuI)!s!KTq$BLD9uhRA}^YT)5fU!o&=GL`kM+yy9$cIQTcCDJRUyKGGw*Om!y=lD8|DC%4;Qn`(pJmE zK108uvZ2+&u+~r!7G8;0tUs{x5<4o=j(81A0q5UxFVqzNtjfvA48Y1qu?FQLF~Gqv zuAT56X!=X`#l<;RE_R${omP*8^%Oe4v2@Tnlydb*tNGzGid5)5I2zO+^*bW{Co16+ zuoQX5>W@A{pJRJaU*JlGEm*zKN(`5FDLX7-WZ5%oj$PPKabf~AN9mB>HS#OY zDhT|9rADp6T8C}LY7ViFN&_p=A2J%;0YH$4`~@6PAE^`IUIZ8!_!(KpK<&Ch4!||) zN0bJYx$L#&Jh6mxBwJ!N0~Wwa3#o^(D+^ZpSdLUA<(E?R2+}{BxLafH&TOI>_x5N4c#vAp}(iQL^l99R;a;@k^ z(2uodCDu?%gco=beJfmw5%TVg+JKCc@pb=bQN5V3Su>==vI!f+z)UI53r{O+m^7lyrY03 z8qy%y7tn!wbavwU3%<1=Xj#s^=zBBVfq*^*$69k5R}XZ4Bl@DdVQW=izpZv5_p)|a zYq4IzUB#eGB#r<_*u1(rr-Fzg|9%2Hw@_Pu7xkswf?x}gjKu?-qrc0x=sJz;kRhW3 zp0)BRY=!+`B%m+qFDyO0qB#|@2>2MW3rrJ~Zp|yy3DFeNU~?)iE3!sG`=D(|3nCrKl_-+IU@)euevzw??fux1%)zw-;qjaUaW z0EppAKf`B4573K_wmRNG3lvp|y^tH1;wN5!w^p|U*>I;1dBX$#Rz-aNb9G-D2bB)S zUYP;0SVQbu(j4ge6YD59lI0Q2SKGDhwZGwI#4_9wP;M+I#0%<$W#552Y<5`k>2d_t zjyEy}z|is-I1=GJ0W%Jsp={h8QqYE*7l8+`SY6I>i04(|8Ao#v5iAAP669?PMK{m{ zjJ&+B3$XjAwFEl?HbN|E2d9z+a-pvwAJztxcPVb5AI%Z46|EH!I)DXK zC%_G`jkJM%EhJJn2*JLsqBZibz33=VGswGa<*)M%ontF$AU(>9&7#m2Y)-`;ZMDyT z9S2K|j0l{9i&jK7f z_wQbRjTmAPcyGtPH!ZCY*b3q2yBO4eX_ov%1876$%1`eipS3Q<1mYEX3m_2cE)4e9 zpcK%Hd5zZdLQpAvz73Ym=4gTNFgL8a9!UEakn^9z+Dh3lT43rgt!IC2_u3SH@*J+${#kAWaiIP~KNW=EHvnZL zt$(Pif3N$0A|wCn7Nh$7PBz30h!|oeO1T!2aPr!}fHCYy{}k5N#yglv$lq=M+3w#* z3D?8F^V)xj8&(d;XL?W`z#sDVE`t0G@n321-DL~twaRfzgu#oEs` z6?xBC%m06}`&Tcm9^s$mMyh8}`NQ`nfF!V50BrrtV*kfD2es0l{R4Wz{vVhMAQwYQ zY-U00^R@E;7;_b}etm{MUmol4aNyD-5nC+-Xa`pa4DzOejQtzy{_lMb*J}7p7--c2 zs;Zx#f?&XV2euaZH8TG!Qh${P(E)zIt}lEi!hl^`^zHv&kKCFOTOGmQKL3IiY^;$z zsXxUU+VtOuH}sGwvihO(9R52RR5qG-vEQ>Hkb)iTl5%f!~F{^#8B{-)ky_^QD*? zu~ViYyBVt}YpvM^>c*^$wJwWy&t-2l)xw*8jmNFUL-@?3u_?p8*-@g0kZJMZx2Zt4 zclQ~^H?y5g^Vr-}_-!W0QFdl#Q*iJ2Y{UYG#-XvAHxIZ}JQ-WQZ>o}Gc+kb7c<5#n z*ZiByNnK?0{wMkynekuwpNia*u$^`;sqKEU%$CzJbsNmXYVK{TzAv4_p zJ?lZYe{)|_51Xq-@xz?l-3FFT7YCk>gbqeLJa)fc#m(D1q1dQsb7LgaP}_r7uG@yk z=|YHkRn`w?RrPX8#`e$D52>l*GYuY8aqs2iO_17H<9dl)r(x^ZONv9=y@&iye5K(P zrGC35q+E^UlyQCRX4aI=tT&9vH#U_ub@F-bL00KjlDWS9c279( zl=5<>7l&AypE12=?W~bqIzy4pWke`m_gq{$U)uO<8`eA#9Nkp3<3&eKS4UuKcPbr4E|* z%;tMk)G$W(Uod6o`{P?+dS);gdoVrkO!8w}t`OzN-^^&=hnJHsmh;Wy8?cj`!U@Rl9@%y8=Hj$8ECo9D7W<({DNW~`a>+7xi;W54FByKdu)hR^x}vZG>( z7F;v#Ce+5vK08FI+H1d_cr)`Nf951#F8#p<-i1IprW3VfiizcUH{a~NlE#9^w@tL1 zZQ^!U6j}LRNoL8;_QMjLnc0gU8Ke)4y(pA#snDV`r+Hj`*D-C^T}P4bQ>kv%b@yD&(drE}CYX>zHv?x8N#%C`Xx$ ztbC$I!bZsp{jFY1dY&0Py> z)N(628I|?L=T5?bj;k)C*K{P1sbvKDvh2mU^h^!F{Pkb%`KX^}%mdW!%k+N8fRIRG--MB&CMp zQ~juKO4ko{_RrZfZ09_$N^B)4>`EVPsPEPqcU2_3C`Rrh&iGM9hS#6icJt7gb7V)y zy-$o8J|zelE-IZ1!s{{N@7dOol$1BTyX`LV=-a?i2lJG)NHPt{qog_2k#GDhZVj4Q zW#%4ly!VOl=vnR8?+sniOZuSN z4aa_-Ny5zC_l~_SKXx&tWT)@-%lC6Xx@(RHOKqoZT9==CEg@lXFkkROC7o4_wHjuM zz|?=s{LZn#2In7|XYW2c`=o8$c)+9AwphWOp)a6(58K0AC6=N2r|hqrtCi{Qs(Kc_ z;lgEZTGlfgUe6hbRooTWnU}Ch_;ZRrUq-`)Cy%XP2QKV6oVabDS^K+`$ZIUmWjj-i z)vh?<%YPQ{v@ed{I_p=P>c4Qi!?!f{ZC-7a>qM{6M4Nxn_ajd(HaNd`m=3-yb$C6!Q|gubU~zrHeDp(yvWGO3hT7l27NwJ`N+umqNltcs$WftNpC8V z=jK1Twa90&xi-YmtnW=HaoIVWA=*H%l_BJ-27p$%( z2$|guXTP~Nqed%-}X4k-02{*E3;Nn_mlSdEc~93y@fh#ag>bp z?G}xk^`AAEsB$0JJm%`C9UWtTe4`IPqPD$5Dwd%+`*@v-Q0~IqC} zd9IiqE)DaljESyqsvDGa+9}R0s4Fbj?8If88+N>uxI*;l3}uR^pdQmJ-Vf{%-By;4 zBSbsL(|f-0(@DKZVL!gR+>Lm;&Muc<**tiMD=B#lhhDkO0nY*jb7wpKOMKg|CA9nE z)2m$BTv>2z&nHI4d-@0Om(^!om~7Z%^v!Bv(`6#^euK-@20caBd`Ta7<)0^fcBF%U@7+C@vt|U>KfJG-si7+P_|%4xxIDg# z=|`UCXeB&Sw(5+Z(I<7jDsX|YOTU=o;lxOr{pgMyqf2EwaxQgXTyM$FjyI5~x^Nh1 zKPfmboop+%!?>fg<`aibcP)F+o+pNlNh++9^lh&!yo5UIY;0VrObkr5>%uE7$Xj-0 zT(yZ4XfYPjW--QWdI5MUsM@-(d%vypZg&C!Mot*i65afk%v^{nI3iHoviQLa{UaU z;RlZq;?pBiOl3iw<@}6tJ-X-iMyDUSaqX;7!6rH(Lo3qb^$9)#L7-l&~_EM8M;RH(l%ZT{JKupGJUj#2AZr|mZp;7Pq{op=`_NVKIB zsD8hPvU*RD|MRAond>t>l_XRLc9VaW-$-sN*b?^R;-bqNcgBbJ!lLf(r=`E-&tX0E zxk)qQS*i12Nyp>+ty!12dq$(TZAkG+`M$X8a$y>`*7W1Dm#6O@le_R`L`E?@ifW_V z#-{OMhi1ujFEiwsS{Zz~zJ1gFG{-C+*^AdO?nfd$C-i8YBHXcm%r?t>)j1!tK`MW@+o2_idkPy_f!!2 z=bh-38oGa0d}RK-@!iNDD&eD&-gQkMqIhoI$zm;u6t6BN7hNd3EPLeL%MS~tvx8yg z8wP|(PgIy&Y;+z7ycPW2nNgpfCE#S$pk>4XCi7z&i^KQck7v(14-AtDs~csX@2|_l zOn&+@?x!atlM%f8y1dQ<4B2dMj^)tHtVdI^y+3KEz{ojQhCvT-(6s;UO9)13M zp1iDx=f11e<|Jfa-=|%ht-0*QDlQYFCm1QoQbf)ync_~`Jn`dD_jiBBF+q{N#ChSb&>mM*^2@da=bX2sBxMZ|Hv+a78Sav z*!Q;Ys!!KwvRduGbKga=)}$>WW#@LP{L^^N>*xa((+ydxwF+Lp^)joTCRhJZe}?$c zr*p-G!ilauQ+=uF`p+86t!w7JYrEe0)x4xTwe0{YaX(-5holVM(VRRzQ!7tFc zZKG3uf9eEXD2GeLsF^dzgsGdAifQKdyW0NE}2p3*;`dG^lx=?GYGVc?AY;f1C>wMfiv$c_7^H` zVjigtw-r^`QP3LBYDYb|*^jsKI9=;dyG(EVaOh=auQul9*EVg8&oYk5a+TgMd`2~~ zbKRrx!(VFIE}u{7KC{Poht^h-y-MyST33rsU+>#Ys3| z<89J@`{$}zdRnqOj`7j89cv+LqztYjB7W?6NVZP`!(pu9rrodb^w7b^0KLE$pBBY< zIH$HrOkUf#v9oCAwv>HKhyH9OC+6FZqg^^g2a_Mp$@&&+4ad-)7d)oO{4qr+fVk^~ z942A&VcE^vk) zv|>;`v!QoOUB!nRbV{y24%T*mk80@l@HSPqCDl2ou#cvmR(8I@%UpTqpcq5lA(R7Lha zG^T&@tY4_4-c9e`v3w5iJWt*?cR7tk9W!zXk9{$xsqhRwrC#vS{F}m!z&+k9=hqwS znBL(usrQOxF3~dy&~!hM&|nZ3d}}oQqdE0Noa?nhle;Mv^}MXH-|80fJWiRXOLQ{c zF>sTU>+kRt?AxdNZXqGMxU!s`Q&55ExxNQ+2mOes-Mgrp!z0t=&+6{PNVll#*WM+i zG;uZ?^V}ltAMVj~La1D7f=AyX?#k>d>34HIx)IgV%|oy1-vqWwJ1HD9-1b#8eV=+l zj@A4Ym80+8ce>l0VF}!?Zcmiur?%;=L~5crx0u#8B{J{u8iRQg#~V@iDdW31tgLDps3viTS>}u&$fck<`ysi&Q{1^578`n_ea> z>U~d{W`^&a8?DQH!5EA0a!qLe5LGc(*$eFtXXgndLldgTvtFovQNJk0F%cKzrWkzd zjB1H5x$WuP0m0P67iquLj2`K$VmcmaGM3e)>NRyTqWmHisdI8lU0wF*5ecKcF5|qn zIVMEfRnC7`=aYGE_Sh`=S>88Z>*)JU_sLBh>A7qtHB}RQ7UB)7g0o&zlDuvr(>|WC z=U_CsSDQ4Y1y9L4f)wJpBtblbIS&7-_miP13+a2}4sUJdwI)8fJ7T{>Z{JP6soQer z{A&pF`Ca1|F~;s2ZpTX-i>p};N3ibkkhr36WJ)%+Xlt5KRXcrIMs@snfeML6*q01y z&2k2!(c}cq^M~H@NskBKh}^7Lv2i>x^})NjQu)J*RfSbN*R)Eq5+qxC?)jREDXHe4 zVC8*5eck2hpzs(+QC!eErX%eSt}&fwz~_7`p+F=NFW~k3`2F$I#rI3I@(u9TZP~a7 zUqMXsy=thyIvb+%jBJud#V6>~3{AryKM|3MD@bxR&!`P(H)VIAPbW*F^hz`{p;4f_ zGI0LTIz^dxLnN+woBD0ewAb?|9?X4H5)jT7VBw{Hh~LqbVex(a&exLWy_}8276ur9 zNLl5-VoDOGEX`8BputA-@CiS{TjYfH4m|Z>HEYoAOf&NIHoKrt z*8FJlNLPl-^Aj!)$b0)e(HMRqi0`4#_2}ydA;bqRWFt0V3VO_)F>uLCQiuxr#vEM#)$xC2@wluEO z@pjI!pbiI`&8l71yeYOkGD5d*`)mzg?{2dX@A!f6UF8w(8uxV)qef;XhvTlVF{(5kIz};gtf$v0iy?feZKY8$gBSDrXiJIxN-G;IZSA+@eX}|4A8B4bI?<=Wa47x7Ma*q7%2)Zxn-Y(H%?cc!)f<=k5Vh%&<$mkj1l6>& zM6q`UimuMnt2>!?S@T&|=ky65GaTRaDAdAUK1Q{A`zLny%uMC+DEEbK={M{^xu@ z+S@wf6D|Z0>h8gF(%fe!W-?1Ay$de`pZH~zEq+`4QNJ%u=Qg>ghMhgGsvYRELGaZ9 z&P4`~8x`F_{655)w<(`ky>@TZ*e7TlXvgB}JJZg6GXAi?bV#&`_sdunj`rvfPThTe zXSuo)${wXeg;83~GxC;Qe#GqAW+uB(dNB5r#Dk(XuUb_}ibr9ZMeUzdZgDRX+`*UH zC^jf-GuX)0s>zf^ue*6qEXl@_FSDVGmLb_k%7mM0!oF^H=_hU%RMx7!HCbBiVynN>%e=x;jpI0w#k1ddPhMv`}wcU?SsB~8RcLfe%7a0xk+ z4rcy@p^fynnbLWgR+cZ>qa*(A34&*D35%9U@0kw0E`c9LL{}UsWq52_OZ|v3l~G~r z07jMbdAs0c>vp0!rO2QoNzcc{WS*;&tRFpABH)>3!=ZFH<%rR}cXw{cFGicyk*g`l z>}=$1OVF{L%uTtvW%5Gi=JgFz*$kT`?mbH;F=scTBG#@~3isT$zJvNjOIF+`wF~TX zE*VDz{Z246XKcLWc~>TM@Qi6!z1mqynMZrr>a>jV5$Y3D zVK(o{Hxpc17z>e^P%I5gtdpas^l;iOQ2v}7Z(6cOzQA+c4R<3l@jLfR(iS2a`o229 zDxv(op-TGX1C8+Tll@fF>aO>9kN!9jzIVgEvdSZ;O(^#zKkK*pK`$Y>bD-z7<# z_xmdA5N-R;`g}q9hkmAfkLO+$y7)`x?<>A~1hViHVy<|w=riCuJTpBtAP@dO;8`Jo z7W0nDa-IWZb4S&yP85&mW)++{yR{@-X7XOZsg6$@DBoz+o}_6jB@rW}r=KVmzD9AG zT(G7;{d?8b6XkCSm~zVw#Z|xIWS*hriF z?A~MFPlvxVY$IQv2dyiH56>&+=1yG;{5jHc;(0qL7l?_cZ9nA?KO$neKbRlw~6&^yK!&WA?Y>E<3Tx@*N)rdn`Im3UIon%`&2K~4QqctnnP%{Z|44le$4iP z7=6aB*4yt#zDV_wg@`rBgg94!NHTr5UQ3{PBH+lyoPE9r({vVj-b&A^30MEn8$P95 z{GuqtNy*f%`kv8LCvV-}%p1#~4-4$bWNB;1mZE7!Rua)H`Z`MyH z58k77VSIi6^UZpy9)}fU%5%C|CG0-XdTJljI(RWiZ5Kl$$#J<&B{Y14>~`5zEY=PBUuw^G>={_1B+4x z>utt4W<8Vr$vY_0vq{b#;o%#!x^|)U-fr$(i{Q9f4JV&nGpuE%5)xs`2a_~u-&WNR zFglIzr3jkh%(@XH=`L*=NB91^z&w5bLB7QO3zsg@sqy6Y(fE{c(lCkBwUB(VNE~u$ zju}vSmVf-1e#jFIlXsTHHB*QA7^hm2Tw}jpK1?4kp=OuND#$8ykflj6%Car$X!cq0 zvr+1WJu@`qhu$Z>it^z!8oi8{+jFp9sObflOxusopY`>kuOyk9f5TK(X8Gj5!B_FQ zbxZDb=PfPHvQ6^++XSj_U8OSCYg$ZeYdTMAw2%L)e%Q5l33?ZgK1_Lk%5CG$(KkU& z0RxjtM*IXS+I98TIo~+FG#HQF7BOE8U}MT8ZR$JW3PqJek{e{Egq{=mV;PF~L6T z_1!2gmAreBzyGM-V3C_d{ekMMWe<67Vz}C=7>>J`JwDw*JHIo|f#Dh7hkfzv6{@>v z6f1BRl&1`)iu@^OwH1=sZsiB{XC-YK2&85}&+_;BZ;RK?w@JRgGCa}#dl1o7NG zJr$@*Q4!XVQva^anmm~!kz%mcuRQ%gcF~4IJ>qw>1JC8ewZuHok>>NGEJ`d8p=`q6 z&gng?RIKZ*G2Zjk&Rp^HXJetV8PzW;O4{-U3d>S9x7kz_&&ehzoSxl;XSxfNw(inK${mQ7Xry;DqO z(|bI(53-T5d}Q15oSq;pn=$67cTY_Ak!+vu`;E&+;)Wt(`kpv^Fl#!m6FVYu_(t}P z1nIEr3^EpU13aW$eK)gxv_^^@ubatjD6mnDlW`(cuZyK89$>=%bjfhnWis2>Y&wjo zQ+MLp??_bp(uD02s%(kx2rP{2ZgzQ^Z^4(4WRrMPtM&8y=i4X>G_ISeBygI1*_*dl z?%XxnO;Yx(uMfNtVBu6?%IMFK->H0VGigb+`?@bLG6jcdCFYyL2Tq78&v8<*y`LKn zc)PcRp*LNJvDif1gb+Vs`V(VDWBrgXg*p4qq9dBp3RMBAx@RB97dZ+x4(~5_GO7r( z?mvFxeTD0JFZT^GIW*2Ea#`1!&uN5|`RMILcFpLgOh zo*K~3pa?pgv>QX@X*Os^l6vT_-~)ZBkQ3&mUa4DqrEki(eX;19xuezi?W^$?Iue()?*mX%>02Bj>+UA308| zrdrnL9D1@# zzV4d78GHGJAce1m!fmIfH_Ulb#{Pu*i?0~2ocrh*s!B4H+{OMrrkDC*Ug$jq`H?UR zGRomBgTV~4jW64KyZm}ym9sR6yG~QAKbSU0v8_9?RfuWG#}CSz}$R#N9V9e1;&+{fFQy_uW(VJM}n)=$@#rnxA68M=d%m!9z$&^-xzXF zhj3pLNY1dBmV3&bLCBAhyu<4AqX_dxE8o$*->`V1`S9b`IRcI*uI61bFCHGBmI^rU zK6YB>F88-63^QYn?Irf4fPwd?w4^k@tn=los^}9<%HOuhxKZSSBGHF?yY-T#Qm1Z* z<0YC>Nizglm2A(kw0jtL-kgH6P0Nfu@cej&IyYZo6A!#ap%Kd`>l~6>NW%!mcGj?Z%J4X>V^+;#O|T zfY(WOJKe|3Ijvv$$$9J<$29f5nXrfwFZf_|eeA()E0&zCwXJH--xzXWeAdy)D+ z@4@Xw{+<|va)Ih6+8Sxc9X{&iP=0tTxt*>u$HHlPZ&V#mwUwwnW=(s(X{IY;^KnK)X4N5z~vDQDZ}E(eWP6DDm; z6A5u)`RftM_hJU-nH4q#>l~6NB$!M7c<2jtx@p{P`oR+G&YfL&=WbAF-=(eCZ9g8I zsCgl;@l8j9?+yX46dlpTm(~={>f<9mhY#;+r?@248Ax2QmA#ZBLsgRdwML}(kAux^ zpK`O-JEjW>^7*vsY`?hg5cwr%{ZsC-j~7lcp3wFOuunF(!Bb6IpTeS{M(>>5w zq<(yqsVBHaKV#A`LbD)St5WgN%n4nifGhI{^TL8nUM{v!X3f;_>oB#7S3i*$epvMe zFV9k|`Z*?SWb9nmx9F$F)_!;6vN}Giq`7_ALUZCu?05vt)=;8>A2MH~*fzu@*{QQ_ zNgv$)Sa_Ir=#F2$=cD}f++g1?#mH6nL2e%lOH)+Xt}KD@beB`IM-N3Z(|NiQ(`ybivduS9o4Kr`)h=U} zqWQk{j1k-Tf^d9rV|q-yW3<6xxHI=Se7>C@a=mq;NU!riSm2>BN>dmw4RLPNLP(iP@a5Ap0p*W9D|!u9O{i<*4c0j`}Z#eJSg44r)vX zZ+9Tm^9A(|+`7PmBd1PLQ?~60RRxlWo(R#*8OF@KWw9RA%@^F}bUFjE{88&t@=&S? zjr(wDCe=U8V@x68dyH1dPCgYB|14=yK(`snW#Eo26oI$PE4%^z^i$sH8Fcfc6X( z7z+a^j8dZ`FWxS%1`9R-fVq^F`?8`uV&lF!Pdi z|6H57*ud!26G>p~e*)rN=TJLaxj%N{3cM8X;GWzW%L5j(VXGfix4_bR01_w&gdS6#&@j$zfdPkzyy&ZYqZA&E_W5%ttQ*!S* z^|ErskU{#*x}$OG)q#CdyE+_R1!-lCvY}eGHe$>)Bc}e;8*xlAGjNG$&wSYxYn57H<@|xv3ExT{PFv&HA3T-fu1; zZQ$jJVTtp>!;hNgXFpqT3m_1DK*l*Pp)wV?N&-aF&@E)rC)5K z=++(otqn1+7USe9)ZxfvRYt@zq4nG^4Ii&t=J4_&}%KxK< zvO`2G{&~^@p_8CBkDvO&O>lp_Jv}Z%HUZ<(aIl^@mw$6h>wFMy(UcBt*U{%6CWyJx!4HxZz(Vz&QX zlSHr|rzvN)FhA)HV&u!wj(mNSzhf^W;z7M@ko~T|2?meMkH_`zpWoxyg#3q#Ha`3s zzMT)Yw?BfcsPve&Eg!F*+0(`mA_NgS_TxWH_w3!bry*HiUElB{VY6Nx{NxY*HvXBg z%DKI~?_qz1&e>BZl@Q>k*;D?^7!ff=2kxAFj7xf=ehT}LPiho7wWDF>az1}cp`dXJ zb}*LLLp7&mCF6SCn`dR%4`o&-P|r?2@(>jNEjElt`CwECNJyIcz#8eFHmF|^u=uf! zmvZ_DL7`Yc#SonX>Vs-4Xh2S!5=P79x$>#v{?QMd?eD>DPk%+bKsUU~zl!ZuFz^Ly zk;oVn#*wykPueKGvMAj{t*ihs6O1toI#)XmQmSv-NRXK!BdM_5l#>Rae` zRbVb)eV1i*X<^Q(imuhROO@ozJz>Q1KOAxy$n{@9dPMNHrnG1&YJC z7(1uGLTPnr(ubQJ&&VlEVPRLfZ!z=vM7z*`wI;(ToBB+NfS-|}NE7p5q1E|GQvfe* z(*>lXR~FfBjhN4u81XRczEK(_F05V_nZiT6`u;{*beV$mZ;IPT!AbMype+ORG-L)D z#h}S992LVvW`MSD41$K0r3ss%$~f!Zp1Rc;BasoYMK+MGXD1E|R6Q}$_E?iu3Uy$h z4c&K@J)->yS=cZz_LlVZV zBC-X+0ZNS_Vhf@>KS7o11?X&$p7d+&e^zicBH;decj(WTa&3;#79cuG-F9YlnPXV5 zuRjyRyF5x=46z)u$2}HcBOyX5o`M6tKDSgj1w@$87T)2I;-ZZIB4?AObL+6o6!wjc zQmnK{HJm{6_b&lYytNOAd))3;azvY-KYQ~R9q>87 zu6#b?UODDI(A4CM+6+%+bE;VEzwT+Xng;+yo=T-D^%snB5q5_OAH{um90KBQ*&mjX zkI=gZji^vOg3^}poB{r2ftER)O6kHhd>)Ol6$-a8<^e*{cfN*#!7|$NyjjAtM$@~B zqGEXn0*cmEmIOQrkWc|k?nXnNe#qVf&UknX8-(6w=)aK+VwyweiE+G@l`E;=BoDei zcO@s)^RA?l0L%!3QJ@%2QsZLPfx#x&#Zvlx1(;zqRtvWHT_+egII&d~si_Jgs~Ya1 zqjugDD10+CDBRJ7r{Bn*TCIC4^)g2N#;0I` zppa@mYg`~!1Lg#uS|JV6xl>eD?eUQs&VVIg z0FR3i5}k^c#o;)@f^K%}=7ww{Wf>GtqecF2f}g@KbI^1Mo~DzFB1 z@_r(fh3#0vyHG9}=wYHTU4q{^_bu3hlL~vvVo!m6x4L6zn3H*69<#nU;E(&##Hgsq z9S*p&n>|;h!A;7>zIofa*-soepz(5U3QCM7 z;zqHyq5C|+18l=@=+?W)*&qSB!x4%TY^z;*Lif0!*^rAmLfo^wKBbiAR8`rd?R4Rg z3v32;pG`h{ZtJgbRU>*{PbwYpEtB~1mV*viiXv0_ORH7BqF3D2KyugmPF47?s2ySk zW{pzm52q~eP~nHaJ_l{=?c8f*2MN?~$~lMVWzH393 zRb8>5H2vP`2D}rC9y`|incaML>hO+WkV9WjN|T0fd(t=Ua$`@hS)gtGhWyU`F>s}4 z<7bBV;!S<_S^n-)VqjzcP;GVZoxb$H;FY@$_s_#~AO(AkRn%VjzNNeQ;T&{f{A}w@ zq%iQ6_cnSC2En%*XH`*nn=^QQAnvcA8=~+ttX)6$bK*7qt}q%k>D7Gj--?P^W?aKa zOs$KrC}_UkJ~r$)>?t*0xj~Kbm9R@5F?UP#F|`{yoG;7($ZjI2@U@;?-wgdKgTw)R z0}|_wR1S(eWH|}3p?dtX+|w>&&|y&OFmzvXMVDuej~ADmB>lVLIe14?0^z%kp*Re& zzW}-0uowHr;I%5`Zr_#Xobm92$INc~zkO3fbB~Nz4VqsD9js)^`jmsCSv)uEZY23s ze)U(9CvxgHo6%9E6!bORN4|2O^>iuwS<_fm_cHo}5uyU}CK!Rabqz$g?(0BL(U`>; zFqxr284p6_`J}~pmB&^m8=H;?jz9n#@i=AfD-q+>+6RW>RwQt{SGCPDXyTU4jgAxv zS;dOu@a5UV!{ux9-6@L|)yth+=Ds)Q_iH2z^o%4s{rreKc2 zsDl1n=c*z_E!;fD`SPo4MkwZkCYEv2UR;x$jR&%gUWN2gGwfQ%TFU5zi5_P4z@Ds= zH6+fa*4X)P0=)j$C?)CnsR=o7tvYLu^yK5{k!P~M_9}OUPJpBj*w8p+AIFJY*m(Si zz!1u!ToJ;8DWE8tnHZWkpOlU>k`Md5lELrWO;loSB^_|B#`bpv=WGlw2Q*;K7&aaw zBP%f_#?PG=3KdapNu(qf|2!J!%=s*&%L#S#c0Zy>RW3+sHPcj-e;^JpU@3KfG%Xu~ zo>sBs7vu4VK()_V-nl}E3B^Vr&mS#ItYa;4RtZL z%_K!XOC%9`Bo-SWJ0Qsl7Eq2b=<6~y07zQHvCSznF0>oxArrpO9PBEQOB4LEqO>G* z+-=~hj<%9wmjX5g`SQbHoxu^8dhjYZ$`WC#GeQ_nm6pH?sDFWKgFIN* z1XwQZiJ1}QQXVUWmJWTs6|htl!lyX0kCnnp_}tV7*=b+oBzK08o*m;P#b|FJ05+ps zfW2G500Np6g~5acx6T!@MW%+X5{1wQgy$owO)!;9foJV-&L5YiuAqLYKG1WRTU_Gg z;L7;E!6Fv8EQqRAZ(%xy5Xgh>KCQx|c@SA8etJ}EQ}u}%rN&5;%;kf#4do5B$&wi(r4%9aF?pFo^fi&l`XXHUq@ zU8U3>)EFje3E>+CF#hKN$g(rgSv?jGdsD?m87c8ueAKMy-3L+$vDkOvlvfM~^HWQW zcXSkmRYfWq7zhXZ0x~fr0i_pWF^CMbsHaDPnIPD7z=T{_m!f3fqk#gy<2&Cxxj=No z-();CqgjrH2@9{GplT)t#y?ny&vNeRw{N(fV$yXi8}E{em?6YYB?}eBv+q`v=h9HV zF!PNmEMG_206D9L>h_eQ6omIDTY`XL$A*u>X6p<1v+~6$pB59wH_@$)hG|M~aEMnm zF+{^)=5F&IjBfi{^-wK`?Q<`JMya&c>o*F4Y#B;<)uAR)_i`)DcK)^~h3tvgN%`6& zEZ~_-IfhE=w=n)@g}L-bLm!OvwBd-+w9JGpYtW9!BBMJMa(RgH6EPq91H}OFbM$kB zGPN^tc5yN_wEf@7-pC4yiIe^R-+9Q&#=-pmI1j7UFSHJ&5PXApK%_N*B>~t`(jlt| zhzSV7nZwm_#8h72`gU^2E<$dLHGiM)A)T$bRb8oCq&~A2blz0ejxBmHXHxUfBMjs^ zRF9X1nOv7-$Y<<988c_l28dBfeCFvT7bL$FKd3RP~h04c=rZp=NrB_JbGb+XFA>b@d#A~c1 z5Knq@kqlgdgL^JYaSba&eCVIPAo^CJ<&}|YJ@+RJV2Oen3&vvk1>gBo9Jz|8{(USW zdD%SNiR8gm$n+^tfl3K$9g=%nw41oKIom@Mq1xQtntg_PVK0w>+N3ciN9S;>E3H?Y zjCav7TW!QRE*U}3i`WFa0{TqprFioq7@~jO3_{SQL5LAhb7vd0q6-bjL@i;L45(F~6fUjM$6p#hHCIFddXKqV%`D$*NwKBYE}X0RO@0 z9IkmG!>dza&VZ)N#FOI7bFI09S6@TUd#1(ZaW02qrx)AJTHtwEI~~`mMWvA<)U}bgkBlRu4dan-%BP)3sdDd z!iF7vJ7x6bCG&R`84kR)Ql{2^^ZzDqZiqen>xK)8(Xl$C`wT5p>eKb0+8rLyPf^l~ z`b(R$cA|yq$2-Ni7X5DSjNW3nk_H>NtJHV&bk%%tJ{8n#-4+b^NZ57 zVOhCri1CuPXId&(va*)VQdB`VdEF-8{i}-85YxwrPBm5!S!fgJH^a!xA-kK6`Aev0r89A|e6mDOw-207@iz>5r!DgiS$m+F1(@!dl>y8W*1ba_f;@aYc9jEVllhF3c$?^na%igH#!kG~XR;qK`qMZc70ZEIPy43KPrJoE&ury0_ zu6qxkuoqd+%Om4U%B=P~ko$C)I7sYIDhqjaQRR&WcdnB2iLo8>+H(V9=1VO2~X?Wo(j!aA?}5t!DO2yU=02 zVr_7|)eHQ(29<;DxeY~d^()jw{`k-;o;_Zi1u)TbD%G!>U>K_N0s@7+6oORFoi4;= z0F6rg-FGQQ7a6Tz9TE+bQYX4)zOR5;QW6rTOC+gg=frw?hnWbf%+nrg|) zcBrgHgns9A_?;W|BzKHmZItzdBqG&BY);Rn1lPgx)}-4gVaa8%DYJRXb-Cybl|Iwr zpHHa|TJ@CQ=wNGQymBX9yaZ<+RTun^>@@U@12CTgpz()kp2iiN&bgc{1qf1{Bx5Se zXEY2`GN{rd9hN> zOhz#MVz|H6Aru%0`cCa&o?(iqCPUV+7q?cmyy-3(;yKbaw~+zgq}g)W7%iIiFeXF8 zP?$o8Z;vNGO$v&i3Wb))ij(=({nlDif;Y^&k_1l}xO#b5TI5P~UN$LR9Hnyqs6krZ zylXe@#jP6Sw@t^gYwPY`dc>38y0zpav&H&ulR59W{eXB}b)bFKaqfk`ix?I&t z2b~|Q_|I}e>F5Bd$qkcl2^u*{BD^_K74Yh+zPU@@rEzkS>M>b|FA>3(tEOemPBuU! z8SAUIynCy%;m9tA!y_p}GnhLq=D~efy5n#fa?FKQ>K0)0hH!t95*&ixH8E_bEa(1K zYN37_7L*8SubjC&fIUa0orM42{tUuH&r!)gT|MQd$gcw3PiJ<2{vXO|7*#=4^Uzzc zvM&)ikdC&BR73=3p>SvGtvfZXFfeehrW%|4Ye=Xu(rk?|b$OVvR%__C4v?l;DmQAX@8y;96Vs(27NF2AfpqYO*mwTf!BFetJYUi5{5WoL%J3 zcN82MtGXc0Otq`I!ifK8JPu`7lXVqtKE`GTtJz@3>1E{O(qlO@>&?gKV9r$K|02;A z?jQzcdx-iQBMT;Ytl_F{?+riQ>s(v>f(Bg7B-2nTpty*C-S#QVFHDe3$mPmAny!gs zP6lwa?q-J*{Gk?iqM;|?346YoD(%iz_v?DeAhV* z6y@9=l7ElW6r@>V#$mJNQ}4WaS|ECdGnE0#&h#}8WZ+HBgN2gGFwb0TD0WL{Mzse7 znNdY|?ud>kSWh-Li13wW3HnXT+r)Y86Qw(iiMy9`L%I`)YBg3@`daRp0s<;^vXm+U zggrn2P2(7}3;yAEk4FJKOzjY2SN5uoLVn6MW zF2GoQ9atpR9Ji>qyMMXm7@OV)GC7W4-M(j3%K>**P#ntO+i%2}qU1H8L7OkQ`}6?F z>8fAZVS8|wRk^H4`aI8##Zu7w7Q==^=e~vTZF|So%v!)__()JYkhv0uhG}5OICV;< zoB_8%ujmv-NLZf&C_2HKGE^e0`%J)?tcm`T1^YjqxJ?0$50jF~*yYqN^I2!@Zf5{f zV?49|QE@A!@L%SIgli`?W^mP6yX6~lm_(fGO|}6;kTeEavmU=0a#(-l>eo@XG{;@j z8mcn`A*eJAu-IQ>#r2Q|RWz@are2m~Qj#fB&0(MSZ^t ziNyVS(J=jLDn4%kV3*=f7iT)RR&nfzPVX6Ni+8lBjuz^NAV)ReKH8(z@UDH=UiP^b z0;COgo-?8WR^0XB?~^FkSsAwM(@?xMK25dGkmbuy`tBu?;=tkOrQL(hBXmc@awTrG zUL-OHK=s5jHj-UB4*vx5jz3S_6%v?x zW}G~aKJs3ucBHZ)3+4NT;{_lZ>5m{{59>hzQ5^*^6+`5gfrGE_{#@OKI=NlkxeoJk zIkPpUYAUtco;^xGUZ;AgiPfo!BN;3RN*ehrNfSvXgHwR&tw$8{uM`Y=3DWX1ApyZ( zGxd|G%7wSj1rYI>j9k#1Fg-N3RQ8W(^UlX-#Q)@lh@Yi($d-r zmxVm0l6cP=mxbs{nkw)@of?foM6K!B;TD$EjuQ1*F4$efRi9s5_YE>vdo1dIofUhj zt)h7Vt;wSms8Eg$Rv#lJ!cFvn$`TK;$YK+>CILy#3rXbYI?oPc$UsSZKxK&H5;m-K zYw~4^8{aan2h;K6ceKqu931@lbOH(w!UE*NlUM$lgdahx}hBvra)yeWb)+FWvl8tbx1SjJEYwT#UX#v8p4_l8;~kEv(WLs;AASXQQTwZ zij(cAYv;WrQ!aMTX-NGJhJwnF0gf`XcLc6I%lQ>b-wTFN&W&A+SBV=DA&OqND3HP> z6Vn?{Vt6HOc1u;KMduCUllRsNPs~tUDqxY`gw?+xwEzP#RMDAgfoTJi=*O5{60z(# z!+It~GU>=`s+n0N*=e4~Hu?+-X_XtpT|~l^xFw+lfPobbAE+)&2J7(xSV*wXR`Wxm z5!l=^VeJi9LHv2SHrs6De!iL%LGyWS=g5a%u9Mhk9ZZ+j9I7nFm;;^z*opYd8V8iM z&^%__@c>2~6ySSFf*sP{m44xO6&2r=JUOR9jW1g>Q2^C;*ZXDxIX0NiDbkBME3)mD z()6P`tV!s@N_!C+pI-=5IAQ56ay4R6g{@<0^cIJ2SnHfak-;GrykMuukzL+N)6_qf zDU8>w<@T`hlS?Y~$q|aBr<&bLV6Twi_9japnYYPTE`4i@@>@p24qlsazUpRY*B84e zI%VEvIi6rFZC5KR!ylV!_1PhAu4FEa$VtZ@Ot*Myghkx$TlB5PhE$U-4~F|(wePjZ zg9%t*LadM+?*{8ii@8z{s*{Rz3WjxnxB9RK+`?loJd< z*|8^>Vcv+QKpmDrz2TR$QR8m?vGwRn8}6oL@#-YEQZwDu8{spTY~`5FRLuG*$Du01 zM|w#RjL#apWMTNlsZh9ySPJzF9Wn)9XOq8IKg;vR>5k0m%D&R{k1)amQh-mwh1(!Ia49i@6r@-=3!AvO zDLpey3v7mU@%Fa)m(aYa;TF(2`TFMo(iG|QbD-E=-!+lWVy=efv^HU3$}V@v0uW-z zEzju^F7#N<=cmo@axTuK?A6l0YH1YZ(pIr6l4YmRQmz)itMb(L_QBRWDfOorL&#k0 zUeIc10K>VU8fACxN-u^*-v`WS7oe4KMDKuNl4@b0mq z;=4xMs$-FCoOp0VjVU10a}}nLAep+6ngZ3@4V2PPUCwIrHqZ&XA&xn=aJP&BZ4U3p zUf0_eGX%Ri!Ku-fp-9!ym(rULjgKB{)QwLiklRf_avD~8>23zb+OS#rP|-KbmGQKm zqZSnzIP#;N#&-jIhldjnfr#o)iq9Ix7VoUD7;>XNv?9@j!h1KCeiqjfk<;NjBcYGC z$buJo=#TLz;SlAk`{cHh(C;^_EY<1Q8OTh&hH9TnRMv-ps5;>p5UV4uhupczAkyLn zwvf@N&r(Cs0o}|nnNqBo;B$WNw~~ELbtDqP3Bt!9t%+Pza+QPsUAcm%2DSk;FBvy1 z`V9qk9CWi_j6rrY0?oB55W;mDSD1kSPOPeD8M=MU&hF+1D`nwP!TTnT@Eta`;NC9* zXGrSL>Ewc{=?!}0b|-i&o&ogVJa(MpSp5~o5PgMXcv~5xNtI*!NYTGI!sejS`}(Vu z<|Do^IO;ELm<>)Bm;_Xwkbtpl<8#5ytkFn+XV+JeB$y#aGf0aodm({$Y(x&kwc%r! zl+vhVvE+j$_qRFFvYt=ryU_JBMuJ-U`=K#vno%Sn}f_X!XDK9Re8a!vF6$MOi z9!At)_}heY5jC5cKUMCX4iT3BCNyXFaKC!K_PT4FvZESonJrwW#FiS}LEVlEvMTC& zg-L}Ctjs{&vhx0flFsMQ7>^V9Nj-uqEPk0GmJ#G>Ig)D>;d>R4o*`v(dlg|*FPssl z8pK#)5@7a}tiUIrW4T>BIvMcZ6Ga#@JNA2g%Gv}ddTJBz%>e5+QKghMuMszI3x9;i1TABURMzdHBoqX<8V z|Gwj1{5NXtXThlpB=5_kGy{6QWC!jOF z?Bu(`g37I1g>NhqfC=7xHq}2pyZkQB3Hw&BoHPc6(r<2AyJW(e)_uyss|I|d`I&LD zj2_a#=jaRyP}k&BCiYx1<%)%M#m^tFY^|54Uj1EFIl9 zER}p>cI76rukc!Qj5n`dEtD6nV=*D(Nr#qU^WR z_mP;MuM%F)crO`$d1ufw0T?$d8R6gY6M_om?>q04Q|2LGe=aoW70xhyYeov_22yCiA-Nu5xJ;lUI zGj$?OOFMJ()0Y8=7!Nr8ivX0<@x{4jDP)yurBjoQQ*$Jhgc=TV(9k7J*?Ug7h&^@C zIM@789$ZrRU&6#GKj%cr>>^o<1(oKA9A|^PUdr_dbI-yIY>iSQW~}7kn~nb)w&=H% zUMx=Jrt7)H=ebO!xVIK>=_;A6ab5EzuD%jJbD^Uh^s>7{QE2?4wCD7iwJ$ECWh zq?W!p>eNIXrcTICU642!qY=4fpyr5=3CA@&EC%@&ZrqVbwsBKri9iD;`HT^i_nr!B zW{283(n-iH2`9aon5+Lalxm@5`DnbNzlywrGAk2gu9H)CI8l&AVx@kwSj@|h_xx-k z>zJ{2*NL7zymoD}uLZIGPDWkwYwPx1r5dsrOIi7OtI88jx*)q4@omUljhhl=mfOe@ zEkqb%RUuq;1&-3D0v;4FJgvTo+zYa9RC`hj*W-vqSIdpoviT)e3>_Z$?-EHS(CCog z)*^KuxVNcJ3d0ec)>dDi6Gd-ix;k7m#wYOT8zH=;oXP=ZPfAQb!cb5PDNJUofGcymw=H`+BnYmGsi#c6triF%>(60}>^NWP*}#xSrgD}W9p zn!bs9_w^w{pf7D0_EA! z%=g4L;Xl(WGCYbRMsKAfE{k-E&qI2kq7q424V-^6T{Non(X%A@UYtGNZ&o^wu5saJ z#p-4L3(QeQ1V}k@aS?HS*W9kP28xv8k{K+U`XFkZ<8DvTOzC26NRvWJ^=MOcAVWUx zdNBnaPiLzdc%lp9A{$RpyxINqHHx;982>(y>ojnocuv$g1hH3f(m@`7=R0T<`h~~? zEelkXlrxQgjZcxaJ=B>maJI5C*9SBI>{0LA97AMs)NpDxuDGcbVvjHX~O;q;|r1b-n}ID z5Bkr4G3>_8GMfghk3OmXE95#s$&U4WeW8$gec{;2>${gidw`1iK@;B!%cMn*ZnK3; ziwoum!^#XH4J3OA{UChU9!u=lRjzJG6t9%u3KOEooo_3cpUMJP*bD0wtx)@G`XLFhp3laOO&fK{d^)L=yOw^fpx%Ht0c3{t_N2b~cEr5(}Hp zLWiBQKDV)(%`=vFGmQ;yMdOk;pTb#A0cYq{<9Bwws3FRbyHZ29HI3cKQR!wbPq*>j zE$GHMx)0p0_SoGPp_qJ5!T4C?_;0`13}IQK6CYWi57%S;oB1%wsV+<%o}@6O_$n79 z`(ZI2)R-3qi=vBg6WyNB+UcZ*v=YZ|nCjc4 zHl*WzO;Z_!L1COr^wd{IOdUkX5UGV2{z_d`Acq;^Y`|WI6n?+96)tuGw-v^^Rp#DI zhY)_Dn0K!uBz8}rHw6MO7YFR@)(BxDpUpw@nl1qjK68ZzsZZG=GWsX2+(;9T3kgzR z1Dj(ZJ>-%hb9k^C$@=dBmDFT0V(;yZ+H-1d;6a_cPK-(am`dS z_kjd47!5o~lMXPlDGVt0d-&J{Ck6jNP_BOang7e15j48?4$QMFc9^gFaUJk_Y7E3> z@CC|czs7x!a{b=Vy!9Hqme2&ayE_bd&Q7e&5FW0_(Eh?(y=EP#ZSOU8>@`Nu1?Sas zHRgkTmjW&sbn4avXWuh0_vTdOgPynTqL){u(k~qKcB}D7ExyN}TA3TidE+wL!JT(? zg|8bi${VvFLsJYi&s|o(3tNu+h1`R^pWKh2GZ+&$iKb19)joE2fAO>E5H{{vVV@71 z1v}z5eW}8*76T-gtuL9U!%okieymPZ28{-X8m)0bh!}dXUeizTa;jf<7c@PvMl4_C zmmn$H&7PlLbt2&SSO+B)({&efb>oB*xqOuDqvu7+u-4Fp-jDi)61~o~=?frqR@t{J zQ$^R$I$AAfW4Sd}M9H$(rjmJ{G1&tAMbRBc-0-6CyR4fG<+KY2ik<{?LO0A2`Leg2 zZ>}2Y>9DIf-8YZxl~540G0r`*8)-^a?<6SyuPR+AtoJ=;$jR+`-u#;?I2;_iqYwaa~E-;a{{F*t-i+z;#|@1-0Du&iJ0on3zf&|ML588Z~!ji5R@5+i0b3^SkSjsMwFOXE!gcwrV!GYe8NP zPMY%IAEfigK-XMa|D1xJ6npgJ2R3~-snXY6)W8rlN7E+5cL^7H1WD~OK)oOx2Bn)$ z1+LgSAje6oBPIYG`7>nH+4>3)UpdH|F&I*$3gg=g!Y>3Kf!+Qb8AP9*7*BV1QC=Yk z_Czz9QthCh`#AksownhEwpiAW9dU?!#IaF=hST?H-Z4L2RLr*eG^+3mb}IDw?o*6; z8%U`H|3y&lL?cwzhOHCEvfv-B4K|KVkBvV0<3=kvXF#uy&Wc}S&GjK9k{mDIY!Aq; z!$!!@-|(C-WHV9pJmM6EFtBT>xT~7v4uYHHIX0hlm_ofq`x%M@ZoLM%d(b;x*dHUo z&Pgt@DT!*Q1Ez%PeNOiA!ZVO>&~NZ>(9IH@U;q;Q6Z+F3Is*4q(rwu7cZ-tolc7d~ zIS9Okxry-E(s?g`9zBY_Sb|JfILiS*Z@Uj1TD#$7QaWAtjgeINtV%LDqLE}sH+of0NvW=%xDsj;2ZhPd!~KGbVdbLIfgRX*cVDgDKF?Y$086zJNQ+<0GVrqN+b z!!x9O$ClOXUrX;l8eh#>NP=Z4zBTlVMRoCO)2Xy&|HUe2T30d%eL!?Uas&ccK`(g# zYzk7q;wThRf!n{V4VO7U-aP+DlCF)74EJ42<-|LehI8tJg*sBH8TDl0y#D%t3dWtS z@{ME|Xe%$B4m=+*FP=+G+QL~36Mzu;z(IskfDs-)GGUr$)O1VI{q%zs!0Zc#b}T|= zr0^Z_@F9%{&cc1MeS~UP$1AV8My2-2LVzk8%C*D4a|3!ua|fOwTM)79XwWMDP!kF_^H>yb}9ON~S;oMBkVz+*!Ur zdmc=B0xDU)ie*+Xr5q>ys|;6xagntUTM~IjXmuK^*m9E@>g^Op^0}Tn)At{Q#@A>O z5w152L`Cd*#IEo)8*h~AbJ_0(Slnyr&0Uo)Ls~~5?fN>`Pn23a%Ra}LisCz2#2J3k zY!$>zfC+LNyNdxvckbHG@k_*Z`Fv2<`aV>z~$zTXI; zEI&#mSR=xR0fs}Zwt*l8RJxcDNnL_Xg+LvDYcB8@n9A^nhc8%!Mt30!&F!3dOJ+13Ev3^rE|B~fR3JlpfqR&6O@aMXSzwS6D4=s= zP(Z0scLbS5cQO!!uOHeh2El$jR->Nefc%bOpg~RuBC0wKf_}|viZ@vVx(5RP z#Ry-gOazWl<2`eM`7dmE2~=T(;n~@KM~7G`f7Al#c>Y-@#GXH3w#eWgdzb!l6!Cxh znT))8aFowe>}K7+`u69FobLj|E^2@Ha{SS+{^$lnf-z~%S~RhHnTXFCAjeW)IkNq; zk|5>bIV*=oeq8M?%>Oyo0f=`dnXmjG4a|wiv~lKC{wYnJX8&u`cfNl3NyE|h(L>88 za#I{${g94z-SwYg^n3#bbc^*xW#sjdS3XI^tjj}-{h_z#v616h*Mf~c(yesoJFB!5%c6>Lr87E)c za{`$_R!Prg(3))* z+c%ZE^fou8khtEb5mEYu|L+|WS5A(5%*-zBX6a1rU#N`?lz?~!w4l2OGBm3D821)I z$t;yPx$C-ow#w&fT$)$3T>P}rYr>S10!3ZAg+1~ZtRD8O14+eL_izqM#%;c6wK7L( z$g}<}1raDKP2*vVG{D`O@duB7G@g@53iazJxQ}(EmpS{I-~q)vt*ttoszg~M9H_<`7D=kQ{QU+DL+T-puKoi^pVz5DC*A>rZB289&O zez^``s95Ry_L4c{>&L!kxUgv_ogMNmh|sJtvpsSK^ere^+KLg!PcDpOOBn)-~$^ z!O0RnA3d?Gmnraab8I15!g!a`Zn5phh_}yVnKSRbbiso0wn)=|R#dd4g#4$(t%d<5 zeZajp)Pr&FOcCrE&LlNO_ayhKrzSY$yj!ut$zYp@EIExJ9xLiV-;ABnXBLgl+(yH> zhH-SY9WM&;5~Xd4%pvnOMD+ww+DSsgilcq{w9z;BC zEr@vVdW6~Gr|GE}g8NW|`pH=$AEGbB^fw60_QFAF5XRp0edM)7AF9Ah#?6D6S|i#7 zYWppkr@>B&+UzWpbg>H!@o9zrmaGwt zTF;xYoZSyC`jdraQ5d##RkVkZ;L=s1v0O8C?fs4V`&6^mf}s#{;oanzSkeBfMmAU@O#QLUFCP)Rho7lKCnj{5D!=csn%UY?fYxNV7sS$Xr(df0!*EGH879!E@O#=kB}a% z`J-cxhA++@I`hXdZ^cW-s0nFj-%NR(j(7rBVgQ%YB}++AF?Q|{^`MEFg&QXI_pM!= ziLh0m8$7ml>C-_mR>O@C*T>?=e5t<_w77alVyi&W8r$FvIG{DwH~lJqAF-`=G@%_0 zfC#Gc+G>x-m@T7{2UK?iEit6$4NA43q>QW0lVDV$4l!!}8J>rdwDyZ_+$~tMgP3Uk z5s4uEvreouAhNRO)f;N|mO(b|o3fQu#4&JsHFBY#5FP8v>)p$GU0NfyCYUrl(|UH3 zF_}*bGDQN#7@>r!LW+9e2^M@l?-rP$06+3>XEp!2b)nkHG_DFuWt+He$4i_j1XZh2w&Vt%DUZWN6=fCEp{Ds34t`pdL)2gv zwLoSBY{A60W3YDd`^~@k7pq!(T*x5)fc_5hB}k4zQKcvl=}T0q{#hZGY${0|b>_;? z+54NZXPI!Wj9K=zvyo-wE_>YNzuU2=G6jpJ4OCO{xi0#4swRP;A$srJmHiicefLyg9#RIKTIs=O>U7Q@ z`&&0#K-5!jK>W~Doxj3F?HD(xaHfZX)>{I1So#_LaQGp^D{e}=cqUSieTD#sB~e5Q z$(ZIkJxoJ*>ZFT+d<3nMnMQO_vGmy_Y~3%i;a=7CUFDS+nfRU}Q;O6V^6JL8!@^GA zly*YD>wJnhTa~!1DW~>n#?_PYYiw0DcC+PT`78B@G+P(7Qkghk8do)eq9-mGmlz9i z5HU~s$styel%qIQ2ypX%DEp=uP2#u9=G(Sy+qP}nwr$(CZQHi(>7I7aw7K*DHoKcI z*^AwqQl9#yQWxh`QU_FO`5K=$wMBeUd}+yR>w&NSEzf@z8qgB=c1>6VNj(o{X5QN} zs(kM+nk?Wn=cn$Uc}_skEsX})_fXr(>Xm-_B#bRHD@(;W&T1(X-}N%v{|-;klBmw# z(YNw^J##Z;9#3QYQJ1JM1@+VYo{A(Tz#Nz*l-190au9{w6V7#kn|Cgz3eK?j>-Fd` zH>3APzw}0*M06gPJ3+4Bzf|WrV)FxNa|~lezK~XAVzyXAxd>qyj(c~sG;pyA%K|@u ziRJ&aEmu}aV0;mK*Z>;jSiuWUoVA#|bc=pB4{IxZRk4f{)IXXu$rgI8-)xPnj_nL= zX1>9$jiz5WVr5iuCs1fsJ+F{2H0PQ&%tdW!FM>QlT>F6W$jh~>hISRpo13>2QE`R^ zr5!5dZm$1@xyX|dlm1Ka1d&^N^*b74Scc&N@K?wI&#}{)6fqj0q>gKRxf_>aw2s63D+$TCq5Z0 z#Sm3nr~%)J9dE1W^9(4;t>CW+LLyb9qt-4C;mhaH%}<OOi{sLjm2nQ2@Y%TxZLc&h-x+{VfS4m$mjpYzDLFOFNYcnLk zFz%5^`9W%can-_;7u-y2HanZv zY{ThakE>EX%D$CvG?(wEb+_|nKE$V*P{EsjKK`=@dHMs2uK9%ucaX>2H1l`y=@hb)aT6_WKf)tHLY{xo|z{?kC?lzNDFZI&2O zY5jM^>Nh>~^-VCuf0e`?&FRutB8am5Xh_A1xXcdqr$e$LO`&AI+18Ez9PCaAf#Oi$ zx+=IcBi!H>c=1TfboweX=a0M{7=hB~tPCN>8AcsJ8KTUbzQb^MRHkC$@@8=P*u)68 z_k^W1BS@CK(T;2tyF`IJ5s55tr}^c@`Y`C-NmCAK4WIWfo2y(1Rgq%L^ir|#TOEk( zjm;n?pzb00E~Vu))omb$bEZ8c_#>W8#jxKHhaAL>qZBeX#1}y%lAfBVB7Tdf^Sc>r3Cv-Vy1=K4g4l8>d67~XMidwBTOGK#!Lnw*>F`k6pG{c z5=sWz>6RkYa3+LOg?3iH2{9ZP)aRtC?u7!(_};1pceCnc0;KPQFyqh73X zziEp*ECk6yw;F@i!Q1nWD{atCxmR;U(iq7)ON0^LF#AOcz<_m3cj%^c^+__3fxbOM z!H7HyBiIdJd(o9GiQTH?M_z&T!*SKZod>PQ*bd8?9hsOcJD1rJ^E?R3f#3kpm`MCh zfw65W)=RiCc}(xQYf6V6y8F!$M#Ev!7tuH4bnrCnhtkP&$H^YI7EP1Li0^1YlZPKQ8=?Ee@21%L5&jNhEor!p$GICKQ)TM)aW{PH`=%} z*6-?6c%0BBZ&Po&xATf$so9P7lO^3V;CmC?y*R)Ja6g3V#CV@G@fFwgVH(uxk3Eij ze++N^pg9)&#=Pck49BY=37|kR!bmfiICMP~DA~Lc4Il`KnZ9c_d&N}c_JiE`_NRaj zh?^Nzt)ZVijoE4*@b#R_|%s%fL?30=2zuk~M;n%#&@ zl<>sq1YAl|1?qk7oKyk3I)7%3I>ZJ0=(td{ZCEsI@ULA( z=9MY^%CiG<>c7DCVAM$1>Nl@9RFRYRV6@ghmPTXUqylRA1<<#GhP>vrZR8J{fOp4f zrYuji6TO^ApEPSCAXRFjJhoK$=A}mM2$j= zA;_nJX6v;ti7O7l)~#H*Zu;8zg5v%X%jx_O0N3Ee5{x`5qMRb*%5V}d7$|TXz1*p9 zX0(m*o(Iz|o_D5=1X1obHA7jlF z>FSX^%u+B-Gv1GfzbD=pOqPsu3(hkK@QktO)fSGXw)_tCqvkKToEsK?prP#hV}BFz zE_Nk&ix4gBXTfqu`VW{dZQmsejp0SBXwR@Tv6B0;CvSZO)o<9iW8ScTNb*CyY9h3r zXuWVA*dCQg5}obYejgG>ItezX+-TW?RPs(#BS4DLfiqGJ(XY#lV#rttWL4iUvoW23hhgx~ zRo%^=0xFADTZ|q3X+>_I{}?m$O)duMCF5lDL3$v?-XLW(yvK9Fh=rT&_cq?sxkV9> zRE`ik( ztDTUR()*u}F{Dpcv6uo%Wm*r@*9JAPRNv2K#;RV7os8<@@@7G?>Qmz9^fYb+d58a1WZFMD%~UvslNID8?T_(=a^s9Own z9KMc>y?xf)zbq{vCarc3^jm~7c^wwc_nca+Gf0%53Wfx}WyO-_ro#gXf|gDM#Cwcu zE~2;rJSh*~%>ua!A8*Ar=`>HNMJ*{OFA@=#Rn_e%oBS$0ljE|6aS{rs+Z;mSDM?Bn zuK~|)t}*u?8?WEyrlg=HE$__CBK(b7M-vRMe<%tYqGP$02n4X$Ony8_?t0r#qqkki zE^uX3HFOFSq;MS4WRxJFm2SYV+?@AmEP}@kdcfr*(DPGk|0(0^`QJLZY(sX(a^u?t zJ;#spwsFl(wxcHo%1h*=KYeQA+dfGCIW7u@Hs?>(wFCKG62kmS#u+l~KKgU$Le1Xx zblW8MYQNgW zP7MxyBJN4^z9w0U#vx*E|Mup1oIB)v3oo}=&z{|QeD!waa&UOIV-eOvfHIC`RJs>b zwjjJde?Lr(!X_ki=UY59e)VeV_vJ2Z&v*@Zuhn15CX=M>g4S?s_)gB{EsdO4d|fu< zeXhN}89Q}(JsY#%DWJDJ&vSw21!E7`IOfpJROG6}iS{ zgbOTmU8g+%63+9}@cO9J+b8sJd*&11woLc)VR7I_?C!Rwc}Jr8fg)l0@c|l-kUM}~ z7^KVZ)B72I@fh)VT7ng3;*b9(hdLJo8eB z+eoaR+;dXsX$j`J$#3^*{MC`O7B0{a+pPIweqrw&4o4kQR|V}`G1*ZvkP6i0T6IS7=<>WUSu3_=zj4Y<}+lUZ7)K!>-leCo^? zbc_xo0jpu@0-A(Zz6=44xwe8^Madq)yRXpq{1pVU({4&>&Q~hAVV^dtwR@|FDvr6l zX;D~`UN-}Xb;TRCH_@tuGGp1Fd0e(tFBb4dM72DeO}?Gm~I` zQVypnQp-@!3wdxMY%wu-83LL!)(s1q+RJ|B6d4JdGcv<>erj5Hjp$7>OJc>Oty6P? ziMO+ZVf_~w@k0Zw^p=j7fCm})AVsr`PJAj59 zil9OuimJK|lBNyOPm2i&aU&2$P)j1hnp|2%V&NuGV`Kj1?s!Z90tH%#zjyn;8L~P5 zKMdI%%>T`gZL2Y3uO@-`8T^4@VFH!No9!>VFq;gNL`)PWrno5vuZv6CNCF!5=cVeB zYoi}>^j9?}-&b|LeS|%;Mb)}%Pb>Nu>cBp}X*_Wo^pL)GLj0XKQ;WDIdX`aOvFnKh zk(hW&Yb-H0xe(2=+i{C}IDk)-rjP9hfNi$kmAfCJCtdL7AIAjgiPRxk*=8N8odt&o z$D_O`--rQ*gLQ*@9BTfMU*56_OU_uj8h&?x-@48mN*|HVh?S#G*M~zFfw8s()K<(V zU>s^~1*xF-r%hk?y*!xM5;3z(qnEU9RViwA7D63a%x0XiZIEI>xHOJSo~E+hp}I{K zOkwg!bVa$1GFl7~4IfsfPm|In$bAblQV4WPU3Ity)jcM?q;*K&TTD1IK&57^28)Q5 z8zeH-3dPQ4iCJX10!#m@RWz|rPSnP8*vRp>wOK3ndE!z<`59>V<)&z>CoMP6F}yMB zXkB@k)nXNicq^IQ!=xYyeVGRUi!IbtT z^(EP~axs7q_$bU4m@fLM342Alv3p->k39e8x@8GelFf$#ff1yIB9yaO3>nzX(THw} zRXwd#c*aDijVPWVbDON~R`M6Ae0XNb)et4_R!B1sUdm;6L%baCpO zQJIM+-0AQ`irurZM^b3;H}|jxl~2QO*HsieTrrRwcA?Y~Gktb0r~JiGjAtx;rk{o7 zs+gJKWG^h;Nq8cZa@4q%o_N zd{@xAQ) z0-#_MKILqZw)OjPbEQ0$y;_G#Evyvo*ioU%X$!dC{3&)sGs5@QT_{KhElbjvB?sTy zB%nAunF1T}w?;#D*xC8M#>j0VGQghNXiqenI)xn3a}gJAp&!e}oU-b(P^QVIxh99P z4f|j~HGr0gkeF+xkQiE0e$J1i=iIWm+{Hm%o>$$y9j*p&#kmvX%AFNNG&Y?J1D&3) zyW7T+xDmCP-VKjLR?af#Yu6dCkNJp@ol^mV#osI#{B21uyxIdLxDya%cNqlvERUVvK8SGgc=sw zXe*ECnwa=26nQ9FS|+uA<`$R&NIUKc@~9b2yh0c!9vF;Wy|W9L58M;XLiU#yGywqpErFv4#mm*mE z{-^)*)zXSbM*x1u`NT_yM?t#=!GL~1r&sTk`orB^4FM+ar}x{+(eZDFn*&(E{x+fKjlt7ijZ zMlL^pr-$Q>0)!tJMj-9*gxvod;c)%G6Al+M^MCIipVhds-|a;62k8rWClQ3bhLut( zl`Nqwv{}D-58m7-hKmNKa~ij1T^7Zl*sr)F;ws4^wNL)m!D$~Ix!XlpDANBr`{jzArxA=%!lx?7J__kv(-=YZiqr_c1K*dPher}n_w$VR0ZW*9m) zJqdPrAVLOk(VxLox3ku@8_yMwGW_sXn{I#3mlW|d0{Qlsdc2^|8vFc5&5TQF1@9zR zIk(`ht%XaA4i*LU6iDtjH`T|mJN*~^}N%{#)#Lg*yp?(duW zAk(c%<=G5GSL(SF*QSZ!2=tD~U@{BYR~Y&W<$KC|E(#fJWkMuet>hCfb0LAX_m!@I zwYF_=+S>^o4G5#irjI-KefhZCyPfUOo#`Zc(+s_`9KNYP7;()>%>$>e2f(+g14|^S z@*A=xbq-F8Kv-{bd^ReGqg0*yzn|+r_O?3>L*IoCQ^-QL;Yfa^1P&`}!Vx`1!CI7= zeh*~Wkz#Q{fR|%B5Vmai^;PY-z#gRp&AjIH*T+LeFhaj9Nb5wW2zb4^tOuW*RPOXW zDO&tKlR7#)JENnV+o8T`Cw~v&GE=0dTSdmz>fjjI!80sy-}gz7essDN=L@VA|41&8 zYshC66)fzmc0=F+jrQ3Tx2me?wnCj&)?=Ij<4WXogt7^V2VqA~= zj$K7Mc}+vp#}Boc`Au}A`2%YnScM{=}P)8S)9EZfgF zO;j&x-r*C;$Q!Ucl9@VOzN;KQV-xmAgIJa1Og`G8&nw`&Ft&$5B5 z=(HbTGXb@0UfO{tpYi6c*ClmbS>-u-Yg8!{Z;}!3WoZ8*k;tn`Y6nS4+~1C%GlgtI z^Va0da(64`F;){;D;NA#IL8#gF;M4o#+Pw8F8F~Jg2a4qJi~ht9vW#a&&=FapuhwLXUf~9aOJy ziuc*?9_bU&DS+m3*G`>6g?Vxjx%U$W zFeVG6e@^t8^6Cv6uzvd+LW!RKnsQ`rF*sz2mA`_$i5K2A9Mdn6rjXbnTpEmF#HH?o z_g)TRsFW*nm7js3AI9M#uMzef*yEV&hk$7xw~t=Gi)=LK1qNOV`dJ#t54h7=S=2l0 z^R1m@IhLXIoc z`GK$Z+^aD7ywV@41rg9M54oRw`>TOqBI_7P1R2RQo>-Fq-9wtxl9#JiL&c{GXkU|q<4?$RtmQ2Qol9q5v7qd4p=k%lG`qen@Kkvl6%(ni6OrWKhc&qzX3nbD$TP0RjjzBk5A;f%Dx9jE=}gc_qc z?vy)fl{@C8OUg+kmAFVMt2vxPi4-M!Oe(cZD)XmQ(n)%mu*@p6Ikh4wBU-iGDZA7v zyUa`5l#@g&afx(`j0;PkgM!wSt#sa_| z3Zp>vs1wJ7c@5p!f@L)M8>xf!==#M=3bfaPKOQNCgh83n&mgsp>x32|i`xrrK)1aU zH-bjJH5IXwn@Awz&q1ms6#Ky+aMXaxA(&JV#h|P(B}*AeMuQ_Dw?ro^##UGyQBrnG z2TOX%t1~R6>!U8ovXgC!y`#!cvn%zBskEY_-!bjPyJD;{ZjqA>R(bAwEZd1*(cG7A ziEo9*?J>US!}VgB>EUTFWw!~+5EzLOM4T1Xp@=g32hU*{>)?N_4UcBek1XNl)`gB_ z)fbwO4M^Lk^+wB+wJ4G0NRy}0Qsew9nmCo4$|5(Au21Eq;!>vBN=(K}dn`T`or)mG zkj78NrF>gB<)8Ao;I-yycFa5FnsQ1$FzuMqPst^Jla))ELQjDUeO2m_@&s;OL zaHkuUi1Z2V{6Cums?nQq&LX|KkX^4-oro^C+@5>NBC$9O^fg+#%W4rhB!;kFW#xGu zma5d}boMmngXM~JdAC2+;+E>x8dTubMtQVXrrOpzR4CO>W>?c&ihVMBGG8#w3h3_4 zOl?h5ldIF@EHze^)>bK1RdsUX?901`4#EK{5iu<@;M{rPG72p!Jt`wL&A+Q|svfdT z{aXdt1jQJ(Ab7luWc?>uu`?xc%9p|D34$X`#N`f2vH;`8E}>_L>u(|U>vZW zyNW*`L+rOeYxuK8oELZRhxf&lkKrAEe(in3Js2n-MtfYzz}d6=`+t1ny?u4M!rFWF z)u-R>_txL-%CcmH{G z&TuE->+SuWEk9b3P>^4tB7ocfG2&q0|MltmN+RF;^VygCmB4gEx_LXN%um%*X4a{Nx}g>a-+~O9KB;Q2dBcZK)9=5a*M*(v6s{nH`P~ss(#by z=JOo0%BXGsNADI3G==3C>8=Z%iSXF+5hj6eJ$}#wadV(+EMCYuB6?DAPrDfoRhBxU zYv|EfOC~EU8{L(Z>FRGSWq|p8u-aH-y(XYEx@?Szea+TqRw)Rs+$?4Ze}&23DhJEi zoMF>i7MgZeAQyZ>DuN<=)tz;z?V2~KufpWz_f|kS?u!bmq)`~m?=EuMRy30m853^? z+a5Ti$n;1oyd@No@l`x!?5VBFCa7h`S*B6-Yb_|Z@B$`0Bk>$03&N_HZ)2ex##znl zNF${5V6DM=AZ1BP3snn8j7pBfjl?%I7f^dn)29W66m+|Fqdc}v-zFv zAZP1J)+A=;R7{NOm5rtKnQm#SX<%wf(kY4B(v&k1%UPx;l^B*{l5!Zp-@wTmrC zu?x{rusz_o=Elaam6cEcf`Ps4saUV~r4h;>TbKK%CBxJCDi_q5V%SVuv77(`GWS=m zurRYm{*>s9G@C4e`OK*_syU7wBIrM>Dd;~X6DETbfeFBO`1eI)|2g>K0ED8)rLQtj z#$R-ZURIbnRnC++@z0XE-*Ic(I@K;Yfcm?xF6Zi(_TcTSqyClb*o$*AVQ| zL*q%$$$l3T*TF1T;nPho?Zz&~kYbcnq05y~sufoumT{*}D~^z-dMjEBncE9q2n@fc zOe++`Bute}ob{t@x^=I*I8RV*Ias^rtlBJEwJt*L#G0izT{FUc$e6ldZECePq|#Ee z!AKi2{nnHcM@OO~Ld%K3K#xyn6S*3j6gJu-!sQVe2}jfd0L1-AI2)w;{?)TCwrZ>9 z!Ot0Dieo(xw$;a9WRawc_T;2f)zO|X#?Jy`^i^r!m%w_2yM)^Ua|mO|)flkXLe0Y( zg?j{Z31cqT>ZmuHBjIL**^TJUE1Ut6)>bsBFsd}2XqVvS$meEjXX|nHTbJ`ad%Jhc zzeMQ0_ltk$x%JuDInaAHFa6mSGsBT+ES~5VYa|V%!>@HRRDeRyYQhv>te&8jSfmZK z$8UAPtRA(;0*!f5E(isYrCM$i$0nL1P>V^j2{z*| zyCph8QROJIl9cX+cp@ny$dN4i!F_4m1H%YVenL8246Q&mK;FY5{B>kZLN+({RZ3vY zz|W0m%mG??U?hM*p*9jPryq^eT);<;bgTi|_~Xa`fkAU*K905)*>+cy3E2bF$cOOZ z(#|(kQ*C|FlCPkj`%j_ZUA|l~`=*yD19=gSIlnOhJ zf-e4F4@Cj_lS^O^`UL-p?d)FM1!@G-?DtOJDl_?huyOL^KPV-O-daUeh`x+Phz)bO ziYNu+R7nl1c|G}^Zc89_6OF1qOwExNG|fnH8eY$Lb+`*&LC*OysH0OT%Z4~n1(Ba^ zcp0pMBkRY=HoOW&vJ?F*%qnsdKI~ly&ZIUP&88GntS&|uqm2PdQ<6SDdAxZh&WKn- zeCIE|Dx;l~^vF}!G*fBuiZvJ82n27XAfa2-BRCLc1gG`Ivmf8Lr&I56`*Pxex7Z8z zCvHZ7&Sd{4q6_dZ`_#YJUC;-)^n+fcl?io%#<&;G}+tK|ER#w);eUCyqDBx zYU}nG3&%97^%;LNRQX-{NB#Tv+9ALCo?OYcVoko*pZwdT7%fVe;#V!QLAy%P6j4*G z$uZXXD68o)Hu;iD0j4QAi^n->1?iiMtZ)f4oYOJLDE_S=%dMd3t)L3>7&*BDQ3xm= zLn6y*Xl~ip1gl>Z6k^f6L}Mz6=j;+`yu3ybH}H39_!pqFIrnyczx)qMXU84j0(^ommXIPm%B1r^+Lfz%wgv;eLr2ttn(Ndo~EFgYhk$)vL|1@0W>hK^4 zr9GjZ-65Bxk4aL>d&&WUxhc8PyJ%FO*3v(C>c}3XyXmfnrm4kiKuuDH?m+DdKoo^2 zhrdPc1%xUI3K#Eg^1_Y(4A3szLSH!066Wb9=V{;9lU zrM|NOIs~7hiuNZA2>q;&(~~ox2@`k-J!^$M{AcAmCby~+J4LYV?CaZ#HY9X#t*i_2 zZuw_czbd%rX9Ik4`NCiL{A}q84K#jDs(A3b+e+Cgc?$tR?fj+>vD?iP5~5V9f|U5Z z4kY5FY#QREERFuf69&C=c82g}hKSEpq|+Xg<)2Wob(`>xVv0N>V%V`Nq3no+pdTU6 zC!%a0GvN|4g&q>wL$hOMvtZ&QSD<_!FMNY_iR9rECguO#=W!q!x4~x8_dW{i>0~)g zeZO16!~K+}=j6T0Z9xj zRkJcHo048CyTj|CU~b086<;?5FrAV>#f5>>GjERv&~#Z<)#p@B39 z!dC}sg&nLSzUTgi=Q+eFqQLT28N(;J+f3{z>ivOt58Q2y=!Wj5JH3W>wi%qVis?Yx zmB;DS1J!|Ovx;kz0KOrgBp2V35V|HAT5EHtFX)eQ!8w<z>Zz z)6l4IP&eut?;Jaqo@q<3saxMs?cwwI>_2a)Vc0OJ8PW~o1(K$duO2mkPL@f&Gj8tx znXx9fy)*T=k#FydYs*P*I1blZT8L2}^sW{uA;8sR@;LLwGN1Gso0PFq$bmk9PwQXr z7%`*#u&Q`(K*;G!S}8K_<_@qwIU!fam)RmnNT&#?NqXawDIWsW8+gW9GAUj{58(Y; zI`cS7rwq;cxZxn^5%Vv4-H8d{^?iCikMIx>_3^FfL9>jSl#*23>iLfb#6VLd=9B*TD(==;gB_(x9 zxvBMnTH&4W{q~I(a_G^oFkpb{jhTpl)Qy*%oQSje(Md3F$nX+gUYalm3L(ONWniak=cl;&MI2%5E&JA?7vYv_@V(<^Bhu&A z4*SGRhigB$?G**P#p1FLO&T-sz2^!=kf%PdRI&)srQ4;t-Bnyl)7qAVa^srwnndu! zH&$|fgM@mI0?^da7$5wV{G!*2MBxfJ98c#+Yob;5wS}>R_jAic4ESW1oN9Idvv~0( zwDTr_B$`y=`z9O^enEwGcme#lF8}g z^OEgQ?$SS>PoSSMW842~yl3E3z&CU0dUX?!ssAZI5c)auaPtxHopEWxIgTbe9$D>a<4p>#;4!iH*qR3 z)5U6-dByL=qHPH4FRNpdUv4`(74Tdg&L^wI9hhBB{U!9`;uUIq+~D`FyS;kWQwEmix6Sw+d(=I&1933*p6gl~n@A?P9MhuZ|81t4c8d#iVI%d-U)Dx%DF}WP1A)n)I*7t7`L4K(; zc)wr2k?XFbp`%J;Jtqn8>2NiWX0p+#x@xN?Zlzpb%R$_IHAJP2lcJ*m;}cTU@}%{D z4XV;lPs7OzmDe_z|L==|Dvz3=@9gXlaQrl%057?|U``|MTQAA}o&pT9YMiB7wU0qQP^P^y95MKf+`Fq)_KbU=R^fP|2Y)sI15Dk(4@ zOJ>V-W6v#+2S)Qu>AD)TxDrwu+{0G{cRez6d%f4aP6!(dSSTMMWxlEu&a@Ku(`U(#AT=BLe2O=u|GN&E$fKFlj zLLGgmfgXHQzU+v^2r|VZ>8zIPY?>zes1o?be6x^~QfjK7B?0?x6*_`#=FNu(N)J>1 zwB~GXK4Mk=j$u90p?di|o*DSIebsmX{&VP4YGuiGv@MQpR==8ja-Ov=j7ET~r8KBx z#+)K^OV5~hl|IX_hse(OF?1b_UdsRLPwR!a+NBLkuK~h78*O9L#>PpJ2^w{A1fKDU zIO^4RuL}CmQ8P5_5Z}iT;C6HUuIXrn#Deg!@t45X&qOlJ^6d=byF1m%&Jj6JBE!p;@TB>%i}a2bb=@*}2TGbr%bE+U$fuo*+d%N7amDuhI#xy0lB1J}9EiQ1WyH$LBOJU-4wM z=URK|w#_D9kS+KsBwTEaLDy3u=c*<(|B_eb$4Z+uHtZE+650O*P_O`lA_CF=*`8;M z*kBJwr9C$TQE6o6#uVDDRl1*>oc)KHd2DOiZdF{x7C7B)ydi)=ffNd$tHV1xHHeT~ zM4A8x%OgO?lZ;*r0I0{={DpfuA&V-4@=Dr~qtldCg($&4v-zrAb}PHVX9E$LhgF?@ zq-p?PE*c1`JWNC>9Ekk-7>yGcf6D{5G{HWRZ=$P0#lcYnLwm3FN&;m5FrhzIvhhp)fPrJ1wf=ttog$cVFiM}ouxC3 zHMa@WvlG*LuCAEOc~8CT)76(GS3Lbp2rA>F#5$-)j-`EuWswVp(5^FB3zLB7n=GF6 zD>#N@XR0H8r3Vr*23c@9gC8TvYH(Z?koz=LgH387yXDXwK`(-A3D6e63lt$-K6BhiQ1}Fx* z221_7CAgduRB4t-o@?Txeij?eQ_C@pfE+1i&yP#k$M{lK-uzA#ND~#XA#zxxE`u3; z$l$=XcJUzW+MGl98E|J2W7Y}&RTtp9>*K%->;v-%U|z|4KY+QiT(I$iAfBFN{)Tvh zQ9NteT+|PCYc~{~Gwap45RM%rsW~2av$4Ug|+614w_=Er1)2)dF=8hUSVOK}8^c z?OP!%Hb`02Nb3{U(?friXWT!nBi@xRl()Ee93T-r^>BPgs7SRV_WQ+-9xa{|xK3bf zZBttj1gk)BEm>GS11CAw5mddtZg5vc5SC&j<-`G{F)w;AT57->3USo$pGuOhu{KI zww`TXua+(6B&VdDTZZZk^Ak`!exQ@97y(EGlnp=LfSpfv+p*tC;B0y+0ORxP4A>&= zb81986dUdS4uZ4rGS=8`;h`LA?Xo&x9#e?>OqH&kdqW!zs0im!o}QnwnwtCM2y2eR zhF$gP#R0lbnJ>~@l<@nrCS$sB?aTm9?DdN2(;o+rr zgIc0N#f8xbjkihYeq098!^JHhc?N5g%NFp-v>Pxm#5`9Q)obT;ZaB93UX{ousvjuX zQIRAUWl#rwCK@oX&7Ic}obRm&2!9MZwPEetBJFte!2;?9+ze-A!;~uIMa{yr4dPya zm>Bsk16hxCXlk$VXddZXq=dop;nwQFfO9cAQD5Fw8QmRLNYka;lJt&Zw8`d}9GvpT$FTa$CGpBB>W$WZ~b?5MImIJzm3u^%HQxX9#t^y7RG;dR!fqYMYKL-g zk)SqehXO~n%_CxCCX-@icW%UuB})|xXrW#?55Td)_NZGQj;^Vn zWAXP$bKtliPQ}9;n1~Aeu!LDZi#U+o=AHYcdv?g zSUx$UNP*Aq1{e9G;hOoQ^c$+$m{_CMG2hQX2eA>Z1fuWW&~5fiZFew;RY4> zdPc#>_G^M58a;4R+*@|E@PmUuYECLbOO4@MTs-n1FM|7>+d#)5B8^~)`fz2RDK z=a0HD|Mp4Fi%o9$a0k9bPU>0|*~THNzcoVWr}aWU{LN&?!SL4x4w0IIFkIM`uIxp( zjy4suv-ARCm?jO^__uuuZ5>X8+=Sn11Uj1gRpu8ujb$2eh6Mb%fUibhb6E$R56Hks zx|De`lGxXJj`NP}a!;Jh#~WyJ;Jh9N7RQ99o?n;}!9xD<&4& zT^|7_7v}F(|1Yt7Em*`SvNE4N7(Th+(SaT_A`Q&g5317wX_UUdJl`>bcW*`P9wXv! zagGRM*^R5>xn=lI%<{m(#Ru$A;f~cd1%~mfJbaHA-_IdVcXGl|uj%p8H}Ezy2|-kl z+tYy9(ehHcdXI{RN1be-!`L$AV5k?O&7C6Ct5(g(?VOc=o%9F-YZiLI?5F8&V3jlD z!vO{dYbi&boqvx-UY6mjm0Sej?KHJ3?xYFws}463IMS_m1!`>~A3>@tm;JBbm=8y0 z69sw&)@$snPkRl56i>wAFvOGqCiqqVgRygpt}E=;@Q!WUw(TZq+%&dr+l_6TjkRN| zvCSRZW>5d|U!8Go&i!{azqQtwYs~pRk81$b!xLMk?R=FT%+2Z#B;##4Qy(GaAitEj z2aN&3xryWjyWV9{1`Fs0C4s+rI(E=F>&mlsf*Fm)=%TBMghFgO{GItsAvgj(OWFEA zmft$RHqY;y_?!CN#xH7asB=MN|OBQ;W*`DA4ORV;3aZh=8 z>^O^GdW<;ujRtx0?c`|A@%I<#nN#!SZXp7tmG>6Gzw1i-1SokSVybYC2OHIp}E%x(5UyHo78cHqN6oCnvF*IwNET_txS!dWKkzNQ1Ou(R`as3&2=CKPnq!1U1wLZ4x0<`@PHu>Y+9>- zLMd1<>$50y1H0d;;5m!sI^qFR??9#g>$74*T9`!s6gigJ4x1gHHLV2iD>E!#rvf&+ z^mvZ_AtS&wzF_ktJ*(CpU+C$iVQgWr$<+(5vn?&Tq$wtwX#_lRz{HL4ajg_qnJk?X%t9p|u{r*;hy6o7QdB=xYArtE+FB0t%USCL1*? z@6?_mas=iJ4SU2n;lFH&4HtP?u34=PK8=GxodX5j7c#&X=T9m+-<@8u>nM9cuF!`-?*4D+l)6du>oBrmb)o!&w=j#n!+(igLj@|F&w?}Z zV&h8|Jz9ibIW945?&x@$G;(6Z49yoDH$s=|r>6=@T_Qriz?w04B`n?-CpQTMa+wyS z)%o$LPoQ^-#enR~1~J z_;6f%G*L`nGzAbn?|0$&k8Y_h(TDhzSL{EIm?|k!rq7!+kZKS-1OK~nz62*t-LY;D1Mo) zj9@s>vF7%*<-E##9Yob4*x&M(l{1TEu=x-?5I3HL`n8AGS=!R;%=SfBw{ zCWZ9S(#WxxMGsao!JJ)9tY#k{8`@&K0nDi7SO6|#Xxa!3E5}Ur7V17V7VL?x3+X_P zrEyZHZUB|Cbc(;5-{hHHf0s*5y4V{|Al*C`Xd5_M-ufN;*%-QzaTzQsT2MEJ9FP=0fnlo%;Ko~qCkOX}hbty%3Yd{eFmhdhd0&sz`w`JR;lV_P~#MGZEBCZ6sJw4Jq5 z_A98uR^!_T%6ZgL+Mamg<Qd7y9}C@Wd#5{$C-}=Dv)rb1T%F0 zlKl74vjq^{wIzDGp3JDZ=ZC?RG4Fy#7ALVXZm+T84)CfWTG{n6RNvW1$`@zk^s zdgG7hW4qUpW_=+W8uLdWu)zQ!Zh6FR*C?cZ-Q`lrsJn5j_{?t zV0t+^dHt*3YeB~s9cwPgCoC8a)jHrVp&CTCNBj2_;?V1rAh)`8XB=nF%!~Nk^U3z zJipJx%onL|bzbk%J%VB_*?B=aqy)2564fp_q>Q^T3&^ljZIGx|G-_#(=cRV0#;}6q zm)yvFH8$_SqVf&yh=KGJKA++`CJ0wgFhBvc8!G|nR$5=_l;nMjiAdn{`eUS&0QI8B zGN5e3|7Jb+MzfSf2r^&^u>h+aA_Z<3g7DHPT=BM9w(Tw!>n@~z%M~B4cgBvE^tR(q z%k1eb6tfhVr`5N_Va+Agf_3gT*SRIiAAKpmm0xCSMZW%c04c^&_xmtTkX?duN#O!X zbZpMRZ9Im&eF8i%M1$)(tSReKy(NQROsQd&;1qAk+kF^4bG6r4FBp@#c}RSp!0qjHHppUM^;x@bU~N|XLWHHcSYU(>-skdtv~RR*Xq}F)^quXFZ(aHhkCT$9 ze=3)yL}S2jP8g0M>gvu*KBz%q1thEEx^Yd$?7b=(YD3%*yULqzSh zO7i#SBKS*fox{RsY}3Jb{)-2!y!zK-M6sA&A4j>c8-#!ECR9>Jf*W3PDW+EGhxJ`{ zGr;?wN1d{-XL#@UCH40V-oVn#xVOs*fWFm;-2hryo7KowV7_49} zXB4HO9qUGy)&t_H84nN;w^V4|auLik;T-He02JB(R+*E$kXN^47Pe=$u3l}oUFNg| zj5s%{T~x?;V$^or@KQ$F{T4L0Trh-5J5-K_6s^{-cj59BaqkKC-e_LP+)bqm3=+`|F;RgOiGUMH5+p0@D`Ozrp0s_Sndyp_~vAN+K z2Ql`=C8^S+8{%1H!wX`oBV3^VAt81gI2NV90PlF-^st;>8oPcH63Bq{D1{My*E0cUSLC5E>THH+@$OSOd`UkR4_jN46Y*1G)a}%7!{i$c;do z0LesX75+)2)3d(4ss9cg<2qaY$uQzxQ18}J%U|D-r#|5_J(g+}Sd^boeavF1@0l)v zHHSHa_wncxr~Y#vP8*+l+~!m248j^>Nt0sV1}1uQprl8xYlR^`d-VHJ0< zTQVv7(ceJr9_(j?t)f}X!oq5o&nsyuh{V(?d;%y`Z5nuJm^4qLzl<>Lr>J!mg%LL} z;BY)zw@W~L%rOCzzigIncx9d)X-1j*GZ;jThN>ot{J{*u5iv_T&|{HUceRQRH+`QV z>gJ>xU8+ry-w>zrNYxt^9VfSv8>Q*M?30@nL=R)ULK1|P2AW!BQSPi0<@@F+pa!+2 zQBNL5YTf;^(+o4rg0aEdw>T?=@58po9SSS=rEdROBH|>RJDei6>}Gc{tTdi~kz*<$B;K6KHQCZzk+ENg*cKfU^<4+J-{9QhhY zjWtV@AVrXtD)0jzp>0UpJ32U;GCUV2jwUl#?I$#zYTgu6`UmUh-0TeSwd|uuU|<*n z@UB-P<^qE7*&blhdU0AJ%1wSokg=?<;VVu$X<_#4Xf8~2WSyDmw;C&}wLxXNutMAZ zYPfvGS0C?Cgbm-2^-SK-u5ysU{Svds?hNyNeWO+<>${BavN1l&{MGcAjQQb1{{37$ zt%`2jlhS+z&lmNVr&gjD%;i@}a>Nt`x_weRRD`>^Rn%(Pf;S`Nl{t<0C%F>n@S@67 z6Pk6k%6%20$NY4xmRpR}K=s`&c0?3=3FW{icUaJZ?aPbW53$*A2L|NLk2in$aI54d ziloRK+q3mhgXt|1*>fTq&fz_@)Opy-N?9Irv`Y_^H^~p+uHb=2-FvIM*-O~@ z5~@sN%rN28Rs-zk!M7@DpF@%?TXQU7l5$?ptN4Jk@@M#UBQx*kg(V_LT2xGZFE>)_ z!R)NdfE#?q*R;3;6GBWv!-c~J2%S%$a4aueNf^XEIM|Hv%Bcw%Ik%?SWX5KJ?X;H-mhhQocW$0%D*fbtSTrcMHU0|9K z9=W6O41_t=ChJNG#)c#f@_g$WUAYymq)Jp#EQV_fPfST712nM0h<{%lRa$IB-<2+|Gyg_7P)|~V-o2D?U@dR&w>=-|C3^~iu0iY! zmQZ;z#i?y}p4}Su`uREtRgzkIjrvn$WFO#hS;h{`CTQcK>E7z7rj+$O(jd%r*q%?^7))1O(Jx9F5skgs!=j zm{-(iT`gS?VcNj}f67gbWi+hR3(EePpVeKSG|>nNN8@rlcvUal=m=@|zh|;SzU$F9 ztqc-%g(M8;K^c7Q5SsTjTO4g@Oh6nht4_TsOpgjz?dx&4Rh5Svs(9!j9jA2*F$53Z6(kpg@HO$`!J+O|6QAEIk$4<1c@|Q42gibpyU4n|$$F#-o_~A`1V`#{m-y^q@7R${P3UT-^sl>v&wdV& zJOhJz+IPMKXiUpaI@KbVfPH7Z4VZBGHgDArc;3kOQ&GDVNv8;nv2iiIsAkK zd#kHV(ERBWbj)7C%Quwpt;@>HcRVS5X(j8QTa|`q)gcIJ(N^9Mv6tl4_1vYW?^TLbnVIA7ai^^Nfvi2~KMTCWfp&f3%#-p*PGz8w zApRF}lOt0^Z_XB!t?)I(zuh4^JvIMc&H*s;tny9&Pdj4jCX!gw5f4UVfX)+uL>f+ZH0d~9e%5Y)0vNAj1M zPQv!jSz`DlLQ!{Flk$)2Eg6A>`HlPoy`S+xc_<;J>By`(qT40fj6?Upm6qaQ`;QvA^l(k4S#Cx#>S0 zZV^~=?vYnjKxMcv)E)B(JdY2XXF>c` zCc_YVB`>A91iizhdC?e{3s5M5%nr(nGm-5!$UJvg98deLvonwD@!LgO{M@2)w|Nb6 zkOk7Gm-GAV4=!B$E&gRPSoLy@<&-mV&Xo*#oZUM>O$*SwVGO$$m^Qs-a;bTP*8e?d z8s5KV#kJxyh`EVBXwpRu($|jiDH>0l`PWlxlbN^Ly%lZ=|nB z)=sJSx|ZuLX9cODAEtIaMldKH%_T}A(!7&5^z8fn_&7n#pyMp`%BF8V?G)~6Um5hz zCY!4>X4-F%<+57M-x#*&OhaJW+JF57&*2rA34#K`T7t`t81WXFpCXI@RD*c5WrNmb zm7kjLVgobj#*QZE@rmH2c$&3tg4oA*5d5ZU=z>92Gh7c!ly}XND712RAAHEPgRRiY z@%W9if$R*9Ycu{CDltynXoy$3RBAkMr4zbkUH;P8j@={WBY-kIlt+4V`0msK-eUlg z*%vRKG5S}hs3n!(Oy#L+E6{|Bx1Cc)wHFf7)y7byNt*icyI`11E&`HzH+BDp8X+2( z#}&I>l-kPWs>jI494;lsj^(=#Y}txX^>izlfBkC*KMvWCGKIl~rCYmli}v9{yfj8j zFfecYO1&{d5Heq2U`1?6#bN|9Eb^e^x|o-`1wyami`&A&eV9}2q6gatKIk6zw5(O) zl?~&N;ATYNws*i~2tUe0RF2Q8Di2&5QB+l5gJzA9t}}Vk z)qbO-t6@A~Fs(Z~!AbG;84tmt{$b7ri!3=nanJYQ*yJ;AP%n06HP7dW4a%t()Ykg9r+dTQ0N{C9yhb`MbT)3;+S5RTrtRueP zj_INl6k6k7(`#0-J*cptmXx~N_igFOpY8FSE0Fj>%oWl#^FH9vfg$7mHj#&Ix#vtldo;1jFL}zOm8pzFd2afj-p5GA~LV~?}E38#@ z)3^O@3DaS2h6tvQ{1ix4ZfJ;ErbI3gi!|}Z}v^!rV3^^bzK*vg6f~Qj$rio zw7TXenJ9fvq&3^i5S0|eTF*9(wYw1=f%P5Au)1PO_N|X6fq2&6suB}(I z2e~I7^r`0^Ym5+oXsp69FvY-M*d7{|$l1I%AT>q_*QagGhFZj7Osv8aQ~g8W3w#+` zgTG0p>)Q=VbafGJ_u>}B4$)PK8DAH{O+{iU8UKvvLtnE7!x}8FgfqR4M%_8sHhOFH z9$Z(ErZSIpxi2`Cj*aZ9i?=IhxrIb%R8Y-tQFKM3r79*?BqiEb_gB~D`n3+Exb|Kl zMEc-MSgGgDLY{L#ZXyqY+x#}M3x?r!y?Otwo(0+%XB49cFhAC*4guC)A;&1B@w1vd+E0<$UNr!!YSql}BNs z#tUYB@Z5oZ8Qu}!`&37FljI+wSqk(8aE@P`%Q(BkrJbns;XI7@N4p}UqK4U`aI(Ug zyh_^Yqwory_|CSAygFiu772YI8M9@RmL2ywr`e)y8_?sTcA;TKRL?oPI@Pjotz3~< zH=c0ZhcFryEhI_{2>ou>enkwrANA9#*};Abgi(<1=^OQ!&U2_ZzSwc!*d33Fc=!0k z_F*@>rh8(Dp0!jsuYjCk6Q*mp!tFS(c7r)37Gr8=)y)meYirfgqj4>B}@Da0fs>~`b%fgN+js-fv= zdmr6I<>ov~*S(fY@Xs3Oge-DRz^_xPZvT+pozLe(o)4M2SFY3i>#yek zFg|@zDeNB=y8Yk!HOTmvMaiH_xFa-hR&`;XYB6J&VnuTmB^;GtR)qjhIFo^=h-4Qb z^tOiZlM$e8;!OafIP8?y4~^G*ab2^D1SIZR#0G(@SAjz~HNw9yr&{nb{7*Ync-eZa{yo=2(fGPsg;MsL%v}*bYLd+LE zlBq5L<@%gS;SWOZ!PasX)U%>;PJ+?E?8@8Rjfv^4g8EEk>czVdE2A^ zwiHS8`XBF4(yo!aU!Cs|D6N_4Of#J$KG7`N^<|Lh9Y@j5{|6U$%*bay0MGsl&S5DT9w&g#=#Lz^~G;JRSrJxSILpU>MY)Xt~ijTBr4 zjjj6Wn!`?VyvjXF{o@q6mJo!|b-TBjW;oh~i7K<78tDbn@d%4U*piiR_{AZl9ezzz z=Nw>Kmcq6pH2t!Lfu9??KQzPa^chG3gG#h!+a7S zB)W>+7&8{yJE&PgT%A~OWlfvxyll>4JV@L$rO3zq2Mlk85dqOL+k~yH8X~Z2f|}R$ z-n5lwkMmUhuxQ=WHnyhDq3WIP-5~g-3FIYbu1CTC5nLH?HF`bcU;h@^TXx&la+t;> z&N2`OX^Zy{>+Fg|3L9eKG4E(NxO_e~dTU#ZKoyC^`Y|R5X)BAco}>pR%#4UPB)Tfp zK-_I$K6ew2j%}RVjWS!)b1l|(iX(+Y0@(KZaLycQ@@o`!^qy4o(7t1nz zIbHytKuOcmA{PAW^iX-=6H$xE< zNd@_MM&j8WUBWa0YIhy4b%JD`z2onwOlNftm&>6Qspe_jyjw6Vf{rv@c!vO*S0lyl z;j}ae+ZKnK$r{drcWN%sLNpW(?HAIjNbrh%dgF%OPOwM_?>x{s&fgC&-_}|B;|~o? zb>?FD9JuM5(0&@}z!{`8+Bjdf%p;EgU41IYq)V3HIY3Bd3UXpj*m2${3*C2^OoJp=d40^Q%|KXR zDchG)XxD^fX><+ACTW4pSYcl5Fb6)ZI&ML$d zI6QhaP61LjN4}uK zs?dp#)UR}~aPR}ZKf4&Ie3?9PeeHx!$dxmX6+$~A-?Hz1y)9o2%2~&nZesra(yD*n zvow$t&1N?>h93Sbn)L3lbrHlI)!; zazE${SoVAUiE@mIOFO$fca!9nHg8%Xvpb?9h!eNER_~g%e;{j~27trf%0obV8GOKN zS_p5l_BV|Iu5uGSV5L)c{(1Fmq}u+#k~fuZ|I#ThUZ8(wj7%MWe+2LgBf|O%SumBt z^r0D)E@7~U`e7wPeCzXE+H6-IK3;1>XULW7mc`*)EF7)_JC%j#ehkk-fq_W*F@o4a zC`3&&Ue_Z?j?rkdX6A_+Us$E9IF<1F8=J1?A4s6){@K zL*N24YZ*ckXY4Yl*CWfa^}4B>MB^bXO;Lbomb}X`N`TKoeEj&4;SCcxTwz=dwp;iW04IZ$3(wVV4PcHDvc3xmU7L_Vre0;`q8K&1?*fA zLM80B+T7?-`d`-!O{MydxUOAopI>9|(F2!MQbNzN9K9R3y`6)|4MeqRii?%2Hf%~+byA@S4_5qBhH8JFhEHD;HftRZ zwrTZ??S~~O;tcZNRNHb9-+tpWQz1W`Iutv&AS+U`hmDkX2`oebPEOV%(1$TksDZ3) zB3i$O=!9O?yN6fw_xSkj!{gge0<>N!7+s6sNOf>%H`R*2AgaAcit1QkI!~td)y=$o zQptk1-C6#D51un$eBEQ|v-C8!Hbi_3W(ItXrm?@ks!HEVGeur!JNZ~qvc#R=|L zNY_Bw4(A8uW;^yoK+`kw$>9x-kSy=8qU+!F{X7L=Em{{rqmqAW+~RYAf0$#e+9{0@ zEsm5i-=PcPv=f?TELR`}7gt{<-kWvH6@<&PmbPoB{?__|>|*EsbSYzF)hqEFHfTu~ zm)N@cD@gJVX0DwfB_~80aiW5ZbXYw0O4~YHj<+GTOs$s*493%4>g?~TWzI~$MCobq zF}0O#GK>lGlb)&yzx5xaXDw#8W~Y@14JYHzxWM{(p%pRw&wa*i zZ+E4~Ss`@nPP=Jz?qY~cYr3&YNPPH)*-sm3-87D?;Nf3!VU;40kMtBGWn@UW4ZCyWEx-JaFf=tp+{HXSU*zG14#PO5QQV9yX0z5>F@z z3)6gn2qS6mdnb_S*V~xFp3x=h{aw%`k^uT{1a)Xhoj&mcz6@$(m-Ue$6WzJ%g)J>y zZJA(nv-+l6%y6=P^uBTtkcaTMd=(wop6xlxDxMY|iC~}egr`w!xA8hZh0eyJlg)f3 zqn99VdqSA_#)>GC2nvL@OD-d<)~yc`pTql(Ki|O#JldXl zXu&V?PQ4DR5o+R#DA55*`g^OnVGowF4Yu4K^&R5KnpgA-D<+ zUKX!4Y6n<#SSOeIQd3|$4sLy&Epv>m9Z4uKQ-~+pb%XOK-|iS$>#%x2Eu@Js&2Ul~ z8qiADi)L(g9xM55sJ5lUx?ts_t2%+HPdLxH%1p0){;se*?zW@Wk`AEDB-gXfRx5OP zgZ76I+={TivDh@3$6J|5Kbb(8hwAB|WKY*rQX=(S)SNYZ-K4i(D_46$$}p8u|!Zz*ZuYzO^p%42JrhTzw}vUW&j8@#fN5=uWS-7jfO zXi?94MMr5M|LQ<1sG+Hy@QCq7eyD!|vyc6(711*APlWw-MSX^tgEfRKZrPSmevdF* zetjo$x+4p5k%17449&F>&>&GgXqEu@vR=luUS#d#^${eZoLGizf!g@|*5X#S=A|C(Fa)~M2Qp4y zf?57Qezt)vZevV^-bh6fI_lHA?%DGqBKNPas*|k94xJ(f#jSGJ{&vtkzOZq~uAV3B zKHc5^4OEQsEhZ|AC-G>Aj>SjMc07JN#)u!MYyR@lt-PSR;`^I$FD+q63tSTtzy%Qg zKobP&VuEqxJne!RjgiI+x6wiLB@SGF%nPcWKYzMmYQe(J8YGKGp7B(K40_*yeAWja zy!D#kY9Y_K{Th!0CVR$@~@3HUF#-49u#E|2Y?TZ|4gC^g47PVsxa=j;EJcD14 z?`v4yTlq6&tK|ZEsBjG=CM5*ykLnX>sJu_Gx`DEaX}5&MA_lRQG*${uR^bP{vvQi zN$+(e7%!vL6+&{ep9NV37XpRq`s4YxtZZS0)DI(9^%BQj^PAI>7=3SS2sj&qrPewr zbu)?qcStzBtwnT`TY_8OGG+IW#_-NPLbl|PC$Ybp)mssN6z4G`kk~CppY=Wz0m!w# zDHvSetUY{BrbsRaqL_i!{ml)tLGm&WQ?@^dvb4Wa>1<+eXCZ$5g$TKB$OD_E6SOZ3 zdM>O-x^>VZ|CaC%i;xU-+OWSX2-Woq*E0i<5ljLC?yV|QkBJH>(_RMLe^helo_Z5v z|IJmW>1XpXF-~m;)VHKYE;&-`bI!IXT|omcm0e$tHslmid0SQ=cqTV2-vKiP(E^vD z@lScVDxj6dfF}sbcPVHHey2(j?$Sf_{mJN6v%@oLbpsy+)x%uUUw{o?{h`)N{Vwp| z#Nh)MDf(c`34_V0T=NXGpRZGGp|Cf6OF%U7C*o(iacmdyOR|sne-^VobhQ{dX;vC+ zn0H^8-jTyF42gJ+$UFra+y2u@{*I$yHZCuQx##AJQvh0?goT{=YsV8@kJM*U(9iob zHvW-amvf5U+@}ZimEq}^GZPvi@j&&8o&`z&Qh}OS8|l-B2Kt$2NPQM2*o!XhQH{1G zLEX7XD+GW3+l^xun?LipE{?uC2Kr4!bFuRt$64VZirgBi6MIh&p7r3pk{g3syD9|g zAYUznT;)KAY`W+?cn*mcVv)i8;Qpgu8WA}mKQx0W!q{NKe}5W%KMf6tVEEheT(h#* zBe{%z!-uaFw*do_p3Wxp*&X|@yQLRD4M91yIWAZVH&@f<8oz^Dd3`j2X2E&@+B60$ z)>GmRnF;o-FS@7O!Cs9(hi)_&1pF-oDw&^Y{o-sR2L7$Jb1;XFZ=(PoAuPsV^9b?a zbaLGu{*iAkU zu~7h4954n#<(xpoZ0)=`vzA4WJa=pxgx%x+w{pxBvLol;)1lrtGa0}XJX8F%eBbi8 zoa&{IF=@yBNCL8zyW5|~HWbwTK7fsTeF6js(mt0^Z6A5u^H{mPU>M;<(U>zBi1H&VmxkG-R>{PRX>dz2b7sDSb_}C2_M{A#dRh|zT*NE z#X%wm6;Hn+{y=&6t}dR+(~3ohzW;=r=~$)(^w1WY>9szDyQES%R{|$E!}Q*TOn{Dt zJ?>mfZVWnLmBIdUAPN>e>fv_R=dK4?6+2A>*Q1~Kbk>(QZQUcAxR`&t9^r#e6dYMa z`qbjUL0_=Q$jqzbab|%_2pFB1BU83X1**N*(z9!*d=i`Ho|KHQ87aRI@|YYy^B3z| zdi$=GC9ZckZWg~DXGk7bde;z+zc*fSNnP(1b$&1W(MGiS{vAH#8nEmS$qd(8mmB*| z%rc}j@Yt?rcHNSbFFIm_C-w-_$LWWh&%9Sg3g){#ua*i>HrGDoECiUOf3~>KYQCHA z_S!EFb_|H#qJvbaTb5O!>n8<+-(`%e*s9D}cJis{ehc6S6e=-3SQcbHQ+t;69qM6& zF)Hv`dP45AIH0$m3JgHC`RuQr(-&OdvOi1>TOZHI$$S^9>S<+Wg5Y~V1UP}T7uFLY zqJJL;72eR6SakiQXtPf37=JGNTDEOpeXuy>Ri!~@AEVB2^y)7y*ip3{4DoVEbZSzRm-EJ`gt z-X@!?uxOAGErOLZ4RH3GupE|WQhl*ko2fAj?I)}#UbL#Q@ zdWyeklXx_P> z<2sjk!T>wU5X`9Fw_74LFb4S3yl~#Qo2q`fg)01|s1B)NY(Tt)Tj2PN5im8zF8RGz zIU?c^0`y2l-nspWL1P&GjmQ5OUn7V6nv3~T0%PmDUPQ(s76S1OFyLB><#*8TrGxiK znl%nX_JU!slQ~qInG_ie9w5!+q&kZjLRZh*ZwNY&YprNY+YI~0>Zh|(!@qzG&xM$^ zu&6L-f)sdAqv-ExfY?(~|96Yv#-v^3GxL|V)xUcsFPSpZ9yspVVazf3JN~Lb z`RG!o9#EK*n!d6$oHh$lIGiaUoGCG-H4)zxMeuX&Oc{Fx?r&eJjb&In4mtG(2ey)< zQw9}(U&1%Xrz+cg%zk zyj~13<|=<^fj0Vx%$u4ovUWqT_rGyTM#**`3X>NNl%9O;ItXYFXc1dYqw6DeZcXrC z5C`#aD_-gg&_s!ae~LQDfn_16qG;nS#@I{)nrdX-o&@UqKS%_9jz|!R>FPQR(Tb(7 z^D4!Za)~IvAiV;*B!x%~pG`fhhgsU(=XH?SKOi==bx#Xz@eIR}YkwI`9IlIv_6&>+ z4PAzC=nXtT&eq>JU8E&~0gx{pE=Wt}uWLT-%0lrM{R3~*?7M8T1p{H+ZdL7{ZR|FR z|1yBZZBIcK;O~dJ92)=LT~msB4*4S=IXKbh*2HBIOFV0fE1!t{*sO9wlDwTqTpdn8 zFzlUS`O=9ueHQOnhw8w2xSn=|I;Q19d&OG%#DI5T#cgi;K((havv1#`XAQcqXgeE7 z$XiZ;eaF?h{Q2R zvMa|PwIofpU3_pK(*&oO6`EKp?(|%PE)7X+tLH{+8`P(c^+xy$oO6exEjADCcwNjAa{~)s1F`*-;9ty;r}%U%WTPnq7LmwW9F~)B>mz8%eyMb+?S~o zhQE@pjY}RpNMC8rJG;8sVaKB~xtdy_cK>v)-Wn=nr-lAQcYG=|CcD4!I<{&Pb~ z*@xd$@NbC_6mD#4K^JRY-oK!;0`hBJZ=-KA)3W(=bbYvo$B|)v&XRwO>4n4HJwr9M z%dE-b8^tDH(zlLNvwn=0hoW6QpwUh)xnHZ zZo!mCa0I?z<{c*%kL)~(%#&IH+7STa;g+ugUtrO^M z{8C=y5Fu3F2`Yg=?D8Pq0_k39%is1+5N zcDn-Ww49vcZ(Ni$+1IoL*ONA0rLVRO*RFfvD0qIfE-;L8nSn-F{I+opX*v8G|77YO zG7hNMg=VERyR1g=wC*46ncYzPA!5BUHFkac9qh{Co$`-Fw|L-R*nOp^;^%;_3p~Z7 zt-MJ;5K=}BuUN|*9@nYVga%f)E)VsH6g!+~6cxLGN|z$+iE_)kYRlZuM_4}Pp!~XO z&A=Ji?$kStUb_h3dBn>!FFYwn^t$F4C0Lw7y@9eRWc@TjU<#%orqu}&n74}6R*`*Q z3yTi4{^g+~iJM2DgR57;25-lO8O2ro^ickdnB2bdi9h~X9orsJAa!r*kzTCJM;a878mD}iyMw&`f|9U^>IIgeTcIJ6A zw7t8!d9)@ll#7iFI%H?Ksax>;qdeC!#;|^eCL5v4f5i9;|te-aVx4UMTz-^pWkfV}5W${`?9Jiqhv2bU`TF*4DIJYmUZ5JR}FjRyWv z#{CeC%U0H@_5>Btt-8LqH^NhoWc+~?b(qBMz!BV~BGjhyymca-&5-F``W#cpnHrN; zo`}`R#`Fmko);Ia(^1=~yBfKR38IQsW1Z!NZ;zF+-7mL!nyg*pLq{`ZC`69obij)q zcIpP#wW%(q2@-Nv8^? zS=zX&5a}Knsx1^G3?N3d;Tuqc+Y0>?CO%o#=HXl!B7Y$-R*w4dvIrhaH_1FGgEs8v zo{PH!h^GRQLaIFOL@uF3dFhrek)t;<^?uh6&InALYgy)TDX0W07gCX`l)hN1@g%o| zg>K50Gy+h2f4IvK3xt(vMG8uP%q=gkrulUY} z#yQ*n+FDfu2c28IFh%cC`UZ{R_j%i$ANbb2vQwTQv-U4lKv zFCI~jadKJ7*Zz(rjyov6NfQ<-@*X3ljG^%ifreUe)kxW;A@}Fla>V;ddIKf%=ot8L zQ$=r*fZGKA;)DIKhD5)pzT$2v`xR-z5J1pah8Gf=_c)?!2=Ov;nwn0_P?Hju*J=*Q zmxq>1On1I@X&~}!v0 z>2#8gZQHhOyJI^!v2ELSI<|Sg*IRWT?jP8--}YW>&Kl!y33>Gp4aHP0u) z>uh*w2C+qTZMr)kwspYc+ozTe2~5xE^z?S}@<3O{9|=YCSF_C9$#2%>P*&%9?m*6` zG|ZIc66FG7)eVuy3A$+IL6~38ER{Q-+wi=KW@&T*Gv#rQESQ@~RKo3Fl-x-lO>&h$ zDj$Vemqa;W#3xH=h`2jr#Wem!Q81(`|1kc`6I}c1_KpcKma9|)UwPaCi#?}L;%AUr zgOrhp$rFn0zx-VLd|?eCgaH}m0ZOr5YE>E|x@0{d1A9m3RtmNF3(BJ1l{gf|u>Dg} zt43ikQwd)$33_l2{mAh=B@9!V86T-0+v-YU0z5&qKC%=Y_LCv7pEK;LH|lW~BC)8{ z28s{$GPs#2MgQ87--i|~xJn{12M*0IKel~QA-HY^0bY(5C+~ZH2X#}CrJ-@i(?>Zx zvl!?qHKN_Gtu1B!n2%ECf2yTF11!6+B8lesiLK4N(lIy&XT+=yQC|4?NTC8zmP83X zJ6zh4N#J~E!b9YftkqhMf~w6Z-9qMpe*ZYP_(`bcWTSyxq=@50rM@8r&jRODafn67 zbcqixp1UCSi|lfPE&!vNe!qdc;!+8(dM%Y&Z{$q#dPMMs?UWA1T57^CObm7^w742Gm2BPw?uV#%)&*l8{0P#yOorUBfmu|Aw3-n zja5EZFY7&2P&N|vqMvWyRFSAVqLLvPvVrLA88h-BF*C>4G!Sc9tOJ`oL3ksmZ@Haq zHNyFPAlSE1!CIq(CLATXw|D=~VI#^-JqegZJJ{gxM|hTWZCE(U-4d?0nI*3_${DE* zuin$&W(4pVnq42}b6Vt}AB?!t$Z@k2JHJi@vRyvx8F=CO{`)lr-llwD3DcSRGdjCq z?=3fSAK*|y?Twrq9*Rq_y%fN`)UZ+O^Pf&9KU-@^yRQyKX`D;jn@X}GZ&3GrGN#YW zq=FJE4|YNZU#L$+4je%KENGjgFz?BxWdifd)IZ)vtE`y7je>QWj|^U=0TfgSjU_;m z=$dH-@U@ccs>cCUa9mtpG3FV`zrVaUH%I!29w1Py{EKtbP=Ju(tD=&75pqN}EW3A4J{PQQx zM|OaLwYA(IZHFH26D9psWa(_(LTV!-V6vEEi-EhFBc?APidi@0QP$h~1_~wMp#EH7J+1GG6{3bB>SmqZ20PR( zx^>-)F92$vliVf;0elJ=kHo-%dZ$=1v_?{~NfnL*_3Q#V_`4KxOM11?&S-TUiHdwv zl4%Y3M3Q(3WMdkpKR$)ovy~&pm3HhyBE( zVdt+uK87B_T0&SfBnKV&7jmV2=I+xrUa@b6JVkA`N$X0mN-nFdnoTvFDV%L3%irnM z%IiYdcR1Qi(`9q5pEd^j?!{}}S$cXx`;}&34SQ+(G&fxqaCx5*XYY$7BGt`3ML$y^ zTURnqb@_y03%iZQ8lQVxC_`?UKZ(D(T~0%BKcaU#i483dhjDRgfO2}dK-A;etD@_F zx@^3(DM2$1?e^^q77L==;f(H|J>44aG- zLni!dUMgVjwa%^=?Wvkq1aIzFXCI4EXzo{ZKI_>B)xRQ!ps6sP()8sL_YQyjaM3^he8p@1-DDNu;JC@sM87w+# zsVHnZMLtS#9KQM3#U0=Cd90LzH4m#7W*fL4b}kx8iu}GVbT1O)5Ch-mkS%}STP?=u z?QUR#wSv@1?mYs-dQ93>N#2nMSnaq8M?tksfuahrQh%ZR85wy~^IgVp=O~}VXkmSD zR5khprC=t@Gu=zBIBKDX#?)?lCCJqm)zdfb7YLy7Wa{dye_?64gq7T zUolcY(`r+fbCkT5=a$ny7*`zefPNK}H?woxiAswbPDa=GNYR_@%$Q4+z(P`+rV{S< zr3ZMv3HZr14c${kpxg=Q13ND@ z%3wkNw>@mnbP8$Ib{1V5)e-8v=6)wGE*7irsirDKq`5^j8jTVq17+t@a9@;kO7FkS zU0u~Dr0?fv=vk{96|9cCFcJTW8*3ICN+X`5L1!h6<2J?^g`aGeLsuJi4^imY)8&Lv zTVe5V-7TKGE$2`H??MPIXqw1e_PjJZH+6eqU65ATsyQ>xE)ls68k+tWzNUiFX)eR; z4qWNyuU%Wf#6}M#DZD+tH*rfEdO)upSus{1cyDbJk1kB?j%edMri)RRgdNyP0%o`z zVcNu6%HwRCK_`7aYqy=^T%5%G3J4aw7{FlKWv=h67LVX3L^MS0<22Ht@UcoW4>z4) z-a-QBkRHAQ9w#a~5f?~!)8A?I{Fa4$5M;KQMSNe60|r}V6Yy>&PQU1ceLMpK8rGu_ zkHurP88Z_Fq`~$RB9;r-!Uj6&q$kXp;a)T}Mp?*^^`Q|WOG-hA$Bo_g!pBsSX_cL=LPo|00m zzHAM6mj*oShy*9xf)WS1vzUg3BrI6bFFj}5SY37S_>-YM))+$B8T z9PahjrYADFH}aBX#?wxy6elPSvtni%a#p=(-z2DQRLlGUcnWP+C%7pAXFoe1lWE|% zj;*HMWr94Bz`UG8bM8HaUMBhOB`1fh7{K?nbEJI%9{@i-Z#_8T@8?#2JsDG(kz2Nj zOWuDD#Z3WQ_Zn)cSU-^UzR?6oB^djs+X3#?izRboLReY= z*<(3wSQ^>?Va%w^9FInEU0VMIXDwmoaV>17Oaqud>!07zch^+7ykY~GB5@vA6N7L* z%>Qc9r-Stxx%pIvHb7EaNm{_vy1te_82vOUxUFuFhV6t+VqVknOkWzGn%ZMWGDw?p ztIL?3t0{e<@H=;=-6;uypqd$tdsh2uPW>ZJ@24mFd1V?W-11`ayo%Q~seQ_7X z%=Q4GsNvdde1_lY7R*y7(Q=MyvNNu&f(1b-=RS3Ky!O)-Qf+%U^`GZ&`A%rwtJ0D#Ecu@6^TR9hZI1Qb{ zu-2MMEf#K$Vp1)-TEegHS?7ET3*mVsTnO`e$od~l7O2sgCJMm!bn`WY<8nC#>e0xA8HW7=nl% z4W>e^c2H}!bv~9s4^@C5IsSkq4k9nQ$~ILb^Og=v6_g1YJbC4M)`ib9Up>EnRJrHl zn0@H07hwN9ZIuNqaTb@{LvqeRbd0TYeW)U7zdAt!P#4*xVqN_1b9DU4n+{!rkWq_G z39>gUngRo7hy+*r=&kugY;bz|3&t$2?9d2+XddB&-1j@PPLosp$&tD1+kddLi#1=B zC^r7xr!-9L;4`Ua-qxb3EB%KU>jwcr1&S>eI{+nGWKVb2jrkkn}bc)0)R!OtJgyYN=E^ zvV}66k9WOkwG>zE8!vzsO#Ieb$0;zRM1ceYp+%2eA9zDU$09As`3V;4l9j+vI~!% zH(sMOR4?G-!Iy;;z|gm+(!Lv3y89`;7Ta%4y8T+7l_B{Yo!j$>W>2Hlb|z)1)w77k zt#wd*yq4OtLfb;ZSxUE5J9bi5AJ%J{qVJ-s=r5eHX{T3LB&a9v1fK}FtRZvFwg0=i zX5lMm=M9ny1g^~DPsdUDF*OWQF>Kv?D`)Yk-=8?>2mbltrc8Ci9#EUp z@=!hvCex!`E<8QME}!WbKc8@$TqfvT?C64VX6`XR6`FNhk=7DSx+>tbGNP9Dptv2_ z%6%<{c`rnSAbwESX%M7gwS{&UT5YoBCV-KXai5!hh24yYZi5(+JkeD`sjq?{vNnUJ z!~7=0jBc!BUuR=aeAr%+nR?+|q5i8AN9~C4_NnHO(5IuE%emt%7B^wI z`t$DkK4-$0FX~4>oQY^QY44R5%2~ll>ZYtc5M=YuG)A4MT)}9wB$x7pt1T}!RiWKe z2|4Dv6r3b?5F%yuk-@}-ns%n<^)(}JwdfMTIn9(5d77pKeO$Dtf4ZA0^|%Izbq$X( z{t^LSArJ>|1aU_xoxy8j#jQt~R>nx@$;oV1TprH(uxo0ypxFQ#Gj@7(DSU;3zB2jh z26XY={Q?s;A6g>hKefgh(j5F?R>-QowakMU^=0xkV{MRagMxq|RTcf*1Z{FQDjAh4 zv_=z*V%lzYNKfoVpcsLxlsC5C)!HwDI^v4<#8bGvuT89=D(~a~_;O>1r9~0jR-o`5qmU+_~3RV-l0!>+B zjDz5%#^yE*QRzgka&sthbML^vGy66hMUyLAPa)`+*CZ=cKbRJkmq^Y6BLLAj@~;Pn zsD(Pl*;(5eQ3nGWpGm36KEGE?pQdfeWQc(EKh z1fQ@djRSA`KR|z`vXFF6yf;BbzO7spBLKgRtMy*+yN2NFwBQLDg8l_6g>IfmLR#oa z*4QzyN@gJ4YEJ#(=+OPQjzL$4R2l+c_#MsD4}KPtWvFW=i{O9?x*7Xydfdn5B@t!e z2)2Od`;%^0RH8L?Z&`owrh~Fwy=ly&@ysyA1;|uTUGJShA4V}||03Q^PYJYU^7p!)x>fJS{X%J; z1mkH5#$Vg$>YelsGc}C{y3K(H47wPwJH?u>_0{VV@Kyb~WNFD+MRU`t{s&3@WBitQ zV=2~nECxa@kM9H=Ul3 zxVNdj+pq&H9JAv|hMjSR3$0D{V&<0lx%Ansrru&jd;qtWA%B+EO7DZ6b~25@u*eF3 z9_Z2m{xfTfONF(}+^*?(GgyD--`sl%v?Kf6h0l0Se5gS4rW3GFpMIjmHp<4RDm@yp zzm#HasHMFJo2)J$ln#&EM=`?THSP?|hijATC62-A7vy>8U}tONLT5LV2D$kBp?^N1 z$NvgHMCkW%?oy{E0M5}1lHJTy`s>KqW~AdD$^f$qO~q>Qrq3?UCQS$QT7B!M>rJ&* z)|*Uf^5SkVqCC)}hNj@ui&0Rt3F7ooR68o5Nx!bEmpk7EjnG)H;TA@iUD@snJVH1g z>puGm&$AsKB1m4|RFT6I7vcvV<)JL6;C_4!0iEp1%iA96_+%7SdP9$8C|2_U_24ki z^>E#yMX1}9=I7E5=RROIT(7WwJT0FWtCoGlRbbkWo7P>F`%C9AjE=a1E+#mt$kM5i zB?i4~f)gx?q=Tig_fwQN#kBt66vkv3#OKAyvdw~lKQ~HHeIE2EaY$hfkt~={t&OSI z$)F~(_^V2Qm!moCjO2k%1Qe?gQ7|CicX3sU)k)sWRd2B1m1B)O2g;xJ2;bGqQ<_1~ z*__P(?b&x(fw{{^bd5j`V8C()i19MyMg(K+MnB@??>kDL!rBk+*l}>TDM@{)jH}6f zI`y(e^0btRM#Fqanty~y!Jm@x@+zb!+Vg4I`-cp~^72i(8dw+XDS+R-bpC=3^!g(N zRWAG2Dt(4cR99udg-Vu|@v|CLd{^3llrOwKBRx1|I_35D!4Y?oI@{$`3Esxn=1_*7 z0K~4lD>oSt`Qt4y7^=uH5D7|rqz?z|D>wYdO8A{m*W{{9Xk}8B>xeWp*zvsL=(Gd$ z3{gKGS{B9@-HGRolKhBg1Ie;TnPxRHMePtthEO^{n?9>8ksPMxS6u!QMCeYF%B9K0 z&6FJ+{O5L>9qAG`e}{CBolV7mH6!zjbX5j*vo0iIvkfc`e%6qC3p~8heqGqBX>k~} zwTNX0Pj?G-op1XXBS@G-x!1^32yDD( zh)7)4sO9;q(ymqM-pIa8D*-zlOZXUKi`M%Mz$7i^&$0Ztj90_enPc?EbmOMLgtna2 z!FJis4A-Yo$Ew=mzy^-s|HRsYm8An=Ew05h>4>>ip zZ)8~l@`|TLZ?Xfn8-{Q1+jms0Z|&;kw=4^%VsISwU~{o&Qu1U?B&4x9;mV9%$Hyy~FdO%~L3X@jhofPY`oaJku5}@Did|CIS<%_+ z%nF)eFNgW6NE^H9e+YQTdaQ0UWiS#QB8CzqlcfHIUy{^+wNQU_W9_CE!z?7)5q?%? zWMR>78`D$%ylYfSn9pwZ&SwzD_qC0nhpfoWGI+t!!!l~KeXMwgJ8 zbf;~AA?iBgDHy{^b#i~&`^yyiSrTv)UtHK9uR+i{!eestQoNyHh1&VxI_ky$_R=Ht z#b&TID|GOl)4OCBLNn24#K&sJ48XBfu^(vkm+ z=_LGmhpV^nrZh(sCW)>fE}_;IGnnugIM;e>XzKe43=zj{9yWE4r9fpW=1%Oy4bIy8 zFWIovmp;%~Ff^(XkU%i2S#h~Gu=~tXf%R?tpo5~Q9@GR`?WXNKFr;;!GW819jz4A1 zS!mhzsXGhjp3fRy*wHP3)$R5tTrNS%9BLAm3@n$ab?{noE^T!$)e&QdOPupqC~Q44 z##c+gE15_GKS{n9W9x$!F)pSex{ajVzjL0?jXFh=w7=>g9ewF0|1M6!T8TBbJ!b@N zgrwHUBHiiocD$~ZYFBo#!6*trPN_-~?(xv}fq+&Oi_M~gLTBGm4d6%DJXwRmcCcYI z_CdqE6a>eOjN1oJVN$IZBE%2Uq|MDZtgfBm9Ufit%Nje`up~XjRK6G`k!Hf<v!tgWHcbhf0c+E}lKh`x&&(`oL zZmQ*8Z&z}5h1N4=ba2}mUH@XemWb{ISEm#Alxk;|>$6d3z-cIanYXi}mYApnZhSoB zhZp4ylR_HXmH=0c(#Lrn!&ENHFb#+>Qw@2&e zW+bKj6f~5bd6~;ag?o;-?f88F$}Kum2T={Yv@TYTLrHl{9=#_=k$HQ~1@5VQ~95jKj@` zb~Ba*rlBBjA;?|Oi?VmE?sWOhMp=($iEw5|8nuYm*-Oq1qq$rIb8HB)3^SDgV95WU zqs)%!2iMoC=Qa_;?eI=>5yYTs+Qo)fXA^vdY2#^B-*%(<)tLSt=6S0jje17i!;7id zULi-$9D6cG&R=;$%R2>^m3cYDubJ-O<*t|_RCSsF>1yyHc-d~CUCZ{NhOp$L_^hcs z5|kMOp}z*!0A$T@FWCi+L|0o&xM3Iv)`7JtPD@&l6eH`O89Iwv7Pl1FX1DBxkUe_+ zoC8*5V$|GqDR#pt+P?FCMUQ*y3gb?yQh`KXs={kAvruN!r3XVTNM~!<(m&_m&-R>D z$DT??p2`P8JxkPdYW%EzSJwdS9d-4*iNY<#umkJ!AjJ4!AK3~p|IxVXm3F}&>B9AY zOIHn4L}uYdO;Z50`}Zc@IL-CMQ72Km^aQt3_8xrxNlNhqu$z*7l&7TJ8Lb~IB%N1S z#*ek7J%0gzC;D$#wRD)Z619Ao-CuN3P|R1gz*eRev&?Rs4=4$0;PMpy0*XGGk0~If zpAD^W5^AGxf0RO^*|~Vdijm}Aw?^ME!9h^*)QC+E7vt3d{jOD%THH`aFwha`W`o%} z67xAjS%&t|f$5E}|9V&vM6(B0tAw9h3`M$ei4IuD1lvesr#l4=sp@#>Mfg4shLje2 zw&{Q)Ki=eSPUx#1vWh*%1K%r#TKasA_uxQcVhHG_cb5PVUzWGV@|k>#b0L-0W~)rdh}V zzSHO*Y?s6267h2MvV8yPRak}X?@T>P{^i-&QkAe!_r0cx(aqKw$W+mkn!zQ@~N9Ey@7(P@+1m&ms(4 zSAfM2gjV@JfGV&ze8t$_^{u3PH0nsfbpvz?vzz!^2HCWhyaqy8tM~9zi}*#U`z^{w zD#jc*2@3mVAVF>|)}=Sg3=(oyF+s3(JXF69yScC|lSS*-p~67zr)+6bSjf)IM&2ozf#V-Gy%OPG8=|hBu|!@-s>a$*&WP6P?ma-JqN!%=dlLek~`A$5eH zSN`CmLx0ZI{_tMM+0o3YJWgVWssl%1m;4O1Y+|2P$Bhrtxt}H^BYsdu{947;hbJYT z>qeuLJ>EW&IH5&cY~#j+B}0H!=T6VNHj{A~UxNW_jiI`RDwGV?jt@Ot)@RTfv+^v% zY&u}i6_cYwWTbH)WTZV3mpSk^33)#+B-VQP(?5X|aqe}uUygR2oitis>;? zGSIHU6LTzTvf8)B^H6@~H_DmBcz{2CHqf|4{CU87Ny@vFuos{rE~vv{56o@wLu`KY z^ZB;R8QL|xZRtCPOjpAB0UpzM@wVkCg7fsWeh)g*^E2<|xFib%CkYCYq zy+@^sQhp;KsXU%X7c$FjLcx0ba8_Yl6}@H^Tt1J|oGaBXR#H>3yh`I#ceXo|C{|Fw z(=lA2E|;Hl;qNzE?!U9X|Kn(d!G+LC3Gq0(GM^$^TI{pWD23W3<{Ie!nO6|xtI3@G z1lWkQvTI|*aP@$HMzx;PUE$Z0iCdh9>>q^ zcj&L}Y#znoAfNstVWnnizRyWl|9hULFJe%b`^)1u$rVtBv!jY99IXVYFZ!AgV-ya~ zZ%ieGA2qgW2UUeR&!ZnMk;rdsbfiIMu?L$)W!rRKJ;e&y%`b6i+UO0o#U7v1#J0qE zx^d8#DXF@1IrYygJ<=CPiNn&eci_de;Ei zb+HKPBcgsjQ+4T#LA7B&-inEX&KWzGF`U#-b(ql8mNX@xHx_Q9*uQIk6FOj?G>@C& zUI3j;=Ro^1#n zIzm>JaKefYu9e{R*@)2AWLDxcq|UkFS<9{ivD4n@CS(h2wD8GpXXmbdY^v9j;>Tly5tI98oZqKH|83-(VAA}d?^EWD=|S6J6j3EejlA_Zb`e1EpCO0O z0zHi3Iczsa_3O7_@e9uKHIlqoYlya6UXG_{sG&e2cSA9Hwj|sX)69+KIG^_1LIWZv z0)$CEuC9>Yv!syi4m3pT8={bFWCZE}Z*QsWKZI$h7yAw8;@c=FyrXl3Jz|peY_nUG zkTOmeV!X9^{{&lA#wObo%{4Y+sUN<2qSh*6$D?LdB_CBR9A|8j-dL0`6i{-B(Qk-K zn@7!w%B`H$6WIR+sZmHPkg-_S7YCS{dyfqkltm2LOo9jaUQ>H65=gb&1+No)_$YcD zfgKEiZlKQsFv^*|ZpxWh80g-$0*xLo`vHSuj769H2>iMoY_a02Un^C^17L;l$3?go znq`{)nB~lYZdz}1j0ZcV&yx%>fp6K-Lc8_A77fq}q4yO&VYL27wz^yUP;%?8J)x&j zKm*l-(d`l$9ImQY-SC9!th=5r3cG&~0oe|rSMi9EZku}NhnP$pLvlK_-$=OQhU=(r zixW6~zNEbY#}r{pri1|1`dAmW$--H9@*7*A@MZ;*e~+)LG!dEC<7WM%Fug4_y-oe~ z)ARhE1^;F*1@gxlR1E&_5iJHoH~53_;&R)XJg-}4yJ5@D_0z`&)HWm#ewdIu@mI?2 zH=6aJn*2T@*@lbV22fK{&(0qN_WbIWaVD8rgkP?v?FBr~`R^{xx~F73 zrc~7B2re~jGPMlTHStq_g4S#uuwtbHi-!xM;AJZI%pm^CU=(buwfTLV1nkdsNt8`9 zV?!T+aks3)Lz~B;I59}s69;(7$8m3Rre&N)hN-4;Zdl}Vc6;5lfR;9KcC_i5W}_;r z$cWzwaKkOcAPBfoVw(kxmCx7B@9p@5xTlV6U+uqTTIJ!vh|Wxes>&j239QkEW?xW= zzIB+i{+d0ku)5hUN1L@EhSW2|l?42&0eF>wG2qVx=}_Xc$kEp6Ht96Kd3QAuS|WCE zNtk4cQt{#-IAVGnh2OM5@$hx3nE*g9aB5b{r_ZgdyM+>I80KY8qdA3=6JXuSM0rg( z{pT9LD(o_`NU++c2n)=)!1=uiBO8i!+YVLf(&iGujfNxNqlg;2V6LZQ;L}nhT80PM>=gmc8?| zrzT5}@(>N)fzG1(jY+f)0x~zqhBw&la-icX{evp#8gmnlp7-z z3L$zEXYk^n;t;Cy;QFHD{G#Szps|BpDbtPkKH23w9OYNUw$4@cz-qo=vRVnTvpYCH z1K-0vd`_-_HDSA!55l>HyjF6ROjY>bW0i{!Vj`^AfEVtr z5x-ZE>qV<8PIF2XiTGk##g->w&HdK~bfo{)U``Qx)m||*8qoKdMiP8zO7wNfN=gz; zooec+8eD8XJELl;VhhQ!mEzGN-5P@C| zRnLXXEqx}}=nH>>Z^7VpXurHCVN3n}?;;iE_Q{EuE6yw=hfMGLYxhsOi|kAZGN*!V z3wczo!($-IDe84+Rg5ec(u+2ULB=u*=)V?y)q^_=n2Br!Z?B7F*snL4903B)pEbUH zLTvI3c{@tx`Hq#GU9f-0;=q9X29)Yi6^GzRF0ZeG;kupBh@Y$OY{?n7h{XTER@0Uj zBIhs=7>3;*YKwEPjm`_9Dy~^|S#a9tHQ+6_B?Wv07%CHd5MyLe;M1mJ<&q2vD3?}O zdTkvr&Dp)+qhkGQ&A{bo8fubxj;MgUCY%%_qD+xoMBkh*5@Y8|GB6=kd~pLjoY zjEUo(MrXCqGk;t-)P!iUK;ovF=T&=!*v($|q1|(1%h)_ou^h#0r1v{^CTmp1C!UR{)0YUWpj#yv^9YhhIk&{sVbQ= zJAG+Dq8Vh)LhM>z!W9$jDYR;d1$MvD`;oIQE|cXI zUbgXf;<)=iUMK|8c4C3L=o`}KnP*`l%uV_(x^2f9aVRYTCvY4u?aNlNUtySN87|wo zE8;*A1Nt0>l3XV-02Z+#=1%uF0&(g3Xc1Q(dzn8mE0Q}=2-1snz<&q1Um~jgJPNI% zt$#zi(89pR_)nsGA3hvuIKSY-P6g+c~rx%aaN!9S(=^%tz5Z($( z!ILA&X<3Fn8ZsQvBi~2QjMj?iEL2Df417oaN1-qDGP|TB@?6Mp7oQi8 z!p!m)CED8Tm#4k8^p{{|iH~z}rG9W+s^vkj@;ZDMQ+=)3bAxP0z8hBlf5UhiMcII9 z0Iynrt7%YG!-Y@LGwPFp>kXOznZ7A>u+~?833mjaWAt0j(-+>dmF7Qw^h# z;2-CA(ndAQ<-%;GwZeK9%(+w^!J~E71G+gTsJmY}1938L4a|SuyJOVe>Zs0K_;GmS z#f9~_q=Vo&Epa55X(-In`FH=dZ=AH}8Y6vy2`k@ZE*$uax)m+;2}ngaDuR)`&H!vc zaN8yx*NIJp5spSz7J)=>QAEl*&Di>F$Vu|=TObcjvKyW&vpmfCP0|9Oj9feA^DZ^X z+I%e70|@r7EKg|0Y>{+H&H_ne4e*(?3j={d0#fO)F_1;;JX!T;`$SM=l}}0{p=!PN zjx(*l3gJ=Wn&}l7LmS3Ti6Icb30zluJ67i5JF3v}zwM6(pO&@?PO?J&zv)ext}FB2 zoA!%L$%*lO+Ng>t_~axC<-jpjc`(5Cq={}KbFcjF^e!}pxh;u~(!hGB9R7Jh_4FTb z{b+a)dH8=0BoVcC*8uyAu0=|bEw<~V`3e?C9bvT(GUWB91zH$s9{!1@Ao)=8|FS;} z6OL?HkP+f~gakB-t6Q7v6->3UMnc}oe~X36T@~+8WM@g&_0HaZu{uO)5FKtar8aXp z+O+}TkXRC68lsOvf#V`V4ik`*nLk`8_>$xb1X(?!9Z}arJT$G{SHe}g}q$JqI``n<0=yl+!{e>{ZPWT8c~Z%Q>MQy2n+Z@+AIm?su0+nCXJRw zrRF=jugn9BJVZnTneWv1wFZe=PB98i_*HQ+GYc!Ue0b;l%7Kg`SVM!k&|C#z#A*|S z_P!vGPAV~RplK^V9U0q39M^{Z(N(!Gp7bY}w}sepy}r8!oSfJXwx5)Xg9V+6)13|w z05|;03OQCt2An{Nm+=EZ!bRm#;D`sWjM3IC&PGCB{^-m1;aNC9^(Q>ERqtSj%@~}i z?5wCcws|7xtzab#TB~aJmf1Dl9(oPhC^RI<_%|x0nPH~L@6&*LnKt7(BDsLdKQOa1 z&A^c(u=b#!%p|LFD1+4zp`T{x5(%}fV9ee!kQZ6AfhHG}Ri>@GL{4<^#SCqa7;zt_ z31PO(J09M>k^Dnwa*Dp)$ZDJ5Na##8{_{ z_9fPu=nmC2u)h99jK8&}vBjNv%lXL98`2;kZBees(A~4WqtfH`H@>(?-xHxCTW!69 zrm}W`0uP40`ic~sQU3>LORtyP;RN$_N3-@{H!b^mVl|_BX$Nc%3+V~Z6e$;BC9KGD zf~eZG#2sML%wSRLQzgK!A2A32f@k_wl|jMh;f84e0*^7)<1fhOzdLY|SAbG84)O2G zFV=rqLluEroV^45hdo47C1RkP-);6;ug-8tSTRKfQB8SppTac@<;Gb=cWO%G`1ebJ ze#ADo_KR0Q`8J4=y_^(J`o~x~ExvV_tG@#-vN|jpKka4XtIfHeX8S*;Z)@v2Gf4&&SPJ#Z_jzYXqBIX^&nc(hKgeK`9x@bL=}ci14z zRx7!8eCKMZ0Q$mU4d^ub=`lrrFsw;t=@2J4@|Cv|OMkY}#9CIz_f_!6=%{rm*?_+f zsSU=JOB&!W_R|cHEyj2Q>WZM0dJ1ep{`fSh7ZmFd4GsdS!3`ve=NWAeBD zh*baDbx#L!*smoA3ab{vFcVjY=o=}H85USF1y`c;s`sQp>130L5PR*z88CVI+UNI# z2A8YDxcmjgKp`lLb4*=f0HPz!njOT|W`+_^bdQ&^o!1<(%X@jubr*v1A5cF_O2!^0 z$TCA6v-sQ}&dARkf*th8c!yQ#!ljtB>h2KjnP?#Q?U1hcUYpWp8KOzozzI8NSkUA zo~THob>wJQ9PFyrTKx#jNIwWSHQH$Q9d{Zw4KEL9btN=HmJ%4A^Ga%V3g)7vn2;Bd z54gR+_WM+4=%vS-jNBasaA^0E&R<8#GGXHsFV4%&+m>h#P40LqJ%V@eSY{y*!j!+fIzCCJqRL(%Yeno0*@4o+?3Hkz`R{ z;NQ?azkejgoHumPdi2MWkc0n`RecZ5aKL{y{rfciKpwA`>m*chS%=CNTGb*vEn+OY zqP(T$a^3b1hfpd)%xS-gyt6o&?Kp@Fs7PZ;vU&+lnArD$ zeT#@}*g=~prFu>LdN2t%5R%zp3QQ3x4QBw1oMjMwRAr7EWFOL~<{ks+(b%NVbv z`Ys=sNW{`|+PXgx!c)lkXoAEM%%8wLo1-C>dvdwRAhO>4RL>Ny-lX5F^6fXjmkgR5 z6j)SqD1YBpa->Ael|;NocJ79m;=Gv=Ty1NCHOPo^ud5Sf4Q(4;9`CME0{zC$%8V5n z19CcP4aVBZMTGId#3Qs~TC0tV;U>9pSoT-WI($qXf#=pKrVJNeK7qX zh?&r?bKldR=;-g#U=koc@+7hX&@j7zoBC1bRcjy>I^Mi!|Hh13$|FH!jQ|A9VNSf{ zi6y{9AHar3iuOk*IPUhv!Xs^4k`4c?0HxYkky(*R{J4_6`Jo&R^tT$~kTj`3IRG$Q z7*2`8sH@g1lJ?POfLj6%Y4^b-elKCndLn0=AFQYB=Xa}uDdpEBS({s@BhN`CDheh< zhH~anL8o0x$pk!D1pQ%6TOx8Ynxg+5hLtw4Wy#~=7}}g@3t28AdEqo?r5x&>fghs$ zTZM6_=+_&2ZPEmfPl0S(&fvRgdfhrQqM-CWXV+b+EK0{rRwN+;IA}c@A+Kc2H z*lYfDQkeV<=<4^?wiuVxBTr1&oBRuZ@J^LJQ_Kj75HSMT>sZQYuLdUZdN+bq;gnmP z=%DRWpS*^i$DkRlD#ny|FBlEkOVQ7)9g-y~n_NRo4^F3#Ip}`}UJxY(S^jOzt)=pd zB$qu}>c$!k})RlKX!cd#4~#qNYoifwmsvZTs1m*a~lPQAB-s zz<;)>uF)eO&Zu9`W1&qVxiFDN=am zn#vt2r&xU(?G2R|{C?x90w7f|K(65D8bh_J!h8>Ww0{y+iD3GyD2@>^-qa@~YZLjf ziGUTgKwYh=Fwx4DLjJlgmw+Rq zL}j3iv?8jdAdgMav3O+9*USqbP9O`Zb(X=}G=mcuD^I@FOdRW1r72RN z>Q=zj;E8>@ML7UwRU*?-1VAbVO$(X}mdMpeY^G`X%Ca7*= z#na7t?s`(;gh3^CjYyU7DmB9MRwlp$9U;PYk|HzfstLZJ)T86aCL<$^#Y{_Ez6Mj9L#+n}jWi=|}Zp1RNc|&v!+w z2hP8`K}9@dGKs`e%&*QuSF+G-hSp;Tb#_E8Du>)UGROsK4%oyGCZQ~zOh&~}hEWXd zUylNpIJi2|ITA~*7N3r}6s-cQEWT=He`{qgajz#`ZGakl1yCqWP&*H z-Xq6?rY~zNU-}iT&8-w}Xwini4`}LX>e+kc{c@)6@wIsH=+>^2-D?q&uT29U1=8a) zPpd=SIXp+bgM$OwA9Ok9+5u*X_rqr>|A;eYe1U)u-3D?&Yr5m+67ox8*~07G>~cbbk=km(!z3 ziv_m^cjLQ5r$>EubGWKIu+X>blZW%>q;%4ye>c~uG5->E`rgBR;yyQ8 z4at2tZWMf{FVz8Mq#Whs^|XhXY7-Rh2zISevs$kwJ7xy2*}P19yLhn^^XK%?4pZgx zsqx1ybI$%?OndxFnv%zA!rGMGdd=O_+o~>VsK14p8G-oT3AiegBazPVdxhSK2W&SiZ?zidE z%G95=?cSHUX6=jc|9HS0pDEhbZ>XIdj5oZwzqmFwuryD)Vgz1tGn60kl4QDuv{)zSfY$RJZWS3T!zH0O{^w?~MJGCT)!M4As0~FR2zUCbqanG1)&}U$4L}S>r10l({!= zo;r^f_vyGK%T*&_6?v=X=s6wW_#S!pao}>f4B>4zGre?g^pbG_nBRSy^I3L{+;7(? zAFrR$69Ll23qLE-scEh1Srv4x48?i5p?Oc98$MbZW7X8L8O{1{0B7iC zu_jJLGQLjbq#tmKZ)!=G{s(B=^K1HY>-F9LLfV(p=(h8R;t4Rg+kLh-6dN%;MW?u~ zmbl@#q%rR2gMXkEBkjS)ZP{tl=tY%}|Dq6eQJJbob%PbQSGjzMpX6M;AkaNlA*%yP4g8$!GWOKwW*(Rd}FD|e` zbrf-wQHcgJXg>a6k#CQ$w|ZH}g+e)ylXG~>N1foG60B@!vxW9|JC=7B*UBbB&8F+m z*sIyUBP03qCLKaeWRyV3BwAN*)dr+yo{sAvyLyC(YJ9a-2F)y~me`?cYSAw#eCGS$ z5$3L@*7sCI$mbnC~1R1bE zpe);4=MozN^k)T|81S%_T}8v<OP zT@d9es||Ra7-_-gm1j+j$jS0Nm#LDhM#i;2WEw~iae4%3vvxgPQ6@w;*#yHXm;iPMQj`l1W#SlHv$ThGOL%K6oi5TMyTSdp>aywfrQ7F8u zR&g_6?}|rDh+>gUAZa~(AwwMiQS#9?n50z;NZGv;geQ}6i-{kwdVq$A96U+U(I$dwSVOFiiktA& z%rK(?yDM^8I&6hv6Fc@6N3e$kvmTDJ+1 zIdXg%oqtNX4mgEL{YD@}FBd=JH87KUSY1@Xxd2Fu2$Nb^-MxY*zDJrAf*T0jAVrMH0yyhwjTKU)CE5i`>e$qU$fKSu=LfZ>;5y(P-dd$VW4qw*>c%kMw|&!}@bZyKrviPS@^O z(&o3dMoBk)07aZJU-2j;o8`HxxtCYFx)Mku5Et~wP#5eG)1b|1g)f&*CF!}B!_El- z(&V>gPyndyGRXl{buFp*;jfc7&%Jx*ba+IPaePwzne=uNyN>1gd#H#4(0~_14I!P| z-!*uxA5v6;zk2J5x~-cxpp^8xWu_Ym{?Dc{OGN-w~9K$M`L?@Fa}^x-RUk7{8VR!JWgZ{9?tI zII|quIN#d2`6)TvPxoW^u~=4bZ`PDf15dpc!B@N`@dl!dzBvcGg&<1OoN!$gCPqo03Xxh)gN-WR1OJtmq;%t+drbBSzS3{?z+0ioRjFw=AM&8cj8wR?+)NGB z>-Ux_6ICQ9`G%#LQKPGz*bSALZ#B#jQ-1d2zyDlH=NYT+xmCD35zQ0G;Gdi~Mg}cW zg$@D$r<2vZC;p}WEgQH6+$q*|ar_K(<|u9PH_znFg9NU&u9G=s+Y}M9Ai=_amUO|% zSSL*}F^OT0tuA~Cm68lcT%peo@6*898X2ukj1bM0L3cR%Kx#szfUvvT=Z zGt-&9WBlyfn)uZ@p<~)x+W^ZUSENaWt0I;@qtLAa0ApuFP{p%JOjZZ#?@%Fu;=)9< zA`sC3-&Bp_8VYd5{(n(5jm_iK3KeTkL!R(h^5B%gf6R$=;mtsoEvNwnjl)D+epkR0 zkY)u0%D=qyADfIK!)~4$+&j)sWKzoICosx}+RBAju}bcbJcydx|F!Qm&RCFSRShGj zAHUOE%N!ahC;Fq)he_nqES0NW;x!XOn+_=PtQ~bKZT}lWV-6v}%K){`5)66<4Fl-k zc>u!?2w$^=;JiHcsoG^qRRhnnZ=;~D!~;O>Wd2H7OcY|ZAOp#Ubqf^axBVsIpwB;T zBnM6IZKeY;Y|-6{YR3cU>~(;re6ZLF*)99I{}J7@EwE*_6oTr=&uNDL_@}O}UupAE z-}ZOzN!^|yPC>naLvo@oD?8Gy<>mdZMk)GPF?a)4q2`A-olX}%YinmXydl!wEs~GZ zUSj=ACJ=i%J;H`LSLFD#Z}oU}&GNIbgJGjiCtPF#$mEFPt)@%SzaM`1 zmTtNae;`GS0Tip#(q43SN43^;ca46w5p4EecIGQxyANjtI#Hhp#%r;2DTGnFWot!X zSIvjq^7xKcN24rAK;?@w!&+jq(4oy;GQ0U8N>iUDzRQ2KecBs%H)Fe0;sE9i6&0)T z?7!z%r9j{q`kC?uHv8B-{)wRS1VPZ7PlT}@zG1pSd4DW3pYDybu~JGo(}ie?G*sqb zzXK~9YWdy&D-N-gtwOKOoL>>GDcdnN=&{a_C?w0eCn6}TQ!AFHVp~EnPG(IAr2i|J zIDpC$+eF<1D!k^!15ZWLURSV~A7_8f4hm`D9%;#mw5&QLig;Yf6SNyI906$oz2^YB zQ|U!F1d4>T>4`{En^!WyJPX8@>RQ+i1V>mYOxIu%JbiqYA`atGgoh?BJcPAsSA(YQ zAW$9-P3p{JDNS3{H{2{PXYd!OL_J%?3S43ULikUsh~2yi-HQu=x7Mhwx<|QkWoONO zMR(h)gJ(~Ef}~bRUeI9!j}Vcp6rlDPXHXogiHjm+b|**F31pkMKw!{IeryFb=5gxK zA!%fEjMvqesFvF0g{4WgeWzlfK<8}9bJM%UG~9BgJs?HPhTV3MwO_<^`L3{K!>U9H z60$*hVG^zyS_aZg@tE)fUZ$G<8cSi0(d3Q5a4V2qeOGkpv`CwmcDIj;p6CSQLes$!t;G)V-;tpFEQL|_nO$)*}bJS$Tk zUX8LW+{@e@2ZXvx!XHizo@U~VQIAgs(aM5~x`oj%oY}wS`SoIt-D`YatWtg5F;V$^ zU~w?JX_Faw*sxK>PkS}HlLiD%(*+iAUnA*vR{vsBCjp6%SS917vFm0TCDLLub^jXw zKep0kypbFCy= z$AeDj$)o~FRFizRc&vCR6=79Km0Ti8BzVP4`U>MtJ7Deo46e;d+G;%HrHcKU8aM@? zB7MbfcVA0-u(`ijfif)N-#d+H=Br(L!+;WN9px#5jFCnft&`5Ndh8mfY)v^+!~nT0 zK|lm0>Dt|v-jyE9A++B0l*)#!C}Oy<%JY)CC2&)PX|hwImWk%}kJT}m4{Y5Au&*D^J8GQJ}0 z4Ow$+wIr0FUJD89ZWy_G`_I`AF_wHAY;QeU2YqbAEPrg^k{;>G(hpWkb8UMXJoj|j z)whmhmKtfIOEly2nP$?YlqfVa4MAi`K!G?Ukjuhqcb$ z|2?k>NM$e(%(R&w?nlSER0Ps*F(ha|Wua-A_JOVqX3Rvu?BjnVQ$8J~|4)VIQpxfR zsu`pMjlR1D`8%tVm3P6X((;iIh_O5h>Cn3xp8BR|JW++$=PLKi^>g-Eb=QA$FnxXZ z=gsPd0%hj{k4hTrMJs`RisI^Xd`SHNl~PUHj^Ok zG*7`rAI>}!x)|y-jM!|4*@|!@O@{M)Rexl(-!!2vJ8sv_Psl}fO@*uJTMQ`2y)XxV zNE6i#@x3#@?XPMuA>$rd2F}GRMZx{G2)chdKg~230&;hKfI*f}aTotWU(K@$=6Krn zY3%j8U^Exfv*k!+_O?#{-7O`j*ipD=k=mHjT~gGy&Ss;#mO@n=e!t!GUzTn9&5D-~8KAgMGc|HWN>Gc-eV^uU{?bqg zs_6ijxR}4?Jqv^u3pIE8yX_BOa1yePg(4i?^u^3)2p>_FoRPN%VbYumtIqMV=iRgz zBr4=Li%alQ+Gq>8c18lMJi{~2I6g&9ffH&dg3PZ%=7?oM;4x3EGb{u1yE_u|J+5h< zri0@dt;FtgIAEg1b_@~rin4EHpk6*X2nd&vd`dJRtzN489{x$CyKAm~M)67<$cv3I zZ}ds6@;50^&PNa&w!yf*WFfDa>ZsTzmSA3FdLL9>POzr9)oKt@1B zPS~R(rLF8VVP`}6Gh>`J)}-bf>u=NBQG&^Zp3N!CZ0oum@;@}L5*NL{CKP1dOc^Fz ziVvRp%Nm&?C-fqBL;CpO?yQpS%ZqVYh%w?K8tGvF4EPWusao!%hU)(iPS3)K!#E8o%OYDv8+zK00EDkefv*z`bT5Y5~D1 zO^NSa%Eb9AZHW_pCH!ihrwG3vZOV1I$t%qFH35k#f?rrkd6c#t`DNEbuaOxF78fSG z37l=&k%D)Iy?}3&$8fHZ0NG-s>{n|WkpV<&sKilSS(*<%R8J@buH0dx6V0Jei4^e2 z!y|&rT<58OYT&;%U3i?riGXAXvVzMAEyCsc)~N@%uNa9`5u!NP(^rgTrJE5dC}~LD zHLiu0R}`h%&rc=9{D)J+B(1$?h;`!G{?|ECW?0PQ&TLX%bt|VMab`DOq5t@V!^uYb z%5|n!85_qRYb7xBJLT@aCW<@>rmHwbhZUddcPN1kJuy1F&4HHe3OG7f*Sk|q zUgY4vbhmcy?S9;I#Q?uCkypW0$zxg+aGGq(1hBfX4!;SutO+k$F+wc^C5v-PzkYk@ z|0CgPT>n45gnRtId@_}@-Rv=u%FS$KvaWNh zm#^>!`RxlQl~dv}cT7viNySE8dK#;nw-o)f0G>k;a&Q@U1b8Jxc`1)Yb+*?UJe6!w z&-xq2iS195r71f&BxBA<+gl5>GVtYJc@Ck{tm(B6luUcwQ1Q&%J~ExQOP`v4*KR-; z-xuiL9f?^QK)km04U4E5stbj1mO;hoyJBHlmRdZ+Jls(vKVtfUqF@6v6qV&j7Lj-R zGx@INP)-xxeg56|#I3`>cRs>mJS%yt@}%SYX1ghS*_#)j19+Vufv71V0l^C*|Cj<* zq_C?-Pcl?QPDt>V3XS+bO7f%MyWz6Q5^#oki~B6h_uh9k^AFoQVSz&|4)fmtvm8!T*CK4G%%MVXulA&aZro0M4)fOKd5zULkOjcuK<1k*AHF|b_d76&ao1gGDRSIYRzT)lO-Dh?S#e38!zcBxl*PD<>;STbHtSmF5QJaLTu{?Rc5 zj;+*swJCl!xYtZnB^dYl$XU*HS%`VC|1xDplNEiVd0t`&2wZn_LpzkonVp+}ecEGc zSUj*95f%VEw(q029{-yj7P(9i8103l^?Xq}S>S};Dpl9!W_{eaBbz&X&bW5y^n6%b zPU`fIi=?bIVXIy??3KLPB$0{YjALlBzGfzRT!nGsY1qunn#yV6sBzRb?oJ;Sp+2Y| zSt*m0p0C!PneyM)z1{)$FKw3lJz8O~vx{R>Si{X|`4-JkU}J1Eo}>^(bSPGODSBW# zGP10|A-AB{)@bJ8;9r-u5nrT?lKfkU4?D9KvbuLqZIVqtEn|oII7#r>+7_3QLwBuI zjp{|1)ilIy!AHlBs=A5kGF}5PE1$1j1`4XP4*WpJRdNH@R}$={4m+mlQn_jkyvrz5 z>g%WJ%;(dK*N~4S$M!1TyKhuu;h`$n^xj;NpyZD?`?pw>1wnGj!-c)>KWnM=}E2`4=L;8ZOFG*K?!Ba8t3y1 zZ-BA>r~Uyu2j8^9puDH$Ix#c3X^~O+!H8zll>Ofc@)UyZJF~R?eRcYNZi~kR=tLzu zYiKp29L~s%AoS!Ey!0X)9I8T^8T7w7;-kUMA>C36dw-Y|NQZ*~ru`%d=jol8GEz8X z;yn2PNaBIfCaFXT&s7&b^*0WO?8uYupu(d_)j~Wgq3A%a`#7J8>$N0lp@65E0T2ic ztCNF}tM8%wG$kV`HMG>F+x$=-aMF*+iVJbZs*wP55XJU^*nMf+7!t(fLCVG@F|f$Q zZJpAVAxs6Z;QQHH5H3^4$<80g3!W1Ga(YiFBgyD@tBZkm>$tLIY2&0k;XOj@Tt1GQ zeAzZ6QWSC7Hwg%;sZbtbkwZoVCeu*;J9kn5%%BgNvcF1VL$7)`B9$@8A5&l(uQ(!c zh;^K6lMwq+_5%b+-e*+#zXkM+|IYzE0}DM9)BhIHH>pa;8nr@yf_~xd5cgq-@kSyM z%a4!mU^z;}!R7)P`hkehvFKGnPxZP;Ux*{AS5a86{uZ8_o^LJ+ zZ|oGsMAMghpN)h`M21!Tc4jAI#A`G!T^$O)>zw@CRDRZ&xP|toL5{qjA<4##UNGw1 z*s1C~tn$_Md8w`KeS2HX^>KTD9F*nt`FWUp1`FcRi)EQe`>MRU?Dctn3&s6u^nQKb zw9U!!asQr_&FwkesBPIbJjT5{RbVk{O5V2mxEX$-r|{7hei{3I3wR)15H7KoT5z3{Q&`Wx@J;1{4HezE^ z4MCK1BZ{A;6(LNz!rY!kj^<}39VzkKwovE;h-wlOf z?Yw{<+enPFYZKP?QuhO=(%)5TY(~F_>Y7@phr$qqa*?N7MCj#qSduYv7pDpXtqSP8 zU^|#2RsDMeX%Hn6*YuP6KgBoD#b9n5Rq-AVF%qg%KpuU}W7*^ShB(-QI%2M%sHy1V z(4+Bs;RU~y&z-K};?)+P5kgB@X%=l((I+U5vI%9s!2tL)zY5>jg&Bz7^E$yCQlu=L zJ>N9En(6Jw0HMr6)4+Y6;L0UYjohGqp{P|%zx}^Xu_?oKZw7a#0+ba1Ye!%{0IC=k z`(Zf+CLkFeV_R`lc=RkKkq}{2ILhW@6%{@!E*rmp2W{zIej%byaDe8IuQk*;#B_zY zVqK^#u#=~ISbH8cEQh~E&=k0b6P6p}Ce}qsVq1vIVc~KPih5d!x9&I?A^v~2z?c*Q z%Kk8{3fFh7CYU*1Pd^~_oe&!>hZZoMN=0qNv9TJ1!e3o_h;0jI(=kq1+tFFFYayPs;wo89#NKR@!%{(iArj;hun;LgYSWa% zpg&V!+fsT~85bN&Rmk#YB;*^nr9$KchZg{8ZNlq7iPAHjKbtgBQ(=2LC=-3sKM>RFy#~p4jN~jv=dqLP~wTkG}{pnAc?7t z`-E^H?@2gYS1-MYl`=bP*HeCX#Ve{`5BztD4En zI0xL)e*)l>y$Fj?0=hC!3hgN3%`cR{^CO8)h6iu)_U!h3#6QHE?of2iID=^9^_l>G zSA-lrJuCaMU5wLgd$hp$6)q;X)?Ar~E7N7v3Amjr1-Lz9m{z6?n4b-hP2rqiw_gJiw z7=YGcU+Kt}$3KR>JvU;^E<*J+<{T?Tv2*H%$Y_0uLAb_2u04SK(MU8?8Vc+T0ub|s z#mawmTX!Ap1ol#>Z6}qV;NC6JfAaXAO>dF(a&%4 za_iFQYqEE(7w~2?s5%l*z=}^b0!bCOO0MMxPL^d{CkecA(A4?}awL0SQSdvBBmSx~ zevW-Bp10WmkKhNuQ?jD?+m6Rv_ae}>99Mw#8}m&sX`XZyis>+24_@qtC9eOR2kbf| z#36uCg`bOxl*$cCjhykCfRC}w@8&%~P=x47MzU@MQ;xW2a(xkJ)T{i+Or$Ajz=-sp zfnxa6U^Dt@4^~AVaZ6WNQgvT!&S&&%u7=pYxK%;PeOfLWyL&v9dTu&hn6hS588tnc zYDoX2b|Z3BYTnco`Mc3>b-0=+#o9cdxygFn6>_M>jlNqV8__F+Zud_a@pml(9Ih`W zVHXU-PlM~~ZPxB1*|&OON#h&N?3JNhpuD(+k3vc?piD-?2gQ?M!Kcq<>JC<~NZ3L; zWI2`;6Z6yQU5Y=s=fqZk>zJ8G#ygqgm72m7FOSuo#`1yZ`nLAfVm;$Me_-?gt)EZ4 zB&hl*0RiVZQcqT%>#@tz+j}{(eH=^Hv3>@ga4sqY*a`X*)PPxViNe<%DeZDHL9+^t zo&PzLqG&>ZR1$tzCj+YS!AD-t+f#6_7hg~9G{?g`#Q_yqCyv2MA_bU`yj#}8Z6DVN z1fKqQW`X4~@q}uyBRA@VOdYCbm+FGe1%oACa(jC6Pm4iWQP*`2! zuI(92)L@RVM_Wcly{984Rv8<>22It%WOd|*Bzb2{xn2#giJ6x*}BsQpOycCzKZfXU6eO8X{ zodTzAmNo3^MdGFzX`$l7lzsVnlCMr58()yG|5|met>;f@g6u4Se^*xaX5#mkd+YKr zHLp_8Viu}d-P{wuFkI3PIHm_wiVMsBFfXV^LF9Lu;;?rXxxP5P zvL=azIS=dFjx6&q4YYS;86Bcj+3THk&f4&-KR8!GK*E? z?h}A~9_=`HuAnj6VZkK()Z3$;QOV0_{lQKbjid~j;uPZp6M?Cwq7+qyFLb3?H=clR zBPJZ1o83(UjsA=A+_^IVeDFFYpeWX(Kw+S{A9V z=VZQunQoYLGCQTxBM2XGr~APzLPBc!a+#XUG$y?K*la9UqzC=csnvm(zR54&tM0<^ z^`6tr(%EYF4=d;A_v?$tcLmjzFI9IwMaCN6AljT+fn)UzQEnTd^&#}_Vj zvcI{r<$uPX3VukoNuHk1uRjM~D;K@1!Gm{$`XYa(;Ypmwuu3o3S#;q&uC?H@>AK|L zMok+Zodut-N*Aa7qW3M1ccE(EFRyL~ZP2QN>~UT|?&;#vSSm>i;oAd9#McW|fdrw1 z-PkF?zXTwJUcfDL4?Vk^i$1TI^*Mvt#NipdvpibBNc>yw5lySXN`0`;nfmtp4Lw&+nbrsL1VNsvh~+QMdv z*RihZS+SiW35qfLOm*V|FC5x;O%`uvSEBhg*$DUy?>olE(i;>(X&X&EPiv;nZ^2k) z$&)v6fXX{WJ42LeVCfo*urCOs3MKt@jbeVO0w-_jlPivWM$3vL z2UiN@j09J%Ef%(|E#IaoJVkMi6o2Ug$h-w=E|JvyU6yvfO$xav5hF~uMXD*;z_D4a z=LG=+a)G&(O;z42IAw)$i4|rh)bpA%?^Mu`*=mZJ#(eUiMshb4u5z693a@T~82Wk( zGrF1i8F)s~@j3^XMSJG`R)%Xmwq8<40YE3zoFWCV0r;h5VevSfptcC$G>!EpoKTu% zE$WGY)A8sZ)2*?fqJ=~|kY$?9k`lsDLovgEJTbM)qRX-691Lm*HOKSU3e59@;}|s} z(~Pa?i$!ZeMTSDQLu=a;l|Mx7TMT-?1-Bq*iPl2XkfJle8CCav$M)unOHNyO-2u`X zCYC51iv0?HDN1!&%x9C3f4#`E!RXbF{a2+oLr4Uv9*eldMe`{k>7@imr+Ywl ze_PzB&&tf(>+>)s>;uS!J%3WtAu zmD9!&ok9{RT29-DTM)h27%6;;mPjdCaFv!h^IXb|wbm#CkldW_QS;D!q>ujMPPW&K ziN>$5NHkVpyg1T!Tx8Gr@UAyD3M0R8`xA`8u^-*QpJo)Lxw)#4Bs4}S$i(=pmIcGD z)xy$Af7}3L6<<$0N`E@SpBOJ%KyUL8BtB#r;=pNXt)30r4b7mqu+pxgm~jWVN4&I% zLdboHuAT(I7}If}Lu!kj1=~vB-m$J>Q2ZwKQu-F!IIJG^39Z;}_vZ4b%pOX{O7SeF zAEIBe)$q~XDD+VY6mFizo1v_k(0Ilk7L${`tDKO%i^qKR$mq6OhX4NNH75TImB(l2 zha?}|V7Qi1{JA~rx>G(9T>n5UZV7Hbu4(bwd+7iP0L)gUGO_Y_-Ok6+!KMC)nTG2; zPsHu;C-MQkak9&8QN>O(FG5V3Ca7IIuCn%O!|*-X8431c?D=``tILD!zRvsZ+E!hc z%ZA%D$-?EV5Bl=P{?33N9$r3&9uXzUbb_U+qLbR~S@_OQ(Icqfa5ARb7lo!iy8l`Z zb^I@-ur78*>IuaG2~)4}XKa9RPfyi0 zBip~p8gIZY#8XiLdsa&ANnFy&@SKGeh>X~y!7R2@7CU_%K7@fe44)Uz4p0!KD(cZz!G_6!8vV)k9)y2*UcdPFw7q=(RO|y|i@K-t zlpN@*tMg0DSe-`Ir$=JO9y2<7`b1XJ8ee-raMh# zycDrT0^7|@;6lAUFEja=u9ZxIjL&5;tRm4Crr}Xa8#SiM#TjDZ*en}S?kL(s1#pFGUYz#JN~Wz-QN*A+yTdCvvnlp2{1Q5>cvc9wxx ziqO7*VOhigFa!Uo;Vkg@pyUji(G+ig?M35IwYPo3Rsq(SNm&nTs&FtISjOjN$)0kO zETtHQY@klgtCiBlR)dgxRP;RM9k+8%Ay1_>hAD=fV0R2b- zAvxq4l%6(^7Zx$8zF%LYmAE5+%o^HM1Y!;jE;gII-p>}GB!34fI{^a=b01Q5R%Ljd zP^V6MR`isLf6stliN%iro(kWvLsZ8%lu1be ztHMJpvw&3q20z#~u=Ev^W_%kk6~Yd2?@uToVz(m(ftVU-uQRuZ{38}^pE0Pad-k{Z+8@SvWTr6gzIA!DLiTojQ2f@wLW z*9`o#SXLqk4rV$~IS*b|GfShJ>X%Y+TAiMwu2{NVK+w=?!9W5>O!1zroNZP@jN*Mx)VMndsej#ml3{<-|{*+Jtf&u<7i|@T$HkEMO7lB zf7C1Qm2qw5raZ_z=`Cj#$T&y{_YWif78a3?-yT7{9%ui}tOoN3+GH3MmHP9l>8!4+ zvvRX(Z}f9)(Am04S*&_PRdJ$ujL(X&m+mkCaXGH8BMXfM+CbB;=rkO(|F#Fv-VGY~ zR4++x6kYr5G6K-7!Qqm}wrb5vC!qTyj#6mxllD?}W_Js6zFOw5SrqS}3 zOeNgg9Pe68S~F<5?Ad{MkBgP(nimHr!HBOesk(mvK)kEa*W!~LQQ}4eR&r24v>ELt zq?J@0l~t+9ZiXy1oJ~U66B17^>#5^z6BCIldd6li?Fkh=*Q|^6u|4WOhcp&=)ylHo zv+FDr?As13+w0zxSM0@5*ByXyy}9l+BK$#2GHLnQi2N3%rI(jztX~g!5Fl=++8}i= z&{t1sWH26Wz?igdPl7%|7Bk%wSJYvY6g5_KsKE?}9qzKragx5B2cDpDt4{D*TM8?S zrMW>*8X2$bsSNwh7yTGjW1eyVAjrJl+mlvnG=XbNa%-Y#Xb@lMvp$@@Jbi*OxL-ju zYh7hP!`f0f1amd-kD3G$-1N9X9Xni2N;x1JyT>caWbkf%`Y3n*#NfhlkSf{C^(or4 zb+=^f!H~2-39e5gI=z<&NXkn$YVi4`e+jkBKIBROm$FhbnANj0{BkLCD;kbO09V$j z{mBUxMnr&igbyLu6B z2GT%|q{M9Cxpc~KI{#2jwW62y9X&fIA<_$75J7J({tHx2UN>FASZ%IEajd6ZoEvo| zwcgcPY_-r{J-9mc7{H8JGBRN-`YuZeBQY=#5|2 zFaz~P#%F1XRVruAx#=)`W}5S!_4O^d`@=ZvZW!AD*kxDf>X;Y29hh2QP5A9BN4Am- zO)^)@bz}7nM*XFo*{%K8(+qcu^~xZJ&($cw*?a4R*cDb`gO`EPVrl%wd?&BT!#|oc zTam+9d$|cfz%guzQJ9VVY`=J;g0grInCL-&x1L^vOoh0~5dMy-RgSQwj@g^Tmh-h#k>tqn7Nx{$ zva4QXY!6&>C-jAx-LrB88&Xoi?AgR#6`dznC^xqYX(Z!b5yP!)_~1gdUzIe88O zRE0y7`md9t7%_!+MsxUHoVyT)+fcr5BC&<))*h1Ve=K~&6z1gcD+x|XskC9jo002xJv5ckjV{vT6;pv>I{aenP+P(8F!ybiOPz}Tlj}ft0 zgDL2$b9VevHILLryioJga34LhS~o9D$*#+8NM`wDQfkdUy0Hp1e$WhmjDqS!mS8PCWEB{aJex!N!qA4JUbc#N8ekZcK5X^{fA)(zdq)!;Kak~s(hAJ5 zg2X7??|}m!fh(V*C3QYSTEqBmYcfma0>o=G~uF=i@4x_Igjl#ivkYU-cI`*$!xGLqKd-yy%^xTWMdj83`x4vuhjT0jWLdC>ojW5v8N@xHS1am z=dGtGbU2;M9&n_unWLxfKKdg;)XqTfs#CC@95-z#yhM;kn_J}*` z9Wk2uA0PNF~Iz`jm zxWvKbRRJoF1{rYDJzNYC3}hp7$<sb9n>>We@js zsi=ey%Dxfr9DojamXy%Um)avPmeGIcOse`Fj0Gi)zRsGHy!6{X>zRi>Xk_w|nQ{2~ z%+9XvPe(|cuhB}RT~Bx$g^G6pj9Su!8JVL2e3f(X!b%q$2he}iUFNYz!_U-q3L3AD zWWoqIDd-D4yh57_KTr*`A0e~L0NR>Rl3?U<9zuBbHhYCM9l#eCFf!O5-^asF+7y&lx{CxgzQ@4fetn2Aa!nk>pQ-f@ zZ1>nk%Tb&xDI_ZkTvJfW^W<=nAhr5R#0U<4KcSWC-KyQ+W4wKihgFwdY~gL&8qxg} zc&Xy%nw>x;J=(dgD>U(0euvrmU!Cqr2neKFN;N$N1PJ*3&DjlA$~k-n^j9V}l-1vyG-C)z2v?PW;TY2-hz>GXZ<(rbQR77NXF&%6s`%XQWO^J4EKL!nq zzj?`xVYB#|;J?-3av4Z=Wp@^}CwUKrRxnGxP-`_7S9$tnlZCsv?0SbRuR3^N%Q zzO$!=Ebn_y6DK@iy2@Tulrc%D*QF;4`>vNA+}`JdpHcHiRMBY558nq>2eVEO&!^(C z`@aPxa+-|tc7vh{Wiwfp+u};T-D9c~747mV!4{FjTl&%=#5tA57dKQy+cXlaeG8Sd z(y@H5RqM8w*X5BC2)l30DM)65vW`{AuIdJ(&)PUN-1wDq9yM-BSMMSPjRh70gy89ibrIN$Rhu;b8C4xIPg&lA_Iq$_%>jg2 zGJU|qVO9zJT|n5{I|gPWO-C8O(oD*d4Ag9 zY2OKwuifxAOX6}6oZkuh3=E^Xt`#)2)zo23Xb;VA=Q1Z{1l;m|mYwE#Ycjlh9i7=9 zkup->lE6zmAU}4P1AUzsSfmaqdbMvA9XS@h&$W}|inff)sJc21sjZb)1Wlby)6KD* zA3A8kccU@T5Ibc5ITJnCgIN2+R5i$$mx?eBXFPXB`0=A~S?Aar%eeNucm`3G8DxEW ze^yw-b*$4>QbBhim-HZ~b13J@#Kwa^gDld7e%``a!)P!@VeqI#kGjJw+hyy)=udb^ z7`ZgwQaM`3-Nw6JOpWhPfbxY-x^L{5fWE`@b~vl+%_E=VdGQ2PG^NI^dEA zhuI8u-VBv@t(3oqo3PoAGsy?qynR&OSp(1B>6@$09JDQRv@ZaBTADYKxlupgjzTSa zD?-K>#4M_t9IqweQ8XG1Zi!v6MbuOUVi+|uh^V4N5?Niym`8Rca7Fjl`6R*^L#LV= z+KdExj2&YV!R29rJW%FwR_sQFEE_E5Jw~v{P7yzZF z4wLlve#Jdrd*3Nhn~{sPhmCUmrTlw;wlMjs4$D_nO-Uc2=$b;4ba0ycRwZD zCVP+1{cX{%^GyJu-cr|<+XOJ{J&qOGTAX7v2({kB^g&?JEsC1}#&0HY?U^r-HvNOk zq+E^V5bkdAsh#m_mJO+~sf7Vp^qi#E15pxU4F8i5YJMAr2$^g&y|}1i62W=n|V=RN<}ggR?MqwvRTm1{@(X}>eflUoCmUAxeC&? zn}v3!up&G!%?kmbCv8P-n+cJb=b6UPJHKhxk=Z)nLEo(-b!;M}qM@2&8AY0^v5AC02xF-aRSIK!+ca>d%aHGO%~W~Z z4lIaNGb9VpVxre*=VB2NiWl+pz-76m1-rYR8JRb@6K=`Hu19W=zFHsTlgkODJN*rV z2cK&9aio!}Z82=D2QA60eJ{?{2l#TJNNBACpQ=6U)$b38J?+&!Y2_|yJjti;b6dPb zaJlGU&eUIH1&@}7lo+Fp1YRtwLJ56T<3gy{lj7J+Cv9y7rXJAX?(D_JA6;>K8UCO)F zU|X?2*J%S)SUEFnS|xAQAKjWq9;)jR{=wOH^+)S9r;+-F#=5en9@`~TV04+6ZGg?{ zkr88j7^QZQOm(_fIZ}Ala){tkvJ?_cFQ*|cnQKQ3N9d)q8U-iT0?<)ed{4*{iY<=?1ld2h0!^b!_1y=WbY{T4-e<*gB2ejiKK=FFD z&yvHyRc3IbwNl~@dRJeHe)oq_fzVT&>7dk5CI?vAu3V6Q0Nj^AtO+~<6ZK1oeMGBTN#o%RY;j7JuffU*in@;_A4( z9{np)kYHROgLA;2%b<8(?LHVH?NHbKYOqRIWDE|{d^OAg&HpshN{(QRq8MvlhJX2F z;zDY@4}9TapqHef2*a!?npDoA?QQl+rqy7EPCSp}Xu?^rvKELYXMtA)@0_35vl ze)W&veD%}MfB5d(pTGO@hi`uR@9VdOzIc;Lx@fmAU%&aw&p&%h#{@@^}3A>3UtSzyI^o{rcj|*Wdp}griDZxk}gLd`}EC1;CpFzzp7! zGg$|aoD}+rCMY5@fD;R=EYk-bfv>tzBODhNIWbm+sIvV=> zaaO#UA-EjAa~89zT6HUBvaAqcPhLwq_lvXHk4?xb#OQh?c^s?~i2>OWTB{$mGs*{F z&yT|>#WF~#)Vsd4`nx|_1wUh8WP9-ad6^>Sih@R1@2rXtjMmzRxMF}*v8B(?FYCo+ zssazY@4z3curS9FG%^_Up~+p_Bw2wr15x~j zoF8z54&*0roLTITY~@J!i#Jl=Dir~wE51fSF8qn=YBp*cja~X76~t1_fU@w2MFn-^ z%dYBZM;lEyeQO8iwIhV0u->9_y-Mh#9!>Rzg;>ssO`g~_2|onZub7ZG-_n-iAT>vU zxs0!;`bCA;sNB0heygaC<>zGEPhKRsIg#O>G%QAJzG^S113Qlf0t&>F2BS9Z8=?p$yPw1RB|HpdS>uQoy zQS=G=9d3d|@}cs-9imAQL`Y-=gCJpsi1%l$?Ybf$B^Y(L=PQ@%_?*4h4z-A~%AOrK zoaJyCHH1FDK2hP7$7o5v=|kI1zODp{Q4N~YYI$`=0sW{NK`#u-#{?e+fYzRtq}^DC z9G=NBLgeP1p1G|r-!4To@zjkizaxkmhN3cPela63Zi^u14+mqZtk}>Cu~qkZYOcNu z&AhIi3!U@_h|wKJDCgWR!laHLewwD?iWBf*T*fMwr0WITk8|#~xc6hU`aqF0n!@Xc z?5`f~@|3r&(7}`IIqm(fbfHtd%%rJ?mi9qo+S|sI>^Yppi#}Bc!#m=a8U7X&SebY= zn-i7q8>Ni9NeACQZ>GGEP$S+{1a@z1K_k*=u_QR$?{zl_1y5HczI;Y*00F*Z7p43q_v# z{grq9NlaYX2$nh-tt|omoYy_gYhY~%uO6z^cV#1^SqbL5QKF8|vGxFqSvxylceXlZ zPT5ktEAzRJ&DriLS$lVy3z_+6mR1`*A2W5vlo#DUQq=6`CAK~`QYar-v`=ZPv@yh3z_1G;p+~_E^s2f>oW}`;0cne)b zL9Yxu`op27+z|>zFB^iF>+xZwfXm_E^UU@N!Gss`69uRSFKjBpl>4i|)$nBC9naN! zh!iyQ#LrWpZ9OPN>sLL#TfJu{hF{*#DD`!vD<303cYUHS?{$l7YsFpyx9RtBBO@X+ zQboEZGZfj$)N542kI$_maa1>-_on%4M!YfE>vbV`y2Te;HD>ZHe1R*d;~rNXQB~{* zN9FLgm}RQAkBpOInA7bj2`2L?3NeT~n8Vb(xb$42YCEPYQ>DLk8&_(S*pe0)m9f88n#)lKg0*vGqQ@<=L#Exy+5O zU*$AOm)fW6VsRYDOgB^chWo?Q;I4V~a0g zq`cLS>X1;!mtEr#<)H?#TijEG$ui4ek;XSfG1-%0DB`Bz&C`g<{xT>UF;vZ3lt}z# zMb%vbTbIg2uD#0IL{wbmS?zj!{(=+)m48m`yDdU9nADh_^!1ojq^(uDFIOVHPh2AUW6uBTcv)R-yVh}+Rfhn zna2b;YzTWo6c~K&mU&TUQ5i&Vw#$_I3cc$i%zv$PJKHb~Y0XQz0!kyDimf8`8SmbhSL@*M( z`s&&lUDsx!K@okyaCBlB1JqraiZd-MF$Ee&^^Qt(*XxK%rrK)u@y{Krqc_@l*zjBw z!c1&8`i>QJo!c?yXdr!9uT`UE zH)%r`bsWT3s-YJOMReyX%kvCg+|^2~tusmUxoU-SM=Gb8j`YFL=u)L~uFE0QH*@q= zE>gB6iSe~`9PEJZ8S>FjKbF#vE~Vrs9KC#E`dm_2^ z5{xRsLOm(GTJ^csPMwR>85ReF1?M zzN(irvkLXi*z}C~GO2ElOYO~0Y(9m{56Xa;1K@R}*|?ca^w@3Dc{i{P+FauDBkAoz$DMqE+> zb}d2qi&wxza*NOL^XbRXSxZZl-Jy6@8d9}LEUY43BHLjWL6uA1wg@fT%#^OoCvv|m z)5uC`0X_z6B|5p+-0c!x_&eF*@ebg-rzGD9)UH5`>^R?8Qo5Z(sbR-z=Cf+4>V zBC6JYmfQ81hG(j8YjRwgp4*%TQb~L{%PV)z$@iGf2Hv8!=j*2Br50ohdyKvD`*hEw zSyB~rEObTyipH_f5ag~agUb0xu2*fp?AC#zyJw%kJq{GgL2@` zA|80o$w4EOEJ-7$Cnbh0K8B1=FQ+o1{dpGy_b!polxQ?9jpEWV8f0m$DMQ@Ud5;3M zw0d7bu(~VE>pe$Rx?JHaN*?5FiKgzh_pZ0DbG+~DtYvAQUGEZ)pZC#u5~^6liObhN zvzR!NZ%u?qnR34+rN6a|-KB8!<#;Q;&6Fwd<-?{?tlYt=@-Qns+~rN(_H_*$X!kxD z)%@xd@=UJ$q1#;nLu(oX|NOpTpjWxwCaRT+bw)Hwo;$P=6Vz

Wa6-MXXo1;R2NW z2n31&O+F(JTJ6%Nw#spx!@jK}(;~(2+snvmSppoRbvc@;TRSM^Y+^hovzdtLOrvu< zGtK!_haT#R7Vwp6rRhvtOn#mqsfHD6p{k&w^cFe;Ud~8Q3a4a&P-|Y6XEu5yYeThH z#F|l*zdWa1sVg<1)V2FQ3;=m3(X7$tO%JxzySYq=Z0dOD}@6r`B9+ z9{zufZ_MO6(8UTer0s3_)R2qD?mG^}dm9EbDx;LR6uLHRJ;hu5v%BpeqWgsEgknK(*X+d`u_k^8jRP+EI#ordtOr0dy zHD+q|gBBNJNS}IMD-ReRvITb6WJ{Xe+^&;U$#sF$$^>jKnkVIaK?#F{AKez5rO>=7 zixS5w3f?Gn;G?vp-j!AM6dlY(+lpWF?z4CpwJtVGf=VwFPR7rL4?GSJDD+UZCTi%| z?J1oqRXRgbsNKBGW}2anG?0bVS=u5e1104Fl*A~)uxd-ilPT5(o=uTa~2nE;eGlrZFjLCzz6gz9Ci{+#4AOz$+Vv*FzIx zgR}HIb)B@%D28=wx0*b)z>eA=Q zC?sGP)!bg?nR!jfPD@MSg4>6Mx-azo;d7D{s?<4uB4yoz4LLhH+C-FvM$<_Zdp41k zqih_!^XOEUSFNV|F#B|n&^=9uS~yiZ*WHDN)l)IM`R0`!IrbH5^u?~K(nZYJJPUbC z8p*wiN}_sItuBRPFCIxcbVi1g?U7mFX0INbq(Rv_P1_|u@&5TBzq)=r|MBj4zB@hKJpO(A14EYwL2~3+UTjx?IX~V#{IFfVdUbs~KHa}Lop1E) zi|zMo^5e~#^vVCm?dr|#%?Cdr&8nXcy!>)v`t0e*3H{8&`LlMAcyLV3?*zM`Z+mGLWd-wMI{+q|sySop!*AK_{r^k->f!wF zC%w77zrFw4?c?p+Z_ckzPY>rcJ#1I6PNxsQX#UOl{p$~>k57-c>m4uo?;>nr`|j;U z+b&;h-+jx7i$HzM1%n%?#Jxu;=K%E-|4}q2QCC=mB@`>H zsRk->ITf9&K1A*jFR3LwfGul^+@vS<9D+(W4|Rz|imqwG0Yk9t#`-~5`$I^o9aCm% zMuMJt0HYKT5H=b6P1px3BF@r~%woO4ldz+=tSpNDW2 zFd{n?!&g*?i$-S2#VN$BCjYK{Yt3xZNaX-I!l*Je)KV5KckX1yP0#GEDjFI4YB`Nw zB>cE&fVMW8d6~C%#lOSoID6bjoan*!|7q`y}C=EXxl&Y-wzj9 z2pgp!)nBU6`-?*nTjLn?L8bz%)Ji&7_{hcqDhG<%#1^nna^?c~QWi|oWqJ`6IvYAK z3JIhfEXncZ^+mUbRvEs@IXcE<8-DEW|Cu2Xeq-x$hy;F%Y4}T$9bwNgHNT-k_*(|U z5{Nm4kJ*L~B@;w85rF<83IwJ^({QbrLjI5Dz|@F>FoeDd;vY##10m^R#6i6XWy|0| ze(wb7YGoD?5&e3No6$1V3i$k6{5%6swLd+w2QOP?92g zKIAOj&?G5?qQN2a$-sN2!j1A>sY?r#QF~OpVzcboq*J`7HGo$LV-OnK^ZXwDK%_G56e(QE4tY6Qe#W?qfx44-cclxba zOqQQR8AlbQ)64_MD75M^lvd2ceZe9gp}dkuD6{p<$ZJ|&`Ynayoq7A(W21$odRDWj zQb>N49!Cc?vJOhhIJ?ohsOY45T?egc9ERDJ0gAnOWZf+zHn!u1#`Z|dtD=xnBkK%A zY4QfD>$%*uO3A4RkAbM@r<+QGIj#=EOTOSP4$dpgw4kzJBfeh= zL334LyV0&WlM|pyCr&j^lZVOSDX&geVgw7!+HQJgS^@&|ql=fPN=){&Dc+}=`w%=R z=0)8J231mCS=JJvv?Ckgj|Uy$r1&RCo2Gh4sZ<2OVx0gpr(K-@@!2pW395YAK5p3D zxFCG2G#VaWLzxapIXTF2>MV5yB)SZVj4PQOWXqBJrG4g59>vBHH%Uej2{-ACf+k(q zO%G8bOD$GK6fRIWM4#y(s!E@jLD^;{0!oDy5x;1S%5`!pBl~=wGZiP!11fdJ5RgO( zN!L?_K8_U95T%w-eb!-z9)%6GS#hlvYjA1QH_@X=V_0olrNB*u?w~UR4{+uVzDgcJ zQH1?)sj`Jho3Hqi?I#>b6RaI9dku}oLVQ9MA5c~r*-d#+W>JjrGL2$7lrDmXGD%BZvx4N=cc>Jjee*N2Jl97KkWwieg%J^v%KnkR@hn9brR&XTq^EjqSA)4Rl_;2&@d@& zP03RSEiH|&{?x~@J6cS)w6dK>bl-<%21lE?fnOr3_En3A6TA0N zfIu~rY&97Ifnxc`rl8-r_|SlbLJEa!Mhu6cB4ItGxgO3!Q~?swVO+fAACD5R)iOa~>Z+ z6s53y0g%))Vajq9bRi9Wsid$bDN!MQtcJPl9+_@DON#_CcoQU0tg>+l{Bi9Eok zzECE_1(`nE8@~ZCt%=^sEqTP92bx#;0dGiIg2MG6T9J*&lx@n!R;+?1lLqOmIbQ(4odT+h&+>>g?-{{5 zUmpGWa&%H{C=PbP1uPc;lMJ~GmaEd?`e96boPjI_)}*%1fg!jpo8*@64!Z*bS!CfS znn+2LSh*qtL!BZf0wsT?LId06kQ)TZGG;7$W^(vr1hlAD@T{oX#NksII07X;L=TP> zW6yJ($Q1tYJLoR>Es5Y$`XINFr>aIf4vQ6Ms{XX`nBN>$)$b5T)9=t+XMDO9MZT~| ze5gM4A<9DWYU~Bd?-0$4jHFzBjgA5QhOeftRkf?D%9J?26R*TuG=s#lbxJIEU#9zu z-@Q<;{2oIy=s%(VQLBnN^S&1)zq89-;jzyCQQ`n>b9LsC_JTOp}7Nf;Ab z-M3tzdV_4EZ`}XL;JL4XZ%fVPa8sw2jSylNX5CH!02Ag}Gb-VpJx9@7k z%G$Q@O#98K@X+GCMDqQ-= zc+_&qLQknrh!jCR1vjWiU}D*BV9Ok({{WKM3I24U(hqm@I^3yV+$eK>h7&(tUv`v6 zL(-rX1;UCm5eY$y7O;#6M|oueFG^g0^QemI9e7xaxaA!(>)Kx5wxcej!2t! zhH@Q%4j&19ojrMfst0jaGzK6gWUoMMzlIIOMuLS_K*%A#C13DP@4~gr#s=^bE^Ft6 z6O;<+mwc~`AbxdvyIWrR=0xF$sRTVzqrlSzj|*5mbo=Sl;SskV=7+tT_{AUzs^+{! zB3O6wg;;6wvpocV*PNEKR7(rTuYfol9|t7IGZ;tO-&eg{r9f*a46YY*ZW#pS#Z@gF zXmUgXXdgu`XYPET&z7x8;;Nb8?9;AlSr@C&5*2UtiS{8=1}3;1b=3B}a;cV*MZgxk zW~lYp-segjb-{T9Nf!aC(4)hO=TywaCo0)gRF#$86=1|>o)j_tI>kKmBkf{y6yZ_b z!J@;Y`0{y@*?Oo6w$GQP@}}gjGw*aD)1A;dErEQ_&y$9C5yI)}%GK{q=iERUYkmGE zMt}bkZt{OPEcS?4Xqpoy{rW6U4G=2D(r#Y?=phLdbtzFP$x#YZx98d)I(QtIs`cxQ z7+@f4*}2KLdF}rqY-5Fzw$8=<9 z%_*FM6r!b&)f9zu+}_P922BQ}M_awJDrhWu?x#gxTw+%Vue;T82kC+ahNF~#b6z2X zObADGasZyrQ_nwR$^K$f)?aN(Z&yt@f4D}=_3ibl;KWoTUviG4eBau`$Ya)8BJ^4Y ztATRx=a<~Tmp1q|lP!^&x7*8eM!IC{GBEp;`&I_Th8{r)Yux6{y!B_aH*)4X$L-N% zB-U$;PSDRU?Vd+Uk$ulZfoj(2IL5t;{O&(+^Su8YZ&$<|O;1GZzP^Q~>K;K%l^X3~ zbOO5+<&3bf72=7cy>mUySNCBNFonw<6-;s`Tm+4DzTy3N8=nTndHUJ3-*;#Unonoa2uS#w$gqpK_P2{9OG$R>dRVt&ufhpUr;Cc=PV>LR-dMRQC7EkrMy@ zr5Bju6d{h{(dOzqzdQLc5Yvz~G9+u(s}xLv+0BjTO%vnTl9gbUc{|Bur?=}}QzqSK zYEQj~i;Oq@nhrPGC52vkgZI2qRCbbT(z@=c1g1M8H;(udOq;e8gJ(0~SLcUz+3Ei+ zWud}osZr-`sZnBF5tR{W-{i2#TY1&KeAW%%R(5(fDv>qXR&imz7Qz08oH78RQv7>$-NimNa59cjIsIJP7id(Ug<(?$-$nYNG4@s5h*{o& zI@aI{Fw{PecajufYp&9S+u5un*o zStZOChSgkzG3l3*Jbbx$(f?T!M+)Os*Zq5Oyl9mid^z})(lBtdDRP{DoaqC zcn|^?yN5HxIhVDnSH(T8WszJEn4(YR7zl6eb6M>XsbkoLnaRA?+zGx9OMc6Gj^IU>HPk+g`1aA4;$d!u1s35(u2U2&IEkY&G?V|l$VD@jURlr2}YEl zwKg(ai||tSLida757}2P80%r3XAtpLd>h$z-6r_rr~Bne*Fj`8Z|SCvUuOX3yc(7p zBif&HRs45}K0U(zQ55G?3>C67Z!sl1_n-2;5ej)z6d=6oR#P|8H@(VnM0jZ>vu(GQ z6W~kuHq92;yXSn1hJv4E<~G&Vv1+Gya9u#QBNsIW37s93MltcPhvc87n5Fhxm0zCc z)fK$cM=p1?ZgRQ(KrTKJtz0bzYU;K7lM z&0>u}AQJ6FqN9xYjha5GMYSP);U>9jy82ziFzi${?!nJGV=4T@lcR@CwK&Nf^&YO2 zW#6H%A2M@PD+UmQurXVE5vgO>`;}xNRP(iKMNyNNCe@Wt&XFFgf$}56joXRyUpup{ zGvSTY^9n!(w%Wm(U$x{xN*b~JOgG6U=~SkaJo_>LhaU;R;;y2xF4PoEU>VU}OvN7H zts&&Ln8i?RwPQXNY2%6E_VezDAkKU6!9qG1D)i4#2WI=^N zy!;H`v^IX`9d~zw&j{)Xt!h5A8$FmNDDeQ&8Z7f7%rhKn3%EyWs%4$+mbt!-Tj!d$ z8!`j8k(AE2YcO~{4F_=T+gqCYS>5`7Y7AtHf|1mq=xtb;!cZ81S;MzCC=&BnBeKt+#Zez3ekba)K^& zm$R?a@0QI~Og`uXn5_$rmqQb4`T}N-)OAgtat|RtynZ!dt2)*BWPwfT-T=vA%^oR*+5)W@q;! zTB8R;N{+6lLD;s;5v@}b@``K>9$UvWQ~3wG@hAFBudu|mu6-e++DtoR2Z;o~jZ+9I z1Y0sJyQ)hHx~tt@JXX;fC+pWksrPU*d6nqCR?#}*TbpOz<|glML+#)q%Qa6k;IJ39 z3hlkMN6sM3QP1$?%PbykUCt1dl8(qJYvus2)N6?eXFzfcM4Cj-&JV|@5zuEkHSNMM(*AqTF5D1l8|d3PODZ4!+w;&H4?vmNSIbB%OZ zf4ABWb>~|C9B;d$@c*A~+E*LBr?0-^-;Yo3YB@|3Si(hLMQANtf{?C>v}alc6JUb# z3|7J@E`T8&YEdFP=vs}S&#Ee+JsIXuhz7y{@S!w9uH01t5>}(Aa)(P0W$o5!qhyc! zR_5IRRjaXwKb^}iDw})`2ih~00A>~OD)2a{R3|k%wESHSs{v|oS#8f<+1j@4%P2&fnw)Ed26Gu`1*hS{n>)9BXh(X&4&s=(rehVj*uHr$r6;4F zRELFhuP`PgHHT0wO5)lhv?fOdRzEBmmYejgt^3j(%up{y{o3Xc8_)+C-vo}Z>N!eK z6GmyvY1QtL5uw(bmalolbu6s*bOFmgr&g3EYaJ_Qacby9rKE0Ypt;DOP7$-PVNw&E zRVZ;N2C7fl_E9QhRc;Nf=m%+|Df=`O7Ov4I>TTFot)E{kR(uSZ z1UlBscaeJndxmhGno!HvIPkViX&)^|fTSGr(EAHh}M;>{+`@g#%1@&($l25Qin!%z%b{nwLNVA#b|Ml!B9a@eDyMwDo;X z9K+xmg=(88slEk?v(KiW-0-5PJlEtl&zD-SaZS9~b-Z6UjaJ6F0w%#VVKTjAPqC-l zijfCLDN<7v`;jdYe^Qghp2(G)wlL3C@gwRpEJ~sN#91P}8IaD|wbofeDalO0W13 zuwr((Z1rqm%7T36Ml*1FqzhByECAZK4Vx)syVcL3bEiv)nN-Nx{;MKG&QV44-<0b4&ROsG>&Do4^5WSJUkd468u0Fy{y^?W7x2hA0P?>UMU zATYv;DorQnP?d>s9=+nvVudZ{rfT_&w7vULubU3{t#j-MaH|>x+$mpsGPq@E>^KUl z2UIc8W}YW-_Jlk*dlL09gno_{+~VABMMl6E1tNn~+O-4gH;mMg&R44au7U@J&pV1@ zSB6=_eAG+h*VS7(D921yMSxVC08?M%Et2ioR91}ix_B>^xE{u zxP1BK#sBV-*!<@C+4P$~^X=1b?w`Mm6`Y!O`Sfx~be)VU!Pkwp&#pn0W-@p6$#rv0J^5K{JxBvL|=O5nv z^!1yE7eBwefBO3SpB~=4J=x@RU%YDkMNx9{KF|Hk&FTe^Ms!;^9Q6ve61^b$#g+(?WI8jf@?nE#m|?ag_7C zetkX`qn<>#hdhK#lIQgZfV91%LF#=3sn?kf8}G~o<7iM>1~_+EQ^XcYs6l3|T^iD(&K^p(3vY{Qa*1|7*biINHnspY)Hh1&)e{T{ih?O$Ogn;^Im6IZ^;5ypDx{NLK4rN+jt0w&1A)Md zqIhGBr+To*IG`V^f~?ZeZa`wvz%yWD+WaMR1~gn=#|RAAZYrWe5<7&65tx_ZK{xD$ zM4vdeI#HfZ2vUmY{x9;&UdOKE2*OX`cetUGOU?BB!;!>DfCE8^LxWzeKtU@lK#}k7 z`l=5ld1crzKt@i;J$=udndz>suG*7v-Wi@jU=J}s*W54KTAi=&$hAqyqPF#{?z0E# zYDC={Whrrjl^Rm@$80eLH2SY@v7VlHt9HC6rhk_}s_DmcI=|6yOSW)AC~uHKyUFQO ztSFJLZ%f#sZwutW8&en3b6dymvajObhZI|`klw9COb(o4OM3EL!l$$z)N_|QVFl{1 z`J9qR-R5phpHc=<_vn^wT&vhfk(}$8Lvn*uh*y!{Tuj31Ms|xIWqYdAk499s?I=_* zG`HNWBGD-jE-|QI-)Z#(h)IQeuRXn9t;G=NrP3mF^iZd~5koCkqcAiT!tS#a-rl#kX89PEk zO3w>L$O;ZMF|>m511scc9T`pVgY(rXJmPTaHD(&m+w;efbwzf*apGh*YEr%I&exwp z!~Oe_&slMs+G~{74xoB3Rn3xC!-q76r%h3Vl*4Z7%?g z9i^eAZ{(_+S7S-`aFlJbEIGV-P?griNv>?_N^Qi z2nGFX59KB-+s1Q6CQ1?OEQZG53nHH)7%B}SYX9!u(Ta;a9MMF7`qRf$DYClW)pM=Y z6Kjl~lWJfGPr9ZDt>8#!WuEJ)KJq-p8;YayxsB$R1qV$XBEW(p^&0s`&$-7K^A~c3 zaK4KV?SpX1NgJQ^luAR8K+e$C$i$VELw9iqO{1#$q{m<$K#Q@GdWy-377_wgiLscq z3<@PfQul1yM}z@2Q_9+|+E2z8#qPx`s?h=>#cB&Ss~fZo7e-rl%>`q9n2AGI5ZDBr z!<9Tu1jntUXI%nf6=3(!jGas--k_q*sFFxUt+#BEcvW;FB4gX`Cf-W|fu0K0N6!(P z4LHf5`&6-_0Zdcw;WsMvQQJyFTmARpEfj%U*nvr|$6&CrMH5ZwxvuRGlsVD%L?Ya_ z>nOsC)7{vk6@OvO(XU3Ixne9~%n^=@PqFpwcsdQcokIZ-4Y5;8Bzh zx=IrcMei0HlZ0x@GWi=#JdJlR8L1{FlR&fu;q~cxGwOC%uQkmK^_2cuCPBQI1c6KQ ztOr|zsVHVu=7fO?x2a(QXWGS%3iRFx(1aQb3P__>s}-bQc+tk8MuTS5;R>88|A#_~ zb3J#fYDCn!LeRAGsg}sV8XBvCtVJFwFiK-4gw!13M*j{Gbs!IE0iEAtG^lgQz?eRo z+Nd5?yhh5L5CqoHU27x-hl&&um8`j>Q9$5UIMh?PR^62-Rf&yI-XT!5l}Fj~4J=|n zO<}DvO$+j1=FJp1qEZDUzBCNT`Z&4fyt>4i%!r(VT2M8WVbk6Y*_Ah}%~nBWj^!$f=V5;chJPAic+)q@sQ7VADm3w1Fyg2H&NIC}0JQBG-B9suZ;st88PT84DZO4wM{V z(OfyC(!5c}uiXFyS0<5uIAm9tY*-7Qh0F=JqjSZPnFH*Xgi^=@O+@{wMDvXn6zmSc z`6wX0nTu44DfJJ229h*Z>S^9Nr)Mjwy($uE_;eTt1O^)wnn;ystN6Pi!nx7&v-fPX znLR>C?jS=_7*7s)P7z{G5vc3<9S{4kUueE|Jpo}kgrK4ZalJEWclZTO@dv{BjEdiT z!P~Hf>cn`6fOL9h4E|RM)Cbe~5?|?_T^&Bc>6vw;A{QTC76+p@=wuw5B#vO7AW-|1 z4%+ZvpNGBM3-+$NCBL+m-u5Sj5D_|;$hA=P&7{Ygh>BEo9ZyC}x-?|vGH)x|=W1g-HM`e?dBH$IFzl+Nx!HhFa z*p<_`gu!X`Z~ai$1TgfOuF@?f-34^WEOsNwF=CF+47WX@7-AMTUWZ=I1yEt(N(g*4 zOh8cd9j9yT49yKeU28s~SD_7WD`bsMV9~$Ys9^xYWH}sIn3xCebm-BK&d2k!Myf9U zC!iLvB-vKyTtGxO+2~9;nK1Zj%BU*|y*dfK=76pEh~dojI5ZNfym*O7dOF=vF=_hf zZrwG4H#U)03RE8q-)hs@ppSwwRPnkHuq{HVeLdPhZ7`50^{C&s1T4-K&X=2@b^ER9 zKCz9U4X2M=TkwHpI6wNkGPHWJ~{_gkLMpBfBF00e)#VF+i%`IfB(bNmw%^#*>;svKeei+Ov6^WIt}#bQhoN@FGX+gi63e=`TG%X{mMZqETsdJb;K}XgoU9tlx`Dc+@<835Np#%}^DId}Li^ zzlk32A~-r0UYkR$N5Hm#cV!>%=z^ZkK|FkpB4YX8tL=te*qs4fSQMy|!)f%>&heu; zzDlc(m5M%z$%s~&pAF^ct5>3Fu$3C<{(hq)Uk1?ij_DILZQHh{ZQHhO+qTVVyZ2o; zVlR8CQ(Y^fqAI^kF0o?#hphsO8P!!whNhSoqX^Vm~6*QiPK zp{3)DYNwo_(R7jwUDOy+O=z=17U)h>>w`2T5-AVcgZ^p9+HqcQY|dOw@oVa|s%7tIz9~;xyh$BHWQOkAgz?QULo!H+d$agbACAG#`IAQKmz;M4vHxPFusr216MYpX3EA0rwU__r4|t( z3a$P}`E$P5-7L?Y&L9FI^b&STl2Q%q0sgSbVIOsIbuF-DKE>(8it$MY8bJ*@FgV;P z9$)lO>r)~rz~!N=z#Cm@`FC;9h>zvs3~Pd~^>tuVVa0o2=8HI3BpjSq*mO*mwv>T>^*g@ zRvK6n!Xx+)+(iwlbB^VmYZF{mz|cZ7d%ww+>gDt6JluaSGhsTL?fB&`)vQ&ex;iX@ zwyb&nb=R%6m%5-;k8jX5#YYOdb82|Fx>7I6+-d<{I2;#t&@6=05trB-sjqREDn9ph z&f3u|O0i?`k<%7pg_WDuzgXFL)X&XK?D4RB7CJB3x0<&u2PQk?lqvv77T9s>^zNeY;)PXW|G@SR-2pR~+86~phRwZ}dc4X*InfiHZjtQ3krFs~CX;vH;75mssU zaTE6+W;CXFbtIAAVNr>O8meJ|x2V>ARuh}nr%7V8E)6`6JuPZRs&Nfg0}?X`*9?(b zy5G4~sw%715ApMOwHAe~EhbpRhTyNMvRgjCl?DYngl+9@z}H+}+E%qGLP3v;H&AEs z_zW8z)I~xr$~gtcM%RA7uuMR-z!w4kS8ayv|52M^-{x&(;^Jd>o6i=2$x%S)Wc z<}UQDS*^{e_x0(=+Z9^C?hHl1jh-23J)dja&7sL{*Ru*}7V32ObxSJ3;nzN2d@hCH zPR%ohp^B*D?`gmQ_u4PDeX#4~C)urER&Zytp-s$D_`|HL%R-lKgK#-IUVk=BqXN99 zmg8cX{Et+siq*3_At?WRtxn^M#WIV;juWPRQJ>{sZuq|lQZyulSnM8I-h77|2ttrm z!x(2^JFj|=sS=ys%upL!yEPK)_hK8*1UKSn{=_*x<_@T9X=4S5Fjd})>Ur>r znQqXcYdJJDRuujJVdl*}QN6U&iJ2ziqejS>2V2U|!cNWK)w0s<^H{Xi*Q6b413+h4 zuo3NYqfN0j9BB%&ohA5X$4*?&{heCOh>?a!CpI)Q|Hx}MSgf6-sEVZNkBm`6pd3zJ ztGSE0&{9apBs*kur3)YH4*giGXpf9bFJnfXOylr(#-iI-$zrl$6kkc1q`H_;yuA%B z2@GeP4Ys`_Ej!%_#;BKxCuOHRSEeMzOzKnKng6kGC7fMU>CKErD~WpkeX6!B3L?&s z*v4}7VmHw*%eyWd40{sOF#W^8EsamOp=g-RnM~wZ9H+@1Y?dqym1$oHIh=#W&It!8 zvMlPr02*dkDGg;2RiT(Ec8WI?<2a8Qp&83i2aPo{&4>TKOqFC-UZ=!3CTOH1R%cl_ zy;7LNRakoB#ER2VwPc|xKZy&n)Ki0?`Z>Cu_@QuE`jbf-kd99bMQsw^ynsN%ta0&= z8j39$E#}>aX!k*wA2Ttku3#2SK&Lie-fw#A{pxCJO9NOF^5GHpe&^qwd0+3_&&l)2 z($UOTnKnnq@AJpdoWO3kr_bxq(Dzo>))l6^`rR!de|3xx&+pIezdp#GUO)fuAHp@n zHG4mg?sor9Z=C~69)C}N|4)Gteg59A_MYGSCx`Dm3dPvMs01<&?@ZA!NVsLKO2~rBU9ivc7aDnD|#O50H4a8|m zC5}I2$Zc{bOb?QWp{<+AbN!8(Y>D}v=iI%kRpMa5hMP!17A}^ihe$Aq)Ds0NlC{z= z7??Y-IG>lvLzIzRZ+C-8yiBKFh;*Z!@urPJT1$8X5}J6pWaHzn1C=ggV}{I)#WfK7 zs4S<|fpwk-c;xhAppPhB1&zEg8ss}k)0n$#nk;$jokI?#D?)%w9|vBVaNLC8ZG_KT z9K>YNaBcmzA&*m1h7|M;UO3O?V%^wFm{mBs! zOXVEsLC)szrlBQTSe1_Q z)S^pbd=QjOq`bzVv;I_SWr{!fZGW*=AVma^v>^c5w9(*-({XK>9BEyj92uyMiHCMq zIsg$)0;bh9?d!u~ECv=6^X^0+3t7zp^HOzk6M{_J556g@a3G?VDse&ds50^?G-!v} z8a3D=`1z7RkBJLTdEm-?KSmZ>FZT#aWa5`9uCNQmw=Tc$P2)=`VI+GQfDbVQNfT z_0rLzdg4U2?KL?LdF(zLRM$j9>?SQko{pKdm>Ihq++`?Uj#i24Xc7wQallACgLfqZ ztA>joECKVH+a`0fMSqBbY(O274op}?o*GA*sLUD)^azBW{MdZb_9*kbylajWncuHG zq9gir??S0FEH0f|Owyh_z{G;ydsJ_!x{y>s&Ic@za;Zq;Jqpep*zI)BjZnZ8Y-(f7 z#n5YAiVi({rpykKZ<4}rP=_%T5Qu(xO6!hTwqx3W6lMtP*Z}ne!5#Q%;)%&K)exBd zO8VsGrRq`X3*N~F$*s9DSS#hY(+xmUsvE<@{Jc_Ii2UulAcm8^z$&&4#4>L6m8yKg z$!uh5)j^}a3o<07%2HrKkuD1`TJ|94TFw7CpheLNL<$Bku5Q3CJPTsPMzFCrDhY=Fwm9KEak7e}3kCVy9i?5(`&rB@R#95Vxo;gD#RlJm;Da(dbhm)iisZmSH zNE#(F7W^TAO=lmmD%wx6o0(;);f+p4j7wQW070R+3nbvTjbyIyI~F;8Og6@)kz0J* zpngr!h3=pzbVk_c-9m$sPhyhkQN-PFzxdd4PhMj zhH$DJXrm|DW8v(e-t<6uHo%-qqCzgR>i&)I0Lx(<7Nnrj^pu^D?u0VT@kx{+z+M2^`%`g*_&_qPf-QSw5fo=R~${y zqUmwzh{HeYDM1?B%|{81zHpxf|EbLC+o_v*xjTC#dFAB=JeYo3_#(gHK}FyfaE+DI z5san#*-RxOaxrj(4tC=0-{e>D3^+a;fRkP<$9F=f z5lct|g9O6OtTqZZpaM@>wC>Yn7Xxm1?e`*!;FiIWc(mb2FlEU@$Ne6W>B|8O)LZV! zS`Cpt**LJOPr!+9qwvcZ+Tlps&dES4B)a&8p9RZ(KNa7Wmx$Rvzb$=5T)HM#;pZzm zbu{wFJT&_*X`e7RB(h7op6qQJZ75hb0`7gk6Ww_`b$;i5ph}H^3WZ(54d}z|LNUU{ zkHG5@1t;9pKm00?`VtpxW)JqnE;VE6l78gsiO`-et4aiv>yu@E_Oob&bV)}|1+zoj zts!GDU5bz6mo6w*>8}e#WkFhOdKn7p6HnvR9g%#Kr&hwmqOi5RzU`Avj~S|L^EgJ9 zNW4B7o1~!Pdx;7r53$Ch}%9=%bWX>d#Lw}>Y_Q*Z35_^wI;AwC|$&! zvctp20*bIV(h=oO?3bW_N_l7yugimy#+6J6)e5cf+PtXQHr@o;=W(sIr_Q_XlfDL0C(MygN-GcgU!@AMP;{qP2fgS7At}tyXWB#dtGzL+ z@=cLx3J5ymv!AkS)wHmDOGu=8HgK#5kte0bO!$5x`;oYwy<_GcBq~s?EFc3R`amlF zl797Esl(9)^zEd*_JaoCTbA0zRGE<2vRRTv!GWKIQM4A#nhMd~fJy8C?AF>u?Ruib zeQlCTws@&I-{Yb-0cQD%j{Fv|Y%NvT&3@vbb5}&*9#{V*IZ17+&aIT|-`#VXsd{amB9qPwNOZM>Q{GfI2;>^$BK@WCUfIMvvPZi8y!? zO1+XES-UAS9kBOxCN~MVf-fgEZUO&BaWzmA2sTQ)2+)^BNvylJ2-)5rQUym+;Io8O zD+Q8>g0mWe*E8y%*->%i6J%LJIMZNzbWo)I<{>2`O6f4SMdn9W?c!YfX0r_mYUSbg zPMi*doZ^PiQZ-1rg~(K(yRY+i^;!@e)#X{Aweea8SczgGEA>RN@{@>4mQ+e(UHwQP zA8~%+#?I=?tZS@ITOmB*cod;;IuO9;q`jijUbW^v;MQ^R-zP6W#9_$A`wz_mfvGta1{|d!>fl*==-!h2bLv3@X<6Gl zR}TvRj74GSA9NB*e|dnd@!lw9|D(;EOM8H4ekD)|PkRvWcbhmKpI|?O3v58iDosB& z2+|Z@5CI%`;1}>r{uPYHJ2dicY8Z=)b$_$3>nQe5=}_K9T2M6uAcKsEJ6j@v*P3XP zZ{0Lcp-+MEHOnz@9W$Le&($?GQ7bO{D7Q+DelB_guKj4s{XbucHKIsaUPf-9&BT%6 zkyPo$DhtQxvl&mlu?SBO^aKoT4mUyHu&SKtZL5Z{NO@ z`$)KX_XZ#t&{Zr_)`vxN@FU6IFZXBssvw*$O^^Wy1fjq_rE0h`>}8M(E*&3kPkva-T^X$^27q)Pu%ci_@)Hq;t-E*1_Co7uNDD5m-B~xp4_W@5) zPN?eXQ?^5}E8u*rU4%Ymx-Fo*_~|b;9gzQ``V>v=#MMlyeRL-)SS<>^wsbDB|C>;c zb{Vr|IaNmi#>QSF@5!{dB`y?CTLo%aY(@~tPHdk>$+k{AO>RDf(Fa%1tUMKJ`8Oax z4*GeKC8=lq0`l5*Dq7^MKF~VlYS*tQ58uZEg6qlJZ#Go=7p2V)&&p4R9V}E|jyJ#Z za&1}X31*_UD_jOEK<Yy0a#?hRm+PwWz-6jd)Cj9A#Z4M z@s`Vs1?X5@I$xm_gnQO&%6YgLet;B}=o4O$8SF_!4vUik8yO!REZ!cCX{7Wi=DY%^ z@K9N64mzO8K(e)+N(sbh@!j*3fyOJqu{5W|GKbsP-G4E*X6UG7L)|uU2!gF19~2|7 z4L1chd7M%Fo9GvAlU7+%edWf+Vv{v{5?L|?xG39Y7si6Lf8#kc-+VhW{jBWxA!ubD zh46BA$&}I}thM^5jcd$^nOdu1d9%{gXq!wR3vWLAKUJSxRd#^xxef>sK9C9^Pc8GY z9Vm5Fl0doWJ*nsw)J6*f2)rOQzqYHgD?6W<93o^=->C#)8Nx~usO>G7xpZk23Bj!@ zKN}8iaydXBZ2n4)$dx1l6R?cR5$n%yVkdBZ+7e)y${3#E1!wuRL2r}EuWk(GxvaL- z-cTn;8VsM3d4}OA*r)JZ2z3&?Dbsq9Zkx5WTm!FD$0p#wsT6r3CG||8SgY9z;{3vU zlGOiE@Q;D{$J21&yp~;jQ^0;;+%tzof!iiMM0g)7O0ydGD-*+w^YUz2`ZMj71yE-# z5qJ;dh3F1?E02N_|1+SG7?tN=cNLYe5y~dc>oMh6F$_f=Xbl2_5 z*H~|c76-F(>zggn3vtKO6)>&$?CJR|uS{d^L5@yT0;7dJ(Ktk%;^^3n7_#P1Rky@6 zaA>S@2KiqWHio}AKstvtz(z)sL`64)o{vphP+K~?sjSIdVR&O71xU||uyRk;oaq}F zt|*HG7`zaq*~1>Bs|aWcWFQyMc->P+DjRB35UMUun5x3e+!wYY-`0x~=v6Ccr~+6!Zlak=V!yZo&W4TetN8Dy*+iqp9E{2DXG9K%Q^jV7X!Y+$`y%a6icWC=(V z%#)G&o9+x~MA&5i7AvKJWk76oC`ZJ0;~fOr6qPk>qmG@Ma$k4xE_e-g8U^{xH4ih3 z(os#9HyYB5iI%!;66r|NtK7HIf23yt)U>gpbP?y8cwvr8caW|Ick#atFX!!Ow>Vsdp8K@Xt?H~8+}pfktajg-i%7-pUfJ#nCFB81y*jO#m> zf8p0A;31a~qbND7c?ekDolD_roAgwQ=x%Vrpe#fx5sZz-86`9FMhLiC8ei zGOVi$d><`N5vs(QJNpeM$#+&+W)Edz$S&gViWn-%#ugy+U+7rC)C?mUCf;Bm#4cDa zB&s~}vCP4THh3D0vSL^soK+Y>j0()3L?+gu-+zA8d$J0&7M}k;hwQnT<^^{rX%*#f zLtn&`{OjZr5ew0^`QIhk$VZ?Lc9X`9vm}y80LK$Iu?&$1Yj59ynZ0x~<9Q*vg|PXu zemd?kZAC44RQFa8wlqU@Ub{zCojeF(q7z-O`~u;pfX>l-x~y)_B6LRBugE83=&s52 zCe#kV>zg9hdnnvMu~lj+!6?u=t4kab{h+K3dEy7YTX>k}=DjlV=$9=gw5Hi)Ha6O` zz?6_F4~VrERZ{7Zzk2d0?4C@S3_<rVG149yAwsrGmTh$ z!G0ebeb#|A)-4;J`}G{t7WXxw;Y$kiLMkd z{do-=lW#EL*9KX&MB||737E#ow{}=79Sl14>eAq2RvaYuXk0j(1|+0c(bJTWwtmo& z{oN$foPG$p)8;`A)^cTlTg{yElL%V-*4wh%xy{#K#o4C#tAH`7NYKo4PJQR=G5FlWe5#1XPonb~jgWcL z6-cq*Sb-yo;lmBX?A-%5qL~8a?haC;VznI0BU>h_Zp^Z_7Hnu&#b{GaH@!91*-eIl zxHRzZ{H{14t`8dT_s5^*16RMBe^g0dd^MZ0Pjd`YQ~e))6RVHENo0z({Q6wCYjX?} zSsC#b1_5#|cURlNO}r)Nf5RZy;1hx?N)bi@@JU#ZoWp43m5r!26s9|2u|SIdB{VGN zKR5r}Y^dKZ9(Y@;x*8@5NmjFe5a_x*&kw6{T-lcSKhiud0I$|{aqK9bDS(z2RT*H7 zwdqo*X$Y3umeAT=ouvwSXsN%}IYh!`LP=aET#zXv{}+q7r;h?UeeB3DUrA)<0TS8x z$dJ8KtpX!^0)j$La)Yj;F zw=(z?jMBA;7p4JSlps1b56yM45$awxEQJd}jI-k$r#4_g$_LUjqDXeabi~d$Sl8PH z`UE5g%j|pi6JjAYK>Rk6Pi_L^winumZ$z;~6;}_55vjJD?5xBdI(T8XmdnnM>SaNc z;O*e^#=ENwfwnurSp8H&WwbTrv^36}fu?4;*9jXrZZSs#gT#l|F(&+ssuNj@mmpaQ zRd8~9j$b)I1X0$h7Y=}DLwGpP_`!iXA4})~8L=^GIP8ly$n*jg9YNEKae7_jNTQ0M z2L2GP&_P=7o*0{j0vq~8VfL%;17nzOxgvCHW_?k8GdGn-pxRO-zXHbZz#zbbnx;@D z8r*F+>9R%9h`2+7p#=@pkmspH9nOv^Vx4`N7JV0Z{o?x!-5-Rx^9*K7Xba4YPthx7 zLJ2~sg}%rCfVIv1L|Y(`L5;&3Sjkfv(ygwrJzlL{4Z zivtLi9MXC40NlRNylpnsh#M=c|--*GyD&Abzk5DGNL)lpkmPcisRiAIM zFW87XnG5+>K|?Ab62j~7hvgm#J)xx>luc|n9c9UJ9nj!kO?Zf}OE)jxoD-;W+|8uL^Fr5zZLB>ibz_l$S zqArF7Cz!GKKyQ5e`iJM4mQ&C!M2Ee23(o$2!Q)?<2a3Iw9fq{@7s2L z;*KTy0`m%k&-pr(nZu7I69>VAlETAbYXO0#?*L-FyQ`~=6ZC?fVuHdA#RqIJ{bsPT z?yRV;bPW2%gd4gEjw~KSqzDpw#SUfhj%f*lCnzG7(o7Tpd+5n3+kC2hyN>HrL7d_2 zXhS^>VQB*E#BrOS;`W?A%I(vK>N(YnZ;W1wCwn&g&KJpjzc=Z$Vv@Btc&?NAqx@TV zjF)p9?LOMpB_$?gz-y?n*C@_A5C+Y3|3%$1mv?x%fhN3$0Elpx=zjfM+B!Tr#b zHT|bZEh9+A#Cfdm!SzI9G zXV*dU(d`{s?r&UVS+()lX>9+Rv48=+2FwS`MXUzm%iMIIF1^+e{WfQ@v_5Sm_LUY3 zZJUXsI;_HJzWJ92k1S{pfp0;T^j!={#Nb-18rymaD?d{KWxCcfJ=SV*-2ha4{1J$I zLBP7z3)GiCS9e1}PNxWnM*`C?u35NSdA&2UeXciBYbmNfJ%BaE94h#FGNl+a?Zo>> zHoZLSfQmS{=`pU;Gz|@CF2w8zQl^^&q&PYFZZa@uh)32nn7}xRkcsfd;&9|^Um|r( z3%Hq1!lqV)p6 zGbcr9o_wJTiTRG=mw}PQ9X%m8aXy77p-DuKx?D{DPd%hrxvtWr1?-(@6%z?j|BPq8 z)DCNqtu#f*&iCz&7VL#gLOWPb zxs2LmslERS`~BcH;`v_g?|%;;X`uD_?j$4J%mv(vQ9#gG#g!^=DpJFRiN}#7vU^S@ zCg)IF7um{3|JApV>`oXBEXA$da_JMz(y%8*F%<-B#orxKKY)-@4V2hG#>_yWG zEA4lLSmjdqvN~mc)2BT}F5x>ppMT~(-Y-kvQIJz%9imE1FUQ>D`nvtve{XN5)Z^}U%V1i%%muo?@8>YTU4Bo0X8zl{ z^ZRuab{0pt=Qni*-2rv=3bTi`5T{l7`jV*My^!R9ZH7o{s;%U5%QYe3>sQy7 zKO^~NxOjfp+MprD1$iBJV~$(|G2^y0qp>`uEVm-ajHW+Mih8~>$5-siddP#yBsH9v zbmK15jCm6c-875>cIJvH7am@!*F>XAr9&`K;gCC1wq%XvHoi1Wt%Z$^8gpwwCQCQm zUTVUcM3~o*p}^XkkO1l6o!Qb3tH=hdl?0;!0EQUXVb3y796(OhZ>M?T;N*#_E=-6V&;7gwL@xhzl3f7S3wJhac6^4`roq!RE6_XS~kA)oHW+BxW1@&hgi8+B0J)7}4rr03O*fm9E9`;qH#EJk3pm%X9 zxyX7=C-9<*C(Y1m+ho`OogSg4pQjD>_ng{DrNB*C-d!nEpo2WK$xwwrCB zetNEq$MnVnPk9_&tbuOpM~eT5qbx7&lqJ^`qvbD{ zDtybjt|a^%^I%;y!2!_t-H+KAqBZwgF}@s;C!(Z^ z;&&WMIEf~^q$MtM_M56X2M%g(6kWXc-y&W-i6g@f(d_YspQDFB7#pmo#2#k#-sZAd zmXqp9H`OGw0TnL#wx%ld((?7{h;9N9On4`YA5xK0ui!n6WXa%_%?MAM5DB>Fa(=3{ zN{C|U^P1e9R!!L=w%IE&6tmePy-F5Hm~z-<+jKBK$Z}PYT<+RknntlFX=;Zc?+Rst zPOnII072N%CzM;tg-vQGU*PWY!k5PHM3ddb5!yD*u92?AmPw4; z>5DQK7FY3$+eESPt4vj1vmL;xPBNQgkGS5_*f2sKi?A`mka13^4Y{N*=E5uJz!l$N+4!$v z{OH^o6>{8<6WrY zs14+Fvp_|<4!fazbk0)?)zqwqU9FaR>4aLbDLsxwq1sYixXLevJY0HL%sCgT9ni!-OLK9tbqM9}J!2YT*!o;h=Heo^)c*7Zhq7&sc zW^8pwqPW7NWCgA>8&C6r>?1|*^0VqgoF~0xrzbb%df)r-Gc+pBHA$aLI;^j$Q>CYA zGn0`zG%ItLk|C}-rV3YodwKoiep2}m!Emwty=e(;$F$$ibip>>f&nb)s{IxE%-m;N zqCX#~6IO6E6Kr3XN~aT03g#Zln4T)+ixMF2DXRH9BB zNdzQNB=cIo70E4rv(kHB$(R}0)lorI;J|n&9-C>^yt!S&XM@M5aNhkk$CkETabxq5 zQU|9~wA3MN)^f3TFgOvG0p_q%$yz$x1G9r?NAlu0+GbS@yK&{hoSf-S>p7oUHQT^b z#`??**oKzHfe=jt}&tB(x1FJ=`vAKExfsWBYgW z8U)s+ZcDs$?ZLOJZx{KRNP8l-;QraG&UaS^_QwHPx~1=S=9)-al_x$yQFRolADL~A zIX`DIf&p~Uy7*OjJa zAbh9yS3Ky=A!)cm%xO8}Ji#2G0|^vv2V@N;gK~{*G#m?y&Zww?&tuH9*(ceVdK^Zp zRd)#uuFo<@<)l5Aw&{mqeE=kX1uF-AI;cFyo)d&}PE7&R3$%f`b8W}+G!IOx2SPk4Qb*YvBv2ZISWkL-LrwVDAkauq)VrnENqurt zAJvGeAp6@>rl2!wLkzHT&w;9MZ3cvRLb4kzGtTc=GcnnI1)kk)7TfW?v)3!@=gji} z%Q;a(j?~xd%{fq`B-8?y2#IS#KV{34;6fg+Y!#>SAd@WAR?=Lo;G?`eKrN%^S4x0# ztd|r{&}x7vD0u7U;ztLjalnNX9?)eE7Cnj&Y)KL6>zKf4(CJcZPMEv~S+w{55il!F zs8D80*uLeW%!70q?w^lR1ebEUJ4Bb1lJ%t!K8j>K__s*^%+6GPu7rw&E!^{(MZHLVQW++-1>{fj;h0bv~Xj!m=)1RYWYB z$1)8n*9~|saqfH;5@m}R4Ac1$bN2Hab9n|oiYEJxK?BZtih}mepqUS0gCkryUXOgM zO3LH%VnJlvHm z4_|VbAZ8ojNLuz1_T@$@(18B<(K7D-;dYiPpwI0;lr!2~+S$fqoc;xkY!IHLB&@B+ z%CZK<LEW@w6^(~VM|M29y-n0IcOU@bh$1gvk>W`wdKJhjtT$OR3@7;LETq24!7cU;@opZ zb3JxVP!lGqr^GaGbJzW*mbaz)v$*lc{21DmiD4J@HWuQwg7Ra+psxduhxc*dXpIML zA)bv)@*nB@tz-t-V~0FMdoUL@VJ6I4Z*a&=t!biQ=- zoCRMTM4&Xr(zGwq8J`pSl4Z?=%Yc(q%38a)%wO$O!m4|`J%?R%=$cP< z$ztz#)+zmv-LF5ZoM$cD@c~^DI}gp7IDPvhb)^W$kKQ8q0`3)`c0c}yLk!|&EGX+m z$>AIwgx?hzLsH1|E;nHFw#>L<`vctT9j#Bon{i@=koR58{AsH|R!ci9u$5{~&RZ3_ z$M&|d_L-3SYJbgBR%&6AGH0VJXuv4pW4RGt7mp?pdKXY##g06cj7+Jn>4fdQVTIMx z)p0H>_)c=gCA=1z^KG{@G9HznMdeI5PQ&{!DY4>bp@4pt9!KyknMGtyZ_}d>YK9U< zx^?7y@72Q0idx#Fp8^X!)P;|H_H^>b@2&<^oV&)<#AOu}lDyVOoa3S1M{VwTVsh9s zR#p7X!M(ZNCq%Kigw-D0ge%BRt5+s4u~s z(OhZ&DZQ`aC7YG6NLhKR5RyLvdK%eHUTZq`= z&+m+c0!J8$F0tZ^qj=kqevf^_g!urcKW$2#doiXVLvvR|#ln?@<{C7_fr=oWIj~nk zh-l6v{@VMEVm%gD#)xRG=f`STh8&)*A6I!-9`dyJty*S}jw_j0-2=%L05;3xy>H8B zyL*!ls&VqO1XA*_=KYm}5^U$9pRZKUs;AqX3UCSnk|{$^0&#;KaGX;1vT85ZF6K>> zL0{_Ph5EV`3!*@@DomCxw664w;4r`q;SHW??rzW?NR=QT4y`1X)nl&-B5LJQ@>(O9GD9h|8HSdH=3phXNVzW*^86tUY9A zI(7lkeoX84fjsaPEiGu=_E`4=+xIuk3XJ{_S>e|WF2iDltO)gk`)dhRZS@1ce%4`& zjuYBBwCC#_8#@bWnUk%Q9gK7fy_`a>1-F~p{q!oyb;n03{Sl@u*^$zxTD`%aQMg~;Z5;Lq-^XMQ=!*k4yKfPkTbM8! zoUPRC{+Qv{BZUD%*+nIB`u;90@f$R$6OPtphd^Z3KE3t|Rrg6vq7*sCJ!qE7PoQ@v za^||>Z3@oz zT~*K}0M|thgcHo#NJZcTQ^fJ4yWdiEP_R1+#E;H?7-5npm;^E#N7-AkHm(B~<|h)o zNQZOtITWE?&*o~rSo|}$Y>hx`^@}Rdy7Ol7-=JVa{;g9UinH70wFX;>J$8M!3vRxM zaD>7wtV|BE>W#Cnb+H$2FgDnmgRlLUGHK}coACURV`ekV;^U0L2a3jrIB3;Gj9)PhK8@GEX11EwB(RM7nI6mDwJ zl<##u*tt6>z6N=HT*d(d`ws>2rCsrT;_KEj)6`6Opt4NN0}763o3VJUzo*-~c6M!q z=If0U$1k%d$%!de1M2O@{K{Q~!ji?$0#{aiA{4I{^{KA3=U74<)xr0rE_bFTQS#1z z=AWiR>wTWUW;V_(Gco@bNOto>D#j&3JV!c#!LEBc;;EP_2N`FmOI-_Bpslo$hVD=6{mt3&O<}nhTR*g>7Af1+o8%7W%-Yq7_E6$jssVYj_@mZ@mK

^A&sqJ=|b^wK@?0*NX z@^3@&T9Q2r2;B9i|BtXhU;a>=GAw1vha^wLWpOH*{Un&KX-6V)_>|UsM?fMXwv_y) zW?m!$`|Ek;7@_QW;)8?Plm?I%8iM>nujy+RB-HV|oWdDgSn|ZP^<}E~2jrD$qtm;p z*gwj0_jXib;5x1u{+w7EZZ!oka}+5!;F_R9tNpD{ZR@;Ga2FimgsGpOvaJ~_pON2? z-IKPjlymnx0sr?QdBWbWr;8)Ryx+$+`U3mhW(}aI@2xR+|M!RYvN!?$-uIu+S3-WD z@7Fv5-*=(^a-DDN`aiM$ce69o>c6ibkCd6>!#}fRAy@4`2^t1`^-7iwVGmxm}aH00AI(UM!gMDHjM`Vso)jTUEB zU2q%8#iXSRNIjw0Tf=Q{1Obt?gA?B`$(?H4% z0G>BdXC`Xb_X3J;N=pfZ0Cst%G10OVg=e%_fjVSQ4z8+@e4>MM7^tv$G(J@;@PF#4 z15KEf!A0HYbUKZi%8hWTrAvU5mcb9I6z^k3IbX}jLx#(@i5 z(o?Q!2*R(!QKx)Gl&H>hfp(Ncp6F$#G+yp00BD>^;273efMBWY80N7FwWJUlNz#Vt z@qc|mB`BJWF*CgsBnlE@g=tdv!?wNp$i~} zm#MtTFfmD`lejnF8;qwUeD_Z~j@eL?{MU?T`3#k&N(nNzwlJ z9AvGtQzuMn?r>S*e=GAb1!NSN4vOhp8S2~&Qc#P-1>5wP@Ec+O5r%_J-8>3dij9~} z`wu?H<@8b9cWg5cRt3Hf%>;(KVcToAf%AXiE1puW`acuU>qqA>;vI>DKr}W$Kw+*rq4ogye_rTRMFV4kY(7evUxn_Vw7xRh~xe_K#eGY z(xcP6ich|UQ(t+v1rZ}bt{czZ+N*xZ6e)nMscs-vSAZ}NbpZjT~yLP+EX(ex)uQf>0eF*%35F>rl3cBAkfsP=UGaF-)}5Ei`hJ zZB)EC>9t2;Kzk=HgZJC?sg+Jdo|?>8n89@qStEJldDju&j$@=>69scPv0>u|cJgKu z?32u254G0bm@s=8Y`qx@s-@P}ZI|}ajM>kWdd}>G*zAL=ruiT@Gf1jO=amV9>29@V zY>rP9JKlRmHiq<1eA{jdSw^gv!+Aq>5auV>Wx^Yx^%=>6^Z)#}Osfs!7hYxr-7lDe83E`$)-&d#L}mfbp?b&z97q7mm$JAHKj!(dYv_ zrJh0*)0}EF7B>OKrth-0NN_s^?_L!YEXjf=J=$aC+#{2^L8s>>G;vGhI}-LK>vouj zVuF0h0CkFH&cXfUfB6>fA#@mu#juS^Xiz%7lj`XvY=+ z2KcqGuvsr$7jEX>4glSI=3kwO7p%&-h0R`Pq~?W%60Y*%_?`j?i6QrAyd0c*aoxDl z+)UP`RZJoCk3iGQr~B_$$hDzo^4Q+bKRdm&x2nERCMy4{)lWDs5wQx*i$!%=7}au( zAr!N6t59?SdnrJlvt-o*}L-)N4eZTbE1 ztcG0)lms(d%um9%ueFIAF&PlZ@-#`hOYP93v$Yd~=ZVx1|HIfhbmziFYc@Qw?c|O9 z#W=BT+qP}nwr$(CZJgNFO;xYPxQ+S)yR$nB&zcij{7#Fqdx*k5T78n65Z*nh71bw` zqVgm$7_|AxgLt~dJfnuZ7&tv0HoU^jcEaTf^*_E>ZOTb;@gi`Gh?YUr|EPc(8JL5! zODJlR+EdYt#Paw~pa2nZ?%9a%zR(5cuRG)yccZ#R+82kJF9f{aURBE5wYuheymvRF zuCqu3S=MM#T?N*;s8vHPa+3JQZG)<%iYXoj;VCQP+Fo3vmO9Hy`ojA3!b1xhJ2Gdv z@JSbQS~SrB%EzP43V0Ds>iydvR4FU z3%6F>I3Epsh2i(9Xs+ZybJVUe&m$JBP|pU)BnTLNxUmLvB0I$gmGWt^NUcK|aO4C6E(7~hU#q*f9i4W%oKiRLS+q4&1aoZ!IH8B! ztSFPRoy2N}NIyI@K(-CMChMxi3OEh;0Iv<56(o(^vxaxd z>AHw^|2`L|(}^<^_-sex#q0wD!l-+MB0cZyxQjZd!`pzi41PNlaBq~&?6@ID(4I7bGkRmc^KL1jS(#}Rf{3qB zbk3f$v{g>lUH!sjLfKw{H{qT)`kbZm-yX_f$t8ds59v}B17rHH&c&YIdr&3RG%o+B z0_aGYX%X300WypW)hfS^a&!au^NOh00Z7jHGVEOmz>u>pKBzsaoP*{s_Rne*)^V)K zBC@n2CMj`e&l%0m0%MCz3A|Z##D88FX#2K|x{EZK_0p~Q(gvL#edLwP9tF^+(i>y( z*zGcLlD*U+B@?4+7-pqC*AG#Wob(Rqf|L0T#feM;=xAr?Bq=ldrC}AilMya}qLv@k z9iVZxq;kdT%}NLKn5d5H?6FF_#%opO|3pOd@$EB9Z|t%agsB;qXYMn)pHwm0n#t;gB{T-(xeJ!&DkAVUjQV9=buopl{kYl^q}?__kXlU{Xg zSy>vZveUsO-X8r4#J^_h{3Qn(3f){yi~)?8%H1-T{W`-Z7G}8*iGWdF)w(*d_&D^b z=0@3WKop^e2CcpQC%G0Ai57D*9X^jHO{Q9KyEizZ2{-Fuo~X0I9+Yxq+ZL(5-24mA z)*U*K=28976E654*>3#Js48H8s_W_|6sSm@OVg*;o&abVZpJ$Y=(OdCE`(-llBjR? zdp35w>b&y5GMB8&ppbaku_G);jfX!?u%VQ zwe}{TU3uxB>XipU32Y5vz?#9$C~f_srIioPl94V1{()>=Mj+A@1?nUQ@v|furmCsG z-i)2z7}ciWg#Rqz&t8peYG;czLMh7TbMN|iBB*LIm^SpI(Pr^sm##lr9^%HQ?p!iT8xZ4v+!QQ(xhb-k-Z&-_Oxr($c2f=ZD;%r_t}XNJHrQ@@o$7 zqX=?Tf5G5b=1vz%CXzySy9gBjnQj_ZP%ejmF?xT(_^w~|=n^fMJy@IdzU*(Uw|Iv% zFJNpPSi^T=9QdJ-=wUbN(U_nwDYj08t&Pr_b-Ruy*I)6{XWJq~Umu%_()MbSY|*XG z>sALkg!2frC1lnjtG_H{3B)QZxzv4jKab3A8mg6m_6v-&K)&2cjfq>oL}I^x5?Drm zrZWa(sGHX?{8d(r7P}4=H^B!#p^mC8QBPLn*HvBgI7OfSs}B|vB~>R0MkprrDuAB8 zi#2mPS}GNDOE)DPk&KcT*~~W*?u4^yc`8}aacC-O<%!_WCtC<_r<5m!U2yYmq_zNxj zXMRE&j>AQS)-1N9=A8v^KpE+>YYuRdesOPzG*q{Rsu|uhzTNveamEq0U7m10`h9A&IxEY~93FsbL zO<{qD?$`)vMwHQs5Dx<% z*Xn8Fb~xAE2r$pd{W9AZly-+g2cw7EvY#lE^rCkSq z>bF*+xODkb$!Pc>NPrVp+!dEm_TPu#_LJkUOVM&f+MT>!`3h{m>xd1+Q(9sKA3yOM zt$8R0K1A#)SS&`R8M&SyC%bA0g4=N0Uf8}@xZZFcuRPF@H`}ewH8BO-_4!&gm8tRO zt-DJsD+h+u67r|G$s&2eA@i8p{Zgj=s2sR|<~-Zftx>-XEWlq|{prlyL5)mTpGR3! z-*qD3eeH{oWGpnhAVMWuXkbtk?qUW?MxU@*svMW6MjYhgL!Rj-C656dCKBBo`%V{)=Zw@em%RiG4zn33-9 ziR?004G`)Kz4?s%g&WazRm>I{UKNy~g3giu8pZ$!4}O2l<}}F}D|3ltKB4zho|ten zrWhxapfc)bH^~=JMX|ra2`2+(QpC0sn`J)2oXx(O-zpBa{bGS0Uv^~VJK1S>Jr%F~ zDo(L(9GN=7{pAt}!fV7ehtNqAC6Z?Vm2Fq{6d2sl-nq^RvQmKz z0@*t|27F8YydYsuw!Goe5M0gM^n3=PH=Rw195*RI#N86|;iQEIzn`8B4R-K1$l?IKJxu+_JXYC4b~`UiI;rwp}K{AW?F> z;jT=;HA_7yoP&J)+Jr0UNMngKD-DDicz9QrGINdmhI;a&$6Y?eHd`FuZ#d9LkoLK^(+<*BW3x27{tscqRsXMwy1S zEUz$bTk^hv5?!U!Sg=~$6L#kyS8O(fCX+W~R0pjzO$4XTdDNR&pj!O|Y z64;9L>YLiY+&u$7@JZv-^h(=m>v%_uUk}D*kkrDL_Q;pr<^OYY9w#^rl(alrS|=%m zv2qz4@GdoNR0lHA?h4tb?Z2w=HhDc6L+UzyVbB%S|#3 zV*~<~A@kuCtxC>x@v!e{SVWoCg5VPGsj5A}v-UMNm1Sq@ntsp(y5FXPFe1+sJiAL_ zZKuupa48kVWSgAYmEO>fpeG#(ie9UjAykZCraxR{g&c* zdXNm9FhxNQZ{+C@vM{anGoA|BI^A2(z7x(`G(U;^u;N_eLNo54+&yMm`QM6p!rmezF<;0c`&(vAIt$I@p2F@jXGx3%NfS~9!zJc zkZXu>{?BU$^b3VR4D8U&sCR##sQR`Pnfz;8I4^)*KYk-+$_~qPCGz&n!}~l-IwncR zb^WPfe51j)L5Ggo1z#1_C*T3z6xqx_R_P^@JK-R|zMo93k#Iu|vH+dA+JBd4SEDlq z1j~~!fiCyG(n5FTowZ`F7S&?{kVD(+cOIswrMM@`tp&4PR3E7=IVWI%rYjA>c5eh! z%~5qsCY0zOPkJ=|6fEQwl1jTaMNcy3XCXUeh3TI@KFGa zDX1^CWMz|KLot#sk7-%j3zekkAGpBgmHtfg)?*x-!PsaE*nXH|eC}mFj$*1{kzhZz zLb=0omY%!f5+Q3}y)p^68VOB4(t+aT^eaI48tifcwJD#~Fxqg(3=$H3M1?rWq4{FJ zWDDd0<>|nW@B0DETvKc(1+eJLuB%-J)~Eg8&B6fRrmGfPC+ARWjXNLr)Mlu zI6a0ZI$oIU1mtZy$s$nVdl!0*nBWrwvF9RHe4!Yl1o3ZFs>}kcP(&ozx`{clb5yh# zP6E*w|M>CfWqyl6Q{lNu<7>P`C541Z0$l(L=9fsaq1PjwhU(H(f=53Qc{TP3RQBFE zYY`bzN4V4yq!@=;-#j+^f0{OP3Jj){FCgklI!B`ERb;jez}0iG-Kj6}=2w01cu_t( z!3VD6g6#@Zoe|157PcbPGDUnFki7AnYsCozw4jyj0%)>%D2Od7Br59^B;PnahWJSb zWhF%My;ZgZYBd*XPCKs4<^x^m2D!|=W%_gQ29>fDpTb*_-hI}b67oA-dn=O{-G@Dl z5A)q)I8)gF66g8lBD6Ld6{r5}F_#SLt5Z80-tuff}-_*J9falM+g@Wsx;*quEYt}2Mg8eqpK;HzV7nUsYb)NtFwY%#LsL8mz zr5)s!P&EX4ES3f$6h;3t1m*W88M+n(un?w4C@xR=e<3JF>(k-d%-&5WtU}ml- z8;%Y9(M&t|-M+hl?~ab9Y&vGSD*$*OA@7 zo%LmxU9)ogvP3F^Ujdp9P`Wsp7YyY{a`vrsL(3H&_%tb!*1lHc7z*)cmNr2Qc%0V4 z5CsXvMhQ7M`HC@0ynJvIWyNGOaPI3YoK+cc%8EsL07zbQ>Bbn#*fH4OSs86`QK1%Y z367b$N^}U#{@~vfFun*RNB>29OBGIFNP$}d+6f{BAttEFF6N7}nj86{0zUR)gJ8*- zZoYDhsxStY{#>?%T$?*YG&eQ7kVq=4lsbEK^uGHESn|}l8kfB0e%Tv>k-f)m2noS zE49U(DbGYPz@Ctu@VF40J^MJ(?ZyjL;3P>IjvF^Ml8~;Tic5r3CP~Fq1<=C3o=7h> zPKjmn@hvgY28jA9L!dOPuM56^uOvS4o0PtAaEY#YN~-bjB)bNvA(Iy!Q)=+V?ds)TvEuNm!dX{0M! z6!1aSXg;*Dn=Lk)Ks=Np7EaU$zUm1tD`x7qj}; zDsX@^KU3cE2y#s6PYd_|>Us8Apxji|T$bceeurN`-?A?b+VVo2`WTd9nDv;to}S*L zbke~5(ZmU3yV47E8mEf<#qJW<8B?rXDMVnV%QD6l@2*-=7GpDY5jen0W%Ggz3r>#u zcDKpKzW2da^`$m1(3u7y^1de?a|r2mwPuzUFVyikh3Vxb>B0du+o^4}Mf#!QvirOQ z(^pxdX_W8Y!ubV=X!0j~(tMU^wg*p5uALK?)hra;G0eh|<$SyLq89JIj*% zOX{D}(~aU^_)GOra4_m8lVqHlax_=X{FBywdjQ+q6;e2o4ji%4hLE0*Jqs;@l-r`w zvc6pfB^lL!E-#;pbI#IUirzes69Ty%rj+#{x*7{y(jJk20^^^hDhyQ8jQ>#op@K7u zzTcCL*|6vM(T;YC#g^ixF*r7t{waWuE=1i35c&4C`#L?Io$O6>{$C1-z@mt_%lGs5 zlh)KzSy_TwgqxjiZ?Dhyw^e$2g2zqO)tlF2gwM_*%Z{F(L&h3}+L{|*Q{hx_3=V8} zAsik{IC(jxVt!;NPxyfG+e3LfnT=fhP0J~`d zEuwi=<81oe`rTf`(CrI4|DWU>6SIlC5C3@tmC~1woMKSNHmceLR8|^VgQ&DUAwr-K|CS@NgfcSi&Oa^e_}393oyGI$O>A#h z%NoSuhtr%aN2K(vlRW1M`KXWfZ|?~hg;hzA^^XQ5yQ0uyb&A4fhXq(o`+?at?nDuy z^ogtw)yuXisNmHpl#45+yuo@)ol0zaO9Z*k~IlEbbmdT@5OibK+W^ z(`=x!3OH6HYQ{aVN&QSKH(4T+E9O?}t)3MJ&wbbFQ@1%|s3UxUfA(cS#P~3syDJOg zkECER!}kg6O#cYVqw7b2Q8>i)&Tf1xCDS6{8etNG0;>+!Tvt4-nOau`7Ofs}kuGW< zBvyx}+KpF@chkkNq=vnMMVR?otdmI629RDC0HA<;1-p*{8)}|F$VcghF7VnJq$dg~ zpojsMX{4QL_|CCEkL;4}o(#iXPM%Vzg{qFk%S#Dgva5c^P=UwLb1DTKlns8k%donw zC==*?&X913?&essaLqD=>{<~@6wrG!4PX3NKSqs{N+D(HgyMFX7}+4L>~u=9F5qr} zXJflVtKqOfJ1`|bVsR=Cw2icxsGAksY;a3l$> z2_0A%iq$RgBEIs0y_S{Wye!`)B+a*I_Pd_`ddmv_5amK8GzY6=xYCvV5FJC}CPw6@ zf&~pZ13N237Ytz2$~*x}bnEM8=@z#-Y_ATHjg%o!z8<}lR} z9D|P78yhS@q!d(tj{b5$ao9F)DvMf-)ttn!&GRF+T*7KF2h4;P=|cus-uhzDUGNA2 zGVv&1^@b$}gnL>^!}g`7quwHojk(xVRpCrhb;moN;&_Jt6E01OTzHs74_Co(DR(O@ zw+0j|(A{6#Lyr|IOitUc0M^Gcv|qeeqsdI~k4h#+rie}6UV zY4AL7a$W!HR^kqQ^V*%W6d6nS1Xna3MAHpM6*b!}LF_QA;9ZC}WOb(>l^h>IePh8B zr)`u5$Iq|kG?>Pn(mMUz!sLo z;6uhGS5P#RxVwfzg8s9qv#VOB-7oH_F|=2dR>`FTD-3G(x44=G@kvzZli2vROkr}8 zT3sU~8FaB426h~U@3i4_ZWHbZokb0S(3mMYXa0TIz7U^Y_*u+KPif4Io<|`_X4o4g zNy6e97s4@zVGj*!2xwUTk$UFku+D0(#>;M-VwnV{+gybPw%DFQb!|oz&&%0|L?;sV zJ0?bFkGzYQUW!p-4(9QG_()KB`Et=-5x*N@t-TV1P_`>|;*bi`6Ke2!qzNVs^%IoA zY}Qj5sSDF=@slzPl{nY$1NsbIu2|@U0gT{2=5B`IOO!q(c=}PQs*TnY# z=_X9dU1hA`P^?!Aj%)G!G)7TOMB%{)^(1j{M%zeFLnBM0O_ZW?OX+#=R~+Tx6_79} z7sdS4VsRt85(uegH=Q}Y-NEB2W41-Zw6uY<%-^+RLYKOLIRiGOR%|%NR}g!O{Fj%4 zlttv5e8D*LB<-2k+B?aReFKM9#28}H@>b}WPwEP>Iy<2IWGd}QW+WcB+0MVxd;2NQOiTAdbgmY&HUYY#(5`(rOTpUdbllN0=7jeiV1Fw@1gz zj?>S0wBJg-9#ZavPC;|1%_t?)J3z_c)PzFTKRNENcX;{%hdLCws$;tNf8&YXUT(gg zt`8^Q?}LMfrEPbd-S6+;XS}xW*C&V5qrN*_J6#{oXO*F+AEj$PSvuX`Zfzg6&$`^+ zujkkMiw}p=U56|`bTNze@B7=ryxnf@@B5zM-PTWfO?V3xu^K|`gl6Zc;-K_td~OB8 zyM=v|q&%i2uZheM)Q;07k}Q5n#DnZ2aM_kbwmlnxgri9& zrb0`-FoK&gEttp>(`qzria(1lr#B@P zA7&`kCj4MP*x{fG*I;f@lQgD79A_Tt!{OLwLRN`k$kYCa3CF_RcQ?Y-7ssLPLEfG9 ze)n4bsCKeu>vXmIw(-sf+iaS?zuJC&oC)-m@aK&nN_%ycVM`{}_mwd0NFrfDk#RSh zNjC?24IDgZMv= z!=9-JU%|XjHksZhSi_@q>dQ7mATI~JisXUZzMPfII6C?dgyYZw(g{||unP*E+Q|rq zl)lxIg{Te?^06^&l+%KtG8S(~;^21F6|V#!EwMAhW6DQVO-t~%TNAb_QST6i2%+rW z@1G>#N%9`vGuDIRGq%Q)n5X*&$UN;RZS^GO!uVm{fnNM@s^j5_B{`P_?$MNc7IaHO z`?n1Q7h?3N>`&7M#F&>?f=TyUEFh>FQgr_Kpi5R<_b6~WUbPSun7VHZVb2X1{9SKo zqU3KI1lwQ>H=~|f7D8<(SWkjx!tbDuAM}TI5}urfQ4A`xR*tSg=BLv)M8ix3K9SaU zG6d&uJTn>=y3R&boljNMiaR~aR0~4ROawKi7GiWCoYlu%s5dY_M#JuQsJY_-*>UR4 zCo$rMU~A`5E1=V$X;1h9=E6Kb6PB8IEExZrb76cjNb48?Lm%ajr+m9uyVl=saOi?v`j-q^SstQok(U6eVSQUuP3zE?YfF*rcgRf#S+@ zt}?M;sidt~7yeeEP*@MfnGX5yEAyjad>#JL$=QW=3cMLFXZZ#S?o1)x&AcN zSpR{n{ybq27!DQ+o(5m=Y-6X>Y3s(f2#If{OkmxNoA4)!-bAE`^|BUlyL3?|&_FtY zL!hl6%;}u!XZEd%(zcb3e`2t+`k|oMQ4){(yXE*H`81y*HyldN!5jr1g1xH&Xa9>w zn?(pUF^*Y1))O=sj(lOJGZf+`n9{0b(>*9!;1RNe&9ytr%}5p99-jM-^!p}I-jJo+ z>9u1>Vxjxw2W~Q^%ZVELLLAM$!^jClJ*6Oz5FlGo(eG2L<1?Z)%7z4WNaIy5bBkSP79~o1#yIJBYS{bRCIG)Z_bQs?f)UO5Lp?WG&7zp(^m7SHA z)|FhWgNd-xy$EG?*?CwC&?L!PAHcPAWrOVf1?Mv&)LFCUEi755u zS}@C@#vtoMX&43bhzV}>Tb1@4;F*)AN8QVF#Qm=UZA=xS&lzGJ&y+{<2?<7Y@YvvJ zKwwSD2y&BFh07_(Gy4KY)Q*I=p_^_!7E*A%q)3EIx;lCq!;hx18oO1k?DQ}=V=T+- zS#}OYY($^3HaWzN>OCDW?S;BG=$Q0I!R^w8LtOZp31!-ycz*~-0M0@);%5{ebH`3( zx2Q!XFa<&kQrJ6@3y=UKgnGjUOAH?v^!S!9pD4nX^%pf~^2ad)SY z5egPQGK!h@{?oAylSJEJ>@O!cTaR$%pi8OXQjbJr$FE1AGjXA&?mVFpTH{HL_w@S&w)UNA3$QG+)Vwi_4;fZ-x2>j4+Ma**phX|60>JLYi7+q6{ z1X)cxA>AHvxEr>iNF6srokOK1PD$lmKHNDI%tMgyw1w!2_qPspMq61P3q$~fZpK|< zl@e@!X2eq#%=swjZ^LldGl!2r>lSZPP)Orhb zSFj0W6Y*xDU)O~=PJxH10A&Pf>!cE^jCWf<^@9`3vK=UxmD+!BtAhXGY7|IXvEahb;{0 z)mY$goa$hSJ-RfCgxaeP0cx_L2=8tIjx(MTtxSM&Gf#PwC>aGJI+q>jXDA|<1o z>Xf%0i@)xqT6R|^Zx3AKIxri4|MP;JZ2v>1kd$qr$9pRre8oJ@{LY^b!T~^Fz-TF{bx)~yKu^-8B-Erd9uSD>tchYN&YaA1@N#jZ9->hKaDOQf^s1(8*MpEQK-A( zP`L6|-pshsobsfl^3n_;`_@y{vRD2~gy4*CTgmd!u2x;D=F?tmwrZW+1TfbyJk!h? zt5yg0bxpZrgvK1_vz%-2S$y>FOPYjsp@P+2wH=RxEWd*x#0e1YPVuXQ?ev_L7& zKS<0~<_=aq);HeQ-!J(lnOcQcoAN^)e#LdQv9><%&)ccBy+612PlKnjzt=#jZ!vQ? z?;Bmw+q)^YKle|Qp|ZV6Y`mYh*T=`JvA*A*Po~@-EuS&uy{9+wlC-?vUksC(t;eIi zNc+lzNtuiV*975MzhLsGc8F86tR@Am4hR||$o{~ISx)vzHeUZ`o*?dCD>BRvv z$urjD%GH0$2yKS&-K#gjuq*%e*!5CuuH+P5H9Gr_0kvCR&sfG#5B9wd7t**cSC-3q zL{W@Sb6uFOjJigbdz@lMiFGPpcRvetD!+Zh$eL);Wu9Ew?@2_-XOqCr5do2YWoKbF(^VJR;?fDm7F zfWMDG)1R@$JJuye_JD~2Tx~7E;5Sa;o&SJ}@=HL-$|}NytiqzzIoB^lew%e~xMGo) zl*p;iy)w}DVs1>7Otc&%A{%D~K`x;I<dj{=o=mXgZkSR84I?7dzd^f{G(@XjFv-2 zA&UpDwUA$0CVfD{>GBjqX#iQ|mjJCfzC9M)lqRs`R~=atk||})nR{YKq zXmrx@8|S++;^N*m0vs0EG})0Srr|}LHW_mR82~Ao;Brq8O{l>$CSs~m5?U*x>mHvU z#xkWymPjfY$V26Yp@LpN(6HE+vXnMB zw=GhMd?c~;q`Gvk$6}pDvyvQqVMP*_*e~)0Ub|HW59r~&B!mgT&%Cm2Xu*~n%xPqe5fEZx4MUFh07w1El(DLvpr{wsDF=t!Wj3$#;Z~c!4*;rOB5Be%RMUJY8S>pb9wL<(oXssr>}gCnw2^&%?$uudquQ=zt~ zkOBtUocLV$9D=Dbihh}L+lhT9z@2gni-mpiIYs?=&rzk*I>8W}9b_;KggTSiS(eYi z{#*2$HaS~CN&4+h+#EGjiDrTH7?|X=I^yL>ULY^6gS>_rE|SKQOf*H?W8|2=4liA+ z;ywZM+6l!IH$O4|zwmVA@JD7h#)~U6x8?Y_?My#+vlc_V#mM_^SK}3`;5ueWB~OZG z6?u*Qpw_1@;A2u3b?%x3qUAMZ=`r>drW+P4PJx1z%|yO=(9|G#Es4zA4!UR^rVOU)-*)V~rg zDJT|M>5=bdBB1#yMQ`%v3(zy#dc;Y2I?Zp}l}T;&SiqkFS-Ty5 zL1Zn*MJ)jb3?ZfX%m6T{p^pb=%N3|{P}R59_4Vv|vF+T11G}-V47z*PfX=8gP&CgS z0z@at0xc_T(U0H>J-_|vK|3#-)}S^n{O^)dBS5jSN(cl>UM)PH(i^NIS#l$D<(4E3 zIuIOky~U2&mSgm-fSEb=lW0K$dH|36$I+Eic9n#)?0CiIfuKNvJg@VZ>twPOt!2fI zk0M1WIW$ALEWPHkT|Or}lVyw<3vB0m39vAti^q`&e{KAaB|b@WfZ~v*3oSM71tRXr zn;-^QnD2(Z!xBX0kE%RL89PSk>u#8k;`AkHWxPYsKyukv&Rzycv8?F!pTe@PSCW|% zH0R&J#b(BjDqT9FV7e&Xvhv1<&L8`#pbwEH=3S>5g^_3for`sOm1jb6nGbVm5 z@ZlS8>RznJaDPZz>OaKWtxYm3{(hV@nmfhs70wNfGAnE%?<-zOt$nNQ)%@MvPjK(5 zt#jp1J{$!_M)s$)tt=4|Q6XTUJ9Y)ksQZ=+1tXH%BjDPOiGhP*fglO*B)GXm-?K-hs z9oeAx6W{uz@=-ZlJ?&JU_|#fc*9doXsbPf;+!@_*ElTRjNbJ6P{bixwo5i59C3g); z-O{vMyiTP^l}lGsp}I}y{90MH_uyc#>K5Bk`%dd_TdSI!329}H{r3en?^8x+Lv^%# zkmuz-Sk%`!5gl6{ty)VP7>KdSiDw(O_Mu6bUmkXo)J0>mbbutV{}>HxOawXko7&RI zH0sZ#N9AgR+r<2n-(K679aYGQ|4{2ci^_7|nJxQtGDN+eDH>6XZB$lcVrpW|l@bdq zru1hWQV>qb`+#lwHEUU0R91Ck0T%Ow!jFsb@qxi&Vi#|6q4!$-%4!mqYah$o3wjvYc@3Jz*L3dj(3qINna5`(a^nRaHQ;4Yk=0tMnc&i1IU$Qxc$!H=?j@dI81fY+nby&mXDBx5L<2-QGzOm7M#}=Z{e@pIgF` z`8Ygl(}1Ng{2vu1l;L{Ge=D*(Is+i9|B1FEv!R{k*Atm)A_xng!6>&nRKrw(z)v_j zEhkafi?u2jlgrc$A-yX#a6y!P2~STaPjq8NlNx)s;G%1IpKdAzV3$u#14Seffk91> zzB|uwctTsNcXvnb2L5Ng|7X0wHAdqXm2n|Bx*!w~xJ^5GzI2*~%;NDjuibOk^L{=H zpS%`7-Tk*FwS#ue%2r#`+EcqXXMFzM4!#4`#CH3__nU56E|?^8VtVy@=1)il#V`ExckJfIh)=<{e^yyqR$M~9n&AR`;qt=n)`>C1ezJi z=Ju;&Ok|2nGc~f1ncowv_L>$P3o28rSOqc~D?bd??c1E(bU6-WAx~OHDr;9NOMx}R z9qLo?D`spZkq@5{Mx~&{`aCnseeI`g$_&!WEbIVN^L8rwUpDj6;K{}qca(?unwXAr zT;rvm+AC#Gx3+Za*GWuCA9S~v$51fw?Ifm5C_#s*In~k_-`^(xDoNU-*DCWZ!YjBB z@ULL231PrLS|EE_b3{rt{syx(n=fldT!;GOiOIB8nTjuT;;^D48Itf69!(*^9MfVz zOBJnuz~ny**YGtYR#$NxXV<0i$zDMq(C>Wjj~XnvYzS+|g`;jD4&ZBX;X(vihFm+h z;m&sde(nI?|MX7d!FY30LZ&jgaF2K56VOGfma=81X|-+k;%@ol|0#5?BpRTZSH9{= zo3-CNDhG+~yeWFeoRIHp#F&U?Zeb)TiztqUHMD4N5Cb5x7f}#{+v_|N^aCeJLzwQB zm2{!m$Bmj?I1mN5P_L*i4viSw!iqBsY??&E`hxA{*=5<0C~W?b$*MqdOKno`<;*|j zGIXRe$J=8#sC>oL&vcXhVe$>q!Uvs-TSQ4?g>a^#oSV_I)^IvH-S;qKY$l=+C1YpI zAX7NF1osbkOnn|J@ZYywkg8K{hkw#leD4gI`w~d~<=jtgMJKx&+UW==0JK=+sZ#!{ zVz3_buCOnA?3{@{m{)fB;V|TTCk{NvM-89Kx2X7#u@}-%hC9cXH4*ombE;IkeCKh_ zATHfu16JZ%Wd5A@*6p&fAR(MYw_q z7%aAyM&^iz%EUKGj@%tDq)PUQ$NC{K?`6=XlHQLrBq73e9UXZaN(2&a%Sxa?#)O{C zi52gS(E804R83wmBa?t}Y`F}L#D(Kq#bU`y?1WAc?k+xQQk&G-rn4GsZh)5qoVl^ z*Wwo!S@5!0W&dqj{;X!x4lK(lT&sB5H^R~#{3n-Z!t{*}(p7<0RwkmW&LY_wMQwbP?l(@Xh0}91wAgYFm|Fm_I_bkM!v+=*kDDyQc ztCc4;p^^e5Iy*>I7PKg>Yw-7rv@ubkg6k_lga0U_U42!U5KO-;WLO1MKk8BU@t&x3 zZ=$nvsC1dmI4i-mNtaEG#dcqrW%MnawtUPXMTVx<)M*E1L`nvJ#_oKqzW~Y9n3l6H z={2!xrgfOCTi{JR45A`_963{0k5;voYNX#gvzD-`v*20(VLM!($1FlvJalk!vvQHr zNKA;u&WI~Bm4+rNDpVXC-?b4G3o|v8ge>=}U_Ux80vWDfg@bn1a4(7oj)tRzJ}Y9} z5~bu1|gf!OVy ziR8bYjW*#*6WF^+cdty^v zhwsD~ZF_&dw)c7tyS?@~YXPLYgu#Y!XLV!ZT!ohy3TQQiKfBxUzjTgypC^q+CypQo zWan<|Qr!H@K7^|)`y$z#c9&{k2Tp{E^Bwh65H_2Ur)A>xyn4ulNnjS%N&cwFc_zQRUyXPM^HIiK& zkp&Fj=~7ePT>9E>z&M5X-N)Nu*ZtGMbfK52^Or@l^rovyYpn{~`=Mv$hic_tk!#P& zQPs*&vZur4Sy@@0F1M$}xBKtwugwojD))!|&$m|Ho!)lOm-pwBtB;F^NLkez8yj9x z7LM&oS=S%#v(tyshf&`w+gV$k-R`dTA192nv&YNQ%*=})%Afn|?a7PG*_YPS*Ad76 zq3oO*Ghw169NV^S+qSKVZQJ%6+qP}n=EP1WcCz2z?%n=~?yf$ks-7Rc5>=k>k5l8E zyswj|E5<4w$NAv}Cqds>EMJ~gT8wmUQD(Nmm|URmpH z@RCGT+(kdUq{+gAR`DBWe=x_i-8n@F6%_J$qgj?UQ5)%2`Y{Hd++ zwi!N|hju~S?|F&ew#CPb$rwe>d?m)oTz|!@-(11p9weMAQ#oQ474R}b#uA-|blpPr zll&Fm^YkDLDHVNf?=<(U7Cw|?;b56>nGZBsX$V^*FjOs{|9FL9^2e}S!`%8Z5CHN) z%_79WX)BfxRc#GxQDc*$#!^2~@uHYFx+!aID`NNJr`MMc}OtaI)3a{@)fd6tMM3!XQ1ovf0-Kf z1meK^^b6t2K*{geLx73WqhT1RiD~D-DfpMsA#adTnL;u!S z$eTZ2DpIP&%Ntow);E0Y-P4h9g5XzPwO=>U%MHvA zSx661KVoRu!HDKb1T}{CQb1n7E@i1$6Ulc|VY)5P`XEy;F zEOTZEQS~L(t>%PUv0;%#5W3(qH*gm0i0wRTl-0lbmkO6sd3a`0P|VP^g=;FW4$2h2 zxrTYeFXCOT?86W+Q{pRD^UmCO=yKY^VU_zDrupCBR2qD7P5WP3qZKcR^ln5#rnmuc z<)5^B2JP17e$|M981zAOTktNTFodJE7w7IKfU~9RKL*M*;r(Umvw{DD6l+?FR`Iz+ zYESD~v!6mko)g4T;h8`l#s?fXe2uiWaJfBj)kTa5~ojB-M#x#6qv_8edWn?dcq@ zS4gR!H=>CDqvJ}v(-qSVY7}b3tjF$>NW(LiC?w#8|Dj9#8=I54g@=0C1DFu`O#jI+eLoXgG!QneGj2!C2hZ;_;h#0EMv#B92~)mVmW0m3)%@M zw>#|+=%MJNc6w@D_iki2G(xRwUF`sVgic$-FD0CA2u&XIjzXPC%}VFwX1H|*3gETD zO~5Oi7P6--iXrDQi8O@$=MtuY`dtnY==*|0dsSbhwYjTgqk+D*v*i{@j)IZ7{ z4D8E1>r(=8c7d!j4Dp#w{wA;^qK)_^ra zE*OLd?@WF?kaFbMrccBii{>w4v@x6UC|6u}mh&2b<#SN@evz91Bk~WS(@Fv!Dh-^W zV=J%YOUB>0Wgx67(amY}yBG;gd{@6-=;77$xl+PCs2O@}f%iV6;As>Y)p>_>s+kSk z#=#JFmPgAH&_1%^kCdQB7iQj6{_I65MFb6abX^9!jJEbaaF zZ=_|iUVQq|$C5|0ES&hmk74%E`ia=-m6O^sVKD?vruxY%Mq~Eo#u}{P02$#8LNk=<$tl?G7QQ3w<52ZQTnt754 z7`-Y?3>1!-*FY&o{23{JkuqOOnry_=3k_C7WshD@3`Y!<{l)f|tUm7pLY_ECoTJFZ zTX48QA@ykO2R~21Gz-d+QmbCrx)?_191dE)s5XHOvHR>!OCHwqoMx z@!`T6jB4mh)wJcyXD?Q(nNM}(d=61n6tJeYO)tMj@Nlhps z>O3_ep~|3fwJrLfbUuHMTdUP7mPDrCt`^MqJa@Q=cW6)F2`uhS)wzXOM8`vVVnvHJ zfs8h;LN@Q^OC`Imq>Fz~1f;mWPdc-C#!J{{dg91P81yW zhQr4NqVmZ95so4tMgji`$NPOsLW7=<3tz8**PokjcAp(zu7IDL^jC-5z23fFug{;4 zufyfl?(FUPMn!)9Pt5m|Ig?d@_(8u2mvoG`ARB;K#5quk0?()eV*;L@efKw@uhm^& zsG!jdngntzeY8^5&HbjAfKfo;>$ylX9WfoTU;mcT;g0}czt7hj()4n2`TXsz{qNex zI^td4{+^$APyZJ+esx{h(FZ#I=ZkpXj=$#45I?D@EI;b*xbK$Cf`;@aYez;Ky?1&R z@3s>ec{QF9HPY#7ZPB!NVHA-j#I_wn2!8~YA?SKmIEocx#@^nEM4GSuuq;edKR^-(0spPg z;2DL;M|HcbO-}twSJ8sH{z6r@d8TAiZ%w&O9ZpA<$VFbzv3 z1lsiEDw7bJ@}Ge%h@Y__^mn%3J{BOOvt9%c(rY|nnvRGb_0q0o_!aaFgJIS7S9Jx! z>vReSn3t(@KsVz`%JOcVrB(DU^Dubo{3&)Zz7w7E7D*y4gltmXTGwn+E;Wi^z0djM z9XenwY$T_XK`XY}{o1HQdoJe?uj0L8aWx5FSz#B_4A3bCie~0}L1=vlc+rc)^P{y2 zE~?$eM9u!#ZCvLSlKVf2KtDyZZoEMp`)Kl!C%)Bz)n%M$;A=lO^_r0HHs<>Z-V2K1 z{O0?un;$x?Pdyo{<}2hZzM2xM&2pVlf9r8?6)7M?j0Da8QY-WXNJe52xR+jbQ154B zDfdxT`~909H#W+9NtCvUR{SE2iIuQYF>PLU$5n%ANXrtZpuHHfR>4Rev@4=@Gb|;l ztkTXAPWNe($X5?}i56Pe;+j86=|L0aa^_oY)2&$A;+@2z2JytW_w`hX<4?Rmgi2U@ z+A34*W3a=iKt9WL-dKIA(%M{+TXs-&-Pz9f#_6+;UbPZ(|L%tv`&UC1McEdeTXlK0*NsRSZ0VG=HS*m`vpphe6OoKL7C>rWZB+qg z#u~(;l%#QP)@xG~bSXE707B{y9Nz&kr;)8ffi(8{q3tpT!LjOah|Bb!uc6fc=POXk z{zgcgjXLr(w$#&wVbsuIRCl1^hepe0WZ&hP8qG~Np-CUVzs{%(dwt;S7+XA8ycf$! zi@GjILT3>%asP$?Xld?K=FKUHt@cCHXi5$$WtxvaL!yNoopG`6$+~{gY0%*Iyo?x= zOx*404rRC744I#`!Wn-tgs(7Lnkz8tNJSOXWUZv~-y|Bmw^$*(h0cs?K$FZC>0siz}aJ}n9 zG>2s|c4^c7^-}e^aV-JGxaI~L3VfL)11z4dFMP%C4^}U|(Mpw@7xaXf9qUBhQ(8XA zov!WMGLlob{4_=%G1^}?62g66T@q0mr^$^hTat0&rI9XBowikUXMv%=3o+!{2PX?p z2|_mcKZ!pM=sk~(qYU6-1oAN8BgoER7(3N_WuF)09g(#jtWuG+2X;<0-tjl(>Urfe zGmhXXV*L;^L$=UESLjYdmPX{?0%I1DR^Z`wwW`BfaL={E|G69OinsN9qEdapTf$AH zrK+3sOe(&8uCeDdksw$!9+Gy_2b;v8c^Ed0Mz^C~f(y{3uw6!E6ioB}Rv$+6^-@)w zZ{LdvL`bOI0R;C;{qf@v{s)yK+{!M z5ag10F5%l;M|CV^E*>wFxM~J+(=iddTB>dp!Y9k@jU&5Cd)Te_9e<<=Q=C2B>3x{L zZfhYAch$P3BX%;FZFJe^{M=Axllyn7-?!-7mI_CYS(q_A{`MgepU zjH%8Fl&(4xjSo=g<6U#EcrHmKZa-~#uN6#7{O0%NpXOWZuJ=`QT%;`HJyL;=sTODu zvb_kP(c!t`QWm84p|iH+ypRpkywfM;Yuhd9r*F+50*lw)ikGq=}_?+W7pF-toBCcKa z5uT?7JDCwMLpC=PARB4VqHU#bre7ht+IXvnd8j3q0^Qd4Pql%ALj9H9xUo**(?+^N z&Ap+_2v#oQ+T@wrqc0@J)3we0Hsm#FUkC|VV|w%edtMirw!F;h4Ji0colQxJz-J{a zIhFE9m*V$%@&PPMK9;sM{%&#Ibq(CZie2^BD_bNkK)g)$R?{w>`QE%0yCDIdp3laGWzCsIS0xM@j$!XBq^>@t-B@jG$ zO~#C08p|KHE)FwsF+A#{Sgp)=i@7w>@!WrGr`$w!O`SL4RqVzOK32SGMNG2r@SZ$! z3n@#$rM`(=$YM?Lv*?j<2qD8L6hqwEAf=w0?RZb3P_s`}7zVD}FEYjB#5bpv4dd!l$1sU>xKJ#B42={t>`ai$FZ%)z^9QJm11ES+D zlgs~qQl&D(%%vGVT}71#!oXG`a^uuqOc)c<evThj`a|`%-T_hY9f_2rQ>KrQcSTro$U=`i-vY%OYS9GkvKlTg5(NyxY86}qIyDV?$qcM zjbN%tMBbcw39S0s-VabkJ<5VIIFV_u#IA%G-g>&0aiZx# zQUQ{FGs22TK5*FjBmIg}LP^PjB0DntJ|;gfu-Tu0QZZm_RBc2RJOs~eozV8eY->%# z#qd!tKpJVQCu~;h=n1KWs$D|XeBDvfI#AoT0E?os7Bn%2E_G=7W z&@475Vj}iUq8?ONg~6yx`FdJr+&M^l0GtgT;jz=#H7z%`I4X|!o$$^qiEJG(vVeMy z&;?}195Jq=yIa&&^XU)RqKID^={lmGLMOk|fr+*x=kTH&xzv zt^3}#g;-;XwbGfaX+9$*NrMS$I5C3!-X)k;2D8U{1Viqmjq-*QhEjE)^rs*_~ zI>T$ZuUzd5ctWkNhhf2t^v?n@0&(--IJOI$oRzFe2@y7lZGBET^&z!GjH@B%EZatl zFw??lYn=fMV47JL=qajSeB^!%-D5H-7ulnF zD!1zK<6%*YexRdy4>FAvh%}1dM$m6jL`q-c_;CQ!m%GhEnznyJqA&lLk8E#ObS_)! zE*EKwJtE8VR*=9KH#87B-8nwwov5vRO3n3U_Oad_W6K^dQ^HN{<(zAw86YbaO|2vu z88nP!1eq}|I=accc%x5oyXxZ1#mbSbo`DZT-BetZ&w*^F%x4FFtaN>@x{uJM*qgp)F za)!k8zuQs;THh1@W1s0j>(CkW`<(U#jYITWUQTx@6Trz47*j7uxOvjhA4AqPGi^HK^#*Vc#&HIp$0pi9?o?0Gy>MQ3bpLqf&4Zf9JX_QE*l@(XF@6}Eco z+(26==7U8Mw`1kLUxy=+?pyrX`@B7qlcCUDD1s0fxrBmABZL9td2%|v_P_bpl}BfE ziL+X=Iy1-Gq~FO~!cFgb@OQq`yr#W0TWwh^@sETPj{#kW0Ta!ANoQCpjxdW$h3YJi z%L_G!IKnna`^@TFKVo&|pRZi+!YfaB!3g-^D^fp7+MK0<;>prfL~Q{HX;bo%Zy%@-l8i$> z<+tBw!)w09=g-h4-xIpeNdSLlSXe?V2iH^jRH+=-tltCCH7Sv5wDsW>eeGOwG%**P z|Gn)N^@)?W5XNGy))=R1D1WnmGQo5OM-HZs9t1@L9&cm}cRArkvNVkmsC^3f?ci1x zl51eFG_fGu#)@_ck2G|jrCIB`RlEE$0c~P>gJ5We)yXj!kjk~>xg#ipAY?a2dC^$P z1J4F~;>j>he%>EF@n2wCfR_Q0aCY*{#f1&%IRE~O*X(y7cElu3PYiuAncZmY(rMV! z+%~C~%ynH8Gd9X2%|N(yuOjXti@WnmAKq_rqAm0x4jdp#T=>-ev$z=8T-IOi0r{rqJ@Rj zGl8{ifKztdZ@lxwOV3D{`(^ajk=H-vQSkcqXhyqT1%R=zO5~we)x^o@dK#fo3R-#` z=&>=?`$#oE3^k0EsUIoGBOt+F7Y1weWjL z8-rZ##we8c0Z~x~hS9J$Jd_+cS(~1P$@&OzYr~U29RJcJcpwnXB^AuVUOBeI9{>y; zjce%eo^Ek(ysxIX0hhiBvfqUkRdxwz(>NCw0;o2!Tevejup}4=iTD~JsdW?o+3a+= z8&;#4&qx5=y$W@e{1Xp*b`pg;<{wJBVhLYVte$#6v+tcJ_OW?y^e*GC$lk3sgoz9Jr znhsY6M#6X^ZIWc-g&`*5$2qe?Y0m2PKxr}1W`1pA84{l$7Y&oQ?`HbDn|-&;kOvBjKe zL)bd)7;Mx};3z0MI34WFHkMq^d;R;2yIp{Q4?JRLGYO^B_#^ojZ4~w{liRk@nP}aI6Vhhn4-@&^Q{>{pWAT&kWn$#3d z{66;BG7LRbQjiiiWt7@qX8+1a*;5c0QPeyHx|xxIiR^)%|A1iO2deJ+hYt;Am!4Ak z<$mGcUmtG|30CVw>wS z>FF2vb!smYHLM^$QKUm&IEoEOX~!7KqJYduvm2k_liKk14<15er;Ic!gppR5pu^AX z4o#Fq#u4cVw@GYBGT`F0M%{GV=cuDbF@}~0=G?b3{2cdQFVgBe5%mOjM>GfBLLx~a z?Ykas2CDk}UZ|yxIJNU%IGOiD3JCR=_N3V5JmlHd^q}z){zeF_!>1wgcicmNv`Jc{ zZB`Or4g^mUle7*)wznqJO+es)du`kaM2X`>2hjx!nrE>(AT$-=oP+T_-X>p@E%T9q zB$T}N%r!sl8lnbtGqh253H(9`g#1n21bDtFo7M1Q>ym;5~V0*E)A_(GhIPa^mlQrFRLVf6*6+^Ao<^GW{&@=#? zq?R;B51^CGGEPQF9q#xwx`7@aP4wP7&~<8-&BWaQ)G>Ghs(nWk+RJ zEGj|4CY8pW_ruZ{rRv#FK5(0ZJkyd`O5`Jp2^LmV)>%-PSot)JVc1rO3z0HRq>9NM z4$+A1Y+6BD#4)9fgC@KN9M8y_a(kCrEWX9WjbpBFYW_RK7}k7RkR1<~Wu4hoEew{? ziV5Z1{kS%`&E+^Q7e@bKbs|7Qs*t9Oub7X16xw#dN=IKghDv0Xt2Vz9r{I@nv5=tK zI0O=McV~z;1F?~s3Pl+cOEY7Rq46`_es)smrg9_N<9-(T6$Nkmda7Cub~EL(e?`W| zBk^?jqZ}GEy`GyRloXd)v)0gj|Er`Eb!;Q4mI%(8HskN`wAMq`3)|^yY>xEsuo3?|0p1z{+|eF=3gO-$tIfmRK5n!fg)ahtrtXH+^SwkA4+d z01}au|49&U(n#W$924qG8{wDkmwf@hx~I1{$WrB_rK^u+ZgGxIV^d7OHoFLdzL{~O zSA)SK!qc-){o5V@ zqciv)NrPA^vgocJN@Y{9-8giRHnH#M%d1kH(a_43{ns_d$;{FCPb2 zJrr!Ibb_l3xJ5TyP@F(QAU9I`9&p@(*06RdYbV=H!Zg=ABo#$SX&txSlEaf?*D|2Z z?Ou~?#K>C;Ct!(|U?Z=68_PksfAhKYc4TB3;q}G(^_1ayhGQ^?8zYLIgNYK#)*&ZE zS(6VVa3lww{_A`!yRGd4+&gFjZ6)gBMjtfEN5YNzgDg^=!V70tTu+RpZ-xq0Kj{V- z#j)h@$B0C=x)JLox}wrWff2$%i41>gw{!KtN*`gKI8hLSs}D9(nbjFzM7H#hrYR^} zl4MiFU=p6L^^yLA3XkDmxXAdRI^j$y0h1!Z6za_TT(#)!cYWQ21LJTTn^@=#<4$@?uUf2l8-%Av{3pxk?0Jq zHWVZ+EAj}`CzN-CGAk1I706PeO(tK482=go1q9GQq8nvEmcj1x}uje!R#Eirac zaoSBW#JY2yT*+U|OO^ZJ8~a?Sn%7X9_N^U7KSU#z2Q6`|MI}3m%kQ1+C-nE;KB}0g zt)`tVzWy=eLAAZ>euMgYX$C@G=S^otQsLwo5oEKe%uy0z)bIxJ+`lyN&a)5W9u~bU z8EzR#Qkq+7gLJwr$%vYOq}nr{KYBf{448NMN!v>C=N~aLRs+`!yOP4X=?Z1#SR>Yr z3P(w`r4tmzPNO}l?-a$qBMZ#8uSsBM6Fi*HwA6>rWNzUtiTPVF7u(7Bk76oITUY3g zCEINZK^qy*v82qhY+b=s%F>=Yvuz5CD?z3%$D&NS#uId>mA1?>ZS%XD_Qpy(YlP|I zO&2v#@1p|A#JSgxwwU_;x)vwv^yT6#Q27;_`OHa^4Q5T(14ROgn{*P4Z3>;%x{t>Loi4?_(zJ!zFhHZHc953d~ai-fq3- zDyx%y$khg{S79%3dDOX-4vmSsz3x^q>KwYmv@m0V zP|k8t3C79*A1-Zw#Uf3OOg_7PNLRF!gy{sd)VjjpVz_@zEFGw%)-1vd*Ep=`)gwXZ*T>kpG_FO!SY0oS zBZ&(%-X4@)*nT!j=hgHYT7Xyx08&;@-b;&5!v03?Z%;$>L9%H+Bu-rsTelj+BweR$ z8Um=^n3T*4YNx_fu3K4s9k8rpov*)!IB_**K|r2JNLUQjn!mjnjJNi`-n<2peMgqI zC+|d|-&>cI-I_Dt2Hk#l8|Fus1@OGvtyx%UHmrS2tI1sx1H`#cHPf!tJ3pV@^jRfj zmSnp9`P{@aZ1xO%boS5XN77Si*OarT7_&-+b96_)(<|s&pV9QC+=*%S+5GdJ$l@Ze zZehElA-{F6FnOw^zVIJeaVdk|y)gpxG1!E}k|D z){BOY=TH4}#tM)_{;T)USr>&bJ;X5X@bnr#1K2cKuLTKh<(V6`<|Qu8U638)I z##73lBh)*3TLH5tO{>e!nw^{ay*6c%_Cn_WlQAnE=Ydp zfpvqX_&CNrR4U+IG7*6Ss9NMAKk`MdV%74Kjae8Xhg$4d&5|(2FIHs{3vu_H&=la+Yb1$+P8tGgGMgDLcoVK843dK3LSVA}sFVmsUkSI-BG`VTY0>;qcY7t^n~oM0e-;z_H)fyq$9ooRQ<$?H*2FBG zDBrRd({u^LqE;cDDrM})omcg5zAFag^?JvOxMrCOt^;+!dFRP{eM%b9&+O#BYQSc# z_n(4J4i_Wl)e{8XQg0j4H(PJuN^_3{2_PzB>J{Hh2=-)b*@d~wR{xd#GMzCNrfw~N z8}p_=6?i($@jy7*gr~uDFTh&bnL}ZjN3_|S$=Mp9?S~pENDo5%mG`fF-`iviRY6J7 zKJji9gvCi!x;oL@9QOE(6u@G`(uMYjG{PpeloLWR@%i$@Dngr1MV$52Z@laSfjewp zd+*UXr0w?w&IW3yHIy(`B78!%y0LB-X8n;<=g4>RtETXyjfy=!8mY9}Bqe?}L|fsw zaK~-{WA?$ zvdaT}`AF6T?x2WcPz-gVtR}W?gQfyT4oLY@C8zo!pM|o3BfTPpM;_jI^RcBOzznmG z8L5hF>p0#Ob1R0r94vT*RYL>A;xI&+8PAeH8?YO`on3RU7+&4>YKi4JcZ^gr2snI$ z7k;|DMxl9ikpu&h*r_7P&k*A6b`iLg#6i-W-5I&!+?{ZG~5 zU^#|5`@^PZBCxG$kNtpaZ$kNJiLjIwO%mV>l{)+V9PM+nPJc<6L$7+{^Ms03t)19Jdd^>w)lh)5O+O+%l>N_48GtGb z%`>v+8q1^_zBF)Uy>V{}9ZS9cJs?4Y*~|F?NTdl%rCuejWiMXH)-}_E`1Qe5R&Km< zPhZ$Nah`%JivX|5v!!I&Q!V9m-mua)al24ayYh_^x34hOM=3YuccF5W3JBG-YZzJ) zk9CPNmQyPij>xWh!A?E%FN&W3bj#7dOxmb(_HH z^>odc5?bWHo|-1%%xrZY6=d?>Z*sLEj$fa z&4~lFM29ivNC9A;)lm|OB;aG5g$Y?L!)BP!`aq+|DQ*?6$OMV0suKsq5ILgmwbalg zC)(+E7D%#Q(Ovw>=uzluTa@MD`-f_{7ncIP46ANPxscdJSM5femoJr2FoF36oel2Y zzP!{whM^$*J@2REzFyCd&$GE_Ng&<*U_ahJ-;WOazi-3OvuES4{r-I>ExW(&-%kns z{l6#oyNZaf{eAu2{=fG(-JcPP%zKw7s|kdJzuk-T>xk=!zdZta0q+<0&);VW2}XGg z_5L0G{h#^Q`+R*qejdLUkHgOiVVy&zRuW>L6jQ`An(z-q^)>W)9MBv$2sXPY;v~Qu zfo(yS;Zac2OWd4**esOMSZQ7RCtEhZ+(jvoK%P82!$B z{_P%wWpjH_TDBXS=g}pew7K>i7N?JdLO^Y)GQ!%%a8Ia<8Bu~=^^WMpM}~qbrcpy4 z(T1n&)r5xtfv19NEFS59<5Vp40!n0s4e!%K`eCk0FZh{g!Lx+qm|c@i)rUda$q^>; z5x4QFqA_nKi;~(kuU@2@BjPH3&rNMA&s^SVX-eK`O9SvhUty8BqG^B|sUyxr{c-&a z8mh>~Vy$wocB0g(i^XpcNY+cnT802#(%1`P3M)stODy_8veYhoeq&<6G=?cj_v%Z* zVTW&0-7?Z_eN*TTE9Z`H<)|uTMLPjyfLN)-%$6~K162L1+_}HbIeqEQ^rszSU1f{T z2#o-Z5hl+Y(%Tl|=231m7n_@a9x~-U^9n1OEs~rxK0&}Qap4~&2uvH;=T;zo(gXd# zd_9S$8&3sYM0Z5&4Km;P9Z#FqUr2qqo8uO0Me|NFhT}#x0mNyxUxG-Hv244n*g^fU zX1KuBh_t@9wW0b}1Na zM7jE{Y7LO8xfeHvhol&}aV)KDtlE|1t=2shWb=JO9*cwTxDFIC4?og-;gWD~0EtKf z8iwla+54)jj@_4!;mDEn6x;KO*ud%B-DF)a=dreUS3rBseH-Q6arKDehc%)jRT*mz zGW6IRx!e#&0&57z%V%iaxng2^xagIkz}&_*oaBxg*)w)&H!q8gz)To{`;@c=mg8)?{&6sN8l&31dN;aZ3(w8 zV{f?Je$6|MlbePzlb`6HxLH+I^{(3L54ooZ*{4)7hNYN^U%#8+r%Y*9_(>r6L^dd0U#|O))0=} zVjgy6uQ}f&ZJwQ3cC5lN+o+?@WV8w}5t}QFG4m4`cqsKLkVa!jRbEp9;PIERDs_V8zS^72;yltR*#JRPQ%3N)j8*r+X~LDyJwkm9l#ct+Ub^Q#q3bIl zL(S|$HTxVnB*_VBG{chjo*VU6T>FRzQ6t$qU3(^~rAz^KNA;upjv@yXwuuK5XnWQ? z^_)#X5qKLb>SsrNhkpDB#(R7DC$X$z0v#+Gio=MivMkVnM{^`OQeH)TK>ysD%j=5x ztgZJD3D-Y=;k;nU-#s%?D3FDw3eARe`!!i~z7(3i`&y8&2FwD4q^wk6y6A=L$t>Ut zO8gm<{s32FUKS(z#S&US2R9sL#sHPZ4wi)d8fsRzc$1hYAWC#=g*5AOS#_#({{e3L zAoCQZ8Ei&oKLP8_1ip^ZW})64=Uj#8Xul6QU7_1x!F?FNM~?-q8{3fFlTk>?YKeR(e}B{SUXt-u_9GN4li}iDJ7_%>guJ#IUVGA!7JFtRRAl%+O;VL%`mwVOG zu@Te90;%lo3`RtE(rE9C*8bY0nx1x_4EN5RS$m65`X~R6uF`~T4U~{5`_kbhUej1> zq1gNeJ;1y41`Jm_P(NbCIDX%g!@s@NqDR^9+VKXQa1_6$UtLKqqm}#F;y>segR(4k zSe?k_IH#g|e!4&}??*v9BBW78D+n0e#?L+ViWMpiB5A z{@ID;e-m>D7pNie+BqOoA6p|c$BA24U8fM6&w{qV43Y5WHv(T5+r3)C^ZL-A z|Hh4yp?JLes=Bf-`(el@3}i_$V0Ou2zZ)AUk0P%|9hc7(cH|aqjvi+VXL}2X+ty$- zlTJB7-bOvDw&1WV+%>KLq$>^$T~9kV6WL`qRI5|< zYztc-RIEmZL2X`9)>VS?9{8|o4SV!7+k zB{ruSxk}@EqIy0Lhvd1j_%qqX#3gE_PxfT2g^y*VJaJJ2{M!F}r1l74HDt48h5G&&+dat7< zTXvYP4_#yKvJjbAX;bMny5V&lh6Ezv21wn)L+qj?>^$6!@-9tvQArAiaq~_}4zft`6&&i3eJDzhR|+9A7By18+>W4S z?>yOfuAB8zI0>ldO~tr+GR@k!{bmF*j*a7PZU(~sV=Cw=CW2=^>c?ByE40@;uD6Wo z5NoKEvQwRT;S7Y{#vQC8`-1r2W8YrJ^NO_S#9KfmF|-~Y@NI1n6Su?Lw;fI9`#xopRq{H=nyO2ZW*=wDDZOvsaNIi@3 z!gf^EF$hT;rG>VssBYV-vSK+e3kfuz)ASyVE>YW(k~9m6)LZ)`}$2<08>=J<#wa}Pz zrbA3KoWw+2e@vB^T_>UHuZl)qwj%$i<~yGm4aD3#m^D-wlCzU-g<+A>F!an)Dgil_ z$PKk)UUzY(d?SjByI-}Bx^)zjwWs*JYn|YErqo|_ znBzvAnAAe#;B#+83sc%p_`68b_s$gFnpuXL+A!SDM91Qc zbCbuW5P`;)4!oE!`=Lf}nw3_p?Dw<|ew2|KNp5yS@5LkA$R z+Z1qZkSU7#L&6^n%V%K^9_&p|z66qXos(LN74-{*a+8T4I~A)L%ZH z_3UA_E|f$n`ilu3A{T*3iAZas)}^S02Z<@~)GO$aHl>lGIGT22vBhW0=-M!r5`H1f z>4XXtW3hspv*YzRLI)X_LKqDY@8Y#@Rq56-OQwpr6U=E7uQqw%yt+4vS+sRI#~u1T zvRj{%lXDoB8K9LT3L)Uz|1dFVeEg?FsxV>emRefqdbV7h=2JqTR zLGc1A^UA5BRdyLfM!79DA$qt!QM!N-m&b*3#HAK~YypnS*xYHhSF?;ZlW|GkvI8=8 zn++Q2gsdG%+!n)sP)8(|h0v_$QS}{V&EjFl8xzTNk=Qp~MwlQ-2ov5gdR3oNSyb4? zg^pzrwfdQAzKrhvbj>nq?rN3-;b_E`FAujAu^qAh**-Z|x58w6Qj|e6c=ZffD?zN- zPEz4E0w^C9Mbtu=jG1>cL3wAXPgcB9xP@|geu>nNv^*nX2mk`gai`htf<+AJL6pee zhH)X24$=e+DFr_Ki!vC)X5V7YP5)Sd0G)X+fp#omu}aL8v5HsYSrf!56*7Vo$1n=T zLTLrg^jH-!bJz$Yx#^z?aENBAlJuZ;PJ$}T=~R-d+~my;0*5ln*$cs=E@sIk)Ji72 zFx3C-_HJyulL8nW^;U9ou9||(d=+(-}j#<^1d(VU*1jexV>g=KHl$}yTD}r z>3>qz@bK%;Zh60tyV>vI{e3@o-0i3F{GN`Vm$T1s@BHUq_~pyXW_EkK{oR|phwSZZ zdH)Vi*Kc2+)N+$*RX`^p6*}KwvuP(Yg=wD39(jEo{XIX&$xlC{MQ-oA^mcajb^3Zb zd(Y4ESN8fJx9^v~upjB{{JQ&op1!~L*VWh&d?6qzuLD zNOwbJB!D2YN5`ZI$s7l8T;;(!#2fV!x|?zu%huVw>}<<`eMv$62xGTOlDbU^U(*-e2}5_Cy-5VXWVA^lY}4H&@#8`WUxLs znW(>O9jd`4gYu;IJrl#Mgl-b(=^CAs8CjDb)Uhil;@7k6Xvo4q_gL!A0nq{G#vdLv zx4vEOo?k9zuCHL_69S~X)4Z+eoe`|0o9&;00a4{9H#eEJg^RasvPl2E8nlVqK~uoF zJrm&M<(ep;mb;*QN~C;i71D(Tae4t$$!Ah>y>4YWJiz_ZP1;-b<+kJsCF={cZ;}<7 zL&D!fKMi*9a7mC8r{gHr$e7{h@QGkZZ@@znAD-}1o95n&mlrUOecM+0d`EUQS%Qk~ zuL)?;U(T1{{rRm%{yJ+BlJ54~J&wyV2o#H^11cWdqR+0p7nS3(aWP523 zDtMdqLekrll?!pkW>4@-tXG1MDG7NHWx`^rfZM#kw89~-ITfQ_6S&;8X33d0sQocu z>;vR%%t@9(mxpAbrscy3Q`WKu!LkIQ8V zb6_HQVBxa75RtHnBcHsZ6(%!w=3&PVwQG~!MUGQ~9s#5_Nt7hHZaT~6lJHDlPUyc1 zXWHt-BZ6^61rZkUr+|QR%=%8E^q&K9L)_p7WfBU7!bz~OTa!(jPH_SYwT*r$;OUAO z2t&09H;-kSw-s-mme~!2WGnCj3r|!FYmVj^7cKHoqlsgxq`pI_%38=Z6uYYy$@15<2YK<_9Ers{B!RjF)kPG#-G_)N(kK$L>`8%{V2Vj(;)oo<}7 zdka^&(W=b>09wiqjxM;T+v1mrqza{z6dqW5rT6~uFu$Z*GP2~iw$w@I0ErTq^&fs-t$HQ{EgjCL3i_TiC>2N-Hw!N_o7c`*N zjIu!I-K@Q|V_W6kQQT6esVcdi)uhru?<5*->MS?DMOSZ>N)ZJ%fXM==9S zcXR>G^%(UTyYi56-m%y(TWQ$80ShYg_zy%yK<>4>`W!TigHIIq!}M;OTPV#jj;7Lm zl52@azBLDpbWm^v_a!dyfEi1)mddJ0io%*)$Vv!W;U^6yi5V#2R7WaM-|Z1dMG#$g z!~}}d7QQC9jiCk#a%EiNx3VB$M!PAn6Wgz|9U!&Yye5~U2Cs!*GAtHKNaasWCYMVn zSEtFJLD6Y(N~Uo$rF;709C|Wg7Lus6SZ(DU61!)9wN|RSquCf<-yI`xo12kM4t)WO zuXRCqyGUmhA5rM{v^J<)oG2&=ja0;bs}Qz>6c5v8`D&0R*tq;0#(jT;%v(E24Cuz@cHfL zXDBtRLiqRU?-&2HV+)`Z)n=R82BQ6AnfsGDr)=6c9hg1rGeGQTq;HK9dj3=m{Q>4S z=H=Jd>Yny3UX(}8srbJAyscK<0CGph7^Qs^^Q9ag#L0e43?!TCFNj6CmpFni9dG{f zc2H1TQ4*=b48Ld}Krw_YahmOh6xvql+m`~ED|G&L*yHv_NZmVpOnT?%%gx-tVWDG{*9y^sUvE6S@2iJ$ZGWOi1`5BUx0vz!`sJJ^C+NjB;>5U0vV zS=P11;|67(KBi6^qJ~Ese24MGdkVDr>3EAh~FsLm2dF_Q|t2qmaVpyt-_2 zA!2PR`ey1)5i}f;c_=)OWofUEXhXaqF!bSgsq%070AfDzf%ALg?lCpki}k?5tdkJq z(_kgQeBtqP+O9;e7YrMp+oIw)G3e@3tol{=Nr^iI_X5PIVceZL(mIN|t6sD84IT)l zvD;N#YDYkGM4q73{xT%l#^f6$Sj^n`R?!_B0bIO&rfnbQo*&8wL7hIK<&fuC;*qhaCKK=s10379no%}bE2HXEyq`}CyR9_uc6DP4XN2qW(|Otb|n-@hxRCJ zBRSKWEVZ0yk*W;F1~SPw!;#X{T7gRI8^E{NLyJT-3!qDrnp|jWjc0aMq{-2*Y#A1w zm6odshnZ@DBfC(((f+f7L$^T&!OEx|pkXw~b|Bph9*~<$LjDBk%M|kY5VTZ7zbd7I zmVYqcAih8pb&Sq`}tyU`<(%#yzrh>$=Wjvr)7NZ96A|{p} zD1%@n70RsY3!hb~f>}U(;S42Fs8T4cP+%NP2g4tXkU&9>hrMyN#54lLRyBZ;XaeJE zSPx+U%F!}=3J5F0)S#9?t!~-HLIE(4mKXay1(EC0BQ6#vN6!dAcJM1-rhY&KLh2c- zRpG!;mxzu5Mcm9nP^mQ^&&~(v_2{AQ1Ef4kXb3nFE*~WHbPT#0B_A(B{riD;5jnZ<7*m5{R3^7fZ)Ho6r{SBR^qHWmS^TH6t9Xr1)b8=-eEdlCt*rc@9SdOHYmuEost&F4_v z0gs+i+nv6PJVMf6B7zz$RWSLNEU1w)yJCuxiM%1B0zEh0amtZ|SQ3rILLHhoR22x* z@hzbA&O!1}(m60dLUgtWAqjgxZ0a!$wT`~#)gjzH*2Uaj2irhB`35kvwZ~ebog@wU zuDHF6TP-a}TyrWvqiWSkm-aZKlU)waWzpF1cnfkW$gfG|0A}TsavX()9^eujDXjBI z^lX3IHdMc;93}<|58Y0n*)z!)f?7wiN*Xge~xW^j0ZwJ#&Z3Upvt*py0Mx#!)B|FPkq)m&{4iN1-C7G^mwKDkRBJkYfVt z0KJ(TV9TgbKZK%yVa%n(qTf!)`tg)W7Y3<CT~HBP#t=hnWE+yfy_L|$Yj{?m;-n<5dL}4_ zo&|L;gp21x{<(9Io?KxwpeOGSSsLJw9!dD_szb37FVkpZC&iz)BNxC8v^EKjNZ@7h zD#h*j-_G}&+vfB3SAD&lJ^dY>{2jg!{$P~hX8XGP;pFpu37B&Bf9TFV{ru2w|NI_q zcy)I3bNS(Xhb#Iw8$a=&8`2AYxx4#$`}+Qm+uhmQ?{@fmGVhZaz-VryuM0^>cFfWgQ1VpbHJqWJ{aHhl+R2jR3ERfAV_y_&a@Eo&3H3 zVspfSys)REm!I3q$9NpNT!-Jc>{5i3F`{|xFcbVL-ubbcF(fRgqzV!C~ z1bynuOChhfuam1AZf{3dKU|%>t#>~hC-=Qx^7r|0K^}JY>HBT)>`(mjg}bJIL|lh= z0l)Eu8vPsa1V{*7KLpP|>L8Z44xkK!`*yoK*t_40!~Of}^tkBceuky=6K6fXpNtQ; z`@O8J=O0cql0~C8-W79ts$+Gs1dl`GctD!?+iisII7kzr{AbFYX7=AseDoY0hU+Pm zo(Ej%M_};janNdLwp~cQ_qfvcz~Iy4pjpuB8<2XR@g zpn_juJor{7>()L?D~mdUCk5OQIQ`&}_JHJ$EBGZv$*ICKmnN((EaYja%(6nRCZv5p z9K5w9lNrv``1#5`>|r%bls+dnEgGE0xknt=a7p*f;_<`1t!>6mP-4N30}4`-3#%O0 z!e&>d<^MR|k}`2<F77I@aw(;ovxkjQO!m2(ygOn=@o#FtLnSt!OB zCtD9j*g2h1bJyTEHiN|H5YP@Uh?8Q;hfH=6aetMyRLC{+tu!3PmGbx0=NR*XGo-TE zV-RynE<$s|)+qNSlUd35V&LWm#aUyi)sQbHBn@ZEoU`X&NVIYYZ5z`o!|Mp2&#@(U z-3ID$#&;t+%!p>NmRO!E#RrSc5;#`tFh=?XZG2_L;*Rf1I;KJW;c828A837j=;qGT z+&<~gSDUJ?6-Dv~+&6@CL++~j`h*1{kOgrh5D?{2WC-f*Rn=>+rojxunK}5a{daX= zTdB5YfyuKiT(sSPJKg9>v~^LB5V7}(k2&#)@jDn{eZ zGAxroqQ%j+i6oYft+h{}JRi4}1n=XNZrem`+hItVIY=KqTJ?pq$-Q;Sbk~7|P|sAQ z&fQm;le;|WTXnU3byjQFqeEP;wHGXQmm1iHv9Xf8aafJi(-2Gdp%B@@^T~O~-&JmR5WX&h~3JyO@?8v(aVPqeuQ& zaAQ32w+Q76p2}@~D1*?xeZFm;+b=-r`yE(o6>^xnF!}p)5wEmvln(ZDQuG=bFw9Fx z+2P_Ev=o$7Ak6YwuTdy96pV70TPcu+;aq~F%uYK8+esaM;L&A%?+)=L$7G~Y63ZMm z8dZ`RV_YOK_J8;wxZ;BcB6`G#J5#*dP)H6FL_{Rr0w#JI2%8J8+ECO6U!#u$4m}l4 zVu##Yvq=p_a5yP%nNyTD2{L!cg)^}rq2Jns2E~JrnDPKV%KUL{j1nSU9)Lx{4rgDBPV;1Lg3diMRz*v&^tY&(@= zuThOby@Hd)gLnDp8&n(Iz$;`l#!ED(QVj8Ssm-UR-Lp1-_((zxIQYa;l0S>x>}CrH z`N^J__BV#rGT6K>dx26iYzw!xEXcbeZBn5gyO$~p+I;GeNg7!#JON3H?(Qbw&-%QX zcTdUhp3qrf=iDn{!e6d%5Z5;asVQQzwu2R){&Phcm z-_yA)IL0D1NKtVcKTW#`y;w*FP;~Rswo-SzD(2*8g#qKY($y(&au1O@*UUFlqB<`g z-ubQA^5xhf(L=zplUIkX(6OI||I0|d6NCWnT>-;-8e^-T@-@DB1Z;^aNosQXi$p$ z;-oa4lQ!`1X%SM1Peq&d*+>S})n%~?Y>Iay2PfCrsVQLR(Yd3HiGFMShsfbU&aLuM z32_u{LfP5^`E34f|LW8`f+g7!!4e71fc&=L4`lvSrmc2^OuS zp;EXQvn=RB0Z*79Ce^>!Q0!2+Axq-TMOm3zN?xiJKEiM>D2CX;Q}FcC)_dLfI$m%U z&|{?bnBEpn5nz^F?M;NM;@thhy^F7Rr+c+#dwlG>8tqoeEb!*#&ZVso|) z2c&euw2w1vCsx{3YF41rtvV2^P4~S8N$-KaU5#r~_|j5Ptu(hJd;m$$b5Qks;1)jp zBzeM^AW?p(iM1~AFenL7@{Vb-Xo0giSlpbJK}E(2v~`GoeSKZ9GNBY`%YuGQw5*28 zld;yMY;$F4z#o4hCxLdo^D2G8G{?_fiOHR`jrf)boF3g|6{`L8ZyHptUCbF%*gUEK;Ln`AY?DQ>z(voYR`anbH!iH4+&O|%fBC7KYgEq z_lfNfA?m(Y%Me0uBKkQgsAd`Eu3BtAIHdWA)%oe~b*8oAC?W@Y6wW1icydX#Q%)I-o z^K_IcqciQqkb*ckC6Pu$eJ-FEnvN}QvBu2q=q-tYqNI2865g^3gyPBMA@@j)#?cw# zb_XLB1_5)AiA>begczITR)e?1sWI;9@9sB(Y~*8@C{XGx%upUzkeGM@)PR9zZQ3=r z!&yKOw<3uH*4Yi%LQ^^)%%V;awuUBFwOP`EmWcfXTrz~Zc)G|x0vhJ$yqf=GNqHl~ zT}-iN3%W#*vI$oNOnfH6Ps51GrSmCUqHb2!FO&5i# zFzts16eg$hfT4u$k3HtnT6=BBeAjwzbc72$vs4rI8fa3ZA)NisB31-od9v|^uq%aZ z-(@Otj3KeyFP*@BR3Ydo-%iSgx+EB7XN|XqqSVs7p9ZDnequOBZY4h5fSH3-ldap? z=2Dq*BWmdlO3*Tc@%}Ei(zm}h`%P8C|9EVj8g_@*&Di4u?yb9)IR*@ir}z$cB}0Yp zr`cS`u4x(XCKHbNl6FQ5r&&$+wql(;&5VnN!n^$NoGT#hN`VsW?XsXDulPYcdls_3 z$O_uds8*h>;Loy4kYlqH+9RTl{cTbJYk;dUl&XNg8AMwEZl4ebNc4;pqot z8cKuBQo$7F_?#}Qplhr%aKlVB4`PqJT{BbLD`D~hu#BV$CW{Y?JBg&n=q(!b%AvKe z&x5eA=360?!&2l9af;e(?xaHPt$SP}z&m>l7>H2pLIalacULJC47T6)!K1(juwiimm9p4;E%5NhI>&3sn=p|w|MVM-*L*1GXb2_%z9Atx+T z+55RPT=o}2CCgr+5RwXc(86xEe|ngfRl2NyC3(zohh+%(!^+dGCzFNdDg;Osy zVsmU2i;l%zup_mt+RsVAC07tLmoL2D{m&_6*hfT22Oln70vgDNET@cJsaN$Ik2(H) zwNit%-9<$OfcxntLhqF_QX>DVBen~BN(X`~jxOQV+XWtZS`5K`8j^ztkz)r=?U6i$ zNGorzu1+QXPHjSdPV4@J+wTCuZ3)XImh4B->qeyrC21Fy)Q$bS9Yr7#F6DEv*>S25 zVCDtpnCasdmKOQB0by!M0+|l2#7LwsmKibeU8GyG9*{@rK#R+0aq+QaE^G0 z235Px3MInslNOIOI=lFF&JGPhtPgG)Qg)xd-N$`zV2*q3E2$AZC*i0j-r{29$MG+< zaUXkZGGEh|H2!arJ;!9eCuEMO$Go=s3KE{1zAeV1?PeE&KoW0*bzr(m(!8#@t5r(2xEFzzSaZ7C@k+ewMOO9CGW-e^5x`!j3fnR!!fJXfF0wR2TC(>%qgs@e zo#iFh8n*&3kw7VEuM>JiJPqN}h z?yL(NTYS{iOgw6p)wPX<%9b0KvH9SrYwsQgo853Gm#gjCup`^%d*26*o^4BY)MpY6 zbK^L{&WCz2!fW!Bhb%C&0Hd$?4cRkDvmJaTW6?QDmpOw1#9sjv{mDD z8`Hh^DxE7Jv&l&!)$#hq4n(pr^o=z$v-WIKA_|4P9uKWy)}mYuG+-c&kt94ZUNd%p zLTWXoUOVlG!sjhT^%sHljT=rJHPx+#Pzh{cB=6hXjjXAA_4EuIO1J%Et7&T08J^8W zS<7lB?1^n)R{0S2Z^WoU(|8od*5ocRjiVFDRRL(MV?V}P_Wwfvc-L60&Stht}@YJ z*kqt*P~1N-c@Q4}Q3YX|d@;aMV!6Yt+8}v%hnr)*F!Etax$uP3^jX1lk+-VJFMZ>42xkTqNFf=m_)l3oS!!!&M9@ zjMFrRQeIo7I+3CW1My5CClXv?Oe{sdd;w)VWI1SDU1d91Y+r+tyBs6Ip46N6T%XkE zC}sG}hlp#O&2lfcc(!ZSQT2ouQz~=LGGug~E#f9KTZI(^@EV3M{W3V6^`+A1+ig4f zjfBTkj6uX_PpQnj(4XHc&VpUfYQktsYE8;4nfmTfaawT{3UU&Yxwury3fD;9W${>t zx>BW66uEPA^>8at$tA&acIzxwIXa@55W~^`&XV#{`$#ub54Hc~d{_NBPNA6ksQE^v zapr|HA)lUrQkBP8jIT0pcs5@}F6-uTtHX9G7g<2AVl6&&U=&8a=Pxt}ZZ*zHU{ule z21$cUMVf%Vnu1J=sW{qHX1&QI2hgmmRZqCwb8S?L3ilK}xqglb>hssr_QFe-hePpk z7pT|#Q-&L9S)TapJGBQWMR^=m!+$u!f9@0?bDNS_e?ocF+JSVSAzwHy@hoZD>x43$ zd#m2EnRtU*e9_dW=6RwVvO|veBxV<$89baz4mZdajV}Cng**x&AyfY6BLhjL?4fCo z1BD&Kd(*hf@Zq%msqOc7P@3ZJIgPVCSCU?%KNIC=5a=QK<(G_o{u{>k>v2Ed_s8}< zzW>jCI=}z#z5mZQJKuXg|8K(H_I7)}*Wh^G+~sZg{oda}{eIEH;p9GN%}WGxhveH> z$$C@~t)sB3fRn401}pC+7v)LK!MI%8O+(`1em24lFhlcVnb$6pHcjyQ>N8_7x3x^H z8QKn&_X9Fn>lbVzvkPt5npt-<(TP1xaix-*GF$9VAc`T$!pgNQtjGl}IIy9bv2bR|lF_iTiVoc1sTzE3a%L=0^U*F-y7iWg8q2nRCP5u z+Jcd5xYA(K?6AemR>IkphozhX4oL|S4KayZPjdf!0ckr6cJ*g^O2SgI5tkX+IMJ9U zjI>E`Ftt~vRl(l#XUrQFXdZ8N5BJx{M|YxF+@?$1O%t{BqR^3OnJv+~{n+~uq6Icls|oj**vT{PS^ z?CftT{^mi)P$TQs(^sjxBTQJAosV;cRT%nt9On&>ZAj#OP{o)Wz*c8jl_!Qib1Lvt z+aF~5aD;j!^nRkw)M^4d^p+N>Om$@D>8j=L0mz)(p#)7BOIRdbWcd--!2)F<6gy;0 z&O2D9RNCz%Ha}=SI&w$*(uRarNbZc7qg(gzi9x%0hDFiW)C=-7DW)H> zPJxbCRkeY&brb&S{W68vR6}EKOJ6XTmzJWe4I*1ty)lcH;hsd)`huS~*|ygAu+e!} zLBSXNDdgy78K2I~;^P6%hktxi|I({Gtb`OnYj;?~5{Gzug%KV(>$LNUREbJMs**>iHCt2c>>J4UW#&$Eo0;8#pKjiL6G%Xv>l%!I(SW)*3L7Kk=D7 z=M6ft51A_VUwvVm^#}xZS%+g$#j0a{raB|FZzkTP1{0}sHlHqs=#(eAh~0r>1`p?! z#|g4UqYpbyz~_m*k*zc^7w%-Z|m@LC0-ExG>T)ESAZ zuzAJ2yj^y0y_x4Pc_p)Yp~v}cBzN}uyzFN8`Lk{>#p8v#D#W$Z4@7d zYCG#E?D|m(w|2%|O=NP9g4mweq_&{}kj7)9t41;3yjtL@<1(No_-uu|*z`CHcl{>} zrRx?)_`48UtXIuNH>+$C3y%Q8?L}p)wPwA9ajlM0AskZ(#Kw9(w-hPD1z+=?CWje} z@WvE|y`B2nKwT|*n&2&IjVY|BE04^Njc6Cr5pk%g&=gPoGDX@PjPX*SsTF%Y@>=38 zL#ME|{aR+zO<}4H**8+him8MqW}pXnq_#9u39?`XNX|OR^L~NjQ%+ZS_>4I_O?9M^ z9-6MwqhuijXqdKG_R;g_uiyV?_7DBU;F%>oqd`iVJ0R-wly_Jcz`FxSzp~^HCyq$NAYZzR$Zaj^@}^^e zJ2bFR?8OQeP^0&q`&T-aR>IbMP3NtEZAj)n7@^l%4MCG{S*rFFk14)uYy!*w?zaOK zgr16tE4BAn7B(d|>kyeysqsl}cPW*h4TF&HO1AJI zhiZf>{9Wx)8d=Wqp&EgKR*cYomPQS zq6O3kO?}sd_TXQDa^Fn`VW;~(GiQor&Wwv-*N7A%H6Xl71yxj;w6NMCVs}&hE(FTT zLEaq|aaj)BIO`ta5`J(Ar#Mo@KTFfqqT2Lo$&}AesvVON0sj}ga`}o?-n>vovDf-^ zW>E>HA>kn-A(3irE}oGQp^3_k)#*a7*l7(sK0=-q-_WHnTzABu7Sh%@ON z43(-yc%aQF=8m8w?E|+&GSEAeMezFv%fxZKE$vB#-F4gurA8$z0cfI=u>>ebqC2ZB zs3g0YCSWX`5hE(l_{zdF`)DX zUD(jZypg3=m!mWrB`-|S3MUVkDiVfI7g(?bjGh@VG}38SoRa}kJWCQ$x0bLiwG~h{ zlr2vYq#c(Z%^B}v)VZzGCs%XUBRDN}!01&QdgCNIrEJT>8LHSw_~2k_fO0W}Sym!< z8!KgCTJU*P;mmc7)w+QfGl-hqi05S%ZXGiib8r}zV=4d$P$hk!0*OvO z{7?a$;fE6dsB&;FjG&gG3xa4!O&aRhX{Rwrq-)Jeh<}Zw6q~>a>p*z3s%Q9@WT0$r zi8oDVGlAOMoItpwS8xSrT;#I&#$yd)y~MSa>hnHAQ-JnEtnhgh{FTuOJF!M+aG|Oz zO5l=2s;e9O&=jxNdB!;c)?yjq+$SVQ>4Y2tD92J&y<+OiNlP_zfIGIBY9QR^5=S|g zv%Q3I-vK_D#Qa3xyzh@TF@T;{XoDXlejznz>0+2T=5sc0?+@#vtP< z`J8~6U{{vl3Nwom$Ur~VQw$mFtQT0a(@Pf>;4y8G`A|tZY@pIpyCgWuWmkm<#Xo^Q z5=EtVQ#j6Q4~h-fHyWM7?)~g3)!c;xRFgQ!Q(>#Pfn@c|K{|^j%Er)$i+RyQxp!}8 z`|pRt`tfixmK(mG_HUi4(k`2Me$2({4X*1~xLah-w0sIRc9(tZxAYb)J*Z$3QyA4* z87#Y$kbmzGEvd}vK@!Ir%)*I9x@BA4GRihTItA5=y6A`t{!0|jmXm7hqautRsERkP zymMntCRG(|yO1?S$DY=j5H9i#F+~iiN*xGV3aKWw(XkIj;3FFW4+8LCyHd_s+GxP6 zHP(lT5OW&FGeFGSfdVFs`nB1tY?SQT{M^>&d?i6<3;&=~mN7F6-JzNAh;?sh3+ty$ znpr$HOyrF3EkT|WEt}w?X&beD5;t25;Ty6T4%ChNlwO-_^M4Q^ZCinX3cjds8kevo z#G-8gE#*sQTq8W{tb~C!n<+3`8^efJ7h<$v9I4pAVUs0YT1@zuI&wg?CjqFAyl3kb zMdka{O*^2=YiNs150UJ&*vjhAm(qe!rOs4#}!L$QoC*G=I$sR zmSmB@VxbM;QsVCi+-oW9Qzi_gRqN$Vw_J!*ja`dzkftmr{eT-j#44*eg*XV%!Hoxl zztz)8F)_q0vXVELT3#TXbGcY18)>^rjAM~w^J^_nX)u!F14fXwbZehjR_sCT&O;{P zv7L=tMKSMfThl~l!e>9D3X-g>nvYR*+BGqq5ZYRrmY{?fcS#`1sl~-ghF3uvW!|_z zH75M(G~|O@*4PGga-q|LUFd!ogG}nvu2DMHoRky<+%~#kc_HVgn!j) zVi()L!Zg^>AXic7&rQNlxj@4?YmG?TeU;*rF4PtFC6vI&agwQTkZD}Ro!v-_B4d2} zzg(v2qxJhjO<^FUpcma|=MR$Y<>utDHVD$npEdhZmQeV7i`l=RhHV@kI{UUr_E*D( z{j9nT+YOs7>m93$bN%MQ+O`ISY{7^%mTLk;5lcDv)T=@n_!bLZTsB8I)W2UMjdR0} zsmH{>F2{PQ5-XSnNf_~;ec@k~6V zMoOY7peY%VJN8g&E~bd$s=6qk!N`_)tLdu<*$01Nhm#{+t(>Nwl8}bc%GGPJQV+Ia zT1G@i_o25hX7+(R#C=T6-CEfC@8t|(sn!*TSMr@+(Kp_MI+Fvy^rA~{!Y z_j%RS8}lF>^vfUyzW(~x-T!@K>35u9a-1rtSbM%rch_KB)fKt-=1CQ-3CGd$WD5}; zyvmBo09NTFQ-h`HCL$DA^4YT!>+*4Y5Q4bh%qtcRr^inuDv?FJ1dF3wHxN|f%U2{k zkxtwNYol!bQ?cu4{^|fe9WS2_mQN{h20d4X^4&-d{g>nY=IgL{c=x<}y6fTWkJ&r5 zfSc#r^X#tE{o?wXZ+~a^HlAJI+wU?d)s#?kw(% z-yeX(afev!@57Vs^k?ZY`u%(T;ooxf-%Y)}+#PQhSMNq$Jbb-=uSTEl&P|?uytMN0 z>f6Jg?ta?0zmsPD`@H-%dVL$ZOB4758u00^o}TVqJl~$c^W(zz^za6dynH>*U)o`9 zqGHZGg3oHk$>4@n#@G zeLR{7rN8|L-n~Lfu1gV#F@_utR9b2BK!1PF`O-+f+(30B`iXOBw~OxJ7pn3<#jUIh z7sFnCzq?7*Wp=|2v(E2yQZAbeFUr_G)f`$b>C942AakuyxSulv zysqZiVsT>S2D=>WV(+WUs7-`u!mh$rTxYo64-A1~RZZ!xkAH^hN@;ighvUCi$lPwfMEa+zRttx&FBstMyPO>eblubsAs&nc94Ib-lUFK$lc4_;@Md z0(MQrx7o?jn_YMIcG3ynZ+Ga-+}(MxIP_`D+kabCpWgnueAaw7`0J*s-a`8U*q;00 z^tgB1I)jJz3N&T(3`IhRNH95nxU}qbxv3(3xdiYzjbGDGeZAJN^K6pT^MJ+cX#*nr z z<DK2t_2W^1+HUV< zvjX0pYHi(KndcMt`tt8ny&bMZ@{X^@c|HI6=r+x@MjrT?N8d#BjY2XF_BHSH?vvXy zH#w7}{%`ue%`OIBXe^;kV}s@z3NEuvmPI^HLD?|pq|bSPBl0~CG}Ts|Q7fF9WtB3p>9 z!v@I^8aQ??)n_w<(YgTB<`otxR*=XF_4+oeVF`@Rum`Lrb{=bJ&1e(YKL+35EEGQi z(HJ(|Dapg~QoY)}2}Gh;dpu)=jPdOP(INq`7 zFIG~Z6s%e;Itl8@%%QLbSomy#4I@M4F*4<2S6Bd_zLEvO z5U}t`3Q$xQhz$+%<_oMYH6be404H9%d8>!|2)x->}I!hPYIaW4Om3Yo&6fmFl79e~Au?~(9YZ>d~Zm_ZcoP+5?%cjR1 zCc$j95x~GNq^$EXr&z@edIgM~st0y$u$&P=WD`7W1~G&NjSWnC8eymmRv`|@Kn1j+ zVm`G&jl3#IFGk@4tBbwE8dWFSO;%&`FJ8!n-zkZa!6Fu7QgJSXy1~n%TbCbX0{|;x zGUWed&ViBPKXVQQJUmeJGNyLsE*1nV%$x-O*`VmfENxs&oe1c~Yz$pYMNEzDO-%o< zQ3sDLSEXsYZ3cv%Pil{9m=zTKBD_vkJKF*Yx=JO22ycUuRv7^@*eIxke)`kY?GB3q zV0ZDH%}qeeO91GiIy2}UkZ{FRLn_L3)B(&6s;~&IsciN{hw~bxP?bxp1>e1=6J_GWTO0`x0r<96VZ%$N4tMuCjJ**HChnc z55qarfXAm_p4m6WQIFDy{DS`5VK=YZ(beN3#;c3|BA)DTd?AkA5=-X#{ez>Gce-20 za6(^C>Ehj%aJko5YksGo^LDSl*qNmpQvW3fER6qu4menu|JOMvO_R0X=0FI$e@Ep) zg;KDVRQyt~uiOT)MI@1k?M3l6u-PJ2E9yZ>W%+*QW|G{D%OO%d45rjRVSb$BCN4Bd zE;zY@3B7-fZtkbE%rnR$6tig3AP*sBLB|vqZPFm!U-C50VXEW(HUEqGGDuzwkNb@+H`=R(q-x>deDW$TCl{6Zgdn|ACreg62NUFbx71 zs7Le5I%{02hOLSZf+MhR29gR>%KvnYG#QUf$brn5D1XizgCNC^X`Zdx?$X6L-%Q0c zHI;$-<9loN7b2es7Th$T3{=h@FU5D^$}#2?F{@u`(r-F3&ND=Z^1Nj;C)i2!V^#8c z7fZzOL4p(Mc~n5b_QQ=f61ne;f^?p?WT3uoE7@AFybp5>F1?`-!!22HMqd zPpJyQzKymu`Z~_H+F;#vurzE`kYC zkV$|>po8>u*+fXX>bd{b0ue(&SA8*|?-wW@i2a?|>Xa}}Nj(}V@rIVk7}W6or@bLp zbJCCb#-LIAWU?hTw(q70AHD{qQKbMn$pCL}^*#Kuh|ul%9NY_mx)BH|H_4Phz}?Ci zeS9|qbftqFEI18W`2^{gqP%YPy1Hqrm4D=c3{k~kieYp#WquOfc>84m{$+7%V}Q3b z4TU)aJTEQfhyo%Xxhc+IhPp27GhX*sQU?)(3R!*<6Kn;|x*$3t0mXcEEq5t>H?^UX zjAS%o-ume5B7Z4vH!6zj*YDU1ieo-{f8*!VE&&`%E8Y0zmC#c_5Zh9yR-yK9V?f_x#~G2wg_IlqZ|oL z#R#etg8W`6(ce`S>2#}EL(n}F_=CpT3}_a{0iOZ_#{_M`*^lHLghq@yDfeH@jvnyf ze)XA^Bq9w2hc9~pjs=wy3DHE6!5p}DV8#u_B4+KL#N=ji` zT4-A(?!H)0bGFA$7UIA)90Ul})d_&oCJhQg8cQ6mITlo4g+Y}HH=pCKrAgKf5VOhH zZ7;S8CrovMT@~%6T^hn5mBI!Qy9bU@!|ON?7Jm+fm<&+@}v?p~AnZ9l-A14N4+9+_?vm3|;W zvYvG2WucQ@14Gevo%Og;*3(3!Ls&_$>Q(3cu;8-J-d;^;xa6Dy1)+v(l%lA$|0T$n7&(9?AI3fH zV{z7ZADL9)3G8jS*Xe+}dRp08qRxnvX$6N-8y6}al@lvF=2t0uWeLVnfq^kk&C`28uw6ai#?3pLua)7ou3Y>uEGnMA z@dk;LNmOg7=LrdXScY}|rIAeR{qxS2z|D+cFf=&AsJ9b{;}c4*0tlfB3i`!-l-JhB zg&qGBe5?Hz!T$^>W=59(7Emgl4yHs5@VINATb{udrG zv;Tvp|NH#^<58=YuKi{QitkJP-ewsl<;ZQkXhT5q)-#Spn`kaZPy2YVO?9Om`c%TP z-NWrm%ybE~70tE)#Kt_z#Jzv+zG_Hj^X0sYJB+2^EQ3X<(|gSeVc3vd8_dF&XZTTEP2nFC3TsRWd?z7JKu-kK0&XU$FkI$ch)3 z2>^c}08otaX@3dZ1_;*(-mNSO;PEQRe`%231KT;|?SPd9Gm^rOokLw(i{?3c1UZRC z*8aqVEwZ)Q!p$fh(Fqdn(brqzkI6U$Vwk7_3E-%;D19WVIS{*;;`p^e@XR}OwU!iy zsppn+;M|Plv6`$);D%7k^|QA$kgi$EIBXcu4FaVQSO$O+1>iLFvIIhaB4~33-U*m7 zfkDw4287h&L0ZhC^v7`o?f~J**&$y5rzb*~_&_DV@q#}9+M)tLn>C2Sxqm@q*#cV$F#YEP(+?Ov0e!Ji zGfs-MYnDAWQ^#dHHS2(~yyNC3>dhvNzBL9xd-9yr%Qh&I{c|^77-RQLN~?=FW*tOlA9Jlf9nSEw6p=^6vWiYWJ|; zep68HiL7d~CBkFsR5byzBh5k4MEWIzt8*?zxUV7M1Wgcqxrsmh6wCebns`p^JukdqfW}BuJEJnEE9(nhX zbkNrmj6D8^z4uA}uaves?3gjWn&`6T?TPT!#XL`Q#FKp;UA8y2?6!8*0X_Rk(fh~g zCo{1h2b%&CxFQoF8Ln!ntiJay;W@~|r)@dRkr{bVeq}V|tKU<4sn_K2ynFkgb1>|c zRqzPrFBdLWox?~17gSUYpGGVUHzVCV-Xm2`D@Xr&GrTZxos`;~$53|~YEP%N8 zBe`w%53bRslMLiUTL8JYT$RE*X$XnMv1F=`Bz5bIm!lk0|AqbPhIXdp;;U-_ptt>Y z_I$);dc!RE^xU)eTWlzOBsc!scd-{DO{+WOl(j>zbltL2^0bHk%AMeqrEj!uC%_Iz zY;+^a)BD{k#aCl!Usvx=V)?OXhDS|F!oE!}r(e&~dMQ|jXydo;ICRnGqWI%y9v>MY z)74FJT?YWxQ7&Rz7iv@J=0?Z?-O3&Fn8V8*v#4gx7-?9yaf~Qpmt;Ly4nshdl~53W zm|tn<@Z&o*bc%hILiP90XvyGyF(=Hk&TlMWb>CUOv=RMv?4a@GhljDqs_cme=@|mv zTW&5VZ-=sM&CLPBtrq{~84i@s2;{Cq*y)v-B8#qKdiv%cljJKjL?or%01|Y5L;6Zhb0mW%@qT!^1;4KlU3=nrt(|9r?4LKdWuJUwNjhkLfOO zp4&R641Q;S6MFc*Ui>8-6Q;o1wp5mncbMWduM1`{m=T4I!gyf?jn?gl1CDHAcB$Te;Pkd@LT;EPM)6FP-13dRWXaAUD*LMteBdr zI>*c1Vn9Ae`c*t$UmyMUh`PrW4GMs-XS{!wvdQ*;orMWg#s4`pi*K%!t(2~mvzNG8 zgH}bi)ymXL*(Q}I@unVClF5^MQcoyL=E*&{B$X%g<{q7s$y0c4JQ-Z%@j#&hh<^dX zc_J*Qz+V@ER1kO^^A2;eDiXt!-$rfZF(OmSq%9y+2f66GA%H<&@~EZ8a#g>q&i0oD zaFI7k=C?>Su#GukE^@70JUj68z%>L&1c>Qzk2@E8=b*wB1fXiHkT20N_wY!`)ffI+ zG4T?$U{W>$MFd0~C#b%T$2xrcb_7DFg#$uJo^_H>SBofQe>QpmN*LZ3A4ixE+7iM< zOS?4iZe<*@CI;OyJbQ=_uI)GB<=(Ci!PkQhG#TA@xfnlBQxL|s_wI}W474hwXcALP zA(@>yp%47Kr!~D#TnHr7MWn1nB3XbdJyUxT9zv)Gd%XvKrEe{VsXNJeQ+l;b0#^@y zmUPg{JdEjb33of}Co{a?iWDXdEAtv)-UTZzh5lYC6g9A%FhH_dPGd1as;e&EG5#A_ zAS|9}0i3|XlZcFjB7JzfEuZe_?vsu#h*OEXD4Hl@3>}O0Z#C1WWva#bNvE(?01nYz z!TVt)UfuvXQ%9LSMTaOKjiX#h#FrMF{CV^Ni-eqviZ$?Xt=F0xt`sK+!(JYxK`(Tq~ zp3Iwm)JZl+?nyu4ESV?$pp$f(#EXfbprU2!P=XW*a=~d~AjqRQ`lY#W7h)b-UIX=K z%>5|_99Zg4K6&N7aZ_Z_;%cIlSBi1~Uy{c19N+>-GmxtLl=TG(a{+;m$|?w=)oY_ob7&Wc%LVFYW~m;(Uj29)TW0uCEs1iMn1; zrlKwXAcin`*cM=ZB9262hj&$QlIGhv*`+(nKs5vt(Qy~uwu;E!{Bb!IUV#C`i!yCN zIsgw6n%A8IzwX&Sl@4;~rb9lDHL-&K3#srFs17gG4VaTzS9(!Cd}jpEDylM~!;7Jc z`y&ZFXRu!~xaudWd$89lW049qE$M7jSvAyDzQ72uogtaV<{$e`g-h$*W%q-~Xf9tu zk#7hnxR;v$iKr}G{~b~P3qjeL{`WawX{vPm1|wSN%V!kr5J@HeW@B@ROtcbu<%Nk@ zs+cYo3RX3-n4G{+-z_{79PuJDVq^d8&~E4IDd)H*_jo4U{5_!`pD?FUoF#payuU2O zq08MdZgJcl*U7LXCIU1*h6CZ^xFpNzNa--47c%ipaFtcDS+>@B6OI>{qPo5FVqD&2 z=1z)cUhCqikDj$M{7=blyig7%B5V*z`riD`s|@xuFWx(da&@p4e!NvH{X;v(61r;` ztWa2}G>8j)oF-m#hX!skW)pDBcqQ0@sD}(TC~t4+#$Cj&RIv%yTzy%1MIj{S`~b*6 zB)9%1Ac{9=29p*0*c&4V8*2!Y@hRNp4ZguQhDmesDdUA~J$zlwQw z{5Au!I6#mJi zxT$-rEQdJ#?ksF!%u1~ytkrKjmnZW5^^DX}QNQQ8RL&LJ$7`2Qn|p8@aOZX=EXf!l z#1B=oV0&6wf4)a}aesgMKYv|TM%Mq9UH!l8iH-5Us>}cX*;B5@w)18Ovj2;IVLLMm z@|3-jeD2ygm*ipQ-vjG1=T69o5RqZD!ozUau76$_BlMONiRG4Kq{i-zKo}qJ5Yg8p z8e4kc%zC@}Ur*(%S|OE$CXQVlyR-*3iDIGokP`>JTAvrb7k|Z4-Wd8CJcm%eJ}wgJlt#yucnSIU z_BipF_+g0sX?xb} z@YabhLUC+I5HCMkgmmHo2~F3eboxQ%vYO^s3h0r5yXF ztUkS#p;j%IVOyG=w?Fy!c+cGyMP=ezv!s%2r^X2<@ELA@2r*#4Zzk%76V|8{e zfKaWn?Z9>iTW!+DfU)dix-sqeT z>BlHMGvC&Hs280;b`4&d;T8}z6}Wc5`S*EkEG78bYmihPUdFv_og=GqR_x1K2&SHW zt&qlAxhgDE`lEvTRgmiHW7a^}(B4*i<9V|~HJC41BB!F|-5QC!G;qjBR4Ipc4y1md z$ubDbSQmlJdQeZ^BqM)J@HQ>?=B14s9tGAqp-oENM!+bfMSRgN6a1!+@EGWIbBMgw zcC-x-t_@r}VO$JoFI?Dsr8xU>dy?^9UDB!db0<_Fi60y7PS65!ncEua$_V0cl_&y& zI98WO*11GzHqxHXo04Esi!Ii!U1)nv?kooZE0IXsNh3d!24g*bdxskyf~v@k1uy3j zSqyUV3@l`5RCKS$P|1`#Bh1hQSi3PSkn6*s`}_ErMVJih{B|fiQigg5$YrzYp9YlOu%jRd&Bk4X_3tDgd<> zh_h{i!^|4OHpA7lB)}GURy@xR6Xqtuf!|5SQKh@>W{h{4#nA~{-iv3Dm@1hsg1=+n z#no<}ydwom2my;SWbjPa1^~#&^6AQevL`~QEvsJuW`V!j&3aSVJsZR$E||QIvuaLD zEw9_2H^9f05Xf%E?%s=>zT`jBdH&U-+pC=LKXWZ|;(aMAxmK{ZK$+GUNskzlD?|d- zzjB`s-KrIXNt{mw2^_fG~8oL_Hs~q zM~DHD(i004$^tHVB%jr98AjX?u`uP70+8FRyyw)1rDTR}t=0}fSY0AkB{<4Val?=! zieG^nO}zVV(5NW_S}^EhJilM4`Vj_~taN2rM~1Wz>HVNF{QYIowM@)sr6mWQW@Tq< zg#&%f!qS5`C3}Ow#tjqr_?V+U7jVyZCpv}R6SO3p>+0q?+nTV-0;N)Dv;;a!3{s7{ zgR9rJ9}2P{e{G!yso_u{SGs_^g0Y_K58wt-OMa6FlrfAEE@~{rwSh zxOTaa5Gpm=sS1jDiG}9o6{Mw05?ibvNX2l5-+m1b;3YQ`UROn9s6?C(&g2fD+N_eg zCa1^a6EBsXm#Ub*%vsG}Xt&|6-tgboM1}P0rk2x!@mldwTKYylf+^;8@jJ>5hN75r zwM&yYg^W7dh`1t=Q7(hD6;P(*%H0mFXtiF5B+--JbVT4Ht<_8=>Q&}hglkJ3#`kn@ z>)9gMsi-S7UYIX^ba&@SQOWE#2ilX7N@=y6b}%tXaK(6PG1&yZG#}Rtc(wY1Lpn{8 zmDRSs$;UcOY+eLM%yL41BKD;Bm5AZwzZ8xLC=cDR66~mtEZdn&Tw^;(b{i~A#X%D` z=0^<$(XUQB>n*d@ZPU=R6W&mc&;3Nk@taAI_FTSdIO!Jrg90qJLPNm*?yyp$VXg}>tkzTq};KqQLRdAC^ z>^G3Q{f~{H)T%k7IU+)s;sJqE~aMUbtUsg^J*)_n&Zx__IyW-g=>pFQj)& z(`y&*>P4V8+67pq6#nVBEnGuhR-%%A!^mRh_60Jsg-ER`OQs&7N^|p_ZOQ8GPZgZS@aeKT3G@?#;LJ%`J=|w>_$V6U;_8rNl3F6I^}j8Q}o)BtD7zCBdPlPqRf{>wR+4t=>y@Pj9AnZ zit8+qCS1Lx9|F}6+mc12*FL9N;3lJ!JZfy8$Z3(+Hs$5FFtwBLyo? z*SLG}w?BSAL0!P<{?Qec&?&qxg3-lXS(VFB&Yb8gA7Sp4urBqKv(l|-O!6!+Ad5oew*Zd*|xsZChF~hT6vur%hP0Yo(}D9jU`*5RjmyBP4@} z1*bOj^Zf!z@VlC*2$w8avw+^8*zj&<0S+%u!jygag#4d3h?-qALB=jJZt?N}TDVEp zZPRew-zWUFyE|%LUd1Pr~AK z$8-$Y^kHbqSAtP!%CnrpDL(-}gnZ`ZP*I#~F+JaAR8;l(Lean;x1wzS96Rp@+;?<@ zzP-_Ly2k?EU*KJ)Nuq)nxBXnko$G}DIU_ea-bkIoDPW2!4M&Shst0JAUH*eK(oG_8 z2zczANX-MD5-%}HR!(U?>TENyr_`Iz$*AB`X^3sBMLMokor&#-(^rnT1k6uF$!14X zl3BOfs=6}end^vMK}f|tLkgJ}3n{0!MpN}Q=Mb=h1=eSWod&$*@<@80p zL7>fK{=YXbF_&c~&jEX3$#!TWbAKBjOs?(tr(<+wS)(|oab-x_y!~h@BI+bBq z^{55Ph()~K{=mWuc>n030?stO6Yq>rO0aYE?;zS?TwKP*opArJcVM!xuU$b|;b>7*TJflwi~WZT3*;==!@6F`-Pt zK7!+fT}WRGPUIM{PC+wioIqvk3`-evPSK2qp}+rFfkbl-J$7$uT4G;6gYVDzi}tDx z#IX%DU$hU7e3MdNlVKj%n9+)!<{~~($B(wZ6Brl6uMb4V&hn4B%G>MyN_Z)7bC(X4Of;&8}Ei6+HKD2S%vAW>0p=og&2>~kug5eTAcqth~Xt{}R2d75LG%772)&h_3?*U({=+| z>KKF8PO^_T`=mnoWq}w=-sOXlRm)}H8(4( zUlURipVl~`7uo02Xrbhm386G|v5!vYXPiG^8c9^-uqTw^g2s8F?>3Dlwo4_+bxR?3 zxnbmf7=g+f3F@wdxed3Rpr>d526egNSzetISaQlSZXCh1Psms4_5N&W6fJf=d!?nV zbLHe``iZd?9d8(L)Rrcx(hM~@=L@=!)!I7Ha|Dnz zM>9FdE!MQ&Z$?kBtVUUuVg_7rp0m|r5;BMSD5A;Hsm!%zQVjlh>|U%OaEKHbiU5aC zS4-$ZUWS;giXBi}<^K{=Epca`A5~kOKos(KD|{jSnM)vGWFtUD_=XdZJZ0TulAF+^ zVnd?8qHz9I0MtzfhC^?m@+~;p5Zyl}giO(P2oQ_{;N;}XMg15tasBb%* zO*!}&5n^9n#?Zj=w;dZkzkqj+3HoW>*kUSS#~u5zuu4o`ERGfH@rFaz!sn?sP{>@S zYVj_HR5npBfL$YiuE~@c%p6eB)?=p~$7-1Vxz+e|wezNLF!Z7l8UqEAfXkU=l4H}a z$5)|KGfuD%>M4axn7-L{#3KxdUnERm% zx|%K_K+Yr)L2mUukcz&jP4=XI*vlyfs~I>w{nqIW@Aus+D2GHfQM8i!l1l&?GiO0t z$dv3@k@-+beJ6;v#Gp&VfGE|Fu9?HLuUWG6QYF$kUR2D8qERRcN(4N4(TqjK$;V~u z_-*X*ZMY1I1iaS12*%b*qY_GvfAnEoHE21yF4*^%VhFClt3}SbSF}=X`T*2jg z@d;cx`o<-5yFQ{44@5jCKc_4~-9d_BKrz=gb716?LI%PzcRGX++dwwxVOV}TlZ3Yq zSHu+ui~8SKQ1aGsegzEAlf$Z{BKxgkEmUTKgq!=Ct0Dc+6}B0kB4ctWi0-I9)I9o> zioclf;XHHF1A$IKKBWBunau5oUQJp~BDoeRt$7b0cYFO{GsxC*8DaVzYxk>jF?6H+ z$ICnpVr_+yaws4IB?mK5{El;}ZcGd76AcDAG2&p5xA@ILiIL!Nv+w}P#VTdU~Cjo8Q&eoWExh}`Nr^36j_JSSJ|pU z0~xcR`Fj(N_H0mg&vP&s>LVrBuXzg(im^-dZc-Q3i;zlfJR+Qh=dvLKL4-A4|l0=PR+%f8?gED%N%9;2xC#W=sU zQ;a-7>v)24n7tf#AR{anz3c`X9b&4Cw?y51ZLxZlB-RQ{ssh63Mf~5?b}9kWmt>(< zH)Xg=?XKXNq~eZ#rXiVXp#~|D!J_oA{~sY;@&KX$d7*_V)=&C8MoZ3i4kZYsajnm^xW%Qbf0hn?2~Ku0_lXHX za>9H;v+(W=Ha^$9HsF-lK?x>$v~%LMUM>DDyv}8;nZ`fi9D_1c)^9NcXO-mWFC~6P z4NoeT42a83Czaq3gPHCGd^_FrV;LN3zWCwJG|FlI0~OK~qAOP=9YO`-#FpKz3gmGys%qoo?# z@&Bh-Ij6rb4yo~BqWP`ymx_uW7tia(VZ8u6i*FvqmL*Xny=dkB>nS&LSD~$bqd>qA z3kM#zN2l5NJTR6A~Fp&93y-d-6cNqVLp4s_JCHJ8(vytE zJL(?3WzNjAgj2h~ziGca3jJmiUWDgrx?<_YBQ&+oJ;&eMPsrB$%JJ%=%+pav^^_FvK-CTH=I_i;5Pqf8>a&ZzgfcAT$+wx2Jqth(Uxfcy zDz8(`VMPDfzdg)NY4(OQDgQHqpOly)r&{w#b||AX&%_e#g75EWgF8ZqxIUJxpl6dt ziuJ-Oeou2kX)uBuRZXE^3bt2=f6TRh-+&r`Do%tO&o;+v=(VqggtPF3jYvvCacMR7 zM@^`OuVZ;lGO(4cIkS7s>9$5c+%&W%hcv%R3_=Vu{u4eWF{$4E37|D)`1`ew#l#8g zB)nU&D85VCf~ZD}x~Q}YjIu*1l(u>O*EgSCd7yri-K2moV9NHukLOyBeP80V-t0$C zQ&V==-|ro4+%MhWoRP%*%qx^%bde8;ck?g28&NkN9nqCn;O_(n$Y2tLNN^#Ifrl z-MuIZfWL@W9blqG=VWL`%M}USj(gA4q-&xN6xQSp)--G@-H}Tt8!yOAXehnwca3=D z+n*owNNh`kNkMF_><21kV$3`@$l3eeC<%ozupDcZW|UtKmPCJGt%a|?;y`AO?YN;< zha%@;#^4GLoc3U#$UV`|>*oZ}g=7rPU-N@MHT~3l!5Rbw{V0c@n!;)(F;=svG+`}8 zDssfJ$|!~bvMO$5^u}DOYOcY0#ucF(CO!0>#llb;Xsfn;JY1V2Wa(;>l~olE{j*+X zuTb%z1;=P9N;M-8Tyx&Fq!S^{m(KHMhf9r%&idLdA=gDPE_!~spBJLmn5F_7@+(r_ z5I4BEOGp*aeG$)W=z^Ee?8P+TNDe}x(*E+VXw=1TO2LM@m8S47vtWxqB*CE(lOvh8 z8iH>8-C$h1qFkAyhN8*4#WfM10=F|FV#5TE0CtSSCwt+LTQZF1vz&eoMJA|uLI!JC zNRH(v&!X~y{Sdg0)eK1uuZgX)7O_j);b6_HUKqqf?O<%65Xt2cL`yJ&7_tLl6Fzuu z7rjBqIP`7dR_As?-?%|D%a4Dj1fqA^Nt9~Vf8i6)9j1X+Ehl+JpiQr6{FHP#kCEfL|#6^EjvW`|H8kb3ey#i$z zY!yS;?_R1-4A}iJb4q4&{B89jNg+6n-}d#|*PR#2@5N}6V8qs){I3bCxY`ron?6$M zm=rPBLLP>2t<}g_f5H1n)S1*|CMhRe7Dl0%l2Gg&7T_1LNpvBPZa{Q4WTTP9B(=pV z3ZXLNHLrDJag!{f*|O{*`c(yc;GgKDlC(pCx-ggGGy7W&c#V<(xK8KXuGTR;gbYCQ zD34W2SoACErAX854-09SoZ~!%#>zCwo1=UCsag3CDe$Wrip=S1ha!TdsHtFYEHteCC=RXT z_+Rm`Q0I-;cdUUF1b!wG6V}9y(}b^#-1l;XLO8;huP=Y{KI-xfH{#12UH{gyNNMP5 z38lUlvEe9r5EIu|z+*Ov3Q~RB%y1BunlsFk12s2$Q_W(Z@PS08Nnkv}X?Uh2`0^sD z5Cb4O|22SrnH*0KwCj}LNgUHbc>3R+D4AIMI={ifE6BNYFvL5#jHdGuP&1pYwFSJR zQiv<6l@*!pg@=9UT_wSHLzQ&Rt<3j4%OzwcM0@h#T;Do!nJu8Xvp)$Z29LIHc;fT+ zLgeQz_F9@V5QM5;R6+~*8JwBO-JLF@xv$F;uB^`_{}O%W-8>ma(OVhh-+~>#(c^pc z$wL%zMgz`&(%hRwa{;z!fJN8ad}E#(n*O7FWIk}XkOudECFe=$~8{jac zXKyyltqQNDKO||@v>?tV!`{QFYWukok6Piu@iex_amsVc83l`4*Q=*lNDLnWI_pGH zwM(e;P=8myf^8{Oc`2EDRj&@n)rQ78`Bo=4OA_*{m^&pNP*<1i|8*#q9lQpWKmPF! zY$G*^&JY5dQ^UM|sNwn(T5`+(Da6+2k4xH@SC5&z?#4xN3S`eP+sRXvpTGMF$%|B4 z`yarI-7e_uOib&Yf)iTq`ygeUpNPVbq#xjtMLu|;Ha zTA@fv>6x?74;W-=O<8uc9F!OdOb}=oGI`xEZTd!!oVOR?@9L~=(#)!Pa#@nKeQQ?z zR5Lzlnq_bHGIQns$e`z9k5SEaeWBIy=z!kYf#w81EWQ$#j+tbU^ zV?i{;UPF-LsMaI_o3b8t<3&gd7?8xBhH6lYYbTKfD#*b-8n5t6aKko{ zc|86#R}UT=z8ND9Qh~Wr?KMAWmB22K(xA1QZ>eN6vxmKu1;h;p#6y)$XCvuPVH5}V zJo+*I9Ta?#gXx7ltgSOKrnWj*?eOg?bvkHVFL)W}K!I)2(Qgy}dy!I4d;z!!!k!52 z97Z9wQt%@eakF6H(P;^qnKT#3Fy0R#u6$1U*)90G*2&_?rY8?Jo^%&m#6=h|A{{2d z%6zb;KnT_J;Le%h&g#!y!6}#yp4e)ciT*};faie_b!`C>A5ChnHSIpyraUOdfXcc> z^<%h(vV|y^3)Co6kff?Pdy5#iseUqvqf!{7W>F;+ z9ib>}-KYhb5ET(_e>*M8Qtrs`-QSP58*~X5YdI}3f`8W%r1fMf!NzyK>Ff+$yVh;; z7$7~B4rV~&#jjQ9%6)1T>j-jS-8r?@uRfPc`4XtQusyCYS^K+&X$r`Zn>dCh2Y8n6 z<^(%#S}8jCBJAWj>a#f1S{%}?p=8Ym=UXYcq)C2xe;D~qFiyKT62ft@!ffN5LO+j+ z-%#Zsf;>rSK@mrcd+-z_wH=SRoVfTgQshNz`@X*B0b$nI9onUx#%@O=@HTq#ly3Il zQl|&Ry$_7hA}t2ZpZ1e{emf$cT@nQ^jHWcT4(8Rb>qH2tZ?5|1swRtuJHYu{L;^7k05$;(S3Z)o)Cr~TA%QXA?N~0eF=-6uXlZmq zunVjM_76;UM_3^n1l{()N}^41kyrD&1*NSX(99iRPl79m`&Q=nc1X%KeDm$m7x5o* z8ZGF$5*-PQj2FkyjJRFgV4m~dy+XG&PXg$$axB|8wf`(b2M%$Hpda)Zbq{O7F6c}V z6YO=5X?H^uYD!i01V^D$rDi`!E;>)}3p;6tu+}1db#CEf#j$U`-LXMaPduxbs^8`- ziyNdo%76kflhdCc&@w8-=7zXi+cdJBR72drq1&UXMFbo>Us7P`#F8$RuD%fYd27`@ z#DBz?R7KmzHpZ)n2E*bJE9xba6wlEHH&o$O3r8W4VQGXraIBbGdBmj{`--7!2|E6w ztVFTc@7#x#oN8Fn>B(8d`hevPjHvySWA|pXnv#PsdpS)=a!AUJY-XSRc6vOYoTFAj z$1BpbSeAS?q7)6GP^UR16s8rGT4H8#cAD%*+bUMpbc=^jvb~0GTY%qS0e2-*tw_LB zdmiRHTMD}TYbyd|O!Lo} z3(r=#K+uBYOha^HOb>Qs>OKh^weQNJy=n+8q>z)&II~CUaZfXTf7o(hl{&VN0H`h& z_<#g;LXLMr9GnvEUus!rPCYDc_!yrC#y z$~{^*C)j>uYX_O7Y4NoX?Vw4(*AZl43Rr3Ehi}@~4Vm$(2+Fe=1&m`F!!!yp^t^qg%ldf-ftj z;M63uZe1L4=jCQBJNtLX-v(VFT0kHHdeA8djFZFYox3wgq1_F}D;VeXPROhk6)z`-N;gCop#%*I%S*v4EX*62ho zrxGxKqr(+sA|Efg%z7FD#yG*&6fcVf1>yRM+)88DRHw5CGXq&9q!qB<1?sK5N8Cka z{@{%qOgDSnw}d-Th^&!xWB`u4x^Ak zLaWL7xebm_chMN4WVY6H!^GMT={H)Pqd}=_#4P%V$L$1p zRrJE@AD0G-z1UC(2~(d0!}g4(!yBO*8@8y>?xvU>6`)u|Au#Y8MpP+nAzj|W0mAn| z|L>=pK6m|yd3fLYR1>j;RjepBE1wonCDt(!=>G0WwpBKA_iggtcut`^9{7TqKU!i< z^dWZreix?UK1TJ}d8}kJf$mx39@WnwAp$S4QgBCyP;Z)o`Ae=ayvAJ~>O947i3gy3 z{2r(gpa;e0-DGz?4O#g(3cC6HLWJW<`+s?a?a{aB)X~$$flUVRzV4er?{Tms=dc90 zb;OG`wd&H>VRG22(*RbaZbB7Iqz&{FB|LJJcTS~gw>3SA{lB!cAnMBgo3cvDYZb^#>}8n*){S$K|p z7@;_?6)8ba?|$KzpR@B1^;{7fO)_&V`z9q_kxmNjM3u#&2x8;q(l+(6>Svxa(^K1J zIR+YZd~V*QoF>jPDixsjIz`iRky4n{$;~UJuD){f?`@|=$l9tz0syjv(_}|*BltfTh zBDAs}mn=uWt(-WT*!%29I3&v@3Y6>l)jh%?^aK_XDb6XF-q8|ZP%3jv)uh1Pr0{hDPuSrgW_WE-C%jLsF4WVUT28s#nQ+wP z;z>c)7Wht!2~F*8VogMES{t3SXPwuSn;_RFNRfu~kX_01qQUKHM;Ir!J`Qm{ZdUuo zT;hiis^vHK^@$IY&9rFP)gI85-bhOs3c90`LNDEuq4&JWqlhXb~ zA6IagT)kap-{=smG|nBpJhnbZJ}-`T$i>Xj@~C{X8Cg>?wMlkiS0LZxsDnQ%3kl&F zBIYJvCDTRaYTV4S1H#(kHuWLK^R9cRKX3-oP{MLE@dO*F6|oy1JHF#t3n|c;fO;7zRg<-S&c| zgu@rs=x-FR1shb>1XTr`tJDz*+kd0&B_h<63S7m|{rw=gnEtC|f-xNEkEAIu|Y zzpq6=&mWQR*1VjW?GbC_LGfHttNosN4NpBL)H03a6?{JO?77$5H@>61LQgtIM79DCLBbnqa=T@ZaZ?)kA(+gri9oUXip$*GzHG z(E=rY(v3YO)iUd#LdsPn?6i8z1?^*+OX_bs$eLY&^-tHhcmj(NmV5=x2L;tZi`Qn# z1~stbGeRvT+UtjgL+*<1Ws|RZHOHDu%y-az8$2^_YMy`Q=L&P|oGv{-Pn7rZAq0pL z0lf0}8|a?n!D5A{&)kYS!`xKTY3U$HU}v7M{+}+`Tl~PMV~hVmn}e10zdT6)yEX?C zCl|;6Ix*IePCjHu_;*3(j_#tWQRt$!$Mechwu?fyExA&v39@atO_MHKPpawg^Bo9` zoPSiel_HQxAgDh)d`7Gq8F$;?=;p)p?fewLiFLnbE{PSNW?#&RJtBBgPK!e~^(TL) z#H0SHH|bc)&SaaN<44zz9REZddP*TYb`<&Lkd-WTtjkh$vsG%f$AdM9lnX}VoanAO zAf#_9+Y#$T4}kH+la$G^tlI9W8pQ5by)2g{)(WW=EwxI6vQ_Q2Z4EFsbE1)vPSe8v z62pyFYk|3<#&MU?P3n)XLu(KXEh}>5z4IhUc8wOA=t{^JOcB4qAn-`OZc}P18Cjob z$QwLf(5d<>*C>6{V|m!(TDWH?oh&P`h0(Qwt2%E*k4q)f$j34t8m^*YlCOvt@f|%9 zgNLZc$IS=AeCiOitP;z*NwXigMrODpJ)ro>lFO|lY7b&m62w#0ErDb>?skucs}wrSUD$;3XcZbv96 z2vQGuuqIA)pDm9Io4+CshD-f1%B!4DvFGT+t&dR$zE{*AHlxOQ?nw~a(~JGgKNYP>v9XNadGPD zmuKX>aGJ@1T6?#DcV?CY5px&j1A~tAe9l{5UOZ@7(E*F@V?R|_V6J_iy!4?!effJ; zXR0aw;JVy#%lp`ky*FRJmk!ey1A=&JEM`PqCo|kH0kQ6LZiW+~xNC5CcXwN!=X-zI-S0oUedbJ` znd<7hrqA6{*FAMrTHt(rRZVVTL^+PApu1){LrWq~C20~@8u$;c?17qAl1GjB&9?5v z6uT6eG9Y*Iar+x>uqV$ByA%ZGl=S96>V7<_G}PaH@<>Z2xSzCu{Gnv+k^s_+M44@a z)Y#Awf}bxlJQdJFL=S|sTsI6Gkoho6VV|HxWw%E4?>_Y;_QrPgat2q<+6b-5K@HeL zQ^U#s-qIDTFWvd7O;^+_p6UXO60>gshpNojzjMzEB&qT4x=n>9!mc=t7`jI&Fw3Vl(Ews6^xZyw#Wp@>ox`t`?3llu`lin>1m9rG# zJ!y7H35%tK_H$l+T_@MZ6##Lz5iSM$bChm+6?aW-xtg0VWX_e;T zx=*En@~fy1iRqi2t|v+ngt%vB#JK5?Cm*_!)+D^`O@+3h3#s}(Jzsyg>}NqoLqh?- zK4XPF%FCt7aKJXX3<18#mSAvqI9@-w2CKl@6_mrWCeCH_%NN=Vv96_%{Uo^x*VT#c zL2GX8XXO4<{iub82W7e1uAqFX>vp-`qokoA$GbBp{Fs(u*M%cBE(D_AKxt4YiGC445;5| zh{)dC_+}D%&s}E`2YhjfiAuOiSCG^tz$EXe^AIe#4rnI0Qa@4XS_QPw>o4&363^_E z&G>)I&6K+@TB)~n>aFf z>kQ`c{Bi2j5z5vT>*<6n*kL1_1?)q8)|?gk5qPWM%DAnVvwFQ!YpRgTMmsIw5xiS zvk}(6(BZ__qaZ}Ug$F7IeuS@MDD%D0`IqH97@xdJKI&%;t+0r^B8lnt68$%B8~1;+ zbMvzO|Bu~(#4<+Dm2ptaFq^VQRm?ifI}BLRF^LLhj5BzD4(yC| zol+_;fO_6pes#lu5btxTPn>;E+pUd?A!WpD7eizI`Y}uY zIf0LH;KIc&xpHt4N|TyvB>uPN&b#N-P`w58_t`5J!}8~b6PqtjI(D#5IFY+qVR?he zN6T2MUL-b9CG^a?SB9lVNFjWAbCku2Dc#Pc3Mw9?uinQ|FS?$|8bf9C_KpwVSxoA= zEW$4v_ahq)OzVX5vgSv`|1ef2tvy<(1zKG_Tzq<}*%nnUc_xz(uDvf#d~!UtG|WU{ zE2t5Nk>!MTB8jlBSWR>PrORy3DcBS8)v`Z1M@ju7Q*u)Q4`CadUnyDUuMDC9A}ttt zA+0mFatbo)iePh$8bQ`6x^@@ES|(48-+x?9loDf_x-S~wQU4%XW-?Jad5_osJq)Nq z++*S)Z>v10xSPpOi;;D%1~LX7LY*h0nlRcGq|yWnl82gTzi&;7tspHQkCh+DwJzhw zXnyN*zYAo-13%Javaj0P-&(eoV*~4S#xbW44DkF3HdCFF>h-cu-*i2Vb3oZE;qA%Z zoAf12Eoa|aE;8dNJo=--#u*k4JAvgJh*a6Da^00O($*$sKsu7clCR)`zY$$db1>%g zIV#eylwi2n_Y@+Nq)jIS_)&V2bx|eCUV{-^jB{j%5s*X9LM66z%l@68%Z1J-@q-5b z;1Um^oDFu2pb91k$~YB7+|!+XXb!!W-TQG)Cs$%MwFG0GWaL6@)il$S)n9EqP^7mz zkEmD4t5s)f4I&*;uTqV*x9+rxY_wwIC;5w$+-FXSvdIk*$og`)y!QSz|N-T zF8`j!Rh%76)y-YW^vPINB&9!iqs%>A$yh=5A6FIsPc8AE8btP?E#YA2;H>UwY-;|m zx`Ycm85hq#&%M+>*z{PXJX~eeT|Wr+{uRpnEBxo*NdF3@9lpALeE&hg$IkMP);|@9{kp{gc zMyGCtL2;N+xg4cVq08?kEOc#+nK%ZJwMd@w^YA7 z8aOq^W(|Wc8qakj&(2?v4es`0U(U?w#7VArJN7&F=KU6TG$(iF%RPMRhTMH>C#qR_ zJn6u{+Rc74l)XGLtgd`7I9l@8A7(ozHVN^LH}*5t*frXJ6xE)oGsO^4T|OZQ;i1O(T>(@{UHB#oIdzaB?S2 z?y`Z?zERP(0gRtQZuv68!x>^}aGZg%1Td`1``KDhtp&9S1M-I1m7p*G%*LM3Vm@^_ zquCq<6GIS!n!;`R@9fuQyDNx0Z#z+KHikuuqMbv?6z^kWP&<^mqAvNmFt(=1P0M2E z=fT}?iR32B#NYl3Dw_}^aHhI|Tz;mObo=_i_SqUn-K~87%E9avh~Hd)cT7fR22CF& zh}7O=C}$cW#LgCqJWn!WI&HTP%`S++5f{DmZ`Cge*HXHBKxyIfNb({; z+)f5G{<90u2-B@mI!S(MF(x5|tzw`wxsSRW`&jts`y*qa?RYS@qTw8fuzP z9avayC3G~d?MqCfylT)$_T&=y0p?Je5EBuCTBLEQHQtC%0d&+1Vh)mzas^$N#eEBv z6R=3IgnGc|0cAyb6$fiDOiGE;l&uiRpCiZnm*Eq@d9iQ z?K-|IXmw^vJZDPod$k;RkKcn7IB0Nuxhm5Ro*pDCa+XP0FtteF?5hXUuW_~KrT$ns zRW}-r8*$Y#^!R=~-wq2| zs-5GLXa=TAem?!L<7#(2EbO`9qSNAl`SLc|c>!7LIH1hm+U4VnEt4jLFZOlRl_75d ze5%P(>!_>7S*fbWenB2?9OT=@;xuZKFzaa%iW`w`iW63Y+3Y%PCbFLmF7zC_4?4r^ zkO46#-_=e9AgQ9Z=V(k+B4~os=q6D?X$&Hm`4WgsObf8h;RYC5zn@%8xGPB!_$fNY zw&$O@P!gClx@JM&)hk2zsEK4{(`fR{w9MKF zEWTl*bmqi4LR#T3)`f4$_0sMsC{R#WMx~k8aU_`=D+n(Akj5>(5U!(AkNBpf=5njw z&bCRVB@$Be{WZ~WyH4F3{&E3Gk|@a!>!MPYnm|WY%T9P@`y7(32OpEnSfebMsQ4oj z?k#zCH9Sn$%wo;FRMGa_)WkWHHMYbQboy(l^Y^CFed&?Kg7pLL5QQ;xzY6j*=Ce+d z_5NiP#gb`1+xMtOp~kD^N||#bv7wjm2z{Lx&~u;MG`8KMRva?TyycZCf6K#-={m0} zaAfY}CQfsq(oKX%ueYp7kq!nIr~d^8tDl$*qzPt5FHK@t?yZxu!;t2KfVaWnuc{h&~Ov@5jW&`v8rql z*_u!+FZQyy0XEbgqD!@jH+c zr3cHqbHRBy6BAZfZiU-+aXWXk6flVbs-z}atOqNQ?>aH<%<4)gRp_}Q_fA5$7~CW> z2%ldqlnN8KB@?2_`RsFQJ{SoX%&5?cb{bhD{a2I<#-ZpxiPVH2zje}&oFtXwFx??f zx^V|eL~n|gMbo+3hK#Ck$kg1~(Z^rbQ;-Z|7piMW^T0CffbjD`mpKg_ef&yH8veX; zj0y!DZ4~zy6OzAYAHzJbjPh5jX}l$BI(urHg!_G$+pT(3vX00X&jk&ehgTI`w`eO` ziN}~-WB9H?r%MHYy=~_)<_4X|$2JwMoUAU@f|C6$wij>RL#?6VRH{@yWe-W% z`5J98a?ZBsQqsykwxupwIgH9cx*uh6SxFmFe3IHZ6KB1MR1=Uqwj|3-cC! z5bF|%ztgj$;DC8rrlm*4)7T}xQ@5e&SpVjll0hSQxVMYVJw&#x_K%Y;@{N3=n?PR-v-8q9P<7*Ht@*;rw7kop<*wb zCHv3O-WhNvV!<#C)dSLM;IS@J$QIU?wBX*7&LXJ1vCj%hWS z-DRLNBn!ImR+7Ts->b&sGUO@GuF`*fmK5(fn030S@j{05e{%jPvOa8SM2avMODPlo zNjh+f!@sa#HTOBGG>4Ka&M^v;z@=~^Mg~b`SXFdS{2J!G5_-#G9M};bc=FVOaMbYX z`!Wnk0QR36lr021%GAwbIqJ4X8OWei#h7fK>*QyfF8u-(lj~}8(|+U-=y#FRiQdP; zE{B3`D|@EKp`nmiHK}U~Clk%YWFT51r0aEY2meAcbjFuK9VIut!+xDS5=7=JN+C21 z!#%!4;Obv}ncbu0uu>1pFQ3H&j^?KAV?l=L*fcT5cb+DbhLwkUY5Sk;L=Q*e@vi-? z(8JeoK*uwPm8jLQU??_$irfid$WNgS zhXwg7J}4fnac|vK|4`cLaj@qSkdOM>T^={kBXP`tcyk@AM$lFJ+gU~^bq+7;k^BBOf zybXX@7!>cOe->rp@Y50wa9@v5J>98!5~iTAxI@rCDvk19$##1qRSle3ZU2ceVT`S@ z{k{QX3`e;DPc=Rf)USueeDF5Po^p&9m_YBbiS~W*Lf{KWH37Ot6P8eszW36^sy{289%PgBc6XW)gbS?Z0YWvM@-p2 z3Hg&b{B_4H*|1%rXgtQ9C=DNHKA$%|2#iT|bm~fc40$VcNwX~&yw59?6cE^z5V(s~|Ra>R4_cE>@I23aP7C52$=3=vk zB7a>kwh}ya*PP)dXfj|B{z=#Ibbw&={=tC>M`i8n@wEJ_+_QL;M$$tyAxIbqJdqsYS@LBGMh4XF=pls@wsA zkN(4>9g)#L_{?4IDbbh)HHVhy*3S{3&t%WMeZSrD6O5^4@-KSA34A%##39W?PN#gaK&e zDNN}xtb@__UJ#XVw(yrZ$-ON0g4Jw<6?1o9CgGbm@-17>-b*?xn|M2>lL{$pAGcv^8gC!otf;pldJy0A$Sp9EF0_mA%bzv!8J-E4b#+?mci3p>ULvw!{wmOSW z2luC(Q$yw7_whR!s>9|~w+7LGAX!nRXlv(&cD;j`VMC+6ia0t8*l$J!f1;Q}zc`Z4 zBKI-~L%OeCG~kQ*2?!i_LYVh5Z)tpY95$xl3{Ds?l!K~4kE7%;z_n8(@Ht2(YT#Sv zX?Rx8c?z{ZNrYy5b|=KOVUFvEh}S^LPxCNi3y-s9dZ4SIb7W2lwAKB!Z@|h$jS}s) z>97A&io#x3^*eYG?n>4k2T@bJz=IyL1Qr(SPIHxlnVZCy202(RMZge>Ki*EP$(hVJ%Hi6*kTq5mE3sSCKx}rq7KpOe=46q>{`i_h zDBJ>ux#%M1@Kd99FMo}5ZMp8?4RlM!O5mU+J38hU&w@qAAC*NYo*CfN#vChR-H-U= zFJ1Rk@p`{uXpnmpNZ1H3wOKFi%2{@)3{r@FtBqt0tN4M#2o~7EYg?{0-#v>ikZii| zlw2Q17Jrs9<6YLJWB@bHB*}sLffg9w+}lWoLKwPMgH62Ly|5}s<4!J&RBh5DT4Yi4 z80xHdWVi|1$xy^ScFL2BNC|6BWY#G&YrkB5qS0XG>N`4Mn=J59Lz@p$iHg8P4OP%c zZHiRGSFh&0DltKS+VK;{!=u}Pz{HCKS2RVT_)FQbm#8H~mN~G5kuAk`$)+&{f*In_ zImu;Qs$aX`&kyLOPbOV&(S*g`aj=d2)-V3v{7x!6_UXE8MpO)#zs`~DxSo&#_j!@N z$L4+SC*TiiihmQ~&#P=6THEsc@`7=-|GwD~Z)1q1%Da1;9pemDHK%elOD;^Hsztp{ z=63f*7-!!Au_FCZ`h8FR{2m~klw3d*0j-@JUO~z8N}Ko^q|PMxNoE!5easBYjT2+E zZKjNVI~DiZ&vl91A^4}?yO=&N!#nlnaP?c{?v^D!U^D8T4!&*GjN}0g*&*qS4(T;R z6SMCbz66(_+?xhBu{b2ov@TEEY?~|M1ho#KC#7YKBCT!xgumHo`}bd?V1u{S;90NH z4+<0SJ?Gnx-C-!pXR_y9iy2pC)odei_iB2^4nLHyrSVetM3M*BbEmH$G1h^*SyW*><&IQTzUqGipkEv;P1IN5mrZ?GR1 z?|)%%tm4+LE-L2E5)Sr`4qwebusy#2g~CZnX#Br&Y`ibLp8-(C%p6S20cQRH0082B z84wIWMMOkILPSMELd8KrM!~_yL`B8KC&IJnn2Eu3H@P#69pCwM?gIGKNfVUO z_tb|G1$bssnmn%NTmRF9|FZ?O|I38;B>*zizt_Y7hyb>+3NtB+Xc1_GHENZsA~va# zY7sUCsS;8^{Fq5pMgB@zd?2hcQd@{B5F7lsy|5>aZFT5MJSw_ZA>Eb5u|2I_1oF08SOV zEtF~*rM1xpRSBKZdEj24%GX1q1j+jB&9C2VSdEr1LCVBgQye^J)oXh%-v`aX=U{Cp z{pG>)l7w@+YDFz=^+OE{t^}SX;pm{Gq$`+8Cm<0KWCSAbwn12uZIifyvguwpn2tWs zoKHbq)&x?e2tgcVjF5+kEeld0XGb)nA%|fjr%R^bQtXz~!&Hk)kn?+=+{q)u4oB!j z&n*53Baq`(^G`_g&#_5}gD(xXN}}(!0?CV8sV^mAC-q}DmOu!K%jqFHV&{>~Bn6Sb zWtqh&1*lc-YefLtDEHge<~$G-r%P|^%FV1k)2IMTPu?nA8%?))Df(m8R%H^k)m4db zvZC<&wYqvFt*T}=Te;acGK<&ZGFsL1t;H1lVK{#jQW3+jJ0)q%)=MUo2{Ja>=9d^p zfRur^sp$IOzgpeTfQ2?)G<7B&BH1gg&wBE&=M(1sgvH$;Wu!56nFyj$b(h7^oe1@J&tq~}S068||*#01S>4;7xtilrD2R&f4 ztCb|ZYZL6wuYS#_;pilMA{)fg>9U4LCVP7pcYlep9NB&=oVm^FOYLIl1byP}0{?-= zvg03)Pipl`Yh7J9beQ_gHNY(_hlY{^2jaV&jl>XdL4?=613ws2SvYxS7qsj=YEIml zQ>yxy0Vz_=1fMByOwRl7^QoWV;X7tqSE&069_OVY4r8ztDFib>p^8!+Hyg#|<48B^%{G z63c)@X-l6hmI9!U8+y^YbcY58J<~}TMSknI;u<`DT2OGQD|a(olQ)!^Fr}1Cim7Vz zWl=6kW@dR38!6}+E1~GHUO__&KKjHoQ8HT%F(c4!XYCSj`9tQZI^HKsDs3aH3f3E% z+QtX6Ew_I&zw$>mgEc3K4S$xv0H=!`v*QeUb9U|A3An1iaL{;Z{~>-O<-7aI(^#zf zT?!ts?K`!B6)-*GzNE+2!!V$&1-m4}xDJJdF+PKAd~fP3Aj52)YnpUJ1YbtYaCN zkTJHjVH82x@qJ?CFiYx`CBL7~%{Gh_lI)Exh{}}s&Ihx;bfjn$<~MfImZ@u1;pX8k ze;b-{e+Q;kiQ++87Jn7kp76xAWpy^yQe_H%9UQ|p7b6EmisJ4j9;GVg&$SB~zC}$8 zk|(+TPC`sOW0f!kHZat8=h0MF%XMq%SuMm)x~S|qIQMjkOxth`LtpQ!dMUSr!@`{Z z8sr!-dWy~!GXj3)MC>{G#>BGc7J@fhV-E>9!9=u)n-g__s;idLnmVb7q?~g9jYfvS z3WT^6fF>zOcw+m5b#s;yO9QR3v2<;_YTDvNEsY(n2v2W>Ii+4KCNCZVgCQB1kj5|5 z`eTv;QchZ3{D&d}c@$Mqy+>ifm-pHI0E8KHGIJq?dbQv#0Xgk1ItCT3M$*}r-|150 zjzv|Ne@{UmB~e6CxfwsP@v1#Gf1PWR+!?g*^VLUdShf)3F6*n;q>dnst3qD{K%>hy zn47>C_itmb6XWjyn;{pX0o*@DF+@RmAbFW*EdRJoJ}J57s_&vS+acr|2`Nw)dVkpa z#%immeqf=A@ijz zJeTh+&VOIoe9m?F(ymT%`(d8IGpC?5f`8uB4rQ^ui7Bc2z zJkZy$&k{+n95!Y4N_TOs_2iP17#X!6U1dx?y#`HHqErr(%C;nGX;{o z!!V6NH`Xq%_)=>K;zayG}Rmn<|hR6fI9!b%i zC8PurM}PYW5uXFRI=nu*$rE@4t#S}_v} zKUK|Br?$TeS1qg(2?NTA@v2NWEuMbhbdX2S+lqcnIisR{V(nMGL3{lS7m|mpK*<-x zAs6}2dYh=Q@E7E+I;#$-N2^}QHO(i`VkGit^jjwx_C!Lx!5V?wN=Y__0Fb;@@%+of zjomfv~R7?hIqnk{E!xiVXuZ~YlD5NoEr^Foj8%Wuk9OmmQ$$nb&rKg^r zP7W3cxIv87#Br1LRM<1aJ)MOOZ;6Dz3?|D$9BgfTChLju`6iLL#|LY)khQoy-w+GV zahvA`tPO)HiYh$4Mt-Zyd3-DY5yGIrcuaLqs$!w(du4=wj-b6ZC5Y72Z1k~+k{&;k zK2FS5X-ONeL-ei*v;Uq==l3^lRcDs9kaS#c0+1Lr33c0>{HQPs)!4RYIC%}XmMj!J zJfL4?iu7Z;yddLmlr_ z?MdIdMW3j?p;*mc?ikWcW%I$6zw>c?ClxpQ>7*7$lQZxY?|^O*>DO*K+>+_j-f~Lf z8M8XQOXzoi6A@E&{g63tDi-P>kC!ts?SrQg#jdlu z=+O$L&50G&B8nps{mb&old8`TPi$heTGX1kMEN>wiQ z*+Fcq-{|XD*Y6bD2j{?}%mI5BS;rlq`1iPGa)G1eHRV9=^+f=DO8v*voABk7#Krn(_r^ir(6_K_$B(YcYyVFJhCH0 zm9(kBsYR8$`PlYZ901b;Q+cE5LcqEf<=x26zl)exB$Uys%PGlu*C)8{L0_R zu^$P63y1rg#B%JLAu3Q`UvKWz>WTU4bL^KMb0L#^t<}nA?kC@Szrip~?&p$lQC2VM z%L_+!+=ewNY7T{LYP#U0J{FDKpWSl0>}tD`g~cqJ5}F)IRtfQOncQ;Ztl#Byss7_J zb*UK#Rl`YK2+&;>LdGjq5jqT5S-X5uowkK$iYY+((+SFk*tKR`H_xkpNbXF12h?gG z@r{*Eq3)A_WJ|jno9A10F;2O+r@xJ@ej4EN?doMs*%hMp5wy3DJ7 z9gNglpG@YGl4Z!*BCb$K%En*l8wkW(a5pr`v;=#5&oV6R9RXatQS%J?X?}t~$BqfU z0~*kaBQq?;)qUm^|48#H^``r`Vv>xKKHx> zq&sDrv)=)Zn)n3JTrNMMdR?fgSZ@{I0hY%OrbYQr;X%19)))^gGYR_x4#Uliq=%nJ z(_gEM<6%u-848M7_;r=o|N8fj|{H{@$Wm{&vsdZ!*`PJji%!3qXcd_I)gIM2( zr=>R(6}H@+qTF}pB$C9=r(m_iz}FT?i!nhJiVnvjTKY9URnaZfj0gW!NNnM;>bZE6 zkmt|(Sop%^K%dhp=h2;#Eb21E3g4UNf{&rE1=i~HHU7TF#GXTpNP>3)qPumugD_k3 zdS$;rB;YSP#3Rd+(Tg_HZRzf-LTC)^`ni%@h4tv`t?ku7}s$;B$bqf>6a zKF|anB+J`zt(1eqv!ll)e4apH4iJ=GooT@m&S-9)7{~DxZu$pIelb!Nn(V79Y5kws5 zej11m^g%u`I)z+}Y>YRQ9AT$mh&t96Z@SYRxQBo}jf4{;}y zuAV(_Jgbv0u@qInA2zOaJnyTrs(so+Bd$OebLFZ3g=^e-!oKrSGlqJaO>KHamIuiK z5miZZ0csik9D6QoIHDJK(gHuqNN)*wNA{$!OrY?MC49w07P`Da72xPUHr8${r;ePI}6s$9Gwh{UgVGT91_496U}Tl z-9DU1<`Ti5%*N6IhMJs%7$CZZ-UY~Cfj~EP0ncBmpcs>;`FB&9r|$i4tHyFY$i;B@*L9^&raR%ln0$o zj!dsx zmMg~8%$dy^%~}4oN{BNJVzv!y>BM^gh;VbR*-re~I7MqX$svQ%Y8PS}bU|XYcUYly zaH7yMpIx{kgl9WurjU+rq2`XDvInrwCP?W0o!l=Foh66mUfNz&S{iK}Bx_3$l%X%s zg(U(KbJNq$A5;zw4c6u8j-puHb*-#Pcva4utQ$yJEHe=$o+b~>&-`lT-a2BJmS?e; zw~_Y0i#^lhdi~auHrn4rlmqYh4rtHmqH6U~M)vt}W=~kToM&q`(aU1j*ts<|t(Dm< z_5jdUjkrzBH@6xcUQ*s$a3g(ktZF-XM42|PI7Qz`DVyBN(l^-JxP%$s@}hP4$ZS3v zvy{GXu4`RA_461mh=jugPdR?d(H_=zS)^6=C7r3Q^^4-67D+Yk7ju?{xdeFIf^7Z^ zxk<$)FzGM7qbq;gVEGK_mk<=>zpFW*)8Ktnyz+Qiv(UDueS~Wdk-l=G;*h{p%Pg^E(B9{%>HoT ze&7;#1r1g*;#!ux_%00J>a8p*iCX4Jf1Vh z<`Qu{&wrC{pOP^T zeqqY|_QO0XJ*S+6+Zs-_4AHg=I*dzzn>|nAUeabSpb$e4hhiQI8h22D6goP_#Wj%o zB_SbR@7y@tJ#A7_5cc3eq;;m6X=!yV!SvNt74F_O#(PTLBm+c-L1K1P>G*5G#O$#= z%Drg_hh;162SUVi5>;WSv$vW=Dpf+x`}6=LB+i6CAVQd~NTYT+N6_Ezk8DZq2&vV9 z56|PO4lThH5M8O~fx)u))DA`dBX+-0xLV!NPj2KeHZ<%x&6`L%=Da7cI&h_Yr1lOg zIfjU2a6=GQYD^C^n0@FmiB!grORv%R^Mvh!*o9*-5H4L(tqc;_6;c;)`Mia;zdop zVy#p$frH)F@v=(C55|EM4~n6jrP{|Zrph*VJh21`5GYF=k$5Fl^{g{BCs;3{4UnCr z=4{`3COZ5eMh?g&_E(hu^mShcX;CL(9)-w@_X}q3{OKuQu_SfK>LKT1ZAh4&)(RvDE ze@cFsOM8}wDyIc8{cu<@*L)h8)sMHn>G)Bmull_3HSG4Xxft z)n~nZ@5omup+N|R^s|6GMO2us`oNS||Aul@omL~S#-VQffw`t>EXoR0$Cz9B@Ku(Z zlG3%l&NDK16rr9ll3sh__hJ3J2vo9aa9YHn14TOYb&GYE#&pg>T>tdWW zR+@P>bi$#f5C5trP(Erzvhq#Y)|=AVd{rM9EHYMVco64RwRM1%?}4Ya^-PJ~s2dAx z8;iD@u@#orKN@@GWTco^|5D(U?yd=4&-Th3vw=oknmXBPkk|Wneb+Aj9iWat-_?I~ zGEz9{B4oqs$7`AD_Q%y@(c_20O)v`Ow0l^W#p2WjyAn6oc6*YKFDYH}ESR)BS)a!Q zIOW?>;8rnziIh6jInw7lnv#+|*%b>%7Hr%vNc}l)rzS|iqs;E>yh{lMzc!;QZ{oF- zLPQA4(Ao~3upEPB$5mk%{Rb{S)92NrXRv`oPkhV4FEi|cf^w#**a?Xi+HriP%<%0? z`D2IqNYRAwvUInXryG)f)izIC#*7tENE=q4z^ikzXA6%u=K3&^^5$E>&VPvTtSDoc*n0^hPA?CActDz%M&VDjFV7kIjr3UzEN38VBcF^I~q0d~i13z_h zX*6DVNxpH2v!Yp+5y;DP@;lv04*?CB35>%5azfd;0P9~rZ4{Q|9l@3F@Dwk{;P-nq zX|n`w!W6AI{(MdsbtHQoVI?fxpH1f4Y0s5GaYEVea?qT+$|AMK-VseaVpGZ)CR9^< zn0=~na%ihL&sDz(3adYGB?Yv`q#8&dHhs^~ZE4G#dj~KYdaAwt2-UgcsX^K^7{c15 z*R$U3fgxKF1q%CL`Z=`d^gb<569&@NHEr)~H^OMyka(`3MKDS*9^F=%O7S#|nZ=R7 zb9i!4yR3dG6iAm@V()_Ks`N5=9KUNa^c0^})HYlzPqxsELiU2E{F*IL(O&A|5~-g{ z0KK&xX1?&SvoJ;0_PZ(h2e^0uQ>~tIrxN)ab1ug`=iw`+bi|X4(l3tr1$+Y~p!@R0 z$$I))-BON3A#5voG-bfWl_(5n@$I&6n!-9z{^gHwv9h@& zH)tkOI^Qxi4agzG%?;dF<07yDlR>oEd6dx8Ih6UZuF$SbQm^n1bTY?;B`6sWgs)Kj z_^~9jQAhM>m3yEEvEqROXba!hESY9(jXWIWCRKprS^z9Vlzbspa85`Ak3|2G+inId zSj7va;QDYi*;f^%;5PGbz_S=VNl4`$XWlQ`*9>5OmIy6NRU0f#+dO0D;X5Q6k}WMs zl_p*MAl5a|3^EvVTCNU0s=WCf^XJYbUgC7nR5(#0Xhi1LfCh(A-l_*>V?jRB8$shz zAk>0*t(ZEday1V|AgIEOlXbpnmJH}}xjSln6)mbi;{!gN!0_Qw+g^jpxR3UOiF#|9 zt+QTEJggBBe+}|{;gXp+#C3g9aR1VD^PA0<$XQK&N`3B|u)N!RvTi)#XSbY|iy{l0 zuY^Ax39Mi%MbKa-c6~H#1r&8p1MgApv@wtc0)>%qTdVSkqvOq4L|V5*sHjS6J{DeJ zki*x#3$%NF#gxsxF|~Qp@zR&qKBv>CzS*M`;kmWRJY23%FCj>j7096@r8gCJxQqI+ z^^Zyg=W^XyX9bfrwtpJtP0QPdaHhJNm4Q(gvsu~-<1CGJ>tNM37k^A|1c6-Fvkr6J z4y!TiVJ9o2+J2(`Sk!f#`RT-@Tcy3-Zpc?(+^qjp^0G=_->2#5hko`v96l|H2GaSe8jaTd5 zhWq2OxP^-icw)8!ixfumw!E^aBDbNDYiI?!*^LzY%VYP56Ds!!PTTbgzhgAtwUnYy zS4)aM+>M>J6A23zk_g4m)RZf*qq>`Rxe+on(XP4$uXs4)j?=+5bpwLUsQ?n zG`4aHY2MS(#jD)cM^Ys$0aHve}7S9KG<+=}7$DOx?@v6RRSsPm!_UVM_Hwkvc^7XnGl5=|(OnU>107F32{xgb+6r8IFEK|e zQkgTknReCw)C|JIj<5SdxsngKRp8A>_coRTbFNq1!$K!Eud2vm*S+OQy*Z%QNG6lu z57-Zc*aA;vrW|MCEKA`ndOFeasyQ}+!Aj@Y#eqDXxAy|F){xT1(GF8m{`c^oi0Ngf zo7LK?fbDAM*sLiRb|QQ4^iliT)<)V3i7{CK_R5IPoPO;oc@?d7G?;)H`R&hF+cN$% z#oGF;PWE1e>%d=Mjv&s=qOX}Be2!pVt^~g`xSv0*9bb-#n4_eeQnl5RptqFp4Mb7G z@uiVrKxq)BZ*;#FRm7M|V()zTfCCH7MGhdU!v6liNvU32j_ zhm~qYiYstQ_l9tF;6C<;n1b__@1zm(*Wu*?0{({_juJ(dGN!HmAAo3Rk5cvML%=h1 z%L*E_uMCYa0zK!`fR4+u(a?f)hR$C?(%J0`jUlR3Vi1RVGS)Di8t5N)U~W5hDw~=X z>*wVzJFR;TIq)68;2bYF^nbDU7XfX(e-tMiqy>r9+TW+a_AeTS!3xk5$Bzc%z0pHZ)r~do!b)$_AfD} ze?{&k+g|??=O*%}B&pnatzO?nN>q`2mLl0pF0}kP#>Vq+H*p_%8g=TuI`TC?ZQefs z%K%j&lwe6xN38Ean&#$B3J93PERDcLlUHK~uG0oo} zz&;4X9b=tp*dK@OOa<&8GB=E}aCeOzV4f}1m@ESEIIEH{0U5Lmr8=4HqrUKau@|IEa!C6LhD)I}$rZJgS(jbh>%PS{argMyYF+ zi13QJ?HOS-{QW6WqH`TR5?qxl0WmoQ21U^5}*^u0VgEPpcuJFNi4HWw4^{g zK$|4)26OlohFo;Sc~ z9tG}VVVfL}b|Wicq+9lVYstb+s#2oB_z$^3JEX>R7t8d0e2w*qz#>g&9C~3u!ZEE) zw{OIpSN=Zl{ywg0)Z6D4m${gfX_TDFWmd0vlrw~kTU*184X3GL_HU_=_P_h)U!O{n)!2J+1fTd zvM4hbB#Ce@LUB2;B1ny%PaV0^L~2`!_qkzbeAeXMrZ{J{IaQ@miV9ID3hELD5&q3x z$X8Da^)ug&jYSx#9#yQ3OS~X%YH2)l3q|E!Ki{Qa>>0!ucNP(%CEij{Fb12YBy&zb z?7!=`l3Ab3BQ@gV_P>tZzJ7y0@QE-9tXr3u$#{DE zHg#n>`~EMc`eH2K$>x2`v$Z2+waC*#hEFT8#U6lnEFSk8XeD)2Omf$bOXybzd2Id% z_@){wi5z9&W&E*3a(I|A4|8@~}&W`EFXox{Kj90EpVIIV}@E{PR^ z<9X`j7wa;c0QzoUq?cB)*1{Hpg4g&&AoDD|(SZt^zNE48PaB){o?%)}ZVi@-6WjY2 zsyGSQTWsCJpVe5{=y2Jjgn-0k|&Q=3%fWJ>$`d(xMdOByWkZ*-Q2G*&V?g6!u#Uh2vKh-1$mi) zE!qaYpOObd7yy6i&of?m1&4J>c0xE$@iHiqY`}eYVTb+?fw||?Plrs1Io;oE;Nvqb zZpNU{cvS6$Gak;*e*n`k{4@hE1(igKpXaKMHY7{GO1}LNSXb03=uM)G^(NcSW==^U z^b7pOGta{O9}vfl)Jwt+^o{DPqGsm2)T@YsSr!&@p&17tynqIWsat(p>i~W!3iaNV z`y%$j`iQwH73;RGTTzddbei#_;@g-1@hhkn&fe>q&Q>q{%~dP8Jw({$Uq*or)WlcG zZpoud>|2fmwxXTs`iWn9sm;2Wni^Zy(@(4jYCU=agSKBNeg);4IpfHFe}T36bD}(> zdC7;DXHOIb&qg#p+K2>4hmGcWd-yt|!ji}Pd$wcwqKPF_71;hwZK$V@U%#7)(acG) ze&SZJb$r^D*qCDvI(Fk<*2XFjCI1x}R$y-KIQmHQEF$);do*hl4m-}xyYI1@rSrVQ z3fRpVc#GXb3a>=k9%0k^7h(T<)f3Pi?K{lLthLWfVW7Y^BR(VgBP|x!RZ%8pd^jO3 zmfh8xS(xStpG|w(HO{vv%r`vJ+dtB6DoKo2q3-x@zx@MTFH;J|vN~-kezId8o((@u>|$li3Ud$q&hnSeB$6aQx@@fl$W3w(GB;=M z`n9o)GlymVoBzK;^Z&=r|DVwO|Ap*4C0zX9Li73fc>jNBKCjUKE6{v;jOPD8G@s`G zL-YS1Me{FAneX2UfL&gySu&(GSt~kdJt~5DDgjU0PZB(mWtBzc&!%{1a(>5{=naco zRQtGWIq{C@wLz!~XWer?-@w|z`!msdQY8@%3Yn`OoC!LUw@sAxj(sHiBv~0aVNp6t zJjuXid-n(%BSC~j`$EuZk^7x#e$=+#IsNd-7UvV%dcYX6wk~0Cyz?#vL{CpVe6kY@ z_7E}B3Ni+VuUMojMZ2m`Oz_e7vb=S`vd2AF9a=a8*v4(=8=I5{=@BGMxVDGw5sO{N zYs_@+ad{CjM@N+wb?*fO2(dlbQLHMMd?d>d?FitLDI=@@4+H?P3r&g(ovu!gOFS8x z-x!ntc)T^%Ej4%bfjXd)V$dQXQ(k9h=O!+*A{EwpgO@eN1oWdb65%*W*Ln5FR;KzA zwN`E+sq=h)`R>?hT5i=&^$5YCKYaU+0DtavVDt1TrV?yy9!&{0uTLv1~IDvl&; zVoCqrYk8&vod%{ zxt3bj#airjKIY#H5^c0Tg`x2J2m)48$F@~>y-w1u; ze50^)Efuq@zW+s>Y15B=c6xUg7a#=P;doz)`|2M6a>FwDtYCgsZTPXM^hcjOs`$i4 z!t{E*;%Mo79#HUKK_lu781)fC92`JWhM|l~j#|nosP8l`p5%VH-F5o$ohW?szs0(! zLALCe2gZK@gsSzC>SMJ^!v7vfZeRU;u#e^q%>1;=zZiFE7sg&Y?E<3C@02U@fMF8T z**(xwzsTI7K1czD_`k+GDYLyE%D?S zf#ovX9wyZBGfWSNtlUkk44=Iz^U-O}SrdjRELhw$UK!BqoG zb|InEt{IOQ#0P|kty;Rp9eOuGN?juA`ey3ftP^XkIaB>_bd=J)y@RU>P(!Y4e}7yT z2H`%OExE6ezx6Wpq3^#Q<^p2?GUE9tv~gBzc7*}y5s^ywt zM%zzA+3QJzmq#3Dt2UzrAJ<+y>I@nVns#Vi1r$b-! zE+i=3n3FCg(vx0kyK){T7>nk4TO5UirXoe}5xZns2(#T8s!MSX-~T~{lm28@o9kPM zAsY}RD6eUa-(R-2gnBWe+tlURY74+`(vIw?l%c)`_QH@^@8bbb9=DhUx&Fe&Dn(EW z-_@+5idDss$m^WF;R##3c!$=!@V@b@Hn#et#UC8J=&STm>zYrXYEX<9KdNnu_^QG$ z$S>_u!v7K4AEohheYlV!3zZ>a>Qxri+8W8%9BgqRN0yFH(sq>j{Hp!-!@g>xZZr$i zKy=*fhm1<}#oS)?>bRKuqm+V5sx9_6?Gz`0`Q=`{f%aB|7I`{EAv7h@h`*KwW7&CC z-?zHCCGwS!#FY3keahNum|-@T>A}&TmDk6*pw&@eFyG!|heyPzS@WGrBJG%a1#9oy znmhbKE@(vT=aA|aseq+lvGD?9{ut}gI*cu{b%VzxdNcTkHa0gIl!nvIhFH>pl2o5K zP2winxM@@iQ%IX5j0j`60h+yk0xE*KZ1@9mH31BzU}NcARSGo|bbs_zvTX@yglW;# z>bB!9(ZdA2fN<>Db6mD29-t9KXRwaCY*l&>XRKd$=nCyCYA;h)j|>iv54fvpjwVVr ztq}vnUcKX=HMxEXK>28HSvzAWc zXI%fETc+u-9omG3C^dkO;$-e?zTk!>6n^xHG^e8T7h1={Yf+!sASp=1o}qU-riAv* zobm%((%C})l;jcxg{-@*Wfm=!h|Y?HFPnV<%F(hh(!s43va;N@Qze06S)FKV4svbW z-w_%#@YAEJM~m&#$7fws3lq~1a)0s8Q%}rzf?U+<=58P50k z2puEVnu@EGKr!6A?nzF<4XF?15axkR;(-r}UJ?aNrSp>Q;{!8uob-0JdJBJxj!-9` z4hW;FtuIsl0W@ajBCvR`ZiF6*q)_U#a;Cs7V~>vq=PO7Y1w{BBe*mt5R}rwl!2IO-_3_d|yL zR;nNcNXn)JbTkx8pOc8p;^qXbUO5{C8>5(aJg&x2R{mv}`%?@s3SNtK1M6yZh}^x~ z_abiY<6pJ5A?;Qkh_=T)(f3RirgFk8Y2c$ZQbjx*SY=0ytF9_je-*D%Eqf{O6372# zX4WcUNdvDPu|#fo?jo-griQwWXs$%dV%Ru>H%*Wt@^#nx#!%~6+;j=RjiA98^6>>5 z0w*|*K9D89a$sb@J8jafGBL@)3egBJ51;|$^ig6i*@gcGz7%LU=DA@}glw6a8!b0_ z_672$TYWVyv)a=jN8djH356xVF%g8Rm6l>`C1t^>y^Se!F9F@w*wS zLgYNe6@nA$Y=hIZEE*>74A*TRk1?&eqv1};gvQfP2u*g#h?mVO2s(H8aH!yELn;o#4U#MZ@ z&0${&&eZ+JcIm|ueGS6C#W1rp^k}o_!3^D{rrOW=U6c{6Grs=287OHWQ7!qR0SxXM zsgwIzTzDRR7H!r@Sm7O>hM#89)UTninP7h00opNzhG%SmShcqDaFb8p7UNPI0(?HR zl`NV72Y-m1mQ_y>WpHHe(TWXVD=Mf=qQMYAQ+EHKNL}sl2t)wq4;nE|L)p|EH=_KI zDHl~$@KwNtfka$%(1#Z+wcx$}Vx-YuV|&sap-v3vRXvIN4pDb{wf|au>79r?Pv|hf zmz8Du>2~WhDthITxmmOlpi}mAmGYn!aFYbq=qr};Nc&jN`ywjwPjGrQ8mGoHFG8t- zVPDM$8uR*g{Bah&o-VLEyqv3gl~+U4AdR*4cctixatenUJz$>5wZ3Bo zcCcz8e8!l&+i*7o(w<9xg`Rf`MH2wqR%h{8N=@DyFqRX5-7?n|NA~rPdkF7@u$Nit z&j6=3TIb&ioV02u^Yi25j`G{-hu*e*E!2*jUO;`aczyQ0oCqd#wQY0`9(3ltrUEhF za7H-BE-Zq$-zecsF`4Ea$Krf4ch_FSRQ4lpUx=V08$e3=%R5U{`w2(*t^EUp;mBvg zMeuOUH#W;*Ur4S@_l11fJ7mq>4Vxyv?~OAuHD?6T{+K1{#P-H{xE=C90QWm1-3MqO zhA;H8cys0_5(j8t54V~U*F0G^_^yvVawngZMdTxZ;1=1E8@h>gasMu_$tRhXtzW9d zH48_ri0EjhRHd&R9c$dM+|V;7q#*yG_8Co8A`wp!dQ4V)Qvfx5&Wy{xk)ot0<;;~1 zWbTaG!t6Tq@!eBUV?x5(zKo;i{{eDlZp?h2s!NAF9t`}-K8Up3FPc8cf9}I}6Z<9U zh4yp6YJMV3^$)d_zJOzvMSI|+5Ck%?g!aJ?TlxcRw7Q z3RZO%i55z6H00iIk|^Q>%t2lRPG6N7g9T0;E#YVfsNRkvU^swD)%$Cd2xE2MW3FpU zrb;S6Oz_pasF-l?9_O?*0tZX`RnW#>644&x@IHBTgZPh5{uXKH6GGqtzI%JjRCRPQ z0?qzm|4jj@n*~Lq@bdy5ztU>G);sz7<(IL3 zE$wJPolW=j4P*NO`(6{sg%N2&O*kO~J4R-XVNi`W*SC#2HL9ll`lNcxu+1M?Ue~me zEx>c=H080UoQ@N2FcY7Yhx~Ow!|gAsFWC9gj-(y$@kOC>Nx%9!@+d?EK&o(CdfCEs z#0fRwaaTx+;UcL+Hr#5|I?MC7>fKnKA132O^~A^S)s)zFxIhJ#R<-LhUFEN%-yjvE zHTH=eIjBPUCap4xAD`43+8~uOEfkFR{FC=?k>HUsD?}+xMvsH!;?{tiC*@j_LC>K| z#!v=G<)A{NyO%x|aG%-6EYv$sJ|j1eueTQn>xjj>O)z91*NzlKQAr)S`ad7I>LjF3 zaMhg;iZEL8=U}F2acv$DhbKJ?NaoJ))3nSRtMH-*4}8p5w3YggMK4Q}Xz6bu+2br$ z#9x!M?da#KCI0|&yQqC4P|46Tga*(H3a23k*@(Q9c*|Dt)fQr&)wW{9hFJXidIw1! z?7q1xHfxk9k@mYZup8Nw-~LiHTn2N2?GLQJ5r+~miG6kUv{+LGXY6E72{jAFvHb(c ztb5-3USel6Oa7bsPuB44n9F%#@T$tw6ZAXB)l|vRQT~Aq(LBB#O}1U~V7wb^m>w&h zYoO=-5Ag0E;92!7I#&e7`}`m?-+pIXGqerUVA-!icbXl5VLARcz4Kwc^_YW+N#NSl zi)HN2{{&y@P0KmR_tQAY8~*++6CEEgW{9t#+}^@wwUv#)#ask7v@OAL4Y}|#NN$YF z0*v#LD(MzptZxSb!M$#;Uze2uCan8EiYW{7S4{zEQaH#eADl}I;d3y~?xl2ty9-Y9 zvr{&<#e+<}lW(+!3Y1ntzELrYqmLL~?S2{~`%SE@yxrIIIg=L#l5V**1;*|wQO!F^ za~oXV5wSi)9u@+X4l-^T;(_w^s8Sl7#ns(9*c<;1M{r(b0@3SPV3AwYs_oKwzh4t% z-E3I8WnnJH6#4+Zf2px72{01i225DA?&JJA<;eNdU6A;)3zKDB?3ZY4Y0bX#Nm+9j z`3&`uO&r-vAtRKN*1oYx--gDjV$$wVD%hEJ#XBb{&swK@V9=L{?UJrf7}W@SX*lOu z@gH(A{@U1k89bbdA9`qgm!v%*!qe?t^G-BvTeu}S$aI+|Gi(b&pX+xye@hoIPYe#9 za&cJzKHdBW9(EtDzv}2BstJ0I=(3`J>#Fx*%BE(B`6{KNSLPhK`d07u#Yqj)iP2V4 z)4O9G0q7yAEQGowbtRt_iv1l2z)8q0GyN`R=nckYYpuSGrqu~P5a&_9s-oh_ z+XKcE5C~4oaQIeYnz@wF`5EjblP)@3I?%7#g;1S~VaG2xsAGMRiw*uXtE-*h_-swV zOeB&(EpW3r1W|ThT=BEFuq#t-`_XqxvUDZ8l7BqYTbf9GyjcToNMDxf_QCUt`w_Q| z<8Y_a@E|m==}ZDd(w|C+FsJ?0ajN{th6aa!8;vrzacvBII`qYR;$H-#3dj)_8as>6 zo)~X6Am46ejl!umS}*J?v)@9vA%w7OlM`k0Z z2(_xHxR|nwp%~aq(yuXF&mzFBT8yWC{ua+g3cIS5lH^A}|@IK~VeP3AD z;P5xZ!KrppPb77pUOEy2J}cgAZr&@T2qUcD6q?8tL6_JZzc1 ztgKIRaBa&j@Drk_8<5(YyGh}!3f!hRS~V?V?2KEqnUD+932yg-H^3_h%V6wFbAd?u z{3B!Pn)Kc3nHem3n`eDE&DgyOC+Agp+H^tDDQ<>6?( zAtxua(>oQ&z@I-|=ks#E(C@zn-A}0Mzg@@W-#-$%D`QmTc$cWuE)5-6{R60;>7B{w zZO@Db^$*wN%36Q+hABCuKOLc1NZ2I%?^zGaVAW>?R3n+liAk{Of?Up=j!_%YqI2OMNySsHnB6pTuxKi{= zsCJIJsY(z=;hj5D!VhE{@LV|zldFHNV%6s(&+LBqn+$a5r@mq2Qtlpb9Q&TMRXc0@@p z_3)hF;T*_VNq|1j}nHY7v6I8CztyAhBbgH9UgH8 zcpgdjeB{Xmp8jb4vC|4M?RS0GSO=pJsggH*@o5x5IJVCjh-RmusM%c`TxcSp?z?F{Q|KnaCg`?Ws3&Az9&=9Qy9WCT(`kps&aFG?PCR$L`bc}gNU=-2!8XhP|6~{^@+)C-7J&AhD2$ej7 z#Pb^JvS%?OVS>a|*?*`rL|bG>u4qo`xQ+0guuL6)F?{uAod5hT@Cz}EVRuPAX}=iH zwf|601SMIPf0&V9IsI7>aU|z`h0I>%{H(FLttZBxy4S2fNh#G5CPjR8lz89M>`>Hk zYfS^XSQ{G8=M5T2;OmRK^{oWXt8T}^(oZ$7H~WFDMrl}vzSD+j(o_`5SbvH(=Vw$# zd-pD$v>NfNMtO+wg%4c4f5=KgR^{lAyCXNe?|??dTUv}i>iG0Uw9WxciMnXv5TZhE z!coP|UnpZJ5GiLCSzPODYSdXiI?_u;&L?CDHIPv3jGi-4lCju4-RdKoOyBISnu|Do@vn|&L!rrMm&I=a}XjYQTfFYhLDm5F8gnY z7uUAcsbmkimCJaUNjjV$H~yFe>)q3y;0l+mZP-LtMZ40QvaurMMpFb8mB3{4xMnh! zd$%!@#!S^w3u`G!Z1+eOwJ{%GXHv{lmLJJ>sfr=9(i4oEofb*9g*kNU&hwPRn5 z121|@iZAoBO!x{Fseci;Qv{t(OCf_C9EKb&9(=hcPmbqqH`y6C#f2S zaX|#wSa#tk!~ikx@Z}?f(|)g+d}$iA0_XO@EF&B zM#^#9+QC&#cyj?xfOK2IX-8(+9D_wf3XWRlHKNut8;`%do0DKoh`ogMW>VW zw0xI!9cg*Tz`cu@yQY;fxM3U%eOSv*?9+^~m2N~4D6fI@Wj2*tC$13&&DPV$i zcTw%I*=C16KBQxx##Phk69;1dQYJjjO(bK0>7tGpR@s)vUuKi|qI3OYigYC{LT{l9 zVss7=il%Ko$78EbL!(+_5}s^JBu4eL^;X0Vua0*sp*9T^gaUj{Am^)=)^xHRu*DbR zT8k#c3)=c>BawnZiLB*{R_8j2;gG8rWfWnctGgOJ{#b?J=b7<(B-u8|%$p~~5 zgEC>CT)@XWN{xSj4}PhaxAddF*OEsDZ4&2Gkb(Y@cMEIyKQYFx1_{lXVzt#4X$7BF zWz-iBYCFak?Z>&BPXy=8#ZQU1f;_0F{I|GQA7qTnpg35^QmyowF19~kT(BdFecS=8 zELdUzfo{`3l*(L}9E(G*Xu?%K^yBc1?l|9+%ktt$usaZfh(ejZ$KOe!b*`EM#97gh(tjD3@4Of%!RpFh{ui&^foj;%V~gPiT#k~Q}QopWUE z3XK%OyTuP75newsr@y(Is9L&f>t7sH3186y8OB-TiH5!rgi+~Ak3#rJBxo0EzTq+z znUO5%vzl&Igp|y%?>0H0^qKD$C?zK%+=w!KJ_S9NzsabCs58*=9X)PsC)CmSbZoYF z46U^RODd_jnvjk~{#43RPN69X-E{895MDp8%!EO5+Lec!ge~yIqEaftz6Q8H&)~tN ztt&~`upBY25KTalh_pyV1^c7CIYqE1KLfp~Z!yc`_VG)-#RckX9*(P&ao4D(H1Igh zwaXw7_)57ysS#s2fDTKxBV;M$s?1@mAABvm=#QoMQmv(CU>_lQM81RW+WIwAY93-> zP;ve9PlJ$4>q#TO(C1CL>cQIjq-*Y#o^)^W1W(yY< zHA^RsspdOp8qDoLb1!mTa7U5mmBUS0S&Y>uM=sA4x~V5Mw-h$Dcp^f!C_mwVs_bAKSd zh^gs*z&sVkXnwh94KJQk9prXpheL=K6qdYLTv0aQzG}!m`N=`-j-42i=5y^6qi$O2 zI#jVg_4S~lV0+ZpI$NY(!dP$8Bf(pU#)>tFgS@Tt2 zUA=sy)^czDBL4SjE#h3gWN3#M>Xrd!KHNTZoLxy|#oFG(IeSH~60<=VR~R-;uKi=O zk3X?G!i^IQuLc9rRZ29^b^1; zCUIzB! zdy1dnVlWl*D;4B7Vd+bXCvFh%uH~NEugq6bXxZ@1-KWa_;+xCH&yi8gyg|=tmJ5$r zCuAU3=@HO0J^%pw?ZyQvH~gsxP5IeOfWy@S`ayiu_0D7i z=uhEDB3QT4{7gG8#yZ(-w&N>>D(6gnSvZ5hE!03%?x%ukfr;aP5)LUkV1kZ1GIvpv zFIkIt9xc{Qnr+A$+r|Q(-Dpe#BgDV_~RY)lI>E9vsz)fpf-5mlSnaoW~9S`(0;EBF4jmY;DS1Q=*`2 ze}-z0kOtwuchu5r+$}IY?bIr2<{j>ldE+%oO+;(08LOg`%H2z@4t}X93 zmicxAX}^t{Sd{v*`+qX3G8~oy=-+yss^t?QLUH4%6{7`(I0na`e=Q_Wa&jVFQ(~?e z(W)Efv=0l=)5p#DC2?J5(MkBxov5BvNk@(XkgP1(y`Y{J^{o99wD1& z`q52D=r_-r2(v>ol}H9b@6fB{Cr{?2#%nEbCNd43M)1u{rtWMaFHcywiOOAQW&3WV zX|h?uO5=`8?H`~iKjL(lmh&k7{`%@(mun*A;0CLTLau+Q*`zorG-e9=`_pLS%*3Jq6(E*C4L@U- z={|e<;>hXYfvKjsElxJJbvE*W$ioIIxgT~Rk;K&L>qXG+!M3oxea;c=^WII0_&4;S zZSCPmBB{)8PHweP4{=@ke0_N<7(r9T6*q+=!=F7&IsEVc0F+IavonV|%S1{7)%~$+ z)=o<;W4SZV+y-CYD;W%Ja>sx`?%#RZF1BCp2Th(M%>TL`9*C6ENDM5xZ>V?f#Y$zm zx|FcWjrUS{>89xj!hRpPV9gD320YqT#>KyPPBx%cqV{rN45V4u3?6uj%^UBEo{U|d zLUy@a4fsihv3-lGooQ2C)c!cvjlX1=>p8t%En-~hT?*54-(I4TYKy88_CI^(+V(yA zh}Hd*pyMTeIaL4UGLQjU7)Zf6T99ZV$v$k8efRJ@c4+CU50SW+m!oxLt@F0EaqV;5 z%u%BQ%&ba_zG(G8eDur2DzRPgo?tk7t)e%-FbQ zvTqD_Z!5EOmtCKtZEO}D)+wBgNKH>~5b4mVno^bNaw#r*wv@qVSHhh+^9?@B4Q%+$ zY3}_+?u`_ozZP^p{fECLVJZF(N9#r-pz%_l6XGor~qHqTKBhduV+l=HJiPl2w z@gF|)!Lyu8EZsoGNlsb3?;2|i1ccHzl^Y$fY9{xIB1%Q_sGaBfHsozd?X#{$Y!u6b zhm2?F-N|6=`$em|MRI0{U&r|(W1(yVmWG*n)qf+a_RlLOxfNcZ$Zuvgj8$dm9o!oo zE(RRS&)?JBu;1i-#c$&>v|+V6%Iz^_hLkn{yKE}hokaldgVf4&=+hEK>qyNaVGvy> zWTBtzZrrJ-hG)=S)3%W9v2Cm!zYYylrsp@9*6;S7J6c>B9gWKlxndgfdi%gLH&@rf ze)XHK-@j9mzms(NgDG6e_?L)>0c@l=V>PE61FSTky;#Ka{sq;%pyigpL)JHxZOL+E zh5H>JM7*_Nykco3?^q#q;q}eogx)lBseUpgc>0q=mFSdtxb&35GQ5TbR1hDvUtUWU zIWWQnuW)|7W;1}L&-~Q~6E`cZK=;=}!!A-}$A(}}?9VfN-e>uN`@NNBgwNVn#K7@J zzlZ0Lh>2sR+nzf4+drA9ih9&arYhY-d)4_pHo=Yl?lxXz%LZ-T6=^*62%rL~0<%cb z^-q+M(Ik5Y%PeJdoltXib2kpilN513fLD$=(rOQ8DW5~$puAT80nn;!bo(c+&0|XY z1w#w#hHjNa_Pa7vhSWTNpM9x8>NaZeS7+y4lNJBeZEi8z(E#FI&4WAO4k2eBinRrG z&7pXZxrw9EnS;N0Y>airFjdY4=0N@v;C?{z1g{C;stc%OW zZv3d`9btHNd17bu*s>%orS+sl?#z(yG$M3qjx$dZA_J7{Cb@kH7h6@@n}>Zt(9nFD z7QP zo=qnAEU10U+|GfYjrU8)s{Fk#+R@$ULWk(6a_KbK58DY$D>bc=|fCS^1^cUIU=gB zEzGwm`2bX$Hfy-d6?0ga#AX2+y}`oVWDPDTxutxZ-nSBO4d~g?Ju(&O(R4#23@+@Z zKYRe7FncZ=T`qh1-<=tNn9X$dEcJobKfu_#6F(on8Msziv_dBG@fkTzmer`i9qq42 z49A3eF|p4Lyai71qw=66q0W09Uz~F5>Ov`4`Lu@i4os`IXcK*#1l%K}&$Wo-DI+_= z&F50t_tZ}^ROR8~uUA^9E(dc|X;x~sw=wJ|ZG4y+<-dCe#4;-6$XzG(=Bzm`vivx$Aw10C` zxSQ8F7t09N<7AuRCT(mymV@=p$|yP20c)dr7(d@tM)mdO*>fRyRx4Poe9|5^$X*uC zndadChWCh8Ww~FePpMX7T|~!>xIA9=8t*32mM@5sTZ=OG_7#XNAY!p{Fqo5sqTeVM z$h*jA?@E-nM=bO!xJCXMwG4dBOaUI#AdaaHOD;2N6K3CkqE%xSX_XU>fW5;g)B|lo z@yR#gopn9ISy3O_nLU~)?%o~ z-(oEn;I&Ar-TtcA%G5Bf&2{5P$43ks*Fs}md54=ke0#1w0!-t!aqy40PPCL-mwK03 zUnwisTSuqjUD;#TUobgBX%QQ6@2mR#o+bO<;t`5Sdbg-WBae62jtr18*igNupw7J= zTX_Pq9u5eyP@6NQXtt3LT{x@)uV}P?iu*aLj zJ_Qq~oGzy9nOAV7j1bSga|>3B{5^+{8_7?aS!sDe3D#JN9k1QeIeG_4 zXHdE(rqBO#fX6m={lzuB+G*AJmV#%tia2io$K`CgrZ(WWI|UO5L~jD|+c3s#w!&jO zIQb-+|3C1$buCdTh|rr2G}xFNNLycj9o?i~i<7Uuhy^^LL4?e8E8E`oRvyt|FciKo zw%VL`h<+OA-^^3EZ2Sp!F`|SF>2=X=N#@^fSrH`*_QeU2?p4jkm0uK}jZ?YRWUE_J z@U!-pN;Y(3ad6x}F`AOw2sykQz4i%}d zxncOKAa*bI3TyXIE?qyjFhbqdJM~OJsI_Cc-i?zT_Mw0FG70u>73?k}O~{M}pGV_* zy-u{y5f>@#TT<`_xP+)}r^~%edKy8`#+ni|CZ0U(@KJkIre~7R#vliNrQ>ipXDg-D za#MbmV>AeT{pk+huDIaNqv^iEm7*^_zK!O~>uvbBH#I8wK+bO9wvYf3A|~+qtU#}6$`9?oQrWp z<-l=}@yP`M{lb|7=Tch9+kQwX#&Ij3$(rXo0DsKif|BgEG00YwU(qsESqRbNmX;*r zSPfD~5Ji+ZI&n@ry_jek{trN~L$AGLBlPq16G0lJw>Zn+(OXT#pCIZ(7Sg{Tm$^la zA@9J0ThOW5Hwk@H(Z63gQ=4R|e>+ChYcHmSah>6w5-Fz6qQ>+?(|)+j0Iy7l8t2Tg zwBuR!50{3b=~xJLWcE0>pSOEeOJ&8J-sKm9=28duST?svuo`^RJ1V`t`)`%fVRdIa zl9CtMNJw=A9>%-9Wx3NLaeHrDM>s~!UL5s)sftqYSjvh=K%};eo9xBt9cKfR4m_tD ze?_g1FE~UhuB>QlYgO|A<{r@A@Vq$@{S_&E#E{q}$rs;s=%AV%;P2p)1Zf-(d#<8Z zv(r{CYCzq1FNN{mY1tC2VXy~siM1$K6!BHlCO2Q3ZM!m3S`q^AXHjN!+Qp_i3N5A~ z@bOBQTZTn^M zz}S$w5Zt`DyxB)&w9$z_++5*ns#$+UZP^d7&-P%BP8;@YOf&Ka@U!-!m+mk-aOjul&m#cg~z(%);>$00&gV z^wGLP-t~uWbOb*6F_8!Lqq%Ctft9;S)IjRtr|+-(#4JYA_j8t~r4jES4S2#!rTWPo zS3q!qIC!erJqBneg)ho}ZwDeCgvaZ08-s)7*27J8_ORh)qd6v%Rru6JXS0}rEAfe@ zhWo3v#b6to7D0xXNas$F^VcX{7=E}X_|=O1k4m(fJ`(Pb$) z1Xr*jTfi79Z!qJ);JO}wx{la-Q zsS8TW%sr85{KC@J@k>6MGJ04XR!U|bk(H4Y*#jPV{rue_P4`A-iTo2vh9~;QA5v}l zd->tBdS5v}ZhraA?u|Cf7P$>L)0gMQ5likf%+^-4#~#r7tYfEN3ZM)g@6}!WHlF}P zm>i6vPU$DqU;OTwT=|BT#WyeVOU$9_E-%jt10^Z$3F3|@ZPAMQ_S9p82K-8vTabW2 z;{I}Xi;1**P_W=mNg1j(bkBS~&J(jwUj-ihdDQC4ffxi$Gj15}{}{jJ7VbL_b=Viq zMo3+_@YFYQ(_Kl(05?`xoHq62OgK!nMKdF#R%_tLmSeCeY7cKOPIKlTW1AW9eS%aN z&}Banu^&$L8JuR^ljC*2RUJNc;?zqOReK1356h2S0aVX&~;_8748Z0|J=3sbBAbg6?* z?8n{S+Pp;K&^^+J{R9;a{yb42_@U|oV!ZeFmVLxX&t?%P zR`@^II?J%8->~nGMsc8`fHYE)3erf4k`hWcI8bm524kcn6$~2b?rt_3>Cw%AjRuL) z-Ta^3&)fTcw`1@2JATKm>pZ{l8E)$$VTlWF$$M{H+Ws~I)h)A3^Ko9D=<^B1O?3AM ze6Nor_Hyn%!l=P(!iRDCdz^#4kD~*Yi1a&%|IE&gVmo!PG++-SAtsiS*X9220~ylx z(p@6EdNf{cGTJV8);=kT4GNp@fX9l-IDOSrO8~SjsZZCwSMu4lW=#Z}juC~t>jd8& zXZkS}JZ-)>7Y0k+2D;cvx?jlps`K$`^odVd2v>|7S44kdO+i-K%%v8D)2Wb6Pui}U zxM1Du#+K(g6`(>KEdo}Imu7KeOdMy7JKc#yN7sv~84+KGHxu=j;mp6wK$hJhVPzxQ z`yX!koF+AKZ|7qr=C?RdhGv@>b%l4@`QcsWzO0DgHIcAsAsBw=oyqN~h_9ABq?hq1HuZV&Zwgj;*N&r%tmu>r9vKMG5o$ezz%hXy%RIEoXi z*;BX&Wb1e&iE~mH^OgQd-GMRU?hylCc%2CdwGJTHnkNnF)9^tZ^X+~zq~CcE7G;fm zy)9E_PEvsT5{$Z}(UAf>Rg( zF4n}H9zqXFytwVHIC<6$N6abxNhz^_B_kg6eVvfn#n^9&vevZafs^gsn->!STeZ}9 zlVi&}bS*mfX*jsKFN^(U(oM5|CpqRupVj&USZ=|S&cYozMq&E;qz)PO7tnf|A_UL% z-R&WmM9a;SmFk<~lHynOnPnqkEPR0YxGfgWqQ9B8c2<8J$va?M;FPsrrYzZ#TZ=|) zW915vsxx~`jgNMQm~^1LmSui?)TCTVcYE=3#{U2|)YUdX_Mx@7L^ko>rJFbSj-BUT zSwS#!?AH7`gnE`ea(*o8K-DPBD@D?DFCT%n!UNF<-oa`~2S4_VR(;y{2p(7Z=ZHt+ zu?d)8DQ8mp?H*2?jag!>R5_b}4K5|Mz;c2v5abWYl=8fIDz8$x|LchhwDM*022Ir5@J7vbSt2H@qpPbg_jEcyVP_JRtTH#f z0F6}jQEPs(gh5?%}$;??AUSfng58=4)h^&Z!$!sco(_F(@$^FjLco*EN%=TUKfIAbRWgH z3vuNY^|>8K;Dms+-CL{2xv9~8-XPnU*!Ue{_Pf*W^@Jb(N_JI)MQ=3wbKZ7{NCj57 z;Fmm!;cy}hZctEpJPHqW0i}_>pRK{~^*ovZ`3~!~k`MTNqOO|q@s9wQ`W{=B%(_57 zJ$qVZzSu6#l#1>l2shr505-R4Vj<%vwdT)?S<$neB`gd75*F9 z!;+}czK}LJtghS_S%{53uyABfTd%m=*|y&6>bF9UO&r@mpZM3GhFn_oE1UB!-t}HS zkTWX$cjCBi0S^1V`)g*J*bV%;@%M?9&#_NnX>a~Zp_#CP5uE?=@ZOtR-xU00?n(cBBX@yQBnnHoyT5S)a(-#=X}A(7Y7~5K zCj^005;N_(Ijm`DXpM`ctV{2?V5!_2S2+^WP1E~ZE~}wNEy)gg*~q&^Bm$(rN!!TF(%0s>hc9rJA+@9 zK$*cmqWS}@apo_vJf3<(8=<`&S&gpA7M_mOS)l~7xH8jj7B_uvM0Uamr6yC~C*j)h0Wpc8 ziz+H6InC$p05n$O_5@0`Ue)77r>X;kG*TxGsR>zE?zt2;(A6N*c$L_5a`bIJrwD%a zn02Z2jvWRKXmSLUeGYMbjjKoJAHNL0VuFOFd?vOWt<220kMYTW&)0w~>8Z^=-u9?G zKXI1u1_Eu6VGBDB?7ngnt}=skYcm$)4Y+F@k+4rtn=mhynbRxW^A0!tn~o>Oi31LB zM?0l$hZ6l!n_0W?RIJkrLj&glA0au5wc+=T4pqw#7-{6;hzHRQ#cfh;>|8roA{Mz{9vZpXWMC*XyN)xW8SVB*UxgXuY3sF;oS(wC&%}{R2W0 zC}OzFK-{4$WH`2RGJ&tRs{BKL%AMJ(ca1Khdz~d{#XBDuztN?Ox&PJDoh8NFy`%&a zq`xekq5FE0F*1o-dmeX>2m{va77MSL z_@-8<4!|^YJ=~d{{c`QHgb};{a??+rI39y_kCTaTE&_&;<$H{-Hny?E-McI5FuR6( zBQdsi1uSPu&4*Iw_Yw0`2MZK6qjvoAu%}TGhL|3w+_Zv4rJFtZ$L80+HhWQlH@p3I zj=cmg69?wzZgR1;ugkgMJ4sVlV1zr?)ItsXlhi=>#Q6%#eyzLRaNX1dPQPB$-0rKO zCi3ZLq-cHd+A!zuQRpaqxNxs#y0tgJctkO-T1!&u>C%nuK;7t13qizpobRX?Je*j4 z9?tgW@gS>Vh)Ugf6e#%nWOK~I{8-z0WNd*Pys>*#vgwaF9>Fh@J+R`=~H;hYnuS^?02re#-WZb<2mg6~EE3%_Mxm#Fd z5)qTKW);o6(^70Z_1-D+p88YxKW=V_v#+q3RgIQ`c+QpaIBRioT`I*UrSVKw(u_78 zbJGm@mUb{Y20%2EY0~57)|3*2L_Zfe_U;9PnL<4g5=9f2TBxQ}O_$9RmK@)hU=M|~ z*BamxUTsY*J1ToqLh4tm_4Th}F(`(@_0_|~L<@yUwj!;quv$)jw88K9_n0_gbG;8g zv9s%Moahwz6<5E^nchw^ZzX7({{h|w@|e1%2Ns^_Wj6Ai%43v`H~cidLOvp zyNlksRU)h2CD{8Xj2k$*6rpOO&E5UE2!|lMy8-?%9U1X%z@1#B5g;BeDYpN*_DY9} zyH(8p3`VF$QM~LOLF*Ty4BhSYWN98MxRv}Zk`i)PDwmSv&WSX$o~!KGh;Vh$oN#OU zbW=GaU+CL+DxUjqw60gA^-?abk45SjRBiVdl?OwH0cj775k6aw=Om^;A6I@?F&Wpy z*NK-pa5o}F;rm*%rNS5$E#vLym2DZW>fd`#oXd^>IDHa1Nk`X4G`r3z3kVc`WS*Vf zd%x>L+2!ERc(}h|e>0b9yFG&_DPhpTvz2kE zop@Nu+;Qsi$^n0~56M3)vH=|tX!xoQZPRMFVeLeBS|NQVeWLzKu_U5TS5M-e&&w~U z#dX6|D&{8-HGThFXlk%w!Og=Gqxcq%=tB}lq7gE`Z0uY)Xu9=FK9A+WE?YL#p7dbX zo7-r{`Ca~FG}B1QtII~j$-u)Sz(Y9pm4?RK@%?g;L+`NwYq9$Z1~G&jQ!T974J-SZ zVESj}^QX^xhP*X46^&E5rCy9QTI=t7aOXwG789-S3TE+Vmvr|6g~g9z=k?E*3$1o53K86ft~)?9aL32 zqJbfs4;r)(@X!cO?W+YNg`DCalF@4PHPy04v7!r_o#~Gz)Zlx<` z77I_9ywr~u6NwSYymqrV$EO>%RDDbd-2{94q%0Yf-{ZPZz2PvyV9odA8aJt{u@(mO&MzFHZC2w$kb6sz$XI32a& zqZutdDsei_t{ULa;=A~|#bnJy%{jai#4g)!tu83zaMB@E(AO+sEjDozOsGbv+>bsh`A8V&1tPm%Mto`I}{DMqS0)v!qn$BCJd`5YX@s~ z?o$^sRh0G>H9+kjFH<2@BC@H2i8|iYMJh~Weg3q1{LaT!Ks;W07|cbumZxn7Dqfr_ zY2Cw|(2YA|83(+z+^HBO8My9aLQ;8jT?%_PZy0O;d6$BFh?BPOjs6>#HCB^_%VbLy z*{ypU+D_6>E84l_t%nT?k#_pJjJLh-?Dh52?dv&V7AYY8fPSd5e*3G+7pkEFD}`Ae zezJ`jC_0TK<|{%;1$X$%$VjvD(;JR)+5ch;_w!elNz`+@!IOST%G=WhxiW8mo(B7L zPQcmge8E9qeS~=V$9|ndM|}S5WG$>)sQaLoDbW=$DnfGfUB48n%sB&=zUDJ^7MUf@WXPOoB?wRthurR_muxg$y?ff1_hxPuWrQf|^7YDQg9AWSc0uP)wv z?4oFfU9YQP0wY$ z>BlxYBN66wEyX5U^@cCVBi;`2pdb1sA2Wy97;c^gCH~f97~zwUUR4~+W3~3=dL5)J z@T5M~;cB}w0-2L=f34PcdDj#7BGZW#lKK&iC41LhI$YvJ`a(PxDW)2fA;kaWeUGH` zECfRBLavw>A~`{_th#6*vn>p%jdzA8^R2#1*8C5^`9br2vuLgL-9yo2otd+EBjld@ z6*ET%_#>66Y+t>Rdd4wE?6(uNzzS4+&)Qx_Okol_{&!G4e(j%KQp(vq4T$^HR09JA za)_+CL-kj8J;v^H%TW!+5um%SG{Xsgs`O)&Tb4xtzbowSt}Wowp(%kZt>q~5vDMxe zAo1MGI(CX5ce%8D>}fo{IVIB|`S4xzM|$ZK&g_iZvnsor04{Q@UQH8~aE^%1Zs6=|g-n!UqJwpZ<`~ zg&P|CD3T31voanwb3~J}VxK>|oJv_g*+yd)-AyrJJV33PSb!@Jn@jxxoB;zctbv0N@-mT>MK*jRw-N@TLo>{-S4RL? zRt^kYiEfyZ>~aHXI+V||RuxX%sfT=!=ifc3gm1Kd-W=JA5T`_c||x z90gdM1U6wr$nqyZus_juB&+!T`kq0mpN{iL*4XXR6!FaMAVlF;deK&4%b6jz$W0`) zgsw(LB|ln`^%>vD=7qk@Z6<6B^cHRcGBLin&&7D!y6sWohmS_(mPgRIQ1QPWmIs z(0IHDGg|;DM=URvc_V0VBy>cs$K@mT{G`wMOT{X~=?pEL*RC>Xenc#XotF3=yCWzs zA%xPLi@%xI>0R7}kn(Obb0F_d+%SY-UmgQ@!&;xz1~)?K*VaBvH4iH&iZ}EgDXEDbKm|Ix zqzvV+iyj48fc$pSK*wV3F!*l>OoQ{SavwXdst zQtyF`qoR@|r&l6Cfn}fOd*Byz@?UbCnpFIHgK4E1yPl(XN<7kA)gXdX_j*JSz;Fyt z-*jY9uLg1{zV7HguH5e1Y{6pL3}kC07_k>M57^Xx9x9h*$Bz@N25sj9FS=dL$M7LT zW_;Y0lY({($0z3QH8!uhle?y>KScsq#d=OLYa18-P|xOq zroHQvqVSakd}cEq@?w#yR=UZ)JEGaBS|X)?-*?iy@kzvBJu(W3^C0ZSJ>nvoX$2nk zUk+*&FnvGYJ0WuUS?fb2(%JDwpmf7c^m;34ir!l=2cztsI$DpbWw>N%RoAu{5Fh_$ zK8TjvX~3{3s8Csd}UzX6L4#w`tfXc|2I#?cq!Ib3ZG?7SiFW=HEflIPzx|B&#sq8`e*jcdKU`+XD_e@e3zRF*Y zW3|sLI$$gq>99MgBB`wd<|&GLj%p9lew2DC93mS$J?8s{CsvN!V)`A3fGqnWCcTI( z6K2aUE`yU|ib!ob0(IxY`lV5p&;A@{XwV%FzYc%k}OTD-o*F0WU>aoVCJ3tTi;>k&cWS)biDqOWDF zHY53+)NZ+hOKU4mnbXjKyQcqvy6*P0ccZIN^@F(;Of)cx#symB?$w9`T^xwz&%~BH z&WD5u0)IjEq_W`(wY6LaGYzl_0!1c8jFByeSq z^(~6K-o}Qp+!)pnz(&4l`B5I`<&!RgMHS<^k>saTtV_F}nOgqQtu9+lFvT}C{D#b; z<@;2}93vOkXL7>&`AVKd3=BHzE;3^+9Dq(+DPN+G9spxgttPKZx}DVf&|ud809x4u z@N&MRGNacjSFXA0&OINJbuU}#7N9Jb>WSg}GdpQ%2@IP4E^~KKqY-X;0bRQ1}HGXevjRij! zyB*GF4VJ|qBj{b#NaMTHrwDPYgpZcsR`>N_`F?iAL`US_tBdbRr$(Q^n;;gaxABlN zOryHXX)D%`e`8<7a$5uJBp`IJP9Mjnm$r$k+g-}7BDfxXe}Y|c$%xme>IwG_%_qnq zAuJ=@Wkq@Bshb|g29#p{>gz`jMzEdTJa@(&6?I^}7{OY?N;PwwEEDnT3&vUo(aA>n z;94&+O#0|Oc>OhdVNUM1?kpN;Dp#}~eVs_S*HT8zp`}<~A>Km!uU7o(3@r7N=98LN zb1w>1!&^tr?wg@Y^s&aDugRrh9O_?nC!T_Eocj zw{hc$cg)w-T47Fd0Z2mQ3QJQ-q3eBhE`({@Ftpm{z-TgHnOUdy zUg1!b*sq4%;T%I=qy#4RT|Si+JUK=uuT>qKat{m`&W3esor@y@n`U?kMUJMb}I<%yT8GvX6!EW>JOBhWIxrS zo`g-n3+~QX;zm@Xa;l(yTO{vmq*crGV4|f1!X4Jfnj($`c3XgQdUhXvz??kXtu|Dq zzTB_}Kdsoaw`CiZielBsH=;L+(+nW)7VSF&P?qk{SO;&+(U5#|e1}?EUs)T)U+&Vt zrn`|jw9OeWVdj)SwnH$f>F(Bza=Qr3q{X-T%x@GD%I-gw9*eomDLa9y7_D?gPsQ4x z`)U2EQyXk&jC;9%H~kj z@uw`Z!&H&69=UK?ZzrR2<5}h@!_%}K*Sj>zC)#;all;_-(`rGBl1K73ZVJYixt`}2 zj*rEM(bEE?KANR5f7LK_l5g#vURDV>z=PLkv@6Kl*+?&{T}Ll*zt)3IJ($7fV-iul zq#<5m4>YKA5n^slOlA#{S`qeKTla**K5sginC&`icXiJ*FaYbRsY7V3PssC+ep}=< z_emNQNZ0AlI3PTih8ob6K$6)-((73BP&4na7L;u5z2fvsULWI8VTd2hq+LTRYTP3J zBoy>(ow4yrok-3AvdjgRbSI#FWB||L2B%REbJx}kjjO33Ii{~VBY)>?w;Z3}_W2dN3-1mfq-0)nU{?XBu7+Hy|bz`>B zl_(hNA|oZ#4gyenxMAe&Q_|g0HIS*94&@j-qwf-OUZZhJ{<&m0h$nfP?2N_#YmWn% zl2Tc@T&h-U(#1iZpxiLJ*m;lNRIPPl4}>m1+|!<8&nb(L#t7kDN_HOW&Pfn*{J2_J zx{z~yyJ7D0?9qHo6KViwrdtOz9vNAO@Oq5#uzwGOdzl>1!1f%FC_{;cwiiT9jO%QJ zvkg&J?{X*p@?h>JtXr=Atxi+2XJS@>bCaXw=|uYMOJw;QnOd+VZo&0sNj;;@onI#o zaaXU=)wJwm=FC&A$f2j~+t}7tSy};E1@3dC^jegmF%d4c5KFUx9bH1tR`Yddgz9ct zAe=|rE6f+o<^3JlHTb_+SmlDZW-T_OXI>GOo2I?7oFt0(fB+8#af&AtZ|;Y+zrHh) z6{wq@siYkTPn4!Z{)>smkbn}YsZW3Sq28eR8N43hbUXVz@;9Sh4xhR^UB2^NcUafH z%W9~ZVunK34}nN(DcK2)Z}~Qi&&D0tr-(4pgFY~#LX`6hL=#AQ0<;28@Pouex zuo74j`O!AWgXqApnd*foGh2#?mVe#!rDpirhO%-1G}bC_2G(H`^47Oh@pAV#7mZy) z=0h6dF31p}!~KKqvYTZ^DUu{n%8ZLMOzCwK!@YfcCKI~5*}-R4@YrcLC{d8_8UAKn zixy7BqN=mG4G0wUNm(ZmI;|X_?c9dF4zXy38=x@%kVpwL6U5a|>uFPt%x)!ay@B2* z3=`Pr3!h8Yu~RqnjS%blYPJS3Lg9Q;SMm!H)+tj_VY*kwYG+a#Jt2f+5p38NbxN`F zK3q#&W>_g)(x+Kg`FBu)=_vIJI&s7Loowz?s%l_~xOj>vbpYBQX}r9xNri_PzMP_N zglL_K5nrQI7yJVn=7Wz;NlRE3 z?QtL<*X#ObPXtL*ZsqCiZR9O5i;+*ZMP`OYl3qdr@{@=v^dQ=9iDj)Lcc|HN{6y|l zT3*ewb}MECBlBapcbOsvxn&IuK&72@GW`i>sS_X22)dWL64*NmzcyR4=Nvj(etYhfr<;;^)H^+F;Du(Qd@cmP< z7b0Eg*}dnkZ*?*rO6@IHS2jcnI9w>O!lB5W@=FFvKMa~q;{aDe#k7ve$M+E zlTnssJOw!xd}`jEN_1f#&P6G6QDmW0_&y+f%WBsH`1z-a(B;83K+Tz%k#?1{QpOcGeGb@|E*#L;Vb^cqi{UykKEHjoI;# z;Xzkrr`B(~6b*y1-I7oW+_pm$e=f%`vXq>vhqh2AYWfS(btdYkorkUHwPmj56v}P3 zd;fwLru~yojt(>)6dMq^g&o@>GgAgoThB7??93JWN8T+=PU)9%XBC1}Fa`+2P{H)- ztRom=U)y2^64{qb;&pCJ4zTa>A+vU+A@ovVgXy6>3|m|& z5c|DnN19jqF?{u&Gj(3n*-uMu)+Z(8fsNK7hKfu|YP?7G|_ z$FBY42+00!i#FucC_)Q)|8fZL=rg}kIf~4NWdLQLo_HY7r?ru#pP0M6uy$60`Ly(*=XlSb3tOh1Y_UBT$Tu<+ zqNzi*Zb<+;0aIX-<))Zd!Vrd?1yCcDV$gJW!=zbm zvg)R>^pYbdRetr+*72*10mgaln)x+76?lYD(_bQALnaT$%{M9bv~H z`8;_JWhDO8eU67m{E~c)e^mMH{)&^Loj4@WOt$$mTJG4`!+0n6Ut70nU#qB`|Ib9j z+cMCopWecs)3H9LEh#l3oaR@xgFk!xKeQs+F@tg2n_rKm-lK;H59n}zT^BPJ#c?3@Df~V%VU$tnKqKm0G(A%p) zJB0xuspBtY282VX@)e$Q8B;aW(dgl_%|T#IPz@nVFkwd+oW2yiV&Mnv%`UYjIGlz_ z31n?dPkYpi-^<*UFhq;}wp?UnCSvk`MMy*{YysmCO$IflcsG}dRv4J5VsXwlCZd-H zcrrssTAb{8ilgT8$F1c8UVv68n?F;&l;vqmLK}lmzWDqsiCk3Y2!W1q#wKereG>ne zKQYDjuA_I>k_JF5cEP2OF0LNOO9PK_>eQ)W?x#O#voiz_-`z)fV z*gs`}X}qa5n5gS0j~*?&{n+$LBzC3|c1#Tqvtiuj)$ztuVZ2Yqo}v2@xkFW3SgK}} zqR`_gTvgA;6V?QGc{#|Hp>hpr9gPmCcE_XGczn>&&USve%~Ed#_IoQ2W7PC;oEmm$ z=_gy8#0NIAba8aDQ+PqAZJm?=a3jx*NRz;Z8lTU&w$a#Xsz$q-Y{D584BD%6*GOixcVL zPr^OX?XAx(ZK+@?1cih;VQ00Hm4APQZx`uWS-!2?^*UZ)%`PTd^NMS`{weo8 zQGbptyCQItk>)F&hGbuB!zw0jxC$jC^q@m20$jHpm>Meb%lK3uZHiBkpnp;GllY@f zkf&=RnAo$%E1Ln|V#*bUgsvaOIHZlG9e1yxE99_Om zTE9Iptt!@HKSEYaOHcjfUq zGFfs<@95+&G)xhoXngirEE-JyRpV=lifEe!SKR@teb}Z%tx=g4iK_hMRL~s)AgpbHNjvf8itLVsg^oE0~oIlyA}zPSmB#Dj8vS)e+5cmCL4f z26zkJ{1XiXGxlu;f*!i|AHbkPx9KPw@deK!hAP=?WCcyEBE6}Fm4-8Gmsf$|wCql= zqja7}-3lF~tTPh|{b)uZp)?T*Lf603@m3!$r?h#xF`|WR>F??S)`pCV3<0qXt!diXG2Ec*t+F9nafwuZuE; zLciZ;rkax9*EaNBzff;x}!PrVfUD`H#|Md2$?biuYjD%MBgElZ+VYYk~ zVX^f{eogivni)nH2V7K(L{w+8U_1+PHh6Bv=Md_{E5+e>y@CX2bCEhnwg`ym*R(+wybxobLRjMK2$Y= zcxtA7qbP*+g^Fo5B!Ud_A-WB5HqD{1=}XH^sI9E2N2FRhPyY%`_*0W|zp*>G$FD}HJ>!)pr3hwFo|8Z!&-u4B~ZeMx%CqtnRWrzLFHW%=m8 zW4C);fBpjyg6=Pk13@3?=-~QBqplJkx}{5@qZwc5CH4+t(mSAdk^w?|-L-K{2Bm7= zJ}iO3NRI<;cM^`cWu`fvY(U5y0iYW-c`8hFX)o5ZwO)r)HU3t*L>)Sm_(9GmgJ z*=LjHKes=Tx~x0OwlxnfIt5?J{dGo{s}h@zeVrS)<`&MMaJ>xIs}h}^GL_4>1}J~! zpkQp%)-s~oonEV}{TUcIvD??Oh_DEE3(@Wl5^@?XU?md#{MjU4&t-K6dWjjW&j4OdpI{+4iMS>?Je-aXpQ zfl=r5S7l60Y#g_lv_8(z_=-~2 z-!X3I3_@`wAW82sWWyMxryh|sR_oA`DhBmYled1F&&m5Ve|pyRK-n1_WV{5p?#ZEuyi;pCJeJ$#Slj5LRR=x<8hX~@W=!DIQ4okX8 zh#sLDvm?#^$8T$z#)gi|nkj`XGQ;NGs($9P=3PwRfha-VY4eK(XZ3I)YNLvY%cYE>gG#Db+!dtn(0DQxfnj^ zSp3>AkkgL*``OedtvH{QDS9OthF9A8hef!gxj`RE+6+-8r{>uHg0?dMHCvg1K;H3t z!L`O5o#_eRwOb{n$>ew^(JOUxZyke8!p}_4VRJ%dt=546)_>0Q3b{6h*d#}|RSu~h zUVO39=6XFGRJ9JR5-exN5Nz_7uZZ6S6eQ@C#D}N_aRvN)_N_sBPWkb-hLYW^zJ=m1 zJOFtng3i439xq)d8Fgwj%a#72f3A6No$Ngdw@In*xXcnGKiPd+7ZoXT?6;X@(druf4?u#82#IES8%Bnt zEK#(Vf6)GY0E}H^r0N+#`}T}kFdmUT3JYO0(^`jFDT!KP1;|yM+iXk{aH@G|a;Hlz z7yqx;2jxkeFyn>1@#Y3^P$y4mXN+C?kV36Lp=MN*(eyM5rM)7n}Tba1Xstl zL8Vy)q5f1{{;o5=l>ubyt}Yy(V?mVksF`?1c!Egymd$I_uD0-Bg z^CysD*y$I_ti1So^h$xs!~~r9w|~SK`L4@8tnq80(ir@V?a?b7;@x%Rloq6Nked1a zg8enIJ5KMlhBl+TI$e#|ck_QQfI4?tFjG*ty85CLsoJv|IP(BG-A7A2BOE)PKWji? zOYQfFN_Z|y&28?axO~E{-ZJA>_hC(iUpJjHM?E}RRoMAV*qpBZn=f?fLzQNoV&O@s zLRqu$KF?ZB+R(_Yz{l|F@jVi|?U##-P2%b(xxa5azdjt*saan!UJu<(`wuW)qXZ19 zZ|ZzV5^|`{`bJQ2w&`9|SgLaV@`4RfIV^p{^v+`3EanyBAC#dPR{YUVrjqGx*5P;5@<3$;& zDZMyVmd%}s54lY$9vhcTy{ocCx!x4pwS@3)PGm5&9hs{Ot*YMqG0Vz?3pb^kOkbhM z!s+q?_j=qTP3PooGx8P6)+N?%iphU_BTi%R_2sOoIhv*mwjm00IfAN7|7x=u)@8Y4 ziIoe5(K?>2nS^e3cs*~RKQ3L%D0yKda z0t;4Gmrc7RvY|{JX*gzP3S^k<*HyMZJi~vVZ0Du;2%;L4fbde_iU`p~g#kSwqI^5_JlxPx5%}n%9&Qq+i?6G8; zjZ7fk6OZ2th?~>a%9>K}33CR}dkC`!7XEwhYc@Ee4X@W`ms@4AR>}W9r{A{;p6(`3 z{T!wHGSyE9sV?#v_Cjg0I~!cshp!-5Rx%31=AUb=$oAWd*|DhmUY?z zUrU!V;Q7qi{f7op?=~J+KdhZyr?QewSSO#VR&zg;Jtvd#h9~64RkflwzCaxwR}L-) zhnf2dnDJ8G|LJ48E0+^5sRP&~Sq(8@k&YuL=+5ZZiz9n|cllv28;s1ho{+qJ+LsEp zDFJK~K=+&t<%Bh)Z@3J#AsmuI0FR$&J*1 z=mS>`SmmXa9=Z>;g?*_ zpT==kq<;>FMHiRQ4x`dFalt+5Pb?4!tGwB#_$}xwXTW~|($AA4FN=XyzfvfeRHiRb zcMbEu*RWNadNDEIxnS2_I{gxHsJdz~ep~KFWeNsa>9R+F=Gtyi{|x@>d0T^w2WrEz zNOxX2ti~1&T;|ejX(=?C4KGn;ZP9sKfV0y`N_}*OY9-Gzj(tN^)$!yDHNO!W{iamz z-K8-N8on)Gstb>!{?1vf)&&UJ18D1Kse7BRqb7JRvF*2EHq7FKF6SCY@;RFz&YuF4 z-t#K7P*J|VuN0U~0-@6(6FXv*yl#C$qm=mgy}hlIT^Q(F2=yCMl|E{!Ug)ekY!>b! z*U0hr!>SSHROK`-otToJqp=Kk)ypUG@?)mlK>JHu7hHoJL)$J#>%q*!0ZELc>v%gq zm}EC-_GfJNdmtD)C+4VnH^T<&c1C@Rs53O%A!V@zEWe7@Fp^jLLm$s4eMm{kRkz8< z_uZdFr2N-wpYQbV2v7CrnEJ>UJ8tpAnwCVirmSV-ogLblHd-l3Up{iXZ|O}1?Udjq z%>YqG_%}rd>(c-}^Rcy_)i1>)7eg;7oFDzcFUqIu&-lz3xFIp*Evf};ckVfQxEL1p z_I%cLcQ!!#2tJ*jm^;i-mF zY=U49a=Ww!xtkiAnti>jD`!-97?W_O^-a-bn_YeX?wT;CvYcjfb`&2UnV5+~v`u#O zd#9?RkbJ}Z#u!_>KslLUOp$F)P8qT{=vwz5dvr3KzcL~g-IbtxrH z9_>VKegbAYvWe#dGmpAJyLrxCbq?J>eE-95oZ4btrWxgLE(3;8u=ziGjzZJs4;p%4 zS>%^^JAdd{&e|cPEuN=8`S9Y-bK#hRG=;!S3ujPBA(Z$NsjvR$RrAegiBob8G6^$1 zwaL!21b$&s7tZ1IzHbBhLpik9KmS<0ALk7^_Hd0(#0+BVf>>WaFxv>Bv8O;gA1KXQ zTtupdr$;e?78!VaNZK_FVn=Pb2T9N4iuN{-aTz&uXV{(ULqk)J4v*z@dnln^S)FhA zCLsJwC+9R`i&&mHR%BFU<|3ruAlumaC$)me#e*bfnlX_%ZfUKJ>CPj7>(lqDs$HOu zwQ-G=OAg|l3H}?0+7h(8PUEXSS^2!%i3Y@ASen_Q(tD2`@(OR8A_Wfv_TojrPA5Qs-VKCzR}NTTK%8C-=us*#dhW(ZKKn=l+Ni-MFqnb4rCJ(rb}&e zY+d{Yvh*jffZ#q5^R6bdB+FMNDygL#)BZlY@HUY75GBz1Wl3balriSm@zQdyIEu@6)T-k7fqaJEbXaG>7d^ZT0ublj>;C zImahir*c{W+my99q8YzL-I~{Q=6HJCRQ4$Hx6w)mS-#? zc07Wfb~pBXTPbexwO6>qHXofvd=19CoP2?M@1I8cJ(BoAOR|1DNjR8*(2$yIG3d38 z>JAIf5&iPS=4wk`dJl7Sx)@#?ywe4J>Yh5n{w^aX=gjhV;)rkQXA8{^6P+A&xFdJK z;_1K2L+!o7{{Ti1M~q?)GbS7vX{!mNImso zU}B;NJfufioAOAvxMdJ%ArMWz63M!`JsoJIplugHj*$fyi&DN&VyyZ0XZfD18k0Y- z+PShb4l4QIqST zIyaxF*SqNWz$j8a;)Ja4xm?jo{4%_EenF$7DW5*XX1<79)g=tRBeU!gVDc0X_36WR zz2^eTe!!J}{dJFkql7#CSl?{^&NxF3Ljpc(2AjB=Oz!?vFerN4Z5xE90n7I5`SHJqxBgJIDc@1*OJhwVT;!ID8xkwcCl*ER80r5 zd&p>r%!zzj_Hm_^&a$a`wdVIrL)C1DoY8aly=K*&_^87diD5yapIe{2#cFD=gV!^@ z{rSFK;^UzMn|)fDHl4^y>UTdiG$S0$+nJ!yra49(0d-`t!TRd|>B}-*0m^`pqp z4gUhV%}(`JNT+_or|#55Rc{1Mx2oS^u?8b%Jpo0wz6pRailj;}Pn!VVeuH@MA+Cc8 z_wV*Nx~{#40>&(V7y>uB=aw{}I>xwlmbc)sYdkYGt8Mkm`&gWHz3%F# zQ^PI*e8w&{p=2|0{HOkAjR5=c`KNwE%FjE#{w~bT@oWOhAOBfyDgMcI zf6xDRb>P!GML+~CTNn5eA^CcQ;>2=H|K@MQP5w_&&ehn=?nnRBW@>vv#0aEcUZaV` zvI^<{|2gj(x>S#COFQXDYH)HCdlC!R|wh^Eb6L8ju31y+DB`K~`6)0w+ z)dx93&x;YVRHDUuL-1f$f-V1w;-UJe=9UmAN46+V%gZ`$CgQ7T`#ed~pzJ_N3Kgsf zbUQHB{Ot-wyrIB#|I8S{iATQi&2759`96GI_C4lgrNBm_#5Zvq+gId>g9%vMr#(Rr z>K1br5{Y;@`xo2_uobmz!C0@7)}(^3EZJLG$ygqls>h&{xF1oK+L=uct^$Xl;5WBN zsTp^QytP9{yj6`ijZB?UP1mjn4J@Is;_^B0DX5meOm#9w`{f~1B&G8xD4DD?0eD|K zr{vljw$bPFf^~hqRXJSbguD5q%&usvaIzbX6@-FAa#+WYS6RrT-|LYhEbxXiV18?8 zPDlESxe@9Soo_{_ZoXN)Nq0zID^Z*mpO@g_YqWSLxNmk1HO$;MCV7WtDDADqP3{C4 zSy`)#gMxa_e}L5wdIR#wU>7i9P2@^B`I=sRYk9^Vj+`-AguY2{dtdP$Z@OhUCNVTd zDccBqt)I`qZ7&)5{G?bUycqwrv}8X8ya$mrOEAr|$Y@rPE1u*ILh^6q;fG1o%SU zfM@ob`pUIUQUc7|R+8iGAci0%AOSyyCX=m$hnr)+@q*oPf=|Z&z3WBwVm;-K<7h%5 zqE_%w;#g1CvzZx)=7RFs`kN;=<4gMcHWCoKQPEGON%0UVX0*v*h!AV6+FCUl#x}n- zc$lMno_1}X0`ow7(w{4oR_}X-i8_&;@|!|*8W7*Uu_|R5Q$e1+zqfl){q-;S*8A2~-$=s--inJ>l0rIXYs zK_)|?vSi`fV-+~?)9hw|@pk-g<#NK3>|O1#Pfl3^u`&FApS2zzPao}(mGfzx3#;@xlbfwn z7t)Q@RvP-pTaC4cq?JZsz-t6VazZlfNL+#hg@_?Eq_h%K=#Vr4O`sN$#Ab>>wD$W( zl+BJ(6bfIG7E5Rp;JvkkHU#av=~QH)y|>-3pZ_o#kJFjH+~%`6&SuBeYx>PN7xN58 z3L{O_=`cheN14zD15L2%;82dqScI>mfdkZaG{d&-#3ebNBU!P)p&e%+LMyYVQ|UT- z5yi{^*6IR6gmK9LL)3NMpPfS6ykPg-)~mGHlW*679WEzHS7o2#{sA5aH%Zj#z#((p z{z2+&9ey7we7B}0 zF?Ai@4K|IHAJVPRWsvz}zbZ?ThGG$Sx!YWh<(~BEn?ta=UeW zE_C5)#rVGxekq8}R>rD?25;km>k%u8BkfKy#LEnfD=m1+;XwOT{jkDOKvZh64rx_+ zt5ca&6a;~L@OJPWFdU$V{q+EAz_%eeMn+Z(W)7YXFjyde&<-G-6(W=l-2FWew;&v) zIh*i=Ko_Xt1Be!kfR1oJkUIPwh7R8Su|Z!zIZ(L9hx76{QtAQxFm%AT92}rp zV<`h1lLT{vAoCzJ?HNU=VkaU0Xu1}Hqq21+vQ#pi3Vmtn3lp>m5a=NNM6^NG2gyqz(2D(q#-X6uS> zF}wqQ161DYer^f4X6{Yi8fogJDwL_iRJ|6q#CJnQw}AY>aRr9=?vsRYJ~3hg_{m2s zsPllo1vu&bcZtG4@2D&wash3A@F!sddysJil5x=c>hl~NfP{~DDVQMsaQ;#e3VnGU~cUkx3h3$e2)*{hKmz~yjR{|onS<2{8$0#I|ZkRvmtP9gc*U0@C+uXPaJN+EBXY1 zb}U#rp!fy#nDCtsf)IHFq%xZXSI~{S0XACGb|SHOBNdHL9L_|V1ArJbp|qeif*}AH z_*dpNKlw-8!v$Wt(s)UpVX!kqHM5GY=B;77`OJ6y`}d>>uH#3M3Q(@Pi`0KG~Pv z1R_HYBnBT0#x4Yg9yA6XEXF5L*eC$X*k5Rp!oA^!zrd?C967Ad;=VLi9MZnR`(h2G zWga<*eiTd$8@BabbOjrK3)p33!7O zt8y-i(sxh5a6^n1LPBhBG^mG-KqY|RYXNWo_*zI~x~$8UAgyD;%w|TdsHst)Z}~3$`@y@2gOXT^%Nlee^E zh_Fp>u+zsbBceY6lmwTEKRlFOsjq-AyI9*}`zX7EdO)G>PHSv`)#)+#G@a3UszO}O z_tZw{cT|Q%>VnzFKfR@lllpj=w~J>yy>sEWAC?oJmk!sFf*E1<2k(wBxLFx&t zxajjP-9%SH#o!9{N_3r+v zC{Wk&Y7-kzeG_z)CVw3XKgLCJ-+wrod_RAM!aPj2 zLz}yCCqm+V^Nlz<{-<%U)H#_4rGfpwt=JY~1VbWU>2%tH2T3QHu!E1U(^`eR4gOg= zcY96Vmai;@zWkRr8uML!>RP*bxn#0e2x%>EvC~^h{Li($ZMj#~epCKSYiOGqyf@Z) z|84rjD%yCm&=+p0C)`})vCP|E%YiOC;^gi5TCwob$KKBwL@Zhww7Yl%`6}D`H-P4O z#R8hk?iELcup8}Sq%TGDyg9lojsk7E zplYOj_ghy7cQ)w;5Aj5-@{9IWCsYJMdeV#V4B4Cp>eoecf2HC5vZd>P``HwYnM(S@ znD8h+p7cv0@nO6#7f^C%E~Y)ICD+1GtZS@GUT_U=jGyx!fEgPp~E{p!H+O0`ZeoFM@u?dx53}Z70I5 zP<%mtUebpfPnF{7rvi*t^r{gG{Q&8->|0Nz-bdY;;m^qrhUKhP;g#YuB_e9}+gw5j zpVGk(G-6q_0;|`0!T22E6WHw#s|*%Xa9$h4`T@5ko-&YeR%FY-PW<7;1K)U>AFjDl zcxv8EVAs_n1tj&3s&Cw02rWY&Nvso>H_k6iPsl%bmFofMbaFz)4=+c|ilhkc`~uAd z+Y3(Z_UzslGur`SE-1}EjK3eB$vU%7U`oEw(FN-VIekC%T`Y-+owAy&?HIm@Vp<`H z&8$#*9_yJHX9TGi<&saPj+8yf$t&U`xJcx|vzPA=$q12R;GFCkX8KC~oc0-RzZ%*7 zU@s9n6Y<3MVe`n;XOjYE3*l>p1DdMTDsKSHy$XXRCa_Ise?% zqfswcAM>BX@6UHf3@E*V4^%6lYpvK2!&mM(-?OjA6YzQZxott$(c>G*Cy>KEt65-{ z4nq+Fngb(U@P=-X_d}}(cP}`9oc;j*Ve&f+hVe5A$R0)|Y4Ze;6Y@t&j$unoe+$zZ zBRoT&VXu;nirT=N=8515`n9C0$j@o!4l=$>(L`$UoBZwU8USsRfTw7~S&{|U{I*U1 z(2fB~@5&piop|5|efAHSm*hBt(Is>`LVM*$A0Om`A zv?Nw<^aN8==(ZqS|C{=;`?2q%_#^5Nqgj}FR3_Xh)Tx^pcd{WIL!arcnh0ubRA$sl zlsal(SmvC{tP-6Xo$_v>kIIMe$y{omLY~U$hWGl|I?h+3RCSf=O8`KJ>`Tj~=L)`x zrz_*UGI~s}%Bd3Q9iC4mk)Ycl&%{8tzf_&sF2UQO`5bj%%9bHWdhlhIv7b=yUvBO+ zekOimHiA;iRB0I?x;Ju9z^+PfX#*v{P(2d+C(Qdn&ot7bvVv7^N1CP5c9jQm$E+B} z8T^D}5z$w{@E!nm^n&Pm=&!UR<0sDQUxpKRjV1X90Kc>zASr9?u4sJn8Dhn}1!rCG zf^HmKQT@F810q=fJm8M4nDM!?%VG8d6%z82WRz#L`51fw3?t;H?-!LJE{H~FIJf0Bu zyy9pW(KND2#&PBv3g9y@!{AJ)o;|?tF=*Gho(ri~WCF>5Kh%~pvazr)uB;Q6Rg+O7 zp4~Drsc9(U#D;_@F!z4>Ye#OJxNh04<3^`4V!?XlD;26WN&^8^s;h)9ui#7zzcEBq z(>a*sj)ssVG@SH>{Kx?%v-ar|AQnBO2`{xtNGUk)?MX_7B`$R&r$93moO)>I2tb+o zZP0-@dK`V|gYK=+zJb#nIJZed+$Rlyg98LA5H1|*E#OQY{PT$y+YLtE;{M*sJI7zzbu9F}CAzX*J*w#Kn*Nf|kKDj7Di&+)Z?VR6@-%B*v1an0cSP zxi@(S4D`Ecg16EjrI{n31dDV)S|@f)*4tvFZpj*$fSU!~L0;2i?fRI<3QK>Aew_{; zNu#}(r;#j*iH*?;_g-U+mn6^F6)kXvYirNWyfSVGc0nu-ZnoONn7mKl^3>OmOK6{8 z1hEy;MYz7&-G$cNfyz!55P5~|ZmwqbwF{*YFo_>)pq{A5n-hOk17pN8=xWw`tMC<$ zcJl<$ZD7oH>@FmJL7dz{+UUxJ@Tips){mMOcy-CpeX+_DRi$FcqhV zjZ#EZYy*@rjH7YtBhzii6U9RW=>Pzh0hfWTyGrUA0jKa`ltA_pljoHpOv29I&<+7x zmVv`^Kq6*J@=s&(W*T)xoWtf$bE91j3Z0_=lHaVetQK^rYKto-FyDJsSDr(ao5G0BT4-JoX2qs0L=THMB>iLQz z`thleUrsnvu_~101_Ebc*7%$E-z5lIp;@x9%FRqK`qVB z(WY7g67WnAy~0sM{5o`v3GD)KV8?&(jzJ+uU@xppMEMfbQ5ZB(7Y9dRFe(aB%YEce z06rEWX#07weCUPi4_8W37nsda`jmPn+N!da8DFroj5o(z|I3-g;A1h9$#>kE!J6_F zz0-`}ymjfo<<8~SaS!?hl%+U;uC1Pb1_tRHu5yaeq7srCk%n2ULZLT2R%)J1hj;?A z6UD+AKqoFA&$Y|5$Q#SGy3Mi>ql9oa@2{?b$O=A%@GxKyG6$MI$CQlh6$2ch$o(1o z)_+iTsJc)%2gn+^%)p^basiYL4YSbsblu81mrp^Jn#?HG98mA zK>h`95{$}4n1D!6lWLWMkK~bXHc(09C~h2UnQfUHb|ABH;*8}7Wl~I5Pe|stcl4Yk zHypiiaYkoPENhn2#OlT25AH*8)CvL2u66TvZKc&v)>YNkHkK1B7LriKA?&)z)%_N+ zeNWo3lQu2zN(24V{dag}ZhuY@Eh5DgJ`tTx8Weah$yH31u`t9yO#dkXwI`QH%x{!o z^y3S&aM{8YlY%#e_XWt^=nWYoS*`5t-0_z{dN9rrK^!iuX``t8qG>KsVrRXSQZ zNQ+uY+C^BJh9h>bLv{}Xt3rGiEE@1lJPwE}1POkF0W~o{G{JDiT7KL_J_8GDCJhXh z&c?2RMKIX|C!HpCVbB1kX_fS-wX&+Fz5#ecg$8a2dsUU0$Lv3R)$6}x3a^V&`7<<2 zop+Jn}&wiWHO0S-mk0DFTs%R6JqDk~I!S%x1-&>4+dgAF2zH6)O^m8$^jh z2iR@ola$PXeAKYjN|2Iyz3zvy7XqR~2MJhPO~i$P8+RKSCn_&;pb!mKq|^egp-4D1l+I30`j{rrK5y0%?o6}A(-$Pp`wqteJ$J#-781V$1tXhknlRefn?oiws= zXcT6MCIg1ueUhh|ykw@k8u+IZ!hahRu0;mMy93BA-Cga+7-rvT+PS`eu$&lSw_zuG zwC4R^L=-hKBKKK4ie=d!ZXYWqcvgP?pMoc(hQc6+2gt_L5HXhRA~a8~kQ)>hfRv@g zd>3opW)a<+?JM^-H_ul0<;v+wTI^|Tn(b-%dQTWRPCeJ|y@e)sRNIDj&(NzjZo8-5 z1D+bs-5OaD^}F>3Y#40bR+JlOo*NFUvq2|SHKGWjao=TfV?psS|3ijIcXUn?l2g)C(tR1No$jfXq4j*< z-)~{B{vAcWk-g#i0l)qDj1foc1cpfc^I}T#{_w`e<8ZQgya5Mq*LA+RJaaI=J@Z(w zkmgX7j&E^ zp9WFGpL>@p@^@Z<2G?8RDWu2A|Z7ni;1ox1*NUJ-u z8Gh4!6SGUZYIJ4XWFK~T9tozSstmUzCIQddl4IAzq%53b4NEH@APpXepK*4;z1!1j z?Y}o_H#18Fz=eDwJ0qx^Sf(5&E8|FE%l868n=*@PHs})(iX04<$$91CI<(jHOuL2( zf@KiOIzo|2UhTTmB1PY|{-h$4qwoCRe^g92SF8_Z4OBQF!m>$K9Y#uWE%_J3~_wJlWYTKHU7$^rwy@CmCSU<5Wgg{b7 z28YYy()$7+8$K*GK)sbgU|5yES@MCtSxBvKAe&DZ4VG!tp!az>C~<@Ne*(BdH-K+?=tp*XCDC?^)tf{-ct zL47V2#wj&jD9Ld;k{V~Th2&=cjZMtwrV!uZ!l{D#G%8dinxPB+6N8-0!1@^Vjh%iD zs7IW{fvU8Cu5zZW;8?*!4F={zwH0Il_lZkT@M;TH`WLFy>!MFd+&>$_v}h{i+P{VX zv?VNw4N=B}@gorOU)R8u3%9sFU!YdK43sr1OTMICC9{I@i#DX!1?c+hj!;=#ZY(ce zCcJ=1F|JQ*HaxIIv^`{a8}@36eJl&%Ew>x4tK$VRoFoJ?TsQb2?kf#^JsD}XA8nb* zt@PJj(EYJ*^VMeaN?WoaAX2=IGOR{b4~R8a>O(w(YLyV>KSuTeAElWLhu_}Lo|2e8 zl?58Ha4+IaD07>m^L%$sTj1q{0q>vee41uI`2IloE6oSI{bbRF0-x))DOye>ss*Z~r(2hRgs zI3d>;yxG_t+D+rmBd#LnwWZV*j~_`-0R-$c7B=su-MMslJO&L5fCy@f_*-`0u`rHh?_Pe#xC92i197u6r!|fJu)vNbg=jt0cV-oU?T$IjD%7Bz7cI z$jVp|DsaY>%B-nO=HIuzcmYiRo_TCs3JqV>BQ1FuQ5Y0QZsPiM3JjDM^@?V+;9nh1Las-}{a<;DvlZ>F|*^4?e`Irqm$-09z} z7P~G}wCu@&6I*L+Aw-CUezeRI!p87>k3!>;Zn8K;dpj@vxhnp#LBF4PH3b0hUUkVz z=>OKb+&3^<_fbwe%stFQ(mc{bRnQu?8gi11QBfnQdDgt@V0Y-cFFb`Yq$}`S{#JkJ z&(`YdcP2x$@`>&76V^1~=1s!_mIczWGIGO%c@fZs)C3`H(QW}+(MGxj=N!&W&Q&4~ zgm?=Z5tz{i3B{+ek%|(XuUc&lO{$6W77x zaD+*^_;3Pc`9qm|dc$vr9xcW9tHL)E7iUzcipx2{FKNlMlaJRquDclCi?eOBP%N>}}d!$rytD@;1$^yE^v3g6mjnAe0|WE3sl)rxh3k)7uQ_kY6ev zt;CR1HN#2^UZ!IN35zTWx~0x0s}Kcp%LTd)E+7gNqRFT}U`TG)Z|T5!KG3RyoBCvU za@MW9lW&L7v3`<_H0SHO51R1rrmXGj2y$oFB1&wk@8kBceu>hK<8hlX2QP0YY4h6l z1Ev_CnZxOF64Q}L0Y}$qHX5;=^SOZ2mX?C_dXvvSRj0|>^SZc)N8@)(T51O?QWZU?}c3M`cU zscHa|Ywb6~qd$G(Ik2y&NTBkf0;7Iap`czSLxtaTkhZjxhZ(bz$U&`#c9Z#N!7e(( z6AkZ1yueFrM}c@VxQGxV9*v+Yk}Ehw3hoDVhp~!!fi!^%1lNXoMcvU_RsoFAf~Q*g zB%<?QGggzWHx}^4-_(5q;fdoYSydm(o=gKrg&)DMQz=Nx zOEZ1_O?!#^vi-V8j-@|DrqycgDL=U+Gb_tlr(s(Z@%G$Uxc5Y^t5O@Xt>Z-D@=&k-tyu?@kEBRDk`78G7)?$aqQc70ERiRhcFIGcvP4=qu zO7_bBM0`oUTwA`YWaVlV=dCcSL1R5)5%EOSqQRA5nITbyFK{6e%u%Y$VBz#UGdkls zBcAo0MbE7|nw8Hr&xu*0#Qay13?O+fW9p+>M59_pVNGw#Ecy-+=@XD?eM;;MsNS*;``MDkDWBQ!~c zg48s=NxxE|vus5lM9J=?cDW@952YNQnA$$kwXf1!@aUF~g|$qJapyO$64@8NU*E zi|+yoRwh@!VNY1U8rVSfdW*-UU|hLipo7U4=&-gIVM`D=_(%fYXd@7d6g_^CeHm~v z<%X!dt`q<;VNZp?;VYb!g5nV~sT~4!b@fEex!v7ns&H!@B}wb)o7h<^DczRenb!7O zH;h)b;H{&2t)1Owg|5a*j`JvWTYm%7w@dT8UK>^2%DKaq2O~+-vF*!Dc6T`0cwPq2 ze3WCN*$rFg+aXxy)3w!9XuN`_+iyux@OvD73CL^`!*s*?gNTC$UBkxZ%EbI9WN`eo zivQZt-#-K>9)fUw?g0GYz5L_*((si-TCW~0@bG@4iIa7V7%kO#lxi*xIp;$+#SyjD0Q>h+sp@1QPWjw@ZTq(4Rhru4Gd;firqa2^EBs5H7iid))5>uV@ z5Tmdn2ayPbRU}$UI$E+CMkJ~zwBiiF?g&nem}ps}hm>H7G+({;Q(Q;+`Mu4~D!W>fL0n4vOTv!DQkMU{2FAS4E5bq3P8 zb<70A)qyD{*L)iCe#xT-N^2+?SPHQ+SSmB%IqD=y@Cu*`P#d3VdkxoazsD@hD=u+0 z8VyGW(XA-5*j}U0)s1T6SqUOc_mt;Z<=LOl8R}X=1^CX}o(|JFS$@y`C)o+LYdzaH zPh;fv9orLpKbJq|g`yi!Duc!T8ykuM>k_?Hrm?KHy5_nDT6epaDx%Hu{g>&hQ~hLp z<~yw2)}P#ua>1^RFkz)cT2Dsi{u*fADI2(*>20&`;rm2cWaYCPjoO8X6c`{Yv0OE< zYY6vE=Z@n5a;*}jLGB;K9y#Ok^%X$3|ArA$TIxYwjGqxi*>Ic?a27C=QKaOYVV%f@ zD(4U9&j>{+6toaPswrG!1UxZ6X+be+B_>sh!JV*zoflDS`nm*Y1c-?&h8=*@`Dmk3 zG(;5n8b{>^PKX&|o+YPy_(+r?u6^`N2o}9*yYc_ky79ke^ZH#k1hSJZMjL2^`@(hM zf}1Wcqp>+M+IT`=+o~#|(Hih?Wju@MH8&VbJ}rLEZ*Pw_uAs~FIKS2NBNMR^V%iMq z)UBvlTdjk&Q8LI^f+kXo~7 z0*;eQ+DJW0CZz-^HpaY;30q~VC}q(UgGW}{=x)R@m6hAn#H8qMfsR3}U{KieZScs+ zM?J7uj41z#c%92IyF2N~m9-fp(8;sPM>J7-9Yx@(Vg7j6mhqA!i7j`P5_h1$A@$ViT_+usTRVZ@}LfU429wEK1577 zlRn*VP9|-ZP2K%d*igX&OHOpT5_Jcmrlzl?$UjM1b>CJ|{AYgBwx(S-vD0pMLrh$Y zs{dD>Szp=f;Fdjg9ljTh2*Mvo3iNFx0RA>{C++svu#w1=nF#9X$!vbmT|+#reV&NG z6ynJY3o*-Z=d1S%hzUK;KyID_0g7 zc^V5;C78sMo3;R(oof|YfD51}m?$p@!1pW>06q1T2Zb`=Nu#fW2BT##6VXQ3t&)UB z=hNJ6tF&_1o+htemxxSqu{co%IoHG`${`~ZXG#Jx0MS6-(3Q-PQ;icep>q! zy$Zzv3jdL1EKDc=?!~+gEK_?)qR++2hY3zloi>Yg9N`Vncp3D@2 zTBLwv5Xr>V4P5u`ilc#Ce@5#~g9)A7P(s5^Q=Ep3RvNlmEkj1hgF-K#bpnbcYK6sb zA3B?5eG(ezQZ?k~%_-Ka8TL=#o`c=Z+gl?c z%Rx88KBxf&xh(ucPEaBAuvHLM?LE614CNQFR;^Gd*Tz{{vawZyTN#LspgBMKyO1R7 zpShXY>AB2^O!$y3OQr`hrpo`{OZi&~eNonD2ez84YdjioG0Tw7D5{n%Ef+B!^T=i|Y|eVzoR z3dPqNLLD=1hYbeM1Fr^S&oBJ|)ZFITGJ!&%#+U06g3{T_Er>8+OIIl$NOCG(zFffx zHIbeLDbs)W%~bibH)CGHLA8&@@w@sQMYC0^+WWy~wCfa_?*UrK3SZHw-DDauK!UAM zF7y;(0#87Iol#z=Ki{^07|QFrb(_E4L{REFcJ&lFx{$VU;1U?vRL0O&7PwLJV^sO(7>DeozZ7oGf;UmCOVpC_-2C5Spy0 zj=AGoKm!B{h)j(^)zN$`(mL8~$f=(q8_@t?IEY{YH*>bZ*uO}9$Ez6!FAy#;Zx9vM zg;n5!?3+$77PSwW9NFv0w7@P$28qXzS)jsZk&4f-aQi7Bpdnu>s-SUxGKs?a#~$+C zw|FhhY@g|U;i?8F(bO?Ipegb;(j09~7F|B>eAJCOb;iQO=6RQerOHtg)sc3dWYCJ`1WxNb9M}?!9Dpva>3FX-n7)w<` zkpYCFaS&EbSJggYAO=`s!m!9dE2&)S5Sf94I=U~LLIC*#1RKQn2aypXi?%C7vzP%l z1&-cAEo_lBC`?dyrSnW@`!3)p`-5bpZuT!Fd!9=Otm8*C;` z)Xl$7Ueh|RCZfT1`Ow)zM?aJWlV+4rIv0O~6^+lS+G}L9iXGjU&-m$>xOyP2S6Zxb z%F<+t?!x)Bj$N}5k?nag8sFCEwPoCKT)NiCQG6xer;(e-xP_Y4h5??xaoxOt>;~8U zs11!lGcrP;FYXGsoLt!JXG2a*G@m>M}EiLa8Fr?Wl7WerbYJyBIT)A!~??lwA z->yu;l|GQe@*xmPf8v{yPi@*bbL&umaQ@d+aOe^GHW3tsa4KC{aERQZN;a_v^L$$? zomp2v1D4w4m%o}Kwpr}K_$_7oaFAQYxB`g^Ocq?61ecnH!!vHjNT^ak1|>$7B#G$- z#FVmctK`HI0zQC)ez>2`-4{PYEpZDf2`chWxqR`S4H!>KQ4{W55amE#Wg?1?mqHLK zKgnu8AT+t9VFRiy-AJ>r%quhaP?S#u>dvf);I=2Px4E^qwzbw-K|9HjGcPJtAf=8>)kTD10FiCxX=(;(RHKu!3*lXh2Jm92km}E zluf91H57Kbl0%ph^%=ElgId>1>NxenTZepyzhjjW9a8m~m9e(#8{}JP{_2my_yrsU zSE-(*Li*-2vy1a{O-b_eu+m8JP6)U%p9AjuM+fN(gy~5Ku-?{f8wmkn=6l!qv2GV{ z_m*rsD#`|A`t-fEpQOW0+ux3nqL^sv2!8814JfNt(|XdolJtQskxHTqmvR#VG^S-Y zP8$_`Jn~K%i5y8+a&+=lQg-rJlFgzL!(y;i8cm4M?IO}9^)kbNGq#pCFm~6ls;oQ9 z&U}Ge@Q)r&5qrWVz`X=3?QsB<)dZGIWwtGl$18-0;rU}8`bBm};nG#5Yq={B~s+j2T-NGBo>6op~JC= z)5jkUpfpl{a`-?~$y-q71@=HCe4wCko3LW*bN3fKsH)h&K7~DKAgB9_V1C>L6(uX{ z%4(vwY@sE4dm5V-Fh^FN``d_Zu%GTc-m%cbox7Thwcdk)&!?~ZOzr`r_O;xpc`|>O zx2W#=5tZ*tT=dz_9`cgvL7ujqWt6JRtcI%pKojd15m_>TH*wY<_dk6`K>8JT$x+-+ zTrVPTE?%dTdqRQuK`T=mcI0U=muLPXhR&C)6EWPt@^P_=@@3q`E?$j70Wwnf_#|Ud zw=J>iR*9ey`l9FIK$AQQELtpTqbMD_NzRH543>U6j|_7DgTwtq5FJ86l>a>CWfx!0 z8(_;YWCRKj(DH3Iq3K$x1}lm7kyg_}u)ecdU;DtyDb}{nbNtKhJ(^t?qd!Zi$jNgw z*&dF5gYDCNoi6E_&qvNUiFV;Vs2 zgEW9E&z_RlWk`k?BpnPp2J;axg}9hO$6|(TYU5#PCngq2LKC1s+ZGs42QnEXgTaPK zZI1>o@tG9*n1NxY5Rcg~f_}vaSj7TVK#aH0#BvzovBqMf=SXEBos?yCd(+Ag=_6q~vUurDuI2~^)rn{guy&0DoQQK8%=NABU|d!2)tv+!0}r?W|y z$n5R9ZU%3!j7MnS!-|yT*VUEeQ-dP!tq|Jn&NEw&%f{|iRVMS-oji;C#&=@nWhcJP z8g^rWUy(gF1UF^@J7*v-I6KJH`t3cBB$!BFr}j4gIP;9AuXFH(*nj@Iy*>SD5Rxjgj0#(lmd(irv1#s8Q5CIShE_lg2_pzJPH*q?Cs_1n8#T=Um0m)e$oV+)b z2cAV_dLJdqY5O;vGr>Fqjn>XOo4Q%Vl}qo&za7{=TV8K+5e~{1ZZ>Pt)6pfa)9^TX zqCTVTcLRD=r_@P(-m9 zv{ZfHo~NI;%}>Wo$Ow@MjtM}BEaL(&ZkYv%1aGAw06|V5CP@nl>LB!R^a`3_2n`@Q zL`-=V&~)li)eY5o9MV&DHPu3=yX(CM4}QOX-^|M5>gsOmelM%<>N5H52TV)^U?T)S zkj>>YqMzf9p;6*xbU64^_|nPja*k)7lQNe`>OWw)L_tS>vO$=1TuV>N7 zqD95)@e9u_%FmfSe*V%}GptMr#SLx{9On|I3S$9T@|46TcsQk)u*pGbd1H-7e>MM-2ME*trRp;!=Rjdbn-v5vQewv9xfZFQriwL29gMw9V^l^w__g(Efd0oj3#!T zqy5Y-F!F7tXJFZq$y+?aw+)1$?Kpz4!;ZpoI}DlZG{Uge_QROA9l-4(j==csAojsv z*>Og908n5xtUp%_D^EvZ#~g?7wiV*BjXDUUu$vr&A<`{oNVYi&6zHj*jr{9(L7yG| zXnCRk!#Obsu*9SZ8_g?@%L_?eh-0}xnU-;T1GP+V=WFNj-7fbS$kl64WIG&WGr-yx zF(+tb6tFAOmLw-&n1prXEP6=PCin%U1Pu${$#}%adfA0_GnY6?91+rnKLeBK;m^V| zpah)?$c1;P<7=3YPZ7cviXY3qn+>wd3~Gg4svlj}PK)ugf!`+xPzgvSEJ2=|v__vMAIbkQ5>=*);1OXfg2@b*y*e2m&0!9hb(b=_ajZ`T;)?^KHNd48VZ;e-z^+`4 zjf~STz7idi(+g|PpX0-(XJQ+B4xrf-spG=@Uh|{#+}V>U{LK1uyjxaej>Hbc7oMC1 z55#}NgY4aG(+Eu^YA}Ztk(Rjg9^avDJL}wa0?F|#VCaZN2M?6~{tjgN{R|&JM{-{t zNHBwkkBx%ahkm`h>|rin9^`=spZszMnO^9PJZA+D_+SX}=+1-=xZPjD$AUa#$5C01 zF17F&HYEi{lD5EM9!D4?7HlaDj;bV0BKA0%7P%5tbu*`Q@DMG=oERD->y)s|X;3SkjPFL; zJxrPrvhpY*)yqH#+t+V~KM1ePXAxLuGh%73#3;8|rqUbUD7!)!+GxHM#HVpqUSW7JTfp14ZQHhO z+qP}nwr$(ivu)cp&YLq|Cz+u{OU&m;t%-~a7+O3X9NK1pC1JY*y2x~#9Q>x%L08g z+JbzNg329wDoHPXv}M2Vizce?o2ej}uMVL~{adAbsNJnI50r0Ff*`&*Fjw6h=dDeF zFB0#|*89%_DFCL+px*IX_j{xIT~WMG{%)zWcRF~TyQhFZQZiobZn&8P_R)s5Z;W~2 zyllXCzdHF_-1x&U-U{-#s!W{9vKSSaaFuM0KF4gXMF%s=CVOL69t3HI#!W7A`9G(j zV-Z&qr@fI8iM@qByieCZS1%mi9pXiId@OawCaXOTTc^D-JgxYsiIBdPuP=C7s*jas zypG?RqQbu;P2r2#sPpE}tF@oCW~uXw-)BwI|G$4)e?OZO;*Nx?Un48rUGX#cwQkA5 zFz;Je(d%w+RL)+P6WhhtduP^$hb7r6~XL>{_~>*IRQDK(UzQy{ZuZ_2l) zy+V9xJ=DJ_QL|_hcPaS%1%H5!>oRuPf2zabS!VSG%87EvEw}!@1=6EJ*b41`d_t&@ zJBg`~Plm_TZjeDNYHze*ZFlNhF=0?=D_32N$t|wsxS3{N;#z8B+9Z{{$N!MgpBV+2 z1uRKds0RD{v$OP-1YP4KUc-sz7al$pQ{gdJK5ui0eQ-2|PQ|6T@Q( z*@Y_Y34O(U0T3#MeX;a9ai*QAXp3C6QEy2e6K+JJKd`ivKtmVxPshf}uvyZfi#fbKpfd~dNBI72wk@RR@{e+{%J zX~8w%4ZZy%jWZ4&DI~`<-$dW6{vLC@kpgK(5|$?-U%b|cxXTi9_2B!C{Ed1cJeEv8 zsh_#m(7nMAg}h&TC(!&a_}ugv-)3~@p23GZFD!kZ_1&-sHGiP|-n|4JQ_?I6Kf_W6 z_X%qYyN`I?>($SWwLR~TPBWD!?VI2uUq#T06$|XW0Z8l*!wYQp8i6a4FZd4gS$)P3 zm~D_fWY`0x54~^tKG=hNH`M)z%wvl3Tipk5eWd>Zl?n|x?_GeP&`2_52DtK${g~1T zsjqxuZ*o2+deY=jhEaJ;h55h9dFu?>d)|TX(3d9i4U~b-fUOzZBR5BSXL|>9Ptgwe z_uDV^eA{W;FQ&*O>*Va@*vYbG{RH4s1PU&wA|{L?gKQ#xk#gKQ&Hwh6N)Mz*1o|*Ym^{3fye!<0aN*L5INY){-gM#}+4e0d`GOhqUP?(IVpx zU>C`~g!X27!P*#KWL<;!f$kr`+nxyZd!|R=`U0^8Z7D&!58mYYvCOvx%TpM%b=-4j zwJ|!Mz@7;hP#TZen@QC|h9{IyTIKNcBH$7r!jGs9z=_DbD)}|)^kUm$lNGAp->OVPqbcu>LOrw^!#b=`)(7i?znXaWTI<3k8Y)$ zP|UeFwL`2^$Y1bBOsxR9CZ^9MPf#)cr0+D$5xwKEBg+P$w4#*?x>g|C)2em;!^()k zV#O3*=w(|-<$d*d&374g3rAbaG5=kbuT;BvVFSHfS9T5GlzYX5Ru9Zi)?7DF6WAI3bl!5D_c%hbgH0MwPn-G7bVI$pBHZ-a?PMt$eKl5O*FJ}y;Z{~0;5*Vp zzE5L|@va`t`NkqF3i2NJ}K{CR$vXtqiStu8=I= z4;_lvs&S=qMR%hXx)N0r9g4QmEAtlC`sd?TVfB0VibHw&`IZ>%^Q|O--SYpd%2149 zS0@8rSUP*o+Ra_13fB*(DKn0N0q`V4%)$stR1w|J?fPfq#NJ|O#GV20u43Fl#RzF; z;w5yc+%0z_w{?K(7!+NVxX|TKJPrbrt|u2W5Z_#k3O zCyH1IKSLSQSnj8@&1i4P94T^IRRF5=4;>bCU9RGG7jpm~ZV6IvucnaufZ!iP4V5pB zkozZA;wmPIh?4Ytiyrq8hUh$t4!85q<0gcG6Y|Pb0x{uO-QP^rk{V;JHxTz9eK~pg zyn0-ON>BiLm4^COTx%+^ziSGgJRp=qu=7o8NUc2T5%GeU^~m_S`I6IaD;>eJDkUTv z6u+MMrQ~c7ghplizCwS9mbW!mecJHBE9=vrtD^HIQLhxeozChnR^;u&YhYP;?)gLY zkv^=v=D126NRqGspKiO{?+T|t>oWy-3wppqL0y=zFOmgH%?!o2fWxhraw~ly;Kcrn zgodb>b8G$2y*jS%4Z7-ZxRLpIkDmbZTJ04&O|~}R zGF>dkY-QR@pGZIK3P7V}hqrj%<}MEN<~Ba&88xzaOIOKZc61xg8X!W2Pl*m0=H z7MTDLCuHoQSovnhKMUqJwk)6v%!)gcexdID&*Fl}6oLHNZ)pqY9PcQ4QRIVfW`#Y# z6OQwA`KzH|g66g2ErQxG>oB1WcqP*9VK7sB3G4eU3tB(!R^&P1$lGx5y26`;&$jgT zp>_4a52p?~=*`>kF7#V@SOhZ(Lk@l*CI61RP433HTL?-5`MQw*9@0QfN-?NFKG={; z7Kk|XVUR@WqKbS{Lc5CO1_+xK;U?}8mti#%K}pmY&<9`S5+XQN0%jz{fE>iZFX6V8 zL%oBN;IV?#)62XAaNM9F0vr=2G>?HJ@nvKtz?2$+=F9Wz?sdcCj3L$cBj580a{Y#F zjG8z29W=Mmznu!37bsql;3N7aL>IX(Ql68)BMpNNkV)-QV*FVs%P>#5SNJZ`(>m2Q zy4KRnxy}2B^Bh2O1kH1$U3d@SI^eyic;>z3zgYIPe`5ia_wfh&!*1cQhmQ^}27D?5 z<_R(K1H9M~ed5rwCe>!cI9_prO#*qt6UC1^okKW*f|5auT*!~(s?(=8r@*Syr@&fM z3!N&e)d{bX@Y_OY6(k1IIpyq|#8NMcW3ep_`!a>6Y6u&I}%~~R? z<$g*`$GA{1Jv8?bG*&p`*uRC5M8gOr5T;F z%5EM(Umig{d^iJu*7h+PQBqxKDUU(lxm052d0xW>jpJ)Ha(typ;*KT_#qZ_UpW~No z)#X&{w|w4PO&BnP&eVsVxZC;lCkZ*J5=~Hvt3|{K?2Q?412JulZyBT9)F<%1W#!<-fB3Q+!iK}8GO+GP9_Rxuf~2Kq_!^nN&Zq%4ld|P z`$yh_!zhaf!A%6B(?863RH6;bVi0JKm`ISp;1Kp?&-p+~?l=jg?ZP>C?A9AW3mhs> z7dc;m1n^Rqbb1TgbPJOIyV4L0?9W24>vW~z@-Vo{3R=c7wgkp)^Z5D_+Z^K@^A7qlhh&CD zwrIv>vj#_K0lM_FVJH^6&F8`2K6t159fMj}cSvEeRzS{Xh~+g5v0+ zw5S9Z7Opl6T1BY12eF0f>D3dDM*muz~%zBqF zbDJsSf`;zWTGk*@-WQ+!cK8|^`{*_I={PDLg~#9QHJQBKnNHhQ6XqMC={re%_)4x^ znlyQw<<-_3l_$slJ0P;?W&UOKWgR_b1}LBgz{Xs$CJd{~%Di@JO0+@UP}hKIi6M>| zF$~>5YT|RF_9YIXB=bU*3nm4ZX8Do&z<~=~l;?;q1Wi9s6@Ub*KHIOQcwM`&Mo3NX zmTC;GYsXSSh8L&dp+_0cK~JKV?d8Myc-QBiH@~~-BzfQZ9S;OCEJ%nzHShs^u3c>f zUkm1+!99V8wvWF13GWm;rW&NS&7_lmy(yh6NM+pYIS@10T{u4X#~e)0>$Qux>l zd=LtNL@P{DLT9xXP!rALzkS>M@vA?7W6Fro<2Qz>m_6?N5vIY2`MU)k3&<4?G;`8m zHZGcYse?DaJ{841(0~*uv0ghQ%Fy$b9M~Q{1YjD3 zu5oA$=_s1#dl;^(ecOFQ;WPQV2!^NM`#i+v9tVBBzEEXrblqsIFQ4&wu5@in&iCyv zzbqx5ugzTmCE(fk(62N%&_F?;>;OUo}%QmTfeT0&uNO}o2``J+vF9cPrvt7)`+jP+j>4>bedd`{mIlq zV0$^69M+#o`G7TiE7{)Q@MR%$@svQCI!aH_aBaj_o zs5yun8v~FMO7R27@Fr%MX-ou#n3@4xFtrkhS+{O7;CB|DX=+sQx}eY&O; z<%pE@noCr3fQMN#ra}3ZYHTGvc5Ug{>9TlMVMEH~wZ>EfCZ_2!mNslcC|{QDKbTUf z;RPkp=v1mqKML-&%hOFOgVWKD1*P){4Gd_q>@BsVa(v&b+A?3p)Y**hj|K);r3$v6%cWj6y`GG?=ZxN!ZbX&2RIX#Nt8$Y}LwhQNNsrafHZ zx^;FcnyB{+wMT{6#O;@4x3Yv+h&nMd?~DV7cClr^f6(}Ys_x8uy8{waeE{&&^Z;V3 z8U%pE-0fo5C}#j25@+V0L1V70?8IaS#kAKD%mUMi!*l?o|2=)qHoC6*%6hZKY$P;) z5k6{eRST=}ZAXoM!0UOH!?IUgt>SNeh#Vz2k$;>~Plg^PrSp4y9gH=nFv$UII|uo0 zMVwld8H>#f#YfbDc!)--@eS6LU|b2x6w&jEkSoJHWQ}@V*jqqgypJK5;Y4wIa5g}~ z8zlVJ5zwwIr^0r*7&driF4~|%V3Zn^qTvPu*zV^>4a4Cv_8?qXwWi4!z}ZOXRa{%~ zjcmUi0bkR5v+<<0kkzyJ_ksJz@A*YZ#S}p)?`I?V)FYm z4Cv+qc!JKco2_uyF*YR#J0pyj(XDwhFAzYbVUJ8`X)S#SePu0HB9QK-pv_hbyKpggkZENn~*#7vPUbDiJ(fhw@K0Xe+*X42At^g~S)!pzJ zEJdJpzizjGi;k@sPRHDo&)eibdW82FTgR6mjMZZ6j}w>I_V|B~uu|8Tf!Sg`3Jv?x z-&m!4Qj7o>)PKuSU*6)LFB7$MkBgKsH0Lz;DignXq=T_}tbyk_+`i&H_}zVzxp10v zkAB2B$0uLx8Y0OzT@b|p*z6o2;7>uqFvgZs&*ekj1$+I2yT1-j8DY7fAcJF`4#{)JSOlmJRzMLB#+T|r(+CuMdxDG&+J zW>85&v=C!8vqTvDW}A186j_W0cN5i}m*;C=m8Pflzk%krZ|5`W@=5RcdHv-M@5x16 zj}WhUUEuUT%eq56UgT(huHY5&B>g~_FI%TS`*rC0p?rm+KYA;3B2p!gUny{)R7|0j#6Y-;XvPe}8Vr!#;sL4he z2KhvE5YS5^j5EP5`ghYz`TR(NgY|CA}2lKj07~B07^CsHPR3= z=$ZRMgFF7=AfO0Mhbil@LaAzp|9)^OH44Y8G&v{}PK1I5Ld0kDeX63jT=539-#h6m z(0lM+hCq+$=%4f`_`#dlzgHb{4+WZ5U7VJL%n=8uRx8HiGUITyhfAe1Vx~d>aohkK z&R81F#89*Z(tu!N=M-7<)YXv(Lpg>*FtsxxO`m{-q4)_@^?SBokK^X=`P*NopV6IY z`=5u!lYA#NdOj9*;OoGv8Zar=Jp<}Nj~{hfgs`WYeu#>Rm5E*!r6Tihbq8isFJa%D z->~0p%11hyoq^|IB%3sWJ3Dc?2>itW3Q%A`1n%6%-xL339L`Qdgt%<9knI}h&}jf) z07>_yR7Lvj+y|PLUiV$(=B%lo&AsV=VlA?ec zE9}V_b?;W^Gr6veF~Zi{OYlY6YyP`woAP_(P5#E2?;~C{w|Ps9x0Sg4FR}wK+jkT? zbWIGa{I=p|7^a=03yktcA%K*(=C9({tA&!jh@amM3)1^gF|lQInYl6H|sR-+1yRJm@F3_{JEgn0Kio z6Z1`LO*`M9Ei3Q-ZfHJHH!WV4twF#;wfoXk(BZv_u^eS-B_mh4Dhtufw=H1k9jK;c zY^J?X1H$+kw#$eRF*zB|bII&%ZqI8a;$ARl$B21UeI#6@I#1t2q$VS&J2 z?;uR8?=CR=DXy50@nZM!n`VuxsSi*{nFB)3&?8>^nyg1~&4gIy0j^y4(y56D{t=XM zH6&B}IlOVX4J0vyaKyOtK{L>m#34}V#$^MtK%zxQfv(Ct*oX(%-}mFX>B`d;_}Of7?F2u&GPT6RQ%QwvM4O>r;08Y z`k#FWchUR4JwPad<63cBN@dhZdCMa>DLTOrcyh(9DJv

    G-!x<`SWLkcSXDqCMt##GaX=>}r`68`}Nu?0bnhSjwdmJn5DUl17_(<|Gg_Jo>QbA#sgXb;7`nh{&(Bd5_B z2T>4M%6y~(YU;u1fd;S`c~p`O14b-aa+FBqvKDsD$fl56pv7)!B6Of^Z8RBm63$}E z37CxqVR0Za_CAay*egY#06NpWDr3c6u|BM0s}AtE!>q}gpEP_xEBHMU!xAi*KrXP* zj`z>L4($D~lND6Y!wXP)iI3x~QZBs^;F5DNU|(3uGAaX^4-nE2IoDsc48;JBa{wov z(Acv4mkiTM)XnCKIQVdBSx-ZqAubIiD{9L53NUVAt8R3ZIxx7XYr*&M=ZKv88WK*M z2n~Xy;RcZ1&el^doE!FOwv&Rn& zHPaig^uh64H(ZupQzIR^_V^GcmT817g!I$e!>SU-ONwcaEsZsgH;X%rJ+C#jA}=5q zV^|ClaT*Yle_IKG%rlHo)bW32W}3pCrE}DkHh?-v8l|u}0H8FcI9%;Cih^;V*ffA< zkz|Lh9ar8Rd(*O$!Q%2{+HSqU%zQsMUugOM@9>lIla4&t{6AukAN=`}cKr8ncwgPe z{z>GHh_5%}VdBa9!7Wmpq+4K5_8{`Z7_}Zvre(P*RjIFAD_b`;f{+79B6RGg6cR0C zBK8x}2WPI>Tb3bbV6hlAt1AH$F1caD$9oA0I)Db(BsgsWA|f}mTzka0c$h3#iI@H) zd$M(-Z+M<%W(Mi0li(d_$*zxs8{x^ew)G4i!;g+{+ym!;ib@f{2M}YKk>FNl)q^3m zx!M!QU4sBCS<`vW zc2u4USwgPn2Eh$J0{hFb0hV9*ttbiwN-V4VmfF!YR;NnMn>$7~aJ4HPa^%Ei%jsEb z%2t7)CZQ&a-=$V%xJn3%FR6gl2VDTrL{YRuE<_C6h`wbmOBx>Fn(o&>-f{jM6z0nV z%cbmMJFI2K9gp-L<5jc4`2K8}^Q|zR<`2sGCL+yX^b)HFbkyuF%n-KF8AC~KfI|Z@Q3iW8ejCIYR)#ub89CrKWjMw( z(I$)=|LV*jQe)Iy@UXFPF;R0(GYoSqvyAeu^=vxEJ>oqpy9lcJy0SFQJq9}Fz6-jj zu71yn$7WAw;{;fyO;{WZ6TW;9(0~*PdE(4Wg|H*Y`{J+xqv-{%v!aAOC_0wT4rMdI z<#HB^aDf5Ihe5fd`ZC_wD8sn+;dX-@W}=K&6F;+Vm>PBMuw39!O7tf?mKPu{kXYA) zdZcU3EmZ~8r3Uvg2ne>z)CJVq>K>JI_crK$xUT8QuNGGz_fIq%9qX~i`01g zt`c)tZ9bPx|2}7%`Rh-$X1v|V-BR3!^Ho{5n?I+P?8*JNqxe1@_75dBla`71FFo1m~SfNl8sNP+N6BcO>$E%I09W!8hJ)HU zgk+Wc^qR&cWG5np=L+SNu5zwy9GK*cX-JGS^{5A1onnI@aV}e`I~gQEn<|xype@Ta zah72b;uk?w(o@h60AGB?xK%Z%<+fDo@NrNW5waO zKfv0S8odqJCxxVZ@4;&A!BLuB8pgIuE2>MEH&=K8UfN+AUftCT8Plk)FxtCBw~feP zpo5_4BZx2@QAL@uX3Rj1QfuJKr*FWj6*v4Kf?@tCHELN@#<~K~i{cOxLimguI3J5J z?mKMZ!nLa=mIMq#saA_JW(!x1)>WZZ|EKAKo3~W}(9RV)#AveyV^Buzs}tK*uK;P) zt(`np^^)+wgeCxW0w;xW@LU^2RQ)F|FzfZ#=OTIX25$ViA$RcXX56pt^(7Y%V55QtVRQ$t2UI!+iF3!~J<^;wL#2g`jju4Dh+t|tJk|`~i z5<$UocHMxe`Ps2ZU|=Q9C@}3Wa>Q~0V&bSLi-ET7I#;%64gxU&_68~|1BuC(-2HmZ zq_Jm*sQLPh7bg0R+v~~fxpH{ywHY*(?}J9x{e3s~pEl~Vc_RD!J^Ca&Z6ElyW(y&E z>wly?COAlJePc20vcKuy!)XC_h_0t!J*g zy$^Ykyt6Al0-cxU1m_KRj`Nf|{r>kL8n?a{8C+MuotLhyGL?1;YhXW%O{+Fu9p0gen@#xk}d zqqmrIJ3fF&S`cN^IWUjGC8I!IV8KzHxm{Pef#sSVV)W72%Sg9cno^f!01%T=T3c%3 zO-bh}x|5mP9QR1>iF7>eIplsJwnMh;4fHCd5I~>W>iffrDl(vz>sC0h!Ij~VTcCI- zmI}{sS=3cg=NeFm#G>^H8jQVi6ndQ}a1qeJiECiyENW!%&Kd|K;Oc!ok|N8+VtkkQ z`_hg!&%=v~u2!Sl$3cA1cl94BsgG49RX0QIx0XA88bh7I>$^FpG4@mZ+1q1vA2sNf z{4X0d_3qL`+BLV^&bO59piM5CPEXTSn*CcePJb42`D1l+D}39DeP-V(Ly&4i>FDo-a?NsH-`3y#XXit;emiRJPjw4SHm;DB03daIuuZo{L8??d=8x%}a@xOg?+<8E1-JYWh|)^}V7 zpysUzS<7E?P|zP=8-ERA3qrlNcJ+nCGs$!4J?Aq=9WfTq6D)IXW*?2hITm&dJq37C z@FSpzL-6V=ilJ=g;gs|A#B2;^u0Op6@S_V&7y7hPwm>Z()K*K#tQjyPVZ|O{+i!KB z-Pk#eatXY6f@vgJ;3t3$_MW>*4vK>!CD^qoy8b+4&i%6D!ClWg0`+>X5ae*EM;iU~ zB8fRdc3)dD5Oyu6xBy7o0XHKnAU9~ahI^#`Neham%tn6;;%27jUKsZ9={!-E;`6c#Ozc zpIF_7{xzPE_~hUf@wd_hiCr_xqW+~FjQ^0Y&G+DA^R@K{d~J_M{|e(62JA>L$}Lqd zDp-g-$@Kd8S}rO!wPa|0o^OC(49_;l>O1Ri^#i)kM5!^D5p&@E6gWZ?p#aU;0o@3t zHKVx7Ybr>UA!$tui>Ai3kM)W|!*w2lGO)A(n}{KZT!Ezpw-GFGvIp*2Yhh~O5QrzK z47)-U-L(T_U$iutWdLCIe%3C+E;*j|&totq{hjPCzfT3Av1GwHjxZl z1XTutYO>95?8m788nsKK+q>)CTNB*V`y*VFFky&)kZX&3us=foxI>1n+pwI14O_Ra zP>u?PL9X93xl5O{YU=a52_P;koduHL4EWf|a=!{hl90Qd!f-^)9wF{k+*q__nTf&_ z=CGhyVHT;SX1gd`V6_kJD0p)&&^3C}vTj;*1|Ax5T!cF(%&R*7bT`lVuI{ln}}XalH zKFub`yw~atXOOl6hVB^Ch$(sRt1v`^Ec7omfQhH^2hLi3k1z&oa{vd+FS<$I+uDcnqn_@9%sKEnk_1>)B z5T!RPsP8Gg?iJfXXyiQo?#p1X_^qemO9anjlbYelJ{S_4!38tC`BqB>E?Gg0!)tLmx4a_;(F8mRhS__wA{&&}MMH4KVBb{dkq0x0P)VCgWM& z;yf)aHw^phS{ggL6Uq4#Lk*;!fZ{kc4zql060Iboyun~;ibJ1>k{|I};|rbRpPYzS@G4t0pe zA!(#F=E55O31D;sG1`Cy#!U}E`$c;q*LW|06BLn9O=rV!SWvLTFfxF}&-RhajF%9T zr1A_93ZMpXsqjTi;Ss!FJTTuF`5PW!se*jLb%@IpS;a+GT@NQo-WNWT1OTIr#YZIiNp@HgQd$=z0-g05lVzF@DBz0JGuCqB${5ks=B?ykE9VSA-fBk0tC~N4JCT|5rQaY5=uT zE8D4&DU?*7{Mk+?XT%+Hh(ZYRT>E@l8H>jG9z4Lt7 zfA>_{9c&J=9FoP=g)_JTy_pFB5v$LYpA#7Gm$}`DgVIRMk*KrI7721ExtKBg1qdtU za=q&S;W&^Y)m4hiDmr?>)Gys7Gyc(LrC1+*UE3fBUApoSnkDXS9R+ea2SeNmlMH`3+VRT$eh_#=C>i&GHe1H+*R((4LQ z1pHU>!h{jXlxI9I>F?-^d&qZ67ak!EBTCXvPr@ievVZm;^GYK)BR)__mmhT~`|m~( zDYVrh%5E_j+#0TFiIyY=Fes{%BI9M~8S1PITyQ|axS)d})7JVUqfySNU{vD4;AQ=?l89bn%G)m~A) zbG}R2j*Vnf)~y^B1L`zaYy-mZLK7^v8p8pqhckFkWueNGQr%JCCAstV<~F2zWwwhj zV&K5WoM!bexUr*-5jDZkMHaot*<}k=;2LOzsug%@Qkz6G1@!*DiV@oW(XiRZ797L% zZ0PWx<7QzqhJvFjLn&aJ*;x?1l{<{;N!fO0`)dEh7~Y;Xqr1Z3Vw+dfXWd3Go@alo zSH)KlPYx^t<9{&>*V-|v3A|E%|7wn`dbIM#CDBHS8@roZ8aMTd)Kw|-P;VS|Ijp)> z4eOlYo#xJsMH1IG*EZ**FT3jmk2w!+<|J&&y}B7AGUwzI&8X|g<{(goxxCV^09(y} zMLrP3h$@62n*!;~DE|P0@Tk6pc2YuF&V>+T3+Q%<5PSet5cGA>!OKBZTy~&Vfmi

    zL@6QVK< zcvxC4H+zs}`%L@|T{r2F2uPL4FtpQXNW2b>Y)Z88&Wo2LYK85MJJ^;?I-i~gfo2Z+ z76~&1A8$`I)WNq{y?bMw$Nd=_=U3}XTy8w{iwOl|AmM_m z(IG2_ywNsT@2j77v5f#FaK9Gc0|b;EYlRGE?ACL3l%UuPR=`r(mG32_0fN>y2vR18F-)2{o#tO7EHjl} zloH3ID=g<7aF7O$I%>0WkAPXryg-d z(yS?z%X86^yqcrn0M|=A3P(+-aTVQ{O(p&eMET!GZ?bS{s;ur|W15hF%kj}&WUDm@ zOZ{v)@m#rCj1VG4S2_9R58rF-Vui%#Zch!%(=S#8?6#*`a$(cJ6laGz0X`;XiyfV0k#h~ZXZ+oBHrY|tmU*6LZMl$*X1D{HTOQNAG{Ye27< z8-M0VsLeV&Tb;d<9^LE+ddyq)6jRO5e2rY(^dP)1RH=Eg&1tKHwp7ldDjs6L;HS;L zp=lwClN0AXGoa8WO7^6Ep@vtM-kq?*UfO^+p-C$Kuu{MFzHoHQfU3p|PgVL;>8Q1S z-GXs44DWTT#yX9Bh+N>|SLEkY{fQk>;HxR!nDqW5+8JsdqT3&&#qhqttOrlVaGcM9eG`_LnT{;fR zQYi%9#jEzbw3%f}Bpc6&>It_J0qop3wpeakUV!}pUTkCGWllwR4Y1*+GT}4&dS)!4 zEI1NP46pPBgGE@WOy|U!SXAaHN^KmKDmioY{^i_GzXIVu6)#S=%3wumGzQj86l+@& zZN*3sRQupBO$rQ_NZ}iYm;L)F`Mghdv>n(*_kVl0yX*}SuT>CPB5}($r*On znq1-_YAK-~+@{cP9AEprmCJsBqAxD_`g7v3+T2-8$hWWuzXHNxL%kDupuw&atPP@J zWM7oSJIT>$vRU8H*Xp{kl51Hk)({TaQ*aEd2^fSF!E%fq?{-5WOo~EpE{RS)i5xm< ztGBcu=0&E_a@C!)b|T9ksUE1|6o=7V9-`P|@oEEN+B$~pUQF@^^JipNSd?_3APOBg z8p<9-Q{^k_65BJF^^tG7{%-N!v(_)D7siQkw;aeZ)A>nOxiwr%$kGCTNLOwvuQ0l!+Je%jxInFEh{4@slu` zMy?lWPL$s2l4rWmxC}i20E;^y2C)!n!lF~kisdV?w(R*INgRU<{F#9fC)MJ_*pOIl zlklQmMYDVSus8Qp$ z2j@rXZzqd?Y4wrOd)qg#7mG9P{gB)0cHwYy0{uPu6LS%1wxY0KM1%PI zarqZLBF$j{Iw&Nv!Esf~_MaZ+sUxc6fS&-dPO^IEpZyN@Uepx)l^)N)28PJ4B#6{e zK}|1`I=|Bzwkche)~NxRuQ@tN(usWtv^tW+#^a4MTjXz1xAO=#%ZZJy{-B%!n$5pp zSp!nRY2!qX3ILXXi?t=cL>-5=c*>U@xAN~|P_D7huJiQ!fLD{QC3q7bDP|kp)2?pE z4>=o>{HP*Df6%Mp0TokC5W)m+6t2X#lH_PcA2D*4V_$<84t+xP?WziNS6K}Z>P-K& zxoVxf8QaEMMlD zPADPFj>0b-lbN+OogL#Y_yf?|2gaQ}*(^-3&sb4u`)e&x->slRCYV8xo$$Z#mb1!IH%S`y4Jds=>5nUqhH zgZb4v@O2}tlJ@buNr)UqrrSTy5TR2%>JH>-7VDJ7uHr(mNZgj77oatAXl6%~Dn1XH zo>On1%?i$1Eb&kTDv9>7%%rjZ5*B0|-o(f=MP{BBGJ44P>j*oeF2z5m4kPoZa1^+; ztvJhW;@6dWky0Pah5+aVqJGluIum`zxwyCXkttV6k5Ug^UiwwlmTD@OqLvrg+r+-X znoXoFx74dK-?T7JR{ob4K%lMeEwxn#`feaTnTYiqD(0f_nX98`7aNL=Ie2H_`6Vu; zE<`^^n*wb=>KJ48>{Cd&YqR`DnOgZwB=OuveMn&4nVdjzXo4feeAPkQR}a|AHCj%X zi>(TwGZ>90S7lEtLk7?dC3OxGf)$G;h2rg{O#vZK?p&>G_DNufIRd5eYaL81A==+T zm>6MrO-L4#>p47Lg$`ll(OK;<<IN9a3NS30}LSJm!ZZ{zvs=woR^~8P77{U z!yJkM(xbQuQzXMeGKel^5w!?E|L?HdT11!v(VwLheSIv2VNf80PORC;C`wOE96YHX zlO@#R9$ImL44!<=aK43Dr(vc&=W{HEKj$>-2bb1r(B9WO8_$U33gG)wL;8*dHo(6d zA~>!DPDoM3;Qp2wkTr&D^KNJG#bHLvEZ|yYC+%{x>UUE|>&Z)hL)>s3Jr&`peJqaW z!YCTpP=Id7`j?PuGi+Stg6H;yKU%^Pgh8hQAZ6{?iU6PLg9?3Me?1|u(`3Q3K~%lK z0p@WEgGk|kkhogXFOYarBn{CcRUl&Z9I-|t#3{eB-As+@IIJ9WjTY|O(8QzzwL>>Y zB5hTIAYemk;Pg2|s$izq)`2&n498ppdo##DaW;w(jm4AUbz)3l%@$?(4lSr;W~vX$ zTxaEK39vE-;Ae;EHwg_Sn2JF+LVJ%x+6%y8%Wn*kCWntWKg&b_eu~Gq^Noo&Wse93yB)@uq($_@4gqAwod_T1lB1)7et1DFA{)pV!M2|qoDYl2xBnys@7uF@)Qz0dj7(7a+ ziDNV2&-Pz70Da|rn@Y{*FSv{b) zHj(c*VbC##kmP0js&4MVsFV-%=q?Ey*O7!gNjsF%I4gM(lKGuCNScGrj=&7r%a;Q} z-MV*CYspzod?!}cVdv3Y1A+zdB&XJSWAiymGPF zQB4%MI+Q`A0e07=8@O;f2?*`Y;Qn%>Ed@5#gh#0TOZ;$ftA0FHj;>VD4E9rS)`-vj z9l)c~*}9c;Ymq@xQC}Uya$SuDK(gH$WtShkgbSEdmK=qt0RN zR;$fyFPtkb!Pm=I=rmh0?S`htsjjsm*3>~pj8HU+5dpe(R6v$6y3kZLNroA^QZw|} z+_9vKV3YuiY&;Kg!2*H}zify!87D3G0ICb+@2zn<@($FYBTdF!0O+-96txV~{Hd69 zIvb{1p+0Mb#Ms6-L*+oqFo+GcN69`4bnLnU zVGw92XwFp7kiQj7d6RbYkV=#mYN4f1qTxWEMw2$0J-bwY5nvdepYbnQ)9J5^5KxL1 z&bF?8oo9$5qd5_$#C#hNL)KCi`Oxu!`9Rac5!2I(r7Mk5u^~slM|FU*B0+vq4uHac zP83wy;%#g=&DgbpV^9BGah~3EP%GVxX?hE;i6)+wqYU-UTZ1Jq#T2Gn+`CpieeyWp%g32e87T*5TE&2XdR+L z!=8{ppIv0wZnSDDNP-eWaUd~ENOuw7wG1?2gp^W(LBM=glp9GLzoIy%z_^lPY#MtzYU*9Se{FIW#yk0mpL zp3l#_gO0TX@~=R}&OjeV6ng(^V(&K1>aC%W3_Z5u`{ObxhJe`C8f1IiwK~Y`^qzK| ztxk=~t)z?|PlvN(J9NF}YrYV>pSQ-|KNo!H4R1~qdNeC;syyj@4R04iTjvi~Q~S0` z3hPZd=r?@Yd|EyZYJlh6*6Z`ey)>j0c(GO5IZY2 z-wR9kI@LcWs8ZlMx4r4-a4NRBS6*0WJi2szZ`ppn3H zEWI;>M;dc(Dd44EU9A;jgxXP87W3pUA&cOkNfpAnn{PZ|d^0cAg>9K_r(`2acZF?eSCb0k1xm$5_B#g9O3-1-ys&R;b9hML~ zTPs{cK*3RmTXJs$)t+=Y#+viHatV%%_eJLx&SvsZj&iEFspfI2_Kk=CqOH>L%Ux=~CK~HFdSF>(v|}PVzvUV?q@7job(II@hLp zH&pYSq%u9?D7nz@a~EXVx*>7n5it=oQ6~e&fZS^{1ofs3sCoxz?ZpcZz5BQ;@b~+ldiQ4GoikR(~ zhf8&yKtmq!VdnH9c}L*fGJX6kGx%wdBV2sBuF#8e3W}Tyr6JF;rF3xIrV2GfU$f67Arib$dY_py@sS zRH+6O=C(OkSddL5YQTMF*iEj}hQBDWrZy+DCgxNd&Cz^ZyUq=y%QeQE9__=i;Q6r~ zS=_W5b|2y7-t@KXl&j0ftFu$>lRgc6ylWNj1wTveHT;+e{(`bY{_WmM?XcQh{!cRNd|$QQcr-mr~~&kcGGO^ z=_(ZWy3~+k>v|-K$ft;Z7xtO=dMtc-!1gfk?(lt>>fm@%j1zI#uX58R5}{L~hf~bU z-_%0i-YTEX>b^(Dto&~GRR7sOB8otoQIjlXAx0()){1v>F>-#>(ePuLdbtO8RCr>a zp4Yp*e~FKQu6}Vb7^fF*s=%&qO{uFCZ{#kwvlFPGv*FoRfj54IhqYNjFFxOPn^yCa z(bU1qZe`P3sAZI=aW2nIbU+K#0z`F{?Mcsco%anaSkUE^j0Ko zZ62KvE}uuJnSv*Bv-3rOVCB%|OQYsXoGWLD`NK#nbB_DxmptlIHrYnIk*ji`D;f}TCAGTUIGG2ccoK37>j8|c-BFJ!6aZoqvZDq!=v6ar@to*5u zFv=dr;NWm5#-}Ld%?@I>qwN6bIAUI5%{d66kO6R`@5=3D2&+F?VDIj=mU+|1S=t-@ z3}MW5*T+voji0X%%~Ggs%PQh^4!rv2iiR`zV&|%BnzNu2V56l3o~wimTF))pzq)v1 z4IzM&!iG_nJ*+I|?paBlGK+}h_5sab0-{!_($qtUX2d#yz6&)SQK3ZHI$qI-ddeQCJMF69wvUTYqv2N3Iv*!~%g0@>%m(hJ7>kxgimuPiu0n5H7 zv&G}E6GW%0b?sqv$uhJv07dNH;>7~(Tl(mzxJn=`TrAr9RVV);Ubwaz{Piq>FCCEc zd)E;hV3;G#?1303-DE+~^sN$jkLst1!ncu5D)xLlmX%M(+N89k{a3)U%~G1F6&!Ba z)(yY`S|*xto<>uJRA^}64GotN*loD$_7{22Na6sDU*7nh+PLnN0l_qLwWF8Q@5R~o zl8%iqk%ZqB7vJ{&3Uw0)tw&2Br@7c&?D7N8ia>83`q9bWgzh9%KaBA|8BR9RN=rT( znlF~+Cod36V!gWiI>cs34)OFzH3EMop@GvGs`-nE!XH8mJJTINIcqo9n`xp~#FT>h zqBFLWU-wQ{@9vEFP1rB}ei_RuQBbi`jzIDQP6p9pPq7TztaS1g=`P?6%azssS#v## z;~KcEbI{{JET>3Uil@jYk*~3M)xVoM074>MoTLP&iAn@U!xW`Z{3Q?+V3FsluL<4d zKVTG!?&Jgxm@6QtgF-6-kqF2bQFSV(Kz9S? zt@+PaxL#CURkinT3m07L&eHpMzV97sk`_dn6^l4^M4*wjCB^S$(5H*GOqij6FY=;2 ziu609r@Gwt&8T!ttGMiuG83O8-F_zXJo$m^IGxp(sF)i&q||04jiNRPQe(6SRjM zBsy!C*z@>Dv7f?Jrw9cLQ?$@X$71`OOM*12Fl*o+^kMnEzrvBRBTr*=2Qjd~A2-i^ z!>?6c0dcaw2>4`KQ{p)hGAFU&NU;5V3k3APR7KuCYsjCE+qY+?uU#<`YL!O(Y()%v z1!VSBeHOwbp^y7F-TFz#>g^y~prj~Qq0$s?+*$+*_az|ZvtkJ&9B_rnKX%}b)om>h z>*KYf1Y6(!5m(E{i>y~gN=J5z@VM+__*hG)r4QE-wBUeq%xE2OLxNHdKa~+O3L}(W zPQAbO$*7lvrFb_I@|cMW&98>@Q< zz=JJ4jh}!27-ob(gm-*H&NWDyJC4f>gA@ zkJ9}rPPB-=k1I+ll_Ho>#JujVfpq*rNC3{%m)jT1{QF)Ahz}(ef)I^^ zk_+?*s#GJ4K7P!P-YamjZ*JS2Y&t$j0N!Mz5US<5192s&3}(K08q!ES{m#f<Ulek7kG zm@(dKP^w3SNI%lg=E9ai3RiCQv0rUveTU!x@i+JOB~|`G)+U+r$%uQ=umy_%f{P`( zLc61M`O04)>D(E0tLB4UOp1VhGQPE)UY`+>+^GesCZ(Acy~@&RXUt#i{QQli_T8n z{Xj|@u29R%ercy)?E?3|tbUxpm$rtt$)+bx4SME8K)pmEiIXBu1A}MJZWn+)RT2dy z3?py?xy`IEYp3oHQ!;FRBt)%#OKZ+-+u2=Y$)nGp1W@iIK9B8K^i#u|JZ_On!ivM@ z?XK&yKN4&41zp|FsY^Jm>rVS{QY*aFo|Fvaha0&wBRTwYHttf>P{RArl+MTlmluW1 zZO?vaFu}1EeQqJ{paos3!PS-&Rn5h5lu(F|-Q^XFp#|o>3L;E&6hnF7(7vhdOIqNu zp#7@AQ{^cb@y2OELougosH*Crwd;BJ;Pi1)9>P6z(9iqBx_@0Futq;stHL}}jwTM# zsc)h6C#4vE?R!SRM3%si9#@!}Rgc2{vt3qOae{6C@Wbf!?BiaT+sY!ers9CBqo&^Ej0enNck}z&qj3qGGY6(5yubmP#W;>&r z>bfvq<2|$UJE!xdwyKlKi-ALj4eXZ~B-w)0a=PtWCSvvJ8H(+!KRp~JAM%p*e#>Xw z<+qT)+*M^Nm+P%D2dlmm?EELbOTIhLtYYRY_Qpa1QR9A-;UQA-dUtb#eTQC+haCWn zZy=kyc%1)gAI$%8iD6{oVELbZtDDp{Z8uoaeV%J(d7bNTYCFXWlbkSCZPpDe309>) zQV#r?@_7PS=9MsFOL}}}c14Jz(_3jYFhfcQ3I+xoKS%S%yaf|;t4n=-erPb4vFaHI z!VIJdfDV#^La_ys{fOE|F`J2l{WBL+ohoo?Rc}wWi^oLIw%?hTa!t{m6&}yjQ{)ov zh7vQ2E;j#ky}LhO0r-brG-Q-x?hqNP#x^(;g190S6QBccb5@W@FIowD!oRq0yz{B= zr5uKnP@(I25MALSW-wuh>cvOj&9THW58<###?mFgcC~!e53}UbD@~;`Q5{Gv)5z0D z6IfPRrIRz^$f7SONhuQ-a@eIWyO$YhgbFCAKZjk!4D5Ea|{kzc2 zGEs9FM$B^%7}!jL{(MQvo9ePM=?ajP)|&{=ZZI^2wIU`RHK2H1!3^waW zDMlMB3h+B5`8DR^`*_PFEs^%lktfW5fk$)9JH~he&e<))tMxfE^wCcuprnD;d;0vg z9roRahO+^=Wytg$c+f;5Q55q;?|$@=2Q*T99HXvAPU_BjTN@_CNRKbcuKyajg=B9_ z%^J8R2W!hM+|}oXd=F7NaEF7!Y{)yk-KoJ;rc!fDxG5Aok~!)_VBR3e5&dQ6#RHgQ z?6x7=V-%}M9f%ZKgbJ(RBkT+)-A2>7Kpa`Ig`)c+561XDA2{z1p@Bg?T zHQraZ)85NZ`;0h>Bom9uB4xceSuV`<84FL^Z8yzo@S}dK|5i(oM4Dg|By-w+snLU9 zkb31XKeTRhZD$IO&Z}--^5Z&mTBn?}VtGqEtjI1yj0qY$`fH}sRd!~<-nRv`{zej7 z7S~PRxSsd-#Q_(o~-#MJ=UY!mF|XN=J`o_@|~&s{MOFzIQp2++w1vNn!B&-jety1 z5x5DS=obblZLq|=vc8RB^SU$2zYb<#3#Kc!W^bUnu6qTqP1=3;>Wwv`vDbda3m$pe&HT^iwi$-0oj#&8^;xuwecQ1GPC3_l5za%t<&T^T8z}}H$t_&f$H-ZFk)oju)9e?41D!Hef zn_m<+)T{i>vI3M^jle_2|F}yCq?)308%AMS?$#h2U3dSQoK7|pM94;3PwLtFRoV*s zAA=-&gnhYk0q-!=7%>*`d0X*{vi9vx5|mi4e}D%AktXdg0~F~6cD_O2R)@z@!q!o) zI_zWpVQe2H0lP>{uTEFDEv#Xvwa223QouNoSRe9j4u@c>T4*FBZnI0Gsv!;IXj3J0 z>m(Sc`A)PVZJByVdU1j}dr`Y)`OqXg1R^~iYDy$@WXHqtloNe z5XrL;OA@S2L+o&|_?65apRnS3=N2D_vPtZhM|YrH!b36GBZY7Xru$2%?vWZW%)pMB z1&JoS_{)d8{VAL&;dtTuiwn{*c7!wL4ObVpx^#L&n1Z5}I8W%TU}DlA#I8(*vk`Hh z=#BHr`EIl18UHz8sy|Sva@|ykHnys}?i5Ad3@QRhFeG&fEhN=ECD!yRWwWT%P7lzR zfU#ZW!YiiTD6W8T3^G9wq+b~WwAF_}2vm9eikcf9C0<8?%bOVpQbP^&+!i0h9yffT zX)mv3XyXcbV3c#LA+m3vK%Gt8gMhD^!}Gd^$_S@$wR(mXk-T|bpE8eYpMlsN5yjAn zXz2wbLHu}?no$qS8n9&CdJzkrYGcm!2kv3@(tK}?zH?D#z|#2eI(ocZzIpW|5P+FK zjr{0VEje<+GDLg-VN22`j0_iZBRH#T@U7MvHuI*rF-+W=GvjgEfd$_KeU33u0H`iC zSfA}?afWv}Et2F^ayGH}SvYWOxmQZ;a*_Wo8O7NRmtGbBSxPTL^L?I+UHZq?lpC~# z3ZvO-mBzf*ELY*yUKIt;0l*|y-qnqcl+_kmWJW(FBy@$9JOmin*oN=5DD8bn_DLVK z1c4ANUO@hmD4`kxM@-f|N8uPdQNrGcWz*@I8aoYj@w!Vd0ht`-*{LHnzoxJe8V^j` zFks3|uz2iqTZe4W4wZnBBcDlG>i<$ZL;?EZXURIfN_;(k&#g{~g{oJrZ4+r$yIV{Q z3Pu&9mt75xB5vkIbGe*D7F1kUm5sTXZ4~`JvJZ!?wtFVsK(t6jzO?F; zx(_N#qR3qQvr&(3(04a*x%3UZxc74(Ft#yrbaF7(|G$%)Z4E477#NxV%Pq^s^1qX7 z{=aAaDmC5zXV(8=$F?s~i^~@-x`3)U(KMrN&YH-I%TX}y+r^X0CIH+9p4MDN73vG= z#Z#|_3P<-p_iwLUiz6QcXt%iY8*UG83rcEGyY-Tw#21Echlo-lgQ)t2o7r_}WQc~t zNn&SWeDM%yWKyCOus`Q3oeETAQyKQ>03O!s(`Z*zH6M31(%v?lY`!%s(Kecjs-p-8 z5h4<3iVP7&k)+2YhcYL<8uVB!p^i`Q`8FFQ&#;fxRAVU-B#iud``GeDM*O7 zDUPW49pMQ|5A|D+M*iVaGzR_ddto}@lVH*NZgn{F>C5Wv^OA+3U1}&fB>z~*sqdAt zZCHyP2vbCkJ=u=f3*{}#oy#^A{|M&B!}T)ovIZ!9 z!yLhO2@FZX{kRyhadj<@bCb;@|GKWbL(kv2thC{xMiBhPl6SCMRpu`YD4`#WX|tPb zm!!)J!pLH?u@|!f7EqU(f9P&Rhg?`+{36LNY#M;grRa)6y>Vsr#=>w{7c_}5M9)6I zYFH+O7MG}h=>eZr-f1=@GJI;11Hg_P<*`FW9nvwo#H8`{(RiGs(Y$u^?TLIz!rqWb3m`Exx~*)Z~=jcwfFCP zrM)Ck=ig^jb`+I?j57kUVojK=``~!}>a9%>V=eS8rPVf^cE#12tiq_SHG=ZnP76&B zI0~k6HS`wRuS`u6^;H)_zLy}-2QvA91qIbjdNkei8tHK@6rG`=>57i=Xm@>{WsrS7 z<83GJxI`Z&mhItlcSYx(U(Ds>5hhcdTnc~SeK#5OXpEwD-;@3e-nk}4#0!tb3yG-352D(PYl1XgKuxT)?b)lf z{^K)bisSWmWQM4-Pzg4PCc=NRCIw2N(oSldFd?8ow1=prGT`-`yy^z6%}A7jZ$hH- z1PR`qM@yC2@_+qf z+LrP!16j$>_ip~<6!`3475m4;&UrrVopy!k5=y+3kB!8_<)$EhQEAUpQ&Y7>PY2-b zzKN~}6r(eyo0``fo@em0782pj_xK8&gO30&{uF9|)QVrfb&eP(4gInD0S$eBmDChg zD*8ByD?(aF8Iz}VF(aDN@mrrJDg7CZy7S|53X*N%*G=X-Kr~c396i--CAtdNpYf&s zk1ul632Hq!@~LWISX~;l9Y&hl%?u<$`q1yB@UeLOSo}{|Vmc?h|LT@3|8H4~l(CJe zlNkX6JN^II3t08PMW#PS=@T?$Nd**2Qfq&-Q^&x6X3x#gFjbRH!D9J@W9OJ6?*OiW zJe`;e>WCaMgwTUYHreo+W~%PDQ>^Fx=a!l7FNS5RsRRm@3P5P`5p~pnGBpdTe0%$5 z<<+vtrnlmHfqD1gHV-0N>bYx8j&JMduWG0uJwftgum1b4SCs9@0UyNup9yEP>%G>k zux^A8UwUip=xPdb@00lkf-;hbh41Ehp60!B?9W1aaS_#*gA{DZOinwSb~8naHES_L zW=AH!+p?EH;X{O2@@Cqd`TWKUdHW`*J)V^i^|kw?Wd^zr8r?Rqve$0eu#rxNq%BZ3 zW;e74*CIZSVP)F98-8T6>TAUq7wTP@=|417h3Q;7n61aKr)#&l&$AY7e+h(nHwT0f zxhcAVdwYafuW;d7;v5(LY~m!D;CDB&4H0`@2$I=_pl^0$pRtP5+sqPPA5<-Y{U8^| zsBgEgN+wMJn!C!L^HtUP-iNn0q=IClL>fBh;3CRsSdrEMMY><%KBlefkvo!o9qnba zSqD)`GGZjuP<^O_&|;+(&D7Or8P3axNeh)m25ti?ZWkYN9>Y81M5M=g(L8Edp+veE z5Dqy4e;YxYSbCK3j3agX=DbM4E&XMB#M`Z`QkiBe?YvY7&pvEFeH2UJ4HTGO;@_^O zOZ|@XCMKN{A$b?zcA5lfc&L8{K@!U-*bdg`YaDepmqMz>xn?bv_3goSrDipd)%DT7 zL!HNrAfO^N0?u|cd52no+g^ZJFYlMp zDAFItvjT{Rg?q<}4t~4o6+VpOF>F7o8Ju~CPZua^txucgXmbF_$G&59Yvh!0gt%1* z^lDY|K`Z`=v5iajhY^hi|5rdAr$R>m-~)wS9BT%bqSSi6+TDdQ92=503C3D-vFi$t{xMGOkdPet^;OE|EY39y}%_^i;iEe$Z~zN(^J zBqjP=x!s(5t~9@*2pF^*BOGR4MSTT+6c#k*7DQ&&0>f5kn-QE@+TPzF-Eyrw9@lMQ z=twc@e?mH;&4&JH^<4dhr+5@U0TyInD-X6#k}Kw^q|^JApTd3z-95U0I~2W+0xeK* zB4jgbrP=b;zl-U98*ptlv?qV(px(p~j*;E7j@RX;_|mD3I+jn*DJf$V4i4Q5+xUi~ zqX*K+9zxL<`KdCRXc<6;qcA?Yc*$rQ5EmdR5;$NLwt;Pxlr7r+C}c=w@SuZ%aO6)J z42sPbqn!`g-OvkJ&3kjI3@HZoDVQ+Hv#HJ&!B8x%m@X|~1DCX%5_ev;&DVc#Q;-U6 z_WMDP&s7J0{{+m<9Kf`9D02A_+*Co{kV#Rj=c4o6xyC55^Im-7*oGSQ?5g*x^a8k| z1mJb^K@vT&K?S@i=X8YN+j|^meG7qwU<1R_Q`&GOtmJt@kTexA0d^Z`?5Yo&cO$4RA2+pc~ec()zGa55?g?^hW z-QGbHBOU`si+@;_LO3${ggU_;XC}}9`XjtR2Sk_aW}n<2KXymRt~CdpAuW|+@ZV*I z&=xMXkmO51!(oAWxc7pQsH&J<1;9OL0|Klwj6E_r2h_LAKLAzY14EC2scW5j2UZv6 z#rqS?ZwRaR*!osYr1VL0sP1TY#}ZGbEIuxRmjE|5(mP9914gUe*2H&o7A%swAZEv9 zMVG!wVjIbl{>U9Y!-YB?55~T5cyDVyh3?FQdX&E8i9Z?~i#~d#hdT@R^d0EC4g^g% zQGeMNsLy2C?Mrka>qysFP!z5cq^scDKWUgL1>Yw36IMRJx8T1zD=YK=iL+#2{DEBl z54AYi7!wZrtQR>yG)q98(wVXNW^<_Zy0yzZj>7YSk&9V)GY3_qjzsgngh8335&>+Eh9XqyY!azYg6VAa)5*=hHbz5_ z2iX`$;ebYsC8{7|*9s-l_bDBfUjncK73hdjBKc-NDM0EA8f84dmXypZLmKECcUP?` zowPyU(~)-J1+po1WO^&E!T-)d=b!9uak z8h_5K>j~*sgakMhVcrD=7W-S{@@;;j1{m%=QW@!<75bo)D^7MJJv5*_9LM=%ot8-E z*3W(}V5Yy@bAu=JA}UA{oj-X(<;?Pd@u8ePz8h*p%`-^4KEr6!T|cq7C)#xI6!1-6 zD)a2u*~(RX9^)S5%-^4j68Uh>dl28gSW4ZeSau^<%}!CxErQVf7H7q! zz;OmOr`0yCjI|(E{r!b<9!w59clUbf>pXmP--^#_B`Kv;=%xov1wCjQX?e5Bq8F%2 z1pJk{JlSJjmb`TX16~i!9>w@K8|S2&)_EIyla7J~xQvYM59?oPiowJEF%Y`Z4{F41 zq)vbP$0B>zZ<7su9mGowDD8^sa+2|c$1A4gJajf$F^h2>5D+4-B_GBn*ZZmT04C;F z9pDoCi;Xt4umz*Rj(ZIhPT>1}%8A-EH*c2kH2lL9@IRWY)FRUx1B=eK8g;iq*{E2jA2_c19nDo~NuLjLCD_-D#kf45=&u;Rf5T=mZm$*=b|? zH?BZywik%!kV#O)yFOX3ec>#9?4sQqm%PxvFgMfF&TIUQ8KQMG2WUW*N~9q@(p;pP z^JH7O3$mL!{l0$4IwVMLF1^v*i;4`u(~I>=RNk6h2d~w* zQt(OF-UYjx&h?JWJ%q=I+I#wHNZ`n(B~48X4g6LJQ>Gwp%@vG25g*DoSkOKCZi5ln_F<_TI^r%7?XhZ>Z0z+0q3Y|@G4cV2#pRa-Q4R`I-%qm1?}&9}i;PLpW5bT``- z!}*N1B_J`5O9&zb5n?=;A2u50&_}9#+OaAE{tLyaU7A1n`%tybGj08VG>%({oHJ+4 zkGvp>q*e&GrG>bbQeVpnvU8$8kO$c~^L%*UqQ_Weysy2muSz8ywlLw;rwIFyRavL< z@4+558TF-p1^Ge3Ca`ui31)#Nc<2tPrT|S9_qu5!UGlykrH-1 z^ARrI!G5XI4yphO($<=g$LSx)1v zAe90J?>H?U{xj>JO$COW0 zexRbRHNLbBMHx&2R_A>VuR^8L8INj7zZP`w#m!!5uN|;bo7pAyd-vNb7J365Opyog zEp#e^G=K-_d@`}k;9J_-0~fob!;zaf!V#+lYCw3)EX79${2j>sC{%>v+OmzS_R{-! zd?}xgC8v!_+6aD4d!X|n;uFIh#}8DM_0hneg5$f&Lg_HoA@PO8K(94hjR! zxhA|RY|s4C`u(~xuYz5$SPgPmYZKMfC?MjRwduGEC?q=P8m`rsqKWNPCv&OnzQgY3 zS8sbx>Uamv7nB){1>4Evz}@G>n0U1y<-f`rS!+ct4Pd}Tv`wVsCguk@4G7}EDG5|s zl=u@xI)@}w(XARQptdQ5|BfP_;iJRv$@_wYD#aO^rq!FVH?%?XZ@pS8QgU}L!rU+< zJKsJF%sVL_u(&kB6i>nh{V!`JooG0^Hp!m4-Q8Y#x|WKMHyB6=WFZ%4?vB_IGC@9` zHc_`f1M0Po#&_qcVK8kDX<_IdZHq(I+~B-9Nz30OK_D@Q3OFUF;$p+I&IBsn)EttV z(auO_D^X8%k!wMf(xGzz6bz9nUIkiMYxr<3*4KEqV)^kTv8_l4HXRGp%}H{VAhQlUV|LPJ*6elkfp2Kh60%Psxw_r!jyc&LbWm{b+<1tL zg+QtbGd~{IQ0RqgXLW^?H@p-4i_jwa$xO>qr-Buqa@D zE+4bK%%54dUB4pUe*I`A5X%rAsb+ct3EItz)oIgaHS* zGOt=*LW#xnuGt7Ncgb;3JQQ0Sl=>usxmc(X8Vl)TM*v-^!#gR}^Nr^GTtekg#l?RP zf{o9P$f0lTYK9ZZswfTsZeH}=VK<5^s9A7JZRN0#uimLbeBVa!C|8^=f=KF#ie*mW z_3=rU=9Ny1c1P#uB&QrxLr2RTdxVEauZ5RDjW6ok!dnMRvr!K@EQjNj@_FvL6r(mk zs_G8a<0Z?QRYFi0G*w9H?Sivp3KuAjOQhh5N-!lM$?_^2kET&&a11O8JAGj5EQfP$ z06)g@NkJ@O=J?!*J?q`zA7Dd3l8jg)!?PGr6DC^L1>#dck3E4K&|F@T(p0CBd^9h) zzDJSJdfmCPx*O5v35u?#Z8yM26m{rmEU?_r?$Im2_x;3J{O0zLCLn^N`-c@y?EX*@ zNXOMYWcldS$C06cD*mrR456Xi)i5RN?`n^P6C=leHM^f&s{aFw&%nX)Kem=NscF`1 zFeCX~*Q{a;;+37R%UqD4#qkF?B+GHom5L~{-sU*VvZ_0na}c~-PP%1PvSnJsqLj;A zMvd&>PO@Rp>26lNoUIXGjnLWR^So*dRV0xTg{!o5C>N?qkVy@$oi%H9scm0byEcTo zb@DP7m6>rm4Wqty<%utCtob-j0zULS7S{Qs#9?(anr%YL>mStDt8Fh`POKIA$mRiE z=2KHOE!+No#Q#Oes1H6`5Q9fHk~lXfGVdWO$D)!E13x=t)u59MQ!AW~?l6;);YP$` z4;m4#NRI78&J=-GM;X^nFm>r5p)!;mkOW7bm=wroXdsahktHy*Giu23f*z9lGjW~3 za(!TYE-8NsX`UvV1W4|p&0xl&Hd>-ZvmIt(q9W4|Q!6K04kpY?-8nTullmX!ZQfib zf{U;*?o!7baLCypr`e;`Tu*_@EVkQ*(JvO6cktFoYHrV=Y)sJ*F4|w1GhHxT_R%e6 z(@dGa&hshslP(x59Kd92US0Tc zaqU-^l^Emo* z(P#6+x3+?uk!n$(TO?8A6sc411+Rvij)WnCIKJ@(zRv#(Xb7rcitO%QD;)oh^(nPw z4bbiA5mSd?z+CrG@VwH_hQOlKk^9RK+LBoL{{Bn_v@E?ixpo%;BL2^>8*g5Mkuotj zF69q46*7HQ$1Z6q@*q={oZSvJog@Ij<^vgIv#D7dIoZ-&{|S28tj&hm^H_EHJTZ!h7WJ#A<5IV4p@Fq#GG=cC|rdqnr_TR6TqjomphE#^FE;%j^Q<7HSeZd>w& zjEV0X$K9gsFpj_LGAkBm$IOc>il;E^FXoJ=B}WpOcisz7+RHMn`_dk6A%1@u=FkQq z|D{$uP07LDf4jX02iZ_6}@=S#bCNCwW@L%#T85vK28JAo>PXv-cqo=aAjOaGUKViBy$(n}5 z?MJ=~n>X-!1v7)KM(ueM7J-#%OP`m6o9*u3k7a`^v7cf{59T8?Sw{FC2B=1CLq0k=Avh?D6Fw{0n;XeTQ>s23|#z46{I8MPRPws9&Tx?{I1v)qW(*yt~#s zo);@euHQQ+QVd1IlvT0BNvv2&tTD1I6z$#F@5pBzRlVV~e-1PZSO>>qX@Bda{OuGQ z4pP$RN-IJwH%^h05ZPNL?q_a=_t~?KYr=mPg1sGP6*?}Oiw+y{ATsWa@L6KVFfe^b zN80mFh%)UDT32+1^U}vk3?KGE=BpcTdeS@p7-W1MhqW-nsex9663tkQzQp@rAaMob zLe3r*XLO--v~KBklZmGOdP04JiDxKVQ`@;_>E3_v}B*#^Kzw%l+j15pTN23M;G4w3+qx>c5Z0yLU>AiG(eKy^zZ)11U>S>=qgrrln#2R;M^(pD)?~(0u zEdGr0y@EHrMtG$%g=4lImtDS;z-EY%NvSJ-SIwV8Ay6OY?)u}-IMMU#%Ic2yM+SPF z;y|+rvhk(i#ViD6@48=H-uZB%6-sEk1hZtz7 zG%b?)Ek8KnX{yKJi#oH-ytsO!vPyP00!&ux=-GaN;&ko_MljLH*V(srPjdv9L;kW4 zc7IAJIm7DZ{CH zE1z{A<|pcRsq4P1GFdrzD!jM24ugWBTsc_haOUcCbSRVPg5AN6aW2(h_ihpckF!_~FD`tgt~dhfc2zhe z!pq~~<&&yh?QWKRGV=Je(kDvZV#%Ey8Q7~jNB{ED?ag)(>^+}SkJIOQ;d2$Si;-1W zhm<19murFCV5gxJYJHAlVqaS=p3<{Xko#RDd?(`!A2|ST*)v#LE8+7# zyS@Y^zI#q&9x=qdBJF_75Byvt;QRJBvNNo_h(gd~+1X`Xy@_aU#6449_N9cWCE#R> zH*MGnH~U(Y1@$;I@zevrs!HV_kz&%VAUhK<%wfcdVz{_^_&1znBVPwuNUU+8$zQGd zL^+|X5qnYe1(VnI?xs=_Dd-d*ybG>kWpbArT zr*2PwkR%#-?Ij@S?aut&>OV#BxSfIWT7dfph1qxHkr~7;9 zrj7n-oP!gdS2!3}=wKgn5n%!jq`@w`4*|a{A}u50jJ^eQ-A_33D_F!ftK4-F$5U&x zd0c0uPZ}$CdU>wRM5;0VF?9@iwF2ArLt!C((A5Yy0u(p5+I}MyVOM+kbec6*s5Vy` z%WB|0+_Nh?W7y)u;ZI&$1S5P7Ws30Wya?dp_SX(z1duVq6R<<_%FO3`mr7PwIGV$`Esg`UCY( z`~36>TL_PGf!F{-K5tyw{guU|0?4XTOzZu~v?Oey!5QVNrCoq{I!)gPz!aRyM9>(v z5@}Ybh|`z6%Z4SYg?e#y1!N0KXek`3Tv_#fN{;NSSF|mVzC;2} z6)NlLYB6a5Xt2u~sth0Nh<%HuNG*wnN;@_>yRsBGpSqD{qpIk##y)eu>$qi*dF73y zP>=SJWHSu~qQk|MGxw++qu4)TuF0QVbOpV=Hu)0rYdCFlUCKHWW<)3B6(Lp;Tv|7| zMB;h%!0l%#&cVxPS7QzgKe8O(_mW<0$GJ?N74-;hiny+>t;GJy6ZG4;FYPM3d8!mH zsnW>~#F@OiI5^RFrT+%|MGE%**XyL{<%BdGX-++b#}f#}^ukU{%xE@cUfF5>9h1+S zIZP`GoNg(|R=olL=soz%3?R}MC_*ld?Y{~p$A9rNng8ef<0>`HAB7;=&pb6-&@qHl zgR*1;%K7g%{lC6i>{X!zNDUJ!!ukVor**wmpLYaz3U!C1Lfog>lejN8HyiHMd85qP zgH+Xri}!`IC09PG9C{J6KT7rO(!v=O)#87R>(@zCVaZ0%GnZ-x;twpw)MPL!9BfnZ ztu@!L9u?@jUuLbWmfWdplb~z$(r<9g>(MfxvI&KJXYunq<{n4Pn^!SS?OM#9(4VCM z86K8wt-8xE&Mv-Y8j6I)=4{QR{FYs6m*b;VtLcFaGEDpvu8{yvVu!CsB+$563oBwXSMFi+`im}* zZx=u3U8x;c@T_<2S zI1yaF`xsOZa{d`s7gIlB{@;H{y><=IHrgbQWZ2Oaw z`WZ|c4A21|-c^IJNKZxFeZ)9Oe92+AziQ<@H|{5U z-!8R2TYaw>>}lB?YExY7TWDP3J{tD@1F@8}sd&-k^TblAs4Kvx(wMyX{ob zZ+QQ+aK$qgsaWwqw z@M!Q>TR;X6ZNLMv%Fk>VBsoz zaT47ZjLQV!xxi?@p^18~y2Ue(mH`0&Bo?a6i>pzESj*D;e#h6hwY^hd)FEVh+c6Xo zg4%%aPdi2-$EHE~z_b+U*bIZ^`6O(=%b|;Hx5D~KyeT+*%p=tG6!sXS&uiwy&K7wL zuhtS9)CVNrYP$Ph0rQQIr$Ph0!GE%ocN?a9$$uriP<`U%AcPs$Lts-bjtq=|=wz5d z5-H=Qrqg!i>w?H3NS9Z};nu^|s6t23G#1t1R_MVtp4D4(RY;oSG2&fWDU&!~8t9T# zFHHV|P%OLicD6^J{x18?=E3*5`4j#?C%G*p_%>zm7GvV}y|%V~Jj)&v#5(8eS{Iu; zb3Ie|oR;o$uGl^*V~%6SC;eK}H;6^neoB{#GT#bRWfA(j#Y9&{f9I~E%bni3idJv+ZRS!fV=9F?I?f{?zh-zr_;xTzoZfZi}me?Rc9Be*PH zZG@OUdJpp)V{7NjukTRQHOPI6=Ga5)$E#c>*wzMg#gIr;N6EF4a$W$dvV*1V#`IcK zhQ9}aNqxoh*AR8D%&^NQ#+klF*JT7WYHKo+l^L zN>mp@Z?y+8`o2`*3;eAw*Zm(og6Tg4L>PX^%m35s{SPDm$1&dhgL4vNBZKkVp_1WB zoF>UuLd93uw8GUxNnj^~Mi5)G=eo4L4uDlikk+)J9d@W&#pwPdP_*5bzkX&qTi#AF z<@1dR`dN;U=Cx>fB9o>g=?tRw3m?(IUa#w(-TRT})nqiWw)MyQoc|bxjcMK$*q$_B zJfc0qC07tV=ehTuM{L=c^Wnbel^XvZm!H#KsIs>I@=-lq78z}7&(k_6vUs~+x z;1J_D2$*FL2neyVRi?{c($^QjGzprYgvBJMMm5ut6r(Bxk=e~SFFuc^{;m9PFYlsd zTKGC6Ur4>(xvD~f&uI`MtDUo2CSLo9+(b7t2pMG{;1^hUH@ECn1 zPyc7dxhg~O*8w*Y<#SJ^y=g19XK`HD{nN$6SF<*VF`v31>1;~D(>92k9v=j|d51#} zMTgcl)qW#@5JU_SP_IC-B{%-wZN=&avH;>;1*~VT@%27;AOGD9OABga}sc&QFTt|iL@E?fdElvmZA<5J{>gpk3 zIQZ{qY*Ovoo}@WC!B~8OkYN%S;1BwhtUUZI;h02B#w*_@_zROgMKBuImZwus#23tn z1O0=)=wQ|`fE@uX{L3LXj?xBI3srSz>>}X!Ol!o4JA&vTZA|Fz2AAnYSM`?UU}g-U z1BfQkQ%&%Yv^KuhuJT$|_9O1bBn66+en6u{DzzQrB)=k!U)~ z{P4ga&72NQ&MT3IK*ldBY+la(2<;AvlA24002A_{AK>-L4*W*l?$8wk1itbeSp%T(#)Qf{i|@i{{A*^Q321ftWz)!8cb z(ieT_YyWWxMmiw9^?MRLeXIRSc=?@TpmN%zv!!mqvr8?z7Te_9m+T^rE7#H`qoC5_ z*5*b0boH#td8K2`;SATt7fPn-n4+pavC+@z(YLC^8bI=8RG40^!lm|aHs?bRojG+i9FMp%+2f2Fha znBkU_Eq{tw^mx#I6GlZ4%(wPR?3dNHmOnW_@G&O3P9oYz`l={WhCC^KV1rKO5Dn}o zZ+hCdvHnwjt3J`#)3x~Up@dyAPM(><|2eyhG<25-)j-g9lbVh7`Q)Rfw}RL* zjglDhvtj|?UC-bm7JHrwo)A8QNR58cXtUEd^tXIHeim99s-hiN zZWG51S{raZK6!|5c?R9ol#?31Ae;NHqCc0ue^IXLejl!<8{yVHRn-YB*&@JksCazE zhGHyszHc^Nr*P{*5QX=}ILIA#7qYt5Kwq8&S_;m1Z{da!kpl&wC`up|VAKIIiqEUY z7gWEO*DY}oRCgJn+rY$?k*-`c_+1@utx*H@%IVeAoD15@PC3@YZ^`KJfFaF*ZMc(w zhJg3|#rj^yJvTVfJYGV~FxH%z$?lJpNp%S{;cb&T4}@viN>!>aJdNTD>^Y=b#_q&l zg7z+BI99A`!XVB8NR zWRhU2bZHaFBHWxB5gpO(p^dmzQ18-Vvkme&vouoS12-a+3ZPwWH%CP#(-5|z=hdfe z5r(LE14Vzn8}FWoe^*0-uZb7jF!@izYF9dlwYH(($>nu;a*zRVfvj*_s>a{~%Y^Bv z8FI3ym?rR7HyvOk9A~@?Q<5ZxBB!2UqA*lyzzX@AFPJOCpXZ&-{y~Lv$+nlLY$Rhx zi5v~Uq@ahcHJx%u6fM3$lRTzkj-AbrGtNPA-Iish>!66B2^$UjwZ7v$9i#_HsN=)55nbs2-BcPx#iO$nw z3SiWsQo2!Qfr6||AOzB`*AOrkt+AzVH4~&v12Q)fgxDKi->Km~Em239?WS(Zs!b9X z?D7U30W42;0Z^N6dZ;t$r_{v^kVw6O&`c9w^jRl`1*cC2e2MNin?}EsNrzk>(WNnC ziI-(|&#?PHu2D4ASa@q5x${m*HxT-Z&qu9$;2UpNcD*}&V*`-G~u8Hv(;OG=W$ zyyRvwdRs!9Fsqm!Xbs6?i(!9jj4JPp$|I={Q28UJ?hhhfv`}~N4dTSk$KHd!=>_)w z^a9A|iDjO2t7A?^4HF9%SXn^=t}fRal*txZc&c#T0I-1SFJ3;O>$2@c(i_os|*u1 z_2S3Pnz4jMR2oLuTU*I_X8^0_jpxTd#Afb@hV6pQHcTNq_60*GUes_n#R`K`cOyy; z0(mZaV1yKBp=-kjpnN?-!9tgTFdB71%R=l_1m)YgMS1l!Em?Q%x@_St>O)yImg-2p z^CZ@$WGC4B5BFkGN$>;;*)3l`)%2Us3aVN6`?Lw(m+k$z@hQt}C9!M&XQ(#P2K_CXY7B^-k}? z1x78j7wpD-JqD|`=6wjqWT*Wfv8f`&biU~9F$93EzFStNmN6!k-3&IlF(cU{6m1Se_yS>+|E zq(qASPa6SqTMTjicC=+>;4;_R|BhEh#H`{uq?;sd0Ud01ggSD3sRrt}Rpko$zLq6M zbEvW5!c_l|1rq1L!-=vDPM4PxJd_L~0KIiU;rr9@Z^`ts7)L&4EAp?Z6wr5MlC1Xc z%XxDFKO`tJA?9`xdg z1L=E{Bko~fAAVr?I>|t(#X_Eogm|C`J1X;f`<*zM# zs2U+r$}KMoDHXM;Z(|CK9jm3i)$^`lUwoBXrw!DK$<7|Citp_@01ZZQiGCz~;W>iC ztRfuHZeL7?bZgF~gQBfHx6})&-g1>tUuq^%C&vvu(QliH>{DBnV)D>T1NJP-BQobJ z^LX7<{6*}v;qbp)=+?3Wf1dmJ>mG+$ck~cnO z-7T^(tnFAg{rvQiJD97uRB@G8DYgAelt4+T+~{KhxFD#aXP>cUtLd4{*DD;A^nC0Z z(Zu3>V;i4k&0E3mkJB(jBTL#t0i_l-&IdmDeBNHuMU%7{Ffa^`kSkgv;8PHXw^&+K zb#Dh`w$n4A(`}wB6aYHT=~VW0e9r$?KWjQ`JD;3Jwoq2~SYSuWs<-iol^&TWV>=m% zTUfg`A3q-%*TA?PihiwCmNXGWgE@^wmx@fA%s32hWqRUNmXygAdn-0BY^@;c)ebHd zs=BIpp4(Mc@hZ_KsRG2a?5M$ZNLPLrZF!Y$3;+RvCwESD;d@8%hL`f{6M@DK5)3!o z;7V{4hKnZ@1NWJRp@=8eLCQ$ZuP)S~?vR6AUOqnncCz~cj#mJ%aj9S9$Zv4oRAObn z1x1QWAQ7UWr=Jn11*?E8M@7ptz5-?{3MyGHL=8z5#u#OhC|4D@ z6~&W8uL2F3xcHCjxSQ2u`SX(P=4WUGb{lv-MRIpxmXY-A9fYX zN9nI8aUAQ0OA`Yzjt_P;16m?aJd6-rqJ{5MW~#NKmmSZ16w4SbK~uuLQ(c6Dyv03y z8l1EbS=DPwSy#DHc)lDYMHJ-LGDbHN2swv*a9r&7FUNp`*KuS6y5s=f_#o`{L$~S! zDKXRt0_9W zNa$ogL$xG@>EqqwAW{@pEe zL9D!1c7!;}$|GV*&KO;8t%GThspQj1+D7@u>hB|`ZHIOxd=l@o=pRt z_&Y1N>+b%)>BYd1VXfAYa!Q}6QC(Z>EpGv~q$N6I@1^d&VA=*#CCRp_{=|XW654v@ zghU7(?5@et?sojHLlO+N*ekXHUEP;GyBWKGGs#MumAIlX{i#`8A4`LYDUu{4eHgey zYlJ56PI=Nb=z;PLi5E6`6 z|8A$Mn%NTQ_ZlZ{PD_V_!j=}AMl?T+;$AGBp$5MwBJeDb4f_`uD&J#{dPz$NP=Ek3 z8{DUwaeGcttQQ0jDy^P|@{eA0gP{Cu!!3CY}aUvMkZeJBI0@gMBG_j{(jioz8U z)SOK-2Rw<=lOpl9+&h+v=k;BcMT{c{0bv8Lyv4ZO^t+-BXRG=FX|mm@-}UP2NJ2A+ zvBM;t2V*f}F0^QXYypNNgsJj%9%3+s4v_p{xRa~U(e(1!iM9BxM~U}4fIDa z=Jo5FwGNV!lxiF+L1PZhYqh+lH#)VT6OH*yGQK-5Vx1$9>DkhzF)nr4x@_8}IiHfA zH>DXZ8f?#cA?F5P<3o$48@=Do4{UAfV(5;9kZ|R_jkR!M$Sp&kcL7PD*sdzwy(gQo z+_2TTXQ3_7YH;vqkk!jt=s_t%7E|o{#W3hs($U!F4EM*wCbznlF7Q6g%3`f@rllAkOfs*wyYJaN zu#ikpssWg9W&}#PcrY@n3iL$KJT{%c{ZO>GE=T}^$*BV8+^gj_a;(AF5>O?kFZGMw zK%ob$vy2f1qF-fIKOU^ORCvD6OX%aEqdS-V4oAW>0?`BQmYwLW(Z8=>_skYw<1sIbrGp zXC>9|b@Xo`I8TAQvz#CDEG0F$*Jwd_`0Mt*L2Ts3v=SP$MZ#JV!vgKz&8UCn?ALz)oUHA9p?Hp*8C{@v!?f z`tzWt=|sNeU=WImAVi9XOui$*6?YH%fmveMS!rWnT-tho&{D;6A%LlL@57Xtc z(m9z1HMJRmVxSYWF5vd<@2RnN%okI4$^#v`SKv&mg-`V=m6zW1n*C>#q+WtfsQ`gw zE2jb5PEvuWdNuc;Zzb|dJq+3igCi~(OD!CJ*NI^&PEdiFAV*nt8p41GV*yI;9XY(6 z$FzOSh|qRdQ+nLe6}z3&+%9|urNGWBa&T-)fXCdP}JX7b-IfG!Eb9@nZhmqcnwN@1O@SDI4at?{2?Z-RAGbZP>>C=Y})q9E~ zJy=yXX}MUpnVen0{eaR({SFlB+l8s;oVA%5sNq@XHM)YgP93iTTR_NUKa2w-hx-aR zKnOJ>(6a69hJ974zmyJ$5WDb^1ZpaJ_*65&-zla*6_!crv7_Sa*0IDngsh+;7a2o0 z3XL20|NYS3#XL$w?EccPT)JD&srnM>^LH;$`5;iD3@HlLZ;OKvN0vVd{5f@zPN57r z-KY&+43XLiMI?}`m$xW;Xnm?BN!br(!mJSKU^T9qxFT9kS+8F+jLLW;cU~loOGo^C<)K4+IoPtXDSq zsh%K}&0ehr*0(=pN*)O$xYkhC53Q>0qutg}c**`adNE{A5fgTHW08rUsp6lcF+wtX znlXwbX_$)mqtWVLd!h_!>g7?N;0#cU=4%1MkFE6|3X%2qq>#uS1ywAD_oF+rz9(+Z zf3SDaw#Yq@uy97+r+}t#&!-lPBKg>yuxI@i5snlIO>Te}_acaf!|%`qDzt@*AAB&X zjf_)|_G`YW5o$OV;a>SOeEvNr256{&{>3_jRg`#NTQ8)L%JPa3h^Z8b7bCNjwZV`w zl$p{b+cDdJK%(+i{#l%Kk}MJwCOZy&ZVFd3HL>6}P4~^;OeJ1XF9@e!*!Yi?K}#kZ zWQ->K$esmCaOD=yX14vU*ob??fu);W9i9xc2V4!i_eUsih!Z@CcLZDbCbhHh8 z3_UlnHCf2P{|VPF zk?8}EpP+wCm9GzWc+{5XR|GHvPnM@c;QzD-JbqSlSVvA)??mh>9CE2c1Cl^Z`Fs$? z(Y)U1u)*)OmX5w^m`q-PJQbvbA^Zn>VqXdgYyE7ihLj>Ksf zN#lQak!y*I-xDEo`7j2V;erfR6mPCRq|;gh@b#xooVPn??nd z6R!1Ir?{sY3r`uC(2Ac^P(Y4%zI>_=KCir^x3-37Nelmo={=1Hg|Hl*+DxCz^SrXd z+E0YmJRWI@MU4`#e{O~*?%fA>mwu|MHpT6jyO(1o^~AJSw$v@u(_Lw|brCh99SZA1 zio}!I`{?EB{>~WBmpR`(1{E1amC%k6U#WzN&qn79{g&A*;XiwW|JV~SFfsnm6w_`s z-Pi+W1m9k{_z{}cr*&Bzu1ouQe*k|ccxsid%j>|64(m3OngplRfZax>XLfVVc@b!E zxg7R~8Kz#$So5ZEv&S!NtmWDhTbmwa#suMFqR8V5am9o%5+p68l;b%s)U6TA4Xr80 z@dI!wvrr?2gA6Z@P;Hkd_8*3Ei42puD2DzbL4`)k$ob`$E#ijWOk5U1XN>P)-KA~n z#DFmAYzt_dt!1b893BteK5;m>8H_q`-(C!Nrgc0o4hHnaNk-8GZr?tq z$dYsf;c%vn-VfhLr^W_qrGih}R6)4A2N>VohQ*Jg=iPmoS`I|9M$?KfLS1sq={2-W z$sgj(A0TzHRglbPYbtF{5kP(oQH+yPMcW@!fbK6j04MLYyqO^gO-Y3Dc}OFHwbFQ^ zgt5Wouc%UzQY2MT#T0@AFUuMeiJZX_bFGpDoEU?Q3K7sXb^pU4NkGWw1o)&ef5>}& z4o7Lqc&)ZX@+PsZAUe!3H>~J1C*)7{bZ|*`Yt_?88~aX6r!Alqs?YdAuC3E?zsf(1 zoYL;1H(lgcoK}07?pEm4<~ffvgMSDqUF{Eoj)-10SFwterVX@fwW!s=~T>XOS}-T%_GzPgrMl2~cu#c6^FbOVQKCv|gj`2**W3L95} z_v-_J2GEltf+Dq_L!wY5@CRZtw42v?< z^DTP&MW8+8+Q}+AVEuiFoJhR`#12T$@%tl#BwR^8jub9)XJkRrdzX!9p1M~}yV7`f z{7BgzWXR}DQ%jQ0o=I}cQAYrhhmq0GTK&QaoZC^oW!vH=2}iFcn2op4Kc-c`z#K+& zrLYGP3fg-8SJ#IBtIL+F$VrbCi*v=_jT(ki%0pGs5#4Mw{@j*XjP|NWi}36Y%u?YB z>%*wOhT5<-gwds_mQsBq`>Y)eTq}37p;6|JS~V7V1FTwTYwwEdnQl-|Ig%UWxEsvp zaXmhAo|X?V28p5|cbH5LB&9>^S}Jj428H$Z6n}!l>Kl-GDFwQ`gTsyFOy$B=gV@)jY7_uv= zvdl4X?m!SC!dD-Q38t;IHP#gXtZQG9m|)*iZujAwgy%$GAt1PSz2Ego!A5~ZG`3u! zUE9^&QGpgCnukJ?i0i*-N&L8(R4l8gYt@%>A>yP62ufK21lr_C4(wj?_jVw`iOrZq z-7}y0F7`n*=NCAuv}5XbJdGQh+JBIK6H_u6ug|DRox|LyE<4YTdUF}{E>Df)Z=3Fm zIUrXLk?R9meyKl$kCFDhxuNEdb{G6pr+H>1vDlnZj@k-OJ_cpv{q%1T7`p6qVD$_g zmpjV4DGu&eTNP0?rAb`rjiVpw_uRbtB#%G&?dg=-gv_q7g_Nto@mV>n+W(i5DBZdI0^Zhb#q@&7r?jzBeM7fJa%>3=k6V#yzSw_Z8^2YYTFYvHa^kt z)Hr3~dNy583DE?a2cjGVGDh2;d$jKko0`BhhaceR(?rsT@tVs{#@e`AU{+6fkb#?b z{qM+BL_z~Py{I~p=9I;nsmKn^Q}D_!vbqb7o%$zL^L956`eSuL$RkV)5`{~m50gW) zLA=Rqbx)5rmVLkpMWo>|bF-h-?(n=TI3DAaCrQ-h>z&+jm)evL8#KpMltTwD^NPlg zpLJu(&ZB2P(qblABASz;49e*XW^MO%FQxI?d-nhk@0g%=^RE-j09c+IpEd8bHQ&Ik zpaq7T4a&CQEIY(6e7i`>@cCOHd0g2H#U&X^XlbPWjPw#*><5Xwer{+wQb;MmtP{WA z@bQ0~CqaEh*nPPwg*Cu^in?gQr031r`CuvP62hr^>A9^bh6J^$Os~lGKUo*m2Pf8< zYS`3ODoUJhJDsXre`UHi%9Fn|*qq&uD-|+DoBQOEAXp+js+Lh#p(&q8tGFj%z;1WS zi0hMv8mNoF6ej)|$vec!%LM8%YGM!oa)y7kvK;#*kg=VZYN&ZGS!Gehfm1&$9!>B? z1VWc+W(QGk(wzAA`(SW2(?@-p2D6CfET$}Qm8C#MU_$LhgnP0Y83Mq^e$vrke|G|d z8{;KYvN;fvRnw?xP8-(zsZaTHXz_v|%=MZchVh84#0e7&#h=|0RCC2i8+yxUm(%uD z&H0FQRI^~A_qQOqxKR2OLOTEuCKa9_*)s|WaRDVC%0DWk?WbmYqX57g{%(A#PM`C`fw3$-Jn66P39J4ip-mI!=yukTMjk=5O83vx z7EcMQkZM%1+axu)rKJC0jY1{P#u*AM?+DPmTP}{Dg1G&1A%KK10fJ3b+<~MXYiOD$ zX^(Xbp44|cW6vpoRXA=hQUH1 z5Pp2E>Pxw6R^Ns0G^?wQn#ckl8#x8~fSK35`CLbuz|hFRIGzDsPyC}~A7EZ($B~}a zf`^R@f<3KQHnwY=Ye}ia*lLSs6ZQ3S&t`>r9!NO5vp`Hycef_PB?ilf6?2S?XXo0O zY%9GAJ%bIpB4-#-I<-|KeNGTXs7Dk15b$t=_VW)OL)%ie0P4Mo!!0jnE4LZS~{JN_7%V|?Q+XN0y-Tt0&l!s{aq06Xn#jfpU|ioCp0pWX(Y#Z;c(9@daT^jPx{_> zhyf-Yp8q_v{;OqVVfdf(q=wY~?@+^EI-IICHZ{?cjfaGP349*KEY>MuC%ESEy0Fn0 zg0XGO|3!zxlx$IxTrV<{D+n1Ne4CnN8!)Ta7LK&d75V(~c)A?AVAegianxnXmy#QzQDAXzh@6sEWj zpkW?i`@%i*YA(9@7T=*ebzH@4Z4)05C#mC)*o;U} zTThopNjOCSIvqyIbW?UVV=%z<0V?4${4#^ZvenD)g2lPYCANt+dka1;Yinxl zP-=n%i%vVUwS%>@WvdHc8{)`FA*g-S5XP7uDMbNJ7ZVD?p|oxNEYmp4xKDI%=zs<` z$~e5nV(AQ43OnJsi2$~0{b3&bNgUYNyy8XlFNQM>lV^8R2UEtBtH*}9rOd`ELRZGv zF4xxCoSzsp++Q*$b&&@m_A)q^8|M=%iE;6)-E5J%m5TiK=T-a|o`d+@J;He+6rx}m zuS=dG=|O$4)rJTQRwLX^QLgcSsujz~%Z=R9k$vn#BT65P(8gLG)hBw4FZ2<+0xK-h zC_9dWQQUNmi&qZ*ic9Ak;$+ElGPdNhDWdvVu%3)_T05N(#g9~Q+8QK5v~Y{{wlmX$ z4JJ&W4SsppdKeIASYS9N4iRLX`GZL;A6UZu^d`+-gNp}D^`|}6!3GL5#{~}kh z;GVBUSMvY*mr5l_efEs}3-_iON_doLso6OH(?Ll)>>fv%!*>Q1mkz@kR>c0IW@Qra zhcfF{MXhA@)0DKvmnVDM^}-m(kU34)b{;vH;8t z>P=zi*lp#%0v%=~oiy=2v9DQE*#;Ya_7&a8VoX!z)pF}P+Ox<=<4&!<)U~cF~g7h;70YhZ67tL8plw*@fjC zLr(sMmndCmCSnW(!E6BILaNTNX|WKR%am-4amu`1&e_F)X~hWZ%Gu47}l=~$kWM06SwvByl0=wC@> z5M^xxFN|#LBTd0(xdJv7nF$yC`_F6&@+nA=7H6M*=!KvQfqHa7hZ6L(EEF+llQZS>;_^;S;!tW9t-C9ef1H3 z!>Tq1+N1|=_9vp39elvHMd6p^J9CKv(8>*pGM|jW3hRLD z$*5w~B$cR1bItCd@^dMkmC_BoJjIBKZwYIPKId}@hP6agG6Y@r;H(YRiZY1?;6R9x z_*U7{S)quiNV;zL5%#!BPO@-sZhbZ)_u_s_7-;GXzw@*MpACAvZ2!@+59lAO3a}toH-yM) z4N@m~V&@)@$xMF~Xpk$9tO5XM+Nd~avGKH`Dj(7kqQb-t}u=+;_lGK;8vRUgtp+y+mYqfav0ML-j$L=tXhEC{98=abp7ZNTiy0 z7eaPZ?nFT8apjbGjC}RW-#k-dQurNMYrx-_KcH0d0pAv9US($%oU^Z+Ly(!^fF-H1 zCKTqt0kNUIgDm(ix#^;R_y8lo&WRd4kNCgsqADY^Wzi^MMnRB`00@}y?PR#A8eC{i zeeNX_ey+DJoGWkUQz+0T|M0k5NmMar;LR1DfQWSy1us6Fn3V91w+0Sp9EMTS*r;Ie z#cxR<57Zh+AO3eQIT(k@u7uWe)7e7dNiAS(3TlU5S1}*I!8t5{B`I9V=+O`oj33D{ z?__qcaPgPf_0_PM*e?|rcIv`WJjhk8o>5CUW z)<25UM%(CCk6S-|zAvhbrNM-7tZG0Am`mK7xrOyBjClixI|0(pc&uqWk*yyxq*49ra$DMhl*mj zLw(3^mz~OsEkyd=iy=|t`3tV>IJ*gTL8NsretW^hP(EOPQ${^*;EGD3NZM9Seae_j-6*pQX zpbBX@r1C-dO?3%15*9MR+0_AuzAr+xI$V^#qwxMM;GnTggzoy5aPax4^f^bu;shFn zI|=D{4=cQSF0Op=^XkFsZ$*A01|^*u7@BL2`?6YTK=@))EWUQP@vG5>Lt*G<6 zYE6c0X*6b_04Bi>81vFl!hYy`xFb%=GM>8*O{xWIEg3`31C`FqZOv$d#^&-`V0`IJ zaIWE6_;@nu%F3laFRU;|0DsnWgpiCCTQ-UPD&BaDo_F{J>X{}?rTSMQ`dD=&uKeoH zm+jJuv^yt7RB_a|0&}oAWjFLQDit6IQ{f#XM40Re)KaCccsyE$%t+*3!qT8o%s{3D zj)cnn9$vPQaLI0eWg4FA9fb4G&Qb!y4|ACmOFaX{;Ve*ow29`DFqQ-;C6FZ$+gc= zLwOK1Bo}vZ`k3@wawzoQ>lK}vs)~lk*y2y#0S&`~V?JpjCnSMcsVY71kuYLlQX1#a z;YPJa1w92r@jO#tT%ovLT>25E8X=pn&bC(*#MabDu6tcT zEI}woD=+4}b{^4zJ$G54D;u8z?y$!6AoX&cntDC&`>`}8czwKV@x79xTTDOpx1w z3_J$`JE!W8F>Y_(Ua-A$3_=jO9n+xgMAyZ=iD6~%nL3H|?2S?A5#VKY zWl7fqULIjZHr#A4^gDlT?M4O@gS9Z7k?VVgmQ-(=<=Dxwv#{%=C!wDH-TwH%jpg$+ zU3^XVVXSM5qz@JDr2qU07dw6Q)&my()9%~?Iu{e555?xf_{mDhZQ1@|z2TN?6)>Ok z5y-) zzHUOg?zA=2Be--TNr0%M-2#JAy_1-LPR1{KnpwU_x+>1F))1J5>8-56O|%S2m)et1 zGMISFA2K&Ut%iBTAF|E2UbOAyUff?gD@Iz{x!Ld^My9%XG?9@_J9)Ip5T447Mm### zA1WL`wDu)Z>a*}J7_tCTTOawI7swCVDI8gJ-1X?Tg!O+qEL~F^EcxbHLb}6CC~=FG zc(8@|A@|v^U(T&uurmd<77)Hqy$%vr!5{UK~KV#G3;2j|2^n$k%l&5ZC z0rD?@q34KaND5W%NZUI~BlxERt^BJ6e+euM!`(aB`{6p+8BvcKI}OE_pzd-r28vN! zwgNg^z3kL~V87bvZ~mh-V`OCe|M4P}-R+DC=;RD6l$@-g=wt~P=;{B@h!h7$Cjt)k z-^c$K3ID$bs7z@}*e0aN-6|0WW4MzDJa5k1w}zf?XbKHgCmO~ z+(S`@c1ElRtCa&vQA_|MPLcdE3}Vp|0MMJ9UC%QUCoNk4CqYnr7{QdJHcccq4oO+T z#37;^Q6mouPL@I|xiE1-5kv)HWG~AgU)??gBW?lv?`yu*0gvn`pmGYbgYq_-(D-g6 z!ZOn0jYJ)((0JpRAOnR09Oh*JaS-FUr2)>oP@BmXS5VVKU-DGD2t3Q%;+*F-PpeI5NXk{`gJNKYG1-Dc%d<|m5 zDkI=z+)!G+hp}5}3Z>U_ zV2TI8Eb=)o08+P8NwC!dcRoDr?5EOmEtVVI+=^qvpAF?-$M{`tt+%w6&-F_Na@Hcg zEIE>6RMia&{(Iuw)@ub{x=8K)<;wTd?)}nfCMP;s2$dHMI{T?Z)KWv6xS}p=t3SKi ztU}CsDR6;5AkJ+18$UP7Ggq#FU%idoY(JIR;FbXK4p37BWS+tz5+AF7OOz7qKhZ3^ zs-TuN0DtPVA?fM>@I@}-Q5#eNRym!q)hn+QPLUk35ws8;N0%3K&EZ~{5Z{*! zwZc1RUoBQP^r?+wZAS;23I4*zuDDI{5qC=~7y&^@N5E=+G6N{W*; zkV>$^{ONTbbm^3(VQT|8z6cI!&Hh7KQSMoPMQY;Jef+S*NCFjX0b}-blBcT1Fw$Jk zIQJr!W5f_`m@2?VHM^6qfuC{jfJ$Zk+(19)?9J%XK**x{W50PLB`rfjSSXvt!u&?&p)a83 z+qnoxUMRq#z>TrAZc$;Ynig1-#z*xxWA!#etv16Z=zi_^K}1ZOZXT9WK|=(&NhhhG~#Wy(AbK5jB{#(`o2v+0yA{`S~T2k+~1d!PP| zF{hGE9fP=TKQal^>U&9TBm z>WZ0zad@O5VVoR8rQn|_PwRyDg5#Dje|V>6sUYTEvew;{mcrH47rnoL>9cEd&7a=a zTzY+6{!A7btS`Ir7#Imt1`78i#$yoLT62Ac&0#5b592imR3@oqUIg}co<~leTcR+Q zH1-@`b3LgrNqj`E3N~fN%eR9kK2yEICCH8*veXS-pOMgYG;q@aA0>YRK0rwr66TU7 zz>(BGG<%)v7nzz~9TR*n+&;+s1W%3O(iVcm?r-lzCKSnw??@$eEISQy_R-2)SW@d| z>>i5_L%xD+t61J26p`s_XsY{KpjT53yYmFkM{ecJ87ochd=9rXX09%+Y~G8MC1=h` zS3x0e?6bH|HNozPMd8SMuD#}VYjJ_(*|2mcG;RSp|CzU(BEkPVn=a7Eg_&(Q#ehSr zWh>-5=F(Z%NmkL>2Hs)a?_W9KFVuI{;Wb`i$H`AB)wIqyHnKQvCLbBmYXU`zB-XnV z+I=cMYN@*fqO>Ayl+ z7#ZmQ=V8he=2*f;#~rV3zEs7bkuWlJ>j_C{k%4J>mr&03n0+xlk*IKR+Qx_q5*QIuWf(bN z;+jQf?RIUf#|qok$5p7>uMq8G;dfhx$kgNWm4T3~$|BHNV(qVf^4PfaHQOOqQQFLw z>@r&kzrk0-szG4fwN8&#M?xC%)1=!^dY`AMa;DRYYyA^SdVgutOqHz%95(JooC^00{7Gx$aI8WsER>=JmRnUbFHvZNA3sLzp^? zyPfV`y!$HN;Kcb|PT$SdW+Q#_ug1*9*L7Dmd3|KBKO7Va&%r)r(=^uhF)K2+V$9in zz+6wV;1&IkkTqUr%ey5;u$~JTwdaA-gr<4DV`+%CeSh?xx0ACji`Ld)e`ROH%jJN9 zE-YgO(u>N#*Q6~7=Y$LX2A%}Q*QRuzp+=oD7>$&_0>aR=0bg#qc}U0~igk@H*a=|- zsrDo!7%`f-a>pEdg_+)s{bx%XitU#bRFX+L+ClgQg5x!*!4W0DzJ91e9yZ$83c#Vv zOoy63%Ee)gsg@HpW)~ow+AFM1M5l7#GcDY+7I% zY5%amC{Z+}UN=et&O=m`_ywO~YvwxWm~~GJQ_# zX9?q__&OP8xCHSu7n*SOt3lCm%9m|QP<9dW5yvc`>z1fUG0 z&8~S$g#pnGT*7YgfKcze!ceuA+E18i1FXo9Ucynp2@{E7)m22jzPtljRBvHm0)~EX zdk)RZ`%Zt|tpR&bHC&D-6T+$B^3EBH5(N5*rLh6`_)DH9QmaguePl2L?xOTB^)Ubk z9wRZ2VJZKzO(Q|o@Gl|3tSMwKz8!rSvquJqgA|y0^0Pvt2P`rpRT|&Qu ze#nAcW#msndd{t5$v&%u%||Dkdl9Kz6{P1 z%4Qg_cnk{&f=D=3{sqY~E&t~GWU`$8HvL9C^Cj>GS~-v~+bA^V+s`0xxwabEThGof z)B*l?0{XHs?IkV2|4Kc(s=Y)b(!+)eKRpr-7~?|qJz@4Dutr%`J*t} zi4cVarVxf^WzX*V{g&$LN^pCF-DV{W8p|mcD^eiQ;!`Rm#yIsltaC&L%}${85LaKj zJ#E+7wi#1vjokUbYcEL*t1x0GS?*CfP?`EwuL`aH?$^17{zjVxH^6awQ*>CY3IuSRy;_c|MOH zlGDSNKCdu80108vEEdYvQ|es4-tBpz*A#VwV!IS!Oi*I9Rm}d=s6lqzH}^XB!*Jw0$z=4!QLjv$^pynnAsBzeZeyhc-{C6Y zsoK2r+b0T4MpzXReem@aIKIm;L2{v!5~mUhzy{~Loe3GxHef81JeJLVm{rB~0B*U0 z>0lvsxbwL5u3id}wRo>hNBV_h4+J=&YtAMyQ+kwTao^*HRhFD)0D)BzgL7MtJ^=4g7B>4?1(6fV zigOWx`6#>#fBbGyZEP=$^w2H@u@HP(2G18#JB!Z1%Zn*@8|zD_XW$n1g4WA@{z zBo};{a@+SNpz-W3XPcV(>4OMy+|A~GtM=AU(z_4a8D-{a#tLZ&ZB&{BqZc@exdG7T zGcPzg`Rq*;PFE8Fs)lpGIHl87ZarV`Kq*5K{Z})>%JBaiAN)V#0Y(O<|Cx+4 zrSYo?5JmbWkeWnb_ZMaVVQbuYYgc!5 zcI@=>Y@AJ+aqVs0I$oOUH`1EX?Yd2*KjKp9e#&;#KGN1m-U`HbJ?eqz&TO5~-PPfk z2-6qc?S>}Y8iJmN9HQ)UYY#*Y7Y#TQEZ;iKNojoT*EXz4w{ ziHvvo4^W$buq~Nxo|Xojh$L4nJ#fN<7$dosA_NEZ1*pw&YSEbB)bYi;14E|m9bVX? zQ`CjQW%%_@G$(fYsFU2Ul($OHTi68Y3ru9yEpoAL1P>?L@hsz@Vk~c6-`nr}nmOOl z*@w!SuW1OZz#;4CvwCwsn{%fI;A^qclN+}q&lB~`LOxYpqWya^+3U%xS#pt65sD*_ zt!7?K-=v4pLB>`hCmtiF;eO;eCu_z)B;FbbMN+C9Os;$8jgzpM3F~19eA5RA-I0q0 zBPzp(>tqhy?un{d@ujtR*t^Rj@)KjJr5CozVUVHM1AjhItIPuHArD~kG{bLRRM9xZ zX*=SGplX4%te7eVth~P2tdDoR_ftAs5{q)!v}njl0U#13hc`iSrKO~Sw>_t|5rfaS zC+oEGt>ISAe5O-ZceuPgq^D4$zf*l@g=x%lHa8W$v@M z&R>OcNTHolny3nVk34(aks!M>XgZgRMft#qN~&cP;*skHsG@5mMy$&Kt=O3^>V;yg zvcyIYpIh5&+~~iR_gW^TPfRDmYr^YC%0!Q=^SgnxH4pA!1?z4CaOOVQe3J9#MhLwyNnt}9Uo~iY>%VyswxL3HSS?a#`t6&0n zjRj{nYZRB{5uGN+C~zTcLHLJ|ym(s6#mo;J*|0Z{^GUu8G#hX|(=`TG&pEAp9WZ#1 z;Ro&5RrmFmS^R6ZbW~;g;ksJImv* zvbFo?`SzvrVjXZ6EtP#GEn=WSp^|lnk9dh=$TLn~x*?~~q*RE6GsluC%F9~_GWPh- z)G(5kO;N4Dk0zB#44zh3`}!y*e*Ix>wUC+qA>u^2!s0iGRBHl~|q} zW?NqTfm>F>T-HjD?ohzxS1D+1*^oWYE7d!yx)ns+UZjT6KK&tU+dpHBKGv**#wrm4^qMv`XkOQ)YS8t~D z7U#gD23>Y;dT$LXQHGl}=!b>|z=(=S4-MpQ%BwZ_vac}U#CL0d4(tZ(i zE7|G>E0kdqq*q(T7052N6biH4P-u9gu|EWsWr?jSPg690N95U?)=}tX(uq=Yzho`# zC7=opx*4G8=gk?pq^$@%aK~>XMSIUG)a5v;gtESUgyQ?T0&V-duW_~;%gI)eyK)3x zH26a3ox+JJ71|*fVscpg-9~_tq@-o?TS*$WW>HE?_;tfRE!np#HTiN^N?LjYNz3yd zFc2ZPE)3no?NJ5H>xqA;oka zTUziBBf6WblSF2;fl>mYnlcZK3Cx*#-lU2ShS`>sx$GauT_OX)<-3A0v!0U7*%@l* zP*rpXPtdn+>^)Rfx1U9Jkm$O2gIpo;8oCVeN|6yhek95p{Lu{|`pLOpWe0^yEe6vu zn8$+aFvp-NXys1y@FOyi6joQYiVDQb!e2rJj9qAc>Cu_V9_d4?GPn^W(D1ycujln| zf6ZJN(xK%|mv7XkM6d_xl3I%xnztYxfJm)xoEhX90I6f@?0nESW&Q)I3CuYEpKZ#2 z5gP!Uod4@5?Ej%+{{#5>-RSR2K$cr3yz6a%;Qq1IRm>NR=`HriC#N8xi^vsSw+y|q z-_42rZ6e{=c_p+L;r4mQKT*WdmF3Z-ukT^^Y58RJCWAGNg7L7HS7T@H3xE}yc8{M` zd%N`fF6h;G9n5MAvAnb{{(7?~6lfK^bN02)jC@TD)oIf#swQzQxv^cPGE${bC!e{2 zWt-kGl4fUJ`LkTvI=tjk%i7W2uK9&v#n^7Z3oj{Pjk7!g3!&?u2uNN;0huQ>ZDQsr zY!W`tBwiap9Db**W3k6EeOdHDGs1qI&T8l0jm*=<0~kXHojwil%MBeF+vIPKWwR9`wKK-qRFkCF z(qBe@cLb9sy71bCu=NP`GgMnWH|_HCHhsLkZ%-E|slPyP_~&p`>Ig^s)RP`BmnsmH z>jUindWzUHtg7 zv~+D{T>O|2tj48Zy$1N3a-G-x+1Fa=0frI%G8FW<{;_m2a~j785l!L)Eg~rHy*8m+ zMF~F+Y{{p~N{xPpk3U(VIvm`z(x%9Dhyubo{J4of4FaB*Ti5B-KSuvh^l#@|#~;>S z-A{@{8Fa|-DPBMsS>^yq{Xc@)t9$$4@Kn4+Vp}1s7m}pyF^MX&XcH3y@KVriLU2W6 zg8+(wmzPZ?^G^HUg>Q2~7k3<`!Zs1A<2fW&HT9rGz3XS$S_$QDLrYys?)(pd5i*#? zB%^!-zi9rsU26?{PtZ1HHIN#}BFsq(PU_6<4?Oud5^7JDW_1f-6SQ?agnfLML3 z!C5;;V|$CkfIsV0DZ2P=h@AWF78;Abms;d}c+2j23<3$?yCD<9->8;A#Lx@_d{J;!_OT7dXd6k>YN?Vq`YGIC+| zBE@DWAn~eIlp9{OG?iQ-s->S^u$MNI#trkMy0gdW22w*t&}Z3e00qbh5q%}NXsGjH z+T)r0;uXJ{*}LoM2tO$Idr8Q5m0?|f7NhWt!D;i|`xE;2&K5)rpow2u=eJ8a9-1WY?}W zC+ul^n(#l>AR6sawhx5TQ{whMn`%z{ecG7 z$WWb|*15BRPw)Evq8Ics+m|s0yWhilH8XU-x~>y^?e9eFlMv!8_!U-}skFN@Jw*5D z`fo=rXo%)fQrXtCVU<0y*VH;oDd%>cFJ-Ii+*Wc}DMMGmpOF{d+zf0cP9b;)|2QBM|zTPob33&3gKvh@O>e7j% zNYe&uK$-Ca9f#zsX>h3D|JFCN*(MkpMe6FO!dqxL5yn7zR-$$`lv;q+_K0rhN#KU7b3SgcEIX4! z*HD|~Osxj+Q6nCeCZSvB3jaH=OV~av@Wd}cLBe@_lm6{}3DsjhG}eXm_#Jz`VuN(d z+Rhvx1|V$q8;1TM6R;BUx4*G9!o=NL9qg!qe9fqdLK|o)g}9?!O{nL9cx9}|Ots}n zytQA~nZV`M8uM&HYP<83IOlL%$J3|vjqlzOi`v`CGy*LUZakb+F_!HW{jKyd6eR@W z6RSC7$693=!ab1LX_qbMGC(UT;9OW*3t|YAb^Wgu$vfI4-&+RC&6#H4@-+Sy{fMUc zJ}W}#C0Z##G>lH(u-$?fE~WNPYFSEY55|lIf2g1m8ThfAQXhu^_%Mf0Gk8RSN;SLf z3%dVebRMr+uJ zcvNVO!&O#dX$jMm1++`ZLQE7CcyC*SHdVHf)yyP7oN^j-gN#h7Vvl<$I4fp)?Ij2I2M6??PFH(eYVl^G6qXGIibA}CIsiWp@tPfQO12C@NQr@Wi#5x495cg);m6?@i-iZ5wnv3caO7++3Keqmv7z#aTK3-dw2Ks z__@18-d6&P8VdaknficDRqT6NF-gyjJE5yog@jsuJ}p3IoQ4L zXI6B*e_icsBgyAUXz2ViErfD1k&T@Y^;kF@J@@GtG`%TW3TA>>-z?K$CfrUM)lC_h z!>IvK`zj*14A%Lu3j?$Zl{bg?rCl;>@Ido9EX+g+EiN|J$8j93JfAPyQG1s$GkE5p zBDAuLQpbEpZ;(d*rGge@=Iv!i;Q=T-#VKyZrbTCf`F|sHCk)bM5=_5*$!wo%JFRs@ z&k@w9TxTQrEt#XWPPOK=!Z^<_#Dg2FFZ>8VpbxJo1G*#0q*dC z!km$SZ=bj8opCOBRJnl|4xN3FGr?aeDDFftu$(~@&%^YG7y zF1O}}G*=0-lFdwYQS=soxK&+|FTN~?uITjNrt$)^y)kn`qf$vXP0I# z@RT`Sghoa}MCd9}=BQ@-2_iuA&9Ua96f~%<8L;h=ZDLKG`~)^t15m4#3(iDre5u^yWXv4V&4gqwGG8{P(J*uquw_nB~Req00B@-Gm&^wcc`^gY1mU z9obN1D4G^J?z;;<9A-CFqtCuWW3oV53BeK7U*L$x;6>loS^1dz36_08T9+lAt>BTh z>!f+78nTdhjD;KQ#@x@NP$-riP@L4xn{@=WhSB_W*=p>B7tXMLkol25EPq_^dcW)*>^eHL`?{7i+=zL$%u@v>Be-Y zOnqrc3&FMHN~kYyrdT7T8yHx1 zByfwgD*Pm4uQyW`_nSwFQc`NX`%3Wt9$lc8n>5j?FvbozOMW7DioLkZkE(*~aymYM z83GwgsrMpIrVRz2DrA`&{dU978j-qrq%+%(#Vyp_FzF>Bjc|~_QO6~L&p!D>Hsfho zO?;rY2n%W=tuoyL2BU5sAt4mok&J_V*6?^Vrx-)2-fxo5SC6O0zJ;G2Vx2}U;wb58 zY6tA3u6`&YyYHlY_OxBZD2a@=Kr(ew8|>fVC^RSZZ=ER-c>+1_@Eq1=O1tZx@R9!e^7?FUT|z>W0s~>pt&)x!h1sF(}}w zUyKE-mw%Jg;6$7ZhR08$0_Fr(*$IR8)_D8I^n+@VuX+Hr`NEj5Fx+>UhZj$xh*yLp zr;!V1V*5o96bu>$XvL$JAtjHS*`b@UgAk=TIGX-hTbElm(puBoj4`8-V^Xw?f2;Ue zy4vaA)eH}Q)%C-?uQ+^_`6Xfy+k+$D5H0SvxNOJFMUvQrIOg1^riPI*H$M+X&GQ4s z$o#GSnrq6%`kc4f!2s-=s4-hIpJhgCNP)lIJ&LXOSx+^hYq@29Y@#xtphbjDc~D-AKTF zz)w?e5#Mn9sH_U0)RUWPRmItvBfCVKl@@*G&KKDNW(wc*?bX8gTcW;!o@!%S)6Qc-8>52&~d?ic$Vw? zZdVkz)UVLXS0PY`1`RsbKE8a525r$OeLXSXPs^|K&m^^|WOCkwsHYj>QCNDEQPoxr zdrZu!R_puO%icacY65y&u|q=LYx9`5sn9=5uDwkCsmA-<^(2zbty4m7I zXwRN06lcGEthKfB6BwOvCcD?yX&5gB^4)cj5zn>L?=PREouDD@BfOP4n$K1l^|jil zQd>z;!r?92DrDNz0=`(3z8N^3QU|28>-ud*`hh8V|Hk}`N9k_&rzUbO=rqVuGwLUO z?ket6IWho;B%|$|3gVjXk5NVO=O7zwEo-wnG!L~FmJ@DCbbsQUS)i<8g3m~=sZEn> zp5XT@{|={|R~-V7*zN{Rpg1c%Eo@tm1KVU$I%Vaw%^Yv#%;%=HZfEbNl7Fi;Zvxfq zvL+uW@QN}?8aiepPzHYEArT##yiKs%Lb9V!ubmczN)@KPxmqt=c?9g<{mydZs_~w} z%>soA&*caO5d573>}1LT<0T=+WpAnHH(2(ryY3A*Wvh=F;E9_L1eZvUxf24*$IT03 zi<+LtIZ2NuXnbEJPo^s|*E@`&61GP-Aje8R^VqKRK%QhCgZ@aO{85+haI4!F&R>1w zN~r2Bp3reAUYkw6VjY}&=d*dgEfXm2yB*W%B^`8#CS80iuxk}+_@l+U(xQa0?H#K}sOdG-ViW z1q_bTkGc@ig53j&O8&w{D40u&ACap)N9c5nSguJw0p&EIUe5N7$5fo}h%^@_^nFD`?hVb zqkMdz$B6Za7=CDbIr{z4znzjv7A~s;`E5qy?1Vn7UDv1l_bmS_p(;BbY4Pv1*r;IK z7Cv?$+;Yw9di}kb8F9aUn*LS*Fy;0RnC%*$xrm?2IHtO-zFtP(LLjomTXXhLuBJzF z6MIZlEiEt96o2k-=To?_YXX7%A;c3}X!<#!Pcuc2$erc@t4tbBT5RdffDr=1GPXnI z?UC~%QTv%yDwLEvN*A`6Ro@QWM_|x-lhfF}i}siyQ)$uWgvp|54Z35#$eMg`m~9CY z*~$hLUHAf3*9qNd^=k;-TQ<2j(T_KB}OB+iN396Z7#i3FLveXJP0{D=eT+|B| zzVQ%OjCmo^U0ss5jdqn7l~Y#T7r{whwE$YlgbDYV4|A8>vYhsWzp`T!${dTbvT80V zGO`GXkxgW=Cr=i;>GrMH1rAacDPgozWCgTd+yzh+%2SvAU^er;B55T}%OW`GNEY)B z3lho#?xR^q2u4SVd&KpiFCgs})DR38Esf{^hpY|ze@mm-mDsdupH(+0%t19_5VD zzQJs*AnqWUab78y2&$a0O21I>Uum*PBZ}}`R7RSki1CySL*fFK2*{vPv)P7>3_a3< zIk*r|vrJ5}c&M>^#(*>o5dg{hJFCv>F_f+~4C4eFtC`I9q%^Gm&qB~)lJ#1PPNsK| zPe!P@rk@<*c&wT{80iU0ba`InXtGqo%suQRkEI2^kN_J+b=S$@=DL$0-ndH(X)@$~ z4!Qz$sMVM8x?(XxB5a1L(R{orUjNf6KbsR_fwV|`>H1bL*fVlCjlZYFEZ7 zg7LG9skGGjth%%*=}8!*$^DOoC5!4rCRpyGvQ=r(OxHm+vro1fEVoSgsf% zAFOQb@5mda0}CTQY#-jyXHzSd!5k>wjCQ0rCWsN$Q98L1yf1$It}qf6BPs7UwIb+Kg2)$eu|7N7LDNF5#ZE2ZQt2d*mH9i>OY|TYv~{V zDVP5>+5iB||NCh3|Ii#xPsMCfi>ZE1QgDG;1hJ=quz9XCz-gA+);>9qSuKez{Os(D zAZ|o1L7YaQapC#0?($OM;ep_Jdxvbl8h)LJ<&j{Jg`*NcT=*avCbM9OCX)^>8uY*t zU|bZnYcHTNw#udE1zTOMc2wjY&DvJzmCjr=WnEt!8#R?bRM#(^R41&rB3*4CzGDIn zP!dteDdI^0Eo|i-b)f!Z`au_FBe1O4i6f5(^In@GXlk0VW?DpBq(3XY;OG}Kw;{Ob zxrHncR14#grj8CoDvBzZDd07k$HOse+k})~+ECt;SP#$oMpRQ5TcpZYD!Y<=G_)A& z`R7|)hE-mAgbkzkWsVnKy#*gydZpZBbaXSJbsP%J@|H;+|Zkr*1z+QjI>q_84bi*nH>)v;8Qwv1h%>p#%=j4q?6NFM33v6wU*o}$-gz4_;v=NtMR!g9=nR;S(YOoYAJ_h_FI0isi6j>qph4;y>`oKS4 zuz3}EP;%kW%|ew!3z5N8fG{Z8xip|?$VETZ&f}m0DF?gKXlPCCF!Kiqh-jrX@eShE zNHrbHaVug=QYJ1I?-YdLG)Vf`b9l&|U5Kw2yZ$w?Bx+hjCC3@Pw3Li$Et18%r%+2YlQBygL&S_CQ zcO-33YDvJe>aH|7>SKz1m58~~<|;;Ig-|=#RoUydxb8!Ztj-o|J1!(~{(e+ah|T5k zoKcZ|*u80h76M@7y*CCJ&wzRaL&Y%b5(TH$R&xp=cBAUscUE4_#<4n+qmjE?RO+^% z%H4qkRHNo|1c0*2CH1Vec;1XQ49@T&NKPwGk4?G+tWS4pk3$V8Hl-6vS1|>WsGGA+Gr%G~}1U>9JEswU|J1h_B?Pdwl7wkfF7YW}~5~QS=k>wQs7Sv$@sD z!VwlQFiwErv%3BQ@euH#SN+lsVHVAw^BRtkOJjbQ1EQ7bbxG8FJ(vAuhUS7cRCOeM_a6>(Hl2>o#~PWoLRH-Mw@<>j zaxK#kE>2ooU$Ex-YX?f673cGW?l%+9%@XF=P-J9ay65rDl|7Ogq=WnY=4F??U)GIK zYOJw$22_L)K8JLzG0zkuKcm^3IO0{y_s)i@2~u|Si@Cr)ttJN8uN2gC&A*z#W`|39Nn+5Y#E zAEP1je{LMT|M!hUGqPCERw2WZ<*enJdVRgXc0-LmDpqv;sop~ z6*VitnJ3So6Se8=q6Tm!kXpfYHqV9glUleAlPZ}HRKKFSf(*Ioveu_6)N%}9wGpOu zgPWxmp4#SQHpf_Dican{cz)xM3zAY@_8u7QU{%(W#gGJl5to&7%}PcmQ4k^bxZpY% z<9!KT6HnFCmIg)pp@sE{0;{%!CmvAEm;3>`Cq{TOTKm*lE$v1+(%YT>ZYZHCvVyqN zSEG85W`!TykVTDJsRD`xR3y7}TGvSvXBI8FGMFQ!!pvuC!K%Iuv?2!bSpM7^a3C*; znGkvE$rMA3dX!_ZGYg<>qHlpMt;?y^J(J$+)px|_Aoh~<2#at-h~NI`eM5T#w8hkH zq6mqdZ{Vk@1y4anCViLjx==1YUvJw&40HaXL*3oUoV$K|WeKuKZEVJ3dWpdTRWgBM zZvP&AQM;L6sX$jvHpjrgevIFGp6yrrh6%Hv}~YrsUA} zqQfSHcFv|v8`xx}#?a~g6*7%QxPH8oZ|u73dI0Bcdcjx1r&c5tuzhR8S0!vB0}+Ue zR&$jp7taS9n2;N(!je#?e4t|L6PyKvDE2s@meP~T-#s3roUk2cE7fFu8By$*(6>kx zGd~3B5Y{cn(D|~z-{r=<{t8i!*zDG1o{VWcMl07cQr!U)AXsmHdks1O=`4!*$fx=5 z@)pOKb8qd^&!I4ZR{M-_T};`U2wh)E@x@J*$w1|uQSP{0yHvhXM)an>14vsG$Zro% z=l)(T~>MĞLmplITwyc(>#15ii{>#=DmZu#d5-)pF~bk_Q<2eQE;`U z$(O?^GgJa9(c6?+YXat>=3}9%4ze`w;&!LDR_fRR6$+vu^iNJl<+F<`i({MAdHfgw z%`d+Le-riK;PZRH zEj*NU6s}o6I6fVrlU}Z)<9Kx?iD>31lHK$clGhy;3 zfh$a&XX`-Fh+yT|2q)5Nm7Yi_`#9a6z1W4+a_z}&wNua|S8&f=i`JRJ0urzuRlKj1hzHWR_Cq6G!S(Ykj%{0 z3Z~D{`D{$uNkLIC=|+r3z!lu7=x1rY(fT}u!N8z!axTuY!v^^GSFY+G5TrO`T&nam zQy*;K6FiCtIuFtFG0>SO-M^ULS`{B#LBbt~!0q6%kWzu~Avm`5Htp6i$ftTqs>da zoe}-k=_%8nVz=_{Qd5~kPu~b^c?Z+(gk8YYswJU`WtwQB z%Z8C*>T%nm?4sRT(&~I&EuKo$Rt;^ey^`8W537oNFmK~>G?7AGL*Zba8AOQ%Xx$&- zjwwv&H1{s*vGJ1=7= zDo26=`M$4_0^T^36o(YZP=L%X} zEvHi>u#HrktrzvgD4Gr}U#M5K{}#@eyL@MXqk4HJIy+Hnwhx&n4u$ch3WNISKZ@5` z8K+EOBLnsOq7g&GRzA070m%j?-x^HD*Iq76wj{fmiuYw8EopB^iVH-sqxo63QMHET z6jdhOjqx)CdPoIudba-xoI~)bRiV7O+@t}Pw(Gn(ap1vlysGc>@q}pFpl)WZt1mcZ zWq;7s_-@oEQD|B-S}ADesWmSga82L zk>`NS{5Hv`SER6}dTW1IbyVf%B6W!rr6ZKhRG}^g1Vlsg$)iK5q{wW2!j+oT_#qS= zWCZrF6=O^QA`~`U@cKlqDhl8WB7SJxGPWp&W=i ztAAq!v{Vm=1AC?*^AQ1qhc=!RoXDq%;ypw1uvR8a9JF5rbgtA?ck_7yEeh_LbsGwB^AX~^`Dhpc!dhp6dzV4>|q&ZWE zPDTAv!I>HR>?66)oF4r29`HMf-Q3qzziWjAn9zC5I7k74x7lmuSuyT652{L7B9{Lm~D?@`|EkgB)aJ$ zOWfu5JVq*dgC#Dv19DrG)5tG39rn`(>=}&Dv21c#h75iJ5X$E%>SiLoSgsj zmaF9djcR)>Z`KSg9uCWF71RQV!2-gJ7G&6=+S%RIW9YaNyW=qaMR&u6C6i0Yvr~EB zT5#gbM(x6lsISuYzP~}o{Rm_WczjEv(@sS*y`6trrCg*WhDH?XGr%R?B@Qwf2QQppmvy`0DdpJD3H|WnUze?M^dfP z=pV^S<8y$`6w%CprGXs1p361_(xO<2%Z1Gp8h$q`DvlyIFHwRC3kxwu$gkoCFy;d z5sWUa@to`DRy8@XU}BjtD3-^ufid&{+=akZv*^f#QuS#Z=mIW^Mr6p)fAU$;8499n ziow;qCx9L1$*gg3Ji zL6z663d!`itM)2f)a7-zdHc_bXp(?rkNrkh=y*(D&6Z-zj4)0~Gx0rh3??rl#_!?` zI+H};F?dd2-z2#5o=s5{UD%(3`+#<H0eK&%|4Wn!ip?z|e zW5{xs&Bq{Eu_%%z8VK=l*daM_Md_ctr~sO#ki~(+z?8k)45|WNdQHKQ;*RNW1lQDR zDnK|CPyp2+7A`8lP$cHhL$tU}VHz(*3KdbUKriBB zN~GM?n!de84RxfXHL?91=vP=lFn$t{x4wC4dfKtnP^6yx31Of_$;gd{%LIbJ$Q}(~#Ji*A9aF&Hs=kBdSnJK)?vK|@aWf~P1Cc?8oCK-7U0oIR<`~kkS)A`# zFCtv;0je>N&^_AnSUy$qc=+ig^ii(Ek#Yzkb3@94^Z*c? z59*W@7TL6iXF?@n+YBZ}t*Bh~;Y&APU0nwTM@1osVi&BCgQz8cVp0SoDzK-HJz!@~ zwPUN?4vv{kaDhmaPpl+2-EE4ga`-)hq&vsfsSLUT!GB1j<*$2wAfQg9rh_oO^yA#O zYzM$49yugP-J}E=rGRv-KP%&8Q3tqqpD+PLukiWh21l=x%M)e>(jSosX>=L1;4M?H ziwMkzNRx7BsU>259=z<>o$NG$YS|5bL2a%=rE0?NB)Sq#b1_SPR0vLl-_cw#)ewtP z#HLVB#NcIN?~9Lnk(w=0G}e1_eJy4300^8KCxI!Fg*Wu-o`zQz-$g zrJVY$ssi7@J)xM$!BLE&OARxiK!GrkDuAT_bqEjsR1x{*VBMJXhhix$&Om*0=&X8i z)=gD+DKt$g-`cHLn<<__iHX_5$GMJNhpSUq_q}EFWg+A@LKu0|zRUpGN*%PSKrb~2 z$cFdu2rMV!*=*g3+~aM*@fRLl}rHRVtfq2&<68H;IM%G)0WS%Qoa~=ja)-+_V`J?HzDz19v zt%o5##Iuf>drg!9gg_}LK|I3U%XL$BX6i>S||>Kijp2`M!{fdDtlQWQj$2U`3QtC6f3R4|9aU?|!`feK}v6`QW%&d^0PIr$dJ>KX`c;ri1nQO_7X+eV#8-r@Of@e|`2NJQda{ zptT6VPuVPdol*Ne+o)pOD$MeWjI3h?BHfgj^eWrM1VVlS4v)_m0+TLnq};T{NPG~c zLL36Z%GB{O^{=aomlYsJyK4y^p73)1G7#Z?&$+GBDVrss1QP)agUE?GUTi>f)POF^ zLte*BOn~!_b7wlex}fL7Sh1$@rKD;~ukI{?obKd&5EzyX1q1epgzc{mJg)?IDzJbj%gZEj+F&#J$MJ$5gTHACzD}9ML9>b< zm!>dyZ!~Q%EDUX40)C8?AJ$fA9HseQ6m#SY749q*!=PbQ@WfHz zOjylcwuHc0?^Z9H>BHK}cBG$Be6l|v5X|HGx5@6PC0k zKga$}SUzqJrZRcAj|uK-pb@$*U`IUfM!HA`&g-aJq#mb%f>K@nE_R%}q|H`Vpfnt? zd?Mm6{`PVwb7r7rDr6IjvAE6J6TI)e-pjf%3;s=f=>>${s?~}8m9~EH}&_QOA9PP74`JF{~R^-)t?1gSo!C4yxG)Poi z`7}YT-0D_map^;vc{*?qLBjZB_wz{bAc8V7fF2A$Oe8ew%YGK1GE>YjAs#uL_WrzJ zieA5uQCy0Q*19_=Oi#FP@p8se79~!k*O9V=nKt?j82#YapB*1< za&i^02VD?9^K5l7#5~>uPdIS&g#mJR3kd|58E6PRKG0i`>9Ab}3@>t)UM1guLo4jV zrw3cFAiJm))nBmpTH^uwsxBD!{6npB%Oa&Xlfy+fQ`{)7Ha64>+X`m?-`?~ z%K{Abj7&>Qx#63fMInl{LD^6OpvC?R`9Q@tD^(%KY){Dg^Kte75ja3gKB$i zYU-?Sfoq??|AY-Wi3HL4=UI<4uEDa&=RIR?t&97W_(^Xo67K1xU{0A-&WQ2l4fwGP z2s9t;(||7{pQtmC^XLlAo%w(?{c>+tH&jOw4OWZn0ix<=qzId!GpC_F4x>}kj@GP7 z2!MPLEpb***@I{&JaC~9|B*LEStNPSb5k2Yd2B~Qa(Fwf_|~4+?DD(434i+HFn9M% zo%>w$bN_+9sdo^F-RXv2E+`R#audi!ab)Olmu~dZ`yHNGC+R1Cb6(;Z_v?YA557ULE21W#sP1!RhHu`jrUfH9uXNV*hW|^Z5{E?>aCxAQ;xM*W*@}eyi0;tv}m7 zbLMGf?!--Mge!_dBD_qS_IGb7~>%L!$2AM8TFhej+>`iyf5 z7ZzX7mI2Y%yXCVT>m74$t?&R{pW0{oB&ibcYFLpG6p$#}!P6fw3; zB%yvdm;^sQvdVdJcV|Q_iA8LxVuRAZA0%q~%N0}OzyN!1Zw1=*%I$>GoDmgcSQ2R< z@S*DeV(cA)Md_lg%VXQNZQC~Pv2EM7ZQHhO+qQ8J>%PAts;cot#mioHvO8DqJ=Yli zqJU*U2@H_4Py2?i-L-sDD`+c^3)u(utE;Ww4X(g_#~wyr7Aae^S!kUVj(YUTl`BP4 zPitoM9_vTJL7b8Z1qCM0HXF5YQ=v4zi_)!aIj&9s(P&E<70ctn$u4B*Hi3Cs(v zMNtR?$rxNBhJfT^Fk`8gIYp74U83QPh|l4>O4DL8DFk3L4J8X@Em|YINJxbU&^rvX z+ol}D#6-jWEKsLF26mpTL;~T7@t`n}^d?r-07wQ{)0~k>xE&uf0+PvK`m~p5{J;Z) zmccQcu1tgA#MP)AgXMJs>8HSAc8qvwoM1KwzY5w+9H1lGOF7*f{D18WX~Te#5JnL~ zkHUalWhLTkt}^W1DXMZamorF?9|_p|JQSey$laTg)QS0PAc7NuWFe%>=SM2+*@0pFtQ$SG+3c6C(mGl)4*=tfM4$)zk|_*MBmikiy-babrBjYDJgxFop%* zF0H=-yGwa5>?|A}aXk7G z-wQ_*ki`JdO64oK&k26$K>$g% zthMfYMub4cJ@o(A9bxeRfB2tIw+CHA?Gf55c?u9%yAG>3*24}CPzud{vbpnQN^;Bt z#-Ab3`yBJK&zZ<=J7pOCYKIbL8RsueQ3&iaMP^J)OXGr}+h%D80-2NUOb*JHy*B-R zu>-GFNUb%dOx`H1ZhS5+O#0IsooA;}y^ZSGWv;FOZ%btLrq#MDtlZRhHd^2)Dz-RU zxDSf!dedYUx<>69#$sQb?~YfmFk_WsxnO*yk?<%?<^TTOs!G})r194l#c81h#T2j) z1Pkf~{e)o9!4X1R^#_H}*U<&2b~l1YK{L37V(ENKQ&cw0wv>Y)8q83U)Tvn@*@{|A zljpLzjpw1g!mh|Yu%oe2rdhk-^W+F9S-kWx>)LGYB#qOvLVU|H^?JBnMB>ZYLW?hL zQ}k7ugW zD_6S%o%Jmpq1pagvz5nqm7=_*Drr}hibf2fZa29gQnEv)-QMkK>hdzPz02j=XOlX_ z_3_4wVS}4RxrO2y-Y_qkinPyqaVTW?F%h$kY+UBG^wx;euJTlzblF79z@@0Q&QjCb zs;Ik$Qhr_no*|nuK5{pHDYewudn{>^S6Z>HX{`CGmz3VJxe`2o;4>E@A#Sp4(oHWP zs6VJ4leuXYtj~?wfLC{I)G4XSkyBk57gHC_U=TzYeH0SZZb-C>0+7Veqtu>e|#o+_a zaIAT!$ZcV7$+;qD(rUE54rU~W5u}qkvq(wZ8b#?h7%$;a9|{e4_T($QziN!<1PFjM zZK9G*?}b$;L9OF|j_s7SSz30Q7pWj+C{AXQ{VBr-fG>cFU+kAL4}%eqbIF^t6-c0N zGgz`-UA&g-+Bx9;)2X~|x{=_NrO#IX-B^vjE5beEM4b0eqoaR9P}OAl@BUe5pts!i zSEqflm$!yfT|NJMiOyg> zRxvy#*e$~cPdZmlG^uQR^KYMx@`WE|N$lk5bQzh&v(Y`?Y!YGmE4}w_&ZlUQn&w80 z$JZPwqkDfpuD0{q`VEA`O*al}xFQPZQnxmTGZFZ?f|Ete290mmg5SSQa)JQxF@6g7vakP&cNUKSSmfsTSAF_F&;Q`et({FA3FyVF4V+Cx zOpNS|O`!Prpq!i?O$==C6$M3QOMvPNbeYc1#lgQret zTO9d4tFzmbNTV#@$du9BG}N$I3lY*QLY*ViDwPI9DdrJCWlT1T5|AS2S0sJZc0m{y zriP6C8fUPpuKbg5W6k~J?$p_xO`Es%A}#@Hewro)~(b&geV6eY`OWW#ht z{+#O6$*)+;ctBdA(yxWZhL4C?fac!AY_*8)rijb4bu_58iJvVBlw;J2)&+iRuy_&@ z#wiGDwqx_w6#TZB-E5iKZRVz41+hA%juG%$Aj&w}MW_Y^*B zY&ic@Ponreu%`ns-)c<5cT58d4r)sp*Nr5}w3*TXBllM}?{t^}b4m~@Z9){`;bbaG zz~9Nv17naXTG5w>ST~d=YFHw|el#CONyImdS1zl}4QiG{UC#!2Sn{=6a7h7`MoH2y z)x&DgAvDBc7%4$0l9CM6=BtIF#`Z}k!3tlkuLHu%6EJLkIz66`MIFP32pdSLSb7VD zpu|}aC|iqi2#u(u;(WtjODM_h6^R3JzF3>@TE^;}C4}SpO0%eIa(U+&(a!57&7ob?4w8 zbQ^ig*`h#V;#9%sE`m$w+4Z15EI*v;y8T|HHVz6tPd~)RqUjJF-JL`q<9idsd$$YQ zI|dLhWHVB=a0JSN=5S2ZMOSwSZ$=wD>96EJP5f1g^#Ix!Aa>I}1zm*?i&`O+EizA>S59huNMotEkhYjUrP5)WdeuC7$~jYZpB6q z7t0#pytm9B95`>7b(6MhIIS2zR1X&5QC{|bOK5&w#sNrnE-m2k8%S%e@nX-d_YS=a z0QIJl<+=226Ohj@zIH67z>z%5f92M+ng)jDMkE^u?M!W9iv5`qO_!#5w+@W|mGs-! z#Q{pyG&aaOKi+tJQ>3;6ouAL z1_eeDAc(v{evjLoJGg=5q7}|6LNQgG__SdOKUKKnvm*+Y;d^5OW=oSaRf+I>C0?q5Nl7v{x8l?U+Qtj?3iPz@Y_d&DnGBkK@7 zn@}{U@Ff3qUH~8K-&oxaz^Y~}D92s$cj7S^@6lpf9aQe*mKGZN2epWtPMmYgiBI0(XmClZET z#n`fou-QmIfy)NO7B@86YvsrRKoagRL;{Itk0NvWO82*4kuKZ^lfX1`s!jktVh^6w zP*T6;lA5nCSm-p4Av*t6UEH>qupmgs16OP825Uo&Sz|PH_{9T_k#al-X73$wu|ci< zvU*JYtcm-xmh)OH8}LLVlj6Q1Bdzt$X06-|2OGys0fM|?9@%K)d!ifPQwf!&*8u@d z7x?D|(Umn!sljl=qBkRlh6KES7DX0q+YQQ&&#kmIzlRq##ujj8wVCyqKioynm(=VO z;V$$la#JlmAv&vRDMS5keGiCVg9n~pjtB534H%OCMi?0$>(@YEtAei&<@;9-vv;*Tj(A`wiVR&WK$e1Iv4KyQV1U(9k{Ee8Aiu*np^v(}Pe zS{;GyDCPJMS=l%Usyz<{Lgp z;gX%EJimL)Dc9pld8}yB#NUfCl!TDzu!(cz1RPgV8T&5~AcToTkTEc{N9RWavRvQv z36X9L8&8z#e3&R?fPRJm?r%K8GTG^@m8f4p7>$&$|B7wa|A=iS24>FxZEUyvpV}mDttFRiz5EQM$PZV# zyw%!--RLtyL>NL&h}25ZKwBr0=-rJPF%qy}eBADbRRr-4qBtw{(rLF@eXovm{Op@= ztB)`t2Ewbe&$vu$kq@l%{b-)-}OK3L4z$tL-Qh7Q<+`GzHfEri&=Pa5Vj`0ct*;Ln~~ zad;v+!}n|k) zhUR5+Jwm_=9t}wA+?BgE*M#Uh*@*i@vhqg$Q})JiZLOUT;zF1aEc-dZ*Mh>+8%WO= zAc1{v@4urUb0~ex#cHuiETkR!Y7IZ6#HnQM3)|oW zi*?i;hf^;tBu)DV zijzj_$yZU^WKnT@Fi6PXiHQ-AYDXTQdp+h z*8i!Igki6f6hRJz*-X+`3jx)-l$lfEeODE?VRRcEGt5^di@FeH7Hl~nBV*G(B8G4gFrz+p3YXRMeY zIYaRbZsutND?)Z;Pj=+lXwjGpNRK*sz%n|4rb7oq;*f(L1x{UL13KG)d>Ma8^-HSo z&GpX1y9ke(MIeWUHP++$3rB45#CmNoVTBZDiO%#| z`1qCg7Vt1FgUo}_bEwjhVIRW8e5lw6rvTs7)5_1;Hu!t+n2`Cc5;~=t6!8jyhVejZ zH;7Wq({6FG6W^7A?uMG2SsNZ{c>D0YphrLhuo{pNKvlCb7HOBUmyG`Js@u}RLmc-}C!mJIhnorWtjwJ6W8i$HABnJ8D-9#(4Yu;Qx)joq>3~TPl;B_g!6tA(0H7r#pUxuWHYwPRTNRtVV z*90Z=gIm>_3=dKulI;{~aMjS0MPR{&;Ltf7lj_!ci8F!mY~lmc--s#e1>Pq8R;M4m zMfp(`E^4IuMsW?AW0S73MutfVR!yjQq9@L6ICHiLdUQfN`?nu}TE>@mY4M=JEf5TF zKjzbG$}Myr(H)WMV2d1{xIavidX8`=)6(Ijxqg9B6Ju*Lv~gx)#wDv|zx*m*?%BI?KZk zxFFlsbYynkY?NukA@VDfUJ_FqONc(eyt5uSpaCI4guX=qD_r*YY+$3Y{}g>NbeQ>Irl^9C07` z2@ejp@D|e=6rwKZ;qK(olw9v>89*Y1^|p3otzub>Z=*&D)yHzx=>L_c>T!(uI z`^%fv<{}9^+FyHqZ05DQMTKf$`WMDHJ^d1rngdaqtPo~5-{IGAx+kCIMIs!)L_Z<- z?mHoV;^hQ2n(VFd0$*6;_zK3R7oLhCF(TZ7;L(;e=5WJh#>QIn%j{ z$>iUXJQs+Yu(DJtZ+y-yJ}m~>^xOdV0QlKadpk=s^YFh7yc4?<#AssmlZVm|{MEN! z10k!Y4h>*z%XL36oN`R?aUo^UEz%eELzfx;)j{zFvMcuIRBHIM3`uE5!oS_~7yo9+ z!v8-831*i6uciF|S7^rk{|e1G+5gul&>2lFJM1+3r-7niA3LH1l&@N50t{V+odyeF+xsiC1bm^e-`& zX-koQ@T2ezQCpCIxD@y83_zBMyjNuY8Xt+D^ylYOg-t=4zQL)$*Bp4crnzmKLh1Zlckc7 z>-ZVbID(>D9rZ>Q-k@FTisKX@lOj<2jwr&K^}3duRDb9*>?!|{Ces`|y7Gog6LRF@NS-Ql_ zluqxn{CnM?q^vGb=wo6Fsk>I`pwtm4AuHgD`IC(Dx?+sg&r{aX`ck-rg`J`utQf+);B%*T|8b?jh)IR8xWP_!LjN>GGV5hOAU9BGZAZWl@PUt^nY`chJX)_CvBQRk6 zSr1{(rpjGI+LPO27b>0Z*N*oQ|CeGP$jeNIQZ9s^Uxv_6a2jy2&y1 zYNe(uA~|8x#$Z1&gY^zh#+pN@D`gRWfK-CAgo&a}m8AlrZJ}5eo{hDNgb*$`wUP9% zO_jH872HJBsnc3rslOAu zN3VB_bNvoG`qRpE-=AKuH{Z_pxu*?O-`*pE=b8&U5*1h&ri!_7WKax5mhtRdX%7OK zlx~7;E*TJpQ&0HF2#QanMKc8~{T@#ks*adSP;(xHk+#4l^td)+7X=9F zOSmL;E?xN)dD^uxTTt*mT&;??t;w6)wo%zSEoE_M8+%$K*FKsR@#mj&lJ1A%4xmGTe`z<+dS>FLVW z?Cesb&Yr6JY+;h3eaR4N__i$YEOzMV?5&Rx;=oP*fwKgT*35taQ1kBJ7sqi*RhdJ3D`dgJ1UQd)sGZ>?fs&AX5-53JOMh(qZ~gXz72=n&)OI0?Li+RX)L z^mu)NzW`&G0uYot`E59153JJC3)O6ao({jzlFb#>_W`~+ONei`zU0 z3ECXt;3qh}%Z4ev3cS-5;|rZqhN5N4uexGwc*WkGq7RWa6Fn~#+tZFeF5pQ?#}KEg zuE*WIg+`B%n>KXfCUc#vUN?bpKX7JV-+{r8cHmrsBA!kLnIET8g(ncg5({QlaK$RG zmAAESK1#7qA=-9nU$H!W6QCHgvAxa?ZqX;omG{O z(n}C`6k5m`vkAs?+r1m6BWU6W(V^zJ6qRU+cT>{*yUTHrpaPvU@WG%K)nZ@ovkTyW zQjc%Sqiz?#W8t-LDe{e4+OFYp_G!%T>f(TQPEr0W7y}y#4%x*G`&YBxg}MIt_I6&o zFs!c1Y*{eGo*PPNLgc}62tguyIs1{EON^6aGzNv0LZ7@dbk`lZymp5!*8`ft|7ln> z0t|zTAK#txF+Gme+_IZdAm9&t#q6l=ug7+u_P`}B8n6mcfAVMAHEI<15rsP#iayQK zKL4pR|1P@tIlXnlw|72?<)(7uDR3O)FkK5}t|2cM1NKs*raNppb^T0!Yqmj8TY|4| zE4wMBg==t~2F_~bjt&&D_?5q4FcMgRb4*Wg_=qTg(?@v_Tm%pkYMlmV69!#i7hn=q z@xUC!fSS#6K4jJZ%?#Bs=)B9B>8n187y6G`f#qMhkb%I?(2{_M=l_`nm>4*j{neU5IM8|&Y*iV$GJbxLEnz{>FHJbN*z*|h+&}W+!Y2l(Zm*sV38ftbnc3= zNBuMCNN0qP*lW!jyH!(V-b9t2KNfU5QM+`}R@&*;jueiww~6eW3d=PKYq1Sg!LR*l zeixsOMXE3tp+fvqri70q(U@qL5({5&M5o&gW=Nfk69IXV$T%=Ed1J>5GqKk6!CJ>R z(9Dn#dUmSpzMb?^w%$gC%DP;K6+&kNs>g`(*gk#^7i8=!5r|JKwT~(JH;*cZuQvI> z9Pz}M$}r_8MOTRM6eXUaFn#->zWY@mK}snS)EW~-MLhN5^uI=qMg0`iMio%AKYLhD z>TIn%JDhL2^wL#1y1$cwK#~5LG%$lKiq$KwdnWyGl)39T98Sw%PLZYf5a&brL>r!~ z@(*q>(3I=GBaO=mJ&u-apiwp>o9~4@M853p@@$b|xlPdyU8V&*;X&?Iy0wd{g}|X* z`nyVWt}0dHBtTsLC@8_XDk|?>g(O`XAISn$AyE`>8Bwz3uyyhVo8YRW)kPa& zpXH`CrfMzK46yLz;?*1(#vPvz3CRW4STa3bNO$S7@X~e?FknX(V1?4W*w$4*`H|cE zSbGi4y%yD4ffp_{xNnW&$IX^ii0#-Octpr~{ruC~j0sXoF}#>GTd^P&+AwTF6g~K! zv9!NDoRc|@=MOyXV0J1HFkSw~VjG`VQE<1DzOrl3=Pbu44>#(!9h(Ro_N5{48sZWF z&(MP4>m-G{`Wn#w>d4=;Ug5!5TI|mDb8v^~&Jlnzy(DHgG47P@i?G)b+9sd$Pt!)r!77^EJ2(ky8xOR{YY_@Ug5FFO(3t&l;!uLYY4>C!!aG=UHrm5hS-$G+%xO3>7wSz;T=YOK|!z zUboK>=K5gTsm4>ut_NNxt29zwaDq0d@=bN{M(W?6BT3OSi=-fs)2dVk`DHoYo;>Iss4YglygP1?(UsAPGxA0k~}0kmt-u zqvVz{!<0+v=wd#VbG{k_ z?d`pfiM+~=6mDUumOw#^{tY+@KZ#`M;E&_iA9yrd(<)nz0R)apuEdxy-b7|j z^O$9Lhj(;;HFi`=)fO@nyG|s~B*=>F+cA3IL<_V_y^NzT=OuVKuS<$Wl|xXDS$Eld z;Z8TF@q}hMg~~i3eef$&R(RI9F6Q7#hC9~81LDIALKx%=5S!PY|6*GYh3@$9q=6XS z>?(f5ZJs844~$c#T;hj1?)xJ=)JOXTluOvJaE_r+9?r<6H5TsCy56F?va6*(iU7Sm z1YAq-YCnDV*f_bC@(F0=c8oKMd!EYiwcgWA&KhO&P#=5@7 z?qSb;;bf+@rolc+l!9e*7GH4*6ddI6YYh=)9DPjp-;QV=YjW> z>kj%(j*Ic8A*RAfUcn4_zkQtD?t1il=4Z8RCsCa)K73e)B0;lXuI#I10>7yD0T4XN!kRjpQWeLI`hrSSQfPk{;c?oY{m%FKj@k8hF?5`%oaMK#AU5* z{NyJv)n*?6kwG5&e@-9&Mc`ulhq3%$HWg~rZT?3}@{_A~V5b}!PWmEdaRX*8pl)r! ztq)rdZ-Fq+WP_YQDNk>)Xz=-e!-dU#07C%~^=`+Hc-`i5{u(yzN2!}_`}uWpdA&MO zp(mb5X42NKMnyLTPKjbkk|i2Cv}kIB`{nIve?vVMAjphoqjiaGxazQT_i({8aZK(Vu%Udc}&v6#{5R!?G9GH(?5|_x|LO?SaVsmmX{jNM+Q)barz`!Dn|?l;X9+`H7`@Sfn`34`tx#M)cu}gG_>A0&uPsOcG+8&<^dkF>FZj7_sWJ_*ayG}if`%;FTHie5TGK9 z%9bQFk{Mx;(xy9H0wJkD?%uo<%L|i411}x1L!!7kb1iwp`q_wO^R(jHB-&d@pLYam zS-Woi8Ao!?+N?JJOkapkwg_}|HuDDJTvsPC*3)=HtsL{HUw*dXr;u>%dmnJt!dkJX z-b6%q*7O2IrUWv>xxVtUu_%_Xv~n)WbhMIsLs`EUj2x;hz4MwanyvD9`M`Uww4Bux zsa@=PVmOtYAMD5sovbxiSSh)bvB_9M1CU63Ctd_5Akeh8H+_*P3fj}pL=Q&}pcdap zTNLwd-DSDGb>C&xcrafNEav&-l452)heC|@JzUSdkVf8NJ!tJz$&w&pP05|Ptu zE_x1bAKq7%R?e6`N8=%OlFJ>K@zQa1VSZ9TG-^oIdsZ5FCmfz6#0_l@P7^kC7B-|) z^$_=9D^4t&JMYQujqf{Vf!1u=QvU!{h*`?Fi`kiv7lH;eKa=AOAo=swI$T{yJC?FJ z)w9$LtS*=a5;#!*I_j9bS#Sqde<2a2Cs_?lv1fufl5(HL|&>ol&v-fYP%}5!Iw%63>-Uw!f z5g%gdN`G(;#>^29BG*d_M}gMIk8LO1Bdu+3O8-p6ooUx>q#0zpC16?iFNmVa2;XPN z@7NW3t|dpihe2MV7%?;Kj)3{NniNEVmZT45)w6bJUtp~_7tT%!Cwbp^;DNxFX4Ah6 z2b$ebuY4XjqeK`1TX%4P;;!XbH(Lx}Chab{O{<+1stJ>;XcY(_%^{!oTZg)P#UrRh zo;GfdLfu|xzJSb#2{YBp-Ct8;spD$sWngB{8&N?&q&mHy*}yY%W=~4RF`AmytLR$Q zDd*wpz(Fuo4u0;C%8~&V`f1a@cvvj+!)T8pB*$?=4#_PlClp|z37fCET z1X)Ky-t9;sdI0AEnuiu)aX)T!kAS{!J`9SotX)qcD_?mcfY68mA&SH)VNTOlDfq|1 zVvwdWouX1_XRDT!bQ;1P_H~gu2DSv(meDme(EGPt9e6egf2`F zXr%2Wso|lvljF$DQ|>MWzsgqY4cofdX|1O#55z-=AJXyq&7!v=f27FM&l@F4%ZLnA)V*rF*z=gvM`s6 zfU7OQ`xnBDwmhH?5wu)qdLgm(mJkal3p|g~h{TBbsj4PFz%cJ&y8jBf|D-Z={O{ZL zIT%y1TmJ)xxnBS@6t$ZeE47KVNqBB-BcW*j7jM)Nfg&DmPcJ#>q#IQrqV%iw>?SD_d$7ps%4B}4>Iy(4m6TOp0L=j3pXTA-dOt4J^ak{@_qjcn~ruQA9~HMr78*Ngx7D$si}RGzHpcrEwXQWtP-<_73pIoNly z-$2#@dMwIfq9`Wha~znWj|pNnF}%sY-q7uyZPm8Hx7dPdqi%`uT8?6$y|oBiAlQyx zPM^svZ5S{JOmNRSE%8b$-5+wSvf}5BkgqnqJHrfvJ1F*3z!mz8BB?zYxjJOpVtdWM z+{2-1G`N&A4zE^v8bhd}mTj~u_gJzhFm2*EUkTJ0RO89moKyO%-2}wRXFoSxxe!Nz z$>{HkiK0kfD5b{2AeYL-0-OVvw0zs!82ysowYQ2P4kJ2!T5s*_Pz$QtVB7>zpb-x5 zmM2~KFL|(0yoh;2Qca#weK(KcbGa?-%MA5`dfO47fpoPe-%=L z+o57cg+xoj_~M}vP*1E!Q{Mr|qTRc4Dp|P@$Ytpyq73lS)$s;oSJAXV@q=;$8RbTE zGY`vGsmz#JK9yTJwY~zJuK%-PeuoPRk#7x9+VedZ`#8VcE^?#c2-Cg<9fcH`2iPp( zJvZU;l%<^Qy-$2RB@xg%{dzl&kjM_F0i@rO(d@?bJG0ZjSD^+UTTvFWKo0(m9KhS* z-|K7MQwyFLBaZ*@)Sjh!6*42_3%SM!^H8`>veI$Jz_X_*gaE`0^2yZA z%49asmCz;@NdVhR5fEePJnqlure4;_jUsz81S4Y~9Z4n%u2-TRff$6(?Pufmol436 zp+wNWzh$9ot-K^eCDL}>JZGRhoF!l3--NzXF$0YS@BLE@dTb|#r+U&4yHsr~m@wY@ z0)0n^glUUGD5TYh`SeV6eMlfLWjEHRMxz5_z%p_Yi#n!=eiy_uRhwrn!I{XbP%(84 zs6=ieu`5&{EY&8%ppK%QP&C-qP!kZ%m{V)*weSr&1z=7(MVvPiT&pBhPT#3h1ut$g zj~o?FA4;DA*Slr`$Cyqo5l=Ks6Ic#NQW4@GEiC^?8M59CuB_O7@Ib!eLc?Q=dt&NH zuP=pTEKgxMW%ABOe7+i6#*7Y2wLL}Us36BEV!c0g37!vRl4Q4UIDd{ShyNqq@Yh*u z%U9Q!f@BH76EVKgOhG0(N`fWy++<>uHO)G7roW6+0ulH+`ivb_URU{IaLLSxOPPm& zJ=v@66zUn{zOY-O)vrw?)4Btma3C(agYFW#g5-s0UWin8g2mm{(UqwFtE71P^PH%Q zHL7S&0rlTLG>TQCI&$!36CN*T;C;!gVQkq;XwX_QGf4L=LMS;l`K3pSlW4c79c0hB zs#9wj1@;$Q5f!VspaVL}VoJA1kgM=bx%F}Lf>j|In1KctUD3qbp?7-sd?7A9OwbNQ9=x*s~$sJp|q#6g4!-91}H7(RAtH(>%* z;NDM2fLIFKUc`V1wzRDZVPC$Ah6#T6=N+(Z#g@c@lQV}6E z(4)2at~7M*sKk4I$jNydmb4StwFQgi4oavg}VkH#mQv;E{smZ&ZYRe2tl0z?~~t+IbMG!appU6-N~+LLmvrYT?W!uz z7oBIZfhbaRtt~;~F!@PB0Tnq{Y;EfN=-M-$sCH|uMPj~?AOa!Wn0?)PQs&as_B(xh4xD&gAmZYMrLJ9t!un%_`^_I0b< znL2WVP3zRQ;k#CEw0FCFE_UgLVd1k9~Gc%Pf zGd;G;GGXVMUBk!z&OiqwB85nI@i)|2(s0nc4%)Sr0=*_{DH5qK6S~xt-;Ky+G8CYO-jMpjz6R?G`3+ z!?I)J-IZZOXd+3DiHj|kr&{vVSCs?f7Iq>#sYB)~wl{tGfoxC zTT(*5BTs3%3B#J!H0jE9jEBUV!q3C1OK5Q6y+etxl8-y9y5VaC*`iB+Nhjp7079@a zRcPS6ZcYIrh&r;%C?MY3?IT$}ZOn$o9;;T>H^4h(nenUE?sX)a8=2Kw4xzzU_iJdg z8tr6?7xRKeXnT9pkDxPDRpTswa8{oHiDSwil7S)cL91Z!f>3@LW>wognES)4j3+|>e#U*hj9Bz>y)(_UZX!jGHuI1YRCeA(S5K=d z=^nv)2*XOGMrdwozUXi&8`}&Q=o1x0bhi(R19jOV!9F@<0L(XU*#T-SwJ=O<#2-*A zKkH15bevMsJYXZR-!ePIfz{WYgSdU*2xUpytlR>9p+!*RTF3~^u|nVw)Opc30i=W` zLWItAFkV@2jF#NvSNP}l-QkE6GWEM1V6p}M=nSdGLB7U3lQ<+jg~J{KAw3C8_QICn z$-l#`8w9GkaO&x9b2rwT(D?#oEUTlke6&~M&iQgz(^gxz*o zAHDA(>{PG8*ZA7oiE?K22b4@9Lbf?D1{TBrRZl{2AMD&SUwz`-nF*`4Ghoq8y<)Ou63b>-zAsu! z6Li}bS30fn2I~%vE+L9zP@gQucSw4xXJkncj3cN3tywxE;2J@B0l}mprxrG!Gy=u( zz!Hf!69B;$21x>xY`{*85&Z_cObqroYA1>ySIQg4%N$KDlFtXvkjw*xiI6Fd6F^@D z$aH)V0UZW8D?Sy5r7~xi}`VJN!mflD&%daU!8a; z2tvDjul_VO0Ozd%wl$ZnM>G^F69YW~_ySYpAD(8GiGX<5rqUZu7V{!D3b=G<7&of( zM|Z%=4^n9?vI`bcB$90yYnn(9$B2h9MFE7FoY?i+XEd(iW_NI_mQ}LND+|QrtnQQu+)?=n9K1Ta>XXnF+C@}=sz)B^*AwK;JG#|eH6UBq< z@}5A|1G#!|$i2r~^uCAuyDi(v#nHN)SyGO60={OY7* z7B<>q(|!2YEGtB*P_mIS5{gkoiPm(6P7h@?c>Sr63b)IiY+#M4NwxIila%{UR6*N$ zXp1k>QLt#sow=M*?Q*X}@Th~e^Rh1Lluy1?eRPc`J*HWX@%9t-Y^=-Y zvoTmh{Qbnl^l%4qB3vB2l6eL_)A&Vct5!rRpkNjEhc&Go){Jjk)#Yu;8i-Amn!(z52R3L7XDSM9?(&sk7hQemoB|dJsluR?uHvOi{ zYNxNrrcOh1i|wz|;Vhqa8uiD#y@OeAXSTryRG)TuK@A&(A@=-*bx`AYi?*r6r?PPJ zcTQHpQqEjvsxTr!x+3SC`KzN%2u2-;2wV8~?+u-LSu#>&{9q z?B9erv)Hhh|W^f$~e&ER=smX0YH-ics8H<+>5lH9eaAxc;Sp38oeNJt%(8>Y;*(< zsldDxUN9|a2T+z=aD1I-^dvB;Wow(-CI2<}DDF{2-^BLxwOe+#gFx85mIacM3xh!{ zm^)O769169CKNZEzaaL4FbyW)Jy}}DsYkY~VEE7_&>CIf+nWdU+9k$s{d?Gj5%pnn|RTL!T-sq5$U7Oa!eT?tpfr}8o~Li)o-uTO~j-?fjnkeVtV9he`w7e~ zwa!dN#rwObcrmnfQZLWo)b;7!V7`6ttb!PxB8F35xuaU#U;0mT|l;U z0in1XH>*QV45YULkaw-R$$B2+%CR<8;+k43&)G21=RN&fUB#{lAJ;qxPl1R-X07m`Xza-CO zYGD*HtvJ`{vG=oxY2rBkJ_tgCn7Lm{>`dq}G=#0lqvGHj)(Rh@EEk>CvA6h!fTB&q zI~JtIgi)-ud{JUB@kLa`!47p=-i-LDLcNv_Odlk%otOIT^l27qN3G*hAvLWD5s5#; zaTTIP8_DfjQ{H)is@pnLLZ0|mm>}b#w*9J}%c-Z;8kLR@2`03UI;D$jkg(B-m(7BL zsQgfMLZ+1#_7#yzK8z=q)zw*2bgyKkLsY7nEC^cx*G~)t&WBsmtEx<+05MJ)`d1-7G?kQeD)W;ih_4fzKrkGDEqVaatP0$C6aooOsb(!c!9vLmVTH zKHI?0YHON&pNF_7YVzDN;%O+@KjR)TFlC(Os<@ErE2(1lBuLU#d8-nOK0a;k#@q#T zNIKOJe>ca9d*F|bh+($J)P>4{Jv*R4&d!Yo(-?DSm?o19EAmOBaggc3)x*1NA3UlGrfeb-Mha~%n#Wb$P;R#K#g#s6^2?@d_KL# zJn)3k_8misbANK?zg05)sQnv9xCqeK>_`Yyj2XGndUeSHC*cDaARH3daTo$lj@~_T zb~giiUfs)cJDw+(YFS#90XRC^nK027j2AdEN}4ca9EW*gjeeKxDDgAO?sqbLxaMns z)%ESu#x>T~J5~2)@ACV+5`{67q>?F)bLAWjq}6}%fvH7GTk8;m4DWl2Ih`iz;6^;X zHX7)CV|Ft~9(^8ub{}V%x2>An9JYBOq9!o1kVip}L@UwGfSHwQLbD-N05z*U%hKVH z5C8S70dk}ffBZ|M#8xvRLO3Rh9&z^Qgt&k`f3eP~6l*Rf$~fWbp(W3dJ{lX?we4j%_!o(By8 z8>~rL4XhGs@5G8l`u?Qu8l!uJQ3nuAk+%3O1W(C5GS^>_ZuCV~|ABsNjQ@dt%*;$| z|LY{ZrKxSd*@pg8Etoz6eQxN9EX8ytlI7NUT8e95 zi0V&q!R1;FCgmGxBKKkY-2oS=u5Qig`3B}g;C0pnX76X?VO6q4>CpMzy>xlXVP^ec zHT`qdGr)eGo}rPxt||?;|K*MTx)#uLpCe$F(_NYMKBeDSLwB(qr^l|TceIpp{YeFA zNF!wE1?3+LLDaQPCyJrSo$93RZDtgTe9XGoZdpA9G;D7aKK|>hzWY=2DDb|_6q3OE zaf^0SX7wIyYj>Zp@4T$%jh?@-WH?l4&$9vc6KQ^=s(Y;YSI99ZAe#{t%%-z+$JO^h zjn$=FqB(ykpi>)Zc%Tnb`ZX=E_I!fw#sNY>8I&;tC8@Y?q~@F5h(ug!U``-u*JKcrn1Fw9H~HNR^jcDr!^)Xz)m9qV7I=r z(dKj)l#lyrhQ$#eWA6y+vlunO_R`ImrTtP{Fk+EW4%R zl0xCfIUtjz=J#588`rm`2|4SQ|H^TZ?q_e9#quhxD36v!M_tU{?I+-Xc?^ocwN6+ zz<;Pc=Gb4H-_5$Se@w3reK1?s-ci%|*y~@v&8uzob!?k$bd7d;QxJ!b8c~f_NL2=z zM!!+F{P6EtCP4+oj;}sTCysgQ0m=*8V%0%LgenvvWq|^pc0-rXbyRD1qGeG46SHQB zvoL2hvnGJ8y5!*v-7oq3bnkv0akzLts+jwa)T3RoTts|@8@EF|Y&lgqF{G7z=`jxr z8;u+%X6|VoGCbIx)8-B#C?Gnnyoj_-QCftP=ZHo`&%_*$JK*O)4DtjC zt8o&Tvie&y`d95mG8}iR7Za#PjZx_cAml%*XIfc;yB2T|rgph@8dX$~Tu_>QW|q4%mHX!7%c1t?{14H%)5d#sY+q;p#C>B_|s3tV+~3`?nB z-`2?*7{jOlmK6iPsL&^60xnQh(DTI6(xnP1=SG~*o%P|xuxYOW))qFwIt4ut$U44& zL+7;{b#Js$wn{(L^Kmr3hH^e>0Li%d!3YRB>7nZAWP#IpmZ1ZdRRQ($W#Cu(%Zhr> z+(71XiYLVi?zEZ%DXCI>Hb&o+6r>+ZKYT%(l7isp29+VuDEcg8z@h^!8#^rN&+uh- z-P`N&e*37=Bm*VHS>2a#NAbOOlKYp_;&6w{*#v(s0fW0fiGRIDkt!#PYY zEy|8YqSdc{&M8HCd51?9IR{5^g3>AFNUU$oNDUOJK{F{(vQ5ci^z$xSYsCgxM0?4) z^a(*Y*yT?NT1-&A?DkpNuz26;al3>VrrC+M_wAF(;jiz?UW>0mc)Zp0kcorO-PYHd z8se$}y%cdma6C5vFCwu{jI<8z?ykZ?m0+x7M;91eh-PaWU5pNpl~^)%aAAyUK3s9S zF7Z3;ID2np7+~B1XH$Z+nCc=dphm6{!UtnWvN$0}J#A^( z^9HI;;O=kMFvj197r@pCLz_FJPK6MIen8O`w@1hrHN8)v&_+zzoHF$+n~-b6kxA5e2L+6Mv{Sij78JbjyHbXYXs2O^5xTqThwRnhTi8R6Uv__g zbx&+gWJ|`*G@wVM7_Q-2ltIF|jewFPUN=UUo#^hyl!?qO?~&1Ft117J*>0`1G0n2^ zd3saNQ_V4EWJuo2-Vbn_UK8QHbrHXtI*R@VlH%HU`!C|d^dFtd%#3XRvn&7q4b%C_ zDh8+xXLa?fC(W1 z1tJ<$ZGFmJ@^>laz4ml^J}$k}ZlyRTpn17Fw=TTW|BmKlTDm%JdZ+X9uK=ug=M>NJ zykB_PYv+D8c01=-$HkVp7aa7@EDLlDg{}1N_#jH84#BxU%yMvIQ;zddLdF+Qm?Bsr17F~* z5bbxq#92YO0@Lw?hCFDE@WZwcP(YZG;R-w6)!x}=$zTfv&RJtY1V9h26X;AaM~}7; zf6UjOQt+(4Jobd7;KsM8&>J7=2)sbFM0@NI04AiS`9k&r$E;P;-CA;N@!Hx>$mR@< z=+!uY;3#$wa|CoC2nWIU=3KQ2c-H&3!l#QCn&(jP$xY`ZHCH2*|1PLxUXbc3qNjC_ zI{G4F?%C=Ju*8{q9lYmm@{gn3Q37MVPgPwqz+eAno`Z)-dzxYAZRSN*zUd-8`3>+K zavKoHi~T4F^uWfmjL-q~=W(#N=n0g{6zxu`X{A;!$0Q~F7|Iy%zGUP$IqMbZ0+AJH z!>RRT0oe^HrADh%(XodN z|M?(|U?64tqWh2qg->xNZX-i(dA5+`IQb)bx%457;#z}(NfgPH@hXx@kR@BLf@8G4 z-dZ39fANC#IE*ZA_phZj0tkHN`w^Pf*J2ex%pu*I()3#34-zIm0;tZqQY;FNl8a@O z$#H^wG~+WGv&-NxEu3c9DadPMG$j_{p_nw0AI;q#+@b6=BP+sKg}QCT=WW2)3_wI~ zVX#0P1OM`A8+xlv?|wog={X@{)`k>@y{AMOy~HGDB;vA_76OD|NSJCsAIDG;Ky;@S z7r07sQq*ZK*p@=NBO|w&MXvjH4y-u!>ZxsZq;)%sLJGztX+Cl{|3WPGT`)rYk}7vV zXd?no+9S>g!wGj3mOhBZj*g$yAmt${mBZU>BVzOiTdd*15Bnf&bOiVbYBH$OUXi33YJ7P+}~ zH0i5qvg|_G;8+{aNaMOpD=GwJ7ur7jX}En56l8tty~_&H{s2TqWb-{=1D;q^Exm{6V4C8Jsr5J;M1m@pk--U;S~Ey3MkOd=(!}#{YLzaj*|E_axgzg(_(bDv zj!G)T3cTHB|Fab|!#s_`=Ojgw5`#l(os?9u`Zy5wNT$y6-fjJ}g-`etz=YL(6I6)4 z7r~G9Pn`I5RlG&CIVm0RMsrU&1hjUXDYn2~KLMECR%QWhYJW#&ghQpg%SU+T<#gXO zK3)Q+WVfwAvPzSZQ$4iKduiZvHqDr&KGBDpH4M$ z`h&z0Szzij_VIG5eKnH+%o2>{*?mj6Wx2yy-TWCW0Q;yUvL6PK>oN&nr|#t}EN3(L zb;_*!MaWR*-hAH`t^>5g;7_%8Rg;F2Rl`P{mGaYYZS}2Ri6R(JNa`SY8jZMJ80D8T zQiK8ai)!y8uF!^NKBU3PaW@K;LBBit01X`Rv zC~rnQA&x~&uUOFAT3GnF3t>1!@PCdHNN#SFaDw2=$iqMoC$qj7I`0hShaV~-7a;2N z6VE$pHrwS=o;|m(?G?A?(FAq{<{fPiqtO$<+`0$~n3OVyPlwY8U(ktXYa)!Kh`^X? znQ`im+#44LOghc6KkqO3T$R`FkzfDu1!BH5n*e4ij4&T4W#|J2DDv(fYLs|Mhu<#r zZhwY^iN*LJ z0OI9^IRP8#$@{TLV_{!viYgP9$n114U|G($|KdJ9X>$m;EDDuxv zc~%i3jPLX6_%PYT9mFKwAdoGH*3BuOOv@~l7(B6IT7T_hkJC0{tb?nboy`-m%bcu09 z9=d$`ws<Nm$G&%+Z>B8$j(()CyCVlw zn;p9~Pa$%BRCL^}ZLKdZVH8(XRl9JUkK=z%8+FsI*HT@@nkfzv$5@a)TDVGwi=iOP zM6%%~Dg_-z7+zvrk(4G$?z*7UGOHE1d=~s1(`y<*jIk_c|#$YPHkUol<*LkX{$*p^~w%0eL5%M${r1 zE^!ZbU=ES=#En+C!9OrL?{vP(kKXD}2wLjjmrplrWmN4SKx1Mm4(}CKxi~Lf1-g$fHVQ7Ymsd;v*l+J`@C;(&p_5^BP@&qRLfs z$m^G48Jz`WmqpByi&elL=M2d7S)st#C&6~@h)iXhWx+!!tMD)w;iE3`p_!q2j|?pG zp(E;BNrRd(3^C|dBa5cOp+_0A6_AQ)C>@}Lc!%UQmVQwikf{fx$o7w$h$@X@CCZ9@ z+7NH>l0X(r0o#?QQy74Xr2%Is&Z@{wxo;d0i3;KVs~02*nXv%Xa^6c;wA*8t%PdTW z^l{PlfT7j z=@f>xvYqTxq4*%W3=Km>7-@}qOle!(C+tg@;toZ+X+Q!4FC!$)A6*@eXM+)lcPKOj zsx(5PZAD6&;m|QR&et402oJ#m=XhVoq9d2%#I?HQ#C6b=Fww6%b7W8!c=;r;ni-}x zi+6!o%REN+==XBlw$n)}9Y9aOhx7O~gmVJ7Q8(plV zd1H&FLf-DPKc~)S1LKYB)talVzX0{l#X~)9+bt=1UN4K_5BNM& zKwxy5CgRgNV(Op(g6vSTyJ`g_{KNPOmEf^`lF}zo&e=>q&Gn!Ix6-kUs6^uQAxEOx zn5hiNvM;11N~lS*P*DSbbjQu#=ay8@fWG`T*tBi5K&!@s7~I$=_S_|Gb4gzCD@$ccH^28 z>ME+M9%SLAJrh?^4X3%jfE14Rz}hx?CJu`_CjsuZdsvAtvxt|!SyMQ?@(pxAH#54X zW}3Fuf9D4gVgkd6$6t-|5~_T}Q#t?8I%H}cvikO0GJQd$i2YSQl((j1l}6%&RqApe z;v!A+A4!7!s~qu*TtGs(D>G(SuXDL$E}TPga;;C8^6MY>yKju4&;r%eDI$)W+~{}7 zLQyvm*#o!uyOrmojE=DP0EUB`Yi^_ehEk&g)*}~tn2^h!q@qxGbO{}U@T=oC;*n#k z^HRX0SU}`jz}%Oamy2`LRHJ5NMb${x*>E^ujokFo-;zT!qf?nuJ8o#1eYu|4nd2H@ z=1<%Bbz2=hg}|Oc_`UUr?&weHtekyk$i97u`)rEf?YU=B%64^t>2fZE{V6N+_GV=g z@v@U#Fsfr%&jYeFoh9PZUBST6lftiI&tHUpI1$dnf4y1F z_{Ml#vAy@%U$M7QcPo{~86S8jxOt{#&t?ws`^}GVJXW`Alp$(kuL4E}snv zm#agxCt#047Br*h8+{f+z&*ZVgMRWI8nhP!(!Y4mTYD0pl%EstVnFz$4BtgUmg*ka zW3N~EG7@1uearX+t|bRz7D4lAy0d9)LI?jvvya=_r>@u>Nkp!4xgOUpf7|6~YJS&y z3L%@1deF(DizYm&z0h|5#(Bu2kmY z0IezswN}b}IgjQ(aZb6JL<>qzi6#ZCJwz@5zgl zE+}ISAIj~uv3fmj-Y24I`r=U7wGZqCvsMCg@~VA_ISKl^5gqD(C&iVqc8q$+CG>vq zKuOwm(YrZ$x`_=GTB+~DLty$#!|2e-Y8MIqi#X~G(C6K4ZbD!PzWB-wf!}l?{rDnK zUWAbZwJbT)gW8reEb!Fmgy1q8I%+>~7;a#?mJT&Fj2>b8_n6KU9NWL)RwB4V?~m&* zfyS%o|1M4bfxq05yaY>Hz4Xzqq=vXBL-Ku#=l0qoA6d8V{WP;1pg2^Sh;ge^|7*}r zgWtbKn|@ZLD1#JH&TA+3_k*2V?;au_YlfP?EbuF2&XZ!LWQm;14 z^`qcSi?+eIi$uNT!5>ymcJPtXH#3-?GYGurJ`UdlLc6lz>nHr4ce#R6&eD&{$ZRkMwS-`7zqwe57h7r z9_)FdF-M(w%H%`Na7@-NYnZY2@ffU|{bVqth^9K2uvx1^9gzSY!!CWHNMdXlh*ci^ za}2r)VdR)^D>@k8K9|YMK*f0J6+|hxgl=CJk5e2)PNs$$FfQQEXQY5828*IAnyPGh zwRwa?hyeJ$KkUu0JFHqXYwS~ym{x9z_zt5Rq-*Rxd(8F_R^FZSFNp^O!syL@+)y4` z+0~e+oCeUQbHNiLtJ-`Z5`gJngQeL8sS?~_A&)!k$(U;kT@hxHEPq}Nh!e6QHAk_J zH)P|(#&|&p2hv}0h9ppEp-DLXh*{a3*3<=0IL-jS@Io6sT4ck)f~-e85*?+9v0!EU zRV8JxhQlZaSi0o!j`H|))Q^mSRy5)^+wKgSJrvlUhT4!=n>s)f1JsX%ARbAc+d>2s zv4o|rgh>Pa`8#@R4?7g7F%cXt?5IV5FYMXFUZiTdv068g0ZqP3JnJ}fpZy$(hv$uK z8KYnjyO}&_1Uv~sX+s;*L#2-4kC}c3MpMTdhGxYhsQ<*^|Hy`AV&?dtjnXCRKZD{A z24C0RD8dd#iOzX7b+g(o6pGR77NwDD%rfKu_{gZqP67)*FY%}2TZ%32E#&bM{(1Vb z;E6?diZ#8wiX1LSKZf5=pz9wRVwjH^b!(HJ84Wcs9uFCH>*_!@095I`O0pW`CW?23 z$_%F(@^^m!E*7E_6G^scaZx+>HcYmV9w~Hh>fq5-Agt6QlE2oV_AL`smD2zD8p?U? zR~D|s{kn9&VZs=UF^0h@U^~@P&&i|Go7PDPB4U?oPQ@(jv-L5?`o!802^!LC^(!U( zZ_~=uGS#pYC-iXE--U2VXc!l6t6ihTK|D)Z8;DT7|o`8*tn;nc9r7-jXV_& zWH(jdYtV2wt^ahXzs=6MQT)dB=B5rc-sX(_b#lnX_^=LLvmw3Qa7NKEk;L*(uy%BI zyFInOC{WNY_aYNayd{NF)mdVL6g7e{Me(R7v3uiL80ALP@?bv+e*d4KWdeCV!BSM^ zR&)j|6GVGVIc~ty8 zn#MlkG~RElutCTD=G|6+_*GMa=!VCs$Tb$@rsO(+01~v~Ie^Qy*1wai_U(oaMbW`e zj)#84!$O2JdGAN@a?8>LUqle+#9z^=6;RF@H_xRQJZpSq_VMWrLH?VN2ZAarpZMS! z1jUSoGpumcIQ4*d73WqEXxLV&6JKqD znM=WQk4>94H2|uuW;>!3v~S7jH!~tW#Coo)*UHMiW36iy1dm!s>FUtY{wLdkfqRV6 zv-A zpvog9{^_>&!G4W+e9;z*Rjk{#XjM7+{F7zp@QzNu-G_`k6J;)7-SX8=swy}NU1CHH ztRk#F)U$tkx68Xz&*i>XBbTu1+TvNDM?@Idx3o|wFr3B44HTenwGA3<-uc|_CN=o% z0wQc9Tx9npe1P{ysBD-ED-0pUyOVw}>Ei1d>X1AdmPcf8ciRo{RtNC*lkCgMq0q55 z`wDE?d=VV^r#|pB<8f3*&3TSsTP3^0WqAmra2j=|Q@JKZ@=3#DDQN=oz`zU~;dI({ z=`!uP!BKM`FQQj%Fxr^2e1-FRB80u>nd^P`LYjmKi7^sp9A=6w>CON+q)W%rAv7x_ zq%d^y3Z!(Q&ETy^ZMVd^vpKr{<OLgMChj+e;(!Dwz!FGZv8pO-1uza=uF^A+;3hMryh z?8XRGKiT{QcGE z`It(o=7#vy^HO^~P2Y1MhVo^8h{B1nYMnea)S`d}`aPT@LEPg9TS-@q=^Bt+0q>jM za)UxmC2s52LT+Y&2o(IZBkEb)Xyi1IQ z(Oe{!Vb$G`=>#US0FL9MIQpL+6N=t0HBYf-wO3p{I&O-aR$S?F<&3P^U0B1QyDmLE z+cSa1x5AUCsZ#63WIsS9vd@>p_nbnFq9F1UjQCHRoo(9hq5=v64mZ=85F&N?MEo|7 zVpp=xr7KGtw4;|%AD#^RW5ViWj!N%RU)2*YQUM6PrKz7++cywFR)7f}valDI$Xjy{ zKnKypk=uLma(XH=XVY8OF+z}00u=&MiP`%)1Qi8JIfin=OOw~JU=gDLa}~Qx z^JvRYf2l_M!5x>)rqM9cyW|5K)#eXc#|>L1%%F{L@ICV$>QO}iyGmBe@GszJ)go=% z0b@05*I=g5?0f5L*z|VMCT1=z{dynfgC+tHbhZ7&;jeOvLGlMR9`0GN7p53$adkWVDhVG2uL+ z%oSMYQ8E}TB$VLUT0L2mVe_;u#90o+ zqM(Qfg{YWecV`0n=`s|JZe^Qfgeg9wd7C}S8oT^0I>K<+4#CGSgDWDz{)E%y`cG0y(WmBY zaYc$-BfhD{a{`dwiwETrhu{fLki?11B9TU|GnJfG(kNK8)k)=Lp%D?1@R{Wj8?vQY zm%J$aa!($L2PUyqs_S(CIng|NKe4J>R(FGh(yWJBM6Y>@MdW7bdCm&wdFlQRv{j+I zDz1#HPz7)iRg%Yigi@x3lv4^8xnQozq`&xz7gYpM+%sFqXU1?mX_gNQ#9Z;f!i1wx zDaM2$$CA-+Eui@&`HjT*Gf^SxMLQ2?&zIG?-mXDbl8HO>Bw)V!S&izgc*fh;2qBk(S4 z_}MKAj@}wg&DA-c*R8?MW?EEJ5?yY}3}*n>L?km1W9D2w{W)vG0s75eQ?3sIWo-_S zk;G*FV<(Xo*eN>PoD4uWDX)%_%iKH$!MtfyTj0GZZp4X+3ftI2)@DXR{&(P_m=ykj z0C0dGq^I3}^Z#{!t&Y=(+IP_SdyIF0u0g9%D`I;e;jf(?V!9&Kf%xdDaEN4gXb1r` zJ1_NqMR+j}0q zP5?0-KQ~aGszI_j-FNaZHuAu5@gGeXs}ThoRZ#h4fr*06Z$nCZiUXS9ja1>M78)}y zsZ*@;hmB8ulZ`+5#+YB7)^L>dX(g~!(59xWwmXcLw*JK)?<9EZgfODHK1t_1=T`)jNa*`Xc9Y8ij_wn+g-~SL#vSU|BpOSl4w!54G+W7u*Dx_+o&5V*u^mdA9%Ua$=Hrum~|$$~ib?Yq))-Nl?wP{G2c>YVni6W;@(BUFU|eh_F6kF;$VGTaMm-QqSz z9u%k(cK`RES|P~w`Ri58VB1cB$L3_^2r%C7WJlybP|$DpL&EPbj~xOu^apl^3LgH- z?Yq>v%yc#{L0JzL+M}-i6FYaz^;N$YW^397*Zi&h@-vdyQkb zx#_GPP2EgKCete91zYh8HB@A8B-;LNaoi82J+W|-bVyc5TOT#JOq_@$64vT&a58q3O3w7HW0K~Vf;2Z zIT*4x=je={Yr)I=4fR64=o^_jM?pAChY4a+@fXO;oY-`6{W+$6SKj|+s9jJS?ghp{ zMBpG;@Imtrorc7Y`HH{H0@hNjJ0jHFf_tPZu@X_#`;mssavaJ-1d)+u#JB)g1ZUO6 z5j=_KcNEcJusWPD{|?O3ah7=Iuxch)o?!!JTcr3Xcq{FA#BJvb&AP#4wc%q>O;yCWXU*z`nwdnto4$*iZX#)9v@Y z22}fcth^>#zniO$N!3r$B`OxSD$cILv6?O;Ld%`!<4^)iDlQ_i|9oJ zDyF4_7qI*HpJp;a`L2=lK2FScepHz!wwj|TeB8%N!n-;7J{-Zd)3^{GI(&Z?w!zos z{;_dM^QRFpEkQvHAyqdMG zM^q94>{y3Kj2H z!5=WD53t>Rt=f&0PE1Mnd8jlEWZXJnF~OqvyP#xBphV3YS?z~cpo(FIBGv>LdXYhe zXD~Ezz)C4m=BjSfDkG7U6@0KYf{`VFYugsqe#K)mmbV=qwIf$eMwoUahswRJ4^Z2{ zP%m?^@pEC#-+Qbywc78cWIawf{&?ASFToCuhMv{cU}T~txiY3lCIcK=zw*?gbnBHq z?$xbGNI|g_D)_!)# z+FWlk#7+5KOLOQwaW3+#NH28YbOzVY;$1yI7TArz;NoU4_TT`vzpnxl(2Kz~~nI3+T-K?*E#!rh~u> zQT0~yTHB1H~nq5Pu&c|qkxYlESA%9GJNg+ra&z+xhN6l0afL0w^Lq~iGr%1qTLSX!(dF5}or zSj#Rxy;VwHnWC58Fliwc-!MsU*`);@PrZr>!kHcU(8}6d$FdL}xQ43~*QIlGbtEqhP?drAX>bk0jdvOb)8-UYPDEXz}o~_x6>&Em7jC|lbc1JdCL4HK#ECES+wahlkdg$)aL2$ z@qgfo$``4)@kw0c5X?3O*hN0kyR3WcI{!WyDgg%)zSSfnsEp3AJrDM!p7*bWW@dT$ zR0G(dh#gnpEQV|SD#P*Y)eUwV^{pE2k;Mn^$Nu{FfqZ2u^>L+J;^&_7}@@PNLUM>+@XVzC+q8+R@X2iVhLF4nDI;+UU;gNuw| zvxpKH#kNihUW=xBy7{`|P=@*W;#n+rmUdifk;ZG-%EDU(Zn%A(it#*GZ|tqU*L|EE zp&7pnmkJiugd1k=Efy_BDFq}^i{PSw`Q2&@ z*NAYpwYX#Iu*Trl6v7gP)8!jl!IVkQpHZf@8}@bVhbXYK!PdXK)#m~VMvAn~0;(5sRHtVvy5XaJhWx-bT^ne><83eDs zIHpAB+B`+lKrDCp52HNN8Rh(0*yVyKpfV9|Cp8(+PufM=HWvulmwlhTB&^mYx6N&; zW?fIpi#AV8u8`mhv^Yi)<*_%&RM6{j*i||h#C=$suP$?;RJq2<*8|ajC}%J?gF8b& z)i=shtYnA){ne3<|B@!=M#YMyrw}pI`qDaH0YTl0@mxQxj714gFQV``!%qbC5j_D8 zF3E-Oj!Tk`rv?|$+jDvvl;U+=T*>Ye+K#LJ07x#9p6!mWJ930mAWJzc{kzg*1vzPd zp_9ikQ`^J6Kv-m;#wzW{lw+=Db&jGVH=Q0~$iS#gw;B^msmBjH-Neg+@ryNvA`o;S z7lPRp^)bjdrG-6MDEN>htW+WM*c8SRyl+uCf&A0ab(^bj9~;wOmJ^!)%Z7FC!y z(B~*V)}Grg*Z*EWd8hrxTy_mX4$;xz-R^l3?3j!;!6*R|!@x8N()$etY_5!X7$}+z z*>ICP1q!Vs=^UnQ{LmuE7ZzDZ#j>k-&2WlH`%Nnh7Xl7dhY$2d36+N&hK}O0im&4f z=ejC>lDC8k2E)P7tI9-)#=e#E4~z(SVDTC>baOqxJd|=AM#)Gf1g?#tR0QQF>L0O6 zx;yBy+Zl2M=2JM2Tl3qPHt4r~+}7O0>OV!yf|sBTMHA1rK_*gaG&WAVdQAjJT@A{I zm@~+#JOlCMT7Me^iF{f5Hq*^IxK!%r7X+V=Sq&IS`|mr_yOPp+2|2iD?5AtTdKs>} zzC*8iNTuMq=C{7}zvsRw=EVw{?NNjhD-}9~9lG7mgxpThDV@`m*_zIs_Xpv-U5!yD zr*xaoFz>@$Z*RK#d4MmI%Xj3P zmzKlF*sGllnUg2D2Jfl+3k5JjP^KqS7KtenJ( z4;fX0z9FWHk0J-zFe-?yoYMiAkiRrKDz+B3XdHSqRl*?j2td}{#CPQB$ua8X)7dcz z%A9NGl{?TZ;TUvkHB6_27Mgamc_tU=ZgDoohv)0EGw)?my_sBic_S7!DZ=znSSa|X zV>fdTvv~o=Z$V(6WF(kru|C8xtlp_qsn2!$*M>>AI|7cBA#f@}ptC|}%@amgoipyp zh_A-NRAPyGLF}MiVR}63x|f7i<_sY3@2l@bFN%L3?Ok_5S0SOA^fp(WEGt^qx>3u- z8q{SLSffbEW^|I{qhbB#&?z&QT!>a>J~`I&uxw!zgWfl1t zH#G%O=@|#hf_YxnJn5^QC;{=T80^bz*S^^du3b#cq<9QngY_H_8}4p+|2jojY<9N1 z{F?hC*lw!aTc5A+BYyQO5W63!GAhwCgmYDXOg(1l?=X6E#q6OQ%GR{oBij4Dh1R+$ zz+1?Gy;MoixYU1DHGNt4zTHmsmSqid0z*O0-D3_~v?~qGpQ2OUs>S^oOlev1E~bD) zc3)KH#>}DWu@mX;#)X)9v#i$cMANahu2-YwR|t6Kd~y486|3!D7*MzHiroYMSRiEw zFf8GN3l8jpH!R%Z!`)?Ya!X6^p#rrJOgy<7e#svm90Lt*x!E>V8>m8c>x7}+2jx2G z{@fiWqO#QgfHZp*vhux+kme!2)-RIUR7HGD1_yTqrmsv@!_H=G=83yl*B%+A+dP`C>Z-6?x`xcX{(W{%S z>qi(Z82{7oZtxcYMVgs9C>?g7kXEBQsB=vk$CF>4GVjyPulI#$R1%G>KbvVlH0u9h z>>auU(b{0mWTkD}S!vt0ZQHhO+qTV0+qP}1^R9J!bq~(qo9v&k<5fICDs0V@GL>ji zySifL@zB3EU$0$h6#fy~nd!-tF8li7eO_m7T)iT#S&s7VCaC9`oLSQBny>euG+}}X{V7#ZJUgMb(GuCKn3uXIfguUjG3H;}1W2eFLfvTx06g{$9#&4l3w>fOz^zyD#*GXZ}1ZS^aaC+#Vave_YBTboi*wRi(nx>NkBL}hto9CN`d2a*eD1lP0P6#?$7|L`w9kfJ!h7}V8$da=hcgp zZ7g5jW)&DuQ?CYejR^)Bb<|(X>-j+;CyYJ)UfPRfS2HHaj#p*r*J#6m{VHA;#yu8N zE(uTIfN7gfugHXdk6y}ri4&N?#R7Kj26Kpg!kGf7g@rPM#CsT-+$bhch`CqBYZTEM zP@@-m3t>UD^-}uyVPdgsW!)7MrjMnr3?o=?Rcn>YmYEXy(=zf)*ZKkhxbI8qEtT7g zOl9lI(RZQ7%~W4^%2c^cCy2-ruU14+|B_X2*E%X46`7i!c{fS~#P=Qka#llu<$X0< zW@?#R)5|IzyOW|zNv&xVYUN|d%s{mL{=hxEM`FDG>SE&Pc`<#AOc`tS1BG33&47pejmp*Ueg!I!!J0>U=s$I;tF?t+MD(CJO}F`8 zZ*LDz>UJlvbwNSfn7ze1H>9-Sh^fU4B2N|B!ivY53>>Sqs0ciK|6;H|5K7W>)p!R0 z?9;Hqa_`no^fN^c5~&*#R~kRbMta#Ewc!TpJnYl3Dei)Yzm)T(d#SkE5c`3Is~5*L zfrzrFRF<)Bs&7q{8*eH_Mvgp&+G~8q{vz(xCtsm%($!Uou(83ca`@b@v6e<@@P*cF;W< zE1!Nk9CS|mNLS15IH!ueeV>}SS-Y5>I|$38q4*C-PZ>+FP5nVqn(fK_n~W)n5JxRS z_r=GgX)bpj3DrQGz41~Ze}~SCIuqewev*YJj@}P$v-Yl&^uFmTYn~hbZWIWeTk+)@ zS4=GaJ*D`xaL9O5Evxa9^y>7p(`|Y7dM6MzNVZD>G5F~Hiz_t5ZK7Nu%eDL20G>9b zuey$_qYn7t6W|27YQ>YSqr=F4wXuIDgG`qDFXA;b>wjQ3>Dk%-=M{S~`dZ8e+da4L zo+y}Eqq|r^69#piqrso(uA&_d{=SqY7S@Ktxw&hjx{oW(Awu)9Y8ev~Jm{2BgZk@1 zuV&4=CED6H-QHer=P$>MDurUBkQkqx5)v?O#P1z%j(!5G0oFjP?7H1B+m~Pd+z`E%= zaD6+W8#{a%(Q#795cS>7p%rJ=8)@sXxd_0Ai%9H^Nr3ci$FshV=!(*2DUo(DgcF47 znH{zekPMA0Sj8yi5HBA)q6(lspG+yuTPoyHorWL%OvNK0^yBp`z;xnRkKkpE)?y{m zDpC@^1mR2TM&PwXrcoaP^#nR)Wd8?iPOr<#cYXdoVq6F^JXsm(muca zF%Mnm$a(XWoOGX#Mm!x`2AUNtjhyT6FMa++CC0yvzsV=4N(qzAAC;{`e9uCAaKkJc z6@}hOaIK+wHx9Njf=k+asx7!!A7&hue|$e?Z7SD4rpK0<`Cq=BE&~g>nsBV2p6#lv zA$Tq*wqt?qsSs7P94s-zV9G)3L8>7 z4h$~h-qfEz(7EcTOF`RCB!n_X|hOM||mJyGt8%8Ss7zHk*J}57;tZa>VT#`9NwJ7WS_d zn6G(g4flFN3xP5;2y>o*lfBUW^+iR5S}#`YNXv^kU1qX5Njk?$Dec5lU&ua@cawfPEDF9i zLUMAV%Y~v{>769-5;Uus(2k>UvdmnrCbG^exq_TiAycJj4G9sH7|4-fiU%2V%!@X!e>`f}8hAc)Ps!u+t& zzK`LV#rp(&L-o4bnco4{8_>#)FkEo6hpIh7dcaHSryANbO?l%{jZ$O}`?tOk3Azys zGf;Xv;tD?PlVQE`CfFyLL4xh8;OL?=GXA~3)W*K?jwMfAZ#&o8&x-e#@Q>o&kp-l< zs*XY1>lC;=EiHl2R~e>V>-!bUy=nC~)@|Si>grE9@9lyEX)3{%hgD#xeJ$0YY&k4`YVsX>5LC7)`L&@~6mv#HMgx9M`j-fpNBV2o49m3q_(M2-odA zMx_1Wy&Cp;DT>JpBR*{FYsvgI4er9Xn~reI>Tc`|RCfRd*TAUHTAPn61YmPn zDzp}zscEF+;07uGKr@J_S~lry#=7|t?sxK$_a2nX|6Gi3%SYllkwB6+f2CCwJG!2T zehu3lL1D&fNN^W6H5;HK06s_Xx{~Yvw?YfE#I#C8T1t#Bm%9_FZeMih&MrC^*prk-16_Tnk)INz&{&xPxld*F z!;@hGu%z@Ac~CWc%q-4$f*Cic)lHN45#IyOh}w=Qb?ViBaYswcfG^<7_6fwG!O|;O zJ-xM2+4{Xxn#uZ2TYS>Cw-#K8)$y7Ab3<9w9ovt>$4KG24d>_f7XCANc<;L@Gxepc zUpCeYRp9m3cypNO>(q1i4~^r8_U|DdIaV*Cd_y?}ZD&qZp9h5abS$F8jLoOh$GI;W z$QAN`^(?Iafe@o-Vf&vqLCI>8vH!_}ED#IH}!#j6e$sD~Ub`Z<-xfgQ?N+r>ibrg*D7`j%-cu&+_Pve-U zJdv7ZqX*nmp_ZP6v96cxU>f9{(Ew6)fNuMIZ!r}~?a|3v-IOcav_3xU1ZK$ZTo_(N z9WBzD1EDTrN?E{qf3(CA+bFgP*Fbhox7CXhsHU@sS)UCH)y<6sT~x^~E?T;Pox>5K z1K}31oQ>}Bv_z#oom3?`yZ~}-f5Ka#O$JmVW~uUEwV&~*r+SevvQ10@#y>Ti8EA1T zZT&9O#I!>R1!N^+i<`HZ$%8MG;m4Wi<#9%jFFADnNlmvp{Khn)sA9T}&VIEPXth|% zCNpPdt}Ht69{&fD|B1~yR)f6|CSh4JJwAY8uqfiNlhoVQ+*iDC@c(&|O1(*2q)E_)ACN~=g@S$B{x0kZA z`$umk;(E3NJP=f!?682tbVxl$k#9bu*y|YI6-TJ#xh6obVmBaoS~DDV;nhurWLi-@ zxuDdJ9T-E)BaR(m#w>aJ&5+4T8E#;Krft+}2KqQhB$cd<`%ysC&hkW7V#Ck*kfGg+ zD?FNAB81a)7i4Hb8Ie)vU-F9)YGc*29$;p5IZkG1Vr2o1fm@xZWy(jg zn(s?#qH35lR+lg({$(9_3aSV*Uyjjle2+PCKcpr-f4)2dvW*m6;2M2{TtSeU8__Mf zvIBNgiabb6lZO7|{t1y6aGZbw7@f>ygm)D0c;&fcA!0z)D<*Le$+$A25W!k0TR>z+ z9l3vOe+DwydretUk(JYu#B`6T6tWQ2nX}3Jg)ZW%WUo>d=VWlU9_W~{s6Gmzc+?1J z7=!AlJ&3UAB8fS=0TXSv0EFf~wsd?j2)MqC1M?B0P{7$L$V4Zn*<9n`kZ{Lp{pgfL z{GwFxooPvjbs#O9R@)kYIZ+dOi>nLGM8p3aQ*f;d@)Nx4G`(E38dyDlPZ~|+wa@m2 zS(BUwyC0Lr$no1yhUW5dL~Naw9;#*VUZUjXWwMx9wK9EqHUV$plk$Ws99SLL0tyu> z4S^mS+`vhtn#ZY={|zigK=cm%L)i`mr6aSV`iOSAUdg0>^e%2FpU!C-TgXJ z#kiqtJqrb`I>B$BozqpNmj8k&k2xu=pz6efQGxY{ohl!ZdhrY8{UAUT5A5Fs&}|2! z<{Bcx9*{V03JyedV3TcJ zdEkZQQ$LE!Z$@!GJLSqFN5#gIT}%+kzGn*Ghyp70^t5#GRi>pWg69^+hL)$KM@cY= zYtLmrn3#@?@r{RT-cvUwx`@=Mepiss<0r8ourxXn*)}s<;Pt;bh4Umopf;C+bmeRd zVOgjF_grlsSF2#ft&PkaEpk2&gS&~WH#?9Wmzbn?pmb?ahj$_SRt21x!YMZDw0X0I zjN^wy$x^0(a>vV(>!bxwUW*RktZWL73(Jk;x_EFdjwF^&B4sAZWu@IgdyQ6j8 z6|75y74D^EMRZ|c55M!8k6TF!PS3`xt zk;b3CqM3G6-tc5xo#tcy=h{TwuqVOW%Ga^dhZPdVug#Yyj$5nS#_vruS-j^T!EZ8I z7ehIZ7ntA=@U(~$bRjlUUT;3D%;}wq&Lcd4J6DVPzJ?Q_(3JA0me}sABmD0M-GCMt zyBAMJ`lfOkj8B5oaM|^YtW6;5brcE&6dUa_AFZxv02BiLIIVEm zQG+CHYL_FnXq^R-8=%^sk0Bu^ximXnAM!_$S;z`!Lq{(0iiAmO8xq9I(J%~yj)Hd{XIw`7}kltgIA zt`GCBd1`fyqH}HTuqH(tZ4EVCenhH@*)40YEos+1cT%g-<@tWqB-9D?u>j>eWcqL> zx@a)Vf+-PQxLmaWHaMA=i4aSxtwazd9xN*!T0SVwJ3 z?e=~dYU8YQ(v~r5mn#BHM?vj<->}BK_c&B4s(e)I7I1$Ua%{lGb`nEly5wBlVv{Bdof>hoJ-y8 z038IX!&#%rjGL0tYsV=Z>#5P5S{n0#_KSqLT!6N)cAw!+l7`iu7oH*QLkU9`lb)$g zmHq=Xv!W3t1yew_$Q-m6gGgqdBf)#i%|Vb5SC_Fsy7A$|umWv$7?5Chtb`wOIISoN zU3f7=p>g9SLivm;dSFES?TI10jx!Xt^Cq&h>aVf3iSq;8sklOmTF5T>J$U8xxm_ zq_?B-SJ?X-mVs~RNxL}o2Vx@&2hT=}SdbdW9DnMg&mh$PMo^R2jma?HG-!e_W}v=3 zwD1<1!0=|kb16?X*l#da-&~uy7lUhU;|tI}u*s2?4wnO12NbNsEibH&R)ClWpO7A3 zqRo#O04O|`EO{U_58E36st``%3|{Xe-#6r8c5OKwIFbg(p57}N0(wBz*4YVLMG)<= zzX;&qf*4(JsG;Shq@}ZEtLjrgj0V#nLXxN2&u)lReVlEsz^gooKTvg=KX6}wJl;uU zaymjk5-%sT8d2y@HLrzyRVq*}nTu&mY3#wSgXN!D`p#rPf+4r-?f2Rze1%#fKn3?3L0DcQ zRQv1f=|I+&?;Ois|sKjOhe?5saeP?Y})p4?Tpb=RG4DTuQ) z>_PuD9*zc6>;za)PLS`R&eCkR<^OrxpiCiFhjCRzZab~*^! zRd&thUQvoP*%C>_3c-tCh6ALlgn8}(@#3fQx)O>t`$3fTef?s?5UAw=3Gh^Q3ypox zvB*Vz;e5vMeq$|DMcd)Bh#FGW$737uWF%5_iLL5{*pP_)ZIFbkRE_+-q*!L^!x=Mh z$wDadJZ#vchy2zk;@~#(@Jj75_-t@1T{)O*GrHqnZC%NxxOs%2 z!`LObDffP#GHKDnRK1fg@e3@?U(#~wT|irqo%1J{Bhgk=LPg!wE{3;P$Gd_z6s zvOOME9<;cbK)w_db_{4sRpEX!TffiBR985F%UP=R?A6aa=)V6f=(!Wx>Gc6nM*%}D zR_j7k`8^#rpuFmq^}SATnptw2%1nN7QK-t@XYd~!sFyU#VRyq|q8gs^dfP2ounM=k zYicOMcDJ)@>b#hHv)_!g*x~K#PpJ!^DR#&HKYwO#JpsC^D?Plcw7m{+7qwe4M~K`U zFaf57FzmmM?x%bKI2{1Q|EoY?{|{FMJuBV+Y~-E#zee5@)zecwqL8BP5Ar(U4Pj64 z7BL%{x;*1`6BW2x@)4KF?-yA1BrA4_8gZdtU&Xx<%dtsm52 z9SOt~knOF3Nb<3P*+@45wKR8EM_Z0|%`r*du)=W4m0)V)r3jTJl=*Ye7=wjnl37PB zmWDXlg7K>{JBHM1D+y&B93`7BYhlqjw(}MQi*^e%=L21y&9A*T>L!)9D5R8Nvn3TK zM~AZ!eXcj~lLkA5Wk>bhCOKV_>GkByMPsf{wn$gdLo1)*lO^lvneS_&n&f?`ddQ<1#od~ zJ&|8Du08_QrPE1ag4C#ChRR8{l*hd;I%2^e_%VF6=-^ z@~4=ljHZ=Sa+wr$Y80bcq`Ku=$V1y6>$+02W85O*=nISFPZ-9;e-3~o0wyU;=pjN! zx+v%rINml#+kvEVqI8DIdR3v;#Gqk+Ggh_tq;_w`t(sJpZPdJN&b2JK_c@K2Pl%cA zFo11XFPy8RXOpB+S)LRuj0Zd*)~T{A-mDLr2FFWCZ_6#Z&7Z{T^zbRJ3Y)Q}rr~E# zYX&8n$T1fXj82>v#JX!L*-I+qJI!_H(Ta%o<;iS#3uuYB48N?+IAl#~ctGJ%GeicV zmm1s?N`y!d@T1IvxENp4@)I<(uxBCME#~MKfjR8n_&u`RkQtW7dQJdw?*5eqElfgl zpP+jnY+m7ZQ_Z3&22GQPgbC14AxU>~Nsu(=P?67AwDd!nlDqBoy)Y3bHS8(>sjukw zqWvd@dL2`CU9(8iwzdUcmhG|#go_FNi}4NZbH_*P3j2#Z_mU@uPKeNrtx8_`3BQ6p zZ?b)1eL-Ij9U+g%U*;}UFg@{9JVT)-Fj&7XEe_3+Wqw~aWzQ9+lk!;nVK1Z)kQ$g> z8Vk2{wXH26EVGFo=)v3QBTVE10=RdVU*donwf%QA7&-E?T`iawUB|G}Q4gB+Phb71 zXJ2->rt5@^|3zKL>(llAMzHwbb9ymN@}t`p5OINd>WBM#gLl4eb}NBOKA_X4mXzkl zfgnDZ5c9n)ozHNbb@(}IBK7fZd>MWfH^_6SoYK4Ule<|*+$Z*CPl8?SoIO85YIj7U zlP9--vGe=BxK}@J($I3YqCy{BVPc~|nk4&^+^MrA_r(5?>wLWi$9Ih}>z9>~zX?(; zWOWw_n5-ZQ+MS+W|CrV=#gB37i4|91`la{B467?z7(pZ7sH|N~RgZ~Hvhm$2OkV#* z>!k>!f>=X(SKo&u!M#foc`D*SJt0cW-%f_s(q`{XNPrb5rtOHZys0%+dNgX~%i^5g z&Mt+qb}c$bB3Zv@5C4^DPITk~iFOUu8_07Om)Y*?s847MjDyn|E+9Mft75>F!; z`mRvSu8kYIa-Hf)Pc?{5O#df;Llu@VtQ)SJ2NoKM=^;Y~w(jD4IYDR=e5GM{xo&>g zL51&x_cv{tZ&5YiYF4|o*Ds}OyCZb5UU$z6>gswt97(rWq~Z&1HC?SXQ{#|oB*y4f zn+HN!EmDM9xn{?vleWK3w7$9x_XC7Jf!MovUfRd{@6t-~{M*y~)4%UxJd)WzYdNnT z?bpjKe+kzQCmw_XEg*-|aTKoFBzZ0FkzQqr^pQ8PVbw(XaPj`2mRy4wAQ6^$-M2b( z6X~0&q3eq;x9{|TwHZJ7e+5;sUTViC>N_>i8JDnL0%0Jc4!?S0SZX1)z zOeJ7B#;26B#fo{U?}9fN+1}l@cP#R;Dco~i3Rq- z&JK-i5iU$j5>H0p@8ju2M`Ah|fx9ED@t0*LTV1lB22s z#6QVGi{KA0=_ftvf?)s~ekWYhkTV8}cbG$kR8WJ51);z;(g8SD!-oi}PdB3W=?cGx zMRE@y?=n2n4oe$UKQe~M15c6^V3(uLP*C7WsG8RYNt}e@>`!8#g@&CN>%vuVP%j>| zTAPUIQsfg_2GsM<_j&@MjOfxsDS`q8=1Z8o*yGgyLNNp#Bld+d=?@$~%9JNypF;-- z#qOR2Fl7`s0nZcr6af*2Bt)A=qClgN7d{E5^+1W70HMYoX7K%|N}~ghp>ziXfQHm> z2`s3CS_&Qp%p%g$0DKgY1YJ=DCSpXH1BhlcF6^LiN$gaIDM#(%-*Fi^9flSXzyMZc zcgGYq-~eT;%rGQLqGg3h5tb@MjLA19G}M9N)f43hT(mzA*pnkr|0hopo{obPOWC&f zTe0$d>Q#}uB4^69(xXK~;vc%u$52^ES?WXPkaM?|sE7ND=9fN$564eIP0-k&D$s~4 z5xBY@6Z)Rd!0W4h`d)iS!^Ne2eg*IMr=e$hqr4M1pSd(DNc`LS=scok~1tB zK5;C=E;ecsxH@lL8t+VUyr^d<(&$E7X*SPE}iw034L!*mFhVp z8#k}&(#HFQ#Fm8e>G}X&1&!@??f66G*yWA}mjZWZ!x8^u`>;e@Yg3UVq=+UPoA5k6@Vyz6=iHGv|C@p`?Xm3%%w6CUF&E7hj)RSE`H$&Gb;b6v|(!qv@tI0xT? zLBPbo(_e?}?kFA(X>IiEDUF7I-BGJ4OoV%B@)>5WQS%I{g96=GaaVwxhu(;wg=G~gjEfyW@d2QuI-L_NtlvM;52&vS7d zHME!t^xKglnP*~JuHiK<sQ!7*rzh;*#7xQ`5TH~ArChC{|vX^CilXVp5 z5dj%iVnulWMOct;Pfa{iLf+p)7GSSsd%97EHO0X(7=8jWr%`IM<5MmvQSvBP(3ez%iI(oY459f>t67qpT zUzy@#TZeh+1~KnRn+NO(xc1#i;am@Y1rS?@isxhJyev@I?C)|8?-_VJ2{^0p1C!M9 zQSyKl;5Ivjz|J%Nmf_5yA9HnVHdYAZ!R+d?T~g>UhTSq0VXDmpWW`Y$LW#$li47A-*jfh3r-wB+oU$(bkrjGkdBz$&AdE-OZ7$>}bXW z+_C z;l7{vB9ZhM`@IV7;oM>9Y$cmw9nL__kdx~9x_**D4n@|gAf9cey3E{_U$FvP+@b(i zzv@GtXg@}@O-Ovy+@D?cz^V{#9x>)?xEnoM-sux6DOF1jy-yl;*4t@$x_-DbT#?+S z%|G;6Nnhp4x(nmhre@lp*z9>1SJ3pAoPthY*#z@>)4RlYF_1f|Piw@H8-NToz zI#8=+FCR6hoUa0r;x*oK3&K9H&kJ?RwhwjOdO4fEnn$pq)7GTO_{)~{3V1`W1;prE#(jNjGwXCBVt*=NjoG+mUuMne#!dWO?SEHXS`Fm=$XE zIq+8s$ZE*I_qhl~YZA=@>s!tuPaU|jcxzdqT(ptoa(XG6+6h@K^Kf%RZ+X>7to)X# zyY6MYhq+*Ws3RZD7!6jD;*Arn8Ag?iUS+AIBn1f<@GgHz&2i)x*7*mo_c$GIPA9=I zL#=R8v!(4EQWaP?vL!VOy+<^M4!&HlrfayDdK-BjlK(@>nb}$Ye^UPcN;MPv|C|N& z3!{p~Vuk))CNITC04)2)Qo=!-Eq#2pEUGLa4TFXX^A9V;hb-$`V$csMs)0r_`h(fR9v^9xKyV$b zx{4L}Ya+(W2o*s@CPLF(_ISfXX#|0g zIWgB9zD%Hn5uqBVela%!pUsG`oHBpNwwjTYBbLk?*^t7Rx;1f}i=>t?!hARDABKH& zk;kp0YiVlZLLIcil?aT#Z6OAcr#P+nFL9+=@1)~+Nb;!&A#4#2Yj*hu(yx}yDMPXA za=i7``G+i)l(p){IT`3*Y5GpCv9yTLvbr0Gx#JILa!u11Wk?bEDciFz38aJ_jwva^ zN1$o5A|5i{Tzb_^%Ta2uUET-N>-E z*R&Lw?x=3i)KYB@ft)N?p(wn&Q9GpW)>-5EZ+zpk2R?(fWp4ATk)aA6eOAjPDO4IN z{;ta~UIW_-aJLY@Q#&m0LrG+X5{$ziYn}0X^bq^7F)GTX=hLhVim|i_oR`lj;tJ&_ zeAW&OKvYff~?+?m3P* zh&x7N$uKtXI?zxFS{V(fcJR%&>nYCm{9;zNaKaehw;LdwwiHvY-FooJhu_rTav;qj z0|H{ntqkid9$FmPid3F(RR<`sB!9=dCG+UVk)|R0{bx9lr+|JqqI*Za#rEZ~!shh#5o47RU1(6t(@ayl66?jL z2eu&>g?%{9I%YZtgDZuCu+l)a{0~n;Vy4D#N9yFNw^uF56fbWW&NDhxiZF-Uer} zl=rv>)CYtj_I`fJp_P0&H0aZ++BP@ae=nIr)NSKMuRVzkM|v zv))4EBxe1y@@y6ctgzLw;;xuw*1F>tTtTxEY-%lIMj3_*4$nkfH}-CD4}yF=@NX_| zZ)YQAX7JpqepD@`yxxiT-23SXBdWv=5Et@LEso8 zi*`Zw4HlF2vziwdH#lj*)X<6bkgSkho@h3Loo47 z195m`5gIpU_*jG#ell78tDPxwB69RnLXAYfc>7nhAKl65{}2k6-?8TZ*Yo{fpXG3MrSwaW>|)ic|f{VMRqI2=T{TIk(mO>s;A` zU4H~4&xaH=2+_t5!NR#OK(}Vyy`>r3+u$G94b~N2`;G{Cp#r<+t!jb#eI|h*l1l5I z_qOkRnTgV#(fNBya0u<6#inF)X3mG79*XmArk}0xuF>~>{)}(hCz+Op>BFVcD^I$A zs3EtM_z;9i7@RlrWNRqqFnA$*?`=vTUj_i$yvvsw zol{jt929yjGsmOQxH}-zb}z2->+9I!jKY>Aug5p6q2W}`J)&;sM5oD6z5I3JLz|xk7lbgZ z`PqhBnq%W%JKtzp#iP#Zss90EKfefR*hyKwHCkLdk0=edX7WfC^p3NSCG_rkmrOYP;;t~i_ z>nvI&`x_Duh&a#@h92)HXBL!TMv#;jCu_#rw-)T^1q-S)q~9htWJ4MVv@2hLBMwhm z#|1dC5U_(qU^g<)O;8l0N8lV;e`|I?ZW6;1H<&n}9+U5;19<0Wx;wmD&(?8+jT1x^ zYKM&$0rA9!>J?&YDpiJENFO20HU64~;$K_P8`x-514Of!^U#{32V0g0j}`8@jSCkS z&3%zi4_Rom$FXN`8|8-lyVnC|1oT>9@scptnV3hQlx@(H!fqXxN?@YKNPkBe85r%^=^p1yBnB_YnVBr{dnHVA=kLYr=DsAfG3X7B0&{p`XAdl-xes zoy>Erf;?pj`)=?kTDS#|>$XACWb%9s;xcIXRkHJXF(}#19%0l}sAMBYC)uB__g4C0 zCiW{U$@U=i<#H?}R>e>q@5L|rKGb6qm7EyqzZX4p$=KK-g2)0K_6;FO1AV2a1kl|h zCghHiFvYeL^?da5V|esgZNf2s$D{eO1kCZ}=nOmG=raZt0v4(FV{KMgkf) z11MzkIjO=HJIO3O)GzzodyWM5GZ_!E>a;pQ**{2B04UrD5EbC;w(bF3KOu3!A(S9c zH^M$jQ6jSEtyY0SG0j}RcyYBYT$Mf(+*;B-$^Qtl#mpdmV07or%tgx4o2{B5Cak5C z-9UOfgG58*VVw(r1QuRZlbZ358YafLgQ)T@)MgemD%xdMPa4Ua9>rBkoU-Fk z2Tetw+FwCMi>-vg%Tv<)0;L4x%Z#NJTp0o-kHSP%p<&2U$-JXO<+T}hbyFGwx>lkI zw*#TekR88w6tg2X!rrl8L&1@8sG@YEs}DzRvGAij%v%qJ3C9q~eUS zD|+3&JZo)^Eb=TI)H6!f-I>=G&v68zo9<)tXOo4Vkg?<*TvgDtPGhAjD}*#U5HZtH zF>?7>TAr!z)I-xaQiLX65L3YO0A)=+r>9K;m{}bU93cWSu}&`VEQknX&-eaCyo5Hf z&IkJJ(;K=tctz27XZsW>6u@)kq+&m$>%j`0R=D|v_=tOuJ6H=-=h`aCu2}Y)kc6nq zJS3n0hQLY|Rq} z92FibowC*A>!q^KPF3sF;$LuGDQ+aFr?-@Am-m?z2dM4v31-7A%-bsA8<5u#G4`aY zd(ce7#Ya=~A&LwT_JgRYr^6hX;r(&C??2cA_>+|?eyYmw)Se9#xbL=~wY2*Hd8mAT zNEq0kZ)1c317MVD!cD!}I7g5~#ZiB&>)lLv2rVqvzm*x`Juu<_i@BBeO^$nKspfPp zD>9CD8A0}?&b*A2Q8A63z|;c~iiWyE97SQ97Yag@q{JBlN-;&QT>g2y?pH>7)S;{XEm;124_wWO1o(ZeN`3_CtuQ_S2pFs(^$ouvT?62=I zCOzHyQv10qu(->Mn&}yNgXjMSmQ&LNI&v)kl{-2zAfX0`-u}~+FY)5|-dk_yl1p$P z-raW7)47u-Prk1RMfKPAN*TH4LI0A{qo3aiq#oLb6|v<4#r7M7 z>Yv^If0i8oft#Uc{mt3=A7S;?syn~1`d?$D?p|xT=D!5wCrizj+3oe}G3U<8oq4U8 z`1G`LYWIY!#qNzC9=|-JG5Lkd7PLqZKzI-yucEholYTVYT>BsIX0PXc=`0$BlyWw8 z>RL4Q>7odl2QH~LXrBADo%vanM-<+kRD9GK+LRkqc123{AOX5~ z6Qhrj;muP=PX|x_cizxP=G@j_^Y-$~>lgJ*^~xo?C*joRWj@ z8gqw5tFtAI>htw|VE5YTnN8`=+zY68)*tu71v%DEqCxc?GjhT+J!D8!GF;)ESOz-8 zo6yr_J#m^6O`4~<99Y>zEiOdi3N_4$QXzYeB02i_A1brF+ivKg*0^_cv8)5UtT)zO zAc%B8XbD@{%OPxdLV zTfhp&J^a?lLc3jZ2qY~?4otK)LIZ{2qQ?oV7{WG;f%s*D4J6y7t8!dCY}`lWiG2cU zdZadk1k*&E7smEU0Lu#313FX^zyQycbd>3NzSeCToHY^($@zYGv1=-0Obgf}`SSZC zz*=GNQmo3#f!Q3(E7p~!@AVf{tGI5N!Bs)M> z?;w4{vO^a?peyEqS=002Av_^T(A(>ricieU)q{%IPA|-3R?Z7)$-)^R+u=!&8ZiGL z3~Jk+!8Z#u=KNVRewr7QO*vPXq0%Mv+N}UrcPnTOnNq*w2H}0dhT40e3f1UoJW(S= zVba3$W~B|afBK8Io!NH#mvTU^&uN^&MEOXMxXhrg;6NtCDrI`hIZGEK&n!1OEYGX| znrSReiKH6sA{vVISk5*0&PHkY-w!PX>FJ+?FGrIDphH&_nuK65H+~h|`4A##$tp$? zoq)CIp)cH`-t@+4vyamRLEG93;fj3Lw4jv8jqbL7Ei-9uokjz`5PKSO=8_P2U(&rg zM*T_q(b3Kv#@FViCN&{96?linu_a7|-Vk`V{tX85#MHw0ED4P$oK?mKYejcIQ@*io zEtx|vXKNL-@{!jQM#45k+!V= zM~-&`zEJaAA}oJHw=#_yd7`os;&mFUC1N+1fNsg75fgy(YRLg3x;+Cpqauo~j)#V1 zRC0AG;#%_5#?g|_#6B4s*c6r1d&?qc(Q${EE>sLy#y??`H4>|}o=QpXmg~g`V zuZIXYDO&!oyi&YZ;5S3FCa%N4Yc2R|&=Qs{7=CEZUD*j)S+cU@r$*&E`t%(y z3C_cY6J_(2JbMs^!W_}c+mZ6<0NeU}+U|G8FYSF&zgvm>TcS2C_9~OX#bDng?0H~+ z*J3*t{L^2yM4(Q#1X+d9nO-kks~=N7Gqi_E90JRGC)}M4J<&i?3PT+syJfq)0IGeF zia0BWbI)!_HT>&EN^+|}gd5HlI8xb5ii9c)gL;zh_rdI@ecsZHt~QrQE{BW&60?1- zEjcBjqypTdxiGDW_Bk_3eC1ZB$Q6S4;z9=sdwn#jPToeJY`(ky7BJQinu>tkC%o@` z9e*lU)SZgj*EJvA>Zdtz8Zu0CrgLGzJEA&kDc!w}QUgM{uck)g_;?={6kRYJzBL`GeR3>cv6N~pHhd`(_1i404fI@!0Ydqw$Fx417HU!+Qs7(KFFWRT8C zV0PD5Hd|t1ejc|lL*G|;y`9~o%~ptNyctj^kQR{^+g7|EDGW1c92u+NoqB5<)qO=c zwohv)9hkm2H&brbun+2EHnYYYS1KQzYqmlZ)@-?23#MGHHYia@DuCj;O}qq#83#!E z6K0TvgMg*)Lx=|xsc|YGGr~>~5rmf{o@N*s(kGxqkg!}^-($2wV`+7y$>;qFoDScl z8}LW_DQF8LLaSX_e_)l%fg9s!T6EzA)(YEZhuS!Z0uBD3gm5O}^4K$l5(YCd;igKK znp^$QwVJUBYxuk)B0f8Z9bk~u>-*=BlG?UC?KM+)k$_{onSy{Y4Mw3ux=(|ydwQ_X#s30T0l`%EzzMn%3X5WAFfP$WwEg;v6A}Fkh;!& zN&w1eQ3nb|6M%nIs;SDV$ZuNY1R(GU`0ga_IS@#@v^WLPCpKU!F<^dJQ_j#QauUxy z_B?s+4)cY!2E$}i#Ik4;^`y6!G!uM;_8eGE3{uw0uE_79oP9Veq*p z_;Ls{X$?}5^h%3Tud|as*p$!6lsoymfd=jh6o9OM65t>LJ;F)tUqZcBP?UObYXgq` zsg>kVv{#m5wi!I4DyumXC}2gjKnma0JiplB6r?px-=0glYtB2XwzYPxu)pS*t<}Kb zQgBDTAocB_-nJullbSXeyRzxHq;N5CQyLruY3)=8JOoXh20yjJQPFwdgh}3;j?>4c zPP2U{8zj){K2_0@!CXE%(4iHH8@77-%qiRK#}#m73w!*NmftF%;^^d*RhOy*9juFj z9Ih5Dl$xf;8!W^Pj!xUlB}6MTyId|>*k-+OnY_)oWAwa_mg59ivqeB@%J7^Fvw7N< z(N5{bfP6A-dTY;9#1Oo6S88DXAIAQvJF~WH!$o7;wkx(>v2EM7ZQHhO+pOS@Z9A1@ z*0<)`o6pAk7e;HNU%mAcN2yc(>IQWE@N+0%2$W+OvKHQp*RSR+uS!-F_Cx>ToJC!Qpg*R>??IGOhI1X7LCyV!`2ST=42WC4;JTZJ9oJerifgKpgz!*NR zt7c!=Pxs(`C7-&wuCOExu^gWEcbsTAT~v7yMN|2YD9^#~jK_4CJmT`+F2RMCNIiDV z>}TZ_34}|Q7VZxV$vc-?fEt@uDC!H#7lRi7MtFN_@JQuU!Oq*jdyqZ@$@8@~Xg$ z;De%yn;t%E50`CX$NiwSh3S>2r9-IN0+%y@!}+?w;o16A(fY#EfztH{l=az}+!i+h zh*X{Z^nK>GnP*}x3})Fd^D%~AnQy@^vd4JLzkkLkGimr$Q@MVgTIQ7JtY)r#@RVF- zwd3`j_YJ2_ZlPg2x#G0bFC7uddI+5hI1mX0N}5*^kLd|7lKl@VWJX$L8K54NP7%9R zN6geZ1l-hdw zeQ%fylPe+r^{DhF=}Znv{&9Zn(m@N& zG|VJ1 z5{$3iR(~1?7JdI@3lwkK8!3fh_P6UU$GPhIRslY(1oPzhn%{E&$uiRsj=-r_$xNg& zK^0q)#|Dw<=mF~O_b-Eeo0Gh|2)c_;4ll)gM8p7ssKSC$-|e*g$OufKrDYLSeh+Lj zVv(~PNkc(OuyQ6Rgha-?Q$y)RJR=|GvKA=soFUR2vMrs-NafRdr-ptf`fP{9DoUs2 zf2StGO-ldxUb^VU_7Vwdr?dw=R%n9` zfyv6|@G88jwtL>JRe1;wUbXA9-%o$8P3zsVP66)M%b^i&yMUWT0*a@7M|Avl{O~5e zP5vU~(hNn-g+Cm~Eb!(u^22Fs^=?w+1#?Xh+d=H93xJ|>WDBa>%t@~aMmCK5(_#n32Cq&TL|l#7+e7A?yl?EtDeDf{N) zsHR{YMqc79{FpX&Vq?YOlJHX!blA!rBXTE8XlE&9{d{j^sFNl6an~!U79qZMhx=@; zB7$l5_t@o`7|8=tE@>t-^NxQ3fXAx>V;~a<@yY@e-oV{GQzL4lUAqZ-Xl;OTucLic z)rYyR=#0D)gjx7R-T=4U8G>gQD?;h4pvZycn0ubU^O7(cs>y05ydRSMgYPPs=1*S4 zJ>J75;YmQ|K7iKNaz(1Z$r4D10OkZ?mvi-Ou0ZlIgG%zl$&%9gHN+^xO{V&ugrXZj z0okZa*Plf^7L>Xi-))Ium1o9rAiw!kt)CzFn1oJoFgYEKQ4i81nI2pw2(r#QHpvxr zHtEwl$2c8U<8zuGqSN0ngYxdcNX_j9+6+GaWsNr3O;|R{aA*68s3lRRlc`wgf-v)S zC885GH2&DynERhm?vxP0iQUX|G>|;SZJ%xt$1gH0$(7cxj5PgTh=ZeSgqlr`IN_*s ztITC%GRjed=!jq$e25`r#*$e*aA16dv=ye2U~euGg7}*DwiApHbk4|RIvZysqkB~- zy`?B9r$pouTG;XS-P=~3i$Vu(Zp7slYJUWfX|CX z_B^rS`NE^8HEANGjOa^zqHmW~zY@4o(TQx%Zm1pMT6pu0jql{9XodN0q#iYkXHZ4n z>|a?4a*4GJk}EpDkTa2>)0eUWHP`g+4YHSjX|nM~RCVplKoD5q7AQM#gOH>ofDAQ= zX0RAtTS~zB%AC!T=6571QDyjY@Lv_GyW(F#)flL*7B=%N>IPgP@#MP|mZZ!cd~AD^ z0q`kz12N<$h96F^AR0el`CRODUk1^j5Zfz|y5x_pU5*>w&BXQfOPu4PE+yD$9B+>; z|E$9$ak-Da=(U3beq8GPq&P}-8Q@7GPQx=Ybv;k)mA? zLyaF&DMR*tO|84yGqj-M(kTQr?o?gFL3{<&sUQnzA!@z$wmOLb+vt}MZ4aHV?_Jea?nh6HiXe-9HY zKPdTUF6IO8-9hDICR)?{!QV(*UFj1l7)lRvEpXDMRl_#{&(NUCjRSYp*j**`TEr-J z_g+412`TU>INvdHM<8%+%45#^JC!+h;8HbTcjT_m`u7+ZrtAAL(=QCCk}q$wuZSoL zw;|ibm`c!ij6oZ7TDN9tPs$-3K@h94%fQpFj%^XzT$4u4HIIVQ&f=b1ZT;x(ky zwK4x-PX#-9(qoD9AoNwhTdM_u4axg%4$BnA}p$UC?d_rn*arNATzL5X<_fFS^)hv8_&a7!MMl zW8p9=-~9zDPqNmQ8~>Rk0IhqGlOh(AGRxG*gNJC)hlmE?dH$})wCrlrMG_$3Wy{XKiNwA zylkRoK?XuY)jHKCMyrG!)yfCFxoA$_~-XoyOh> z!sFPp=5Gw4vMKSwSd8u#D$mMv9hPmv*`3_4{!MewCa}8G>LaJumIoWhbtpALXo*27 zlksO6I5$bjC&>oU*z!>4@hEfCXD~H*bd;o-a%067aJUrv@2P(0l>H@#YPPc$z%Tddx=uEWjs6hTfktsNJ8~IN%xVr z1bS9sT3ZVz0dL5wVD2%6T~>^y_y;Jxm_94heI~N%v|d@UQ9X2K^(6#q*R&SN$x}f1 zTN@G%&oE*aT{OQ^LsHuc>WtGcnM_~k*cU|S;J7fa=cd1t`wNqrR_aU8%kYE!sJS{2 zTYi1e8EH$fVePl_4RV5yzIV({%@2k5sJ{0|(h}{=*7oGS2uYaU#^Y|0mq77UsKo#M zMWI$-KPaiuNDvXC#Ub{mqR_Wk0yhfl6%V5R5kW0bv6IwUiRzvAajy$ z=yZLKre5_94r`sCB(-VNTJCbBt1{$uL(hYmC5uEfGHR!m4{1n}-#7vneur+7K3}Jw z^OzEUx27@Nx9z&w+HMnmlQ@>vR(X+CwlV+O-Z{j)g{pZOd5z0qNXm&*neJk#0F9x| z8J`m$gZ>5nfkjK%8S%>>;NYN^#2Zccvi5v*j9Pc5hcDMvTVtgH@TSbw=vREJWPk10 z&}vSR*1hD1nylJn>(+W1lf#3R4-=BMz;PLba2-4;u9;ElmhMV+cb!?&-f*)v&OR?D zm7tPj(Soc04Q=in(V(25zzvyn+rxKSg0(UW4a{k=H9@&Wi(c2Y@rU2TDl`P)@7ilN zf!!U|b(LR``K$%Tu3!Og@P{@xHjt81+Ww|spIUED^pRAsSnn2b4{F+2*RbnR5eEX< z&p^XVJjGpx-0O$XekF5vn*a*J;>6hE9v3CA@m`eseq0k6J+gitgGO4nF-!w(@*Dot zi4CoG0-O?6#8RdPY!X~PF+26_Awbr_!S-U4mt<%lSMmvRyrnSdyq9=iVH z*+q1qebVSsm$d^Gt{Q(^$Es*D`ry}Q_t3psgGWWd02-d4=T-*21uj?2QZV*i-MPwF zK^JPXwRIL3n$*nf?6TTM?dlFOcdLMGzvAYJqFj`U2?0JewIxDV;X)bl#+aX3%J`25 zq*PKFHY4-U0|<6)((`-(qG{qi4CV)dx~4tHgVXKTG$-Oc z@6Q3V1ut{U6T=5@zIf25pE$U!WA*UV&NqUJ+krG!&{6u!;Pt{YN3wRv!j#)EQw2~xpTEpm!<=+lf=uQMP|8#%s+P$L*W*4kIRA-ID z6y%!$2s-@${1}ODnBm}azMQkd4L(dlMI^n3!#4*e=j0%Th$HJ^mU7DSzpcQYJo%o` z9{y;txV!(PESb)`R+1I7H)J9FgqmOT;fItQjH9=z+nh3`ywR%hOHKTF)d$g-mXAw0 zMhRsHuxAi1%?+{M_BHpS^ak`9H8d?w0kM8&FdaoE26d**I{2v&<7Lk#wQ$@s+8?wfdM7CiecA`>XV+azdYWcr)36Nz#Bc9o_EaRIc`<43*&lPaw9zpN6lIEk z%-*tzR`CDQ2@zO`VQ)fmAYou=!pTCb+u(4Y^orUi_tw_R1jqRi{?0iQ1Y3DSg-nkU z7>6I8@Oys2828l{*tCmA1rQ*31}j;<%7z-PZftLbf*FhvyLYh!y9!YUHjwd@;l+Xq zBH_yBI7R4%C;EO4ZuF*|HUy6Fx8<89KdU;Snjv3fQv%yii6^3oGG}%<>68tv9VR&s z6)5yxSQ*zDiqL62Vu!?ZvHq(JExWW2LgjKQ;#>g^4nb^pB8UjosHi9gSdAf`p+$-3 z8e`{mNMR#~##lM{TK=n#MD#eBN`aT5$>9pw=6p+`$lM$2YCNu|>Jst9FTXN0;UZ1? zg#?68F6>8&806feLHULy*YPSpC8@fNsN1`P*lK&4VC*Ty>=!cH|MnQuNfI>)yGMQJ zvT$GTHHJ(s)rjmu0=w|OOiY* zFai^t5O{#lV{7~DLX_qc1V4|h;784OZQ$A`hf9Zz{z0HxH&AHb+jt7DhEU`D#M~M% z$KNgHu?(ZE1^6*;j+TP#4LPP%WnU18b5_|Y`25kWU5kb0>FYBX=@EkJVQceiku?^0 z{eH*i7QvI>1jQ6pgr-zoAovDGcN2p|*B5bjesW!LTy=c?vFCDP5A!h|RunCBni_1} zp8}Rx>n&D|4O@F%&ZjT(G9EW za`i(B`1gvZ{1k$XtJ4iinLWC`+23w1lFbW`I}RnL&f$t6;O9L=)0GjCq+))ufCJID zWTZ4G7T*p*+j2fcRCwk=6uIG++9_&4Mk8Yu?@P`dA_OaRhmno`+U7>`wRnxo16&Mj z2adk_ntXfe`M1`*LjiTDylpv$-S1v5)md{^T8s0t)Azj@NO?GQd1nSD9Axhihk7ep zabla)8hu!0@za(hLtLUEc^w1Q0w~dRgAhDZ>A2zRy3SUD5to#|Y=SBrIX{PT*p*Jl zemnKkVQQfzkk4r!BA$NhW4J%rol+0`wmU=sg??S6`wG|uYC5bfGshEhGK};@e%7Ez zyDJX+ECO_m?Ghp`_87m9&su03z~9pZrV!N;;>`4bP(#cf;NvSjhRxM04jzoBM)$An zo|?I+rb^nDWJihrbDI5! zJ%^cz`F~G&Vok>#wcYdU7izZ*u>O-7sI%XYh7pp2fz2U1uV^u>TFtcDw5%?fuH6EB zysI=yw5}GfW`+cj&IFr8F`}RA4i=3^iu~HuA_PdVgT+Dib@nC&YVCcY5Im|P$h|PH^*Zc37gjCi}CHvz2knd zD=v+=O~Crg5%atImzTRkjURry?kfv^y&oOI_?T@CWP7Nbnd35F+grrRJ9#^>XVwJI z^`#SHJLMAr9vywI$)Mp!DBNIU!Qf*SSt>m_Ih;B6{64ogJTKod^LLmVPUAW?IF!m; ztk3TYu4K&vj+~cmg~jJPH6nv8!joedVlJAKpg6WCPouwKzD!{9E;FKYwrJ@xmdMO^ zQZZ8*Z{c>LmJaYWv|<9z1qqcrUxCcCSn4Oz3^E#a zW(X`^F)~hLz={PmB>`H+a>161TR0Rku+u}P`d`eez53|2xb6b7!yXk{KJ9W5Zr8hr z$;P|3(YD(whZ|pxJW)+o6x?OTjG`pU7HQV_O#d1b>cydXRh1Hgwl9@ojO z3WL=x3+d|n^43R;a}N+|7SrWXegO;RW-U`u;h>QR{$4b5Z3sUK81OJ-Lv!^KYB<0# zxLsyA+g9q&g0~t1ovqK)VmfW}O{K?t@^1>A{)AOaR#4zXZyH01q)7ihu$@1L}h*m0W66ho6QsfZ2Ce7h>)Rao8u^eYArtclQ&1wqR#<-o;S#I}Aeus<2E}*igr*RBZtVZD!-{ z9LAr%i;-?sJ0}U>q$}yI84WLJKYkS6pfa8wz~g2#vs@OCW!fAZK7SC#!<(KHyjcc7 z^I)!Q+5uRK%p7=_Vmx#U%xXX|^{b5V1k2-hco0_o3P`%1XQ7cN|E(sXVZnM-3Zf0rTHQ`cpUJn0g3@;~rr6KH9 zC1~p30XWQT(xIQrF!F^nl7hl}+r%!%bw__0G3NY@XiiBlTQSQACUm_}PBxJ?@~I+Q zfpM9Upl+&oIx_?#u~0Il(?H)f(xXOtbX)9Q*HH5M59;cTin=6x`gm0i_a1iZ#~yy< zV@3L?%NSJgC*tZMc4=q(=vfOZ)K(RO2+En^(Se&;YExImXNqF$>wr(BX>$N6+SR6! zrtN4qfB#%(XJd6#{8ObB$3WR3sObI~t%ZXkL$OwP_TUb?Z;pGitJujHi&_zAet8I!j2?%x5#@xC1LcGo*>TIrGNClZWWjQ_nc7!2)d%FJU>q=rb|NJPWWUoZamjcHv))iv(&5yja_n%TPC)udn{EntHpD4&*XJ7&_&7&DWI0WY16w6bX_ja2~I8#KTomnsrRRW(GiU<>-H<70s80&0^ zu*(jrAAUK(k=Y@_-`h=y8n5KHK9He-MpsD2vRv0K2e6e43M$y>Rc{f<7fOcjG!0m= z;`<|7*_B6v3+cM$wXwR`hMB`Q&VuRW$DYKT|&-9bZxY|FxR1 z{Z~CP-~Z$J#ZQ%?WQhblD4K>^#+1?;7wCQ-v(A%ftliV{#>qnW?@H4-XmijCZdfd z5)l#uT+t)u&WM%nh2$s!rTnfI^vFB(7QO|HJb)^k1TY%h2wk4|g4I@zr$YBW;Dwdd zP?y^GYZL9|#G_i+8Z66(BroG%0R6E|!-6OfK0e@>>IQp@6;?Rljv>D#7zIMEO2mv1 zjD#RsKj(#Kf?}kkCWJ%rZLQu)ofIN|_ZW&xwY6;o$xZFM4h8QU53&+Oci#pB5pvJ< zOqACIAm|XB)-Dde)ni~v?au*IxSUGq`i+cln;5{EML^fmc#Lxl_V}sw3{@9NN93!0 zynJeA>B^el`q?EP4@nLWvgh0C63#hytQ!vsD?Cfuzxw~BO7Q-{m+DfQe8dFcYdMm0 zASb7j^?c2_d0O*7hwSLSnf?v^MlZ~} zOPr3f;iz5i>KZnlx^2PwXfH>Y<$y|kVK-K8Abp^Ypg|A1b)!|>CyK|n3#}7oULsV5 zYRQ+v0<#NfZ&o^=>HULsrw(X4r~>h|&(`m)1U-Slf0no4bG3?zA;>vXz;iV4<~L*Y zqeMq)dgK}7Cm8nv=IKpVpyN!~;cp_eUnyA}r<=M7R!dw|4-UmV?z+QM4j}Q?7A`Ao z&wl%#;IyuxjmZ=|qqap;HcF$f{wRxpM&$TYsP4pMB9XU3%a*2xtndE91O4L`z22CITB73O1JhsKwan3;tpj|CV6%~7d^oG zWnV%5k_JCJk!B9|Z}H@5F{wkw1))DD1l5mTlZdOfFGnb>|H4U$lpF-X(mbaO?CS15 zo|CCv{2l)|JMU*W(`=qD$fwOiuQDrFMU%e?&EHcVfSgkxuXh#noCcSA-r%Mv9lwJf z_68l%cy*`|rve`|zmpz&dW4^m2L!pBW~z8Hv6_yLdGA2$rP zmxi1FHIdl=BR~ zN}}YCg?`nC?Dls0m-Yufia^hchXk3=K)k&$9yUV#RbsrVw~sFdvn2U;UsLyct(E;0 zTVOT&?R1&Vc)Y9o<9*%j3*jD79t;=EG_~X&nxtq*c%P>V2?E9^P@z07wt*4(G7BAY zxe{8IZbKnrsd}?qQIj25t z4xy7_51|uLNCRVtdi$~FM6-o=;e(xiC5Ad|?@Skt10FtC1{CG?{!#QMqAp*on`(-$ ztBSEJZ9Y*x>9tP%@ymDHl>Hi?4~Ce*$GsYCv3VzsRL)==6S1^pj#z=A=u*b)oT%~0 z`4E;25^x(31hRDE9jNIL69$=M9QQT`LlK0VG{8KBNuz1~frfSVWW0KI7Z(DG)c{zU zEV2WtNEC<(@xiRQyG#g}Fc3O&uWtu;3F3(i<)}aiU&qdG*!!k2yU|DzOBQb)scxyo z4vyXf=+B|z)zcmxHELUd4Ad-95Se7@YDld`(x|BDq%>mE|6lX;#i8aj#8R~f@ zM51E?nIj3C{<{Ddw;l{FbSdv%$e0|0TyZL3!YIj1%T+*v&)OM{8)Ef6`OgV6g;L+d z=H6)vpZN{8_3RcC%n&Q_M=a{3dA1U_^_>JH9J#a91G;x8Nl?PnUR5w(8U`#jY9eBH z0_qJ%yqp8y;~0B`oKnCWGq^%I`AXJx`&i#oNdgG_D~ctUFswwUf_SGaOTP@83D>H+ zRC!;-{WW5l27JeYr+mD>MU<~D!Y}5_5Xi_Nz`*CmkELogvud^^{n zsp>vs$27nuETf+mc3|ohd$AF3td+JG(n-h_nA+u%sK6!`-wvCKkBRv#l787re|7aO zpoC_gQb8=jrulQ4w(CXrX|~?WYa6kUh`;m8zBZU>V zfWG)1xeY<#(E!n7ArxVqW+-@}6MrAW!!K7!*GD|XmvtV2SY95pz_6F?UIBLx%&uoy zOWs31ubK71g+rb3`f%fv&me%jH8P1jmuzslS~96En38<$u36=yJuDRXS6Vd7pp&LiP2+b$Df?C`LF zF0>IJYS1zaS3-x&`YHp}VN3PL3WWY5LgT^u{^zLw54D?v z>HmM^{~y$DU)4!F0OP+a|1TGnfDGc_Rw4`1fo&FE&$G}VT1B>lNoQ7)I8UcMM=@ZP zu3n60Pn^@)p{$5;z=(a@4oUg#9IyJu=q9x2m2hq0L?^WBG!exq(5a9B=Jn8B03i0j zbN%dP+fq~GZ0E_nV44$84q{MTcip$t{IIavukc%Km2LA1p2VRHaHw$^SM-DdAC^q8 zFw*w?8Iq{3d0uSm>igN_3&$?(S%r(tl=!Q}%4#{o?aZD-$s|QRYUR{b!rU)T)m%yx zu}x&%+(F9nA2La`8UQQ{ql+o%TwyaE@DCGiesRW}x?LQ6Q?=s}X@h@f$|iV{L8wJ<}$wISLImGbiQ>*w~0p?mPf3W&O1Stx>zjP?sE@8g!jvge!%S!D~Bvhnl}9m!NCPykdMk7Fy$dWVjTSObF6 zG4Yd@$)f(jjaF2|q)p<1S25Z2p=&W(x!9!7D&{~VgWYB(Ouv?J`0+aVwfnw(AZg6t zKpcC-W-6tO>4q1wLuU~yZ1s+$liNUP^RWh81a}@n$@1ujw}+N15fZSXd!X8%>if?< z<;)aUeZWDCc*4chn31ebsF%IIq^*sml?tr;YHm|`bDtHx>+^``5yu=?TM27d4ya2> zCM7{-5%YIdC*v&@kMeqxRXkdexMzc_?XK5J#N6!~*_ToYt+JyqCg~|P8t7*^GmY6s zT!?tJTgUBgA9%wy4Y2&6sMI{6vCU0fFf~!#58TW3sgVL|ufcILWI(bJ3ozFt07qhlC9lzwZder@_DfxZFx zt32G)Q}0JeCyMc@|N1}v z89)BNO%hE1+V=m)Sm(CpcKrYK>hJao`&NO}bpA!FJkcs3oGkS1+PT(tf-=#xzNFEv zBQrNf``Wb^6PZkstxvurrn)gye~Q3E2=9MKi~oZh-`9I+KHtx~!`H*cj1qP)nt66l ztt4quVw`q)=7`=K9cot3@=o*12`UIis_j4p75O$xqhn6dg?eZ4J2|La3yiuR8?!)LVKp#xvf6h zw(dG=rLlwNss0W=Z`w}n&iY+A?biQ__bS_K*L2;sRjbIIA}&FpB=VrLVdp#X2i&`L zA!q!be?&H-V@LJdVZu#z#4g!Ylvdm8Cdz1a8q^+AOZ{`VyXPF7;LYQY?zSoVV%4Ve zPQD6vq6tlXe}0)oBH^0jm#F*!Y_L!Ab$3xA;lQ17CykcCX=jHe|IF1&rTj@(3^v$X*5ofoK<`txAZjNeNK z=$eiGjim1ZzH}Z5^#;2rRor9e_WO{MxaV%;Cc4LGzH@{xv7rXBdzI004OO*=dg^(s zUIX3X8R)@raM8Y-I?UJ2;i3kN6T;v)(RT3e%yB8`H<>#)mZJK?Ji*=_m;!B#>|wva zVk-IaFVrb!Sg3=RL2vq${8Slp$FW*m3dt07#=oc zF~|_fOt6scq~HF5w6g_`v4jhJBxgCKNIFwlQWWM*G&y-Ay9pvZ&;kHW3YjX$)Lr10 zZE!aYDpP~DOyfN)1!#{OmE1}bdRpZZm&qjSB#ub^eyxa+mnD#m5VE#qXFKNGYGyB) z86^J#rmG1M!>IfZ6?N4wnYpWdTPw;L^bT0!!DF%+3+EFj`uIXt>5$yKLo6_fteCYQ zGlX~Rtc?3qn1g$j=pB`s3=vL6cBza#CnrL8dxG0<-|%QpGLlJf(BzmDlo?^0 z`F8hPzoSJMy`Wi^(&e+x{H{@1wwWVE^e=~h(j>fDIJT!Gbk9h1nQ`Xwjf=w^=#=9O zIr|>s)>8rs3+g(~9JkC0Z$WGb^)XOC&fTebRDq7tMu5(ZF#VoMXeJ>_FImF!FO#qS z8GdC16BC+PB7THZehB&Gho`W#MNo1lnB-q|n92NHgE>7;rZ-#GdBk%#CvWv39f51= zqIhSlLOrFGf4$Og>v2(jQKEP~cL#)n-KH{=qTc}pGsc-g4AYHp*x7+;J4DiFdS-^U z*cJ73_6G(Why_Fhc!bFw%$7>vuzfm>gx(b$!S{zFpFEBhydlj1Bl($y%+#Y^gUFx> zO6r0<&UojRMHFyg>GvbhhSSyjoq1Ldx|NywEKH*EHL#6ZB_@mx=SI@U4A89w&QxL~ z=Vuw9(8n^sRGO;3TS>4a*Vm0?aYQW({RY45MK1a<4qt+u`6K#)5(JMYwKb(6=J<{D z#Ffy2I}v)q0Z2y{D-1}Ye?!RSHV-qdU9KrUpTGUQuuqE*ywAl`0URL$yi`@LhncOX z{|?un-!ZO8)r1Ov_bBCNw}8aL=@gEf7YtZRF4-YvHjNa1L*~O!7cxFF!}CCdyfn@x zJhz_Jth`iO0@Abk7W}L(YzO#5Mmc#89;0aw+xJ!0Tgw8jjXBos;@J^YF^_nA1scEE zUo?|#8w*0KWjbPhmUnev5GVs9gP?G8DLDRKa{dFQfhy4&i?Qdk_d zKjXyC;|J>yu&jF?>?s>TP(;>dkO4G2L4eySz{1=s*^sX7hHt|fL@2^9b{ zA4dSHU{Jg!I?9kB$S@@oJ05+_nmm+vkfpi2pca`@PKw}HvtFfCfVSj`sm-qPvXs2H zmFPh7^ZY)>y@N!79bDW;^WI)L4iEX)9k<96?AuJ$)I3%oEU_x3q)t=NHsq)9Gxrf& z0npwHCRgk{OnFp4lH6~rpZcwFVOZF9Ia^g+&;|r>ct|C^&y#9WMvzG!CoEH2sPF>L z(eVh!Z70wJO8|KM2u=$vrYnZfDKc1rmlhL53w-^Rel6xzWnXsocuUH*udNKB!7@q#~!=jYCHyb^}oz0`sY z#y|OamIT8vszK&CxG604$P>>WtprIriX2|7K#4ae6`-vkUBHf~R1E>;OrR+$MKjI3 zJ`SCsK(}qqqUja7{d(aX85xn2Y$6ayUW`BeP^h(t7*kan?G*=JfnZj3wmzFx;c}S9 zKZf$-N(!J;OA>{Icf*B>H}8Ty`WI;qZJQ<&$iR6MokEs5h?AyzQ}p*%)b zFMCv$KNSO{_ZWhJD&0p4*{o zQdI}dj^uHJTW5t`+=xwd?US*Y>!dxRV8Yiz3uUrWB~%a@4p<-}(fduuVK?DThyCvM zuJ0qUv^)7P(Zs78LN{!4W?6Sl9md3|ZQtHcw6Ask-VI7&u`iF#mfkTrYFa7>^g%Q}%1K}oS z)PlC$S3c5~8|J8-SA6G;-_u_e_Y4rBJQ^32)ojft|<2 zE98imHs_L(_kv!eQDI1gb6OO01@PE=rg;tvLhQN%H@ZxkWX5+I8E)Bzc2>@*G%1uC z#qSKbj|aL$5@QlMdr|%teB}5lY*%>~9)#Y?FaF?-$5dICQ^@^jCV7q(sf?6KrClI_xm)2smSM}dSoeLAqN|&JXDN-K&%}T7y2)}32g`HyIr!BZN;0;lG?H8`RZ0iF z4`{;?v+_C$zt+~f?adNN#EQKIzyi_AQ-NXMSNTK>ZhXWyKHLH?49v~>GWbHv_n;4t zxp{vDKt}X;$Q1c0ghRk9j4c-5c!e`^0ufwgm=Kt_oLJOYMZk-@Uae#Xc4P8-aUifx zZq;dFqnFxXv(dw*&Cz$-t_sTp9A7~U4Y+QK>lQOjZTT+Sa*YXs;uY|jx14PK=_=gw zVU8`Ydhub3jn_1nA?sQUiyW>Tt?k@5SdaSXy4uF=b7n2qtr+-6%t zV!kuR7ANP4$?E)EMof`)qVS;AnJ^7#)`Tv^9DgTq%Lm^f0ZK3EM+6Z>PNUEpdDW+{ z1;1sUB9GzxNDh2tZXjgAUwy#i9JRmVJ7;j%p|1Jhq>@&#wfbBYe3I0q-+V+qYYdIB z7YmUb=k*k3SS4a=#xXc#O-#I3s&=!nB0=PC(19okJ$m!;{hM0{@$@b_wz#frl%xkt zM%60ov-)~sft=BBJ7nU(8QKNKd4fu@2QM#Ytd{0HrgSP&+jfUaOs)O#D1~dxgyCBr z?f{>sD~LB?ff^sm5PZp@+5I|`t( z28oM|IInnx_O*5Sc00nvGV2!ON^_3l1D0AdZ<6irE)SgC67Ld5PWT+Y7r#%URrkE8 zVw<=_+Zvq+Ws)PkzVi`wKI07sV(pCn3_W)AvXk7+CmF-tRb7cysA2>d1VojOBG8i8 z0+@;>@~V|W+zja^M#~@X^aSwfLyv3S3`o4K%8R2xdKG~WMehQeO({0m^uUxQ7Vhzt z)q!e_9``{pgYZ#a(TsxFhl?QCcNmQ(jjfacq=CMX>)8#~D($sy zJs1TcdqSu1OWDaD(K4ibX9kTcRbm{NLemI6>WgoYS&;BG;*X1=iydN8B6J<$h=9vk zWof*L$i6KgJKKUbNrSf91?_=U)2Bg~-fEXAg^a-w&uJ>-eKJl7@UN%j25oHQKo zz$Twx#0#?2adQ{V6jg-ha;c)>7*WHgi<(YQed^#|Gt=m8!7d$FnS;C^_O{{vdCUQA zn8eyA4{A-e*E<)*S*3@Ie7Q2NMb~dBm*qSxg>2L((|9OqeJ|S^T(x0E;@-P#U$NFN zn7Y_(Ydqeq?T7CL>FuO0dGJ&c>Iy*6Y9gf?sJ$+52OSLEO-V-c=vmqdF_H|Pv(TxJ zrEwvYeFmVyiY$hdCq5DIRK~W5lY2Fnqag}r>EzMQjXSy;IpYW{%OQ{@GN{NjN=Fb2 zPsx?EAm3N-bsXOOb>h8=x@ zIN`Dfd_>8b64k$fpVb7|gKs&B7(fz0L0^ukpRdU0ZP# z)GoX7OSu5a?7ya$d89l)_khCL^(+QP1qj+o`>HOH^7l83kko{{;!JPC+J(AilF%snKeONZ<4cJAkc=|VM9*MUhi*imz(j?)b5C1 zqrgs8O}d#4BPZ12$*PS=3_XF+L-LiTc0mn zb4BC0^1*r4vioVBFE&geMhFGN_*l%g9!jPpmde0yh3dMpo&2Ad9d+G5&VGN#zr^G9 z8lvIq&^4$T_(Z!8_n|S;^x;JbS}FJBZlf|C><2Av&CA(TxF{aagq_c3)eSLcZ_6h1 z>F<&DMA!1vFJY#rx8)66I8g^R?|Gw6pt-V16I2e7@*wXz95PShK!DZojI1L|6DmV*}D=r&I z66SM3kO`Os!GX;K1~aI?9Tc&OScL>b4$|Wh<4`w=YaC8C7@Y6Ja7zMaJYSkf(MFq+ zii8RDB^pFEuYM%MA#;QIE5&tLq(li@!^>VNU4dnMMuX>WlC=}2&_g_Lp2~dex}l#O z!l!V9%M~psHF9S5ez8CmWLtwlEZFbBtGVZqnBg^v!U<0J(lInWVc7n_A{|5v{nuLc zpB>elT>rDtuvX*$)y`h)7qm?Wrtgqk$<9Qy$@l^&Y!A{&=0Me_w@qtORqz`*et!aZ zM3l5F>AIm6u&fn_iMjrsV8FWp!~69Vn9twVGvxIq@fsv8XiV&R;YM&K@RCEv23^YD z@ta_G{&o18?jZB%H=-@x&+cM@eB4Oso=!F3^;xT2iuJ2t$4MWUQv~8^6x|zR)rd@q zV0HY|yOo9gOO5#0Tg9`z7Y%h;_F=-lDNilF#b$L4W!>r=Y;{@2oqH?&Xf9B*t`=*a zF$Ec;$Ipv+)ZL}?J0-kqCfYBUmxw`Xg3~b51;ua4Q=RRk`9el@2t=s3;o6=m-l=$c z4wXB@jwiW2Pb3wWW1{-OxL^6*F)n{NJBh0790-=2L|Uw4Lu7!ubYEMyS`436@Yqxf zBGWm^>BMbV+8=a6lo>(WwE{MTD@ihg6iY(aT0mRH-Ofa6+~}RoM`D|ObugCQVSB8` zJEg$2#=Q)Hn2eF%cedrN+e*biWeU^4QJY)0#~r&!2RxBP=A&#CzMae6C8X||VO`5t z=gU_?vfI4~jHcCMXY;oiz@ggz2saCQc7inT!UD-c44TGpOBXP|7?E_>ss>IH4e?XO zAgxPl4f;I!m}$rl`S|~^_vZ0b?(N&Kl59~Dk%S^dh76g921ACBA@dLm$vl%WiVP8}uwv1K zMCN%6nWto)XHqg|UY7T~*!SN1zJK@UdEU?S{Q18A*xPDduIoFT!*L$R`CY5)_+j&i zG;_3>W`=AaQLa%A-?cyRPv19mpVv<5E$oqgqEs`g@o8XyD*0nt#fOvhuYa^jXfA)w zi1fP2vip|#hO(t&0bvHi@O0|*U0&XMRQbing`Yh|@tu6U+9x(r9HV?16BVXl-$hwU zZe;%`sBZdu4bG5et)Ot`(E67n!J9+JdqlOoLrZ3}K03AcEDYS!uIaU1oZUFu^15+@ zwXlxh#j-K z&2y7)G^fZY$YWP;UU2WbVO&EY)=AS=d|$?1{oyg@D{l<^9Date*}k+4nf(0q>b768 z;!}ag%_2F^riHb4^6ghuWKU;VUr*zAqBr5ttrk!In0qaKz~h?a2R+6#6_4ua8d=P6 zMZkCGlvk~jGyEgxsIj&ucy`7=6lDJVxa{HjQ>`IaYq^UD^Yj)6U(vha)$ckJn4cj^ zWMo6U7dtN{QXIN7%3o&ibb@y3hr98$McwDjEO!J$94gPt-nf{)sla>uN{kNFAROpxjO7{9d|kuQ$7`9@t8d6k0~AH8oH-1jR{qk%ZrXwTr49F z(Jy*q?3Z`WmO!bRx5_nQXyq#EiY8|RA<-RK9wu+};1-w6e!l1_V*$DdmMOp4;Uz3rZ(@Oj8bKU(?^y@wC zM=Tx0Zxh%3hmIS3c|7NFxV7hQq2RsipT<O(5g*dFkC1w9i??+hb^kB6p)SSABf1OC2 zIn(Hm&6eQhBunq=b8AKJRD^UU7F!Qyw#WJ-V?CHW1%{Pk1J~1rwcMu53f#?Hz28-4 z#S!?-$G0_0PCQC^-u(`B0=GsGkgGKM__FWzfXZ1;ffIdr>!a~!?^lOR>TB=i8>?+v zryV}_W4)t}_Yqa%jb-fXUOJYAi8kfedEb(|!UgApMz4o2a#3i6M$4sQ+jKl-J z#R`S8c1hu6&-y&wzPZJu>4I$>IYqcFo^j)n&8_+eiH0QUr8KoAzRt%tc}|443v)}_ zT%i<+dn*2Rdu4l~oz%QFVB9VBMdZb20XX|*JmGP{Ye#usf4>zV*6i$eiS*v!wkkzg z>E^KSXvpVR#h=M_pNn02*mV9;2-UGj{+e*!@f7audVBtc{8-17g-5#8;zg9m7CJ80Rem!u7NR!Us3x8uBgloUMU*a$9*hmL(`#053{cf z>22(ioe*2bX)podbOu(NTHy&}i~L(-jvp^Ri{N$h zR97-l>3wGNS!d7*A89^e79rZjY0MIDOvoS~rIx50`(n0dg~uRO_11q$+Co?U+ZRg+ z@(KOFRe3&X8AZT{cluVUj2CVN%BDy~+x%MBu%;I!BP^iL3Mx3`9318DGT-9L9dmrp zf{|Sz+{q=g_R2Z?x9lPBZ~c%9WQ%*uHfpe}l71M!Dt%Emr|d;AU!Vh;(@o1)pZCJ9 zxxR$@{kFNMWJj{>3>P(4ZhNj#;$)t@J@O0_HaqjO(Zj4?-HbFCs}OJ=3`yY7sKM@%s@)- zJS*My2WBPf4}vRg#h3zZ>{qi!OKtCz5}!O|ftFdayKsb3M&3}eFC%9opR~7;wf9bl zJg?!bfYbQlYL<6?Hg|hTEt~Re&QZ8{o}*t1vj`(G>=G;M>2}qNro|f! z@jSN_S~g$sbBCaq9*-{=*f$c_Q!Y51Zz5hWAr~&aX~Qe^oKN$O6$v%A!FgU(#TmG-BTq=x^14^ZOtyP@~cX*rPfI${|G_%ow2GLv>S!?k8UJ+my%xi zBlWuDaT%Hgw=>%hrjuic{&*S4ZWy?E^y&L1HBkf2-HHOXu=i>rfqmbON>b`a{CZ$UgAJhznSc!4#af7vo+Mz!tDSrJTaK6O8|J+@Js*JSxu*x}mW{m0ixh|nLF6zR>q zn0PKN)!XC`otnFTIvBfpl8`E;)|B>?#OInO*R>qqp3NcW z_cMM@yI7s6XXGUF{m92Fa~THr7H=4KcOH9kOtoW2VeM_+y>IU%##xjW?u5EK6H^ho z*VfHSc{LtZ>d?AYRV|%sHc&L}`L;Ts#^j~awW2njRyPhQg3UhoSel=0pVqv(nTS6$ zCi>OLTv2G4(N56(ZYDwXdU0@OXdvjf7 z9FTmNE^FQ`oqgu;nfPZMH^>BNE9|uT>O|f$VacwLMVQ~$GwJdR3cn?F{sP6}BvbE% z#J8*|Yv1!2us!cO`}-~F^|2iu>l~zpbHA%xQi|OOUam$rTkBA?)dX{h<6jG|#w1x@ zyB2A#(lmZGgpSsTSJiXyc=xGfDJcwz>eKVN&cd=JzwcX;mxrbtzW2rW9h1rCX*w6w7g_f(F`$u zG^N~S*Pi}5DRx!z!VrUrlR=@d=P3;jO#|!RGaI$~%B+o_uj%_Q9SKYMq*9$Ea+e*K z)pX-#pmZNL07JbH?S#QkKckH{+cKLCoO{a}*=ct&YOr_#Pmn7!SkAk6YiXIYD7IsB z<4K6{uyeuOvg{d7jTIw+1+%gj*vHxKFpPh(^C^F=$vc{lR^t1`T<^?qZr5?5{;>o} z+hN_rjvwDb>lF#V&e(@Z4d0UbGRb?!`|*oJQ>(K^n-r}w>-v6^M`T?@8Jp%YSilaSR0=FXe`oVC47ZSCicwZHl8*wPq#Im zT|(o#|0P)o3jecZ=imzswc#5L%}kw-@u<6)IPZVOp}fsK3$tT9T9zo}>kO|VUvqfN z%+lh%^LbuArw$A5;kMZ2Jv$k_ox4&l!Uy&$n=4xqbrY3g- z?s@y3lht|nu3+T3YJYu4;#DC&zJoT1|NUoT%nuXCQmu_k8Ame7Tsz{a%E=pY%%tkn zX}zcPo+KQnNJISmjIW3Mv3@N3(d(x~*3w;PWT*&D2&E~AuAjK`p1qv@{H$-nkkn3# zovU4c>EN){;*M8>_{>6SF8nx&F(%{iVg&#H&;RubXh@5Qh|J>J-$h71c%+JNi4)=} zh$268<@4b~1ea{0xeZEej?R}ZRz%yd3pvfSG?WVZ;&INmaZhLrZ+Y9Ks;9Jti!Bt@ zGkDGyj{3B|x+*pq#$Vz*x6)@C;l0+aHIhuW^{a4{X|dWDznU0Qa8g-vYw8m|?Lqg) zs`?9Yj3=#ibCWgG?r#0`c*&uetc003ewg5rrqAwL?VEWo%q7_u2VX*zguV7C^4%F}5<@oLPzA-aPuQg;v!0 z{(QdM!jMSw{*%nt=li=qYBndL1IQ)aJCkpZFcbKFyUAu+|3<)#Z>yl+JWgz}tTRLU z?CCe?#^z=^LF+!4-Wf9dOq^ZQ?`ESc<0{udo0z?7nCy;ObM#BRgq5{!Xu4HzMmA<{ zw6b#J4}#afzc%(cT-wDdRhYNFx}7LFOcz7_ed{y<{#Z@G-*W^EwSS^um~*9e6Hu36xb;H9O~&U+7o`2U#_^}!q*(b zlc`_q=x&c$KpFaMO~W_sIJHX%S@)^lT~E)p1 zsgWh7<+316P5PMFiDhhyx{8G6*MTTBn%`z1FPM_8VrQYW3h&sSAfW;qB z_WKi3nuj|fsj65d+}*eHu6$KijZ(WDMp&(?GjEiLB_L2} zXHb|Lob1*zvdM-uNZwSQS?e|8>7sIUa`N0*pf43L(}rc&O4lBz=S*hY%QSwJQt|Rq zDOM>?(8eUwq;hv%(J{|YIZ&<0k}Djnic?TA|3UXL$+Zzq0>4wx>o}<@Du(gmw`dce zi8Yjm=-GZ4;}X`Dj`n zj@(AAs4xk+k=NW0)Zw2!pTwq~-(*rx)6M@8FXB`d%##1|(mQMmjGNJu#N}rX*LMZJ zB(L^YA!U|a$qW(?ACte7cdzG#$-3GpBBrzXt*;S>AI-I{?j>k++nSE?q*Q!x`3|)h zW=yjyU59^dO^)p*`%oTrXIH9v4ZrIw*6m>>{Q2NWv~pee&E=#*G>KB|l{X46ImStB z%h!6U6qh8U8}7d4bmapZC#`%eH0qT*57W5^(<$5-@vJwuhMOomUSNmYpzJO?VOx@K z$1%m6-UVM%^O_GlPRA6{+T0wWH&-cF8(#cpp?H&cyg(RTxx3y z%~SsSTZQ+IGKP<3jV1~U=c`iLZoi_MHz=?fT+i!NCS~=(E!P`4cgSGH-0-tfd&Lje zeyHV4K3`X6{rXWetwA6_%fO#BOZsj=vD0iggT!_fF{AZp#jerbb}!gpqGJ<#70Rw` zx$e$8+0#Fi9&;H^y5VtKTb1AqnM{iK-HlOlDOYgHWlFLFE*bYnq10R z?~u@teT|L<_H;T~)hp_BI~A#2=P9PX%UT&^Jl)14e0h;7liQfDFu3|~dOD>_^%Ui* zqvKDR!-Z$#ol4vm@l$A(qf$I=139S1C@n*eB)vjga1xQ#7XApy?eAm!gW#&9JY`EI zKQrj~Pz~uixj6-vwGdy#Oup9;?>D}D*5d*N zYy_z*u5xoC^lf?k?KnY+J>2T;R|4`mti+iP%M-O*lZYGRf5H5pkJxw)^tQW8?ctm% zeRj`YeeeRcz4o)Wa0n+_gaG#Nhl@k+Sx#8VgrcQdvH^4i(0Er^C1 z@iXuL_@sROSrudptq+tjA?t^9Dt)|zPS95ux+-vMtH5U@OjI+d{szxqES^nBRf1V< zGs}gyIJ2RH*Z3#!JBtzVC9z+)OXpX>Mw0pZ9}yDQ8GU#V3U*mIws?nC@Drv_iG@nX z7r&P2yTyHk;5E8Ym5p+~A<-SaHmznT{pC7W`(R;J+(%1n*aZ(rZs zDT9QNOtKwFT8^fh;n5esmAN5vA+buXB8$z=m$`x%bBK#tU`j;)#&U zB`!Z*`^{qLJ?FDYHafvQHvGBAFbZtB5CAmsnVW=C{)rkViXjlLGM<_rk}>q;_$5~n zA0NN8EK}v%jujK)vYN!Yjp#fUb3OfoFvotp+Fv=1WPKFzU*pn;6Txg?phDxZ#&=Y( zqAsDi@NG_uPwePV8{U0JCv>7Gs8dBs0)H)ZtW|V#EP%fYS*tMbFULfstYD)hAn}Mg zfBy=jgoOs|!iCq2ID7TuYj)znXOBZ2APGs$y+`|d*g_b@SR{CSy-rM|^1}Y8vcy`K zvyCo)2}a>Npcqn>dtku!+ouTplvydUN~k@SzN`4&N__tPj<V3kK#|w8JuZM+IC?@WpTCarU)*O5754TR11RYJqjR zyVN6{Q7d547Qd;>ym^bYEMXl?>I|*UJK1O9^kS@KA$CjA&(82Nd1bzh^$%ZVpHIH} zE-uwyx+f{KV!NsL0s#S5X+R7U3u#ZXkwue+TmMY4xaAn*-lkj#Rw*#S47a%q3mJ~< zT%uGFkDMxX%ZkVXCzMW@fY`(-gl&OX&V(KYgsJf0komo<_eaV+-21j>6BBVcpN+hh zWl+90uw?D#@L{8ZYNAA|@e^@$Ix97S#}%7D#>U0b6%W}eD=R-N)LQPoo)y73FUE#( zUvlWPE&at50U%d1Drm^L^LFGiF}?HG`TktevwK5M?JVLSSf62)W_sFjHa=4XpI`?i ze}BCxpX>{^ZsQPnlyR>iTc|46+Tmv&0NqU|>_DESI_|brvXDBF2q0`Vo_Yd;26MK~ zB8SPJp&VN@Gf_WK{t`J;F(}+_NViWm*qsNh{KfL;M&pI%og#8xo4Jpaqn$%6K(pa>fZ7}Ea$Bf-i zBc$-cIeM?`F*MhgN~+Z}z~n;YsNQcL!bti0Obw?Sl)7@r(H}{xV#F^6QDugRL#+U_ zlI2F1*2?^zjxk~_+f~;U#e`)fR(W=T1>L&9?}OXqQr?>gafnYYE$(u#v~bG5DK_ZrgqG@RDbkIc}_2K+tF4hTxTmN=lNng`6?-xblFlh>3Drlsydrj6g>ffD8|`^uRBdkWqCWO zCWt&j+_f!Ugx!_T(l;7G`;KnCQ@yXA-XAV;nTm>=PDTgEb5q=MzdU|0y~vw#hpY6W zo4ydAIOh&Y04Y5H<^Yntius8;9O+vnHU5|~s@>k!)^_S_)@0o?#omu+ieuDQLT}Kl z6Q1I%YZy*FD{%igj_J<5I3c_6p^xl+&3MQX%rz@3D@ zn~upPi`$Kqozn5c7#{Z@E^ml6cH=X!_>Ia#d;CaEVXEh2G0OKJUR~Oh*cjq}=JqH! z-YyD;QN+VnSGrE{8K@uNfhlwxaH9>6RP9M*sS#J+a)UmDIwsI9zC+g3-cXLYFp51Wg zEE1C5h+^XGDnx2i{-`iW*<1{S*)*crLzMmbh7t)|14Cemwe13JCx0*n_fn)s+$NkD}PVVZ97K3(3zrgR>&bz#A7Zg z2I`I>u;Ive`XQgjM?CW*1zU(*7lw zQhgrvZHF^LeB~CZr3J%Jy3;0mg8VxaG+Wi{sh3{_agNUxAy*2Aq`HtAg``tdQ% z5Ey_P*tzHV%B=Q~&t(=)YJ6=l^4VhXS{nfDd)m3pm;xe)Am8j_*{bqcF-$|Nl`EJG zQ_B=@{W;2Fc30GA$ZuyE?7QyBoqn(l<@nQ~&zB4!viGz@O~lVv#psL6M(wHM0c2O* z2z?Rs2w-1EgYR5UE=J)kgie_vYH9)kD3zP~%d^xo4@0@i=rRA8gi>vPKEDPFBf3rq zjkuc@-U#v1k^D>}k`>%TQK#c<-zuWCVIN zP`DYZG-WF%-*yC2wQ*FMFI6WLAty1B)hMJaN#&#Oy^KfR>|h-%I0``0&mxG;E z%7Xu;bXEy?xxIEwY=0cMa9`Hu1*E-~ie5$`vSx#*+qN^R_V zw*bhH62K3sE#oJ|=Dz}@?06?f<6M~qVA8|Go_C55R ztIgw$V1^%Zq|KRU0bz5wpBubNWzcw|M4E08SmI{Rk72Cm1G|=8#CO(nW3#oL( zYqeFPJ^Y#xp~2NvxadZ z;>FYS$G{KhmOpekTPOl0XC;%9BoI^rwwX*ji-kjuiWKI2`0&1QOxWUuQ2XHsMV@j2 z$ZV`V?QK}Gpn4&j0fC#oQ8O(VCt#f9GK4iQ)y|<1af_mSfNzOTZ zp|IS`sF+Rgj1Ewq31&-ps#E}pVYwzJmms&NacVJ^oKdn&H8Ty$ta8r{JfISVk7$gT zn{AT9%j$@SfDD;UnF_@#a4XH7rLDBQCeo-jNDk3;zci;rxt^5IsZ}5}StOfomN9&( zvNagR6Ymfx#mzI&@;lqKBAB$S-gf!gcBwri%*u^aT=c&x;_mWmAYajx4UKKpIHjfU zAhVebNPc5~*y_(WJ=>xum1j05Bgn}=Xl0I!*Sang&%y*)`z%zZ13AIKA@P}*wAsD?sGD1IPrS0q0Iu%)TbWQF73X+E2T{ztb#l~wz)$W+mBoGuj6NkG;Lv5`hp8lqWbNXUifvuZ-Fpn*IxbZ3I1-wyQ|aPT>XrNYYH zPpX~m&CP>QT;>clQd#VlL48$2_@FlfTZbWuHpGcLFARCqh0*GHS>x_$kt`ZwCz7v< z#id?cAGE9FN+3Q)aLwZf3ZW91MhT~px~)g^8>I*Z>k=3t+c^xDNc*8E zW~qLwV9+*Hzm{bQ5b?`fY?OZ#u#FQNI@F%detX_g?9F23o+M=)_7**_*XELd&ow5O zCJ11vk43_UJbuKQh6j@sLE@<)JS$|Y|6z_tH}BHQ4P@l5yI#w+G|Yrh-vr%|=m0{O z((APkxJyH%7P1-Qo)Gh7!_Gubpdc4bH-xcRJE{%knIrKP*0Z`D4_w8TED$&qVi+K` zWD~4l^VlWVljCeZ3eR%aCVn_wsbbI}irFMRMzk|PWRQ6kGG8242`m7Ip(65t2N$}t zOr^W*c%Itt9q&l5@@MO@6X^v@?arwHXlvfn#M#snlbw0K z{bF)-;W6W5s{M?98ruArdU3SC$k<5}5KNb%bs(Nh6^}gp`H6~gu*_pMq_gozXQo<` zf_n>4Xlfs1%1vrR=z&zrEMFI0{z5qjF{jWDm^oY)!umFo7%HOtvzfV1Rb1E6_MW=j;k4~ zHNT(hG!-cqnD{|1f&m<2Vv)EvMJ4e@t09iUZ@IJ%A(N(D`!+^>eM1m)v;uqx1)fr7 zVx;MZjFKN8yJoo@v2Tslvz+I?;f!Rs$JIVqNfIlIOuuNTNx2<&cS@NRY_dzL3u=kr zKW862O1@h!g^z3^^aXadfm?oS0d=^Z-c28+{i9U;5ioJgD@!oo)G(N<@-+A^rLW?P zt<_mJ4-IN+V_B_$F-^Gzd5sUA+tSKG2>6Hfwy9zO*CIc`KRTHL_muL7aCFY|;HZi&fA!W}9maPtVx zMu3(y#Yl?%cplIp&kTtPR7u6ktXY%cV$|c0pBM{q_!PeNa^r)|)kXCkB0hJr_@?dk zyBYe$2+(1qo0lLGi!jSZldJ~-GaR<*R_VKkZ)A*pLKHjKjc`)qhkS99jFYn$-W;bB zly+s9TujjaplrVOqdT%H(P!K8hn>mPl?d5qXQ!v8E=nmeJwsURh6m54AD!V)?vhJB@<&&7;+0vEf{Bb?RKQUsuZxkC;9CDL6nD{>e?uo^ zFS$m>6|h8p{Hy2F73lsl52va1eD;x8*1l0oC|af-0iWdN;CfEsJz6K*q!uXgtU=q- z+R8P^neDBuxA98{HPn7Bs+2_&-}EKXV+O8R2hNj_e6FR)=k^H1oJY8Q!3NQHP2x(aRBK4|2yT z1`YILJ)>_}eBsLxW!85;XBQo2As^~qeM#xWblP^wHE1*+z!cT5$Jko|6#TC9eG{OT zWnnmOfqT|O9LEdnh(eU25XB%sHz5PqO4xrDVPPJg#f;L05dEMme`mfeGYwptZTH9S zC>F&iuR9TTjy6!E6f#U1>$_)x8JF9}4C(6$1COB04|Zd53H`!d30Lctf-xtB`63bu>qc&wXjE zfy;a)M(?^?XM-afn!0qM#Oh53DyoAh_DS~`upQx2w>bNPkfL>BW5dbOF{5my386#k zDz|3hY8O$j1Z~dJGR{XBIX1EYbSecv7*Hs-^|Q6L^;x_H1?9Y)#ly?JfYq1yM;x2E z=6<34kN3*6VX5}M;Q{0xUDR+_Je|%zSszgeb>9RrBM1X}WvC{EhvX?!MLhcdP zb%1?*W&+$rMYsx7Bm_iwZ~ra^jd3vF%5A_hMJD_>X*>vDk-1Au_2X1Fov%88MhC|_ zCWQlRu?95y>j`JRs*QH=_R|jv--3KxMR?hm4PB|_i0~bszQBGGf6H&y$-yd>KU`aY z4BKT_7KJ5>#deAHi|`w!hjaz`6AK5C?Ttj<*7 zZ&a^#9b=&+y<(Mi{mLdpnea*m>rc<8fr?d_cd7GzcrbRd1)_WyjdCFr9 z2%Oy9H#LX za?8#l97*h+f!pxattfE-^4lAWmB1}esb9Xqwz}iH*x&_hTP@G$F}Bor|KFhO1~F=a zwE^*MZeg_w7WX7^8x)(CA!1N8SrE1Z_-l08ZDP<9{SFbTl@V%O_unF6bp+eJYWWQX zvcw0l%%%5o3?8VZWsIoH18eQ9RL+%_D=yW2)NA#&yPEHIXQCIyVS*10{yeh? zDY!UNo(Z@Pyk`-3Uqq=l^8A(m7W+Ysf>Sr|JH%w5SqG7h4n%YPrpR+VdIYSmE`m|Y z7w^@a;>GhBL>pv_fi3`0ItQQ#vMYiI#-9BC*}FKGl89ffXUx4qUZu7Tx}t3OIahA?ZWeYzRX` z^eBKau@CK@Qv>)_M@2}ov8BvsB*Fw+rSQuUK>Zcl3>JXJ_-rf;2eA8Y&!v#)ZF50U zUj?yE80ckaBhZH`1y*O_Tax0EAd!_j2V2q0+ExunNHv#hAdZhm93~*RR@@6UaWw-5 zEeoX6ajBi>7jAMim?VmOIKD@BxNB)cc7{}ZeRJYlad9yt@w(@6oe6-hMNrFp>K>)PwY;qDZ9+i~)Ar6v3oRX_7#kr9V4;chjU7 z(DWow>Rglr1b!0)lt$y$C*)5`37l?BE_^Gib*?$Z z)ZAe$doWFl)>qw7r7xXuuYg8~%Jg$I(gQB@eY^#%=MbsiGsO z8KB^LVs&K&kpTNRhoS5+GpVY;Z~q*p(|Tf4`m2EWoc-rJa`gEik!YlgFFPg8-7Pgse&8l2m;?ow&QbWo#o9yLBg+Q}2En0B>sgl0z>DCv%!! z7IKuqBHDojb+_%pIrn_XqOk>YmXZEan_QCS~{dy0pv+-2wA_Sla9f z6R7;m?q5(zl-vcU=lU*?nqCa!oC7U4W)Pr42Q z)!c5qhZ+&K5+id2{{6Wj^uyUiFi41AylV30DU?!rcab%-%r>s_SH_Cgmc)SQ2t}bD zR49oM0Q#~`fvI2U%M64Sb~pr=QW+TrkL9Eo!;s_lry!gV zTwA^!FU;FhD2`jIAu?#&00y>!(Ft}B5^kF#AzX1O95KgA>$$${N!->d>DdDJ<%zzn z+mx(ISwrwXLC8DE&0DvdUtbT1itqv^Vnt4JtxG+c4!M0Kmr;ed>%=z*;25tZB*sgv z0O{jMh=fExrZ`?x*>v<4NDXLm27YrT>m`38Qcelvy|);UTGGui0+wnkRqx~?!jI!2 zr~mn$PW}VUbaM~DNKxcIAW)eEq$p!wO{jZ8wPkwD5+v#oP>l#)dzH>5$E{dJ188QY zMM$-^g<-LtM&vSfWuzphKb8t~^9arU#dKGUuceb=1Z{M$*GR&G*xT?yg-Df>iDuVa z!Pme2{E@WB5I&**S|g|qcZip{xW-u#`#-NWE3YQjBxxZd{B^WUv{X z-Y>3aEuYGxZ^~*JDE0*wT9f#WW(lO1m^s&w5+&7rqRCr-#WM@AZc*a)wAyo`x)1JZV8gA4jqUI8B4 zEUZcl>w6^d2nYi3k~@DtaTA=l3%o~rc?GgLxa2m{UvmgmSSHIyq3V9^*Oqnd81VQbrFXWZ*Tt6q}<0Yt~^X*{J@OL5RP&fh` z4Kzt3R7O{zR)S{H=rNx`)fV_{*3?|_NVpz zumA0TybH_x=ief~{rzC%H_Ik{cB|}fA%DK}7EJ+9`HuQ?d7Sx>g#!~r){2c8UVuUG z&lvQmed~t$kGAv_GEub*u($v5Y?#&G|MvH9{}|7~tp0OkW&(6V!7$wygZp{1S;=_nT?Yj^10ffu&3kwEp1811P4ZxZmww_O~kTch^>1ld~HTd;xG8qhC= zuiV>Rgvg2%7|@Gmy)+5{cDTsl9qbvBI7Dgp-AM`Q*amT-_d+BDc_pl<=D}vdP9vLp z?ID06sA9wEqaK2)kvrIUNdO)r{a(LY0S3+ly#u-0%irJ%NTLfsktV>Cplp>vT=?1nkKK~k>- zaLn~X3skxp|8`M5Kn^%V@WQA7X=@@nPKtMRhDLhdKA`i}o5X01?(C1$S?~so)Pz+j z_W5X@^N%je+K|)ovOY^y#F@aC0szA1D>m&f-o8nCtbKnMG2_MuUCpYNaYBEE<4c*g z#naJ{pg$Fk{F$J@6&n1Z_^8bo0t7o+=TiZS8q)mE)y);gpLXR>QI~V2y-rGB6hrU@(#f3N zV+L{zAX;144>2mFaSlOd_Y&X!1>3;*V7(zQHJQx^z+X*#3C?CkL8i~%TNp0gfCCu_ zat2CfUvQ~L!2q*#(b6xVhEGj$K5p@&;wYmAoP{L4}3+SS}ohmahRuy-jZLBeyU zmlHabReU5cFcC2~`Tf9)_$k42YNTNz-4cPoQIQDggwLY0ExHHu{L}vtCnvlX`6Tlc zzvEPcf8Zzm;vCrWt(v3c4DncxRW`ljNRB-Q2Pz4sH4P07fd??nZvi$Z*1iu^TT@eL zvAc{o=3ky3>*(kx>N+1gT6koS7mBJSJ0~Y6L`l-VunIc3g-so<5w-z-_Pu#a5YYRH z3(%O*4!+8Ov+v8gC-Lz2(_I`KJu~C{UQgjFh zo5&sHp8Z^eY|ue)-M9XI7_%RRkv9&)BFyMo|02rEO)cQ*i$E`}x7j$E>ld5O{e2k{ z`H-jX-v}Ah{!sRxyB{rKV1Hks8YoIT>g3F-rm(&%BYh`%J(5qq7p&y#{tfoWkF5E> z<^*=~7KvVe!kPVHA;J33St1Wb>>1fyc)V%`M0jnD%OA-pD9j>R?!ust0A4%p1n}q!T&mBJ4nu8bn z;TPErKee957v(;(yKqRzhxSJ|+lVE>q;>ch`Uc&#c{p_68Q87SOxmrr43bjioV! zj8EJ1n9r_HH-5c8jQuS@EDRZ+5;U%X;!xVXw+0NwpbdKi5Z?@Xs-W@eW8(JUM2C%L z7NU*$ZUTv1J*k46A>d{7TDl&UQUnm8Iv|F}$Pn0joRJN3=zxZ&ApCkUG)~IOyn7r; z*3GWNEw7+?JF@f*mD%vNU6YPNdk&W-kw&!M`Py)w%W}lUz0enr+aW7ZxBF_sUmP8wj80E zZyT^Jkb)!NL{Gye2*GGJmGIpH=v+Z4ot#Je*7>i+J_t3Uv?g#SCA*Jl0G18JU3E!O z3`n56@q4sDb5_eCBu~Y2_77+f4()V<=HZlEqZsDe>P)LCVL0@+UZz7_{?8rX2S57{ z8Q)v1g)N5c^o6>kku6bQ*65ZOTdvpE$`m;yB_)tlC>ef7Wub%rsI$&SBhPYgfrM-R zG9aX*@xy&*KC@)qMrq%u>FW0ySI=1WzJwIdWyjt>t@BVf`J4XE`=r6_HyP)#VWe9> zU;xVqQ@zB*QR?;whXxyEI-Qo0w@VadlOaYa=0X4^TfXm_OG!gp9dA> z6+lR^p;A!FCt5xODnpoJ7R6}P>gyP!aRW@T%J==|^LOE*9A!`agJO1+XSRQ4!U5Bj zyYfkC=wQxq;8(eH^BOAn|GG005dKN&=4RL#`;7@$+-+;HC zk}^e_W=7Y44Z4AnAfFtKMpGI}BCVyHg`nCAkMDt!t{as^Ln{t>Tf?veNFGFyXfUN5 z3G@8&lp^vTf_~ws4k(C-~_T?V5tdGGW{j zz^(9nUJ8)^us{-CSNBA?n1Dq%skUSXo#ix`0XR0O|Mk6pz3kC;M3SQEhGW$Yrr-%X zpacfh;{Yyzf)h+e+AArufC3&q7y5Z`RYlb)n?pa|_`RTWj!(TU4$|9yP6P89+B%T# zCx*1mj-L%RcheeR3t_CUL#%mVs7j`ja_M4 zc7S0>NTUV7@!`^-MeBU$IknRE=dN)+arDY_8TS<|4ZxK0sEQ99D?mpF5x0DO;IcboZ@P}UYE{(8K|^iCIcTvP zwzw73XLRX*1pXJz%B*Xobk~QO6XgJ1Rx4WBbf*hwb8gK za_)%d1|oK&P+4q}00m)Y&}KgiG29k33opGK&~u=XI@l5@aUieZr2GmfrbuVia&J~S zBlg#KF*z9k5usC|C?9suG9MrtK-ap=h?V6T329-QWB%PJyasTdEr$bd*FGCGih5I)e%&o&yMS{oQr&_vKpce|mkGax$D9gHwfJWJpgj zaI>@w=(xB+=+bV;LRvf`XG=gfU^dk)w52cRT!Katrj)}FP(*&F=T--K9Ra(gEUs1p z@224~JjdV!n(7l`7!%((e*&BW(G$-~fs8fI3#Mn=;hK&do!g{*5iYUb$F;6lNwZ?u zr^l%cO$}sc1ui*8GVXMY4M8=>Q}-X{4}pEfTLOa=+>wV!>^3Nc;qV?4Gt#lO)8|D>qx?cdv({yDu3!-vl)+FmnWmeQ{Z1#%qy32e<~%8`R~F3*&cy?$Rw^>yH?$F_jm zFk5^%2klNo1|qZIVZllqIfM+wR}|-|yD6$xh9FhLDnMth$an*YnTX;iz5>-J33(AT z231!gk_)A>1ynkbbPUiZepP%7Q2z0~g6jcC>4a=KS4!7G++|@$fn>G;5u4S^*m42I zs*-R{M2dS&FOBd&7Ign*a=Z&4lnfC#r2AbynY#F_5(F#LN<<_@sewjdcfB)sNb18T zwgqY<(z8R*OSRNM%3X9GHwY&wlC|0Oom#I(UOpPsoQ7z&V?Etm@6_AseATidPB8@}x$*x~0G3p~()u+#uewHI)M(1DZe$c6O+GQ!Ax>A29)^SxCl_0Qv0jkR@0N}+SF){PH2 z*Z^e#G<4Hp3PIl(2ncj`;~Pzh=NlM#u~QJts5?mG)lgxA+`~>o-TuaV8@n;a@JTix1CyQe?N%Rok1;4Hv_JZo#%P z7|AThiqV~lMcZ#(xmW$T;eFIOr&DwCuzE+N*zem{3gDOcAa*$o67{f}6<|5BY-3VE3o7+{nxDX5xzLnsf zQPQajMYC-*(SP$O$ZpWqY7g_Gah@A^3MMEmyD#b=io8rfjA%%kbNY~=Bkw`;;76^@ z3XoMdBLj%Z!^6%A+*ftKwzK}Lrcweh6k5tSKuVId+8tcOZr5F)Rk*$3R_lfw2NQ9e|P!i!WSYqN5uJ&{q$8YF*!%UWK$j_{c=GCoB} zSkcYh`-9UAFt(*)2h)CkWd|x*7QN!6+TvmfYwP`1rVb_JAbEmet zku%+Jm=w~hhZv5%4=Q^+iekU1nXm29?c z3?Wn5hRm5V+rRbRB$e*{eIAeRANSUg&HMd&t?{{@Yc2fS(K>B7(Aj7-WOh)B^cgL= z{^4Np$0`trEd5fqp4u}IVBU#BN`;&Xto#r|I$Ly5Ig+5=_WRh{Rm9 zLn^VRGqf9J9dcX73^)0SeO2qBL&>}_Ycd1Bvqj7R%B}(8g+Ph&k39=f{pBi!csN>o z^b1Ji{Mqqu5x*}wfy~CCGJXthe_SyGm|!UND=%B{99p?N%PDZ^QuoTIpdP+_JrUZ@ zgFO{cYG*$ABU$RgZ$fuq#&L7f=gnVyBO#BN?Vj4ukdT>IoA*kNraVML{xn)2TMiUk zgq!=NmNbybNsB3#>J(+i>7S)_uuCq%(G*|Gz0{jvFy4hqjBnfnU^fzE^4Q+frrDpsxW>J zJ)>B)%iXVVllJaoU<(>@-z9G8e#-Y3Z-K{MguuBw zf#3Aq(^=+lKpvGUPlrJ=$R>InO66Z4Z79AE#}wjCK#fU2i-N&D!}ZdK8KI|V@tWFw zHjJDsKrQdy;ot7TL#!(V?5~51JQ(9=cNnazct6Qj9v9(f?*hM#MEg-LaGmkOldrw1 zu@@GrQ}3sPmEZrg1+RrP74bqnV0S0;Ld}L&;3nSy9}x3k0Ky(9)B`LJMF5%k2Z0Kw z*b14k&}rvksZffT_5a{Q5eO4 zawYLc4wR0Gx=%jO%BscVYi0_Z%~f=>tT8p6r}3@PLZbA6uMK%<<+cWnKL$fKihm+Wp|!#rcbBZ_SH~OZy}(BDrUR@?|sPb ztVX2VTSpB!oIWo6=qD=36n5U5Ite$UJO3_(BHy1q+50}8=J8Zm?QN+u{m|SMb;{-h z4aL??E>lxe+|J`(I8{=;pYzSu^0CoTXW(zX!5*Ldv=^J3oh`_V$^whzguUo=vqv|k zsK_b$bF%Kz;5GTalI5Y29B3WUD7<)dCXlb4BG1!oJg;t5ikG zPkV2F++2Uy3257H3-`M9`GACJ-?h-0aQFt8<9P}22s_)9QWj1zirRh2^b-el{DK2S zXBxDTcyoJ)-zbJyZH!mu|`Nen{c`9BbT^-|ZaojW-(Qhj^7R`FSn?hkrjTuWv6ifE;^ zN_W2ElEcl#6sJ*7*!c3)gbezWI~0zZurLL8)9s|A(^7D9+Hc)zm4l{ybtdYSg6I@( zPUH30p!|;1t=Ds|_M;5O!>si9WW0D}c5%xb=d9_-YWy^kp_Qf+rV}d$w0CkBB2zb}k6@A(9OsgD< zon03D8Iq%3&AS^P2yb>yPDn_Iv7uoKM5543G}N4~N-BtpV+o74HZvQPrPj!}dT-e; zJ3G6zwH0A3L-3cRbMD%;IITa0?Jw0PiQOtHDq>nBc<9wluuwd$#N+J;6q}lxCmGMW z{&cnEi*Vt(Q;doXU<$Mj-lCnd%3|AJw=txw~7|i%M3XriPC|If9for;0%R=+lE56 z@AqH-MIe!7a2vf$e@mSPy{ZSHE7#Q4v9LpgI8a9sU{CQykV<3+C95tZ~VO7Cp88|9Y@is z^5iYkimdk@7q5Hpz4%{4sT!!BQO6b}lD z6&bfXKdyJ!Hk8uO=B~E253A%|{H%Fz=by>4O)U?pLdO2{s04rW|Lw`XZ^rUr%z7!L zuOILhG0;H=*kAjYG0J}{hBlV`tkac6HBBr`Ai;6DI3I)Zo!w%Gq#r31M$2s4UXk5n z7b8@YhodBa_l0cIKBM7RUeR$ZOfRlRR|uu;A2a2pJ@(ybufJaqjx}Tc{p)TX9vdn< zeEs`3ty%uph9ERjwT4=I9Qdg$J0I$$$sCLEwAqVVun5IH!>d`Q^(qBCXeUViT!EVi6tY`oddFL)6av|Dils z4vi#R3p*|0j{EgAq5?aQ-+ZDs_7>Nl{73mjm`RLhb|-o&pd>2P+e)y1pFV|q#u4wK zdoZA@X-Gr6UB=5gRv2@{n$=R$;Mey@^^-9qp$DZ@6)dkB^nkMmIsO0c`vHC z_;}0C!aSfKAKdvH zrL5Y;jMF1oI~@#I>2@J6U%ZGGmBV$=l?0!6^09H^^qNod7q9k?wsF?V6JnB`MvY7q zEIsS*OUjpmjk`?dpmERFt0 zRn`4Bj)gfTDe0mk0gx%KJb4L;(jI(ZX&X2;J}Xp1!^fN5kA=q7rE*pFI9SVMjGHY< z9KPXm&&1n{aaTP}vvM#Cb_B(&x@{Un;20cTFhRdme|S5QK?g)f)%lXvaL)K!d(nD& zf{31nkCULDt)zkavZ@a&${?lDf|pjpoRMqLT-bXH2;Lt$-4xsgIvU0GJ~~nEMd!XfaG$&9 zwl|l{{?I8bxfU?g^!g(26`f@i+VeE7W>U~jn>(Mqe6H;RaVeqqQPOx+FagLy znT?H&H)p@-Ph&MTHJeCkkQ#y*KYMKm<8OcC!XN&dl$;Fh5oy&=b8}$^9q9e7Pdor? zHLsoFH^Ib(ph_Je3>0YJbNEb(JdoE!Jm;?5`Q@t4@Y9YKKmjsxDO7CG~2P9+`$sQ?BbEJ&&Nv1NPVJNP54D3 z+f|T7gKL**O%jNN!zmYt>+S2nPq zNQh8FRA1|1aB#eQd`b$%FRBQq0pD=opR;FOPKIsXw&%y3i2Pst3UWqzAKUBi8J?W|_<`QM^F=m4+7Vcj2bVKuW zU1Jl{E_A!zMEWi6AkG9iCR6U=9uKB6IB(XBoawS5pNRLZM7%FjAFSHwH$=Px59H8@c z5itB=gR4MtR!K=_HW~_;xTNYxfLgqRqhs$@d3kxHL#*>-Ch6^tjqVtEKFlR^^C2Lu zX6MTR_yDE&fq?Z$D0_!m1D%3P}8M^TfnNm%oqr*CrJ$ zrPydpOAg52;Z3OL^DInP?w&Rh)*@=46>^KP4S!+e4|F^kC^U%S<*MY6G|>92Zdq#B zegwxuYi~^3k21)s576hUL8loa@%)O*tG{SD`iCu1Caomj9B)-2=+@FQR@d_-SZ-@Q zO@Ba{q4#7%9-hXQC9sPvn4Xh%Mk5mmHxQjbjc*V9QoxqyO075=(&PEU`(v<7EE{JU z`o5u4*CDiqX-46vhiG|jxhkOyuo@DQ2OrIkJO`WuAwy~yAoEAT%giQh6ih){v9Dg3 z?cmPr7cW4Wj0_E--R(5^$EBsE*y)XLmItEeZ#HI~55y(nFAI>$sQc&8qw}v%Z~=v$ zOC5p}pJaxMAmj;UoP7d#&l$cq&W#atIp$l+Bg~VC)q*?J{%AQT5ZsGx`tuZF>V@sY z$_$PPB z;4&A}>A)|_E}s&jwO47A$9*DO72Hhx;>(p!)7~#BeTz-(OqxxWm0t|$pLTg6a7yQH zbMfai1~gTNjWoL;T;p$E4>2eNt_|Njpw)0WTC)${yOaRWnv9FvC!t`MJF!`as| zE#*5y*d8k+Qz2M-Frr>-cgv@V60>|q-_N{UQ{IGED{-foIyEm97#?355U7-oX5i<~ z71yYa+7yeXTbtr*YOI9S)vXTqE8_AxbNlEBX0NDXG9tW1H6tUut(*Z56Ylpp^c+H{ zWZWH|i8d7<30D#ETPmaSvzH)yy0&=Ht6+;Acg|My+XA-!cij(Eq+-~Km4?1o1hCTt z>{M6#WNeext>5JJh`Mg*p{V8iObDqYa~D#d@l496Os|bnr!d2lVd%y5Ez1$nSK$ZA z81Pv=h|GG=a<3!xX#23;?oaVgo9Kx}*X}g$RLE_ys}&qq+dWIxHsp9-zPu!cD~r8` z*EMiaHkfN5vT`Xvz@7OlU7wH2H6y)!h)ySxS;nZ(#P@WSRk6x*>lj{Nf6y=@)80V; zgfzNuhERG!Qw~lAybiOg=R##s6h{+$blAM6oL(nDQ-gu)Ra*~!Q{fJ^o790;mwGdT z+lt3yNPYd{+U3`v>tVx`9Mo?^J&R3Fx<1!dqV>6CE+@LE=D&a5`#>Kg=?rN{MF$;- zH=gJfbT(GfGHWS|F{D}L(0$1>W3b7`9XLGZ~%j#&oPQDRny397cKLcwJ&Bguad zV)Yo92>~TIE1}@U>`-sf>c$HGIylyhv~;T)`m1bYM>5A5zamfaqWf@xL5^ZB)XlQf z`6?k5x~J0OSWtz>!(IqGWx}=F^D6@z7%IbXiaL{kaKuJg`%^$X?lL5#4#2sCK>kwV(lUk38<4 z4!Ucr) z86F&BlKa}m!}7||`?Lo>>w|EAZ_Zu1xkp#e(g;oz)XsKJL0)`-f_ro{Q%`&Xe`8S4FuV}YU?8QFnE}0WAc}0HE4GijU4Us|d}k|Q#9$eZaV zT*qvxPbY;mT2$??mg1P$^XLN*@or20!w~^t1_ne}`mb9eRwej&)-8ik&F|SC-nRUOAdZ$Yl{dE=W-X>Q5S)0xoZ8PsKvu7_n#XNTOy~l zu18wSe~IK(;MVWXqI*v8DtN7z$3*O|KPOPl$%66jRU8`fnxgTF*9czpamUj@6bK+% zWAj{PQQD_#&1qFi4DMP69zI|tzb0h#q>Jvv@!p5;W0wV!5d`MaUWLBD@MtiVtAE#3 zGtsj&ek!9jTvhwUhoqigMnjzbvafKmOWN`iOZ~g6g}lN}^Di7~>)P9^+F0dK?ViNc zE>b_sa)dimdyhl(!9#}zN?gK#NRd*l0}}_noP-*KleF|URr}wb(p$qQV4+&@K|?e| zpAhQ-yW>qn5i|{H_5S95c;x!twjREXO(YprN{q@&by*Go=%0a}3rfGuQrIiLSSo%a zNP1%r7Fu;duFv4`f|{BJjMULt2!@H5x^@Kdg)DL62|on!!xda}EqWJ$67#H!sA!^Q zwDuV)b1~-t6!+t&8}gzmo0$@8B`M_}XUQpQY9=xeF@ov7eObYw z3k=;*(iN=PkITy+Zl|@rHT*@7!!I3ow3+6rf$nbMl}{A$(b~U+@Gv9u1v$f9wKL(u zN2)Sh!O)=L4L#dkd~Vy(EnBvP zt3yw=MVFezW1$*6{?j?~QLT#);i-`SVz`x*R#dp?U26YDybBCguupekutVJ^4ihxJWO^uOD^^XWkLVjm5 z%R2TzJ;}=`7~ZH&$Qft{k!ZQ!-O1Y%%*+z}2y!<}51r{c=*Xa;vXv9~wL~Z^6jp%E zZO8IY3vtQ!eSCelrg>I74-?m!`}C>nF0tR)P&ns_2~0J|E^4k9=tY?M@!6+I#{ z&iV$scr}HN#A6~E?-zV@CUR0ZbQP_vq9W}=y)ztAA8y+PsDgoe$Vgjc&C8rf-^ub9 zWVo@}Qhh=QY9|b~;6|)+pQY2;Z>8%`5VdKl$og=HM@K~NKzh68&>kHQaZ?M~>F_TH z#;rRyapT5(_g^5CWq`dd5*{o``0#K|fbTG!O{+q2Z;OPj$XJ6?i=u}jU^Y_vU)jqc?X_6BR_R{lQdC5 z?5c_!4<2&D058BTt{0jcGSPF1icTjAd%;Orr%h}eK^f7Yl-s_RU^CxfCtJKN;P-cz zc}<_-g}l}yTm8zFpw3}X<-Qf;Wkey?|7<3ix;*or=i1jf*m*T_jc9glnGsOS#l@Dn zNZSg2yhzBM40Cyn5$O<G zFyru=uOxeYpGoDYe6t>Pi^$2e{kZuh;e7U)e9fepr=@WYBzhgU4AJy!i8?~&lTxo` z&3h&ad9l_$Pr6DV3!$8@DI8hWO_}HtowExca*8QFI~BkOorfkV)l4wq^~=dIr!mK- z0;}I0;MPD|Py93IFLw{S7WD$hfdIt7&LjN%lQ8dLH+m9E{`X}?H`W4Lm4v|$%VSH) zOF~&u?YsdUm(NYll|1}o44BaISgfi%t9jEV_ z#bLES!_cz)dF-I3Ub=dg+e$1G#%s*STt_dxYm4-Nd|>3WoX?mi9~(yBB9NrCmhw=f zd1U(5VP6w1Zj!lH+AW))0aJ7KpoYfF#}bN*FZgBbOU{rpw?FR^_3qtmk@M&6F*|qe z8H55WZZI3l6`Z@~KJ1s8#|LvN7*Fe^`ywW*aM*&B>~k!7<3L z$S*iSAyA`eKbS;&-Zd|>R83_x)pK)UqlhbYfwQLbcFo{^LFXFBOwn|1Y%;kpK`ev` zOT};_1;?bIKgSLj7rD8h7;dW$;`<-CNBG5gQp#6w6N!vb!_hFL2kkVZ*{o&l^9Pv- z3tma}7FfW28>C|6JYhFp>pg$=4B0{e^q`B1imD;}S`82}Nc@ty@*fKnXyYn z!HYNI#71dP3Xe4Z_ z%!eAa1)kL>D6@#>IlUWD8@yU_?b5-QvtNQ`5M5ynob%I79q$qqqyKNIlT_Z5Cr`eR zOw7$s%SOfDN_4;q?y=?ge$L)?hB$rVq?p8}o%hZS`dH4Ae4h*|W|R6in=c6|*0$oO zsrT2j$U|}x`=}z~`<)s|qDs>*O`ISnZgiB7&N$^qiKgb|sTWb2n40RVzOAejOx=@* zx_G@EBabd(U~l%uH~ssFo5Y@O=(ylpvEyd&imw23l<@NFgGc~NlGsEdS^HrIm&3%Q zbuSGn@X@2#@)gtw3hMoXnO1kV5hKkx2&AOdiY8T{e}RS%66prGEBc6Lg6M;@C=(9p zF^!jsa>31+evWCoce@-{SrkmRK0SK{xPu36c5~xu?VZQVk`fa=XDF;rr0~v@s4-Qc za!w09GDC|(*3qqHklNR?7>Lon52T$AGG2RgYy?HgteT=50;(a{*xEmQ&-`RQ(9wN3 z?9{WHRJ~|lkT?9>_>BB%HwF*+ziNTW0vKA*)AC4yU$X=>3Uev&d3{ zn~)ey|5b81?zYXXK!3+7u-JdmlwV*vBZ#1J%(YZRt$>8E6<4e2nt0Qlr!%#EXseEQ zv~1KX*@G`77jFiM+xSG|U+n^^vFjXYVC0W48Yq#m=Y8}W91V_S1ta(sCqUl#7my%K zDJ3I=n9*hNrHkVt{u@NFSSD!9Xf5w0kw*Kz`_=oVe|-?l#8Y^meB9}n9Z{!GBoy>} zL;;8-;$wWjH!_9&odL(F8OM@_R%8OAkdb${Sp!PVP)BSx1m~3GpR3OiXYLXr)NHH< z3)CWgd(U!QH4s(2YjQPpCK;E9uh34FV%kEa!Ivf=Ae1Oe<2q52@TH!Z{!@Q=5C5GY zNABf^xmCbjXk^)`6VC9)Ykaa{6E~za-9q2Mqz&?!2PC<^@$!@NXdRsw?*G@5^G8iC zlnc$HsY<+oMY3Uad=<)*D77>(xe%QXxUmg_PD41bFJg2QSCO$_{(73{0%Q1abAY8M z?pF0_8jj|MrYk5U|5uQZ$cPFLm%wbK>bM$II2`rz`w#i{b8M%+2Lt z_IPMTRJ~7i>{SCyE~VZ4MrD5X0Q2E~NsuZ7yzbl}{Ig3%j}p&!i~mii+KWOO$ zx&O0cs>->gpm$jSGr`W*pnIZpl}v zXPvsrq4~iR1xc|PQe(tcl2vY{Y>2Z8NpPhj`@=GQj_s7aJiPl+mHHH}ydTf|!s&2| z(?W$iILI+ocKT)hKh)$44yZPa!a66DV0X^aZ$R$A7uhfVq$Y|(6>;H&)UCIVy$9Mz<|6uFy`+|~J7Tm4 zPc$^V(>Ml#lRa_o%x7Jq}UlmoHJJ2W$=x@3A5}R!{o&7;?gX4Rn>Ff=Ch+O2Xl(yzv@s&N)6WNg@ zGq)@ZTF%v~7?Zw5heLK+C)7*azMZql>szUK#d55(9`IN1GDE78$i9-+FDTS+FmI?W zkxkCJ50VvjKPsyyh;cbWp5FR@3S>aLVWgMOYeAR4WqaQCgd+yY%E3Lpc=;5sf+x<| zX>c}J?u!2z>ngs@cY7TG4ad;c9wa2DiajmQ^;E=v5)}cBbJ!#K(iZ(PvIA{A0I3J0 z;)zziJjp7j9;uz7lo!Ytef<=%;~g<%o3tWaWP2{fq)yBwD4+A`?a64@!r$S!<<9%| z-F==3&FgBm%K5X577$|H%bQhxGfNwwXGbt|m5_Zop7pFq4k4uU02cLv>!q71IBu91-`1vKQJmP4k9Ibq2YQ1HTR6lG;3G&j5h;s5%L$=Oi!>p z%Lw&u=QQhK;{Te^-emTJRXQ~8ecs6+$|gi2)XO*<;py-e`%!H1DX%P=NRZ@PGeOyp zMsANZX)i|rK>B}nVJl{NBj;aKWIpntV>#l{Y3sFM$>^a6s?Y2dPB7d?@MDW)gC=)5 zxw;tZ(dTLqljyBAA%v=TT~V<>NQ+|1)p%ZZo47=FcZ-UFeqk~*F+CUTTQZoHAuj5) zW0rtFhPOi|Siqpb5v^nZ#dmusuGx*a;VZ<9h86RYn<|jPiT!F~9$}x6a#m&?s4OC9s zZU}N@E-7=%#*EP@ubAeIb%SmUMfv$d{*-`pr`=Tk`2x(WClN%({=pKlEBE zG0%i%i1((cd<%dKMCyVg*wy#;*?0ogk&^rU->3b&UB&4U2NC!A7oREY8%|}(i$jCPeEG?c_&Zr?? z%z>q+LOtMw*THckb%qL9XCCoh$eYdE->i!btU_gBu`fw|9kyQJOJjNxb8>`)glwVJ8d~_Y0lbF>bmxz+{+K=t_~s7~%M&Ye zJ~1&doYZEms}o#)}dUO zqwfqWW5zyYvyWqSx?^DIyhIxTn4A8=!755hN*WsZ&;kf^Q$Ftn<{%=T+XJm00l{?F zyU|f85#JEf73JiWyTE1VIpK9hTx$44FmbJwmFLLV)*cT&zRaGdad71AhB}TGAxx!; z6sG>$k?;cpydBZ_MT{BHC6Ln>-xv1%@G*rk@1a~isA+LN^h1S}D-Sh8U$?pi!seN+ zU*nbTtG^-NcVB$kQ}OmyD8C*$bVz35Iy*aic7D~P(>ck>vd)*awa>tiWQV)+^A5sh5NBc5y_6`PBV5g_1Qgn*uVJuj*u+>$LNMw@} zcA>3{Nd#kfGkOq4@1@Ger>1hgH|pr_&0(MlF+JQ7!D(FXD<={mG}dIGRz7&8p!dR2 zUdtDT7rZ1xRdsx6fRyZK8tQ!;g`0fHeb(m(l^eBV@w;O<*m+2^E1XCF9Q-7lP;thM zPv>l`s7n%_q*V)M85$e638~OSspj-ycinE-7*Y&yWIu*wErlYSLZ0lG5}qEMgu!y!2TbHn)41D~RlMg}flf2DID2`n*6u&Ur_>O3SA06@DFZRnfk%zG&s8FZ_LMHI2ye(@ zYC3m-vek>f74$!yCFhN|Mk*g>T_fm--3qi9vH;yuqbI=#Ow9rK=e)8mXDL2y5%6ats`SV|WnzlL^EG2M&n^{$h zeg0!ZV`E~_HG#EW6b9uWDJv@0LPsj>3*#clho`|o!F2Mjx#+|eb}p{>2QaONu3wau zoyHAPLf6V_6nqpZhaQdL)s~f&H8V@<dAUuaLtrx4Q=zn^B+M+!CYQh4c!oZI-j20&a&ls{*H8}3KlYgn z;o3zl8eK=DjorO@K;@|Os35RhhNzo{n&^iAv-ZjWFO_#T$6Q(&{57sRaV$9Ha6EeQ=9|d=k@E?UyKt8Mc&@tu)v9+w$lzO z)XesLK#_zZX*Ge+K;PWl%&Mnr#eIGBUUkv)@^Onyq?Fi?D$Nm@dDExU(!R^_x}b22 zrmAXBiHLO{O~^Az;?u>&MOev(h3?Ia#n`9Z*f|2sV2d0-De=;FOlM9p^2`^Py*F>& z%6GmvxC<)TCD;-tB3Re~A7G0A?8#UC@#yS0Q4wa~P?yY}-&Ix!L?F_1I`&aWNPo{C zFqxEH+!ko%%(L~#zWTjxVb`GC1QJU94%N`r<@bxvrVQM%b%BoV{*q92btr|uxVeRe zHY||UB~9yU{$&J%NxSB1Y+(#ZTXS>&qJKeteou)WGD+-06f%N_)+iXdSlV*5US3zX zBS5=8i_u|nz#>sENtwNf&SG#Ukm$&NtzyCYY%zf95}jAw`$s1Nn8#*se9=pb^!A2m zsq;fZ`Ey^viLEV3}kJ7cz_o$H>L(2+BrGzezsM0wrt-eG0Hm>Q(O)mN9HL* z=Bv$gul2d2T&P@M>#xQ!ZXO33U~PzX(-l>9fxgLT(jxdE=qMT(9f#Iel9qTQYz2^> zxE#Wvejqp)manxJ_d=sgsU|EWJMgpjrBg*Uw5Sc2m|Bz>dfaY-sVz5T?jwV0u;X63 zh7byWah5?Ek*5qsVOiqwy+My2rIOBH0>w?KZbTavh0P!QIWR!bZx0i>(5jr`=~U;cvnN=t3$5H7*>SCf$`X>Lg9v*JwoWZThyWpA5BBBY&Lx`+(|Fe&-RXF6C8ryT~qJ^yb38;2N6{AFg=;99LC;h{PDe3lf3 zg_~1SI2x4^ND$62^2G}$hm(bQ(!S<_{@VjHd9FfpC&0=-`SEYO>8dU6d3J`e`{EUR z59wd+)MBI42kmc4)YR3j72-o&F7iL6s}nt4f3ajj!27xPDzYsOI)`o%?lqF?NSQKM z{`u!Yh4DSa?XQG1D}MX9M1Re+pisyx8VR}r?%%)fJQ>j?cVAmdO6pGZilbd_?4f!a;P#_`8YY2GUyxnXN}3>ZAP|bq z(_J@jsaUt3UuCF}&*OXWvvJ)w1pf!{28e%|-{C-eAe5kFD`FFcSM($K8S%KFY& zK`mr4=nSR)b|l#XGd0a162Q$WH1jVR5FCdB!_gnmk1 z^D1SS&}ZkJm|f)&u#esh8XdU?c*w&3fLlI3dBKAePyMY_y7Gc6aeP4TlgXvccMmN` z=so{V4PU8Ut-)0r!x2iPygDV4yveiRwd}HjG7wVYTaZxV92W+Ar>3JD`61e2y>F5P zhSVfF{ZDD{uNCK|8L zHxc&ZjY5eNzy?ZBp8ez^9&)F+8=?9~SJ*&^%px`KHK|>VREa@&0L$jkZZ*;0;s144 zjpQL4mQ_}Gxhsc3jWS>j|NHTIMPt?2$f&5T&~<6!Fh6hJOR?3w2dJY$4*0IoC}syU z^SyYs6P1C1VPUbxZJG-`h06|Z3|{!B9CCroO}+QF>^BJYUgRjie*?HHRE-O7#wjj@}r0+ZRo(0 z7{RpqHL^pE*EM%HkV zU$sIA#V>FfO4ltg%x5}Tcef*fReTN)xz^|1r%s=qF1bEmWqhWz?AL>o2(2P5!l=J7 zK5SLpT)yORfs0FWTK<)U_W)7?Uh}RR`t)CeU37Gt8D7)B+fC6z36ePV}s zx7Mr4NjZxM{%~$;J6fT~W?e}@zG`4iy}TV_XJ7Ai=JDp#UHH&^?nxbs&;k%o={x(9 z-~@WY`NEZb|)WwgB|Hz~HRdkW#E4&&88()!SKN>~| z10JS+IH`IRFO8s+b!oMBtX>Mgr9AGOz$0xR=nBW?y&Ha|=M(u1_`K6JyV_1hu>~t* zgcWN6^~J!jGG^nZ$_@t#ar^OmBbcZ8qNH{e5hxYZ@-Zp@aDL}G2Q}HG$u;m~cIjhs zZ+ZD#Imi3=lKp!Rbs#MR-A<9nx_>(Uk|q38&|vIXEbf0=smK5sE}8C84|{Ki)MTqS zutdZr!>w*^rx+AWo*BI${U^SDAWN((>bV#)$PlJ-&FwTtb``?3+~26P_et92k#`p~ zz`ejiLt3{GWQ!84rlh5%9n_R7;s;I}7M7P!OGCpd%zypO#mLm<{qFsAF{u+6y_x1HB60(wI6jG+0M}ZZ{UEBneKY1Ix{cMi zdhn*0tWN9EavoYwp4w_3n!6@F#b);s97I$B76S!}*9Rm@1ijd?R%fu}!PQQtoVG(d+5}x1nz| zS0R1oT}KC_Isdft#Mtua*c(k9+YTFpua`G+B(Dtv-WWo+V;pI|7xs+aLZio6gdAb3 z;j|GlZ8nc-qu=@3Q0fv7%_6jo$c}J!EsfeXwVls9tE<}uRC)5yx2-}QHjfR+7;@3w0}9&`iZhZpwPPNu(iYFLt){R&lL= zKUVj>hVOd)afis0CnrQO=i3p=7s5oj-u_&=cH-J;U|lj(PdoJuaAJ_6-a2z(nxesh zR6Kox9`qs{f{c7V<4)lesE!odZ~t@CFeM%PJ$ck376G+9{xX%1hsjuBqMVDYQ}E>1 zRPCY!Xl>$N?HMopve5Dr8xUIcITU#66|_u7@0h6GT=K!LmdA~*01M+` zM_oxM8nch{ULKzVGNLGk@XwEcYk6;?R+5rs-Y`8M63TARM!6*tv90M6*)ptEe14)r{wm@| zE$T2afa>M$sMAMT1uiEd?9ZAf65D#OJDNvFsVdvz$*~C{u1sK;+#7!lPF9kC#sYUH z(47_k2YU5g3fJ^-jo-3P-;9O@glSTyyViPyS5EW4WKS#M+^RlEoZ+E`W*czjJv5{m zF@ei*#!&82K&UH>r}?G}zkc8np$eQUO{vCkpjJwF-yJwu3oF|sUWZr~a#)N!)lcWO z_7-H5@U13?eB-xoUi%Jm*o=7E?`_NzIe3~ao8%oF9EN(4)D0@X@A+>ohejq1o)Z}u zP6{(-oh(dWg-DJhT+X!2Lr9g`fN5Rb4L zv1HY7t$#|Mu&2wX!=AXfxX_Vy|Id8(ZGo>Zl~_kd0s<&Jq!hJ1S6erCQ3M$y0sPFV z6!k}3#s~}~IyprpmKFVhL)!U*&msqrw>LzYIofkvv{&|@Z-j+)>B)DsAU`=G(7#%= zQnUd15;m4)L~hq)N@n@P`A6FFNc`3Vpum)?+lk&6QJg{6f4{J_$d7z@&lCe?TI9L* zN}|?3RvUBaN*WYq$QSn7#YN-)$C<3lAmA>L2pSR1wZvrw5cxGbsS_3mTVB>6RewCP zcI-aff&N=Iabg@C=#Wf)aL4W|crxJ{$TCr@xn~Ni5LgE9@z4oE;x|r}e|nAG2y7Tx zyZ3KT@xyVhJ{^4Rw^nKO`&S-*wO3z)SZ?^Ct+sMt^bBVL)Xkzk=9!5|^!wp~CZ9k~ z?Q|~6AQkbSLlUGW=DV7M;w|`CmxS)#_1Vxe;;-|Oc}f3SI|(vywDOq83-FC|=&f68 zZ~Ra2&s$~n)~6`8Dpv5y^|fSd5`%r`L0LeZ6uG1w<#06+aIIe-6j%C383+(rRS`q^ zLuGx%7H#A~X(dnwi=s2-Q+xlXajJUOR9}BAAtB*xEt2jbj{n0435R#@zT)kBdl|pU z;}3emxGtDjiy&6TZAH7kjXGO*T*$xw{LL%k_!A&kQorU1)*!d>=U=~OVe$(UhiGY1 zf+*>d0uWA{@l2aKCb%$D!uN6rE4D-i0K{Emk zQP!2%2JyPLYvjb==}q8qn_Ged14HS7l%lGf3CYQFh-uB1186 zSX8I-azwH7M)xN(S`s*rI@2{ZBlH~~UU!zqr@Qb|jSGMuZ{(PM2n12;gP%?68`@O4 zjd|?O)yz$nPce9K*vxT(*g2DCr8Y>~S5J)pq&x~njeXqEI+G_7#8`DgagU#$zZr5k zllmAa;=s0R7z^rtj$EtzW)@c{Er^lt_Md-LV2BTp2{D7M7qD$@P3hN(&%XWkn(FGU zFrrid|6!t+K)JY$pKJj3p&B}!RTOP!OhxWObOO3Q!1kB$U;Ww5x9~`-9r^ApKbOe& zb+4wn>$)jmf*O=lrmto9jurc+*<@Ikbd(t;|(?@P!845 zh82|B26z8H!ed;+P~?)&hZy&@z+_ELOBxnhb&24J(~n3|Y`!g6Q32&g|JS5Lmh zl|X>3MG}$%Z{DZt9>xVDTXYfaExGf$U6T_6LWD)9LUUbr#wO zSHobk{U^iV8VKf!aNfwd%cvm`&epBwz2IM_pxk!jXInA+%}AO1VPumGD?K0U`jefku+ykB4J;8-Kt2L=}o*!)YV ztXw@FL>9>JLza+Z_swDBf%bDfm#xVDn&T76Nc{{B#+zfGNpM3m_7cE57s=%Sq|70@ zP(>vMS=8P{GWx%oK(UfDwNQ$=GD8JKCp2 z*u6}@tl;JmkoucpZ9RYO+kak2O5Sa=v}Dg+uFxt|(rzp(P=ZuoWFbo;vZe@VN#(2Q z89CquT~Jb1Zh+ONO(Zz6GO2fbVpV(?hIe{T#>P7zd8VwoWY$OD zIte`}OK$UQug`dvJGud*_SU`r-7~4eh~KVnF@qESDlVxsw%2_j)P3*a_t9q{b$`nt zk8=uvrI$0>$3_c|)5oGpSO2rSShnZx0vGuWP56=?K0LUzeJ}ADqv>ye^F6v?XP*1TyzZtu&AgAv)N{88MfvP?dDogj9fE4tJ%Ve)?xx2 z3WRM2FQ;;WnCWJlU4fw@u*~MtrAshZBt~4o07pS6L9ainl}nvS#^1CNoJTu20?CJN z3D{G-u<}&q{Uv4P%`Sf*i$1jWGVAP#WY0n)+8xT*qVu0)>*@GmF)F}8Z^gf*J{bq0 z)C6Hc6FEVF+^H8DLVj~XY0fQfKwAT*5kDUvY=mW;){HGF!M=$4ULIWi&4C=K1}7XA z=1~Tl|4ml0ZvwjZTEBuVWMNttr-gm~(5AUk5ZY38d|p~3JLO3 zQW!)gqq^da`^HXI_#eJRE{{Vt|C|H}#fl$6CJz0glgPip*MGF;NXCr3_9sS;Ra?C7 zBG<*vI!z4?k0DoQ>HqjzOJvt_uKbUB`&E4HbEDxvqC>!E5>T}m-W$X4@~UvbA=sxl zC%)7mzBFtsu1sMCGvs}m%zTqp2Im>?+pRwnsnKF`$*w9ENY7m3p2g`c$u(GeD-XS%lwwN zhgeqlb`qg-R|kj98p#nTG`!aA+VygX7YbQxId184Ir+*KE&2L4J*r-g7>$yQ@Sd;9 zhds)%q}TN@>A!ekbQf9#_T#`*QC&;~&?^VGX%#sLsy-w`qw5qhl)}d;aL27%&`s!Y zz?=`tze}^_;%Tjhz?K4Tb1Y?`5}G?be=zAwFtR#2rF!eOZC#}08F!%tyrT1)?@zs= zbcnw<=rXL?vI%*v(YIk$K#e|1;_0J|o_z~|>r_`2vf3@U7HHm9c3DtWO9K93W-qXp zSQVod8v_%DAxAqWKW$u;(V*ti%%>~+JH;p3=(G!6Cz|JM zqvZw=fRbSwfCRO({u2I>#giqb%9s~Epnu?l>?*V%0K*(Nt0N)DlIub#sgq&ZkvBPC z;z>4Ghm(YMhG6%?|9NtMwcoX4^VV>3;xnGYQx+-{s-VrM@X0U$2W9myfO0SGa^#S?7&Jy(xpdnQ+fZ;lDZQQ~a z3ih-c&6B)Nzly2e{9Yc%+BWXj;j#tC4^Cygo;!$rqpyOMlMec%Pcsei(%I9|y+br2SCgoV#fitN5x0gxoAlx^awo zb9C!eDyxV2$y-`j6ugof_#Ed4&tz9VL5&Rx<2O_K&MDaCW;@;G@9`t%!xJw5L1yK7 zgo;v@Depe42nP;qWHu(TNp$XC!)0Y;E=I@1#eMT4NGn9+hTlI(dEcd9U0vPNbqTcq z3?dy0=OZi?6GUYr#GGG?Uicm6cJkoKgTzU~KVFCH^$T#a9M1biLKGbx9iN5QKt*0J ziz3utf34{gAwUIMo$OK{tK^X1-g>xIZkwFpq~@p_D`s}LRe4NLvsqcCDeqLg{=2&B zwuG}y>z4rV4N9akR3^USNfRGz&_|7;itk#vwYD}uJE7A2>dfryyu@FLBRNGJ)Wv78 zoQRDG;WeM*E|ysqPY0*zl z7C>buO!)AMT)ggg-|TG1r5r|3h|atTwY9aU`NPV~%O9z(&PWpY@D$Ljf`%nc`lE@Pb_YIGe78*>9~9xGc$PYZa|}c zk6hI~TyU2BgX9f<<-E}@+ zvE&8l)g5vJ&?95aLT$Qj9y+NA@r^+~F8d!ZE4XZ4oyHb&GC}80@Jp@?$$N9myxS+Q zVcUjMP~3xeskLtWov9Gfnj7@@LNC~*h~kBan!X6jJQEPEsiy4g>2Rf6FKyQi z(G7mImCDS)`BXF(7wq@1-pX}%>VY@TUuIpTOak~3ub~y*mQlrQSQEO3kUNHIS-|tq zneL_pY?xwTP)dL7s2;<`T2V{ZEkxcVk`qzj|x)~2SWd3ky5r;)NFN?pzF<|YRbjH=u~;@y$bf57+BL0jte zH=p=PKl%RJjpS>?+thPJtws8DO@pmJ91YwyDo}o@!?BLC@L3fJQ9*jLD5`L#4EB6- z&pLs5aKK_aQ&QEth`>FP>}I$FszmxAq5Pdl;&sV>#j-wNl8u3HC~KrIZ~jejqXBHZ zZC#hIjS1b46fOCAIl0|a--}#?Fc&@Yc^)RS?6bNcy_}rvuBN}aS|p$v(1H=CUmgyx zs(C9IwoA$?Gg}~k?3bUYLi`wSZ11RTVroj~5|fqn-hz5_0XN3_zC*v09{sV=g8D80 z(Prg|%a>sT_^6?+>T~-+gsh%k%+}+{eT|F_`W$Bo8bvnDm=8~^c5cw;1Mi%Cd=+y} zPRR3gz&@td=8F`uuMVeD8dwtAy?b}a^KM=_mLeN8mYY3$YA?%GB{9dIaWjD6r0%I> zY+FruLjs-$+S4|+x0}nIdoVsej^8Vjvqq`4g)`_$6&E#M~WU|~1Ug$X5Oio%dal(X`B(YoE zqp%_kKmXo!`M{axe!VG`spWyqjfo=$KR=5p?(C(Wm`XwmwayqZRYEZ)X#eF44U~5k zT0X+Ow%$MKy|wjT-zk6MvklfGcehU*Nh^POjmvvOQ6Ysxe8ncCpx5z*6MqdagIj+Z z!QZdk;I4I+CytdUJcz&H<~O$+f#hrZoB`-u2=P4s_yBgy8knqzulvLy=;*PY1 zWL;@({%OmfBn(|jvc8vw(WVxzTou!DO<{RBRqP~zA#R4RAHsAI;Yrq|91X7bVLT8o zocxc$uFr#fW2Bq&BHdWa_8S%!3B9ju2WfTn`NNzPd3%ghrPl?G*y1 ztbYgPvLW1p8j6ZiVt#ZhdjI-mc%I)VlEJ#Bo4m3*fPAiV>n0Db4`-9oe_f>?A+$;~Z_xJ<*BnK0P zEaY_1CQJXp4gUo9aNJ{2tjSAjTDNf0m59s(hSny(5r@5I+Yv|e(|4HGPWD_&H|XpK zedU$`j?D$S%~lngnVG?Xm(7W;&vDz$Ta(ak8-dWj%aRR0nV6lev_`+M!=Lmiyg$WM z(fN7*wB+Qs!^6V^0|WO6L)}p^l8e8*+W>km9xizN_^}u?ZH3PlPcXu(pKxhoa>AoT z9ZffM$)Jm*5zyt1EIoP_)8$0$+3 z22{p%%^Vl8p=dWAOG18)QvAo|_$sKg{+n))+jjF*{pZhnJ9F_+S@>Yw4lxO{&G&H3hLr2w17#DD=Rqb`OG z3Vf=4l+r1`ryn?$m9eBUX+xSPJp=$1?SMN*YATYL{4!M zXCOs%PvVfIM*-LFw{NT9!R#b3F*qGaaWodzZ2?uuI*zsNuQP#Df-hcdZ$OyGU^*{L z-eDoVY<|MNkbXnFw~)LgQH3gYI;nAJu?q!=+O`AGN3%5Z<;$1rmxGMJ)1m$2ZsEJy z*E=#z6zQb2pdoJOT#wq=LQM-yn2OJUpTHX{drUQ>wc z`e;kH2za*1v9Zhz>Veo%IIrK?*4nxN2YkI5!3F0r#)bY}QZ1mJr4K=64mxvaJAJ#` zSAv>oL(kN2Q;^W(78W)8n?|~;ps6X2dbAe8A$l`oW11TI4SBs)-)YVJ_f3=BuP-wn zKnJ1?(36o;naK(HlM;ogY|(KV9vy8j#u9*Svf)f8umMKg<%e{X(BCfoj}5BDgp@Hm znjqGchsbIC7w)jf4Z)CE_tJi1zYXhzxL>WQ$p5}Qrt+Iyd??fi-kJI!qg2k+`S@og zw{DGXm{f>D|M9dpDYR}!?t1=*9^AB`-a)+T^xw7V|I-)6zJFZB-m7~G#(+fbXM1o> z1pg}wgE;tqVsgamVUt7K4NQ(`i*0N@Nbt}CpzpS%!7J00Q|XMvZ$BB1>)&B>Kr8m= z?cz`0;lh8$z+2n8iQ%DB$RHwGSw9IW(IEQi`%g>i6)cmmd>FH7%B@*kKdZ3+!W3WQ zlYd|u{Y7Q1+4LKOSPzq}QEc5+TO;KkR(5?__3Cew8yvMs-Oa22D@%3FR{rlx1yPC~ z!ak2ij%NLn2>k3SZG?j0qP1(~3{}DwTXy}Y3(g%{T4-TI|MmA%ns06#&MmsIY6gC` zB~(0H9Eb%czFdS#LkW5aZf$O938l-cHQox1{HV0WgtGQ)u&}DN+^UB{ckQWPezz6~ z>$4frJa>P-`ejT^+3iOMRKY-gbO5ZbsrOR0wi*0~IUy!6qfK(Gjl~wqFB+(>Lat}v zYZe3xdRT(m52-vVtzK@^ELEUt&rIZcS9Y69V}OjRE=tts_)d1=C-12#m0I|veCCA@ zk|>lcRXIr>oM83D2OTs!$a<{{6pJNko;lDVMQdMhWgb|3XSu8x_+0%P1M7;Qu7;{=bYR&nL2CwDMX<&*z)<6V!O{N%Z>`>B84N&g!nRI~deWT2eDs94kPByXuac_ zS%1?Xy5cEgpsgi1EXG`rKvu~x{J6TZG%`F42kw4AYstHEkbblRJ%aYNgBLu+9WBJb z^Iz8lj_z!8tv=E7|hQb;>~9-!5#h)0zD`3 za}Gs-lkuU(8IHV(iioVg;t$&1903#ip{zNac|D&>;~Ejt{@%OG>SbywN-+@?+lD1g zl3KBX@4_AD1UITqJOdzi_@Dqu;g1N*nnMfjLElwc59^`#)Y>)T&O@K$!on!UCf{~1 zZ($*BSoQkb)ZV8x|0Kn4yM>%4b&PpM9Y!m~ogwwFYhx4s_xCRj!dcS88KdpFeE2?C zxw}l8Dj;lE7cCAOA$#uIduf8nlO&pa8gFit zz|PcNu!Dpo5jqu7>hlsYzx3Lm5|HImBu#h?V3tJ>u0m~`^p8&fYT~X*LPB!$+1OMC z10|3CL}y{4+}AvNvq(8u{l|l={NRC-+>8bXtcNCW_G{}w=zFkT@>0+%-7+sRe3w5< z5Y0^Vz<{AP`4!y6HZMb7<~7gws{`+n?+zox7_m^-t|ANFw4lT{p;SmwEHq|bAuOM#= zE{VbHBk!(#tAhY06_^w?DGC00@F439q%|3;ze0uH$%6_Pf)2;6{Zk0JfM*uqPUm7* zV+#w#M~;JS09-X;u?o&s&<fG?-9pU819s+QtSlE=HFeTFm4~b;5M`Z2pDzY&VSE7yCy{%k{W0#a%AN6? z8gICleMcdYx@8dr6E69Qm?XD*EBw8KN+C>?Dr^Mr(XEA|t!?8Vntz$k_EZ2w17I%0 zOFOIN48XK2n1%kf-^fh%2C>KucP)_)p8wlO9Kb{a9dSpo3~<<#Q`EAcYc=48%uhiS z0HA{?zZ*TTdIYPozD7fFRV0t%K;&w<#N{Am^VG9O8wM=UrkBAV^_n32 zp&atd-w4*3nUljH>R=8jQm*3VX()3?NTx_70{$hDMjs?s%qG%E<~-W zFo9$#oSr7oGN`}5zv@&dL6I(xinQXemR`wwPLi^Es4K*|3@7d>424w?ohS%$rGyA7 z)CkXzQi|2j41s7PI2=MdSu>Nc(!~oG0!b&nc{9`+6-hn0-YxXbjN{FltvXIFE3?fq zzK8gaB=r4a4pb~0J1l$@A}fq|41~0TBHNM$NTDsjP=E}kiq2-ColD5>_%=VOf^s!= zjrL!-#iE3)k4PAaug>>EU68ol_j(XKGgDJGcJ^MyI$Em&>yJ@l07|5L$tEk?VXV!Q zj1mC`z4zG<6WbL5q1Njq2Zca0LmSo|73vcBT@;!=w|aj|dlf=WokKz{6%`c)#g?^^ zicrI+ja`|Iww;^k!gjgi4F;GA#>U2#;n3%s`jRXZCR$lo_~vMVm*OVRX+7O{{zL8W z=TaXd)vIk#II(hjecs7>wCKt5R)9ev^sHdM=K<(lDA)>}0|cQHW+MRUSJvP9{sFbC zL}6~Ou$z=Fpb3RUl|t%E8(Nds;f{H9Ep7Ea@&2v#y=IjPffJTnXriOt=UQu8`v4^f z1D&W$#;OT5{5?75aw(LIFfI!`Va)%>F@0r zi{mx8FfP74tXy1O!@XQmGWD}9tdVXnvK1Q-^FKG(}Gklcimqo#+c*f7NdD>v^{$shXr}@Gm2-w17SPn;oCY=UAxm@si`?!e}MVU$Qe7?%-Yk zqo_!My#AB=BreJEJMZsw-mwAADhk!0JUsPalV!32hOR60=2XvyOw64H=&U$0COtov z(^X5bsL!_Q!m!}PoIfl3+!At`DbT+0U4eY<5uYpJ5s7b-Z$sJ(KQaD@KvVMee;@!)GNI_>92tf&~qUqV*{5u8*S;qL?}~(o&98y%KE5LPov}l11`eXSPEr7p}Do@Gbr6 zgg@Js!hwPyxo`fIY7Rc%(E9@Z5K*sZP&P5iVt5}Q>#RQ10c-WHM2b3E_EiRiML`M( zbwrzL0z2-GtrBlaQBh~LBJ*EZlbd`DyoEExKg4EHVW2tZ@#A4&o$i`Azq-d`o)7Zk zmp)vY+8`@z3Myz*XlG6cJ{^_4I^8Mn(+Lm>!qHhK4J>AtUUi_|1L$8+ej8MXSFrQU z!2Ze1U?H&Az=(itD3~7$Sq3n4)4Qn#5yKz(w!Tx{9I=DlsgL=ZqT&o7{b0nL(qFy$ z6y9CGwc@a!MTLN$)<3^7Z{G0+16{Sg54u7Ot0kcjsth|;qg^Kob8>_M2v}I62Z}D; zuE5nd4^LD`u1=A;C~Iru2&uq_jvqL4^rPp?7*^ABOu$@)i=n8BRGSK})~RH_8U()G z0@Ua?Po9A&5D5vR_nWGA;8Vh28j7dkqQIKz0)SL&wW?40fmNyu{Z@oIE28PIqjEo@ z2HI`j^%#8?6VnUbx=fq=^ZSf>#ohbawV?t6#-rOW5&`M44kL+~u;}93u~qO(lD-?_ zas$x%b45mCI>4-m6AC}zw~wTtvJV&5mZ)Z(SRi)HP_bF1gw(S$<6)N~?tj(ll~;qnG6gKjcvu z@Q#OISe^U0EmV#A34&oxLh|-EB}GMq)^zutHE6_%j(mJLpL~>vJ!(D|h5%p2JMuFI ze#BI{4PDfRZEZOBJaOn=*)Y`#$(89`cp%uasac8-jdpQYP_F9Jik*x~{$HF1*I)$k?a>X0nzuP!f4$(Odn0xPF!$zdkGf1d}a!u=Rj z@vQ|d_&Ob)6PN5qBLYPf`oID9ymLBaGd(7e!S#xaNb09)!y_Y-Q}^ZXJhg@vdZ2oK zcrq;OIQ5}=dDo&9D_P>4zk6qyHG4dz1}Kqc@FHv_*H-a64px%${m!ZmPv~}i_zsE_j zKy$f)z81(w!1L;r0ezFOpYZxKRGtQr;hYD;=1cT1`H4fq0e;-4M>Fcm$NELP7B02? z@U?P-#81tr1?$?lSN#|yR|EXrm{(Kc0BqMQ1+>S#90dJZwQM#nLmXQr6xZTmehrXD zyABnG_gLK)K4?R)MqA~zheTssM_;|kaRV6WqJd1*LHAz5(Yj&b_1h~DG6{eT37>fg zmNp-}sRh^z^(FQWtI7x*H2k=>;GN1~$V(DtB!TnLp+mYEb~d)2sw&$c@pt=BMw#R$ zeio29#c*9}JAok&QTv~H?d^1XO+eKl*rcJ1P{R0(Y6~VZ{2-eLRn70^QK3eu5|I^j zCikaT{fJm&T0!FA-*z`3T|lx8NBk}K{Mw635{PR>UIYrqx`Lj7PlLqS{$(bu0wbmJp9zkwlMs7y<$S5YZlk2MU4Fg6l75VF? z26}coxfJcM+Yx_r-a^;NU?-QdiN2jNBM(0}_fD>J1|~+vc8ol{=*wvnJKM_!Hd0m= zH>@lTEbSPDc5+EsnOoT?-q6*9C!R5IFwrxRvC(zj$t7!GX#`K<wE=k~T57 zGq7Rgk~Y`1GdN?QXQgkjQ$k|r`cR$P#!9yA0LuRIbQPCMf2-|(&*%J~xitSC)xRn5 zZwmaI0{^DK|GgA&+x36%-2XlEe^cP!6!3yE$;}=+SKmTj*bF{;;ozDK&ymbH@{jU^z z#A%NmBfD^=p7aWppJ?pP7srl7ZfB-BZG7vp)SgEn=XTurJ(fCd*Wq72A1M2A=FSo@$(R66#zPT;-?jfG*@1$uhzBEXf0?q^9nXxuV0x>P+!P(}w=_>U0 z?i2troEqo;p7#R>0PxqT__H}p0PKYfuQ5b%`Lef8#68jSNzQWYbY_hi42Qf1{r%!1!zI6oguf6cpe4R zB$MDNon8EZ!7*)E3|#|jLwRBZeoqA?4f`fl*7kWT>{7%hGfOEi@*(?TI|z9nJVvsI zvT2@fw5u4qUqVkEU&_ej=>&)K@h@l zcp!jj=f@IDt#!3H$zm^wBNKZt=9bV{%tBw3lKng4F^Hfq!or9F7Lsm`fO!kIw*cuq zr}XB!67I4@vDNo<(wu!IsKJ_*VB|iz(9SwYMg(6|x-WJ%y_2vyL0AO@^)%~>^eJdK zkf6Sw;?T)TpWc$5iK`cjmpSaAgrqr(Y@lSo0gBvYnkpfOVW>j#4p?J{1XOwDRi z3#KdrB7br1c?U^`)Z*2}fV<>1nd46B>4ku`5j^;*aQJ1?a0ls(jxD?Pk=QR=$mn!r zN$!xP_`SnNp4u5Qz22-&kpLj~+^u{-;a1p#1DvlH zozg?;9a?nzr&KMn8cpehD?Q(vkEGvCIaxia|J7*mnv; zb@N4;IL#vDU$l!pfXt38st&7Ap3rzR$w0`NFJ6q0#Cr4}3SZp3n zAdP{RO8`Cwh!O@!o@+)9t)TjeY8j-L_TdZ{0Di}x!-(cq9!7WgOCqSgnVVZk=en>2 zP(B6`7TG(b@W6XmNUTWoJ(5a&)8nJ8?atrYMrnns++FTR@A~;X>s{71P=ICo?q=RH&EGlqd8L9}7;oHkv6p}Ceil*wq;vd-DL4sjyAZI79>!>=%Cw z^%H)8mWzT6O#WE*SF|%|EkT+XG;^^4es^Hq_^XmEhU~&>gHH2|k8H{na3YZjCoxe> z@JM@b63SJe$sb|9*S`yfUS`&Q{Q+muQpd#VcNxjyu3`d8A~rX5RvzLSSbcds|DFvL zfd1aHbk|*{T;GD zYm=?o0Xt1`1;+J`^@-bLWi`yx-M((zcZYhQ1ciPMr`v>w8aM<}HejS0dc*@#M1HpK zYp?`7ws^91*Wkwp<>t07IBZo-IPRtoEhh%V#aCG+rtVKVXTo8vN>Z;KwxP6ST#l}3 z>6~}*dZDw8SyvH0jq0jYHNwRK-H*?_iuN`H!QaN`TP_&Nk=;2>wgTB0YD2j!<#E6z z`E(;fbo>odgZohb6K$=9*eomu>IUpXW0^J#?gq5rA|g`>fYUNDpqRqfs?wOUU9@XdFuLj+I0Kb z$Gco}Q5nYTDi)Xwup#!-S?b``FOgAX>IS~CMF#~9?5Rw9sA9F9)1W4?g;sBD9=5^nhiV)L*tA%kA@5*OIg zwoqrFhJ?C$N%#ggs2~J!)sC#7RKM8&l8B4PH|LTD#K@WBqRgM|hJx8ul(Vf>xa&L* zb=16VI=pQzQczd3v*?A{iU(+*y6@c$lU0}-^n{A%LoSo@*hR&h=86 zqQ;VmGk49Er5{6z&JL|@cek_xZzdHVhK(ZBtRQqLsoh~uzn0t7djyMOjlsf*P+!P`(y)HdigV*#O>ho_<*v5F;1o^@_Jkjrb6n=aY`3t!4~M?Pqh zO8jG@=|t;m3Gs6+k6u0*Mu~M$Rsr)Wr9x*ZG&u;nZDV`|7Gdv1Ktj-!g|froiKalS zeo(ZBp5p4;G5ay^{Ztq>8~imTRRgF8=+N=p?XtMfY~F6yzHEQ@QN6~X#`KTS=K=S9 zP79O}wkEC(G*sy?XFT?1fF=Xez<7T08zNvCtNH8`eqCpzXEFsslXE&rDTJObYC-4b zZJen5WK?d{Dix@XC#9Yv?+p$BTz;;UsS+;mxHc;Ka^?LHevxHc=jchz8s*d^~v zQwhkRx}MiQLq|C`PyI|+S;sLP7{|e+TH?GH30;1YtMir9aB_Z#54RvI@74+CWoa$< zQ>Uy(rI9%SUA-4mTiuz6yy)hzCl31k6b&Eca%Z5@vUlP__&G_dy|Vp{J-o9z&zjD~ zM_5}X#Z>M~NQicMIqiqee&Qbbkj+f#^yhX-=_)%zYF<8CEZ1!b3Zt~_KAmkWezRS) zuhN8W+RaBHz;=HKR^p2LVhMCa)PUM=_LNM8K2$$y>su(-gmD9-DTzAK&G>iNqR`=J zt+ZMtD|9%W-*yq|UB-6sly+-C9cHl63R`o7^0|O4ZD)&jlf`8kKXM17!SaC$RG85! z2dqo=*f)0Vg=$U5j%&_)LnlY!w7>jpL1qGO_-qK9La3NBft)3IWwJ!s{oVy%&yf+3 z?hcnUVEjs7gqpPk;JsrG`n3{Eqfh-S$4Iw)?wGtC%f>)}ZAq?xEY;oP(>)4_*+ltk ztHmQ=hl6{N4i?h3_F&_E!s3RtR*yIw{8iIdT9GqR{wZDX)_w$4^sAF5l?mY6OU^>7!3H z6!Zl5OZ@WEXdVm@tBC%RdJustOWe?gd$;JY;w9mJ@IR9Aj~-bjqy;c^-Z3f$#x?CS zgMze1N!-Yge4=>D3V)MIFO-H1&7IiCdWjqtC{CZj4TnskFT0iQU_E2WAaQ#{?Irh? zd&_OS%4(a@k0VL}|`fD`DC-EjzPC&|`VN^5qV*?B)l%kPt1nrVp7hdw&$dHC|c1 zuNeC6jK>xK!)(c9w25xdmrgr#5A+XHhGKSK_|7 zEb_TpKB2}=SFtiBXpLqeO_)FW`UAKGBY8F&`tr0Ap9X59XlIH7dW%nYcxbndwWUqT zG%M)xy!5}XVwRHSBEEYbx%vxcrpq5apvKC7rW7EW>1X=iwIiNE#W>Zppd?+aF~Z5W zE3K$K_k333tC@)I6*seMgb}6T8#PPp(On zh_={!oZdUh5~n`)(%k|rPXl(djHKYP0*u=H!OkS;8;tegk4T&sYjZP zGdK;}eM2SOzF`o`(CuOz8pqhGEKP~iu-F8sx`aNj=*k3$6}p8*mgMSTtHDi9pdQ^P zOetSe0VTFJvnGD8XLK5x&q+jBQzXS4Ww`{FutwiF9KbrfXG(_xvkd!U#Jqdk*u>G- z9zJ(>QA_(dEWmja)n<`Ga7cT}?V~Xq{D7>xhe;ak7Z0!@qtny}!OXXujdRN9lvQMa z@+R(_4ZR>&!vPWzcfx!Jb(=yC355XY*S_LFjQ`$>_6L`dNVvg6s zS|F4zyEEN`NpO43&`^%}0@VVifiLc((YF#`fwmW^aUU0U2aY2FVCeD;c<}H`{;(9h zz_o7=96Sl>ImFey%7&wSlWr|-IRpK~kFP48p_s1z;wh)iBy3(Tob0C*CiD>}DalK? zkDcbZPewb{4aWYy8P%7LsvWBxEF%dtaNMI%=GNJ833r#iJ+MuC9dSz6P;m$F(cW8R z7@C>qnQ_Qg2-T)yIVM}mB;P!yYu9L2+&tp-c(F0fWBD1u6iYok+HIl<{~#lRYLTuF~8buuyzTp^Mb0aIV*N z@*!XCy@JGjl_zcNZw^n$f%&wRXg6HN&3)RY-4YSGSq~;EU4;L3XEYYjZwlRp<8Alr3 zkBky^b1Bbl1~V?8##21%Wop6^R+W*t^anz;vJ&c6v#-qiW2%r&QMb&EOU3QrZ-Mg; zOb@Os@%kmYa@S<>y5HJev^in!>8$tQk4JP5L3yIpHHpeW34AV9v(py5^1|qmBg(}c zb`5ePF3S)E5D=skaQE#?KRB2!qGsGf70o#e zXrZ_aCgp+LQ03c0;|LA$SKPo?^9;F2SA^zYC8jd*a=F&ANYNP&J1bA?wxGHu+V1*> z#yb}|0kTH-j=XUHW3aqm&%NKSu;3}(*NSuMxi2OjI$r0ifc18B1Po4S&oTk>Zqd<~i!TBkFtVZ*NFevy0br#|OrzPLX)Se`A z6eHW=iG189j4b~6T!&+qe=O=4+PoK&O!tDD$(JrJy8F8qw>^~niOP!%#ez~d0u`(c z5t|-LwVENz$OctqY&Zc5h?N~Mmpqa8hj%%5F>*IcP6{4O{})p-p4ClSu48Zv zQ!+VTpPFYVYnXJz)bj+wm+$txPc7jscy8FWJGt4zjZ!*wC$+%puStwH+bV~1Ey3Wq zxs(KEC-9hk|86kx)F)i-YY2*o{%JKcK}RZeu7G#C=RWvAlR7!YLKm7nha}GGYX@8) zOfe8XsbM&>AS?>@r~{xN`*94y9@^Eg-|0gkv`B>Dg-YMs)I1;I4)^cRynO~rkhitl zBiwOGFBUk{Qr+r1ti7Mc$(Ifw8^d4-(Gf08@#I7IOD1`$nRb5@=SlF=<Q{orS-+U%Y6u?>1ge~#N1DB8d&0j*fCje&&?G$ow(>zWv_WM z!|`hX39DVwCMGgvZ6cCesO|6|2rO|Ag; z2&2K0__P2zfnGW#nO$;`M~cf6M_jTLyj{~5-6}0cOHcqPSWrdJmp|M54Rk+X!cuzO z+Q}ddk)<=5MteuH;mGLO16km*cXaZa(?poRKA*O<5Uiwj+|6xy`bjaJgxfqEn~)qG z*TAQYAiL~M=N<}%`e6Ub_go%GkiIt24gobpA&#EYY8Vk((~2dmG>Fjm!$AZlO08z) zM-UZAw|ev|rp6dVNT=`iOUMnJOJC7|opX=7j6R0CH6nLGSCuzgk!y~0X?6&0!OzQN7ztpt}{PeP}(z6b_=|ZV_Yc>0p zMtc`uOZ80SD}8oNVD?;`{Rk(ZP;Wp>qno&e8Y2e?prP;@2=tDOis7=6((5_CWXh@r z!7eiMl}!G!{crBKXLlYF%>$iMdx)*smd;WKg+G?aC8vkKE>pwAGM=uNl{J?vR-+m&7K3+Q4baAOFqBv&v$`SJ(wb>>;vB zCoHI$2w~@>fPIZ2NkyiOkO)wer91%pwGWx1Dwrwr5M4=`4pBFMb@p~YDpO}?&@bC9 zXl_M0kn!Li-ScY`@+=T;Ra#<}9P9gOp}Op&Zx zPk|oGs!~vS>q;XTAv=t0ruFPH#4P=mS94SIm9^Uoe8oe{3?s{iji23D>~q@=$k7w$ z&d~RlKpnSC^!G5M==;uHG5!*HwjNw+E4?k5hAFwu+&0cp5Qdn8K!;48zpDF|nBf^s z1o||^AZc?tI9ftZ?Y*aCyS2=6vjiMrsl25Ou8h%|F1V_!th~%_771~H0E3Golop2v?{rK`$sVSo^s3M{3^QP}Qk>{F z=>!=CpJ0t3urp6!=DwW^mSv0ja;vo3aUo zSa=wm0fY|}xoQ7vXC&y7NMb5y!eRnfV^EpE zjE)4u4G8Y}xS2^B*FT+?zq0aSSYS?PO?h8qxzs4STrQu^m=!{nBstz%RoPN6RIE3uK=3z8U6XUdCeM7kj5naoMbQjCpQApwmhw5~qygS=e>*Nth zQxOPmDztV(JP=>)y#o4i51|OoLEP(2F1No7Ya7|2Ct)U8L`Ho=gJxlj{rieeGt%R$5b7W< z^E1#%33Iphb{t?)ZZsk_wxa9=zc(Pl9R;bK8@(XbBb_?CZ>~|-8<#+quW1H>?qx9H z_ljMm@vS^~I8WSOrLWfz(o#NHA?H4Gwm1xSd8%nvXE|+q61J+LfyaPH5XHhO&snCI zZ0oS>Y(zHs?eMF$c2pwcZ+czCTd&A}j20K=)d0^<{{V(#o|buF-Rfs>z_YglAMg&0 z_(nc2PM8tO!ja7^+{}l#^^v;0GZ#hzf^eCIAeBUmn8(^@`H)fLHD%vivY@sqPu<&x zoKs~O+%xAi(PpTGBYQd~jvBXexqaIepkBVBs2M-)udrTt;>$@!LdjXIpQxg+RdUIQII1>|2$U6~)Z%G-H(~#s?y-YD+!0 zVm;rriw~sFjZAj~oWYSAa>4}i7DlG;v{>gAhoX_7wHCoqO|w36FI^Qu6w;cf zpPKCev0JiCJL(R~SH?2;lQiw!;A>wa8jH`Qq|_dm))_L&<7DeW+jTRJYMrpdxgCr%bA?Sb}3XF^kPgz9UaT z4~OPg&^38zVnz?NU4*u|CJ9kWy@7aT4ePVB6DW9CZ`bUk3oe7(+q=;o$*9{+AeP;qYP;!BlCTmPcTe;^mWQ{DkHv`TcYBmw;nLe|F z0efq2F!sXEr8smt3AFg-Vvm)VcyovXUTV384(|u&Xr$|uKu4}4til|=>b{D~kc^RRA4+y3RU#2cA>8+fGrQ$^LNTd1%7yfpvb594%2=CG!-L_eRyfX6cI2AJ)w?A-V(2^l8wFRZm5V+%P~~s}5y>S!%9fi|Ygm-B@H^>8sJ~N1H)r zJicmYLq?nHY@QlKw9L4^L6)y+jJ_;ZuqKIAfK&|mASmxT?JH}X5aqBFmmW;8Y0>r0 zN+nAYygymn1`bh~Kn6Iyj-nTI^&-Sw9n@%Lo75)&CZT<-P)SAiF0vDKo$vsN1Iu$n zmNaiA_Y;H&g2v-LK({js3FTeQ@ji$D;rU$J?sA{tInDeE*=CPI47psinDDd_p_+lx z3X~ekXtG3@E4W|JRDevlmTypXb`n`e=h?^MkV(X@4q_c#@#(DO@_Xid0&wT=6ro^X zk(Z?_r6EKwvqgNwtbH_un8>$!zR(k=>3j)2tj#oc9@9LOPb#jmDAme^UHG8yA_B+g z%(!GJFdP9lK%F#t(|l16-48ebubLA?A+s^!-e(Y^$|Ac^Y9meIL>W{yOj@Y^-V;^V z%wAJ7wW~ixHtTZLwUAaeUfoJXyCd3&@sfQMfzR;P=itFFySc&N^r%@{olV20NSw=_ ze!Sge=qVVec@F+zsVl!?mM66b?{`4nc^`*-Xg(x@;>wwF)@BK~LZGJ#dnBh5AZpGS zQyE|!)m*07Zu(ux`?QGiD0 z{g8I7nitJPr5lhb9-Gw#2Wvr*W#B^EIHWgffN|&vG1%_6w;IX#e|$kDI}#Qivjrn4 zGxxxSo8uad5904azqi%wX>PT`gYQ&B^=W0L)vbm)?0{#RW)r+n!){b4B2BvhT^>{x zH0+~>mv8Sn@qMUcPpE2D>Nate7Qu6c`4yv09=wzx5^a~jd5$i^PRxC+fjD|xx$YN> ziIQZ;J^iJO47N2q0ZEMZUt!Z<0F%=@-!7gk=8v~E;Ag>}LIpu$5VM^g6K(a36O9J*4)tTmk;Jm)d=&WF4mJP}HH$oD$WDJr z^Okh*?Kx|WK8Bm6E`TSo3>G*!UyBRwJD5PLC|IDEj8cCL%iUy+o`m2ux43CTAf~)p zvu7Lu+$8E0s0itxD23>PYxzN=car-Idv>!tNXcnOkQAP25QEJUOh|JdGlR;XXlPsF z5P_fYz~@&Rp@iH>9tzoI!x)AS?<7pa8R_``lG376fn%5qm8JXQDyC4#fY!Lr$Gp*7 zRTIn{o-UU)G6gdUgW8Ffa4%J&(oifCJ5}Mr9rN+c@uZl``w~#HA{f62ZH=}wD&$UX zafdx48sa8o^mg?C;p$v@*gF#ZBp98U+EVA7*>qnOaLh*#UpEl*G03tZ`=6!|`Sp;b zj)p*KQh^V^mq)q&eImWB`R& z5|HPBf)~LW%`%x`u-Fe`#8#~q)SkE5K7_OFWM+|I_Yw0(U@vpK{i+R>8oIyj{XIWj z-6~W7Mb*9;pvF+1+jh5sIxb`1U1!r~lAs9{AE4tUZJg}k_-Jau?Q5ZfUnDRYUrUAV zT(gC(=#K6|aTmKsIu4>`+0LF+x?{@JUjzW?1ce?(yCAvZk4`!3nx}z2C93;k-_#duf(zkCA=taw_X80o52tbZ``)Ki=9Ku&eoIN2%B5idar<6wq*fDkC+ z31FVm$#;Omp4U?EY01Amao%)-txh1jR%E0mO0+rjT%c3BCV;XkSu4hVc!8+8=Gu1Qq51;CbW$XgXQiU^RY*nBCHsQBcv^1x~MCp&Mee zO&~0W!r-m$u->2;^HHS+vW>v1N5IPqlA5q4UKi2TZ81kLhD3snHki@`m(X^wHl+Y^ zr@Jf*rpl*xFWOX4Vpqik!1kA4TPbp-EG zyu%!tH}-cumYA+&Dwji7s1-udRpyN)u5Z|3w2!RZP9^Zp} z@pHZ)o^#W_5ML>#6(`=>f$-y5I*DoHa)<;uFO&m}(t`ymKoFaMA>s;kjwy%GmDPDD zmT{)w!HK*VKuluzD~ee6r|r22^=Lk1N71w! zX@za{TdzYt{T;YPldDS;PgWJ@832ZA9O72<^00nvT^y@Nhp;mdU36EBkfs|ddJyd1 zUtD_7ht4Z+xrn>l*|M{|WWb_1B~!pEMt8=|1OIjRzJ?=>$heK~k)gZde5?yXZG2Xp1(Vv^ zz_8QB#gLy6tMu%FT1U!hMoJ$t=gSsN5H2ngoq`BW1SGclCwv&71nM;z7!dFO^6_Os)(G;C8!!4$>DDE&#jg67^ z9Uc;WH*J9mFxx|X$^P_iw)|49ad57L4UD)-m{yb|`rcTK(Ys3RW z5Xbyt&KT?lXhp~sGXc#=QQ7eXEa(HSqBqlB@-Tb`vn6+0CKf_ZiJ@>A$DR2jI z$d6$vKXb~vHHJgfA-?~@+GTyGNK4oLa{uSCGE#2-ef>Sev7);X+rhKZa5g@p_rPVu z-xJ@zHk|c|5$C)~i}i*54=GC|8Icy790_DapEqWP9<}k7wFUT3DZ4(@KSt|(d2K~E zpZN#nki27lrW}0jJGD-kjn!JG%;svXJq@P6PJ#7>+Moua%pW{Kd>TmFy0F2$=ygOc zSsxWF)CSM}mCnxfmnWb8^mp{&4W3-5)*qB3zU05hlNL=fY{c2Et?5h6T@1FfwTr|z z!C?MGWFoH-hx*ehwAf5cot7gZ&V=~4?Ca>h^=q><`spV!O&a2l^_JQl8MWVSPXWDB zatZ>t)H07X4Eo3>i8$0;#AJ^3*Mn;M5aE~(N;Oo`tpTMj^RnQ)M~EFP>m7!HU7HU6$-%4OfPUI zqdoLnR)b&CXHT#fvf^bU+u~I-46VI)j-v`WS%tH~`B|A5TL=`#X&caVCP(lYUFyes z=31~Fx8&qh9-6TPy(LhboV4t514`evF^^o(#=<#;vdev!=>`!`BN2?)l;6FPkPDJ@$;t`?)oth8OS02{|&x= z;UfP15E-n;I;#`;ZA|cxaDm7ge?KCtSlY$6Cc*H>bzQW!jUmY+YBsjrl!w&edV|4| zIX~c8;z~Otlci80zS$HN;SJdyeft+ZL45KLrT$ZxtHT&sI!d_rLH021kEfhrWX|<| z_tu!1sGizfh$8a8Nc#@3rm}6}J7b9m8Wlkl40aTdVxee&LC1z5Djfu(fPz$|g|0?L zieLe0iim@=uJS8F1;ze7eV;fJ_*HnbKiUS{qynNi{#|&z1Lp7&ST{~4gEVN zsEU@tUfl$)YqrW3PrU#HB z?8@IgVle%M6B7l6J{(*SgKaWk3tz)TKs(L;Ci)tUolW{x zEA81xP}?Z|=+X(!kYTQz{i{HtvxTse@Om#Y^(RrktYitpTVOe1Ylld7Ih6ffi1(kj zlska7NeziosrK6tXU8;uK?`sxPt0EsV{}NJCjwX6hwh2N(B~Nv2C2k}{Fgm)0K3F| zuY_drmn@4?%@VNEfD3(b^fr74(ZY{O>;iR=phHk$Ad5}8Dg#*a6yu81XrRauU#&wd zpAIl~5%em6|Gd6H{~b}4YX!8On}zh_hg{;r$n#sNqP=x?0@C2w`Bnd-7*E|UUW5$^ zcaGWSeC0j03J3)^yiG+8v7lpUH{0;x9mE<(JJYVGfXneZEz%*4;JT=ShP0B0(WqXa z4aUx~wd>xY#A5f1pez*G6@;WI*al3pwgy*-;*lHR>ZYR|hBN3KeV?Gd!t+RX*oFxR z+|GfE@r22`*^uFtEpd%gx){0{&rR%rz4SbQTYA_g?TsoSiknzaHoC-5|M(fU7O0>5 zNCzLmhz*~p4GEzX)8DWS`72E}OCldic`B&5pqs*^rj;xl=TmAyrKNA4et8J^3APZ8 zJblJS`kwblWjAuRBkc~<^1{A#2psT6_9zqWeTW!%qr3rvVb3`sb*hj8jn%Y1(e+pj zJ%N16R>=go))HgxCv&BkgsyDd3R!f!@r_WQuml8{U_bH(goZanx*#IuJ?8+u?NCEO zl!OFxf51=^|G?@B4<^3X!#EM7Y=|_fVJxRE37o1Sy|h~~gMuh80K8!e4!eJV;!B49 zyG(&sz;_YX!~ZqJqG`}(BJqF;NFv%kXv=*4yUK+rHH8}ID0|!ryj1~*$cKqJZ;3N& zVWN|gZTT%-P2b#m#;K!S9_RSxUMPj&C^Tb7wN0J7E{_C?82i5}xEyA18Zut?y9p*W zLjrq5+Nk{-K#Xy)17jxkfis6;B}SaIR1%liJDVMzAhN7*I{5tAZ!ZMS>{GT;0`I6j zbtV%MEOJn|5iEBpaDID=wLXxE9J9E6jG&0KEsxJhQyI<}EcJd<)mP>;Yp!-VBw`)G z^2-HSJ1XrXlphH|YRvFQNWG7T)W+eUlGn02CA_-_m-H$WZ=-}Z6P@+T~c;VxF}e`X?r#gKPe1|;sD59op2O%Z}W!2fY6)62X|P8wUN2hou|~A$g?9M8qf*!ZX4GB0rs)o!OQu<4d%UheqUS!=0q}1> z@XQA{sv8nZHKX4*<3$YHcT&n2RIbPe=pWOMPz@x%>R&*MI5E7=1MD%${0cF+Xh9;6FE0pugb_6K1f? z3n(wdr+K|_#x?LO{1oPi*P1*9u*#uAF$dlw5GaI1!o)#O6-~=Z@H-XHIhF|L-?iQg zFflL>B^;Ut352b=MV6pgDgmw^$c68zFh`zuaG?geEyyB}%O+@*u+n{LW2js>D(m(# zTqEStOg&fd!f8~~Wi$c@_LE=>g`9$b^5CJdg{UA@Cw4-JQx&XZg=cpWRL&*+f3^MRKxkB+Y1v%ia0^;7OJVrQ-QF~8rxJ%Inj7eq^GZN$@-e(kI{2T-!oN$6%yic zM{^FB@?Z!BAVBKl#Zl57{3Y#oAUmysaOp#g=i$Bn?1%xLx{)CXY}Kd@w!+X5tj0*i zKQAJc5rGk%HnEDu6(`5+)<#>d;6N~H5SG=Wk*WF-p7Yxzlr&*brHNq@f}wQ{k$A|1 zJC!UuL04Q{*Q$;ssu3~z0?O7Eq68yP`HO^-zBUS+W6Oa30r>NEHN4gEtr1dSz;6hS zNDt~Z!;1`YZYCJHeBXiTO{xU`y0@2OtXml3{d`o1bap9vsfZoy0TU3g=Fw{zA1NO{ zg4m;KG8Mue;WX?`l!t&VHH3lJS+-QoGS3{!yE!=uoEK?1BZY$`PPk_l0-rXMySO^(I|43Hvx6XOUHC%&KCa%f zt!s(x$ar}H1#~g&<`^%>mcR_PuoT#fQFUGC56b=<%Y#SU*lW?|ktU;I5$v5E%T`Y5 z`|;KY;T7T=a30JWZl~pmQnXA#Jw>W0UGt#|;Mp%9f;*`>N3a;&vh-=j#bYN|<>j>o=Oa@*21R&KTsX!c@tTQTUh7?^>Q2novAw`d54- zqWq`?7E1|GD1yA^;NAgX)s%;xy!gcU^JHrC>yH%U^R9&6nystg2}Lu!)y-(Bnq!2L zZ*lH8xh}HM2X7@VOdZ6O#Lg*NwE-jxYp}tZJpvv$hn{?jF|`9O8=)n!=JTOuP~un% zz%rwWU}hE#bYadi4OsYS6r7u8eIDYNGuoJ!5c`g*Dn2o1+b-2yKw0e~NJ0t7xEisE zg44;!Q(TEL90Xj2Z+V7bU!-32&v3P&t|AzHGG`VorU=XL{91@U?2-Q8|RJTM%)4H zzT9i(HRE9tEpp1P~;4ceyTb#;yHewbD9msnNg5-akb!631U1iYQ%~ z|CE0Ii*c(pz8{r&UDTlRVNMJrVsBtrc7F0#R7)*U^M0p-&Pdn|O84BxYdU;3C$5(&@j^7Vt?0j^wIw0eRQWr z8KiCv{VOj`$0{Pjh4Z*c%;_=Z?=)ya0KN`6Z>M+9T))$xI80V$i_$rv>vKBn@^3Ce z{DaT59kmWvAu_p2!iGAm6;gJzUTZB3g9u8qv9`3_t<@$xP}37G*c%w0r%*lZD$|5# zw~whOaIXd*%)x6O6LxF8MNHcsS$dy}J?+8WTk}~WGmNt5x>xHEB~QHb*2ck^;6C;C zNm``nrz(kELY>mFLouhc2VZ>~`!@Eh#wEG&ZX2%ta6a6-hHbEhEdDbP;5Iz;DX(hi zI&@PRV*-d5%2^-;6LKWh@Z%FdIwlNFsK@xIol(}XrBdxMiwg6bQ7eFf@P$YaYc})* zClGzRny~r23M{V@} z3`u-S#F~|_8=etl^(F!ma2oxpLZiDh23}wUuuRB~ zQE7iKt(QjJw5`;-}dd&ZET{>)V`< z`bL}Kxw%4G`XnK8qJt;(>Z!|biwk{O@sYQ@ag@oXYDb zr*t7#fvArITtM1VI4e=L#^4}6@i~q;md!F2r*LT}oQZxLLA+9-;2Dvq8LdX*L!Dq0 zpvi^MABhIUXZPZ(G&t?3zDJ*#K(!Oc_@Ul~?~(X*jmw(rc=D6q#h340cN=_E44t=)ynZx@2#iV>ag$L!RMe* zA$0Q?BWa$$Zinx5(t<`d+wmf^{d*&EZJ-JHGKncN56u(G5|V`7MjP;^u74bUg>O5XVHP{ZhM-h_I&z~qjL4*7^#cPw6aGf?BU#9 zF}J=bDo_9*)AS4ExWzU}tm!$FI&`X&X3riffFJ*1{`Kp(>VmjP5`y6{%njSz!gBHCivmv0<+_Tac=guHL?<7lHed}wWGR# zl7?6#!v-NqvbyADvhm)*wb_qUrqmm|5+WrMS8Ptt3bX)&k!lWjOXu&$i~Ro;)lb_| zv&#}6I?KCyIQL3vS%>`ro9G8y2o~3s=WkfGrqD{V>#4yroQ~tCXYwnCNZo?O*EFLU z`?nbGz_o-^38PbBH}=vtYHQl#ui74X)(R|)jc>I_KT$&88T^olu3d3%R5DRjFmlUV zIrA9NPm}DbhwxQoU4qeIWo7Ej{M%e{=2~ehwKoAHOfh`~TBoa3@fAzmZkm|qUlf~8 zj1kh|4c3k;E+Dqu&z5@Y)GCpo)h?TD)^Q?eAO)xQ4--TXG)mL~HmH#^7wb7&r9ulE zDrlH}s|(mYW*v@}#27Eh*=*-r>Ii9;t%71;tUe{*%sEQ3a&j&F_C;bva_BDDON5gx zgY;jFxG1;n1HFe((pnvmJ4y{$M;&g5#-5uAk2yjpk>77_7*|nOE?}e_UbZep{uU{p1BM zPIBn1d1i+xNHFz_@BmnnmoB%C`atCXv>Qu-Iw{lx0Oo9XqO1@Ik^?j`~M#w`z4$)z! z6bSpn?!Aoy^C-zS)Jy5r+`WhJc{cIB+Ab%FH3fHa?Vs22%o(lz7@PXn6-xm}od0h*Acz8jD7slAV$ zgzL|B$BlU6Scy6@QdzRiv^=LD!2F+Xy;8eT2?I0v{C9Rq2*&wcY+H$nnhPn=>FD_Y zc907MqjuaQU;@5n8sBM<$D8AaC?+&;^CpT}d_(F6ymC*H0~g0t z3+iRcUoEuKQPO(l%^1++Ou-R|yhu~e4}yyZOn+nnvonm5+Cxg2Dye@*rsk-W0eqnD*t>JQLzmRSW&q6jBB*=`}&va}&Sn zy3U*Tcl2b5`7~{Uf%YQXDwRrCGLPMQobOWN*yHdykmy@=pxW_nUCi#;C#N9u#^S-q zs)sS5UqqjYYUlLNEL1vN6H;FNKR3284 zV|n>|^n@a@rkQGC7ZXU>-w>5DX&CoHRdIm1Mf%KjWw>vf*{QDVIW%h|doBr@6HP;P zYF-`p>>v*KzmS`s2H1o{?+gcD4VhLQQ2(CnAYI!``O-oA;`{(tPsZ;#BNI^#Gvkul zJoxPTATILIsR=U3OisT5r=L>Dbg9C)w)c&-QD0#7sTqu!@i1M^%-$Hk{LGQW>x1$tZ<0VsSXHps4Gi3 zC+goY`9;g!LQtDy?iu%NQ;*yma#2xTm!8~Afx!#TgI#sgKPV@Pr%t@k{xWqUnR{pUyIz_KCr{{}Z%`?6~85`DwSp}K>%w@;)hA9J=7>SC_K zSc76WWJ;Azg^wbxS;I>(s!~Mee%0wclm5UPFfp7Ngv2ILpf=(m$-dqo zY1mH%%2<`flRR-F_7sdcdn>oFLSP3kxZbpedO5+A2+bm5aU7mldUH@G zUB23nAlq{y*M9%jeum#C!5UIt9bL#M-3&%YK~xA*2q65VozemED}RQ6dCR-|ATxtv zhK`C1dn+8khu-{LIwRp5{epf>oAX;Mp$0>HwrT+4HhtqFKv)^gcbJPr?M6SH!uT-J zcZ`_)n#gf&-2rty2??@-$ObwK;qA&w8-=+v0vZDl_joC4s@1UuIMhvON%zdOyr)bC z`}zt$bI_=sbRWWxANdm#bp%D{jaDWADn&JW)UORyv7@GGP_+tisBb8HY*rp-azzdW zT!fXtDj1oQ)@)_6Ie-_Lka1J96H5IgPz^Rf-CvY<+%DjsMcQXa6?nzP$%D-h(t|{2 zNIUTBx`=ou>8*{B=9gU~q&}XH6}h=n8{(>WpXsGdel70rb~Ru+R2H)Z!2+1k7pSBC z1X=4{klUzub}+u;TyfX$7?KoFrpQ7bGO^<%=B?){BW}nLjLOfisC~l0zvpE2+v^x;$*vA`XD zu$K*s7Z~M!KC=HzAfZG%!|z;Th58CLvQUH4^U3vFhDd$YH9+n?UU3*0>8|asy9=jm zN5%1qnxr!qavH9@dO_qE*_}VP_K=$oBh10@NsgOCF36hCk*f&&b2<-43UhuV?Hny= z@kobSZ12X3I9+Q=KSeEr0BMW_kfULU1m1+^IOu~ZRO_2BmAMxm8cT-9y)U2XI9o5W z4bu@YD~fh!+uqwaohQ66SCr;cra04RJ)cB75_XM~*0T#9#dppLfRC2pzzYktqb4`K zeKT7iUY2)ojC4mKGfzAgb8N#s+yE8{I`fqSLf(G5SMVY?V;|q)*zercZIA<%ru!!{ z^tap55xim$92S2T84hTneM4^fF}Az(%o~^(9BwA0tFcyFBy# zCQ?uzFT`=m%wRj8^G=C_M|{ASfVczNBH>UfUnEZBMsUEhSE$zkSmgDF`@C>=;m3)p zkKh~(ZPn@y&dtf;udDkn!!buU1*+jsvuFNxt|Ow1tCXkWYPA=*1?Eo^4GxmaI^Z*D zTHXQ5$f;BT{IkS9-D?_h?vFeDLxzk&MWdVXNJ%7rpG^}I#fMI^sjda|v`YyjY*)Zr z*|qI>Ug5p)AOfj*fY93xnr>4@CArYXR%qyq9J<9Npyrj`JG){J^raKaCd^%7b-4_N zSm;IPOP+z~J$ngQZcIBZXP0cxOz>3m4$bH)$GcjOeQPM|H-si^&au$8$9LN7@b4vn zVz%(!@O@zYp5^nxvA$G3G`m$t>y2cskGmR+U4?{iRmYY-G#LtoRHLM%|T>#gtc| zKDx(r1r)7};ri6`TCbayho!d6?{S!PR?s+x=&~~gOo~~J5f@jdYFvn8+(Uqz6uzRyJVes^HY z1W6vR8iRYfMl(ffxm+H`t8#+&l~{&3b9)#DsyFf zFRgCrt`oqMDG??2(D`E%#Xzpvd|JtPM(>=x3?l&v3u}Z0Lwl^z*rAB$qPdiZ_EM_T znOD1MCt)9PxPw1SKfvfiJ8Ff15`@p`hP%yq@EwtDYm;z2xu;JO+%s7cOwS*ADeFp* z{i7~Yf&&+x{PSPFSZIRbhyX)jH1odt9IafRfxkZZL^LeF?IWo$O;IE}qaUhp?~;gX@HW z71CPqY)`pD%!jgXTRevFSKUoZ;)%Y^gGddS7as+bH5=YFgV#9gr7JFf!v3pvE3+(U zyc<2g_l)KH`2kybh><=6@Ct`6%-C460#~#-(d~U298>-BN(x-%q7le8X;x z6v$I``X@&U)Yc6seb=a?JT&4li252ixAvFl-Xm}?K5;L_KdlN8*gzI~9itzRdJN$Q z!_*HtQcD?<*Hf$B$&*oP*S0A^Ug(X>VgI>jeyvZfrhWDBDe>TbXE^kvL%@=472Xe$ z&Rrut)G&wgUCUFjA;Jh;^9x)l@iw@iUdmQ=@fZvSv%I_1EkL8)T4PIn+$GZ-^F>gu zW>jh$sFMrt-0kZ;(mZ*@X}y1MzF!MBsxtHK=L^L>)tnK2X}WCbUdckV6?^jXCCdeC zFMD=4xs$0X3A+bLGb>6VSTwWpaHq}@dhQoG98k1uHAPMEGCLvC`V5@i!+Qgu-9Ut! z>HFn7*+(=K(IfD~$SCt2>ABt>f6!8MS#V=aJ(L)T^n%IX!-^0cAyDOZZ|k&{rzR-} z1Xym?^lWkF@&_%_W~X+%{^Q>a-V{MEvjA`K1jg{ucJ2~my7qkfnQ0t}cIN@kF2zpX zv$lsdSIvFnso476o>RS3M$2~N>o`%)X;+D#&L1}mI$y{$B0W^^44#CuA%f>+pa*Hq zt&QPDXUMGFBC~xFN}nq-A#}oA-s1q_sTj{Hc&9znjX*wH_XDX*`#*SxSMy4US@&OB z7My5M6{+_1)g4jjR?bwE^jW)Qk9?rf-q`4yF{x%P$Cf=g9#WQydK0BL#@-Co9Ekgp zWSWlWoExu%eiPhniq#h_?V3^u$$1}J`E@k~Up-dYdM*7>Z0)YF;qQCo{1t!vo?A~u zg&6l6Zs|5afqj;ke1OPDWR@mv$FgHRxQ*Icxutxom^3zUPgFNQt+I>uwHFv#=Tz9U z1!55Xq~+ZyET>AVZNu!3Xxis5YgDIcJ$JOywfKT?%p6N}4T#K$Nlpy7d>$jko=xE~u@5%f zR@HHXz(1T=gme+iCkbBe5{leQBhf3*mut@`sYp7QbVD#>8_m{7s#F2t>B5pA%AfW{ z^0X8R1O!ex2f2VhG{ls^`pp;Pw+pVb#Jf1ojWSm}a_z^#$Zr<)EBp)k)3r@L1`UWV znGmsn^xUamR7$ZlICK;rN-p*LB6#}~0g1SIS|gMs$CoC2E~v=$x|;rG|Ig}X+VU?^ zwD-O{*IhHa;%J~@M{|uET1rXKXG5n>Xg}V=)7pr%)7JG%1g;`oUuQsW}EZMzRN66~%zI{dG*( z0f`*J+=|l&;Gq>~CzNpi;IFHqyi1Gb7t5pX^DCCTIXIVKJt3{^?c9?8 zlw*zXi(QrHDmDf9oqH?Sw5LK!w!-Iq-y7qrM=C7p433EOS=9N79F!{-=v}?MU^VaL z%Dt+qcvr1=wjIaR^qAakMY3nb@*CDnST-bN9&DU?k=&psIMMe!z3Xe) z1Rgiw(9c{ZX*V!s)-U0Vd)h&}^XOvqYwJYzu@jjWOOJ8Pm4)>Z+(%6p!x4{gO7972 zZ;G!Bl0IqijaEdh*xDGUueDnMpv{mc0C|2*E4@+D4Mo|fIG*uADj?J%CRg;)R*SFG zn}8j=|z8RkAO@I*+*kf)Dud^Ae#R=p6fdUjjoj61$+Ip2HvZWk6htU_#%A=&m4 z_zNg2wz7u)$-*A5aw9FX`YyM!*DtusS49cwo#kt@UYR{2w{cW6i%Wh_nVRdBmpb3A zkq$AB9;yk1lKd6IWNN~rr)fSN1qa!_(RMg458+<9sLdc+;F)>ta?kNiTsfu0eT;P8 z)YSCVs{O6+*t=-Q@DJ3V<8+qh2f5;k?E*)4_$ssGpLP7}@NQe`1J7oRK{JqOm{daG zAAJyH6WqzVdy}ougbv%a^v~AYIw2^ymyxu}z+T~`19JmEIz0X5yBKg6!Oq&{@4_UJ4@`8wUJQ$X1$C#??WxTn+;mYqkC^GsvSce$Ek#eR7I{(e$IHGW|6(4at>{Vt(e z^unv*Qq+kT12N^({GY;4I7MQpu@u9SV~Wg0)l4$jT$2tExc8Ky{Ns6?K)&5)d`P2ADa3zH zgIuKrG%cW9u%m8s@zR?kz3CXaJ0i{{caOZk8`Eeo&;U!OZp5Gbv9El_bL*A_+*#UA zq);wsoq5WCzP!sHgB#&`>1pORLh`umbC-yzob<1QUK)KT!(1iar6{Q_1~QtBYp(x= zNfw4xyb<477Q7=z<;VMzBTh*NB;}XNfrLGCBf;YBN`Uyx*|GLERQCzB@}@;;g1t!D z8z=R+U7eZOelC#0>ip*~1nmx8$@z+^KCh+K`Hz^r#!f!3^{6tjxSMb*2TQ1?Gz`zA zE>+})Nizg~Jy}W7ce;>T`d#QiNRRKYc$!1$sFPCF%J)9&WfL2n=FA3p5KH7tyDhc+ zsKNfhxW^&SC8%ix_trzK*y2M$!|yUPodz1yQGI*z%?|Jxe}IULgx&b^O>|l|3np{C zz?m25r!n(fFC$6YpRKJ$i3FgxhH}6D-gPOOpsdyZV{p1jd5rsr)xT`XZx6)k4NHx$YdJM`)MO9n8$BlgUYdm}32x(3$SFX%k3+17!CpJWDXJQVD z0t)MCcMixgc*o7XfBh5s#gK@a&_uf}T}ckwpM#^+6hKQLMBjb8CGG9q>DfepdL#A4 zQR}ODU#hF~t&*?;O+`Ihvnzb9oOe$2?sMz280m0e#S+8dnJsp|6srqaEtqim z3KTCOzxjm2%BhP)a$%R6l3@T{g>Z>@_wHSEbpKfx@jxE1KphBY`v+!Cil6NlcJipS zkQ8babA&3-D>JGUBFqB-=sn(1qr?SoQ%?p&L`Ccwf+WYe^vll@=- znhioLiedW)&__gGfO`M_O6KEF@(g?T&8^<@a=Q2SoJJ_?Dt2rCtk2vIz1p-pk9X}3 zhFWe(sPT0gQ*j!rh5n<#12<56MHqOm(YQ4gnqIGAtNQZA%g#(_8y8o9R-5!0nMXK5 zrf8-K(t7vwcH^kcXD;pl1gwV=95h3QYrq;>T;*oY_GETu+6h=g`Nq{S>RCsf_sPlP zTwGs)pYOZg@7+K-aW<-#z~6CZIB3^CIZF$RNWg*oK-&8iI|tx0K1)gefHrUURx>C0 z*bTlq?mWz0LV2>$6DN2k@ZuZxfHgMfpC}rSjgCfYrlQzuCz_1Vm|9;pQ&J`igC2k{ zpkw4~P0P=X%GWmC5D2~_DQG*`OfwsV?uH}w4Sq+EdGx;QU-6h*zGQKd?8p}aDig3_%$joHA2i&QK6`PS2UD5EH|7+gWt7B zIEospRyQ7!JN@N_gq?_LV^`TrQ8r=O!;j@o)2v83I&D%j*;1FFsY+Y=JBJ_89Sg=u z6(jzoufNwkqB%joKGC>ocKpMstyWiOXQo1kelT`^#*-(`v?;^PjOxIaeM!9O?ueXN z)7|hvd)BF!60d?r_&45&&HP*@u)dy&U*kB% z^RektlG$Yqje4^6Fid;7<`g;Vrag1T+S>Y){62EfBQgZBOC-qo9$QhapW_tI=cxh@sEa#r#zFu#QI^>Coh<4A`xG{~%O;e9Y*B z>L@oyljFyaA3l6|bF0M9(TZdo4!_aX%*>3jz?oN9UiAk+?#`q}ySe0#V}2!cYvP2; zpzC}4sbQ%}id4an);M$->@J&|DO=XGhJ|J0Xl{0|{6kc46hbUR0iNS&N)gH(gemAI z3hV=7x`EqD)%A;d~HK4o1mQIHc~cXDpoa$sk5v?jw7PvAd&Pj7-W3q~9!g?0MFp@+{m zjY`x6+G)zi2`*VhhA8k&C1cooP|~`$=0cHXUt>COCH+&U^2ynEnu^R+%~*li!uLa0 zy65`6cPH>)$=7}r&3GkG6$QqcHFQ@-*xB03WRARg^$Pk#RcsfcX!~94k3t-7^<|Hk z9jIY}pD;9L_$X;4N$10DL+YCcsD}r3mdKv=iPxy*ai;4Mt_76L(X*MO6z-XAb8%xG z3fkIDFk;Lc=;7wp_7O;;EmMsFCY|HLs)JizCY8i{@G8`Hyq9D2RcIR`)lM*-d@qF+ zJAfec^>S?4zFRwuAok>nJp8GbCYR z!qa7(bZ;T8-*>cVIJsP`KEuIoa_ldEe}BNL5kF7n*>#TohxDO+{tZb!x=2zEz?l<` z&-&8^ifeReXeer#J3MJzpSZvCE#11K?cJ+bL_6_1R4D1_<_FT8r{;;(){o$R5zts^<6hG zU}`kk)9pw10SH}WIoVD7Y`qql-AD^l`iPk$WNI)`tno$8_~Q%O4D_3KvfPAZXHSAc zJoJ8KW~fJ)Lw6A$dHz zYw81cHCJ3j3lCPo!ALpGr2t;uxK58VEaWmqnr(R2aN|>hd?0}f0Gg2Pg3UOaM!IS^_#orbIrS$dW%(YJtB*{1^gF*gX zGrimZGvR*O5yuJ+z6wgnHXnrQ3ujY(KFeD{QN&)n0HBUB(&k!@W%&84#_qut$CpF7 zpc;EP6HAZ6Zk2Hpq1hDiz!5SbQk{VAd){dTaa!KAH&MgRS}uf=3hLBc2xh`9EOXD+ zjOdm-nEO|-T0VtcWXTtscPA_Q5%`C6UJ}1mKVS3@lc|uYPo}HyqXG zDXE~`BfR?6lC*(!9e0cm+vxx8Wef4&U_I}cl=JO(SUqV}@zr%r>Wd%!TY zoVDC%f`6Q0ZO~yrYbB~Oaj)5pzJ-1mb~DF2+}XFaIj;0%ig`PlZv8PbMG@`oJ|gTo z@Z&ND>jlei4}@qd1Vwm$2-8W8?spy{vG5u_yrDvpl*Gaci?+9W=`HUO>GK@)4KOm+ zb19Y0&}&=f$C+PW;wte?RDBWGn#lyC{euCv5XXkH9JB@_jA0}6>U4>=%>|hH;NP~yBm^V6i?+I!4Vm6c zfbzig0{319USV&5C4|m(DBZ!mFaU4gLd+2mT{#ZtMz#fa#uDsu9VXrQK#$)nAXg+8 zo<09KeHp0Z8PD3(I6giua^ljpYu7rJsulm#1TRxkfwQx-+-Vj)A{msj@E;o2c1G}9 zKY4AR=PCNv5B`wmpTcd@3hR&85_-G44{X1%$>{0w;-f(yK$j*xNj}cjPeWt9{**bp zY}vAw9o(BY3vYJ~Gcxz?ICoR!+vMk$0UOQXt35pjx68;iG&FpDwR)l%^xv|5t*Fy; z^NLrmUuVNksBDkZoytKe@BA5EH(OQP$y@!iJuHZpJn-k#rZoL)<9L5pj-qjryu2rq zOG=5T+L5D20*PkXyXEK?Kr=uhb>^d~IY0fHbQdyD%e z=RtuLroJJfXijY%It^bLK@p6Mx>t?s*Zd z`PlF4iGL^3r5on$11unQOX$xnp-Qw3`VT@?hI$ zg`x-+s}apEelhYGht{x(9F~R%Sk8c$YzVH8dnwG|-h`L#4(Nn>L_$A&k@ny(bUK9B zgOd~euGA_$f@MQ5{H2oVc*SD&#=`T9+rhSmi513azdT*H;ctt;KNl$zg;#$)BsG`? zq?sH;`NKld;6Dk)6(7su!s`zI@-k{2QNQljzg&^{cKp?nH^Ktzn3gPwjv4Wh(oq@w z4oWbV-ZaLb=nNYEuDpk3;vEcV-a^XiI2^ba*lzSpK&?|NQ|tx>zI093jX2jmfRThd#M&#SHsf zvS)Q+NL>F2N#SUj`HThG6rervmA^ij0$y4Z>2nOc;Y}lDe}`;d8|cgLBdDEWJJt=O z@qQFM-UF&y#``O|?QUpDQM%m(V}TRBo9Q$Jxw2W{ z)EI=Y-<~d`%5Wv&fxYveAg}<|xyA#(h3fo!{pd}zKc|#csFTwp@&th&=sH?9x zXF?Zt}0!NK8<;%uE# z80!JC#Cbx(?nbfusO{*tC%excV~JLa+f#aquJe#`cQ9(ZiD8QDM(?6EQ?0nYH! z+9ScECQ2k;`j!rj2Q({~d%;<;##)ZI`{b-s=#KmE);bB^iDG8GV#5<1d%FCPdc6x@ zJ*D&O@Hw^S*KStOzM@da7La8b5Bm+%TAtLhIB?cTtvKU9c#|qHk>FGERpyD}d$`L> zUIyT2fYL}FybPoS1?@Ux5S5<(v;5U@niCW>a?e}_GYu^4?NuTsUkfNt5VX%+)T^qj ztb82TJ0RRq0UjY}7RYAX_ffQ|WG)d*n!1Z5XiRalGtp15nD6rs_-}fea#)8q*n~vd zHj~alAc$-i{xWw%>x`=a?%PdmyTTG<7tJKI?Qv-!5%rv$gvb?#wqK}jXxJLr*Vw3q zoF<*zq9F+(XMH*wf7_G>tG$E{+N(_+p^2zorpQU3Hn$@gVQp?jLnrt~nuB)}EWX&! z|6!}PV&O2UJXWtb%TC|alp&=!7$hIQ0dG)Gd+c0Xe;3ms=@$@QZza&DmqYF zTV8&Cy>%*djV-4DA<-Sw7@I(MEMr0&s0&w$fM)$3;OH5s{~$Qg49V=mqs`z3qLX65 zEg=SL*!|)5?b~&Abu2^Rw0>+i2)z+GY=x#zyUZzIeGFVG<@B# z)(+Z7GIqhRv)ZM1r;}1GzybSetSUyksj2CuL=afkkc8iI>#QS$f-vOefGyL(aB;QP z*HHPF1Xok=rNV5*LDX#?COz|OBt}L@3#1_*xwxbPLk%HV#4{3xcyEAj@g{JBbfRhfOcqTCx)5Cg^>^z~+~>b}Afk#w`p=H` z3%ECexV;;SHF06&HqPJa(v4mp4055X4-3r{mcj?FGjapV4!He!`3%VL%bmbKNeMQO zR{!lRXbnI+Ojm=CBF^8t3g+EXn1%l97P^1NQ|OZgbYNsIsVaeB3__t82KK^6BbD); z$B&Kt8s~g>>Tjyhwhi-VMVJTQRzAoGvSFZD;8pNKMz#!N`}14QrEoAPZJuhL;%E#8 ziG%{+GB*$YyPcpq5gosNc2pDy!W@xA`_ydHbTpjMJu3(rOMEgT%HHcb^2JYc%; zxwwL|N9K%RJq1|fo*(lHoR=n_0Q5)1-0R-&f1*5FvMz=+K!=t=138g|sYlf|T9NVlDQz=Nla ze86?|(SfUlL%Lk@C$WDs028rpfv+-1va(Zp1oGgQTy^DlOzULOJ$yh5AKS+EHy(u8 z4d4Wpmpgx-3%Cn6uoTB~DF#Zf_Wgp%G~UsmDTZ+RH~a|04F*?R_t5qNn`@cuh~!T5!JVT%K#c!&O{V@0mS z`!C5+g)c^)!{7P$MEt+m*Od+a+`sHA^4tc0)PQc0Hvhg;y5OE?{|r)Cyg(s6!l8q7 zpw1KgJ-P?!fBVWq+v#6tpb^{;&FgXbbMRg+UIG1g`knsIWSdLbmyL1sfB%ArBFx9R z1eupg90Y3-Hh)x)_wP@Eu2B3J%tW}#^vhp<0p3#Hfqq9!*H!rRJ^Jw#gO57=7)71L zLDPh?G-t!ANT%7ZU%nhVbcliY^DpqOx)T+;f|*@5LltOx4RY2p_#DR5yfZ*^QBY7g zD1HrUX2cdaJzeebulr!C{UGCyd!X`|nVXM*b{F99FJe^ls4oXvCNt8JVNcjQLtcY= z1CLxwQqk6SnwcEBuxs!cPE*D; z&cAPWdShcF(iBILA<#&LkOA0XdiNzDv6lXtFRJ*fjmomj^lf{4Sq(J4xS$o3)!SG3 zJ{`vEpfQ9xIyy$$+d-_s{g7gzu_J&Ip@nzkGsr0zLfzdo4a)xBMmhz$hWQOOLo+Ri zr67QLpF3vGXi2;~xWB)DaIY{-Tx1e7H8e!}rKoA+3>5Pw#>eMa{lRGV9QxM+-s}#B zcI5X7EQ4&9ZbI8uXgB8}!TJ-7rPP!ZI$sO3Uj$BvHB2!%Z~x-O3ylvZA0@|T!eBQx zFt6ws_Z0|Yax(WqabMY2k#*lzoVeuVH22qEe}GF3oOv`F4Fco3x;b}q%Kyr@+3ga~ zMK~n>sj{Krg<2!V;W^R_{2zreC!V>J&`@1{4at@*7su6BKn!jDtPLav@To*!f|*9p z>JS3%u}Wf%Osn$^L4keB9Qo=M&GY1w4Hwqp{khIO;Z1|#3eKyGpWicsrgpfsTm^)R zhK6*ADVo*56bERWc%0z13*?L6<6ZBD?ON__irp>(6GF3P=j(ys4#>QF7q6c`Y0YvKcXQ(Ou7tO_1bkNi zgZlMoGgxB>cESLw%HHf;-OSd9eK0bF1$T{m^Uf45?Jq+oz+CbW^e;c|?$4gT$Q!uHM2NFXWAVZ2OIj&i=W^=3D zOG$}|37mCbUB^i9uY~MRfF|zeZ6FpWeo_)z!uwr@Le}pC0}Nvic7O>U8H?Jc)n8#g z6*(Kq;~=TvU^duc>lX~FW5NqGx?{CgN38tjOyC=CYc*1>jKw-(_zv(p#C_HKxaRG& zCK$kAc>Vf;D&|>emw&t05QoENi>;#+`v`jWxy-X75Cn+$Pc$SN*T>4AhGA0HFj4a$ z?H(G`1+|pf#hEZ71DA>1W%O0(tlZ%GM1KQvJ>00u0T=HVRI=XL~|)rMIOz{N6QqCj?bHtVqL zJd9v*U=~5)2jTzVuzSwlfgNGc{s)T#M#fgoL7&daPJrx@ekT9k*>oBHp8MzvkwhzxCE9xeWz z;etuvC42gD`hVDyQY#I7E0`bjpP>hrD|-V4MTWsSi@hFgpN=03#|Ls)s&mk#HG(w* z7yx&nt>S@8digRW`qDR$EN#p8egBWHbtyRDciN~;`4H*@_rJe`e|Q7!|LYCE=r9=i zEbeC>k)iN1VX@wW$oIvAl-^*6to6^H^B@k2?>cky8=5Jz_8)HLiTB2tCWNjyp%M^x^F)u zy4-cMN5XQioF3+f651}K@L%FwwUE8Fw-q8)ludWX$F0B-2k)$Xx#{qBVK19ZLqo%Z zY!^hkM}qh4>b^6PUouONv!$7}+<_PuuueV6WL@6i=-00)N86_pTE{bMia61~;d6)$6Ywkj7}DUM$&}>E$-zO7 z3ew$07$yIW{wv#PW;RFvPOeMn`JWj2KY?h`Ncl&yfUiJlEf^Q`oD~R!5q8H8zmzN< z;pCwG;KJw4ckKpQ)%@1||FEQmi(_13;TS0?Z7aPs{XhCl{z)jj8-?&JgZlw2F;3|J zpKU9&jN*aZmrL*UZ)}??Q#4Bj`L&c^F2xUwP?q8-(9qwH_Z{3Ai@XTCLU?8=sYUR- zM2)M^t$qFkRFCHpqk_Ew$)BKZC4jC9`hKC~Zidz~Pp2|!w4;-dM#iHZ3AzdRz8Rj@ zc^Sd$uocD=fsyspJQ13~Jbt|X7rqDW4>ry;LL%Y){#0mfjOI{hgL(q(g+bAWNvd|_ zN*HPcg^&n59fPDt^OXGL;vlazG$?Uyg#i!KpwY(SSk|mTvw&J|iAkY=_&jq*kYdvW zw>?wT2N-QTw05gG4ClF;SK@y-A~O>jU@iJNAae8_8aWCrONUf3a7THHMy97r%*cN4 zZ%AE)C$yh4@D3Ul8It_+ibgz54o1Y3){)mMhFnc!LEd zEsMv4m|R{(doni;fJ^Kl_;X!S5)%_i#@b0{G{v0ri8zX=9P0+l+si3*NfIpZwO!d; z6w>xth9C)d7Gi8*oI(-zU4ngILiKRk+(LG+)Fw0*%QXcqmgjB_B-!S1CW2HjiUk|z zAvVBj->0odt@t^wfab1~|NMw0@7IUE-*Y!9|8*hnAWLuirA7!j9f0HvxL7R*W!jwo)A0S|fwkL}Ra7P*8Pyq= zv1*nIE5bP6l`0J|pt^-RBY#HwIqskyx6^SMTTW3EmTIfPdR=%s3;>Tdvx(74uS0^- z)DLW!?7MppCnP3b6&z@G`grC#SccsNwPA5MD{E`W;Is3}z3OmjG82LphNhZwT2;+ zey{5_$3bAx8zFkJcL+2+*9wXskWU=6N(Y0b*L0(Zh{!nDK-C0Ed$F{c_QI$1=g=bF zTku!6Y~BnPQ36)j(W6J>q|{RECi({nv1M=az^{nOGI%ZTn|T9_x7Fk&Ot&hz4nyKK zcGz|Tp?T4FtaKZ&NH9(voDccPqe}ne%)q@(T1n6hs_wnii2x)Pb-N~0m?Ge83!OU4$+)+C7qjg@orumSV9)dqMA`UtHR zR`UZ4T9fp#s*(d?QBlU%uNP%lk;!6TZ*v@iW>~ErC$h2QfP`|K5Y+9h|1gjYmj%~=rg}Z(6z#8#>w*ki$QiI{JPy8-#&kR2 zCGo&2nhD_8TKDz1*{fuwkTK}XvtKQCmulElQ_isRj@a``2{E6mGB2h*G`8XEE`ch3VlZ9JyNq0{ z;Zkr+sWL-GV@_sBB(Wok!xk6@jIul;evMW<3<=%&sm`SJ(W>uvOi1tpy{ML4)nIJ| zhY@OqRuWrs?QHgc+0K3Vx_A0{bW*5jAxPMc!rWs(i8A2GahvL4#HHh>qc+e{DNC4U zI0#SC4%-#(U-J)O_&HXcy&E+)@(?wGda4#`KDU$omjpl&X6<+! zRQ)ujMMUt;bh(Z7R0mk)Y6CW=SoY*OX0$%h*z)YdhR659!yUX6XT4jEjfypdN1?sb zwW>0h5aN9Q{!Molsk9p)Ew5=i!Z2F1&5%UzkQOlTHTmGd(2R`68;>@cLomH)_Ky>A zSCg5^9}e-G?%u(yq%_TI{F5)YzUJA7Rs+Z=@EeOWs*U}+vpQ0ZH9EfcI0sPL;Y(p? z))QHDfKm37UBZ``XjJ>;r~F5$Ng5ue1+vfbSx^ffw7mc`RYEa z1%Hjd!xWTF9q<8$ex%Ilr?0qq=#*lK#umuxcLIO_dZ;F-y{4oux0Pp+4lk3QXa! zYf-`!gK4IfcPaAE#V%h_YMI~j_3@ywn0OOF(D3IT+)|R3-CxXZ>p3M#eS^6iElO~k z$pgF`>(&yc3)j8-oXEJ=%3kRnZG(oq#5AStKVbwf3?Q~mN`a{l$y{@h!d9C-!|8=I z<)h(Q^Uz)L9jstzx@pcaDZVON^Jur%UTM?xF=erBs?Ny+gOE2eg@3lkex6W265?mQ zs}NF#e8F6tZUV{g=XP9BQL!$(r(W*S3!@$GQ#`q)`guZJ)EnnGX%vjN=m3PdH_$YJ8XS@ zJ?kfZ%LO3s0@wTH&VrvxX6Rzl0R3q#q#a=94jKWj4Iu#- z6pvxO0Q)NdYI!eE-p2p^_v){Mtn?!*6#6qRGD8rzfFzIyPIfHC}=wLl1_!WT1cH<2Y`5o%W2IQjwPX9E% zC;$K{fXn!G1yCjzT+Z?Zkn+UITn%RPuT}MD_RO^WWv?~>Y|X=>tgbaSn;pDu4Mjx< z0O@%j><021XS+H9>OhKgB3A!F>HpRzN_MDZV`W{p?}g{It+!cabE*oq{Z|kFd)TmJus8VbN%03_DFHgA9Olmjnp0D%m>r>0AvORwGU0N?oJbvPi?ET16q zPiOs8f2uKk4Br4VA@x%Skofe6b@>O*$1VTot$VMhr>7&&4*$n4|4Z&4XrdU%v$Vec z&fR&-z5SYJzONHs6kw?V%* z@duedC!j_`22sR)@3!;a#R1e1$sSPueaX?u#l^?I-p9UmJb*oseeemO3QQ3{=Jnp^ zv$C>k-LC-DLF<4b(Fc{kyN_=$o6H)eYo!630~}cE3kYgO#k>JH>b(ID`7n~|rkzND zI*h?q3WoIieDv$Asc|^_uPYT6r>5fC7cT(~;^E`tvmO8fJ}w*p|j$-hM%a{;jPXT1J@D#yeLe9*KvHa9;3 z+rQK8{Zt*-<*(IkOdCJ10QrLnq+~UAKBrpCq}l-JZ*Kswqz@tN>&{9sUR!^Ut|6fK z^K~Y*1I_RRP}}ASIQ5bLc~~wq_3fJA^Lj~m{O?u@b7-|1ybUv}0EA@#WqH`ai6{ve zLPf{djmHi*1w_8rv%1ta+W-0x#|7wzG$80ReAw{!qeWcQ4C3SLcmE01{&iP{tpE^L z?R#GiI9O5}MSJ4!$J()N+76BK_50P)k@ffdsr;iRUcpcSY+o>+xZ3#Ie^1+_jz7!D zs;ZeB@V`HtVSnmA!&1Q(A&mZ(x#Gh8qF(kpFkq+e!_st>8-_p9!SJQ`?{13zoV#oN z_&&b*CgVP@_tvjxtcM=G_qRO60lT4#L;la_Gr35>j*_kIVXjnZdC_+pRu5|6@0%xU z2gC;d9HV+hAzBB>#T9+<=YPrPhq3MdyZs|u0C}(V>HEFj=e=my`*QZX#>1~I)xSkC zeBSx_+6hR>yg`x&l)kGx0NU^ZD0IJ*Vqa=ptTpPU|B@og>E-3;_sys8XYIa#n)gvg z-#;6vprBQV$F9HoY5JoOn6u>~Ljf^9@#Pg5n2UhF#ijwk{HCLSiWLD6xpl8{!{hMh zpGol=3ZVDp`FoU-)x;1n@cw%LC-CxTu3Z218?ep#vpoO4-JQRrqIit|wu9OEl=|5S zKx;|w$N(5D#ybLtT#f&AD*!cuy9yxJ82JbX_@p`UnzZ#lW(b9VDzdk)WqI@L* zn2ZDWzDwW7R$t0LTI2tZKLz10e&SV#DljIt#!k+TCI&Wt-q{&i!Z5NkG7vHl0^Snx z@W9Y3d)S*0(yPlETACO+!_X_a7&`y;iG+=TnF$QNnuW2mIUyqx0|N~GHxmmpbLap1 zL&(C}N#4X!*v`h@&ep`%nUDj9Uf9ms&QZzUzzEQyh>5F(k%_pYfd>q|w27@5pcN(# zMs~u#UNH1x7S_%tj)e4L)&|ZdA|^(5#wIX)d@%oYtL`i3-Hh-+KyaWr&+O~%^;2Nq zfd2FPj|BcBf&WP0KN9$l1pY6OKm*?Y1rPC`NBEBf{v(0^PbH89DJW^g@{h2c zy+%K`yMzn#%$2#cofXysgSK#F!JQao7H0Bx=-i63t8TLEY-#pe2cWweHD z(?}$WQp2NC>#bR1@YC|Y*Vo5ZtEP|c^Ou%pxSEy6^6bB93Xp6}J)JJjrL_8}VBoz! zIbYB2%;IwoE~0pBZL0Baz8Tbv{803)K?#ITjEDQ|!irO&WikzxkY7kvra6Sr90oh< zLH5<_)Fg|ff3;awsQ$Vj)1LcLwTw2;`rwp9X>M<))%x`%@BEF}v>|*dfs6~>W!%|; zE^6$@o?}k!FWq330Vc*7T)lzPdm&d0XU!)Y_0Ia*4YXH~k5aFhOlijyQxIoJ>S6S2 zjyV&=JBgFzO-}HV{oMv_JByxU>gmxQS8?oSE6o${Bb#yE%B1+w44Y|m7D>l$%$)x8 z(3gb;Jnsf4MdH~OyYTSfOP<4qWljqZ%A&e3CQlEylGD6E);eu2FX}{3ubsOUSMW1J z^yNEfnk}zNb z>nImJyyL}6vX3c1tn*MT5P0`IK*<>K#H+~8-purQqM?%ok)>{9W#*Rnn0SOlqx-`Y zx~k2F4e#CFwMTaSu0yFJs;cfB87;Hm_~w-xH|!qq2<`&Ma>WoX`i6ZqwTS@Nj|L*E zK4{OIMy7+iO>&azLv-<;fpP{hFCqE8vM z?Sr>-!AawoNr60oLJJ8UHYUdfaWH49!GAVloVi7BL0?dt33=Z839#o+78a>Hx7!#H zFx(YtJT#CN#B(i~hzsvgF4g%42m8lh_Bc?r2K0*4&A-Us`$`l`9C@3$nas17rzOr6 zx`>U2x{GwV^2IC_K8NcFOrJ$9JWR+7+^K^oKH1U2`}nAmSH`MaLNfpU2Vk#iG8`rO(lljEgZTv`r!yJe#RpYON* zRR}F-ZHjI&$6lakI*OnOkU9mY8=rV$3U;;Fo=9u2U}tL|8FN@J$EUigZ=qJFz$VMw zvO$ihe<|$;1XkD;hf;96h7ih57q)(_=wJ`QYthed4$Q#E-ppx;aFB?im`>S&a$KFg z1a$F+hYf`It+n)*L>FwnPhXVkCMye$j0Ir6A@2Psckn60y1VIaC=5}F7;&Y@9yl`g( z1V*J$=&LWs+2ePk5_3>_tgZ_-ggBKP=rjjzmwvDLn)KJrk5t2!pYiVtW4a4GED|XR(l*fM;{_C&vz}t{ppmD`J(=c?s8fJ-dc}ho zX5|3jd(e=m%CuCKj|57BvN6{ykKQ%L=EkF>gc75TCOS28y!&xmIGg!Hn{OXifZ->1 zrX8V_)cD%&wc8fK#}V)dJJ;_wBnUO{oe_R^VyNN8ot;~R z=@zUraN;<6z8eGHC}V}UxM!(>Fmq8A20iM~;LU8+KH&pvSG~_w1FUV4{aU3hl*s%6BuV&`lL3| zIC+0o5^)L*Xp9Z-Gpb4nctV|X2Sb=AM}<gkww+;aFAZnvx?q~T z;sX;fLSu-yP=Y+JLo6)tK9NS)Hg#%3(;)jB2OriI{ zWSHXkrUt>`*l2*md&NUoa2TKbAE8i)FJd%XQsa)@m3zA>Mr;G(vZ4`gjoKo=)v-{v z#g`Ti=wb9memG0@I;F(|x5_7!iey#bgkrc=Q^;jo#hE9aL(&Ttq^Vs*o_g@4e6F5w ze1mr8ZI@JxKCWvF=Srs&#CdjFo@ryy8krnTaS%yn7I{aWNI2O+Mj;+7Aira80h6cx zSp_#q2W%fq2OM`1Aq6zXmtO89z{hEO(7n9b9-z(jDl9!Q^FBK9;r^~x8z_2;5AG`I zM=#8$_b{|M9A^M@c;Rz*3@u!-C0#&CX4rJdM*?Tk zmz622s2gbGhu>$qou3zX$R3-vux-CYQP7TMei_EuZFhlfCkrLJq+1ZVA^cFK1Z$xg zYxpJ1vm>mpC}JW{VcvGfC|Ko!h~F&1)FTCtQbme`kbgO9XlCV^rJzl-sWAqPK0rTo zk?m|c`@xz#x*dWdem(v9-U^7oy2yRlHUuzFv@AEbdeen2>e87`ii_v9@y>{-&2&Tl z1Q`rdgL1A#LqPi4)^OW_F_dgC&|m~Fd>Z4M>^lb`)7WU`Rw5bJI%#3M=}eZlY5DLw zYWL}va@Dnle};(~8cXD>Pqz^&)QinB8~V2cOs7wqfL(4`@c3HVGjjWAqA=dkMaFpT z@Y%`1Pp58BpXZSIPNHYEt%iGm?RhtgDv=k#LcKNw3$+kuLMXHoa)AeSw3HP-)*F>A zkNyW(%f|43dZPi(XeDPG78ldqtP8=P3bU@}eORE+uZ zzlkw=v=J$;jYUS*F_0EBB?IebghIuV$3_22pc;eTk>8fxlGYY`(jN}$>>u(#9u@K? z2+6+x-t=WSP!_DVhhnJMJ}ut+83uxCSUaqFIkmc=A_B{b<7{o^hL!p>K`kQr zKBO>FA*r4)4}O3ZcE#KTOe_WVCnO?*Ld@SM@{i$Y_dPLUG}5dria zc4mUf@Kv5tTc4Fsh!g@;U1CG9n=yRa$Q6dWMjbRV2(4DD2_#Fs8=8SmS)(Ri1uN2k zq?~DMavUbd2*tW4XN@(%e*%_tnKYW?r@`JfoN|-CnEy>gje;q?^A5EHQcsr$lk9?j zGl~Hy=|)l}DpHW(P3hP;HM*LL4WFfDy}(??C!z1X%i0(Y_O z<@oRuD8dk*)dM>gkgXDk$#@E+-3YZQEau`{RrV;zL&Czm0a}I8qQ}=2>ksVFRdF)7 z?Ch>YKS%rUe9>OUH|Iw)XBOIuj`V$1(LeZ?5jtV+K@P}@2vD(+48tWKIFFr^FtGh3 zkP|&Y*HHRC=o$9-NkD(pStJdSVdX)^@q;^j5gv9lg?U`7dE6>eq?ptb@3(Jsr_m)h zmKF6bO=_1u0ts&oLc{pg@{V|DE5s|H!#cs?rYoL&(&0(D@fe6RL_wBPrE+HG%T@bW zK3kg?;e-uFU=gmzly>BaR88w_^-)80HP%EN<+fQD82irz`NN+RWsS4TKD=MY#s^Pc zPs&=F3U3H+;A&8n#jvS_9Oe+P#x!RJB&PF}FeEn6>NiSG9A6B|^y8~LK25lE^lLP= zJ~ZcQZE04?+A2|>3xvCF3Vgz=U0Qc-65N)8^~@3%VrE8Hbyp=3XIg*JwmS`yjG(iW zDYj*S(I#P9O-ZV19V2SbX_U!va7ZQZYrLYl8d`CHRM4GX_v$+`rhOMr%n;?x(B@zN zPQIyWw8pg|iyGrSg}Yb~C1I9S^9z(#P4&K+7151( zfoC0P>9IS%Q*)G%6L+B&EN_2jvG*N!BmqIJo62QM)ycahlBW!0Kz*{Rauks)^Tl=j&p6GW4uxopyyS~k@( z5FIXCOlJYPA+bY!y}5Ar8&&Bmoe{N3Jfj}2ZKh=MV${7eMw+urTu(a;p|yw9tysh_ zM9x#LQBVQ%44(e>X;Zlk1f4@W(? z)SwL`So!e%YT(I+p-Y8B(dYOpoW*tgJ*u?fZg=r~OyX+_d1AglCA3~RibT!_OFhJU zM;_drncDp)dvD` z`ZI7_A&a2_5-Ez2+X@4?hNZCkxJzb;avjuHnM6FFw@1Ua59A|7Q6XRk%|HO?*aX7p%wwqoIT`NNrG06II}uLp_? zc%fMQL~TClqY=|1pzSiE-(Is*Y5+YW$IT)^=;ExNZ(iNLsPgLp^D{$@^3&i8Nz4-64D8p;lf{sctFZljo>k0VKkT5H= zR3FzGg*#|Nmek1LdD&zNkGta!4ik1WOK&SrC9ybo-J??s&Uq%~9##tEw==S+gs z)VYPEqwQPorTBW6?&J;PKIU^d((7&k!@=KWp ziK;lfTV~~SOUqW)kUq9^f&|y6MmDnDjvcH)Cj()==4Q~vc41lizX??ogeXWVMjZSa z7jF}P!4SU&CZZ8%gv7k?7HS;278z=}Ed_qK_R&3!)x%_zmRFXx8u6y*ZpfMHws37X z8({TOVVamP^H<~rdk7^&*J;cY_9o0ac_lBkR#bcg7Uous3q)^nt}$ziuL@EfSCjcv zK)iH4Trn*jpJZRgtIC)#OM|BP2uB^I^3|i(qYtm`I{B;stsw7TP+nBKDaUI#4?a&_ z>Z)`;m2CQk9@I}t|F*&p_6pG}=CVK*g?XhYoGwJy=25regbLl3LFgv+K_EgX{mb4d zyT$cUIj1*w&Y)%EDTeRJLAiIo6T*PMOSWyS5n*TqWP-;Wm-B8t@xpQ)E7JiJW56%a zek=Ug0pNIjQ|37J@i&sQESc|^<^U%=9{WoC8_0QYKalFOn@G0|s(_=kOeIt?eF}^L zBitThqwx6wPf`-2NBzKYYSa{3hf_m&nG*dbWgyTvXUhb8JKBR-9%acXK*mWCFZ2g2 z%vhI^_XYQrg=(@zwj)GYmKRGc#|>rse&C*Gv-+s-VgLy$)L!^lfYy8W#~vNiL&nDz zCtG=0r;9V}zOUve5}C_<747){eHLnz4V3c`!lMjCt-+(@Z35 z*8&}puG96ys0K3d>Wy&(0Y!-t=_wZN#i8`m9O-L{@zuAU=uOD@l*l-BTez`(VXyn1 zHFCCupZU5yk?L(vAUSOK4S1JGk;hH8;T%^-S6|w|Tp4l2*7P;V_LTxt=gIxc3x=1i z-6|*IJ4pc%^)E6Demi?0Yp;sdK@Ey0zvq?HM9;F<0Gc_>=M7GfJA*KiN`3AQ$5HK zxH97?7~&JvC#3(FgrecH0|s|G60jw}VdAifP9iht4{VY;%kl`uh?hf&q-4>3PA;v}m5p<|*hbzsvJ?4rx^w7St zC}TrM$@25P3}34;+a`8!Wlm0a-Wq?41=pD^YMEVoxADv5iU$0Q(WYf}y{(J0@EaLl z=G}Hst8}JTR5G+@L@HI=lE$?V2aK-okuhw|LH+_&L6DkieaB#)C5H;MvH=wTa7V4W z<41~+mMEcfgVT*5 z3;RJmHYHajlm>ke=`X9vtK%v*|DDhEDob)5^Yu~?3Ljqq3VHfD9Hrjw+^2y!#$~N* z*bQH0wM<9r)38V|e=27(2w$)Uma`x?jx4i+FVlXwgw81P=&e5lETH#wPm#|A-=&x+ z#QAQP6b>2wEZd2->U9TF9by`Wfo-b|>Fw*l!s(qhEE22>4`e@h(*1IMLpbG@<28+d zOM1>ZwKsg_pwv}EB}I8!BlEMT+RR=nIAur``qJmt_AT2pxtrgNq1m{*p;Vgzi^A_~ z$*SuCZP?ySLb>6bykSuOVq(~~&W{QyG1acbqJ+hO{o^hS@XyRHU%Sb87-}>Q8mw8j z<1`E_XjkgSJ{v{4%MDYz^y|s#naDo1yFOsbawz7c5ox7MQZEeDUyi>0Y9&>0#Yfq z#Rm)v*@6P1L*Co(S7#2PW|w-~w(kbdC->alX4q7DOV-Z}MvmkqLctl!j=Zn5b^R~4 zf`t?5-@m@en#5MwC)?cYTwgry%T;dNcg+>M{l8|ahOcU ziioVuc`{tZNW;yc8EhH)Ou__4FtMRKPfKI+dh>wFvmP7F2*cz^SQAA1ThZd^hM8!1 zHHEbrC1dH}Xe@L49gKj`$<1|IDD{UUY$R>sKq_c1LlNjO*h13wyDx||vB9{<`FAYc z2|<;2){GqyhS%iC2>NmXB^W;qxKH*6*tXz`y0A9BYP;f_aIG$%FwzIgZNIXpzT?5?G^%M2LS z-$RsXbrr4q#uz-bHxr$|M^bcRo6Gq0%A*S4-ruUu5$6@n87%1;IjlJXo*F`amV0!0R zyo$Sqf>*WD>@8q;@n-0q@s@%dWS(_;m)Oe-SjL<-4oihq8g(GF%ysPX(Y3LTidm`T z-PqDJg{jUCWiZZ@PIO2ka;;cNgxaYzzQA*_5SB9`m3!901_qDdDy6GN`86ZaC(Rr~?!$Gzu$CZXc}q3^_OpyGP{=tx561QBiibD` zFl2x0#C#51Mf7m8uW6iWORH5uE0l~ z!=w`mO`)a?IjPV11Fn;Fk2E(2uf`mSzRRX_S#7^XhxM8$qB2=5Sesr{5nhHeChG49Qcf$lKKvIdZ3ksqV%cy8%RZJFYBx3w zaxq(e;F_;=fq6-Ny0Zqrj8$^^x6RLRFvuw#oexVVJ>Ft=>64)u9i)Rq6JbZo>ikS! zXWa{&@$w6=>^!Iwe!w#}7f*u<-= z>Iyxi~`4PCOKR@QrW-~_j?cZy%O>GaLpK4x6ZpT-z?TvdS_ zAKtAg?Ia-Z;87ZFO5@bSe76w8QajD*7_Q_@o$T^0bw+B3G?87 z%AFIiORr<4x4TChkVX z#&gd;JJH#N4^p8@fQdcZ(=LH56d5K_7P1@e%AF=R_NRltON@#14UT&YdJW`R&)BxD zCvT{gc>(j!a5Pmbx8`t-tEU(0**0HDuxAf`4U9euTTx6GF&JX{W#%esYnB3;z_&S? zTOs=mvs?ACVK$@Na(3pVy#ZZ8eEw(niiFgT>WQcF0UbnyZ#O6M0S)KiKGh`*W4|gs z!q0e>}BEa!SxxZh|e zHMH^5gcUABunud4?%&=Ex zLDMGUSu;zyx=_!tjE#W?Fk`z@agU^1aM*pnORs@Jk>gkXwnW zNp1K86@x6Ab*$ZPGr!c0CIW?~4B1dzMkL%3)!)L=!h0g8YSu59sd)ZS0UDAQ8&(&) z6vC(9!{3tQ3V;nruM_Z4&*gS0db*sLoAP|2kRk@HnA|0Gd6&6L+i%MOBQOhck}kFS z*f&)9#UU$*R55XLN|c9n!8S7DWYwPFdEBzyxa~%|aq2^oy&<^m{krOv;Hx;nem?Kn z&F1Hn{hI)tpOMi$%yuGWLOg6xl?NNo5JONZ`#VClrPdFF*wi7;WbHnp(yx@wI6_1c zR;{^J5!gyddl&aZ6{M;VHwZu3+!cmg#zEY1Ks{=M&%veog3mYl!B^c{Gsv1oR}DU5VM>ysD23CS9f$>ZAtfJYPe@`cxQhE_*xm8-R&r|SHn>X(Jp=E;Uk7>#f6i;}X^ncf~;%@WtU ztVji}dKJ48z)aIiQwUO`e%_A$;{LwDC7#hOL?Z88BK|WZf6MX4yya*XRU8mi3|+}C zT&=}#i1huo*#e7jtL2IQLhH@rpR7XKYO*I3dk$mR5L~ zR89D0KRPojLqRMN_l6BW6sH-FiYs{6EC05QStPbe8bx1c7IjocR@XWGL%zr@5tsIX zq3ziT6ZzE;d!C?}%eA;0Gqh(WMun@Ls01diCAIjOg>_h-SWa^)haS5IEJ-%)eGu5n z0I4Nt`Bo26*k8;h7Ao2!F#RJIoZi%y-xJ4_hPF$uYXQwN;KTk~?{XG_ZT358&A0o( ze=>qB|2>HMuiQXDwfw(p1e39bQ+AuqH}tmixv1*;RTRlnvnmpY_u{Iwxa_hf$YXH{k?W(dLkmw*RbZ|OGP_jS$|FE2NJp6X;>p{0`9T3=`BB7V#{ z7K`>YjkrDzu6O1k5^P+`(B$QL(!j31$N2It@fELsT9jrqjEqj!#FTHF@wA^tIwiN# z3Ov91ZGOU+TyUE4NI>65?>%~HzBk_OHvS%S$3>unAC(44OJmC#+-ypWrZRDbW$?Xq z%Ha1qjCs_yN;$C}7oNwpkqG{1>~id<*lE7rdWzYF?S$oxXAISkt6M3g*^Ut5yexDK z+<@)oFz?cNSMO}w{F)^eYcu^D?;`QYoPV&U+t*c8QJR|^Q!M33R>lY-8GvL9cYh#m)$$I@GY`J)s^n@PZy3xvv;-Z%j45W~@ zS4IjaQ-TF&RBSi=q4=Rbd(D4tv~iGpZlmQr4oEaZnE^ULt&(u2vd(A>lX3u}zUU)5 zGuLx=F1PgrNfK4L8>0I-!s#S#b%uA5?J}Cax4C9GYj>daxUC>zceB^JrlfzBV$P($ zlA?~4AHgC55)b}>2Xa{JruEYaAadnBN62a0NqfXcTmdJthZ%U%N-8iog`a*F5kz775OLyma4ua`OmhyXG1NVE(*mIhmLK_kU^Se$A%=X z?NR3ibYP0^nQgQ$3x@vsWTe^I_A-nHKbi#Ntb3Xx(HLjFZTwInbCfDY?qUaiG>F}f z2%n6T_Br0a+D#QN5_lo6c+kbkyM#vTGFwy3{$y_mD)ptJ35z z!gK{`DTz>*SJ z_|=qr-5Vyp%{oVWcTzW*LQDPjRBASisaA7-VXNjI`kCx>L}u{2!adWn-rf0R=^ND2flm*+JWESw!OvZdW=LpLHjaO%}Lb2Y()ST zUHwF;{#yMYC|18j;KLgcj-#2Kk$d-B(+d}YQje%j5a`OBz{cnIeRr`}7B=}^QCV2b z&hiRQ4MjvhPKtrL;T<2yuivpCN9?lG?)5QAyj-Rbw8(>xr5Jzux19{Z*#x<`(y)ePRz zVqc*3fYmnd_d*jz^@!A!}9Ck+tlyybk6b5bGsf1@8aAV@@d(S-7lWRx(FP% zPD387*n6#(R1*`MVy$paG-4jsG{fj_pNMXN_Lh`wcYvY?_AuRdsLYfmLtf!cnmP;M z1oK_rt)^e?B8=S<$$M`|qxf8NA&OdACQJC>wRu_O(yj`Tx8D-`qG}IK-K7s>dI|-* zc-q6urc~~WjXvGwmdS$U=RsK)SGQ?0tTrX#(m|+owMa=xs;_2>ivD(#^TZ|Vc$V5xpPaqJ zv%kO9U=`K_A|)sx22L+`Sc4coUlaH`-WBk=6+U!>;xxg-kuJPAP*)X{b0f&Wz;Pq@ z0yXrLVCWa5Us<>OL%eFGSnZkMv;Y zp=CFTRJ;>)KquiX>0^cA{-45LsRc^ZpNwnf6E+G8vHRke5@R=EdVKiPv!pp22j`gYZf_SOI3?T`+aFOewn$-9t?c(m=;zW<*FNcTO?m(^SSet{z6w z>ICf}yn#=~b{s$oayW`sMd0b}Wa>_(3qMCPvre+~c+OmtG93w&<gaRoDIK<8@Up+Mb(6 zP1*Wa2V#1iZiiOWy&r$9)5H5b`TZlh`zIF%6WhP-;uu$xa{AkCenr_x9*rqjE8}Ed zeEfS_8gZU>!d)M^fni%%SWz)k_I0(@J&xF9DUyQoj<~9;zvIf_ktF7V1o!;`hX4A_ zAUWb%n!~vU(MKt(ux-5Ky9%gwoN?pI@>2;^~B$iS{ZndoAq<%F&U1UB>2n` z7s~3ZmPV;={rZn5xt$i3ci7BlCKZ|75oX_LgW{V@`GDF*c9&Vz+O`4cD%VstmAGLi zOXcT&Uq8bH6!<*<4(&^0&& zdHJPJtGc;-yMz+-sbqUR$V>9keEv(!2aVVIoNaqEtTK`=Vb1`Q)^9LsC^r^@(=*^< zC^1qgZ^t!~E^g%6bD&YPX_)yAF*1&mU?9va71@(HtrE2uuC!| zIdRcfu$6hzN|noUpydVmf*WXk=@MED0$+ady9j(`=Z57l)F*!xz(?aDOX9CeMVhrn z#xx>dM60_}AgBY+jLi8dvEGdUuY$4f96WXtF(Nd_f+e@C&7073uUHAAZVboB<{Gf? z2q#S#*qvGf$uQ~OhgA4c)d3xxEi?%{C-*z1{@d_ueHU?@5QtM;rZEsyg>V?De9AO) z8U(3B@U6#S&3Kv#MVvut2DsO<!-X{A_PW$Fkvy zLahu2ZyBh2O%FR)q%atOmw!o$I+D&X%QTALYTpY3^;=wGdHn{<$_s|E1EzFL(Dd{r zQ(Brn36f27cgiU#2)*wzOW_G0pF8GE%G8Lk+K)nsE9(m0#6!~Y;NqxxQ!_|;E@#H8 zEzUq_;SDygPA)hWB)j(+1~xM1=$L2GSDIwbxPaFo7_ZRKq$fw zh6y-vS^J*PpXsOfl@;7T(k9e~W8T0vc({59RjGoFQja$-XIWN=IT=Eg8J4TgBMgnG zD;O}>**~t|PC3eG8Z+$V3+-g%W6|77Fp(r*-!>MPE+lILh^$2;u9BZ@cRXu(Bv>XK zlWOmp%S`nI28u(?tlx%uugN?T0`+t_ZFFp;Dq9F*z&XXwDW2FCIukalX{rySAtZ`4 z+%9ES8Knm+fRw59tn}$GI*)&;9wCnFOSyI(=0p@u6>gj~oD$j6JqbNdXqHE=YkDlE zaP%9ICvrlf4c|KuDyb-Ka!)t*VCAC9O&Ne}!f^7%Pxi3{)O@RSfWjaV-z7(+*cbDWpMr zwp6Ov0MBUm?TD#mdGgRpZF#>7`Ea#dork}diL${csjajqu)D9KFZEkFjr5F6w|UoK z6;shFe#&VXSd&#j_tYYYaVdvo*LAti+3P)6oaaKrIN^#`PlF9?smu^dEn{ZIPI}g0 zzH4ni$w_sr4XE>3{$XTM0spkgdLQ7)?$TJSYXx)OXV)?1DB2mKKyWIV>_$7!-PoX{ zlAGQGa-dWa@?lLg^|15Ig&=&V2>KE3fp0$BjfmhRa1J4E;`-E*9L_s;<$2LX}zLEtwW4u79DmWFl0lWe9BMEoAU zETD#$SbRM5#reAX!6LdB8+J=Qd*V!yO!5thzEa%tEx5p*1t265Cq-lNRM z2)|x71=lH#$d^nl|8M49-;tEMGdj8xdFQ?lD5aJvC5GSHUJqgis4DE9BYq6LdjxKL z$Zu>Cl$AybZuThnE!esdiH4dG{){5i=QT>9yBAbjAO3B-1&7yX>+Cl3AO0N39i^E=x@>O#iIb#%c0P6vw#Uu|?*4 z14PbU1D<`%kPA55FHFer9RAEv`rXXLxWUmf>Oc@X#f2Anrtv`s4pC)17nm+)G^00y zmRgS{f?Rei^$;GxJd3tMocXOSG^ePfV)9%Y1;SP}1vID;B41BwjEKSA_UwO}(p_sA ze!~a%(<}zoCK4nyHb{rpI@b+=Uw=btC!ZcoHBxtX?8|pcCHQtUMK4M8S{-qnPl@EE zkisZN(d=Jlr93ZGfHy@_vX}dF&-cO0&4ckvhbD`cXkzukoUP77JARb^BhR)!R{GU` zJJ6@5q7V5kiEK9KEXpBpbt~vj^&mRi!AGka0c0jU$N-_{?~k1j?%Q?;Y8zKO$Qk+9 zpWI4Kmbe;Ihpuu*F6A6!V8JdBCmO_fk#@Z98&~sS_xU?njf=>nv7}ke!$slH5~f{L zyUTQ(+?Zz;4G!60n35w%V%d?4Mn+$xQbzBfy?N$B=m>K28dE!UL`r;HKLfu#i#j%N z&&mu>=&1qMC`+97w4UBj2{RmGt^4|s&x!n?O|71!Mttx0@rEU#!{0`kOpCtx43jz* zdCTzgNPFDI<#X#xs3VQSB=K@>t}yD}0TUr6( z=RUkosMs9dXE7hdsehSXcbdIc)?Ws*VK`)JL*RHO8q9LCr_asck;!6^@hhu_dvf&0 z{j{QSx?dn~6)5H=Faw92ob6U=wYg(hA((@3P@WVc_a)s>#2pnaq#z{>t1au$3~7x# zsAfY*DBZxvzua(O;^tJ+8@hyorA&+BC#;t}FNBNrY==&mR_oMX>B|Q+wPus0@sZ*c zLOseIVeEzECME4{h}07YANl!LAxS4fnR3Iw8ac8!{b z-4Ppt?@Qf$(ULHX#DjFJKvUFhp-Vk~0>H;UNQmK7gEqc~hD9dI?`pMtvGGD_oXpDr z0xRCk+l&AXk1)sk^1$uecd65RLX$Y5gfY@ibfK_twxn=+tZk@5ANRB^W9eh}bnGEW z)2(B??2bcfs>t`+!p=-x8NP^CsG|4*2#PXNEp1qt2;uzEx7?W!wOwWkpaG;nW_{)x zni6I*IcJT>ZH~{$I&SEOP=blnMU)V1 z3aw}iQZ*Jbr7TX|Uk?t(T?kqlVm9r26=@8jbdAH0%<*`%ckZQSteB!;j!ikhHVA=4 zQ5pdprKu=U!I`hz)hXem40M|;j z`@v%hGC?+S1G%h4{29aqm}_MKV)TKvd~QjFIb2D>i}`R1tbiV^Bmu^d za4~7}aK|@4M+GUxdFbTtRONYoA4Lih3WAXG-)%iqumS0c!gL~?EA@qzk}9?wOOgzQ zx|nTL-1=+)`aQ8IR)OfuWPK78pC|}P#Gqm<tX{fV(!Nzr5Mg z!Dho%t7(mgptZnOOT4hC#3YxzO-W>i`jtnIaT}%3ZDks=Eh|-VkaW|)%(2)+&}*gM zD&rgi+ftRolxxlA%)}?B%NgqOc#uw5@QlEg!g&}PHB@{cp|h@qWvm+3dOD#faQ}?- zYsa;yS>PUu(rlI5F__Wl$3u^7R8uYe%B+$g2Y$9O@e42(ufxmbGr*_(r0{3?$u!kF z2E9REmmg(QQ+&flZj7^szgJ3{>VcQMXC~uJKvt0wucML228dWf&~>nx9D;C0_>`Osh<$A&WI;@%PBQB`%BUN8UN+>Uk!UHX>E}FY`IEhw;J2(qggaN{6q%AzmMJJ3Mw-P<)zgumthA3K+uuCm zXQ_a;a%|A*gOL>4XqU>fcx4+jSzCCZZRHJS9xX|AZDDn8(zs`zl*1Me>vuW-ZfUkwI(%|-H_yTz3^Qqe+#BqQoaO1Dyx1z( z<-%;8vwMkGT!R-tTK3V?&?pSjAo?bVGBHocVSF|;!kqZwW74s??sF@3Cb5Y z;uKn_20{=oDkl-^%zof$MQ9!8mip4Z(44lLLWiFP{Dre^>Q-CT4YtbRU?*Yjxp&au zdq5%6w(?I7o82?h1X3^Yr~cKt5{+|I78rNut{d^X>1C@Fgj2uF*vWD6Xmrq5A^B-b za9-gOTs7w9N#AwctYxrKRd6XAL>LY$oC$xmGW9TzoggiL1l3`68y?i8Ig7MlEP zrGV81_BD~icnpwWPb|~UF?=9|#D0D@TkNNUHu`qw3d_n=0NM(i`f;&g*szNjtR|PC zlNU|o-I%zFhx&a=ZIBSC0hne%yB$pw=&{#ta>aKPceeANLh&CI4n}q+&i}QM7*XG` z`<=!7#!U{|xU{DK3ZYb#Qpdwy)sxym#)maSpk&FeZzvK>NF*72Y`KXkHXbuX92uM= zQ~q`S+#!z>6H_DRdcT2%J(?@C+x1DbEDo17=HkkULm?H6OgN6LC&A8{6+Jt0yL%?1 zJTdC()=*dKd(j*7(v$tcD4{gSjw6d6XNmvWXJbkvxhQY*Uf0?U{jAY4gEXjb9)TaT z5ASEyiCO?C`1QDlIi5SsGHfo+m zMP0abFg)eGKQ5n^s>ZMTnp{4H}<O0K?z@B8}a}g1ACL&_1d8j(~^Q3rT7z6Gj&xJ!8|WeiD-rkkO)iE}f!; z4oW>o48#DH>YtKEBF-)+Saax(>D*i?uqRs*=qOl%Rrzn0Z4H3<=x7_B4k{-TyIGxV zl$Yr1c6v4c?-VK*4;U$qyf+mAt;YTSL;Ll={viG;jbT9`{^{PognUk{_*2rjPlnudQ5ts?3 zK}xUH`2EYsm*7|sGUC9A)M9#xV7*C+Qm#)D^*jYZRD8{!m-H(W;i`Wc-8j+7FgWna z^BrKL>~z^77!LTmbM~rok0B3A_53Fe2}rmU`pcB1^MVx?7X7hFwojUf2JMOVFXtuUS8$Rc1|q9D9$zW7KLhRQwuUI5 zoFkvk{d2CpgG3fgAVFN>kTr$tVWai~r;6C=!LD5ETAO5 zSB}yoP~^>g%{N^=Wve!a^CYzpo zKpHJ6ct_?zKO(UAC1*y-(dZY)cOWn5k+C5Gt~td440Fc$oTv&LKtc7~2JpnzDGD2N zbBnYIraj!U@I=#%gD;%f$*kt2B0>vG&(!dX?3ZBgwocoR%>R&J#^JEvGeC09f{l$p z;X>4ixy;Ubm@>bz4W|)dM*eUO_0jMl7#zTso&z}Smk{@_IR}zdY=i8M5%=5Pn+6IM zyzh;Gev?aEQcGXNx()BQgGj~~T-lnW>OB5CI%1%`wDtxsK{llUJvlWzAb)gJdCQ>f zG={a4rV7KHHsMa&KcIY^=@d)cH-zD&C29y%BQUFT99#nx-CKw95p1!Wbid8VvaCzy zA9ZJQXCgXrgUyN2qB{^`AAx2^`iq5U^7BmSoR?;jTj^_<*K@Hb zsJ08Sg!?@Ke9{oL=%35w+rsxk+B^%_z0p?aM~Tl{N1X?+jl5;H(MGsYxu=d?WtAuU z9Ar+>0tu0d(uoM{q_&|zn04-w@H2?5lO0?u@;#8`0L4Xj3QU)|o)CKDJ+YVHai`PV zmRbM6?I7SVN85)U@G3kq-=NmNeTkr9=~QMfE3;EWgVPyM ziWi_iuqQmbcQgxE#J14w)H_$`EY81fSCH3I+*yrInL?K5?*yQDYa|rcl}hh61h1zy zAR3C}FTbWv5fV^qSUwDFi|%M^9E`Y%=|dnd9_Q;F7kD^c5XI$}ZaozpvDcbqSOx6ry7kjC6U zrGW2$ifB%H7=cr`TCcfj*2cWGGb>Rspzc=F#awERnx~mf{ zp=U#%CA$2#RVP3|UiF2+AwH@0`8fr*-WX0Ta5#@ABi$0Uo6*Jw1Ldy`v@l z2i?<^zI$s?fnPcL&YHKot1i~7d@_v^*Q9rCr*}ui8b>x`>d|U$Dq~{m@n(FZoxR_! zwTQJ{zB0D&?g3)>Sn zo|iW@w@yhbX1gtw)mI;t(zyJzg*R+`@EO}wz;EPA^vKc14Yz`yDOwX8jlbO{_a}q|AK%mkwkNJS$z6>cD^pDj8zkvRDP5iZ+Nb)5b z2f7KTe~j1f6e#3eXaFUTw~qGMx~7Br_?iVI{a*00_Z)b3J~a(_0;<1jw)q6F#F3jO zDJDg&A0J%`3_0Q9aX+ste!bLrm)t>DfGD4@^0lg})RuxwL9DKmV9ylLMzWM!3k;*e zjh>gJ7^8Eh87!|RXhPx&BCQ-cO0#WDga*mX)J5VLn}-B}@Ag@M{HO=rBhQ0Zm5^$AMDKusEcdA-GLN_;sT2#HWpspn{4>mbegz$diToy;w4K=JA6h_K1k~ ziM*T(sQ1u-BP`=V@I`y~0B}dKMm3e=0f*AxT=hZm!idmhiRN^1I{{qTo`Ddy5BUI% z$Uv4T2FA>l{rel+oA7wYgwBGX2?@fCKIybX;4$!jj~TPr`7ME0hQ-_Spm<~$6%bfA zX%TmS*)NCuVSqO1Z?nD{y+QD+OsIPXRJ&+6FQ9EfylDyG(vCayMLEj|sm{s-1QR8` zjI1OEhUBaSgE`9pDu_{l1>wPg1uDGa#4tdF{5z*8fe@n3pS|n0t&EQ@xyt0@q}oyB|V!UBxQ;OoGDsbY0!Flg1; zjX>1Cq7k)Y*FrQnZYTK)f_bQKKo+TB{Dp&rT6)rr{Qw&k&mUGCb-dW~m{9zYan`C6 zy9x#m7_Ac?)o{Wlkx5)%65wY1n%T;6$k$m^6qi?>+7L0;O`G!Q8$f$?=e`zUbLN_m z>#9aqQOtUT9F}hXpl~3-w_p|>6zng-+)__ar^zU>*d6$0sq8i0$^SE2B{>sHWAk&l z)T8mKahZA&@e*fNvKrQN%qvS{AKQ9#;t8%vEyBI`01{QG*GxUD>kYdNy?X$c_Mg1i znKdG%&CdgKh(LhEHw*PtOs^tG{FwfP^ z(`p)LBI0|FbQl9}@xw)taNnD_!dpk|)I@7qUM<`>?EmCasY(#Hv|ND(4)_~4s8g*T zRT+x?Qal3j@e8{izLtjce8W`;hz$}cpmX5@WCPVp1T+7*Qw5#Lp9)5}<>h@d;zQ-S zF+~>MldHklsC`+6RobZH{L&H3h*By<7ZmE1L@`q0kMX&+RBJJJZ<>`4K3p*@*V+$3 zMFu3Acp*K-QI{s-f^2qgq>Bf?4>KFbI$*+*h!0nufoEo)`SK6$C99tKqgUpU4a#S| zi_PcK9Lh6^?cymg@yu}dKxkU8QsK2bUG3b;JJwVnGq4w3^j35MaY+vhtf5#|iD~Da zNBj`amcl%>NB@Bqw|!Wx#PZOBZQ<_pH*UtNZ$WDZ^$_?cQ`+V6Jy{KCb)vS?jc(@s z+g5O|3Pql=_7PsnnN<-8ZhS|fyy1#hNtoj4aN>(oIeSHb4dT}0r$JE34ZBT~I(zr! zWo%}-EfaFtsg*&OyM(Ph?hoWc6l-5Gu#r=#&#&Q&zVJ}ptFB0~_e*Sp1_#~osvryw+X&L?}56p;(Vn0#`I^9qiY<)D$ z{bk$Ld(s9QQm8;5Lzct?Y_zb(3PBoLN(jE<7VC~){f$D5N^>NLp|;XAu|JH0dT|H!N;C{nA0LMa&n`W;qkMB^H zo!lV5QLWunfW(llQAA(r38kKw!7+f`^#?6NlG5UUX0JXx4>eg=<_OU0#AT0 zIv|m-B%Trk|XazDp>i-Gph_9}x7|56n(kS@MhH+8Itmxsw@ghp*E9&QsN zl!rw3g~B-^I-^j`9%*^TvGvXxL`B-#o1`H{x+!(}fnzNz2C2jvrhx=u^V9J}rAHIb zhncL^--Cho%w?QD%JG7&*`h9tpSv`obm@Pe2h1av#~pX4g$?^(d`KpVAKTu#WmBe( z{JFkLwGBpO2YP%zTdJEft(v7fV`}2)<+Y%Ld|+~;y$Y1ibn{1O+EDTPMl4UHfMIw{ zHVs{MTGe+Pv^qMhv+Qm4v)o{X-naxXcwy4(Fo50=;i6)tp0?IO+h*K7U{4nm#(+6BUWN3ghHD*t$kg4uRO>5-Z7<;>M9@lP_Ze#Jsx*V`z8i<%^MlU8;RG zq>6ekpx}8p{6LQvB1jzBbpR++aWcz(CI7&&$-P3thxPr4R;KMg88mJBV=ukl)-VcG z$dXg6Q2tS`kDA|Dt^h7+d-cu0jA(z74YsiqP6)`PlWU@v#-^yB#-)R$m)Zy&gCeT%o+S@+Rg{?!$%)zDj zl#ISX^+ZQvv8tQVA`b`bOUcnJj>xW-%WpXWJk|05P&#v4$+z8_!g}fR^L%|1cz>xM z*0WV4b*2kC{Jj64}9`DHM0DdmH10wJ^PVC-;+4yZ@V1e2*mN*+U#z5PP9{M5C(-zxegV5yW%CJyN)CX4$~`8g%fWE!)-Mps2G zzR6j&C#G10+)Z0GpR#Nad<#S$%j$nxOg2AU(yB(lp|j)s4HAif5N3gI4X5aow2hm% zNrOF)9gl{+S1nr>oYAde*Vww(!I6`!R_f`}&F3NMFjoXhHbk3hAOGZhj?b{U@9>A` zsUt7<9Fvuo9O@V^xWxvT+;|xJiyvDY8Ixvah^4T3j}-@%5m8jEI^)-A#?(gYLpmmE zP{2R1Jg{2E^Kh4U`L9{7+P`#kb*LzhL{B~jKmeMAf~S939hL7^|4Ox(g&_t$Ty8Hq z6(GqIfZG&I4n&42CLluMD{hp6bvi!D#Dvv|Ey3(sw!{)3_=`k>CmL$`W1;ga2RMi- zT92owU3p1jD#G0NUkMU|IjO5afXd7L!4eNM=$MO_^R9i*r<<|hyr-_*e@oLT0Zn|g zb*F1p=-JOx1Ejb~Q992r%Ll2OqWYm1w;@$LVh)rVx-y`Zb0C`=tw{94?Mhtk+x`ITso?Tz_Y+46gcpjC}GGiDDm{m1iheU)1EN7x3zU zs|!gwXAI79gx7xB8EB>zP2qq~3gD^dAnxq7Nny(^P2x#rcW1L5D>1=twOxl6+lK6w z+$NKTXoEhQ%{vHHLfmWpS-SSPk88B~SD?)2_9-n3`WJs}4iS3|NY5M~hr_e<2+PE` z4RrgT)sgVlzp9Qd|DY_fdj;-7tYr{C(={LZX|~VbM-8jyf?0)M`dC#B{r-IhKz(3< zZSA@Y>5iM`grLhXj1L^8!iv}ATcOQ-@0k|@8pUDAn5>BSU9pADNZme_q6CQTxBQQTzG^?H+5)WD@)8yf#|W#n%6^`-=9XlKXi3f+3A)^$j4`& zIM}zr9ny$<$f_%Xxw+Wm@A6DuQOGXJPl;kY9h+4q-BHR>k#=4BSNp~kWvF7%b{cHK z+h&FoRweAk#wcu!(j#xx+=@J%Kfxs-8Kka=tiikS1wJ4i1*br2a#9q%-*QR1qdjX? zgj}@boD`U6_9BVGy(;a`PvCz0CZ?dz>`Rx5S-zB43#j(n*m-Ee>9_3}`aC#sT~5Pr zO#C*NeJYJ)YYMq0`&wSxB(nZHutwBh)+^XuUN~W*El3`-Ua96LTUS9VunNI(#mOla z`8ND=OL}|y`pknAW^DD@Kr>SWWZ7lr(uXbjblN0>f*iDg=48Ijn_12Yz^NxVz(*Z? z)%ZlS6cI<;UBo%tjBIq&?&Z@2*lB_^+7ibt^}fIZRS7)*YPR2o_YW@pwQ0R{esglL ze|-k)5&l-SHStnrZS*%Fx9 z=5}zyJ1UY`oDL?%Cu-gq2Y=*15{d<37?yRsOy$ zl~cF;bqh@P`6UNW(UmCb%|M^_JfKJMY~zgd165M=2G*0}W3}Nu+SoFZpW-g3 zv`JX;Ic~cLl*ZHc&wlT%=`%zKycRJ=@uNh2rC8tVJ}KI+4RB}AI@eHl;s zFcP56z2ELy-^H9$e#kp%KXGc`S)+v zCrgbE>U_JJhb&m$Y20e|o8T&?Q|wx5P-C}A)C@G-QPDHPxxNjWIBsUj z*u)3kf(XF>S^Hl1>v63#ckecY{l<*8#JV>Stl&cziXS+qHAb$qSF9?)3L8L;EMnk+ zbaS*r^P(D;VYt>X|NDqF$ecLJOVZcTtlHPbg9+~!T1l>2sc`Bay=HWl3=b_(O4n^2 z$dNi5E$~-y7ZN+#x^tHKs$zh^<&-j=5AbuofuQcB6*0x8{+gcoqB-r^zTn~7wcKdMQDNaQc|Ll zgHHIFVTF&2+tWj2$7;gHZeKnLWn{i(-7UVkJTUgZc#O)QS;!VZDMQ81t$fH`oi9gk z!Qx;c0k<3@K`4GFyd)YK)0|Q}@u@#_+fqTs{!iga%f#PL=At*AQ;tx%R^iZls;LLu z#9YOi4*Y^b+@B;0)33grpUteaI@#Nkx?T^g&VjjXA{<(&d6x4F5$jJY5+%cDxD`(8I{W>NEjfg+D!&TYqq>$wKi z{!7uC=6Ue*{v?uzJFuxeO0^t)YFfTnNiSgI7m7}(N5oQQ=4U9B z8Zo$cfn;h*8p1a=2^gdKe<{ZA0}lW1={eIcDd+$H{eRy8ThyffujJ7$6X#sDq+UI- zPywls9KiyC zQB*y(DBN}$-sMB%iLWtF{@)Qcxs+aFS7yqV#M0GAR@KOu7D`thYL`-p#YYx3y)%D- z`RG93X{}ph8n=luUpGQ-8#7mvqUdZoRW4(T6}3vA{)zu*-@`)lm+Weux!~PSNOD3u z#XgvXqTR(-L@DG(XB$5$%q{bsr7R@yl z5dNqZOEyz4%n{{v#XqrH41)!$&cgdg2uOn>yif?usKA>T-0UY*sADYG@2;e3ovUB~ zxQ|5IcUg-iI}KH>+jq)F#pD70&((S+cGZCCa`!==>xs{<$~n4zANGjb?OJ_a3OFXI z5LC`e8$?>}ni+FiI<^WOGC8C=*c;x=+1fGQ@A-;?*}xYlBAGZv^=e9pa38f+13F_v zNEh^UrR@CFiT3hPq;)Esfw!mu0c^QQ&lGI(&8-ymKwYgboi0tSMuV4Op%O^rkyJ%Z zrS~Te-y5~jBJcUahkrQsry7-W1XkBOQh5az7PaKCB_Y3J&32r^s7X*Q82N^Ixl`d zMz9oXCKdeHrq~r3#@(dr${spH7jGr-10W*dYB1~pb4c=G_h3Gvy*C$Eg%n0or=vjp zi=ZLQMQg}53N&b~tS9)W3RLfjTc(4pf4KAYqFbtzARRzJB- zV+Ou{U2e}JwFcij?UgOH9`)z&`=?8m=fnDTkbA!D&*rVws%zPcwM!e|=E#nT$-&;b zwdc0l;%>uVSiBa$#=E-f9`YZ$ZI(9pY0rKQo!P31XZZUGgH0YdkI1eI5QD*Q&|m@Z zEAcPcv*Rx$GBYc99-SGceApfI9W@2Lc-wULMRMHU}T<>o*b3w_%>8&)GlT>R% z`I(_hYpE>*$6UjfI)PLS{^clsuNOdKA~AC(hx3>O3j{D8gcpEC<`y~g(_3ihWvna9 z?^9}mgftX0VH+2z0C@z~fJy51c_M9w{wa)>-Es+kYBo-GrnlVo7cr2Jmb(s1j&m;K zbRX=rl;Yz7xim9>Hd6tCH2FSM=k^0O@|#jI2{qpK*O0wa($Cm34NpZLGLOZDeU#XuQ0!mO4F zL$mGOsw(xqE%~|fze=LEth|}q4beX@Wbhj>5>FTVGQL7P@)8ayimoHh`gXc-kr7ro z?Zm1&h(^N&`q4OYJKws$mfD4VhYOuROxKSuHNZN~zjPm`J6dFQX_<;Q1-D~Dk#=Yr2p zw(c_pPR^8!d)YsviIyi*Ozy!|{i{TugFHd?gE?2_xX!vC**VO|lkF;eGHOQdTXT0? zrraH>BW=P3eJO%V_psnn!z}P@zFzVw4Z0hOq5Z;q^%$f`$Sj>T3q}wwM*&N=H~N%J zMeNW{^WI>Ryf`fzb6V*iW%vtnl;y|vWH;0^V{`^VH_IvE5e}~(;v%F@HTW<E21aK^p z5bJ@N(sq<5aqA&xMp6L=M7G$3&~6{AE4aAH0z8IW8@sP_Lqcm;6@+?l$mBI*Eqs~{ z)P(zDDHc!o-Cw_Oa@T`d*~>4e%OBH!GXUsm0LgwfWhRQiI zLWS4+QC>BrtW8LtW4+dG0c`1HU`cQQn6jQ1-Y5O)Pes13 zBLX6sTu2T216KBc9THV?0Ue`aLp0P>{AD&=B|Sx`a;5;|@gkh64c^@+)cPL4tI-G1 zv}aiVWh3oXH_RbPHb|+*L6rb`=^vRSf71{fqx?m*7kOys{5c)dL6V8%N{G)t*@P_x z6tQ9!UVb{7bV@X*rzVjro}+;2LuFhK)MZ3Opx#s`%y^g}n5pK26s4%fhF}8G5Lo?z zBEk}b7OB(eyuRy9Hf(!GVjppseE2*M7Ku(Pqo@V)4s$C$kvDn9p0%*iYKV2Ah7`zA zTtVD-NI2e5_C4i~_OnLu^vxKOi^|<9u>9MWRAo??nnC$^d7r9GtYM9QgE3>{GnfpT zUm;mpd$r!td)e}S7pIGM-5q0Uwy~3aC#R#4%9Mjol|(#SXiy+(JLZgi$}>l4nT8={ zdmYQta%rBq{U`-O5i{@tD;W3r6d>J2dP3VjbXQVJI)B)#Xd*rnk=_H?=x2NOu=zO) z3?V^0oMdVnqJqfib27W@k|V}-^QVoIm_5RSlUG${IE~xflKJThnQ;oFMU(k^_;Af_ zuS^nY@fyA|m}+i_H0`%A`4Lx1B54I|ZjB-t))M?bg1gnlfWyJ!*zQ0QY+6#Y=Kxa`>*hDV6(Q)LutxbUdnH4mu z0BM92wX;1jBHGgin%J?PXGlQ>9GG`4kga_Tl{en>P`kdCTC64EW_zNBw_Vn3`->cWyC-r$>wIju~TRB3qEXi96rX@^cd)5fAXTuhEipl%iWK`_-$v(W^3G z2A5>fwW-8^L>A6ROf0)V8StoPjbFvXgLl=BvPvXKx`4IELoxkq0`6&8;E=@{%uioE zpQs4RE{j%E53rhNst4EXv7Q6Ddp81{tbt%WijJQhif}e5(vNgqB8E(B^N?xTXLdb6 zcz=WwtBnnyZ;iG>o24IpU}0e4sg;ljR%e^Npm4<-fTQ}}>Z!LEtht)(nC>SvF@BQ> z>LGXHolyl`o-EGvb|-%jB+G0D+IJ%K($kgPl+o$0kZj}bXu&-7fZ}SIkz{8vWtPSS zbTjGU~SZ0KSgpQ`wBred;EvJXM60F=W7N z4gNTsRLW$kBLf8tp?MKYH_xYKU0Hm#475wZq&Ryy{ivh_a8gO1&W|T*nb!tzKmicr zG4QdEAauYpjJJ)FynCPYf9Dn`B>7o~1?g^{7bNMYQhjdOik3EJ^9)l(;61Y)S>;5B zXqku5tn}@Ez-24iDgNX7!@=;M>8k&IqPU~>e>(&p)a}lj;Ri}cW?Ulp=P2nS{)M_I z;*Ih&WN4zP+7b?^>2WP(}cEhXq}>% zvjPYLtnV(*QP5Ar{}fOP2qrDMadetZ<*m{H(uG-u25Exp|3rff!I&}>FN+kDTct~sxq%cBz&)Xa z;8q&F)H7lRWhA|ru^(W!~k{Tq}#H!^XhAC z9#zI~&DE-JEoMNi9i*p*4 zS;I_+FWSHagKHvV?ZOw5JjQ&;T=a+${gUD(rg`I{Q)h6L5-|yUpra+o5i%RL0m!I0 z?oz3^0_P_S%W#bJvvZWm#q^vt9>ilWm-LPDFO1~T{DN4|5PYPb#QIjaBG^k$Az-eL z#n31hn{IzFK;NW=BAUEW_R<4cb#Aj3#rFJ#7e(PNDwwxj=X2}omD6L&2UY!4XLYL3 z*3)U$+j~IFvw?c6)s9y|PHv^t_6@{LS@3KkKYs zDi^n9ayJ{Dwm2hv6&Y4#k(-ZFT9=rc9m!bTi}>N`?QFr)R&N4%5~sSOFXkQ^FmYAM z^-p*!ocSaMc=P%V(+Jm;(nB>T~(*2pkaXoK0e~LU26M3%1oxYqD)VvzNqC8seA!}j|6+*YRFWi zvqlnprP43M8Azoz=A%Aa4q$FX+6nkOg|Oio*w6L;>QZed)DzZNn#@xD=ri(wdjMe& z?Yrpod9Ko4f$ThxVQC!k_ooKyb*@J#e7s^f#JG&BuaO(X-DAUEpPqx0d~)iSd<50= zsT1&EbJy7P0Yr+^Qu&x!*#UW3eSjp2G=%?IY5$|qWMpDw|6eC@DZiMFBQ}`-YZBKg zi~ZYZHg7!7XV{kUTu-!-EE&*{ttzK7C1$U0S@?Mkgz2*NIKV>^B7pS6;}c+#&q2!i zb`2VQnYcVXM9D`8Qlc|y@Q^|glc^K^;;GFhsN`P&Z5W_H%Xu1bcT8~S>D)xQ#G zn1?&0Q-cW#746>Qwg#L`*3K(^Dzj=PdV;jwHl_TyKf;TS;{956e6gK;jomq{&b8f( z=A`;|jRIbDVKQqLQkDk!41c=ci}W_V*P}u?hJ|nn3E}o29WaEt;~Xg#qip}JI+t4P z1++4D{v+%3-Z*dak8zDF{pj5|YxHHFk$XL}k2v(;=Co&2XmzojbZf+Se0KeLF9CAB zSQHGigW#o=?=SBg|KY+0f=|oD)xFyBbh-~4*=XYbPJl~6kE&0U)5C?H-ClFJto7tb z`iqFeHw%55otR9VSh9}>iRu4pfMi>^8>Y|RYYS2)-pI@#O(Dr3gc+-X5ehA*SR8KX z+D=0WE(A&~0x}xQtZg&>l(=L)sxP|~Vml~mM0FDy=5ub@r={%Cu&Tpw!Pa?2>Vz?? zhA&!!eoJYRa_b7aFGl&2YIK}c;2m!;3T)##8+F-J%%fCO3$d|UztN3a19`cvj7y?k zcvW(EariQMMTk=FR$^<*PZ&DAd?-M~e;u0sR6VoB>gvz_-VzW=7 zhmL?JJFiUZoT4Q_C%vRjq^Sd)fm!Fmpp`QdZTv3_vM6tEwY{_Rjh;-zx&4=D51d@ZQ5#YD0H{=Dyv`!e*c<$!b5 z&t*&L-&E)ON6SnEYoIot>x0%tn;r368}RZ=GWy<*E7R$oW!su{;Eb5q>g^%$L!HAm%G>8%O|x z7=E`w@jr%PBt7G=^_0FWb*H2H7|_qd0#>ou0y0$z2E4bRyvVK(8<71)pFdE>FR#Kf z;_RZR9JfLlWRoEmK_?g~9HWpSADa)$MJi^!Kvy-#3q>(2d)XAX7B&%eNlaf3zn!Qv zztC`-*mNri8Ixj``G%yMjs^*cE4o{RhU=H&-6%RF_xC6^rQiBsv^F^Ifx*qd$@P3~ zWyMd4`D5h2N+RQbnG+n04F79M+|iJ-+Y&|S{ZP9%XFoOFizE95_A3#j6^7eM$j>9$ zAeWGc72{Tkd~9)l5R8N7>jhGk|TP#gU2s4nX z$`TZ+q#_U7$7_O7a?Xo#AnmX7UjmOzLyIa9AXy9%2+N+&>8`j7h87nKAdjw3Q8L9J zi9;_^5d6r3m8;{iCA|6E$!XO-xLNqjC^zT+M z1dGw2r?)(icm7^xp}}5HHJry6l8PlVLLFjIxC+4zBTs zBuL3(Cwt^d(XYZ2FhQ;hBZB3@Hu9Y)*dI$$Tt~9Ly&P}OhEsrMB*c=NC=QT}p}uTd z+1)?kO`Lzcpqu&3lZ15a4SvOGYdXn-DHMia z8Xru4jS&RG6f;1&zBiUaN?48%Qb`o_g|#IV(OA8aT^<%ORL}sdV!-gg-cB5BgFilu zaX0$}EbkVonI9*TbnvRdUxus!pA+vR;j7;iZvB*?z7J&06RP$}K)WiUoebQdh7^S8 zNE%R#4|!FS*wz5{Bw}X4pe7dFiU)J`7@)c(>BQbm0)QR4VbBxh6+;|I7?k4^zI0*N-EJvE!EId&E$c?CAgAeu}eH#PBXh{VV6av z7!lUTz;1g$bGTGMu8=mRux3o_dO%~jDj1$KNL8eSrz@yef2{g=#j^#1Jdk~b1_!eB zf_cRhyJq5@nymY5e`?4t%O?^mDPAjlPp@izMo;f9s)}^lhg}p%QiYr z$mDokdi2MMEKAhHnJ7hOJxH=#eBF+@K-)EM#3Y9fZWqguh0aJ1JuODnBz4L@_*@(| zKnK8JVjBKv0K+F5opTi0=P#jgWNYlGW*`wH40BB=Tz#s3J-X3cbpZxrZVSmjB~BhW znw_=iV&r!$A12raW$Ho@hoZ$WqJ@h_mIaBO7mHBBeqr39`R^bVU}=6-Oy8iuF(IS| zIc}tewW<xD8|WxorGBH z+e}LjTp#!@y0nu`>V~$w+ej0w7L_r_v?t5wu)c21m8VOmA78oLsFm(&@Wt5IcY2>4 z`eAw4D3)fQkD8FMq>ungq@{5bub(uhae&KWD@Eau7k_svdd1~7_K~XHhvI3IjaxJi zSiICL{QEfF){0tm3j_8fbk7{{gEw%Rd$8{g=1XaVs~Vjw7kq?1Z1;NH7CTOtK6V>> zp1sUVup29oCWJ=dcQliRW-k0}QrU&6f)Ly8HYC^0eKe(k{~u%j6eC*KM(d(w+qP}n zwr$(yEZeSGwry*cZQC|??US>TlbkPEe=;(z`?wjczi3bEuB-Ff(?3<=EcL;0g6oP< z#euc9z=|I1b3Qs4h&bayA%Ab8L~CunFnk6CDWyfH+kDPvUXRsJ z^~NdojSuqxR-=Yo&v|C5RNK z?_WRF=Xk%@_)m>x|BnR#w*Rlh{tqjls=K3d|712@z0D{!M3o7tVn0vVZkuZ7e=2unXNE+ zxSYH?j9{3k5vV{+YNJxK--1)?y@1Co7*GG}i<$mwNsfczf3~FLV5}u>uwDB03fa%e zEmMgqt;lR-u!xuXo+eysCxX|=Y-Ell694O5^YH})T5PuSipGZsBmmei5v_w4xqV2{ zsOI0&^L-&p5X=@KQk8V*gjT^KVTxnQ58kl7S3n(7|B7sKD-wv$1851_~eu6{nJ$khdYcG>Dk+=cqp$Y-2AB zPF~kr-m^VU2%HHgcoo3*u&SK#tih=i-hb*0&i z)1+f?W?@Zz^ga=xt~_hJ$VwIq+TKlRK9`z4>;_TX;I{!+sRP~Mo&h9)T53zH8N;88 zsyOem{szRX)Qu*gtrKBssXAbSGPBaZ}WTKw@6g&97n(B+^z-y?#mxg>-Jf~&6 zy-8B-_C*jA*5zkZ(`Nl^yXWEO7LuQ}|x2X5QbWtGI*qq}bhZI!CNlG+~-(%Zha&bc# zg&e#@+IImr{;AX$O-py9l%%Y&+w!ZJ_BM?TBu`+QCG-+xUi^hYLRX}D+9c5Wga0R9 zmwy&~JB0v7Naspr5>=dzj0sm{D46=mzz{nz*v+X;s%Hy6G z<5P7|lVy>gf|@h9Q;DnUScocAi|yR=kjZ(8C?nLU8W{y}gzU4SARy{2NO09g7SLw0 zAD$S#av~Z4nZt32JD;-i%sg&s>UU&eGU-8mw?9lx9#dzPEV2u54~_NQ-prI24&>Ku zNgVDsUEwM%73bi}@G9eY6?=Wnag{j95{<1rkG7RaOquTmcu`Et0_SD`Q_V}8+JW** zFKOJ+;IC1*Pwzai)s8w3CezTjvFHYGEm{CpquRi>xH9q(!V{DEoYO$E@TBlaDRIu) za^~D3nv7ZA7JX@0(Rkfvq;HU@N9!Gv!S*x!LN5g2n2Kuim>jm5Mj9Je^AXeMan0? z8>hEJEb;;`EBAS%^5*GbWGsoICPO-C`b=BgA3*nYxa0o&EPH=iV%#b+P!WE zOQ0KG=V5yyY%z`a@nvO_HvM_G>Rcu*a)XSZ5JpkfAiD3dvNqWAZvPs7=LI!tff7-D zeM4|7shVn{N7CG9Mj@D3sAH4&K!Eb*SUn2Ul2%e^P|DK=iJO0E+ z9;A-Cs;{r?AOG%TG*Yd0Ij8=6{0>6xYF5mQ2Z4_EAeAOc7jxnF@7O*bICi&GC+b2X@MBKc4xGGC1oG21T z|30kQzKFv1>gf7FYp+z99@NjTpJ{4t*mU>6-YSf7hON+YSoZ3chWXdTs@!sVfez@K z_cRl9SC{G7YEI=)N>^ak*w(gNCzg5ONRO#AM}|4K9k37W@FQ9Zxk9vjrZXbIO!alU z-xx%nfk_(8n8wBs^X^j@iS8{PXePZN5cB8Qsof!>$Agg9as4#McImIxL)-MyN~`+c zS|fJ&kym?R8kgh?9*Q{i8~#WGXb%J!`Vt-w2NiLLvdBoF(sC{j_b2in+x%dXM5v$A zRZuJs6G?@`gzzPsfJ4T{v1IS)eudN{1(X7kzui!ECOs}M!z-8~(E-z{2>lNyC`t?t z10!ZF%0he#YtF!)s{FCd=|9$E9+?5Ci85>SsHV=Lck8(?;Ooxi5S9JtOo7?9jZ@rc z!>GSIz+VZ!0$9V&@ZuKt7?TqdGGGj_(1frjZ7>7OfWf>%wJHECzgj;Dll`2k-*@dQ zUWi{LsjM}U_Dvtm&HauKdNpH=#hr6k3pVe{NGuohsXTn-c|u&$c%;BzW4XikFi6r{ z`(5%(p9_%@4dOvFRmgKR>YiPEq3{WQer>qE?c9C{(?_NHScrVSZMrFxj9|8y=00$@iD2HlE#jdQ0LjVr&{t$r}WjhRhE~vW_7wzBz@91ksN8BK~+O`wJJIkW=%vpI%`ib0o)OzJ@obnDyS)WO zBD1$Lo%OS*#sHLKs2BvqK&K?tQ74odYg)RuL*u+@6Hk@!XG)r{2b3EqfPC<)5tu8U%&tJBav zU4RM!tC#2U$z~*2{vw>God4sKK*B*VWMV`bWYY>Gm-7xz$v?PTj_o`wHt9FuD2yU_ zG|CEP*|abBxb+S?y+tDcG+Lbc*4i1$fzsG*qsldUS0Lr7jy0N`l8S?^%uL!<} zBA-{5tx$5mL4_E0Q&=Wx0#g<(O_D%S+i729OyG743>YD?veqH}EW_?~N=ROUlS{I2 z)F4>c-I{vT!F}J6LmQo@se=;Godqw?K{4KtK%ZZ6hydw#pwrs-5fOAOHGvPFU?k4h z_i7KWurh$M3q*o3^%;^OYIpbrC))<3f~-Ag1B|Y#K!cmJpz9uj$Q%b0ezXSMwgwj$ zf{5X3S7VJ{h!o-YsxO>T!Hi}r)k)R2dLwdyHkIZV$w5meEcF~UaS-blIU6H$BY%&) zcEv|6E%gFRuZC-C9pZ#+M0Eo7E(fnmRXyOhrTbcnH?0Z8i6 z_whP4#BXO`eQz{60X@S~qpg!9$d-9ERH%U(|6m&rEH97^$9=?Oc z(f`Ep+@M>axtdViLbiS^mCCY%XC^3~+*E)%;zqE_xewLZwi)Uy`nAg%ROWE63T-q75`7 zbmP%Y)LVt>Q>dc(j`O_GM1V0VwxzUnd)2i8-!VnCs0kcyiQka(L>NeVD}mw}&(j?6 zSh?Slayo#7AyD+6zb!nmJ73QtDFStGzpqbPUx4K?aD)C^7n#%nb9Kyy!f?8l4!4#k zi|Jw_ni-}*atKh$!ypu=esh2G>T8$N4Y*?iY;J@6tmKIiof9v!HIvD2i>%-uf!keJ zUQGOQeN55_RSPHs!>%yToXGDYpH2!dFxN7BWyJ+v&2v8G;gwc3WBHO-qAYsl` zKkv{>MiGy+YKfEb#0kpGu+S#neUNx%1QJ4o31gi}!Og*r%h2hUW6oSu1cB#2IjcC> zz>MCQ9o_y+Z#x~;G7!yS^GD|+{?uvTclO%o@nCSqBQ3UV z{%qIrK#^fY3U+tnd$E|6QQZf~f2Jh=hN!}!9G&O+bGXZ1eaFnvs=6?Z<{yyLVCGh+ zxLo1jygPT-TKO0Q!Pb%xLw6VLrca)6-d zT}K0(&U_s+Zwz@KS?Gk+ZbY;O$G>Z_(hsO=$=KJG`^$7|DM*WKVZ73%-raKORxzvFr|e)nlv5Pl==$L6$~8U02n?Yi9ZJy4k)0*>-l zGeuZiP;JaZ_f{TUTMt(o@iZdG1*_HEE0^ra*KyeAj;|_DL!KHp)c^XVkY_P%4tKgZ zd$&qP$>v@TaBSGyT};{c*LJklwpwO`=)0S-R3uE%SG1q*J>9hK1n_6wiD%h%!5@$y zKW`*~2`hn_?T;J_wqe>WB>_}8mV%qDfd=D&GHPiOYucR5>OB`%+OS7=Gv(BPvZ_?f z?OoWWrp)%Yby6)&)lvi}*-g8rg>Ls}k{fopXYQ=wv54X=is5o|r|-c&o8pw!qyo?3 z1XzJlBTSG+(}-JVv_OO^J{6wD2Jvez!~n^yz*O+E=LO7rB7*a~EGem3TW>*FgoX^X zQ*7#YzKY3E=v1~Abn~=PQ}y<14{`Z=OXpf#UB@Q zfnGYk&aNt_>?h+>4A09*TX6MYq9-=31DSB+tBu~G<6ZOPaGF|}D{C=rXL>UA$1+gF z4b?=7r9)Vt7JMmbAa`%uLmg2>`(vEHytqguHOPpJi2jsM1QcRj2*Tn#d#7P(fCK+j zIufO*0N%>pVDfBy~jn7eEE&< zQ`%Na?_5kDanPw%xZksm!u^beTj_m8 zSzQJ0d!(b-vLN2}7#KdzV?pDYPxJau!Z-4C*g|nI^~fBZte)cSN)<{h z0K4b>2(oW@P+iGCffWZ*#msyiKz?1pS{6zlYu~dBxtm;9j1i%c0xX9bWsK2I9bmV6 zy$vf#pu!D=;U*H<=Ve*NS4WkCN%C&M92i06WwTm99nI8+W246HOIOIZ-;vgJ@yomz z&Rn^C5b>x1iKVp?mDHM-YA{yT!m4eBID<8zK0saLtbZ|gz@?#q4pJ;Z?uV1h?5tje zL8u)C)qd8g%nMuxj6O1VINcfcf@bJgDQu+^5Z!zz$6f_xC?{$&33@Z5l;X1UeeG@X z_=o5pI|$sZY<9>8jdo_dFcYP61q2Tf;v{LTSy$1fpv41;1?fbNABjP(B#pp)jKEn6 z2rCrv(9@>=a7vKq^L6sR;)=<;?vPZ%zy@oKD5t}bx4$AH;l0EcKPW6PVG#^J>_%ZI z=E$~%pOT=n+Y5>sY8AbH@u ze?|>YNWTTiiEwsBkKda8sZFx3%Jw|2%Dz$}ntD!vX-?g=i&T^(IgUdY0s||%4 zh8zE$ZpS3ZSbW%4Isw-9uHhlFq9mTu5h=jOgvR*=9fIX^nW;f=BHbUw9mIZa>A!;2 z=eer+tsR7iPHynqK8K@_AS8-7Km5-pJ8Xd}S3lc>z8~L?bJE5;yntQZsYaK4>axQ- zNcW7-GgIGD()6+n6TZFREDtDdJv%2o{APaXQ}^b$eA<)cs}ZpPMT6#1J%BFWm^dyD ziHxAtetoLSWGSBK-$Y}PEVma2lFI9*puQZ53PSe?VX9`lKpwY5L{^Pag;|Q6$yTwi zS~&96g)Zy_gq?T6AODc7ANDrsFz44cLZDRZ|B@+Z*O5?yH4A``5_c%lruPtAvY(xp zcmg)Y0j;ltkDJq*+ur*>vrmenxqgq2w>^tV%9l*v$_BiY? z-8Z$f^}H(72}q)#VgWt`l7VOt`#9?ud~MSutcf1L-oa#FPrk`35u@A}xHC0bk4DPI zQbhRpqK+f=3NHP_NW;Z{c9L;H+44Ey=0IF0t%RI(s6gQ8#D9ArB3ZIal2p$m?FEKF zg4t+U!^2DIvIgpn=>e=lEtZfMqb6FA6QZ_O7)TkpYlG#IuL+r+kR_xst9>P=&FwA8 z77NVCV^uS+`E$Sd2znUt_2SL=r05))nJT!$MlF3T1HuxCIF2%_!a;>5C8!axPR*(y zUg*DYAEidAIw@FLqP%4qiaEzgFm$$kjj5i2*a%xYz|{0;UMaAyxyPXZv<=ukM<(^a z;sYB7)M2l7LM;SLOJ8Z5y&HJsx znv7#hHtK&wfPx?>0~#GLm0Si0Sc_oZ*Wnl>m2CY{$T`=3x!?V8WaY?&+N-a0^CU$A zjO!Gyw8I7}hhd9R=4&alYJz+M)qRjdy+g-DWpF52c!CwrFpA=S85=mdl55YR1Ic2p z!%D@b;X%l&Rg!CfQre)FK&$g6_V!G^mvHfmpzU7+vi=`ms6zY94F%!sR5^Y=FV_xE zKYk0oO#HfS-Ms9+MiGEO&64s=_W+N2a1g+HaPfqgCfaaA18q12BuI4N1U)SW#jpsB z0nOQk9Jq970k8`v<_`y7YXi7#XAh(Dn~z7A3j@B4H%BM%%%6LwGixUA5GB)c=qITs zMi1l*=#39=qm2h^Z^MX7xnEq~zD|!0-~VvaX(4ZqiNaP-PhlEm>ouL)g@L2))$0&i zVX(O=s;LNhncgC^J6N+X5HEKZ10SRy#DYia!JD}7Sm4-$-9V!ZuiYV=LYZ+*MvW8H z>kYPnqF4e1a7h<8<9*DwbopY%h(qvLT%cLb5m>C)b0m1AmUD_1=$I&;>d0*SGn2v0 zXWg#jUfP~Lbill_4=P4~u?44Xz0(JCa>q^QCM9=rX4`lDtDN5*RonfV>CL0QYXe{R z-Hlpa_ZqKmc=Gt!xzqLQf!5tYYYSSS$Te3xEaVGcasD*xuW3mOtx0EtZ)+E8nj54z za(`w0bNL1Upm8z{M;$0jPLY`qz5-gm1DU*mn6ew?^M!5%2OW20|4!>q_Ky_zsS z)bio~Jh*+oylo_Xy?wkiHa>W_S&!nw*5zP`X)3gjs}D*&E$`Uas}sj>p4GR}Wr#JF zKdQ*j(XNVYBv7>Un^rm9EgR>DJpcKYPK3|b3O;Y%X;$(oHEO`WMvbU>U5Fj zF55RQ0*p-H$-mhs3#VIQwqJj5xFU=@)EmvKbT4;hHRoaV8aH1n@Ik{3@DsO$eg8oP zSXb6^wXjsx{TD;jISD%ei0ybaL-=YSPz0o9h_lh(Ny+U&%AE{8R9a|a-&!{JXf{lm z#_HkC?S8?%KxfyRqHe5t@Ty^@t2Tw@hP9a8)u$#Gou?))w2hRY$UA5E1okvIw>EHM z3w7v{tYAps?eF4MXI|}QH zxmqtf`P7Y1pR%O`Mzza_vbWNxa!H-KhS5{?14WHz?Sy`jaejUW>f80vkdgbLq0?)k ztuMd9k1-e+O9gw!U?e392nK2Jo0`{(xPteNJV)h?ny7=5!C%dZX;i=|eZP(nso7 zQArTIAFB~^y)RL~SwN?ZVl>a+SYss~S_&urK)0|N75|4ga{N~w2NMJH|BP7=!I=0R z5#L|e&L-4gQTp)5$}L@wluIe4$jC{;AwWttNd^H5#*FI!^$R32m3zq4vXUDjn z?sRzRbo_|AgVn@LG~}W|5i`inkM)>s)oOHFauHThqqOYJ(~MmYbxp10iE^* zR^1l8Om)zOsm1?iF%BdzS(-JkNan-?=>Z@&=P!f zLamM-UAT1siH>)|NvS4B!I3ttKD(}LiXqUW&zvjXMbWEl-i3PqMQ^yN;?+VcrQc#o z5qG1;wKh5<+o@xvFA`FrWD4>Qd>|RsElT)$+F}D5+t~;qyn`I^1sjt&HKCb+O%yMB zyh0B+>Fn%_FRBYh6w&2)l7zov9Y>q>HkK~1cD5QvVs%zG4YN}`mAY~(!|Zaqj}0k8dvpQM0K1254dy6#M@ z6Ctp$KL@RNzzcP))j}NZt(Vuvqg5Y(#DpsYW8R!=DTVTU6O>%K9E2Hhse2;v?lC*x zfMHM-Be3K=6I5_qDYuxk&1S|I8Qj`-ByvqPAw18PX)rxTx`ZuxWz>0gSo;K-W|mqG zICFbT>Sl6cVAUf_d86M((u|8`3JA(i@jgin7l3Ib>z3Xh}p1+^aR+gf%sgD%#4( zfNqn;)WwGgMu?pKycvmu79`WLMe}Bs(nI4Qhhgb$sQg6Lixo@qzMb zf~2_;VB_i>^dCHZcGolZ6I@U-AV}}=K2xWAeT={RORpfU{f{VNOuS!3xT`BJhbt6t ze2dL^TkgH*@*QqtH+JtrhLyr7QFZurRSFN7SS(zZ6|^&vRlz*856QqffR%m7)yK5i zFwtRL!>mXjFjd_0jw(4=RA6Cu8hfsHo&4DxVRQGhI;N*h;9-&&ThCIQsq??G zT5imnv)D*vI0*$P5JPYERAh=oykHNcZ$oL)7_FKvOT@9y?BuK(0Bxv$B0{);{AE2? z*_e6ZV{2*B+WHuhJ#ypNtRU?4Wk}U;(IbIo$;WM9%##Cxe<|ni|4~z!TKo59Km>BC z^9>Dn)RxB`fO*RK&oFfWXxh(aI^Vz#To}wE;A2hbBZ~Hq20{u-Sun|Sq>yaeW~hJV z4}#|k4u)_2+1Z1lQ#|Bd&7@AX)nVk-z5@*r{UZLwYr$eGT9Y6yk$&~7>I>%5oI`$pKd%d@P{6lyN`1o zdWNA?4$d8N)meKsN9_R8YGY7~FNj5dU2h9dJ~{is?fBB?B84LVF0R6!YsZ$%mtiy< z*^ywFQ8-c^?m*=u#XMd^3TnWMf}ExPFtBSMz-yjfhCMC@Uk8cbALx~$5K%iZOwFQA zAtJq@^lfA3`}8%7dAhoxL~=xyqyO%z0@Nu1G+9E^5Oe4}(($i4PsAXmTDF9yqt5*! z9JB{WHl>M^2M;E^?xQFe4MR{I{DMa{Z`X;2w*+k+o-8W@vYxL-}{tN5n^Sg zf}TF;%(WO@5fxIk%JBNDPX@Udg(0o)v7i!uv-ezP=pau(2L}1bK8%8Cb|QqHDVVLP z&>=peOdk<`o1qU6qXyU*%qaOpUQ{A+aDsM;;tFl|>k->9{xh;-z~5XvO|8%{rUx~e zy=l)`7-Q~~T;!m5~V`hK5XWj=R!NcwTFj-qlVD0oY}R3>z?J;HJ*G)l0^=f3MWUlbwb zcT*SJ9Y59WgPrL#M<0rV@Hd;X7fG<1+%w*!;-0pFioccvV+Ku@{MMn>1&m26)}deu zas>Awm#uOfcp-n6q{MnA#Q_BR9V6B4qqFXhDG7N((ah7Hsb_RdyUyr8prEF1fF~j) z=&8R)BB7CB+Xcp0on@Pm!%={JK#V3YN7ihsaZ&FGC;KSx2xp8_>8UDU=lpYb zzJNd1AR7MbBEiP=AKh*?*8jPR&iTb3Z~mHkZfb97;o=>ST76|^$t328B-{e=5^-2s z%+zA=k+rw4o>$W7y+@GAX(Ktq3nU_l_>~?hZcZt0reYHBmbRwkYZr#7gLo#5Z?1QT zGt$I75y*<&)xGh*M!mJS_;-dS58;n5Ou(7^vm&TFW4gj! z2f633DB;a57H>{+xjhS-bP*pV>MxoA@;4*~U1{klmRyzJHP%tnjEL=Ci5IpZ{yomi zq7-@IL6O>Unz@L{?P)CYzc6Yuo+_22i2Zv^Z zW+R+nqtWe<3ds89sQ*j|1U5v;B5iW-5EEEf7uipQVBBGVeZqdfdx802r!f z9m6!!4{kQ@(d+6y#(TA&5!iYJObaq)l~vn5*j9{&Zo0202kpz`DD;8OUxGRLV9?h4 zfhw%Ksf6J@A{k}LO`Qgjc5nL z&atJEpfulYRjX+`)8wJ|`2ZSCY=8%FSodxAhvZzfWA>Ki=meni+YR7{{vt(@WwGjH z+nqc*9pV(3O$Y`KoCEwD+;)--RokATL-##9{VW{A<|d;voG*u=!cu~ zNqL6F59gylneet75o>CAIDb%LqtxyT~tOupt2wJlIQ^1yWO5U za4O54x8PG4gNLpMd2oSacpSI!Xs=i6S091yYczqSA$v5?-?m`*DaAbm?B^m_E;g-*J4L~rd)rbvCN7zTr;=IIGJe;2m zoRKy;$TGKD`G3WEyu?WLT|{hh{CdWU}v) zgSXw5aY?V;OvW{SHne{#n#(oQK?{Yb-tHDV=H+cg2UCm}oo&(-^=@wYbVFJ;#`6si z62u7CTG{jYsp-Mm)W!6G<4cx-`iuxdIv=raUrl`+Me)HB39#hmkO(G}a+n+)?HL(m zj4q;#3Z|kfv;{YD6#Ar4;ClqjTqa=0N97^}e(g*7QG%wMtV$6WR((o`y93RMTz{~IWcG3MUW}poQF=~$L3z4eB zLbED{c6jCEWG4tt!;F++-;k-7Ng=s=HVD+Ei!9Elp>??5eiBKq9o>crM!#TRi$&v$?l7irHKj{z?R!cvlW&~o$OLQ5k`J6O zBSVi?Ph1pfSMpR7!S!yvag`2s!xAfidp8M(B6r)y%H@nb1rykV6`)KhKlEMUnLm_d zPwGXVz2>vwIlc4wQwF}lBC?ec($XJ;HCcCa>Q=D(@ANh+k<@YD$20poeSFcUddjg# z)n3Vex=DP+ng#P3Ta35BtL@LZXKME~7{}~Bs$*bHcye5v=Zu@|oCm{+rqiE1OIT3= zn15(_SmHayOkz+pTb(72@P-0&fFf5NNoNd~7MHN$KL3=fubx@vPVM;5x-pk=wpM4x zY7hUxJKv&JQ89<~QLnd;wBiSoqg*VQ7f??!I_tcLdP3Dj@9m zvQ20aeD*kv0kprVQGk@my0dCTr92RI*c2x`WOb8l`v9j$cs&}{6uWjTd~Tg4Z3iYd zu1f#ztTX9E{6voB&g_KloN13~gm>fl<2xibZRsWqCY_;RWLc-?PZl$-`6@tM2p-iQ zpF#>5+P>Z#;0S&Yh(5xF#GsmW;Vfv#(aY?<@O>^(Y1^8aL`>#`Yff7h*Vy1#u| zTPpQ8pfX*YT3dh0z_6)W5TSsS!Wx`wKd`-!H_tAc=YcZG?|fjo4>&*uXj?h453GVr z@UVhj0X{A)w%Uo#nDb6(UgjoZ zd5ah^{~7?bTV#Tp%eE7jU<#uJgo6(0g%K4~#413yYG#AAubW~${a&9;+keC>JQzIu zA{+!z~Pp`>O5>P$fXflv{ty1kW3Wu+e~^Xtw|&z76hLbab9atsA?_ z4RducR*n7H9^T)N3BFmuj8CurSks;{`!3|#vJdP*Bnf($m*fB)*qsyj*pp;@>1h!e zGg$TYa_$bIB;Q?%V-;+C4jsm4(R*HQm?-uE4#^gmVYg+@Se#;N0mBD$j)bd9kOP2S zeu_ikY88qC&$9h-5(Z}pR0+7daWEQ}q3GC5uXqf=Xx27wdMjpU_w?fWJE#g$rfw3+ z9>0Xw5CW1-akdSub^`f(e0KpM{5fk6%i3V`=}*d)Tn$_fb55K7Nh^%Y`MGi`dU+%* zo61;4cGi1J3!m)5A#c+lxiwyypUU;+P%eNow0@;fIOOtE8iITxknJN-`&{V~D1<%D7qFnaa-clViiWlbF4PEl zgx_w2(}DmL%&gp5-LvU@9ml#Rm&w0KmvW7M^E(7G>iKpfDr&l7<-*joUBUKfUXZwM zc}tH8h2Y7uWRJ={8ln6wpZNg_mIDD%mI=h5bF=m84C$gsNJUXoxp?}bnUv{S(Q&Ko z(3F4t-~!R?cOhOHCU$BhsEMcn_;ZZcdkc*N1gX+w!>WXFLXcWSV>(d9bZ$$GQVmSw zc2BDtwbp5qm^0%S(tPA`Us){uqbwfSjI$E(Pe-#S|&^xvEs-kG{?e+di_T^*zgF2smx-iIKo6{*R}40cjh8<&om1(MrQ_Br68$a9!VXrEk?cOZ4hxAvh`id>~0CZ&OCEe`k9K+q#~4Zp85hu;a|nv4B5_O zg7b)g^zw}u_JU%E99Wufy7m*)!p!Xz3=uQF z0qh4qsIGlWm{e$L7c+LwJl&86v}mfsxC-IEb42{zDFzsS3WiO8v^@TV(a3G+bfwgZESL==?8%=J*eRW@2Lb-+fIQ^0fzTu)V$V35DRDbL$PH z8>i)+S7-~u^;@2z@XS#mNEf6dukutI^z=JDMG~BD=a`o$fJTvt6p=)4g(x?2ogOc( zrRlx=eEeUxjpJ@1V@W()yuFu7-O5bpl4{qvm0P2y^YBj^z3c8DG81JDfA=-qo-BI( zTh;5M$@1DO*-Cqur%E+QhZuE5hwA-VYuL6Dikr+_p61{dgCOr5thJ+L&^nvXzqjmX z{K2bVB2XkV61>WwYACj^7IZ{s%+rY`h_LL@qYez+-;CV3ep44P{jTpe+1*}!KE8%= zMz_Do6s_7Rz8FZ zS-zGAh%8gZiRJiZV;l|gRF0s54c+UyZ)gglE-KGBly;i&W<;J==p>l80FZv^^ORFA zCS~o5XdBg<+Ik70dGpwscwFXTQ2Go7Iv9w@QnXN+Z{{bHwyO-RH3|cOcTo6Z!BD@) zE}1C)jgh0A7@PIk2__q2&J}lQJxXT6np2N=WDxcxX<#bc({sqH z3oX22h*#XHKC#7Fpb?c!EJzG_AXw2{@CZb(r2jg^V+lmmW(w`-W_g|p z&4{a@A-BVrz!%CEt?B)Z74hBmk*EF36_4Td{=Bt5)8$WEKjxwX0!}TeSr_$BWbEnB z)~GMisN-W)d3MF>1UwV^GWYnp;Dv}S<`GUmjuYcV#XXBy8@rI zvQrfeT|tRIDBV1UXkRG57PR*iVD}kEP`3rdI!Nzcyl47MLEnfoks5n5`1Q+Nr|AwH zy4ZwnG`97^AF{AS(+|9K-1+zK{mXj1F1a!O=POezUz)vo4hgdOvWtUO5#PxcFZ|~x zabkYDLd#o42or&R5c1Wn%+`*abz14(OtS`)+&ddFwk*RB+&1e}d>H%C-Lpqsi=?}Z?_1|wn!vKj z05}ek6GSZl5mFAJ2$wV{%&K%U7O{(vWF-`-tKW`lr5x$8Fy zP2Y#@#WZ%b(T80@U1PIc@hlf~!S(y;k&{;PS=S~xra3lOX#vgAk8%EyP&-AElPw`; zB`k228ZyYSB@~?g;RVj;P2;e#Tw`&P5cGU-@K(te>VjTs-kX)U@3tAw_4%Zz0cCQq zxZLDpJ-}MY@v}?*&FaGnJ}3f?jDVo7gA*7P?P!WP**J}MXXD=*rQ6q;)G|Y-TqvSI zS9djw$;|gyPm`&wE(&-IF=uV~5UoQKLw6~&c*5`#=ViuZZY@zX8rO|TzQv(tG^o4; z-pL-rqAg|(ZdjaT^9QS5B$uo}9e6{MQAW$C%&MwVHA=WSPJI(;D}C=5PXeUjy%lW~ z$XP4^grr~^7Z*`t!mJ9JWK~sGGcu74q*-?^kjvZbbORvq7G>t;4|@FDVnB%f2tHw1 zGE6m@E=4K;-jO9_Kz*HObB%Y^;ToHzi$qDJaiWX!P#+A2 ze<|7$W~0-30=*$RKv6tT(YC#Y=f|i*AFEHG6Pw)zhnPaoZKm(q$0djkgKL;-3ea*o z^t7C3LS?>qk)jaoMP)Fk09ah!+DPU*DfRfz2Ek7b2<88%!J|vqyJBc1qg>wVYJ38g zLqSp$p-U9AD?lWiV+%m6I$dl-4$d2e2y5t*IlAz!j6P@`nqpr+ zxn@0MCWc^-3IUvPk?}?jyjTzf+vrYQ&-Mb6b(O|DDXG@XL${oih5xX38}J+FbZ|G? zlSKBQqP$i2J_ZC-@F^-*wMm86a^jH#q-VV{#ebd#607gV^>hJ7#w42Cpcn{F;@yr! zTPWXeL4Z&80U5uiF-mZFe*nz^gd)4Do7VQhZa<9W+Ycg{-L5E9t#S(UW_DKa4>L7S z&sUBB%?3Xz)WoSIBEMzXZ24L^A8Pu2+743+;Ogz~C(ezXX&=fPb<{(hepHpP&dk=8FK ze7zGuHxTRL+&^0B)q3Ru@lr4vM{>n;`tgcOUtppzOwq|TiZ!LksCPA*a6sWsazcoGj&tT0@$ zJqEdV9*P$_KWq#5LGkkjKGj(TRFQT0&9N4PebEnTb_CPyBEZ@EF)Nf+&?rKo`o~h0 z9~Y~WQ1_UK&J6Z-4d&>T|!;Xq>a zcx;KC1_N(su}Ym%Kj^0Q7K@1Lvr%VcztF(3U^lN0NJIasF2b zAz8Vt%~YN_W}=1XoMBS64ip{N095 zWq2xLgrmA+c&6434q{BZY!l@Q4BKL@60nwtP-BF&>bxWrtuwkD7$Iq{PLdXX z8>to9Do)z_&vw6q06`reecWUrI;gHMdjPz)V`5IPyXTNGq~O z%=v0;6~emagaZPfu>vnyhuS0P64O*8y>yEZWA#mSp4u6Os`q;>3MOV{9C{_wpo&b> ziMqg;D9S9(FMHg-9`29OEqirVjgSc6uy6u`$WI?`3r*o;NW7}S#8MbsDp3KCtlIz` zx(+cY*eA5s+@leNHYC`}&5OAVvL)7A^aTmWb_8>RYl0a##upUk%o;NGMf7NoYrAv6 zCj-0?QV$K6!TH8zfrG%&%7YaE**%mqrrPQ^GN+=US_|b&X=b*vMx1D7&d^u!)i8sJ z9tW%OA!tn3Is6c0=lwsF{Zo)^ZPcxcmhD-#ZQHhOSIx3*+qP}ZvTfV8ja_T)z2fYP zFV6W--el%YMrMqRw~yX?YwcM&J|h-VDFyG{e?e%pQ?<$Wa4+Rny5Nw*%87^FF@T+T zgTde+21IU(L07iN#3R)YItBna1@WYc5$4SS7ds4W8?_VqBgdQL(X2AviVzcwNfUL? z<$;yuc-xW`2gLCY1Z7llb|jLJf$JUWGfBXhA80;#`}t%V&1cnp_8qh=4{O_#DF;>T zA31kB*oKG(_#=UD+(zXvP5)o@hIj60)4oo`?(8J$MJ;^Gw^MT#$)PDw)^06i#Craq zVY8)!=(>Vv@P^98>@&{?{wV`O55S9l%_?RHQ#uE@NsNLM{fdRKVt5beG)Gl(y&O`< z(ViJ>HdpubSQAWFP!(5Vy}7`{hh4l-7_l@!o+n{=Zh8}IxOYPqZFx zVHfo4h~P5-3qV1m0ske z{sAZ77VP_p6}YAQ8DgIAV#4{Q6?MX@)Jsp7E+A!!3c01*gHwmN3qcGzLg7+8q7tN? zP)o-W$)W;4IO4*{semkh3}HkriEty3c(eu}GEW6GSiu>XyN;Jncqw-lX5$6(=pT@C zpytyB96*o+9XN-)t#>?RUT#p(+HN}p6Rc{6&|-yvHZ|VNgdx3q-l0Od8dbuJ=tFby zB4muwce|QhUhWO_^JB-=-}z#%AoP*GK=ALU{cC#*WlRuIUE&^w$lIpr%s#QuFkRp; zP$uIAEe>)k+M=SlR9cMS@F%IJ3FPWD0rvh$SPr`AlP(1G#zodp5vWPcopIPrgYecX z5&Vj9iQbjmJj!4OSB`o&KLyfc-yqu}mEQV^P;HiuQk_PJVZ>3V^EA<*jiop~xK~ zs65Trsq1cKkNG3*2WQsx#IXm1|?H=lLOEWj8R2N(CTdsHy z#wzg%$!C^bTE#<@a+3WG9?dqYzQR3~)}_+5|C9^Q)E&^3-pwMS^k zs3*|yNjHdZgw{Ed5Cvhz8&-`!7ye-`Bt z(@@S1jIB&)k|r&(K&Ng4FC>XxbfxxOthab#7Dp&qX;keO84^$Zt)nNXdPcn;sBgYG zEo;?~uO#0Ui32x%^pdEIP)?P?Vcc>%*52dfejtzYo0Vd53hcWP+lC8J2c#4HlCEwm z8niJ|MT9sXG_x1@qx|^HBC6CoC?RU8*{>PbAox2CU>j}IvIhf9-yQJ5eZ^o~Cb78! zTT(xM9vB$3!I8ckz7<-{R+*7&JITpa?s7v|kIQVEd^pvOuI0KS`I2y4zj43Wm-F6r zTvWo0#JZhNynJap@F40l^p1(uv?`9zh61-c!T0zF8Z+4=#5^#(wr4m}aNBPNd8y4D zjkW}99f-#EUC(ZFAmFGsc&NM1>jvQ4Gp3s#>nXddKEa4d|x?XXV zWhocDoXzTXPrQNZx>bYr?M~$uC=9LB0XB6-0ihv3(}6F9<_83nogp$jfM=8C4Rjg@ z$;t)%Tr3y4<54pU3=@}T@}OQFm<3QCj6B8ki{ujLBf^8LJvt?kz#%Tx;H1z|eKX^z z;zXgk>-B_4Z5=A5PQi9GnJ*!pvCM6{OlaEC>N&+bjZN#C4%z_4q8*cz&`6rmX0G;G zC_wGMDbY zrd(@6PxOdl(vqhmJGgTOlyE51W7Y^8wc{2PHar$`Xy?V=rV>mSpmXP#5KoTrIQMSt zU8?{tN5!7v3#E6loTre!_5C3Z(!8gf!rA@KRg(f*JDvGwiOTNRz6OeBD?Gds-WO&z zsy#?oq+MDAO1Jhl@yPs({I7Z(Yzj6}}=+ z5@L&GN=hwv&m%=lY>Q`n_$hdDiWV&9y*NMIB+2+FY$tDMNAao%#kQmIs#I#U6lT8A z$G?@s*Uy+^pN9Pk^SK^}=}#KI87kk^k&EpH&cJY-a(Ja>3IMxxT!Z5`xMEK#n8b)c zpnd=INktg#Nk7xw=IW@7QEf1hP29X4It7kM#T^Gy#-5!pQW)=TjyBWm9EJ^FmcA;z zi!wd?xP8wyf!+4twGM!KP66=cFueXNVwlgZ|JLJ)K+c;kw9^W?K29mkCo&oipd$y& z_3Ave?NSc#3tiwMp)Sy+06Fw05Q2@}Q+eD90V=Y8z@{2nj;O&v#H+#woGb&cC^^#l=)qJUgU&|kGUtTZu8`7#8-Kp- zLk@|5F}SO=d^PJ+G~ZQO+xN>pI`=muE=m~GWF{%y$om~C9d|nCZK=B3mqW_Ci}M-` zQu0NagcM+v;N0H&dT&ZA9SKmIBc-q=KQL2)5Xal z{6IKtxDJYr;tj7Xv`+Aq=y^D%~30yS~e$b0*`nr^=OmC1EO_KN*b<{z(V4ZS>E=i z539EjzRf8e>!Pc5eKfm)w>^5fqF4?%!Ny{q>~q}<@_`J-lVmwFN{Bh4->fA3{v4~U z`@10@(Pnf}aNlhs?V6vpY!+0l5lS1P`uB>EtEW-Yf#Qjy#7qec4l{!h0CrYPRylB) zq{>H0ZJlM+mQ3zT7k8b(BuUQi%4jUgm^2iWOKkRKL8!Y2FCXotZGbEG@nZM=ID^$5 z`-QvJSz`UvRb$!aDN`pnSm8G)Q3}%a)JxI32vncF4jQb_SxrQ+1J`f; zlLz>iR%6*pH+-PJ%a2Hx?vG&uGZF-}b3wWwgJM6YIKy)vY&6Vn&8%9Dj|~DL!XFqD zL$ue74FFtILVff!TanS=NR>iSKH@2OB5GCZ)mO-unIF!wXkzkg`ikpH$kf# z?F=F-Scw}iqwvKP&F6sNB0$JVoX^h(!tB41kts`V2F+)ECORqLpNk1Dbt;byGYY@M zJ(%{G#xZYMwsCI+rT9?>S#gO z^}r~&V{RS*jXKdiT1&PVktXk*n&WvE{8LSNYV_wygsJaioJYnkcsqAArq>x-pDl+0 z7^|SWG7>!_XZe8sxMh{)1Coc>j63`%(pj;zyPpLPvx*|!&WVk1nrQ}yO6jt0i9I3N z`dSC}Jr#t%!8r7p-WaASj?RpFiqWN5HepX$B+W1d~ujvMs|UIPf7Cg_jEv_Gq*P zyWPPkDQ8MD9bdJj5$}$tD!Kv7Vf8`nJ zd1z|R1CRq&Km@_sFy)?~G@%Kgd)T|#86o)3q&wpCuQJ`PjOG6E!u|d}T{qaeyQMRj zZN4a}zBKLa`*Vb0lM5%sYcLZH=F}M{{aU=b3f|+-O@+;_$Mpqpy1DI41~7LgZMCRJeq{?V(FwPL+FPx2}5RpO!2lC)0zcUnGQ3D84Y74l&g-X#lWqi0>^Q z97Qkd+S1!!7+HnSEpF4$KDPYr&jkPb`Bmj%qla7_6;Y*SkP;y|46^FSdd6)ec>H;1 zA1g*Y*%IN;Jm@9jwNS^@+lxmn|Hwl7&dir{r>0E+vV3wE3SUwu^yu_vAm83&E8%e; zd9=ZAXlr@t3%VMDt2vL`Mq9rdPsh3ylDX3G!O;*&OyUMWEEL$6VW>4~OabIrfce#! z>f98k05I5Fb#5TTX$9NayjzB-m*$QM`OghkUUikFi4qP9At413nI^9{rG4)F^lBDxKTQ^u3=e0;;M`+VsmW zviR5@UG?dGX!Zas)bXjy?T5OdBR}U8jJNA7xyY==uw54h5d;2e7c%D`hDo{NA-z2{ z2J5ySC8=-|BO)$r4mJ?pdH+5Ku?3Yi(&fy0ztT_8ODj6PWWt<-^bpA8u#o*E2h4Ah z#@<{8_BmkkB}SGPVA5kfi|v?uzi?AUktw1RI1snkdbZP5P8||v(A)X2z4E+-e*p|z z6@)@#y}%+iMsXs0PKS;O2Gv>a>e7EQ6Z~tv|3h}BxD@-X7UZC6xsM!QLE9E~t zH3SLek-AM%fdZ>=vG~)?gnizeg6EG2!WoARXC`{c&6`l|Le=8oJ8bxIakK`1W86)t zG^Enf-l<_SBng##->Io%qo#HdYr61nIhTxMW*OXD4oAl`l&8L%Rd_8!rdq49cn)pj zs=U=c`bN__bGipma(a1vL2?5@tTmRvA%oL;uV@p`N?WaHEaXViGQB6Qf}B?A_cef-pqqRBIKAWeqC66h$eoL=u`p9G2n@ z@{;*#=JHDA`Hh<*O&yO8H<6qaDN&dBlD@KFvA!iL3TPAl&dYQ z=L5P*-pjkFdG?_x1#DTVvK+$&?A?iRm1_-)WPe+@yXzsOz2r=DW8v$LKYLnXV&Or! z!r`lCML*Nng+GD%IopQy81_q(!I2}r-f#xWITPh5Y4z80raj* zCoBo6ph%l!6h((F2)I^|{k8!f6aP>G2J3cD`<4K?k~d4br-7yEdDrXEjxF1w%=0nr z#ZEJH7IXxBM(tmQSTBunW8fK#sZu^Upkc>c_S(N?8z&i%C}J!4k@m)Du2mnyzXYl4 z7evRx(xpKAvTRxzLEIj4UHaCiLCiR0rhVPs z)|>^huo4WHN5t-P?W|Ck(7*{4U-&rG4K#?hG0r&YSAER5LFb$rjB_q80@)E~U`XxO zrs*areJJeyl%AzP(b>9o=n5q!93Y~0sBv7)T%}gvSI*Q#85z5h@H|}s5q;o#snDEc z-8oU^SSXu4Ma(3fK|22CMf*uZ$Wj3{#?+E~p>(KCWGb2{7)b;fOiYv$d`*maqM~Li&r|@f7hcY$yWqWOrV^Z+tGZ zwfAWo80638zjmR9kKOE%FP^1ziWzyPailOl)=jJmJ_D z>WWp9f`vs+)BYwtV_Py3#s$soADI{F{Te%j+<@ z7F7wVr_{?7l1EgZH;9uN!yM8hR$-y#Ky+wc4KI%X&Q{HZK&PI;@mg(~y2%NUJf~)y zBN-OpUcbnGQa&)DT}moX)a7F^ySV|=3ya_x`UzMP4uPbPjU1jqI{nmCdnI9 zhP*fe?q_MI#;Yu_izqU#&Hz8itvhvFAP=9P`9Y72g1f(NKuHmN-EJ#34D7C%gJ(#F3Y)lP$ zkRw8*l96f{A}W71DcbHicZBu(wTaA$5kaNWIVECe@)ORS-%avB@<;9TV#cJ%V*A)yCn4|!oJKvucon?Z8Q z-HDHxG;yXH6~KQ{43ewBOCRRJcR1?b>#HF8OQfOuhZ~pn67vC)V#{CZx(*ah@XU#0 z##uG8Jo@~xx6WHGS#$n?4kA(+q~O0gdGK-V-+;ThgOYq;#=C>+K0(kGIBT85Zhg#S z>PB;F0jE5okf&HfE=!sLNG=ecU`XTxQXZEdE#)uH0zyGYkf$K~-><|$5X%7Efs_eF z6?QlGiCK_B@;xUncE@wCmgRk3DF*}8h3M8Jp$1Kh&Y1fGZq_oGS^Xz&Ti zLmh>gQ>2Gi1vzQvRqeTGJ#IOMwU=hiOHpR}uA?Wn)!XY}qDv~*n>Rp%gbJ50@$b32q6S`fTS{Uk_!!1I8JJ)7StDcX_Y|@dV7w5} z*%u6RFhYI1__TC_7eS~ZH6)?>2;4`NDvKlEk9^#0N`K{cp}W(nVSOvC6K#!(ay=8L z;>EyIrQjL0M@smnDt+1YATJ1v(R6p6SwF`&sb)XGkn?U#|5be%|3e!hqiw2~Cmeg) zPIqT=7EaBz((Y-X@|J0*^+HXrD{_$%5?RTxdAnwxURtcPVy0@*UCH3oB~Y5MEow8EB3M*Wt#KV|ewOvyj)jliaWqMf9Tw-6Rt=3890~04 z3Wpm6-R_0AFE{uX`m*DQE%jh()(d|{NPRb?3;xrv678w0iD4yKloDw;-_Vy+1w zhEfz0VKhKW?+~O>W>-d7RzOa6qC}s+?G1EzEJcF!*I%5bNNm2Vbv$Cw@5x|MVoqZo zVkPuP$>!LB$f`O*Nl_5+F@(4|_<__(c>5Qz@Xr+tAaz!_%mA_*9e{i!uUa@~b*&Lu zR7RcidXoOZCF1F=7#@>!htQ4T&^j;H7ES!iOb1Bv4-8+&HX;apH==(|PBD8)BnfY_ z?Lnud;wH|qwOJ9Pwjdmm!Rn=Zxs8^=aV7T^C-;y9GVbF;>9qfV8gh4Qq^Ko!x@ml0 zfV$%fC$_x{KHWnfttI?W!|Y4pi0iQeC?e4C<4B5B#E;}*AsXc!K|{(YMR4?M=LuQo z$U|bC{aKXBuR)iTqVlFJcCXh;+$6;t!#_^k8Y-BR;AC4rLu#6!X8A?rsEU0n=dD)7 z1LV9CXX{aa4rALWr$Db=TsXD zF8(E$UQZmtnYk{tfz7+d>1KnRr&Cd$DO6xgOrxqW7D^BGP=fi)QiZNz7f^+8?Co4s z(hur}HqKEJ#i!UN62)~7u7=?Q5;fdo2UD&-hu%;0m9*yx{o4kRik{WeqxdLXJ8uc_ z7^5g?!I09L#vzhc&e>91rltUOMHj*ztR6_r7Yp*aO@) zu3c+II6*7S0<)k#7AQ$bu2*VMR3H+z+yDzVst(}Cwc`3 z@l?07`#RKI&Sb&3rcu&f*M-)PJv@gEURV`=n$itYHZ5(uVHwZeyzZ-Eet1^hhRd~* znOS_^YIRfVTW@7+Yl=D3KS=zI1t3CR=Sud>kzJNP`EsG=3#^x+xcpy7EYpAO+1dX8 z7|i`Y4bI8`YH-{%c!hc5n*4N_MIuQDU;{tIgvgnOZXcG4f znMu0Gpx{8{&W1>@U^!PQuc5(HU{kR*yOeeyJkmconpsOHRpQdUO_Dq`K6s%a=daj13`)BzWz^qpGKZPBD&&hM)+8xR2t+ z#hvMOto&!5X=;-C>Z`cCD>n>+3u*i6P*0YHPsmb^f=;NP7gU|0I%N}!o!fCbRF}ZA zgM#8sx@=i@>@1^&Gr)AOTCYEgO$251c6T;%Ov~MGr=nrdJCQ|3G3bKBFJVSw#~L zpL0daX$BJj@)4+t=2DK_l5PS=RrI$HI-Jnq^OIA}(CL%pF@d1?sb^y#avbwK(3KX4!vJ#9K~8W zH{W#9Kg|&$h)L*#K&^h!gO?KPCtR-2WPPtoxZE3(guGuH9q=WlmWMjjjxytpBqMK2 zR82TQfF~1xS>?^H%Gqaxmp^BUyt^~L98>R0q~Ce$^C(kwP0L?|dTuH7_9GaZd)WE$ z=~yta2W6FY+(@fcA7CDHB!lLq7Sbh?6V3Pl8rSg~@V}bW<8|s6*8&$FC4DI2-hN;_ z*V=_vo|`$rQ_bLlq{acT1BK)XAo+Av~*9RI8np4_RRkBpmOkWOCG!rUjUB2rb;)tahr?ZETA; zdp)m2TumRAyQ1j_j_Q3jC&a$;{QNcHChiU#h+I-*6D1fTtB)24CllC)pheW7Uc(qq z-1Ro(<6;A7?sIi-`{}fuX8rhu&=Ps^ED~_zpf%rWoCM3q;;Mg5blW^~Sbzz!bv%p_ zed8KeT|56>td!4`-CZZJ?wYF={fkl99LFg9*AMh@&|AVu_NYC&;w$DZX??{=;oZ8#!ZH&w#DI^x}$tH^h zi^QhT%f|#KM(y;!e}9P_37z2|PoNOzM|NzU@!|*ofCzL6wa--D?^mF{hd&Qbk+ymy zYvXm&#+J_B9g-Xq?k$qW!$H$(D;-N8&U4&e-0R&md_BHjGfS*T4qq#CS68lTKiWTl zj~=2u$?Ht3l4Brt&oC}EWmXsMetbJ}ee^T@=&`43qHUDZZlvH<-T&4tr&ieDzA5#< zBb)^C)8~kWF8t!B=^au`&-`xv9WnM28V3*2q)`JPr==P3{j#mJ*4yof@z$(>6Q!&9 zaI`N7wIB%68TZ#RlW-Vr-~~RwwX*v|rfB@lVF9={JP&&9i7^iJ-)OAJ9Ar8>+t`vL zv!$R;$CMOFq%D6l?Sxg2|2nfcc(6P}^UA)P=p2sr2DQ?eo zWb%v_IDrD{;A?2R94_kTbnFPv;}vq2w(H~FOO+1utaN7GHImkh7JM&Xm*5>k<=afH6DnGZ!u zdXVlhl$5q#nF!^k?~R4aGURHup3S?yARVwJT(LjlE^qzGIyZ(tS3cxLt|I@C0W)V0uL$dP`$ozycS^44?ub~26^L{O?Zcy@hJqy2L*kT zqfYt?!v$nmWkHVcK;Oj9jnCe5$G`o;Df`6d^s7Efs6Oud5be~~y_Gg1mS^K)(-fq^ z_gT83$G3S($VTxOYEL1(j-0q>6q1cEJzE; zN#3vmu$jBvL&{@lTonA=3ipEWID2eW-+^?VUmGNzFQEyq@9@UiTxEy5L*@%7!3b>4 z{>E};9ZGhdU*ejN1p@Uq18og4qZJHp78931od_X;1EKE)hP{q$N{GMPzWbYS(f_W} zZ%x>vJ~D)$;u35z+9`$+P->>V$=Z_rE#w&TU9{?DVHQ)aOV6sKHIwgP<4D@fh~)*W z-`l3&r*!%%!0aLDE>hd>q67Vuq4S>|0vsXIrv=c;pD$zHBkJs>2Df^)NokEYjI&1$ z85>#+!oz~Gukwp=Z=81;D|54IQlM{K&xP8SCg^o$xnpnZj8fhjM61dOFt=eG*sou4 ze@>{_y#s7k-QJLIV0jb*+GJup2d;ck;?*T0I@zpI&bbIzc370x6rEx4V;;CURcjm> z*F+r^qQ@7M4nV48-f$FTeo_%{u3Nxf_x_vo*vNw|gvUWnSf2ji^4huQPWx9cTj_`A zYoxjYf_jn)>(-4dN=_Pa?C_7VKvq5su4Ipdc9zUOWw}2+VF~@|vXNu3;qW{EP!zWJ zj@H6W$TG|vs0J+d_kIH!Om;u$osK)TK-zf}ixxSZ9qkFwi6Je0)ez`3`y-1Xl-rMZ z9xG)Ej-vTuk_IvO=5Xe`Eqw-3-gXj1@!4kyRDLnYf_wL4cY50=;s?qVN8zUJl2;0UUI+@%A!VE;Q4t^6lp%1_b9LUjt<~ zp{PN?_nHytT0PsC7n7rP^>NCM_e|W#KZAa*Ua&ZUzIs672A)k&aAzW*U~Wx-7y97i zoS&ZbliuoZLvq3Ur2uu%MEiVhUU@iiWo&~cKN-MvB{AC*BQArgCcbdVjgU3MJ^olR zUv~smmoa5%Dn!18xexBD(Fc*|&lhH1@(|I8DNI=3H=l@mr)YSY-6r0m(V63Ws_=3w z?6)b>Cpu)){Uk`Dr%3*$@TsGm@}QP%;o&a@(p5Xz5d&y{LF%lV`cWpvaTs~K=NFgU z-K5Js`SI&~eYHAg0i3t|JMh5afXAy=-&^q+JfRC_q2L7%T_J`s@$94Y!9dyg#-Xtt z-Qiaf@!2M^JY)_G&07ZXA)?0lVV}tIJiX)eZ~&xOP!}6>{9T5(E8(Jdg3H)W>JO-d z9@vV}d|SuM$a+y;)^KmATK}0N*=9mXzMW2+xRq6GZmUY!hB$yaGx)!oqi-rpfEe6^ z&eyKceS_Pj!sGwf%>wg(Z3df>V*qf?U&?1$&Zi9NjI^>Jl}wE@Qbv=^0&>ZzW| z>5?$c3o~YfT4wXlBQ9nXZzHCb4Rl7-4iQ;4IiV78f8BXodY|!AKq{4}Gt8=E7R69< zrW=2kWurT*CI9$#^xir@&Wk)bp~6*aCU0c1{#&teVq?U)lZddtTDj&ADeEGm+RWzM zxCDCLJdt5l$+gwQH~*CPP-8_cCDA?ro+(PnMhJh(bbK!maMl!!b}? zd#~LAJgtU!u*WBhRn%C)zpt~*a*TVnQoMa$@%PHT&YOE}n=%<`xJzbx+bz9ZObKZY zg!t|pI+MID`5Y8Roi0K-ZH)l-p?%Yq${5E(#6PwWD)Sxgm%;*wR}a$>U4zPOAc#Oa zls7@rqbVOMMjX9X&s#@=yLjH|q6$dFn%^RdvtUXDRO?ZMc?h6|f0`!CEU8O(}=EI>Ow#%B&cI zucd_D$ex}ell&(mNT#}jn3h23Wn?tjAidyO)JdRTq-}Z2$Si@!x<6 zhyztg8ALA6!^!^b{ZSi=xc7+mGzYm-&3iRFHq^3XXifEuTSm~q@OT1z^wUO@Ki$3Eb+NWt#i(mR&C{(ywZZl7Mt!9?=AI$K_Ch0%>bdS z;*+@~Nzh23U*sP8WV7wpTK3A&MO|h7xehQhKE9L$VciNfLOUj_MB!}>L$kYODgbBi@;aP`VPk-3I1%(yw=$_0+HgfTWcC$6EuqSzex$T#88ERy>WrSC znB%OPI%G_6t@Nu)J5+!cKUVjyG0rT8YQ5qcH7UTA%u&lR6W8`%J~OlW6P1%Erah z+6vQgZ=^sxBsw>i_37b8;{+8Za&IWG1W5DAw1hPWlJHRSRuIw&jAVppq28sIX_ z&Bz~gBVyIk^9^$F*hS);o=)SoYOJ1)Z(;W=te<^FqY(o#nNTBzzdZebK1K=LDXRsG$FiOEks9i(x=f!ED6<4o zr{$d46Z7_h?(2g(HWQXf%!kM&Ap)sns?~2e8-qcvcKn-tl~4CD_J-3_Lr;e4a}XBG z6Xe3n!r)T6eAv(BhD&91ZCy(ir^b9$V%E7JqmsiU=FL#0&g>;IJU&>iCf`-FW-NENOoL z5^2XqjyP=SK)Nk2oEW zlw@_C&lOmF2AtAEqZ5ktxXL>#!KX@iwV-9W@90{-ag0}x|J{Wcc&q9@Zxnbm`9Kw_5_v7bt2`tu9UFXPd6YhTtu5LkWjF?*@)bL5yTUjNvit)8QPIc*Q^y z3k9{4U+c{K`^SmE!p!tn*H?Wl>`x8FKoM4HIp(M`0$RNBLz$J7RSAB`+0s~IMNjfo zPFq}_H&o61kzxWVI~3pv+#3TmmxmUQYGBVXHFK^!&qE+0cZ)(A-&ObAgi!}7PQQi9 zFj?P6!AUeHV{w&?rG+JG{TWWnNh%F5K6GjXJ#WX0(!6rr=3L~b~rtb(tk{+;} z!rPt^Mp6KPgjRxpxNI3)aWXJ)ttli3Z)g(41Gl&L6W>AO;u>pEtIp1iw6Xo&^Asj2 z1)FDOTmB{MXt%A>)lL1%cen_~0#`Om+l@hI($AZXq{j-t6EH2DOB-X+8m<+RX*0LA z3oJ0S_mpH6WbY?_Fn;HB)Qn)y*X{Fz8^PWicMi^vrPFZf^9Snp*TY}xy@*IsfM+LX z@6Fyc6&ACrfnE1w5z2}`gSC9A;HD6p-CXc2>~@CK9XODXePtoz3jkgE4DxLmduu^bsPgKz$q7!19%6v;*Z`BxM{?~pYbldfRs9VgkD70rOLo2GYV(L#pFEQ@Yc<+A}nO-10q!nSzrYmBNZ zjXb}R%SI57=fKDE&b8qu^M}t=Ds>NgCpGIr1F-mx=J35Y?9|H1L}~V7>Y3@E&{(tKVer-i_fL0+z;yiK3ai|irKwZp{&%1~G8;_dN)EEh! z7h8I{7;q#SjIL}DUb|t~(=aD@_U61DnRja^Sl^ScA6HWwa+=eMDPhDJTi2!v+zX5b zf+md{S5_=Pb!)37V-p>06XK(9q3x`(!amfOeJR#LdL^4kcSlXEql=wyE+1$RYH0m$ zRuqh+MTBd<*W7XreTnt#5q=ByS-^sdCB@h14$8TMjzWRzHjeZaW0mvBK0{hC#?6KG zbw@fKWSVsPlZ%~O8;ttV;v`BHYOcEBwt$I6hK%VMAV}e_w3pW`U$@fn zC<))SEl>f^5Z>6YneOaKQ2SQJ5T!zcy6*qtd8Oa-z9R1`^RIe&Jw@J4rKt{ZsLct2 z(#%O0*^eAk%PamHB`oH8LO3Rtq?jDlH*elrS&q3FspdWL>LcLutjqxdvmgz{7tE%p z25!w%)(;KOg(JzRem2~BmmFvAPKQdfIb zu^A=2=#n(!9wp3EDa)$Xp_5gaBb7HGb=V(RkzI??Utpb9URKvOJSa#&FeElvm^z-$ z^cErt-_$;Y;laa2#T!C=DM3WC^P0-eg0TXwVGEjX*~RQ)eF);xwSBW+t;XGmXQi~l za-zcd3Gxf$Gwt{^9#gA%?;&@Ftuc9nfQPEt!A7w?rQfsW4mV~`RCb7ch1Jv1${H3G z0;m_UQ~N+~P-&ctnEr+^r%yN?PcGQvDg~9h69|yzKxa+n$Jb#C{*wIurp4%~pYm2o z=CG^Wv5^)#P6Q*@cMRU$K)1JNxsd%yj=$<^d-DYD2VwIU^(d`%64&;P^g2&?*nW{m z4iRGaSHZg5vz^2GIj0bV;~!QnR(up$&A(`SFzZShLva|3pSp3>0J@;p=V_ea*e-5* zL01g@1tnH<5nYrgWNovkVBuVg8QY0zT^!UO_G7MEXfBT$I2-zNdku!j{+)S&PD(=mm=djp|7{HPzUu@m~8^|`*oZZF=+i~?C)c+?4e zg$Z&=&MKm}$HP6|^RhW=KkG7DOMG{2=f;#dZt5{7FFuW#PK5F7j~Q_zi_5j}*)Vbt zYHphZo{YAWeM<07cth&cO-y+nTG?d{z;7?$PP=c*%ZY~DD(X3pk3n*bKILVGO;%6R_+ zrLoC7p8ciY_KnIYLmsbdRrgi30pL)$$_EzN6d5waZ>U@X<<9Efr6u;LRMC-ep$j?+ zLCN%Y8?lis$^0vs@Nq;4)JpXO*I#bI>>Ror5C2Ojh&C;DW~oRyR89W2nOIwC;PddS6M?vfan zHYjzC(-%nJYM!RW% zY5A6@KvCibergs0?!YDz4SrvU`)X9)T2l{bE|T*#I_dC}^IO@}Ve!pR zdp}0vKSmH^*JGF_QXJKd1YpxZGDK&Fyu07dWBdzao@I{eZ7n$`*(OF-R{olIKy~?j z_;>)i8cg_z(Wcb${&;NU`o7wIjTpWedq4O%FH{$?O`J^Jq{`Kn@x2aj?}@`8d61$U zr*-8>MsEkym4`tAY#v7MVss$CYz>X7$O__j2sKFD=agfD+CC}=4 zutlg56~9&kXYg2O+E^7a?i#aVI+JMg#WEnIHLe^x;-_KC`niEe5d^W$IgZXbgIf?! z{Cx|2)8tbe6C`mSXeY3^_&_JSzL7vVdIwCVbvVc6rV#!%xDMROnVz_wBTN!CwVE$fwc4!IFSiw<>wM}_hV@9^j^Zak`U`;7$4 zRwbmk913z#qk-YpbL2OtJDWqNMHez>14?tepYlK&C+P{Sf73aSuCKm`R~CBPat^!z z&kA+#0HGpi8H2^KM4v3_@NdR4z&9m&^(5m44l?vmW}^~HIU^JH^y6X?_HfFDm_s-) zwx(Ht#bFHzGucH!63QJwSQ|5M;;2u?Jadn&K4coYDknbUVN9=P77O>;&^M7Ndp404 zM^HISYvNf=4%#omeWk`(D8le>!_k!J{CQ`MV@N<*u)sGMr6MJ3sSyZVUm1xZ1&t+R zJ4jE=ykp04AI4_{aVMB0*J6a7R3=Quz=Tv&M;_?P!DIKFVX^2riFI+2<;vQUwQHHO zZ;AG?M9LVh7ca70;O|M(stj%PI+k{+J41#WJ$KbR}0rD zwGZNwv2bEP0Pn^XHrN61ZaSEV0aLy=i0Rq!8`r=>fF4S*!xDy`KmWltXCM&Pwy&?@ zbS7I+_(SQKA-`rRxC)|@1Lk03Z#LE$+tI;~Se%A;D)fIb_D)fPMN5}%+O}=mc4nn* z+pe^2+qP}nth8-Av+MM|-7kNQ(PuyIw~e)8MZ}z6cxugJ`e3k)ALK#f=GqJ}cX0vm zG9=gmcOxUthXX&ZWi~b8@>PwJ#}qk{$%+*i2Nmop)+X{lcz}o_qdBh~i}XhjaG-B76z{-+hH@)g8M`1_YlQy?)~4u*hjU7y7Lx z*$dqg+66pwR?dDB2@s+@*fYJ}##v(liOg#6dxxyv&JVAiMw=>_jaNs5i>HIn{qq&* zs5lT7`zUwISGMrWzFT#HGHlF;p|I&^$K#EuPlmzd(IrQko4t2OvGl79HMO!@k*_p% z3NzN4r-YNP4zIKwe|`pX7DsYH^!gCv8eA#~to0s^hiDG56Rd3d333OpS0>fD7`Zim zVPJmSSo|8l6xHP3}pCoPp__Q~Y6d8@>*ZxQms2B}4D}{VIM3rZfgdWz3X&>sx z9?y-&3+u*dQEspb{a%Sazx~``bted9#1&2X@F&STh6&uAKtLRI)!p?lOQk~flC4^i zCXIR`C_kZ^8t$TJC5URv!FW5v0aCRckS`ZeaL4Vr< z&(4>X>~-F<={7e@v?bI|$E~8;w&Ozrp?+ipe$O5NsHUuM(zEgxgV_d{Iq`RjM zozpKJ(7|M@n(~K0DwcmvC8V@DzvtQ2${RcosG6TqnU>3fU90EJ5{Xqxg5>-{*oAzM-s~Z#Hm>6dH0g5rYp0s4d}1+I zGRN-JE@s}JZzp!QM@PlP)o1S@k%h*LOa13LFTp>?uk_8LX>)7A+he7IJMKy0V@X#@ zY38oY4`H6Ya`Zj{HN;@0|Fv-c1>ffUKLD%$V&OKc>HU8V!P2=xsG%qcg_PjyV%l{Z zTp*at`BWAR^YoVRaYb>-m@T2F-SV?!~!SopOH)V@5^8J z#BNi-u}Q^2i$MDtp`+X$H%$X=c`PSW)RgFw(rm5au*B={^o zox4OYP(oG?9j=(|Q%mmNmwZ|X9yPBld;G*v@ZaGIVWv?^LMJR4g04-w6dyXLvf)qx zCMd{^#z5{(mRdI^Tbv5ZY!vS1k2|zX?9s04BXf+Iu=n~mO@HU!KxLNR38v^2-bD@< z=oY5f;?2PvGEXHsD%$hOE~c$BftkOdLYWEfK`x~ui_KrE;;M8910)UGd8PV)8z(y8 zr$HmMk{u8)OfI6Y$+Dn*E(XY_7yw)>p$wmZt_&>llr7gymYlylNf`1SWBftrQ7I#C z5^>#fmMH5;?AQ$VpdPMBC@Zl<`Cbdh`ptp)V%>fbEuI22Wnge8Xnu6*Z}B`1b&+Va zg!I%^v@yOyY4`3y3xfrtTs8GPT0xBty2y%0>pBzP0fsso&!+U|dQ7n^iN`Kr@S=F2 zLj2nnz>E|6=2KnoXH>sArEM!2HL@pR(n)m%{Js+*TzW|C4cy-Mn z{$*EyKTpJ0s#FK_2?7_bs15tVT&2SOf++KbMZ3?b|8opHz`+`ztDJV$$}NEr!?`5f zGMPP7yQ`%I1DhNG{qN83Clo~n17%Ge#Q=*>YGoRH$_~FE>6lo7##~dn87pl&TYD81 z(pKS;{_6}oW(O?11_g(LTzWMF^8#y9TW`C_n6Ra*G=W88 zP|HsyJ? zS(iIROT6bWiQKyG0$|n1CH`1f=UuC^HhV(@OzMG*U~Vt;4XpwoP@^Avg=5gM7z06m zC^+zYl=~SW@N_6ITtMG8&Bvo8h2eABinuIOZ zzjg$Ue`)O*nHc`tY_eHZ=07x}?*B0D02qZ8cK+zDUzM2qKh9xzIs^u^U}UOmIFhbA zykBq+5}J%F{9YWs4j#{;!NWM{*W}{lo*@W^rmUXXc$txH6| zGs=itV#Bax38vKJrRSYPMWY7L$0F)6;#{|sLv?r$uQtlkjcHKh3r%?nOudk0l@=8) zD$Ox{g*D%~f8b5YcGA<4)=VfFf_?1JiFj4K!hTEv4 zfpoB&6=-FaEOw~c)DF$(~)1fL;cjpL21wuPH#wxD;aSNYQX%!e*60)cB2%ls!EgJPbngqidsF?Z@3?_30hgJTF#hyNO3bcy}f3 ze$9d6fQDM*6cJZ^0NY5~WtjzzZ&GU9b z$}mfYGMXDM5Q;>S8E=zN&p{>o&{nTJ^NeZ`>WaVI5l1-#mrL7saB{VEvp=^=#d}sy zEcRymz1BV(_yC_9E`JWV&?saEdglH?PfeC%Vvq3j2crdjFr4}~Q%e!W@sc%RfJ08F zF7yO>I~!iObAszZ&0fSw8)=nvljTtIn@M{sWSNBbO4bS9Y}bH3P+(vxf9_cSYLsxW{nrZU zYz&#kjh4G>y?m`R$zg=gU7VZ=+dsGIt?EmnIbE_eBE!)!iiVsZHg)_o?O=rj%r0JRrjVZOIJS8KJIMSSA4(j zB|HcFW}kaajc>miE%-C8>Fs{L9tT_TBfR=4)~-~LD_P9=?iDmsry%@iq(^eAnQ^Zx z%Q`u|TdJ==u#rDgP{MOCp4CSCjAy~%k{Fz_^Kxs68!eih0=-<~DoZwoFSSxq7!Qg{ zc_(BNO6n~|76=4NGER}LYAyBcFkJ2i$1j-eF2_o*?0f!fJKt@1=Tw|-jg4lY+l^T9 ze_^s&KmkGDxZ02Q=QdlxGBa+&=gfkQUO=cG49d0Ks4bw;RIj>YW&_$v_Q~3Fqf0vt@Eh0gMky*HhTk5;_>Qzn+|CX z7ETc(rHeo%6{)N(!XjWbLaXSvRjrmL=$dI+?dgq|b#Vp@-1tQwVPftYGw+C5Xb}&b z6(~(IDJP^zCy~)sGbwPZl~9Cjox!0Xn)h}hMn{2~8VrRJnitDek zw@`~njLj2;;~6*ZUBAK^M#83fQ0_HCxvhMK7DSU zwf=YU{7Y6<;?a_H;SFEwS975dMCVH&HhEo4<_P_g(D)kum3SbghWukJLW6sv0dJbd z9O1GgNLdCUgL@%4jlQ$AvAgrUZVV&!Sx_qaRW;w^vD|grYAyL3QU6+p5c>-F3;)W zJM;3J9BQodBu6AJoMqDKbwoq@kjIz3Fpd$#(WX*BofB_IqZZagznJg~ViF{shp-5@ z7)^3_Zj<#Q07lTB_g!d>-~0Gf8aHp;bCJDZ$}H~FnMs7xXT&z2p^Qkd+NF?$4P8-? zIh_7jLonG?){q(QrZZBxN@#<0+GF48TA+XMXw{qRZ#(9?;y&Km2weRhDVRPcDv$VE zietd(D|4OWIq?6gYzs-LgIWr_x{4-GPlvSQ+%~YZsAZ56@aViuC_ z;sYo(!_mcLS_us|f9BKysoA^@=<&NnA3LXP+OW88h1txkNdYjPC4F0P3U`BB*=^q` z6>d0p$9BJEUliiQrUd*+=(+zn5$u@?B#PwXwFnWKE%2km&mcmwKLxgjKL!#jC+;G_ zkW*D}*w0SB$yarT!TqvF%b7Z)1C3Gn+nT|mi)Zd*J)DDbygkrztgPmazRzQq@0Dlc(#F5s5$IMU$YWGNzoM!5u&&NNt z6yURpaPgZmTht}@SuP`D!6Tj43QwxLnTDihD2VwC@@Ec>$a2sQ>0Es~@5d>OaBU*n zPu(J!HQbHQUO&zYtWpF`8<_}NBLtqJfh~75-_^jx0Y2D_R-vJe*-khKkU}BEE`)QU z=d=ZdgcmbZiKMlT=Y3YCb6hs1QgoSzZ9<;5q8NR#bHuIh2*^HCyMULfmB?@MrPh;v zEEsF+=v}k<=hPvg>z?XOGWRVw@|NKa<2}^n#dA~^&x@VgXLmXC01GvO**&tBUmm4qK_bnoAROhj$AdI@FTFrVaGp`?No|{nDl#jLKrKm+Dg0pE zKHCEi$wAx>FZf#|9+5fYS$0aIoHZ=Y4E3Hfg#Jj%osAIj2Zjie&9Qj(+IgA$eO?ij zC)=brz^th$Ho?~>so%$78_1bmntYtqj3(~`S* zbY)}GTOVRsUH8@e+$HW>IeA19kP&kBvdEaMf>P~o<+u9{UpXm7F9Cspz|PQ; zfQRS*wxw7Z{(l+Pe^FYnQU04q5d0^Ruy-!X2!I9Dqqb37zj#M`60lAn;A|TxvUpy- zxs7Lu@yam6Fx}2{XA%S#nY%$9zpK{i?r{nsK~r8T+ai{=AH>*C?n`1VyP9utTg>K? z^Uz_^MNfQ7jj#Wh&rV`5oCa5laD9aIqDq}_lT#?3qt1=*^*KlPgLUVcYNj*AKw3X) zK{xAKb^V(E79=%^x0R%p#!flajpC0nGuLL$IRkqXK(GBJD{;ryv9WxZeB}p$66_xq z>Mt+IPzp4H8p&N9awR_FiK9KuVD(B%8%3o2Ji5s%Aw>~IBvv`Ooz;}>7mu}&?B?klwm}7M0_F7+W^;$d|{u2m8e|4 zh#VykrO@;;Rk$eUF~Drp&1asP{vBpTMN^r{meX-!%7PvKUB%^7W+7N&&T#NJv-5t{ zfs$DQ@M|7RvxlZS!byAbqaxq~!@srrtPl4&ZoL>2pzdUmjtYPWws3ZHDU~U39hNZ? z^@Fig0QU=4#h#7gRcIyi4ecibxyxnHW!xSH$->*{rI?$)U;;h$Zrpv3j?OG4$3sqG{43R;q(3N-pd~-eM$v9POk<(e^$EX3jw+CV!xAdP87o^*|nsxZs z>=XN&%@*-!-SxsEs&8_xZqJSFt1!u{=;B=_RHeH9@WS%xT5q7me$};VX$z3qvM@U& zk~5Q?R6IR;)V2BH@H+o#Ximg^mO&>R9rpv1-k^g7+wdwSeS(m#X8-!0Yl2JbN1fgt z_yvYUrCP(!zmF#uTWpFk=u>p4FAcsvupC;~LNKhTh>tUgG<_oL25TG!<_JuYB_-$C zghsAM`={+DAhtg?X-Pxh{@OLe=Pu_24uWU~X918&#M5FOO+1kIaWKeeb{2Ns$LQ0> zXN5nf8?2GH$@K=;XPBhCSleUhE0HtS|4pehpuf8w{B9Erm_e zXf_f-gt0%)&8R6ClEbNtTnk>f(XQl}Q+t!}&W(*EKzS(GHYI@q3G{7K#x?Z0myEv> z^5FgwgMtTY&#4bloNf85dnF0`yllN&9lDx!oxZfP!ltGC< zN}zBF5;oshXz*$))82ehSioJ)RUQzcV1ksF{rYkSg!_ZNlg_Wx>i~y7F%5~`vr?rz zyoidbib7qsT>c1vhRO$yBMu;rJe8@NKE|vZY+QFrWWLv_eXV310`gSl8v zf<5QPp0F5YgmTm{>?Ke@PslAYSGN>UMpWfrjT^XH(+Vbz0wU>zmO~p2b+J`-1yi63 zgFvD-D03D$RT-#-z<{;yqmP2sskK+rGSs5E8~y@g6kc@g2!o?VU#KlEH3^RIY3vpo z4v_DFV4`l;z(@_@V%e87d_U%1I~kGE+s>)*y)r(-AP6Y%4o7=GrBc7K75nsdDs~!< zM;v{Y6OakbsD-5Ew5f&Vkdq+QxMBq!66|4uEk4q^aN8rt z2+s4pF)?zYGZ?#r(=vLMYw^1&^sxR9CtKjw_L4tJ*YPe^B;R4=Q;mxjGSa{iaf-%i z5T4<9_OGs7fx7*%-2(tzrQYHCSS1y*%n=!2onH^xian5HUnr58P}P~h*g7&TfM)0D zYI%cHdR7tI#W@+*VP6dB_2Ev5k*ejS`9iu67*gjMvP&xTf^Ojm4+Ntk#{8scM9M?egttd_@3w8=pBgPy@ zS~0C*%gtoB;`o^`lLU!5Lie^OJ!$8bc zAM-}da8nJGQS0^;*7!j<6X;@s;eNwektVxpeaH*4#3B` zZ)|=2m4gx(wgV-EY{Gf-C#rVnXSFupc0spFRF>Pm_yOId?w_S z@wY(-qg`x4(72CS;B@f)nz1j-q{Z*NP8^@VJ+QwndNXX@jm+J?ZQQ}n+3xy5i3pz6 zK)5r$Ytk7rM~p~&6YOwXr}23S(hunVx>@A^5RKeP+oic(Aul+No*zyzZzs$sIE$oTIPI+*20F10xC+Dy-BS8#^}8P!AkJFl0euUD09HcVBSzC+h^!aSqWkr|PZ0CD5M zLI0rsrJYNCPhb77zoywebZ%kekbABslK|tE#MVsTb`tj1RORZ}_co4OYlK(}3X}1S zoFI71o7Lz#El+sH&;V z2?u8>9L(e>rl?bHa4jP>0xZyAs#5&%APltUl$O~H3+9RiD^koBzAZsif#c~LzqfL* z{joxS{%LmErV+YB155)mjWEw%1bxx^kd~y6}u?R zwcVhA(3e4DeBf8iU(~6ZU@zBf>FV=KfvBAVym<2PDS)xdIF4UQdzl7dK|PI7KMG4 z7VY_%MaRg|?*o3wWtJR%_i6!2#jx}Qt!ax60vVCk%jf1rA!SOyFe@E;Erc8jf)^s_FWcz&FEX`Ch`B;_L1W(Tu=9kAz5*AxCj*Ih~o>)xn7}W=78LUjLkcAXjwQ4qCmqEI-j1=ds<3VK%EtsyRnBwu{NUO z$hPZi^h<%~SGbf=bQuV3fF{N4P&o(`1QXJUutBTj?k~E$e5db(W(u0@faJA1l|->A z&DTvoA{k5_n4Hy$R)0BT*0EeZu;$0i%!hKOVFDCqg+KS*9RM)f?u{gpxlA2eM+rME zrT-mTnyH^1B)&}!gZ5cfZr7*E?9Z{S3*JEMgP>FeAFv7YVxz*i^ciKD=PsS7fE&^j zy(e<^QEUmFIzG-ebZ&Bk%JzqTn6c&fK{uR^_`QCXL>rDA?79I0^^JDB!NV>Uld2d%gAA+MFLwB3NPHP%~xTwc!S^M2!hqlkYQe|-g7RYodWsqQ$gI8ct z^edX0;kKU=RE&J<4}nyd%f@4yt-SZ*5ehR#E-HHq_>f>E(A2hmbk7AJz;?#H+qx~$ zCvi82z|(48SC_j|2PhzJpLMKPXEuJ}(mRA{#;+GX=!93@G&GOXeFKAcg3zw7F%=6M z$-p;jF@%`~MsNXFehv6_j=8 zJUOuP8+|FTg5jqVFa`ur;nyso9;zBm*|;}jN+{#%HSRxf6hWp{-1rr>j;GHnwEujB zpZc(r5p`T+$3eFTtj1Xzr45z;`0^Xg+dvp4PR8*#_$WBJ$rnNgR#jXqt7zC|x@WZsG^pjt z`;N~gEAXS*j~Mx4rR$O3(6nG*;Nd`{TO;CUat2vh*3wB+GCSZ33ZuXWq|AMc^K`lu zUuCv9G=eO$Zrb!t^L%!7l7G?MH8b;i;&rW<{4_IlDMY_-fS#1)1unjRe#h;^=6|nJ z$;&2MIW2eJuYb~Q%nQG19IZk>4 zG%+p+N|cJgeC_SY0%3PCPSnVYNCW`C*C($NaO~wd=jQ8Vgnjnr#tSz0at^x{Lsba z<73OW_X|TD*?DIJ3=_(}sGomT+_iIG9?PL0_!8)YI`(YK9CwWh)u!=_ z^T?Y}o>cExo>R26>)|es(p>U>D6j|nWd-o8?EG!`ptXY0GcN?qTUr|s-hLCLbr^dTSM~B{l`wzZJ*}&!stPr5kAr4 zpsfo4h|qI7V!{FG5gGsR%!o~?2@vuHLr;}V!-I9#`-Rpa?e_;)YT{VDLD>|1+Fdgt z>@fu7F}$?uVd-A&b*f7~RblJ!_?NN}qK7UX!Qpye`kSVzWEgbW_?t39jqmnSRUJMT zUy}zG6z8cZDQZ9i>s*}pr!<&pnOg>ATM|Zx<&`k#l*9*)V@Es_g{8X4jsk2$UW*?@ zh5zYEQL(b(GS!wEOVIO5)EHP^?gzI5yK)L++z{8DZ}3v>K_*qoFsP_re2Rmuy>Fmp zu{d2Q`e5u>gM^(m(y41;44clkog9d|GUQ@0)u6l#46&qKtuKm0e^+jBiRS;i9FNwi8-{(!_z0IB;j6Zyw<98^l`{o5m* z1owK%0%bUjpA=cTQdDDTazTq-LE+_ckVqddcp{2RrBncPQNk0)tUS%_X9B)}LVElu z)_NW=1>+{rRuppOdLi?~*wLBteOBji5@|xY;LargG|srlQ%p=#A^M{?YY9NDF-9G= z6_t(w*gCfrP_J(C6a$D^>SVYv?NpCzl}!nO*GY$zcv!_Ds*_9Byg*liUiErI&9h#0 zq7n63aGeut$@-#Us|x3QR{LQi#+$J3@XX)gCI(BFlxF0uaex9G*zrY+J_eBc9eQb! z%PB{aP^B_+D5ZRif>$Q*Pabw)Bw4B}I0H55>}qCY2{|CXMGMpQi5Ayf;hGKF4f_fF z;1~G>gAbeIpUgP@&p4K1?47i61W1eyNSB6tX(5X?TTmivJyufIaL>wLBTSup9}(?W zR_GkQj2~}<*bYlJlHa-%bwiYv+JqEgo zK6h>dRG8MFSMvrkq@1E$w<8uO-2#YFXfNl^jm}kT7TNm>JWVFJ{WO6e+^NJe!igq~1D~O@r3Y4U4pt?xf>81|Mq4 z9>;>Mt8KeW)YE~MRReYOETK`?4e>hNc4paM~beOP+qfBdh?JFwwzkAW#dg}z8swVQWb(BT!DD5pQoU6Vm^-@;bD z_~yhH3+ZX~g$iqHyI15NGNvA!`ywZ{&x_4j+UbANV~_)qbqMe1 zz@U>k^hPhP689==d-wTp@0;wZL7vg6NLrF)o10(#Uh{}Szn{uwuZ;DYkj?5xIzcskr6kp0*7bF}^}F4A#L_>1xP+UmcaTMVo5_wIea;J?^yZw-4S*DDuU zy8N^$j#H&jB6I0&*{SIjY&7gF4=!GhHYadZoacaj%`E8a{mwDg%Up5Qxx4JOb}eDe z+-_mHvi1!u3P56!6Xd1y>(=1${7a^ zLk=4L(6fDGv+N1hYNFBmN@&>|G8=scy#QZ^|LH&Udk=Am*-XfT*O&fX2M}spIv~J# z3|2Pr)X8oH{$RJ*w)Y+Jaxfl13olHhz}mE+ty^4a*O?`lzYv?PGx*I2X)>=wgN+kC zM098E9`V_tztDGUr}vrhq|6ELK(r;}d3nHS3Aderja5T@;=&M}|`rF-w%b+5)Sy zSaL6XdSB#o*H>n3*+)71-pIIIFS6EkhBkUzZl9D!E?G&}Vc0mOnqzX5!Rv!9Pi(}w zMRQiwU?gx5KO_eZvjPcTgx*gQ-{tmnm1WzRu{!4$rY*e(~5SD~24P80Mr1+W|3Hq8!I>w>WXUbVT4ln=@xO-KIbWi_yr)W!NdnO)Cn0y8Kq) zvzTOy0g~yZjFQ=1I(8lx1Stx0Qq!0xj+jlo+~&a~oHC-I7^l8pUFC!yJm;0=@`9Qv z!zHIWRlr-2f`hhh9AwpI_e|NLVEFItBCc~vwj3ruvQGxbN zC?idnu2UY2X2+0!Xx%9i<|SrJv^_t8hS0QWoJ{=O1m~Tuv#6aAiy@lJ9~AI}qnTaeBuxlL z>K7PW5Y-0@^6#M^?@h!Zry(V9a0ID~d1QS&F!YXM%unNzId%WV;5w2ev>3Y61vyiD zVbxGxJHOX++!BnivC;EKo?ZB4V3&Qdb(lJue=6_XD^*y0i}27A7FTb1gWUR>MOE53 za%n}VBwuO;*_0v7`*7)Iztz^9A&M)b9YV+yzC_p|{#jnRgm>-_jtZo6Lr{583zl;Q z{@JQ^{;;#@=vq~}x(JZ7l(wA7(N!@YU?57fLfN2jZ1hVpF%oF7mC*jv4u=7MlDB`E z0Ucg~Wy1!S=2A)LC<)Vm;*CKo%Wt#)- z5sbW!eJCBVQ6GJ#3yL~m%g($gic|k(=ED2)y7N{Yzb;LRjr;(^V)s@BLC?|XfKN+$ z#PX1_Z@eV;7Nyvc;Dnh3ch_8OYT~UVPTu36vz~AGds(Z$nEsAaG@)t9Kbd!DeR@my zR+oo5{?FMPUF?g6*RS$-#uKDTGYoF?w?c~}`3?zL;l`H|7<$TxuSLR=fcDulbhw0p z4Ms*yXbxpUqjbLXjEMfvR6Pw_nUzSENX7$26SXVAf``d%)n_LHVSaRglN)Ws26iL>UFE*VOGDbk*whRu~SwRUMbOjN0w0tAHuV^knTi4O#CkvNbx4I>uOrGz)UfkjH4o4IrA9Lnrfmw0?4Vxx$jObW zCCLLj3R1;#t@)c!8PDOP1C3_0&dDE_En0?#zy9n~_SnV?d zgj*WTr?FUC%K@utbhw&C=~>MmZyj;4mQnyc z-rk%iXyLu8`^xtHHN*0HEcFERjiGJc_f4A;b?}&IHRceAL~i3DVh0dO?&r2*S;>+8 z0!z8sjVGLqfuf)8TkHClgjp5|${|OVwgsPGQTV66NFKr8?}3bv44x1(8jFMMgeII^ zf#MrjoD!Bdu1#n^eEDSG!cNGA%Iy60{*Vc+h?(S)f*bKd{Kqg!7(C^eydG<1wA)L@ zJ94(ekMD7T$ zl@&cK-$lYJ>o=~Cu0CbBXqT=pxN-TP4#nxI?axOw5oNmKqBr4b7>(|5M-Np-&9$oY z(j?~VoE0-$wst7e)~77N@k#nm;zx%6$Rg-SKG;K>^G~YRO4qnt7+^Qh*xLk z`_5J4x7%bE5^pHQFTrk1D&W>ls$BmWwrHI1Ei1zPOcgU8^v@zYE zh(|slp}%+Vw~g+^M~^tP;OfPnh-lo;FyzRhU2v%MY`n;1b1fjif$&*hxqO_%?7iz} zzjo0&w=wA$V+19S08{hw5RzR`mQ|~GVI&?nW+A6aPeQJ7qrjY8hZaKM{G;>SfS^cp zPs1Qbn7-J$)w%5Q+cHbNDq6F+jt8_bQI~R|`U?J3FRQ*!m0d!dg5HdT6IACsYsDr7Mx8+dtw@xFq!B)3}usMDUA_OiuUXz|D#SL7Ei%8tw%%x2C zL*z$bjm`y!kwqX>@npx1L9qymCF)#n>Thvg+QSHAZCx#j!Qj=lur%d_fcawq$JM(D z`x)?&qdNbGB@IS-UFTe7q~S=l_F40}XW9J-1`&cNj22Xc-H7yAz*O`{!R_jN02l0s zUYG)S>XwfY8E_jcuZO|asXKnDb2OkVK zHXf{J6kcrJ!pw8t?ZcNsg_YipMdk3h#qZ?dX=AsXG5NvM#v`Tz9T@2Zk?x~Vt~ydg zFJozl93H(QKjy?!0$I&rJ4>))npsEn-@v%z;BhCm`lorDr+xll&c?_yealUwreVt8QEfdDMT)Apq6e9gws6WD;4ejml#l!G%m3 zpW4M81u-U94%k5ed$i=^HsV1FN1K%k2Tn0oaC3$5_ePdlhc=uiHn=WbYrnkDM>_*Y z@McwRkf4=l*~o?FY2Qp2LN`amdKm^)|L%_5oLek~W>|Ay;WyZYBPhjVcNFg4hD)~n zVnc{J8QhuZ>?bwOqj(i35pA?lFiXAm{dui>H&|uV_bAZ~O;fCR%H=gwKXgP7t*_h5 zLL!)y#7LY+oUCf2G4#;y+T2ha^wcWC^+z2rYqgqG;^nTN#!p{pN@wRp%h@(y?svuT$N-3cQ|LOt(P1eb z1BpJd#Ln0HiX5etI$&V;8ZvoCE!mxk$XGIZz-(x+#HvRxeYXIp%Q%d@HxseYGmIr= zBHw*PT($&?0f2gdEI=N=9siA?B-Np-I|Q?vhka&zIL1I9pavEZ5l#RggHPPx8|Apu z7!h*;8sVjzuqbw77TodM^;X@h}f7Tv4 zxCYSd$lXa-DVsE+DD)c>XmS&1cR@1X`+XTtzogupLeYYC01wCxnHQwcki%$|8rR+Iw1Nd`A*dN&g@;x6uVQH(%R4gx_a1cU-~Meia6&DiQ&;p{E3y&P?i zAm;J;&0H!$G&N`X#hYwi6-}-vR2T1k`@++)?WI(2e=+f%qu)|s(qcMFV4C7GD=g9=tD41-JQAZlxAQ9K#5T}hP&6E>C7(t!Pd`RFU8BF9ZhT{6i^&~*<2B_1O##h&^X%x-i#xP-}r2yEC3PBWxK&ku#==SEQ2qTDSDv819l{(&T2m-JY zxd)6L7LPV*!3rV>sbsLU3xha?8}M>NzN`;5C5pl7m3ptu3IuSmeCvOP-^ntY(e3c% z*TET1xliJcyy%dLp(mXvPFg@DuWNuoSp^i24xlcV15ZQk^*$1a;br7tDka$m5F&^) zq~Bg&vm;X>KoA}w06F}Eky|MQpx+I}SEs$&JUC~)us`nqY0DLtFXdlM029n17PKIM z0tT?6bPDV#V9+YNUI=@qpc*WM#51iG+fuqyB4GkWOciK9fg&71X21dKS6S%nXQgx2 zG{5Ww)L3ZG#DH04sve?|gF%8i?nZzF3~-_G=#SgTftOj>o+@aQJ;ot&ZBj23gbaSZ zD(P+LuaAx>hQCwDp_U8K=i%+8f99C(;#su#mOtI`AbAZE7{EK#F)R{=5)16`_Zeri z;j6a2?JArd93w5V4n#m94P+HIC!QyZpa57@{h44+!oppN9-LGl0IJmb!Cf0CGp#cR zQw}v8K1~w@GYI?#mHVUov*rCUU;wJj=D?p(p|wpeWPr(s{54ElHN2T>0AU6NCk(|< zkQ}t2eMqC^sDwe1uKk&!Zj!PqrT@M;CO!u6Q;Prqu<$|a7R;m+sg{Sy9=Rxx0(&Dk zYVMQRVuGo>7Wkw9FOo;?^uHg_ghmbt_%6!gPk!b-Di;PlXI6jFA zrj*dnB@50E*WvvXCa(@ro<%~c0Fpp(XoYF zqM`cHC$}Y9Y&;u@@`ebh8-xts;DJ}*L=itX$=Rd_d3T33H})yitFRG7u85}f z5{2PK9=s91<*3ns95Xb)yLXJGI?kTg$GkL3H&CM>0+wjc`+i?V4H@p2ZkVI}vPJ0l z=8z%}bQM5g09s^6&Qm?h4ep#xRzUV?|pMTV7ZY1FXIe(ny zBo4T}hyb?LY^6l|p0p`@cY|9U2+tb4`%4Bit~LxA`7#*Y9Y`Ra^xBrx)>G8B?vmNF zueWlitN4EyAC)m-uOAxY zY0;b!3Y#6mkM@%JL3)y=>o@>^JkrWt4`Q-9=5r6V3NNnz_HU)zO}haW!`PdE3?%w)3i_yVG1~L_av$$k`AKA@yiEHT?Q3dcSCjKb26hk;!z7?ZKt`^`)~sa1Mj1EW?)O`hz!YX3>rghoFY$s7 z+G*Ui-MvO#o14NQu;h;^FtB?m2usfS za74}BeOmuYM-|j%4-gMufrvBX^1@7<{FGf>`}|i7v;XI|CCC39!=;)V|4Ii)zB3xH zO3~|Zf7%NaY!lI_kqSl`?i-x0f)->dhh>)a~0X?>o!Vs^<`m)4xGHsW|Hlz zjHmlA?k>kKD;@4P0yN#DQo}3_tsC^B?TWmlvKY}FSNr^LrcKOpD(WBEsRq1lT{X?k z?`>^welL)+sl}Bp4MyOGI{T9y!EIVnSrk*ITQ)YHc3l`!O(p!e)f?+ZJ^UQ(fEr6i zfR%&d0^`xgIewIqxShHsLvnmB!b6F|NwHRc`mR(P?6K)VF0{B)UU24iXZa{Xftt(L zQ9T2kPEAM&nJL$0BC2`_A7I8DRV#`$sjP9qB$j_WxGRNnVr=Fm0-A;tTcM+pN%2r? zoS&eWuGkgH9sa=uz#w~G z6`3(eL?_y})2L73mAzkQ%#|p{&;Rhz%Am<|qw6z^cszb6o-cf1;sRcH=6f4NTz6_X zgv}Y}XwmD~L?z*~TuYx{|5fVe1FGf|HAHJ8_!#c5eXYP9b`4UKF<6tZnUDU-YoUGq zG-s>AG6*ke?vQK_26xSt>ww7GnmJf*^k=aA(5f-i8v`C+D(c@b!@8=S-H_HpZ}wH3 zx<&3E0RD+o`Xb{5D>cOFj&!Fs1c^*$4ebWOjQ|63OGn6T*g2EP#Q{3wc_ny_(=EOp zmy%_IQt3rxkhv}bgySiqn3&#|A>XU>Yo7&#W6s0E=Lw^eP~=XfnO)(SoectU6VTqS zbq8W}=)}JQu)V!d<+S9&>?6WX|%v?~(G9^Q)Bgj4@P_`dyMstVv%Lg>huL6g*RVQGn_* zyvc$b2+OTvrFiX!J{=PcM($sZ4D!t3gXqSN&eu9H^(la>8uUt`O1KJ<-=lrbYp7FU zow6e~tfeyQ&1cAMHUE0LbAoyJ+P-(0J(!tQE7zguSwdgz#3Z9>(ZnCNX~{*`9(<7b zGmCkvJFNO>?Kd$TiT=O9l}#PS-yR+x(> zT4P*^t6(Fw_zov`ocgcOLj}TVC!}&dLj9Q#?=|eTyWEK%ABO zGa_0}{Dc#+&p{Sbz)|;gA;Vb%$m?s%h)2s{*Nc)i*4h_WK2M z^5+J-gf+f!(%g+Uzma|w=jqnBLVE(Cs+Y{qa=iL#+cP8pgeRqS(EWZE0r2vH0!0-( zEEk`wK7My~PQ^WXZ;U#@{MA1!h0t>VA>^V zI`3lI-39`sAomX%{2pta_y$~4(R0x0FpKG~XGcFS`Wv?Wi=&)`_rixzLO|;ByMan{edKGP z)WabW^QfJCu^w*l-*7qQON^XGuu(|OX6QESMk>*rmh$dFD3~kJW~sKSHqFDdeBeUUn0`=(LSL;B`~GhZMPkK1j38qD+)^x>$OHur0Cz zPM+JWo`xmLCRAuEhfh;@pX^Rg!N9P$XMBn`31fyh@Q#LU_!Pf>rG@zUJ;jjd%RTJk zFtYK-)tl5TbXydF^sa|Z_o2Pb3nK< zd@YBmBg7x;{5HB5>WB^valkJGV+t-%%mZw;AZjvNaBJ6->d5KLVCYyYn3`rWogkH2 zjD)`i{9CTp9nF_l1{g*Gsx<-PjSn|&maDvM(kT_Uo6*AMn~6j^eu-eL>?D1uRPF9i zSUg3xuQ;}o?ru#Vd!SsRC>xTPg4V?%#(ci3*}{xrQPn3?LBavf(wf|cDN0D3fuQ>{ zE9j#k0wvy2nAcC4hb+6%DqNWld)He%Qu&k{{}uoL2w4BuR|YfJKUmiP_zExm|9f(7 z^!Fq%W4V%ws9?N*M>qH8g>l%+F^_WKqb8Fp5K2Al+{8(o52!bSiOeNPD7%k*yl&0; zxc2NCiH`!uaAv~`_{aXo4oWy;n>({W`7ssQ=ase{%SfHcImDb#vV+ zYa`NF4!LIS!`gJ%Y;L0@7Vq=J+-lsa`o0N?=(e&nb@7Q=vRwpj!m#3=Gf{RGK{b6c zzm^tJhY-!Sn7Va|uh|uPQ3T=l$1|MA>@LoAVh~$0J96CBPD|~(*srV1J$n0Sr@xI*jc*;F?(b`upjss z4Z*``dUwuM;?Jg8nJyGJ3?$hC5s42o9bVU4Xn;Hu3SV z%JE)22A_>pfc0iVqK|HhZC46b`My0P<57YYTiyl0bpz!|we2NhrxpQFNWDc%ZhDq7 zBcVxckx>AwXka#5j(@7_3xd5ZBz9(th{uc7Yo^;bE?mEn4=y;8QNZjNjKK83Z4l*7 zthM3C6XnOxctj>9Sg|;n5fb88#i!$PCCpLi$A!w$#oMmrfUhz43cqY|TnI|3wuS%2 zm%zE?x2DaWSM%OTmqkg!R9o$ZS`6l#%|Q{+#Eg_hurK*&HnsqIT^dRBKwaGT!xSoD z7d{q6+wqqB^f*nz9zaB*Udodf0X_i*+?FsRf_1u*LuS4?>M_jVFovB@noM!Jq3J?} z1ri;>a@KBPY0QR$WSph!bj&r;oB@eew(nOcOBqDY9UC-*fWKSoS6d{Tp}v1!^iXA= zF+SxmhuIpLVro_Ky1PU+vAkmwac!T*5*38?EyNh;ZpjoUaetBSUVZZo3f;#A`&Q5I zLJbaIYTe-pV(YEphKrdMOH81bDu@fp7tTT)D}1`894DOcy|!4+O%xnqN)YT023OF% z4q*83*fPIoxc#}_X^nnW;M9Nd+PHe3cNj+K@6{V zJ@3-pedWM|kfjG0)D_zs7zD~fCyx|w;GZ#tZ5w@y@v<%A_d!u>c&Rh>xFd4dV6w^L z5EMWeO#S^0#2(;pBuqbu=$95$a5-XGf3Z(Jo&8K>TR z>YZhqZ}G|IA=AVw17|4I&oXJ8CK2!ZTED9{iUO52R*9R0Nf&*I8xsYIi$-nXSi>e+ zC}w$_JN@R7`ql>#bAcmj2m(c&dHAOM76#Yb?tHEws`_PVo$c8l!)_5#?pA1-`BWtR zp5(^hOPlpxRvOAdaf!|*n0gtF#3k6yH0+^L7%Q#Ha$(@O)j}sNZ{1*yl}C3ayo0id zn5)n_y}TX(659ot6F^`h(CwO*$4R|A3zQe$?gu{IbxfUX4Y4k;!Wf)$1UYGHz$2S8 zhAFtiNmFHSoq^8gPvDwz3xCs0y?d2v{$m=MLv9@VKpz~@tTk%6<1!_{Dr?2Q7yp7B zv(x)y4imFXCkN?h%fQ3sUf#!R!tp zF}2SsYihu`##CnnXBow{e?_gIl}5Z?P*UXm9LSw}nKNT9`yz}V#%+mlL(NRFsY%8^ z8uuX%3D?K=!eJ~)$`wecrA2*iUuM!N9N3f0zy@zj_4lKr!d}t3ZBv@#3 z`^=&YO%c=y6b)_qf#p|d8MaOSbqlgqyHCb(b@9b zN$+fOWtDbAAX=SzQx`7L?Xe59dyle9pTLh=Q*Z<>W#s@h7Vb+JFj*S9L+X zVq2J7ndvq&&%1aKuV%w<+_|NL;!8Lc*KW$X z)!k&A#ATon3+i}&7c91m+TO7)V6@107lAVfMNh-bv<6rsbbBEOonT-NO;y0z%fd?s z5$)di9N&=58zxa9#SgA$%SRjwA*UNc=mh7>O37027qd+5C zpmI2`Rk!G`(dE9;VyUCNCML4^ks7&YIQx-UqtjL(;+uG74_wR~&}b2gZDUw!BT~$E z3q4Gjrm}GRMBcs6z&ZRV*~1p)ploG9rN`v|9*ZVL|4qTzn3$ z*4#8{_FJj6aj}d<(3N(1 z2doYdG5>PgNh0XTI_;W`OB(tP8(D@7Z8`||8jWM<#21BQAxQTVA`uOAH?rHU{`CpDTQKZWyw;{urkk`QZVZ`f z=`);A424+_!zhkIay4nh`^}45pK9QEktP|ZYf}4;#{H=TOD&9E`j9ZVa8ir9!Tpbm zNotEAmBF_6NkZ@q7yH2xLr$Yy7`A{(koEKiB?DK*I7J03|BUU;Xhebf*a>+66JJSF zW~W3zqmC@Iv-@uGfQ0=c2N7?1<{5x;PHzpjI|V2VW>X_?nNPEw(LE?!?W4646eI5@xj zF?|(2Ckk{Pe$jkY!MT?<%=cQ9Sf5$#5hEDFZOHP;^%wt{R#F!OOA!C!uR0~poXQ0o z=gi|GcQy%Hv<;f!^n*>}Sm0!{lkmnI83ki83zo zBH}Fk<4dz@xM*Axb?48uVCITm&|W27IYbD%oauhG>dvuIg*xvUDAN5KbeY$ISV-BG zRaGU?iUmSY6PL%M0uh>W7o9UC!ea&wv)_=#p$!x3>Pho&a9(#ikcX`b+~ezwWG(rL z#0${8_-1r-$4<>gDww*2g61c{1-1~e7ik2h{2EKdeth$!GL}?yDK7kp;S#~{334fu zq)ekzqq2M7+=l^;H)*6fS#GZ*kn^fs?X7InOcBARPKcObRG-Oif~_irK<-!X7gMz5 zra!0xssZb14t$mH>8)3#_-=byLm?wYg1UeR9?GE)7+45! ze$~W_4BR(_k4&_$=ovQOgkliZf|SFTPR3hsVZlUZ=JklQXNAvv0ufcmQ~zacfqHC1 z4aQ+@e?J1-e9zL~z0R+qoo)#gXdFlC@Ce+0!Y{Zv2^k@7yz6d{4KL2c5<;N^_Ebke zGlnACYIYP43XRxZyS`11^phT_WTt0xGpz0f{$+b2PWE@axY#_#Wj&hDCwIHY&V&UY z3!d!UFNeXOj`8*2I!J#6b{oO_>zoMQd09t!Gr5HC&)39~P*;Hfn!$up+Js14hWV20 zKx-uQU!sbQ;##ofd-utJ<~G$&kuTc0zB!MWNwU)4p}`EoZ?|Am9xe*koU1yAiD?yzW;HrvJ78wDwNIk?0r@$Sx5uRsHC9rK-;uX?#DNsmDrA$Wo%Z3BNs=R;vt^)~^Ogbq1%#Owdn3=GR)s{)%_l>t zcZK(kkPV%o6Lcpru4TA8tn?+*t7S%=A)n)X1GW-TnX@_Nc0{UJ2VA5DIPIV7oW8}d z6x?4D-uQQMh8a6>pib?vsrE31i$P?=S&wW#-uCbn`B$rs$y5WMHkoe9m54UJ7cE_) zg3eypc?$iyGOADPN`q`JbMG|K&?<&?Rb#L5d01S$ke!sM7j;V`$bYU6izx!j zlhc9}K)D+q+5huC@gED4%)kDvP5zHlg<6dXr~gAT`k-x1F{eXQ0I|`y zlAV`Qx82W8zMDlcaTZR5k$Ow~bJG{hLOrL<_iRCYyT8A`%a6cd;gmglc*E+o|MO>} zX@|dzjaihHK50U&e?Eq)5M>BniCc~#eQfFS-qLucN8gYC!@=|UA;yqePP0Fhgl0i8 zmCTqzt7fLId%+}fYzCT~gmo-fLzl-@UXvo3<<0B)W)PsmVnaEy@x6d{QAB%v^`@iv z1_Cn-J{EFI#WoRFXdsS4K{gCLoPsRRrl4;;m@jr#2+K}N5zGuxj16l}U3DD+iT#Z9 z*-U_UHLh}*CU2KD$ttA`b+R1>lN>uWkxo1YS4GVOJcd;EhAas;0zxq!F+G0=04j|% zfGNmHjqu2Im%H--OPh8Wf3(e0rY;;Nn}cfV5XF=%?$8Li!d5;<{b~Kcf2u0pDoMF}hc?INeS3XA4-m+!(|9YY&bEHNhmxg^ zVA}UJkd~`B{9t++HMdhPN&zwhuD+x?aTLYkA_Whv^1wZT7GgW9Cy!9NWY3}OWkRFk ztlHy*NyG7JqMqKsW)4w)#vw(`NtYJpk|7h(D`955u8n?1reqOQuG+z{w1hH$FOBuJ znbM(5JotQ@A$x$IW_<*H2N!m(Xs(SM+To;NW0&o zfK)y&TBKE+$b3`emA;eWH)?jJ`!y?mrkk>LA~$C}yEe}--Z|D$RM+nUIUX%@u7>1$ zbx$LCZ`IbM&Sr>_zQg;z{7 zb~ve@r!&?r*aizsvGXPq=d^ffQ4|b7O9K3a@1+M@pL!eYPO9|>PtfRga7jZtHk$E? zy3kVAa0M?OlS1QEf(m{G&E@S0-b9nP%)N#`W?4x-R z>@FD?Ts?OniQeDjb<0@<7_>ND<4aYf=OR5!hY^@0|X8c(cDRw4ip}KJ7htHlRrRw7YF?@5d z&n`!b%kHGdAl95oz3CSI&4c~|17(9*yuP$2kS`foe~ai2!e?!pBDRc(9ZlG`0iSN; zoDCk4wcBY($+&9zW)%QCu*-T>LK+u zPlVcglP8?Y~wQ z#uGD+hxwO7k}!(peCsi(?3DYWZYhImd)v!7oc9CW^<4%-B;HF8LttMu)m<{Bb#4Uf ziZA7v+1)RzhEqI45fr2Coqq@j8-?MbIe;!?twXIkmy((Hmdu1d~{e3B_35N+3|@OhiRZl3J9mM48)I4S_M$UenM z-xKR*dMWHi(OU8Po{(c4kiD&%fm6pg3&T)zu{%pd+J}ov3G(%7x=pWqx%t)!PeFJ- zmd8+2<_jAn%)U@0+5}>j!>bka07nH6;9lELJV1t&3vbZoiPfJ7UZZ&lNi_y1LL#__*@$Pa1B{U6C$*Z)s)7KtWR2?cTpnvL;Ka+WQ!A%>70 zo6V559@qq1^3xsfH2=!V+5rF9IFac|Le8I5bhw!!4AT}FmUO32eyFTlFDRy45lGXa z2%-{bz?DMA;E-^bUjs&6H%ulug$jj}GP5R%AzP>41I=jkTf6z{} zt1xa?ysv;FfjwMerl?16V$`CcJt|vQvzO@mTx*C={uU7ionpk$z*v1ypjGjvDLAMT ztstzO4%G15uvkcq96AN%ud2rE?*UR%|8x-3N`_RyLuuA+)|Ys!A#n!koQySc_j0s! zAZj^^gaY}d?AwNAN9+OFBpHvt$L~IXt6)vmtvTc0B1?6+3RDIh1GmT@^^hM;&% zIwv<+j|~c$Ig-vgfB@|n=a)TQ=un}g# zPQH19NxFnN!KzODf_cC7wdI7WA(e$WEK^xLZw**{aq8+hMa+7j7WDl;_-e$(LTQg* zZnnF!czsp_F{9sfJ#L9)8GZO9d-(VJb-_mbyaH@Z_RfJHFpCrry9L2=1q62<-<%ws zxjJAq4BtP`#4@^bd^=%(GQHkrKCt<9dUEB;6b#%rdOmj5#C$(Z-i@9O9eX-6eKpmx zzOU2QvNtY9qT~0*W6?x&GP;8bFUZAt>Rop!VSSfqtg9i$91e%0+=V2+Y351@T&CJV zIdmU}EG2k)EmnZj;@p9-aNK$!prq81aiQi74fapfERZCVNLf6wGPI0Hc}_oq6I+q% zM}?TVVk5Gik(3mOieib2Y~Nd!GL*m}0;#^|>IvaN`L1lim@wn=){T=4rna=v@T(9# zZr3-aGdP>C@710>x~pP$tL-q<45PUgnCj7@Y-7a5`CrZ0p~wm)Pjw&yxt28N``~yc zk06Y3b&AZ?#?22K*BH{};!YaRR@(3wm?Rj$bFu9iOJ96;{-&H2zxe>$YE+jkoGf_D zV*)PS4^6y0f8Of^etdX-tXX_JHM=wEJ5nF5-VYwj&yuS*34M%yX)04hZn1l0salJ3TwkKt-)O z!w|FpZ06QiExfTUO`|jRx+n~>RStf=*xS}S1^K^tiITyqGj{_)AS8p(9 zeT!BM2W!|1$f*tZa~Sm%!&x?9NRVOx4mh$Q=m1l!4DWc?-|pTnkEeO3i4AiPZ!k{u zUWc7?#`HKe1eC26KgV-L`fEKbxx0c@LO)-(gYv+NfML&WpP-LowItra7+B_L} za#dHvY6?WIu3w$)MFNpqX!q~O)?dO}n_c8=k$T>{|A4t!bsHU8J{;aJFHfIiPxo6_ zpD6UJpF>|48*hkyr4Hkc-p*#*Z_W3fX4vMZIx`&21l-&dNUk4D!%D7L5+TQ>F^Z== zCWc=-e^QYfyxT<=4oH`$*LCZUHNP}eLygD$N2164ImBG0YvI`*3Nb^fw@ zTe$z4dP)DKArJ_}fm%;8DW!=V#1!F%Qg{i-}kwM%?qZO3Utg^>^`a(`DNw01_(9&%vO|DNc!uiihmxsbqgox@F%5654&R z6ryC&02CM{IE6?k1P`yZU=b>cX!oao6C^MEEJ8%JIdZg#zD*n#*yHcT?03RtR~$w! z%8BmOWV#KTT)LNb>YCsSrro&$V2}=9wacjXU%qRLBl}sk{#i`Qyf+&~7sHt?WzI+q zD%RmKya7RoO7%smy`4`3x*K@CT(fD>b*EneTfO{*a@tuNRks7#M!K2HmWzcG=*g4e z`MKC}CgptWS0V{JkG@S0H{o4`TL6)nZhCi9eSVC@u)a98HO$&dibszV`FBBUZnqPj z_hEsRSoWQVF}lOAa?8t}%n$$P4Zq;xA8p<@ zaHc=FqCv@SrdOdb>G+!-JEfck7*o6UG^S9;ee>70^}YscRhG|{l61)dfU$^%7GTB_ z=2);t@fe`>W;Y%Z(Az$irDV@DpZvRc5nVs75X&ai_qUC*C(_V6s66i>fL(MmmrH2A zZRMu>&Bk$eXS18j6!n&{5C~+#4*NI*e1AuAmB;EdSPYp z^OOa90<6C+ltxo27#n>ofI!lLF^*-Ic{Looo^_GjaEwR$es$1`;A&vfmgZWC-}9bJ z%iNNNg--^k{@z7%;!rov*vW`1ahNTyOiZrCNUseFVQ| z^g}fiWJbwdVrG=N@RDU3!Zl|u8`Z^w>>W!3N+P6Mq!VVEO-t1jRC#zRrhX@~%Ki31 znULAW&jdOu@DdOLEtOD^{%#jD%{G--`5<}V;HR#f7Hq15^cOSbDChPgFQ4GGLlm#2$Q^sf;C{->hvYel8x@GLOnaOWeDQph3G+Gbdns=;ZS(IR;=j4^LLe@+OU)X3T*q;!E#|3JSxx0 zHOB>MHeFxC!bD_Y+(oF>=-~D1E}5isL6`!dAA=8d8af~($^lJ2!uk)u zV0p{Ty0Um)(OxU{Vp8V9~>#gE#{_#^mhQ;5*pc46GB&!C4 zDL$a#Ut;>X|Hx^gl!<>tl87kOTuiZSzw)c288KJYCOCtQP)`7&Gs_*(7umcUg1gHvJLaD` zYf5Z{)}yiZ+_lYrunODkh<=Z+`~O-LvahfQTNsd2*sw2BLuccN7qX+$c{nvt{MU6o zt|y?W`zRD_qc<=;yCGC83*h<)?%CLQcEbwLHtWc;wt*A@#wFuxHr>H|x;`5`j=p-o_o5CIIY2i(>F!QT|`917=PxrvG)a8>=akya_<=zR;MYcd>#B zCW1mqO+NHMFCXWZyhuKhHk6!%o4|AGAF-mWJZ$N}h3^*MOtq@UFenCoJh*@iyOHPV z_WlX`xZ66&z9Dq!oY2H6y}Q0^jb36vrj9Pz=ELaN2?{Tq{%EZ1fi-3bZdtKbJ03>% z^Zz_~L5$S7JnCSYr$b2se7ijIo&{0v%RZoK;!ijppiQw5#KQe+Z)89rKbp%Vuj_2m zA!Ly%!NHG6DN58t*G`a|Yo)}5Z&=J=ZEWaslt_}KnI&VDJ*{kT;B!ZXQ#PU zA6?6`4h^+#U)w{)gk~K#pr1W6{^%2E&ry3HaOCyL>fyO9v1VH)v^Z&{nvc!9AsV3iVt*q~|Wi+*g zedph_aJe3mvi>N1qNE3`dYZH1#ct-;+M5P=Tya2!%l~wOz-pW!He6=de9_ zN%vo+|05PfZWYzLoHZU9v>n49(XV_){zf|{8Kyrw!skv9gqqZ`80dudjC#^9L?|HF zf?g^tlP096N$jmU8c9rA)|7D=oqkU)JL=LxWNcF$;r;odZ1Z3WmhzO_5=G%2r_1T@ zWT}PuoVkf<)t7>z|E@sB+nT{IzyrCTUT8Q>=I6PPA_*K0gD#hF9sx=mUOWMfJB?Q0 z&V51^urGdCA{$NJ%5W?$K|mL~0%&97Yah{F?DQh8kt(}J`amHtN*i((8`uRN{HK@x zdnOp2e_AtLv?jKHg}7+P>Ec$?bITXU&)y$X@(c&z{(0??&vT0w&~N45>>0T|`3q%uWP8#7O#Jon*<_>M zUf8^anlwZvmB|<`RqU}lj~XQpoKjn)Kvfe8HMZ4y!u)q3)V*5vMdjo!PBR8mW!4Pf z!cuQpVgqoj_{J`+R=CXTAs9^rPv_XC?$!eyPtUw@{Lquv%gCRAI{GB+t5THdz9j@} z)gE=2GoVNtgGH@d(06N6)i=L5l#s$G^qY1#wRL*vFY7x3i^u zFEj>*Pi*{2CqJDTyr#cR<8HFtyMkj^P%(7K0JsHGnA!NH0n2eZm~eU++=DC#5mXq} z+yp)2a|>{UnsG7awlT#;Ku6MUG6u&m#>?F}CxO$yCyEv^63msNwzd;dFS&i&Tw&dM zwVMeCpI%m%A|D93eElk9+0s5hL#)+Ol(;o~5U$-p1Ai zwcz386K!tm-*8+xA8_=+)(b-Jx?V01uAGI0?d(%5IxN{Y~QtWJCe0qMZ@H@uJCdP6k3i zqsw1Yiz=_8ZmJPx*@P^DEkiMS|r9oO4e2bP9aVhB%06g^r)C(4oQ2xK+5#Yp(6 zgZ+R-#fchIM3&6M|Phn)>uzt|n3@7YD1kzIr&DObF4o*~5_~sl}rKbtJki)9e z5yiQGfe>aqShCKWkbHNnbGl4UZ^~vK1p0iD>+7PVv?Q(22J9M!pM8G__JvJV;A5p~l%)$IjK#VW4tjN9v@>AjVnxNk#6d7s2Y3RlVH;Zc0LL9BS3+Vi5_4Dz0piI@a zU;2;CW@cjh|4f`^P3_EGEQpxdIsfP9ck{o@-r#`izWFn&#M5N-nk3qsJpH#RTb9Rm zouZqZYZk-SxhR};tYhu_J%~~3w{@<|dLCUM(JSyPknr#vL;u_b?WMo}Z{04B)O*Q- zoI|?bwxnrd)KkcNVt;9hU+%;Syj^pdCXKf`b_{R8o7XQ*i$8?ya|E|0&Z!``IIg?4 z_}75n*Z;VVNN?%*>wMkst8st}Iz%~)7loifIqxZ^h~J&txjwx`0Xg6$Mlc1o5-CM- zjaw4fo>#vRI;!^XGa`$_;d#_ov1f>e?%ryO-PC=%$j{6?0z49f=y9fHmGS)VkeVvF z#YB54Qc$j45Mf{E@l3^FUSS5I+d|?|LSUVscPyd{if%KtgwsgrVu-76fsH$n3<5>d zAaliDltmpleivqNmFCELf-p-;r36;RV{*j<4`HLw{iNYBhjC6FGiTsq*-SZ!V(ykl z7=qG`%ut4dv`NYXV~MTxNXyl;1wZwaiW6m-@8V89%pvL0kT^t_E?m;7BFPaSTi)fX zD%L;gfUjkZMPs`}y^(wo9o{}FkbsxXgUd((rxc2%CjT~@AU)d7*y+8?U#Tx2ODA)R7qUF- ze2zErRfwNEQOMTs$hTUih2wI{!Z;+~MWwx5WTlQ)jVH7o@3}5D+1{iaFk;oM3FxbW zoTGv=WbBZ@48%6j|7cvVbfvt)6N_q9L2^4N%50?)ZFIj6zJ#D`FeC{@M1?vBsHP^b zwPuHxJ*^v4 zT%?S9y@t;!?F#p#^3L+D8F41Ngc#n$ zfPq=txBgiV#|2dg81)C0`{hzK9~LIQ95>8t`&f|Xkp2!@ChJ;-y=Dz+-d%J^Ib(O0 zxwEWz+K#BNB;-gJ`=q2Hf>I?y5DrK?__cagBDBF_DeYLO_Ws%9giSJwX0si$kf8~; zu8UwcN0~nCw6#r335!2M*W%X<4Ol$pTxH93N6%6gt;}#sJ(N+tI9{cUZo!aEJE%R{ zd(%eCLK;yVav`|v!^na!eH8j#Ju5A|=yN2Dx9fLe$x*p^yYv=pZFV|@8l&z-qxE1G z=fi~|<=|z8%});X5(`1h)(AG(Cg9-uVs~`e<@a%LHREpoxnbY4v#sUJTEWU=R==na z(gWZrH?gB@3oC(-XGF~qhfQN8kZ<7mGypkFYThW8Igo=mNW04U<}$%R#j|fN{p;@8 z@kCQ~5x_ajIboP};4DyIiPvu&KrD(NS(mIcOJ^s`4KsO(#4L>gK_jme_3*~)>i);( zS`&|E_0W-yyTeJ{430|CHZB#f|3gzOcl!#GGTY^shchWu^xc$jV1rg5c{JboBjhNc zwjl9w$EmqZ`{Ob$c}CZj>5mX%uD&Z%wQ`6`M&qtE>%$MKVvxD?t=Pja8f0ID{|cc0 zHo9>9&tkLG{}Vv1$p423OO-AM0o12Kj_GafZmm)&t;U-@VTXVgnTVwlBCJe0^Zo8p zj7wIy7n8gX3||1uhNIs@Ql*_=z5nv#^?K21@}f; zA!2^FY4rlwv3tG&(Dh$Bw!n={tUL9s-WqWfS(~?3njJic%-3>gfb2FmF ze)mB|ANBRecg2sLZLCFv{P3*%%JT8ykAVN1hLG zdEs0#_TZWWFyY_bF9HMqWC%IWWt+{V`y0@y@-zrn%*Xnq>Z(D3%)BJ|IOT#*e@|Mn zXdq*uZv#zRb`nkeclWiAcRkSaHBWGl?^l8Y{#}45kWcD(q!nRh>5wFQ+WNLU;RzQB z0tA`WRj-VM)t|2#Wbq&Ms)9DC>IF&kKVM!)y-zvZMqYteVAcAFm zViWQ+rk7ad@G@RFS1*S67$yN--g-Lb-_Gp5R}PT6jC)(v$o@&_-X73PFdWtMYHN|d3`??aJwO)YbbHPr}XKF?&l2Z+LL4Z4bvU1={y_HBm5hfqK$ zsVZ1XK1}m`&Bs2OST;@P723fHmLp?bV9&NY%*CcT>YdX-C^qIFOfZUzNDb4Xd-&ZE z$t?N7VLsR#AxIwz){m0SA&FO1MXEYfQrUh^R{sxU@6?`Y*fwd$wv&$Sj&0j^I>sH_ zwr$(CZKGq`cJlQ*^UXF3^DI1n;aaJq&Z}y#cp@NXY#sOxujY7mb&%UX(H_Ll$uJN;EC#ANRKH!HdCM*tw zX6z&P`k(oB?H8CPzc+REp}S>x`}Mrm!1#F6c`NHacTPA~-D_`YIf$@)-kg$C5siTF zzid3ri1CCZ&g7FAAr*mJ(gj!3T9BT62E?>CY-$|%pM5TcuZj~FFi zm#&RdcKbl=V1UrH$}GC_NDa;hc%};rK-YvtZwgR&bUa*LAumOBHO*CDH;q*#vM-yh z!Y=xZntAp6tm3i-a=YQ}rrs%lF-faR^l)+lXA15-b9al-^|T1Hussr`%@S!ysknBl z5uU>(TLxp7xYIfUlFVSEk*F-ja{F;K_F3m5AEVsAuY_rK%`S?~r$RgCCMY}L}~Y`N~JdTKnogWm5qtk{4ih`} zR$|0B$$Zs-14ZtmjV5C8Y?WjPTA?UzQBLef=XiC3&Z$APH)atVMT*Y^(js z(`E`!Y`OowLuw=?kkI}ulMWT70}qdGcZ=iFhFoVEe_-v=y#KoEv8uAjGtG(%$=^$%b+6 z=6O+?`x1T%=WIo)#|v;Lt*yn1>3d=`*DcKGjkJ=cQdlF2 z)-J8-bOoKBFD^M)c<448GdFLxdV!5^q^@WEs7@dKE(J0( zgNeaVz|QT_Mth9t<3X0z%)Tq?#~=!Aq^ySUJWjM#<~Qk*d)@H7b53{K2ijyAIrIrSS2YNF=OBZx+7}x?BlALLjhzrqtk zPF%j%Ti54Oyr0%rV|YySv`1c-2#9hp%0Ls3HPl7{FP&_wv$iOVQE0uytZ4o0rwp=4 zFMkjbF0CsI%J3f?Fne%J|5bR(HdglLY7Kbc6mRbM^mh`SEhdDlBh$DHq%`7y+-X!5*oy__~S;hzp0?fWMf-{Ie{m5%R`B zH%R!6V4n>4;;D#i?OWa@jXn{om$qnJS$ryXv1xu}lSTQ6y#(~*hI)F0NK2hxw~dbz zW_wAi&$%*68O+&v=>}m;y3@p7*ln7T{!*aYEa=Y*l)ocLmLLUW=U^q6k%0^^&es9v zVfdvvu~x55oM`SF5R^C|b=ZfXN!feh5F-b1=lvf3&0W$}vvX}VmE=?C?%_{U9{>&L zWtC?squeKyL{VAf0xV;d+QzcFr?f8u3)FuqfhT{DF(ln58*=^9M>E+`w7@sk|Lt4F z6@nhOsWTm$)_JTS-%>&usyhZd(BQ$2u2ET^pi4TLYB5b{w0Zo2yPr>ZU0%YOFO|mN z4V^P_fSq_^ed8Dx&nGJ2SVP9K-o|=)LINpIWLifH()C8(HT!fWYA?u~Hx@}?=E zJo>3R5cib#>NcFWdPzh%oKZd$WqW8{6t&kGvQATiEpe#jC0(90D@Ze%m)xiQ!^^e% z$#OpNjMdK+Co<>L6zX%t$Pd3P^NzWYCg)@iyt>dOpznW!O{90<_;i5ug{ z@1$t_&7BF;0tXO#gu`xW9u`l%05^twn?YFEHkji|?J}kge^#JKd5OVb`YLGHZf)HY+TB+kipd-+gd^*pRsi*H@hMRQ6JUsw_?;f2@4T>?L;Pju=k%{U5RYxX97MB0^pX#vYj_pAk zvd^r3evf-3tNJIMORiR)tNG44tirAhBBZA2pZtcy;yfF)HG>FYNoBO=`86ODfUMV8{W^0B{l>d$Ne{J zoz>J!$D#SSpYyGQZ(C|okb}3XZ>Ah>=UDFzygSZc^EVcUD$hsrh&`oux{InmCGic> z#G^JhnP!8kYf3x$UbiDr9B(T zogL+&6z6T7P0I?U(4KRNk!+X0e69-=By;P;FvcC$yu`k?MlViPda>4g- zYGb+M$+P7_bi@nUzNebFD#X3U;64W~9CWw`vEV>tX{q((!a4Pp!3h!eE}?%9&{%!1 zH#@2d{kQ3JjcCia-ckL&OY_dzan1YX!?UESg5lz4@7Su~v&t&_qS5+tX66fb!XH54 z4J_yqKnN^13ur;-JP;#88@~Dk(f$T^{h(TXV>8PjmNMs{OdCvBwVxocAT^svw_f;R zx$-p($dUCceig^n5%8Xb?JwG|Q@v&Ri!}5Tq6ls#X+~<@bJv?Ps(i3>@cUOGJQzIy zmL9th6O3xt&>a7kAz)_MpGmeF5{D3d=|kb!x!sBfuso#^uAQO{f8FzLU?|&PBy-T@ zs9|%1ibmR|apVyb48(3$AS)Mp8qCK8frDyM3|X{};HP5=dN#T}1UFZuv_mhoj74g0Y@kqzGLaA7 z2f2!E!oK4?#w`az43r26&Qap=fDx@N^PDkY%v&T!8g)k1{^;?_LVm_}VnLoTGL9Ee zb^h`Jb1|sD;E9m6F8-^7G_{)8m*Cz{LynpGBLmFcSohLKKf&W2<)ab*eiKFcG{sqa z;fsogK16>H&Xq8GD$xrVkPs)dp>=c^t}rQzxz0jbz9Le5Ath8o;h&v(geMdDTLp#) zgw!&?KtfDtckL(?(56zCKgLcWVB7OX>Hu!3YktNtE)yukpjgC7ND^Nh0e{J%uU#Op zL)di`^+cO%fR6yvt$O|X*Dga@( zW`xAMZ*RY8nD}M)fLMVb__YKw+ytr$k<#SSa5$i%prQf%3!P1Aet7~MfNA=8pzZZ_ zVCm%-u6Bk*>8=-dc+mf1H7>$I?tYiS7ei`QvL+&EqO?F^(k(y;W0_h3tHU;TYe#8h zwe#kfkAhfay5e&U;qV=}tL49V-NytB?)Gq{e%>*J-wwvHMarRX$$YhgrZf zsha{d4XdHcBo{iXuMO>wU3LYbK=;;A_^9a0`jS@l*m`e>UD8d~u&ELWK$9VX*C4O{ zw7k@02h|r^6yY}`E?%+#$sVLSkpU?U$0ZjMy@SbuGske`n3m_R*q>qixNjHe!ojaY z3(k`XBga_W`c>i&0YtAf3C5LN%P}ZWtrB#|6|X~>&J~0hm6y2-F;x}AK6Q-$albE1IELup@%O6pK2Eq6S!F-Bh zrtM$5K1h+>#64Jkw8eQDHLt@g-F^zL;$@xZDi2-JLbZod`W49cG>>YDCQUP- z*WNM!Vedz6omU4h7vS=agEOWgu(i_AsQllRdmf&W3*Y(H^hdiVtMQuF(utfR489o4 zHEm+e2~+K&I)TL*&>9eQ;2m_k*SdXVigGu}ckgGk1{mHWQQ)^iAu&&@y?&no@j{c2 zSwPhq)xrhvQE4H(tTpVrZ9&DrZJ%RG(gV}z#LaFiafO&Nh@(>aM= zh=|t`OQx>)%)m>Mt9B3P2QyyMF zqpTMhuNgyN2otHu6#ryI{VkwUu^;ou5s)_@=^XrzQR1zoD*xrj$NYFvbez@`Gf zLBc@HD;CARQPy7|5E9gzoyAI>o0rsxH0z4<3&o#Ly6TilvF^{4XLh6neJJEE1I?@f zR5`K6-p+^8gh=H{J8LQ_@`50QUbTxAYPSH2hrotx8+dP#DAf5Hi|(^xO(YAGUe%OS zADXY|!sTwZUtaIblLY3tWL1ali=^_(3nG~l71>N*x{Ef~&jvr@IrqTd;RLnmsKz1z z=z=0QtnqlrVyYDvMZE61+FGs)r(bhp+rQ{7&Ymk48t!J?Hg}LYn5gzCKJkWWrA0W< zShQMY7x6n!I4rR5vPAd&GdHa!qr@L_Q<`!(cNUp=R`px8odlHhG!O{%>$=8rfmz(b zMkP6nmvIb46S9Bo;cwUwt_3bB>|CW-0%1x`8@6q`?S6!30Sk!UBS z2#Lw1Vx5L=T=`%g>5&#)8TkUsJtRQHLXz)-4RNy|+o`)=d=xz^sn=quK-2HrCmWK; zG{04B-j$Ow^uB3S*l4JL8waojvK$LQexaZ*Hb``98~UE2UFj}Mka8aI_;N)c69`v# z(>J$jE?*uoO}~BW%KzeHNk@e5f*;?+*D>~^%Iw*qRA;3WY6mhGUxcz~k~pNtGt@*x z(iUw}jZVlG5+-5Phv%(_T)YU8h(#%Sq{j`qwW->4Zkm58B8?ke@wrdBZe4ZYiPfZ@ zD9swu)QsUopqCV3^9>G&oL9x7G;>rTCv>p9SJVn*UEC87tysnf#(ws8tKwQ{A>t2IAWyzYgJ+#@0 z1I+aRb#+%>Z=okM)Dx?T^gy1=BRxU&J-yeqvWrM6quy;)wz9(#QxO#COm!Oe+R}x& zd`ilZ6ms`o^)%moDhhux0d4}0ia<3&CiXy*9g(F+g}$TVuSJ&M__buLTpRi^T7O|= zZ(klZa_M5Bl{p3Gh+X5VPVtK=da*&jhz%Oj5T!)2S8S-U9G&O&^J7@u@MPuFS>s-z)y|X1`KsmG~ zp`OwwuCMu$44=Nu5s*Z2TQ;f!!p$C&FEzwLU1(2k3|HFrh-eQhRCE> z8Ec1Z2Z|Hk;XsyOKxx>7=f2f#KF*6$^HW)!Z-~>hGg`(+gYJ-_`Mzzgz{_~gC{_3A zQhAAE*2RQz#{&Oa()>rU@Ug=)GvHT9V=$^@=zBKg^Y#jQdxmlL1}l{crv2oiqrX^Q zl{sODsgg)Yo023v+^RcQ5ltI~7ooqm0K<46j5knB^?p8yT`_W6s!~_h(H3-HiM8^qb$4iVpnCwlHRIoTVFh!c8z5&7?t(xu}n~ z`e6TlU?t)=S!fp2YHWfbUs!qlRs?D|-5*xrS#JoauTZ_~0BJ9ccvLf2+2LmU^7oe2Z8X56EZ;)Os?YR+Ml;a;v~!#qYxK zp@$x`Y~cthHDml+&ynTbmlD!pJBF)*4 z!2AJ?8}g<4PYT2QpDIJ_od2~aF4oYr-DE@Zd8wT{z`1Q871fnc&I8WK6P%xv)88lD zwQSb|*RrS_d~PxSUlN0$EticE(oe)mdh&WacfU)%+n>q&J@k5hep$Jyh*Ct0EQzIa z6_C~#MIlIvO0I&T0|6HuoX%eBRIUbZ?f{t8O`D9Ft9Ptgj{oqL_wJ; zo{FpKqOyzT{M-xAp_%DrbfoEuq1KhfrL<6U0SK;SC{NJHshzL{?8jt*neou=(3yj{ z6dyTaaGKC@DoN(-5b+6Kg5>br%&v7C&162?e9to$B4fKHDoom&BSrKmM%Sf-q-K=K z;lhiE#N&LUVPo}c8lN`Zv{H79vx3D#T1EXJt)`3(fmY_%e|n|PGkmJ{{^d z!UAt%woQS}xJVI0dV-dhC1MDYn?kW`KnL$aacqCj41pmmlNNc(?=_Fi4E!$OXqrE) z)5LI}H9}c%a~3#MRmtew=5J8+_xL4$s=U2pG1nccc}n`h?IO0!NGQ|v-4+b z5M3s?Z2^k|wk^w$HW<=rJK9bgXm*NAYPeEc_ql}3BeYzZ%9W@F_q>`)usSKUGMB+~ z8=bDASc#J<`YynX;%@(%2T8OUuY8)g#qP2tSv4n-5pl}u-X6v;4jt`4@ zNtc2n$5WZV`=GY33#B7kZ)eA4gvqe}Ysi$TLhu2@DeFKPBA_A)Z+W`*-S!13d zcN^9SjqiVwC*Rb=*eL7{A3DWb9UTU8NfEBq-4c)d=UL+tYVNb$K6wU$BW7lxxV?TH z`j?;bvS8Ss+&!yGcnhqXydQ?2W_Utl#9GkucbdsQwi|Y;Uu=) zp7OA|I64#ZB&2gG6`S{oAC43zt&$QzWWRdmLe`&5RI(Kt?y0p_v9IeW3KCZMqi-^n%(y4PuU$pe7ukH=-| zi{5C32alo~O3ViYDOzoQ7w3;e6u^9I49z>iL#%LoJxy!gZsRM&xtcPXuf9>P*ZiI& zgZHKgoNb2Ee+-?_*^f(a#U{1d;*zpG*VdLP9DlB%ClZ538*BUm!?!<^en&L!JdhPH z#UT#y#9#RV{ynpGi7i$S6_dWJL>Qn7wlgO52?+x%!X z0ZVUq`B;L7GFnwhkn?_he)+;|IE*QX1sNaoP7?5G_xuft*ir` zJLpCmIN7MbDNh8$4JT^4WVASv^M@-#h}idNGp6s`g-nPfZ}0ZYd+wXF}0k6Xmmf^&R z^EM>^$9s1NgDs4`qIk;~TP0Lfh>>Y3jch<^M~b z_&+&dPR{>&>S0;)f4jDSIbb@NI@34uWL`1=y8yjtCLIzBG|1YDDfr(7wShsSKlT#B1W z>0NTR8M4h|oqyik$g$*osWxh;PBLq%DxdE*GBFu+V@ei{N0l~P}tw_4=vt9l;5CzR1N`I$QGKvduIlJ9S8TiXm4!QjnK$H zOvFxB&}1OKQU8HLO~9)0oHiH!b{jGG0PkHddf09%Q;j&CdUX8Ko`}vd@L3!>xCS)*7U`tUmtodOfFI}&7TirReqa4>6n;jF?GP}iN zyI3H|VXBk>=ABKR_zHNHMb6;h7K5~$|N7W*8tGg10`KCt=wFn7NkzA)iLeadE7_GW zUlZc|_UUea{Q$WWM};srBsJ0`rlVLGGp_G(`${2~c6%kx7ZDKgb}G0K!AUUTuubmj zdfgJwZ$UMH)Ex;ZV&9D|n{+Y-CKi#xXaOyr3r_$xhKrYag>*Mg4zZh?31_gjjSoC% zu>~DfG!)dk+cm{;#2dG36<3P%jAU;Mru4yP4ElI!Q|UBFQ{!5&i2vbU3G|qA=2t<&eWVTuVQRQ zqO8_BNqB@w4W8$LszVH>1;{7r-KU*Cr-e!+qJNip=p2cL-PLdu^Xc73wJNe=GE>1p zPAM^TY%UAz(fR=~O6U6wbuMT;PXbF&9rjOXv{8KZaF9hyOi4XZT^)qyAGQzErvSf| zNgLF@z6XfPA;$S19{cPy$82n!)px^fuyI-KO&hh>o#%dw_n`2n-e0j?wYpbG^*ut# zq>0?YgIyYjdHfg@xX{D#$w+4NFA7Mu(As#FVdzgf0J)m5=mQ}a7|e#>1#5WA9w3Oo z(L*sd$klj5Y}d8*rT3NV7nP54zJOPE0Ronf5qQ?oasuGK;8GvduB{dCYUJ9&ypgyX z@gb<@pF}k!fz;+jshowbT>Xvf=fWss13Y%zQz?QgapqNk+{gTxp!6L0(ir#;5v7AY zoB<=m*GM$qI%F;nxQiws%FHkE=n-o#i+DYo0cgt4W<`rjDk#&Ugt=SDNbJT{)peWq?8X0{T z_op(vxi1?{A#BQR^xW&O?)M(^dw^ilhZ<6ca%B6H&eRVj#f=pv$bF9oB^V1Se0?l& zXQx0kxF08sgk+lPzZKxg{79o{{(O@2z+w?6=mZlpQPZUpv-dAMx39cpk(a-64`m>* zY1{g>voT*-I`RlM5*&Q;IV@Yvj-EeRRFIJhSa~d;dHt?hW-iwmq&?{bHQT z#_z;tJ5$|l=dNY`=8pUIvIT`7o=%G!-XFNXNV^dAcm@2NX%M=EBCk`7bkHIOlVelS z@bFX7p?N~{GsAdG?OBHv?+ zi@78G<2JjpTO#%^*g1cRLAH=H1_Fa}D*2x~Ohg18ue{W$T;AQQ%vENorDB4<$(@mn zBE7FRYb@_o-0ZPXs6Oo)?Gqe+|6|q8^@-zd0rZ+llQaK_g)7tUnGd3;E8cH=^hQ+u zAZEjY00lZC~>+8Y6b^V8u%j*?Ub$arU=Un;BKZ-5Fcq%PdCFZs7i0S$J8JIu;SDNwS zQ$T@1g8IP(>2(xG`ESQE@)vNXKsdPd@oo<4vX%!Ta6mrgMBbOoXcgEkWn&h&I)Kz?GRdsazm}AR~RhjRw zaJ2}Q=J@cC{EZDawX-~2da)xYFvejR&NE6jspNL8g90hsT>(<6l;J=N`fm&cLgk&is zE7PA!BmEMubZ(wlUMOHvT>yjv`e{b_QwPa%>P(29H1sDbIyP(KMDf+1nn4}*` ze7Si!qC{4xnM&f;$jsX3kEN#E$@dw#DTF*0{C@Bi=!34$l`U^gAqh;t)C^l z=f9*cW#_LF)GHd^Q+Y$iqgt7Nf={7TB&&5)19ScLE#ZdBb=YmxeR~fZMcL(i5<)Y; zA|o?`9JuBE|1CcX2e&)B&;`g?4GgC>kFYD*m4d)ARpLi={R_eqE7M=BVcVN>%mr3D z4T;@I_pf+ouIMIn(Fj&OO{f%iL0tjc*Mu!u;#)d5(p)qVSlVm801|JQQP~;T?E}FZ zgCnkou(;GEB7c9NfDp(zYH7rJybZwXWQgH2N&G#vCPB1MNZq&s+)*ZZz7-N&71y$ggAWhlfngF~g){6e@&br5|T38u< zFC1+xm5&isU(G~sEH2s1CA-HD-c52er2pYu*-KvZUq4ftv5S)g+uczMG)N2trQx3lN`VfpH8?`e^B{>^Mh(Ff@{H zhB$K}szehh5NYLF{51aBt~g8{M!d2Y&Z0dfKC~r=5}qJ4fo@nF|<;Ik`+%Y&m{~&oJ0g^9)&nelXbAX(v(AH%f}kW<#Fk< za+7JDgYozt?HvejyDTIn!)0fKxOW})h=0+O%%x!u!#JhZR>tV#Fmx>DV%~c}U|EuT zUlI(+AttTRIrSQsZpnx~qN?>mJZPf?WEHzB?81F5rs*RTm*?{IS0|g$J&WUuj9tn} zhRt31isNYv>}g01<>k=6W^}X5B6_-29fLSS_zvQ*o4uYPiZX4No!XTyLw1jED~!z) z1btXqc7}Fn4kBIe1szjJ@FEV57wUV}di3e|9{_DP)<_D~3=s7%^Fx7E7Xhoz5;};@ zmSH=Ae-mqCR>Cs9$E?E;IL&?%90J!Hc~+8mHVnCVO-yRPF^b zKL0^85*njq>rY!m;h~9uq1-bU@?yfXWH9q+ft-2Nw_aj=`Hu?C`Je1N<9|KUko|9} z>5v7<_eMW{G^@$#4|nb+Dinf05U~2467`{M*Omav?>BQ>!P{2m1N#Qa41CwJia)WV z2X|hdrd|FoyWrdE?EW7W?{dZZ{LgHxS!UEDv>7W!9%9QRM$ zs<|}Xp3SiVV>j{{W5UYMES56bl@TMNYfk`otoH>Lk+Y5ban)MbjEX>aCzPa(-&m#n ziP+SmE_OWCe61co=ikr26g+4BSz#r6<=EBA;Dq#@#~5{OJ_q0v*Wg9R8VK*6i4Al} zNssO=2_Of4LiwB$^#drOTyXia##&vuIbOe6@f#Y}eNbR<6O6YD!bRA0w=#r`>wQ6Z zE&MtD^eQ(WEcb#5op({ZGmjLOQ$MJ%A&UH-aM{P30Z&`K`&IB%2tz#^>QPqp#U7=R z4%x8V&I;*FS=rEA_hU8LFs`i|sOWpDq>$}S}dXq0KA-8=VUWw#d%D&#t;3Z4rKxCUm4usoI&RukZ#H(^+|FX+!#|* zAzH6^iHW4)Z|=m{f&Q(5mKU!5c(@i6~3_keEZwR8})% zXxnGxJJ9k2kz=*9QR?UONvNZ+q9m`kebH1Y!mIW({&}5 zI7PCag2(Jq zd9iIw)13ayI@uAfQqfo%7##e_=1nV;dI%9}ovl4=+mNGsU)-2A+Nvd`;_MNyj|nzG zdLMFlT+QPhT=cFEUc_#?scE zT{Ykx2crogK6^t}@%SPzjy!f=HZ6%lhj?12QI_ESA1CSuRQvqttC4&_m{7=Rm=0Sc zsM3k3gJeb>sRrnu=Mwy(X96=Z(6 zaX}=+G&hK&eDE_bAlpPSMj6-e&(@p)pBW--L- z3M(#1C^v~(0;wyG>df7b&K0xO*mVpb2sT07jWke>5@l>r0dg~BpmRY?`o3GW?%aNj z61tx(gx+p)TDe{gm53AI;MVE9ar;*94VqFxL$Pk_g#Er}vyRf9RXrz;T-ggXf^2f5 z4&d=Nu10FW!-QjZN8@r*z4ewP6e2F(h~W8S3UFe%)l85vk@hH1=)bUC6zq?-(adiR zp!F^^ZX7G%F6CBDUnTNFr>X86b`i3<2RS$l(Oto!(}%LW)WUCIQ{(hkG97u~YWK%) zDKlhVTz8jWNdfj&4t;;>rOv zn9=dT0(bwI|3g)aVGJIj7`F}8vXM7d*rG{}*~*3d3qoydfT0B z%2*}dp_67CsH1)YT8Wj}$h&z4-r6(n037U4MP&bznn{lUpUCV*EA-MM2mYS8=f#7t zJQsbz_n6!B^RrQY5oM(vA$C5HtB=Hx;*Wdz-d?`TpMoAN14x*e0g%+rH zvCShapj~=ZSP)b-DFcUjL+Q-MLCNO)VQwQwpuL5PUl6jGs0;T;@Wk@;k@R_gv+RB+ zdq?^OwKy0%&hc#03naC}6Ilv_F&zp+APCwn(~8@zBPPlhIC(J_^gpTjzxMP0^BB*> zz{&XEhQ5pce~{KqZQ23HnkW>~uJE{MO+^hysb5^o;;zgI?(BjM=ip#2F9`%c0LVPIZc>$X*pgA2{;Us zMVxq;7S+{={k&&WyiCi)6Y!KIslD%`5r`(__q269$*Q7Eu-s0xJrukVv8R&o)z^(Q zAwJ27^3e0)qDeS>RnSuJBn;FpdbAIO*b=eIY=nVdV{37?nHlCQnNVOcO0W8?Z86WG zD{I@mKsDdyZ?W)=9rA%D$aXO&Hj!k97CBKi+V)!H1saeLQp!j=?KOptqZ3f*zm29s zL?Yn)S+PJiRD~BL%y}y`Ve!r9jc&oh-)+!-)^cW&J5AuXSLe~PX-wSdn{blfm?Zr^ zR>wqG0n&QQG@vT&f8;Wtu*)lr1AK#wGcxO~o-tiU2OlRq<*})frc$m82V{jX_7NHt z$aGr5VbBK0)u?zh;$hi2Tf1c)=|FFFhqjO287C#m98*N$xe}@W56&~?>!^ai+u4j~+h=XA&A#don^tpXHS?&YUw_SHXdU z-pXTzXUb)@6O!H^X1d&+RRRf}gb1D#Lir*ta(mwlnv8kZJn-o^8rQ!ppqp|j_8oZ! zwfnwJmpa<)!m7#UVeC%ye|)e~Zg-L?cc|#@p^zkiN!*s0dwwzSQOk}%<>*8+B;eo# z?ZWTDAkEb9Ci4=p%<=MpU^D9>o#nDt>wvwc_z{?6?Z%h~u?cK+7Br+`#HOuKCkni= zMyPnVVl~Q)O@TU}JAxlgEDDVu^!Hfn3W`>d0;TX0Ob!S`b@8xzj%ss6%l{*|N!jN5 zMUJKiki%O_u9snZ8?4OfmB?Ptyg7+Y-4c z(ge$vIPbFWeC)MfYKq0Fs$LsZ78^Km%4_j(ecf^?@B|EaG{xFD`@jcp%QbU=I1*52 z&1mbUpw9yJ5r5*g23_63_p6lIze4vhh5;f?_;`Ds&}-R!u;TG^ok)qt{%Vx@b$R%s z%`)K~vs2moF)QdkBFap2#PU*-@JUMyGVXDEoIIegFH)kM1d&P<|Lrf?s}X9Ne9E=r ze-MU49zeyj)rWj*LW4hf$qq_bQipE}T!AFc+53bGxnpF(WCdnQh)wy3II=ldhedw& z!>5L*tm}zq(6hu!aX!6TN{y*32lk*ys zB3T6$t;NLB$kNMk0gg?;i!LteYAm+E;*jCTb?ZpS32+8AmqM_K3YW*4CC-Cyn@;#b ziD6EI?}tQx5A)UCVEuX?(j+|_K-k9S_aQ+(K@T!gS!GFbCPm<52IWmo0$2nl7f1>W zPr=Xamec>P%%i|PT`i}RZX7!eH_#5=u>>^O#ZYG%fniEz z)*}u+8~<*)Q)kei%4&OPCHn`g8n(l!+d;{uKX?1Zgw^j)W@sJPeP{-yt-kPNjs}6v zkdg38ld@Qa@84 zrIo#k?9|B_N&m4SNaDgYzK-SQ>XvE*s4MMq zc^F!h~CnLj4eDQNa3jf9f0b`cbQl3}$e+h}VuXxCZeOBDExb`l^&hD&FCLIzHI{Qxbrg^}jwo{^hqF|95`-c8rA##BaCqta!R8`*~N|xzW*& zOkw~|w1N~%`|7dR3=>wWNM=+{UV|PZ67hpP)&)7%$9FJS(^t3K{YP6(gp5WcUaS(3 zJYn1)R8g=@-Vv>P;q=8e-X7&EXMPm*|1tIs!Ma9UlkT!@+qP}nwr$(CZQHhO zd#}B0v-V$cE9yqnX`HX|cE4WEIY;Jr(%<9L^O@X2GQ^}viKNSx8>!|ib5S4!y zK>f`)h*{P2u^D<@M&s7Pv&WY2GaIly>p*TPhLWyWBB(~os7m&v?ZPd;_;tnFQ zV*5oR<=RoT(UawJFmpEkE;BuySl`9`+1GZcRoOX`$vBj104AB7N0gj8t?ZoQ+2AsZ z<#yZ4IkX-hPNZdf6KvMqRVk~wZy`yP8k zc{VH~ye)c57B}7M){ygXw3e4^TC-H@V~6Ki&10V@(w=&K+SIrk5!6d;1~9n69iLGR zotV~W6;Ce|ivVSnbio___LCd3#mX75e2ODC$Ie~n0Xr)#AweM588YH&v}HsWd=wXh zj=g*ACdgu;TUriaRW5G^-mrRE<7;%dU>WkAS81J69FVA>+KTI^K{l@MnpwD+pwq4$ z%%|RE*{bza;6YAIK>jaZEi_@3yz_64+4F$7dkShz0w+$eiOl&5Ji4zZ%VD;${bgI> zMd}G@veH~E63J=%T*j?s;ylXWEl5osU`-kT`rd&v@He|Ne21tPD`yIL%=#juLdcZT z0%B&9&CTi=8=(K)oAI_yO|$JWu)xF{efe(boen8*kB*euQ~{a^qnMF5CJ8Zq8L7qY5Tvc_{hq4hr3mdABh$?F8;hkp$!a07UaqAKI~mN#m*Bq+_Fw+Xq+Pv-QyZrH z*%wc?5{UOc0%5a9%?_79oj!u@E&)D&Kw}$9V!e)6GQ|3BOb~sKo#?er&+9vYz2{wu z`GSd;vjv`VCKw#qe2i*WgHsEc%E(bl9O&Fd# zc^$LcB!3unrNMh-DF*g(MRe;J8bhPb`aaTzk1LEm`+ab%nBZRHep6ORP z9wK$<3?&;Fg{mGs-aj5We_`;KY*RrDo1UM=uLt6e31IEFulC}^w}!}2gkSq~rlof5ju`K^T$`0z zthu7H4w)XF389)Xc%ki)MFjC1_!VsJ*%Z<~+wHY%20+~#?F0N$&L*40pJIZguGX2` z+fAIz?cEfAMc3pO|Dle3jOtwU`tgq?gLToCVT)a`Mc(I-2kE3ZD%9)Mj^=_%UfGyy z0qC;LetwSNc&f!PHSZ(IZLKy7vEf4n({6fXF+dOPrq@VAP@v&p*OTk0zAe%_an&G5 zvqOl9XM`o3aQ-xGX5`0_I-tBo>tA zsVsJL2gB`Re#1Grt0K5gt(Y?7%A$$`72U+tsa03-7kS}`qFCZ|P7@Wcx&aV1{HY{v zC?vCX$Rbpgq@hrSwodUi&Eyx@}rwoK0V^eVFJ%hA_gcM zcE^)@8@3&p1>DHda?OFkMvI}tqwjJe`HNX;?YuYHOp|T!Z(E^sJZhwqS}O-u6j<$C zM5DOr+%yy)q)KK_ktSEG^j|$^x^#Z@nBWUDPEnRyoQ9O7-XJik(t;ey8ODPYG@C~@C%F@F4PbVX~6M}uEw3z2i zGll$@8WzWUQB4y~#UEzmjbn#vS~7H3M)nC#?A>-5x!vVGLUMdBRL=mtXF*r#@k!`$ zMlQXVgl#&*JKQQ(q})qztqa{K_JbGlWm{8T%vY z;tW&h-6oEgLfTBh#Z6&eE;C1oFB;9kyYezv|5Xla4$OQHC=qpr=^#K;XOLuNjs1la zVv^%&OVr9kI*4%d*)w9u#@%2c<4xTiQJ2P*I5-9JTT2g5`TR;H-qisGO6s?0=9IWeaB@EuQ*qR< z_xUEWlbR!z(&m`6n zU;eewwm)8)c<73xm&1yB>t{69RM82l-ihwutFoe9KUn%G9jm3SPxwS)x5>|Duq6Ka z@vodPLm>X*#`eJQj%RRoW8#NHr_Vp9`eaV8*#AkJIsOyGh>hXDrWm$r>?UvjZ~qN( zPsu_@`zHamr$u;rKp?Yo?{3KrV|0tz|z z{8E$S^G9;xa{7{dUcY>j2Hu3^c=LIdX3nfKK`;fS`EvDY_sgp|pH3ua?pkiWWBT+@ zU**lY!)C=p@y*$nZ$_9rzs@fN&Yu8dl(4`Qq!Z4t{0tKc7FdxaZy*C?ME7N+82)H=Ihx>FK2<_O(Ljf0u)Lc5d>7p z`kj zDxcq2V}!W@QXHDw}n&xAlb6B93(fk-V-PcIo0bQ*Y76vqV8A!J*XUa$_1TorD) zek2wYSU>xg6iEdT ze>hd z)rANdSBkD6_82sP>^Y}5Rt(z(#vYX>=r1^wtbJvzF+^H|sEkq8z@CduZm7NWQDD8y z%;@8{oe}q;z$c?dGU)dgZGN*V~r60YyQ=l*?aMwp=}fcylGdSl7y?HPqflbPO&4 zmK(tBL(bM6b-z0ieNF6^K4 z)!nRn|6>nKzRMebC?_1CRYJW7Durf=a8w zx9`4_l4IP|4>fY7mDYC!j7b?b^O<)Vbu`E3O?j9lAYO#fyXKoy06q3lIMa$?=0%0K zz6i%_>3E`9q>6yZ7(5XUCGoG?+Y4pEANp5Z-7a~-o|exzoZxbmWTJ+hOpJN`77@`i z06yM*nD7fsr|QMj2;2 zn(@}Er!7_g4i{aaCr9z{s5zfx1oL9u5C$Ldd(cC?m*t>N!ZsCH!J`65$iwOw<-Ali z)D-eJC6e*cp#CcGIBv{HJQSU|@JUH?7Anqt$@TgS<^94rRfpfz{0 zettESlSNqo!*QSwZ`o7+k?q&gQW6j<&sJB$4;4_uWknh^;+6glJ(jJduI^M@2 z{6P{~LXmYeE`M4*8&&V;H8}kC@i02NU89j&BN64|>e)<%tfuyd3K>+|q_s<@zOG2F z`jlp_Gh#=L`#I?p9i64`{qC?Gem}>z?+a6BEYd)d)H1)FtQg-2OV<0dv=RH5?>?s5 ztRME{)}o_(E4Mwrx4wiT6NS^mBvfYdu)X9^M(y2-s6Whk!0=(|^0L`F^t4SJGFZvdh!LB`&zbJg5Y>r~O! z-Fx{APF>T5MOOGhKBwGDScx6uwX5wqE5urty-Im*BQ52H42Q3mK5$cl@G&`tA5Kw) z2Hz%b%yzP{DA=v*c9l%zplvE~gCi*;Z>=g)*o?%SC)XTZ%ETAmO-E?w&a!CLI={Mc zB@B@WIeDVMq+mrv$Zk*jE-~UveEX$Nxy+Rp(g)7qYjsT{n&Vs8RZN$?OaD!eW+aM~ zNCe$&vLwQ8T-UEt`ITd`c#SK`X0^6VlNS~U6ayqK!E|}CZIZOHxdR}w-=oPc$lkpl zf9~--SBO+4Egrbpz1EWF$xD`b^}HO3lRBgjf>Zk8ZWrN0$SG-tm^@|pT}Uyox>1Mc z4V?<=kTCD^L~VV}O}*bo?~df~BOgDO*YBO*+;cJ{BSaJvM1q!p+?0tLd^y)Cx3k;J z{l{<8R;@uOMv$kvp|D2T0{l-+pFVrr4|593(LzWQ+(S7uXUb%CvqlO}mzZ+~TBdJC?4qzvY!>jpDs8 zail6A4Yk@ufw`m2N`$@JDkX*cfd&`&s35?I1^_^)X>Wr744Gz&+S`c>06eH6G3_){ z6MvCLqTKdi%wk(V2S-A44?D!{eb@mLn@Jw-^iP?n%CMvN?Y3ssgPC>;;bG3fHO<)< zh+-#SZxezn?q7koO&<+{z#M7*Vu|$Z@ATCJz`3rVk$ z89)2?WKAwkmO1UOarnsA=Z&{YFN1=v!^uUru0WAoo*kZg!U-omFBB3=glrHaX-?^C0APbm(T84zjyK)Et(|7O# zk+g;wk53aT#o6!&Bj{DS`}sRAN)Tg##RbZ-ujC?J%wEp#NBkO(?M?qtkpI&ZhlP#v zzxDS24<6;V9>J*+y+QMyP*G}2ScwGGi{fJ=dmVhs$Zd5Zt$5sPx9GQ*8Rz0pYB0+} zps*7M&YaJq0tOF=;oYOGhpCUd`{Q@G1UTff&h){JF+w;EtSbWKY==~EH;o28U)t(5 z72N0%U(672VkiFlrM_Y6@(DgxoT{Hi!mFxcn)v+w#uSUEr-$sLx-=HN#|P|U3?tD` z@9xewP*i225p`jX88smWcxtYhd;E)ADM>kXB1&`@W9+VW*25?zJyg+E^KNS_zd^o@ zYZLfG@+hf3og&SIK=u{|_fFjDDNi&x1JWCQq0iMjFXOe$);O6=9skPP$GoPL? z0*GNUspF0GllaUqwOoy@#3yTZf7;0ji=ZnHUU_5z(-#YPzgGU0H|5!P2}T5mi3%y%*)s;Y_{E`7co^3{el#~S z4c8eGkVyE^DWDNOF%S|vMg~DzPfBo>grfL&AGQXMp(R5418SxvIO1U&=u6d?4dJfg zycNFo_|5+6ZcdFpX{ftK3XyQt4D_&bd^*tz0yCbGf5#Bo2;gxNGbF&Pb7|kb=4mkm)D4`{DSq$2665? z1fB>x>lxgMhT55%WZMQOLyzZIVVk1lbmxv|OO-l_M(GY$_kSI( z``L6ON_KticiC`zVR9Dy>3EH#2so-Bjw25koq&=XjGJMF83{=Zq*orNHn`^sz2~`i zE8+v^5;^*sgV_e1YSWe&_U0D}O|0ok&aej5gkTuh&!#33K@&3+B97p-@TADQ&e>eS zFGE;KkTD9#0r6{{)xgcUH)3sia%%XzB0V6=D?S8mrSRzXIuGEKG0!pKsbSl!g^w6^ zp_PgjjYE-`|jSjs`;n<1WCL=Q}_fo_IupKG@kIO0Zt)BS(V7O#-!;@~?xUX^n z&ZieM0hQJZ+^E9qn)24{EcD}SA7>4KXW)A;B2pbBQ8P88mA*Vbl#E}UfXM@ikQ~g zV|2dgxtznaqQ2;7nlPgob=X@ z@deoE!G}z{$Z3 zMgM>Hvf0`H>tOe&rnEf{`~U7|YV5TTl|msMfJgw}L9qxdm@KSK48FA4E(m0IU=#Sb z{Z#CBbALHpN;IMF;{7Ju}AS1pLFG3t0-QrVC*AP6Q{9^>d z3Aqa4Ml_~eoUBA{fR>(}la+hgM%4*)P7qZ*aIFoRI>{J%06`y1q%eu14rpqo5Wx_& zLeV2lf~>&6BB?!CP=JAQVmc>QNh}K#MNp4|995bc)jJeKwYp)0zA*cODwa(t8*c<} zG9yD4X8;^S}bV@F}t-FsF|)`Se%48wK_@w$YlheDub6M zYV;O%P$#i@HLOQe(^6kx#6X#-D>Laba#mDv4Urcobs7_4k-D-cC{B4w1;Vy=ibfO7 z%5EFvkt`WlkIb5VSU+Opg}gA(S!b&BVCJk_My3f&!B|fjXr(wIK-P|m6}U(ydQX=q1P*f2qBB@fB?v(`w?u+Ip)H20 zJ+bu_4l=bBpg|yyji9Pa*LW}J#Oi?9RvJj;LQu@o@(r|Wr8yFkqofQOmD{wX9B6+KlOsQrK9ZKt7w6X2U2$M@P1degkD$J8`4G^R&M2=f3EMz>DMj`92)p zo=h%}wg2bK?U0Uc=LyLX04N=r?$9Rez8c&Hw5<-$fV9mD9)Z!wPzFGcp-u<5f%B9`<<@I{|f7|?w z>Vo!23~=ZCqD9r+HekhY(qiWC?adKhTWQwLLTOq$?41a=kWCxy%@ag7?9%xt7i;X;T;}i__i*oR*7Q*Z7-iTtlNDIf6eX;uI~4K zIrHfYY|o58^uC*#N<;&#{osR=02FXR46-3V$d9TMc;+xh#7j&nj%75_uM}dD&csv7 zjY2;4AzQ!{kKQr@j@Q zB={0esW~)>Y>t>Tj~1v`aC{*HRrq~ zLxauAO{DdSWSz`t^-%RG+>h7k`|jj}@#uy@iHkP&+?(j)VKtDVySnD!UCHUin7k*DgKfg*yC6;V;%=sQr7w?Eyy2=IOEy=`|y+TXC>>6U8Yq|PP{j_+9cu}L$ zP-MZ&m|!YS@OU3+!f8(67$z9E-KoMWC#HfRol26lkfy@rs)fCzsn|{2}Y}1(M)Z zwvRF{tvnCW(mz=9obv5_zbKcCyKH}v>lfO7A_c#Zd@N8IN97fX zw`aRF@wOd&_I%ctbDk3h1E>?D8E90voT*I*Wdffj8lxJejZ z7r1EO!ja!7N-*tv@L&*`TU)gY#cwn@e%U>G7jz_o&E(C^#m`P5qcL1C z6zT&rLAB!12K_FDk&ZV@1(ny{Bqb$Yh{K?1j$;2xdmNKNl426#xLV5eJ|Zsj8mxn> zbD48!lI9-cq8TT@a0X8)8;$bE)rDty$(*L#aO`fN-VN6Wx(1W^Am9cc-7SLzuA{AmS)Hn(ES zU}WS*xZ*e_XXQBJ(Uw8gZO0+irAJzN9#$Q5&w+7E?e_X+v%VvZy%!sY;{Mxf$o4v%pSa~z?c6nkx zX`T4z(Ua7A6@ta<#|gouP?hqXGVOO!O4#2-zP_POg`Pd9Z0Gi1 zu>8zEUH0;nqHZ^xS}kOrX9s1z;8VkeG|W&9P1)+)XD=6wZL&EBill|!@@8O&r46*tlkRKDS614Nx8LW#k8z2w)u|gQ=OCaJ!9|YhlPvPklu*mZ zn7}^W>$p1sx|=HXq-H-)x7%ySFC<2|EtU;>czFep#$q0N8_K*9>TEvP!CuJMe}4GQ zwg&3wk?R`clJx7V;ewV=Y*pBdQw3F9b%mb$7$ z?FMygssLzR0EU&_Z7T%KRRE5{0PuGJ z)B(~afWK_+k~St6pgoX#K=%Np1KbC22OJMT9|%6MKA=9(K0th+eZYOd*Z|H4{tMs> z;tS*p=F90InAewY3}YY=03r|~A`nC(5T>E}3)ly)2eb#a2bc$ZkF~8K#R+wtbWnN- z0IWA2kt#!zXFK^9YVQ8p04T4x+KXtFirfd(%RZFn=Q6$aC zLbkiERH(wr1d_*Q>0DdCovbQfJ2SOnJy>HB7p3|A4P)jNUb0)Lkq%LNRW~@PZ+a3! z$%|(e2efu`9gZXvK(aW(T}o-{ z&aznAgn>)3&Y{|HS3b0YMv|0g<^8{|l{TsZUvZ0**t#jN<@!0Pp{Tkk#)Xr$b)0k` z?uNg78Q|^si-YhL4@%ceYmRuhGhN*LALzI&D&hZ0G8zA41oR(v@qhpR=SgDYV(LUd zFJ@!tVk%;4Y;R%;#m5Kb?BZlP%)T)oqP^u;Y_ied*J!w8_6z9lQLUk zyri5p6|JL;qEtJoChg0=dIpUt5~^~^E8ap#1N8^mKK4rc6kf z$DLC}qqZdv6v?F29$2($i=P^0SDWLb^#2kRpCS=af>U|{9*N_(IX7o5ycU#E9gQPb;oQ5d{#mGrvVXm}ER&i~m*-qs zA(z^puAj_$8lP@-fD}s`wXwU}uGC{2AEiHCmFpMnpHw8ss$zI*Kj+xic%@BBdszJV zFAEo^*AQBnT&uyau@HJi)bRFSY`1S0VNoo&KD^-X6s)aJv26PxaUL?~KF4Z@|CQ7? zGv+ow(kQHPNIUDr{o|;rjuKiP?OPt_jI)1_RdeT4Q)*Izo)?fzGR0oobzg&kts#G#`EPAwA*qe(+~<#7rFk0*X+S@@wMNX zs2_&LFmreypzmIcCuxPza<71Y%tpbap5`&(+*sc|_Ok^8fsjXpncJwX1HQh8(B~yv zW$qp*kq=YVO@B^UfXuPFD>A0fEiDRmaL9SQK*30VYA!I z)%BD!!l0sq04Pf2&JJR&(8=ckrKJR?iLH9kw*OK{&Bhsh=`Msl(+H=ESmWa`h8{CH zV6KxI86hCh4?{3O%w_wNfY8CG_b4(8mdhmq0pW)eBC&JW;-vZ@$z(xz*#<1@(pc38 z+f1*Jy(y`=Yv|NvB&LRG2qp^A>TRn=|RtxRYr8cNqHc$ zk?U1UB}L_OSGP%Z(RZUqYKn(k^c$?qlpF{UV+0VMsYiAA6lBlG z89|bn%ffVLtJ`2+?(B8K+n-|Q$-c%y7{C?nhD-C89;M#wn7Qa@482E%_U=`U_TqDa zwpm|=;9I13QpELHU9`BdRb#V*cvGA}HUp=)lUqJ{4qni4Bd`Ntrc$ItBd3^F53c^? z%KRAi!vUvCxMBS~{2zP%>_cbcmlV%_;6Zfpjrg=V{od7g*}yB>H9SC3pKfdIsaV!H z4GUmQLr&o}!#~1CJ6=LUyz@L6vu(C~4s_>p5w$^E)$Fc0N_%^~ma)sU-)H6znYlOp zWKS(ogb}FWW5k@uo&#%A+-F{#>G%42z8QMVUyNfCCSABl;QkM}7H;%!FR%a13PE=? zuY~wqb*~G-)9lH1j|2Ge)`ykW$|3sBHqcpY47}j){2v+Tdnd>HbD=jY#2@^`DAl5v zi`mi7cpfc4?5_aY_Lvtv3*<vQcCLRnfYI)T$J@m zFz9FH0h3MKw7G5q3HxB ze%UX6gY9PD|0Kms|Nr^W|C#@={P+It?7z_G|MYYJ4^7>aOpP+h3pcrsd)bW4aa(v9 znAUmS%49OJV%LM~`xX>pA+2Z2c1zlu2tt4W!Uuq&u}e2{m32Jd#d5d-r1fZ2oV*Z6ElzE75Vu%7{y^Wq5WS|Hkg4E18K4OE0H} z`DfsZ|66?$%Uo-gKh`*7<(19qfO_4H*3TIYR*vI~fi^p0LGSa7!AD4NxSe_SZ#Z>( zTdM)L$i=XQmU{Qrk9ZFX>p@dDSa0bl^64r)6YhmWhAVn#j3E z(5+F{L%5v;K`4~g4^5Mmmo&Jm4|hc6lxU0Q19XmKjjpP({LC;12b??EF_Y|HNE6x8 zsfw^{3fi-|i8BT}5j<~h0Wd^@iX+uPUp3sl?J=(9gtra%b_Ht^rtO=#plz(2_foe{ zhZxq?JeDt9J%aX#HiR8aAx>szA4**(FJ;EzbaaE61PDgqWlbd5;}>^r&ZN$`bzbUW zP+fiXH_*&di#eB#$Y-N&!}*Z7svCpIEiDTHnPgM~x}ULpAU8n<`Lm3CS^aEVW5`YW z>Klvv0M<`2i%Aieaeerf(oX{=$MDF(RHR@P0HOqM=W#YL|1xsIMqb4+bU3N;YXklm z2kt$2I%v&=gJ}*L(v1MWsyVzPIXPUAOm_xVofLw+R*#gc7-Q~1*9EQ&&K?a`M!O5Ics`~M?^)ZS z9`@?z&n?8@DuWc+)^(Rtv&g#HOAiWvLQSj0Bv^fJk<$-wj;KeH$XI(!J6SBB^1(9P z`A9a<9n)4EyGZ&NKPWTK)r0qGk#q+GI%p)mD7*cK?F=S_ZL|MwdA`9B7e85u^&JHZ zTby5SikKOI2l$<#zXnQ93VARY!x))eW8Ro>|bQrof_E+tj5j(;~%Du6+v)uNlON zi@oN@j)0#p+LLEY$;~C)%(WErr$p#Qu54gcC7uE(zMgyXnQQ0w5wyWqHu!p5KBe_Z z8j)sB03v57T_9xa*D^_87C0~mLeiEN^03-n<<7?njJWE)caz6nPMQLxHQ6c#l@ywW zc1ob$tcH0iv<&-)qjBa68!L3ZFf4io6&!eI?~O2n0D8gJ!VuJ&M^J%4^j$~F&m*eP z&K&gCy8A>aU3PjYr+v-s8qE>l(X~LW>$XBA9Ff=$`A5w4wBZZ$!}LO=l^rKWMQUc< z&hi&uxY_tv|I?3AnSIV}&ZWZd7($1V9YCfU0_1g9{UxzZ6{TT%zATJ%DaUX3KG`HU zaDVjBKH{1ig>oPVzkpIM;9Ft%LHwm~!iATN1%s;oTMkn|R2&F-M^zf7cPJ0$pqxce zvYe1S3J9%o7kVLRTQZ=8{FXe<8jna+U(ifwX#*|O# z+v@p(jzF4;@t;KhU-{+#H3j}Z(Pv^}|L<3@FeaO}*&crSgxVKSqlJSG++ui<<&{!Z zkgSt}bAd&KS;bEA>zf z@%~O)HEWY@QmJ}kTspN@s@n$*`f+U4HO;R{DuVch|1x2SF>kH89V75*n@ghfG^BFE zHC;?T&Dmgc-#Ju#4L#|#?*q4AYJ@sgX4X2| zZ~tweS{mHQw%d5`Yh@+2V#W$fiy3HOH3w@`Q`>4+Ea|c=z6>e4*4`9C7hBo$OY)F_ z8RMd9?K^!41?_V%)&q%eYwpF=eVs5~&c(!#@dlvs$Y#nv`@60*@{C-#mz71hK1p^^ zXN>X~IUqzevG)eBk*RUK@AZ z;{SxKn)WGE1A9y9+3YSLR&KeV)d3sq!U8m1>=3int>s{f5pi%y)MD%NoF~{t1=MFf z2cy}f6ei6R!7X2r?+B=XGPsUygS}i&$V(H-I^Oa|~2>=Bn({yDrXV9vJY7lw?!_n&y zLJJ3Q@#x>zut?%1r9z=}vXxgCLvUE-VvPMbNrk}KMkdJE;!tV85C$xO3<+KEdQXh1 zu~&phBPuP>zfANu>I0|2i9O_WQXKY64v|DOU%`b=cVj$PyzEn zLr*)h3SMoE?MLyd_*J{vH5PlmN2IPOczkaqj)*=kZAr5!oo<&=^64ZFqUj5{1v4qa zfZTF|YK@hCyqZLE=xXuA?G6?M63^G3s^7KjSTVNCQrDcL=-^_{Ppp~5L|5i$p)&$l zA(k~dV!Sg2&`xCn?y9d*97ZdMPQd{j>w|^ z(MgR=NQ5^C-Oi)ii615_+M+OR5x4`$CJrz>(^Hf)0(UW#A77Bh?io$#Ms`QAJ0;=M z%v3tcPe%dZFuct1OmX#$z7!UqL8e6`OhQmm$|tHaT8eFV;vxXstP1MH2~C7I9Ej0i zaWlzAHu+8hC4_Sd4xqXx53mOKXnExjcjDj>N;(*TjVbzu$hG#EZ^oaHLhAY8!ABx9 zD0fFbLaA}X9Js!5WBX6yyJDv)W}r^o-$()={*A_0@cn}E!;O{O06KI@j+dsxe*PX5 zk$8XHuebhL>#?Vo+}g3ju)BMJL$w27JjRSue2u00A`7+>eF6$^Dc50H4ujJgZ}#;ULnTaY%_^{02({l8rXFjsW9;b87K*f6`_@z4ORT| z;7TrH@(D(iuB54N*wTi{W!!o zz>HPgMl#JRMHn@fFy5AUEOp2`doZs{df_$WSQt0n+&Dh!&M5K93EraTNmsZ_0|V5G z%4vdh%1fCN=A3UwTwy^iI%qUr0t+$0#!p~sF{pe!O7SGyf_q?2;;r} zK+4ILyNJ%fbm2sU9byX(yf^Mk95W9mS}f#tDMgh;fCjhn?6iBb>m2nxvzyA@7O(&WQVb^^~V%ZLF*cXaK+UP5F-*^xRLCq z@cZvC$bqO@@j~~I8Y4fX=|M$>mX$cu%!#0B&-2wvx4diSUXDHt0~79Y$y_oTTyq3M%@OK%=RTlg5-ufbLGlc*L+-SqZo5 zqRH-7=U>-B zV1!0N4y-d{N-m^5?Z2)%+n5)jG&G*e%r9Z+)tfc@z@Hrs56_6{7-Jt;3N`&NB7Hra zyKQA9;Ss{>$;n4yY&7+H|iDCNZXjE89Dw7-q z2pM7>bfkhIl^_CWDRP4dh+cAr3L4sg66#T;!uOkXTMEYt;nRyz`CaQpNl0?y@b2iW zm(|#CP#rO-kuT?kTA=q22? z8f<4Ae$^^-3*2tOOu9Xc50OnsOL!8oyQp>%^cv9j!HPP0WQ+u{5Bs|@;qyJb(py@5 z6pzK26P)@Jn7ri@N_RMR1az^kXqBSNp5mfs(xW}eHdo2AJ5693<(wG+D_EWxmz8S@ zqqY!l{7V@@r~m1~^sim)|G6+Rvi!s7{FejES`BUcZ8ntuX@n_;CV`PmMCx<{Rx`j| z3pWyeOhW@EUWQcE)sd7-gZsSY?$JoK(Tv09jVy_qbEn%Ugbyw5h7j+kzl;34eL1?? z4I&OyN)lUq>6$VUp@if}g&?1N=7qXTvwy1k@@Mt$m6Gc29-49kEDN=Dr6yeQyn+3cf<)Oq(FjQWV z%2nY{R%;oRzV28CZT;7=yl%FYs|A!iqUlU#5)!AWl#J4dB#g2BbOcd8guuO#*iq2(s`-6IWg*CPVkkGoy8_T5yl)>r~2GTrY<% z5*(zw5{3rG4Zpp$D%)ih9gBq|11};M87NVshvAtKiZYfX%*}+r0QoLX>@H4$?$t-Z zhu|OW)r2*};5*2pxxh~7AAsc) z_zCfzlFv?sn)HU%L_XqF3OD594f}RhzNMLlH6wVfBPwHvWR03Db4Y% zo5TjiQL=UA)En6hdV}*uNESqsJgzfHK_I?zxbpy8qV4cpTI2HsFvk*QSN~#ex?I|$ zA<{BMAaM|Xmr!WO*vT45a@$Vcv6W#~Vu4+wtx6vw3C0G1B1ULrE{^4xEWsA&u6!3P z$=-QdyqtNU4KNU0@@NFYM>PuGa_L-Q!$PrsyHriBwTjEFa*X~S&}5!(Gi7FC3Utpr z3EGk2g_rJTWK4;9rX2AK^_C<8Q#(zj}7Au_bMIF z_q`V|=09}4vAItsY&U!6O#R&*r8_Kce;w&Sr0Ik!gxrBSV(7K4(N(UP)MYQzo2d5D zO7&-}y4GgPnk3|U9xe}=;oS96Mc5m5h0u@F?XOjP?v0gid>&ESq)bFjux&4GL6EGDj#~hV1{I&@zJ_$um?_= zATfj3`H*t%iStaHt{ zHk9C+OBnZYq6v_yTK}$e%Gc*-IV zF*9)^reo%xxAVN?#LnEAYklj}t-hJdKAIa>L#1XK7pr;V8f4V@#$zq5Q_$mEc<)I1 zJC#`B%g&#s)E8T()M!XE+3p544U0VZMaE_$RqQ~uRh6|cxLdrraelI^{Yfr*?2=Id z+C%uk*?73$FK==G3gVe%d|YVvXuhs_!V0_SDD0d__D>;4CQHu2iYSzggV`a}M@m@t z=X_%BI@mIytIv6SVN{{FAZ9m5;B%nRPeXs=^23}>V~i)R3s*~Y{_3Q&V_)HNfxnY zE95KzqJ?^AwE}oH#CSfvd%2i@JR02}*^U)vnBvFJPUsXfOteM0#?xmO&PHVY2h)iET{Xvv4An(VLJcJ#`jv5aWLeJNLvE7eNR<0h z=AUTtP>i>{o+UOq@l;*j*;%r^IlatuEaBa^wz<=SYw2V#qu7T@CFkGQ_|ypIFq6wB zj=G2WE=f56Iti6aq|(TSN-D0A2#HKD9&TA9&~~`Pj;%F~1@%fK!E9INX-%Q|N+jeo z4OOf=ET4=HWB9}xYHMSowHQY6$CbrJ@1^+qNAECKMk`q&uCGucG?{>!Q={m8m* zB>gUAr6|ziTk@o6&oE!tQg#AFE*QBlzvY4@fkxsHgQ0c2`>4aTJcSxd?RhAi^oSSw72PkDxDE9P?vNsvXMvlic@JscTy=OvLCQy zXNp4tpnQ1p_8nSDqOxA97)bRF0>OXe2d#&;RSe{i_F+026pnB)Z+p7tD!iAy za>9=GQl=d&`Fmn;hAUqKaW}I?xTns{%(Fn6qs8`XYQp(AL;O@qjFomg-B7dXNm7Qt zYLj&os;dMEvz8_X+mfAamCoS~=8`ibLsY&6+~>UT>U%BZdT*u(&P%cv{AtbW_sQ>( z#=xI40`%qMMd1-8bB*^g;+zrLAyTZ}tns0YA9^|CfU^SC$%l@+=z zhF11#a%IT#u!dbk6E1tDb)N_6UdL%OOMeOu;Jl+)s3Q(`CDk$JC^QmA5}<`7UH+=B zoFnUnAe0-QjsfNM5FOtpS0PApC=Mw()MjkaQO0g&eZ$ZX3BK`4{(Aoi+R6 zU2yd^mKh6;IgHY)enW5j1U7Lf3fZm93v&xNrMYaKPa!%w=w6z_jNSe2f`S;kZdz3%S*&ZH?Kx77Ne1u@0md&{Ssgm%gBDHY~rN zuWzCb7w#gn;?v)`G?(^Goh@6ho1I_=w; zvE)>BetI7*?H>HAPbY8p&fOs0@=vWO-+`2BHXz9P&OeNAt}N%Zn312`)w9;l;0Uw1 zEY{P$c6ZiFxUMIjCSFc_+*x~oZhr0UBX25g*eNfgRt+|O-ZcHWw}!FY4stTa=VJHM zUT!ft^54!{e(oQ4iN8Ks9C7%ybV=y%wie4?yV$j?x(2tiD_36*&$VdA1&8f++|5HB zo%{&jonQI^j)Tt8JF-dTn8}I|Z4q&DjB%2UxSs1jHpS29n|9H7f@7D6avkPL0}m6k zfc*!-04Z-U{vPF=MjJX;?6u$YkNo;&Iv+7GX#&mCDM*(@ax=W;bDsf71=&R_7hy-cVAg)ug z%Yya*^k1jLO+4`Y@Zi=Ac$b8?cgTr-F8DmYtBcAA=l#6oYmU@Ctl2p0$$uK1KbiPl;&u8u zfK5&vZ-v0e;Xq_A%TH`)VhI(qt8e&D7inU#FWTd9*e5jDo~oPFS6E&Q3hm+on3_-1 zdBn5A14eZ~W_LUxcjkMta~2mg(n^eOCza)}b<(5Oly!u%_BQ}hC;8Ggvf)~I?fQ}8 z$?pAfkT}~B`EZIH<73zNxC;>uzuH(wLSm}9V{zMVGOLKx;cTZBq^NN5$hh$NNyJD-#X?lK3OB+ht1`T}1M@hY6OpQ9!_1m4Lr>}h z-%2E2mIk#^g$$sxm!sv~wMrfB-|qapwwKPd+>I8E08U3F1W--duoHXK?rBdN(!gYXb9lblGf79LmG8f=>-F+YJ zUsGq1%s3T=>#z11k)a%9m;{_ilBV!n*JmsJP-AG>ir)d9(0gN6J;o=b0~#_vNYcrs*LY=A0*ifA9V%9ElSbWeC+A1Ns6-PfPLqQ@z~ zFbeR2VHP8de8`2u=t&FN4Tzcxlk^6_ijk9W;lAHo4girjb{0U%2VEsb?UI@bvvytTD1JeUqowlv(LQ{~x(B12?ClyW?Ip^ws z*{__9Jdo^h0AIWRca=Ig`%-SF{VDzi^}+PAx<|S=l1K>jjg`}qW%E|%3o~nb+g`V< zwi@i25Jn)H>6e{#RJp+8YS3Ig`6C~43-5znp6PCT`Z>v&*})`GOR+=Z=UHyw0gZ;e zn$S}J0rzEp#Ll;|R_cTPcN%#VlZN%!4oUFUmjS07V$t@UTX+SF6(cy;>-I@xsm_Af zv_jVTd`eSZXpr~YIy-LC6XgWZ;V zLjCCFz>#u-x1*kbKXzCly6j=8nD_v+<4)Bf;;}`KMi^6vCmV8amgA})u`Hq6xCO#o z;=|1lFtiya3DAD?Vmn+|j64kyl9|m}z50_LxbD3&ibKM$$ z`-q^Lqjc03q21#03~B_`k2S*EtJX9^4bvg>LB$@XKp6=5eQM*!lfo8GP2?0m6!KG0 zp4*2OaFMmho7oe&u^z-ss-oM!$`1o~HUo+{JO;SkQyt1ZV>19DkVTrQ{dZeapecuQ z%@@q$jvDR9Y?S;`nI7^0aM2DCN$gNj8TPX()Jr1x`$2p6iJmWfeWUa*XDJ%F=uxR& zgpt}w&Gbk)Ijq~pD4JxlEj8SJ>q6JEHLem`z@-;M1xpl~v#fgwg+F$BSSGueZ&+FF zsketNAKZx)|0x8AP=IwYgTQUfS2oc{JL#D#59p9W(UL8}c2N$7^V#ryxSmmKQKq>=To(JE84$>t9yu?e1 zW&6!BqhN>vm82}k1HD?Je9%o}$YP5&zLMD|5=Aqa4p(ILR z1@DVf7&beFNlg4A;Bcr?%=VD4Osq35rB%d2l&L06J=qzpQul|Ie4hLpNc6jOVu*co z^A|3dZG6K*!U}_pJyprLv4kC5HW4pq-s7|LUxV(5XLkTrvOL@^&v=wvnR`|dqv3*%md5}ZLl&u~j71bInn_pqb_*(RTcT;$7AvUEz zSBh}K<;sg1)F(560@=>iDEk2ygr=11z=R?UbKW073o|^M$^v`Onh*IPCsbcxqsETW z<wZ3Nq!!0uC zbTZo4mjj|@vA&fVMa3LC{!k1fRX@7k&!ofn(Ya{*E_dxAR1Cq`iBv2da3GYt=wgrQ zXgNLJ602RxEtP{?Ku2PBw0T1IzcRt-HZ$rTL7}@C^XE8s_SIF?tjc`l6^K8N&|mBQ z-J}dlsHpO@{eEwc&G_~w39yxStmQoEbXQ}Kfs9+>%)jE^3{qfbM?ry@Z~QKSRCT;% zxKpu6wso3m)3w|Q>s25SOMgIoB1>%?g1@0@QXwdurL6zk#xg3DBkbG2QPGPlP-p&Z8x39HGerERn>`_?*_a zYoT+eV;9P`0gb=+^fOS`@CQdC!o1LH1^_;)1pI{!EoU8Spdu`Zh?kgKK6QKgE0_ia z&-~>6&dXN*ZKaQ;3A!{_uAzBETx#qlfl!(#E-8Mz{1)%#2eyOL_@9E;e*xDS|0Xp3 zr+q}T`u|Qpt%gEqJP@iapq(qS2mk`zFpkGdz-dETMI(}eBdu=ye$L*Hww`oo$Seqf zCkh+fx5wLs$riq(i16)}oavdZsqOhDRf(4l9#0_Z=!tPgE2ctUNSb%S?T$!B6y@=7 z``$EAdNL(VB#HQQ_r0-sotT_L<-78-{COJ(4{}lpR7?}1P{$lzd2OCPDI79pQWI}6 ztW8}koFD$|dC2doI|@jKHrPocTKbKWE4Dzl|n!Rppylx0RsUGrLWvuUur zkH@uT1K}8qUU0C)h)j?B56VbLMA-aC{rSpcz#*6&aI2OCsd0M3h5MRy)r*Hig81p4RSK=1M%c9+wt8 zOOuXFkdX8SGCjwy` z5@mCx=4Fs=Q{c@|2zSpqgIyhQOx0;Mp6%oTcY(U8=<`sbibBR)?RqzLV&Jl(YXc{j zhlw+iTHyMA$=q5Yc8NlBd$~dsj?f4gl z{IZc_Y&WX4W#Qs!32S;0!|g7aB-bK*u<4oCWbDvV7Gk+Ue`J6{%M7t8N#q$?jQDd3 z6kOOqDTx^|t(a?GnU9*k*3ALABFKwlM*i5vR6iZq{>D0K8tXG?8~-Gv4Uu)xI%$=1SVLGPA|jlO|S6qrnqPc z{(>Tc9)vWGGWf6_8Khyc3xqy#5U(1FtRldWX{M~3jE&_Pu%-LL zIzo-Sfy(*cw$S$v#m;iQNjD7$7OFg8r$?Y!m0qKSVt4}-Hk-b)^B!|I4s~WI`nK<& zYhG||V2E?UUw!W*Dz}Jx_(L7&geJ-kF!gp|SyE}OiG{@{;+B0#X9gsjtXbhIw0F@{ zO?{1hBhb@rNuiV!3}p##=rDZRK~q9=?vc#=%~}Ut5KxUh=-#DD@x`95lXF$A=-Fxz zN;o_?O_I>6zqAoeUE2uwKtBVx-HEjezwxv$zu?DX(SMIa`TGme4rL0IgUy|v1<&t> zN#cxrdsCfFUG`gw7s{Qk=x=a~F+U)h7*U3dFEim{-sT+%*~9z}Z7HmM?0Mbumo~kZ z1FmIk#V&Cb?)!CMn16Whdn)_#kaI}L-le&2(T%A=Kn*|Y8~}h zv3v7DiINz?B3@mNMSe>cvR_}c=6crNR#%VA=IY4sq5-PTQca*vE|~hBZzl6+FvmrK zph1|oCL$T0zbN5&6;GZYIK9{`t(-{+6JmD{4M(0z(bZV{B;t2+IX6ufiddFnAqoa# zE>lf{_!$m`*m*)r*-*iFiqu z7ZylW|J5i{YyrIq1w=SNu5PcTFXM%%f=)@L5P@rt7(7ELppX;wj5i+;orK%grYk-{ z;>Gn8(3iwooLga5x;*t!MAjV6IHC~`CT_sJV&9ABacurdWNth!)93autO<|1ZbRW5 z-v?d5bS-Z$yiFHWIbhsM!IV8H>cOE!0zse;XIBF%5x}%2dxN%RCJkL}J)gFOeCnjP zV0wNz{y|Hx=Mx>IWqzO-H~9L7+YbG1+@W1ZRC;=3NpvwnEKe+36GTfan?1$6t%e<86380iTF%)Yir?G#E+Gy1fMLCKB!>j)f}6(CsLG%o^2=NzuPW6{A3~SNZbr#w z$BRC@T&iTz{K(VE#JGBKo}qekjm|qE&O8{dEUt}!^6gn=VT=#G@J8_aD-rtWN_M4; zewK_+gMfj#|9dc8XarYOh&;gp2W4Qj*`lhc&SM~uS1Rl8oxAXB+5$Yd_oV~jGIhgT zI|hwun%@qR@uKt{H5;sjol*VZB1ah?fXYNfN~<@Ad3ZPjp{N>JdoXM?y@qL7m}Ef) z56qz^5g%xS319Ih{f}I9s-8CngSu-dubDH%*8w2fT#dA5 zr3zX$u0QMgTUu!ozxg=kt*$jxI7*sLkvU?()ey|GO|->1)i|vQ8>8GD+#1I8qjyo5 z!J+LKBf9a@41@TkVG_#O!{5bf>B1fDx@-s_*S~kNUA^$!RvsF-Pd`SUbrp&Lz7DkK zhFgx`Alrm`y~P?{OC+e;;`P?pEbxNha<*L!G84ie)Uo} zoD&MzLUt|$hwQG^*i|;vYPSXLe_|sTgm1?ndQHbzWSQwj8Ya2}unz%KEL!v241I~doJa#{ia8gk zuHiE9D$6WCtBf;OU(340woO4xm^PzLd~_)sDO|gDA&?r`tf=Tb|232e;p>5*Nu@RL z;L0`|T%V1Z4l-wR($reGRaJs*PAX4#i5tbL6Mel1$AO2g51Mc)X&@f&#?R z54zh;!WXUiv7ypqIXdSTIBo^<=$eP}kd>fT&MiiUNWcr(+Z`nm#fE%*L>3!Ca^t(; z5Buxls3rKM)VE2iSy2vQ+F8>Tzy-jDzS16mRaUjfMXtBA}B!h3c zoSK;tIOp<@LXU6^|Gc{`e!eU%Cz%!GS$ zW?mO;*wdM@rtTW?)q-_589^&&b~n*T+4V3dceFn3SbR`0)*~Ll6Z=??h9idUFyc>- zqtt-@yV(~nEUp{Px7!>|B_P7rTL2?QU6Yd z9o2j={39CQ&tv!?>!|PhIrg(v`_K1XP4Sd)l7YZcwd)#ua|QQ?qX+H#)ABmGUOY^- zI+IHtz7sGLRCvU0pGmKW95rJ%YIh_w;|>()dg*FBMN-E-pRGB8=&ixU0Wa5QK<`m^ ze!33i?#u2)2ovjN3+e#3y;)eGUPfpo?1{Gkh+QCvy$m~=Tyj_{tV#>c>$!SSDb(nr zid(0P4M9!?VsN=6QLD)cixy(8ZO~h*p}>fyw*d`5i=Gb>Od(z{?OZC75VK#d^rD)N zNf4L$9bo?ST>^h_r7>K6^=Qe|(9|Fkt>F5!a9PXZE3U)1;=xWG3VOAPZ)2JFinFAM z1fwcR(VSI{a0V8BZ~g>)3K8|l$9$s2K?d~<*uwJ{WlUh*RJ;ylfK)b!+u0sm_S6OJ z8i?|TVRgBNVS1?jk@Q9vk@QuBpOJFDVjAduf9-~$DQi+Q^1AR4z=8Gsnm&S zxL*gxit=0q25y={sP3cGaG{)SiK|dd!OjQCH}*Wwp`A9p5>Bqq>zT3hE1!@Lhto`d z4uUfGkG~V%i6rrB+J$5CQkRxrrkYB&m{qi#K)l^}Ex&2x7ikanr|GhMOd@dR{S5nAE1IKLFF#)a3Und z#G+rKi{A|19Am<_qv&Em{Y|T2Lq5T~EbH)nO6ffXi-`Mbt1&5|u_bou zBc~h@ejm?>d_a)nc*b{Z=qGH+?Z2Oy|9qdo`QgbM)D}bw_fz4O;<-&2&q4bI@9wq! ziuK!r!?)OZN;%PFj}~q)Ez4BHI)qvPQs44uqG7X->i))&GLcfQ@Gw~p$RDxMf*!33 z-^&R?Gc9%y#A;OnCX&{}wo8+~uI=VdSK3}8zEoVd-NOe(W30Lvh7rapxm=j6;Ui1TCyP!7L&-ifrGAr&`&n~ zEHv8Ik?(v#73HFlMnJ{!J?6~68Hjj#1^^HxeD=*) zWv63;eW0#QJCmh*OOjO6y&{t~LeO;lzQ-zOZ>tX!4jK>qT~L1)CClrAtDSFg@n<8l z3(XAcRX8a5v7BZzw|~IsS{;b95sG4@{{yUrCG$Q^6u^EjyOL$6v*%$!u^u1ShgwYO zijGRkoj8pc*TAuwc#6h3*g}wQVfuN40a_{o5D4XqU2q=8{wS$Ywo7@(2=)}Mr&&`e zqa^DulQ$tK{13VQptF=Y$-p2wVt<7B;Jpip@{7;!T;T{s=F4cjwGlBu__ZX!OpwdL zlisw2Y;QrK2i%=uYrTR3ks!BmBFV<*_q8>Lj@o(udbh9N6eSg3?eS;f!kGa5Nykf` zpQNtXqh<%{YtP7o=4z_eiNsYx@i@i2ZHut&cfKoGOEEE z4kw25+=avPLeDY7!nmmlnb@7cpPW%C`cBdb4z@oYX@#b<8j2}FD)%;)GWtt_zeC}K z78C`dn2+@QL>i5=314KxJ{Gf4#X1(xLzF|ACfti2gV+O5<0OcWcouVEJdU6S^$*{~ ziFAyGOW9sk_>cmVkNb04Q?b#;AC^F0-zZcraiLm-kK(}1;h_nlrUyw%lZ2YvBgki; z)A%JiqSuR7n&2%sX0M_iyHp3Nm8R)#o|iGK zy%|D^K8x?7v$Lwx^g|MgXf7hZZ*``K#yIJDPY3-ng>j^TrP5-nW6Vivy>nTf)^*d6 zC^1y*(0$r7SyA_&8n_GL8ReAdUt6cf99r7V2DVHfY{T>72)zz!qqP$=u*H$ zSL!f2@w>!Uotg*O7qX54qo$=wVKL!ZD}{8;jr74r2k9ku@< zsqU|9GF;#sVI^<@2*NY+KJafG#Z+kI{RxjU@PXdl5`Kbc$#^;7-Y|BIEBg z>or!}fvBYSJ)zz+RX)!5O$R9Ki!Pr)XL`L)4nbT0&Uq8#hsQ8w@zxoWN!h|tr`RUX z8dI$CTZ&iLKFNp~jGYtdFQ+I>^r+{wsNJRANz3Vg^ktm|SuLKwrX+`p_m|1%YIWa+ zx>JaFgmp;p%B(J6G-Z-7fGB*Tp#4&)MXy2tW(v5S+Txic9LA1~yNcWaosybB$Vn8K zIng=+XwS%#tJG*>u@k`38ysf689h@{eY9=L>7+tU70(K8+3Ko+h)R&n<>C-Ja1uE* zD8<~BYIR1Hz(p?O!X1Cy7FJOtne2<==P4QP7h1TGg%5nxkVRfF$k974+*pZ+Bk$Sn z3aN~0vtR1KNmov{0rv;nb2giVU0QxjjjKRl1BQ*P1z0w z3}9*%BI=iRPJCYi!84&SyCT100N3iwFOmMWQR=szwjbyiss~w&cPyC@Q6-jtNQd_VdPI1oeopgIZ z^{3}e9r(+uM&$J9JWMWQPVzAmH+(*HZ{~mXEu8-XHL(8w=$<8F|LUIq z%N=|MXqa47R^19>6NDzBK%n##cOHCC{h$-QjX7!Ft&K@T;*QxW~B4*@O^aDbhW9ptqi`C9r|Nne|?#m ztrBn~wwl#XQvK;Ahi%zv$FmMQ@Ch*^o7}oRN$Gc!#1wP4{R+Gj(8U%{H*`6XET%tp zi=!s{=3 zvS*iE(c3>pq@6V{Po*AUkn| z97)}2^C`4Ew&4P<%cHEr+E$)$t!K6>Bj1YRu@;M*)vUrk-oqPFCRS1G6B0rn2T zo4y(3DO5RDLX}DttAc`#*=cH>R1M08@2W}J{GDu--g!bBda=p*5x@t_Yjk=RcE46U z;mwK5jktq}d@R}+xp}EEQ+RM0E$=flu8sfLT(u9iN6IG3tLSVX=A)mFBa6%uW|el4 z8Q>OHVcmBpi-d2cfTKs^n=m6u^JKO76q~e7vVN1B)?ti#Id`qtNEwyGKTRz0x-C?bd;FUZso4(@OK+^-OSy}+~HbDr}R01tb^ z!J?b_sL9vr3fgbFslD91#2r_>L&-id3J!UC?wlede!H*zK_(b?bYrkoD!FTpjk;1( zy&!VH(gkr-Qkconb|jWjT?g3`D>hacjwEYRl5^G3u`mLn5rp6HMy?s^<~&6k>v+KUwz>o+jARW5oJpAGqdTk_y_UIyZz? za}J5r|_J4 zTCX3x?NQ4fx6T~77hcaW>N!NUTuae)d$5Wv_x!nE9J8Y`qML@_(w=*hUv*$0<&Z`1 zVfeARvaG^6{5<@#Rt>??jOskT3_B6IHd>W(R)U9cX`ux4<6RXOjAfUy(q1S=uy{y<-ro z8^-AFx&fSe0Gx6r64R{(t`Wn?wDB$7(TvO;ebE-*HKe~9VGw%i64@|+=iwz#v<`RJ z`vKa%L(+ogiJ&44|CM&mYqypF7{Y~rI2Pv!m@*GJ}ZHIp#-S9;2 z?>h@K64-FS$ zqXB6(fxeT>)yz+pfo}CUE3wZ|jhAjm8)FgDnMjmamgxA83e)|@!E0;n4_JQ<`u#r& z4l~2Q3JwF~e~cr|R+VeaWJBofmFth68WPrLcuRB6koL0XSrpQRV}j5^CPXCMdfRkU zqlV#_wMe}0-&p?H-L27|r!<@oBX@oMb947};u9~XqF8dw#?_?IpP-{EETT$g(Gv?N z^F--8({QkSI+)Aee70CZvDkJ}frsj*n5%2k(#dl(y%(H3f<#Ft$jxJWxRXKrOOiAj zWzcFb`BVKuGe$;!XJor9>nfRGd&8Nx)sZ1%sM0--JVrs7QmTO}ip?UW=rc>u+0b4$ zE^yVNh{LKjfXuL>#FZ-0seAbps9s5acKwYqc z&GB^9?s|*~V7Wi>(6?SL-5wTV#b-~y^@a)B$tn<=aR_h=wlpxjzMH3dDzlju1$+@D zb7Cw?_*f5s5SI+sTRX3~7sC~(e(2J-#Dzj)2w5Z^isRlM!T`(u*)L= z?k3=9VB`FfOYg--2VwEE1F#`y<{WjEF}_9EFgT#(rS4f;Q7Fr`3_z7rlYX!6tz@`p z=jTqVD@`s~R$wDmv*Kn0pgF7m29ASGnw&U1gW&IDr2TgCDITm)=9lXhulyXo6CC%X z#?lD0*fdtbD?Eik8{48Dny!ib1tq}Vo9zM52o^j*Pl<72iCD$_o;pfPb#%;|!K}`C zeN@iOrXJccu;nO;hWVsNJApq`_64HacfmKi>hVpxjR_d1Lb}XW>3T0=Zcr{i_J_;y z8c6#7qfGi6w6adlEE`&l7&58nY3$Mb83v)zxvTH(t}w&8e~#LgTuyPf#PTq*-2+nQGl0tc2UkCTK8!D7E2^Ai#c-EvG8l?OTXcNUHDx96*2r z1Wq~mWT35gy)I580INFoBoxs#vF}#WFPxO1;RSTcY%F-3`>BSm6udU~LzsK)HvM$8 zq2r;f2bd9Oc~0<=ipg`GR3Q~|l{8koqr7%_FBEI~9khlSRXJ#=V5q*nt3%)>DgU~= zM3tcionl0wPNYUgCI5|JqNhkbHLR5~1aQ)6Z+&{_F}s(#x8lM-`_`hUA1AFgvLd7Kj$wTm`@wARCA1@CTV?V)8*n4?b+0l?Dz1 zN=Gt-XX}T9zB7yO9Fx=vQSG7$U=xqY*7E1z?{d4qZfq+%?{~eHK2BR&;xD?G`WPEm zxnU;o(`O&^q?fQ+Xm_9!u6I3yM9yfk@5SNw_99Cb6jlh zOWO_d>9{Pro^}dFyK9BpXHcJ~Ze4BfZ>j^lD2SM#F|DdDf)}Ekgy7Jff;(Gpy!gr2 zs9aCvThkeJ(QiE!!pa6+y&2$nrTTToduY{3%hbYV#Z zE}eS`@0@5KI%Q{J?FN$^1{xsJdk}Hs4l!TVD%LR~-fzu?Yj?W>;RmZ-h}p2`_ip}L z9q1-~Hp4k>TTJMvv}aVR4GOEYV$dpF@jAHdCWBV^tZC((1eb<`v#8@YCPbSijAKK8 zTH@PjjI*VdVi2J;E4x6TIvae_&`>k|6BtU)^JSAjG!|X~KAWH^ius0ON&RB#FUQLv zzlxyU#RYHXY+Ct;IEj2pFS4s-fS&H*3^5J1mXE~}i^C1CW9k%Diunvjh(>22YS=zN z%NQRkkvgVTfnM@p^z#%DV}z(Kfg+bD4)Qt%?VB9MZn&2v&CELb?`1^2fn_15kndW& z&BO#FA>coOOEMuyh$gHh>oHFOl?fycEY|Cn7nW*Oc*E@3OlYZMq%c4sbZjKh%G$+a zf`UJH4~STz(_48hU$d8LKKX(1-6*odW62>Sgk1CdTx7k^zT@;p)oo(b(COtkB^Ir* zYRjy5104*@Hg(lHnzxEC@BaeVtXAJTP;E(M?ag=yF{H&7Bjkm=T<5;2(291k?(*fDY zTiqWV@sw_Qz29M>)I!WdkT>JIP|=ocqFKE{I$~IlTIz}SZ3$;25ZW2><~;3~8`*?B z$TLg`A0=PeF^Fj#j5m!&>^WC9v|CHsOph@(kSew&Vpv+w5ceENfE#p@8JIq397hHC z^4+kWArlHw;O|`L0iRDstHKI+1l^k)b|KqTHWhP(?6lViIb(6Y-XX@Ym>Fc4xRn*M zVnQb-#W6;9%spOSVMen-aYSh{MqHA1G++|qNEjr|7}Chtjz|i|d-Z>gARY-q5ls^j ze{@)i-{jj%7he0YK1{zlKd0nh9b_N%Q}(k7yrwz(BIwx{8%BUv^jVHj@JQ$?=k~1H zads%tKz-#jP^6`vQ<-gw%J|H@&bF*ATM{|DbY(FQ(y?1Hh%K1Mn2c;^Evn{ zOX6Z^O!Y#6dNDDwvbBHM?K`%tsoVbuCe_ew9+SAtidZg<9{*7Xc7J9&{z;#s&pBo8 zRY_iQgP%-ha0nROR+8vostqRoxikCqz?t)6|B#gzYI|0k}R$7V(w9e;v$c=TX6OKG2m=BNU} zH8qA8hKp~WB8uqFY@+!Bgp}I_H-39(yF1&x3 z93Ji*Pb7c!&$B*McWBt=FGtiA)@~7xvj+9%>Ft6O6EpC?JKtPiy}a91wfpnVG8nZO`(JqWmTVne zzZVqa9$%(!lNXPl;|uE-kNA`iyI-?Axw(9qez4>{5q(BYYuwh(o*~P4+d6y4iC#b0 zONUetVS7lBEtnugqC}GrzooI-cPcMUVrnivW}v*Rl8luKlkiLC&le{rIoq;nBm*ZK zTWr9kOYC~S9JX`)xO%^=n0(lJJ%4pxOf7bvSDwc%o{}%&Yv(X$1w)UD2&Rl7Buhmd z%ofxug56lCEo3tIaQbn>%ip@y@=cwtuGylA^tcVvSmn3}_p9-D!t{U%Q$<55!2-1l zd`S}fuVuIlt&COH6RE)fLk92$cS-;=PE#CFIs%yO>~MZ-0(I#Zs*7o_JR5a-JxP^S4CAZ88fDnK6nbwdk}RCFF^aK)IQ z520SpG6w?U4~E2Y@GX~1Ue(Xkpc2>UG; zURwA^p@7whas!0~11V~FuUkZcjKPPn?FR8|#=^Z2#R)q;UX9;g`3>5py6&>C$UfEp z$5W5Q7!zP;X>f!h+XDwJMym1C>a?5ok$=(+Nri2990CHSCQBxO7zJ9OM}iL3x4C6ECTWx*h>vM8zBP{<`x6r(L)|e z8)INZ-3n6KfOII*IFc{-cm2u&ja%>eOH0Z;npN}n_v!*f3{4P~r}4ulJxZtO;n(XN zY@LmRhF9?9hRv*rqx>$abA?P`UI<0Gp5pM)Z1ldtm<`bkGjC^PCZn;Dp*d)im9#dnWI&`NCYYnl-7ic);m#th({WY;DwQKfEv0)n z4RC+R$9N4^3_xnFUZT95FSZ$56!_32ID(DSmrYh36z zwd)-sjV-NepKg@`wYs3!cNZ>sc_HFN#QvNjM%Z8t1%%CrT8VCvles!Spu*ZxL;onC z%#8oAU$e3O&%U1E{|ygLR_Xtp$$-#(O5IkkRjsq>54$N-sVYhRyddOci6z3~phzM} zbZA{zv0+yWc*qLony3W9{AhYI-392u4ey~xCjQ4aLvF|SciN~vj_6XRU3XeP2~<}& zL-^oOrd`+YbgvdaV*C9nIHBsNa^%(3r5f~i->g{wBojBvM%|NL>SHYxWFLkhTBmrd z8c+blY6zg9zI?J~e?-&T{ql!=l46ktVP@Rtr^VylK6zx^pS*Z0GuV$EHL@+$wIFBv zudlnXsFsCu^!>rh(7yI113`l~M?0u9>C1B}3MlJABX%?&+L%!A=L12p9XK(Ykk3Wu%W85l+r z(1WomEPWWp1z=}NHdgdfUi5X(WV3`QmRjgy3^0iT_B?6@p|!V!w(CwB^yAP0}Bz6c6>PPR>@`jm-v`?aAZt*TpL{Cdq3bow;Z9qK1ejHbqh;gw0# zl52Yj%AsIw(V1-kP8m?Fp_K4WmET=Z>&<6bfu$a1h&ubI3Ab$+0y-4M7Ww7VV$pD0 z;QG=a<;2BWH%GXjB7o8e*Z?y67>b`KEV-a(oe0Ypv1NS$ z7y)^jX(eNKKJ`SD^Q~Q-G}%!vmS-ths2(_>Y;qq+;*YGjHHQJNAQuR1LuSsD`vDGW zaIN{*pU%Yk-&)20#b#w@|BqE8)oTCCHNfDhVbf_y5$S280AdjjGM*2MRhTM+Fveul zI5&uTyiJqw^EzWsQEhCc1Wf5YXTJ03U`p{g?AniBOW)@8)79nvLM4d?DP@8}pOP68 zotAV@gaip~+@fBC-nx@Y{p)0)b173w%x4eLt?8r7E}5~T9N#1$F`e#Kx%lGd;_%^` zs4?f8Kwlss!R%5jSyac@3F2s-K_I1pL6!g^%22KURrLVAAbNN!A_xD}{$f6NyleEx zw^Zs`rtZ#TG_xezp>kEfgk7_lSN~ZF(C(*J`p0#`&EwOeI&$G+gb_M84KTe9t3C|l z7l+>;ZKMhb5Xp1zDWA$q+Y(=rSm=+1RUo!ax#An;%+$esNIWKvOJ*dOzO^l30(BHV zhm&8rvKxXBXag|qhNBX3Khx84Gk4r-BK4D67b+NyXFM45X&D^R8li3LZHy9~FY@Rf z?D`KFPV0s4m*J=6unylvM~5c67>D}DGdLoc&BenwBQ#mR))T>ccrBEeA^EPT)Rhep z?a7RC4oV(ADUjqPwJnJZ17)VrT7COCUv+(NHn#k>PgFoTP~ABU2)gtL@F4Owr-rPN zSWP72f-z9y|Dwy#ZQtwE8h!huWv2sSz{rRi(e;r-ce<&h@K3rFt&AaVeNtCRHd?3A z6iHoO7;x)hi)`88hi+UW+i*<)s|=GuP|q!QF&yzdsm#jQ z?pLrfJzVNCt|sJ+kGd^2QAX@FJ(}s4S-V6aO#<1db=Z?dtz&uPG%A0%%sEUGPFZ;g zb(&RXoK~GZI3=b6RR0HM?-XQN1GQadWeu?SePBxCdb#N*n+ieRw)0%O%vlLy@~u??1^Q8G%jugA z6N)~}49c9-y|6W)vh2s1!p06Re>w~Su?{R|b=7Tt1`5y>@YPn##;t0WSt7RIR3DPp zn>YDd&@!i7q8KkvNf<{BM?jPz&R4Orwb-96i$R~ZK2s(%euo;=!9Kugz8k{SB#@;x z|FLs4OyadOYXwF$Jips0oAfJ}9)KEff%##19HmyuGNq)f3U}>BY0hOH(+VKiHg4=d zhHnsPyG945SX#U4@fl#jlzdmh=|zHrLz)yJY21R%YDSx+uk;$ByKq2}i_k)8-?cEl zmR;H-2;LvMgeiCip6JzEyqF27-JX_sqJEEjNUAp#(smB~(5p8rA<)RS<8I7PhS9%X zghP}`6nCJD>vS~_p>9BG@C>CP>_P|tGp3VQ=}1Lyi1I)|Rkl1bI`4gkl1z_yLZrln zCl$Fg7u0Z;s?y#=iAcn`49Ik<);6{S4=tMD4#1jcogK^MBy#B(oH2L}o)jBy+0n=} zVozY?q$b3?NZnx?_u|Gb&Fva_wY8;~R6HN%ejHD%${Gj!o3Amt zP!gI#M&hxF@D8p~=NFk@M5l;o!_Hq#Yj}&US=n>>D4@gV6!7)J_$u%!EWV>scSwN7 z$>s43lTYvg;`^*Og;I)?MI%)@QJa?T8+3&V669a8n(2RU>;GS*>R)Wwe;qeE$xF)) z;-hrFsB{{zA%aL4c{oO;yB-^J<$7(zJLdgaj`5*Gt+!*lV`hrM+y=pb>D{f<|JjvM zS%I(erBTvk$$gpKt-U-ESw5Jb0Jl5#=OE>&#K1q4fgXiDBIx z;`t=BnAtJ*zprM_0H&2RkCT#G=KhUWgVl(_e@E|H)fp`5!** zf2i@4ru(4!>0!WjKe7o&u4YpkwKBB9WgZXnToK{($$`^yw>~zi2wf#0Jb&=~IT0)= z-=}GnE4r6@{SN~|Tqi2<695m?8xv(!*q1*Zs945ptKp|8uF(oGvqtq3k(qgX%^_(V z7`B+X;@6{xo)%oi2OKMjGWeNTN`1N*W@$kihv!X2V-)96VuImG&3480B8dcP7`Hk2oE9m%Q zYWIxdObHQ?-2ezN@Ud&=J^B?pIdv6xEmI9S+7xyBltymF${8O@$u)`O3;ttE#x3pA zLfJe%J#Pl>_3c^?+I5Gr4ZqsEzY9a!E$%?*sOWnRYqJIV^PH+P^(Jcb|3l5I}b6T9|e1 zT}OnxkXm3CGP3?&z$9(zS3L^dkn7eix5&B2vb`U~285tt71af(UVc~_()}%Vu{HMi zTQ%w=>>Ac;(}FWK`*bgtyQla0v@`%pyE3Pz+$X4Q7VEjxvd7rVWQ1cx%02WTd)yIG{za4ymEo)mXef`>$ z>!<+n>G*(R zSfnT@Q;6dW3O!wh6QYJGP7iXk)fr4ZqF#z4LDI%Aq7R8MVT`jl_1eR$na@sB0R^UY zEko~8BcFmkzvYjjC}~DOpKlM&^Q|uT%C^n)XZV6!vk=e(MM4=R=0@>1cvrE+IJTzd zF4#4-rz!;3t=!G$S+$ch(79^MlRTRv_#>jdMuzi+%hg!wR%n~w1_md?=jqhgDM8=~ z;mDQ%wsU3G%avXD?Qfh`p$8;G$V4?t2W2pNqq5kez_CvXN+xH1qY`BFu?k3dyJxh< z* zWk0(?|5<(j`${ z>M(!^RgRMi#*X*Sm%$K$i7kNeccT=DVZ~Az*2Ys;I#xl3g6XP;SwbRrU~L=j5uj9= z^7)ov%P#Ph9xl7i1D-~dLwR_;v=(~_H4w^b?=0{PQZF$c6X9I$aF9D>D9&M&vn5D& zXz`|CgR4M5&g%kb!XQ42={g>Tz8AG7fKAuQQvKgTwhmF7a*y}sXdXW$b3#kzKZ~<>a%g;= zhZIx~Bw`4Sqn3a)r!gO)B5v7eYM6ytMDK}ZtvI%6_*$mBw&KqAxY2NLgk~W-jSCAq zLLe0A9}68sxyb@+spo4L4ZjYZ%erIgKd~K280KuCPhDPzyl0(%Idz&Lu9-X*!xv)T z*nL*;l~=@s1(@;fjLeYis*$uT{GX<;mLi$G-t^cIc@%qJIFI zT<+Es(C(%p0VRTnj&0@}7?lu2>YvH#A6c1^`G0cNf5^&Ca@?{5^axuIRMt|&mebL^ zSgWxBVSW@E8+}2{QHg`(41#FhoHBF*d9!EPJ8#=vE)XpETx70AJc(mh3C*>8%Bwiz zL>Pyl>a+9qc~Im#dKog9Oymo6lwEkgSFYs@Ufcv1R~NG)B3oykk0ccpsf0EILetbDS-+u&=jxaj+ZoYQ*P*Z!0(IrL;})yi8vvJ|H0@nb6lfRP!L>Lz72ynUXO>t1f!mXDWRklXe| ztb8e|+LGdx#gcxo+^G|6(&8Mh{`DeR{7@U`0i38{bO}WaR=&;ya~H*+ zQ267EZEC0I=aO8fhf=q>UmE{-nXo5PuSvA{!4r!f+OmHd9~T@83N_E*PRu^Lv_nTbb0U&fUw5qjiFx+T{Q zR)92oDR=M}uI#pMEKAFx^IwzZ+_G0Jc!I9|5_68Ya@$O@d%_o;9<}1)VlwFtE6tRx z)113kbvJZH2B(b)4mHe+y?I90TF3a)^hV<7=pu=em=&SFdTgfpiIP7uBTYe0hJLR! z3>H&$UNi6N^dFaNE4kx-R$YCT#AeNgb6pKpY6D>ngA&u|lJV!}X04OFMm2}migI4& zfi1x0Q)>IK2RIK3E%I=g;w$mMYEj62)68Ht!TIq;mw>j0UA?q?Uhz#l%~W-q$+DKK z3EySMVCA?&sS*mD@eRiqgr4C>xyX?<_Om`ERElkI=wRAcu;`pRp+iY@>1aS%1(U&Y z^nU(iKv6&}rlj8DT5ea(L+YtVl$_7s0tNun8Hf@n#WsMV-4EUZ(+A^ca$UMgH#&v@Ojyoj8te*jmVx8p3LGiBi(@*-y+2^OKT+h`41}_(v`ejpY&lk<8CdJp zz~m}@mCNbo7lNHI&rL44n~vZ>nk8+j+kP=9jx7`u*XOM5dFKJOZLg|sWCABR-Z3gG zNwiyI3Zz2LkQBId^hxvt4`g1kSNz%F1G8Qf%w|`gT zXuaKv+v+rE6_Sg?WV6a*3H~0!HgW(=7xr#?%NG$NT{O&b;gI#8XanPqAs57S!!u;M zSwL6d6Tqfi_}B#k97?1y`~JQYFq=)JW|p6nNPaDt5_A@7>3N^`4maR$*E@9@!A)P4 za~jyLqp%tRf+9E?DjV@fGl!x9p*B3rD=%$n0e85$g@G`XawHe7ShDt|qM0K|{*Huzu3dE_O zR;B5WlF0>nCD-8tCh6s184IK9Qtmc;gPZ3YZ~%pcCRh65Ox`&Ygn#0{*?@k@l`2Zi zFJU-mvEuwC+0F-ASNU}Rjbopx_-9NO(ocJKF*~J5KRnDzm+jWB-Z$6}s!vnbVM*X(_0s+hMIMEPz&7N4bHU%r0{jVyXmhPl{mVo&0Km zxycTIKW`Ej!p>V*M@DhHjho?cgMc=jdgZpQ(VXQZaK#MHHaTX(pSQIc*>o8i)mjxn zNcWuOM_Bb3Y)-)y5EEQnDKZ;4G(MFT!6x zhU^I3t380699RVENQ8C^TpzP0#UXg{1i1U0Hhq{RNvm@?mgbJ9{zIvumxQT&L}j8` zmQD-cFtIPC0D~YXfdcFm5t_a)FphwpsvB?UnUuRJCn_&85JskuTOrrn@)gj;;^q74 z1!Ipc6lhxpVU8ghF8X07DYzpL>btwF-Rb^>>2IU+1Mo;Lo4;eB!kpUvxeIC=uCg~F zn-Jq0Tr~d>&t-yx!OZ7W7(}OC*%se`A$De|PA+P(7sohOa_jmXCaJ`$b3hRBn%fy- z{O*F=>}2v6xq_odGqT(P!`Td{!zG>NlZKQx+Vrxmn(YWSXBT%923lhF>TvYVZhq&v zS*5RBn^_~^td@dYJPjYU)ltHXnu;*j=tV!b7_)dM8thzX;61-v?tRgZq|4kq^iy{n zQqV-xWWC)7p;~YDn|a%P0#;vejsbJ9k}R8Ph-o!;cNj9$L-Mc z>~pyr0PJxB4jwI6SN!AKeIGm1a7p0~T^N+p#Z}N!`quXZe!fQc8hOh>Ly#Y4h54O& ze>U~AB1ALWbv25~d~n~dwDajc`u*`#yH}>mU`fcF@cYw-B2iuH-RR{~hmAWK;a{1a z^`Dn^{x7!B)FfjLTK^Y7@RkNkN`s1rSYjj%A6d#*7k&Yfb#;nAd5yKM{_u3}db&my zwSrvD`pMD24+kc0NTm)}M`>>CxK^Ci=PP#8vuD%i^~{2jjW8-fswm?lBx;2I(~H7GMgHMpRWZOK0~dV& z(;e6Ys^B)%utCYK(q52k6Hg01f)Q0|`txxf@wH| zl|X0SWkK0rJ<{K?c+8UBBeoZmV z<&-Qmw9=33D3~Lf%u4MG)JuE4H};c=4fh6KEped{HLPET#qGokH687y4?J)7qtq~C z#MO-xUqrK|)}RNZMuv5}DfwC9(6AUU395()P8^cL=!9Xu(?oDY-qUtCv;T=uyS{N1 z!5j57aBwmx5~@@Hd?x^YZJqKBl6{P$B8*p~Rzf`9nHy3v->+2N_CV82rgh3RDm2KA z$=y%&1RC-$Y_4M_3k@381CGH=*JPXwtcSJvM01A~~^B zO19r-A$zsk#bMF_Y%ac~rn%U|=#U3U`uJx<+a81qS+y&c9hPoV4VmqhM4=ZrFdEvc z;iu&c=-wC_ve+i(r~q6MG`@vh;qa47bsG$gWv_4OJH2@(LMydY!zcD z0_)~?IA=5Vs+cpkx;a73UqUnnv~V*t(a5tv)bpJ4_w9sz|LmGQehhs$SH5m;@18f; z-FvhMU%*G*zQYFi_Tl_}btLdZ+D6daMVOmzVU8s@HsS9i+3Ua)0w+eiOGh+>7I430 z-)>WT#*7qsxqYQhvT*Dk1K_(wr`AYPo%VZ8=PR*k+liEwa*MArVa0dp2irf0S2zmh zAEp)vYRV9F^+T0vU}D{?(Ps(6v0R)$aCt=dsE+c;MVPXj{R&mH-j@$puA1w0A{dnQ zrDovf)Tmi*)c!M)GkoXNs!}AKh^CDl)A#$crt0tOC3y$GDhjH+Z_1*?A-x$!t09wt zVBSpJ{<6yS6Z^ql5ohcNqH?l17Iy9647U9`j%LH^@ir|lFYP9Kupo|q*}fbz;Ua*Xg1uNsK%x4G>l z{D1>Z`EbQBC$h9dg1%wWAhF_@MT-7ops>w)N`1}2YpEPtWn@_+Y2REM0<2$80#a_y`=*jhy&9i{HY=K0{Wqpe0F zxX=@ENptri*!Bsdy5B89O`pp^hOf3HZWG*)pqYjk`Sor}@C*q##5}{3(T*T@$1-6m z(USP2P>tP|4B-^1JPqrX6>??JElZtP?>kiu4#ttmE4BgB`Rc2Zm67iGb6$0UR%ww3 zsW@Nxn_Z3SV7kPtF7sf-` zXN)&MMvh=1lBbkOgj3(?wyKgCDR$K(^&@yEeN=0a0WnfBaKG1DQ@&y`4)O@+yQ1u*3tnQwIT+2L4A7 zq$Jy7)vPeF?$5h0LoY}8ym5I5D$j(}{9?o>gga+trQ>m5qKQYyl5v-NFd^HtLKp6N zf(zI0SEA@Wm`M(<9i9h1Z{u5hG%gonoUU&H;>O4(PwbgpL&TET!2RY zVoUH!vvKEKQP*}tXuvpm+4|DnO!$Sy3g1a2S592AvwJ`)0CWa^xL6S%y0*{nH%>(F zJa}&U=S6wag~?8~z51UyX@DT5Osa;*)TW8Ty2YDu8mYJ*=MhFEw}t67)bUMo>*e$-Ax_@!#NY}%M$rnhTTxMJy+U- z>u=tr1)4&Bh)r&rxw~z7gXVGg3y=JmE>Zbke-sO=+$jKxWjnT6v-XD_-%Uy@a^%wFFuaOXKtTi_x5Bd- z!ryLx?P$?$Yp`%PCOkI)sm8J0JbrW?0F*UQw>w&6Tw(#G!=TC5RQFJ8zkfgB0t|*g z$SAO&4Dd+9)*vt5F7?FOf&qFXSZDoTQ)#O+^CMCFjSG6}TQD@kS&x^f&IwnfAX9-(wM5 zYO1Tfl+I2oJH!9VCf4g$1jCaZfm$uyKra!(&`RTZew}a1JzY0eKx3{Z<19`@3QNLN z;AfuQFB_}k{N;d9z^sGDyPvV2uJrTDznhPL6&mX=BwL|aiji3#DKx;Qw*~#Rz*5x1%ePM)gREnSN1KOd>U-8>n;tg-l8p$&o$@LqOCsovyDVO@6)cffpG~hE{AJ>f*jjR zc9R9bgIs1uVt2u+6R0wyulTvWWK;&plpm&6CQQ`&+C&fM$@lL;M}_Fxi{i-^a+I*p zB(7GroUVC)9@%+%8YLy|ulm6|cI~)k-rx>IL?|hKEq>};36A;gWDEvD)dz+fb16XG zN3-R~Gb4Tgn`BT4sy6RiA2z?CVeA zYt~3_%=DvHg-~v{2v|Pl1khjv^eFG5G!3V_W>to0Z9&aq;%ze+;C5V5V-#mpCpW!SXKWjYU7PwKpiV8Fysy$A8@fkmqzVa9%9Jf0hHKYu?u z=jqd)b?I$f$|)Y@zWH;5&W;$Z!M6pAU>1h5MS$Krk0V#<%hHN0K%jb)x`E08qbrXu zBj)sj>cZ%@d?scJd0{jx~!F?$sr$Ve@0nsT?;I(L6o z1X!|Pxj5c{`yey%{`Dth`t${47f`()f2_TpzN}=B zV`SyQF!lO8HiLYJ6~Y#CeJWAv)is#|+-(aXp&4WS9h0ZVXE* zW;?Gk#?PD2HZu@>NdUxLk8kbbjY-BOaCcY0xB4U#Ysv$-)Qkj7D%!_SqrzucyLi?W z+45Sj_q{#)T+a zEUBU+H6&R!=jkP0Ni#Ka(>8XqtF^aT^P5Df`c3eIM>5(cr*WZT8Fao2uLqPDEhUA3 zyZHc|E4Le>9TlM@C4#IzETRAbvmIf9*mGkp0TQ&he~V`_%q>rO%swOFGG77I-4q~M z`>XUvt$3LTS|A(nb&o)PD$a?uUsM3M%Q*Baw|LW}`Zn1@s+@zh0|0I2#Q}e7f?<>q zw&V&hDEaC8lNTY(jI<44s?9bAXam`-`U=QX6rIPJl6<7j*Ky0>?xM4v+6_1;A0a1n7Y@A){{Pl&M{| zGHvc~z3kU1l6F$uaXQh~xk;3-wICGnl!ZTWsxYe3w0i?TgJNf+KopymOjLmGKMJkC zC)|Qc1Yb(Uci22*4sLZ-u8+E0)U3OcC(4t9eL7pcCb_&4{L06bi)V*(w-um8Ec~#f z)zD1HBwX4*HahJo z%rGkyCvPO@ELB}8FVZ?T0z+Hr7PHiBx%`#4;-AD?<8-9RD^rwVI&0xWfd1q`AQmTNqkve$%zTID_7 zqMmT7Utbs&H!jwerp3I8_}`5Dm+OC@ifjdVR6Bz6yiI}r;#Q!JC%%6j{ERGG5 z;}|D}a1+X1NDo_Gqu7=oN6UvuJbIK*75xPLrSRm9yE00i#}~`?!aUktEE@_O4{p8zh2lA8Y(Uzn-ulzpiC*98EYRo@2Pije z(%`MB^98#=bZPR>*!3?6B?IGshEQIq%G+$P!+77++;+8{Rwfv()z@kGY1F~7!?5d4 za9erY{vlzQZnBTxs`~LxEG=|SuQpqGtUe`xFEk1-9F0lD#F`?)>f+ADetbIIU0H|} zjYNuDAWWakXO3Z{g+w-D=7``K?j)w*_~d#s=%RQ}rI#@Kl$p6OTf!lwIJh(0k?Bxx zSq}4;K|~c|O#7Y0EWu6&DjIZi-h+BMX6R|}_z1)qt`Uhxc*_To(t!|SLN zLDi*%#t~k)Ag08*WWs+|X(V(frUoo)Qg_Cmp{yHd)^$#q%Mh!Q5w=XqLdBk0e%>TMbMylcH2 zD@J*`@nHgA4%$)>@~EpVB!)&-P3uH+MK_1H5dvC@i1ZRB2myo=n%Nd1x7rCkS&qj`3G9q#UzROfpDg=W7eSD0_qCnKid zR^rS&QL=!=j{R2$ugt2UK8b!;zSSEZ@_d{DvVwxxUWkxZ3Im@(5B3FqT^tBWXa_%lRb!$t*^oI}zsfZ( zR}lDG4XU}HRV}jC>jd39wAY&{tt~ zcPun|ufxahjSUsfnG0~Q4j}|+6cYqInZ;lJefQGkQ`VA7Eh%6l9Qr99XvpFBF#>$3 z4Z-0JXQdwlkT&o&NAWPA9S3d8z2j1|8z}}c+vPEI=Tol2MUDd2wU6j$TVmX|JJ9Pz zd4oxebj+E(g-2YI4J!7$N@qRbH!7YT;kARMhybRHBvxPGGSWvk0|;KZs?%ZW)PjwF zpBVawM@q-GB~a1?krD4Wc8pMJ%oFLJ1d=2mM}X<&3Kh}Tyc zjcsGsatV9{t7GCw26&dXEBuBF5Ek)#q-R67iAu=k4;X^@5U}^By^QHN-p9d97!1GX z3qh&tyBGi$dJHEt?;vnniTD}%jx~|vdXZ(%EDy&L`kg9=PDqJ=<(N6VkpuuHL>H71xswZ^x%&L1LgV5JYB-DWLHH za+J^@Y7FTBUhpznn;+b-?_=P;${{p;lo1d^)nd!4`@+e47nkT3A_gc#WV?ZP^l01a z_#%VIf@X97)I-<g77;m6=gSHDPjY2;AiC8q5Wt>e4rEAtB!a3_CxA6B8Ae$|{<&va8 z^5Dg*)~*U=W|*+--)5^96zG&bV$e<4&~sryy=eG?NJJC|M1Q@Sz~p2=M+it5qL~YV ze6eIefJ{Q{0D$$D-9Nt|R(3!ULQ&9x{inxQ2>cZWo9TX}it>&;SDm&CH2@g#A-+*N zXX=aUQKJF_c)0+=aXD+NsEH$;uk8$mkF&Rq%PZ}D3jY}7YZ$zw8F}+cChN8(?1~$P z6ireESxc`E?y_}NOVsEmakUMtLW?!RX0tE}5kI%K)MAOmE$DXNA}wmZO?lNc1?e$R3tV>yQE0<+=7@2kSFIvUt6DW@>H1eK9U_E1+6*Z*V2m_H;iU~H# z`(q5^>ov-e>L0hFIt(<4U4H=%Zp4-M>(5ZHw56Ap%_Cn}4ier}ax9oL@IDMA?p5dm*&$l5WyTIl0D6 zvp%Um@tGShTTbqC9idgvOe=DSpV3y+VFXbH(6_95tz1F) z?kfg-gwv=oD%bz+1VJAX=DgP}BPGyN7{PCsTXinAXO>Fbm5B3aa4ndnY-jo4{jDu~ z@#gxx46)|?qQiZ;AV3a^Xs&tgX^p!OQ3Pq34#A8?4V^E8fSI?X&2CyQ6Et}K^Sv@| zH*^)o)YQl0X_BmQ1=qxCR-98DJ1)x`(SA2VXG;_QS+Fm5aBt`%ufh+dfye|4jVQV- z!zu>T%EnroWiFHC*gN+uW$9P+H2q9!px80#MnqA~{1!)XRS@M@l(yzVd8pW_T!^-8GxRHTZJkfc!+ zOqD?KuJ)ap@22n7<|c}a7Hs~bcRaF%B*Bfgxvjh_u$8aobLSKD()5v*zY^DXhHP49 zSYZY1LZICl@weQU<+gRJ;zhaLRm(wfrYQ+jg{TPgsX!Rq$99+GC~YY9syUO!Gp?br zJ2%d!X!9NbyXhC8I~#RJ?%17TMu8bv!$_DucjI-)b{1j>r;7;Ns!G-x?9))x=DEIB zyPip~!%A**MO2~?BPfJzf1}D>S>?>F9>rn1Cx+BXJ6MTiMBc9rWZe@o3AYt^c7)vf z158vWUM2W$*n{n+uQ#&sqiQVl{NPpRVw(%HhF74;>pA+U1?UTtfu7zne z{;5j*KI=wb8fS{!ScUHIE4CGDWMgEQ%i?}8`ZRJVu1U!`YTy~fgwsaoNa)UVFk6K1 zH3I{U_F>?dEi|~DH(~ILo!O5i$10U!{Q!sK6y)9ol`5Ts$PLa5#&O6ZYSx;7q=>oc zS)*#V>R>?++)aE&_Q(;h2H9?qzyUH;ygJFe3`E=ET7W7j((a0AB`xPC&}lNJyLRp- z(m!QE+&%B-s2=`Fi7?py1L~oHhr}mtFmr~*flPhvTs~9#uHB<<_`pe1+fMYvwN7A# zeQjScT^0d(S2NSu&U{)->5$+xghQa2)w?>nu&VUMJG1?8JR5a;!Xkkvvtwc8o*>_| zJjxyQU_}@@KEK&I0C5U?vTSauG~}DA0|0QiB7t;M1u1dcoqhh|#ygtVR9+oayIDf+ z%lapIcQlt%0qutSWBe^8hSC&Neoa*SgN9k!pRbpg+jNfM3J9+?jUeN9Rh^r+N)_97 z#qfG}YplM1^muhgAZn$8^JXN-P5cHPsdHuc4GtrBEC7zI1pmX}WP>z}#vxCb(aBW+ zkf8w%-a!gqCpFA4mp;{rVPG*&kA&g#niAMJI@T?;dK6C2!bz&ZhZ6?u%d*E25>1>o zTNmw+iaM5-DkoE_97~-7xk+dMNmwt>31bSU)@GIw1#eyrbwNNkLXw)!M-!h^UKH@HZ@Wd&hP4=(wmmfD-kpb&w2wP*)R4HvRADymo7OPn@Ib# zY@T>(7y#r~#+7;}(X~+j8g&0^3WyhP>cSNMP-qXDB4S<}W?oosxZIjy`fOz_L(wK0 zYjO*S0K$BGE2sklJXWHUxrf-jtZ|%@7h+~d&y(*@HkB=qB!!iqm4c%*|4_W=pCRM? zp7vm*bUCX5%m-phGLEQ<64MpU!Q%EPqyQKUy3B5ki7%ukAlJQD-OPQpj;j8 zW-BCj5HkrThmGdrcS@y!^qYkDjrkl@QbMi}ow@t>YgtcK^<9yp= zk-#ERF2)ZM`vrbBH1wpyTJ40UDK6sZ=LwLAY`vFr3BR4%;3m}paXd{bM0J>zVr11c z4&DEzq_(DsHh#z0$rI=J`4KC@OFaR(c|dKJER5T>K%P(_xO`Pba16{us{AJ+-wTgNt{gd4n{V5ZWK5L>pyo5j{#FVr3(a@EAhRq2;cddG?fWCLrOflf{y| zuyWPlrRM9s1de$`FVWGejj!nKaaGg|f6!kJosTz@u}Cv6asw_3@rz)p$bfNn!uSdC zWC9sw*51XoM{OIXp`;$Wd~2;6rd3DIr>Ee>0-U${V|gZUBR>V`NS_@CRxEt+5zMX< zBd;D+);%*%v&na_FHw~R8tPi@1FMb2df0>YF&!-syHdRSusEU^=-#e@xD1=bEPvoE zo>+{(Va0)sOyEJo$b_^A<^;qe5uotQliwvp%EYUY$!`o}OUr9pqq#5d54_geqiq(? zx{Fk5>cl~Jq98aP@TCI4bddQ?3cJbB_I9S!0jL^VI7oY9RQ+X;sE%8&#_J`E*a^$) zkLLKDQeL(55yCdM_M(HW>0(9YDKoY;rS@uQDEMkd_OhIK;o*}Jv z_qUoeZ0f}fxAK@QGLF<#l#1sQX}8U2FXje5byZuqEIJ`I0- z7g4YA4G((=hATJ?``+3<%c4iJFOCvRHFvXzLdP{4$k(OT7?SD-phrMYt4xL`Dp=*~ zVEwmg;fan2j~`406(IbJwA%v5Qa^LKE&M`5={?@v=idWLPoV);A+cN&G=;J`7`M`{ zojI>!(2zU%I<;@ecyL)br;oQrDW1vc~AyF=d3As1fMT&in?))!aS_p?KhX&f|OPu&#a%?BZMnbMZYp zJ#TnPftP6itWa40;i6$;`Ohwzzv_^~U)EFi$KQ+GE2Kca_yEt!Cg;pqX9ng)+=JYF z#D;p*aZq^8Njf{AfD(mLYtftuXUt@sXgjpeL0UMQAndL#{_w*QYhxJ`fnXp+!*wvm z5%|aa0-%J{u*Pn;422Z>r;j&lGaZtBBcZyH1H6su!an6n6%PyKq|Bdrj8pbi*a>Y< zHrQHa#g*nBzg}zk2>FF9*LLyqQN+(vCzIcq;|U>`00f|LlQ|)LD!0Ci=bLD;Cf2T7 znkcL{$2NX3MgKu`vB_r;@oxYqNMszjyR;M_??)tH4h3@*UMn3=1pOUFE+g)$rW_qZ zaV~C&a z0Eb;c-NC>XRNib|eZQ&7u~mL@L|aOj6B{p9TX~B4#Fj7f*LP2HePx zGQyym_-5h(+N>?&KOnF}PDez*8J(+^O}gjN;{~ejbeK`zS+>~D6JkV7ouS^5Fb#Wo zh`U)dm%YvD2Wm%o{;b|)ub`l5Acgl^{!Ue-BA0x4vOS6DT)FGYqDAp35sg7)*HD|p zHqHPmyG@TXPk=HmkrNfS0Y?7}j>$dsUJ+t7@rC$AhA%WMY8uO-L}kNn^w|LY5?GWZ zOek?=w+={tzn8XCWevhx=kc5!=7gXSV}vD?E@9h?|0C-WB&M+!F=|0@hcjaq6u3`+ zUP1k2(?G!R3ew4kvx}WxlOw&Ji`P zFlctqxS$Zd=k}wZ1Lm*Q1r0_}k(DQ~ym@^@W?PESM%$MXoINH|6^cI&|0y8A!={Bh` zxjwW3Xb9vqUgyiJj4KB-M7|h0aKAgy{rlBRhsG=Fe%Im~Zw5;nh{Ll+fx<`USSI~z ztWm0$zYQbg1vyS!4yfJJOPlATrra@yE~=*cL;k7BP0@OmV7oLSh!qA24M5-py+nUy znsnjnQmKG#ZhX`HWIDwvu5Ev(D?*03MtihJQHk&3uB+hCwNxsYesRV1gis4Qz^HY# z&t;<0!o3#4LMyGlN=2ikhgrCqimhhJy}_OauChJ0CBc3nwdrlsMY$GOUR(_Ze zW-BOS!bK&^ufwaswqV`2m%G>s{pwhRU!f$Uy6S3AI<9J+3+u_4N3<1OvQ?)nAFONz zZPpsb?{eJ?gtUV3BAq97yKKDlO~M1ofQ9(u`<5iP+nK`@W5uZ2PjFI*9o)L*`D}KC zl>N>O0B$z~e7L#MWYdkVLAuiXJ#E_^B(z3Dba|s+;iPKh+!6ewt*oKmG*>y$SjVHh z(vpoTOLol7CY=PKi21XUDk5%}2-h}OrKwv-z|Z`{R;21v!zDh&I*@gB>oRN3`Z{Z_ z8X(uUVfhU~4!h?7DQ8F_>UR#~-6+Hs-Lic9qgvaY2s*3L6H1OcsQK;hTH&T9fvD_p zIw8400yQXdz}6T|_t<#v%&bq~B7wPqe}rdd`hU&dnVJ5x-Qh^}{|nEhjfjzC{H$Hf zX}`0kTeHL$k7Ez{;$ovHgw0=X4|YuaKuP9{j5x2Dv+hpub?a0;J6>y{V@1#rqqehW zJ-&5nWMpPgVvzFF(B{mM!`T05B9ktdDhc7C^Hy!NUvfU^Q()+PrX_iqWsiyyJox44W zFA2IQ?v9?;89WC~5T>(4ae~Fb~l0^YjT+SC{p^;3k4(=PZwyYA6 zU3J?7Yyu$OD21FK2qw#+S0)6L(S3pa02M3Owwgq00o(ksJSn7X5zolNUdwTLXxIW8 zMuMGax#UbrHOhbmSeQDhDkLcb8MCIa+L%^?j3J@$Tr)@E#+9|pRXX?}9*UTyDF^Rp z-^E9^(itPefF4tgf7b>@pQ5^=#=~Adk8ifnz zcEw2t^=g3*@zM-Z-=e}K6@Qb|@5Fh-CPons){RYh#4WoJ{sb@$cM5oy#pvhY9@yhj z=3yl<$IAJEYn9|Co~pwwR5QHxwaxCL`*S4F*Hlc(*U?phrMY7>efn4@4)kroRULhX z9(q`S2*Q+PfEz1lV^TS&V#%6#!*O-dHm1Ek=wK2D6IJ|l&IP+5x6Z}Ni_=6nj(tux z&yi7XoqtPV-Onk}xu4IBtiJ$)%Yiu0^F927)ag5`;=vW_#{Tn>y4a_H^32$={L5DL%`C*WZh?_6Q<&3n_7VejWcx);F@BemKAg)?Wo_{}SdsLWWy5VLIKRPq z_hqN7jK{*F1`dYX30VDBb>lY)yumd5&rJ>lJ=QXu1-|OVES!joP9kkG8YZ4w2Uqor7#X_ zw3>YeoosXZ zO6gWp&s$Vyy*2lLrbeV8rEEc&T#n8jDmcowFR!P^qiAk2n5kK^4w~vPi5HSW_A!bm z6k%UD#(aJ~6?Z=Xt4fOQ11`T5pboc^Rvd+Z62~!kECOw)jP!V#<+Cf2#v!l>rBd;v zJv^KrLI)qE|I4}0%*gPMQkmnFAsMe-=%Iy19WPT; zZRg_lGg=v4t>>fjH~1S8u`Y21d_~1D;ua6_>ZtyBaeIyqJ3Z%6v*|xiOIC^XQ&THo z^GS8Pj)^<`&k)57eoM^I?5 zhT?%V@BlXoxn?sfN&Fdu-{G0GhS-~BJ7K#(#DT1pzi|)~a0!n3gF_jcmzicELLhw5 zFz_agT6~VlN3Y=*pAd9F!g@W}UMd>bGyG_xRAo$`NI~T@nxe0rz&8tWw6PhsJ#@&V zTu5c1gvsv=a}FhP_@}b$vsOvES?x)oiEkiHISrAUXdbSdHZz`Ux6_3eJ6&WJFOVH| z(k~mNbmTc2zI)8etP-2xe0Jh`5;C_3_xHE6tLmnAfy?63tR9dT`UnJ|q|6uyg=q|2 zEz3OMbfS_7y8(1^5zvhJQ>8c!)$9-hU*0y4)yZBS3x1t~Vd=)i*ybj>wFHn>3sh7sI_ z2+Z~gBJfHOl%apgb-U2_R?kzs3(5@x{6G<`(G(Uxelzhb4Ju(EXu#f#X;2o^{)pNZ z<-?F9=9^hr30Y_HR$#He5WUVQJ9j083q4>?^v6#omq@u0Sq!Q+(l0z7e_vb0J!^F; zWhCDUOBZzD;0Wu36zb?X1Yrn4RAL;0(nFsQK%78|vj0l$j1_^IbS4+cy)WLh1b@7j z@%n(+dDUM}rIKx-OQGNN0oI|tUrKR{a#|5-0oOU>vW)%p=B-U45D+GzEoTA}06jn< zlPcO;aaWEe(>w*XT`!U6 zbR3%=EfW8+^ynCn!5h}-ME~W+w*&c?KDbYk?w!{PMgWxiR|#v|`KCOT;6@XJj2bL( zJra^SME}JE(>TKhc=ddou0*V30tlIOIdwkKY%fXzyPf4vGzxUNWfmh z;%y1X!ho&lfsXrn_YoS8ZdCV3QD#Fof7!BQoq9`?DkBKiE&(I@ZsuRZ?t#ZWO1RZr z$QB=&^qWg%%8I62>?vL%jfk4JMs|HPh5l0Rxws z^1oeL;h-OBoY?7^;XC|7TS#n?0U@74M2Jcl)Cfzo=vq$QyF&plJEvaJR1)j2I!lW1 zGhqRRE-uy4NF7ce4;O<43vk$6lkGT?M`|TD^wSOlIs+}TD+zJ1EH3ja8`tnxBlibQ zIaD3c1Yj9fnn^qet;!*s%+vw^VlSffYvVzUbMX{}s`zlTKPz>gt_8`WP^>5vd=J=HXF?7Uh5$(mm^du_h!YkFrMM#iGlCPHD}C4ntgF!;OAl00 z_RyKL;cSHMSG3`-E??#?2B*1UZ(zh2Ej4z4^#< zDmjR=ce4JB)5VLUyU&L+R*47GZfU;E?9McANHR!x3^+*}a z+*#k}+xqp*IKJI}WQJU}ES_k8HvRcM&3#Uz_okx(mMSIy(b%V&An^(G;MXh*L4#|6wH`HFxNFq zanVriu9G-{RDC0(w!!i11>q6)YZvh*EMu%)87MJ3YN|Ry?mA*P5kaE0$b^K!SQAcs z#88k`O>8#Y@YyTPGsZ=cuW+6Kfg~Pr)qrNe-sVDyCQtQ(XJ0bA(wb;V~ivM_GkLo~4LTia#Ag z(Qfc;do(r=@<;4`t`OB_gs=8x8*~;4MopM_k%m*$mZq0`Rm!L}jMUm%+WN4OgdNDYNmMwk#KVdUTvt}o@l`|F zy(mQauFlMbB@~r<9xJAzlC_n*wxAJ=T_(OXi*(xiyhIf zY_^GrM>_m#zqd$)ou(M#ZNw&2i88Fjh#!t8zsiH`;)wPdGyy(@uBt$L_?VyLhr5}k z0lR4WCFof*NBc}Fl6b_9e&tp) zlA#pn<1;gp6!s|1+M`csL3R?ESmI%4DrYN&y$|)wO?R zXhe@+kUt*;gAc=}9p!uW@|w@SrRDh_svh$XH|l@Uq}c!OoaMg&bR4S7{L3ZL`7f75 z0pp*~txi=7%Et>WO_c#s)&yXat$o7jC;I$Tl7?z!@oGoJ;6j|g^Q#b3>6bt zTj{FX3cHbf#ZS$~_?7OgAB($^fT=Fi$W&G?;c>SviL2+OTXtY!&cLhGY^WtW~ zrvR3+fjdR<0(|C~7-$ps96&~i;*ooyY>7{0cavs^RDdbT^iutreZ}(q%+TQU^FZ>q z_JYk|nGS_hI2mCp(-*XpTn@=FnW%UG86y0rk{b=)u+2qq_3iKYmD}^gqoGjY2R-&y z1hXLx>ZnMeHk^IN>Nq`i2_c_;c^3#t%Cr;f}UB=-(jC+5ur1n7C&J7Uq@lLl51g2f+$0_QBCT+fTG6TW+O z-?prCN&!QXLN2+?GU#;=&v9XsdV+4fwTK10AMzI4cs+%c5UN=lH;o=H7$Z{*mbA66 z-O|{}8adA(*f+{t{(#@sNu{72L{8elBZ=4})LjUikY+uLBxISvJ9LOJ1Y-?)4|f<= zS^^L;Hekqz##^E+w?U*7gj7(SENzhXm}$iVxIld*&6dUhSii&qY%}c8eeQYJ91l)V z$He>K4){hsP%Nlm949u)y<&Y$t-1OQVF&uo=y;CAJ6-^Xz=-@I*J7HvqFZN_{+fbdAO!P<|T2mCB z*?jrix+Kd(E2RfU3+vWkM6#H+qdEMpK!&@O#h_eWBS1b z{?GHDam9;2XYxnG*ZHn?ast4TdT`?y3!0850)JU$yE-V?geq1-U0B!r>v`F=L{2dU zXI&x^7D%{=2OAFW7HjmO7$*Gfe?jd_JbD)RiX+KnKivSubrZK zATDG2UawtZb~8#rvbg&KFVR8a_vxJpSd`qcaU1QOVdBNuQ~7%Jt3xWNC+SLs=M4 z*p!|;^8BwB?;`ih>L@kyOxt0gCs#HjeMCq96{WtkP7qI+ulK>fe1V@#BU&;o@zVsh zx*^;o3#>gEQhwWmwis?OK3NCtN*dGbyK5iKJJ1p({+4sRysC~s<===tBoOk>AYaVi zTolcwC^<&tf7!{T!Vd@}Vt}Up5CgrioZ{k9G26o5p!ZsnGwew>loD&6l+V4ZJG*YAi3=*fhTzqdP!iKp7LEvXT}c{ zMlKA71gC2#3^!4zN`%Y{2n0W}N}Tl$7u;>+`1uMe2C-7&;D6o-1xIK2=?((aQ%a3Y zN=wdWcAgnk*$Xuu;$(pl7N#0S#pGCqpIOh5KC!Q(Jr?8gu$9f0Q)`aDDFm{^K=d;3 zvnvru@-U`3rxFAr(`TJUV+%TJsxv8HpXKFcpq@KDXQcp68pwmuuZ4`1FFu7H8LfV% zT%}*PA(x5X?i;137N13kFsK4Cml@H@O2q5`1ZtKaAQy7m>d-yu5;sDlmSBd6XgZ7A zQU1NjwxUkPizQZ6pGFd$$Esm{JYIQW=)$WgRL(C{p4po=M^Eo#c4QfL##f)XSsKz& z++FU?K1%E+tr$}ZnIu$9kxd$`>F!qO%`wF5Zw;AAbK9P@)}7`JHhHU9zB&xQnrh?PIiz75;p9xSEB`Kq z0rmwIbgxuQfUSzM(+>ibz#yJe+kr3wec|OLCyt`MHFwGYXGHtBDKovRZ$MlA4*e;4 zUdfw-!^(h^>Y9Uj@gX|{7e~`0H(T{s$ejD3y=Fhwj?5XLdH2Ast5)#v85Um{m!hgG zcniGona>zx9`)CsBeqAKP(Vj&honeX%|mF*{C8a23y?QQu)?GTG!Y8g+5_hrtURpR zw9Y#fW$rNbYEDYbxc4Wjjg9JNo6Su9Ml@%N8t;($6bmV4Vrq@H!%_W4tL}wm?jYg(4ffAH6>g({B+UHhTQNVFv@z5KLND`g7|+FtU*R(1mQrJVlQ7#^+PDECMa;}EDe~K zOFndwA|2xOPR-fg;&pCno6M=5t4-Ec$13p!9eBCij^3SaEU%T*zQf=HHDzu+@?K=d zs}`3xZFs)*W8oKrSM#MJh4>NswLnJ>TD2`ny(k?B-=Lm(r!)W58vVev{#R?n$i((< zr09SC4G(H++3vTX`uu=6w0L^b$GHms$heT298{%La^ z3O{`5y?)W;)8si~H_l9yS$Hv2G2lg~o(s8;1bp-R!L#9QxtKH`vM4P6PP6cATfQ^^ zW#TlcS2bRi#mQp>ds$_@Bk0wBy}^a}X#HpM^t3Ur(#gYonUO6Vv4k9Pv=ApaS_|PI z86>BH8I2MzTG>~pHCW}*SSPxHB3!rSRXypkX>O!)eNB$quJ)a?`D!~nYSo*oDFW&= z4hgJv^$70vd*~Sjv4Oi7QAl!-E5NwZ#gma!4?-vjPjx*Rr{?vFWDlB;z3XQ3V;KZm z5utKokz08@%MqGd9ifVMHP?^sA_M)H0eo6Y9=*iSnd6h52vU2hoQ#-sn6i=5NiQo0 zgSG`7MTo8>dS6|h^1WFj2b$W@Opnx*C|ycX5gBN$gDIz5b$a?;XQ`V#zUYOIcsv1# zL_wDj`*jJ4qDY2BW zNN-il*L6*b$qHD=(Ygn!VL7#U@A!gyimeYrzhQB*uw^{bmV)TJHw#5HIdv&%Kp;Y{ zItX5DMHwStarFg_vV!=mFjUQOlsSN=N*4Q5{h$_gz zm9t?k0rE>@TnI$9ehcdUZer|Ay1it4eo;@L*ZS#t=AW6I+VlPJ#Cv85fwQ7e@|5{J zDH_9Fm@vKwMg$R35}dK#?*|x%^BY9epgqi@9nQ5(rP#@#3yWH1^EyTQgLwhUb8I}O z6tTVDffez^uoc`TX7QYjn?!LI!!Kp$?$_6%zUyHbw(`>-Q~$AhMwLUyGB_m ze<{Xg>SHR%!owHm)F_^*3u28$>%|KAV@p{;8aqpOZmKOMhm=XQA6x+v=oegQ6k^n` zA?M=NrdFpYXHW7cRt0D2q$rld`%nd+?;#T!xYDszA94uPV96YEK zuu!4vgx=&cl|aJu}UK&WO7K>rRfouVJ)G@vPPSnq>7T zXPO`5V@St6g)*lSl9B~EKO&8C1;Ah+&_)jhKt6>3`k#HoKyf@5ouW8v<|vVh>|m== z2TUIUhK6jOT`khrJm&Df&VMzEgh|39a{iLDehAiLo*p}a_S5}-3WH1pZB?#c=$qMc zXx3U*nK3uqQx+E;%WcrkC94=dg2$BDxr!*GqPkuzn|Xc4b99z~Am%fgdn)8`I;{*e z;{8Fy%%}yUX+-Qv?@10|k?>}rt+8jr_ZV?j9Nx5RYN3<32LbhsyIkpZXI}4H zI#q#rYiC=dSKET7uEK$5xpH@#oUvbLQCw9|c|pgh!xuWlcY7e-_F6R|t*zS$GBcR< zv!wR%CNvzv0Lr7(ra&%AjS%w|(^o7!^ytF}{1eXRI0q2$(?HJrfJ?H}J{mpB@f`by z|078EbNgpdC-ml|-yJ3>U+Y%x0h|~a$J=A+*6|Ja3uqeF!8l1p9q!n)R1ksYctf!!}+o*P^QxX)7+iD)CV! zg~SuBk(ZAJljLGK`5IP%X=GGDOG{c=s=gL8so!AB&7zp6M{><<-)#m}x%x~Ul0ma4 zNAWHQDbE=h*}l2;s6N8=pb}%N3 z0U+swN4Oc51~e5BJCffQsaPKNJEAB7pk#HHs^!wdUHUVrJTeSbm{FU)PE8h$7%0QW zIc42E#}R<(V}R2zgZK=JiZG;8q6i?`>r5yr(i!5(5L%X$GR%TUQQ<+A5Jo@b5LhY& zMR_J`e9yO%TCDT3ex)Z2;Xg>i9rNVbyzAj5J{bvo(KHi<`M>O8rw`Li7lZdk*aMJt z>MZxbD--R=jTn9OaVIsf_)--HQ0Xl-QPEJ*=ga(@1Xt>5iGWcZvhs?b6*j;s78-7n zd;CN^SMdoP%@W-qOE`GX`D5~(zJ@o41aDnJAI_$ZUq7VCD?%OlLk!6va<-lK8+Dhg zohK!FoB@h7`S^5nuXw~zl|G{BIO*^)DK;Sw`uE|<+9m(HYTtko20B-VX8s&cR zIg2@R@}s=>FdT@^hPT-dKb;rpzDl%@qq?I|QmDwP5nbeg&5}y-;6;cQ5OI_ec`6n^ z;yXPjh)}Y&L_Sd0B2S^Ys!s47GY0Zx8`^Jm=S%lA-OD#JBqPg!h2jK-VfWb>UWdn4 zcK=NPL}5e)5Wlze)eQoF4g=v&TAJpb8p!eO%@~PMoy^^28_!Q2kg$xqjFvX|NibuX z6?$HFFz13{M^&?-;-VwAGe@(cWB|(`V{;=DU3Ng)-V6@hBka!h&mOmYhE}%*j9g1u z)NO&pRJ=Nd98uJ@enF{N{XUBWw1nKay==dHF#nU2MQoa#hl6HAM|LY?!PkHSlr0^+ z=R3hqDH4Tr`xt`!_y8nMXnqR)aqu-Dbf_FvV?>fv;^tBC6F3Gm&hl`r z6yUHvAbF#*i=X-%5bE7n{hyjLmVa=TFfeoc*ISsy zfBW0s)k@gFOIp47*0lU>{QkC;$ZhJNNLCO7QIA@VkFs`m2`RuU7JaO=oIDXLU{ArA z^7`~6%HkqtZcN>rypB6OU3JQbi$;*AP~#zyA`77IDH4yX+}U?c&OJ^ZAKG4TAy4pd zP$C+GB{3^L8fl`GCPFVF4m6$(@EZ7o2a8HW`9zl>g*jZB6RH+%Lqfb?{oq`Hx~L(< zB9xlVUXwPdF@_wEF9Wccd{k+?yN%+ag{h()dNsYxBLv6n?bAPDPcS zOAU*7=~J$ii@J{A8k|Ia&r`|f&j$uqN-drw7 zE{ojP<#kiz-i_NFrN=0$8mv*vlv_y zr(z*QmF9Fp40Kuqr(zg^Ne=~P1AhaEZ)8J+r6C8nQ3(yj2xVKy`Uy2*4D(!DqK-W5 z_Q5kOPaQUYha(1HU>D#^`7F6-IA4ja!{L=xdaf$BcT8n7u~9w`>NHuW78p}$s~!^4 zonP2nGHrQ{;?9SwxcZ9aNz@340%Vr(N1Tm2yf_nf3FG(55cj;{_aNYf{0LC%)kqL~ zlUkG^i+Z^RI3N|_+A#{yKqMr0a}kPYym#Fcd(#9#P6`p%o&^ILA%gTFg%lHZ3c!7O z9|-n*Q3#_-oN;bwWO)hoKs4F&oQ0f)&dpFc-6)na=RAC-1PdWI+KuYx>1 zj`IVrRM2p%sgsO;6GOYO;P^mJC~>|?4KNt?7(#%o@XW7;238~4Wx;N)gnXQG!X1M{<)bdjV z2ayh6O<+}-8)VVhLCZ5#=E|4oQO0xB zC9rO|_ENKWU-KwYQ5f;#Zpz@dTz(#<&&Gy43AWlcbz6u1glqO)MzI?~=)KR@vAtP) z07IU{%~6Gc#7gh1nGE_1P1_>ldf+Tvua{a+$Mnl3GcE`z1VSRrWTvR}pexP$BPtPf zqSqUgfxLk(`Zpk9kH^zQbt0b$-bQ!DO|ft})KzLly_=2NdDGS9(zWI;io6jPcmvG3 zs!xNpcb0|L=xLLRzsyy0rSkxB;GFnp6H9bcrKpe8K4%2RAg7f!QPBlz+WQyCZ8p7{ z*aQPT`qOBYTBV#e=8iDaVVg2FUGW{=HhS{Cl5$nGz+phBGTi>B$-F#A2bePLTgq~m zhcfL7N-{J*J%_-d`e>pyZ8B%?pV!uS< z5vR0lZW%Gwl_!6oEzzB5B4bYYrxZ7B*Y2|szX1cTZ`R9a$@H=Pn+q;kvD*f_Vd3!& zJJ0C;0ZQzA&jv_rsBhQ~JyTfa!blpcm2!zbto}9Ls)xJnKh}zWy1+AV{5xUgKVRS% zHDw&vMUgts)$rNM#xSOz#T=v-IZ=-rP;u%|i-#P)!T~cQ+ilI4QK5ozU9)B4#O2IG@wzo|NO`)&}%m2}-tlLIkf4tkh zi!E=i-lq3jjNVVT+tnwIdaGYaiXFV$eJj%5-a=y=^r-LlA-^so%ZJ2J8<1G%evP4A zo7`32Minh!ne35+)QY&7nkygIR_aP){JDtKVZJ{T7}-U>GFTVTw{(AGDpB|Up*Bq* zA1^Dex>`B{Jn|;# z^kW)4poqSy82mxz2gb;WpPH(ud2$X-R$Y9q5JC4dxpW{9~Zm*$ij6$)L)~>rOvQo2=&VNVA6LE&+ zm4;~0LxVR@F6hZ>LPVK4%r~5UDO{h4Ircvc`CKB$%iN`9`l-=V4K?=5m=RA_j{b_c$_d z*>hQE2rSFxBM>EqUo=r1Ou?se%$qd4D=-o)%{}5FkD?%!T{2vLDEuZ?wXp6kAVpF_ zveY;@+C@1|A}jh?z6ml)Nf(N52T3Z|I0ysv5g#e_WdA{G0>iJ^M~dk%w>BV3iU&99 zk&Eh8Fy?JC49kCl264~_(jZ<0)DtWJ;_9>zTSbJ+K*o8pi=pKN$>ptQQh@D8-gYJ# z{9RnT^JvrT)6zxL)c*PSo|mf~?|u$|kT>lk5Ucn>TlcXGbI`n5I88^|EiEM|kRdqU zSS9BZtp0(~C$IC2ueGqC#%vZ19UBCp>WoZ?R>d1Y^G?-8-b_V5EbK;ZlH!4p-6F_o z*zD!uLB7=J+z?zVP+CjK1v8t}$t!nP4ikleJ|3$4(#Q{1$FbhJ6Qf?bH^d;ZW;|@g zhn?3&6B;QhkKj8)M+;!ng!RJOEBz}EoX0Hx73{GxY04weE7~_iJc9Aab**tkM>&h#2Z^Qf5p1ScRt_UsU zoS_i|u?&rQn+y^)68~KL<99-s-C;0a0ibYjZSVYij zqB2NCe~CNg9Mj4^p~0WSCf>;VvB8xzMegMGJdUbg*D#0mFywovdNG**F@?8WP{!02 zY2R{f6mLSn(_9k_2Ll~RnFDoP*!&*018Tc+3JCERqKy;|N>_@w0r{>PiUvkD1_@9u zf0zo!7DoL5`s0gFrkf#6c2aHf3dK?kJ$k?~9WC5KeoqHQ9naxag}1td#HYY6bVk6R zVCP~n+~Rco^;NS{ybbwieoAwbBjOd21(wJaP>8%j8Stf68>F#2e8WJ50)v=HI1cc+ zpDvM)>6$WD3|2$~+VijF96!pU9JJ+8iD=J}ywxaGgt=6v=&DqqsIpLzG*vD=2*Ly4 zBO1>l_bgRnL0|mM!*Ez!**i(t_;{h@t^+IC+aUT(Pr#tA zK{Q%=7fP|_o0YDRC)t-PGAYPmVXjlylQjipXEDP4vNU%2?-|CWIlP6OchpmZJjZZB zr*E_woY}N~dG@Q)n$onnoGb`e#sjmMxZHiTgxm!op$ixxW3>P#dAiHR_Xl?-6OL|C z^q(*%Mnl4{F4RI=q{0`HFh#X*mI1wnyoJU*l@gUK-4Gc;u~*c91qbK@0jOk{o5JhQ=}|D=12?+V1Trf@ zcvq7Fy9_D4q(ZpwumFJk1vs0sV~DwlQSIG%A(3_u*+0J)QI!+s2|El5D@>?!7-pH& zk9`3}Oe{41vBUX?cohcbpSauqa#OsiE))CXV*J?@m$1>vGxggdbvB-$O;(2ecyUK` zIjDLPuve$5-p{#^C^Q_%SGQ!^*8e{A?wYYPd0i_Yc*o$s83Bm4VuH7kmRn3cIR z>xpQKB$)RJ2;aA#d^Sk$Jx&h4uCq0x=;2)cm^QSW6tyb%9yurZd^HEhbrgywlm40- zLFRY-xdkM~_SRa3^+z&rGJ3(VBY{LNVt9EqDe{vE&7{a{wX(VgG;KphtF&5!$+dS~ zWh%47jM$CFpOa^^^vT|spf{GmO%El-d^Db*24x0 zqaqR^uit+f9~7}PFX!C+$(!x;1S2xYI0y@urhfE27GZODXB`3poz0oME`2m<@xM4qXgSPT=R?4f7l(xwLwN+IQ)q zbn}-QoCgDxui3WtBoO*GeNHEHcA&qY@+#hzS7*3WVOOQ<34m4hy#_;|Ce)FiM&pnx zAK;0E!nrDiLK?sQxFp+E1gX&MOyis$Bn&-tnP=PPTL7j+=LyJ|Z&0<>$>1852)qTKaK-GWK zir)ka+>l0JN?R&mXDLBmWJYd>KD72qR!ZVuv#$TH7YUX8)AnY5CB z%Gf(e5(hXt-V59E5|vi8YLfLELpSRec4=U*e=yq!lqqHLii9+^QZov+eekgVkg)W< zcS_PJ(%=ID%AN~4-I8v}#nt}C<|~@DF|_EP*Z78kf-3kcb6;iFuSmD%u;$ab&8~G8 z+;z?9h)GIzA@&(deMa|<-^>7f-sRWDG}DBbWdc|J(%EJLR)yZHC44X)BegF34snVH zL@gg`LMcb@mG@#|f5KHaB0ZZ`pA_{Ti>V@ogoBDP33O9J;kM^jx8+_GmcTW~s05DW zz&4&X;UwQC+e&w;c!Y`9KRwvyNU=y-Qc_(ZJ*3#q8x&q6g~C>97-EX2``y@70Od7Z zkx$CMGTzkTvMCe3S@$Cl%k_@f!dhA?r^bKv#-p_gfevxD;Dg{(p}4-2EUDT3s;aIV zxS3TVINF@~3sSjjjHEC5zZ{tiF+|oDZ5|Xh=Rref9^Vh1r4s7 z_0OJ(GhZ3RsZWZnfGZ$3J5+JcoiEs=m(0oF<^TF_#0El52?}Z>S-w@$!_bX=s`wb{ z)_)u6;>?Ho1VL>WIndXBCQ{oeWhsWk2T82g4;y{*9X!Qs{L`=fC!YL&ZJ$}#|9gD# zpsI}R-cM%vJ(UB9`M$@{e)YNJx}@inb-Q3m5GxW0NbcF!dloUXvzZ`;`QWJi2lrFP zGj~%IE)nKt^nt=V6XxcI#V-zn-ZF9x;W1&XN_<8I#@Mf@=2I(<*Nl&@R!|8*xM==E z4)I{kDm()w89i2(2Gn?JqFq#Xx<;?aQ|A_D2!|uompMd9Xkv8X0Hpai1G|>~6^4y< zaxf$`6&?zANwV4m<|)%bpYin)&W_JjR;s_M&aR#84X=P58dt85YO@^K;Y_S_bsF)N z_oO495oXB%bu=-%UqW>Z9%RHy5xvl+8>WxyS#$f^92ab({z3=p#;nqcBjmr{^s14B^oO_ImV06&9+WY%2i#lHyIervR6N zz;Un-MDvUQu_|CYO=uaz$E!TxlFjB{aZmgKZcm+fXP7##iJ9i!WAL*2i8~s+bcls_ zf0c6oU_tGKEuQe(0;L+5*Cv1Kp8JDswRG30O1r*yS>)1Wt2&~dpT<_0PB;HG#8P!d z!3*Heu0wXKzDOA&oM}uugqKxe7qlg+q#tHXWoVO%Qv*Vj)tWL#_o&inX3Z96jj+wQ z7M!mA&SEh2kTsVrYg=&C_~JffrD}u1&1M{+(pJQG&z^#BDNI+I{+PR@weFE_c+;Fo%J>e%G@TBc{gFDa&^F z4KD}8T*q>*#`p%Gu((I}kDup1bRO*V|K|Gs7rN2QAJf*4ZuDQKEo>Z$ttp>tTrG-9 zWfqIYmlR<{$(q23UZ4%m?=E2I75$4f;&`e?GG6X?My~0J3yh9G;9JE^C)#|{Q(N9i z6Zr{#dvh7mJXPGIFthj_qxr5(d;C+^q}drHTa#&u(D~2iXMEYQ9LD+8k@%1I^x^d> zg-T$AC~1P29kn^a7F!VW*5&{h-tf4o@X@$q5b!v8gMEs@42EgQf4D(UfWu~)!}AW* zFs3(*>Rd{_ratkKbM;j|G3Zjn47kXZtk3)IHH^ zuG_v>Lgr6hm(#-?kGDov^M2rdgQur}ixRGJ)y5d4ew{j18OfY>09p`}%bW^Hqz$kk{xJhuf|Am}O~lP$Lt zSX=1KeiBQN=CX~Hv+B>_Kt=b;aRTWO zE0{rYV6Rs^-!&0m(Hc@IeRPdoN$HO*mCgs>1t&%5md&v8vO&ol-P;kwyBD(fuHa?d z@+?%N5Vrz1KxCG#EcVg9G0N`~SgFYV zUE2A26)c@q7aVxcR9{Llg;n4or7;&ET=@m?Yj$284G-jZZnE_SRotfilTo-<-XHU5 zfaUSmV6La`}FOjv^=+4smlDsXSP=CxE~9&`joj)QWNX9Mb{E&|LMfB z{gWz`jp^SN;Xh9^2mc@0@#F-EVf;DY(_+@fA5=4E1sm$Oqr4RfqJ>m@T>|^(V-`Uv zIL?r4Q{i4Fpmh`&wFB z^zO#>vQyV>9UU(K368{q!32)J7HQB_!84In6@xj}jAD8%wQTZ3nMSx+HtSGi&^(=2 zl*jW{pCbNt`kI*K?&&mrNF^5pGuwb8olnxOQyeSCP^E}i3KdPJscH@C{loB}BtWX}4|(f-2+$E` zwG_O6KM_w-)A`E!zE_=!f7b-M_Y>zTqD>%-x>K5%zNO^Anb4b|`M)#eTaSkAV5p~v zBdb}9PLOh_FRW4jcEl`y0Th~}Czf_3o{KYj!i?mH*br(z@#k?=Ngywe{4)dp#|~sm zp0F}7oP=}kh)13-(UDo~%_l$d}N;^mgu{wos=-dHVlvW!zQI->&^$Sv?rdA}@h#E7hA3|rA39Vx96-y+5iRWUsO2tq?l zCn=Ejmhm74gF!=%Vp1J`#{52$m1!ujR}o~Wewjh{(>2O;7=up#2-4P6D~kaNx(lv= zEtFJd%`aa*-$W2O?}w@mGuxaTNdbc_2IvXKB+zg~m*_c4;7&CjS-8`M6vDY#kQ(7*UZh!ce|nkdNl(^ zTrp)jd=eFY*enh5nxRX;;hmx4g3oz(vFW1S1MjFDpUkUj0R7TgZ;3Z?Z~n8&#-<-7 zkTvl%r)l&w-9X3I6@#?@2{(<7o?9%;HZR-lYH5KhG5nXVW5TVWo{@g}s$~`r&Ar7a`hD5`W(hs& zadN(s^Rln5U#fR8`xt>}MO#uB=S9^i;f;v<>t&G#5xCRy8x2k!hL~LG7T15UGeSK^ zVq-6p^%x znoC538nRm!yJI_mp@u?b$53EbFAdG`XGqz4h5@hKy)X_y$}-5>!Ms9{h&VM_(^tE# z?Kn=5rft*YY8TaJ7g-|r_y5IXPPCCeX4o3zE&8<4aVE}`(1$OO4rIwT-|?c@NHd=a z-2XEnBi2OGZ&!|A@?NE#`?w*BwsU^u;~5>dE0tZS;N4z*Zp&fjU_ z(Rokv;vFvyw7pK$P~2lOL10Yt2c}BNF-yj$jv=@E?ndiC?ZHp z@gx+ST$u9f^|og_Z~G71BV#3}p?+vF_2cJ%Moc3t`=Ziys!Y^0RG!tcr+M|hd~V|v zI81&EqhS@eHK{mn6D$j36%Syb{oz#*iH9t>PD9zP3*$~Tz0bV6U?7O1$ScH#G>S2= z0c{z6n=}?srZsUS4PU@!`!s*I)^asdTO-KpWF%5$;3D?T=}uiNx#1{xu{ zfse)t`NpA(q|V@SNk-I?TzaO2=UmKcw4a_%t;GNBYe2! zz^o3WUk|Jq0oD|zt@rTkwnK0c4n=2MYjpO5s8ET{G>{VZ=!3`?7tjOMHW-k#@f*q+ zf%Y*6@aKSu;_z@21H~;&uQv@?EMAk3Bbu~lr)lwwzaN}B-EHF z%Fad(a%9+M?ZRT3G?07V!YhmjdLa|zzh!D52(v&+hcFC{3A2=y2Wan zHZfYS8?M;vO0A@M?>WOkKZzt`yQ^sYrH|2cExYdBis7_RCi&`t6SP2Nu$#T?fAA?@ zj9Iw8Vtfd)g1SP{8cPfG3&v5@39ZzqGx+yvYEfr@@_Esq#Hq4fV%e6JXJ#AlsiM1* zWFE8+6b$l9me}a{qf78GO_t-B^KlAFitDYSr$#$x@ z7LE1C!_eS|OWX`8t3vje`rmHGR%xZIXvWXoC?~>S+F8Oy2RK`!eP5uxJsKv(1Dr}9hVAPJ` z2Nd@V9@#Q~$qbl|1B4D~xjj&bN6_<*t)?6=VwUi}A zU{sA|R+oG4zBtrr6AJ$Tw{%g}tu_lbA@RO+=>|0jOvu|U@>Ovhl8+U2fS8>U@ih~igcWrt^;y)Ealh@tg zLo^~A{tspU6eL&!Ee)b&+qP}nwr$()vTfV8jV{|(mu+`VofH3!xDnGa^UdCG`)xlg z<;s=0*{E0I0|TrmRFdPfG%^P(J&sJ5>QUx?cpJJO!MNO!`x~L?X=w?$Hw-Vlif}v* z?-v=?9nO~dvu@l~Fm}-eW@qk*hXPBxX3SP~VV0^xlan1^*3by}Ml@A@HPxyft!`dG z;DL~9pXEkxbx?4KZt5o8V~E3Inwi&Poqt@`p#6!Mxhpb67MPJ!L#u>aBnK53)xrdq zO-%2zNN{t}A>Nh24Ikn&FuVpy^Pqyuq%g%`nji}2j;?b0>DVCN6xOw8Wk_k$&}>W3 zogv#e-?Eno-Vyn(b|LlG$Bb2W>H+n_fOWwrR51^vCs4z|hbe^m_z|5}LpP6Z#q13@ zF@|C18t)$iP+Vt$Fq#A9S>oDnmQhAjvg`SPAKs7-fxL6t`|={CAY(-Uh1whs;lxF9 zpFo*$Vc~~PvPq3o4m5>`*17WckRVJF8M@fzEB`6tLg9R3 zTSMQV>(W;*Kvag5Z&bss=O;oR97FYFs zY_wi`9eK^P>C(n+7ucxXTcyNCu&I;CJgzBZ+aa4=X`mT@zkpzJpWGtOo@<09qlIEFmT^8uevGXPrh>aM^$y5tU z_b)vj@kpi;joNLPacIF~AAB!5034lh4v&+td=HqBN zL`^5T(6wRegXJEP@OnBc_|=e0|M0Gd{u^E;MI5Pw#I&^1I7DTzkg+6OprhtOpOEhN zaJjBk(_Yc@hZwgmX{?K9WW5qX`*J2owX_J*JfuLUysf}Qgba6r{i;oJ40MeRwl1xX zi|5sjri#xW1O}8qN2|ngUo<*gKm@ip)r%Ex=#)2}2mQSCLp;6*C*2_3pcM_nU}S%o z^U`+c+U>d+Wk4hC!>#r$E92CljzR!{%gsWavrfuY*TWI$o_SZrl@~b|UG9#r#%%hp zDpB(}U_cFADUlGN>=)5A6Zn{l)`b|{!vYcq(XQovMW-&o@W#h;PMn$a~l822Uqq;38 zKCrmjpYT@#Vo5XzGRSoEriF6CDQ+U*uZ9@;IM$Dri}dO8mvgx!I0}27X+E&{hpXCi zLq8#s@k*0%2@F)fpDeU*b%1n$fHlfe%*~^jV@a+L*XW;C#C6}#ACrl2U=|2VpuRAT zwJwOREs&&C5lB?!*Xsf({4u1SF;@h6{JDEz?_)u$5h#`f$>2~ypChk7hN^}KW=95U zM+CV7mNNtvE&{@Z2@Ws=G@|c2A!H3g+fSA2zCCSYg`{djS+Y|Iq+$?r4bCuN6%~o5 zc*JEqrG_%$p9*bc7~*f>4e|)N3&cMLBZ3Y+8gfu85W?m&J!27g2qXiQR>)VX+pf~O zGr}B5B_uZ>GYvg$Ts)o`3VjLP2siqD62x1_Ea`&I#2EzBku@BKQC+ou36+y`XVf-h z`o?^q^DIb2U?7$i=vv9IYD{1Oos-mb`y?XRX2);4VY-7|`d>*7o)hz6`)7;INHW zT~i0X6+C|&TCHp+Tu#sE1*>7V>*|Rmt%bHjnd9q~WR+fIbi<{<75$kz=&H`p1JfKt z1!e|sRQLv+sB2#TtRujmf08xgxzuRyfRqp$q>=SyV%Z1I$s=d~1za*Y9Q3bL$N7); zn&bcHg!CWK-f4AB`Jbhk---I`yu?%e%iWq(iB$=nQc;KAC%Z% za(p#)Am)fAslj=Nl@d3x#B!Rit{EtfDaV@Y#!rQi5Ten@vVjs-bAffFH}SF%ko;z< zOwy63;yiUp)Zbz+JvV1J!^&l@Y};@3aC2alo*#6^`6c%^rJ6_W@^X|L?fXU`)g@zF z45)9mXB}RJSY)k6T;z$LQl+YT9%|Iw)q#Pm)+=4OgCq=wT#cu#h`LWir2fdLA}am@ zyjjvo*kQnkhHCV5NrQ`TE#GWpEGn6A_AN&EDw$A#S{b=3!u4V*nhIJ(ogm>YVFKuw z^k6BfFf>Zu!fOOw%O8Rmad<&mjtHN10EpV>7pOy7YH=P3Q#ZV__-=7W1TkF2-e`Q3 z-_Ey9Cmm)AmQ*MVWMW`_zwbvZgXqwP$@96VPwLv6PZ-9;v&oWvL2-p1|EZH8!E#2fGx||_vOxkG@&CX^IE+>#DyQ{fAupMJs z_S<0X zHt~E79!tPvs+8DoKHkPrEqZIGJgK=h64ZfO4iCGQ@Tv$&*K%WQ6IJZXPQl9M5@Sy# zD5Mt>aPzbgmQswNf7ga1V@4_j62cIAMid`aV8u}X^+Q*YVTCT;OQe^`#8=p{F z`eSSecWBGKptZrjq^=^i4f%q6uhn2(6Z1wpC@f>NhNF_(+8awf*LLUOd;zWoKFs_x z5dWcz%FgkBWKsV^ApVbB$HxE4b-YS!Fs)~NJ+>$*waM%`u5D83B zSUM4c(8_%vRlJyT$k(l$=-Vf`aO9OXE&fn1H-odMj~gS(&DbG75gxqQr)R3=}7@1@m0M2$xPes zp}pt8L^pXL!26r#MQ{?A0K@i`1Z>b1{_OE@7`~b9Kq4o^@%C^?Bdnl}s&e^DnTvqP z{wpdFX2C6 z?R@ZIJc%{6eRtJuF;0Tik`ke-q%jg8M>ZP7{ZveA?G%MsFZD%e%?3vy?zu2(! z;1?GP}JVd0GVC8U*MIpr$Ql_-nV_4c4kTG8QV4iNt0QITAYN%20)o0*@ zpia)IHCh;u(#4C7ahb%A5(}3k7zk9yTGo4Po@>9Di{Q3@5MP z7)~g-mcpPuUKGMspo7a{ir*(3&A&F3-y)9kA>G^>ch!oT#T)*L9h%MC&zQd-DF$SR zsmn?LhY)9tr2vHoInUUU|7(4;#vcgw2OM(Xw^O_eP6EN-XH8fIFGwW|*+$dOuvyG* zB26Al<@Up&y+8E&RUo4Oh%i=$f9&1ae|9hbl~Q$-F6*2n0Q0|#&74+>1-~0sX4$fy z#{=!fGli_;TuFi;NvrPk@EA<2< z3SNgN!e@ip(m=>$o&YSlM6_g7w3V!yD1%P2bnVpaH9y_567aYl~Irq0-#dwM46CFi|8uO88KMmA;=L?9r% z*(EQBuwr~5m?lq2$4#@c7>w5$vXWkvm_V{nD>eFyrNwQHG)CJqeO$9J@Dac- zY*Tzu;9)6~85t;E9e3x2wN{5rHfFj(!{bO~z``HfjtMt)0pHK%g=%(J9|j;wfUD!< zS#@I|eB1hfQJpc+<4*UtU%_Pn4YAW?n_05tiB1wB8zt3^a}sH%ue^w|i*Na|Kdbb40v*ghyPG-(UQ`fiT#3l34evP<0w(jVVy*)c6 zT=s8h=n<8%d^6kedt$T+B)&;GBj98{#|dEYZZwrh4LQ(M>xGB7{z7Yfys0z8D|YjZ zI-dge6u9(w22#I%T@JDe#)*fD>fcf?T7^(Q@bz!sKu{EKaM-k!;KL@MjV$mgnwQG* zp2XxvAUI5k+3~3UIGk^@zH&+J9vN^IX`E+5?I=JK6>mX+fQsQ?!UG8t)Q&R8R)!ND zIuEhXa4!nD6OY5)=f>pbs;}?<$}yj(sRIw3^Ve=@;?prXdlG;pZ_4*j51BhX-Y=WR z+y6-aNp%R4KA1;QES9h8B^jv10=Kc#pyI0$w}4)=x4f|Ahw6!NycTzOYqj6z=|-Wb zv!Ub4!J=_yBAz4Xjd}Q?ICB%ROhY=H)xKJbSg|&t>s55`{$UHy7t+oz=Xy%bF_j0V zwlz_LsK|8n3%Qh6ymy{nkMKh%;)(wZtbdg*&i@`*SLwU$F?lOy za`k}%f>{mSO*iqxp{3#`&cfq_khLBvgOf*6IBgmDXo@g86*+Bp*8Aw5&5DUiW6Rpo zI6QVE*Rc>dI06d4JFhsC^4~paTh6NwJ_emw(X6n9w0*& zReOuVKltp>D;@F5C|+ibIZ;e7slXO)fU9Sh)xlKQkX2!ZoQ{^AbAV`RgvKV!I8O+B zouImz9qWK6mMyET#+k}<@TEKxu7y#+0Y@tFCCDI!ABRekT0K24Ro{|Z##$tFfd$_z4=SN8NSAYd7yjp|QBEǟtc69%K;kzGzoi z`@Adw?f^kLxVa-Z91m+;267z%XCC5;M92A(-K)`hRQD?q3_bVYVR??R+eYYjTo$R{ zc^V<=ZOQVGxt=WN%=H^@TEDMs-vz~J%4n)lfwLA?$Xub2<)EmH5>YA4b=rn*5_4#{!2OeuXf zM13238JQqW|Mp983n^bT$H?anrE5T<{tgT|3NgtwPPin;oUW9-4-isv^k4QStc?F4 z3vm2@V2^F9OaD)w_+tb4DpB0HzWzei#-~&fR;k3PB2_pBL@o%FjU}A;YxfSgNg9oT zvRG0+YWmWn_a-YNr)1t%q^M5Z#q?{9n~O7zi%BHtSn-DJfGSZ2nNVd3TLeAFG247- z^ss8DEy+25u!$s7+C_OIW?^$;>;Wv%VgQ{jO+{%nFD14Dz)05k9m9bP68ZNXXoxH@ zXw3F$rxt>+<`SqN%i(hAj;_kyK$O^a#n;{(g)jLp5rZlvbwZWUuxek()Nei^b4vravB zX_EC|K4}){Q$97DHB-~$z87zSk}+I4S};`FoNAt4KSt29Hwh|$D0`vNldZ!>>*FTb zDL>`cs)PbL92!YViuYtrp4s6##Z1`4!9_n8zxkmh?AnNcG^u|?%IU|on@{dcs%)js z;k)m>cdE?0#a1WS6}V0sK6#BmvGI%83r zVd}6H{6iSj*^q8xh=I`rItNW@HsO*3d@Xvvb9>T;6z5+Ss>6XElVtE8-nrx?F@Oxt zSr@aNNA++}RG?SyE9!0NH*+*@oGg*c*S;h2_JSNDR7~mQ7>{NH>ez3xVhW@J50ePg z73y%+RuK5cBl0j2IozVf7~V8RvGx!pYC~(jMiM+-9b5a(NihfANBkZHY3 z<|omRkU}YWUa~%Mi{GAnkGPX_bHhKn_4Xi3DK4tr!$@vZg5K?^#1DcNO1eit_9nS0 zG=JkmldV`=bL_lKQOWG%rkYtI$b%JtP;&L$&DGHJ#-2#}S~f>Dd!TRF)fxz61o1*$ zF5PgWVZc?~z|lTUFW-C<-WXoI0KD7P8Mg8#VCH6N^}@&W04gCztcKR+d-#^qYs+Zb zPp0k6HKyX@m#%*saiWu4ZtWAI^~Eh)%j<() z3_504Kld|lE?&IkRR}%Eo#x|+Cs-hkoC5HBdiM*pYi9!EJ8sQ$*tjrjO0X$-{ zpr45LPZ+DdmVlgS701Z|CoV#p?iIcQyMU~=6B~>P2{a`utK)##q6D1N&9y_QxCdw> zzLNP41Yr4yvEt3dHlT;%blRR$Uru_kaUQG^jm6`Gw#4&**F0t>B$p9V@lr#9Hwp&% z<(1B6Oju@mSKPlRdA}w3aOuGgQrb^^+I&LkTB`4Ge z%iX1xF0TWC$_8K4a2SrZ9UDX!%qycWo;aDDQ|pXvDK__wTnso{auwJu)-u?S33PO> zDuF532|!FjGrcID@INhb<@~GdWBNxWVq|Cg&zt!x%}KjWF_i5S>gFn)^dwJy1p-K5< zFAx1BRGA>NNQDWhhOtDp7oR(D9$&czd>XKnWchs;t8^EYmUae!yY38S`Qg;tu3yoh zv1P18=M#`jnXbAwqh!L#RTgxOzcM|NAPGSr0muk(BxOI#Coe8(6eFkYc?f!yYQ&$5 zSdfG+Z^-om*Kl9Lx+*eT*X%Yv&62d&u7>-5-Su%2+^Ba_+Xl>Ta?xUAB_0uKEA_Bid(>&gFM?CLWX*BqxiQ-{=Tq;F*GqFm{NrGK!dgV(|a4Zel{YjY$F%7S!s!Jcv4~H;I)-^3ny#UL= z(uZ~1#s^TLXIkA3W^2$@wQbe1kd>M^}Pl zYTLE98xCOg$E$2n1#sJTRYOJB`WaKXcdDsTRGf$DU8Lb}gRDBVcQZQ5#pdWR6iZtA zOj%hJdap8 z*jwt2FYuZIhu-7Y)pb`k7QrDPIx^B6Fr-YTb0K7+K{t{SLfQs=MUxBjZ+IxT#Ehah z!B}z#-V}ni^+wQ&uP=~&EJaZs!PoCkjsW~y7uu!~!c+?NPx^F3(|9DWY*ILIeUO)d zUtVBA!2tLfFaoV(pj2-`xWduK=`8s>qToZl(${4ik#Z_nBstmsaw<7;WmVNY5|qH` z0n^AZvt8npPccr&-GpnoWu<=EnFDRW*-f2sW_iC=iUKem0hM<>3%%xW?p{HZ--M|> zx5C>PL*lds2RVxAI5Lw1f+}-XDVn*ay`kv-rh#&#Y4-RFMv-k+qxT5&ho%RDeizK) z>XGK>;4m7pLK~n{s+MLUq-~aVk7XhN8^mC+4H1li>fm7GJ2(cq1Fpg=q@j?> zYwwbRpYZO>%sf1;Z7YH*8vKfdFFKj)g7ehic$y6Le)iT3t7%678U>^_WGTLGwFqvB?-$%2XdzE zS+H53cL8i^4q7G{F6A9SS3uS99xXa>g=^A_67nUs$_9(_pFVMGECtt@!K4;7)+@pW z%-D7xsnSM|1Q}A#sq38kTu75>C?;cXCgw)xQ4fz>goMmt3*1xkgw37zC<>`l~ zzqJKUe*W@$F^xOWO&WoMod0`5R`?g6CYdH* zM5HJl9Xh?8ymZHYxOC&rJv8)|ioJ+%GO`JaZj>1B1W2Jy9cXQx7}DY-%Nw&N9Nq)T zl_Di;p-T~y@AbSS!+{tJ3`xlx7+t&_5kp}#5mb20k026L+l6>M`cJMm64N`D574Gr zG|}QYz9!9Z?S(58Xcx(JRkYa1Phc^l-5XtuJ!YbjyrkDUS$m?9Ei}-oyNGds@E`#} zTIvrZGHPGESu)Z)xI`N=U@ork17*Vp`PiU@QS`6%epCb!D7W>gKcCPb7^zb5Y3x-w zVexA-aWzOLxn#~GDtfi69ivm{;%k+N>@+D7K-U-&@LrKuqP#S!2YmqtlIaH`^sH};xz%~ez z2Y|VtL{t&-vRUhpI8Le#CmXO@Pn&^KDu*P;`;%G&n^moGRSCZ? zT~#gV(7}%W`p-SRYEZqGa;ccL`Np)QK-=Mmy0TY$ymTyvn>$f$Ct@7iT5=lrFGUb- zA|nhHEVun0@c;)bAafX)gm6>-ar59XyiI#U^?M{Sdph8u z7z`}>OETprQDHo_CK-uGX%(_QBnZN9g>f?z?cudDit zcPu-hqKawvD)=9CH+m8Vl05A4uec@7Bn@tbXLb}DY^hrQ-PltAIO;rxXU>{7%68P< zSKxLo>LzsB3q^yE`L+H*NX(<2tv^*ZlCJh${k1+p7j?m4Hy1HH5_WU`=flO1;zTks zAvw1UHW$-b>Mq_Kbi;-xtV9Z%c7eaEpnTLed}7<;8kQ1pP!rvPm|u2qHB{6Qq{z}+ zgA`oMB(5bE71rY97N$DN1dk=(;mvTT*i7do)q197#3=>Us09-+Kn%0HhUpP%>Ef>^fCgcP1z8B;o1M zy-VDb`+a7;2=7?ty##U=G@pgs{BzXF%X+h@BS#=W_RFC)m^cg(Fj~!g%1&U{YUtc> z7vP!JtuB;363+!NlY8zRXU>`*^2@^r`_%@SXJ^ooU9|>oU}vlkrCp&vmzBA$dq20AMTT+ys#PWi{~Cauna^{^1UyhY-$Ami1g}9CC;C{>DKrF;Ag+^k4oEOjSerO(2@$9$RAmh=^T%BYN3ua(OZ+0` zvwdt!7jFFPHG#S5P()J4AwtPj>#D9ZeI3ND0U}t2PL+v}D{?&ePr9uF8u_x=(ScN> zVn-(tQ$T)gsF8bPl?hj}E=+;sz)1Qun<%>SG}!>IDYF!iqzwfrx+f=)Vnq7z{2&uN z1D17t1I*+GkkK$gCc9XEftCb}GNtxbHQmv%@NH5Sd@DmHd;ldIFv%<8%q<}X*@l=v z2a7ilH7cX{Ag%0k{hl~!CWYm08DNuGUuYl!OhS*)bWPO>mJ=D0wfCoVUB%cBtQVdTvRPjcx8MreVsvilvH$gIs7Xgukl~*~6 zp_LcR_`+{BqJ{2)Mi3$&fM1lM9KcALg@z%>#!Y4Aq)grns!lC!A~`6nK*mcTr}oAJ zHA+Em1WuyZbO1oAqe(?Y{y%K`{Kd&AR+j!uF;=$qif^)#~wnLcnPb!_2V!d9|2~d0N)m-vV-~kK1>NE z{Gn+HEJY?*17&f@r@U$Hjhb+}1JoFwG9#EvM)2*4S?kIe66=QRRyAS%2DRqS{*U7N z-tt?A=4OQz!Xp&lcwS*Emm(hjBV1Akr9ygwc|z~wZA*`I zzR7~HB-c+Ik#}1je4Ns|u}2l^vb!;dUUd_$sdn59Y=Btt(q{r<;Dm(s7#U23AY4+$ z18>=*dIUJZD+W_?-am;fctRcWPBFhG@e0TAL=p%^5||t$8wTqcf|mBVPVrWREFh8;l(YSVqsLB!Qq-(GiBKobMj zH-^9E!h6L61K3qW`l$CG`A*vWP+bo#UBH{WMX+e^qK`d?Uhx&KKLeNxIVK~v7vjLe zzABK#mBLP;wQ+&4Wr3+)g%yq8vQFNP)L{4e5NcLtghKnQ*jjaS@X>PNrqz0ukj70+ z?c}D7i-QfjYKirA#EFXWo!p9$RhPVMs-%~%U38qovzWk}TOyouu}q?V8}n>48nzk8 z%)<$H^oBI_;lC0zqJXOSWh;f&x{x>!e3uPvzQPo(^yy%Qk|)Jv=F_8{n;w zg(<`HDhYTzP-)wBg6KiwHL>3P^P4q9tSHsHJ;8;?%Cn!Vq{?J6u6euO3pK-c!nDmu z?tu8tPP7@AJEpUbYWLU0=o0grLWg#wolk5la`Q9i2Hc!lU~TYInw6e!gdGiY zaKm})H@Sv5(esNUfh6Gg+=av*7>f6pgp?(sh>d2o;(7$I#x>C?@?epO(1Ge17ZP2r zlvlLGW$^+W=W0UnAJ#PR=;0afOMWS-(8F^kQF;gnYW2uCL~%8F!e22#ORHQw%-_Jo zBift)YUo)1#r9@lX8W%N>gwmh=tpYj*KFBb5%3hvcO+3`8IW`Up!ZpKSu+JnmSppU z62Z9Jf_xvbd?Kl4WFi?Yn*jq%!sy}M*vFlRJ4-vP#qEAHTNs%Y zAdtA)czA@z&^rT>3?f}oEX}dUhA)7#dPfOUa3zHXlVtHRho!6eY+B%iD5m|*VyW)P zIvE|?+UA-slDcHBA$#9|{qoe-=-Eu_np|Uoufs$*+`0p?lNB*~3tFq*o_yEyPDHsYz6c7Pv? zTQ^5z81O{YJ^Cth6wr7fAu+rLN(G*swRTb!PTwk;_-cqQS4d7|G(IA}`pR^gkK z4H*VZ>Xs2w+^QXS9(uo?I-Q8K4uJ4UFORer{XQ|p2AjzHp*!@NOi}QjLM{yD$BG4*3 z6heBw7mltz5a4$5FGNn~yPj$rg#C*1u3`aV2%l2(Qd)dltc`_`YlLq$S!(Le#kH>@ zZT4y={$$}QQY-~G74U77vP8(-B+m`&F}nnL^!N6JYG)>+>cz#*+T<%O$}Jn@gGc3F zQRab6CR#Jppg2&3GQ1L@-4CT%Zc%WE;kh|7|GA+p05v$7&M)c%=32ifD1x1TYI^lL zHF2I3{FyR55}=HN*@2^tK>k9c*MrHh^JF+P>F#`ICuO9e_L82H+>z5tV#xa2kq|BQ z)8<~4?tNhgz>teePYt%To>D7L6wPGTfmSH|T^EVJ$A?;|J>-U+))v0})`gQ53%;PV zVPuP`37_E!5If_v5j6tS!NsI)7pTB%$G`igvx)Ez(Sa2T<#ZaQI&@korbZwhSYe z>Et;$d`4Y_g%vIV|UTmY8Q{m=InZFgah54JnVftBr`-g zsq!lz-O?i6RpFE}BO{4r4K1_O-I&#(3=tvEprr{_`EsTMlTHraQZ(;E=!Nlc>(Z=VmS#PyQZmJdKu(TO_j9#X`rXZob}_kD)-Zo=LvVs@9!n4dk z8^yCTAcP%VEOhM4ubKZnVu=)Zd|8A=l@Np(2A5ugGr}`8v{8zST z`v(Tc$iVTRw^m0Qn?GAC1m73++j+3T@g4d)%L@R|K(vaT#KC;mh7=7WLdBMkmz=}C}xpmiu+>n8rkw@!0gub2Yl|?Jf+P3lg_cK`R zITdH~G!sr_f^;aeUwUZpN1Yx}68Mo;LBEv4z6DRR z6?ZFcjqqqAG*{{YUrczcX;Ey<$IIb~>C;-q;-P-QfX4RCZb0{Jg_*%z3TI>NeEogd zy=9xwPVt|24L*ERf6&1h;{N8#N#7|H+Sj(RFLw40qD!xiTCaKq+h9wacD()t^I+_w zC~ADW@iV?H-T`KUl(S4U;nD{#{8BzON>p%PQ%DJKD!>lVSj+_GKrI9{n~9UI{r=MK z!4Ba7)H3i?->Cjty;^_w&Bdw4$BA(W+kI&waP6-cfnfK7PB?;+WAAOtJ}OpLawd?G8)_y zG}}g@HQR~QdC^pc>!D^@VgG(=6Ej4{4mGY|+zyA&ygk}37!h)Upg=`~-GTjZ6fimR z;oW>DC{(AkC=(K>Ih70u)&rtgt*JzE9auj*icM~0hYl4Sns3vC%WgF;*PSaTvZctdPj?3Y#EUbefcD`3~R76DlTsYU1Xe>Jt+wT#-{>&)9 zIu@TOZ8y1;{u0UcwOx?C9BGY*NHT+O^P-WDpMntzpvssiGikCwpH%e=FtiDk?O&Pb z=Z5|NrUUjP@%W!J(Us=z|MZ=Hv-cf9%MJ9+$ zc4_0u>&^R3-dD+fbQGw}IJ>gyciTwQB=7h7QrS+m!tQrJ%0}PRxmH~@**3YG*Oy4t zC}R$71_`_mOK<-$35t=vd%WI)Z@V%2#quNNaamdWS^a#m{s~*6pw_Z0IKs_P5v~N| zZsn#yp3MMKZHfM;>QlJaj(x5Br7z>V13sXOHmjeQ+#w#ds(8^3)Gn%lO0c?_17Oew z!Yf6UbwJ1R>d;-X>K^+fBu`{z%Owpc@B3D}m-_a`)B|*RoBM{wk=y+Sjd=Cz5g380 zC>Tr zay-&0w{{Q>Q4~h+VKFJ<*I+1jpnx82STD9G5YNW^>*z@rlS#LY{*1410QI1&{2cBH zj-zLUH~9I}Jd+4x2}OvNkuo?m=2=#Xpnrs+$B2eB2}9GrFx?;)SgQP9J~=DyJGMyF zs!%W|I<;V4PXa1@Sy#doiV5ax>*&srF=)6{25hPxa?T+BL^O_Z*hlm>neve(BUOBG z6k@PpW#m?~*Dq^O79UBuJph9}r$rAVp8;mGwn_|;I1hv&6^YWM^EU;i9uHh4mMa-` z-B%8L>z_k@%DXZcwh}kC}TA0Ih#pfC!iQU&4DK$YHD|xM+c^10i zklmI`m2km4quuId$y6)*+d9Dd$~ z)Uf+teA+H?zbC#6y_sBKfK)fi;&oiBf1;PWoJrjB8pXzsW*T>J|2QzCIZpX_48hZZ^=B@Sj)8|Dd)aa|4n8Rl(VQp+aY9=H3UPu2!KIhD{~hvn|loo zJ!LHaWN|m>$EZ!Sq=L5PP1(-3tl7#xYQ`STc5@y*d#+dlO(#v1b=p7zG|F2Xa0^_- zxW0Bsv?~Wu%)DyaSeI$S%9(QrUnVnZQQ@lZMAV#7XyiVg5M+perDVMHV9FJ8e4AF( zQ6@3U+ZT7OE>rlJ%v5{&f^Oam4#Y5QQ3+UP>UDGab^T+8hSyTk=Vpa3tFUQwRBDvD z5wBov&NOW!7|l2L3`LYI$$)Je%a|oswd22@JA)JM_Hw|Oqm8(lL=+q5-E^@XWiq*c zE%TCIvxd?Hx_|FcMQMgjG#qdodDGr^i$~aku9W^ZxowK~5C-;X3x_!G^NoPm8%?Nv zm0!jAJswCY+s^6HjL}gX;Q`94rx`;ob>zhiv~SQs)8yK+ts?sBFlzAkq_lFoqo36MDX>Wz|2swgBjuQb>HhZE(ys(xF;gdk_8pUH;;dJaSh)!c#) zMIzWg)+j83q?#Ce)pvslCz-G$(b~j8I|sh0LwB?Fl+A6NsYA;0W-3Ph>larZFTW~T z!!QGJ;=`oKsfeR6Ny_+}=)IL58oNC|9lEPxZa3$zx6kDL5jibPqxR5BvDP)ZNtnc4 z(D?*CO9=FwJ?qL-g$iY1NwMrJQG4P}l>G%b7e@NU50L$W2+APtt%Ev}jmF#gw~r%9 zs`Bhr)7FYs(d8Yqw5!AGFF|TdXOV%*h>ZLAjM>26ET+1PBeE?MRT_m@jS26b-58%B zbhrzqGy3o%Itg64__<+-CrQXmGrvE*$HSO!zY>ik18L+jNR^bavoD;;C=h3Y<3NZr zqmw?UOp_Ph*4;YBnov{Ceg0~zrM=m<^Y!e|oOiFOAo5!zI?2)G{jQ~=yKr^GwxiPq z-M7oJ)t1$g3p7)~PwG+=ffu3KI<*b~2OI(iiiKDXJDK%El*M>LEA$IDB|{8$Mh*6h zc{PDthS-oRr*q5LWyc|H)@CW4MVRpFTcFanSD$2Ky1`;kQt=*&r>qTkxvJEKcu_}5 zlvo+swU#^DmOL--Q%b03lnrhGc0^=Mg!ZS0E`SQ0+_a^UjZ_$dujBoA^Lc)W7W5~h z*@sD|QzfD#hXL)=nAPhk7zfqsl~G7pAZ3p^|-nqEwN7I2Ik=ONI^tVr&=i_pCZR{%RDVmj)2t z0;Gg&Io3doRkKW7jXF_P*fyX%x9g=?*)(d}T4MKX(QfrjGzaAF#$ez;k}4X2QvQ=p zGIA9tD>rBF<+mc3tiFZmqN{6OwXEB&X;L-fip7;Yq;JU!NYqlBqok(U(`~VC$ZQy< z>bNXKxI~l3s#Q#iHj>~3fNHC}Fve&b``Gmz{SfxjMVu`D?u)}BcN!~YWMM7v2uxPO z0+pin!nBk0g=FThTmg6k;Lms(+ll>ESzISrs7d{-E`se95D2Vf@nrklqMc#6PniPw zT;uJTh*PXF8CIOWoo4jnkCG)AxvRE%(RTOKRN(R|l>RBh_dB?m0E|zl9aDX;#c1DLA576HGWs2}HXp^{zevJ$A;w^)VoRgM z??a3RM7Sok5{}BUvBgluj8Avkji{7+Ru}r1Qt?(+xVrphz?c~TQuCWJ3BdmX?2{>u z2S@|iz6y{X?2SxkZQD-Awr$%<$F^1Yo=YAtY`h6%)>si z)x;BOw(&5tA}lHXEQvVxz96??55{%t-fFOk`XC8gU~VA7r~#mIZv=(bOgM?{wJ!uY z_P>`TG0#xpCrsg~q~Q>j1R)j}Iihul9yrk-&wIFEXx_$u6m$K zSdxqxrQBOdJ%0E9rm{@B|5LE_0lE4bY&^?Ja~`+E&0C7MRMV zQIj<`FAh<&9)<_E^LH0i9)|~F4KU3VU|uNsz^3V=%SKsUP~5;=yIV`x5D*cXiMTov>Gxib8px1IlG@%c{p{yxw6 z{hN*^6tAb%%W=NcqCSe?e6tklNJ9>c!-+ z(9$Vq?r0UYmn+pQXup%m0}@dwp+(jBTCQj2miE+I}BMK@CMB z;6d4AGFka|Rr{sAjRC`AyVaMLfhy!=kCCKKDJsa0p1kpAYL7Vl^z zJBNiPuty0shEHMFZ6}@oUYE2=2zAeP6qe?!)Q~o4=X>}qyyCmAqlAW9bp5*zP(_1i z<%8KgIUm>D^jb5PgS@Vvh6<^Y3s5RV2BJn4!9Ed>v2%)MMh~iN>(PA8OM28Zu;#n^ zGri_;?pm?$oQc(`b^f;(0T(WuEo&0hXa05GE9vW}`j&ZPm(EOwjg&Ojac4_k0!Ub~ z1W>lpIKb*{89-#K5nw}{faK*_7uA+)3pk54Xc64^sP6%#j(2<7m=B;y6 z-SnYH!b)~pVT@Z4M_)Tf>p7rC3t>ljRUdI?HTH!YRr5{}JyK#TNoZ?t%xnd3Xs-eE zEvq3Pt^$^_C=gCAPil7e=qq2Jkc2X)ZYh4~`9Ru>0t^PNVOa;~BYy4L05-E3$uAFV z&&a&%sCUDCKa%Wo`V4zdi16jOivKb?BiC{*lC=N%)S&nG*i!l^F1{PL$RY-UnF(hmw^)6yYWX>e}vQi#vJy zyun?qeczQ^%cyqojxrX48tnG0x7QSi!#NeTAjRAl$3;*bDT&ZwGAT+j*=8~o-c@?v znj*W2wgB~CYv`PCcmzgmqTf#N!EQZqVA0xuT1&30bg<*y%=cD&T5$#{cqO8-8Klk> zcAtrn-dK2ur4?GgY^<6$3k;M+sPD&%Pc76!newe=K{Zg zh2{f@Y(>MA6gw8T!*WHpey+Lv#wH0~<9Rsv<210E6)5}3uZ1GpdTyjFhN+>el) zBiDk0*YS!P4oKj7e{oG?X$9hnO57i<{V&Ixsr)x7Ru~g|S?;_Hi~0V3US%<%;92gq zWyPc>$RS>lkPSNtREi@pdl|do`Gd#Qbyd7gN#O;iG;=u1Ga&Sb9?W&$poV$Za+vIs zi`&xP$05Dh3B`RlG+6vnGloH`71giXc>AICYR4exN=NJjuS`;zBX&PVD)A1++Z7gg zpok_St9t*@UhAITPZGNxI(z9zc`4|<5_XRrdwk#8aT)Pqv-|QsbGmx^(;I(0TuH)w z$?S?3)B+X$#nkzZzo{|=_@Bk}A1G>0w*TB}wfxOQ_(oB8pQ<~^6ni%2UDkL?Rh25K zR)oE-s9@Byv(bd2)os7O#jZCGE7cJf%6fuKx%1rbOl4^v8es439fDuC^i_2~M>Dx)5&ql*1LmTdq$dzcW~v7dECH#W7s@_jfvL+zMM z<04RqkkVy0Zi$TVyuYRz=&=+L7s>>=n5v%4Z)vd1X4t!gf$NEz5_~n3YAwld3To8{ zoykVA1W>87>KA8-@%BUu1)$5e2kIwRTJsXayp}g+u~^_I3Na9BZ7s zhM!PcJBN0T zm1~YFd)yFM_{r`-&`3gmcvX*n%~)!wlbHl3$VBybNICOYMjB)HjFQPgiDZ>4of*;; z?II2YImsYGy(6_Jjgs`JA2REombjb@1vr{A(=Y050xa4S3f-YILCE`%@mUL03#I0j zrL~Jq1Ga6LF#1U)_@5^m@94B@jYo(DtEu@1V5M9l*>$}| zf&e0{b7b1qCChSOqF}=zfhQWjIX)PVUD%#}t*F~$%->3Gcs{>9KuXXgi6NMCj*sbR zPJUGX?Yg3_;pUx}*+fP_0W*}_;#`6+sYS9OAjB283`!MgsU{<9nJ$P)#39`57U$^?u%=^txg z>?$%j|C*P`=zVpkp)hL`p)3=h;AJ$nQG%3mq`HU<75#LoUKziK;7ikNesAb`i~9h| z^5b7Mf%6{}2j>4D9_r-;Ciy`|q>$%#n79~`8aH!&n_3C9hyZHs3I%FvB8$L8g-^ax zOCcpKCgOgR$=B~V=b*q%@8x9GC{OJC(7sNBZ31LegF~)8Iyt2yhM%NA zWDT;f=3Xg(?M3lr_)-HCh_%RX#t0*CWV3b|kgRK=M zqkhHBOzjdc;o#_P)EG0csQgY0@X+sK;6Y;b3K?d#*PzsTchH?rhV*~@R5nJIf2r|| z|FH|?I9>X`0+;-6-e{ej{n7u6!VbFuMy-%<;Vm60)N-ubthJtUB>TLuyHg;+OQno^ z!}cQ*gD*U>eBa?D3o<5Y6O7Wn_Rr<3r_bXut{^H2QmPEuh0lNqNx2xzy-Bw;Up1C! zt*@3JyLY0u1T>TTV@G+z>#gbpl&+65z*g5r&epLUhZ{He4lEdHxLPK=ScbGT1(nm+ zN^SJDZk$b2vuPW&djq_ogVSwY_*##x?C@5h_4>BJNm`OqGtwv~n61vFb!kUd(S$jK zRM3PU*b7_P1>ET4B5Uj!4qNmMnyhf}=xsBcHSn?4kRiE-Z~NHgxU~LXp9pD3lzme7hld)Gh2Co3aAo7K_Qmo(Z~-<0BE{rHghCqC%f{B%0v!> zDO>^ZqSI$62f~of)5~utSxl!C**r+zLInynXpvuu?$7}16}yhngG~$8A`pefC_y0N zqW?Cb+JJO4gu`CNcyO|@LL!ha z4D{JJ_ByY62DOMm#QZgn8A(tyUdxlT3|t{^F*NAE?Y9LfX%%JM?7Gru+0yomZ*(hSV=P(dL{EDNxTscG-L zZNkaI4wr}npRDE=-sC)@#W-@1%4xt+GzA}Ol!3hwj(baKI`QP^{&$zdEVCKNhYNPR zXr3qLeG1S6nV;W?2iv40370}Lp-7a7ZdJi92EZD6s@qzd7bjzP&>*(jA+fRk*;Ah1 z8HO7m(xi52+0GMO7)V7E)|m!^F@f;v`E(MCSTku+nSj>6Iv>3KO%>>4Ul3-^0*O3F z!8pKzYSyVckAc{OYkB|L(|!wfB0LXyy%z@7A}eQ$jA!q6`HJ`kY#KiOhVsVq^`T)V zdYlzO(bsjxWUl~F@VBY%kP?hQL|v0#O9k9tOHSjUL3vhgue#)>FkK6KK@y2{krLZb z=M3nt@!f8%MibTK1xeE|T_s0LHrfto;O2(SEb$5IAe+Ln>2NA7sn@&gmUn~)_BS;L zZyt7Ob`fR{5AqdqB12d@nn4ku0oy_dZ-FH2Om22oZ=3|#h)-K~PG_Y@KtVt)XGEm_ zmZ(TTLP3L2aO3pCCfnTp`~r>GLlyfL^8uGvPtJZcENM!Y9}hfdxtDK;B5s(+AxaVq z!Mww;XokF}CEC092c~YTrh0uhbL>Va6vMD>XQ-$qDtAU!7z3F`J9AW}F z`LTGs)AUNOmn11s*6wpp_N8YKJMtL~wZf&BNeR>p3!?Zd#A7gIGK%;_b9(Bg9l-=Fz=e-(gS|>l6}Q2i7<&p;>u%Xkd!8WQx=C* z;;?wqNg!G`L7T{RDGxqzlv&RAe8qBL%9UZ4n8p|~qsq#q-#7&kUaiR$GAA`jpU@U^ z#3bD4-O4Ce0lEF52~0f?!X4E=x4?Co0JXY3|n4eu80` zW&A5no{fq5AN8E+{{YqgXCbCr{r{@xJvX&;^T29!VTcJfc7mBCqOf2Q_L7PgrXFb_ zbl8boY`hPxZdB)@KVr7Q1d)iOlLkG!@24#!lHP(T_;=@~ch%pr2zMk>fyhaUxYh|# zbIB8_zavuLgzp?ju?>%gztee6q{m0ms7gB3O|{w6DjOJ-5Nw_|Tz#x>=(}ytwR<0} zf7*NXdZ)F%R9sH3d}eV&mm$kWiJ*c8HyjDUp4TH%D9%k;Z!rs0jynHfwijZu{l9QL!e$9Dx63QT{t(^TVzqs$Le6aR< z5c(KwL;fkt<0|W~f#<+~Y_M+2Ex&amSh88}-Lj<@W|y2ULcB&#c>LA!G58evYtmcA z%Wg90$7|`Mxa(3bLr3Qh29w|BU5}_aGR}df;ong7NX9=6HybDPy^SeX$YgTE*R5M2 zXKMEJE{-{x22gcOZuW6{6xx$mLKPz8f(NMJd=n-CaKCL54fO=-1^kU!V?b_5b4^5o zGQsS+524Jj)W^ER%|XKVJv&rH-j#x3oBxLRpKW6m1*YIR6gFzci`hsHlpUragJ)y0 z!U_x}Eq}a8{0)?dm;TGQX+`dzBborWN`J<@sONMI=qV7{S_w91`ICo*&XoSWtUvr~ zE&@+!Be~lb0Qk9KB7$uMEmbRXC&2+snCgpNAC0emR|_p*2kI}GuN9C&eDB{uBQ%?E zE@Vv4VXj=BJhQF`20kCf7S5E!_-;{bE&KZgr;T=xiO4^bARr7Hu|Eh*ft!TomD-Zb z3aB_*N=Xz>%Y)1H(Z?w6Hm~MlcjPsmLTifi6OSC2{hi5KFbAS5$b9*wRMym{CvP<@ zJfc7e{E2*ZlKjsFFK{Qjy0q%N2Fzmz6ECU9`}k44IYk^lw};GLqR;6O?|iXev^SG- ztZ}jd_LD-4V=VeDG5`Lh%I+Hjyqvm^2h9av`ekWvxdMa*HvB%NbF^$tRt_%7^t;FV ztTYh1y6AOj=-*MA!vHB(I?QXCW5PB{Xl;Sns(WFA`5|VL0!_<6tQ+M%y#W=DyslqS zE5<2OviRH|2VJ?M#Sr|&q7MCt9CR)0ik)AzV4-Wsq|2f50oO!NoA!`$U|BI0fS-+S zo7uCmDt6Vv9hO2V(DSsJIFOog~TqE9zh^c4eDxjEc-6(e27%AZBi{8!{O>`+h@6vRfLV z8hGN^-qWZ-67M04i6ol9DLUtnSuw>*OmHF<^ait9immTi$z)~mvA%IZ{8EIOfWxI@ z8d=7EQekV^>-JKk8ukvM9$saTX(dF<=H`bV?B%wKt$&?g+iU!Rlr`Sp++t}YYP8Y_ zd;Q}m`fu8bjoDh(j(S``AAQC?0KpKMh_ZHxqX-JjTiZQ>8e$77X4OAV#Eh#tHSdZ2 z3$%jf0rFoHEc3rA9vj<#92t70`QOs>e?^8uhHLZ?W=YpuxXl-`Zcwyd7JkPFDH=-G zkh^V4`+0>G5)=z@#=*}O{+4WE#hdvqc|icVYn1FR{k`$~tL1}9w?GOJBDxHT8aq@9 zR6$mybV~KCBhPUxt~d9`?K-k{x$g<~rG+as%ll_4vrw8o=HqKT`^%qSoM`N$rR5VF z^r5`&AY2hfuCV_-$Zi_W4MFSMLC9u@AAc%ro3IbJSbRFy+Q%JlRM__JnD?GuEBkES zR0$uZs+Mf3O4+MVkS~M|Twm3+%84M$2a^hlF!*!h_Z)-Ne?AUtN)>DM)FYk|RQl<( z5vnuMq9r;hIAIEklL{>xn7aIauX4qw*t77hyGTsNiELApl%gULYa?gJmpgavn4- zz81{_hrZl}Ro85nx#8m;;E_VaUut+;o++LpYtW&-prsO-?6HCK=73$f3-dw;r4yCK zvr1%q`e4K$%p*x|PkQ$yi_rmNOU%w8jZ=ogA-@aMN5^Lq8?Plv66n^3@{XN78U#l6 z8Oma*WOr(e7#6@eG6|@QF%=}nrWdQ6S=gb5HmQ6$J3*pDxE!hH0->poQOOcRq8U{d z-Nf@Fe@cn4-U6L6B@;cb8?4nbv4+P^Y37tjJrFhN$Z)oFh&I)bM1F)f%1Q7OQSARQ z;2rj$gF<0~0EaJx!Dc;C4om=Muq`l_3bUE(caoJ9VoF@%s9-Q-o6o0X42y*(NAAxr zO&JOX&KNGr)rh95Mp5GT=~`JQ~EfMSV@eF#Pa4>u7_1{CUf7sYmBl|at9 zBJ8*)9DWm+WQLb1x}#EGQ==nkBfN*&739M-CGM)b)xdOBuMKt;7W4`6i)grAuBo{t zJOsx72k|7Gr}s zcmK`4_^F%EBrWDOY=hEOx?4|$3KjBd-^q(>cNc6`EdOW@zQzmA^Wm{qA|mV(!nYLb zqa^>F#ZX}Cj8bY$2a!D(U>o?;*+6+LTw-8~^lxUp|NN#fZ8a`fWtR7lAk4_m-MWle zG5w;VGYj#~a5tn7F!rlpkxsSy&v@I&E*qVya=Y#O7h7@>AXp1O*YmlnwUz4!Rj#XN8`tu1?)LnyUzR3%43b;VcEV}*Xtd?4ZvRWlr%9XET@2H-{WRH?BW`Wr_qVXy*Mac-kM_Y}H^DhK zVD!+itOBXeV=}0dMiO>GCGZZ80NznGe^E#=gEXK}c!TPhthcUlk`5rZ;o!0;9g%aP zO7MYb=QQD*tliX$pdjc_(|NVXCt-(qGrzwofM+HN13Gd<{7-PS>Az%#TV>80Hp|(o zr+Lt@&xR5C%Zjj&Y0HlC(tezRX|_Kk&?nJV}W-Pi4UMHVeU-34=R zSI7-TaGSck-8;%jlPnT48?uUFU1iP^zA)%^)iQjTB=ZT3a#Z|WZ9tGD^AMqqzj6iB zRg5~al`)DZti&=hsTvVRo0=tg0HvG+p>+>D5A_HO$s2}na-L6ILi06dUr6P9*!zOnR~@^W0KA1A2t37hN^?a^{L73rfU1de${& zDhSPmoM;%!YP5E9`~Ni{6g7$zJuf5HqijNNGRivpcs;PI0% z6}`LLKk^P3iZ~WWia3-vj9Wfh_^x9&tE+0H*7<`+_+hmoKKY5Be@MA)Aaov~Z5tM! z0)*VESmfNshZjcWC>>UdL`|5!YC(rM%(&nWevXR>wgmmtV*UgI|;IVuFl` zb~z5QBA^SKP^2e7fO|Ded zjLVY3)?1nxTdUBv1?5;GnPsN-24oMEh*(oDn{7G*txMzby7lcUaAe&yv=Nii{lVMS z_3m%GLWWo*Rcel|iHunw%@E`4495EAdMRCM+0Cr4*L!x~0+Bd*;gmlLrHkJ3g{mqY z{}d)BVd{l+FR4;BHnWm5?v7zVRmZxgAgK^6)Pa^upo>t7K=Os$-n=C}Q_ht#MS{^s zMQyB#S&p3LAsDtS_x?$xO=R#02Vjr7UdU%kkPFU44jbGf<2abKAY#|WRWP-9xrs!T|+kj-sxJ-gQ9m5b{0U^(K1eXD2zG+;6K1swq}Dw0xJp1PgDcwvee`u<-Vy)(6u zo_eotxF~Nn(-L@cL@BICS6KB((MTQHP%!*Z`GLq3`f4DMR((WLYtNdX=X|Vv1YHnl z98;S(P*VPuhtmF*SGS=dBVVGBy7Hg=mO`81cIZ8X(G3g}nR5r3P{ zJo0J8sOcz<4Hp5r1bEak2q};zb!Yt^eU(U~>faH2OxkE*mS^mOHRRSHq{d^#6l^Y) zcx2z)5k*ciOKO?YxA?y~%YOu3q``y(vC?`YnR_opHPf;R>x1d0s{h3KHHSTk7rZQ}N$T6chb~MM+>rN|m;c$nWTU#JrAP%G zh+M=}@oi@MH9K?9rtP-rG@lkGf5B#RbvLT3$gZmFqUzkEGy6plB*?-6=e@|M%gL+} z0B!)39Lt@-B%;{#!z&9l`u1{NfFyXv7aHpzLEp2zryA$$wPOvfs)3q)`E;Ou1VDu~ zQzo(4;?ZRZbCCv2m%7>P*SS+|Um5aqtZm3ZY}RgKdgUIex*dlNe=&p6Rtx-e*rT~R zQ@gj0rbWA!Vvj{5?(a-tpfQimM0?$9(se${^Py+BVAy;I0W~n`3M-zjiVGzu9m0sp zz1m@yMrye%FB?prknV$?c z7MN7ZE3!~eXukX@y)CF0ny}o`3XH4@FFdp^7=14~)eU=ow#1JjI$k2FZg3My%PBom z82dmdE>qVeMoeX)AEys?p@uawxIV~G=_%}BNOMjVKE zNs1mdcThmklj4GzKKF$qqyW^D{SZN#a=ku~;WPM*u?{Zg8h^M;4x~)eep|l+P6RNO zs}n(wLXYlbsTvh*)&_7G47%4GU^hc=BBy!cI2y4;xIo;i zTuU>8d7_~uLA8+vy+B|4rxs^0JHns0<@VdBw~*PE_&RN(D*+L^uiN^DQOl`?5IYuC(-d?>y8>_kbShKqc$=WKQHk#y; zY?nH-C+x~zt6ffi@d^eU-XHBSu8hM1vF_&|(z@!i7`T3(d|9!?GeJw_jLm+~6Kd|g zAtMGtvfuU9-F8WYNh{>l9Lkw3vf7#IukJnaM*Y6P<@un1C+L{%K_Hwiriq+bG}%06 zY@#{NBD34Pj*_h}pXi9-$J^?~9(`gAzH$>U+$NvFe`tIQzrR=?A4Sdj;2_OFmeBfw zQ$d(KsY+_SacuGDUw7P)yUxqrn{ceXsGGc;9w+?l)t?W@p@`;K-S*%_?H}fmlL7*1 zlNaJSLS&&^n>7!V3k%WU-pa7d>HvNm?o$W_=5PgL-Xc1-pcJ6^Tv@AJfN)YF)V13^ zT1dyKi_Gbgz(n;2b2s%ZVWwop+Pj{+#OZqlCVJ73H4vC5b&?}9Xl(>e}1Q``Cl6f z-{)F|-LAgKeIGLWC^kVDfJKszbf7>>b0>|>dh=1S&zb#=LNUTb@~YfI6L=)JT3E%t z&My04|F}ZVpH^yOVP zXZeMK;iBrfmEToqgEkxmR1ptbHZd7XgvxC}>TNseR0uv5Il3)@C|~ooOk0pKPp5%u z;;M9Pg>Yr_tuR(X1)PbpT2@EM~FhW z-;DVXqkD7z#J=L)h-9;D(4lM0sJ~s=nJ>bmQc^ENFl~6sx1~(lYA$EEd}d-qo4zGP3Oxzzvg5gQ;xS%X>MEWRYv?@cGS&qAaUrW@1$;`{Pxor!F4GO8lF ztzx^SJ?dr!la(S~tq-gcN_OA#zrNl)4QrUMgJHw>Knc3Vv2+l+f8?88VIotApki6X zMvh3>_lIB>5e7CBF`D@v6LjO*Du$f-$fwL8ZkT_|7_MBV1LXXrH9FmCaD`8s);S(H z5QD@7#bIJkB^1wlI(+J=OPhqNx-D}qb3raQFte&Fx3-_?3po?&pihiz5zyx){@4k+ zXwctRPIONdMh7Sp8LzFi8YgTAdg^P`vfW(+3z?c5D3&cVYoF303RA={c!LdwRqJ@J z1%x2L%Z-OyNs$&FDdvYV<-_MlSK~Vxg)#AGxf1jzbPJ3>nNx*|RK6&CC0rM7OtL&PrzR=Xnbc1C3?bva;&9rb ztIWLt5kenU5`u16s%hoBa>Q87^w)3qAc5+M{Zwt78PF#+BI5CB)7LGLYKpaJ;7|E= z#g=D)iM$@{xF!mxVyRdZ7Y`j02)$xP6&E5R6e>hoggfksCyZ;P<2RTLttl0*P?`xc z{ScDrLY({I!2M<`mI;CMK2G#a0EK`&#{ry8PG4SmWmoTs<6^-+$WJfG7DAH+ZM)`l zWqcgWh?Cg#<%_{2FqUfv*TKH?-)$*ui>z^IWEM&_yT@iTmxqD{yu!uAT4MTojy-#b z%U+uS@7?1quQZ)dms0lQVDqUw0KvF&yt=1Y@!S-!I6;u`nq&6F);NW8{wS#85KIC= z3gNaPECfgp+UP$(loBlL)9f z3cBXPc|zI$=Bwa5nXGf|uZKm5kI|*{02)(YG!}jB7Ooel)#4ZWAx>q8bwb=&JSpBL&TP!^&L9)P2cwK&z`WEbRedRENF#ujVMECuBtyDIxF@%OP63piNJGG6M^B|yPyO|lB%WHT;0#8m9=Ru{ot;g~ zCJ(uIx9PP)9Hu$?-n$<$`C0(mq5f>;`%Bnjy5ruN!!OEXP-VwM3DN~r>dDp&uSdFI zd4{uGtwFe<_bQDRc+Z&PovoS-tk8G^o6koOOT&S7=)jA zS;tw;qCS0jZ^bcTv-5DuJ|n`jO%+sA#&0jrD8SDKi{&rR=+A4wCj=B74b`{owCNP9 zO*{*;6pvxQw3iEX=@rNBwRt#QbN$$l$elxKEjF8W7TVz*u_qvCO1}m0L+M}r^4q8I|Gux|WdG0mrKWV! zh8R-MJ+1SQ>Wcdg;#;cJC5P&|)Im2VeHze@DljkzLobGxtF!s&Vr-_qhIM1P-%RIc zXQQk7>>S!=9A51GMZ1J{l(joBDgOoBTffpBG5Lnm!rfoGCirAuPZ&KOEM76x?x45> zs*6w*%>*Pmt<>0tPc>ETS5)g?dGxn@^lVeF8zs1iu@vJE`QK1sb(W`hegR09f{1EV zTkGV;P{N(If4IMpq@~NrLnlcv&Hw85C}#9}NCwEo&o^o7RJS~f3K`ktkA|BRuqvZ4 zF^7V+kh&_~NNeD8QJJI3jLD{=#s*VdS8cxCiO$qzXnpmC(3YE`I2#2I1(Ch^S!MHPq!q^)B?AA@WXt0ai4)Q}Qg!E<=Le!Wq3X8GCgZ#<$ ziz-nmF9;=QY_A+hibLI!3K`}JV7wbAI>8jI;Xxq8aihG#cSSt3;|^7yChWR__H@CMXS(3EqKm>%_fvFe~elZN; zOt|PFpp%|)Q-g9s4IaPfFv0>HXM#TUxV|cQsD=x6>w?BV>p{}QzN^M{Jip3ko-)Cq ziMAm1fEW}8&o>#tN7n-sS!B#vm&d*T@x1?v{T>GYsYHDpIL{bfrXC9|l@9`gezF%Y zvZEri@&Soa+xEmSjx@?l;CK7bMhJ#Q9J&F5n1FJ&$_SG9y!rZQwn20mKflf7cEeV+ zG*kemjnMCh(K-OfTixDK+cxO?waHh@=2WC+b7dxE*pm!E2LU5g*sU$FO2%G^QA>vW?hp=^KlRT%_&f~XG-!7Y zWd$4&?oVt3)=8!TfiEYC^%|3O4Q!A`AchW$mg(0TEscK&ruGy@6-^9XaTEvl zCN?c{WCmRe$j|l%j@EwR>PK{PcdIY~V-B1|BJv5>6tJac#v2E`kFDnq8m=8)YQ z5QdaD>WRl;(m(;IT=*&R%5)v^0fQxofUi@^uJsjbt<t3?c0m~B8x;_~vaWrq zHrsXDX8Tu!KYUsUfyj-GwQTd!c3Z0oD|z8}#0z?Fg#6+X#}CiA=P1t?krPW|p&vhW z)a@%+lie$8v0(_rMF*5aN7LWiLO&xN_lD;WrdcLv|V>-@;<5A zMyj7o!N8vSH(U(Pmy*YjiXl$aD9u4ZCYStxh*)^rP!-1Mqj87krXL&q;#a3X_Z!v$ z^cuFvz}yDN!ux;11b8T=2~g*75y|T%p7cDi0@?!juah~r)1#Ov~Sa6Ne9gg4W-;w?A!Z4oZZ$P zHPQDRwV<-FZ|S{MW$ez$PF<=VPwp-c*2@5)0wE;*jCLNit5BOKu>ku7C*y2H_}47J z_ODq00Qlco3;(l>e5EmNcPNI`J*)nQ3Un}c2NM@6emV#`k!b9<86t>Op$P@bS$vc6 zX}rBWYiB!PyMYxpUYZdr-VQx#S+#bjibBp6T5hLjpz(rzQr(^&Toy`9$0&!c6*?&* z9|qYj@tC4ri!l_8>#gqH(4DGX3VOu-)^_Ejvyy&g{gci#n7)TLvxQ#G%~mnxDS|yM zl>8fZpZ*w~l?pFS1^4b2a)L114J#Upo0k+HgB;^-LU$n ztO-t(pb-50!B`cT(P2~vnCUUao!A5tW(RxsNU~T<4RRPt72 z3pzEW5MmpjrhI<2&cYZQO{-#T-jd4qlFGz-h+skns-kyG!JuDY;2%o)*XyPrzdF z*^_#+*1XFeT}P`}iw&Sf+7&Gz^xd^b^`8Mgm(?_1Lw7S z62a$15ouBc4+RPZNKPzAFNEfTjQmy&xj|$OlxRxMbhsFLGl6sYWiR3`-+f43G%4wHY%VTdn}*|dKDsFtK65QG0+GsjLj0<%0;N~U zW;eX?n_YYW%)B)v#=JTW>0`v!w`wXcI|PBc_xQ%=OqQD4RR`A*G9DwA zZMxb|x)33mb{t?Wu3g$2uAeEU0>O#5nx@2!Uiwpo!M~1kXXt7+M>lx_Ir~})K`k*& zaU;St&~Aa!Vqq?PjUHD!W(b5+9}EEuBZ5HhK*y3q>VzZ(Jhlmc-kI++2a>@8?Lvb3 zB+hax?{jyBnBjb8%ZX7M8d^Q2!jW81e{dbhTl1YFq61hT-J{w-n@gj;aWZ63(c^#A z+tAYGa{vXlm!;;6Kp(hcj6|#pkedxz|3J7dhU9(O{Bm0|cUh_q>pBRb?A3Gj<}zwya(IfTP_poCnqzPV4?`_d3Fw2P z;ktkCTUeBer4>rKw)_I$Qe<)ZKM?f4t7($i_3@sEMM#vS=+3qtOI^{}=jbiE++HZp1tDd4h+9v9%V-v&NVsXkr|@u%$&N=-k0fJTlc>1gPhRI6@j zF;K{$pa%dxp79zEHz{c_#zk_kF~?4^;P@LxGsYj2T)u)rqul@jZN9n;JI1`^u**kF z9^K0RhgY$`#!o)%jbCK99`p9(kLd~7LOx(vy2aw)IB3fNZqAJ9ybu%HHc9MNY6-d`FQ8U337x})>WKAzw7V*EXrCX8Btr#{im*4OQz zOOMN&)~BOSBc$JX$;1|soHXh3Kn14#^TB_* z<*pfYNNbW6E-YrsTf^xB1E1#VbNm-6mx{PcdF=TdSU9Rh)17~%qgQ*ZenE$3ffb}m zdGz;3%>rLy?cUm}ZfKV~LY6&g?eC|gjguP+Vq)l9trM*32C#}Hsfy(VTzslgi68`C zkC{#a+sdWeWcP~qp~iLECTZ@7BU9{w`jy#yZG?)}gLE5N6zi@JgxNX|=-Ur(bIBD! zH|HC)@JT1SABaF9#>0;;lnTt^2LV{^9ZeTKO&QlI`VX#!^VX+03Qrv~sQr5O|M=Kss=zZ4&&m$o6ZGfri z?eO!r)ug2vI=*kIjwz(rlmjt&m6=NHPEV#u?97TZwm zcz~cIY0P(rJ#~lfbqhYa2kMh5<)2`&;1BbQ`k*6&Vqv#+4JK)}xL>&$8=IwCz@mBt zUXh)}-Sadc_pEHcnI5%eVih3fwC?Wv^ahbcgZu=G#41IV%V*iiUk;E!ntV0(7OH+Q z$6v%6=fc6@q%oQ+C&RZ@y-HOt=K+p-rKutv#T1}xRt66@P@f?K33I5_uDpOEl%<+r zBk>H`bizI!12dcu(Tr6M)Ejy`^aX*@uSuMj!_2Z3@ur9Xbfedjaxk`);XBOXU6Vja zETu7{CM>}b$;&I1J{**EmOmACPFi+i{S>SVW=0pC#7c9H2PM%FbJ7t5P=<+2ZnVhCgJi8oHsAl-g_R#&uPIC6n0NT@(7c$5%IThGlcFcMs0ed`*IthRU| z4TVf3v@F2#vtXS<1|N)(q|{h0JQ4eO)c8F7-HPT5fGIDMSz5^1KE-i_NCm4LB#$D}u?7W3nOF?LSTk*Hm_j%_;?qhqII+qP}nwr!_lJLx#-*tYGC zlRoM1eCNOU_ZVki)Tryasrjxo=X$1rtAU(Zx;z5}^LKb$Ala&9r4d+fa(ix!YIfF# z6Q9M>6DzmbO;k2`MG<_Mdq7#YthY>1K&BybdAb|(eYnAcI{W_i*yPc7lus;M(^w~F z-~3$oSac_$5cJ|eiiqQR1Wt3Ak~0)9td@F^Ap%uE-Oc+FrmmTqN7V=aEciM_IvJBH zvWygTouwYTaee7N>drQ%h}AQQf*_qN8Yec1bQzEh&;{Sn+aI_=s5vG}-o8O0Ngf=0F*x1biFP%e^s?f3 zxillwh32#*fv|+Q;vd~XSqci$#P>63G{Zz)`bGyr=V2E|u9w_x3TI*8EAO+qs)7Wp z-9&7eX5v^U5XD50UWyTnQn5fT{Aj_83?=8jna{VZ`qc#Sa_v~iA6l}ECv5cwcqjHU z1W%k_ctoR8GJ!Cr&}>QTyO3nu*4Ji%rH$KERw+}S0-f3}?74EAy21`Lu_?p3?c1@r zS-UYiF@?eiQOe%Q^lsp9Ngv}n#_H#}w&7P&z;x(WDl0at+pxE`@-hOp;D|A$)4$T^ z4He8~JYiq{et))8TC1E(PxlX59`bu%ra19I!i0rY{d0a!?jAc{tTsL%3h!5GKvfH zzzrn@aG{yt*LwgxaxO%dhWsdGKw;e(LZ8)+1wuoWMxh-H-o{^R#AOV<9gMLer}7|} z$Hy9h!7P{rA`3P}I$X=`Nt6a>-O~DT<-Ae*S}S!$Mm`llnjy<})jMFw(j zz9tO;)OgVAl$~yjd%dO0P9fV+R19N3-r%X3mrB&2+~!p_rqhLJ0IOwVu@x6g3cV2$ ziP^btTqsxWv5#*tTfWLuyT#teZ{5Zjkn;?L(eBDiV>|9aIAcVZ4oa6=FG>ik{aNk* z^$N2U+Uc>0d{`S2Bf^w9LAC^{^}^~s7r$z-**#TJGud;5WNGa{GzZk(vE2d9-MEHx z*;s^nKLtnv7Yvlm1m%DKy>fUm9vZgN{p;OqL#F-F?U>i^qGBU0A_Q?RP1n!&C=WE(y z%88A1c;7wW-OyEf?c8EgI`a2FjNekjnxxn54vDnz#;wyZA6?Qz#Pm}rO)2^mCRhwL z7oD`X`@OQqUh0|0eq`2a7Cr8cF>AuN$y{v=?6qxQBba>LU(xX_@TJ8Za#O{H87uKk z$E}NaQl3$KMQX4mXH#^_bg&D;u@q{nJo5~Ar`q z+XmM>q~MtpTf-BTq#1|r)i%L^_U>u6ZJ0Zch>BSYLtnxbV|&{@W494HMH)ugG+x?u zFKZoQ?oG^$u`mpg3g{l_?amk*_=W+|;L%m0T?4`GjB~g`P1eIRp8kbfKoCgn zz_nViD9F+g_<#g*YQu0v%y2if`QAu$reUCrjsS@sn5suhF?ZB zTK+_Ki)t>`{1US{S?ql6D;3GgLvgRH^bBf#G&nS^*Bp^Y&qpu2;z+5DFrk+ z6x)`sCq90)K@o%I*+;=m2W`w&;Xj!5!sRb<$|EzR-kZr8604xAGthvzQh`R0bg$y> zouTTYAo!^>1CIoVi04N}8tPP=uwcPZm3S%5`IG4wc<|;`;XP>&+loX+uM!1BoY~Jx zZl^P0QWT?-D-S@w>7#^_njjB}e`oj!YRk+PN_CP}x(3=Tv9Kz)-1yTJ0|YN2ToO7} zW{^byZ?s`!YO7~t7KR|upJZ6(p&q9rhEgP5y?ssC&h+Q&yA1ux-r>`660$W_mb0p#^6^##Lz`_&WB391Aw(sJ~m z3*X37ZO&O5e4M1w-d$K15zDwL(d5sp;#DH@wYXdBHId6neXNaKO3M|XoK`2Wm}keo zaLKemG|A!AE)G$OPn(4&$+VGvL!Mhv70YIUj3_jRtmsKi8PY4h3z)Wi`yN~_FKOhV zo@$US8D6jp%8U!!`B=Pwc}`J~0dfK7<%chn20u7;K2xc@ke;MVd3*|I(pfd_Xw$s* zae=m(xIf2xTDxyOUP;_ar&kZCdfmP1P>&uOT&I|MW~qocG1)YG9L`a(ufJ%yg?w`x z8v_Y0iF-gn5VX5Pi%1?o+ye-v8d)_d-yg}|5dnswWPyd!TO~cWBCVUSXtbjjv0;&g?yn6qB32t_ejIbi>siB=Ga ztz~Te1TBx_%BS#$rSu2{+JTBOUy7_$?uWmv0$d850g_pH*E9Gkad2*tpb-pzne>Cn zxsrGzrLjf|_T4RREKF-z!2KN-0kMS^{E5pZ&Nk`#2l@E23(|J7M278r*F)@CC$ld} zS40f?=c$L%A~j!Uy9L#w8&9A<~cv}m0UvaAmq$7b@p^vD;U#w-{v3hOik}+Rms>O!dw=<0@)qP4fOtNb-N}>A3PsT+oT#-$~8CT zdMpd{@(eEim+_JLz2X*b{1B^&Z%MA^%v`P!B++M~QoTy+4U!StAdroSIcC+%PZU&ZgXc}Iw$af$Z`4g{HX*bTSHVYd< zJ?__Z9kMRw<@@J+A?G32>BW1kwV2nm`o_#tw@bo^T{6lIl$wtBKBQ?w8t54O>GUFfTI*;ThELFuEZ-mbSe*9+hVch| zppFT&SJo5ALi!(|moC)Ce^Tu)eg5C7&C2kv6FZ0MGJg}U-G5b^9*Ob&)7(}h3jnTJ z{A()_5N~r?qp9IaYBQ((y3U1W5wS2g<(WiG>$%!oJR6?vVRr=Y;F`00u?jN%`NzK9 z{av|SnnVO`oUWFMoLK*997Q(9!eYQs=`-bbH}*Oa_ro#vSQVy zve376OS`+$ZTYHtl(UT=;_A6|OFy8p^g6o)d6(%c${Blw+VjFll!D$A-kU$=BwSL+&+m7F4u|j4w+dXjEp&io)yd zsLDh%Sx>nt)WUQ*1C;~_4slx;@b+IE3X2b72My{6{~CC)4@3eZf$_bPfckAm0oIL3 zbb=ks5H58HjeH}3bM^dHP5G>E_iz;f_4Os^T{peddD%nPYBG;`NnwVhIG8DnRu32^ z=;^Q4CypM{Ok~&q2)$7CPy*FQzU<|D1>*)1hYb0&-HIHY zNX3*PNgSJGA~7?GNJPY=BHSp<9oXWP2*?zry>;+Fo#T6*d+Q4qx_?($kF}iGsFrJE zTy2Btc(DpB>-tcxSvLJq|IL22JZl-5QmvUM1czoTV>swP56$=pJAzzPN)J}>J@<{G z=Np4RGg^K*t#y=KuAU8iGk!<*k_(XrjnpR}1hXO#{2^h=$;3GcJzkpS{? zb*?}Vw1EXJ4AJSg&n7ee3J;o(-zl*652JJzT|keabv`*Nk&rMktg#WNIO8qsUkf*@ zBUMz?y0;hUMUK;69^@sjhT#z>8ZIsE?>5q~IjuT4^r6wWL_?JW-(zh8zJs1D6rhq1 zzjxvBhzm22E%6h}d_`$^st)0YSn3UdV*%MonR~-YMpHLu+ z1foHDNr$O75r61Rs2u@)y`_^&a%pUNx1F#MHw`~Jgjn1yXXP z2}NgJ?CZCKj~J_K=5%YmAC(51pB7O_#~GQ4T&o0 zUF)I)M5s^vK-qPF%THF(MT|`=cN_WuYeo%%7fMWNAtlt8{7JE#tpCM3_-;)X+=2zY zm@E!WX0BtcmZf|j?bTwFD~IxH!T<}!nvIj&ZmAkpajN-|B!O+*N8Ru;sep$Zq#v!= zx<}{RRNRHQ;1(L6kgK19{DHQ@hJg~zE%^SpOy~MFB-$!}m7B~mCW3HFwuROc@o!CQ zwiGq27Php@7Oy>I_1JE6gK;2;NkcuW+Qyr^!x^+o*kmF$yVOVCx*EEQ;iopbKo2*6 zkFZ4HTN!Lofk+=B2vZh^&I?&8rF9Mg2qmYfUJL+HiV=8&jBgfI46naj*-$x)5Le9L z34_Wi5@K=#A9)`r=39I4YAgyl=O3g#VE0!d&>27kYCVtu*;VM?pgV{{ed7AmRUkJQ zEJMqmygER7h5=C^KL^?R`7^*m-YqXLs(>%>j$s=GlR*>ZE}l6D2t#Zv7{}Lle;~US z0zOC}?{3h*Seg7{HwyFR50-fwv{|}Q{_Jr;Xcn_Ps1n18(JNUwCqh%-a4P>^B6GS=Dg_WpP>>MAW@52yDtBhd@G{;CEo60>)t z@sny3Zn1cj%~Gq3{Aj9mWeS;CVp3_?*Q_VSfeBAgA^ zA4IM4q)>=uNky(BDJ?-C;4mCr$Ka`j9_H}H!yAH%@uOL*p=wF1DX&y>J=O848#G!g zF6$c4+PhxxMsx=o*hQm~yeN>gU6SaiHVxqX{Yt}6 zIl^qLgd7iwrUWXtrisN6kPvuHfB;u@JE3%9nAluT=g|L>;LnGmCg)yu%ViyuNTn;vD??B?hJ8v&j8VG0fh*f@ zwoMF^S)bo5&bk|V6*<6Ijuz7xJ1OS9SNqcPdG0^`Wm7%v1^c1-zaqT&Pp*VOp`ut( zm_*_W;q;c+q`$F%jz9{L$(*pC|F+_% zkATWsXi$jPjTjNv-&A8PX@U)fzwOj7bTF3)oJL7iV^8#)IO7v+238R0s;fdJkpT-v z4h>&eW))22M0H2?P6B|SmzgznUzSat&5vaVlb|T<5X+Nem4ycecFv!@ki;@QL+yw} zpPxugdxHEbR;!E7RsFeYdyUNyX{ZmQqKnjx1XcWOe(L6vNg9p{@<+MD7kKsbLRHsH zI1mPPKo~K$p92lGm)`jln*=CsN6S7;lj>R7Nh~8u^G71`Y?80;Bs!GT_b@>~{1~4) z-6aul9|)PW=c6}aIlwBDG+vjMKyEd3Ql7|3ZK2(IuQq5su_1=->MI6 znysp`mI6D6={RoBy#AEr9f8mp;7Ck@LS${jXQ2hP%h8$!GI`!>Z-d z@hBy#1@_Q@(sMq=*kShey{A_gAlpE3904>S{Hf-onW_zAlIvX`TU`{`e5i8OJQ&ldyvWy8O+Xlb>eo=N!oZFhGMAt<8Z# zilKjRje>nL#h=QcO2z&Uek9D|!a7*avmQ*>@Y+B9!G2ZJ{O@NuJJY{@mN$Pft-mU> zz8ZY%*ufcE-+W0=O3YD<1pZM_)m=4d=IMvaYk0+lN?``m{WBww9ws zt6$0*EiW8xA9|=~m(^u+&)OEkS?;(Tr*m}Ou%wqo?qxop-@aowNVXI-|3$fbtS1Yb z9a<4CkUMvnXhBWOeT@--g}bq$?w-`NI~vz%#z~n_`XXqoaFEs3 zW=Cg_VFlL%{nFiw!Hf?8GBZWWm*t=3_lIVJ>WWG)K-wMnV}^{%!Q}Yptq(kyrT9pT zdU8tM_MmzmPMb{BI|X=!R>ENv7ZN|1$kmXicZNnS9Ov|sr_$DazHl+`~}rovHTapcw@X6cvkXy@yOZgFS% z?p;6rFhICKL{cv>Glx5>Q#?_T4WmKg zR7q(u>Ks4OPC9%9udyjiu@Fdw1`Km*sqW^7i>(-z-sGkXwlt7^U4@f36f{{TF`7~0ZqNX`C2K;9F zkoL*jugS)P`~1r;@#3G{#dF<_#!R3FK|3R`zzZvwiP2Udar*NGxmjve%KNUU+ zGao@_a0j{!&*RD!gD^h{m+#S+l_Z)-e#7#f(4V8OnDjlmzMGq~``!@O$Xf;1mt0|^ zz@lFW^^Qi3r~1M%^|}8=0ud7#^GHHifCgVkG4evs-43t-!P}5alDF@;xX=;C1Z7}g zoE0fVhkrx|f`8IV3fnw~QEi!1p%zG8_uRL&4H^>OIrN#;8R_rGir!(_d&tW_57)yv zYeH+3V249=uQ?7%;2^(Ao)IQS4Stz;`DuH$t_4Z?++0z)fUZg%@SzzjU~Mq+P{ONK z3#%R#MxMZK^41^3v|Z~2t3|<(ze!g+NuKff-n~tG30l`s_cCQMZ7{p}1uyiH#0C7s zkH3Cg2fYGXsjsGlfv+~%hzkp8%&{A$*5-+@3C|st;mzkN21yBzT|b0FPvE9fJ0o|d zthm~9BE2;bmFtzIX4KgdxCtxyX3QrX2+k2{-n4a-FgJnp$%eKu!x^)q3R zxS;t`z40V$yhx-Tv%EIDqve?^4&6Htj3VxGo+`*PE(PwT1vpUSjrD4zZnPH!|Ievc z$2`Y}?V+q~Bl$O{9Y@mLI$2O$aX0~B!q<#G*j0M8?mdFz)Sk-1^MW1iica2`G5*a} zcm~)?x+a_f?6mbG+IML+=+rc%WqIFcR_$z>QXM`50d>hOM|0}m5o_x@L%bk(Fk^cStcDo-Y zM?W){7MHelUZ*;_o{_q44IW4ITxS{!RE~S%bZyTUWuUBW;~NOpIFR{3lu#dy)sa8J zqcEGA|4|YDk&F9Z(iY(VpB+@0>i)~c6`k#t+pWhpydbSkO3_P+ATkty1AvVsO4_`B zCSwpWu8z0ALh16`Q=WJ&7pPxa!C%A=!Ui8dFh#QKXW~?wLm{>$mucmFGf_`FZmF)> z<@h$a!omJ+$ap3KTm@D0D8!~C*$Ai8LH&jep*`-2afA*&Z^CYLp>aoEeS*6mslh;g zjm!8vE&K5i@lx;>Vtkho?w@`x(?7XstQ`NIET;Y|@$X*l{9AgKwh7Tn+H$FBY zJ(x`7fI4GhEnTxO2+P+CU^+GH;xb#};o#$LWS(Mm9h?Ya+OJyGMa?F1G6|f-`BO*- zf4riyb7_;0e%(l^ro%`>t=a|X{08nFW$1#5LyI9MUDY<_PzHG0g6A5fRkP3Lh0$*8 z{Y0;Jz+~qua;)}Jv5_*OWmXrlbZKLI7x#JI!i9HsbYgop);;CM)ydaMB8be`e_2j- zhmWPtTifwbVZMe10g3w+@#h%~LS{Y-#%UjfH{$;D!}hWJ7+D;FWWX?*QY_muk58<= ze>fLY#jC?(Rpq=fk8x=bAm}5ir^khhz4lk~$G7(IOXt={dqqhQE^gQsuqkmk4g4e7 z-IG=#fV&p-;&7r-2_l) zdI82W^zI7c#f$Zk>ljoHKu*EHo6h6WK>DFAh#3rhu1C6|6be_?NACTJ9udPJyj3=j zo!GOYOJhc8>S~jn5RC;S(V20}sy|{J!Tgk4YH9-k?o~|?VV^5iJ zZDBPVFdCG!afAc0MLf94)h}#xfbyLHr;~wP zp_}6YaqJ8%i3&fvjY=4kOQAK4DJ7e_0Z}}LXGeJ-KEi?(5b<3xQLSfHGYMY4y#P2N z5NL@wHq)MMvZD-OomiB3W>H}c+n-HvUpv6;15KP7xFfKxV1CC@7#RMEgM(&!OZJ=&hpQJ+)@i~ zAW+4YaJV|*Nr(eO!u~d7KVHd5k>%t8N?yAxoBWVml zDDyALt?4LlwiSazMej1mj1Z;(!*EySQnchW+@;F=LKbc`fnn{Cei0uZ9Nv#rV-A_# z-{jl~3(FDJsHXW|35*TgXL_&PK6U{+i*+F`1b9kRbouhXNU%D$wEavj_OZXQU^BXIUUusEVvL5D?f!T|XpjVU zl==yzG4!F0t`}W7@wp7*G<9t6B4}`FAjgwl^ZrLftyKScFSmwBi}U_ z+p1@vTYOXa9p>N{D8cQ%lh3X7nwp3T%hk4be4#f@g|+WzE1~V{ zy;*IuTU`L9I05sM6p>#Y+GB``qPsN3Qtl^d&h@?4Hf%-CPt6zej+PZTNJ(3{fcm*q zU-wndaBdSmXM2Q@BGcXJfN%bLanEhyZ6GZJ;(Y><5pIx{1RCAyQ=bs37LwBcBtrj8 z0{c4b`j>ghFTCYnbLfi%_Jy}pXY@|8v=t#R_s6htwUaUD^Mn(UUmJflVZ;0}E z^c*8CJeggOO4}4$J^y>rI?ZddB(r#N?%3Ytlgunw_Otrd}v0Tl&=9(Qw8rdpj`nLOK402`CV`_aL<>sp7>Emf%w; zruNFCTQI{Ys%QW~xn>ZSzqUa&I+Ia&ORkR)qm24DeuY#>N3*F#6K1(|*)LcVBpsRr zreSp)wp=WBZBOs>hs$DH*^p;eB#;33xpbGzRRFN`Pc}Fhbf^Piba9K`pMufM6i^2s zOdg*btlEyn9M|u1j6d-O_wT>anV^oy$b~Ity?m?e4`pUC%PvX+{;IKHGipy z_QHmaj9+-)l}VW=u}<^{H-JKg z*vcO>YI$wC)t#RusJaYJH=gy3DFp;H5o^%Jhl=Cb(}SzP^>l^#fhQ^szlD$m(g0O} zsona15n*wVMd5&0&btKb%}^thh~vrVbyP)b@X;}rs;*z21%{b?ZDG7Y^#`W@iuZUiCGB^}tQ z{shWyFsJ1H%FQ|xiYrP>s`=Qcn}&E4)~ezRsfTMvN!JAFbeDv1(t5%jy&D>;BDrx9 z1NkQs4)j|{JC6ZfgX#g4v-y%lG>7JfhIn(J?pvd?B+@33?rW#Oxsn3c5>+)s&_uvI zI0H0ASbHb%f2blL#UVYQvhz@R^rqSb=S0K$Ah+u79h)_lCR4s`9KSj0Rp(Ded(J#! zqD6A}n4_@!=L!;6wUusOYSsE>gY|hUgDKv3E_!~}K%Y4jD+utBMs2zEgVHp}@*{C+ z*V<0G{$8x$)=I4$_sE#DAOy`hkO-XM1m+gJ7osEvf0D6dUjLqV2y%Yv=wm{#;Ec+) zXnJJS{ZsZO%z_kJ>iQGE9CuY8*awad;@7u1y!M?7t!K(rd<0BZ|DqWu#%uPtlo!|T zRp-&H>a5Kk7TG4B8*km~bHo%on#xPdr$LgYvngWK0nunMHtJS2jpx^~-0TU+c(Iim zVUyv$>G1|zSJ_Lt!oHf4K7^8RuqK+i23pdgodPQ-q!>^uZ_r4t)= z>?YanNVSh@JN&uI{P^gSakHxmGh$PLQc$|mAbwv``{wH+kiVm}*-;f@8L~k2S3V$t ztNsYmFlQ8$m!VUmy-Kl^dEJE!s233^pG%aBST8Lr*%la`75SdAC9r!YXPwwe@+2+Z zl}+zmPSXOX3eD_LXt&A&%WIB_ICOzUsPY6v)^*{Fww$#%+3>&$w{^T5l8vv?v~2mf zPU;2RFAn7!-aWJTH0yBTq8ua>E&#*bYwn+dc1J486&RC%xkmabKUygrB;AAHAyz>b zu+N4#rMaEfcfk=fWOm9`eL-!B=z^HkAKlS0j#cln40o{!*Dhq69yJP2jNfiRN6bC} zKMIc$wKKKB<`p27s7z6(ponMMLHCd^i<^m8F(0oq z{!W!oT;)?+)(Wis(!fzua*xA?0Isa$A)5^pR5q(1eqOZYuqh*}dKb(b(dTd}3X(-` z#+~2uzEweLcE!;X}2ft!yL7|(ED{_ zR(C-u%Z?CB1M`-O6=M+l@L+wZCr0d=Vh!`8+*Ewn1-)4WKewz@Uj6o$C+GNdUeD{Z zbPkuReJa}SZf^&!?IfYbdurZImdQ9?uAgP$9ILurm@R@&CwI^8xNaPy-$4*29)?g`5S+b zFqqPu1`%qg`SA)O+I)C32pZWB3b)yg@88mp=c$CWPx{lLhxY)&aqKij$6$hV-FCb3>Dj(1VImbgbpA(njsX-;-V?e?@ zQ|K)f$94o-O%{q~f!En3@(UedUGYy99%<>Eo!7c1L$#To<_vHH$31%a(3 zem3sgyH?*2mNWG`&59u&F*Mnkwnh?k07E$8bY|G;_IX6f1o8)w4e(Y7p8seEAM&3- z%CNn|ksn-r9225MyzE5YBx zp?(V0P2jBk+}45)d?^+OpByNgJ0}2fL4pwJwpHX91uun$QbBB={18#uux*I4?(Q5X zrY=Z#u;5NPVCq*jrvRc~=?${c$1~hYj`BILMSE5k zq@kc%y+*wwuy~s<$VlGzY+7fjsT-;D0&1#x5Sc(A_=FRTnmqk8(DO z_T4bRlEBAReNqJsh+%=+6(&?M;?!F*D@TL{_l6|}axm$Ebtk$UuG=YbjH)<{nydIt z0nQO5NC{iLVY9T5u1t3u*p^ephHXcAy0!AL@yho{W)x`W0g6sz$Azfh)6{?vk_eGb zyu(Vrqm}aYk=Bmv>P7oT~@i+goiHD@JlcKV@+6ck`j0|}U zHq9hm00VR-vr{6!fWb_$7Hs~5dv>v8t4ad(qOwS*yxY$v>t;E8t?HFMU#Fi_Yqm3= z7!Auca2L(ng%>3#rKEj`jcN!yHAZ$;*Q8#%Zl^DqghusPI=2M+_4yYEAZt2CtsN9t z-vD|QsFq~Flqg;%2+1kh+!+n?+2H8${fmChrY*%Gg1r|ZQHaHU&=xlA-xtTudQwz$ zzf~G!2YFOr7c_KRnfnl|UlYY$j*Y!7*O&_4c_Y{UD*izZDN!9mkY?=NMv7Ye@`LOp zkMw@OU79K%Zrw_jqsZIwxRaic&x;`B+M@Z+oQSVoiKpUL`aMt=q(O*-s%L84J8!Y2 zPJ(&by1P#YJvgKXrvJWnwa1)HptxPyG8J(r9Sfv8o*TiKuUkMM3&PRKU&+Cmm5sx8 ziY>;7$+@^^q|8OH!!<>r_@R7r)%c2VruA@*XR~d*_>J1Fm|B~z%|*d}T<@!eitdcq zO-+b>XMcJZ9%c9OCuDDKrdL|KD7Yeht(hN?vuYpyKZz>qKLt)Wm^uITB%1l3N!0)P z6a8!wm^k!WEJ!z!dnS9W>OYfcbkyeD+P{A7J@<_!>N=%(W#NQ#*M2R+mocli_ zd&Kqg%58borJkyyQ;cfB`;&$qaWf2a#BtRMbz?p>=?m#uZvOD@IDeV{S7&E6pD>gT zjf*LY67s833S#^V15hBmTtRBN;Qt2v(d#-Dp@o_@=d~g&1`PwSvc=Azd1F^55)yKM zFbNfasWtsG!yZ^fFVg-rUC;8k*dZN3)v&rX9DYWAVNmIY=*yajr+y@5NK-c zIsz=Ze?B0u6lDUW+TUohm}Q|+U3ri-VjY4b?2=)jMYxGZkpnA_g4bObV^_$LjW)Io zKIo^Y6QGoKq31`(a4c4HKq9K37!Q6R@rk%VSwPe?loZKUPh&R5F-HM^X);(gLjg1< ziU1mIYa{!$eM8{SZb^Im!91&9HpCo;YezFOj;wFhzm5vNp@T!G+Slx4q(6{{xfcYm zug}NYB-xXqx7+7|;!m8#Lj&WcJZ2Mg1PRs*XKxJPNBaZdH<7^vY9mR;vbk(Yq!hz3 z>L$hlo(B_yIqg5lf=E{?VB~r|F#L%y0Q+TPmwxz6kg3o^;)?UW8T;YPv~VzUV8Oxq z24HV=@^ua_5J4T{PK3QH^^`Ycj87b?qSL`qnlco0-+x1P1>Fg=TnM@bvSi}2xC;Sj zAKbT8NA+v@Me3m(1+`QlYZ#D5-wAT_(Wr#Twfh)Elp_ni6&3(v$4GpC5XqB&gP{Uq z1`Yu=5E9aL>E#OADKJXzL+Fs0=EWIO7d^5cPKTlqO(e4C zvFa9hx-Nq=>F4@~s-A)$r=HNLni7;8JV(11S{-vQupxg;^E~* zJGa45pa5w8SoVauW0~784n`7IximCvv+5Z?>~T<`1`yf0o_}rDwl`p9j`E_;geGWb zauRyD&e=W)SYoWD1@tN)F16e6{f^^)wpbNbTh!@Ow`bHocCKsTDgY3AE#OTCIkwvw zG_J;kQZ$wqWu7fnl!wYTSew5}8QstN8L!C;GGv5j^b9JEf6Bhc)t=8z`2v4;W5av7 zxPPBsmr+d)6TKt~e-XmHheRuafM5@@Ir1MJD81BeWWrlQ=&Jx#TdRj}aL|H$@@R=r z00K{o1rt8-CM}ke^g*lI5;~YMKvI>?j>7e0Nlc#_X<981Y~&4{Lh&Q?+2n1}6Vo%> zR(B5Tu`OEX>jePIPo6iJcA|;soN0U45lOiW^!PM(TIg0D(Vsn(_TlR9yrU87vIOV& zpS?Gn*+ONS5WiuR*Rr}HyWmhu9uKnKsIsl8zIf&xhuK52-Tdwk(=uPDlGfpmH5^eeGL$sP(nSmCfrR0cnsUvv>(e*N@HS}jb+{ojiP}+$xFCTO@dQyeIF@1puMjN8R3~U1kvTfUHrIW@488%I zwp)YkdA(LhkI+fJx5y6R?pv){-i4D|T%ml1%!`oa} z-*NZOcs*@oL#Fq3(djQd3kHh8)U$=7Jm$zxOexXykPX4X7UxHcP?i?cexa!t=P(RC zOOf`OUDPFUhO%;Z;N`fx40e&b3T!2KV%V>=8frA(+~?Wc__d|9-XTH9IPRqf7^>*2 zcAoTgbd~$)^*;g)ZRio2_wAn$P1-k$bJn@~d7MCr{{3~chox_`U-6mpGr4Qx|I+;^h!xCz_!V8isO z4#nxJ=5S!H?`-$WNPFR}JnO_`p1z361yN)sol?=8{S*5{wT_wd_-a_K+Z)u!fkiH+ z{)Sq_gxSx3gN=pO^Hq>{sy|c2P`sc|x~f0=d)l76Ym;@2&FN3GzMAburM5_wB_JVQ&g#I=uJsThQ>cdMx%XeAEZz&{Bv z+dl~~8_T~=d|qb!j{txF&OdnbAwDCO1&Q-8L+&LNC}=gV+uU;ToM8G_fFqNIJ*hn0 z8ZDFn6jBT3EZHxn9K{YT6ZVgmfpWfnUFqB&ROX_8n=CI36Bsj~E0A`{JJZdsOQnee z2z=VyH@lO&$G-&lRmmY+M~80=yI}r!@w2XyE-uVcNo$va9)A1_q|I1~X2y9Ku5{}B z*|DyTk+xXzePx+3kC*=3$L;=3ecF>JaO4Z$|99tm{CDRYEr10ZZ%w*o^xvH?gWUhy z`P$xs*rB9i*{55AM|$Qm1ox^%U(p)S7(@t&&UI>n;QS?HefxW3_qF)l@{#*m{L&x= zr5^?C7#&{^sAzOn4wOsL+h1qUFeDfQI}K05q+!+b?h173=;p>HG^_1%F}$Xlmzw6Y^5XJ< zJ#A+;`@4>yKiyWJgg%`*Sh}bwj6FET*ZCq9vo!@8LiI133uQ25Aw#Yrde;uH6BO#_ zqlhf@LTPZ_(g=RbVk5lJc%UbXa&4VaM&8Qmp?<|1AsCo+)x2snx&Y_c^4K|%;U8m+ zpsx(Kw;q}0KRChZl_&){i}d5^BkZDnyQ(ZorOntO4i#vp{U)N`xupM^@^VQ)KV897 z#eUKCOE+1CoJJmR%YGd;Q8K|cu*?lY?R6mHV{EM^sPr;l8!wHFyjix>p^RCl%n2NT zd8C#zw=;fO3(i!a7-yIQ(M2or|vPr=Y%jmSea{bA(M)N#@irUkO&V%1j#mANVZgH+tfY2c?q zfbooeRGp7A+H|B!#vOx58++sZ4N?UsD-z!#(6E3moH-@v<;MNj zHfry$T#QGXi=`;WB}93H9zkmol7 zAv-e9lkQJpj`DyhfoOreRwm?J#Pzh%+NCrkT*Y5F7uXn2y}oMOJxQ`29BU3+)lhjh zP6Xld#5=>b=UG!}?X9{gF6}|I2!lbtEDZdV^;`^2lW zG9u(VgF#A|jNuPBG-nC-m7e!c8!6S+Y?9J_7{|RiZe4Npkpzxhs1dxEJjIJW?jyHU z){)SDxZa|0-yZ+iE(*H#O)>{mbZ~v7p3Yw%XYC(WIG1hH^V+eqCI`V#T0qbQ{zR+O z$w`sv`k9yD_s#5JujT9WEjyvnDG8wGDq6!>7|d#R0P$v|IbtDxB6FUiqjd6TuPvJd zLYBix8$ly#msKF1#rdHryMItjuArM*Yi-R({B89rpa>h zpz#JPXPlMV3Gf3d2t@7tC;4Lkr!zM;=6@fj`LC1tpK8)2I8N_~$!c-b;*)~OD_Urf z>Pwe}wY%ZC;-0_Fq>3n1N{(}^nP`;W@iOou2NUeu6Y(rsrYv3_A|Ll7>y>5naMO;3 z8Aq#^KEo>H0;uHDu3Xbw(zcPm2P&#kt;q0A#lmgMG64xl-dc%`J@C z=+pj#oBuXQvbv*s$o%R4_ju)n3=c5JE^_t<$C|rJ^5WEwO%aDWt37?OuEl<={v2c> zWGF20UT?hJwapF8unOH>y4U$!0jf+Q3eE%DN7q?@ZUi`aur_Q+F&JfO6e1!x#5crF zFpxIl%<=z2**gVExl>RbVN5@oG9+L7zkfteTR=!R0ezW^6s(!7JR zZ@_Mofe!!6TN}M2?35BCc1=A_w@#v{>_p+rUSrQ*fnA~BvB`@7(%R;oSj=5m7`pf* zzAb0^=FjL8sU!V&j6Iz4R`J?Tg8Wof_H_J}F!gyP2AEX9RdpBdQeLIxHGgHhft9~( zG$lWbqdeRru>I3d;H>zqXi%RCWbcJXmhbS78B>t{F=tscZU@1_{-L98Y_)bqdP6Y;1Ca%z1n zV6_{SAf0I;Lp=CnDWU&_omSU}9mkp*)S%t!Wr2ua$xXBFA6+ z(5TP)Su2Z9XGuk$#yHfT`Q)rj-?HXw6mR`5^uDKecJ#L*F%&8b zMceZXz8hqbTAh++H(>pX+Wr1;z3qpR?=YFC!B=I1*7xw^w2E{z_IXsv_+LVv*yv_P z{W?oQsB=iv`+DKs3N2PGQwVWR9Z0s<;*y3A^-NM#VBeJbS8Kr7sRqjU-GydIxi!$T zi1I!KfkTew;UulIAOcsvOpiqet6nngj0riuyZZA}Opn70wnB55E3`)JP^(W>X+1f) z?})U|y3j)?VonE8{j!9@y*c!M+6?)VqasRFqz#73;t#J~()9f-$;s+zGT5t+qT`}N zd5l!3F?=>+Af>>q4Amw2b@6I>lvab#vObzRD~?$WYK*DzX*tuKE%T68uDjVla5d0I zE@J^@g{HIpZ5sb`B+bPuZY_^E6(NoJ1$cb^LP}#}5L|loh8gjgEdQ6yR)}(SI*}2a zbW#hrJ(ZLdi+?dkKEF!NAVUH~eX?4T3Czs99MUFw+VtYREFG-><&1EV|Bsi2Q6(~AR*zFs@HP!u7>wQ5HBM1?0X$rA(l=g$_A}v=(CfX+ z_s(fe{u(K!7ubzA6$W!n+PG-|uerv=ibJas-ljA!N zm4UYN48#O;mNII0OJ#F-AH9NS#}TFhi1485ZYV&STpM^%e%r2UTp-j%YP|oB04f=*-c96SNJS z>(8@lkKq!Rwebj0l(jwm5))PE=BF~3xz>QGx)e4lV`WE#Q8rDfA=RR|1=hcBU#yK-IKUvUk;2&MbtKo5kqijDx(ZzBwjWk~2a#Ts4Gin(u0)P1HVP^qsM?+4!p3!h-Vej0r3$qnNGw0gv~WLg0aigW=f z(ExM2@CzFre#pKnmY;Ulx8Qy8-}`t5e!5u_DO7@?l#1rRAEfkyQL8Yc-wZClz#B3371c@(pMt`K)3u{6XE$kWz1)X)^0!vSJ!DX%YmO(SWr(_%<}v zBI>2~6sw)7%f|^Xl=FcRbD!s)9FB4KlRp=Jc0Tg;Y`C4VryE+}p61-jT z-R^7uu+t)nG2f&hEhm~JO=C&DjQ)LaAH|($n+=Gv_)thzgJb_!L4`|ZmC;Xy1 zmpI*VC#j_>Qd2q9h8mcp2sODzRhdr6mdw!G?=i4~#ERyy{`#8!`W@g=FC;wb%m?>r z(qx={8+U>WG=d8?0!a~iYV%9-%@7ixRy#}*&d6_OopEZw*Gr(l=u?04*%uheO}CcW>-)XzKjW&sh|i%^3)fx65>edxl6a&mI`31x+6Y8E zh}brG1Jdoj?zn-KBy_IHq%5yjB39fOc%^^mt6(>`>j)yhQ#G5ynP)pOht{mCIN z4n)-3KnsYa?;vNThoV5##iw?wLKTcO9guN$FmZMp_5v7h_A?6NTpvZoOk-GOHRB!YvQxOt%GfBvrOmP`$k- zDI#pF`q0GY0N$zd>tiN>&c=Vr9f)OeziWP5c?d)IF`#?r;j2HV{6aK&=#=s;7rH{Y z0salBXD{E;3%TIWRxA7Ils#iJg*(Y9UkTyF-vs_el{o*E^u^Bf-*#ag((yS)0#6Alv=)W4;8ZjDnra%_^(N5*u%Vs zty+c`Ep90iVo{Qj5i|D!`?5q6t`@gPcXGx&_zxq{EE#SinZ5(~{o%Nt@x2|ocK5-u zu<~u+oT1#q52FLy=OL8-w!`Igcp9|DedF5{_dRl)?%9k9it-AYXI9KZ<|Av)M)ALcE7T1xq!UoO{3{x`wp^ zo<(E;_%c>kY-9NT8PbZ8qI!;utU8{U{bvTlbLJ<`?}zzay@75$?%mdC>)Nfij-#1` z%VMmUVxD1ru7S(A?knq&^+_bmH{xdm>BBKtfzdJE!cfv`HXu=C<_}wx@1}KcA_%c) z2JpOb2R{Z(+z?_RJqRdRH20PtxQgmkdY);ntQmD3n=u){z%(Jj!X7{agM5V?+j1$| z{GA6C9(3vo&$k#J(0ZZy^|CGC+9;#%qtXAUB&R4b7P*0qp0I@G=CuhY)e)j8s_HU{ zl`AY+Gj#XusWg$bVrJ~cP`2~y*mAmG7^|wu_jI}|26wemFyCAy2fTd2NBAp&!WY5ht)8=F#2h32nV=&_an@SUf&jRhj8i#V zYMfc7w-uFqxO4ob+|3;B%58VtB?^;>V6@owI7Xla%HT(#Z@mIh1D>Ifu@SFX9jT{W z5_frbH?6N?Py9IFJG8VpIYR8t8`>mNb3Os6qtmM}Uww8nRg7ldTu`(h1R{!?{<2l1 zPyI|F{U=?baqN)Latr`ifNLY0?_z8DZysQJX=Q(z|xT+?wNz11;PZWP#BQSZ=@-+C;crkNePp|gm{PlOeFDg%Wj-E8x!zb zgBhqlrvFYeB0yPc?+#0>4VtXYmp*|YS~6AzJqr{Aa_WbhlJ7wV>CJ7F;KEd-Fy&FOi_Uc9~*@oPWNVnll(;EXY6sUef(A9>rldU97 zgNEM-QW}J~0f>ASL7yYsZm=ER<{s23ww($L%WN`mWoQ;Evc5&f}cX~wjfX_f~Oqv z2z_MJw@GvM$;ndNp4)a%>GANn64_5-a@PW#T&rV4r-JrN7Izcv;E3*}Qt1M!D8+JU zqLn%Z&*kVbVDf>A)?arFo++zm;UtAa+P~~DbQg9Ur>;BGn1Ht8qfwB=aBdq*W?#wn zB_MV5c89(-T2C}F=nt%Qt*vAluPhCB+{cTnnuV1<8JogJYlAEh@NWGe7ezyT|2}*i zsNX)bpz+yUaWDqk#nMp=lZDkS7}b>FJ#Uwi@)~YDP(`Fc^B96$XKd-YE6<-6l2|s9 zf&$Ze_pVlxN;+D>&Ems8aG-~Ll8T%{7{O#=Squa90LNtH1g)cIg4xVIXqF-fudE zhHA9>36GZYZt!bXm)32>in%}hI~h=<5;RS50}u2?wy$mh8?j^jy9{a7n!S@g$(pVm z>mf>ro~Z(2J7#!sh;O8&{dCMCIidn*&Jf8>Cb^M~m!LCEspnodnVm7OmGO}7Ig#zX zWX$I&fj#9Zng&uMAK-jmzMJp|2cr)H9v~Y0&@IENtS1)yC+a=YHeylO=%qbp{w|-X zE~>#!_2H4xCPNtZsB zviUbj^Aqi4-8r#4lQksAN9$|OeSC)=irM3!w0v3EkRzKfN%JK@+(_;P`z1hSqadrnEp`Htn_IXyqx8n zG4!ThwGVH3Wxny^NL?(in5|Jxu6gI?m(e?dd{NVnf#vKVh;@4 zyn}j+?AY|AS0{K-9$W)M8EmsL4+eTIa0My+a~wHSt3b?U4FW53SMC!1CfZNFEx-zX z(so|Qk?+T|sc?}q5FHfiO0QH~DIB&!ptOfR8X(3wufS~~wej1hKFc>_eFmVQIe}S2 zEG0r7P@zvw&w#sHj$6v3V2y!YokbIfd4;PCg!Rq!S%z4NL>%36;^}M@QJipxw6tc_ zge`WmdRe5qw0RtF0~EB@T9B%v@KB{F01Q}3D@^k(58#!=^mqK8_v?}*L=9~nO=3I+bk$^-a z(c_T84Fkkdc~tMeiwVPxi49f0sf)me0A)heIiQ3I;89}%s=X2G9!5x?IRtYM-knbs zvRY3+bn&9@@zAkFT|ts%xi||WYJtS?l#QNSkE72NUj(zk`+XLU=2lr+vz@>P5O5j! z@aDU~isrtu1od+`-nW?*Uju{GAWwscW>It*qy6al^LBen1-Oa$AmJF!3lAs;*!^64&nRP?Wt~D(eWzfXf%0qMA(MsiPIO?dk zovUdgWC%2c?EHqPJSp46U_4P#pZcdwG7bVmRZv^i%Q8bw@{$K?2WEoN$!_8wKYRV~ zRh33IT$DlsC52_N?O5xkBO@2~cq}=qe`>xf*}Z3U{weL16#kB?A6#K){4AzabVu)W z_*fO@J&M4^*jc~g=_m}_EfdJb*~%8oIB5NHCDu*RJ}d z_klyzGV;-}U;2tJb>{sWJsgRipk5biwRqkhnTw}A^7{vtkJOxuhF9(3t(oFe4+ zh0Qb)gZW;-e=@{1wI4E=HI#<>9)NSc*g`gafop*rk4Qm!-)}7S>=!;1qcnE>F=K2t zzb^KY%~)(r?50^9LRdmVsMWG`{B-OlV+wEzy#&#q!R~}>yp#hqsmeWwIHV~_n zT|X+QqHyd*9KB7Pb2@W@Y(C67C^)kxuLvMS3xa*Vud0PaxuXpsM|Cn|L zSNXs&5Q5h1<7@8d@iI_Q<|MM>T zSnL1fUMNIv{m2$&Gbs|YHr86n67$I?%xRSoq`9BS0o@uPML;+WX5x0NiKqsX!`H2Z zZkSPxlW-QblpZdh$3FL$$$8lQ;j&eY4`%3pN-{sLZdITCB$!4P z4QeOW*H7*AF%`|D=guY@tS;`2H&ZevzHTp*jsD4nq958y0CJ%`-My=sQ6B}m$yf9r zF|Uti%It%Km3HjAXUKdjqJPW&_#ILdBtlsrjOc_K5`X)b-?Om9%}Xh*Oe#_4Sr!EY zv+3_`=lz|`>OuaI7R#GO$VjUJfEhQB8x|~=hjFvAz}bCLKHD(})imu)zD=H|f9lU^ zFl+-%k+~3lIkhhJfC{fLQRJ!gfOurmPDrG2j`JcB=nv0)K~(ELI^hEUS+fv;!#E6aUD)pL3vUJeOjh1|JPUHn13Vyt~J~?Z> zP7*A}Yy~oAy3V&+77tHHpORVhdxx8F?!<2k5rADo{K?9sx*Nyqpxx8jpnfV+UKBYW z)Ie}kiBS@YzSx?yxI|MDDF^sQ2N5t#f(~7kJo3ILSR1e(D;YUA%#88}mWr^U*D5K# z@~xDyg-`?8)^&7$$-#|HZwi7kGE~qN7)LXnZ7H-LjF6&G3M@G2;(#4-5;V2UHA|>< z5EXM6(+Id3p&kSvcc4=?GEUA3yN zq8QD*leISnV#oCy1OqDg5vaW@CB+#=z;!jc`xXzGkuDMLN za~vv4roBDxhpS|DStkq;2X-Rsbd&5nRey^ZEM1(0oEkB^aG-YHFrlRR^FEnj2=rXw z(7yw4WGuuLI_r@q@0^QTg!*v;cMo=F`19-!r4-4|CWQ3gK4DN^^L-oGA;%>#f0hruVNZ# zm^`lGJlSAHe152eZhzUhQK1?PONrVz?fDLrBV0mkJcdH8k<^OCfbIucMz|j(PX-c7 zB5=;>=963Udld*|jkw3&Ia$hQeYv;HJ-7^)@zT~TCh2$@W1hn(W@#6zv7o^o9FT=1 zs>N`a)*)&lIXvZPqPe0Uvm;RQk>N>rB1;&7a{e>xXrFnoCjNIe==8#9MJAa}s{W{! zKPXNxU?d9tFUX}rBztH+ir;0dgVQ@=RUJ1@%%`Y3b54^g3uOXXSQe`|zpi!w7oWG*VpWpi=!hZ=);A!p=au{YhoTVWD<+r2YBz`Ky>J;blJUaODs zSZfXOyz`r9`!W6lqioNhq(O&vDh+yMACAA$c ze2J#obwy;vHAz+o;3p`OW4=Et`L> zVs%=!b=Y)W&FjIVYNX`U^_1I3c2K)n5-{7VQ{uGVqXLS4MH6M5*NRl|c*@as@7kX3 z6v#%Z@$Tc33(>G;-b6p9eNi=edx%TZ+ZG5-4`lL`kqomjcKIBeE82v#e)Jw{aO1Ql zcx-tA?N|l5FSJBf{4k=!O-DP!vc$GyLE<<;PSio@^iE6so<-CFpY=45J6%+nR0KU`AZ3YOhN~2K-l)nsf z0>MCTLXeS}RP^HmpJHy3QW9(@! ze$%6-5;=%E9=3c#7M2*5`^K}|R@ABpxG@;1JsH(6vM)Cjum|P%iZ35#KzZ$kVrKz0 zDh|4+ZifB`D8?GJcqJ;Juzqr>QwI~mdQ6rPy@s9>OWCYXAu{~Vt*6@J=O8s^mV#zx z@uz6X>hwuNTb0JL+s%$od5dOwdAcx65;=VjkSnPKHdZL2M)6$Cl;4+B8<`<@24!lR z-0AemTgPDnJK&c4J1^5@IhvHyIWd~OTqix9Pl_wR@MBjwTim&sGTq^O_Nq10vRv|P z8%&6@W^GAF9JcB1K(YRA4`dcDzV$RaS-T1-X4WZf`6;#gT;vcxN(+~k1u|P7SSgb9 zJ1?NQv%c2dwRM0a;}J>;F2$y(+^sOPL94jHAF#j2J{22K4;3YgV?wFA=h%0nh&MhU zm;#PnI7{PDAbLLQHB^RDMl%}<#pauUmW)*4JpY*ZUI5GVZqay4cD4&7XSVp3X;4$K zW%2XcPk+S@Gt%!@IkA|H7#jBoxo(EY2A<U9Z8GQ zbUq%PFVYaoz+n03<`CG{3Rp!V5Kj}n4QMPo4kK2>Y{qiC@#+ZymBFOTpxo>UaZt$N zuy6cGQ78v<4MPjW^&Yu#T;Bs`--Cw+gNI&`kA?UO@SyON5puwi4oRh9QQ(cWcEq^h zWlx!pdEA%{lacNed}hT;zy~6C;+?>7O>Lh{sl%p4x!gg|gxcQ(s3?VVJSXD)zl(Uy ztP8G4K6kh}to3ofvmIplGHnVq1Ayk@jW4kvI2-Tbp(#{cB~odSl2YUS^GSm3Ka;Q` z;fj>|FsxpIzSy6(Ve8PI0N8c@^N~?B6`2wA#moirgfoo@TEpMI({WcvuCqMtr1TZ?PwbREZF@2q3(o%?)w=O&=8l-ArBLI175ezoIs zvqaln&#Um$q^^2LM08&D+_^dZ(-n^V3WGF19md8d6q$8m8uHfJWlI(*`tH$IqpD*Z zDny|!48xwT$-?&&`lU8z;JmE4Z+j@~4f+RSrex=>rqSz$I}Ws#(^hcr(>}E*Ht3lq z+*ZNFxeB~ZG6+Q3l2~Gs0a3I%6SJ@=rY_x`RT8Ig*9x$5SMM^z=6!5HWj1_S+AU zC}z)aNr}R!kYqUCU%VbI2D{`6N=ZbEp>QArfg)33nO}^*$8u#3%B~IaTKqT@Tg8@= zvggeE=b6tJJG!cHttA7ef;!D$+|L!Ol0$5Td+X@B|(-<%au;?Nb+(L_~@+i<)I0ns<1S(GfwseAaJVJc< z4S(o!FDut>3i>j4YN zbY>Ppv=CDTW<;;=N;vUTZ}HCPbM(*ThM?@y{>1WHl|WV*%0t}PttpiZ(>vqZi`<-b zoC;~(6@Y?>fyO$9TS7Lu1@DV6GOCHVwQ|7{fuAgC(-Is>4ordk>!=|un;i`H{93=X zVW)1~8*aO*Q!YsI>8}wbXEDS5J7^hP2M@ukd=JBx=kGweu=(}pq)_|{Upcc_kbWh; zDoqHEFc0zzb$r(K`;OPKN1ETcH|&EAI6JhI=U!3|G9@{B<3Wb{FH$|g88Y}177;mo zfLb(+>i(N>0hq7<@2D5GfEAs?`=010J3@FihIZ>zAt_u5T1vuP&k6Pp4<=!^P$iBG}_vEZy<|mcTU9 zK2JJBLTzFtN9~Mi=NbqG+N5v(_gZSlh3n`T}jRlDz0U zg?r)xIid-5%G+zcA7i|Z-u0~w8=GAwOrTCEWvcTLyVv6yIXkY)hk~+<2H#)Hd>m03 zx3sRmT>m7&>_@wROy2jD@f=TfP-Wakx7IbSRgwNlQgMvIz^N(*g7!ngBJhU*+J>a4 z#lV>NZZyfyhmyUgVguYbqe}!ceJ2WL_U6AojoSPZ|Ht_V_88dU0C?x5C#-ddxNCay z)xKNjm|kc>fN`RvdUAcHh`-bMA|Y>^&Z6?D0GQpl5tW?X~GvzR7P6zD3Z zL~M3%bI8r>Eh0Sk8;82G99A~f>lrFIY6+{t74b+HkSVuQf$>_{Vgw=PK{H1xVwaGt z-J<2NRkZP240hv1?>n8sC*TP7Wa1Kzp3o{PE#&Z+?}6e%jUT%t&ZHS~Din?5V9^jI zgB8WqmppA6+VT>&^xtRzzXjbt40!kY%2z-2^SXEPd1eRRKQN3xZ;uCoDik~+k`J7U zxE+ydmBVUG2J+Yl&TQ#dcuVe~ho?h8=L{hpe?@X{^%s9d4`mLnS(rjf+h-Ih$41UYC!mY+vQ zK?Xmo3AMN?RAabYBY#wKHu`APTzWu4e$35!?c5UHC5>y~AfGoZTcjozF&5^Jcs_+W zQj!MM$JGn8s?q}etf~!;ARsXC0>pLUvU|sUrQ+#~!c`yxY$C0WhCt8)G$GsFSEQt_ z^a{3@kZI*!v6=3WT7?CzK>6e0OU%I~*03O{QQ}0eOkw2xlOLQ=>XiXH;3C2tyIvko zVEJ283_i;yJQ}raDTBdbu`(UVN3?PU6ZxZE$dz7%DdLCL+Ce& z0k>b@*=wsar{)}R0r;CI)U?G|+aGpDVJKP+|bJZA0$J)qq1JI(UCsj@@M zCVxWo@q_$wQ#&{ckb=+;FbGKfDa@z^czcQm^rsFd@#~6Tto;6neo}_2YBoWG`*)K) z_i6A-O6x}AEEjw0>iQZrJM6$KnFtr~kqO{?KO5s{1@}ZBfiXycC#I^sE*u zt(NKv$+$Ig4zjF0I(a=aIx&gd{oA3=`frCiJ3H5Z^=)2#lmE+z>Av`TsEa}M2qx%I z%2RMRM>r@@h|2yw)X@?Y&i@|jU{WA#rj0e5E@zLcGdpy*M>mM4 zQKz*b6aQFfK4|{2(9rDLC+g8%knCpr^89%DVDIOvD@0K??~}Gr|8V0|6JJhwy?*fe zeyktEHMeZ@B71{tqxyC!l!h$y9>^_N8A#T2kvxjbjZ$Hl1 z6b?F&bj7j^MJuelHXH-W1R4{spK)9Ebai+=(ug2sfM09((!tGB$L|Ru^Y1e5zJwkz z+1uGwwR*I3P@M!`hMGl8u@WV;IF2KzA4A~uGkJNn!2V-2695)O`C=E&NU%yDfC+xm zW-cN6j)2Z2Wpjs_ckk)GMxil;RaBP_kNM>g3OfvPnH&^FL99>qZR2AfWYhJApy`v5 zIblyYn9Rc@kgN_W4$R$(j5<2F9a9>Id9XwZQL)YW&o{fHL&~j@-x0|NP>;8%9chRi01u>QnvND65YOcdc zU%v|*aFXzKu!y;qK_`2@PRhu2=6A>(^ z*@iF=1nzQ*$#{qQ(jGi&kXgTH{N)`_7q!C&y(O>`CQ2AFhg*H-Sn+9}rI*g# z%=?1GTU~A1@u9<^pwo2_A0Fjg)cXQgE|de}C>+a4B&{_*9v+zH=^vCTHWM@5!FxXd z^Ap4Z1RB9+m`N<-yXsSvM&Z4VMRe20RLc=j23_~D_K3ux7!2=?T!lqfuplcGLdc*+l9}tt6JC8E9;VE)+Z%PqzJ~dzX5F@!OG{XPaa#`? zp1o!(mcsgRBMWmo{61@(HGpi1kAu;{sA`ZIO$C$?8eEpZyg~7eCbJ}oO&F>WA2Ifu ziCm-@hnFr#0$5h?(>HK~plb4F2}ffUWw(fB^E;n<9-cE3> zobP#yND&GCx5SCT)e?fqi9eV4$a$M&YhsN7y-%_bd*uFU13bhX`?|# zS#E~2MVTKk7T9L5^hsZXQWN;V+m_|2Y}dvY$5r^UAzo~r(WH2#9ZoaMHSII8;vK!q zWx9j+5=_8UXZxKRax;RsH1kf6AN?3vW=!5whLioA{GT6$J&pUgicG=r^Kc?S{a$k$ zxd%?czAQ1MRaRag5H_?UXewMSn=H9|YhHp8Cd<-ukdC&9pNB>xgpokskzzAo< z2XYcNHtySi)Z4Rt2cVKQ5MVoCN%kFDe2h!fN0I^|^hYG4XMoY}%9-nbYJELgr!9vS zWn1h@%f-}1M`7DnLwhj0GwP_EcuG`!Xr0w(_F0|`AnBv0u_|Jim@fI~(xRIctZl{A z7f`O`M(#-dk|KBYdeNVoF!d>Dw;r`k;^n3!r6gIy{MdIDP-20 z^i>m~_0hm@z@e_kD0pI_TuR3;Hqn_8vQ*QaN+Vie`m^}a;KhO(sgNz4nR(UTOR&Kh zb#-E`XIJs2bZvi^+_X6SbmFB)pus6z2vi|G_VoJ-U&#leU zRr9lLA(_l6$w%^X{KU#A!QJDwUSir#YSn*g(dXRv-?yO_Rwer_2)ov`qls_&`9y+6 z+x6wFw-UB&q<;1JugLk*v1}6O$5cb!*CdOVUohG%d;Vq zFMd{FE8~IB9{o_^@S-_hz}?)hKfbN}w6hu)%lj*{58~=Kone}G6x9K=Z@Py*wo$T zrV*?XT^b@2WJs5AWGPJ{vigsx6KFmCgmgC#38b30Fw8sPfMu%eh`zOufS-|R04rua zZU9m3xD%jB!S41?RKNSh7e+o+l4gw)g}*N?mXb8YlA^^DJb47TVl+D#$p;@?Dh^+^ zbOskA2GzEuAQYH4jv(B{XsW+om2gotbg3v2sE&F`6yzgcqLU61PCXK{T11ewnpql3 z8(OH&);?@2i(fGUZNd>@_*UXJsRqMx_~gu$!$)wVl}nKzX-pr!o(A|TQHM07_$)yN zXwT(^neI<7>PlwD?y@4xfpZs@OKt&y=5vQ|=aqJ3>FoSG5rmY5Ly0jm5m=^lL3mN? zY5l%&huKL$lEvUWWsw2jGnvCEutaONXrSglWX%J#_HC^r3|L)lAaGFIob~%I4M9eB zQl*kL$7VCcet-Ett=^p!89qO8kbjhg6pPcXrnG_Bb%H!8#;}%UM^*yYR1-Q}Em@C|a6GVL)toDa`r!kqa(O+&@-c1OMfH8nAqU`VPo z@oP6-ph{w-JVu(}=Ur3ZTFEC?%UF#<*JN(k)z;t$aof2fbJjFI|*BRP6nYLlk3Vth6gtWVXF{fqI zk;i>zFJ#VZST!v=D7JMmgAX)A?MBiSz+~xx7mPXikc;$10EO7nM`V2lo@Or#3(=|f z+p2Cj1Z5rrQ^2eqZjE3qhv&G?*0JB%->lRDZE|d*sRwp4Tvv>>M+WA)oVhvfrH&(ZBjoeXfVR;h5Fe<`5p;l@Rd3^kKHdf+{@%7IP#0=6@QpyRzq^B1 zUuP-bUObV_Z?|hV9eL`V><;Fx**?Ql1ato*!i2%L z1yiOBWq+!Vag1Uol#hywd`XcinvcY=Jr*i^Tc~A2G{H4u7SkNhex^fcvAXidbv{R| zyU7i0yHVm@_vbpcbhr}?d;WFu)}xKU6&S_^XfzOy zdRXjej_>&iz?Rh6((RZGWc`G*4Nu92w}VH6hr=2g#_qa8{);BD`HLno3U{;cQe^(= zQ5DBbAcV1&<^gx$S?~mQ+sx=S14=ZO z<<#kj3#=K*W&Xs`_GPL@%7DRTJQGp8q3(`e;jB5Wfa!S!rrDOGs9JU2J%3_ zs+25d{l}~?9VCbm6`xdyXBJ4V10D?&3>nj4iE;$B zaF!e}wP0k{e8EY914L+EgzkgV&3sMyG66~t&aGCA&;7Tchys|SomyI0O0aB< ze2)(PtWFHl`K%AhKj30PDK$k`yB#eH>=p(a?eq^`&+9gCbVU01Q#)yz8A09w#bO;; zJRM7;RS|?tj5^hkCU?~CjUs+)E1EHho`MWBw)4hhb>dvMD1V;qSUWZ_sYGr07B)`v z%*-^@Tw!$}hiZ8bR;jdk`dq6r6cn>zgv!)bVc_K^k?efQ!OSQxJXibuZ$d|ez z;tsOVjH0w9?{}7da*5*$CIZR}&@%9s*x)VEgy9sO0hB^qc_)_OORh6XJ}MoUN%++k z+k9>n%KRu^$@&(UYPr?m}=qb2GRkQPTJ$<>*qVOcl^+jg31DQn?(F&136NLA&0F z77^6k7O^**_AJJm))%uAQ`BqCuZ$hOZ|;+B-!YFFZDE+=;u!BV2WR9*Kft>fZL zAbw2O%{G5D=b?Upi@=a2A#C1a^IbQ+<683N_f@oiD5#mIma=rSC5K3C&2+#gAA(FN zKsoj~)e$&teQ_J@{Z5h)wKTF@DP`04sg_7o#e;-Wvg#jfKRwWIOgI|Bza|< zG=gMN`A7xN{Gpj33jzOA{4oP|qah1+p>9int7SJX;Q0B>8FJB*)!#e}@@0&)rx`KA zfga+ZlQ7&gcz|VgI5j-ijU%8YM+f*Li~2YhR|N{K#WEBPK)6ciBCL1_yU+@TcCmRf zr5E@nj%iG-3_+bgX!P4v{}@usC#P6#5XM|ktJjZnR=_N*fYXv={lq#FMQnqja%M01 z{sdGu62dhS4J^FG7;FwV3z3k{s+Aha_Fmn`ZE_iv+sP__?fetlgZ@Ybb*88U+z^{ z+5husw5>I1f5?Hh{Z8Ao1jIb~QYg%M#W%+g$#KVkjn+WVYi&19I-YL6=x|d^wO%A= z!Dr#q&eK0022G&%BTK%=o6%APY#<@RwB;|Pd0EORXDVe}Z-UM1 z!RdK&Kl#XBCcOWwR-K#v!F2^A_BE55lR^L=C+(1qN>aPr<#HZii{U+n=> z5@GB{nI+fHwK!qN=3VE;q%b+hLUA_G3Ky=YH{Ix2PrX6;GH7kUu*HG@MeKcP$Ns)u zQ=#LontbhqyA6%k#DE+bjyzM$Gs}T7zUbVWed>x@GEj^FFk};e41{C5j^S}n zG?dEgR}m^a94(k?rBO^Emv%4j4y<{;aWG~MPQMEv-?^X$L0w(EJxmxC#r}msk0Ch4 zVqY+`^kGRu!np#8g94$N0&U^Z{jEj7_#Y8k5SV=dK%YlJ;Dlvj+h{S#mTFxp)zu{n z{`##U5OYYFfv%>wLX}CdOsXWIWG=wiuEKjwKp-egYN+qP}n`o?C*9Z$}=?|WzNy1zAZ=5Kh`s{K^euFtmFteS3hUx!G1<=Ee&{qxM8 z@!+To7LM*SyUyG{MzrmV8=&Wdp$Pebwbn2w?OBZBT@Kp&osEu|R-$g(7)C}-ggMeE zQbR(U4YC=W-3bunz{NN!aFNJxs9uz5Zh=L`A9@-;DToFaObd9=4SIvb;zEsIVt6_W z>-L`}Jg#JxP)H>We&Y-^WmtcaADFXty3X<z&#qjg0& zE|T+GQ}0(H+F-|c5XH8LFroEX64y2>3Vm6nDuucdMtJ23TM|>mlJ~K%W8D;yoF@Ga zCI{CnL0NprYOXt?vn{pv31}g1slB}16<5Fz*SW@-psQFG+;0n}K(`L(Emx~1u0e(P z#f&HS(T5t`#A##zpL997McW{QKM6q_%rid1Ni0o87AE{!^`~#GD-1F6=-hyB=v0qa zo<4sNv;8}QIxg>L*y$-D3-&w_?f1zaz_#JwkNWEl?5w+dPdueERXn9j#H&AtV`!eOWdc8(90)6Ow|?-s(~^?LevrxH%j_z>!X7GQ#f}+X zWs@NCfVoebm*vtC&gbbvE!-Iome8%%x?Xmv4pRl!%5T7ieoj6M>m0LEa>?fgm85s# zT3X%UH+FCka{b<}o-xi=@ArP!ddTL_<&dw_nsCbG?j_!4au;;JE&X+~aX3A4A_huQJ!h@m@(IB9eb9 z&FrlIP?}lU|8v;y|JSQ^`%Tc7#!r+*G%xr!LEpMESvR&Zq9IHVC1*6Z$h+~W5BJ9dT`DMi|-^53yD|2mejNbJ^T3dHZ${os-w z-#!k)>he-)-L!ct_xcW;N$p+Eoh0{FB&d{Wzs=QQeRQ|)0r;z|Yhc!)%=R%WOwk23 zW|{OxkRgd-lkUR1fInzD%v6$Uu@IB37b%KW~3Uo16n zeMo$0;HVA#{n*n)w2=oTIs`?qgate3)xM*;`C)&fn^nre%9s2v)c+b0t9S)t;-Lv0 zV~7@p%=$8)wOp(9s?}^P0HeV5H#6-F&QaK6Tr=bNDqmHp@iGGaZ0xefgJXs_$n9L+ zd@AO)n5;G2fVy9CW7`u%gwekU!mLPP0xu2$SO~YfyJE6i;-ux{0+pLm6SCG#pn$MZ2H!zJPc;ZqJpqeAh&!Pb-lCgQ4eQM_?FSRl87C$KLWmriBs z`7c|Ri%;$|YfdM;e>=~oGvJdmxOY^|lRjAClSxar8_N+eU*1Nx5~j^&;F5Pm@-PN) zAQ|`-LiL3gpoHD^AHRa)#>GYg_A12xqQX#7Q+$s7E(kmvc>=?h-TQvZ<&N9%2~JEx zXu7MwEGU0V{yX_0tNRkQn*KYJ)1X1t;Kjwm z5mQQi;T}5RLlrahgJO_v2qN1+dm+AN98gk+cu5~p+B&6qj)jc5$9yHFG(6UZrwWdu zlmZxNA)6&5gdJ4@`vSa)c6~&F7Z1l<{)sQ-32`ffouafOa_M^TY_!Sjv%fVwjQ>_BwJT=xLb}9)o@Y3+>jnHS1OrQr{0#i z{p_hwJD}Smgwe&Jt$B!n&(b82{o~8o$TMG8P^LRLdjs2mreAI3s6nvUuWf#tF;@pq z!mF_lYpsDwmz(uiZz~2vJ$Q14x(;TK$848@F=QH9emh*aeK*T-Aj1gBQFh+sJ&~hiyVpSQDRPYd>@evmo>fXAByUS3M@Bdli1z1Y8is zIoJKfJgDB})nz)KY)CQOO(r1MA6Smq4VZksJOkNW@0bHJTgw;x2Nw)`Fvv6SwE}y5 z6XIH}rj^4x-5Sz$|0F&f|0F&f4F7ei{D00Fz4|@ru=(8=T+p-`nMkAEj2fkqpRrW3 zJ8yYMB`%-hAntPU0td?$uFRIq)4 zO&h@Wsk+(Ld-8YagAmh&GA-Ve0aRg1Hmot=TYDVtvjNI%>PM4iAnCQosAca`-JSNm z8y`07+p3>FfHpOkL3QWG%9h;8=1iTCMWz0@6^N91xvw9?3!+pgB8*0Gcm{R`SpI8& z{yM*Uv-Zec`x2z&p|~fA_czBOA8EAMNJNAvO-d5SgfH(uav5MiKvXOPD!u=HiUJ!Vj*2y3ycak8Mm0bd5${pp+Mj#

    f`JPuAA7f}fJqTRfhwrT%uk1myH-#r(j_~GsBVm8x7Hx#cm>kC zrCigK&@VLizK}|lpbKAI+$-51rnjiJi6n0RBrHkW=B)>4XOyzdQ$@GRVXGNHwY3!Y z(TFa#*2ngX?{n$6a>mf{xwNdpgM<)o^&4P1x0vb;t2qmR#u8sn$y-p)28kXm$E&IiML-zHAwzDQ{=jl7eDg-war=h@n z7B9}!{5~gp-9}+&Lw)tl~*AsHMid@CL5Z_Qigv)SE zZ#)A;<8&eC^s2dW=2CJAe?1NJ_0tf`XU$x%-asPJh=T_BZhb`n@MWo*jeBVvNl)vi0+Q=Bw=qhBM zB&sVSplev6kq_jY;8E026aK?^D&Q{^q&(@&=!VX;5cwKW=TJKHDLBPZHzGF=hh(_9 zkJ*rq4Nm_l6bl~@sVD8*IM0E7y$Ou+=mJI;N^w6X=u9#R?FpA{?N&74&k(xpn;9!h z_>+rgvQfQ=bfmHiNgy2jRZ?V!1Ug+ro&GPc-+J_K#)3q=&Vs9bYa_*`i!M2RY>t`M z@JH>wb62U86&DpV7eE+!p3IERe*sm`IT_YUG6ATAU>Y7NB03_(cs@n-fZE!YkBnE< zhN{&!>!TBH7Z)K3GZ=^@`~ojQ>svKdw!TT2SF>Y!HMKA1uN@{`22=(Dp0blxJ!0K! z+vkgg{1u&0U3l$Fqn)e!A}~L1k$^=KQh`iJG6C36crUG?Lttc}LHc82Jyezmzposq zGYXaxkG=s3Z2Vus+_;_!$Vj7>eyU+qXDog^q96!ZKoWa|FY`=<_?Gy&5|BA1w6mn3 zLV@AvvJfoL@IZKQK#vf92oQcT5I{b`Ao{|F{&mQS0&A5`0s_li10-vRN(npkNO7ch zxL@9BP@lQ&V1LnJgKk2pPz*|-3LVpsAIe|*ScwO`=;{0gdj|v|b1IOY#e>9>7HoBh zbyldwA*O-vagaaN6eM?+CUaIl;Gg~F5K#1Oe`=nRysgx4`8>9QEZ6ndTdalcR_5{K z;lN$Y!Q(1M8-zvTTr_#;75#Oc(;u6Yb$1kmhj$9VVf(Yh2jw)tmmX$8uq~`CN<{Pu zl`YSleX7PhH4Bnmhd6SU4GBVH@uiJNwY|p*?6KUvfcz$E#s_}EFGYFdAgEWUww?X+ z6WArV@$(<_mHoSo`=5U1|1Hvx1BU*;&q!H0SpHLM+>yq=k%s@;*R1JKBAf)0>Vb_x zZef`D=Z)uA#|vjbiO%&=<3fsmdGE+O7*rcyNw!3Rbyu0X5}1yqvkT8mw4*^&9V)Uw zz39TSzU`n;Ho~&Tg~R%hVgAuc=&hhKbFoX-)6kyNlQBi2MPu_-47do87cP!5&$n>& z7m~8+JQ65>DJ1tVW-6?Bw0&ST;Z=GMg-BQE2nEdE0s27?QThl& zWPL|6K$*!(pgfJc0H#gv!I??fzvnor+^(gB57S(*yl-74TlSEHO#FO> zMc4wI4N3PX86!~nRa0E!6$-ke0Rq2*o`!q8iOaH5(D8m(B}gIj6%H;#^WGF@f&9st z&?u$-fCI~tKr;Y(OiHi8+_gqUoEK^(;5Q=3C6*l>a?$zht_)2(f8dh1UcsTfVlMu% zHk94~siZ7kh|&0dkKdw{jSWE!)z(Rn6Ae@?|ABnb+mCd$sd4pqnXw}lZqD@S++gNI z8lw8|zsHWx7wEfPswl|a`@!3Dtw}6C00ym5y}m?&@GlMkzEFS~gL$6`#)@@-GqY{+ z=*5_W6Z(D;0wPcP5x6vrRj8xqw}P>^@E8kd`)Vy0W~~j^(JFgb3^DL3yB(5)oiiwb zCr%AK(dF6wk8^ZeUI_H+Dm1;C`xDGbc6yA|J=&>Ues1{t)JVD1y?Z8|&$n3+dY!N4 zwCP*}iOBm&L>CIU+%Qr9_yYketonTQSWu-%ovD&PE|4nhR3FawE!KP1n~ANf zyc=R=x5Jr`9Dn|(to*EO8fozeJ{dfd4`M>z^3GzMxa+QGbp5^2iOn7+N1v(cT zfrh{eZ!`}CX69q53k6ni?LBZH_eD@e@2Z13akW0zv$LGJtEb_ZgE zJ4n<^_aT?284sXQ8FMI-GkQ6)cgQ~5M(jB?vUo~4aSW>IoC4O7Et;0lJXhOm<`*an z02`6#u9?s{tCUc+YBCSb>xvH}>wUNlA4)OgRv4Li+El-cHDH;*OcvU%DA|V;sui39 zj3rqWC%+0YijIG#C*8zJ{El4=@T*OzeI!J4Ecpn}EJb3MBfADlgMErnB?l5UsIn|j9CL# zh)IcJi9d6SWF-}gE9*^TZnS3goJ6p!G5(VCkwq?RP!+p=7Qe3*PA1@JU){j6)Ta?K5NZvsK^ql^_|(hPJDQm@63`pBa;R zU%_i9pA@Y2Bei{D#Rglcn0ON$ z?^PScRP(i`qL4s0SEyr*M)%F}tAf&72cpQrgSS3g#~Wod;r? z{*61V^uzo@$cnlZks>$P?GkgYwD(8m@|6{2>n6*Nx9mzp8^{!PM7s%LI7~IRKI%E= z?{{F&2Q`g;2!{mm86WQZX?DZ_wy?Y%jKjlcfWz$~UlTV?=k4?2HGC=G+T{N3 zD2FMqz_(D(UNWu4HFahj<>ubr&*M*JXEl7FZC+NnYgf&c%uuk;-kZ4;e&iNz#Kaeu%Aedf{z=}WvwH&1L zAsos5-M*)DVX^_xrO+V_*=?pGMYyeN15~yTt{@O=8F&OuNw5h3ts`ag)OoFOd>!&R z>_M%@KFFLf+;e%DtA#VT$*(6WMnTu;z9HH&tT+Qk$94?Ped%iM1|?&aU~Ps4NdC0Xk6Z`Rcy8Nx1B}Rt|vMoUvIZ&3+>73SXr(U z55^Yi{{&@w?7Er)7oHT1ODXxTPak3ULr4Gat0xU-q$cW+pz1t$vX|I{ZDP3v?!= zoMD(Rrv~axb$J2Xb=rD|k|3QZ!`JZ>GsNUVxN!$j<6Kym)tPUM*;G;(dLeC~g~sDG zm;^#>}vt=&H;J>ueR62I1}(ypb~(Zqb{lP!OlD*&DgzEW)*|KcXUwxG zOxO43+4;uU%G?mD^|vgf=v4ZrQWGWXoTI3@BgD6o%FM-2C#M_!*0;&KhV2z?ZM7$E#b++8>UA9|# zXFB|P(wQCi3C@cuS0@e^qP1IQnvW#Y=Bb%KGi6XB!Z2(SQ&l{pwD+_^k?HI1R28C= z76MPkw0HEQQhV7RmwN!5y4_W=+M2pK9XKu4+Qq*wslSZ~+bV^ow)$Mhlc_3>xH>wy z8INVA=MDwP`Jd{(T@Fm5l!eG6Af(mb(bQ?FRK(Z?5jr7Uz!D_D5dTW@Lgk*{Wmtzz znkKJDEPRJrcAjWps6d6@#9HuJ zTXb}#1jsD6QE)s2>Bz>J3{JF~OZkUG(iZoxM9eQ_p)GhIg%}%*0;%-}{Nx5PCX9y- z20Q5^3QoMApCj>drH>+kNdmX&l`$xa6g+)S!Vv*YOgIh;(wQJk3=X}@ttU_+4U9H2=5iN<%hMpj!DzO9O+;#YnR!r z`M%#^fy}*rkpSWZkZKl*n4GtXN+hiik~u&#u`onU=2P*?9V6#721D0lEy5RAHmz{| zz6`3)wET6}S#w#Tz3ilLjgyEECJ02o5b<}3m^eUmEN(o(L;T0TK{~33Xm{x42H*)+ zhp@0W`DU6R3Vd#5Tlh8;C#foGtbXkc-8 zC-wD&xhyQS{x1Up{LY2Hvvz7WZ1Nk{g6!W^P1jLaIU`o(=HPISC@{A6w(gmM)z+4Q z3}~b{D-HK)x5pEG&6Vl-a$d1D0?$kBb%izmaE%zSqVl};p`qbQ_c~s}cb98e{DfFMKooomdUvPuK>lSS zxBd7*6(8xNrC!%r>z`r^K%uoa>I8aPm10gz8Y8-Y2ygN-H1DnOxxXnT)Z)}ir*F(5 z5f0pJfg9Z1#q{!*z}L^bbOgWStf;k&)JJpIjTE}vjAt3Q={gd%599tGvhfl-MpBXO zUu;|0BQdLm)(`GY(+9L0a~=-2NSl82bMV6R)>F(gzeZjzxlnL;B}yn5C)xVJ^vk?3 zYz7FRpQT4qo^EwPvUquSA8`B5Ui@HB-^wM8tSY=l*bvDLGk0pfnDT6OgdV0nqxe)< z1a>T?@@DrGSu;{)&xg}8cwcQYF}&|Na$SfP_0dfMZw;LbiI+ZnFArXKSW-ww?9(&seQ_Z3RboovAey98h7 zgSQ6F_)nU_{(pfGRoArrUQGEs*UlBfis0T9Az2{`)0>6DYbRb6|AZMe3R4kbo}jJ?Sp=NGbs*kHaDfSgpU46roG%nPEqXC%Ta0R={oh?ps_Y( zc!BRzgEm8^o7q8+`y2jKkhTs_K{bh_;!=Bm0pb&9)${xrI-2?9>)Bh)j`Ua{zYrw0Tuxb2(Vju!1uQrKLRR259&E{+?#bprklZ*dQnqoe z1V(>u>L(PuDSR|?s(NNI74vgNcZ2lf3VG<$2-d9cR&B-|dF^BuRh5eG#?pnC@r^f| zdNUJ7M!LfgH+L_BRoKhBxx&?J=*gP};~4g0uu+&iEBX; zB+gz7Z$SI=9yYjW8e&O)+KyN^ZDMz#S5z4AG#Gpr>5-ccPCi)}4&kFZHolsp92xSw zI0*444#quDOwbtZiVKl>;a=nYdTBZ%%(r_EO$=mgoJ9 zn8iXpCA!0>b?I}8g#_em{?Y8sK@ACGM9VKEQ3nQR*jR@qP^!`(FKEos5KWa<>?t` z3`i+=eg!*85+<1cNl&5{$v&FB`%cp~wJeG)NJTa* zp68m~^~gs9PIC?tS$T`^s_3uFIe2NPOmdMSA)E>>Dlav=#Tenj&=H;h_VOVozMlwn zdVwX+9o>noGx^r94!K=aLLq;hf*u4Bvr;6Fk4d_^5e$iC(;wAjH{&*Y%q}r){BKIp zj}s$BuU3uOZ5RkHd%bWdCj1^WV(bwYO;=75Y3u?j7H#7_QIT~ivuF$-fIbKd9M)Q% zrB>@RW8eoMF%5OC5H){heaYZJ!ps_4R z?Z{9;M5`PtRU{MCjh3;2V-G1%{&_UhITL2bgO%ep>0sO`(P;04{k8E?W2cn1AbLy# zndSLmj(7&qAiby92i|wP2@sYAhR&D_B%<&>jk_P}@zBPMbWm$aG`>$;ec4zFJi2+| zXMsWgiWQ2@97QaYcfX`ua`Y4`{8LUOz+Z8!Yl?=0`^C=${XrcP3n#RRlFEqMkBoe- zhs5RPQRK;nI^kA<{Z_kE0k{r+(2^+YkAiK_ljGRpi<<02-e|2zp&?f*e9eDie1rqaF} ze!}##e3@*C3-WZ4)}n6|oQ4670#1U*GXUjJUE|56$!dXpwY1729 z-g3fSr1+BH`A)aKPnD8Ej&NeR?EYb}L<q zBzl+zHKO$5YJn%rY1N88a?(QEx%FwXwL){a&VR6+>+l8qlzSIW=HhHwvz@1^%0hLm?Q6YvBW8j21VF z@<~=OM25U(^PHo-+8u0dcM2vC$MA2)&^HQhv?1U)jLAFo$FPUquPDVhX|xBoaeL4* z>r5!n*Rh6Qag>vcGKiI+B5P(h^BTJk))6)3Jp_xcVcA5Io-VI*kml0K5X6dMK)(_c zJ1tv4YV0ShKpZC)uadpz*Xg$ge3e+x?FM}s^6PXljR8;XHhgQ{?+mg@f+&=n!+=&L zB3`cMAg!`zh?z)l2e2~24l9=IP3*wxS^(|Hx47lj1tCvtkPa^ef^-48*TNe z`^*aPPP$rngVLvExyq{!tFNx+%2-h)E6Fm3WnI21T4~iWH`#0|f{zIsE#F4O?%Yr0 zOM5q^p3VlQcKX7PjL%BcvB7r*i(T+$lmuDQKXEKKBq4oA{E8PW2BHW6e;m|^V`O2L zwfvY3MzGICJ2=YG5~~bDw5>fj1!|B`idC3Uj6u`@28WpEt!#B!a1@W-XZIzWl>5+w zXROY>ECr}*sD179G%+;$BCvE3%^;^f(ubY^*ho|*h@RwVZ?FK&$2$-0wr0T+U$fd1 z8j1$$4k(SFA8HUyGbA=ZI2!gl>jeA5k|NW%7GX5ZAYc+}g3-Z8OWMzs3+Ty}-nVd7 zDe{9*xl1#IBQP+Ko%ACDAh)zjP0NG5*-SPbD5p47e`&Sg&mvQ*m4rDX&_LTpld(9! zTwkq|<~&Fr2#{IzcE=j{GW$!=Ua88O&N$1^k*kvkSq-3sX!kXN3Qv@VpahYRAJVwRA)~`4{>1kXwA^n1#bl)ARE*vmi;iSAO#8DRRU< z>iad3kB(B36A?Z1Ge$rgcQTM0afqeUhmKG}zy~NlbNTKt3_A>QdM@an>m%{%#WC4H z1}evZu|Na+d_4+Eeq9JonEpyq2a}&6;FF#&#VZ-RHJ9YE$RJKUK8^9d`;s^xC#OpN zhK;7YcxMo`v4^GUl%Dcl=0>m9pl(n&BdYPz$4YD3v7j6X`1;tsHw6@!7W|4^qVtLx z)0>@bO!Ngp6oK^pr{c)+4>27~%xwR0veWc$P1}PJ^zR;Hw-An&!m)Qq+`r`qeFBSM zC&or7Ku=JrX*#3;SK+SaZEk0qIg5x>7~a^rgX&f9Pr(86$z3*$y-V)il*4 z-*b(*D7_)FmGwKi|B82N(K5Zk$RdiN^VRX;e^+{_P{--0uVB&>Gzav?|SZ}2s_=K z$RUmJBwZm3!mrgY49HTMvISxYq=rgRgzDGo5m)YZ3RT>Xpy@D&h!;mDK`c(f^IT{) z!u2u}%$@d;$jZqq@goC@lP6Ap)u=jB=%$fZOIZ*iQK6A7JrPduN3#6@#3ovMN(Dcu zqpn>j2{o!7ZJl=yeZ&Fm@gxznDg;g(Xz7OK<9)y^hvuN|j%nK@Ap!SR_=&^f3Hg*b2qMg9xG5TRg(uIU5M2*;6P5%k@gZdh32VO%l26=rKc}Mw ziZl}INtuL`THW#T#<6$X&XDgohpEEBb60X8 zM56dmU5Daes+2N@_pf7_fXBRgJ%=lKNs-o;Zo+>cc`G7Br>lXX$r-_eonulXm| z;91DvJG|P$7sz3YjP~`-T|*)Teto01@i3}qMoVYSJd+j&K_Wq0=hst`vLw&q4dFSH zPx~@=-O_jz2%L0FON2%U5e2Nrz{P}K=x$2Zcve&#Z$|nudEu&lm>m|BxAcMtBjZ`J zgog^>sOOX4nunaf+Wrz`$R%4}3%L`%;F>^u1Cv??#Bd;OYsR}VXx#$SOz$lp|2Z$| z*g=E#0ns3)2K70lo+myDQW77bzFzOOROL2p$YSa#Ykhtaqs1R|-~7C*-{3Er63*ve zu@ZYh?6Vc)XCPuaSjuMdHVRPF-4Gk6BIaTUEgkk~^}bxe_Y<^GzTRC!_Hh0brjJ5*!Mn1op+%nHBPu?$Q-@v;P zXRA$0v<*HqjU*WIvPqZJI3-F2zDB`6EVpdM(FoaCOV=udc&G$ioegD5^}y(nF4gYf*M3^Apd?kvwHzLMGxqxA_V(wb+Z-e{WVFx zfu@mAD5IZORb;l+d6^gqS018Kf6eaoMCi(t-r5|}rf(DxB#|*yPpFik$@=D%m2Q64Oe2^cZ-2CrN#`>RC{lBxrG;U_N7+;77 ztoyFi(l6@@lC09oLnc6NiaYe(RGAJZE{|KZFs|Xki#?p^8GgFqXXR^2@{AD1#68-U za{%~wBLb^2rn0$w!2kO{Rz&l|n3*HzFa>^beEo`;!Vr1^;t%js z8GEzM3QH&`?Jggi2$@#lkkDS`?~9zRkJwG;->ql0bV*u#g0ksGJp z7R)ocie9bu)JYccAcImq$O;6hQ>;i^Z-&VEvoiLtHO+!LUIibP65G9q}EH&I-4- zvp-&gCct^kmggCE;|6{T(@hqnQ@1fkHUcS5u-Ir+DzuPnRN}JZ8Y1G?O zyXVD{HGrCog4&mZV=I{lwQJ&6C2T8yU%lCz&6&ZEA{*6bnZ>rB;TN!ClJFdEPUVI+ z=u~;ksiwYBT|G@?y|F;4$zIua*eo-UpH%4H0l*1MC!rHxbgx)UA;HsZdE!Ws1ryx6 zP%yiBpRG^rfYi*t03a$kPcs_!VP7DxM$5;4`i^~H zBmYmY$Z*r0ryo2+KEheps7L%sNu581@um>1x}m+>VE4Vuax%n5mwPtJY4Wc(Z_I*)U{K zF4p8Dj70UTd-Y`@ok0@{H%~_shrfik(#^gY2qFwlh=X4lb_sQ~nt(Z^r?89r&+a@<3%~79q##uY zP!Mc;*?j@LKx7zsoCGQ@QZhZ(D{2)B>987Vy<^)L`HuT}9JmsgE-b#YoCZA{)f>HUzQ#EROZxoFkA}y@x5vyiFxl;tCAm&2%*Cq>L zDr?hruJ2h_3YB)|d^)x|&wr{j_);!3xmC1cMom|i7R0x9SiFn~s2p_+396Z$uj@!X zb}dp;FP4<6+6!>uaXPvD4`$-`5Ti7MzucH_HOEqBrypb79cM$ZGV2=<31!}0BnrFgV9@=P$tUv-Q z9O!R?wn9}Zk?|rGVcyf97P~Jb>z^M0nX<^w%nmtBWK>cRw?wIVxu9`gH*w-^6Tk_q zOb&wF>|s=oTVgx4fUWMz$yrn6@irhZI6yw86%m;f4`z>c$TQS(DIDS}nPB~NYb7;q ze!dgpY|ZmIt8%KU{=Rd(nYun3{YSPz;k^A>@l(V@i>=sMRysU{z|5~ zKjo!eY2@DZMMQYoSPHR0+DsPUsGt$|^?h=?3;ej?Iw_bH8Z+$?#V?mc*2aE*+D3uH zs=i6G)7%$K+3{J{>1>v(@OdN#6v4?|h~2n@X1VZ$`(h5@5&DC|;VyvhA>%73Gd!0N#UJvo-~MVm2v)xLZ7}po9_JswrQpnoD|Ac8HJ;KX9<{lK!har{ ze=Hr3k0(7`jVn}ICHX~hnqX+!+X1ix;`jN)JphJjlNv&=;=I!z;;+Y{M!#+}TCHoW zf;a9uIF0T!k%m1YkZ)&Gy;KV6|?2V-u<^gO1@kY;zq=Na)%{r_)>+y#?bRSoE8B2j| z*|Y&g0&)pu^HX-mnYJMX>s*EFjo`c;pAOxB&&rLk#f8vQ*B`A%RLIkbG9oTLlDlVu z2{CPJeF^x-bufWaj@2GNY?Qn^C^_ohB><1s-iOVmtDAQ{}nEHrIITV}QQ zuQd)k+H@q(-rN%AwtwE z=imD;?}JP;Dtc-&5E>P2>`;{t2`Y?Z-?&&UIO5xooO<%3$S!dTl5maA zXDVqwj-(OVh)4d|N&uf%*`neElMAgW$tj2<=fP#giO8Xk1lZvSJkyDnr&Eg-O_?y2 zNqaC(9g>7qnJeKB-Z_$&yWEY|hP`4g3>>z&69YMV>mAgE*p!EMT*o!%KQyL3&jBE8cDp#aix`I_B1b zTn9ME2`q}s;n0kx@sJouWZ-vjiEvyEnZYwv~xwfG8pbCT+}Dj zpD>l44l_rWQ{;7blz8A@vgJZ4rpQ4sta1?%;ke`pyo2awiZHF*f-iZ=3t*eX%h(|b zNft?lkeptI$kO8V9IGF(Zf>;v$mk&uDTjL;7=2Z++3ByZ{pb6u7sGGC_dzCRF$D%_ zdm08|MlD^sT|QEc=siQxs4>DLqk*U0nVhs7QML`0!&3b0zsR%c0`pHY_AaZs)>Fqh zEOVp3Xy=e~Q2g=tNM(1?l0}$^u#BRYyvM@Ay)jF%(}QM^&{u*6PW?ICu$u$jn;5+? z*!?iU{i{Bu&1g;qWf;|-L5bkfe4`-k{_fM}$BmJmD*-`Q!5#`iYMLtS{SET08^mAi zQHu1D5mFK&*#DwcceAm3!kvw{PY26-uaj!{c1KWzga$}N(m}K5>)8n})Jl?Gb^Ly_ zaad0E4jxV9!%;0!fc$mN=~v~?AQ2R8pnEkq};@W8M0KPY?W=FY;lYcsZO zCmq|iZL4G3w(VbR+qRPqJGO0W`l)(nYO0>QYVP?0yXxA1?6vlFuJc$R7CxFo>H@8I zYMZzurkbxY3L*3&7Nk24&6uR|>3}W0NgBM0wQd>dc3D;~j&fqy2!|+Kvr@CQcS&?f z={K{kXO1olilNYWSO4^Scs!-TrwP9wVL9{XVlITtqOKEReEakHmuNXB-b_oUqR7Ix z%B^cR0>$=^qgH5hqcG9{6Gx=3US6=d98Ha?&N{?Cj7=YvmX|HleiOF12H3IBRo@C8 z*|rOt@7Hri)qnd8zdk)y-7c2Pwo0o34x-m2yY8U3JV~_p!`!ZPAO)CMATlM9kXP5Q zy7}?qb|TYr*BdYjKatcCLj(mRiDX92+~BNHm?#$eleDe_i*Krm~ewd$lBif0F#D7|9<$mf5`Vky|$|qjOIL5 z_FK|@)@ydJTkszL>m7(t0IW*?6K03D|c8+z$O z&e5v*Ps+scACmM;oQ(fhNg8leSbzN7^;GWH!#wJ(K|qDWMNr_HLQ&y7}qyA`=}jqCfFO4lkvq%*f+$bKUOrZ*{f~rg)p{7#FL-{=7i>E_p{>qkkPKNc|DLjVO>i2idooD$p*{K8My2uU z(WIFR?5U*9$Ogo4?78RtasN|Hu6~l=x8j`!G>$|r5hydaVC@2Js*6PRMD$KCdB_4S z!)Y4aFCpzI98DfG5t=kkEDpU~lqTnUk+q-(Foqb@Kos^p%d?#lQEEX2#z1mNa(+k< zQyh$BBLO3xyPGtcE}zbNmubI%AABmM=J9W1sMK>my4hGa=%QJHcMt7bOS99^uoI}1 zdbOlW6bv9%H7D)mGD>Lzie+;mhdK$Q5-25s!ObF@bla1;`K<6A=bs*iG+YR2L>_yx z4a|;a`D@Ne&RkXsnP&Z0#dsz#+-K6+E$b|0;qr3Jp1(>#*)R8an~i3l_9RJ?pz$-l zwATUisQ2>vGuMDrAdJx7u5zZ>T#F71$)*2Vj=RFCa4F^(?>-ZkZ5X7TCwW;EmS_B5 z`Ks9P?K}2$s@ajLbRv;knwBSb^2ll0P|y0M=1}j{hH(!aBO&plSpC8_J_2|e23mHi zfaYV#V@fOOyxg#%!I89bLjIIzrlN|kl+H;uk!?{n3~(rshqoqNUhF3xN!7{6af%>t zbaS?zzjzRtFe#DHX~ceeicK(Muxt1#LR1nk_8>RP6DMov#2BYu3MdLc6Ez3+|g)`qTkt88Cz$JU5 zER8mXQ6<#g79+c!mz`84)86vW8ADjg@)JE{D(>$JTMHSY)EXr zqhLl>%}L29GlU)riU4(L(9-VE}cMCR|k+6^GG;6q&?E%hl!%k5e{ zl^xZM(BZ?+CE3p&LL*03=NbCU13V`|>Ze$;c)FZ&NTKHNPJi%VbHR6-PTfB*`E44iV~9R$xL%Z>1G z?8Z!_-`ch~h^R{lsRemoGmiXA2f@9oWU?ZWMrZH`KYZTI4sNEurHk`N^#D}n3-uWi z{UpcrWGXDoVBX7XtrhWOxl-*9@N;#}xsv^yBM}YJ*lV_JU%Q0N%@zo@l*TvFcaIO_ zhe)EdQ(Adm2Jzk+>IMAG$SWIx7Za=lLs=zWiL^OY`=Hugyt?NjN;619H3nN~a|I}u zkgz`70lpj`BIaE1ttMZX!S=Uee+DyD_#c>+!-A_6cK}Km z>;qQpYscFX#G}zUHrt;-Xh~0dgrsoJ)-(rB6<>4=T0_nqbJ-ToDAMJub4OL0D*90U z;T`v#TA7{0%uj#M(p`z#-?=?>m4$&I0S1sR0$hxIKAZDe!T6uMH<)=wPnRs!&*sG4 z`}sM85Re_vckUDRBq^~)DzCM`I5!80tS0ZQw^;9naz`NDy|A_FA6<&6bj`$O=@Kos z@U?VDv&t4I_4_M3kk$p~f_k?lxR4 zIhl{9{vUp5RFNr^Jd0<^+}A4%*Y90Vz#Q&> z#-3`qR@)jPr-@Rqjb8G#=wV1;4qDqiL*Vr1Mwk;UZ`$-rd-TPaHzeYh$J~f@@N)BV z-9C!EyRA2G_WoS8j`B>&c-LVlbPc_?e`}spy}L_$Hu3+J=fFRwC?*q6n`>CUGVc?G zl*#8d-vXhbCZ@oYMzU(mb{v#OhmQ79LaCAaRn6w1MQEJfg``BnMyI`YoujKrBE1+M zDF-S>rMFp&7@zty!^te4sXQFGmn3-|`fc6URdxLr@N}opEq}D%)yeh9A;8NqB{a*~ zUriR{4fo}dcdIB>yjQjf7oB;o;qmJr)dGCEQs+)a7+ECa^tWf`oG>!^5t57@N>oY+ zEXx8Z%ECF5~dnlR2>p~cPag-Iitat^%lO}D{^9FRp6>ky0_j9EU~iB(LRQ6d@n!9+3K3Yrxh z7dnrGBjBHZw_d_2h$_ff)mii^^4&&9fAJ`%-L@VZ>vV*@arf>bMj4V6E{UKKp(Lm{ z`bVd6Ws8PxmwX{VV+ZFKKLmPI#git1ILSr`{=R3dS20o)Wj-FvFIp07ft98eiCjjx z+pnCVHScC{kDNrngu_^;?U6I5GUYS;0VIjE8!JtW&)e2+AIjnu3)-nBXe8R$k?Mot zM2LbL(*M?W2e2d)$ zibp9QI3?>Dd~URSdJO4fXvbh{bP(IL-aC*xpm+Po9XT{x)!M)XQII={9%nXxpNv}jZ~ls*T_03N zDG@6)gS)VKj4}QA8oUsV*)S0%UAn9b;o6KXnmr0E-Uzuy*l)P5VXdPh6i4|aO#)NL z)e#9pG9c&8gx#o(b{jvlnkgIeGT_l)`e2(>SdOC?3eMYWizv-;vlP6mo|a(f#^u=( zUtSRCeR-HY>Yqn}mkW@XaE|2J(LOA0fwS)IFFb+QEY7Kk|DM>e>Z%!albacUn#iYF zrG})N|EyM9&@z?RIhtk;)?#3ZiClZD<{ir5oaD)O3S$a%+o)J8We)JH#2^Y$S5`$Z z?%kRQa;Cfhq)4hM1h<)t1Mu{s!iOW6E!BGqO&&Y=$Le*cj-eH2p$`w$ z?f>lg$v{m3E5h5LiFm#xTz+bk75T2eLLua{AQ>wl4*&ajWLcAh$i8H;pkI&!tFc}t ztp8f8#djS6D@PR?a1=?gnpds)*!maLnH3_0ojUtdg#Q4{px|g0cMa`_704$>3XGT&j-PKoAY~$|?6Zbm~!YreK#87mz8(6^zjC z=)eFK+BHsCMaqHwgHS@i(RK&bNr|?N8{+jo74L2nB7aSMJXLx=c2nfQPhd7SfHf*8 zk+c>sGN!usQ@QPSj&1@q)PiHx3Zv@l`m91Msl}(m8ewb_ctZG(+{|n=0qwHYa?aE0 zvGz?{I1S=ZrvP+My%zYaaLvODqL#;pwKui3!ER8*on?(Lf_itw-`Ja-aHxxLgo|qr zk0d&`^`>y*a>CwgVxFwm>SsoNP4*%c9kjGsrK=08WDo(!K70fya62^C~BS#aTh7XIaRRxhUYk;zX5W-|>Jr?5tVPVvZab z#E(w?$MsIQ1L8rAaQtAUYAuL zwr;0g%pg>i2&~VINq^1_He7$#lfVz3a=xsUUPA#7!uK(M-Xb>QBI_OOYxb_A@bzZGIVC}18ZC!*!S$d|dA4WpI z`gU^ZdcA5qMky1s)-Nxa|M`ebB#P)uo8%q?X*o{MyS>Y+Tcu}y^OS`nzn_S>C$52kRq$ zbg!n>HZ*jx;l($p#GEz+GuVFbw5|Kj#;vP@WXW0WLbL4(>rxLSYi^}E@CEZqrY+QR zuJM_o2)0QcnAiVW@O6{F0VD&-9}j(nh>;zrS6QP*#l zrs{!o$J`J}6w3A9Ltd>I_&=(Rq8&0GG4LDm0+YrV58Pz*xNYuJY}aLd|rJw z&uQQO!r?6$abEja$3cFrs}bJ#u)fz>{WUn{8;mP#j3rf$#<+_FbJhkuB4Xuv$9Ot& zQgn#+4c0E%wB7iC_KKBAI;Y}D8G)7K%nNtE6CQ{U8%&bKLQ!xbid>lJZy~`(GX-+-5Vo7+JDJ5FLp$ zAnnn(v%{J?NRzM;5bg$eOzJ3h*Bdwm^dt?%ut)gHA3c+x{t3DCMUnI`C3JMb zYGLF%sF_0TonLT>7>h;dnG~Ox&_-vxh6SV4=-}YZ1M-E8mUYRLDS7rNh9*&p7IJfq zFnnNnzl4h6jhS>aOwIdZPUDFUTX zU2y`UZs<=U1w~dE=NJkwt)3MM@tdW}6~Ui(lonQJF8Kg#Y!5O%MAalOvuYE}+<6d*YcN9UePyq_s8d%ty|1n7MsZkw z$q!QGHD%M#dVQ_pDL8->)Es#{jJqiyu+vc6@@lXJ`)UpMlTq#f{nZdeg85hRrfUg! z>!8RB*OvS47r}a<$8$>umBxlDeLsZmbO8x6#X*=6|E0Ra!drGkcXYW2h=-G$XTAj) z9A!MR)$qLTaaCly=T$yNbb;M$0kfMz{N&sTGXek@Fz|p<8FovUqX#;Qc59j5C|z;% zz0k+`iXCeA!omCM*1k88Dd#U1%;ItC61>E3KU90gJruI)V6|Fb%__$UEbSDk`PK35E#sMfhk? zf;A6(_lj@Df0Nnn(o(AM=hPK2csILYR(*JF#L{yU?X;SPUsqP0YUD_Ct@v*X1A^dg zP%n+U41SnmRa^ksI=f{7mWmk|X6;HCXShd%J3UXB<2zS+Hs`Ky#jvIi)h6=%q?sGv zcOPR<-*%;*d^yusb_&`t?^2$Urpd>}jQd8yV|$ll6#1}FIgO1M2UTP zDrrA2A+x+A0{8!_foRSo^~Mgs#Byvm{p}!Df%iW0mhsJ9738AK&0O4f-+Uhwht~Nz zf%)b2KguCq(H1hpIGgcEM-Ff+>40Wk(kM z`2U0@fciY1E<7BnK@k2h4EoEGh^=qvRU0dt?^ts+?nxaF-h1s__V4V%vS$s^xuV>b zY`{TgtO3-T?iK;}2p%Ca$Q&13m4G0KGqcZOTH*H4Al7fkMj0n4-9b`>JymF~5E2Y( zdy|#VT<|47K#*xl1BM%&@%t3F!fwAOHe{R)3(j==r5(->>#MUauH=C0QR@R*@2SH+ z8AJ-9m2iRFW?jJCR*ICq_>u=X7e!>Y97@nnDR%j|Z)Wc`gzH;J)q$->%~uDAQd}^+ z z?8d?IU#FR7v^VVVIN*GD>gIlb6rxLQX<`981$s-tVo4FK<9Iq`iy4t^!TSg;^xYKv z1$d0=|G6BI3Lu)ZqD(5BC9c4BuDJ|4&~75Fh-2lVo}h^OJ;`1kr_vC}t^Qe#lPw8A z{#7y)A;Yy!)RFBO1l(0^#d03iDltL@tqSIZhVnf`3R9{N%0t5bCB#TQAU=P*0sfR=^VTzmv$A=Q!*drs!8g_DFc z4Y7${V#eEvrR<%>*qE$L8L>2o0xM2O+t4|_bcj}D@+~$fiO%l8$z=6_t>DZ`2mKzE z^@pk50+A6@7iRf!j|`>Fmnb_@CuCPV34=JFRI0fp6Q3Q;i1fFu6%){casz08X6b^i z5FU~zOJYH-_=ZVX=lU#zM*2Dz)g{?XX>r69r#V0+J$*y))7fT#5)2O)2+d@iT#8hL z-YN`wyfS!#@dM-hc_S@1@J3ER%#$c zu&@|I{1#NlM!LV)hEmy~_0UEdX-BzfW`G5ZNFD)!Vo~ECM6u)S;LXR8E3>!T%X!W3 z$B*5gBa>e%yDuk)5VD@XJNKLU%k}*+V?BQ2apdxG0bd0@k5;?GL+KP@KblKBN`jN< zWfdQ<{Y-}A%k$1^uk_C*BBrKiYlb%lgFvT5JjJVdF0b>LBr5W|LHk*r{};R>iHa&m zpV!a#lNWJz0a|U}D$1|ANc z`V=C3@9y?JWPn+N{&zhqOt)S%Hp8HFjGn1>B(ST|6WFVCr`N*$qckuv{Bh?J{7b3C zN%Uem3tl~dfRD#zQKLyA{krKyW*RT&lLa7~XN=kOb`)y5dE6p&VC?AX$8GK0o&E9q z`T6p2Vn5m1LfB`|7lJoVezsv9%o(*CTQv2f!GSd3;(1}`A$`@ZOGZz;scourjXvF{ zD_~FkVmdE(O%IxCSf4gtA5}Sn?|k_z0%dI3SRq*uJ$mK3iR4$dWE|8`5_0J3;|d$a3h<91E-O@Zkk*mAnE7qofJ1ZT71Y?Rry5$YIU-0wP!TC3jx zVQ{sMl~{f$UViv{95>NeAa@t#n#L}NMnQ8)V!QjQVdI&R&(maM5i^GC181^6pVE8t zMI7q*@TPP1@hCtg?*S?lZb40JtOLP+)UjY}2Em$xK~9H-X43W_M=MuLnJ`Fk5GbNY zyDO{#NQ=pK9$Ab4_~75$WxR&nj~k$Zhm~e?iJP-%OUt^iCsJ#UV2iJWzF_hHw~dbB zz9S(g=}yEED_UFXh1=n!hpOC3FkGJn-4)2q*$HeFIRaTot_wGvHJ`27yrx~rBjoGl z#`W;0c6KLwCXWGw@S895XP9`79=zxT?K+t=6)gx+P=;z-AAtgff1>RUimln<`x1GN z*@W+I#kC?mF2V0o&&}k?W`=%!5{^PtRc)zmW>EZxb+GO4~ zJXfYb4b#|cZjrjxCB%HK^1P$#bh^b_87zi8^GRI{2u`8J!RVB+iN_DAPV0$S`c))e zC8d1S*USk{8+~mr-ui9o-0OR;`=6z~YgATVO-4rsSDj-O#C6KZ00&KR1LpYAe{v0{ z%X7uVp=xVX_=IYKobdNZQ9TP@9bP}buch35LRGhbJ36Tqq!I7$NJ*DhcgU-?YfzMs zMqmE^fa2%!7yoZ{WnugW2l`(Z{!DEDM?C)vDxKOa6YQWM9QbZeAIWbXR(*O~dJgLH zrHMTUqf8*4XP0y&xJ(eSseqFa@>_kv=BlXzY?059|`tekJsSGqfm7( zLlS+>QEe`-CVj*u)u)x`S#Q72X z!&AV{lEzaGQ~ReJ**^YBpfZ(c^FlzE2>0<)i@Ay=w>77Q@QbZp8|Gs7LNjl*+xg1^8hunJ9VB> z=ge0$#cO%aDfAU`rz;B(i^{bY$!QGGYtO2-Ds+Q5pLkwh0`uGt+)8&*5w1cZ zn)>^z2?G%LUb{}@jsXdY*B+C0O{8DGOYktL`SQE0Y6Op6tH=uK0=C8;4xKkj*y3CW zMc91v7$`zc`|C4?qQCfelg^;Q{sQ8Nz7A9Y3vkVh&sm0w?1(Ttj_A+Rq1;D`H+9nq z(}aOCTlumgg;aBK7_?s$rKWxbUV2OnnkG)nx-ZCV$8|R7wiurCC52rk*xS!hMN0y> zzQi_;s9>rJB<#dQih!ag7`Pg9qnbrFEH^XYI0wr!K1@=tjb`9K&w;of1uW#}X~wh3 zxrwbbvSJ4%nLzp0kI08L4yU=1so>Ir&4JMaixkO`Kb|0xg0An0JTi=^_eSPLK%!q1 zA)f_R=2>iX4{gEW>jV=g#O=Is=~j4Gv?Br6t~)5HVe(ah{fnC?BVHP;o%DGXRRjj+gOeK&b7dgK>Z?iEK#5Eov#ZFnh&Nn?*P%T@H6}w|G4> z7A+%m@Wj3OR>S5ccY9F9G=jWsynT~tM@bSSF;Oa$qCfI5?+g>DCcy!YWejl3FRe>A zlzom~BpRV0v4;{$t3~vBq_fZd!c-D$dph4spzUTmYBFR) zmxT-`RsL8gS#?+~J7;=mw!py44Kw$tT#yHGqIXyah$7iGRXo7lcry_H?O8FuB58;Oyo6t>wO0tnBte%B7S|JKEbmkivL3s77RD%f5x3Nag=%sI_da_6O3` zu|!Q3-aIO{mpuX}<3JcS>v6eA;T)JGTAL)lbBEOFeOSuDIZ>oWywcPF`+X5)0GJy< zpAlrn4331?ctoVFI^`TTzd^;ceVfz+pVl*w$;$M!?$wde#X9qQ*q&%dkazS~6+UGp zi?l)yi0!)VHcdt>dIVHXA)hniP&u`#(=GzWHBwQ5y!l?8)CwlLMMk*VYnd}RZI}l2 zXjd@+AN}>HHZ0K^;W#{qWN2F%+?=|5&hyB`&1dJ*^_G)f)fAcFOc?JL1_JBqSXFOB z(v6bk*yjFt+3SHg<2W=%X$-58AP>n7^1r0)VjaS(uu{}nuD>sL`E|ykZEQJuejU#b zW%%<}c{LNqlZEpptv$X24Ivm4EgeU9VBKRCA)kDPA(`~OkX4-lO;RyCdpqyoHSnqX zSnBT2z9J)+!m&Bt{d_0rDy;7Q)!48o==jSD{KHpQ0xuAN`8ydp;IWS^nBWoY3XPA8 z?7>h|aK4Oi4^awE&XNUbmlt&58t4_%m{m#LWGSO7Jp@Q|;SPslX;(?N4~|~1%F!a; zP^oWnfxJ)UIa}`Nq?NzR#wcq!O#k3QrzB}2EsyL)76K%hM|J)mt1oFn`1Ig<$iI?m z!1_OF5A%P>QZq9${@1O5Gg=c)o8l-v4>a#)l)`$ozL6bNgKpEqc%$t0DF}uf<@C7l zb3j>WUr)2u)HZUgl9r>SIY3KUsW(UJ`G9!b&bPCuT)rJW1K*#beO&R#r6s%C8+KuP zG>#CdwvKIkJ7!C$U-taEKh_z|9c#?eme2J5)Y^F(_N_s8mwC&2^JvSp8L?M+Mwl{i zEFc^O0J?NhC;S(W^fo`t^tZPZjhq{w`F(Cix!E!%2`mlA^{0XWDRt8^WA|~IKI=Ob zvnM^9Tqvj-KO{z%?PXIffzg*9`zSpP{*gd;Ip1vBTRrU-u2gW(rsZkV71v9D1*#u3 z@2bwJHcBU?B-CRQw8jV5CyY_f)KoD{#FDablq?I2e8<n2-D#I`3fp|}wB>dWD zH|N*&E@ZY5C02UNPO5BnFFxpo`AGX>J#ZVm?~O4@+Z2)UPyEWJH02aa6~*bI7lopn z9Zf=rc#m@dWKW6t#%j+uV(rxk6oBW?W}+lw@k;P|haw>KMzj*%l2H}#py$DMY~5A- zy}?}GmP?>O1c(;mxT7M zvVd`9K?3ike-Sh!DhLZ7+_o#PK)))!eKKsFL^_{>1ArX--(FE8`F7TeuzXe?7O>r_ zln`JLmR|Yl$2WBt(rDiS?S80L2fyMDH)KS+&2j42<_So{56RRLR2cE;)1I^|p-kY8 zZmF)f1K%@uelXC@Yt^egLp{ARy$7;U+r6rIsf6ycLN7t`VJ8-Ip9pbfF~yK2kNh5q zIYV&H>OxvEW-QjnBU76U;y8F3n?q$(w)ZwF+yg_tWuyogc*{$BnLy}41ORc{pb-Vo z5b%k)d9R@8Sp>RQY`CF;8`6G}Kc%uL@*tQ7pUM+ADt6-ikq1Rb&H}+c5Ls75JX93gc%0AIM*~{$bfe5oeo`Q4NrM2yQW?6esaIKqbls z`g|kl8SuZ`?9C^<8#DR45Gv9onIFTf-m!e|ekaCLDrf$;5IUvL~2($VM6d}k53ZnAq$ zrDfJw%qg6&uEa?J-oSKguJ-xjbR(>TXRbT5(0Uw!C$oDcDXugr#HZY)kr$d4!VAx^ zXjygB8sIHjkRuFBy~IZOihs9?sJm2fy+z2vj-}|}Y8JJz_z{tug(sjuFIdS!p^{;a zuu}8!=bn~*u0W)Nuae$EmOkjbn2=@Qs#85Nj&&0G4h8FoD18E42^Ot$bCd6NLhgCw z{T0wd$CuD7A0?0|ZBas7FLLDsO{YS&5Z4xFl|^(H2|p@hdGI{byhECiO@5n1=EhiP zI>GAeaNYedeXeO|gM5tfW~(&d!NG&cQj$~kVZ|#evFu!(hhJ0))H42EfZt$*!0u_O zr-Ge#b?@$c6Xftd1&c!hep~pB<+T|=Z96_WIa8-0Fa}%EA)C()(*gRI_P*m>y$8Sa z03&WFHuAyl8T=SEHIJNjkLyqO*>s7&rs8Q@AR9HUJ-E2>^GH-rMs}43slXp}5MG+d zVPtMaL*0^-lC|Y+bo-pN~2vAl&?fdY?r~ zD14tq9GHZSa9yvcpqwbaYVt^>3G^S75{}3aTB&$WEUWSlEOjol^ZF@X4{Iy__3H{O3paD=J(x=6y4 z!(=rdilMe?f)sA7)2>kxZu3OO8C)%*U;J%U#k#o`d6!>dG5v#}$oqExiXd@I{VqT` zUG)Dvc|7eB*>rcZjLAdwEKMIhV32EeJ!IA(3k4l`vVm$p?E^x3lC=3xCV}NYnFQAV zn-Ks1T@f~;Et7oEiu~^fbxuhKecl6!=q$Kuzvj|Rg{wWgV_1uj2pWf&G!aHBmiFh} zrAR1h&RG5an!;@+5NQqwC)Uqr3ya-5yJ4+MgVv|d-{WaUC+E*(^=@c3pN*OFpA<^w zT#csir%Qte1O1=R+cx{{N-DWbrot*(9RY_9l-Ocl^6_2Pzj zepm5b+ksFvfW6iti*SZ^v5?Bv9`87jnEZCvihdF zAw>xZ;CVxVbWjV+`e1W=R`1WCp;umQ93F1(TQ;ZO0jM{0cpXJoBw|R_^uxrX5sjF5!g8YA} zr(`OkV$)LhpO;Yo1gJET+k!<=8Hw#QVZ2NiR$!`;A%wC?3ndN_MXWO30$`uC3 z3c9G-(1lmH1yyzl@${4ii#AgCG1tG~3V^}Ea(a(yo&FG!$wU|qoB7VnVg#v*7S$QQ-h9;XA1MxSvoIx92!^hQujLkeC+E>DM+WC>5inw@pE`!E+y?6 zLI#Twddp*@X-fuDLw4WauUDg(@7Hr=zsa{qTdJ89wDa|u=I@h(#>VQI5Y^7>K~sP# zVQV#jc}pl`1YIbIg6mosq6ZI}L5PpQ-kdwHlC%p@D9f|bIPnK-!qeYa!`|?pMRsig z+>`P{$oj!oMr;vb9F@<{o$1Hx5Zy{wO%Lo*nYEzw%|Lk3S(!(NEPr6+5$GV`{MQ0n zhAx9>Da?<$Ew_rQ=5zMzB3(&S+w3mmYd*M}?^VQy}>ldpNs4hZtPYXJUxcWoC~89iSZ{0kW2z zdd(p7?w|K=dZyzu$eIl%Jbk>z>6~t|ogodS!G6TUUF736da%*KVScof`@;Hb%TC3% z(hqlt+Jq?YCEP22n#V=vETd;-yLm#ifyW5yb}8dQU^j<%pRC z>h^TRoosx-JLT!BVx=8_XNF>F(7(Y2bRaXC7N)6vOSMgr&n)GxOkM3vIJj2k7?E8) z)#MO}(wMJ2j3bl59`6hMdfmgN(zoUc?@9-Hl!%6-?TgisLH4|E9u(YuT8=X7mQk7J z^_|u#7#|d_TX2w$#IAS*bxS5_m+j)jinFLPHD})ZvGfI#m}*MW08$AHr|2+%(+XaX zls~Vsz?IU!6f*8DY`ELdQu^{NeYw2!zT8Slt{)e&Vu{S`e?<^XRy=vHgf?&pwFcZi z&T=+T58|$dFk!p@2zB%ZMtO!gYhbFK>hev({eups3{^odx)U35j^iFmrxIwp4;N5G zvIoMNVd4kbjoJsjU19A}ws1?|-~U2I2)m!noaZl`y{xz2Es?eFXSogkY^am^V?U5v z-k1~(^nAE&MTnVoIQG{8|2K~MY?Jk zQNJB*#9Bkgw8yRl^!SF=E`E|+1119VlHuW4u^1UZU1);iZV_(;d;c+al!-fN3%ynm zBPVdnR}l|>15yJKxHRFKSB}QPWdJ1j__@KfZui!>AUhw-o0-G?07AXz~x- z(!3X1d0B`6c}Sw>P2O3#fv8wcSK;@M*hJKh$b_Fe-3L^EaU7V`J7H0?8?HH3U3lId zEwY39{-c%BtkuX#u8%kaAI`)_R6-+)j9Og=*&rr zfIX$}f{07tXmQqoze*rD&MDTr;N~1As-vi9C__bdMe-mHYnqYqxc;vP?lysIO79W; z(}OABp~}G7FnAG&(S4#7f{Uz4b+LeW5YD?B(Zu}Y=h>3onaDr5DcDkoltWMwqWU7h;%*oCL<6CZ5$YQXrC+- znpZTp*W24cmj>fm&eoM&05bbDd)I5`>Mzij>SJ?Qab&vO>+o%xnLt$xzf+kK@}M>$ zp6!nXGyd+DXlgI0!NmM9)vuvA^i+|v%KC%(zpd~q2wU{DYk4?UK>gP~dTPpXp}v$O ztrwPITtN5Cul?~NwcgmV$+js8#hM1@^CFqb@u6*B00R( zDk>}MB<}nVg?=kxz;l4Vbnzlos@}h)s#v@-tr%Hs=-p?|p{?aeB7k{#x~zCX=Lm`e z+Mrm6`gnJtmOJ}%^0J;QisZd|Lm?bmtZWI@@#68*90T#lFfCyjz{D#yG~GGW8jJt+)L0Hhb{>Gb(|ZlM@B# zrBy;U&7e+XUjAC;z2ko418FwSNC^l@%7DrZ$(|5cRx&3Xl_}|l}|34tW z7Onr8!JzcM)ZK0`2?B_z5=mIfrVUX|8d&`|+obqj3Yno|2$vOys{HiolXgiKF z<%9Ym?`Dkodfz1yjM0?5Lc#D#}Bt=(b3U&R@6>@S6NSHMG zqrDtNn_6jFIjvvsjQD2QCAIZ^KHfn@v%jr&MB&8O*jHRN_euTz`hITi`lEaI zaQ4VU^;x$`SCGZ~;!gIyYI^6bO??(dKjI-W7pc!unE`L!TW zF!c&x8Qb=T8rl{0x)lA(m`t@wLVKSn!*^gAX2}-=-8oh?8en;zs)KGi&o`EErxu-> z?hQ?^Y3ABDx93IWd9QU3*P6OAMXS0r{k?lE9qFfEcMD+z*Z zo{<7W62Vfn^mf*go6Rrtj|!Gl<`{!rl~_VVv`TuE2JtOjpN;KTct8G9~2Y*|;6r5;NOZ@>nwG36iDCi_P7e$26jhH9|YyniAw_ zDKYyiHbC$RJ&mjrlKt{RF2DrNxw_8UW%d`&!(YCSR)=Lv3(sIvIq~69WP;yMjm}b4 z8L~~VCq5Ni<5?Is=;1&7O~#XlQf)-NJ*RnwFS2lcdS2lX(fc6v#@+NP6`9D!QL)5y zlc=S}wgIX(_7x?o!6@rNbI|Lc+A{OO#y0q*)SwSiIh$dU38>^@1*ZR4*ssBL!d?N# zomruy^$}sbdKz@a_w<7P1c?aih_O3p7qxcl9SPyVI&2<0i!t|Ts9NiYf=kT4%mI4F zVPUpz3EjpF5s$K4@nTxaFE?YYMGKQEc?{99@yrN=Zr23(tat&;1Ion?>t~s5;O%#C zOX5Sm<%GnFDU$04z^WGwB*}$E;;guT6~u?sS#kV0V!dMyXcl_w_J`Sb-Lml!_z#Xo z8EGB_fD5qeg%|(8zW4LV?92@Oh9Ofva;r>LA~GdaT#SJY9Uxf-N?e0`l}g(nj*Q3* zRbKT6YqH`evxV8uVfPjpcNJovqIFnYnP3+T?E*OOkk{OY$ z{X_oa&@;U(hNKK!H~LZcsViA3YYuwro1r5GM2IcBOpq9As{DiibDC7f{uYQsdNXW% zn3D;Hvfwt1BLa7XePH3ux$S^6aDo@#gqLye#Osusq)C~{L@opjqHeSYvZjRN5%LMK z#%171&l?ai;evzjpD;824~@Zi0+LKTBC-Ai^yYG5FWJOwj<@Ry{XO{5m%o7-BGE_2 zi^POVI8j3!k01KDEMQ;Ps~g#GH3Cu!@&aTIu?@NN^nJc)@6!;-FUdj+&fo(_`qKX! zP9ilWI$q&JM5)2B^hkex zAN&qItstPk(u_I99DP2;v=YoFGHV;!^y&_4oZDgb+ft%&>g4>BV-ImpdqRl=CAB(d zFatp$w36?7pm(tWg*_SM^gvZa75&xyaRIkUn9-Q9Xo%z87ql_GyY_?R3=RGXqX@&t z@#D>8<<%A{vxauXuw&K#6bqL~Zg3B$iS8{*M zD(i4xljNmZW6c1=={Gg$`4quZfj9g#qdqKiv*Nto?uqNc%Uvg7gs&w29>zdZ1>Pr_ zM7yBGpNPy7J_R0wxZ230(%P2mPsAQ@ijV}poI8UXd5s9vCUy=av zP3Em6lYG8cqfsBmw&(*vqQP}0b?N^_**kV;!gNuXvDL9{+qP}n={R?6Cmq|iZQHid zu{!o-=F5DTXU)7*zoFKutIj@q@4bPb!zwgCDvM_ssX1r+nLRAVF^GS0TJOo;q+DZJ ziW51KTaaluXR&x_8&b9rUW$VU%)&<87P<<_Nu2XJ8 z?smV&&$4T9%q}chyz0y8-4``^W;oLg(}+wuQL@gi0{Z6QSP~xxCD?t_SG?wX{M9@c zw0jzlmB*ZB#QK2BXLPu>DJV^4^0TZNppxP%P)9W%aY4l+p&jj@P50!#P-u5 zI2yZdo(kP!I<^7r=&jC(!*&F$_2iDT^~#&+?PmrC%1OAJhp%fh1!7En!6iME3B-O$ zYu3HSl>*%+jk`CsyPr?7+EtvBNk+rxZ*FAM(owvJ)}0;n8UnRy@e!AwyS3lEaN3_; z`_c7}$##BsfE$j4sK?QuYHZ?K@5RosX1lA158K$%4(lgQ6xwoiv6Oq=gGk%vU&J(E z)v4xaAzC+<>ZFHNk|SF29|NqNZ|;x3e7PKBY6M;y3S+%iN0^E`otp*P6Zq|YWJEO{ zEjBfJB1jgTp2MsG;Z^u%;#BQpFY1YDXmD||)i}E-^N-clPht2aJ*{?9Q#*_H>l

    h~n&t;smR`mEc-|`N?nAbE0!TJaP;mh@{=IW#%$}ObV^K1} zvp%jT*u?n?=gPU;E+zR_OC6mPxt+x#xFco`4*$G;d^kr7Rk!KO7VD-gyZ5}zm&(VI zSV=m^LLyqygZ)ca8Cp$^uMF{1X{p_RKUBq zBbeOqbtO!v`_klrNOE`N69h0=om9`89}vq(K`li4<1JV*GnIN@+lf#(++eS6@B>re z%%{D(`kS!l%>lKO`^2%xNqDv8t~-%4H8#%(spJw<$~vws0wPW ztc+}Z9cU^p-*~>tk=UipjgNZM6shiZ`Bm;q^ z2iO)OyxJPnmfgwcUT`Z;Hy+b4Hy-p7^a%mk%f{xdtdd0VbPjyvbp?+oJW>}(wH00+ ztSL_52Jw-xw>#Q$o76RS4qS9{jVNx2m}k)9!WJ?QR7m;-;uYjU6kAF7vXKW23#8SN zRb&XI{saU$8Oc_B-jvfD1u>MAFpR}@lXz$t%MQghJ)em66{Mk%8d{+oR~a}rFu7ky zl$l;$9gw4WdJEOC5rzon4e@A9W2G8DKn&{u!0^ZN$<_8Vv9G|^q^DQ${OJ?GHO)hK zj(UPx#4y%V&x40%hn}n1yGSe*V()mWy4J=|LCfY6SMf+#OS&HwXJ8xR_A}eY#(vWMK7_G(3~4!r zqi@X^x>G+dB)-2%Bh6r zaVCy1<^X?3>dB=k%N9Kx2Md<13vJFdKwk+F5B;w+9}`nbjKEm>(TaGJ!HmeL;p*v1 z;wy8ghF4XfaP2V|V#JHQ%1E>AD&75PSfgkx^)TB!oodLh!Q;O7C-TjJo;P0`S{)xu zc&%jWO+^)+*tH8K4yp>ue})$i3q`@8u3;VtC6eRfUviA8K9omDf{DZc{6nzvJ@_*f zP(_2cCs=L(D{_3Mr*Y-t0%PX zg`MVP0&BtGenixN>@Z7H!!A4mu1(ndBEcInF$CDA?(C;OC6EAm-{OYb8P^!NsNh8ka_-+XJIw8`XT5CGhR#5=a!oQb-iS!X@{U za%XD(IC!*P%T7+%jW)N@JNTYZF+qz_YINJawo#h8xnbm>2F=ep&1yD9(6x>?jBELQ z5~T`nE`<=11}Zla#Cxkwh3z{$@O2^`A`_>fIy3JfLjV^TA9Z7XwX-{9H|c7fS~`o< zQx*m2F_SNGzzqjpe0^MyZwlrh3+9|7jbwtO^Op2x2R5?ytr9EGUwiG-t!Z@Wj~)Rdfj`Dvgj7jNg5CXQjdc2Qq3ribM=SNTa%yk6YPdwFGT1%ksy zpRw5mfd|5FKkvNRdPhy>Zoym$c`LIE{q52MybOm=RYtGa0C$3!QzoK9ywfYyKb3#A zZD!t%q-=*YrVnHlUuPi==RWTrHlzeQt)xlzLGeToGm%YyJ zD5|zX7;d|Qsx@wRSWoT<{ZO7eLy)@v<`UAnOLs}InEBSZJ4j&pgiS#Y=AD@fUg*0q zYzE3<&v8NKmiEbWxLq@NW%%zkc1`H~8CiIJM1&)Ao(qFW9mk`cM-MlnqbU0f2Fy@{ zeAXd}PnkTLF6J`a{t%@2CIm6#ZHJ~i3U*H=>!O5HnFqwPd!ozDtOJi{|f@yng0s{+5cy!_OZ5({Z_}XpK^{lomIh< zuxFY3lmcjNR^SYiJn)2j!kdYf4ZU#-2Bs~8-B=7OvhK0Rch`X>yBr!A0^Mp2bw4)i$jVINQ(;GuG?(G!h8NaOD~?p>{8L+ihTfOcqlI_m zPehV)#hN=+*l6qxeWZfXZKriJJ)+AXDXP3g0vR^#!pWT)03f7DUn z(XFaHGJ}6fsDQ1}hGFQuh>SZ=>-^t)pWg*(fQCL2ko+A2kOG=jCJfM$?(~-n$}Z{h zgVEz@SCF%b{o=LpYJuI}?WUn|Zvneo>h|VihaK@k9{K*9<54#m`&voQ&b!{pm4w-i z#bCt3UoyEqaDtlve`f)U1}N=*;+O7i)#I8C7i#bfVH!+oS_v9sRD#+P3RWAG{QO@~ zSAhON1k^)0WwuG?J2;4?&6g-GH@!;f+6*(-*m=ULm(O>n``ITMZ;#vPM{5ZZnS&zS z!7}H&)IBiIaw^8^K%hmdA5yC!tscOKcwJXYg)}S0g6lFd` z=P$O__CHWw%j3M0=Pbot&`r#&CRn+x%k=y~H@WBiVCqJ1-Cz8Lpe94gi?OF}$+Gbl z@6;sfIBWT_1$AsUkX8h@=>$dLEBqPAz;{M_+yrk%`Tc~mK5O($K%Q*Ego7Xi*XK1C zHCyIQ4Uv*m+|~T1v36qC3{E zfhU=)@`&)#!53E%&EdEMxcMVu&Tw#kccYb21`L{#Qd<3Rx`Qr6Rl9;6npF(^pFeqn z`hl;8*c!aS`4@pQr$zI+XaWWwY~)*q&^%fY<_or9m+?=GC2mi9ycz5jMulYB+p$Ji zH_QQi=Nf{fxw7V?I6KgsX(-dkRv&yM@Hg#``3uNamrzi1KG9T9OaBx<86iTIFU!wC z9}12a@vIQrru^mm0}A#;A8ysi6|7L9auFf$HxU^#%@;i+Y>tN7fWsIQWGo6>}mwR!OWpy(Y)lhYtT@oU*wdXMY!0 zhzCp~=*5=fN5{>8H^l_Z#{^2=$*+fx(Fup#xes<4G3a;&3kd5)(9!yneoTc*phCWs zd&Mx639u-i85VG?KC<9mYDQ520Gy#A`h*1qRv~9_!S^CtS_Wr8`uwgQh*yP6X5vV)R6{Yj)it83q_E_fMEGW+^w2bD(U zs89eMYiP0quUoQ%0S~6?z-Ojoa}|vY9K+cs-IWP7nW251`#cQy+el=;i-}}1Xd@nC z!&(zi*!4}DvtV%gCnXBz-|#_F3Uygra|y;GLl#_tq|lp3kD`JZ5;RBp^6+oka#_0* zSSxHAbfLdYhy5l2tT`b(8ZSUGagqq9w`l>{Kwz2v06r+>Pd{guUPcxIq21k5Bg9#7 z*cd6Y^^%RE1B<`tm?MZGbYASTS8a8}5~5U=3N-bm!!MU69ypVSmfu7vwk(+Q%v<1Z zDj0{`k4X#)2a2ql*Ecttibbxp$q_z)D)iT$ha2P`XFdKAaoUylRudK+o%>0o{v5oSc1q4>0K^Ppg`BwP~HfSN4G)p z=iremcL2rBOOC4=d*S?>7FoS1B-vIQW#!S2w0YfC3cz8${m=htPE0 z{(sUQ=YP=N{|~qPwvLSbkvKxnPpbPGs4UH6&BFEcx@kPnkN%3e25#;Y*J;*@ZaqFf z7;}G-S{0_9FuDB)i)ValoGfD6IG*+&4Z2*yW-#e@7va~<@$xW0Ksr86Rb@J{GBdbR zlsQ{Do=ju&=#ctmr;6)WrJc%)QZLQcUj8M(tb6D3UxSFOy2(R&+ms3#@`hY*f}8IFlBVulX3&pZJF}5Q-jzLQ)wPBXRx%6eHRi zSdh0YPGaPsO_e~B2mv9yynTfiB5;}@0a-jp);U`m?s3hDQLN&aDiBq1xR7iY!suF| zVldh!O<~d2z3+5fSDCVy+k>?vGP3!68D0!eGM;B?f{iE25`M}`6WPZb*urgn~>iYeMd-xaqHf01YiZ3edbL*`!>-T9@ckUPL|}P&v!%>V1^n7q-zYh zIxaS)ZD1btL45yHQvwXW%)BAQMB;ve^oDIgF#y;T8{!1^3loRFfTm`n{(O6=bl&9L z#z`)6*z_--mu7;K+*HcD9~3_!+$(Cnq842gbZtKlukh&!boA=I@{pdgt*%oe+MjPu ze3w|C>u|u(D0x55!6lzG*gcuSC$v*gAT^xc_kiVdWP6Dxa=#sv0MW@EKWyMB4R6ow zux0yM{@&X40X4VYSda#t%`6FJ+eIf?5u`nk3aenaq5j^vT3x!52L@J~D($9afAw#K zF3>Q$`2u;y_xqbuWg2&AmlZCA(1xh?tA=t-*XPjT9Y z^V()_aR;`LSTE&X)aBR64rT{~Rq@Bx6}Au6+5~#IvcQuRj4F^(Py`Qfcivd$rnjTlp_^=ii8Q$ z`5f;8dm2R$H*l{wHWfF3dlfM?GYlU@n}7%I71tcj5AswbPi9J6!&QfjQcvX3hXH|Z ztUX<@h07-yUj9b)PwPC?oCWG#I|CRX)11UmfDMylgk;J$KP^lNGbSkmrp#+NlxB&W zP<3ikn5QFt=2cC#5kpFj&A5qu>R9;ern;r z->zIdtcZjj?yX-MS(4Nn*A7}6-fqyRkeU*p2xDYyo&L-;=|5rQvcT*vn}33*GKH05 z#NZ)2kIvfI7(?|CGDEdqnWeHOHAgc8)O~Qu6@t%KHpO%up9qr+GgY8J70pvtS9lC5 zN_DCF8ej$0sogDVi=&ktZHGjt%e7Y-Wyh@+=NucxF5gxynVr7?bdsZTHb#xUZcZKY zLip7nbcSY4;b*JJ?5C{w7I+Zh`I*;5n>$swuxoORLT?(W#sz`2vr4fY|2uM{6J$ni zlOoRtf2;4XfBz0HkL8nh3aC$xMQ~iVB=3=7Es}%+BIB1+Xe)FibHHXQlOO0e5^sl= zc{4O8Q8pzeP7b#7OakU5U)=s!21w;u#?EjsMft=O1_{M2f_QIAn;)~JSfwHugn?eZ zT6PtyN}AwjIaEv!LSR%forUWOR^uuSU#7G4EHba&ArP;Cj%sHChq>GZ{zVtTMpp&? z_F?`Q^6!I;G5(>2;)eVU_xcv5`j2ER^yrV@;7Z13#0Yr<>Jcvu(oJjD4iS!W1r^9qtSIN$4BVR_r(+v1C#I1u~la<>! zi+atkg4a7+bfRbRwI9dp^?EVYNZ9@wTFY{F_Acv8j$b;90gaodGm9~NK&D8tR8AcL zmdj;vksX|sqe7eEgTA+P0y3k*q||FE>-`7s1#Sm*cS7DBg!7RD6DDR)&J%s_V`}Xd z%RNy<`0vQeU`Oc?jfwe(5gz2V{?ecOm0qy2cEbDAW5$Zex0c=g=8o|_uQR{SHjyxn zeVMxp#hsJe#+`dx^sdYe#0k&4;)%{vJVy;%haA+KgyZuG==_GWt3oeF!Q~fLq2(7# z8VpW{dny(i(~B4f&8@nyM2+jaSJ$@wn$XS70S)06GgxIvD1((2XG3lFcB_p~#pA=E zAZo1EY=XMn5qf%YDeqXq5r)Pqi&-U50} zC^!l!>X(A;;m(Sp%CCNeHS1K3XEDf41?9t5f}S3m%y%an#A3nh)vp^jn?hlIt_q*{ z)f`gB9c`ZWSvJh_Ozd&xq#P`3o`y$Zz^Jy<*@khElVgYsUrSYAXG4#@qTBO+%XDjy zfW~HQX3H4Q3BxT`!3vV3Ub^#y>x8tNrkJOF%WyE0DD5a_r(Lw(LZR1HMpBz{Uhq!$ zMrv=nI9|IaWyQqzk>_phpgr1)8K04{o~#V#MMJ7HldS>X>}ug}!-dWn1(R^VSwPU9o>60jW6r4?y07Ck4>{HIf=8j*-CUanz+)3Y#C5DQySgk& zI3pP+oKp$z8;V{BY?u$8NgQT#tAhhPm#-MAQ|D>Wl%EP$+3d7_mGqush3yn}BjVZf z3&L%8x{GGwIXzwkfDY|ruE}Tpff&Rxy-`$P=9OiP|6tcOEZshE=@f)N0}W(-vkxNp z_yIXC!6|~=@Ydhjl)TbP1midMTtfpp8dpKWP2Q3@S|{cAcQGntx`v*Ey$lI@9j)XS zQo2{JVZG~AqW-(aO^@Gmw}$BaO-8jw>>qv7Chr+FW3j8iiHZq7zb>887OqGW6KDXu zQdXrJ|HE{N)h38jC>m4`SK5AWr^d?fwUtsas50F!e^W9bZ3>Jo0-(62wRCe0Sc57O z2RzCoNa_pApzNO*foEX7fYg-yjh735{jF4^{Q$TU8g0Xm6&edDc?{fX@u${%PxC#d zLp`+Z0WHcb$}2x$!6_$Wrx|lnhrCaLHFJRQe^K&(HB7KDGXKw+Qq9^rv4<^azPSeb z5|EmWUDBqJAa)CKaUeeztAH}&NT{WmMcOBQ?4NvVZ_h4KIV@Y#==yd~v}po2FK_Ej z*5H2BJGg*jFmq`<0xBR!(rDlVcy zRZ`sKVdt&)CrWC?j?45rH{6Hf6#?MW>wfnwDtGq_eCaWm+n_4gMEG3r;|i4S#7*le z_Cy3@XO-aeEJXov`Y(}uZs+0OwU)=4NN>a2@-zI5mz~F8c0@I2PH>QEqs5iwa{iF= zdn1)rypm2tqrC4ne%I;9w8u*+a$Qq<1J{Ro)!*&qb(+>ax~oQph!ZC*JD~2pI=6GOd;vL6k(ZTmvpZq#1mXwK>Z@V!1h+-9Pbs5Ftj&`{8!DwvHQ=w9OZnS(99 zRd->c+)j?3AqL`}M)Ou0%1Kpo)c6}<2{_)%>O4rx#_cvw@a5p5cgywF&qm(xu67DW z#K|<|-MUhkaW<&=KLhWzP^?;EIPhkpJ%^pz3wAiq_W{hb8S4;v^E~5Y4AQnvoRS|)xm%NBmcwn0<#G@c#rd%xI`cTGu@J2H z?%w}&j4QZ9@-0uC&kR9nme@poW%Z-Iqb=?oe)8Q4O(kBSxxG%;!w)|CeQ-vMMN&oW zTZ*&LN2;E>OwV()xdm|kG4R= zSnkcS5&f*2>J$)fB~rPiR|az_w$NyOSJ7NgJbSycX!AW60dm$Z{bdN`rT0*#B>R$Q zpoWpNIYLkYKd+fOspqPYW8D@B4M~?{hKj`-kbb)mEm?U~XU(bxwOVFaF(1|uZ45&m zq9cp`*cI5kwE|8PM|>A-XdD3Es2y7+mB{2gnuS>vU?IZ8<*R!;BSDlP>;582eJVn9 zOxZkRgyyl%FiKwZo8PIr(zVe>II=kPCJt9Ou2wOSh~wdcb>|gTN1looK%1EKbWg{G@p4yEP;`<4(@Ib3V@|JuEaM?jjb|u*f z%Ry!vtfTqL@d|u!@@rJ0K7my(H}wIKfAuu~cuJCd=S^K_Oi^H2@=8m{VeQIrVfxwM zR1`qYaYZ?WOEk-nP4Buwi9uTa))Yt$0b#2kSU)=I*YVKO3rcewEU|}{T)r5Nn~WZc2Ei3*uf>U5P{cWOy^BxkBV^K+UMkKj}YpYXW{;xgEEE=fm|AK$0O=T%T1}!`2(F&oEa< zm6La3!L&*@5?NK{%mwqoOgv*?SUwPIP(aS_j-uQG`C(7rD|S>*R198|$I!AeLR@C^ zHNV~+yeGhwY4Mgl`u+DLh@m~XqU2RLr6cW-L8w41fClp`+Ks&Kz29Rw3>?S36InRT z)jWg4&V7>1Re58ZVd1YTpL*`b`93$;OKa>_PIesH6tXQ#B4;@adSAI0$~tSfwt6EY zkW1Z3&E=x*f21D(L0#2s;Kj>7R3_7@IQCCf$%Ru_|K66J91hTAM7i$GzvsULx^i)k z)lZeAjQ#LDFDK_n3<7hMnJA8h9g|>gV-x~&BxShwS(Z}sB)0tdD2aGq)-Lu`cEI?- z5eSiQ+po!29VwQXlMc*(y|vDL3A7o;kMLKkeANgFd7z*|m8J#0nJezmKxL=Mv(BZ; ze{HAA!_?!lDb$FNq__MH!5=D0!@-dz^fe&(Nm3&|Exk!S&i7lWjEV zZ#l&yBSqD#Akh*@_Cw z!~!CbN*B+(ah`|hM|velz6@#CeymK$2g?z|$rR1ZK}XiZnSE=GCK39Bj2r+O?jd8M zJA^?a8m2rwcuo3jLbi(HrB9qQT*O^z^Mcj!X|OIa9;UO11Zc~=u3GY z^&k2jj(>B`&y*uICrNZ8-;R2X)it@o8-D~@TWTc(G;lzs!c;f?!V^7LYJRb=vLTHH zy6Y7k3w&eKme9bCyq!#?CTqhVacs7x(j1@`4gxaHJw`L^j&;_X;}R;c>Z7(a0Z58- zjKb9U@z`K@YY)T8+%sSK%?;##@B6XcydjvMlgrQ6)*^JM(w(_Hqpx_7)<~++dElWj5Y8^cDbj^S*@6C8gZBooHm&OP6LUrWWPpN>dxxt4lIFUohSiZIANm-C!96(%mF9NT`dfoa1n>7N-MhL{u>IS7#U)@2_l8!%@PgS{vbW_e?DDPN?~(+cKY<7`C@Q z_(g!UY^iGdwSkOxg5qk?df>JT8Jx#SBz~Mk13u#Z8CXW-sWaLenj(aj@-E@KlrNjy zU9u`h*s=FFF`e6YRxk6R7;pB0_xX2M=QSmM&}pG3w(JJhM-r`UDh@zi_0qak!s^Y; zny$n1L=>P%Xwmltz2Y(EqJZT_{w0y^za3i(#G9DG-LvH)FQMm_k_}BBBFc-=mjh^o z7=={Dp^RVDgSz$JiAIocDk@)*u6eRp-|2<5L7}045c_LKT4YOb6CCbe<@_AGkvfpV z3o|!iyWqZ`86)aU)TCQi!=M+}y#OyM&Mc49HAZ9MB}M?>St2$pZ6V1%&q{BiHlG-A zlp@^?oomj%V8`e~R1IlFoc)t?cu1v#JX8+v#7=(7PhNcOnUwXS*np1Y4$QvVaGmcd z#lbGH=HxorRJUsrD^(-{6}~l8!;k{68Rg_e!|O!6tJ;;1J%an67lb$=)rW<)6mHaq z?y-USbhljALk@?pJc3={p~;GnbP5?p9U^jJT0mm^@Q{4H;OQ}mm1Uixq6nRaJ;3`N zgrQOzG|i=)+8K{CuiSN3&7&Ih*@^8(^TLnrbrvc&8(PylS{MFFBd)Jg%-uN1^4BnM zyS~@>ja{y)e7@tt@rcz~xCn259^)x`oEOKXyI|U&iN?L_WT>m#1Dwnc+_^R?xB~4I zL&bEJHnshxptTQu(y1wp){frS#T6ypr^F%3^*zh`1&hXgH^>16{S9iHsS);H{{v3O z|Cpk){22KEuk-(H)$jgEw?AzA^)p4kMVDKKioyVPNL-Y^x+FQ4Q$C!)AMx@h(>5lK z*G_1de0@9<4^micA?Ha(5z2#R#ojjXv;1e8dV3T`gP*&*t?P5ov>aigu9>{GMKM8I z-XwcU+rCbotHJU9v90ag>Ury`bY<;Vq~TXKfyYJ=<)%>Gg2JDJXji{;>7#^T@a}{X zc3(ml(=)yM>2`n5LGTBsn&FSJZdou(zlySvj4=w^YF6>cK_NyE*?~7X(;OW*49qZU z(*mPaTxYT_{nV-Eh+G3cG`g9N#^ycwZon!*clyLFD;X zmkv#hhFp(TR7FwhpV&X0Sve;VCnM@Q^Np==kJl!HxtrE1%dWn+gDySAC;c}EBct!} z2(85XX+hdo11az_kiffhCBf=bW>l95J+rzNEd3ZOny}C`5*m$3Q<;(@EOQLa;gZ^@Pkg7fGe#d#05xmYrcel zIoEXrQWK{N5ZX#~!%<;l@CHN;(8=GX8KuTd%$1DI=|MZB;-X$|uNEqlp+?}rLRqJ7 zPelZ_gF4Tlkk_DY=M=qe2#oEunjPDy3I2Je+V2i}Wx(&kYX;gg8CQ5h%Ql7D=|PbH zRc6#`S%8yCQVAwgx~=ELmE474XN&yTmg_2t3VLl+;vc93j&iD6jnKY}4(wJ86BnQW zhUP6#fx!2yWE_M4uSQ9oKA;$+|8DAWU6owU+e=W3sd zxfU}rF;I3;w5js>st~74qkJAEhwF7_mryPT5{*Ks@gZVZsbxE|_7P>dS$c*R7p9y! zND0-(0Ku(T3>^AM-y5gM-?Vv@kG8(wZ_3er!@mi^FJgl6pZDBc(y$U&KKxvmJyQVW z+@HrGMT-_PJ#{RTS=Wuo;Jnx$^rg;yrn7sv)!IH2o9Krx?c_7e4}ZtH(Fw==%VbgA z)!rJ&sYstp`H+RHFfSIoV2;GKIOraU%NA-ra6et0f}}>hoD>+LzJ*8Sq~(6!=KPZ>)`>L=MwxuoeCf$va_nxM=W}TcF}H(&&|3 zEz&?ABw({#UjS@U7yhw`PY3X}i(28#9H0qT!!H8K)*_vACI{lV!u0r9V4l`yBJn`p z+G1(U=YRL?O*_>3Z-H?D)6olZ@&Fo*3fQ2l@#20zdg`9WADj=grOhK*kO@~T8VHnK zO_pQOCTKNPsuseE8RVVjPMkarxt zpdcI47(WjDi*Z%5S7|yC6bMKNct%iWQUCO1A|c)?V~~%Kse@h5nskf<_aWUADvBEVR6HZhdvg{cstxEt$m*#lJTK(BEJ6{9=iwUK(w(-75#Sp(* zg8OGJ8&&Ff$?_mR1jATyqf9N^1kIeBhebeyl&LZnDwR_=>0&&YtYW3+aehe!O!+P9j-;? zeVHz6Nta~%vw>JQE@@7Iu}1{>sL{x2l+4rn7qFgE25r{CZ-uMQ3V6C!Zl#dejzKE7 z2A6{u^ks|M|%TYG|LX4}G*Yno!Cr2%_( z5MG#6Yy*bR7|e>^jUfS#sg=Bbu$F6T=X-lZQYmheXq z1#nVoFXEsc-VlpvOzOFWXvDsR8gKIiQ6f6YVspscHI>YSoU8&bZ;F4Y)ILE<6Oc7^ zi@JyqL083W!;(Bp2#Cvz53cm0!N$6P!-Uey*%_CtKuxmQ=e#CWz78KD-J!5y zpMV!Z1WP8W4Q-(TQSN;?_^Ul%fJcA3_DF#$VSp}j#&*Ko5LvCjgUtZND6YJ%Od%lW z>m>NT$U+5oHY`SUjDF9^uxk{YtW|*w$`<5nIFgE2$*fXjp8P{yI41J5^ixG78f`bD zv}8JViCh!Jat$LbyN<>f!TZ<-@f=bibQSXUpeK@F3fUpR$^3ywY+_hC$c4{z<+XeU zr|+VqFoFu@tSb`rp{`N|95?g4^H$u;wMipNx@Gt;l30{e{YWIohVNA`eahdqQ;xbF zbcwuz?$16)d0!L_LPq~b1+;(B1t>zwjb4%3tPi*b!~3uk(jr+_d6y4}q5z}(q@1z7 z?B`xaDAUUSz%8bqYTy4yNHH@DE8G8yThp3a_FJ6DKP#%IT~z*=B+5%{_eoRnmmuTD ztN3tri5`Znr|c+reB8FrA8*yh$)>J4Zn!u6wAhyV!^ZV7wUICyooa2K0CcDKr+=57 z2FBeJqST9)t{%;i32If!M6Nv@wCcT(IPac#W=3-c&ZR9pi=8;Q#U8g*(S!LlnJvu4 z?~~|^DWV$eJm;62<|gblE}ueO`V{#HzU-Se+846T4C(ci3i5A;8w}I%*^S-ohaDIC z-;S>UBtN?3xOQ?bKub&Yncbadbpz=dZrPRR;#1Ae{Mf_N8;L49Wbv7MBq>*z5I%%? zF9YIpXPK3p9xK{aWyZwHry^5l=*GZPOSP_DDws?2MK;wPx6&2oMTB)6#j41jRVPz zv?8DH{n1q$y2CuYAK=c3O7TRlD!1CNuqrnx>sPs+L*gt8vo_J$2tPQ`-S4o2?I=)M z-Q*)+LgqCs;={5BlHf5=zPoC+s|MCr`dM=J>+Z_Sq2fo>n_Vo5V$1{^l&Y1m)It?d zQ?VJ>$UpIPVdS9qzYdS5n*5sr*iK9NFh6P`C7-xCbFHKJf#Mm}Q+^PD>>XDNQjs-! zQ6G}As?-4h_@s)#pQr>5gO^)7EC0OUzY>hdoW+5yklNIj$ygKk^5Ol7V-gNKa6T#l3oV9n}q2OsNoE^sAY}>nsb^yFKuObYHa9NQ>JRN7YKU*ni>IT79qwP35+*Ol^-t3lB@~_zYrh7Zq-%pi#J-a z>RKO^OeUx4*dTcA-_%_&1PiBOxT?fID=HYg7{ue`e}Q`1o|cJ#VD z6M6V)Jsp+XigjNj&z&%UHlz2xwwsus1_CJ`ItF(xniuv3&@Egv@!oT+=Ok%p>y+3? z_I6wO`iC-x0qBE2ExDpBDPa<(F z1ym1qv$eAklX5NRUug?sfNpLAjXuj7wx~-t!a!aBAx^)L@Lf};9DDkpwW*NwsOd_U z(?1y|Piz`4AaG4+g+}^&e4pBGTTEkVa2=Ep5P5V0y1%bNa;Lc5y_gvxZtL>frXK38vCoLu=(W$P&G9U0dH5%(mGg=T)?w z%P{-Jo46y2-0KP)9KrZUWAps-Sztg7_#TOhc%pH+y0n5YQ;az5=Ub_PVey^SlRhjg zbS{EpMaR5HL4&LSWAvQ0TGsss3#8F4gnbSFd@&k_O2 z%glT6eJ^E{<}X+5HJ&gfPXyzLN?iWb+81@1m5&fDaSq^T$buH#cR8ZrWYBNJehW}1 zK?A={-UKN;`c+oox9{*2cAA(oOC>mbv9QHC4R)lE$h@R;43bk|-(Fk2k5i)T;N(deA{p+_Y6owxytqI7z~0v-{is;rwB z10&=52E8wV{(=>WspHR|fzEv@h;^v`$ce%Qg^Q8OLi;?h*>N)6G3wl&cOnO;h)tKd zx#_q9D`6CjRJlMHWI{ZiG4$hseOPPW1?{dcN_gvml3w4+|18)kgx3ThH9F)jP7l9T zl*gbN+!Am-rbMU+jjxM22^ww4Nt4d_<22*-SbBQ)K06)KBE=H+Q7BNk2nW8mq!PpA z-{xpch)CLz#MeRd#>Gmo{(SM}&%*(W;scwGYYw&Z4i_CJQ4*33DUykO_xc~sGTe$d z+@8OW>YLqHAXZ=mJg-s`S5ieDEGqvMSf|6N{SWl|KQpTTZ}j?qYhU7Igkg|1`)%Q3 zNyx;-`M;x?ww*l=2l7{qL4PcOK-w`BH$epqd;`o1p$$Kf6xC4%6lhAWxbU_n2cU>~lbC6##+kOq}nHDro`h)(uQJ7F)SL zzAc}#*5A|T$0x(n9{|1Z{4;vfKWu*Ax$A@0-=+?KU2igi$mc?oo*Bv*x5Vocirveh z9rZfRW;Z`;viv$d+Z-Rzuj$)PJzBIpWBI<9e4dtIeqhF-Vahc0?d>){!~DLXA44Ro zw0%2zzV8eOHQ3PP?Kcbr4QGi41H%=zd8`x|q;4^@!lwLse zYEv&tZ_@1Phf;p8HCf~0r-L+xB(uODID&hofmwzO9sq92WxjwnVdm|bwF2564K-D;y9p9k!)@+@aIA?qN+)Wy?`Nfjb zre0`6zpcGvKiR71+0vo6=|-C0^k{#2yWCBmv#+dXA{-VQ&)qx?!+N$+tb^RJtRu}L ztUL$n+ndPGO=7gzS-c;zDs$;D-<7ix?*+@%d%Vz+*+MSfHh-?MQar}YIC_PTh=UdH z)r=twXE`X*Lck0Q+N9PbsSSmA+v&7-Y0-bSMP2C8r_R#b*4Cxktwd!VWy$mF()J!A zxEc;G)K|DCa9fKk{o)4r!8t&h)IdY_6`us6#*ifX@oZgfTLgI%*~fN4auvm7Kx;U$ zhY|544+?(*2*?kMnG8kX#>EQ_1SbxYV$-qq;9-*ZX)Nt|qOo)t@bOt&(-ua*i(J<163C_6?h5si@3V>j+~EfYS+-)y7x# z0ETgi0Ojv~@FUD`C_uEc%||86*Vbb96qds|qhBY);f0X$@n6G>5&0U4ou|Z~K`Ka4 zYKg_FZ#_LN30s^zZ{v+}E~PWzeJH~cdXkU&(u(8mnJkiLhn>aO4svvkaddvINof#-=AserbnBYKL6Z(7R%{?h z#0{A5@aZS;GJ44h_(M5Y5TPP3uah2^|Q|AJ0Yu3)3f@u z2?mGkAsWkrj8o-s_1zeT%*x(|8TerNv%r2aEX)vsId>_vFV z=%T^U*c$w!dF!?e`n%_w*cv-IJDM2S{GTT~LrW-TM#lfB)-bbi{@-HF{{T6(QIeG( zB0%YSQMbP&L$i=hv+2q>trWkqdFoT@7*;T+aB2GXEXbcG3k81QGu<`<0wVYC;}g8= zu}j<-g$lwY;iME?2yle14D7>M$+zeyM72ypWtGdo8(D*LfhxH20FZY^_-9F49+*{4 z!r>DeJ+EL2dce-NSsSe=pTq%0c{xm8sp3|k|4MFl0r5^TkPC$tPqc~ zx=d(`Qznwt;+19ci1x>tItO^BO1C>ar1Kz@n!4OM0*f?2vy@-QdY%UWloisjyP&UFkqnW*82vjK0X+eQS=u@ zZlU(}iy{Y%T(mcJJ5V`d0_nhx5$n|+RF9+Xd7s4XefvK9zP@VHstq>Xr0DMO)1Ykn z*QlR*QuVQQ?vt8!IbHX%6C8Oqz=YJW5L zw-WO`d|kbTTt^RAjy0U^eocHxZ>yj(thGW%IDM-GaE>iJasYB%q(ZWNs{$IwxT0wr zHv0#0(zqIgmko!!1?sdJVf)xtIraM3}OmkpYH|sj(8xnkGL@kRNBU~ zJ;;*l<@CBl))sl9qQtt|SE4!g3V4EbLJO?V8Jtxa8Ax{}k~faROaPnoA3rGAnI(# zvjrI0x;-cWAx?*776;B|2pYEh>E8qZ#BNMAmybhY_SWj z==+2T){(u2XMA3%@+hW{4^@7)v(e*Xe1NGZBgtG&!Id|z!|b8`2?qSSt=9gJtQtKg zM=oHdqYwbMS|K3HrmJmS;pYA0)s_>>6XJ<^vvW%bN{SOeGSl>XER?&$h)sMocpKxZ zEm!%nut`QdU_NM189|)HTdBk9sRvF_6T}in6+9ABsZh=kI}LGKpvx>qd~7u>Ree4* zp?aZ8RI`$3n%;LyLObA$K<*Xf4x6j@?a>c{w|_>dUWk6 zfk3H)bpbP2L>|8e23aRTC722V&Bq9Hc&_@t#A{c8rJ97YoNth%`!x-03I%QkS3uwg zM4h;-=b#TJfiB7ViOr{i?z|7aV(pP=?k6u90{ki4Zy*lra{U@>$Ks3&hZuxv@Yyod04;@GsSXooPcWHZ$ zE|1w@vtkwGJoxxS+^smhqy+)Lj4-As&NJP4DZh;;KSJ`Oah)t!Up-m;#&KlE=FAow zsj7X5W&X|fQ?vQH>6hJ3OLLS|fgw$?sZxdhuiu+^&KNo_1*kcx418DG&$p?Sr;~3b z{mhA0f|C3YN;`k})5!_~z7V+$13l4{o+D4Uv#sc*rECJ|PK#I>1frjGuPuwEh=D2s z^A2_Gdy~wxdLkVnDLG&ZpadN-jCSH#r^EWopkVN56=2Yi5ga zeriJ5T)Tv}iCk~R3WH>e^EE2xsRKF}5bNljHElX$$p|0>v$Pl~sEd0CzImVv)0SAp z;c5Y~;~}W3ejz7*s?&Z`89laYnzThM)H7Qk1&H3dbTvs!{mEplO(;3*&(HNjiOg?ail*@$|9JFtz)wWG1a2R z1{yQ@3XB{Zb!YxVT`49JL8nC$PINXwaJFzGEH_>AM8CMEYL zRzNEd4i0!$mLssu?%U)NjF7WGVo@Fwp&VxMC*1C92g+7FB?%Z?U;*Au7PRZ{jd<5o zG6YlOz({{Ywvkx&>*@Vi!R^Va8@i-2S{;v`bVE#txXN*OkMWIVxi zv=M${RJeH6{Ha@!g=^mYzun|<&-qqyx6@7@qG3zW(T?p7pcJRDWD_Yh#KAve)JEF z7X7G?%8Cw0^`B0h^Hv9iXOP#_m>^1ZpH6J>I3r~jf1tTnk1a2A@XuPEwyF;6?fqtr z<{a(qww$nDY`0GG;x(mlNNS#xpc1CInV>b{zt~@MNMJjVj>@pAZFO0Vm~;Xlj+@qc zaJpZZqmMYwrxT^UR-L>aO)7sIbh45va59*qBk>p~3>)eud@rlB^+)$Yj#^T3wVT5R zv{Y-`d`)oR4tCY>yCk;c)USZD4D8IeET0ryRTyDpO32&&+7(Q+qg1~XkS?u{r zuA&qL2Ss>7RQ>kzw4AhS$VI2yf2H@OAWz5uXxN_nEIsP`raJhepg1gCZ@H66SD?i` z)w^7T)#|2Hd8)(9+ZqIM3>?~8FE8iMR%l~kP@_U0G5}f*P?$lKOUyU{5C>+4(;{+- zCZnyvoD!GaGk=z&z=Lv>obBtIc_h$(KblgO=&&pi!!0^{>15mH?J_~EVqnI9oeMgH z2-%B}4~QVa@5z7@)XRgh?2`Hd-ktq64 zcB4Fpn&YdeRWu7{aVm0|Qp!dla)q@~rVVplW9!G&tc##CI}N%4T-hj7O#prvhQ!T} z6gLv0Ymh;hX;~4IstB6Y1Th1cAvTPFwg3QNoMo_?thBTYVlC{ZQ)!@z}o_s zSx0H>_l98JAKE3_hbk1obNX2PurGk5Znq!V-yf;`0^CM%oQlm2Dl1}} z>i`9cD9-3@a+0nD{|Y@sCD?3Qrv{I!OLBTW2%*muY^$)X zPiF8YLv7M8(B6mYr!0Y@lv>!Y5Bzn5sX zW@gz`CzJG!oJYEY4*@)J^5E8UYqqNH_=L9=rFWUNiOoMbAW*M z4sJKI^f;0ZAOSEmo1+p5*iqa}S%PbkNHjo9=>YC~3Pvf2Vu%OgAVbZ+6$~_cU1JSn z*Hi;8Lybyvy~=Efdc(eqi(P?k-vD&R^S`XM4d-M1zGs9et*ng`KX0v^zt7z592AjrB0^X7ChkAW5Xg>7^ZZLHRcx3 znJz`S{4xyCUA9HI@Xb1-^*Iy?G|rbKi?cm)?R$2tuTG~_g=EqbC7jP9y;Q&GGW4bE z$=er{pu&r{FMjM_Oer&Fkx8jdApz*ZKmbP50W{{|T5m>m*Sd$@S(MA*;eM|}@l%(jO=C%)%S4o*+Ym3a8&^o1?RkUJ4)>*b zX3By`6JCL!ZB?0oY=1n}24Xsn?SZHQ){@=>2|g&latDt#1rRAzX0d}@VSuHwAsHD*sQE>Cb}U9-8{eAzJof$#5e7EiEu)c{Z=~P9;0<^fc&o# zG@X|UEZNW$=+;Mm3@+T@bz5Xyqt9K3xR34(IO5=(0PHp5WSJPIdU1FWtwB?X@u60b zf|q)>@vVV@N5aQqbbe%~am*tbP8<_hSHqo!l2i`7>c2e6`YBAIRGVfXZQEje0LnZ^ z2sDk(9_&W<g&nL-jy@v-WnEDplNSu2a-n}LkP+< z|HfRyGvV^c0YbsPg!O9u7mj)5))@LSsXe6+8$*k)n1~96UQDj0m+1|lC~l}A$KINe zqd6AI)zA@{ana>)kDHCUj<7YapHhV^S-)K50h5eP3C5-j`O}uQX0!bC;I}N4nsAGiI-N!ozdf?`9C?+_3yT!( z(4Xc$ExhiR?V!ZbFiwS=d*egmQrbc!NwVaMwH5KF(XX8|p+(2>(XziaulvsAH7#*f z!5ye(*4?C44Ij1L;p>xoU7Djb1vAi5+a8E}4~Ae&V}V`QchxNy{>|YoxGPRn-)<(d zPc9ODZ?2{L*QLeoA(^xEID2N9DtD||l5lNBLP44>X|87JjI6Mp7)%N)*icQ1dx!%K zr5xfvo?Tze_Qpj(K)76~)@P*Em!J}BdSPiJO9_wJrD&%Itb`e?HG*wxF^AXhER0}k z2ni|~tqOfXS=&<9u2#DDn4*lxB1f@2XZ*txGDIl^dvlk-p2nE8Xrn4XvoQ3p_!pue zL))*H+9E!c~C$7qaXWWc*3(%+TXKb!RA*h6`a@I$ISox5Q8tdplZ)X@^H z(dH4x;y|D4ssJW9G_0qZ@j%MfRSrNuKNgLO+a3Bz60wMgEF!g~A!PB}z+fB=m)HvChI7-?>Qr4j^L?MY<54L-)D3|L^VD z$lqit;RQ(*{wYUd!E~2O_}&=5^3p@#-;wqj+w}cYHAJfN%E};R!CFiSDxdKImIOXbN2K z_m77y7uB|_>TYK|x*^ysC-wfS*>#c4wP0B;YDKNhTKAWPv{<)ndVB!%XmL?%y7iPs z>P;1>mUBCqIKaB)ahk0)TzGDaEpN;KAt;L(`>BA{Rq^0LFex})a)zRHWXUvTYq&U< zn+I}m+S0kvc*@`wQsW*i%is1JmM{<^&|2*bHW2cGjAegMQ+O-Z%+*w^v18WJ*VHPj z<4Wi}be^4!q#2;oYa&MH<2)%Q1t`uzsm3>q&md!DqEx^9S6N`z)&?5{2*e z!g4}Op@cx(m92AEb!;nX4Ui^JeEu^?L**!=ARpu5+E0k=7qF$*3jN;mectn>l&wi( zlwb`0_wSfokYoJ-@p|izM6baN zFWa;3)J9Y2!iz)-bJ#-8#ub?RI?SZPwc#nm&KCr8HCC=ce}tkK0^G@L{ccJ-iTn(v z!P728Cpo{0qe$Rt8*xuOED-G352EWV#6|pgE}|Nv?g8dP*2`u;X`%MUhHUJ2i`f43 zJrZJupvr-LTcUTlDq$>T6CMIhO5etv+7M0M(wJJ*Q>`iLXQFNOeb)N(bHtu16SMhXUairqLBcih^P|rhXJkT+Ws^hiPkHAJ55~?(zO)pE=g!-$fAxMo!nkC zQ`xApbjX>X-a=k0>JLdbf2eaAq>4+~GW1A<$Rn`_ilvXE4i99wh{n%O-srEy$48SD zrOfQ2KD?bWp+?NsJQcrQzm7{io-5mR>F?j)Iv=c4Y`ULOD0j6hf#ec z8CPs;o}Ck}(^0Ap8E8?%%kqozF%ARSmB(u9e^9b67_g>WqK(?=WX~~rXz8jLKF@u^ z5I1y>mf$gH+d7XtaO;nbTpDzSh(~Y?bkurIj$Tx*PyTG{Zr0AaO&aQM(O#5AeIl25 z>(Z@YqdujcUIWNb7MAo2909boL|mt93`ASPxDSO91MQW=@;OjZV-Iq%1#+yc&xIrZ z3d!C-USCRC^$&K8ps0|fV?tV$IlL&^c$cE>EgJlyITX8vtkXI*%5e%lB;H)Mb4z7h zLZJsnSPVLhXo-}ee!IwsiyQ@6dIFdyxV@b37d{W;kVEY(2J}fF+?W#ZLi3;Bp2kOK zSu}S^^JPI^ee^Q_kZY8yqVcPbcP8yr79)ssJPpHmM=OOG28Y>W753C) zaUR-gEj)nsI|0JF6J|j|Io-Emxh`Z$OpRNRU}h~=+#Onwa5kDL%%)=&8!PR>9voc- znc?;bmakCARInVF(nN+vCJ^K9QeHhHY;X=SUq+fFON8kEFb86J2}PPSFBOH0B|@Nkti1sx)_mIef>vJkfba*Mj2i9F9->}L$pJ4)3|kC+e1Gd zcTua1iA}YTI$>iFO|XSn3u~}zh6D|=hD>7{kiYo z+C04__{c2pt*-T>tWImxt2>IZtBx~tp-{!e>tqXeeo-bKmCyu{c57_ex)_?emIVCP ze`4S2YPwi9Dtub>m2BzMf+z&MD1tHiOs&*h(PvV{DxBP2PKuhWgi)%P&`+aU7`<_% z+>sv5#uV7BuR4b(3du`6GMLUkk5trE{%h0{T{NUd*47ctG}^P8$wqQ5S#zOc62DLo zjgV5XF&kJ$l@wuMD&b}eWIg`bP<)zIhA^68qTW3{7-`GIhq} zTn4)ZVJ`&9KIE6FR9ItVX~a9@c=U$hoP7DI74wR@BZ3#CbG)3Ion|CE!(SJ;oI@RA z5SxQQS;BU_NAurG)D%|~39SsmF8I7e<9XR76&UTe!Orsw5g6Q6%95dj+r6skf>?;_ zY&=(yZk=Q9!n(~o?>;8ume>dc&^?N#t%FYdnbzTRS9Rc<(b~;EpNOJcf}2S~t_^vc zNF*o-hF~v`?x7QxZceZ85^ZUaOd|PjwRhh_88)+0gg4nXhP#GrW8Pgj`q`S4WpLEY zek&3$@rcxGyR)YCB$Hbb;&U2nFH*smBh{cw=>R-KT&_IZm5=EY|AR2z&$}>Q`9+GS z@AAf_k3c5=<{tErI+Ki#V>w$nRn~+ZJ6P&-P81< zz5ci(Kcw1+7gvri_W3ig!Smq&_a~L#3JxLw2IpQu=Gx(|bKn~x zK6~F9F1^SY(H{>E<@m^vMcaDnQ>3^>!w(W**3;?UW-D!YeG zsO{pBZANdhvSW7dlWc#VA;avC0c2e$;uUfK^~I0;s9zmE{-BN)#U=iH3?EY$yq*o0 zQojrwP}M-Lv{rMu>>($DQK|9V8)($tRIU_`hOJmjgS9JVW)}OaJie@_gc9*@86;cVT;;pdsVt}RXu4H ze${Hp(mmi?8B~6?y%E3bfd7Sb);jsv+a^2twX{d3!U|?%DIGhP7^QzA5)?=2_m>odIKdGF@>MZo$nY=V?=jD)lJ`=NV?VYoTK?NM>fiX3sRQf|3kI*wg7%k_sv| zV3w4uHp~x7GjOQ*3r@1vOq2SM!jY0MFL@^$LK(4;PL`T-P+0N&Rm`_;OG!Zv^(-xO zY9nM~i2N#&)dg4QgPpruLI>rw<4M_@;}^wWQ&}2u?|=s)Af`G)QQ*nNan8Bsik4VR zGfcv)$*L)t6f~x(oKhSdp_rK8mkdKN4$YCUxLA0a2rVU5GH)Ih98aov*0rBT8l+6? zd%CQT(~Nr%_0zsI=b8a5@aQN<0|rd@f)<>bh*^I-64EBy=_=dp1ED9pZ} z|L#^C#iWFaD>`8CB#sZq9;muHZU98xn9mi8OpB#4Gb;%Q0Y1psvODIG*WRBvA zF^X0Sl{w?aHg$9LGH_Q7@_MRc3CFohHZZm%A$3juZSknchgEYQ+% zakQEo@sUj46ZED`dAcY{!)A6qjY#>j`>!Sw!HwNr!QfzY9J|4-@G;G1;L4&?pFA88 z(>hL`aM?+I(ia}nbCNzwidkSVqA6ONzIm(zsB=-#F!EwAD9&|1coxrXP!UGl+Bfnd zs-JMVp}@=n%a6wno9u_h=X4QX7fF5Jr6H_)SKtIl71|8?O(;QYg{wp9D3ts1hU!V> zHZzoOo}7EYp&Q>`4B83uH-g#8gKo}@o4<`coKgf)qUbg*bp#^d%f>i?QMaQKV<_mq zJ$-r1X&S_mb`XJY@4jTb@lQ|j1dM>dX(!@%Y5Mq`lGW|H-oHOLi zHAr6(l&0B5(9RTnPH@;%=-*I9CaKGKUY*uF32abH3?OwPAGWXeR_o%s)FP zl)||sbOP*riekoZ*_e#faCikerpr?M$H2*LT!+J=v3p23Gu85L6Dpy`+cx;RE1l@f zGc{&Npg9}O{z#B7eRdiGuMTld=NM+pcbY<$R=&SyTzCw#dejYpXV!BO$ft80U0#cF z39S6Z>W_HkmjvZVD8q6d@enlE1U=~rtMPdJ4knVAmO(7{{oVv=p>Y6u1%k^?zE;{% zK&WW&@Mr_DLcP>;KZvTa3k^|{JGUt+@ges>RhaPU;%}X5M;$f>OCK0=9H#>4#+7Fp z`t}W}!C*-r6mp)dab}>29b7>!g~5}q*W?q?ELGYg3^3I%y)Yx72n>5r*FNjTbI~4t zD0U+x;F=MtF3XXu{xdj6ou}Az75Lg9)35oMv|!a*BQyIMq+OKxaLH$r22WJ1oaUV< z{{u~hDsKgRJvjTQ^pO4WHJiYfdP=nqk+{nrCsW2(Tsx1{DJ0(3LU3gOTPlt>jUdJy z0e8&I&Mvae9SHnlq*bnjoxfe6L3^$U&VfEDhpb1CW@T80%=$8w297t7m4YS$J|#>g zuPLCIL!~46$N&>;Sf@8`J{y-|8o}LlYFE0r?>0TJ+j}v(-8DjGGlQ(8JVw;By@s5l z(wrMPX%lv#MT4&oDpzmw&R>g^TCY~urzsyY#ULsfsxiVJ7_WXr89q>t-%Rt5N9tq?}|+jK1Tg!t^xH%I{xV7e;lH zN)?0*0YNguF|33djc54n^uF+O!gSOBD*&+mhZ>rRg`MMn4FJGUm%X{@gsDAGKQ%Vo?<78G0l#WIV?nGu&j z##TLUHlzJhg(?=mf(w0GjMM2mO2;ZEeKJ^g-U6yNSsPWg(>`WiwoNWPL6vpwlH5F+ zXe+DFHv!_EXvW6_g@{K~8;gM)j#Iy=2hhc#qH^i;an^7WBiVDun8grg&CbryBLQFkgNWK2uym^o=b$uAQofOnh`~#QYIJ|%mBf84QG0? z=-`n}AvaHab}}C###NM?ek>Ami(EvM6?tuXaB0NbVz5Kv3?E$^8ET!)!ZtU((VwdM{cB-p+&Ltl#$ zhzwo+ARHj#pr6W=alB*zuMMq}{nH}qb|ZFy!3;%QsWLkmMv*I@{`3(DTDhjAo1}Ur zx@G+khDcw9H3fj|f|Wd?)fH#9U00(@Xb01_#2L$0p5Ar98o0KtP1#;4f&e)~=q z$;o|}L>HB{8CIfdtqaEiuV7g{oc>ibd9ixW9B(8dpXR34E7QQbilHVklIKU|Vw1Tq@&hR0Hb@Nkz@CQ-QCba;^HzmNV? z0hKg{*x{~c?PlVOzQze6CYA7v_oxR?wELXBH{4OH1&~?DL|_EgvCa<*tKOL$vg0n@qWw)BFk2_(?`+wY2#9w%M0l0G-DK+;`)2@f&iGh%8$jcjHn27^s%>}H77;>2vt_3D zqLVSXbW*l~6_YlYJ$4-t{;i>kB?UGv}sCh4KGcD${}DJkWH2P_sv$!fez zY>@cffI@a{!Q1S+yO8|cO=f4HaWNT`KE2{Wwhd(4aUfLAPr2&6etGio@fQAv*x~q`UG}2o}vuaH7YrZW|uLfGwkE zQWFJkNy7vlZ87#d!ZnuGH)RLpWHdU&g1Vz{>0XP&=n+{kjEj-TEO?|GEZEbi$U|?N zAxt*Vn$H&@!{)C@>5YhhMW>d5hHaE`wmxy_d|bJ$o>l$VtvdiIxOfvsQ+5{jA+T=N3|_0Ue1Kl1YNzoD3bxFF=`Kj#Dh z^pzc29VBbXIGR|cGOE6uI8U$XQ<;hLzMU=>^%ZT4*KZPn7vRbkB<w=zAF7>`%eg|2p`nV=EV(Ox z0*T$Y80Yc__;Lm?^D6A&?r^37d}Y!EY+>l>GCi>=lPLq*<$hdCV9J9-m?U=E5lTl^ z57AqAFaIq{%-kBr(IYxoaBNtzQh!cUI~K8KQS^BOaynM4NM!3gW@gXG`20;<>!G>P zZTjI3s@WcpQ}gYzCzWBa0qWsuvr%p}Utd-0XJ9ai!weOxKoF-9CZ=67N-da6zd162 zBSWP9>&T$YRM!q>QXckHG^oy-Bxx@~sw7HT8jgUeP%NMSy3SMVRsMZ90=qqIm&9<~ z@7OCs<>*gEavd9|emGRb^YJsinoaJQIP~mnXp8TW$@gb~yE&+0gq6D`SR9{TUbz%6 zl1P7iH81whe0Q+I;6LhizK><9IxLyf+tqyNN&26eBo|j}qx=qy0S3E>i8wi% z>yp|MsxnAcNLx%Ee$N}X=zM^1V9!R$@Ds{J0R%Jc*$0uqDDf6{%@f~{60cUsdKGLT zsy{H)Cs+e&%A3YMTRI=>FACiAQEVIU%PKZ=S1mx(RUfz%*5C!3JHdv^CDmE7iWwWS zQMPA=)4YUE>K=igS9++jKHb~wTbC1SxahHn450)duWC@>5j{9@kh#d%wSq?1C^&Ga zqR)N=`B-|Lhb*rM%|Cvd51ZcqmH&QAJ^%lp?f)C3WoBajpGPjPur!@E+TXT%h3qD$ zL^L)54qQt+ZQ7b7<1AKk&ZbQ9DWF?5rGG?p`ui_1^zpc5C^~a3t(5f z?(T3N-EF|li#qzwH^HmWZ~W8N*`gs4<5YwGKM7Dzrv{zhOntc9qs5qW7V5{s?dYl7 zCbGKcPWPj7^KE%VrLB{D$2Sg?E`(~mT`{4t(=14lRkU0JaBvvuQAY~bY5Y8wzf7$F+Yh9kz9~{upst0PW zV1CYQVW+Q`=RWP#FMBM$Qn8&DXm9KRn0esH+De3o3r{`JOU?eQ7WzuIi2dDX1m!_< z?hC}LCxD#s)l=_mT*u}&(oI{cvAe#WSeD-zjE=eSu6*fnQ0Kwo@31`gQhxgrSBU~d zf~4dE;f`K9HlK{cSkVc2!#Kj5IO1f^PdW^bHEs}Cq`y%RLU?s+HBa;jBF@?*=RZl2 z=rNmjLwQV@cofcXCRs|9Zk%as@b9RKG=a*?i2t9T%FEx!9Q+TT(1mgVjEB>9z?ean zSVy5GbDY`vK$%;298-Y+iQTLM9b-1!EHmNWzG7Kn_ej+WsGvz$f!MH|J!4fYF8o9yHqc$ko+| zVaVXul9C|(;rC7&GI>IDUxqZLMrhJR3iu{)ArvWFpgB~E`O@lfCf#=I^51rQ{QZWM z*)2!U21b1E*C~JLo@?&>WE^}>v~w&&k985BYtAjtM0JlPDtXA1Ol+fc&rs0tG(|Tv z7|l6sn`2yipJ2`8z9iP7)my*iF?;kmyJPoebm%2x8OpKjYIER@WQ^HArbk-!b)U?! zyr?(2Y4Px~M_T-_9xi&UWi<8(8lkft&bh39bVC|Oc=~{puLR=$1`z#$1!o_As;#cN zz6B9x#So}|GG8t{L%*+zk34LkRp=#pv}fJpgBb}kA8&sgpN(fQ`FcR zEHBEqIQ0z9r5oG4`cYS>t|#*@X+$O7ZA-g*d}qcR=H zDs{~^S^Mg!UDs7kPI0&lYZ^6dVz0rM`xowyKE{Ac9UXieVQ$>w2Q>@wNOFX%B-_R* zM|IV1606}@FY>Ycfok7PVBwAcve8*#mjmbTD{I2bSEEgT z3v!tApyB+jr2VWPxPH(!Z2Dk~%K~Yw{C15*(z2H6qIo$m6m&fDCm!~Cs;s!cppxA9 z7Cpe;D2#HYd*vxEcp^;#8S=5U^1WQXpKq{CqP=!eL7#$tM&$aLx z*sCpw%AiDQb3Un zhEic>*-WVlkj;dA9*70yb$nMbb2wy-@6q!7@m(o+M4WsgK)!MjI3ZRbD}VlDwg8k6 zXb6F^)rRiZgQej*bTmL*0hwTMLIYq{lSqMZVL6$B8EX7h!k$T{M#`>NS zn!@9(tVhv+}jJ_=n z2{IwZ0e{WX1pU!)5e!34Ke6I@k1aU_KWSIjcy3kTpu_Vvq$!d1wGS^nDE4 z_nICw#*r)rlF=FdFPtNbgF0c5oOU8kMMl8}f7>^)WLg#nnyKCJf)M_Fp$X zomS-1*}&KXiiM0yLL;_?Znm7InpOv#Cny^T!_O$+592H?cDSwxg1r#yoqO_<55r-} z5zwLr!q`q7_K549-`>aoP=M~|9M{$$e5tQk)~#S%k|VMfy#8h33s0!T+PGsF%c zm}VAm*^IADd&$5Ja1v!0I80fZsvIBvVgzVqCTUp!$Ns|P4hEgnl~zVM9Ar)RWGOoh z$MW*0JkxmcG`x~p?>Z$uxss_a$)7`#H%T!*@&MSYdv;4UGiD9wY^4Sphb0J4KLRT=BDr!<9kF%3^(_sZGOx(Q9c(X+$l^ zV>b%`FlBH40Xr3C-V6u9z2@uRy;M7N-c52s#dC7d6Fo#|eJLEE&@$OmX%SC25rjIW zqYW5LLomRX9+yxYKRL?tN7$T4MJU3J&XIeL!UW%x7SD|1ose`!7V-d1y_7k7Va(Zk zVKXfa^Fo>#b6Ww(jTo(UwETawo3{$JKE#aHzf8@XJhvwc?6uh_xjV8=^Q7g+Vx1FK zWdy@YfL0|76)Pl=amVcaFKC8j0)zgofsBURSO*GQr0x34PZTO}(n*pbW2+HvMA9xH z@LVKSYUib_gnOIhtq}Ng<;0-`P=g8}&LAQ_qp8Js!1Ug93Cbmcq$>;-R*)_fEwhQ^+>|2guSg%TQ zIZ~#~37er91zbNfXnPjt5mL?Wl0o(r`J+&_bJc?t9W*{Cv-WT+pyeZ4O&ME|=Z^?t z6(p#XIT6v_6=gr_3yE{3SlU>5Yz&B7J=e`ft*YhS*$js3CA_o@0>bXapO0FmG#Yxw^dd#5JBq6ApCY}>YN z+qP}9%eHOXw%ujhw(Z+<<2;;*GY|70cC4K%*O!@$>smQD$vngx7uc`Q2^H56w>lEZ zV{$3s-kvylCiBaT+u4WZ8+O;RygwBzSx1Y|a5NLMRS&!5#@<5D#Z$AAx!*M#BqzMl?pyOQS1wl!3O8e%zR@6J<@90CQobwykbss%XsYoqx0rDH;F#TLs*C;qhvO z%$6fI7P0xz@^=EW*9a-ut=aHwa$nXHYHAyC?V-|T#rXLq#oBq*E z={lDGF2Xo_Z>Y;0%B$*C`O&$nH#WMP8VdoM0z*LJP{{}NV)M#MKG6}QXSj;(iI1WB zuu&P6A7SXdKw;~Ye5gP=9DG7lhmfmr_ei<_@rRm=P7=y3(YJLpo<2Q~| z?~5^P+V`YPV(3ddwthKX5RUg4ft=@9!C9Vjt)UDjVc+Z~W+^=tJeca?O`k#9Nlx&& z8Q>70cE-z-6}+iEn&+y5j2z=G4?69HFvonFBMJ?$>l-|X*8jhjI)p8F=LWoEWVF2LJ@=)hK3rqlp z!*`UTE2&C1h+qNJdwxE)$~(C36WYYTyXWwI^Kz1f4>HT5B+_v8LTAi`tU@>_`=5*! z-Gk@jN!h0R?iWFsQn2JO>}+Zms99RI!zF#N752BW~!kqAEXAmZ`Mzhc?@6MJ7&M!s}u zr36SAbb|!ZsxU*GLY| z17I9Cs-k3dgWNLa(vcX@`I1Nwpp-ZQ2GL29P>P5bJCEM8}+JcVAFF)BM)qI$n8J7uAs3~c}kFTf+NShcFpk5vc3&hqzYLdlkC zQa2j>tJ3RcSctDqmE zDCG=Wf>W#)pq#iHrHnL7=^Cm0@R*&bH$chCK?N+U92AU2aqRooF;;m^Fl%*NcaaYb z+wagB&cj_5b^HMlZA2{fp3pFPv;vHL&|Jqd0eIRU6#De_c9#Y<_m6Tjo)z^FBZ$po zeXRFh5356<`R^fKyC6Yv)#>nS+USWx9VT<~K-ZBQbtSRe8=)mv^ciJClQkfPS!XK8 ze1B_|bu&xtD+(8CfmdE^{Yt&D3#A=+oxg3+wbaMMgp-_03#ofp22qGiGLtbAmfKfm z@r3Veu~hA3S;jPT7Lvz%+IqAmMdG?ARogq6F9kH@2yX(B3PnTQ{V1J zLulpFu5$?O7hUhwM&YGSYD=57pVwJ>KW+K=cUDV}rp?4wO5@#;v)*+92XCk>Y3>RJ z{Xz2qO<7AzOG8Z**9n~$byK@i~pK1EE`Wu+zFo+?xl51Xx_xMzbMp1bP( z$nH&>$F;bc`itW_A$JEruF@O%-Et}2Meh`~-=UrUKbU2zR{>ou@5NVHeb%=bYL}{d zMIfZ8zZ0Wo-~eU^WN8d)Pc)&f%@-uk;sP#QQM0S9Mf2)`&950Y1cmwlNs_np@w7R{ z+O?s^4Fzyliw8(esd=^@`MC#NSw(k0AvLGZcf-90zviJ<=acZR-4{B4+upW@8D7YG zR|rTzNQiXuFh?8I%!1weUplpE-A^P$bO*{+P8|^2*NnQ zJ0$00*r`d~l9Gfr4#XP*=k3SC0bz=WP`t~jWHwDsv13p(tex0c?WiV?tunRR}h zh1*{Xei+s<9r5g|K7cn7s5TF*LVN~l;;;@1SqDy|Dtv$VYE79WA8$5E&O0y(zZdTi zBc~giM5gfIld1J14s=5UY%9G2nKaAbKal3W5)?oZ(WZA;f6oLFE6#xBuB?`VMi-_+ z0u%v^HH9)rqcgxHCB;@l_B~cv5fC8z60h?1u@Np(ax+zTz$lc_L-Kr#>z2U9KE3?6 zPWOstG*=CXRZ`^_<;%`)#YPT~@rs~QyhdEdqYn{s15XxiE z97;`?C5hmyNZ=UB<{Wu?MypTSwb5=6{g8(-(zuE8|2PM9-C$9qc9HNRFRrYl6+1(6 z`nu<1JgES`+(JerNFX1_4jrE_d*JKI6?cAnR;N7h1=v8!2ut70WHy+cZg{6>I9orl z;gUzK_h}oHmdWa8Mz^lO9{S!y7%Pq(7|(Mp&j&7u>&!0zffw|?PpF1ZnsP~5d_PaC zZ&orHEPX8emXaj1hQ#2K;||(*NaZ9MpcwKQ`jU))!Et_2^otzD1&sy}J5ju-&T$;_ zc!D}@(;L*9$^JK2o8!Nw@EI8XXR6^J)@Z-||5FWfhl~ad-TFBB0&UlHY@+CEFU#CtmemQ%<*ZeEwyI;z4 zGXIS2$(1zBq>OwhM7zdkHm{bCn%a-WY{brwo~%GZu8M>Xp?)tgOi==Xx1c1DQy4`m?vgGX zGc1wBH7*4w@-PnTks?mcEJ+hNFf=63X!2-PU41`8>^mD@b559|SJk_iraJm+*;acu zQ@O2ee&^T=T-n0pI9A6i^;FV**RR~BecW^FTf{^vXv#nkE4l-3kv>uURlvd`Fx2MF zih>AniW6+uF6ARN2dO}&jMfa=WEV+UfDJWdU&_+?Nl<|2sFPG|=%R=tr-kVE5i+Gi ziyO6rXsz6mL0y8oh0*5pXMngWRu=#~3sNP@NfAzsG#aWdlGRWkzmuKkWEyMGoLc@pS=MR95qe7e`4J|LUBqf4J zDeAl9MyW!?B2n1$uwxR8ZVMWu!hu?vWj5Ur`53oIAux4l*g0hj!|_o0#)-V8c-eUr zNC3^itHMftB+inIN&4+L=fkV=KeB?QU>up+P`H&!Ku;n}4CIHN!5!;zy=m-`3IVd~ zKZy@jRPBP=rX{BW8XN7pya_cStv! zMh=%Z+egN^C@>dHB%F9(i}!BRksKemj&w$Jm2D4EYAfsP+(osY z;SIax39*^))So0wE{)@BkbTK!0>$}*l3KAULLPr^Q)tmxp&7u7qi$}fgDoA>c6D8* zZ(89+BhyAoJIW(B_`eNeI_oY9;YMK7j)X4dfw}U^ZwN~}!B5RvXg4ovpM2Vq@v|w1 zK;0%pn8}W>7kw~7{t9i@zQT{VVRQYP9I|!Y^zcxYB{??4EGBT_`C)Uc2U8?Y95DX3 zjMyB>i^l6j#-YUM7RCic(b2d4ygXg&R1$3X_%br!1Oo_7%|`V?Hy!Z?Bi%v3vlL{e z#w(rTiGt+BGBL>_Q5J3`98OXdGlYKTjhK2?oAt?XR7(k?8*F=>`Pm4oZ7T@vt~~q2 zOD;xeI?1eAV?&XfJZM)ja*;hAf7=R^wmUZe^v;8C2E? z#ydf<=`}40q=&lb8o1wON#)LENq%k}M4J$|iLJmP4 zo$$7BA0C70PbaLDII9DNVi)7xx|F>-y;e7iynW-y8OL?yYtHt_u8^Z8SOv z_5p#-6Y<*=B;}V38%w8{omW=Q0?6mTF0LjI=ji<{N{~c{c*aq{aHYI!0U3c9VfW-Q ztc{}&C^TELJabZ)NmO%HLL3f%l!#qy+?&)h0l8-U?6cU(#6K!c>=iJ zP%4;ki*zyAP~X7yqWmBpis z6k9MHmeaYni(sZTF$LvMFG;?OXrYE(ijBM`NqN!+kgk~qqCiwm_nX^5$wbbr?dnh zw>mfKJp2-yE_Uh(uLQ5wiWseu^Q~Ql3=%&Su$R~~@jNnJg5N;UA6(W*kRWD!)gP2| z2xxVo$=*7E%ETQHg~tTV?Wpv;a_2OWp_8^I4eU>{T%bdEJv|Q57I=}Ww1gr4*JfwM zW8XxpBq~1)=x>d&(y#IYwlP!Z`a1DI}*$ z@0(BSk>O9hLE2(1cx2)V1*tc4qSFTmDmzi%j^|iU%|DS)DA~M+L>~uZ&*Qsr_J<(< zRVn+->8V~@8I4$Q4d5Vn)eqd+WG$g9qQ zGdWSWTX}ObpS@yX!aV?_34xF`ZHDja{jBO};ix=!(8Y{Z_uI?y`H_+sLK=#xsH1}} zg#Mp=AvIlXWLs0z^t%odYggrjsm1p4HErurbx)0ZK^^7hW+mkHh*^v7N>pP_ZD;Ir zt?h*8wl64d;;gUbr0XA*p*btnnoSP)DWo#HiRT;7#cHA7laGHDy6p9~Z^V&IWszX= z3|l{6+n8I^nB-IA_0RZ~T~0nN9h*IMv!`2gn#%_%(-Wi-i=dP!_TPv46@_Iqk8Y!s zu1T18wqi4=dlt8+Jms zcG|QTm!IvOvbVtgSGTH3Y*W|hAsPu|K+A(z@-k-DNiCD zDidun*|0<-N~_bciE`kI{+KCBf*6C^Z1wNiDW-Cg(p5&iTew%$xTyb$i3=GjCrBM~ z-=l8L-NC zuE!z|Qh!$;Ow`}c$=J5Jc$WR+ux+E}D3P^@Sr$rx@R^iMCa;wF4kQ)i(O)pv`O(c<3FU|n@xt6hFejXf;4|7O#+YsYTDiix9;sBpuD-aFgn zfPoB$-ZPOWNZ9^18D=$ampKP^W(U|lF9)}Lh|(X)J5TncZ;w1v9NVq`ngAiVlGmbh zLrrgIrdYRwtB4X~uK=G4%Z2{(B3R+q6U!tF|F|+_V7?+#ecI>?&Q!y%0*G2?NDQne zMAI$m(AH$GNMWoas8LWjc9X}vcLRamv+|q3_^;Z>v@*<3L5Ti4;Thpnggw;EOtIMS zi|4oZ+!%rThtEdvxEgsI!zPKkkZbd4fipXLD8aM9dkO+{&kE(912yAWfKF<|Ai&Vz z*)b~#f9>6&mH6Ru?C$G*z^IEBo=Bo~TB8xAgrzB&6ivs7=Ay}-e#V#IIJbfU0WNkK zv>&t~8a--xeRJ2s5fpycKMgY9&E5B`G9E4)PS#lS%jrcq6z;`Y6T*J!%RVx~J@^EX zQ8snKp9Sj28F}`Z#ymM2x)7nap9VHA6iA^#OaKiioY80)%O`7-MsP8Z;V|}|*+e96 zj+y&q7Khgv&;5);?>G>ILyrFo zxH8Jez3uscZDItN>S_NzRT@5j&c_4aGizFRSpF|>dG4P16bFGb#5*9{r~=I~#CVKx zlR8G9gT`~izel%6xFW(WxF(zpXz;`mn>z9gQB?D_g2F`0{vtAEnWbTsI)BlQ%a_o1 zWghH_3x+#Of0nx~n`YUAGsEWRPXVlV2^-WoF4ATp=pF2^m2#gtp?ZwL6e(2=w)}eR zI=66-V>;tZ0rF^rTmf!7BmsLon#T(>L zfjOdicOy6m)fxK`$TSgkRzUe$uU|gWi*0k2I*6uxPcRHCq%G-HAjtf}FvYy4T*;Ng zyslgad2I%A=X#!aE(^RyroD$!WNv}>6U}>Sl;5;?->q!eqG3nNHG1+Gj+74&O93rI zOEs#!1f6x{;RltH^Vv1C#_i#AOb~WBS;~RyX9-~CHg-&RU#H!@7bK9e&ZlmQ1cDFVJ+JX|Zh5{d@s8znjyLWPz>Iqw%ePa$eU z4rhT-YTPUwf*jBbC|qqVxw_(l3CWG61KfQFnIr$?e$ z%<$B@qQQa-S8dkKQm7W?Gm3ja_k=fru|ggDmFGcp<9#=6HrwrO60ZKX`oi~zu{4d$ zs|96bnZ zK8WY6Y$Sms&%69LpS@?U@QUkRWCJ_|t$pD!Lm2d%GbqJ)56c_%SU`HeV3r>#m}mL3KFd2;$@|W!>gnCwR{?=U3x% zLWPm_9~7og1a;qS;Fo=!1$cjCia?#4@O%A`@nU=1_G{9hdF-jKf@pTZNq$LYz#Oem z!QWl-G-pBf9v<9)vHbk-@$}MqGqbBi1gNULe729FU5LAGQ_rnygaGKJXD_4~G2oh{ zpp!{9jMUpAC@t}q7q4Uke&P0mju#dADj^**q-}k;q>vjO`M{;mS+dmHNK8H+D3wnx z1w8?}CUKNAi49*wWVnq?3d4pQfK)M0F)0nD+~p(c-LiLarsw~;H0R(O1#*I_)y+PO z&yN1ON#{-E|FG5BcfDvNf_YToANuOqtXoYmDuUa&QPfz#kS1{pXn@b~U>$Sm9<|u? z9QuDleH5czkDSFm9k=w(5Zr-=%dlT7c#se4&t)ObmhxfU16^?fdby1}rm;t7knsSq zk`hG?BJ$trR{TF@F!As13Q0A?x*Q>V3t{WyNYz*>Z(;pa+w5m3-L z+e-09naTEYtwoH*uR%z@X?B(qw@91;!-P9VLew6mf!RM`gCx(}-KY+Ra3d_N$3cmM z#caWO*dS|xxxUC)<4A+acciwH$B=_db`v{c9sRr|^kUCNWC?ra2hw}_+<@TgX#;|3&fAm-k;AUPD-z|ocxn#<7IK4vxDN6BkwG7`V}g4e zsZIQ_;NbM^^OKLuUIXF4tW$ugny&)~2d!0e%-qp!45@O}`LWjY|5hP>`2a zUH0OT)^8hd^s#;_m{7apD6X5N?XQO39ouTAk34ePbm*TRA6}|v0^;?q72!(r%^^$U z`TzcuKhWg!mZbkp6LbEzC(?hzcmJy+jTt*=Tg1#|J^<~jW7tYn$FNb*weMtBiOtM-q?;GT@2i7?_h~_OXErDImHgal-jK!k$Z?FiI7x7pu zjT49@A{|Nf>D4ivp)ZzYtvFP@dgVR}r>f`u57(;Ey{gftj-iSJTqEe`(^Y)aYg}sN z3pu2+nuH=2gqhkDeDxob0|&$a6UT8Z=9K_Rngp|c+L3Sxd&xdhon+#gb4c_UQ(&TK z-KVDUF{=0LViUY%9Nc&*2&kfm39}Rp3>be6>1j&g1&RG+o4*xzBZqgSk|bHih>F*= zm`BWtiXzVx{dtU|Me#*Lkd5?5?`klyXuWadD+y>2MJHQY3H7KWkUmZ->B8s|5^hoz z$rVGww_de4mcG&sqzJ%-fqMO*w1~0}sm8;E`X@j$r2IiB@==IiDgir?N|`Z6B;!5R z7_#04rxn-q5vmx4>EJ+_cYxvcqeZ9(f;Hkf%^XKOZVUG$JC90^kr2V}N7LyKk3`E^ z!|TpeP~i)pe;@>4&UKGAKPs$V;wKN?v|ZolmQ9_1+v#|>JYMH&tA2)}yt=5|3zh}Ep z5WbTtI;A-PO+vgSku=%#v_Wv>AihUix#u7|iHM2>5GvOZov1$5S%J@^^`C%4BxFyB zvbLLdh}q5YH*>RN;Y|=mQ?YBPg8f~QU0gaB9Vu=J(Kke;V_tEel8C z`>dg=YPWi(3dCcDy=;~3f$7{y-But+x%Jc2vNhKth#|BUpaV*S^n#~k2AQ2V=IEXR zA%o>c_J0#@cL?4kzv>6U|6m+&z`JmYX=kYxtbFwPW_KithWP~vUtX8AJGySXgBgfb z%25OoOc~h{2M1469;pJK^^K8V=%De}FSQa(P(E?vAWPp)!!?B68c4CyAvOB&6h@SDXVES7ad6Fabn_25@3P zYXFTe29?p|lJXFDIo0saVj=@D5Gt2O`{W~}INd$f1oD|iddeF{vVmk^QyoM`LW}X% zry?PoIe~dO!DINjZna;H3xa$Krt76nySBA$4EOl_%);0^M*@b~5!J*e`@wDG zi~e2bQPsVr{O2&A-)`6?NtCP|D_jsS$VzbAHoZWYsXkBE?#P`L+5s_|VttneJOIvMRh5T0MqoMi}l2xxRdvm+q@e4TYs%p#j3rwVV?>#q!j-7^%g> z+bVa7!`SW*7H6lN0;q^Z^~x6@2;7F-#g4WxuM zUs2%gh%W9iW_!B>bnck!ZF;30BOsh}7hO-_En0%4_U&?~cuCOGAa#u}yGhOGPa3*7anrYx8#H zg;)_MMNOq^OGW0s#tT->pDAzKN@N*WIqFDg>i2D7+rtRl(3wD4SmE&3pH`A(UKA8c z1=$(K{QQGM?y9gf{E>__e3GJ*gA$I%heP;I=x}=KwbM-wj}Cx^Q6^)6-Szt}P{2Ju zsQS|_+TzWJqX)aR+evHCTH?djud%J{5gSSExF7!JYF?KVm+JD1 zB8aTQILBKoeiAj7qm4C;Jg5Zz^1SScu7#koOY=Ayele!J~iRW$2uUFa{AbaMG^H9BTKOw5|NJP1(iCNPiSIF z&AD&8U%??+vF#sZGGTePCr+jpUpZm@zLmK$aMs^g_F2#e0KFdJxud4%smhtf7PmJX|I@;EuHTt=oz&;*kTjt7+Ge=zPtdj*x3hcVXfj?l`r4;6*;FdMRXzRs+9>oE&%up;;5L=Z9 z7En?2LG1o{rqiPtz}RpKUHfjXwIVLJc}brqrH#{XE?%4Ihh2u-*ITb$zBXkqy^eM6 zG3#Eda(a*GGP!7Hc z)#)JcVn|7aD&gu2lE*8-bAWAtIHMcdclz&!zXwRlzx`1Qfq@;$;f z-PWzwKmT-)b9(~ReVRcLJx6WOHF&Hxlb~WrhC5`O=0Rz?7rU%5Ys5VZ4r=~w1{3z* zxSQAIDXRDK&`0D8_9yVWV|^JOhD1BKQE1K%!^@G{%XufPBJ9JN6V+?HKKu`3W?vtt zBHgBIdtI7or<;&0SvL4sXS z$Yt6O7-|nk|8D2PJL~j{xI)%PPW6gx{j=!`>%JVU*NZiN7Gcf|+uiKg=e?be9P>a_ z3`Ipw;5%OAT7QLMN17}V7EP1Zz2c4#lu8Ym)Gx#zWK3HTA{+}>w*#tCq#2wJJa6DO z>G{PXqN(ALG*Evn!jUL@W`8s1$q<5^>Y|H%$M4Cnu#{pQX=1_)C4I`-c}-x{ zM(=z4uRvdJ&NU0A=9ciLr*0@haY|R<+Mpz((QoR&`-mxofxj`B5xYD1WXI`<+U`bI zB?9S5SMuWSz3pL)2;a_LZBkdr43UQG=|TT>>0~|{YQX!7I<=KKI^ntY6sq3(GHb=( z5>xcEY1CF8yE2s!Rx=#azpt)VBPpNu3XYfAFb0ed7XQWcmylRkuH5PklnQ*DFsm{) z{yP_44S5~Mi5rm6fwnJvC&tW#^S6V|vRbD!eb~hHjr1ne*L~yTy~XQFe(W%57f(gk z8+AA$k8{(6!?l98amygGgY+z~k&Z5C*;^}Jy~}svjD{2e5}W`NL#IN-`JezuiYw(0 zMX@VHio5RUjf1apr05``@VWVD84lvP;exXypcy)i5wW&Jh}wC}?N4Vig+hfSNI_xPM7ofQVjswiMwpt~v<}KuQ%uT96bOM#ODM4bXa#%D5cgPzLL-y3xB^#;`6rj!`0bolKM?~bmwcAe?&n&tYAtf8CKF5Frb zovkeUIi@W8qF)aA3_Q8{=pBgG$q(+icjLva3d-R?JlFvs*pIVHg@&z_+Vg0 z>b>nzNJdR59&mH>+nZI?fkQ{FL1Z{g+S>B62abMyoo{Y}Hs+#JviOKwYS5dTQL}yr zM&P#tFsT!G)l0N0iQHhD4XTmr*o+kP zDQv;i-Z0;0wR$K|nc{19>Rl6~-Sz0;Cm!kgAZaW^tyz88JmrOtsxu{+71KintRwA+ z>nnOM8&w-G+=ohL3$>tcrH9IuOHaFcaf^JnVWH5mFI}r@pOpY`pp-S$@hCj*bp*oX z5Pg^P{M*LCH$x>(kc*)OoGZP8`X?FO6w@?DZU+wAKxD$%Gv?`(0ZyEM-pk6V(?yeM zcbyI6|L)1$qd}JoxS7jg*A|^NpP z>bK|KjTFR)KF1Z!;iN_n4{JJtv##_n;i10GDprlC2N$JzvP*A>rlTMgYIIi5uCGhk zfA@euH37w4-U&8CAK1rg!(+CR(fxbv8g61@8#}B^g2T5tJ2ulV3~X0<1H;iOqwL6U z4@d=xoHe&bPK~^W_q?U3{I3iD&6!0FZgwcgb*_m^sQA>6XRs?;?`*mNl6+A3deiLn z6~a$*?`H7g9cZ9A>nF0{dFL~)1pSE}vFoI_Wkw0?MI!r*2^iH7bs;*3)pPKof2Eag zP$%~sif9C7LvXR1Zcwry?E}&W4}W|D2u4ti+ME+6kWcR(Cyw;yegf4w45j~`rSG5$ zhe=m)ow~H?j7$$a7>+w4cy=X0l61Jxu?YsQ)Mb z%f!g~KX+s=Ysvnn|E1?s{qC%S3Go11LaAb!EJLNSC9LKxUL`R|EOm@VdPyYFeDwYK z^G*;cowE0g%Uyw+t6mpdd{oTdA=rp!thi12~O{?uI z7thTN+P+!GjW}DAombaRbuCm9m0Ws-Rc*uyR~DvGj!VGhLa02UsoERh9dTC-800%=gbqtcpTjU=%L#%C$Maj^Dxb3@%HV|4_! z!!X36bpPNKhE0K)mcHA-4rotH zU|M*acMp{%N_gI$HM2!Zh^mrYwTk?@ z4`DrpB~}tm9(r?dek9XajTk0kANX(%nG%%DN1Nkc6P7>9In85%b? zO0Q#q!9i&+O$d;TP;g0mfUnN?>MAeE)T+ICmfOno;iDo&Vz>!?aLg($Mb`XU*mxLr9iAfWpt@&^cUV}Y`GKLJb_^IPrqHfW6f%BI_DuWoQz zmfMTx_H^ou)1YVm<6#f30|9~Xv3T2Zd+yNSaFQH+H6wf=U7s)rTB2h6h)<&;U}7Im#6odp+!sk3K^!`)nE9P7@JvbTIPMHSPWfChS9rKWZ>~`qE9C=W|hE~st=%FF_#&KRuSp95d5j2tT?TgP{0<0N2TX^ zB!)?7iO#dfZ(OONuKs$DCrw6xvXOwB)#yH_GYhX3RIeoU827S^r%25xMUF&V4;6_? zNocT+vnEeB8V1Ai5R=#2hQ{thVvl%MDdoM3LA47kbtQix0Sh=NA^3OO&{Q*o7)oqq z0P9zDX*OA4Q{=wL#rOf5qFFiYB2F1cBJ$``6Nls6^LY1Pf8k8>oQ^d_6rZSu;c|ap z9d6T7_n`zHvXB|1^|}&~(4h0E>e&G$WVnIc#EC*e>Gx&$0=UEN#8^ zmE~)fStqOxgOjCH2L*w6f7cD^kLy)thGZ=UaW(?*FZhh>jes-DBu9W#CUtQXp|);? zKa3*@E)>TA)91|i|B7*nVtoVvqzcf7!=2J0bIwhjY-o4xoh~7ao*4qgACF577WAm{DWSxP-;fqMb$E9>g%P|+WmwYLkAP|1JCU>~6zLfmyer@MiI7FRQY^X!$ zP+p)JfQ;SNo5Iaz$#|hCzV=fisW{;pAZ|Y@=I}xZIS7-BH7;^g?@!;4C*&LA`Jy7EH{O$dv zRHV|p$vxBW%6y9dfcXUflPBPz;e8C{Vb*!^Df^Tolh5V~f=OU6{y^bZ9@JbRyX+Zj z-TabOF5CPn<3lfC`!j_E9$R{h&0(W}1Bva_AB7v$tNM?SA?K+*jBJY-W+eIRE)#{7 z$oc7wj}`E@2*V$-17Wo5kl+-br=jN&KfrUby_Nr_UKm;ai+W-D-@Di-oDeKn(FkV6*JWSiI=D>sl*j1MafcaDjQeFe|>|$^Y(gQp7)39 zb*fa7rd7$KOnN6|Qsq)D$qW}HB2}a{en3Y z8~x@TtS+W&`s$yJ-sb974i{C~tL;;(J{`Q8v_`9HUEu7rjHlaw;c1>H|tMKvWy?RnzktU!g349hRsx8;) zu>>xBbmFf>O_RF|Uu2E#TQzCGg~-xakD%DYhY%#xnBAef5RyrJSJg*9-N*zZWFA1` zH|Ddch9^>L*Lj&=6!gJ$qP3u`fbZ+=O1k}ZZ$;I)dc-BIX|CMksmpL*Qtg8S)2kj* z&fArBpg*j~PU-N|z3CcqBoYelw1-D+$Jka;SRsw%m}dT^^8|};zQ!C5A$_)crC`!D zgruQ1MGnDp$`g;LRKgRX0$$^TtT^&5HYy`P-HcMfvZ{co08*%t?wHV~d-p9?a`x9t z<=Ih~&@RB00x+3Uj9ne$(7Sc>K4Ij@wN7e}Mo$Wtb~DkqFa{u=uNB#X+vg0|ru1ZT zJjDpyYlv+>O<@X}5*z50%;%O#j~G5 z$$qs6*Y7Pb+d1(W(3&GEs2>k1(}Ze1@D|pZI8^IPi-RQ^3stiX63A_*2{?9g%Hk|^ z!@b~)zv5FKm)vmzLsOw`Xh`+`o&H2>WK1?dwMZDQ{@s9-HKkg}XbqJdW;YhnLoz4^7bSmn} z6ihmTzgqlbh|Hq<+{a6&<`Ypt0*aVX6Vg@~&@e;`mL~qtI>QzHNMw&q8@Fd`xfBaW zyogUT`UpqN8N9|N0+m{LMq?6pA_}qDu<#xwCM{1%+D51yk(+p3pzZql4R&n=hlaU9 zVlx0qWoQ}y^mo0%my&P-(f+Hd);LyPe)B7sg&`il%-X3Y_eKR z&<{PNv>e8$7R(JD&Oz-`wq4WyBh2A=9^h8q2@`M6*Dkv|S8|-!(qHCSXc^e%Dp^1W zfN&=yO45SyjocVGE^kx>-kq7Hz3Zp851gl8KW47e_wfzjyjKH>Xz>K^3)m(kiSrOI3A;{3d;P+*DZG@#veNm3 zl?pWaSwh+nmSTededMAfYp&e6O=Qp}#`tQ<-lOjm?~XB~-#lx98XzB|3K7{Qdg}x= zRJ-(~#Z`>&V^#r-5>|9#+G00AVSp+IgRCfY<~>X&DbvBR`yunn17c#F&&#z5GK-e+ z@n;wsi{yKYZgSB$0!J7i+X$@$r1iFn0oFT>U1WyA$@`cO!HfNUi7YRO7y61V$%N~^ z5aQ25L#9i=5>4;04jOL?F0IJQsJM6<0A{YSQ0es-V;NN{L2&lc#dRxKp#GGGVr?W= zjZa##rcD~_pK&Z%h{z^^|H@{#gH2maDD zxU7d{pp;v1J^0-FR0?+_eGvzTMBzFX?Hw_KC)D{(T0iYn0ipDX5Ogo&r->%g zj&1#7+qUfqCbn%S6Wg{Xwr$(CZF`cOIp23~PW`9qyj@*=(>J}lYCmi5wbxqDxnozS z*QO}>Yh8z?Em49n;$;(0?D4g07|#OHhs12z>%TOZG~dh44CmVCj=kE4;40KgYxocc@;Tz zIdhf}Gm9{(C@#a&@n?7y>l73O?vC6IhpMbgD#5oj`OKCfq|YAt#7iCA_Y>5l*?CZ@q(mLB@=l{{YFuI zxj+-l$rz(^12Pf(IyZ@+@I~#OM9V`9g&ZoGiViBeRMoPr#R*|Kh}U*SwPY&@H)tUd#%B&5%s(inSo zkxC?@wY?11V^M6e^iP5m1SKfNNU0(S1*#4mY=Nh44fCL*JXzEre^RFR0s<>LsFlmH zpD^R0oW9zsKr8Tsb(dgz#Q2fMk(0dyisVtK)GOxQSMi&&YmZ`Wf9;Sh-{R#;=+L@= zew_vWvQ1Mphl#s)$9Bt-k$eb*T_B@`ntD;1{I{LVj+BnA$a*=#j6H$9!%7OGiqlRo zHMeM!rDZ!U8uQ)q2|2jLE-rB*P%GU<_4>zfq2}fFg^ymb_CT2nNx2(VUIB^23BO!yhwSlvVsELuC zu?Y-6Ka7*JqltkHjQjeM#*Q5h2b|A~Uf#%+7=>aXCA^UTm*BDuo-Q)B`1NiBLtCT~+Lf}i8=92&AIW(62%?T%CAf3Wb~H;DvI8y%iPs>&5E+V> zNQ@Kn+&SrL&ZvB$_c*xv*1CI>^n z6{u=}3JaiOp!iu{M^==j@-}Admn1NaqLx_Yq}FIFW!XARMiDEQ`Lr=R3hT+{qX~d5 zEgEc!jGfE8Iw7llpLC6i`Me;xcJ+dINT;lB@Kqv|QpI8D$N6-Su)NqKqGEf%*BS@_W_wd#+n7XfV& zvs*Z9dRzWq?mS+P=IU{g0DGjiQ=z`@+cU>HM+%B+9yWa95Sx{hqO(fEnV;Kjr6+?yXu1-ze&YYUf^b1{n9+$1mx02+Ko$E~B@AQL#x19%#7c~A! zK!p_z{M_?QyV}FW(bUq=A5Wd^^$xw08~T}CT7fne7CRxNDLaGHKQJANtG!p`ukLl~ z!W(Pt%jp6J$z z?T+)eGRc9ioCiWbcb;@~?EpaB5=08%t6aTzvx$x>5~fZq-Uj$Ed*vB)Q^NGFeeoF!Ba^2!IDB%|f{(h^7Z9Ud1t z5`Udki&N0_>qlafdM@Mlf|PGLd7GAym2Lv2JaMZMtcg+0y-G+`ytc%wJydz7^VwH| zq`5Eaz&ZV_+e8Y;b|%(88N&&`Da=W!_(P$wnG8MGjt=SIkMMZcij`wsK4IUXoDCGs1d4*hit~O|O{-0DwH7KtpQmWqp6u#y7afNzRf-G-HJ# zI29{ujR!4WK(F~_X?DlLh%XxNBezW@g?Qy!XiCeqiMb_QHUHt}EULdQSv=vgW-Vg9 z)M@7W5hn5j>b5wFJLv{dvj^dcdXcWEBy_j$x5YZ7+`-;&DmkDkiXdt|g`)*9p+|WB z+m?Y*W=35LKHN=alTK>okqSJa@>5Xt5pW}eN8b^=+GZ}F$K@)xMq9ES2DlBks`KNB zCCINr7WY)BcP3%zaHf`GOm%m%woiT!rf>Id_m)5IpI`T>nH5JP6Ok_`0t_du+Wp9O z+n5d`$8;~4+2pnz1#Kq*TGm(AH}_?CZM$A$4q+n#{gTI9>xn)IYm^Ww+3=_Seb z#XpE`dh`60pg{dn22eZCnY7I87XXjiW9>()K7XK|f7ArTlO@F;Ydn7pXqE(ZJUfAj zyV%FAqloY$J6OZ}hIW6Y6EgTt`OSEj@_R}EwpqW{cQGoY zjKSE3w|cpTXJuKy3_b zfwMt$qQjqItnw2LEEFz)ld_CBEI8xK*N7xwfd^r`gQOL>uRWjPBrl^X3d~h|1u=lew54!);~c zZmx^pe+ROyurJS~qWHo%{$5=2Ca#Hr%;Ye)5pD^GRGePyUn6B<`=2XmCRXPEEO5_O z+ltL%NAjJ~6Iu$jE!+i->hof_YHB+c3IAF2k@DyddLxW@3p1co?dxrZnHkKdDp#;D zX3C2{Gh)Zjev6>H+vS0rRn>E?tNlq&%z#EK*?Q~h6-$v5Mk*7yx`DoZ5)HLF(c^kk zLbGiq0N2uY%(3;Xbxc+N#NP#ABl91(DP&~~M4a=QBHEJS>^lQzGP8)h( z&cxhh=e<;O=QM8u9XTfZOY5lXfZF__^jw=`To*s;+&q;hnR+Wj(TX8zjXj1>AWFRz z{qc*(oep6j`WmJ)d_#9(z09z;#i+Jqth`yxW*G(e^{T785$v$G(ANBhZY4*x9t9lz zTxjWiwY0gUU=HbnmimmLvC(JdTvGr9XVnC}becmVSxqm1P`G3ScxO?iTC-r1<~6FB z0&&*kvJq%{IK+(9EIVJW!i$@px}h^YI(~3(#KeaqDupbt?~&WF^^ta<5$y1RUbAtozM#CN~mh8Pt~y2G1-&2d*eiH{b~ ztSQNkAKwzTZl(ESnhan0Jda-93=71iQ$Z7fA~sjJ^;|`z4;^;D`|{DAvMN!l>G7Eo zo5L&m73d_Z4e@u9=wIzK&wS9JZ#c07ezNm1L)Z^e5>Bi(c*-jyrK+NOB-*G#qhPR7 zD*oS!@KEi|Gra_;z^2-v3_1J)d|sO^!~g`Uk1zA;nrejI$N~e%D#RwkxJNawE%>RW znGbmm=hp*7QS2q3vq)!_v#-j{Y^(#VflvF1{l|bBpg3Z9Ge$N3j8D82`I;#>F~zQK z@grXg$9V#Qv}=S^S#{DR0--CYc{2<2s*QE$-CY^rxEKvrouedhdJS zxLg4t_U+JUAdxW&joIDVj5a&oU;PLPYTw;6I!-$pr<$jnxPwxiuRgZ{ti;kO!oU{= zl0#$FT|L9?fyUq)(b~)IhD`~3lWojTZJ|~>Mjd1rC;-c=|CJ6tydTh6MKo(Dva-UQgo|O1<#Paw-m`i5hsmi4jDi6-;DBI3TzCvi?3~y^L zh%FQjm$V{yqq4%e%~us`5=>3F!AU@5vj}b<=IyGGQr7en=M@Y;Sg1|GMi-e|5G2|INzTinCiETjc}L6MO$dX9PxVd+u(Ub@5hqp7B%eh!y4e(7F!iH&E4hs0e;$!hA5L+KrDVquRO%TSxul*6fTPp zWW3%Zqr{|Oj^~))D)wf2(b4l{a^B`l+J=AsF_cjsK^z;W_^6^Z(`#{0~(Q6Z79e{l_ii zkeZBBfjH7%)v-NnHSjbsW2x3iCxoE|7xUp1j=OR(y-TUkAxb5ngAk2 zXQ*Es+{a7)t_n?gwk|l{WFQMEbQ8=axIsieYaMn9bxpNC`O|}?5qO>^O=-cR@V=e< zR0VuZQZ~a-`xs8&#zlqS-ega5y$TE2&0vh0EuUTM0*U5Qm`h3P#*+WCsls?>=OTs` z&fl2+$ja!AkcVhqFnBvFUCI-HJ3L}U?e>Z}kolCbDd}D^C$6`6MiIQQeX> z`RtTJgd%p4-=c+=1>+Gm_T-<=YMeLoO~1MKweF=Htv!z332B)%w%|-}J!mpVGJLM~ zP2dQT!Gt={M<)a@Rw;!Pe?%nysCCqvCPmuEi%!M-)A3H=kp3|40RxjmvVt#FcGq>W zzoFFn>J5q@EC;)c*xL51d;GqK&w^xElaSH_!pk#cJJfOM2E2rDCQ)45I?h&MVl>7_ zf_ASZ@~jzOIiQSyTU_?hD$uQr3at1TA_;%oFbj#nu&dr&qxq1^w_{3kc$@9PpMd;| zE+8DtA)mS#tD?Y+c(_^%Sk8&941Wz+inJ$s&-IJ&;_dao35a=ohrUQTj7oe$CXt?(b-j=^ZO+N zq+64$F9!YCRb)1gPo#I*ZM7fZc-&y`oj9v5%ct4Ns2SB6kOM-t?rZrT>w>{UVMCl( z6C~n9q%kzLhbG}et014zu9*sIwr_8SGE~xMh0EuDPQX0i;N;trG%CJcPENe|@zdm)5|Zp4 znf&E;y$QS2VJNk$oj$duxh!TezO%mbwQ-NMvk$b7zBx6-{^};5>5&$k*;?aO+z3n_ z0_6Mg9PNf{z(TJ({as=NmF}RAA|OF0c^m?-6Z<^^j#T$Oqdj68$F8?tEf4^T zQN3LMoUf9(n_XY{cM%=U)3eOq1o=7HptIVQC`)4SV3 za**afg%>~!YaUY~1vY~NJdpGAx`nLyh7~eIb#e2*_yt2=!xdA4$hk$(C}t&<(25S& z1IYZepH^0y>c`Xxzg#%2|3By%fh)mp{xB4gKVVbq0z}pit*PY*is#uR=5< zr1QGClNfLg7Dg2Jx_Q?m5rG5m2P z#LbN5K;N9~OQ?*6R|zC)R0bT{B9wymhEWvkF+-pAF~t%K;^4l4?(i?d|5Yp5+5b^1 zIhg))3)?C+J*N$JINzI++l@`DqB!CwJ1@=l=8fvE>x{?cj%LJq*^$oCd~!vX`zuJK zI2)7c`p|5Ar~o7=kXPVB^-bEr{VSF`{mxDw*E@1K4CZLD;`yN`)4Y1I3^WJ&$9>PP z*ZR(=T;Gnb&)boG8B!Cfl%A%*nvCN6<)#@DvP6@m>TvfXSG-%b=DII@-w?V-ke}n) zdkBWeWyGpt@;KUdS3m;Co*FLM7Awy&rdBMAT{>90k6I#w&F3p0q>OtlNdI7P@r!AS!A zPMU_R-^*J}-JzYb8EB4gk~zUD^6KeVg&R;I7yda!Ub zS*mdCnneq89kipHH4+)yAdaqO`8)>#w3eHktQO$V7OjbG`ILn$2p4afni`_aUP^&W0 zE2bcrX@SuOdF5&7EBtC^dm4vJ>0YZN$BU)i!X;q;M3Fel%k{y5;b3$Hh`-v zaRPIWph`43mOrbG@7du0+TUCzOEG&g=ID12LL2HUY#`Ksr{44;dRgvir6rOGPY#D- z3@bIy7?mOt*go_2qlh^q%X8cpc|uHSND0H~Hjtt*AJ@O`U3U$FBe>yQNl1>uXGN{4 zg$-Y$h#HqG4!ZSuIS$SPCrsu9BtbzB2o|a4D%wD&q;D1)T!a7@sgf(wF{WPzM71TFfm#d{)ZJ(DFTdO*3=2NX1p88HMRH%y~%MUQNKG2wq~Eh zv5~PsJsQM>`y=hl-K%-uoojEE#1up|Rv-Rr@1=IWscozkAvpIFH+y*f`!3K(>J5Cr zXp#u)^!j5E>{sK}`c-HFQSP^XG*>M6H400&OBUIgHVY^KrXRRf@J7d1Ch0&0(%>pQ z$Qq~jk3WE&wf|i|%_YiNK{kFEx{xh$DGpVti=-i;uu~91y}x}W z@b0YVYc=R(b^0LfH=tUQaT|LfesUE#G?PN1Y7N!F84f0-o9gHglQcGl3-l^5)AY9U ztl}x`Dwl`WFK$mvCs@c`6pJFwY8iErqTx%6V!A{=E9+)ZZQFV7oWDOFLAnl(^vGP;z(yq03_O3HMx2aNPeSi#(ZZb=2u7}~XLMF`&%BE{1q&Ufm{v#_Fb~LW# zq?q6_;^am<-rw9_9H(n``BdRBj9(7aaXUu4F$=Lo$8TpgVuQhPgea`mT{k|Rt*cAO zxHOO*dvv?+nUSFyEFCvc$P~o6Kkc)rSlrpq+P+(-OQY7IP!`4GGS;EyV?2l|;(8q` zh@^8ZJe9ol#e)H5Mte(0sPvtZ^C~!O^62i=AtSmY;`@3JmAQE)Ib9yVBy~67l~v9N z^!FG1*eDNu%Z{;)u_l5BULcrn{PsX!_m(&CTSLDdoL1PHtBaGkKKJ00IwfW?To0Ud zjZ`MUmJ3o!EwN+U2ZEL8M*3>|HO_(D6aU2V=sDp~&pgB<^YK~Bd141-1L8h<;vBmM27*t~wJ>RW9WQ(Q6L;r+r3RiqB^kQ-DzNUZr#y)iFwwrlSq&!0k!@f;;M zb2c+SKs~A7mUAxB(o74<`Afo{6?gTkblQFx{(!rG79Ew}Ird)S`?h*ORWC4I1|zON z1`}qE7c-u=dQea!-)Xu=bb2U=Dxzu~#wP_AgoyQX9Sqz?sl!=i+)oU4>KmktgPsT? zbtQ;tFYY;hTs=KjSoUxs-ZQPCX?YpPMew*|jUkt}tQ(YCL# z*X~VZKCm)+>Sb9DbT`~cRRJW~ddFO&b^Dbq^bV-{ zR>c;D%uBU4eq!cgBFXqghPR%{7I^Q4zRKXkSB`f1BSnY_zv9v+UkpmBKmWZ~?S6VH zTKJE}lLnUNJx{y9pcePLbDp#cU)FIHFlI@}dzzr{UAWcMgt+k#sNmJ^%F{m`4K*N(uAxo(iMcEv zhJY*5;7-a($4aFu6+F!{p=U8moD`)6Rieg#K<~{hN5N~h62z#xXswZgn79FGBeJD6 zW7BA!m+rQ6*u`mg+faG%2HPN06DD>Qe%#P2`qFvPXZD z$bE^15r7e_@N2{kYy*_SX~`dI>(ctv2_Byd(LnlGit7`7z9V?MPX`-lM~bE#DHI5P zK|>6O?xh+0ls!@Hr%g3rk9?i)HJm>Tz#Y;+i#GJRn)7kKAoEWnb(F2^lkpw+&XOn$ zcoS%jGY7F!W$6V{E8#SKoI}B<*IxwzQKWbb#2cl>{cvC=P{fKH2x9e+I>x)7q4y2g z#beV1n5KReX2ya>6PBWZA^B&tlJp2U#>(Y&H4 z9Mb>&iI>F2W%l&0TslWve&=(cU&e_>7+Y@!O5^>sorOY!gzNZadcjhCMuY;$GUnW@ zDgoJOzX*M5V%w%H{8_fPC*zpCl}}56&jwjx@KR#?-MtyZX3KvW z5gLqv;s54Z^f!idHP+d#?eO*XrZWC@E&~E| zLe!o(o3$NxQBN-6-A;KL1!XDr;uSWlq~@7R%0TF!%CCEY{=*@Q%TdVd7i}63P=BDR z{NcleH1PxSfXx|v+nASEDB(tblO{c(TiO(C!Qo^8p6}(g3KZIlZji)dCmmE4*ovX+ z!UneY2O}s;EFQA#u<>PD>IGAPr))tP{#^$g6TKC#U1{LP(=S_pt+U_i!jLnaA#a)FKQhrxX=M+T8!%cFE{1?d{N#C+OLn3aN?1q@&KaoE z#A#y|+5%FC(_iadJ(MpeKK8`5g^faJmJ4cB{HNn3XEJZeg0ix;p9|UeHIC1{j7%c; z8gP)JZ9mEj&V!E%QSn$FC(jhqkvn?N4G>$uA$B7bX37+!!~{r+(F3@sz- zf5NZf0#fMsJaQa9pXCtPa9iejrP@78Tq!;})h&XS$y*ysYkR{TwshE^I$ra& z3-SA>{EG8moE$47+kfTcs?=ouH^6qEsGXLIscI`NMv5W-mU@>|{4KbjHIGjjZUsvt zQ!aTm{P~2}Z9G9U64?w$#EoYeNVnsUaj1p2zkQ(j#ooQu+5SNl4H}@But&VQ3CRjO z&nZD_&{vGm9b|_r#^G!0lRX2bM;yR}AV9?=dPFpTASWt?`?c)6pvLn#D>bz7+=^Ku z&E`$fM9r8E20kt&-z0`B>JSyNy8cn}W z(55Tcmq499+F~Aj6wY-sU_v+@?ezLwm*0+*n0p@3bsmRd_ukQk!Y~LM3|D#eGW%qD z>27*(dtfqJGiEag!(iJm_DL7smElRwf%AV z7N|alr<_DKXt!Tb3-jScwn?Tv{3~iA5YNhCret{-$My#i!EdwpR5?T~Ea)O6*ZIv2 z#jC-H4hw(#1P`_5i#$I{5$Zc;7}bklLj9mv3VJajp(LiBvaF0|*J=Wwb*~a%=at8X3xQSkx=!0HqLjI!D@1Ha@C72~IcgYycASF= zc-5}bRQ`#F3HZ3VBOaYIM9a(EsVoxdfabXb4Tuu6!u)onaJV4IL!~=#ies~7QoiBT zan+Di7Sm6`MF8948TL4klgpO*^kGI<lS{NnrtaoM?=WAn7O|lcWbisfIh3I%PRC6zfc+0mF?v@K*Kc7LG4tX^YYslrW{yr7Y&hQfBJK zV**=}dC~h^a*5pg+Ec6xe?N~p><1FAN6G8>vO>_Tv z7i4sts{XH_xsQA?9)Ufhv#)}qJybV}Up}&#QqZtuokueUs8wx$x&(0jN$i$?iz+7M zcIEzv%T8rIA4VME}VYfF<4(akOM>)DgzDoaPsxK798N|wN6_h+Hy7R!o?8N3KtE7iw2WkAyrKq2Y+i7QVhvG7XL-$@5|FufM9-yg&(! zk6=~XQSIr==^M+Thn*~@FBpsj*>q-T&(8UPS-5A12QWzmFwRGYHtE9np=iUVkc?;1 zD^s@4FyJJ?VFm{F_85OKGXb}*_7{+bnKJ_)EAN-MKH#9ljg=1tUMNauf5dQHzwe&k zBwu(k60>7ppBWCdf4`fwZlS!A?XeGV3@4^frhF<9| z4oBTwx)JZ>bt~RWp>5KShPdpn(G8J|7<3#AD-%jvRV7BNSl?O!lPI}?EGe1q8#`4; z|D+`3Oag}>UwEigMw93>q=P6)brh(q+um_7XaRdKn0>xT!KpX|@%J}bP#+2M2=fq5 zPd2CJQSxmUZpdCU^09TNJFg11ouR0(guCjxJEonO zcQC_D<2*xx%y~#wDqg?-g?Jms=A9v)21p!z0PYv0UfP5I%wG9~TV^EnVV?e$7FloM z6TR|N9Smm+#3BY4WnI)~BC)`hYg4?B4ml4VrFh*}LR#1Ey8=PY;ZINHq+=k;(Tv&E z4HD2DPg%4cKiK(h?1XR%6OP>y7v>#f)Q2mhAQuQ-n zX3ejSDUyC2D4^q%3^SgQtK$;;P5Ti91&qWm-s-tkWnl^^+#6+Z0L9A!)m|`39@I(4 zReQ-EE7#ovsFSt`p@s+U7%OIwLXo@uPv8Ax)jRu%wKS&859r1e1q1Dr!D$kKMoJgQ zi9Q|}32p++s$vKk6g~$!78P|zbL-U%YOuk0}%dffvKGm-d`SE#- zFGRbY{9D*iR?1A61XybRy+Jkb9LCm@-)s_b(|y9{5-$)iLWI@AcMx?1TuXT zeqq9kDb)O0z!JGZj}kHO_xAe!D0M!+Eg zX*$p*K>3~}JQJ#E8E3x8*kAcZx37sV2)M1QYdg2hK#FsxU<{FH1hYskfFlv~RZ zJgDv^Xb0>0E51aWJsd89$MaZfs{*b%L0y$@LnjT}{rAcT2)yn<&{qN&;d_T#&~W)r z21H6XsMhSJc|>iY z9~EeF9h0+Wkzh7fg^C(8I7noOe0KOJ|I3osO)+Y}b;p@~&bN-3=&yZ&F-&prO!@Lp z>3!km$D}cc0~5IH{`}Ywyg{Fea*D@Q zpl_J@jUTlq~2aD5Ie6rIDM_)=<6;}R-eyI9PfrRbpJTrV{v9MP` z_!|?)3M^wXMjf9W_Ky1Th^muuO7W!HzSog0=p=FZ0P<)o7%r}0Hf}oz5L%f9StI3R zPx%xpjh%N~91-DN^Fwvy1(SMZT^j#iVAoT>KsnSox>Kj7Q@7&4YImC_h@Zk1mqP-< z@2AC%)l`OjoweXF@v>sm`cQ_nR8pRAv=~%N31D)reo}?gW`L ztlg{Vbo@z9LK*gMW1fHXo6gUZ6J&{17`dQVhp4~bWaZ+%dsHUfQb~tNSZ+JBFLWPh zbE8I&V_uD`&H<~i0lkIYAuMHrE-N-O*4VXQ8&6{&96fd zCJ}diN+{>LeDhd@(s=asuTL@+qTlWwJ<7@VcP5O-giyA zR5}_R`vMgSc(bil+H&!**^A{Zx6TT*+z69e3BhTh+I??9<*Xo!VRKkBEH#>F>PASH7jGGk#+N#!Dn#XMJj>u6O-qb|$n zNeua8dA)3z=>!t;`7AnKO3H{lyo++e_#4yxZ3HQKWe2JTB-=UD!HD~kg3G{QGw-Im z6u8F(hC13@UMFUVD|96x-l*6xP!Pw6gL2@8gHh2-N{tQX+e~J^AeiYIcY+NMkdP+u z!%1WI8)=bZ+clw62M8K~_cWfR6h6PanZ3Pi9^|PoSS*rP^003<>Kr(ndI?qes*-wK zP}9x10larn+!ib(!@x=e*%L zCuyf682*~~RUv0RAfbri#N$vUCdShrQL()DBmh?R#RgqA-AjG-5W~7Pzb!2wC{SUD zX=m>vpIY^!s-13^UkNO4u!AJH!~De$#LSEN#%z5$LQteYQ7RZE_KZ({dpMc-)Zh!m zK0$!;&-(w5kR~P$W|sd#W}{{18qfT&^N8hUf#}~|- z)o1dJF+!;hh;!*w8)CPG1?~z+Z=dVSmL>8#Z05M6L6A?jr3rpkMJ8*{^~dVu<@~At zE14*vnD?Mn$2b1H0cEB$S33pha4;61u4i@rs16{kB$KLM7jhxV16<*#kYqwEKiiBn6W70j z6*(W&{dF9k3r1v_%^8*3z#DGrGpYe+IR#lmt+M!pjDS?^zfzHz-wDADeFi02x%*SD z>9RwbW*-yB&Q0!>BU%HlymF_v3-#DU}+`{Hj;e z!quUs_A)d7Y&6dxu8tGMDE6G~l^G{vUX2sx*29I}V>I1I*eNo2)T zOreDmse{m*r5o)FfX1DWt>wii=$u&pWm^*+0g_Thd-zjoP{iLU37w&=s_3{je({Uy zhv9>z(g9~tuuhwb`WPF+I)PxwLg}-t-N|08m}A}s;VbQRN#UJgoSfa|ayo1~#8KvL z)lUYyY9)frxFu$<5V7V9w&TOy;0lD@^3MB5K`Q`Gu8_rG5Mw*qDp?J`F0#X4B8PEK zwR;Kb#jd$E@accWhjb*h16v!vT162-Pf9yLH?2*MR2ef(q~UI9r3c@goje zb0!6i2aS}iJf@`{*K8O+PDiL-wh>k-ahcEnjd|uRqFCll@+ad=URtZQM0G1O>Gd^r63%_A;=y(Uy#7kM}kA3vqcOJ5> zmR@a;7@{HpGzR1wC(NAjnP&|mR7{qxq-aWYgjsXMNwIej6>n6nNHBfUs>~W*;m<~Q zEe|I(qXwd;IFHr#s@YsB*j=G!s%1BrH47^sGI9djKa87vAZDDxU%E2T?@)gNI8DaP8g zr8)%FL(n|CQb~nlBKOXMb7un>hwP5P~;yYnDq=5Lmh}S0%ML9 z7VpVSLvg;dj5iym2!z>g&rMIS`*mbU-7w_5Fu}L>roTY!tmC7MeCTCtu|13k?3T78 zK3sJ1IVy_RCp@@H7AC98g`PFkY>yC%xgsmGb1!912ML+D`Es7$)OrF@ySrZ>w#~+8 zne`w3=(-)JUw^?vZ}kvK((Wp8MH?1dmY?cg)P+Vn}kn$NgJO85fLD2&_w3k;dK{;?TiWBJe8=Pv5<`%;frO!PM zEIl3nTsEWFg$GY#jO^Oj9J!vc7%Dla@_ok*07Ru^x=;uiDFd`Q((-ZD&)Obq{`dvX z=cQYvtNoQkt|(8MNUUj-Pf8I`q&QAyAcb62e(IDJ7b&3D14kg13n(+bi~aCkD<59| z0f-beuG=bC%}X0@e~`&uqv}|i@>aK1K*UTU38XC$#h@~GZBDuPS|eb- z$|9C`)OeI|R=yCQGDo4>YkNhIvoV`6l}9G~3Fot6W8s~Ytf=!a?+Ir4`P-D1);$F& z!(o5XM7?Q~8$Gk0%V_jU*NDtAy?4Xt(78$-;yNZ?7daVO(N87Ea zI82{sbc-zM>q^RVDAY!euXfH@+xKy}6agQU zXusXR4<&KsO9_SYT{e26P!9O(tIk_AjV|?p%jjoACqiA_4H^X0@|^u z?uqF?ttc6_vEHJ1itm2Vif!^|JOhvRKoLTGCMIdwWUM$9rJ_!UWOaE5%KKg(yrLhx zKH51Pg8$-XEnNY^K}T@8rDssrR!x?H7^eqN5{m08O%>S6H3S~M29MM)9qI6GgkUC; z?hT=R9;IF&s&VM?Z+B{a-Rk5tpfw(rtcOS^puw$bN?D;aNh zt>x+2lC&qTFY)i9_>LeeC@&N7Ly5&ClM;7|<#uDi;3v!<^+r-V^uUZ#!e&^~gQQdr z0>i$HURyN^FC5@N#D$_UI=3Y!>7_v!i1Nar0l1_H=JEIn)k_2lW2d@hmm#v_ns+JE z=1YN z+qUiQ-L`GpHh0^$ZQHi3*=J_X%*_`we?(o?RYg^;mANwWeO||T%1Wwcb=i^+>vzC> z)l;maCS$2z4p_N#8>J(kOFDNX#n(%eUQgD|1IRlYMlP@%=US^}IcBEu({zzQL?|r7 z4M3;vP=v0@bZB2T_C1128(;fVLUx-F6){BYG=E0Ct^26%6OtXkWS3Vg{RV(fV?X~K z*t#I5Q82b*3`>^)<-S$0tJM-vv=8PvA#Q^aoye&XU_WLC!)<7{i=oGjWYvF;vg6H+ zE;g~iwf=_ikLk*9B_t*0y~8DomkTB$a`aK4DT`$F&91*E500&RIs#td34KFNuW6?; zvSh7In4)+TbRT1aSpFx4;8?{{!dCNc;8(Q1qU@I+3gtIX-;=g_z+@@X0`@)vaH+mi zeONNbK{aNQf9k>a2-`?;v0^Bv41@%jzNtt=uA}vNQ{eQ^KfTo})M?52Eh zo2vFO?qz6(G}Cw#-Hy(+&(P)CZff&uj(QX3eFEG4*Ogmrg^I3(j)mI%;=Yg?AoDgt zAGzC*sov&qY67XVgcsw=BakXxy^gHk(=gm z`r{>>O!#7o38 z&S+sR5K)cud0Is$kafEruZ#;aa=_G0Sw;;rsF%S zr#>FeyVS4Q8JZu$ffY(c9wBaeF{H@E_w+8!&CJT}N~yMPk(1^=4Gj`8Jh+=I>JL6D zABz@DWk#x}$R~Lf%j4I#k7gVIfgXs^>vr~IZU3E;4tXU%x%$(!-=Yac4n|lSOv;G& z74hg^^THUd-0~s0`Vis;z>lPyIx1-9EH}ApOAz9~<-l7=FaUdhH^|ULUsF>I35_}O zsjH}d5pZV9&wTznJAlwJIJbMY`|YEh(s15?tWbP@k@M53G$DHU-KMB|o?y64=iox! z+4G=z6g&g}SH7_;^_xIf%y$$x2R*QjneYiw(wztX+Y^wDH*k5PWQVKV(SK8ox6gnX z?|NHxu)hFjP8u(YDz6C7GMf3Re=u3zAQK_g46K-l512A9h^4R{w0za8{IW%iq^Dy4q+)bi?uS(^$GH*+6|IswRsyWvN64jwCrefR9ETj; zFgphau~K-xs6Qszw(`27;|yS=ZEHfi+!-3OpNAYWqM$q^8d;g}#XXDE*;tDjhiD90 zpSpx9^IP%KnKl=J?xA!m((EzU@M9=V4KqB@t5O>6&p^?YHf*R+oodm2@3ph;Gn-o- z6&J9XU_pka!QhIV8-@84x*Oq^>aF43(eSOx$zWW1lj_nmTZvFY6s)MTiW-$X4+aFU7&u zYd&74!T^WN4ALv1NU&~ZI#WC{c|Q#9ZMP7Jn*>qf!3T1TMdb*dx-dIiUbm4e4>>rk z-vz#E6T+R1eK~59YLYJJ;+GP2kP7X2J~k*z{-X z!TbB$5Qwk%LT}>;Gtq;wnnPMHZi;W{FZ@{O&-T@;~dpS8T zA=-q0YM|q6Dmx7mSVc%e2i^ip2cxFUVuvfMTbRLGuz2(5I)$$vMLP_@2&Z#VzyhJA!GJ%S=2|F zMSz6MUpf}rfTPys~q{W{xJ$t*I_z@fWhTL?a+GmS>M7( ze1~t}`NZ1g;K|L)CO0XB)e>vs=m_OnPzBfWg{1F0@?`cNp;U8}SQ!EtDQvVkj)YPE zDYIh2n61ENE)SSfgZ27J49xS{0i^-840@%Fua`uN8a1kmfamD+2d3eH ziyuk{*Idk1Bq|5R<$md%RZljS$P}h+ZurOkcT-nKt?cPoBRh>|ip++d$fSrW&Ne*m z>d#BUZj%TG^$@i_mQ&+{ro}{6($q+ym>ek2ZVv-}TQ}$*{F9Kx6E)GnsyaXwp`oMY zIFJlcNdVNXy5ba%dc)|&&<~v*0%N%@0EdJDUxY|TL{#!%>Hko(HONL2rICl4F6=hC zhLqJ1XhevH*wEQP9T$_{@W)h?Z8P^zD;tC@qz%G0rm?YTu)RL^zv6bJCm=k}xYZi> zJCRVEy&{#r149TLSj>z8HsBW$2Rh<93a3G~Xbur0I<$CE7iEP=l&T`B`>~B8X~RR! z6%E&MIR%2GM;@=pP?9|xeWG9dIkfU$sn6zVQS32*S^Fo-b&P+v)F zf*+80CwS^PlXX%}`zp!05I#)o3HhhWJ#YeH;}gl{S%-DvdO$sT41JHzGjTpYkKw z8(rP!3b$$J@|qfzXE`DYkKlK39RP6a#}^?U3pR8Bw5LrzNhmN%bpGG1O5ZH@!As9_ zzVeIK)?1b5`kxLJc3vJNMf~1rOCF4^Mvj?)mQYokh-EeEd1-qZ-T1P<+T9%; zR9}_qgU4kVYOBlqd|y<4{9E*Cjl=S)F6?${jUhc&nVk;RVbjGQ3sdSz7xelk)5hO- zvwm8;S~TE`KbDHK==?&@avR(WiF-CgHnI_*)0{1e@ zGMSs6;*&_JN7_R-c!)~KRi+7{aY&v}8zX4J#))K0K}Esl0?soxOHBb$6yHN^5k&IZ ztF#5~uN(#LPQFObEg{4&;Rb93BmS%SDI)9qJItM_UT`;xNYB1WOg?LL3$FFkwO#+` zmD?KiCRDf$5<{i<=!~-Ac+U%Ev(zs|JffuqEmAD!m;>ZXs-=(Gs8@MmH$5uWPt5=I zP-2mapiV6QTb3&cKyDRiDrA;!TnX7>Y*W9Un%QQ?YLU~^y)5<@E{RndcuWoX(V`q8 z<7|IlkiF5fLoABq&XNb~phHikws!ZW{MVF6p#MC31z6`4WDgEZ$-K%X_Mclt&+Q-O1ac1_ZH+bvx_b)sYZ{1^d(!Vn`J(dOK+;+?OLLr({z zMNoMX@e}E?noF^L!^dYRU)75YZR8Z*y!7&qf4t)g(?4G(=QHav zP;nIW7;C@e88L##GUGg!#^`8?njTzQZ$!ogw{x}`x)wqnx|aSteQRJBEa^FS(!Pbz zd=rJ1y7<1Ok^Di-cGuGKS~x|lHc+Y8a6O@OzyfmX;J8K3G-noC674h>hNZx{eDBkx zdbeo-lPieoH;^VHaC6bt^D!b_qbFEBaZVi;EjV2W-FQat51iokQaob(nP&sG&8Z&! zu=Ie6nUsV%_+t$$*ic@YkCL-@$09A(+RyIdKqjh8!RzB}Y@0TaeBy->e$Fr23m~i* zbgo(7`Ad>@_FC@zp@o!Oot-eJr56uBHoG6-ostPZJlV>y`KJ~S4Hf)US!O*Rs;~8C zfh)WOfO+#r5(Ib%NZ03)7J}%y!=&qf?<_iptYuFllf;t`%r&709hke0e=4mr;|b_g z6XO9-G|W4jlb!3RQU3KP;;-r?Hy0Gn|Jn{$<$4%76MTr(feUAn*qy_y;$Xg%vsKL z`15GDkNBE+d%AP9k4xrxh&jFnz+BzmU(jgmtEL!y?J=9 z>XCr9Fbr@LV{IW!m5=9Ku%kieIe2k?c|4eTS@i4lqo@CV>w6D@v+8*nZk%867bAM@ z|HxUGS^i_}gY$n=iv9;crfs$VtJ3+;n?=nMB@jda%E;DXtL&P@;;$M$vjZFp7rp*X>XZkOS?p?ThVqltZFiHi=-cQ?MiyADzqm z6w$y!-C0u=^mNL$X+h7vy|0ZfAL9d3m{?^_dTQByha@yo*>8T9S&4x@xE9KtAr!4l?|Ow3W>29;wCVyp-m@P zaL^n(f#Bb01LhFxe8Oo!x%oh2K@p^2bj;vxA`ot8uRMu zwr?8~{8(AXTrx44m>V_%7JW5T zes`JKoi7+6mxBcyNV`VRRUccPQCvzdpt!TCk(Cp_@K7oAV_Hksd;XNN5L;0lz>PH? zxLj+ zt2XmcHCw)r+u3s3KF)SgExG{Hg~`TvNRs&s_INE{w{lH4K2znFb84IB%5){I&o&zu z+sn}k(#I*Z^xG))4ZWp-Ia$D_v?jxZ>E?1{8AQ^zl|6A+jugq+zNP?G#alPtoy~m$o_u+6;==mA z^JuL6V=ph4p@ORrw`%g;&rW+C3O;Nf&@jLNbI-9Ywx#09z_Fkcn7Udx!E^|JLb*NQ zP564j=|&)waYT?iiS4s~D#(vwAxgsQhF|kITZ|En`|7>$iJ9uDCNV0Mnq&Oilq7C&5L>(KOKHt>Gv6s zrvBGzXZ{nXC;{MooXTOdA;)x1!evZ$6HrJ1%_?dy zG12h(ygeL za#GE2O!+bpqh3$(XEkX zEBfJ{lc01+6hcs@UVr`G@F@B_gC1WBz#A zRF2jhwn*Gvzf2p-*B+b<8Ax6}BB$@Ui;0**5 zgaWwK3C&c_y<|x&Kmf5sAj<3nU)D)Dy-3WA_{J$sJ$O>vZ6Qjy66?hXQBs0TC9>AG zU&DrqNFWK}oG6k)Dfz>549R`1OiMLug^|;QZiG#B&N7XP95jFg)L!WT$N(9AhCUi6 zJEBn}Ml(B<doIvUIsmt{(hEuI% zeEjiFW*9tqQ>+~FqQ9A_O#CxELugJF0aQIZ>eT=*8!1=#6pOrNiu-uT#~8 zyD^VLBi8bM*?Qkg;Z!qzjXR3K%l$ML)|Uo~!4%dp7mt7ahOq_@@J2fHV%W1;>CDlFAq<`5hZp|}`KO+!3cAWP zk(7qF+Eg_aVGDC4!(n4v+MQWZONHWIlB*c@n5?_^Ld%}T1>M*p1Xcx|EkbgO1S0Eh zIC7mljN?v6blxHapmgBAZwEp9f(w_@ony@k_xu2VZ%5@{+5VwCv%u%5W}k*rztBVC%|bCahDx;bKWHM9G!ekD-QEJ zxhBqI?wFoMVHr0T5FPl*;#w3Z^uaAgll`~3=@qR`i&J{7kX#Umuz}{q1=vhf#-wOI zriQOKNtpfjotGlq3<-`73$M5{aWO4Q2;M zzBLr^Urv?azJ6QM95NPzxXegU+?fKmVCC6UlS`?6mVuyADaKS9SUHEe?d-Vw4&Z6y zuEUR2jM9FShLFb|s&PPob*c>Pk0=%Y`*Q5>EmciO;ra<~AFEEjyWY+&9q+1-^)pW} zm>Ij;n!f%&_^rVmEj1?zxDUarK_s7nV%&Sbd`-9oWkmo`G6XU?=~|Id z-Fp_{E=k@Oc9I1!>F^odUbNlrZrifF8Da`&x8*AoRK@R(H3fN>h2^dxtn^}gKkw#U zZF$`Ox}XU2SWf~DedNykFoX4N)vq=+LkSk3mBQnYSb7?uh#P8OMH7cTn^{dP;FMDv zvSkpBE}7?j+&JEROkXW`D2|eU5q)ms@|zgm;oeh6nl(ibA85G*mti++;5)A)`c_wV z%~zD9wQv$_uz`craqeZ&Kb38kuL)N|%x{Ks+mn4C%As?63e$KW)nKx(+f|rnk)X}lG(h0MP^)&Ewf2m%x^#H+Mk~7=vmEyarilZ5@pjVtH&0C zH)5WZE5E50sg_!PaCFq(5^L5t;EpmI6( zgXTJZ+uOYs+R}Ocp+ivO5Vb@w@P>7j-ai2*C&=@~HjMS<6nOQ6$5U}V?;6UG>kK*a&@7pDJ3 zOp1}Di>sUbZmfaW{kU5seCBZv=$~yO=L+u{yU-VQS)|4lFpz24!unR6qEFFICAtAp z-DYXSUNGfYn6je`v+B;pkVz_udbhPZAC8xLDJZRjacOtSWawaaILNg~rEALAf~7i} z=JKhx`VuYoUVBp_&-87?xUNNHq~;u^AaeU2%QA%0eWbcjr`#ff4Ykms;64zC5ej_5 zpv1eptmOhBqhJBFQz^$H6#OWcmJc7TU9Gx{1_LnKY}x>Tz&gQiA3793_L^3HO-f65 zggkI=%_Sth<_1j?CW)QmHr)DEcJngBYOL-$lZQb`Ef_}ZbZga zK~1xg8(|#uhBQbL33T~a)}ubdS-)_OR3j6a? zxD1wEdC@1l4N9RbWF9gpWD{R`WFAb%Re)5e?T z41KT6p>h2zvU?feZq%^ZZ?LK!x8^iXr(z!SAKq73yd)!OqJtt*qnUxD%?Y4(>@(y# z3ErPAOgd!v*9BCz2ym5Gp|pcX&g#6Pc!iG|I9~9Z(s6PDQ!G4ykTH9sIzI#1*M^gu z0BR;3M$U>$<>+_zW#}64GWAR>hv+@&cAT>h3u~gpaXJ2i1~kOVsv3COtW#R1qS!fL zfrerbFodGDtk(<+lPXm!VkkfW1A5ra(yM1yj~N24@$!IPknaF7?y>6ifW|YLj)hcd zhAs`tUSLO^isrWxB25ZpZ!+9(mX*$uNOsEh`*zoz+tY zvwL`^o8AJvX6!;gB_x>D^ZSmt)f_t-JxnO?VX)IUTSw{LY;QUIdSia^DbhxycVPS5 zcWxK9+n>g>3NJOf`L*cQG~Bfu&*JM(-%Wu3vU|tl|M?*=Lqg*n4LOZg3-F#qGBiYj znu1r!2YcS4%k96kPZw0L+%Wru>WV}HMsE&6{`$k#HKz5Irl8zi$>0HMUP z#%U5=0H&R1t7ke-OzgfX=wX0FfS^YGHyqsW5vSOfB#oO+HcD6QH~2#?g$8V^J#>D$wShu5B7| z(J2bNp|Cq2xXs6vgU3#7usP0+N^#ic!cHo4oayQH5sv;5YTJu5HdHY|Hc=Vfzm`Vs zH$n;EAXU{^V<54JOK2yYrBc$m~+!Cv_^u#W+O9TL zsUsBvpDvS^+$bf=_cPv)`AN1k&f=S?0$`Ce?#l(PvzxB=ihHr3!qXH{u4UWk{My5* zGO{*cr6yuR*a3=o8D+8^gD9~h^e6ZrAkp&-&HI5Z9EF>-TS2b=!;=skl}G?^D3TbT z;k)>1Cvbo1YsIVUcs1KQg2oEWB0~?~4Q-5;?F5SjgF`B0E{_36z`uz`}Xi z2-t{r(LjjzMyp9B1+vHozHeYNPAE5y&goOcmn3H0>Jh+t$`)(+u)gfpr!IpT3=5CR z|4|xl2Y*(e&ihL)E2%{4YdATKo7v0=Ksm~RonqRI0!sxO@xEA{|7N)@yShX_*X6(* zc=I-4vNA0RVHzOyb}h^-_%9GWYDGbtq`Bk4kw6WMiLO_ zda`%DiZ0DBWvKKx?j#{>U#5y|?&}4v*AL-~kGX0OKobmNJB$fQuz2t-D zLMkz=1UfY+xaeoj7713FW8=}*2BI8_g32}fT5-UQg6HOHICaIXWx?RPzQQ1KyRqX| zrn_(YkpWuowPUbcY##Ln1LnONT`Fo74a@^F+a!Yd6$5B_Iw6v#G6h5DXtMd2{fial`J49<87>Vw}OER zoZQcgtek-ZC?_Pcd5a5l@K;|pShdcO03T@qpatjfHxQz!xdKG%`WQ2=_M8@g{g(sL z=(s`ApPYp1MCqLd=+$v1ckS7ZH1ORQBc*tzX~!vk5u%7`S?RY9zVvOok_(xbQ8s^m zAK0thuRDP$@Ty_N@dc2$%ufXf*WH5R)hd^2s3#>TeIE=1kRprXvJe=q0tZ^o?g4xsv^Sj{$G zsv#B50h`x${?3KBV@Cdg7-=!d+5EKTASYK%Sd$RJWWbqIho}yxE*_1ee?t}}0inx? zU7_{dVVkLBv`K%g|CI}4SO;9?IPX5@LwbRN0BU2aQ&Y=rp2sf7{X(fs$QI!HF~(M< z4_zWd+Hq1UIWMOScGd!=b*@^m)QY9)2Z3qpFBN5rrZqL3*Q?-OYD32+S)@9wGQpZ_ zOV+}SorZA|o0rhlVx`+FwEYZi|GPi5tvG8R;KQU83fx>9iaI)EN+LH&U&>12ft6Rx zO3EooK(1+_@AMYJtU7n3I6bv#O$HT3ozE3AS(gXGin0T!inOIxcEzgwLR+EhZ~#EL zPUBF(Ckd79s&6P_8zG#{PE1qw}Q}H&KC5~ z>nTLU|A=aw|9gV^f6!R?H>>x*P&VDS zwF-7jNQxxS<9JZkQLdYKkp!r7!V5vx^K96fED{^GKR#jji6t>DYb^r%L7`9ak8eBn zp&VQy9G;$i`=2(C@jnVjiZN75CW?)5P|+H>;-J+Cn@2@R`RB!eDZR^WEl z?Z2)MY)=i>?x&+(r1CpVqk9c$KJ<1*9B+p7ZqAhQ=6(X{58z?#yWaVGXX*|iY?69M_eG>8?O_SN zQ=JxIEkN$Gv9gaq%h3P^VW-=F9{=2B{wc+*2*}wR3aeCb3;}TFm89XYQjmemW|iXmAjq`F*a9KXzOk%bj#{a1~xQI2i?i}KpfZYcrOds84)w_ z@IIEh;`iFT1r{@yCymc*Z$^WqHu71&Zd>`3{zbzeGohK~d28A^gd3=FI&k;G9x&e# zF4Q2zrL;QJo3JE!IiNLsldL6wMdzAHq_+R5v`D$POg-Le6?2&uW9`+N&oWQ}-q^c8 z8;h5+?{3gGlo!$K-E?z$-wEh4L#7B6QdAp$2xK9&BLf}9`Cv+sjy7in=mrys_J<>L-Ob6*!)f52nGT*Lz)wqtE>H34pSApn^;a%x^G|hV5M^A^m#~ z7|%uAUPGWqOFKPZ_*Vh%Nm1`(W-~I6lmv7w<5;D0tJN>ukbap`2aFqV5H(R!RzdId zH|H43q)I0qW|)TB;S2hA5um%NE6R4ii@+0f{w(}t$@k!LIqIO?Gp0&L>tkOw{ZE-b zjj*Voo}2n_M4y!#%h_f8FLeNIxT1koUJAyPvsqUUpNrYYM^Kr9Ex}9F+c^wq=o@O` zk;f$wi!YKXC>sp{45C)Fe|z;q(@4+OV&uA`<>=sX)A7Wn__`AHO|gHD*XBSJzX(N!jZU{j6vQdJeY-Yz@5A7Ce8Gs%Ch`u|W7GBGp#j{#OG z8q#)KVo3j>@(ArTA>l0R#*YcvD;pYu0OS%R#NgavXzQ64S;BIe#UmT~z0X9fnKC%^ zB>v0Gx1Qem&m{e15`kG!M@OF@HwVku)qyIbk_qQ~H-ux60+m#BNjz;#Pd?aly+yesu5jJC&z+vwv7v6$CU0T#R@XPaj?2%z|z;R=)cfdzXRJHp28NC%$|GRHq^0?zV2>2q=e^)Vf%(k}Z z4}LclfulC%V7I>M&fbP94%&`fvRm_ZdD>HoZ5R|Mw6McwpD9Ai{ORFl_w9gFV%W%9 zleU%_>ZeoK_-(qO*UeFh;d&e9YI}y$PB-|?Ah*H|v#*oHe+q}gx@Wq^Z!~YYjVv~V-;BWx$>rV0{dO`jNSCq{@65Q{Q(I4C)!XbGsI0>oSjza=b{du zObz3QCFl}c0!HJ3J3Xnm;Ih56xoDF{jgG=(?8C*qu8J$&*N7R_ND|k#!F4t>=R8jX zXfp4frNlJ#2xArAY4jn8b@7Ukqh6FQ==Rcs8Ogb7-Pik?dy8v!PR)0K*wVi0-B{D= zZ4q{mTrnTek@PbNsC#=pbuOQFpW9tS?S^D7Eh(;j-SHOfnYr6;e`EYKUn_ExP+9gMZyM^dx2U=mAQ6DTA*CSsJ zGL@oOAe6-`7y@;4K~R7@Ge@FsIA9$J`(fCL=;n?l(qg&|o^9R&wWlCT7(a~i26+E4 zGeZG>(-;yhFZ5k!z!1njctJBM+bF^a!8lt4sDv8|DH!9li5r4?M(NLklM~9X+==W# zuW|DSMjjX-f*sPSsFEQ{A7>-U%!T9r_EYUt7D->>n!s zhV30hi#wPVxv&6K1RXCZh4g6Khr=OanAfOI#l{;dYWxt!00pEdA2UMd#zL)p4OI({*Bs&E zK?n2ZN+${Ea}J#N;0kNXaFoIt^yR+H6^~7sZDcFLOSYY>wtY`Lpw)gTsT3U~gVp|r z))dun0|~>?kxs95+bBVj&YU8;sl0~JLqx?CRPo(}zj{WnAO2dVi}h#;ffKNJ)*eG6 za>&Z+n#_y{4FW;Z7&uPdYDuCxX_%z33km{+z9Y?vMFHTmDmjz_%zLZzZHUp}#{abF z$KQTK@t1A>bzCQ)V3RcE2U2-;JCG&-^xl-8b#ycrCfBGwu0gHPO9oe%?SPJUy>-l+ zh$0RE60-$D1|uwh|32qm6CIRw{!A39!;26>#2$GAXg112BpH8@M6?ep1CmL?)~eA< zM61iY>*r0Y)Ds^o5;=pVIc>E#1s^1`Aebru8D>RP$UkkKb2@4QaNIx&XZb>zf2j2* z{v=p*56xV;vBA$7mi2_5^R&A6mo3jpFli}# zgGl)q;$q{~&fqS$9uU>z@spwy%pa5`rq0z*D$~BDiMzXL-Z z5@G<+^d89ai;#P`V2mU@UM{_u!vfd$>$)$iTHl#E|N z0Xx0^Wo;@lC`4Nhh}8{OQ)$XOA4e!Xuzbm3UBXyO|+ni+f&z4U=&qEq`Px!br5 z^fV&>p_Zr&tHJq(65~>b2{zcwdH@j!Z!2VfAFr*bRiQp^gn!%#ykm2{R@j6SHV(Bn z>$Pgj4wjd~n6k`nHa=O;SJhzYugnsb%$Gs;=`K}U_%OX<>dc_s4Iviss^8!huIjo{ z#UX_t5UqRQfFn&d%_x^1IxO+R%T*knIHdsHK8l9kAFlU*FuH4f>InQBx}Sgh5`px+ z*#uS8A_;Wn_V6cvVm>IVHAsp9DvtRa+zve^k0y0|=ibYK`g=PwymJ-Pmk;tqD^HCS zZn9`q{*vbp?Oie6#6e-Okoa&%qS+jLUOhq|z$$b`f%}k_rlNtNjrP$p)xN#~)HFY2 zApm0Pe3E*3HtQ2nh{aLOpAd>1qk z7oEPaZ-5km*QbREzgH9*)$BfH2Kqylapy8QdE6&{gRRe`|46e~82%H)&GtW^! z+G;`kmu5}TCN~QQ?QO;hS2duPOmK-@CZ#wUN?su_;v>f|S^C`B$+LI#6N*o*R7`|X z0>qHb&BAXJ!<7bcba@cgjNseqdw(lu;zTmUJ-pd_`ALYTk3Ypv@I)s**lXka!tzOE z^nATu^QXh2z`HZfB$I&F?3UA$u}`h0I8@DU`eZQ6A>OK zB5O|&NH}WmS2By&YHm838$9Q@1EfQ`3y+(?if&J!Z}2X(#9umWyFG>%8p{O|_xF*w zr#Ne_af#6))4X#lj0p{t2f0g$7L?F}ea(VEt_p}VU)pZV*1b1k`nDn22sGdZ(z~Nc z#SF=q^1d6iJ`~evEYIkEy^^^jBz!cP4Fjp?U5E|@bfd)RgOfx8=hrQP>Rf#y5Y<1& zZgRcA#RPp7-h_j{GVgy2z&7Ld*XBMkgN!#>N^(N(LU_Lji6?>=%^v8!>9IAOb4Wm5pP9nxxnzTG)&roCbbt8}0_Z zP*e1uT%82f)Hrbv>=E`d21iUyj05l6y=SCA77sg&gvSpikM30>ii~8K(TH%i`n=6! z@WDGl(nULw>|*16W1^gYf%d8QL6q`PC2lg~`}}Nv_6uq~o8;{q=shvp+T83Fgg3RU z@fIi#W0vba4X*5U!mXNxEC3}^D|kf*f6tAGBtjWy6SEs9lk6yig%(pJ;5%z6!Soj` zwel9&m+j0VFGRx6H{66JUZk=iH}O<2>{CJn7a;`Yh;M2RdKN#I5|r#4mG#<-sI_p* zt!V(~|G-HhsGBHs#{&B^QA`Wdfn>6gO6A`SaOsfy+gz^m*D$c}JzM1`QAV%748)## z2sPT*Fz~w``EDRDNY0yqtk0fNf*G$89jUTJgBTH{r~@pn!2^pUr^84_r95L& z!dvJ0WkMMRcVaddaj_2+?s5g3D4x13VbVD))<3V0=fB*Gy9?$-(PrjPb0QKUiJxV$ zUitI0+d0%n`4Pi+JB(U7!D$aiIi9U%O(;7xLysJ1uH?Qd*U`LxU{V$~KXV$9G0Eb) ziL}~Lcp5pK9oylf96E!Ozg8ioc`Em9hA%lb#u$2RL%yu@J1H# zG3gI(s;CkSY)xoej5TX50Ba0w5IP;n7#>b z8d8FErQ}%)ES6#`)X*45%CAT;fAE8l4Fca@6aJ(7X7OGYgcG*|5-sO~ok?fTs5pDu z=WWeZ}0O?WI5`lZU7#s!15!bX z&e!>2^anLP_BLG!5EI4sKW20nkh%ET)|at+gAYj1q|LK^_A_(Gvg|QxdHQGo;0}0# zU(RsF@)Y)^4E(4ES7KeTWZ9OHheoc`Vwsv)84FUYeC&3K1oWt9r_BMS+XB^Xk5bly z%Rud)Rj4^&286uVT6ZO=fY#0K`aFK&y>?8E4j0JyErr)yb0V&vF9J3`1<0m>>$6cG zCPe*hTdPmHCr$gMKB0mx1o@2(Mgk3BG4wgmv2OG2^10{NbaK`CugJ{!A7xKQ4hF{m z=~PR##`ZsQ#Q(x5?QbSIqE{k4ck{AtXKvGJdda$anZF81M^B3pu_{I$@?P2D3kbyK zw0~aYf&dXf0PVro6%BhL($eXR%=VzS((Cn%FNk8IIV8~7-lA!uoDgXn7eX91X>GAZ z!S{<3HZn(9E^HGRrwPN7_jG{T9L@Lpw)3>$i*;mKu1oCzSg|JH>i&I21G>E@B>MqQ& zeP9LPftZ(>$Y4lq;(8x%7+!8V5zghFaCkBsBDneN=d&!MIKIU#VxQ3GK}$wBis=aI z3Ua!C?@5MwYrghu za}!q57rg6UszkNx3%c{F9_fE+S=NY>OaR-Rlxr z!1bXL$pEirwVJ|S_?Ee%51JexN3;_l`iSK&Bd4P41qrH}mmHj`)gt}u?5`P*##X)U zAwpD3ViTd(w37q1xdlCyQ~`qO&zrS_ju@muF>$%lz_dOJA`-M}b>{ac0La;Z3$py4 zK@g@2#FmZ(Q7v0Ne>UYg-dKTCP$DWPU`t?d7s9$n7Nkpsx{uugj_75%`$nu&i)*;l z7LB6q21`Z`_WYZ(5to)e6m)mj(xF+uZA5ui1WCxy#h1tE}umVd$8@yW(xLGSyJ?_)!(#n42>4 zi78@&L2~lYpZ(`v__vN2X%71eWRHQS*<#NIK?dMQ8<^I%T4ovspL40yidY(xyP91F zKNNA9B09GCry!?nIOU;*=&8`gu+x%3eg7V$K3lsbe1Jp#*K_Vo6FZkd1kGH0x1$*@ zfCY6gJttJlkU7}xp+z11Vo68vG)&zqb=00fjit}OZn>Gsnhu(5@ofbRsH%Kc79-76 zD4r_NZLwlFK&%hOUNlw0pVaC7#xl-qPNELb_PNU5?rH_$91xwwa`RTpg&nCi1Et=F z7bqwa2P4SwF#i(MQlNNL`Ta~=Q+dV!jp-@m@*JF#yyfohq)t>&5gCif(tPI`1xLrh zKEBukJlwW|UFIE3veO_{kfJ|CaZ_2s!QqiM1q%P3RMfG=CrUc0U1!GPSp}|*s15*V zGJqB1S9!m))U0~#pI2~#IY8*;JUga_VBBSRq4S;^z>3HJ!Pq}PSN8qkn{d>z?VQ-Q zZFOwhPRF*$<*VLzK?|)#`Id!jnul2evRZc2&IpK;rs~sKh z$k^IOa38B$H+ce@)IS{#Mz2tFFu(TR7B3eoVDeeJFS)0wsNgKoCzI25@6Y1zr1#SU zngT=797y7KB=W%#K6@+842Lo-QXxVPuanpo3J4l2b~Kl=sd6fXka0R(8vU^GQ*yjR zXFs|AXmbITfVeF1Q1MJ%q1?6m z*Lk~7k{v;3PQ-}(65Yeb;<0P^EckuL?=ijV!EIlhoeFPKXywYEYEO0 z5!^7k`oYqsvHl_^12c#aa>PA61s8SOZC>i~z0RTf%@duSg|{X9pV9hX!wc+e|2v@& zbIf*=?dGZm(W@-#tqxVvMv`7~9rdy*%u^~LKtBI7%-n&5Dn_AkdkYKxk?nldHV$Qs zkTcVpFxHj`|I=ewKB}f>+Q%*NNMRZ}$#ibfMHx~R60L~HES##Kg3AL#?|EQ|YM;nw zM#V)mBWU+4>r+7dt0?b0RFyrfCW{V=Wi3OM zxH<)Y!V-9jzZDd$qEz2KL7K#k6j_ywGb)obEk95VhdK3nI5J6Dqtan?f3C6lETbD{ z*2)Zg%>hTawz)pi0c3^=8eM?) zXaY)F0NnA2*sQx2GH2}a5%{O1U&K}A`mD?Xe)z94W56g)q~7=Ixz^g+0-Wwm`z?D$ zT?tBaMS2+<7?~tU;}xD`+A$+Gy6t9q-_xUiRe6o{n|HiEM#gutimmWF*ePX zv0KRp`YPgS#9a3V=Vz_p#gA~*L#F}`#E~%(k5hId&%Du2-Y~-m%Bz|wM%byCVwn#q z_Wvu9ali>_6Mc-Q56oI$tG~|OWN80r2{#^Cl-n00%^2b|e5k70VVtZDJu@4?e?Wt= z>b0K`S0IAnMQz|tnG#olGRiz{+${<(*CoINNQ#sY3_gYGY%`|fzq#WrNkUu{Nb0j% z80mVdvau-$J=)6fLZZR5_I1_Byw+aokd7tZ#^bds8P>2t3wZN z@y=2NMqhP6(9|3S7!3Yn&Y)jJ9&px{v7U%DY9j)H&?s;^?qjAgc7ee{lJIW)aO;O` zez+ut1q<;2`C;Hr4YNMq&pm5Plpb|z^5Bb#Y6MkkF{Odcd)*Co^k`>! za|t6HDS)sF4~ry==i=owmp@%>Lf|jfLV4)d)8upeHV*9<{w4G9e1brm4Xsm$?#%;A zF(jQi)sRs|$boBO>mJWr@;O*!GDB{lJd~aZ!boq|C$k+dc;rG*J1(jCM zb>YXWrq|IVeyeGQ8dxMReRU9)zoQlaz{-g2s+OD235aDVi|g;!5sP~xM1B|eF7rvP z*~nw6cO#OFC_UxKS4f^gckd|M?hQ?*TPc)n2X66-hfUAfa~)G&f)NF1wN@Oy)M<s0%FfQ?zuC3p zit|~lhnoxR{97TZdOYPiAr)Yl#k`EO4KN65ImK0zh*=Tsjg^e+KKk7apTStY&CohPmhNY_HIXU$U!7IBJ} zsT(1Gm@$fV*AtSMP#FnGvW|$Pd@3*?V4DaIOHRvLVLGnwa{x>;~oQojSRUVVk z3SB_Tdk?PPYAr^-KkB_2eD6&KX(qM>i=GT?+iUczE&o5$o0Le*_A63T7*)Qhs$SUY z>>=7x%T}C9r($jzi0EoIr%%%u{s`n?eh)urL!0;@9)OdBJv7m$uURj`=YNGJ(|>)B zva|iq?5QkuX{U`J_SC!D3B`r?i6fuMsiyaF!=R=|v4|7fdhEiGjt{EC2rYwDzS2qA ziuT0`xjo!`4Aq$GSRJ(3@x^v_YJ<9;B=B57G3myo(pvG~l2TG`UkJ3x(ABohSAO+9 znLe{&9Xp?<5tWs+i*;QgPI}YYY#6+8)*ojJTuqAsTZ6Z`2chhzd0-Qy2+)q-&6-0R>6$Fr-J>o;btqMoQvSNBY>m5zKCBA?ZOW;%Xn|D&=GNu zEw|gfVTt(og9trB{g^8`#~Dl86I>g zN_Nmevc#JmPP5=5BIZ-aJ``x4?k8SEKp!GJzNgaK)CAGDf8k6h?s_N zo<-{(`kF;Rr?MG?eKSj+#F&+!CP0yl^b7qOU+7FVGGn;79BJ+H#F zY_%#GCm%HPQk$Sgb*F>$3p07x`2@7R}HFqSzJi zn*fz;d0t4Ez_qvBjH<5n(@Hnu&Wy!g%uJ7vU_>W!Ia$LCYCMus_9@EPEd4_xfe0G( znqOiFc4c2rP>oOJQ?@>@+@)@GV=C17I|2}{_iHgc2v_BjIKVEGSXN})74)8gOVzQ)g{RAZnZ;I|vi^&L|e4V@i6}*4j9{e4{--+b=9nvXLgA{2Mz?xP#759RGAf z*dIw?xNXE!@z`>YPC77H$?J?EfaBoiz$x8C8~I5?muaPnHaU=7{SJjr4;C% z>C|w<;_lbW%$55$E2ikDHXl8U;N2Fc{=G-iaZWWU+)qMwY0Hl&i9)29j?XLu0*9_d zSrn-V{TG!XS&(Dni(p1si)!8r-L1RGV&UE5PXS(Mx3gS!IBe#Q4xiU~s?Ksu=ohVR z>P=CY7K$Ti9q9%*sv1#>rH)l(o#II0Ecihbrzr@xY!h`aSjx%NIU9EM!V?P=ZSB!Mc+!9B$4V$=tV4f}UX z_sxL4il!RDbvMH8fHrMA4@i4KK<}?B3|3H3FQi^}aLKbf$V8UOKn{DO92>2-B^UU3 zpLJYW&=euY(^ds5QiYtM_W_A8{$RLn^^%azoI8o)R*{*3wbx9!=itk6JCele%46Jl zi5JtPoSYi^uXf0dR8%*Gy`sF)gX>ISwNcM#f^}&lO$0|tR{dfmF^TYg3TVSUwqac3QPb3=_oQw zCjULEs5GnZ0TaALo8-nGKW=aJR=M*Z#>83(3#d@947kBKCzS$rR`G>izWUbseFZT9)nBW9YVFXVbC7VT zNZZIFQ)=kYps_*bx!!U(a2dPI-_@gOs!jHpb$(e<@yyQOZ`(AQhD0{BDNU(P2-}z$ zE;IMESl6Rj+$J}kzV=mpQCpJGbh+WOV`SJ|MPzSJ_?a!YLN~XG^k3R zoZj44GUMfZ-fdA+lN@ngX#2)o-XN-F*T3g+*z^N@D=BHgg zCJj-OPNSqpYDQxy$o3p5(oCtove?*OP4{><@fGhf7;diORcKjNl%C`UH|#w*n*K#s zRn;N9kmS7@G&R-Nw3GuYdMGF+%e2Q?$Y!1}vIaq%-mh)>U6J|*mso~LQFA+h)q5y1 zsTQ+lbj-FgkBj`%m~`*0nUJ$==j(ArJD5Xy7lP1 znCr^w1d6F>l5?LZI&GdhgM9lHZ&Xm0ZHdwVocw2ot>W`^hbz6gsvss5K$q-ty~YaA zKfWl3u7Fo|YVUCp;BC=H49^@T`M$FGgchK_FLa7I>Lgp>k!~LGkd^2?t=?E{=5O}5 z++RxiW!~!{&OFGB^OSKg%hs`U^$h$?Rwgi5u-S&0%*E~%i6U1A#|PilRTbN8*y4k>&NR%f1<| zHBS<|VN!0ze>m&5=E}Ay)o0r3T#H@aH$wE_3dgE1_){6^L=Fh9zNNS!2=Q-miZ=)B z%WMUyY#x-67R!TYA0D3#l56FgAJIZ`4k7gLP;{wUS2Tc zu_KT;90;pp8)j`Y$}O)ttaz-F4ea@2omlQ!)bXH9!T~tj}p2(rmS9#PWhW=q* z1NbH+1jaO~#j)*vrIBVVZ6(I`_9_Mri@Pgf*(O?yMY5&zhq>D?q#v%nz#)N69X%6C zH)Vqz@;IhuqP2Z3gswJEWwW7UU^F1_PXpJ*21}4iA7YklOI8aY!&Svd5Gy91GO8vn zE=Nh_SJh!!d#o+-igmFTBIe>wW?Omr2Z2r-dyXcKL* zMID0#8Bnq}=EbatGiI4ZV$IbsZZeb|ruhR7NDwDPO%t40vlvqnZlUl6{(|Rwi75jK zk!&PZ_A(+L1yW-U8;s3(Gq;Bt-gM@Tr66ep1I^6B)C!jWBQ2!M)tHncZHp3Op1I?s zAkvLvg2c^v22MMYf9su$7en(Es<9syn(C4g^Yb0PmA3!>hvY6o0Y~&MDhrmgI9we== z zV>~Iyaa$Ev2Q-zbD~&(%Ya!EA)-<=fVF=3KC;s8GtNlvt&>a&3ay5DvtM(Pa;&ZQw z9_I9SuY`mcK%lc6yl^&ll=0s=JrK~vJIZmBOa^y^6DK|XcCAmW-^mi&-PqSrGxJ%t z+ugAVOz5^xqsKn6Hjp)2t(kc&bwe1eiaP^8=R#PTw|BI>95bA$kto*W;3ex^${e~q z#mTWyhRTxXOE@>6`a7WM1Zny`+*kaqp`h@)q&n;)G8%e`oe7c>A4$dnHYLVJDI=kHLc+>mOVwYNjD)B44l8I5i(>^Q- z*_u(p;QY(;0g9DY)Hz?UM@bI(g5%Wqu2=uoK@uK4rcBy0tnsz77OXU1h)9ZQwA)T7 z+L#hf`|X2BtJY?9`%*`*|2DJ~n)AEd(N~aF$oSq8EUMTts8^pbArFku zORO{~I|UGDP|8IUEs^*wqJCnm=Hnb&f!sH}TRw{oq-xM7P;qdyqNoVbpg(y>EC6g3 z+uCgV6l!D_S`L+f%a9rfrip&?i=5~oiCUY_6<&RzFt&>W3lNmUxsdW(T}18{B$%3G zW427eO!>Rr{npn8w`K9aLYMi!x?Pr^$;kf|2B5b20|WTKk4;HW*a)~!`2wIw@ zm$uvGp6R{WS!`&~F%`vgwgjG7CPZ-C4~@UE6bsj%W)U{W&^wz););gKFU?zogSf9gro%kFpIkBu!HpjsLQ1X$V%jV_g%gFZt+l}N zY%Vtkd)CjEYV^%lFruT`0-tAIHN*H&IIkzw;t`g-YW@`Wj1cwK=q|hr^}oYAfBy=HSPWaZ2JosgXu$8&jG7K zE=}`sus^Cdeg|YQ6!@;2z*(nh@Z}fiW~}0(fbydID|;AS?{@!&5+E|jgy|QLG{f4! zvDCP;1+6|ztazj&yr2Uch{=V(VBnpI@5;3eyBt-iYmnVW@q4>cVE$_N8C6)>StnJ{ zxORS7NCZVRlScSBaX+kCecXL|=tw#E+)ypc-Hm*Tj7FVwr{D^oY*LshkRNKQ5g={~~?_D)L6Vil8~ zyQ$Gs>%=_dl`eoPUE5JHAsfCZ>NXQUe1#OVt`|qRq>sp>$9@hQ+saeRrJbn>V^ali z3KUuKb495id87{%$^}8nLe^8q?z{EHUaXLfT0!;{+Qrj6GsBpS5rhLbDumovJWhGSvlvsmp}s}yWnm2!V)2tigH)Q z8x|+L#&y1yjrKfHgMwP7bU`P4%5m>7*iBymfi&k^?m#PENskfaK+Ynby8iW>e7bV$ z0VtYEM;uox_}Yh zt{3}VuJI!YyG5!f5*A&=vq;BZ@Y86FtCr0^uk_X9c$Srpaw~Ls27xj1)k5blWcdVm zc-}c>L;qI)m>I+}*@7qNFRYq4z^(5*Dlgr{zanS_geQR@1xSLzSzwNs(tIqA1jv+H zoLbzhEOK45Jt?4Ky|mCbkGxI=m-Ff{6t#5R<@SJ}jFJXEwa7YUXot#Mj$kG}M4XA5 z>c?3=#BDS}?VEK0cbOV2{s7@tFhWR~8)Q`Unx&f8MzLg!eJ5!!J_>5cG-M|)kvkqQ zJ8y!jt2#sKZHaR$y|6hmqrRt|o826_!Y@XCZ`TRrwPwuek`$|=p&;}c8Zlr3M1-w! zUpX_#E@^141b4fYvU2ZW8^P!FoIWMEf|r=Jyw6uBZXLBRWGVPS<+GYt9;0w4ubsGc z;p;s;ZS6sNKeQH9Mry^|zgm9di3$Sm1B~ObO_C>@t+*y-ls=WelWAt=6)YFl-cW)# z!e5;^357k#7jcf1Q}sCf{g2c6Bp83`;+|4KZco)0;`LSq76Wk4n%ZwdBJof9pC`&Dt zAw&6x#ibY0gQX}571i#4H)0L!dzF+oA50@9d{aF@*mOnO&zENQ!tBT#t&uDbAEJ~8 zrQ;9hS3$9Szu=w8LoUobU2jY(NJ+3ccP#IEjjT=197LSh$UFTb!9+-*|N0fcFGcZR z$-we|LX~AqY|Wg_0Zcy<<^MGqs<0*;_u20F^zw+i>T2C?(m1EAZOD?!FAVmT;nQ&S zp%O5af+7lODij;GyFY(aEW0amrcw|r*wJDQbMg{D66Lm+8?lhv&&>>9pOnE!ZDT6t z$c`zZr2M#5qPeu+4t1?s^ghwnUELbPRI#p4KU@`&CNmkU=g{)XmM9zU^|r1GZrzQS zqobA%f}J31=K!fB3P+A?w?Ev=s{*Xa!Wcv|4cXIvZtV1%QV(pNUB3b%cAs`;kD zJQ>#d%p*i4@;##olcnrv7Sw`r}HS5)!)m$y` zu>JTGN-OOlD#Nc+ej+~RLQ>FK=lTMYwF>Lj6Kksa)@krxNmx9VI<7?os!P?jz`L4p zlHnO9*%>D#@Ru-Z?=?bhLlP*P++q*I7_Q#e={|X+bqD_n=Nd+FwODMIU7g4##fe44 zeYq7p_~)z4h+-4}(rTbm1r9(%Qg9Nu)<$o3OtS*Ks9YW(B$XlU#Q@4eCjPY!rBEb< zPVN(YoWd^_FJvO<`x1z9xw{J@d(;zJ*#E?Dxz;_@T)2HVu56RJrpO6`oTAh?>iZGT zt|Rn4P5t&MZ7?5XE*Q8P5wo0=#YzO~pLmwKg#nRr=pdIlG#AME;3!~r$pzO@O|x8= zycauKaUHlqkLtvX99leX7wusD6xXrlxg^^0@$@G|280GA$3nSQ(+7fJp7^mgJ*`f> z90ud1act-l+L1I$N;5x{j%wO5SQTiGEkB)QYH|kak-5#7$;@O;d`6|+R+lEL*>roy zejI^Zn2L%lEnYyX=wXOLa%iNFIal(Z>DZH%_TC z0iwiptNC~t2HqszhWD}Nufiq0(77!`U6WIa#J<1sNVBOtj?HCK=rHpo4HbC%;;#fH zC%;-3?pQ<+5}#uvS^VGItv4c2sPsFAmuyTzK_}Ab#$nNVt(8BQ_4_G}SrVNz6QEFW z@@IFMdtOb4XZ^MOHB3ZWK(PAoo#>1p)n7k>>9Qxe%oHF?y?SAvg<7inaAPkh&iV&= z4aN>YJa+1CRSxAruLEfVQA%MWG7K$^`7q~lueVP6)!VAz&=o@bYt@2@qKS zu{QU2Qre*vm$xL^fAr&fTZQm06SnbZz_M!J@>?V{-eT_H=_X=kF(CrD|9oh{+eSgDZc0@^a=z3|I=%?=xD*rOf0Rd1;S@?;t^Tg zD9uBB+_bHR1tDVnD_9VDRL(M!mn>DH3Ov3u8zcxA<7_7FlSA6E1ks_P%%7^$RX~Jc zX*LS8h7@}?uORjStT=+edyHuJW?X+7`Sw%d`mZ6pQG3Y%5D|i#IffVp@ zntz`Bf?Ec)#e!LL`@Y#mk~0iabwRwXOB?MbnqZ>!X#_Oh7W1m^Orh zUo2dtEw>f=IWn;>Xy3(TQ_b_aEd&CI5kv(rq6WS@cEFG%JtF{95#S0Zm-#%K;FZ1* zV`l%02;xjays(Hg860Pi4iqxW^>gEJn#x72w1>fh9#a=3jZWWZog|F@g&gzG?~IuB zckpx6xw0{InC2=>8Uu<{w60-pKPO9!H1h%Obk0L{E6{3$rkX?;S<-$GF$D$6|+pW3_DapmG|773UZ&4fh11mb!b*{%o1lsOjQM%HnDoBkU!SPIa~5ib+=Y<=+DaIlxz-pA zn{Gw9C1f5>gHXJ?0Qs2mnRxc;#2KDvFajZa z?CR1w*vp63XWUo!6SfyL(7a(AoaN??aVN8g+ZfFxXf8!?%2eKkShAVtf*yt$*f&Od zkL{ZV>W7twsF0Uxe``5LwCh5NHySAEk>s;~G=)1b7%jThHfHY8*yk|B>KzJ5w7yqu zzm$Yjt~&JsSFnx|N+Ak-3dM22-o(X&mb+d3E02)$Xc$8T={!exyP&7C&+LHIadRm` zve$pHDIX8GDUAGdx`#jB2~Lg@h}6Y88y$5r$@#xD%;p3>>hwaXwl_p{3*UQLA_Uq^ zE&gfeZY@>SwwRmytQ+Pn$@AKFW`QHjA@r}@M8%&^Byae7vfUD+)~cgvTcP+L!`I9Y z!x5jjW#0da_0HPn0wF&K5OJZgXQmg`)`sLHhSb+~oI;_|T$1HVzr3H1zT4>vUjB0r z^IxbtPL}_f@KdF(RkOi@_~X`IVGn4`;CcqjmdY!Y@N4A#otF$@w`68?Hc063^l)>Y zb}Lh#VvB&B>wWXmz>77rNv#^1r0)GKqaD4y!Rz@&C9P(nE+Sgr-l1ngG`Vk`G$e{y zw0LIQmQgD{p3?o!vg__dsBEVf$owN;ciAXNq?=<4S#(<6#27!1gaGU^Gq2y8=wV*GvdM|%oJ87-W? zxgzjKzl?}VGxl$slG7#XhSuMvSYo2!o*&0J$8R;+{C0vuvw95uBSPG`+58p=z|V-U zlOQ#EM}2m#ME=js@BQ(9S&E+dy_dg1ca%(0|010Oh~W#KT}vj3J$#{Y@wto+@y%AP z6?;uaX3-g6Y}5btS3ko4KWnQHNEi{w+Xwt--4N2lBS#M*N)BCSfg0o1&9Fjqr^}KC{PP;MFo1;cm+ESUxUx$+c+IuNE|P3? zh9_r?NW3YZgCkq*w_&nauVZGEFxL}dP(fjl&u?*?5~Lx~m1C9AufPf#bUK>JX@+^` zfGm@z15e0HRKmc3!j?9Z3tgP1P-%1`C|&(VQOR7s@n&{tatFU~)V{!{CEa<-BO(dTth8v5BJ~1RbvJJ#I9hSZnOkDE8@C-#O(DLa~^1gDro3&BPp0&uJu%v zRIc?G7UV|Hp%MliB@NU?(nT_0Z9KzCg}p#`6cCLRvX<+YtY+NC#T{!hp786a%riU5 zs|x9o(cK%WePKn1POm5{?S0s5;RGTsF)WWzXi#@)K1vAwh$$C&b1`M1&7;2k=)K40)Ri zt!f4MohPYS+mSLGv^rwE$HREcnPM*d4qwDtZtxwa_CVgD_FQiWW3iu1C}!X?)Z0I+ z|A<$5nJ(t2&mlMlOqkPYfU7bRrWPolUK_swG~4BzAkQ*Cg-WkT_LdpBH!_TPUXdC+ zJ<~-;PwAZ>cZh2Ol)&eo`&+?T&f7VV1lMFw7$LekBhqN&1!$IHp#aZzB?r5K14Gd6 zpa27c+_4s=9Ms|>I_$1xFp^{^xn?#y%rRSgzw*u}ptJ`JIj~=9%-SNg;6bchS_B{c zc3#t~Gkzt4Au{>NWIA=WP$&hnWKP8?7(7CdSJxS}jz)t8s4IVu3676q5hX}+GPbjx z0dP08Wwc8w*71kyVXq{%>1jRI^)qEpX;8_s zV%Iw`e!RRxP_ATsgAY%n6csfE^C2j}7!IL6-uw;(AhszdHtmw8+A6sw;*OtuquzZp zqku(sW9UvYwAZ-=Gp^87a0i1>RaWtdv9vLA&qhJE!^fQyVIXzA$9W7=*LYXExTFLV zPj2^Q_WjaKcBJCj^ZKyc!%qY1o;a^L2kU=jBOujm~BJSWxEEB zKVsM79c{125B`b+@mNX%mZ`QM;Ph@RVdzFl!85gEWAq(&+B)~veoSRX?-}GuzIRrm z%MJnF_eD$jsNb{Fy#bUwZtA8dvh=Rrf1WSwUb{6x{v+*~ng7q>-2YDv6x;u+fnxsQ zCH;?G_oC*yEzTH{_p;i&PpOdCE(TMkE##~W-z}-M*+))s7^oGI^6(lx+p^%urg29pI__k81Gra}#5RV)G zkk^yvyg@ZPD16Nj?m9>^{!kq*i*@wO@(bg^D-iP*BVG+=g(a;MyE~T#*Z#C#6*vSk zy{Zp9l2RXzMl!-phem{K9SA!9)?JZ$l&YDeQr_AsYKQhK)ND7YZBd`WF~Y1*=)fj< zfTBE%71>nI|4~|uqi9oGrv#TjKEQshu6PXE49yoNg_CFt7WPQn5H10Qu69wvAUX98 z#V@dacd&O-_x4M|VwaU(aCZIt6{;rw9Zk(H)F)Ik+xiwrrIS!n8)L%0}Fwy!-|0YaP zfs{*Z9b+#*rD5%BILV&2Czz_@;8S2#V)nKZ(JD>otPECQke`&?p{Fj%i~%$x06mbC zlbf4zD{Ln0Bnar6BBJN>lK@2O^n{dpc_Ug(PtND<)Iv~Jk@#W>Y`a;Oe0o~sHrXEp z@|b*!D+WVT7l64xz#hf{NTp{Gy)~GJrz@B9LLUlcw-dcBYrh^GxX9_=RDH?sESHN| zRxh(`r-V@V`6_%-mtF4|%T1rgBH4bg!d^O@x$JtWv=6+z4)_iT9*4?4;wWm{abIXm zy}ZwySI?2Lh!oU>l{oAR5qn)t+&gwXG%Z9o&Iv!UafTJNUE&OY?Is-c_9LE!ANj*2m)$Nx3%%dh=s^Rgm8b;|Uv zye;wapggr%uLFxsC2At$OuTeiTDUe%IV~<<<_3X70^|z9g5z?$FWOpc$T#G%^@_}e z(fYbaM@3eFec()2_s_n9U2rsM_{+kW#7N3Pp@M~-cg@+AGZ*HBAUB=Id7R<;k2v_c%N`B4-nrGd1BK40lpM z&EDoD6Cx7jB<2C0SYBMlQiUF;pV>P(Am#&SdW)r9Rb=&@T{?c3*>lUp=-LUTv{AtO z4nML98SO~Piv2HWBA%LSx&~c#l?CO^$HMXsUyRF#uLny8jw+nEDRX6659&&zxKbB| z7Rg+t5+Kc6h&h6b)k&l#!$nEf@^OpD&Ak$x^_b$4!gnkDpD+I>F^_-3TwG8mpL!>9 z*gStLT(JZ*<)rT#TaNbM`y{Fb4%_k6QW7njhmvAkcg9)sj$0j-5K+xDJvHLO3h%ig zv7ZW`>0$C|66r1(3RIJ6KOpq=a++6{LkCuu7ZR*C9d|q(EzD03Jy+DJNx^w67ytSkj#2@@9U1r@JB$$ z6AK25Nss25ojo}J2JYk;W*hMyYy5j9kze2i9jl=BC0O1eD7#K_FfY2oLCz>L?*BXJvuB#4AL#9b7nbB(X! zGrVlSx(>%{<;QtA1Qv*avERW??h1)RhzChM5FQAV5k%shTfIPc2EMfUQvXJ0W^T!? z`5HdSoTj)aO`e&qOaql_+dj$1FXi!>{=s4)<|4o%`4fc7neCH7BnxuYVEQk4;FN4< zpUyA#ytF||@*VafTLziJGgCoa2AR^*0l^mzDq+#lFHZ$vL~qgD^sGO}@%c*vIX;$%dOoP14L46+(E% zQceRYI%bLxWFpT{KRp22^7}Uyf}BF=q0B5X01-+m9#B*y7~(2eTv>3$^6q(hPyqYk zO6nL8fso8(pS@fctNQ6gR$`01Mr6XUoks~UiY-)(`9gKg4g2}gIqrqzih5$=+i#LhNrFZahj3|QS{o5?z7AhwUYUJQMOff<8IqhLDZG_?tsnVMN8e$-WQ%!#!D1!IgFKlQgT3Z|Qk z@fvy}DeW(v;AF}_EjMO-QoiF3it{&{RCoxg=t*QKpMf59 z`4HUs9$03sp+=uBgmlz`A$*tHdR2$RCA01f7h%l??7o2>fQvn3*T|N{#uriHFUm2- z(Jj9_Gl!30Aw4Uc_pv z>b|8YTjHT(kP}biQ(;3#NFKRS*dyd=GkbZMzJJS5kBJebDEL%9d0#b~ZDoI8Ae~eI z|HnR#h4ug3$NfJiPmG-Z56bR;AXw_eG9vT?P=lVoBG~7Fp=oJ{=0s#OSEE3ynvv0D z1but{X%@)+Y3sb!i4j6TWrOlQS0r6+NBxb`Cjwj^7=bML>u(z%O8Pg%N}dvAi)gZr z)zN)XC7kBFLiVt)nZJ7 z>!JkmLv`t+|5_9_#{a`{`u|@P4#xi-@Q1k?bHH-r-AxpW#b|@eUE&sCf&o>9$Usce z7#YWX>#TKPp71dF;KQp@?WmU+EczMe*ruIw?l@tNGIkP*nj3 zZosJUoF_=>5Icf07pjt=%+#GD>)SCO9^s20I%UqKxiJ&Eg#0qF z#fm-?5X1r!Bble*7p2;c+D;SpJ+LI(QlVT_w|Z&4-HM^f>RK+|((I!&a=(P^!@efY z9n+k5C<21yg)0W4>16*IG7a~h7FWn1v^l%tiri8mbPU*%^V*8i)lp{n5wJ2T))M#y zR+qbNw3NaH3=n&FskT!I8uzSbM0XLFo%80TX}4G*cx^2SFZ+j^x(d%^cFseB6~(V3 z#$1oK$eh2ye7*$0TAz_*Urxxx*=+Dc>FcE@-L_nI;yq>1qQo~rb}xa)WpN@hXsja{ z4>x6qGvi;`>kvf>uNbK67g|lV7H;t9GZ@=j-UK9OdO?&A(?R{W>#qed`nF*d=I%czPbl#?RZ11+HXXO&gr)z|YTg0Q$x~*GpS0excd%DU@=py|e2G z+aWzDzOh?5-+zM24k10SJz{E}o3|&|zhg-F@&JpU;o;~gBx>u3GAY0OyvwQ{M|tQ- zch9P@WO>&ept1YpjgfhI@*PVKYqqLc#zlz~K8(QTh#Y&(^OWV@NS1v#mb*}yXnWDf z9nZ{5C0?-K1StDaONJ^Y6qFko0IE_{C%t1PFOHHlkrfH**=q z;T9V*V1yRazeiYrGZ9c;n!6eQ=CSU=KV=k=Sn&{K32|Oz?7HU<1q}cRXms*v8|L0V z!2#=H$MJB!Po~l?2uw2{WEC|mEH&sr_-p%q8V0$8;5v(!O^VUF099U!jti;84@JLI zBxOU&uAV>vaz9iE;SR=l;Axv<6o*}_371`T2e+%sKv63J_=N!hh$M}6P(I6(LC!Q5 zObj<(e-#%oXC+Wv-PqJ`*wSF!t@QL6(#dQO6E?y0243+jF?(qbmcJ)$x-!?VwNszA zx&@{Hw|Xm-y&5C9H(0QcjopW`I2`i{*jzw7?jQ#coM6&?97tQg@FJM;l+y(wEN6$# z0c6Jankq>!MHR%0msAt?FPm1Yam^ul-Yxr;Q!qEV?VW^67wtd)rYrgzW4guDWi}EG zaF=op%jfd|V7EvWd-^clWB?EIt z-{@)pE|eV>_!_1lwRT+Hp0v3%7s$FCnGubfv>UEiIvt%hj-=a#a6IehkaO~j7a=$f zDgln9mdhI%PrGg(r@v{D<+EGJMaYDtt>VfNc5f9m$<@S2l!FUrQCAe0V1iig0lJay z`!Goacc1W4QIE;{Qq=LqhbF7g!}{TVh>rstVEV8g>ve1>F_7i6-4yfii^RE`fzrce z_+q*Q@1(T+<1%!laUu8^)vq(Zl$i4bB(eJWq}A6BCa@^<1F9d=>>-&Rl;_-`F%R)uG^*l~wwDfE|J2CnlZKWv*%quS$loY)5_&~5|JGaQYKFHnszF-+Z- z_EKyM0=w@viO;O`4MH>%hK7ci%b)vQ1T0p+5V5oKnFjK+e3Hfd@*AJEldmI;FC&tn z)TI~sQKP@b`7}(hg+vQxPP-~Pvqba&eKbfCA||;$W}p$JkL+P3&3AG3?$@Pc#CwLI ztS^DMYahrc^%*fAbxS?kn-0)_A8`Gz;Y*Jz2bOwJ6yD_U>Vz;9I=gbor?XDgO#xZGTAy?$7W*Jg};SN z=cp2iQh3Tw^4sBqeS!3kAaMRGXxaZOXqj36=P`sVHEE~)pTWKBn%OxE>uQOvj!V*Y zS2M0n?S!XUBda;!W15S;dsnLD!-qyoJk+@?gU=mvzCw542h_s-rb75$uyzm0=I2(th=$=#46Ny3W` zrJ;GCyC;nqfyK=^v7m6|RV>ge1^Xz7jHs{0JGl}r5H+GJGmSZ}G004BZx`YbxGN}T zOZgi*^DI+?*a+thtMzT=kt!mP&8FNK=iNip9KpFzzKoK6n?A#PW~ z=6ouxqlN>@G`W`GYIMW_$D3?wb9nAOlN(5MB7gl9i#iKugds|>32@4Rs$ar0#E7mo z@<&m2Iy05gD~*-6fFT?+hs1E7)0Hi%#|XJq8Z-FZGslT4j!iX}z()sq3%g&mF0q?g z_O!Uw5V6e~rFeST1L0?iS`&rk7qK17QXLZUFt<2Zjm#kw;LGy$kAH)>^r>5h%~n1z zmL=HB{KPud0}#|S`LC|1K zmp;JVp);_fI4UWm?^N>ZRX-e>W!af>JoucAVDfPziq5U8Q#-4>ZF3wUG?Mt=J^gIOd;q$bwqyT?B|KOV{+2`JIS>;T6yZ zgZ@R|F}mZvA*CW-0C8_Cc4E_+tPJUvhfICg$3xm_0U!RP0HUT^Lk@! zXYP$-G>Eq8DxFJlBVRaYzzE>xR$Xw1zZ|DNp`VEfu$?vqpE{4Usp&NgeNpY8v|w>0Z$pxGT>wv?Xd z(f)LO813QnR>;UmuDQ}d$8@QaBKg}&z;ABY^CNx%98kBxg$`^WP9Pt74K%fGfI zwrCpumtlRT{CZul;8>?|CZM(Z*CvY{_!@8rf9X)ca|$nUt6RdM0pif(s$^t}DP?-= zNj;@9nz#zv3u&%I7gel(x0JPCM~A1Awxx1v%CE_yDf<-kxvX^Pi8HIF*xLPS3BrRW z^|Yggo}q`-O9b!pw)U<@3%hfxgTS}q#YB*f2otG|tj;$X5 zp&IwZ%H}74?xc=EE_Zwv=Fq_1KxaMytLx6^GiHBTg|=1OXTOaag7Muq-`x=4wt>eX zZ~P&#sB;htX~s@0K_;w8P#+6q4-tQEa6hWf@2q3&ZdSM&|FL-xso&lu;eqSHFI)XA zvA1TuU&)hprIN=vp6y1dvEP|0PYV|bt4DQzsRPAN@I3mq?z1N+Ea}9*CTxES=VC+Q z3mSDb9j5(|V(7D|6ih8kTe`(HY7b(jJ)G@l6xF&oV(bM>n5GJ)REDgfB6HRQ4M{xF zC)nsfmIaJi&H_VA=8ByvomvN*KFg>0w>i`@MY<2$JbFteLO1dDIXS>0_rMF7h0fSK zj3vWuxo*2ykMolW+>GK7^kRCu^sHG@Wp2DD095Z0oEH|}1CjmrBTioXTI{mN!B#x2 zUNV`mpr(sga3a7>aqlZsvPI)#(H0Q7lzBCLtZB0hZJDxAPg7~r)BN^?y`dGx<&sts zvso-TtY`8fX4DdnSP>KBGS0y@B$YhvT-H>(lk5b=-TfG&oksrKO!%N;4a4oV1jOgA z1mw|gja9}cp<|AKF0-1_4{MZvlE3PmE7$rR0Xny*ed!OITS|9wl z=I=qhoHf!hvTX8iDcU-0Mj>c2YX$EBg{Z^Q6YrsUw%9MA<`d%45C<4LZ{&DGoVg8Y zUOsgJ-&Mq&iKE{_who9Irv&*kgxNwHzvJ4oFsz*r1zMRs_NiO=t?ej>!=1PgorgZYW3$Jtvrws z&i%AX?O-CpXEl#IPg6z@+r&r8n~XGhQ&k_6hm4rKlEN^io=m)u;{eX+{yau28tP4@OT zjvlo8xOpE%L|g4<+Yn zrl)AaH9qTvpRyfduRCg+oC3kLRTsceg*K3i?~2QcAN%b#xsI&_qtFn<2Gh9S98q16 zBRs6fr;METiw;4Xbkh0!*L^mCKC$RjCulbg+-xFGhvy6KDBY?P)e zY?Z7fp8KKCJnNwrx?O(2yfuXf`9iUvPzn)53%M2v7D_1984ZiIo-OoX@}NF;?c%*g zwgN)n_p?LPO0qSAy_<6G5DHI9p_=x0-hE-HTnUfF=d0oeomO*=8v2jJCE6YTre3z$ z{8hPonQM6(S(5U>yvD8mA&{w{{zT?aek?!CFsbNG<6RW@G}~{ zoX*{Dz6t$90f)a6L4ygy5W=r2+_G=y{4-SrB7mtI*8?ur*)rI?9QniOemdf^kFHN9 zuO#rNZ!XegNF8jVAqVCch_=Wv>_63Bu79wEGqe8t%R;5!()c@C=9_6z&)Lzc1mepH zAV{LfJ#|e|*gqwo0xlzhW*4sjJCV$~Z}Y%}RVk7$pEh#^s$bE+Wa#muiu*P*efXjX zHVX7|y_EJCW>L6QN?ScV=7a?3P zW^}RQ&1lRgGE&Pf>JwYv0B(};Azez{4RzRV;M{SP7mMoLMjvfRj@8o-e~_NL6Fh*W3^ zRHTquiq`aMq>V@nmo66t)4C#B)5)oE0U`5RHBH*8Zb z+FjZp@ZQf1erii~>bxH_rX1#ZjJ`;YiO!d*1De5P)Yyzy=qN6u9b7{z%QmGth|Xk6 z9V4+VWlQs?wioxF>(py@_boQo)dR0G4zCJf!N7uPL(g*vw!^#6Z!?s0yfch{Dx|$` z2%fQo_@x2VCfg$894MWTMZXVvZblV!Lkwpqx$_RRrFaUS+()?!3}{HUTya>q9lvdn zrM8AxW}*iZ3QL;f!iZdmZf?UgN$A$dI+8jji>p&Yq}5vEk|%^RSMkk*&A#taXBVDd zQ;47glV>5+V-cgpY_|~Djg(j#a0u{E@hfA=&?QI>h_U#P_?}W$E+TTo9G*e_ta*IF zha|?CZy;l$it)? zuL{IT;Aj;FuYKT^^FMVZZS8fIGbyfrOu;95_;r`&YC{U|VU=T)Y-S2r2`jx_(Smmv zkeN(AyqPX2ONXh!789I{_}qK(9=K}JXSgwzR)VQ!Lb0YEtF?qcI4hJdwO5kh{YrbH0L0HvT^FhgU-y^$%~4jh~_)| zD%>2d5Ykocqjy|O;2rH}(9`26>uD57nSJ10)sd6)Zg*}-QkcH(i;4Rq?00SBhuV&7 zS{n@AH1M!2FgeHvchJBZe)GT;C5$qh@l)&9*7-qG$CGJ{-zR#RIS{TnK|0{6V&!@$ zU#suZ4KpKV-}9!wnKt%1%ra}n$4ahrr|?4QNT_Vpzn3$Yk#vm7tj}VTbA<`znU}?8 zLR+0|i-iCd0~6b|S0+@Fi#Pkl23l3UnQu=AAu{WEk68;(uERF>w>TZyb-L|)d9Z|1 zLE;!FL*Jy6O>sYPbqbCiQ(>JjS=0FzAw-6HximkH@l1Zg1v29wr&($i3>X)cDCmia z=;SXTu8gnIf2!Kt|2WX#{MVa$O!bP*ZR=r@F@%35-R7&XabI* z;52L52(nHx^mVGoUXP!ms~S~ceFl?rj$EvG0zHMRW~|1^+YBqX`xkqAughivnULB! zCCNkHNsUC7chddG!dS=2LpHZ=Rizb-mel)zkEz4$=xyUuI=B$Wyg6SaFw?&_^3i!( z{g2nE^T)l@95EqGQ{k|+bz>rz=5yNCC)FNJ<%Q}?x*vcCYi)5-AI7d#tjVt{Rfn^x3ZitX1HeqxDvUn%B92N0dn{sA?k0`8?A&A8 zMO7m@j))l)T0VIHrg^pI8x3dYpHsm4Uhf==y;OO0y?%EE901Z?2Gg62|PLvw~= zv;fJex}|i2Kjg#i$s(_P&4$#))Q1$7(5d)BF58IA9nqxe_;MPE?;T%04862td04+j zwYp|IJ`)G}&t?W`v}QK_3;723X=wPNhSp{bR*{cJ#%kTBRGl4)x}U&HRke%LU=H|q z-1l#)!=w=-OmcgQy`J^CL>I&ygNmcUT;{7lLddX18(lrHjk{H2%i5zvPrWicVnP%9 z8feaVR5_5?l#207g|MDBl9h3mPtL%FII+f`SpEi1S4# z#^+yM`KcdSs_)W)U>9{&*v+g;opK@RP5Y4Yi3Y+c&RgrZ2n_2yp7vnc6M*x{E6%Ny zw-tre6$c%QSm{T`lG#M{(~TzkdgeAa=MIO+A2B2*;*k)P1Ximeco0qj=SE@Fk=kuW z9d;S-p%vuhhK&iTX#pvtkn{5~Bh*I>;6v2es_~x? z4BL-Sf;!TJwGbZK(t_6o#UIzy6am~wlPxfcSqXgI!UjQ{G{Em?!k2{fI#eTFmU|P8 zFB-h(i(4_`9_Zc4Rp6NhS*KjGLe)YN+v{P zXn4ej{Olf!z@K|8%v$rL^(ZU8PksRRTh8f(CvKtwpVv!g!el#vuhYb;zbGihzgwH1yLW4-&w@5BByj8pxkJ~~HpXiC z(`T%M+D#hxT7$&e8Aoc^-AvZMnaH0Ku2U#Y;^cGGf;|~Z<>c3qeYOoGL$^W_!2eCcLg730@{K4m|Bwbp!>wIijk$lLgy^6PV_6e@-U$_5@vbN2UIuV6!v*BRcN? zV*;(E{2!FL|F`d8eS_SBJPGAnS!C(0)3=?qQux{U@atIEZIaC;AMjib_`d-KHLzeRmw=ngV(!+$b=`+qs=fj7((Kk)^l?W zYut+OrrBnWNcNfx&q^!19#@aoZMEniqX&!#%<1-$mbP3whsjs%YII3-GIai0X#29t zW;NuMu4~UU&UFy8T%o@$KE@6AYZr9&FJUqb4B53Y+_nUqW_Gn;pNWO!M&^iTax%9) zXdpsSEK@vb8|J-q*Y&l%ldfcN20Waaiz*F`$h)=_O6Dq_pCwU6EaSb<2dKmKm7 z#E6OQBXT%TK#j%E!W86C3{9F8-O~wJ6zkiHcsAXxv4{T&Q);oi-dcPbR){RtBEBBP z_A`q>co!Jq4^kj-yf4{X#`S9Hsr&GPz^hF?nX()Oh(;&*P_8AmOe|Q0oHqswzL~+Q zw|2X}!0-YeymnC|bE81BzvdP+zlGxwLeT3954kqn1fdS68hV(V1>~8|)i`JOOf*hn zN;a(bMyrL0JdG9xB`EtH*+G+{G2RyHOVUq%IdL(TVTu^#VClt)8ya9gR2r{AHID1I zFQxD4gUeR5CyLOKh+~8YTmKlZEHM5~*hctZ>ok87^Fb%wS9Rz!SbLb=K*=6*DNIbu z5c9cdoGNU*^izR#J8y;Pk&b5Gau5QvCLw`ya8{hg$y6C#%<`%>P{AAkmBnuR<74oDedeDB$*(29Dn z4yWsa_5CT<+SM|fG6zTCKxC-N-M)=nCJ?6MbCc3BjvY}0*2W2LpFUfH&)qMRUv2DtFyzKz=|)`zBY9aK@>6=$rqE)^I-FOP%W+39xF z8ei#tL+WYN_%17~r3D!ZMYAXeQtpsUrbW{{&&Q9bVMXInUK0I=L36fdBimE(6eFYp zUSyP4W=5l$k50WdC@1U}nsArcF?;rW8x|VS3$$<4O+#NrLeVssWsWuz!>sl}5E&kR zmQZ-OcPkT7zno{3rQG1H=Y8^mfa-TMvOBVeByY&1O{Z>2YNzP zz`;}K8yYH^01xZ{`a>V1I;$vt-PJ$X?+GK;0}^@#?e=MEtgXgZ;wd-NXWEJzvdL)V%?M4)qQ2DJCKrC z=t&dc3Mrg=nMFc*F2MIoFQUPmhIYLzx^v^ykJqLaW6dLDXx?gaCmFlEo=M6ofN3kq zys+p#(Coo~3>Vb#tS80&!5pvxeu?nqL!;F5M?+Wb4i%lOB0xJh7;BVJEhtQ2(G8=IR*YXfO#?1`NSU$O^L3fJHc>gr?UVM5u7YWRCW$?Lgswo zLzsap1ed4up!P9{I;1JZ&E(gJhLBOQDB8#Hn~A5O3rvv<7>D9+{-kUJAPNh&LP>N% ze+)WtR+_H1Kyc4&*&sDy9*O}XM^rmuudoca0x?m7w;z`zGA?`^rr4=%kBsLjkJ50B z9&WHXccF?xMQ&hOHJ#X4*4Nw(cBmv6)cJ$BT`ug>4va@ixsuw>*8^wkO}#TDnti12Wk|xNF!nA9nwEru z;e9Aag?P-s`h(L>>VatOJRP+~a6hI$@3$$)Nboi;z3IkO&>@irX%rRUBiCF#>gN$McQrK8B4Be`ZwtM6oDs# zut3n)hU`1{psJN;iyC!s?#0#_lUtd4qaS$?e}t}_F-Ax-Ea@Wo;TQ#fclWL32~&{X zM!2ue0bEZ|6y^5|M!Dkj0EMI*>4_ggM2Rh{skLLo7_$3?ED@g}QK7BFw zA8`TO_aoCryt6?bmq=Wh!o|GY_x8ja%xaTrgf5BW;YM$m41rTZ|8!jbQ}PGb|BU4N z7k05&wLa(n1RlT9e$!h}!G%=F;%jw1=B1MrN)>pL4}eq?2AQQDfhv-|db;$K%2c@b zQ8Bur!#Bg*cIFuN<{UWRQy-2WrW6r7Vq`QTNMe`Psq`f}=rTsDthyrwMhGFdGYndy z${=eyzTp&|3LQhs4_AR{Q?s5a5mC^Y`oS$T(Ium1zK%HX$X$Wa(}B?z z^6jQFfMf@s6I(IpF?Wv>*DKNaB{@o6bKI{4(Bf0a~3$?efW4)FEgIKMJBx!13BoxpsMAL6ZjJg-wUB1ARA?8@p#IvLh zL5pTv?W!9L(-8U|*o-zs`I#;F1xzMpgH0~t-vAKNy3gYbnXPi{m z00Z5Rs|sC%p%AB9FEL;sxOhzhF9Oh|^Iw1QE;hFC*5KF3r7?182DAK^AuyMOmNd@b zwI2+$)d3}coE-X@`2)AlVAX$GV(S7QmWdN=w{Usoj97F@nW+!?*NtUF9o|6T*i04F z6hjG6Re@d9G`6Lb^3~L6Ovf{_QsBk4*f`hzsbvs=E(KN2|!~S*_zD&q2(sx} z`dV`5-|_zkseYt%1!{5q+u?P9y8RXCJ-lk{xxMHi-(?^l~ft{ggLh#@cZCZZ2}E_A1WK0V_@%jH6?cu2$JI~e1h!<0=f|q|XO7Wf&nhdqm0c2_V)y371n0O8c0GDI z?4#p$qK+Ho8i)^4LN$@a;Aj6lORvgx3=abig0o+SYMcEXA+JSq#Vtq8mv^gv@EjAZ+CRUW?6Pt;<>r;Z>}GGw`Do; zHwdm9a~aVYn9%smEcm{Gl~y+EwGHvr)15pL7lwjm=R@EC5{1%WpI7tFmjQpu8hlnL zWY{@c{JH6z+KG}RYJ<0o0CW=hJtK|hA?N{6cB|Ek>(ASPle&gInj{%Gli4;$a)@dc zgj^B}X=b3{gGxx@et%#vWFaLPF-kU8))s45@sKd!=#+&3XLz^E8ts!T$7`9+R>j(^ zc`HZ?G$gsVVMK+aAY2v>PZN>@MeOV=UEOCN=2VQN%O`+^hTX`x|4hEld2hDal~D>> zgUlBKNh&%4Nhyl6S*hCnEVk~x*>ur*hM8p{JlAcY>2#D;uzx)6WQ^$hQpssv#bzJm zq6pTD{DA}3Gu||No zNLHDy&lE`~G|mSM3-iRQ5-<%=-!`mJv6D$K6~m!*MHz*^X{;_L`*x-exw&@S!gd!89P_(C2z|AA}0YXcw;k7RX5K z#-J6MW;%+FC>hdh!v)+@ylRicTPRy(t2aJm2cXyX+QD(h)B_8X92?9rv#oKI?XqYQ zKTG^9^kR1zeB#<9*aF-|Vw4VIK*^@sk?C>PMg!EX$8j01?@49sLO5RdU`8XRR*OLk z<@UBYD|V3u-XHn#1OrJNopE=NO1q<@I5BIm3_!mWaYoi(V3j4GXgBOZ{nNrcHOx55 zGur`Z$;$-iIS-5uY-4UQ%#Oe$o=o+?aFRlbCi9!o{KL)~v6V|DP<@Znh=fP7i#AFl zTRbuQ%8D*-n0FwKU=4%SGISavgS8M^CX%kM8#+hI9(FA1tpM(KiI1O08!Dnh1cE{y^IKay4WD zV0_k=T-&u`;OzrC;NvxlA^~vEDiu3Z_j6Tns9ashtw@P#pO$bV5y9&*@U>_o1e^y* z!l(QV=G)Xcbxtw6otRUOUhs1L;Pkej{fs*DlKXgQr1wwIY3#jSS$N>}=2l(6GpiAR zKqQp!jT4-BW}8-L9;?ERktOHNT}+Wcu~1qBEh<=6m7dDW7+qxk*NlBZn|JfaxtEp? z&YDoXb^cls-)nsBIa>n3w-LI)epB`77yl0?k_9KqZVvjiSckzelJ=+suV$DT?vr4| zKv|s)@bE9))6S+;>+p;uT3~DOZW9^3i1LBQN&2+vX~M4jBF=oeB3a*>q`RVb2UwiG z`3%dUr6wx!YCeX>?vzQ?FYi0DObh5&T^+n6CBW0IwZk;#>OEW@SSx=KX5&*R+rgyT zrC<@NCr*xkhi}0cN?-wjG31$@B?ehAlvZaaJd995tu`VB{R&rdT{1@PZ5+r2gKhy3 zU-^uV%y7(c*Ux(cb};aT%eR&Z;;YuZZalJ`i`vFbA>QTcArwH`wWiE{j5Dl5m1YP=VeRDedhPLG+g zY{*K*8={hhyeEmNjF{S`_*i(`*JUbKM6X!?JkdwS^&YFsK&Sp4*FW1TR9#IU<#M|r z8|io>!R1&7dj(b6J*HQ1Tc9trA)I2XFzr6b`?;{P0 zW!5<5cB)tM=l!z~h(aSLl`Dd)7z*`=`#e@cMo;6i`adu63r@>K^~PZl>f$#o{|cl- zlx)e*0LO1nvbue`PPK_D?F{Yu2iz=p3Z}`Z^rxI|8Jg8iWk+iLFw|@7%*?z29c(W= zTz*KlzE%#1`Kl3O28)@!$4jsqGqKfRq#TAg1;3{0mg?`ID7)xj4}0?M^QdI!`+ci~ zP!U?lUEX^C;&;s-AAtD-3HKNT5#I1ZgWxR`hC9{KQ$r~4&%pEk{$%vz-w~wNd(8$$ zKjX1X10$uGll)$%=e0OW&-*Vgdk(pmod=dQlpF=Jh62PfU(F|z+ug5#;>z-W(huJo zXC@*C6B{BvzW;rZmzm{X2NDfw>#E{*{6{}r@0YmKyJq7$2%$g$D~t;r+R+~iuQb+} z@ZCCR)tGs{MJ%wQmrR_bDUJS}rtIm{P#13d1-u5PBfLKGX$&B@FwPc~zG zNKS|N$mNc@vz4!&PE5I}@9VDKRIaUrc4Pr3$!`>M__5RztO$k>vef8vb43lQd1{@t zQz|~Kh4hkT%&lr++k%U+wRZdqr0Sd&R#~Z*zHCzqE>>Fkl@iN&Mk7~W9xj)Lt7ohV zS_~g|X;my$c>VIhG6yc(>+@{h2P1}Z+}Nv``5CuyDuvg~VDWsVwSx6bx>R@ED2$KKP<*=o*{G2Z}jc{&B?*tP}NDh;B+3{^_8ObdmGoO!N5%5u8SCDvjf zA)^Tn zC&Se$mW#p>dhL*rdUQI$Hios9v|`Gj8?;F?T_YoBlHIvEUjv|+T&f*}ytxyLD*F}~ z)F%SIojW^&6KuPu-@I^9$1&F_4nTy6T5BfEfX|qW*SaTN-K(p%H(s6g*#Qe>aNXX< z=?Aa)MVu#{)DsD(Q=EsbP60&iK{0OT(xr%2eFscvX|GOT2#tns4+w$q#im?G`yV5BB*8;NmP2z`Sd>n zCV%(5>-`Wh`E21aJtplhf;mwjh^+^qmODP2mD$Q>W%WaIf}|y!$2ygFCQoG4zgsQO z`#9!!24Y+)_dXWXP)pqU(3sHRw#-dU3${6bRG#3EN4R4Y*I{ON zkaLlkj8lr#U4;JPBe4f>SoS^fi-)Vd5U$fr0q_iX&UB%$inkm=1!n~zVsJd|?syp@ zM;jV)B4r8wvCO*IHZ$C{^%{N1TI%38{@740neb zy68SS+u*QL9_R2A#W}sX=(`gVnPy#d+5LT;7JBjT4P}<7FYdIi-J*~h2a83f)^5}( zrGG0uVN61yY;s!dzEwwVP|&QgO{-z#8E>qEeUI%9?M=q}956`rx$PLj*^DiHQFVw90f zI-=|DD?%FMri;BXC2h)bZL64^a|68WZs@t=Si6v(GsU(Ma?<7g&i*~RiwqgCWJ8#& zEv0zHkG#x?^8^RiO|F&F+{0u;e`tBI?l}r9O`9^pfci$@)w1l40hj75j;Z(S9V4hy zh|Km0=#)*!J5a&CYDAu1|1SPSVc|bs<#H>Bowq4uB-_Dw?GGy3)k9P#FDZ8FA;&gW zSD-f;uAyU`p)YfCt{vpf{Tre(Eil>oJZ7MXo}azyo;Y=sQ+sb%%D+ikv))@KiNNJ< zm(3xxD@t^8GguGp`Z$4aPjFvfId@iKUJ;{NCa=1g8V}c>lA-zy9@%3ma3m}mitXR)hg@Q;UjVuT9+(As#e`vM z2^~dR`>)pRz~o2Oa$@};Qz@?4I0>7$Rka2fwN17{$wt|Gm#}UtxTi1%%Bh7H+rR6~ z_3hX{d{uU0!NRAd+=r9te(Kp?WUD_IHf<~x?}mD)k#_{jYF(L(L(Q zyIv21X87f2eT&H?t(p}1ti2YN&2-^>OjYqP;W!_rp^mM`KmlkO*7#E!08ZxGwBkhF zJJ9Sf6&Z8wDSPMg>wS9(l-(yIYNI-B^LVctg|Aby`jQYBlS&tf80>_d*lE0*M|=r= zek9u?00f!(-r^s`2^;%=A8!1=C?uRL|4Y0ub8~b5TM9|Hj()r@JCfhGcp?4GMG!x- zpGZR{pe6(YJtqKEEs%mT3)3vTPEYfd$GYXlIY!aZ)}{H|m6FpXeq`kCG$mR|Dk%Cu z2`V7^=TU$-$l`hMPrWV)=vB1ffT}%39jcn=WIUVcS=z#=n(M$2iU4TE=KVcz`#4Qo zt4#erGKOi$j^wp-75GD_9&EPbZy};cnc(vqG zZJy)_^=Isl_S^*S(mERn5WkmR+t?ElP2lMiDDc5YE%f^lP`k{i%}69U_$Cg{a70lg zIgnDPp!)?gJ37^fE6@50^eT+uUB-B#T;zn(#E5Cz!@anGSIR1JI zaa1w@54}QnbX3m5%m68#dxxry;)elc<+2m|n)xQu8W^2McbL@w-fq=&>y#tlmb3j5H7UV-UQ15N16 zgV5^J0;SnQfEo*q;LUY}E?OY}U43m@_IKvGcAYBLfnN?sA+9qGIBA22nM=vtp$-}n zVH;U$@dIH*6Iw5+No5R_v;)XulfzTdeHb2PrO&z0nKB$Y>9y=56B3~dpuQhP{|BDU zZOJ&TKT*#{xGMk(cdz6XmmIu?fH$~Z`C`ySyt@=1p?VXy6b+2VgI`!|@wfM*UCSqp zUcFBMjNs1)MZvFNDewUt)K;H|%er2J8iBX-k|J$6pml&xPj@HuOkUW7OMC#*wxK72 z#!m7+C?2Bl0pa!1YxvnkHfDCVBl413%)yL*c3WA!O}o53)k!H>4Ew9;}B%&~j&`#Vz9UxG2$CQPJ#m z5^ZAhh^A@NAQZ5?C|Z9}>f15uJnmTq&CZd2Y6#A6ySJ6QAgCcuLmM1qx+q*;r^s;# z{K0ni9vvpIjxRrw(wMsivoS+pX8|lDqG3m=A5oQI*fy$~6?;dIhqloVIM5=#h&TAT zR@pXNRW+e?BNdE9Rveumswn#DC4eO1$-DI$e%@Sqqq@Z169Hn81bkk7WT0YFNbsj* zA)`8!b3h~b&6|x0wI|cKfAA(*uc5NUPK~j-Cs>P-l=9R>XwX^E1ENlHO=?)tpi2R` zZ`vFAQZMm`1}fg8-7O>GIBTooT~R20d5IYGn;6=1Dj7ydL6vgs=nujbnNv4#*_l>| zXv{yw^0~^!o;6eK7{_|#}J>kk`o3_qxj5tu9=0i_U@^?* zqG$C&fN)TKBM}HwkmQeB!MRzLbIgP-=9ko1cC7s;WvjL47)d06vxZq?#SkB=#N$M_ zmN48hT6P|9l%4EaU?#rt#F(nVWfR{^Dpnq589?LUBk4_y_8Uacg(PCT=77qa=V=(m z@rH-qT%c(|p7Ph(L9FQn(*_{X49?F=%t_o}0cV9Zuk^>IPCGNJycnRd0Gna(wHE#}QwaJ;4WS{AZ@**JLp(qi9FW^zZ-vz#Xt8Ob9W6YC|-_nPHEzB$yLT z2&Dzl{nv*Bo`f@@TF?%J|MO)j=ohFqWFvwZ{-_7)st7C8@lmchk_bOz3#3cGT&Ohk z(1YB%EH&f$-ZSE+_?#EV1?NxdLTt{f@R^0hiKhwdzH#OkuCxzE74%`Il;{2mHnU@! zx1u5ZeaI-9Y{T=S@$79tU}h+unk7bSIfh5?Xa{HC$U;AW0*QX@3lr_p+X3u2W2!86 zR2D%5i^qAB8KjtH439L;Ol0=KqMK7h_I@^_v5<}@xM1@;n@}s#evQ;w#~Fh)cIxYC zA{SmRnA&X~V!F{N>QD1N|1cyjRxu<`h&8DI-f#c`X=3O<2nddU+Gnz`e1H9yn6hr| zZACk)bGX(h{QDjMqO?<}`~fZFM;54~ARTqb4YJk}L~+5mP= zuB)cyrm#zUe&5c_<>;`R_Tlf81X}5#Dr5K+ZcE3W(*^fh{I4IK!+gWtyG7TM{gDTw z;k*t4j0#&ZpAo3hEU}w)C36|Fvr^1BO;J>ZjsU}Rl8xULjj}9kM;6@6{#gQoL!U_$ zVPhoOlNVFoDDLEL)N0FG7<66d`uxlIRUkh%x*+c7S3Yl`7^<`$=e9D3r*mZ|)*hEU z0ZSBmpo?IZhoS1+d2X><7Z|b^A!*ldeUEowmqQ0=y0Dz=@@<$r+DPQfHoZ(wOME+I z9?`voHp`tuKzruBSvr6VaVE+}qyd$&pDIVklHKjh z0vVi|EI3SXxJbLu$jTMx+rwQA_I1?got&z8Pphj8G%UWJtaoK+zia_E6{|$^PEZr~ z&Z{dp33x~M2m$3sOACJCgspxMMS}na*RIY*x8B><+>4NMC9yQz5tawM0;cY^2LUh` znJN>>FOv9l!>-GGKo8ZOgH=8>xImqIvjf2&hD}iq%YjFAAtH|3^Yl~?#MU0bI!Gp5 z2VE1Z<@}0jF#qmB&io+nesJaaVDoTD|2j6pjd8EI73L1~RyM>O*ADw1i2`0G!`ayJ zAFh@~nCjTx@#B~Fyi&>G>X|R|+3r!K=rPR$MnWc+Wp9rAAoi@rPDdI&i}E@<80q|m z?A_gv%iwRKW6UwwBgOII;H?T@E34gcl+dZpkRB4J$kl4-e2A{kB-h;QAc739Q5g-1Pyr@P1@B5bRan%gIHl0_WYgI|#n4;b+de`b&%)MfpQ^p<$M6q4iKRKHkP*B>YtHhgR)Q-a)Ey;%>9wGUpbSM_(qiF{l%pkrPnvzM;6Q5BVl9Evs}xz zSe#KEVg8=RjlD1(!vwPWw_$F^SKHq}2Ir2RsF2x=qR$Atdz6lZ;|Wrc&o-nWQ!@zL z`?>y}1^ej4AD& zX%^un5E>%%!n}9@GdbLXEQiH0*W2+oX`ypfDCF4>Lgp7e7=r~NX zgvaPp@?4@v$0$RQ$NXSd4Ez?gy1M{(eu3kn@x2AQ(n&uDzt}>868P$ULs)I6Z1U&U zUi%Y)Cx|yj=T7L(bv)N^94iRA(dMRwCq)*Cj)Fv` z+!1gO7fXayY&YFh_J1XOV!P)Io;>}b-8F8?B|t27|7y!A z8IhQZ*C&{z0?8|@ugCm>$&=w)@$Q(tP-yX}%0AjWFu6@S*g=1Mz{wgjOiq^iqzO)D zq-;Mx<4$qzqjqK>ZrpXCkx)@#VIaoBYolt6F7HlnP=;?V{7l9|Bb|URstaWS zhFOzW#Rj9F6`xcY@>t)^do4*4!xsr-E~$!=Q0sRPDdkF`slvnZ$))L8jxQ5k3hp3` zeWXvq@fFt#tuks$jn@g9RxAr}{QOa;Q!u)pBIxx(^@mKLM&z6Kf~~qze+Dl)WtDV% z3=%cyyM8CwL2#CVM>#akA6CKO)PKm5k~`d6LW8;J@fMtdMMQ?Ke1=2-$x zW2_c+P-rbG(!*q*A9XQ{8N>9RccLC{6iQy4?us9Ey$iYyoDQl`AJh~m`U585JVElVYiT`&g=O~pt*u22xJi%Is_$4-;{(D8|-eAS_*o3p3sgEVUAd6&x-x1IJ_ z82E>05UcFPo8y&zuTRvWA&9}sJ<00SOR}YKMePzdmz~q<3J?FM8x9fg^{>9$;Cgm+ zyfz_%%|h7An+%jB!jY_)l^a@G;ru&1Wz_v@8iZl3nci%3g)m{^e zEWv;-DE4f9p&&v1???^vrJ5fW28#6kx(F{e;VK8nRzhwb4n0P=zuqA5j2%{q!AMP} zNRM&$M7-sZa*~6iEFFlmUEMsh;pti_^$$Y@1B`cEKbl>^$Yl;3wLiqoM-a3Gc}iGi z3jeH4xr)AvdjuZb(-Gw&UWs{Seq3JIZBd?@C+$@{=q~j=_m>c*YDwxAd}+C`alI{@ zJ77KrgpWf@U>ADbkcCPq|9bIzN8HEdmxc5}{I2%AgK@z?HtT5joljsd_^b1l-3y!Z z92hqJ>ibLp%hftEb_PAqg`po&+iKcq=VP-$V6`V z`A(=sx(l3b^}p-B8QbsUcilA7Eo1n3>V@eo_@9yW6NSN!EpJ+rFT=&=zC3h8h(<~k zxUxloLIv&=cphjrZ+>3`i`ieGY2MMQ|D<`ocQ^mnMu(Z3>0jUKuF+cmkB94fnS7F% ztHA_({g+eMeZIu)Z)B=jnLMEpN*dFVIJuPJ?X1HU1IEIX3SiQe&lE^jZ?wsBh5=0h zBiZrxNZqr9Kfjm93tuuhrj#!=`DIg#B3Y{>M)JkXK;aXrR=#PW%r@ZFm`0S~x9P&P zZ*>+5ud!pTxBVs=vK~{T{)@C>Ki7d*p3p=eTA1~91NGYQV=hZ9gY}Y(Th&tc<)r2! zuBXgVS8MSmftsb7>d7f$!1VSUu40)UQ=a5~l{l|LAGoqobq{M;D;#FdZ-xGvnMvog zJ3J;wS_f~gxyQ2l=J^11w8=GZ_WLsJSqxsO8zz(Bk$nQexu^p*vlmQaltjwQ9n1{H zG7>bpXl{2b#rJhXO;PyWQADWN`pUo9m>r28 zdT4r6wHD#Nf6NEx*>Hj1g_^d{Bz=JFu^Y)y-i&xHb~$s)BDjx7h>ooX+vPln!%@TJ zf?+=js@>Jk$|ObM99^>rrdp~hC4roUfe4;6s7$gIxl6?@o44z#wBc-apU4D-j~l;3 ziETKJc?Pe?vf`^qK(7<51P@t^jVU}b15%2y#%{8TPM*m;@^f!?+<4haquFo(r?ad4 z{HWPfLMrCWNOGL9&Y;i3!2K&!y-(}ecTdgHIY-7&M)Cs-|AVu446?0lwgtQL#f(@P>(`8!D|2R!XXF^Y9ex?Ocp;-W zN1UyH=}gZ1HMjDgLskfK!P07`c*y&2)_$cZHg9D;N98>)$GI8p`%B*^N7!F3vO~dv zdlU?>=s?dKHka^5Ti7@uVmPmO(;IV5dWqSL}L(!-6^7(2ikRjO=QWL)CSRdLU<5%*(PBDP5?tM z<5Kq{JU?@T&rMR-zBE0%0+}*mFulcYCq9>4Rm`M%b545eQV_+HSBj6(4Tx;X&qb{TmjG2 ziDs0X0CVB;A9{SVF#G)0%!Wf7_uT0bZgbkk^=l$jhQ0&MvvJ%644~@}Z;WyHJi6$< z7f1hsojuX9%*E)Ay_NQbV0I@8K6!t;-S{5nGh7@po_1jHqOP8O~3 z6LXi0P77eAFZ@BEAMjmtBZ9YVx>wI8$^<=ABo&e#&o&`kwY&uJzWb2(DRtg`OEVw& zjPFMRS4#V3KF|EOBo{!Kb5;m_k?q=Z)k0Fz=%~1BR9StCR`!MWZcq6w!lE-ZIML-SI z!6J5eESLK41>SrTUl>SAD7clH4!B?#w(cd;%KC7glIG!OzYeg4Iw=wm1#+)aP*dldgvkqRrrC+OQu6=mzuEUU`pfN*st#>>YT1dw(=HX{@bdGMScatKefa*FI z=}c}cy5-cGvGQ_bs>+r8J?;hF5VVFrlk)D??RJZ(af+zp^3UoA=Q_hGC)K3rGlI`B zr3*LucMNBP*Ml#ga6w12xc~er1v;BDT#F7#gW>A7fRoJ-CL&ce5eQPabA9y zIT*Ho_Mv03uPlS<$gyS1ex(mda~lt$_SAoz(bT#FgrSRto)dk4fN70T{wPQBo;BZX zT`6s#1@o?DWZso6u(CSSn7zM!QxyRF+G+mtRM}=G>vHF2A@GaKNol?_S0D0bDAh;j zGb=KJVr`mV+|J!$(zroQ$tTnh;k-nI>w>^R`1A~xLYi97x_=f`3(1nklg@hyG}Whh z<3cRWX>$p^<*SBCb|I$$nk-RFQEx{!PUr4QqSv^kOwT+rLg@yg>if?Io?zKHR7v1j zZUwxX2m)tJ2fA={zwSiK19iFmh>iALU~ETopR+i+`!=SRU-)i`1JK6lql=#p>811G z(qfD~FcJFD(w-i$dvXJZWZWl?K9BsjsCvO{JmF3i3JCup zz1{0eVLOXDfJ=s5bg$i=etvX4+pTd=+Z?)wR|6>H&LsGo(pn!81E`-C7$1{kXQymX z0#JP38_B{2pHzC&TI-W6#x7rCK{^#eNwAcMs_EqF-XfOYSictFi}W8}Iu{7@O0!KY z9vT!jkp|C6>pYy9zR>owfA3D!+0u@jS{Ww9tAt&x5xNUrt(?vuDqt?aqh$N3wWpJe zQWZ0p5qe`TM`^q7j9aHMq}{811I+gUYyHFfoAtjb1N={i9vlq+&!GnsGdtVAjcI7= z*lD#R`aIX}{yhpwWB#Cv25rDD*2xDABmrFq^SD{BR8tp+vMzDZecO1(ky3MYT|w$L zfhD<-*e8V#yLT{k_kkJb_-iyK)>WnuT`E$5rN2yDv4kuEsch>vd|>cy%!t$)r%J3rOu|D}0!7Mr29zdc`HLw}V!J#|fD!|?fEO`l zM7s_w-ZJ&cnoYB%*ASf5X)73V$N?U6cG2l5y1&PU0a(nOdveu%p3I;CCo8x@szSXe z98wN63lSbt3qn^GAxs|W7C+p`0fEYIhRmK62wsz+4umgW7Vu)X-SS{XkcoV>+1pvLvF>HN_WpX-W1&ij*CSj#INh2snR z#oEmz(;J(}>++p`xgxbiC9R7M=w(0KI9}m`2`2ciM1zQnp+9^bJUkeCz90S_keN}d zdOR}rygwb4eg9ZFJUdQ0?Rr$CIFlZdhr(+QGg z8Tn=Ha>o$)O*0w*vCZZNJD0sX3jfVFJHHJZ z{x^&4@p)88w{|UkE!va!r@MMV%gwt#)n5kczvvoGOr{R+tnD>c1 z)Ww_r6aJ|xUOn3I5H1W;ktfcuglwPV*v%6H!jU39?&vN!6M(%IHS2bOKc-pct)eIl z4E>lMTM^k>&?@6V5y4NPPOcNniuX=ZpZAEj$A-I$=ZOa-5#dUX=Y|L;AaoPB@zp<@ z(nc{UZp2Js3e0HW-bJ|1n`9S+L`*k@U?tW)QG@`-MHXH6!G$17oft)oc9u>sR%Dxj zKp@uG!dvPeONPfve*yry1IYpt2Y`7Lk64dfzyuDDkHf_f<0>|e!+L}RF2_F^bx?j; zC)Ohv62(YnuAO>_^ZSA>*sjZJesgwt{Mr))dV;4GF}>Rz@CniZVvq3&Le#dNU*uG0 zI$Kz0Pbc+VoUZRL_&uEyq=?smy}+uTpvvMbWV)7QS;kbnFXK%PBgv7ZI|V6eTXuv% zzEz9*?AX1|lI6Vyl~(6-Ldx9+QMdtbd{c+$+o!xxb^iF81sc62Q>)v>vam6HInwpL z?x)*dDPMZc_-fePZm<$5cb{qN*!bn_)6=%*I==4ar=?9Z)1$SMd8BbsF(TvmdUk;& zKlnmw4bE2E)jv>uF3D4U+K%c9p*7(|e&I*esNg2#(n!#l-?(c=I61)Mlw($NKk1U& zer0N!yrC-rkagoSabO!f^NC9V4q*R#0EiN)=AI51cLzjn z<(j9jnBp-!D|Tqh%wiBL5%8rV$j9N-C?krmxgVxO)-zWoPdE=xle(@L6$HlQAwYP2 zZokzUrclK$0xp7BrioSd6=72k-u|Kk1hH2K+@W#XVE%OEbsvI@vEG_debcA_kTy31 zO!a+p;ed?R_6FSqZUdOzaZus9th`Z@{zz_j?;kc2uhKEhe56Q(%tE|;q#ignX_{CT zDY=iARzO{er)_PTFH zVc$fAg38M`yEs6YsI+5oMi>>4JClfKfj%b369C3VK@W0C6wHTAKA=DNFKi&uj|$B8 z#Y8;X{-~v4UWo%J0)T^mw*p+T52KciugrbDc~2zn|GI%EJ+&>ebKK;Ty-)WSuL^R3 zPqaubvaTLmCS-DhH%>>@J29NqSFW?G8`W31PXEq-pmeE>Md5j!hP}h1YLi=n6e8O} zKF89Iis?aSYEW{%TkZLSZ(CCSZ9^@32;ZudIQa>g@s7;&Om2K7Kem|{&jW3Ob~GK< zkx&htDjH(fQ!hK~xxQxl8*f!d9^C13>?3eVi?hz_IsBtG1$cCu7irw+`l0bJHEKn( zLUA7#^(S^JI^5~Lz)t=*U${jRKPKn>w$J$q$?vC}ywtN)PbYjr*uuDr(?Ui?8MUW z{_*_3N;C}31B?tR%+v!7Yz&H!5=tR!G%YNP zk#N^;rnYb!fG;cp`aj(i`#%tTIT-)%yMm$@v#@qHaU`G@vo>%x5iv2cGd6+ZNH z2uPl16@mzuPV2nxY3y~1>cb(h-x4mFnHk(ZL?s7s3I{pV=K%f%Aje@W6S#-6`P6%6 z@xt-K`H@QB(KQeb2$&*&XbB30haRurpoDOGoHP>#YF%iJj*#SK=Uhz{fquWeBsY%Z>+H+HZ@_apZ27*Ygi7)hI7I5982vAoPY z0qnJK4qJp0*HGV4Md#*B5soa`!WxC{B(_D*kV;D#Sd6}t80CSIb@W0f11t?5b54YO zKM45DYqCXUoZr%U%@i%kr*$*exT5+e;5ukD_OXa1fr8xp93iH*w(0-c<~y zV4UHQ(#!^`a*S8;8RtG55|mbw+l^{pmR+F-bOV%tg;poeu!|V* zEmPkd$9&ZLSY%qsgH5)0pWQaQ2XO47^C=~MBoc?w zJ7WOo11j%$|0(x0q#@JhOz2re74ZN!QJ{GM#8%DhC6pDDv&e~SNHm0(Sk>UKOWCZ- zmhFS}A)|%FX0{iPbcIG;GyxY^CRQV@*Enbmz^te)DnqlEmu51fyT}#znx`bwU zV2uy^Zr|^RDTWzK7(gX;XwB-+4-G`*aX`ffmi=W>cwsL*Pv8ZT=|Ccp%?xf#60kt` zT9!+*$5D9uM8qj`7oKnsgV?YSP(I$Dz!)N)-!Bg1tyJp2v5MWX<@7OyxZ1&TLKR0etUTxcMihh}+xCh8BJ^of# zeQi+nwl0YL^M|y30f>sW1d_^sCEfwB0hfj|WK@xaJ?Jp-;Sr0VM;y3G;ZfLRU(lVO zlTPigm+`*4>Wt&ES$Y;*quphlu2s5t4B)&S%UE9vRaiVg_8*{4hP$gu-v z9SsfT4MIgE9mj5#ay;D@iOI%w~r8t*SILOPQ0W zn*?$|h3=vbyrmYi-YznMw+{k2R-(#M1rdskloR4En;c~B8)U@SgT|eI=Eto^En47B z8(K4PoPI2^tOm{}71-nWOQJ=SI>%J^66tn(oc)Rgp4sHIj^5m7J($*D1y3692a0Fz zgKh?y)JaDqcgg&YgI4LSJU#e6ueTn~cA#YG>6I5e>3wEJrk9H_tP)RWkuSn!_2kEx z_~v6DK6iON?6bmK8-sD_IrnU0TR&?q+B_gYN$AOz zpnqDRt$oE+w)|WOMVCQ5g`nRwmz3?#tpkAw0&&46pgJ{4m%y6?-cHx1!5bT=8%nf< z8zK-$(`!fuIH>7G16VQvB84*T^P=^A!EdAvwEIt`hxMOadl^|+{#~%>GE@3L1k3!d zUs1Wp1g362PpYA<(N5}bXmubeX}N(O7)aJ!zI;y2XhP5^RT@^dMd9Rtem3H#>`ggH z9**!HdU*RjkJD}k@1c?Lz@-pQW6bc31PqQCX#fiUV9R%}jP?=+RoN?UnvED?-EsQtywkmt9OO4}AP;qh-GL2L%z(i>JXF0 zh#+RQP_H@}8c{J8X6??qEDAZ17tw%<5gH0c-4BkHdwQSJF8~>ilvZ_*MvOR*MSMFh zHTtX9a<9K}EIl{WB%NFltGL8VfSc}?zb4}{7&NpP;7)TqORRshmIOP@n_U2# zL8Qls)(|*nSKV0j^t?+=Eb68EnJS*+iX?LZ22@7EDsvB=C?-o8#^8{_8e%{M$k*J)7`ZNis=h#2`zQY~2wt$!$NL%UDrhNz{B_2`vw8lAa((};) z(Ec9Xz0r5(cW7ZHf{4N#D1r^)Mb2MMK1PaQCh5TzYeLe2HiNOBT2+LdEAw%U9@o`+ zuV|^IhyH{LP%hM)f?e*76FA0-CpwAqmA}l@E094CG)_F$`5%`3-)3^36n;-`!KpXQ z@5pGUCOO7Wn{N3{eEOywSVs=N;kA8fl#OHhzw!SfB4}Dg<0*+Lvuv(AbD=CAnO6%x?OiiRcl7ax#?=%>VY8l!axH=l2NJc!dGD{N^iD_SKFnB$dJ5$J}7 z=yj1_*?a(uPD~Brat;ADo;LY}8COL?BXdzC5yr~>djA{9koTC)ZhMuQBF4~84c7JP z5kW`VZ5ICMq82m}L**THMH=IJN+yo*_;(W$@1St?Nv^JIDB9G2ez>#v^bu%BC6*}1 zF*(mznSbiexNO?OUtuc?ie${U5HeYey%0sffrCVO$;}s+{{uWlE-B(4Dj6H|zcx|- z6D-cj{{O<_|Dpf&pP&EpoYSo(8;8@1*nM5Q%h+zOu1AA}0P_Nz1tI}3xZEGH8)QTe zL>#&tZ`}9#>@l2?Sx;K*mOuFPnJEFbr&j9wSvTODFL)q3vTqq0?i6;dYThNvBv)6mr3w*=>)mfs#OY zD*8TSA*+zBa}wsugItGU4Ij=-vVW`*(V-Bs{#@dKO)w9r5?@dAfTQ;Y^m+K}611D9 zQXNZcy0BS)6Qg*(9SX!gXm#s|sCx{oq7)-|6Jbkghd=(#{xC;u$P4CR2W+`%L4yWL zIRm(JDH4!pSf+DztJB;xW1+MnykfW29HUXJ?J!m?VmC&}%hj)FaDQ%eWL;n|&8_R9 z3e=!v_oHFcEJgt-J1k{={QLm-D8ITGX>EFiy|ZIb=YWwTRZLpTi4JRd{M zpt=OwH&|=R2OL^TIv+gN{XQJpK|cJ^r~Mvlh|Uuy$&s@kZ>k&Q5kW_^gvGM{W@2}{-VJLSI#wLf=UmcN>d!7YCY~`% zdMj(iNOF@dIqfQ|OD;JMPgQ3r4C*DZ9;7gtjZofeE;-z6pyZbw(~~MYJIU{(E7yOb z&=2kLx3R?SV>-eH5xFAT!tV7iyg&NN2h;5EdcWWHbUakx^n4xk;OOyveblCb^uCUd z!Mk3r^x)mXW(Ys_9y?q2lF|-32i4&1@clgQKL%Fo^A%?c6^>*tUQ*aIJjb= zceP|5wy>i|=;j@6>{h~z95wL0b@0`GpBK$}y(93Nc0u_(FEH`@e7+&h>*8M5_BGbj zDjOLaC&jQ-NF0vewo<2S8MVey7G?m z3E{48ds*zFssV8C$6D!jtr~>b;?r@xb>aLty*)Gv;QZV(yI>!A;13Pi1Ow>@G;~tw zjt!T=C|d`pRLkrE9C*PL*xk*##RU1dB-sWkXaz@%&Fah(WEq65uYmLdLy&75n$C=$ zt30{NoYf^>lt3^=?eE*p)UT9s1`FW7YDyz>{$(n%gKUNbNa|9iZjgX9;)l}q1>0ah+c5%{J}@FbVJXD5Y`My&c3iex zK+z#piK7{c+~{iC$iVoSJ{DAuDTs~`o04EGvJTW0f+7zv6bSa}4Ny?bhTqkFrkf1Y z$zy+9a)GnjmWhvixf(FPU?_&HgdH8l0<>hYudAWm!J$eierPovJ_)=*bO`4IUK^O8 zohn9KlIYfrVDBSD5*$S3bC&(O`_U9JIWB^T@9@1RM1g*nUO9^*0Tjv)KZaV*9{1gf zyKHl8bQB=IMR7TbG9wA;=m@Zc3^UyV`ou659`R~XR}WNEQaA`pv@pG$i|DY6$84|< z2IQN%5R757-v?3pd4GrKw!-is8{UA4F6`r!O_J`WzU7&Q$zz`-OLv3$GmX#27u=QT za~Gq?ANM8CUfP`!xpIrAC6vraDwq=&F)2NY4-yi^rSSe&U?!DI=}~%+k@&9x`FQ_Q z9#%5!bf~d#qruwA+D#Ud5^hEt|R{1Y0ekL zVI&45jyjp>NMw#WYm}+-qC=$NMV?9^L~19ZZtKwtc{MZnn^DpE<^Us(TIQV?o*l8He~2eduZ(k#E)QTY^q1O3)Gp= zj1fDVA#iDGYd{Ja6guM19rf@quGHDI{kBJa#A@b z5Uyi(kgiPBy#Waty!RF!nfVe6pwbr*_1iL!s%KpB4|9I}OS}L&3YA0mbuiIdKMYkO zt~XP8yzAf?*$aD~Vl_~ltd$YW3MBD6dug{IMvYPnbR=F=$7KwVWZLh-X5>iydpGca z;;L%L9%Kli-6c2S02ZU!TReE=kRL6dM7X)_RcK(qW&+6cxNumT^4T$BL3z zj)|e!#f0P*W0V=nOl8J$G+o zvw>vn{dEF`JYyL<54a=(=s$}((;ylOr6djLk+Cds`&FP!)%mA5<{UjAag|v^myIWe zL#>O_!^;bhJF<$#f<+-od}&Co0lk~;<}#eNV4aJ2^hp9`Yu6)>^+|AF`Fhgl$HApM*Zw0Ezcz3-b)GOGC4}R&188po^%C1 z(34PykpH1;Wani6-^q}i3>^QfDf~Ae`Abb{yDR~OADadH=#sj%=b}+n*~w_qNrF?5{Vvk&zL9z%Y&>K~9ncQ!}@o>#VH|#MyML**5IHsq2}d{wdlbu%GeQ zBAN{BXZ$r~_>b`ygLC9_Y2fL2n(fQtCejSwk@tudUDb zPh0)X+7$43|JlP6>5h`Ryi#8a7iWWTH4Sa4kJ@L z1)g}aa)2Znk#ULS-2J&iSWP@0e3ogoDk{r8WMDG5qXH+ZuPyV#lwbz=)Mpxd8czuX zHYx`oY!zeo$KK?JFRMCeCBZ$S!9-^9zyXCora*wDui2}6n~ze@L|(4# z2Svh@dJqohCGy8A(@~m?LsDk3gq#*`?FZ2%0D*=Gwu27gXzU6#UiWGPQ06pdiPz~03l@mikCa)PKb<|rr3q{tB#13x zEZqAcsYjW+G?b|;F_dMw=vr7?x?iv7H7IIM=NIJ(m;J85AD(=oexGR7#opvQtTCwZ z-FPU^yVK6kc9O|<`8Q3QYRPXR?t9K}6I$G-T4B9Aa$!0MrKJ16m4P>-DlnU@CInnm z)UkELQ`KL3R|khLwp9wx@zJ6&bJyX_v<^7$OUDgv3dzR)3d-y{sGG{o>9yqO}F(O{jc=?KhJ!ZnzHg63>ZE4)Q%t)jIJNue~SZ}fWxZi;b24yU`dsdTrDUrd-Kv# z6N}+uqcpT=_x%N?vz~o&pSeS~SA(`6F*iTHm^eDS3O9`e9BI1xgTyK00Uyo#0Ey{*oge84-aHm5qJ)1 z!$FNV)>oA^i;iY*z-{S{H5Z0L?uu~THsq9x3Lq?puP@O|kKVGxMDbu+ zKFkeW^GKN`i5$+}b>9g8|DCQPax1*D z5!x_#T?TC)2X;Q}+yhiK>52m1RDaMLp~7oNF&*4oRuW&Dz^I}!L7Y!_Kv7v3=!0vq zYDlF6)WIb|VGCC>6hM(eU@03pAdDuzU#%X6FIyX1wRG)E$&yHXhtSe^u)dNE1WWwo zhrBC>oNYYVMHA{bq0BK+_G}9tGd{V9q~;ZE!Q==9$@oI6#+kK8MkLBXzn`JitAodY zpV+#gH~>gyOz#@^r;@A{0%0U;lWw!)`7XVYNiCImUExgqw12qJJR{+WZU4|EHA{CQK992m+q`xNKkfCswROa;c(L zZ9h)!83PKgCu|ISnkLpp^j`_&Ipe4Djg@3!@H2{eGa=aELetqj{zHsa2jjjSJ zxRjC&znCE>Cco&r{k$mTwt85S?1}lCNjgMXTusY)mjSEKWFP~|})+-nF&6SHM z8;ta`)2n%l3cfg&_KHvx#|0b`bSP4D8x)#k5){iiYZT4$X62h*O68M+V<^Hh0*lQF zB$1?TL8WpWdQ%E|7ap}hbvG%r;7Ecc0$oleTR~6q$O}Qyu*INCL3{e$#QTBty_jasCrj7bAn{`TIXwaq; zI$iyz!Ha<&B}ZrdZ|VFpt|<N^Hb_+YO7jW@nMxytD$^>|1ucg)A?wVy%~+aP z)C-#COf2m1>YcaR@add<$CNDR-qWNkbnGOsQ={k}a0(X~gVOexnOlM9vlp!HczOr4 zZLpJY(3QZkf}P! zEfQVoO~bty?y6ZsEjBUEnK}Rd>t+4sQij>J4P|rle5=vSt!(A{^OY~V$JgE6yMw#? z?WMNN;d2Ea|I5kk?dbLs{`tCB9s=%k>U5^8H@oLkcVu|$wDa9fe$Q(T2U(UTjiZaN zmE+_0?zPU%=E~k$qrE4poS&!nCx+b2Ail5f`}I2n`=`;%Srzxkg+GyW@cHqgQU5Lk zv!XjKt>Ji!z-lakX9TEek!~S@J;iJv07hux>Cvx~SPIQp2ziJg0pPg6YEgAK1&fFE z7KJg`qr!*syK!yxs3T95NKW*2apvAhQH%O2{18J%xfG8C&+=T^GGE|~-k-23lIa-=GJ5I_woCLh)ppavi&6=T$6RE39C3yK>Untm>5 zFt_^Zd>yw*oc85#pivZwd5NaEd5SRv&JTSALkXN$AfR?s);&c6gi3CtP|_%hD5|@5 z03^o@oDhAQz_5KvG&EnBjY#P@ilG*u!&tJ20ZOt({gRR~Lt0{)Mqx@=%-`dR6bO(C zy#vhAML;12oV%2&3br=wX6u+C`6^V2MA&%#0y&YgyG-Wjv0#AUv@poj5FO@xP{0@RTvg*JAs~Vww0$Nie42j*Da34|j^tps1HR-E zIE~{0FkQAsJo9fhoOr1mK`gbBm2i6?&!dg0QBpt=@D|^)74wtJt=-9?1o@tQ5uh%4 zRoP0z6Wfywk{?tZnt~|pmeO2-QKA!<=_wR8tj(ON-fJPa?j`n3Y9O?X)+!m?WJ{0R z5nOfiCPP}nwOd%xJ-!QtRx^^oHUB^v81-b#pTlZ{{J4p}X~P@8T}JyxJqnyK9nHIN zuBLc>?k~B=)>@nxE5FcXe|^RIfj!u(^743poR+cQ7of+%%L{KnH=&)i@O%OpWIY@? z8U&T8)6a&2AW3xv#x6`e$6f1g0XuVadw&sS>+XEtp=^JA^K^l9bS|`FoPF(`0(-QK zJioT%IX^qs+#)RlcEoP%*cFVhX8fmz}b)v{iP>%G_AoEIndleP6s#Zj_(m`|p8M zUgrDaX4z4Xxo@MD+9Y3j0;o=>;gev?THpgNaT!4#_UU7;*d)^8u5q07Gd1Hm8HKve z3n)lb)S#IVqk950#6fcAfj-KbqE`~LhT=i4(H0TplW2mXvr}0AOIC{oV?TByVXq}0 z)UZ^3{h8dQOuh*cs7I2(d8d=wBx#88_F2h=MzbB8u-CK*X_*$-VDtbat8T2$hD#`C z+0WAi#f6ZLjM&E-^u|Vkio20NBBGwU)<+rO@aT`%l+ikv>QN2oP-VCqWtVnFgD z#0p5mV?$0l3RNLVW1g}p2bfS@W!cKpKvfc#cuvwh6ax@CQ>-@>ox^_A6(EV)j?Ij4 z;l%0^w5bUtcQ40X3iwbBben0`PZbD?6$*_e(?qZpfNWRookzNA$1+2K*_1J%jvVOI zS)Zf8X!GbXEY#oKrlE2bWrS2U38+F3L=EUP=cCXj1R|CwMifh$7I{2RAP z%}cBwZkC=PeHnfb0GNfP>kltxZmxxWl(Armq0R-xv$}8yfsE=Cp;dW&?5_rmwXvEk zBXxhKmTKtNA|QqqYpvF5Z(n4Dq#tTV&78-3p!y21NzFaLN(au(+*wwFkneEu%{*j;9@;r{H@$5H}&6w?6M;s*5eA!YpI6nQCyfk>Q+a->prAnyQis+?*!=M0+K9@ zwo%Kr}w6Ejpsj@~?cZS7dwu6nRGNHbOib<<7btydAd-mZ=IuosT5$clyJ z+&}-_!t!}`I-1DDu$>E)iQF&?WGM%{Wg3SMGcl_2VccHkj-e?-@0t5Rh!`4S2{yD~ za04TSHvWNq@AFB~wQmrMy<5Z1Yy#G9N2QvJ4%GN%%sx*HNil5jo|1#hLB~U|cf>}t zJelLAoJSp6rwA1*Qa<6ON2$%HxHa=s>eC}q<3<%WZU`Z0a>FlXm{D`Avuy?atAtW+8*dnM%GAp?m{>{Mj)7 zhrW`7gY|z$su&rV{)?#jZ_KhkOpSGcAEw3+NesDS`{I4>hp?Zpt`)K<7>+hF!TpdR5Q-3$K&GScL8flzROC`>GiSi^-(Hh6fkLc(;IOVV?IM8 z1{#2($z#~^=aT%G{w`Spf3NR}Uw6BT^)cWNYNRc#MfcgHnSdw>sN~o!Fd>9rYcn*w zR3jngCaOg6(78a)N26*U^N6pHaGE9#ec1Z#+k39@%ogwf1)V~to8jgZwOgaFWgw8z zWIgo5$spZ<&+DRi%64a)RK%+wh1UYCaq$M{AnWZKs)i@J+mwU@n`}z4O4%B}aLbi| z2~aY(N}nR^p+YJLNWiuh<#HrI88_%e%_NNCB!J0^H|ffzAyOh%@iHH^MZn3p>=F#d z%?qR`BWSwKE~Cc7;H-QD0W@EK>s@hnlBUd#ZP{>>m!oL3pF2enOs)xLnidGA)* zo>e>Azu3E0f##I2IgyCpvUDtoU7}Pmmjf_(a~2xU=|EBd#qP%)Lv8engJP4q!J^4O zEI>p9MbseyvO!JWrXg)z2yonDB;LrF%_4s7d=(n&N{Ljm+W;A_fG(<%Rz7DiHH-jQ z0sWX}0qw30GUTp<7P?6J5`dn?w>{Zk6a zO%IEp_jDX5goVptJrB{f;8I^MGeuGzGs`#(@ND6&r#Mu84QCqpk!ju-fh}1a$W-E zESqeQa@9DkgK||L0Fw=xcE&d_ysj5)gEQ7fpd&&skcQ#PEm;R^&szsG7Onm0KL%>c zYM$MPE9SM%H&{LBHb){BQMI^kRW5As>MO#E5(v&;!vxIBuc-q`EetITG0k|NK7Roh z?BfpqLs8*mX8MPs!uapI3}0&L$ltS}{OBJYAQca<*5ht;X0zy8WU^VD;|eR9Zz6TS z3P}1l=<&0|l8z^?Lt03CP}Aina%SK29B+VWN<(Yz(CI&ZrmYP>!kVN)gA8tF($Yu; z*q4jqf*~L-)7070e+QtL&d1$Vb*|a1um>(ra|7v5r_|jYoF9n@69GzC!+$uNbk4S4 zB!x2OZ~AcK@VkWn1%NiCm{whG1JP;$pc~H88y_^ea2s;VXout=yz^!r=`fD=TD2b{L_S(_U$|4@tvy9u1V z%9^X36B$k0&C4{XfSK<2s|HR_m{k;lo zhem2Lw>V8wz>%K?EeEZ~8toq`9| zvGUlHab`MH@$6io0?E0T0}O+F1F9w}7HiBU0a+CMFZU-nArOV*bBs!_aO_AWoui(5 zvllLDCc>g60#)ARz~SIm_MNY0*@OH%CHTPw@&3|sLjb0zf1<&wQu8Vf!4X?S*RonY zKz5<(Te2@xyBS_<_-^g`V!E5v3rH50_4;BwvX$jccq!Q;C@G(O`Z44^k3lZ^B(Z$@ z0knL&-Ih02aFhbrcK4(crbiUR1oX96I>>@8U>>;jQ?vBGUzl^5a*@o>VQ4WxB~Tsm zk@oZg3CCX^&S`l?M9=f8SV#1ocm?Q}(9n1QzzosVx9#G@r1x7R6tambrL?XaXv~RX z495h2mWgNf#LlH_kj6p!Qia9O^up~A!WiSP&qsT##t0TX*DwopU>SNwST~W8*7VS# z&uei=OKbyi7l0`-d1+(L#p~VMuzb5MyM8izKm1Q5%`}!j(&n33A7_iz3ypw&FVc6< zW;AKyM{z#!{GZ%`dyAO-qzp1H+=D}yT}H?65Gch*dVz}Q^B%V-<$q34!>E6ITN`Yh zc`jyKFD{Xl>arR9EJH5iQUh&Tm{uKzPM$MG*5F}8nub$Uu`CJJ{HvFBQEZuDTjwyLA55<9rRMFB}dV3msm zk&EIENoKMpL3Q`z`L)u_a(RS7KFmY7Z|u?4v$9uBr?*P)lBS|~T?2XPD42BlN<_Xo z9+_AY6``3##VJrJFOI6Lo~JS*vQqhH5!x4A3hCB+9XnlZ2TUv8PSJ}xBJ^zsic>q;B&HFg6a6=CVNYc97;fcikf23k~P|KI@YDx(w zI#Wa0_~Yh~b#v^ZS-?0efo!OTL-_O4e~snE4G^3+^r1Eh>IevdN6|p%7Y?U_GWgG< z!+|+Ek6ELvm};WI#PgsdxDrz|CauB(Irju_Nu+_U#*mHtU!1*VP$p5bEebU5?(*U8 z?(XjH*0{U7O9Ks!yF=sd?(XjH?r@nociue_Gx6?uFS26Su8i2fs=kc;R<2wb&=X4sq&K9Gsg9ly_RVLNpb+dbUd)URlRXnzYfDk9|mU6}ab!OrFc@~H8)zapD z_k0uf7H0?3F6`mZtwPT`PrxJsU39~VAq#_c&Q&xNv%R)_Gbip(I-={ zT_WXb?m#}y4u9^z^tEs5>dPnF>cme*-^V5F3tohfx2+ZeT5ar_&pcOQ5~T1@%c&Bv z9*fPt&oXI96W|_Qq40x_7sJhH9teE%H!9JJU=PtyzQ3zErh&gd-2UnlLp_cG;@BY} zg+R$6)2bweL1IfYLfLtn5G!f=Taa1~YHL24PMoNqy>}mzM-o{0WheYsT^#_klR+q` z2Q!k}XE@g#{uh#R=QqyEaH`t#(&qf~#{U_?ahc1+>-~9B>{fHUu-7-Y|0u=78gKeQ zErNxlfix&8C`dFRc`UoK^dUcYcG{Y^h>wry*4hjn^Gw{t-4 z2|+%aXL-Ws{mj?%{r#rzqnOlWvg_mGGmK!%@9tST4cSs6wg3HGzw0Z!=~o~oJxsAP zzu{gg8D~~1X(cFFkKjC@aR50O+)(fyFeoKqpS(@eqZwESY7RAtoI%PV{q3me(G02s zH;0?V&S2%RvS0i!2bej`Bzgudhqis=wsp@+VBJ3)yc|yoN!>g&lF4z%(gck^Mw`zDt3IpuTt z)DDpdqlHP4XNL(&>rrK7L5ye0)M79}s=CmtbD)cSkDL{=XaP782iT;ggepuk%0_As5%!M8GaHL+Ks@JQytwM(sAPBa^9p35jGd)0MmDK&;}^gtwq$O^BK zVN*zDyb?-=yr4q+P^%==>3c32T&4^y`9FE;P32*Bd6q5B%E$wbiMBHID0^|fR%w)SxK{Ft(s19?vkN^PSgPH(`F zD4am^QnD;EXmLlj#s(PGe^sd?!4y20D@T+`6zh&-XN`)ok^k4Oa zGVSH!M;em!wdCxvPrt*mZ9!W(^UNK3-5^)R|{x2hic zx5U|`yB;l9^Gd&&(t zpb4&sMpAikniOrwbC=DiSeROj24x1`ez3`<(S^joU(H4z{gMipTL0Y-M@AK>GiSaW zCH35{xF1D0ZXqT^_*qqim4AEny(H78n?;*C-=tfJ#gX~MfqVb+dJhMG4`2KYZxXA2 z6#suNd;A`cii{7-ZYc#sToJfDFhaqfi0C2+L>$WYMcXnxse#O3=FpR<8I=EYjQ6Al zF+-TcPvT~9ayZ!^ZjXOVTYyuaa>)uYeZ)6W`Xm!cSXVvg25A?@<~<~Q2+8IM+@y1l ztx%)^e&bG26dZ0o(4ekS0i8iyDX5K*-ZvYl@5B-7~p34+T1& z!aMn}O>qJNO6|v*18{_X59Kj>=jgvy=uqh!%B&(XXkm)Z)v4Gu1$bqq%4~<*;RYfg zcv7}pgStovo>1*(&XYI40m;_GP%dT#h756YKAaGuL}f2A;48ufIUz$nm7B9lii@12 zjUgO~JA)=s`NaORbYF3qL*5Nh_SBv6wM~P*Q#b{8=F=5ZMr63n2Q=^YsvN`3yH#&6 z43XqAa_Qb7%F(Gjfse4VlqsPaG3D&yXP3S3A`{ZH>cqa%r50aOPn_HC)Fw|y4pKYO zk5iuhD(2WkV#t>Vr8#rdm|9g{&NMFUySJh8kny*ew^k1rO#$x6xFBKl@s^9pAOz7G zz2xJwW4jKTofH~3Rpr+k%=V~@gXPE`NW%fSUc?Vf!S-sUrqF1F4wEJ_5^nqugpNab z3=q+qn|Hmc_B#>oUQn2LH&Q?1%(8~ZMSS#QWgS0VDO@TXzyT4{Xk zyGD;YwJ9D%h#k?L_mFXrT`gJn3c!0>@RaK6?%#GPx_o_t>U9xT>K^g>qw-_l7U`!$ zTlXCS)V~S7hJ{P#OUdPct{_Xj4ow#tXra7|ls{=rGbyU8F>{$&OGtwP?VEv*Ql47I=+B$;NK|zL*mKF`Jb>mMz;TP@4Lz*2$oHscm5E!7IlV`3nCe9#MSHr84L)G6i^WLPv3sDx<0tgmJk`C@#%bh zdaOFbA$A-q1sE{Qf6tP(5hTPP>NlXN2yM|*MV5#%btg79D(sxK%uAbL2T}o^>6KQEtN~-w>9b|Y%6U6;Xl6g zF5200bnGo!*G)lD66k2@c9O|w-bjfeAYaE=cTn;;AX%zEmck|yS|g|iEA=Zq@1sFU7(J#C7mBj z9eN9`LD!r!Wj+vScRNHlYJs!k4dkypoou)}wCAt9TeOGIz3djJp=$K_tXQ^IEONin zyU<=ZtR5DD3L9b&ss}r4Mm%+lmZ|7~1xq&+Hg{dMv}(TDMTEp#DwBT};T2V&6tyN$ zLVpmtwqX?2BMmR%&%qN35{Yb$w#iSpIA9k??H4{Ce$EEczQl`$9EdnPgSvDn|+0tMRCCWG=18A&eL?W-kRYBVp5%xtgX&5n)Z!IG#$E z#JGwthg9f+kx^zk=o}!W=7tAE4w7M2^5m5WA^2CADgjjBP0X@w)5T1+A^9p%6>Tq; z&Gt?HK18(^r96Y^p#3eQ%?vok{D&Pt6<%rBd;yMXs1N)xnNSKXyLqX$;^9Tc>%A;Q zx*6kdM`L~;<=WP>!W8Rjf|Ux22L9dt_VFm|6J%=&YgNZ8F#jPMKSF-!9gZ-b#xWtR zbyj(^V@&6tLt_%FJnKPjr3N>}1&r^9b1pU>(+YQmuEw*j`q#jj%f@$mJx`bZiFXqh z$1u3}bp)J!EPOUhyD+%Hi+)?r?fqbZezq_ia*NFQmJD?emY=8#2f3?)lVAnr@$WJ$ zmmRCKR>uho3SRu^4CEeJEtNR(z4Mm>ER8rbJl*POOd^32sCn;v@KC08rINW{@kZ6n znQiloO59XwoYR8E4_~0?mu$G}7u&W^ySBVj%XwVvQlQ4XUupg)L&l>$EeMkz8!dNt zu9u$nmk{=sMdWcrujj?MdF;=w1o||E@PmJJYI&wb0*qEfs&0&yl~MIA*k+lPRm%D8 z=szK*@cYvLJ+iSdu>41c9n1e%O!VTr$#G2pG4#pHy)$&y;}yL-K?%u&32 zm;}5+2$@qY7a3t|0ytckz^E=F(Z~Tw;L+r9?JGM|H{D$w|7H??`1a1}YWrD*LOxJY z#;ZeG9+E-DJ&;PkwtaJ&oBv%9G-Al@V`~S1H6+gOr5`6BqtOuoq&z5=q3_$(OoW#F z1N+0hr;S)2*%LFYM^=u((*LB`>PrQzZe-_;n4pkr{E*_=G8Qs$?g;f94L#@sSa6yQ zaVnhW>*eFT`wj_?f}3H>AJy7{{I{jY6^J1j`_`sWiOza2`&boC!Bn#>kg`X!X+(oY z)?2hajC^vhGDrdHS2r~-sWG5l2WNfs8G6X9h0+!~Mm8xfCeXmz*my0elnuD7S5PF- zWwS^UElfG5-hN7on-LZ{E6`Nf$(Fy;36pL&j@%G;S;WBg%!s3o+P}tB&@Y{ti~#MY zVX2h?MONt+xFqfdcfKC(U&e=p_`fA*jv+)40Y>7HJhGMYqWk0MQSG*M!&fOCE^uCR z(H(J4j@eBFU%eMPIy**<#B_(5QD06N=IAHbWU*qBdRF4ym=z#aOa?GUPy#k-3O+Kuu7f{fN$hji=7Es3sU8J3F`9D2wZc08k!sj@VXU^sDkxtew7-MK@` z-Su}Q41(zb$Qsa+Ycl$-oillFI`qH!l;BECUV}?U<6jm&9V&hMdX97Hr%kbwKq`@C0t&YhP|Y~Nbn=12Y}>cZ5Xjp`P+ zg@%vAI6wWsa`WZ#-gVt`z2PTF&uHe|ZvXk@uiUZCI51R(Jlu-hd@CgvfdA`f4hSzD zE2fFng2=~el#y73-6krfBA0G-gD`0tTMjz?VCHoiZWb)iz;JjlCFP zw5vyaT^@5?F=CuZM`(ZkV$C+CV~@_p0SBdzxG11vHsw@}w#ax<$#j*(+l@i+|xQeSa($CWMKn^~M>kjYHWEOL~2I4?iaTA#~Ns5vl0 z7(dsEnt53(x&s<7a0}P>gzy9I5FBj#_ZY*>$^755r~g;jj_Lo5d17Mym$J_Py)-(Z zEgOaZ57@5i*x2!;sl2?b{J+C?eE$X8%|LK`@yS2POwjSQQ;%Dt#OIiqAD*PW{=M|{ zn9q{h?a2r)M2c@$XQ>C%=yZdQjX?FxNnYyobL zG8$I#rgDRE<$FRSopLm4A0h&mxHutJn?eL)NK7|vNF_-JuwxRg+t)0SS1uhB#6E4} z6P8`o6Yno6@8oEUv5*zn(QpTk94;Ad{K6o=AEw|CmUYcb4`GcL?^c}X1#KC zxc{R21_84#x7Lft#_q%PH$UFkmJ~n#biST~e`SQF0AZgGZxxPheci}&l)VYHzP;Z~ z@%IZ?U0(6Y)~jEyLI?ek@4|L>KCkNRO=%^x!BFsWWPhSI(9!d2_WSyv{qrxRY)zlP z@P}_=pOw9v(+j%v#-`8fu`9>Y&D4kc*Gu2qT3kBo)HhQ0IF!BV_sU>)Qi4wL_2`}o7W@m_!@fy;pPA1x4$2>*151FpzkziS2^w&K5UlQmeP zhInl~%rGVw_tUm!jJvqQpiW4o=L|q<*q+Mt&)>-z3DaB#`(mIDqU~F>kX343x&P#3 z?F5&T7-oRAM7AA*G?5(#lpWbmRxXI<9TP{9f2rM$`-?J7I8xW?Du*qnp8mw*jL`H} zR4F9IIn_p={Qbr%c-$g`*sFyX51IGNX{G~{N+D`-L5F2z^kO@&SA*)tlJ0ak((-CM z(CaT*R7(zF3!wv^4(jB1Yh)A~z~hDtW-$V~$_fAbFKO5sosrR#60+dy^tIBT1C*0J z6?$4)FHLFUxr#{X$JHNb^zWuR#zq;#phS)CM_K@+COFjU{hq}02ohH+jEa_A>+B*R zvw9Pj%Ab+7dJAIwzrg+kHldSUOK1eU_R9#%KZ#)Ts>6bsk^}@j4+eDWI+P}B=Tg&X zaL0j}^^2maXz@l6X+<3b@D!boJZN1qc!ASB-d=9+j=Wx~&~5*M+o%C(IVUlP|4Qv} z!uy~^;8iBB7Ga^Q8@+Fi_>+pn)tNJHZ9WPjcJhX5RC3*(g>>K2EOgGKH6Sbj(y&1B z2!Jv{Ce@~eD%A1uvcL#w{iVY^@d#^6B}73nxC6+uB~kw~jUv5qnjM`cwf#G?7w5Ok zBb=CF6}!uC3Lyd&Cu8pWfMif8BP0|;=s)IaKJg;C)`R7#3k21}rV0M|!|cg3-@xVqZ(MU-9=qLA{$Z*b z<2GccO^o#+PLU1^f*L=;uy;qj#nF+HScl}~M3!`F`(#;^6D7u0&51a;p-R`ltI=M? zkB_AwhecsxVccE7z|2vs+9YPAs$H_r;(9bVT-2sys3*~EpGwi zSu*7@(;mNNHitVkNIu7ge>0lRdj#bp&~Kkc8jhyj%y3>Q=@fAXvE3x z^g7`6GDf_g#-}id6Mx-%`&=E%kd;i7$Wk<@=sPaRcK%%SLC};Q30FdvT?iixD z;-yb55pMFAU0HxSs}?Kh<%)wNy9hnSxgI_mluRACLh_e?$v_Rj>%*meyz4|J8>6dv zQHd5BtKYpinJ9U8#^H!OGT1?$?eat_W$#nmC>Z>q+o~1hB^2LPP>1z#@c)wtCH(nC zhEiZ%{1!)!a?SqnkqAW`+b)i49>+0>zvl3mF|Yy!od@0{D1nGA0@E9KEC|X3_V4Bh zw~sx{8gB(y68IaS^P>g)pAOvNe>ddef7sjhkYo^OIGnCeehZ-(k#+9A)f!)2tZE2Z zZna8wIZj$zz2??4RxtWVUODsxhxc&_P5bGFJb{Tj++-9Lv}M{x$$*v`K_!cG{zB6> z+IqAq^a?pt0jtWZqYQGmMQDN=B}w!0lRE-k*6JQFb2dR^#3IbYlVN)25cgm9;14X3 znyVZ9Ja^B;CjKG+2vY)XA4~>80!NqZZBCY5V$!TDA!67Ri>0Wjqxb=9V0^eWma)Q$ zy2*?6<#M@Or}vL-%rC{Wiq$n9lYokuLE^UU$k6??I1PS&XQtdu9E4ny4vSf>?tdd0`V=nr@X)TA1`U zNflAU9bvdO$!CTnoh?##aPmqCtXGD0MJxxa8+-8wESzkRwPNl=p5%H}o%2Aze$*i| z8zI!Qluf+`dT@fJZTflbA7#Spb?YXJa$@1Nz@gL|h%>VPm@*-W@ZjIw#>PWmh z>ARba-9_E_o*K`|aG(pWxVeoZ-oRkw5iCHnzf0x(?M?rgBf;NxV6JLUc+y$ zA&uGkZ|Y5MI-Vd&1)WQN_Z$$S%|j8O<4H>do=;0(M6r49$s0WPU!5Jw?*^PZ{=d;1 z^f2tu_xBk;u0GcS>DhS$hF!Rz$;k|pK%NHHb|pDJ7-8Xv)VEHqI#ul8zZ~ZJg#I4b zF4grtfKZUX@gAdL`+tJr8g>LY4;Xz7`E}}gJn=>@vnsl`xeK2?!siS3@XBB@6!CLH zMzY^#CsK?haA3j`z#xxZR9P|3l@&?#4NDgKPa}&QyHj(MZATe)q$dkhqPbE^| zZ&mn_rH9nbIHOKk`XJP3I9Me%ppE=O!=sU;w-~X%eK%nt0V%xJgthn~gM=tH9z549 zmT}&sC)do2LOa!{xnMQ7C?C7BFzdbQZO8tj5anW0GpMhRF|^2j>b6vPXEtO)={2cT^L4}d%H zDUiBJ0e2@`ezj48NydNDaU^d^??e5V7e$8C4jHvpr~&OUA^a#9saEr0<6NZbLpG=H z@UstB0Z(|5r3g2wN?4PKvl_U!i#o8xo}B$@QOP)#92m+rBQq;C5xfccdxHesJh2pB zMy*KW7MVsYNHYO@e(vRu)I#Hm1cce0%Qd1)fo`eU28RiE8X9u!6i|c^@)s*YSdVdn z+(u%ovGwPP2Hw~}r6Z@G_D2KwitsPmLPkwIlpFpUYR2-%j%inpg*?R@=d{q9 zDJ|2h&z@C9THM@Z)S15Ej0K=o*Cjd)m(JNYlFpiOOsoUEE5BZeH!!4Pm5Qz4#JI9L zOk{tDz1^oaAxBQw!kse{)R=5oZbp)txngnDeC)aWUa}y;3(j)swb#`{500q8xv1E< z^I)ftXjCNaE2v}g4dr9sSG)4yC`uz~x2HW))*t{lv}D{1X2Itt?sY|ULOr2+jMyZB z|I4cxc#6Brz_{l8&G84z%LfW0T;|-26Jil|6gS+D2%Y0cc3%^&Y-11|ha-GbgeP;a zkI8yo#TxB1XBtu9Bg?5Vw!qcrv6O|dW$)oLh{Q7hz_)|2i%*VPfM_cmS&_GyQt~~; zK03};HW904@-F5On62&vL}=MT+8L@X6GXeYj%{aRLn+}crtH@*8cr;LG*54jnEd^Y4Ftz7i-3SyBI9Q9Ermk#u_q-AKE*%$X&w2SNJ z+62LOL6>OLxk5Aqp3@#SF%x`*shE0Y=;R^^%L7qH&P5OW`Ng+jTj)AoQZ`R# z(iU3MS8Veen(TIyqodUWT@*Lp>DiC7aAs<9FbU7~a@T8)Jg0$3EWrT!V@0vyKtm=N zwYb{Dpp}7H;Rh6`Lmn9yy7LJwrTOCsk@R0TYDLtdr#2EE7G|x2Pr%Z@qDZNQ>Y5tR zeC6U~HY=M{KM2B&1kCd#W7b;WBb6|GTpF$mbPaS zA2nwR_cHM&r(rrV?HzXX8G19pNf=2s{h-{yK&cvXmYZSIkT#;Ydh&ay`ux#}lOXn= z0`<3G-M`N?V)*|MsI_#z8+}oIzIlwlq@r$`_Bw241y=Xw*+cV6WThL}LP%(>yL`z$ zoKO2DC2~W;AwV7Nyr(#yUSA9Tsi4{7f3~&thM~Unt)M9($WzSki1`DVIm{3k@wc4c z@w(n;DD0pigRH09N4EM>!bRl}GUAkSPwj6%b?W+XR6vXFb>Wd?IDJ&!w?O3(dsKc1 zVFpAvDq3F)6^>lQo>VuMrVmMKw0Qs_U8sOmJyeB~n7$X?E)h(pp8V62lK|$XjYy?J zbs0f7K&dTUA93^Jx; zbK7^9JT3|V|IuT=FMnh#%qC&RViqwMJCJC0lgKDBl_01xXn?z5GA#m7maik4gbUYR zuzyt`{%)z~2z#jJDyaj+kWZblCQ0B@0MYc=PLoTqfV9tE~pi(C;{hP6LE265I7}}UEV2d6_)r7 z>8YwoODzXAAfYK(g??HnDnQf#RRw?llEDg&2@;)0%m7f)v|p^hl?V6sxh@ItB-~w* z+-(SS_mxvHF%oiAeju@Qd-Yr@8vn@&inCxL>wz4DF$Z`|>2XFPtBjM~(oz=9e-RpX zlpq05@_>k6_ajlQCM$c!Pz&ph?@ZR+a;?Cg@(2b_oCnWk5ooqiqs1#;XF9hBW=Lt7 zye0R(&G+D8uC)MSf-*x;R*mjBPnEPc@3r;W_K)tsY zW!G6s1Uf3Z>ve7zq5s3T-gTC_LI{_*vh3%q6l!ScHRQ zO^mwk%upa8w4(rz22_zp7c7fWtE+q6WP@G6TDd(p15KOZH_BtHXP&hgpj6&lNkvVH ztRD5}1yN=1>ArmZInRPm%Dl(Pr8m|<9lsAB5sohKj^iQ7L;(-R<&MECIc+of;gU(r zDZT_(Gk;7bL>=m|jKxfCE_JkYBSXtLfwl$8C7^ZxK@>YjrcM zsx|bt$4iw9wvFi{+*FEBICWNDu_(^LvQ$CI3EEp<`}cgc>Jvlv!kS75#+B?EOhdGA zSyst*ivz{mpww96`-^?EAR!z9A1ZitKo~;Yc zA~U%9*;pvApHeWZPGv*eTUwwcf-LzUBwKM95=yWSCTrs{pJ@3MNJ?F|An}9Ns+3ew z@d251SLss0NMJG)ZQI4eGGf*Kc@??zNl+k<4qknRJ^g7#YFBD9M{!pzEM+;>!%h~t z%;kP&+K9z&O)J4@Q+tj?X0q-96r`?_v{ZWSm&lPat)%DOW>Uf*54+LN*>8evDt0~s z7)5%Wx=QJJ$IDp#VMmMLycx_pgDa3|NXnOO4I_N;*=emc&qF$ZUL>#}sbh`CTv=%x8eBtFfc{)(c&= zkZK;4)mp#Ot5ntJCH(vEIjxvv2fJMW#71ZnX0&GaCWwB_{2L}K7I?qkQi5t0EsN&d zN*=lLd-tFGN?IETDO;mnnwpw>LyK|tJR%DjZsk&o?nyU_29}~s#=TigTS+RsyD81Q za7wj5=IH@>2Ithjw~crlkjJz(t#{Ru4TQc*x%*~(z> zQLqpcu$#|dHGEdEPy=$~xp^Xn#mO3n-i{`h2D=Yk*@iTTteV(@EgD>sM2@@mEA`)O zriVO^vH3p6G!ch@YUoFw$G*cD)%ji)hd(jU5#R4g0zA@&L4PS{_w_R8!{zgFef{k0 z=6QEuCx7=w;OG84v~iL?B)_%g=c&GpH~KbrCGW@K^A>xU(l+PzM36npT}tZ)n|=Qa zj17ghr6T8oZak+Tbv!i+==Pyggn8gZ}ts%m+U`ig?`-Ch$GP>gq4RN z`4Sf%2L2+PW0*KJX_v!+6c{p=hQd|$Y_Mz1vIXXgUveN9kEDVPeZ*3>8cK2?Ft~Lj z%2nctKa)4yDo8X8AuYrc4SH1OnW1*Z_l|b}b?Y}R2{|*&xEG2fDm4;5 zBd`-PILwJwTU**aqIq+5b*IlZTi7u-<(xN69YH3_0KXJDzt1uKoj^h(8eZ?0o1rJg zlYdYVMZ8$`8)+N#1@Y@!rf<=Oe3+CDXUC+x=JXWlxh;GOUsQ5SgZy@RaK}~DH z{@rdN_mPH)jd@_D#QPSQ7C+IU zHh%@fbKGF@AMD;lOXB0BGYI>QDAEKo?Xru^cy!A@4_@A6G%q4?hl4iGo^rux4fQdc zldQP0r*O%_uWCUBT>-Oha-ppA8ph#)pwqcHE1%BeX|hcCW&r41yp;^BFmA3v`%JXY z@-IgMX>de<+ZKOa77MoY_z49X_gJq8x#<=re7Hw(i}mv$U&il2g3I)nS?M{q0K+t_ z`wHe+vEhiPf@F2 z!6tUxauPvJ0Fi^n$L;P^sA(bQGI-kj9cQHYab6&c16#t>`+nSMP!&>E;o`S+!iLCS ztEEfc<8x0WUZWx2|D^gb?16`L+F5RgXZaiFj}Q#F*mtV{zus)V2F+_Ir~?y=>oJb? z`En&20>dcWV7_~fb;=FEnra>14A{Yx${abUCInXo*sAU!3UA$|DSsR=ailLwqOwy9 zwF>>3cl;pnQy;zHIL3@bg?H`8&B@TQI&rS9rhT7TB&#MPotlpRe5oy!wNm4xx2D_r zV8N>Q)2f!9e21>3>hFov7J7(VClUm2E!#UD$)jW~9JMGsvxtL&I>&(ImJDaL#)|Y} zuZ~OkKxlM}u6TcB{PdZdza)$OGPGcOfTMny5SRl(@f!bT5^J1UZ8gSfe>iA9IHUY! zMH&EIIk}luK+=u;WY&U{{Nf9Pwn)OLe0;rrg32YkDKi!B8-f3uIYG(~dxx%-#(uLk zmrSEMk*hm^cQ-g5QJs4dh`h+=gRFZ8H78pnIN=~<2hky_)g*&w7wMEL7*ad|YY4STim(f)X>2&T zN;wPR zH=w)Dt_~&$K2a18{MGFrBvhON3cg-sBc^CPg##R8@X3~6;=!*iD0P9QI4`Rqusx2$ z+yins&z5M_WB}~bmj$LT+1$Q@tl8#>I73q_!TY5Q4P2}=4(egIuY9v>K?lXn&TIq0TV4Qip%J;e6Bg%5B;%Wssi}$);?a!{| zqk%g5a@Wx96JtxNxf50I+mQ*vAe_w3$`1@J!^pFhpqj6G$QrD<-PYyyfq(28o9Wo> z7-p0sL_j!3=A!iHnMf3CB|fc2qz{sTGEc`Rrcn(E+B>OA~f}+9i1OE6h#owvNNtcU_M2fovpj;l4v2^Bp3W-?b4vac$ z9tY4u%AiXyrE%Bz-WQGJ4Z;~U*4wCWS5=69Qo;Gn`}biYdm`+|VMpPHFQ66lxi1t2 z*mEfRb&MsIlK>4#=M3qkc~70H0G(MX=LgC%=#pB*z+;L>rps|PyI~zJsYLYk;{>6e zAHdyIKfv7RMjUbP5?XU1A^h};*@p=PEgk}7BSO7TXZX|_^Vgbp0&g9$h*w&4`B4be zG-<#CUCZ4E2qZv*7TPo`_@feNO&yj%`3})?AO8uCVNe|vZwzU`(T9tDn9`t)M#H04 zP>ab)@B$$&8t0rYB6M8FIl{){Cgq*&YY}q_CZ)wl`%Tc;fB|+PcS)e-B->bHy+;Er zyp9e5#_{AuoiB+L@O2zibWWHE&lu0PQ&8bB+u@JhIx7el1P_i&9XJENrDjlT_s3?n z_grEcFP}S!77m0|!b#H>QO(zS3jnKRADh|)$`2a=GF9jv)ZO%j0-E;&v~8YOHjzfV zXykk^4hoDWk}NC|YSz&xFC0b}see7r65-vP8ft-s6r_mpNY%ej z+R!`H5Kmru4qFOp02iwQmyQt^xd4skRm9$K!)w?D7kxKYeL;~g$JDo8C-~;wtWB@+ zR$UOazZ~Anq~L;!MZaNKw^Q7XE0fnF%4CzoRFnFk;-v7W-}vVe6DhkUwK=X|&HLi# z<-F1CZ*0ZqhU01D>arN4h$KUToGP_T7BGbL=5$`&pWM=`bVzPl^Z(q5UZd%im6e8{BIeo|AF-8#BX`| zAOXaIEAL3&#t0cVx5p}Rl(qi+1ox7no^V>IdGMd}c30>nLO*8H$gtsq_ir92?9BWV zNOMgNXI_2L+!IT`HHQ~|N?Z#SfR2&=()ods3_4}P=b4jWrub)nZ)n?$si8La2z?sU zT#bsKN_0#Ss7^mHs-}v9;Gu;ukj0W7K5>HT+I(`}jP=@L|5Mjf=aKgl_mi5s%foD4R>-TW8!Kl`0#!$KX$PZ1@8)DkR%$>h z1mMWh$ik9j*TlkhM~EK0z5$ehnSqhH=T~AB7jTRY&BaB3w2nUykeRKmntydUr++F| z_xNDn_(b36M_eNG^u+gDa^8KVCnvMTXLH3jL+7~t%KTw)0?Pox0X#vQsp~H%pzI%& z_=|FSad-sVzz!U-h6Q4Ex$Or9kkTVtqky@8eI`^Nf6bRXufTU#BrpKn*$k-K-eIn$ zhN15xab|wDAI#t#p%V{xuM0YSvj6G+r3-d?Gr!K_#wxRy!ouBv<<(mJ4CE%-cSD%CE3jx;xgBV8|#gN+x2jG9gPbF;*C5@0% znot-O0oFY}Jc#v7(9xPnIXyBs3twV#W&KjM05r|a%=m$jo)%IV(SSF-g4O*=fO4Jv z`Hpb<1$(sBkEP0bKw?Vz^XrQAy(v54S7ByUT5+Er%A5Ljm+9e`d@{SEL+w4#G1GSu z_oL3`tM&6t^2=`@t%FyCUSpEnLyLNAa$zHJSifPO^~?Wl>ITDe|2)X7eq4*GXV|GZoddxYSt%ZAo# zoiGPS14*s*e4lVSg+_#`0uwGZ@p5m|x}s77pwTSwqoUW4>nHo=xtGq&W~3o>LKm!| zhtW~K0wMP$K3w3+uWR8g(>;U2F#n7py%xzO193TM{!c!Z?3;l)HxA$Iy%BcnZ5G4y zkBybwY)bKMQ*!8A9Y%PjsO1Z)vVBRrN&V$$mE+$EK_No6l)zqv zWbRBP(b@G>NVecLcJwd#)&_3lTzpBvHaiOO)`%zSJd}_Ve=cq)y|fw04fQ=^x0o<) zfE>TU*Y|U{t0`GH=#PP$sC?_h!n^(hr^(;<1-86vGPdVlu!n-UsWOYnhQLPA<&J5( z@lXxgNGB3tjRW;X>3H|6nxoM`HXNYGG-M#M6KnH7C-*V)o`YLIosAHp64yCcm}|C} zj7@wy)gx|C{Vbztfg>NF9op@UW3+HItvwYS@&Y9#OBH*snc~|7mfSVOM}F1pr^nCT zH*n1Q&J~j9LRMvLQWL(#+(wN$s&vkrC|(ivxCZha&rirva|SvMQN#3mx>{}a-O@|l zwT)BY-cDUVFPf2D(Z(n** z!1fgEV?*UpFS_63#C8I=FNj81==PyQ0JD#6LVrrczU!aKn`#Do@8u;N(Xo3;Qp5h6 zElb5pWo7AX5$NnN$2$^C?dMut^EQC$GjYos>&=Z2IsE*H4w+k-m7PbH2!Ib)$|gi`Fl4MF+}SWO6jJP zXt+J$F$@~Q@u!CXR!;{Pqvh7_ z`<-RtC3Z_yjjd!~!{SLbBW2Gbw7zmM)B7X@3suuyeQKB#9>&2?=Ol=H&QWH}1#T32 zFzu;r%oM~N{G4MxC7(PCx`O$j$9s@HoH+SiWUGOrKLOU^dFkTQGYTOxr zag;FTOfZrLULtZl zOm->;w9e`57|>%$%A?&Ty!D& ze>y7sb#u6vn!2bjGr0@n4YsgwTXdwV=WsO8r?8TK&Wbv7ykI_a;s~X0nWQq?-k>) zY;soq`_O!6@b~E)pa__dF|>J_fk&lTYe*>2DWbSZl%%-6MAs&hpRlzd0vm!T9Y&U3 z&~5_f-DKE>IQP9Zxo(F-j-RrPE`EQA=WpqHHCVr>^n6#kY~LJBIdF!r(Dywdezgit ze@G|t$A~tXg)7&QU;Z6Ea@^dxkxIxb^ zJT9>v30W`^pB7$=bXz`mAZ0RQrjWgRRj!Li6{*~5SN>No+{LDpOk(N^I-An)>!74s zETHL^l*zpwRR@88K7L{298e`sGC5a}b}7QG=S=b>lGvySk%A!jh7T zkkLl^^LL-o39Y~1Wmk|)Fgn6xWayMN3+#SSr#0HiJKva zE!o2YtJCwE{zTVyuX}d(@S^{xewm2P%Z*+bn@r4fVCjFgWMlD+isjFls_Of z&IPj*V7C%N@*rh~sbQkL7E@z{&aF{nuxP09oBq^ynNIk}rMo@j2{z-5P`%Y;g8l?> zWds>rpTug_R%PZ{HyI_I;N$yZ@7;Obfvc-nxG#=H3oxAgQjO|)PRey6HE!=5pFU|n z8iu~%g+|*-S>pjK=3s4we7^^cVs&ZFN_d@R}IjgHdC)bytQk7(IMQL;}x(F z@sUMHc6a}{4I++sSeaZ?IKB-g!PlX>Je6zNOL%Hl7{uIIFB*D{Q8~?eD7^+>wj-enW_1zgfPt!_bGK{++`Fju0(qQ*+NsEo0r~ zEtg){lA-7V@?&i>{IRe3GF0G`D_i@{6}CJdvbR5eh!4q{vy2rmX-baQKCKjQvr#Vt z|8kXcdH!Q*){lUd*dg}*9=jdXyPrk(H#;CU)rV0Ka93i-y>}wjWd?eq7qBQ&s)!0D zr2IDIydpo&sV#kH0YS@WfrCR0C9mx3UWqpA_~^VF4~!IWv9$C@wg=|k=p4kk*%2-j zHt6;`S7_hPaCPkFb5hP7N+gGvxT@VGV6ygN$~HLCEI+_gCa4~24`(d-AmH?U)Rpe8PIfmioS^m?J=UV)eFH44J7k9jL3 z&;e$#z#X&n#8W^lhm>`jQqfr{)Dd$HF0*B?p@psFEUz{K- z%2o|TYa{naM2!%wycFgy*8L@ykPS*?J|UQ>B1Ap);xR(&vAp?e*86idgQ8UyGQVT$ zvQQMUa0xT8B9SwMgDF_Z0TEMv7r8G zEg&>k?56u^7S3n$45WPaN)G=r%jd&*iH>{mhBU#)8TiAO9bC#_2w>k`o(RL0aN}h} zEafj_;g+*)7LA%!mTrd9M0vQ^Bx3=Eg}6>aSGx?d?t-N!Vv5&;mGdb>Q!}s3AJKC6 z+k~ywW&*@8#^J{#2FEZC6=_`fos1kYikMm894I*ckMPgBIWg+c9{EldMUnpGFt#%f zB#O}~%}8@S-!SWB4k#+B>HOUsk7r#5SRxJ z|HW7(Vt2(B(eu;z$YhOP4;~t!=p$Gdv7^>tYW~WHFOmUdM9K<}TwBGTSRD~CHXt~7U5n~*8(%hDq@ zl#E>~Pgi@Xyd$s)iMU_cuC17a*1y2j?%rxacrtE34pB&Yvz)$dX7WSSO-?krGUL5# z9Yi^v#x@AKq@D=;1>E|rm0WIA!lI+Cs?yhIxlcX&Cu$CMDP`5IAYtXbitLIHzZKwU z$0%2IFl;3dP5driZy^%cEa>u`bm4J&I+cF0tlRj6pk z^~6$T@W1{a*>kgT0eq24y_mj>R9_9Hz$XCjEK`JW6i|Z{cS45sNkDdYXH6 zem)q_RD@3UKe)}S^`aNBCTP+rxcJ())VkKtzF*G%t$)w35cS0?(!@_g1L*%`RG?wh zk<>A3-xCyBc<_#-swdcwC$yt@$+Gt!Yq>^=7pc|$nu?SP%9A;(d<%-sj3xGzTuuQh zNx2_-O$Kvdl-8yxLKKTX2k%;QRpimr3MZ3tQoRatCNmopyNd7#X~BX~qqEJi-INb` z%(6$apFLQAFxR#;@S2WfF=)MD?ugyu4&%6yTyS)Qkr%$JyvIyfY4W{KPg9jc=0xKm z<1V@V2r>|(6=*VS%2jI`txrxHNgW7AYNOy{P#uBn9qY}w`AlkgN6|A}n19$2iAuc| z`mN@dGx(f;Z%w7eH|Wlmia|t*;WjJj*VE5D`y`zn4I(Z-BSWG0*=%y|w9Nl%^#VP) zZStKII4^?Q)qn=PhSa$rKK3eCg)K_{HszBmc@{NhIj%caG63?zvpikdK_KD!{j0Au zA5rPtllOT#osu`Ju;yk+fnc1|J>Xl#wl29W2V8Zvv0YljW{xOwRreS;tOkr}kZj7c zEKc%_f&+78HqXwTQ6vV@>P%0*!V+xP80X%m1>oq<$Lt$xWqiQNaiEuBPCYgm#Vg_E z8N*;zP8{@Cwu<_m?~Zrq5M#TG>}da*14x}buTx2Ik>Ky2TXt;Y*2jwEgvspvV#V8H zUnwy;CC1eUJqr})^8O4U?i{4xPQ}X#&VZ`+F?uDvSY{}p3g;BCNfrr40T~O#$0^-$ z5`3QN<}WAf400q$W|8jv^!Y)f*8cuj`(UCNV&UpnjUW9Y%Svt05IYA5x6NtOhwZ`*roRfl+`n*o!(lB4Jqy9l@1 zB}To=1ejBsXs!HCgm@~4Jwb@3YfG)`c^V6IIgjcRV6`aX64B00vdmDi+|N@OeJg`D zW!qS*9F*1T$m5+>`gip%ZM9p5^c{Zn zOR;&TM~=6#p?AOJcB({hoBiq7AdkGYNq=>&ghBwRhQaMy1n~%>W&Bjs%OIhY=VHt{ z@36MD_#>l-siCm7z5v&d9}5!`4)fun7rfOl@OzQ55_2E(j;h|gs&O%Dh1 znkjJrZ9bTo?}~8kGPV!pM|AH^ydHtl;|z4q?bq$0L%Q@v3b>d0h1Ez_ovOj(Tu3Uv z(g1(SB*J=e}>>tn$A7YMC_%6P3Zq}s~=%{#ws`nHX%Kx)@)DL~hbVfC0c zP6~-sgwP*G%QYhKk@h8SRTIANHclF6lu?-!u&(~&GT177x?!u3&+$XC7SEk$|;o3+)iVSJ%sl@+=s8R-5diJm`~{!xAjsqVzlOV z3PbpG*vs@MTF3LlQ#X3&->(f|HV0JwxM{kvbe|jO%yLPtH%-YiJCkDsncIVBNI3Y3 zRi&Q`K(zaFZYd0A; zE!MRcXXu6v5<^@+I_(UP^3(`n2KgepTI_v;+{Zo^dNB8&5KWM7KI?qrRoR>n>2` z=>YD{gP-|>OubKVvehjz(y-I$>LX=lF5dalojb#G4uT9b0U+4JAI zRoZ-?b3E2wnxsXbxi_pDj=O8COvbTm7jKk%c>04KwS!nJ=x|_@Fhp9Bqj`l)6=t=a z&ZSeT8@~d(%T&{?6u9>{a43r8u2ExrNH|&_zn9gQ3p@iEHtI8x%FFl=j*z@T=DrM4 zafu9YBBs}p@*O&mtgO)lZHay0D5+d>5z*1sBTTVEdfAmUY%}F?DDE?NE>iacq)%f# zm8N;$=~&}jT852Bq@Uda;gL9MiVYPiZ`&v^qbIk0KAgbog#BNa17nBSq!F_e&5X-g z5yTl8ajMgOcIWtA5ByS6oC>eWDuO?Qoh-A__!xV-8M1UPQvgj zps(mxN$)CDeYyU5S7hJ?I%Eu8m2*@ds*ic66`ZA$iQ$B={%t1CGg=f)EZZ>*6?|}9 z^i?+YH7rsXh)0o#sjx*+8{3IVMppSe!sNdeXjuc-%3WRy5s=DS*qBwD@VY!WEm(``b8n{g*e zCKdJiO@h0L-5dwOJIkcYl6Bk)fsCLCI2^)6y4kaQfEg@R4Kdu z4erM3nTQ%aS}|S$-Htp*x9O=fH=tni$xhE1JZbZjfrxvI{Uj3ak6|~hcbzu^_KIu6 zxmRwrm5)1q^c3#%VMV9onYO2Pc+(ml%baMtP|kYz8Yz9mO&h<_w5(w4}3K{DuT}L zjl$U|4yUlK59H@SP79`faU@#_pt&TPqE$A$$rPX6l8S1us7`mZ5~C1RM3|*R%x$=L zjIi@&VUFm4ABlkhvN(v4+Utx4kn%+P3&2X~T2&-my9SjIZ*zH9{pthZxn9yBwYEis z2GuPIVEUA61(P(~3R#&Bx+Xv2FMWoK!oxngG8i^E2;x-XC3_-%X>k96UBN=_*qL?N zL=ayw|H(-qYcq%GIMeb;LN*IcX5|NS?Gsan6<2o^V1f{i5qR^Ha%s`lA`{xl((c1q|L?A1CJ z;?xrr?McH0ww%F4_j$B*Dsiot(ZhG~vEQj6mz^cvIupV-CYw)kUw5G6P4>G1A@cTs z+O4@wy?B7i)rx+wIW{|McuPoVd0S33Lg!p>E%m}H0>;blR*xlVo@Y>@m><#( zSEr0Nr;digYI8$&(U7M!%-?t|aCM<7L#my1YSw zx3DwyR5v7JcON(UAR9l)XS|_YhGXKs{pQjFLe;Kz;ZE9|f)eFcNY&xTF-?8VEuJnw z^iz0XnB2Q$-Gf^$FgxYDc(yNI8H}F5N|I#LzuE7f-16BRu6a8NfK!qJXT_UT+T^n! zreKDSCm~iV;dgAxg&jnt>%$)vTy$UG^jov|au_824FL}c#R*Ds>g6~-2Ez+xsIEMh zJZE8@@pvJ4O#2^A zz$tJqr>}B?bDK`)w@mOLZg^S7?R`>|fA?r421|pG?r|qjF)qgrsTyzeLnX>V%n$a$ zuIplLxxozL2`q(&V#T&yLwwPkjtT(8*uDGrv?wvU@6`+iG;0hm<0QKz$zADnBSa#X zz(lUNRe6o7{!*p! z+8-vRYY%WfMnv6%8Jh_iei&6q^_~MF2dxbep!b94V^AHZRoE**o_8Z~q40{h5aNV| zg?{AD)<2D93!{z1zbw2WrI+yrKL#C6)H)um0}cEnP(n@WSz>}>7gCoASAj-yeP!BY z6lL^CW-J~fuN|iQGYn^lOz^RtPk8m3`Y8T-)S#{6;cCQs1Uc#ItVK?MSN{gKth7ymRpJ{3cT)ejN_1)E!@>uQ&uG;e-mFyNA(&MX~beC@kI zS&}tv!)g-22ZlgKwQ*FL|EJH*Aew(pZ%UwUxJRquDuTNu-p)6Ye0Z{xyX%qwa?(bN;$Lb=g%u+r>fZDCtS*ZcZM16sG?OkVYeZZ)G{lM8a9FL zJ~&t@g%s?dyf%0mkCiUO2h#glno@`K*mfWA-t|egyqy8|;F|M;bR&Fz{<0#;$%Q8$ zbj9SU8b7*~Rq4UjC|uKHDP+eE6YdsK{jRsMUV%M(ANtKF(Z!C8?9mcD%N=q$q8N2v z8OgM41XKLW?72ulY8^R@2M^SbTngnSV|cpJ@9fM}fGyo?d`t{gvc*Yf6auURib=hf z7LO96pcn8~l@md6S)uyES;_50v9;l zJo{5Fsf8Jnz?>;JC8VpmgSLnta4Slh6o9>n6W6Sn#E__alp<9lX7QgRnKDBLlDwG!59%%XKmXjw$ zV(!2lTzP7}a>c@|&Q>26+x&--lQEXxm88kL?}A;NdiV%|X-p2{$mMS1i|cs6!_Bvq zfs;@q>Czvb2^&3~>_?JXiL6yMgs4W`1cUuy;J2O4X+BstY%;xENsCsZ?mhX0Nc!^k z6G#fYChc#So|HCO7C>uSe3Mc@tB6Y5s9UCr#)<#vxf{(OI{L~%3IfY~HvRM$j$X}X$)+T{LC40%w`1gFzC>IzwGP!EGlFDP3->yZ>MDJMh%tkt9 zbFflA>i;MM8!tHiPC!E>`^Sv*P(fdSC(&g|NR_niFyOdTIe2&?-hEsO!^t2j*YTc} z(_9=f1wF7de}C_{NL)s77z&AiPp0Uvjf4j}xeMK5fpgxBa6|`_#n)&hIngJxEkx-( zel*PmBN$DVttEPvmk z`0sd^4OqczFu2^U$;@H)f&R$Z`oOYtTaSmgM*scL<=cwlQ+!z+SGoI&YJZ(2CQf*H zzwQ2=4-eqYBE%FuWTu+aQoBbN%DE>Nz|>A>TdsWbB0GG6R7D%mgcA1MtS|f z9qq@~U^#!Bxx9dNQl$%+@;G1xGARuiMIDDUfQV^>Ey{|N^9*Wlkqu}ESg zkPgUL-D3!gOGm1>KN=#aor4u3WvdgsMRx(5@gFW;CJ-Zof24dzw3Z-GXzKIP zj;K8kV09wItx!}lOv0+Q0n{KU_R7+&DYHB)P7C1z;JIve_g}jR5HM^I()WKZb!PZSoI+&q!cmuH zVsW51?Oxv(J)#XXEQ?5(Q^0uyhY7Lj=H5lZtxb_|k$`umn=%QjdV?b8`rhB60z{hF z8k$81Y=y?QD93iHj?Kjg8m~}K z7d`MlJqhQKA&|T{HFiL4Bl6!E;Kd^p*OqliIhKC!U@4go?)O7B;l(n&_6yBmR0(H> zQ}Qi+DcUhhiZ(MfVFH*a2qM7vNT$7aD!}#{I$`zTe;!UwL*k8`y16K5uHDyy3H9E(3o;rR}fz0SaPlbVr?}4MGVthM=a?-=FfOY*kXQ zFo!-{w1{i)J?#39_~FX5nx;)pk20e%rR2q3;uIt!=Vn8C0bKSZ@*p--m`(-Mq3TMt+Z;#rHmIm&?g_J#It-ui8BhT|V0i1|5Xb2${r++7|3{&7=R)(HwjFKY+13H6or0?Q# zB3;(M7!1!o?^aA}5(@TOqqA-go2D|8_}AHk^jrsfd1X?0Cw8i3eud?BU&gn#ca1<%$bp^wX0-WP0OfBlt*usQs^Exr59 zvEzndBbzhl>BgBNGtaI#@YlXd>f$I2j~lI@$Ue~K<*7=YN@I-T!V|w%Lt!v3cjkVa zF0p2waZUamPt%&n{G)Kmu0~0OvAjN?39Gu4*!>Wr_lwg{kS{)$WfQmAm@GzgOCoU3 z8F~z#9^WZ}AsoiOiHjJL5WoB5jN-S`)5@hgdY%q-qVQ*v)!E{EG|E|(GL2@j>a=(a zewnzJat^xmxk{x$T)mTFQr*_3p958PY#y8eOSSH|*|D`NreS;x)K26#4R||3h%4=1 znUtcl(_HqSn+`WL(BbzQ)p>XGS z_1I9sdAQIB8-r0q;Ewa2B4#_NWDHYS4;DIV&{~lYnL?36|6NWPm4j0%u3h}8l=`PJ zNuXbg(^oKHbMJsCGM9Vv#@c|^V%WV0Qs=;DrNs`>oz{UgL(zUAOhM9@VA9!>q;~ZO zlT!eC@hT#B8(&99ul&_@Dp4OKK7>6QjNV%X-hbE6Wqh{v3khP$22|0NI8+dT(KHiP zm6hS8h$MtHQ`mkTqO?1;ufV&?ch@%VV>(Fov`o`%gkUtX;ww%L(BPM+y=7?ur=|4y z9#V>8JLV^DM7lFxdp++|FS^v#ACn$udUK=>5O^w!Mz<-b^#aXMuZilpEzdo{a7q9Zy9L&dsOzS;%9rL!5FIs^s3n zXpwU}wg3~C0_=7j-n76AY@)fIKdm})B%q{d!<^fLy=HDPJeS$ zBuupbh8(zS%gjlVL?sX}hil5}1HfS?kTb)w(i0IwtDpvIlY=<>@^&Qv18xdMX1m7W zco5cRW!Z=3W_3^iq3L9|?r@qdms=@8dl}^SWy&p)rje_t(&<+t$ueZL zHkxptKeY*)U-!m>c3l{wrH*C)}JCgEcNAq#)d<*@Ol*cLfuX z>%=Vt?GOLO8L%$R=(+I~7`UDUW-Nha^aepQD}Z%X&{~Tsoh`*oIq)ASO`H+}z<@ z^io8FuN4Tw?^1C~aisKNzl4X=Kvci)b@#m}a_N98b4v)NaY9ZJZL?VLeE>T~nJ92- zbH)1Bi{p^ja|M#{f=@HmrPuwmx8TbFYN9hm5l47;wOMC2C7h4$tln^cvSTer$;xs) z4B7FG{ajVjQC#_s6+rPTWkxh$$yiNV(r&H&fqC43WGZ~rW~ORzc6Z-D`jX`|n*Xng zUb@trutf3qisTYZx*w%2;L)hLk5rH6`V7Srtl{BLOZcD9qmPuA`i_!hXx+T^=r&qP zR>vioIJ!nI)$5tvBP00QqAu6V3c+UujArCntJS3vN}Z@Q;7{^Q$+;#(zymajaTD9q zaJ6sZ#pEiDm4*s1E9k`c=R{1%7m-Cgeee9BcDh}2n&Q9TRa=>t78E*EhR3WZZ-WOL zrdnDrU1!sR31jr>2#LAt2c~8x5k{r1uT^D`QTnMO<13uut#`t z4r8anT&zw*Rb##8ePIwOHKyK6EghgF8|Sgc(1N@vt>@L#z(~K>PAPKjdLRDHKFAwq z{Gxkyb(MAxm<0C&TlQBaONc^^FvIzCZAW}ovLJAVN=(jQ8w1owfkDrIedqQss)^`2 zrk1aK#^7}EiC|&t9*-|k2eX81mX?ngkLI=n>$CcL%85|vY3WPq1sIYY_vo6g;}W}rR&y5j0n=Qu|6i3 zRSx%uD0h8)TcP+FEL|zyEBG_NBj&U{m5Tk*(Ye!(Zb{agM&6ILL*t?NH1Kpj5!QOA zs-Cz^aO{z`Mb_SxBqQXnCQRoXldrVPj%b*ftj)fuSyt>U@JjKEm@q~-I~+H)7)-Oao==DZs%;ovWRHV9lnLfw*z zI+^b6y3AMwk&k)v*mE0={pOEV731G{3#_08#X}sO7`#ec^SuSITn%$qTrQXl8O-m9 zOy>pS%n00wG&mwt@p7sxpigZv`_m5T1C z#xb%SdXQ=8!qH)5>&S;58DQR%*&bT!h4E2I>7SY3C)bE->-|05IX3v$M}F~08ld*GI+wRlbi{y?qDC?+u$ zb}hetl)5$|kFSuBK-V%Af{<&K`sy}aJ^RF|ixLXM{(ONFU^15IF(<^LS2bIGT&!!j zM}7WWBeRJc-c(Gr1Rl&g)$l<7!vpzKl3^*T7Y)-{itOUl9?P7z6IlKJbcyJ<;nDuP znFNKWhuuaJ$3xTRWS;U&^-h`C|K@LZd)WtM$;CrZF|Q^Ee*dHnNvOOulu5Y)*adO+ z3xPi+ZEC}99 zg@@;}K;5gZ$XYEN`fV}iOTMeLcm3LBz~r7Rdf)0x9_kkWo!16vXWYhw0u)hk)MqFg(S#K8{Fy-)$n;@mzn(qT zU&Ly*>^MytifIMz!$%Q(`sPvXv*clw0@w|CnpRW2xl~M%^F-G{hu^n3pZn;> zJ6Bzfzk>o=BIu}8*L2XzHoj)N8}iT-{T}QLTUFpg%n9tcGiM9BC94V+W^|FQZ&N#C zaQ}vl@>jutWc``%k4wFr6^omnrKpVE#a)ejUM=mhq3CNMn?xD3CuicNygz`9$OdvG zIIwL_J)?Zb2Z3oNoRLSENeuqmr{2W$q->jh^o|zz#yp5lz=_^><|kmrV4-9js~VbM znd`H@rvG@fl<&OY^*6DNPRxb_HP|p8zS|Tzl&0EGMx|+?cud;Bl>l@8ni+26t2}Cu z_yB^?wa%F{Gbvd{;`ch=qeM|B&HJ%b6cK=!T%9G#YHp1<%QAOA1A!(IYp{k!nTC#gJlJD0lLAWjwB9#`5!PcN z^*tIN_NQtciG^Y);;+Ks9q;~b>7oGBjRHd=*I9=dpM#P;olnP}9;r}79r;)Kfj&NU zG4R%e)L!FRINuRN-GxQS>&b z%0cBt-UXFzHzLiuL4Ox!aGCJdteieQ<|L*wtV#yTr`+jVqaAOMq%+X^FjmU`i=y30 z2Vwp7@ac0@MLI2%C(P9Vtdnr7C1&7RxzdUrr1lP$w=S@xwun!-n^RVB!1l=PSn4RG zyRKP-M;CQQ{cg0lP@2NlVx3fD<GMPC9rFx8OBkX_Jpc|g@-l|}fL ze6z}_+3)^7Y|8pr$l%SC!`Hp3bKRX@cSyT6xqt{y>3Hbk_oOlBdB{-PM2))XdDSnh ze)U&M0j&PNgHGNSEOqekFrC#>HJw2<1uuZkz=ryoJ6t0kvjGs>5jdc=}Cj3}{sSpLjXP+gD#9AJF@yhBCyTtGhJWx6jx?cSGQaxG8RTby@A+oepzL;PNu|nZ?-DR z2EIz4YNk>HqNR#`!4^9${yVuuQ&A1j0<{{i`gTZHng0(Yo{91Qc69uQmi})U?LS(Y znU(dwB^Un(EzQFC52*jo`2V1#-9h8cwi`{;Y(J>~G18l@>!zEvbXmIpnO~P!v zH9HW==E&$^awa8uUM~)Yo@fpvdloA-dUm60j&_OG0m4)_mPQdKB$sxELD!N*7si%0 z1|r4I~lhwz-zc1xj)qeg1v-^>YCX9ZKf{grscF1%v`Y4#&;S{K$_fOB16DB=$4Z7F7D9 z9+Bu~_6#)hQ!cB6`#pJNcJW9*0u6y%HLfH zFkxwKbToMgWuUjoU2|Y4&6z+Z%1m_E5-qxQ zcX}BSAbzlJGJD?)ry^lUuW)9is%b`V%d6bu)M*@$?E&+4%-LD?w z&?NkQyo$Nink>ma+};Uw0)&N5APthQRq~rP4fNFMF}lJui(;%a#ktWL3Q&yO4LsST zHj}uFoJcO#WMivTu#G8z!K$E^AE_b51zN!}L*@fD%{*jBV0f{qk#;ieI>(G02W4 zmSM?-TV~bu`-_yKLc_*?bdK|R2vYiOazT3t?2VC%8Xr;E|<5rn#f!fXbQ9IcK^ zQ+z4z#qjnLLwDHiEYiuWQx+2Y&MYBoEZ3(Bs!R`FERB5egYh5`gcp z`4G9R_sqx)+D+E->O5Fx#%}44a0!jwgF>!*a#=7Bpg$P<*@93mOQ(D8f{!*%0Ig?U zSMq}|QyhHugUb|6b^Q8{t)e(f3?W|UkN zZb-kqu(HVX2dCirVnqy-A|u(?3~C{F+L${#FIK*S*#MLBR+P!1h&%+&wH3D6VVg07 z4PjfmYv^vvoG@RiLi8)F@)}i(bb^){0ewmYBX{cMYMk6jiQcXX-(!UiiuU%9BaD{eM3E6TbH`F>wFlw zoOpJ_5)SQ^KrbZ%du6tp`(8RCj~hg|meZ)lus|7t8^8JAqT@Njwo?#P+`}gom5k59 z)tDqGGvGX{M;_rdxdU}XaZEpGL{5r|b*us^v0DIrYL~jQu8tF1AX2J~q$pf@C z%XN4x<5kNm6fL0!p*p-{$qx1`==Yg|P5sI$=VE4?Q~IlwFf!0tLKCLi{+{_3BLNQm z9ERV~6aAW(l#fP{dtlbN7pd!qS*L>H*jNFM;h3hV-wLv$)(OV(QD;X~_$$u%F%U<^ zstxp>B7KS7bRkD5yxUY|*lofd9^5Rk1@A)_WEt}LyzQ7|{R48++?(z%6W~g}xGM2_ zh@;7tf23xvAMV+%Qba^`^BLL?OIFZLtnZ7=M{PZ8x79JPvg2wkXWZ_7Ip zAQ9Rp6{SpQ6wJ4sEyJ|74dS|Uv?QYJ0smEyDub__tidypOhz!U;{~^<=S+{s4jGk( zv>giS++1AypW5dgI+@ShZ8gNxax{)BV}x#_+6yjo3~+u zp!p=4bqh2>Z1`WPeT-*CjW_%(&=#$kZu%q0m3LP0^ZzOJ;Wzm%)B_v4Jzj^$Zd>AQ z|82GB?Tu8}G9}YqDhApcY~~%LGx235ZNA{~X_aq%zb{4R=DOtXSr25j~;e2_#(xbgIoV9fKnpI&jQG z{64&xnCpdR)l@L$Ol=$hAF)xnaB*VoGn; zI%-5~>Z5#QW73M@G>;DtYT7dqIWjVK%CiS41c3kdj&S-2HcH!7?sK z7CdQxZ!BC_2yUNGyFN96-?r67Op2DA60osr%UcrGJto0ZmfvUN#3x-_#%N^mw=3@# zfZqrBDDOsvtM(DDB&KMTwI!F>ltqtVE82B3j#<&ghQEI&5Fzpdai^c0qWMcy!P0PD zkZoQNF^yWvZ)!*S0iqJ8arwaT1;Zksx%{ zI9`gz6MS=liy@O2(lH6XW0y}*+&HG<{raF9vhP>7Z6hG-J1BonNayO^|W!L zhR}2PEOhR-)7aZVCXIXp@u7Zw=DIK&?E|-3JK-7I!D&4tGnh2%otR-b(}+d3_g?r41agk)d=5Rm- z4l_-isdUDrDoQSq=bIz0(KNSaZYER8;qtPu(=dBWEbI%Lkh3OBK`RZegs`{ZfGy}< zMj` z6=L#$HB+X~wVb(Ynkf^9SvzHr;xw#_TyyUB(c;Pw3E=S_BeP=S#pz%JN4769*gtEFoBOy}~q z<9wh9R=~q@6WF=<_oEr_wv_6gy0Gx+v$K3)vlPkfbT!2q8l6$L&;n+Nuzes3qb8`@ zWu_Xnt&Lm6YMWholCklAE$$)E%?4sr(fZ&IaUb%BN@LZN>`-0yzK{>?T1i7MjOM|r zV4xR|2|f96ECMT!2NoMEB+7XnjVja!=AUW{{*pf$Ur_SKkS&r)jt?8?1tAkmP{}-t z8JAovHl8LmYusEej1Ct{{zE5wfZoWQSt;shnk8cu<{)!S7!8d@(pg-n0t)4%QU>+B zz>v;%QH7iY-fSFtVu0zAh{B?4v0*@E$J~-oK%Eo~Y9LblfXS$YK!k*OYK<7M5xH#q zwn`TE&(QBvW<}{lMCeqw2p2J9%#eQ;PM>w7^y&mRNj`LqdInF_?QE=^TUB+?m2Lut ztIUNLz7)ZA(d%5{`h+Z>5bFP7?3{W;0lGxnwr$(CZQC|Z+uf&a+qP}nwr$(@9YsZdST~ynnqNHmiEZdnb_K1UEpu$z6b{vM?lIyu zMIA_3rzmFCz+>=fgf(JEPS44~h^oL;?8RCR7N~st+9sAA${J-WZQZ7n3M?-6@Wae4 z3lx;4a&}AcM&&=EjZ-4Z`1RQlO8O!@Q>($@1*=U`E|n~f3vb%;?fc9yi_}*j(nQ&4 z&3hZ05bRy*GoB=*^RORW61;EV?9m1g{?~5x*0z*5HHwEv9@2-3k%l3R@hH?MvLOII z5$jr-aH5s^*M|FKpPx7xFzb8^X~(BMsMziWD_e^V3apy5#UJ0E-j* zEn)pe^^W|sS$S735xBP&Pf-Nc3csQrVI|P(yi&xRr5(d>8Pm#V6U^OwI}FGo6y|K;4lsdzU20 zf4Vi}`UZ%b+1KVM)#M#qRw>dl25k&rX(Ef42c$tHN@*C$Yo+9UFD2^(%nSBr#0mkMfK(wHU3778BA8EfP23s}7f1uvBP z0{W)g04z3Y)O|-7_B&*A*;c2J4}JNP%nP>SAw~)75)LVT33Gae#Du)H+W%19x3H>D zCW#kCa$4?Q2Z zHdm3i)0c+#v*R9d!9gV>e^RIk)fV{&Z*q#QKqx;4tqjD9ZgLGr(4a-uiXEJvUB*#M z;&1VSr&l3w>0^J#IgUDTNt~ReAr~)agQ@iu^;;!d)K>q*vr`MOhf2FkuJR>*oKsZ^ zWVMnjh6H78-8>gZq}g07f`sNbp0qC&v4tONNz8Muf3ow~$Ay2eEBX$IU$pdP*;pbI zw#D>*o0vQj_fD#})vt#IN$7zIrG9X(qV-hHG~}?$?A%Ff79(S`KZ#wjw>p#D3Z?6t z=V6bGZJUPzz`A3+2SEk+0HJl`8Lc!`2x+}WR z(O(Hr{#baKMQ6nD33L=jI{M51an5QyeJ-vkG(etHVkA832S98eDqsS^@?vL;>nka_ zFKJ=dFjdL)v8*}{h=#Wbj!%mAgqMyJpw{30Gt?bGvFMSvE<-5LZXp;l8^;$VxWHc{ zDWtC-l$OcGV3G9Go>*G{mW1qGyLzhYqfmR7fU#WIKJ;51-EN7_F<~+*C)~N!mQ{j@*o5f0lie1ne7*sQE%j_!yXI4% z$p?^py+*pm43XSX=~`RPl~Hw?z*lmV$(9C~x0zh0pMi!aLiUjv|JKw;o#JRh!9R<+ z{6H2=fgCd8=097k6zH~Dl%O?drkJzw+a=rG$_k-f{NZ_rycPW_G}&{=vZd3-B*!N? z0?F1?91aGL&4|bw-6~DykWd3alb4PVeCMLgm)6%Ksqy90AyvqrL( z7N-DF0GfDQHfX-4`nh@d#(o-P+tWkv{nnt;Z%7+Ar>~x@sH&&m+IX&QCkE@JDjkU~ z#86hM)Fqd+5G?pQ>=5}reFQqvf`x3?=Mq3>=wD1Fz!QBH9fX~Lo=VG0R9_|h?)uLf z*RBFO`_rPj`c-QSRv~{2X=SvOcM&BSMU~CJIViL1p{;kbxOc+J;H*y=p20oAw^Lgg z5ZP7FKY*c^RfxC<*TB(Hmae zF9?rQosCmI`M`mc5?n72#Ic@_&G;^rLs7`{cAm*ZUAo$8Df|%)fXif8;0lVgvVBhr zsm2rc+O{ia*8>3OUVEbzc$MyJKIU~hIc{I+6=e;o-Zs~%bn%yP-)&nobtg2PC^~xJ z2?;Uw=2YEo$8mO|uU{0!=uo3H|(aU`Kf&{_{11}q=W>x2|y7&3qhc@_y9$$ob z&=BiPq7YG@$5?8|7vB%M+M&a{ESc~nvajz79B9$n(R4obx9;W(@ek%x2aO8M;g&s8 z#g>dOf0T%uvuMHBTIMO3C&xLlk*s;DrUBHSsg7)n*Lf(5x`IUNiV7F68M53l;2DgO ziIybyu)C25`Axx>eEk#K`Pb*;_J&muF&>iwr`AfP^H~3qyTa1|r|V&9FP-;tjHw@- z5MAY7orog|W*S~rD`?Dy;=F5)A*X&pt|ikawfu3-G3N?^T>mZ_QwZ%lcj_H5j5he0 zSF|MNm4|lBIt;-l@nSW-U;(_8xU|wH@Ndgo^>pbZ!mG`WmLI^JO>zHw4l^D#9dj!1 z&r`RGX{nHz_jX~RhW?Xr2xfqDv9`PYY2l+4I`nQJ1i5p9nY~j5s-P?Bp!7>_U!YFz z&lF1{UdfB8lQ!N$p1ksV=R~BIy1DML0qW|-rn>t;*CwFtVU2`tG6K#wkFtf}yARl+ z`6 z#ma)1+!xyLpMEFcF(pFM=h!dXmqChp_ghfeZtrc*ZL4IYB+s_YZyUkqSyY zCs&r8VPjKB>9v0997EVvU^2CSOOwTCUspSp%zyzyb|ER+IG;cp9CyYB(*ewp6##p@ zVsj-|+RE1mP|*s$>RI%G>=3sgG-*Z7u*(h$cGTMdl@qHlS7OgTrh0Qdo}w1*>$K`B zGs}5Rm)b?!bVvt@9AG~cyya-;)oPOXOgc(6eO4;@WrCSWq1jQydqCK>P#O}erQst(&9tTt=TnBL;8_5z%!8)EA2p<_`cUoY61MELezxkk{fheA=8uM z4)p36tYeo45+0|U*2U)Zu2KUH=GK8i2)}NIL`wIp5T$v#*5+tIv13pA2bU;MypKWP z40!|66`nvLk=m?pxRR zNcF(eeh1F4_S7C>PqTF>#NCtnCBYmrn9WvjKG}H<-%5S~m0paD!{`FUWtYp9X(w+r z^nZT#w=r~P2JiAusLk3MexlEVrW{^!z00-t>IYdLie;skdl~bGU><4C!K75aJcNyH zUwZ6B=}0e!kqMoe+CKRP4D`%WVl3gv-mbyF*LXN}u7wLmBzn!{!Y~<$#Iw-ElRZ5k zt=l0V*q#;5%>{ch%N-YiSVq-2OOlQ*7wKCFYu0pl0NQ)F#E$6K&@8v?Zryf`qa&NP zirM$Jf;&<VwOm|)t8WLy0 z1?m>q>4XsaxIS_iCgfKbOc%(BUzx6k%G`XBg@y2ji=eHZ~;@B`LoB zW-YGd!-2-}6yt{U{Yr{UHtNgfw+t_Hq|hUI?M=DN=PcDL6fuR((L4qD5cs;cz>?3` zR~pOyr+KEG{piZ7$g}um@rvo)hkbyri54s)q5H)*NjtcA%6G+wWnBKKi^l=4Pz6%~ zD5E?&E}L2%#|I;M6^W1gL*{P~>YV!A^8IaeUwGzwT~0TtL3#szLSIKDLe9O60v}oR zoFO=xvlFOxNciw+o3b|dczMG^oSz2zd9RZ08q`Z_JJ`nVdj2{S&u@{tWY!M|)uHl{ z^hNdO7>sAm-0Af1j-7U`qo#=S0t_BY&aw1d3I4p9eDe3x5GoM^*Igenj!d5hQZC?l z6qb7zZKEITw2W)eTNAR;G6_L}TP68g1!wwxP`Yb$5J1)gcL*$aY`%B&=mMQH|zM z#(Aq%stV1Hdwfm^8m5jgG;JYb_-$o7IhPEx?<2akkBWk(`N<((x8wAyi8y*y+*^GY!HaX*OiV_Cdo(;Il6xy~+peMu za~&lDQoLNQU&-&14)d}W=Vle@6ZQze$@#>B<6pd@0SxbSmdlrTp1F@WN@7ao0k} zz#d`xzfM5?c#lWmP^A6DsOVP56sbWWT-||5*Ks;Sft`Qr0v0j@XN`%xLT7vscOalO zc3TzydgGaiK?OiO{jw4=g&{`jn9)(v%uH0O;>-zvI`$?>06ge~f(;ZY;9@?GHyi?m zXG+ZD!Nu;R$fIN4>Ooz?yU%|p?Ois2MzyZ8T@Nsvk@IAd$N01tg*{>~0lxZQf; zD|ta~UHVr~m)2x6uoydLBccs6|1$=xok*)k`xdZ1IBTnqT2spo^8s2*PgR zjlE)x_YU^7>3C{)HB>Ep1 zbKM#Xi6jZeIW)`G$b}(DObOv7a;+`KH%sEwJ*OP&F&*Yq12f~t=PDM(-KJT8{Fm)z zn5kuPX4?LX=KaA@T`>XQ{RmPb^CE|oVx(2SsDYGKbK-yXn2m7%v}Hy-hcrWhnuEHX z$QuE?(Q=hPV^~?Ftv&A8?9Qi>JL62#3eJv3m`WA}wn!Je+^l}eMi}glrDxGaM*o;5 zvYD;ntw*%Kh}oAg(mX2JXX~Z<##ek@slZYJX1-JA(hM*pgz-aBJZ)IHi~xh$H=3@> z!Hu{)?xFB^SCEhF;>~q-y@LTRAtxwrX4&5pCBAjb%biCyKu)k?kW~^eX@E0qKT*hL zZ|G6U8KmIg4w1t{M6GeZ`3CK;l#z6~(iGlqt9GguoW{NclMnfv=0O;m&6Yrv)>YTmm}`noZN zVvL8!Ge-dS1igi-0(HJa9?1~$QpOCSu-`kgd-Tg@dPC|T(K_jk0?QrMT_bS?4>`R( zG!6cW;LV~bWKCEb`H4d|Ia`UE<=XNY_SkxH9UI_v5FDxxO0Tls#H>NG6=l&67>X{# zKF$*lrG7?1g!zmezw(E|HIjJZyid`DL6zZnOTQW(=pQMFI)5+!#ux1Dh$i?(N^SYc zqF(vek)5_3h_Gdw;uRIp7K*vN3652LBT-02!W`Din^~ zY*=-OCa;4C+TmJ^iS%s%7pl8537PnTd!R``_W7@;kJr$f@GHQg$&!hbN~Rmx72btx zhOo5#Th;xG=D+AqY&#>)KhN*|QSgv%&jzVs{5jmgyYNZ_O8o#Vuf}s*HE&Wa+Ig;H z-Qq5%0j)%lxgCE$cL>8PI4jR930+cudD`KLhj;UZ0^=b7@nOPWm%w$CFdWD^&UU1( zXK?GqV?%7S3t$d86Vo(@=11-;>#(6k>fAZ#Azlj8bUgZT)A-X$H8wVrfrM}CiuvHT z6;EI5_7e2o;Ovem7KiWm0R2%&oWfrn5vtIpurIw3&(yDNTjtE=9TJ1ZzZ|Xz+RQ;J zW0v)1HJ)jTAx+ax4<&Xw6{clvkF%t;8#|vmF3r_Rwc=UBvEAaCw8(kxgI+-sicja{ zqxH8H-z0P3-Klz!xz$c3ZG!39@HI4(kkf>R)762(OQ;RMRINTZfjmQ<+O$(#{&1ko zZ)8qxL-lqY8eUB6XQ2orKC~=3y^96(f2K4k5rn~mmtpN|6}WTUZ70bRk=cJ!tgha!*vB>wZ&EI%;=v{I5j+D&36w|vfL44SbT7CPhZi^>h!Cvz`pMHwJdg-T7jp_zbWk>E#&5BcZHN&?|zK z#ieuqCX|7PKU`1h&m5OzT0rx)cc77=P@3=DS9cNni7}y=qH;HiTsbPgh^_SvWN5y9 zK{1if2OJ2KLSTwWG*r(lS|00}UD7Kgl0eNtn|wwx;dbxG)faw~?eS$&UWbfRN6y6e zOu2CovAVnE+#BjqU|nb3s(w(ZLsf)IM=ZUvlw#<_3(;Lar&sGkbAfd#E0=& zNs@bJ<0bEl>|*NV$A2Nt(rdz=hyX=eUlG{92R{oFo#x_aj$>-ynl7`B zHFHszGdQSG8j1`gyEGqUXK!J5j3cGw2@fSoD4aEwp2e<%V!JSwXmra?b3ZrfDk$AO zbRqH}5luH5VI|--;KQgCM*6w6i<+r)xIz_x$U?as2B8@6S5vt{E0(Z0W~mpZ=oL2s zCquYxW8ElkX_j5xU8p&nmh=Mp=*gclX1)_D8L?ISu%sI`cTyvXW4DHCq3#^&b*j17 zfL`+yVCNQ5;W=7i7w?P4ykg%=*DP(f0!egs=FXuD*f@QqvP9trDl>~z3R9zmN68ie zRpwaa#|jg25GQ=Wg;4(!o9s;8jq8X#MVY&n{*D?_=}w5+l=4B4!`Cbc?K@U9PQ(wJ zy{^Dqs(c|bzFMIW$nGDP-a2TQjpTlEEc?~Il}@gyJ>*N>_1P`;p~AT9j?CoXW&0S#s);cO@+H|Bwq2WAD>$OVWd=dE;UZ6{8YE<%1p0`$Q}~0!GtHE z@J6NZfWur;D>?mBCJ|=_kGFJqwP*pG%);_FVk1v?T?qX@^B&8v7H{JXil&x$>P2EE z_->aMwbD|lgS^(31>b%AeAB%~oQy2UkTJ!k6`CqK9`2Nl`e9WGCUAd%C}uX%fv%XS z!Cw8qcar{<3RLDQ*yHeeeDh$Re40^ii6fE1V?Cr{o0d9}>bga3J1*zkJP$9gpR5ab z0SAc+*f@IZS@pqG-F>xhmv2+C0%>*2VF`sg(%Lk$Wb3oBI1nx)YVex4V1qIfy4OeF?)nWZYewv;OnnDw**59mKq5zSmz8-3|K@2C? zR-k|+r!7t`TW>{!oInI-D!VJUroEWOY6x-g-=g$-qjUVOFu z&zm9Y&91raA(<+`3sn3Fn?!~~GtG%dTO?N;*xM@{&8q7Tj4nqAX-;T72S@l=otA_liDn0#IpP&QU0$#eeT%GE{kY?Om9LG5R!%H$3VhN}x zooU1HU7I+_BkUq6`VO|QmbDHN>Dlt>p)0+lI7><_FqDm8n8-2M= zyCG%^=ijFHc8fl5v7*@cBAo;e*1O5e^I)MKe#RSus-gM_WBg{rWfq65V8bQDR+He! zM>b!Va^^zTYD~7%4ftL4pEVoehvvpH!J%G5sn!@n<;mXi5#V_MQEj}==imcWOV$t= zB0V+D<)UGbZ!xKb3dAGXX`O7HEFm6kNX*mgUFz%T8$&qzzO*7uAUIV&DBliNI4KTY) zP^kB;U?ilC2vB#E?v@foj%fXI zFtWQSq3L5Y7Nltk6tVr*S)b$2da&ptX6z^JU7K29f#zkpY*iyVuG5Z=`e;mY^S@)T zTpi)C>LK)?s1x3yN?12{oHpbxaHFyYemb2kD|5qTvn>;TAn|FihnwIw4TV%o*bLU61*Du8vYrH_c{C}rx0=@04d^?ArXyI zG_DKMlW8Fa>l7Cc-hcqJ&6mW&WTj#h;;u(}vR*{_o^aSjP@RMh3Y||Q4B_v4`*L)u zXBe^7M$q)uah;6)>LB+XAov@S1p&#gEu`PfqBP>Ui{_%oHITgLW(E!L$AC!{fUq$b zd$G8^HJQBwFuyAD4y6vu3Xt_FXGet0z%_UF^i$I?v_Ewy9<7XsFigSf=?!I%-E{j4 z36}-^eHmByz>#V4P0iP3WKn1$Vo#R06X2!O#YuaLqw;UtW*qFClolMI=`0@B{d`eU zcT0T&QC=%CySQa`W)Y6;=2j{;)&$qZ>Y}k6*c5V~H!Hs?N{K=5GH$)5@;Yf>MP(;N z_U|0Ms!2j2ZY4nz#DVrP(svNHNTyH*FuxKn+f& zy1Akqy?WX13$whDi)5z>Sye-Bl#cP>*Bh{Hos@=YcApy9AZ;hS{9%K|Orh$PB6Jr7 zO`E>2P_M}KP+*!`nJ&7)*(YmG2kNu=i$E%wZWH(dlWrH%0f^>!KXIcTO3@|5xX{?I@K_y_lMaFJTVGg40%Vy~pNArIqu5*<(lIH8Ojq` zgXaL5X(oZ!D@R=!zJm=Zngb`L1BIpJhaSa=eLoPP3j5&t;A1|lzu>TU`xD2JBd@TU zQxD4DuRb)SZ7nGRkXG*6)zG@A`4TsvZ@7{mj^5M$hWy>QiNSfw8jL-h#6f=21t^MR zQR$K=lWe7+IDxG9O`b)csh+ITHJDa@uZJV*?l`Bf5 z;gUYwE-#3_uI)xQwF$S7M~>vb;FYQy-;9|r^e>SLEEheGoa;gWB?049%|ZWGyGvW4 z5D@Ff+!a)4ajZw%pVB=IZg#A@sFCw3x#REG?HtX#{Axz`c;4l35H`A{mG)~?cq+jcSt3LJ=jfA|WHk~cFBKym;6M{1&riR2 z#>2^0i}lnTZoH2Y?H(EYkSP^VUvqF zB$j(GqRJsaerc%3emk#F+pSSmZifm3-LJQGkHX^-Lh~BF=YWcqQL|rt^zSLuTktgx zAPw6DF^wo|M`m!2`%qv2_1$$`F?;2{+&=mRtAOHfj*(Mi?D(bVE*2n`5+xLOAH5$? zR9qgRhj6ySqrcLm_vEr(clHX@@+c_@5tt~o-lAyb4c1d|BOTP7R-xrV7t^VYDEdY4hl*9UvaA+We2GL=s-7yB6MV|5 z?(#(NVyML&l7UpPdiXt!NH6KbUHPgd;wLm?L|rmcp;L9T((mu99WE$WPWhjAF*}+!j=smsTz%)rEP<*tM9+zsxTuP&U#)NEN zbu3>8>NgAZLw`ulCX(FU9)Yq}(Yik?p5Ta!z=%S#KCmyVW*OdSi2Y><24&Oabl8mq zWE}0B;(YiX-8B3VkhJz~6QBd#p5MyiI+hhkRUPdPX#R-gD4KAsQ=f+pIYHo=jFAKP zkR;;S0bcu8>L1u7Y77_D?Sg5~88wR{OC3Xu09R+4h0fLm2fSh3(9n3D6{v=xB-S z8b$n{v9=ugE_|et^?JFwA*B&r{i+GPu7~kRkIAKu$%H z$mqHk-b;rSiG*2Uv0fLAbf#k+a&}q`7b4Dr5YztnRWiHk4f^ot^X@^bTImitNk=Ix zk*rOr%q#2yy!K)pl{qEGxy>RGFM>tm^Do?H9*UC*WXtGePH*HU&<1+O) z8G)j-{&p|SwE_f5St|O4PlC=J4RQ*HQ=4~XOkw%{v(`4}YT<)n5Rd~hn)&d{=Q?Q9 zi7r7VH8k2#2p)J_Q2W39E@ymE2 zV*ntA0gswhGzlg2WoWpXR(?k_;BMNvWh&V};s?%33( z+rfULawWgvFUC#{oknHKTPny zD!Km$)K3YLBgq>3Ux6_pp+SYu)O-rYnBSqw)bi>x!SW>YemM=3c{d8v3j)O1Ogsd%$){`;ZXwxHB>y*S#1cU%tkB?hO zMbwazAp|_ogqaFfC|vxPp#WxW1C2Uz|EHnvO-vyI0K6#tGb-j^ewam=xUsxE0$4cu z!TCOA;FXp-lZ0^%9e~>L*V6|a;1pV5HQLW|Jam9~&fn=byZa3x_CKl&DN^u#@vCOl z1~`}lnF!Gh1H~N9u-7cOBenW-(+$FE&LtkLBlly z)}z=tn(GqUc|AO8ENKP>l_wQILCPzy2Hrb!#t~0zwd5&+4ax%ydxc;FXz-X7vr;Hy zhy|KU`-34+v=E%?CaMlEV3aCMEg_FA!1WV2m!SoK)LNA-NgOEhwhIz6daw-!#^i96 zd^YQvmZ7vx2*H8{Ou(YJ0e}^~0Q}^_VEC&XZoY6%0IIjHlT*phfOrrM2eM9}*VY&v z!5+n#p@@`;Zx{dAARv%Do1~HvL|fziTq@x#&VU7S|VNGxu+Y zxiqK{>Ny!Z3Y<98N(Wp271Gvk%Jgq_B%IaS)a^7+tUV#ERU+Q}ewE>M@vz8KqpF`( zhS_dZYjeXxvqt(lX-vPeJ*vsb)p3)e(;&SSP9#dpDPI5R|9+p=c0*9#l=QqEJ-;u0 z$hM>I#VhGEw)H}4et5i8JSYSfK3&=ZwUwLoqKnkMWR2!c#ZW4`BG28mdR3la;c-?9 zznD&Y$hz#&ULl|E<^0}>NRK}H7Vg{9R9vFZF1yLeHFIQ=gnFC$&Er(f$6VLlz`yyl zEb{~0Wvizpts45J6W}eVSUX?9t|d@JxXp-zH?Poqu`Ebc+0N2Bt&Kv&ZrP%ELQ-!j z4owm772BFT6%R@7!Yi6BKH<$(Jo(ZQHKN8jba!qXu@;;I^0=q@`!uun^<9|O!Alq* zw}W`?(;3yvC5zd@WM5{?1mWmk7Hnv2^(SpIg(dp2Eh(ezb0X18L(HgXZw+3_q7_+e zwwFd|@e^FADH3F)@RuRuu@?_-@?DyCJc2q=$Rhm1jKHNW(7uGdP-W#KUfrriuqr*X z^TB3F!_rDlJu&Ak{!hACw@EiJFce2RH1Ssi{`-->T5j+*S0zd?m_hQ-k2J%3pTQy_ zIF_t!_xkz7**p8OZOwzjNIk2>!Wrr;ga0mFiyhBpU`85CSte+Qk6Eu2M3=@XZl1=s z$VrIr?kQ5LEpkq}g@cgE0o-lPw&+;E3#P*ineQ`(MD^Bl(|LPCQYiY34>iI@7qg?r z1ih`<(6m@Ka~=4mn&3m`v@d--_p4rM&yj5|F`gIB{uL8DEq73|OIC#naMBqq%TJpp z<#FKaZ47hIVD3%Et|WoEu5^bbl0U=46CW*X8EzP7ulFI zIURKSefJ!u&V7nc%Og#K_s?Dz(u&lHTnZ@r-jGq4a(8V-zUE!y#&CERSyd7%4U*#Q3Xv!T?30*tlf5X7;GjUzOV{w1D%$AD~9|-D|OdY zMMUhR)foAz6R`+rZLjqwGPMobqRaT~j0g_-)hd_LV%dg}#q;Hkk^^14F@umo52?!S z$ysS}c~eo0HGZ|1t#71z`eu@XMuuO{pqS*mCGy?LG|lcFU}V`|{X+fDq7v$&eO^W? zHqgNZ0(RYoRYq^*QxmT;*WqWEx{tVnuEO|b8l=YpY9-wV()9zU;|1r2h1hP3b|@Mf z+7VpTq=x*@0vh|&@82&z)4!gat8MbP9}8TM*)dZF^;viapJeWcl}|=YUQGPV|K!rV zxA)bg`%NaG{{+}Q57DQgr3Dn+M5``t^k+eE->1!UJ@pXT{$+_(`*!Hzh5@p|9n-S7 zv(w?O%Cw~|?1ged!q{6&uQ?qADM-8I-fvW*I>~eenL5|!Q}};?e?9zjYebTLRe{Qu zlwq`vd!|2H^9KfA?9+m18~)SK!^HR> zh8{+Cw*Q%Pm2h<5DvQV#|MCJw4Z}Q$J1T)m)QGy^v%alnLJcoNRCpSg;{bs|00BfsMg~mwRwOX6 z{v4g^>LDm#`bvXbABG67uId5!D1PBP1@iH4 z4}NLk1=oS5Jf?zuKLFN@>*dr%MYp%NMS0}IOCeCM-`rqT)k&1V58SnmcfWI7VeblU z|LWU*%0mnx`akhtKiQZ5>RCX2jyAzz9YP5H$S&6-kN{PLH3$y?82w5>psNOfPpQHC z2X6rHArwJh;csJ@LJtxkQl#N+fZiMb0Wi!}S9Q#vkbO_{4Qw#iQloI?7XtJZ{F4QF=geM;&Ikl0n6piSK;far4?X1P-^iWB zcU>4+S$H^`8~Ce&&JFxq<(DxH`*PS(=OXyk)$bektH;J}m&e-`G&~G2aA3g5Ab>+c z2OO6I;PG3JbP>UM4fS$rKWI7d%R7izYAN4)#XzxshJZzd?ap3vU>FlCrR8_y;fuZ! zRMmF_rlT29HFi-%bL}N#nu{3q4GkM}LPr$K<*M5#u!Kg(`A^~G-n%`ifWj`c=>Qs7RyiTKK+`KWXd*@tJz=BLzLuBUr;ZV_A zp2Ch~6LgwAR}2vd3Wp8HQtf#3u)G&{@xmu)RJC|(@BVI+@z!ghtrNaxeATuiEaexxiAfNEA&sl)%Ib2P6y2&E7lDov6t!PyK@-#(*gkkqh_rg zyRVj?OEBuXnqxcr+PDRf*AfEs^E(*%)Ge6e3+H5S)2y+JJG(#!do+$qfR--`LOp>` zt^-lwb@PlW)CZr5`Aa=EytnrvoNMn*UG7S$b@_s&`1?Wpa?tiBbgLJ4{nDnfVFq6a zCg+2Sm$YYW$KtJZ-RxH`{1YBzXE`4woK;_-Fq=6NneIuQjat+XvQQF?sijO;j0M@Q zJ#QSI0B<&I*XMb#cU(ESt+|K9Ph#kg5U?peDK3U7cG@wRmt&QgJL7ndJ>ce|$fzG~ z`&X@0yFaa!%Znn!0J<|tB@w(8^EG!L8ujcC=22HI!6hlW81XAjOFf; zNGmZ%WZbF;8WZr&6meTO5-GhhG?cnhfb|7diYW`Zu&hViB)WDmHZ;;%KB!OKjb1J( zaFi~Kg6Y9ieP17FcAPwx#@Y$#s?9gMJS<)~+zirPjzXx#D1ztPlw)qNI!(>#>1CbQ za3j5qqVwCwR+|8T@1VzykD{y&H5FU8gS7p#_lX))aU`)FV>{T{&YP59rpIZmwhRf< z3BKc%CQK5kh&wB_N6lJhx!}Kg4rT8glA{w6EGwv0;C7qPf6T@@Hxa z;KT%71>buwH_ye-ZRO(q@-5@KuAw;n+0T@4ZxB{gFeY-OQfCKZNmf|6Q^cPq0mQ_Q{53)8gDkHNQ=r?x z>vIE{+gzGxLP6{O`&jqUfH{#WJA?1KknykuOV8W!uIrg6o9!!JvH*2>YqC6dhP`TSa{E4bCb~qmEhBCs@F zM)JoeXYA5zinT}6Hkzec@N>>vFtNK9*E9Qu8AXBwT7Xg5$P_7w+EKpng6OSwOH|2% zlN`-A$he%)tuNs+gHK^qBTP`e7vI$_V-UTioph65fqt!`CxN&FLu@;|&makPyhYa;6Zo;TGF>HfP&A|=4;8PZX|EU*`JG}fuO_1C~@S>A1O_ver z{Z`P#0E>ymGoEnHHk668+ z6;tyla5=es$g=|FR5sO)RXE;yLPbN(=?o{n16_s|WPyIXqLDQ7%?o!v1#o7{yx5>w zM0#oi;m;Iha&hQUeHXXv;1Xcw6q(nja@mZHn|Wd;cWa}Y9S?M70esZg6O#OmsI}Ve zVC#5x|0Bn${=z(EtXY$Wz+k| z_w|jmJoJZpqyjxpbuz+LN3qzGM&Nvq;H4!2-s^Eyiq(dx^Ma2#HqG;} z$We+eW%wX4&j@j&H3GGrSqpe!;$=ktt0OMe62bs^zoqe@#+!N(NpXH+*mV426#!y% zj>0^VB&kf99==wy|0YUdbR7eRr6p?@2`8dfE##=dE!hIY0&s@>sD*Yw}*WUvky z1kvyJ;)Z3;#SVEB1-zXx&tSF3N3?^Gr_6Zh@}a$8$v^W`eNd@wn@?(?urEeOi)&8> zYRk#ZE?1ACY7w!n>^9!HcX}l9Y|{&q&1)wZ<|C^yhiD%7TcNX|eN!G=v;;g? ze%2~zmYZPOtjeojc}IPI2s-ZT88I;CyGJyllx@#VMh9$?x>qa(zmB*ppF?rH8C&Z62$)s|Y9;tOrZhQ~VFhnX@QI z8z*pRTDV3K{1prENb#`@TQT-YsV^JUbFuDjv{MDNn!Mf3dv^lpM^~OseA& z>|6aRiy1I>1vo>Pw+Ut*?zNy7=c1`I7h{iGYL_Y4JxG0Nw_m(9$S`|Z6mjwANajK1 zsHNK*<2_aH#ylFrJ~HRG*?$(!fPTcDQ7lqb@uIj8j_G`A!*WgE-_8Bkard4CvuJNR zCZ5^gh9w#07b;RZos{9WniAA@ByePn3Tf0U_m~@NJ$7N;H^J-}`K!aNS`q(7dLIk> z#Gq|%2XbWgwKJ^og2fX*hV_}zN>KSrbsO3|WJpw3G+POFuY5#2cFd4mOY$V& zu~TMp9`bS~7TpoAWUZ!h$ckS{Fi-5hp0>CkvzVzOiP}PT1g}`EP&{=3EtFisA#pZ_ zcz4yYJi(BR4V+@*fz8X(w1xD(#*iLV`vokgZ8f*2L{LiQ%v{P-!FdE+phLSwSb~+8 z0;m)YgYU=ykL2=Oz*tx$B4gUdLdyD$?7AmCud_yf#mNNNLo_Mpk0<6C8*gu5K($vP zo7%@%khL5(IpRF+p86Kf@-}oFRK6d~Tr$O8x>F&b=L0pz@V$o8J7x}>XLubvI;)CR zY{LM22HtW=BJD!e@95;x}a^l3s8&SK#R>`jtS47kov$=#=8zsHxoEr zxF>SJ*rt&e{2kiX3sV0vcME+i=|mft*v4e6uY;w{{o78IAQ~>CBivWgEb{4ni<%ld zJyxGO;b3)Gh~_LZIhf>F;-Anr!Nkr~ZS(*&??VeR9Lkg7v@-!`tm2ym;)0Yz5wox{ zU);R*hON=!TL}Hy!f#jf?hCrp(1S`NY|)?^5(9wD1C#A`e5c|=j(>al{Kdvpi z+=I;f0jQFepa8CJ+lTj&^E&<{9eW}Lp;kpn4pCdn(M^wstT)Afm+9+mlmd3KeGpjq z@C+%drjH9gI_JTn2R~(yE9xUUn%cJKxYFV47|LOBIdFY>B0C*2305NTe3o$tGcx)AF?LSPnT1i>PSUY$+qP}n zHaq5$>l28DFMxjG!J*$~qUY0If4f zxDNx<$`01P4CGaAa{_yuWT_?SIG=$~I__FTdG-uwbsi1Uc+xG(w2|Wqhn=$SbdBkT zSV^p@i(dCrLW69`_}-5-NXo9{F@kd|8Am~hk{nAQPg_S&(npfLKIUext5<+ZAT$k+ zPbQMz46fx#Hx-@HzY~paP*O>Q8epN!k>S!knEe~?%+~!-no{&Qy5r)uHS;oncJI>% zBLp_ckA&Y2SUZUqC`IF~fo4I~QeJNQ8l6e6XFuq8a8exM+uL$Qg;V=0Vmu=~YTK~` z=Blc*eB{zeA8`u@=Xbq}H|SV(5T0Q`qe3LA!>EYiCOfk&hEX=oJlc{0b7(}%?{^?l zI+0zBD#{WI>@(FJByty|b=PZirL1kmT+E?W&Df+{<$D%k&zHq-={{0WaLK2!`HAtA zdY~?lzZkPp^ERX(|2#B2gI0cq18NG-h-r-s!GMmv9k1R|zIHfl=@Y%X5H=~tQQO8x zbwMHSe0)oL1K5ZHi+nA`P=y{jVRXd-Ynzv_;uC>Iahq{v5UvkxjR#NTjM7)vxp7P0 zY;{4w6YA25Gyul3;kmwXeu>)lVXZLZXQM4aN2PJuTUI2}e}*_edc=>Sh?OE7Hhk9<{=9>dMSfye^LC}NH^e#jgBI4*Re>QCQrA#KXi+PLQm z@Q~?XCTvrT=AGzTn{)APG!CR(Y5ZyZh2Qn|1f#*48gaSzK-i45!#zgBMIw9#rR-GZ z%R7j5!rv8g>fUafrQ>BS%y7EMSeHaHSs@P+Q~y?cLDBp*U30F|d#)CW&n-rlKXv*& zdu?>lWvSbl)oDLEV5hHp$#G|${UR0)kc;XJ5Tuz*MCRdDk1S-Fy?~jV^$llQ3@FG> zxO2ltL7U=0C@Y~wuMqvZlvEe6XHON%lu$Kp7#yKC;QA*`;8p?JDTz&TREso!wsW7% zf~*cwlkjA4KICQSFg8((w%r9s*+BXw&QlCEEuCEBLIEO2vnf+XPN3c5xYMUw8&Cu(4jj^H@*!=`FPf&Q%eFYp;pz0z{0%y8uI{x1Ef~&!r@pb{->i%7uSki^5 z!m;ScrPtA1#f6RBCN*Y373eYTJW(0s6&xDWmZZK%qHf4;E4mHDpb28JZq(~r3lAEl zt<^v-4d&d;P8;iTXI1W`ZrYg8Zru$5M%OjVoov~zrel{mNdxRKZ^|UtkGW*6bEt;W z`N530VyIsL#m{hjETpVeR%IkMOb)pfGcs_58XT#GPWp#uIe=V-KS@~R{g~LlR$L0F zuXQjmy!29{5d%Aa-GX@m1(y;3!fhkRG2rjoklAC-yenr>4KDgtTUGrjw<~4_*~?*7 z?VT#?wXaCj{cN{*=toizyuWuxa{T+sTF+q$PA|Jl`=zVO?PS5|U%&%j0xybc(xn6z zoV@XI^Mf0gfnU}WPIXc1!z77Z36gE~VnT_hk}Htg%6s~+5`JcS^17^4oJ~)CLq>YoIS5!cMUL%t~{ua@QS zzme*k<}bE!+osU{Qe(U2B}*&6r$k6+$lFt{E1Vxz2^d;jW-o?!!*zYuxX@)3n6Xn7 zA(xd9p!F+bjuHZUSUZPCWc^Eqwb!ilC6D{RmUT0gmq^sLYFA8GF6(n(vMTiY7kEjm z8fIVd74XUdpsGV=`%J%QAM1To!r=$ZcLu=&>)T~#ui7&zXL43myECn;$F)^xTmvyT ze5bSvo$s?$!+p!Q78U0&jP~&wvlxL$S8Z2FVZFRq#;z%^M2|eB=u+bZu^6QPo{F~I z)?e7cLCYPcK%^{ITafggXtcPKbE9ckW-W+th|w`aVDx+&XQUIOM%il88{*3Hk0&K#H(s86a0Y;Ivm=;EP@crOd)GbJF%u z+#OYnJN$Z8C>B+gwF!-zIueJMk)U==!!NujuEE0=d28=lNp1__My9Zj0We}n`QpTq zs3i?LqrTFuZSS_3kD{A|wn>x7@NA+kT8l#&0|O>WqMf8mV+4KeXss*1i_N~Q1E1l# zL_UcoT1ERxs#aZs$Hqk-kdd|m&a`{tztVD(C!ykCQUZ!6Fjj+ltM=o+ZfAI_pJ{@3 zVpxqNcr?&N2XunHUUsLJFA-aY0W3G@0ps@DmT64ZNHc#pL}@6}2;Uf@W5O%{DM!7u zST-a-;wkbP<;WoBE~Tbf@mEHu1mam>J(nje-#b;3=WKiZ_BLM)wOh#Er#$RWA=7$n z9SHq%6ZUNG#2 z{r?)L<*|99?KbQuhnww6#u9e6PcEM?e;&p%d`?nL^j9!VwqLY8k>(kkB3M7go56>P zo7v@AVH;sHfv7A*oJjy!CK^@%3Kncf3IL6>2+%J&K0X>)s_R$-w4Y9ksFaKrjB zFaqF^{NYaHe(J#mn#|0+#N*=VxY^+tWIF^W_ZS*O*D0MAiN&|nICd>psZd3<6pB--$ZUeS+jm&(fEQC_o0|T zF8O|8P=XZSp{c+w$bP3P3ik+rbE&U91->(Z$1;is0^^^>gb$G%uY12RB*Bu~Q2r&f zpV^Z3d4hLUjc<{EW&Zyj(tAPxlvjKa!2@Nz`-L4WL=F?YPcHl*0Qj?A-qqdA{nR=6 z6_{U9ejcq2FCR5P7D_~ZK>$Q#OeknfP)d40Xn&wSKY+hx!gK6le?(++B0|iMe~gm- z@|%~J{iJ;Kt+)#WUa2fiZJ$~~XDY-jJ|P5xqpxtMs%-5rziEAw-~4ih33|#+EM@=3)f{H@~UZhc0o8 z7mb7Ov+gg0SI_&LVn5&eS+3NzZ?x~p?*-)H8G4@djBmcS8F6myGoEiY%8(hBZ%&I( zm(#)@jh%0!h9761?>2frc1B;ft+ySH^BTGwE&6}2g}>61oiG!>^^JS06}Mpk_QPWH z(sSEzhyT<6^U_62Xn1ifH2|M$^nSU1LYw;Cc3rvsV^NUTFmU3L`TYd-{^s^$z|QpZ ziOa<9#=;(?rC-Z-2wnd=hpPO~UGh@_n~AL1+sLI}+-=c}!v32Iezn|Ebw1mv;Gam5 z7Y^-T!NH%|C%6@+&H));;lueIes;6(uU@em!l?o@jVp4wb-+%{Dbp=#U6o5{S3 zYRT|B!wVIEe)K#=I@OAmX1r-ihBrknsDFdLOeL1R(OtR~cW!@LNY2Be8p_%05_roR zQ8#NRd0O8)`eFi|p}%K9op|YV5A5R=d&lqL0lWNhoGIa7R~d2F?HtqauX?`-AI)dz z%lk+;v+RQ+U`K+w$b-V3R)c35i_GPu_3AUTGaxb8+;0{>{O(3nR2Cg{NtzDfKjD3kA$E(ltSc zOr#7d=tc9`6mU!x88!sf*kb(<6L53LgTf5rCol~PtmuG-(@UQMnZZTaS&!!4qm_G( zZEu5?g4oEF3aXtmO=SL*X5>fS_3~PD5VQYWW)`7eeMmnx_h+#jsJ(fQEF>8PGob3A zRSQA$k%jy<=>|-42ixYMAZTy(n~J^;*-zU$_99~HNk*U9s2B1PS94qg+pRmKKkh$2hrVVw3$+KL&=QBQ}z zY_|l8U_Om^oRwkXH8gT?sBDo7?M7FVW3ZifTpU@&;GOc#SSZ8BQnb)EzPkm01IIdt zH`%q~beUuMt4Nt@XJ&YaIfoN2g^BrO@B+b(m{JeOs=him8iUM=2OTBZi;#QYW=NQu ztISefdb2L-J|vt4q#6yPWd`vLhDa|R86=2X?(tqfHMl3-MM>ZdDJm2&^cE}P^-wIZ zo*Eq9iIxvrx*Dq$8JR)Q`t;-;AF?aIf>C=`aC(ng#+(yCqjW1o>^Y?(id zKLR3OuVbmF6jOR9SZsv8ih64lp5@XI3)vYx&6r$|~k1Hfe3n>BT)*FlcM5Kzq&;!-kB=RK=2;xYQ&dyxZJ07oo2nuou{uXfT#Lkz=aBB$nHWb*?N?eqnW{Y z`}=h!YCtcK5-G7v3ZA#W=3Dr{rf-GgLETlir3SU$7J|Nk))XYtxrFK`Fhs0P)?Ty? z%Q*a%!oiuy{7ubC%BATl^c?j|;j&q#8`69$>MZl#y^>b$^)+4e5P~jICpBrS06n)C zN28uNbvwEI3L9l0q;m}m{h9MsSEgU_pYQ>$%FTN?jL(5~S zc+<_fZ=0(pFm#Vn8QDb|Oy7r<0@xLp5fq4duEcebA%R9@3t?R~53f7!U(?pFW#Y+C z945&wR9)r=_@yHaab~=dEq~2mH!P^FHgG^mG~%~rgQ5#E0y7D$lx}e)I7Hm*C!4T8 zg^}-LCQ8I-Obxw^wD8lYZ(lEb>3vx8&HmB#xHmup_#m3U_kJyUig4@DM*u9?TMK2n z@Lc`a*wL&!1)YQ|g=A!~md_*fP=WM}A8Kh`Em^XhH+Bx$Fl+{)~J?gn6nU&@c=Zu0cKh zv8ksVV9&OnY2ux4WN>2~*bLw^(XY59Z;K%>W$T-*Yech6@`f=$ww+QLn7y}`ZM{U* zPmwD#14&0Ps0rJke0XzDyr`5qeA#dY!O0aHZ_e&K^?{A&M@gsCJ;}J4X@w8&21`T9 z=NMRyu*)@~wl~Z-S3{jwOg?8BdYSp+%9`#_K}HD!8T3wsQ7&S06fKoQk&KS+QFF?i zkOMU*#N#KomOSkaVJOq*e)|}vmJt=6NUCF_tuK+1&9hknUw?iQZZh^YN@$x~i)a(9 zW#rbHUahR^CRrr=Sax17BV(gx>QK~SXE*yYR3*k=99$tyx>xZmjIvTlIXa}#Wvd7!(OcyQgf3@l3@GWOqI|?hTbB=TPfFyJ_tn{ zNCZ^ijt}OZ%Wqwb;D-N#%tbR+3LVn-s>zK@WG6z2|L#u;j6|V2$VoZ0GGNPh4aGF{jrETlZFkY=+q`W7vVv@g^Kyj*u=7qCN+QD=1Yhvfi zyE&vHbs4FzGz!4h#+2Pj_o6&KxU|k^l{saBnQa>PAc`DFlYJLAi(T@xy?jumnRs4h zG^%jt=mZBC3G8T?`9H-&Q`~5bg2t1T z(746wWi`_gYu!Jwp3o-&uKv2Gbs%!t4{8z=cjq_QLU}`81i9sD-3*lzCp>(k8IbO1kM82x;Y&IeMGJRKa*%KX=KM`MM!f)`p#II z0mD9Er`j~SA&hdOpI}M96fC5&Y?QiS_NPtg@(7!yEY^E2c2bUjV^7atkv67kV7BZn zyRq&B?RQ6>VCP&odn)X%&4k3=P(@6SvK+9R<#}Nm(4?DW)&>Zz<9S3JN_<3oqaWo7 z8?75d2n@Olnw2yMUHAS9Tdnc>R@Z8STng873F@a^S6^+K{-m_2_-N?x7SdJjQLm2V z|7=gUE}{tU8y9_?ba=ooS~2W1$F1rAe6$Pv4BY zJ{otgeS;dTlbq5{()H|>Zgt4+nneG~WwtTh7dkFvKR8#!UnE5|j76oJ`NoS~8X|$) z$RC6;=IzbHFk9!PKP@`kv;F|bjLn#>pV%>A2Ir7R4pbmKv6{j@b+>7NhoVEJsQlSw znc1*CP12eom@S#ul)=b!i8f^4?}hq9S#zL-YyT%^Bai6F@XIt*iduhXW-A3%7c=3j zqvi^xi{R3bIl}lCY82wD_pZR{k$P zo_JBgCaCsm+&5O$7RolXYq>3E=9m+vTV;}iOL$4uFM*jNfgK*|J2gjTiauIN!R#vN zW8Gw^K{LT&1H(=vs}HjIrOA%fiZ03o70g*7aevL|p6jl=9G)lAXJo`oBReVX+Vw^R zcc@A>hcqD*n6tDW)6lo@159l6z}d5>f+i&g+J$q{ne9>~?>dZS(06)Wok*n^s-h$# z{m{_vPo?xiaZlpM_*v`%lAAA_5o+p(seUFJ<0y&7c$$ApDa_WB2PapjVzs|24S%3V zo$(gE`)=eOwHFu`sq$KElEjA7<`)x|1>J8--;o;Uv*2_LC6)N~$&wyew^1y(mepbX z1DoI`t9c;gBlzU@F*aJ%Re*`O3^sR%`HDO=IaBO8!||2UFy2W)Ih zJg}7V5l#`l?KJWg2FN;5+cON!U-=0dbj>l|r*ode$!k>2 zKQu7EGv8@NH}Fqnnz%Y_Ibi(#^g87ydiZl_K0k*Xq8n)`%lWYtxh%AWfZVItg4a^4 zO9;px2ywbfAiFa+$Tj^!ZDpWF)cSW491p9LZ``EV#v76J;*gkP$8?4uV?BRC;o^43 zY#T_6eulJtI>Z=}!sDV7<2i9`5@kdVk$TeUj%NQopVla4z|I)W!%1##cu!Gc9F{;H zpOA!6#`4&pA5P^94u65{k&b_yQ59X}!OO1nxxsumu9b(yljA|}#fi)*K z>Bg}YMAAJJN103**08|y5g75Lp_XW;lbKQSKwNdg@m@=CvBb`}ktR`7Hex!dw%Yym zT^;AmC7?=zKrHN6ZZxvHy+#Y8D@i&<#p)C}MYlM1gK+b*t0I~JbHn@{#u4&u43%^W`U$fQ3 zxUNW$oy2fgJr#2hy&xK=r@V!ajdy>`@A=i8;1cuBq`%wTe|#ly2GYeuZuneRv2rh!Og z7q-uMj`hkD;8I={GT1Hqfv?yb(?f>RzELX9ubq*~Sb=BSCzjoJ^{X*$5Mkp-r1xy7 zke`Y#*_zdnBWzgSRL^#yw5!zmNt%aUVk3%2b*slb(Rv40BZ{|ZX=hRQO@48b2sVSD zfjWwP-cr6)89!l;I{!t1z%Dw_TUvRr>0 ztVUwxQ%Snhr}E^;wR2D&Yu-cOj?RE3D4 zKva*jn|EYA18)P2(%3B`zP4t^ zc?c2vl0fom@MgsVRX`mw)FP*K=vp1HmX4zv1GQ<-W1)1Cj$rHCR0jXX;DvwK$IAyA z@<>q7F4bWtJ4dzJ(>4A7DW<+zi)QL$iN?jAW!n#o?mV|`B%**_&(~H}s@OeHkSJWZ zZsL;<|JA?rAoJnA;BS=y0%t&9ofkFQNy`Qjz4#9hg#o)1(5yI!w0}9b3!5du%gRPD zBGK*IXK}Gd2Ixb86{JkFm(^4t3u$6x9-$Po*+MhLr7OXLW+TvQ*)A0?6IBTrp>J}a zQz-j8N_V}z4ZT{{zxg;VzIg>(`(@nqm`AviHQdO+-a~w~72;A~VNez2f7wdTL|T(} z_@ZuAASUsq^TU&IE;#)S^M>fk9Djd-yxhqU8Q%%HEbv(?^A*NA$BY@e;q^^L+}VDw zXD?tiD~>9Qi)>D_r!v{>yrx7VH-c8pfFdmFy&rSF2rw(Qt&tmPNccN~WWAR(7-GRI z5X}KBpN-6!m&>c3N*sndDJT{r+}C;6ceCOo=S7=Lns?rgtjP|rBhT9IiIJ+I>hxb% z^%=R!Kw7-Gs_Z9=D?2>UbdZ1OG}Tm85TAJOUc}kU*XTWI#FU3fL1FnE$M-jNnS@Sw zRHfDYweZ?1`B=MIU~fy}L!Vp?5ox$@tN_o{3CC7~Ia;k@R5KAaV2tq*4Nu@B#s&gR z@tZ0WfO=4t7ws$S8wpxzi(G$N?#{mPr@SktsNhmYVT*`QV}C(U;7+aXP}AdTif2A) z>T7`@P|ndtCYqp$Sa=Ws*DHI&bZLiLjfz)Mz#8+rn+!r{~%`3s)6VF1f!gXhh( z%K-CoH~ny;{ZLg8mR=%U6L!}0t)nyUH*zZ<^ie;-?dR$&rWRHRx3ga@fEPI&RHdUq#;Pd(rxSx1lZh>t#t8-Fz+9_Sy4DNMFlFX^j=$~mojeav+tqt4y2G5g3SH5V z*Au1F8oTEXB3h5OTUziWSBIdIOB4Phv*>e>4cRritIa=;crC zU_1XrwiH%1nK8TTQ;8yM+k$#&m&o1*r8m_C6%9Q#9Iqz`@h$H`4NZRVZsQxw53K7b z4?qduUrv12{C;!p_{Le5(&E6Qq>1NWsezN}7AIM5lJ)dx9p&8jstP*<07Vi0Ot2u z7D}_6Eure!q^-b<#RhZ06-y!O_zxHg)ARXx6gLe1xXN~tE0@l`hE~NG3JM_a!S!1M zlOBO?PwkA+;j!t_a-;Vx>s0#T7|i7fxb1MD0FJYlLKxN1qW-x_cdX#j)$b8)RT+E- z?|0Uqz#R_T$VwRW8O|&?eNm*2`=nGH2W5&Hf(*MKdj@v0wYjx@?HY^-fk0cteUp%WL zdJcQr!}m&PpgOGRPX}Vs*|L0~h{kaO#sXBwC_ zGq8nLiKq)tV~R8#voL9kC~g-H5v^J-{I{i6%+ds zWIS+M?;izNS@a&5j{=P_rS#g4dm(p)Etul2Al11fWG;>hsYsl>CQRikioY|5LZ=xn_^YXVouK6g;CuEG~VkVz^18T^*pTXOxLd;;mC9vkV9)380-g# zD9YR7P0KI9`U=N$9Q18Bo_(roAd`gRh*K`%sj}P0J!AS(c3;lAFmib#{7MgYLw@&C zfRuS=Nzn3p640|MDjnVWCLB(H)X6g49BF6l(7IGv=%5|~5U{61J^Nb&W@NB{bc2aY z>pxgH8%8NHT3*<4;0(x#Qe2DY_v*Xq^i^kSbOw?8uQ(&iX*256J6bD}G&SPWQkt`R z`B_N>{TqsTu`3XO0+?-bLC1VPElrpIg7FI$$B&#It z0!W+81Kq@qm{QWx2qZ$j=U|V$Pe1Y4;W!+|*OOSHeYk z{H)m#)JCC7ZR2i*O{>z(&6m)SIM}?-sVbsNG!`Dm-lKm<=u~T%?T7d+Igz=-kq-=F z(SSt0ay5gKeXRjnZ~GwS-#S-y`3U~Oy`;6d{`+b(QR);H5I6SI`2AvqAbUIl%;e6l z2c#C7fACc(;8guLSA{Dv#QhwYTxMFrNGQZK`|T~!-~RV3D&IdSKzftRiyT)4`*Uw3 z7Kx$h^AW(6m6EQprY5ZWMKqiCI${||_|BQB(3Yj{ZYRH5JWgZ!K`4{xJKr(RFBF*v zKxFpf#<$WE*k|NrvUq~%D{#^J}&+zxme7WjA?d_J{1uWYQf z$N4aUxH9i``eHDLmDWPI;?r4BlQ*l8PWM&8tj_G(GmE#7W2@viD?oUNmxw zR@~;Fjc_{!n54^{Ms)I0N!#Q>tG;FLsfV=9BgU)eQw!&bO;CBqnhT|B*sUt{pu>s% zmLxf3O>VS`!mW(hnag-6|JuKT7wqJ`>dez^+Hu6vaV9!^=`=moJO10rHE*=(%d3OD zIGI}TTw6WLtU0t4a%V-XEv;ZtFQfNa{TEsh279PRvP=b!@8~Pc_Ye+fHOv1L5@J4h zPeirISF9K|J8z)*Wm=4P%IqmhD>33R_-B{%%%yVlnu387M4sx!30tJIS0EGz%gad8 z(DwSKc! zc49%WU-rj_B| zen#_HBO#~}Lwd<2>GKs``Nx@6e;p>KL}jnF8L7>ogY4IqR)t6?2^CTYT6#8M8g-ktV&zxGp%*fxTv7&oRtQ8T_I^44M9ZYG8RV;us^!f0f>`-JPYVT}hYf3=oTRjyjOaxexYLVFqG^N(h? zZwdNVAB?1QWjR5WSa5NaVnn*bgRnr7;RjGPTm>5`=`1{aqj-J&*W}Bxh)9oR11Xnl z<6xK`2J7}xYk`gq3TfGKSBuND2F1Rp#V=tkJ+N!AzC{pc>?=r&f5WWb zAsaLDTa6eA1ZcFeyA{EBi^~F-jn&tqBl_gP2T)fE5O&rkO$^>LVEZ4_Mnj@CwS@-; z;!3Q6>eVPHLa&23hHf*7M`3Js8sdu*;~`1@=T{mwm{ZC z!xBK6vqf~i!aK9E&*}3>5Jjmx%pRNWg-AxDV(tHs32%;FS>0*|Mm*>0f&={lF zv*GbvK~S-#7Xi=p-o`&3|Nby3!_BSWBLc^zz1V4P^B?UTtc>04_LljXe>O%BaF2GF zhDY~*)m*Dv@ZO314Tylrc-)!IuRY4BHawGT7577SM2tx)uEYzcl$x$2VsFYTtNh%0 z5|Y#zD<=*R1(&t??xXovZGVCt4)jz3@Dxs6vn6>3|D%6v&1bMBV}CYcHH;o2~}OOUT(Ih+GjQ5s)?;Mi(j zl4)}hC$%z+jfsxc?HX2j%yEY^KBuYI*-$#WwBw?LL;?aTDUnf(;9C4n=kn`Otp^EF zk&WyEBu18{YaX&w`}0$J3*3BBsu&mn|_puvwk=9V|M~R=1}5wYGxiG1pcB=vCI+ zu?^nOONo+QxYa{CAc-W4jjHA zN(f`F*o3@uIAny2r}il`DEgvW3wq->>O6wtcjC9;R>JWOa{jE&W?4c0^sFVUZRB zU0Zrz@b5}UMA~K&=-sND1mvlFxY~xBeJ;o=Loq_C>*G`n8%Ky@gnz!hToCf`M|`qw zbkQ|wXqg()HoAZpkwgZ@yP>FbJopN@zhu7<6lAAj>xOySJ`wnpB7=zp-U^_mY*j`B zmR1!%K(Fero#U2DtH6E9IFXzFr3A8g)k#2cL<2o3Sf4W)t;pAU&%154lBQ}LfSS`U zXRpAk`egN7*ESuy5>)%gOgKwp@gDbFhI}+9L?HD#z^oUKbI%BPBINrqXswuI5sKK@ z(KmTFX|nKr0m#-c?Tv?;SzRBy46SXNzYUITmRnMs zldNw0Qy~~VIZAfbt24wVirL!ivEE(v$``pSNRUOfNeua_ug58!lJi*7oEM1c zwP0{dff*?jxSVS&Z5ltNo(pBUsG=#eKnL=MMDoT~7<$h;Uvo0H|Y%0iDpX8q{znPGxkZ9H%179^fsasXrTsiYdFtq0|gViruZNU z;fjM7k-9DqAZ#gaqtlCZ!y$9;9#``3*Yy%^%kEa5HT`6~&_I&t=TFN`zpu+zN7I=Z zeiav!6px>K(7~dJ*N2cTnIpTdN=AddeGw%rFxACQnoDP{^A=l6+`;;t%l?%67rM>-u}f)RiQ0vXi+f(j_zv}}Uz~Xr>j3+Fk!k4H@T2Y_J6vXBgvpL>!(dgM zu@uiLn46g>XS;3mA)rgzJOD^Q_$;Fdi@b2zP_%`PUpb8 zt&{|Kwsh!w@u*b3qxw%Fvh+jt`tLr$B$^Um!eA_Hqp@^D@9ld$lw;`fZo14&;9KK& z6GXoY?;Eo<<)U>GBYHf4 z$H;st_!<@&FIT4fxSm#9|H`>JVBi6X0uus3 z1Hf1gU##a7FkJP88tzGibQI@!Y|7^+^$3f0G-vXgAlL=80mQLYvdG<(pH%ACzYxxW z&Es|oOc&Dc>a=iPv(TFuwduC{%>rDXS!?oiQ~Had_88I>4`ZI`amq6*;&9Qo<_q?Xk=CTP&S?{0*I1%iYS zu2KRor8&uX(wv@yc6(C#D4BGqd4g7z$^?sd`X7(cV*-3gBeg4!=T0}#)?BxCD1k2d$} z5yeL&j|&!UVABLnyB4{m)aP(y3}6Nm@r|}r8|F>{ssMzsTu%9Z*A|ewNje%QpnN|U zh`T3&K(Bob{>nLTky^tDNl8H0WcSTrt3wjyj=DpzqLyTSxZOdOar8xg%|lx?kLGLn z;bu|6j-1h9mo^+~E|*0lJMOz$XiQ{Ls*+9|d<~iK^}%Osfqw+tCiP+Z3DkE>pL)c@ z@4X3nWRNKotxo$-H(h2Bn5YV^>+3n~OE0IVkBP4ORY?E75mmQ-?-y)Zx=A3+FNv`C z76v?Yy-YmKf1lv%^)(7Btuv$78%rTpTw{-lpECxY3r>nCqocvy`{5wJ^%&efBmYp2 zk=n2xXvoFvz;DIYWGvUh-|o{i7T8j$TR1aI6WCXY9bED$*wiEon*x1=OMd`3Z`N7=ULDh_9cu{K~r z=#>Ayl3DMhRE$?i5~RY4Y6RJ!`$@hi0S4z9R$#I(go*$m-;iagwPXf2TklP1nLJYf=nGggig(pCdaAnV4IF`|nAXWbEhd5qZLrnwr2)frR-(BV*-(s}y*Uab#08h?N0F?q)Fom19; zVwx!h4rMGBCi~NeuSn*pYw{#(9 z4v*0gixL_R`e-PzNlG8ZFxM|A923QS9(G3v>aBRP)dccnbS>p5UFn*9H>|hMk9!6+ zbk3i{x-3{5QRA$N>S-8THuv}i^TOokJs4!(>K5F`;Uey#T1a&&shZ(9jgj>QYJmz6 zb+Ef$R}Y3^IQ_&D$u+#K)8-%-_0HAt(#<&KwHm#Vuy7trD5493Q5us|fZ(MQH5&7+ zZr5s#Bu4CjiO%23+asa)0(}@4RJLTQB@Gi)=>_CYa9E6M?SSfrcA_&9XVS;U8TTA& zX>GRmH*`gJW2Ku1l{05z@|7U4=d^RV1l09l;Z+ZvYefob*JHc#!|iW%wj zO~b90z`)65<~HNqquv4<=0B2giRq>eN0?Zs)dFk$Wq&S1JPUCCAn>y0piw3i9~lRS61w)$${9g3 za-;umUCGN62?hT0E@-*WG6!5sWcrtmYn{MMYXT_G zztlb}`dhX5Cu;6 z(`vFFiltZkF{& zICr~{=hi-T&}6k>iGxLDpvsQV7F=&>WHitYUc&Y`+^&eaHJ9wJn|hM=iuxLX{pSfL z#y1v0_*?41Az- zqg8@#0(l9a0qmK^>Bi!C9b`zbJyI5Vi2rdd@$3`!8&X70IDE4avlEANkl~- zN+JNc=QG-j(CBv^@m0vf!YdCk!@KUok5{4ePH ztvl?$3vkq_Tl#I3k**cDT3K5SMVm=Ba$_yo0 z{;Y>e=#J9aQR%A*NIIfkFOLxRvup7JdLyb@N5O%Eb6DPHz88~(;iM20I>j{^r*|{_ zf+>)kM5077CM2TUt|nD?6o+%az>3k1xPr@cK)EK4^_(try9K~Lh>L3)R{7U;s-h(Q z28-oBSO`zM&RRoOnsrMowxlW7}tTaC4+euDXY8L#;DdjWd5^8AO1ikBBZes_Doe39h z+c*{5wr$(CZQB)8Y}>YN>>sB>m_vMVJUu(-R7`=z3Yx~z}yf% zWm53O_X7FO)vUSJI%%kZOse63KA@5gBll3x#0Pa_Lv(Ma*T(Lzl_j2_-c)J*>1WV) z+(C+z_!Fq3E>)<`WB7#BMOWJ3@7*P#(k!#dWth`!Q`QIZC_XwL8ZXXKpbVVFxNs09 zH4;6>KRSpI?7WyoI<(-u+QvgBFIig{2mOYXhTv7bZu5yH@MNmezH_yg- z9)`_Tw|~s{%pK`T?&u)GKR>q?JF%p2@v4KQs}u8i1*Mc+$|h8QyQCPEd)rp(w!=<9 z7;-%&^dbnJ7^a54rxpbR>zG>UE`YTy$x|Q2`61=y`o~JaEjv{?o^D5XhiN(6;qk8e z0BE~(t3~uvoZDJlN%RP{-LIAVSqbjqS;ct8Rfx#I4QXJo(z4PA!pLFB5R^V6AH1%4 zDpvT5a>Ae_uoQ1bECL+3rX4cLBmY{{@7iaPrtUbtBQrsh^cs{Bj^$% zfrDvvf{?fTd;iR(&zQ9$k_Jv5zj|Pq!7Qw9+CGI>K-iq@NB~}TWNyrXV{v{%%bgjX zq9I(HXdc;cq8H`u%v6pClaD`4Ggo5d5HJZOdLneF~Q0`BLxtJZ!l7$IZYi zrclmqScKYSn)g!@g6IM;!%HiCjt6$`8?s-*=tc>2KRliHvq@qRxd%L!gC?1&vVn~^ z%tB>|64dJxkfsNeWVsuqC-H>!aHbr2Ir_d&xtHYMMIvS>XcnPe) zw?f=swzPZS4v{Cx7xM5S^Szl)HSO$|sg&yjHloc`RDp4XJDz0FE}wKm81n}WMW_F7 zgXdT)iK0T=eh4T*95}P`KTmvKtXAW<`dO;1$RnxGu%g`&y#tdQeoAI|fXOaUq=_*^ zxr!F#t85_O90R>S@75~(+mlqR$w@5k`=Fj6Z*2meO2RcKA-g>6I&2xi3g-Ku4u9-w zJ{od4NE~_$pGLEk-CGAWzSGPV&+2R=x9ej6BVr2J7W+YvPTMF=l#n{^FOL^*j|N6V z18&PqLWQI4p2tQH*Ujd62KxZRLo?=FFxrFR-%|v#WVkfDxRQiZVSk>HzhzW!^~`{0 z4UDVEbAJR9D3PB3Q}}2558*dA$XZ~{-S^Bg?V27XpM+Kq*;UQ2WL(B*HoC!PrLLzCV z0Rs;Z8yO)J;^nQxec?GaRfDHc*hI$y)y-N>qW@OIxzwnFn}j$>}`pQ3=R3JHgC_5Sxf=~ zc`E|$H=ly|{gm>#^N5HFTff_a_&p6Oxa(*SZEUQsuV0An852T@di8#Ti;YiD?~SPO zJN0KN>IU<+%B=q;^(&5R80~ETK_TqN^>ruI{I>7cMFCSSVw%5Aiz6Zi=_C2XJUD## z4>(Z+wxk2+6i`GEF%V=p4Ei^QePrMO6TKwrCQyvnH#RmQ2s*}3+6>sAVD6$_OlNlraSO zXpUilpRcBG4RbeCR5+1BTwo|GETF&v!QX=WuZqYE3jqX}g8MeN5WCy2l_R1`mblyC zjt~9dK=78Zr>m9WpvIYq8X5qGM-HG-lJ{E2F@bPgLh}H@Z@P&Cu}cCa2t*cf?r)L+ zFhcXdfP-%!Pkm$m=?e!@WJDK1@4+7+PYTFp$YTUTnDBzznjf6_!7{NQkz9Ech7o@=NK(ItT}KB_R92?QP-=cxZ>>8@4n;nbUAzjyJ-V?8 z%$@~=p{F$A(LAJ1QxB^yn3>dcf+MndWx53V2A`aILz0V6I3G54g7z`e-`qO)%{tQe zHRen^QVUOS=c642jpBMbOpRUia^(W78#y1F#7$Sr>L1#fzIr?)W}Ze}uH z_4Vc~1SjLg&gb#|-)G%<7@qgym`PY-8SuV?i#Ydr)?Ioio)Q;Y4BDJru9XBGG3_xe zLQrSRQ)F-Y0`6tzP=;$Z(MM0dMo{h#ntCa-lgTiZhYceT$_~K}qG^i5~A&<-dTe z(RAW(ZWQ0hl`G7&RnrtUM2Ik;J`kPej4%`RCOk3JjQ*BU2U9kd@o#{P-b_H({8{%6>aa^BOl2g`Sx z5mhBY++g2p^X)Y{d&{87T7`66UK7WvN6zktK@i& zZ5eDkDV5O-;^mmBxXNG0H;;*CLU+Zgvu=l9EJc8~ct~M*JBK_(v!2(vyXEoPQMj6T zhY_QtZBUbu%>QB-b3-2Gv~~};d9-jxqMA&CD!*V8Ka;aDe1-2$Xe*ttVRsJJlaFr{ z(nywI7&W@8jZG|Z@0b^5LNteCUNXImMCQnuj}eg3R0!_0%DX4hC3}2KEMWfy)T&m! z!pfuis-&@lS@N(ZL@{{a!aTCgW*P=HuUE2Eo$Ac{j;|rZ*m@abp0jfg^z?dw`iUk> zZ&Cbax2KT-r|y7PO(Z#{;-b~N*m88V`}RPNNX?~MYTzZ%=>*C9E3K3;Qe~m9W0Fzv zVg%3Z^&vKQ``9`Zz^@#@U9c~;Jl?jIoRYZ3G(zLS%6gsdfHg*U*7M6RwaARcd(>dm zl~-Hje4TZ1Sp4&CRAEOBPl#qx^(}opBV6Z8_+X>m%P}dT47^+(G&TOI^0M^!$?)fU z+pb7V0=H$K%x3x>>0B-(N(?Pr{hMFvJXmroT*$pSK5>(9(kPs0@2h0D*fDPiN9!!6 z=a6T_J{xpBt)xt$YApA~p1E%`*594+=70mx0{F<`JvThR6}>V2+$yPe1_`9~zeek< zEby5;FmFC|Z%hmM0+eel`%Sd*)AX$HLuGj59{JMKV*`7eVd$RpIUjHArpADdQ{8wbU1S|)at7~`5Ng= zTEyVMRmI|>rntMxgQ{I7>!s8PxfeEf-lM~rR$#%xk|ZqjU{Q&@2Myx$$&mh$lbdQ5 zi}T**I!~N2iH9$lhtmGqqe^~IddeNQ8BviiMu{{$5JRG0Nm?okCN}YK*e<+em`eEx zt?-)J6Yu37{+jQZRbI<^h`zDOSfnjMZZvo9+?=F3^a=W61PFX-J|1|9`xr#>J56F- z)i_|(&BOJzff~_|1C*cj7H$kY={}seCY7_&e>?7Ytn+uOKCHEs-+fqWbWm-me@Bjx zq_*)KT*!OD+dXRC82A#Tl2J)q8RMwp3s6j@mpsG3H{0f7uJkr+6~CsO_rh_(m|=Dm zwkzaO<-Dn~9(XXEyG%?W=iH=xk+=%rx~xZ0+aRzYu(p+aBA?T7E6y&?{5md@VfeI^ zqg21TWl*VNq9t$Io1RUWzg_y~a-Di5=57Wn1lX_SSdhZFdQZ7)TqlJ!Ovs*DzHIM` zWLe~$zDnp)oWfjnk<#R=B9*_ltl3x>g3C5vJgqE%v#GH^C(nSHy(GosZ&Yeg=v)Nv z8qe{Dd+88u8BSm^8VaZ3paDc2a{6c|(GoP%{d(vJF80)(fxS1-J!NN^upazSRzCGCPXA*pDPb3{!s zC|lG%bG-i?1c_c3xO0geTfNNeD+$&kgQY7MMP}sA#GP1XU#50tTz`}!5WA26Dg9vi zfhP$*y1wxShj#3N?bW{+2DW~U0;t0%S>9%7Ez`{a|45vGEst5%_mKj9_Hd%?%cyA4 z+eam{>040x9my655mYty`sJ*KFZeko5q%bS2`d{_1kn$2(zD~B-&0{XUW&(f;An{= zLvgKlg@UXU!w1hV!3>;lArt6OOS;mf;j}c_361=lNX(Z0?-qr3G50&+yW^W%cT!j# z$DM0acKI$3frS&bms98rA1 ztzF1chiOlYMsXl#Ud~D634)i9QN0pvmA_%t?Ld0F4c)qG=}5umUwt)$hbQ-j>*Rb12L@zv&yVx^tS zQl52O*iyphT7Rj;*>k!-8dnX7|H^EE#yKJGbYueSqVvpvT{z{gvgesL?P{1S!8j37 zF;n7X$AICUxbHp34z(-PK&gVyYt-PcGVS!)`^8Hao7_i0AJZ3N;H`kW%(c!XNUqx! z1GzstG@fga-t0$PfS1BNsp&6&$~m+&)tK8r}2p zGk>1$V2A~tg!sp^j}zy|OllGP)nn`tXmA(bBqy0zgzZQdjEn_VjK9sjhTwvua2Do4$G7qL(a7i6PaZqo$w1*v7ykj5)ertG~!``*!V9 zXQ-u33ap40yVq3@ZBEEn>2QA)Z0{0>)p061B+I1@%6%f*wq-`_?unjdU1M%=e?`Y{Lz$`(Z;syNn3qkan}4jjvSZ zsYotv3I@@p?xpq(_f92w&&j2Z4qhX&JV?WZ*}a91CChifDulk_rY>45m-_@;3wuhE z_doeqhzL`Ba_hWr_?B6oj|@3WGn?;c_^6C=*lV3^PnaUytBjE~#WOvmlCa~!ST)s2 z{}Y4Ei*>*0dpyqC5pN7UmhAnQZx98P@;dNOwjhmVXfWQ_z}{KF>sSI$Csf@2syQxt z_2t}P*d(t;0CLsBF`^B%0%f96KYRnXOInZJVpao7zSE>n?|X|&X^g2~2xOXcT2D9n zLByK=Bpw`JW$i4u!s9Gk;LeA5p2R3l$V!7e%`_`EHC{iW0exGADf_q`$)d2=rBtSDGdl^DXH3-< z^p$>ULG80IZPA>;Bc?TGllEikJTy)cmXi=|$$afotMviU^Y5#X*I2`%;S9m>XGDS> zPViORM7QO9p42X>_L*McYC7*`Qoc?$W|qlYZ4(qqO_utgU;FwNWf<3bm3nSZSB0G_ zhSF3_4wo#%$rsN3ddY0&;a*?00ke>QSHW3s8XwiqfQhXp54u#%7dz>d(2iemnD0yBZ z5?|aJB2E!>3fRc)u^hC`uu6)8oeAM+ehnA{y&VAnUIB@<3EWhD;o>b|CyL3d+;t_{fxyC7d1wj9*V@8;+;5FKcW#Q zCn&YL;6jESWFKUk;C^hn1FECrQ}l$_u*~YFCh(o0Q&dIwJt{wXFM4lw4nAFKPoD7W zF8KHjkxW#u;3T?1wISn3CI!t3D*MS4P)Cuh!k^g%6ZK4GsjlHYX@OEwl9DVygIdBZ zNwI>)awHPxD}hwSz#-BLp@3BJ1E?z}hE$Cl*>CfZ{=rZ|5Yc9qP*HJ|`B;zmGc>>VuEDdW9?oXn^%^<>EJdAm! z`8v1q&rR?rBb&IfqbUnCFdX3P{>v%!n|rY*9Fw45J9e9kax4D(<09{>Pub=`(Nh9; z1}k6y4VW|`ytsaRUSwd`u^$22@HFlgc#i+kLd4X`lX(lA&@&Mfh=Moa>Z6*n0tm6_ z=5$O-A3tEuWVgp(et0KczE6QN^zit*C(PfeJewHENf6l|R9YaQ2=ti)qKJhUIb^gj z2heBqCU7U=^`ejazP$Gh$a9AhG$nEsq`}xP-IlWy)VAS=V1Qen@Y9$ln$Ee_#&T5K;@k6L-V^@;_G$Yl z3_ElU8F80dM|vhJB{RCg172u>_?h(OzNx^!qbll>(GM?S-O&b)dSV5gAQp0EF%2pD zo(GhvaR$xLxhg0%n(6C|YJW(#HVk{QU_TW9Dj!*|swCr6RT>wjfV06zQYWHkFdod< zS3<2oWICG8$Odq-AtIk*4=9tc-2w0Hj`!qDI#XD!=Blx|pJHREOou7BcU@|+X!ox2 zI!gp2-S%VEP?Y_>2zuVLSXc17sN%;+cAy8Mn}8?InP>Fb%)7Bh&#dh6a?k6N%ptqc z6~Aq&Ugffy95fHJPqEI4RXtahrJc=}&stFCPcrn7F~G@L&%nLipR|D+141WRQTEtw z4lB{Ybb|JWn$^e^a2_`GIQ?&Tf~h_;9~&rSkM&<9_Q9Gb`pk$ci@t5uNhF z4R35z$kh30b`)^`Y1_Vw5*PRF*z{mfA;1Lm$YO-8Hn4Q8(lC{8d3#JpM+DVH`CRzF zu2|OIFVw-kUKb+Zj(FiE`cy> zO-rtgziq{Cc7ln#jK-0MACVM5WVm@8;n61AVhx|{`Y2aa>LA5HLaIjy6-*d)kE$_# za)vYXyjuA8aUoiH)J}g{z^^*StG{?fP5VUW@sfJdQAgA?Pha36(=A3}!7a(q;b2|5 zJW@X!UkElfA;mIU7 z#@Q)Hu0S8`oR@zkFZDO7B#P4gy`$FCS+|pUea`&Q+xs4rjQz&$SxxE714OUqm(sCv zs7De9_7YxX=Q(6>mO{=JC2FDeGK>feOGwCaN_)XGKH{K!d@QRB#qyLHt1oYCjK4s` zR}{62EE=2fk>yZw+g^%b#zY8H3S!_6nwUxZe&%W=rjBZ5Q#{5S*mhg0#-7o1Z%SPqj+usH zv%!&e`Ig2O4P$#=DV7IwuhX~8$5lPVR*@Q>EEMm<2-e+@76Bvzns%HTWU-YSo}D{a zdqUCnKAj@EPSW9hDP{bfN_?Nv$k6R1^fsoaW_=YvT?mK&8DB@qtn7y>6|Z2$v3^Ud zVLQ2Qf{Gr_Jm1!-G66iSRKi7M{$4a=K(wiRyRc{jpTeCQRoai#Fi<&rRv(Y=(cSSh z*w5{kWpTQW=|}v{WxC7V*Cl&z7CT|f@+Za%41Mi~n%q{ExZiZn%dZUArW$CpRl2Qp z=*sWk0TJSELG`XEiC>*bC^v9=Qb%3?nGn>TXKdXR0wLa4Kgm{i5sL{pJc=4ZV#O}{I}Nw&%G(jfWY!T4hRm|G|AuJy9G zA{iHL=+O9h)YE&pl~2Si{mFUs-alhi)r6Q7?eIsn?~!Maeq;z!~9B_tW^K?U^+kbZ21XIS97J62)uTZ z0m!&lemHFeVnm~9lAP_^&(7`xB=Uds%QXefrnsYn8qAta z?mU4miWYVh=i+Avoh>zX8v6{uMW91L8ER(G<|luh{$0vfRq|mY{BIw-RyeMKS0e}g>CglBx@DJGXyAKv z<{z4E)pgWK8wf8$(yhg3`8V)0*$#yJ0fV z3D-pi^6BqY4=GPVmROZN2gM*6z*F}Sg=%aS&`I-62gO6X*~}KQ*(v>@zt}p;i>T36 z$-?RpN@NNSwrNoFdGT~FIB)t?DfAGVS8lzzi00p*t%wtVMRJW$@anwrk20gVVZjf$ zKj*izb-*qbfLiJr=Txc6EKwZ$ZFO{}3BNOaS!^Cdtm;3<#4$NVAqpuTOg-iU4*{Vn zR3t>-7FakW_x-pziu>HNjM>F_cP-&tuxJrqR^7LD5zZYpH4rqRXHx~5LUM#C_7TTg zSdG~lr;?^(6Y8@MQ?xlj`b@pL-y2@c(DR$=bAV-J$)RkvR5&tI+l5vi%Bq8T5u%ZS z3cgf{!Fw|{^zP&W!jF?2%hG<5pj()RAA`P+uYm-t<6T`Z;Z0nvVkZ)WJqXuAYoBfY zwso}f!*<8#~NQo^7*^8SN(% zZf5@6z&`cvC2_Q{4FcxJphjO9W+d^)DSvkNCy~FWzkD_)9c~ zc4ILC4F~TdP9OHdkq1%MFjX(^;tRP(@6LV^rDUz8%4u|Lx6?;2AQPX&9cKLrLm%B4 zymcRG|5z*2kj`YtWK^utU9+SpGI-16ygj&nSCyl+!r_H29b-iPnQ7-Bp$rO+i51Tm zRbU09SIJ6HX8NK6pAR`nKP#0n73JB?HOa*7ym{)XpSf=enPnUlpMCforzj&_YO8Fz zt8^@On8Km<0dg4ikDHkWznCyQ*;3kdo4&e>YYnWGUE^CeB4L}|$pagQrK@I&zdKMS z8}10yK$!m)_Ah8t2TG=h1=~Ifbr!t~=i7l#l^~|7Wtvv#_~v1h0E;)=D{j-_u;`Hzv&2&{pnduk<&6jt{$A%ClwbUOtf zQce;Lnne=%39bYp#>LD3ynaa+(pt~YPV7{osNK+dM}M5l_(#?D+XQT73gAnw|DABb zHAmO82|is5hcZ2{{DZL*iqsb+@D%3z7?4yqaPH_x7XjnLWjo+^36ud81d2LmTs zz039^S_P_6Nfd>`bBO?s*p+E3H4ZU~K!Mv0r~5H!T^cOO=cQc9*u1>86&NZnVe->oNP1k-5A7RN%B_n8nX(C+m2aN% zkfthK?d)z9L;;t)mNs5X8^aecY>oY6eZYqw+t+^|zT4mU5}qB%$z=Q~V_Y@$YqQN$ zD0OH!E4{f$`rSY`@1=wD*cIa+*J$9hNoy!c$|rx$le(U>tVS4x^+Dvc0}Cl}?^=3cQ($aiA&q)eOb=#d&Og8p&W$V$?o~O2e{;()c%X z99mx#GNh+0J>3Qx@(mXrNPlNzvDrUZgDYK$$nLXyJ^gN2*ZQtvzU%0<4g(!@i_6!$ zS<%PiL>xi;W4pB9;svBl%cnU)y;nci{5_}j@F;bj{o{uAN(?+=#|o&Ok28K$pB&lg zM$>i-<@+^Z!RhOq^_t zO#k!z-`jOeTue-y|Hn2R+jf&=^Q}g*?0+pf3hV!lR=c8w8R>uBIwk+^4?eS8zBjAB zU1Rtrad=2BVpHifE8h)(2sE|R5LvwF>0!J}y)$4~AbVmh4ip*{5+e&57#R&>AW#$_ zAQ5@`eOvQG>mx%3>qF~NIk4S*VfdRy0R!2Re*5#`@olurWD(Xx1#c0J*;(^E#6M|iq5vQy#ZqPVy{-$jrq zP)~i>pmSdr)1Uq*%#9pm3x#uq9|$Zm8X6Mz;^GJh2oN>?#M-dr@a{iNq3u~UHQfnY z0&3rB%s)!sKY>_lT5H~4H~l{x@x#s46zG|4o1_@>++@Cbhcg1yQfB1*PP8`dNP0k2u{l}#D8%~L}vC%{A$@$Yk{zv=40q6E-!&$s`Mm<-Q zTNYMU_6K&UFZbtt;e&u|r6 z{O%mQGxyj1%iXhy58TeAUQiu^m)3f}yG=pW(|2;qC6}qO#(Tb8l*%Q^D!oBEq+nU| z54L&Z@g`;psB+D!(2-Uo2ZXDmllN4S#<3fY{v>C@wz8q@JKzB?%Xc}Q%w2`v>%*$W z-`fFA<8ctgz;64!loJew28gKL{QJ$k$@85T0N~*iAo)=%+WJPm96m_!&u!hqa>3Q4#bdkSM z?bbx)Yd%^X=-|`NkfBya?t3vX)KcW&Ak5;L6~^<%a#L@xGSSq5VM0+|;8$p<@9gDE zZm?-W_B&aat`W>|>6I_|&b1!j=gpjY2YKVE5o#ga%%CIXDGYEmmlr|Fg>EIcj1lu~ zM8(tWR};-O(5;e+M4aASJ$ebOMox+|2Rc2fl=YQA`zWmJCAg7 zW|oG~Gvhri=Jq5pfIoTmieoxmLmv(*DOhL?Gj1Snb0l+Be~ssjD40c4>dhocMuaq- zWUMNL((N3D8Mw2FA)bB@GuAv1xV_jUW%CbD#xT9ZJ-;%v$PTj#3{1eiR<*o`cdBT@4P|7YCO3-vK1X`fA`0+gZ34C zYwUq?oi&@*Z*$rRBVN|)Q@Pm`gRlTt+=C^Ekz1_PTyfBco`?X3OLNdL1BeZ`nax@Z z$0T{u&Z9vP^EKtZM8u8Y?$oa)Nd}sei}~r`(b9|TB9gqJpn?L6 z__3USbme48P!70dD(L=lCy9o#z7hnfZM_QI7A*>Jn5q6&E-xoUIXIo$XB7oYxeB>YN3fi91V8>RjqGANBf^w@OAKfKAOuHjl3tf;3FF4;L)Z<$0Pmw6(J{ujesB8`Jz;%1GY>}$1YvurSTBVl{^Jia;~FZDpi zISQiV5yemrww$iu@gYaB{tflGIqV>s1bFvao2NrB?{)*(V(i~}d5?tc#xXgof;HY>jUyO7c9sf|@z=F97TQcbpMMS%FwrhXo9<5+${liYh{;3`3X(B|wZLqq?>HmBl zldfwHK=y)pCOkN8?=a0wEjmf({D;qkGe!!2+=P~2tn9Vs0^+?l{RUC9j%Vs+tMT~ zeC%j!0Sp@iAo=Esul;tQ^w^Uye=SXeC$a@_Tnevw2>jsNF2XHfdTCcT3iDI?n=b4G zth(I^_Cyu07yyo?n~CdlH!ugN>s7GgBaB=6EqY15%L$c7D>-%i^U1a>^dHa9kz3g z!R)w@EV%I1HJv#xQsiaW-flUa#BbWsw_=v0`*4qJhlo`odN=qr0>r`$ct6#s4tMB) z2cSuW#d{ETds2+zz{!m?rNjEBS>59$%ZJ4L_wg8`vhx1xnE}MM`>N?=xm@FJB?VQ2oq?*<(htGeLzj23j9TKksL%>Be z3oR+t>C;^X+7~*4#FR}hDJ^|Pwls-ePXIC1e`jDgl#Iy6#zpATEx9-lRM~>IAYAFn zL!v4jhS{H|QyNFYuRZIO*OYH-gCAC4Z|rYK3tJt|10>LAWgV2RUW8SbeY?ISULFRo zx|4Pvrnh$G=y%hgDMPbWNZXUFMXp8352;sofHQlELNc9hP~L$%ED&QX7j&Y2L%GS* zn`_xDqCD<}(f8?!QM_uSfQ51k7RWj|#peHdqeXI;9ZuxQPSTrY+UcE2hDCTI2XMmT%U0CqeoPlCwh5 z1M9P$enLrncdvO0p7{kHT#(@kIkEX-LAA(tq!+4RC!YKmV>4xeD5M*%MB3Uojjn|A zD)?{SO$#aqog@C~x-MC@G&f@)$GAf9GACHE8!}^AAJ(4yH)W^#A;rNU@9#d5OAJDr zpW)o=ts{9m)2CA8c&igRxkkX|N-;@D+$v*l`P=R8G+WVM@-%umd7hHlZej z%q9y3&p}p8VCU?AOtc%_E3|J}&SlnP++EL1tW&6TY zF0M1^7*MI&Vwa)Jxv}i|n*|G0_2U#<2BoF%yXT4^R3I2wj!580GUNJa+O3WeGEQkB zR>H}N$b1mXA!AAuLy`>>vzR}{V&6GmWH;Z9h1gNHVwtTM8pTOcc1J7hFL#*)6rCh z6mIm;GZ_NB%;8<6E&Zh1?CcYShkjyV2OGhvFUpE#XQ4J`ag$mutI*B*XmS6B>!l#)?APvS~Yv}Hqk8%`|v{aJ_ISA5EXlZdV@_t4t}Ak z+qtx$`j|`{)yF z$+fwzYYfkrk;sfI;lDtKK&6}3Q1Szzlc)8>%crwa zk9yZ7?>cuv5D<*vwkf+8S6S&{C>p<~Y5Q4^h|5XCJMvXIdPQ>PXejAU@KPj+y6{dG zIStX@S_iwD@FoZD#A+bqkQ%uZQ{1!|>3@dHbtoV6DonjB85dho-w6G8uOhTqb%$rR zFk)mS(veouFnBnAe(R^|)sO{4=g83n7e%uDG<*)M-oLAaq{N=L5V%I}9n=&qcq@|& zlqckI8Hb*#-R&lKz@olooy0yUJDJZd$uqH~{07%1e~{Pzw~Ah_RJc5KEL4LnKvIQF zq?S40dS9QfhH5PnmQCGALAg_lhLjvf_ACnO=)^mN_Otb2L{%YFFQB#e{}{Vx1yPg$ z37})!wr$(CZQHhO+qUP9ZQHi(eaU7UY}lXB)zzmIn7p~1PZ8Z*dy!7G9pI#WFFHdw z7g@N{HP^DZpSl6%&?8T$e7hsn60yKPy5RHH@O9%|>oT)Q^QOk+rLnvBpi3V|p?54o zm*~5T1=S8@N?IRqLUbAym-Wux5*{OM=-V3m=_USdGDoy_0rU$B$7_h-i)xUufMk^M z+N7dMEsqUU@TUr~MR|2Ia!sKKqKZacYRKKHv=F|1*Vt`Rqm(fwjW`QW-Emmf%Gd@e z9j25`-7xRoVIoZI3t(v2cwkJc#XyiP<_vL76Zgz)w38FS=xT@^olN%MKhZ)%`7B#a>jqou zka^P&mPussr|v(5v%x*MQY3Y_-~^~rbP|Sc=(`xn9P>;?iiY00uf?G zmnv})mkuH`EolJ~az;^1bA`R;As{=J=G}Tazu-{d3|oMEAjd+>IhdyxaiEqUglF1U zQ~K(yr~BNjjKJz?av5{!`8mjPY%R+tdQW7lPH&exs3_AM(AVadloI<2)bFv!idz*? zJSq5{0YSia1~^8o*iRjuao()Gify@)3}1LK36~s?P20j zhC{^-hpP||k0Jck;nsjHSNw(Y_sGdr$~Dm1%yeJo$dK5e-KEf1Oz6;yqbMgb4c}WU z#RHNt<7$_q5!g{Ie7PIcFP;%}x$jL$XzEItN(=}SiniVZUP z2N2+}sTvA%0tN}H$LO1vOibshDki)^O%VD0Em&%98DT3w;Ha z`)r)D{WCNGMrs48=wL^C&{8fy@X1jrV-C(cpXYb91`t_!@>I36Lz>Ihe3IvD$05Vmq;C(xJaq{Y<4Vi!Fnn=H9VI$hQ-Hnf?Tu zipktHqGVOWEF#j+sS8@Fe~K zg>EHA=4UKqgbj$-vb7lCFLH`_I8t*Y2IfX%StdSrCUO>gtv+KdnZQi7s)W{#=XhL( z`~hFUu{=d{p6(f3$)(%1g1*X7I2cpZ8T=kq-lBo?!c~(@sc09{{tgx@Hwrr4 zBoij_h|$79w>`9od5To|5+uO}aPc7E7aOJA=NuovPujT%OoY2i5%lvM`J{s5#xW0To7~0U z{nvluL=0r%9foR_o*HiUrTIsNw2Yy`&V^Ky2XQ`F%1~3lMxZ_xv=EQeCFQqg>optR zOrXote`*W3x>m3i(C@IQmL+F{L7dq9H%%esb8To;>BerOB`43wWg&i?CvN%;pgpm#uhJD{|lK`}#dDajq zcHJ2gDtP;Fe_vo8XORE3xsZn>@LT-yjTVP6#WhE~W?a_fnjr1YI8}@S``QI=iv&3) zFH_{Le@)=@Q$3OZ4WSTYf=T3R8OvX(WjT2^w4fT*^5rB6K4RHu|89i^JWTHle)EatK|VUfh~z8 z)cB}KJNk5f2Q#89c{?c*w~9r?Y2#7xzfhIV+LUqxco5ob`WR;x)x7HHRNhf^6J`|X zGMPPHkosWa5Xn&H?&#Ha!$miqTOF!##z&KXJt72Cv}1vD4=@t=gW!}2lDJ?tuv7S9 z{Rfz)Rff@}zUIj6szB3PQ|A!Po(J#1B)zFYFyv4sc5WY6qMv%@)1E|X=wC9Ew=KH- zc`-$jjYF9ru>1I(f3B27HJeID`8oB}I!Q>HNs^A&WZJi)>&J-L08H09ycBgcJ&L>I zEIQgqh83A+{exDkj!quiQzW2L@6Qn-Wpx9Or{3R6W&cZ-er0Y~tI)GivLXQ-0|uh@ zS<57X;X_o-r|YcToNbw|IE|hUzO)c23&Jw>Y(YCpabG(4jd92tO52}bZT9xj)cs(F@ zolQA#BCy=w-Xqp{^7gq;e4TTx90hP06esx3+{YkbEFu5Q`)SMYUN)3@E(8$_qV!|@t?0%Cyo=`zTo2U2Mv5UlhL*s_`Qj^uL%)ia z+ZXSc*Xg-Oh*kJHF!rX2>AzCLIjL5n&ASMxMPf}4-!7pj5|>6WCp@1U%aoj_DSLKkLyEqz8fGaN>{+ zbMwIl5k12p?0P}oIwN6#vnLY|`s|EJkogdVE9u$xt%br2c+K?ShHjfg>iHJeXyV?z ztn^jWOa~Ii<9?il^h#w03ka@Ns!nt_;Ump{>{9NGW<8Fa=R_3nT0mU82=jAmUbv^B zOqx!X2k)kb6spM9Y-NaM#l{qCxafR5M6vYH?)Jkcd{bag_+R5-XKQ#QO$h^NGUXr z#()Im_&0CP%HNMO7;04Tv|K+$`#B_FITAraaZ+h8S5vpvjs2B3`8nP>X40I6(YFHG zfdKsPU#HnvC&wifz8#kcT5$~p-$Im@O3S(c?;jonkpz-0Xg9mE4}D<|+3(}ofU%#ej(ep2u?C%Y0caD3O7O{N}(hiNn zT2{xkE}`nX5Q3IQWh*=6!_jfE-tf+BP$eyW>`~n?dAo;hBf=hzgSH^ z>If~d-Q*8R?xJ=S2zN{m^NJNmS3WwYGLvJ@L$+ins(h{#Ye}$IUUcpl&32VRQb#Mq zg*yzMfX_**<;u9s!s9d`(qwBLFK+?U&82qre7$Rl*Z*onuOD5P%J_NWEZKs0h2U&H zyIl|?MDctKDY&4MgZOcU;MSOG_|5-qtDW0%3}N}OB8jkzpwiuarj;=$&LRkSjl>Xs z4}AVNM2XznF%b`uVMMllhJxhOaJ{V66TCg8ArbYk+3q;jGj*o)HFg>s!*}(q82w7a z__i;+=plU)Xi+uO$9Jw#X#JCm5N(AH&a<~kV>)B};lei(%7PXJtZg8m-Jc4O_bmA(P1=SB&%Rv=)+PpQOJ$z$;^@ zz5*xcNSz9NR9l*!ucanSe%5)q)7ko_1%=XDZ@DOTg!U*^GUc>mZy_@nr!KL8x2@PM z8O7KBk$%A2MlvqH?6TsmKu>~GgJ75Z0!Kx-n-qe2XlfE?~5grn@N_^ z6H&w|7PnOTWb=7hmhBbMK6}(0Gd?fX#L@MPToE@q3s2aV49oc10y*Ir40}6fiFn9C zJuIc*E)fsHam(nRPYbremyQuvJZ9~L>ilu*JZIog;Jjwgo3?m_IR&ojLS%nC_myCT z-H$HGWEykxLYm$uf1<2#L8Y{f(ZV1 zTSv8j>nuR3xQ>DtY^bkM0Bv~>`2#2_E~W4p(aJwzmW{}1SH07(Ii0p5kbX$ota8DW zxl9Pr5dSGh^G?U1V+I{+x+%Tg0IL`X`R`K|x4!*Q3;W_`t=6t;U>9-XUK^|VcaTAI z9V`@qc{aq(TbE8^URZ9-IFlaHb&P)2zizIFG5$L~RJx4$dDunWq4L!eeD1 zqGt380h}UNZWi-uJNL^mgz@i*XBf@f)ZRtKj<$gN0vP1Sw~*{0QoJHlQOJlvW(Vo! zPVaYdIwkdCfJ3bFdbN>-+aHKP#Iu`OQC5Bm$*JYCm5~tXVJbZIIZ-ZO{OKm6<5cCs z*9!bX1L2or(fg|)vrSovVSHd&AhOG>VT*nCtN#!!pXD#dBq{JXo6h%}mrlZmE$r zYI^#|ZqMem7+j}hXKA3mSGVq}Q$J$DgsTPLKbwxlo>4ur! zH(d07_YTG?yU@NqyJ_feYzzj7T0`_dowB!(87Z1l*?g9*9%%SKP|QJNheUj1AlbT^ zaJYpj>xl_pZP+;j+g@^7Xt+t?ZWMk+tC8JXL?4KDt+Pi@j5 zH7Q);aqPdPlQL$?Jz8VzZZv(Mj2&GffYhMe0VQJ!MCtz~1>Q);YoPzqX~4+uttf@| zz%G0E&3Z)LAX23kgRD%^Cj?$YSDlKW>EvXYN5)kx<)rBSQMqQaac`&4YJq3o?$kMP zUhzv#_u@jtV<*^vne^Z$P~l_Qf;Ce6?*qTK2_q*M(tKSGSxhG3Yxz-U%_?l7z|Qiv z?+jHvf1)5bdj^yH`*z;lBcN3AKRPRRq% zT}Z=S!R(p`_h)+GfhUHZWbhLXfgdOA!L4f-*MYJeNCD zj;F~T*M#&A+K}XF5e>$UwX^KE}8ZXI&3K2T!CIlMpoABZw+3eXe;M z6&xWNUE3n+9TIIP&)%pBziZPK&fPP7`@*wy`|3SAXTJ}t@S(za|G?@aZssy}l6mpNMj(!5`eyHGS*}1ijUyEG(L{91 z=O1cbP{5bl7tnh`;u8!Fm>48IL%STBS~Il!MGNY z4gFomZm~5q*5aMhgk=4&ce1sV{9bpL-|DuS4qNHus35Nm`3x9~%$KK*(AmG|q0tbSSZ8Rrd5FxYLkfn+f z$atJw+zF$r0^9Dn;bM4t$-3b(+08JP9pGii%3#+xFxP51z!{A!?}r=Ml$*u7-=#Dn zyp*M_@=jqO;dHIk7UQTZ+xuo#_+>EzPqeWK=sqj%7hsM@yBo=OTwM~HEcY)T>x)NlVAn7{hzrc?t_JDT|TFAL(dVkhFTDc4L-Evs*lf*~#Oa(vR*C z{K=%l&)+L`vC{z;ztH{XP}P!krKSoDK4H)t5-Tt;l69M%5(F)G-=_;3V=q{T2~U!@ zdqjK8O~hnn0^-ECImf#zCt9)KgPSaXsWIqeT15SDhS_&6(!$soW__tag7p!!S77)y zaQgr}T^@q$V;oM^h>_;QK0ZLJao@b!G(cT&i14gCkd)Uu)bfsiEA>WGL2^~m8Zb<&gILx00Mvpsd&q+~Z8Iq{T$G3K7jfWrYoE{!m+3SV!z*Tqhsw9SuKo_q z8y3YNZ1hi)AAHXSsig73JFGayNwbbCnN0cTu5lJ~Q#=M!tO7q>&#`>uH*KlokBE!rFt8Xd7{e+7xyjPLTd<4*Xp@+b zOAagt3hY&2S{n)eN}!F=_+wh09dZrclMQC!h-`flG|+3}5~OZZn0!Ssv`)6Jls6ZV zFXfLJEyYZEgu9SMXAVhXac`sxIVPEU+sJ7s_xC;Hqc^aYUq3vV>?k?Zb!qPDOHz3D z3jEukOn;J!I0WMOpHaSRbvt&5IHrpjr-*b7iImyDvWE?0a^n~$l9j=@N4QKH>7gTe z4@Fot+c0ftN$H6bH)Gb}U<3whsX5+Vs!3#|N~s6pb#M zbR!vn@hw^>f*689p2b28qu~soh}w@wlMLxFkElx>7hH93b@>^qyZyibMlVqnuuZgX zHQHi|CwWVZfcAfPMpzo8U2-qQYj7x5=k`K zM=u3@)*}?%XC0hk!jW;_D8z*UZ4gY}arHs~E*piDGT%l_E6on_qB;+1wNcqo;tqRW*p1_tad&VACTr(9UMhMRnG1weX1XFPXM&ZRT2MVm(w-e7Cz~KBA3w_J z0c-9Y4rn+|2D-mS#L!~$4}_e`fOeu~_kVC9h#CGOOH-I^xFwp*vk?%qH< z@_Jlf(j*%pnDjlmreOAEhTx~c>;ohq!jbtfXbf>(6{{gyz#vq>CVTJ?|tEHIg zMj?4N;Ap$izjwTg&KL5^Q1)YYc)D7ZUDaTT{n5m;qNg5vrWQ#`FT(16X_T zw>}`uDg6g^kvxWVOTqsYD*cy9EC9-2MWu#PV(aAW2qI^pts0NhkV>zd#j8nIv4P( za&`}j%rt>s3c|@v>Z7}QFJQsgFjkdnsACk$LI1s=lTpQZvYuxRUKlGqi}%b%1LYCW z$^JQm`q2LD6;l+!;nl%&my*GpL8>-g(NLSqF9A0N5z)XS9&*!NZpZf}P03771IEE} z9zZ;83O@E!HMs41)bK-(J6!Ru5x+0H8qtw`_ev431-V~(lyUj=U)$|PlT3lH$(!kz z?JL{wEr>*)LLAeOYnkJ}d}Jv97mWQ223X6b%UL#47-@|@_&&IWw^6m`Z(RE?jg(k~ zWjG@eBlN|++e_1`7I&V0Ao{L&Ir|pR4d&?9%(`nhz^cwgp)D@A&wr^j^-sjXjo!nv z0^cfd^|7CaHrl?`PFv<=L>V!l`ecqF-d)?(ve}S*jOVQvN{!x%C zh9(1ZKDc;>uhLwy0Uzb+qK~|^ys8{uHaWy=E~}ye6Apr`8!SjzMClKe*>nAy3Si_V zEt@Yz5X$C-;2z_N%}<%K3SG4D1_7Mnf0uEbof{poN8^6fywRURi{K}&Tgu`|8BvTH zIQ^b&UR)V6qZ~uM)!3AOVjNR-;|(6Re!s_S1~A7t4hR~nEt)Zi9SO3IGs^Cho=lnL zE)hIcjH@KpnYR_yc$O_Xt7bwsK`7!wEAJ+k%&Vf3tX@t!trE(_v$Q z3KN_(zJRc|G}la7$YsdC!BU5cCEP+Ks-SO% z2Y{$i2pvxX465^qb=G@=$sGWm(%0dJ;`ANZ`V)w-Ux=%yGHamGRO`!gNdL+Ji@rgH zfd+QguR)?GauIo3nFe)Ib;aCjQ++hpZ4H!pGAWf7uU(^qY_i#fx4V}s>O&RlKF{?D zdZ)OCDZjmxmpk)W048?1)c^JR>&76|Sqytp0-LQVM`LX1M^Tzvd3+Zg+YO@sj$#lw ztD?o7`T(-mdo)2U#~i2sbgL*?9bSJocR(R;3<|0)l5UB>dtVDdUc*PURU+dbF)a6- zg*58S8utcqgNBg|YX(Wopv4;>rvCR~oDe0t!SK5Gtn~y4CF;d$3#u}jdQqRGpyokt zJb$z;K)!<0gd$hNSG7ZcO;QLbm8l#AiaXH#U80yjPz!)-P1zr^8V5zXg~ zPx%$PdUy*tq*rq|X%zH6RTeKiw5ajH0M0*_qn- zDs@qbD~zss0(r-3(rU$(5R!5r!R4P{YEPi^*~y_3mDhutSZN?!nyEhjOyJkYq361= zQ3kXW>({d&{h{Zm{Y7sbpDpRpl&L;h1w}Xqd|j5e({z8IUmmR6d$tk2#D>M|Vau7( zLABDtJMsfdp+VR_)ROP89!fR^f7pOXVmB$_NCwabb}%0R4f0W^6v%sVVq~FLJihsM z>&LNC%Gn{EXG$IfX4#!%o=K&r-%RT7Ms+Klgt{<{-lmB zQ2k)zZyL{J1PVNyD~Z)!RmudYV{;mFBCJMo9WAGQzebWMh+s>F1!v$_r@+MvRp%!g6MA{Wl-0+w{Gq_8$G ztZltY;2MI)wIYVJ;Yvj?^IljR<*7N!Z1{@xu)JK9b;?}9u3)@FhtBcapXiJ#Em-Vx zze9XtZxMO>1f9U6N3<>p%hO+gD^?l`vlyS>irq}S}CWK%*kw4scgpj_CKk7)9AOZ1r zSp?ksQ9U(Z!;-C+YX+Y^&x{V$NP+<6vPCF-=YB7B1>2i(NbEns@bO)Du5jTZtGZ^x zm|xM9^+F-vA`eQ)Ug2}z3|L&{@uAtgqD|NxKEv$3|J=6${{TXUnS*qg_NkC{iR2A} zV7>%N{oP{rDLW8N+av>l=5I9-$axK*df^>=gIczEinKCJY(lVJF%&Bt&Y0S(t=02l zZ~Z}yLDw4U4Q;&RYC#8d=U1Tw*}hMUsykUUMDSjkrGGtr(_+3&U8WRtd>=^$uBIZG z4U*xmES~NwbgZEVx%qa`ZG33`4{oveS`aF;5xXb)GTtV1KTg$+mIC%X;p zRh}4cq*9gN)GFxAS@Imb=&>>#~e&Y6MQYDl1&m}Q`I{+$F*)f&6#)u`r*`a%ri zJU;=o7MO4ze{Hqy4~PflzV`>`)EL)u)Bm*3mRg~*KH7>-hZK`=H$+?i`^EmG_(D$t zZum5o&3daM?ERDA(gqGq^`CIukq|7>GD-41L@XY4Xon0WLE0e$UI(SKz~Ls(U~LQE z&H0|^8cJtB49+f;0PK+rgt{EggHdsz^3N^NU) z`ie$v(>~+fSA`TxmUc^LslO3c?2vbzl~TUn6k+!Tvieyoe7K1EJFL_Fbu{+r*E|om z?|8}2Nw#tDKoZ{a}u9<$}g}StWRFD-C0II?3JK5EuO=``suba`S z>*YKMgr$!ZxD4W-`zu`AHnj4O(HG{TKhT48{m(zhE zVjaRGd?St72PgK`3A9sfhpzhlUM|%13Yr*)WrfopNB_Z1KE(7WuZ$`lp!a7`)py{Y zO+=3}LH7IaIc{F&a%`p52w2SbcT+(Rk^q&|LIm@0`Ayxz5&Ndy)5(bwoc=Lv0M8 zF;N+HElaYw$Zqguwo0x*q)n6#nsH^abulq=$$A zU#?&JY4-4-VTTtR&PB$kP74=>qD8PCLn`b#n32KCcaj7;Q%7yFU}*|1eh&PuT_;|sw7u2|DI{o zj)uq>;#XP<{kaJbsA-vpEqnL*4-^pU_azL;a3_u~qLdbYbAd^52x!W12sKNgGK`s1 z{d?paBdYloP%TD`--X~AsvnM{^`WI!!>b9078W<^m8bMRIF4)Y2@(-jK?lc8TG$U+ zd+4h_gxrQdwBb`=d`BpAlT1K|RAh_gv2?Va@Rs+=i%lrj6SF6WqVlaM{m<=y^ zzw1j~ zcL?Gy;bkUDTzzuy!Rk1-%1(ei808ANe~A=R%EAhe)ccGRz;yiO9cY01oA0*J!wZaI z?hj|A&#PS=p5#ICB>?w!-9te#WvF#ZEL{XXnA<~-vX zaFhCZ6Oq7-ZZq@UG*FYLYBWWS7S;N*6$~vir5guRHmS(%lI*PNgP#eP5HOK^V6>!^ zp+MroIe-x;MIVE0^u*Tl(-bm;(Vh|z-7QwzP7?a`BUjx4(D|NhpZ()_(S0(HJB3UN z`~oS*xi6Pc*wAI=EOG0PLQ)yHOP9Ycw0l3T7!%Gr07)~$qR6>WeboC@MI-sRk*5_} z%!85?@RU5Z4O1zc*M^3kdkmj)G@aoTWpQA8(0%9DD z&PS8{hkaseYFpHS;aVf2OYbqhappw9LTqrOO5T`&swKACXkydRK?+Lo$upt<>f?eY3#!o@VOZGXh zhjsKBZ+>_qxd1y+09I*@1w?#72tWFx==E)3Ry-R&!9HWlE|8N!E+&GV&Bt_u_ysD< z=q47hNO+3@EWf<#i4=pkrwTp1tr_#`2k~TjbfdV&659aDANIot;f|Qu*=txiAZBwF z)lm-INkr|s!m#%E#SL2I+wRAy7rq_>tpvK3$?6|q7%5Dmn&@FHi-?n)l2x^x+JFUC zF1>LAULD7kvQiT(4+NMSBC`-O|LLD9EsT`3*#hrqfLC9m%T5aUo?ay>r|9~Yil5sH zMzkPv1Lwz0aFM}AC8TKxqM*mmpA@DGSDPkEzuUg@OD57d>3?huziEfYUn=1Q3pL9445F@0xd_-od3SW2Uk%w7o1+FmtPDGHm-_qYRnU%jSk~t5-rFF^g$=b8{7Km z#kt)M8|UabMq)+h_XUq>aO!*f8N)C$5tmp7ugcV`766X(GeVPB3%81b($&JbHUMk& z30Z~oEsDnRBepHcMw#7+><0=*x0RK^a{^NDGAIS|h9hNGnQIZpCtTjptDXvFU`S7V z>DB}yJKjvT){iX_Uvxpv5838~7A_|z1w`a_mXST7=y~YPubz`~>1U{oi7}k|&a!oB18clx-FP1W*bAy7h0+AQJ+T9i7L0Fkfr)s7RoFTKg zV+PNwz+IDkk-%lW_Oub!f3v3sO%|uBe;DGnm!eT}3Qa)T_w4cb9TYUS{2@1;v@wA3D3XJ;4Ks)k%&2JI$iY0|-m_bVq z`^^E+ko1n$pBg7kGzXkcHgOadzuH~iV}Zh9CiI6C(gOSVCxKY&v;MW)IIRxZM1YP0 z>R__8utG1NaWpQ$(edhJ7ab(ve7uW>3&O8ce8y}7qlPwevr*sAPIE0gn{&q+39 z1Cl(>xOp56*DD%LX7^c^5-JjfOLR!sErdA1!gj1}b*arXUlY_YpTMHI8DTH%Gt!(2 z;f~nj;uV&|CX7{?)u$~m9~Df@KDf>#tgbu-)bp7`U{AK8ii|31cE%BeSJM+irhG3I zc57)xl-!uUtyS2XD9dT7q$L10cqpV`KTdjRtG{A=v}E1DYEM)%UQY9VO;;f&M=>YX5mw4M(zc4Dvi!Fop`qj+DzB^;4G*WHEfaE%( zk-Jw$GdP0|K5*hX1)0eN0#z|UHr}^zxo?QDW~frnt|`YYq1iib-mhnQ=IQU-l3%9` zp<8Y^WMP)}i$Q6Xm+@Fhsl^WPmf=&5GkcLYKq6lwB}njz-0^V^4uu)<0Vg;t2BPJ< z!yUjrcYgrn%u|4J6Rtqf*Wx7W@_*Z=)N?v3q*nfe$nDJ}zLry;s!ojagi3g$-}M~# zup^jj*&{*+t(st$iyD9#jyvF?{uG;z&3Qlp?Y_Ynqie}Uk$Bz^Xf@-67h#0-8ico1 zxQgu)9dgOkkp|)X3>g2qoj^w%($O|SpttI`spqTl4{ux^E{pkB^Jm~S8OmpTw-rzn z+CVie45bMm09e5+7wK~h(~Gfv3T8@xm$-R3ohw;zbol3-`znpz;8l|(P*k@(9IAMP1( z^B7q5bG;kCO4Ncerv!fX`9%dT=yWLejjFape~*j!dm+71xU~XVf$}%4q+tj}aOq)4LB`fgAAcG~ zBdDx$a<1xo<5>wyDOtT>0BqPq-*K7wM(u*r{kzC_Pe;FAbf_#?gfYSXe=%AAspt#@ z_C{6&JUstPVKEYLaIpOE;XhHGh4KGXvRD|H+5g|7y3&85`rmK6sc)%71m7rPQ#A2atvk5)G{| z^yeE6KqzHR0VD(t5FCPo0>>a|lrvZZ8~{kDNI|1W0RH?ykuHLV06H)-Z|zUM zUq6Ht0w@cDhoXRzo}h-7QqZdl5e_IZfVE>lXx*~0bRN9Ur)te6u_Uv zqduqtI?Cs*f7*B9K|W|&#GVXHL&s7Ie{mNG1s16C5Wxb3z;`=z=$eox(Y_c3&@`e$ zK+!|Qo}V)ePM~lx0|YS*-pdmQ03xL01HX}397P5*Sl}2iQ=f3e67SEzzDl0{`-mNu z7Ivn#&d*-?JM|hw)F8t2ZPzdGt@#7J_Tk?(wgM2`3FLZ2zLl4kH~-!qe>cCGwUL1a z2UIYK3}iWzpyRzi&Yw%LKttXxQPN{mK*aHdp=5-#Bp_7MWA9%*;xul!umMEh>{ZIa zUK{YGODsePIgl7PXILmD7&obE=;?>08SJUD9`1FYt)Ht*kjuY%%b_sHm4k7?*WOcU zrTkeJ_AdMl`3yG2(oqiYC%W`TE!Mn=@ds#ZQL>iHnN5@kCKdk$i)CN$3@oXak$6|8 z*I%#0$MEWF*xawTGl7+_I0bd;`a>pB%3wEPZ{dcK;j4ku3EI7vE6Fzk%D66IQ9<+B z1R2wStFRvb>fYs^`hb)BkiFT6exO64r_0lwv$jWbG%k z?49R!`UbDrwoHr4j!Zh%TQ;dV@~>^{If=`|<4tR_dQQW}Zdz$}Nt5#;65<`dcR7EA z{Wg|7Ni*Vwml~BxhSSWugyfW5B%WmU>s#qpD_1e9o|q)z;&y}#cK=ba6Bu{7agNBXTL$E8*x+GG+=Gw zyc?}J9+jaa^pjLL?P0;Qr+Y4B>C{8V^YXAQ3)Pt=fzkp!fZ$h_aSL$$Uphl0Jkzcd zj%9HR)=55JS9s8T`DsfM-QL(5w?UJkffp_CA6N?Vea_i@pm*eawbY%y2vWhUJ zSN??UF^i<>&G=1|N!t5PR% z{yz<70E z&O@{YXS>TyYz1U8aa(TNT9-cVhVkeM9cGDvm)pE3S?qUtC#~{e)~z1ic_uOGTZ;U! z(PCF`fq@T=zpoG;^UQhKi9JsbBVDG_P6#xTcy?Qoyh#-?g8>;^EbZw1QCA2_BMyI> z23wZ3Bh#>5;hvNfGtGNO^=ObzsV)hGlhcyarT+A=v)3BGi0EMbwFQXPtU|PmO=Kn8 zd-ZmWJ~!rQAaahASOrpo*`1p%y=}qfjB(17sP(gnA_L^JgR`K+q9SfgJ1E*6pw=GP z1{;dO#|+)fGQ0A6NYBl2`K~_B4C~llR`LR(GIJj(#dt5iD{VXO+nY^(Gigoq=UZvo zxK7)*d0ULDA`kJ5K4rcBeh|WIJ`GDR&CEVTe|~!-1CF6*bz_HM9t{(2gk=iUOc!-> zo?h5HBhdR-Ai;|SRQy`g%A@WCFgdt;w<+z@IxerJ!Z7 zF?m=~B$C^ezd!SmB2({>WwJHUA=K6G9J)UPr;ts(t-W}*5D;Dp?>;?rj=g1(cjH%u zai!X=0oa=$OGDjz%iPv2--00h(-H1-4)`6?x1_$d($GYs_k>f$<0ji&KL#t$oFmcs zCN&&kn|+1)Ka8D2kSII=q{p_cH*aj)wr$(CZQHhO+qP|c_HAt~4*y|qsa#V@DxL2B zPB*Pa3rmG8edqmrJhVjZw_fn92i~lF_5-MbXV2d8r{;T**zp}I`Nk{m+orm(Nx%>4(?Ng!H$w-PsIJ;cS}Z=Y9UIES#Z*q8~H&)%IP;dl_D1<#-<2IOdrs2 zShs2z9X`^KWRkQ}2xb${@zYMH5557Frm=M|(`|L2E<4?%-w0`rBfiI$Qm%PJJz2@+M18TNjq$=1V0L6m_} zsVKH>%5ytnKKp?xfL&9Hk%~PT*Y@EA8nLYesPXqZ=o=j6Z3uQ-P>z9BrP~ao1g??GFlFjct@$Xn$)?_4k7PgW8NG&hizg;K)}N=+MEHe-ibFd* zrGBgIHC1tpX<*ShsuRm^XX={|3wE}&W+`&E=@Tp-R?~71K6;=21y>F(T^p*9KL!RFGYTMEsDR(E9!2a_LxXwBt|S5!~K z<4{3l4rV99?wTyomHU%zqfVE`2fkMwjpDKM~6aoTv@?U@CcCM)IKKRLRIy?vM+`Z(%}1xb!ws5pNO!oxyo~mCW3e zGUF&8KLduFAyH4P?w_Nt^?u-)N*f1Z43WEi=Ico#iV4AW6aD_=$TXe#NT}zeS5}5J zdR4MFZqr)Vl)cDrKCL{&CB`pKoKce+w${E^%ENp6FkhDz`4zx8GADu1k{J+~u(64$MH9<)5UXY}z~ma3V+h!4b1)y5L^@caMCn1VJ9KFS9`@|)q}2>H z#c_*U^hoizk5*)L@T!{$gV*v<(4QyS)!E9LV4;GRsFuL$ni<7rpl)_NuK;jxrabR^ z5~C_DlOspmZF>TmzyQ&p>Y-e*3@J&&kYT27VJH9dWG9lutjzS{Gtr!2cJH;9pNI8t zdw$)hON`luw1nZe@D-hR0tQVfI}r*NWwj5(He-QSSUWA9dEj~;byQ}@#Jw)7TH+J_9%zf zAWt}9*Q!3@qX})_)Eel>;%a+@?A28KWF(5lhH-%eO&ak?cc^kbDtbW9Uq*4cG#81h ztLr}F3Vn3MH$ATau*FgvPd%`xk`|H?t@3tY4bX}5V$2dL4Ga7pyI(jm#E|qNf^k zNL4?)k0o#ArUV|{G|8-*-d?A%T`Jh%=+1rX9&6t{=*r&wav^qDRlLj2lcY%Z*FVxP zwLm{4dX`Y4lW7@bqp6#_0d>!?_U;W&uQk}aYEI4HeXly3raOdn*EHN{lnLQ59m7+F z;hk{ZX=C%8?9i^9L~X3ge+nKm@W|%ia-^m7*v=6`*y%?mU+Bd>B_F zZ_57|&q3{frSNWDn7&Bbk)ML)s5q9|++V@sZg{{PFJ0&_U=2<&j?NAAzYn;IgPh)+ zR0e`kAWA6Cr=qUh&Dv2B9n+%me}2A2NA*fWcW*X2nHr{F-y-tLZz_4c>>Mt^zE;4! zv$H(th7V>bM`W67Jdb;?Xbhe9d$i2x= zdA;=J{2}?R)Cse0`P;DNBYgHU^%>~Frlw?=Dn(3o_T6zK#mkI^Q!Kwy2Lhvz-k*FIOsBNQr9Y4ULnZfeCnNTq)-2KK|sx=CNfz%l?1nItN zl|o?olUtitKI>8L?}yy31o&pMf6UZ8(NAg+(xh@ugk)9i<1?tCr}_sDbyFwP^deA1 z=fV4B%83%iHTr`Xz98J{z&~DKx*X30j>e>W3vZMH*^Cs(?G-W0&OwHah66+I-9m4| z3?)ezod|s)mG_F_X=tk5Q6YnEWDm5MJ)mb~WBOk}HYi#Vb1Nrf2Lf6VD}5(pA!9>Z zBV#BY9w++j!skE%9EIW?jSS>7FQ_)XlV`2-HP~YmPZ(^#C4nWoc)New9B%=o{ ziEe_bh+S7m3DGw*FftP&CQW?~!e9@$xhbCB<_7|B_4SnnV6O@dz{%;CE$Nr7>lb*7 zAIC8Ud-dfT@b-f}G(y`qOx-u*FZQi#4xnf12iXT{1nA-d$nHM{KqEt9LZFFEYU$U_ z&Ie=#*ii2ZJ_lfQZEeLr1HjHnFv;8VE6dHdJQNH{0P0`@Xm@wdXm4Nl=O=L<2F3|6 z?FV@mF8*1Ud15_%6Zq}7kj2sY%{CEx>|8er(CL>Z=?7ng#N@?=B?o{pj-9Bop&J?l z0%%TrgVXJ&lNNx3;JX*f(DY+<{Qh6vc0D8T+58#(cW8QXWMm)!Wo2h4XXFkq8aG;A zH#OhZ2w2`vt=SZ?yvr35#A{TXrxkMBmiR%)mQ7^O`!?6(EBmXeR(Q;0X!K zOy2KV^VJle42vFTTtzqIn{MZQEHd`yZ=JbDfd7gMfvG9LtFKg^FV++9*e_$YucGPl zM+I3;!NA+E){w8DvUHydO-2qJ0l?<(%XjP4Pp|P`WOULx@IJrj;OOhzY2dHR@e#l` z-GkTPc-;*+Gh48hMgX(6FUCK}q>aDDZ@PqkiLbc3(%IkE0j6+%HQZfTbO3n4b8mlX z5$2Z1A&pKSZec%5Cw^0=`+u8|K^_1A5mi&K`~wJ8%%$~>eHMZlkLh6IkkF%8pjmbTP1J_vvPv0w?6f#Ebu#XVB!E9i=(+Rn{Iv6ln zH1_kInX-;9&dy_u5w-R+Z_dcY=Q0=jeN^`EsG}}hUvO*EYJ>0G$MHoVfa)FPG3cmU z;Y0ej%7UDXZPOrfPG#0?|5*$wXtn^wZP0Q#|IVfZ9B`lD+Qs9#LEUW7%VNav0q1cv z2(q*4F6yfQazo)#ACE1A(aQD?>)8Bxs0IPf41)Cyj`hjaKaPycz>K$8-U2 zj5*DavW=2nCn8yWe z@EK?yU`Jzo6{EKB;bmNKo~|e~gSWe=@6yanpvb*zD*p|Y{modZ-kg0Z?5VvGWTHN+ zu)m2AFM7?0^niloT`NZiP67E$fnA={{2jS=DN@5R%!&bVym+b2)s(kOOT2EaofuL# zg`ovvwM1$U09gx;R#ra1^NA=ZqKwhvyt!2cdUW=7)Qq^Wl zW-i6u4mLQm)o{40945AM(MSapvF^o}3PLZvPM-8Mizk4m&l*UJq-9mA$RFXt>tXS8 zw@omCBzIzzjt=&NGcc2hCK7)bNsaS8J_(F*^)Z(!FvDY0vY@K^+ai_lH2!)6lcr=> z6p!Pf1`LWyVIJ6_qJ?~Xe%SUL(bZ*g#Tm{16tg*3Hcn&TL^fRLG~N4Z7KzH6vmN?Q zgqruqN#>S{*QKk0p*-Jceg}COS>}|wNb+XTa!*>MNSJ=>N{7U}0us0wRpkNHVl?ceR`JjcC*+JKYg zE2qD+eq_ts%6`-x&AC9q6KoQ!6`q@NYbo-rFmJ7Y6)V4CSxTbF{iK{%AdPR+NXoD5 zddgGl2HU3X1JZ~97w~HDE~+suUj8dV&LAD>>8&`LKYC0TXS$US<4KVQ<@IF_a~xor z=QYhT9|bmW{WIm*N}ObgX^?-YRB|9YvXBUnmITGq^I|{%i)h;K1zXz6_F#JBdaa?x zJ1L-n9Q+hlqGAz9Ag~j*Mmx0(gu5gN<>etfGUNclP+de3dogYbZo%DXx4GttqpH!? znDrOtqGq@E(9&kn5w>Q+wrpbjDnSp>VP5O)x@QT)FkWI;Zsc|&5d3iSF#Z%$b7z!s zGTrh+8*Y4*azB^;TT0@pU)&sB;^f?~0MatjLA1BvA7d6Fg1ULS3A1FB=inyyQ%-6< zOwVd~`pU100wz6I{m)pAVydNy4qvnS4zE{OtL2Z{gMea~u2(1*R>L1RnC|Ywjt(+B zvf&D4gl7Y>=CNvcuzCsTSs1sd9a$u%hz)G??t6!N1C*2Nivl67wQ+pM$|V~KnsPbm zhTb8>6Gr>9{b(7lm5~rM_zUIXA7+XNB3nW{WiAH6t*gPTy0oMf&FBOcbc*vueQ^zC zD1k&L%6KSb>ui_2*Wh#sB?bYflCVH1_QwxO9a$2TIQuiYOfK`Xdb^*|5*AY~2lqXn zXUAlMv zh8S*Zs(|lioRTzQ8V{Srq3#Cb`=^(7Phy9Lv#5uMF%@ost0Mf7awwPc4Q%Irdu~wt z!vSXJAFQV)Qwu_c1>fiG8~MaKC(9Kc)H-FRyl<=P zftQ)KKb>R1@r2xUK~y-<(29j~|?M5q#p0nuzve z?osS`SJ(+k z1N4H+5d0wLN8o~li?s9UY(O{ExbIYcNLNb^Ps7~a(t& z5hn|T<!ul1kqz84eXeO{MqPc$bAaK1`v9-;{;3ge(5Vkq0x4l zRvp}I%xkh@m4U@6t@lrg1N1G(S@l!AN{l_8rEPXd^F>hIa5`Gn5t;f?E=T@}IDJsQ zL(T|ed6G)8NK{L2r@Q)B!hy+b{HNZ2*~c1nv5uxftnTf1?yUGH@oP`WHMW34AR>*( zAzOX)n2j@df;-;{e#IrKNF~&+tm7J2f;q6EqNKk#VAITzbF4~3SxhXrwNsfn6@z!x zv3{KZcT9aCF2K!BA*Y9a<6Ps8iRkZxnt zakw3`Y*S5m2LUv5lvkg2=OaJ-X|s$nb98xX{syG_{ZHyZYr=f0*FYK71i8FmtFX7^ zG-ZpP7ajP2OwN`&j>{FjWsIJ-_)*{;X|`CjgH45_3vNBKs&Qe0NOJw5#lJfFSL^|) z`)w>RPiZfv(~=`!Up`_HS)h~oQmc*SJjUo#GqoGH8&h{!NZEi9XOzH}Psrd7Vl!l< zLx0$wOV#M62`F4}2PVF}$Q2=h^ba5TL1$h00|XwZCVK~T60KPs(CFF{MKAvSM2#Zd zi$h~p#X8xot%r}XVT{5v-Em02dRkp=#yJ@z&xAJ#qKhG|7^IK>CcoS6k0Md<-;%kuysQ7IfH?N z;lDwFlo~jkm|F=)B1XBF`6;6N_U)w9*>#btn`>@EZW}4s%8?>H3ALE4Bo35 zjF|qE;v7r;4k{kndq5Cv@Y8-TUwQm=^!@1zD$3d0_+~t6I5KvjVOyV(x#phqb%q)L zbx-Uo89FW2-{I>r`XN@IYq^WWXq-K^G!T3;@DXBo65ohyn-yz=^}KxjiowuIjHjPF zv_W%0VWNZh;m8XxC~ha9JFL%+1XmcPW0;v8I*WByaa29=lxy!_#CO^UADnf9L@EMe z@@mzjbeYvWa#8IXq*mc^8e#e^;WPI&F)>nWI#1zuKolQ5u5B6tqn4i%1S!IlL5s(b z$`1H8AW_K<6YFJ_FGi??c$z4uf&_Cg@oGKUrmQL*zq=GB&}b3uL)W+G1Ub-))XqHYEc97?4E1UC#OVB9P`R9VR)F=O;I_5{lToABR07Gg)OiEpJ28fY z#hI!Y_LMoEFqC|v!QTea1Pht9MMp(U1Br)8xuxOFvxw<^iY_L}9PbEuyko1OA`bJq zc_m{z1JSx`s%Ixv!5Im4*s)37(mU88Wj-I2RP%Q914VT8{I!#O*JdN)0p<~1zA1Ag zsG67dZ5hBEdEH@GlqM^_#pZU`xUXu?5>r(w2G~nq^OwS06)O^@xb-U?eA)3#!dO9P z(WKG@iz_tlx`G{CX_WDX<2BmIVf=kg)kO6>xz!t#qM6vG6s&M5#mp#kF95L70S)h^ zv49n`o;d$-e74Vu+CHRI^EhU8fHjHEntPHR&Q5E!&0sBkbmGA0Itz=b5mnNI76|z@mZ=>!DobyK^xq45Wz3 z$43%Y5Gnu-Vbl}cDtc^X^o&p>ee%-S{R6UMUW;%$wPd=#O=e;zkES}~qq^zzL4W+n z!GHE$K`;t7kT&O4X$JUFuw6fZG{tP~9705W)5gNI+p+#1`N|G2(!-rzb9<$$ADr1K!G%r6rVZf(7L z0?e{TQ0aESE{lJNQ&i<0BMkO(#*sFU6@farVTW`&bX!h`_&4+D0-j5#|Z4tTnN6#@3!&SC3`7X_Oub5P59pMg%|| zu2lIhu#F3xR&F^eI4c$?rodS-MF`=Uh<%Z+BzCwQ<4U?iTG>~zwqgugWv2qAi;#?= zhUujw6KQ(;%#yiuiKZNX0AUPs{*2J!Vs;d+hw_y)+wZJkTN5t$Fu%eqe;=#XcI1sH z6c8Dd<;SMyBhwt!TfNM^Ejg^;rr#$#lnrgkrC|1^R_1-aU=JU{5DUwuKJ&o46e!W^R(06oNAXA)=D1bbu+W1qul_=ZPQ>IGtrl*t3Z9cPx*q(}pZCj{& zgtS{Y^MeFPJk=lnA}<_T#m5xKG6xbdk;A8`rsEI=F@$=KEt}i>Jel{CPfjCtlfrRK zMW;_}H!DXC;bO2wBYab^M9pzBEK0RcftCGfDGH6Tnp;Rqg(T)Gxb#S?8m*`W?1Eb4 zcyBFR|4-Ci~B``9BUvH2^QmD=WZe^_o%QSLJMcG8PVc6JftN@8|65gp9wka{4mP z6}gFdtv783QJW9vfee$s(Sltl3`Z; z$x@h(6u*a9Lgr`=z+*lI%1*_3f;b17OH}xVgp`cZwKcfJU=$INuG8(Aqs7@!5=rgB zr4h=Fn3Q2z=syemXCSBU^;KRk+_kOw4pZy5XzRn`jIP3M6t8bu*PNx+U&xKpg)SfL zf$-->|3Qpc*e{U%Pqcdbg0zVr1~B=5$B2__o<12-MXl#nWBqAUEG{PGtc65D!S=ul zy{2+6`p8sA3v9~C-CaFdZ46Z(nwe!!7R>H;hOOPm@d4@7E8Q$t(n{zjpSj#la_3qP z;BumY3Vlx+9uZG4dh(K6#>dBe@fDbPGgibXmvXZVM;CuqZMV4;wK^tVgPDmE>gHxc z8e+HB5kO&Fh>|fBo<(W34-$9l#YO#g&zud_!!66ULzkPV50+`7S@)UdHQwalJj2L7 zIQ+#&+7E~6BKMO;7WC&~BbtAIPS>%6<-z-+h;MxS!`BRUWZ!+Z)kco9_Csm~#QgV9 zvV>=Cv9QgvQJc>|!(7Hy>X4Q1<_yq7W`#HI$M`B{Bh^Ns+ z=Jeqr6(QMlF;i?0SowAzWC`-u*wKMb+!D|<^CyOzA%MDO+c{t1-it`RwoUzC@|5-D!Pw(e56q1_&0>R8I4=|Jh%QODaLc0e-&$+ZvJ%T6ETL6G6`k^wDSr>Nv z#aYUyVzP)WnmA!}ggnQt?j3HwZGpK&BxM1I`&-(h-nqN2Z94@YAbM;JfR6U)qFo+^ zeT#BcmNcCJvu*?UkQLLV#!)}Q&r zye6iF^X%u!tfGQCa`T8XGQ?o(+}Nn4&P`ZH9PM12a3Ce$m}x8aSbZs)lLOdY2B`Os z047%u))3F(^{=KfH4&>cC;0?^B;6nnJR*#!zpV-q14))A07Iq9u}8*+;=jh&Yeae1~ROE>B4YwQXX;*ugEcq1Ed^klS;(ud~}QNeB?JS zuM-KVrP|ToEIa9}PWL&mfH@c62qbd_KHglFu3Eus#bqKmHWQwWyyh@d=S4=GXqZ*D zR=2*xrPV}#m(SEa(D^e9b|n|4Xa^@+DOWzny{}l?4nt4X|Y$7mjI~eZ4t_YB}k0#L%mTY@BPI%o|V%YH&`tK6qwPQ&=mY2;_1xk!B~> z_%l(mj_NO2x-spENvUY1n8EInL ztJm8U4YV+wWD{B>;1c*Sh_rM<{HUG%N02^9RKhDlBJ{q{gxdirJW>R*)s5KkuM0L6 zWYuuMdA;0SKKwAT`;dp}d;p-Q9ZOvdWV6K&@v-3($f`mVJe*cj^EPspIk@5DE6!#} z>UdRhiHs{ltkq0di9XO!&mUaCibQlfudCop9gBa&F97r98q|dj26dHO$n^te{HIy) zqO`E#DLc7ErUDA&Cqj^y$o95Rysu?k_$kgTPAkvk7J{MC^aB5ChLiT|+k<^ZVy#fB z@#w~&($qCgYEK__ByT8nRPZ{ZSug8kyi3RJK?zqkupGi*2}~{u*2En|mgx(_!BkVx z-UE0L~=u%~?cd1cgjT8~CYT6;Vh&9z$Y=Sd6 zFhr#@ifR3rj_-D1OJlMp?&+K^k{*RQ*+7y1k0$zGphC{3(|w}d=Ae(J_;3s)+XIM7nwJT?5gg&VO*6u!jt5f_I8_uts(#uV5-0*mhl9D}TJ(w)G!(8JbN2>Il7= z=kMcz$kNMlFOJ@U6@g(dT4+vF<8j>=$#J80U3p+=W+g-49Tw>aT+$3o{TI(WIu-<% zeh7Ts1*3m4$QHPEF*c6Xs+gY2Ka0!(M)?x~CP~J_T#~>uVNC3M!9D#brwU&5Hw9R> zt+deHLpFq%SE~$}gd2a)zjtulN`e$D-4ietTa+AucDro)ijGcytuT!1XQFPF!~*Th z()m_;J>K&K1Wt&&RS>A#G-+w*n#De!3kRX0o{6zw8}7wy^0&?P-Ifdzt5mq@y;yG4 zz05v_sk};XhE0|9coEcHGCc~q7Y;&$5A6b>*@+%(5up_E`U#RmcPVj?kI;Zk`Npz!21XSgy z2m$Y~XSi)AkW?_72a%-`PiC9OacHJhjZmt6)Tv8_`ICA6zEtu$WcY5`*JEVMa~r~y z#yoF9qFn-eARt_(n{0Y&l3hx+RnZ?w*vPR`2$IIL4s1%kp$Y=~{^L;#z^@u%Fi&p# zP2r=nJj??XvtT<~teFXLhp*O+gUWXUm#dC?8i<7jRcT>y34?BoE96du146>krx-Yp z<-FAfjs?hG>b7gDcB^{z=rERt+q9kw0_sDX6gwAT6~fqC@tjGh<~df(Lz2HD%eL?X zhRDkjL&_60Z3f@ENWRl3b{meg8J!$WzoW=NozTIfNCv%UkSBR35? zc%(x0haRLz^_$!D#1#am;3vDxfvlsU^+;are+s)heX}yXq|wgcvJ2hYbhz3Jw$gBP z5Uumvy9a|VO{$R0wZNo_8~^yI3gR?@Oul~_7|HrnK8F@Ti@KNwv&f;Za!`#fy)s*PFAjEkPIgOTi8E?PWM72M& zPJ+u%1BL!!#qvUu!z(;`Vd4gL;u#=@Bu&b54QSyinx_*hGU>(jRzT2mpT7-+6?t&Z z5;pm*vVYov>lQttYLNtw)+6>yS~jPe*ewQ))$s7;0=uHLIK=hY^9WJ{zx^A@hI!ds~i6(@gO@*Wdfk;eh=S4ZL2Rq5OTKe! zKnYvZZV{+w23(r+^_0!F9M15%AX&btZzZQ(Y{U~ueYHF@==|n-E%sjzh36|@p<#el zAu6x3Ty-I2tZJdbM*&8-%G%kM-Q;Na)EVtf-cc%D2(vlO7sXrJfN>(Dp8EwFvGS~= z&0O%H8dQGdDPCg!&?-jib4;oeGPt;r)EB&n{bjzINM`&X9p#{CLKg>bWJiE};{xGiX#BQcF}fFwpN87MD=0SR(sg!^8~eZcJPs7VE!_)z@PW4U{rfKI zrTONbO@yl0WTfYtFzU)Z`iq(gO5^=5;0Ndq^tO$kvFR=%7 z!&k1tN;`&ThntQU_ZNY|SRx_Wz{omTC+X zd;NTo8__53>eMfNVA|fCpj&&J)MLOYzQIEdTqRb)Rj-pb5S}Ru`4tj@N!ax?1`wsw z;F$mPGltY%`H*Y1-)Wrry5vi|i>Iq{Vo=Zl9a#TlsFJY#CRHazJ3q3nNMj$uNn?3F zxNrm4IhI*OjdVAoSk#3w0}b?2Usmty18ktEE!Ph9*Lux|eONdIp!Sjq$9bfz!E4Hi z!C828St+LWgEg?dT|P0%mgLYp4~Y|}3PWjs5nLw<3iG$4W~p9)3n(;o-|91p`s}Wt zF?B-d#8dJ5a~0ZWGbp96J6QyK@<^%5#U(=IxQrUnQH;Yxg`MIV!~~?j1sd0|^8`H; z$>Nb4J=8}QHVYzarmmsKaST#|Tp@)=MN<&@j=eZMa%NnCN$US5B@z+9a~XLtn%RK< zGKh3Wz50_3i*#1LtElfkQgo+GG&R!hWqGi+%;OO%jfD8LmEe1M|9aE6RUjrYMa;E) z$+xgy&`$hyBroDj8%W2=`%5~|H%<~=d!k&A*{aH5R3;j)n2gb^&T>u@g4=ul^fB3$ zW1PU`@$d(p1!m&|zANFCssvpKE0I6hpxfZ}<%u;X`cj}x;p?fh^6!;*^5c0v*|)RG z!Hjl0*wZ}`r)qcOJTAMvLd&7 z`AB4j9E%Ro8+sYhDi{R~E(Pax^jtti6)sdD9_yERJ|->)xh=MaFV8<%E8Yte+6mn9 z)ZWS~p1vq)uN{;mB$55s$Kbg_hV%95&mkqJ?{|aY(3n~ZR{RlJvY4D#o8tQTQW;I{ zYuP1_Pt}dq&|j+O4pNVZqKMlj%Bh&Lxq{VDTVDVy18Ha_%bkTOK^gFcXB;mCUshrk z?z25LIU+#8vZE`pF506*$uk5^A+d*mkG_<2pI9CVXh^Fwc0dXH2 z2%`%gzGS=}qUl>ghMN?_?*rTCYByvrSaI%~f%IBDPB|!P%J^)NV5;3lil-YfIkU9gl-cx#yKN!dZ>PdKfEL^~Y7M{E zC#E3&4h4Z+zTmd(T{+~k=*q-6r3}(*(lf(U%+kr^V3%ATf~B+Q3Str4S6j!f$c{{C>g|9yfQnk|@w znQq*QfK3ARBm7-4^*qcU8|m6gPma&ZM*oLN5i~hJ3>)kyKepBZl1S(Y1Y!-(}S~jsKn9<)LD@}5+?kHY_P|*NjF;r^pO&~ zTee%BB^mgL7jn#SBTc~@on{qlkMKpLc~;WBYXfYRo$ z;&LoF^h4$?51&R&*FKv~zBR}frBg!(4A`XI_AUH_9}LaZEcY_)i#NB`%MFXDIkPG3 zeg3wlH}YA%em@~fqP;?)H12NIO%HkGncvmCnm#Mc1H1vk#V&&wV_ENaO@h<=B-+%yKb1P8EyR;Ky%OrTvRD%%oCf)?STx7qjVd zpJ4v097%7R2Kwo`>9;88H7(n5-al(~K6i>KDJG`#EN!ne0#stm=_!AUAus#;nyIuR zg|E#0Htug)icQIfWH+l(c;{3&72A}VlrL^c3O9JA-9O%^1W!cYY1)J)e(y?}PeLql z()LV7<}S#%dM-WfUJ*%fd@OtY%M8zi8F#&PLVDS4HWK*rz%i5XQVvPsEk>IkatO_g z?u!eQdMrKOwSuz#7MV`cFYM6%+Kpt)Bf72Z{oiEs-%H4ql>&!=eU4^;Kp7Uaoi}F2 z0xECL!QH5m_?86PI!YQ8cO-hJ3NGHoF$1Ob=qaB8Ia!}DSkNW%j_46_5F{YDGUC?$ zdbL-`XpZ@|>pgvgO*%9Jz+sH^?9b0Xs;MgvYc+Vb4dffAcNf;FlXSzXSqQ9ie`eab z`Cp{k%z9-DZ;=TFZpG73B}H=zo-6Y~cPun;^1Eukcje3Q%@+S0U3Txy&f*&rBVfEb zz|qa3r;pVce_ICgGf2Fh2IIaK*p2O`Fd6)Y>?tV7J|jOfGGiHj&#BgCr{-Ia{Lty7s#$&lrR;~<)7BxpCNrkGu&o>vo5l~D#eDAvWRlMNJ4 zn@|&?{J~Ro7CnP+~rLHw6Jk zP1by(7qFJrBW9CTJ#9XG!fvjufNng_WAG)qC{!TOxhjjXv(r`h+qvqNJbD?z`JwgM z9m63^Z#?v3E8anA1!oXFvuC*K)$_7xgp}7n>(#2|Jx;0p8-0^LyjPWoY|zm;rE|9e z;<~w=d6~z%c3Z&1HCgrbbV}1hDquEe;9DAhoPpa{WZKCbL_2*|2p<7Lpy=|iaQRzL z`3r)wTpi3VI)7ti>lQfl*vK#eX|G6YRx7h5rbC!G^mmS-U^>HK|5s${BJ{96$e<>E zumVN2q_*-B%zap{UFS?RlV>G@q@kQYu_bsdxoiVUa-4~t_1Dp~E+s1*GAh>IdADwv zl?H4hXQXc(*|GFHQuaNo*(ZgPllM+{i^(;8KwSln6m6Gf6D@AsJfW-FUWX_#eK_>! z6S+LvBfxl9BEY(Yye$im^j~qubj#1~_93Q*47fvtvu6d_yF-mn#0!2lS?v3n8<3j! zLXa+twQ_>fCGs7Y$+m|AH=?k)+Qp-dV~gCUoO5%F>Jwj=?P7>U)8rXectPj`rc(ZwEW zCyH{aKIlA1&=sj(d=O}Fl@fKEBPJ_(zGBi;oz{*xDi#f@O_4OWD~qgDT?I2dUWnl0 z`EZ2^qIPd;oF%O-_b{FO7%6+l=72$qQJbby2aC~RWiYs;37G3ve3-_sE$nqL7Q3k% z;zckyNq63V`L4f&^MWE1-=d}ZRh~$eHQ?g|_dcN7RcZS!j6SQAtHg?>soOqgw^ zx&AGova&@?E4$fMi7_4r{)Q`-$AIWpN7c=F9}J!v-sVZlVqb69d4lIU1Jonmb*R3s;iF0>g=qUV z=8T_Z`|MiEhab%OK-Uh(RyV*b$_$4hNv((n6slyI*)PI(dAl89tp1X}sbZnQk?N30 zNc67S5@|-;u%aBcem)P@T8CWn3kejc;EqB7N0?@Dl=UPAUo3mVhJ=A3tI@tfR!=Ut zjk_~6K>HJ4tf}X)U|RJoP7YByI*yaOv-OIQC-%r1vVe$Y$InN)&0*l?wBZDil9_F6eYSRf;XtlNbSA$uxUMA<%FZaAOt9b=q7Pz5Ex6&tPlwJgBVWv}>UUmq zQ>HJ+;#p=H|)*Ov`Ob68?pJMH_BqpaaE)T82i1xA``M_ESt-mfT+Dh0tMCoLD#1xpu zu>vFM)V0rAnK29_B@!DLf*taT@31Nwy@Ipa_)fI2N72earwVZ?24I#}djy9j|Yh+OP9${*398)t4TzJ;(9EPJ6Zi28(>GGF$csizxeZlSkj6L13+wMn z_Bh$URuWB2vP0sBiY$FU0`4W z5mJcHAa5Jx2w%JEe1&d@D73H`HqIrFSFce@fxKn^1xoZ-2y|k(fmk-zA!51NM{uI zw#Sav5~;DU;1^gE5jNW+Wt>nOhzsJ|*ntD3ocyy71kFqZMOoNGC_o72<0^W2_2x%yfiurB%_ zueA#z(1szLB8~(TW13a3kyX#!Lrd$=bG%$pUr8NJO6$d2GviTOmk53Sa>yzvRp`)$t_iOgC@KAOfQp~## z*K_doyuCiZQ(f8)7;004^?!Zn;fSvW`027N0CwP@cnU^n4Kz1DT#+mI1xt|#=GGbc z{FBrxT6G#vC^N(jMkh}DO8Vk4Z@GhA))lw~pRZD+LuLCG z3lMW_eo%k6<4aJt<+J7U4HCzWIi+Q5UXOHnm3;pobTFP8kP7P62=*QX77DBMz%#); zTE@Nw;8dF&An;#R3n=kfC}s)0T-R5)lO_2VcUSdO2v3e7ttizE1J}Nykl4$gdj12#`$A+E#|K!sC z#n%4!JOMo$!~b`UO|&Ak60#{8&150cnMTt@A<*waa6p_9P>^e|7>EEQft;|MQQEs8 zSVB5ode>22Kwe9o%Dp;;hUL5fD*r|`sL?YOQLM0Rb!(6fY>*JTA1BGgkB0F6O5oV2FXpldM_yH0i5CXAZD8Ubo>?~7&d>=XI zs3T_4GKg?UcTiXf;Y1w^{X`ufxp076G!O)k9|4&Z0!|1)A3nc8sUHe1*iczYpMMhg z0Xb3yd(M2)1Rrv{0||_jFOcmNID~*;;J4I1Ur`W~e?D>Fue1k(LvA@UNa z5?Bxn=wlF|Ama3pTq3h?fJsBqd`kHxYi>%BNKj0nplLZV0T}ZNeho0wUrQL$Wf;t| z(qvIM?;}iBnW_JSv2$7y1zNUj*|xFEwr$(CZQHhO+qUgpwryAS?uWi{BlmWNaE+i~xW=fPnz~1c~@m#B~+MB+1S7hq(Ye1ER|p$RERRNw4ZJ>=1>bfjb~u zOnM$-6Eg+p!kV8gETRkGVMe?sKp8Dw`&prGkyxO6u@$_1WUW4Rn@!@cEEUT1-? zpTDh;HBX-H)_;<;&f(u#SYVaar`M(^#c(vhj*D4e&5FN&n-LMupgrXI#XP0fLGZwA*Vs7ikTuDvRxfJOiec|)vY~xw zY3Mq}_PmN;T29zIiFo=9pRpkxgkz%%)waBFZhSjh%Wxf-Wvw43-fMbIzG_S!0k?P+ z&%*1hfpcuT+UeBmcA6_4X8QE-99U7!e##g0bxM0L>v*;tJC+l^ES37iCKvyTXWX9N zVC;Arsjgi|9sV{Gr92HBu4kO4Cgw)#b?9!re@K;QX=WF*Rvn>AWuJ zI?+^mG(kZmyT6H^%{)sCiEhhv2LH$kc;Q075viUTZm4w|_-!!;pDWd1& zQGahZ@>2zeRL6I%BnyK*fcKBAvIB zccQ(8vU0)2U3a;>#mLfJHy;CIN?opcT8GWoXFoSwN?&klG_qBU6jho24!j+CTsLM! z_LI&dJ?o%>faQCry1UW?J-1=YP1Kz2v^4dg=a;(GBZ2x$NZeSwFcs7nBQ(qoU3x9+Clk* zr8usGsl0OFz4o?oqWC8 zA}&e3&G0l2!#?cKEbc}$Lmv&pM9<_b?$#FU>=x-yP7=8o4ird07!&N=%{%v)^O$qn zy?gs}+WDgERo7D6^V`v}{u~pGk|Pf%&w_$P1%d=70I-o8Yft7yyLy3CX(L`$PM6vG6)+9Xik6|0{HQwZr~4vLIi`5l!)d{PWl1<9tQ(}16&WDUqH_e z1}!3#1EAjAgSs2TX{38rdN3M^E32jeYQyZ{M%r7uy8vTdb27>e@8!?Y0_h6%Wu&S$GgZ-v5k` zkX;n^2H0gW%m`NpVD<$9<|(foauG68v_C=K2LI5tMg9*1`NQL z9Ms3D!H?8Sp2ruBrtl`ekb;EF9v|9`oqsP6P6W$~%Wqp@ALUPP(9f;T7+zH9CqT9E zuk_7a==byYrSZ33aHY6dGBOS%FowY|%n;u7(`|oW7X?Lu_gBd9?=p16w?-acFEPO4 z0aC!P9FdqDGgjpAPmi#l_4nls%cv&xq+`R3=X4=jGd_^^Tf!`rjLXAjFn$gt()tIkrn(*GmrH zy7XyyCui@qEe_eCR($6cIs99HhbK~WKGhPfWVn-G&o-T6cx8qkiMN<<*}4=pD?8iv z;NlKVxItpd!VIzO?Rf6ZBFYbg(Fh>QA=1A2#(F-xs%V-W z9Nsv$UdJ&Ft_`GTagWG{71{h|H1;8Dsf7CF5dzPOg;=VTQ7C1o{*?Sj6H%j`5AkeE zY(ylo;H~M%+N=KzG0z$_Nmpv%T$2`V)0WFugw|Y-&`O7RCC&$Q9{gqHlPA^HwOe+o z?bizk?usxfc4Hcczi}#(y?Gg>T>x;q=Y~L9v?L|eLoFFo4Sjh`Az!f#)^uYI7Jy&Q z`cB~tv?D4GweCkaF$-qyTeh3APC|cr9h;vwAEL$_?<||R^=jHRvgS-JA$c%%@0K6Z zkg=|;t)5ye8{fSnz0aGAYtMV{o~z!~ZXUzDw~LpSw@$Xc`}m@nlQ#2~6Rf5}{hB11 z1}DriJra&4p7zU)rQeN(ZwLUzw6Ce5{KoJB4=GIzJqaiNU@96OvpDoq))FT4C3{CA z5}2Xru|zBhz9Ql-7RQ?^1BOe~EiGkai{>_EMRYHyv;8bgNVCz$Py5hqCkK+#l^F~6 zE_QeIyd>}Y$7UDqWn$nA(-Jyq%plzXfEKq_`J-wgiEZR>GfD>hp+Gru_v(J+tC|+m z6}gCmN^Ouud2ukM6Ah=*IbGh-`g2U2x0?rkSrPF$zk$C?4B5QACak)H*VrxuM2642AG1Jm1`WDR%y!Lue#2eCP1_v@_O6R2sJ+#~>V^bY6b zOSB97^2YJvG;5Q^#CqZBzd$kHW(-?k@@}cv2$tBkaGTtj(L^=-os38l`+1o&RFrDx zY?ZSZy!8{TTMgX_=5afr;qxFmHEwlu#*atJIaOLE=}r2 zZb#I^cvU%{MN^fBOY4ad?o0=`j6B5`eKWaR0u|Kb)3Vpdpl|V`vw@osYiotX4}6XT zBaM%KZOXuR&_g+Bx^74IQes2Co3+G6H9dS((FdcYah4;a^Bz9r@V$U(6qnVTRMf0{ z>Ue`}ysOPFf?N8lD7KT^@0>9*{mM+GBCe+|(BgbqW0qX$_&q@?%osJ<>w=i4!FhH8 z76)M?pHl9$X;nbYd)dyUYeO2+2}fu+mrJ|~tG9YSOe)sL zHJ?3h_j$msy!RXe;@a=QSzl~C%*Yk3?}FozI*&b!L5Le@$z&-qVsh4j5T<2HU{{+i zXYnY=l-*jgE(6D`jcBL_z5>ffN!_=9y{t!zQf1(6nejDRMgkoA^iPWf@?&I7nzbjj zr$Ok=9fU_iAkL>KGXmMomK>zU6+{UW_3wJ4+?~GB>Za#_SV~UCxYVY~E{b*5U;!?`oOf*6)$ zgtrc!#!&e|^wej?N{=XMcmT1;mFZD#Kpu^scm3Wa;lNehb)g%|xr$x0RCjc3vfm`B zpV3ag(Kt+`hnE5KP@I<|l#-UMy{g@{(wF}|?)!E0xe6@ku;Beeu}K(y6Pi2qNd5iN zQhZ;_2M4Sy%kuG6o(?x!tV=**H*OlaqBj9}@8eQy>5yf)5lbN)c4>?*X?DC#l#sT2 zWsJ{Kb>x%FJ@<6v-`D2LK7_PF${~Pw6o!=BFUqm=FMRb zq`o4#2kOjIR%ahR(?OE!4qFC3b|oZj%lT?3{jKl`|04z*R>EIKhpp1cu71F1C@R2u zPkU0X5M{=A{?%=#9O^b2@jBfNk$wl7#BX1KZ{}JPCouGN@eI0k&FaJtAd82xGGprC zHuFl%w|qQ?}Rwwe z?|We!`QfKjgN-@cCB;gJV(SClu@He!QQ(!26{Ta7Elp9rA^wVJAnO?yh=sGZf_oW%1(W zTB^}i;Xk<%bg&cnmXZZqFq7PlMSBMoKH-!53^@deMhcC%P>&LWLmeB{^+wR9X5kH{ z(xtjZ#U!aJOdLiB5O@KQen*nwp&iH_X^y!b-eW%dX6q9J=aSxbEoJ#UUuvD@PvlpvFmmggY$BNzETbv;3iuU=j3sVAR>QpslSROPC`{>;Xv zY-0a@I1Of~Ln?!qmW6A=vWjeRAFwzm>(=Jho*0s=r)$e^w-gl$Vy9%?;N%2dlsTNUBol(f z1^n3H{D4~cA3Dvh+ZT0#@ppl?aZ+u3e7SyvB@EDG^93;T z+{}xbocJmig4Nr1wjtqZPR)y~OAUmx zln99|iT`aNZUr%fe*=?2mN=Mw9{q@3DpFp6`-(nXV)EbH*vK8ig<$sAr6yi;b_`gP zMQ#6C5670!C*6Ldlj>n%jq*KCkGkdj4^$Z+3x^8nd~?e%Djt_wSZQFB$TAZ!y=<~e zbk%0p8XlbvEBrJ75Ae!t*-=T}C=p7U`J`UQniFMf8cSj%bwb`uA@SLcm9>gsy%bK= zLJ+VR5VoCg_)c_2$w2la+ob(3;6#}F&8fSRj7hU0I<|OQ=AI)Sr562(_JM996|V}g zE?SLY@q2ncl!J(zbY}{#?Ssi$yv>O)#rLk~!_n}LV1KVGV{x-I?o?6UoISxFvx49< zwu&k*JA2BE&pz=F^R0b~Q6E=au`>kF$hP4#i2@K0CFi1z`n`9%jV?X(dWu0@YifK` z=ee6v0E#H_=8^sB+yW4l zy(zFS?j%O^T-&PIYrY~~8s_xK8Xu;vWh_AmojYRs)*kzjjT_jy24+oND=o~Yd6bYIDsu6lxIPgJG|HVi7CwV; z+c_Q{P38%1wi?tWX`~fqvMV-tadb^q6@uy7N}LzoLBTAiDBekvCg36fP*FD-V9#)C zP;UPzVymTyRa++DAbD*LRi;$vneNlNoa-C2+2O@wdsr?7?s~JY?U;4EbgjtcmIY+| zhfJ`IT2qQFdJQb9_kpJ8um#t--+TInDOU&)HDQGY(XDv#WMNt)HRIZoR`^p4z+8_IOHT1|DdM6}lz)mObkvISL+{hOGg$osE~LhEB#e`FBONqW8(i$0 z*>d9m#gjW5hXpHD<9^KYP=Nt_^9U8_og0cyiWYGc>k>5h12mXNAJGY_A$mCAjBYm2 zNcz#ly+E&h;mo~h5k~Z@@nTXx++I`79S$8~W<}+U7m<$67Xy5qpl`(97!dg>!B!r)qSFLTgXIul84jFJtw2`hIVR? zx7NFPo>odb1kZ1 zvv|$8WId2>EsbnXlTR2DRT9j=`{;q$My&#&Y@+HllltvWqw`gNIdLZrrj0zM?Fl$6 zP;s;S7aPkpJ7!ArE~fh{CmIu_I;X=JkXN>_e&mmv^NC_8>PriKHQ$9LH_#st9&EUU zM^CfLXjECbhZ1=p*x_+A6#xZn)YT^vLxaTbidqk`?O7RWAi^jGzYQo_k@eazD_Q?*{o?_R7nz5nVKZ zlFRMEM=e7IRZqoRnIR^o*pT-fOe5vAN+&@;>K@=S#wOZ~>O_@%s~vkWUo!D%`Z6Hx z6P=1Zl2A)n^*^gW!lbZAzG7jV(x~Ban*2a^UkSfN$1UG@qp+M&#I~m;G;F)XjCXLi zm_QLpouPB+U$Fm4?&j{D$eO)i{-AuTim?Mxosc=;~7w!#rAR zm@iPF!M0z(k;3JjYeyXWag&fT#p{+N7Z_PX&A!NQnh z3YZpXAU;J(@OjE8)Aa>}ZdeYSZ*wrS+s2ZGiVf>6eI6x)PJ2<2!=_kB;o9V^07JX~ zd>VKXvk?sc_Nf2r#NXX7x2D7JBr2tMRQxYvg6&vsbBw~w9F)Rup@oZBwOvHtv*?pU zePp7kxqBGP_bFyzwYiUAwvo%yXMqOHXlh(5n3LSD# zV0KhX3Y5Ers54QoTj~&18Rs3EmRp_2%G6Fk3n}N3#f-JsPv%j|lj#?5A^Bw)GK}=@ zBKD)h$aMEmh(PHU;J`Dnjb75D7V&2uL=XF}$T@xXT>qVHcg*tV>a7oHZw3!B#ntDQ z^P1aGt+RK_v2jc?#P@YoFX=Gd?(Eu2|yo^Mvp_W>6XLn*QFjYOycu>{ZNt0 z-UxwPD2ZA&G;ju}!>OE*7Zuyh@|-8zN`RImhsSAn1M1ow?8p}axdH8R?6C~4sN5`a z$p{>LYSbu3){kQe)!8oi&$JVl!6c@Hf7Zq{K18_$&6)`FDO2tDitA?i?>kv4EE$!q z%QXdtkwZh2U1mh_lxzAoO!;OXA-}Br=@o{kB|X1bjQ9~N3wdCr!atovMXb^_YPdE9 zIuWkgls<4OJ~+9;ssmZNG(;?(m+{nu)FD9^s%G?(+sL5sz}%8LAVHLTwMiMeSw%Zd zgpQa;Ul;S9x0nn!tGL;HG+s|dy6i*gAOhEk1A(ugj;$(wk~o3Sq|gQ;3+gdcY@%HOAq! zXb{(iImHhNTVf;$m*>gnmoEjzYuZ)8F^b4=yaL7ppI7wlD|f=1r-P3xwm-CnTQ+Q$ zWtP)HMy2Vao@OSM^_JZKrP8dZUXXsT98s`Y=gq>p&a}y8P-!>R%r*RJNa(stm4^;` zP0Tky|84w7=&cchQjslFG}A$#;Y|pV0g+IU0G)DT&mh_;DDJeZ@Ly%U@498Z60&x& zlXss#i0+F2XWa3U?#UZbY>m*Ca-><~HS|zo=v!G}%2;^+VD%miBt(E;p9(l^_ssd$ zQcPixyQPfE<~n^zsi4Ni_7f7XX`F0A@cXm4QDfm{?1GIw6pIsXFHChiCr!5qsgZd7 zixf|9gG;c&+KYRyJ@Bgl`p|+xL)U7941IR>D%QWO4j}KQTidx8qReY9E10C-;96Dm zEK>pO#meyG*OCApOvFgoX0m&u@Gh}oLk%O6G-ns1&$KN)qNm@lR=D_@&b+heb6L&^ zEPHB2-HTAjkBupX6xxpE@M1A|ElP8iVl_%u)$%^-vDe&*UDDu$lV);#M7#9%CfIZ#r(I1F#I;6-z0#qLT zSbhOsKtM!qRaFvVkl;Yi{uBZ7aAJ9R!2?KnOdv3*a6nK{;*dP?$nbAk#^5*po*%CS zcKLx#OmcDvl=yfQv;-8CK{HTF!5l(*cs&Aa`EB46xO*VW{sC`(AB4zTwnB7#d2#JP zG4(UKOkJwLsDe7k)=);|MvK;T~Ng8Q@lM9cqd+W6RC)Hgb25fS)4eq9BE zx_EyG`KJgFc|mdRH@|%Uo&<3SoaZ&4@7A}vHsq&Q3_=7x2n;{hNnmQ!^Gw~}YG&aQ z^JbVRXq|-)LXEakr|uX6LsC%O7gzbIB&&vvFEbA`(0kI=6Qf;h&breY0kEOUFgczi zCemA0pDVT|pv<#rxkl$NHU#N3#4ci*XJj+4KWCmsQF@Yk8Yr*FIM26eXHMkUcKg#z zg)SQJ%dRG3k&ziyrUTN2MV0Hh^jL|e?x~{?Vsvkby`BLbcPxK~S+Lp?yl(y$tz>^-adB}^1UH--tH+F)wIco*28dnMJNlQYEk3Cy4dLXIEdCc7|Mc@Xamt$DoAQ>i z83PV?fa7U8ZJ>Y!=)zCe6c79N?}d6Shd*Z76~$I`)kFumI#?1*jM9?RumCj#uDAQU zqFrS!@V0(Xb(TbK9Gk2emj-$SQ_Hi=MspfuVQeT}n(8TET@(3u2m zm^Sov)Wp3}^2$nO3C`tchs4Je?MV2m((pR4%NZl3Dh#tyL9fZ1-PLMTKlk6-1U((+ z%vTH58MX&s5sY-R*WwuiHRgXOEJ(;R2pPgo=qi_oi%=rn{L*3759@L%>ZnhL4~A*+ zwr0&0=%+P4O0Z+RlQDmC;{c?670yFYj%Red8VeQ-^s$>{*q`K{)8*BdUaUkVCslY` zxGdVwV|qy7v^qvLMtf2c%`R`E$2puCH0Lcf<@T(L2ce80vVJtc!ewfLSOW2JSECxc zhsPy%`UD{Ol$YH~zmwfMcYhp(1_N0NroWf+-Cc7QNsP`v| zz5U93z~g3RWAp(gMSv8=@1@B??R8ve#XCp$g0IumvpFb&e2jbDJq{)ntS-LS_gAHo z1)A$%@=Zt%3zDk`aKT#C`v^JFfgP}0D_fG~N5-0G9)Wl65^23^dlg{8*q9bLpSA8A zEN)K`+wQX65R~e=91*ixWsr9?vZ0Yap!9AK=is1R$~FNj(Ab2RE8gz7dqS;MTe9c2 zdNW0tB!KuiEpWmyFGUzrMh1@G2KO_Z~)I;gQ~=~FM{ z@tVC;41ix#<9r)99O9>mWE2=@Pc_jS5t+sOt_EuZ?mS?Aq~&o<`tVHN!&atq+n3NJ zWJ$KshZ*}^aHL7yBq%hl8Mwj)9k8I1#fbq;7}6DobzDzwV%xBtLJ5xGo0{eADFe6A`zlh*QsiUn9G_zi;N!! z8#~#mU2-qM!0pa(jsL2JxRI`s!8?9T?7ac_+5v@kbDosqipyW;X=pu5ZCa=bhHYYT zq40FBO%_e``=%vwLih6Jp0um?9(Rx4f0$3EA6kw}`pc39GW@oYuJBqO-FoLd10TWB zJ7+)yTSsym)-72piwocH-4fosd!+Cepg^0;q=QK>2c*L!QsXh5fW+@awehyu_lnxY z^GnC}hqer4W?+e7a8Hx!QJraWXUV+@QG~D_r^Ne)+{Std0s&wO&^eF|RJ}+<5b@@MV@cJ8Hnd&B zu55prl7Bdvw>RhlHUisP7U!H@lLC%bj&JOS=;D#VgHY(z(_a1FS0fRD*m6%6?Ppd0 zn8|B#=oJQa2;Mf3#Q95~sCn;G21;5Nq&4?x^3Q7JRA8TF{}As=E7tguX#jDfU6YTX zmDTjMP)hIxTz9w!r|WfO=#H>{j814a=j2gSBOK#~+j&ytA-A``yIB$FcH$v}=|%m= z--$I7m#oo$wG)u}X#<3t+!675jGArEB#w(b(fAwFCU(o^z2f&rsSQlF zoE$wU3I_C5$K*4SD|Xf6*!8Mz^LX=(0Bq|z-rDK6s@B#weD@BQP$4p&wjP;2G=WVa z&8qOs(Oa4orIc6n$lIB9)HB{#s>prcb)@}0Gz@S*YD`*3J`%DQpiv{Q|KcRozS7zN zBCT%^EcqP0LmcX2u6QFC46MGr_UMnlH#grcUCZGw)&5kYJk9^Et=Fh-U5& zKxc0CY}YxzDoK?qoR3!P3(@TE{2a*Vsf#eutX;E}-=!+1&eizjuLu!wQna}*`ihf0 zK*(}6Qc&`($gLvaEqf3{EL1=}9NjX_H(%`6VicxoC7AWfA0pOwq0jRHAdpM&p*mxS?+tu$APHLBfLpp+ z67#c81D=AZJ!yjezp@y98F@h!I`dDtSacCi9)mqg$UFZP_j1*U$VH5Ts-)& zVkzkwP2?M;!6+!z1@@Lhwl$;%;>;a1PGrMtRk*jBkey;wa#J;Rb>*6?< zZ_yzg;Xw~N@-D8EZbl3)ZO$!9DVMqcL%mYg_!A)n+ai%iC8K3PF5#ZRURdrst+QfE z{6|2u?!*CCXn?=7K>~yU>d#ldgpjn^puky~>FU>uhsw&;C*|O=$7$!AQx8+gc&`J;+Q#Z}daE4{pB!y|5 zhc^H}qNohVjdMv)0HC0WA*OGuF*SgLAmV+_TcqhakgMeoxK7Ib8nM|8%B_g6B~uR7 z%h2(9oR59XEy@OIH88x)fbRo$DYhwFbvp@ho9|VJkjYW$X3L5DkwB=8JQ9X_1;SjF zgK<}P?HNsCeQN)Bm*n7GGM`C&LmaxgGuGT5 za$tz0&tkKrMXfB0rg09H$Y|Ev#S5heLp8WC^VWW_z%d%gnoN8p7{XmjW#)GqM-Pvc z96fk$*PUHTtd-iieO75a;^L9tP9hJ-v#DNMheJGt+SJ?3BfHczfTrZ~JmNlgs z)iY`a;r(%jQxjvO$u*Qhyv9+N$Dk)JHKf{o(2%_$kK?S&qy(V)qh-h|X&v3kMoE*} zCVqyWViHSQOZmA?V4Qe>n^wvYuk!Sq5%NQh8$cLr{Ls~Odgs~a-Rl6F$2WGKh;f?{ zL$F#nK4I6^$*I|g>rwiS)6k!@Fne@E&M(DcNoX|7!d%ClsaBXCKUdqvOKHLq%d!)$ z+1`uL=&dE{@}4D$te4Whi|%xHyhtfFs;eO!?ar@f+}KihL%s5Q@gOXmWBF3<_`Knn zyo@UOV?PW1F1rWNRt#n7x0z5P)F%wAAT?K`#3-tvYlJ$_(+$hDB_=6VWPpurLZ50Z zr;>3_E^aTnD?cBV@vb@&U8%C;Jub0)J$KX+(&{d&t-xrVVruV&khv&1P6}=trTwvmzz!Z-Vm3FOLsEPTMA8)A+B4XWUC(CByEY#ygHb|1L&ds>&Y=SPV1; zK%Q~oqh!i2Y<%*Sw18a3zLPp_6)IQBf;;eOuIm(Ucz1RwG7rHZpJ3p;;wc+* zZ|~u4f?~gSt|a9vS1jNUbhy$V{;nj zkR!CuVJ;+ywmo49Y=g_}nAE7~eR%uZb;hMHNIFN*EN=b1|K&o@&ASO#!AYRie|S8- z;Jz9M`NyB*3i)_Dg;qW7*>=&l=OLt$C|W6>iH?8o&qDXS76ZHoJcv_fL!-V|ck? zBdt*AMtBA)NymaAbCB-IwnpJm(REXTlRjUwu@Q%cQnUrd{5Z!sS5zZTPS)xmxedaT&7&4wOU^Iz1{7wID6I zH;oh*&T3O9N3{)5vQ9Tl$?ioyhj0E=ZmlIR-zB954Dwm3V-X;#2$SEIsHw=YT*t=? zqfK(4iYprfQ+PgLokoTTaLOxu5da=j6Urf6?3QXlyWkm-5LS3t@Hkxjpa7{{XC?0(kM2{SAse+T%CwkSF~bYCxNb~pu2s}8+yunb(8Ey;HS{^P3alSej{VFtRt&RJ#sm3JlfcCPz;wgK-(jaFrW^5RoOf|vC?z^ z;%TIE(|q~K)C3Wr3ma)LV;#BjzE-$HVkt?f51s0#H<-oiiy!U({KU>6F8kUH!gLdH zvV7|AL@z`+e01}g9^9&CvA!>`6RL7hRVVqQbU+CZS0Ak3%nWiYd?KiIe&usx>H*v& zNMBOS@`pWR%E|DoG$7diYD8`#pyruEC`QqR@NY8~&-r)P$cUosnDE2g89nsPUe2DZ z@7C6j*haCZV#hKvavYM3s61tesIV_zh4!>$eM4+g9z#m)_;Jnw!(nn~oA1f?k(&qh zHks}@UD5}!fn+G0T?-aT*Py}+4U%&oU6*pV976`Snr_7d?$BX8$Dq7SDH>EQDNIe9eMXShc- zz#D|Ros+}zC#ujN-U}xGGWJ%n0+g5fCkZk2PpF(IUf=O7eB|0RNr`DeS5Vhs-oLco zHD|s;D78dZjBOchr+ieUJ^?y2BT0ihg+r0%Bhy&EqoB?(as+7u_Y_!YWUDcDL6+^a zmteMf;>;z@HJR=6Rxc58^V{^2ORH|O*nMe*HI_-06slM8eAsuXQXReK=Ueo3QeXQ#|h()-*&vmc%-b_251jd9S$h_%=XVgpS?} z>3_G`3G~dLIPF$#pN}ElGS=vxx8ChE?9nWx?qpeRg-9hm^Asd4(Gmfh%1B*XC_NH% z+!q-RTNSIUs9dxzC{UHHRYrnu9DX)miBRzDRJf9P8Kbn?}BY}2z z4%7?>Ma!!`tdLd#%g3-+2^Q73tVziWE*bLKbLMksdj{!fD40GgP%MdTf?0GB_rIZ83DXD5|FU!mTuv&*=mQ zuD+EQM42?=;LL+ujh;(;=eIeewDSHSSOivTbMp3#c|^hI_DZWsxamJjucf-&h#6X} z$tk3hSa~h5t=cjytb`pQPqz_!L>$XgkMPde9^IgMa}Kc0uH-Fof>%ZJGvltCCBC7P zusH1Jh36*hKQYQMR3+qx;0A>=kJzo`-MbHs<)*V%`+R*_NieD-IzMc?lDa}daDTC8 zMe+PIHG}kC6t)~hI&KqN)GAMF7_x)E#t$hkJy7ClwlPs&xA8G~4N{_>iBFaK0yJt%*_kMo&8Byq6>Beh{D*@5(vN_;SJPB@&RH-k z7oo+5Yt&-w@B;FZS&ta3!RgtIv>nMoOtr;s(U;iTQowLU4fftag>|oQH)MfrFSOCB z-T7M?IT{;x7Wx@u@ti4CDDItQe}Xu5F!^3@qnM9-_d5Hs z`9jx>VQjxR#P7dGm_y*fcYYO;+=YUFrQ3s0ai zBSxx3>#h%>KF4R<$WVwj*n^5HPyB>efvGuRcY`w)R=5 z6|}ODBrf6e7VgwJxr3@*{G$jP8HlAW#wfx>c8f~yW}RwTvbp_i%I6Q+0|p(WN7B9M zm8cw&H16_by3U;v{r$mz7A-WJR^!22gs%{3h|2D51^y|V6H^HzN@a2VOB@&QF zXCmCD8U-O>0gqf@16XX8vpJ=QYZ}S=;Zscnau-F}8Cs(s;*Cc`nzu_Z_-@2Z$ekmU zbe4s3ko~^N?vuPFPP_47o12=>Er4k6Td`yy9o6iN= zQrq+#@RhmWo2TdZuo;iEnS8o)?Fyz*?-CrsM}!p=*%2KYOk~sLX~WUuTwT_Z?ilPU z{P}ojNyWF!qqM%9Z`jFQZu9HeyXVFissZYPo_8p^pyEI%xv z4*pnrRP=03Vvt&A6Q3vBQ43!iu3=4PWii=Qjl62YW!&rIBs%3$VPV*6eFK|ydZn@} zo_()JXq~`-3WB?4W^~`atd`ZwVUxboidXXD%l8)TJ0l(wgUDCABQf>fftf6nIEaBf zP#i(@zKvfrGr7`pMdo4G6p^D+9sE;GLXr|}ol3nXl5yh^m_ck*?n+N$1+PFt^(wQ8 zY12_*SZTr&O4n=cuAy~a6m;8%w$L?>99_DGKf^hl)9fm%(DN3JC?f0gx@E<5I}bPMw7g!466Rv8K9`WaKXd1R&W0OQ zfifpO$e|B^(yyne6Jn2iyEVis@xDB0lDMBo9|7Isks$^y`X;w1)>bEuw zyHRX6SxzunOWlPSuN$#L$N+1VXq9IDGpcAV2a z94{_Y<6^?(j4NEmMw28RQF3Dv#qg){o6py-yxs3^-8sG8H81V8PamJ!SA0ENI3guN zRI_HH@&HkT5aEJCNB`V7X4-caH{5DFgbL+EkVfS}`e{yAE;l%7L ztr=|R{y+2O*l_Cda0n?WsNlB#vi{-B1eAZs2x-YEe0Ge1KK{`Et`h^7zx4wuDDVrb z$_gsVDo1By%Zv025O2Wm0XENz!y^Ej7iH)BCjg^)&V~m788S8oA{q8^{!)Vz(E9`L z!44v(KW_7z0bE}1!FaN}cLAHH{bt2{c^5JbLPE3W7RetC_B~k^Y0vv#ofq=A@9-|6#nx31w4l7 zch?W}dulgq$aNeX^!4?X|LXw?<|60?Kq*eF{}2TRobHb?zlrV~`r}j_3Xf#5x97n7 zr1#*L0sLhHcQ=K*r}y%O{&xU40On2ZjqYi8&+kRc-%t4a;LA(~`_f;Sy&`{49036d zH6-#^f`}dq!f$>ZBEZFwr|sZN*tcv(em0*CDF7&D9%Hyph+`}~{Hw@y33dM{7Kj0Z z|3MCt+po!woW1Sh^=Gh@P5PN;8suje`Wu$Xkw3q_@4|n4m%Gnsq0h(%yqawgzaEXF z?c<9$Ku-^mVXtof1;4AjD0_Yu0tJVDBv{R1f;F$L6U z$Vm7bH8L@_i7jm4x4Yf3_v;3Mr&?)jq*iOAPW*-bc- z-|ADC0>qXT8ApvX|9qfV-SDNGDInJ(+Uz=V`-F7jDph}9KWZDSCi$_vo>}*;DY_RW zmHLVK0a%r*2JfJ?JoB6czM1$IdKeWn@~RKY6UX;zdyI9z)7~M=I2W*HaILkLfJs7P zQ;`tB92HZ$k9bO7An{5Wn-s2dSJdH_W^aIket{;nK~CQmW_w@onJbr>y^JN^b_Q)TR7jvaEvfGw+b9T&symChR>Wp0DSba91M!FOB80N}olT#fT%zCy1GK z#`?2Jd2VF?ESXHNS5RB1II&P3@`l8Pu}xM}~_nT?N8DQ)b+GjV9>&t)7)I zlAkY<3`?9*4wmvQ*kjXaY>)dLtw6ZlgEZ%htXsyyX8qHJ@C1d5=+=fE`*rNE0BWzd zbffTxkZwj<6Yi_~+KRKl>qr=vcMN*O;QEkRZ(9B6u3xORv*Bh<+JR({aq(5QrzCw9 z)_{ht3I2`z#!FTM_$$c+_xZa)*4s=^%2eMke`>H@(ip);qeIe5>|3&!gD+I|%+&ex zL*%F#!vA6H9fEXW!YYN^cVL=cl6*NbWU@c8IiGa zKYNLv>!bMkyH}|j!{K-}HdR5|7zjX%@n1Ha-eN79d$cEb*FB4v`;MHl-#}hCAz8+8 z(WJK6>9L@Ai#)`BIA`YfMQGskq)o>Azngo^o-r^FKBl*#u~?`0p1QNPW>?^ZBx`DX zVn<_W6LmeYMe3_ZEbr`vNKaiPFWq;(KA5Lo2)P>c_TPNAv6+{jOevQLLQ;Z2gQ#d^ zI>_TBl4*xuaT=x83EjsTS6tCtR^#-|5%Rw{fb@jG0Xvext8c9l^wgLK$xw7b&K3F@-02L$uO#-q&QDz&I#Aan$RzT;v#_lL zVVSY67KbNIIAZ2uIiWe_@u--l4oph)XS|{Jc$<;k#b>!$6eC?Kv-=S2o5pK#IL9DX zrBM>bY@jKXQoCMUaW_f0(Os%x_r8rdJtohxjXR%B?AiT#H)eWL|KNzir&iTHFPKKz zJ!Rxd+hguT4`^bReM-Tl?_Il3 z4?$otmHm_{U_=apZH1tM2eKj;;?zC1g6+03x1S#Vt4;Ny?YXu{qKGBFZCkzWs9A9{)V)fNmAMpNe0uwsp6jde|Z zU|2Rcn0bLfm=+eWIrH zZ?~+WY>%0TUyXB<%zcSvHolszE`$Rn-#Iw_;B9|vd>hP>`Z)Umi+>5c7gf=yh5@@$ zs`8~Y8zYLA+mnN)q+ZAa2XD6~Dsw~!dOfabhN`^SME!@;;Zwq+a)z}mR8Uh4QWQj#{TEidCNCbbzd@-MnC_WeC?j=~((~KB^RJ$0V=qLsIL2a#0Fy|!$|wr&_VD_ynv#L;-9Rx{FEWkE=k^r- zvIRn40(pH{Bdp^r{CyT%J3kqz>_V5^BP|djLkrCp>-c1H3*Fs}FSAWKl+MCcRNA(R zP+{pNsc8#pq_3)L><$R4hEZvaZww5J4TY^nAHOHB% z?HlP{6`vvbyP?cQ2@_|k>!s;=w5D5UcHgZu(;}bz=XOj*8=Fd;23 zOLwxcz;`vZY%Q;j#7(BLy4rwc)knLiY2xO&1De4Ei?YqMMMVGnj7=E~{4*C95>SUD z`E|~rhfx#9I1*kJt5I=gDdYt0We*xh02_80-BPfARWN(I1QUeJLBo;`Kt^OyX_sYc}7on0HlYy&~NSweJb>JEwft7NaW-_RX4E=FmD#r>e8*V zoDFN_<1Em_tFJS|WbkrbubMsd;Z$@MlFtd53x_x~-KbG!iP0-8O_+d*FM&!z>|YOi zFk5q3IwE~1PJ8~>!QT*Dn*{%#^Ut!;gsh~$$w_76YSdz%>3gB#@a$Q@7aVTm#+pxa zBZ5x*RUP3e>Y8eH7LsaoEU|PU_RkA~3w@Sjpl#{ht>+>F4AU?g1|+Mnzx)s8TLI;r zaW^87?L-p2pXp!2nF9^<9K9VQ8WHOV;h3vl!t^^0Os9#n1bk%a*<49U(kCX5OM3*v zfXq_{D!uvITe73x6ao+e)|5tigl+^c=k`A042E#+`W~jXIvTz?>e8n=+mZ(!;WRC3 zu9Z=RQizdL`g>*Ki z3Kc@0GPHN|NhsW|Ftn*#+(M1TSHI{~AIwQM`2gc1t~alEn>nH;V6r%1jfP%ue+P|PgEJAY`+!_qCPDf%)_BC_>^M}^Ixa@ugFQgFy-{n{KC?6a!KT|GT zG=NM~Z0a7GO!q_2tFMk^W^#W?bIzqK&CeZ;>%mkw?;>X*Yzx76cjBb)cAcDo-sDMi z!%R(BuJ_Fz)}mBU<&_G7iqggSpzP6)ugiWJ`4rp0D!mkW9p$ZTH4AlodGM9rnbQ43 zbDsa;xqe=ur9mhb7g~Toc^rtG7Otr9gJoggAnd1d%v|o8@Cu2KQ0Xt;lKby#N2RN16{zFJ}OO|ghPPa?vXzFICqyVHdp+th`F0t`!s zd>r^&3cP*K{)z`biu%@s1iVgc!&3)3_wDOd(|o_2ap4#Ycm$-5j#D+_#wp0C4$T8~ z#ysR|tGZ$pu*}JUcX10#Dsw9Vd)t>x%AMqSkc%jFOTY_sKcE>L)&e?d5+L5f>x8@R zk)iqi?$X(^3+8=NZ&P*i>}%&)+w_-IBpZ9Vth--pp~w0#V~@Tmd(f}P&T^vgBQl~P|!K1T7R(zcat4KN|}&-MSl?&#j}v#kznCO61H9}R~r zN*m0##e3vGvtjF;58IYH$=Ye4<49zb|7m7>eqoE>1Q1?yIhceTe5o&3;sELjQLJJ| zy(9Fj&s%0f9uXGC19}|vWoBMQiTBoY{0`5=)xr3^$VyjwI7jG>M<$d_|0}SN*Y((P z##zzsp$N41?4dc88pB=XUUC<=Ld?6wFzK3Z#h0;YhN4&}jjT6078Z^r{fiu>iWAeYq6;`^+9ZEU(%byA!#&pz z?%-Z($eRS(u2yxDBN4 zL<-*d=^S^Eb@iyy`_VGUG=1F4d0+c31qEOzk>ac;9?=enYG<TRQ^HYJK&KDzGx1U{M|9ar zqi6CU_K^cYLXkgQ5J)L|$#^<$6U-Es?*36ho?TA01ztq;6h{9;k2Rz!WZ*qquv@KjpeLVjX30k&7K{QU$?w)m|Tj2dE?;-Cw%bV1mC2wSX0&Az`0Q$T2)#!D3%$)&&$Zm zgC*0O8(e-}_mlO{H+~)maQkc=AqA;iJ?CR^5yaB5w)Z@xe-#tw?khI6=ga&u6%U6y zB?yHM{i29E$5jq%K6Y}!@@8C8QAs5sC1)`W3IT>01_ul_a zqL`RiIT-&x6a~W|Ze{Cg=1j;SZfoRfCTeElU}^@#&ky6`>TG6Y2jjWn=WeEoyVXQ? zb0aT;yoKGqcSGM_>V!=p7%1rI@&7L=N00V#kJ~9977z33`etc&wd>|f3BN)`WiwRv zRu%}UwZFMoe`N*r19PGyODhwrkk%rVrnm8*w&xeHjw&o|P0sf~K!7qeH8~S|eUbi4 zcysA&{2h+T5$XmaL_ok1{9_7YxDNuP<+;A@$))*2UKyxMm;3WdY9H7T%>@Jn)^K;% zP6#1l8mQ zjsc1zbdf0sxcrp`o{1ALBh(?0unEjv|LwwF*o`YoBcA~}1W+;}KMLrU_M5u{0SM5jG-O9%?<%&1t67vZ;p;F!P_3fGlFLlG107X>0|{0u@Y4UBNS% zzb#~-F>r9eNj3p;zZBmAA;4eljDf$EQ@^1sO|30Xzq^UQK)*Pz`R`c;0gs80ncAIe zKNhMR>tiDeqL{Y!pdgGOe`Rfd-F3L7G&}#wrqbrh(f(ZAc?kR*t3zf7;o8ym6O!>z zOa`yk^1uN8?WU~>{AGUrF@bk#h|H}dTf;55_|o7Z zky!k7{?d>_LgHyBh!Io=BB6nW3`7}&+cP?T`4E`M=-}iI>YMr9=m6;crrVjnzbXh3 zawI@6Ocdop=L6J~O$;O3J$GEGXz@xSyi{6*^k0#!U7nfB55Cin5Y1Xhz&n#BnmDyl6|$ z;PN-toe*q_Ay@$=3B+usy&FzSy}^cG)!&6w0hR7wD>S<-UzeFNk}w(>!(Y`xF}Gy* zDdPas!D>;%4q_)(gh<@<2;B6XVzC=d=CEBjKfQ4=T=msOqGqB-?6HcT83Gv$N*SJr zmQ=Yco@%|47>wRAivw&alI9)@1XXYfhI?eU?M}7zq@;@jlRZw zQdHznkNtPvYLNB6B{>ep{TV)YUDs%E0tyh;$deawSX`H+b z{{c>i?yYR}b{k3_y2h9c2;@l(JFHb0SMe|sh&**&*;23WTk@Z8s3JZv)zmO><~nTW zb#t8Unma||9e&Nl8s+h$;kE>!qD$e=&^5jMXUU|FyT62T$UUMW>qD1b-1)cg$jO}x zvmp=E(-T4;b`T%)WY92cIoorap8&F34q^CwbE~1Kc1>q>-4Ip5u8sxp=w#)$kmfas z@R`Z`r~f>P4Cx{XOx5{0YHVUy-H()7TIP`GqpGz#T9Xe6my=MNMGsc$?Nsf0_0?(%s2suK zySw&UJBdEM5vE|}@FhTu)eM8eX;{HZ&x+$b7O!MGoXFva>tAD0t025%I~4({-fb3Q_))eKXEIajpNl%W2jpZDa>S(`Kw8>+go`|m_+j-twBh)<$t-RhkM zF=V*M1yEd5x}_O+IgK~x+w|imba85b2**}PW%cqzmMC{*iA(F|EmBdP?#6ZqbK!WS zX`#W@eCLvJy`4<{*_7P-ho}qrfpz^u>5B-U;Y|1(LwhNx=XP2Z)?2Btd~!TM;F!s> z{Fh_3{y)WAp7j~qhEt36f6eW-iDbejAGhnglgBB8TpRmeQ|jH_>m7OOHqZ@H)wP|44UfCd z#;%jgWW{|%$2)Nk>lxh%;~8#!vxm9_4u{RS5v2DXWva-1ag8D{hA3<((s!^qb52QO zv{22qN-`qvjXP6o4urOO!;^R}nEie@0y+hQNzQ#4vx{zZ)c!Xc(F%hgH*^ z4C+B8h;$@F=mP-1C!ppXUG}=R5KhG5GB?EQY_zh9%GqS3}JC zx<|PYbv*jKpsbWImPAz_^)Y@;rW}CpQtro>A0is!h%u@+_fJ<6s>fSMRHNaTD zEZLIx5izE)b)u>=l|xQd!x*7!42YCyF3#M?Kujk6L(Pgpr)%B6|77IbG<1(l&g{s& z68qn%xBg9&p>-7`o)HXX%uyKg=`VRs{sYekVSX@A>UCN=O;{6`K5tQF{dQ0hP211kmxeoI93Rs_v875;)qLc`` z^iHQe5P<%1RjRxWNJzy$%ANau}J;buLyLBQZg9$1IA)c<@sJ z9yF&+;11_Uel?eVfhSlT`Qa8G#=B!y_H55_`oL*N-z(Ie3vGM0bvucD7-En);te3b z7^MWojj(Sd(wmqA^$XHQIE_shdKp*yU!^TEi!h8dlopyb5f+gxl96MGa6a4sKGf>= zH3YYD{3;QB&TGIQc<5=27!BCSW6rJCN(!UwcYUwU2O~9TO6CM~d70Q0fM%J=WbXIM zxiF0zz3RnH#DR<;6Or4MU;iOqdiFCK!b%+AZKDjH_IQG-aSks01b4Od98%}gh zfrQ8&c01ccCfF0{OqwrSWj|lCd}0sWR45s=g2wVCR%qRMndj`pe76pW_D7{ysqflO|Pi6HhC1HX1ai&7AZ z>_#7+9@%^nZW{lBWgy?asQaHwec?SKk-yGqRlSsr)X)Jc!#p3d2dCR*ZQ$`2g-+F$ z2Xg9C(#m9mj%-C%7Hzg$Yi%&Ve$yW42U*yQi?>*;SI?$tCA8PnrAeFo+AIl}8A|~O z#ZxEFwZOR-1*M{TuEbgc^i4snm?3(X;wYGLF(hZ3pOezFSPUz?SeUhaYDtrZ`ef%; zyKo20hQGncguF?>kgT%B2O9z7t(#bwo0B!FJDnEzGLWLOa0^xO+CL_R*e&a>yHOiT zcK+|nY{2^-@j8ms(^dgNrzbIWq$azqr3v{O4TW4p0j2C8OT*;l+P#bV%3~-Tgc8mc`7U|6H z_2w%0z-W-sMUe}7Zxo)vx)Oqq_G^>?<)wLGb6BO4$?w2hw2ZZ$U6&HmgEq#zgtsh&j zIz(Fx$*(N{KMJXmS*-@94BnUokt=g|4{qUoHJg5M1h-iwGU)ML`7Lm|u6*PqCz=Gw z#g0vayRNIO9;f(tg06FWosk`YV*{Mww07Q~Fa26>_fn!9(fHVv&_9gm?5~SWDrsZ8 z=T+KpHy8$);0xb5H`*BV-Y=M|qOBWIVHbOUf2}0``lntKs6o&YCu{gun=6$3z32@e z?0!b9cgc^4vb@v}?LKM-nU@?j^>aPBmiR^`A36I+23DWGiiFN;+`h^m;TC2m=G^{C zyU`@BgOp1pkk+n0_l8B)qU~Vb++7d*fFtGfIo{w51U69^Nm?Hwrn5MUDLLelw(idZ zX3Dw}uh}~-@v(p+WV&K_Y1^-=gC4h43@&6{(U(xtBSm9Aw6N(%(zCuf_Pg#QT&9P; zZK1x4PzM^B1WX6U27hDAo~R`CDlYi-wVR336hmr$POWg{^TrNrvW%+gPaB6q+>0a zKTdySS1mtIF8w0nURoYP{m@37s3-$Sx^g`gat~%!9;u8z_CoriH z5A0$ovf|!T!A}INo-|tlQ(G%X=sH?g1fnE&A|;q|`IjvI&`&Ttg*nd);s1W21CuB- z8fhD~TT+9`5s@-NI;69U5-=)sY&Z;(P5Lc}{*#8|x6Lf6j=-zj?cHk8e3LeR;}5DJ zUsPHB8~pIJJwx`yu@-7JY55jM zpmJ)f^QYRvZ)Q$v>YlD$XsiSGfyeSCVwxV)1tV!m(`i7~GkajsZQiezj!f&vl)Ik$ z5ZC@sY|0t#sq?#Hlg<*qf0vr`pcd@>JR zk}XyPX2eE@Xi51;$wLyQE>+Y24~&>8eG!F2NB#J}lRta=v-TmQ=3gSK2XTNa$S2_d zRb?*XI^Ee)QyS$mycJ#nVP^Ym)dIK#YI!^tQ^2`h!gY4=H#`6h zGA=Vd5kl>2_?VZ7vc=S%(9g8Zyn(s5KWg0oAw_DF``CF-35)}?=z)E#IyQ1gdGv}T zgKOR6CAf`Mu^X#bjK#DD1Ir)htD_`w9jDgJsv&1i4DVbtp#;Th%`1h^apD;sRe!zu zytsyLAN+jhMSU#6*9ZfVD6-W{zP&(fJwau}1Ju;lI63xgx1qx>ji_4j&0$@r%VHUW z#UQ6L(0q+XzAtv#bIVEq`HI~tfYUx?;XfZAFPj2v4*(+yZ(3iLy_6gD*^2WT^i^8@ z6C;NxOG%4ahu^E!&w)xd?_l_1j9waYXvl#Hrrp8XIygBzCEtgRh0fd-(6nwT;(I=5 zBoaU>Y-PQ#jeT1b&|b=wP8l6Wd10I;kSpFIZr&C{s^Q{q3tH8_qiI6iy;TD7HoEOp zkcuotM(=OfgXm3w?RxI24`8Rce0~@FJHat(y-9Xk7|zi7f$4q2&^v#&mpn4jVxz;v zzDIV^<(oW@T-x+Sebi+Y{)a891bi50)xJ2ZXL_b}M_FT7tAJtCla%W?=Yv`+gdQL8 zD2vhgSt27R?D13ZM+Z3CCCauC z15pjzcO2~ia`Mp!_z)BLTI*<1QZwNzgG_}>D%`_()#3w*1mK$Q<5%9)b`UeCayuzv zMQ|oX+IwGrkyzagqd#5GRLKX^7zJHK1`>cjkAq26@{hzbzmUBLTjRb>e_{D_TjP~%u)b>V+w;@v5jR;oA_+r0Jl zTrcqP*q`>`wU9*?9C}fzewyNKRpkh$DlN!m=qw98AkQRFw3|v2nN|v=c?FMg6NJ4e zz0;+sndj6gIDIv+uugIGD9ct>{BUH_5(H|rU^8Y*(yQf9O*xcw;{?(hYRt+XIyH>&+p_K7x0n6f`= zC?Iyg10*)@?MITo;xMm=`{r|AJs|k2Q@{lk*uBb*XW7b8?n=poK=Q>X8@>^VYQbK> zna;UD;s4J{+(lcC2K+3{yKrNZ&Ju3t*J2V%EdA6{wviy3Z@pN z3wK1PTDqCFvSQ~aB~XxiHTzX#aMWymy~%qw<(j`&jl|%s83C6^e=9uJN$RSEH4m7b z3KBmhe{L4akHMIz3fSTx-%g%;S*r0iB! z=dI%{Yo!IGAtO`IxLY~iR_C9|1S3e^$0+};{^nZ191!4b8pvzf?KPlKT-c+?;fb$n zbRvM7du^K8;XT(N+F(6U(n`%R>vuelkR#r>-z8d7Ui{rPnTn;5CBIB|LRmX2z9V=u zRbsI~VUKD@O`v9P!WvgSAi{d?vt4u4y=VPi9V(g!p>+3YuAs^vFT~Q&+du?K>1NAw z1_#L-T+}QkSj(Rp{4<1OM=i)+OxPi);jaA;K3*-(P%_Q*E|frJ*pqEhU`q1BAPw(b z2J3VM7CEnv@5Zv-Bk{iF6v*>(Wu$q9}(N^dSWE#PTpU=k=%!dT_$6 zCgM3M2nO$8H|hAYdZIR%N=7PDIFsmIfZ-HrQ{cX)qXCtLexwN#t_AU6Dn|3WHU5P$ zi8ETEWvb~#Vvx~D%p0UqWE@dqe>dfp;W@^CQ}@%;FtWP2?SFTznaakm9T?)xAx2o^ z$jfgeu!h1s2Sd6w)TK1Kmf4paSpq&HoPcQorUq=dodXa+2|$R zX=GhqWpigX(AL`{Jn+|wSC(NU+f-ktH+bxgxm@{8c_53~GzJWF3UIU^f@!l)w_)aF{6Z)VB8>qx&Hx zIHD9KyL>V#o7igr)h|tg-kOYe96RZJRhjreUJgIBoeU*E2qW2ba7H}?R3FVH3SzDD z7`A;Kd4^J`WWZ|OhXwc9Xe;&MOUnx+2kkF4cuCcV)^^WqG@KoktT0AIXfyxdt5s%Y zF?0x+;_4u zr-sf9PM%HoX9{Fa8&?t9>A$cK$MXSvufw=}CHrl~dBkSKmwMf{j}$F=w3D3+8{THo zUv*@(5ohVz*=rAOe%ClsOM^z)x#61|f!m$-AwJSjh!`cCe3)LGw_)yCiCltc@L_4+#dPjsly)fTI;lsu_y$+#`?4)s!3! z`GHfRbK%^RFdF)%PLv#yI+!PfuJzy8sWjtN1k{1dYSj4jP3a;ejeC7CVZZB-c1|ZZ znOpm4X2`U-IhC+rTuSM>8lJkiKg{DP-_)AlA{MTWS;Wt{$2*unCJ7Ii|J8vuoy4^y z89zVebb>n)23sf#)3b=w>6(AXJ>HGgdwHblr#NE*%Vt7d!+E57{SC>qkm7Yw`LAS! zw`ugD@ny8-Y{%E+Y_>>Ew1NQl8%5u6N}Vu=b;W(w({B6l+tXbZF*=hEt3R5RLKF5; z)W}UyLY)kh;xV|-sOj5R*Tw_Y8W%;#%OZ%6EaGFx2+T(@X%1q?j*-ARkZHYMA}H&^ zwrvK+7S`9|ZpmPUYwO`-qotA($&0RU&{Io42uWM6klNDBfQv&%gwC`-jP#&r09RF< zyB#TA>OJNM4qw;ebs}h2J;-gFL~k8IfBRHr)P6CdIX4&}9?~f>$gc=6djL<~GJlvv2zpEJfJwI!|w(i0Me?K*( z6g`FqTtT)#eSoUc!Is9@%Otb6P{hy>Ld>cBaA(|NQEi1#RqG4tVF(!H)%@J zm*@7&8;X5+V{;<-E>v>+HPa$Xdo)jVlq8gMh&JL^AYzP_RGPL7&T4Lu|9Fq)T+97H zo7&8Jb+CH+$u%*VX{`FQsK*x`fGpDRwUjN~HPnZ%e1jCy3}7n{^kE-Mfy_uSdpRF0 z>z>W-I>0k(vX3&?Sp4cUMpab|rU@Yl*LnygY#NzEfvI%`I@hKye){8vd&I_nCySBu z5h+l>!@Qfjv@yhSo>Szx$Kr3vpFs4BOReGYKQ=#{5B@n5&PkW)<=+cdHIIszH6aDY?HP0{Fe!3{w6B$Y7Ny z9zvFG4Fk%Q^UhXGC$SHV+*8#zkxK0*aOeZWeB@MEkW=nx<0_?jiKh25rUOeN+F>CTJ+kc|2B z{7|lWsdMT=F&_A@O#CKw^8(`<0Nb2L0aIF12_sPv0BHAw>!Qg0$!s2nz_#^hmK;&an`ksiS zyF|T=1vSy}Tl!bte$#r)v=?*Qo&zUrd`X#=V9l}`N2f+si@OZJ!7^rPA(a_BD<3y2 zyLXQZoW9Q(rD6nTo`Y|5@wgVKY;lg!tw*5w$YJnLiE`_rzP)ratKx+5!F! z!C&PrMY_oG?3mkOWNlwn2wx9<-kF;P!m}2SVoQfXdxNZdXa+zU7Vo9#z$dDH)OoVT zQR}um^m_XtAP)t1Yf&mU0EN-0tpqR)ftzvtf4Y3nSp=I;fXRv?)@Ak6QeU&>>$??`!$XxY@C zJBjuAOy0A^mUOf92=#9yd{%^4Klm3o75?O>SX=U4nHcA2Z1*@OB070>_pkx{Cq)0n zQV=B6xdMir6#`KMCvUL{JmfK$uh>G- zL`Z>?r|FJXbNKYQ@)qGX96k!3*u~bbNFor;zRn4R$(e;4(#d|a&dO; z2e3v?jgF-27#Vdi!`R~m5Jm%8)+7rg-qtgMIrxRJ9K~iYhbDN2TJvl>z@I4Is$m4Z zZ>6;lGx)*Q1iOU&T|g>>4z2CNIvph+zBCW|`#O*iVZQ7}9TAsKt2Vp0k>c&g*n{&E zP24_-Xf-+J1*@b@e1=%4r`QfKIcVq!swR?&if(AFV3z3iM(!2M{ov2aN< z%aCKEZnKUS8IuxP(nUq3IL<^jDRo%oT~qAa822l`mBm+f*1uv&Ap>U?dZ#th=;;R6 zOf6b1<16N}a(SB>ZMq`Z&g@KVYd|;hA*V&uy2A+D?!s3xUmw<1@eT~vr4KcHJGSVY zl}X?agA}BCEt1!O65_ax1V_brnHbz`D)~>fGB3NH|1DMTpe)dQ59%f@RRd!fL45e2j8X%DgrN;1!Fkt z%2l!d)6{0nW()=KRwWbr5s^=4erulGVru*_aVpii3hU_NObR@Q%birGIjqCx=PhLR=+!4I4 zgxiU{YJv^!1Sv3R+d-jQSBc|&3bwJ!nuJcw?TRN{c7^GqttknPMBAaCgaJXrsWqET zx-x>XY$#0Fb~vAh?q2%Tdt03;OB|$#9OVXG!7|JDvr)Zz?FJJ!& zC@3Ym25bMF#ytml^~*R(YHz_3yfvxQE5FI4((6k^R40WBPVyg%a2p1vGVIipO8G#w z)%ndm()8dB$RT*DcD--LNyEX8YvSIJzn8FjL*?bu!% zrp3n#YtuZ5XHOD}w8SHDl~z4 z|5QU_$t{(?GMw;0vDWBr=0>jssE~rDS>C#`JpYKSD#WuA8azf@EnGg;)WH-cEzQC* ztOYK}oi88a43S(bLZSF|zJd zkCBceC5u?$&lnpAgV(DkDpY78MNM49o_@G&0$ABpZM<#DpZ^}!VHVGydzQjBDrjnh z#h?ACqK!O+WVm>JG@V3IUJv2S*P6gEOTusIN=THmSv^|6T`x(J44%kbRG8)87 z|G4`X_z2&;8LN})f!ik6WRB`>X$bHYRv@+XzkRZ&9N>lFROX4occh8QAs1z%(S|k2 zi=7C$*C5rCiqzN|GuAXdHFaxD!Bc#;3Op3N{;A()(H2|hM#{Oj*jhAD zeiad;00{0Zxz(ix3#JjZ-39>VRtkUok1^{1N$}3e@qZ@xnF*PgnVDJs#~3v;CkNC2 zV~pC(!%P)#yN&FoUk~Bt23t3{>k=5=*)e_Z<_3|lANuA79yq8A!lQl0!vV0m-QFef zUD;zh^KYe!$z3VAx`HKIi!%eb6tAyt>WcOXB#^=Wgb-H6O{D?0IV_!IZV>AT#ucKW zxuNl%P)S9G6I4!52;NXiMWX;HFgHIRg%Fw*vf&bEh2s^MQIG1k@oDh=T0=Ochv+1k$Yyf0$@6h7l z;Em#8HwK6hBao^O%M#rAT?Wb$*wKx>6=)-ydlLkg_IGzV;fGi|a7qu@JfOKxvgS7; z1yqL{=H{AE@mSL=%WEQ8N`+SLj3#C^sayIGtr| zVgpUkLjE_N@#Pn14b>KSu5{k)qaEKyLqh^sT^#`d0eu_r-y7Qn(kCz@7f?J_xxBM%B9OTUaaJwD&%We}y7dYci$f!8n5B@Z3 z4wSLJzV4XA&puoIArW4aJ zaHqgUY!|WzCca9e%qNVn2#0I4P*N^@PPh|;(~*g;{bQ&&nQWKNc{NOp3i12!6TG^S z|B1T2Rmn>mfN_(Ve)$VHa&V13*pn^%n^At+@F?+w`p*RJkOkm74pYtB#$=G0r^BD> z!R3B06Q-zif&z%c&sX2>%w^*Z3|5omnw4YWYfB7D)rIBltD^U#_1^r=O9E@=$GdVs ziJKef@IIc~4|~@QQB3%Q1G@l9O{AMx|Ca?H4U?giVJSsX#}4N80r%p}gM?=T zj%|~yegC#3(ff^8-}|WBbw-w_JH)FusQ?xm5kZbTZ0Af| z#wC+sBO@NZwObaY9(nC(+SL<@fTK&m7j}`0@x&|Ib94!JOje*v6ECUi2R(;#syC#* zynlZ+Q#i+0vFZ)@Mj1=0k&kS0Be*o>V@1tJrx-#-qSov&IU(Fi&Sm~u7RvSFNX^xV z^z9v$;cgY|=3Hmoh(+<(<30FY>~CQz9~r;4*Zgt#HKgT)53Wy+lq&fKAyDRd;7szJr)Tf z?@h*nlKuG=^^Jeyd#L6`d_E?1|$Mrm8r!d(^hT0Sd>w-piBC&I(o-=XiG0`t@*{B z*EQnI*T(eb{h`+Wtr7tc*F&+wz`-aHz4)^=fmr86wx2EiI9_Vl(u=P2@jzO5-Ezof0j)x#W>0h1`0wxrOgtteNxIy!)GQILj#*Zr;bU@8JLV7 zTgTtp_iL0|)I5e`pih-rc`112L4O7fFB1-fj%c6PJd^*Dt`Mnq`T;}EkKX@DhfYT7 z6WN+Gfx-FdUwWGX&PWcyQIJNqQWN{v398tm{7pHI<1*+2u&|z_-BC@#lG4Du&za3; zbH;UD#@TofzzQaBgL~6)0JDzho0#S-DD+cLYWNH^c=jTcmis>5Qj;|B$gJZ1W+X=a z^;XfGu>H~$^}OOMhu9bMi2vi>Np#YbX#Q6MM7Wdqk{vU^wj>y??2#<>i>kc+U&&=ACwsD#5tckaEe$7e|b65#Nd zpP2V(Ajs`UvO2Tbrk03#SDm(pAklAxh5>Xk`_G@yR2j5M5mwje{!#1L5XBAaUmrI3 z**Y+pgx+!xeCHNe%*RRq5?bqzfqM2llT_AWFv6Pbdf{UX0GGzyvW?S=Mffv}`?7LdY-h%K8kq^tLbox8d4t!I(p)V zjZZmw$Vs#|5?`r1C=N3(RYL&=ut3!3<>KwiVs3oCZub!oc}Du{O5){jf;eIT(`+id zQlGr5b!5x_m<|FrPYcz?>QooUcDmOW-a53%u|FxY@&|2WX97|wSkL}YzvEicKOjVs z+#g*~z!X&c3Ko^XtW6N%KmunAlVZvpqjI`;!l?_>nEQRtH7R1e2?yECH{;J{nzol2 zed|k;+eTKFn$+v^=kXInw_z~J5D6kXnX%2xDLoOFY8eOm8xKKdEd&=laXp}#d4VaG z)Cpzt^L#kWQHh1BXT$JpU4V|GzS!axJ{+Alqh4Lt^@_nwomu`F+rzI^JVI1;{!f{~ zjwtPBQseH>kw~6g_o41)WF2%RQN0@9W3>}C%`)r*8q|iYWmT) z`lV@`uL85(N8wV8ZsKH(ULiD~avoT9=m60%SJ?!XDE-*;|C)V*>wng!I$-s>X(P)TB zkS|9;^KGKw$a{szpC)S(%5Mv7xK!JcG-8w_tmxj&K2!v3CAf!_}D3^v6zZk5&v&HWW zRMDArC@W<7=MW^I$At=T^Z#|WwfUNbs-04sR3-Q%H;jzFyGP}7P_-tNM-${55wsoG z8+8$@y8(%tW&uq!Nuooj{;g$+rXUaf|mQW!~Z!+Xv^hYwf@C}R7TlAZb?7%QSIysjb@x#)bzNKSn@fq9TmsAksFvJPGolp zzI|hvC_CxyI?1}LbcwG3L;R;XHpuHwagBmBhVk=&teBwK735y<6pVc|R(+t}Ff|t% zNiSdiOZW8hMhrHx-O}9Ho9ZmMh4mSl`Dsz2wc~xeN}T1*GO}T@OhZPQFB@U~WiQN& z;`0&h*5xOE*q5-ux!f}Gf=!0R;qw09h-qbs1BK~1((lvgi7JY6Jmz_I|NLU8G;3RO|Zjx%Fnn5W|{d|M$t$b<4isRyF%yC z#)89BGl&s2L=Xyid+Bl%jUs@0zYzoE%24oW9g8tYP7B^AE@^4$D zza-F++*3zJJs_}pUE+h)7`$(HTt^VoGGqPvKCh#_g`rS7sN+y1ARog_``setu{-#uf_;^Uh3UZ`G9|3mE+zBP|2WlOO2%@U72_2@VLb1if^V`tQC2in*O) zI->TrOQR`_NBpQI^~@`8`f%=~>*FSbMse}AV~{-G+NoELoc9ywcCIr+m5HGfITU>6 zpcV?L8BX__B$+3N7OJc6)ZS^q%rRc*9WO0T0@nsj3$;{GV1iUdTSe{>q2J;|524wO zW$0`CAuzc|69F>dp=Z|P)W=rs?-{WWL(T&?4XA16oOD&u@v8C z#f!c>Yv%bF84I-J3Y58|XD?9HFj~5VJ$Hp*76&J@jK**81gG|dqE{OPnc1V1e=?$=bNQAV)%-q?SI8n5FeZK!kpdlJp~h_ias z^#MkMgeF3ouPnv(tqfl6BW{VV-_p}Yr)XM4b~}6HQD+^xj;L0@D3(_O&zy=cb+~YG z)sVjjJyodgrAi6Pb(Pj@HkWONZZ&AJPq#gJo3GG@IShe1-$I7RYhg=DTWR^JgR)*G zaN@TvOz51R&^99XIppS3wlT?vQ(OH@Y-8&cel&Z`eKJ)@n#K!33rY4~WZFYiGQA&% zT;Srqn>tKTnE*F3p6)xF%Sjlv!lBZ|%@=2~$RRB0Gw~RH8bKsVv%8vQ`R__DeqKbE z@}Q0Dqm)|lbPaP~*uOH45PDnLX@JE}gFlQsu(B@j9ymyP-3sUY#00U8T!6Y2) zqyrzhM_Frr6299B-I1Cd2_jvolPP8ailVbIiQf!7TaeB~WzL9Wdw04^xb!ebfw%o+#k}(R| zF0x$72~S@4WB9Xvr1iAY?OLla`0SV`BeAJU2Pu3TJ`9uvIuAa)_T1fRp;N=Z6+$5X z1^f00c0@?KZgt$Z0O}zO-Khy4bvK}jB7NsQiRsEMkQ4`6@FO|DG;Mw@q6591q#or8 zY%(Xzv&98Xq+k^+}gtq5cT8e8d6SyD}}^saLR zR-Lpcwqfh?%CY1|A!9cw;p_)cTBo%cWD|>+QqpV^Wewl%u%(@ckv}NR`a^Ocw zx|xp$ckvyl>VWc0I{0q-!U1+)Il9h=CT(dJV$U&<#vix`= zBA&@2d^usPMl6W6hn@sTIWMK9`zG*Ui5r}f82sTmTJp#hV6ewJ3rZv_W89Iu7_^LX zNZcM?#WzueBvi$T@1i1vWNvq-!i`*LF+CS1X1Yxb6oGERM)UTrDqLmzu^AcT8vY@=hGi$U6e@CO5t66LD_7dGknq4Atn8 z*7cAZ6?dNb)Zru5wCuy;iFM~ULdUQUABxXHfp1-?P|;wR<YomLJ*0yOx5vz0M|IOORw}jRx}UBCx7thRP?{F@wI}ug4Yqa=zj1V|H@?I7y>-OK!w$h5BV;*BB$ zwgfso8OB&kpovmMyR{dXNde&`#BdSxO5~marzD6S_-X=1}{aM zMBpvYO@)1jtwZ=@eE*Tw7N#{&ttJs(1)M3K;@(zMQ{U-atXEZEgTcH%#47^JYt%c3 zuHPBs+^|>!%@AwfkyHZ6<8=LuYK6*T$_3klk-vlz4-@%uEu^T*yE#z&bf=LNs2!%s z(r_`gArZUO`H)%>@!?{HTH_(05V5~RPWVAwIyxP&TYJZ__M$5;emZN6^=SYzrQ0ky z5}^O+zF#NV93@Qi(%NPN!B6(zU|a$BWiIUT7Z@VA)TB$N+9eaTwk_{KgsMo{FN`+; zMD;DRT48OC#`>YDE0p`l&{`}iE5iAMeMqhKCKP6oWbz^O+c3D73HDsgR|yJILPY*d zN%tabf>-;%ZoH$D?ayh4rP3HmO4w`jAr@HNa!HFdZz8A-TgjVzz3msUz5u@`3hr8> zI&EBYa#*E;2nV~xTt7S&G0)a{%Abr1w5#z4ic%_hY0@Ej+m;Y=7*N;Z&DH423&6HK z!G|9dK?v&H)MKXN{odZ8&looHeCuBoY~P~?V!F7@hP;q^Lwt64I{i@p)4>uBCf=}o z8oNplkc0&6@y>Uj-~4qSRgGp^xoJxH-VpWq!hL^^OOf>=NL4?-pYBd?fLyv{F*nn2 z5Lvl_N5!uv05KuPM;JG0Rl_T8Ynt%`rT9)5!ZPsBp~Kv4{#Q!odxN}UApS*@qIdk7 zs|V3N9oR^`SDK#13t;1hH2GC{`#Iq6YZi|C*&*!}dH7Y>c$b{YXc8Kk$=4GIeK5g} ziLvp*(b-q8ssr3<>glf2pAKJ%x;!=t8LKBSyBP`@3OG|0vfu((HX%hPm7fnjVY2vj z##z%To;Eb*CE;#|YOH1pi)%SJFu`QNj#QM(JL!FR^;4095)Mh3hOx4drLDa&=IAlm z5!xP@;V^VA8fJh$_xaMJOj1@f2BO8RB0QX_olV!Xz%Q|ff!@Xa6zWbnI->t;Q}6Si zayZWK6FM(Go%|16rvXvxK!g3v^f|qk+B!9Lxej#ZYPZkB=-b@+$ep0KgZ{ko#E(yn z{h+W1=Y;wUIIR$-Jzuy4JcqB7&-1jN#e7gA{4?*xJ`uOyo+#!r z76bJX@xn-L6r3Yo-B7Q2b20L)E4yb9bfiwDf0=~01aH^(dE`2%@HUeq2F0DP*5IB= zqOgoy%2&S{2WHhP`-l5lD$bJ3V^d!hkg3N#MB@WAcPW^e)Q^!i_!#!2#VDt%zl>|(+FmJ*y5d^-+n83C#6)-HCT&}K zzzQ?v2!*H{U_~+zsVGXGyG<-kw!?HoxkG6PK!NZR zGa}NOZil`TqXXl41vJC|!{R$35t1-9KbphH@2r3{+m^-DTJ=HyL7|lJbjoUwfO2HK zuPckJEw4W4nq4E?hi<$#&P&D#J2+Mfo<6W!ew>vAp|4UHcQ)azXybRAdE0W3cZde< z0*q|YWXB|?qdo8+M^Nj3~}fZM{2*lC@I3nXOmjBL5r18z!SG;(dU zmmr@+#_#LJ`&;5gUif)+8=T^bV;q?`c>K&peL26?bBc4v(n{7EbHXP$3+k{~|Vwwu~r^ zh8|muLdD4LkF63r5SXplw=#dRtV1yd_O(W9Cq^!t#@!J>pk1?JTiKijq7K=`0^)W2kl}*=i4*qCP z&=G|3lz`ipu(-2M8}2}Xpb?bCyclLIT?C#TeTw*Zcv&@PpExKq8)fn~YKJa;W#&qf zL*2Yjz_)!#ug}Ja&__E5@G|e15wlBzN4l|OhH`>=b zBCK_8h)9?HX;B|0a^7ZNHr(DE3R2C>C<9i)uIQY^BTA0emZR*adAmY^;!rCa*#JR{ z;NFfCFh@Bt6)&odlR}h*Fjv;wc|cmu((gEVv5zg^IOb8?+=TDFMX^<;C$|eFJ(>;V zIfe}~(I)j%{cq2FHkhPI3|#Kk>&@xp$w$=0OVog8la@TpqhcpO1GI}-Se0hWSxPn* z=YY5Dr3h34)q0v-bNIEE0YGYF5QbtWYoK!$v_u!Gk8hoh_*TAxRVkP9&4(`j$ut4=3(lT*n|zV@lUmlbKmxJ{)d`T_ zFCb@rsNQs>nS5?H9IM2?`>rRQv{^HD{4U6VQ1HM~ z^D^oZw&^zUG)|4g)urJsaZ_z#;ZAhsGaID*a$zi%?}UBduzXiz|DITG_OE1#n>=FI zY|&`ulYUogTdeQssOC$k<5IWY@@wAZ`ITh;IN&@jed5PMQ*825Rw`Z|EoZ(B*EjdX z4FVS}MBmN4SCx(cT-gDg7+M}9ncA`$Z12%_u!p_l92Qc6&+TZG-|#eOUkU%Pf#Fd& z@@Dc-KJ6pf!mxUPoT6oM`BiW~-FGo^Uh}?*pl5;-oB*jHm|YEIN3~7IL*t15oTI`= z3a-nCWn79p*v4VTKk5@O7^FLJN1Glvz?SKmXll#?t9zGhFPSJhAO888-6eoe+I;6n zOkF7UcT2Lbxh_+hkD**5G}o;;C69a(=7rLdWe~II4xKa(`RXz_y&OXt|5)9f*85kx zb=n9A7qdtFvD0Y!2wRp^Hwt9|JUAcw#U*fjUM*2i%qJ@2SKIEoDAwZD@>X#Lss~YS z{$n==PzsSqofNHlqr((zl~{HML&5Qu7#Vzz&eWX3S(%$|N<9#bzGChqDKsVH-+4sm zFFI(c3rYw-b7HtHR-1ciZc`Xh$b)%Us8beoe4Fl9p__4^`Ze#HD0Lrrbm@^i?TjQ* zaL4!iE;Gzz91Xb0u$o*vM~ymnebQ#my>MsXYE$cuMOrUOP6^X(w~QOuv~SVlsd9eD z%D|Pt0aP{1$vz!%R!#8JR%)ji4IOI!N22Jll?cbWyGnMbegbE>b_v%U3I{Ah)NSO@hVYla$~3 zWE4ww(3Ou*PvQo5O=`rvf7>4b?4@IT(O~44Sx-Q;9eu990^~$E4Z4I@gJc}{*KC9$ zLBfdXG`<4|b-V$ckWj(KwB;+5Fi>iCYQGZe==6Iyt|&urCMcas!9pK1Fmid(>im-+ zo^b;N2_Ald-8n6VDOh2`s zj!p8PGwS3))K3596`TbvEEcpshYFSXqHkyNaIH3N`U_#Ol1zi|f5wV*uk44pD49%i zyqMfv3d|EHwD3Rw=pWp!mG}!GR^Bvq0Gm6mX9rX&w6RpK++}Pgc}A^rZ`oCFy9$HV z-%rskCWV!@mlfumiU$Zz;HR@mEZXrO+1tWN$ z#G!BP14xyV(Q1kMtWa1!-jiKf_e zJh5}#F!GBFI=GqL_eqRF>CO{vJ6NnGoph_9%O9{M&WE#~3k(6Sr9*-SFiiz>)}(<)Os)}jg*)~!8jOj?VR zw;IMin}Rpn#YGgf6o4d8`Q&wM2G|fY1=}t>tX(9((cqRA7}&!7)ywz%=@ z3ICECBDepmrQ-CA@6^>A7r-?s&QiD(_}g^IDaH*>(;azb2QnqqSA`nf(-o$s5M}I) z91!FEu`Zd~)Rrd=*jspd9`$C$2L}#m*TWBx-R1>B8Gisjhxixa^jzXaQ=elU(Xa$Q*wH?@Q zyN)Q#?t+KgqU8dT0>dsn6p0zP4bGl;p&8_&~q1^)81*9~13`5ZNJxYivq+7@;-w@rpV^0=O1P1m^u$w zuxE0upqhClJv=9o6cOiEke(i=Qxts&Qc=PEm0C8j`~w+S8lb_ngk@=B&XYjo~)%7HJ2ikvBY5n2ohvb&||YK4(zSE zvPR~q4j!=AHA>a>MF*F1qo%iO;VZSQv=-WXcSuZgtZI$=S5~7&=gLh9o3@7ggT`4P zLn$Y^VRWkjGndzQB`mIXf{Hl2+mzVNyvrgt;}ro~mgAk|-P)ACBNaQWuXaAE+&n(=g zI+^2jb&jcgx45TwEaqED#lW5Pt8J$-;OW&`1`S`GWy?ddrH_u!!)4s9`kcc=5f%_& zH`n4%Vm?wh?x1_$U%&RN|8CgZ`_UN%^nwqhy0Z(02iOfVE|va{3hk$nA36q{`$g{s zm1&DPNN6o*|EwLPbL(a-q6Vdxg4%7*NFC&0l64Gpt_Y3OycJAl!EqsuxvJ z?Ba6AFkBcEXzzz1W!&2~iLolHeM65`i)>-iC!iliK0)3`Dz0&35NtiaRfzxm{0TQO z&u!4(O24)lG8>TCJU5iZMoGPTP^VuRK>9VoqE@ z<`$QQz1kZXIC8kvXq8>*BulhNYkBPUu*vtJ`nWB!0E%DblLwE+?Ay^o<|$HfYLj#1 zbY_3;Wb|MSM(IJJ^?YRfpnvKhrU+MUqKJKF4{e-Q0oDZyQ^sFM8=Cz-Sw=S9Z*)YR6Ygs&B*~ZvO44AEeokLo-B$=42R{-5Bl?DUU!xZ_eQA6rF2Lpx z!j6|@_TADir-mG@`1D>Me;JiGq*i*IZ3ic?g(&Z@bq*#+m~(%{@rteu^g$XFKS*t`7Z^NDg;&G6=H zV~|C7Dr@#kMX;|g1VJ)-M`i!^w#ky7wt@Z`Nj&NEF^Jz zZINV5;(ro_{&^wVZm+`TAagWqsE&^O3xh0eWi>o|9mpGK@*35dEOMS8sq!m}>}yRx z%gS0rIuH7M)u77@ERWsqBIvPi1=grAfXIA#wIU5-V0U$b55+}dVWQ0%1MAZwK#UeM2u>zd ziD>4tOp)GTXF5CL8rI0+nk&jo?{QTIPn60QnSkiQ<<8-whO%BQsh7l^v(Qf z+V59`4atu+U4X9LW)t-uubuKtnqG_%x?+viUOtur>1Sgi%=)>HXI_@ump-lN6-G}N zFB7BHQkCvmueX!IF7Me-7<@R?n^)OEptq7N8QfK(Iv424x;4y56pu*Rk=%10ia~Ku z2!4%bj+Xu=?*@@%!feHQGkzvoZm8i?i5@-HTgTK<%xYf~3?vvP{4Cwi)uuy{W(Coo zUfc|5skJ_C;djRy*9xoGOrdgFUrB?H>Vg#&fttSI@03mAlQ5`&33#^rRa5^v5F@7b z;_bQL0ed@Hgi69`d_hT``qC*>SYvS08c&Xz` zx2@K}54Ff19B0Y%6`#>DZ5BT&@WFxoiqyC*#^`7FP$bGl_vG(}Fr}-RmR|~e^Jib_ zcX3vdGyoYbLAF%LI03Q`v78GPx)h}(6$f^1_8#$!!QbII8z+pq_ko)EX)dE;Enubb zG&wHr(o!i*TgOb9Gz7mK^B(|*f^W0VJ7(MWS!S7kOL0al z-H|uea*4nv^W>t0n9raxJ96?)SYuo(RAlNlpU|l^4}91S#V0(`DvR3PxINms2`Hmp zdBrS%7jZ6W!_6)y3KA->GvS-tip{jc)iV5(l}j>t0uf&bvq|#3RSnYZWaGlLi}a~o zS%*Qo@I!_Q-l+IY4jjo>Y>%zK0*w@WCXo6ymlM6@rdo8!>ZN6Pj>m(scnJKg1ynMR z7g5_C#msm4i~Igy?tCaMpnjGUc`Y4*GP~;)xE)S$Jw)?yPB{GTC7(SNJP>#I1;>pz zPQd29&J)^5B@}=8=A=Ega>r$72QoB45?7iB&Lma=b0s?(`If!5{b9vfcbW&Hj|zJIsEs&8*EZRulS%qIA4&WUC0#^j#oK=IYM5vqK!dLW8w}!YZq5 zlo^Si_fE9uTOBKz{pXA?=R5Z6AkeR5tW;0LH|(eOYgPSn*aB)lV^l3kdX$MG??yj7 zpSX>EgHNG7nA6Am3) zr|4M6_)1A;wBO)SD?DriNT&LoC3Et8{~q+hENJz{&3e*mzDZ*k%Vp~73yPr@AAznC zmS*vrN{x_tdYl`owVmH4w;|yQ^nDR{9QuR&Kl&?7tnB}n20+!z(TtEm!Pr{G)ef3L zo{)+0pAJCW%Gt&B-<0Y9xBv**I9UD{|DW*xF95jK-Ezj^X!Tvwcsi1m%ZT|bp=MJ{ zb+{jHz?+iC?fMdwY92<3RF$M|IJ=tD#@R7VLbhTmNb!=~AY9n7G&C{zXJzEF^DUt+ zvny|Qs~(;V9){*mHYd~2$LCTDLDafeo3=fYO_>i^qEg*xBq&=@V1_6kkp|G+mPkWT zFq}${4a@gbx~7)tYlw5boXVNGGFNX*YR<&=R7DTjl)q2D4Kw+a%P!*%1+5s89e zF3Qwaui}!FPac}Bx|-RMf(@vy+Pom!nu&N_Qu7{n4QQ~Zl>s$*z?+OmlZ+ASR1?zy z5zK1w3z{(SNx)*6ZHH5#RuX3(k8>1Ob+4AXp2WaZgE6vGMF+rluPqu>`W&F?KZa9-YHkB)g=*g6_jMlX_vmD+cj{h9j{}X`9ceX<=1(QAVU- zFOyMM2+7>3HbAo}8NyY~qbzUyw>Tf)qgtSo4o+^uXkb?j)or5`Q*xQ_v*73h=bMV8 zB-Tgoh(AhsS$t+`3C1S#7eho?gHb~D9(z2sYk4!7i|!7rkTo7`RFusk7Tiw|mK8t{<1NQ+GgeI94f&(Y!JgD5yYWo>!KvJjkJ!tK7i97gzQ9``(jT zpggWN_RRU)mhP%Q2a;AT4Qyx^3rtO7 z_KSo+JF3b$6LKR}t&8k0r8VoVhntZOGzB%ye4nirdoQ?~xguLGmH>FWxq@r1X1=i2 zv-$tMXbXt7n`^k{YULYiJzIal-O4rDa`~T&71vxXd}Xa?s@^~K1ZuIhVf~SUh~DVM zrQ46`^^}46Cy;SAyvJ%8CEXwaw^skx`uC)HMR;1nFeI$5 zUPc{sZL1Q+$e)yTcXH4OF`4b(U^?S2(IA11sNfCNzMQ$<6i_9{2|GRtjA_3XUhgkp zlyX5u+m9_^WYplOxmDk=C4iKU)vsY4@t^Dkk)}O~aUTBCCB9+ z7AMlP#(ppqpH?ngc0FT4cM6KrZ+3p)6P|p(fpJJ{49e#+RGMK_YL&95m8Jya-L7tB zztM+}hAJyO3T18CWTGA}`8=lKta{Bj;8lGy6Q9ZCsODUJW;NwVpN++EWL!2R5D@vK z-hlzf{qa4>_>@5agbJj|1`h^@Dm!Ko-|5;$qu_&^zLUxToE?-Bzm}qtJhNVw8~DaD{4_ z?lf7~A(N4AAf4M(=j}uri%WoCTlUc9hVY5n*yQ6=CMw6GtHu8Aql?S)wV`SFps73h z=6(gDh5l@HbQKoL4I6I+D5XWL8v>N^Alk4rvA4ePN(ALN56@1#EPjGj^* z$_eMcovPgP;)5w5k8(=m-U5m(H`i00f<66;{}{pr0={%*2P4NxapLoKMxjhzWP<+s zfxNwkLQWn{^*hw5k~#{D-3*wNSex!l+quPn*^IZ53)6CR^-VkPO_B3PA#k8OxKcqL zD3`y}N~a-bC-1va%`f1LYaOGBkk$dLtN(L%YQ&)~tnOa9kM%e1L1 zI1>{RCd8inpP7F5UUI(*DP>02(e|Q;(gZ47TZH0tOv_)vH08+lHt7Nt#9hs1To$Ig z=Molj?^FWlZY%y|>rA7bjE&{fW_Ke8dLb_=-jjhuLQQ=A@V=GmuN}v9EZV6xx$buB%HE{|nryoU=USk)iVMFn+l=7>t#gdFB`RM*P z>zswqk(c-MB**7bZ`?c(A*LZF1Cd)591B7!Y7?yA0J5$>%wsBD`1sPf zo|KQasQWkm>qt2Bo^Hv0T!r7kHj_0brV@+~jZWXun^vC)Tj^uJz>yVPpTs7Iq zrd}15ELZ;~EEI!zG;uBJ-bD)rJRyUDx5-Ra%hqYuXO!jf$rU$FiIlZA`tb-KJ)}%S!5pR<5}4+gZz}+eHNRBvNlO_QOr4Sn^#EA?oH+Sq zmmm}^nA7z()+7jP6RP={C`wtB_D;%yW|%Mv@Gb-z3|BzTO+7!EXGIFlk3ppTpDeth zry}VtjWF%w{%a(n))@k#@&OQ-nM%;1CurY+!_<{*$&tP{3EaCINDftuOg3SGA2oQ9 z3|`|0PUWwe*f-qqFZhE2*f>M!imNfH7lo_VKi!_;7qLliCp}WZ$i>LKEFGsxKgO+; zbb*(-4?Sy<2l_#11WoZ&)2Z*v3c7Tza$kk19;;Auz6vSc5>?`+eY0VY$s;dWq1#sI@vxtB3cym43;#>=|pt+@7A z85v9l?Q<_aYX^A7LO<2@w2no#$f(uS8BGW|Gfeipe7Mu{r9)HirrPXRq5Fr=!2E`=Ffu zpV*)eq2GrspwE2;UIc6S35!=(c!=jEFMn3v4gr1~IBGXVf*A-50rgFz;Iz+2oBbcA4EeErvfJD;jD3~!WW|%1_!;Owo~`)GLjpfcz7u}K zTE2em6#cVx<*u4Oy7_;7y!bKKhCY5T4K9^@mEx}M9eK+sodwxV2J&-%`77!! z_b&IY6rRsM`kwtEmL>$Ec<~ViL@iu5k_|Q>cWAFT;`YA3ZVoD|qZHXCaS~qj-|1*o z?c_F{#5Px5i|vy2Q(pM4b-d2j(b_h}wyOqjM7rD34lM-&zn(kK=|e+81&D^*qY(Q5 zFFS1v`fS2J{BPf%KVM(F-xsbApMTA%tlP^+%~Ndo=u6H`v=a(1)~h!S>*?)K_g%uv z6{KtFL;OwZFW0JmEbThI(k_0UUJlyo@@nK>7s}oZd4tI8=5;FRG;&6rrm@$2*_p%=k?*7_(x$zpTGK7{*MZKG?vEj{iX~=oZtTdKT?%Y=r z=(MKDu=3x|`4i;AyXs`jTpf7wb7s9rlnrg1l>d4;#k8Ht*g>4oVB}OC9bAgNRxW{r zYb~Fp;azFD?&!NQ#D&>t(4^^+*nT>cd2{7t>*q{wS+S)tS6ThKdM*+;?VGtNoy9lN zw8L^Ay*!V=UF^33sr_|jFQ%@(tXt?hzwIg_*yHo+F74aOwy(TlI=7kHqoc&*=I6Ln zvw@>QTCM%m?Fny~^jWxAJaNan89nFjCJ{apmv+_ z5LmVF<>$|W|F|o6oE{j3Vg$SQ)jK zw+Ay82#29o{PE!A+=cIkAnqeZ-$nYoSSa<2GKQgSC<=)0;KWqgAXFba4iF0%`ckA3#j-y`qyr3KWiRJVL9h z6fX*;n9r$qDY(0x_yzcFXkL9ilzQVU4?psVo}Aov0e35b8yZI{jGw0evT|Z$<`nI3 zFC$%P4t}~y3q?^smadC^*}h5|2VNSkD|Hvv9Q&19l$HHgA%((hqGafcxFVKm#|M|u z*Yf`z%_Ld88gy&wE%$KZ!x3#W)Lu@Go)ECj#)9lPskM1Q?bTjxK5q|_t54_awb8li zKY8h8IVc)mUWJBiWWu^bKi}g2-W?7+`tt!kz7o`N)Q$Aj9s=rh`BQDzjLev>Q#wbO zW$Czj2XA{HZB#a>FaaH>bCceLSt2UD*HQ;OA5guKNf*scG%c-511w zjr{J-Ui}Zo-U7JMommskgqfL>2`3IS^MohN%*;H22{SV@(}bCsnVDh2%vqm%_U>-| zb*uib`dBdF+0latW=k5gYt>3DI zQ9mh4`fqTQjh}D6CnFhszF&97HO`gJwQBIFEH%Mv%jEYb2Jc?nr{rHvoQMYloCVcY z4uF}-b`8=P&Avw-M~-iZ`IAcTM%b5*Xo)T{SDWNPJCiH?NrXecjyZV_=dX4j4Kj6A z>Hc0^G*a`UiXoRKw8;p+s?1p&ZGSIERAZKT13JrujnrZz_-Gwmx;~RW;&1VBYzmyi zr%kbGqxNaxSY3`UY|AM6wcGkQouEmnxGbJsGVK!5@`v&9Q*Z|irE93g$n<;HABFlo zC@Pf-xCfqBipVeJ#<8AKt7naxW(%Co$7n9(W*#F?*evH%Eh{hU zj*;Z+4?}ynsbAA`Wm3?MxC>9j2Q{yBKUr_47B({zwJ9gcZ325I+5=ZRkspJU7uaBH zPSMepq_m6?5GedH;*G{Z4nlm}EoF327F^+RSkemQe`6L0XIH{j9?M}tEVO4Klm?!iWckqsnj4Tu*h`l2B%Bz-Ns4F4+hu3P`D6Ue zY{RAElAcbHXTGfMf(xaThv(Q;ONH?S1@%f&(X%?=hg}_5k_yEriZ-iN%4ucyf>m6` z4(Bh=Jx|T0^h{hM_e^OH7+N?h`u4DsvQS+j&s1s4`~T2uGC4&ay^ld7UnUG&5mFG|97v7Z z8=YPnk{oN-LnXz26)L)^wWNP%od6=ql@o@N(#L8!we%ScelNtw*HWyy)O?C|vZyX! zdDc-I##UIW%Mfidw>&7P@nCdsXroonfXdKXF3V1Dn@$3hn0^|S@S;cD_EH}!+PqH@ zY^O)HPAxpp2GlJ$WtqCaD`m7SEVTY)(LB5S6mroc@R+#HJzb&oW#DzPIbw_sP@odAAh3n4I_H zz4x>8z1_EFyX>#q$9FxVDMYk_t0{Utz05D4hfhOw2jd8=&%O7(+p}4_60GWt-Gfz& zcae#Z1hr$kYM*xe*`IeYMBTqWJ||z=^@a<0`CcE_5$1fpLWp$vUjCL8b;?e7(G`zK z$#hZ|d!aDpe7xWH_ET~UbcoSg3_F%p9pq;?o?^xQ9o#QL(&g>i^m60W6sXIsCTq-y zU&D&K-z~Tz`n<7gmiEjDJ+!49pHwINBqja)7@eLb`gmTfFA?A`_R0tt&q7>ET6{Ko z&yn-xyX*0|{|qQd3i$GMI9f;?p&0Vz_H|18+|Ag1=7_Q}!9D){lofVV`?JHFA>HsT z=Lu9HJ*};fX-XegznneBlt*x_GVIE6-W)aI zB4d(8s@UTEZbdjip-ATY1&9T604vN9?!@=mdQ}9_pAdk-jU;Dcj6n2(z>^6-mLoss}x7=SA4SAPTd;#u0al=(m z(%M2d_BYd>2=asfb1WDCB^<=QM4>q)h;APIk{|09*kTXlks=ukI%41$Fm~brmDu-W zNsN3BYtkST-UUZ9hOC!GjJ!4khqB|dw*@{(OBK;MlEUl<{ZJW*S8#?Cc;P1;8Pg?) zY|tE!BlrM(iu>eP!$U?{aihwdg;k z@j_Ig@-?>FeLv(Cj6HC%kU@T^D+l^kt)nJX<{@KZNMnm(vz^}o_F--iOM?-*4f^dQ zyh}$*g?3fVk6JE*JsOhtt zWAt89t`l_aQC*1J)j{;KL4QLz| zxfsoDP&9J#bRHyqVyIz(LEk~enjqS%a=}pmW5m}3AkkDw`M+{$koCzeX7av~oFOem zksss22Bn}G&_~&Xv&{i$^Oa>E1qUw&G<#ZhBq2-#IPn5LpkaHfpVnI6plCJ7oY^bEBBCP3hbFp$Y0#xxh#xS*Qbn7? zBX%WMA%gT75JVTUwf8f3L`C&Cm-e~*%SY@m#+0d)5ah2_sv4kR$8rrFNqOh<$NOjh zIQl=CFUF?g-YSS}*(kud$461w*k~D+TTumS{N0U>K3q@$&F$N*?f`>bM1BGVN-*!q^dcq_by>Psa(NiFW7G8?Awgk!RpFd*fZ<>(n ziGqp@+qXtoy0RE#2!LbLXD4>M@xe5}C%8g0V(+ zF9m=%2BGC$54GnRm5!|G#sk0;{c7aVLv15_RF1XahnUD<0wm#d^O{M-jG@pk?F&(D zFZMEbbR+fcKn;yd^+a5Hz4bS|sF|}#i7YZ*GM~LNQu$#H6>c&JQ>UMv*!%J)U-lU~ ze*@1oG$$``sA;+ve*qpyTAz2*aas*` ztlpDZRDRND8`+2({{ve*-IIT7K}GerV*lz$*JOX5Um9*t%jC_*j+V2nR_2QfcP!cK zXZkv2EvNEP|G+md6{S*wrS>)sICms!(w3&%+%1xHYsURR{1d8|>6`*KtoQ_2zlvYK z0#&NB+JZ3LUTg9G+&#N^X=ieIrJ)e3G4n!CNQOI+_e&`|R67=uJOp*ps<8Hd{eLb$fJJ)En#@tt<31APQfK%GF*5MuU+#~=iE&BIA&ynaZ( z{-i#9K<}C#0c1cFB+pLPA7Ti1%FG1>V3h)_cw-@s$r4^+y%I9hAhi=(@ZBjOkRgT( z52$e7uQb4HB~9GHbR`kUdZ{f^t@TS;iHTass?gPT;+&tMBJbd%dcRcr_M!}b2XMfO zL6{|ieC|Y`A``j?mbO9$Q-?A}f(}=sbAtU81kKhjT;!aTHzwe36)#A?KEMND;6+&= zDE6VvG{$3s^bsomrd-8F$H`VU(ic>%7nCy90A88&4GbO)h4?$ALCB=Pv3FvGw-} zVFF$@aU|>}R%(IjK735CDSnAyd_ewG4-H{mz^OxgZ$oTL^e{m`7fulRL3|v<2&#nS z1^^x{vqd`CLM&QZ#{06@BBDX`YE}b)IZ$;cJ)?fD<9S}LaNxlJk=zmzERGMYbHIIyz!w=y4l9jkA=W|1*7 zg2X5+5#oDSV$t{tr^ph)R8Hjj zX(wXkF4NF}sXaypX8JPA&vIla6LvF7hnYssQe-Hg4CD@_cd!nzw&Te%`T3R#aU?W~ z|A=0-W_{E_vlDF~(7r_G*$t$X4h($}* z5}6CDnrR3s|FjZUG=mTzRPBK8t!b7aBmrBMMq#pId-A*w!2>kO>S|<&D$0xGgl4MB z2y860X)jn7b^FH!#v3;*d~4TEPW;U_s~jq&6&e~Cwf&8I80F@wqVs9BdyTNTu;!`) zKv@7l36of93&Z5=^4&{Agsq#+Ybj}7!lNK^GSWPMVJ=R0L`ibbYpM~om7PtTCX_7| z2I4jx=1F(W&m*#aqDl~;YY?c*1x@-VEmVy0Yh%}_;~o=#ARtK?`ns@xcQ48|*P4OY*GyX;r z>MM>VW{ZZAZE4Rqe#=054|ao?AF~3yIWR?L6LFnPV~6m@L1ciwa9|DwPxrTs6h;Je zQvqBDC{%4;C!OJU@V)#2^1Y@8F!WaZg!0S46_fpDFTqh26PHBo3}HvVcszxJNWsx4 z`r(3uVi`VrIXehY5AuEvuh`NSlfgAqjOP3S1qUl>xzZLFF-L2^5={7f$)gyQ6Z9E>b_4g!r_c)% z1viq%1C9*a#(_D!p54(YTg0_7YL$ZR>n|ahr75jj4Q92|NMTu1GBKDG32)|XqSCRZ zEM~Oju)<)bP&lmnVcN$jtU2=_(r8(ib6b@UZ%Q%tfcHhBa0JccvZl15gX!CFxCY4~ zl}-x&?iR-+6hx1tb_6rjKh}9Yn zmYhxxB#fJ@8Lt2AfD96V7%D9I_8<21tVF5RWT!wRZ{Yj!M=T6*4;tVfYj7Y( z8JA{Y7af{KMV8BiVP7(nhaou!?T^hWOTQW80M0(uk9Zn=GHc>p+Kta?G%PXhI2Ci$ z?fa9(4mRLj5^+LxLMCkXhH!nQs!_xVZ&qCT8itv1S73}m70gN;W8>Kir1^BRn-*rO zjsUfx!_{*|kc>aI&pvM_iU{d{Dp~H_@(x}`wQo?I?Wv)GdJGt;!59^drW)i7-<=O; zhrUJ9H(JV=5Q~Sj!YeOWRL@4O(lqv}Dov-Z76(V05I34|!JP*bjR;!%o0y_iROy;j zxZRAXG_7>NB#j1$@g$&>9;LyF-gP{z5X;FUO%Byx&Jo%L56?sJm$!dDD>J@IF-VI} zm|5ALN^oQTU^>%PNrLJsf%}Hmz2)}t_pv|Z()k4*4BPZs5jO?J?$QTWt{H%8(1P)R z`V*H4{&@T#hgDj6SS{!AZMldtpY!-oD2*(vYTTd&V^0<=9oGl`aQ6+WM!7e(sD-_g~v%@B43C`EYSMj35!o^*e;OHH~KYkVZ~c z>B_Nsx^%41_xW2&zMuVo7IVv&08t4o(qyOY@|jhH?7dXdRwJl#m^xa@A_#EX%qGUr z|B)$-fAiWq=pQ4Z_xSdKN~hI9SQ6uDh4%KGe>Js3HWkDwFGqeQ*Wbl=zkKo8#Ixyk zaZy*cZ~co2o_P0-{v75)R3%2X`E2OywZnQEYlY0re$;Te#AuBn1c^vLjdI@-jgtJ} z2sumyl{RL0{OxUbCOgOQBo887<*QYoqy38Ta(({d!TXC+N}3=zoMY_o<27X_3lIwH zq^_JMjU}no1x42_XKnxD`t-f_>*a>k>&%Y7NdRHf>++dQ)~B_VFnZW_0#)qu`q{;e z3jwLW>j&m@T2*6Z*C!U)fKtaouW?vN$EoHTg}cUg>qCgmaW1_i{q>{`Ii2VizO0j} zL-^u^4Q7q5UhrAcEXUw?{Lggklfs2g9NV^a*RQv-?)Gk(kP5fj%Oz`p3B} z%HtxG2PIO{F7Ecr+x62wVDq(mcI$V$H(r;~-Th@V%^`Q%Ac`DYkH9G6@$Pf}wr^n& zSyFt9ZWo_x&eTueO#wp0&C?1q;&HWQce?EE*D3+mdK2PUne=G9A8P256rEtxSKEB| zn>x+ic2C5&4Ws%lZL^EzG;`-?Uq(grOK-dT`!;aL;}=Y_ zeRA*1`1RV<=tRWRD@+W(Y4c(Hp*KZt3hUh`eU^J1U=)l202~!F_W0|k^gFX~>%GY_ zuKsbt>;4Ven=dW#JP@#)I-f50XQHidojt)1w>!uKau2bI9SmS=73cTtad7}^w1*O- zLwO#j)s`eFN$T$gvcO+Tpp6uKVG(ePWnnH_NG%@dW^kiugrDLLl zsfQ64I1fz(u{EWhZ@q7&SGv7#tPUT;#t!teVjUi{LaooH|Aq=*<1Z>4%B{!srO#0Xr*Xz2rJnf0a+b;P?#YrJSxeNaw6VMHpY5zPn$0TCeuw!ldM>>-hW%q&Ik>* zY(Do9EHSaSsfMfFMx~j)3sX?S+GLrQgT9xme0AYm5wuI{5`!jK|gfKU|}+F#gBq+L`}Pt_EUO7LNb; zT)VgCcr|&e!^V@^!kk(J=I8+$@;!t<<`%9d^ia=95S<7v{Lx(&N{4s3KW|6I&}j>u zsVQR`Qv9lLYhMzefp#g9=%a4o#z@-({R^dEg?4Db{bAwyyN(gr`ybjN=4)ELSyYP9 z!*GuQyU&W(%p%ac)nCl-XKMIa36Zoff?r8}NsLKf;c8T>4Lu?BU!%a)JE8_G+v$`@Q6jvB9|2^zM-1DDgkh2$QNHzS2&40k6}zJt+(d@U~z+ZB9Y6xkX?5 z6!JjaI1KO9aYr@#D=YaP@1d_P&Kl{60!Q7HWWzxaN^**QVds=&*pIsQh6UJ22RUFi zqd9IbkF#~1^k1NbE-6RGj?5`X;ezQ5Mh#5EZ4JD9o-M4NeqYWOtuuI=B!=1OJnj5* z`bYK_m&!8}%^4AmXLFe?>abojn@hgzwjH~3W4RgdDXIl_C7GK+MuUWRIVf6)+3{IZ z>g%F9ngsfMP$^59Ztu<(ld_+WB?8`W`+8rWF?yfgAIrY)+uL8qDOa=n)n_~u+Fu?Y zqJ1F|u20^ED5-WKl*yq8z3}Sv{)b4o(C2pBpU){oU(YucBi+Lv7wb7+?{dR^ILe9; zNBqwNYfvv}m1tJ}2>Ln=6FYeX&U8die*&V@DiIR6M$>B!(7>$NpxakN!@O}Sf$3_P zuH}!%&NYPte(gxg&NR`v+YSVd!LL~+Lre#xmY(7+(urdsD~$U|jdTOERMYKLsqU7> zHdBOS-7WgN_rH=+-|RNg!BD)#XLKfA zL!^n^7126ebfj`zR^B?ma^I1jeLkfdC1*$0}r-SLFje?r-P z5ASxlW{)oi-wHM@r}SgLD@WyBR=bVzU3;tT5Q~jZ~bc za5!VkL544&!DTVN!6ivufqi)|~zYqj7N3~sIL_+9~ zgf(>X?=(Y58P%RIxXO;Fk^8YoY`3{u{a_l^5ZFrUrO+~Q<65`gk^Dbd8$E05LcA253Z&|%rLOoVUIuL2;ab`w@s`1?8LF}gY0;HanBNUh zt`Ji+w6bjxzzCCSa#6j|Ff#(JPHGqLph#+`<1T$*L)P1)1^a44QoQXSijHJi{0y`z z&}QUiLrS1_lHv7pK?`pB({$EZS%51%OQ<#LQR;z`#a-~&ha`4&eWE4ZWZ9h+5w`uXJ+EY+&MBJCevDWvfDOFG78DTz*VU_&Lo6>N>J{3KV( z30MB>_;e@bB?$-UPh{ypfiUqWe`l122Q*iHgIjD&s4RCgTrQkPZG^koF<_E%fzQTS8RaX`J17(64&$Fu(H#PsPXaJ2a!~dfyGwjz$%BLV~bCv2&WBKbTB|xo-hp)-V z)4EW$B3yi}LEN%X7OO6fJt~)9CZlx$=z9lQt~G7~#lv!2!LXoqp005-uq{?nTS6um z)n(Z36}UnQ>m}3s0XmaDCBr^4F~IIPoHehDH|2zBce*tV7VIb_2!hbx#(sXOwj2o}8PW9h!2@y~F- z5!;>>RzP}B`b<&4HeHD^MHgwnRtf51o-O`aj(EQHjfOw9S8)Y->H$Qrp zlv*Ne5?IKsU~oGlKY@6|9a%hkU<2_mcGIl;znsm&DoV2k0cFZZUzq@6D>xGo7w&x) z0}N#!neO7U=bv$<5r6W~U{@Bo9HS`*l`c00GYxmq*O0{@*m^Qq*dcV62hL~_rv9ae zEFeHj^L-YH56l<=TFj7h7tDa*ca#rr#O7a}F=ijZu073u;P?$-T?pt_1HhrhOo+xC z5WRyZMEvWW^N`~r%CWOm;pE>~`ipS$w}r12RkiG!mWapI+YfExgpkj!sXuR(+tFqp z$&y-XNfH_2^3Gsg0mjGq9Zh6vsQSeW(4m|U&8|5Q>o=9#GYHR3=yoC;JE``8wmojS zl^o$#PhKCG9pu!r2#1|lollE3n`R%byni`>TvSX#ux^Wc3u8GBmx~xYpnwE?1Q=li zw^QCrcEj~PA{_d~1~{9)(}GQ$!5&wOx)^~o1x9{5gDne5bj2cM`(I8CV8ya|c?68} zbeHjMqkH)suG=Xpf__)+KTSpau2x9+w*IBN2kY|tXW>i&w_B6Lg|(h{os-{r)5V}y z*x_-#9{*R%V4oh2^g!O6Mytz{gQ`=i+hW4a(F{*#O5o6hUe^2YWIy1&ena}!NB;V4 z+cVs+Ill}UqUnm20BY;(77)t08MXGW@W$cQ5kO{cvB1&40tW&f^5kDffNt{%Eq#ON zQgR*H(B?eVu4S_>12a#O+YzO}kk`Xij-tBeI2m)o)4Qfd->Qh)ZkR z@HA!x(@^phXNi3X+Irj1!n&iDBBg$!5SGW1B!~{&P(dLR zpiYk46pyXJjeUy9(DP%;*(061MkW$QU8-PM7Ty*j215!{lrR&y#EFx;5j?5Vtx;E( z%R^3clMoi$TFd|#Z;}9D9WP@OoD2Vuq{XEil62^e-NO1FqJOy8680%oN-shYcc?Cp z(`}VQaX}sdJdl^%B?-^HZIpC>HD>1%GAsn(&)xC!NkonOy(hjvu$yoEJi2g4E;&4O z$G(cO|4X~EsMO#@B9nnSt+W4SydWp8$i_Nm->jXL=HlUGXa z@WCUoa%laIYWa5uZ;YdV@Ax&9nLB@J6ufUMYgX^;@#I@RUPOwZZmVvMX%+CqPDo+ICLkYxPFO z8c~U1&hmkzrNUM`vo0!(}7KAMWu~>=KFS zq5-0#H~mQ2bbNk9)^ZRpy=ym}wlx4hgR7*s8$78HN@@Y0ub%ZaD1Q=Eecv~~b6xOn zWEw{tXRdALejCFrPh&y}@0oXQ6R8=*zc0O?YxKUZJyLwIh`wGQc$(+-zdC;Ys#v)q zsv)sUbi_{z;42oM!;Sfx_al7uI*#bO1$nMKg_-!Ztdm83ah&>ecAb7QZ}s^x?)&w+ zpY!z=GQED71M?T{lTb+H^Tl~b98FG_1O2#Gfc7_@7{*g{Ygril#(n2ksAoa-T2QN$ zfL#d?MSpAh?=aNV%(Cj_e&+FU#wgU3$B=l#Nzwi^JDHTEK~gr=p-cT|500R{wNnEq-X(!F`IgRchPVwCfe5rRwsAzpYA%kM@P*O2nyG zbSax@Sxl5UiEUhA)5SlcisaD$BFI9gmG)L!X*I@q)8^2r5V+~EwIQ26#taXX!(J~zI9;f#xntM5^_JhK3($yg z%rnXsNqGc%H6KmO#5RvKWjb(mw|h`d@BKYUo;?!@-Du68U$LQO*Q?b0&7EIhLrto+1Z*teRer;ZX;`KL|HIBsW1yZF|HNQP?un%33e65woW9kD8DPKf_(HrhkN6 zbx8gf1UJB9*X1TEMjxHd#kfB9XqBE@=*}IV>Fofw_-5OwuH!HKb^tAWv%ALR6L{Ok z5Qa*3Op?b%M@HhMB^#yPY!j>< z${EmdCI{3wDAU4fs&uj@BWIT!`_BfJj}}Z#&71Z!1#;9x(1-*$GkU9O8x1qC`KKy) zrl33>3!mYX1Vtt`{Qe&4*UoOY| zUMdjL-i0YfcOkxVu!jj?z&uQ&_S6HU*LqfZ+hq4z4;VSc4MuT(R(`>|81Xqyu$V@< zBpl(?2OlCFTlIIu97ptbRN7_NT4eq$DNFOQXEz#3ueBZGHJUu(k-Hm;z9ZOJ<2JF? zg{!sY+@33{#}S(}*Hfu){mF!<5R|4K~J2{qsVIsy?}1-8Hl3;LO90u92?$c?`Mhk5xN?SLVui z@N|l61i`&uZMJ!>)0(zDp|}sf0AK1gZ$3aTsHAVl&;pPTH!iel5DbA7;3&kO}b%4iaHiwwU;Xl5#2oH)A?0yF%b043g<1Z-Yti$O4Aqd0D_#d9b zWMX9H{67aVSy@?F|KoqkwPj<-c@Q?IYf8xj24XqG5+tC*q!|Q>G5?6tJ-bWT-C)B6 zfBp1|_q^|P(Y9z@pjo6I=6BfRtX`PpIzfrf6yY(9ah;7>FxDQhPfR~2B~+=`8JU%? zjc^_)U97%EQMz(fi7qW$O(Lvae6`SC6d4L|ts#gnwiYOKwvy{30i;2O{eWFe49BMy zs~4GL0-s z0&*q-E~2W^Q|y?AwW_4bA4u`R(b_TeI8SS{cZnB2YGMfpW_gUIc@0C6>6z*8210)L z3wOY$1VX+DaSU-1VatU{-pweNdmurk>^^V;=s!Z4WtSM~OD4G+B&nA!X9!JRg+iLp z2e@@?K;VC_9L^*&4@D!|l!@=NwV6l8M!JSHF;U25AlhKd2RzNN8&_>|Hz4S()%Ro7 ziZ<{-8qk$xbh?<+rcc(*%FtD%ft}41Gp(AJE{Yql{Tl8rg~fC+pI4pSVsBW)o(yJh zK)^~z=s)4~GLLG^t73rGyK<2QM*3w86|vS^M@qn$@XHUG0FdV$R`aUXtx@5xcYVT^#`hg3 zO4R#_mHSfVYh&^_==VubCo@rl*=x%<=|k8RtePX`Ff9nC5p9fKcQ0p>AwPb0KM$7V zeC^fS1)4v!0VdgzMNJYP{msJCESGCsd( zJI$|u)L&dOY&T)Ir1}d7v0EJJ5LwR-Pa^_}p*gBDXg_6Le2H{_{K9{IFXPMSdS$=* z#cp2C`?RImqU30K{g2Z4Uz?S(S5G|GCF%9>^-UHcc0N8Iqb`p*|Ah!xr*N@skGF1L zo;Y*g9Ha<(c-%_B8Y2}B8Tiw59A-RXk%Ag^s$M`&<-;uaB`MjEfp@DvyesQkcA5qAu5qeE7b4bZ5H|vy5 z(fj1;N|U`WgA0OGxwg%325L3<4W>#X_!A&-P!WDiTeCW@XtP>v76@(VJW71SN#yA0 ztZmd{kaAZPHu!;su88>smR$wy=M?#PZQQ@wxXWkf0rv9WP)9q4#7ws)t+ZE`f_~S3 z)mxwR*^+unH)p!mQmM$buaMDNb(msCj^Wm%Js5J~)WRsMV%Oh41Yg!=gxa1=-B^|Z z6!?ZK$o~MlBj?PW1<;M)sDsSu4vew%`26HRY4fbS6uNm?%etFsSWwmhh(mvMZ+++f*~!Fo(H7Jvx(WAJ{GmrZB#QXs^Bwz zv&L`Gtt@k#IkGkBTv20KO20gDMJ<2jXMQ>i)?`sb5C=FSM@o1lC7s42Q#$#ZpP=KO zEuCM7js306@^|Akfy8BRhR4mS;ZicMY}9P2`mSbHpw@>gEK36gv9oEc^N2dCm27sl zg}TVAv#GeB+uCMgvJ+VX;6Th@-QWr}9oHe_zxc=KEbUfOQQ50H-^W7+=EWNAk>gdk zpv8^xn0pq#sy5~q;Wk^cD%`G+052vb$CxK`gDo#sN3=? z=IJr2aa}F;^x6L?j&euYB0^^sf{<3|Q{MQ90YRH)5pmeE$ad}W?+x^M`9k$+!3ruA$to^XZz)eaj=t&6ef7pK4xOh5X=f2P zPc`BFaI&Z2f2A5v?-3EJo|Dky^#WyE}j z5qfNWrdVs|Z!|sYBblSR2H`-bFC$HQHIH^KiwnrrDw{Q7%K%EGbwHeMgV&Ze1Ne0{ z)xwZ9mt~;kc|d$ldWC6>Axd5=>VV-0MTIW|!r@%=*LD@@NCgJ-@f9RDs!g<4s( z%o-p3`zbzn!2v5=z?=~{8E9y&6wRJRQWjYPteoZ| z7Im}ad|kT4mZOdeB{kW1NOPsq*ff|wAn1rRf+02#E1WCviS34iK+A8=WX;ycjwxum zGh#CQf`0a{qnBRj2a@&(kRy~v2DMJ}o zM;w#QQmvCjjFQ>wjt+2`a39d(Te5kAf-gFowESPrgf>w{x7J2Aes^q%77I49cyxy0 z>mTZau5g+UuY#uCfWQfM7L{X_E8QkrWq>h2+*)D~L&t@FLk=9_H~;OyF1_UiB3f?@ z0~%_&zPZ8sUrRu!A9cLiHxLN@U42jq>?*fnBNio~>qt%+=%+$y*+uM??8-bQGiLW1 zsMU?gqMPZCx>D9)4fS953H>3>NbcBrDwc>=JZyBr-m$Uf22j@F4O!qMw_aLc7qLRw zOvDA4Cl?xl%v#F%GgqECdQbicPj1C5m@{?}SHD8O8m2Wr+D@Z`Mu zdn?NgFJ{3)tw4MkSXJ98)j=T&*I^<0E0id8Pru-?7qp_bc?+bzWp8~$DJ;HQ%4K3>!Nar@~WTm8gC!jy6JH%stn%Y&UNmUPgAl`6KV zBYRsDJP%tAdYh1V)+(sXHfDe6t^gsveo^D2u_lsUo#&@0WpuAL@Sdh)M&gQlqagcM zJ`4$%lnPeel;;!J z^gt;x&dEk$)gw5BDK$%1(ZBy7_7;YduQ7o*YqTb3zgXz5Sz_7cyMTnqJ|!qMYQxyx zUe?ZLyfg6@FwdERZs05hSp=Luroq}tuCFqcZ6P=AD}g=8FbMJiA$e6YFC#HZm$MMe z*Jq!gZwa&F@a` zJ!|ev?xi8xVb+ZA$UbNW(>n9ikoy+*X{|kmk7YE&Y$*?4gWGv3aQ0>_<|XY+o;j=g z(>}X-GBmNQ@|khY!_C1=S!dhW7h@HoWu8Kuf}63Msr2LZb{%T-v&;gHt-GwRwnzB$ zP)gAX>OnA|*z}rC8Z-So0a&?pMmGOwZ4(4)hHdI(iZ*=@xxms1=CTC&OXJkV)sOZ$ z3g9i}^rN5jtKfwP$(NBz73MD>W4UdnSC?3G1-#wrWJ7G1W( zwW$O5pf2*S1QDQi<|-}1{mHD-KOVqNOZzg;aG>nUf52@iQxZ~lXk;lAUYkDL_hGnX zw7bFKeu*d8GhJZn?4%vhIdR(;7b2khnkz6^-&3N4&kV0;o#{w zHCY8}h-D7QD2d7eMrqU38ze^W8VST4nHg%+(&{)6<&7K+!*;Y2t#K0G55O?c zX@wTfW*R?Y>o=SCB&&EIHBSp&OJucP+F6*zuh>_a$txD1EGbkmZ(O-l(JjXK%*as~ zl$!k|oVcgQNG8j2G`VsgbX4f#+>;)6X?ATZEaVa!X(XHsD;EXxjW3(5yB!V% zzjePhI9ZSi(OfMT@cPPxAk9Q>`#LDrM&`6TfGQ77Z=&<#S3aWD*ON4Mey!MCxGc4OMnS&pioCMVf~Z`vldx}P?!Iz8xE{6G#Nc9C{hspis&qYBj;0UW zrQuRn;eX|pVZ_?CeX-FDv3=$G19kiARxO$VxCa7k22Y#3{1#37&dET2-pm4e1%uAz zuLLU+^_}yLC2M=xb~K*t$CH-f0*AlS>D`%JHH7f(>=0H^rW4! z$e5w>t%~ssw>Qo3@r}X{%2=5#I~t}7>X@<&ky9XazpLsFtN@@<$5j621^N(KqL<)_ zv}Y7}wi2XP6kqnSWUyo~Mxo0c{dlLe%epM7kT1i4=}) zTko!Rq0A}oE5B;vIoe?J24EP&qUp#`=#<|Lz#oKjk-{t0DOFk(JQdDLi2>7^AyBJZ z-h9JQfpbA6LJh*YTn$x z8D0swPgD2hs^+cZ%21x_`5qT+dw<1{B$-?!4hLmpJ#?5Ki|GN=1qF3_f4oh9-e1&w zeX=)v9OdYB`@AhL+imk5rj_J3_KqJfkL;6XVZC&4Mzv;Zcr3S=cy@n0ZXz{t1*U&} z<3I|v{vU!kY;2tW&)p6}F3#q5j#ShP$`;PnCctMU7eh-EBWGYs#L>jS8TgrufwGA@ zv73dnIk7nqPtwuR#FW_Hz{twL%!Haj-qFt3#mK~w%HG%%NCse{XJw>kVxeY`Ht}$? zb2N6MqK5sKlZBnFsDZNyF_kDcGb0lV6Em=8V`F9E0x+^sGBQ#E>16GU|Nlso9S!X5 zO^k^d#0{*SOkf%0mBrNQ#a*ne4GnBLDIV5VpNZ!v-7K-FX{Tuq39(lApKTiF{pn>(2p5WD{Gud&lJ(KAxR^79j$*c#gz zTEeojG5){y`~MEM#TU>)UANl?m9@YP%CLv}UR* zmfnE2Hu3!@MU_z^0wSVGA1xo<)~DD7)pwf*xwQO^@N;U=Al92*^G8RITJ7bxocA_e zZTQy(zL$F!pHAHk`1l+jPHwK&eFe&!M<01?u|oam%qPAkk(8r)ZHD0aitg!@6g?je z0Rdl%t(0hTY4l_&I)y<0T3CwY$-}{y_qW%xTMa6)lXp{(7nj#)^mzRBixxY&h{WTC z*aX`Qcm(V;V@ehi`e}gG2TR0JrG8KB`l096(u!G0qcyVpr|h5OIH~)Nve~8-%=e|P{!=*J;;0RMdwt*8_wGrG zY#l+b?cNH596zkv?-_^-LqnsS(lQKR(7QO)TQqEZZqU`$K@dC zq8yTol>MZ7DX^&9;Rz@qV7Lj8?UVqJH?r1)a1|cJnzm0@AQHND?#+0(#_39VTA0Ft zO27~Uc6Do50|^)w^X~e|nt+#&eVE|UsGOQ}-nuUKt2h46oh$yS{!i$B!c_PC3@2H- zwRg0j3K03Q{EEh~#n7Mp6`U*4^AS@+AYl-wa6;7B{_uUlLVP9lvL$vz&FzX6?XK^r z!-g?Ega;@i-$xE6Ew{h@s`h}+0>IqDAK(OLNl?Yg$9j!4Du;Adqe5O(k-|WsB955` zVnPF`5L==Vn~pV!XtHczg^>aY6DLENkd1x|9IW9RPh$i;EG1!sGeQ5s>4o%12o2F@ zdTiU*ENO1`7!`|+0EvimCO*{m~Y&$cC|6q4&xk2nWgh2m*QV*C`o^i2M& z2|fXz4I9xMAPE&25aB7~F8o;KyU2(yCYD86jR*vX33E38o^|PNEAU|foyXEmMkk?8 zhWVXQNT1Y&V~zms;yM3+75CmzQ8nM1a0i-hVv~cCL~?A990Wvi&e)_zB_k3g2{b{; zpdg5f&>%T0AVESmNl=gmQBVmjAT*+61d%WYfA7q_GjnI|{BghatyQa5oeI0^tW~x5 zuIH&!r}1HuBSRbMJ~BZVVRk)ykp20>ld{*E4BdRugll{VONNrc-{MVud014ewP-mr1MhCsNPbFPFpOT)all{8u_?L5F+M)c`nDj(ltH>QA zQ(hz8jWYxvih9P5f$eAK)R>HrYWis;`M61hbNtc6*Sa?!ZtHtru4nAj-8nPnbIbps zMp^dI32Xk8LT@*sS#|u=Rh#aM$8^u>@n$Fc(VhN{?AyDChu`0h{V%zHeXswd_r(&*bgOk8#Ye&&c$s?{cb{{UbIz z;%90am-hX~;-dBlDl)3G_4dVqkgS(u$KWmSE&Kn_s1^Mh2zy zuYH)qJm&k7dv~Ak zj(~c1@Ns=|5)CxN3d2NuK01?LB+ApX-5uv@hp)rr-C=xPfq4w3Duc=WsA_BB?7LFE zY;qiCIcHH?wI0>=Vkc@hr`O`B!s(m8wQ}EA#MWGVr%eWN4G|8h8hoWWiyHDK)hy;D zbezkQA_>*!b~Fm8nuZj2pi=p zngdR#z^bNt_@ANFd%mE^!Lx$(h1bt}@|)E!2n=;%TylEbSoo!l12sH_>YsEl3pi+s zheH>+g+Ec!-wS=zaWU&BF22KNE91TzLPb3Mlj~MS)(=Qd?<@C%LDfqy;5%8N@g2Pa z$k;cz;uj1Ggqj1tiL52lZ$%hCaDBmINQ3dL z%$D^SYlC5d3JZT5<;Njaqk`|9U@_{6rDi9Hz|A<5t-9=Trv~S$krGDkbf0pR@?h)Z~X(R3cxdsO7vh%6eB2lBHrp`gDZ*lfm;Ms$T?>qi^ws!v~)^y~xYHA+(MN57ocw z^s@Nb+}n|Bi3%fEeP6zKqVcBf$FxxL&rkGQ41S4W*H=V88M0F+m}RvXWI5-S{&9=! z`}$}+s4U3cETwnX&?GQ>DDWHOf!-qhAC*`I2`4q9xzRwY!9eI>;Mt+^pN&!Th-0H~ z12g6oB-mUXY3v&{^{Dm6kxk-YvYE{WF;gro_(fc%yi!TkW)ZcsRTXIktPb^ia%JuL zr|8N$pD{JHbkFwz+3&_bHBNtQ3=UXx&ye6&Ri!4s`xJyV&3_6Cp7|kw>vb;&&&WlB ziOP+QSgA*ywB)2u;hKAIouR>HKlnKwe7`HD-Ykxt&2ysMsr?~_({q~yABjXliIFeP zP^aIgG<#O{)fTxUw!W!ndU8NT><<5c?G8q^gJR}*c0k8f>SX9n#g8m&#VCWlTE^u_ z;o!GO2p{4Sj(#GZvH>m^C)B|H1Nuknf+x6^1VWXx|G5ycuRsLT$C(mg?F0*dS}w|; zmQm!Kb_Zm|6pMfG*R_zW*96AOwU~0-ubGyMQpe#H<%!7nY#c8wmf2GM^Rvjy6`?F- zJ^Hx!Bw7wgc}c{QI{LT7?oOW`UW5b6Oyc5zTVd?0>JO1KKh^Rm*a=P6(lM4a?s$_1 zD!+J1f4!=f*$SJNgc|FcUB=m=1WA7?N6H`!kA(iNc!YT9>phRAEmnV4i8#T4m+G~! zNqk7aOSoJctu4MvNp(Q(rb)gcb$c_t0-jFlgqn{<@WT(_N9>(OomuhjdnwzWbWFZK zl$a2Ab)vd&_+kF=m5O97m=fQ|)RVI#&has4CzZV?hoLUPN6=CHE1GK3@F&*%0V0qp z(J;)0I{Cddry<#Xel%cF2p3{B;yX4a_(P&7Fj>_-_|aQ5g`7PVw-MQX+~_AP5oDU1 z0aBAZXHtp8TwS5SH#61c@RKAoOPHK<=#wsVmM$kI1C5_T;&1OmlpqL0s!~IbzTbDG zS9y9tyM`5ZXPy-l2ps1SYZBZA55>>fQ7IZO%pZPUh``c-sEiJE(){N{OrXAEPG#q8 zl`9mMA^4&!1**6QOZ~rZ`l+)R<}g%V){~HAjyi7o>FIgD-TL{;t4!~2@>qSr%VL}A z0q`ip3di=5J&)QJ(RaLQt86p4U^wn}vY&aoa9z$5dNI}5r0uqHxht@$Sa@sS?{@MPX})T*35DIS?TSY-LLn4ao1WR&uBeu?ReN^2%UodigPCl)M2fR z_F|7nAWufS_lZq7)}~l`e+Di{B7uDgX8+ z^hQ=TskN2(Zk6~p6YENpuItV8S^;rTloL4dEp6PcK8Sqy`FZNOadlk+hZ1~% zK+#Go)E{#28hw-6IG)oV>`2i_VzQ?Qnm-eny(WVMl%qeZBXp8LX%97;f6NK|9hpFF z58K1Hw=T`ql`8(7f8Y9i zv`ZVZT2ukWY*@K|g#h(1?P{DgV`+-M)#bT_S|$8TEN0*x(PA^kwiHhbF0e=c?h^Y7k2cqvezq*hpaaN^t**B<+4d ztp4ekO&GmWRxw(R>qligu*4LlD~=06^5{IPX@*HX=Ng-x4H28ZqIt;x^`g$2Bs(2n zF~9i8U;{XVIWS3>Td`+}(y5_+yF${q`dlESdpC%k68k z=I9b(jAWpomGS)$t4rjon|_eHl`0sRS{sGqpKNidfE^}$9*aU^kLDvHbZH)I(Rjjc z;NaGN=A(iWWPWQcv@ntxeTfL?Ygm2+v4aWtV;r>5RGq-1xD}%l$YMav5(B zaI_ZftRY-EseqvD+f7Vk%ZGRnyaH4suOBpkO}U77u~+oORGff+vZ?y z8nV4P^Lk3;T+k0&hJcfPmlZZ4Hq>*hJFKPkRpAFnp9BXU4m|t7xcjJ6{_JbjmM=J} zU_S7z#jg7lWO#iAzKErc?2n2tp&_2uaug?_!KKvjKJ|mbCPP({$5BQ!!(&!d4N-J$ zXxWRkMjYc&#LnmV71gWRr2AC>U)^I7;GzUved7!a<~7)vwP(H{rX}|mR6v3j#BI^@ ztB0YY_14c+G;)%9-wt2a)6hD()C3x#ZneOtL;P4!T&lz9eD4Sq^^eyNsQGJHjna4{Znc>vmiB9h6g8rn^otJKS;}6fmZb&p$mna@N{bU zw-sotByYv^#w@XXmlg+$#JWtM?7m>5(BiIu)5&GnenOt`2|PO6E|wMEf~SYvKQG^TIz&@@5EgrHMD9p6qoAZEf^@H=8yF) zXfmKj)E@_JHI(Q~Q~qpr*d}AGF!##dKTE@2m_OcUZ+deDMRAuv!ND4O@G>_eHVDII z9KSvP?zXLwFoC5N;of&t8Z#D0g8>hx{1Km&UuVjLZs#{D%=5SMuayG}t1fO8V=(<& zPk#N3J^bx_^uhbbEs&3RI)7&0Sh|3d4SBR1^E9M|;DqC!xrV>uRGqYA70ss9NDa2Z zq1BLO@}o44^T$W3^2v^AOLuN1UDOVF=bIk37$8{-8|)8znoUsh_$bXYYSzTk#?cfc zYrTBEb>z_v2D6!0%`77vPl99>mWRK8-4uJ}qV}h&!iFQ<1MzOi|4Fu%f^fXA>D`a{ zS9XS8CYL|65?^glahB;?${bIkeW1)K5+rNBbR9Q5wEy_R7x99E$?tv@4}U@rU?yf; z0-92~g#1qpVFz;Pv@~T->L6Lr(lC9>@`OVZh>CMF(0w$;LtlGfFfUt6MmYYeDP@0t zT9`6WAWOY8oRR8r=vAARkal00^L&sj&(d|!@S~?}qdP~Vc`%Xw4SRf1ZLGGFP#=d+Kac6J2oJt<4|Nj@v4r3kcPS3Lc_h!E23@QkBdg1j_0{5Cs>^ z)%^L|Ld-&iPN&7qL zHncv^TaozlSj>JsYkw`52UZC!77qW%fx?QD#Ox`INN4O}jq|?`j{IHVZ!vdleZJA= zYqHwIz27|!+p=nZP1#DN0C-(zePdNgQd91-X|`{b`nG?RPbr?q8FthwRT!{qR;F30 zjXwRTc2RM`b^b2d10`(LR(e#YW8?#V>_(J`k9h?01fAQo?X+4gxy>YHf*tZYo^;U?%@iw;vu1$*3iu~Y0uud8g~V#9hRd!RD`%eSt?uJ|E0Th zmq9AtpEKbt&f5KQN4Z9EsftXo#~s&4RQ_O$)lz<#oLRz?*OK;Pd(p^U*)PMTw$Q{dml1~a$V-|z6BozJ z4UqmRdm-tMgTaa$;QFw+LzgBTXbM5Pye4TLCG7GH%K5d1#9o@36{s}72H z%=3T&Z?Kd+v$8;{n227lu+@Dnr&6{l9d*gO@OLd6`8;y}VTS*Fgt>t6HKzzfe%5DR zA7Rr%u*dIf`s)VQ>?7>GW1izmlOFNF$aw?pJFOGPx151FmY%R;P}y8K(IJYBSmBh( zcNtd;Ha_nfVM{v~F!HLea-~!XBw$>R4VO9miG~Tk-+$Oe$sh%^lE+%Em^6qD6eI>` zhBSZ~E~Mvq)fioKI*`&Bv?+AB+H_pI78|k>$)bb>6(IBrS%H7e7lk{MSQe&A{#r{M z8wZYOB1vY0t#%m-xMErikPr;glalT#ZT)wibd2;AJnzou6}M`@OZOx45Bzpn<$-Ie z{&lyMC?opvs^3RMJkZvBt(bv*#s@j*v;SPZn-R~cKfPYw?VaWoG6OUy){sMCfwg5O(Q(#;}h6Jyc-H$ z7Ymbd{*`3g2C0kFX`sj@P_{}9R9`ILwZ)6sLsv=kt#p1#n-6&>A`}UdJQS9SFZ;rJ zjhZxXe5NF42PRp}mhj!-s}z$tZoiWKL6i3;?x&UK{lL`C!O3QpL`#m`D)7{Uo-%9b zM(SprM-vZyslUh_ZBZ`6bB=Rm%$if5|H0*6wW9uNsSZlCY`w1{G4Q$=4Lfadsnwd7$omM5<*RJqC_KDSn`R>F zYv}6a4FX`lC`<%A+%4R@YNH_iM@Xeo=8dspzLF-)7@ZhAwjS;*p7BBuB(CeoIsLG+G^Xo8U>=(6ECOX^L8)emGtiGtD(K$d{OURaO%2;fv#P5lE=fpW6xbQYh3#Z2QyHdBO<={v+q~gdVwPG&P2%L zzR9qY^Lya3zR-;4AL!BjlP@bu0d1s&XxB>IZ+9s!eTt*mfv9U{?q`I0uAKAd-~zuU zP%%)JYZmTPI+y2|#YHoKp_+vwXIbVptkB=&l%Qdn^{K*J?RWbWf1fl3Cm4~htpX4M zGfAx#G|(6No3U1nstgb4phgVXk!7wq61~pUO1p$tvxnIAg)Vs21_DrkyuZoqQ0G$E zBth05Tul z=C$T)_AmaTljH^;v@UZ1lKvUujsc$uM3U+Ke57popW-X?{QtcZJE~!W;nejDdm3bF z%|f8#k6Jo~G3_x~HN?bNGiQHpGumX{ ze3MEJJ_aR4DUxUD16Pc!@-+daz=^Qk13=7I~mwk~H>?b>o=+B^E zak`tMKR>8FNGUS(E!?j^(cS(9J#x@3xu(zT!+J8H2>5~+gBqv9CoyH=+@R8{N-V3C zhntzZDKV>@wQ)YrdqMZF3gcxqyBiFRHpTAx%iO4L*yjy1r`Zs@D=p)jLYH*%Ewq`$ zqD1!&K#aEiMQk^}j~bzo%-054dyA%&H@m%^X*Q$>f|g`_ zjq08pnVK~HZ{C~21?AxgyN~BA{A9nK+0?iN>{@HmlHL4_+!DmkJ975ENynKU@``x6 zt=YLPiUB!MZ%pRR)Qd`0q;zm^rqkYx%qyBm;@f3I>tqdc#%j`(ztL}M{MM`OsjW)0 zbL$XWFmKa4^rF*w^ve1-hmypxS-0)>z3Mc5x9cK%$tM?LieU)5fihWz)3&p2>hct# z$dr@qUNmRvo5MrtYfj-DWX1E6Bubm5TUI>GC+vTMk-lQr>;Z9{iEosw2a06x=7fx3 zrG)ZWPbM#iYM03J1EOl)BK<3d>8jGizNP4!{ce(V&S`VWxnGth=T;(m-h|WZjlR`D zdSHM2dfIotzf$OP0xHt9zeP%@_=9#a4u_+|-jQwW3v11yHpKPb-!EwJp3P{!JGAB_}cDd59jwoHQc6If9f7 zJ+qGH)qJexx0oDUfM0eHXeh4xwken?9p3RK6f`{a%n*>T^g#IFHxJeHZNpGi+IvEo zg1@hU{`Oj;Ha40l*l^UaHik48)ByR5XdnRjjNxg6g*o`tg7QeR&Uuq)7CyUUuG*q- z`z*cG!vqTFEw>q{*Oq>^-ea}EZ_*%%p=UbLwvd=(`PwwO@RFhPCOmChcA(tF1I?!41=~5~=5$ZmBkxg6Qz~@b8$>-{Gfj8;(aV&bC1h z0-!qIgc^`P;3GH~7f26(jwlqn*B_F3%b(#dt{R~!twha_3zYu7(Y@;TT9a3a-V}>c zqBcd(zz!cW4_l)h^IPA`09K_+p_DJTwYe^?l$A&>|8e|1cb%@c+ zro zK)C)ll-wbtB@lkZ|68B{Mo0$;5jqcq+cTy(YR7ESR7Es{v&?zdlIIy-RJ<|ds2P4j zJ@6HZVnr?~CkycD;c85dhZRfVu~PK;nAF|)nP@7%4r?PQA0qgDCx1c{zdjcGh+Ryx|*E!$S?p=^#?!*mF5UY z0zs50Ot8B}_7m39NWy~sKo38u&`=8QxBuBSg+6srAN|O|kwxkaL95UL7-}Av9nYd9 zOxTYB>@_aELhlg;fRMJ!O}$R14-JN~Ca#+4urI;(3gi@Q1?U^P z1|h=e>`7Wk1EHVHISo@3+&7#1FmB>cGfn9L>YYcoOA_kcLRJeB&>g=07ShfZ-@m*D z=!p%nH87dE9&FDPYJi%n*!2di(h=zXJRP3^p**J6ra?4AIp9IcYSx4;Ry)8cJq3v3 zQ`k1unItY&{+T!Dikc@g>lG>;^aV)1^ColmFzY>5itCFM-0xjq=~7|=iXQj>0rB^5 z3T8+Lq$MQ^?q{D=N8-$GgE02D8A#?_HuD|=`_*sJHxVQwE|>XzCcRW8bYF6G$Nby% zUp{UU$;`k{a989s>y!ffWrQ;rH?L3)u?Hik)1Mh~!RBe0wx*@=W&1W*X@ z@e25=>o-+NoccGb6HN0zK5LNs6v+?_v5kzl0{W^>5tcOgc0t3r0B~LOJ^dX+RUsL1 z*KkNO?MGUNBN7Y3$g{~}FA3zQHv5Z5D#01J^t>E-)Zjk) z3Svv3tWes?60Lnf`H^6PXP%jLASnRgus)f!o!IvZ_Ogx6?ss=v!P);kRV@T3oX-*EYz;ucOWM`O293 zJ@FK2i`&U-_szGICGpiF&N`c7DRvfzsoyPsxl?tnm!i!kgRa_JPj+6jX9+5X3pRbJ zw%HJ?s!rP7{KA7X^7R)<5gY4eIv^kUXjh6D>R5q*}6jEf>g=><8&@{6Us zm4&gcV`s7cdb{B09&W*Di}|yHOJlDz&qpB>xikwSYat)7i9Fm=B+B;u&othek|->4 zUkgN`g&=2TN8nc3e_?fr6u(Y^NKZ;htgsaK4H5+cdgE6J)lvP6f)y}s6)!GxF#AM) zU4RU4$3+4NV|&#vU~?7>+hgFMJda@^qdxpK-yYYe06h#aEMgwdO`$|o|wYhl(3_3Ot^TPb|-cLi?~arlQ)Z@>gYiaXTutwztLu=>j`&+-4%ZJJUsP&&IQ))rLa8 zxkGg$jN4k}<=)eS!5*4_lwe~W6q3U#^8zcu@eHMnhZ@WdeI!pcpduL?jUqX{3O_lnbWwvGWo0!b)E>O7@G|F&k{^Q%&=j<%IdC|U!Jb> zvB_{Dp1d&3f0Qs7Hc>;ZYzm?OBgyzFOS~@lEXO>f>GcTT-LSNb>LZI~@ zOK4hS{}Q1v$_=mv0?UVpRWV1N!SfIikMYj`cy3K`3jUy`cz_xIA5I$uef)Wnh!W+& zDFKi`Fdzc^VPH+hlYk}pF76!audxL!Yc@}CbH9Ii2D(fT$b-DcP&$H6?JR{0>hFB{8 z62AeJ82T^kwJoyd?Xu`^#LUH>FQfb&x`I8|${2HVb@FVIDj?aGin~0uKXUJeY7{wi zn4x+YToc%Hbn+ggYPr09p+hV`9kQO~4SQ)vz z9a0@Aef&MkZ^U3mQJVa*W8!FfycSle@jHB`oqzX2_jql!Wp}iB3tQ>&QDb|v!0yQg zs>EVIP?aM8>rG&kx8T9?Tz1;21VsyQ{A8X~k!oH4%_&A+0R)3RGH~zsj zPF!=+e2c%2JIY%do)^|XlhO4^uh93~hYZyNu1_jNSN$l~Q4=ry6Kwq2cL!mwcBjXF zb}nx!Zqk;l+}d@@keiV*X)${L^Si1jP!=`B10eXj-02A(53{Gg34|&SIhh99&3&w> z|1hzq`aN=A>0cQdLk4SsS+DXJ>$>c+9xDC(PIKS~X4Clj-H0=MWm-!5=<~O>Qm2Rq z-|pR&etuQ-`dF<*dyY=a3$iWS%$qZ?MI- z{Fi0f3T}jWh{cXJ4%DrsVNZcQJZu^d?f6SV?PGZ<{^6hK0D6GJf_X8N}IQG9MdHh+ppiv|xC2$W3a2^;@Ak$ba|1

    ryTc6^ua}fF9|l0DmhdERJwt6R_KMc3Y&t0vi2xDC zO_2}_EG8&+AKP9iOIY7o*>TUlV$*N+=w_N@onsfysgzMS?>76?62{;BkAOY+VQ`r9 zqjO+Of#M{#(TU}b+PJ0Cz+7p(TnpJsm&_s){;Hqn=|D^LK zURKM?YCM?fJ#Kex;%RtLl&+tn-%rn(>utN!V2G`xohPfO$=~3;g?ieFJihz&-g}e} z)MFBfyl(!7&?^3RsfQlqN%-PnqA{@09oEbJQ(0gFtTa7PM=5 zcvB!pm^`f#QL$<{R;9_jmW4f2hTNBhX4SsxYLzXcLheU z@hf#QGwtiMY(0s8>eF%k=E}V_R8LdoZ+JHZI!{)P+&FHq4GF!K{MLWJK<}HuOD@;* z@hYC*BU>7&NA7P zg16plsM*?l_WZbYcfQf>9?yLZ$ktYTyLwA+_C{ZyyY`BR>(8ly^*Z?e^kBZ(Yg5MC z-0hOR%x>*+dOSnAD7-jTgKk5A);ownn!a{3RX_7JGWsz=A+!uc(>)$}RO0x^G0b6_ z;~2&vob_KQVMf6WBil%J|B5aSa z;a4t<;N855Cu>&s7%s0JQ%1!jun zP$fdzT*V{mY)rkTKnqHvY#`L1cNzV4d7$r|s3ESbQ;G{O$}41FdZ*mQb7Ts87Jj?i zMA7m2Uwa$e#R~1)0iv`%wzVY1%ToG`0~hy~8lJDu^K*Mz-Z#wNVLqq5)1Efbt;Jvf zYVa5R9ORgNuX~mEd&dDOqJNm|9MyHJ$@aRfv0h|>(2kilJ{)V=>nJ*+G*&el|gVz zdupthvSOFnMT(~c#tcyLnWEBK9zg(&2N(h5H)9<(0H73}bh|Jm)ypy-N%8j{t`Sxi zOd7UXZPtZ(v+}IETwfCoy&fgDe!;t+@!5=yw3MKxh_2fTxp)SI#@u_fW(-p-DM8CO z(i=?6Re&Ca+8&$YR=xeJr7c8{(cqMbUPi1tKZGXik^Z7j+MBw( zl?_NDG=ss(X@+J*oT`v|u-5L+;uOdx&Xz4?qY1)5qE)lPl@T(?WtfOYV#&HeY$4H_ zIqRU^IB>prw#^gSSR&TcShP`)726~l(#I$&TIdjauy|67C}$+t^w(fH)+Tb{VHh*} zDJBaGoBY>sO^4i>8M8>T9?Lr3gd;R|ktlfLP+JEtXuO_dDkn15gL&@$fgiLmAMXOm=x+Qptpfqqt%MLrLfaGIYd9qI{`>JjEVP zKyXrn*8<0AxU+xP5+x?Uk&(gGDqqley?_ALZeDl`fvRl&23hD*jjCm-^FruV9DIt< z%Z?!`#|riF92Z-GT^RU&UvkC1b|+Tve6gmfWd1fy$R_fZs0w@lnwhtIT^zislmZTU z4fbWD5?L>2J>XS>>Dqp2r<3%PC&=JhN;;D@^RQ?(H_i;yl93yUS<8Ov&K#vY9jWMg-t z^`Uma+ibF$Q>r&c#u=m6is8;)GXRe{GPlZT)2d)w!NeQaKA{a$pJaA|JM6ghb!mBO zd;xrPcDdHHGBtclshGqtFATv8ybUGf9wTPMhOG*`U}MC>5JmOWP%NyrCuA=v5=#WB z^MfQDV;@*ZRu%9dV`u`o?9O0@4G5jcGZIw`95bCFv%wRXo@UuFIrUaG27iM6%<#>Z zML9x4oGH973a*h>QaUVcxd~Jv`h&&xdJ&jnSq(Q^saRf?+qN9w7;Xnl#hSeq!F5>j zWPHdNC2MdcIj@{NnX3rZ=%sHJ2D7et67-`^_k(fGfv~V#H5sRrgGrZ4un$hA@Hapc zGy>>S4R)?f2!Wz2EmgrAHaTY2!_@ggKkxQ=|<%3cGcj)qV?3omt%>Oojr|Usl z+42Lpr zt9B#IhIDIP^}>pV&9)W8sfM#nJ9lN(O1ss#%eBk4%b2l$p<~@C{s(WI>WFI^>*`O_q+CIZ;b85+{2Pz?vD$BO!+%+R-yd-rKEpOkwV6FRF{^O9N^{cVN)h6}Uguu;EJw1cd%y>b zO3hiq;IhyZAJd2-7*!>xKwqTZH+Qfgowmtc??svZ0THTvAA1=(u! z9=n$yy z#9vA5cGwZ`$Kdz*L48X0fjp_Y) zpQ(UlYdZTxOF*=)$Od-&RK^*x2&;#Vt@bnFZ4QmfLDM4p%oXd3oZA&}$^4<*&Hjo9 zXupDR#S5g_>gwv@glBl0GIx;*>M9T%H=*}3uC{)>sb1dtl8C|nPBr6r-}~>&rb67$ zPCI<(Vz7kE`5f}#PIp%c-#XY;LRZBei*Wz45jQ6_4r}7_5M{PSs+LU&A&K<~Im7Z; z9wHti;{Pb6jR_sYx>y-B@~ue-M-lFlnW#X)*K}JHwkSjaGav)Q2h%{dV`BgUK~s$E z8B?eM>aFujNHkw4x+5SV17h9)8ti}Pd6--+0=IO{cmWGe&bq z+AbQiYex7``j961_hkaVq=(|8xI~rccgT|zj!Yu-fxoZ_7XAkTze5f6l`y~N$D3Oh z^=FECdO5520GOM5P`i&~Uj^1na%Z_+Bz3(*Nq?+bCI0*Nhz2#!!%Kh57>oV}Ck_7| z^q$J(1N^_={Q)Rgy6*lLgoK0re-IJ^9v&!q8B;rR7YhPL7AAuKS^pmng;hC=EHAz*mJV}_%5ixqWC{+2k*Md5DvH!rgi})8Gk+FZT)nKobT7$X}~-AFW1Y7Jb-U|)uNYI(gI|G^6P z{}_7*9?_z$OS^2_wyjgPZC9PLZQHhO+qP}nHow!!*PTw@oAgcg9~e8?b3b#;wdR2S zh(@DDP|)}en2bpPzEpH4nh1H9!)bU2zyzZ__@DBa*;)QCdCKl~#su_oh89Xr)=>1a z1dI#}|4X2QqZ0uq1JnPJ&&0|2|LgyM%b(WNQoDK=+R2}uz}k8mr?!;BdpAmQ_A26lF<&dCzz*^bXka`% zM@gPeQA=nLxywmPX2z5&F338heRAZ@b8MNAfFsTgpT3V!qXUfuR-ii#1LoGJ8QBkq z1;|Z&i1}rbj|7g2+9ceQB>V}O6yZq0e;=p^P=YDFUMJrRa+6d(;Bb(Tq=1VhCrw)z z7bDss1>Jv~_$Wyn6oM0ZZRgu=otuh?( z6po4jRR?KHgtRA-*KxoQ(uac_=o3(+baQ&qC~k`j9ANOHk}U@64s%-roeQVu*pte) zE5kSxS6l~WHUxeS`{(4Yfv`6ssP-`frjXYSp$CUA$f1u95u~~cNQQm2ul^Ag8@%Q$bGDk@O<t_@$OlPxV*bu_Li;o+yKya}`I4}rnM;5LVe~1&)#w8ol0j&>@M-uZXta$zX z0xd^vr>Z<$Ja>BSnpJh&av8KHgy9lCt9ez`UrD(E!L3|vG`Y2gHLCFFZZEEIeb%US zNhSaE@RE~eM7Hl{Tp7XkWwydc^;^MmcxdY3-4r`h}RW97B_$(m31W_0q~tsS5K^)PwZtuyd~ zy)6%V40$UN*5Yz{(o1EGf zFIZ_4w?n5el`2N5g>XYRK>$mtDl(!0bV$}c5Pa3aH5@#!3aH33jlJ9|dv2Pe#pUI% zC*t3`yCTkz^p5@TqQF`d`CM@ZKNBa$+?EAuhA(F-jV)89ajBQKA?jNR(%~^@s&V5? zPsQ;CrJn!uD25by2(C(N(;CEq3@>7CDJB3vem2>1|2CUzc2%vwGl3Ldp<<*v!>9%8 zC#N{Wo`E!C>?g}@9`Ar4v|OIgzrDR1ad{t14Fa7p5nvO6I6_jOW+(ne_^JOiM%~$I z*AQ~uvZ_^aBcR>45^vz-;w}IA^GE3L-acM;_C6>8ClTKdoOfz?F`3t^P%da(QN+fX zZyb6B=DFSMSB$ho-IJLvX*L4d@K{rOuYtbaZuwQ<$9H-L8YXkHotGHI)l#QCZWkS* zs;chs9$#4>V=fP8^>YCf>3nRU+fV*;Ws4fyj&MUajej8fjsV$?U8Zkm6Xc4B)Q;A7 z{)AA*e~QFDn>(*A`0RXqJ&BIJsBWMzm%aBVBCoY2%zG{bmx0+$z(n#KNd;w_ys8$0 z$|PI;Dm##hfMI7FeAyXmP>%hTam!5Jp$&Y!f}P!J`S^3ALhB8-mwG2D<+|(j#}lNW9_AcL8n|P-Fba$XEjv!ZCczps#8_YP zCs^c=)jOQyVZlZb0vA2mC0ZLjOzGj!5dUAvj* z;fpuHOS|nM6!EV%s7KPIy8`QDWQl2e)??~<>_sMPDY>Kf91Hkj$D*ODasK3@J5MH` zPhPQmO&=k7d)i(UA|&zI8tRLX#)c6uU$yP<`|+`f(}v6Ldtl49h003g>^H&Z$hN{w z8+a!fCo}h>wyrFH{$O85@D*N#nic}%+cnl(o7Ny^pNk%XK+H&@`6f4EPA~p-b^Y@6 zl|BOxTG^zdh;HQgwrSs#H=IbJ*-yYQttd64D>{za=Tk69>c3#V9y@OX$~xGD2GX4{ z2O>R`ct%V7H;IJGJ{rC}=9&~j zj04uQ#H>rbiSTP(#1B`~>z7TmvHcSI^<`S>;EtYy{#%n$R@=VF(Z>$vpo{mH54l=h z-$xq<<=Ng^U*AQ)_n%>FZp)HSXsz|CQ_se6iB0(kp8YTPhF!dw&To$G_Z1^HTXwin zW}|e4XTz;rVQ_-!*wMsp6Z`?0lL{GMwgI(G`k(tjx!tN+vcq#3@o_pKNgL9lgH*zI zNAXzQnAfGs)(ak@lo+l`eA&^)7d|MkUCd{VPq!ztL{|Sp69O%g(62~F-{IXuOXQ9r zaN?ZX`7+0PhMxQJM-KR#RdCxl!=G-n9M38J;DqSI=tu>*;}|yV-fU zwf)a~1@F)YmyLU;hE|^_mLeFVtrao8`#lk!om?Dzzo$ipS+0KjR3wJ3+x_5$!?g@) z%b@_LbF>K0Y_s?;ksB|6WU`x^!w2-%J^vWz%uV5r6z{bV1p1o$bPT1{+{3J0K3n(b zL;FS@-yYA_s7OdDrV{1av9)cYzi$*qS8abu?U_^Mq?mNsdOL$8|8}BO$*o@+*Js}iSZEZ)c5z|us1AQ=nBXF`q?0h zqZB*K?f#;Z)4oR>?H4p*;3D&X0zC^S+y4dh|GQsdX8x~%y<1HxagzK?GK`!&Br{9I&teCM^}E%X)=Xxh*3O*YIg^ z(~W&B7t*gI))&&qQ6VO##kpVW4SJEbb6sHah?P(`k1gPQ)|1u3x8@21Y=2q#!GMI2 zYKDsn?w=XLehBzHTKegyFiu2??`JXHO=xwMvZT6LM8!kZn}vN zI5ej&piobws|kiWaB$I!8C5A_HDgWM)=O2 zZuSgNo|(~{R*b6mJ!nT zgGFgg?%J*irsQk?0alBl4qe%6*CWljR>4}Ue;r^cLuGqedBfcygKWZ*lkp@ZzQrjG zWI{-DN9h%v_?vdJPcec`>WjydaHZ%TZ`_Od$ z!A8=>ohA6*z}_>wlZ))MSCl=f+7me0hzz>9JNY*XA?OqUD2aR&_e~l4NLcVIRFxaB zTsHeYYJb4ZxIAxM+Fgk5gWy?uj6@p?lCGI3-EATF>;kbQNB3Xy-flC+KwDgdR=N;A`-s%`q_Mp5w|BR@ zUE=^O@4C?4$Q|t#Tkp{vzRB&?0%$Z0(Z~uxrQSM3HU9bAUhl$C>(ZInG~EWD|KMUr zZAQFV<#+n)UTWX|XOg^Kt23;VP-7RFrOE9!UjyEQ^?uXRtM#e3(@X288`p2M20RXRaiqd6I=Hwr^0K`$-?i4?F6jeXjW>%{{)la7q(G48Ziy%bh z12nVdj$Lc-hlks{tf{AS|Fa0QGX94m%*4XP^52?9%NkOSM=gjwmugeA%I@O`0J%Gf z-Qm{`BH@h*hsxIHdGoRG+i7l%n?sqm zwg-{7t?=x=Uv$UVXkrp*=$WCT(PM0sv&1P$nV}w!g!+iFHoo3(_8E=u2n`%Dfu8~y zoAL~JUrWuMvUnawfyW6lh{rVOZJJ$>oUu@{mfnuo4@CCN?t}rv(KtRTE1I1H@IVZ0Rhxzq zIVKjLq)MoX<5L`Q_hS-VI4&W=%ZR@`aMzh1SYj}wQbL_94&ASoUcmn3c_`IFXz*{9 zByQ`e8ch`zO`R|uOeFA{V%CQ;9k{Y2lDeyUs5EEiT3T4}=LuM4^v|1yh`4)x(Q!V zz+M_f#Ukctm$MKAIiWvNLi$)b3QabbCs_MA8IuI?H8MbVVXg(#R)NcMBgy8}ayCvNgAv;s zdE`m;-)Gu@p*yT-vU$;nwv$}g66B!3%@evHZg7{{r_Iv6=!PN=7&WcV!cq2)#U(@> z2Y4SxhVz*Z_WE#4wXKS04%XJVT3R+GfChNWw|6U&Nuf;jdF<ZEWX6?^`YFIgd?4EXyh!31}X-k-|L|Bg##VOLz0)gm-=tltyuEz;{JYzCv z`QuSCxu)rBX|a<~^K&UuKUr)GF!>Yo5a9!8esXgntrb9j_g`4n9D&@@6YPs=G;7gL zlXkr^+@?Ao8Sg^|gmWOd?_bK+>$>(>!i!yZMcTLWuMO<$Y`0!A3}PHryMJ2qGfVWwKw*u=~ah~?7a<> zW!2LLt>>7LyUNW3yAV0s%zO1voUtRe*Mc#4)~ddoXbdH4&{85rI))S|@V}=C=rm1* ze0z7hn9SK{)UV=TLJe7((xG+GrL6L#Xifh;v&&K6^Hz^nbpv9(t+*#Vel(ZlU4)H}v&bVf-`XYS=Nv_L;v&7wQNP+w?AQRu z_8Y-!06!in)zKNgQoqYLI35SiVw*{%M}K7GkNvA&+d_zx5GIps<0a08J zozF17b|jY8W7L8rc5$Tw>hYpNTG+7BL83(TIPMmICtIuSh(A$~M#~MMHxx#1%FK&*eEg(8po)ex|6YFi73ch}s~Qmu z+|vyU$XYwD8qj-En`GU<*Gsf%8FXkl;2oVC#k-~@&kM)=KuYBu5^;B6cUGSpM-kFsDcvRov5>@h)nz$+UZ&&3^G7t z=`vXB=Nb1R_qXi>%IGS`J`e0;;zW_QKU3{m-;_D5aq`?&j}zCTsh4W~t7d!h$W{83 z@o(zl`96BczeoslLvge+<3Yq8*M`p}UWLvLCD?EyQ+bY6Bl&=fPFK@N%_ms&&7b%E zlSkM_L8h-_(!Yqnuhnqu_&(9>ta1HO@qW~A>rA)+>;#DYLH3JQH?}`FKJ^j=D;$0R z9dug~pxSqoTT>D(eLEs(WCbulBthC$X$v}Di-hnaD@oP{p}J*lwRCmHyA^w$vO{(3 zZ3+^(A4YxO-^m~#cV}`*5c;*-KVZ!e&G#p-PMHMyzyo1e8#F81m)m$2iK0C1SXkaX zGW!)2gt*VPk}9RKgUZt^3s<7;kG0r^Vyf^}H!_22BYfE*JSl%219ip|)N_RJg5=)f z17YmVPkn*w@wwXn1IV#({LgNhiIs!nzXiEsjsMk6BlXPI&e1w05Bt%_S7kL&j_y=P zShDA29pDfk5gUZkKjz;bt=jhTD`HK1Sgk66`@%x_HG%cOfDP*>?OZNP>b-&-Q zlI$4yU=_`uyx1ULvq_|V2xQsXOit(Os;!^gSzuoq-WEzORrcEaf)?)2$|=W@XX24- zX7u)U`wR4@*V}fsGyum$aWg-_bUYXX>Ea3N^_q!hfNIVk+s#ql=~*WloqA(94^D#i z96V2~z(})Rk9iwY>$p&OFk_v-b(BPZ(9eayS)GDY!JPFeABnm5gnuz?-KPheYU<+H z-BglnS*acL;yANs{1k&DdJ5S2z-&@Ld~-muX}y8DPc0t6l^WzB%h$VF;itWoDX*z- zv~&FdH*@Y-Wo`1nRGy0msz>)XsIXLG+LkRuaQ&*@Tu=ti-X{zD=8lw(~(slf5j(ag$TbApL1saI=e%Ddd` z-r1apiKTI1X9cALoQrl%cfAyqo=#y=IR$s!ZGz8}g`oIlIX5YCuXAP^UPE&5`Eqs* zX~@nUq+$6egc3sI1U5Vgy`LH1lNpAz1}2{;B#<;QJI|9LoNo?1UhGG^NgsL(Tq}q^ zmn?GT+bCe--C;iNo*z~~3vg~RL{0YVUC*{%*WkbA1{jP&O+HW@yY8Q`o_5+^(GM<1 z17zZ>1J{yE#-`BX_m@T9SdxwNTp9jg`t0ZGui;^j@-q!GroCZ>a)e*zj`L4eBPy`i zoYV2=?GGX%-$(nyv?q$W^I{<2X;*@F}tix)3`#pcChuk zR|zF8!3;^)rUr<8by@i|z_DxCFk*&sqz-Z>cA z_7Z=?1V0AP+J%DfFPtH^o&t@HsvaG1Y3hBczl8ZuE(kh?M6>( zyW(xla3U;o-3PIwFyRPUlgutXQ}JDf!NGJ91h_S|F4N;n#{v#cUSuAW9lpG?{scl2|?k^a~mIgA*i8<+A2xP$-&=ut6aa2eG^Dn}MP((NpY z_A!|!{Y2D+!FcI#Mwtq zBNQo`L57n44R{*qR1!OH)08nVgJU=Q6|soK#x!F_N8nPKA=@WJLX$7{i2_^P$s~fk z=8J9n4bfAT{~KQEI?gE#X{^Jh(745_EuWGeQMLJ?u;}qlTEr z_%q-F$hBR4A=KmozT5R#Cf z^iAu4UHapHMR?8@zXTYpLT6CWNCmE-;)W#Mud0&7Ktzt#;(MFeTrlpiF^!OABS`yaASa6eCImiMJX(vRG!+^T`Uyn>;9zP!0lhv>!Rx>XCELIK%><_E#(%eMiJ z2;W0sXo9Hn`n@&s1<7*J?8WnWO%KCEiS{)f4kyr2w7&_3&27Jt#=_FayUUCXaL`Vs z(y-=cgSd2BK)<#bdH9g}4}H3Pj=s2DV4oCj@BG?-8n`n^G?|>IW;(YwsreDzj=X)= z+&P~7cI?lu=7&Nb_Dm z_-vP!4>CB3Z$m6Lo#s0t9t30o;u%%)2Wd~|E?flu3)!8=3^L93m!j$<#N^JYgueG8 z&7sW$;T5aNtpN;tMHOLPnt%m|K0>(FH-tSJ-r6|@2aq(S7ZLE#S!aStNcn#YsxhC{zgdbw7g&G1#-Kyi>Q8U7%nnh4a z*PJjxPcCMd_~!P|)Y_XDyJyr~v- zl?#JP9E*JmR=~@G?nN3S}uB(10=8w#p zpBI_t7pgBXD>X@ycryXqpU8=bs+ZmnUoJzB1P1!z-ql&kq4?_g`G{~%`%q}BQ4{;E z)y@9U&vtJ2kc*9HNZ9~DvwbVZ^K1tEh&NvcF==pSkAC#b&8548`!h};J1$_SA^_M@ zDWLygrtY^TH1}3IFd(3Vci-0p{HD$>6l_$*uwtUr;iHO?_@LEownX7lUcbV^bR_dTmTen=2oZPTC)0OIufvtYby*`8CCwq0mZb4`so0+;NSk zKD5<0{yq6-Po4b42|@@g+WDN^-B|Pisb#ukhDhoGt*iLY&J~AuHLA87MEq)M;8`r! zGl&!gzp}Wnjzpa3i5P){ZyQ(=m1(q}_0AS5jVx#p{yI)l*?qHeUhr}w&~xoXNbPMD zw_%XkfOx6kxu)h#G6)4kGI4YRu7y$;olgi&=pOPPcSzs&gj+>Z-Om`)ER(o^SWs?~ zy*x!ooBQI$cYKcH4gdcDo2>r{Hd$CW|6ACc#+)68)jL*g?(WXK$-#? zF+>9POq=poRYG&s+?M3KGVAfFR3G*++i)>)L4$BIYfz^_yVOy}*aA1W+o$q6_#C`m zzI+Xba)=+NfwFlONCFF=2#Si_Yk~3E>9W26U);&`Fx9mtE@xwxvHmP+e&(5W)>+uw zK9v_SS=|I5`6`Mnort}*Jz1u2{S8_?ST{GQOAd~sDj75rd$p)!YOZJXITl@f5^e2e zgJ;>nWvL#xuO@6NshI(x()u2&jBVkYE8}C>QD}W_SwTJAsIk4?p4%)T`&r=hRY;2z zrrKM)cMXu)KWT*e+g54#EF!cBQ8_hnz8s)UW@6)OnsX@Q|wItZHIKdbMm|hP9&uNr_Ehxbr`(q<#bvm_Q z^`)kHFdo2h9;z;YWn&9ZdQ!}c?+hl+`ND5}{wcKN3a63KF`XgRPCqHA&wBMx+y)Qc zFS?6ZeHEn3-SaVpKsYk*1`T4%QVSEzBjU%zRzG7nGk=HOns2Ftefb>=Q!O*`hO5Et zXipyvCdTl}gSXg9TFi7wMlSDDpta*BS|bP22DCxKD5N33c;zbNaDIvOzP$^gPP9*s zXPaYd&Bi_3rEGQW51fkaIR2yC6B*7QYgZOF57#`zcG)EIJn_@@>T*v_qP{ssT4=!j z0x)}r085}jSy~3~xn+H>I76I+9-Gol2bIp77xOmvrE7bR?v-NR=MDE_U{@4Od0dTv zH9VgRE4jgVVapi1{DpdeMH4x_o(-cNh^O7a8VuOO^@ulq^3wcKzfTkHNqi(4)~(6fh@SUDx8WVo(D-9|Q>bDO%Al^N;&MRDBrn`0nTWcItGn|fG!HY7R0qhIe4bl{t^wt|4!eF8cY~*1Sb+HYyQ8gE7 z0sMT7$;CwJX$jQqQbQQ8zx4@ThHJTC>0w?syqvUMo!uV}q}eq_1S*6FT@Z%p;RRs< z+xHizdINbuA`I@W&-3|s@pciL6?==za>|r6$J_}}B3V4NR&t|+ZNhQZK3k0h6x5@- zM=bkUc>bQwXqS)^R|w@9Ev%>@CrD0(4t6UxMS~RI??(O5-*6-%SWu`&JH_)n3G*U< z$NdKVfxS`QwSo9&q|6W%`q2RO8vsHt3mE)TCPc?78uDKdkYG-H7hTYbh^ChlH)52D z1e3w+(;y)4_c5&}#R2~9t$q~I87nFvLWi1~!Zq)(neI$W5;BPA>6p5;OEm&y$B+Jj z^w`4~7oT&{o*$VRU1(YppuMig+ z2|MH>-M7pOu&lC*a3n6m=+F3dk%5_?*00Ut85JmZ!lyC@Jp;(#5c9XHU>hP4%V*SS zlXf3XGI~WtlI3uD#aINVId2!&z6R|QWnlC) zVI3suI?#&DmojPyc2a@7TMn+LspN)|M=hsYu@JDhM#3j`ba*JWudVYxXE2|S7QQ-t zqzk=my(#qT1s)Pr7sEfA;o~TTXAY7H@*#R{t0;MDirj0KgnA71+C}SSC!YUa`*A+) zVz+KSW@+4NE;7JeNn&|QQGqdtL!4i#PIxFZ_R|th+{`W7*}Gzt%wc?0(a(y z20P@knoV!YWEjv{c#OQuiPd{9+~i zgQoHWbqZ8^otJLvqlbZIpjBn~=|{E{Pf|0KO^~ehkNk2x81h>kr5I{u*?xUAlx-(8 zly)!uM7znsa8ES5j<*0#(>V8wjRWq?_GHh$;}mts6UxYaAeKNI3%D6#V46P%o7;gk zZ~o-i@aZ?<%uHrnNz=G_IA5x}jycRf$C-oS%wRD4FOfiso-n>j3)>lXJDpT8!wl!t zaOloxbh1!`A|zF}@56wpxVLRURT(X-@>03qqMG_qQ8}$o=fb zP8R~mz8CjbD-V9JJYe>aUYd2Bij_p-T}=X%V|lQsMNo>Ei#(ufNImG z@iX*Pw!6Y6>(X&b>hCv2+1N^6W~Ig!@fruS-|jTJE`&3^_zj_QvA5F987}ks!tt0* z-v#V4B^00^8&^Cl&xDx6I6JNaKK7gsX_~LwcgP~^)hK$YI$P@p-G+RPKvjpdxeabj zFu<_?a``)4*?LIsrEV7~4)Bf3Gp8T@loRydNm>6DyE75Bne^6cxPr02xFFfO_QK0B zMQEjB!!N@c0+k7yb^kU-eotlh*&LYHa@{g~xUp1(`VIEC1@ZAS&Xa?b!-S8}Z+4Ot z$yc4gZBwE$3af?a*#hiQxws!NW7Xb2TyqH-lm7gI5}H(1!y0XAZSHIqHO(BF^O7*d zWg71ZA7xQV<)(W|42PkdL0rBthC-C-*Jyne`*t?6=VA-UiW5Q^3LXD)g&BzqEF^(9 zar@;{`uHqfqzl5zpU6iW%>fr^W7oKHbM<`ID-nMy{||)6&iEhfLPB^%!mURcQ?XfT!*;N>wA2T!zE{#Z&9@`3c!^&f_fMXjl7scgzET8;PbINS>#O z0-LdXymbiVbdhko`;LCUewKFL?wBW|(4f0#aN{PhNHtBR%Nsv5$@#2*EyKO|WTqUO zaCsD5k~1%RixD$-HJvjeZN8A z3q;}37Y0W3aisS*p*7)Ps7=QvzCi<=*FfuqnGqFurZR0fw6j}G*-HD=18LCj zM)8=*x2|j!Fv$cmhAUaVjIo;xcX8^x%<_Fs4tUjpZqZOf-Hvg0JY;xK7<&Zb0MPCb zaI|mXSpG@N=OT(N`cuQHRp7GXBHSFe?QDt_MRC9n#e<+C=Zh5{aT7Ucr&lBsC)67K zyhvzx4xwGme`R&I7%L!!x(;BZV@KmfXls0*+^=AN~jMv?lMW*JZDCDi(Wb|evHTg2;8YBuCZje0b_lPN4aHQW}8n4bE zN0i5^AeEmz-`X&Lh!yl{0-OnYG~RfodX!bDK>+$5M=%P&KQB8dkK*=O!5cX`{pDI) zp~Lk0{V{2t%;~7G#bfFkWg?@^4fH9XCey(3d7RV_nNZ)(a%QKH&(3mgYGuEv)IY9n z9V1*R6_#Ef0cuLBDd^HePYLpl+LmNlpLNoZV;ZaO5eXB_4n6F)E>$`xVH{uCQBHry zt2vz8Ac(=ZdLcJwydBA;sUf+%;g5!|s=!;78IyON$ddiRkhRrIbd`!;c)YU<8kF(C z;!r^e;Y{US(_s7pcO@D8lR_bd>$TetZs0XgQS1h#G-$tNek1D0AsdU(bg}FV&HF|L z`H|HX;}$iT5k_wjS3QfE%Z1e1-2%|Sl2Y(&aTiB|pH-D6tSD~j8uvY02C)^0pBiB= z0)WBG?|7!7Z7~Ys{N_avMGe3WUi7y8AnGX>M_-iT*FZ%Yw4J{!u6@W zwzufmN6(K>Y{GO_&E`9?xXdPXF%lY_kbCX}_@o`DA^|;Xjo)TpUG07j4g8SMU(M)N zdyQ+A6bAxNUH-WEzr}h7Vx0DX4jPrH1Nve5Cw3tDLJuJUiRk*TFD?idM)xT|fRtJK zKKKznX4$&~zajIEX%CC(L0B0wxFzRtg=Bf}Y8(WKBN#sk@_z+5`P%C+$qwr<&4idp zgwN3sx_&Pgq^dy+>Zd3XC$_6W_;}eEWBQZr#e;naEgcRPa5(Cp9fXd}*#lvc0!I{j z9)c{}a=3@eL)f~#UgV>W6^4%ZRx4odYy*n9Z>kjMw z<@x0mu*W~hMLw{2n$5b%y;d8z8#?ZEbDatq=8eAl_7=nlUn`!LUja+=n+1|`pQ%eL z0`xSAKz!5fknRl2$|!nT*`NH1lgsV{?+nrQ_s;a+YPWEeU28SK`W;}4oAPVu=%T=Z zF@zs;5NbFhn5dsD+n;0XnN=T~m!{_P*_`tTB)gazBO+7NJ9P4+blmR~kSY6`JQd7+ zdYS6iH*h6(yBl#t;O>#V@jGs{{cWfu_MZGzIUJx^IoI5qphyz`-t*(RaH@Fa>uvhp z2P1eZj`U*V_^u8SYa)~u<2Na_M6b5b(c@Bq={#VSn^tPSIc;*kqO4QI5RWq2$ELg+ zy2a|uLf;qP!H4REKem| zNS!YSojE;zfIfrEgbT!Eig+Ib{ZqgEplb5~7o?L-uZkeP5J-4G%0)sLtq4vvMtP$2 z*^7Yh>bc<&zR&*qDxqO8uS!^w4m_m$D+>SwB)UPGXL~9to5#`E=i1NL<|TSI^%35P zOf?e(C{4(kcc{4^fhW~m@S&gm}yTo>vtydo_pzRg& z7)?b2m#l=SQrQp&eiq1ne}jeeXBvF+`*X%9%gTm6Sg7J5?%s_%=N9vE+F+2qRqk#0 z*W~l)!&)=fi-Y z%eC9eQ-z4IE|SfTTU_X9gxx2to48{6u=tub5Ap?00|I4aP{RoMwY@=d2ZO8C-pdl_`lOJ zVWKTJM&&)4rkfhPry2A71{dYFuy*#fMFTiGe zQEb3q)f<(n>4Nj3=8^fTC8^ylU?|}WAl#KJ!Zb8)BYu^_vNmWMH|I$59sK?X(G~<9 ze3D{qt-u>l0?Hw5sDyARZa$}mHe00mVkXGhjcu_bWJD;NdXJA)&}E~3HJwociCraYcB_UFGkD3sW448 z2cNs6I>*ZV9Le0c>h)8b;-<1hAZO#&&=p2FjPTQfhBX+9o$eUQIZt;iHx&hUyL!FF z<~|vZRgtwIQXoekj29^&`fX$DAhgj!20Wc91u$a9HJUt1NBU57#ZE$^Wmh{As&Af~ z#MVLlYOps0jy(!!p2_J1q141Wl)fb>g`iKR^Mv832``<%@qG^%S4+ykQnma(@?dZD z<}cvou~M?N62t+z+}%In;J|lX;aqhQ6V-+~)O?r`FjPbkKZN9>c%wLt($_azTxVPUag7r|ZgcwP8c=AkNyegsw*a^%}FERJp)?5v{xJga8zWBbF3hqgLf zf+Z(sPn||U^Xt@N`MRDS<}!GcpG2950wE@b|2clRB?pF+-O|Qb{gk*3y4-2UbW)-F zvrp{R#GNRI2pMAw>i@WwrJT??J6vM-#bH(kB0 zD#mh+!!tM~2B(M-(}MY$=RD0}_=10|YXs8jc_v0HR+Iot%Kru-h+x8~G}Eexw28Lh z&hSFS7Ry8(YM#g7B>C^xx5f;>VoB*jGZWyM4p3tW7`?lneYlUxq@&k6BF-9$@L^y+ zaJDsR7yvm_{~O*6{dSFz`f+mSnvbm8pUW^Wb=rdsL7K_^s`>Wha&J(j>ONEk$#zvP z9Ri^{Art9EZ#D)h?5!`Jodg`oy~TEY3ACg&&aNub8cE>De%Po*!?W$X_e^b~iV_(K zU`Y$hSi)Baz3UF)$ZjFdDMbOI+?hgv;3bXb<6q+FQ#KglNXf7-#i()@{$9g=&)*Ph zsVIR)jhvg3>`2coJ@4%@?cFyQS)|*sJTAURe=Mq z?9D+CKA9t!ZisK41Cxw6^H zzY=?zGK~Lj%c6s2Ia!22zVUiUWhaGn?W5<90U4U~J0n zReLrdBpPJu%X0)0K<>DrP4e=}F)>WTtRE*RDs&d@D(fB7=r3j`L*_aA;toUH$|;bmlI{jWzF$!goS zn`{Waw|e_xsCDX!yPBOqlXGy`b%y+nr7Rd`=`rEs1>}+v(fOa7uBF7r;|hr{;bIq~ zorm6$wKu9>&y&zT^}0H}ZqK~YssW88hr<^htr3kXSjW;N#}^)*9gsvRb*ZhZz0t0! z?D>0H;Cz{b3acIMo|q#V zkprKSEwC3?n|)Ty3XF&($y6sNSk}@z*x&=t8=0{2{c^!b!-fAGP~8^S9ETui&{D4s>&twL;5Ha6~@B+`y=t z_nOR<`!UE8T1hcbnG!kf)LB1UxK(*K$E&LO3Xq%!UP(iP?{vX9Ys?WvA*nuW*=J?2 zpGe$=KbE;T8E3=*!MbLLN^|>dmJ0p-NJ-a!O{%^kpkT%W{e`m+)qoOUZ>+HCU?)&$ z=6h%j`o8l(D~h$h{Ba9X;rKc~8Kl*LGzH2+(o1Q>HKvBIP^$Kp?NuHBpbqFa%l^_G z=Z(ol;j$x}^KG))+e4OXSBF*~x-912Nl)p6unJqULFM!6^E3@#*FHEeY41ij6NF8N z{m42lNSsuh;`DN7!U2TXXDW|3K9cb-YHH!5kjk6^X6uL-Vx&Iov#PSVWz@T$M9_$3 zR!w50ZoAWP`{!<2j;vt`83}Y}HF8srWLamcPqS3BikzpGMJ2%<(QH;#wq>_{R7cQc%INJVekjmkbXYnp13aY*znU zDg(4V-)@?ho$(z0;`*V>iVRoo`%R1*6?i^#xqv@79ALZwS3rQMapz;#J!UEb^NQf; zS#Xp<-%nCC^=MjHV3ZYmAN~x?sTc?#=$*2bG+&7bkN1*cgqFk`<~IY>jph-#(a{;Q zl3it4z((a{jNGM*_DFJphoVV;qS0qBvHkxs_72RUt?ia*Y}>YN+qP}nw(YFgww)Do z#kOrHz3%DnR-dY~t9#Fyf8iaE1}wn58%k5nD2wB2)}B+HxFtO}Lbznbzc?-E$^b&L zMx0ed0)Xe1|1Ks5;v8YtQloCBclUb!Y7!bOI9Bv3q@L9}iZdi9G@u-(cxNWZOPxe! z0+QuBBgjL>f2Sa(T+Ejk1xikg%+{sft^NszUY#Tc#qL+tpBWK*gq z6h3-{$&o8>V9kgz+XY9~8EnP1u4cCh`;e5nU$|$hL#f)rCyjd%H;nEI^1S$vaGo7|mVITA&GFI^$S0|Elk7v||2=a$;bWr`(MaqiA)k&21SOC( z<@FUeFJdmhY-IXUq<|C*}OKUN9byxTppl&)>xT*h)D>BT{#D4@p(T_<&ZO4*(SK!VY)7Za9g+U6(1M+s_1{> zGaJJ{;WInazaAWN)urSA;&bnb`fIu9icaEU6C_mghTR+xY|!v2DI}CssjZQzWa^>o zrm(-aImhDUJdtgFaM+;($85Z?e~bQG)e61O%a7&5{xxB0Rmg9iw5n-4(jrv~qmf{j zmbF?wj~CT7w^%0AmF?;hd=FL0pSDUx@vXDcp10<=t7}3SGNsR@tg@KsfDjwFcQe|- zes85%Ma_b(G>=Bo6dE|BRZDjl@U05a0U|>|3NN~aq}7`5(~rVMZLD9i?gW+PGo6A; zUX?CYWu2uR{gai-9k%v{2m`gj<6EuW>{(%@*4|Ii$!6utR=E&l{Za!S=hZnLCbUJX z6@iNc@T@6{hb{RcOD@gpc$LZxq*|!vu8toYS|?`i1-O;9*_B{7uJ2N2=D-HJaT6gk ztQe&N`NWC4dRx}w58Aot3=5f+K9NAavzKPv!@J;d9+pjlapf4PQRyy>MI+@`~ITJxeKc zLi|ECG=7YoBpIy4{i`sLMy;x#iN>oWOzj-Yw6LX%r=MmDg~+uEF_7yhu`48n6^?BoI(W+(JUQ)CjVC31X4>Q z;Pf!aac5WFX~M6Sae>l6e%3hluf#d3%q z9aK?i6ZLt28Ds9OV#c^L3!Q+XwP`N6&jJ%~?Sz^D)3zfIDlTR8CS>%4iC_3+zXtWW zRDsFBSuIu{%(5~lKN!&+(*BrJK_9L@7(&gu3&B+uJ?W%gX9PRb-l~ogYc%CkNQ}vg z!qWhrsBi_upzl<*FT?@8}RzJ-vRI@uJr_vMqO!(3C1Dh{OX z@H|2Dmmqik@W0?2%q*%3;jq_D_5 zYK+afUv42mLAjMuf6K!}ZdP!h_fBPlsF`C`^m0Onu_d8x#Eo$aA9WWsnH=s^-V z%A2((OK1{YgCinJ8)vRg?IEBb4E(|4==-pPY~_#!I9o>U#gQTJK!GAa`O=AxEw;WG zX+heS7CCd0{svi3fu_@VAThb)vDb)pU)V=x!{ik-d?4LEMPQQ!Uf7ah7WaB@nvu_- zb?BJjxSqs#QFI7!k^_}OwS5X*1Y9jv&!|?MHXT4nl$f)lpfwPo&d|Dk1&ywYaXXf& zvs>z)c03URK&IPY#MM#n1<@RLaNS#bbEd;-pNiPH?r>C)zh>B|{$t%ZZ*{TETr>F% zRR6u!DgM{ft35EtbM)RIYnji@_Y@w!a+7;adqKfk@@CSZgNq}aT!celpSs!7w><7W zoKz=TlZPme+u6a?f7jIG3n?cgneDVXhpDVl?Txr+iGd#(4azgrruFybji47ek2jzZ zD@{<#Zou+D^QU{MMo<8OL1MSuXa9xwFJ(7Ve6#2KM863mPMk>GL8T-BfZ}fREMl5h zKnD6jJ>h;`A)1GooAl{uf55IE7~%g}5Lq}G{@cLvfAPcO;9&nhept**|N4Trq_tze z!GYxWqCYTtB}|z#gqb8-FW|4!3cZPkCJDdVlh4r}nT3_T9$0hf`t$K2mX^FKSxvIM z)DE6q%u>h)7rrwU5yOdX-px)zX2u37YItBQawgkPpJrer5throk7>)aCfYon^6V!B zP8sVk3ohTDplDcwqCzkOcSG<;N`UmNCL&!Ra*oNS z6dA~-dAe-=sUjuWa7Y=CUF4`TURww*9=IQ+79lc{WvHTLxd5FBz8KD(NXi~}fg$cLDYl3^|;MH1&JO2G<+7*NWz zLOBR76CT2!jtHA#UqUgWzbAf2F{N8#w8vx-{Rls%<7~_?lh6RV;^wwO$!%z=`n3E9 zQX?e88O*f#WJRM!`y`!KcxU$6P`HfdXy9{;EYBc6w#5?B!xg9$I4$giiSNwQKJMM5tLU1 z2E!$+sxTmI;c*3@LXxHiCy2`g^>cqJ;j<_eaH$4RbfJNuX%m*;1VDpPG|Js)tZOV_ zF9aD-7NKI{;KY`=ospUho^UhI+jf3TQJCIy^mKK6aK2s-zL*Nb%nRyVJBHSp8NtCz zxk5lePD_3F6PBioHv$ZvE_~d)bl8uFRr-3lS(d`zwT){(UT;@SW3dk&yi|Hb{hyjO z`{g#;;wy{17`w9amZROyTGRb1{+f)iH`yN#?+GocrW_LMG5jE%qQ|G^xXH!`RRGM4Hncp zN-+qodI&_!O)XtJ!3NR{-4VAgX!AnNe6;l4^4ZWV{|bL3J^ks?=6<@@vw*4#e$w8 zLsj)8`FL`P+?(q|i#F@-@ksN_oOMO(DQ_G<`TSIa{#%88+QjP{Db`atuV)pNJ94RI z4_Px_^G=b5;^YUIhxxniiOvX^U-&BBpHhaqZq$4_{oTf`v%cxgQ&qky+EJN4>)a>u zeJ7gK>Z9b%tAYA)EG^~JM(qc^Ci(R%k@_q^!aLGZR&23GvrkgyWlS{u==A+aXk6_e zPLFez&8YC>&<8>-cN#eo8Fm;V)7?<<*LEYOJGkEARCQZ|RLzJ}#w2)#6h9w#+nHy;4| zy3G)=+ysQ{LSF*kit+RTMZ>w z6N}hYOpYb?Oh>%Jv58f6DAvzi{#?CIL|e5xzftwwknL>&sTFhzl~P# z-AymwV|Du+M_0YJ3P}y*Hc)Vj>pFU-1)KC+Gg}jG=v|rfbZ6+upsN}1<}f{0*#(!V z1@>vWZlEoOWRVKdrw!8sD8#7OH-Sz^q(=Z958K0v9+I?CA54AL7M;7~c(`ZcU)Tc6 zBz#j!Ml~S=q#csi=o#aujM(E)WU?55oe9DTdXIL zfAkF8G3W;=>+C_&31~Oq&wi|(%<6BDd;^)MDkb~1X3K4Y!SXY^iWr)sYnbP9%| zj0rE`2VM%8#5YVLh=-z4Q)WXTiNQuJ8ZH}&;KpLxAb7(H$5KP-L#G%vz$?BCRAG0z z>gg9UklIdub6L~7tv?C~L2eEKP$4!a_mj_vY8nevPe91rsNQT>m&qcgAg&P*4Tzit zVl~hS>rZvjrzAps=dVlG%UWk?L4;t^WBIjx4ENs*9mUq5%vx~E36*lxTHE5YCNVV4#Mdx&;Jjg4N@@2dx&Wu(J^Wt^m@icKJ8 z1RBfy58r+po4r&ZyV7AA?~hzpRla+@H*VoA(axg_->FQXK~O^5 z;IhTFtM`#migT>_&Fo$U`{o0~|_MJ>(#KFoa@qoB-x{0w=3v+8_9%!YYO%!a{s zQj~OIu51^NYuDgqSRzMmcaUGVsE&Y10iodVW~X()#7>`Iyzox{vf> zZY*myX=5|?J0&6gDa!M(!>iXyoOH(l70XL+VoThu%lx3zic# z?m+NqS?aKwqJm7shl)Ga(d!ld$)v+DAlXp@!lgL&BM0FrH1i&-|6Ma`s7-xXyC1i1 zy637K`w`JS6>q@`Il9Q~*W;w;oKc7A%MU04L9z4y?84X>|GO*c|8HW%$j1I}c~UL^ zSxem1&CN$IvXEYAvT!z^p+R7wSil_4p#aj(qaj8*iBipcf5363s3jdOuC?}ByuNe9 z+nZUOW#_-}66;x&#*OYW0v+q>TyNik)4C?+8APj&0=eKmNw_QhG&Pe6Zu z=d&bVG*-M-eek>6v%xEJ0BL|1h-!fIMJ}Kqx{;>8T+qU*3suAwl}nT3WK~+t2;n(q zu)9v1-1PwV&3TmC`Df-K&KXtPPV+gYsASupm+q#nUuGh`iPtulXWD6H?AF+HRwC^f zjEhWe2cd<&2%$}DKDExks8%2Ebg*Ws>oTtL+>3gf)dZ`eDwC=YQ=Giz%VGpo0Nyp- zN@A<| zFoV!oP*ZXSiQ*>r2MvG=mRs6IoGL{&_xNu5B0QZj+{fv889KcJhts%rsb`?DxY&Bp zLh2H%sJLb)(t6_pdjWrBCI3|4ZTEtW{vBYo*clB~c!Rt3vM;Dr=dc_h`fL0j3YFzg z&r*%p@l+@T&;b6>Mfy7aX2$&&l%joHZg{={}ED0EAC`j78OU#Us%&IQ(FY;b^=JT)`uJy{F+Open8%UU_jx5_0XIB0LEW&31IR2cMBxZr1-|;hJ zy=vyL`k%IWOD0VL$M%vrPuy~}?4k>=L~;Ql3ECr$j+Zr&};h8HdI?4jeN%vgECpU9b{TZ3{8KFTw$uqU*oSarAA>;nVPaS=k1a z`9qC9-`m{nGTT}bs+n*mh`PK9xfDeT%i!E;c_gvuhQa9?YQyVnHPm*ycSCy?LIhn? zA5zw6%%g-C9DAnag^^4a!WwQj34fSizkf(P^qp3$gQuRP5yH}i+e?q2#?v za&i2@>1d?tdMCbCNRIZAI(xD{C57PevOcIjF`{_Rqz~MT%a;~jzWZXwHwEQBgGTRY z-n$=*>-HdfOceBzr6qE(df(WF0T0!g-TQ;7<-xp8{%Xu1E?rnPI=Y#wVu=51RNLct z&_4+v(U*(!_Tl>4zF2E3{h#oS^S@1*|G_s7R<{2QZv_8uSLIZ-fw;eG*Pa{o@^GLo zfhh$h(o8@niFq~)c;03(FA1RFG%+^hNF)iXo{hR2g+iQ#2H3aZ0*PMFAx~zMSU1F2 zK0XEh??yk55AQ5-PR$0E=w;R6^bqqZ3Rx#4X1too(}kiE`REw3_?uC}=Y?68l0G5Q z_w_$oyyyGRIylc`4E>vki6BQvf1)b776SY0?N6zUW{TQ*Q`4a&`zB4nrDf zLXjTpmgWyKfi?Eut{Ko2c0Z}43fvV00_r`i?gQ}PGb=uD*msST1x+7o6*|Mzjr)?P zg@9G2hz2Q2muw8&m?J{whyI4;cUz9wqMNMan*jxrK4 zvd*iW+r;CfNx)MM=KV3uClkVl~tHX&`&454Y-Wf1IJLR)w_=uCRzS&1x;D}jvnE+lsaSX8vPVR(GXS(je4 z)iz77j{KZ!K(F#8EV{IM-R&-D5BKT$6EZp&X8tOqi)&#v=ICUqJ1Bl4KVS452mdZA}=c`UJ2s!&p` zzn;rU^gIUU{>_^wY3owSQ~G|v^?B!kAvU&%?2|80M^GRu=DNWUxI!g4){W+Y~dc1W&7)0`EJa?6k&yVl#{gar42?Yk80vHkr>}yaq zLG&lV|1SX!n)HeRa%oNWBC1QS2uiQ3CGJJI#+#k~aF7A=Lor;R*S*q__gFoY##;W3 z`=Ylz`XY~t>~mRub5-N4NCQUU__rQ+0V}&22~mMst!eEWxR8yft-eQcvK5xwsplkD zsplRUeKp=|NWtxiyniNGM`Y7ER_VY2VdTNBhG$byUgnz~dqVZy!m@A?f-yU~bgsq` z5rdd9lKDsBi=w2NVgaKBA`=QT1;M3P*o!RC7cA_8LP<8nE^GRyV$(>iPn zz0d6VC`wmLbWt+U?DIYDQBAM3alMoJfnyqJ?2dP7;72BBUo>>-0Yuu z*4H#n2m<7#^a7#U{L_}XG)wIRW{Pg$CsV#Azx`YlVcqD>nympR-3lW>xA4G=jor_E zD@&RVTcVUfk04uZ5rhE+I9We#%VWDh1V8Vt%O4Z8sm1$^wqX2)sS1s z%*3%_RXS_5A`%4;WqUrylM{Zi8K|k8KH0QXo%&0vV?w&=Whh&D9eBMMRci*i275+I-0b(7gQfo9)K# z1Tekn+rG84aJlm@Urf+^QQNPiuW(1LN~X=uI`xR!^xld&Az!RS>S}EHqNu}L_40jO zE>*UGnffU}^M@a(mOoSiuzd&^|3HC7zqebZD%EZ(eTD+KXXdnY@@Hv|rDhpZ#`7dG3^QPIA9zWGUs_JN39 zAJZZ<t(y?_VGkHr zK_1b~2hReFu=>IbAf>Kp0Q}WVmFrfT!-*^C{a;mPPlfh+gNkl%q3VrFCVFYDlPc~Q zQWDM0#Y8@v1gCe&dSNLU)oa&FUA5DY0E4os7<0#2c>&WBMnJsROC=~+7#IHe+vuCo zirS*<{tc!7YkRx!ANokPiUYsBPZTo`H!dzJ>mn@$>mu#4?n+mz+%vnSqSIX2INL$MrI_gct=1S(3$ulH#6So4G7q4m|7nGnu=Km zN|e<@^?_Citm3Kim<_TN~U6apaIqL(w@R5LE(uIQ)Wm0s@@$3p?pgNqy!~e;J44^yo zN6KgXf$wr!;~(K;#36B-MFNts9^?ks&(YvwgOE#BOd<_NVKSSlH%ZWN;xKxz;6rc3 z^|@@f%D7t4&{_k^Egf+gN-DQ>)HLtRFYvvDe+!QBO?Tc~)aOPBOd4YR9z9df)504{ zX=D-n%q0fR`gVYTtGk@Hv5c7+VmN}v0r-|+I5*mtf$`&U(bl8*mp{C)_U zYW0(Yi~c##GE;pbK;O%6A(yp&wGr$&9|@$uj9_^9c%@@~5j9MBbs>~)Pt$dA=%U|W zZ@~Ei=Say_cZbRL`}GUNai$o;I8m>N4`~cUrntt`kQ}e<0&QOr507hx+Hf*R40@~B=@QJw!A$_Lj0TE)0wn~pyPZT%H>r3gX#Xf=NdpX)nV!mSO*T!M5QZZw}vNc%Gbz%U5qHRnc<^ca(`hV{bhlxTb0k z*4@I}yQ{5Ec2PVe%khuD$^IwEK0E(;>`D_EoRW2f>?YN6c4kOuF9*-m7D8UAQ>)zt zlJ=fV)l%9B*ogqLN+2Yo$?sMEqWN{L@PumMH19$WHT5hq>?#um&BLz*SPP zv1+C91B&1eeD^bM@0hD{Wn`lTC&^>JIv*E9pL=#H4Heq;_(x4EW&S4#0rOvB!GC@K?~%0RKTOS8eL@3zC<8_k(Wpbd_qhT} zHXDq3tW#lbm}c2gA=B~X!_qbVKH~T!Q*k&h6v+I8#O|AqJDKG05HfrF)6|=bqv@?4 zl}IA3F(OU7PKAVe#R z0(2X}z|4~*D#t6bS=IJTYtmtl{S;$cerB1yD z=xhNlbjP-H!ziJL4iXlGbo5ey(fd(!GbKo~u4g$`2Xz8$B88Da$v$jMz?JtT2Qd^g z3KLEzcFecTwsBv3tHf95vf+!yYc~n!lfIh#1U-&Dv{iO{t~^yi(MSB z!v(pOad}&{L?@! ze@AQ`;q-!cjA3Fg{e|oU2hMq60BX)O!*47HrOXGpQ>u+C9g)MUgg8F|yO-ZJ@jbe# zc6Y3rm_V;iN_>qv0(ze(+Dga(k=9<74)XSQ8}QkPH4cI0`xS_)pZhQpJj6ibnFPZy z1g)~FtnqYFI` zUu~WK9^92(>vX*|opB}-c*u&Bx{Xj4pxYBZo^s7Jlp`otz6(U>+{iJBOSh z!(?RnL%J8Vy>O44g>yf${4V!iMZzq{avZ=dyBX(mXka8onoN#|aIpIwno)8YgXOP# z-p}OOB75t+0{nf*jF|ZFdS=s?uEvoA*!C^g<0XCx^dH^7FFuz4>`(L5whF>dK8SL1mlzu*F0d^y$rc3qb;dCP3$n*@o9b z*(bAq0KVf^J^lf@|EAF~5ZD`8{r8AECPrq4e+%8A7?W`a9M{|WiIYH-Hln1HH^TT{ z-kso00X{S|e{WEiYKc>#Idw{@(G-;G@K5J2Pv}Km*|Idm9pCqN-wV@ZR3@#x?oaZ^ zZ)V9Timh@#1FI@v<&PYs$xn6hd2U^#KJ54B7YBM>+5C9lJ?n>v6I&@n(#A-CMZWm< zY@P*;Phctg#0?VDVpMv8`}I*CEtDd5-;|~r$3|exi90qbMA5D~69A-2lFMvJ4lt;R z#lk{dr}tEw$*ci(dzh4HSfJJ^lJ#N*g)~16WLw6zdDFKhoh8O;Kr_E-Z5&in zrE7|FmXdBiu$wMp7Z56?2$4~75?@avW{pT!i$F-_5`n|z0+SA#Fo9Bnog1mSL`ot| z<)k(*p64*es%0vlqA_6vpYrv&fXe3Gi!Ya%}wTeb5EtZ%&)~;lZ`jeY+zHl+ZH2Qkdl5}N3RCs2JgNQYT zwgpWzwixQ9z*~bW$P-qZWZgQQ_JRP}@vtUis(M;+nSaQX$Cu7^iYjj?P^g`|6s~+h z$cgO#bj=Dt|E8QUrfIzFsLp@rb2&YBs<~KCGHZ9@^@Hw2CK3q1ycKJ&->Sve@+Df? z@N+^Z539ho*YxX6s8b9c>xZuMZ}>vBhz7m@$BW(>;BdT*P0jJ5fY5Sa_I8m-$|wH+4= zm+L{FWZEnJERN{)A9t4Gx_NeRW0pxWX* zC864H6+mQR&X@FscDVJcAFG{rwnAY%Sm}V-uvfAIOUy1l1RJ)ra;Wrl3sEqZ;^A@= z*QGug!+X6yyb_2Ok*$>NuovvUKBmE8G?6``X`{Nbn z9dyCeH?VE{!9WmZt?3-gIk_+_zyeO+i<~>iRaoy)YomGLE`6Vc&FCpQMRbe^ZCGNq z6e|YB$W-3}SgCI#0V9YYIQ$fG3LS|EWKvz-r(VG;0(Al6mXV&n6$HfPK2Fw&IITd^4lz{bk z5PGvhf?uS<5(3S}trBr!!$!nd^b{v_gJ+QP3rxKhcH1$E48|zl&YW3T0AJPM(euHU zDPtaAf#NhV1T5s;o>sTJ5b)Sre-JaO^CyG1i5YF464_d50JGp`^aO`(#-)cIwvt4t zgF#!Fh<^>!qQCv>rA>vpz8*6)F4bR|yIu+oU0P>&j2W)S!Rf=y)O!7NR;}v$Z) zVba)iJ1K(z(r%9f%9<30d8B6He7rnf{I%K2(*CJM`KJ_JX7+!*fz4IdPd;FQ@$ZwL z$JFa&UfCUf^M;`Z#{q_C0R8}z8Qo~Fi6?<;Z8FXLx|K*vCfmB6KNwGB^qvd zPao8X8t)X17NXqQ1kHWP{8ethq}QncP5$YIc}Jy>bEQg*E{0!x_Bh8vB~){Y?qpVq z5md!>l*ZVxgiYM3)mHavT%x1LRH2cWYB~~y{tE<^x82X7Z9BfWDA%_eRjlyFRNcPD z;&04c8@WKFa9NFV*VSMFhv6CQ`9N?}>d#4NqBrrCqbBTSGKNfHwUl8E(aePNeyW8; z)jT*6pVbm5&!ZTB1o#rgOY`d@nVBM}S@#)dr*Mw{t?I~whZ&mfmhB&=nU&eur=8hZ z!QD4ZZQw@9iHR1A_acbB&mfkgA`6?O{GFj@Zx$@Rt+?C&n1;A4a)W$;1mM;NhDDP;ohMi#6A>9i~$j(BU~l~?t>ib%idaB6zEdR z(U@!22R0n1bR_Pb!bRZ&Aqa&N2Bu$VV>xy4e?TOcmaM>qw)Sj@Henm_)Qu^TMi`xc zzkh|__>)R0|0)*j(rn7UM|Iz%U=u?1(AchyNUT}I$HG<{Y!i_-OTo{kAYgfW-3P9P!*UDf?!w3q1VG~;k{$1o?xT6c5 zz3?v2VUCK%ME9V0;T`+}3zskT6_qP2d8syLn1>;Or##DiJ0jG323GyZ8X6RYCSrVo z2oU3XNFE_;(!%#9p!={C&QnvGC5m-*aIR0Ku#SOp=$lDo_~^jFCO>>zo{$}6;m=G$ z))jjR7olCu%X1ul;yqiVH_kkYc7mMt5u%7rVWvwUUC1*o7(bGH(@XCSYOa_guY_R^ zqX1SCRWYtn4zt=XRam1SUmq^Y$0>+a9w|u$-Jc2#6?_)km{5C6nFAOk=|wNkpme&H z(BCbYc9uaLTBdY32I zKRsAbXyZ7R)3QQfjQb2dfhEJFz>2*wnJa|j#a!Q&9S^a|(Uu=^4^;G=gZ>J_)11s9 zQ{G@5u)TenR{nd_D^u%u2gET+7bd{jI6j!MuL~onS2NttKWOCOuziiwcmDe>ZJHH? zj3<^#Ep|7n=Uk5~`$%!HN%3(nQYO3?4k7sED8e~skMT3Oc#=jY7Zu944jUsoLsux1sJM zYLLQ}BI8$lY!$pCVyb1@2ZC`3wAACPG8&%x++`=Nz>JVkTg_`ZyH%z zZuv-CrBH_ZXtew7MP*H`sq+`VxwQG;_UXDjouBl;dJmQMM<-`;N|;BSY&iAT08gaH zT>L}mi2IBEH|Tm2uGv2zHtRnl_P-W7)cl8n_n{7PTA*bxoq+Ph)f_InfFg)z(I@~f zX)uRm%UmL&8vjJr*El66(a_n|@_`(6Jl+wTf zX~!-Yq!_nAP)bQe18+CE>-)N}#54#Ju4C&;{h{mHBEtad@0j;ww$U*Uj&rax90p$* zPT2A8@d0F~i4-J}C0mI>I)%&ChsT^0+L-ngRb@76?rs>u*m1~IRlQ{(~uUo6Pc>`+q>ez4)1le1-IYGZQ}mV!`h|K zxc7IgY0@6arUdCR1Bz`8cnJxU`1}UA3%0}bkZXl2ZJo3(uZceSFb@#Q1l3Fs_Fpq&)U7R2ISt)zOA*~#EohTD93v)=V3^pGvpq!$fXtAB-V>wz01YDYs zhS5bV-MM!AFO67K?2d#C=`%tA)M#+^26HDQbp8ZcF?RVLBGj%IJR}HsQbir%BaH4g zMYEp66j7MIi$yr1cg@z#( z)rg_`+s&O^uQs_dkQ4oFn0&U(43oFVf&M7QO^aD4vxe`_Z-ZQ^1VNN{0+E_1A_&dH zl!bbc-W<8Z1frfo0OH|S?1j6+<~sR{=AdA)(-1I{?I*d(uq`3C>ZM3$83G#M%RpLA z+A<7V<*2YU0(b7@S@3g#kxBm1CE;v`2u+^bshgIz!cZ!}IM9#?c4iQFOOxhlFg5+D z{y4GyMg;|A?B~T7*k(S=Zu;ykq{e^X@jQc?xOD6^HLPE7&xM+K(^&;RGIUlEGXlK( zt+$>FMVfGMj)L%xfL!_ymWt=gJt{BYF&3`oxY$ThL{vdRn|#hB;7IJTUiROxHb?St z5YOjX1UqiIcocygT2>gBl2cm+Y_E+H?u9Wa^xJAy)P-yXH)wnVSLEJZMzQ7D;``Y> z?BN?V1I%C!qH6-s9LfIZxUT>9y7~YXXt@rxhwkJ%!`uGxYzy#l>ospcDCFM!Sm+Jy z-Vep@_B`n&PS2C1Y-cU9U14V=ifnsTUm2WFeggCot4FTXbSn9_{>kme@co4DOxbql zH!$RBx&{0ovz@g=|DlPHrGhLZkzfK~fQ_=c`zD5yLJ%H7XznwxXIBL@M4WJ5m{7U3 zyDR%49Sy=ztlwy47uLiAhZLND)hSR`KuRf7G{YvBGVp|CNlYY8Xi5pC_b6ET(@m*? z72f^H;?m>ok)f)IZbbnrG&M!EZF4cYaILxay~){OYc9rTZT?JAA5ekYChsPvW$h2& z4Uy`yGHiHuzWT&c&l#2m7R&#f&mgKXPX7!(^%QZE7-2~CRaAk2F9phz*}4z1iJOv( ze?C3FUQjoKFUJk2;#MhMHK1`XyUqnhE{Q2ctG_Tt9#mXL@P;lx2~P44c+K_?OeIEU z_J57nx$2tnn`|)uWi9z+v{Gp@uD$^xfhLV4XPdVZI z+cMh-Ph=j2GzmX`uj(qQPEYTyo=;!j_lrpN|8vPmuX-{gZBorTlqq*=sa3ZxR6lT~ z5yfkHPmIX5d=`o2t=SNBPbJjyz9YhN4^(`zt?J^kvq9&$4z`?Hb&qRpEqV&wk_+zm z_Wc6xhV!F2DwI(N=6h`adOKP=k4;yX0X1YItsmW*li%3-S=9vNM0qyNmf(?rfbbL%{BXA5%+DV$E!|k>R!7VO2jm#KYueQH^O~ z9Q>;*cRRlSQ(kO8P`XX@GKR4(Ao>sleHSu7lxPgm`ao>Mc79Uwak89S#W9fNQFmMf z$)`=M`OuO@1{VJx)UN#qZNW8rtan0VMXJtlB#ICefsPA+nF21dwIvKPlyVvp^ z+>6Wx7%6ypdamvDR5(J}t5nRE#|hv8Y^*S5`#y#L5@rv=W=h^>iX=xyAe{dr7g%~< zcPFb1`g;t7LwKffd0sSljlFX)<3QKAFCP10p5?LO?{03y&!f2J%4Z^Qb7)45+X(Ci z@F^eHH@9;&8!U{HOwZ7 z8c#TCvk*b|vN-@?>hXNf+GB8sZbTB5M%q!+&D|e)RpISp@nW}@8kX)*mU!;!I|SW;8v}&qVMCS|%DTn@d28_0wuB_)@v(i*VW2dFhc+zx#G$I{(KF(H#EbW}vpt(4bDHa)pO(WKS5iDoRomeu!&TR09G| zBVY8C?eu&{K~%b?oBNms1Q~p1xCqmjw{7v`a_T5=)X>9uK=W@RU0=PEO5|x%g$95x zE)s8#*F^|Z1y~HYi{#=BHIn=Rm4(|rmr&p02O&#&c|` z(-Tej^=QcOq+&>sXzhE#8IkO?I+)DRSvgg>^EfAH4C$2m!h8<>!qLMxO+3GAU*8N@ z$u6iW@OtEf*!hco@CuIzSL!+#m#}Q4gM@xjFK+q`;0JwH@2folFw!IwsVM<7%+G)% z?XHQ7njkZT!(XS~Q?Lf)?9t(WG4@VDng$EEX4(A8Mwe~dwrzCTwr$(CZQHi(E_GE+ z{}FR$PQ=+Uv+v%kHzF@GS7NR8yt1!3WSlK*nj@tZRQy7lR@SIlFwH%?B2Y@)n{Qin zMM=Tg_XHyX)}4^8Awu>Lo=%&ye94FqmyOz4G*_S0R75|M5a16)Y4VU7XToe^^ZYG# z2*{tVSK$azsNRRXv$3;Hr82)%<{AgmQo{ULbymmDVGFs3I}-DREP<)_9^m(NIWWaH zCKN{yMxTb(J%0j>^0+LVW%X`hhui6pOvXJ>rTAX=yAO_&u6?bduexTlUY25!|y=MR4gU0_W;=;=KUt7RcV>=KA8IZs~ zy+=|d4@R!GXvG!EDYl7Vq>)v~ln#F|M#Usl>@u-<5#;ynZ{OTr3$|jkfH;p=wV~ny z5#S|?6g7bjL$&>4tnkxG7UY-g5z{K6gpPDnF(o6kK$dXP6q697r5;%AWNDW7F`cYg z=&T|=KEeF_q%;GBrPWsHwTdWp5AYHnX=T3UIYVyY)vp;||I;}Cldph{h55gIoXXMI zvfXAw@|jb=)oo?*k?Gi5I zq=VCeQDLNIGLT}gW!tGl2WW9Fb{kUB$K7Vp(J*WAShOcfSD+p;<}j+>W>=RpcF^Uv z`^AxurtF#%IrI-%Tx#%CaW1yDbf^J;!U9Lv-DNw5BE?hcUdNP#dT^6dWtDh{z@Y;! zTT2;*&>h;{3U8wt!;UrwS%Q?Xxv<*tcG%qkq|+Z;ztC0K=W@igDe`O9dGaaT1%b{i zK@>57jN@$LZiWH>v+^2i=B38hi&^0w&!d(2ygziI5E3ZfmjEd`XYkp6> zPdwcV)UGGlLD|4zeK?sZY?29;=I>#YQ0bZGX!F{#NBlz(ai0f%14psRF6@2 zG9fk4KKkb;9W@UMF{-X*?L2*VVJv_4abYGWu zYqs{cbA*)<$Klo8=T=p86y0_IFrioNHhFjwA_P2>>%ENAfE*w@-trN}Qz2E<~TFS)e>R z!+R*W>dL5m(vL`Gr2})zw;g6gkRqLJWRn-lVM%TtYNLJ!m^t0O(H+`f?UYiJ%Bf+P zif#&|3@Dkf9H$#CTKa{>t|hnXkiq9vDGh-Op_x9*yWCU6zmFK(q1tm_Wy`OOG}XXv zy28R185zT?--RMx?ZPEMB>pdp@+Gc&yTTRZ{+)ww5V}_36b|JAI>cLt&QBoGPSGek zPHgEsaTBKx*oG<*1(yY_u0ERax&Q^AnEt)#!i|V+dOu%%w(?&0c9{;@NkT4vt1V*8 zm=Q8)K5P;#cIm9(*z#*FmP0{mz@Xa@^u04l#{fu(`DAOrKtaI{W95Ki5rU&~_Kri8 z1%wv1e#=Bw<*raH`t+$Iu<9@K%_DdyxMos-54{b7emN^q>}{z(FdngOHG%&}1Pt4a zOi*1ZAuu5u63~6iX@wIAHr#kH1n5e^&7YRfOKp_vuy@d6 z&cD9L(X!BbK%BSp#rEZSxAo|+U6=Wa$iBv|}_S?^9Xu6n2k-J4ySWHT85{OtYBv@Zt=tC)YqzGhi8 zF;t;|r=Te?L;W_`j%@cw+7##B=fNQKp-+FChBwbA$Tf00M3>QTmkbp~mb%I0x4U`} zVeXyvD7U~IM~0yPv~xW{rC_qrNJIj zNT1z(m60yNCBUPoWrqI9-LE9*Bhr6^#%vwN{0Hs&kF~lStp7E}y+mWC>8KUH?_YbN z_6wPnSTP^P3`@p@Z4yg{iR1az@%(c?`NG`wWTJTDYt82x2BCna>)WM`C$WSePFnT;1cx>#onH>upfUO#}0jEhb`;`}(N|LY$^T z#^2+QC30ffJqV9K2YGS)fj8O}!PQPokLF9=KI@f@_i);(s1aW#SxeTrT)TbkwZASS z}u_zt}^RCws%W9pbJO8NFhG=1K1gG(GjLH-T;{_cbVs5v; zZ&p9{YHDj*Dh72{Rnf0Pw>u0EHUgw73BN7 zT-h}IE*PffTn88~j$Dl&0e@)sVRyx(_0JL>$qZkJs}Tk-iwU~PozcBGHp`N(%%Efv zs*WA*4q#_>_ngaC<)T!`LXTRT2yDi-;-%k4c{Xgv0)5-lQJ^hTR}@%ZdSIZeofi(d zd{i|(U-u)`E#Ak2aFFiMB_6f8XKoEn4U1{@mg>I72E?J*LsKW%gb9W_K)LiTviG54 zF=Kg(;HBXC;ba8)z?cBl2JB&IB{+*32F>S&%($_&#_*;5b6ylE_I405cXEPrv8x5< zqlRq|?}=M-ZhuHay{bcJ8$G;+L_lTFIkV-E{#qas6{w~LFF{kosd~T)E);$;G^hJY$cb-pbR%i+V_gK&jE#YEa9Rkwr2Li=Re-a0YGaT^t~d{K(VCT_TG^4~1D5EwRnA|A zCQP#{Bu?R*toOtbI0y{L01%~S&t0zjbT2NOA_@54dw{*+e84DSA5k}AAW&F7^Wt)6 zAW`j?0cE&1Z5uGD`Yt4pM2kGLY9p^czx9*~sjT!>UIS3u=Yc_AEa~s~e4ub@5710z z_&7e?_3n;mnS8zN?mib%U@f=+fgmk0O@fQhi)Spp^+};9At}EwmM%w-j7XJvHv-x~ zVKw`QDMnOSA>nF`M=6!cZgx{fi~=EFM6_lKdW(+_8a`ljAhUsQ> zC_@uJMm|~EIq~2;hSimsQ&aL(R=(ce_CLL-(`2iF0z3KiTt`|&wk7=1)zouxGY;3% z25+{`voD$AjhSA&iTFzamS@^uPwr9_!7q*N1Ohea@wyP7JS!7!pjIONp=LMy(#3kA zir8mlAOEoE_tfs zrVucys55jSf4{%f2Tb~YPO6fjh`@9UXAfVdmrhoA%Nu{C$=7+k7S$2zI)IGyWTs8! zLDWB@m6;W$!uHcDxBTD(Jv@Y?b(Bw*OdbWAk{*Yg0cevaQ#`0!0G26rG`_rOFwTcR z<}X)+4{l&!f6dkr*!%0Y0U#$o@%}y88 z(vT_({fqjSShs;_6m9N2ZdRT_v$dh%+bGUpjHGsb4wJNsY$@kh6mHdiKxa6C7hf6WOsZlF2>YR8z ztVv>D6!=3Fo+A_0;r94?-x0&VE3*EB9CQAsRtPr6|Jvsm^Z%ArqJwKP14u6&ECNW@ zX|P##g#V`&qTG6c4O!Be^f%twn%g*$spNs#>o5@~F2dQv41*4y+QH?msKuCD7KR-k z>H`(IX7WhYj4xUlwb;L3jr>-w`9`>vmtr{-uL!o*uQ_61q!##TdVf0wl_nD(TH&IS z5JBPT;B@3r5DCb}AOF`iC6O3B$k~0-HvdaS+N9y=9lKEhPx_@%e1TOx(oN#W>*rBS znPvY6-ZUnvhoiYZQ^Y|bB1j>X)f+mIxN9NrP0kx$c=EGqFo`|O3*S9vFeb6eMGHxd z!JUy*F+r!riWJIpL?*PWYCPyE!L9q6cQo8Wg2GhYYS`DxMDo<#ERvpn1g*+FF;p;` zT1)bqwU}{_5;zM(XBW}M2d!~bT+Bf*GI~>;soUj&3J+jj5G#@K=~?^>cd}I|@Q~0N z*QSHZX&2z6njB9od3yTSsCbbEHulhd*>?5$Z;U7S9hjsZI3&59KheDZKf&CX`z(131X42hOov6ZJ4VqB^tqBUHsezI#2*^Fc=1iYPz+k)$$ zi!rq9^%Q<-xZ+C55b}ImcS=9`)x3+Dlc&ZoGqRa!K)^gY2(SNPgyH;P9%gZqiIHj^~q-EVi=c;qt_i=P3vdX}5CV=OX?!(%3JE-ERlC z&$P3Pe$k^rhn=_j1X)z~uRGNZ&L6a1G=j2s|}`F^C% zbyi7ru)Gdkv9*(g9SpKC!yZ7-<*=&&NkB+J4Gqq*qk)z0$r!? zHQmzcy{`cf<#fC?F$JC&299RqvM=13>H09bH?y|ihQd%l1S&z7s+1zE^~B9SCW%8i z>ni;_N{f)txcRU8&1NMULsy!5MV8DqC|HaxstgSxla&&x#nEB5wU>#T9O(eFWVc*6}dhPHG++J4i?HFp z8j<5JgiU>sXI|+8W!}LZ`W4CkWNV%-=v@BIZ#6w;)AYOpwGiXDo%gP9u~n_4!E1u) z$JPr@-c)Y4d#~qqsV54DQF+Ux_hNCAni7xEv#O*2!lQ_Crq!(LIY95C%_%%yeVF+U zf{zTDM{h?7z2oAqq#lnLhk>5l;hmnBM=TMuoM(EgEj)4j&P)?U$Ph1<2R=xKk1dzlK-bPu`~Q9Y2x7cuY2xW{(;@LS&)3^>eAV> zjcQU{HXstI5{Xe!Q4wiG(Sn7Itz6;wAPBkw^yS+~@*WavfaFuPl-#O5uY^m(wm^Bk zzk_Xi>1}g$`Vy~^6p2w~5!lN>)gdR001?mjNd&%d90$i2^6dI@<_P?u$R#Z8mM%Lf zo%EMmWkhir_cnD_?3XyNKJN!%w)XnZ<|d9`RE0*Av{IOgLLkP})u8AbQk!orzsX2q zjbhIR9}LF9kYzfK=tB#q$$dVWGE8U1OGu!h_N2C<44@@Vxo$l-RMHCnO^oU*@6`H^ z5A~6Tm7BcWBPH8(C_ojaioE1-@!EQJ<|Jr*8vvpTT5qKL^@?+m4VhHwUZf#?m{WOy+&4tpYGefngHF=q(_FvTLLbuK?VnyFeM z4qnv92hkl-xH8PVfdTVDfrAqr7Y|inVXqa_4NcIK^wzPk+22Z5FobEGB={b_R4;}| zfT#%<@JC*ALUg!F40jlpI7xwjU8JY`Q79Xj{e8@yinpqM=F~>Su9?IqHD4vdc!8`q_7vRr)Vcn)=F(^ zQP0fcYnN;)wAJNio^7lh458OL=2k2|C(~6qpQq0)nUHLxk;nva`z5BHwpbUyTF{fN zLz_c%Fs+d4*Lgq?LMd?HFtG52K z(_V&foL$eyaI+KGC913d2ucO07621<%=9+XIxArVk9uRxKH}j1K$1k3mp^#WQ8E35 zSEC9xbm3#9FPGY*x{7c*tEs^w=ffn2;nOH=IZ5~)_2M%cOlbX16HcU#v-VTA!!8@H zblI@;x@>0fPG-zcDk*bpa@d=OvoVextCT zwG7hhsIlA!0_NZXze?6Zj__VS=x5`?@yfY*?DONxe9H5BF}3Z(O%5ZG#PZR9iFqgU zn*a}C%#tPKYVPjl29JG>THm7$MC^UE>h@u(LB25sNPK6+q*mgM6cQbC8G(kOkz>%z zPNz{U_?WDaq8`nOp7&tM{ezRC%a)v9@Yl>4K97n5keRCPp8uf}D6JoO|I3CnFl{8LvWV30z>4lU1vbYU!V!t<k-n}i)3X^=El~Lde>a;slgbDPxLMfcS^~w#W?la z%VwS)VgJvw5*$wWDvEAT%kSlHZN1qK3v2l>C-?alt|ob|Y(6AmI3*9EGIY@}zZ*)J zxr%pnlcn1h1ce?^9@}@8zlL$}>+1Ki9Gf`DSNv^;#T*H^GDC!cJFcVZUVL31kL+(D zga7jHwkA%_j;4k-|MT@PDhI>KhG`o;Nx$nrmgP1RUh_?Qm>qo>g_+epZ>|VVMVv6Ne!|$u9Y@E z%W7*$4Zj?{^TB<-9!}Nc>*$V|HIW6;vTsMOuJ8JtE5NA3Cq<9neMO^5ve6R`%C6_e zf{)FK%H7(u6GmYZ$t_u`a#f(Cjm-mgzdN=9Zd~kU*6s>#4+hAJ*q+%ZV*|Z$6-*p>`pqM3uvSUT2&|q}&iCx@BP`lqeNFwTXa9 zz}FHYAs_a9+D=i#($`HetPQ#w@?__al04e)ZesH{qyLr5l&rFggI0HFs0N)CCq8m& z9XD!~E53FSwsFGOaAw&4?gYJ+c^L0pIl^oo^t8*eWYRUb#-O){0zawIlqO)1q(T>V zHMfQwu)tA59Eu!_M4kn>E#<^PAB2F#Gj@yCTePBAyXQOv+PKBAzASG+g4Cg-c`oqU zW4m^a@NeRqnZLhQsg8#SD*Xr@IsC&rPY!;*=}7B1-m&T_I4kh{zZ@J&&K-#)3`h9*246AerYbiz$QHBBg zvEVQ|AScI36Z8@Rn@szB7nI=jjU|d_8~~?pE!`q2?e|5|7<&gjdDpihssXE*T#mu7 zVjkC~Q<5p@b}H!R2i&Va!n}PZPtzT)^89*M?_4mgZo0PEJopF+Nd=l#p#MTeX{uD6xAG+O@4a{3Rs2f8ToVh{oyf= za#Yrwu^X9j0z&{3s1NKHJh}`d*J;TpbYEsOYUv$u$L+&przRjGVG#%|@|VZ{%DoSr zL?Ju5Tj%o2mcgYdEFw~!DHs}xeo`5!=%k3jiv!TzB@EN!Jds+OHqWMJN~FX|MVR8Z zWS&WX(=zJGkkjB98DnJgk(ihq;ywU(9$LrnNZDTn$ZgE7R|3yx@ZxP-io1HC7?I-e z9`Xp9!cgcFL6QRaZWnUX8D9W~SYzp#iuI)tkmX9D`WTo;(Rnpf^M-i(*C#Yk1H}6fDCYdESgwVRkAq zkJ!`FL??E87XPj@K{IIQ0@cABqhBhZ8UR6G3?T16x0CPm;L`{r`bw*{J-v~p)fqD5mmlIu00Xu%3`8hb`orTgo${+4 zF|hcb-?YGIil-eUuwCSG<}+GRYKMhSL?-Owlh&k=+;_~Vr+6|djcb2DEI4fC*fI8aaI@5}r!55jETk?a0 z*rJBJIobz%g5ayifvdTh`$=K@Jo~?Omn^r^9l+0k z1;V9dK{5T@pL_8&(lnbs6p^%q^itAGcG`zZ~fcg!u%IX z3xBgTLxN8##uY*+5@;|gFdDZj9#+(GDj&m1GwuVy^)2Puwl%(;2k4pi)9i(YJkvR6 z6OGX)u0yGtRzD#~KRE2@&o04Z$4f-X`RMTK>Zb#SDAee5{>YPu@>2%__c{j`%^*#8VI zz_f;q9W{aph?m7kcKErz46X66>^%3!L+``*(I6xU{&Jkl>-%eO>d-$Fp7lAYIbA}o zflAtp*OrBJN-q-x<1Yz{&y0oqbE9aZ0|)u*ar|KaryB{sk!5dq-vz0pK_Bsr`m50L z)3CVVp;zqhFU|D}p98X}1hLHTTnOyv#sG_M?d)rL3d= z_)wb3L)O2Wg*>ZxP#6WxZZXM20-||cW3){LJB9T7eAyw7g8^cRUe$==g{hFm$mS5m zR-aL7%9%9^4FY3KxDdDx(DpF$$bJAC8Jz6?W?3e6qlzqT+m*wgR&l zsykt%vTc5}%tYM6IEEnmYq=!Rdvpj#uw3^D{d*TSrw9Q1H!WO|*cbZf0npFe2s8-( zC{4=XK9lnS{U%S)%gZ~a*&H&2)RkwZZ`D|>#Z{w4rg*YM5H`S9GdXu`(O|@Awc61zRn4z7GjnsX*-nkU7kvM`QRkV0myIr2_0(3oPB zPmx(W1nu=2h%)*T`n~o%qR|2_z+yR87g7>6vsv8u%)kuY@A591>7J1**9cRkD=Q-! zer6G&+fL_!XA#5Qr@rLW5aftR`q0*NmtKE^vq=`)n-sefO zh6810RzQ$CZ<4&TgbYDI`N%zZ{#9WRp?8>$wx=2ugHeve@O zG+zImoQ>{B4wvChLeUNm2mbJx_y-+M$R?2`9VbYIjlQfbFcyw$@^@QMjw=qFGP4n9 zlKCo_89`BmVLDfvQT?Z^d-#*YVV7zT+rQ(|t9E4DNI})ugeW4$%cfqHse@oM>zkP& zlU%1$i1MCd_QCvsM2Fb+YiX{W(HdJzC5~mk%JqF$29Hr{4~d5WFwwCnupyPly4xK| zkzxZ1tg*%F_3?)Q2NU_mI$|HNZAP{mCPO~(q^%A|$R$tTc!QZ0@~FHut6fa70FuDY zWg$Hr+9m+WTWn{`0>`L+k*zb-Ib0od!N#F%T>K(SYrf1SDx86LHe{-+FI1at8uOVq z)_h^jy4gXshDZXle9ZhS7bX;&XZDeP&5DG_M=)g+3-hR>lEEjV+nRKaV^BE)*;#O6 z8wc!;Z6->cp>1!^plMLnLcG^s6%#*;E z%AIooL7qH(-AXR8%5fl%O;irY*M8|hV?k8o%_>P~=QF7bSH7gq@nQfDcNnMZcDkF_~IvC_Hql^Mw*FJlOsGLb_pu*SCl zu)WnKHI|Ut^}KLGg>ohK_290p)tb7Gc||WZtto+cbn>lGF883Aq9Ez7^x@>_`zkcB zp-98)GHZgS|a0WtrVEFU@NU z7wcPe6B-rKX30Los_YLFVP>pP)psi}yaoS}6SqZ@$uSiRA%)Bz=g$c0g#gDB$awQ* zg$7VzWjCrxZjd@^I8M|9vg>m5U|jMLBl$&>IA-sJusmMV(H_|ce@NN3e-@k zXB1rzyZT?&d5)x`7781BlBuJ5#29r37_&4Qi9*GpRD?}-fYSV;H38s&Rdm+`eL1bH zNl@{EVS;mLNt1USR}kd|m!6Z2jt~_kwP#aaWUSrZpS3I;>=vbVFJ`#VBr2=!0LPYy z(z>48tq%GqV+;KP)3_VPz15Q2FkgP`Hn|wg$No*vf7A%+ywlSnLpZQJ=-n>vVxo zWyBUHfzUAN0P9oHFNM3_na#abh?8=yBjs0+pGINiGpJKe^5}2Y;6CvJFG=h+75>usrO3#eqE2k5g!-80CEh> z4z5LL;b>v?w$CN?nF+2QQI%&pR7SiPS-&zyu)!s}DPz z%2zs{_^qUW!p~|y^ffti~l*20er&J+2J5`pphrRi`fa^vMB+leK#v z*U@YQBgh~f1Th2Ec-@APX7H`Jf(}L<>Tn2LD1;DGZ#qSL{1hEpjFlbQvjc6KhEhR_ zu0I1#K2pU!tsY&57@&uG@pr^N1feS=QcH@n0hwC)xF~a=@ zWAKkAan}aQ>~~v74MyS^6PD1mK*A1=v~MWVVFq&oE-Fz*hpN?K4M#TsE*r_AMSDty zpfO0m^s-=#%YaQUGy4fXQ2l}@v*u%7T{=c;2C#JH5r&#kMuD7K)P9!+uMif#ja< z0!|s?u|-CvH?XvIf&R$QaX1Lb4WWjo(?#h%HUAe`I*-3IU78H&P)I_avKdH-CI<$#`Yvx^;i9J;)c<V0kRy z?bcu~<_=-jCCGgr;-tgYy5q%y$BT=QT>JUBi#}KRjeqOa5Xw>uDgo{GS+8~tN5*9_ zg`v&VeB$=g=>7XoUDoY;TGR`F)JfIM%Gio3y9<|YukLrZw@+dhB>O3@p2@-avU*gs zR8q-Eq4jfQk(bqs~=c1D(2>f<^+3YjvRXiktExQjwkWatJo(Oiw3}a7!RHWnT2~o9{COp zs~Yfllx6OAcMg_%jv!41pc;HB-)$8tz>S=xQ0zf?2kNMY%PLPaZ;EQYKD?>JO*G90 zFbJCo_6W(IRO4-OXpf{4+|uyrdiVBdiC%=gW|*l&PQ1RXMynO(1(IbfAXq|tRGoUH z62}(S3maAVniPf~Z7q%KkvaF3?0rd9F%~J^7~ktH{%PN-B8Rl-qk+HBDO=cp2q|oa zE^qdYTLO4eZ$(KVhMy4xSg+e;@=WY_b*&+6*{G3l;dXQ!pQm9hqn-i5pK~M>6UdF4 zr~S(Xjz!fytk4PC2z6O<`SN%P$XB*$96d=6_^M;A9IY0*kr#PNU`8YO$;62it&%JM z_Q?M7Y+4*|&64inD%MNs;I5H_vfF{r8qsoBi32wuNECnRTvEW!qbF|;Tr555;l*I@ zYPc{R0Bw%8abH@ou(jR{&Z-?^%@?*ViMeD1!fbGCoPyAU|o#Np8h>0`2GNrfrpB zmafv@>7w;@@*4+4J)r~VMUSRW|7abg151ffRejtKTw(vBXS*6tKwOV9OXhjhYnLw2 z+eq#fjc!>C$7)u-v>BY~yxFdn242y^TA9-Mb@t(Ra@(OSN3T)M(>qeM&aY|?iV zQ+#?`i3GjyqmU>zp2y|bXcsiz3Y}oHlsNNmOq1-kMV{LirpH$ z<<&oEX7(VkQN4JGhZkgl>|O3?1VJ_SWPRE3Kx@X^YKC&mP|9TDZ2p54;Lov z;7&faaM~WhW~VPAUtM>nzx|aylBJ?y`EvSgm?T0Rbxo$GCXr-wiO*2?e&*xrtmi+>wcBeso7On_5X9O-Fm?OvSfGY1_gED)rJ-;I7oYFsLg3bXUXHl&kG_F!kfoH*0UrU~9A5wIs(3jnC)@$GZ z5gi?Vsq^p3-+Q}R24R($Iaq!^I$$-&O>iS;IiX&0nrn%diux0Jvzc zS8SKqK5<{&__Vc)KScnW{9^ShBac3%2;Mz%;d~ISOEe<<@Xe#ELV{#NLK%#_Gj*Mh z1+E*5Uq-~t1)GTo9g7Jg!-#S1t1x8YcT?7U0V~7bJ@Eu==K%!`mtNW6$Rhjf;o#|xB&LaecdOP7%all!jgEpSs<3nX^14ncBq4MCRn^Gx^^98eAc(y)TqGiH z!xIx>xV*P0>dCOV6Oq^n@P+^x39?lvKphN<@Z$P{J*tiZEmJ{BP8elKTI&OAceCt2 zw=l0Fi0f0e=;Wl2BO2astyDU(N^;%mMGXodO_k~Z>eiSLR?mZd%*lBlc~;8vvH-Yi zW+$qZHWqD|+|r_bdv^Z4p`%IM3 z-&4sjruV)z2CikeQH7Fik2h8znUFfnG~5bW0)BX9*StKwG*yv=h{PzA6=?S7n+n|y zX;17rkm7LXQ_r$E#eKW5!|x4rUElj=kFg^N#|xSiDRn?Bu2&0eTsx_Fcp(fyK06GB zE=XGDkgi}+1-N|AXb0(t>&2G*2n!7i z_D~?>?QZkNeTPcjYUj~tQWbuQf0gJRfA)oTcc#(qD>BiGIMA>exYMbUkGByx#mVBS zz>sJts0I59Wz~iSNSTQsv36h5q=T3Rqv3l7G!S@<;dW4trZ(Md2t0ere!8e2d^1EVocxyZXa#r*HiYh1)#OTxHLPD0JejC>Ngp zDAldIdAfdTj>~ubCwL*tzwdQ+C73GnBgu+8nue#JN7Pwvi&cDz1p4JODwmCT@rj8a znamXJzH#;aai7O#(v!nA_+EAoJvLs4LLECr<`;5FRD=PO@oo;k9~3lkL(e5d&>3MeTW)w?1R9i8nigpOUI+ zO#LQYB7$elxkpaG^az<;13*NG?DWT7KUzL=$L??O`d1?&QTV=mFD)j`m-$`? z^UeN*Lz^A;o=-f88N5Y6h2lO_g={NC>p6>C-{f_>GIL=>;f z9Ubd2E)JBrNeg5_h;RmG#o6(2KN#Z6=bx)H1@;cbfSdx_hd-E<%O-t#;KK!N0yjb# zwN)0bYW(4~_FmPW)B(S8*a1%qB);3s94 z4Bwe-9NC^WlX{ZUJw}qVv8XC-()8Y-SC13SS0?V4PLJ>q*Jx@efpZup=`*mOZC zy12c0WBGf$nTO_QNMGk^V^%N{qAC%jBc>w#Jk}G z95F*>L{>y*JN)lWlS;GX2#Ly$T>gBCAEmj0f~kQ^%AWiNleIogH5iC6-JHBIz~6cf zY%#%1{7AV{oZFr@AVXtJctNcgw=-f(h1n&SV1qO<&m%Xmfx zHje)`d|RR>{XeA;y?1r@3sKc*SEg|Rg#vA|QK%iJo>HFk>zP=<_*R$VY+L&JQib|W zyEXy2BGRa`kH7e-V&oLDzg*LHtK&YqUi&6_HWRW>c{T}(Xh=mf#S>40BZ)WF7t%N? zy7X9I{cip8=mu#U+DDj)8}YK;zium~pIBuxZf{Zat`EPfa}WN7S({*gzWhzDGGrnBo0nO(TdnlzAJaZR)ouai_E^`;Yb8b5Cf$aeBSNK z{$>t^z9daXk&4Qyc6f_`x3Z*HSGID@3(p?$bMBPwJn*cEfkZ^5f-1bWvEuozcTl9G z))|FlG0kkmuT09$l4=udwP_D9MP`d@?QvIFWNi&Q1InGdd)QzpyRWI7Y!|7* zKGId=k_9)6N2b|4UJ{eDkP=CVp+dw_1Iw68`d~$IWJAUcx^%aUav(Ng)ckBWg|A0W zV)c446{)`j?!!yFTK;?Nn?Bm&^Oym?pxc?==L3FN@LhUE2vIC>FEPON>L@By}{;vF)$xn6&H*NN-tQvQGo>&lWQqpJlKa68$t>#Zq}7-|aw;Ql04mz*v0-dKA~ zsd;)~*swOc(raI*A`vo>5J0ZE_*7hA>4n7gH`Gjwgmpwwg*oOBEDgu|fEU*k!_2EE zr*71Zr_*Mo(Kr?8f{te`Iyfzhh^L71TTtIo>7>*p@BLeLRTwy*fX2t2_*$Uyjc?W; ztLZtoPK!&1QZpb%DEKxuGNO{u}l#t%tJ>Atz76!qRmM(GDyPO+@LBUmy-=p+T|#V|R|3@$aF3!C3>Z?C6w>{-2@wIG>8&+<#7zuv$(J z8QXMOV}s6WPVJe=vn1XiU*{!e{}lRpBi7mlr+Yc9kk=xU9PsEXN8~Ng&>QHfQsC{V zI0)UZN|xR^`-pVFTG<%#by<9oQT-|EU>^c*O?wiyz>-@_{UOQ@HW&R{F3sxv#{GH^ zE%@P~T799rQY)AaMGs6Sj*H2Jc}-(RE9`8*oSJ_rGd+)&@NQx&*Xj1bYQYto_0{~;e3&bybAu!DXBtp9l6?t)Xo*78#5YLc#^%;;H30@xwr@+2UF2(_PU7R!%*uAv zuvS4V-3x1+qaKdEo>$gx>%)Lrxp&YIupY4CyM!lwH5zJ0Bfs3qiLAOg#}qANj=k%> zT&Cy0V~PCtZ*q47J83S&je3ECsL&t8n;9;Ir2Ms)0w$3*ydT7%nw!39UJH(BESa^S z8wW?dQ_*C#J$9S9Db}ycRu(kOG*Qv}(SJ?mZzG7apAuW6QJ8YN+vu`wTU|cAclORX$+wcT=Kq<@A2TcWI$_xow&H-m{o-WfPiQKr#59ct_0(-w3tZ`r&@tFPgORts|O%VM9YM2_ygQ%{A zMjUp2JoT$gLCRlS{c^oCq=Q?Aw9L5<64QHpRi~Us_XKE@P$~r32RZA6Z5J-$ zJ!6`NIa`JmpL(ld?&5i1O80f^!Ag|f#rz9BiX=8|{<{}Muz@DfEo_`f5}JwXGNA<* z*BwE3eP1N09HZ>z#aExv9s=_Z{`jV=tq(C~wtm+cXhGlv*r>Y#c&iLPm&b@@zT-hX{oXC{w{oJLHMGQk@YdRVegE#kRwJ zffS*4B#9OYt!xKAklsg}==myCC9}sUbm7oSux2Ec?C(+)ZyWLKaE_=iA*Z{oU?s%& zjL9gOa+}hP2#;z`DNzhrir&Jr-Ik%;W!7XesBsKd$<^jZ8E*XxaPEfsFnq^FI!=O<32ZO!a8#j& z>D~`+A(F&}EN__~;A(;~hE=hhRb!y9n4&aGBk;HthLHt#ov~ohS9|dwNLX;}Su8=v z$$vnDAa!FxDRnvm`HSdpN*aN>7hbftQ%a9EGWLdsIBA@rmXJo+P;a%^yK$>7npeot z5IzjX{rY}7I!c26k$R0575(>$%1zwRUgjH`mUgBCSuS5BX$aDTU}E^IFLY*Iz(FYN z1u8pQ^~4DDhRTNEW{P}lRBEkCRk!X5Kf!| z7Mq*9gP2=cS3jtN{;=x5_hMgiKS8TbRz$vUoNF_`_B!u9E-A%LO}}XH2#~Ee$=aJ!glEvtn;CGdGLUy&1}sUs!P~v>cX#6iqIF`05nXD#U6uM|^E$_+*A1?U z0SmOGF%T6%ih2@7ZqNSDzkjgd1oj^~5ZnLv2Iv1WcG%gO{@d}lM&ln7P2_*MGO(Z% zJrqZ++cwh*MGs&=0sDUL(w8?|$^>uqVz0<_8W#olgHg~jdh)hsmR1i*jJ1g4kc=1<$O|ZcfzrJUysbY$J z8eHt(9IZy(%Il9fl@hPn3~eEXkbz^Su5qifmQcJ;BG4&*1Tnda|C8IkXCf9HOE2SV zyys6PN@y>>V@}y{Ghczvzsuc*=@n%xmW-j>5zJm;EX)QiVdsrtWBrW=X!^sup@Pr2zB^prM zhxKB=XJBP4`&fPYxDTzISE;#&HTe_d%`;hUi4`z3JryWh^&|=+aq{QIh=Jk< znitnns(wT$qTx=Zrt1mP+}8dEO#xP}{LQtKd%!U^wi7&VN2cecEvkzjNIVIRQ}^+e z^R{JTGjZ)aiSct4SYK~f`dr!cf}AA8o+C`+*_I>|=SC81zqHEO|Dii)7|Q&^S?)4{ z-^Iobto(>zZrWGz?Xz%v>J`GE-L^Lh==Jh5hc77*p3cU*lqgGD;3NI9VFDQ%4JM&C zdRe~)jL176O}$p{<7Zp2w#bOZ#3awB+crZ^&kSuW!>)@K#%A({9+=;jrk=g z(z1-msT@GZIZxUZk1cFU`1~KK0D>2%o~_-s?9KhuMd|oK$%Q4Y&nr7;ttzsIwN#`I zMP?LmM774k&M3kyL3qY=MF#~#?Ig#aL0VL??Z@6AZSuqmmu-lt6~lB^BjE8JbMNcm zt>-aS+q4gEnPy59?T)3B5bqV#?GMO8@A*xA07zAJBJD7|1<`T9U-p+C^^1R^a{nBzc`E(*w^iP)P|P#<7qJ-}}%i zt_FItmi*j&+QSl17EXe#)7|%lP?A=vvVd@8*yE?*uy7Vq+RB+R!4H!ckg5Q4fX4m?BY2EbC#+_fkLFIVekSDk!tA$ujr%z6B>y-llfD#~QOBwOOM zGy70`3*}zo2&qncvX&i>@X=oKHDZYhi)_{38GYZ%AHLaVvT9!p-7n1R&*P!1mla+{ zk7E{3;08`oL`dNRu4~(BF6oK(%zj_dj5SwZw(3bkU629P3#rCbK!r>^Rw1;wSJ6Jb zC47-A8>(afL4JK2JukryME|+YAfpL0JnhGEk@NXQxAD_+^y4|+!Lhx3x2;r>Of{Z7 z{LHuBW<}z!Y2m4=v0gegvXHs$02b4acGFnyFE8oBDlj$js?aq;lO>t3t4-jMY=4o@ z2ykEx8d$;Ff?pjK;v;(I=>_JdWaSww2n0DdrCv)HKFd|jo0H%@DWL9V;eVY*5S21U zx|D2M_nx{LQiLTFS&%8KQ`GOd*EEaGBf|~bzo5I963Fdpb7WzeZRS;JgzGnc?>bCBm$!E5GmU7 zc7Dj~U|%{k-(=<{U^H>NCtsNS#OfmzIWW&4vL(@%@OHjGk~g(G6ZlWfljHv*fB3)6 zlZEBKmN$(2pY^S;k0g$M?(dQPhau>OE1jARRXuF|zx54GJECPn&1@p=^7}o3BxiV4 zN3j|!lqWrrD)C?}E?VPS-RSv5?C$mWeBHIOXnWhjs}S#;CUE14cO9lHhd|{Y{TIXZ z?xtQWswc(~OVy?br)1F#$oQZUy0g@_6q(4`x>L+Vej^1>0vi&<;XDlj0hVFE)Ne3?5&zXFXwkkDX z45?H|fUVLi5NRP21%?`$i3W;5q}f;vhHU-`2*5hqwD$+s!K|VA?77#KtduP%$*UdX zjR|^+HcQte2k*i`YT++ zLGSzh#O!%TUt%yg1Dftn!xU^DZC+ndq!33o{MN<(3*cg3OHQED7=+I^QoS4S5vC^O z7^83PhHN5_t*eAg+F-hW+I}btfwGo%v`7^*s8l?~l#xV?yiARaqL`aRTv50OZm+e- zd^zAx3Ph490hTG>Qqoj}t^3=CHG&TM!=R7-HO@^T*BU!+ztD~Dms1h;%Td|b-AZ{7 z4o-QVJlIZpSkbw~fNRj6-TCHJT%jWvQl%G!4bi%vROedWdHl5u zcLd=?48{=%Xq6a=;ATh{GK5hf6bt5sM)sJ@4rbz-9Iso{Ugihlcg#LBg>*2atVXl} z`7Q?7JbU<2-A4+KTRmQ$GN5`UGU{}4ouX&oKzde=5#-`D64xbNaawJ@q)pBOsz1jQ z(0ng+gg4wx&km4TN5Fm=N#l5X_?4W;Q|OE2;O)#UM`yUvD@%_??0L>z{L%RiRovHn zZ!#L9mKr5-7yGR5bbpK!M-s;LG(=3eauYfv3bO8CDVCHeeeU;hl-FfqG0J}1o7%Q+ zyzcNon>?PH=+;4)ZO&8@Q(ShKFwn}FbKnEJ^%OEe-yE0E?_=1~Mgd(Q{34<+z|iU` zBFL$S7N|cLU`0j!L+g=Ws0BSDo^>`7LJ%A*)KA2+-X!vyw`EjuJt(7$b}}@Xf!1hP zQqX+6(Lb)pO%9$oW!I=zdxhq8gEA5i#CzVWzphXNt^e|^x80hTn*RxOF5eez5W@rL#PO$RrfKiM&E3ncX7BI-6pkkS>Rb%Pd%y&vWf>9w7a35bskMo9>N%n(C1^7o2bQgaE=-e;g#_Nknlr zk{L|i_{}2%g0eK*jCO9yJLa3{01SW`DyXla@ELwuJ!lO&LD>=$icy0Akh7%yEB%WT z+YBu1`xY6`9QU2*-E~qP>}|`^FpCB;yyL-N1n&XG3~_((cetog7D=f$Mqkd$Bl){g zbcd{Ie=FlKpPaW{XcO>i=jQ}#>^$x#G}QX$X>%^EFhuhZWxt7e=O4U+lyCR71Yclo zj(|RB?!q5XuHKb9=`)Sb3TeZ}F!lj{jC6D3g_Q7-6he0PA0Sp*D%$^0^f~@RlpG@m z>wldBnuBE>cgS-0@g3<+N~xHq?-?KfGE7WN2G+J~hwP->79(+xICgXWd>#&-Rp zf$=PSeec0@EAHVW;qkBt-}m?D`{m@iONJtlIp>k7W1Esjo=Fo>P<7;%<}Jahd^JPZ z#?RoMh=@DDDevc?YyQ4{l2+Pg&n7kgw7R&|?ki%GUzwDMUZ^0EOo>aaNgZ+YG4bRe zY+CVUap}plxe^No2r3zA;KbV$*STzV`@%nc03e3Hkps0z$!>OrmGUFKyTHAk%p(9F zoxON8x;FX2J$>NQU3g~eta>+&(>+jZM%yX8VzY|JB5>Ci6ZWWYVpS1!#gTIM>CdTu<;ETy-;9a%yU-9xWJYINL0OX87=s>oChS+H z0sSd064YZIuXo=U{Fry4Y#u=$#cLPD90s;Qpr~I2E5)%C=jjhziiXwRbY%H=%10Q> zrZ=paX)+w%_X`-bwxUG>oJOJhCNw6w_pbs zjtFlvSKMB)4OqKBde3>~>h`qXSdVqk_xNTrhl8-qZ{{O%>V<(yXpo|w%O0zkF+sEw zI4)XVRr^gKtvcY*pd)%B4#~IX!WX*7lsUJFzT&P#188OnLr&djf`KeQEagLya{=Fo zY2CIbI-pp5N`Sd*gGPZF;h3Ejed^vc&|PBF=DM zk3$lQY(o*~VwVlY#LJ--{rCcCe`7&`cq`Ep37ezy$nb4z{W7(A`>?>!jQ`EXTLb?E zF7E{=P?y*l7hTZYcnS_6teA@|u8pMRIXHN$H9 zKIz|kyEuB`D&uO#Z|ElKA%S=NP|S}gU%0$?mIFI3Z3gBykym@OtyE{hjVJ<%)jg>b z4nZhoD;=d;?1axEsL52VmVzSsMuTSew;{Sn6{31yeskBa^M0M&JWzTcRhd|mxJiVO zItY10^R4gG?*rkC$CNU>C@`fkIIu1qhIhD4A-P> zPAtyvm;k+B@xJtPmsei0-R3l&dY1vzf24p6KWH0`wjYl^yX^(~O?MTlwGk8DKE8DC2MibEL4+R@G}9bRV;exVcm zZQP%s^Bkek%i+c`)zmW_)MxF6D(IHB7O;lU3JqM{3X{79D`|YyrT;^~_F`i$B&`Y{ z7ePB61g;I&m!gnGY9!1_WP`5bA(xolhZat6qbGo@o_@}UrW~B+kj{6a7uPll6%tQ4CmpGWU z$ojB9?L3;|7Z21IsI3Lc!{0BK_H7+~_SfYbRmDKU!p*B(Xcqc7U?8JmZ1K_fDfh zU_?q1JG8D&MZtJR8GGtIu`ivW`p0KfJZ6a5-aZTn6+|FP+WsqIDP+Wd(&YU^$o!9NS4LLO z|5}sx|Hkl~oq-#Pd50&$JjL5(iO-{1xZ7JIIgoEq5JkiibX|VFBXB0GHRi~Ifbpf{ z#d0w3@?eX1QN`|5AKd+HUSAwvlEpA3E+mV$ZH7<%ubXp{IJ>E{AuoMQbwc|eFnY$r zLTu#hLG;{HL;J|D<=w{;0~ z7cf|pcamMWR@+bep4lpx>z3JQA4bC`4QB0_4rtTP=EHZbrme%(1b($O&}}v zL}{T1a|ZDzXL1ub1S-QED6V{4Tilpl!yM=%K8ou+fh2Y zVR^_dubGQ+tfv$F=ikSJOi2=C5e)Kw5{3ZoBf455a!AQ{@o}CDStpQf8p?v*6mW4= zenPdZ1)M3A7vQQ2BN-GBx-veELh%0X0?=?wFSUenoUxWhX}osU$by0$tXB|qAWhkS zxAKM?KyP)Z^VX_34}<5MObXxzt>4bUKoC)@Od?+vz>eW`mut5{xFGvGNbfCu?Sw|z zc5!T6ULYAc)!I5}SMdjJdNl(5{tO#7Y#Ii3$p2fSh8W`T1940OCo>_HOsy z$5OeLK0s56qyoz`r!U7vnOiomd0^W8m;TMH=t4RQai6l;KjZX-=K3^H_GN)BajhyZ66`%Z)YKA1#X3Ik=pqyZ;%n&Hrn7;jm00|3ZBh0rzj}CvqXjZb z#`F>LuxOY-zg6A&%%IsF=5x*?(8<`mH28bDVrRNZzAoa4?xWkjeeZCG8YLkKC*b;t zJzVgCqC7!aGP0QSxWZOEX|bh0$6m9-xHv(3U#v1Xrxne>wobk%Y8XUyGij&EkRpj3 zU!0T9SbZi)*JYU~s(fn*nL&;dXG3eLr)J=)%UGndnV6MPxWYJ_yygT&NZ+5Q>5$7T z^5+p}6NOgUdsweme2)Tus{g-tVh=HUOXUB4 z^hV5q5%<2lhw$nISAqnf>r5#{90pIXq|gNd#9asRTm{BG zd5h+2tfIaW+M&6y$0#!5j8Oqqw){K(sAzMgjwdGHTfc5M(fk+fN~6e!?cK|lkawvM zuMnc%&LB6Fh~@dgiF#+^_ z$eMzKUDqL%iOAUIyP5y;6OC}dwz`7J*PSqoBJw`JfVq&N{>Hi#zp-2rBFg5I8lEl5 zk(R7%w@*+iCRKT})IY;7O-QxSZ+Q>wC!5SQralfY3h!-MovCYbwY?|(Lc$~n3LGy( zexy$ZUUcu=IN&OG<7)McsXH94D<4Oc`f9s6@#3l(MPl)BBsD zjIn^EA7t@j^8k6HbS0NIjRo z9FnU@;9khbiVsvyQX}n?s4=Ar>C_w*+oPG^-g)AQOs`+&D1`(LU0;QZx`@Scp-KA~ z*5+T+!bZw|+eVbgSqc;6hOekNNGG?bNIldO>!+@tly#*T8g)o+kRdcNS>N{ZdFy?? z)c-Xf03L-Jqqhnk7FRH))5MHo(8pdkxMns~@eHco`-n6IEtqVS z?CA_2giKxTasVd8C7j~W1Q1gM;jqdf`Bm#b6?RM^ z%bxa@5{kp0q+d#P>PFDV{O_Ig;#@zZzCk7183BXkmabaflhvU_-#6;1MaIgeqmJrK zHf{di%#!4nEcHV>Vyai*As7t{zz$(;Ih!&aPC@go;1qgZu}r-s~)Z+Q6%{u zWL`QkrGlm4CGFl$i{@m3)f-T>Scx_?oFKGEVi?i|@(_&uNw`5Zg%zts>i>(M0?b3i}`d& z4$T#3Q;Hynop=kd<#?SjJMzF$a-gv;xJGfu)ypaCqa25Y$oeEBb#rf~LZXj3Mm^Wj zJXBbY1^q~{q2J#7t{OqV~ za?{S{q=}`C>KEmnT8b$S$fl>`H?{CbnpUJRTjrw2a?O@kNQ>OwjPb1+MZPE$i-@)m zE-Fx1tE+@dD4fH|hPI5DwjtloRi?bIj?WEZ>5u{^iU(B0pM~OU0Sy**q^dYvKzrdISfE&YkHl7z|r;g$hYOx=a&yxp8f&dZ^Aw zQAG=|AfhutCm^6wOG-geiT1hmdD&V%$3Hnj`5cW2?eT2|SY-#GeueT+3bt>*bS*h$ zmAER^wXJhagq0Ng-b6Orgguwmbh*NkQ?W};9dp%elKl!BQEZNgl5N`&i$9SuL!)@| zcWO5M;oxP`JW!Is5I)mMOyR(r@g|(i|M|=577X=A_>zD)s3nx438k$0d?f&SBGvSr z32sF)E7T^3ZRqxb`tQ-}&O%qpve%n+GH!a%9vNU9bK;dFk6jh-+RajF%#oS*E6^4) z)?504zI?2!NIgzLM~$P&E8T0RYmV(7WBZDFcVd_Oo4dlPI0e1 ztveKqc_ySt$GDzxJn&Uc)AKQDZHl z9Z0az^TU@ynXD(e)4jj`jDz&~5dWRfd|0@l4M&P)D!ucO{m%UKj4lvBp(azEhBE|^ z_`|@OBMov)j!=dFK?z2>qLAJ>QL(gYj>)!ba#BPO5CloZ`85$;M3qKW*Q4JpTep|o zu6=9)B1h^R(g za=owVj^poCc6dI>UR629E2a1c9XLLDAf)~fM#0)qZ2B21Tk-ISkwE~@6-P@8X+p9` z+=?}?MT*%l3vCy@V9Lq@jbv9eCfFqlXQRcFB6`4sP(?VO z0H~XC7fILv9tFiZ0VmC#l!!|jNvJ%F_Pp$z2bQi31!O*yhLmKUy6qEam++>AN5FDX z)}Rq&nV$Tz&Yihd*4x5+>x?I2L@CCFU`Wb*i|RDS|BO};%J5tL)X-RwMzzCg@ksRh zR-Q|KV(QPOE9THrTT%B&Nj{vgL;JVY6$aHUynD=`M5zPx5`uB|hSLpp5Hlz$SoYwZ zWNt;1QPT^5W|l;g@MM~kI?pJb>xG%&G5ID&m#kKKleu5_LiNK#cM+!wnBf4B+PYw! z0M=XmT<&jhZJwb9i27sDp9xPnV^m}}G%<4+A%JfZ^{L!GR`G(7{W3@y2)gAg#(HTE z$9toY-gG1?GCu^O;6UkUN=@1_o4wjd3EQ6_02%Ong$ib6>>&7%Jk2O41|VNar(ep^ zL+TqID-DP1G>~R`4&kD+;{-yeRy9B90-HKkG^i9u8MD0v141;Y9*yOROcAI-4B3tq z+)~_h9xM7!y8pnD?C4W5vREte z2Xt7P2KqmhtN(OK%gp>=m#Z9gY3Kh_uF9v=0YHIur4!Lv!?Ikq3@cA4?py$9$!uci z)Z*mwzTPNI(YeIyi3p(ft+BQ)!c>km2#&wcFq@|gmsMF^>EPH>k~rX(vPk5DGRh(v z1l3b}mz9^t1vDdf6wv_f7;Zz%Mp$b{q?YwbyJ{2b5Vl5s$)BEYc-mrSSh4{sdF-`S z2#6h*mZV1>!*G!bRO{jPByuGuK?$a4iNwJ`l0;_Gd&TJPO3^n86J%Xgy7qa8<5Vu9 zUysEUV6Oci*S*Ns9`KvNH6Gd#pKB>0wXLtdN;Fk>S#^!OFtsA4gP zvQZkTuq|r9x&g{}$SInStSWv$)$@cwc2 za0p>@i&0P28ICe|!85?5F~ayv6I}6jIj1$~NcpOOp`hW73N+Kf6*N_a`xrz0`Bsq8 z^ZJUXD9%N^U|?`GqI$oWf3EWAX9+}TZs~U9)vT(`ejkv(MJ%Q0%g$7XcreUG6bpB6 z8F1UWpYJ{68u;B3`Z3$fT4GLK;wc4HqkraARXgC3s{Pf>)fMe7+n~rO-w)M^rC~q!Vm+mA$Y6V8XCK!WbQN0 z7X(A7-~plItbCq=N5?z71aWAoA`g-W%Kct_oX2qdo3wOO-RLru^d7G)|yRA+fV{`?}2ZqJ*e=X=q-CHJ{5fsoGo{s19h*D*Z=pQg6 z0u0sw2h2k~Od!#CJ6*oC-g;Pi6cEg}3Rg4SWO<9_Ue;o`8gS0a_3G6XN068Qj%cDA zlQt?!n^EFwl@L>*Of_FJ`6<2L2b3xT_#4YE2E$G7a7Dj_8lOECJwf>4lD#^BMH5IR zHPF2HMlgcsJL}7z`ib+Ta>g6+vG}9&o_cjooP@A7+VdFAR@VMsWZm(-;*Te5{&hX8@1$ z*JZ@l-4-Dc1G$ti0A`y%v%>Jf>g)aM@@)3Bs484=5DvWCgYK5o3Q|vm=%mG19E^w3 zhGj|nK|UEx*MgEVJ-0xvQH1sohx5Ix_i4_&|(hA^0^aoZK(E{~T*X zV+)@n5ZZ`_kJ4%27C3?Xf_(ssS~hGrRkq zf8*78l2APy&WahUEPS3fH0Ku0typ8Q+7&;4=ulUTbCz<&9+PD4zQe%<)tVJ57bzNG zPArl_ok%m&gdZdpDZp-sZDAw3-(P?{wB_6_bDA}%BSWQbe5RA@B^H63**+r=kHH;E zXg1OLz=gMHqg=ec71t)&uu*-j5%+lRqMYo@2j9G02oO})BzIQk>q!R?#3faiN>{OH zzNcjsSASBSm&-6aJYt;nuUMc=XCVcKFYJuRY3!}u#ql)!1C`!;Nhuef1V&5$WbXd0 zJDGJ&oXN&~Y0){^>|ar^!L}MH`MGLtUNUJ)?Ty1)oPIYx?dA_Ndfv(FH!0z2821bh zvUk*I=x$GU7#!vA^SK|6J^Ra5hv8eRg~fljaV2h^ob%wjt~i7!t_W5tYYB24qb}4_ zL(f8YZ)&=dn=kXjv;r49wkg`lqAOI@d@ia{U`AyL7(nQTb~}=(4=Rz2oUTLY=A3Xd zIAoczO}9%Tk!`e0pPgPxHiZGMCD--4uCJ9*Emj7@U|JZ*p6%7t#fAKbO9pNcHI*Ip z&Q|%B{2aO;TKp9-u&@Od$&?eq8P-mbAQ~<&K)J9F31P`bC!>^^UpdKbBg&<(f`AVh zMp+))RXCh5$f$y523u7lr7wp1!^mS$Ns$Y7AsMuVPAQ5jT1>hCetg?WL%90!ZN~~m z@#+O87HoZ%hL%V(%%@octS6htjgCN5fI^h1AabCvn@g!Ln?a$8zly7jg^2F4UCL&E zb!MydnXvnQA0?Uy@!rPS&oWIh!nA8xSg_w_k`Ze9i+xp+akpAVEu|n4W*LA4Q}6E( zDg`6)ag{?u96;u__HkuxkxrGQ-IV3HEQhjM>jgXbqCmGm3ut$#8JqId^AD?1oAz3X zpjvA?Ht@chh&v>m%N`xmn1OCi<5Sb@P$#Xu4pPej zM2~h5Q$buM!5lmnBQT2wH&VbG4-XT9wr%)MTH1~HHynB)=%bhIpZki#w#&-;EAHPk zOR6Oj~|*_k=VzKiUX?+xt|GyM#J1@UwXYh4Ibs z0K&|XoiO0pK*^tr8F1pFcLko4fLT^uLF~7Xi7=ngeO7)x1&i{_{P&rY8~3-r&mq@r z0r#JqK6f3pIsICMq{7;%npWmrl}p*@FQ0{C_&&GH;FsX10G{|(ls7@5Tj6#A2S5*G zf5g|l0HR$s?vXgK-eNYGhw$7GuZm(%>v3~01bhHXZR@h zbt{Hfb-|>mmW5l z)4;v+uoe`2f%gJrjl+V8i;nH%HvT3b8Et5ha1YVV%?ZE;i5c%UwZ$_4#Ar%Z@hIyZ zBMR9a-1PK1MLpk97m4Rov=<%|51%=FK|)&ZvYf%bGbgaeiMM`8uS|mHd%b-VP63s^ zJH0Q^O4O>5a{+7;YFQ%Eq2IhwJMITKq3+7yKQvS3|DZ!+V*c-)8zq{%N&k`;eRul? z?Vo3|RTcY|i?53CEw z8p#ksb0IBFs~}8&+wD#TkZDeVMj6+2;YY+&m<++_#t3!pu$o=sy1ts&{DQRYY@17j zN^j;bx0;)+oFyEH%f}yalTe78FVh^+qaqkfI z9%sQ>U}$!IbKy)#9l^O7H;GnaGZ~-54Tww>nU>$Cp}3%L{wNrxH*vaR(->HI({6^^vNjjk_8!zCkUDxH=4Mt{w%x8hZWm~2J`lwLky~HQpm~Qx)j>A!DJ0g2DrJ;8=#R&u! zx28@)I;SFc9 zlTK-LRwpj4Y;=;T5%-Sw_P!McuM?wSjhIngQBlMU%4(;H8h!4LB6jwn9<_IzyMHA0$F{jwCD>r{i43p*1Y00nYY zqz?h-!V#jzGo*gU`S%O{P6~~IzJlDri5eIE{yoR4-to_U{_Be>GpDp7)v!2XoTG;~ zZ#E(aMB-QK7q131x@*a}C4#>RJh^?cN+XwI*N|1h-|xRT7jwsfKwe(uzAP(eQQ%yS z66cnB zeQ0c0a%LjVgM#pnz^Xe&mAhc}=xoSi`7DQ6uNN86#xRkOb@-#AA}NW?POf9f0;!QR zJLQPh+rr12sFCJ2Q+h;}v)xch)IDE)0QYdWmotiZZ=AyUeoCUuuw8+t8l8tG24J8} z=y+ZyYY=tFNALB0ClZ*Z1t9bck@{22<$lHGYJF8>ZZ;=CZM9@OU^Lgf$g{pUb@b^= zh{mw~?T{PD?)ge3?_4RJs3E&F7#G(+l7B5|9-q=2l*pB+GfDlNMgvWtCH?P&4Dj() zdx{(T0eT4~cqNhm(8tP>@o_nZN*kpWVRr>gD-5F?rsv#U>Ktsj#p7EWSi(TWiG#yw zV&d{ihD!4(CULo)u>LA!^zvsV1 zIy&L1iC~@@wS@rKL=Jt`>!FV@c-IHe%e>;roIQe({6a>llIG43=#fCp;<3o30vzf|G9K53`;(Cbf|rj*)<7@HQ#~lHO_n4)uqxbdRb?{ z^&U8&gzMu=1+~Iqmp*g$z^|CN8IhAmhTZb)V=R-ez8x{&EJ0Mr>5+Mdx`J5c-)0f> z^Z2^y_W9_7$g)rb#w{>lRk{tAVK0W6PIr4dAK6z!Gz*F3N==$gc)@cSxOt=BsJvZ=_g(eTK+!KMcFznPXEV{vI|j>*qDS)C~4J z8Yd#$@*!d>9+HDkoX{Uo;7IY+|1^~SCk+7WzftXfKmY$ghnWoBq%1bH(A!sahw~ij zNHV0re^KU4vRv1?IP$;eU6^QBHmv?SBy`Jd@b8k6K_OLhTo$kYl0G=j#ysaa82aA_ z&gU>)yJeSE;3k!z z%N@Bhqi#>h4kAmhiEnWv?9RxrI65=U6iavn1Iz@o8IuEF>1V`}xqfyqq({XLpy&bk zG#B@!oLk8UVUh#Wm+Y}f((BE>c{UF{e_Cv;)O$R;&^KBi3y~b^>4UF-k*a86P)M`q zP#}Fomb*1IA%&DuNsiM_4^NQ6X%^(=7fMCyFHgk>%a@!*6LXn$d^Jh`dz4zSaJte#39WG zJ{dm1l#6)$`^}OnXB6@HLjY6Y+mut*ubEkhy^B@Lpj#Ol!iH&Oa4QnM3_U@Yo=9cJj@=W1buGxW*WrXS};PXH(~S zcGkJr+5iWNH)$UrIdLJ$nW8_qbP#islu^hd%)*^jk?=|O|1kEAL9#XLnr+**ZSS^i z+ugfu+ctOGwryLxZQJgizH{!GnTY$v#EGaMD=I1~vevuu&B`YqD0K}_EK8y1>Ou9R;3-XMS%XpUCGdK?;ts>q?A)qPc>Lz}AeRo5 z?lyETzg4SDrw1A~#G>`m&2Wp{N&bbYY!|Gvv+?D$V6230QXqW(!GT)GXPRG_PF#R3 z+gEX>@4~gvj`$QHA(?lSaLPlyIWCxLx63lFS|mT-sMvbe*=#fjcknp;)M0FDY?L|@ z(>`gcO~oCgU}^e}eUiS4y%fRekyLw=^(Fc@e!ZA>aJb0!;;%s44>B`>RIHz;oP_4t zs#r=&`i%&s6N=ea@i_g$P!QafzyXR??!CSNSu$1OZGn#I0kjpdCm7N0X4Yh?Ii*hm zMN57RVS@T@BcSi()`w;JTlK9?1EODtG~QT+WgHf>c(SH4QuSb5yBjfTYqcHOWJw2| z-0JZ+U2+pF7kWHAw5^bjdMt~C!o!?HA*ST(jiIU9Xwan8(%+z32moI-Sr#e8p@vks zCFLV*`byU&el(MHdFi$0n5n#tzox)P>jlcPwtQ$pLZ?Ev!xC4*S}=$L^jhnkl$m=n z-Kb~WCyrpfT+z;Fi_rJA@?6E{y5FQt%}cDA2}!vWm~3gCn|M?TzYo~<%sW%LEW{1O zim!Z2QiYP!X)h$&tToGARZgB})-J;`_A^4i z++26PoHr!6(RB{sBZ>QA`id9mpQ@=+Y{&r=dA_nkAFH2N5t+L;`N@`gmwW$L{ub~ejYRw#MLVF@@)fYSKjGC= zEu23QGaI;u11Xh8GhdHXd_AdZ{;v*tG!eX8Jl(r&PYWKcnVX9dYO9=W`WoGyV=J_R zFyTI{R}ScY%o0Q*nsi#V2ELb1Uihzc&c+1YG^Y0UuU4vwl;Bn0SwqK_IsfroAwv zkgTTjUOK9Z*3H}Io;BM8Ex&Y8>cr{mgS)3ps;bcmiyh-5t0)#*0&yK>rvkw3j1BFe zL`V!wW4ODv>($rqXE9gq8^6v4e5D*MVkeX`*zPRL<^6$aI!YqI~F(pMjZ)noq zLP-JmF7zy~W!I@JeDVajJ-RqM>>C4Lr$fuD6 z?&KtKbChz}AJ|}A*=4ueg%(4)_S`H@329bgdsB!V()Z<_G$!IHRGJX#VummGQ8K?P zQrA@wzGSVu_Y^ATV=YJnl@AkfRG<(eX0H2`K z@?oV%HmVj&{Yovald3>*6a4aZ?AnP>L1ZTAlR6(C&im42W)sSIPFv9gg)&?d<={~+ z)65Dw(rr!y~{V zmb`DMoLf&`jV$1RkA**%&7w|B2U%cjFT}xmZ^!sw%luwH0nXEcZ#KKuuVd2V>-?*X z6=0N>2&4HM21$#yTn#Jscm`WxRaeLJ?D(ZU5didd%TuI4R0jrBTAWvl;oquI! z56*-tOGtSLNQr3$o)?prGlp&RnT(T9^Id%%0UtKFlfu8R9!N6}I5H_hBolG}yVz;m zC6h2j)TUveeNm!>{e?NH!*mz|VflVJo_!FE`FY4}*P2>SRGO;A_7+&Yk6#843uLR1 z3a=h5@svybwNl0hTu8*@tuiMr(G#ClU6c2B?!Jr*`9?^8=+d88UZuy#Dc00tJg4fb zDr{|I#^FQefu@Jc?i~H(CSr$P4v!h;K=1aA7APZAqk-F{eY~u=Om6G#`BTSYV`WNc zblKoeXtw!fCMkaXck_^k`57-g5~LVo5(0_D+Jt}{Y3Dc^LsDz-jt>3!@VQ@&dny3* z^JZbTI$3TXW29X4;m<8e;f`WY@kGwTpU`DPJ22b#ql+-1$A-RZu;)h~s!xpueO=|q zjWk^S_k8FkOv`PpTJUz_O3I0i#EO_GED{(*f_WAR18w~=X9~6FR<%AoKm4kGc2Qx2 zZ@W=bx08X&o5dC%pVzJYT!}wjlj2EsU+}r(i>MBhM$`GbRr@|jj561i)P;-8jbg`C z>|70=8+90!tyu+Y0awn-C74*SwLJ`oSqBeI=vA1qkZgM=LaPR?_u9Oj0FR&Q`hz7u zx13M~+h)_;Nhm-1$aVCH$(3I00gwu~Su%0tk~{hbyD9YN!-yxq0rv0Vx#SR&6$C`s`=2PhzoA+IZL<5qwiAWNghnwNc9D06!O$*u@ zostH8VSfUUJy@&SwoQ=C7IZ+qo{sL9BN;p!CO%Y)*0%1|pfR$PGWvWkM;#lV$7-!A zJ?jC2JD=HipXald^B$jjvKUkHfGO33?l?sJzZRmBX5vKm_cS2dp-L6>_~T-uL;m#l zZiC8~m-6Su;An=Yn}5;J``_33s%s#W|Nh8-mJq$n;6bWG4aF)H&%2I{K4n=!E?qPD ziy6BVPzA8HxQ^J@NuEtI`lbr$9lF!M>T9ejJdEPSk=%+4O3JA`XGyyr&@2wOs(xI+ z_9xX9LK z6A_VS;68m$(v@2bq52fdDNxB{;qjL%2_Kcxqn39P9f(d#(zO#_=X8{gFiXo;WR8x4Hg3RYeYKgsJ6TdITw7x^8Cu{MC2M1UI)B#i@Ay z6oaZAQ^~;$oRqh3a`gFd<(cF6y>=R+Kb@k+u}Rr!OCqsfbRTE#WUZas^Q*Ck=cz!L zmmMV>vO)1#|1lMZ&ErjUW&M|9UdYz69rbahTe!9x-}VjOFUv4`R9e`awe;?sRp|@z z(~P;?Jiv-#JWCII9=(L!^e^}V+W7+JmZ=T>ETzVFQ^BFxtui0;$9})q62jaVT|0Se z=C;9jt7~aP5%Q+CO@DLaG zMj3D31O)+6YjdiPcsg*PyL;TeiGsA*X-=Nw7A*}zDvFlBt>hwO|C|$4_@N|OIJrw8 zM5^(o#US>|TFjksZ$9C6wf=>d8}cO3`0>ulEtf;-UIrRaxkgf=Q(&jno*@Nc$nA%V zF36ss{C!~VQcn6UKoSPQ+Sd}0jd1Kr*L|Qg4}5|c>jlEjD5@`SM~UDPFp+#SL`3Wz zOk{_SGQtBUg+3HS0JpQrLh1%|4{;q`bc~me4pJVo1s8$dM8#T_CZUd)Xqa69cqT~i z>$4*=GuSbXQenD!w(a}_S&08KQ+Ibzc9gr}Hlju+$|}y449LL;FD*ucF5W+==lRQp`4%U{!^DkFvIcwY7hdo=@Sj1xtWo`3)bDR-gNMbb@r*8&jxO7CC9Az`+2KXX1@~8}@tDg{H!hH2#|LdLw z@81z6$Ee$?Y4pqjq_}i2i%D3aaCE~){Zl|I$9rTdmaSMGO6k78JzjZAkuuK%bom4h zIl4|nTUwqQyD>8iMIURKtF41^n{?%c)|Jzq1qdtv0H%fY=# ztFeI7^2J>BR%CJ1Cr#^GT5yw~Ts^cbNnj6Aa{?QeGw7X8l#JkE6Hm>x>I^{d{S_cY zeHt^X3mgJ_p(o7t;8~Hte6VDOEwt#`C=d6>NwrVP=|=9}2(dNx%y#X2AJXnje2kx7 znNni^gx72(Qgeuw=!@vueBXnI)G!68rhsL)l%cF znOuswO1#;ji84CYWgNa5ehda6Ex$=lH|J&cxaOl*CBZ zxSG(%O4w`SJz*UQDEuR{`{Y1N@Lrde&kMEF=ER?De{z}uFUxcp{@ z#0R^-Z`Rr;s$kIAUj{Yx4TMip`*D})4~`}8EF`vNA0=aCnLlsdNLx7`9r;>YQa&A{ z;;jHnio8Qey&EUVZKKsbjTSOo*LvF6yoUs&@uz=|UQ{Ty!K7^r!=pPZ=E+Okmo!3SQ$_v`zGrql-&{%#Jyqxcv}y+(A#x-I5! ztc!M(L-Q_Ig1dWK}`*MREC8U*>G4$|Yue8YOAUx?Uv9r^QhnEfTKzZdXVH0JDyy791 zPilHVGm&};u=#?do$bUQMTH4Z@O1LmwEbn`_J~I_klakJXL1q4^8%w1Ru^MK1KqJq zW0=ha^G@P@{zQK#w4X`F_|hv7k~vPx+;|g(gC4+ zUS@$ghpXWF zqd#RZPQ|Y2k{gmT!-kDA*5r59}9WsDhm(MttA^+d7F_!-uHpapE9~-kwY5w1^F+53o@##Pj1Oj*t%2^z{2nD?Mh>Lsh7$Z2+ z_rHQuX*DQmC`NFTphl1zUX=op>E?9=XESc0)S__3)AasG1_6n-NrEkTkYxM^7s6nK zvPt};5-kA9RLCY^yOS!wDrRUj0|+{p(2>_Abr$q>|~lXDXfgu(n1sb$kv|CAC+ks-`xh9S%UAn*^nVF%jn7rM%y zf~>Tv&10*yLXeaZvane-%_I9T{@W_plV*TWeN)UpR}{V**A(Xm&Zp9EUu#~4u%!s* z4@>Kxo;d@66p$5Nn+rq|f?gi+6P=xaj4I4p8RZO9kI_2-S%YP4IL_KyhOq_{LTn$h z1D4y@{MGK~w+3Tw5OPKXYzx(ay=AO4s_oYq#7g6caJQMqN_h|jR<;QvPq`@#%;OCv zC4P@-E{x@8Ivd8qht8%d$-~I58`2Duy8^?k;g8DPXt_jq1rE}^RA&GO4b}(~)(@v& zZ6o`bqpdLui?TanlPDHTw$SqJl^uLq@r-Ylc-ruKI&|@{hhw9<8&yNTu+nhx&q!@R+E8kIj&n4~qdFk5A#SrD- z@p`(@5zQ087mX+F;RQac({c^CGihyqa0*BRRnp<%x8FCA0&i!iMH59@Tr+(nW^2lU zA9eddAiX`^tzB7RwJFI8TV?!QKYvEJjuv75OJs3_h-jTc&w>H9e}*EbzwzeBfAg}U zrsVIhlX_SuNZ(b&TW7)|v&>&a_^(t<{VEnv@Cb6UbqS$Lk@Az?ao_v`lF?x_L#_8b z<+L8n)G~&aEJR{D&%KuWz2~=1eH=(Gc>6-bVX&lq7VhnsFP74{W=10&GU|Exoxm;eEXL zib91<;~{Va9;n>I$91tIu8*^+P|_XBy;H7gM{GL3n08Ys@nip8E z;cW-+hxkXhEJh$6~64o872trZ~GG=sq_O^y`0VRFYfu=A8|U2KzT zdOH-oA)_L=7_tvTjY=jV6-u>MUU#y`gD(}+3vDFd@kWN%B$9*{Miz1;2S`d4- z6&O>%T(N!18Z!+)iY=uXf8n7pmeFalPe1V~MZuyHb5o19$WLna1wa*`;vEaEkhD0d zoqJ`!&C}{^a^bJ3Qe_IXw_TqVWvPrj%@U;4(snICszK|vh9hR#UGM- zzrWwJo%3~L_yjo+%Xz6n5kvXm$F?wFii&3sTk3Eq zzv@I%vC_Q9C9eEJfoh6zV4+?BD^_63JdyS)j!k&Brlx`hi#lMnNf}l`t*1@7bf##$ zNjVq+S#n*ZT;PgwKg%ZexIB!3@5toX3c5*>8LthI zMe!gGn*C)MoiYXTK+2?e>Zjlt2obPhL!N!Nn!mT&8#f@OLNk{pxPL*K-qF1O>S}^YN)4&)67&GtFwlGN zoS87JYIs|vx>>3pKig}jTzNR}K51qVyo{R7qP!#KX6D?5o{M@%X>A-z4-Y!7)&KpI+bPhqtS}Bt znE`c@B4ycN92$PUbzFoT8?0?rn*Y9ygOxcmGX6oicjQ`grRwV&PPD=&BbuKY<2*HY zJJdYnUeh7m?MLO^^;G_niE7MR@!fvHWi7sdsI=j~h@7DFBB8;nRmP!XUJ+tye*{=VPaslKPI zW9Fz7M=Atx?8qXbw&L)T_Hs9Ev}{@#)1Hp0&Ru}))d3uuy0)w`%By-JOKM`$?%NIJ zr@tTcX(Whw#)MetG(94YZ>0S`n@3wn+UXfg?UKycpaM8BTmXYcbM%^H0!uc*{>&Fm zb9WfCC@@=2EY#v-drOaPQ)k?|xau9W&WAbg5NMfk{|5A}RU#e}Xokwye}xU1bz{Sz zC}0?|8tM~uWvQ*Ry~RLTW2miJub%nFnKX;)w)Ggj!K{asXL$~OR7*?nz_u&|HNhby z80>1|2An7CrexAo7byj~WE5PP^4=6oCJftbR`4k7EW??gv>Kuaey}pW_=Q0-(NTFZ z*B~&y9@C#c9X+j?l6VfR1z{7%5@Y{uSHHM=wakK@u&1c`qe5Uv%M*u>Q=0Kxz7xi* zwwo>hHBFOYh*FqjxWT;XkK@#J1!{9z*s#D-?98)Lr`&TdqG(~{2adURYGZD%=M-fY z{m!#?m_gKf{?m)`oiwkar&&(2GOVA~TNWU)8P}j^qN3m;qhrj|;G-5uaZCl|%x0$Z z=dz{|?@Z$49uxGN$DGqZYRZ)H>vbVjjsJ!lcFDsl!~fznP`4?nkbdyNnSm~B*xKl* z|E!rEcc}4_Z@tr2%Oz|tqu9!?a_!Tid0XgOI*tLx>6RWaO3>)!oUT{Wcciq= zhx64TO47^U>I+Yr!~ZHv0M!3IpWaUhtbf0gc?sduZpSdJ!vPmTM}b4fCM09`U%i6* zpDtxlV#3o``w4T2DBS;G+MZZtQWHQfV%iNDL51BI$rbH!l=%#w7w5gh8l!Bw41=HF zu1Z-W;`fW+a(>dhL~U6l4m{rQRWr_&VcoBV{$2x~fZ=u&H6bGCU3hlJV-(7oS5Z*~ z5?lza;whh%qtg5;h+H{Bw;a4=!SUlqVw)Kk0^gxZw{?ceOPr z%sd_M|B%!J{}l2vlZ7qmW>LRQdg6_`Vd{6nT|Arv*6Xshm}OxV7`dgO8#kEPff3@x zw84YS`1dDc3FOfl3;4MXs-FKffUgpu(V9voPC&}wGhTh*} zG55cwu5VMj9%p-SDhiShatCDwQ)gY(hkBN3%&-5nLjS*8@BcQsW@2LH{7;W$esa8j zv<8SjA!)O;8RdvDegOD%4m12fB152Sj6LTBr8@o zwMlrePQbfuSTelo^lpZpuU`)Idg=ATf)#0YR|Ulol{D$thB~<IU}``sBqrp%yCu zU*AJrx4pyv&RpMSXO?#+~MACzOFCKNM~sR$E-F zGNwvpuJ@;0>UBnK+5@t)s>9R+WTHe7rH`Uq-qskMLp_ID=%{Q}5miqE?dWcW0N?p$ zZdiw3jUAA$dr2wAEY4#p*)L0ItQ9voKRU@JRJ*>Du}Hmd0I99%(@0WC`^dqbjUOy;GAHZL+qRGr|uY6Bumz$YUX;vAokr%r){yu{|JNP&wHVJ zNInRT?M{-xngYQvEsQhyrXcyN_|2pU8PN~i^H2rhRbB0OgG<}*z;Zfq=p*Zm<>f50 ztR(PzV^1hw7ysVNQR+RX9n>;Ydo0h2af(wfp;9<&1aEE%>Ci_vw>_JTTZqo|1_~tM zFsgU}A+Fk(y{>D#>t1Pn+-hD2N>2xfN^K~)Y7MXzfx$g>r{aV0&8kMd;(-LWQldyC zhHw3`{U{v7M1=Z44E?iRTsIVoI6)g1L~gvaXZp?(Z1wjDdwlq^Obeab7&r7Ff(v z;0PI@#*?kHc(He)awv8%L%{>)T7Nk?8tG4E?uxCd!^Zud?gA5<)yiMJ&1o?ey5M0tixebVtFJn4eM zu?93d6ktwz+(;Ab8v?f&Sm=U9t*3DL@?$+z<2SX({9r3OT%xPgb{1jI8cZ?H-vE9a zGZ*Bnk$Ydi_D$tvZkYiC=#B_E1BZ{4S3o3AI3SY0aG6ISrz1_~stkn3U+xTI4gx{= zp@U0SYurhTjjansn3%0|sn1xZW9)5uf8wXt{w%U+HtH|c zmr@56-1dP&9PskZjdT%=ahs5wZd@PAke%8=hEWB5k4Qr|I3h0#TAHpk)EG6^j*Xf8i(TL3x7gY0 zW}P~nFa$z>-o$wBV#A(C9wj)kOkKsDSXK=@2ub&6!MM_!d^t50J0o!z{10P&p)6BX zbYAj<$=m(dTLqIdAUNEUNj>xfRSK2Ww9-m}D2e3iE7T?_Bt9BB@yv*05>}VukP*H> zAW8){iCPZ3Jv}^;B`o2kg_Hd-k^OT<6gRAh&@AC`n1aj$baP0@D9$CR6#EX9Q9=JY zCU-DNXL$Hh@eJ1;ONoe!A0pv6OidobcnC4A60ap!e=Z%21g0aqDH8+f zh z^`h&J2}gTfM^3g3jfKK#PdA#Cl_n6=!y9N%G_&N9t2@= zG7ofoMj}Mnz?H6On{?E>`{2R`^r4R)HC{25uU^MtYU@k*3K@}{++|8J zoxyA=gtaAEV2%q*$|`*Dk(n0$Ly{K9Kl;M6{O8f|OB(Ao8*B*P&uS;MaI+@j5sO7K z@3T^xC?bCOk==_T1iw$4psEfeHNh=>yNTl$gO{gu4+u^p)ktDFLKi2~31zyf#Jccn zO7ACj=pWO_K_D$IB(})~9q2cI2=`6%fk)u&G;SudKQPAn<5C4X;WH6Z{p|Cy>s8Wu z^iT8Yq5szY_Iez^s(b&O2O}w zK8=R2$0hkT3F2a!{ zSEE4j5U!pl{L5AkGI^qH5y5V#<(85WKXR+pValls!s%8}lcE84f2gNKIs&U02-CxW zwDbRdtFyY*^vFphC<(&ypn~$=_3%>9F`oz{ocNnY0g@!XN-t*rtE1jcc}W$uto}AB zQ2IeeKJtpaOD>{{i7_?(M^i9Q=Gj=^KtC_52Zot09{mxdXykHNIvobeHLysPk%$SU zmy<=zOhd-_ms7BC1}d;X#dJe73no0spSP;j)G}YAN^V|)@>O2r%54i2T#d>rM`u$Yv6V;+ z1V-%62AWt2)n5o7`FTojXiKQvO~ z|9(KcWL>5vNlmV#h(L1Q4o4{NWF|jCHbrdexvB_`&r&>S?mz1%M$^J}Fc+>kY|Nk# zD6>h=rzhzM8${)pZ3e>&z3BGq-4g6MyPEF`!5cK6&#FRWTF$(c(CDRGBpSop%Kh!D z0`!^&6f(1^jYN)Z+(jw#DKq-;@{3*s6Em-o~Pcfu^{ks^8 z1^+6>5j5J$q*Y(Pmq41zO1|SU^msBaRPhqTiKlD!{4RY~K!;)n3AM-eMFsMLm)i-E zid4eYxMRsU?^%sp@f# zqKA(PCin~JRa`ZQ{o(GLO@>!^?irP_f7k(Y{KF2Ik(uQ`-T_ak|DWz|533&KhFsKd z9ltCw3jm5_yq;Q2ae(S7qfBk%RJZ$Z%$-nrF1gXPneV;2bZB=J_J>m_=J*0<#@%&S z=8N&e1I`6Qs2>_vmeTMKN9N~HDs+px#n+AkvV5k?buE3C`4j`{k7qccL*i>fM~$gA3Th(&tjqpPUV24-DotX&?w8 zNN73gL)n;VO|N~?h}xTCQP;aFi%kwLeanPtCbL5jTU!HXeD8f+?N<-5V~=Qf1oonL zQWDd5@h#cTME0vlgDE{mm#Uy--09-*RSj!rm+wMva{cv`)7v zM-VDF<(0J;CCD0ZOfC|mhl=!9cP?VTzb%A^nE{(S5C8&)8^GBmFz-w&OKNT$#6$8z z+T%M{C!4Z@MY|X7KRmQXr*yPH_sC@_jD8k88VU!^1p*7q&Taz&e%V86#5l)-f%&Dk zUS$O{I&BJ+vGP=w$!T2@0N}bc^Zq9{@DIXT_?~mVzPqJPQg~&`BHbke*F(R(`3B5g ztE^1Jo({wImFXa*Qsoxc)vWVb$z93e>; zBP#HIguCq(IX@w!qH9hE>*44OeU47i!p5dNA+!If5^z{P05UmUnw`lOz*@BLkWzsx zFSgSMod~{7QvcZ*=WbCfzy-Uz0#j)xmH^O#@r^6pgo`^Km!y{=#|-)tpgRqhb~pnU zSZHPjj{09?(M`ftWdk!dV+O=+fRtR&z%=f-zfQZ}liW1vr53 zfLzPkyIC@6J%(_2;B?iI>l*a_%`Y=F|7eDT0FQ>mmzRz7*AC#!YUpHlBEo>dW#|O9 zi=WZTN|Ukn2O-rh#$aQs!chO2X!J@j*qN#@l|Kh7phIb`=_)WB*pW}2s;PCHUAZ^@ z{%!%fb}>9WlnJ(HL>6$h>66z^NPH$0AJ=DsT7BPU<+Y0hkifziwpb*^m7R%Yllg<6 z@}{9@99}MFL9krJNjnB+K}bv&QOdT@b4HH#zjsXN_Q76rBRY;WlCb1|0;beNet*P` zc@{|-Srsf;7PL^ypu_3(zw%X<@=OPd?qeT$7CaYEi{DVnsBex}O;6slE#_MjHb|@s zKMRFujRccP<-yw!U9ao*>7u!EiIPd3xbcR5mcyrSIazn*7~aS~$7{}9j!WO0H`)hd z;I-5!^Q7ja2_Zc{YG-kby@fHd!JX>()Hg{Xqs|nU z$8r#VOW-d+Qs)TZ0&E(D*ID>~V;jH*q5VTw=KKeR6z5MK#D9!Ss{KnL^}h|plz$Xb zNKMY5Oiq-|p;fd|-7I~%!i~hzDca$hnU^!q<0K}Mc^7V{*%TA0&-*xA1JpQHKscQ` z`VC*5nw_1J1^l@|Bnq{f;0ic)83g_F`pMuqDLtwkvN}PCrW5Sx;|~ia4X4fZikCxE zXDxlJ6V%xp*%XrI2ni^N3C%yn{8a<)szgPB#UYZOz|l z$s*NNYgcRy;a{`svPja5dvQd|*efEGVq>56nh0*afRGqMkg~uj`h%qqSIv<#k@DXb zXl^FaLPoe;N1lHOmkD164|#)qpKoJ_y?wbROGRV+B@t`W0AX+Q=5tu^{4#)jqs)^u zd32k~Da)tMje>%Mh;Mj_dZqrd4l56E-wfg1KDw&9Af-VW38Y*zIoIe_Xx7~Qo}(H) zNgDY*d5hgP-HtSU{CB{m1n*%VZX=M8k)ahAK`}%TW(48pL`_L04@&$or;^V-n=XwY zaBA$BdEKIuMzd>KyJppMX20TDPx@07t zBpVng#aO&L9_^`oeQSJJ3DztuV$|lv(y#*$8D%7JWMz$juzD*m4BjF17bhu%;2v=K zdpoTZzl*M|)B<12U1Y-i&MoBwi8N6!kQ_7K(0*9`AXewii=Swe94Er^&XE{AAz?Jf zURn(6_%2EM{vdpu_z;bts%b4dA`t@G-baJNl8U)(uuTFKmetB=UKZ23sF-kzErvjL zac8Q@X@`1O{Tqgmtb!9kayF5*Y#``T2aEQK3cPQb74uyVpT{ir@B{9?yFBj!HHnE?Jx%UMF zuL3AUoS`xfvFWKm~KKt>32Byw?&75;i(rZje}U}tmf3|E*#U~(cwRC1&D?u zTn~tcGs#|_GA*H+U6NqJMQMB$2y9xT700S`O*VjAfX18ZvorH1&)71#wvYbLZo&DZocy19N)ATW|Fm0F zsh=mVx59pR`v$*Lj!RF9qdcDNo6c_(Eld}sv#f80O0DP7u9;SZ#wILxIDUTsf{_RJ06>1++=NtoQfYsll67hlzhGDACo2*`N2(x=2$DK9RoVKqYb=n__hJRF z&~$YpeD7aQox7%M9}-2@yE%7ssJd%a`@s14yw0rmYIAV;C=Yn0AL6`ZSjHi$|l~nXO^?0|*-k&7+E`A!gu;dlw43K;*Up&Y^ z;z~TxcA0)TP#Pvj*I0a34K{ZeDX^leXz)e^e3?I;&;#e!ON*!TqC=qX#R3^5xg$ZK zNAUV=P9h;FqeTchAV^j`%d9`TykCzn#E;~QCw@aBYtR^{O&dL#wzecMUHJno`-CIP zU2BRBzM4K*WB)C8wp~A35lr*|lJQ}Etn=l-_kp7^Ch2GJV56Ddiya6s$qpIPm>a3d z)CdwO6xKX29!}3<-ZX%Oqe2qFle4Rp`DQ`egFq-d!uvj#w}lyL+l;=wjK1GJB(Re9 zWh%~#wK*sA;7Dm_-&8bE=lAy&K-1xEMWD)x&=yBJJuG65m*D(mpI47UB%80`m(?V% zvaCUcM4AKGQiEDU0fYV^bUCH`VZH=p(H0@-W}Wtaj-rSn0>^kxsc z+`nV3wbD+xvb_%G$ehp@S}?;a=j&Q?ZX}}6+KxIXEEz8qa&ZY5BPBi*7!1&H*=OS{ zf>TO5(2S1*O@Lxd7wE%NcSx=L1*Lm13URyMPG~sL;YX;Y#SgArsx~SK%rU(jtz{)d z&Vy~%H`nCad;njAp(<2U7^`&t1zkjCBli%k0<;oX7DH3bol-0#G)V#*Sgm{Z z6w=YQS*V6Rxvl;3DL3=;1I+IVfd@ygh}F=k%No#sieJaF$}kw}&(_n4*T+U%vnUnh z*Vf;6^v(IiT+gFdWglL#I!!la!hW}LuOI-+@27zhk!1OX0=IItZ_NzfAmxP@;L*`} z9=C;f)d@LHE=RL<|27zKm<-7V=;KkrQNbyH=v!8q8Jlts1k}pe+sQN>A>Pka!=PI1IW_$UD;T*fQe~xKtZS& z5M)KKC2fHfnne}Q_pJwd1`EYfJFKSSG_iK_<+0A2G%zw^+_cO-Rq5uyg3WeXnMX@R zLQd%lCGdL(XvQq~`!sEh{!y^Yq(1!_OdVc?Q$1);8*>2Q@bLhAb#tSq=3M}>U~wf* z_?wWd;oPv)>k#T@&kHpBMGKp-HQkJlijtn})B8|Y>lH^;^2 zeO)!x{Dthw%RFmdk^6+mqUYV7gSgBPG;RB^ziQcL$s~(^^~Uw1g;Rr$X56t$!5(FS zmE3B809T7$a`9Gf`jir~Gn{sX**95xb&!T!3(PzmU!K68bjHcD78v~rr_l4`%JRj$ zSg&X_Zmm<}r26`dH9O9PGD;~j8VF*Lxz3Lce3}C+FXW8oHP0VZM}u7Suj0G|d*mme z=;e=cRVNP)2-Q@T{_T=-FEU}abWw~GeXIG`Ct;45e`$jtIhM+y6Q3dLLmmJoC-w_L zY9~$r<(cgc-O>mJ*u5TAsau~2P#y1iM*?`gsWY;HCW3BJ2|vGe2MXhO|I=S2708eU zw!;c5&3LXsG_sdkaw3-yv zN~c;7RiG6vzu(Vx)h^j^_piUNd160pVw4H%i9!+}3oySGrE0!kZ~hl$@7N@0)NF~C zZC96VcG(Bn?V0t>S=fD5xC|s0Z(KIq9#%JbP165{* zZRVf(#GrMIiGT?EaC9HVgR%utex2hEbTMY&+7Va5za|a6h_AWAG3|&bOaVi%s$|4# zRjaD`CJDPdfn?z$HyGPKyyg-6(j*TqBFfm-?%o2~JPto7IKJsYI9nUP49`Pb*&({0 zRRhM0S(X(_yURYlpeTRtVOH|1oP9jjY5pQM*5r`J^O#n+BVDB2o}W2Tm`-Tl#yCp| zB=dcJba{SRoQhy4IW-C3l*RES zk11l`sDYwGoUw%$tN0L+h{rvt9{z4P1P~kBA1FExHrJ1fY|gN5xlE^VNCw@KTQhOw zg~&XzUbH#8k{plvL*C;?^u&};ztaDn>Fb+uD}bxR=J+Ukt&VTTb0dLHybS65towqk zg+W4WrHWx3(!mPt1n>no@n;GENtVc{&UO}@mgI;Dj%@mp`cVra;;_li;$1H=~KO0Ergo>{k=Qh@%`|b>#j~| z3F$e%?n6ZT#j!UPWagJETw~hevAc+0g}^G0!f@>u$v&f*4}#GVTGVn;z14gnXd1Op zhh~}lK@I0w%B0Q8-BVH3P3i%Bt3N?V*YcHqocFi1fxuPxmd{$6nsTr8(MQaB63G-f0wKHn|F~PUy|%c zr8Vry)fg~ALz=bwB0pNVL2{uVYO2AX0(j8sB?F*`aGRsxbr6wUgGz1@>Zqyw6rS1# zxPgv(myUY-aw#v#yjYe>%kfRFY?CEFHv>^*DFk9GENap!89NXU4p_QUzz~?7hDkPQ z3O*KaE%tD1l0u6VLBxHdK`Rsbwm+-~a!X=yS;vugS4NXVjVDIJ#psizVi_8h-17^L z^iX}N6Cgl#v!mFjajt^0AknORA8*65wz2Vlm;KRO(y*ZmBAS58p{$ANu$W&V+Fb@Ix*|X9+{dxa~n%Ft-2hYQbJvqLhcvO z^NoRctGT0dfNHQ=$5M~w6+}*xM%p(wd9$ybrv7nVG5m{u%0ofzcemcMD6}ZFL`1Q0i;F+`ur@|buX@C#GxSDty60+%0+gFl z>YMDsTbcv3wI=*0+#kMn*E#rrhb z{iQ#xmzP5-=9heidpmxl%(8yhe_kFqV&z+*hn$ywEi`fq3}-{S zmeud?3k@jbV*@!Rl4Bw7F!Gu;`VRw6Cg4X%+`P+^qd$!Y&}Xfv0ak;Svu@ZqiyZNoM#QTG$mRR8sgwg0Ca92h0ykL-v=fotfxpKpdAPCzursjhL+L z{z3w{Bxd9?2w58=vv6_PQ~$%ZN`$5J_+xx$v5p=PBwg{hLMQb!(s!GVGfp{Yh_Dl^ zQ*Bmjd8R!YRJ$WcmDIc<@HIZo&PgNK$;|PeH<9LGu4QW#hQLRzdU^1C6GQH2sJW7+ zOq@uFWANRB95gHITkgJVhC!Lh6IT6T z3(ulMlX-NT5TpuTI_jMrLWB(43(L?p$D`Ye>;v-fv73+`D+o9BIH~3n$d;x%5A*Fc z8d0(!yxssO0A;n;`LO&0R z(ljvLK3I`9^qIlH;DJnvD|*x-i5mjpJ@20{!Q~qRFo*M4au_xOpHbcoIH@!+_pkep z`M<*=%YYcHn%LowSNeyQn z`O=ZNBJV#+iKH7idgOog;WcDu^0bP}DTZdd_kH=R|*w3NXC z-=`Y}Ghr9I8*{kRM0?A*RJ69ndZCeUp)H~GHMyz?(@Ku4k8{-hw@voEt|T{zxjLsvC<#M4gS@LyUmnd<@S{6w1mnccU=Ing zu?Wfgy1F7_6t0*Snu2#O8%#dYKw9Lfn(@&zCFMfd@a zazF`8sgwjAiLi>AwL11olo?hs!a3&!Yu*U*jw(rDoxBFoteW;dT>#(}t%kt3De&|k z5+M5$Dv>Lm+hY>)_pfnGTG=~m&Mt)%?F7(7h8jr~`L>fna*H({oaU&NnokSY<}3uB zQzjr*xT$C3J;_PEttP3u6ZU%|q8L^LSoaLFA7OQtA%wU|D%!S_t4*zDs>SSgX7*{? z^Gw{=bJkdcAX&EBJ`+Pxe?}uchOyR2$rHkFQp~dG{dgp{PGePd^{1UOoA765*n-JV zu<&}xn=H227_$!3acHJGGr+mVn^eABPCp;&s%q08h4rDmlMVeZSlBBUpX9c$S(mAv z1Z+3rageiWAk9mQ*w~%Bz`q$dpT9PFGd?pg{Xq-@Q~EQ~XbA)`Tz7BwR98|~drxy{V1`lF zV2MU2hO8O7cna97@y^;-^T^%7ziqd;;LPnH%x-Rj_g>DAj-Ggu{fNs#6ZGog=OXP8 z!5LBl!>CtKdUeZ@+C;AJI1AQoa7cgTntYJT&p$5eN6+{~0>u0y82XHltULmjwA^mz z?$^U~e?fVvl#8AlDT3esct6V;|Jj|yO+3x>I!5;@YNzRVj1VaAHwILO)^r_RwXIR@ zJk_vWS)5-l;65gH80GZ9JJ8U;d&?RG`>SEZP=V{@(t$4=;n&)$9r_h)Hus*f^YUso zHQFuOzfsKe8Dlp!e(y?6Vm@>XxDF>%`33i?E&r?w!<7OJby3g!K%3Q?b9rtuQN77L zv&+J@P<;JI`xE_Cj(0;JCh*a{v!*;Vx~oaoX_?=VTk+vLgs71MwkuLZSy=n6^_kv> zVH5EvRsQx@#2ZvDto>a#3wKEvBk# zSXHTCaKk98hakpuE)iwFbZkUhzf8@e|UD{02Gm%)zur ztfr4&+Y>Ssi9Wmv0-z>U$OMjcA_vj@R6r4Y^<-&#B*>E3klAGQ-e2emsCq|x4XY>* zCF1Sl+@LV5U}z)`z)Mm#bNj`{{;jv~>S61ag<^?L->R>w|l4CiFnuAj!KQZXZ(sAB^|s7~y^P3BFbFGA$r%6FW9 zvp4|`X@K?BgtL$tLfy2hz|o5iB~r(f9zvy5QWInW{2EJbpK&nHAq6U%13sLwMkwUL z>hu)xfM!;5Sq@5m=PJH?H!CTg&om@TcRbgC>OH3y{v_ddEbFYHH-N`@5j~=$i2I>1{nip^+b05cyXi|^7_k0nZ?ljoqc%Z$b^I-F>y4a*Mx~GkClx#0AXfH$3F_2iRHh)9*p#i|FJDZ z<$p1EMi9N0Rd3>exGqf+CMAJLZhkpCqpN|}n#6&7)aC|PViF2EOhgzRo;&_6A0-e~ zA|&qRs(DjsuHsPUo?G{rdmm5wvyIoJYRh{zA}NeSoY&m>+_y4MiO8Smw%+%?_x-7- z;n)dTKSDR=ANCddEEMEz{p6<0(*mpATAjAWoRraSn{hV1oWU0U`8=F=mhJjhp7?hw zqiJ8CXRI{iOK!=7tVEx}#b#E?#jU;d%liFy;x>o`i28s=liM=p9PN^~_cF{U)=b%h zvt*c)yp&V_l>E%&AExciU1wgU;;Z4Jbd*hanhL8k877q|LTn{9w-DttBqxP)^Th|Y>m-S}ZKY!YyZ{ME`i%nhf3FAfw*2yXS)qcP8 z_LeBT?pZIQ9E}8wJ%kjuoH{U`{8}4`yXywiH+qy5Kpb3E82xCm)p#jvV^`wLjHQg6 zBEzQ}_dkRjF&p2UluP-%j*Tm%W7wB)p8`tpN*9L98-a(rl9^^EH!kX@^ zZ8S_OE|hAa1uAnED9eK@fh9Q?)CkQAvz~Xg5!F8mA&Hx)&5BXm;x;0$gKsa$NWw2i zn@Bj387ej~{<(#oN>udSRYpk;*X4KD42GWbT&y{(rIDqGO5cB(7ifaW_QyoDb}~RQ zqK7t8^Nh?}tb3x{RwFyaPm1Z;hDgCzRqKrnEXZ6^2IUtb3O!juLO(5g#m0}2z3ndA zpIxae;`$1Hs>8@cCtNOxAbQ=97C76307fX0biav}DzZUNA_gm6QCH=VcbTo#EQ`%r zU;u4%z%iK;MI9qbGlFq@S^Al9dKAJ}y0GZ`>O$d;U;V!MorT`azYDnKqyGWt81Vs} zBa{}Y()kM99wUSOuVymdo->hLBH|@WL$JX0kcYissJ12sp4c8sL~vtOLLi z;>|de)F5(3vrQ0e^&5MQpA@KQc!qS>e82419D(2AD|Yu|We?SUE25itZe z`m&LAe^K5e)H5x`6t_v_ZYC$&RL`7dQOaF$lh5aUy6dd=(D4IW7%g=$=0C-oEBVsN zSY(AD<6aq#r`yzj988x*RR zdjJm8D?x1LEf8^~r9gLnjjb>Og<1fX^W1HSGeS14oVh3+c{W5~j}nIRMost_sDdDh zc;q6RVa}%p53_m*;$|BvZGaO1MDG}xEj|ck-OR{vEkRidDjVi1G;Dmf*o67KjF)3Y zF~a8kgXk=1SCNS33B`;izFN<>9|6q6-Obm#Hq&1@$AC>-q&G2x91YeZQ*k&TNM05k zvq(KoZpqaU1{k)yZ^pTofBKtG390|b%E6e1&%aOoXGrW%}X zN0Ybg2gg6jY1e|%>o_w5#5g`HRxXG&B#Zw|`HVY97kGfCluprU#waa}0`=S=B7$L* z**NAHNDJ*3=j+TDp#0fUV@z-3!SqhEfg@dXwt5{ zk?K{@c6HVFLo;V$)r*3}%tZs!qHK!9q7g9Tc_ogT8p74=xL4~P82d?xvmm+4g8 zlImIPzLj2k3}GliON+{_8-Xe0`j(*s2(<jQpOJMkcM^MKFkmJH zB((}{kvi=4f;#N4@3JiBzVWUk9cn3pLhTGqbi;QT*hxIy?FDZ}yUD?Cv=82}Tib(23f$kc-&y3j2cD06+B(}4k$iBHD|kxTB3=9-<#ZFn_O1<;OtDB)YXy$21x{r z*Be2cXW5$lX_K@dc}tqaRUaZ3r54UR1Qt$kZruayULd?UqHExsoqS1&KHYhRISOd_ zDs4e?M!-;L7He>$AdU8yCb{ZtQZXGu5GrQajAGkOyJ69{mz*aK)dxj3QCa=SzkEOK zQr(?O`Py$c7I*kAQFSdhJ{9(F1f(80mv1`5PMX-TA0JRm3fsPLZ%B|ZJtOivsN8kMxsdBNEI5EMzc4P zoipoL(`AB31BATL6=u`6WM7aBW?>i{B+>3dBh21%`C+IB0Fk66>)wNCoa>cv9DrQ)^S*q+aXX^|pX^(@ps+J&5j&DcgxK-}ZD{ z$tFC{h+9@~wwW-U&0^b%B+jyOv)?+?#Ykk#3?J`A#>WqqFC zl_MW47Vqe%i`96fTLvK|_!m7_yoP)9ZV1UQs;%UKbCWAye~&C@H|^H}sS=Zti}qTL zMP__bjy?F6;H*~Oy6K^cx#o;S@E;Xxcde_k?ndsH+UoA6k_4H~HL8Tpl(3T9m$Z)d z+p%h!^gnfJsC!}N?loZOo{oD%^F#eNCGY`|58|OlL*1BjK0r||5S#y1NdK_(Wo7?g zxv&2Lg7aU6w2uE@g>+LuM1w*<^t7O~_E(3=+(WItq#;~P3R?w>FjCWc{_DMmEh@#6H$Haeyhc5*UgfEWtMxV*nG<#El+)dI%ZH z9zy1?ZiK{P$HQ^D@_Kv>8ODBKU^6-4e*0<)eh`2uc`81LT)aDU1$82tiJ~;?q6HT} zL)0yBDJKqGi!DsNQuWn zA^iEr1eHyL+7B&BAr>zV%aIhpO0ljfIHZf@slG9()TErjObp&$l+e$NltZ z+UyeD?&+#)=Y$IoTc~E~#cyK0_Qm`?L9~?LAg!`)k|cc2C^3pf8)SX#$02R_=FZNP z(E7K{V^X`$#h5s-u)1A7YL%ra8eGuFj9He&p*6F-zE6Jl|`K!x*W&`hdz zE5_&0x9pS+@>3ZmEvm~w0iIG1$*r7;;P-DymG<2uqvZ;uB2XyO&Ykl3Vnt5VHl?i3 zrz1g0=TJRa*I` znhkD0;Bd4p0?GT`_A*bUhLIA7E+mg}2)c?eDdIA=uwH)XKA!_FKQ-|KTK3bt_lFVE$~YbaAuxh|59tif}pW;`|oMwWPY`{?cizlW?MdtCtW^EJ+^| zcmP?>6tYaWe6p+GLQEkiWR#A6R<^iKmB_~q( zla3GYaoF$1!bkXJJXEZhS?edw)%2~}KXSn=iNAkne=DrPatEFn z#-}<=9*|&2L%rF=`SG8B6(!XX%h&j=0xgc}uv!Hk_5f!bchHNe{k`Y)-`Q(?ytwYW z)If0^n$v!vydX@041dR_xyECTnDq%HwjDC7|ub;vZr6tBvxWOy0&dgza;qK+!&gm}HrN~qkrvgH{c@tZAl7>kFhpV)8 z8dHNkz(jNO%RLjx7@iDI)qQ?0Dht_e;Bh zCDpC2&1l;DQ63OoeZW&9oxdCDOK8Ooy2x56t2zOYOM zm%#`Ku*$^0!LAZKeQ!GLv5Q`C{BS)Me@kB_Wl>ErJ|CEzPCL;yJa``WDgQ$A#W&gw zOPC7ch9Zvmx)>=+HmbFqv4-&E_6mtLJgRoaOdy7j6}wXvef6) zXrEDfC2Tn`RQvSfB26Au8!MbwSJt-(z6_IRcp-QIz-XN6v?8BFWo{^ic$(u+M>t0g%otqqLo^?R_Bz~=?DtJqhP&&nYJSQ+CV;{BiEp)CO*@-J zM*qrm6!hVELKFJo%ylO|mEa3dp=I%@)i_>6{Wm~YlMLrSUI4a#fS#=X4?EpU6=~bd z|GCrMY4PY`7{XAz6tO5LRe-{V78CxGK#5OozEiYxNIvxW!9BL$wAc7b^cZHKr-5~!|rLj;~J9lzP9SKoT z7-Af%z#>wK|B&a09pP5R%38$L4TN#TaIU}0km-*S(fZdKT8}u78{qmFLDTILppR0U zHR3gDsR*Sppg0gFR(}9-dIXmTUF9XZLK!lNWvR5y40$-SZaz%;$6Ye>_8`oT=uAtM zN0G>Q>pDhZ4BlQnWFG6iruHgPjl+yJ3^5|U6T7=5Kr1YNDN4C{`F+Ix819L1S%k%< zou-9byLF^KA`lF_Nd8y5ePI8ToQPhkf$#oGKb=x71HFrVvNVOnwkv*r0J{u*A5%aF z%}!?(?E({o*-%JPHn>2pgPL^lvb?>Y4grn)I$*-ux3tMqIAsy z8>0~A$AWbz7AAW?oWdaB$3B5nBko>u$dH8HXbP!DWItZB_ z_z-%H{yS(nZGMiH+&kXkzo)&Pd+fW3T0D+vlgM5QNL&0xtY5&zbGXFcY;+EKRXW>aXxU$7Q%!B+)OgH5 z3jkw>@h@vew}=8qHx$d(zC$#fM8jJ@xBnIKa_huibn%)-*TWGxlf97_H?aq$s;t==o&Q(A6YD02<_{4Gy1eDzVEB^lOCXK*Fvnf`9 ziUL8SQZ81g#bHF)E=f*th#8y)br~tWH4{_<69^S2VNbk>Pl&}bX_g$8kr{yurYbfr za!Z*((rFj1l#~gj?+m#-cb2~Gh%ai^7rXIH)?$a)dZ_`Fw6{=W=EnXPDB4pn$P|pQ zrU0-+W3bNP2c-Mr5hI$Kmr+3E+eq*gO_F;5z(yS};z~}3ynif}Eh?oW}bcip+fdu;By$?-2v;I7MoK*47IVwu(yl05$?S2lU&D#V3B5W%RS zA%KS}`>c=f`Fxlb2u@@HTy&9(xu@tUV9csonBnQUEE?gnW2~+aGq~LtGrB)7yR}n& zT-;ir?d` z=tU>H$k|kS_yY|s5#DLJ+>nlJ`#uiuE*U3sLU^;Xs@q;HUU&QHBF1fXoY7l8f{;gZ z`kS|>ZZZVQki3%O57hu!mylMMP5bVJ-W%Q5D$!C*$7NN^ZMQ1g?se$WW$2dBFnd~O zp}Ek1*Ss}8T3~05hf?^XBFd9-A%&9~cPr3MS0|%K=uYL((9(ZRZ|;2#Si}Jes!3UP z_P8*Neh27Cp&_d|6{s#kym9?qvWC&d$wpG9AicR1!ATeqf}cBP#|MOy+6|%q9_IZH zdH^i8-o2Y29Bl7oL=~!x>nR;Rr~x5#Jr3;W9tu6zrkYD3F!2GznI@#2goGyth-c{U;V!M*NIqP>>u#5bh%j_i zi=>r%??I5O#BM6OtVR6=|MggXZIzwG(`Yv2=~p;)YFGJluE8&c4ROA;B#|{h~0zWEr$0XJrAd{#u-1`77v~xlX z979ltf`{&8%zp6wp#xVlFh+1FKblr45O!|L5bZw|uP+^mzgP$!8{BtoAVS7X=se(4 zjS(7X(nnW_dCZ*D*YYs8yJDd8Y!zdI?8pN?wWMcRZ({^RU6w}8d`_#n$IN`PGFyXR zJ@wuy6^GV@8Y~l{8pGzwSa5dgA+0DmS>iH{67cq|))Pes&4GTiU8c{9WayJ+)P^*O zWYi{*N4iyDQo}PF`gYc`9JU!MPCeJ1I&UA6B~(S=NmW&Mw2mF6<2B(Gd>!4(@F+@o zi$rc#=TQ895(=J}EYjC~I^>=SxsS=IYD+cr9?`KX4Ka&WCZU%Uq9K?xxFxb1MJ)7E zi(<_B<(7 zeUvCaxn?SjkasrxXvlOcoH2eor-#2^lDO{?=LeH1w+V^rY2xthf4n>FtFlI`a;8=hYEv^uD$OZP z$jL=ktQNY6;+lSA_yAgKKl7te`=m9J&3owR*>B{#3fwQ2Z@lMG% zyE&#NTM=msmuutqBUDd-Z9QmcwfV6cY^`Q}&S)!6o^(=twwlV4CL=8YVj<`6fvQ+a zK&}Ui^9K^VLcRb$a(YT3DXnHBO`Q@G)VZ@iRCDBsl}Rz(d>vKTiX6B)biJ-`$Bh!tx%&fq`wfk z4b-V!v9;+$x0J0&^&nQ$m@ts~&3au*N4( zDdHL!ez;t^6pTeR>N|Vhv*1$+1S2%&W2CS( z7f^%o>qI~v2OkK61Q4^Uz&uTMaouUM~G~UA9-YUG62u#7z5PbF-f;3gU&vLkhT}&%zJ-MXQ%|&)>gPh47XH z4m=+XRayEkH6UBv*Owa2f5gt~(Y|=m{kta=UDi@gSL3)Y{`Y$jPv~WR`>qWtn2PEW zC7pOuj_uL1rr#}qE z853h<6}R{$=$)O)Zx%FTzN#Q2!sUU+1ofX-`Acen)3fd3_XQp#=XzG-d1NVfpj=*{ z67AQF5|p!KPN~{P8!IPHMr)5xKi3J%@vP( z7b_&6$;X4=B%b34PZ`94q~~8;n3%QyW^<#wU*rW}^VvrN91|jFPBx!Fs#&7G7D+0!)Sw9@pKjLWVPM%Do;OP4V}zSYYShf!F0e-n7K5 z&lL2OoVwe{dA3&e!@b+U0`fKVVZuGO-kvSxeyQ*Sw&nNroM3k~@x;jJ&*SJ8pi_*E zVen$VFbF(~Khywc{7mwau_phos}9=$9H{97mj~qGM@?gibC6vYIe)0pFe({9Tg}%8uV2l|*2;fO%P`R z>lh#MZTPOo+HM9w11+j9GOxG|&8-5=+gb=2d$OA6MS^srTKXoQceT5w_ymz(JnC3T z;$jmvu(!q=_m7vB!IZt}xoxAwk~MAHtZkZ{nXhRE2bLC5d$xNr8_|j;N}}2sfeHMv zI{fI<7s}3cs7hh%ANm8zSe<0J1voBVooERRU<~Mz~U&p5XE%2Phge{F8xl z=uQYkD0o4%k-GMD&)k)-eRt+TbIg7+W@0XnRMXF%CPf>&6ADyl0KGgU!&II z0?x?up~!j2fotimi8e}>y(%jMyz2I?O#09i>US!`S57%ceIcraZ#lbzityj;E`FR5 zGazwxVIK8g9xUHyr1XtNvmloOXB@TsY77*E9Vaiyf$;rO#DFB#@@MA9X~dpg$LHff zt|XG#{aI8VBFPt+>L#E{eC5d`7T!19PV~R_3V97|L+Q0ltDN!x7ZRo}S0yS503&MO z?NpIgkgv=ULQO3O8}6l(h|66LuU6D;Jzf|l8K5|rzUObIip;gZ5BCW@s#m^i*J@Mg zdwWyW!t=yRiK9@|mP0aIDu@;19EN(Qmyz$}ZRepe#|{TCc~_A~)8#+_Xo(TX(RRA; z2#=l*;W%LcU3f=^)NJ!wNy=a9662Q!KF}cgW3`0O+=c7J8PCg*&F1$X$|jM=6iI$F zC^Ie{#l(B0D@~X+{EDKQEBexAV9sVjn_%a}=vK7Z1GQl+7XAon*_GU|V>!1GH|zrQ z>(i1DPRxVXj<7olOd6id^aKpTMY$qP%QWTLmKw^l3|*Yy@vXL&j}Owj$qdR3lW_XT z4~j2AyHn3H3WH#J?USEr2|2AsUy>{ye$UjoP%uX8HrtjOMZe4#yo(u$rylPcgq{n% z?V~_n*J6H*>7KQ|ye}qR8Fa4zs?_36Kf@5f{)pD?5K%Jb4dmRcrPwj4i#0}lh%4Yr z|27^iVkY)*noWBLM_V>{K%ZYQgVrTd`SpCObLwOsbZ`Q+v?3OmtVn4x1?vo3IN|q453oV&V>9Q|JEuJS9F#mc!wCUO#2p7MV!?Zy;rTE8Hd;k+U zTVONt8q}`uv3HEM>4j!2MvKx678vxPA-LGnc|QK3A|S%T9k5e7VzH0{l)ALJBm=Fk z{!trOEH6*nH?x3D7Im5jenN{W3Uh0b-)}2nUK05e&X=|Q{l9k&4D|H>Qoyk={jdG( z|6KtRgfSky&T^AoeN*I%uFXJ960Q)gl}_pfFq+pc3@@!egJxYGN1~eVoZ;5C)>5X-R=I#f2us@fMZ(z{z*BSI<`nDPCTBZwTWKNyTrTf zvA*VRYMY-p{@7&>+2UACda{7h zcoAJ((avW*c_lVucnYM%vEKDLfr_5#_!55I2R)ztR^Oe5+is{ne?LkPuhZh^FTIJl zl?JX^!_OU8pK4mTeVy&2x5lIkakqz|3h4k(eNj~wag|K(!`_ae#`fD$P|DzH;#4c? zahIL{Rnq?s9keJNlIB>&s{x}CBeV7E-($$wglA^6Ck+bH1GEgmjfu60VsS*VjDSGWOO^F0({wGn^?q&Cp|V%Ko)6-P?iyNg`^627<*G{kr8U(<~=de3*1%wZixdS zlLTpm789S;zZd6sFC!m?fQ}AzGRQe-@BG{Ip^o=Ddy8 zbCn^q`J+AtbPAd`OC`JdNpqfl(9&+Zom@{K=FF3@+<}qwGQ0-!ZtLdtC0xnaO#N&y zfFSoK?O+q_31DMUnvx65!0`}2R9`GqhqH;^`da?>ZYqS}^u>nWj@=Ufy7N4y^XYmX z{1mf4nlyWNeKYdn)*JhwHdH^Gy0H{A&OUvx(9Jwsd^ltp7;g&rbv7~LOzQwvzT~S! zJ+(Z=93U&AWb75>);DrT5Q_BmRHtBS^|Q4jl)_^mhoV(s5a!q0MslNOED)9dp1bR4 zP2|JdmsuD)tQVc5R6ukUOsNlz3Pg=agdbkgQKM2B=5m2I#sR2G`r&A48eOBM2%(`m zE#29BD=HO!5)c04FsTsOW@ZP>_Pmy1ct^bAZu(6*2%Xu zJAy#|GTRtp@T?MgF%1OOg`hZY-gOrG=LiT=rn>>X zW&RoB_Y@Rb3CGf2eiEikp@Y&QD#XEoc?32ajk_$O9huP=JG`5uvA{6Xw#KuKJ88l{z;%LpQnxW6$w! z?BQOH~tIJ4^dZDf2wD1pq zcg{pv#Se3}822UfZ7lLvLFdftycO=2DJOMzpi!GVtyDo^ncDQ6#!)Z5T?<*^@64w! zxR+Vu8ic8ipc`RmTS!l?OQh^{>n{lb$iOn?JtZ4Ma zLVaB(%1zx1P7SMYshQ8nmi zC)Uj{h*!Gr9Fp@R-DpCkl-Y?WxpplZY;{S31X*}~KCS?VIiF$v z>4q@hPb5%?7S1Zbd!Kp%gv=>)fjL(5UkS{=Q(AWBU%hdUh0^}2T_EMShdLwsq@;1H!C_QzCRH~EA4(lsRJd0Ti1=oYYARQGf%e#eW=Oo&6$&&9&O%oHHMs@f1TmW#@N>oYJXlYK55pN zesT_B2me+%2O|hlvO`u!%tl(X!Rx!*>&|-XzO9CtmEWcrP6ntv4Oo&Bm_h#j9t@%@ zJO2+^`0S3Jp8bx(XM}e30)v{Z5GvS+cE;ZSVC)@Z1PQ-w@8+~^+qP}nwr$(p(>A7U z+nly-+qQ1sn{#j83adX);waxj6IEJ@-gd6Y!ok8el!*9IIaifbf`v>eT?_F zDGBS!p2~1oW`C+-@Y>X1ud|Kes=wx~b&qV=y>VSQP(rP8gXihq?CtK@%uRnDb&mP` z;$gGlS@_C$(Y8Q+%+8UD@%l3;fw?LJL#d0|Ex(3T;sa|Jmy0zKY3ouF)^5^fP#XJG z|52)$$Ud3KsH}=uQ4T&x*-f)dERnDGOUEhMU{rSSeTbiCQmrz{fdX`u1T>vA?_)k0dE~m_ zk5>AdEys=BB|ddRPWR|A4!lU>lp;vgTSIVC^-m_+Qe;^Kffr;R?mj*kL@*$(H~ks- zy@%f;z8e^Nqx_7y2_e;P!UGMgyP+ysk$3gT(7Yy)EA6Bw$+IhfwoPI~E`UP-{1)Q{ zz_lB{;WgZeLt?62I}hiVlz!MmzFYLDYNgd8(SXty(e3&H7Wnv&MHyfayl@dLiZj0{!F6`}B!CR62{JX`BX06j4eBl^OO*oJmhXnC~pd z|`hLx6_Fr?B!2VstyTI1QyNPP&qm^`i~pB?NeqPV9blXh#N?a7aK?GFhu z@o(IQzOVc6(+8%sRO4CRgY3}6!GugCcF9=DLnO>I42qJI#ricn9 zMY2o}4`qaG^-WNhH9S%l(7I@2DhmCfr48fF`eICSMox|owb^IyqBF-w;YUmdDN;*T z521O(nWG8)Vt5~G3oTyr!+bqhQ?g|!%|yTUC-QU1=jPSl=*E*ulD9d1E{&$@lT z$?Tjc<62bPWrI)F0EcbOPi;4uW|24ZNq*OToM>- zQ$8S=nqrxX_{L40R^k3^!ZF9he=yH5X|37O9#4H|TW=;=`|=350$iL&;g}&CXKj$b zs5sn$Oidq~xmPzH2;hRJnczzAU#F^eA9#MNL7JGi33KbakNk}}??I#pbV8S!yQyKI z`K;X6!kpp#Hq*LU;qY4Y?Qrlz^UUKz-A4Vg&bUeQ&AG9Q_6v|s`yvBg@}5mSn@^eE zs$fJA!4z6ZimWK#)0CtY)~)&D1A2)=|Bopg26~2nk+7KmuXX)@mWZnVClM#ACZdWG zk)9@NLR=P{r*)4H^`ik+v#dxOjt}a?uaAJ>k}23WtQJm$;(_qs-XOdTcGnEo(`FMf zJ$5;tAC&RBxF+0DU6WH%>dNA$B!p3|)SWV?o3Gy|a6#2AZyrBseR#@N3qD0$Swmk6 zI_5emUA9(>nP56?MP4$TRlH5@^DZ?~YwVd{{BzrU99-+gmS;D*E(Nli50u_tuJ@^E zjuzRFZQ?aAg(bd6HL$t`IiWJB8yK5?CUVCb z=0tNA6M0Sk76l){y$^N7-bs7ClwU61n%}Fo`AzJA`8H%RuYYF4;tT+v$?nk=Ez>>T z1c1l5n~>e=4v0#>>kpj{JXe0S5zigkC-WTR@=L_=S5eR^p17c&eenHG&x8%^Wu!wh zjj4PZeGpP~uc6y=F5C-^a|TV`Df|)#dJdeamp#CxE#Ohy+6I2}{CY8M0bVfOEg>?L zSfWbPB~}VO!i_&D0h}P9Quhr&H#K)}ytGC)zxhOdt39|3QQO0M2NZ|V#CMfVo$6oh zmv32?11V@ms26Q}MzL5e!8{918AU(&7oeht%r%W3UjsL=v8z(Y{rX-#pr=^;r$ z0nXG|fy{Hx#qk0<@dZF@T6GCR@qa9*HC@JtQe^ZL!i&MRK%e!>b>ka`JXRn5Q|77` znFZr9e!I9UUt7=dS6E1G5*h~I#A+%K48R1!Wd(?F!b^71%MlU0GJXS;H)&=H6Q)-? zYP3nB9*Xc%X340~tVcV#1dd5R%eeT9VR#$H{~gDHdszp?Wyd_4u#GrWb}{1l%sFa7yyTWt=lzK~DDTq7?w}=WU$L-mNz6>~v}%YkwWNw6Y~+23k&iD9!rp|5u2S`!lE`7y+xOI7WYZ4VofoV?H?*jfW-k ztaHE(1JnWIUj!qEij=2)p13h_o)L|1+o2V@f07ct5<>#L zx&twEk&{q=KBj*?rb|urz~5Gdc*UZ2US^jvzPY=V9D%=N&~?(r1|CZVHCJH{bZ)nD zdLbQga=Scn+fnZ2ZEIcjEPKU^oLNl?OZe~hTl){q@*N$R$Z`0_~K0u0TlqKl^X;P-Cs(# z{lnzd=>CEU_DwnQUq1tk|FDX&v;S9w@qgfOsZ#yv?$g8jZr6+$QC1DPX0gxy1qKfV zp@geklPZf_cGt<3DQ3Q8_2qG$k~N}R{Uz;HyU(?~`JCNzZeI&)e{%}bWADSq=i!8V zk1vvSL!PDw1|f=ZBp}T}NDX!5Q48)zH&XVdC0h(pyt_V{BtIdTzl2OymCRc&%478~ zf+?4BKV1&=7$QDojma4o>KbsukGa&qE1S5&oRmlIG9y2o%w_Ivb(DLm@hCXLj>#u~ zmU|0q02X6cv~Ny0&Eh!ova}+wul34~xt+}MbLC#{ZPn?|3T!il#hjLm2pVb;-8c9C z*eUL1DGZk|jx*P@4ndQ!zCFWp$vZMoHLE%5N!TLk+mgKQ54Ly~&q6t#7( zGV0aer3+!Rz`%5xw8sRdL~r{3E71+fRNE2_T8DC$Bq0@kuA5K5R;3Q79osn91OmZy zp^j>|hO#SYllFd1OetD5EQP4zQc2)_QS1Y9_;tRebG=wtmje2AZDvDc2fu^$VF~tp z`}1*Q743GKOPh_#0) z`&CkTRfvYb%mm|PWo}Grq{H^6o{E-5wT{GK*CSm_%aAbwp!wILBG z2LWU_Z6V7Eg&0yb&_Do%xSb1R7cR98v#cid+s(1BnIN-H?RApl%I4By-bfLI##3ai z7>D&zJw`&NKO0!O%WPH{nrowR)9}jC*scYE%M0ow!)K*%? zN>dMupf05#iA5rpz!8b)WaVc%H0c1V8W-z+K!9fKg{ldMMErlmVZsJ>vA3ZI)!eAM z-}Ygi_pg`jd_C~aRfZJf%NHMQixO0*l}Met+qbH1^QWKmrRJ01QqimiT^25(GA_>Q zE3a)_#QqdpTV-5MmZjY`AMKc}f7wI7X9k_F47Qx}fw}a9a~2V07n*X&saeI>t6R=h zP)K{!$+kvMOb(Ct(A9K*M&|3kYl@RPPX7{PetL(gMtZ)S9L6w{&MGmSU!0WLSOZxtOhaT+{M^3#Hl85N-_Of2qsZNsX^^{oHkdQ^ zZAk-_{Bj6YU$ApElw4&KbQ|#4sT>@JGpd16T0&(6)J3^p5hZp};HPc)(8h$4ZMoLW z$6mA}j|atHTp0$@HirSV2k)p>sHB%UQ~*TUAO$=Vd#EY5y2XVQte>O+6^|-7lMR?* z0m#q+Wxx^T#PQqdjs!8AZgY#h9)|&Y0+?pY6T)7?ORdcs*z)+$9|Ct>H6qv~ZfDDs zSKibWg#$?f(S64>_AvKWotG^IxHF`7R=O~#(}}%;xR_WL@tAR>6utAgIiF;n`Kp-y zQ6nTejK88{Zrb*9ZUmO!#g(5y$~6wcj50>AR%pnPBluk$=U9Y2uJa^N%wf=(b&~C& za;e`#)rwKS}rlvHMFpg4vZW#{;AJyWA>yUL+zKbWCM0BGdVz-gWzaT zu88{jLKsn&Xmvn%Ps^sSD)DtTsQ%rkA6v82YKY0a^U*0tn{PhppQua!HE|bpJmL=H zBTta!8wA0?u?NEZBI!ti3tUueY$gcad*~X~rd{ z1@WMW89hWseNDu;dInoTj#v=?HJZtrCtJhtpk6o#p<)_+>uUA4N}ChUoWA#gKjv$o z5u9eLz2C_2a@j@o_TW;207<8Zap4GVKJBeQ81`YoC~nhrsWY0ZNRgD&8hMtfKn+ z;Zh`&Rt`+?cGKOHU}K`Ccfxu^ULV<0Lw%dJK7)EhyKWB5PFrI=VM}$?Z5~E{*x3oh z0s(H?RGKAB*!WQTe&F0vx@+8xaGH7KAKly$fkOv)*RKNxO!LfG&87}O1y+1x`EaC> zjTcW>n%ujuOAP5n^<3wQ5{B|aHPyU#@a#$)%VU%oFgMODba~wpJD%JqXL$YruG_MH zE2b!ydD#LD$g#J5K*U%BG_DOo9TfgBBAOO5xUGgId1P;5gnj(`d^R)rV#_frG;Umx zEk$>cUu&i-X+G#klH+7I)QG)d^{K%dh=?bkwS4EG_ZD|ifS?{`9{gHREcaea_Y?we z#tYv^N@)aSX!m5E$ty_K1f|=1EU#T1s*%G}9ZJi#=HaNmT_Z2|F04K7zh7{V$?rV(wU}Ij z%a6=MHHrpRhbi>P(Snozl1@g)Yis7my%b3ih6bSdRTG|J-`U}NkH@Gs;qb4jk@;UO zWET4WA`JWo{Q-5UAEPFG_q!VS<^U!C-$=L!!rD|+^GH-EqjeB33$HjDPLy&n!cmvc zYqt>sn{kCs7sQv|*|>~nXg&^D+aPv#z9>A6?X3x2Jre4X@WKQzwhI3efqvpVK~Of4 z8?x@G?!5QMO`UZZ+Y)a13FE-XNl_ydHrcw}58=TS-6q{N#u`Vl?V5X2 z@-Rd=lHFzY2(K!KdrdkbqehlQgz~I(p;gvUxV}I<3B&S)TqcKgK3`uxsBU3uBZ7k9 zws~~T@scTAcKMcU(Q<2ljbl+>bU_GVI+fjZ*O#kjIPPifk(f%NX#=a{HjdD{ve*Jz zQC*UgMMJ1F!#b(JyeJnRv^<%S-pU8#gE&1sy`ozIM-{>Pq;+Vfv!oTtTDqQ&^v&tg z7z`M5Nr>q={z8WMo2mL7pI1~cQ0u_#;0o%Mm4YUY-({tN=c^_0(6X({a&ZP$KE|9f zD7z7LV(@+BYhQ9DYVGIF0eP)~wcHQE4kE#ObcUc(#1ivFR9nhHSD2;oe?0BPzGvd1 z5y#4!h&XJ(fXzsz{dr-_Qsa$@;~%gw*m+^Kc$A1y3E>6fp+zGe534W7yNEi@wsOef z;}Izj?;#JYF-~H*so@6+D#fn6%~i=D_dpx#K_Vkf;TltT&BYkdl1ih4w7qWTve}c! z!zDj`Ut4p-703&MW64Ad?CzQ7hufM?G)}p+hLqn7fz|_sf*_XFXHOrx{8dR233Fp{ zOMRIA5^A?)^_(gFlqnMI8M=pemUAyUp3!bda41T5My-87jb=3rd?kl%8vr0MaIp4; zt-kAbD=RsmQ)YDZbWbVL!gI*k6lfHi zWC0So9sMYSK)1QfDK~XSd=%OexnSL_IayDaw5P5nN~m^nD8K&v#n452uQCFXZ4BYsdfw_}xY1dRW&_M-t6%R#$u!4ihH%NGN2Z2I(CkfJm5CX-r z{fh${q~tVAKNNzz^4tt%Nu~5thD-@N%?)CqYmN z{7<#`2StN{p6$Py4F9uQWTXC{F|BSrf)_(Osybp4g*n3pel!c9hd3!0smQ<-iyClw+Ez;yf)T^H#)3Fnj#y2x=NSNxzyZ2_dc%le)LlLL$z8F zgaaAnnKJkX4aYkn)z-QgGY^T>GJQ&e1(A-x0vReXJDiw17@DD#Z01P-M@rg%NWsV5 zo{3Ar7dtC-B6I*=_5iC*bP19GY59m@W#`oH!+P6>f!e9oC`{k$>XP~+PeljS2GsLd z6;v}jDfTH6%>ru`3HpsHXdywpRq6&z${&^3Ak9-i6vQQ|FZ1$AR4NHRF`rG65mBT+ zGcTre5f_RO@x%@tC#6v8G4s3ThkRLrA#GeQJwR<|giC#e@ax+m-cA^A4N99#&MHJW z^y5@i$JWD0w4Pl%My8@CdSPaosxMY+h@=lW#};ia{29m52zA)>A~C`#a*TC4&i#0U zn@Q@50n-UD|6{Q)XL~gqBSPcuG6wvdSoUjQ^e3cZa+_lJszsL-T%rN8u_Ikr zSU83D4|J{68LFLX>&%5LWW$1Ru57swF|T@@KBIyC5?fSy4pY{3;e10}n53Sv68XWh z*-E4-8meQx7OU)Ml;*nT6$`Op3kD3cwJ7j@hd6j8Hh$sKVHpF}T$c6g&iPmvHjE^@ z9Pr=f-t@20a}qA`5reZD^2;o(cvgJCo&$UnU$jT9|}1Cm55)z~+|5YN{T zu?hyrPS^9VXZ;C3|L<{e98CXlE=0EaWW#_3OC#y|^jVbH=mDeV& zt5Yt?nrRL(C$h=%=Xn&|Tndg|qO&(XcpyHwKOaBpEG^>fJDCHU@B7> zv??x%3il^77v(MvXiMi(SXdfDcH$~0ZYALg@9cx~jM#_%O2!(a(SfK$B1IMMmw|w? z60G!7Ps$OOC?$(meVK}43Xc}bv$LzLGgBsuUsAKp%u;j3#_LaWuC-m1^)HF_X7Dz5 zB=>{#R&hi$rgiHBfJjbS?SS-dp~HzR&YYDt%2dY^Au^E{0K8Zrou_E!U{1pOsitqG zIE60m#pH$@uF{RBD<=w^HljVo&D;shgB+4kg%pumCgbu)Zn824Ey-2$J8HVmfuP{B zo^0j6SEp{+%}dOcP?E}&k=A$Q5Pw;9%d^1 ztlW-N+Rd_QfT0@(MeyAZHUEBNw+yvoco)9iGl^F%_pRgek+-mApH7~|54&Yx%P-z4 zP>d(N64qx)@FW0Jic2BP4kS2xcA*!(SFK2J9_+2sV$e%C7_Yi+GMh|5$kgOH{G=HNkmQN%1>3ZYr zqRQubDk_F-4>Xzn_h9P@e4moG&3hnJ6l}etNryHpC&c0BwGbXJre_={wn(wdBDgMV z74<;xr-uW8ukOHtle0=>eN#7wt#3$%%}z4e#o~^QF>C)&3PKz?_Zsej+S(B zd#N?E{)Nc1M*#z9oYYHd2Hb>SGQ^Uu#(kd0O#Ob52bz}5qHo=Xlk77UBrNlb8eY_j}JiBS6r`J1IXZ1abo8yDcis*ypuy z(d_uVlayCrGym+|dd`kgp_ff4N5{EKmTL2ZX;ZX;RY0C$lXrorscH`Z;~Fc8XK5Sf ziIn`NJ8UId$AhIFjYis3c^Rfs{B{=^agNue_7^sTvUiiyOAM4Er{4*H{tBmwjSH$$ znW8#nM~2ff#KV&W@ikXByIBuP{M%BcziRXQ1liM<^WSTFs z6qq+lL}w_X@Yf6XWa6(Q!n15a~GR-Z>yyR z4wNeHGRqU)`a%woeNNszu@K`vqd*O(HgZj_E9H^nGa(whhKw*$FGk_t@n_wj9 zIG7CN;?N80h$1oMidrO_){A3jwNJRaKoLRK+W=+&31{_$tbRyAuO_%v8HIrXwzC*t zur{@Y>r9{Ty-u}B5f$J@E=@=LLDwW{& zIJu*qI4kzLQ(?HL=*&K5o#D7#FcG}-WMmUHFqm7Te9)aEmYBxdHCYKkVa4ai9bg3A zJB0hb8DxKg^nyo3A63FN10^-lByg%IPxgeqlplSzzR>WUsl@&z@;@Yw|0eQ`^c)QT zX+e{%E)~1Zj@bQ^AWZ`cZ}phsy#Ybmz{LMFd#c3TP`lTZA1NZ?`gaeBH-_h*dSa*wm>{^XQntfF+{jGe}HRte2#le@gG zA?P(WBL-*N?w)zQ7ZOQtVKf>nuj%UJefy6uu*YC>C-GWw2m55Cl|#W3Zu8<}@%*&r zB%_0;W3!fK16x-*-R-+gTLtSMKHsmAZ7?1@8?uQp3sOz4X3q??#b>m5BF=MK(HQYC zYFW4ZfmDr{Yk5gsn@-GPU9R->TjTe{BM2!7ya{V%I#YOCl6{S59>v40)Wnc1`$uq#|9I{&+k~L;C-O#gTjXRH%xUFCIqsHw2ZT6HttZ!_5p!CVZ zbd|iECLq#Hpf*tI{*q$S7A71SK+Zo!TcV#F3lE#++3LW%mmPPp=&rsHfc;zPUWe&1 zyxOoHMi5mFuVK>qS6A2E0ZEHKG(m=;Zv56OWju;`2Vb?3uZI)E@8Le>j*dP|+7BlIDF+%{a@+9wd zO8sLc0P8ps1^M%PAlPzWdg*A9oTCOf9~gZ;4g=1_P)a0H3_r;e*(u7&V;iKi(jwy4 zB}GlBW%lwVF*jP0V*pwmk`FtZe&4^Cx;?mLl1kLSR+3xf{!ULH7OUcHx_GP7>IO|v29 zmcSX{J*Ddt<5!=e(tfE!5L*rnU@F-5V8arUn+O-0^r5W)Du9yHgA1+G&c$r848DpV zr`mUS)T)E1j9a}8FHjLddp3^mjzISfo6K}b*G$oXS_aGxWDfl92V5z(EBx|z&vC@u&4|CX-gKMRdR`kR zR2AW}HR~{e+=h_oel;GF4Nmb^G1k>_2D7}i1Vx7O2OUo0iIuKI?T669rKqdNPK?Ys zrL<@wU`T|C=Pb9FD}dwX=H>Fvod{-n-zKw?1g#g%|+(Mjc|z{TzT$rHh;4(77&y)10D zhv`oe>qak^&--?FL-(3m6h6id9CLe%?%JWB3IF$)%ZaCl@((|a4j9Y`;4`V|&>Ocq3PF3hX(%EpEmd6Zi z4uzp5+>?}#ZE;eSqx|F?~3v84I z0jeq`T(pJ>PQRdT?8^N9Rebz-MgCjy!NC4AH2i;#|GA+Xqpnr+;~??9t{M5^wBB03 zqVmCLN8B^6R^qx=RBEG?N6vTZ@-SDxDWDwR-uvNwwO(lWsFz422-oyLS7A-w zyQGwpV+Xqz1&KPyXV$PfB&%Xr%BWfu?Zp^o_cZVB6n_FXBV$}Nem@d02gVN28}0FLn5o>;Go<$m1oAK&%%~5??m5dN1Y~o?Z?aE8xq1pYX;pg_@W| zt;M~RQOQ~Y#qxGV%1IaY#3J2nHbbr{2;#*&0vq06U^9IXc!rs_xuNEawxu_!9V$Ta zK=|z52bKSvC)dOTYe@`pZ*uWE587mOVt$`>x6}FFi%90slCT9?M6F3aj%N$PeKfN2 z_2{1ZX@mqnj>qHQv#&PqDjA5}&&b%+R&ivcgm5mWp?2va>l2OFPRj>98ROmTWH(nc z84fALnjvt|rAvY3T4W~4jN5j`+q_T!um6(D0CSft5KC!&1jB9&z#8A0@AD5Jvb&vs zvM(?ics7tN;Y;iyH}#}jzlKgBztO@8#2~m>rG~t}W1Sc$lx4-ZAbO>PijW^f+0X;| z&8sV)aOB|fbEgyXy>`Wh-uZ*h=_8ly!NFqPss`ezGfUZ1LyjUn47+C@vb!LxrJ9Wh zZm9X~UK8oA;PnpM&*__NX1UkgXInJci~_D<G2MK*pJ-kf3?s}O zQ2G);C--J7o#CW&kr*tGi;c>ar#^m8R;fC+St&A)#>E^(#)|TjDkm7H&qezrhnQU1 zK(M=!+gNA_W_-A~XF}1oaKqz1TTll5wc0Lzo_eg3fE*yauBrPHQQjQ{kCeXbK%O)G z+Y4@`Sy;L#D76~=j`-sN6mC3^t6THUV7AJ!3ovHg3Brmcxrqd3b9%eYnRHxT8I;JW zeg^D^i8ifMa^QGIf7BD&1UK$T!5nR!*oIN1FCvH$M*ruxn?(zd0jSsyb7)@Fx6>U_ zYW4?cjLyj0KIWaIPHNi#8`Hd?r-?HhCU~lWwMbb$m>?`*xe-5dql;*+lLJ%B zNAm%~4-N>-#zRcq>?;!GjVs!j&Z}Td(RI7a8B7R99%%K=?#O~Y(%B&g9X1ps1If7O|qlrTX*|^pua2V~i+*=y|^q?EDu9_iWhg4~e&yZ%KY*VDrBj zd5Ol7GXlscydIk4GuYtkO0{BTR}$~*L+=}>1$KQ5nX3OZXSE%Hr{!vo1PERo5FyI?j_0PV#!$xN zfo%~h2~rBK8q~hE%~6raJxY#9*ZfEzJY291%6>8xko)#C zl%&m0W$aM(5Qe2~=67ccylO(r_xC4341|Y>2?ZHKbe1qbHzqUyC`mjQf~GUK>j7rr z3X8bF0OweFAzqyFQ!Ty|-}eE)E#f`xIC_WD%t!R)Yv!g833${GkPgq#rSDYRMZy+W~*JeRn4s(+3szxqo$_@?4QkqezeH)@zyEU zd$N&X;tKV0Ni~x!(lpZ>24u29)8s+P2(`t%XZdu2F};vl97HA%Gr)z&*3ul$;`#k8 z!~+6dPidSF*(dIjv)o!5D=jy}4DH__qH0FZIMV=XVkh&>%FO0dM5b~0a36bweLLs~ z!PWC_;bJ!y!QW&%xJd2`mptYobiU$f7pn1+33t9+q%_^6Uj#rVPqoO6&3v4v^N18R zVw<{|(tc*jntfrUr2sf8iuJ$ieF^X1c31tRR<8&CCAB|s&i{~F=Kok~lhrl;cf6nP zwjRL&32eKmh+?Y30fEeXzKBBOWH*UVuE`pyYKk__IeAYvQ&yh0@OmRSD>f_~%<+rq zkV9kC-bqQvi|NPL?$tV;63VDLv4*xV+`71#Lb)SBqRK;U1TVE?e3Y6W&j(}n&$$Wq z@DDP=bEQkuvJCY+erQ`u?YR|$RwiHYfN|N~44WnyF(e;rTlupa!_|vDu?F?pO9@!z zZ{a?nvC!Sv1ZNJm8kPXbVG_5qZG-LmwTP`D2wCG%);ncNMajYoK z^Uh^dC>SOwP!gz7KzLM2TU;B6Wl?|7(AWF(yA0f}G)`PSr$D&Xj{7LFRc+FjuwX5B z6c<}G97f4s9eQfxDj2Ni>b;Q7p^KO+EFPc!;oJ0xF%=w=%okmxjA)dnB(g}Pg4#6q zE4xb$pNGaxiwut8w^XZ8ahDQfqC-dkJz0Br(m$_tcKpmKEpC=>WX9bY-IYH_@oBT< z!_iuI(S>1WyR^M|ehUjyk5DIpIOijH?QSW;n3B<>ujC1 zjNF0TwwZ&o=v#l->l=r50Cut9-e}{xleo9Y7$pS%8X^U?voRivR%!DB9~nhg_=>9R zOF>4JxCe644{Os=K$Bfo9)F~T$H|Y58Hnm}gqyyn4jSnVSk}H9$1Y}iV;?SEf0Gs9 z2fgjg!rhP)Satlqf=~lAv3|svG=)mKGD?T7hZ;d%57fBZ!#;(tL>sx-*td|mswM2W zb?~dbU6xrN}(NOZ)w;*D}tGVKa8sPC{O^> z<$*zVA8r2}?fHP0D3;Frg`37ZH0G`Y<2Ds?0_hmHfW&)I@3VGTUMVC89&kj$G>cMm zSLZ9eF$@skBv$hDmgVEmOqR0$PWUi`l{SvaJt4%==NuyBMf&jD_C-W7IjwYFKLxTbs{Ejwc)GOd1Cm+$C zPl+7Z6%Y@B>C^3BaJc}!=P>M1;CEOYA-pr+R4;PX<=y-S(7+N0Y|J+oEHG!-SoglX zX3@v@LgGPhq%dcO4)jDc?x4WHDAL%apR!)-j6Hx|&ENa5jlUK^&I9Gw$NA zfN=GMXuWSuhSf9y5)QR-==B@@$%;kV-R*oPa|6hIOzs{rktzMSa~sKRxq!06D1lhz zS;CVl7#gKZy%9Zas)bBIP7N!)?jy`6dVEtKRb<$U+H@hy%#RGr&Lh_)U&`Ae5T1f{ zQSw?Sj=VBkCIh?=)5(?DCS`zJSW@@wGGmHtPuSiMy5L6iHkETX9z@VPDPcI43jjFH z+RO^aN~#Ogv!05{bn#qM9$0cYnOvWR72lct^yibhpJ3NQShyo@l#!$G^idw!&v~4W za?ZTV4_^(5*_Yxrf(Sg;`!1h&9J-Xn{rQr*<42}SZgFr4l~nN=?TiP3mz-fMRJCof z7-y=oiaP)obBUcRi#;J_vN|T~^iDz(a8%l&1Ie&*Z}odIcHxN5+LUi=@oIS`m9~Y- zlQ7YFv14~38&$YPpn6=@mlYO5>ARJf6d~RRIE*@ zb}nj(crKe?j(Y$%P)xXIzXp-tH@mrt1b2xeTRW0ydn`Znsh#phM;cIkkD_OYaO zdbPg4%X-2mzcfTfLlHy~Qo_06eMJ_)-0WK5#>o0E1A2=`CEKxwflVq=qFpfVTc)XI73Mm4wAHrkL_zsEh;94jqmLC(lcKV8wo+L zWFk#J(s{Jxk(eXC6}uFbrENahLOo(tB|HW_-C%`o9D7nIH=6AVu*X|sK&rka8z03} zqH+F#+`g1gwMI=3&fvG4lA0qU@5QA?FT0rrXl^iXL)6I7_O_th4jS(CX%^`KaY`3* zL!@ycQJ!#7#@*)p%NMXiw*TLSn1lWQJHzzJ5C7>JlMZ1eTiWIJ2q%Ua)EOrZkL9n1#HTef8ikVoUc)0mt=tR^QHKdBCMi&n zfda%RH{}o!gBY0U?`g9jW$27-^3RHkAvr;UNdwlITR8x)vUZ|>Kxs}k090Q6GBGbR z)Km}XprKpI7i<8v+8;563Qk|+>h0CG#({8*xY+({9&swQ(uKWd4O(T~Kw_Q}N{(F1 z+J-$-?*lGTJN?UWP^(u@IJ&Y#t^MIxIOf&qsWkv>0k?LUa6?e)uG4 zeBtU0aD}4Hds>XtBxzb=!4ib^_(EKAv}z)nK*j1WSyS6)!2F3pXK{Ou_|?KVsl~>C zRSis8$gZ^|$h$*D6m|;-#1-nL$dt9WJV{&EZsErI7=U$>W)BvwJX11O_0~(G4?)ES z(BR|^bVJ@e3Pac#9c3Hp5mJ&2Z0SToQm{XXn9@)SQLoTj5%c1#VC|C4RQP2|tR(<2 z*`%!6JAX2E?7_eiPiK3+CpI2dy}Mg8q__3_IxRo9r;qf==8vPIPABKtAJz|8$;uq}z2+F#z%Q*U z>yy>T8T*|fvoj-Cx5=n8Xk77!%5F2Z#gk}g2iQ%5*9jcl_I+DcpEefF_I>foF~Y$- zszaXd>pYh)XV=`U+j$I?0OVy>_UHA1{ubsIoxP8b|EFHIG~Diy`fy-_Zvmu~K;>1! zr|}Xqmv+RQV?Oe9&&YR0%^AYqDTX}=ZophmB!Rr0l$l=`=tbFtFYD$=$ zH`AxjksoC{|L6H|%9_as@Tlo+h13XR!+z-1(ZR=otIN8fuE&%4!`b!T`);d6H=quK z9q@4@2|8NT0+!v;Mwp(l3RJskB(R2ewG^-GZg{1M(^Lj80m=bd-id3n7jt>*ZO&Z3 zmfno-!`<(|jRkngtk*mgr0zIvW5)f-s}{`(oTj1X65u z7p>3(>tC~}9dN8?parS<_f)YQa%>j3H@|7Rqjqw`cr{wxn{v5Ed{*JvV8m*s-^{0B ztN7?ayV0^F@zYuZp=oHhQ3?zKNs2e-D;S8p{#K~Y00qVShm*qD?k;bkdl$Cb0PBW{ z2gFMclz`A}Bu1hJvM{)Y&3&C;}&eg32I3PEIM>eWMpb5Rt zw=nL{9wB8|SZOw^V5nPJOooYUJPMwsxXGgz>I@eAGoGsQSt8Md`;8+IiZzj6fBgStUMX@@~@-8z-;8mIyWXSuO>*lV4jnHj2 z655?))1qrMw!o;DxeQ2CT^Go)X_Gcn6G;T0!*(fb;IT7Ix%9fa6LoPv`raHJz6zH# z<(o>@>4hlWP}&(m6>3-6XZ{T3Kyjo#=Ca7PsSQ4-?d(9BhqbpilC)b5cA`emzZ>MA)^lwAC89Ws~87DR7d=xwNlIeZa1mUZF5>7c#F9{!ZvMns7 zeSd*wqDKWd9b^-nb>(GWK@nTKw8ox5MdLP>bBJxd`hGDx(QRW;nJs&oB_2Klsx2_# zBU9q5rgWxxX10k>SzXbHU_DvAmN@Z7em*B6deDiiJ^g$FIOG*Yquaeb;)M4`erh8T zK}+?=iQ0_IPF%9|(7v zILej_M$s`Z8O`5_Z7I9GlVO1dQI(+6x6d<)35CnOc!kyDq_*-v^k`9ab!I0!a>qBd z{JArXD-Lo9$8*WsVTN2rnUxJ))KxPp*Ll`zH0B_llPrGhLoCHT%(Vl+LixOb@)2Y5vJ3)DmeDbKoZpnv25>`E`ihC;8Av0s^o70Px>r)P! z^97K&-yT}AkrdKd_U~^G$m}wUj!2~7N)f^j5;xh?uIyJe89#cnUZ&jx06?FM zR8v`0jp1Y84=?QK3*dhF6ieA9kW9z)(WEg^1sCyHV>Oo{=Q^Glhnl$~OQ<`Rq#8;2 zi4+xC%@ff5r4kRJS75^0Ye1PvT*u_mWJwyFMo*!=;N%etl(b11_ReOFUes5fL-AK? z0L*u>q|synzNAC0Q*Mize&m^14F#x}TstE|s-tGNBB19aPBe_aN14EBU1(Ye(6&J# zR7H{dnvK2{pT9AE&CN;1qw;~Pmxmh{CB5*6?{dP}n9_3=rlyLk2XM{!@`d(ruQm6e z7z`Fs4havnDRCz1jT6@D=7F7Mc7_^qu=dpn2tD_wUFA6q7YBxz+)L-zA4TR!YP6}@ zuzwg{71k?K*?Fue+yPY8@VXBen1x2OpQx}XXssDPkb!PvuVz4GD7(Gn@Tan$#4+@m~#sd0Q6fbF!mH?&&% zX2lsc60!qx9q5^7qnNPAz~nUdZK^f30OjjxnsqUWz$7Fu@-14N!|f`K$GKU}Eg#`( zyE(VdjDZPNL*(R47ys4|JKwnrxj5?>dm8ISXT7F!T2nyT#Mo@19-Bcr)Z{%4Z<8OU z*9g>RY*90F)Y%~Qv9aj{-(*Ou1x=FXJf?t=G;@X&q!M0w=l6Faz1(vkoK3+#pehD( znka{^t-F{(x9d0z*DcGnnm)y&QO9lW>2kxWaO8%+a8)izYQ`{X6d18<$|6GJ4)y^K z+GeBP@i$u-uNHnVS2bQzg^`BQC7|1nJ+VU8ze42&1m~O1V=Q~YinL8Wsm+AWtK%KX zAze}eC^IZ?JWvDa4cm=uPAAVllCJlGuY!l6=}e4q>c#C)hmV37TAX#Y32`H6EuCo5 zs(UZ4qG}LYzoRC6$cVxVOa!*&*tf=wCdC%XziC#pZ^3f}jzPY81hw-Moc|mp8R+F6 zvwkpggy$2j4+Rh701Q?OVJRc8dKqrXi_7^4N}H#Oc$?Dewb9(xMCi+B6h3ZB1wX>6 zYzZFExt7_^!Uk=8W0FmlNBF=bV=i~(VqB`{dz1C2>ezvhjH63l*4)>QG&T2Oybs)y zxjEZz0EZFBY2iqHxXfNhzfU{YyH}O2C{cBKpEsh_6fNVEYVGzlc?*Ev&T-dC zK~uP8LTcwKD3U7B1Pgew7ZS}aA!Vt^f!jf!7u=x=@}~6!jU;Xd&^X_7q&kv!CM!!r_bz6CS8KKjI3IbO1(5G{44?T0C7a0DxRn zTn_2A8q*FE1w9V!|=pb6?+-tl|1`4S0K2G`b4i}zNv?oHHd{Um4i2n>Y$B>w}BMGo59f1!YV z`h)$t)tPJWg8v zP!;2czA9c2lnh6GyR?9_YQI|W8O)^H#w?jugn6|ZU>$Un*0;d{oJ9b}*mx5_fLy~H zM$%v;&vinfzNlXZuuD0F?xA2hgs9e#zAkoYJUO3Sjr8sbM_9}*%Oy9r9Q)&YB^Pj z#V!e`I*x^KW02KM^1bWQ*i0!!P^^mEI(=fU?UBiTMcOEhSycqR-6kh9AwM`fpR;S9 zgPJbilnvqgqk(iwjFyfS=xjg$`|DfHQ1+xH{FjQ zsOpE%$WV%aVlgQjj1t&22j%zI;Jd1FafMy4e65-i)4Y3|c872K}JR^hZD@#Seh;6lwhEloJ}mpPU;Ipk<>@Tz|FS2sp` z9`bGSm1ihGVy8N|BXV9mwqHNMaKe**J#xQ!k-^ihLei-RIw4RRGNRsdwK=pt`~E1Y z#3oN!&ki$f)ZV6a=aOnSdTjjhE`+do=E!sL*=rL5JQ5|Pe_%7!nVg{O3nVH$08G0`>f9T4H$Q;VvapPQO^3ftBLCQ;aQw%4Y~4oKmXFYZL#21Z0}B9<@0G(*(k7b zQDccsawh40vaD)jt3&rOOk-#PU+cJY34WLL#_oCy`Obk&iR4$5U4$P0 zl9)!d7ZL7xlU-QnFK{iQH3k6uX5*eZtoBe~UA`pb2kSi%Qz*g|K%YRo%vO%JKZ(#M z)|V^k5pgytkICX~%uW?AC)7zOA!_kL= zYCOuCj-KAJf++roP(8#7gK-*9L*&vf{L97gnyFeO(sc{)cZPADx8meBS^7*<6||7S z^1<05{EUV^R=DmaJa$tH!^HZZn_o);Q`MfoOF7@m zdJ88WmaqAL53h>v^s3Ap+ReD#&cDvOXtx~rYi;STvOj$!wA^OW8%Ogw0=W)*_5Iw6+ zF6=^ztkKKztBs^eD<+1kEeLJ$SqUYp)4?o+wM;MS#&kmN>j~RmUBp2C4vz;XKZKLu zyP_f6!Ir-8;o->VsBXMTx`)E2_;qh;Ybs>!G&GRemZCMUJF}TyM0cq83Q5iQ;N^Vn z@_sX4Ewe8|ri%6_Sx76(0`N|t`nSWEVVslLI86{9xF-dwSN8g~1Bgc7(iD>s1F&{8 zey2`Hv=uHKP<nq|KAWG zgg~w`%4k745Cm)q${m?rti*?e*F9p?JrtNhe;FMvmsU_HH&Ype3UInl5g@R``oKMV z0E?rh%UA)QK33mp^``Ylhlf$UavyCPgIP0W&esH}t$25vh~uZHbmT$!u{uIGeY zipRTFh@fBxM6e+Y0GMRZkJCLZDRVUlK9EO2GZiL6NRmR9#aQ9|K9Ck%-=F)}d4?A6snY?xSftZ^5Ezf};!yq{T z51{NYJxPNF3LYN&$i1QV9NlfTSiT1Q4v>KpLeGGB(WDua7Oo^>zz1m=_NC_IOcgzj z5Aa1)#-WC*?fGR$bH<7nW1IVVz*t1Nh**h^yhpoYciitFYQRXqi_1B{`~@G;(06HH zVs;5GbML_FY|N;-jQ~k->KinYz5^>j?b4V1s^+Utg{kj2I~F*Kk$%s(SFL+bT5$Hc z2tgDmN(_F4FWI(oLg6m(U>midmSlFQ#hrXSUxZp)p#DB=8|3sA^c4kxkaA~TjS4fN zY^GeL!m+o))UBi`$6gOt|pa=?wY$w0}9#MeDQ(_4{)O#}Fy` ze9|>m$HWPMiGz{rQD?Y>>8J(FCF;a7VdwU<&+jV(hJIAs?FKb87l zeh2pd1zF^O$fIbcjcTM?b2Al^Npjpt&CF}hf6=3<7FiV}oyjJD(W9Uc60P0a&9YuZ zB7p>W_;^q~G3cKBe310N)7<2Hy^q#0LFL*X7hFC-s0s+yq=Nj|9<7rBQG_p$P+Z;&=76 zKwk#`u>aEfptWNuUG+-cXZt;hbl019rM!)!Ka{gFKs>K|~b#@wkTgXAN z|3_PdC_FM4rK8BL2s)x*XMFp7&Y5f@GF+=oO3NtzNvx*27`Q1*rc8Ls$fc=DwP;&`fN&aEkl;rwfJRP$LWUf`{EMm$ z?Z`XS;oYTxaXJ|KUuy-P4tstON%gF}z5>&*Hnk`|!WOH-CosWVLDy{}oPS%HYAMr4 z2OKF0Fs=#5+`T?NjL%I0PFb)z=9V23z+vkv=i!Dh9%BG5B~cLn1c8i~A5d5*!Qolh->X=Gr7Vkr zSqfx^=qN#Cq`&y0g&S_+9EBmEl;g&HNPDt1&1mV{s8mv`^BV6|@*bq*O;X3%3(j4Y zk+UlkhDfIE+I$FhI=KStgVWl%8T;W~pj^2p2i`J}iqI01Sd~dk<)y_RTu_heXKh7; z5r2N0sQtS_qhSSbl zOT3KVDjdrVlG>w?@l1)mD!5*m0nhz(Vn6uGVLYzP8rl!*{jtQrWtl11ewGVv&IR0* zZrOZA{q)lVL}F+tAI$OaEBmNu(LpWW+Qu?XZ&WrI`&z?EgXKP{q1lF}AL&!QAL7oe z9>Uqacb_~zYJrv|L-c3M8gYz}7fqbcFBW$R*QMDO%#w5$b_%G`h;+=Snzuc$pl2J# z?DUuj5+~mwl^n-m6K`ZPbuBBWA%6O+MUGoqeBVu(5Q?cwkNq9GBE(9?N+o)#^rJq$ zfzER4fadTJAhTTVeev4Dm{R)rK-89-+Fk>PK^j+7F@&y~?*;+iOB6gALt+2|Xq~+{ zCJVLTinVgAgQ7Q`^e(%TNa@r#Bz7?4B$BJn_bbMcnpYN&XlnD2kSUiZes=;`GM6X3 zhHvp0>EhQtk0iM(Hm(BnKbi!%QNNgII8c73$e%wVcCSsY2kzol&cYkJld@cAE z;izb$1EfG}O$BwKPM;B>9JU5$ReW}G3^IGHz3K?D6}*7A@C}ba+FIO}lX<6{Fly=B zUPB}Rrh%@YL_P>6j5QJ+W_U!EsVjvbvI@FpXcMPG4m*tW1F}AOjkh!oi9y+rQ1~Ou!!Yuv9=oomSD_R%rI`| zgr=^Uqph}wt}|g59Ai_9E12ZW8YeVgrORy2ml@fq(gwt|BHwHfkAxv-bWqDi@7pNk z2l`n}i)qWwY+na}Lv7~e19#5n739jaXq`02vS;>@=bf;4mlmiK1SYhD*Epb8T0x0# z;oF}%fLw0#=Pder0(ejnq;G_!WWCA#wUkvi`EQ^+`3swWsUGt`YCsqnIRBeZ@c(b9 zANil{MvbGP!(ZMuDKDx;RP*>V!cMoCfb^qQI4xFUcbwl2Vc4>iUWd1f<`mkmEZ8U=-NEMYvSXGaf2&43%mz2lGlRJl7 zYG$Zs+n?%h5X?0RvCIULll*?E_=|(aHICK@Dna*b_g34wxiF{^yNyndbj0jplDIXA z+iVTIBpNy%<*i4o5WE$|HhL38$kD+*d{t`ru#%3+q23hx>u4pD6d&!hO6J9&@T2Tu z4=`*w4Z`eAIE@Mj!P3E;&N7|k7AsGl7q7MUEe)P*(~ZfrSdBB8c%kr$OL!+iT8N+~ zH=og)?0LfU-(0f+@MxjmJlN(QP_C54Y@KO7HCdRZ(PY78>L8uryh{~yeH=CKn?<2& z{4)bViGlEtT;EaD!kK_ZY8b;!;%}$16D0Hi`P-U0m|QbMYJp|6rSW6Q^_yXwck}7R zG=>FyfK=8Jmkwpxo9;aRlfkHD{HZ$ZDW0R%nPai<<&%1CImQmZid0Idk^)%ZE_^*b zc+$K!ZB%!-v(8YE(MJ4pq*B1o2u}db07JBYfmY8#)pN`;K_ohtS9g_!ncLj)J_7aW znM45#Q2OTygD9KB96m8qY3$gbDN1>?>-ueW=V4qI%0Og1jE(;0=`Mrh-EXzEH@)El zN-^{yAwj--tUlMj76fO%!zC7@42A&GpOzLA)f z%3XTCKDfi3y0pej?CKMnPigS=RY%i4?x{%kIn@;f5^k60e;7u(tL#$^_!@@pUl%^s zLT+INEjT}n9!QuW#PF*E{-mf2PijeL*>*%E^TL5>29|8`a&{|!^6=3{J_;13Y4saM z>g4lYXGtVGYw-yO7*qYEG^aC?k6TAlr(5{ID$UsbYs`RgP6LbxD_v5zZ#eV~WJ?eb zW2;1zUS_05NT>w6EeUsb z&2~NZ%GLeD;Jp+gub7tcG@ngMfKnT@lvtK%f@n6|#@gTBN>w$hTf8JUnd(-hGfu9i zcGlGH!$?iQ>APY`T7BN|2a@=j-m_Qw(R{?ixHLGa=B84WUsd+XQR zBs~&*iEpwEEa6$`drvKHm+f`SAWmX_`VoM89Y$f>hRdpRx(U&ee0bU%05fqiuu{)F zFpS}v9FG(3-6We?$^M5v5jxXUnh8mee0sRxhhsOtv7rJ{|1ctMPfo=u5n1%flGx+= z)`elQoOIiwKBHk0JF=_5;5y5z9WdA(ZofThe=jmdVn)Vqo!RED)r?RCcj#i5rjGta zEI-}AZi4I)h_YAM>_r0+{9P8g*TbyoSKUQLHg1Ceq35P<_f&$F6$3j-yXso)+_dEPx#Oei|HdC;<23_craQ8NTM>oLuh@_2c%W@8OBxXp_tqE2Jb z`WYelM3HuEnTQRYOyq(t(IY0!h=@u3(qJB>q69a|7~s!dE`L;s`FDQ2h2;Xiidx_f zr65;qRjNQz$7|6xb=MYIjC$|^im)df+_^gwQ+aTIo_{jSdmRjbp_tyH*lsIXhCtFH zk{MN@BX#&Wnp?NF=PQGC+me^PR-mSK-EP1+H?faOgc$C9ZYTgK5oijbj8!+;+(i+a zBg<;`zEjFktB(;0mk#s&v)JZEW25n10Oxp=rlE29>e8KhCasw_7o)mL#=CB|Z7RVtV`*lgBQ3m5p z(^N#)1D!Eh_|@V>gd@T<0=iZDC5^Fet}@-X~hW)hM+ow+5M}m^s(d5g<&=ULviplZ}3Rqc_Rv zoXdm4654nBIWr?(JU2=z3t5PN@5yN*^8y|0Og_nXx-7ekCS6|IVG#Ej1j zheI_Qxcaq^_{SvgzSv({9^f#gE$%@wY$IdHYmnXBHs(>QeO01l$JT6DY8^}T;?4&$ z*jjMO&hwNPlHO=k?H~7bP}G5Q==Qb6?UnAp(Cfc@9NvTbpIOzeMCY)w?I*khxt`!` zsYs55H3JPwnOr!&lI<5NN^(8ZWU{(U7o-}|Qq%>{E$~?7rc>>k_t@v4#@F_{i^Y}! zX{8>DQ0QX1{5-i+>MY0#Wq0!VooS~6;{sz|f(G+!<;jrgCcrW~-7TA}Rv|W|ioC+? z5+Q2tO|6ufcUtK^chWKeVS1NT$gDGEueek(z#+3rI1aR@yC0YhC1_glHCOydjb9;) zYmiMrAM=xRG~v3azaVZ7S$t~~q;bik*846T%+Yi7UqC%s1G_$s3y3)`A%3%iXcW!7 zbryvL!Tf|e3n)0dfH(+%er7I=G6++EGc-}(bMPtKO3+6-TewJ|1_}rwY&QFDsUVGM6xSk?-+&8ium}+7g+z< zG&4b+z7G`q#tm)4zlD?a*!{zX{Jg6WbkLcoJW%;?HBb=31!w#koMN$vM*QyXjhZNk zLkhGh6*4ZVe48;2QL_fP>~Wp$sX@e4Mc{+8usYMbiJ(q>?7bCVIdR9q6g{r&a&EOz zN;8llmo#^{$08+)wh>IslSa82W{ql|WP%X*l6Nabw~x`I37NtqrTC&hfZhA0$9R7>}2*D@))dT|R{=_MJn_1bIw8JU*vi^(^1$G|Gb#J;^)8 z4dpKE=u7p2n%?0p_M=Us5`HJ9rMc9)tLlT84Cc42yeirDM63H6hvw)@qH$Fhm@Huw z`u2I?F0jTwEuyekW?#URaO5c#X1@2Am5XIn-gw3WO#W85txjzX;!H(p3>00+Tdd-* zvTMT!dwEAbl=(;yxel*bG*rOBcP|5FkqVv!3V{vM)N%JM!NK(oPfv;FqPc0y;RWP$< zNxI>O$tLglAU7XHLF0x2!hVxY2~6wN)q?98SFic&3dN}v-%uCR{4dTkEZ`N}E3+%G ztwh#4e>|aY%`V0aI}NqKM^U387AjS)8+SbZayu3p56vhCk0f5^w;X5I(2? z!o;Eetq?vMLN+e`4xM6ufLE-8Yd_CsfFC_&wLh=w81My9EoaB8GiMHxCuPhu-jX7} zx1L7y(WxE@p}^Od!FX${qO!CxZ2(|U3~(k2!~9i5sX}cDAJ0u6-}l|{q7TLctsIcR zw1_Pnjf z56fB8vntq)+lxw`+-kzgajq9R$irIo<&fi&hcpPvVsH=a`~9VASTz=rxXnF!ASOjiRyXX3C7P)RH~oxJ0-f&@qXOM6)VwF+cr{?D~XeaG(L zZ+5w_k0|as-XihStLw_JpUoOL5^zepmgBDh8p3>vb3+mvrmfGXn4-(|{LxcBQ8Myf z!l%%p*Inaw&7o?Np!N2Lhf(72dmR|d0+Dfrgs@0cA|i4D zNE~OBhXmfLmrqk934EnznRI$24~5kRrLnfsvRYDm^+gbRjSNO$##WY zf{rFV5&J_FBZV=(&M-A%15czuvdkf3fr#Iw8LBuT02=^J^g}-F%usKUN0FO&mvSq| zQdV=Wr%t_Je zm9sXBSyTkRml(ZqI^#g|J7mzF;`})f^5DFc0Rw^<9f-N&AhQWfb!vYKOUVjnlJduh z87arfz)s~^G?lbWZ~TCMt8X(4XiTMZS(a;P{9k;KOyUc_JtRVB4Rv%(nBcF@BJNh# zGf-zKgJP{jp6eF^jMU*QX0$F6&5Ys(^l1)3_e^;LmDjEQ^Q&djsb@! zY?b2(46p}zx)tW&;Xwb#AtQU>GK>Y;WDg7++8RftW^9C)QA2yBBgHoRqd}H?b-0m` z`zZz>9Jgz&qDgmHhri~0W=S0mxQ3uT_I!V{_%4Qkf=bKfjMCT@22Zsvst=hW5)(tL zAndm8U&%ImTx#x88U*lliVES;kaQm-8;x{)Z&!@Ewm|6b14^Ta!dHwg)2me^h7K5V zmO`eg0Be7{8SuBxA+Cdb2Z{DwMsv^agFgjRi1wZ{dMIeEUM!*eN|khtb0xwo1=kL? zcY6dBS8t-K)K;OXxU4^Ter0l~(OCBKy3SF$B{3qP_vzbS*lMAOjhK9*4IU&tpePK} zAkL}g%%19pv6w3+%i!}EcfG{(Z+#B?ku7bkg(aLeC%Bn7Z*OkTtOKG>L5Crr@uVR{ z?W!*)>eQIs`ebYzf`aZKlyAJbb40t=Mt?zQ=8Y!k#}p~a)6ev{)e#T9P-AV($%d`s zBMa0!k};7mMIraixe<30Gm;&3NCt=#7)MOgKa;#J@v0*y+s&Sy!u92jLgT57)iv}N z=_sA^a^)@9^=J6?ymrH7Uq6Y_d7aj#WQpFeU^k$+Ep5g|Y;KH0XZ->p^m-dCYYOX? z7#|Sn-F()j55Hl}Lq=*)301~kRV)BiT3%d!Rs6KS$gQOA;IX^hDi(K@9T;1Ex2E~) zj4msCJCZ_{b-8SeNY%u8ByB8_SJyI46-*1|Ef-be=vYeS9a;^Gl8L`d&6Fie;<0e~VsJI#&X!~*4oEmrg0X-BTa zC~J^i+*2_plNe27lv)x*4`Vhe4Rsk#mo0-(5P%baho=s++ILSMB)cciH2Yy1JM1K$ zHc*1WbkB5`gojs-4~ToaoNhO=WNmbR@xJwQkN5EX&sqF0(-!l8dwTza>!pvXbld?2 z!e5Bh?E-B}57=jS?Q+v1-gENCG+wwc(lVPnpxfe)FErGmq{&P~;kJs8s>&K=Rb!uC zrTce>*V}=(vboP%Lab?*@#uPWfv)5^;RbGF9%ow}sEx$zoqZ^^*RmNJ_+0sY2sR%y z`84*XcBXzYxA;nvK#IIAiF%PlZgmQI$a8)Pese&(1q-)??_#9w>4+Q6oOHt^LiF;H!fG6%8=BEvB@IJWG&e;So2m!7dbeAHaYnUC205C!vre)8f*I2 zbWVageb}+<%M2;0Wr3$4bSJ|@xpN!*Z|k@~8lDb9u7 zv|6L}1bTLL>Mj5@%fW|J&05Q=U?oi|5l4w3Uv@`i@2pzfhvx@vTJ9FwDO^eDumF(jjHi@4Y6YT-_RsVgN&?%NHo29kVZr znD35(EeL5MPTEkiv&xUZ5<@_)saH1PSxI-W!Rj_KuJvUseV3Pt=?z)BL9lOB(Ioui z%)3E#yrU}IPD%2FhWvjD9z|_J?@=jRJ257Q^C1glgn^hD@|o7juQM8?7znF>86O4o zpqqbF4vF{=h{`GN6PquO`X6C$KUWD4l71-8O`Y$9K}u?%=(M{SG4C9338Jy)Kk%lO zcxY@!t77220#8ShMf`VId_ZsSrYC>rQYa&{gul zm})KTbJL&iq|55`8(#EXJP7kM-#Dpyno9Mcd1q&}nJr6V^Pks@rQneGp@abT^Otb} zbNxg9G4EO5nQcl@f}eV7|Cf&2%_#3?iH%rS*EJ(=s!?9L5*yEX+l~GQxH!z@Up!t$wtw+> z{}%<5DeAKS)j`~IqJCOFJxn9%!!8MLlPTvlUhtI5#yOAF^IIjAr?6RDzU=D?6hbK# z#U?QpzE}Xk9V9?J9ULAI-q&M5{UGiGeWyp>gaB!Di30L@j6f<#S&p=Zmxyr@5$&Mz6)0d63z;7*`}c1wnGfUz(guRwFK z#JsE$4dO*(%YcSToK%8^#Si}cj;pK#1oTmd22gV@)}biX266i9ZA;OO1H4$bYJ+H+ zV#7ATJTY8alSE5B@UTV+K}SD^lXMJb-sHv-qH@;)SXSgk>^X;5t)~L$_k?aFf()BjEXv0SdrB34zFi zuCJ2-+q+lxVpj_t{Lv=5-;g@ggj+9%8KfPIq<}PQB|t+$hhscqmr1?Rc;ef|N^ER=>p--cg^(zAB z>F9UX$nnQGrQdt8<07xz>@e~g>#ThZ7Zy&wuk1)fXi2!fe0zKwVRHXUL71P%Ih+rCOrrW@*`9S$5} z1VWK9>F`SpWlz=GzQ>n%8oKyfwd&auYP|l`Wxl%e$H?951V;CU- z%1=qaJtS<-m^vE66GMAzpP$PKFqLB}x+8I6717#Tv%k73N$kjTYuiLSe-6lYjq_Un zfrSMiG>G_^ZMgwH#tETzvf(tx@>k-B8cXJVL|(F!U`Ir11uBRlBq+mUrELz>lR-wh zb4Sb*7?{B#O^n*%BM+E$)`&x@q~z|r39Oj`!B{>EClH7Y5&K`9zUyG4Ff|oe}{?xYk%H#7l@wV$O)OEAo5YM2r zo+8KuEZ=U8t14A9VGOE_Boaz{7`dPOK>q>cD_}-L3vrD|7gmTh+bsON%sG-xI2)6WhxdNzWxtu7 z&bTt$Js)u2Out$_U4OwN=8?+05~bI)HWB2C>M-!jm{(c5^8d^xyC_TQvOTRZ-M;Ch zV*V{Fm|3(=%ahSIv%PU!X;#(L_tE4`WP&CjW~_syeM)m|;&%FwJmIvd z5YK4)ZRE8Q4}9=C9-!kcjuiQZlh=AYi9rY;VJlNioiq=#b4eBt;`Z%fOLI) z;lR~d?17W7n|Q``a8Dr6OiQ&y+6Arws{s!5mRs9Pt`hE}a{>p_uacWc3yW zdQl?S^vMy0zJuyY4Bc*H%pB&hK31r4v4-IN0}8|a!fCWbme|Fn5t0m|G`t#mHY`Mn zqYwp#ct6NP3+NwEIe`J*@|K%jL|1n4S8H8{lC)|BtxpTR3Vv&UdRM zWCubR9J*{i+1-GXAZg1yf$``;1WjqI=f=d4#)bgp>B)JwHM_W)nIdB7q>9ao#T#?0 zBw*+Zv_@us&;5v`GG7LpYl6}j7}*vtdjWNBThc;$rC%#Nl&ZP?39zc@Xh{u|ybz*z z-SI@0@W~n+ ziCyjzl#Gw%(lp2VYn(wr$0tZa&ij=H^zG9T4$>sL_9Z*Hh9L=dgBW;i;A$u%+{F0I z4ey1jMepWUM00Hr{c+RX2__5KkpQ-l0vIK@;rsU;c*uNjX#cFG^Q3*O2VyX>#NxuT zsuXk|7&@O-6QCz~Ghs_rqTe^H@J|Sx#89@>+y=1E!I9F~D5&htZLIflRM)|?Bz6iY zpld92unNqekM;AU{4rp(mOXf@%+<6%n<@LaCyqEIp2QacBkT-`zkrS@+7 zCoDd=TY&*4Z2NSzm0ZJ z&D5jGG3dyjXz!*d)W+>RxHbCgV^e$Su{N!C)3$;&SWNodilWR_WGjMd!wB|UJDX<{ zjjNz`pTDYCfkRXua{ie)$Kf>ZTSUjb5DdvgwP#j25D6gOzJE}X@%92q_?I(V{NJH5 zFHefcVs*Rm{1L_xQoa;RJ(IL1+T2t=o2mfgcp2yQWsk(P5+wOXTA5{2{Lo`cy8v;bXos$~$w) zz0rdYwtV-o=X3GQJ_MsW9t8mWiHqh;>F4DG$0CQ_c?8nuCziIvK7@<=DKW(Is2kjR z_eE@v?SEC6BI?C^|8DsniihHA&)&?MeNFa#I`~rM_5+yE^waoHVfx3<2S!%b|3xN5 z-|6oa#P6o;w#X6PX<1+D;&+(smTQ;ZOTCGggcJ9=nYAwILee2e@7D7gI6^)xXXFMS zB9H*UCnAW%#F{6WIe%XwPj8RM(~NvYCS?M-C0mzAIwj>kOKwR5lA+SHty)u8K5OTD zZKKzcFa3_r3^OLEZb$9YMb$@^zWIX?i6mQASOJ8p9P_se5~ta3S5vCY@30EBM41A>_Ht$&3I&mfCmzY+LR1*Uh=Xt(BlXo{FrFPQW2p87SX65=+1k^E1iDriS!yA9{;N(Nm@7PTqh4RGPp;k{fF4kx^=u2;c zf@^2QKE21-hMQ~er}w#a8d)SGIUoT6O4BJh9$Sl2(xr!YT2FeaABZFIoLh}~e=xK# zF{mC!#CVq)Di6WV9?_ZIm*K?(EgA8l} z2s)ct`as75i~NEZ9zZGS7&n<^Aca8&%yQ57FMmP?2F1rKKP1gBR4M2A!pe7~1f)Rs z+dpu7)d41l2iASU?$WmF_WqTb0ys_){$Qcrxw@JS?w=oha0g_gj9Yu`fCg3?5Y)wj z>nq9RfBCl{y?3RZl4hP)QbUvrf7o+gRkYh@&F*$S4kgShCNN}+wF>TcHW}3`vY8A4 zMp=Y{z)l;JP3Zh^O%17pVlqmJuPJF-vH_|Nn7&s7VK zmlR;1m9AQHJLu!n+|fx3`bO9(2wszpWps#`!lJ-w!0+y;hVdbDO)d`;r~N zb~iRmv)2$9H~DeupnNPRX?I2jORO<|&}VmhQk+qa+dCnoe)YOJTb`0sh{ z+T6ja^1VV{EJKdm&M481YM2JR&Pq2IXv%J9j^d)aIv&K>d8tx$`K97$LmX40sfUSO zvcKr|{A@f=v&)oH-_HzFXGxu0EXi{nI$Z)SS)hx=Yo`phf`k1(z)=z~WS#p`2<5~7 zUN+nw6)+>m#Q0yCNzn(Plo5UP{>We-G(C4QsYOpR(*+2jW^j;-hRVgwQaOcT+}8i zMmpLMKU^V0IY^rjj^|=ror9Y4j^~}>KZSGA5lDRj`L8QE0a$u~Aoh$$Tl-pGb~_aD z?ajw5Oeyu$J}*$n^7bD~tZYO~7_DV3Nl`#&t*u5}ShOtaCef!=M`$j*-LE6hrB~Uc zJ%1cHIvL=v@zanZYT0fNNMo9;bC4(AQr=ZxNLA9NBBzQUG`|FD_b{1(*=l~@Jsrg5JnTDeCfy{t>!*6#CGe|_Vs3CY6141V zkNsVBmMdjX{7Yzo+or-%qyK7e2n46Q`l|pQnPP8+&}MB&?d}ZkbY}6HsT+VE6qQgO2Vxdim9{ zw@~}08zp4n=g*!h+ysB>?v;{33A&;q*WsM`ct?iX53qM}?4N(t7mj~wm^l99Oy`uw zmfc}9qTh>N-U#ci$=erV2{?<0W+8td%3YB;U06^jwbzm*soH$D5y;q1HfH>Mgw^}y z@in1be(9dQDaS(wW&~ObDDAhe=)pr|MFZcLOjovKF@Oyz-yos5S$&(Q?mg>^JQffZeqv z$$SKT8P7KAw^r_rIz9B*#;ttXFi%(A!e}YkBkyjbwPovO!Tb?FQc$M9UARpSY#^GG zLr6n01DbW6&i-^A!yKy--TuG4YKa_%P1du+azk>ST0U%h{!_; zm=@?LtJiT@6c;C$-j5|TM^hN+I?hJjALhn=-Q^lU`^_?RQ17T2Ja${dEg^KfvK!cX zw^leVDlq&{pxyH>21AdJ55i`dV^Tz*6**^o`o3n!uM|Ah zV8Z!8K<}rq4qNDR<$$95P5fx!y&dSiOSfmTnPf9<2SUDII(HF;7GZCJX7*>Z+SMT@ zq*G(AvsfD=zfFo2lwmJ_J*pJ{gb)D)J(9oI0w01SJis3%l0RJPZF zy3yrZ3u07#%{pW3(v`zjA|P7!IWs^Xy%TR*wmw-m12Rppw;(J$bdTl8c{8}oXLnT1 z-&O+5k4F=7yBpr@bM=xUoH$C%>8l9SO+jjk8xB&YE9T(C=cW#{WVVlIjCR)z^`ukb z5y{ZO^O>H+ZlD2c*pu%!EKB6UEMkiNI{t{rw4p8wsz?G{y?Ca1g$yf<$q&MDSEl$0 z55**CK<^03;J(@wgX+;U(It*@szv|0%vz|#&HX5i=GNatkiPSbOl3C>dxx;L2b4(Q zIAx~3^UBh;h<+<|7(*)W)0T^e4*Sz90vP~nEOT%N%D5S~74e7Nhkc``M`JA4P}BgQ zV|iRmbA{T;t{_^V{S?IzJQ>|G<){FvlQs>}ADvkaqF#0Z837}Yhk;26Vo@e|Ie>D2 z$=DX-$q8$;XYnRegbo#$I%}$G@y{rgLbh_s9^ad%}VeV%Zsq z4?a$|32QL@d_cXkbEK#e*iL9b;=I_Neog?ATafngE6`VvVP9+I0of?7n-L~$f5=rQ zwD5TtWDZZC&2Xl4P97l~06G*^*#?bY*>wPke7)XP;VO5j`1OXI>4+DL#3_aWw1{`z zom?L~nB~&Ys`ljJ$ep{YNLAK#YdKvWQjxUY!MQ{TAwyl{Tj-g{2lhHj-fqt`^8PvQ z0K`zA!Ppd2iK)$~oO-6|{GaIZc7j-GpeUH6y)Ug#sAtx#6V@V7M<7E;sYU`QI`6(} zPb$Z~t;D7tj9u^OswpuchqKQRykUzg9&edxsA+kOiPY-7(8>Aak8~u7^4HEw*-J^;BJXR`Ra!}S|oPwp2UornCp2Ch9 z3QY$L0+?MbWGacuq(Eb#ALrKQuPDK@N~b_lgy-QQ%XlV?=LNNwxD6Sm{e8-Zb-Nw| zuKNLV%Or`yK`^onqkm!KpF$iZ=oiM_WZVPpj(n>#i06(BMwusDn3qE40<~S|s(Y~j zbu7U?E{K{)s_7>wrbO?=@&F{(kTXB0duVojfZXX{y}c%PU?#{P*LzrU*TCWh&7mT# zXa%Sn{NiEZHkhR4!)~b8+hj+FwQ~uZmS8CTets~gQMTxKtZo+;iM=^sMz?7w*`0R0 zEHWGmxA&OO1<}QZJnOT{B2z*N ze7p=VeuWVyRuL?DxMk{n}Nrq40%^ zATF!xMJF@|q%~DYKUsy(=5*Gjax33Joekl=F<|r==DGAk$}<$+KLA$$Hmnb*I=4Iz zAyE>sZ*$}b2No1(<+~j%@Wq2>m!9@nM)oF(_iy@DV1)$&)xF8tlwuC{727!_YN+h8>;X-XUOE9Z;(eOGP!l~ zi(6weT6S^IEbQdxxsCPXp8WIamf?&4H;pde7y4n!pkxePPhMQmJP3E-AT<|tJSYM{ z4`2+WiSIve1pjb0{kJvYKNxq1sEpZeFd%fDP&+$AWsp)zqIBRwv4DD>j&YI(2uw86 z3M0YNIt1o_J;QM(woqIN5O8{DdN4nT&zU37oqnLg9<01AePjrW#v2n!6ufasQYt8m zLZ$>mqE4yJZ5fwf>!eMyTs_egdHlm_i*&;eEEZa z@5*l!&lfqVKPky=wz+3`E1di(lis40?9jNx>TovmqjOYh`9?U%6i@1-1k$-R+s&@FvUdC(^6hI(PMyG=2plB*TzU(Jz!8honVU5G6^dvwDky-g&@`H4y5>R^z2x zkZ57$2=Gij9;>u}DxBDE!>efZ-qj--2?v9jXQc3X>0XCM>6~9Qf-z;R!5ZB2T?{9AkfjjeCSDrk~68Zt8TAm zm)Tl;W}<+$1&yW6!d@LQe5k{z9wz$>sxCYrs^t8+z0ab0qLbdGHxp#+V|*==+)4fe zvL_G1p`7m2zpvV1kbuEqz5Wk8U`5h3%XGxFGHqenD4`4k-ADeV>9uC-5*E}^1mnC+ z_3m%|FkTPNXcuH>=o@kVH^l(Gl~l@QzEC$%ENmocgq9t&H?&-3X{s)0DhatSGREHt zeOC|S`j9IWcmP=YmY-gJ9nbFIhoMA7H7KO{*KlKfJ? z0B^&Zn@>Hj*0(~lsw`k^^HO_54FySqe9R)-2eQcZk1e9iMJW20@^o4Xt`rk<#y~n> zo{Vf>o=|{6;G(_o=;%{o(_6*sf^!nktN1`y_E-tykdnSLWWi$W0UB?e6RDkBU|dQo z{a*k6?5pQdc^GtQ11W5NFdff8F7N0(`aTbEJw^yYfqaZ%UPw~$ri4S%nR(q)HQzw# zj^OS8`UU?A(*6$+2ouwPj#IDFkV-gcM*J^~oPt)9;4N64)=^LbM-qpt_A}0Yz0LF;uQthov)t)L$V!I!whnQC5r;SiXsTID(nSr{BZCj9o3;cDRrkacxaY*cO zRO{ZT-mgTWnx{I&Yu7{cWz7p-05rYjpAcM7+5eM$glmQMXB}kjC z4_H^7x5d}8j%pr|@nXrCi;9tQ>X%WD`f&~eRS#7+7e42wD~HmJV!yCJEWbj1N1dB; z)6y{XpU@7-;$^v)r)OS-$L}_qj6AEC56hDsyMg%mn$={Xr@E_i+S}b@_`eHE^M6io zVuMB6W{V41ERjbBCV*|*{O)RAjt<0~|7J1d_Z{NvS;Oa6gmgk&ek8afZeYus+{~E(O$KL zelIp+bY&vhmPjSEv7t0R$*R*_DE$W1Ty=L_spghp;0iy zy?UB|4Qgxn7C*+A!xp-}KR=vS*^=A&y<(tU0{3vpdZSw4O;pp_z3hdzuN`t5fIkK) zl@z*m62_x3>+17*hWrT zcG(HTquxCZNdQY>W2hGn^N|kW{-gN(G!GP8HT=MlBp}MhPEwZ~!@|-KNo4r>NjLym z$?m{2QAw{Yot7$($x0@zKdI#SW%P0A?MNI%{&fhU&zF5)2KTs0@PolW2e)&HS6sWi%K&gqI2R6Yfzd_*P$s;9LwUl zdO!6SbEuOawLW{fF;;Di49_7vU2iLTAnR(DNT7_Kk)%7A1_6&!3o4>IZT-W z=xCo*)A6rb?3n050M-_rX>OP&fx*LzCOPPdGIwqRjT${8VbAc)yu7btH_X=dGEm45 z(<7Z62}YsDFp{(-0MdjhB~1c~aSM%5FU%8~iS6~gMkq@Bx@KyF`m95{3pQ*>RY2B` zqAaCfSjZWJgOMmweXSCYsD!PWPIT|z9>q!4-z%9j$n^=R=L{(rJ7$I3_E1sSc!f{~ zFT-kk`|%Y*b%kXfS4ihp+F2WeOJ07iEUoNxC^H*28&`r-1lmbg*~ATV_?|Z~)wr3+ z(lQ90(nYqzi&&LGW#+ob-pOUihh7x5T+PDN84NFwoYe@^GXFXq5gzfJfvho+P_?pM`( z+u^(xr;IxMD*Kl^G;%CYrhTdQ^Jm`gxmi4H8Bt4;YxYzPlQcmf-2tl#@KG+dS-ml< zX~@UJ7oIH@awr@$CC3{RQPOjoIVY}T%l{e*c1Df-xN*Em;k}y+VDgSNo>4<7sL;#2 z5!;{;-@>17y$lbc$fxz;GOL5?4bz4QUm&|F8q&`_#Pwq?hNYREo{iq!-4K85n+R^^viN3c?V<}Ka z<6lKvi{I=!iZySakjU3_>;+?ro>d$CYIp`yBY}-wJGZDH{l`fY&_3*(V3b;g$TyJN zn&3jba{aeyz~xTb7C(d~BOw|bXlpo&HXzIGgbaF+43773H;je2BnPNO`pnaZ%Xljh zv_s(%;K6T$8u~R}vlZwg%s|#%f9-bdt5V=Z0`f!5?TE9KITWe1h&tsol28RhGMv{= zHq5vX&LO^(*P<*D5=myAb~0qh4k#iW!AfM|arzoQ;8;sTvRI~Moif#2rVRVi8P#z} z3LFh2KY7FFA*2aX62_mK5<%;oV8JPIwdJi$-)wq>CBW8pn&p24Vo{1Nq5x*v&9 zI#^K?z8}uES4>Xo8N^e%!g)H$vVK;DRE_C&=y8j09 z%nQ&4WbzZGy(nfea{(Rii$*~LteK;+Y+?^3HVxl5K3c__QMg>!@#baW!O**oyr6T& z!n&Hmy5!7Oqxq(1ruo47kty~CPN#0V5DGA$>2rY)@w^_A+?e0Ey0U&?9(f7F!$+-; zk0ec%_y(QtJHGLVrw0gSG-<5TCi1%`#-DUlQX*$KdM&rD?|;2%uN7f27&0KxMt}fD zh}L&Aw@1`ZCtOZ5*_iRBDGaeMM0EoT)9XFn<0^v>Hef1fpSxMG#4_;1#I!br^(Jga z#u5Zl%DpFAslB5V_-pmQ1!ca&IE9Q$C#uDZq!(Q+TQ}BEPtn*+w#K`>i&Re<&ix&< zS=243Vu%^w020+o-ELb3QErY1bL{)$VyBmvKp^%dQbYhimJ0{`>6ic7j|HY9sA~~> zOf!V*HLNrZID&ZLpb%oL-ObMA)D{&)8EPcv(hrpVlZ9hz4zgANsKa<+UW@Jb^48xc zr%*dEjs5SLvY`ImtuSJn-}cS`kYrmgN;|p;5Yuc48+bq#rV0AHqr`qOZ$5JOwar*;npDK0R~K(GfFJ;9y#wI9=fm5`K{}di_Ys8q^GEQ` z7fR&C$%HtM(U4F9S$JPxn-i=rCb#_-IX?UwJK;2=%=l6K*kFGW*XM;ZRfKRw4Jk)h zeqnUOQqzsxrB8vK^FDd~dE0V+;8pRw>HgDfWb?SR&twhCknB_bT{_aubvA3h% zvS~xI3N5y~Tt!OG_SnLSE3g-{x+9Z>R!5fgl(E6kQIRjdC2CPzx_VN*#R9j*LVYc~ zHic^@{6lkG)jXtTDg?P4e7)+-YAi;lWqgtpZ9yH&6w{b-i+Ds*UcLR4p~kU_hCl0h z8uq-zyw561jL4gEZW;cq`@MrwP;&c?0EPNUu8%6aZl(82H?MVrg>G8{w}v^ zX|RiRt`vGCjh$pvXbC~o*&z4!5hFcw^r~@XuP3)xj(dVz6uO(qcLU}TQ0~VvWfgw+ zeje#lfU;q^HsD|kmsD`CP1Q65>jk%3;^0}B=%%I7xerTR zAkt*W*PG9?CCTR2z;Q3}0m~0z zEIvWzes^o^K22A```+l2%ARm}U;Zk@sfKO`!nKLpMrmQbs!1E;Bp&o6CupZ+7!9ns z?spU{X|)vXS`C`!do}6Vhr=#lM6&O=v+%d>`_m6NAotL~2k4GbxciS@l8ND810E)( z|2Wx}^f%dd$OiNG$b97hbXAtB|Kzs=Z3orNP07+)2pU#3U2Gy9h>WQ84O?mnp_5*<=1&m2)3-reqcbHC{!e&9UU~;wq z)1n*}nuQLc;H_|PCPrG>F}Ad)3CkII)%a~+_gy6eS=0L0#=7n7GDp>1_FU>bNYMrTkW?lY}J31lhuXM!*&Rml5Zfog!BCM1-|kS$%R=xjnnOb_|r-?+Noq zf2@U~VIaeJZ-nPpv__wrjAqpuz07&<7f02s_`W}TI5g8|y*4&d9+5CplzWMOR7~2F za4ZL*k%>Zv2@-=QelwICPeqle@i&;GPDH|7S=UcxZOHHY$Dx;j`vthu;wtBq(P;{O ztx~`xizR(mCM#oBF^xWdSMdFoRP!PdjW4@0A;j0U!9bGQ+8+^*I|=GiiD=|ci7ph{ zgiRQo39D0U8&iRf+_$Huj`u*YPW^->P@GXoOPU&s@wv);oI5QdlVb#W)f?E)L0lXa zs+;R!7EZgfj!0iAgAR-~49WJQGvlpwq{V)<7eM0J2gvRMI3FDF&b(e{uoVer*HJ9E zuDgyp!XBxgH&wZmg}q07idb%)n9;)z+HXtZBSVfIz(Yrj1V3;pI|V%3`vAHCx4X0w z16vnTHUSx!mgQso3NO10z_T4@ThDdN@k*1ZS&jk?HF=m94HV;>TbC|)Ws(S z!usf98<+45@(PBX<$C^h<$pU3{2t4unW)3G;-uL80CNOce4#qFKW=N7lA&6p;)dFt zql$6EW7?0I4Mvfu=k=E`VAsBKi2MfL>sVu6i1pA{&GKdx2b;+(1a~U*0R>g*?!^s2 z2jS`Z#5?46eUsx7uTWdN9Dq&v4n+ch*3%}q#~mEu$%CopT%KN|=_Rf$Yzq|q$pmT% zg9|%ZG@|t8)^+$|69+D$tS1r%bZ>d>Yg;0yWh49-SG!P5X z{1LGRqMmSsS>~HbVK;FU7Fpy~vb*&#JX&iOl@MI-lAdEYY`TZC4VCKKDP)lzNV4Y; z8n_dr+ztZJFW^mhc#C!vVFCaph?xVX>LiD9f5TC?39#Pbmga5)Z#ZP&HEm`IzGKBE8DKYdRj-OB{j?PMh;qu3HJGGYx6v*_Z00v-i zK9l6~ia*ziN4u`!t7_A7T$a@zMQNhPoNpA6RT`LA6CfWSn}qwd4+=Oi43qZ4_sfK1 zgBNEcZX#&pa|30L#^C`9ouOGi;`?Y#@_1!nz;E=yb?cvpF9n{Z+2n6GEHvuHvX`uZn(Q5=Y@Z%3 zRH4mYFsF5Udc}6s)abikWoM%xf=Q9rmUM=V$x20`9xlr#tI>n=8{E`(7w+8%P(zEsl=5uAtol7erb%Y_&Grd`*lz zYPa1zfPKt1WH^*;nw##Nby$mQM@k0bx?v4nUG$br?JRq`+5gl@nH4j`WD>XChN8MW zbx_VED<3DAQ@JpJ^f^$X?=+e$ZGPa_4PDQg*A-L@Ke*e4W!;+DT^b>DYE_B3^kB(V z5xsq_TbqW4MscjcJPcLj==Nlt44)to)79Y##ULVvDaXSn{ASec#1w-39fg!3O;#kX zv`?yAr9+np<8kKMlg?DI$X#=57amWpBfi=4qPVzUU3Kvc2xJd;kx7qN?t7&Xp&;X= z2Yy_|YSMJBh0T%fXe={WS+PNzc@XR+DyA%BcR6nD)uY{X45rjwF1--s3#Xr^p0R8j z(eC?LQGf2KwRP>u{8h~b456SdB%Y~d%kIuK>PlfhSS2BF)2HfVC#dPRYrU- zTckHd^gC<0`?N#_(Nb>sY#!t&*I0sao*QMC9yv!Cq(ge!1W1Cik8IF>7iuhQD~Kh8 zVVBCVJuj8C@i-h1&SAGNnAErp&S^I ziB#FK&|LALQkkIdFRt%sU|l_7b_`=bf={UI6`isl#;aR9OLFeW|2okC0DCx}#$l#V zd=dm9LwGM31#mewZg1aOqR`QlF*ns-acDyLHCg$PV#OFvS5F7-=3wQsx#C#_R^(zu z=)i3!uMB{ZHA!9x)VbV3h4rI(TW;bE0Yy{gI^vys51tSPQG`!Lh12-nW1PXa9*Y2- zoC?~W-03@NKEhzyPc|u8$R5k7jwU)-Rji0KK3Wi*`;_~))cu+LSa$D`n1V-~FzKWy zmT7^;{nr+AZ}DbT{4jyL8ugcJ#U;d(KF{fUE!% zEBbsI)aYnlYqD?wgL{$)JaOEh^W6x8{9(8gI22HpM2wN)52-oBGxcYaSyyLjDEvr@ zS9h0#(Bjk4ubD^R>B0o*m~4wQ`46-6*XG)xVSbJd@~CF8TlQL%Cs!R38_wI!^lz4l zxCb4V9?EPhR|uKWD>2$`C*ab9);=Ki?8^R>&dy*R$Me$z7v%l7l%H3|1xT#Umy8^I zZ(I<>^4(#AYNlYAP+zt(`z8jP9&pf;xR2>n1Rx?1WdkBGd}WDVybvs3sN6x0CVC@h`BGJ(2W@cADn1-#k6f39~4o78o5CE6dSH4AY4l!kEq^uLj zszgG{;$`IZX6?of-z8hcXb7{D!_foCGK}itmk*WR#h+zC|%)c)+)v?CL-`toq zdD>AoDC0+!rkgd+g^@j9@ z?nQ~l???MEW$6-zwSSBqb7txs}K(r)zf7dH$-YZ+B5;U>9TK%egfA8SL!| zhlvox|3mmuSWgeG#&;);IN3trM1DB1vh!=M0}{)Nv6*XwZdU_-9Y